Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

Re^2: Efficient algorithm needed to split Set::IntSpan objects

by ikegami (Patriarch)
on Sep 23, 2009 at 15:21 UTC ( [id://796996]=note: print w/replies, xml ) Need Help??


in reply to Re: Efficient algorithm needed to split Set::IntSpan objects
in thread Efficient algorithm needed to split Set::IntSpan objects

Also, if you want to add more than 9 spans with an X in the same position, the result string won't be enough.

Easily fixed by using chr($x) instead of $x. That will allow 2^32 overlaps. Maybe even 2^64 on 64-bit systems. You might have to turn off some unicode warning.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (4)
As of 2024-04-25 13:43 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found