| Interface | Description |
|---|---|
| ClusteredIndex<K,T extends ClusteredIndex.Entry<K>> | |
| ClusteredIndex.Entry<K> | |
| IntPair<T> |
A key value pair who's key is of type long.
|
| LongPair<T> |
A key value pair who's key is of type long.
|
| LruNode | |
| TimeoutMap<K,V> |
A map which additionaly to normal map operations allows the user to supply a timeout.
|
| Class | Description |
|---|---|
| ArrayIterator<E> |
An
Iterator over an array. |
| ClusteredHashIndex<K,T extends ClusteredIndex.Entry<K>> | |
| Counter |
A simple counter where values can be added or the whole counter be reset.
|
| CounterRepo | |
| CowSet<E> |
A simple implementation of a copy-on-write set.
There are two modification methods: CowSet.add(Object) and CowSet.remove(Object)and two read methods: CowSet.getView() and CowSet.isEmpty()Every modification through the CowSet.add(Object) or CowSet.remove(Object) methods and a return value of
true will update the view. |
| FinishedFuture<T> | |
| Intervals | |
| LeakyBucket |
An implementation of the leaky bucket pattern for throughput control.
|
| LimitedConcurrentQueue<T> | |
| LruList<E extends LruNode> | |
| SimpleTimeoutMap<K,V> |
An implementation of
TimeoutMap which uses the TreeMap and HashMap from java.util for
internal data management. |
| StaticIntMap<T> |
A statically initialized and immutable map of
int -> T. |
| StaticLongMap<T> |
A statically initialized and immutable map of
long -> T. |
| TLR |
Thread local random.
|
Copyright © 2013. All Rights Reserved.