RevTree right = testSupport.createLargeFeaturesTree(rightSource, "f", rightsize, leftsize - overlapCount, false); rightSource.put(right);
RevTree right = RevObjectTestSupport.INSTANCE.createLargeFeaturesTree(rightSource, "f", rightsize, leftsize - overlapCount, false); rightSource.put(right);
RevTree right = createLargeFeaturesTree(rightSource, "f", rightsize, leftsize - overlapCount, false); rightSource.put(right);
RevTree right = RevObjectTestSupport.INSTANCE.createLargeFeaturesTree(rightSource, "f", rightsize, leftsize - overlapCount, false); rightSource.put(right);
RevTree right = createLargeFeaturesTree(rightSource, "f", rightsize, leftsize - overlapCount, false); rightSource.put(right);
RevTree right = testSupport.createLargeFeaturesTree(rightSource, "f", rightsize, leftsize - overlapCount, false); rightSource.put(right);
@Test public void testBucketLeafThreeLevelsDepth() { final int leftsize = CanonicalNodeNameOrder.maxBucketsForLevel(0) * CanonicalNodeNameOrder.maxBucketsForLevel(0) * CanonicalNodeNameOrder.normalizedSizeLimit(0); RevTree left = RevObjectTestSupport.INSTANCE.createLargeFeaturesTree(leftSource, "f", leftsize, 0, false); assertDepth(left, leftSource, 3); final int rightsize = CanonicalNodeNameOrder.normalizedSizeLimit(0) * CanonicalNodeNameOrder.normalizedSizeLimit(0); final int overlapCount = 100; int runs = 1; for (int i = 0; i < runs; i++) testBucketLeafPerf(left, rightsize, overlapCount); }
@Test public void testBucketLeafThreeLevelsDepth() { final int leftsize = CanonicalNodeNameOrder.maxBucketsForLevel(0) * CanonicalNodeNameOrder.maxBucketsForLevel(0) * CanonicalNodeNameOrder.normalizedSizeLimit(0); RevTree left = testSupport.createLargeFeaturesTree(leftSource, "f", leftsize, 0, false); assertDepth(left, leftSource, 3); final int rightsize = CanonicalNodeNameOrder.normalizedSizeLimit(0) * CanonicalNodeNameOrder.normalizedSizeLimit(0); final int overlapCount = 100; int runs = 1; for (int i = 0; i < runs; i++) testBucketLeafPerf(left, rightsize, overlapCount); }
@Test public void testBucketLeafThreeLevelsDepth() { final int leftsize = CanonicalNodeNameOrder.maxBucketsForLevel(0) * CanonicalNodeNameOrder.maxBucketsForLevel(0) * CanonicalNodeNameOrder.normalizedSizeLimit(0); RevTree left = createLargeFeaturesTree(leftSource, "f", leftsize, 0, false); assertDepth(left, leftSource, 3); final int rightsize = CanonicalNodeNameOrder.normalizedSizeLimit(0) * CanonicalNodeNameOrder.normalizedSizeLimit(0); final int overlapCount = 100; int runs = 1; for (int i = 0; i < runs; i++) testBucketLeafPerf(left, rightsize, overlapCount); }