-
Notifications
You must be signed in to change notification settings - Fork 1
/
BASEDEF.H
176 lines (145 loc) · 3.43 KB
/
BASEDEF.H
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
#include <stdlib.h>
#include <string.h>
// Some basic defines
#define SHORT short /* s */
#define LONG long /* l */
#define FALSE 0
#define TRUE 1
//typedef unsigned long BOOL;
#define STRING char *
enum EncodingTypes { ANSI = 0, UTF8 = 1, UTF16 = 2 };
/******************************************************************************
* Base object class
*/
class AObject
{
public:
AObject() {};
virtual ~AObject() {};
virtual void deleteInternals() {};
virtual int equals( AObject *object ) { return FALSE; }
};
struct BTime
{
int year, month, day;
int hour, min, sec, msec;
};
/******************************************************************************
* Vector
* The vector class is used extensively in this windows framework
* The implementation is very basic, and there is probably a good standard
* class available for this, but since I'm not sure that the C++ class libraries
* are compatible with each other I have created this one.
*/
template<class T>
class Vector : public AObject
{
int size;
void resize( int toSize );
int deleteContents;
T **content;
public:
Vector() : size(0), deleteContents(TRUE), content(NULL) {};
Vector( const int deleteContents ) :
size(0), deleteContents(deleteContents), content(NULL) {};
void deleteContent( int deleteContents )
{ this->deleteContents = deleteContents; }
void add( T *object );
BOOL insertAt( int index, T *object );
BOOL removeAt( int index );
int findObject( T *object );
T *findObjectOnEq( T *object );
BOOL removeObject( T *object );
int getSize() { return size; }
T *getObjectAt( int index );
void removeAll();
virtual ~Vector()
{
if( deleteContents )
removeAll();
else
if( content != NULL )
free( content );
}
};
template<class T>
void Vector<T>::resize( int toSize )
{
/* if( size == 0 )
content = (T **)malloc( sizeof( T * ) * toSize);
else*/
content = (T **)realloc( (void *)content, sizeof( T * ) * toSize );
};
template<class T>
void Vector<T>::add( T *object )
{
resize( size + 1 );
content[size++] = object;
};
template<class T>
BOOL Vector<T>::insertAt( int index, T *object )
{
if( index > size ) return FALSE;
resize( size + 1);
memmove( &content[index+1], &content[index],
sizeof( T *) * (size - index) );
content[index] = object;
size++;
return TRUE;
};
template<class T>
BOOL Vector<T>::removeAt( int index )
{
if( index >= size ) return FALSE;
if( deleteContents )
delete content[index];
memmove( &content[index], &content[index+1],
sizeof( T *) * (size - index - 1) );
size--;
return TRUE;
};
template<class T>
T *Vector<T>::getObjectAt( int index )
{
if( index >= size ) return NULL;
return content[index];
};
template<class T>
int Vector<T>::findObject( T *object )
{
for( int i = 0; i < size; i++ )
if( content[i] == object )
return i;
return -1;
};
template<class T>
T *Vector<T>::findObjectOnEq( T *object )
{
for( int i = 0; i < size; i++ )
if( content[i]->equals( (AObject *)object ) )
return content[i];
return NULL;
};
template<class T>
BOOL Vector<T>::removeObject( T *object )
{
int i;
if( (i = findObject( object )) != -1 )
return removeAt(i);
return FALSE;
};
template<class T>
void Vector<T>::removeAll()
{
for( int i = size-1; i >= 0; i-- )
{
size--;
delete content[i];
}
if( content != NULL )
{
free( content );
content = NULL;
}
size = 0;
};