You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@lucene.apache.org by mi...@apache.org on 2012/06/12 18:55:28 UTC
svn commit: r1349437 -
/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/index/TieredMergePolicy.java
Author: mikemccand
Date: Tue Jun 12 16:55:28 2012
New Revision: 1349437
URL: http://svn.apache.org/viewvc?rev=1349437&view=rev
Log:
javadocs
Modified:
lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/index/TieredMergePolicy.java
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/index/TieredMergePolicy.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/index/TieredMergePolicy.java?rev=1349437&r1=1349436&r2=1349437&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/index/TieredMergePolicy.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/index/TieredMergePolicy.java Tue Jun 12 16:55:28 2012
@@ -38,7 +38,7 @@ import java.util.ArrayList;
* policy also does not over-merge (i.e. cascade merges).
*
* <p>For normal merging, this policy first computes a
- * "budget" of how many segments are allowed by be in the
+ * "budget" of how many segments are allowed to be in the
* index. If the index is over-budget, then the policy
* sorts segments by decreasing size (pro-rating by percent
* deletes), and then finds the least-cost merge. Merge