Index: lucene/facet/src/java/org/apache/lucene/facet/search/DepthOneFacetResultsHandler.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/search/DepthOneFacetResultsHandler.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/search/DepthOneFacetResultsHandler.java (working copy) @@ -46,7 +46,7 @@ @Override protected FacetResultNode getSentinelObject() { - return new FacetResultNode(); + return new FacetResultNode(TaxonomyReader.INVALID_ORDINAL, 0); } @Override @@ -80,7 +80,8 @@ * Add the siblings of {@code ordinal} to the given {@link PriorityQueue}. The * given {@link PriorityQueue} is already filled with sentinel objects, so * implementations are encouraged to use {@link PriorityQueue#top()} and - * {@link PriorityQueue#updateTop()} for best performance. + * {@link PriorityQueue#updateTop()} for best performance. Returns the total + * number of siblings. */ protected abstract int addSiblings(int ordinal, int[] siblings, PriorityQueue pq); @@ -92,10 +93,8 @@ int rootOrd = taxonomyReader.getOrdinal(facetRequest.categoryPath); - FacetResultNode root = new FacetResultNode(); - root.ordinal = rootOrd; + FacetResultNode root = new FacetResultNode(rootOrd, valueOf(rootOrd)); root.label = facetRequest.categoryPath; - root.value = valueOf(rootOrd); if (facetRequest.numResults > taxonomyReader.getSize()) { // specialize this case, user is interested in all available results ArrayList nodes = new ArrayList(); @@ -118,11 +117,11 @@ // since we use sentinel objects, we cannot reuse PQ. but that's ok because it's not big PriorityQueue pq = new FacetResultNodeQueue(facetRequest.numResults, true); - int numResults = addSiblings(children[rootOrd], siblings, pq); + int numSiblings = addSiblings(children[rootOrd], siblings, pq); // pop() the least (sentinel) elements int pqsize = pq.size(); - int size = numResults < pqsize ? numResults : pqsize; + int size = numSiblings < pqsize ? numSiblings : pqsize; for (int i = pqsize - size; i > 0; i--) { pq.pop(); } // create the FacetResultNodes. @@ -133,7 +132,7 @@ subResults[i] = node; } root.subResults = Arrays.asList(subResults); - return new FacetResult(facetRequest, root, size); + return new FacetResult(facetRequest, root, numSiblings); } } Index: lucene/facet/src/java/org/apache/lucene/facet/search/FacetResult.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/search/FacetResult.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/search/FacetResult.java (working copy) @@ -40,19 +40,15 @@ * @see FacetRequest#categoryPath */ public final FacetResultNode getFacetResultNode() { - return this.rootNode; + return rootNode; } /** * Number of descendants of {@link #getFacetResultNode() root facet result - * node}, up till the requested depth. Typically -- have value != 0. This - * number does not include the root node. - * - * @see #getFacetRequest() - * @see FacetRequest#getDepth() + * node}, up till the requested depth. */ public final int getNumValidDescendants() { - return this.numValidDescendants; + return numValidDescendants; } /** @@ -61,7 +57,7 @@ public final FacetRequest getFacetRequest() { return this.facetRequest; } - + /** * String representation of this facet result. * Use with caution: might return a very long string. Index: lucene/facet/src/java/org/apache/lucene/facet/search/FacetResultNode.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/search/FacetResultNode.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/search/FacetResultNode.java (working copy) @@ -67,10 +67,6 @@ */ public List subResults = EMPTY_SUB_RESULTS; - public FacetResultNode() { - // empty constructor - } - public FacetResultNode(int ordinal, double value) { this.ordinal = ordinal; this.value = value; Index: lucene/facet/src/java/org/apache/lucene/facet/search/FacetsAccumulator.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/search/FacetsAccumulator.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/search/FacetsAccumulator.java (working copy) @@ -81,11 +81,10 @@ return new FacetsAccumulator(fsp, indexReader, taxoReader); } - private static FacetResult emptyResult(int ordinal, FacetRequest fr) { - FacetResultNode root = new FacetResultNode(); - root.ordinal = ordinal; + /** Returns an empty {@link FacetResult}. */ + protected static FacetResult emptyResult(int ordinal, FacetRequest fr) { + FacetResultNode root = new FacetResultNode(ordinal, 0); root.label = fr.categoryPath; - root.value = 0; return new FacetResult(fr, root, 0); } Index: lucene/facet/src/java/org/apache/lucene/facet/search/FloatFacetResultsHandler.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/search/FloatFacetResultsHandler.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/search/FloatFacetResultsHandler.java (working copy) @@ -43,18 +43,19 @@ return values[ordinal]; } - @Override protected final int addSiblings(int ordinal, int[] siblings, PriorityQueue pq) { FacetResultNode top = pq.top(); int numResults = 0; while (ordinal != TaxonomyReader.INVALID_ORDINAL) { float value = values[ordinal]; - if (value > top.value) { - top.value = value; - top.ordinal = ordinal; - top = pq.updateTop(); + if (value > 0.0f) { ++numResults; + if (value > top.value) { + top.value = value; + top.ordinal = ordinal; + top = pq.updateTop(); + } } ordinal = siblings[ordinal]; } Index: lucene/facet/src/java/org/apache/lucene/facet/search/IntFacetResultsHandler.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/search/IntFacetResultsHandler.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/search/IntFacetResultsHandler.java (working copy) @@ -49,11 +49,13 @@ int numResults = 0; while (ordinal != TaxonomyReader.INVALID_ORDINAL) { int value = values[ordinal]; - if (value > top.value) { - top.value = value; - top.ordinal = ordinal; - top = pq.updateTop(); + if (value > 0) { ++numResults; + if (value > top.value) { + top.value = value; + top.ordinal = ordinal; + top = pq.updateTop(); + } } ordinal = siblings[ordinal]; } Index: lucene/facet/src/java/org/apache/lucene/facet/search/StandardFacetsAccumulator.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/search/StandardFacetsAccumulator.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/search/StandardFacetsAccumulator.java (working copy) @@ -198,11 +198,7 @@ IntermediateFacetResult tmpResult = fr2tmpRes.get(fr); if (tmpResult == null) { // Add empty FacetResult: - FacetResultNode root = new FacetResultNode(); - root.ordinal = TaxonomyReader.INVALID_ORDINAL; - root.label = fr.categoryPath; - root.value = 0; - res.add(new FacetResult(fr, root, 0)); + res.add(emptyResult(taxonomyReader.getOrdinal(fr.categoryPath), fr)); continue; } FacetResult facetRes = frHndlr.renderFacetResult(tmpResult); Index: lucene/facet/src/java/org/apache/lucene/facet/search/TopKFacetResultsHandler.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/search/TopKFacetResultsHandler.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/search/TopKFacetResultsHandler.java (working copy) @@ -256,7 +256,6 @@ * Create a Facet Result. * @param facetRequest Request for which this result was obtained. * @param facetResultNode top result node for this facet result. - * @param totalFacets - number of children of the targetFacet, up till the requested depth. */ TopKFacetResult(FacetRequest facetRequest, FacetResultNode facetResultNode, int totalFacets) { super(facetRequest, facetResultNode, totalFacets); Index: lucene/facet/src/java/org/apache/lucene/facet/search/TopKInEachNodeHandler.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/search/TopKInEachNodeHandler.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/search/TopKInEachNodeHandler.java (working copy) @@ -706,8 +706,7 @@ value = tmp.rootNodeValue; } FacetResultNode root = generateNode(ordinal, value, tmp.mapToAACOs); - return new FacetResult (tmp.facetRequest, root, tmp.totalNumOfFacetsConsidered); - + return new FacetResult(tmp.facetRequest, root, tmp.totalNumOfFacetsConsidered); } private FacetResultNode generateNode(int ordinal, double val, IntToObjectMap mapToAACOs) { Index: lucene/facet/src/java/org/apache/lucene/facet/sortedset/SortedSetDocValuesAccumulator.java =================================================================== --- lucene/facet/src/java/org/apache/lucene/facet/sortedset/SortedSetDocValuesAccumulator.java (revision 1466615) +++ lucene/facet/src/java/org/apache/lucene/facet/sortedset/SortedSetDocValuesAccumulator.java (working copy) @@ -107,7 +107,6 @@ if (matchingDocs.totalHits < numSegOrds/10) { // Remap every ord to global ord as we iterate: - final int[] segCounts = new int[numSegOrds]; int doc = 0; while (doc < maxDoc && (doc = matchingDocs.bits.nextSetBit(doc)) != -1) { segValues.setDocument(doc); @@ -259,23 +258,27 @@ //System.out.println("collect"); int dimCount = 0; + int childCount = 0; FacetResultNode reuse = null; for(int ord=ordRange.start; ord<=ordRange.end; ord++) { //System.out.println(" ord=" + ord + " count= "+ counts[ord] + " bottomCount=" + bottomCount); - if (counts[ord] > bottomCount) { - dimCount += counts[ord]; - //System.out.println(" keep"); - if (reuse == null) { - reuse = new FacetResultNode(ord, counts[ord]); - } else { - reuse.ordinal = ord; - reuse.value = counts[ord]; + if (counts[ord] > 0) { + childCount++; + if (counts[ord] > bottomCount) { + dimCount += counts[ord]; + //System.out.println(" keep"); + if (reuse == null) { + reuse = new FacetResultNode(ord, counts[ord]); + } else { + reuse.ordinal = ord; + reuse.value = counts[ord]; + } + reuse = q.insertWithOverflow(reuse); + if (q.size() == request.numResults) { + bottomCount = (int) q.top().value; + //System.out.println(" new bottom=" + bottomCount); + } } - reuse = q.insertWithOverflow(reuse); - if (q.size() == request.numResults) { - bottomCount = (int) q.top().value; - //System.out.println(" new bottom=" + bottomCount); - } } } @@ -295,7 +298,7 @@ } rootNode.subResults = Arrays.asList(childNodes); - results.add(new FacetResult(request, rootNode, childNodes.length)); + results.add(new FacetResult(request, rootNode, childCount)); } return results; Index: lucene/facet/src/test/org/apache/lucene/facet/search/TestDrillSideways.java =================================================================== --- lucene/facet/src/test/org/apache/lucene/facet/search/TestDrillSideways.java (revision 1466615) +++ lucene/facet/src/test/org/apache/lucene/facet/search/TestDrillSideways.java (working copy) @@ -150,10 +150,13 @@ // Publish Date is only drill-down, and Lisa published // one in 2012 and one in 2010: assertEquals("Publish Date: 2012=1 2010=1", toString(r.facetResults.get(0))); + assertEquals(2, r.facetResults.get(0).getNumValidDescendants()); + // Author is drill-sideways + drill-down: Lisa // (drill-down) published twice, and Frank/Susan/Bob // published once: assertEquals("Author: Lisa=2 Frank=1 Susan=1 Bob=1", toString(r.facetResults.get(1))); + assertEquals(4, r.facetResults.get(1).getNumValidDescendants()); // Another simple case: drill-down on on single fields // but OR of two values @@ -766,6 +769,7 @@ ds = new DrillSideways(s, tr); } + // Retrieve all facets: DrillSidewaysResult actual = ds.search(ddq, filter, null, numDocs, sort, true, true, fsp); TopDocs hits = s.search(baseQuery, numDocs); @@ -773,9 +777,12 @@ for(ScoreDoc sd : hits.scoreDocs) { scores.put(s.doc(sd.doc).get("id"), sd.score); } + if (VERBOSE) { + System.out.println(" verify all facets"); + } verifyEquals(requests, dimValues, s, expected, actual, scores, -1, doUseDV); - // Make sure topN works: + // Retrieve topN facets: int topN = _TestUtil.nextInt(random(), 1, 20); List newRequests = new ArrayList(); @@ -784,6 +791,9 @@ } fsp = new FacetSearchParams(newRequests); actual = ds.search(ddq, filter, null, numDocs, sort, true, true, fsp); + if (VERBOSE) { + System.out.println(" verify topN=" + topN); + } verifyEquals(newRequests, dimValues, s, expected, actual, scores, topN, doUseDV); // Make sure drill down doesn't change score: @@ -834,6 +844,7 @@ private static class SimpleFacetResult { List hits; int[][] counts; + int[] uniqueCounts; } private int[] getTopNOrds(final int[] counts, final String[] values, int topN) { @@ -985,13 +996,21 @@ SimpleFacetResult res = new SimpleFacetResult(); res.hits = hits; res.counts = new int[numDims][]; - for(int i=0;i