Copies elements from an input range to an output range, except that
only the first element is copied from every consecutive group of
equivalent elements; equivalence is determined by a
supplied predicate.
Copies elements from an input range to an output range, except that
only the first element is copied from every consecutive group of
equivalent elements; equivalence is determined by a
supplied predicate.
Copies elements from an input range to an output range, except that
only the first element is copied from every consecutive group of
equivalent elements; equivalence is determined by a
supplied predicate.
Copies elements from an input range to an output range, except that
only the first element is copied from every consecutive group of
equivalent elements; equivalence is determined by a
supplied predicate.
Copies elements from an input range to an output range, except that
only the first element is copied from every consecutive group of
equivalent elements; equivalence is determined by a
supplied predicate.
Copies elements from an input range to an output range, except that
only the first element is copied from every consecutive group of
equivalent elements; equivalence is determined by a
supplied predicate.
Copies elements from an input range to an output range, except that
only the first element is copied from every consecutive group of
equivalent elements; equivalence is determined by a
supplied predicate.
Copies elements from an input range to an output range, except that
only the first element is copied from every consecutive group of
equivalent elements; equivalence is determined by a
supplied predicate.
Copies elements from an input range to an output range, except that
only the first element is copied from every consecutive group of
equivalent elements; equivalence is determined by a
supplied predicate.
Computes the number of buffers and number of values per buffer such that
quantiles can be determined with an approximation error no more than epsilon with a certain probability.
See jal.DOUBLE.Sorting
Performs a binary search on an already-sorted range: finds the last
position where an element can be inserted without violating the ordering.