Package io.github.jbellis.jvector.util
package io.github.jbellis.jvector.util
-
ClassDescriptionA min heap that stores longs; a primitive priority queue that like all priority queues maintains a partial ordering of its elements such that the least element can always be found in constant time.Methods for manipulating arrays.A
BitSetimplementation that offers concurrent reads and writes through anAtomicLongArrayas bit storage.Interface for Bitset-like structures.Bits with all bits set.Bits with no bits set.Base implementation for a bit set.A variety of high efficiency bit twiddling routines and encoders for primitives.An AbstractLongHeap with an adjustable maximum size.Some useful constants.DenseIntMap<T>A map (but not a Map) of int -> T where the int keys are dense-ish and start at zero, but the size of the map is not known in advance.The standardThreadLocalappears to be designed to be used with relatively short-lived Threads.BitSet of fixed length (numBits), backed by accessible (FixedBitSet.getBits()) long[], accessed with an int index, implementingBits.ABitSetimplementation that grows as needed to accommodate set(index) calls.An AbstractLongHeap that can grow in size (unbounded, except for memory and array size limits).Helper APIs to encode numeric values as sortable bytes and vice-versa.A fork join pool which is sized to match the number of physical cores on the machine (avoiding hyper-thread count)Estimates the size (memory representation) of Java objects.Implements the membership parts of an updatable BitSet (but not prev/next bits)Deprecated.A thread-safeBitSetimplementation that grows as needed to accommodate set(index) calls.