Hi All
I was wondering whether find_by_name has linear complexity O(n) with n
being the number of records? Or is it log(n) or constant? I have some
code which uses find_by_name heavily, and I was wondering if the long
runtimes I'm seeing are a result of find_by_name being linear

Thanks
Kretch
-- 
Posted via http://www.ruby-forum.com/.