first draft of a class for high level trees

add bounding parameter to cx_tree_add_iter()

fix misleading documentation that could have indicated that an allocator is optional for lists

make all function attributes leading - fixes #425

move all const keywords to the west - fixes #426

apply binary search in cx_array_insert_sorted()

fix for empty arrays

fix documentation

also add a binary search for the supremum

fixes incorrect result from cx_array_binary_search() when searched element is smaller than the entire array

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

mercurial