Search Results for "find"

Use own (user) data section for each Linked-List-Element (LLEl) including a fix Identifier which is for search via basic Lnkdlst function (fast ID-part-search, e.g. to find all elements with a specific bit in the ID set). Main list-linkage-change functions: append, insert, delete. - Examples: use of flexible variable ArgList (OnePointerArg, optional valid if not NULL, Argument-Type by ID-Number is easy to get), key-value pairs, build FIFO{queue}/LIFO{stack}, auto-list with max. Element-Size and chronological order. ...

...Its goal is to make state machine declaration and use easy enough that it can be integrated into your projects painlessly. Have a look atp the wiki where you will find a tutorial, samples, and a cheatsheet to get accustomed with instantFSM. The only instantFSM header file is downloadable from the files section or you can check it out from the git repository.

Easy To Use Collection Classes For C And C++ The Memory Structures Library (MemSL) has implementations of structures (i.e. AVL trees, threaded trees, dynamic hashing, ...) that are extremely hard to find and far harder to implement.