inet::IntervalTreeNode Class Reference

The node for interval tree. More...

#include <IntervalTree.h>

Public Member Functions
void	print (IntervalTreeNode *left, IntervalTreeNode *right) const
	Print the interval node information: set left = nil and right = root. More...
	IntervalTreeNode ()
	Create an empty node. More...
	IntervalTreeNode (const Interval *new_interval)
	Create an node storing the interval. More...
	~IntervalTreeNode ()

Protected Attributes
const Interval *	stored_interval = nullptr
	interval stored in the node More...
simtime_t	key
simtime_t	high
simtime_t	max_high
bool	red = false
	red or black node: if red = false then the node is black More...
IntervalTreeNode *	left = nullptr
IntervalTreeNode *	right = nullptr
IntervalTreeNode *	parent = nullptr

Friends
class	IntervalTree
class	IntervalTreeTest

Detailed Description

The node for interval tree.

Constructor & Destructor Documentation

inet::IntervalTreeNode::IntervalTreeNode

(

)

Create an empty node.

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

{
}

inet::IntervalTreeNode::IntervalTreeNode

(

const Interval *

new_interval

)

Create an node storing the interval.

                                                               :
    stored_interval(new_interval), key(new_interval->low), high(new_interval->high), max_high(high)
{
}

inet::IntervalTreeNode::~IntervalTreeNode

(

)

{
    delete stored_interval;
}

Member Function Documentation

void inet::IntervalTreeNode::print	(	IntervalTreeNode *	left,
		IntervalTreeNode *	right
	)		const

Print the interval node information: set left = nil and right = root.

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

{
    stored_interval->print();
    std::cout << ", k = " << key << ", h = " << high << ", mH = " << max_high;
    std::cout << "  l->key = ";
    if (left == nil)
        std::cout << "nullptr";
    else
        std::cout << left->key;
    std::cout << "  r->key = ";
    if (right == nil)
        std::cout << "nullptr";
    else
        std::cout << right->key;
    std::cout << "  p->key = ";
    if (parent == root)
        std::cout << "nullptr";
    else
        std::cout << parent->key;
    std::cout << "  red = " << (int) red << std::endl;
}

Friends And Related Function Documentation

friend class IntervalTree

friend

friend class IntervalTreeTest

friend

Member Data Documentation

simtime_t inet::IntervalTreeNode::high

protected

Referenced by inet::IntervalTree::fixupMaxHigh(), inet::IntervalTree::leftRotate(), print(), inet::IntervalTree::query(), and inet::IntervalTree::rightRotate().

simtime_t inet::IntervalTreeNode::key

protected

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

IntervalTreeNode* inet::IntervalTreeNode::left = nullptr

protected

Referenced by inet::IntervalTree::deleteFixup(), inet::IntervalTree::deleteNode(), inet::IntervalTree::fixupMaxHigh(), inet::IntervalTree::getMinimum(), inet::IntervalTree::getPredecessor(), inet::IntervalTree::insert(), inet::IntervalTree::leftRotate(), print(), inet::IntervalTree::query(), inet::IntervalTree::recursiveInsert(), inet::IntervalTree::recursivePrint(), inet::IntervalTree::recursiveSearch(), inet::IntervalTree::rightRotate(), and inet::IntervalTree::~IntervalTree().

simtime_t inet::IntervalTreeNode::max_high

protected

Referenced by inet::IntervalTree::deleteNode(), inet::IntervalTree::fixupMaxHigh(), inet::IntervalTree::leftRotate(), print(), inet::IntervalTree::query(), and inet::IntervalTree::rightRotate().

IntervalTreeNode* inet::IntervalTreeNode::parent = nullptr

protected

Referenced by inet::IntervalTree::deleteFixup(), inet::IntervalTree::deleteNode(), inet::IntervalTree::fixupMaxHigh(), inet::IntervalTree::getPredecessor(), inet::IntervalTree::getSuccessor(), inet::IntervalTree::insert(), inet::IntervalTree::leftRotate(), print(), inet::IntervalTree::recursiveInsert(), and inet::IntervalTree::rightRotate().

bool inet::IntervalTreeNode::red = false

protected

red or black node: if red = false then the node is black

Referenced by inet::IntervalTree::deleteFixup(), inet::IntervalTree::deleteNode(), inet::IntervalTree::insert(), and print().

IntervalTreeNode* inet::IntervalTreeNode::right = nullptr

protected

Referenced by inet::IntervalTree::deleteFixup(), inet::IntervalTree::deleteNode(), inet::IntervalTree::fixupMaxHigh(), inet::IntervalTree::getMaximum(), inet::IntervalTree::getSuccessor(), inet::IntervalTree::insert(), inet::IntervalTree::leftRotate(), print(), inet::IntervalTree::query(), inet::IntervalTree::recursiveInsert(), inet::IntervalTree::recursivePrint(), inet::IntervalTree::recursiveSearch(), inet::IntervalTree::rightRotate(), and inet::IntervalTree::~IntervalTree().

const Interval* inet::IntervalTreeNode::stored_interval = nullptr

protected

interval stored in the node

Referenced by inet::IntervalTree::deleteNode(), print(), inet::IntervalTree::query(), inet::IntervalTree::recursiveSearch(), and ~IntervalTreeNode().

---

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

• IntervalTree.h
• IntervalTree.cc