On 17 July 2014 06:44, Aleksandr Kupriianov
Some library developers might wonder how btree_seq is different from std::list. What missing niche in the STL does btree_seq intend to fill?
Shortly speaking my thing is between list and vector.
Instead of yet another container, have you thought about adding another kind of index to Boost.Multi-index? The big benefit to that is that it makes it very easy to compare different types of indices with real world data. I've done this kind of thing with sequenced indices vs. random access indices.
Another niche is possible porting string on its basis. I.e., something like this:
typedef string_abstraction
string; typedef string_abstraction scalable_string;
Unlikely to be that useful, as the iterator invalidation and contiguous guarantees are vastly different in the two cases. -- Nevin ":-)" Liber mailto:nevin@eviloverlord.com (847) 691-1404