Uses of Class
sos.dated.util.AbstractDatedObject

Uses of AbstractDatedObject in sos.dated.util

Subclasses of AbstractDatedObject in sos.dated.util

class	AbstractDatedCollection<E,D> A partial implementation of a dated collection.
class	AbstractDatedList<E,D> A partial implementation of a dated list.
class	AbstractDatedMap<K,V,D> A partial implementation of a dated map.
class	AbstractDatedSet<E,D> A partial implementation of a dated set.
class	AbstractDatedValue<E,D> A partial implementation of a dated value.
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	AbstractSequentialDatedList<E,D> A partial implementation of a dated list that does not provide random access to its elements at a given date.
class	ArrayListByDate<E,D> An implementation of DatedList that can efficiently iterate through the list of elements at a given date by maintaining a java.util.ArrayList at each date.
class	ArrayListByElement<E,D> An implementation of DatedList that uses a single java.util.ArrayList to efficiently add and set values.
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	HashSetByDate<E,D> An implementation of DatedSet that uses a HashMapByDate as its underlying data structure.
class	HashSetByElement<E,D> An implementation of DatedSet that uses a HashMapByKey as its underlying data structure.
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	LinkedHashSetByDate<E,D> An implementation of DatedSet that uses a LinkedHashMapByDate as its underlying data structure.
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.
class	TreeSetByDate<E,D> An implementation of DatedSet that uses a TreeMapByDate as its underlying data structure.
class	TreeSetByElement<E,D> An implementation of DatedSet that uses a TreeMapByKey as its underlying data structure to keep its elements in sorted order and to provide fast indexing to elements.
class	ValueByDate<E,D> An implementation of DatedValue that can efficiently produce the value at a given date.