chrislo-sourceclassifier 0.2.0

data/lib/sourceclassifier.rb

@@ -0,0 +1,22 @@
+require 'rubygems'
+require 'classifier'
+
+class SourceClassifier
+
+  attr_reader :training_file
+
+  def initialize(training_file=nil)
+    training_file = File.join(File.dirname(__FILE__), '..', 'trainer.bin') unless training_file
+    @training_file = training_file
+    open(@training_file, "r") { |f| @c = Marshal.load(f)}
+  end
+
+  def languages
+    @c.categories
+  end
+
+  def identify(str)
+    @c.classify(str)
+  end
+
+end

data/lib/trainer.rb

@@ -0,0 +1,51 @@
+require 'rubygems'
+require 'classifier'
+require 'ruby-debug'
+
+
+class Trainer
+  attr_reader :classifier
+
+  def initialize(sources_dir, output_dir)
+    @classifier = train(sources_dir,output_dir)
+  end
+
+  def train(sources_dir,output_dir)
+    b = Classifier::Bayes.new 
+
+    languages = Trainer.languages_for(sources_dir)
+    
+    languages.each do |language|
+      b.add_category language
+
+      files = Trainer.files_for(sources_dir,language)
+      files.each do |f|
+        file_content = File.read(f)
+        b.train language, file_content
+      end
+    end
+
+    marshal(output_dir,b)
+    return b
+  end
+  
+  def self.languages_for(sources_dir)
+    languages = Dir["#{sources_dir}/*"].map {|dir| dir.split("/").last}
+  end
+
+  def self.files_for(sources_dir,language)
+    files = Dir["#{sources_dir}/#{language}/*"]
+  end
+
+  private
+
+  def marshal(output_dir, data)
+    FileUtils.mkdir_p(output_dir)
+    Dir.chdir(output_dir) do
+      open("trainer.bin", "w") { |f| Marshal.dump(data, f) }
+    end
+  end
+
+
+
+end

data/sourceclassifier.gemspec

@@ -0,0 +1,35 @@
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = %q{sourceclassifier}
+  s.version = "0.2.0"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 1.2") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Chris Lowis"]
+  s.date = %q{2008-12-08}
+  s.description = %q{Determine the programming language used in a sample}
+  s.email = %q{chris.lowis@gmail.com}
+  s.extra_rdoc_files = ["lib/sourceclassifier.rb", "lib/trainer.rb", "README.textile"]
+  s.files = ["examples/example.rb", "lib/sourceclassifier.rb", "lib/trainer.rb", "Rakefile", "README.textile", "sourceclassifier.gemspec", "sources/gcc/ackermann.gcc-2.gcc", "sources/gcc/ackermann.gcc-3.gcc", "sources/gcc/ary.gcc", "sources/gcc/binarytrees.gcc", "sources/gcc/binarytrees.gcc-2.gcc", "sources/gcc/binarytrees.gcc-3.gcc", "sources/gcc/chameneos.gcc", "sources/gcc/chameneos.gcc-2.gcc", "sources/gcc/chameneos.gcc-3.gcc", "sources/gcc/chameneosredux.gcc", "sources/gcc/echo.gcc", "sources/gcc/except.gcc", "sources/gcc/fannkuch.gcc", "sources/gcc/fannkuch.gcc-2.gcc", "sources/gcc/fasta.gcc", "sources/gcc/fasta.gcc-2.gcc", "sources/gcc/fasta.gcc-3.gcc", "sources/gcc/fasta.gcc-4.gcc", "sources/gcc/fibo.gcc", "sources/gcc/harmonic.gcc", "sources/gcc/hash.gcc", "sources/gcc/hash2.gcc", "sources/gcc/heapsort.gcc", "sources/gcc/hello.gcc-2.gcc", "sources/gcc/hello.gcc-3.gcc", "sources/gcc/knucleotide.gcc", "sources/gcc/knucleotide.gcc-2.gcc", "sources/gcc/lists.gcc", "sources/gcc/magicsquares.gcc", "sources/gcc/mandelbrot.gcc", "sources/gcc/mandelbrot.gcc-2.gcc", "sources/gcc/mandelbrot.gcc-3.gcc", "sources/gcc/mandelbrot.gcc-4.gcc", "sources/gcc/matrix.gcc", "sources/gcc/message.gcc-2.gcc", "sources/gcc/message.gcc-3.gcc", "sources/gcc/methcall.gcc", "sources/gcc/moments.gcc", "sources/gcc/nbody.gcc", "sources/gcc/nbody.gcc-2.gcc", "sources/gcc/nbody.gcc-3.gcc", "sources/gcc/nestedloop.gcc", "sources/gcc/nsieve.gcc", "sources/gcc/nsievebits.gcc-2.gcc", "sources/gcc/nsievebits.gcc-3.gcc", "sources/gcc/objinst.gcc", "sources/gcc/partialsums.gcc", "sources/gcc/partialsums.gcc-3.gcc", "sources/gcc/partialsums.gcc-4.gcc", "sources/gcc/pidigits.gcc", "sources/gcc/primes.gcc", "sources/gcc/prodcons.gcc", "sources/gcc/random.gcc", "sources/gcc/raytracer.gcc", "sources/gcc/raytracer.gcc-2.gcc", "sources/gcc/recursive.gcc", "sources/gcc/recursive.gcc-2.gcc", "sources/gcc/regexdna.gcc-2.gcc", "sources/gcc/regexmatch.gcc", "sources/gcc/revcomp.gcc", "sources/gcc/revcomp.gcc-2.gcc", "sources/gcc/revcomp.gcc-4.gcc", "sources/gcc/reversefile.gcc", "sources/gcc/reversefile.gcc-2.gcc", "sources/gcc/sieve.gcc", "sources/gcc/spectralnorm.gcc", "sources/gcc/spellcheck.gcc", "sources/gcc/spellcheck.gcc-2.gcc", "sources/gcc/strcat.gcc", "sources/gcc/sumcol.gcc-2.gcc", "sources/gcc/sumcol.gcc-3.gcc", "sources/gcc/sumcol.gcc-4.gcc", "sources/gcc/sumcol.gcc-5.gcc", "sources/gcc/takfp.gcc", "sources/gcc/tcp-stream.gcc", "sources/gcc/tcpecho.gcc", "sources/gcc/tcpecho.gcc-2.gcc", "sources/gcc/tcprequest.gcc", "sources/gcc/threadring.gcc", "sources/gcc/wc.gcc", "sources/gcc/wc.gcc-2.gcc", "sources/gcc/wc.gcc-3.gcc", "sources/gcc/wordfreq.gcc-2.gcc", "sources/perl/ackermann.perl", "sources/perl/ackermann.perl-2.perl", "sources/perl/ackermann.perl-3.perl", "sources/perl/ackermann.perl-4.perl", "sources/perl/ary.perl", "sources/perl/ary.perl-2.perl", "sources/perl/binarytrees.perl", "sources/perl/binarytrees.perl-2.perl", "sources/perl/chameneos.perl", "sources/perl/echo.perl", "sources/perl/except.perl", "sources/perl/fannkuch.perl", "sources/perl/fannkuch.perl-2.perl", "sources/perl/fasta.perl", "sources/perl/fasta.perl-2.perl", "sources/perl/fasta.perl-4.perl", "sources/perl/fibo.perl", "sources/perl/fibo.perl-2.perl", "sources/perl/fibo.perl-3.perl", "sources/perl/harmonic.perl", "sources/perl/hash.perl", "sources/perl/hash.perl-2.perl", "sources/perl/hash.perl-3.perl", "sources/perl/hash2.perl", "sources/perl/heapsort.perl", "sources/perl/heapsort.perl-2.perl", "sources/perl/hello.perl", "sources/perl/knucleotide.perl-2.perl", "sources/perl/lists.perl", "sources/perl/mandelbrot.perl-2.perl", "sources/perl/matrix.perl", "sources/perl/matrix.perl-2.perl", "sources/perl/matrix.perl-3.perl", "sources/perl/message.perl", "sources/perl/methcall.perl", "sources/perl/moments.perl", "sources/perl/nbody.perl", "sources/perl/nestedloop.perl", "sources/perl/nsieve.perl-2.perl", "sources/perl/nsieve.perl-4.perl", "sources/perl/nsievebits.perl", "sources/perl/objinst.perl", "sources/perl/partialsums.perl-3.perl", "sources/perl/pidigits.perl", "sources/perl/pidigits.perl-2.perl", "sources/perl/process.perl", "sources/perl/prodcons.perl", "sources/perl/random.perl-4.perl", "sources/perl/recursive.perl-2.perl", "sources/perl/regexdna.perl", "sources/perl/regexdna.perl-2.perl", "sources/perl/regexdna.perl-3.perl", "sources/perl/regexdna.perl-4.perl", "sources/perl/regexdna.perl-5.perl", "sources/perl/regexdna.perl-6.perl", "sources/perl/regexmatch.perl", "sources/perl/revcomp.perl-2.perl", "sources/perl/reversefile.perl", "sources/perl/reversefile.perl-2.perl", "sources/perl/reversefile.perl-3.perl", "sources/perl/sieve.perl", "sources/perl/spectralnorm.perl-2.perl", "sources/perl/spellcheck.perl", "sources/perl/strcat.perl", "sources/perl/strcat.perl-2.perl", "sources/perl/sumcol.perl", "sources/perl/takfp.perl", "sources/perl/takfp.perl-3.perl", "sources/perl/tcpecho.perl", "sources/perl/tcprequest.perl", "sources/perl/tcpstream.perl", "sources/perl/threadring.perl", "sources/perl/threadring.perl-2.perl", "sources/perl/wc.perl", "sources/perl/wc.perl-2.perl", "sources/perl/wordfreq.perl", "sources/perl/wordfreq.perl-3.perl", "sources/perl/wordfreq.perl3.perl", "sources/python/ackermann.python", "sources/python/ary.python", "sources/python/binarytrees.python", "sources/python/binarytrees.python-3.python", "sources/python/chameneos.python-6.python", "sources/python/chameneosredux.python", "sources/python/chameneosredux.python-2.python", "sources/python/dispatch.python", "sources/python/dispatch.python-2.python", "sources/python/echo.python", "sources/python/except.python", "sources/python/fannkuch.python", "sources/python/fannkuch.python-2.python", "sources/python/fasta.python-2.python", "sources/python/fibo.python", "sources/python/fibo.python-2.python", "sources/python/fibo.python-3.python", "sources/python/harmonic.python-2.python", "sources/python/hash.python", "sources/python/hash.python-2.python", "sources/python/hash2.python", "sources/python/heapsort.python-3.python", "sources/python/hello.python", "sources/python/implicitode.python", "sources/python/knucleotide.python", "sources/python/lists.python", "sources/python/magicsquares.python", "sources/python/mandelbrot.python", "sources/python/mandelbrot.python-2.python", "sources/python/mandelbrot.python-3.python", "sources/python/matrix.python", "sources/python/matrix.python-2.python", "sources/python/message.python", "sources/python/message.python-2.python", "sources/python/message.python-3.python", "sources/python/meteor.python", "sources/python/meteor.python-2.python", "sources/python/methcall.python", "sources/python/moments.python", "sources/python/nbody.python", "sources/python/nbody.python-2.python", "sources/python/nestedloop.python", "sources/python/nsieve.python", "sources/python/nsieve.python-2.python", "sources/python/nsieve.python-4.python", "sources/python/nsievebits.python", "sources/python/nsievebits.python-2.python", "sources/python/objinst.python", "sources/python/partialsums.python", "sources/python/partialsums.python-2.python", "sources/python/partialsums.python-3.python", "sources/python/pidigits.python", "sources/python/pidigits.python-3.python", "sources/python/pidigits.python-4.python", "sources/python/process.python", "sources/python/process.python-2.python", "sources/python/prodcons.python", "sources/python/prodcons.python-2.python", "sources/python/random.python", "sources/python/raytracer.python", "sources/python/recursive.python", "sources/python/regexdna.python", "sources/python/regexdna.python-2.python", "sources/python/regexmatch.python", "sources/python/revcomp.python-3.python", "sources/python/reversefile.python", "sources/python/reversefile.python-2.python", "sources/python/reversefile.python-3.python", "sources/python/sieve.python", "sources/python/spectralnorm.python-2.python", "sources/python/spellcheck.python", "sources/python/strcat.python", "sources/python/strcat.python-2.python", "sources/python/sumcol.python-2.python", "sources/python/sumcol.python-3.python", "sources/python/takfp.python", "sources/python/tcpecho.python", "sources/python/tcprequest.python", "sources/python/tcpstream.python", "sources/python/threadring.python", "sources/python/threadring.python-2.python", "sources/python/threadring.python-3.python", "sources/python/wc.python-2.python", "sources/python/wordfreq.python", "sources/python/wordfreq.python-2.python", "sources/python/wordfreq.python-3.python", "sources/python/wordfreq.python-4.python", "sources/python/wordfreq.python-5.python", "sources/ruby/ackermann.ruby", "sources/ruby/ackermann.ruby-5.ruby", "sources/ruby/ary.ruby", "sources/ruby/binarytrees.ruby-2.ruby", "sources/ruby/chameneos.ruby-2.ruby", "sources/ruby/dispatch.ruby", "sources/ruby/echo.ruby", "sources/ruby/except.ruby", "sources/ruby/except.ruby-2.ruby", "sources/ruby/fannkuch.ruby", "sources/ruby/fasta.ruby", "sources/ruby/fibo.ruby", "sources/ruby/harmonic.ruby-2.ruby", "sources/ruby/hash.ruby", "sources/ruby/hash2.ruby", "sources/ruby/heapsort.ruby", "sources/ruby/hello.ruby", "sources/ruby/knucleotide.ruby-2.ruby", "sources/ruby/lists.ruby", "sources/ruby/mandelbrot.ruby-3.ruby", "sources/ruby/matrix.ruby", "sources/ruby/matrix.ruby-2.ruby", "sources/ruby/message.ruby", "sources/ruby/message.ruby-2.ruby", "sources/ruby/meteor.ruby", "sources/ruby/meteor.ruby-2.ruby", "sources/ruby/methcall.ruby", "sources/ruby/methcall.ruby-2.ruby", "sources/ruby/moments.ruby", "sources/ruby/nbody.ruby-2.ruby", "sources/ruby/nestedloop.ruby", "sources/ruby/nsieve.ruby", "sources/ruby/nsieve.ruby-2.ruby", "sources/ruby/nsievebits.ruby-2.ruby", "sources/ruby/objinst.ruby", "sources/ruby/partialsums.ruby", "sources/ruby/pidigits.ruby", "sources/ruby/pidigits.ruby-2.ruby", "sources/ruby/prodcons.ruby", "sources/ruby/random.ruby", "sources/ruby/recursive.ruby-2.ruby", "sources/ruby/regexdna.ruby", "sources/ruby/regexdna.ruby-2.ruby", "sources/ruby/regexmatch.ruby", "sources/ruby/revcomp.ruby", "sources/ruby/reversefile.ruby", "sources/ruby/sieve.ruby", "sources/ruby/spectralnorm.ruby", "sources/ruby/spellcheck.ruby", "sources/ruby/spellcheck.ruby-2.ruby", "sources/ruby/strcat.ruby", "sources/ruby/strcat.ruby-2.ruby", "sources/ruby/sumcol.ruby", "sources/ruby/sumcol.ruby-2.ruby", "sources/ruby/takfp.ruby", "sources/ruby/tcpecho.ruby", "sources/ruby/tcprequest.ruby", "sources/ruby/tcpstream.ruby", "sources/ruby/threadring.ruby", "sources/ruby/threadring.ruby-2.ruby", "sources/ruby/wc.ruby", "sources/ruby/wordfreq.ruby", "sources/ruby/wordfreq.ruby2.ruby", "test/fixtures/sources/gcc/ackermann.gcc-2.gcc", "test/fixtures/sources/python/ackermann.python", "test/fixtures/sources/ruby/ackermann.ruby", "test/test_source_classifier.rb", "test/test_trainer.rb", "trainer.bin", "Manifest"]
+  s.has_rdoc = true
+  s.homepage = %q{http://github.com/chrislo/sourceclassifier/tree/master}
+  s.rdoc_options = ["--line-numbers", "--inline-source", "--title", "Sourceclassifier", "--main", "README.textile"]
+  s.require_paths = ["lib"]
+  s.rubyforge_project = %q{sourceclassifier}
+  s.rubygems_version = %q{1.3.0}
+  s.summary = %q{Determine the programming language used in a sample}
+  s.test_files = ["test/test_source_classifier.rb", "test/test_trainer.rb"]
+
+  if s.respond_to? :specification_version then
+    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
+    s.specification_version = 2
+
+    if Gem::Version.new(Gem::RubyGemsVersion) >= Gem::Version.new('1.2.0') then
+      s.add_runtime_dependency(%q<classifier>, [">= 0"])
+    else
+      s.add_dependency(%q<classifier>, [">= 0"])
+    end
+  else
+    s.add_dependency(%q<classifier>, [">= 0"])
+  end
+end

data/sources/gcc/ackermann.gcc-2.gcc

@@ -0,0 +1,93 @@
+/* -*- mode: c -*-
+ * $Id: ackermann.gcc-2.gcc,v 1.1 2005-03-15 06:17:49 bfulgham Exp $
+ * http://shootout.alioth.debian.org/
+ *
+ * Modified to use C inline and unroll of recursive functions
+ * by Paul Hsieh
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <limits.h>
+#if (defined(__linux) || defined(__unix) || defined(__GNUC__))
+#include <unistd.h>
+#elif (defined(WIN32) || defined(_WIN32) || defined(__WIN32) || 
+defined(_WINDOWS) || defined(_WINDOWS_))
+#include <windows.h>
+#endif
+
+#define glueAckExpand(m) Ack##m
+#define glueAck(m) glueAckExpand(m)
+
+#define Ack0(N) ((N)+1)
+
+#define AckDecl(M,M1)                                 \
+static int glueAck(M) (int N) {                       \
+    if (0 == N) return glueAck(M1) (1);               \
+    if (1 == N) return glueAck(M1) (glueAck(M1) (1)); \
+    return glueAck(M1) (glueAck(M) (N-1));            \
+}
+
+AckDecl(1,0)
+AckDecl(2,1)
+AckDecl(3,2)
+AckDecl(4,3)
+
+/* Removes the overhead of passing around and M parameter, 
+   when it is low (which is the only way this can actually
+   complete execution.) */
+
+int Ack (int M, int N) {
+    switch (M) {
+        case 0: return Ack0 (N);
+        case 1: return Ack1 (N);
+        case 2: return Ack2 (N);
+        case 3: return Ack3 (N);
+        case 4: return Ack4 (N);
+    }
+
+    if (0 == N) return Ack (M-1, 1);
+    if (1 == N) return Ack (M-1, Ack (M-1, 1));
+    return Ack (M-1, Ack (M, N-1));
+}
+
+/* Not called.  Uses full mathematical simplfications when 
+   its possible and unravells the recursion on the N 
+   parameter into a for() loop (so the stack level never 
+   goes deeper than O(M)). */
+
+int AckCheat (int M, int N) {
+    switch (M) {
+        case 0: return Ack0 (N);
+        case 1: return N + 2;
+        case 2: return 2*N + 3;
+        case 3: if (N < (CHAR_BIT * sizeof(int) - 3)) 
+                    return (1 << (N+3))-3;
+    }
+
+    if (0 == N) return AckCheat (M-1, 1);
+    if (1 == N) return AckCheat (M-1, AckCheat (M-1, 1));
+
+    {
+        int a = AckCheat (M-1, 1);
+        for (;N; N--) a = AckCheat (M-1, a);
+        return a;
+    }
+}
+
+int main(int argc, char *argv[]) {
+    int m = ((argc >= 3) ? atoi(argv[argc-2]) : 3);
+    int n = ((argc >= 2) ? atoi(argv[argc-1]) : 1);
+
+    printf("Ack(%d,%d): %d\n", m, n, Ack (m, n));
+
+    /* sleep long enough so we can measure memory usage */
+#if (defined(__linux) || defined(__unix) || defined(__GNUC__))
+    sleep(1);
+#elif (defined(WIN32) || defined(_WIN32) || defined(__WIN32) || 
+defined(_WINDOWS) || defined(_WINDOWS_))
+    Sleep(1000);
+#endif
+
+    return(0);
+}

data/sources/gcc/ackermann.gcc-3.gcc

@@ -0,0 +1,20 @@
+/* -*- mode: c -*-
+ * $Id: ackermann.gcc-3.gcc,v 1.1 2005-04-27 05:21:30 igouy-guest Exp $
+ * http://www.bagley.org/~doug/shootout/
+ *
+ * modified by Isaac Gouy
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <unistd.h>
+
+int Ack(int M, int N) { return(M ? (Ack(M-1,N ? Ack(M,(N-1)) : 1)) : N+1); }
+
+int main(int argc, char *argv[]) {
+    int n = ((argc == 2) ? atoi(argv[1]) : 1);
+
+    printf("Ack(3,%d): %d\n", n, Ack(3, n));
+    return(0);
+}
+

data/sources/gcc/ary.gcc

@@ -0,0 +1,40 @@
+/* -*- mode: c -*-
+ * $Id: ary.gcc,v 1.2 2004-05-22 07:25:00 bfulgham Exp $
+ * http://www.bagley.org/~doug/shootout/
+ *
+ * this program is modified from:
+ *   http://cm.bell-labs.com/cm/cs/who/bwk/interps/pap.html
+ * Timing Trials, or, the Trials of Timing: Experiments with Scripting
+ * and User-Interface Languages</a> by Brian W. Kernighan and
+ * Christopher J. Van Wyk.
+ *
+ * I added free() to deallocate memory.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+
+int
+main(int argc, char *argv[]) {
+    int n = ((argc == 2) ? atoi(argv[1]) : 1);
+    int i, k, *x, *y;
+	
+    x = (int *) calloc(n, sizeof(int));
+    y = (int *) calloc(n, sizeof(int));
+
+    for (i = 0; i < n; i++) {
+	x[i] = i + 1;
+    }
+    for (k=0; k<1000; k++) {
+	for (i = n-1; i >= 0; i--) {
+	    y[i] += x[i];
+	}
+    }
+
+    fprintf(stdout, "%d %d\n", y[0], y[n-1]);
+
+    free(x);
+    free(y);
+
+    return(0);
+}

data/sources/gcc/binarytrees.gcc

@@ -0,0 +1,136 @@
+/* The Computer Language Shootout Benchmarks
+   http://shootout.alioth.debian.org/
+
+   contributed by Kevin Carson
+   compilation:
+       gcc -O3 -fomit-frame-pointer -funroll-loops -static binary-trees.c -lm
+       icc -O3 -ip -unroll -static binary-trees.c -lm
+*/
+
+#include <malloc.h>
+#include <math.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+
+typedef struct tn {
+    struct tn*    left;
+    struct tn*    right;
+    long          item;
+} treeNode;
+
+
+treeNode* NewTreeNode(treeNode* left, treeNode* right, long item)
+{
+    treeNode*    new;
+
+    new = (treeNode*)malloc(sizeof(treeNode));
+
+    new->left = left;
+    new->right = right;
+    new->item = item;
+
+    return new;
+} /* NewTreeNode() */
+
+
+long ItemCheck(treeNode* tree)
+{
+    if (tree->left == NULL)
+        return tree->item;
+    else
+        return tree->item + ItemCheck(tree->left) - ItemCheck(tree->right);
+} /* ItemCheck() */
+
+
+treeNode* BottomUpTree(long item, unsigned depth)
+{
+    if (depth > 0)
+        return NewTreeNode
+        (
+            BottomUpTree(2 * item - 1, depth - 1),
+            BottomUpTree(2 * item, depth - 1),
+            item
+        );
+    else
+        return NewTreeNode(NULL, NULL, item);
+} /* BottomUpTree() */
+
+
+void DeleteTree(treeNode* tree)
+{
+    if (tree->left != NULL)
+    {
+        DeleteTree(tree->left);
+        DeleteTree(tree->right);
+    }
+
+    free(tree);
+} /* DeleteTree() */
+
+
+int main(int argc, char* argv[])
+{
+    unsigned   N, depth, minDepth, maxDepth, stretchDepth;
+    treeNode   *stretchTree, *longLivedTree, *tempTree;
+
+    N = atol(argv[1]);
+
+    minDepth = 4;
+
+    if ((minDepth + 2) > N)
+        maxDepth = minDepth + 2;
+    else
+        maxDepth = N;
+
+    stretchDepth = maxDepth + 1;
+
+    stretchTree = BottomUpTree(0, stretchDepth);
+    printf
+    (
+        "stretch tree of depth %u\t check: %li\n",
+        stretchDepth,
+        ItemCheck(stretchTree)
+    );
+
+    DeleteTree(stretchTree);
+
+    longLivedTree = BottomUpTree(0, maxDepth);
+
+    for (depth = minDepth; depth <= maxDepth; depth += 2)
+    {
+        long    i, iterations, check;
+
+        iterations = pow(2, maxDepth - depth + minDepth);
+
+        check = 0;
+
+        for (i = 1; i <= iterations; i++)
+        {
+            tempTree = BottomUpTree(i, depth);
+            check += ItemCheck(tempTree);
+            DeleteTree(tempTree);
+
+            tempTree = BottomUpTree(-i, depth);
+            check += ItemCheck(tempTree);
+            DeleteTree(tempTree);
+        } /* for(i = 1...) */
+
+        printf
+        (
+            "%li\t trees of depth %u\t check: %li\n",
+            iterations * 2,
+            depth,
+            check
+        );
+    } /* for(depth = minDepth...) */
+
+    printf
+    (
+        "long lived tree of depth %u\t check: %li\n",
+        maxDepth,
+        ItemCheck(longLivedTree)
+    );
+
+    return 0;
+} /* main() */

data/sources/gcc/binarytrees.gcc-2.gcc

@@ -0,0 +1,140 @@
+/* The Computer Language Shootout Benchmarks
+http://shootout.alioth.debian.org/
+
+contributed by Benoit Hudson based on a contribution of Kevin Carson
+compilation:
+gcc -O3 -fomit-frame-pointer binary-trees-2.c
+ */
+
+#include <stdlib.h>
+#include <stdio.h>
+
+typedef struct tn {
+  struct tn*    left;
+  struct tn*    right;
+  long          item;
+} treeNode;
+
+static treeNode *freelist = 0;
+
+treeNode* NewTreeNode(treeNode* left, treeNode* right, long item)
+{
+  treeNode*    new;
+
+  if (NULL == freelist) {
+    new = (treeNode*)malloc(sizeof(treeNode));
+  } else {
+    new = freelist;
+    freelist = freelist -> left;
+  }
+
+  new->left = left;
+  new->right = right;
+  new->item = item;
+
+  return new;
+} /* NewTreeNode() */
+
+
+long ItemCheck(treeNode* tree)
+{
+  if (tree->left == NULL)
+    return tree->item;
+  else
+    return tree->item + ItemCheck(tree->left) - ItemCheck(tree->right);
+} /* ItemCheck() */
+
+
+treeNode* BottomUpTree(long item, unsigned depth)
+{
+  if (depth > 0)
+    return NewTreeNode
+      (
+       BottomUpTree(2 * item - 1, depth - 1),
+       BottomUpTree(2 * item, depth - 1),
+       item
+      );
+  else
+    return NewTreeNode(NULL, NULL, item);
+} /* BottomUpTree() */
+
+
+void DeleteTree(treeNode* tree)
+{
+  if (tree->left != NULL)
+  {
+    DeleteTree(tree->left);
+    DeleteTree(tree->right);
+  }
+
+  tree -> left = freelist;
+  freelist = tree;
+} /* DeleteTree() */
+
+
+int main(int argc, char* argv[])
+{
+  unsigned   N, depth, minDepth, maxDepth, stretchDepth;
+  treeNode   *stretchTree, *longLivedTree, *tempTree;
+
+  N = atol(argv[1]);
+
+  minDepth = 4;
+
+  if ((minDepth + 2) > N)
+    maxDepth = minDepth + 2;
+  else
+    maxDepth = N;
+
+  stretchDepth = maxDepth + 1;
+
+  stretchTree = BottomUpTree(0, stretchDepth);
+  printf
+    (
+     "stretch tree of depth %u\t check: %li\n",
+     stretchDepth,
+     ItemCheck(stretchTree)
+    );
+
+  DeleteTree(stretchTree);
+
+  longLivedTree = BottomUpTree(0, maxDepth);
+
+  for (depth = minDepth; depth <= maxDepth; depth += 2)
+  {
+    long    i, iterations, check;
+
+    iterations = 1 << (maxDepth - depth + minDepth);
+
+    check = 0;
+
+    for (i = 1; i <= iterations; i++)
+    {
+      tempTree = BottomUpTree(i, depth);
+      check += ItemCheck(tempTree);
+      DeleteTree(tempTree);
+
+      tempTree = BottomUpTree(-i, depth);
+      check += ItemCheck(tempTree);
+      DeleteTree(tempTree);
+    } /* for(i = 1...) */
+
+    printf
+      (
+       "%li\t trees of depth %u\t check: %li\n",
+       iterations * 2,
+       depth,
+       check
+      );
+  } /* for(depth = minDepth...) */
+
+  printf
+    (
+     "long lived tree of depth %u\t check: %li\n",
+     maxDepth,
+     ItemCheck(longLivedTree)
+    );
+
+  return 0;
+} /* main() */
+