Skip to content

Muhammad sulthon asramanggala / IF 43 05/ 130119408 #165

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

Open
msulthon wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Muhammad sulthon asramanggala / IF 43 05/ 130119408 #165

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
91 changes: 80 additions & 11 deletions list.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@ void createList(List &L) {
* FS : first(L) diset Nil
*/
//------------- YOUR CODE HERE -------------

first(L) = NULL;
//----------------------------------------
}

Expand All @@ -17,7 +17,12 @@ address allocate(infotype x) {

address P = NULL;
//------------- YOUR CODE HERE -------------

P = new elmlist;
info(P).ID = x.ID;
info(P).location = x.location;
info(P).name = x.name;
next(P) = NULL;
prev(P) = NULL;
//----------------------------------------
return P;
}
Expand All @@ -27,7 +32,7 @@ void deallocate(address &P) {
* FS : menghapus elemen yang ditunjuk oleh P (delete)
*/
//------------- YOUR CODE HERE -------------

delete(P);
//----------------------------------------
}

Expand All @@ -37,7 +42,17 @@ void insertFirst(List &L, address P) {
* FS : elemen yang ditunjuk P menjadi elemen pertama pada List L
*/
//------------- YOUR CODE HERE -------------

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

Expand All @@ -47,7 +62,14 @@ void insertLast(List &L, address P) {
* FS : elemen yang ditunjuk P menjadi elemen terakhir pada List L
*/
//------------- YOUR CODE HERE -------------

if (first(L) == NULL) {
insertFirst(L, P);
} else {
next(P) = first(L);
prev(P) = L.first -> prev;
first(L) -> prev -> next = P;
first(L) -> prev = P;
}
//----------------------------------------
}

Expand All @@ -60,7 +82,13 @@ address findElmByID(List L, infotype x) {

address P = NULL;
//------------- YOUR CODE HERE -------------

P = first(L);
do {
P = next(P);
} while (P != first(L) && P -> info.ID != x.ID);
if (P == first(L) && P -> info.ID != x.ID) {
return NULL;
}
//----------------------------------------
return P;
}
Expand All @@ -74,7 +102,13 @@ address findElmByName(List L, infotype x) {

address P = NULL;
//------------- YOUR CODE HERE -------------

P = first(L);
do {
P = next(P);
} while (P != first(L) && P -> info.name != x.name);
if (P == first(L) && P -> info.name != x.name) {
return NULL;
}
//----------------------------------------
return P;
}
Expand All @@ -85,7 +119,19 @@ void deleteFirst(List &L, address &P) {
* FS : elemen pertama di dalam List L dilepas dan disimpan/ditunjuk oleh P
*/
//------------- YOUR CODE HERE -------------

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

Expand All @@ -95,7 +141,15 @@ void deleteLast(List &L, address &P) {
* FS : elemen tarakhir di dalam List L dilepas dan disimpan/ditunjuk oleh P
*/
//------------- YOUR CODE HERE -------------

if (L.first == NULL) {
deleteFirst(L, P);
} else {
P = L.first -> prev;
P -> prev -> next = L.first;
L.first -> prev = P -> prev;
P -> next = NULL;
P -> prev = NULL;
}
//----------------------------------------
}

Expand All @@ -106,7 +160,14 @@ void insertAfter(List &L, address &Prec, address P) {
* ditunjuk pointer Prec
*/
//------------- YOUR CODE HERE -------------

if (L.first == NULL) {
insertFirst(L, P);
} else {
P -> next = Prec -> next;
P -> prev = Prec;
Prec -> next -> prev = P;
Prec -> next = P;
}
//----------------------------------------

}
Expand All @@ -117,7 +178,15 @@ void deleteAfter(List &L, address &Prec, address &P) {
* dan disimpan/ditunjuk oleh P
*/
//------------- YOUR CODE HERE -------------

if (Prec -> next == L.first) {
deleteFirst(L, P);
} else {
P = Prec -> next;
P -> next -> prev = Prec;
Prec -> next = P -> next;
P -> next = NULL;
P -> prev = NULL;
}
//----------------------------------------
}

6 changes: 4 additions & 2 deletions list.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -29,14 +29,16 @@ typedef struct elmlist *address;

struct elmlist {
//------------- YOUR CODE HERE -----------

infotype info;
address next;
address prev;

//----------------------------------------
};

struct List {
//------------- YOUR CODE HERE -----------

address first;

//----------------------------------------
};
Expand Down
16 changes: 13 additions & 3 deletions main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,7 @@ int main() {

x.ID = index_ID++;
x.location = "asset";
x.name = "re.wav";
x.name = "do'.wav";
P = allocate(x);
insertLast(L,P);

Expand Down Expand Up @@ -123,6 +123,8 @@ void runMenu(int menu) {
// insert last music
//------------- YOUR CODE HERE -------------
cout<<"UNDER MAIN TENIS"<<endl;
P = inputMusic();
insertLast(L, P);
//input music
//insertLast()

Expand All @@ -143,7 +145,8 @@ void runMenu(int menu) {
// play last music
//------------- YOUR CODE HERE -------------
cout<<"UNDER MAIN TENIS"<<endl;

P = L.first -> prev;
playMusic(P);
//----------------------------------------
break;
case 6:
Expand All @@ -162,7 +165,14 @@ void runMenu(int menu) {
// search music by ID
//------------- YOUR CODE HERE -------------
cout<<"UNDER MAIN TENIS"<<endl;

cout<<"input music ID : ";
cin >> x.ID;
P = findElmByID(L, x);
if(P != NULL){
cout<<"music found"<<endl;
} else {
cout<<"music NOT found"<<endl;
}
//----------------------------------------
cout<<"press enter";getche();
break;
Expand Down
34 changes: 31 additions & 3 deletions player.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -43,7 +43,24 @@ void shuffleList(List &L) {
* FS : isi (elemen) dari list teracak
*/
//------------- YOUR CODE HERE -------------

address P = first(L);
int jumlah = 0;
do {
P = next(P);
jumlah++;
} while (P != first(L));
while (jumlah > 0) {
P = first(L);
int k = randomInt(jumlah);
while (k != 0) {
P = next(P);
k--;
}
address Q = P;
deleteAfter(L, Prev(P), Q);
insertFirst(L, Q);
jumlah--;
}
cout<<"UNDER MAIN TENIS"<<endl;

//----------------------------------------
Expand All @@ -55,7 +72,13 @@ void playRepeat(List &L, int n) {
* dari lagu pertama hingga terakhir sebanyak n kali
*/
//------------- YOUR CODE HERE -------------

address P = first(L);
for (int i = 0; i < n; i++) {
do {
playMusic(P);
P = next(P);
} while (P != first(L));
}
cout<<"UNDER MAIN TENIS"<<endl;

//----------------------------------------
Expand All @@ -69,7 +92,12 @@ void deleteMusicByID(List &L, infotype x) {
* FS : elemen dengan ID yang dicari dideallocate
*/
//------------- YOUR CODE HERE -------------

if (first(L) != NULL) {
if (findElmByID(L, x) != NULL) {
deleteAfter(L, findElmByID(L, x) -> prev, P);
deallocate(P);
}
}
cout<<"UNDER MAIN TENIS"<<endl;

//----------------------------------------
Expand Down
48 changes: 44 additions & 4 deletions player.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,10 +3,21 @@

#include "list.h"

/** YOU DON'T NEED TO MODIFY THESE **/
/** YOU DON'T NEED TO MODIFY THIS */



int randomInt(int);
// helper random for shuffle
address Q = first(L);
do {
cout<<"name : "<<info(Q).name<<endl
<<"ID : "<<info(Q).ID<<endl
<<"location: "<<info(Q).location<<endl;
Q = next(Q);
} while(Q!=first(L));
cout<<"==============================================="<<endl;
}

void printInfo(List);
// output the songs in the list
Expand All @@ -16,15 +27,44 @@ void playMusic(address P);

void shuffleList(List &);
// shuffle the song list

address P = first(L);
int jumlah = 0;
do {
P = P -> next;
jumlah++;
} while (P != first(L));
while (jumlah > 0) {
P = first(L);
int k = randomInt(jumlah);
while (k != 0) {
P = next(P);
k--;
}
address Q = P;
deleteAfter(L, prev(P), Q);
insertFirst(L, Q);
jumlah--;
}
void playRepeat(List &, int n);
// play the song list from the first song
// and repeat the list n times

address P = first(L);
for (int i = 0; i < n; i++) {
do {
playMusic(P);
P = next(P);
} while (P != first(L));
}
void deleteMusicByID(List &, infotype);
// user input song ID
// remove the song from the list

address P;
if (first(L) != NULL) {
if (findElmByID(L, x) != NULL) {
deleteAfter(L, findElmByID(L, x) -> prev, P);
deallocate(P);
}
}


#endif // PLAYER_H_INCLUDED