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
|
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
//
#include "carray.h"
//constructs new object - 0 size
CArray::CArray()
{
m_iAllocatedBlocks = 0;
m_iArrayItems = 0;
m_pFirstBlock = NULL;
}
//destructor calls destroy
CArray::~CArray()
{
Destroy();
}
//destructs all sub array blocks
void CArray::Destroy()
{
if ( m_iAllocatedBlocks )
{
SubArray* pCurr = m_pFirstBlock;
SubArray* pNext;
while ( pCurr )
{
pNext = pCurr->pNext;
delete pCurr;
pCurr = pNext;
}
}
m_iAllocatedBlocks = 0;
m_iArrayItems = 0;
m_pFirstBlock = NULL;
}
//deletes last item
BOOL CArray::DeleteLast()
{
m_iArrayItems--;
return TRUE;
}
//gets value from array
void* CArray::GetAt( int iItem )
{
if ( ( iItem + 1 ) > m_iArrayItems )
return NULL;
int iBlockNeeded = iItem / CARRAY_SUB_SIZE;
int iBlockCurr = 0;
SubArray* pCurr = m_pFirstBlock;
while( iBlockCurr < iBlockNeeded )
{
pCurr = pCurr->pNext;
iBlockCurr++;
if ( !pCurr )
return NULL;
}
return pCurr->array[ iItem % CARRAY_SUB_SIZE ];
}
//sets array's value - must exist before
BOOL CArray::SetAt( int iItem, void* pPtr )
{
if ( ( iItem + 1 ) > m_iArrayItems )
return FALSE;
int iBlockNeeded = iItem / CARRAY_SUB_SIZE;
int iBlockCurr = 0;
SubArray* pCurr = m_pFirstBlock;
while( iBlockCurr < iBlockNeeded )
{
pCurr = pCurr->pNext;
iBlockCurr++;
if ( !pCurr )
return FALSE;
}
pCurr->array[ iItem % CARRAY_SUB_SIZE ] = pPtr;
return TRUE;
}
//adds array's value
BOOL CArray::Add( void* pPtr )
{
if ( ((( m_iArrayItems ) / CARRAY_SUB_SIZE ) + 1 ) > m_iAllocatedBlocks )
{
//if we need new block, we try to add them
if ( !AddNewBlock() )
return FALSE;
}
m_iArrayItems++;
if ( !SetAt( m_iArrayItems - 1, pPtr ) )
{
m_iArrayItems--;
return FALSE;
}
return TRUE;
}
//adds new sub array block
BOOL CArray::AddNewBlock()
{
SubArray* pCurr = m_pFirstBlock;
SubArray* pNext = m_pFirstBlock;
//find end
while ( pNext )
{
pCurr = pNext;
pNext = pCurr->pNext;
}
if ( !( pNext = new SubArray ) )
return FALSE;
memset( pNext, 0, sizeof( SubArray) );
if ( !m_pFirstBlock )
m_pFirstBlock = pNext;
else
pCurr->pNext = pNext;
m_iAllocatedBlocks++;
return TRUE;
}
|
