collections ~master (2022-05-06T22:22:30.7373307)

DList.insert

stdx collections dlist DList

Inserts the elements of an input range, or a variable number of items, at the given pos.

If no allocator was provided when the list was created, the GCAllocator.std.experimental.allocator. will be used.

  1. size_t insert(size_t pos, Stuff stuff)
  2. size_t insert(size_t pos, Stuff[] stuff)
    struct DList(T)
    size_t
    insert
    (
    Stuff
    )
    (
    size_t pos
    ,
    Stuff[] stuff...
    )
    if (
    isImplicitlyConvertible!(Stuff, T)
    )

Parameters

pos size_t

a positive integral

stuff Stuff[]

an input range of elements that are implitictly convertible to T; a variable number of items either in the form of a list or as a built-in array

Return Value

Type: size_t

the number of elements inserted

Complexity: O(pos + m), where m is the number of elements in the range.

Examples

import std.algorithm.comparison : equal;

auto d = DList!int(4, 5);
DList!int dl;
assert(dl.empty);

size_t pos = 0;
pos += dl.insert(pos, 1);
pos += dl.insert(pos, [2, 3]);
assert(equal(dl, [1, 2, 3]));

// insert from an input range
pos += dl.insert(pos, d);
assert(equal(dl, [1, 2, 3, 4, 5]));
d.front = 0;
assert(equal(dl, [1, 2, 3, 4, 5]));

Meta

Source

See Implementation

stdx collections dlist DList constructorsdestructorsfunctionspostblitstemplates

Page generated by adrdox