-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDSArray.cpp
112 lines (84 loc) · 1.54 KB
/
DSArray.cpp
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
#include "DSArray.hpp"
DSArray::DSArray() {
capacity = 1;
data = new Object*[capacity];
}
DSArray::~DSArray() {
delete[] data;
}
bool DSArray::insert(Object* E, unsigned int p) {
if (isFull())
if (!makebigger())
return false;
if (!(p >= 0 && p <= size))
return false;
if (isEmpty() || p == size)
data[p] = E;
else {
for (int i = size; i > p; i--)
data[i] = data[i - 1];
data[p] = E;
}
size++;
return true;
}
Object* DSArray::remove(unsigned int p) {
if (isEmpty())
return NULL;
if (!(p >= 0 && p < size))
return NULL;
Object* retval = data[p];
if (p == size - 1)
data[p] = NULL;
else {
for (int i = p; i < size - 1; i++)
data[i] = data[i + 1];
data[size - 1] = NULL;
}
size--;
return retval;
}
Object* DSArray::first() const {
if (isEmpty())
return NULL;
return data[0];
}
Object* DSArray::last() const {
if (isEmpty())
return NULL;
return data[size - 1];
}
int DSArray::getCapacity() const {
return -1;
}
bool DSArray::isFull() const {
return size == capacity;
}
void DSArray::clear() {
delete[] data;
data = new Object*[capacity];
size = 0;
}
int DSArray::indexOf(Object* E) const {
for (int i = 0; i < size; i++) {
if(data[i]->equals(E))
return i;
}
return -1;
}
Object* DSArray::get(unsigned int p) const {
if(isEmpty())
return NULL;
if(!(p >= 0 && p < size))
return NULL;
return data[p];
}
bool DSArray::makebigger() {
Object** tmp = new Object*[++capacity];
if (!tmp)
return false;
for (int i = 0; i < size; i++)
tmp[i] = data[i];
data = tmp;
return true;
}