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.
# Parsers UCX offers parsers for two common formats: key/value [properties](properties.h.md) and [JSON](json.h.md). Both parser APIs are implemented in a memory-efficient way. Depending on the use case, the properties parser can avoid memory allocations completely, and the JSON parser minimizes allocations as good as possible. Due to the nature of JSON, avoiding allocations altogether is, of course, not possible when operating on read-only memory.