Class AATreeSet<T extends Comparable<? super T>>

java.lang.Object

java.util.AbstractCollection<T>

java.util.AbstractSet<T>

org.terracotta.offheapstore.util.AATreeSet<T>

All Implemented Interfaces:

Iterable<T>, Collection<T>, SequencedCollection<T>, SequencedSet<T>, Set<T>, SortedSet<T>

Direct Known Subclasses:

AATreeFileAllocator, PowerOfTwoAllocator

public class AATreeSet<T extends Comparable<? super T>>
extends AbstractSet<T>
implements SortedSet<T>

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	AATreeSet.AbstractTreeNode<E extends Comparable<? super E>>
static interface	AATreeSet.Node<E extends Comparable<? super E>>
(package private) class	AATreeSet.SubSet
(package private) class	AATreeSet.SubTreeIterator
private static final class	AATreeSet.TerminalNode
(package private) class	AATreeSet.TreeIterator
private static final class	AATreeSet.TreeNode<E extends Comparable<? super E>>

Field Summary

Fields

Modifier and Type	Field	Description
private AATreeSet.Node<T>	heir
private AATreeSet.Node<T>	item
private boolean	mutated
private T	removed
private AATreeSet.Node<T>	root
private int	size

Constructor Summary

Constructors

Constructor	Description
AATreeSet()

Method Summary

Modifier and Type	Method	Description
boolean	add(T o)
void	clear()
Comparator<? super T>	comparator()
private AATreeSet.Node<T>	createNode(T data)
T	find(Object probe)
private AATreeSet.Node<T>	find(AATreeSet.Node<T> top, T probe)
T	first()
protected final AATreeSet.Node<T>	getRoot()
SortedSet<T>	headSet(T toElement)
private AATreeSet.Node<T>	insert(AATreeSet.Node<T> top, T data)
boolean	isEmpty()
Iterator<T>	iterator()
T	last()
boolean	remove(Object o)
private AATreeSet.Node<T>	remove(AATreeSet.Node<T> top, T data)
T	removeAndReturn(Object o)
int	size()
private static <T extends Comparable<? super T>> AATreeSet.Node<T>	skew(AATreeSet.Node<T> top)
private static <T extends Comparable<? super T>> AATreeSet.Node<T>	split(AATreeSet.Node<T> top)
SortedSet<T>	subSet(T fromElement, T toElement)
SortedSet<T>	tailSet(T fromElement)

Methods inherited from class AbstractSet

equals, hashCode, removeAll

Methods inherited from class AbstractCollection

addAll, contains, containsAll, retainAll, toArray, toArray, toString

Methods inherited from class Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface Collection

parallelStream, removeIf, stream, toArray

Methods inherited from interface Iterable

forEach

Methods inherited from interface Set

addAll, contains, containsAll, equals, hashCode, removeAll, retainAll, toArray, toArray

Methods inherited from interface SortedSet

addFirst, addLast, getFirst, getLast, removeFirst, removeLast, reversed, spliterator

Field Details

root

private AATreeSet.Node<T extends Comparable<? super T>> root

size

private int size

mutated

private boolean mutated

item

private AATreeSet.Node<T extends Comparable<? super T>> item

heir

private AATreeSet.Node<T extends Comparable<? super T>> heir

removed

private T extends Comparable<? super T> removed

Constructor Details

AATreeSet

public AATreeSet()

Method Details

add

public boolean add(T o)

Specified by:

add in interface Collection<T extends Comparable<? super T>>

Specified by:

add in interface Set<T extends Comparable<? super T>>

Overrides:

add in class AbstractCollection<T extends Comparable<? super T>>

remove

public boolean remove(Object o)

Specified by:

remove in interface Collection<T extends Comparable<? super T>>

Specified by:

remove in interface Set<T extends Comparable<? super T>>

Overrides:

remove in class AbstractCollection<T extends Comparable<? super T>>

removeAndReturn

public T removeAndReturn(Object o)

clear

public void clear()

Specified by:

clear in interface Collection<T extends Comparable<? super T>>

Specified by:

clear in interface Set<T extends Comparable<? super T>>

Overrides:

clear in class AbstractCollection<T extends Comparable<? super T>>

iterator

public Iterator<T> iterator()

Specified by:

iterator in interface Collection<T extends Comparable<? super T>>

Specified by:

iterator in interface Iterable<T extends Comparable<? super T>>

Specified by:

iterator in interface Set<T extends Comparable<? super T>>

Specified by:

iterator in class AbstractCollection<T extends Comparable<? super T>>

size

public int size()

Specified by:

size in interface Collection<T extends Comparable<? super T>>

Specified by:

size in interface Set<T extends Comparable<? super T>>

Specified by:

size in class AbstractCollection<T extends Comparable<? super T>>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Collection<T extends Comparable<? super T>>

Specified by:

isEmpty in interface Set<T extends Comparable<? super T>>

Overrides:

isEmpty in class AbstractCollection<T extends Comparable<? super T>>

comparator

public Comparator<? super T> comparator()

Specified by:

comparator in interface SortedSet<T extends Comparable<? super T>>

subSet

public SortedSet<T> subSet(T fromElement,
 T toElement)

Specified by:

subSet in interface SortedSet<T extends Comparable<? super T>>

headSet

public SortedSet<T> headSet(T toElement)

Specified by:

headSet in interface SortedSet<T extends Comparable<? super T>>

tailSet

public SortedSet<T> tailSet(T fromElement)

Specified by:

tailSet in interface SortedSet<T extends Comparable<? super T>>

first

public T first()

Specified by:

first in interface SortedSet<T extends Comparable<? super T>>

last

public T last()

Specified by:

last in interface SortedSet<T extends Comparable<? super T>>

find

public T find(Object probe)

getRoot

protected final AATreeSet.Node<T> getRoot()

find

private AATreeSet.Node<T> find(AATreeSet.Node<T> top,
 T probe)

insert

private AATreeSet.Node<T> insert(AATreeSet.Node<T> top,
 T data)

createNode

private AATreeSet.Node<T> createNode(T data)

remove

private AATreeSet.Node<T> remove(AATreeSet.Node<T> top,
 T data)

skew

private static <T extends Comparable<? super T>>
AATreeSet.Node<T> skew(AATreeSet.Node<T> top)

split

private static <T extends Comparable<? super T>>
AATreeSet.Node<T> split(AATreeSet.Node<T> top)