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.

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

Arpriansah Yonathan_1301194112_IF-43-05 #174

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
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
28 changes: 28 additions & 0 deletions ASD_Task_3.depend
Original file line number Diff line number Diff line change
Expand Up @@ -52,3 +52,31 @@
"operation.h"
"my_data.h"

1582302347 source:c:\users\user\documents\github\asd_task_3\my_data.cpp
"my_data.h"

1582290900 c:\users\user\documents\github\asd_task_3\my_data.h
<iostream>

1582381111 source:c:\users\user\documents\github\asd_task_3\main.cpp
<iostream>
"list.h"
"operation.h"
"my_data.h"

1581871771 c:\users\user\documents\github\asd_task_3\list.h
<iostream>
"my_data.h"

1581870670 c:\users\user\documents\github\asd_task_3\operation.h
"list.h"

1582298861 source:c:\users\user\documents\github\asd_task_3\list.cpp
"list.h"
"my_data.h"

1582381711 source:c:\users\user\documents\github\asd_task_3\operation.cpp
"list.h"
"operation.h"
"my_data.h"

28 changes: 14 additions & 14 deletions ASD_Task_3.layout
Original file line number Diff line number Diff line change
Expand Up @@ -2,39 +2,39 @@
<CodeBlocks_layout_file>
<FileVersion major="1" minor="0" />
<ActiveTarget name="Debug" />
<File name="my_data.h" open="0" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="list.h" open="1" top="0" tabpos="2" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="496" topLine="7" />
<Cursor1 position="824" topLine="47" />
</Cursor>
</File>
<File name="operation.cpp" open="0" top="0" tabpos="0" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="my_data.h" open="1" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="-1" zoom_2="0">
<Cursor>
<Cursor1 position="288" topLine="0" />
<Cursor1 position="610" topLine="9" />
</Cursor>
</File>
<File name="list.cpp" open="0" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="operation.cpp" open="1" top="0" tabpos="4" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="2862" topLine="116" />
<Cursor1 position="997" topLine="0" />
</Cursor>
</File>
<File name="main.cpp" open="0" top="0" tabpos="1" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="list.cpp" open="1" top="0" tabpos="7" split="0" active="1" splitpos="0" zoom_1="-1" zoom_2="0">
<Cursor>
<Cursor1 position="1006" topLine="0" />
<Cursor1 position="1699" topLine="30" />
</Cursor>
</File>
<File name="my_data.cpp" open="0" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="main.cpp" open="1" top="1" tabpos="6" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="774" topLine="0" />
<Cursor1 position="1262" topLine="42" />
</Cursor>
</File>
<File name="list.h" open="0" top="0" tabpos="6" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="operation.h" open="1" top="0" tabpos="3" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="688" topLine="17" />
<Cursor1 position="149" topLine="0" />
</Cursor>
</File>
<File name="operation.h" open="0" top="0" tabpos="0" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<File name="my_data.cpp" open="1" top="0" tabpos="5" split="0" active="1" splitpos="0" zoom_1="0" zoom_2="0">
<Cursor>
<Cursor1 position="207" topLine="0" />
<Cursor1 position="975" topLine="0" />
</Cursor>
</File>
</CodeBlocks_layout_file>
Binary file added bin/Debug/ASD_Task_3.exe
Binary file not shown.
94 changes: 62 additions & 32 deletions list.cpp
Original file line number Diff line number Diff line change
@@ -1,14 +1,15 @@
#include "list.h"
#include "my_data.h"

using namespace std;

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,9 +20,9 @@ address allocate(infotype x) {

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


P = new elmlist;
info(P) = x;
next(P) = NULL;
//----------------------------------------
return P;
}
Expand All @@ -31,7 +32,7 @@ void deallocate(address &P) {
* FS : delete element pointed by P
*/
//-------------your code here-------------
your code here
delete P;


//----------------------------------------
Expand All @@ -43,9 +44,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 && last(L) != NULL){
next(P) = first(L);
prev(first(L)) = P;
first(L) = P;
}else{
first(L) = P;
last(L) = P;
}
//----------------------------------------
}

Expand All @@ -55,9 +61,14 @@ void insertLast(List &L, address P) {
* FS : element pointed by P became the last element in List L
*/
//-------------your code here-------------
your code here


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

Expand All @@ -70,9 +81,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,10 +95,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) = next(P);
next(P) = NULL;
prev(first(L)) = NULL;
}else{
P = first(L);
first(L) = NULL;
last(L) = NULL;
}
//----------------------------------------
}

Expand All @@ -96,10 +114,15 @@ 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(first(L) == last(L)){
first(L) = NULL;
last(L) = NULL;
}else{
P = last(L);
last(L) = prev(P);
prev(P) = NULL;
next(last(L)) = NULL;
}
//----------------------------------------
}

Expand All @@ -109,9 +132,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,8 +149,10 @@ void insertAfter(List &L, address Prec, address P) {
* pointed by pointer Prec
*/
//-------------your code here-------------
your code here

next(P) = next(Prec);
prev(next(Prec)) = P;
next(Prec) = P;
prev(P) = Prec;
//----------------------------------------

}
Expand All @@ -135,9 +163,11 @@ void deleteAfter(List &L, address Prec, address &P) {
* is removed and pointed by pointer P
*/
//-------------your code here-------------
your code here


P = next(Prec);
next(Prec) = next(P);
prev(next(P)) = Prec;
next(P) = NULL;
prev(P) = NULL;
//----------------------------------------
}

14 changes: 8 additions & 6 deletions list.h
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,14 +37,16 @@ typedef struct elmlist *address;

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

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

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


address first;
address last;
//----------------------------------------
};

Expand Down
41 changes: 39 additions & 2 deletions main.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -50,8 +50,45 @@ void mainMenu() {
switch(choice) {
case 1:
X = create_data();
P = allocate(X);
insertFirst(L,P)
insertAndSort(L, X);
break;
case 2:
printInfo(L);
break;
case 3:
cout << "Masukkan ID : ";
cin >> X.ID;
P = findElm(L, X);
if(P != NULL){
view_data(info(P));
}else{
cout << "Tidak ditemukan\n";
}
break;
case 4:
cout << "Masukkan ID : ";
cin >> X.ID;
P = findElm(L, X);
if(P != NULL){
edit_data(info(P));
}else{
cout << "Tidak ditemukan\n";
}
break;
case 5:
cout << "Masukkan ID : ";
cin >> X.ID;
if(findElm(L, X) != NULL){
deletebyID(L, X.ID);
}else{
cout << "Tidak ditemukan" << endl;
}
break;
case 6:
savePassedMember(L, L_passed);
break;
case 7:
printInfo(L_passed);
break;
}
} while(true);
Expand Down
28 changes: 19 additions & 9 deletions my_data.cpp
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 : Arpriansah Yonathan
STUDENT ID : 1301194112
**/

mytype create_data() {
Expand All @@ -15,7 +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 rank : ";
cin >> d.rank;
cout << "Masukkan score : ";
cin >> d.score;



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

// ===========================
// YOUR CODE HERE
your code here


cout << "ID : " << d.ID << " || Nama :" << d.name << " || Rank : " << d.rank << " || Score : " << d.score << endl;


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

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



Expand Down
Loading