This method is relatively fast and I was wondering which search algorithm does it implement internally. I had a look in the ECMASCript spec but it wasn't very enlightening:
This is a similar question Javascript ES6 computational/time complexity of collections
In summary ECMA only specify requirements, so each browser or javascript engine implements his own algorihtm.
I recomend you to see how Hash tables works Wikipedia Hash table