This maps only builds once you ask for a key for the first time. It is designed to not incur the overhead of creating a map unless needed.
Type | Name and description |
---|---|
void |
clear() |
LazyMap |
clearAndCopy() |
protected Object |
clone() |
boolean |
containsKey(Object key) |
boolean |
containsValue(Object value) |
Set<Entry<String, Object>> |
entrySet() |
boolean |
equals(Object o) |
Object |
get(Object key) |
static V[] |
grow(V[] array) |
int |
hashCode() |
boolean |
isEmpty() |
Set<String> |
keySet() |
Object |
put(String key, Object value) |
void |
putAll(Map m) |
Object |
remove(Object key) added to avoid hash collision attack. |
int |
size() |
String |
toString() |
Collection<Object> |
values() |
Methods inherited from class | Name |
---|---|
class AbstractMap |
remove, get, put, equals, toString, values, hashCode, clear, isEmpty, size, entrySet, putAll, keySet, containsKey, containsValue, wait, wait, wait, getClass, notify, notifyAll |
class Object |
wait, wait, wait, equals, toString, hashCode, getClass, notify, notifyAll |
Copyright © 2003-2014 The Codehaus. All rights reserved.