build/pgo/js-input/access-fannkuch.html@129ffea94266 (annotated)
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.
| michael@0 | 1 | <!DOCTYPE html> |
| michael@0 | 2 | <head> |
| michael@0 | 3 | <!-- |
| michael@0 | 4 | Copyright (C) 2007 Apple Inc. All rights reserved. |
| michael@0 | 5 | |
| michael@0 | 6 | Redistribution and use in source and binary forms, with or without |
| michael@0 | 7 | modification, are permitted provided that the following conditions |
| michael@0 | 8 | are met: |
| michael@0 | 9 | 1. Redistributions of source code must retain the above copyright |
| michael@0 | 10 | notice, this list of conditions and the following disclaimer. |
| michael@0 | 11 | 2. Redistributions in binary form must reproduce the above copyright |
| michael@0 | 12 | notice, this list of conditions and the following disclaimer in the |
| michael@0 | 13 | documentation and/or other materials provided with the distribution. |
| michael@0 | 14 | |
| michael@0 | 15 | THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
| michael@0 | 16 | EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| michael@0 | 17 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
| michael@0 | 18 | PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
| michael@0 | 19 | CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
| michael@0 | 20 | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
| michael@0 | 21 | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
| michael@0 | 22 | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
| michael@0 | 23 | OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| michael@0 | 24 | (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| michael@0 | 25 | OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| michael@0 | 26 | --> |
| michael@0 | 27 | |
| michael@0 | 28 | <title>SunSpider access-fannkuch</title> |
| michael@0 | 29 | |
| michael@0 | 30 | </head> |
| michael@0 | 31 | |
| michael@0 | 32 | <body> |
| michael@0 | 33 | <h3>access-fannkuch</h3> |
| michael@0 | 34 | <div id="console"> |
| michael@0 | 35 | </div> |
| michael@0 | 36 | |
| michael@0 | 37 | <script> |
| michael@0 | 38 | |
| michael@0 | 39 | var _sunSpiderStartDate = new Date(); |
| michael@0 | 40 | |
| michael@0 | 41 | /* The Great Computer Language Shootout |
| michael@0 | 42 | http://shootout.alioth.debian.org/ |
| michael@0 | 43 | contributed by Isaac Gouy */ |
| michael@0 | 44 | |
| michael@0 | 45 | function fannkuch(n) { |
| michael@0 | 46 | var check = 0; |
| michael@0 | 47 | var perm = Array(n); |
| michael@0 | 48 | var perm1 = Array(n); |
| michael@0 | 49 | var count = Array(n); |
| michael@0 | 50 | var maxPerm = Array(n); |
| michael@0 | 51 | var maxFlipsCount = 0; |
| michael@0 | 52 | var m = n - 1; |
| michael@0 | 53 | |
| michael@0 | 54 | for (var i = 0; i < n; i++) perm1[i] = i; |
| michael@0 | 55 | var r = n; |
| michael@0 | 56 | |
| michael@0 | 57 | while (true) { |
| michael@0 | 58 | // write-out the first 30 permutations |
| michael@0 | 59 | if (check < 30){ |
| michael@0 | 60 | var s = ""; |
| michael@0 | 61 | for(var i=0; i<n; i++) s += (perm1[i]+1).toString(); |
| michael@0 | 62 | check++; |
| michael@0 | 63 | } |
| michael@0 | 64 | |
| michael@0 | 65 | while (r != 1) { count[r - 1] = r; r--; } |
| michael@0 | 66 | if (!(perm1[0] == 0 || perm1[m] == m)) { |
| michael@0 | 67 | for (var i = 0; i < n; i++) perm[i] = perm1[i]; |
| michael@0 | 68 | |
| michael@0 | 69 | var flipsCount = 0; |
| michael@0 | 70 | var k; |
| michael@0 | 71 | |
| michael@0 | 72 | while (!((k = perm[0]) == 0)) { |
| michael@0 | 73 | var k2 = (k + 1) >> 1; |
| michael@0 | 74 | for (var i = 0; i < k2; i++) { |
| michael@0 | 75 | var temp = perm[i]; perm[i] = perm[k - i]; perm[k - i] = temp; |
| michael@0 | 76 | } |
| michael@0 | 77 | flipsCount++; |
| michael@0 | 78 | } |
| michael@0 | 79 | |
| michael@0 | 80 | if (flipsCount > maxFlipsCount) { |
| michael@0 | 81 | maxFlipsCount = flipsCount; |
| michael@0 | 82 | for (var i = 0; i < n; i++) maxPerm[i] = perm1[i]; |
| michael@0 | 83 | } |
| michael@0 | 84 | } |
| michael@0 | 85 | |
| michael@0 | 86 | while (true) { |
| michael@0 | 87 | if (r == n) return maxFlipsCount; |
| michael@0 | 88 | var perm0 = perm1[0]; |
| michael@0 | 89 | var i = 0; |
| michael@0 | 90 | while (i < r) { |
| michael@0 | 91 | var j = i + 1; |
| michael@0 | 92 | perm1[i] = perm1[j]; |
| michael@0 | 93 | i = j; |
| michael@0 | 94 | } |
| michael@0 | 95 | perm1[r] = perm0; |
| michael@0 | 96 | |
| michael@0 | 97 | count[r] = count[r] - 1; |
| michael@0 | 98 | if (count[r] > 0) break; |
| michael@0 | 99 | r++; |
| michael@0 | 100 | } |
| michael@0 | 101 | } |
| michael@0 | 102 | } |
| michael@0 | 103 | |
| michael@0 | 104 | var n = 8; |
| michael@0 | 105 | var ret = fannkuch(n); |
| michael@0 | 106 | |
| michael@0 | 107 | |
| michael@0 | 108 | |
| michael@0 | 109 | var _sunSpiderInterval = new Date() - _sunSpiderStartDate; |
| michael@0 | 110 | |
| michael@0 | 111 | document.getElementById("console").innerHTML = _sunSpiderInterval; |
| michael@0 | 112 | </script> |
| michael@0 | 113 | |
| michael@0 | 114 | |
| michael@0 | 115 | </body> |
| michael@0 | 116 | </html> |
