The documentation on "keys" and "each" says something like the following:
--- Returns a list consisting of all the keys of the named hash. (In scalar context, returns the number of keys.) The keys are returned in an apparently random order. --- I have a database (>50,000 items) that I would like to select things from randomly. I would like to "eventually" select all of the items from the database, but there are no time constraints. The database is constantly being changed. If I use keys to select 100 items to process, then come back at a later date and pick another 100, and so on, will I eventually hit "most" of the items? My own experiments show this to be more or less true - but I'd like to know if anyone can explain to me how random is random. -Phil -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] <http://learn.perl.org/> <http://learn.perl.org/first-response>
