| 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.classification |
Uses already seen data (the indexed documents) to classify an input ( can be simple text or a structured document).
|
| org.apache.lucene.codecs.blockterms |
Pluggable term index / block terms dictionary implementations.
|
| org.apache.lucene.codecs.blocktree |
BlockTree terms dictionary.
|
| org.apache.lucene.codecs.blocktreeords |
Same postings format as Lucene50, except the terms dictionary also
supports ords, i.e.
|
| 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.codecs.memory |
Term dictionary, DocValues or Postings formats that are read
entirely into memory.
|
| org.apache.lucene.codecs.simpletext |
Simpletext Codec: writes human readable postings.
|
| org.apache.lucene.codecs.uniformsplit |
Pluggable term index / block terms dictionary implementations.
|
| org.apache.lucene.search.suggest.analyzing |
Analyzer based autosuggest.
|
| org.apache.lucene.search.suggest.document |
Support for document suggestion
|
| org.apache.lucene.search.suggest.fst |
Finite-state based autosuggest.
|
| org.apache.lucene.util.fst |
Finite state transducers
|
| Class and Description |
|---|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| Outputs
Represents the outputs for an FST, providing the basic
algebra required for building and traversing the FST.
|
| Class and Description |
|---|
| Builder
Builds a minimal FST (maps an IntsRef term to an arbitrary
output) from pre-sorted terms with outputs.
|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| Class and Description |
|---|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| Class and Description |
|---|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| Class and Description |
|---|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| Class and Description |
|---|
| Builder
Builds a minimal FST (maps an IntsRef term to an arbitrary
output) from pre-sorted terms with outputs.
|
| BytesRefFSTEnum
Enumerates all input (BytesRef) + output pairs in an
FST.
|
| BytesRefFSTEnum.InputOutput
Holds a single input (BytesRef) + output pair.
|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| PositiveIntOutputs
An FST
Outputs implementation where each output
is a non-negative long value. |
| Class and Description |
|---|
| Builder
Builds a minimal FST (maps an IntsRef term to an arbitrary
output) from pre-sorted terms with outputs.
|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| Outputs
Represents the outputs for an FST, providing the basic
algebra required for building and traversing the FST.
|
| Class and Description |
|---|
| Builder
Builds a minimal FST (maps an IntsRef term to an arbitrary
output) from pre-sorted terms with outputs.
|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| Outputs
Represents the outputs for an FST, providing the basic
algebra required for building and traversing the FST.
|
| Class and Description |
|---|
| Builder
Builds a minimal FST (maps an IntsRef term to an arbitrary
output) from pre-sorted terms with outputs.
|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| PairOutputs
An FST
Outputs implementation, holding two other outputs. |
| PairOutputs.Pair
Holds a single pair of two outputs.
|
| Class and Description |
|---|
| Builder
Builds a minimal FST (maps an IntsRef term to an arbitrary
output) from pre-sorted terms with outputs.
|
| BytesRefFSTEnum
Enumerates all input (BytesRef) + output pairs in an
FST.
|
| BytesRefFSTEnum.InputOutput
Holds a single input (BytesRef) + output pair.
|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| Outputs
Represents the outputs for an FST, providing the basic
algebra required for building and traversing the FST.
|
| PositiveIntOutputs
An FST
Outputs implementation where each output
is a non-negative long value. |
| Class and Description |
|---|
| BytesRefFSTEnum
Enumerates all input (BytesRef) + output pairs in an
FST.
|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| PairOutputs.Pair
Holds a single pair of two outputs.
|
| Class and Description |
|---|
| Builder
Builds a minimal FST (maps an IntsRef term to an arbitrary
output) from pre-sorted terms with outputs.
|
| BytesRefFSTEnum
Enumerates all input (BytesRef) + output pairs in an
FST.
|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| Class and Description |
|---|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| PairOutputs.Pair
Holds a single pair of two outputs.
|
| Class and Description |
|---|
| Builder
Builds a minimal FST (maps an IntsRef term to an arbitrary
output) from pre-sorted terms with outputs.
|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| PairOutputs
An FST
Outputs implementation, holding two other outputs. |
| PairOutputs.Pair
Holds a single pair of two outputs.
|
| Util.FSTPath
Represents a path in TopNSearcher.
|
| Class and Description |
|---|
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| Class and Description |
|---|
| Builder
Builds a minimal FST (maps an IntsRef term to an arbitrary
output) from pre-sorted terms with outputs.
|
| Builder.Arc
Expert: holds a pending (seen but not yet serialized) arc.
|
| Builder.CompiledNode |
| Builder.FixedLengthArcsBuffer
Reusable buffer for building nodes with fixed length arcs (binary search or direct addressing).
|
| Builder.Node |
| Builder.UnCompiledNode
Expert: holds a pending (seen but not yet serialized) Node.
|
| ByteSequenceOutputs
An FST
Outputs implementation where each output
is a sequence of bytes. |
| BytesRefFSTEnum.InputOutput
Holds a single input (BytesRef) + output pair.
|
| BytesStore |
| CharSequenceOutputs
An FST
Outputs implementation where each output
is a sequence of characters. |
| FST
Represents an finite state machine (FST), using a
compact byte[] format.
|
| FST.Arc
Represents a single arc.
|
| FST.Arc.BitTable
Reusable table of bits using an array of long internally.
|
| FST.BytesReader
Reads bytes stored in an FST.
|
| FST.INPUT_TYPE
Specifies allowed range of each int input label for
this FST.
|
| FSTEnum
Can next() and advance() through the terms in an FST
|
| FSTStore
Abstraction for reading/writing bytes necessary for FST.
|
| IntSequenceOutputs
An FST
Outputs implementation where each output
is a sequence of ints. |
| IntsRefFSTEnum.InputOutput
Holds a single input (IntsRef) + output pair.
|
| NodeHash |
| NoOutputs
A null FST
Outputs implementation; use this if
you just want to build an FSA. |
| Outputs
Represents the outputs for an FST, providing the basic
algebra required for building and traversing the FST.
|
| PairOutputs.Pair
Holds a single pair of two outputs.
|
| PositiveIntOutputs
An FST
Outputs implementation where each output
is a non-negative long value. |
| UpToTwoPositiveIntOutputs
An FST
Outputs implementation where each output
is one or two non-negative long values. |
| UpToTwoPositiveIntOutputs.TwoLongs
Holds two long outputs.
|
| Util.FSTPath
Represents a path in TopNSearcher.
|
| Util.Result
Holds a single input (IntsRef) + output, returned by
shortestPaths(). |
| Util.TopResults
Holds the results for a top N search using
Util.TopNSearcher |