Less overhead for associative container lookup
by Michael Kristofik
From the article:
Searching for an element in a container normally requires constructing an object of the container’s key_type. If the key is small, such as one you’d normally pass by value, it isn’t a performance concern. But what if the key is large?