-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayFrontBackCappedList.java
More file actions
167 lines (137 loc) · 3.37 KB
/
ArrayFrontBackCappedList.java
File metadata and controls
167 lines (137 loc) · 3.37 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
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
161
162
163
164
165
166
167
public class ArrayFrontBackCappedList<T> implements FrontBackCappedListInterface<T> {
private T[] list;
private int numberOfElements;
public ArrayFrontBackCappedList(int maximumSize) {
@SuppressWarnings("unchecked")
T[] tempList = (T[]) new Object[maximumSize]; //Default in how java says to write arrays with generics
list = tempList;
numberOfElements = 0;
}
@Override
public boolean addFront(T newEntry) {
while(!isFull()) {
makeRoom(0);
list[0] = newEntry;
numberOfElements++;
return true;
}
return false;
}
@Override
public boolean addBack(T newEntry) {
if(!isFull()) {
int newPosition = numberOfElements;
list[newPosition] = newEntry;
numberOfElements++;
return true;
}
return false;
}
@Override
public T removeFront() {
if(!isEmpty()) {
T elementRemoved = getEntry(0);
list[0] = null;
removeGap(0);
numberOfElements--;
return elementRemoved;
}
return null;
}
@Override
public T removeBack() {
if (!isEmpty()) {
int removePosition = numberOfElements - 1;
T elementRemoved = getEntry(removePosition);
list[removePosition] = null;
numberOfElements--;
return elementRemoved;
}
return null;
}
@Override
public void clear() {
for (int i = 0; i < numberOfElements; i++) {
list[i] = null;
}
numberOfElements = 0;
}
@Override
public T getEntry(int givenPosition) {
if(givenPosition > list.length || givenPosition < 0) {
return null;
}
return list[givenPosition];
}
@Override
public int indexOf(T anEntry) {
for(int i = 0; i<= numberOfElements - 1; i++) {
if(list[i] == anEntry || list[i].equals(anEntry)) {
return i;
}
}
return -1;
}
@Override
public int lastIndexOf(T anEntry) {
for(int i = numberOfElements - 1; i >= 0; i--) {
if(list[i] == anEntry || list[i].equals(anEntry)) {
return i;
}
}
return -1;
}
@Override
public boolean contains(T anEntry) {
for(int i = 0; i <= numberOfElements - 1; i++) {
if(list[i] == anEntry || list[i].equals(anEntry)) {
return true;
}
}
return false;
}
@Override
public int size() {
return numberOfElements;
}
@Override
public boolean isEmpty() {
if (numberOfElements != 0) {
return false;
}
return true;
}
@Override
public boolean isFull() {
if(size() >= list.length) {
return true;
}
return false;
}
@Override
public String toString() {
return "size=" + numberOfElements + " capacity =" + list.length + "; [" + printAll() + "]";
}
private void makeRoom(int newPosition) {
assert (newPosition >= 1) && (newPosition <= numberOfElements + 1);
int newIndex = newPosition;
int lastIndex = numberOfElements - 1;
for (int index = lastIndex; index >= newIndex; index--) {
list[index + 1] = list[index];
}
}
private void removeGap(int givenPosition) {
assert (givenPosition >= 1) && (givenPosition < numberOfElements);
int removedIndex = givenPosition;
int lastIndex = numberOfElements - 1;
for (int index = removedIndex; index < lastIndex; index++)
list[index] = list[index + 1];
}
private String printAll() {
String printedArray = "";
for(int i = 0; i<=numberOfElements-1;i++) {
printedArray += list[i] + ", ";
}
return printedArray;
}
}