Open CASCADE Technology
6.5.4
|
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.
#include <Poly_MakeLoops.hxx>
Public Member Functions | |
HeapOfInteger (const Standard_Integer theNbPreAllocated=1) | |
void | Clear () |
void | Add (const Standard_Integer theValue) |
Standard_Integer | Top () |
Standard_Boolean | Contains (const Standard_Integer theValue) const |
void | Remove (const Standard_Integer theValue) |
Standard_Boolean | IsEmpty () |
Poly_MakeLoops::HeapOfInteger::HeapOfInteger | ( | const Standard_Integer | theNbPreAllocated = 1 | ) | [inline] |
void Poly_MakeLoops::HeapOfInteger::Add | ( | const Standard_Integer | theValue | ) | [inline] |
void Poly_MakeLoops::HeapOfInteger::Clear | ( | void | ) | [inline] |
Standard_Boolean Poly_MakeLoops::HeapOfInteger::Contains | ( | const Standard_Integer | theValue | ) | const [inline] |
Standard_Boolean Poly_MakeLoops::HeapOfInteger::IsEmpty | ( | void | ) | [inline] |
void Poly_MakeLoops::HeapOfInteger::Remove | ( | const Standard_Integer | theValue | ) | [inline] |
Standard_Integer Poly_MakeLoops::HeapOfInteger::Top | ( | ) | [inline] |