public override bool ScoresDocsOutOfOrder()
{
int numProhibited = 0;
for (System.Collections.IEnumerator cIter = Enclosing_Instance.clauses.GetEnumerator(); cIter.MoveNext();)
{
BooleanClause c = (BooleanClause)cIter.Current;
if (c.IsRequired())
{
return(false); // BS2 (in-order) will be used by scorer()
}
else if (c.IsProhibited())
{
++numProhibited;
}
}
if (numProhibited > 32)
{
// cannot use BS
return(false);
}
// scorer() will return an out-of-order scorer if requested.
return(true);
}
/// <summary>Prints a user-readable version of this query. </summary>
public override System.String ToString(System.String field)
{
System.Text.StringBuilder buffer = new System.Text.StringBuilder();
bool needParens = (GetBoost() != 1.0) || (GetMinimumNumberShouldMatch() > 0);
if (needParens)
{
buffer.Append("(");
}
for (int i = 0; i < clauses.Count; i++)
{
BooleanClause c = (BooleanClause)clauses[i];
if (c.IsProhibited())
{
buffer.Append("-");
}
else if (c.IsRequired())
{
buffer.Append("+");
}
Query subQuery = c.GetQuery();
if (subQuery is BooleanQuery)
{
// wrap sub-bools in parens
buffer.Append("(");
buffer.Append(c.GetQuery().ToString(field));
buffer.Append(")");
}
else
{
buffer.Append(c.GetQuery().ToString(field));
}
if (i != clauses.Count - 1)
{
buffer.Append(" ");
}
}
if (needParens)
{
buffer.Append(")");
}
if (GetMinimumNumberShouldMatch() > 0)
{
buffer.Append('~');
buffer.Append(GetMinimumNumberShouldMatch());
}
if (GetBoost() != 1.0f)
{
buffer.Append(ToStringUtils.Boost(GetBoost()));
}
return(buffer.ToString());
}
public override Scorer Scorer(IndexReader reader, bool scoreDocsInOrder, bool topScorer)
{
List <Scorer> required = new List <Scorer>();
List <Scorer> prohibited = new List <Scorer>();
List <Scorer> optional = new List <Scorer>();
IEnumerator <BooleanClause> cIter = Enclosing_Instance.clauses.GetEnumerator();
foreach (Weight w in weights)
{
cIter.MoveNext();
BooleanClause c = cIter.Current;
Scorer subScorer = w.Scorer(reader, true, false);
if (subScorer == null)
{
if (c.IsRequired())
{
return(null);
}
}
else if (c.IsRequired())
{
required.Add(subScorer);
}
else if (c.IsProhibited())
{
prohibited.Add(subScorer);
}
else
{
optional.Add(subScorer);
}
}
// Check if we can return a BooleanScorer
scoreDocsInOrder |= !Lucene.Net.Search.BooleanQuery.allowDocsOutOfOrder; // until it is removed, factor in the static setting.
if (!scoreDocsInOrder && topScorer && required.Count == 0 && prohibited.Count < 32)
{
return(new BooleanScorer(similarity, Enclosing_Instance.minNrShouldMatch, optional, prohibited));
}
if (required.Count == 0 && optional.Count == 0)
{
// no required and optional clauses.
return(null);
}
else if (optional.Count < Enclosing_Instance.minNrShouldMatch)
{
// either >1 req scorer, or there are 0 req scorers and at least 1
// optional scorer. Therefore if there are not enough optional scorers
// no documents will be matched by the query
return(null);
}
// Return a BooleanScorer2
return(new BooleanScorer2(similarity, Enclosing_Instance.minNrShouldMatch, required, prohibited, optional));
}
public override Query Rewrite(IndexReader reader)
{
if (minNrShouldMatch == 0 && clauses.Count == 1)
{
// optimize 1-clause queries
BooleanClause c = (BooleanClause)clauses[0];
if (!c.IsProhibited())
{
// just return clause
Query query = c.GetQuery().Rewrite(reader); // rewrite first
if (GetBoost() != 1.0f)
{
// incorporate boost
if (query == c.GetQuery())
{
// if rewrite was no-op
query = (Query)query.Clone(); // then clone before boost
}
query.SetBoost(GetBoost() * query.GetBoost());
}
return(query);
}
}
BooleanQuery clone = null; // recursively rewrite
for (int i = 0; i < clauses.Count; i++)
{
BooleanClause c = (BooleanClause)clauses[i];
Query query = c.GetQuery().Rewrite(reader);
if (query != c.GetQuery())
{
// clause rewrote: must clone
if (clone == null)
{
clone = (BooleanQuery)this.Clone();
}
clone.clauses[i] = new BooleanClause(query, c.GetOccur());
}
}
if (clone != null)
{
return(clone); // some clauses rewrote
}
else
{
return(this); // no clauses rewrote
}
}
public virtual void Normalize(float norm)
{
norm *= Enclosing_Instance.GetBoost(); // incorporate boost
for (int i = 0; i < weights.Count; i++)
{
BooleanClause c = (BooleanClause)Enclosing_Instance.clauses[i];
Weight w = (Weight)weights[i];
if (!c.IsProhibited())
{
w.Normalize(norm);
}
}
}
public virtual float SumOfSquaredWeights()
{
float sum = 0.0f;
for (int i = 0; i < weights.Count; i++)
{
BooleanClause c = (BooleanClause)Enclosing_Instance.clauses[i];
Weight w = (Weight)weights[i];
if (!c.IsProhibited())
{
sum += w.SumOfSquaredWeights(); // sum sub weights
}
}
sum *= Enclosing_Instance.GetBoost() * Enclosing_Instance.GetBoost(); // boost each sub-weight
return(sum);
}
public override float SumOfSquaredWeights()
{
float sum = 0.0f;
for (int i = 0; i < weights.Count; i++)
{
BooleanClause c = (BooleanClause)Enclosing_Instance.clauses[i];
Weight w = (Weight)weights[i];
// call sumOfSquaredWeights for all clauses in case of side effects
float s = w.SumOfSquaredWeights(); // sum sub weights
if (!c.IsProhibited())
{
// only add to sum for non-prohibited clauses
sum += s;
}
}
sum *= Enclosing_Instance.GetBoost() * Enclosing_Instance.GetBoost(); // boost each sub-weight
return(sum);
}
/// <returns> An alternative Scorer that uses and provides skipTo(),
/// and scores documents in document number order.
/// </returns>
public override Scorer Scorer(IndexReader reader)
{
BooleanScorer2 result = new BooleanScorer2(similarity, Enclosing_Instance.minNrShouldMatch);
for (int i = 0; i < weights.Count; i++)
{
BooleanClause c = (BooleanClause)Enclosing_Instance.clauses[i];
Weight w = (Weight)weights[i];
Scorer subScorer = w.Scorer(reader);
if (subScorer != null)
{
result.Add(subScorer, c.IsRequired(), c.IsProhibited());
}
else if (c.IsRequired())
{
return(null);
}
}
return(result);
}
/// <returns> Returns BooleanScorer2 that uses and provides skipTo(),
/// and scores documents in document number order.
/// </returns>
public virtual Scorer Scorer(IndexReader reader)
{
BooleanScorer2 result = new BooleanScorer2(similarity, Enclosing_Instance.minNrShouldMatch, Lucene.Net.Search.BooleanQuery.allowDocsOutOfOrder);
for (int i = 0; i < weights.Count; i++)
{
BooleanClause c = (BooleanClause)Enclosing_Instance.clauses[i];
Weight w = (Weight)weights[i];
Scorer subScorer = w.Scorer(reader);
if (subScorer != null)
{
result.Add(subScorer, c.IsRequired(), c.IsProhibited());
}
else if (c.IsRequired())
{
return(null);
}
}
return(result);
}
public override Explanation Explain(IndexReader reader, int doc)
{
int minShouldMatch = Enclosing_Instance.GetMinimumNumberShouldMatch();
ComplexExplanation sumExpl = new ComplexExplanation();
sumExpl.SetDescription("sum of:");
int coord = 0;
int maxCoord = 0;
float sum = 0.0f;
bool fail = false;
int shouldMatchCount = 0;
for (System.Collections.IEnumerator wIter = weights.GetEnumerator(), cIter = Enclosing_Instance.clauses.GetEnumerator(); wIter.MoveNext();)
{
cIter.MoveNext();
Weight w = (Weight)wIter.Current;
BooleanClause c = (BooleanClause)cIter.Current;
if (w.Scorer(reader, true, true) == null)
{
continue;
}
Explanation e = w.Explain(reader, doc);
if (!c.IsProhibited())
{
maxCoord++;
}
if (e.IsMatch())
{
if (!c.IsProhibited())
{
sumExpl.AddDetail(e);
sum += e.GetValue();
coord++;
}
else
{
Explanation r = new Explanation(0.0f, "match on prohibited clause (" + c.GetQuery().ToString() + ")");
r.AddDetail(e);
sumExpl.AddDetail(r);
fail = true;
}
if (c.GetOccur() == Occur.SHOULD)
{
shouldMatchCount++;
}
}
else if (c.IsRequired())
{
Explanation r = new Explanation(0.0f, "no match on required clause (" + c.GetQuery().ToString() + ")");
r.AddDetail(e);
sumExpl.AddDetail(r);
fail = true;
}
}
if (fail)
{
System.Boolean tempAux = false;
sumExpl.SetMatch(tempAux);
sumExpl.SetValue(0.0f);
sumExpl.SetDescription("Failure to meet condition(s) of required/prohibited clause(s)");
return(sumExpl);
}
else if (shouldMatchCount < minShouldMatch)
{
System.Boolean tempAux2 = false;
sumExpl.SetMatch(tempAux2);
sumExpl.SetValue(0.0f);
sumExpl.SetDescription("Failure to match minimum number " + "of optional clauses: " + minShouldMatch);
return(sumExpl);
}
sumExpl.SetMatch(0 < coord?true:false);
sumExpl.SetValue(sum);
float coordFactor = similarity.Coord(coord, maxCoord);
if (coordFactor == 1.0f)
{
// coord is no-op
return(sumExpl);
}
// eliminate wrapper
else
{
ComplexExplanation result = new ComplexExplanation(sumExpl.IsMatch(), sum * coordFactor, "product of:");
result.AddDetail(sumExpl);
result.AddDetail(new Explanation(coordFactor, "coord(" + coord + "/" + maxCoord + ")"));
return(result);
}
}
public virtual Explanation Explain(IndexReader reader, int doc)
{
Explanation sumExpl = new Explanation();
sumExpl.SetDescription("sum of:");
int coord = 0;
int maxCoord = 0;
float sum = 0.0f;
for (int i = 0; i < weights.Count; i++)
{
BooleanClause c = (BooleanClause)Enclosing_Instance.clauses[i];
Weight w = (Weight)weights[i];
Explanation e = w.Explain(reader, doc);
if (!c.IsProhibited())
{
maxCoord++;
}
if (e.GetValue() > 0)
{
if (!c.IsProhibited())
{
sumExpl.AddDetail(e);
sum += e.GetValue();
coord++;
}
else
{
return(new Explanation(0.0f, "match prohibited"));
}
}
else if (c.IsRequired())
{
return(new Explanation(0.0f, "match required"));
}
}
sumExpl.SetValue(sum);
if (coord == 1)
{
// only one clause matched
sumExpl = sumExpl.GetDetails()[0]; // eliminate wrapper
}
float coordFactor = similarity.Coord(coord, maxCoord);
if (coordFactor == 1.0f)
{
// coord is no-op
return(sumExpl);
}
// eliminate wrapper
else
{
Explanation result = new Explanation();
result.SetDescription("product of:");
result.AddDetail(sumExpl);
result.AddDetail(new Explanation(coordFactor, "coord(" + coord + "/" + maxCoord + ")"));
result.SetValue(sum * coordFactor);
return(result);
}
}
/// <returns> A good old 1.4 Scorer
/// </returns>
public virtual Scorer Scorer(IndexReader reader)
{
// First see if the (faster) ConjunctionScorer will work. This can be
// used when all clauses are required. Also, at this point a
// BooleanScorer cannot be embedded in a ConjunctionScorer, as the hits
// from a BooleanScorer are not always sorted by document number (sigh)
// and hence BooleanScorer cannot implement skipTo() correctly, which is
// required by ConjunctionScorer.
bool allRequired = true;
bool noneBoolean = true;
for (int i = 0; i < weights.Count; i++)
{
BooleanClause c = (BooleanClause)Enclosing_Instance.clauses[i];
if (!c.IsRequired())
{
allRequired = false;
}
if (c.GetQuery() is BooleanQuery)
{
noneBoolean = false;
}
}
if (allRequired && noneBoolean)
{
// ConjunctionScorer is okay
ConjunctionScorer result = new ConjunctionScorer(similarity);
for (int i = 0; i < weights.Count; i++)
{
Weight w = (Weight)weights[i];
Scorer subScorer = w.Scorer(reader);
if (subScorer == null)
{
return(null);
}
result.Add(subScorer);
}
return(result);
}
// Use good-old BooleanScorer instead.
BooleanScorer result2 = new BooleanScorer(similarity);
for (int i = 0; i < weights.Count; i++)
{
BooleanClause c = (BooleanClause)Enclosing_Instance.clauses[i];
Weight w = (Weight)weights[i];
Scorer subScorer = w.Scorer(reader);
if (subScorer != null)
{
result2.Add(subScorer, c.IsRequired(), c.IsProhibited());
}
else if (c.IsRequired())
{
return(null);
}
}
return(result2);
}
