/usr/include/oce/LDOM_DeclareSequence.hxx is in liboce-ocaf-lite-dev 0.17.2-2.
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 | // Created on: 2001-01-29
// Created by: Alexander GRIGORIEV
// Copyright (c) 2001-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 _Sequence_Declare_HeaderFile
#define _Sequence_Declare_HeaderFile
#ifndef _Standard_Macro_HeaderFile
#include <Standard_Macro.hxx>
#endif
// Declaration of Sequence (numbered list) class.
// Remarks on the current implementation:
//
// 1. Methods First() and Last() added
// 2. The method InsertAt(anIndex) replaces InsertBefore and InsertAfter.
// This method never throws exception "OutOfRange". Its behaviour:
// anIndex <= 1 => equivalent to Prepend()
// anIndex > Length() => equivalent to Append()
// else => equivalent to InsertBefore.
// *******************************************************************
// use the following somewhere in a header file;
// ClassName - name of the list class to create
// Type - type of members of the list
// *******************************************************************
#define DECLARE_SEQUENCE( ClassName, Type ) \
\
class ClassName { \
public: \
inline ClassName (); \
inline ClassName (const ClassName& anOther); \
inline ClassName& operator= (const ClassName& anOther); \
inline Standard_Integer Length () const; \
inline const Type& First () const; \
inline const Type& Last () const; \
inline const Type& Value (const Standard_Integer)const;\
inline Type& ChangeValue (const Standard_Integer); \
inline const Type& operator () (const Standard_Integer)const;\
inline Type& operator () (const Standard_Integer); \
\
Standard_EXPORT virtual ~ClassName (); \
Standard_EXPORT void Append (const Type& aVal); \
Standard_EXPORT void Prepend (const Type& aVal); \
Standard_EXPORT void InsertAt (const Standard_Integer, \
const Type& aVal); \
Standard_EXPORT void Clear (); \
Standard_EXPORT void Remove (const Standard_Integer); \
\
private: \
class Node { \
private: \
Type myValue; \
Node * myPrev; \
Node * myNext; \
public: \
Node (const Type& aValue, Node * aPrv, Node * aNxt) \
: myValue (aValue), myPrev (aPrv), myNext (aNxt) {} \
const Type& Value () const { return myValue; } \
Type& ChangeValue () { return myValue; } \
friend class ClassName; \
}; \
\
Standard_EXPORT const void * FindItem (const Standard_Integer)const;\
Standard_EXPORT void Assign (const ClassName& anOther); \
\
Node * myFirst; \
Node * myLast; \
Node * myCurrent; \
Standard_Integer myICur; \
Standard_Integer myLength; \
}; \
\
inline ClassName::ClassName () : \
myFirst (NULL), \
myLast (NULL), \
myCurrent (NULL), \
myICur (0), \
myLength (0) {} \
\
inline ClassName::ClassName (const ClassName& anOther) : \
myFirst (NULL) \
{ \
Assign (anOther); \
} \
\
inline ClassName& ClassName::operator= (const ClassName& anOther) \
{ \
Assign (anOther); \
return * this; \
} \
\
inline Standard_Integer ClassName::Length () const{ \
return myLength; \
} \
\
inline const Type& ClassName::First () const \
{ \
return myFirst -> Value (); /* exception if out of range */ \
} \
\
inline const Type& ClassName::Last () const \
{ \
return myLast -> Value(); /* exception if out of range */ \
} \
\
inline const Type& ClassName::Value (const Standard_Integer anI) const \
{ \
const Node * anItem = (const Node *) FindItem (anI); \
return anItem -> Value (); /* exception if out of range */ \
} \
\
inline Type& ClassName::ChangeValue (const Standard_Integer anI) \
{ \
Node * anItem = (Node *) FindItem (anI); \
return anItem -> ChangeValue (); /* exception if out of range */ \
} \
\
inline const Type& ClassName::operator() (const Standard_Integer anI) const \
{ \
return Value (anI); \
} \
\
inline Type& ClassName::operator() (const Standard_Integer anI) \
{ \
return ChangeValue (anI); \
} \
// *******************************************************************
// use the following in a translation unit (*.cxx);
//
// *******************************************************************
#define IMPLEMENT_SEQUENCE( ClassName, Type ) \
const void * ClassName::FindItem (const Standard_Integer anI) const \
{ \
if (anI < 1 || anI > myLength) return NULL; \
Standard_Integer aCounter; \
Node * aCurrent = (Node *) myCurrent; \
Standard_Boolean aDir (Standard_False); \
if (aCurrent == NULL) { \
aCurrent = myFirst; \
aCounter = anI - 1; \
aDir = Standard_True; \
}else{ \
aCounter = Abs (anI - myICur); \
if (anI <= aCounter) { \
aCurrent = myFirst; \
aCounter = anI - 1; \
aDir = Standard_True; \
}else if (myLength - anI < aCounter) { \
aCurrent = myLast; \
aCounter = myLength - anI; \
}else if (anI > myICur) \
aDir = Standard_True; \
} \
if (aDir) \
while (aCounter--) aCurrent = aCurrent -> myNext; \
else \
while (aCounter--) aCurrent = aCurrent -> myPrev; \
(Standard_Integer&) myICur = anI; \
(Node *&) myCurrent = aCurrent; \
return aCurrent; \
} \
\
ClassName::~ClassName () \
{ \
Clear (); \
} \
\
void ClassName::Append (const Type& aVal) \
{ \
Node * anItem = new Node (aVal, myLast, NULL); \
if (myLength == 0) \
myFirst = anItem; \
else \
myLast -> myNext = anItem; \
myLast = anItem; \
myLength++; \
} \
\
void ClassName::Prepend (const Type& aVal) \
{ \
Node * anItem = new Node (aVal, NULL, myFirst); \
if (myLength == 0) \
myLast = anItem; \
else \
myFirst -> myPrev = anItem; \
myFirst = anItem; \
myLength++; \
if (myICur > 0) myICur++; \
} \
\
void ClassName::InsertAt (const Standard_Integer anI, const Type& aVal) \
{ \
if (anI <= 1) Prepend (aVal); \
else if (anI > myLength) Append (aVal); \
else if (FindItem(anI)) { \
Node * anItem = new Node (aVal, myCurrent -> myPrev, myCurrent); \
myCurrent -> myPrev = anItem; \
if (anItem -> myPrev) anItem -> myPrev -> myNext = anItem; \
myLength++; \
myICur++; \
} \
} \
\
void ClassName::Clear () \
{ \
while (myFirst) { \
Node * aCurr = myFirst -> myNext; \
delete myFirst; \
myFirst = aCurr; \
} \
myFirst = myLast = myCurrent = NULL; \
myLength = 0; \
myICur = 0; \
} \
\
void ClassName::Remove (const Standard_Integer anI) \
{ \
Node * anItem = (Node *) FindItem (anI); \
if (anItem) { \
if (myCurrent -> myPrev) { \
myCurrent -> myPrev -> myNext = myCurrent -> myNext; \
} \
if (myCurrent -> myNext) { \
myCurrent -> myNext -> myPrev = myCurrent -> myPrev; \
myCurrent = myCurrent -> myNext; \
}else{ \
myCurrent = myCurrent -> myPrev; \
myICur--; \
} \
if (myFirst == anItem) myFirst = myFirst -> myNext; \
if (myLast == anItem) myLast = myLast -> myPrev; \
delete anItem; \
myLength--; \
} \
} \
\
void ClassName::Assign (const ClassName& anOther) \
{ \
Clear (); \
if (anOther.Length () == 0) return; \
myFirst = new Node (anOther.First(), NULL, NULL); \
Node * aPrevious = myFirst; \
myLength = 1; \
while (myLength < anOther.Length()) { \
myLength++; \
Node * aCurrent = new Node (anOther.Value(myLength), aPrevious, NULL); \
aPrevious = aPrevious -> myNext = aCurrent; \
} \
myLast = aPrevious; \
} \
#endif
|