Colt 1.0.1

Uses of Interface
jal.INT.BinaryPredicate

Packages that use BinaryPredicate
jal.INT Algorithms on int arrays; A partial STL port by the C++ Standard Template Library authors. 
 

Uses of BinaryPredicate in jal.INT
 

Classes in jal.INT that implement BinaryPredicate
 class Equals
          A function object that represents a binary predicate: tests whether two elements are equal.
 

Methods in jal.INT with parameters of type BinaryPredicate
static void sort(int[] array, int first, int last, BinaryPredicate comp)
          Sort a range of elements by a user-supplied comparison function.
static void insertion_sort(int[] array, int first, int last, BinaryPredicate comp)
          Sort a range of elements by a user-supplied comparison function.
static void stable_sort(int[] array, int first, int last, BinaryPredicate comp)
          Sort a range of elements by a user-supplied comparison function.
static void partial_sort(int[] 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(int[] source, int[] 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(int[] 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(int[] array, int first, int last, int 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(int[] array, int first, int last, int 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(int[] array, int first, int last, int 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(int[] array, int first, int last, int 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(int[] source1, int[] source2, int[] 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(int[] array, int first, int middle, int last, BinaryPredicate comp)
          Transforms two consecutive sorted ranges into a single sorted range.
static boolean includes(int[] array1, int[] 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(int[] source1, int[] source2, int[] 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(int[] source1, int[] source2, int[] 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(int[] source1, int[] source2, int[] 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(int[] source1, int[] source2, int[] 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(int[] array, int first, int last, BinaryPredicate comp)
          Adds an element to a heap.
static void pop_heap(int[] array, int first, int last, BinaryPredicate comp)
          Removes the largest element from a heap.
static void make_heap(int[] array, int first, int last, BinaryPredicate comp)
          Turns the range [first, last) into a heap.
static void sort_heap(int[] 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(int[] array, int first, int last, BinaryPredicate comp)
          Finds the largest element in a range.
static int min_element(int[] array, int first, int last, BinaryPredicate comp)
          Finds the smallest element in a range.
static boolean lexicographical_compare(int[] array1, int[] 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(int[] 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(int[] 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 unique(int[] 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(int[] source, int[] 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 int adjacent_find(int[] array, int first, int last, BinaryPredicate p)
          Finds the first adjacent pair of elements in a range that satisfy some condition.
static int mismatch(int[] array1, int[] 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(int[] array1, int[] array2, int first1, int last1, int first2, BinaryPredicate p)
          Tests whether two ranges satisfiy a condition pairwise.
static int search(int[] array1, int[] 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

Submit a bug or feature. Check the Colt home page for the latest news.