38#ifndef COAL_BROADPHASE_DETAIL_INTERVALTREENODE_H 39#define COAL_BROADPHASE_DETAIL_INTERVALTREENODE_H CoalScalar max_high
Definition interval_tree_node.h:75
CoalScalar key
Definition interval_tree_node.h:71
IntervalTreeNode * right
Definition interval_tree_node.h:82
IntervalTreeNode()
Create an empty node.
Definition interval_tree_node-inl.h:50
friend class IntervalTree
Definition interval_tree_node.h:53
bool red
red or black node: if red = false then the node is black
Definition interval_tree_node.h:78
IntervalTreeNode * parent
Definition interval_tree_node.h:84
void print(IntervalTreeNode *left, IntervalTreeNode *right) const
Print the interval node information: set left = invalid_node and right = root.
Definition interval_tree_node-inl.h:69
CoalScalar high
Definition interval_tree_node.h:73
SimpleInterval * stored_interval
interval stored in the node
Definition interval_tree_node.h:69
IntervalTreeNode * left
Definition interval_tree_node.h:80
Interval tree.
Definition interval_tree.h:63
Definition broadphase_dynamic_AABB_tree-inl.h:53
Main namespace.
Definition broadphase_bruteforce.h:44
double CoalScalar
Definition data_types.h:76
Interval trees implemented using red-black-trees as described in the book Introduction_To_Algorithms_...
Definition simple_interval.h:49