Array "lookups" are not faster than hash key lookups. That's the point. It's always O(1) {always takes the same amount of time, regardless of set size} to detect the presence of a key in a hash, while it's O(N) {grows linearly slower as you have more elements} to detect the presence of an element in an array.

--
[ e d @ h a l l e y . c c ]