That's a lot more code to do the same thing. `.reverse_each.find` will also only iterate once, but it uses enumerators and/or fibers (I cannot remember which), which is why I was wondering about the performance.

On the other hand, we're usually talking about less than 5 items to loop over so I don't think we should worry too much about optimization here as I think it's a bit premature.

If I am wrong, however, and it is such a "bad" way to do it, I'll change.

I wish Ruby had a `Enumerable#find_last` or `Enumerable#reverse_find`. :-(