exchange.core2.collections.art

Class LongAdaptiveRadixTreeMap<V>

java.lang.Object

exchange.core2.collections.art.LongAdaptiveRadixTreeMap<V>

public final class LongAdaptiveRadixTreeMap<V>
extends Object

Adaptive Radix Tree (ART) Java implementation

based on original paper:

The Adaptive Radix Tree: ARTful Indexing for Main-Memory Databases

Viktor Leis, Alfons Kemper, Thomas Neumann Fakultat fur Informatik Technische Universitat Munchen Boltzmannstrae 3, D-85748 Garching

https://db.in.tum.de/~leis/papers/ART.pdf

Target operations: - GET or (PUT + GET_LOWER/HIGHER) - placing/moving/bulkload order - often GET, more rare PUT ??cache - REMOVE - cancel or move - last order in the bucket - TRAVERSE from LOWER - filling L2 market data, in hot area (Node256 or Node48). - REMOVE price during matching - !! can use RANGE removal operation - rare, but latency critical - GET or PUT if not exists - inserting back own orders, very rare

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	LongAdaptiveRadixTreeMap.Entry<V>

Constructor Summary

Constructors

Constructor and Description
LongAdaptiveRadixTreeMap()
LongAdaptiveRadixTreeMap(ObjectsPool objectsPool)

Method Summary

Modifier and Type	Method and Description
void	clear()
List<Map.Entry<Long,V>>	entriesList()
int	forEach(LongObjConsumer<V> consumer, int limit)
int	forEachDesc(LongObjConsumer<V> consumer, int limit)
V	get(long key)
V	getHigherValue(long key)
V	getLowerValue(long key)
V	getOrInsert(long key, Supplier<V> supplier)
void	getOrInsertFromNode(IArtNode<V> node, Supplier<V> supplier)
String	printDiagram()
void	put(long key, V value)
void	remove(long key)
void	removeRange(long keyFromInclusive, long keyToExclusive) remove keys range
int	size(int limit)
void	validateInternalState()

Methods inherited from class java.lang.Object

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

Constructor Detail

LongAdaptiveRadixTreeMap

public LongAdaptiveRadixTreeMap(ObjectsPool objectsPool)

LongAdaptiveRadixTreeMap

public LongAdaptiveRadixTreeMap()

Method Detail

get

public V get(long key)

put

public void put(long key,
                V value)

getOrInsert

public V getOrInsert(long key,
                     Supplier<V> supplier)

getOrInsertFromNode

public void getOrInsertFromNode(IArtNode<V> node,
                                Supplier<V> supplier)

remove

public void remove(long key)

clear

public void clear()

removeRange

public void removeRange(long keyFromInclusive,
                        long keyToExclusive)

remove keys range

Parameters:

keyFromInclusive - from key inclusive

keyToExclusive - to key exclusive

getHigherValue

public V getHigherValue(long key)

getLowerValue

public V getLowerValue(long key)

forEach

public int forEach(LongObjConsumer<V> consumer,
                   int limit)

forEachDesc

public int forEachDesc(LongObjConsumer<V> consumer,
                       int limit)

size

public int size(int limit)

entriesList

public List<Map.Entry<Long,V>> entriesList()

validateInternalState

public void validateInternalState()

printDiagram

public String printDiagram()