Repository navigation
Expand file tree
/
Copy pathDoubleLinkedOrderedList.java
More file actions
executable file
·72 lines (55 loc) · 1.89 KB
/
Copy pathDoubleLinkedOrderedList.java
File metadata and controls
executable file
·72 lines (55 loc) · 1.89 KB
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
package com.example.doubleLinkedList;
import com.example.interfaces.OrderedListADT;
import java.util.NoSuchElementException;
public class DoubleLinkedOrderedList<T extends Comparable<? super T>> extends AbstractDoubleLinkedList<T> implements OrderedListADT<T> {
public DoubleLinkedOrderedList() {
super();
}
/**
* {@inheritDoc }
*/
@Override
public void add(T element) {
if (element == null) {
throw new NoSuchElementException("The element to add should not be null");
}
boolean placed = false;
DoubleNode<T> newNode = new DoubleNode<>(element);
DoubleNode<T> current = this.front.getNext();
while (current != this.rear && !placed && current.getElement().compareTo(element) >= 0) {
current = current.getNext();
}
newNode.setPrevious(current.getPrevious());
newNode.setNext(current);
current.getPrevious().setNext(newNode);
current.setPrevious(newNode);
this.modCount++;
this.count++;
}
@Override
protected String print() {
return super.print();
}
protected void invertList() {
DoubleNode<T> itrHead = this.front.getNext();
DoubleNode<T> itrTail = this.rear.getPrevious();
int i = this.count / 2;
while (i != 0) {
T aux = itrHead.getElement();
itrHead.setElement(itrTail.getElement());
itrTail.setElement(aux);
itrHead = itrHead.getNext();
itrTail = itrTail.getPrevious();
i--;
}
}
protected String invertPrint() {
StringBuilder s = new StringBuilder();
DoubleNode<T> current = this.rear.getPrevious();
while (current != this.front) {
s.append(current.getElement()).append(" ");
current = current.getPrevious();
}
return s.toString();
}
}