메소드 | 설명 | |
---|---|---|
Check ( |
Check the types of things query objects should be able to do.
|
|
Check ( |
Various query sanity checks on a searcher, some checks are only done for instanceof IndexSearcher.
|
|
Check ( |
||
CheckEqual ( |
||
CheckExplanations ( |
deep check that explanations of a query 'score' correctly
|
|
CheckFirstSkipTo ( |
check that first skip on just created scorers always goes to the right doc
|
|
CheckHashEquals ( |
check very basic hashCode and equals
|
|
CheckSkipTo ( |
alternate scorer skipTo(),skipTo(),next(),next(),skipTo(),skipTo(), etc and ensure a hitcollector receives same docs and scores
|
|
CheckUnequal ( |
||
PurgeFieldCache ( IndexReader r ) : void | ||
WrapUnderlyingReader ( |
Given an IndexSearcher, returns a new IndexSearcher whose IndexReader is a MultiReader containing the Reader of the original IndexSearcher, as well as several "empty" IndexReaders -- some of which will have deleted documents in them. this new IndexSearcher should behave exactly the same as the original IndexSearcher.
|
메소드 | 설명 | |
---|---|---|
MakeEmptyIndex ( |
||
QueryUtils ( ) : System |
public static Check ( |
||
random | ||
q1 | ||
s | ||
similarity |
/// LUCENENET specific
/// Removes dependency on |
|
리턴 | void |
public static Check ( |
||
random | ||
q1 | ||
s | ||
wrap | bool | |
similarity |
/// LUCENENET specific
/// Removes dependency on |
|
리턴 | void |
public static CheckEqual ( |
||
q1 | ||
q2 | ||
리턴 | void |
public static CheckExplanations ( |
||
q | ||
s | ||
리턴 | void |
public static CheckFirstSkipTo ( |
||
q | ||
s | ||
similarity |
/// LUCENENET specific
/// Removes dependency on |
|
리턴 | void |
public static CheckSkipTo ( |
||
q | ||
s | ||
similarity |
/// LUCENENET specific
/// Removes dependency on |
|
리턴 | void |
public static CheckUnequal ( |
||
q1 | ||
q2 | ||
리턴 | void |
public static PurgeFieldCache ( IndexReader r ) : void | ||
r | IndexReader | |
리턴 | void |
public static WrapUnderlyingReader ( |
||
random | ||
s | the searcher to wrap | |
edge | int | if negative, s will be the first sub; if 0, s will be in the middle, if positive s will be the last sub |
similarity |
/// LUCENENET specific
/// Removes dependency on |
|
리턴 |