| java.lang.Object
 wicket.util.collections.IntHashMap
| IntHashMap | | public class IntHashMap implements Cloneable,Serializable(Code) | | This is a int hashmap that has the exact same features and interface as a
normal Map except that the key is directly an integer. So no hash is
calculated or key object is stored.
author:
jcompagner |
| Inner Class :public static class Entry | |
| Field Summary | |
| final static int | DEFAULT_INITIAL_CAPACITY
The default initial capacity - MUST be a power of two. | | final static float | DEFAULT_LOAD_FACTOR
The load factor used when none specified in constructor. | | final static int | MAXIMUM_CAPACITY
The maximum capacity, used if a higher value is implicitly specified by
either of the constructors with arguments. | | transient volatile Set | keySet
| | final float | loadFactor
The load factor for the hash table. | | transient volatile int | modCount
The number of times this HashMap has been structurally modified
Structural modifications are those that change the number of mappings in
the HashMap or otherwise modify its internal structure (e.g., rehash).
This field is used to make iterators on Collection-views of the HashMap
fail-fast. | | transient int | size
The number of key-value mappings contained in this identity hash map. | | transient Entry[] | table
The table, resized as necessary. | | int | threshold
The next size value at which to resize (capacity * load factor). | | transient volatile Collection | values
|
| Constructor Summary | |
| public | IntHashMap(int initialCapacity, float loadFactor)
Constructs an empty HashMap with the specified initial
capacity and load factor. | | public | IntHashMap(int initialCapacity)
Constructs an empty HashMap with the specified initial
capacity and the default load factor (0.75). | | public | IntHashMap()
Constructs an empty HashMap with the default initial capacity
(16) and the default load factor (0.75). |
| Method Summary | |
| void | addEntry(int key, Object value, int bucketIndex)
Add a new entry with the specified key, value and hash code to the
specified bucket. | | int | capacity()
| | public void | clear()
Removes all mappings from this map. | | public Object | clone()
Returns a shallow copy of this HashMap instance: the keys and
values themselves are not cloned. | | public boolean | containsKey(int key)
Returns true if this map contains a mapping for the specified
key. | | public boolean | containsValue(Object value)
Returns true if this map maps one or more keys to the
specified value.
Parameters:
value - value whose presence in this map is to be tested. | | void | createEntry(int key, Object value, int bucketIndex)
Like addEntry except that this version is used when creating entries as
part of Map construction or "pseudo-construction" (cloning,
deserialization). | | public Set | entrySet()
Returns a collection view of the mappings contained in this map. | | public Object | get(int key)
Returns the value to which the specified key is mapped in this identity
hash map, or null if the map contains no mapping for this key.
A return value of null does not necessarily indicate
that the map contains no mapping for the key; it is also possible that
the map explicitly maps the key to null. | | Entry | getEntry(int key)
Returns the entry associated with the specified key in the HashMap. | | static int | indexFor(int h, int length)
Returns index for hash code h. | | void | init()
Initialization hook for subclasses. | | public boolean | isEmpty()
Returns true if this map contains no key-value mappings. | | public Set | keySet()
Returns a set view of the keys contained in this map. | | float | loadFactor()
| | Iterator | newEntryIterator()
| | Iterator | newKeyIterator()
| | Iterator | newValueIterator()
| | public Object | put(int key, Object value)
Associates the specified value with the specified key in this map. | | public void | putAll(IntHashMap m)
Copies all of the mappings from the specified map to this map These
mappings will replace any mappings that this map had for any of the keys
currently in the specified map. | | void | putAllForCreate(IntHashMap m)
| | public Object | remove(int key)
Removes the mapping for this key from this map if present.
Parameters:
key - key whose mapping is to be removed from the map. | | Entry | removeEntryForKey(int key)
Removes and returns the entry associated with the specified key in the
HashMap. | | Entry | removeMapping(Object o)
Special version of remove for EntrySet. | | void | resize(int newCapacity)
Rehashes the contents of this map into a new array with a larger
capacity. | | public int | size()
Returns the number of key-value mappings in this map. | | void | transfer(Entry[] newTable)
Transfer all entries from current table to newTable. | | public Collection | values()
Returns a collection view of the values contained in this map. |
| DEFAULT_INITIAL_CAPACITY | | final static int DEFAULT_INITIAL_CAPACITY(Code) | | The default initial capacity - MUST be a power of two.
|
| DEFAULT_LOAD_FACTOR | | final static float DEFAULT_LOAD_FACTOR(Code) | | The load factor used when none specified in constructor.
|
| MAXIMUM_CAPACITY | | final static int MAXIMUM_CAPACITY(Code) | | The maximum capacity, used if a higher value is implicitly specified by
either of the constructors with arguments. MUST be a power of two <= 1<<30.
|
| loadFactor | | final float loadFactor(Code) | | The load factor for the hash table.
|
| modCount | | transient volatile int modCount(Code) | | The number of times this HashMap has been structurally modified
Structural modifications are those that change the number of mappings in
the HashMap or otherwise modify its internal structure (e.g., rehash).
This field is used to make iterators on Collection-views of the HashMap
fail-fast. (See ConcurrentModificationException).
|
| size | | transient int size(Code) | | The number of key-value mappings contained in this identity hash map.
|
| table | | transient Entry[] table(Code) | | The table, resized as necessary. Length MUST Always be a power of two.
|
| threshold | | int threshold(Code) | | The next size value at which to resize (capacity * load factor).
|
| IntHashMap | | public IntHashMap(int initialCapacity, float loadFactor)(Code) | | Constructs an empty HashMap with the specified initial
capacity and load factor.
Parameters:
initialCapacity - The initial capacity.
Parameters:
loadFactor - The load factor.
throws:
IllegalArgumentException - if the initial capacity is negative or the load factor isnonpositive. |
| IntHashMap | | public IntHashMap(int initialCapacity)(Code) | | Constructs an empty HashMap with the specified initial
capacity and the default load factor (0.75).
Parameters:
initialCapacity - the initial capacity.
throws:
IllegalArgumentException - if the initial capacity is negative. |
| IntHashMap | | public IntHashMap()(Code) | | Constructs an empty HashMap with the default initial capacity
(16) and the default load factor (0.75).
|
| addEntry | | void addEntry(int key, Object value, int bucketIndex)(Code) | | Add a new entry with the specified key, value and hash code to the
specified bucket. It is the responsibility of this method to resize the
table if appropriate.
Subclass overrides this to alter the behavior of put method.
Parameters:
key -
Parameters:
value -
Parameters:
bucketIndex - |
| clear | | public void clear()(Code) | | Removes all mappings from this map.
|
| clone | | public Object clone() throws CloneNotSupportedException(Code) | | Returns a shallow copy of this HashMap instance: the keys and
values themselves are not cloned.
a shallow copy of this map. |
| containsKey | | public boolean containsKey(int key)(Code) | | Returns true if this map contains a mapping for the specified
key.
Parameters:
key - The key whose presence in this map is to be tested true if this map contains a mapping for the specifiedkey. |
| containsValue | | public boolean containsValue(Object value)(Code) | | Returns true if this map maps one or more keys to the
specified value.
Parameters:
value - value whose presence in this map is to be tested. true if this map maps one or more keys to thespecified value. |
| createEntry | | void createEntry(int key, Object value, int bucketIndex)(Code) | | Like addEntry except that this version is used when creating entries as
part of Map construction or "pseudo-construction" (cloning,
deserialization). This version needn't worry about resizing the table.
Subclass overrides this to alter the behavior of HashMap(Map), clone, and
readObject.
Parameters:
key -
Parameters:
value -
Parameters:
bucketIndex - |
| entrySet | | public Set entrySet()(Code) | | Returns a collection view of the mappings contained in this map. Each
element in the returned collection is a Map.Entry. The
collection is backed by the map, so changes to the map are reflected in
the collection, and vice-versa. The collection supports element removal,
which removes the corresponding mapping from the map, via the
Iterator.remove, Collection.remove,
removeAll, retainAll, and clear
operations. It does not support the add or addAll
operations.
a collection view of the mappings contained in this map.
See Also: Map.Entry |
| get | | public Object get(int key)(Code) | | Returns the value to which the specified key is mapped in this identity
hash map, or null if the map contains no mapping for this key.
A return value of null does not necessarily indicate
that the map contains no mapping for the key; it is also possible that
the map explicitly maps the key to null. The
containsKey method may be used to distinguish these two cases.
Parameters:
key - the key whose associated value is to be returned. the value to which this map maps the specified key, ornull if the map contains no mapping for this key.
See Also: IntHashMap.put(int,Object) |
| getEntry | | Entry getEntry(int key)(Code) | | Returns the entry associated with the specified key in the HashMap.
Returns null if the HashMap contains no mapping for this key.
Parameters:
key - The Entry object for the given hash key |
| indexFor | | static int indexFor(int h, int length)(Code) | | Returns index for hash code h.
Parameters:
h -
Parameters:
length - The index for the hash integer for the given length |
| init | | void init()(Code) | | Initialization hook for subclasses. This method is called in all
constructors and pseudo-constructors (clone, readObject) after HashMap
has been initialized but before any entries have been inserted. (In the
absence of this method, readObject would require explicit knowledge of
subclasses.)
|
| isEmpty | | public boolean isEmpty()(Code) | | Returns true if this map contains no key-value mappings.
true if this map contains no key-value mappings. |
| keySet | | public Set keySet()(Code) | | Returns a set view of the keys contained in this map. The set is backed
by the map, so changes to the map are reflected in the set, and
vice-versa. The set supports element removal, which removes the
corresponding mapping from this map, via the Iterator.remove,
Set.remove, removeAll, retainAll, and
clear operations. It does not support the add or
addAll operations.
a set view of the keys contained in this map. |
| loadFactor | | float loadFactor()(Code) | | |
| put | | public Object put(int key, Object value)(Code) | | Associates the specified value with the specified key in this map. If the
map previously contained a mapping for this key, the old value is
replaced.
Parameters:
key - key with which the specified value is to be associated.
Parameters:
value - value to be associated with the specified key. previous value associated with specified key, or nullif there was no mapping for key. A null return canalso indicate that the HashMap previously associatednull with the specified key. |
| putAll | | public void putAll(IntHashMap m)(Code) | | Copies all of the mappings from the specified map to this map These
mappings will replace any mappings that this map had for any of the keys
currently in the specified map.
Parameters:
m - mappings to be stored in this map.
throws:
NullPointerException - if the specified map is null. |
| remove | | public Object remove(int key)(Code) | | Removes the mapping for this key from this map if present.
Parameters:
key - key whose mapping is to be removed from the map. previous value associated with specified key, or nullif there was no mapping for key. A null return canalso indicate that the map previously associated nullwith the specified key. |
| removeEntryForKey | | Entry removeEntryForKey(int key)(Code) | | Removes and returns the entry associated with the specified key in the
HashMap. Returns null if the HashMap contains no mapping for this key.
Parameters:
key - The Entry object that was removed |
| removeMapping | | Entry removeMapping(Object o)(Code) | | Special version of remove for EntrySet.
Parameters:
o - The entry that was removed |
| resize | | void resize(int newCapacity)(Code) | | Rehashes the contents of this map into a new array with a larger
capacity. This method is called automatically when the number of keys in
this map reaches its threshold.
If current capacity is MAXIMUM_CAPACITY, this method does not resize the
map, but but sets threshold to Integer.MAX_VALUE. This has the effect of
preventing future calls.
Parameters:
newCapacity - the new capacity, MUST be a power of two; must be greater thancurrent capacity unless current capacity is MAXIMUM_CAPACITY(in which case value is irrelevant). |
| size | | public int size()(Code) | | Returns the number of key-value mappings in this map.
the number of key-value mappings in this map. |
| transfer | | void transfer(Entry[] newTable)(Code) | | Transfer all entries from current table to newTable.
Parameters:
newTable - |
| values | | public Collection values()(Code) | | Returns a collection view of the values contained in this map. The
collection is backed by the map, so changes to the map are reflected in
the collection, and vice-versa. The collection supports element removal,
which removes the corresponding mapping from this map, via the
Iterator.remove, Collection.remove,
removeAll, retainAll, and clear
operations. It does not support the add or addAll
operations.
a collection view of the values contained in this map. |
|
|