Definition at line 51 of file fixed_shape_binary_tree.h.
#include <fixed_shape_binary_tree.h>
◆ FixedShapeBinaryTree()
| operations_research::FixedShapeBinaryTree::FixedShapeBinaryTree |
( |
LeafIndex | num_leaves | ) |
|
|
inlineexplicit |
◆ Depth()
| int operations_research::FixedShapeBinaryTree::Depth |
( |
TreeNodeIndex | node | ) |
const |
|
inline |
◆ FirstLeafNode()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::FirstLeafNode |
( |
| ) |
const |
|
inline |
◆ GetInterval()
| std::pair< LeafIndex, LeafIndex > operations_research::FixedShapeBinaryTree::GetInterval |
( |
TreeNodeIndex | node | ) |
const |
|
inline |
◆ GetLeaf()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::GetLeaf |
( |
LeafIndex | value | ) |
const |
|
inline |
◆ GetNodeEndOfRange()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::GetNodeEndOfRange |
( |
LeafIndex | first_leaf, |
|
|
LeafIndex | last_leaf ) const |
|
inline |
◆ GetNodeStartOfRange()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::GetNodeStartOfRange |
( |
LeafIndex | first_leaf, |
|
|
LeafIndex | last_leaf ) const |
|
inline |
◆ HighestIntermediateNodeIndex()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::HighestIntermediateNodeIndex |
( |
| ) |
const |
|
inline |
◆ HighestNodeIndex()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::HighestNodeIndex |
( |
| ) |
const |
|
inline |
◆ IsLeaf()
| bool operations_research::FixedShapeBinaryTree::IsLeaf |
( |
TreeNodeIndex | node | ) |
const |
|
inline |
◆ LastLeafNode()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::LastLeafNode |
( |
| ) |
const |
|
inline |
◆ LeafValue()
| LeafIndex operations_research::FixedShapeBinaryTree::LeafValue |
( |
TreeNodeIndex | node | ) |
const |
|
inline |
◆ LeftChild()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::LeftChild |
( |
TreeNodeIndex | node | ) |
const |
|
inline |
◆ Parent()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::Parent |
( |
TreeNodeIndex | node | ) |
const |
|
inline |
◆ PartitionIntervalIntoNodes()
template<typename TypeWithPushBack>
| void operations_research::FixedShapeBinaryTree::PartitionIntervalIntoNodes |
( |
LeafIndex | first_leaf, |
|
|
LeafIndex | last_leaf, |
|
|
TypeWithPushBack * | result ) const |
|
inline |
◆ RightChild()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::RightChild |
( |
TreeNodeIndex | node | ) |
const |
|
inline |
◆ Root()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::Root |
( |
| ) |
const |
|
inline |
◆ Sibling()
| TreeNodeIndex operations_research::FixedShapeBinaryTree::Sibling |
( |
TreeNodeIndex | node | ) |
const |
|
inline |
◆ StorageSize()
| int operations_research::FixedShapeBinaryTree::StorageSize |
( |
| ) |
const |
|
inline |
The documentation for this class was generated from the following file: