#include <CoinSearchTree.hpp>
Definition at line 236 of file CoinSearchTree.hpp.
CoinSearchTreeBase::CoinSearchTreeBase |
( |
| ) |
|
|
inlineprotected |
virtual CoinSearchTreeBase::~CoinSearchTreeBase |
( |
| ) |
|
|
inlinevirtual |
virtual void CoinSearchTreeBase::realpop |
( |
| ) |
|
|
protectedpure virtual |
virtual void CoinSearchTreeBase::fixTop |
( |
| ) |
|
|
protectedpure virtual |
virtual const char* CoinSearchTreeBase::compName |
( |
| ) |
const |
|
pure virtual |
const std::vector< CoinTreeSiblings * >& CoinSearchTreeBase::getCandidates |
( |
| ) |
const |
|
inline |
bool CoinSearchTreeBase::empty |
( |
| ) |
const |
|
inline |
int CoinSearchTreeBase::size |
( |
| ) |
const |
|
inline |
int CoinSearchTreeBase::numInserted |
( |
| ) |
const |
|
inline |
void CoinSearchTreeBase::pop |
( |
| ) |
|
|
inline |
pop will advance the next
pointer among the siblings on the top and then moves the top to its correct position.
realpop is the method that actually removes the element from the heap
Definition at line 284 of file CoinSearchTree.hpp.
void CoinSearchTreeBase::push |
( |
int |
numNodes, |
|
|
CoinTreeNode ** |
nodes, |
|
|
const bool |
incrInserted = true |
|
) |
| |
|
inline |
void CoinSearchTreeBase::push |
( |
const CoinTreeSiblings & |
sib, |
|
|
const bool |
incrInserted = true |
|
) |
| |
|
inline |
int CoinSearchTreeBase::numInserted_ |
|
protected |
int CoinSearchTreeBase::size_ |
|
protected |
The documentation for this class was generated from the following file: