Commit Graph

2256 Commits

Author SHA1 Message Date
Sam Tobin-Hochstadt
44d46e4cd7 Refactor substitution.
- new file types/substitute
 - use structs for substitutions
2010-06-21 18:30:28 -04:00
Sam Tobin-Hochstadt
dcc8beb5cd This test case now passes. 2010-06-21 18:30:28 -04:00
Sam Tobin-Hochstadt
e235c837b0 The inference engine doesn't need this annotation anymore. 2010-06-21 18:30:25 -04:00
Sam Tobin-Hochstadt
7b2de53733 Re-enable the printer here. 2010-06-21 18:30:24 -04:00
Sam Tobin-Hochstadt
12384c6c3f Change type variable environments from hash tables to sets. 2010-06-21 18:29:59 -04:00
Sam Tobin-Hochstadt
e9f8cc9aca Refactor test harness. 2010-06-21 18:29:59 -04:00
Sam Tobin-Hochstadt
f7b59f78e9 Generalize ListDots to Listof in inference of loop var types. 2010-06-21 18:29:58 -04:00
Sam Tobin-Hochstadt
a2af89bafd Inference for passing ListDots as Listof. 2010-06-21 18:29:57 -04:00
Sam Tobin-Hochstadt
fd5a662ccc Subtyping between (List T ... a) and (Listof T[Any/a]) 2010-06-21 18:29:57 -04:00
Sam Tobin-Hochstadt
4cbeb0b2f0 Change type of ... rest args to have (List T ...) types. 2010-06-21 18:29:56 -04:00
Sam Tobin-Hochstadt
e40d1824b0 Initial ListDots test. 2010-06-21 18:29:56 -04:00
Sam Tobin-Hochstadt
50f93b9ed7 More environment refactoring.
- rationalize naming of files
- split files by env constructed
2010-06-21 18:29:55 -04:00
Jay McCarthy
a13edb18b6 Transparent XML structs 2010-06-21 12:48:26 -06:00
Jay McCarthy
801419693a Default args to eliminate-whitespace 2010-06-21 12:48:26 -06:00
Eli Barzilay
554f026c71 "The Great Computer Language Shootout" -> "The Computer Language Benchmarks Game"
As requested by Isaac Gouy.
2010-06-20 22:19:43 -04:00
Eli Barzilay
ee57029a92 One more optimization, getting it to 60x. 2010-06-20 18:37:07 -04:00
Eli Barzilay
eec0f4bf66 Yet another 2x factor.
(Total ~22x.)
2010-06-20 18:37:06 -04:00
Eli Barzilay
c78f367d9f Another simple improvement, making things about twice faster.
Total speedup is now ~14x.
2010-06-20 18:37:06 -04:00
Eli Barzilay
26c89b2ac6 And one more optimization gets this to a total of 6x improvement. 2010-06-20 18:37:06 -04:00
Eli Barzilay
e975e8e0c8 Another optimization, makes the `fl->fx' issue from the last one
irrelevant since it's not using it in the tight loop, but buys a bigger
improvement anyway.
2010-06-20 18:37:06 -04:00
Eli Barzilay
96006264ad Some improved shootout benchmarks.
* An improved version of the `fasta' benchmark: ~2.5 times faster, and
  if an inlined `unsafe-fl->fx' is added it is probably going to be
  about ~3.5 times faster.

* `reversecomplement' -- revised code that is ~2.5 times faster, further
  tweaks and unsafe ops gets it to ~4.5 times.

* Doing the structs differently in `binarytrees' and a few minor tweaks
  get it to be ~1.5 times faster.  This is probably because a leaf has
  now only one field.

* `mandelbrot' improved a little (~1.2x), but the code is pretty much a
  rewrite.  (Given some more flonum inlining it can probably do much
  better.)

* Added a comment to `pidigits-gmp' saying that it was used without
  attribution.

These versions use unsafe operations, but I'm not putting them in
separate files since it's easy to turn them off.  I've also removed
"mandelbrot-unsafe.rkt", since it was identical to the safe version.
2010-06-20 18:36:25 -04:00
Sam Tobin-Hochstadt
1e15ce1f32 Fix error message for 1-arg apply 2010-06-19 14:58:52 -04:00
Vincent St-Amour
f16732adbe Fixed a typo in the shootout harness. 2010-06-18 20:30:15 -04:00
Robby Findler
4cd7152b62 made the drracket test suite match the new labels in the language dialog. 2010-06-18 17:38:54 -05:00
Vincent St-Amour
416f4fd3c3 Added input generation for the regexmatch benchmark. 2010-06-18 17:43:06 -04:00
Vincent St-Amour
894d159123 Disabled thread-ring in the harness, since it calls exit and doesn't
display its running time.
2010-06-18 17:43:05 -04:00
Vincent St-Amour
1dc963684b Rewrote the typed partialsums benchmark to be closer to the untyped
version.
2010-06-18 17:43:04 -04:00
Vincent St-Amour
31f285d23c Adjusted benchmark sizes. 2010-06-18 17:43:04 -04:00
Vincent St-Amour
343e9d23b4 Ported some new benchmarks and variants to Typed Scheme. 2010-06-18 17:43:04 -04:00
Vincent St-Amour
ffad1edd7a Added the fannkuch-redux benchmark, which replaced fannkuch on the
shootout roster.
2010-06-18 17:43:03 -04:00
Vincent St-Amour
7ccae0fb1d Got rid of assertions in the benchmarks caused by naturals as indices. 2010-06-18 17:43:02 -04:00
Vincent St-Amour
54eefc52ed Relaxed some type constraints on the ray tracer benchmark. 2010-06-18 17:43:01 -04:00
Vincent St-Amour
e0b880d1ea Fixed the sumcol benchmark to obey the new type for read-line. 2010-06-18 17:43:01 -04:00
Vincent St-Amour
72ec18cc68 Rewrote the moments benchmark to potentially benefit from unboxing of
loop accumulators.
2010-06-18 17:43:01 -04:00
Vincent St-Amour
06eb544fd6 Fixes to the shootout benchmarks to reflect the new weaker promotion
rules.
2010-06-18 17:43:00 -04:00
Vincent St-Amour
ff1c3874cc Added a coercion to inexact to avoid the case: (* <float> 0) -> exact 0
which causes a segfault when the result is used with an unsafe-fl
operation.
2010-06-18 17:43:00 -04:00
Vincent St-Amour
cff4eef7b2 Adjusted input size for the shootout benchmarks. 2010-06-18 17:43:00 -04:00
Vincent St-Amour
31d4da6f39 Added an empty benchmark to measure Typed Scheme's startup time. 2010-06-18 17:42:59 -04:00
Vincent St-Amour
7bb8405871 Fixed a bug in the shootout harness, which threw away generated input. 2010-06-18 17:42:59 -04:00
Vincent St-Amour
3e0446d774 Modified some of the untyped shootout benchmarks to be closer to the
typed versions.
2010-06-18 17:42:58 -04:00
Vincent St-Amour
7f3db138e7 Integrated the typed shootout benchmarks to the untyped harness. 2010-06-18 17:42:58 -04:00
Vincent St-Amour
d48f1bb6aa Racketified the untyped shootout benchmarks. 2010-06-18 17:42:58 -04:00
Vincent St-Amour
4fde1e8ccb Ported most of the shootout benchmarks to Typed Scheme. 2010-06-18 17:42:57 -04:00
Sam Tobin-Hochstadt
77e4bbb5eb base-types-new -> base-types 2010-06-17 11:47:16 -04:00
Sam Tobin-Hochstadt
bdbb6d48e6 Try harder to find types for loop variables.
- use `find-annotation' more
 - recognize (let ([x y]) ...)
2010-06-17 11:26:33 -04:00
Vincent St-Amour
93e5d0e9dc Added an option to subtract the running time of the empty benchmark to
the tabulator.
2010-06-15 16:39:32 -04:00
Vincent St-Amour
a33372eb78 Added an option to display the coefficient of variation to the
tabulator.
2010-06-15 16:21:51 -04:00
Sam Tobin-Hochstadt
4cc86cc8c8 set-mc[ad]r!, inference, printing, tests for mpairs 2010-06-15 16:10:16 -04:00
Sam Tobin-Hochstadt
f73d63e1af eq? is a predicate for eof 2010-06-15 14:59:08 -04:00
Sam Tobin-Hochstadt
cf5c74a2ca Generate -> instead of ->* when required by case->.
Closes PR 10977.
2010-06-13 15:01:57 -04:00