-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathCiscStack.java
More file actions
126 lines (110 loc) · 2.89 KB
/
CiscStack.java
File metadata and controls
126 lines (110 loc) · 2.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
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
package edu.ust.cisc;
import org.springframework.objenesis.ObjenesisException;
import java.util.EmptyStackException;
import java.util.Iterator;
import java.util.*;
public class CiscStack<E> implements CiscCollection<E>{
public static final int DEFAULT_CAPACITY = 10;
private E[] elementData;
private int size;
public CiscStack() {
this(DEFAULT_CAPACITY);
}
public CiscStack(int initialCapacity) {
if(initialCapacity < 0){
throw new IllegalArgumentException();
}
elementData = (E[])new Object[initialCapacity];
size = 0;
}
public E peek(){
if(isEmpty()){
throw new EmptyStackException();
}
E item = elementData[size-1];
return item;
}
public E pop(){
if(isEmpty()){
throw new EmptyStackException();
}
E item = elementData[size - 1];
elementData[size - 1] = null;
size--;
return item;
}
public void push(E item){
}
@Override
public int size() {
return size;
}
@Override
public boolean isEmpty() {
return size == 0;
}
@Override
public boolean contains(Object o) {
for(int i = 0; i<size; i++){
if(elementData[i].equals(o)){
return true;
}
}
return false;
}
@Override
public Iterator<E> iterator() {
return new CiscStackIterator();
}
private class CiscStackIterator implements Iterator<E> {
private int nextIndex;
public CiscStackIterator(){
nextIndex = size - 1;
}
@Override
public boolean hasNext(){
return nextIndex>=0;
}
@Override
public E next(){
E element = elementData[nextIndex];
nextIndex--;
return element;
}
}
@Override
public Object[] toArray() {
Object[] arr = (E[]) new Object[size];
int arrIndex = 0;
for(int i = size-1; i>=0; i--){
arr[arrIndex] = elementData[i];
arrIndex++;
}
return arr;
}
@Override
public void clear() {
for(int i = 0; i<size; i++) {
elementData[i] = null;
}
size=0;
}
private void ensureCapacity(int capacity) {
if(elementData.length < capacity){
if(elementData.length*2+1 < capacity){
E[] newList = (E[]) new Object[capacity];
for(int i=0; i<size; i++){
newList[i] = elementData[i];
}
elementData = newList;
}
else{
E[] newList = (E[]) new Object[(elementData.length*2) +1];
for(int i = 0; i<size; i++){
newList[i] = elementData[i];
}
elementData = newList;
}
}
}
}