|
Open CASCADE Technology
7.8.0.dev
|
#include <NCollection_CellFilter.hxx>
Public Member Functions | |
| Cell (const Point &thePnt, const NCollection_Array1< Standard_Real > &theCellSize) | |
| Constructor; computes cell indices. More... | |
| Cell (const Cell &theOther) | |
| Copy constructor: ensure that list is not deleted twice. More... | |
| void | operator= (const Cell &theOther) |
| Assignment operator: ensure that list is not deleted twice. More... | |
| ~Cell () | |
| Destructor; calls destructors for targets contained in the list. More... | |
| Standard_Boolean | IsEqual (const Cell &theOther) const |
| Compare cell with other one. More... | |
| Standard_Integer | HashCode (const Standard_Integer theUpperBound) const |
| Returns hash code for this cell, in the range [1, theUpperBound]. More... | |
Data Fields | |
| NCollection_LocalArray< Cell_IndexType, 10 > | index |
| ListNode * | Objects |
Auxiliary structure representing a cell in the space. Cells are stored in the map, each cell contains list of objects that belong to that cell.
|
inline |
Constructor; computes cell indices.
|
inline |
Copy constructor: ensure that list is not deleted twice.
|
inline |
Destructor; calls destructors for targets contained in the list.
|
inline |
Returns hash code for this cell, in the range [1, theUpperBound].
| theUpperBound | the upper bound of the range a computing hash code must be within |
|
inline |
Compare cell with other one.
|
inline |
Assignment operator: ensure that list is not deleted twice.
| NCollection_LocalArray<Cell_IndexType, 10> NCollection_CellFilter< Inspector >::Cell::index |
| ListNode* NCollection_CellFilter< Inspector >::Cell::Objects |
1.8.13