From: unbewusst.sein@... (=?ISO-8859-1?Q?Une_B=E9vue?=) Date: 2007-02-15T23:00:08+09:00 Subject: Re: sorting an array of hash Erik Veenstra wrote: > But it's inefficient... (See benchmark below.) it was a "one time running" script then... > You're doing a lookup in both hashes in order to compare the > types. A more efficient technique is to cache theses types. > > Sort_by constructs a temporary array, where each element is an > array containing the type along with the mime type. Sort_by > than sorts this array, and extracts the mime type from the > result. Ok i see. > > gegroet, > Erik V. - http://www.erikveen.dds.nl/ Anyway, thanks a lot i've learned something today ))) -- Une B�vue