lean4-htt/tests/playground
Leonardo de Moura 014c7e3374 test(tests/playground/parser/parser): "liftable" longestMatch
For lists of size 0, 1 and 2, it avoids the overhead of creating
temporary lists of closures. I measure the overhead with `test1.lean`
and there is no overhead in this case.
`test1.lean` has a test for length = 4, and the overhead is 7%.
We only use longestMatch to implement the Pratt Parser.
The lists should be small. So, the overhead is acceptable.
If it is not. We can add back the `longestMatch` specific for `TermParser`.

cc @kha
2019-04-24 11:23:06 -07:00
..
parser test(tests/playground/parser/parser): "liftable" longestMatch 2019-04-24 11:23:06 -07:00
.gitignore test(tests/playground): rbmap example 2019-02-19 19:01:51 -08:00
arith_eval.ml test(tests/playground): add new example in Lean and OCaml 2019-02-14 15:50:07 -08:00
arith_eval_nat.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
arith_eval_uint32.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
bad_bench test(tests/playground/Makefile): bench fallback, all Lean tests 2019-03-05 15:44:03 +01:00
binarytrees.ghc-6.hs test(tests/playground): binarytrees benchmarks game benchmark in Lean, OCaml & Haskell 2019-02-25 23:46:10 +01:00
binarytrees.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
binarytrees.ocaml-2.ml test(tests/playground): binarytrees benchmarks game benchmark in Lean, OCaml & Haskell 2019-02-25 23:46:10 +01:00
compile.sh chore(tests): compile tests using -O3 again 2019-03-18 17:55:28 +01:00
deriv.hs test(tests/playground/deriv): Haskell version 2019-02-28 14:57:57 +01:00
deriv.lean chore(tests/playground/deriv): fix test 2019-04-17 18:12:08 -07:00
deriv.ml tests(tests/playground/deriv): deriv in OCaml 2019-02-27 11:15:52 -08:00
environment_extension.lean feat(tests/playground/environment_extension): scoped extensions in Lean 2019-03-25 17:35:01 +01:00
expander.lean test(tests/playground/expander): add Leo's direct transformation 2019-04-03 11:27:06 +02:00
expr_const_folding.hs test(tests/playground/expr_const_folding): Haskell version 2019-02-18 14:59:33 +01:00
expr_const_folding.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
expr_const_folding.ml tests(tests/playground/expr_const_folding): another example for the paper 2019-02-15 12:07:52 -08:00
expr_const_folding.swift test(tests/playground/expr_const_folding): add Swift translation 2019-02-19 11:24:10 +01:00
filemap.lean test(tests/playground/filemap): FileMap 2019-04-02 17:23:13 -07:00
fix.lean chore(library/init/io): we don't need fix anymore 2019-03-27 12:59:43 -07:00
fix1.lean chore(library/init,runtime,library/compiler): add fix primitive back 2019-03-27 17:13:53 -07:00
flat_parser.lean test(tests/playground/parser): add leanWhitespace parser 2019-03-30 12:48:18 -07:00
flat_parser2.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
gen.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
hash.lean refactor(library/init/data/hashmap): use AssocList and HasBeq 2019-04-03 05:55:08 -07:00
lazylist.lean test(tests/playground/lazylist): LazyList 2019-04-02 17:26:29 -07:00
leanpkg.path chore(tests/playground): add helper files 2019-02-15 18:13:37 -08:00
lowtech_expander.lean test(tests/playground/lowtech_expander): remove dead code 2019-04-01 15:45:13 -07:00
Makefile test(tests/playground/Makefile): re-add original ocamlopt parameters 2019-03-05 15:44:42 +01:00
map_perf.lean chore(library/init): fold functions argument order consistency 2019-04-03 07:42:14 -07:00
mapVShmap.lean test(tests/playground/mapVShmap): use {x with ...} notation in the test 2019-04-22 13:42:53 -07:00
opts.lean feat(library/compiler): special support for initialization functions of the form def initFn : IO Unit 2019-03-23 08:46:38 -07:00
partial_eq_lemma.lean test(tests/playground/partial_eq_lemma): partial equation lemmas 2019-03-26 18:06:04 -07:00
perf.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
rbmap.cpp chore(tests/playground/rbmap): use +1 instead of +k to avoid big number arithmetic when we increase number of elements inserted 2019-02-24 08:49:38 -08:00
rbmap.hs test(tests/playground): rbmap.hs, Makefile 2019-02-26 20:26:55 +01:00
rbmap.lean chore(tests/playground): fix playground tests 2019-03-21 18:30:58 -07:00
rbmap.library.lean chore(library/init): fold functions argument order consistency 2019-04-03 07:42:14 -07:00
rbmap.ml test(tests/playground/rbmap.ml): take the same input as Lean version 2019-02-25 14:51:16 +01:00
rbmap2.lean chore(tests/playground): fix playground tests 2019-03-21 18:30:58 -07:00
rbmap3.cpp test(tests/playground): manually optimized rbmap3 2019-02-20 11:00:54 -08:00
rbmap3.lean chore(tests/playground): fix playground tests 2019-03-21 18:30:58 -07:00
ref1.lean chore(tests/playground): fix playground tests 2019-03-21 18:30:58 -07:00
ref2.lean chore(tests/playground): fix playground tests 2019-03-21 18:30:58 -07:00
run.sh test(tests/playground/run.sh): fix 2019-03-05 15:37:11 +01:00
split.lean feat(library/init/data/string/basic): add String.split 2019-03-22 17:26:43 -07:00
task_test.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
task_test2.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
task_test3.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
task_test4.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
tst.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
uf1.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
uf1_new.lean chore(tests): port tests, fix at least compiler tests 2019-03-21 15:11:05 -07:00
unionfind1.lean chore(tests/playground): fix tests 2019-04-18 17:29:49 -07:00
unionfind2.lean chore(tests/playground): fix tests 2019-04-18 17:29:49 -07:00
view_expander.lean test(tests/playground): expander performance tests 2019-04-01 17:23:14 +02:00