Skip to content
Merged
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
9 changes: 9 additions & 0 deletions CONTRIBUTING.MD
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
# Contributing Guide

Terima kasih sudah ingin berkontribusi! 🎉

1. Fork repo ini.
2. Buat branch baru: `git checkout -b feature-nama`.
3. Commit perubahan dengan pesan jelas.
4. Push ke branch.
5. Buka Pull Request.
2 changes: 0 additions & 2 deletions src/stack.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -70,7 +70,6 @@ class Stack{
}

};
#ifndef UNIT_TEST
int main(){
Stack stack1(100);
stack1.push(1);
Expand All @@ -83,4 +82,3 @@ int main(){
std::cout << "element paling atas: " << stack1.top() << std::endl;
return 0;
}
#endif UNIT_TEST
13 changes: 9 additions & 4 deletions src/stack_linked_list.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -50,13 +50,18 @@ class Stack{
head = nullptr;
return *this;
}
head = new Node(obj.head->data);
//head adalah object saat ini
//obj adalah objek lain yang ingin di copy
head = new Node(obj.head->data);
//isi node pertama yang menunjuk head dengan mengambil dari object lain(ingin di copy)
Node* curr = head;
//pakai curr sebagai pointer penunjuk
Node* temp = obj.head->next;
//inialisasi temp sebagai pointer untuk mengerakkan obj.head(object lain)
while(temp != nullptr){
curr->next = new Node(temp->data);
curr = curr->next;
temp = temp->next;
curr->next = new Node(temp->data); // insert node dari object lain
curr = curr->next; //jalankan pointer curr
temp = temp->next; //jalankan pointet temp
}
return *this;
}
Expand Down
3 changes: 2 additions & 1 deletion src/stack_templates_implement.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -39,10 +39,11 @@ class Stack{
//copy constructor
Stack(const Stack& obj){
size = obj.size; //supaya tiap object konsisten size yg dimiliki
capacity = obj.capacity;
arr = new type[capacity]; //alokasi ulang arr
for(size_t i = 0;i < size;i++){
arr[i] = obj.arr[i];
}
}
}
Stack& operator=(const Stack& obj){
//this disini menunjuk objek saat ini
Expand Down
Loading