build/pgo/js-input/access-fannkuch.html@129ffea94266
build/pgo/js-input/access-fannkuch.html
Sat, 03 Jan 2015 20:18:00 +0100
- author
- Michael Schloh von Bennewitz <michael@schloh.com>
- date
- Sat, 03 Jan 2015 20:18:00 +0100
- branch
- TOR_BUG_3246
- changeset 7
- 129ffea94266
- permissions
- -rw-r--r--
Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.
1 <!DOCTYPE html>
2 <head>
3 <!--
4 Copyright (C) 2007 Apple Inc. All rights reserved.
6 Redistribution and use in source and binary forms, with or without
7 modification, are permitted provided that the following conditions
8 are met:
9 1. Redistributions of source code must retain the above copyright
10 notice, this list of conditions and the following disclaimer.
11 2. Redistributions in binary form must reproduce the above copyright
12 notice, this list of conditions and the following disclaimer in the
13 documentation and/or other materials provided with the distribution.
15 THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
16 EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
18 PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
19 CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
20 EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
21 PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
22 PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
23 OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
25 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 -->
28 <title>SunSpider access-fannkuch</title>
30 </head>
32 <body>
33 <h3>access-fannkuch</h3>
34 <div id="console">
35 </div>
37 <script>
39 var _sunSpiderStartDate = new Date();
41 /* The Great Computer Language Shootout
42 http://shootout.alioth.debian.org/
43 contributed by Isaac Gouy */
45 function fannkuch(n) {
46 var check = 0;
47 var perm = Array(n);
48 var perm1 = Array(n);
49 var count = Array(n);
50 var maxPerm = Array(n);
51 var maxFlipsCount = 0;
52 var m = n - 1;
54 for (var i = 0; i < n; i++) perm1[i] = i;
55 var r = n;
57 while (true) {
58 // write-out the first 30 permutations
59 if (check < 30){
60 var s = "";
61 for(var i=0; i<n; i++) s += (perm1[i]+1).toString();
62 check++;
63 }
65 while (r != 1) { count[r - 1] = r; r--; }
66 if (!(perm1[0] == 0 || perm1[m] == m)) {
67 for (var i = 0; i < n; i++) perm[i] = perm1[i];
69 var flipsCount = 0;
70 var k;
72 while (!((k = perm[0]) == 0)) {
73 var k2 = (k + 1) >> 1;
74 for (var i = 0; i < k2; i++) {
75 var temp = perm[i]; perm[i] = perm[k - i]; perm[k - i] = temp;
76 }
77 flipsCount++;
78 }
80 if (flipsCount > maxFlipsCount) {
81 maxFlipsCount = flipsCount;
82 for (var i = 0; i < n; i++) maxPerm[i] = perm1[i];
83 }
84 }
86 while (true) {
87 if (r == n) return maxFlipsCount;
88 var perm0 = perm1[0];
89 var i = 0;
90 while (i < r) {
91 var j = i + 1;
92 perm1[i] = perm1[j];
93 i = j;
94 }
95 perm1[r] = perm0;
97 count[r] = count[r] - 1;
98 if (count[r] > 0) break;
99 r++;
100 }
101 }
102 }
104 var n = 8;
105 var ret = fannkuch(n);
109 var _sunSpiderInterval = new Date() - _sunSpiderStartDate;
111 document.getElementById("console").innerHTML = _sunSpiderInterval;
112 </script>
115 </body>
116 </html>
