| 
 | |||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||
See:
          Description
| Interface Summary | |
|---|---|
| IComparableProperty | An interface that allows implementors to let themselves be compared by a ComparableNumberinstance that may be
 modified by the comparing classs. | 
| IRingBuffer<T> | Interface for implementations of RingBuffers. | 
| Class Summary | |
|---|---|
| ComparatorToString<T> | A Comparatorthat compares the given Objects by theirObject.toString()value. | 
| Entry<V,K> | I have written implementations of java.util.Map.Entry in form of Static inner classes. Non-static inner classes. Non-public classes. Anonymous classes. | 
| RingBufferArray<T> | A RingBuffer can be used to store a limited number of entries of any type within a buffer. | 
| RingBufferArrayFast<T> | Fast ring buffer implementation. | 
| TreeSetGreedy<T extends IComparableProperty> | A Setthat will always successfully add new instances and
 guarantee that all the "Comparable properties" of the containedinstances will build a set (no duplicates). | 
| Exception Summary | |
|---|---|
| IRingBuffer.RingBufferException | Special exception related to ring buffer operations. | 
Advanced collection classes for high performance dynamic charting with small memory footprint.
The implementations are mostly very low level - Build from scratch with a lookup in Sedgewick or old c-routines in a custom library on a Motorola 6880 Pesos System. Credits to the staff of the Hardware Lab of HAW Hamburg, the place I studied.
| 
 | |||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | ||||||||