Hi,
> ----- Original Message ----
> From: Igor Sutton <[EMAIL PROTECTED]>
> To: Mumia W. <[EMAIL PROTECTED]>
> Cc: Beginners List <[email protected]>
> Sent: Friday, January 19, 2007 4:42:09 PM
> Subject: Re: Searching hash if a given value exists
> [...]
> New benchmarks about the subject:
> foreach_hash_keys: 4 wallclock secs ( 4.40 usr + 0.00 sys = 4.40
> CPU) @ 227272.73/s (n=1000000)
> foreach_hash_values: 4 wallclock secs ( 3.46 usr + 0.01 sys = 3.47
> CPU) @ 288184.44/s (n=1000000)
> reverse_hash: 6 wallclock secs ( 6.85 usr + 0.01 sys = 6.86 CPU) @
> 145772.59/s (n=1000000)
Rate reverse_hash foreach_hash_keys foreach_hash_values
> reverse_hash 145773/s -- -36%
> -49%
> foreach_hash_keys 227273/s 56% --
> -21%
> foreach_hash_values 288184/s 98% 27%
> --
Cool! so the winner is foreach_hash_values??
Never knew I could do a foreach (values %hash), I only use "foreach keys" for a
very long time now.
I tried searching the documentation for "foreach" but no avail.
____________________________________________________________________________________
Yahoo! Music Unlimited
Access over 1 million songs.
http://music.yahoo.com/unlimited
