| Interface | Description |
|---|---|
| IntIterator |
An iterator over a collection of ints.
|
| IntMap<V> |
A Map that uses ints as its keys.
|
| IntMap.Entry<V> | |
| IntSet |
Modeled closely after the java.util.Set class, except it
uses ints instead of Objects.
|
| Class | Description |
|---|---|
| AbstractIntMap<V> |
This class provides a skeletal implementation of the IntMap
interface, to minimize the effort required to implement this interface.
|
| AbstractIntMap.SimpleEntry<V> | |
| AbstractIntSet |
Abstract implementation of an IntSet.
|
| ExpandableArray<E> |
An array of Objects that expands as needed to hold new data.
|
| IntHashMap<V> |
Hash table based implementation of the IntMap interface.
|
| IntHashSet |
This class implements the IntSet interface, backed by a hash table
(actually a IntHashMap instance).
|
| LruCache<K,V> |
A basic implementation of a size-capped cache based on
LinkedHashMap
The eviction policy can be access order or insertion order. |
Copyright (c) 2016-2017, Salesforce.com, Inc. All rights reserved. Licensed under the BSD 3-Clause license. For full license text, see the LICENSE.txt file in the repository.