DataStructure_Assingment2-/problem1.cpp at main · Abdo-Islam/DataStructure_Assingment2- · 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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
#include <iostream>
#include <fstream>
#include <string>
using namespace std;

class node{
public:
    string URL;
    node* next;
    node(){
        this->URL = "";
        this->next = NULL;
    }
    node(string url){
        this->URL = url;
        this->next = NULL;
    }
};

class LinkedStack{
    node* top;
    int size;
public:
    LinkedStack(){
        top = NULL;
        size = 0;
    }
    LinkedStack(string url){
        node* data = new node;
        data->URL = url;
        data->next = top;
        top = data;
        size++;
    }
    bool isEmpty(){
        return (top == NULL);
    }
    void push(string url){
            node* data = new node;
            data->URL = url;
            data->next = top;
            top = data;
            size++;
    }
    void clear(){
        node* temp = new node;
        while(top != NULL){
            temp = top;
            top = top->next;
            delete temp;
        }
        size = 0;
    }
    string getTop(){
        if(isEmpty()){
            string empty = "[]";
            return empty;
        }
        else
            return top->URL;
    }
    void pop(){
        if(!isEmpty()){
            node* temp = top;
            top = top->next;
            delete temp;
        }
        size--;
    }
    int getSize(){
        return size;
    }
    void display(){
        if(!isEmpty()){
            node* temp = top;
            cout << "[  ";
            while(temp != NULL){
                cout << temp->URL << "  ";
                temp = temp->next;
            }
            cout << "]\n";
        }
        else
            cout << "[]\n";
    }
    ~LinkedStack(){
        clear();
    }
};

int convert(string line){
    if(line[2] == 's')
        return 1;
    else if(line[2] == 'B' || line[2] == 'b')
        return 2;
    else
        return 3;
}

string getUrl(string line){
    string url = "";
    for(int i = 7; i < line.length()-2; i++){
        url += line[i];
    }
    return url;
}
int main(){
    LinkedStack Back;
    LinkedStack Forward;
    int option;
    string fileName = "tst.txt";
    ifstream inFile(fileName);
    string line;
    if (inFile.is_open()) {
        while (getline(inFile, line)) {
            option = convert(line);
            if(option == 1){
                string url = getUrl(line);
                Forward.clear();
                Back.push(url);
                cout << "Visiting...\n";
                cout << "Back Stack: ";
                Back.display();
                cout << "Forward Stack: ";
                Forward.display();
                cout << "Current: " << Back.getTop() << "\n\n";
            }
            else if(option == 2){
                cout << "Go Back...\n";
                if(Back.getSize() > 1){
                    Forward.push(Back.getTop());
                    Back.pop();
                    cout << "Back Stack: ";
                    Back.display();
                    cout << "Forward Stack: ";
                    Forward.display();
                    cout << "Current: " << Back.getTop() << "\n\n";
                }
                else{
                    cout << "Can't go back :(\nEnter more URLs pls :)\n\n";
                    cout << "backStack: ";
                    Back.display();
                    cout << "Forward Stack: ";
                    Forward.display();
                    cout << "Current: " << Back.getTop() << "\n\n";
                }
            }
            else{
                cout << "Go Forward...\n";
                if(Forward.getSize() > 0){
                    Back.push(Forward.getTop());
                    Forward.pop();
                    cout << "backStack: ";
                    Back.display();
                    cout << "Forward Stack: ";
                    Forward.display();
                    cout << "Current: " << Back.getTop() << "\n\n";
                }
                else{
                    cout << "Can't go forward :(\nNo history yet :(\n";
                    cout << "backStack: ";
                    Back.display();
                    cout << "Forward Stack: ";
                    Forward.display();
                    cout << "Current: " << Back.getTop() << "\n\n";
                }
            }
        }
        cout << "\nDone reading file :)\n";
        inFile.close();
    }
    else {
        cout << "Wrong file name : " << fileName << "\nTry again at another time :)\n";
        return 0;
    }
}