Package org.apache.lucene.search.suggest
Class Lookup
java.lang.Object
org.apache.lucene.search.suggest.Lookup
- Direct Known Subclasses:
AnalyzingInfixSuggester,AnalyzingSuggester,FreeTextSuggester,FSTCompletionLookup,JaspellLookup,TSTLookup,WFSTCompletionLookup
Simple Lookup interface for
CharSequence suggestions.-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic final classAPriorityQueuecollecting a fixed size of high priorityLookup.LookupResultstatic final classResult of a lookup. -
Field Summary
FieldsModifier and TypeFieldDescriptionstatic final Comparator<CharSequence> A simple char-by-char comparator forCharSequence -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoidbuild(Dictionary dict) Build lookup from a dictionary.abstract voidbuild(InputIterator inputIterator) Builds up a new internalLookuprepresentation based on the givenInputIterator.abstract longgetCount()Get the number of entries the lookup was built withbooleanload(InputStream input) abstract booleanDiscard current lookup data and load it from a previously saved copy.abstract List<Lookup.LookupResult> lookup(CharSequence key, boolean onlyMorePopular, int num) Look up a key and return possible completion for this key.abstract longGet the size of the underlying lookup implementation in memorybooleanstore(OutputStream output) abstract booleanstore(DataOutput output) Persist the constructed lookup data to a directory.
-
Field Details
-
CHARSEQUENCE_COMPARATOR
A simple char-by-char comparator forCharSequence
-
-
Constructor Details
-
Lookup
public Lookup()Sole constructor. (For invocation by subclass constructors, typically implicit.)
-
-
Method Details
-
build
Build lookup from a dictionary. Some implementations may require sorted or unsorted keys from the dictionary's iterator - useSortedInputIteratororUnsortedInputIteratorin such case.- Throws:
IOException
-
load
- Throws:
IOException
-
store
- Throws:
IOException
-
getCount
public abstract long getCount()Get the number of entries the lookup was built with- Returns:
- total number of suggester entries
-
build
Builds up a new internalLookuprepresentation based on the givenInputIterator. The implementation might re-sort the data internally.- Throws:
IOException
-
lookup
public abstract List<Lookup.LookupResult> lookup(CharSequence key, boolean onlyMorePopular, int num) Look up a key and return possible completion for this key.- Parameters:
key- lookup key. Depending on the implementation this may be a prefix, misspelling, or even infix.onlyMorePopular- return only more popular resultsnum- maximum number of results to return- Returns:
- a list of possible completions, with their relative weight (e.g. popularity)
-
store
Persist the constructed lookup data to a directory. Optional operation.- Parameters:
output-DataOutputto write the data to.- Returns:
- true if successful, false if unsuccessful or not supported.
- Throws:
IOException- when fatal IO error occurs.
-
load
Discard current lookup data and load it from a previously saved copy. Optional operation.- Parameters:
input- theDataInputto load the lookup data.- Returns:
- true if completed successfully, false if unsuccessful or not supported.
- Throws:
IOException- when fatal IO error occurs.
-
sizeInBytes
public abstract long sizeInBytes()Get the size of the underlying lookup implementation in memory- Returns:
- ram size of the lookup implementation in bytes
-