/usr/include/oce/NCollection_BaseMap.hxx is in liboce-foundation-dev 0.18.2-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 | // Created on: 2002-04-18
// 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_BaseMap_HeaderFile
#define NCollection_BaseMap_HeaderFile
#include <Standard.hxx>
#include <NCollection_BaseAllocator.hxx>
#include <NCollection_DefineAlloc.hxx>
#include <NCollection_ListNode.hxx>
typedef void (* NCollection_DelMapNode)
(NCollection_ListNode*, Handle(NCollection_BaseAllocator)& theAl);
/**
* Purpose: This is a base class for all Maps:
* Map
* DataMap
* DoubleMap
* IndexedMap
* IndexedDataMap
* Provides utilitites for managing the buckets.
*/
class NCollection_BaseMap
{
public:
//! Memory allocation
DEFINE_STANDARD_ALLOC
DEFINE_NCOLLECTION_ALLOC
public:
// **************************************** Class Iterator ****************
class Iterator
{
protected:
//! Empty constructor
Iterator (void) :
myNbBuckets (0),
myBuckets (NULL),
myBucket (0),
myNode (NULL) {}
//! Constructor
Iterator (const NCollection_BaseMap& theMap) :
myNbBuckets (theMap.myNbBuckets),
myBuckets (theMap.myData1),
myBucket (-1),
myNode (NULL)
{
if (!myBuckets)
myNbBuckets = -1;
else
do {
myBucket++;
if (myBucket > myNbBuckets)
return;
myNode = myBuckets[myBucket];
} while (!myNode);
}
public:
//! Initialize
void Initialize (const NCollection_BaseMap& theMap)
{
myNbBuckets = theMap.myNbBuckets;
myBuckets = theMap.myData1;
myBucket = -1;
myNode = NULL;
if (!myBuckets)
myNbBuckets = -1;
PNext();
}
//! Reset
void Reset (void)
{
myBucket = -1;
myNode = NULL;
PNext();
}
//! Performs comparison of two iterators.
Standard_Boolean IsEqual (const Iterator& theOther) const
{
return myBucket == theOther.myBucket && myNode == theOther.myNode;
}
protected:
//! PMore
Standard_Boolean PMore (void) const
{ return (myNode != NULL); }
//! PNext
void PNext (void)
{
if (!myBuckets)
return;
if (myNode)
{
myNode = myNode->Next();
if (myNode)
return;
}
while (!myNode)
{
myBucket++;
if (myBucket > myNbBuckets)
return;
myNode = myBuckets[myBucket];
}
}
protected:
// ---------- PRIVATE FIELDS ------------
Standard_Integer myNbBuckets; //!< Total buckets in the map
NCollection_ListNode **myBuckets; //!< Location in memory
Standard_Integer myBucket; //!< Current bucket
NCollection_ListNode * myNode; //!< Current node
};
public:
// ---------- PUBLIC METHODS ------------
//! NbBuckets
Standard_Integer NbBuckets() const
{ return myNbBuckets; }
//! Extent
Standard_Integer Extent() const
{ return mySize; }
//! IsEmpty
Standard_Boolean IsEmpty() const
{ return mySize == 0; }
//! Statistics
Standard_EXPORT void Statistics(Standard_OStream& S) const;
protected:
// -------- PROTECTED METHODS -----------
//! Constructor
NCollection_BaseMap (const Standard_Integer NbBuckets,
const Standard_Boolean single,
const Handle(NCollection_BaseAllocator)& theAllocator)
: myData1(NULL),
myData2(NULL),
isDouble(!single),
mySaturated(Standard_False),
myNbBuckets(NbBuckets),
mySize(0)
{
myAllocator = (theAllocator.IsNull() ? NCollection_BaseAllocator::CommonBaseAllocator() : theAllocator);
}
//! BeginResize
Standard_EXPORT Standard_Boolean BeginResize
(const Standard_Integer NbBuckets,
Standard_Integer& NewBuckets,
NCollection_ListNode**& data1,
NCollection_ListNode**& data2) const;
//! EndResize
Standard_EXPORT void EndResize
(const Standard_Integer NbBuckets,
const Standard_Integer NewBuckets,
NCollection_ListNode** data1,
NCollection_ListNode** data2);
//! Resizable
Standard_Boolean Resizable() const
{ return IsEmpty() || (!mySaturated && (mySize > myNbBuckets)); }
//! Increment
void Increment()
{ mySize++; }
//! Decrement
void Decrement()
{ mySize--; }
//! Destroy
Standard_EXPORT void Destroy(NCollection_DelMapNode fDel,
Standard_Boolean doReleaseMemory = Standard_True);
//! NextPrimeForMap
Standard_EXPORT Standard_Integer NextPrimeForMap
(const Standard_Integer N) const;
//! Exchange content of two maps without data copying
void exchangeMapsData (NCollection_BaseMap& theOther)
{
std::swap (myAllocator, theOther.myAllocator);
std::swap (myData1, theOther.myData1);
std::swap (myData2, theOther.myData2);
//std::swap (isDouble, theOther.isDouble);
std::swap (mySaturated, theOther.mySaturated);
std::swap (myNbBuckets, theOther.myNbBuckets);
std::swap (mySize, theOther.mySize);
}
protected:
// --------- PROTECTED FIELDS -----------
Handle(NCollection_BaseAllocator) myAllocator;
NCollection_ListNode ** myData1;
NCollection_ListNode ** myData2;
private:
// ---------- PRIVATE FIELDS ------------
Standard_Boolean isDouble;
Standard_Boolean mySaturated;
Standard_Integer myNbBuckets;
Standard_Integer mySize;
// ---------- FRIEND CLASSES ------------
friend class Iterator;
};
#endif
|