in reply to Re: how can I speed up this perl??
in thread how can I speed up this perl??

Yep, obviously the comparison is also a part of the problem. As a matter of fact, both of our posts in this sub-thread shall only be understood as performance analysis, the actual implementation still shall go after hash, which has everything resolved in one shot.

Replies are listed 'Best First'.
Re: Re: Re: how can I speed up this perl??
by jbeninger (Monk) on Nov 24, 2003 at 19:07 UTC
    Going a bit offtopic, how does the internal hash lookup compare to the array solution he has now? It seems to me that internally, Perl will be doing nearly the same thing - comparing the given key to each of the keys in the hash.
[reply]
      The beauty of a hash is that Perl doesn't need to compare the string to every key in the hash. It computes the hash for the string and looks in the bucket for that hash. In a well balanced hash, there should only be one key in that hash. The string needs to be compared against the key(s) in the bucket.

      The hash replaces multiple comparisons with a hash calculation and usually one comparison.

[reply]

In Section Seekers of Perl Wisdom