lucene-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From rm...@apache.org
Subject svn commit: r1329042 - /lucene/dev/trunk/lucene/facet/src/java/org/apache/lucene/facet/search/TopKInEachNodeHandler.java
Date Mon, 23 Apr 2012 02:48:02 GMT
Author: rmuir
Date: Mon Apr 23 02:48:01 2012
New Revision: 1329042

URL: http://svn.apache.org/viewvc?rev=1329042&view=rev
Log:
fix broken javadocs links (public inner classes taking AAC0 as a parameter)

Modified:
    lucene/dev/trunk/lucene/facet/src/java/org/apache/lucene/facet/search/TopKInEachNodeHandler.java

Modified: lucene/dev/trunk/lucene/facet/src/java/org/apache/lucene/facet/search/TopKInEachNodeHandler.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/facet/src/java/org/apache/lucene/facet/search/TopKInEachNodeHandler.java?rev=1329042&r1=1329041&r2=1329042&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/facet/src/java/org/apache/lucene/facet/search/TopKInEachNodeHandler.java
(original)
+++ lucene/dev/trunk/lucene/facet/src/java/org/apache/lucene/facet/search/TopKInEachNodeHandler.java
Mon Apr 23 02:48:01 2012
@@ -676,7 +676,7 @@ public class TopKInEachNodeHandler exten
   }
 
   /**
-   * Maintains an array of {@link AggregatedCategory}. For space consideration, this is implemented
as 
+   * Maintains an array of <code>AggregatedCategory</code>. For space consideration,
this is implemented as 
    * a pair of arrays, <i>ordinals</i> and <i>values</i>, rather
than one array of pairs.
    * Enumerated in <i>ordinals</i> are siblings,  
    * potential nodes of the {@link FacetResult} tree  
@@ -685,8 +685,9 @@ public class TopKInEachNodeHandler exten
    * siblings are enumerated, and  
    * <i>residue</i> holds the sum of values of the siblings rejected from the

    * enumerated top K.
+   * @lucene.internal
    */
-  private static final class AACO {
+  protected static final class AACO {
     int [] ordinals; // ordinals of the best K children, sorted from best to least
     double [] values; // the respective values for these children
     double residue; // sum of values of all other children, that did not get into top K



Mime
View raw message