Commit Graph

450 Commits (cbdd559a759b5aef9b1c97d8b69a29e159d14ae1)

Author SHA1 Message Date
John Benediktsson 742ed3bc21 extra: use map-sum in a few places. 2014-06-06 10:14:11 -07:00
John Benediktsson 6e834cd0de benchmark.tuple-arrays: cleanup, assert result. 2014-06-02 08:40:05 -07:00
John Benediktsson 2752d83aca benchmark.namespaces: adding a namespaces benchmark. 2014-05-20 19:18:39 -07:00
John Benediktsson 8e8d319943 benchmark.interval-sets: adding a benchmark of interval-sets. 2014-05-20 19:16:53 -07:00
John Benediktsson 3be0958e5d benchmark.lexer: adding a lexer benchmark. 2014-05-20 19:15:12 -07:00
John Benediktsson de586a946d benchmark.make: adding a MAIN:. 2014-05-20 15:10:44 -07:00
John Benediktsson e431db4144 benchmark.regexp: longer benchmark. 2014-05-18 20:47:22 -07:00
John Benediktsson 344e57a838 benchmark.msgpack: adding msgpack benchmark. 2013-11-25 10:43:42 -08:00
John Benediktsson 4f42837273 benchmark.crc32: do more work in the crc32-benchmark. 2013-04-19 11:35:47 -07:00
John Benediktsson 5980d660bc benchmark.sum-file: simpler, more idiomatic, faster. 2013-04-08 07:17:37 -07:00
John Benediktsson 0431acf97e benchmark.pidigits: simplify handling of arrays. 2013-04-07 15:33:54 -07:00
John Benediktsson ed95bcc8b9 benchmark.reverse-complement: more idiomatic, faster. 2013-04-07 15:19:58 -07:00
John Benediktsson 812c3e4cdf benchmark.bloom-filters: more iterations now bloom-filters are faster. 2013-04-04 07:10:30 -07:00
John Benediktsson d47a306557 benchmark.bloom-filters: adding a benchmark for bloom filters. 2013-04-03 15:10:52 -07:00
John Benediktsson 23c154c06f benchmark.splitting: stop using split* and use slices only. 2013-04-01 10:26:43 -07:00
John Benediktsson 47a5619bb4 benchmark.parse-ratio: adding a ratio parse benchmark. 2013-03-28 14:31:45 -07:00
John Benediktsson ff39d3f53a benchmark.parse-float: add a float parse benchmark. 2013-03-28 11:41:57 -07:00
John Benediktsson c403857f0d benchmark.parse-bignum: adding a bignum parse benchmark. 2013-03-28 06:24:25 -07:00
John Benediktsson 6a4a7796ed benchmark.parse-fixnum: adding a fixnum parse benchmark. 2013-03-28 06:24:15 -07:00
John Benediktsson 9341a660a2 benchmark.splitting: adding a splitting benchmark. 2013-03-27 16:12:08 -07:00
John Benediktsson e6d4b9054e benchmark.hash-sets: do more benching (create sets in a literal).
Don't run the "intersects?" test on old hash-sets, they are sloooooow.
2013-03-26 17:42:41 -07:00
John Benediktsson fa534d2507 benchmark.fib8: adding super-fast fibonacci benchmark. 2013-03-26 11:48:01 -07:00
John Benediktsson 6f5efb83f2 benchmark.fib7: adding matrix fibonacci benchmark. 2013-03-26 11:47:52 -07:00
Doug Coleman 582e1cd3b7 benchmark.raytracer-simd: Fix usage of old \ word in parsing word. 2013-03-23 20:00:09 -07:00
John Benediktsson c46b69f329 benchmark.ant: use ?adjoin. 2013-03-23 17:47:07 -07:00
Doug Coleman 929f0df1cc benchmark.knucleotide: Fix usage of <clumps>. 2013-03-23 13:27:13 -07:00
Doug Coleman a55a367bf3 benchmark.reverse-complement: Fix usage of <groups>. 2013-03-23 13:04:03 -07:00
Doug Coleman f9ea61bf91 basis/extra: Update last usages of <sliced-groups> to <groups>. 2013-03-23 12:08:18 -07:00
John Benediktsson d25c144d5c benchmark.lcs: adding lcs benchmark. 2013-03-21 18:07:28 -07:00
John Benediktsson b981973938 benchmark.sort: slow down sorting to test sorting alists. 2013-03-20 17:11:54 -07:00
John Benediktsson e74f770b57 Use bl in more places. 2013-03-14 19:24:00 -07:00
John Benediktsson b015af4f33 benchmark.ant: fix hash-set constructor. 2013-03-08 06:15:37 -08:00
John Benediktsson 30cbce3f41 benchmark.linked-assocs: adding a linked-assocs benchmark. 2013-03-07 09:58:16 -08:00
John Benediktsson 53992695e4 benchmark.randomize: adding a randomize benchmark. 2013-03-05 17:04:57 -08:00
John Benediktsson 5262c8a1ae benchmark.timers: adding a timer benchmark. 2013-02-19 15:39:50 -08:00
John Benediktsson 22f8d09220 benchmark.udp-echo0: "over over" is just "2dup". 2012-10-23 12:16:12 -07:00
John Benediktsson 2643ecc646 benchmark.unicode: add benchmark for unicode case conversions. 2012-09-19 10:33:51 -07:00
John Benediktsson 8b49518349 benchmark.flip: adding a benchmark for the "flip" word. 2012-09-18 18:40:17 -07:00
John Benediktsson a206daacde benchmark.continuations: more continuations. 2012-09-14 14:59:17 -07:00
John Benediktsson e94857db50 benchmark.sort: make the numbers-to-sort at parse time... 2012-09-06 07:54:29 -07:00
John Benediktsson ffab88d5e9 benchmark.random: no need to write the file.
Also, add random-unit and random-32 to benchmark.
2012-09-06 07:53:41 -07:00
John Benediktsson ebbfa70e87 benchmark.sort: changing to not depend on benchmark.random. 2012-09-05 21:03:52 -07:00
John Benediktsson 4382851e13 benchmark.find-pi: adding the bignum ratio find-pi benchmark. 2012-08-04 10:06:40 -07:00
John Benediktsson a4a62524b3 benchmark.wrap: adding a wrap benchmark. 2012-08-03 09:37:01 -07:00
John Benediktsson a61ea18ad7 benchmark.yield: testing lots of yields. 2012-08-01 10:51:37 -07:00
John Benediktsson 832e3bc53e benchmark.dispatch4: split into two benchmarks. 2012-07-27 15:50:12 -07:00
John Benediktsson 2d5a141ef5 benchmark.sum-file: removing dependency on random. 2012-07-27 15:44:38 -07:00
John Benediktsson 8d08230f44 benchmark: assert some results. 2012-07-19 19:10:09 -07:00
John Benediktsson 2e86fd6af0 benchmark: rename main methods to be consistent. 2012-07-19 17:36:42 -07:00
John Benediktsson 559b5bfa5b using the new H{ } make. 2012-07-19 09:50:09 -07:00
John Benediktsson e8c13ebe40 benchmark.fib: give each benchmark a unique main method name. 2012-07-19 08:18:18 -07:00
John Benediktsson 126fbd45a7 benchmark.regexp: simple regexp matching benchmark. 2012-07-17 20:35:39 -07:00
John Benediktsson 667a00a69c benchmark.memoize: add zero arg memoized function. 2012-07-17 17:49:09 -07:00
John Benediktsson 72de9badda benchmark.memoize: adding a benchmark for memoization. 2012-07-17 16:02:00 -07:00
John Benediktsson af4d839a23 benchmark.csv: adding a benchmark for csv. 2012-07-13 22:20:34 -07:00
John Benediktsson e8024370f7 benchmark.binary-search: remove print in favor of assert. 2012-07-13 16:11:01 -07:00
John Benediktsson 8b6e3eab62 benchmark.dlists: adding a dlist benchmark. 2012-07-13 15:15:26 -07:00
John Benediktsson 3928e5cb26 benchmark.json: adding a json benchmark. 2012-07-11 18:43:22 -07:00
John Benediktsson 03cd8c288d benchmark.completion: adding a benchmark of tools.completion. 2012-06-19 14:09:38 -07:00
John Benediktsson 3c775f7bea benchmark.busy-loop: make sure fixnum math on 32-bit. 2012-06-01 16:26:46 -07:00
John Benediktsson 53b77247f0 benchmark.busy-loop: adding a busy-loop "control" benchmark. 2012-06-01 16:18:29 -07:00
John Benediktsson fc50417e43 benchmark.combinatorics: adding a combinatorics benchmark. 2012-04-24 17:29:26 -07:00
John Benediktsson 60b83c7241 benchmark.make: use % (push-all). 2012-04-20 10:51:51 -07:00
John Benediktsson 7f7cb5cdf9 benchmark.make: adding a simple make benchmark. 2012-04-20 10:41:50 -07:00
John Benediktsson 8c1165cac1 cleanup some lint warnings. 2012-04-18 17:46:01 -07:00
John Benediktsson 0c16b7cc1a benchmark.hash-sets: adding a benchmark for hash-sets. 2012-04-16 10:57:57 -07:00
Joe Groff 9c989b6774 benchmark.regex-dna: reduce IO deploy level again 2011-11-28 18:55:48 -08:00
Joe Groff 943596575a use radix literals 2011-11-23 19:03:40 -08:00
Doug Coleman cb119568d3 benchmark: remove debug code 2011-11-21 21:54:09 -08:00
Doug Coleman 857fc50fff benchmark: Add a way to run a profile for each benchmark vocabulary. 2011-11-21 13:42:49 -08:00
Doug Coleman 1d84f5e190 benchmark.udp-echo0: Fix the memory leak. 2011-11-11 17:58:45 -08:00
John Benediktsson 0816b8667c benchmark.splay: fix IN:. 2011-10-19 09:42:12 -07:00
Doug Coleman 1f105209cf Lower tcp-echo0 test so we don't crash 2011-10-19 01:17:08 -07:00
Joe Groff 13b17fb84a io: input-stream and output-stream mixins 2011-10-18 16:25:09 -07:00
John Benediktsson b237df3a3b Remove unused stack effects from DEFER: declarations. 2011-10-18 14:42:17 -07:00
John Benediktsson d947553df8 benchmarks: tcp/udp should take less time for now (until it gets sped up). 2011-10-17 17:47:28 -07:00
Doug Coleman 7ffd51c485 A little ambitious on the tcp-echo2 benchmark. Reduce 20mil to 20k 2011-10-17 16:47:21 -07:00
Doug Coleman 5836634922 Rename echo benchmark to udp-echo. Rename file-server benchmark to tcp-echo. Add more benchmarks for different loads. 2011-10-17 10:25:28 -07:00
John Benediktsson d773d99de5 benchmark.splay: adding a splay-tree benchmark. 2011-10-14 18:10:49 -07:00
Doug Coleman 4cbbfe82aa benchmark.file-server hit the array-capacity limit, so lower the #bytes sent by one and add a #times parameter 2011-10-12 10:23:16 -07:00
Doug Coleman 1783b3b72e Rename benchmarks -> benchmark 2011-10-12 03:28:25 -07:00
John Benediktsson 8579a71efa benchmark.ant: switching to tuples now that they are fast. 2011-10-02 15:30:25 -07:00
John Benediktsson 4f42c72012 specialized-arrays: performed some cleanup.
Specifically,
    •   Created >c-array to be replacement for >T-array.
    •   Created cast-array to be generic replacement for all T-array-cast words.
    •   Created c-array@ to be generic replacement for T-array@ words.
    •   Replaced usages of <T-array> with T <c-array>
    •   Replaced usages of <direct-T-array> with T <c-direct-array>
    •   Replaced usages of >T-array with T >c-array
    •   Replaced usages of T-array-cast with T cast-array
    •   Replaced usages of malloc-T-array with T malloc-array.
    •   Removed malloc-T-array.
    •   Removed T-array-cast.
    •   Removed T-array@.
    •   Removed >T-array.

I also added (but didn't change any code to use):
    •   T c-array-type, returns T-array
    •   T c-array?, returns T-array?
    •   c-array{ T ... }, returns T-array{ ... }

Bootstraps just find on Mac OS X.  Also `load-all test-all` works for me.
2011-09-26 11:37:51 -07:00
John Benediktsson 5cf0652db4 benchmark.ant: needed a MAIN. 2011-09-25 19:08:56 -07:00
John Benediktsson c7e3238149 benchmark.ant: fix vocab name and using. 2011-09-25 15:33:49 -07:00
John Benediktsson 6f72e5a638 benchmark.ant: adding the "ant puzzle" benchmark. See #153. 2011-09-25 12:25:52 -07:00
Joe Groff 2bd6de9a02 slots: pre-create the "at", "nth", and "global" slots to make deterministic the currently nondeterministic ambiguity between accessors:change-* and assocs:change-at, sequences:change-nth, and namespaces:change-global 2011-09-19 10:03:43 -07:00
Doug Coleman f19d8cfd99 Windows doesn't like 0 f <inet4>. See issue #85. 2011-09-08 15:49:08 -07:00
John Benediktsson 7df5968db2 benchmark.pidigits: no need to USE sets. 2011-09-03 16:30:31 -07:00
John Benediktsson 56f6dacd93 benchmark.echo: Update copyright. 2011-08-26 18:02:22 -07:00
John Benediktsson daaaed7e2b Adding a UDP echo benchmark. 2011-08-26 17:18:08 -07:00
John Benediktsson d58bc08aa0 Update code that did ">alist sort-" to just "sort-". 2011-04-07 09:01:21 -07:00
Slava Pestov 36785f4625 benchmark.ui-panes: clean up 2010-10-23 17:15:23 -07:00
Slava Pestov 76344f6bc2 benchmark.ui-panes: deploy without prettyprinter 2010-10-23 17:09:26 -07:00
Slava Pestov a400b39fa1 alien.enums: enum>number didn't work in deployed images, add a test which deploys and runs benchmark.ui-panes to catch this in the future 2010-10-17 21:02:42 -04:00
Slava Pestov 590586e551 benchmark.sockets: yield between spawning clients so we don't backlog requests (we call accept with a limit of 128) 2010-09-11 18:43:47 -07:00
Slava Pestov d43802bea2 benchmark.sockets: fix race by using promises instead of super-dodgy random calls to yield 2010-09-08 20:54:30 -07:00
Slava Pestov 7d4b64e361 rename benchmark.struct to tools.time.struct since it is not a benchmark 2010-08-11 21:51:19 -07:00
Doug Coleman 6d63be4168 Check in benchmark.struct vocab 2010-06-10 15:37:53 -05:00
Slava Pestov d8ce35aacc benchmark.spectral-norm-simd: SIMD implementation of spectral-norm algorithm using SIMD primitives, about 40% faster but takes ages to compile -- good compile-time benchmark 2010-05-30 20:11:34 -04:00