Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Generate unique ids of maximum length

by CountZero (Bishop)
on Apr 12, 2010 at 17:19 UTC ( #834321=note: print w/replies, xml ) Need Help??


in reply to Generate unique ids of maximum length

The "as similar as possible to the old ones" is what makes it difficult. How would you define it in a way that a computer understands?

And how dissimilar are you allowed to get, if you save on the length?

CountZero

A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James

  • Comment on Re: Generate unique ids of maximum length

Replies are listed 'Best First'.
Re^2: Generate unique ids of maximum length
by lima1 (Curate) on Apr 13, 2010 at 11:07 UTC
    Hm, good point. Probably something like the edit distance, but with the preference to keep the prefix and suffix to make the ids readable. So one simple algorithm would optimize the sum of edit distances under the constraint that the ids have to be unique.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (6)
As of 2021-04-21 22:12 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?