if (intersections.length == 1) result = new HashSet<Range<T>>(rhs.subtractContained(intersections[0])); ArrayList<Range<T>> temp = rhs.subtractContained(first); result = new HashSet<Range<T>>(single.subtractContained(second));
if (intersections.length == 1) result = new HashSet<Range<T>>(rhs.subtractContained(intersections[0])); ArrayList<Range<T>> temp = rhs.subtractContained(first); result = new HashSet<Range<T>>(single.subtractContained(second));
if (intersections.length == 1) result = new HashSet<Range<T>>(rhs.subtractContained(intersections[0])); ArrayList<Range<T>> temp = rhs.subtractContained(first); result = new HashSet<Range<T>>(single.subtractContained(second));
if (intersections.length == 1) result = new HashSet<Range<T>>(rhs.subtractContained(intersections[0])); ArrayList<Range<T>> temp = rhs.subtractContained(first); result = new HashSet<Range<T>>(single.subtractContained(second));
if (intersections.length == 1) result = new HashSet<Range<T>>(rhs.subtractContained(intersections[0])); ArrayList<Range<T>> temp = rhs.subtractContained(first); result = new HashSet<Range<T>>(single.subtractContained(second));