ABL (Abstract Basic List) 1.2 (Default branch) |
|
|
ABL (Abstract Basic List) is a flexible abstract
list library defined using the C preprocessor. It
allows you to define linked lists of arbitrary
types very easily. You also can use these lists as
stacks or queues. You can easily define
complicated types like a list of lists. It
contains a set of functions to work on lists,
including higher order functions for filtering and
so on. The list includes detailed documentation in
texinfo format.
License: GNU Lesser General Public License (LGPL)
Changes:
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.
|
