LinkedList.addAt

Time complexity: O(n + number of elements in e)

LinkedList addAt(size_t index, V value)
size_t addAt(size_t index, IContainer!(V) e)
class LinkedList(V, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
final
size_t
addAt
(
size_t index
,
IContainer!(V) e
)

Meta

Source

See Implementation

tango util container LinkedList LinkedList constructors

this

destructors

~this

functions

properties