Package xapi.collect.impl

Interface Summary

Interface	Description
EntryIterable<K,V>

Class Summary

Class	Description
AbstractInitMap<Key,Value>	A map for singleton values; if containsKey(key) == true, the value is returned from the underlying ConcurrentHashMap, even if null.
AbstractLinkedList<T,N extends AbstractLinkedList.Node<T,N>,L extends AbstractLinkedList<T,N,L>>	A simple base class for implementing linked lists.
AbstractLinkedList.Node<T,N extends AbstractLinkedList.Node<T,N>>
AbstractMultiInitMap<Key,Value,Params>
ArrayIterable<E>
CharPoolTrie
Chars
Chars.SingleChar
ClassToDefault<V>
ClassToDelegate<V>
ClassToDelegate.ManyAbstract<V>
CollectionServiceDefault
CopyingCharPool
EmptyIterator<E>
EntryKeyAdapter<K,V>
EntryValueAdapter<K,V>
HashComparator<T>
InitMapDefault<Key,Value>
InitMapString<Value>
IntToAbstract<V>
IntToList<E>
IntToManyList<X>
IteratorProxy<K,V>
IteratorWrapper<E>
LazyHashMap<K,V>
LazyLinkedList<T>
LazyLinkedMap<K,V>	A LazyMap, backed by a LinkedHashMap.
LazyLinkedSet<T>	LazyLinkedSet, backed by a LinkedHashSet.
LazyList<T>	LazyList is backed by an ArrayList<>, created on demand.
LazySet<T>	A LazySet, backed by a HashSet.
LazyTreeMap<K,V>
MultithreadedStringTrie<E>	NSFW This somewhat monsterous Trie implementation is a work in progress.
ObjectToAbstract<K,V>
ObjectToAbstract.ManyAbstract<K,V>
SimpleFifo<E>	A simple, fast, threadsafe, one-way, single-linked list.
SimpleLinkedList<T>
SimpleLinkedList.LinkedListNode<T>
SimpleStack<T>	A very simple, but useful stack (linked list).
SingletonIterator<X>
StringDictionaryDefault<V>
StringStack<T>
StringToAbstract<V>
StringToDeepMap<X>
StringToManyList<X>
StringTrie<E>
StringTrie_2<E>
ToStringFifo<E>