Debian Codegraph @

closure-library/closure/goog/structs/queue_perf.html

raw
1 <!DOCTYPE html>
2 <html>
3 <!--
4 Copyright 2014 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.structs.Queue</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.structs.Queue');
19 goog.require('goog.testing.PerformanceTable');
20 goog.require('goog.testing.jsunit');
21 </script>
22 </head>
23 <body>
24 <h1>goog.structs.Queue Performance Tests</h1>
25 <p>
26 <strong>User-agent:</strong>
27 <script>document.write(navigator.userAgent);</script>
28 </p>
29 <div id="perfTable"></div>
30 <hr>
31
32 <script>
33 var table = new goog.testing.PerformanceTable(
34 goog.dom.getElement('perfTable'));
35
36 // Number of operations to measure in each table line.
37 var OPS_COUNT = 10000;
38
39 var smallSizes = [1, 2, 5, 10, 20, 50, 100, 1000, 10000];
40 var largeSizes = [100000];
41
42 function populateQueue(size) {
43 var q = new goog.structs.Queue();
44 for (var i = 0; i < size; ++i) {
45 q.enqueue(i);
46 }
47 return q;
48 }
49
50 function enqueueDequeueTest(size) {
51 var q = populateQueue(size);
52 table.run(function() {
53 for (var i = 0; i < OPS_COUNT; ++i) {
54 q.dequeue();
55 q.enqueue(i);
56 }
57 }, 'Enqueue and dequeue, size ' + size);
58 }
59
60 function containsTest(size) {
61 var q = populateQueue(size);
62 table.run(function() {
63 for (var i = 0; i < OPS_COUNT; ++i) {
64 q.contains(i);
65 }
66 }, 'Contains every element, size ' + size);
67 }
68
69 function removeTest(size) {
70 var q = populateQueue(size);
71 if (size == 1) {
72 return;
73 }
74 table.run(function() {
75 var offset = Math.round(size / 2);
76 for (var i = 0; i < OPS_COUNT; ++i) {
77 q.remove(i + offset);
78 q.enqueue(i + size);
79 }
80 }, 'Remove element from the middle, size ' + size);
81 }
82
83 function getValuesTest(size) {
84 var q = populateQueue(size);
85 table.run(function() {
86 for (var i = 0; i < OPS_COUNT; ++i) {
87 q.getValues()[size - 1];
88 }
89 }, 'Get values, size ' + size);
90 }
91
92 function testEnqueueDequeueSmall() {
93 goog.array.forEach(smallSizes, enqueueDequeueTest);
94 }
95
96 function testEnqueueDequeueLarge() {
97 goog.array.forEach(largeSizes, enqueueDequeueTest);
98 }
99
100 function testContainsSmall() {
101 goog.array.forEach(smallSizes, containsTest);
102 }
103
104 function testContainsLarge() {
105 goog.array.forEach(largeSizes, containsTest);
106 }
107
108 function testRemoveSmall() {
109 goog.array.forEach(smallSizes, removeTest);
110 }
111
112 function testRemoveLarge() {
113 goog.array.forEach(largeSizes, removeTest);
114 }
115
116 function testGetValuesSmall() {
117 goog.array.forEach(smallSizes, getValuesTest);
118 }
119
120 function testGetValuesLarge() {
121 goog.array.forEach(largeSizes, getValuesTest);
122 }
123
124 </script>
125 </body>
126 </html>