Lists
Linked list with some nice features.
• 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.
| | type Content_Type | |
| Generic type of the items to be stored. | |
|