ucx: make/test_memrchr.c@dfc0ddd9571e (annotated)

make/test_memrchr.c@dfc0ddd9571e (annotated)

make/test_memrchr.c

Sun, 23 Nov 2025 13:15:19 +0100

author: Mike Becker <universe@uap-core.de>
date: Sun, 23 Nov 2025 13:15:19 +0100
changeset 1508: dfc0ddd9571e
parent 1413: c5a225d7228c
permissions: -rw-r--r--

optimize sorted insertion by using the infimum instead of the supremum

The reason is that the supremum returns the equal element with the smallest index, and we want the largest.
Therefore, we use the infimum, which already gives us the largest index when there are equal elements, and increase the index by one. The infimum is also guaranteed to exist in that case.

 #include <string.h>
 int main() {
     const char *r = memrchr("tester", 'e', 6);
     return !(r != NULL);
 }