vector = dynamic array
queue = queue
stack = stack
priority_queue = priority queue based on binary heap
priority_queue can be implemented using
1. sorted array
2. sorted list ( unrolled list, skip list etc)
3. any other heap like Fibonacci heap, binomial heap
list = doubly linked list
set = set based on AVL Tree ( usually )
can implemented using any other binary balancing tree like
1. Binary Search Tree
2. Red black Tree
3. Splay Tree
slist = single linked list
map = map based on Red Black Tree ( usually )
where every node is 'pair' structure
can implemented using any other binary balancing tree like
1. Binary Search Tree
2. AVL Tree
3. Splay Tree
deque = deque
hash_set = set implemented using hash
hash_map = hash table
hash = 'Not Available', used as functor