Vdalib supports the creation and management of variable sized arrays or arbitrary elements, and dynamic lists. The implementation is a balance between time and memory efficiency and handles very large arrays/lists effectively.
Lists can be arbtrary structures, with a user provided 'comparison function' being used to determine equality. This for example allows an easy implementation of associative arrays.
In addition to the basic array support, lists can be re-ordered (i.e. the comparison function re-defined), elements added or deleted, and iterators are available for performing tasks on all elements of the list.
No comment yet
Be the first to share your thoughts.