Package org.apache.cassandra.utils.btree

Class BTreeSet<V>

java.lang.Object

org.apache.cassandra.utils.btree.BTreeSet<V>

All Implemented Interfaces:

Iterable<V>, Collection<V>, List<V>, NavigableSet<V>, Set<V>, SortedSet<V>

Direct Known Subclasses:

BTreeSet.BTreeRange

public class BTreeSet<V>
extends Object
implements NavigableSet<V>, List<V>

Nested Class Summary

Nested Classes

Modifier and Type	Class	Description
static class	BTreeSet.BTreeDescRange<V>
static class	BTreeSet.BTreeRange<V>
static class	BTreeSet.Builder<V>

Field Summary

Fields

Modifier and Type	Field	Description
protected final Comparator<? super V>	comparator
protected final Object[]	tree

Constructor Summary

Constructors

Constructor	Description
BTreeSet(Object[] tree, Comparator<? super V> comparator)

Method Summary

Modifier and Type	Method	Description
void	add(int index, V element)
boolean	add(V v)
boolean	addAll(int index, Collection<? extends V> c)
boolean	addAll(Collection<? extends V> c)
static <V> BTreeSet.Builder<V>	builder(Comparator<? super V> comparator)
static <V> BTreeSet.Builder<V>	builder(Comparator<? super V> comparator, int initialCapacity)	if you know the precise size of the resultant set use perfectBuilder instead.
V	ceiling(V v)
void	clear()
Comparator<? super V>	comparator()
boolean	contains(Object o)
boolean	containsAll(Collection<?> c)
static <V> BTreeSet<V>	copy(SortedSet<? extends V> copy, Comparator<? super V> comparator)
static <V> BTreeSet<V>	copy(SortedSet<? extends V> copy, Comparator<? super V> comparator, Function<V,V> modifier)
BTreeSearchIterator<V,V>	descendingIterator()
BTreeSet<V>	descendingSet()
static <V> BTreeSet<V>	empty(Comparator<? super V> comparator)
V	first()
V	floor(V v)
V	get(int index)	The converse of indexOf: provided an index between 0 and size, returns the i'th item, in set order.
int	hashCode()
SortedSet<V>	headSet(V toElement)
BTreeSet<V>	headSet(V toElement, boolean inclusive)
V	higher(V v)
int	indexOf(Object item)	The index of the item within the list, or its insertion point otherwise.
boolean	isEmpty()
BTreeSearchIterator<V,V>	iterator()
V	last()
int	lastIndexOf(Object o)
ListIterator<V>	listIterator()
ListIterator<V>	listIterator(int index)
V	lower(V v)
static <V extends Comparable<V>> BTreeSet<V>	of(Collection<V> sortedValues)
static <V> BTreeSet<V>	of(Comparator<? super V> comparator, V value)
static <V extends Comparable<V>> BTreeSet<V>	of(V value)
V	pollFirst()
V	pollLast()
V	remove(int index)
boolean	remove(Object o)
boolean	removeAll(Collection<?> c)
boolean	retainAll(Collection<?> c)
V	set(int index, V element)
int	size()
protected BTreeSearchIterator<V,V>	slice(BTree.Dir dir)
Spliterator<V>	spliterator()
BTreeSet<V>	subList(int fromIndex, int toIndex)
BTreeSet<V>	subSet(V fromElement, boolean fromInclusive, V toElement, boolean toInclusive)
SortedSet<V>	subSet(V fromElement, V toElement)
SortedSet<V>	tailSet(V fromElement)
BTreeSet<V>	tailSet(V fromElement, boolean inclusive)
Object[]	toArray()
<T> T[]	toArray(T[] a)
<T> T[]	toArray(T[] a, int offset)
Object[]	tree()
static <V> BTreeSet<V>	wrap(Object[] btree, Comparator<? super V> comparator)

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.util.Collection

parallelStream, removeIf, stream, toArray

Methods inherited from interface java.lang.Iterable

forEach

Methods inherited from interface java.util.List

equals, replaceAll, sort

Methods inherited from interface java.util.Set

equals

Field Details

comparator

protected final Comparator<? super V> comparator

tree

protected final Object[] tree

Constructor Details

BTreeSet

public BTreeSet(Object[] tree,
 Comparator<? super V> comparator)

Method Details

comparator

public Comparator<? super V> comparator()

Specified by:

comparator in interface SortedSet<V>

slice

protected BTreeSearchIterator<V,V> slice(BTree.Dir dir)

tree

public Object[] tree()

indexOf

public int indexOf(Object item)

The index of the item within the list, or its insertion point otherwise. i.e. binarySearch semantics

Specified by:

indexOf in interface List<V>

get

public V get(int index)

The converse of indexOf: provided an index between 0 and size, returns the i'th item, in set order.

Specified by:

get in interface List<V>

lastIndexOf

public int lastIndexOf(Object o)

Specified by:

lastIndexOf in interface List<V>

subList

public BTreeSet<V> subList(int fromIndex,
 int toIndex)

Specified by:

subList in interface List<V>

size

public int size()

Specified by:

size in interface Collection<V>

Specified by:

size in interface List<V>

Specified by:

size in interface Set<V>

isEmpty

public boolean isEmpty()

Specified by:

isEmpty in interface Collection<V>

Specified by:

isEmpty in interface List<V>

Specified by:

isEmpty in interface Set<V>

iterator

public BTreeSearchIterator<V,V> iterator()

Specified by:

iterator in interface Collection<V>

Specified by:

iterator in interface Iterable<V>

Specified by:

iterator in interface List<V>

Specified by:

iterator in interface NavigableSet<V>

Specified by:

iterator in interface Set<V>

descendingIterator

public BTreeSearchIterator<V,V> descendingIterator()

Specified by:

descendingIterator in interface NavigableSet<V>

toArray

public Object[] toArray()

Specified by:

toArray in interface Collection<V>

Specified by:

toArray in interface List<V>

Specified by:

toArray in interface Set<V>

toArray

public <T> T[] toArray(T[] a)

Specified by:

toArray in interface Collection<V>

Specified by:

toArray in interface List<V>

Specified by:

toArray in interface Set<V>

toArray

public <T> T[] toArray(T[] a,
 int offset)

spliterator

public Spliterator<V> spliterator()

Specified by:

spliterator in interface Collection<V>

Specified by:

spliterator in interface Iterable<V>

Specified by:

spliterator in interface List<V>

Specified by:

spliterator in interface Set<V>

Specified by:

spliterator in interface SortedSet<V>

subSet

public BTreeSet<V> subSet(V fromElement,
 boolean fromInclusive,
 V toElement,
 boolean toInclusive)

Specified by:

subSet in interface NavigableSet<V>

headSet

public BTreeSet<V> headSet(V toElement,
 boolean inclusive)

Specified by:

headSet in interface NavigableSet<V>

tailSet

public BTreeSet<V> tailSet(V fromElement,
 boolean inclusive)

Specified by:

tailSet in interface NavigableSet<V>

subSet

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

Specified by:

subSet in interface NavigableSet<V>

Specified by:

subSet in interface SortedSet<V>

headSet

public SortedSet<V> headSet(V toElement)

Specified by:

headSet in interface NavigableSet<V>

Specified by:

headSet in interface SortedSet<V>

tailSet

public SortedSet<V> tailSet(V fromElement)

Specified by:

tailSet in interface NavigableSet<V>

Specified by:

tailSet in interface SortedSet<V>

descendingSet

public BTreeSet<V> descendingSet()

Specified by:

descendingSet in interface NavigableSet<V>

first

public V first()

Specified by:

first in interface SortedSet<V>

last

public V last()

Specified by:

last in interface SortedSet<V>

lower

public V lower(V v)

Specified by:

lower in interface NavigableSet<V>

floor

public V floor(V v)

Specified by:

floor in interface NavigableSet<V>

ceiling

public V ceiling(V v)

Specified by:

ceiling in interface NavigableSet<V>

higher

public V higher(V v)

Specified by:

higher in interface NavigableSet<V>

contains

public boolean contains(Object o)

Specified by:

contains in interface Collection<V>

Specified by:

contains in interface List<V>

Specified by:

contains in interface Set<V>

containsAll

public boolean containsAll(Collection<?> c)

Specified by:

containsAll in interface Collection<V>

Specified by:

containsAll in interface List<V>

Specified by:

containsAll in interface Set<V>

hashCode

public int hashCode()

Specified by:

hashCode in interface Collection<V>

Specified by:

hashCode in interface List<V>

Specified by:

hashCode in interface Set<V>

Overrides:

hashCode in class Object

addAll

public boolean addAll(Collection<? extends V> c)

Specified by:

addAll in interface Collection<V>

Specified by:

addAll in interface List<V>

Specified by:

addAll in interface Set<V>

addAll

public boolean addAll(int index,
 Collection<? extends V> c)

Specified by:

addAll in interface List<V>

retainAll

public boolean retainAll(Collection<?> c)

Specified by:

retainAll in interface Collection<V>

Specified by:

retainAll in interface List<V>

Specified by:

retainAll in interface Set<V>

removeAll

public boolean removeAll(Collection<?> c)

Specified by:

removeAll in interface Collection<V>

Specified by:

removeAll in interface List<V>

Specified by:

removeAll in interface Set<V>

clear

public void clear()

Specified by:

clear in interface Collection<V>

Specified by:

clear in interface List<V>

Specified by:

clear in interface Set<V>

pollFirst

public V pollFirst()

Specified by:

pollFirst in interface NavigableSet<V>

pollLast

public V pollLast()

Specified by:

pollLast in interface NavigableSet<V>

add

public boolean add(V v)

Specified by:

add in interface Collection<V>

Specified by:

add in interface List<V>

Specified by:

add in interface Set<V>

remove

public boolean remove(Object o)

Specified by:

remove in interface Collection<V>

Specified by:

remove in interface List<V>

Specified by:

remove in interface Set<V>

set

public V set(int index,
 V element)

Specified by:

set in interface List<V>

add

public void add(int index,
 V element)

Specified by:

add in interface List<V>

remove

public V remove(int index)

Specified by:

remove in interface List<V>

listIterator

public ListIterator<V> listIterator()

Specified by:

listIterator in interface List<V>

listIterator

public ListIterator<V> listIterator(int index)

Specified by:

listIterator in interface List<V>

builder

public static <V> BTreeSet.Builder<V> builder(Comparator<? super V> comparator)

builder

public static <V> BTreeSet.Builder<V> builder(Comparator<? super V> comparator,
 int initialCapacity)

if you know the precise size of the resultant set use perfectBuilder instead.

wrap

public static <V> BTreeSet<V> wrap(Object[] btree,
 Comparator<? super V> comparator)

of

public static <V extends Comparable<V>> BTreeSet<V> of(Collection<V> sortedValues)

of

public static <V extends Comparable<V>> BTreeSet<V> of(V value)

empty

public static <V> BTreeSet<V> empty(Comparator<? super V> comparator)

of

public static <V> BTreeSet<V> of(Comparator<? super V> comparator,
 V value)

copy

public static <V> BTreeSet<V> copy(SortedSet<? extends V> copy,
 Comparator<? super V> comparator)

copy

public static <V> BTreeSet<V> copy(SortedSet<? extends V> copy,
 Comparator<? super V> comparator,
 Function<V,V> modifier)