Package com.google.common.collect.BstTesting

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

62
63
64
65
66
67
68
69
70
71
  public void testBalanceTree3() {
    //   b
    //  / \
    //  a c
    SimpleNode a = balanceNew('a', null, null);
    SimpleNode c = balanceNew('c', null, null);
    SimpleNode b = balanceNew('b', a, c);
    assertInOrderTraversalIs(b, "abc");
  }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
93
    //     \
    //     e
    //      \
    //       f

    SimpleNode f = balanceNew('f', null, null);
    SimpleNode e = balanceNew('e', null, f);
    SimpleNode d = balanceNew('d', null, e);
    SimpleNode c = balanceNew('c', null, d);
    SimpleNode b = balanceNew('b', null, c);
    SimpleNode a = balanceNew('a', null, b);
    assertInOrderTraversalIs(a, "abcdef");
  }
View Full Code Here
102
103
104
105
106
107
108
109
110
111
112
113
114
    //    c
    //   /
    //   b
    //  /
    //  a
    SimpleNode a = balanceNew('a', null, null);
    SimpleNode b = balanceNew('b', a, null);
    SimpleNode c = balanceNew('c', b, null);
    SimpleNode d = balanceNew('d', c, null);
    SimpleNode e = balanceNew('e', d, null);
    SimpleNode f = balanceNew('f', e, null);
    assertInOrderTraversalIs(f, "abcdef");
  }
View Full Code Here
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
    //    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);
    assertEquals(a, BstOperations.seek(Ordering.natural(), d, 'a'));
    assertEquals(b, BstOperations.seek(Ordering.natural(), d, 'b'));
    assertNull(BstOperations.seek(Ordering.natural(), d, 'c'));
    assertEquals(d, BstOperations.seek(Ordering.natural(), d, 'd'));
    assertNull(BstOperations.seek(Ordering.natural(), d, 'e'));
View Full Code Here
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
    //    d
    //   / \
    //  b   f
    //   \ /
    //   c e
    SimpleNode c = new SimpleNode('c', null, null);
    SimpleNode b = new SimpleNode('b', null, c);
    SimpleNode e = new SimpleNode('e', null, null);
    SimpleNode f = new SimpleNode('f', e, null);
    SimpleNode d = new SimpleNode('d', b, f);
    assertNull(BstOperations.seek(Ordering.natural(), d, 'a'));
    assertEquals(b, BstOperations.seek(Ordering.natural(), d, 'b'));
    assertEquals(c, BstOperations.seek(Ordering.natural(), d, 'c'));
    assertEquals(d, BstOperations.seek(Ordering.natural(), d, 'd'));
    assertEquals(e, BstOperations.seek(Ordering.natural(), d, 'e'));
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
    //    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);

    SimpleNode c = new SimpleNode('c', null, null);
    expect(modifier.modify(eq('c'), (SimpleNode) isNull())).andReturn(
        BstModificationResult.rebalancingChange(null, c));

    expect(balancePolicy.balance(
        same(nodeFactory), same(c), (SimpleNode) isNull(), (SimpleNode) isNull()))
        .andReturn(c)
        .times(0, 1);

    SimpleNode bWithC = new SimpleNode('b', a, c);
    expectPossibleEntryfication(nodeFactory, b);
    expect(balancePolicy.balance(
        same(nodeFactory), withKey('b'), same(a), withKey('c')))
        .andReturn(bWithC);

    SimpleNode dWithBWithC = new SimpleNode('d', bWithC, f);
    expectPossibleEntryfication(nodeFactory, d);
    expect(
        balancePolicy.balance(same(nodeFactory), withKey('d'), same(bWithC), same(f)))
        .andReturn(dWithBWithC);
    replay(nodeFactory, balancePolicy, modifier);
View Full Code Here
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
    //    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
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
    //    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);

    expectPossibleEntryfication(nodeFactory, a);
    SimpleNode a2 = new SimpleNode('a', null, null);
    expect(modifier.modify(eq('a'), withKey('a'))).andReturn(
        BstModificationResult.rebuildingChange(a, a2));

    expectPossibleEntryfication(nodeFactory, a2);

    SimpleNode bWithA2 = new SimpleNode('b', a2, null);
    expect(nodeFactory.createNode(same(b), withKey('a'), (SimpleNode) isNull())).andReturn(
        bWithA2);

    SimpleNode dWithA2 = new SimpleNode('d', bWithA2, f);
    expect(nodeFactory.createNode(same(d), same(bWithA2), same(f))).andReturn(
        dWithA2);

    replay(nodeFactory, balancePolicy, modifier);
    BstMutationRule<Character, SimpleNode> mutationRule =
View Full Code Here
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
    //    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);

    expectPossibleEntryfication(nodeFactory, a);
    expect(modifier.modify(eq('a'), withKey('a'))).andReturn(
        BstModificationResult.rebalancingChange(a, null));

    expect(balancePolicy.combine(same(nodeFactory), (SimpleNode) isNull(), (SimpleNode) isNull()))
        .andReturn(null);

    expectPossibleEntryfication(nodeFactory, b);
    SimpleNode leafB = new SimpleNode('b', null, null);
    expect(
        balancePolicy.balance(same(nodeFactory), withKey('b'), (SimpleNode) isNull(),
            (SimpleNode) isNull())).andReturn(leafB);

    SimpleNode dWithLeafB = new SimpleNode('d', leafB, f);
    expectPossibleEntryfication(nodeFactory, d);
    expect(
        balancePolicy.balance(same(nodeFactory), withKey('d'), same(leafB), same(f)))
        .andReturn(dWithLeafB);
    replay(nodeFactory, balancePolicy, modifier);
View Full Code Here
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
    //    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
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.