can be an element that is implicitly convertible to T, an input range of such elements, or another doubly linked list
a reference to this list
Complexity: O(n + m), where m is the number of elements in rhs.
import std.algorithm.comparison : equal; auto d = DList!int(4, 5); DList!int dl; assert(dl.empty); dl ~= 1; dl ~= [2, 3]; assert(equal(dl, [1, 2, 3])); // append an input range dl ~= d; assert(equal(dl, [1, 2, 3, 4, 5])); d.front = 0; assert(equal(dl, [1, 2, 3, 4, 5]));
Append the elements of rhs at the end of the list.
If no allocator was provided when the list was created, the GCAllocator.std.experimental.allocator. will be used.