Find the first adjacent element.
Input iteartor of the first position.
Input iterator of the last position.
A binary function predicates two arguments are equal. Default is equal_to.
Iterator to the first element of adjacent find.
Advance iterator.
Target iterator to advance.
Step to advance.
The advanced iterator.
Test whether all elements meet a specific condition.
Input iteartor of the first position.
Input iterator of the last position.
A function predicates the specific condition.
Whether the pred returns always true for all elements.
Test whether any element meets a specific condition.
Input iteartor of the first position.
Input iterator of the last position.
A function predicates the specific condition.
Whether the pred returns at least a true for all elements.
Associated laguerre polynomials.
Associated Legendre polynomials.
Construct back insert iterator.
Target container.
The insert iterator object.
Iterator to the first element.
Target container.
Iterator to the first element.
Beta function.
Test whether a value exists in sorted range.
Input iterator of the first position.
Input iterator of the last position.
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.
Get the clamp value.
The value to clamp.
Lower value than hi.
Higher value than lo.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
The clamp value.
Complete elliptic integral of the 1st kind.
Complete elliptic integral of the 2nd kind.
Complete elliptic integral of the 3rd kind.
Copy elements in range.
Input iteartor of the first position.
Input iterator of the last position.
Output iterator of the first position.
Output Iterator of the last position by advancing.
Copy elements reversely.
Input iteartor of the first position.
Input iterator of the last position.
Output iterator of the first position.
Output Iterator of the last position by advancing.
Copy specific elements by a condition.
Input iteartor of the first position.
Input iterator of the last position.
Output iterator of the first position.
A function predicates the specific condition.
Output Iterator of the last position by advancing.
Copy n elements.
Input iteartor of the first position.
Number of elements to copy.
Output iterator of the first position.
Output Iterator of the last position by advancing.
Count matched value in range.
Input iteartor of the first position.
Input iterator of the last position.
The value to count.
The matched count.
Count matched condition in range.
Input iteartor of the first position.
Input iterator of the last position.
A function predicates the specific condition.
The matched count.
Modified cylindrical Bessel function of the 1st kind.
Bessel function of the 1st kind.
Modified cylindrical Bessel function of the 2nd kind.
Bessel function of the 2nd kind.
Get distance between two iterators.
Input iteartor of the first position.
Input iterator of the last position.
The distance.
Incomplete elliptic integral of the 1st kind.
Incomplete elliptic integral of the 2nd kind.
Incomplete elliptic integral of the 3rd kind.
Test whether a container is empty.
Target container.
Whether empty or not.
Iterator to the end.
Target container.
Iterator to the end.
Test whether two ranges are equal.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Whether two ranges are equal.
Test whether two ranges are equal.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
A binary function predicates two arguments are equal.
Whether two ranges are equal.
Get range of equal elements.
Input iterator of the first position.
Input iterator of the last position.
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.
Test whether two arguments are equal.
The first argument to compare.
The second argument to compare.
Whether two arguments are equal or not.
Exponential integral.
Fill range elements
Input iteartor of the first position.
Input iterator of the last position.
The value to fill.
Output Iterator of the last position by advancing.
Fill n elements.
Input iteartor of the first position.
Number of elements to fill.
The value to fill.
Output Iterator of the last position by advancing.
Find a value in range.
Input iteartor of the first position.
Input iterator of the last position.
The value to find.
Iterator to the first element to equal_to the value.
Find the last sub range.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last position of the 2nd range.
Iterator to the first element of the last sub range.
Find the last sub range.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last position of the 2nd range.
A binary function predicates two arguments are equal.
Iterator to the first element of the last sub range.
Find the first sub range.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last position of the 2nd range.
Iterator to the first element of the first sub range.
Find the first sub range.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last position of the 2nd range.
A binary function predicates two arguments are equal.
Iterator to the first element of the first sub range.
Find a matched condition in range.
Input iteartor of the first position.
Input iterator of the last position.
A function predicates the specific condition.
Iterator to the first element pred returns true.
Find a mismatched condition in range.
Input iteartor of the first position.
Input iterator of the last position.
A function predicates the specific condition.
Iterator to the first element pred returns false.
Apply a function to elements in range.
Input iteartor of the first position.
Input iterator of the last position.
The function to apply.
The function fn itself.
Apply a function to elements in steps.
Input iteartor of the starting position.
Steps to maximum advance.
The function to apply.
Iterator advanced from first for n steps.
Construct front insert iterator.
Target container.
The front insert iterator object.
Greatest Common Divider.
Generate range elements.
Forward iteartor of the first position.
Forward iterator of the last position.
The generator function.
Generate n elements.
Forward iteartor of the first position.
Number of elements to generate.
The generator function.
Forward Iterator to the last position by advancing.
Get terminate handler.
The terminate handler.
Get unique identifier.
Target object.
The identifier number.
Test whether x is greater than y.
The first argument to compare.
The second argument to compare.
Whether x is greater than y.
Test whether x is greater than or equal to y.
The first argument to compare.
The second argument to compare.
Whether x is greater than or equal to y.
Hash function.
The items to be hashed.
The hash code.
Hermite polynomial
Test whether two sorted ranges are in inclusion relationship.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last 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.
Whether [first, last1) includes [first2, last2).
Merge two sorted & consecutive ranges.
Bidirectional iterator of the first position.
Bidirectional iterator of the initial position of the 2nd range.
Bidirectional iterator of the last position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Construct insert iterator.
Target container.
Iterator to the first insertion position.
The insert iterator object.
Test whether a range is heap.
Bi-directional iteartor of the first position.
Bi-directional iterator of the last position.
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.
Bi-directional iteartor of the first position.
Bi-directional iterator of the last position.
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 the code is running on NodeJS.
Whether NodeJS or not.
Test whether a range is partitioned.
Forward iterator of the first position.
Forward iterator of the last position.
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.
Forward iteartor of the first position of the 1st range.
Forward iterator of the last position of the 1st range.
Forward iterator of the first position of the 2nd range.
A binary function predicates two arguments are equal. Default is equal_to.
Whether permutation or not.
Test whether a range is sorted.
Input iterator of the first position.
Input iterator of the last position.
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.
Input iterator of the first position.
Input iterator of the last position.
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.
Swap values of two iterators.
Forward iterator to swap its value.
Forward iterator to swap its value.
Laguerre polynomials.
Least Common Multiple.
Legendre polynomials.
Test whether x is less than y.
The first argument to compare.
The second argument to compare.
Whether x is less than y.
Test whether x is less than or equal to y.
The first argument to compare.
The second argument to compare.
Whether x is less than or equal to y.
Compare lexicographically.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last 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.
Whether the 1st range precedes the 2nd.
Log gamma function.
Lock multiple mutexes.
Items to lock.
Get iterator to lower bound.
Input iterator of the first position.
Input iterator of the last position.
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.
Random access iteartor of the first position.
Random access iterator of the last position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Construct reverse iterator.
Target iterator that reversable.
The reverse iterator object.
Get the maximum value.
Items to search through.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
The maximum value.
Get the maximum element in range.
Forward iterator of the first position.
Forward iterator of the last position.
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.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last position of the 2nd range.
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 minium value.
Items to search through.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
The minimum value.
Get the minimum element in range.
Forward iterator of the first position.
Forward iterator of the last position.
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.
Forward iterator of the first position.
Forward iterator of the last position.
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.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
A Pair of mismatched positions.
Find the first mistmached position between two ranges.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
A binary function predicates two arguments are equal.
A Pair of mismatched positions.
Get next iterator.
Iterator to move.
Step to move next.
Iterator moved to next n steps.
Transform to the next permutation.
Bidirectional iterator of the first position.
Bidirectional iterator of the last position.
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.
Input iteartor of the first position.
Input iterator of the last position.
A function predicates the specific condition.
Whether the pred doesn't return true for all elements.
Test whether two arguments are not equal.
The first argument to compare.
The second argument to compare.
Returns true, if two arguments are not equal, otherwise false.
Rearrange for the n'th element.
Random access iterator of the first position.
Random access iterator the n'th position.
Random access iterator of the last 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.
Random access iterator of the first position.
Random access iterator of the middle position between [first, last). Elements only in [first, middle) are fully sorted.
Random access iterator of the last position.
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.
Input iteartor of the first position.
Input iterator of the last position.
Output iterator of the first position.
Output iterator of the last 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.
Partition a range into two sections.
Bidirectional iterator of the first position.
Bidirectional iterator of the last position.
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.
Bidirectional iterator of the first position.
Bidirectional iterator of the last position.
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.
Forward iterator of the first position.
Forward iterator of the last position.
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.
Random access iteartor of the first position.
Random access iterator of the last position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Get previous iterator.
Iterator to move.
Step to move prev.
An iterator moved to prev n steps.
Transform to the previous permutation.
Bidirectional iterator of the first position.
Bidirectional iterator of the last position.
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.
Random access iteartor of the first position.
Random access iterator of the last position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Generate random integer.
Minimum value.
Maximum value.
A random integer between [x, y].
Get reverse iterator to the first element in reverse.
Target container.
The reverse iterator to the first.
Remove specific value in range.
Input iteartor of the first position.
Input iterator of the last position.
The specific value to remove.
Iterator tho the last element not removed.
Copy range removing specific value.
Input iteartor of the first position.
Input iterator of the last position.
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.
Input iteartor of the first position.
Input iterator of the last position.
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.
Input iteartor of the first position.
Input iterator of the last position.
An unary function predicates remove.
Iterator tho the last element not removed.
Get reverse iterator to the reverse end.
Target container.
The reverse iterator to the end.
Replace specific value in range.
Input iteartor of the first position.
Input iterator of the last position.
Specific value to change
Specific value to be changed.
Copy range replacing specific value.
Input iteartor of the first position.
Input iterator of the last position.
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.
Input iteartor of the first position.
Input iterator of the last 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.
Input iteartor of the first position.
Input iterator of the last position.
An unary function predicates the change.
Specific value to be changed.
Reverse elements in range.
Bidirectional iterator of the first position.
Bidirectional iterator of the last position.
Copy reversed elements in range.
Bidirectional iterator of the first position.
Bidirectional iterator of the last position.
Output iterator of the first position.
Output Iterator of the last position by advancing.
Riemann zeta function.
Rotate elements in range.
Input iteartor of the first position.
Input iteartor of the initial position of the right side.
Input iteartor of the last position.
Input iterator of the final position in the left side; middle.
Copy rotated elements in range.
Input iteartor of the first position.
Input iteartor of the initial position of the right side.
Input iteartor of the last position.
Output iterator of the last position.
Output Iterator of the last position by advancing.
Pick sample elements up.
Input iteartor of the first position.
Input iterator of the last position.
Output iterator of the first position.
Number of elements to pick up.
Output Iterator of the last position by advancing.
Search sub range.
Forward iteartor of the first position of the 1st range.
Forward iterator of the last position of the 1st range.
Forward iterator of the first position of the 2nd range.
Forward iterator of the last position of the 2nd range.
Iterator to the first element of the sub range.
Search sub range.
Forward iteartor of the first position of the 1st range.
Forward iterator of the last position of the 1st range.
Forward iterator of the first position of the 2nd range.
Forward iterator of the last position of the 2nd range.
A binary function predicates two arguments are equal.
Iterator to the first element of the sub range.
Search specific and repeated elements.
Forward iteartor of the first position.
Forward iterator of the last position.
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.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last position of the 2nd range.
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.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last position of the 2nd range.
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.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last position of the 2nd range.
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.
Set terminate handler.
The terminate handler.
Combine two sorted ranges to union relationship.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Input iterator of the last position of the 2nd range.
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.
Random access iteartor of the first position.
Random access iteartor of the last position.
Get number of elements of a container.
Target container.
The number of elements in the container.
Sleep for time span.
The milliseconds to sleep.
Sleep until time expiration.
The time point to wake up.
Sort elements in range.
Random access iterator of the first position.
Random access iterator of the last position.
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.
Random access iteartor of the first position.
Random access iterator of the last position.
A binary function predicates x element would be placed before y. When returns true, then x precedes y. Default is less.
Spherical Bessel function of the 1st kind.
Spherical Bessel function of the 2nd kind.
Partition a range into two sections with stable ordering.
Bidirectional iterator of the first position.
Bidirectional iterator of the last position.
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.
Random access iterator of the first position.
Random access iterator of the last position.
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.
Forward iteartor of the first position of the 1st range.
Forward iterator of the last position of the 1st range.
Forward iterator of the first position of the 2nd range.
Forward Iterator of the last position of the 2nd range by advancing.
Terminate program.
Gamma function.
Transform elements.
Input iteartor of the first position.
Input iterator of the last position.
Unary function determines the transform.
Output Iterator of the last position by advancing.
Transform elements.
Input iteartor of the first position of the 1st range.
Input iterator of the last position of the 1st range.
Input iterator of the first position of the 2nd range.
Binary function determines the transform.
Output Iterator of the last position by advancing.
Try lock mutexes.
Items to try lock.
Index of mutex who failed to lock. None of them're failed, then returns -1.
Remove duplicated elements in sorted range.
Input iteartor of the first position.
Input iterator of the last position.
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.
Input iteartor of the first position.
Input iterator of the last position.
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.
Input iterator of the first position.
Input iterator of the last position.
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
TSTL - TypeScript Standard Template Library