|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectjava.util.AbstractMap
com.thoughtworks.qdox.model.util.OrderedMap
public class OrderedMap
This is a simple Map implementation backed by a List of Map.Entry objects. It has the property that iterators return entries in the order in whick they were inserted. Operations involving searching, including get() and put(), have cost linear to the size of the map. In other words, avoid this implementation if your Map might get large. If we could assume Java 1.4+, we'd just use java.util.LinkedHashMap instead of this class. But we can't.
Nested Class Summary |
---|
Nested classes/interfaces inherited from class java.util.AbstractMap |
---|
java.util.AbstractMap.SimpleEntry<K,V>, java.util.AbstractMap.SimpleImmutableEntry<K,V> |
Constructor Summary | |
---|---|
OrderedMap()
|
Method Summary | |
---|---|
java.util.Set |
entrySet()
|
java.lang.Object |
put(java.lang.Object key,
java.lang.Object value)
|
Methods inherited from class java.util.AbstractMap |
---|
clear, clone, containsKey, containsValue, equals, get, hashCode, isEmpty, keySet, putAll, remove, size, toString, values |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Constructor Detail |
---|
public OrderedMap()
Method Detail |
---|
public java.util.Set entrySet()
entrySet
in interface java.util.Map
entrySet
in class java.util.AbstractMap
public java.lang.Object put(java.lang.Object key, java.lang.Object value)
put
in interface java.util.Map
put
in class java.util.AbstractMap
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |