blogspot.software_and_algorithms.stern_library.data_structure

Class DynamicIntervalTree<U extends Comparable<U>,T extends Interval<U>>

java.lang.Object

blogspot.software_and_algorithms.stern_library.data_structure.DynamicIntervalTree<U,T>

public class DynamicIntervalTree<U extends Comparable<U>,T extends Interval<U>>
extends Object

A dynamic interval tree is a balanced binary search tree which stores intervals so that both point queries (queries that return intervals from the set which contain a query point) and overlapping interval queries (queries that return intervals from the set which overlap a query interval) can be completed in time O(k*log(n)), where n is the number of intervals stored in the tree and k is the size of the result set from the query.

Insertion and deletion of intervals to and from this tree completes in time O(log(n)) where n is the number of intervals stored in the tree.

This tree consumes linear space in the number of intervals stored in the tree.

Note that this implementation supports all three closed, open and half-open intervals.

Author:

Kevin L. Stern

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
protected static class	DynamicIntervalTree.Node<U extends Comparable<U>,T extends Interval<U>> A node for a dynamic interval tree is a red-black tree node augmented to store the maximum high endpoint among intervals stored within the subtree rooted at the node.

Field Summary

Fields

Modifier and Type	Field and Description
RedBlackTree<T>	binarySearchTree

Constructor Summary

Constructors

Constructor and Description
DynamicIntervalTree()

Method Summary

Modifier and Type	Method and Description
void	clear() Clear the contents of the tree.
boolean	delete(T interval) Delete the specified interval from this tree.
protected T	fetchContainingInterval(U queryPoint) Fetch an interval containing the specified point.
Collection<T>	fetchContainingIntervals(U queryPoint) Fetch intervals containing the specified point.
protected T	fetchOverlappingInterval(T queryInterval) Fetch an interval overlapping the specified interval.
Collection<T>	fetchOverlappingIntervals(T queryInterval) Fetch intervals overlapping the specified interval.
int	getSize() Get the number of intervals being stored in the tree.
boolean	insert(T interval) Insert the specified interval into this tree.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

binarySearchTree

public RedBlackTree<T extends Interval<U>> binarySearchTree

Constructor Detail

DynamicIntervalTree

public DynamicIntervalTree()

Method Detail

clear

public void clear()

Clear the contents of the tree.

delete

public boolean delete(T interval)

Delete the specified interval from this tree.

Parameters:

interval - the interval to delete.

Returns:

true if an element was deleted as a result of this call, false otherwise.

fetchContainingInterval

protected T fetchContainingInterval(U queryPoint)

Fetch an interval containing the specified point.

Parameters:

queryPoint - the query point.

Returns:

an interval containing the specified point, null if none.

fetchContainingIntervals

public Collection<T> fetchContainingIntervals(U queryPoint)

Fetch intervals containing the specified point.

Parameters:

queryPoint - the query point.

Returns:

a Collection of all intervals containing the specified point.

fetchOverlappingInterval

protected T fetchOverlappingInterval(T queryInterval)

Fetch an interval overlapping the specified interval.

Parameters:

queryInterval - the query interval.

Returns:

an interval overlapping the specified interval, null if none.

fetchOverlappingIntervals

public Collection<T> fetchOverlappingIntervals(T queryInterval)

Fetch intervals overlapping the specified interval.

Parameters:

queryInterval - the query interval.

Returns:

a Collection of all intervals overlapping the specified point.

getSize

public int getSize()

Get the number of intervals being stored in the tree.

Returns:

the number of intervals being stored in the tree.

insert

public boolean insert(T interval)

Insert the specified interval into this tree.

Parameters:

interval - the interval to insert.

Returns:

true if an element was inserted as a result of this call, false otherwise.