NodeFactory nodeFactory
Node root
Lock writeLock
NodeFactory charArrayNodeFactory
NodeFactory byteArrayNodeFactory
byte[] incomingEdgeCharArray
AtomicReferenceArray<E> outgoingEdges
List<E> outgoingEdgesAsList
Object value
byte[] incomingEdgeCharArray
byte[] incomingEdgeCharArray
byte[] incomingEdgeCharArray
Object value
byte[] incomingEdgeCharArray
AtomicReferenceArray<E> outgoingEdges
List<E> outgoingEdgesAsList
byte[] incomingEdgeCharArray
AtomicReferenceArray<E> outgoingEdges
List<E> outgoingEdgesAsList
char[] incomingEdgeCharArray
AtomicReferenceArray<E> outgoingEdges
List<E> outgoingEdgesAsList
Object value
char[] incomingEdgeCharArray
char[] incomingEdgeCharArray
char[] incomingEdgeCharArray
Object value
char[] incomingEdgeCharArray
AtomicReferenceArray<E> outgoingEdges
List<E> outgoingEdgesAsList
char[] incomingEdgeCharArray
AtomicReferenceArray<E> outgoingEdges
List<E> outgoingEdgesAsList
CharSequence incomingEdgeCharSequence
AtomicReferenceArray<E> outgoingEdges
List<E> outgoingEdgesAsList
Object value
CharSequence incomingEdgeCharSequence
CharSequence incomingEdgeCharSequence
CharSequence incomingEdgeCharSequence
Object value
CharSequence incomingEdgeCharSequence
AtomicReferenceArray<E> outgoingEdges
List<E> outgoingEdgesAsList
CharSequence incomingEdgeCharSequence
AtomicReferenceArray<E> outgoingEdges
List<E> outgoingEdgesAsList
AtomicReferenceArray<E> atomicReferenceArray
com.googlecode.concurrenttrees.radixinverted.ConcurrentInvertedRadixTree.ConcurrentInvertedRadixTreeImpl<O> radixTree
ConcurrentRadixTree<O> radixTree
com.googlecode.concurrenttrees.suffix.ConcurrentSuffixTree.ConcurrentSuffixTreeImpl<V> radixTree
ConcurrentMap<K,V> valueMap
Copyright © 2017. All rights reserved.