mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-21 10:13:43 +03:00
42cf5bc1ca
Automatic upgrade of OCCT code by command "occt_upgrade . -nocdl": - WOK-generated header files from inc and sources from drv are moved to src - CDL files removed - All packages are converted to nocdlpack
153 lines
4.3 KiB
C++
153 lines
4.3 KiB
C++
// Created on: 1993-02-26
|
|
// Created by: Remi LEQUETTE
|
|
// Copyright (c) 1993-1999 Matra Datavision
|
|
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
|
//
|
|
// This file is part of Open CASCADE Technology software library.
|
|
//
|
|
// This library is free software; you can redistribute it and/or modify it under
|
|
// the terms of the GNU Lesser General Public License version 2.1 as published
|
|
// by the Free Software Foundation, with special exception defined in the file
|
|
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
|
// distribution for complete text of the license and disclaimer of any warranty.
|
|
//
|
|
// Alternatively, this file may be used under the terms of Open CASCADE
|
|
// commercial license or contractual agreement.
|
|
|
|
|
|
#include <Standard_Stream.hxx>
|
|
#include <TCollection.hxx>
|
|
#include <TCollection_BasicMap.hxx>
|
|
#include <TCollection_BasicMapIterator.hxx>
|
|
#include <TCollection_MapNode.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;
|
|
}
|