public class HMapIV<V> extends Object implements MapIV<V>, Cloneable, Serializable
MapIV is a specialized variant
the standard Java Map interface, except that the keys are hard coded as ints for
efficiency reasons (values can be arbitrary objects). This implementation was adapted from
HashMap version 1.73, 03/13/07.| Constructor and Description |
|---|
HMapIV()
Constructs an empty HMapII with the default initial capacity (1024) and the default
load factor (0.75).
|
HMapIV(int initialCapacity)
Constructs an empty HMapII with the specified initial capacity and the default load
factor (0.75).
|
HMapIV(int initialCapacity,
float loadFactor)
Constructs an empty HMapII with the specified initial capacity and load factor.
|
HMapIV(MapIV<V> m)
Constructs a new HMapII with the same mappings as the specified MapIV.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear()
Removes all of the mappings from this map.
|
Object |
clone()
Returns a shallow copy of this HMapII instance: the keys and values themselves are not
cloned.
|
boolean |
containsKey(int key)
Returns true if this map contains a mapping for the specified key.
|
boolean |
containsValue(V value)
Returns true if this map contains one or more mappings with the specified value.
|
Set<MapIV.Entry<V>> |
entrySet()
Returns a
Set view of the mappings contained in this map. |
V |
get(int key)
Returns the value to which the specified key is mapped, or throws
NoSuchElementException if this map contains no mapping for the key. |
MapIV.Entry<V>[] |
getEntriesSortedByValue()
Returns entries sorted by descending value.
|
MapIV.Entry<V>[] |
getEntriesSortedByValue(int n)
Returns top n entries sorted by descending value.
|
boolean |
isEmpty()
Returns true if this map contains no key-value mappings.
|
Set<Integer> |
keySet()
Returns a
Set view of the keys contained in this map. |
V |
put(int key,
V value)
Associates the specified value with the specified key in this map.
|
void |
putAll(MapIV<V> m)
Copies all of the mappings from the specified map to this map.
|
V |
remove(int key)
Removes the mapping for a key from this map if it is present.
|
int |
size()
Returns the number of key-value mappings in this map.
|
String |
toString() |
Collection<V> |
values()
Returns a
Collection view of the values contained in this map. |
public HMapIV(int initialCapacity,
float loadFactor)
initialCapacity - the initial capacityloadFactor - the load factorIllegalArgumentException - if the initial capacity is negative or the load factor is
nonpositivepublic HMapIV(int initialCapacity)
initialCapacity - the initial capacity.IllegalArgumentException - if the initial capacity is negative.public HMapIV()
public HMapIV(MapIV<V> m)
m - the map whose mappings are to be placed in this mapNullPointerException - if the specified map is nullpublic int size()
MapIVpublic boolean isEmpty()
MapIVpublic V get(int key)
MapIVNoSuchElementException if this map contains no mapping for the key.public boolean containsKey(int key)
MapIVcontainsKey in interface MapIV<V>key - key whose presence in this map is to be testedpublic V put(int key, V value)
MapIVpublic void putAll(MapIV<V> m)
MapIVpublic V remove(int key)
MapIVpublic void clear()
MapIVpublic boolean containsValue(V value)
MapIVcontainsValue in interface MapIV<V>value - value whose presence in this map is to be testedpublic Object clone()
public Set<Integer> keySet()
MapIVSet view of the keys contained in this map. Note that this is a inefficient
operation since it triggers autoboxing of the int keys, which is exactly what this
implementation is trying to avoid. Unlike a standard Java Map, values in the backing
map cannot be altered with this collection view.public Collection<V> values()
MapIVCollection view of the values contained in this map.public Set<MapIV.Entry<V>> entrySet()
MapIVSet view of the mappings contained in this map. The set is backed by the map,
so changes to the map are reflected in the set, and vice-versa.public MapIV.Entry<V>[] getEntriesSortedByValue()
public MapIV.Entry<V>[] getEntriesSortedByValue(int n)
n - number of entries to returnCopyright © 2018. All rights reserved.