public final class SetOper
extends java.lang.Object
| Modifier and Type | Method and Description |
|---|---|
static <T extends java.lang.Comparable<T>> |
Except(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Unites all of the elements that belong to one sorted source range
but not to a second sorted source range into a single, sorted destination range.
|
static <T> int |
Except(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Unites all of the elements that belong to one sorted source range
but not to a second sorted source range into a single, sorted destination range,
where the ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
Except(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3)
Unites all of the elements that belong to one sorted source range
but not to a second sorted source range into a single, sorted destination range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
Except(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Unites all of the elements that belong to one sorted source range
but not to a second sorted source range into a single, sorted destination range,
where the ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>> |
Includes(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2)
Tests whether one sorted range contains all of the elements
from a second sorted range.
|
static <T> boolean |
Includes(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Tests whether one sorted range contains all of the elements
from a second sorted range, where the ordering or equivalence
criterion between elements is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>> |
Includes(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2)
Tests whether one sorted range contains all of the elements
from a second sorted range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>> |
Includes(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Tests whether one sorted range contains all of the elements
from a second sorted range, where the ordering or equivalence
criterion between elements is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>> |
Intersect(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Unites all of the elements that belong to both sorted source ranges
into a single, sorted destination range.
|
static <T> int |
Intersect(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Unites all of the elements that belong to both sorted source ranges
into a single, sorted destination range, where the ordering criterion is
specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
Intersect(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3)
Unites all of the elements that belong to both sorted source ranges
into a single, sorted destination range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
Intersect(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Unites all of the elements that belong to both sorted source ranges
into a single, sorted destination range, where the ordering criterion is
specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>> |
PExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Parallel Except: Unites all of the elements that belong to one sorted source range
but not to a second sorted source range into a single, sorted destination range.
|
static <T> int |
PExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel Except: Unites all of the elements that belong to one sorted source range
but not to a second sorted source range into a single, sorted destination range,
where the ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
PExcept(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3)
Parallel Except: Unites all of the elements that belong to one sorted source range
but not to a second sorted source range into a single, sorted destination range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
PExcept(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel Except: Unites all of the elements that belong to one sorted source range
but not to a second sorted source range into a single, sorted destination range,
where the ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>> |
PIncludes(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2)
Parallel Includes: Tests whether one sorted range contains all of the elements
from a second sorted range.
|
static <T> boolean |
PIncludes(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel Includes: Tests whether one sorted range contains all of the elements
from a second sorted range, where the ordering or equivalence
criterion between elements is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>> |
PIncludes(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2)
Parallel Includes: Tests whether one sorted range contains all of the elements
from a second sorted range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>> |
PIncludes(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel Includes: Tests whether one sorted range contains all of the elements
from a second sorted range, where the ordering or equivalence
criterion between elements is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>> |
PIntersect(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Parallel Intersect: Unites all of the elements that belong to both sorted source ranges
into a single, sorted destination range.
|
static <T> int |
PIntersect(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel Intersect: Unites all of the elements that belong to both sorted source ranges
into a single, sorted destination range, where the ordering criterion is
specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
PIntersect(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3)
Parallel Intersect: Unites all of the elements that belong to both sorted source ranges
into a single, sorted destination range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
PIntersect(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel Intersect: Unites all of the elements that belong to both sorted source ranges
into a single, sorted destination range, where the ordering criterion is
specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>> |
PSymmetricExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Parallel SymmetricExcept: Unites all of the elements that belong to one, but not both,
of the sorted source ranges into a single, sorted destination range.
|
static <T> int |
PSymmetricExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel SymmetricExcept: Unites all of the elements that belong to one, but not both,
of the sorted source ranges into a single, sorted destination range,
where the ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
PSymmetricExcept(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3)
Parallel SymmetricExcept: Unites all of the elements that belong to one, but not both,
of the sorted source ranges into a single, sorted destination range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
PSymmetricExcept(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel SymmetricExcept: Unites all of the elements that belong to one, but not both,
of the sorted source ranges into a single, sorted destination range,
where the ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>> |
PUnion(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Parallel Union: Unites all of the elements that belong to at least one of two
sorted source ranges into a single, sorted destination range.
|
static <T> int |
PUnion(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel Union: Unites all of the elements that belong to at least one of two
sorted source ranges into a single, sorted destination range, where the
ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
PUnion(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3)
Parallel Union: Unites all of the elements that belong to at least one of two
sorted source ranges into a single, sorted destination range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
PUnion(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Parallel Union: Unites all of the elements that belong to at least one of two
sorted source ranges into a single, sorted destination range, where the
ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>> |
SymmetricExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Unites all of the elements that belong to one, but not both,
of the sorted source ranges into a single, sorted destination range.
|
static <T> int |
SymmetricExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Unites all of the elements that belong to one, but not both,
of the sorted source ranges into a single, sorted destination range,
where the ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
SymmetricExcept(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3)
Unites all of the elements that belong to one, but not both,
of the sorted source ranges into a single, sorted destination range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
SymmetricExcept(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Unites all of the elements that belong to one, but not both,
of the sorted source ranges into a single, sorted destination range,
where the ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>> |
Union(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Unites all of the elements that belong to at least one of two
sorted source ranges into a single, sorted destination range.
|
static <T> int |
Union(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Unites all of the elements that belong to at least one of two
sorted source ranges into a single, sorted destination range, where the
ordering criterion is specified by a binary predicate.
|
static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
Union(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3)
Unites all of the elements that belong to at least one of two
sorted source ranges into a single, sorted destination range.
|
static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> |
Union(TInpIter first1,
TInpIter last1,
TInpIter first2,
TInpIter last2,
TOutIter first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Unites all of the elements that belong to at least one of two
sorted source ranges into a single, sorted destination range, where the
ordering criterion is specified by a binary predicate.
|
public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>> boolean Includes(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the specified ranges.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>> boolean PIncludes(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the specified ranges.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.public static <T,TInpIter extends IInpIter<T,TInpIter>> boolean Includes(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the specified ranges.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T,TInpIter extends IInpIter<T,TInpIter>> boolean PIncludes(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the specified ranges.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T extends java.lang.Comparable<T>> boolean Includes(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The specified first array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The specified second array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.public static <T extends java.lang.Comparable<T>> boolean PIncludes(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The specified first array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The specified second array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.public static <T> boolean Includes(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The specified first array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The specified second array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T> boolean PIncludes(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The specified first array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The specified second array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter Union(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter PUnion(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.public static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter Union(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter PUnion(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T extends java.lang.Comparable<T>> int Union(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.public static <T extends java.lang.Comparable<T>> int PUnion(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.public static <T> int Union(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T> int PUnion(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter Intersect(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter PIntersect(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.public static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter Intersect(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter PIntersect(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T extends java.lang.Comparable<T>> int Intersect(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.public static <T extends java.lang.Comparable<T>> int PIntersect(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.public static <T> int Intersect(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T> int PIntersect(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter Except(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter PExcept(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.public static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter Except(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter PExcept(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T extends java.lang.Comparable<T>> int Except(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.public static <T extends java.lang.Comparable<T>> int PExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.public static <T> int Except(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T> int PExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter SymmetricExcept(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.public static <T extends java.lang.Comparable<T>,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter PSymmetricExcept(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.public static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter SymmetricExcept(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T,TInpIter extends IInpIter<T,TInpIter>,TOutIter extends IOutIter<T,TOutIter>> TOutIter PSymmetricExcept(TInpIter first1, TInpIter last1, TInpIter first2, TInpIter last2, TOutIter first3, IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.TInpIter - The type of iterators in the input range.TOutIter - The type of iterators in the output range.first1 - An input iterator addressing the position of the first
element in the first sorted source range.last1 - An input iterator addressing the position one past the
last element in the first sorted source range.first2 - An input iterator addressing the position of the first
element in the second sorted source range.last2 - An input iterator addressing the position one past the
last element in the second sorted source range.first3 - An output iterator addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T extends java.lang.Comparable<T>> int SymmetricExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.public static <T extends java.lang.Comparable<T>> int PSymmetricExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.public static <T> int SymmetricExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.public static <T> int PSymmetricExcept(T[] x,
int first1,
int last1,
T[] y,
int first2,
int last2,
T[] z,
int first3,
IFunc2Arg<T,T,java.lang.Boolean> pred)
Remarks: The sorted source ranges referenced must be valid. The complexity of the algorithm is linear with at most 2 * ((last1 – first1) – (last2 – first2)) – 1 comparisons for non-empty source ranges.
T - The type of elements in the specified ranges.x - The first input array.first1 - An integer addressing the position of the first
element in the first sorted source range.last1 - An integer addressing the position one past the
last element in the first sorted source range.y - The second input array.first2 - An integer addressing the position of the first
element in the second sorted source range.last2 - An integer addressing the position one past the
last element in the second sorted source range.z - The specified output array.first3 - An integer addressing the position of the first
element in the destination range.pred - A user-defined predicate function object that defines
sense in which one element is less than another.Copyright© 2012 Progeneric Systems, Inc. All Rights Reserved.