Interesting. Yeah, performance tuning is a deep well to fall into :-) Measure, measure, measure. How (memory) expensive is the element-matches check (can the

Interesting. Yeah, performance tuning is a deep well to fall into :-) Measure, measure, measure. How (memory) expensive is the element-matches check (can the array bound or address of final element stay in a register)? How often does the search fall off the end, vs finding something, perhaps in a list sorted in most often used order? Alternately, would a trie be better than an array search? (Depends on key length, set element count, usage patterns...)