c++ - How is the keys searched in a STL map? -
how keys stored , searched in stl std::map
? data structure used store keys (or values also) in map , algorithm used search keys in std::map
?
from cppreference:
maps typically implemented binary search trees.
by default less<t>
used compare keys, can specify custom compare function template parameter.
Comments
Post a Comment