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

c1 is overlapping b and a2 ranges.

How many keys do you expect the hash to have?

This approach could be difficult to handle... If you want to add many spans, you will end with many rows with only one X for each span.

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

Comment on Re: Efficient algorithm needed to split Set::IntSpan objects

Replies are listed 'Best First'.
Re^2: Efficient algorithm needed to split Set::IntSpan objects by ikegami (Patriarch) on Sep 23, 2009 at 15:21 UTC
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.	[reply] [d/l] [select]