Package io.github.jbellis.jvector.util
package io.github.jbellis.jvector.util
-
ClassDescriptionMethods for manipulating arrays.Interface for Bitset-like structures.Bits impl of the specified length with all bits set.Bits impl of the specified length with no bits set.Base implementation for a bit set.A variety of high efficiency bit twiddling routines and encoders for primitives.Represents byte[], as a slice (offset + length) into an existing byte[].Some useful constants.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.A 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.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) This is important for heavily vectorized sections of the code since it can easily saturate memory bandwidth.Allows any object to be pooled and released when work is done.Wrapper class for items in the pool These are AutoClosable and are intended to be used in a try-with-resources statement.Estimates the size (memory representation) of Java objects.A bit set that only stores longs that have at least one bit which is set.