|
Dip
0.92.4
|
#include <CoinSearchTree.hpp>

Public Member Functions | |
| CoinSearchTreeManager () | |
| virtual | ~CoinSearchTreeManager () |
| void | setTree (CoinSearchTreeBase *t) |
| CoinSearchTreeBase * | getTree () const |
| bool | empty () const |
| size_t | size () const |
| size_t | numInserted () const |
| CoinTreeNode * | top () const |
| void | pop () |
| void | push (CoinTreeNode *node, const bool incrInserted=true) |
| void | push (const CoinTreeSiblings &s, const bool incrInserted=true) |
| void | push (const int n, CoinTreeNode **nodes, const bool incrInserted=true) |
| CoinTreeNode * | bestQualityCandidate () const |
| double | bestQuality () const |
| void | newSolution (double solValue) |
| void | reevaluateSearchStrategy () |
Private Member Functions | |
| CoinSearchTreeManager (const CoinSearchTreeManager &) | |
| CoinSearchTreeManager & | operator= (const CoinSearchTreeManager &) |
Private Attributes | |
| CoinSearchTreeBase * | candidates_ |
| int | numSolution |
| bool | hasUB_ |
| Whether there is an upper bound or not. More... | |
| bool | recentlyReevaluatedSearchStrategy_ |
| variable used to test whether we need to reevaluate search strategy More... | |
Definition at line 450 of file CoinSearchTree.hpp.
|
private |
|
inline |
Definition at line 466 of file CoinSearchTree.hpp.
|
inlinevirtual |
Definition at line 472 of file CoinSearchTree.hpp.
References candidates_.
|
private |
|
inline |
Definition at line 477 of file CoinSearchTree.hpp.
References candidates_.
|
inline |
Definition at line 482 of file CoinSearchTree.hpp.
References candidates_.
|
inline |
Definition at line 487 of file CoinSearchTree.hpp.
References candidates_, and CoinSearchTreeBase::empty().
|
inline |
Definition at line 488 of file CoinSearchTree.hpp.
References candidates_, and CoinSearchTreeBase::size().
|
inline |
Definition at line 489 of file CoinSearchTree.hpp.
References candidates_, and CoinSearchTreeBase::numInserted().
|
inline |
Definition at line 490 of file CoinSearchTree.hpp.
References candidates_, and CoinSearchTreeBase::top().
|
inline |
Definition at line 491 of file CoinSearchTree.hpp.
References candidates_, and CoinSearchTreeBase::pop().
|
inline |
Definition at line 492 of file CoinSearchTree.hpp.
References candidates_, and CoinSearchTreeBase::push().
|
inline |
Definition at line 496 of file CoinSearchTree.hpp.
References candidates_, and CoinSearchTreeBase::push().
|
inline |
Definition at line 500 of file CoinSearchTree.hpp.
References candidates_, and CoinSearchTreeBase::push().
|
inline |
Definition at line 506 of file CoinSearchTree.hpp.
References candidates_, and CoinSearchTreeBase::top().
|
inline |
Definition at line 510 of file CoinSearchTree.hpp.
References candidates_, CoinTreeNode::getQuality(), and CoinSearchTreeBase::top().
| void CoinSearchTreeManager::newSolution | ( | double | solValue | ) |
| void CoinSearchTreeManager::reevaluateSearchStrategy | ( | ) |
|
private |
Definition at line 456 of file CoinSearchTree.hpp.
Referenced by bestQuality(), bestQualityCandidate(), empty(), getTree(), numInserted(), pop(), push(), setTree(), size(), top(), and ~CoinSearchTreeManager().
|
private |
Definition at line 457 of file CoinSearchTree.hpp.
|
private |
Whether there is an upper bound or not.
The upper bound may have come as input, not necessarily from a solution
Definition at line 460 of file CoinSearchTree.hpp.
|
private |
variable used to test whether we need to reevaluate search strategy
Definition at line 463 of file CoinSearchTree.hpp.
1.8.5