Question

To solve real world problem, the programer uses ADT like list, stack, queue, set, map, ... etc. to build our data model. In AS8, we pick and choose STL queue and stack to build a postfix calculator. In this assignment you are to Design your own linked-list, a series of integer nodes. The private attributes of this IntLinked Queue including a integer node struct and private control variables and methods: private: struct Node { int data; Node *next; }; Node *front; // -> first item Node *rear; // -> last item Node *p; // traversal position† Node *pp; // previous position int size; † The traversal and usage of position pointers is covered in above Section 2 item 4 video tutorial. The Integer Linked Queue, IntLinkedQueue class should have the following member functions: Constructor; Destructor; // return all dynamically allocated nodes bool isEmpty(); int getSize(); // size of the Queue void clear(int); string toString(); // return a string of a comma(,) delimited items e.g. "1, 2, 3, 4" Front and Rear port access: the following 4 methods return operation success or failure as True/False, and pass the item value In/Out as a reference. bool add(int &); // Front add bool append(int &) // Rear append bool fremove(int &); // Front Remove bool rremove(int &); // rear remove

Answer 1

Test Code

Use the following source code for test menu and bulk entry command 'n':

int main()
{
        bool stay = true;

        // create one instance for each of the test classes
        cout << "\nInstanciate an object of Queue\n";
        string catchVar; // To hold values popped off the Queue
        IntLinkedQueue q;

        cout << "\nFirst, test with hard-wired data sets!\n"
                 << "For example, \nyou may use one set of tokens for all test classes: \n";
        string choice; // user input for choices
        string str; // user input for list, delimiter, ...
        int s[] = {1, 3, 5, 7, 9};
        vector input(s, end(s));

        // show the initial item list
        int input_size = input.size();
        for (auto item : input ) {
                cout << item << ((input_size <= 1) ? " " : ", ");
                input_size--;
        }
        cout << endl;

        // initialize the Queue class instances
        for (auto i: input) q.add( i );
        cout << "\nUse menu to test a Queue class instance.\n";
        menu();
        // main menu while
        while(stay) {  // main menu while starts
                cout << "\n       Enter your command: ";
                stay = true;
                cin >> choice;
                cin.ignore();
                int pos;
                string input;
                string token;
                int item;
                stringstream sst;
                stringstream ss;
                int Queue_size; 

                if(choice.size() == 1) {
                        char ch = choice[0];
                        vector dump;
                        string value;
                        switch(ch) {  // main menu switch starts
                                case 'N':
                                case 'n':
                                {
                                    if(!q.isEmpty()) q.clear();
                                    cout << "Enter a line of comma (,) delmited data set: ";
                                    getline (cin, input);                       // user input -> string
                                    ss << input;                  // string -> stream
                                    while ( getline(ss, token, ',') ) { // stream -> string token
                                                stringstream sst(token);
                                                sst >> item;
                                                q.add(item);
                                    }

                                    break;

Sample Test Run

Running /home/ubuntu/workspace/comsc-200SP19/m09-IntLinkeQ/testIntLinkedQueue.cpp

Instanciate an object of Queue

First, test with hard-wired data sets!
For example, 
you may use one set of tokens for all test classes: 
1, 3, 5, 7, 9 

Use menu to test a Queue class instance.

--- AS9 Integer LinkedQueue Test Menu ---
        N - to bulk create New Queue
        I - Index access
        D - to Display
        E - is Empty?
        A - to Add ~ push front
        a - to append ~ push back
        R - to Remove ~ pop front
        r - to Remove ~ pop back
        L - Length of Queue?
        C - to Clear
        Q - to Q this program
        H - this menu

        Enter your command: d
1, 3, 5, 7, 9
        Enter your command: a
                Enter a number: 11
                You have entered: 11
                Queue: 1, 3, 5, 7, 9, 11

        Enter your command: R
        removed 1
                Queue: 3, 5, 7, 9, 11

        Enter your command: I
                Enter the 0-based index: 3
                The Queue[3] is 9
                To modify y/n? y
                What is the new number? 8

        Enter your command: D
3, 5, 7, 8, 11
        Enter your command: L
                Number of Entries in Queue: 5

        Enter your command: C
                Queue is cleared.

        Enter your command: L
                Number of Entries in Queue: 0

        Enter your command: Q
Program exit