std::is_unsigned extended for tools::int128_t and tools::uint128_t (tools/is_unsigned.hpp)

• View this file on GitHub
• View document part on GitHub
• Last update: 2025-02-10 01:30:13+09:00
• Include: #include "tools/is_unsigned.hpp"

template <typename T>
struct is_unsigned {
  static constexpr bool value;
};

template <typename T>
inline constexpr bool is_unsigned_v = is_unsigned<T>::value;

tools::is_unsigned_v<T> is equivalent to std::is_unsigned_v<T> || std::is_same_v<std::remove_cv_t<T>, tools::uint128_t>. When using libstdc++ with -std=c++... option, std::is_unsigned_v<tools::uint128_t> is treated as false, but with tools::is_unsigned, it can be treated as true.

Constraints

• None

Time Complexity

• Not applicable

License

• CC0

Author

• anqooqie

Required by

• Auxiliary tree (tools/auxiliary_tree.hpp)
• Bell numbers (tools/bell.hpp)
• Berlekamp-Massey algorithm (tools/berlekamp_massey.hpp)
• Bernoulli numbers $B_k \pmod{P}$ for $0 \leq k \leq n$ (tools/bernoulli.hpp)
• Arbitrary precision floating-point number (tools/bigdecimal.hpp)
• Arbitrary precision integer (tools/bigint.hpp)
• $\left\lceil \frac{x}{y} \right\rceil y$ (tools/block_ceil.hpp)
• Bostan-Mori algorithm (tools/bostan_mori.hpp)
• $\left\lceil \frac{x}{y} \right\rceil$ (tools/ceil.hpp)
• $\left\lceil x^\frac{1}{k} \right\rceil$ (tools/ceil_kth_root.hpp)
• $\left\lceil \log_b(x) \right\rceil$ (tools/ceil_log.hpp)
• Enumerate the range of $\left\lceil \frac{A}{x} \right\rceil$ (tools/ceil_quotients.hpp)
• $\left\lceil \sqrt{x} \right\rceil$ (tools/ceil_sqrt.hpp)
• Chromatic number (tools/chromatic_number.hpp)
• Two-dimensional circle (tools/circle_2d.hpp)
• Convolution (tools/convolution.hpp)
• tools/detail/geometry_2d.hpp
• tools/detail/int128_t.hpp
• tools/detail/rolling_hash.hpp
• Two-dimensional directed line segment (tools/directed_line_segment_2d.hpp)
• List all divisors (tools/divisors.hpp)
• List all divisors of a divisor of $n$ (tools/divisors_of_divisor.hpp)
• std::bitset with dynamic size (tools/dynamic_bitset.hpp)
• Extended Lucas' theorem (tools/extended_lucas.hpp)
• Cache for $n^{-1}, n!, n!^{-1} \pmod{P}$ (tools/fact_mod_cache.hpp)
• Formal power series (tools/fps.hpp)
• Garner's algorithm for $\mathbb{Z} / M_1 \mathbb{Z}$ and $\mathbb{Z} / M_2 \mathbb{Z}$ (tools/garner2.hpp)
• Garner's algorithm for $\mathbb{Z} / M_1 \mathbb{Z}$, $\mathbb{Z} / M_2 \mathbb{Z}$ and $\mathbb{Z} / M_3 \mathbb{Z}$ (tools/garner3.hpp)
• Two-dimensional half line (tools/half_line_2d.hpp)
• 128-bit signed integer (tools/int128_t.hpp)
• Miller-Rabin primality test (tools/is_prime.hpp)
• Precompute $n! \pmod{P}$ for $0 \leq n < P \approx 10^9$ (tools/large_fact_mod_cache.hpp)
• Lowest common ancestor (tools/lca.hpp)
• Two-dimensional line (tools/line_2d.hpp)
• $\log_x y \pmod{M}$ (tools/log_mod.hpp)
• tools/matrix_mod2.hpp
• Mo's algorithm (tools/mo.hpp)
• $\mathbb{Z} / (2^{61} - 1) \mathbb{Z}$ (tools/modint_for_rolling_hash.hpp)
• $\mathrm{ord}(x)$ for $x \in (\mathbb{Z}/p\mathbb{Z})^\times$ (tools/ord_mod.hpp)
• Partition function (tools/partition_function.hpp)
• Two-dimensional polygon (tools/polygon_2d.hpp)
• Polynomial (tools/polynomial.hpp)
• Polynomial interpolation (tools/polynomial_interpolation.hpp)
• Popcount (tools/popcount.hpp)
• $x^y \pmod{M}$ (tools/pow_mod.hpp)
• Cache for $b^n \pmod{M}$ (tools/pow_mod_cache.hpp)
• Pollard's rho algorithm (tools/prime_factorization.hpp)
• Primitive root (tools/primitive_root.hpp)
• $x \cdot y \pmod{M}$ (tools/prod_mod.hpp)
• Rational number (tools/rational.hpp)
• Rolling hash (tools/rolling_hash.hpp)
• Apply banker's rounding to $\frac{x}{y}$ (tools/round.hpp)
• Shift of sampling points of polynomial (tools/sample_point_shift.hpp)
• Segmented sieve (tools/segmented_sieve.hpp)
• Sign function (tools/signum.hpp)
• Power of a sparse FPS (tools/sparse_fps_pow.hpp)
• $\sqrt{x} \pmod{P}$ (tools/sqrt_mod.hpp)
• Signed Stirling numbers of the first kind (tools/stirling_1st.hpp)
• Stirling numbers of the second kind (tools/stirling_2nd.hpp)
• $x \uparrow\uparrow y \pmod{M}$ (tools/tetration_mod.hpp)
• Euler's totient function (tools/totient.hpp)
• Two-dimensional triangle (tools/triangle_2d.hpp)
• Twelvefold way (tools/twelvefold_way.hpp)
• 128-bit unsigned integer (tools/uint128_t.hpp)
• 0-1 knapsack problem (tools/zero_one_knapsack.hpp)

Verified with

• tests/auxiliary_tree.test.cpp
• tests/bell/all.test.cpp
• tests/bell/consistent.test.cpp
• tests/bell/diagonal.test.cpp
• tests/bell/fixed_n.test.cpp
• tests/berlekamp_massey.test.cpp
• tests/bernoulli.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/minus.test.cpp
• tests/bigint/modulus.test.cpp
• tests/bigint/multiplies.test.cpp
• tests/bigint/plus.test.cpp
• tests/bit_ceil.test.cpp
• tests/bit_floor.test.cpp
• tests/bit_width.test.cpp
• tests/block_ceil.test.cpp
• tests/bostan_mori.test.cpp
• tests/ceil.test.cpp
• tests/ceil_kth_root.test.cpp
• tests/ceil_log.test.cpp
• tests/ceil_log2.test.cpp
• tests/ceil_quotients.test.cpp
• tests/ceil_sqrt.test.cpp
• tests/chromatic_number.test.cpp
• tests/circle_2d/intersection_to_circle.test.cpp
• tests/circle_2d/intersection_to_line.test.cpp
• tests/circle_2d/where/with_radius.test.cpp
• tests/circle_2d/where/without_radius.test.cpp
• tests/convolution/double.test.cpp
• tests/convolution/dynamic_mod.test.cpp
• tests/convolution/mod1000000007.test.cpp
• tests/convolution/mod998244353.test.cpp
• tests/countr_zero.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/divisors.test.cpp
• tests/divisors_of_divisor.test.cpp
• tests/extended_lucas.test.cpp
• tests/fact_mod_cache.test.cpp
• tests/fastio/string.test.cpp
• tests/floor_log2.test.cpp
• tests/fps/composition.test.cpp
• tests/fps/compositional_inverse.test.cpp
• tests/fps/exp_mod998244353.test.cpp
• tests/fps/exp_other_mods.test.cpp
• tests/fps/inv_mod998244353.test.cpp
• tests/fps/inv_other_mods.test.cpp
• tests/fps/log_mod998244353.test.cpp
• tests/fps/log_other_mods.test.cpp
• tests/fps/pow_mod998244353.test.cpp
• tests/fps/pow_other_mods.test.cpp
• tests/has_mod.test.cpp
• tests/int128_t.test.cpp
• tests/is_integral.test.cpp
• tests/is_prime.test.cpp
• tests/is_signed.test.cpp
• tests/is_unsigned.test.cpp
• tests/large_fact_mod_cache/binomial.test.cpp
• tests/large_fact_mod_cache/fact.test.cpp
• tests/lca.test.cpp
• tests/line_2d/is_parallel_to.test.cpp
• tests/line_2d/projection.test.cpp
• tests/log_mod.test.cpp
• tests/make_signed.test.cpp
• tests/make_unsigned.test.cpp
• tests/matrix_mod2/determinant.test.cpp
• tests/matrix_mod2/inv.test.cpp
• tests/matrix_mod2/multiplies.test.cpp
• tests/matrix_mod2/rank.test.cpp
• tests/matrix_mod2/solve.test.cpp
• tests/mo.test.cpp
• tests/monoid.test.cpp
• tests/ord_mod/count.test.cpp
• tests/ord_mod/query.test.cpp
• tests/partition_function/all.test.cpp
• tests/partition_function/consistent.test.cpp
• tests/partition_function/diagonal.test.cpp
• tests/polygon_2d/area.test.cpp
• tests/polygon_2d/minimum_bounding_circle.test.cpp
• tests/polygon_2d/where.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/popcount.test.cpp
• tests/prim/unconnected.test.cpp
• tests/prime_factorization.test.cpp
• tests/primitive_root.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/rotl.test.cpp
• tests/rotr.test.cpp
• tests/sample_point_shift.test.cpp
• tests/scc_graph/edges_to_scc.test.cpp
• tests/segmented_sieve.test.cpp
• tests/sparse_fps_pow/fraction.test.cpp
• tests/sparse_fps_pow/regular.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/stirling_2nd/all.test.cpp
• tests/stirling_2nd/consistent.test.cpp
• tests/stirling_2nd/fixed_k.test.cpp
• tests/stirling_2nd/fixed_n.test.cpp
• tests/tetration_mod.test.cpp
• tests/totient.test.cpp
• tests/triangle_2d/circumcircle.test.cpp
• tests/triangle_2d/incircle.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
• tests/uint128_t.test.cpp
• tests/zero_one_knapsack/solve_by_dp_maximizing_value.test.cpp
• tests/zero_one_knapsack/solve_by_dp_minimizing_weight.test.cpp
• tests/zero_one_knapsack/solve_by_meet_in_the_middle.test.cpp

Code

#ifndef TOOLS_IS_UNSIGNED_HPP
#define TOOLS_IS_UNSIGNED_HPP

#include <type_traits>

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

  template <typename T>
  inline constexpr bool is_unsigned_v = ::tools::is_unsigned<T>::value;
}

#endif

#line 1 "tools/is_unsigned.hpp"



#include <type_traits>

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

  template <typename T>
  inline constexpr bool is_unsigned_v = ::tools::is_unsigned<T>::value;
}

Back to top page