Concept for signed integral types including tools::int128_t (tools/signed_integral.hpp)

• View this file on GitHub
• View document part on GitHub
• Last update: 2025-12-14 14:57:31+09:00
• Include: #include "tools/signed_integral.hpp"

template <typename T>
concept signed_integral = tools::integral<T> && tools::is_signed_v<T>;

It is a concept that represents signed integral types. It also supports tools::int128_t.

Constraints

• None

Time Complexity

• Not applicable

License

• CC0

Author

• anqooqie

Depends on

• Concept for integral types including tools::int128_t and tools::uint128_t (tools/integral.hpp)
• std::is_integral extended for tools::int128_t and tools::uint128_t (tools/is_integral.hpp)
• std::is_signed extended for tools::int128_t and tools::uint128_t (tools/is_signed.hpp)

Required by

• Berlekamp-Massey algorithm (tools/berlekamp_massey.hpp)
• Bézout's identity (tools/bezout.hpp)
• Arbitrary precision floating-point number (tools/bigdecimal.hpp)
• Arbitrary precision integer (tools/bigint.hpp)
• Bostan-Mori algorithm (tools/bostan_mori.hpp)
• tools/detail/rolling_hash.hpp
• Extended Garner's algorithm (tools/extended_garner.hpp)
• Extended Lucas' theorem (tools/extended_lucas.hpp)
• Extended Euclidean algorithm (tools/extgcd.hpp)
• Garner's algorithm (tools/garner.hpp)
• $x^{-1} \pmod{M}$ (tools/inv_mod.hpp)
• $\log_x y \pmod{M}$ (tools/log_mod.hpp)
• $\mathbb{Z} / (2^{61} - 1) \mathbb{Z}$ (tools/modint_for_rolling_hash.hpp)
• Polynomial (tools/polynomial.hpp)
• Polynomial interpolation (tools/polynomial_interpolation.hpp)
• Product of polynomials (tools/polynomial_product.hpp)
• Rational number (tools/rational.hpp)
• Rolling hash (tools/rolling_hash.hpp)
• $\sqrt{x} \pmod{P}$ (tools/sqrt_mod.hpp)
• Signed Stirling numbers of the first kind (tools/stirling_1st.hpp)
• $x \uparrow\uparrow y \pmod{M}$ (tools/tetration_mod.hpp)
• Twelvefold way (tools/twelvefold_way.hpp)

Verified with

• tests/berlekamp_massey.test.cpp
• tests/bezout.test.cpp
• tests/bigdecimal/cast_to_long_long.test.cpp
• tests/bigdecimal/divides.test.cpp
• tests/bigdecimal/hand.test.cpp
• tests/bigdecimal/minus.test.cpp
• tests/bigdecimal/multiplies.test.cpp
• tests/bigdecimal/plus.test.cpp
• tests/bigdecimal/random.test.cpp
• tests/bigdecimal/rounding.test.cpp
• tests/bigint/divides.test.cpp
• tests/bigint/extgcd.test.cpp
• tests/bigint/gcd.test.cpp
• tests/bigint/minus.test.cpp
• tests/bigint/modulus.test.cpp
• tests/bigint/multiplies.test.cpp
• tests/bigint/plus.test.cpp
• tests/bostan_mori.test.cpp
• tests/directed_line_segment_2d/cross_point.test.cpp
• tests/directed_line_segment_2d/crosses.test.cpp
• tests/directed_line_segment_2d/intersection.test.cpp
• tests/directed_line_segment_2d/squared_distance.test.cpp
• tests/extended_garner.test.cpp
• tests/extended_lucas.test.cpp
• tests/extgcd.test.cpp
• tests/fastio/string.test.cpp
• tests/gcd.test.cpp
• tests/groups.test.cpp
• tests/line_2d/projection.test.cpp
• tests/log_mod.test.cpp
• tests/modint.test.cpp
• tests/modint_compatible.test.cpp
• tests/monoids.test.cpp
• tests/polygon_2d/area.test.cpp
• tests/polynomial/extgcd.test.cpp
• tests/polynomial/multidimensional.test.cpp
• tests/polynomial/multipoint_evaluation.test.cpp
• tests/polynomial/multipoint_evaluation_other_mods.test.cpp
• tests/polynomial/naive_division.test.cpp
• tests/polynomial/ntt_division.test.cpp
• tests/polynomial/taylor_shift.test.cpp
• tests/polynomial_interpolation.test.cpp
• tests/polynomial_product.test.cpp
• tests/rational/minus.test.cpp
• tests/rational/multiplies.test.cpp
• tests/rational/plus.test.cpp
• tests/rational/random.test.cpp
• tests/rolling_hash.test.cpp
• tests/sqrt_mod.test.cpp
• tests/stirling_1st/consistent.test.cpp
• tests/stirling_1st/fixed_k.test.cpp
• tests/stirling_1st/fixed_n.test.cpp
• tests/tetration_mod.test.cpp
• tests/triangle_2d/circumcircle/rational.test.cpp
• tests/twelvefold_way/labeled_ball_labeled_box_at_least_1.test.cpp
• tests/twelvefold_way/labeled_ball_labeled_box_at_most_1.test.cpp
• tests/twelvefold_way/labeled_ball_labeled_box_unrestricted.test.cpp
• tests/twelvefold_way/labeled_ball_unlabeled_box_at_least_1.test.cpp
• tests/twelvefold_way/labeled_ball_unlabeled_box_at_most_1.test.cpp
• tests/twelvefold_way/labeled_ball_unlabeled_box_unrestricted.test.cpp
• tests/twelvefold_way/unlabeled_ball_labeled_box_at_least_1.test.cpp
• tests/twelvefold_way/unlabeled_ball_labeled_box_at_most_1.test.cpp
• tests/twelvefold_way/unlabeled_ball_labeled_box_unrestricted.test.cpp
• tests/twelvefold_way/unlabeled_ball_unlabeled_box_at_least_1.test.cpp
• tests/twelvefold_way/unlabeled_ball_unlabeled_box_at_most_1.test.cpp
• tests/twelvefold_way/unlabeled_ball_unlabeled_box_unrestricted.test.cpp

Code

#ifndef TOOLS_SIGNED_INTEGRAL_HPP
#define TOOLS_SIGNED_INTEGRAL_HPP

#include "tools/integral.hpp"
#include "tools/is_signed.hpp"

namespace tools {
  template <typename T>
  concept signed_integral = tools::integral<T> && tools::is_signed_v<T>;
}

#endif

#line 1 "tools/signed_integral.hpp"



#line 1 "tools/integral.hpp"



#line 1 "tools/is_integral.hpp"



#include <type_traits>

namespace tools {
  template <typename T>
  struct is_integral : std::is_integral<T> {};

  template <typename T>
  inline constexpr bool is_integral_v = tools::is_integral<T>::value;
}


#line 5 "tools/integral.hpp"

namespace tools {
  template <typename T>
  concept integral = tools::is_integral_v<T>;
}


#line 1 "tools/is_signed.hpp"



#line 5 "tools/is_signed.hpp"

namespace tools {
  template <typename T>
  struct is_signed : std::is_signed<T> {};

  template <typename T>
  inline constexpr bool is_signed_v = tools::is_signed<T>::value;
}


#line 6 "tools/signed_integral.hpp"

namespace tools {
  template <typename T>
  concept signed_integral = tools::integral<T> && tools::is_signed_v<T>;
}

Back to top page