Find the first adjacent element.
An iterable ranged container.
A binary function predicates two arguments are equal. Default is equal_to.
Iterator to the first element of adjacent find.
Test whether all elements meet a specific condition.
An iterable ranged container.
A function predicates the specific condition.
Whether the pred returns always true for all elements.
Test whether any element meets a specific condition.
An iterable ranged container.
A function predicates the specific condition.
Whether the pred returns at least a true for all elements.
Test whether a value exists in sorted range.
An iterable ranged container.
Value to search for.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Whether the value exists or not.
Copy elements in range.
An iterable ranged container.
Output iterator of the first position.
Output Iterator of the last position by advancing.
Copy elements reversely.
An iterable ranged container.
Output iterator of the first position.
Output Iterator of the last position by advancing.
Copy specific elements by a condition.
An iterable ranged container.
Output iterator of the first position.
A function predicates the specific condition.
Output Iterator of the last position by advancing.
Copy n elements.
An iterable ranged container.
Number of elements to copy.
Output iterator of the first position.
Output Iterator of the last position by advancing.
Count matched value in range.
An iterable ranged container.
The value to count.
The matched count.
Count matched condition in range.
An iterable ranged container.
A function predicates the specific condition.
The matched count.
Test whether two ranges are equal.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Whether two ranges are equal.
Test whether two ranges are equal.
The 1st iterable ranged container.
The 2nd iterable ranged container.
A binary function predicates two arguments are equal.
Whether two ranges are equal.
Get range of equal elements.
An iterable ranged container.
Value to search for.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Pair of lower_bound and upper_bound.
Fill range elements
An iterable ranged container.
Output Iterator of the last position by advancing.
Fill n elements.
An iterable ranged container.
Number of elements to fill.
Output Iterator of the last position by advancing.
Find a value in range.
An iterable ranged container.
The value to find.
Iterator to the first element to equal_to the value.
Find the last sub range.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Iterator to the first element of the last sub range.
Find the last sub range.
The 1st iterable ranged container.
The 2nd iterable ranged container.
A binary function predicates two arguments are equal.
Iterator to the first element of the last sub range.
Find the first sub range.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Iterator to the first element of the first sub range.
Find the first sub range.
The 1st iterable ranged container.
The 2nd iterable ranged container.
A binary function predicates two arguments are equal.
Iterator to the first element of the first sub range.
Find a matched condition in range.
An iterable ranged container.
A function predicates the specific condition.
Iterator to the first element pred returns true.
Find a mismatched condition in range.
An iterable ranged container.
A function predicates the specific condition.
Iterator to the first element pred returns false.
Apply a function to elements in range.
An iterable ranged container.
The function to apply.
The function fn itself.
Apply a function to elements in steps.
An iterable ranged container.
Steps to maximum advance.
The function to apply.
Iterator advanced from first for n steps.
Generate range elements.
An iterable ranged container.
The generator function.
Generate n elements.
An iterable ranged container.
Number of elements to generate.
The generator function.
Forward Iterator to the last position by advancing.
Test whether two sorted ranges are in inclusion relationship.
The 1st iterable ranged container.
The 2nd iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Whether [first, last1) includes [first2, last2).
Merge two sorted & consecutive ranges.
An iterable ranged container.
Bidirectional iterator of the initial position of the 2nd range.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Test whether a range is heap.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Whether the range is heap.
Find the first element not in heap order.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Iterator to the first element not in heap order.
Test whether a range is partitioned.
An iterable ranged container.
An unary function predicates partition. Returns true, if an element belongs to the first section, otherwise false which means the element belongs to the second section.
Whether the range is partition or not.
Test whether two ranges are in permutation relationship.
The 1st iterable ranged container.
The 2nd iterable ranged container.
A binary function predicates two arguments are equal. Default is equal_to.
Whether permutation or not.
Test whether a range is sorted.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Whether sorted or not.
Find the first unsorted element in range.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Iterator to the first element who violates the order.
Compare lexicographically.
The 1st iterable ranged container.
The 2nd iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Whether the 1st range precedes the 2nd.
Get iterator to lower bound.
An iterable ranged container.
Value to search for.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Iterator to the first element equal or after the val.
Make a heap.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Get the maximum element in range.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Iterator to the maximum element.
Merge two sorted ranges.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Output iterator of the first position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Output Iterator of the last position by advancing.
Get the minimum element in range.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Iterator to the minimum element.
Get the minimum & maximum elements in range.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
A Pair of iterators to the minimum & maximum elements.
Find the first mistmached position between two ranges.
The 1st iterable ranged container.
The 2nd iterable ranged container.
A Pair of mismatched positions.
Find the first mistmached position between two ranges.
The 1st iterable ranged container.
The 2nd iterable ranged container.
A binary function predicates two arguments are equal.
A Pair of mismatched positions.
Transform to the next permutation.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Whether the transformation was meaningful.
Test whether any element doesn't meet a specific condition.
An iterable ranged container.
A function predicates the specific condition.
Whether the pred doesn't return true for all elements.
Rearrange for the n'th element.
An iterable ranged container.
Random access iterator the n'th position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Sort elements in range partially.
An iterable ranged container.
Random access iterator of the middle position between [first, last). Elements only in [first, middle) are fully sorted.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Copy elements in range with partial sort.
An iterable ranged container of input.
An iterable ranged container of output.
Output Iterator of the last position by advancing.
Partition a range into two sections.
An iterable ranged container.
An unary function predicates partition. Returns true, if an element belongs to the first section, otherwise false which means the element belongs to the second section.
Iterator to the first element of the second section.
Partition a range into two outputs.
An iterable ranged container.
Output iterator to the first position for the first section.
Output iterator to the first position for the second section.
An unary function predicates partition. Returns true, if an element belongs to the first section, otherwise false which means the element belongs to the second section.
Iterator to the first element of the second section.
Get partition point.
An iterable ranged container.
An unary function predicates partition. Returns true, if an element belongs to the first section, otherwise false which means the element belongs to the second section.
Iterator to the first element of the second section.
Pop an element from heap.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Transform to the previous permutation.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Whether the transformation was meaningful.
Push an element into heap.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Remove specific value in range.
An iterable ranged container.
The specific value to remove.
Iterator tho the last element not removed.
Copy range removing specific value.
An iterable ranged container.
Output iterator of the last position.
The condition predicates remove.
Output Iterator of the last position by advancing.
Copy range removing elements by a condition.
An iterable ranged container.
Output iterator of the last position.
An unary function predicates remove.
Output Iterator of the last position by advancing.
Remove elements in range by a condition.
An iterable ranged container.
An unary function predicates remove.
Iterator tho the last element not removed.
Replace specific value in range.
An iterable ranged container.
Specific value to change
Specific value to be changed.
Copy range replacing specific value.
An iterable ranged container.
Output iterator of the first position.
Specific value to change
Specific value to be changed.
Output Iterator of the last position by advancing.
Copy range replacing specfic condition.
An iterable ranged container.
Output iterator of the first position.
An unary function predicates the change.
Specific value to be changed.
Output Iterator of the last position by advancing.
Replace specific condition in range.
An iterable ranged container.
An unary function predicates the change.
Specific value to be changed.
Reverse elements in range.
An iterable ranged container.
Copy reversed elements in range.
An iterable ranged container.
Output iterator of the first position.
Output Iterator of the last position by advancing.
Rotate elements in range.
An iterable ranged container.
Input iteartor of the initial position of the right side.
Input iterator of the final position in the left side; middle.
Copy rotated elements in range.
An iterable ranged container.
Input iteartor of the initial position of the right side.
Output iterator of the last position.
Output Iterator of the last position by advancing.
Pick sample elements up.
An iterable ranged container.
Number of elements to pick up.
Output Iterator of the last position by advancing.
Search sub range.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Iterator to the first element of the sub range.
Search sub range.
The 1st iterable ranged container.
The 2nd iterable ranged container.
A binary function predicates two arguments are equal.
Iterator to the first element of the sub range.
Search specific and repeated elements.
An iterable ranged container.
Count to be repeated.
Value to search.
A binary function predicates two arguments are equal. Default is equal_to.
Iterator to the first element of the repetition.
Combine two sorted ranges to difference relationship.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Output iterator of the first position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Output Iterator of the last position by advancing.
Combine two sorted ranges to intersection relationship.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Output iterator of the first position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Output Iterator of the last position by advancing.
Combine two sorted ranges to symmetric difference relationship.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Output iterator of the first position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Output Iterator of the last position by advancing.
Combine two sorted ranges to union relationship.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Output iterator of the first position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Output Iterator of the last position by advancing.
Shuffle elements in range.
An iterable ranged container.
Sort elements in range.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Sort elements of a heap.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Partition a range into two sections with stable ordering.
An iterable ranged container.
An unary function predicates partition. Returns true, if an element belongs to the first section, otherwise false which means the element belongs to the second section.
Iterator to the first element of the second section.
Sort elements in range stably.
An iterable ranged container.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Swap values of two ranges.
The 1st iterable ranged container.
The 2nd iterable ranged container.
Forward Iterator of the last position of the 2nd range by advancing.
Transform elements.
An iterable ranged container.
Unary function determines the transform.
Output Iterator of the last position by advancing.
Transform elements.
Binary function determines the transform.
Output Iterator of the last position by advancing.
Remove duplicated elements in sorted range.
An iterable ranged container.
A binary function predicates two arguments are equal. Default is equal_to.
Input iterator to the last element not removed.
Copy elements in range without duplicates.
An iterable ranged container.
Output iterator of the last position.
A binary function predicates two arguments are equal. Default is equal_to.
Output Iterator of the last position by advancing.
Get iterator to upper bound.
An iterable ranged container.
Value to search for.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Iterator to the first element after the key.
Generated using TypeDoc
Ranged Features