/usr/include/oce/NCollection_Array2.hxx is in liboce-foundation-dev 0.17.1-1.
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 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 | // Created on: 2002-04-15
// 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_Array2_HeaderFile
#define NCollection_Array2_HeaderFile
#include <Standard_DimensionMismatch.hxx>
#include <Standard_OutOfMemory.hxx>
#include <Standard_OutOfRange.hxx>
#include <NCollection_DefineAlloc.hxx>
// *********************************************** Template for Array2 class
/**
* Purpose: The class Array2 represents bi-dimensional arrays
* of fixed size known at run time.
* The ranges of indices are user defined.
*
* Warning: Programs clients of such class must be independant
* of the range of the first element. Then, a C++ for
* loop must be written like this
*
* for (i = A.LowerRow(); i <= A.UpperRow(); i++)
* for (j = A.LowerCol(); j <= A.UpperCol(); j++)
*/
template <class TheItemType>
class NCollection_Array2
{
public:
//! STL-compliant typedef for value type
typedef TheItemType value_type;
public:
// **************** Implementation of the Iterator interface.
class Iterator
{
public:
//! Empty constructor - for later Init
Iterator (void) :
myCurrent (0),
mySize (0),
myArray (NULL) {}
//! Constructor with initialisation
Iterator (const NCollection_Array2& theArray) :
myCurrent (0),
mySize (theArray.Length()),
myArray ((NCollection_Array2<TheItemType> *) &theArray) {}
//! Initialisation
void Init (const NCollection_Array2& theArray)
{
myCurrent = 0;
mySize = theArray.Length();
myArray = (NCollection_Array2<TheItemType> *) &theArray;
}
//! Check end
Standard_Boolean More (void) const
{ return (myCurrent < mySize); }
//! Make step
void Next (void)
{ myCurrent++; }
//! Constant value access
const TheItemType& Value (void) const
{ return myArray->myStart[myCurrent]; }
//! Variable value access
TheItemType& ChangeValue (void) const
{ return myArray->myStart[myCurrent]; }
private:
Standard_Integer myCurrent; //!< Index of the current item
Standard_Integer mySize; //!< Total amount of items
NCollection_Array2* myArray; //!< Pointer to the array being iterated
}; // End of nested class Iterator
public:
// ---------- PUBLIC METHODS ------------
//! Constructor
NCollection_Array2(const Standard_Integer theRowLower,
const Standard_Integer theRowUpper,
const Standard_Integer theColLower,
const Standard_Integer theColUpper) :
myLowerRow (theRowLower),
myUpperRow (theRowUpper),
myLowerCol (theColLower),
myUpperCol (theColUpper),
myDeletable (Standard_True)
{ Allocate(); }
//! Copy constructor
NCollection_Array2 (const NCollection_Array2& theOther) :
myLowerRow (theOther.LowerRow()),
myUpperRow (theOther.UpperRow()),
myLowerCol (theOther.LowerCol()),
myUpperCol (theOther.UpperCol()),
myDeletable (Standard_True)
{
Allocate();
*this = theOther;
}
//! C array-based constructor
NCollection_Array2(const TheItemType& theBegin,
const Standard_Integer theRowLower,
const Standard_Integer theRowUpper,
const Standard_Integer theColLower,
const Standard_Integer theColUpper) :
myLowerRow (theRowLower),
myUpperRow (theRowUpper),
myLowerCol (theColLower),
myUpperCol (theColUpper),
myDeletable (Standard_False)
{
myStart = (TheItemType *) &theBegin;
Allocate();
}
//! Initialise the values
void Init (const TheItemType& theValue)
{
TheItemType *pCur, *pEnd=myStart+Size();
for(pCur = myStart; pCur<pEnd; pCur++)
*pCur = theValue;
}
//! Size (number of items)
Standard_Integer Size (void) const
{ return Length(); }
//! Length (number of items)
Standard_Integer Length (void) const
{ return RowLength() * ColLength(); }
//! RowLength
Standard_Integer RowLength (void) const
{ return (myUpperCol-myLowerCol+1); }
//! ColLength
Standard_Integer ColLength (void) const
{ return (myUpperRow-myLowerRow+1); }
//! LowerRow
Standard_Integer LowerRow (void) const
{ return myLowerRow; }
//! UpperRow
Standard_Integer UpperRow (void) const
{ return myUpperRow; }
//! LowerCol
Standard_Integer LowerCol (void) const
{ return myLowerCol; }
//! UpperCol
Standard_Integer UpperCol (void) const
{ return myUpperCol; }
//! myDeletable flag
Standard_Boolean IsDeletable (void) const
{ return myDeletable; }
//! Assignment
NCollection_Array2& Assign (const NCollection_Array2& theOther)
{
if (&theOther == this)
return *this;
Standard_DimensionMismatch_Raise_if (Length() != theOther.Length(), "NCollection_Array2::operator=");
TheItemType * pMyItem = myStart;
TheItemType * pItem = theOther.myStart;
const Standard_Integer iSize = Length();
for (Standard_Integer i=0; i < iSize; i++, pItem++, pMyItem++)
*pMyItem = *pItem;
return *this;
}
//! Assignment operator
NCollection_Array2& operator= (const NCollection_Array2& theOther)
{
return Assign (theOther);
}
//! Constant value access
const TheItemType& Value (const Standard_Integer theRow,
const Standard_Integer theCol) const
{
Standard_OutOfRange_Raise_if (theRow < myLowerRow || theRow > myUpperRow ||
theCol < myLowerCol || theCol > myUpperCol, "NCollection_Array2::Value");
return myData[theRow][theCol];
}
//! operator() - alias to ChangeValue
const TheItemType& operator() (const Standard_Integer theRow,
const Standard_Integer theCol) const
{ return Value (theRow,theCol); }
//! Variable value access
TheItemType& ChangeValue (const Standard_Integer theRow,
const Standard_Integer theCol)
{
Standard_OutOfRange_Raise_if (theRow < myLowerRow || theRow > myUpperRow ||
theCol < myLowerCol || theCol > myUpperCol, "NCollection_Array2::ChangeValue");
return myData[theRow][theCol];
}
//! operator() - alias to ChangeValue
TheItemType& operator() (const Standard_Integer theRow,
const Standard_Integer theCol)
{ return ChangeValue (theRow,theCol); }
//! SetValue
void SetValue (const Standard_Integer theRow,
const Standard_Integer theCol,
const TheItemType& theItem)
{
Standard_OutOfRange_Raise_if (theRow < myLowerRow || theRow > myUpperRow ||
theCol < myLowerCol || theCol > myUpperCol, "NCollection_Array2::SetValue");
myData[theRow][theCol] = theItem;
}
//! Destructor - releases the memory
~NCollection_Array2 (void)
{
if (myDeletable) delete [] myStart;
delete [] &(myData[myLowerRow]);
}
private:
// ----------- PRIVATE METHODS -----------
//! Allocate memory for the array, set up indirection table
void Allocate (void)
{
const Standard_Integer iRowSize = myUpperCol - myLowerCol + 1;
const Standard_Integer iColSize = myUpperRow - myLowerRow + 1;
Standard_RangeError_Raise_if (iRowSize <= 0 || iColSize <= 0, "NCollection_Array2::Allocate");
if (myDeletable) {
// allocation of the data in the array
myStart = new TheItemType[iRowSize * iColSize];
Standard_OutOfMemory_Raise_if (!myStart, "NCollection_Array2 : Allocation failed");
}
// else myStart is set to the beginning of the given array
TheItemType** pTable = new TheItemType* [iColSize];
Standard_OutOfMemory_Raise_if (!pTable, "NCollection_Array2 : Allocation failed");
// Items of pTable point to the '0'th items in the rows of the array
TheItemType* pRow = myStart - myLowerCol;
for (Standard_Integer i = 0; i < iColSize; i++)
{
pTable[i] = pRow;
pRow += iRowSize;
}
// Set myData to the '0'th row pointer of the pTable
myData = pTable - myLowerRow;
}
protected:
// ---------- PROTECTED FIELDS -----------
Standard_Integer myLowerRow;
Standard_Integer myUpperRow;
Standard_Integer myLowerCol;
Standard_Integer myUpperCol;
TheItemType** myData; //!< Pointer to the row pointers table
TheItemType* myStart; //!< Pointer to the memory array
Standard_Boolean myDeletable; //!< Flag showing who allocated the array
// ----------- FRIEND CLASSES ------------
friend class Iterator;
};
#endif
|