mirror/guile
mirror/guile
1
Fork 0
mirror of https://git.savannah.gnu.org/git/guile.git synced 2025-05-17 03:00:21 +02:00
Code Activity

Fixes in comments

Browse source
This commit is contained in:
Mikael Djurfeldt 1999-08-20 00:19:01 +00:00
parent 1cfda2d332
commit 15d9c4e306
1 changed files with 6 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

9
libguile/sort.c
View file

@ -42,11 +42,11 @@
* This implements the same sort interface as slib/sort.scm * This implements the same sort interface as slib/sort.scm
* for lists and vectors where slib defines: * for lists and vectors where slib defines:
* sorted?, merge, merge!, sort, sort! * sorted?, merge, merge!, sort, sort!
* For scsh compatibility are also sort-list and sort-list! defined. * For scsh compatibility sort-list and sort-list! are also defined.
* In cases where a stable-sort is required use stable-sort or * In cases where a stable-sort is required use stable-sort or
* stable-sort!. As additional feature is * stable-sort!. An additional feature is
* (restricted-vector-sort! vector less? startpos endpos) * (restricted-vector-sort! vector less? startpos endpos)
* added, where startpos and endpos allows you to sort part of a vector. * which allows you to sort part of a vector.
* Thanks to Aubrey Jaffer for the slib/sort.scm library. * Thanks to Aubrey Jaffer for the slib/sort.scm library.
* Thanks to Richard A. O'Keefe (based on Prolog code by D.H.D.Warren) * Thanks to Richard A. O'Keefe (based on Prolog code by D.H.D.Warren)
* for the merge sort inspiration. * for the merge sort inspiration.
@ -92,6 +92,9 @@ char *alloca ();
The reason to do this instead of using the library function qsort The reason to do this instead of using the library function qsort
was to avoid dependency of the ANSI-C extensions for local functions was to avoid dependency of the ANSI-C extensions for local functions
and also to avoid obscure pool based solutions. and also to avoid obscure pool based solutions.
This sorting routine is not much more efficient than the stable
version but doesn't consume extra memory.
*/ */
/* Byte-wise swap two items of size SIZE. */ /* Byte-wise swap two items of size SIZE. */