Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

1301190369 || Daffa Barin Tizard Riyadi || IF 43 05 #154

Open
wants to merge 7 commits into
base: master
Choose a base branch
from
Open

1301190369 || Daffa Barin Tizard Riyadi || IF 43 05 #154

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
7 commits
Select commit Hold shift + click to select a range
6a6e96c
Update list.cpp
DaffaBarin Feb 21, 2020
3c7356f
Update list.h
DaffaBarin Feb 21, 2020
a886d97
Update main.cpp
DaffaBarin Feb 21, 2020
bed738c
Update my_data.cpp
DaffaBarin Feb 21, 2020
a38d392
Update my_data.h
DaffaBarin Feb 21, 2020
30f6b0d
Update my_data.cpp
DaffaBarin Feb 21, 2020
fe8b544
Update operation.cpp
DaffaBarin Feb 21, 2020
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
87 changes: 74 additions & 13 deletions list.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,8 @@ void createList(List &L) {
* FS : set first(L) and last(L) with Null
*/
//-------------your code here-------------
your code here
first(L) = NULL;
last(L) = NULL;


//----------------------------------------
Expand All @@ -19,7 +20,14 @@ address allocate(infotype x) {

address P;
//-------------your code here-------------
your code here
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;



//----------------------------------------
Expand All @@ -31,7 +39,7 @@ void deallocate(address &P) {
* FS : delete element pointed by P
*/
//-------------your code here-------------
your code here
delete P;


//----------------------------------------
Expand All @@ -43,7 +51,14 @@ void insertFirst(List &L, address P) {
* FS : element pointed by P became the first element in List L
*/
//-------------your code here-------------
your code here
if (first(L) != NULL) {
next(P) = first(L);
prev(first(L)) = P;
first(L) = P;
} else {
first(L) = P;
last(L) = P;
}


//----------------------------------------
Expand All @@ -55,7 +70,10 @@ void insertLast(List &L, address P) {
* FS : element pointed by P became the last element in List L
*/
//-------------your code here-------------
your code here
next(last(L)) = P;
prev(P) = last(L);
last(L) = P;



//----------------------------------------
Expand All @@ -70,8 +88,10 @@ address findElm(List L, infotype x) {

address P;
//-------------your code here-------------
your code here

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

//----------------------------------------
return P;
Expand All @@ -83,8 +103,16 @@ void deleteFirst(List &L, address &P) {
* FS : first element in List L is removed and is pointed by P
*/
//-------------your code here-------------
your code here

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;
}


//----------------------------------------
Expand All @@ -96,7 +124,16 @@ void deleteLast(List &L, address &P) {
* FS : last element in List L is removed and is pointed by P
*/
//-------------your code here-------------
your code here
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;
}



Expand All @@ -109,7 +146,12 @@ void printInfo(List L) {
* call the view_data function from my_data.h to print the info
*/
//-------------your code here-------------
your code here
address P = first(L);
while (P != NULL) {
view_data(info(P));
P = next(P);
}
cout << endl;


//----------------------------------------
Expand All @@ -123,7 +165,16 @@ void insertAfter(List &L, address Prec, address P) {
* pointed by pointer Prec
*/
//-------------your code here-------------
your code here
if (first(L) == NULL) {
insertFirst(L, P);
} else if (first(L) != last(L) && Prec != NULL) {
next(P) = next(Prec);
P -> prev = Prec;
prev(next(Prec)) = P;
next(Prec) = P;
} else if (Prec != NULL) {
insertLast(L, P);
}

//----------------------------------------

Expand All @@ -135,7 +186,17 @@ void deleteAfter(List &L, address Prec, address &P) {
* is removed and pointed by pointer P
*/
//-------------your code here-------------
your code here
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);
}


//----------------------------------------
Expand Down
13 changes: 8 additions & 5 deletions list.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -23,9 +23,9 @@ using namespace std;
* prev : address
* >
*
* Type List : <
* first : address
* last : address
* Type List : <
* first : address
* last : address
* >
*
**/
Expand All @@ -37,13 +37,16 @@ typedef struct elmlist *address;

struct elmlist{
//------------- your code here -----------

infotype info;
address next;
address prev;
//----------------------------------------
};

struct List{
//------------- your code here -----------

address first;
address last;

//----------------------------------------
};
Expand Down
40 changes: 39 additions & 1 deletion main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -51,7 +51,45 @@ void mainMenu() {
case 1:
X = create_data();
P = allocate(X);
insertFirst(L,P)
insertFirst(L,P);
break;
case 2:
printInfo(L);
break;
case 3:
cout << "Masukkan ID yang ingin dicari : ";
cin >> X.ID;
P = findElm(L, X);
if (P != NULL) {
view_data(info(P));
} else {
cout << "DATA TIDAK DITEMUKAN!\n";
}
break;
case 4:
cout << "Masukkan ID yang ingin diedit : ";
cin >> X.ID;
P = findElm(L, X);
if (P != NULL) {
edit_data(info(P));
} else {
cout << "DATA TIDAK DITEMUKAN!\n";
}
break;
case 5:
cout << "Masukkan ID yang ingin didelete : ";
cin >> X.ID;
if (findElm(L, X) != NULL) {
deletebyID(L, X.ID);
} else {
cout << "DATA TIDAK DITEMUKAN" << endl;
}
break;
case 6:
savePassedMember(L, L_passed);
break;
case 7:
printInfo(L_passed);
break;
}
} while(true);
Expand Down
27 changes: 19 additions & 8 deletions my_data.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,10 +1,10 @@

#include "my_data.h"

/**
CLASS :
NAME :
STUDENT ID :
CLASS : IF-43-05
NAME : DAFFA BARIN TIZARD RIYADI
STUDENT ID : 1301190369
**/

mytype create_data() {
Expand All @@ -15,8 +15,14 @@ mytype create_data() {
mytype d;
// ===========================
// YOUR CODE HERE
your code here

cout << "Masukkan ID : ";
cin >> d.ID;
cout << "Masukkan Nama : ";
cin >> d.name;
cout << "Masukkan ranking : ";
cin >> d.rank;
cout << "Masukkan score : ";
cin >> d.score;



Expand All @@ -32,7 +38,7 @@ void view_data(mytype d) {

// ===========================
// YOUR CODE HERE
your code here
cout << d.ID << " - " << d.name << " - "<< d.rank << " - " << d.score << endl;



Expand All @@ -50,7 +56,12 @@ void edit_data(mytype &d) {

// ===========================
// YOUR CODE HERE
your code here
cout << "Masukkan pergantian nama : ";
cin >> d.name;
cout << "Masukkan pergantian rank : ";
cin >> d.rank;
cout << "Masukkan pergantian score : ";
cin >> d.score;



Expand Down
7 changes: 5 additions & 2 deletions my_data.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,10 @@ struct mytype {
*/
//=================================================
// YOUR CODE STARTS HERE
your code here
int ID;
string name;
int rank;
float score;

// YOUR CODE ENDS HERE
//=================================================
Expand All @@ -29,6 +32,6 @@ struct mytype {

mytype create_data();
void view_data(mytype d);
void edit_data(mytype &d);
void edit_data(mytype &d);

#endif // MY_DATA_H_INCLUDED
43 changes: 39 additions & 4 deletions operation.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
#include "list.h"
#include "operation.h"
#include "my_data.h"


void insertAndSort(List &L, infotype x) {
/**
Expand All @@ -14,7 +14,17 @@ void insertAndSort(List &L, infotype x) {
*/

//-------------your code here-------------
your code here
address p, p1;
p = first(L);
if (p == NULL || info(p).ID > x.ID) {
insertFirst(L, allocate(x));
} else if (findElm(L, x) == NULL) {
while (p != NULL && info(p).ID < x.ID) {
p1 = p;
p = next(p);
}
insertAfter(L, p1, allocate(x));
}


//----------------------------------------
Expand All @@ -29,7 +39,17 @@ void deletebyID(List &L, int id_x) {

address Prec, P;
//-------------your code here-------------
your code here
P = first(L);
if (P == first(L) && id_x == info(P).ID) {
deleteFirst(L, P);
} else {
while (P != NULL) {
if (id_x == info(P).ID && first(L) != last(L)) {
deleteAfter(L, prev(P), P);
}
P = next(P);
}
}


//----------------------------------------
Expand All @@ -43,7 +63,22 @@ void savePassedMember(List &L, List &L2){
*/
address P;
//-------------your code here-------------
your code here
P = first(L);
address Q = P;
while (Q != NULL) {
P = Q;
if (info(P).score > 80) {
insertAndSort(L2, info(P));
Q = next(Q);
if (prev(P) == NULL) {
deleteFirst(L, P);
} else {
deleteAfter(L, prev(P), P);
}
} else {
Q = next(Q);
}
}


//----------------------------------------
Expand Down