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

cx_tree_add_iter() - optimize check for empty trees feature/tree_add

cx_tree_add() fix missing spec for adding duplicates feature/tree_add

complete cx_tree_add() implementations feature/tree_add

fix return type of cx_tree_node_create_func feature/tree_add

complete specification for tree_add functions feature/tree_add

merge changes from default branch feature/tree_add

change cx_tree_link() from prepending to appending children - fixes #391

fix mixed up arguments for calloc()

add prototypes for cx_tree_add() family of functions feature/tree_add

minor doc fixes

add cxIteratorRef() macro

add missing convenience functions

fix name of collection base member (to avoid base.base)

fix inconsistent use of item_size and elem_size

fix members inherited by macro or include are not documented

simplify iterator structures

fix documentation

issue #389 : add separate function for immutable arrays

add iterator over raw C arrays - closes #389

improves interface of cx_sprintf() variants

implement tree continue - fixes #376

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

mercurial