prototypes for create and destroy functions

add allocator and root node pointer to tree structure

allow find() member function to start in an arbitrary subtree

provide a default tree node layout, but do not make it mandatory

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

add cx_array_binary_search() - fixes #424

add low level cx_array_insert_sorted() and convenience macros

add missing documentation for cx_list_default_swap() return value

add optimized implementation of insert_sorted for array lists

fix cx_ll_insert_sorted_cmp_func not being thread local

implement optimized sorted insert for linked lists - resolves #415

fix typo in documentation

optimize default insert_sorted implementation

add stupid default implementation for high level insertion sort

add default impl for some list member functions

fix inserting via iterator correctly increases element count

close feature branch feature/tree_add

merge feature/tree_add branch

rework cx_tree_add() API to allow insertion of edge nodes feature/tree_add

remove condition that is always false after recent fix feature/tree_add

fix cx_tree_search() not remembering root as a valid candidate feature/tree_add

(0) -300 -100 -50 -30 +30 +50 tip

mercurial