fork(2) download

/ =============================================================
   // This is a driver program to test IntegerList class
   // =============================================================
#include <iostream>
#include "IntegerList.h"
using namespace std;
 
int main()
{
    // Define the IntegerList object
    IntegerList list;
 
    // Building list with data in our case integers
    list.appendNode(3);
    list.appendNode(5);
    list.appendNode(7);
    list.appendNode(9);
 
    list.displayList();
    return 0;
 
 
 
    // Display all initial values
    cout << " These are all the nodes currently in the list. " << endl;
    list.displayList();
 
 
    // Inserting a node in the middle of the list
    cout << " Now we have inserted a node to the middle of the list. " << endl;
    list.insertNode(6);
 
    // Deleting the last node
    cout << " Now we have deleted the last node of the list. " << endl;
    list.deleteNode(9);
 
    // Remaining values of the list
    cout << " These are the remanining nodes of the list. " << endl;
    list.displayList();
 
    // Deleting the first node
    cout << " Now we have deleted the first node of the list. " << endl;
    list.deleteNode(3);
 
    // Deleting the last node
    cout << " These are the remaining nodes left. " << endl;
    list.displayList();
 
 
    return 0;
 
}
 
 
 
 
 
 
 
 
 
#ifndef INTEGERLIST_H
#define INTEGERLIST_H
 
 
 
class IntegerList
{
private:
    // Declaring a structure for the list
    struct ListNode
    {
        int data; // The value i this node
        ListNode *next;
    };
 
    ListNode *head;   // This is the head pointer the starting point
public:
    IntegerList()
    {
        head = nullptr;
    }
 
    // Destructor
   ~IntegerList();
 
    // This function is used to insert the parameter to the list
    // as the last node
    void appendNode(int);
 
    // This function is used to insert the integer value in its corresponding order.
    // NOTE this function assumes that the list is sorted, tooperate properly.
    void insertNode(int);
 
    // This function deletes the node whose value matches the
    // parameter.
    void deleteNode(int);
 
    // This function will display all the nodes in the end of the program
    void displayList() const;
 
};
#endif
 
 
#include "IntegerList.h"
#include <iostream>
using namespace std;
 
 
// To append a node to a linked list means to add the node to the end of the list.
void IntegerList::appendNode(int num)
{
    ListNode *newNode; // Points at a new node
    ListNode *nodePtr; // Moves through the list
 
    // Allocate a new node and store the number
    newNode = new ListNode;
    newNode->data = num;
    newNode->next = nullptr;
 
    // Making new node when there are no nodes in the list
    if (!head)
        head = newNode;
    else
    {
        // Else Insert newNode at the end
        //Initialize nodePtr to head/front of the list
        nodePtr = head;
 
        // Finds last node in the list
        while (nodePtr->next)
            nodePtr = nodePtr->next;
 
        //Insert newNode as the last node.
        nodePtr->next = newNode;
 
    }
}
 
 
void IntegerList::insertNode(int num)
{
    ListNode *newNode; // A new node
    ListNode *nodePtr; // To traverse the list
    ListNode *previousNode = nullptr; // The previous node
 
    // Allocate a new node and store num there.
    newNode = new ListNode;
    newNode->data = num;
 
    // If there are no nodes in the list
    // make newNode the first node
    if (!head)
    {
        head = newNode;
        newNode->next = nullptr;
    }
    else // Otherwise, insert newNode
    {
        // Position nodePtr at the head of list.
        nodePtr = head;
 
        // Initialize previousNode to nullptr.
        previousNode = nullptr;
 
        // Skip all nodes whose value is less than num.
        while (nodePtr != nullptr && nodePtr->data < num)
        {
            previousNode = nodePtr;
            nodePtr = nodePtr->next;
        }
 
        // If the new node is to be the 1st in the list,
        // insert it before all other nodes.
        if (previousNode == nullptr)
        {
            head = newNode;
            newNode->next = nodePtr;
        }
        else // Otherwise insert after the previous node.
        {
            previousNode->next = newNode;
            newNode->next = nodePtr;
        }
    }
}
 
 
void IntegerList::deleteNode(int num)
{
    //ListNode* newNode;
    ListNode* nodePtr; // To traverse the list
    ListNode* previousNode; // To point to the previous node
 
    // If the list is empty, do nothing.
    if (!head)
        return;
    // Determine if the first node is the one.
    if (head->data == num)
    {
        nodePtr = head->next;
        delete head;
        head = nodePtr;
    }
    else
    {
        // Initialize nodePtr to head of list
        nodePtr = head;
 
        // Skip all nodes whose value member is
        // not equal to num.
        while (nodePtr != nullptr && nodePtr->data != num)
        {
            previousNode = nodePtr;
            nodePtr = nodePtr->next;
        }
 
        // If nodePtr is not at the end of the list,
        // link the previous node to the node after
        // nodePtr, then delete nodePtr.
        if (nodePtr)
        {
            previousNode->next = nodePtr->next;
            delete nodePtr;
        }
    }
 
}
 
void IntegerList::displayList() const
{
    ListNode* nodePtr;
    nodePtr = head;
    while (nodePtr != nullptr)
    {
        cout << nodePtr->data << endl;
        nodePtr = nodePtr->next;
    }
}
 
 
void IntegerList::deleteNode(int num)
{
    ListNode* nodePtr; // TO transverse the list
    ListNode* previousNode; // TO point to the previous node
 
    // If the list is empty do nothing
    if (!head)
        return;
    if (head->data == num)
    {
        nodePtr = head->next;
        delete head;
        head = nodePtr;
    }
    else
    {
        // Initialize nodePtr to head of list
        nodePtr = head;
 
        // Skip all ndoes whos value member is not equal to num
        while (nodePtr != nullptr && nodePtr->data != num)
        {
            previousNode = nodePtr;
            nodePtr = nodePtr->next;
        }
 
        // If nodePtr is not at the end of the list, link the previous node to the node after
        //nodePtr, then delete nodePtr.
        if (nodePtr)
        {
            previousNode->next = nodePtr->next;
            delete nodePtr;
 
        }
 
    }
 
}
 
 
IntegerList::~IntegerList()
{
    ListNode* nodePtr; // To traverse the list
    ListNode* nextNode; // To point to the next node
 
    // Position nodePtr at the head of the list.
    nodePtr = head;
 
    // While nodePtr is not at the end of the list...
    while (nodePtr != nullptr)
    {
        // Save a pointer to the next node.
        nextNode = nodePtr->next;
 
        // Delete the current node.
        delete nodePtr;
 
        // Position nodePtr at the next node.
        nodePtr = nextNode;
    }
 
}
 
 
 
 
 
 
 
 
 
 

Main.java:1: error: class, interface, or enum expected
/ =============================================================
^
Main.java:4: error: illegal character: '#'
#include <iostream>
^
Main.java:5: error: illegal character: '#'
#include "IntegerList.h"
^
Main.java:8: error: class, interface, or enum expected
int main()
^
Main.java:14: error: class, interface, or enum expected
    list.appendNode(3);
    ^
Main.java:15: error: class, interface, or enum expected
    list.appendNode(5);
    ^
Main.java:16: error: class, interface, or enum expected
    list.appendNode(7);
    ^
Main.java:17: error: class, interface, or enum expected
    list.appendNode(9);
    ^
Main.java:19: error: class, interface, or enum expected
    list.displayList();
    ^
Main.java:20: error: class, interface, or enum expected
    return 0;
    ^
Main.java:25: error: class, interface, or enum expected
    cout << " These are all the nodes currently in the list. " << endl;
    ^
Main.java:26: error: class, interface, or enum expected
    list.displayList();
    ^
Main.java:30: error: class, interface, or enum expected
    cout << " Now we have inserted a node to the middle of the list. " << endl;
    ^
Main.java:31: error: class, interface, or enum expected
    list.insertNode(6);
    ^
Main.java:34: error: class, interface, or enum expected
    cout << " Now we have deleted the last node of the list. " << endl;
    ^
Main.java:35: error: class, interface, or enum expected
    list.deleteNode(9);
    ^
Main.java:38: error: class, interface, or enum expected
    cout << " These are the remanining nodes of the list. " << endl;
    ^
Main.java:39: error: class, interface, or enum expected
    list.displayList();
    ^
Main.java:42: error: class, interface, or enum expected
    cout << " Now we have deleted the first node of the list. " << endl;
    ^
Main.java:43: error: class, interface, or enum expected
    list.deleteNode(3);
    ^
Main.java:46: error: class, interface, or enum expected
    cout << " These are the remaining nodes left. " << endl;
    ^
Main.java:47: error: class, interface, or enum expected
    list.displayList();
    ^
Main.java:50: error: class, interface, or enum expected
    return 0;
    ^
Main.java:52: error: class, interface, or enum expected
}
^
Main.java:62: error: illegal character: '#'
#ifndef INTEGERLIST_H
^
Main.java:63: error: illegal character: '#'
#define INTEGERLIST_H
^
Main.java:69: error: illegal start of type
private:
       ^
Main.java:71: error: ';' expected
    struct ListNode
                   ^
Main.java:74: error: not a statement
        ListNode *next;
                 ^
Main.java:77: error: <identifier> expected
    ListNode *head;   // This is the head pointer the starting point
            ^
Main.java:77: error: <identifier> expected
    ListNode *head;   // This is the head pointer the starting point
                  ^
Main.java:78: error: illegal start of type
public:
      ^
Main.java:85: error: illegal start of type
   ~IntegerList();
   ^
Main.java:89: error: <identifier> expected
    void appendNode(int);
                       ^
Main.java:93: error: <identifier> expected
    void insertNode(int);
                       ^
Main.java:97: error: <identifier> expected
    void deleteNode(int);
                       ^
Main.java:100: error: ';' expected
    void displayList() const;
                      ^
Main.java:103: error: illegal character: '#'
#endif
^
Main.java:106: error: illegal character: '#'
#include "IntegerList.h"
^
Main.java:106: error: class, interface, or enum expected
#include "IntegerList.h"
         ^
Main.java:107: error: illegal character: '#'
#include <iostream>
^
Main.java:112: error: class, interface, or enum expected
void IntegerList::appendNode(int num)
^
Main.java:115: error: class, interface, or enum expected
    ListNode *nodePtr; // Moves through the list
    ^
Main.java:118: error: class, interface, or enum expected
    newNode = new ListNode;
    ^
Main.java:119: error: class, interface, or enum expected
    newNode->data = num;
    ^
Main.java:120: error: class, interface, or enum expected
    newNode->next = nullptr;
    ^
Main.java:123: error: class, interface, or enum expected
    if (!head)
    ^
Main.java:125: error: class, interface, or enum expected
    else
    ^
Main.java:132: error: class, interface, or enum expected
        while (nodePtr->next)
        ^
Main.java:136: error: class, interface, or enum expected
        nodePtr->next = newNode;
        ^
Main.java:138: error: class, interface, or enum expected
    }
    ^
Main.java:145: error: class, interface, or enum expected
    ListNode *nodePtr; // To traverse the list
    ^
Main.java:146: error: class, interface, or enum expected
    ListNode *previousNode = nullptr; // The previous node
    ^
Main.java:149: error: class, interface, or enum expected
    newNode = new ListNode;
    ^
Main.java:150: error: class, interface, or enum expected
    newNode->data = num;
    ^
Main.java:154: error: class, interface, or enum expected
    if (!head)
    ^
Main.java:157: error: class, interface, or enum expected
        newNode->next = nullptr;
        ^
Main.java:158: error: class, interface, or enum expected
    }
    ^
Main.java:165: error: class, interface, or enum expected
        previousNode = nullptr;
        ^
Main.java:168: error: class, interface, or enum expected
        while (nodePtr != nullptr && nodePtr->data < num)
        ^
Main.java:171: error: class, interface, or enum expected
            nodePtr = nodePtr->next;
            ^
Main.java:172: error: class, interface, or enum expected
        }
        ^
Main.java:179: error: class, interface, or enum expected
            newNode->next = nodePtr;
            ^
Main.java:180: error: class, interface, or enum expected
        }
        ^
Main.java:184: error: class, interface, or enum expected
            newNode->next = nodePtr;
            ^
Main.java:185: error: class, interface, or enum expected
        }
        ^
Main.java:194: error: class, interface, or enum expected
    ListNode* previousNode; // To point to the previous node
    ^
Main.java:197: error: class, interface, or enum expected
    if (!head)
    ^
Main.java:200: error: class, interface, or enum expected
    if (head->data == num)
    ^
Main.java:203: error: class, interface, or enum expected
        delete head;
        ^
Main.java:204: error: class, interface, or enum expected
        head = nodePtr;
        ^
Main.java:205: error: class, interface, or enum expected
    }
    ^
Main.java:213: error: class, interface, or enum expected
        while (nodePtr != nullptr && nodePtr->data != num)
        ^
Main.java:216: error: class, interface, or enum expected
            nodePtr = nodePtr->next;
            ^
Main.java:217: error: class, interface, or enum expected
        }
        ^
Main.java:225: error: class, interface, or enum expected
            delete nodePtr;
            ^
Main.java:226: error: class, interface, or enum expected
        }
        ^
Main.java:234: error: class, interface, or enum expected
    nodePtr = head;
    ^
Main.java:235: error: class, interface, or enum expected
    while (nodePtr != nullptr)
    ^
Main.java:238: error: class, interface, or enum expected
        nodePtr = nodePtr->next;
        ^
Main.java:239: error: class, interface, or enum expected
    }
    ^
Main.java:246: error: class, interface, or enum expected
    ListNode* previousNode; // TO point to the previous node
    ^
Main.java:249: error: class, interface, or enum expected
    if (!head)
    ^
Main.java:251: error: class, interface, or enum expected
    if (head->data == num)
    ^
Main.java:254: error: class, interface, or enum expected
        delete head;
        ^
Main.java:255: error: class, interface, or enum expected
        head = nodePtr;
        ^
Main.java:256: error: class, interface, or enum expected
    }
    ^
Main.java:263: error: class, interface, or enum expected
        while (nodePtr != nullptr && nodePtr->data != num)
        ^
Main.java:266: error: class, interface, or enum expected
            nodePtr = nodePtr->next;
            ^
Main.java:267: error: class, interface, or enum expected
        }
        ^
Main.java:274: error: class, interface, or enum expected
            delete nodePtr;
            ^
Main.java:276: error: class, interface, or enum expected
        }
        ^
Main.java:286: error: class, interface, or enum expected
    ListNode* nextNode; // To point to the next node
    ^
Main.java:289: error: class, interface, or enum expected
    nodePtr = head;
    ^
Main.java:292: error: class, interface, or enum expected
    while (nodePtr != nullptr)
    ^
Main.java:298: error: class, interface, or enum expected
        delete nodePtr;
        ^
Main.java:301: error: class, interface, or enum expected
        nodePtr = nextNode;
        ^
Main.java:302: error: class, interface, or enum expected
    }
    ^
98 errors

Standard output is empty