fix uninitialized simple_destructor - fixes #443

implement cxTreeRemove() with re-link function

rename cxTreeRemove() to cxTreeRemoveSubtree()

fix bug when removing the root node of a tree

add test for simple destructor in trees - fixes #436

complete implementation of remaining high level tree functions

implement cxTreeInsert family of functions

add cxTreeSubtreeDepth()

implement cxTreeCreate family of functions

add functions to link/unlink nodes manually

downgrade the attention block regarding the auto-register of a simple destructor to a note

more prototypes for tree functions

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

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

mercurial