org.duelengine.duel
Class SparseMap
java.lang.Object
java.util.AbstractMap<K,V>
java.util.HashMap<K,V>
java.util.LinkedHashMap<String,Object>
org.duelengine.duel.SparseMap
- All Implemented Interfaces:
- Serializable, Cloneable, Map<String,Object>
public class SparseMap
- extends LinkedHashMap<String,Object>
Represents sparsely populated graph of data to be
serialized over the top of existing JavaScript Objects
Does not get serialized directly.
- See Also:
- Serialized Form
| Methods inherited from interface java.util.Map |
containsKey, entrySet, equals, hashCode, isEmpty, keySet, put, putAll, remove, size, values |
SparseMap
public SparseMap()
SparseMap
public SparseMap(int initialCapacity)
putSparse
public Object putSparse(String ident,
Object value)
asSparseMap
public static SparseMap asSparseMap(Object... pairs)
- Builds a mutable Map from an interlaced sequence of key-value pairs
- Parameters:
pairs -
- Returns:
Copyright © 2012. All Rights Reserved.