public class LazyMap extends AbstractMap
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 Params | Return Type | Name and description | 
|---|---|---|
|  | public void | clear() | 
|  | public LazyMap | clearAndCopy() | 
|  | protected Object | clone() | 
|  | public boolean | containsKey(Object key) | 
|  | public boolean | containsValue(Object value) | 
|  | public Set<Entry<String, Object>> | entrySet() | 
|  | public boolean | equals(Object o) | 
|  | public Object | get(Object key) | 
| <V> | public static V[] | grow(V[] array) | 
|  | public int | hashCode() | 
|  | public boolean | isEmpty() | 
|  | public Set<String> | keySet() | 
|  | public Object | put(String key, Object value) | 
|  | public void | putAll(Map m) | 
|  | public Object | remove(Object key) | 
|  | public int | size() | 
|  | public String | toString() | 
|  | public Collection<Object> | values() | 
| Methods inherited from class | Name | 
|---|---|
| class AbstractMap | remove, get, put, equals, toString, values, hashCode, clear, isEmpty, size, entrySet, putAll, containsKey, keySet, containsValue, wait, wait, wait, getClass, notify, notifyAll, remove, replace, replace, replaceAll, merge, putIfAbsent, compute, forEach, computeIfAbsent, getOrDefault, computeIfPresent | 
Copyright © 2003-2024 The Apache Software Foundation. All rights reserved.