Hi Yossi.
> > Suppose I have a huge hash. when I write > > my $n= keys %hash; > > > > Will it consume time and RAM for building the unneeded list (before taking > the size from it), or will it return the size immediately ? > > If it does cost me a lot, can I optimize it ? > > <http://mail.perl.org.il/mailman/listinfo/perl> > I'd say that you just need to try and see. Perl is good in optimizing such cases. Shmuel.
_______________________________________________ Perl mailing list Perl@perl.org.il http://mail.perl.org.il/mailman/listinfo/perl
