Differences

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

--- haas:fall2014:data:projects:dlq0 [2014/11/07 21:33] – [conceptualizing a stack] wedge
+++ haas:fall2014:data:projects:dlq0 [2014/11/19 14:43] (current) – [Errata] wedge
@@ Line 11: / Line 11: @@
 This section will document any updates applied to the project since original release:
-  * __revision #__: <description> (DATESTRING)
+  * __revision 1__: I noticed some typos and omissions that while not causing any problems, could cause confusion and compiler warnings. (20141116)
+    * **unit-enqueue.c** had a bunch of references to "Dequeueing" in its printfs() where it actually meant to say "Enqueueing" (FIXED).
+    * the prototype for **rmqueue()** was missing from the **inc/queue.h** header. This was causing implicit function declaration warnings during compile. (FIXED).
+  * __revision 2__: unit-mkqueue tweaks and verify-queue.sh enhancements (20141119)
+    * While I was debugging some code I noticed that the **unit-mkqueue.c** logic was not flexible enough in handling implementations where front was pointing to the end of the list. I have added logic to enable proper checking of back/front, regardless of underlying list orientation (FIXED).
+    * verify-queue.sh enhanced to show absolute totals, even if improper implementations cause the unit test not to perform the full run.
 =====Objective=====
-In this project, resume our conceptual journey and explore another data structure: stacks.
+In this project, resume our conceptual journey and explore another data structure: queues.
 =====Background=====
-A **stack** is considered one of the most important data structures, along with **queues** (next week's project) and trees. And it is largely because of how often we find them playing out in nature or our day-to-day lives.
+A **queue** is considered one of the most important data structures, along with **stack** (last week's project) and trees. And it is largely because of how often we find them playing out in nature or our day-to-day lives.
-The word "stack" is [[https://www.google.com/search?&q=define%3Astack&ie=utf-8&oe=utf-8|defined]] as:
+The word "queue" is [[https://www.google.com/search?&q=define%3Aqueue&ie=utf-8&oe=utf-8|defined]] as:
-  * (generically): a pile of objects, typically one that is neatly arranged
-  * (computing): a set of storage locations that store data in such a way that the most recently stored item is the first to be retrieved
-Additionally, when viewing it as a verb (an action), we also find some positive computing application (bolded) in a less reputable cardplaying usage:
-  * shuffle or **arrange** (a deck of cards) dishonestly **so as to gain** an unfair **advantage**
-Or, to distill it out:
-  * arrange so as to gain advantage
-Combining with our previous definitions, we have:
-  * a set of storage locations that are arranged in such a way so as to give us an advantage- the most recently stored item (the last to be placed onto the stack) is the first to be retrieved.
+  * (generically): a line or sequence of items awaiting their turn to be attended to or to proceed
+  * (computing): a list of data items, commands, etc., stored so as to be retrievable in a definite order, usually the order of insertion
 ====Lists and Nodes====
 So, how does all this list and node stuff play into our queue implementation?
@@ Line 54: / Line 47: @@
 Similarly, queues possess no mandatory orientation, but we do usually visualize them as horizontal entities, largely because that's how we commonly find ourselves entangled in this data structures in nature.
-====the stack====
+====the queue====
-The stack data structure presents certain advantages that encourages its use in solving problems (why do we stack a bunch of papers all in the same place to create piles? Why is that more advantageous than giving each one its own unique desk space?), and we accomplish that by its compositional definition:
+The queue data structure presents certain advantages that encourages its use in solving problems (why is the notion of forming lines important? What problems does that solve? How are resources more efficiently utilized by this act?), and we accomplish that by its compositional definition:
-  * a stack has a **top**, basically a node pointer that constantly points to the top node in the stack (equivalent to the underlying list's start or end pointer-- you can decide which one you want to use).
+  * a queue has a **back** and a **front**, basically node pointers that constantly point to the back and front node in the queue (equivalent to the underlying list's start and end pointers-- you can decide which one you want to use for what location).
-  * to put an item on the stack, we **push** it there. So one of the functions we'll be implementing is **push()**, which will take the node we wish to place on the given stack, and push will handle all the necessary coordination with its underlying list.
+  * to put an item on the queue, we **enqueue** it (place it at the back of the queue). So one of the functions we'll be implementing is **enqueue()**, which will take the node we wish to place on the given queue, and enqueue will handle all the necessary coordination with its underlying list.
-  * to get an item off of the stack, we **pop** it. In our **pop()** function, we grab the **top** node off the stack (this also translates into a set of list-level transactions that our **pop()** function will handle for us).
+  * to get an item off of the queue, we **dequeue** it. In our **dequeue()** function, we grab the **front** node off the stack (this also translates into a set of list-level transactions that our **dequeue()** function will handle for us).
-These qualities cause the stack to be described as a LIFO (or FILO) structure:
+These qualities cause the queue to be described as a FIFO (or LILO) structure:
-  * **LIFO**: **L**ast **I**n **F**irst **O**ut
+  * **FIFO**: **F**irst **I**n **F**irst **O**ut
-  * **FILO**: **F**irst **I**n **L**ast **O**ut
+  * **LILO**: **L**ast **I**n **L**ast **O**ut
-And that describes what is conceptually going on-- if we can ONLY access our data through one location (the top), the data most immediately available to us is that which we most recently placed there (hence the last one we pushed in would be the first one we get back when popping it).
+And that describes what is conceptually going on-- if we can ONLY put our data on at one end (the back), and grab our data from the other (the front), the data most immediately available to us is that which we placed there first (hence the first one we pushed in would be the first one we get back when dequeueing it).
 This concept is very important, and being aware of it can be of significant strategic importance when going about solving problems (and seeing its pattern proliferate in nature).
-With that said, the existence of **top**, along with the core **push()** and **pop()** functions defines the minimal necessary requiments to interface with a stack. Sometimes we'll see additional actions sneak in. While these may be commonly associated with stacks, they should not be confused as core requiments of a stack:
+With that said, the existence of **front**, **back**, along with the core **enqueue()** and **dequeue()** functions defines the minimal necessary requiments to interface with a queue. Sometimes we'll see additional actions sneak in. While these may be commonly associated with queue, they should not be confused as core requiments of a queue:
-  * **peek**: the ability to gain access to the top node without removing it from the stack
+  * **purge**: a way to quickly empty out a queue (evacuate its contents-- note this is partially similar in nature to what our **rmqueue()** function will do; only we won't take it the extra step of de-allocating and NULLifying the queue pointer).
-  * **is the stack empty?**: the ability to query the stack and determine if it is empty or non-empty (or perhaps if non-empty, how full is it?)
-While we may be implementing these supplemental functions, it should be noted that not only are they in no way necessary for using a stack, they could be detrimental (just as relying on **qty** in the sll projects was), as one could rely on them as a crutch.
+While we may be implementing these supplemental functions, it should be noted that not only are they in no way necessary for using a queue, they could be detrimental (just as relying on **qty** in the sll projects was), as one could rely on them as a crutch.
 Their inclusion should ONLY be viewed as a means of convenience (in certain scenarios they may result in less code needing to be written), but NOT as something you should routinely make use of.
-====size can matter====
+====buffer size can matter====
-With a stack, there sometimes exists a need to cap its total size (especially in applications on the computer, we may have only allocated a fixed amount of space and cannot exceed it). For this reason, we will need to maintain a count of nodes in the stack (ie the underlying list). For this reason, **qty** makes an appearance once again in the list struct.
+With a queue, there sometimes exists a need to cap its total size (especially in applications on the computer, we may have only allocated a fixed amount of space and cannot exceed it). For this reason, we will need to maintain a count of nodes in the queue (ie the underlying list). For this reason, we continue to make use of the list's **qty** element.
-Additionally, the stack will have a configured maximum size- if the quantity of nodes in the list exceeds the configured size of the stack, we should prevent any additional pushes.
+Additionally, the queue will have a configured maximum buffer- if the quantity of nodes in the list exceeds the configured buffer of the queue, we should prevent any additional enqueues.
-It should also be pointed out that in other applications, a stack need not have a maximum size.. in which case it can theoretically grow an indefinite amount. We will explore both conditions (unbounded and bounded) in this project.
+It should also be pointed out that in other applications, a queue need not have a maximum buffer size.. in which case it can theoretically grow an indefinite amount. We will explore both conditions (unbounded and bounded) in this project.
-====stack error conditions====
+====queue error conditions====
-There are two very important operational error conditions a stack can experience:
+There are two very important operational error conditions a queue can experience:
-  * __stack **over**flow__: this is the situation where the quantity of the list is equal to the configured stack size, and we try to push another node onto the stack.
+  * __buffer **over**run__: this is the situation where the quantity of the list is equal to the configured queue buffer, and we try to enqueue another node onto the queue.
-  * __stack **under**flow__: this is the situation where the stack is empty, yet we still try to pop a value from it.
+  * __buffer **under**run__: this is the situation where the queue is empty, yet we still try to dequeue a value from it.
 =====Project Overview=====
-For this project, we're going to be implementing the stack data structure atop of our recently re-implemented linked list (the doubly linked list).
+For this project, we're going to be implementing the queue data structure atop of our recently re-implemented linked list (the doubly linked list).
-====In inc/list.h====
-There is one change (an addition) that has been made to **list.h**, and that is the return of the **qty** element:
-<code c>
+====In inc/queue.h====
-struct list {
-    Node *start;          // pointer to start of list
-    Node *end;            // pointer to end of list
-    int   qty;            // holds current count of nodes
-};
-typedef struct list List; // because we deserve nice things
-</code>
-It should be noted (and stressed) that the utilization of **qty** should JUST be in maintaining a count. You need not re-implement or change the logic of any of your list functionality to base its operations or to rely on **qty** in any way (just as before, if you do you'll lost credit).
-From the list's point of view, its sole purpose is for show.
-With that said, you likely only have to make changes to 4 functions in order to appropriately accommodate **qty**-- any low-level list operation that is responsible for initializing, adding, or taking nodes out of the list.
-====In inc/stack.h====
 <code c 1>
-#ifndef _STACK_H
+#ifndef _QUEUE_H
-#define _STACK_H
+#define _QUEUE_H
-#include "list.h"               // stack relies on list to work
+#include "list.h"                  // queue relies on list to work
-                                // (which relies on node)
+                                   // (which relies on node)
-struct stack {
+struct queue {
-    List *data;                 // pointer to list containing data
+    List *data;                    // pointer to list containing data
-    Node *top;                  // pointer to node at top of stack
+    Node *front;                   // pointer to node at front of queue
-    int   size;                 // maximum stack size (0 is unbounded)
+    Node *back;                    // pointer to node at back of queue
+    int   buffer;                  // maximum queue size (0 is unbounded)
 };
-typedef struct stack Stack;     // because we deserve nice things
+typedef struct queue Queue;        // because we deserve nice things
-Stack *mkstack(int           ); // create new stack (of max size)
+Queue *mkqueue(int              ); // create new queue (of max size)
-Stack *cpstack(Stack *       ); // create a copy of an existing stack
+Queue *cpqueue(Queue *          ); // create a copy of an existing queue
-Stack *rmstack(Stack *       ); // clear and de-allocate an existing stack
+Queue *rmqueue(Queue *          ); // clear and de-allocate an existing queue
-int    push(Stack **, Node * ); // put new node on top of stack
+Queue *purge(Queue *            ); // empty a given queue
-int    pop (Stack **, Node **); // grab (and disconnect) top node off stack
+int    enqueue(Queue **, Node * ); // add new node to the back of queue
+int    dequeue(Queue **, Node **); // take off node at front of queue
-Node  *peek(Stack *          ); // grab (do not disconnect) top node off stack
-int    isempty(Stack *       ); // determine if the stack is empty or not
 #endif
 </code>
-For our stack implementation, we will make increased used of the double pointer, in order to achieve passing parameters by address.
+For our queue implementation, we will continue to utilize the double pointer, in order to achieve passing parameters by address.
-This is necessary so that we can free up the return value of **push()** and **pop()** to be used for status (ie look out for stack overflows and underflows).
-peek() and isEmpty() are being implemented as an exercise to aid in your understanding of stacks. Again, avoid their use except is a means of convenience (or to further optimize your code). The general rule of thumb is that the use of peek() and isEmpty() should result in shortening your code in a clear or clever way.
-If you cannot think of how to solve a problem without the use of peek()/isEmpty(), that is a strong clue that you shouldn't be using them.
+This is necessary so that we can free up the return value of **enqueue()** and **dequeue()** to be used for status (ie look out for buffer overruns and underruns).
-Also, while nothing is stopping you from doing so, the idea here is that things like **size** and the underlying list **qty** in stack transactions will **NOT** be accessed outside of the push() and pop() functions. Just like my warnings about using **qty** in your list solutions-- do not consider **size** as a variable for your general use.
+Also, while nothing is stopping you from doing so, the idea here is that things like **buffer** and the underlying list **qty** in queue transactions will **NOT** be accessed outside of the **enqueue()** and **dequeue()** functions. Just like my warnings about using **qty** in your list solutions (save for **display()** when showing position values in a backwards orientation)-- do not consider **buffer** as a variable for your general use.
-In object-oriented programming, both **size** and **qty** would be **private** member variables of their respective classes, unable to be used by anything other than their respective member functions.
+In object-oriented programming, both **buffer** and **qty** would be **private** member variables of their respective classes, unable to be used by anything other than their respective member functions.
 ====list library====
-Againt, in **src/list/**, you are to add support for **qty** so that, just as the list's **start** and **end** maintain an accurate positioning of their respective aspects of the list, **qty** maintains a count of the total number of nodes still in the list.
+One more enhancement is in store for our venerable **display()** function, and that is described below:
 ===display() enhancements===
-You are also to implement 4 additional modes to the display() function.
+You are also to implement an additional feature (resulting in 8 additional modes) to the **display()** function.
-This means you'll need to expand the current modulus divide by 4 to one of 8.
+This means you'll need to expand the current modulus divide by 8 to one of 16.
 The current modes are as follows:
@@ Line 164: / Line 137: @@
 //              2 display the list backwards, no positional values
 //              3 display the list backwards, with positional values
+//              4 display the list forward, no positional values, in ASCII
+//              5 display the list forward, with positional values, in ASCII
+//              6 display the list backwards, no positional values, in ASCII
+//              7 display the list backwards, with positional values, in ASCII
 </code>
-The new modes are (you may want to add these comments to your **display.c** file):
+The new feature is to toggle the display of the individual arrows (and the terminating NULL value) and much of the natural spacing we've used so far. It should also ditch, when in ASCII mode, the quotes we have been placing around the ASCII characters.
-<code c>
+The idea here is, when combined with the ASCII representation of the list, **display()** can become a pretty useful function for displaying strings, which could come in handy.
-//          4 display the list forward, no positional values, in ASCII
-//          5 display the list forward, with positional values, in ASCII
+Also, when dealing with numeric values, we could make use of this in applications where we are handling the construction of a numeric value (such as a bignum).
-//          6 display the list backwards, no positional values, in ASCII
-//          7 display the list backwards, with positional values, in ASCII
+For positioned displays, this would seem to have less utility, but by having a space displayed before the position value, we can salvage the output nicely.
-</code>
+So for each of the above 8 modes, you'll have a WITH_ARROWS mode, and then a WITHOUT_ARROWS mode (leaving us with a total of 16 possible combinations).
-What has changed? In modes 4-8, instead of displaying the numeric value contained in the node's data element, you are instead to represent it as its ASCII character.
+For sane implementation purposes, for our current 8 (so modes 0-7), those will be considered to be WITH_ARROWS... whereas the remaining 8 combinations (8-15) will be WITHOUT_ARROWS. All other mode features will map in place (if you recognize the binary pattern I've been following you'll hopefully see how trivial this change (and the previous one) will be).
-For example, if there was a numeric 65 stored in the node , in the mode 4-7 representation, an 'A' should instead be displayed.
+Also, when not displaying arrows, no NULL values will be displayed at all; this means that in the event we are running **display()** on a NULL or empty list, nothing but a newline should be displayed.
 ==display() output examples based on mode==
@@ Line 184: / Line 162: @@
   start -> 51 -> 49 -> 51 -> 51 -> 55 -> NULL
-==mode 0: forward, no positions, as numbers==
+==mode "8": forward, no positions, as numbers, without arrows==
 <cli>
--> 49 -> 51 -> 51 -> 55 -> NULL
+5149515155
 </cli>
-==mode 1: forward, with positions, as numbers==
+==mode "9": forward, with positions, as numbers, without arrows==
 <cli>
-[0] 51 -> [1] 49 -> [2] 51 -> [3] 51 -> [4] 55 -> NULL
+ [0]51 [1]49 [2]51 [3]51 [4]55
 </cli>
-==mode 4: forward, no positions, in ASCII==
+==mode "12": forward, no positions, in ASCII, without arrows==
 <cli>
-'3' -> '1' -> '3' -> '3' -> '7' -> NULL
 </cli>
-==mode 5: forward, with positions, in ASCII==
+==mode "13": forward, with positions, in ASCII, without arrows==
 <cli>
-[0] '3' -> [1] '1' -> [2] '3' -> [3] '3' -> [4] '7' -> NULL
+ [0]3 [1]1 [2]3 [3]3 [4]7
 </cli>
-====stack library====
+====queue library====
-In **src/stack/**, you will find skeletons of the above prototyped functions, hollowed out in anticipation of being made operational.
+In **src/queue/**, you will find 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.
-Again, your stack is to utilize the stack for its underlying data storage operations. This is what the stack's **data** list pointer is to be used for.
+Again, your queue is to utilize the list for its underlying data storage operations. This is what the queue's **data** list pointer is to be used for.
 ====Reference Implementation====
@@ Line 230: / Line 208: @@
 </cli>
-In order to make use of it, you'll need to run **make use-test-reference** from the base of your **dls0** project directory, as follows:
+In order to make use of it, you'll need to run **make use-test-reference** from the base of your **dlq0** project directory, as follows:
 <cli>
-lab46:~/src/data/dls0$ make use-test-reference
+lab46:~/src/data/dlq0$ make use-test-reference
-make[1]: Entering directory '/home/wedge/src/data/dls0/src'
+...
-make[2]: Entering directory '/home/wedge/src/data/dls0/src/list'
-rm -f *.swp *.o append.o cp.o display.o insert.o mk.o obtain.o rm.o search.o sort.o swap.o core
-make[2]: Leaving directory '/home/wedge/src/data/dls0/src/list'
-make[2]: Entering directory '/home/wedge/src/data/dls0/src/node'
-rm -f *.swp *.o cp.o mk.o rm.o core
-make[2]: Leaving directory '/home/wedge/src/data/dls0/src/node'
-make[2]: Entering directory '/home/wedge/src/data/dls0/src/stack'
-rm -f *.swp *.o cp.o isempty.o mk.o peek.o pop.o push.o rm.o core
-make[2]: Leaving directory '/home/wedge/src/data/dls0/src/stack'
-make[1]: Leaving directory '/home/wedge/src/data/dls0/src'
-make[1]: Entering directory '/home/wedge/src/data/dls0/testing'
-make[2]: Entering directory '/home/wedge/src/data/dls0/testing/list'
-make[3]: Entering directory '/home/wedge/src/data/dls0/testing/list/unit'
-rm -f *.swp *.o ../../../bin/unit-append unit-cplist unit-display unit-findnode unit-insert unit-mklist unit-obtain unit-rmlist unit-sortlist unit-swapnode core
-make[3]: Leaving directory '/home/wedge/src/data/dls0/testing/list/unit'
-make[2]: Leaving directory '/home/wedge/src/data/dls0/testing/list'
-make[2]: Entering directory '/home/wedge/src/data/dls0/testing/node'
-make[3]: Entering directory '/home/wedge/src/data/dls0/testing/node/unit'
-rm -f *.swp *.o ../../../bin/unit-cpnode unit-mknode unit-rmnode core
-make[3]: Leaving directory '/home/wedge/src/data/dls0/testing/node/unit'
-make[2]: Leaving directory '/home/wedge/src/data/dls0/testing/node'
-make[2]: Entering directory '/home/wedge/src/data/dls0/testing/stack'
-make[3]: Entering directory '/home/wedge/src/data/dls0/testing/stack/app'
-rm -f *.swp *.o ../../../bin/palindrome-stack core
-make[3]: Leaving directory '/home/wedge/src/data/dls0/testing/stack/app'
-make[3]: Entering directory '/home/wedge/src/data/dls0/testing/stack/unit'
-rm -f *.swp *.o ../../../bin/unit-cpstack unit-isempty unit-mkstack unit-peek unit-pop unit-push unit-rmstack core
-make[3]: Leaving directory '/home/wedge/src/data/dls0/testing/stack/unit'
-make[2]: Leaving directory '/home/wedge/src/data/dls0/testing/stack'
-make[1]: Leaving directory '/home/wedge/src/data/dls0/testing'
 NODE and LIST reference implementation in place, run 'make' to build everything.
-lab46:~/src/data/dls0$
+lab46:~/src/data/dlq0$
 </cli>
@@ Line 272: / Line 220: @@
 <cli>
-lab46:~/src/data/dls0$ make
+lab46:~/src/data/dlq0$ make
 ...
 </cli>
@@ Line 279: / Line 227: @@
 ===Reverting back to using your code===
-If you were trying out the reference implementation to verify stack functionality, and wanted to revert back to your own code, it is as simple as:
+If you were trying out the reference implementation to verify queue functionality, and wanted to revert back to your own code, it is as simple as:
 <cli>
-lab46:~/src/data/dls0$ make use-your-own-code
+lab46:~/src/data/dlq0$ make use-your-own-code
 Local node/list implementation restored, run 'make clean; make' to build everything.
-lab46:~/src/data/dls0$
+lab46:~/src/data/dlq0$
 </cli>
 ====List Library unit tests====
-As a result of the required changes to **display()** and the incorporation of **qty**, pertinent list unit tests will be enhanced, so you can make use of them to ensure implementation compliance.
+As a result of the required changes to **display()**, an updated unit test will be released (this will mean a different number of total tests for list than previously).
 Be sure to run the various list unit tests and verification scripts to see which functions have fallen out of compliance with the list struct specification changes issued in this project. The **verify-list.sh** script can be especially useful in getting a big picture view of what work is needed.
-====Stack library unit tests====
+====Queue library unit tests====
-In **testing/stack/unit/**, you will find these files:
+In **testing/queue/unit/**, you will find these files:
-  * **unit-mkstack.c** - unit test for **mkstack()** library function
+  * **unit-mkqueue.c** - unit test for **mkqueue()** library function
-  * **unit-cpstack.c** - unit test for **cpstack()** library function
+  * **unit-cpqueue.c** - unit test for **cpqueue()** library function
-  * **unit-rmstack.c** - unit test for **rmstack()** library function
+  * **unit-rmqueue.c** - unit test for **rmqueue()** library function
-  * **unit-push.c** - unit test for **push()** library function
+  * **unit-enqueue.c** - unit test for **enqueue()** library function
-  * **unit-pop.c** - unit test for **pop()** library function
+  * **unit-dequeue.c** - unit test for **dequeue()** library function
-  * **unit-peek.c** - unit test for **peek()** library function
+  * **unit-purge.c**   - unit test for **purge()** library function
-  * **unit-isempty.c** - unit test for **isempty()** library function
 There are also corresponding **verify-FUNCTION.sh** scripts that will output a "MATCH"/"MISMATCH" to confirm overall conformance with the pertinent stack functionality.
-These are complete runnable programs (when compiled, and linked against the stack library, which is all handled for you by the **Makefile** system in place).
+These are complete runnable programs (when compiled, and linked against the queue library, which is all handled for you by the **Makefile** system in place).
 Of particular importance, I want you to take a close look at:
@@ Line 317: / Line 264: @@
     * ask questions to get clarification!
-====stack testing applications====
-===palindrome-stack===
-Now that we've completed our stack functionality, we can use these individual functions to piece together solutions to various everyday problems where a stack could be effective (and even compare approaches to when we didn't have the benefit of a stack in solving the problem). After all, that's a big aspect to learning data structures- they open doors to new algorithms and problem solving capabilities.
-Our task (once again) will be that of palindromes (ie words/phrases that, when reversed, spell the same thing).
-This implementation will be considered an extra credit opportunity, so as to offer those who have fallen behind (but working to get caught up) a reprieve on some of the credit they've lost.
-It is also highly recommended to undertake as it will give you further experience working with these concepts.
-Note this is a DIFFERENT approach than you would have taken in the program with sll2- you're to use stack functionality to aid you with the heavy lifting. While you will still make use of list functionality for grabbing the initial input, the actual palindrome comparison processing needs to heavily involve stacks.
 =====Expected Results=====
-To assist you in verifying a correct implementation, a fully working implementation of the node, list, and stack libraries should resemble the following (when running the respective verify script):
+To assist you in verifying a correct implementation, a fully working implementation of the list and queue libraries should resemble the following (when running the respective verify script):
-====node library====
-Here is what you should get for node:
-<cli>
-lab46:~/src/data/dls0$ bin/verify-node.sh
-====================================================
-=    Verifying Doubly-Linked Node Functionality    =
-====================================================
-  [mknode] Total:   5, Matches:   5, Mismatches:   0
-  [cpnode] Total:   6, Matches:   6, Mismatches:   0
-  [rmnode] Total:   2, Matches:   2, Mismatches:   0
-====================================================
- [RESULTS] Total:  13, Matches:  13, Mismatches:   0
-====================================================
-lab46:~/src/data/dls0$
-</cli>
-As no coding changes were needed in the node library, these results should be identical to that of a fully functioning node implementation from the **dll0** project.
 ====list library====
@@ Line 356: / Line 273: @@
 <cli>
-lab46:~/src/data/dls0$ bin/verify-list.sh
+lab46:~/src/data/dlq0$ bin/verify-list.sh
 ====================================================
 =    Verifying Doubly-Linked List Functionality    =
@@ Line 366: / Line 283: @@
   [insert] Total:  22, Matches:  22, Mismatches:   0
   [obtain] Total:  23, Matches:  23, Mismatches:   0
- [display] Total:  10, Matches:  10, Mismatches:   0
+ [display] Total:  24, Matches:  24, Mismatches:   0
 [findnode] Total:  11, Matches:  11, Mismatches:   0
 [sortlist] Total:   6, Matches:   6, Mismatches:   0
 [swapnode] Total:   7, Matches:   7, Mismatches:   0
 ====================================================
- [RESULTS] Total: 140, Matches: 140, Mismatches:   0
+ [RESULTS] Total: 154, Matches: 154, Mismatches:   0
 ====================================================
-lab46:~/src/data/dls0$
+lab46:~/src/data/dlq0$
 </cli>
-Due to the re-introduction of **qty** into list (impacting actions performed by **mklist()**, **append()**, **insert()**, and **obtain()**), along with feature additions to **display()**, those functions saw additional tests performed, so our original max total of **102** from **dll0** has now changed to **140** (ie various **qty** and **display()**-related tests adding to the previous total).
+With the added feature to **display()**, we have 10 additional combinations to test, plus I added in 4 explicit tests of invalid modes, so this will bump up the total number of list tests by 10+4, going from the dll0 total of 102 to the dls0 total of 140 to the dlq0 total of 154.
-Remember though- aside from the minor change of adding **qty** and enhancing **display()**, all remaining list functions need no change (and **mklist()/append()/insert()/obtain()** remained largely unchanged).
+But aside from this change to **display()**, your list implementation can remain unchanged.
-====stack library====
-Here is what you should get for stack:
-<cli>
-lab46:~/src/data/dls0$ bin/verify-stack.sh
-===================================================
-=   Verifying Doubly-Linked Stack Functionality   =
-===================================================
-[mkstack] Total:   3, Matches:   3, Mismatches:   0
-[cpstack] Total:   8, Matches:   8, Mismatches:   0
-[rmstack] Total:   3, Matches:   3, Mismatches:   0
-   [push] Total:  30, Matches:  30, Mismatches:   0
-    [pop] Total:  25, Matches:  25, Mismatches:   0
-   [peek] Total:  24, Matches:  24, Mismatches:   0
-[isempty] Total:  13, Matches:  13, Mismatches:   0
-===================================================
-[RESULTS] Total: 106, Matches: 106, Mismatches:   0
-===================================================
-lab46:~/src/data/dls0$
-</cli>
 ====queue library====
@@ Line 411: / Line 307: @@
 [mkqueue] Total:   4, Matches:   4, Mismatches:   0
 [cpqueue] Total:   8, Matches:   8, Mismatches:   0
+[rmqueue] Total:   3, Matches:   3, Mismatches:   0
   [purge] Total:   3, Matches:   3, Mismatches:   0
 [enqueue] Total:  30, Matches:  30, Mismatches:   0
 [dequeue] Total:  25, Matches:  25, Mismatches:   0
 ===================================================
-[RESULTS] Total:  70, Matches:  70, Mismatches:   0
+[RESULTS] Total:  73, Matches:  73, Mismatches:   0
 ===================================================
 lab46:~/src/data/dlq0$
@@ Line 439: / Line 336: @@
   * 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.

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools