| Interface | Description |
|---|---|
| ICollectionListenable<E> | |
| ICollectionListener<E> | |
| ILinkedList<E> |
interface of linked list implementation
|
| IMapListenable<K,V> | |
| IMapListener<K,V> | |
| IPNavigableTreeSet<E> | |
| IPSet<E> | |
| IPTreeSet<E> |
| Class | Description |
|---|---|
| AbstractLinkedList<E> | |
| AbstractPLinkedTreeSet<E> |
common to all persistable linked set implementation
|
| AbstractPSet<E> |
persistent set implementation extends
PAbstractSetadd ability to get the instance of an element found by equality |
| AbstractPTreeSet<E> |
common to all persistable set implementation
|
| HashMapEntryComparator<K,V> | |
| JavaUtilTests | |
| MapCollectionValues<K,V> |
collection based on value of map entries value
|
| PAbstractCollection<E> |
common to all collections
|
| PAbstractList<E> | |
| PAbstractMap<K,V> |
common to all maps implementation
|
| PAbstractQueue<E> | |
| PAbstractSequentialList<E> | |
| PAbstractSet<E> |
common to all sets implementations
|
| PArrayList<E> |
array list implementation for persistence
|
| PConcurrentHashMap<K,V> | |
| PDescendingTreeSet<E> |
reversed set of a set
|
| PDescendingTreeSubSet<E> |
reversed sub set of a set
|
| PHashMap<K,V> |
implementation of persistable hash map replacement for HashMap
|
| PHashMapEntry<K,V> |
persistable hash map entry implementation
|
| PHashMapEntrySet<K,V> |
hash map entry set adaptor
|
| PHashMapKeySet<K,V> |
key set of a map
|
| PHashSet<E> |
alternative implementation of
HashSet pour file persistence |
| PLinkedHashMap<K,V> |
persistable linked hash map implementation
|
| PLinkedHashMapEntrySet<K,V> |
hash map entry set adaptor
|
| PLinkedHashSet<E> |
alternative implementation of
LinkedHashSet pour file persistence |
| PLinkedList<E> |
implementation of
ILinkedList replacement for
LinkedList |
| PLinkedMapKeySet<K,V> |
navigable key set of a tree map
|
| PLinkedTreeMap<K,V> |
persistable linked tree map implementation
|
| PLinkedTreeSet<E> |
alternative implementation of
LinkedHashSet when element are
comparable pour file persistence |
| PListIterator<E> | |
| PMapEntry<K,V> |
common persistable map entry implementation
|
| PMapKeyNavigableSet<K,V> |
navigable key set of a tree map
|
| PPriorityQueue<E> |
An unbounded persistable priority queue
|
| PSubList<E> | |
| PSynchronizedList<E> | |
| PSynchronizedListIterator<E> | |
| PTreeList<E> |
implementation of
ILinkedList replacement for
LinkedList |
| PTreeMap<K,V> |
A Red-Black tree based persistable map implementation
|
| PTreeMapEntry<K,V> |
persistable tree map entry implementation
|
| PTreeSet<E> |
A Red-Black tree based persistable set implementation
|
| PTreeSubSet<E> |
a persistable sub set of a persistable set
|
| PVector<E> | |
| PVectorIterator<E> | |
| SetOfMapEntryValueIterator<K,V> |
iterator on set of map entries values
|
Copyright © 2007-2012 Luc Peuvrier. All Rights Reserved.