User Tools

Site Tools


haas:fall2015:data:projects:dll0

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
haas:fall2015:data:projects:dll0 [2015/10/25 22:11] – [In inc/list.h] wedgehaas:fall2015:data:projects:dll0 [2015/10/25 22:15] (current) – [Submission Criteria] wedge
Line 68: Line 68:
  
 <code c 1> <code c 1>
 +//////////////////////////////////////////////////////////////////////
 +//
 // Status codes for the doubly linked list implementation // Status codes for the doubly linked list implementation
 // //
-#define  DLL_SUCCESS         0x0000000000000100 +#define  DLL_SUCCESS         0x0000000000010000 
-#define  DLL_MALLOC_FAIL     0x0000000000000200 +#define  DLL_MALLOC_FAIL     0x0000000000020000 
-#define  DLL_ALREADY_ALLOC   0x0000000000000400 +#define  DLL_ALREADY_ALLOC   0x0000000000040000 
-#define  DLL_NULL            0x0000000000000800 +#define  DLL_NULL            0x0000000000080000 
-#define  DLL_ERROR           0x0000000000001000 +#define  DLL_ERROR           0x0000000000100000 
-#define  DLL_DEFAULT_FAIL    0x0000000000002000 +#define  DLL_EMPTY           0x0000000000200000 
-#define  DLL_EMPTY           0x0000000000004000 +#define  DLL_INVALID         0x0000000000400000 
-#define  DLL_INVALID         0x0000000000008000+#define  DLL_DEFAULT_FAIL    0x0000000000800000 
 + 
 +////////////////////////////////////////////////////////////////////// 
 +// 
 +// Options for list display() and support catlist() functions 
 +// 
 +#define  DISPLAY_FORWARD     000 
 +#define  DISPLAY_NOPOSVALS   000 
 +#define  DISPLAY_POSVALS     001 
 +#define  DISPLAY_BACKWARD    002
 </code> </code>
  
-Similar in many ways to the doubly-linked node status codes, we see a new possibility: EMPTY. This is the state of a list existing but having no nodes associated with it (which you should already be familiar with). Whenever this state exists, that status code MUST be set in the respective function being called (so, the list as a result of the function processing leaves us with an empty list).+Similar in many ways to the doubly-linked node status codes, we see a new possibility: EMPTY. This is the state of a list existing but having no nodes associated with it (which you should already be familiar with). Whenever this state exists, that status code MUST be set in the respective function being called (i.e. the list as a result of the function processing leaves us with an empty list).
 ====list operation status codes==== ====list operation status codes====
 You'll notice the presence of a set of #define's in the list header file. These are intended to be used to report on various states of list status after performing various operations. You'll notice the presence of a set of #define's in the list header file. These are intended to be used to report on various states of list status after performing various operations.
Line 102: Line 113:
 ALL THREE states must be returned from the function in question should such an occurrence take place. ALL THREE states must be returned from the function in question should such an occurrence take place.
 ====list library==== ====list library====
-In **src/node/**, you will find skeletons of what was previously there, ready for you to re-implement. +In **src/list/**, you will find skeletons of the above prototyped functions, hollowed out in anticipation of being made operational.
- +
-In **src/list/**, you will find the same- skeletons of the above prototyped functions, hollowed out in anticipation of being made operational.+
  
 Figure out what is going on, the connections, and make sure you understand it. Figure out what is going on, the connections, and make sure you understand it.
Line 147: Line 156:
 <cli> <cli>
 lab46:~/src/data/dll0$ bin/verify-list.sh  lab46:~/src/data/dll0$ bin/verify-list.sh 
-==================================================== +====================================================== 
-=    Verifying Doubly-Linked List Functionality    +=    Verifying Doubly-Linked  List Functionality     
-==================================================== +====================================================== 
-  [mklist] Total:  12, Matches:  12, Mismatches:   0 +    [mklist] Total:  12, Matches:  12, Mismatches:   0 
-  [cplist] Total:  18, Matches:  18, Mismatches:   0 +    [cplist] Total:  18, Matches:  18, Mismatches:   0 
-  [append] Total:  36, Matches:  36, Mismatches:   0 +    [append] Total:  36, Matches:  36, Mismatches:   0 
-  [insert] Total:  36, Matches:  36, Mismatches:   0 +    [insert] Total:  36, Matches:  36, Mismatches:   0 
- [display] Total:  12, Matches:  12, Mismatches:   0 +   [display] Total:  12, Matches:  12, Mismatches:   0 
-    [find] Total:  28, Matches:  28, Mismatches:   0 +      [find] Total:  28, Matches:  28, Mismatches:   0 
-==================================================== +====================================================== 
- [RESULTS] Total: 142, Matches: 142, Mismatches:   0 +   [RESULTS] Total: 142, Matches: 142, Mismatches:   0 
-====================================================+======================================================
 lab46:~/src/data/dll0$  lab46:~/src/data/dll0$ 
 </cli> </cli>
-=====Submission Criteria===== +=====Submission===== 
-To be successful in this project, the following criteria must be met:+{{page>haas:fall2015:common:submitblurb#DATA&noheader&nofooter}}
  
-  * Project must be submit on time, by the posted deadline. 
-    * Late submissions will lose 25% credit per day, with the submission window closing on the 4th day following the deadline. 
-  * All code must compile cleanly (no warnings or errors) 
-    * all requested functions must be implemented in the related library 
-    * all requested functionality must conform to stated requirements (either on this project page or in comment banner in source code files themselves). 
-  * Executed programs must display in a manner similar to provided output 
-    * output formatted, where applicable, must match that of project requirements 
-  * Processing must be correct based on input given and output requested 
-  * Output must be correct (i.e. the list visualization, where applicable) based on values input 
-  * Code must be nicely and consistently indented (you may use the **indent** tool) 
-  * Code must be commented 
-    * Any "to be implemented" comments **MUST** be removed 
-      * these "to be implemented" comments, if still present at evaluation time, will result in points being deducted. 
-    * Sufficient comments explaining the point of provided logic **MUST** be present 
-  * Track/version the source code in a repository 
-  * Submit a copy of your source code to me using the **submit** tool (**make submit** will do this) by the deadline. 
haas/fall2015/data/projects/dll0.1445811070.txt.gz · Last modified: 2015/10/25 22:11 by wedge