tech.harmonysoft.oss.leonardo.collection

Class DataTreeImpl<K,V>

tech.harmonysoft.oss.leonardo.collection.DataTreeImpl<K,V>

All Implemented Interfaces:

DataTree<K,V>

public class DataTreeImpl<K,V>
implements DataTree<K,V>

An AVL tree which assumes that it's accessed only from a single thread at the time and that the access is iteration-like:

1. getPreviousKey (returns, say, k1)

2. getNextKey (returns k2)

3. getNextKey (returns k3)

4. getNextKey (returns k4)

5. etc

It caches last call's results and tries re-using them on subsequent calls.

See Also:

getPreviousKey, getNextKey, getNextKey, getNextKey

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	DataTreeImpl.Companion

Field Summary

Fields

Modifier and Type	Field and Description
static DataTreeImpl.Companion	Companion

Constructor Summary

Constructors

Constructor and Description
DataTreeImpl(java.util.Comparator<K> comparator) An AVL tree which assumes that it's accessed only from a single thread at the time and that the access is iteration-like:

Method Summary

Modifier and Type	Method and Description
V	get(K key)
boolean	getEmpty()
V	getFirst()
java.util.Set<K>	getKeys()
V	getLast()
kotlin.jvm.functions.Function1<java.lang.String,kotlin.Unit>	getLog()
K	getNextKey(K key)
V	getNextValue(K key)
K	getPreviousKey(K key)
V	getPreviousValue(K key)
void	put(K key, V value)
V	remove(K key)
void	removeGreaterThen(K key)
void	removeLowerThen(K key)
void	setLog(kotlin.jvm.functions.Function1<? super java.lang.String,kotlin.Unit> p)

Methods inherited from interface tech.harmonysoft.oss.leonardo.collection.DataTree

get, getEmpty, getFirst, getKeys, getLast, getNextKey, getNextValue, getPreviousKey, getPreviousValue, put, remove, removeGreaterThen, removeLowerThen

Field Detail

Companion

public static DataTreeImpl.Companion Companion

Constructor Detail

DataTreeImpl

public DataTreeImpl(@NotNull
                    java.util.Comparator<K> comparator)

An AVL tree which assumes that it's accessed only from a single thread at the time and that the access is iteration-like:

1. getPreviousKey (returns, say, k1)

2. getNextKey (returns k2)

3. getNextKey (returns k3)

4. getNextKey (returns k4)

5. etc

It caches last call's results and tries re-using them on subsequent calls.

See Also:

getPreviousKey, getNextKey, getNextKey, getNextKey

Method Detail

getLog

@NotNull
public kotlin.jvm.functions.Function1<java.lang.String,kotlin.Unit> getLog()

setLog

public void setLog(@NotNull
                   kotlin.jvm.functions.Function1<? super java.lang.String,kotlin.Unit> p)

getEmpty

public boolean getEmpty()

getKeys

@NotNull
public java.util.Set<K> getKeys()

getFirst

@Nullable
public V getFirst()

getLast

@Nullable
public V getLast()

get

@Nullable
public V get(K key)

getPreviousKey

@Nullable
public K getPreviousKey(K key)

getPreviousValue

@Nullable
public V getPreviousValue(K key)

getNextKey

@Nullable
public K getNextKey(K key)

getNextValue

@Nullable
public V getNextValue(K key)

put

public void put(K key,
                V value)

removeLowerThen

public void removeLowerThen(K key)

remove

@Nullable
public V remove(K key)

removeGreaterThen

public void removeGreaterThen(K key)