/
OrderedList.java
160 lines (146 loc) · 2.69 KB
/
OrderedList.java
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
public class OrderedList<E>
{
private NodoOrdList<E> head;
private NodoOrdList<E> tail;
public OrderedList()
{
head=tail=null;
}
public NodoOrdList<E> getMax()
{
return head;
}
public NodoOrdList<E> getMin()
{
return tail;
}
public boolean isEmpty()
{
return head==null;
}
public void clearAll()
{
head=tail=null;
}
public void insertHead(E val)
{
if(isEmpty())
head=tail=new NodoOrdList<E>(val);
else
{
NodoOrdList<E> n=new NodoOrdList<E>(val,head,null);
head=n;
head.getNext().setPrev(n);
}
}
public void insertTail(E val)
{
if(isEmpty())
head=tail=new NodoOrdList<E>(val);
else
{
NodoOrdList<E> n=new NodoOrdList<E>(val,null,tail);
tail=n;
tail.getPrev().setNext(n);
}
}
public void insertOrdered(E key)
{
if(isEmpty())
head=tail=new NodoOrdList<E>(key);
else
{
if(((Comparable)head.getInfo()).compareTo(key)<=0)
insertHead(key);
else if(((Comparable)tail.getInfo()).compareTo(key)>0)
insertTail(key);
else
{
NodoOrdList<E> aux=head;
while(((Comparable)aux.getInfo()).compareTo(key)>0)
aux=aux.getNext();
NodoOrdList<E> n=new NodoOrdList<E>(key,aux,aux.getPrev());
aux.getPrev().setNext(n);
aux.setPrev(n);
}
}
}
public void deleteHead()
{
if(head==tail)
head=tail=null;
else
{
head=head.getNext();
head.setPrev(null);
}
}
public void deleteTail()
{
if(head==tail)
head=tail=null;
else
{
tail=tail.getPrev();
tail.setNext(null);
}
}
public void delete(E key)
{
try
{
if(isEmpty())
throw new Exception("Error! Empty list!");
else
{
if(((Comparable)head.getInfo()).compareTo(key)==0)
deleteHead();
else if(((Comparable)tail.getInfo()).compareTo(key)==0)
deleteTail();
else
{
NodoOrdList<E> aux=head;
while(aux!=null && ((Comparable)aux.getInfo()).compareTo(key)!=0)
aux=aux.getNext();
if(aux==null)
throw new Exception("Error! Element "+key+" doesn't exist!");
else
{
aux.getPrev().setNext(aux.getNext());
aux.getNext().setPrev(aux.getPrev());
}
}
}
}
catch(Exception e)
{
System.out.println(e.getMessage());
}
}
public E get(int pos)
{
int i=1;
NodoOrdList<E> aux=head;
for(i=1;i<pos;i++)
aux=aux.getNext();
return aux.getInfo();
}
public String toString()
{
String str="";
if(isEmpty())
str="La lista attualmente e' vuota \n";
else
{
str="Gli elementi attualmente presenti nella lista sono: \n";
NodoOrdList<E> aux=head;
while(aux!=null)
{
str+=aux.getInfo().toString()+"\t";
aux=aux.getNext();
}
str+="\n";
}
return str;
}
}