Modifier and Type	Class and Description
public static class	ArrayMap.Entries<K, V>
public static class	ArrayMap.Keys<K>
public static class	ArrayMap.Values<V>

Modifier and Type	Field and Description
private transient ArrayMap.Entries<K, V>	entries1
private transient ArrayMap.Entries<K, V>	entries2
public K[]	keys
private transient ArrayMap.Keys<K>	keys1
private transient ArrayMap.Keys<K>	keys2
public boolean	ordered
public int	size
public V[]	values
private transient ArrayMap.Values<V>	values1
private transient ArrayMap.Values<V>	values2

Constructor Summary

Access	Constructor and Description
public	ArrayMap() Creates an ordered map with a capacity of 16.
public	ArrayMap(int capacity) Creates an ordered map with the specified capacity.
public	ArrayMap(boolean If false, methods that remove elements may change the order of other elements in the arrays, which avoids a memory copy. ordered, int Any elements added beyond this will cause the backing arrays to be grown. capacity)
public	ArrayMap(boolean If false, methods that remove elements may change the order of other elements in the arrays, which avoids a memory copy. ordered, int Any elements added beyond this will cause the backing arrays to be grown. capacity, ArraySupplier<K[]> keyArraySupplier, ArraySupplier<V[]> valueArraySupplier) Creates a new map with `keys` and `values` with the specified supplier.
public	ArrayMap(ArraySupplier<K[]> keyArraySupplier, ArraySupplier<V[]> valueArraySupplier) Creates an ordered map with `keys` and `values` with the specified supplier and a capacity of 16.
public	ArrayMap(boolean If false, methods that remove elements may change the order of other elements in the arrays, which avoids a memory copy. ordered, int Any elements added beyond this will cause the backing arrays to be grown. capacity, Class<T> keyArrayType, Class<T> valueArrayType) Deprecated Use `ArrayMap#ArrayMap(boolean, int, ArraySupplier, ArraySupplier)` instead Creates a new map with `keys` and `values` of the specified type.
public	ArrayMap(Class<T> keyArrayType, Class<T> valueArrayType) Deprecated Use `ArrayMap#ArrayMap(ArraySupplier, ArraySupplier)` instead Creates an ordered map with `keys` and `values` of the specified type and a capacity of 16.
public	ArrayMap(ArrayMap<K, V> array) Creates a new map containing the elements in the specified map.

Method Summary

Modifier and Type	Method and Description
public void	clear(int maximumCapacity) Clears the map and reduces the size of the backing arrays to be the specified capacity if they are larger.
public void	clear()
public boolean	containsKey(K key)
public boolean	containsValue(V value, boolean If true, == comparison will be used. If false, .equals() comparison will be used. identity)
public void	ensureCapacity(int additionalCapacity) Increases the size of the backing arrays to accommodate the specified number of additional entries.
public ArrayMap.Entries<K, V>	entries() Returns an iterator for the entries in the map.
public boolean	equals(Object obj) Overrides java.lang.Object.equals. Indicates whether some other object is "equal to" this one.
public boolean	equalsIdentity(Object obj) Uses == for comparison of each value.
public K	firstKey()
public V	firstValue()
public V	get(K key) Returns the value (which may be null) for the specified key, or null if the key is not in the map.
public V	get(K key, V defaultValue) Returns the value (which may be null) for the specified key, or the default value if the key is not in the map.
public K	getKey(V value, boolean If true, == comparison will be used. If false, .equals() comparison will be used. identity) Returns the key for the specified value.
public K	getKeyAt(int index)
public V	getValueAt(int index)
public int	hashCode() Overrides java.lang.Object.hashCode. Returns a hash code value for this object.
public int	indexOfKey(K key)
public int	indexOfValue(V value, boolean identity)
public void	insert(int index, K key, V value)
public boolean	isEmpty() Returns true if the map is empty.
public Iterator<ObjectMap.Entry<K, V>>	iterator() Implements java.lang.Iterable.iterator. Returns an iterator over elements of type `T`.
public ArrayMap.Keys<K>	keys() Returns an iterator for the keys in the map.
public boolean	notEmpty() Returns true if the map has one or more items.
public K	peekKey() Returns the last key.
public V	peekValue() Returns the last value.
public int	put(K key, V value)
public int	put(K key, V value, int index)
public void	putAll(ArrayMap<? extends K, ? extends V> map)
public void	putAll(ArrayMap<? extends K, ? extends V> map, int offset, int length)
public V	putMissing(K key, V value)
public void	removeIndex(int index) Removes and returns the key/values pair at the specified index.
public V	removeKey(K key)
public boolean	removeValue(V value, boolean identity)
protected void	resize(int newSize)
public void	reverse()
public void	setKey(int index, K key)
public void	setValue(int index, V value)
public void	shrink() Reduces the size of the backing arrays to the size of the actual number of entries.
public void	shuffle()
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.
public void	truncate(int newSize) Reduces the size of the arrays to the specified size.
public ArrayMap.Values<V>	values() Returns an iterator for the values in the map.

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

Field Detail

entries1	back to summary
private transient ArrayMap.Entries<K, V> entries1

entries2	back to summary
private transient ArrayMap.Entries<K, V> entries2

keys	back to summary
public K[] keys

keys1	back to summary
private transient ArrayMap.Keys<K> keys1

keys2	back to summary
private transient ArrayMap.Keys<K> keys2

ordered	back to summary
public boolean ordered

size	back to summary
public int size

values	back to summary
public V[] values

values1	back to summary
private transient ArrayMap.Values<V> values1

values2	back to summary
private transient ArrayMap.Values<V> values2

Constructor Detail

ArrayMap	back to summary
public ArrayMap() Creates an ordered map with a capacity of 16.

ArrayMap	back to summary
public ArrayMap(int capacity) Creates an ordered map with the specified capacity.

ArrayMap	back to summary
public ArrayMap(boolean ordered, int capacity) Parameters ordered:boolean If false, methods that remove elements may change the order of other elements in the arrays, which avoids a memory copy. capacity:int Any elements added beyond this will cause the backing arrays to be grown.

ArrayMap back to summary

ArrayMap	back to summary
public ArrayMap(boolean ordered, int capacity, ArraySupplier<K[]> keyArraySupplier, ArraySupplier<V[]> valueArraySupplier) Creates a new map with `keys` and `values` with the specified supplier. Parameters ordered:boolean If false, methods that remove elements may change the order of other elements in the arrays, which avoids a memory copy. capacity:int Any elements added beyond this will cause the backing arrays to be grown.

public ArrayMap(boolean ordered, int capacity, ArraySupplier<K[]> keyArraySupplier, ArraySupplier<V[]> valueArraySupplier)

Creates a new map with keys and values with the specified supplier.

Parameters

ordered:boolean: If false, methods that remove elements may change the order of other elements in the arrays, which avoids a memory copy.
capacity:int: Any elements added beyond this will cause the backing arrays to be grown.

ArrayMap	back to summary
public ArrayMap(ArraySupplier<K[]> keyArraySupplier, ArraySupplier<V[]> valueArraySupplier) Creates an ordered map with `keys` and `values` with the specified supplier and a capacity of 16.

ArrayMap back to summary

ArrayMap	back to summary
public ArrayMap(boolean ordered, int capacity, Class<T> keyArrayType, Class<T> valueArrayType) Deprecated Use `ArrayMap#ArrayMap(boolean, int, ArraySupplier, ArraySupplier)` instead Creates a new map with `keys` and `values` of the specified type. Parameters ordered:boolean If false, methods that remove elements may change the order of other elements in the arrays, which avoids a memory copy. capacity:int Any elements added beyond this will cause the backing arrays to be grown. Annotations @Deprecated

public ArrayMap(boolean ordered, int capacity, Class<T> keyArrayType, Class<T> valueArrayType)

Deprecated

Use ArrayMap#ArrayMap(boolean, int, ArraySupplier, ArraySupplier) instead

Creates a new map with keys and values of the specified type.

Parameters

ordered:boolean: If false, methods that remove elements may change the order of other elements in the arrays, which avoids a memory copy.
capacity:int: Any elements added beyond this will cause the backing arrays to be grown.

Annotations

@Deprecated

ArrayMap back to summary

ArrayMap	back to summary
public ArrayMap(Class<T> keyArrayType, Class<T> valueArrayType) Deprecated Use `ArrayMap#ArrayMap(ArraySupplier, ArraySupplier)` instead Creates an ordered map with `keys` and `values` of the specified type and a capacity of 16. Annotations @Deprecated

public ArrayMap(Class<T> keyArrayType, Class<T> valueArrayType)

Deprecated

Use ArrayMap#ArrayMap(ArraySupplier, ArraySupplier) instead

Creates an ordered map with keys and values of the specified type and a capacity of 16.

Annotations

@Deprecated

ArrayMap	back to summary
public ArrayMap(ArrayMap<K, V> array) Creates a new map containing the elements in the specified map. The new map will have the same type of backing arrays and will be ordered if the specified map is ordered. The capacity is set to the number of elements, so any subsequent elements added will cause the backing arrays to be grown.

Method Detail

clear	back to summary
public void clear(int maximumCapacity) Clears the map and reduces the size of the backing arrays to be the specified capacity if they are larger.

clear	back to summary
public void clear()

containsKey	back to summary
public boolean containsKey(K key)

containsValue	back to summary
public boolean containsValue(V value, boolean identity) Parameters identity:boolean If true, == comparison will be used. If false, .equals() comparison will be used.

ensureCapacity	back to summary
public void ensureCapacity(int additionalCapacity) Increases the size of the backing arrays to accommodate the specified number of additional entries. Useful before adding many entries to avoid multiple backing array resizes.

entries back to summary

entries	back to summary
public ArrayMap.Entries<K, V> entries() Returns an iterator for the entries in the map. Remove is supported. If `Collections#allocateIterators` is false, the same iterator instance is returned each time this method is called. Use the `Entries` constructor for nested or multithreaded iteration. See Also `Collections#allocateIterators`

public ArrayMap.Entries<K, V> entries()

Returns an iterator for the entries in the map. Remove is supported.

If Collections#allocateIterators is false, the same iterator instance is returned each time this method is called. Use the Entries constructor for nested or multithreaded iteration.

See Also: Collections#allocateIterators

equals back to summary

equals	back to summary
public boolean equals(Object obj) Overrides java.lang.Object.equals. Doc from java.lang.Object.equals. Indicates whether some other object is "equal to" this one. The `equals` method implements an equivalence relation on non-null object references: It is reflexive: for any non-null reference value `x`, `x.equals(x)` should return `true`. It is symmetric: for any non-null reference values `x` and `y`, `x.equals(y)` should return `true` if and only if `y.equals(x)` returns `true`. It is transitive: for any non-null reference values `x`, `y`, and `z`, if `x.equals(y)` returns `true` and `y.equals(z)` returns `true`, then `x.equals(z)` should return `true`. It is consistent: for any non-null reference values `x` and `y`, multiple invocations of `x.equals(y)` consistently return `true` or consistently return `false`, provided no information used in `equals` comparisons on the objects is modified. For any non-null reference value `x`, `x.equals(null)` should return `false`. An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

public boolean equals(Object obj)

Overrides java.lang.Object.equals.

Doc from java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

It is reflexive: for any non-null reference value x, x.equals(x) should return true.
It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
For any non-null reference value x, x.equals(null) should return false.

An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

equalsIdentity	back to summary
public boolean equalsIdentity(Object obj) Uses == for comparison of each value.

firstKey	back to summary
public K firstKey()

firstValue	back to summary
public V firstValue()

get	back to summary
public V get(K key) Returns the value (which may be null) for the specified key, or null if the key is not in the map. Note this does a .equals() comparison of each key in reverse order until the specified key is found. Annotations @Null

get

back to summary

public V get(K key)

Returns the value (which may be null) for the specified key, or null if the key is not in the map. Note this does a .equals() comparison of each key in reverse order until the specified key is found.

Annotations

@Null

get	back to summary
public V get(K key, V defaultValue) Returns the value (which may be null) for the specified key, or the default value if the key is not in the map. Note this does a .equals() comparison of each key in reverse order until the specified key is found. Annotations @Null

get

back to summary

public V get(K key, V defaultValue)

Returns the value (which may be null) for the specified key, or the default value if the key is not in the map. Note this does a .equals() comparison of each key in reverse order until the specified key is found.

Annotations

@Null

getKey	back to summary
public K getKey(V value, boolean identity) Returns the key for the specified value. Note this does a comparison of each value in reverse order until the specified value is found. Parameters identity:boolean If true, == comparison will be used. If false, .equals() comparison will be used. Annotations @Null

getKey

back to summary

public K getKey(V value, boolean identity)

Returns the key for the specified value. Note this does a comparison of each value in reverse order until the specified value is found.

Parameters

identity:boolean: If true, == comparison will be used. If false, .equals() comparison will be used.

Annotations

@Null

getKeyAt	back to summary
public K getKeyAt(int index)

getValueAt	back to summary
public V getValueAt(int index)

hashCode back to summary

hashCode	back to summary
public int hashCode() Overrides java.lang.Object.hashCode. Doc from java.lang.Object.hashCode. Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by `java.util.HashMap`. The general contract of `hashCode` is: Whenever it is invoked on the same object more than once during an execution of a Java application, the `hashCode` method must consistently return the same integer, provided no information used in `equals` comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. If two objects are equal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce the same integer result. It is not required that if two objects are unequal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

public int hashCode()

Overrides java.lang.Object.hashCode.

Doc from java.lang.Object.hashCode.

Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

indexOfKey	back to summary
public int indexOfKey(K key)

indexOfValue	back to summary
public int indexOfValue(V value, boolean identity)

insert	back to summary
public void insert(int index, K key, V value)

isEmpty	back to summary
public boolean isEmpty() Returns true if the map is empty.

iterator back to summary

iterator	back to summary
public Iterator<ObjectMap.Entry<K, V>> iterator() Implements java.lang.Iterable.iterator. Doc from java.lang.Iterable.iterator. Returns an iterator over elements of type `T`.

public Iterator<ObjectMap.Entry<K, V>> iterator()

Implements java.lang.Iterable.iterator.

Doc from java.lang.Iterable.iterator.

Returns an iterator over elements of type T.

keys back to summary

keys	back to summary
public ArrayMap.Keys<K> keys() Returns an iterator for the keys in the map. Remove is supported. If `Collections#allocateIterators` is false, the same iterator instance is returned each time this method is called. Use the `Entries` constructor for nested or multithreaded iteration. See Also `Collections#allocateIterators`

public ArrayMap.Keys<K> keys()

Returns an iterator for the keys in the map. Remove is supported.

If Collections#allocateIterators is false, the same iterator instance is returned each time this method is called. Use the Entries constructor for nested or multithreaded iteration.

See Also: Collections#allocateIterators

notEmpty	back to summary
public boolean notEmpty() Returns true if the map has one or more items.

peekKey	back to summary
public K peekKey() Returns the last key.

peekValue	back to summary
public V peekValue() Returns the last value.

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

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

putAll	back to summary
public void putAll(ArrayMap<? extends K, ? extends V> map)

putAll	back to summary
public void putAll(ArrayMap<? extends K, ? extends V> map, int offset, int length)

putMissing	back to summary
public V putMissing(K key, V value) Annotations @Null

removeIndex	back to summary
public void removeIndex(int index) Removes and returns the key/values pair at the specified index.

removeKey	back to summary
public V removeKey(K key) Annotations @Null

removeValue	back to summary
public boolean removeValue(V value, boolean identity)

resize	back to summary
protected void resize(int newSize)

reverse	back to summary
public void reverse()

setKey	back to summary
public void setKey(int index, K key)

setValue	back to summary
public void setValue(int index, V value)

shrink	back to summary
public void shrink() Reduces the size of the backing arrays to the size of the actual number of entries. This is useful to release memory when many items have been removed, or if it is known that more entries will not be added.

shuffle	back to summary
public void shuffle()

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.

truncate	back to summary
public void truncate(int newSize) Reduces the size of the arrays to the specified size. If the arrays are already smaller than the specified size, no action is taken.

values back to summary

public ArrayMap.Values<V> values()

Returns an iterator for the values in the map. Remove is supported.

If Collections#allocateIterators is false, the same iterator instance is returned each time this method is called. Use the Entries constructor for nested or multithreaded iteration.

See Also: Collections#allocateIterators

com.badlogic.gdx.utils back to summary

public Class ArrayMap.Entries<K, V>

Class Inheritance

extends Object
implements Iterable<ObjectMap.Entry<K, V>>, Iterator<ObjectMap.Entry<K, V>>

java.lang.Object
com.badlogic.gdx.utils.ArrayMap.Entries

All Implemented Interfaces

java.util.Iterator, java.lang.Iterable

Field Summary

Modifier and Type	Field and Description
pack-priv ObjectMap.Entry<K, V>	entry
pack-priv int	index
private final ArrayMap<K, V>	map
pack-priv boolean	valid

Constructor Summary

Access	Constructor and Description
public	Entries(ArrayMap<K, V> map)

Method Summary

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public Iterator<ObjectMap.Entry<K, V>>	iterator() Implements java.lang.Iterable.iterator. Returns an iterator over elements of type `T`.
public ObjectMap.Entry<K, V>	next() Implements java.util.Iterator.next. Note the same entry instance is returned each time this method is called.
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).
public void	reset()

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

Field Detail

entry	back to summary
pack-priv ObjectMap.Entry<K, V> entry

index	back to summary
pack-priv int index

map	back to summary
private final ArrayMap<K, V> map

valid	back to summary
pack-priv boolean valid

Constructor Detail

Entries	back to summary
public Entries(ArrayMap<K, V> map)

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.)

iterator back to summary

public Iterator<ObjectMap.Entry<K, V>> iterator()

Implements java.lang.Iterable.iterator.

Doc from java.lang.Iterable.iterator.

Returns an iterator over elements of type T.

back to summary

public ObjectMap.Entry<K, V> next()

Implements java.util.Iterator.next.

Note the same entry instance is returned each time this method is called.

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.

reset	back to summary
public void reset()

com.badlogic.gdx.utils back to summary

public Class ArrayMap.Keys<K>

Class Inheritance

extends Object
implements Iterable<K>, Iterator<K>

java.lang.Object
com.badlogic.gdx.utils.ArrayMap.Keys

All Implemented Interfaces

java.util.Iterator, java.lang.Iterable

Field Summary

Modifier and Type	Field and Description
pack-priv int	index
private final ArrayMap<K, Object>	map
pack-priv boolean	valid

Constructor Summary

Access	Constructor and Description
public	Keys(ArrayMap<K, Object> map)

Method Summary

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public Iterator<K>	iterator() Implements java.lang.Iterable.iterator. Returns an iterator over elements of type `T`.
public K	next() Implements java.util.Iterator.next. Returns the next element in the iteration.
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).
public void	reset()
public Array<K>	toArray()
public Array<K>	toArray(Array<T> array)

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

map	back to summary
private final ArrayMap<K, Object> map

valid	back to summary
pack-priv boolean valid

Constructor Detail

Keys	back to summary
public Keys(ArrayMap<K, Object> map)

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.)

iterator back to summary

public Iterator<K> iterator()

Implements java.lang.Iterable.iterator.

Doc from java.lang.Iterable.iterator.

Returns an iterator over elements of type T.

back to summary

public K next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

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 this method is called after a call to the forEachRemaining method.

reset	back to summary
public void reset()

toArray	back to summary
public Array<K> toArray()

toArray	back to summary
public Array<K> toArray(Array<T> array)

com.badlogic.gdx.utils back to summary

public Class ArrayMap.Values<V>

Class Inheritance

extends Object
implements Iterable<V>, Iterator<V>

java.lang.Object
com.badlogic.gdx.utils.ArrayMap.Values

All Implemented Interfaces

java.util.Iterator, java.lang.Iterable

Field Summary

Modifier and Type	Field and Description
pack-priv int	index
private final ArrayMap<Object, V>	map
pack-priv boolean	valid

Constructor Summary

Access	Constructor and Description
public	Values(ArrayMap<Object, V> map)

Method Summary

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
public Iterator<V>	iterator() Implements java.lang.Iterable.iterator. Returns an iterator over elements of type `T`.
public V	next() Implements java.util.Iterator.next. Returns the next element in the iteration.
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).
public void	reset()
public Array<V>	toArray()
public Array<V>	toArray(Array<T> array)

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

map	back to summary
private final ArrayMap<Object, V> map

valid	back to summary
pack-priv boolean valid

Constructor Detail

Values	back to summary
public Values(ArrayMap<Object, V> map)

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.)

iterator back to summary

public Iterator<V> iterator()

Implements java.lang.Iterable.iterator.

Doc from java.lang.Iterable.iterator.

Returns an iterator over elements of type T.

back to summary

public V next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

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 this method is called after a call to the forEachRemaining method.

reset	back to summary
public void reset()

toArray	back to summary
public Array<V> toArray()

toArray	back to summary
public Array<V> toArray(Array<T> array)

public Class ArrayMap<K, V>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public Class ArrayMap.Entries<K, V>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public Class ArrayMap.Keys<K>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public Class ArrayMap.Values<V>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail