ASD_Task_3/list.cpp at master · reyhanfarrafi/ASD_Task_3 · 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
#include "list.h"
#include "my_data.h"

void createList(List &L) {
    /**
    * FS : set first(L) and last(L) with Null
    */
    first(L) = NULL;
    last(L) = NULL;
}

address allocate(infotype x) {
    /**
    * FS : return new list element with info = x and next element is Null
    */

    address P;
    P = new elmlist;
    info(P).ID = x.ID;
    info(P).name = x.name;
    info(P).rank = x.rank;
    info(P).score = x.score;
    next(P) = NULL;
    prev(P) = NULL;

    return P;
}

void deallocate(address &P) {
    /**
    * FS : delete element pointed by P
    */
    delete P;
}

void insertFirst(List &L, address P) {
    /**
    * IS : List L may be empty
    * FS : element pointed by P became the first element in List L
    */
    if (first(L) != NULL){
        next(P) = first(L);
        prev(first(L)) = P;
        first(L) = P;
    } else {
        first(L) = P;
        last(L) = P;
    }
}

void insertLast(List &L, address P) {
    /**
    * IS : List L may be empty
    * FS : element pointed by P became the last element in List L
    */
    next(last(L)) = P;
    prev(P) = last(L);
    last(L) = P;
}

address findElm(List L, infotype x) {
    /**
    * IS : List L may be empty
    * FS : returns element with info.ID = x.ID,
           return Null if such ID is not found
    */

    address P;
    P = first(L);
    while (P != NULL && info(P).ID != x.ID){
        P = next(P);
    }

    return P;
}

void deleteFirst(List &L, address &P) {
    /**
    * IS : List L may be empty
    * FS : first element in List L is removed and is pointed by P
    */

    if(first(L) == last(L)){
        P = first(L);
        first(L) = NULL;
        last(L) = NULL;
    } else if (first(L) != NULL){
        P = first(L);
        first(L) = next(P);
        next(P) = NULL;
        prev(first(L)) = NULL;
    }
}

void deleteLast(List &L, address &P) {
    /**
    * IS : List L may be empty
    * FS : last element in List L is removed and is pointed by P
    */
    if (last(L) != NULL){
        P = last(L);
        last(L) = prev(P);
        prev(P) = NULL;
        next(last(L)) = NULL;
    } else if (first(L) == last(L)){
        P = first(L);
        first(L) = NULL;
        last(L) = NULL;
    }
}

void printInfo(List L) {
    /**
    * FS : view info of all element inside List L,
    *      call the view_data function from my_data.h to print the info
    */

    address P = first(L);
    while (P != NULL){
        view_data(info(P));
        P = next(P);
    }
    cout<<endl;
}


void insertAfter(List &L, address Prec, address P) {
    /**
    * IS : Prec and P is not NULL
    * FS : element pointed by P is placed behind the element
    *      pointed by pointer Prec
    */

    if (first(L) == NULL){
        insertFirst(L, P);
    } else if (first(L) != last(L) && Prec != NULL){
        next(P) = next(Prec);
        prev(P) = Prec;
        prev(next(Prec)) = P;
        next(Prec) = P;
    } else if (Prec != NULL){
        insertLast(L, P);
    }

}
void deleteAfter(List &L, address Prec, address &P) {
    /**
    * IS : Prec is not NULL
    * FS : element which was before behind an element pointed by Prec
    *      is removed and pointed by pointer P
    */

    if (first(L) == last(L) && Prec != NULL){
        deleteFirst(L, P);
    } else if (next(Prec) != last(L) && Prec != NULL){
        P = next(Prec);
        next(Prec) = next(P);
        prev(next(P)) = Prec;
        next(P) = NULL;
        prev(P) = NULL;
    } else if (Prec != NULL) {
        deleteLast(L, P);
    }
}