Right after allocators: containers or database connectivity?

[Andrea Fontana via Digitalmars-d]

On Wednesday, 10 June 2015 at 07:50:24 UTC, Jacob Carlborg wrote:
> On 2015-06-09 20:49, Brad Anderson wrote:
>
>> 1.  vector/array
>> 2.  hash map
>> 3.  hash set
>> 4.  flat map
>> 5.  flat set
>> 6.  map
>> 7.  set
>> 8.  deque
>> 9.  stack
>> 10. queue
>> 11. linked list
>> 12. hash multimap
>> 13. hash multiset
>> 14. flat multimap
>> 15. flat multiset
>> 16. multimap
>> 17. multiset
>> 18. priority queue
>
>
>> I think RedBlackTree isn't a very good name though. It's long 
>> and is an
>> implementation detail.
>
> In that case you would need to remove "hash" and perhaps "flat" 
> from all containers to be consistent. Also "linked list" would 
> be just "list". It would be difficult to come up with better 
> names since there would be name clashes.

It would be useful to have trees, heaps, (un)directed graphs...