#include <NCollection_Sequence.hxx>
#include <NCollection_IndexedMap.hxx>
#include <TColStd_MapIteratorOfPackedMapOfInteger.hxx>
#include <NCollection_IncAllocator.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 &theLink, const Standard_Integer theUpperBound)
	Computes a hash code for the given link, in the range [1, theUpperBound]. More...

Standard_Boolean	IsEqual (const Poly_MakeLoops::Link &theKey1, const Poly_MakeLoops::Link &theKey2)

Function Documentation

◆ HashCode()

Standard_Integer HashCode	(	const Poly_MakeLoops::Link &	theLink,
		const Standard_Integer	theUpperBound
	)

inline

Computes a hash code for the given link, in the range [1, theUpperBound].

Parameters

theLink	the link which hash code is to be computed
theUpperBound	the upper bound of the range a computing hash code must be within

Returns: a computed hash code, in the range [1, theUpperBound]

◆ IsEqual()

Standard_Boolean IsEqual	(	const Poly_MakeLoops::Link &	theKey1,
		const Poly_MakeLoops::Link &	theKey2
	)

inline

IsEqual method is needed for maps

Data Structures

Functions

Function Documentation

◆ HashCode()

◆ IsEqual()