]> git.eshelyaron.com Git - emacs.git/commit
Replace list and vector sorting with TIMSORT algorithm
authorAndrew G Cohen <cohen@andy.bu.edu>
Thu, 10 Mar 2022 01:30:00 +0000 (09:30 +0800)
committerAndrew G Cohen <cohen@andy.bu.edu>
Fri, 11 Mar 2022 05:31:32 +0000 (13:31 +0800)
commite0470bcec76b94f93aed796abdcab14e2086fffc
treee2720174a9fad037cfb9acc16ac0982f683ebf8f
parentdaf46703ce83cc652667e89aa50161a36e9a8575
Replace list and vector sorting with TIMSORT algorithm

* src/Makefile.in (base_obj): Add sort.o.
* src/deps.mk (fns.o): Add sort.c.
* src/lisp.h: Add prototypes for inorder, tim_sort.
* src/sort.c: New file providing tim_sort.
* src/fns.c:  Remove prototypes for removed routines.
(merge_vectors, sort_vector_inplace, sort_vector_copy): Remove.
(sort_list, sort_vector): Use tim_sort.
src/Makefile.in
src/deps.mk
src/fns.c
src/lisp.h
src/sort.c [new file with mode: 0644]