| Index: chrome/test/data/sunspider/access-binary-trees.html
|
| ===================================================================
|
| --- chrome/test/data/sunspider/access-binary-trees.html (revision 0)
|
| +++ chrome/test/data/sunspider/access-binary-trees.html (revision 0)
|
| @@ -0,0 +1,100 @@
|
| +<!DOCTYPE html>
|
| +<head>
|
| +<!--
|
| + Copyright (C) 2007 Apple Inc. All rights reserved.
|
| +
|
| + Redistribution and use in source and binary forms, with or without
|
| + modification, are permitted provided that the following conditions
|
| + are met:
|
| + 1. Redistributions of source code must retain the above copyright
|
| + notice, this list of conditions and the following disclaimer.
|
| + 2. Redistributions in binary form must reproduce the above copyright
|
| + notice, this list of conditions and the following disclaimer in the
|
| + documentation and/or other materials provided with the distribution.
|
| +
|
| + THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY
|
| + EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| + IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
| + PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR
|
| + CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
| + EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
| + PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
|
| + PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
|
| + OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| + (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| + OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| +-->
|
| +
|
| +<title>SunSpider access-binary-trees</title>
|
| +<link rel="stylesheet" href="sunspider.css">
|
| +</head>
|
| +
|
| +<body>
|
| +<h3>access-binary-trees</h3>
|
| +<div id="console">
|
| +</div>
|
| +<script src="sunspider-record-result.js"></script>
|
| +<script>
|
| +
|
| +var _sunSpiderStartDate = new Date();
|
| +
|
| +/* The Great Computer Language Shootout
|
| + http://shootout.alioth.debian.org/
|
| + contributed by Isaac Gouy */
|
| +
|
| +function TreeNode(left,right,item){
|
| + this.left = left;
|
| + this.right = right;
|
| + this.item = item;
|
| +}
|
| +
|
| +TreeNode.prototype.itemCheck = function(){
|
| + if (this.left==null) return this.item;
|
| + else return this.item + this.left.itemCheck() - this.right.itemCheck();
|
| +}
|
| +
|
| +function bottomUpTree(item,depth){
|
| + if (depth>0){
|
| + return new TreeNode(
|
| + bottomUpTree(2*item-1, depth-1)
|
| + ,bottomUpTree(2*item, depth-1)
|
| + ,item
|
| + );
|
| + }
|
| + else {
|
| + return new TreeNode(null,null,item);
|
| + }
|
| +}
|
| +
|
| +var ret;
|
| +
|
| +for ( var n = 4; n <= 7; n += 1 ) {
|
| + var minDepth = 4;
|
| + var maxDepth = Math.max(minDepth + 2, n);
|
| + var stretchDepth = maxDepth + 1;
|
| +
|
| + var check = bottomUpTree(0,stretchDepth).itemCheck();
|
| +
|
| + var longLivedTree = bottomUpTree(0,maxDepth);
|
| + for (var depth=minDepth; depth<=maxDepth; depth+=2){
|
| + var iterations = 1 << (maxDepth - depth + minDepth);
|
| +
|
| + check = 0;
|
| + for (var i=1; i<=iterations; i++){
|
| + check += bottomUpTree(i,depth).itemCheck();
|
| + check += bottomUpTree(-i,depth).itemCheck();
|
| + }
|
| + }
|
| +
|
| + ret = longLivedTree.itemCheck();
|
| +}
|
| +
|
| +
|
| +var _sunSpiderInterval = new Date() - _sunSpiderStartDate;
|
| +
|
| +record(_sunSpiderInterval);
|
| +</script>
|
| +
|
| +
|
| +</body>
|
| +</html>
|
|
|
| Property changes on: chrome\test\data\sunspider\access-binary-trees.html
|
| ___________________________________________________________________
|
| Added: svn:eol-style
|
| + LF
|
|
|
|
|
Chromium Code Reviews
Issue 42549:
Add a copy of SunSpider 0.9 for performance testing.... (Closed)
Base URL: svn://chrome-svn/chrome/trunk/src/