Lnkdlst
Single sided linked list (kind of lib with test-code, C, C++ and java)
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.
Use malloc{slower-but-easy} or fix (static) memory.
-
OAList01: Object-Kind of a predefined pre-reserved List with X Elements (with constant user-data size), with secur modify functions and option to use locks (POSIX: mutex). Supporting a BusyList and a IdleList for easy build of e.g. a FIFO without need of much time for mem-allocation.
-
Release-Notes see uws-Lnkdlst-readme.txt in the tar.gz file(s) and in „Files“.