All Classes and Interfaces
Class
Description
Utility class for resizing arrays.
Strategy to access contiguous bytes of a data object.
Utility class for byte arrays.
A hash function that maps a given hash consistently to a bucket index of given range.
A hash function that maps a given hash consistently to a bucket from a set of buckets.
Consistent hash algorithms.
A utility functions for distinct counting.
An element hash provider.
Utility class defining empty arrays.
Versions of FastSimHash implementations.
A 128-bit hash function for files and input streams.
Various implementations of hash functions for files.
A 128-bit hash function.
A 32-bit hash function.
A 64-bit hash function.
A hash funnel describing how objects of a given type are put into a
HashSink.Various implementations of hash functions.
A sink that accepts various data types contributing to the hash computation.
A hash stream computing a 128-bit hash value.
A hash stream computing a 32-bit hash value.
A hash stream computing a 64-bit hash value.
Represents a 128-bit hash value.
Utility class for hash values.
A HyperLogLog implementation for approximate distinct counting.
A distinct count estimator for HyperLogLog.
A martingale estimator, that can be used in conjunction with a distinct counter such as
HyperLogLog or UltraLogLog to obtain slightly more accurate estimates for
non-distributed data streams than the corresponding standard estimators.Versions of MinHash implementations.
A utility class for compactly storing fixed bit size components in a byte array.
Gives access to indexed long values.
A handler for a packed array with predefined element size.
A read iterator to read the values of all components in sequential order.
A permutation generator.
Utility class for preconditions.
A pseudo-random generator.
A provider for pseudo-random generators.
Versions of FastSimHash implementations.
A hasher that is able to compute hash signatures which can be used for similarity estimations.
Various implementations of similarity hash algorithms.
A policy for similarity hashing.
An observer of state changes of distinct counters such as
HyperLogLog or UltraLogLog.Versions of SuperMinHash implementations.
A sketch for approximate distinct counting that is more space efficient than HyperLogLog as
described in Otmar Ertl, UltraLogLog: A Practical and
More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting, 2023
A distinct count estimator for UltraLogLog.
Utility class for the unsigned multiplication of
long values.