benchmarks were getting stale, many were not runnable. all updated.

a fresh benchmark run was taken.

benchmarks/benchall.ss

@@ -17,11 +17,11 @@
 
 (for-each 
   (lambda (x) 
-    (fprintf (standard-error-port) "running ~s\n" x)
+    (fprintf (current-error-port) "running ~s\n" x)
     (for-each 
       (lambda (_)
         (unless (zero? (system (format cmd x)))
-          (fprintf (standard-error-port) "ERROR: ~s failed\n" x)))
+          (fprintf (current-error-port) "ERROR: ~s failed\n" x)))
       (make-list 5)))
   all-benchmarks)
 

benchmarks/rnrs-benchmarks.ss

@@ -68,7 +68,12 @@
 
   (define call-with-output-file/truncate
     (lambda (file-name proc)
-      (call-with-output-file file-name proc 'truncate)))
+      (let ([p (open-file-output-port 
+                 file-name 
+                 (file-options no-fail)
+                 'block
+                 (native-transcoder))])
+        (call-with-port p proc))))
 
   (define-syntax include-source
     (lambda (x)

benchmarks/rnrs-benchmarks/browse.ss

@@ -4,6 +4,7 @@
 (library (rnrs-benchmarks browse)
   (export main)
   (import (rnrs) 
+          (rnrs r5rs)
           (rnrs mutable-pairs)
           (rnrs-benchmarks))
   

benchmarks/rnrs-benchmarks/cat.ss

@@ -17,7 +17,11 @@
   
   (define (go)
     (set! inport (open-input-file "bib"))
-    (set! outport (open-output-file "foo"))
+    (set! outport 
+      (open-file-output-port "foo" 
+        (file-options no-fail)
+        'block
+        (native-transcoder)))
     (catport inport)
     (close-input-port inport))
   

benchmarks/rnrs-benchmarks/compiler.ss

@@ -2,7 +2,11 @@
 ;(define char->integer char->ascii)
 (library (rnrs-benchmarks compiler)
   (export main)
-  (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks))
+  (import (rnrs) 
+          (rnrs r5rs)
+          (rnrs mutable-pairs) 
+          (rnrs mutable-strings)
+          (rnrs-benchmarks))
   
   (define open-input-file* open-input-file)
   (define (pp-expression expr port) (write expr port) (newline port))

benchmarks/rnrs-benchmarks/destruc.ss

@@ -4,6 +4,7 @@
   (export main)
   (import (rnrs) 
           (rnrs mutable-pairs)
+          (rnrs r5rs)
           (rnrs-benchmarks))
   
   (define (append-to-tail! x y)

benchmarks/rnrs-benchmarks/fft.ss

@@ -2,7 +2,7 @@
   
 (library (rnrs-benchmarks fft)
   (export main)
-  (import (rnrs) (rnrs arithmetic flonums) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs arithmetic flonums) (rnrs-benchmarks))
 
   ;(define flsin sin)
 

benchmarks/rnrs-benchmarks/gcbench.ss

@@ -35,7 +35,7 @@
 
 (library (rnrs-benchmarks gcbench)
   (export main)
-  (import (rnrs) (rnrs arithmetic flonums) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs arithmetic flonums) (rnrs-benchmarks))
   
   (define (run-benchmark2 name thunk)
     (display name)

benchmarks/rnrs-benchmarks/gcold.ss

@@ -10,7 +10,7 @@
 
 (library (rnrs-benchmarks gcold)
   (export main)
-  (import (rnrs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs-benchmarks))
 
   (define (newRandom)
     (letrec ((random14

benchmarks/rnrs-benchmarks/matrix.ss

@@ -2,7 +2,7 @@
   
 (library (rnrs-benchmarks matrix)
   (export main)
-  (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks))
   ; Chez-Scheme compatibility stuff:
   
   (define (chez-box x) (cons x '()))

benchmarks/rnrs-benchmarks/maze.ss

@@ -12,7 +12,7 @@
   
 (library (rnrs-benchmarks maze)
   (export main)
-  (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks))
 
   (define (random-state n)
     (cons n #f))

benchmarks/rnrs-benchmarks/mazefun.ss

@@ -3,7 +3,7 @@
   
 (library (rnrs-benchmarks mazefun)
   (export main)
-  (import (rnrs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs-benchmarks))
 
   (define foldr
     (lambda (f base lst)

benchmarks/rnrs-benchmarks/mbrot.ss

@@ -2,7 +2,7 @@
   
 (library (rnrs-benchmarks mbrot)
   (export main)
-  (import (rnrs) (rnrs arithmetic flonums) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs arithmetic flonums) (rnrs-benchmarks))
 
   (define (count r i step x y)
   

benchmarks/rnrs-benchmarks/nbody.ss

@@ -9,6 +9,7 @@
   (import
     (rnrs)
     (rnrs arithmetic flonums) 
+    (rnrs r5rs)
     (rnrs mutable-pairs) 
     (rnrs-benchmarks))
   

benchmarks/rnrs-benchmarks/paraffins.ss

@@ -2,7 +2,7 @@
   
 (library (rnrs-benchmarks paraffins)
   (export main)
-  (import (rnrs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs-benchmarks))
 
   (define (gen n)
     (let* ((n/2 (quotient n 2))

benchmarks/rnrs-benchmarks/parsing.ss

@@ -22,7 +22,7 @@
   
 (library (rnrs-benchmarks parsing)
   (export main)
-  (import (rnrs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs mutable-strings) (rnrs-benchmarks))
 
   (define (parsing-benchmark . rest)
     (let* ((n (if (null? rest) 1000 (car rest)))

benchmarks/rnrs-benchmarks/perm9.ss

@@ -35,7 +35,7 @@
  
 (library (rnrs-benchmarks perm9)
   (export main)
-  (import (rnrs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs-benchmarks))
   
   ; Procedure P_n generates a grey code of all perms of n elements
   ; on top of stack ending with reversal of starting sequence

benchmarks/rnrs-benchmarks/pi.ss

@@ -4,7 +4,7 @@
 
 (library (rnrs-benchmarks pi)
   (export main)
-  (import (rnrs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs-benchmarks))
 
   ; Utilities.
   

benchmarks/rnrs-benchmarks/primes.ss

@@ -2,7 +2,7 @@
 
 (library (rnrs-benchmarks primes)
   (export main)
-  (import (rnrs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs-benchmarks))
   
   (define  (interval-list m n)
     (if (> m n)

benchmarks/rnrs-benchmarks/quicksort.ss

@@ -3,7 +3,11 @@
   
 (library (rnrs-benchmarks quicksort)
   (export main)
-  (import (except (rnrs) partition) (rnrs mutable-pairs) (rnrs-benchmarks))
+  (import 
+    (except (rnrs) partition) 
+    (rnrs r5rs)
+    (rnrs mutable-pairs)
+    (rnrs-benchmarks))
 
   (define (quick-1 v less?)
     

benchmarks/rnrs-benchmarks/ray.ss

@@ -3,7 +3,7 @@
 
 (library (rnrs-benchmarks ray)
   (export main)
-  (import (rnrs) (rnrs arithmetic flonums) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs arithmetic flonums) (rnrs-benchmarks))
   
   (define (make-point x y z)
     (vector x y z))

benchmarks/rnrs-benchmarks/scheme.ss

@@ -4,7 +4,10 @@
 
 (library (rnrs-benchmarks scheme)
   (export main)
-  (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs)
+    (rnrs mutable-pairs)
+    (rnrs mutable-strings) 
+    (rnrs-benchmarks))
   
   (define (scheme-eval expr)
     (let ((code (scheme-comp expr scheme-global-environment)))

benchmarks/rnrs-benchmarks/slatex.ss

@@ -10,6 +10,7 @@
     (rnrs) 
     (rnrs unicode)
     (rnrs mutable-pairs)
+    (rnrs mutable-strings)
     (rnrs io simple)
     (rnrs-benchmarks))
 

benchmarks/rnrs-benchmarks/string.ss

@@ -2,7 +2,7 @@
   
 (library (rnrs-benchmarks string)
   (export main)
-  (import (rnrs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs-benchmarks))
 
   (define s "abcdef")
   

benchmarks/rnrs-benchmarks/tail.ss

@@ -29,7 +29,11 @@
   
   (define (go)
     (set! inport (open-input-file "bib"))
-    (set! outport (open-output-file "foo"))
+    (set! outport 
+      (open-file-output-port "foo" 
+        (file-options no-fail)
+        'block
+        (native-transcoder)))
     (tail-r inport)
     (close-input-port inport))
   

benchmarks/rnrs-benchmarks/trav1.ss

@@ -2,7 +2,7 @@
  
 (library (rnrs-benchmarks trav1)
   (export main)
-  (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks))
   
   (define (make-node)
     (vector 'node '() '() (snb) #f #f #f #f #f #f #f))

benchmarks/rnrs-benchmarks/trav2.ss

@@ -2,7 +2,7 @@
  
 (library (rnrs-benchmarks trav2)
   (export main)
-  (import (rnrs) (rnrs mutable-pairs) (rnrs-benchmarks))
+  (import (rnrs) (rnrs r5rs) (rnrs mutable-pairs) (rnrs-benchmarks))
   
   (define (make-node)
     (vector 'node '() '() (snb) #f #f #f #f #f #f #f))

benchmarks/timelog

@@ -36589,120 +36589,379 @@ running stats for wc (15):
     2036 ms elapsed cpu time, including 0 ms collecting
     2036 ms elapsed real time, including 0 ms collecting
     194208 bytes allocated
-NOW: 2007-11-23 20:24:27
+NOW: 2007-12-25 04:45:50
-running stats for compile-ack:
+The garbage collector should touch about 32 megabytes of heap storage.
-    1 collection
+The use of more or less memory will skew the results.
-    51 ms elapsed cpu time, including 33 ms collecting
+Garbage Collector Test
-    81 ms elapsed real time, including 33 ms collecting
+ Stretching memory with a binary tree of depth 18
-    1370184 bytes allocated
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-running stats for ack (20):
+GCBench: Main
-    no collections
+ Creating a long-lived binary tree of depth 16
-    1346 ms elapsed cpu time, including 0 ms collecting
+ Creating a long-lived array of 524284 inexact reals
-    1348 ms elapsed real time, including 0 ms collecting
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-    24 bytes allocated
+Creating 33824 trees of depth 4
-running stats for compile-ack:
+GCBench: Top down construction
-    1 collection
+GCBench: Bottom up construction
-    47 ms elapsed cpu time, including 34 ms collecting
+Creating 8256 trees of depth 6
-    48 ms elapsed real time, including 34 ms collecting
+GCBench: Top down construction
-    1370184 bytes allocated
+GCBench: Bottom up construction
-running stats for ack (20):
+Creating 2052 trees of depth 8
-    no collections
+GCBench: Top down construction
-    1346 ms elapsed cpu time, including 0 ms collecting
+GCBench: Bottom up construction
-    1348 ms elapsed real time, including 0 ms collecting
+Creating 512 trees of depth 10
-    24 bytes allocated
+GCBench: Top down construction
-running stats for compile-ack:
+GCBench: Bottom up construction
-    1 collection
+Creating 128 trees of depth 12
-    46 ms elapsed cpu time, including 33 ms collecting
+GCBench: Top down construction
-    47 ms elapsed real time, including 33 ms collecting
+GCBench: Bottom up construction
-    1370184 bytes allocated
+Creating 32 trees of depth 14
-running stats for ack (20):
+GCBench: Top down construction
-    no collections
+GCBench: Bottom up construction
-    1345 ms elapsed cpu time, including 0 ms collecting
+Creating 8 trees of depth 16
-    1346 ms elapsed real time, including 0 ms collecting
+GCBench: Top down construction
-    24 bytes allocated
+GCBench: Bottom up construction
-running stats for compile-ack:
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-    1 collection
+Garbage Collector Test
-    46 ms elapsed cpu time, including 33 ms collecting
+ Stretching memory with a binary tree of depth 18
-    47 ms elapsed real time, including 33 ms collecting
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-    1370184 bytes allocated
+GCBench: Main
-running stats for compile-ack:
+ Creating a long-lived binary tree of depth 16
-    1 collection
+ Creating a long-lived array of 524284 inexact reals
-    48 ms elapsed cpu time, including 34 ms collecting
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-    50 ms elapsed real time, including 35 ms collecting
+Creating 33824 trees of depth 4
-    1370184 bytes allocated
+GCBench: Top down construction
-running stats for ack (20):
+GCBench: Bottom up construction
-    no collections
+Creating 8256 trees of depth 6
-    1348 ms elapsed cpu time, including 0 ms collecting
+GCBench: Top down construction
-    1351 ms elapsed real time, including 0 ms collecting
+GCBench: Bottom up construction
-    24 bytes allocated
+Creating 2052 trees of depth 8
-running stats for compile-array1:
+GCBench: Top down construction
-    1 collection
+GCBench: Bottom up construction
-    52 ms elapsed cpu time, including 33 ms collecting
+Creating 512 trees of depth 10
-    87 ms elapsed real time, including 34 ms collecting
+GCBench: Top down construction
-    1722224 bytes allocated
+GCBench: Bottom up construction
-running stats for array1 (2):
+Creating 128 trees of depth 12
-    80 collections
+GCBench: Top down construction
-    1739 ms elapsed cpu time, including 479 ms collecting
+GCBench: Bottom up construction
-    1749 ms elapsed real time, including 482 ms collecting
+Creating 32 trees of depth 14
-    320011240 bytes allocated
+GCBench: Top down construction
-running stats for compile-array1:
+GCBench: Bottom up construction
-    1 collection
+Creating 8 trees of depth 16
-    48 ms elapsed cpu time, including 32 ms collecting
+GCBench: Top down construction
-    48 ms elapsed real time, including 33 ms collecting
+GCBench: Bottom up construction
-    1722224 bytes allocated
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-running stats for array1 (2):
+The garbage collector should touch about 32 megabytes of heap storage.
-    80 collections
+The use of more or less memory will skew the results.
-    1737 ms elapsed cpu time, including 476 ms collecting
+Garbage Collector Test
-    1747 ms elapsed real time, including 480 ms collecting
+ Stretching memory with a binary tree of depth 18
-    320011240 bytes allocated
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-running stats for compile-array1:
+GCBench: Main
-    1 collection
+ Creating a long-lived binary tree of depth 16
-    48 ms elapsed cpu time, including 31 ms collecting
+ Creating a long-lived array of 524284 inexact reals
-    48 ms elapsed real time, including 32 ms collecting
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-    1722224 bytes allocated
+Creating 33824 trees of depth 4
-NOW: 2007-11-28 22:35:27
+GCBench: Top down construction
-running stats for compile-ack:
+GCBench: Bottom up construction
-    1 collection
+Creating 8256 trees of depth 6
-    55 ms elapsed cpu time, including 35 ms collecting
+GCBench: Top down construction
-    91 ms elapsed real time, including 41 ms collecting
+GCBench: Bottom up construction
-    1370184 bytes allocated
+Creating 2052 trees of depth 8
-running stats for ack (20):
+GCBench: Top down construction
-    no collections
+GCBench: Bottom up construction
-    1609 ms elapsed cpu time, including 0 ms collecting
+Creating 512 trees of depth 10
-    1612 ms elapsed real time, including 0 ms collecting
+GCBench: Top down construction
-    24 bytes allocated
+GCBench: Bottom up construction
-running stats for compile-ack:
+Creating 128 trees of depth 12
-    1 collection
+GCBench: Top down construction
-    53 ms elapsed cpu time, including 37 ms collecting
+GCBench: Bottom up construction
-    53 ms elapsed real time, including 37 ms collecting
+Creating 32 trees of depth 14
-    1370184 bytes allocated
+GCBench: Top down construction
-running stats for ack (20):
+GCBench: Bottom up construction
-    no collections
+Creating 8 trees of depth 16
-    1614 ms elapsed cpu time, including 0 ms collecting
+GCBench: Top down construction
-    1621 ms elapsed real time, including 0 ms collecting
+GCBench: Bottom up construction
-    24 bytes allocated
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-running stats for compile-ack:
+Garbage Collector Test
-    1 collection
+ Stretching memory with a binary tree of depth 18
-    53 ms elapsed cpu time, including 37 ms collecting
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-    54 ms elapsed real time, including 37 ms collecting
+GCBench: Main
-    1370184 bytes allocated
+ Creating a long-lived binary tree of depth 16
-running stats for ack (20):
+ Creating a long-lived array of 524284 inexact reals
-    no collections
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
-    1615 ms elapsed cpu time, including 0 ms collecting
+Creating 33824 trees of depth 4
-    1621 ms elapsed real time, including 0 ms collecting
+GCBench: Top down construction
-    24 bytes allocated
+GCBench: Bottom up construction
-running stats for compile-ack:
+Creating 8256 trees of depth 6
-    1 collection
+GCBench: Top down construction
-    54 ms elapsed cpu time, including 37 ms collecting
+GCBench: Bottom up construction
-    55 ms elapsed real time, including 38 ms collecting
+Creating 2052 trees of depth 8
-    1370184 bytes allocated
+GCBench: Top down construction
-running stats for ack (20):
+GCBench: Bottom up construction
-    no collections
+Creating 512 trees of depth 10
-    1615 ms elapsed cpu time, including 0 ms collecting
+GCBench: Top down construction
-    1622 ms elapsed real time, including 0 ms collecting
+GCBench: Bottom up construction
-    24 bytes allocated
+Creating 128 trees of depth 12
-running stats for compile-ack:
+GCBench: Top down construction
-    1 collection
+GCBench: Bottom up construction
-    53 ms elapsed cpu time, including 37 ms collecting
+Creating 32 trees of depth 14
-    54 ms elapsed real time, including 38 ms collecting
+GCBench: Top down construction
-    1370184 bytes allocated
+GCBench: Bottom up construction
+Creating 8 trees of depth 16
+GCBench: Top down construction
+GCBench: Bottom up construction
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+The garbage collector should touch about 32 megabytes of heap storage.
+The use of more or less memory will skew the results.
+Garbage Collector Test
+ Stretching memory with a binary tree of depth 18
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+GCBench: Main
+ Creating a long-lived binary tree of depth 16
+ Creating a long-lived array of 524284 inexact reals
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+Creating 33824 trees of depth 4
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8256 trees of depth 6
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 2052 trees of depth 8
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 512 trees of depth 10
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 128 trees of depth 12
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 32 trees of depth 14
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8 trees of depth 16
+GCBench: Top down construction
+GCBench: Bottom up construction
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+Garbage Collector Test
+ Stretching memory with a binary tree of depth 18
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+GCBench: Main
+ Creating a long-lived binary tree of depth 16
+ Creating a long-lived array of 524284 inexact reals
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+Creating 33824 trees of depth 4
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8256 trees of depth 6
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 2052 trees of depth 8
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 512 trees of depth 10
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 128 trees of depth 12
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 32 trees of depth 14
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8 trees of depth 16
+GCBench: Top down construction
+GCBench: Bottom up construction
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+The garbage collector should touch about 32 megabytes of heap storage.
+The use of more or less memory will skew the results.
+Garbage Collector Test
+ Stretching memory with a binary tree of depth 18
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+GCBench: Main
+ Creating a long-lived binary tree of depth 16
+ Creating a long-lived array of 524284 inexact reals
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+Creating 33824 trees of depth 4
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8256 trees of depth 6
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 2052 trees of depth 8
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 512 trees of depth 10
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 128 trees of depth 12
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 32 trees of depth 14
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8 trees of depth 16
+GCBench: Top down construction
+GCBench: Bottom up construction
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+Garbage Collector Test
+ Stretching memory with a binary tree of depth 18
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+GCBench: Main
+ Creating a long-lived binary tree of depth 16
+ Creating a long-lived array of 524284 inexact reals
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+Creating 33824 trees of depth 4
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8256 trees of depth 6
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 2052 trees of depth 8
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 512 trees of depth 10
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 128 trees of depth 12
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 32 trees of depth 14
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8 trees of depth 16
+GCBench: Top down construction
+GCBench: Bottom up construction
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+The garbage collector should touch about 32 megabytes of heap storage.
+The use of more or less memory will skew the results.
+Garbage Collector Test
+ Stretching memory with a binary tree of depth 18
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+GCBench: Main
+ Creating a long-lived binary tree of depth 16
+ Creating a long-lived array of 524284 inexact reals
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+Creating 33824 trees of depth 4
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8256 trees of depth 6
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 2052 trees of depth 8
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 512 trees of depth 10
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 128 trees of depth 12
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 32 trees of depth 14
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8 trees of depth 16
+GCBench: Top down construction
+GCBench: Bottom up construction
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+Garbage Collector Test
+ Stretching memory with a binary tree of depth 18
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+GCBench: Main
+ Creating a long-lived binary tree of depth 16
+ Creating a long-lived array of 524284 inexact reals
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+Creating 33824 trees of depth 4
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8256 trees of depth 6
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 2052 trees of depth 8
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 512 trees of depth 10
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 128 trees of depth 12
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 32 trees of depth 14
+GCBench: Top down construction
+GCBench: Bottom up construction
+Creating 8 trees of depth 16
+GCBench: Top down construction
+GCBench: Bottom up construction
+ Total memory available= ???????? bytes  Free memory= ???????? bytes
+25 megabytes
+0 work units per step.
+promotion ratio is 1:10
+pointer mutation rate is 10
+600 steps
+Allocating 76 trees.
+  (24902160 bytes)
+  (1245108 nodes)
+Initialization complete...
+Allocated 600 Mb of young gen garbage
+    (actually allocated 6e2 megabytes)
+Promoted 6e1 Mb
+    (actually promoted 59.86 megabytes)
+Mutated 6000 pointers
+25 megabytes
+0 work units per step.
+promotion ratio is 1:10
+pointer mutation rate is 10
+600 steps
+Allocating 76 trees.
+  (24902160 bytes)
+  (1245108 nodes)
+Initialization complete...
+Allocated 600 Mb of young gen garbage
+    (actually allocated 6e2 megabytes)
+Promoted 6e1 Mb
+    (actually promoted 59.86 megabytes)
+Mutated 6000 pointers
+25 megabytes
+0 work units per step.
+promotion ratio is 1:10
+pointer mutation rate is 10
+600 steps
+Allocating 76 trees.
+  (24902160 bytes)
+  (1245108 nodes)
+Initialization complete...
+Allocated 600 Mb of young gen garbage
+    (actually allocated 6e2 megabytes)
+Promoted 6e1 Mb
+    (actually promoted 59.86 megabytes)
+Mutated 6000 pointers
+25 megabytes
+0 work units per step.
+promotion ratio is 1:10
+pointer mutation rate is 10
+600 steps
+Allocating 76 trees.
+  (24902160 bytes)
+  (1245108 nodes)
+Initialization complete...
+Allocated 600 Mb of young gen garbage
+    (actually allocated 6e2 megabytes)
+Promoted 6e1 Mb
+    (actually promoted 59.86 megabytes)
+Mutated 6000 pointers
+25 megabytes
+0 work units per step.
+promotion ratio is 1:10
+pointer mutation rate is 10
+600 steps
+Allocating 76 trees.
+  (24902160 bytes)
+  (1245108 nodes)
+Initialization complete...
+Allocated 600 Mb of young gen garbage
+    (actually allocated 6e2 megabytes)
+Promoted 6e1 Mb
+    (actually promoted 59.86 megabytes)
+Mutated 6000 pointers
+15794.97500000012
+15794.97500000012
+15794.97500000012
+15794.97500000012
+15794.97500000012