Modifier and Type	Class and Description
private class	IntervalTree.TimeInterval
private static class	IntervalTree.TreeEntry<V> Internal Entry class.

Modifier and Type	Field and Description
private static final boolean	BLACK
private final Set<String>	entryIDs
private static final boolean	RED
private IntervalTree.TreeEntry<E>	root
private int	treeSize

Access	Constructor and Description
pack-priv	IntervalTree()

Method Summary

Modifier and Type	Method and Description
public final boolean	add(E entry)
private IntervalTree.TreeEntry<E>	addEntry(E entry)
private boolean	checkPHigh(IntervalTree.TreeEntry<E> n, long pHigh)
private boolean	checkPLow(IntervalTree.TreeEntry<E> n, long pLow)
public final void	clear()
private static <V> boolean	colorOf(IntervalTree.TreeEntry<V> p) Balancing operations.
private static int	compareLongs(long val1, long val2)
public final boolean	Returns: true if the entry is a member of this tree contains(E the entry to check entry) Method to determine if the interval tree contains the given entry.
private void	deleteEntry(IntervalTree.TreeEntry<E> p) Delete node p, and then rebalance the tree.
private void	fixAfterDeletion(IntervalTree.TreeEntry<E> x)
private void	fixAfterInsertion(IntervalTree.TreeEntry<E> x)
private void	fixUpMaxHigh(IntervalTree.TreeEntry<E> entry)
public final Instant	getEarliestTimeUsed()
private long	getEarliestTimeUsed(IntervalTree.TreeEntry<E> entry)
private IntervalTree.TreeEntry<E>	Returns: appropriate entry, or null if not found getEntry(Entry<?> the calendar entry entry) Method to find entry by period.
private long	getHigh(IntervalTree<E>.TimeInterval interval)
private long	getHigh(Entry<?> entry)
public final Collection<E>	getIntersectingObjects(Instant start, Instant end)
public final Instant	getLatestTimeUsed()
private long	getLatestTimeUsed(IntervalTree.TreeEntry<E> entry)
private long	getLow(IntervalTree<E>.TimeInterval obj)
private long	getLow(Entry<?> entry)
private static <V> IntervalTree.TreeEntry<V>	leftOf(IntervalTree.TreeEntry<V> p)
private static <V> IntervalTree.TreeEntry<V>	parentOf(IntervalTree.TreeEntry<V> p)
public final boolean	Returns: true if the entry was a member of this tree remove(E the entry to remove entry) Method to remove period/key object from tree.
public final Collection<E>	removePeriod(Instant start, Instant end)
private static <V> IntervalTree.TreeEntry<V>	rightOf(IntervalTree.TreeEntry<V> p)
private void	rotateLeft(IntervalTree.TreeEntry<E> p)
private void	rotateRight(IntervalTree.TreeEntry<E> p)
private void	searchIntersecting(IntervalTree.TreeEntry<E> entry, IntervalTree<E>.TimeInterval timeInterval, Collection<E> result)
private static <V> void	setColor(IntervalTree.TreeEntry<V> p, boolean c)
public final long	size()
private static < the value type V> IntervalTree.TreeEntry<V>	successor(IntervalTree.TreeEntry<V> t) Returns the successor of the specified Entry, or null if no such.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

BLACK	back to summary
private static final boolean BLACK

entryIDs	back to summary
private final Set<String> entryIDs

RED	back to summary
private static final boolean RED

root	back to summary
private IntervalTree.TreeEntry<E> root

treeSize	back to summary
private int treeSize

Constructor Detail

IntervalTree	back to summary
pack-priv IntervalTree()

Method Detail

add	back to summary
public final boolean add(E entry)

addEntry	back to summary
private IntervalTree.TreeEntry<E> addEntry(E entry)

checkPHigh	back to summary
private boolean checkPHigh(IntervalTree.TreeEntry<E> n, long pHigh)

checkPLow	back to summary
private boolean checkPLow(IntervalTree.TreeEntry<E> n, long pLow)

clear	back to summary
public final void clear()

colorOf	back to summary
private static <V> boolean colorOf(IntervalTree.TreeEntry<V> p) Balancing operations. Implementations of rebalancings during insertion and deletion are slightly different than the CLR version. Rather than using dummy nilnodes, we use a set of accessors that deal properly with null. They are used to avoid messiness surrounding nullness checks in the main algorithms.

compareLongs	back to summary
private static int compareLongs(long val1, long val2)

contains	back to summary
public final boolean contains(E entry) Method to determine if the interval tree contains the given entry. Parameters entry:E the entry to check Returns:boolean true if the entry is a member of this tree

contains

back to summary

public final boolean contains(E entry)

Method to determine if the interval tree contains the given entry.

Parameters

entry:E: the entry to check

Returns:boolean

true if the entry is a member of this tree

deleteEntry	back to summary
private void deleteEntry(IntervalTree.TreeEntry<E> p) Delete node p, and then rebalance the tree.

fixAfterDeletion	back to summary
private void fixAfterDeletion(IntervalTree.TreeEntry<E> x)

fixAfterInsertion	back to summary
private void fixAfterInsertion(IntervalTree.TreeEntry<E> x)

fixUpMaxHigh	back to summary
private void fixUpMaxHigh(IntervalTree.TreeEntry<E> entry)

getEarliestTimeUsed	back to summary
public final Instant getEarliestTimeUsed()

getEarliestTimeUsed	back to summary
private long getEarliestTimeUsed(IntervalTree.TreeEntry<E> entry)

getEntry	back to summary
private IntervalTree.TreeEntry<E> getEntry(Entry<?> entry) Method to find entry by period. Period start, period end and object key are used to identify each entry. Parameters entry:Entry<?> the calendar entry Returns:IntervalTree.TreeEntry<E> appropriate entry, or null if not found

getEntry

back to summary

private IntervalTree.TreeEntry<E> getEntry(Entry<?> entry)

Method to find entry by period. Period start, period end and object key are used to identify each entry.

Parameters

entry:Entry<?>: the calendar entry

Returns:IntervalTree.TreeEntry<E>

appropriate entry, or null if not found

getHigh	back to summary
private long getHigh(IntervalTree<E>.TimeInterval interval)

getHigh	back to summary
private long getHigh(Entry<?> entry)

getIntersectingObjects	back to summary
public final Collection<E> getIntersectingObjects(Instant start, Instant end)

getLatestTimeUsed	back to summary
public final Instant getLatestTimeUsed()

getLatestTimeUsed	back to summary
private long getLatestTimeUsed(IntervalTree.TreeEntry<E> entry)

getLow	back to summary
private long getLow(IntervalTree<E>.TimeInterval obj)

getLow	back to summary
private long getLow(Entry<?> entry)

leftOf	back to summary
private static <V> IntervalTree.TreeEntry<V> leftOf(IntervalTree.TreeEntry<V> p)

parentOf	back to summary
private static <V> IntervalTree.TreeEntry<V> parentOf(IntervalTree.TreeEntry<V> p)

remove	back to summary
public final boolean remove(E entry) Method to remove period/key object from tree. Entry to delete will be found by period and key values of given parameter p (not by given object reference). Parameters entry:E the entry to remove Returns:boolean true if the entry was a member of this tree

remove

back to summary

public final boolean remove(E entry)

Method to remove period/key object from tree. Entry to delete will be found by period and key values of given parameter p (not by given object reference).

Parameters

entry:E: the entry to remove

Returns:boolean

true if the entry was a member of this tree

removePeriod	back to summary
public final Collection<E> removePeriod(Instant start, Instant end)

rightOf	back to summary
private static <V> IntervalTree.TreeEntry<V> rightOf(IntervalTree.TreeEntry<V> p)

rotateLeft	back to summary
private void rotateLeft(IntervalTree.TreeEntry<E> p)

rotateRight	back to summary
private void rotateRight(IntervalTree.TreeEntry<E> p)

searchIntersecting	back to summary
private void searchIntersecting(IntervalTree.TreeEntry<E> entry, IntervalTree<E>.TimeInterval timeInterval, Collection<E> result)

setColor	back to summary
private static <V> void setColor(IntervalTree.TreeEntry<V> p, boolean c)

size	back to summary
public final long size()

successor	back to summary
private static <V> IntervalTree.TreeEntry<V> successor(IntervalTree.TreeEntry<V> t) Returns the successor of the specified Entry, or null if no such. Parameters <V> the value type

successor

back to summary

private static <V> IntervalTree.TreeEntry<V> successor(IntervalTree.TreeEntry<V> t)

Returns the successor of the specified Entry, or null if no such.

Parameters

<V>: the value type

com.calendarfx.model back to summary

private Class IntervalTree.TimeInterval

Class Inheritance

extends Object

java.lang.Object
com.calendarfx.model.IntervalTree.TimeInterval

Field Summary

Modifier and Type	Field and Description
private final Instant	endTime
private final Instant	startTime

Constructor Summary

Access	Constructor and Description
public	TimeInterval(Instant startTime, Instant endTime)

Method Summary

Modifier and Type	Method and Description
public Instant	getEndTime()
public Instant	getStartTime()

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

endTime	back to summary
private final Instant endTime

startTime	back to summary
private final Instant startTime

Constructor Detail

TimeInterval	back to summary
public TimeInterval(Instant startTime, Instant endTime)

Method Detail

getEndTime	back to summary
public Instant getEndTime()

getStartTime	back to summary
public Instant getStartTime()

com.calendarfx.model back to summary

private final Class IntervalTree.TreeEntry<V>

Class Inheritance

extends Object

java.lang.Object
com.calendarfx.model.IntervalTree.TreeEntry

Internal Entry class.

Author: koop

Field Summary

Modifier and Type	Field and Description
private boolean	color
private long	high
private IntervalTree.TreeEntry<V>	left
private long	low
private long	maxHigh
private IntervalTree.TreeEntry<V>	parent
private IntervalTree.TreeEntry<V>	right
private V	value

Constructor Summary

Access	Constructor and Description
pack-priv	TreeEntry(long low, long high, V value, IntervalTree.TreeEntry<V> parent) Make a new cell with given key, value, and parent, and with `null` child links, and BLACK color.

Method Summary

Modifier and Type	Method and Description
public IntervalTree.TreeEntry<V>	getLeft()
public IntervalTree.TreeEntry<V>	getRight()
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll wait wait wait

Field Detail

color	back to summary
private boolean color

high	back to summary
private long high

left	back to summary
private IntervalTree.TreeEntry<V> left

low	back to summary
private long low

maxHigh	back to summary
private long maxHigh

parent	back to summary
private IntervalTree.TreeEntry<V> parent

right	back to summary
private IntervalTree.TreeEntry<V> right

value	back to summary
private V value

Constructor Detail

TreeEntry	back to summary
pack-priv TreeEntry(long low, long high, V value, IntervalTree.TreeEntry<V> parent) Make a new cell with given key, value, and parent, and with `null` child links, and BLACK color.

Method Detail

getLeft	back to summary
public IntervalTree.TreeEntry<V> getLeft()

getRight	back to summary
public IntervalTree.TreeEntry<V> getRight()

toString back to summary

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

Returns:String

a string representation of the object

Annotations

@Override

pack-priv Class IntervalTree<E extends Entry<?>>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class IntervalTree.TimeInterval

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private final Class IntervalTree.TreeEntry<V>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail