Oh, I'm late to this party. :) Replacing (unordered_)?(map|set)<> with my own hashtable implementation: https://github.com/cliffordwolf/yosys/blob/master/kernel/hashlib.h …
-
Sortable means in this case you can sort it and then iterate in sort order until you insert or erase elements.
But, unlike (unordered_)?(map|set)<>, it can move the elements in memory on insert and erase. Than can be a pitfall.