| 1 |
<!DOCTYPE html> |
| 2 |
<html> |
| 3 |
<!-- |
| 4 |
Copyright 2009 The Closure Library Authors. All Rights Reserved. |
| 5 |
|
| 6 |
Use of this source code is governed by the Apache License, Version 2.0. |
| 7 |
See the COPYING file for details. |
| 8 |
--> |
| 9 |
<!-- |
| 10 |
--> |
| 11 |
<head> |
| 12 |
<meta http-equiv="X-UA-Compatible" content="IE=edge"> |
| 13 |
<title>Closure Performance Tests - goog.ui.Set vs goog.ui.StringSet</title> |
| 14 |
<link rel="stylesheet" type="text/css" href="../testing/performancetable.css"/> |
| 15 |
<script src="../base.js"></script> |
| 16 |
<script> |
| 17 |
goog.require('goog.functions'); |
| 18 |
goog.require('goog.string'); |
| 19 |
goog.require('goog.structs.Set'); |
| 20 |
goog.require('goog.structs.StringSet'); |
| 21 |
goog.require('goog.testing.PerformanceTable'); |
| 22 |
goog.require('goog.testing.PropertyReplacer'); |
| 23 |
goog.require('goog.testing.jsunit'); |
| 24 |
</script> |
| 25 |
</head> |
| 26 |
<body> |
| 27 |
<h1>goog.ui.Set and goog.ui.StringSet Performance Tests</h1> |
| 28 |
<p> |
| 29 |
<strong>User-agent:</strong> |
| 30 |
<script>document.write(navigator.userAgent);</script> |
| 31 |
</p> |
| 32 |
<div id="perfTable"></div> |
| 33 |
<hr> |
| 34 |
|
| 35 |
<script> |
| 36 |
var table = new goog.testing.PerformanceTable( |
| 37 |
goog.dom.getElement('perfTable')); |
| 38 |
|
| 39 |
// Number of operations to measure in each table line. |
| 40 |
var OPS_COUNT = 100000; |
| 41 |
|
| 42 |
var stubs = new goog.testing.PropertyReplacer(); |
| 43 |
|
| 44 |
function tearDown() { |
| 45 |
stubs.reset(); |
| 46 |
} |
| 47 |
|
| 48 |
function testCreateSetFromArrayWithoutRepetition() { |
| 49 |
var values = [] |
| 50 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 51 |
values.push(i); |
| 52 |
} |
| 53 |
|
| 54 |
table.run(function() { |
| 55 |
var s = new goog.structs.StringSet(values); |
| 56 |
}, 'Create string set from number array without repetition'); |
| 57 |
|
| 58 |
values = [] |
| 59 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 60 |
values.push(String(i)); |
| 61 |
} |
| 62 |
|
| 63 |
table.run(function() { |
| 64 |
var s = new goog.structs.StringSet(values); |
| 65 |
}, 'Create string set from string array without repetition'); |
| 66 |
} |
| 67 |
|
| 68 |
function testCreateSetWithoutRepetition() { |
| 69 |
table.run(function() { |
| 70 |
var s = new goog.structs.Set(); |
| 71 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 72 |
s.add(i); |
| 73 |
} |
| 74 |
}, 'Add elements to set without repetition'); |
| 75 |
|
| 76 |
table.run(function() { |
| 77 |
var s = new goog.structs.StringSet(); |
| 78 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 79 |
s.add(i); |
| 80 |
} |
| 81 |
}, 'Add elements to string set without repetition'); |
| 82 |
|
| 83 |
stubs.replace(goog.structs.StringSet, 'encode_', goog.functions.identity); |
| 84 |
stubs.replace(goog.structs.StringSet, 'decode_', goog.functions.identity); |
| 85 |
|
| 86 |
table.run(function() { |
| 87 |
var s = new goog.structs.StringSet(); |
| 88 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 89 |
s.add(i); |
| 90 |
} |
| 91 |
}, 'Add elements to string set without repetition and escaping'); |
| 92 |
} |
| 93 |
|
| 94 |
function testCreateSetWithRepetition() { |
| 95 |
table.run(function() { |
| 96 |
var s = new goog.structs.Set(); |
| 97 |
for (var n = 0; n < 10 ; n++) { |
| 98 |
for (var i = 0; i < OPS_COUNT / 10; i++) { |
| 99 |
s.add(i); |
| 100 |
} |
| 101 |
} |
| 102 |
}, 'Add elements to set with repetition'); |
| 103 |
|
| 104 |
table.run(function() { |
| 105 |
var s = new goog.structs.StringSet(); |
| 106 |
for (var n = 0; n < 10; n++) { |
| 107 |
for (var i = 0; i < OPS_COUNT / 10; i++) { |
| 108 |
s.add(i); |
| 109 |
} |
| 110 |
} |
| 111 |
}, 'Add elements to string set with repetition'); |
| 112 |
} |
| 113 |
|
| 114 |
function testGetCount() { |
| 115 |
var bigSet = new goog.structs.Set; |
| 116 |
var bigStringSet = new goog.structs.StringSet; |
| 117 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 118 |
bigSet.add(i); |
| 119 |
bigStringSet.add(i); |
| 120 |
} |
| 121 |
|
| 122 |
table.run(function() { |
| 123 |
bigSet.getCount(); |
| 124 |
}, 'Count the number of elements in a set'); |
| 125 |
|
| 126 |
table.run(function() { |
| 127 |
bigStringSet.getCount(); |
| 128 |
}, 'Count the number of elements in a string set'); |
| 129 |
} |
| 130 |
|
| 131 |
function testGetValues() { |
| 132 |
var bigSet = new goog.structs.Set; |
| 133 |
var bigStringSet = new goog.structs.StringSet; |
| 134 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 135 |
bigSet.add(i); |
| 136 |
bigStringSet.add(i); |
| 137 |
} |
| 138 |
|
| 139 |
table.run(function() { |
| 140 |
bigSet.getValues(); |
| 141 |
}, 'Convert a set to array'); |
| 142 |
|
| 143 |
table.run(function() { |
| 144 |
bigStringSet.getValues(); |
| 145 |
}, 'Convert a string set to array'); |
| 146 |
} |
| 147 |
|
| 148 |
function testForEach() { |
| 149 |
var bigSet = new goog.structs.Set; |
| 150 |
var bigStringSet = new goog.structs.StringSet; |
| 151 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 152 |
bigSet.add(i); |
| 153 |
bigStringSet.add(i); |
| 154 |
} |
| 155 |
|
| 156 |
table.run(function() { |
| 157 |
goog.structs.forEach(bigSet, goog.nullFunction); |
| 158 |
}, 'Iterate over set with forEach'); |
| 159 |
|
| 160 |
table.run(function() { |
| 161 |
goog.structs.forEach(bigStringSet, goog.nullFunction); |
| 162 |
}, 'Iterate over string set with forEach'); |
| 163 |
} |
| 164 |
|
| 165 |
function testForEachWithLargeKeys() { |
| 166 |
var bigSet = new goog.structs.Set; |
| 167 |
var bigStringSet = new goog.structs.StringSet; |
| 168 |
for (var i = 0; i < OPS_COUNT / 100; i++) { |
| 169 |
bigSet.add(goog.string.repeat(String(i), 1000)); |
| 170 |
bigStringSet.add(goog.string.repeat(String(i), 1000)); |
| 171 |
} |
| 172 |
|
| 173 |
table.run(function() { |
| 174 |
for (var i = 0; i < 100; i++) { |
| 175 |
goog.structs.forEach(bigSet, goog.nullFunction); |
| 176 |
} |
| 177 |
}, 'Iterate over set of large strings with forEach'); |
| 178 |
|
| 179 |
table.run(function() { |
| 180 |
for (var i = 0; i < 100; i++) { |
| 181 |
goog.structs.forEach(bigStringSet, goog.nullFunction); |
| 182 |
} |
| 183 |
}, 'Iterate over string set of large strings with forEach'); |
| 184 |
} |
| 185 |
|
| 186 |
function testAddRemove() { |
| 187 |
table.run(function() { |
| 188 |
var s = new goog.structs.Set(); |
| 189 |
for (var i = 0; i < OPS_COUNT / 2; i++) { |
| 190 |
s.add(i); |
| 191 |
} |
| 192 |
for (var i = 0; i < OPS_COUNT / 2; i++) { |
| 193 |
s.remove(i); |
| 194 |
} |
| 195 |
}, 'Add then remove elements from set'); |
| 196 |
|
| 197 |
table.run(function() { |
| 198 |
var s = new goog.structs.StringSet(); |
| 199 |
for (var i = 0; i < OPS_COUNT / 2; i++) { |
| 200 |
s.add(i); |
| 201 |
} |
| 202 |
for (var i = 0; i < OPS_COUNT / 2; i++) { |
| 203 |
s.remove(i); |
| 204 |
} |
| 205 |
}, 'Add then remove elements from string set'); |
| 206 |
} |
| 207 |
|
| 208 |
function testContains() { |
| 209 |
var bigSet = new goog.structs.Set; |
| 210 |
var bigStringSet = new goog.structs.StringSet; |
| 211 |
var arr = []; |
| 212 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 213 |
bigSet.add(i); |
| 214 |
bigStringSet.add(i); |
| 215 |
arr.push(i); |
| 216 |
} |
| 217 |
|
| 218 |
table.run(function() { |
| 219 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 220 |
bigSet.contains(i); |
| 221 |
} |
| 222 |
}, 'Membership check for each element of set'); |
| 223 |
|
| 224 |
table.run(function() { |
| 225 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 226 |
bigStringSet.contains(i); |
| 227 |
} |
| 228 |
}, 'Membership check for each element of string set with contains'); |
| 229 |
|
| 230 |
table.run(function() { |
| 231 |
bigStringSet.containsArray(arr); |
| 232 |
}, 'Membership check for each element of string set with containsArray'); |
| 233 |
|
| 234 |
stubs.replace(goog.structs.StringSet, 'encode_', goog.functions.identity); |
| 235 |
stubs.replace(goog.structs.StringSet, 'decode_', goog.functions.identity); |
| 236 |
|
| 237 |
table.run(function() { |
| 238 |
for (var i = 0; i < OPS_COUNT; i++) { |
| 239 |
bigStringSet.contains(i); |
| 240 |
} |
| 241 |
}, 'Membership check for each element of string set without escaping'); |
| 242 |
} |
| 243 |
|
| 244 |
function testEquals() { |
| 245 |
table.run(function() { |
| 246 |
var s1 = new goog.structs.Set(); |
| 247 |
var s2 = new goog.structs.Set(); |
| 248 |
for (var i = 0; i < OPS_COUNT / 4; i++) { |
| 249 |
s1.add(i); |
| 250 |
s2.add(i); |
| 251 |
} |
| 252 |
s1.equals(s2); |
| 253 |
}, 'Create then compare two sets'); |
| 254 |
|
| 255 |
table.run(function() { |
| 256 |
var s1 = new goog.structs.StringSet(); |
| 257 |
var s2 = new goog.structs.StringSet(); |
| 258 |
for (var i = 0; i < OPS_COUNT / 4; i++) { |
| 259 |
s1.add(i); |
| 260 |
s2.add(i); |
| 261 |
} |
| 262 |
s1.equals(s2); |
| 263 |
}, 'Create then compare two string sets'); |
| 264 |
} |
| 265 |
</script> |
| 266 |
</body> |
| 267 |
</html> |