SList.insertFront

Inserts stuff to the front of the container. stuff can be a value convertible to T or a range of objects convertible to T. The stable version behaves the same, but guarantees that ranges iterating over the container are never invalidated.

struct SList(T)
size_t
insertFront
(
Stuff
)
(
Stuff stuff
)
if ()
if (
!is(T == shared)
)

Return Value

Type: size_t

The number of elements inserted

Complexity: O(m), where m is the length of stuff

Meta