public class ConcurrentCharMap<T> extends CharMap<T> implements ConcurrentCollection
CharMap.Entries<V>, CharMap.Entry<V>, CharMap.Keys, CharMap.Values<V>| Modifier and Type | Field and Description |
|---|---|
protected org.mini2Dx.lockprovider.ReadWriteLock |
lock |
| Constructor and Description |
|---|
ConcurrentCharMap()
Creates a new map with an initial capacity of 51 and a load factor of 0.8.
|
ConcurrentCharMap(CharMap<? extends T> map)
Creates a new map identical to the specified map.
|
ConcurrentCharMap(int initialCapacity)
Creates a new map with a load factor of 0.8.
|
ConcurrentCharMap(int initialCapacity,
float loadFactor)
Creates a new map with the specified initial capacity and load factor.
|
| Modifier and Type | Method and Description |
|---|---|
void |
clear() |
void |
clear(int maximumCapacity)
Clears the map and reduces the size of the backing arrays to be the specified capacity if they are larger.
|
boolean |
containsKey(char key) |
boolean |
containsValue(java.lang.Object value,
boolean identity)
Returns true if the specified value is in the map.
|
void |
ensureCapacity(int additionalCapacity)
Increases the size of the backing array to accommodate the specified number of additional items.
|
CharMap.Entries<T> |
entries()
Returns an iterator for the entries in the map.
|
boolean |
equals(java.lang.Object object) |
char |
findKey(java.lang.Object value,
boolean identity,
char notFound)
Returns the key for the specified value, or
notFound if it is not in the map. |
T |
get(char key,
T defaultValue) |
org.mini2Dx.lockprovider.ReadWriteLock |
getLock()
Returns the collection's
ReadWriteLock |
int |
hashCode() |
CharMap.Keys |
keys()
Returns an iterator for the keys in the map.
|
T |
put(char key,
T value) |
void |
putAll(CharMap<T> map) |
boolean |
putIfAbsent(char key,
T value)
Puts a key/value if the key is not already present
|
boolean |
putIfPresent(char key,
T value)
Puts a key/value if the key is already present
|
T |
remove(char key) |
void |
shrink(int maximumCapacity)
Reduces the size of the backing arrays to be the specified capacity or less.
|
int |
size()
Returns the size in a thread-safe manner
|
java.lang.String |
toString() |
CharMap.Values<T> |
values()
Returns an iterator for the values in the map.
|
public ConcurrentCharMap()
public ConcurrentCharMap(int initialCapacity)
initialCapacity - If not a power of two, it is increased to the next nearest power of two.public ConcurrentCharMap(int initialCapacity,
float loadFactor)
initialCapacity - If not a power of two, it is increased to the next nearest power of two.loadFactor - public int size()
public boolean putIfAbsent(char key,
T value)
key - The key to put if absentvalue - The value to put if absentpublic boolean putIfPresent(char key,
T value)
key - The key to put if presentvalue - The value to put if presentpublic void shrink(int maximumCapacity)
CharMappublic void clear(int maximumCapacity)
CharMappublic boolean containsValue(java.lang.Object value,
boolean identity)
CharMapcontainsValue in class CharMap<T>public boolean containsKey(char key)
containsKey in class CharMap<T>public char findKey(java.lang.Object value,
boolean identity,
char notFound)
CharMapnotFound if it is not in the map. Note this traverses the entire map
and compares every value, which may be an expensive operation.findKey in class CharMap<T>identity - If true, uses == to compare the specified value with values in the map. If false, uses
CharMap.equals(Object).public void ensureCapacity(int additionalCapacity)
CharMapensureCapacity in class CharMap<T>public CharMap.Entries<T> entries()
CharMapCharMap.Entries constructor for nested or multithreaded iteration.public CharMap.Values<T> values()
CharMapCharMap.Entries constructor for nested or multithreaded iteration.public CharMap.Keys keys()
CharMapCharMap.Entries constructor for nested or multithreaded iteration.public org.mini2Dx.lockprovider.ReadWriteLock getLock()
ConcurrentCollectionReadWriteLockgetLock in interface ConcurrentCollectionReadWriteLock