Red-black tree
 All Classes Functions
Classes | Public Member Functions | List of all members
org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V > Class Reference
Inheritance diagram for org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V >:

Classes

class  IntervalTreeNode
 

Public Member Functions

 IntervalTreeMultiSet (boolean leftExclusive, boolean rightExclusive)
 
IntervalTreeNode add (Pair< K, K > interval, V value)
 
void remove (IntervalTreeNode intervalTreeNode)
 
IntervalTreeNode search (Pair< K, K > interval)
 
IntervalTreeNode search (K point)
 
List< IntervalTreeNode > searchAll (Pair< K, K > interval)
 
List< IntervalTreeNode > searchAll (K point)
 
Iterator< IntervalTreeNode > iterator ()
 

Detailed Description

An implementation of an interval tree multi-set.

Author
Karol Sobczak

Definition at line 13 of file IntervalTreeMultiSet.java.

Constructor & Destructor Documentation

org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V >.IntervalTreeMultiSet ( boolean  leftExclusive,
boolean  rightExclusive 
)

Constructs an IntervalTreeMultiSet instance.

Parameters
leftExclusivea flag determining if intervals are left exclusive
rightExclusivea flag determining if intervals are right exclusive

Definition at line 227 of file IntervalTreeMultiSet.java.

Member Function Documentation

IntervalTreeNode org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V >.add ( Pair< K, K >  interval,
value 
)

Adds an interval to the interval tree multi-set.

Parameters
intervalan interval
valuean interval tree node value
Returns
an interval tree node instance (can be used to remove the interval later)

Definition at line 239 of file IntervalTreeMultiSet.java.

Iterator<IntervalTreeNode> org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V >.iterator ( )

Returns an iterator for interval tree nodes.

Returns
an iterator for interval tree nodes

Definition at line 328 of file IntervalTreeMultiSet.java.

void org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V >.remove ( IntervalTreeNode  intervalTreeNode)

Removes an interval tree node from the interval tree.

Parameters
intervalTreeNodean interval tree node instance to be removed

Definition at line 249 of file IntervalTreeMultiSet.java.

IntervalTreeNode org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V >.search ( Pair< K, K >  interval)

Searches for an interval tree node intersecting with a given interval or null if there is no such node.

Parameters
intervalan interval
Returns
an interval tree node that intersects with a given interval or null if there is no such node

Definition at line 260 of file IntervalTreeMultiSet.java.

IntervalTreeNode org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V >.search ( point)

Searches for an interval tree node intersecting with a given point or null if there is no such node.

Parameters
pointa point
Returns
an interval tree node that intersects with a given point or null if there is no such node

Definition at line 280 of file IntervalTreeMultiSet.java.

List<IntervalTreeNode> org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V >.searchAll ( Pair< K, K >  interval)

Searches for all interval tree nodes intersecting with a given interval.

Parameters
intervalan interval
Returns
a left ordered list of interval tree nodes intersecting with a given interval

Definition at line 299 of file IntervalTreeMultiSet.java.

List<IntervalTreeNode> org.adblocktv.tagsserver.utils.rbtree.IntervalTreeMultiSet< K extends Comparable, V >.searchAll ( point)

Searches for all interval tree nodes intersecting with a given point.

Parameters
pointa point
Returns
a left ordered list of interval tree nodes intersecting with a given point

Definition at line 314 of file IntervalTreeMultiSet.java.


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