The Tor Browser / file comparison
comparison: build/pgo/js-input/access-binary-trees.html
build/pgo/js-input/access-binary-trees.html
- branch
- TOR_BUG_3246
- changeset 7
- 129ffea94266
equal
deleted
inserted
replaced
| -1:000000000000 | 0:b95f7f4e2285 |
|---|---|
| 1 <!DOCTYPE html> | |
| 2 <head> | |
| 3 <!-- | |
| 4 Copyright (C) 2007 Apple Inc. All rights reserved. | |
| 5 | |
| 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. | |
| 14 | |
| 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 --> | |
| 27 | |
| 28 <title>SunSpider access-binary-trees</title> | |
| 29 | |
| 30 </head> | |
| 31 | |
| 32 <body> | |
| 33 <h3>access-binary-trees</h3> | |
| 34 <div id="console"> | |
| 35 </div> | |
| 36 | |
| 37 <script> | |
| 38 | |
| 39 var _sunSpiderStartDate = new Date(); | |
| 40 | |
| 41 /* The Great Computer Language Shootout | |
| 42 http://shootout.alioth.debian.org/ | |
| 43 contributed by Isaac Gouy */ | |
| 44 | |
| 45 function TreeNode(left,right,item){ | |
| 46 this.left = left; | |
| 47 this.right = right; | |
| 48 this.item = item; | |
| 49 } | |
| 50 | |
| 51 TreeNode.prototype.itemCheck = function(){ | |
| 52 if (this.left==null) return this.item; | |
| 53 else return this.item + this.left.itemCheck() - this.right.itemCheck(); | |
| 54 } | |
| 55 | |
| 56 function bottomUpTree(item,depth){ | |
| 57 if (depth>0){ | |
| 58 return new TreeNode( | |
| 59 bottomUpTree(2*item-1, depth-1) | |
| 60 ,bottomUpTree(2*item, depth-1) | |
| 61 ,item | |
| 62 ); | |
| 63 } | |
| 64 else { | |
| 65 return new TreeNode(null,null,item); | |
| 66 } | |
| 67 } | |
| 68 | |
| 69 var ret; | |
| 70 | |
| 71 for ( var n = 4; n <= 7; n += 1 ) { | |
| 72 var minDepth = 4; | |
| 73 var maxDepth = Math.max(minDepth + 2, n); | |
| 74 var stretchDepth = maxDepth + 1; | |
| 75 | |
| 76 var check = bottomUpTree(0,stretchDepth).itemCheck(); | |
| 77 | |
| 78 var longLivedTree = bottomUpTree(0,maxDepth); | |
| 79 for (var depth=minDepth; depth<=maxDepth; depth+=2){ | |
| 80 var iterations = 1 << (maxDepth - depth + minDepth); | |
| 81 | |
| 82 check = 0; | |
| 83 for (var i=1; i<=iterations; i++){ | |
| 84 check += bottomUpTree(i,depth).itemCheck(); | |
| 85 check += bottomUpTree(-i,depth).itemCheck(); | |
| 86 } | |
| 87 } | |
| 88 | |
| 89 ret = longLivedTree.itemCheck(); | |
| 90 } | |
| 91 | |
| 92 | |
| 93 var _sunSpiderInterval = new Date() - _sunSpiderStartDate; | |
| 94 | |
| 95 document.getElementById("console").innerHTML = _sunSpiderInterval; | |
| 96 </script> | |
| 97 | |
| 98 | |
| 99 </body> | |
| 100 </html> |
