| Function |
Header |
Standard |
VBCC |
GCC |
SAS/C |
DICE |
Notes |
| for_each |
algorithm |
C++98 |
|
|
STLport |
|
Apply function to range |
| find |
algorithm |
C++98 |
|
|
STLport |
|
Find value in range |
| find_if |
algorithm |
C++98 |
|
|
STLport |
|
Find element satisfying condition |
| find_end |
algorithm |
C++98 |
|
|
STLport |
|
Find last subsequence |
| find_first_of |
algorithm |
C++98 |
|
|
STLport |
|
Find element from set |
| adjacent_find |
algorithm |
C++98 |
|
|
STLport |
|
Find adjacent equal elements |
| count |
algorithm |
C++98 |
|
|
STLport |
|
Count occurrences of value |
| count_if |
algorithm |
C++98 |
|
|
STLport |
|
Count elements satisfying condition |
| mismatch |
algorithm |
C++98 |
|
|
STLport |
|
Find first mismatch |
| equal |
algorithm |
C++98 |
|
|
STLport |
|
Test if ranges are equal |
| search |
algorithm |
C++98 |
|
|
STLport |
|
Search for subsequence |
| search_n |
algorithm |
C++98 |
|
|
STLport |
|
Search for n consecutive elements |
| copy |
algorithm |
C++98 |
|
|
STLport |
|
Copy range |
| copy_backward |
algorithm |
C++98 |
|
|
STLport |
|
Copy range backward |
| swap |
algorithm |
C++98 |
|
|
STLport |
|
Swap values |
| swap_ranges |
algorithm |
C++98 |
|
|
STLport |
|
Swap ranges |
| iter_swap |
algorithm |
C++98 |
|
|
STLport |
|
Swap pointed-to elements |
| transform |
algorithm |
C++98 |
|
|
STLport |
|
Transform range |
| replace |
algorithm |
C++98 |
|
|
STLport |
|
Replace values |
| replace_if |
algorithm |
C++98 |
|
|
STLport |
|
Replace elements satisfying condition |
| replace_copy |
algorithm |
C++98 |
|
|
STLport |
|
Copy range replacing values |
| replace_copy_if |
algorithm |
C++98 |
|
|
STLport |
|
Copy range replacing elements |
| fill |
algorithm |
C++98 |
|
|
STLport |
|
Fill range with value |
| fill_n |
algorithm |
C++98 |
|
|
STLport |
|
Fill n elements with value |
| generate |
algorithm |
C++98 |
|
|
STLport |
|
Generate values for range |
| generate_n |
algorithm |
C++98 |
|
|
STLport |
|
Generate n values |
| remove |
algorithm |
C++98 |
|
|
STLport |
|
Remove values |
| remove_if |
algorithm |
C++98 |
|
|
STLport |
|
Remove elements satisfying condition |
| remove_copy |
algorithm |
C++98 |
|
|
STLport |
|
Copy range removing values |
| remove_copy_if |
algorithm |
C++98 |
|
|
STLport |
|
Copy range removing elements |
| unique |
algorithm |
C++98 |
|
|
STLport |
|
Remove consecutive duplicates |
| unique_copy |
algorithm |
C++98 |
|
|
STLport |
|
Copy range removing consecutive duplicates |
| reverse |
algorithm |
C++98 |
|
|
STLport |
|
Reverse range |
| reverse_copy |
algorithm |
C++98 |
|
|
STLport |
|
Copy range in reverse |
| rotate |
algorithm |
C++98 |
|
|
STLport |
|
Rotate range |
| rotate_copy |
algorithm |
C++98 |
|
|
STLport |
|
Copy rotated range |
| random_shuffle |
algorithm |
C++98 |
|
|
STLport |
|
Randomly shuffle range |
| shuffle |
algorithm |
C++11 |
|
|
Missing |
|
Shuffle range with random generator |
| partition |
algorithm |
C++98 |
|
|
STLport |
|
Partition range |
| stable_partition |
algorithm |
C++98 |
|
|
STLport |
|
Stable partition range |
| sort |
algorithm |
C++98 |
|
|
STLport |
|
Sort range |
| stable_sort |
algorithm |
C++98 |
|
|
STLport |
|
Stable sort range |
| partial_sort |
algorithm |
C++98 |
|
|
STLport |
|
Partially sort range |
| partial_sort_copy |
algorithm |
C++98 |
|
|
STLport |
|
Copy partially sorted range |
| nth_element |
algorithm |
C++98 |
|
|
STLport |
|
Sort nth element |
| lower_bound |
algorithm |
C++98 |
|
|
STLport |
|
Find lower bound |
| upper_bound |
algorithm |
C++98 |
|
|
STLport |
|
Find upper bound |
| equal_range |
algorithm |
C++98 |
|
|
STLport |
|
Find equal range |
| binary_search |
algorithm |
C++98 |
|
|
STLport |
|
Binary search |
| merge |
algorithm |
C++98 |
|
|
STLport |
|
Merge sorted ranges |
| inplace_merge |
algorithm |
C++98 |
|
|
STLport |
|
Merge sorted ranges in place |
| includes |
algorithm |
C++98 |
|
|
STLport |
|
Test if range includes another |
| set_union |
algorithm |
C++98 |
|
|
STLport |
|
Union of sorted ranges |
| set_intersection |
algorithm |
C++98 |
|
|
STLport |
|
Intersection of sorted ranges |
| set_difference |
algorithm |
C++98 |
|
|
STLport |
|
Difference of sorted ranges |
| set_symmetric_difference |
algorithm |
C++98 |
|
|
STLport |
|
Symmetric difference of sorted ranges |
| push_heap |
algorithm |
C++98 |
|
|
STLport |
|
Push element to heap |
| pop_heap |
algorithm |
C++98 |
|
|
STLport |
|
Pop element from heap |
| make_heap |
algorithm |
C++98 |
|
|
STLport |
|
Make heap from range |
| sort_heap |
algorithm |
C++98 |
|
|
STLport |
|
Sort heap |
| is_heap |
algorithm |
C++11 |
|
|
Missing |
|
Test if range is heap |
| is_heap_until |
algorithm |
C++11 |
|
|
Missing |
|
Find end of heap |
| min |
algorithm |
C++98 |
|
|
STLport |
|
Minimum of two values |
| max |
algorithm |
C++98 |
|
|
STLport |
|
Maximum of two values |
| minmax |
algorithm |
C++11 |
|
|
Missing |
|
Minimum and maximum of two values |
| min_element |
algorithm |
C++98 |
|
|
STLport |
|
Minimum element in range |
| max_element |
algorithm |
C++98 |
|
|
STLport |
|
Maximum element in range |
| minmax_element |
algorithm |
C++11 |
|
|
Missing |
|
Minimum and maximum elements in range |
| lexicographical_compare |
algorithm |
C++98 |
|
|
STLport |
|
Lexicographical comparison |
| next_permutation |
algorithm |
C++98 |
|
|
STLport |
|
Next permutation |
| prev_permutation |
algorithm |
C++98 |
|
|
STLport |
|
Previous permutation |
| all_of |
algorithm |
C++11 |
|
|
Missing |
|
Test if all elements satisfy condition |
| any_of |
algorithm |
C++11 |
|
|
Missing |
|
Test if any element satisfies condition |
| none_of |
algorithm |
C++11 |
|
|
Missing |
|
Test if no element satisfies condition |
| is_permutation |
algorithm |
C++11 |
|
|
Missing |
|
Test if range is permutation |
| copy_if |
algorithm |
C++11 |
|
|
Missing |
|
Copy elements satisfying condition |
| copy_n |
algorithm |
C++11 |
|
|
Missing |
|
Copy n elements |
| move |
algorithm |
C++11 |
|
|
Missing |
|
Move range |
| move_backward |
algorithm |
C++11 |
|
|
Missing |
|
Move range backward |
| is_sorted |
algorithm |
C++11 |
|
|
Missing |
|
Test if range is sorted |
| is_sorted_until |
algorithm |
C++11 |
|
|
Missing |
|
Find end of sorted range |
| is_partitioned |
algorithm |
C++11 |
|
|
Missing |
|
Test if range is partitioned |
| partition_copy |
algorithm |
C++11 |
|
|
Missing |
|
Copy partitioned range |
| partition_point |
algorithm |
C++11 |
|
|
Missing |
|
Find partition point |
| is_heap_until |
algorithm |
C++11 |
|
|
Missing |
|
Find end of heap |
| clamp |
algorithm |
C++17 |
|
|
Missing |
|
Clamp value to range |
| TOTALS |
|
|
0/86 |
0/86 |
66/86 |
0/86 |
|