Modifier and Type | Class and Description |
---|---|
class |
SpellCheckBase |
Modifier and Type | Class and Description |
---|---|
class |
Tree<E> |
class |
TreeMem<E> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractLinkedList<E> |
class |
AbstractPLinkedTreeSet<E>
common to all persistable linked set implementation
|
class |
AbstractPSet<E>
persistent set implementation extends
PAbstractSet add ability to get the instance of an element found by equality |
class |
AbstractPTreeSet<E>
common to all persistable set implementation
|
class |
HashMapEntryComparator<K,V> |
class |
MapCollectionValues<K,V>
collection based on value of map entries value
|
class |
PAbstractCollection<E>
common to all collections
|
class |
PAbstractList<E> |
class |
PAbstractMap<K,V>
common to all maps implementation
|
class |
PAbstractQueue<E> |
class |
PAbstractSequentialList<E> |
class |
PAbstractSet<E>
common to all sets implementations
|
class |
PArrayList<E>
array list implementation for persistence
|
class |
PConcurrentHashMap<K,V> |
class |
PDescendingTreeSet<E>
reversed set of a set
|
class |
PDescendingTreeSubSet<E>
reversed sub set of a set
|
class |
PHashMap<K,V>
implementation of persistable hash map replacement for HashMap
|
class |
PHashMapEntry<K,V>
persistable hash map entry implementation
|
class |
PHashMapKeySet<K,V>
key set of a map
|
class |
PHashSet<E>
alternative implementation of
HashSet pour file persistence |
class |
PLinkedHashSet<E>
alternative implementation of
LinkedHashSet pour file persistence |
class |
PLinkedList<E>
implementation of
ILinkedList replacement for
LinkedList |
class |
PLinkedMapKeySet<K,V>
navigable key set of a tree map
|
class |
PLinkedTreeMap<K,V>
persistable linked tree map implementation
|
class |
PLinkedTreeSet<E>
alternative implementation of
LinkedHashSet when element are
comparable pour file persistence |
class |
PListIterator<E> |
class |
PMapEntry<K,V>
common persistable map entry implementation
|
class |
PMapKeyNavigableSet<K,V>
navigable key set of a tree map
|
class |
PPriorityQueue<E>
An unbounded persistable priority queue
|
class |
PSubList<E> |
class |
PTreeList<E>
implementation of
ILinkedList replacement for
LinkedList |
class |
PTreeMap<K,V>
A Red-Black tree based persistable map implementation
|
class |
PTreeMapEntry<K,V>
persistable tree map entry implementation
|
class |
PTreeSet<E>
A Red-Black tree based persistable set implementation
|
class |
PTreeSubSet<E>
a persistable sub set of a persistable set
|
class |
SetOfMapEntryValueIterator<K,V>
iterator on set of map entries values
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractDescendingIterator<E>
abstract adapter from iterator to descending iterator
|
class |
PreviousElementAndSetNode<E> |
Modifier and Type | Class and Description |
---|---|
class |
ArrayListSupport<E>
support for persistent array list
|
class |
ArrayListSupportDescendingIterator<E>
adapter to create array list support descending iterator from array list
support iterator
|
class |
ArrayListSupportIterator<E> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractHashSupportNodeSet<E>
the node is a set attached to a hash code entry
|
class |
HashSupport<E>
Minimum for hash set management
use implementation in element type of Object.equals(Object) and
Object.hashCode() for access to element |
class |
HashSupportIterator<E> |
class |
HashSupportNodeEntry<E> |
class |
HashSupportNodeSet<E>
set attached to a hash code entry
the node of this set ( LinkedHashSupportNode ) are shared with the
list of all nodes of set |
Modifier and Type | Class and Description |
---|---|
class |
LinkedHashSupport<E>
minimum for linked hash set management
use implementation in element type of Object.equals(Object) and
Object.hashCode() for access to elementmaintains a doubly-linked list running through all of its entries. |
class |
LinkedHashSupportDescendingIterator<E>
adapter to create hash set descending iterator from hash set iterator
|
class |
LinkedHashSupportIterator<E>
iterator for
LinkedHashSupport |
class |
LinkedHashSupportNode<E>
|
class |
LinkedHashSupportNodeSet<E> |
class |
LinkedListSupportAllNode<E>
node of list of all the nodes of the set
|
Modifier and Type | Class and Description |
---|---|
class |
LinkedTreeSupport<E>
minimum for linked tree set management
use implementation in element type of Object.equals(Object) and
Object.hashCode() for access to elementmaintains a doubly-linked list running through all of its entries. |
class |
LinkedTreeSupportDescendingIterator<E>
adapter to create linked tree set descending iterator from linked tree set
iterator
|
class |
LinkedTreeSupportIterator<E>
iterator for
LinkedTreeSupport |
Modifier and Type | Class and Description |
---|---|
class |
AbstractLinkedListNodeSupport<E>
element management for linked list node
|
class |
LinkedListSupport<E>
minimum for linked list management
make iterator able to support list concurent modification |
class |
LinkedListSupportDescendingIterator<E>
adapter to create linked list descending iterator from linked list iterator
|
class |
LinkedListSupportIterator<E>
|
class |
LinkedListSupportManager<E> |
class |
LinkedListSupportNode<E>
linked list node
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractTreeSupportIterator<E>
abstract tree iterator that accept concurrent modification
|
class |
TreeSupport<E> |
class |
TreeSupportDescendingIterator<E>
adapter to create tree descending iterator from tree iterator
|
class |
TreeSupportIterator<E>
tree iterator that accept concurrent modification
|
class |
TreeSupportNode<E>
extend red black tree node adding reference to previous and next node
|
class |
TreeSupportSubDescendingIterator<E> |
class |
TreeSupportSubIterator<E> |
Modifier and Type | Class and Description |
---|---|
class |
TreeListSupport<E> |
class |
TreeListSupportDescendingIterator<E>
adapter to create tree list descending iterator from tree list iterator
|
class |
TreeListSupportIterator<E> |
Modifier and Type | Class and Description |
---|---|
class |
InterceptEntity |
Modifier and Type | Class and Description |
---|---|
class |
Item |
class |
ItemList |
class |
ItemTemplate |
class |
ItemTemplateList |
Modifier and Type | Class and Description |
---|---|
class |
RBTSentinel<E> |
Modifier and Type | Class and Description |
---|---|
class |
RBTNode<E>
red black tree node
|
Modifier and Type | Class and Description |
---|---|
class |
RBTNodeManager<E>
red black tree node management in memory
|
Modifier and Type | Class and Description |
---|---|
class |
RedBlackTree<E>
red black tree manager
attached / detached to the tree Independent of kind of element stored by the nodes no more duplicate key browsing Optionally manage index |
Modifier and Type | Class and Description |
---|---|
class |
StoreRoot
store root object for file persistence for release previous 3.0.0
|
class |
StoreRoot2
store root object for file persistence since release 3.0.0
|
class |
StoreRoot3
store root object for file persistence since release 3.0.0
|
class |
StoreRoot4
store root object for file persistence since release 4.0.0
|
Modifier and Type | Class and Description |
---|---|
class |
KeptInMemoryObjectKey |
class |
SubstituteOfEnum
substitute of enum in joafip file, make able to store enum class name and
enum constant name instead of the corresponding enum instance
implement Comparable to be use as a tree map key |
Modifier and Type | Class and Description |
---|---|
class |
NullMarker |
Copyright © 2007-2012 Luc Peuvrier. All Rights Reserved.