I am far from knowing the answer but why don't you sort the keys and make sure that they are at the same order each time you run the code ?
On the other hand, if this is another of those theoretical questions, my first 7 words should be read again ... YG On Wed, Mar 30, 2011 at 4:59 PM, Chanan Berler <[email protected]> wrote: > Hello All, > > I have 2 different Linux machines (same OS version / same Perl version): > (assuming there are least 200 keys/values - same keys/values on both > machines) > I wonder if i do > foreach (keys $myHash) > { > print $_=$myHash{$_}; > } > > will it print the same on both machines ? will the order be exactly the > same ? > friend of mine, says it's same B-Tree algorithm on both machines, > since it's same Perl version. > What do you think ? > > thanks > Chanan > > > -- > =================== > ---- Chanan Berler ---- > =================== > _______________________________________________ > Perl mailing list > [email protected] > http://mail.perl.org.il/mailman/listinfo/perl
_______________________________________________ Perl mailing list [email protected] http://mail.perl.org.il/mailman/listinfo/perl
