The number of elements inserted.
DList!int l; int value = 5; l.insertBack(value); assert(l.front == value); assert(l.back == value); value = 8; l.insertBack(value); assert(l.front == 5); assert(l.back == value);
DList!int l1; assert(l1.insertBack(8) == 1); assert(l1.back == 8); assert(l1.insertBack(9) == 1); assert(l1.back == 9); DList!int l2; assert(l2.insertBack([25, 30, 15]) == 3); assert(l2.back == 15); l2.insertBack(l1[]); assert(l2.back == 9);
Inserts a new element at the end.