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

1301190221 / Vincentius Arnold Fridolin / IF - 43 - 05 #152

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

1301190221 / Vincentius Arnold Fridolin / IF - 43 - 05 #152

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
efe666a
last summary commit
vincentiusar Feb 18, 2020
2c81ffc
last commit
vincentiusar Feb 18, 2020
5e883a0
Update main.cpp
vincentiusar Feb 18, 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
5 changes: 5 additions & 0 deletions .vscode/settings.json
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
{
"files.associations": {
"iostream": "cpp"
}
}
96 changes: 74 additions & 22 deletions list.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,8 +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,8 +19,13 @@ 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;

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


//----------------------------------------
Expand All @@ -43,7 +48,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 +67,9 @@ 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,7 +84,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);
}


//----------------------------------------
Expand All @@ -83,10 +100,17 @@ 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,9 +120,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,8 +140,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 +158,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,9 +179,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);
}

//----------------------------------------
}

}
9 changes: 6 additions & 3 deletions list.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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 All @@ -61,7 +64,7 @@ void insertLast(List &L, address P);
void deleteFirst(List &L, address &P);
void deleteLast(List &L, address &P);
void insertAfter(List &L, address Prec, address P);
void deleteAfter(List&L, address Prec, address &P);
void deleteAfter(List &L, address Prec, address &P);

// define search-by-ID function and view procedure
address findElm(List L, infotype x);
Expand Down
45 changes: 44 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,50 @@ void mainMenu() {
case 1:
X = create_data();
P = allocate(X);
insertFirst(L,P)
if (findElm(L, info(P)) == NULL) {
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;
}
if (choice == 0) {
break;
}
} while(true);
Expand Down
27 changes: 18 additions & 9 deletions my_data.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,10 +1,9 @@

#include "my_data.h"

/**
CLASS :
NAME :
STUDENT ID :
CLASS : IF - 43 - 05
NAME : Vincentius Arnold Fridolin
STUDENT ID : 1301190221
**/

mytype create_data() {
Expand All @@ -15,9 +14,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,8 +36,8 @@ 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 +54,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
11 changes: 7 additions & 4 deletions my_data.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,9 +5,9 @@
using namespace std;

/**
CLASS :
NAME :
STUDENT ID :
CLASS : IF - 43 - 05
NAME : Vincentius Arnold Fridolin
STUDENT ID : 1301190221
**/

struct mytype {
Expand All @@ -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 Down
Loading