diff options
author | Kaz Kylheku <kaz@kylheku.com> | 2023-05-02 19:25:40 -0700 |
---|---|---|
committer | Kaz Kylheku <kaz@kylheku.com> | 2023-05-02 19:25:40 -0700 |
commit | f6cb6a21745822874789a33e150ef7ddbbf58979 (patch) | |
tree | 3a8e1898c3c56d7ba0108375138332791c4befd0 /lib.c | |
parent | 541b0e0c5f485b7b9cd724a303891a3d85fd95c9 (diff) | |
download | txr-f6cb6a21745822874789a33e150ef7ddbbf58979.tar.gz txr-f6cb6a21745822874789a33e150ef7ddbbf58979.tar.bz2 txr-f6cb6a21745822874789a33e150ef7ddbbf58979.zip |
sort: correct name in error reporting.
* lib.c (sort_vec): Take self argument instead of assuming
that we are sort; this can be called by nsort.
(nsort, sort): Pass self to sort_vec.
Diffstat (limited to 'lib.c')
-rw-r--r-- | lib.c | 7 |
1 files changed, 3 insertions, 4 deletions
@@ -10868,9 +10868,8 @@ static void quicksort(val vec, val lessfun, val keyfun, cnum from, cnum to) } } -static void sort_vec(val vec, val lessfun, val keyfun) +static void sort_vec(val vec, val lessfun, val keyfun, val self) { - val self = lit("sort"); cnum len = c_fixnum(length(vec), self); quicksort(vec, lessfun, keyfun, 0, len); } @@ -10888,7 +10887,7 @@ val nsort(val seq, val lessfun, val keyfun) return nil; case SEQ_VECLIKE: case SEQ_HASHLIKE: - sort_vec(seq, lessfun, keyfun); + sort_vec(seq, lessfun, keyfun, self); return seq; case SEQ_LISTLIKE: return sort_list(seq, lessfun, keyfun); @@ -10914,7 +10913,7 @@ val sort(val seq, val lessfun, val keyfun) case SEQ_VECLIKE: case SEQ_HASHLIKE: seq = copy(seq); - sort_vec(seq, lessfun, keyfun); + sort_vec(seq, lessfun, keyfun, self); return seq; case SEQ_LISTLIKE: return sort_list(copy_list(seq), lessfun, keyfun); |