changelog
- Sun, 23 Nov 2025 13:15:19 +0100
- by Mike Becker <universe@uap-core.de> [Sun, 23 Nov 2025 13:15:19 +0100] rev 1508
- 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.
- Sun, 23 Nov 2025 12:19:24 +0100
- by Mike Becker <universe@uap-core.de> [Sun, 23 Nov 2025 12:19:24 +0100] rev 1507
- stable return value for binary search when there are duplicates in the array
