Linear (doubly linked) list support.

[Domagoj Šarić]

Please add support for non-circular doubly linked lists (so that the end iterator is always simply a null pointer).

[Ion Gaztañaga]

I can't see the advantages of non-circular doubly-linked lists as complexity guarantees are very similar and usually null-ended lists are more complex to implement (null-end condition must be checked many times). Could you elaborate a bit more or point to some online documentation that shows the advantages of null-ended doubly linked lists?

[Andrey Semashev]

If the end() iterator contains NULL internally, then you are not able to decrement it, which is needed for back(), rbegin(), etc.

[Ion Gaztañaga]

Reviewing old bugs, no other user has requested this feature in the mailing list so closing as WONTFIX.