Difference between revisions of "cpp/header/numeric"
From cppreference.com
m |
(move <numeric> synopsis to template) |
||
| (6 intermediate revisions by 2 users not shown) | |||
| Line 2: | Line 2: | ||
{{cpp/header/navbar}} | {{cpp/header/navbar}} | ||
| − | This header is part of the | + | This header is part of the {{lt|cpp/numeric}} library. |
{{dsc begin}} | {{dsc begin}} | ||
| − | {{dsc h1 | Functions}} | + | {{dsc h1|Functions}} |
| − | {{dsc inc | cpp/algorithm/dsc iota}} | + | {{dsc inc|cpp/algorithm/dsc iota}} |
| − | {{dsc inc | cpp/algorithm/dsc accumulate}} | + | {{dsc inc|cpp/algorithm/ranges/dsc iota}} |
| − | {{dsc inc | cpp/algorithm/dsc reduce}} | + | {{dsc inc|cpp/algorithm/dsc accumulate}} |
| − | {{dsc inc | cpp/algorithm/dsc transform_reduce}} | + | {{dsc inc|cpp/algorithm/dsc reduce}} |
| − | {{dsc inc | cpp/algorithm/dsc inner_product}} | + | {{dsc inc|cpp/algorithm/dsc transform_reduce}} |
| − | {{dsc inc | cpp/algorithm/dsc adjacent_difference}} | + | {{dsc inc|cpp/algorithm/dsc inner_product}} |
| − | {{dsc inc | cpp/algorithm/dsc partial_sum}} | + | {{dsc inc|cpp/algorithm/dsc adjacent_difference}} |
| − | {{dsc inc | cpp/algorithm/dsc inclusive_scan}} | + | {{dsc inc|cpp/algorithm/dsc partial_sum}} |
| − | {{dsc inc | cpp/algorithm/dsc exclusive_scan}} | + | {{dsc inc|cpp/algorithm/dsc inclusive_scan}} |
| − | {{dsc inc | cpp/algorithm/dsc transform_inclusive_scan}} | + | {{dsc inc|cpp/algorithm/dsc exclusive_scan}} |
| − | {{dsc inc | cpp/algorithm/dsc transform_exclusive_scan}} | + | {{dsc inc|cpp/algorithm/dsc transform_inclusive_scan}} |
| − | {{dsc inc | cpp/numeric/dsc gcd}} | + | {{dsc inc|cpp/algorithm/dsc transform_exclusive_scan}} |
| − | {{dsc inc | cpp/numeric/dsc lcm}} | + | {{dsc inc|cpp/numeric/dsc gcd}} |
| − | {{dsc inc | cpp/numeric/dsc midpoint}} | + | {{dsc inc|cpp/numeric/dsc lcm}} |
| + | {{dsc inc|cpp/numeric/dsc midpoint}} | ||
| + | {{dsc inc|cpp/numeric/dsc add_sat}} | ||
| + | {{dsc inc|cpp/numeric/dsc sub_sat}} | ||
| + | {{dsc inc|cpp/numeric/dsc mul_sat}} | ||
| + | {{dsc inc|cpp/numeric/dsc div_sat}} | ||
| + | {{dsc inc|cpp/numeric/dsc saturate_cast}} | ||
{{dsc end}} | {{dsc end}} | ||
===Synopsis=== | ===Synopsis=== | ||
| − | {{ | + | {{cpp/synopsis/numeric}} |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | }} | + | |
{{langlinks|ja|zh}} | {{langlinks|ja|zh}} | ||
Latest revision as of 06:16, 27 November 2023
This header is part of the numeric library.
Functions | |
| (C++11) |
fills a range with successive increments of the starting value (function template) |
| (C++23) |
fills a range with successive increments of the starting value (niebloid) |
| sums up or folds a range of elements (function template) | |
| (C++17) |
similar to std::accumulate, except out of order (function template) |
| (C++17) |
applies an invocable, then reduces out of order (function template) |
| computes the inner product of two ranges of elements (function template) | |
| computes the differences between adjacent elements in a range (function template) | |
| computes the partial sum of a range of elements (function template) | |
| (C++17) |
similar to std::partial_sum, includes the ith input element in the ith sum (function template) |
| (C++17) |
similar to std::partial_sum, excludes the ith input element from the ith sum (function template) |
| (C++17) |
applies an invocable, then calculates inclusive scan (function template) |
| (C++17) |
applies an invocable, then calculates exclusive scan (function template) |
| (C++17) |
computes the greatest common divisor of two integers (function template) |
| (C++17) |
computes the least common multiple of two integers (function template) |
| (C++20) |
midpoint between two numbers or pointers (function template) |
| (C++26) |
saturating addition operation on two integers (function template) |
| (C++26) |
saturating subtraction operation on two integers (function template) |
| (C++26) |
saturating multiplication operation on two integers (function template) |
| (C++26) |
saturating division operation on two integers (function template) |
| (C++26) |
returns an integer value clamped to the range of a another integer type (function template) |
[edit] Synopsis
namespace std { // accumulate template<class InputIt, class T> constexpr T accumulate(InputIt first, InputIt last, T init); template<class InputIt, class T, class BinaryOperation> constexpr T accumulate(InputIt first, InputIt last, T init, BinaryOperation binary_op); // reduce template<class InputIt> constexpr typename iterator_traits<InputIt>::value_type reduce(InputIt first, InputIt last); template<class InputIt, class T> constexpr T reduce(InputIt first, InputIt last, T init); template<class InputIt, class T, class BinaryOperation> constexpr T reduce(InputIt first, InputIt last, T init, BinaryOperation binary_op); template<class ExecutionPolicy, class ForwardIt> typename iterator_traits<ForwardIt>::value_type reduce(ExecutionPolicy&& exec, ForwardIt first, ForwardIt last); template<class ExecutionPolicy, class ForwardIt, class T> T reduce(ExecutionPolicy&& exec, ForwardIt first, ForwardIt last, T init); template<class ExecutionPolicy, class ForwardIt, class T, class BinaryOperation> T reduce(ExecutionPolicy&& exec, ForwardIt first, ForwardIt last, T init, BinaryOperation binary_op); // inner product template<class InputIt1, class InputIt2, class T> constexpr T inner_product(InputIt1 first1, InputIt1 last1, InputIt2 first2, T init); template<class InputIt1, class InputIt2, class T, class BinaryOperation1, class BinaryOperation2> constexpr T inner_product(InputIt1 first1, InputIt1 last1, InputIt2 first2, T init, BinaryOperation1 binary_op1, BinaryOperation2 binary_op2); // transform reduce template<class InputIt1, class InputIt2, class T> constexpr T transform_reduce(InputIt1 first1, InputIt1 last1, InputIt2 first2, T init); template<class InputIt1, class InputIt2, class T, class BinaryOperation1, class BinaryOperation2> constexpr T transform_reduce(InputIt1 first1, InputIt1 last1, InputIt2 first2, T init, BinaryOperation1 binary_op1, BinaryOperation2 binary_op2); template<class InputIt, class T, class BinaryOperation, class UnaryOperation> constexpr T transform_reduce(InputIt first, InputIt last, T init, BinaryOperation binary_op, UnaryOperation unary_op); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class T> T transform_reduce(ExecutionPolicy&& exec, ForwardIt1 first1, ForwardIt1 last1, ForwardIt2 first2, T init); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class T, class BinaryOperation1, class BinaryOperation2> T transform_reduce(ExecutionPolicy&& exec, ForwardIt1 first1, ForwardIt1 last1, ForwardIt2 first2, T init, BinaryOperation1 binary_op1, BinaryOperation2 binary_op2); template<class ExecutionPolicy, class ForwardIt, class T, class BinaryOperation, class UnaryOperation> T transform_reduce(ExecutionPolicy&& exec, ForwardIt first, ForwardIt last, T init, BinaryOperation binary_op, UnaryOperation unary_op); // partial sum template<class InputIt, class OutputIt> constexpr OutputIt partial_sum(InputIt first, InputIt last, OutputIt result); template<class InputIt, class OutputIt, class BinaryOperation> constexpr OutputIt partial_sum(InputIt first, InputIt last, OutputIt result, BinaryOperation binary_op); // exclusive scan template<class InputIt, class OutputIt, class T> constexpr OutputIt exclusive_scan(InputIt first, InputIt last, OutputIt result, T init); template<class InputIt, class OutputIt, class T, class BinaryOperation> constexpr OutputIt exclusive_scan(InputIt first, InputIt last, OutputIt result, T init, BinaryOperation binary_op); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class T> ForwardIt2 exclusive_scan(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result, T init); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class T, class BinaryOperation> ForwardIt2 exclusive_scan(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result, T init, BinaryOperation binary_op); // inclusive scan template<class InputIt, class OutputIt> constexpr OutputIt inclusive_scan(InputIt first, InputIt last, OutputIt result); template<class InputIt, class OutputIt, class BinaryOperation> constexpr OutputIt inclusive_scan(InputIt first, InputIt last, OutputIt result, BinaryOperation binary_op); template<class InputIt, class OutputIt, class BinaryOperation, class T> constexpr OutputIt inclusive_scan(InputIt first, InputIt last, OutputIt result, BinaryOperation binary_op, T init); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2> ForwardIt2 inclusive_scan(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class BinaryOperation> ForwardIt2 inclusive_scan(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result, BinaryOperation binary_op); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class BinaryOperation, class T> ForwardIt2 inclusive_scan(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result, BinaryOperation binary_op, T init); // transform exclusive scan template<class InputIt, class OutputIt, class T, class BinaryOperation, class UnaryOperation> constexpr OutputIt transform_exclusive_scan(InputIt first, InputIt last, OutputIt result, T init, BinaryOperation binary_op, UnaryOperation unary_op); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class T, class BinaryOperation, class UnaryOperation> ForwardIt2 transform_exclusive_scan(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result, T init, BinaryOperation binary_op, UnaryOperation unary_op); // transform inclusive scan template<class InputIt, class OutputIt, class BinaryOperation, class UnaryOperation> constexpr OutputIt transform_inclusive_scan(InputIt first, InputIt last, OutputIt result, BinaryOperation binary_op, UnaryOperation unary_op); template<class InputIt, class OutputIt, class BinaryOperation, class UnaryOperation, class T> constexpr OutputIt transform_inclusive_scan(InputIt first, InputIt last, OutputIt result, BinaryOperation binary_op, UnaryOperation unary_op, T init); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class BinaryOperation, class UnaryOperation> ForwardIt2 transform_inclusive_scan(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result, BinaryOperation binary_op, UnaryOperation unary_op); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class BinaryOperation, class UnaryOperation, class T> ForwardIt2 transform_inclusive_scan(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result, BinaryOperation binary_op, UnaryOperation unary_op, T init); // adjacent difference template<class InputIt, class OutputIt> constexpr OutputIt adjacent_difference(InputIt first, InputIt last, OutputIt result); template<class InputIt, class OutputIt, class BinaryOperation> constexpr OutputIt adjacent_difference(InputIt first, InputIt last, OutputIt result, BinaryOperation binary_op); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2> ForwardIt2 adjacent_difference(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result); template<class ExecutionPolicy, class ForwardIt1, class ForwardIt2, class BinaryOperation> ForwardIt2 adjacent_difference(ExecutionPolicy&& exec, ForwardIt1 first, ForwardIt1 last, ForwardIt2 result, BinaryOperation binary_op); // iota template<class ForwardIt, class T> constexpr void iota(ForwardIt first, ForwardIt last, T value); namespace ranges { template<class O, class T> using iota_result = out_value_result<O, T>; template<input_or_output_iterator O, sentinel_for<O> S, weakly_incrementable T> requires indirectly_writable<O, const T&> constexpr iota_result<O, T> iota(O first, S last, T value); template<weakly_incrementable T, output_range<const T&> R> constexpr iota_result<borrowed_iterator_t<R>, T> iota(R&& r, T value); } // greatest common divisor template<class M, class N> constexpr common_type_t<M, N> gcd(M m, N n); // least common multiple template<class M, class N> constexpr common_type_t<M, N> lcm(M m, N n); // midpoint template<class T> constexpr T midpoint(T a, T b) noexcept; template<class T> constexpr T* midpoint(T* a, T* b); // saturation arithmetic template<class T> constexpr T add_sat(T x, T y) noexcept; // freestanding template<class T> constexpr T sub_sat(T x, T y) noexcept; // freestanding template<class T> constexpr T mul_sat(T x, T y) noexcept; // freestanding template<class T> constexpr T div_sat(T x, T y) noexcept; // freestanding template<class T, class U> constexpr T saturate_cast(U x) noexcept; // freestanding }
