hare

The Hare programming language
git clone https://git.torresjrjr.com/hare.git
Log | Files | Refs | README | LICENSE

commit ff5eb03af2e71847d00e598d8bc016e117c02244
parent 24ba327413be2e1edd3d4174f1cf86fe16f90ce0
Author: Sebastian <sebastian@sebsite.pw>
Date:   Thu, 28 Apr 2022 17:34:28 -0400

Change all strings::strcmp references to compare

Signed-off-by: Sebastian <sebastian@sebsite.pw>

Diffstat:
Msort/search.ha | 2+-
Msort/sort.ha | 4++--
2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/sort/search.ha b/sort/search.ha @@ -26,7 +26,7 @@ export fn search( }; // Performs a binary search over a sorted slice of strings. Sorting is done with -// respect to Unicode codepoints; see [[strings::strcmp]]. The index of the +// respect to Unicode codepoints; see [[strings::compare]]. The index of the // matching item in the slice is returned if found, otherwise void is returned. export fn searchstrings(in: []const str, key: str) (size | void) = { match (search(in, size(str), &key, &scmp)) { diff --git a/sort/sort.ha b/sort/sort.ha @@ -17,7 +17,7 @@ export fn sort(items: []void, itemsz: size, cmp: *cmpfunc) void = { }; // Sorts a slice of strings in place. Sorting is done with respect to Unicode -// codepoints; see [[strings::strcmp]]. +// codepoints; see [[strings::compare]]. export fn strings(items: []str) void = sort(items, size(str), &scmp); // Checks if all of the items in a slice are sorted. @@ -31,7 +31,7 @@ export fn sorted(items: []void, itemsz: size, cmp: *cmpfunc) bool = { }; // Checks if all of the strings in a slice are sorted. Order is checked with -// respect to Unicode codepoints; see [[strings::strcmp]]. +// respect to Unicode codepoints; see [[strings::compare]]. export fn strings_sorted(items: []str) bool = sorted(items, size(str), &scmp); fn swap(a: *void, b: *void, sz: size) void = {