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
..
compiler	feat(library/init/data/array/basic): add Array.extract	2019-04-07 13:08:23 -07:00
ir	chore(tests): port tests, fix at least compiler tests	2019-03-21 15:11:05 -07:00
lean	chore(library/init/control/id): rename id monad to Id	2019-03-29 16:45:52 -07:00
playground	test(tests/playground/parser/parser): "liftable" longestMatch	2019-04-24 11:23:06 -07:00