David Roazen 5baf906c28 Intervals: fix bug where we could fail to find the intersection of unsorted/missorted interval lists ... -The algorithm for finding the intersection of two sets of intervals relies on the sortedness of the intervals within each set, but the engine was not sorting the intervals before attempting to find the intersection. -The result was that if one or both interval lists was unsorted / lexicographically sorted, we would often fail to find the intersection correctly. -Now the IntervalBinding sorts all sets of intervals before returning them, solving the problem. -Added an integration test for this case. GSA-909 #resolve		2013-04-02 14:01:52 -04:00
..
IntervalIntegrationTest.java	Intervals: fix bug where we could fail to find the intersection of unsorted/missorted interval lists	2013-04-02 14:01:52 -04:00
IntervalUtilsUnitTest.java	Re-committing the following changes from Dec 18:	2013-01-16 12:43:15 -05:00