Sun, 23 Nov 2025 13:15:19 +0100
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.
<?xml version="1.0" encoding="UTF-8"?> <!DOCTYPE buildprofiles SYSTEM "https://resources.jetbrains.com/writerside/1.0/build-profiles.dtd"> <buildprofiles xsi:noNamespaceSchemaLocation="https://resources.jetbrains.com/writerside/1.0/build-profiles.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <variables> <download-title>Download Latest</download-title> <download-page>https://sourceforge.net/projects/ucx/files/latest/download</download-page> <showDownloadButton>true</showDownloadButton> <custom-css>ucx.css</custom-css> <custom-favicons>uap.png</custom-favicons> <primary-color>deep-ocean</primary-color> </variables> <build-profile instance="ucx"> <variables> <offline-docs>true</offline-docs> <noindex-content>true</noindex-content> </variables> </build-profile> <footer> <copyright>2025 Mike Becker, Olaf Wintermann. All rights reserved.</copyright> <link href="https://sourceforge.net/projects/ucx/">Source Forge</link> <link href="https://uap-core.de/">UAP Core</link> <link href="https://unixwork.de/">UNIXwork</link> </footer> </buildprofiles>