Bcp 1.4.4
Loading...
Searching...
No Matches
List of all members
BCP_tree Class Reference

NO OLD DOC. More...

#include <BCP_tm_node.hpp>

Public Member Functions

Constructor and destructor
 BCP_tree ()
 
 ~BCP_tree ()
 
Query methods
BCP_vec< BCP_tm_node * >::iterator begin ()
 
BCP_vec< BCP_tm_node * >::iterator end ()
 
BCP_tm_noderoot ()
 
BCP_tm_nodeoperator[] (int index)
 
size_t size () const
 
int maxdepth () const
 
int processed () const
 
void increase_processed ()
 
Modifying methods
double true_lower_bound (const BCP_tm_node *node) const
 Return the worst true lower bound in the search tree.
 
void enumerate_leaves (BCP_tm_node *node, const double obj_limit)
 
void insert (BCP_tm_node *node)
 
void remove (int index)
 

Detailed Description

NO OLD DOC.

Definition at line 178 of file BCP_tm_node.hpp.

Constructor & Destructor Documentation

◆ BCP_tree()

BCP_tree::BCP_tree ( )
inline

Definition at line 190 of file BCP_tm_node.hpp.

◆ ~BCP_tree()

BCP_tree::~BCP_tree ( )
inline

Definition at line 192 of file BCP_tm_node.hpp.

Member Function Documentation

◆ begin()

BCP_vec< BCP_tm_node * >::iterator BCP_tree::begin ( )
inline

Definition at line 202 of file BCP_tm_node.hpp.

◆ end()

BCP_vec< BCP_tm_node * >::iterator BCP_tree::end ( )
inline

Definition at line 204 of file BCP_tm_node.hpp.

◆ root()

BCP_tm_node * BCP_tree::root ( )
inline

Definition at line 207 of file BCP_tm_node.hpp.

◆ operator[]()

BCP_tm_node * BCP_tree::operator[] ( int index)
inline

Definition at line 209 of file BCP_tm_node.hpp.

◆ size()

size_t BCP_tree::size ( ) const
inline

Definition at line 211 of file BCP_tm_node.hpp.

◆ maxdepth()

int BCP_tree::maxdepth ( ) const
inline

Definition at line 213 of file BCP_tm_node.hpp.

◆ processed()

int BCP_tree::processed ( ) const
inline

Definition at line 215 of file BCP_tm_node.hpp.

◆ increase_processed()

void BCP_tree::increase_processed ( )
inline

Definition at line 216 of file BCP_tm_node.hpp.

◆ true_lower_bound()

double BCP_tree::true_lower_bound ( const BCP_tm_node * node) const

Return the worst true lower bound in the search tree.

◆ enumerate_leaves()

void BCP_tree::enumerate_leaves ( BCP_tm_node * node,
const double obj_limit )

◆ insert()

void BCP_tree::insert ( BCP_tm_node * node)
inline

Definition at line 226 of file BCP_tm_node.hpp.

◆ remove()

void BCP_tree::remove ( int index)
inline

Definition at line 232 of file BCP_tm_node.hpp.


The documentation for this class was generated from the following file: