GridGain™ 4.3.1e
Enterprise "Big Data" Edition

Package org.gridgain.grid.lang.utils

icon Contains general utility collections.

See:
          Description

Interface Summary
GridConcurrentHashMap.MappingFunction<K,V> A function computing a mapping from the given key to a value.
GridConcurrentHashMap.RemappingFunction<K,V> A function computing a new mapping given a key and its current mapped value (or null if there is no current mapping).
GridConsistentHash.Digitizer Interface for pluggable convertion of objects into byte array for hashing.
GridConsistentHash.Hasher Interface for pluggable hasher functions.
GridSerializableFuture<T> Adds serialization to the Future interface.
GridSerializableIterable<E> Makes Iterable as Serializable and is useful for making anonymous serializable iterators.
GridSerializableIterator<E> Makes Iterator as Serializable and is useful for making anonymous serializable iterators.
 

Class Summary
GridAtomicInteger In addition to operations provided in java atomic data structures, this class also adds greater than and less than atomic set operations.
GridAtomicIntegerPair This class provides atomic pair of integer variables.
GridAtomicLong In addition to operations provided in java atomic data structures, this class also addes greater than and less than atomic set operations.
GridBoundedConcurrentLinkedHashMap<K,V> Concurrent map with an upper bound.
GridBoundedConcurrentLinkedHashSet<E> Concurrent set with an upper bound.
GridBoundedConcurrentOrderedMap<K,V> Concurrent ordered map that automatically manages its maximum size.
GridBoundedConcurrentOrderedSet<E> Concurrent ordered set that automatically manages its maximum size.
GridBoundedLinkedHashMap<K,V> Generic map with an upper bound.
GridBoundedLinkedHashSet<E> Hash table and linked list implementation of the Set interface, with predictable iteration order.
GridByteArrayList Re-sizable array implementation of the byte list (eliminating auto-boxing of primitive byte type).
GridCloseableIteratorAdapter<T> Convenient adapter for closeable iterator.
GridCollectionOpt<T> Monadic collection.
GridCollections Provides locked wrappers around given maps and collections.
GridConcurrentHashMap<K,V> A hash table supporting full concurrency of retrievals and high expected concurrency for updates.
GridConcurrentHashSet<E> Concurrent set implementation.
GridConcurrentLinkedDeque<E> An unbounded concurrent deque based on linked nodes.
GridConcurrentLinkedDeque.Node<E> Internal node element.
GridConcurrentLinkedHashMap<K,V> A hash table supporting full concurrency of retrievals and adjustable expected concurrency for updates.
GridConcurrentLinkedHashMap.HashEntry<K,V> ConcurrentHashMap list entry.
GridConcurrentLinkedHashSet<E> Concurrent linked set implementation.
GridConcurrentPhantomHashSet<E> Concurrent phantom hash set implementation.
GridConcurrentSkipListSet<E> This class provided the same logic as ConcurrentSkipListSet.
GridConcurrentWeakHashSet<E> Concurrent weak hash set implementation.
GridConsistentHash<N> Controls key to node affinity using consistent hash algorithm.
GridEmptyCloseableIterator<T> Empty closeable iterator.
GridEmptyIterator<T> Empty iterator.
GridExecutionStatistics Accumulates execution statistics for named pieces of code.
GridIdentityHashSet<E> Set counterpart for IdentityHashMap.
GridIterableOpt<T> Monadic iterable.
GridLeanMap<K,V> Lean map implementation that keeps up to five entries in its fields.
GridLeanSet<E> Lean set implementation.
GridListSet<V> Implementation of Set based on internal list rather than hash table.
GridLongAdder One or more variables that together maintain an initially zero long sum.
GridMapOpt<K,V> Monadic map.
GridQueue<E> Queue which supports addition at tail and removing at head.
GridQueue.Node<E> Node for internal linked list.
GridSerializableCollection<E> Makes AbstractCollection as Serializable and is useful for making anonymous serializable collections.
GridSerializableList<E> Makes AbstractList as Serializable and is useful for making anonymous serializable lists.
GridSerializableMap<K,V> Makes AbstractMap as Serializable and is useful for making anonymous serializable maps.
GridSerializableSet<E> Makes AbstractSet as Serializable and is useful for making anonymous serializable sets.
GridSetWrapper<E> Set implementation that delegates to map.
GridStripedLock This is an utility class for 'splitting' locking of some int- or long-keyed resources.
GridStripedReadWriteLock This is an utility class for 'splitting' locking of some int- or long-keyed resources.
GridThreadLocalRandom A random number generator isolated to the current thread.
GridUuid This is a faster performing version of UUID.
 

Package org.gridgain.grid.lang.utils Description

icon Contains general utility collections.

 

GridGain™ 4.3.1e
Enterprise "Big Data" Edition

GridGain - In-Memory Big Data
Enterprise "Big Data" Edition, ver. 4.3.1e.10112012
2012 Copyright © GridGain Systems
Follow us:   Follow GridGain on Github Join GridGain User Group Follow GridGain on Twitter Follow GridGain on Vimeo