-
Notifications
You must be signed in to change notification settings - Fork 6
/
container.cpp
183 lines (145 loc) · 2.91 KB
/
container.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
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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
#include "container.h"
#include <vector>
#include <mutex>
#include <unistd.h>
template<class T> container<T>::container()
{
e_size = 0;
for(int i=0;i<MAX;i++)
elem[i]= NULL;
}
template<class T> bool container<T>::isSafe()
{
while (semaphore!=0) usleep(1);
return true;
}
template<class T> void container<T>::lock()
{
printf("<<");
mlock.lock();
}
template<class T> void container<T>::unlock()
{
mlock.unlock();
printf(">>");
}
template<class T> void container<T>::lockme()
{
semaphore=1;
}
template<class T> void container<T>::unlockme()
{
semaphore=0;
usleep(1);
}
template<class T> size_t container<T>::push_back(T value)
{
size_t i=0;
size_t count=0;
for(i=0;i<MAX;i++)
{
if (elem[i] == NULL)
break;
}
assert( i < MAX || !"The container is full and cannot hold more values.");
elem[i] = value;
return i;
}
template<class T> T container<T>::operator[](size_t index)
{
T t;
if (index>MAX)
assert(!"This should not happen");
if (elem[index] == NULL)
assert(!"Pointer is null");
//printf("Accessing %d\n", index);
t = elem[index];
return t;
}
template <class T> size_t container<T>::indexAt(int position)
{
size_t i=0;
int count=0;
for(i=0;i<MAX;i++)
{
if (elem[i] != NULL)
count++;
if (count == position)
break;
}
return i;
}
template <class T> int container<T>::indexOf(size_t element)
{
size_t i=0;
int count=0;
for(i=0;i<MAX;i++)
{
if (elem[i] != NULL)
count++;
if (i == element)
return count;
}
return 0;
}
template<class T> size_t container<T>::size()
{
size_t i=0;
size_t count=0;
for(i=0;i<MAX;i++)
{
if (elem[i] != NULL)
count++;
}
return count;
}
template<class T> void container<T>::prune()
{
assert(!"Deprecated!");
for(int i=0;i<prunning.size();i++)
delete prunning[i];
}
template<class T> bool container<T>::isValid(size_t index)
{
return (elem[index] != NULL);
}
template<class T> bool container<T>::exists(size_t index)
{
size_t i=index;
while ( (i>=0 && i<MAX) && elem[i] == NULL)
{
i++;
}
if (i>=MAX)
{
return false;
}
else
{
return true;
}
}
template<class T> size_t container<T>::first()
{
size_t i=0;
while ( (i>=0 && i<MAX) && elem[i] == NULL) i++;
return i;
}
template<class T> size_t container<T>::next(size_t index)
{
size_t i=index+1;
while ( (i>=0 && i<MAX) && elem[i] == NULL) i++;
return i;
}
template<class T> void container<T>::erase(size_t index)
{
//prunning.push_back( *(elements.begin() + index) );
//elements.erase(elements.begin() + index);
T e = elem[index];
if (elem[index] != NULL)
{
elem[index] = NULL;
e_size--;
delete e;
}
}