Hacker News Reader

The lack of STL containers or even a fully implemented set of custom containers, to me, makes this kind of a non starter. I use C++, in part, because I don't want to have to implement Data structures and algorithms myself

View on HN

That's a fair observation.

What containers, beside Vector<T> (and Map<K,V> made with Vector) + variants would you like to see the most?

Set, Stack, Queue, and their various implementations (HashSet, PriorityQueue, etc)

There is a VectorSet that creates Set with an unsorted vector. I think it would be good (and easy) creating a SortedVectorSet for better performance.

HashMap and proper Map<K,V> are already on the roadmap https://pagghiu.github.io/SaneCppLibraries/library_container...

Stack can be easily created with Vector.

I think Queue is pretty specialized, but I will think about it.

My projects use stack and deque often.

Stack can be easily created with Vector (I can add it, thanks for the hint). I am conceptually against using Deque. If you need to keep stable addresses for objects you can use ArenaMap https://pagghiu.github.io/SaneCppLibraries/library_container...

Reply on news.ycombinator.com