5baf906c28
-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 |
||
|---|---|---|
| .. | ||
| alignment | ||
| commandline | ||
| gatk | ||
| jna | ||
| queue | ||
| tools | ||
| utils | ||