Package com.graphhopper.coll
package com.graphhopper.coll
-
ClassDescriptionWrapper interface of an integer container for different implementations like OpenBitset, BitSet, ...This implementation stores the bits inside the values of a long-array.Prefer GHTBitSet or GHBitSetImpl over this class.We often do not mix maps but really need to avoid randomness or that threads can influence each other and so we do not use the default HashOrderMixing employed in HPPC (which does this in a thread-safe manner).An in-memory B-Tree with configurable value size (1-8 bytes).A priority queue implemented by a treemap to allow fast key update.Implements the bitset interface via a hash set.MapEntry<K,
V> Simple impl of Map.Entry.A minimum heap implemented using a binary tree (https://en.wikipedia.org/wiki/Binary_heap).