Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

Re: Re: Checking for Duplicates

by CountZero (Bishop)
on Feb 25, 2004 at 20:56 UTC ( #331810=note: print w/replies, xml ) Need Help??


in reply to Re: Checking for Duplicates
in thread Checking for Duplicates

You'll run into issues if you have more occurances of one token than there are letters in the alphabet though.

Not at all! It will nicely continue with 'aa' after 'z', and 'ba' after 'az', etc, etc ....

CountZero

"If you have four groups working on a compiler, you'll get a 4-pass compiler." - Conway's Law

Replies are listed 'Best First'.
Re: Re: Re: Checking for Duplicates
by rchiav (Deacon) on Feb 25, 2004 at 21:05 UTC
    Sorry, I should have been more clear about that. I didn't mean "issues" in the sense that it would break, but that it wouldn't be as straight forward as having the files being alpha ordered according to where they were found in the file. For instance, 123ab would be ordered before 123d but would have occured 24 times after 123d.

    So if you wanted things files to be alpha ordered by the order of occurance, and you were going to have a significant amount of duplicates (or rather a chance of haiving more than 26 duplicates), then you'd probably want to start with 'aa' as your base.

    Thanks for pointing that out CountZero.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://331810]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (3)
As of 2021-09-25 17:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?