summaryrefslogtreecommitdiff
path: root/I_anno/Programmazione_2/data_structures/list.cc
diff options
context:
space:
mode:
Diffstat (limited to 'I_anno/Programmazione_2/data_structures/list.cc')
-rw-r--r--I_anno/Programmazione_2/data_structures/list.cc164
1 files changed, 0 insertions, 164 deletions
diff --git a/I_anno/Programmazione_2/data_structures/list.cc b/I_anno/Programmazione_2/data_structures/list.cc
deleted file mode 100644
index 8ddcbf9..0000000
--- a/I_anno/Programmazione_2/data_structures/list.cc
+++ /dev/null
@@ -1,164 +0,0 @@
-#include<iostream>
-
-using namespace std;
-
-template<typename T>
-struct node {
- T value;
- node* next;
-};
-
-
-template<typename T>
-class list {
-public:
- list() : _head{nullptr} {}
-
- ~list() {
- while(_head) {
- node<T>* tmp = _head->next;
- delete tmp;
- _head = tmp;
- }
- }
-
- list* push_front(T val) {
- _head = new node<T>{val, _head};
-
- return this;
- }
-
- list* push_back(T val) {
- if(!_head) return this->push_front(val);
-
- node<T>* iter = _head;
- while(iter->next) {
- iter = iter->next;
- }
- iter->next = new node<T>{val, nullptr};
-
- return this;
- }
-
- list* push_after_value(T val, T newval) {
- node<T>* iter = _search(val);
- if(iter)
- iter->next = new node<T>{newval, iter->next};
-
- return this;
- }
-
- list* push_before_value(T val, T newval) {
- node<T>* elem = _search(val);
- if(!elem) return this;
-
- node<T>* iter = _head;
-
- if(iter->value == val)
- return this->push_front(newval);
-
- while(iter->next != elem)
- iter = iter->next;
-
- iter->next = new node<T>{newval, iter->next};
-
- return this;
- }
-
- list* pop(int val) {
- node<T>* elem = _search(val);
- if(!elem) return this;
-
- node<T>* iter = _head;
- if(iter == elem) return this->pop_front();
-
- while(iter->next != elem)
- iter = iter->next;
-
- node<T>* temp = iter->next;
- iter->next = iter->next->next;
- delete temp;
-
- return this;
- }
-
- list* pop_front() {
- if(!_head)
- return this;
-
- node<T>* elem = _head;
- _head = _head->next;
- delete elem;
-
- return this;
- }
-
- list* pop_back() {
- if(!_head)
- return this;
-
- node<T>* iter = _head;
-
- while(iter->next && iter->next->next) {
- iter = iter->next;
- }
-
- if(!iter->next) {
- delete iter;
- _head = nullptr;
- } else if(iter->next->next) {
- delete iter->next->next;
- } else {
- delete iter->next;
- }
-
- iter->next = nullptr;
-
- return this;
- }
-
- void print() {
- node<T>* iter = _head;
- while(iter) {
- cout << iter->value << ' ';
- iter = iter->next;
- }
- }
-private:
- node<T>* _search(T value) {
- node<T>* iter = _head;
- while(iter && iter->value != value)
- iter = iter->next;
-
- return iter;
- }
-
- node<T>* _head;
-};
-
-int main() {
- list<int>* l = new list<int>{};
- l->push_front(2)->push_front(1);
- l->print(); cout << endl;
- l->push_back(5);
- l->print(); cout << endl;
- l->push_back(10)->push_back(15);
- l->print(); cout << endl;
- l->push_after_value(5, 6);
- l->print(); cout << endl;
- l->push_before_value(5, 4);
- l->print(); cout << endl;
- l->push_before_value(4, 3);
- l->print(); cout << endl;
- l->pop_back();
- l->print(); cout << endl;
- l->pop_front();
- l->print(); cout << endl;
- l->push_front(1);
- l->print(); cout << endl;
- l->pop(1);
- l->print(); cout << endl;
-
- delete l;
- return 0;
-}