Modifier and Type	Class and Description
public static class	IntHashMap.Entry<V>
private class	IntHashMap.EntryIterator
private class	IntHashMap.EntrySet
private abstract class	IntHashMap.HashIterator<T>
private class	IntHashMap.KeyIterator
private class	IntHashMap.KeySet
private static class	IntHashMap.NullMap<U>
private class	IntHashMap.ValueIterator
private class	IntHashMap.Values

Modifier and Type	Field and Description
private int	count
private transient Set<IntHashMap.Entry<V>>	entrySet
pack-priv transient volatile Set<Integer>	keySet
private final float	loadFactor
private IntHashMap.Entry<V>[]	table
private int	threshold
pack-priv transient volatile Collection<V>	values

Access	Constructor and Description
public	IntHashMap()
public	IntHashMap(int initialCapacity)
public	IntHashMap(int initialCapacity, float loadFactor)

Method Summary

Modifier and Type	Method and Description
public synchronized void	clear()
public Object	clone() Overrides java.lang.Object.clone. Creates and returns a copy of this object.
public boolean	contains(Object value)
public boolean	containsKey(int key)
public boolean	containsValue(Object value)
public Set<IntHashMap.Entry<V>>	entrySet()
public void	forEach(BiConsumer<Integer, ? super V> action)
public V	get(int key)
pack-priv IntHashMap.Entry<V>	getEntry(int key)
public boolean	isEmpty()
public Set<Integer>	keySet()
pack-priv Iterator<IntHashMap.Entry<V>>	newEntryIterator()
pack-priv Iterator<Integer>	newKeyIterator()
pack-priv Iterator<V>	newValueIterator()
public static <U> IntHashMap<U>	nullMap()
public V	put(int key, V value)
protected void	rehash()
public V	remove(int key)
public int	size()
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.
public Collection<V>	values()

Inherited from java.lang.Object:: equals finalize getClass hashCode notify notifyAll wait wait wait

Field Detail

count	back to summary
private int count

entrySet	back to summary
private transient Set<IntHashMap.Entry<V>> entrySet

keySet	back to summary
pack-priv transient volatile Set<Integer> keySet

loadFactor	back to summary
private final float loadFactor

table	back to summary
private IntHashMap.Entry<V>[] table

threshold	back to summary
private int threshold

values	back to summary
pack-priv transient volatile Collection<V> values

IntHashMap	back to summary
public IntHashMap()

IntHashMap	back to summary
public IntHashMap(int initialCapacity)

IntHashMap	back to summary
public IntHashMap(int initialCapacity, float loadFactor) Annotations @SuppressWarnings:unchecked

Method Detail

clear	back to summary
public synchronized void clear()

clone back to summary

clone	back to summary
public Object clone() Overrides java.lang.Object.clone. Doc from java.lang.Object.clone. Creates and returns a copy of this object. The precise meaning of "copy" may depend on the class of the object. The general intent is that, for any object `x`, the expression: x.clone() != x will be true, and that the expression: x.clone().getClass() == x.getClass() will be `true`, but these are not absolute requirements. While it is typically the case that: x.clone().equals(x) will be `true`, this is not an absolute requirement. By convention, the returned object should be obtained by calling `super.clone`. If a class and all of its superclasses (except `Object`) obey this convention, it will be the case that `x.clone().getClass() == x.getClass()`. By convention, the object returned by this method should be independent of this object (which is being cloned). To achieve this independence, it may be necessary to modify one or more fields of the object returned by `super.clone` before returning it. Typically, this means copying any mutable objects that comprise the internal "deep structure" of the object being cloned and replacing the references to these objects with references to the copies. If a class contains only primitive fields or references to immutable objects, then it is usually the case that no fields in the object returned by `super.clone` need to be modified. Returns:Object a clone of this instance. Annotations @Override

public Object clone()

Overrides java.lang.Object.clone.

Doc from java.lang.Object.clone.

Creates and returns a copy of this object. The precise meaning of "copy" may depend on the class of the object. The general intent is that, for any object x, the expression:

x.clone() != x

will be true, and that the expression:

x.clone().getClass() == x.getClass()

will be true, but these are not absolute requirements. While it is typically the case that:

x.clone().equals(x)

will be true, this is not an absolute requirement.

By convention, the returned object should be obtained by calling super.clone. If a class and all of its superclasses (except Object) obey this convention, it will be the case that x.clone().getClass() == x.getClass().

By convention, the object returned by this method should be independent of this object (which is being cloned). To achieve this independence, it may be necessary to modify one or more fields of the object returned by super.clone before returning it. Typically, this means copying any mutable objects that comprise the internal "deep structure" of the object being cloned and replacing the references to these objects with references to the copies. If a class contains only primitive fields or references to immutable objects, then it is usually the case that no fields in the object returned by super.clone need to be modified.

Returns:Object

a clone of this instance.

Annotations

@Override

contains	back to summary
public boolean contains(Object value)

containsKey	back to summary
public boolean containsKey(int key)

containsValue	back to summary
public boolean containsValue(Object value)

entrySet	back to summary
public Set<IntHashMap.Entry<V>> entrySet()

forEach	back to summary
public void forEach(BiConsumer<Integer, ? super V> action)

get	back to summary
public V get(int key)

getEntry	back to summary
pack-priv IntHashMap.Entry<V> getEntry(int key)

isEmpty	back to summary
public boolean isEmpty()

keySet	back to summary
public Set<Integer> keySet()

newEntryIterator	back to summary
pack-priv Iterator<IntHashMap.Entry<V>> newEntryIterator()

newKeyIterator	back to summary
pack-priv Iterator<Integer> newKeyIterator()

newValueIterator	back to summary
pack-priv Iterator<V> newValueIterator()

nullMap	back to summary
public static <U> IntHashMap<U> nullMap() Annotations @SuppressWarnings:unchecked

put	back to summary
public V put(int key, V value)

rehash	back to summary
protected void rehash()

remove	back to summary
public V remove(int key)

size	back to summary
public int size()

toString back to summary

toString	back to summary
public String toString() Overrides java.lang.Object.toString. Doc from java.lang.Object.toString. Returns a string representation of the object. Satisfying this method's contract implies a non-`null` result must be returned. Returns:String a string representation of the object Annotations @Override

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

Returns:String

a string representation of the object

Annotations

@Override

values	back to summary
public Collection<V> values()

org.jruby.util.collections back to summary

public Class IntHashMap.Entry<V>

Class Inheritance

extends Object

java.lang.Object
org.jruby.util.collections.IntHashMap.Entry

Field Summary

Modifier and Type	Field and Description
pack-priv final int	hash
pack-priv final int	key
pack-priv IntHashMap.Entry<V>	next
pack-priv V	value

Constructor Summary

Access	Constructor and Description
protected	Entry(int hash, int key, V value, IntHashMap.Entry<V> next)

Method Summary

Modifier and Type	Method and Description
public int	getKey()
public V	getValue()

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

hash	back to summary
pack-priv final int hash

key	back to summary
pack-priv final int key

next	back to summary
pack-priv IntHashMap.Entry<V> next

value	back to summary
pack-priv V value

Constructor Detail

Entry	back to summary
protected Entry(int hash, int key, V value, IntHashMap.Entry<V> next)

Method Detail

getKey	back to summary
public int getKey()

getValue	back to summary
public V getValue()

org.jruby.util.collections back to summary

private Class IntHashMap.EntryIterator

Class Inheritance

extends IntHashMap<V>.HashIterator<IntHashMap.Entry<V>>

java.lang.Object
org.jruby.util.collections.IntHashMap.HashIterator
org.jruby.util.collections.IntHashMap.EntryIterator

Field Summary

Inherited from org.jruby.util.collections.IntHashMap.HashIterator:: index next

Constructor Summary

Access	Constructor and Description
private	EntryIterator()

Method Summary

Modifier and Type	Method and Description
public IntHashMap.Entry<V>	next() Implements java.util.Iterator.next. Returns the next element in the iteration.

Inherited from org.jruby.util.collections.IntHashMap.HashIterator:: hasNext nextEntry remove

Constructor Detail

EntryIterator	back to summary
private EntryIterator()

Method Detail

next	back to summary
public IntHashMap.Entry<V> next() Implements java.util.Iterator.next. Doc from java.util.Iterator.next. Returns the next element in the iteration. Returns:IntHashMap.Entry<V> the next element in the iteration

back to summary

public IntHashMap.Entry<V> next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

Returns:IntHashMap.Entry<V>: the next element in the iteration

org.jruby.util.collections back to summary

private Class IntHashMap.EntrySet

Class Inheritance

extends AbstractSet<IntHashMap.Entry<V>>

java.lang.Object
java.util.AbstractCollection
java.util.AbstractSet
org.jruby.util.collections.IntHashMap.EntrySet

Constructor Summary

Access	Constructor and Description
private	EntrySet()

Method Summary

Modifier and Type	Method and Description
public void	clear() Overrides java.util.AbstractCollection.clear. Implements java.util.Set.clear, java.util.Collection.clear. Removes all of the elements from this set (optional operation).
public boolean	contains(Object element whose presence in this set is to be tested o) Overrides java.util.AbstractCollection.contains. Implements java.util.Set.contains, java.util.Collection.contains. Returns `true` if this set contains the specified element.
public Iterator<IntHashMap.Entry<V>>	iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Returns an iterator over the elements in this set.
public boolean	remove(Object object to be removed from this set, if present o) Overrides java.util.AbstractCollection.remove. Implements java.util.Set.remove, java.util.Collection.remove. Removes the specified element from this set if it is present (optional operation).
public int	size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Set.size, java.util.Collection.size. Returns the number of elements in this set (its cardinality).

Inherited from java.util.AbstractSet:: equals hashCode removeAll

Constructor Detail

EntrySet	back to summary
private EntrySet()

Method Detail

clear

back to summary

public void clear()

Overrides java.util.AbstractCollection.clear.

Implements java.util.Set.clear, java.util.Collection.clear.

Doc from java.util.Set.clear.

Removes all of the elements from this set (optional operation). The set will be empty after this call returns.

Annotations

@Override

contains back to summary

public boolean contains(Object o)

Overrides java.util.AbstractCollection.contains.

Implements java.util.Set.contains, java.util.Collection.contains.

Doc from java.util.Set.contains.

Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that Objects.equals(o, e).

Parameters

o:Object: element whose presence in this set is to be tested

Returns:boolean

true if this set contains the specified element

Annotations

@Override

iterator

back to summary

public Iterator<IntHashMap.Entry<V>> iterator()

Implements abstract java.util.AbstractCollection.iterator.

Implements java.util.Set.iterator, java.util.Collection.iterator.

Doc from java.util.Set.iterator.

Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee).

Returns:Iterator<IntHashMap.Entry<V>>: an iterator over the elements in this set

remove back to summary

public boolean remove(Object o)

Overrides java.util.AbstractCollection.remove.

Implements java.util.Set.remove, java.util.Collection.remove.

Doc from java.util.Set.remove.

Removes the specified element from this set if it is present (optional operation). More formally, removes an element e such that Objects.equals(o, e), if this set contains such an element. Returns true if this set contained the element (or equivalently, if this set changed as a result of the call). (This set will not contain the element once the call returns.)

Parameters

o:Object: object to be removed from this set, if present

Returns:boolean

true if this set contained the specified element

Annotations

@Override

size back to summary

public int size()

Implements abstract java.util.AbstractCollection.size.

Implements java.util.Set.size, java.util.Collection.size.

Doc from java.util.Set.size.

Returns the number of elements in this set (its cardinality). If this set contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Returns:int: the number of elements in this set (its cardinality)

org.jruby.util.collections back to summary

private abstract Class IntHashMap.HashIterator<T>

Class Inheritance

extends Object
implements Iterator<T>

java.lang.Object
org.jruby.util.collections.IntHashMap.HashIterator

All Implemented Interfaces

java.util.Iterator

Known Direct Subclasses

org.jruby.util.collections.IntHashMap.ValueIterator, org.jruby.util.collections.IntHashMap.KeyIterator, org.jruby.util.collections.IntHashMap.EntryIterator

Field Summary

Modifier and Type	Field and Description
pack-priv int	index
pack-priv IntHashMap.Entry<V>	next

Constructor Summary

Access	Constructor and Description
pack-priv	HashIterator()

Method Summary

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
pack-priv IntHashMap.Entry<V>	nextEntry()
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

index	back to summary
pack-priv int index

next	back to summary
pack-priv IntHashMap.Entry<V> next

Constructor Detail

HashIterator	back to summary
pack-priv HashIterator()

Method Detail

hasNext back to summary

public boolean hasNext()

Implements java.util.Iterator.hasNext.

Doc from java.util.Iterator.hasNext.

Returns true if the iteration has more elements. (In other words, returns true if next would return an element rather than throwing an exception.)

Returns:boolean: true if the iteration has more elements

nextEntry	back to summary
pack-priv IntHashMap.Entry<V> nextEntry()

remove back to summary

public void remove()

Overrides default java.util.Iterator.remove.

Doc from java.util.Iterator.remove.

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next.

The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.

The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.

org.jruby.util.collections back to summary

private Class IntHashMap.KeyIterator

Class Inheritance

extends IntHashMap<V>.HashIterator<Integer>

java.lang.Object
org.jruby.util.collections.IntHashMap.HashIterator
org.jruby.util.collections.IntHashMap.KeyIterator

Field Summary

Inherited from org.jruby.util.collections.IntHashMap.HashIterator:: index next

Constructor Summary

Access	Constructor and Description
private	KeyIterator()

Method Summary

Modifier and Type	Method and Description
public Integer	next() Implements java.util.Iterator.next. Returns the next element in the iteration.

Inherited from org.jruby.util.collections.IntHashMap.HashIterator:: hasNext nextEntry remove

Constructor Detail

KeyIterator	back to summary
private KeyIterator()

Method Detail

back to summary

public Integer next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

Returns:Integer: the next element in the iteration

org.jruby.util.collections back to summary

private Class IntHashMap.KeySet

Class Inheritance

extends AbstractSet<Integer>

java.lang.Object
java.util.AbstractCollection
java.util.AbstractSet
org.jruby.util.collections.IntHashMap.KeySet

Constructor Summary

Access	Constructor and Description
private	KeySet()

Method Summary

Modifier and Type	Method and Description
public void	clear() Overrides java.util.AbstractCollection.clear. Implements java.util.Set.clear, java.util.Collection.clear. Removes all of the elements from this set (optional operation).
public boolean	contains(Object element whose presence in this set is to be tested o) Overrides java.util.AbstractCollection.contains. Implements java.util.Set.contains, java.util.Collection.contains. Returns `true` if this set contains the specified element.
public Iterator<Integer>	iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Returns an iterator over the elements in this set.
public boolean	remove(Object object to be removed from this set, if present o) Overrides java.util.AbstractCollection.remove. Implements java.util.Set.remove, java.util.Collection.remove. Removes the specified element from this set if it is present (optional operation).
public int	size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Set.size, java.util.Collection.size. Returns the number of elements in this set (its cardinality).

Inherited from java.util.AbstractSet:: equals hashCode removeAll

Constructor Detail

KeySet	back to summary
private KeySet()

Method Detail

clear

back to summary

public void clear()

Overrides java.util.AbstractCollection.clear.

Implements java.util.Set.clear, java.util.Collection.clear.

Doc from java.util.Set.clear.

Removes all of the elements from this set (optional operation). The set will be empty after this call returns.

Annotations

@Override

contains back to summary

public boolean contains(Object o)

Overrides java.util.AbstractCollection.contains.

Implements java.util.Set.contains, java.util.Collection.contains.

Doc from java.util.Set.contains.

Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that Objects.equals(o, e).

Parameters

o:Object: element whose presence in this set is to be tested

Returns:boolean

true if this set contains the specified element

Annotations

@Override

iterator

back to summary

public Iterator<Integer> iterator()

Implements abstract java.util.AbstractCollection.iterator.

Implements java.util.Set.iterator, java.util.Collection.iterator.

Doc from java.util.Set.iterator.

Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee).

Returns:Iterator<Integer>: an iterator over the elements in this set

remove back to summary

public boolean remove(Object o)

Overrides java.util.AbstractCollection.remove.

Implements java.util.Set.remove, java.util.Collection.remove.

Doc from java.util.Set.remove.

Parameters

o:Object: object to be removed from this set, if present

Returns:boolean

true if this set contained the specified element

Annotations

@Override

size back to summary

public int size()

Implements abstract java.util.AbstractCollection.size.

Implements java.util.Set.size, java.util.Collection.size.

Doc from java.util.Set.size.

Returns the number of elements in this set (its cardinality). If this set contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Returns:int: the number of elements in this set (its cardinality)

org.jruby.util.collections back to summary

private final Class IntHashMap.NullMap<U>

Class Inheritance

extends IntHashMap<U>

java.lang.Object
org.jruby.util.collections.IntHashMap
org.jruby.util.collections.IntHashMap.NullMap

Field Summary

Modifier and Type	Field and Description
pack-priv static final IntHashMap.NullMap<U>	INSTANCE

Inherited from org.jruby.util.collections.IntHashMap:: keySet values

Constructor Summary

Access	Constructor and Description
private	NullMap()

Method Summary

Modifier and Type	Method and Description
public boolean	contains(Object value) Overrides org.jruby.util.collections.IntHashMap.contains.
public boolean	containsKey(int key) Overrides org.jruby.util.collections.IntHashMap.containsKey.
public U	get(int key) Overrides org.jruby.util.collections.IntHashMap.get.
public U	put(int key, U value) Overrides org.jruby.util.collections.IntHashMap.put.
protected void	rehash() Overrides org.jruby.util.collections.IntHashMap.rehash.
public U	remove(int key) Overrides org.jruby.util.collections.IntHashMap.remove.

Inherited from org.jruby.util.collections.IntHashMap:: clear clone containsValue entrySet forEach getEntry isEmpty keySet newEntryIterator newKeyIterator newValueIterator nullMap size toString values

Field Detail

INSTANCE	back to summary
pack-priv static final IntHashMap.NullMap<U> INSTANCE

Constructor Detail

NullMap	back to summary
private NullMap()

Method Detail

contains

back to summary

public boolean contains(Object value)

Overrides org.jruby.util.collections.IntHashMap.contains.

Annotations

@Override

containsKey

back to summary

public boolean containsKey(int key)

Overrides org.jruby.util.collections.IntHashMap.containsKey.

Annotations

@Override

get

back to summary

public U get(int key)

Overrides org.jruby.util.collections.IntHashMap.get.

Annotations

@Override

put

back to summary

public U put(int key, U value)

Overrides org.jruby.util.collections.IntHashMap.put.

Annotations

@Override

rehash

back to summary

protected void rehash()

Overrides org.jruby.util.collections.IntHashMap.rehash.

Annotations

@Override

remove

back to summary

public U remove(int key)

Overrides org.jruby.util.collections.IntHashMap.remove.

Annotations

@Override

org.jruby.util.collections back to summary

private Class IntHashMap.ValueIterator

Class Inheritance

extends IntHashMap<V>.HashIterator<V>

java.lang.Object
org.jruby.util.collections.IntHashMap.HashIterator
org.jruby.util.collections.IntHashMap.ValueIterator

Field Summary

Inherited from org.jruby.util.collections.IntHashMap.HashIterator:: index next

Constructor Summary

Access	Constructor and Description
private	ValueIterator()

Method Summary

Modifier and Type	Method and Description
public V	next() Implements java.util.Iterator.next. Returns the next element in the iteration.

Inherited from org.jruby.util.collections.IntHashMap.HashIterator:: hasNext nextEntry remove

Constructor Detail

ValueIterator	back to summary
private ValueIterator()

Method Detail

back to summary

public V next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

Returns:V: the next element in the iteration

org.jruby.util.collections back to summary

private Class IntHashMap.Values

Class Inheritance

extends AbstractCollection<V>

java.lang.Object
java.util.AbstractCollection
org.jruby.util.collections.IntHashMap.Values

Constructor Summary

Access	Constructor and Description
private	Values()

Method Summary

Modifier and Type	Method and Description
public void	clear() Overrides java.util.AbstractCollection.clear. Implements java.util.Collection.clear. Removes all of the elements from this collection (optional operation).
public boolean	contains(Object element whose presence in this collection is to be tested o) Overrides java.util.AbstractCollection.contains. Implements java.util.Collection.contains. Returns `true` if this collection contains the specified element.
public Iterator<V>	iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Collection.iterator. Returns an iterator over the elements contained in this collection.
public int	size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Collection.size. Returns the number of elements in this collection.

Inherited from java.util.AbstractCollection:: add addAll containsAll isEmpty remove removeAll retainAll toArray toArray toString

Constructor Detail

Values	back to summary
private Values()

Method Detail

clear

back to summary

public void clear()

Overrides java.util.AbstractCollection.clear.

Implements java.util.Collection.clear.

Doc from java.util.AbstractCollection.clear.

Removes all of the elements from this collection (optional operation). The collection will be empty after this method returns.

Annotations

@Override

contains back to summary

public boolean contains(Object o)

Overrides java.util.AbstractCollection.contains.

Implements java.util.Collection.contains.

Doc from java.util.AbstractCollection.contains.

Returns true if this collection contains the specified element. More formally, returns true if and only if this collection contains at least one element e such that Objects.equals(o, e).

Parameters

o:Object

Doc from java.util.Collection.contains.

element whose presence in this collection is to be tested

Returns:boolean

Doc from java.util.Collection.contains.

true if this collection contains the specified element

Annotations

@Override

iterator

back to summary

public Iterator<V> iterator()

Implements abstract java.util.AbstractCollection.iterator.

Implements java.util.Collection.iterator.

Doc from java.util.AbstractCollection.iterator.

Returns an iterator over the elements contained in this collection.

Returns:Iterator<V>: an iterator over the elements contained in this collection

size back to summary

public int size()

Implements abstract java.util.AbstractCollection.size.

Implements java.util.Collection.size.

Doc from java.util.Collection.size.

Returns the number of elements in this collection. If this collection contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Returns:int: the number of elements in this collection

public Class IntHashMap<V>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public Class IntHashMap.Entry<V>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class IntHashMap.EntryIterator

Field Summary

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private Class IntHashMap.EntrySet

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private abstract Class IntHashMap.HashIterator<T>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class IntHashMap.KeyIterator

Field Summary

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private Class IntHashMap.KeySet

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private final Class IntHashMap.NullMap<U>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class IntHashMap.ValueIterator

Field Summary

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private Class IntHashMap.Values

Constructor Summary

Method Summary

Constructor Detail

Method Detail