See: Description
| Interface | Description |
|---|---|
| ConcurrentLongHashMap.EntryProcessor<V> |
Processor for one key-value entry, where the key is
long. |
| ConcurrentLongPairSet.ConsumerLong |
Represents a function that accepts an object of the
LongPair type. |
| ConcurrentLongPairSet.LongPairConsumer |
Represents a function that accepts two long arguments.
|
| GrowablePriorityLongPairQueue.LongPairConsumer |
Represents a function that accepts two long arguments.
|
| GrowablePriorityLongPairQueue.LongPairPredicate |
Predicate to checks for a key-value pair where both of them have long types.
|
| LongPairRangeSet<T extends Comparable<T>> |
A set comprising zero or more ranges type of key-value pair.
|
| LongPairRangeSet.LongPairConsumer<T> |
Represents a function that accepts two long arguments and produces a result.
|
| LongPairRangeSet.RangeProcessor<T extends Comparable<T>> |
The interface exposing a method for processing of ranges.
|
| LongPairSet |
Hash set where values are composed of pairs of longs.
|
| LongPairSet.LongPairFunction<T> |
Represents a function that accepts two long arguments and produces a result.
|
| LongPairSet.LongPairPredicate |
Predicate to checks for a key-value pair where both of them have long types.
|
| Class | Description |
|---|---|
| BitSetRecyclable |
This this copy of
BitSet. |
| ConcurrentBitSet |
Safe multithreaded version of
BitSet. |
| ConcurrentBitSetRecyclable |
Safe multithreaded version of
BitSet and leverage netty recycler. |
| ConcurrentLongHashMap<V> |
Map from long to an Object.
|
| ConcurrentLongPairSet |
Concurrent hash set where values are composed of pairs of longs.
|
| ConcurrentLongPairSet.LongPair |
Class representing two long values.
|
| ConcurrentOpenHashMap<K,V> |
Concurrent hash map.
|
| ConcurrentOpenHashSet<V> |
Concurrent hash set.
|
| ConcurrentOpenLongPairRangeSet<T extends Comparable<T>> |
A Concurrent set comprising zero or more ranges of type
LongPair. |
| ConcurrentSortedLongPairSet |
Sorted concurrent
LongPairSet which is not fully accurate in sorting. |
| GrowableArrayBlockingQueue<T> |
This implements a
BlockingQueue backed by an array with no fixed capacity. |
| GrowablePriorityLongPairQueue |
An unbounded priority queue based on a min heap where values are composed of pairs of longs.
|
| GrowablePriorityLongPairQueue.LongPair |
Class representing two long values.
|
| LongPairRangeSet.DefaultRangeSet<T extends Comparable<T>> |
Generic implementation of a default range set.
|
| LongPairRangeSet.LongPair |
This class is a simple key-value data structure.
|
| TripleLongPriorityQueue |
Provides a priority-queue implementation specialized on items composed by 3 longs.
|
Copyright © 2017–2021 Apache Software Foundation. All rights reserved.