mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-06 18:26:22 +03:00
6928e35131
Destructors of collection classes from NCollection and math_Function are made virtual to allow safe destruction by pointer to base class. Destructors of classes HatchGen_IntersectionPoint, IntCurveSurface_Intersection, Intf_Interference, IntRes2d_Intersection are made protected to avoid possibility of destructing by pointer to corresponding base class.
628 lines
20 KiB
C++
628 lines
20 KiB
C++
// Created on: 2002-04-24
|
|
// Created by: Alexander KARTOMIN (akm)
|
|
// Copyright (c) 2002-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.
|
|
|
|
#ifndef NCollection_IndexedDataMap_HeaderFile
|
|
#define NCollection_IndexedDataMap_HeaderFile
|
|
|
|
#include <NCollection_BaseMap.hxx>
|
|
#include <NCollection_TListNode.hxx>
|
|
#include <Standard_TypeMismatch.hxx>
|
|
#include <Standard_NoSuchObject.hxx>
|
|
#include <NCollection_StlIterator.hxx>
|
|
#include <NCollection_DefaultHasher.hxx>
|
|
|
|
#include <Standard_OutOfRange.hxx>
|
|
|
|
/**
|
|
* Purpose: An indexed map is used to store keys and to bind
|
|
* an index to them. Each new key stored in the map
|
|
* gets an index. Index are incremented as keys are
|
|
* stored in the map. A key can be found by the index
|
|
* and an index by the key. No key but the last can
|
|
* be removed so the indices are in the range 1..
|
|
* Extent. An Item is stored with each key.
|
|
*
|
|
* This class is similar to IndexedMap from
|
|
* NCollection with the Item as a new feature. Note
|
|
* the important difference on the operator (). In
|
|
* the IndexedMap this operator returns the Key. In
|
|
* the IndexedDataMap this operator returns the Item.
|
|
*
|
|
* See the class Map from NCollection for a
|
|
* discussion about the number of buckets.
|
|
*/
|
|
|
|
template < class TheKeyType,
|
|
class TheItemType,
|
|
class Hasher = NCollection_DefaultHasher<TheKeyType> >
|
|
class NCollection_IndexedDataMap : public NCollection_BaseMap
|
|
{
|
|
//! Adaptation of the TListNode to the INDEXEDDatamap
|
|
private:
|
|
class IndexedDataMapNode : public NCollection_TListNode<TheItemType>
|
|
{
|
|
public:
|
|
//! Constructor with 'Next'
|
|
IndexedDataMapNode (const TheKeyType& theKey1,
|
|
const Standard_Integer theKey2,
|
|
const TheItemType& theItem,
|
|
NCollection_ListNode* theNext1,
|
|
NCollection_ListNode* theNext2) :
|
|
NCollection_TListNode<TheItemType>(theItem,theNext1),
|
|
myKey1(theKey1),
|
|
myKey2(theKey2),
|
|
myNext2((IndexedDataMapNode*)theNext2)
|
|
{
|
|
}
|
|
//! Key1
|
|
TheKeyType& Key1 (void)
|
|
{ return myKey1; }
|
|
//! Key2
|
|
Standard_Integer& Key2 (void)
|
|
{ return myKey2; }
|
|
//! Next2
|
|
IndexedDataMapNode*& Next2 (void)
|
|
{ return myNext2; }
|
|
|
|
//! Static deleter to be passed to BaseList
|
|
static void delNode (NCollection_ListNode * theNode,
|
|
Handle(NCollection_BaseAllocator)& theAl)
|
|
{
|
|
((IndexedDataMapNode *) theNode)->~IndexedDataMapNode();
|
|
theAl->Free(theNode);
|
|
}
|
|
private:
|
|
TheKeyType myKey1;
|
|
Standard_Integer myKey2;
|
|
IndexedDataMapNode * myNext2;
|
|
};
|
|
|
|
public:
|
|
//! Implementation of the Iterator interface.
|
|
class Iterator
|
|
{
|
|
public:
|
|
//! Empty constructor
|
|
Iterator (void) :
|
|
myMap(NULL),
|
|
myIndex(0) {}
|
|
//! Constructor
|
|
Iterator (const NCollection_IndexedDataMap& theMap)
|
|
: myMap ((NCollection_IndexedDataMap* )&theMap),
|
|
myNode (myMap->nodeFromIndex (1)),
|
|
myIndex (1) {}
|
|
//! Query if the end of collection is reached by iterator
|
|
Standard_Boolean More(void) const
|
|
{ return (myMap != NULL) && (myIndex <= myMap->Extent()); }
|
|
//! Make a step along the collection
|
|
void Next(void)
|
|
{
|
|
myNode = myMap->nodeFromIndex (++myIndex);
|
|
}
|
|
//! Value access
|
|
const TheItemType& Value(void) const
|
|
{
|
|
Standard_NoSuchObject_Raise_if(!More(), "NCollection_IndexedDataMap::Iterator::Value");
|
|
return myNode->Value();
|
|
}
|
|
//! ChangeValue access
|
|
TheItemType& ChangeValue(void) const
|
|
{
|
|
Standard_NoSuchObject_Raise_if(!More(), "NCollection_IndexedDataMap::Iterator::ChangeValue");
|
|
return myNode->ChangeValue();
|
|
}
|
|
//! Key
|
|
const TheKeyType& Key() const
|
|
{
|
|
Standard_NoSuchObject_Raise_if(!More(), "NCollection_IndexedDataMap::Iterator::Key");
|
|
return myNode->Key1();
|
|
}
|
|
//! Performs comparison of two iterators.
|
|
Standard_Boolean IsEqual (const Iterator& theOther) const
|
|
{
|
|
return myMap == theOther.myMap &&
|
|
myNode == theOther.myNode &&
|
|
myIndex == theOther.myIndex;
|
|
}
|
|
private:
|
|
NCollection_IndexedDataMap* myMap; //!< Pointer to the map being iterated
|
|
IndexedDataMapNode* myNode; //!< Current node
|
|
Standard_Integer myIndex; //!< Current index
|
|
};
|
|
|
|
//! Shorthand for a regular iterator type.
|
|
typedef NCollection_StlIterator<std::forward_iterator_tag, Iterator, TheItemType, false> iterator;
|
|
|
|
//! Shorthand for a constant iterator type.
|
|
typedef NCollection_StlIterator<std::forward_iterator_tag, Iterator, TheItemType, true> const_iterator;
|
|
|
|
//! Returns an iterator pointing to the first element in the map.
|
|
iterator begin() const { return Iterator (*this); }
|
|
|
|
//! Returns an iterator referring to the past-the-end element in the map.
|
|
iterator end() const { return Iterator(); }
|
|
|
|
//! Returns a const iterator pointing to the first element in the map.
|
|
const_iterator cbegin() const { return Iterator (*this); }
|
|
|
|
//! Returns a const iterator referring to the past-the-end element in the map.
|
|
const_iterator cend() const { return Iterator(); }
|
|
|
|
public:
|
|
// ---------- PUBLIC METHODS ------------
|
|
|
|
//! Constructor
|
|
NCollection_IndexedDataMap (const Standard_Integer NbBuckets=1,
|
|
const Handle(NCollection_BaseAllocator)& theAllocator = 0L)
|
|
: NCollection_BaseMap (NbBuckets, Standard_False, theAllocator) {}
|
|
|
|
//! Copy constructor
|
|
NCollection_IndexedDataMap (const NCollection_IndexedDataMap& theOther)
|
|
: NCollection_BaseMap (theOther.NbBuckets(), Standard_False, theOther.myAllocator)
|
|
{ *this = theOther; }
|
|
|
|
//! Exchange the content of two maps without re-allocations.
|
|
//! Notice that allocators will be swapped as well!
|
|
void Exchange (NCollection_IndexedDataMap& theOther)
|
|
{
|
|
this->exchangeMapsData (theOther);
|
|
}
|
|
|
|
//! Assignment.
|
|
//! This method does not change the internal allocator.
|
|
NCollection_IndexedDataMap& Assign (const NCollection_IndexedDataMap& theOther)
|
|
{
|
|
if (this == &theOther)
|
|
return *this;
|
|
|
|
Clear();
|
|
ReSize (theOther.Extent()-1);
|
|
Standard_Integer i;
|
|
for (i=1; i<=theOther.Extent(); i++)
|
|
{
|
|
TheKeyType aKey1 = theOther.FindKey(i);
|
|
TheItemType anItem = theOther.FindFromIndex(i);
|
|
Standard_Integer iK1 = Hasher::HashCode (aKey1, NbBuckets());
|
|
Standard_Integer iK2 = ::HashCode (i, NbBuckets());
|
|
IndexedDataMapNode * pNode =
|
|
new (this->myAllocator) IndexedDataMapNode (aKey1, i, anItem,
|
|
myData1[iK1], myData2[iK2]);
|
|
myData1[iK1] = pNode;
|
|
myData2[iK2] = pNode;
|
|
Increment();
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
//! Assignment operator
|
|
NCollection_IndexedDataMap& operator= (const NCollection_IndexedDataMap& theOther)
|
|
{
|
|
return Assign (theOther);
|
|
}
|
|
|
|
//! ReSize
|
|
void ReSize (const Standard_Integer N)
|
|
{
|
|
NCollection_ListNode** ppNewData1 = NULL;
|
|
NCollection_ListNode** ppNewData2 = NULL;
|
|
Standard_Integer newBuck;
|
|
if (BeginResize (N, newBuck, ppNewData1, ppNewData2))
|
|
{
|
|
if (myData1)
|
|
{
|
|
IndexedDataMapNode *p, *q;
|
|
Standard_Integer i, iK1, iK2;
|
|
for (i = 0; i <= NbBuckets(); i++)
|
|
{
|
|
if (myData1[i])
|
|
{
|
|
p = (IndexedDataMapNode *) myData1[i];
|
|
while (p)
|
|
{
|
|
iK1 = Hasher::HashCode (p->Key1(), newBuck);
|
|
iK2 = ::HashCode (p->Key2(), newBuck);
|
|
q = (IndexedDataMapNode*) p->Next();
|
|
p->Next() = ppNewData1[iK1];
|
|
p->Next2() = (IndexedDataMapNode*)ppNewData2[iK2];
|
|
ppNewData1[iK1] = p;
|
|
ppNewData2[iK2] = p;
|
|
p = q;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
EndResize (N, newBuck, ppNewData1, ppNewData2);
|
|
}
|
|
}
|
|
|
|
//! Add
|
|
Standard_Integer Add (const TheKeyType& theKey1, const TheItemType& theItem)
|
|
{
|
|
if (Resizable())
|
|
ReSize(Extent());
|
|
Standard_Integer iK1 = Hasher::HashCode (theKey1, NbBuckets());
|
|
IndexedDataMapNode * pNode;
|
|
pNode = (IndexedDataMapNode *) myData1[iK1];
|
|
while (pNode)
|
|
{
|
|
if (Hasher::IsEqual (pNode->Key1(), theKey1))
|
|
return pNode->Key2();
|
|
pNode = (IndexedDataMapNode *) pNode->Next();
|
|
}
|
|
Increment();
|
|
Standard_Integer iK2 = ::HashCode(Extent(),NbBuckets());
|
|
pNode = new (this->myAllocator) IndexedDataMapNode (theKey1, Extent(), theItem,
|
|
myData1[iK1], myData2[iK2]);
|
|
myData1[iK1] = pNode;
|
|
myData2[iK2] = pNode;
|
|
return Extent();
|
|
}
|
|
|
|
//! Contains
|
|
Standard_Boolean Contains (const TheKeyType& theKey1) const
|
|
{
|
|
if (IsEmpty())
|
|
return Standard_False;
|
|
Standard_Integer iK1 = Hasher::HashCode (theKey1, NbBuckets());
|
|
IndexedDataMapNode * pNode1;
|
|
pNode1 = (IndexedDataMapNode *) myData1[iK1];
|
|
while (pNode1)
|
|
{
|
|
if (Hasher::IsEqual(pNode1->Key1(), theKey1))
|
|
return Standard_True;
|
|
pNode1 = (IndexedDataMapNode *) pNode1->Next();
|
|
}
|
|
return Standard_False;
|
|
}
|
|
|
|
//! Substitute
|
|
void Substitute (const Standard_Integer theIndex,
|
|
const TheKeyType& theKey1,
|
|
const TheItemType& theItem)
|
|
{
|
|
Standard_OutOfRange_Raise_if (theIndex < 1 || theIndex > Extent(),
|
|
"NCollection_IndexedDataMap::Substitute : "
|
|
"Index is out of range");
|
|
|
|
IndexedDataMapNode * p;
|
|
// check if theKey1 is not already in the map
|
|
Standard_Integer iK1 = Hasher::HashCode (theKey1, NbBuckets());
|
|
p = (IndexedDataMapNode *) myData1[iK1];
|
|
while (p)
|
|
{
|
|
if (Hasher::IsEqual (p->Key1(), theKey1))
|
|
{
|
|
if (p->Key2() != theIndex)
|
|
{
|
|
Standard_DomainError::Raise ("NCollection_IndexedDataMap::Substitute : "
|
|
"Attempt to substitute existing key");
|
|
}
|
|
p->Key1() = theKey1;
|
|
p->ChangeValue() = theItem;
|
|
return;
|
|
}
|
|
p = (IndexedDataMapNode *) p->Next();
|
|
}
|
|
|
|
// Find the node for the index I
|
|
Standard_Integer iK2 = ::HashCode (theIndex, NbBuckets());
|
|
p = (IndexedDataMapNode *) myData2[iK2];
|
|
while (p)
|
|
{
|
|
if (p->Key2() == theIndex)
|
|
break;
|
|
p = (IndexedDataMapNode*) p->Next2();
|
|
}
|
|
|
|
// remove the old key
|
|
Standard_Integer iK = Hasher::HashCode (p->Key1(), NbBuckets());
|
|
IndexedDataMapNode * q = (IndexedDataMapNode *) myData1[iK];
|
|
if (q == p)
|
|
myData1[iK] = (IndexedDataMapNode *) p->Next();
|
|
else
|
|
{
|
|
while (q->Next() != p)
|
|
q = (IndexedDataMapNode *) q->Next();
|
|
q->Next() = p->Next();
|
|
}
|
|
|
|
// update the node
|
|
p->Key1() = theKey1;
|
|
p->ChangeValue() = theItem;
|
|
p->Next() = myData1[iK1];
|
|
myData1[iK1] = p;
|
|
}
|
|
|
|
//! Swaps two elements with the given indices.
|
|
void Swap (const Standard_Integer theIndex1,
|
|
const Standard_Integer theIndex2)
|
|
{
|
|
Standard_OutOfRange_Raise_if (theIndex1 < 1 || theIndex1 > Extent()
|
|
|| theIndex2 < 1 || theIndex2 > Extent(), "NCollection_IndexedDataMap::Swap");
|
|
|
|
if (theIndex1 == theIndex2)
|
|
{
|
|
return;
|
|
}
|
|
|
|
const Standard_Integer aK1 = ::HashCode (theIndex1, NbBuckets());
|
|
const Standard_Integer aK2 = ::HashCode (theIndex2, NbBuckets());
|
|
|
|
IndexedDataMapNode* aP1 = (IndexedDataMapNode*) myData2[aK1];
|
|
IndexedDataMapNode* aP2 = (IndexedDataMapNode*) myData2[aK2];
|
|
|
|
if (aP1->Key2() == theIndex1)
|
|
{
|
|
myData2[aK1] = (IndexedDataMapNode *) aP1->Next2();
|
|
}
|
|
else
|
|
{
|
|
IndexedDataMapNode* aQ = aP1;
|
|
for (aP1 = aQ->Next2(); aP1->Key2() != theIndex1; aQ = aP1, aP1 = aQ->Next2()) { }
|
|
|
|
aQ->Next2() = aP1->Next2();
|
|
}
|
|
|
|
if (aP2->Key2() == theIndex2)
|
|
{
|
|
myData2[aK2] = (IndexedDataMapNode *) aP2->Next2();
|
|
}
|
|
else
|
|
{
|
|
IndexedDataMapNode* aQ = aP2;
|
|
for (aP2 = aQ->Next2(); aP2->Key2() != theIndex2; aQ = aP2, aP2 = aQ->Next2()) { }
|
|
|
|
aQ->Next2() = aP2->Next2();
|
|
}
|
|
|
|
std::swap (aP1->Key2(),
|
|
aP2->Key2());
|
|
|
|
aP1->Next2() = (IndexedDataMapNode*) myData2[aK2];
|
|
myData2[aK2] = aP1;
|
|
|
|
aP2->Next2() = (IndexedDataMapNode*) myData2[aK1];
|
|
myData2[aK1] = aP2;
|
|
}
|
|
|
|
//! RemoveLast
|
|
void RemoveLast (void)
|
|
{
|
|
Standard_OutOfRange_Raise_if (Extent() == 0, "NCollection_IndexedDataMap::RemoveLast");
|
|
|
|
IndexedDataMapNode * p, * q;
|
|
// Find the node for the last index and remove it
|
|
Standard_Integer iK2 = ::HashCode (Extent(), NbBuckets());
|
|
p = (IndexedDataMapNode *) myData2[iK2];
|
|
q = NULL;
|
|
while (p)
|
|
{
|
|
if (p->Key2() == Extent())
|
|
break;
|
|
q = p;
|
|
p = (IndexedDataMapNode*) p->Next2();
|
|
}
|
|
if (q == NULL)
|
|
myData2[iK2] = (IndexedDataMapNode *) p->Next2();
|
|
else
|
|
q->Next2() = p->Next2();
|
|
|
|
// remove the key
|
|
Standard_Integer iK1 = Hasher::HashCode (p->Key1(), NbBuckets());
|
|
q = (IndexedDataMapNode *) myData1[iK1];
|
|
if (q == p)
|
|
myData1[iK1] = (IndexedDataMapNode *) p->Next();
|
|
else
|
|
{
|
|
while (q->Next() != p)
|
|
q = (IndexedDataMapNode *) q->Next();
|
|
q->Next() = p->Next();
|
|
}
|
|
p->~IndexedDataMapNode();
|
|
this->myAllocator->Free(p);
|
|
Decrement();
|
|
}
|
|
|
|
//! FindKey
|
|
const TheKeyType& FindKey (const Standard_Integer theKey2) const
|
|
{
|
|
Standard_OutOfRange_Raise_if (theKey2 < 1 || theKey2 > Extent(), "NCollection_IndexedDataMap::FindKey");
|
|
|
|
IndexedDataMapNode* aNode = nodeFromIndex (theKey2);
|
|
if (aNode == NULL)
|
|
{
|
|
Standard_NoSuchObject::Raise ("NCollection_IndexedDataMap::FindKey");
|
|
}
|
|
return aNode->Key1();
|
|
}
|
|
|
|
//! FindFromIndex
|
|
const TheItemType& FindFromIndex (const Standard_Integer theKey2) const
|
|
{
|
|
Standard_OutOfRange_Raise_if (theKey2 < 1 || theKey2 > Extent(), "NCollection_IndexedDataMap::FindFromIndex");
|
|
|
|
IndexedDataMapNode* aNode = nodeFromIndex (theKey2);
|
|
if (aNode == NULL)
|
|
{
|
|
Standard_NoSuchObject::Raise ("NCollection_IndexedDataMap::FindFromIndex");
|
|
}
|
|
return aNode->Value();
|
|
}
|
|
|
|
//! operator ()
|
|
const TheItemType& operator() (const Standard_Integer theKey2) const
|
|
{ return FindFromIndex (theKey2); }
|
|
|
|
//! ChangeFromIndex
|
|
TheItemType& ChangeFromIndex (const Standard_Integer theKey2)
|
|
{
|
|
Standard_OutOfRange_Raise_if (theKey2 < 1 || theKey2 > Extent(), "NCollection_IndexedDataMap::ChangeFromIndex");
|
|
|
|
IndexedDataMapNode* aNode = nodeFromIndex (theKey2);
|
|
if (aNode == NULL)
|
|
{
|
|
Standard_NoSuchObject::Raise ("NCollection_IndexedDataMap::ChangeFromIndex");
|
|
}
|
|
return aNode->ChangeValue();
|
|
}
|
|
|
|
//! operator ()
|
|
TheItemType& operator() (const Standard_Integer theKey2)
|
|
{ return ChangeFromIndex (theKey2); }
|
|
|
|
//! FindIndex
|
|
Standard_Integer FindIndex(const TheKeyType& theKey1) const
|
|
{
|
|
if (IsEmpty()) return 0;
|
|
IndexedDataMapNode * pNode1 =
|
|
(IndexedDataMapNode *) myData1[Hasher::HashCode(theKey1,NbBuckets())];
|
|
while (pNode1)
|
|
{
|
|
if (Hasher::IsEqual (pNode1->Key1(), theKey1))
|
|
return pNode1->Key2();
|
|
pNode1 = (IndexedDataMapNode*) pNode1->Next();
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
//! FindFromKey
|
|
const TheItemType& FindFromKey(const TheKeyType& theKey1) const
|
|
{
|
|
Standard_NoSuchObject_Raise_if (IsEmpty(), "NCollection_IndexedDataMap::FindFromKey");
|
|
|
|
IndexedDataMapNode * pNode1 =
|
|
(IndexedDataMapNode *) myData1[Hasher::HashCode(theKey1,NbBuckets())];
|
|
while (pNode1)
|
|
{
|
|
if (Hasher::IsEqual (pNode1->Key1(), theKey1))
|
|
return pNode1->Value();
|
|
pNode1 = (IndexedDataMapNode*) pNode1->Next();
|
|
}
|
|
Standard_NoSuchObject::Raise("NCollection_IndexedDataMap::FindFromKey");
|
|
return pNode1->Value();
|
|
}
|
|
|
|
//! ChangeFromKey
|
|
TheItemType& ChangeFromKey (const TheKeyType& theKey1)
|
|
{
|
|
Standard_NoSuchObject_Raise_if (IsEmpty(), "NCollection_IndexedDataMap::ChangeFromKey");
|
|
|
|
IndexedDataMapNode * pNode1 =
|
|
(IndexedDataMapNode *) myData1[Hasher::HashCode(theKey1,NbBuckets())];
|
|
while (pNode1)
|
|
{
|
|
if (Hasher::IsEqual (pNode1->Key1(), theKey1))
|
|
return pNode1->ChangeValue();
|
|
pNode1 = (IndexedDataMapNode*) pNode1->Next();
|
|
}
|
|
Standard_NoSuchObject::Raise("NCollection_IndexedDataMap::ChangeFromKey");
|
|
return pNode1->ChangeValue();
|
|
}
|
|
|
|
//! Seek returns pointer to Item by Key. Returns
|
|
//! NULL if Key was not found.
|
|
const TheItemType* Seek(const TheKeyType& theKey1) const
|
|
{
|
|
return const_cast< NCollection_IndexedDataMap * >( this )->ChangeSeek(theKey1);
|
|
//NCollection_IndexedDataMap *pMap=(NCollection_IndexedDataMap *)this;
|
|
//return pMap->ChangeSeek(theKey1);
|
|
}
|
|
|
|
//! ChangeSeek returns modifiable pointer to Item by Key. Returns
|
|
//! NULL if Key was not found.
|
|
TheItemType* ChangeSeek (const TheKeyType& theKey1)
|
|
{
|
|
if (!IsEmpty())
|
|
{
|
|
IndexedDataMapNode * pNode1 =
|
|
(IndexedDataMapNode *) myData1[Hasher::HashCode(theKey1,NbBuckets())];
|
|
while (pNode1)
|
|
{
|
|
if (Hasher::IsEqual (pNode1->Key1(), theKey1))
|
|
return &pNode1->ChangeValue();
|
|
pNode1 = (IndexedDataMapNode*) pNode1->Next();
|
|
}
|
|
}
|
|
return 0L;
|
|
}
|
|
|
|
//! Find value for key with copying.
|
|
//! @return true if key was found
|
|
Standard_Boolean FindFromKey (const TheKeyType& theKey1,
|
|
TheItemType& theValue) const
|
|
{
|
|
if (IsEmpty())
|
|
{
|
|
return Standard_False;
|
|
}
|
|
for (IndexedDataMapNode* aNode = (IndexedDataMapNode* )myData1[Hasher::HashCode (theKey1, NbBuckets())];
|
|
aNode != NULL; aNode = (IndexedDataMapNode* )aNode->Next())
|
|
{
|
|
if (Hasher::IsEqual (aNode->Key1(), theKey1))
|
|
{
|
|
theValue = aNode->Value();
|
|
return Standard_True;
|
|
}
|
|
}
|
|
return Standard_False;
|
|
}
|
|
|
|
//! Clear data. If doReleaseMemory is false then the table of
|
|
//! buckets is not released and will be reused.
|
|
void Clear(const Standard_Boolean doReleaseMemory = Standard_True)
|
|
{ Destroy (IndexedDataMapNode::delNode, doReleaseMemory); }
|
|
|
|
//! Clear data and reset allocator
|
|
void Clear (const Handle(NCollection_BaseAllocator)& theAllocator)
|
|
{
|
|
Clear();
|
|
this->myAllocator = ( ! theAllocator.IsNull() ? theAllocator :
|
|
NCollection_BaseAllocator::CommonBaseAllocator() );
|
|
}
|
|
|
|
//! Destructor
|
|
virtual ~NCollection_IndexedDataMap (void)
|
|
{ Clear(); }
|
|
|
|
//! Size
|
|
Standard_Integer Size(void) const
|
|
{ return Extent(); }
|
|
|
|
private:
|
|
// ----------- PRIVATE METHODS -----------
|
|
|
|
//! Find map node associated with specified index.
|
|
//! Return NULL if not found (exception-free internal implementation).
|
|
IndexedDataMapNode* nodeFromIndex (const Standard_Integer theKey2) const
|
|
{
|
|
if (Extent() == 0)
|
|
{
|
|
return NULL;
|
|
}
|
|
for (IndexedDataMapNode* aNode = (IndexedDataMapNode* )myData2[::HashCode (theKey2, NbBuckets())];
|
|
aNode != NULL; aNode = (IndexedDataMapNode* )aNode->Next2())
|
|
{
|
|
if (aNode->Key2() == theKey2)
|
|
{
|
|
return aNode;
|
|
}
|
|
}
|
|
return NULL;
|
|
}
|
|
|
|
};
|
|
|
|
#endif
|