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

optimize sorted insertion by using the infimum instead of the supremum

stable return value for binary search when there are duplicates in the array

fix that a particular tree test was never executed

fix that cxTreeVisitorDispose() does not set the queue pointers to NULL

add missing coverage exclusions for linked_list.c

add coverage exclusions for properties.c

increase test coverage for buffer.c

add fallback when sysconf() returns -1 when obtaining the page size

(0) -1000 -300 -100 -10 +10 tip

mercurial