1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
// Copyright 2011 The Closure Library Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS-IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
goog.provide('goog.structs.CollectionTest');
goog.setTestOnly('goog.structs.CollectionTest');
goog.require('goog.structs.AvlTree');
goog.require('goog.structs.Set');
goog.require('goog.testing.jsunit');
function testSet() {
var set = new goog.structs.Set();
exerciseCollection(set);
}
function testAvlTree() {
var tree = new goog.structs.AvlTree();
exerciseCollection(tree);
}
// Simple exercise of a collection object.
function exerciseCollection(collection) {
assertEquals(0, collection.getCount());
for (var i = 1; i <= 10; i++) {
assertFalse(collection.contains(i));
collection.add(i);
assertTrue(collection.contains(i));
assertEquals(i, collection.getCount());
}
assertEquals(10, collection.getCount());
for (var i = 10; i > 0; i--) {
assertTrue(collection.contains(i));
collection.remove(i);
assertFalse(collection.contains(i));
assertEquals(i - 1, collection.getCount());
}
assertEquals(0, collection.getCount());
}
|
