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
|
// File: TCollection_BasicMap.cxx
// Created: Fri Feb 26 17:20:43 1993
// Author: Remi LEQUETTE
// <rle@phylox>
#ifdef HAVE_CONFIG_H
# include <oce-config.h>
#endif
#include <TCollection_BasicMap.ixx>
#include <TCollection.hxx>
#include <TCollection_BasicMapIterator.hxx>
#include <TCollection_MapNode.hxx>
#include <Standard_Stream.hxx>
//=======================================================================
//function : TCollection_BasicMap
//purpose :
//=======================================================================
TCollection_BasicMap::TCollection_BasicMap(const Standard_Integer NbBuckets,
const Standard_Boolean single) :
myData1(NULL),
myData2(NULL),
isDouble(!single),
mySaturated(Standard_False),
myNbBuckets(NbBuckets),
mySize(0)
{
}
//=======================================================================
//function : BeginResize
//purpose :
//=======================================================================
Standard_Boolean TCollection_BasicMap::BeginResize
(const Standard_Integer NbBuckets,
Standard_Integer& N,
Standard_Address& data1,
Standard_Address& data2) const
{
if (mySaturated) return Standard_False;
N = TCollection::NextPrimeForMap(NbBuckets);
if (N <= myNbBuckets) {
if (IsEmpty())
N = myNbBuckets;
else
return Standard_False;
}
data1 = Standard::Allocate((N+1)*sizeof(TCollection_MapNodePtr));
memset(data1, 0, (N+1)*sizeof(TCollection_MapNodePtr));
if (isDouble) {
data2 = Standard::Allocate((N+1)*sizeof(TCollection_MapNodePtr));
memset(data2, 0, (N+1)*sizeof(TCollection_MapNodePtr));
}
else
data2 = NULL;
return Standard_True;
}
//=======================================================================
//function : EndResize
//purpose :
//=======================================================================
void TCollection_BasicMap::EndResize(const Standard_Integer NbBuckets,
const Standard_Integer N,
const Standard_Address data1,
const Standard_Address data2)
{
Standard::Free(myData1);
Standard::Free(myData2);
myNbBuckets = N;
mySaturated = myNbBuckets <= NbBuckets;
myData1 = data1;
myData2 = data2;
}
//=======================================================================
//function : Destroy
//purpose :
//=======================================================================
void TCollection_BasicMap::Destroy()
{
mySize = 0;
mySaturated = Standard_False;
Standard::Free(myData1);
Standard::Free(myData2);
myData1 = myData2 = NULL;
}
//=======================================================================
//function : Statistics
//purpose :
//=======================================================================
void TCollection_BasicMap::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;
TCollection_MapNode* p;
TCollection_MapNode** data;
S << "\nStatistics for the first Key\n";
for (i = 0; i <= mySize; i++) sizes[i] = 0;
data = (TCollection_MapNode**) 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;
}
|
