Module org.elasticsearch.server
Package org.elasticsearch.common.util
package org.elasticsearch.common.util
-
ClassDescriptionBase abstraction of an array.Utility class to work with arrays.Performs binary search on an arbitrary data structure.Abstraction of an array of byte values.Compact serializable container for ByteRefsSpecialized hash table implementation similar to Lucene's BytesRefHash that maps BytesRef values to ids.Utility methods to do byte-level encoding.A
Supplierthat caches its return value.CancellableSingleObjectCache<Input,Key, Value> A cache of a single object whose refresh process can be cancelled.A utility class for multi threaded operation that needs to be cancellable via interrupts.Collections-related utility methods.A rate limiter designed for multiple concurrent users.Comparator-related utility methods.CopyOnFirstWriteMap<K,V> This map is designed to be constructed from an immutable map and be copied only if a (rare) mutation operation occurs.An approximate set membership datastructure CuckooFilters are similar to Bloom Filters in usage; values are inserted, and the Cuckoo can be asked if it has seen a particular value before.Abstraction of an array of double values.A utility class for registering feature flags in Elasticsearch code.Abstraction of an array of double values.Specialized hash table implementation similar to BytesRefHash that maps three int values to ids.Abstraction of an array of integer values.LazyInitializable<T,E extends Exception> Encapsulates aCheckedSupplierwhich is lazily invoked once on the first call to#getOrCompute().Utilities for dealing withLocaleobjectsAbstraction of an array of long values.Specialized hash table implementation similar to BytesRefHash that maps long values to ids.Specialized hash table implementation similar to BytesRefHash that maps two long values to ids.A hash table from native longs to objects.ObjectArray<T>Abstraction of an array of object values.A priority queue maintains a partial ordering of its elements such that the least element can always be found in constant time.A hash table from objects to objects.A recycler of fixed-size pages.An approximate set membership datastructure that scales as more unique values are inserted.A very simple single object cache that allows non-blocking refresh calls triggered by expiry time.A cache in front of Java's string interning.URI Pattern matcher The pattern is URI in which authority, path, query and fragment can be replace with simple pattern.