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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
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
|
<!DOCTYPE html>
<html>
<!--
Copyright 2014 The Closure Library Authors. All Rights Reserved.
Use of this source code is governed by the Apache License, Version 2.0.
See the COPYING file for details.
-->
<!--
-->
<head>
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<title>Closure Performance Tests - goog.structs.Queue</title>
<link rel="stylesheet" type="text/css" href="../testing/performancetable.css"/>
<script src="../base.js"></script>
<script>
goog.require('goog.functions');
goog.require('goog.structs.Queue');
goog.require('goog.testing.PerformanceTable');
goog.require('goog.testing.jsunit');
</script>
</head>
<body>
<h1>goog.structs.Queue Performance Tests</h1>
<p>
<strong>User-agent:</strong>
<script>document.write(navigator.userAgent);</script>
</p>
<div id="perfTable"></div>
<hr>
<script>
var table = new goog.testing.PerformanceTable(
goog.dom.getElement('perfTable'));
// Number of operations to measure in each table line.
var OPS_COUNT = 10000;
var smallSizes = [1, 2, 5, 10, 20, 50, 100, 1000, 10000];
var largeSizes = [100000];
function populateQueue(size) {
var q = new goog.structs.Queue();
for (var i = 0; i < size; ++i) {
q.enqueue(i);
}
return q;
}
function enqueueDequeueTest(size) {
var q = populateQueue(size);
table.run(function() {
for (var i = 0; i < OPS_COUNT; ++i) {
q.dequeue();
q.enqueue(i);
}
}, 'Enqueue and dequeue, size ' + size);
}
function containsTest(size) {
var q = populateQueue(size);
table.run(function() {
for (var i = 0; i < OPS_COUNT; ++i) {
q.contains(i);
}
}, 'Contains every element, size ' + size);
}
function removeTest(size) {
var q = populateQueue(size);
if (size == 1) {
return;
}
table.run(function() {
var offset = Math.round(size / 2);
for (var i = 0; i < OPS_COUNT; ++i) {
q.remove(i + offset);
q.enqueue(i + size);
}
}, 'Remove element from the middle, size ' + size);
}
function getValuesTest(size) {
var q = populateQueue(size);
table.run(function() {
for (var i = 0; i < OPS_COUNT; ++i) {
q.getValues()[size - 1];
}
}, 'Get values, size ' + size);
}
function testEnqueueDequeueSmall() {
goog.array.forEach(smallSizes, enqueueDequeueTest);
}
function testEnqueueDequeueLarge() {
goog.array.forEach(largeSizes, enqueueDequeueTest);
}
function testContainsSmall() {
goog.array.forEach(smallSizes, containsTest);
}
function testContainsLarge() {
goog.array.forEach(largeSizes, containsTest);
}
function testRemoveSmall() {
goog.array.forEach(smallSizes, removeTest);
}
function testRemoveLarge() {
goog.array.forEach(largeSizes, removeTest);
}
function testGetValuesSmall() {
goog.array.forEach(smallSizes, getValuesTest);
}
function testGetValuesLarge() {
goog.array.forEach(largeSizes, getValuesTest);
}
</script>
</body>
</html>
|
