Uses of Interface
com.googlecode.concurrenttrees.radix.node.NodeFactory

Packages that use NodeFactory

com.googlecode.concurrenttrees.radix
com.googlecode.concurrenttrees.radix.node.concrete
com.googlecode.concurrenttrees.radixinverted
com.googlecode.concurrenttrees.radixreversed
com.googlecode.concurrenttrees.solver
com.googlecode.concurrenttrees.suffix

Uses of NodeFactory in com.googlecode.concurrenttrees.radix

Constructors in com.googlecode.concurrenttrees.radix with parameters of type NodeFactory

ConcurrentRadixTree(NodeFactory nodeFactory)
Creates a new ConcurrentRadixTree which will use the given NodeFactory to create nodes.

ConcurrentRadixTree(NodeFactory nodeFactory, boolean restrictConcurrency)
Creates a new ConcurrentRadixTree which will use the given NodeFactory to create nodes.

Uses of NodeFactory in com.googlecode.concurrenttrees.radix.node.concrete

Classes in com.googlecode.concurrenttrees.radix.node.concrete that implement NodeFactory

class	DefaultByteArrayNodeFactory A NodeFactory which creates Node objects which store incoming edge characters as a byte array inside the node.
class	DefaultCharArrayNodeFactory A NodeFactory which creates various implementations of Node objects all of which store incoming edge characters as a character array inside the node.
class	DefaultCharSequenceNodeFactory A NodeFactory which creates various implementations of Node objects all of which store incoming edge characters as a CharSequence (a view onto the original key) rather than copying the edge into a character array.
class	SmartArrayBasedNodeFactory A NodeFactory which internally uses DefaultByteArrayNodeFactory to create nodes by default (which can reduce memory overhead), but falls back to DefaultCharArrayNodeFactory if characters are detected which cannot be represented as a single byte.

Uses of NodeFactory in com.googlecode.concurrenttrees.radixinverted

Constructors in com.googlecode.concurrenttrees.radixinverted with parameters of type NodeFactory

ConcurrentInvertedRadixTree(NodeFactory nodeFactory)
Creates a new ConcurrentInvertedRadixTree which will use the given NodeFactory to create nodes.

ConcurrentInvertedRadixTree(NodeFactory nodeFactory, boolean restrictConcurrency)
Creates a new ConcurrentInvertedRadixTree which will use the given NodeFactory to create nodes.

Uses of NodeFactory in com.googlecode.concurrenttrees.radixreversed

Constructors in com.googlecode.concurrenttrees.radixreversed with parameters of type NodeFactory

ConcurrentReversedRadixTree(NodeFactory nodeFactory)
Creates a new ConcurrentReversedRadixTree which will use the given NodeFactory to create nodes.

ConcurrentReversedRadixTree(NodeFactory nodeFactory, boolean restrictConcurrency)
Creates a new ConcurrentReversedRadixTree which will use the given NodeFactory to create nodes.

Uses of NodeFactory in com.googlecode.concurrenttrees.solver

Constructors in com.googlecode.concurrenttrees.solver with parameters of type NodeFactory

LCSubstringSolver(NodeFactory nodeFactory)
Creates a new LCSubstringSolver which will use the given NodeFactory to create nodes.

LCSubstringSolver(NodeFactory nodeFactory, boolean restrictConcurrency)
Creates a new LCSubstringSolver which will use the given NodeFactory to create nodes.

Uses of NodeFactory in com.googlecode.concurrenttrees.suffix

Constructors in com.googlecode.concurrenttrees.suffix with parameters of type NodeFactory

ConcurrentSuffixTree(NodeFactory nodeFactory)
Creates a new ConcurrentSuffixTree which will use the given NodeFactory to create nodes.

ConcurrentSuffixTree(NodeFactory nodeFactory, boolean restrictConcurrency)
Creates a new ConcurrentSuffixTree which will use the given NodeFactory to create nodes.