@Override protected int unpromotableBucketIndex(final int depthIndex) { return unpromotableBucketIndex(); }
@Override protected int unpromotableBucketIndex(final int depthIndex) { return unpromotableBucketIndex(); }
@VisibleForTesting List<Quadrant> quadrantsByDepth(NodeId node, final int maxDepth) { final Envelope nodeBounds = node.value(); List<Integer> bucketsByDepth = bucketsByDepth(nodeBounds, maxDepth); List<Quadrant> quads = new ArrayList<>(bucketsByDepth.size()); for (int depthIndex = 0; depthIndex < bucketsByDepth.size(); depthIndex++) { int bucket = bucketsByDepth.get(depthIndex).intValue(); if (bucket == unpromotableBucketIndex(depthIndex)) { break; } Quadrant quad = Quadrant.VALUES[bucket]; quads.add(quad); } return quads; }
@VisibleForTesting List<Quadrant> quadrantsByDepth(NodeId node, final int maxDepth) { final Envelope nodeBounds = node.value(); List<Integer> bucketsByDepth = bucketsByDepth(nodeBounds, maxDepth); List<Quadrant> quads = new ArrayList<>(bucketsByDepth.size()); for (int depthIndex = 0; depthIndex < bucketsByDepth.size(); depthIndex++) { int bucket = bucketsByDepth.get(depthIndex).intValue(); if (bucket == unpromotableBucketIndex(depthIndex)) { break; } Quadrant quad = Quadrant.VALUES[bucket]; quads.add(quad); } return quads; }
bucketsByDepth.add(Integer.valueOf(unpromotableBucketIndex(depthIndex))); break;
bucketsByDepth.add(Integer.valueOf(unpromotableBucketIndex(depthIndex))); break;
Quadrant quadrant = computeQuadrant(treeBounds, childDepthIndex); if (quadrant == null) { final int unpromotableBucketIndex = unpromotableBucketIndex(); final boolean rootIsCanonical = rootId.contains(unpromotableBucketIndex); final int normalizedSizeLimit;
boolean overflown = size > normalizedSizeLimit(); if (overflown) { int unpromotableBucketIndex = unpromotableBucketIndex(); if (targetId.leafBucket() != unpromotableBucketIndex) { targetId = targetId.newChild(unpromotableBucketIndex);
Quadrant quadrant = computeQuadrant(treeBounds, childDepthIndex); if (quadrant == null) { final int unpromotableBucketIndex = unpromotableBucketIndex(); final boolean rootIsCanonical = rootId.contains(unpromotableBucketIndex); final int normalizedSizeLimit;
boolean overflown = size > normalizedSizeLimit(); if (overflown) { int unpromotableBucketIndex = unpromotableBucketIndex(); if (targetId.leafBucket() != unpromotableBucketIndex) { targetId = targetId.newChild(unpromotableBucketIndex);