-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy patharray.hpp
More file actions
158 lines (125 loc) · 3.09 KB
/
array.hpp
File metadata and controls
158 lines (125 loc) · 3.09 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
#ifndef ARRAY_HPP
#define ARRAY_HPP
class BaseArray
{
public:
BaseArray(){}
virtual ~BaseArray(){}
};
template <typename T>
class Array: public BaseArray
{
private:
int capacity;
int length;
T** array;
public:
Array();
Array(int);
Array(const Array<T> &);
~Array();
void Show() const;
int Length() const;
int Search(const T&) const;
void Add(const T&);
void Del(int);
T& operator [] (int) const;
T** Resize(int);
};
template <typename T>
Array<T>::Array()
{
if( (array = (T**)calloc(FIRST_SIZE, sizeof(T*))) == NULL )
throw MemoryError(0);
capacity = FIRST_SIZE;
length = 0;
}
//-------------------------------------------------------------
template <typename T>
Array<T>::Array(int size)
{
if( (array = (T**)calloc(size, sizeof(T*))) == NULL )
throw MemoryError(0);
capacity = size;
length = 0;
}
//-------------------------------------------------------------
template <typename T>
Array<T>::Array(const Array<T>& elem_arr)
{
if( (array = (T**)calloc(elem_arr.capacity, sizeof(T*))) == NULL )
throw MemoryError(0);
length = elem_arr.Length();
capacity = elem_arr.capacity;
for(int i = 0; i < length; i++)
array[i] = new T(elem_arr[i]);
}
//-------------------------------------------------------------
template <typename T>
Array<T>::~Array()
{
for (int i = 0; i < length; i++)
free(array[i]);
free(array);
}
//-------------------------------------------------------------
template <typename T>
void Array<T>::Show() const
{
for(int i = 0; i < length; i++)
{
cout << *array[i] << " ";
}
cout << endl;
}
//-------------------------------------------------------------
template <typename T>
int Array<T>::Length() const
{
return length;
}
//-------------------------------------------------------------
template <typename T>
T** Array<T>::Resize(int size)
{
if( (array = (T**)realloc(array, sizeof(T*)*size)) == NULL )
throw MemoryError(0);
capacity = size;
return array;
}
//-------------------------------------------------------------
template <typename T>
void Array<T>::Add(const T& elem)
{
if (length == capacity)
array = Resize(capacity + ADD_MEM);
array[length++] = new T(elem);
}
//-------------------------------------------------------------
template <typename T>
int Array<T>::Search(const T& elem) const
{
int i;
for (i = 0; i < length && *array[i] != elem; i++);
return i < length ? i : NO_RESULTS;
}
//-------------------------------------------------------------
template <typename T>
void Array<T>::Del(int Pos)
{
if(Pos < 0 || Pos >= length)
throw RangeError(Pos);
length--;
T temp = array[Pos];
array[Pos] = array[length];
delete temp;
}
//-------------------------------------------------------------
template <typename T>
T& Array<T>::operator [] (int Pos) const
{
if(Pos < 0 || Pos >= length)
throw RangeError(Pos);
return *array[Pos];
}
#endif // ARRAY_HPP