-
Notifications
You must be signed in to change notification settings - Fork 7
algorithm
Defined in header <ctl/algorithm.h>, which is currently always included for all containers.
#include <ctl/deque.h>
int int_is_odd(int* a) {
return *a % 2;
}
deq_int a = deq_int_init ();
deq_int_resize (&a, 100);
for (int i=0; i<100; i++)
deq_int_push_front (&a, rand());
printf ("%zu odd members in deque\n",
deq_int_count_if (&a, is_odd));
deq_int_free(&a);
The algorithms library implements functions for a variety of purposes
(e.g. searching, sorting, counting, manipulating) that operate on all or on
ranges of elements via generic iterators. Note that a range is defined as
[first, last) where last refers to the element past the last element to
inspect or modify.
range variants are specified with the _range suffix, without they operate on
all elements on the container.
There are no execution policies yet, but I am planning a pctl,
i.e. parallel_policy and parallel_unsequenced_policy
for various backends like openmp or TBB.
unordered_set does not support ranges, nor count functions ending with _n.
Such iterators on unordered_set make not much sense, as the order is random.
T value type
A being list_T container type
B being list_T_node node type
I being list_T_it iterator type
bool all_of (A* self, int _match(T*)) (C++11)
bool any_of `(A* self, int _match(T*)) (C++11)
bool none_of (A* self, int _match(T*)) (C++11)
bool all_of_range (I* first, I* last, int _match(T*)) (C++20)
bool any_of_range (I* first, I* last, int _match(T*)) (C++20)
bool none_of_range (I* first, I* last, int _match(T*)) (C++20)
checks if a predicate is true for all, any or none of the elements in a range
foreach (A, self, iter) {...}
foreach_range (A, iter, first, last) {...} (C++20)
applies a block to a range of elements with iter.
foreach_n (A, self, n) {...} (C++17)
foreach_n_range (A, first, n) {...} (C++20)
applies a block with iter to the first n elements of a sequence.
size_t count (A* self, T value)
size_t count_if (A* self, int _match(T*))
size_t count_range (I* first, I* last, T value) (C++20)
size_t count_if_range (I* first, I *last, int _match(T*)) (C++20)
returns the number of elements satisfying specific criteria.
I mismatch (I* first1, I *last1, I* first2)
I mismatch_range (I* first1, I *last1, I* first2, I* last2) (C++20)
finds the first position where two ranges differ. (NYI)
I find (A* self, T* value)
I find_if (A* self, int _match(T*))
I find_if_not (A* self, int _match(T*)) (C++11)
I find_range (I* first, I* last, T value) (C++20)
I find_if_range (I* first, I* last, int _match(T*)) (C++20)
I find_if_not_range (I* first, I* last, int _match(T*)) (C++20)
finds the first element satisfying specific criteria. Returns a fresh iterator I. Does not consume/free the T key.
I find_end
I find_end_range (C++20)
finds the last sequence of elements in a certain range. (NYI)
I find_first_of
I find_first_of_range (C++20)
searches for any one of a set of elements. (NYI)
I adjacent_find
I adjacent_find_range (C++20)
finds the first two adjacent items that are equal (or satisfy a given predicate). (NYI)
I search
I search_range (C++20)
searches for a range of elements. (NYI)
I search_n
searches a range for a number of consecutive copies of an element. (NYI)
copy
copy_if (C++11)
copy_range (C++20)
copy_if_range (C++20)
copies a range of elements to a new location. (NYI)
copy_n (C++11)
copy_n_range (C++20)
copies a number of elements to a new location. (NYI)
copy_backward
copy_backward_range (C++20)
copies a range of elements in backwards order. (NYI)
move (C++11)
move_range (C++20)
moves a range of elements to a new location. (NYI)
move_backward (C++11)
move_backward_range (C++20)
moves a range of elements to a new location in backwards order. (NYI)
fill
fill_range (C++20)
copy-assigns the given value to every element in a range. (NYI) assigns a range of elements a certain value.
fill_n
fill_n_range (C++20)
copy-assigns the given value to N elements in a range. (NYI) assigns a value to a number of elements
A transform (A* self, T unop(T*))
A transform_it (A* self, I* pos, T _binop(T*, T*)) (only string yet)
I transform_range (I* first1, I* last1, I dest, T _unop(T*)) (NY)
I transform_it_range (I* first1, I* last1, I* pos, I dest,
T _binop(T*, T*)) (NY)
applies a function to a range of elements. Returning results in a copy, or for
the range variants in an output iterator dest. unop takes the iterator
element, binop takes as 2nd argument the 2nd iterator pos.
The output iterator dest is not yet supported.
generate (A* self, T _gen(void))
generate_range (I* first, I* last, T _gen(void)) (C++20)
assigns the results of successive function calls to every element in a range. Not for ordered containers.
generate_n (A* self, size_t count, T _gen(void))
generate_n_range (I* first, size_t count, T _gen(void)) (C++20)
assigns the results of successive function calls to N elements in a range. Not for ordered containers (set, map) nor unordered_set.
size_t remove (A* self, T value)
size_t remove_if (A* self, int _match(T*)
remove_range (C++20)
remove_if_range (C++20)
removes elements satisfying specific criteria. (Partially implemented)
remove_copy
remove_copy_if
remove_copy_range (C++20)
remove_copy_if_range (C++20)
copies a range of elements omitting those that satisfy specific criteria. (NYI)
replace
replace_if
replace_range (C++20)
replace_if_range (C++20)
replaces all values satisfying specific criteria with another value. (NYI)
replace_copy
replace_copy_if
replace_copy_range
replace_copy_if_range
copies a range, replacing elements satisfying specific criteria with another value. (NYI)
swap (A* self, A* other)
swaps the values of two objects.
swap_ranges (C++20)
swaps two ranges of elements. (NYI)
iter_swap
swaps the elements pointed to by two iterators. (NYI)
reverse (A* self)
reverse_range (C++20)
reverses the order of elements in a range. (range NYI)
reverse_copy
reverse_copy_range (C++20)
creates a copy of a range that is reversed. (NYI)
rotate
rotate_range (C++20)
rotates the order of elements in a range. (NYI)
rotate_copy
rotate_copy_range (C++20)
copies and rotate a range of elements. (NYI)
shift_left
shift_right (C++20)
shifts elements in a range. (NYI)
random_shuffle (until C++17)
shuffle (C++11)
shuffle_range (C++20)
randomly re-orders elements in a range. (NYI)
sample (C++17)
sample_range (C++20)
selects n random elements from a sequence. (NYI)
unique (A* self)
unique_range (C++20)
removes consecutive duplicate elements in a range. (range NYI)
unique_copy
unique_copy_range (C++20)
creates a copy of some range of elements that contains no consecutive duplicates. (NYI)
is_partitioned (C++11)
is_partitioned_range (C++20)
determines if the range is partitioned by the given predicate. (NYI)
partition
partition_range (C++20)
divides a range of elements into two groups. (NYI)
partition_copy (C++11)
partition_copy_range (C++20)
copies a range dividing the elements into two groups. (NYI)
stable_partition
stable_partition_range (C++20)
divides elements into two groups while preserving their relative order. (NYI)
partition_point (C++11)
partition_point_range (C++20)
locates the partition point of a partitioned range. (NYI)
bool is_sorted (C++11)
bool is_sorted_range (C++20)
checks whether a range is sorted into ascending order. (NYI)
bool is_sorted_until (C++11)
bool is_sorted_until_range (C++20)
finds the largest sorted subrange. (NYI)
sort
sort_range (C++20)
sorts a range into ascending order.
partial_sort
partial_sort_range (C++20)
sorts the first N elements of a range. (NYI)
partial_sort_copy
partial_sort_copy_range (C++20)
copies and partially sorts a range of elements. (NYI)
stable_sort
stable_sort_range (C++20)
sorts a range of elements while preserving order between equal elements. (NYI)
nth_element
nth_element_range (C++20)
partially sorts the given range making sure that it is partitioned by the given element. (NYI)
I lower_bound (A* self, T value)
I lower_bound_range (I* first, I* last, T value) (C++20)
returns an iterator to the first element not less than the given value. (NYI)
I upper_bound (A* self, T value)
I upper_bound_range (I* first, I* last, T value) (C++20)
returns an iterator to the first element greater than a certain value. (NYI)
binary_search
binary_search_range (C++20)
determines if an element exists in a certain range. (NYI)
bool equal_range
bool equal_range_range (C++20)
returns range of elements matching a specific key. (NYI)
A merge (A* self, A* other)
merge_range (C++20)
merges two sorted ranges. (range NYI)
inplace_merge
inplace_merge_range (C++20)
merges two ordered ranges in-place. (NYI)
includes
includes_range (C++20)
returns true if one sequence is a subsequence of another. (NYI)
A difference (A* self, A* other)
difference_range (C++20)
computes the difference between two sets. (range NYI)
A intersection (A* self, A* other)
intersection_range (C++20)
computes the intersection of two sets. (range NYI)
A symmetric_difference (A* self, A* other)
symmetric_difference_range (C++20)
computes the symmetric difference between two sets. (range NYI)
A union (A* self, A* other)
union_range (C++20)
computes the union of two sets. (range NYI)
bool is_heap (C++11)
bool is_heap_range (C++20)
checks if the given range is a max heap. (NYI)
bool is_heap_until (C++11)
bool is_heap_until_range (C++20)
finds the largest subrange that is a max heap. (NYI)
make_heap
make_heap_range (C++20)
creates a max heap out of a range of elements. (NYI)
push_heap
push_heap_range (C++20)
adds an element to a max heap. (NYI)
pop_heap
pop_heap_range (C++20)
removes the largest element from a max heap. (NYI)
sort_heap
sort_heap_range (C++20)
turns a max heap into a range of elements sorted in ascending order. (NYI)
T max
T max_range (C++20)
returns the greater of the given values. (NYI)
T max_element
T max_element_range (C++20)
returns the largest element in a range. (NYI)
T min
T min_range (C++20)
returns the smaller of the given values. (NYI)
T min_element
T min_element_range (C++20)
returns the smallest element in a range. (NYI)
T minmax (C++11)
T minmax_range (C++20)
returns the smaller and larger of two elements. (NYI)
T minmax_element (C++11)
T minmax_element_range (C++20)
returns the smallest and the largest elements in a range. (NYI)
clamp (C++17)
clamp_range (C++20)
clamps a value between a pair of boundary values. (NYI)
int equal (A* self, A* other)
equal_range (C++20)
determines if two sets of elements are the same
int lexicographical_compare
int lexicographical_compare_range (C++20)
returns true if one range is lexicographically less than another. (NYI)
int lexicographical_compare_three_way (C++20)
compares two ranges using three-way comparison. (NYI)
bool is_permutation (C++11)
bool is_permutation_range (C++20)
determines if a sequence is a permutation of another sequence. (NYI)
next_permutation
next_permutation_range (C++20)
generates the next greater lexicographic permutation of a range of elements. (NYI)
prev_permutation
prev_permutation_range (C++20)
generates the next smaller lexicographic permutation of a range of elements. (NYI)
See numeric
See memory