Module swim.collections

Package swim.collections

Class BTreePage<K,V,U>

java.lang.Object

swim.collections.BTreePage<K,V,U>

public abstract class BTreePage<K,V,U>
extends Object

Method Summary

Modifier and Type	Method	Description
abstract int	arity()
abstract BTreePage<K,V,U>	balanced(BTreeContext<K,V> tree)
abstract boolean	containsKey(Object key, BTreeContext<K,V> tree)
abstract boolean	containsValue(Object value)
abstract BTreePage<K,V,U>	drop(int lower, BTreeContext<K,V> tree)
static <K, V, U> BTreePage<K,V,U>	empty()
abstract Map.Entry<K,V>	firstEntry()
abstract U	fold()
abstract V	get(Object key, BTreeContext<K,V> tree)
abstract Map.Entry<K,V>	getEntry(Object key, BTreeContext<K,V> tree)
abstract Map.Entry<K,V>	getIndex(int index)
abstract int	indexOf(Object key, BTreeContext<K,V> tree)
abstract boolean	isEmpty()
abstract OrderedMapCursor<K,V>	iterator()
Cursor<K>	keyIterator()
abstract Map.Entry<K,V>	lastEntry()
abstract K	maxKey()
abstract K	minKey()
abstract Map.Entry<K,V>	nextEntry(K key, BTreeContext<K,V> tree)
abstract Map.Entry<K,V>	previousEntry(K key, BTreeContext<K,V> tree)
abstract BTreePage<K,V,U>	reduced(U identity, CombinerFunction<? super V,U> accumulator, CombinerFunction<U,U> combiner)
abstract BTreePage<K,V,U>	removed(Object key, BTreeContext<K,V> tree)
abstract OrderedMapCursor<K,V>	reverseIterator()
Cursor<K>	reverseKeyIterator()
Cursor<V>	reverseValueIterator()
abstract int	size()
abstract BTreePage<K,V,U>	split(int index)
abstract BTreePage<K,V,U>	splitLeft(int index)
abstract BTreePage<K,V,U>	splitRight(int index)
abstract BTreePage<K,V,U>	take(int upper, BTreeContext<K,V> tree)
abstract BTreePage<K,V,U>	updated(K key, V newValue, BTreeContext<K,V> tree)
Cursor<V>	valueIterator()

Methods inherited from class java.lang.Object

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

Method Details

isEmpty

public abstract boolean isEmpty()

size

public abstract int size()

arity

public abstract int arity()

fold

public abstract U fold()

minKey

public abstract K minKey()

maxKey

public abstract K maxKey()

containsKey

public abstract boolean containsKey(Object key,
 BTreeContext<K,V> tree)

containsValue

public abstract boolean containsValue(Object value)

indexOf

public abstract int indexOf(Object key,
 BTreeContext<K,V> tree)

get

public abstract V get(Object key,
 BTreeContext<K,V> tree)

getEntry

public abstract Map.Entry<K,V> getEntry(Object key,
 BTreeContext<K,V> tree)

getIndex

public abstract Map.Entry<K,V> getIndex(int index)

firstEntry

public abstract Map.Entry<K,V> firstEntry()

lastEntry

public abstract Map.Entry<K,V> lastEntry()

nextEntry

public abstract Map.Entry<K,V> nextEntry(K key,
 BTreeContext<K,V> tree)

previousEntry

public abstract Map.Entry<K,V> previousEntry(K key,
 BTreeContext<K,V> tree)

updated

public abstract BTreePage<K,V,U> updated(K key,
 V newValue,
 BTreeContext<K,V> tree)

removed

public abstract BTreePage<K,V,U> removed(Object key,
 BTreeContext<K,V> tree)

drop

public abstract BTreePage<K,V,U> drop(int lower,
 BTreeContext<K,V> tree)

take

public abstract BTreePage<K,V,U> take(int upper,
 BTreeContext<K,V> tree)

balanced

public abstract BTreePage<K,V,U> balanced(BTreeContext<K,V> tree)

split

public abstract BTreePage<K,V,U> split(int index)

splitLeft

public abstract BTreePage<K,V,U> splitLeft(int index)

splitRight

public abstract BTreePage<K,V,U> splitRight(int index)

reduced

public abstract BTreePage<K,V,U> reduced(U identity,
 CombinerFunction<? super V,U> accumulator,
 CombinerFunction<U,U> combiner)

keyIterator

public Cursor<K> keyIterator()

valueIterator

public Cursor<V> valueIterator()

iterator

public abstract OrderedMapCursor<K,V> iterator()

reverseKeyIterator

public Cursor<K> reverseKeyIterator()

reverseValueIterator

public Cursor<V> reverseValueIterator()

reverseIterator

public abstract OrderedMapCursor<K,V> reverseIterator()

empty

public static <K,
V,
U> BTreePage<K,V,U> empty()