/usr/include/opencascade/TCollection_Array2.gxx is in libopencascade-foundation-dev 6.5.0.dfsg-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 | #include <Standard_DimensionMismatch.hxx>
#include <Standard_RangeError.hxx>
#include <Standard_OutOfMemory.hxx>
#include <Standard.hxx>
//=======================================================================
//function : Allocate
//purpose : Allocate memory for the array, set up indirection table
//=======================================================================
void TCollection_Array2::Allocate ()
{
Standard_Integer RowSize = myUpperColumn-myLowerColumn+1;
Standard_Integer ColumnSize = myUpperRow-myLowerRow+1;
if (myDeletable) {
// allocation of the data in the array
Standard_Integer Size = RowSize * ColumnSize;
// Modified by Sergey KHROMOV - Mon Feb 10 11:46:14 2003 Begin
// Standard_RangeError_Raise_if(( RowSize < 0 || ColumnSize < 0 ),
// "TCollection_Array2::Create");
Standard_RangeError_Raise_if(( RowSize <= 0 || ColumnSize <= 0 ),
"TCollection_Array2::Create");
// Modified by Sergey KHROMOV - Mon Feb 10 11:46:15 2003 End
#ifdef __OPTIM_ARRAY
myData = Standard::Allocate(Size*sizeof (Array2Item));
// myData = (Array2Item *) new char [Size * sizeof (Array2Item)];
#else
myData = new Array2Item [Size];
#endif
if (!myData) Standard_OutOfMemory::Raise("Array2 : Allocation failed");
}
// allocation of the indirection table (pointers on rows)
Array2Item* p = (Array2Item*) myData;
Array2Item** q = (Array2Item**)Standard::Allocate(ColumnSize * sizeof(Array2Item*));
for (Standard_Integer i = 0; i < ColumnSize; i++) {
q[i] = p - myLowerColumn;
p += RowSize;
}
myData = (void*) (q - myLowerRow);
}
//=======================================================================
//function : TCollection_Array2
//purpose :
//=======================================================================
TCollection_Array2::TCollection_Array2 (const Standard_Integer R1,
const Standard_Integer R2,
const Standard_Integer C1,
const Standard_Integer C2) :
myLowerRow(R1),
myLowerColumn(C1),
myUpperRow(R2),
myUpperColumn(C2),
myDeletable(Standard_True)
{
Allocate ();
}
//=======================================================================
//function : TCollection_Array2
//purpose : User allocated data
//=======================================================================
TCollection_Array2::TCollection_Array2 (const Array2Item& Item,
const Standard_Integer R1,
const Standard_Integer R2,
const Standard_Integer C1,
const Standard_Integer C2) :
myLowerRow(R1),
myLowerColumn(C1),
myUpperRow(R2),
myUpperColumn(C2),
myDeletable(Standard_False),
myData((void*)&Item)
{
Allocate ();
}
//=======================================================================
//function : Init
//purpose :
//=======================================================================
void TCollection_Array2::Init (const Array2Item& V)
{
Standard_Integer Size = RowLength() * ColLength();
Array2Item* p = &(ChangeValue(myLowerRow,myLowerColumn));
for (Standard_Integer I = 0; I < Size ; I++) p[I] = V;
}
//=======================================================================
//function : Destroy
//purpose :
//=======================================================================
void TCollection_Array2::Destroy ()
{
Array2Item** anItemPtr = ((Array2Item**)myData + myLowerRow);
// delete the data
//
if (myDeletable)
#ifdef __OPTIM_ARRAY
{
Standard_Integer RowSize = myUpperColumn-myLowerColumn+1;
Standard_Integer ColumnSize = myUpperRow-myLowerRow+1;
Standard_Integer Size = RowSize * ColumnSize;
Standard_Address it = (Standard_Address)&((Array2Item **)myData)[myLowerRow][myLowerColumn];
Standard::Free(it);
}
#else
delete [] &ChangeValue(myLowerRow,myLowerColumn);
#endif
// delete the indirection table
Standard::Free((void*&)anItemPtr);
}
//=======================================================================
//function : Assign
//purpose :
//=======================================================================
const TCollection_Array2& TCollection_Array2::Assign
(const TCollection_Array2& Right)
{
Standard_Integer MaxColumn = RowLength() ;
Standard_Integer MaxRow = ColLength() ;
Standard_Integer MaxSize = MaxColumn * MaxRow;
Standard_DimensionMismatch_Raise_if(MaxRow != Right.ColLength() ||
MaxColumn != Right.RowLength(),
"Array2::Operator=");
Array2Item* p = &ChangeValue(myLowerRow,myLowerColumn);
const Array2Item* q = &Right.Value(Right.LowerRow(),Right.LowerCol());
for (Standard_Integer i=0; i<MaxSize; i++) {
p[i] = q[i];
}
return *this;
}
|