Modern LinkedList LinkedList

Home › LinkedList › LinkedList › LinkedList

LinkedList

Holds a chain of values that is quick to add to and remove from at either end.

Syntax

LinkedList( of T )

Notes

• It exists for the two things Array cannot do: O(1) insertion at the front, and an iterator that stays valid across an insertion somewhere else in the list.
• Prefer Array unless one of those is what you actually need -- this is the least important of the four containers.
• Unlike Array, Map and Set, whose storage is a dynamic array the language copies and frees for you, this holds raw node pointers. So the destructor, the copy constructor and operator let are all written out: a default copy would give two lists sharing one chain, and then a double free.
• Copies are therefore deep, and cost a node allocation per element.

Examples

#import "std/containers"
using containers

dim q as LinkedList( of ustring )

q.PushBack( "b" )
q.PushFront( "a" )           '' O(1) at the front, which Array cannot do
print q.Front( ) & q.Back( ) '' ab

'' A DEEP copy with its own chain -- not two handles on one list
dim copy_ as LinkedList( of ustring ) = q
copy_.Front( ) = "z"
print q.Front( ) & " " & copy_.Front( )       '' a z

---

Library: LinkedList
Category: LinkedList
Documented under: Members