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

Popular posts from this blog

android - Get AccessToken using signpost OAuth without opening a browser (Two legged Oauth) -

org.mockito.exceptions.misusing.InvalidUseOfMatchersException: mockito -

google shop client API returns 400 bad request error while adding an item -