|
Colt 1.0.1 | |||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use BinaryPredicate | |
jal.FLOAT | Algorithms on float arrays; A partial STL port by the C++ Standard Template Library authors. |
Uses of BinaryPredicate in jal.FLOAT |
Classes in jal.FLOAT that implement BinaryPredicate | |
class |
Equals
A function object that represents a binary predicate: tests whether two elements are equal. |
Methods in jal.FLOAT with parameters of type BinaryPredicate | |
static int |
unique(float[] array,
int first,
int last,
BinaryPredicate p)
Eliminates all but the first element of every consecutive group of equivalent elements, where equivalence is determined by a supplied predicate. |
static int |
unique_copy(float[] source,
float[] destination,
int first,
int last,
int to,
BinaryPredicate p)
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. |
static void |
sort(float[] array,
int first,
int last,
BinaryPredicate comp)
Sort a range of elements by a user-supplied comparison function. |
static void |
insertion_sort(float[] array,
int first,
int last,
BinaryPredicate comp)
Sort a range of elements by a user-supplied comparison function. |
static void |
stable_sort(float[] array,
int first,
int last,
BinaryPredicate comp)
Sort a range of elements by a user-supplied comparison function. |
static void |
partial_sort(float[] array,
int first,
int middle,
int last,
BinaryPredicate comp)
Partially sorts a range by a user-supplied comparison function: places the first middle-first elements in the range
[first, middle) . |
static int |
partial_sort_copy(float[] source,
float[] destination,
int first,
int last,
int result_first,
int result_last,
BinaryPredicate comp)
Copies the first N sorted elements from one range
into another, where N is the length of the smaller of
the two ranges. |
static void |
nth_element(float[] array,
int first,
int nth,
int last,
BinaryPredicate comp)
Partitions a range of elements into two subranges [first, nth) and [nth, last) . |
static int |
lower_bound(float[] array,
int first,
int last,
float x,
BinaryPredicate comp)
Performs a binary search on an already-sorted range: finds the first position where an element can be inserted without violating the ordering. |
static int |
upper_bound(float[] array,
int first,
int last,
float x,
BinaryPredicate comp)
Performs a binary search on an already-sorted range: finds the last position where an element can be inserted without violating the ordering. |
static Range |
equal_range(float[] array,
int first,
int last,
float x,
BinaryPredicate comp)
Performs a binary search on an already-sorted range: Finds the largest subrange in the supplied range such that an element can be inserted at any point in that subrange without violating the existing ordering. |
static boolean |
binary_search(float[] array,
int first,
int last,
float x,
BinaryPredicate comp)
Performs a binary search on an already-sorted range: determines whether the range contains an element equivalent to a certain value. |
static int |
merge(float[] source1,
float[] source2,
float[] dest,
int first1,
int last1,
int first2,
int last2,
int to,
BinaryPredicate comp)
Merges two sorted ranges into a third range, which will be sorted. |
static void |
inplace_merge(float[] array,
int first,
int middle,
int last,
BinaryPredicate comp)
Transforms two consecutive sorted ranges into a single sorted range. |
static boolean |
includes(float[] array1,
float[] array2,
int first1,
int last1,
int first2,
int last2,
BinaryPredicate comp)
Tests whether the first range is a superset of the second; both ranges must be sorted. |
static int |
set_union(float[] source1,
float[] source2,
float[] destination,
int first1,
int last1,
int first2,
int last2,
int to,
BinaryPredicate comp)
Constructs a union of two already-sorted ranges. |
static int |
set_intersection(float[] source1,
float[] source2,
float[] destination,
int first1,
int last1,
int first2,
int last2,
int to,
BinaryPredicate comp)
Constructs an intersection of two already-sorted ranges. |
static int |
set_difference(float[] source1,
float[] source2,
float[] destination,
int first1,
int last1,
int first2,
int last2,
int to,
BinaryPredicate comp)
Constructs the set difference of two already-sorted ranges. |
static int |
set_symmetric_difference(float[] source1,
float[] source2,
float[] destination,
int first1,
int last1,
int first2,
int last2,
int to,
BinaryPredicate comp)
Constructs the set symmetric difference of two already-sorted ranges. |
static void |
push_heap(float[] array,
int first,
int last,
BinaryPredicate comp)
Adds an element to a heap. |
static void |
pop_heap(float[] array,
int first,
int last,
BinaryPredicate comp)
Removes the largest element from a heap. |
static void |
make_heap(float[] array,
int first,
int last,
BinaryPredicate comp)
Turns the range [first, last) into a heap. |
static void |
sort_heap(float[] array,
int first,
int last,
BinaryPredicate comp)
Turns a heap into a sorted range; this operation is O(N log N) . |
static int |
max_element(float[] array,
int first,
int last,
BinaryPredicate comp)
Finds the largest element in a range. |
static int |
min_element(float[] array,
int first,
int last,
BinaryPredicate comp)
Finds the smallest element in a range. |
static boolean |
lexicographical_compare(float[] array1,
float[] array2,
int first1,
int last1,
int first2,
int last2,
BinaryPredicate comp)
Performs a lexicographical (element-by-element) comparison of two ranges. |
static boolean |
next_permutation(float[] array,
int first,
int last,
BinaryPredicate comp)
Transforms a range of elements into the next permutation of those elements, where the next permutation is defined by a lexicographical ordering of the set of all permutations. |
static boolean |
prev_permutation(float[] array,
int first,
int last,
BinaryPredicate comp)
Transforms a range of elements into the previous permutation of those elements, where the previous permutation is defined by a lexicographical ordering of the set of all permutations. |
static int |
adjacent_find(float[] array,
int first,
int last,
BinaryPredicate p)
Finds the first adjacent pair of elements in a range that satisfy some condition. |
static int |
mismatch(float[] array1,
float[] array2,
int first1,
int last1,
int first2,
BinaryPredicate p)
Finds the first location at which two ranges fail to satisfy a condition. |
static boolean |
equal(float[] array1,
float[] array2,
int first1,
int last1,
int first2,
BinaryPredicate p)
Tests whether two ranges satisfiy a condition pairwise. |
static int |
search(float[] array1,
float[] array2,
int first1,
int last1,
int first2,
int last2,
BinaryPredicate p)
Searches, within one range, for a sequence of elements that match the elements in a second range. |
|
Colt 1.0.1 | |||||||||
PREV NEXT | FRAMES NO FRAMES |