You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@lucenenet.apache.org by la...@apache.org on 2015/05/24 23:13:48 UTC

lucenenet git commit: put back failing code

Repository: lucenenet
Updated Branches:
  refs/heads/failingtests 17f0683bf -> 2e9162a99


put back failing code


Project: http://git-wip-us.apache.org/repos/asf/lucenenet/repo
Commit: http://git-wip-us.apache.org/repos/asf/lucenenet/commit/2e9162a9
Tree: http://git-wip-us.apache.org/repos/asf/lucenenet/tree/2e9162a9
Diff: http://git-wip-us.apache.org/repos/asf/lucenenet/diff/2e9162a9

Branch: refs/heads/failingtests
Commit: 2e9162a995e2564f8955991cc5fdcf82b1f66c0a
Parents: 17f0683
Author: Laimonas Simutis <la...@gmail.com>
Authored: Sun May 24 17:13:30 2015 -0400
Committer: Laimonas Simutis <la...@gmail.com>
Committed: Sun May 24 17:13:30 2015 -0400

----------------------------------------------------------------------
 src/Lucene.Net.Core/Search/FuzzyTermsEnum.cs | 12 +-----------
 1 file changed, 1 insertion(+), 11 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/lucenenet/blob/2e9162a9/src/Lucene.Net.Core/Search/FuzzyTermsEnum.cs
----------------------------------------------------------------------
diff --git a/src/Lucene.Net.Core/Search/FuzzyTermsEnum.cs b/src/Lucene.Net.Core/Search/FuzzyTermsEnum.cs
index 0fc04ac..c6125a5 100644
--- a/src/Lucene.Net.Core/Search/FuzzyTermsEnum.cs
+++ b/src/Lucene.Net.Core/Search/FuzzyTermsEnum.cs
@@ -244,21 +244,11 @@ namespace Lucene.Net.Search
 
             OutputCollector.AppendLine("    termAfter=" + termAfter + ", Bottom=" + Bottom.ToString("f20"));
 
-            var maxBoost = CalculateMaxBoost(MaxEdits);
-            
-            // this is just silliness, but worth a shot
-            for (int i = 0; i < 10; i++)
-            {
-                OutputCollector.AppendLine("    repeated calc: " + maxBoost.ToString("f20"));
-                maxBoost = CalculateMaxBoost(MaxEdits);
-            }
-
             // as long as the max non-competitive boost is >= the max boost
             // for some edit distance, keep dropping the max edit distance.
-            while (MaxEdits > 0 && (termAfter ? Bottom >= maxBoost : Bottom > maxBoost))
+            while (MaxEdits > 0 && (termAfter ? Bottom >= CalculateMaxBoost(MaxEdits) : Bottom > CalculateMaxBoost(MaxEdits)))
             {
                 MaxEdits--;
-                maxBoost = CalculateMaxBoost(MaxEdits);
             }
 
             OutputCollector.AppendLine("    oldMaxEdits=" + oldMaxEdits + ", maxEdits=" + MaxEdits);