datastructures/queue.cpp at main · Lululei123/datastructures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
#include <iostream>
#include <limits>
struct node {
public:
    int data;
    node* next;
};

class queue {
private:
    node* aHead;
    node* aEnd;
public:
    queue() : aHead(NULL), aEnd(NULL) {}

    void enqueue(int pData) {
        node* newNode = new node();
        newNode->data = pData;
        newNode->next = NULL;

        if (this->empty()) {
            aHead = newNode;
            aEnd = aHead;
        }
        else {
            aEnd->next = newNode;
            aEnd = aEnd->next;
        }
    }

    int dequeue() {
        if (this->empty()) {
            return NULL;
        }
        int data = aHead->data;
        node* temp = aHead;
        aHead = aHead->next;
        delete temp;
        return data;
    }

    bool empty() {
        if (aHead == NULL) return 1;
        return 0;
    }

    int doCount() {
        int count = 0;
        if (this->empty()) return count;
        node* n = aHead;
        while (n != NULL) {
            n = n->next;
            count++;
        }
        return count;
    }
};

void printHeader() {
    std::cout << R"(
        ______  ___ _____ ___   _____ ___________ _   _ _____ _____ _   _______ _____       _____ _   _ _____ _   _ _____
        |  _  \/ _ \_   _/ _ \ /  ___|_   _| ___ \ | | /  __ \_   _| | | | ___ \  ___|     |  _  | | | |  ___| | | |  ___|
        | | | / /_\ \| |/ /_\ \\ `--.  | | | |_/ / | | | /  \/ | | | | | | |_/ / |__ ______| | | | | | | |__ | | | | |__
        | | | |  _  || ||  _  | `--. \ | | |    /| | | | |     | | | | | |    /|  __|______| | | | | | |  __|| | | |  __|
        | |/ /| | | || || | | |/\__/ / | | | |\ \| |_| | \__/\ | | | |_| | |\ \| |___      \ \/' / |_| | |___| |_| | |___
        |___/ \_| |_/\_/\_| |_/\____/  \_/ \_| \_|\___/ \____/ \_/  \___/\_| \_\____/       \_/\_\\___/\____/ \___/\____/
    )" << std::endl;
}

void doClear() {
#if defined(__linux__)
    system("clear");
#elif __WIN32 || __WIN64
    system("cls");
#endif
}


int main() {

    doClear();
    queue mainQueue;
    queue backQueue;
    int back = NULL;
    bool show = 0;
    std::string op;
    printHeader();
    while (1) {
        // backend
        if (back != NULL && show) {
            std::cout << "\033[1;36mOutput: \033[0m" << back << std::endl;
            show = !show;
        }
        std::cout << "- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << std::endl;
        int queueSize = mainQueue.doCount();
        std::cout << "Queue size: " << queueSize << std::endl;
        for (int i = 0; i < queueSize; i++) {
            int mem = mainQueue.dequeue();
            backQueue.enqueue(mem);
            std::cout << mem << " ";
        }

        while (!backQueue.empty()) {
            mainQueue.enqueue(backQueue.dequeue());
        }

        if (mainQueue.empty()) {
            std::cout << "Queue is empty";
        }
        std::cout << "\n- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -" << std::endl;
        //frontend
        std::cout << "Dashboard" << std::endl;
        std::cout << "1. Add entry" << std::endl;
        std::cout << "2. Remove entry" << std::endl;
        std::cout << "3. Exit" << std::endl;
        std::cout << "\n\033[1;35mEnter option\033[0m" << std::endl << "> ";
        std::cin >> op;
        doClear();
        if (op == "1") {
            int entry;
            std::cout << "Enter entry" << std::endl << "> ";
            while (!(std::cin >> entry)) {
                doClear();
                std::cout << "\033[1;31mError: Invalid Input!\033[0m\n";
                std::cout << "Enter entry" << std::endl << "> ";
                std::cin.clear();
                std::cin.ignore(std::numeric_limits<std::streamsize>::max(), '\n');
            }
            doClear();
            mainQueue.enqueue(entry);
            printHeader();
            std::cout << "\033[1;36mEntry added\033[0m" << std::endl;
        }
        else if (op == "2") {
            back = mainQueue.dequeue();
            doClear();
            printHeader();
            if (back == NULL)std::cout << "\033[1;31mError: Cannot dequeue from empty Queue!\033[0m\n";
            show = 1;
        }
        else if (op == "3") {
            return 0;
        }
        else {
            printHeader();
            std::cout << "\033[1;31mError: Invalid Input!\033[0m\n";
        }
    }
}