@API(value=EXPERIMENTAL) public static class Comparisons.TextContainsAllPrefixesComparison extends Comparisons.TextComparison
Comparisons.TextComparison
that checks for all prefixes. It carries additional meta-data about whether the
comparison is "strict" or not, i.e., whether it is allowed to return false positives.Constructor and Description |
---|
TextContainsAllPrefixesComparison(List<String> tokenPrefixes,
boolean strict,
long expectedRecords,
double falsePositivePercentage,
String tokenizerName,
String fallbackTokenizerName) |
TextContainsAllPrefixesComparison(List<String> tokenPrefixes,
boolean strict,
String tokenizerName,
String fallbackTokenizerName) |
TextContainsAllPrefixesComparison(String tokenPrefixes,
boolean strict,
long expectedRecords,
double falsePositivePercentage,
String tokenizerName,
String fallbackTokenizerName) |
TextContainsAllPrefixesComparison(String tokenPrefixes,
boolean strict,
String tokenizerName,
String fallbackTokenizerName) |
Modifier and Type | Method and Description |
---|---|
boolean |
equals(Object o) |
long |
getExpectedRecords()
Get the expected number of records for each token of this predicate.
|
double |
getFalsePositivePercentage()
Get the configured false positive percentage for each token scan of this predicate.
|
int |
hashCode() |
boolean |
isStrict()
Whether this comparison should be strictly evaluated.
|
int |
planHash()
Return a hash similar to
hashCode , but with the additional guarantee that is is stable across JVMs. |
String |
toString() |
eval, getComparand, getFallbackTokenizerName, getTokenizerName, getType, typelessString, validate
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
getComparand
combineHashes, iterablePlanHash, objectPlanHash, objectsPlanHash, planHash, planHash, planHashUnordered, stringHashUnordered
public TextContainsAllPrefixesComparison(@Nonnull String tokenPrefixes, boolean strict, @Nullable String tokenizerName, @Nonnull String fallbackTokenizerName)
public TextContainsAllPrefixesComparison(@Nonnull String tokenPrefixes, boolean strict, long expectedRecords, double falsePositivePercentage, @Nullable String tokenizerName, @Nonnull String fallbackTokenizerName)
public TextContainsAllPrefixesComparison(@Nonnull List<String> tokenPrefixes, boolean strict, @Nullable String tokenizerName, @Nonnull String fallbackTokenizerName)
public boolean isStrict()
false
if false positives are acceptable and true
otherwisepublic long getExpectedRecords()
public double getFalsePositivePercentage()
getExpectedRecords()
, determines the size of internal data structures used as part of the
scan. In general, the lower this number, the more memory is used. This number refers to the false positive
percentage of determining if an individual prefix is in the indexed text field of a record while
scanning.public boolean equals(Object o)
equals
in class Comparisons.TextComparison
public int planHash()
PlanHashable
hashCode
, but with the additional guarantee that is is stable across JVMs.planHash
in interface PlanHashable
planHash
in class Comparisons.TextComparison
public int hashCode()
hashCode
in class Comparisons.TextComparison
@Nonnull public String toString()
toString
in class Comparisons.TextComparison