Apache
/
lucene
mirror of https://github.com/apache/lucene.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

LUCENE-6477: tweak TODOs/javadocs/comments 

git-svn-id: https://svn.apache.org/repos/asf/lucene/dev/trunk@1684084 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Michael McCandless 2015-06-07 23:26:34 +00:00
parent 867c75a5d9
commit 5eb870f24e
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lucene/sandbox/src/java/org/apache/lucene/bkdtree/BKDTreeWriter.java
View File

@ -360,8 +360,6 @@ class BKDTreeWriter {
LongBitSet bitSet = new LongBitSet(pointCount);
// TODO: we should use in-memory sort here, if number of points is small enough:
long countPerLeaf = pointCount;
long innerNodeCount = 1;
@ -549,6 +547,7 @@ class BKDTreeWriter {
lastValue = value;
if (value == splitValue) {
// TODO: we could simplify this, by allowing splitValue to be on either side?
// If we have identical points at the split, we move the count back to before the identical points:
leftCount = i;
break;
@ -576,7 +575,7 @@ class BKDTreeWriter {
return leftCount;
}
/** dim=0 means we split on lat, dim=1 means lon. The incoming PathSlice for the dim we will split is already partitioned/sorted. */
/** The incoming PathSlice for the dim we will split is already partitioned/sorted. */
private void build(int nodeID, int leafNodeOffset,
PathSlice lastLatSorted,
PathSlice lastLonSorted,
@ -592,6 +591,7 @@ class BKDTreeWriter {
long latRange = (long) maxLatEnc - (long) minLatEnc;
long lonRange = (long) maxLonEnc - (long) minLonEnc;
// Compute which dim we should split on at this level:
int splitDim;
if (latRange >= lonRange) {
// Split by lat: