Package dev.brachtendorf.datastructures
-
Class Summary Class Description CircularHashset CircularLinkedHashMap<K,V> A linked hashmap only keeping the newest n entries.CircularQueue<E> Apache commons CircularFifoQueue without the entire apache dependency CircularFifoQueue is a first-in first-out queue with a fixed size that replaces its oldest element if full.CountHashCollection<K> A hash collection offering a O(1) performance onCountHashCollection.contains(java.lang.Object),CountHashCollection.add(K)andCountHashCollection.remove(java.lang.Object)allowing to keep track of duplicate values.Pair<S,U> A convenience data structure encapsulating 2 values.Triple<S,U,V> A convenience data structure encapsulating 3 values.