Package | Description |
---|---|
org.apache.lucene.analysis.charfilter |
Normalization of text before the tokenizer.
|
org.apache.lucene.analysis.hunspell |
Stemming TokenFilter using a Java implementation of the
Hunspell stemming algorithm.
|
org.apache.lucene.analysis.miscellaneous |
Miscellaneous Tokenstreams.
|
org.apache.lucene.analysis.synonym |
Analysis components for Synonyms.
|
org.apache.lucene.codecs.blocktree |
BlockTree terms dictionary.
|
org.apache.lucene.codecs.idversion |
A primary-key postings format that associates a version (long) with each term and
can provide fail-fast lookups by ID and version.
|
org.apache.lucene.util.fst |
Finite state transducers
|
Modifier and Type | Field and Description |
---|---|
private FST<CharsRef> |
MappingCharFilter.map |
(package private) FST<CharsRef> |
NormalizeCharMap.map |
Constructor and Description |
---|
NormalizeCharMap(FST<CharsRef> map) |
Modifier and Type | Field and Description |
---|---|
(package private) FST<CharsRef> |
Dictionary.iconv |
(package private) FST<CharsRef> |
Dictionary.oconv |
(package private) FST<IntsRef> |
Dictionary.prefixes |
(package private) FST<IntsRef> |
Dictionary.suffixes |
(package private) FST<IntsRef> |
Dictionary.words |
Modifier and Type | Method and Description |
---|---|
private FST<IntsRef> |
Dictionary.affixFST(java.util.TreeMap<java.lang.String,java.util.List<java.lang.Integer>> affixes) |
private FST<CharsRef> |
Dictionary.parseConversions(java.io.LineNumberReader reader,
int num) |
Modifier and Type | Method and Description |
---|---|
(package private) static void |
Dictionary.applyMappings(FST<CharsRef> fst,
java.lang.StringBuilder sb) |
(package private) IntsRef |
Dictionary.lookup(FST<IntsRef> fst,
char[] word,
int offset,
int length) |
Modifier and Type | Field and Description |
---|---|
private FST<BytesRef> |
StemmerOverrideFilter.StemmerOverrideMap.fst |
Constructor and Description |
---|
StemmerOverrideMap(FST<BytesRef> fst,
boolean ignoreCase)
Creates a new
StemmerOverrideFilter.StemmerOverrideMap |
Modifier and Type | Field and Description |
---|---|
FST<BytesRef> |
SynonymMap.fst
map<input word, list<ord>>
|
private FST<BytesRef> |
SynonymGraphFilter.fst |
private FST<BytesRef> |
SynonymFilter.fst
Deprecated.
|
Constructor and Description |
---|
SynonymMap(FST<BytesRef> fst,
BytesRefHash words,
int maxHorizontalContext) |
Modifier and Type | Field and Description |
---|---|
FST<BytesRef> |
BlockTreeTermsWriter.PendingBlock.index |
(package private) FST<BytesRef> |
FieldReader.index |
Modifier and Type | Field and Description |
---|---|
java.util.List<FST<BytesRef>> |
BlockTreeTermsWriter.PendingBlock.subIndices |
Modifier and Type | Method and Description |
---|---|
private void |
BlockTreeTermsWriter.PendingBlock.append(Builder<BytesRef> builder,
FST<BytesRef> subIndex,
IntsRefBuilder scratchIntsRef) |
Constructor and Description |
---|
PendingBlock(BytesRef prefix,
long fp,
boolean hasTerms,
boolean isFloor,
int floorLeadByte,
java.util.List<FST<BytesRef>> subIndices) |
Modifier and Type | Field and Description |
---|---|
(package private) FST<PairOutputs.Pair<BytesRef,java.lang.Long>> |
VersionFieldReader.index |
FST<PairOutputs.Pair<BytesRef,java.lang.Long>> |
VersionBlockTreeTermsWriter.PendingBlock.index |
Modifier and Type | Field and Description |
---|---|
java.util.List<FST<PairOutputs.Pair<BytesRef,java.lang.Long>>> |
VersionBlockTreeTermsWriter.PendingBlock.subIndices |
Modifier and Type | Method and Description |
---|---|
private void |
VersionBlockTreeTermsWriter.PendingBlock.append(Builder<PairOutputs.Pair<BytesRef,java.lang.Long>> builder,
FST<PairOutputs.Pair<BytesRef,java.lang.Long>> subIndex,
IntsRefBuilder scratchIntsRef) |
Constructor and Description |
---|
PendingBlock(BytesRef prefix,
long maxVersion,
long fp,
boolean hasTerms,
boolean isFloor,
int floorLeadByte,
java.util.List<FST<PairOutputs.Pair<BytesRef,java.lang.Long>>> subIndices) |
Modifier and Type | Field and Description |
---|---|
protected FST<T> |
FSTEnum.fst |
private FST<T> |
Util.TopNSearcher.fst |
(package private) FST<T> |
Builder.fst |
private FST<T> |
NodeHash.fst |
Modifier and Type | Method and Description |
---|---|
FST<T> |
Builder.finish()
Returns final FST.
|
static <T> FST<T> |
FST.read(java.nio.file.Path path,
Outputs<T> outputs)
Reads an automaton from a file.
|
Modifier and Type | Method and Description |
---|---|
static <T> T |
Util.get(FST<T> fst,
BytesRef input)
Looks up the output for this input, or null if the
input is not accepted
|
static <T> T |
Util.get(FST<T> fst,
IntsRef input)
Looks up the output for this input, or null if the
input is not accepted.
|
static IntsRef |
Util.getByOutput(FST<java.lang.Long> fst,
long targetOutput)
Reverse lookup (lookup by output instead of by input),
in the special case when your FSTs outputs are
strictly ascending.
|
static IntsRef |
Util.getByOutput(FST<java.lang.Long> fst,
long targetOutput,
FST.BytesReader in,
FST.Arc<java.lang.Long> arc,
FST.Arc<java.lang.Long> scratchArc,
IntsRefBuilder result)
Expert: like
Util.getByOutput(FST, long) except reusing
BytesReader, initial and scratch Arc, and result. |
static <T> FST.Arc<T> |
Util.readCeilArc(int label,
FST<T> fst,
FST.Arc<T> follow,
FST.Arc<T> arc,
FST.BytesReader in)
Reads the first arc greater or equal that the given label into the provided
arc in place and returns it iff found, otherwise return
null . |
static <T> Util.TopResults<T> |
Util.shortestPaths(FST<T> fst,
FST.Arc<T> fromNode,
T startOutput,
java.util.Comparator<T> comparator,
int topN,
boolean allowEmptyString)
Starting from node, find the top N min cost
completions to a final node.
|
static <T> void |
Util.toDot(FST<T> fst,
java.io.Writer out,
boolean sameRank,
boolean labelStates)
Dumps an
FST to a GraphViz's dot language description
for visualization. |
Constructor and Description |
---|
BytesRefFSTEnum(FST<T> fst)
doFloor controls the behavior of advance: if it's true
doFloor is true, advance positions to the biggest
term before target.
|
FSTEnum(FST<T> fst)
doFloor controls the behavior of advance: if it's true
doFloor is true, advance positions to the biggest
term before target.
|
IntsRefFSTEnum(FST<T> fst)
doFloor controls the behavior of advance: if it's true
doFloor is true, advance positions to the biggest
term before target.
|
NodeHash(FST<T> fst,
FST.BytesReader in) |
TopNSearcher(FST<T> fst,
int topN,
int maxQueueDepth,
java.util.Comparator<T> comparator)
Creates an unbounded TopNSearcher
|
TopNSearcher(FST<T> fst,
int topN,
int maxQueueDepth,
java.util.Comparator<T> comparator,
java.util.Comparator<Util.FSTPath<T>> pathComparator) |