build/pgo/js-input/access-binary-trees.html@129ffea94266 (annotated)
build/pgo/js-input/access-binary-trees.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-binary-trees</title> |
| michael@0 | 29 | |
| michael@0 | 30 | </head> |
| michael@0 | 31 | |
| michael@0 | 32 | <body> |
| michael@0 | 33 | <h3>access-binary-trees</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 TreeNode(left,right,item){ |
| michael@0 | 46 | this.left = left; |
| michael@0 | 47 | this.right = right; |
| michael@0 | 48 | this.item = item; |
| michael@0 | 49 | } |
| michael@0 | 50 | |
| michael@0 | 51 | TreeNode.prototype.itemCheck = function(){ |
| michael@0 | 52 | if (this.left==null) return this.item; |
| michael@0 | 53 | else return this.item + this.left.itemCheck() - this.right.itemCheck(); |
| michael@0 | 54 | } |
| michael@0 | 55 | |
| michael@0 | 56 | function bottomUpTree(item,depth){ |
| michael@0 | 57 | if (depth>0){ |
| michael@0 | 58 | return new TreeNode( |
| michael@0 | 59 | bottomUpTree(2*item-1, depth-1) |
| michael@0 | 60 | ,bottomUpTree(2*item, depth-1) |
| michael@0 | 61 | ,item |
| michael@0 | 62 | ); |
| michael@0 | 63 | } |
| michael@0 | 64 | else { |
| michael@0 | 65 | return new TreeNode(null,null,item); |
| michael@0 | 66 | } |
| michael@0 | 67 | } |
| michael@0 | 68 | |
| michael@0 | 69 | var ret; |
| michael@0 | 70 | |
| michael@0 | 71 | for ( var n = 4; n <= 7; n += 1 ) { |
| michael@0 | 72 | var minDepth = 4; |
| michael@0 | 73 | var maxDepth = Math.max(minDepth + 2, n); |
| michael@0 | 74 | var stretchDepth = maxDepth + 1; |
| michael@0 | 75 | |
| michael@0 | 76 | var check = bottomUpTree(0,stretchDepth).itemCheck(); |
| michael@0 | 77 | |
| michael@0 | 78 | var longLivedTree = bottomUpTree(0,maxDepth); |
| michael@0 | 79 | for (var depth=minDepth; depth<=maxDepth; depth+=2){ |
| michael@0 | 80 | var iterations = 1 << (maxDepth - depth + minDepth); |
| michael@0 | 81 | |
| michael@0 | 82 | check = 0; |
| michael@0 | 83 | for (var i=1; i<=iterations; i++){ |
| michael@0 | 84 | check += bottomUpTree(i,depth).itemCheck(); |
| michael@0 | 85 | check += bottomUpTree(-i,depth).itemCheck(); |
| michael@0 | 86 | } |
| michael@0 | 87 | } |
| michael@0 | 88 | |
| michael@0 | 89 | ret = longLivedTree.itemCheck(); |
| michael@0 | 90 | } |
| michael@0 | 91 | |
| michael@0 | 92 | |
| michael@0 | 93 | var _sunSpiderInterval = new Date() - _sunSpiderStartDate; |
| michael@0 | 94 | |
| michael@0 | 95 | document.getElementById("console").innerHTML = _sunSpiderInterval; |
| michael@0 | 96 | </script> |
| michael@0 | 97 | |
| michael@0 | 98 | |
| michael@0 | 99 | </body> |
| michael@0 | 100 | </html> |
