]> 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>
Sun, 3 Apr 2022 23:43:11 +0000 (07:43 +0800)
commit9ff2f0be32be621a0a1953cac2d552afebafe226
tree0be9c62c2e143e8dd00b14a090d73a4badd46eb2
parente091bee8db9926716a3e7778275901696896cbdf
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.
* test/src/fns-tests.el (fns-tests-sort): New sorting unit tests.
src/Makefile.in
src/deps.mk
src/fns.c
src/lisp.h
src/sort.c [new file with mode: 0644]
test/src/fns-tests.el