New functions: add_tail, create_tail, get_tail, and concat. ABL is now a proper and effective queue as well as a list or stack. The functions foreach, findif, and deleteif were changed. They accept parameters for the testing function and can start acting from some arbitrary element, not just from the head of the list. Some efforts were made to make recursion on the list easier. The function findif has a side effect: it moves the pointer to the found element. There are more examples in the documentation. The most important is the recursion demonstration example. There are many improvements to the code and documentation.
New functions: sort, combsort, reproduce, and reduce. get_car has been deleted (use get_head). The function nreverse has been renamed to reverse. The documentation has been improved. This release is under the LGPLv3 or later.
car is no longer a pointer. This changes how list elements are stored in memory. The add_head_c and create_head_c functions were replaced by a unified create_head function. Make/destructor were renamed to make/destroy. A major revision of the documentation was undertaken, and all examples and tests were redone. A logo was created and the project was renamed from "Atoku's Basic List" to "Abstract Basic List".
A constructor/destructor feature was added for
easier memory management and initialization of
complex lists. The create_head and mapcar
functions were added. Major documentation revision
and extension was done. Some minor changes were
made to the interface.
