mirror of https://github.com/apache/lucene.git
LUCENE-9176: Handle the case when there is only one leaf node in TestEstimatePointCount (#1212)
This commit is contained in:
parent
ae95f0ab68
commit
1fe4177ac0
|
@ -196,7 +196,7 @@ public class TestLucene60PointsFormat extends BasePointsFormatTestCase {
|
||||||
if (multiValues) {
|
if (multiValues) {
|
||||||
assertEquals(docCount, (long) (docCount * (1d - Math.pow( (numDocs - pointCount) / points.size() , points.size() / docCount))));
|
assertEquals(docCount, (long) (docCount * (1d - Math.pow( (numDocs - pointCount) / points.size() , points.size() / docCount))));
|
||||||
} else {
|
} else {
|
||||||
assertEquals(pointCount, docCount);
|
assertEquals(Math.min(pointCount, numDocs), docCount);
|
||||||
}
|
}
|
||||||
r.close();
|
r.close();
|
||||||
dir.close();
|
dir.close();
|
||||||
|
@ -259,7 +259,7 @@ public class TestLucene60PointsFormat extends BasePointsFormatTestCase {
|
||||||
};
|
};
|
||||||
|
|
||||||
// If all points match, then the point count is numLeaves * maxPointsInLeafNode
|
// If all points match, then the point count is numLeaves * maxPointsInLeafNode
|
||||||
final int numLeaves = (int) Long.highestOneBit( ((points.size() - 1) / actualMaxPointsInLeafNode)) << 1;
|
final int numLeaves = (int) Math.max(Long.highestOneBit( ((points.size() - 1) / actualMaxPointsInLeafNode)) << 1, 1);
|
||||||
|
|
||||||
assertEquals(numLeaves * actualMaxPointsInLeafNode, points.estimatePointCount(allPointsVisitor));
|
assertEquals(numLeaves * actualMaxPointsInLeafNode, points.estimatePointCount(allPointsVisitor));
|
||||||
assertEquals(numDocs, points.estimateDocCount(allPointsVisitor));
|
assertEquals(numDocs, points.estimateDocCount(allPointsVisitor));
|
||||||
|
@ -310,7 +310,7 @@ public class TestLucene60PointsFormat extends BasePointsFormatTestCase {
|
||||||
if (multiValues) {
|
if (multiValues) {
|
||||||
assertEquals(docCount, (long) (docCount * (1d - Math.pow( (numDocs - pointCount) / points.size() , points.size() / docCount))));
|
assertEquals(docCount, (long) (docCount * (1d - Math.pow( (numDocs - pointCount) / points.size() , points.size() / docCount))));
|
||||||
} else {
|
} else {
|
||||||
assertEquals(pointCount, docCount);
|
assertEquals(Math.min(pointCount, numDocs), docCount);
|
||||||
}
|
}
|
||||||
r.close();
|
r.close();
|
||||||
dir.close();
|
dir.close();
|
||||||
|
|
Loading…
Reference in New Issue