Definition at line 1659 of file diffn_util.cc.
|
| | SweepLineIntervalTree (int max_y, int num_boxes) |
| void | RecomputeConnectedComponents (TreeNodeIndex idx) |
| void | RemoveNodeIfXMaxLowerOrEqual (TreeNodeIndex idx, int x_threshold) |
| void | UpdateChildrenIntersecting (TreeNodeIndex idx, int sweep_line_x_pos, int component_index, std::vector< int > *new_connections) |
| bool | UpdateParents (TreeNodeIndex node, int sweep_line_x_pos, int component_index, std::vector< int > *new_connections) |
| void | AddInterval (TreeNodeIndex idx, int sweep_line_x_pos, int box_index, int x_max, std::vector< int > *new_connections) |
◆ SweepLineIntervalTree()
| operations_research::sat::SweepLineIntervalTree::SweepLineIntervalTree |
( |
int | max_y, |
|
|
int | num_boxes ) |
|
inlineexplicit |
◆ AddInterval()
| void operations_research::sat::SweepLineIntervalTree::AddInterval |
( |
TreeNodeIndex | idx, |
|
|
int | sweep_line_x_pos, |
|
|
int | box_index, |
|
|
int | x_max, |
|
|
std::vector< int > * | new_connections ) |
|
inline |
◆ RecomputeConnectedComponents()
| void operations_research::sat::SweepLineIntervalTree::RecomputeConnectedComponents |
( |
TreeNodeIndex | idx | ) |
|
|
inline |
◆ RemoveNodeIfXMaxLowerOrEqual()
| void operations_research::sat::SweepLineIntervalTree::RemoveNodeIfXMaxLowerOrEqual |
( |
TreeNodeIndex | idx, |
|
|
int | x_threshold ) |
|
inline |
◆ UpdateChildrenIntersecting()
| void operations_research::sat::SweepLineIntervalTree::UpdateChildrenIntersecting |
( |
TreeNodeIndex | idx, |
|
|
int | sweep_line_x_pos, |
|
|
int | component_index, |
|
|
std::vector< int > * | new_connections ) |
|
inline |
◆ UpdateParents()
| bool operations_research::sat::SweepLineIntervalTree::UpdateParents |
( |
TreeNodeIndex | node, |
|
|
int | sweep_line_x_pos, |
|
|
int | component_index, |
|
|
std::vector< int > * | new_connections ) |
|
inline |
◆ tree
◆ tree_nodes
◆ union_find
The documentation for this struct was generated from the following file: