can be an element that is implicitly convertible to T, an input range of such elements, or another doubly linked list
the newly created list
Complexity: O(n + m), where m is the number of elements in rhs.
import std.algorithm.comparison : equal; auto dl = DList!int(1); auto dl2 = dl ~ 2; assert(equal(dl2, [1, 2])); dl.front = 0; assert(equal(dl2, [1, 2]));
Create a new list that results from the concatenation of this list with rhs.