Yes, except the canonical map is—surprising the users of other collection frameworks—an ordered, balanced tree. So std::map::find() is O(ln n) while std::unordered_map::find() is O(1).

It doesn't affect your point, but std::map::find is O(log n). std::map is ordered and is typically a tree.