testing/performance/talos/page_load_test/sunspider/access-binary-trees.html

   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 <link rel="stylesheet" href="sunspider.css"></link>
  30 </head>
  31
  32 <body>
  33 <h3>access-binary-trees</h3>
  34 <div id="console">
  35 </div>
  36 <script>
  37
  38
  39 /* The Great Computer Language Shootout
  40    http://shootout.alioth.debian.org/
  41    contributed by Isaac Gouy */
  42
  43 function TreeNode(left,right,item){
  44    this.left = left;
  45    this.right = right;
  46    this.item = item;
  47 }
  48
  49 TreeNode.prototype.itemCheck = function(){
  50    if (this.left==null) return this.item;
  51    else return this.item + this.left.itemCheck() - this.right.itemCheck();
  52 }
  53
  54 function bottomUpTree(item,depth){
  55    if (depth>0){
  56       return new TreeNode(
  57           bottomUpTree(2*item-1, depth-1)
  58          ,bottomUpTree(2*item, depth-1)
  59          ,item
  60       );
  61    }
  62    else {
  63       return new TreeNode(null,null,item);
  64    }
  65 }
  66
  67 var ret;
  68
  69 for ( var n = 4; n <= 7; n += 1 ) {
  70     var minDepth = 4;
  71     var maxDepth = Math.max(minDepth + 2, n);
  72     var stretchDepth = maxDepth + 1;
  73
  74     var check = bottomUpTree(0,stretchDepth).itemCheck();
  75
  76     var longLivedTree = bottomUpTree(0,maxDepth);
  77     for (var depth=minDepth; depth<=maxDepth; depth+=2){
  78         var iterations = 1 << (maxDepth - depth + minDepth);
  79
  80         check = 0;
  81         for (var i=1; i<=iterations; i++){
  82             check += bottomUpTree(i,depth).itemCheck();
  83             check += bottomUpTree(-i,depth).itemCheck();
  84         }
  85     }
  86
  87     ret = longLivedTree.itemCheck();
  88 }
  89
  90
  91
  92 </script>
  93
  94
  95 </body>
  96 </html>