From: Robert Klemme <shortcutter@...>
Date: 2012-03-09T21:05:37+09:00
Subject: Re: Finding intersection of n-number of arrays of integer ranges

Jim Jones wrote in post #1050801:
> The subject line is a mouthful, but assuming the following scenario, I'm
> looking for an elegant way to accomplish the following:
>
> We have an array which contains n-number of elements which themselves
> are arrays of ranges (these are ranges of UNIX timestamps - start/end
> times, but that's not important) - let's assume a single array
> containing three arrays of ranges.
>
> I need to find the intersections, if any exists where the ranges
> overlap/intersect across all (in this case 3) arrays of ranges.

How exactly do you determine intersections?  In other words: do you only 
consider intersections at the same index in the arrays.  Are arrays of 
ranges ordered?  etc.  I think there are still a lot of questions open.

Kind regards

robert

-- 
Posted via http://www.ruby-forum.com/.