mirror of
https://github.com/c3lang/c3c.git
synced 2026-02-27 12:01:16 +00:00
5e1c343be4
* add deprecations to macro slot builtins * refactor all stdlib uses of now-deprecated EMPTY_MACRO_SLOT; release notes * update incorrect releasenotes ref to this pr * remove leftover comments from refactoring * remove unnecessary `EmptySlot`-like type in countingsort; use private macro directly
92 lines
2.5 KiB
Plaintext
92 lines
2.5 KiB
Plaintext
module std::sort;
|
|
|
|
<*
|
|
Perform a binary search over the sorted array and return the index
|
|
in [0, array.len) where x would be inserted or cmp(i) is true and cmp(j) is true for j in [i, array.len).
|
|
|
|
@require @list_is_by_ref(list) : "Expected a list passed by reference or a slice"
|
|
@require @is_sortable(list) : "The list must be sortable"
|
|
@require @is_valid_cmp_fn(#cmp: ...cmp, #list: list, #context: ...context) : "Expected a comparison function which compares values"
|
|
@require @is_valid_context(...cmp, ...context) : "Expected a valid context"
|
|
*>
|
|
macro usz binarysearch(list, x, cmp = ..., context = ...) @builtin
|
|
{
|
|
usz i;
|
|
var $no_cmp = !$defined(cmp);
|
|
var $has_context = $defined(context);
|
|
|
|
$if $kindof(list) == SLICE:
|
|
usz len = lengthof(list);
|
|
for (usz j = len; i < j;)
|
|
{
|
|
usz half = i + (j - i) / 2;
|
|
$if $no_cmp:
|
|
switch
|
|
{
|
|
case greater(list[half], x): j = half;
|
|
case less(list[half], x): i = half + 1;
|
|
default: return half;
|
|
}
|
|
$else
|
|
|
|
$switch:
|
|
$case $defined(cmp(list[0], list[0], context)):
|
|
int res = cmp(list[half], x, context);
|
|
$case $defined(cmp(list[0], list[0])):
|
|
assert(!$has_context);
|
|
int res = cmp(list[half], x);
|
|
$case $defined(cmp(&list[0], &list[0], context)):
|
|
int res = cmp(&list[half], &x, context);
|
|
$case $defined(cmp(&list[0], &list[0])):
|
|
assert(!$has_context);
|
|
int res = cmp(&list[half], &x);
|
|
$default:
|
|
assert(false, "Invalid comparison function");
|
|
$endswitch
|
|
switch
|
|
{
|
|
case res > 0: j = half;
|
|
case res < 0: i = half + 1;
|
|
default: return half;
|
|
}
|
|
$endif
|
|
}
|
|
$else
|
|
usz len = lengthof(*list);
|
|
for (usz j = len; i < j;)
|
|
{
|
|
usz half = i + (j - i) / 2;
|
|
$if $no_cmp:
|
|
switch
|
|
{
|
|
case greater((*list)[half], x): j = half;
|
|
case less((*list)[half], x): i = half + 1;
|
|
default: return half;
|
|
}
|
|
$else
|
|
|
|
$switch:
|
|
$case $defined(cmp((*list)[0], (*list)[0], context)):
|
|
int res = cmp(list[half], x, context);
|
|
$case $defined(cmp((*list)[0], (*list)[0])):
|
|
assert(!$has_context);
|
|
int res = cmp((*list)[half], x);
|
|
$case $defined(cmp(&(*list)[0], &(*list)[0], context)):
|
|
int res = cmp(&(*list)[half], &x, context);
|
|
$case $defined(cmp(&(*list)[0], &(*list)[0])):
|
|
assert(!$has_context);
|
|
int res = cmp(&(*list)[half], &x);
|
|
$default:
|
|
assert(false, "Invalid comparison function");
|
|
$endswitch
|
|
switch
|
|
{
|
|
case res > 0: j = half;
|
|
case res < 0: i = half + 1;
|
|
default: return half;
|
|
}
|
|
$endif
|
|
}
|
|
$endif
|
|
return i;
|
|
} |