Mercurial > hg > ucx / changelog

complete test coverage for tree.c

• 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

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

• 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

complete test coverage for array_list.c and delete unreachable code

• 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

optimize sorted insertion by using the infimum instead of the supremum

• 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.