Package com.google.common.collect.BstTesting

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

48
49
50
51
52
53
54
55
56
    assertTrue(node.hasChild(side));
    assertEquals(expectedChild, node.getChild(side));
  }

  public void testHasChildLeaf() {
    SimpleNode leaf = new SimpleNode('a', null, null);
    testLacksChild(leaf, LEFT);
    testLacksChild(leaf, RIGHT);
  }
View Full Code Here
54
55
56
57
58
59
60
61
62
63
    testLacksChild(leaf, LEFT);
    testLacksChild(leaf, RIGHT);
  }

  public void testHasChildLeftOnly() {
    SimpleNode leaf = new SimpleNode('a', null, null);
    SimpleNode node = new SimpleNode('b', leaf, null);
    testChildIs(node, LEFT, leaf);
    testLacksChild(node, RIGHT);
  }
View Full Code Here
61
62
63
64
65
66
67
68
69
70
    testChildIs(node, LEFT, leaf);
    testLacksChild(node, RIGHT);
  }

  public void testHasChildRightOnly() {
    SimpleNode leaf = new SimpleNode('c', null, null);
    SimpleNode node = new SimpleNode('b', null, leaf);
    testLacksChild(node, LEFT);
    testChildIs(node, RIGHT, leaf);
  }
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
    testLacksChild(node, LEFT);
    testChildIs(node, RIGHT, leaf);
  }

  public void testHasChildBoth() {
    SimpleNode left = new SimpleNode('a', null, null);
    SimpleNode right = new SimpleNode('c', null, null);
    SimpleNode node = new SimpleNode('b', left, right);
    testChildIs(node, LEFT, left);
    testChildIs(node, RIGHT, right);
  }
View Full Code Here
93
94
95
96
97
98
99
100
101
  public void testOrderingInvariantHoldsForGood() {
    for (SimpleNode left : GOOD_LEFTS) {
      for (SimpleNode right : GOOD_RIGHTS) {
        assertTrue(
            new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural()));
      }
    }
  }
View Full Code Here
102
103
104
105
106
107
108
109
110
  public void testOrderingInvariantBadLeft() {
    for (SimpleNode left : BAD_LEFTS) {
      for (SimpleNode right : ALL_RIGHTS) {
        assertFalse(
            new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural()));
      }
    }
  }
View Full Code Here
111
112
113
114
115
116
117
118
119
  public void testOrderingInvariantBadRight() {
    for (SimpleNode left : ALL_LEFTS) {
      for (SimpleNode right : BAD_RIGHTS) {
        assertFalse(
            new SimpleNode(MIDDLE_KEY, left, right).orderingInvariantHolds(Ordering.natural()));
      }
    }
  }
View Full Code Here
118
119
120
121
122
123
124
125
126
    assertEquals(MODEL.size(), BstRangeOps.totalInRange(
        countAggregate, GeneralRange.<Character>all(Ordering.natural()), ROOT));
  }

  public void testCountInRangeEmpty() {
    SimpleNode empty = null;
    GeneralRange<Character> range = GeneralRange.all(Ordering.natural());
    assertEquals(0, BstRangeOps.totalInRange(countAggregate, range, empty));
  }
View Full Code Here
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
    //     d
    //    / \
    //   b   f
    //  /   / \
    //  a   e g
    SimpleNode a = new SimpleNode('a', null, null);
    SimpleNode b = new SimpleNode('b', a, null);
    SimpleNode e = new SimpleNode('e', null, null);
    SimpleNode g = new SimpleNode('g', null, null);
    SimpleNode f = new SimpleNode('f', e, g);
    SimpleNode d = new SimpleNode('d', b, f);

    assertInOrderTraversalIs(d, "abdefg");
    GeneralRange<Character> range1 = GeneralRange.downTo(Ordering.natural(), 'f', CLOSED);
    testTraversalAfterClearingRangeIs(d, range1, "abde");
View Full Code Here
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
    //     d
    //    / \
    //   b   f
    //  /   / \
    //  a   e g
    SimpleNode a = new SimpleNode('a', null, null);
    SimpleNode b = new SimpleNode('b', a, null);
    SimpleNode e = new SimpleNode('e', null, null);
    SimpleNode g = new SimpleNode('g', null, null);
    SimpleNode f = new SimpleNode('f', e, g);
    SimpleNode d = new SimpleNode('d', b, f);

    assertInOrderTraversalIs(d, "abdefg");
    GeneralRange<Character> range1 = GeneralRange.upTo(Ordering.natural(), 'f', CLOSED);
    testTraversalAfterClearingRangeIs(d, range1, "g");
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.