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...
#include <Poly_MakeLoops.hxx>
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.
◆ HeapOfInteger()
| Poly_MakeLoops::HeapOfInteger::HeapOfInteger |
( |
const int | theNbPreAllocated = 1 | ) |
|
|
inline |
◆ Add()
| void Poly_MakeLoops::HeapOfInteger::Add |
( |
const int | theValue | ) |
|
|
inline |
◆ Clear()
| void Poly_MakeLoops::HeapOfInteger::Clear |
( |
| ) |
|
|
inline |
◆ Contains()
| bool Poly_MakeLoops::HeapOfInteger::Contains |
( |
const int | theValue | ) |
const |
|
inline |
◆ IsEmpty()
| bool Poly_MakeLoops::HeapOfInteger::IsEmpty |
( |
| ) |
|
|
inline |
◆ Remove()
| void Poly_MakeLoops::HeapOfInteger::Remove |
( |
const int | theValue | ) |
|
|
inline |
◆ Top()
| int Poly_MakeLoops::HeapOfInteger::Top |
( |
| ) |
|
|
inline |
The documentation for this class was generated from the following file: