Boost C++ Libraries: Ticket #7004: Linear (doubly linked) list support.

Ion Gaztañaga — Wed, 29 May 2013 08:03:59 GMT

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 — Wed, 27 Nov 2013 12:19:24 GMT

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

status changed; resolution set

Ion Gaztañaga — Thu, 04 Aug 2016 21:28:53 GMT

status new → closed
resolution → wontfix

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