|
Side of Software Dated Collections Library 2.0 |
||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||
| Uses of AbstractDatedMap in sos.dated.util |
|---|
| Subclasses of AbstractDatedMap in sos.dated.util | |
|---|---|
class |
AbstractMapByDate<K,V,D>
A partial implementation of DatedMap that maintains a complete, non-dated
map at each date where a change occurs. |
class |
HashMapByDate<K,V,D>
An implementation of DatedMap that maintains a java.util.HashMap
at each date where a change occurs, yielding fast date iterations and fast retrievals. |
class |
HashMapByKey<K,V,D>
An implementation of DatedMap that indexes its keys with a
java.util.HashMap, yielding fast insertions and removals. |
class |
IdentityHashMapByDate<K,V,D>
A special-purpose, non-conforming implementation of DatedMap
that uses identity equality and
identity hash code by maintaining a java.util.IdentityHashMap
at each date. |
class |
IdentityHashMapByKey<K,V,D>
A special-purpose, non-conforming implementation of DatedMap
that uses identity equality and identity hash code. |
class |
LinkedHashMapByDate<K,V,D>
An implementation of DatedMap that maintains a java.util.LinkedHashMap
at each date where a change occurs, yielding fast date iterations, fast retrievals,
and predictable entry iterations. |
class |
TreeMapByDate<K,V,D>
An implementation of DatedSortedMap that maintains a java.util.TreeMap
at each date where a change occurs, yielding fast date iterations and logarithmic
retrievals. |
class |
TreeMapByKey<K,V,D>
An implementation of DatedSortedMap that uses an underlying
TreeMap to
keep all keys in sorted order and to achieve fast access to all keys. |
|
Side of Software Dated Collections Library 2.0 |
||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||