The current hash containers are very compatible with previous versions except for a few methods:
You can no longer compare two hash containers with the ordering operators: <, <=, >, >=. Since hash containers are unordered sets of items, such comparisons have little meaning.
lower_bound is no longer supported. Use find instead if you expect the item to be in the container. If not in the container, find will return end(). As there is no ordering, finding the position which an item could be inserted before has no meaning in a hash container.
upper_bound is no longer supported. Again because of the fact that hash containers are unordered, upper_bound has questionable semantics.
Despite the lack of lower_bound and upper_bound, equal_range is supported. Note that equal_range().first suffices for lower_bound, and equal_range().second suffices for upper_bound.