Open CASCADE Technology  6.5.4
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines
Data Structures | Functions
Poly_MakeLoops.hxx File Reference
#include <NCollection_Sequence.hxx>
#include <NCollection_IndexedMap.hxx>
#include <TColStd_PackedMapOfInteger.hxx>
#include <TColStd_MapIteratorOfPackedMapOfInteger.hxx>
#include <NCollection_BaseAllocator.hxx>
#include <NCollection_List.hxx>

Data Structures

class  Poly_MakeLoops
struct  Poly_MakeLoops::Link
 The Link structure. More...
class  Poly_MakeLoops::Helper
 The abstract helper class. More...
class  Poly_MakeLoops::HeapOfInteger
 This class implements a heap of integers. The most effective usage of it is first to add there all items, and then get top item and remove any items till it becomes empty. More...
class  Poly_MakeLoops3D
class  Poly_MakeLoops3D::Helper
 The abstract helper class. More...
class  Poly_MakeLoops2D
class  Poly_MakeLoops2D::Helper
 The abstract helper class. More...

Functions

Standard_Integer HashCode (const Poly_MakeLoops::Link &theKey, int theLimit)
Standard_Boolean IsEqual (const Poly_MakeLoops::Link &theKey1, const Poly_MakeLoops::Link &theKey2)

Function Documentation

Standard_Integer HashCode ( const Poly_MakeLoops::Link theKey,
int  theLimit 
) [inline]

HashCode method is needed for maps

IsEqual method is needed for maps