Package com.google.common.collect.BstTesting

Examples of com.google.common.collect.BstTesting.SimpleNode

321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
    //    d
    //   / \
    //  b   f
    // /     \
    // a     g
    SimpleNode a = new SimpleNode('a', null, null);
    SimpleNode b = new SimpleNode('b', a, null);
    SimpleNode g = new SimpleNode('g', null, null);
    SimpleNode f = new SimpleNode('f', null, g);
    SimpleNode d = new SimpleNode('d', b, f);

    BstNodeFactory<SimpleNode> nodeFactory = EasyMock.createStrictMock(BstNodeFactory.class);
    BstBalancePolicy<SimpleNode> balancePolicy = EasyMock.createStrictMock(BstBalancePolicy.class);
    BstModifier<Character, SimpleNode> modifier = EasyMock.createStrictMock(BstModifier.class);
View Full Code Here
372
373
374
375
376
377
378
379
   * this and handle it.
   */
  @GwtIncompatible("EasyMock")
  private void expectPossibleEntryfication(BstNodeFactory<SimpleNode> factory, SimpleNode entry) {
    expect(factory.createNode(same(entry), (SimpleNode) isNull(), (SimpleNode) isNull()))
        .andReturn(new SimpleNode(entry.getKey(), null, null))
        .times(0, 1);
  }
View Full Code Here
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
    //    d
    //   / \
    //  b   f
    //   \   \
    //   c   g
    SimpleNode c = new SimpleNode('c', null, null);
    SimpleNode b = new SimpleNode('b', null, c);
    SimpleNode g = new SimpleNode('g', null, null);
    SimpleNode f = new SimpleNode('f', null, g);
    SimpleNode d = new SimpleNode('d', b, f);

    SimpleNode a = new SimpleNode('a', null, null);
    SimpleNode newRoot = BstOperations.insertMin(d, a, nodeFactory, balancePolicy);
    assertInOrderTraversalIs(newRoot, "abcdfg");
  }
View Full Code Here
398
399
400
401
402
403
404
405
406
407
408
409
410
411
    //    d
    //   / \
    //  b   f
    //       \
    //       g
    SimpleNode b = new SimpleNode('b', null, null);
    SimpleNode g = new SimpleNode('g', null, null);
    SimpleNode f = new SimpleNode('f', null, g);
    SimpleNode d = new SimpleNode('d', b, f);

    SimpleNode a = new SimpleNode('a', null, null);
    SimpleNode newRoot = BstOperations.insertMin(d, a, nodeFactory, balancePolicy);
    assertInOrderTraversalIs(newRoot, "abdfg");
  }
View Full Code Here
409
410
411
412
413
414
415
416
417
    SimpleNode newRoot = BstOperations.insertMin(d, a, nodeFactory, balancePolicy);
    assertInOrderTraversalIs(newRoot, "abdfg");
  }

  public void testInsertMinEmpty() {
    SimpleNode a = new SimpleNode('a', null, null);
    SimpleNode newRoot = BstOperations.insertMin(null, a, nodeFactory, balancePolicy);
    assertInOrderTraversalIs(newRoot, "a");
  }
View Full Code Here
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
    //    d
    //   / \
    //  b   f
    //   \   \
    //   c   g
    SimpleNode c = new SimpleNode('c', null, null);
    SimpleNode b = new SimpleNode('b', null, c);
    SimpleNode g = new SimpleNode('g', null, null);
    SimpleNode f = new SimpleNode('f', null, g);
    SimpleNode d = new SimpleNode('d', b, f);

    SimpleNode h = new SimpleNode('h', null, null);
    SimpleNode newRoot = BstOperations.insertMax(d, h, nodeFactory, balancePolicy);
    assertInOrderTraversalIs(newRoot, "bcdfgh");
  }
View Full Code Here
437
438
439
440
441
442
443
444
445
446
447
448
449
450
    //    d
    //   / \
    //  b   f
    //     /
    //     e
    SimpleNode b = new SimpleNode('b', null, null);
    SimpleNode e = new SimpleNode('e', null, null);
    SimpleNode f = new SimpleNode('f', e, null);
    SimpleNode d = new SimpleNode('d', b, f);

    SimpleNode h = new SimpleNode('h', null, null);
    SimpleNode newRoot = BstOperations.insertMax(d, h, nodeFactory, balancePolicy);
    assertInOrderTraversalIs(newRoot, "bdefh");
  }
View Full Code Here
448
449
450
451
452
453
454
455
456
    SimpleNode newRoot = BstOperations.insertMax(d, h, nodeFactory, balancePolicy);
    assertInOrderTraversalIs(newRoot, "bdefh");
  }

  public void testInsertMaxEmpty() {
    SimpleNode a = new SimpleNode('a', null, null);
    SimpleNode newRoot = BstOperations.insertMax(null, a, nodeFactory, balancePolicy);
    assertInOrderTraversalIs(newRoot, "a");
  }
View Full Code Here
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
    //    d
    //   / \
    //  b   f
    //   \   \
    //   c   g
    SimpleNode c = new SimpleNode('c', null, null);
    SimpleNode b = new SimpleNode('b', null, c);
    SimpleNode g = new SimpleNode('g', null, null);
    SimpleNode f = new SimpleNode('f', null, g);
    SimpleNode d = new SimpleNode('d', b, f);

    BstMutationResult<Character, SimpleNode> extractMin =
        BstOperations.extractMin(d, nodeFactory, balancePolicy);
    assertEquals('b', extractMin.getTargetKey().charValue());
    assertEquals(d, extractMin.getOriginalRoot());
View Full Code Here
480
481
482
483
484
485
486
487
488
489
490
491
492
493
    //    d
    //   / \
    //  b   f
    //       \
    //       g
    SimpleNode b = new SimpleNode('b', null, null);
    SimpleNode g = new SimpleNode('g', null, null);
    SimpleNode f = new SimpleNode('f', null, g);
    SimpleNode d = new SimpleNode('d', b, f);

    BstMutationResult<Character, SimpleNode> extractMin =
        BstOperations.extractMin(d, nodeFactory, balancePolicy);
    assertEquals('b', extractMin.getTargetKey().charValue());
    assertEquals(d, extractMin.getOriginalRoot());
View Full Code Here
TOP

Related Classes of com.google.common.collect.BstTesting.SimpleNode

  • com.google.common.collect.AbstractBstBalancePolicyTest
  • com.google.common.collect.BstInOrderPathTest
  • com.google.common.collect.BstNodeTest
  • com.google.common.collect.BstOperationsTest
  • com.google.common.collect.BstPathTest
  • com.google.common.collect.BstRangeOpsTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.