-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathVectorInit.java
More file actions
91 lines (75 loc) · 2.05 KB
/
Copy pathVectorInit.java
File metadata and controls
91 lines (75 loc) · 2.05 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
public class VectorInit{
private Object[] data;
private static final int DEFAULT_CAPACITY = 100;
private int numItems;
public Vector(){
data = new Object[DEFAULT_CAPACITY] ;
}
public boolean append(Object element){
if(isFull())
return false;
data[numItems++] = element ;
return true ;
}
public void clear(){
for(int i=0; i<numItems; i++){
data[i] = null ;
}
numItems = 0 ;
}
public boolean contains(Object element){
return indexOf(element) != -1 ;
}
public Object elementAt(int index){
if(index < 0 || index > numItems-1)
return null;
return data[index] ;
}
public int indexOf(Object element){
for(int i=0; i<numItems; i++)
if(element.equals(data[i]))
return i ;
return -1 ;
}
public boolean insertAt(int index, Object element){
if(index<0 || index>numItems-1 || isFull())
return false;
for(int i=numItems-1; i>=index; i--)
data[i+1] = data[i] ;
data[index] = element ;
numItems ++ ;
return true ;
}
public boolean isEmpty(){
return numItems == 0 ;
}
public boolean isFull(){
return numItems == data.length ;
}
public boolean remove(Object element){
int pos = indexOf(element) ;
if(pos == -1)
return false;
removeAt(pos) ;
return true ;
}
public Object removeAt(int index){
if(index < 0 || index > numItems-1)
return null ;
Object temp = data[index] ;
while(index < numItems-1)
data[index] = data[index+1] ;
index ++ ;
data[--numItems] = null ;
return temp ;
}
public boolean replace(int index, Object element){
if(index < 0 || index > numItems-1)
return false;
data[index] = element ;
return true ;
}
public int size(){
return numItems ;
}
}