comment on

I humbly seek the wisdom of the Monks.

Given a list of Set::IntSpan objects I'd like to find the number of overlapping ranges for any given value. For example, given the three ranges represented here:

  --XXXXXXXXX---  a = 3-11
  ----XXXX------  b = 5-8
  ------XXXXX---  c = 7-11

I'd like to end up with these values:

  00112233222000

For my use-case I know that each span is just one contiguous range - there are no holes in the spans. Also, the spans may be large so iterating over the elements of a span isn't an option.

I think the first step would be to split ranges which overlap other ranges into separate non-overlapping ranges:

  --XX---------- a1 = 3-4
  ----XXXX------ a2 = 5-8
  --------XXX--- a3 = 9-11
  ----XXXX------ b  = 5-8
  ------XX------ c1 = 7-8
  --------XXX--- c2 = 9-11

then a simple $hash{ $stringified_span }++ would give me the counts.

Any suggestions for how to do this efficiently? Or a different approach? (I've thousands of spans representing events with durations from a log)

In reply to Efficient algorithm needed to split Set::IntSpan objects by tim.bunce

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.


Welcome to the Monastery
	PerlMonks