Uses of Class
net.sf.joafip.StoreNotUseStandardSerialization

Packages that use StoreNotUseStandardSerialization

Package	Description
net.sf.joafip.java.util
net.sf.joafip.java.util.collections
net.sf.joafip.java.util.support
net.sf.joafip.java.util.support.arraylist
net.sf.joafip.java.util.support.hash
net.sf.joafip.java.util.support.linked.hash
net.sf.joafip.java.util.support.linked.tree
net.sf.joafip.java.util.support.linkedlist
net.sf.joafip.java.util.support.tree
net.sf.joafip.java.util.support.treelist
net.sf.joafip.redblacktree.entity
net.sf.joafip.redblacktree.impl.memory.entity
net.sf.joafip.redblacktree.impl.memory.service
net.sf.joafip.redblacktree.service

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util

Classes in net.sf.joafip.java.util with annotations of type StoreNotUseStandardSerialization

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	MapCollectionValues<K,V> collection based on value of map entries value
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	PHashMapEntrySet<K,V> hash map entry set adaptor
class	PHashMapKeySet<K,V> key set of a map
class	PHashSet<E> alternative implementation of HashSet pour file persistence
class	PLinkedHashMap<K,V> persistable linked hash map implementation
class	PLinkedHashMapEntrySet<K,V> hash map entry set adaptor
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	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

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util.collections

Classes in net.sf.joafip.java.util.collections with annotations of type StoreNotUseStandardSerialization

Modifier and Type	Class and Description
class	PCopiesList<E>
class	PEmptyList
class	PEmptyMap
class	PEmptySet
class	PLIFOQueue<E>
class	PNoModificiantIterator<E>
class	PNoModificiantListIterator<E>
class	PNoModificiantMapEntryIterator<K,V>
class	PReverseComparatorOfComparator<T>
class	PReverseComparatorOfNaturalOrder<T extends Comparable<T>>
class	PSetFromMap<E>
class	PSingletonList<E>
class	PSingletonMap<K,V>
class	PSingletonSet<E>
class	PSynchronizedCollection<E>
class	PSynchronizedIterator<E>
class	PSynchronizedList<E>
class	PSynchronizedListIterator<E>
class	PSynchronizedMap<K,V>
class	PSynchronizedSet<E>
class	PSynchronizedSortedMap<K,V>
class	PSynchronizedSortedSet<E>
class	PUnmodifiableCollection<E>
class	PUnmodifiableEntry<K,V>
class	PUnmodifiableEntrySet<K,V>
class	PUnmodifiableList<E>
class	PUnmodifiableMap<K,V>
class	PUnmodifiableSet<E>
class	PUnmodifiableSortedMap<K,V>
class	PUnmodifiableSortedSet<E>

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util.support

Classes in net.sf.joafip.java.util.support with annotations of type StoreNotUseStandardSerialization

Modifier and Type	Class and Description
class	AbstractDescendingIterator<E> abstract adapter from iterator to descending iterator
class	PreviousElementAndSetNode<E>

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util.support.arraylist

Classes in net.sf.joafip.java.util.support.arraylist with annotations of type StoreNotUseStandardSerialization

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>

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util.support.hash

Classes in net.sf.joafip.java.util.support.hash with annotations of type StoreNotUseStandardSerialization

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

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util.support.linked.hash

Classes in net.sf.joafip.java.util.support.linked.hash with annotations of type StoreNotUseStandardSerialization

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 element maintains 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> node of LinkedHashSupportNodeSet reference the node of list of all the nodes of the set
class	LinkedHashSupportNodeSet<E>
class	LinkedListSupportAllNode<E> node of list of all the nodes of the set

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util.support.linked.tree

Classes in net.sf.joafip.java.util.support.linked.tree with annotations of type StoreNotUseStandardSerialization

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 element maintains 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

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util.support.linkedlist

Classes in net.sf.joafip.java.util.support.linkedlist with annotations of type StoreNotUseStandardSerialization

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> iterator on LinkedListSupport this iterator support list concurrent modification
class	LinkedListSupportManager<E>
class	LinkedListSupportNode<E> linked list node

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util.support.tree

Classes in net.sf.joafip.java.util.support.tree with annotations of type StoreNotUseStandardSerialization

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>

Uses of StoreNotUseStandardSerialization in net.sf.joafip.java.util.support.treelist

Classes in net.sf.joafip.java.util.support.treelist with annotations of type StoreNotUseStandardSerialization

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>

Uses of StoreNotUseStandardSerialization in net.sf.joafip.redblacktree.entity

Classes in net.sf.joafip.redblacktree.entity with annotations of type StoreNotUseStandardSerialization

Modifier and Type	Class and Description
class	RBTSentinel<E>

Uses of StoreNotUseStandardSerialization in net.sf.joafip.redblacktree.impl.memory.entity

Classes in net.sf.joafip.redblacktree.impl.memory.entity with annotations of type StoreNotUseStandardSerialization

Modifier and Type	Class and Description
class	RBTNode<E> red black tree node

Uses of StoreNotUseStandardSerialization in net.sf.joafip.redblacktree.impl.memory.service

Classes in net.sf.joafip.redblacktree.impl.memory.service with annotations of type StoreNotUseStandardSerialization

Modifier and Type	Class and Description
class	RBTNodeManager<E> red black tree node management in memory

Uses of StoreNotUseStandardSerialization in net.sf.joafip.redblacktree.service

Classes in net.sf.joafip.redblacktree.service with annotations of type StoreNotUseStandardSerialization

Modifier and Type	Class and Description
class	RBTNodeListIterator<E> iterator on red black tree
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