ada/util/lists/

Ada implementation of singly linked lists with some nice features. More useful than Arrays if you don't know how many elements to expect, or if you ever need to remove or add elements.

Features

• Generic to allow all kinds of content, even limited types.
• String lists provided (wrapper for String_Access).
• Private implementation: can't mess around with this.
• Small memory footprint: only one extra pointer per item.
• Built-in iterator for simple loops.
• Modify while iterating: insert, remove, update.
• Item direct iteration: unlimited parallel independent iterators.
• Direct access to first and last item: can add items at both ends.
• Cached item count.