> Does anyone now if there is a way to find keys in a hash which are similar?
There is no implied organization whatsoever in a hash. Hashes don't know "similar". The only thing you can do to find similar keys is "each %hash" and match each key against your favorite regex for "similar". Another possibility is to use a B-tree. You're able to have duplicate keys, and to retrieve data for keys with the same prefix. You'll need the Berkeley DB software (from www.sleepycat.com) and either the BerkeleyDB or DB_File Perl modules. I think that ActiveState bundles everything you need if you get their DB_File package, but I've not tried it. _______________________________________________ ActivePerl mailing list [EMAIL PROTECTED] http://listserv.ActiveState.com/mailman/listinfo/activeperl
