It is, and so is boost::unordered_map, that's the whole point of the comparison. Just check the implementation out.
This library uses Robin Hood hashing for speed. As my original link explains, standard implementations use chained buckets so that users can cache lookups and to have better worst-case performance: https://news.ycombinator.com/item?id=9675964