changelog
- Thu, 27 Nov 2025 21:39:20 +0100
- by Mike Becker <universe@uap-core.de> [Thu, 27 Nov 2025 21:39:20 +0100] rev 1517
- add test case for cxBufferPop()
- Wed, 26 Nov 2025 23:35:25 +0100
- by Mike Becker <universe@uap-core.de> [Wed, 26 Nov 2025 23:35:25 +0100] rev 1516
- fixes that cxBufferWrite() could auto-extend the buffer beyond the configured threshold
- Wed, 26 Nov 2025 23:22:03 +0100
- by Mike Becker <universe@uap-core.de> [Wed, 26 Nov 2025 23:22:03 +0100] rev 1515
- add cxBufferReserve()
- Wed, 26 Nov 2025 23:06:12 +0100
- by Mike Becker <universe@uap-core.de> [Wed, 26 Nov 2025 23:06:12 +0100] rev 1514
- add cxBufferPop()
- Tue, 25 Nov 2025 20:35:27 +0100
- by Mike Becker <universe@uap-core.de> [Tue, 25 Nov 2025 20:35:27 +0100] rev 1513
- implement better strings for json.c + complete test coverage
- Mon, 24 Nov 2025 22:39:18 +0100
- by Mike Becker <universe@uap-core.de> [Mon, 24 Nov 2025 22:39:18 +0100] rev 1512
- add the note to the docstrings that tree iterator/visitor counter include the currently visited node
- Mon, 24 Nov 2025 22:38:50 +0100
- by Mike Becker <universe@uap-core.de> [Mon, 24 Nov 2025 22:38:50 +0100] rev 1511
- complete test coverage for tree.c
- Mon, 24 Nov 2025 22:15:16 +0100
- by Mike Becker <universe@uap-core.de> [Mon, 24 Nov 2025 22:15:16 +0100] rev 1510
- adjust test_hash_map_remove_via_iterator s.t. we achieve coverage for the case where we remove not the first element of a bucket
- Sun, 23 Nov 2025 13:30:07 +0100
- by Mike Becker <universe@uap-core.de> [Sun, 23 Nov 2025 13:30:07 +0100] rev 1509
- complete test coverage for array_list.c and delete unreachable code
- 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.
