cp-library-cpp
This documentation is automatically generated by online-judge-tools/verification-helper
Default Operator
(library/util/default_operator.hpp)
- View this file on GitHub
- Last update: 2022-01-31 13:34:34+09:00
- Include:
#include "library/util/default_operator.hpp"
Default Operator
Required by
- Bitwise And Convolution
(library/convolution/and_convolution.hpp)
- Array Subset Convolution
(library/convolution/array_subset_convolution.hpp)
- Convolution
(library/convolution/convolution.hpp)
- GCD Convolution
(library/convolution/gcd_convolution.hpp)
- LCM Convolution
(library/convolution/lcm_convolution.hpp)
- 多変数畳み込み (切り捨て)
(library/convolution/multi_variate_convolution.hpp)
Bitwise Or Convolution
(library/convolution/or_convolution.hpp)
- Subset Convolution
(library/convolution/subset_convolution.hpp)
- Bitwise Xor Convolution
(library/convolution/xor_convolution.hpp)
- Weighted Union Find
(library/datastructure/union_find/weighted_union_find.hpp)
- Array Matrix
(library/linear_algebra/array_matrix.hpp)
- Hafnian (完全マッチングの数え上げ)
(library/linear_algebra/hafnian.hpp)
- Array Sps
(library/math/array_set_power_series.hpp)
- Set Power Series
(library/math/set_power_series.hpp)
- Rolling Hash (一般の体)
(library/string/rolling_hash_field.hpp)
- 約数系ゼータ変換・メビウス変換
(library/transform/divisor.hpp)
- Kronecker
(library/transform/kronecker.hpp)
- クロネッカー冪による線形変換 (仮称)
(library/transform/kronecker_power.hpp)
- 倍数系ゼータ変換・メビウス変換
(library/transform/multiple.hpp)
- 下位集合に対する高速ゼータ変換・高速メビウス変換
(library/transform/subset.hpp)
- 上位集合に対する高速ゼータ変換・高速メビウス変換
(library/transform/supset.hpp)
- Walsh Hadamard 変換
(library/transform/walsh_hadamard.hpp)
- Contour Sum
(library/tree/contour_sum.hpp)
- Point Add Range Contour Sum Invertible
(library/tree/point_add_range_contour_sum_invertible.hpp)
- Point Get Range Contour Add Invertible
(library/tree/point_get_range_contour_add_invertible.hpp)
- Range Contour Sum Invertible
(library/tree/range_contour_sum_invertible.hpp)
- 累積和
(library/util/cumulative_sum.hpp)
- 2D 累積和
(library/util/cumulative_sum_2d.hpp)
Verified with
- test/src/convolution/and_convolution/and_convolution.test.cpp
- test/src/convolution/gcd_convolution/gcd_convolution.test.cpp
- test/src/convolution/gcd_convolution/lcms.test.cpp
- test/src/convolution/lcm_convolution/lcm_convolution.test.cpp
- test/src/convolution/multi_variate_convolution/multivariate_convolution.test.cpp
- test/src/convolution/polynomial_eval/nim_counting.test.cpp
- test/src/convolution/polynomial_eval_multipoint_eval/nim_counting.test.cpp
- test/src/convolution/subset_convolution/subset_convolution.test.cpp
- test/src/convolution/xor_convolution/xor_convolution.test.cpp
- test/src/datastructure/union_find/weighted_union_find/DSL_1_B.test.cpp
- test/src/linear_algebra/array_matrix/abc258_ex.test.cpp
- test/src/linear_algebra/array_matrix/inverse_matrix.test.cpp
- test/src/linear_algebra/array_matrix/matrix_det.test.cpp
- test/src/linear_algebra/array_matrix/matrix_det_arbitrary_mod.test.cpp
- test/src/linear_algebra/hafnian/hafnian_of_matrix.test.cpp
- test/src/math/array_set_power_series/abc213_g.test.cpp
- test/src/math/array_set_power_series/abc236_h.test.cpp
- test/src/math/array_set_power_series/abc253_h.test.cpp
- test/src/math/array_set_power_series/abc253_h_2.test.cpp
- test/src/math/array_set_power_series/arc105_f.test.cpp
- test/src/math/set_power_series/abc213_g.test.cpp
- test/src/math/set_power_series/abc236_h.test.cpp
- test/src/math/set_power_series/abc253_h.test.cpp
- test/src/math/set_power_series/abc253_h_2.test.cpp
- test/src/math/set_power_series/arc105_f.test.cpp
- test/src/math/set_power_series/exp_of_set_power_series.test.cpp
- test/src/math/set_power_series/polynomial_composite_set_power_series.test.cpp
- test/src/transform/kronecker_power/agc044_c.test.cpp
- test/src/transform/kronecker_power/arc132_f.test.cpp
- test/src/transform/multiple/divide_both.test.cpp
- test/src/tree/point_add_range_contour_sum_invertible/vertex_add_range_contour_sum_on_tree.test.cpp
- test/src/tree/point_get_range_contour_add_invertible/vertex_get_range_contour_add_on_tree.test.cpp
- test/src/tree/point_get_range_contour_add_invertible/yuki1038.test.cpp
Code
#ifndef SUISEN_DEFAULT_OPERATOR
#define SUISEN_DEFAULT_OPERATOR
namespace suisen {
namespace default_operator {
template <typename T>
auto zero() -> decltype(T { 0 }) { return T { 0 }; }
template <typename T>
auto one() -> decltype(T { 1 }) { return T { 1 }; }
template <typename T>
auto add(const T &x, const T &y) -> decltype(x + y) { return x + y; }
template <typename T>
auto sub(const T &x, const T &y) -> decltype(x - y) { return x - y; }
template <typename T>
auto mul(const T &x, const T &y) -> decltype(x * y) { return x * y; }
template <typename T>
auto div(const T &x, const T &y) -> decltype(x / y) { return x / y; }
template <typename T>
auto mod(const T &x, const T &y) -> decltype(x % y) { return x % y; }
template <typename T>
auto neg(const T &x) -> decltype(-x) { return -x; }
template <typename T>
auto inv(const T &x) -> decltype(one<T>() / x) { return one<T>() / x; }
} // default_operator
namespace default_operator_noref {
template <typename T>
auto zero() -> decltype(T { 0 }) { return T { 0 }; }
template <typename T>
auto one() -> decltype(T { 1 }) { return T { 1 }; }
template <typename T>
auto add(T x, T y) -> decltype(x + y) { return x + y; }
template <typename T>
auto sub(T x, T y) -> decltype(x - y) { return x - y; }
template <typename T>
auto mul(T x, T y) -> decltype(x * y) { return x * y; }
template <typename T>
auto div(T x, T y) -> decltype(x / y) { return x / y; }
template <typename T>
auto mod(T x, T y) -> decltype(x % y) { return x % y; }
template <typename T>
auto neg(T x) -> decltype(-x) { return -x; }
template <typename T>
auto inv(T x) -> decltype(one<T>() / x) { return one<T>() / x; }
} // default_operator
} // namespace suisen
#endif // SUISEN_DEFAULT_OPERATOR#line 1 "library/util/default_operator.hpp"
namespace suisen {
namespace default_operator {
template <typename T>
auto zero() -> decltype(T { 0 }) { return T { 0 }; }
template <typename T>
auto one() -> decltype(T { 1 }) { return T { 1 }; }
template <typename T>
auto add(const T &x, const T &y) -> decltype(x + y) { return x + y; }
template <typename T>
auto sub(const T &x, const T &y) -> decltype(x - y) { return x - y; }
template <typename T>
auto mul(const T &x, const T &y) -> decltype(x * y) { return x * y; }
template <typename T>
auto div(const T &x, const T &y) -> decltype(x / y) { return x / y; }
template <typename T>
auto mod(const T &x, const T &y) -> decltype(x % y) { return x % y; }
template <typename T>
auto neg(const T &x) -> decltype(-x) { return -x; }
template <typename T>
auto inv(const T &x) -> decltype(one<T>() / x) { return one<T>() / x; }
} // default_operator
namespace default_operator_noref {
template <typename T>
auto zero() -> decltype(T { 0 }) { return T { 0 }; }
template <typename T>
auto one() -> decltype(T { 1 }) { return T { 1 }; }
template <typename T>
auto add(T x, T y) -> decltype(x + y) { return x + y; }
template <typename T>
auto sub(T x, T y) -> decltype(x - y) { return x - y; }
template <typename T>
auto mul(T x, T y) -> decltype(x * y) { return x * y; }
template <typename T>
auto div(T x, T y) -> decltype(x / y) { return x / y; }
template <typename T>
auto mod(T x, T y) -> decltype(x % y) { return x % y; }
template <typename T>
auto neg(T x) -> decltype(-x) { return -x; }
template <typename T>
auto inv(T x) -> decltype(one<T>() / x) { return one<T>() / x; }
} // default_operator
} // namespace suisen