Changeset: 6f109785f898 for MonetDB URL: http://dev.monetdb.org/hg/MonetDB?cmd=changeset;node=6f109785f898 Modified Files: gdk/gdk_ssort.c gdk/gdk_ssort_impl.h Branch: default Log Message:
Fix up comments. diffs (39 lines): diff --git a/gdk/gdk_ssort.c b/gdk/gdk_ssort.c --- a/gdk/gdk_ssort.c +++ b/gdk/gdk_ssort.c @@ -17,13 +17,6 @@ * All Rights Reserved. */ -/* - * @a Sjoerd Mullender - * @* Ssort - * This file implements a stable sort algorithm. The algorithm is a - * straight copy of the listsort function in the Python 2.5 source code, - * heavily modified to fit into the MonetDB environment. - */ #include "monetdb_config.h" #include "gdk.h" #include "gdk_private.h" diff --git a/gdk/gdk_ssort_impl.h b/gdk/gdk_ssort_impl.h --- a/gdk/gdk_ssort_impl.h +++ b/gdk/gdk_ssort_impl.h @@ -19,7 +19,17 @@ /* This file is included multiple times. We expect a bunch of tokens * to be redefined differently each time (see gdk_ssort.c). If the - * token GDKssortimpl is defined, the main interface is defined. */ + * token GDKssortimpl is defined, the main interface is defined. + */ + +/* + * This file implements a stable sort algorithm known as "timsort". + * The algorithm is a straight copy of the listsort function in the + * Python 2.5 source code, heavily modified to fit into the MonetDB + * environment. + * The original author of the sort algorithm was Tim Peters, the + * adaptation was done by Sjoerd Mullender. + */ /* binarysort is the best method for sorting small arrays: it does few * compares, but can do data movement quadratic in the number of _______________________________________________ Checkin-list mailing list Checkin-list@monetdb.org http://mail.monetdb.org/mailman/listinfo/checkin-list
