1/* 2Redistribution and use in source and binary forms, with or without 3modification, are permitted provided that the following conditions are met: 4 5 * Redistributions of source code must retain the above copyright 6 notice, this list of conditions and the following disclaimer. 7 8 * Redistributions in binary form must reproduce the above copyright 9 notice, this list of conditions and the following disclaimer in the 10 documentation and/or other materials provided with the distribution. 11 12 * Neither the name of "The Computer Language Benchmarks Game" nor the 13 name of "The Computer Language Shootout Benchmarks" nor the names of 14 its contributors may be used to endorse or promote products derived 15 from this software without specific prior written permission. 16 17THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 18AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE 21LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 22CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 23SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 24INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 25CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 26ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 27POSSIBILITY OF SUCH DAMAGE. 28*/ 29 30/* The Computer Language Benchmarks Game 31 * http://shootout.alioth.debian.org/ 32 * 33 * contributed by The Go Authors. 34 * based on C program by Kevin Carson 35 */ 36 37package main 38 39import ( 40 "flag" 41 "fmt" 42 "time" 43) 44 45var n = flag.Int("n", 16, "depth") 46 47type Node struct { 48 item int 49 left, right *Node 50} 51 52func bottomUpTree(item, depth int) *Node { 53 if depth <= 0 { 54 return &Node{item: item} 55 } 56 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)} 57} 58 59func (n *Node) itemCheck() int { 60 if n.left == nil { 61 return n.item 62 } 63 return n.item + n.left.itemCheck() - n.right.itemCheck() 64} 65 66const minDepth = 4 67 68func main() { 69 flag.Parse() 70 71 t0 := time.Now() 72 73 maxDepth := *n 74 if minDepth+2 > *n { 75 maxDepth = minDepth + 2 76 } 77 stretchDepth := maxDepth + 1 78 79 check := bottomUpTree(0, stretchDepth).itemCheck() 80 fmt.Printf("stretch tree of depth %d\t check: %d\n", stretchDepth, check) 81 82 longLivedTree := bottomUpTree(0, maxDepth) 83 84 for depth := minDepth; depth <= maxDepth; depth += 2 { 85 iterations := 1 << uint(maxDepth-depth+minDepth) 86 check = 0 87 88 for i := 1; i <= iterations; i++ { 89 check += bottomUpTree(i, depth).itemCheck() 90 check += bottomUpTree(-i, depth).itemCheck() 91 } 92 fmt.Printf("%d\t trees of depth %d\t check: %d\n", iterations*2, depth, check) 93 } 94 fmt.Printf("long lived tree of depth %d\t check: %d\n", maxDepth, longLivedTree.itemCheck()) 95 96 t1 := time.Now() 97 98 // Standard gotest benchmark output, collected by build dashboard. 99 gcstats("BenchmarkTree", *n, t1.Sub(t0)) 100} 101