java的splititeration,Java Spliterator.estimateSize方法代碼示例

import java.util.Spliterator; //導入方法依賴的package包/類

private static void testSplitUntilNull(SplitNode e) {

// Use an explicit stack to avoid a StackOverflowException when testing a Spliterator

// that when repeatedly split produces a right-balanced (and maybe degenerate) tree, or

// for a spliterator that is badly behaved.

Deque> stack = new ArrayDeque<>();

stack.push(e);

int iteration = 0;

while (!stack.isEmpty()) {

assertTrue(iteration++ < MAXIMUM_STACK_CAPACITY, "Exceeded maximum stack modification count of 1 << 18");

e = stack.pop();

Spliterator parentAndRightSplit = e.s;

long parentEstimateSize = parentAndRightSplit.estimateSize();

assertTrue(parentEstimateSize >= 0,

String.format("Split size estimate %d < 0", parentEstimateSize));

long parentSize = parentAndRightSplit.getExactSizeIfKnown();

Spliterator leftSplit = parentAndRightSplit.trySplit();

if (leftSplit == null) {

parentAndRightSplit.forEachRemaining(e.c);

continue;

}

assertSpliterator(leftSplit, e.rootCharacteristics);

assertSpliterator(parentAndRightSplit, e.rootCharacteristics);

if (parentEstimateSize != Long.MAX_VALUE && leftSplit.estimateSize() > 0

&& parentAndRightSplit.estimateSize() > 0) {

assertTrue(leftSplit.estimateSize() < parentEstimateSize,

String.format("Left split size estimate %d >= parent split size estimate %d",

leftSplit.estimateSize(), parentEstimateSize));

assertTrue(parentAndRightSplit.estimateSize() < parentEstimateSize,

String.format("Right split size estimate %d >= parent split size estimate %d",

leftSplit.estimateSize(), parentEstimateSize));

}

else {

assertTrue(leftSplit.estimateSize() <= parentEstimateSize,

String.format("Left split size estimate %d > parent split size estimate %d",

leftSplit.estimateSize(), parentEstimateSize));

assertTrue(parentAndRightSplit.estimateSize() <= parentEstimateSize,

String.format("Right split size estimate %d > parent split size estimate %d",

leftSplit.estimateSize(), parentEstimateSize));

}

long leftSize = leftSplit.getExactSizeIfKnown();

long rightSize = parentAndRightSplit.getExactSizeIfKnown();

if (parentSize >= 0 && leftSize >= 0 && rightSize >= 0)

assertEquals(parentSize, leftSize + rightSize,

String.format("exact left split size %d + exact right split size %d != parent exact split size %d",

leftSize, rightSize, parentSize));

// Add right side to stack first so left side is popped off first

stack.push(e.fromSplit(parentAndRightSplit));

stack.push(e.fromSplit(leftSplit));

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值