Check if the list is empty.
true if there are no nodes in the list; false otherwise.
Complexity: O(1).
DList!int dl; assert(dl.empty); size_t pos = 0; dl.insert(pos, 1); assert(!dl.empty);
See Implementation
Check if the list is empty.