You should try playing Losing Chess then: http://www.chessvariants.org/diffobjective.dir/giveaway.html
Not everybody will agree. One of the main advantages of std::list is splicing that can be done in O(1) if the size is not stored.
Peter: Milton? Uh, could you turn that down just a little bit? Milton: Uh, they said I could listen to the radio at a reasonable volume from nine to eleven while I'm collating…. Peter: But, no, no, no. I know you're…
Somewhat related: http://blog.regehr.org/archives/140
This requirement is only for other vendors to get the certification from Microsoft. Microsoft itself does not need to conform to it, so it is still possible that their products will be locked.
Not only straightforward, but also not novel. For example such lists have been described (with source code) in this textbook (published in 1994): Taming C++: Pattern Classes and Persistence for Large Projects by Jiri…
You should try playing Losing Chess then: http://www.chessvariants.org/diffobjective.dir/giveaway.html
Not everybody will agree. One of the main advantages of std::list is splicing that can be done in O(1) if the size is not stored.
Peter: Milton? Uh, could you turn that down just a little bit? Milton: Uh, they said I could listen to the radio at a reasonable volume from nine to eleven while I'm collating…. Peter: But, no, no, no. I know you're…
Somewhat related: http://blog.regehr.org/archives/140
This requirement is only for other vendors to get the certification from Microsoft. Microsoft itself does not need to conform to it, so it is still possible that their products will be locked.
Not only straightforward, but also not novel. For example such lists have been described (with source code) in this textbook (published in 1994): Taming C++: Pattern Classes and Persistence for Large Projects by Jiri…