public class Map<K,V> extends OrderedMap<K,V>
AbstractMap.SimpleEntry<K,V>, AbstractMap.SimpleImmutableEntry<K,V>| Constructor and Description |
|---|
Map() |
Map(int sizeHint) |
Map(K[] keysSealed,
V[] elementsSealed) |
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
boolean |
contains(Object value) |
boolean |
containsKey(Object key)
Whether or not the key is bound in this map
|
V |
elementAt(int index) |
Enumeration |
elements() |
V |
get(Object key) |
int |
indexOfKey(K key) |
boolean |
isEmpty() |
Object |
keyAt(int index) |
Enumeration |
keys() |
V |
put(K key,
V value)
Places the key/value pair in this map.
|
V |
remove(Object key)
Removes any mapping from the given key
|
void |
removeAt(int i) |
void |
reset()
Removes all keys and values from this map.
|
void |
seal() |
int |
size() |
String |
toString() |
containsValue, entrySet, forEach, getOrDefault, keySet, removeEldestEntry, replaceAll, valuesclone, compute, computeIfAbsent, computeIfPresent, merge, putAll, putIfAbsent, remove, replace, replaceequals, hashCodefinalize, getClass, notify, notifyAll, wait, wait, waitcompute, computeIfAbsent, computeIfPresent, equals, hashCode, merge, putAll, putIfAbsent, remove, replace, replacepublic V put(K key, V value)
public int size()
public void reset()
public boolean containsKey(Object key)
containsKey in interface Map<K,V>containsKey in class HashMap<K,V>key - public void clear()
public V elementAt(int index)
public Enumeration elements()
public int indexOfKey(K key)
public Object keyAt(int index)
public Enumeration keys()
public void removeAt(int i)
public String toString()
toString in class OrderedMap<K,V>public boolean isEmpty()
public boolean contains(Object value)
public void seal()
Copyright © 2023. All rights reserved.