Class describes the information needed when we take the right branch in searching for intervals but possibly come back and check the left branch as well. More...

#include <IntervalTree.h>

Public Attributes
Node *	start_node = nullptr

unsigned int	parent_index = 0

bool	try_right_branch = false

Detailed Description

Class describes the information needed when we take the right branch in searching for intervals but possibly come back and check the left branch as well.

Member Data Documentation

◆ parent_index

unsigned int inet::IntervalTree::it_recursion_node::parent_index = 0

Referenced by inet::IntervalTree::query().

◆ start_node

Node* inet::IntervalTree::it_recursion_node::start_node = nullptr

Referenced by inet::IntervalTree::IntervalTree(), and inet::IntervalTree::query().

◆ try_right_branch

bool inet::IntervalTree::it_recursion_node::try_right_branch = false