Right now my program is stomping my CPU...
How do the following attribute of a hash key:
size (something like an alphanumeric string about 70 chars wide)
similarity (groups of about 30% of the keys are similar for the 1st
n-10 characters
affect the performance of:
key listings (things l
On 03/26, Jenda Krynicky said something like:
> From: "Jonathan E. Paton" <[EMAIL PROTECTED]>
> > > affect the performance of:
> > > key listings (things like grep /pattern/, keys %hash)
> >
> > Grep can be slow, especially with patterns. Keys
> > could be slow, especially if the d
the data gets out of hand...
TIA for any help.
--
Mr Hash
[EMAIL PROTECTED]
I invented the cordless extension cord
-- Stephen Wright
--
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
> > it work? I need arbitrarily named filehandles. I know, it
> > could get rended with gobbleworts if the data gets out of hand...
>
> Have you tried using eval, like:
>
> eval "open ($1 ">>$file")