-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathlist.h
139 lines (132 loc) · 3.59 KB
/
list.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#ifndef LIST_H
#define LIST_H
#include <iostream>
#include "node.h"
#include "iterator.h"
using namespace std;
template <typename T>
class List {
private:
Node<T>* start;
int nodos;
public:
List(){
start = NULL;
nodos = 0;
}
T front(){
if (start == NULL){
throw "Lista vacia";
}
return start->data;
}
T back(){
return start->prev->data; // Por qué te olvidaste de validar este caso, si validaste el front?
}
void push_front(T value){
Node<T>* temp = new Node<T>;
temp->data = value;
nodos++;
if (start == NULL){
start = temp;
start->next = start;
start->prev = start;
}else{
temp->next = start;
temp->prev = start->prev;
start->prev->next = temp;
start->prev = temp;
start = temp;
}
}
void push_back(T value){
Node<T>* temp = new Node<T>;
temp->data = value;
nodos++;
if (start == NULL){
start = temp;
start->next = start;
start->prev = start;
}else{
temp->next = start;
temp->prev = start->prev;
start->prev->next = temp;
start->prev = temp;
}
}
void pop_front(){
if (start == NULL){
throw "Lista vacia";
}
else{
Node<T> *temp = start;
start -> prev -> next = start -> next;
start -> next -> prev = start -> prev;
start = start -> next;
nodos--;
delete temp;
}
}
void pop_back(){
Node<T> *temp = start->prev;
if (nodos == 1){
start = NULL;
temp->killSelf();
}
else{
start->prev = temp->prev; // Está incompleto
temp->killSelf();
nodos--;
}
}
T get(int position){
if (position >= nodos || position < 0){
throw "fuera de rango";
}else{
Node<T> *temp = start;
for (int i = 0; i < nodos; i++){
if ( i == position){
return temp->data;
}
temp = temp->next;
}
}// Warning por no tener return
}
void concat(List<T> &other){
start->prev->next = other->start;
other.start->prev =start->prev;
}
bool empty(){
return start == NULL;
}
int size(){
return nodos;
}
void clear(){
Node<T> *temp = start->next;
while(temp != start){
Node<T> *temp2 = temp;
temp = temp->next;
temp2->killSelf();
}
start = NULL;
delete temp;
nodos = 0;
}
Iterator<T> begin(){
if(start == NULL){
throw "Lista vacia";
}
Iterator<T> it(start);
return it;
}
Iterator<T> end(){
if(start == NULL){
throw "Lista vacia";
}
Iterator<T> ite(start->prev);
return ite;
}
~List(){}; // No implementó
};
#endif