Skip to content

NaufalYozhaRevansyah-1301194282-Task4 #169

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
Naufalyozha wants to merge 3 commits into
base: master
Choose a base branch
from
Open

NaufalYozhaRevansyah-1301194282-Task4 #169

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
a7adaea
Update list.cpp
Naufalyozha Mar 7, 2020
e3ace0e
Update list.h
Naufalyozha Mar 7, 2020
709b289
Update player.cpp
Naufalyozha Mar 7, 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
98 changes: 87 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,10 @@ address allocate(infotype x) {

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

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

delete P;
//----------------------------------------
}

void insertFirst(List &L, address P) {
/**
* IS : List L mungkin kosong
* FS : elemen yang ditunjuk P menjadi elemen pertama pada List L
*/
//------------- YOUR CODE HERE -------------

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

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

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

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

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

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

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

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

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

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

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

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

P = next(Prec);
if (next(next(Prec)) == Prec)
{
next(P) = NULL;
prev(P) = NULL;
next(Prec) = Prec;
prev(Prec) = Prec;
}
else
{
next(Prec) = next(P);
prev(next(P)) = Prec;
next(P) = NULL;
prev(P) = 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 prev;
address next;

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

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

address first;

//----------------------------------------
};
Expand Down
50 changes: 46 additions & 4 deletions player.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -43,9 +43,29 @@ void shuffleList(List &L) {
* FS : isi (elemen) dari list teracak
*/
//------------- YOUR CODE HERE -------------

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

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

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

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

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

address P,Q;
P = prev(P);
if (next(P) == first(L))
{
deleteFirst(L,P);
}
else if (info(next(P)).ID == x.ID )
{
deleteAfter(L,P,Q);
deallocate(Q);
}
cout<<"UNDER MAIN TENIS"<<endl;

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