1 2008-02-09 Brian Gough <bjg@network-theory.co.uk>
3 * test_source.c: prevent signed overflow in tests
5 2005-08-31 Brian Gough <bjg@network-theory.co.uk>
7 * test_source.c: free index memory as well
9 2005-04-08 Brian Gough <bjg@network-theory.co.uk>
11 * sortvecind_source.c sortvec_source.c: write tests in such a way
12 as to avoid an infinite loop if nan, by always comparing in the
13 same direction (note that nan < x and nan > x are both false)
15 Tue Jun 26 12:06:58 2001 Brian Gough <bjg@network-theory.co.uk>
17 * subset_source. subsetind_source.c: make prototypes match header
20 Sun Jan 21 18:36:04 2001 Brian Gough <bjg@network-theory.co.uk>
22 * subset.c, subsetind.c: added functions for selecting subsets
23 (k-th smallest or largest values)
25 Mon Mar 13 13:57:33 2000 Brian Gough <bjg@network-theory.co.uk>
27 * sortind.c (gsl_heapsort_index): changed to use an array of
28 size_t's directly instead of gsl_permutation
30 Mon Feb 28 20:30:06 2000 Brian Gough <bjg@network-theory.co.uk>
32 * renamed gsl_sort to gsl_heapsort, since this is more meaningful
33 and gsl_sort, gsl_sort_float, ... is now used for sorting of
36 * added support for sorting of arrays, without going through a
37 gsl_vector object (gsl_sort_vector is now implemented in terms of
40 Sat Feb 26 14:47:36 2000 Brian Gough <bjg@network-theory.co.uk>
42 * added support for indirect sorting of objects
44 * fixed bug in indirect sorting from use of BASE type instead of
47 * reorganized directory
49 Fri Feb 25 19:30:08 2000 Brian Gough <bjg@network-theory.co.uk>
51 * sortind_source.c: changed return type of indirect sort to int,
52 to allow error return code in case where permutation and vector
55 Sat Feb 19 12:18:28 2000 Brian Gough <bjg@network-theory.co.uk>
57 * sortind_source.c: added indirect sorting
59 Fri Feb 18 10:48:24 2000 Brian Gough <bjg@network-theory.co.uk>
61 * initial GPL sources from Thomas Walter
62 <walter@pctc.chemie.uni-erlangen.de>