5 commits

Author	SHA1	Message	Date
Leonardo de Moura	7195244b04	feat(library/init/data/array/qsort): ensure qsort terminates even for bad lt relations	2019-08-10 22:10:14 -07:00
Sebastian Ullrich	3ed67138d5	chore(*): update equation syntax in files and old parser ... for f in ../../**/*.lean; do echo $f; ./patch.lean.out $f > tmp && cat tmp > $f; done	2019-08-09 11:11:34 +02:00
Leonardo de Moura	ab487ea4ac	feat(frontends/lean): allow ; instead of in in let-decls	2019-06-27 17:12:03 -07:00
Leonardo de Moura	dc71fafac1	feat(library/init/data/array): add Array.binSearch	2019-05-14 18:25:54 -07:00
Leonardo de Moura	2e4f5951e3	feat(library/init/data/array/qsort): simple quicksort ... @kha I added `qsort` for sorting environment extension entries, but I am wondering if we could use it as a benchmark in our paper. It is a pure implementation; it is fast; it implements the real quick sort algorithm with in-place updates if the input array is not shared. If the array is shared it performs a single copy and then switches to in-place updates.	2019-05-14 17:46:34 -07:00