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
|
// File: NCollection_BaseMap.hxx
// Created: Thu Apr 18 15:02:53 2002
// Author: Alexander KARTOMIN (akm)
// <akm@matrox.nnov.matra-dtv.fr>
// Purpose: Implementation of the BaseMap class
#include <NCollection_BaseMap.hxx>
#include <TCollection.hxx>
//=======================================================================
//function : BeginResize
//purpose :
//=======================================================================
Standard_Boolean NCollection_BaseMap::BeginResize
(const Standard_Integer NbBuckets,
Standard_Integer& N,
NCollection_ListNode**& data1,
NCollection_ListNode**& data2,
Handle(NCollection_BaseAllocator)& theAllocator) const
{
if (mySaturated) return Standard_False;
N = NextPrimeForMap(NbBuckets);
if (N <= myNbBuckets) {
if (!myData1)
N = myNbBuckets;
else
return Standard_False;
}
data1 = (NCollection_ListNode **)
theAllocator->Allocate((N+1)*sizeof(NCollection_ListNode *));
memset(data1, 0, (N+1)*sizeof(NCollection_ListNode *));
if (isDouble)
{
data2 = (NCollection_ListNode **)
theAllocator->Allocate((N+1)*sizeof(NCollection_ListNode *));
memset(data2, 0, (N+1)*sizeof(NCollection_ListNode *));
}
else
data2 = NULL;
return Standard_True;
}
//=======================================================================
//function : EndResize
//purpose :
//=======================================================================
void NCollection_BaseMap::EndResize
(const Standard_Integer NbBuckets,
const Standard_Integer N,
NCollection_ListNode** data1,
NCollection_ListNode** data2,
Handle(NCollection_BaseAllocator)& theAllocator)
{
if (myData1)
theAllocator->Free(myData1);
if (myData2)
theAllocator->Free(myData2);
myNbBuckets = N;
mySaturated = (myNbBuckets <= NbBuckets);
myData1 = data1;
myData2 = data2;
}
//=======================================================================
//function : Destroy
//purpose :
//=======================================================================
void NCollection_BaseMap::Destroy
(NCollection_DelMapNode fDel,
Handle(NCollection_BaseAllocator)& theAllocator,
const Standard_Boolean doReleaseMemory)
{
if (!IsEmpty())
{
Standard_Integer i;
NCollection_ListNode** data = (NCollection_ListNode**) myData1;
NCollection_ListNode *p,*q;
for (i = 0; i <= NbBuckets(); i++)
{
if (data[i])
{
p = data[i];
while (p)
{
q = (NCollection_ListNode*)p->Next();
fDel (p, theAllocator);
p = q;
}
data[i] = NULL;
}
}
}
mySize = 0;
if (doReleaseMemory)
{
mySaturated = Standard_False;
if (myData1)
theAllocator->Free(myData1);
if (isDouble && myData2)
theAllocator->Free(myData2);
myData1 = myData2 = NULL;
}
}
//=======================================================================
//function : Statistics
//purpose :
//=======================================================================
void NCollection_BaseMap::Statistics(Standard_OStream& S) const
{
S <<"\nMap Statistics\n---------------\n\n";
S <<"This Map has "<<myNbBuckets<<" Buckets and "<<mySize<<" Keys\n\n";
if (mySaturated) S<<"The maximum number of Buckets is reached\n";
if (mySize == 0) return;
// compute statistics on 1
Standard_Integer * sizes = new Standard_Integer [mySize+1];
Standard_Integer i,l,nb;
NCollection_ListNode* p;
NCollection_ListNode** data;
S << "\nStatistics for the first Key\n";
for (i = 0; i <= mySize; i++) sizes[i] = 0;
data = (NCollection_ListNode **) myData1;
nb = 0;
for (i = 0; i <= myNbBuckets; i++)
{
l = 0;
p = data[i];
if (p) nb++;
while (p)
{
l++;
p = p->Next();
}
sizes[l]++;
}
// display results
l = 0;
for (i = 0; i<= mySize; i++)
{
if (sizes[i] > 0)
{
l += sizes[i] * i;
S << setw(5) << sizes[i] <<" buckets of size "<<i<<"\n";
}
}
Standard_Real mean = ((Standard_Real) l) / ((Standard_Real) nb);
S<<"\n\nMean of length : "<<mean<<"\n";
delete [] sizes;
}
//=======================================================================
//function : NextPrimeForMap
//purpose :
//=======================================================================
Standard_Integer NCollection_BaseMap::NextPrimeForMap
(const Standard_Integer N) const
{
return TCollection::NextPrimeForMap ( N );
}
|
