org.siebengeisslein.indexedlist
Interface BTreeNodeKeys<KeyType>

All Known Implementing Classes:

IntKeys, LongKeys, RefKeys, StringKeys

public interface BTreeNodeKeys<KeyType>

Method Summary

int	findIndex(KeyType key)
int	findIndex(KeyType key, java.util.Comparator<KeyType> c) Returns the first index, whose key is >= key or -1 if no such index exists.
KeyType	get(int i)
KeyType	getLastKey()
int	getMaxSize()
int	insert(KeyType key)
void	remove(int index)
void	set(int index, KeyType key)
int	size()
BTreeNodeKeys<KeyType>	split(int splitIndex)

Method Detail

get

KeyType get(int i)

getMaxSize

int getMaxSize()

size

int size()

insert

int insert(KeyType key)

set

void set(int index,
         KeyType key)

findIndex

int findIndex(KeyType key)

findIndex

int findIndex(KeyType key,
              java.util.Comparator<KeyType> c)

Returns the first index, whose key is >= key or -1 if no such index exists.

getLastKey

KeyType getLastKey()

split

BTreeNodeKeys<KeyType> split(int splitIndex)

remove

void remove(int index)