Concept for a type that can be passed for range adaptors multi times (tools/available_for_multiple_range_adaptors.hpp)

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

template <typename T>
concept available_for_multiple_range_adaptors = std::ranges::forward_range<T>
  && std::ranges::viewable_range<T>
  && std::copyable<std::views::all_t<T>>;

It is a concept that represents a type that can be passed for range adaptors multi times.

Constraints

• None

Time Complexity

• Not applicable

License

• CC0

Author

• anqooqie

Depends on

• Concept for the specialized type of U (tools/specialization_of.hpp)

Required by

• 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)
• $\prod_{i = 0}^{m - 1} (a_i + b_i x^{c_i})^{d_i}$ (tools/binomial_product.hpp)
• Bostan-Mori algorithm (tools/bostan_mori.hpp)
• Convolution (tools/convolution.hpp)
• List all divisors of a divisor of $n$ (tools/divisors_of_divisor.hpp)
• Formal power series (tools/fps.hpp)
• Precompute $n! \pmod{P}$ for $0 \leq n < P \approx 10^9$ (tools/large_fact_mod_cache.hpp)
• Partition function (tools/partition_function.hpp)
• Polynomial (tools/polynomial.hpp)
• Polynomial interpolation (tools/polynomial_interpolation.hpp)
• Product of polynomials (tools/polynomial_product.hpp)
• Shift of sampling points of polynomial (tools/sample_point_shift.hpp)
• Power of a sparse FPS (tools/sparse_fps_pow.hpp)
• Signed Stirling numbers of the first kind (tools/stirling_1st.hpp)
• Stirling numbers of the second kind (tools/stirling_2nd.hpp)
• Subset sum (tools/subset_sum.hpp)
• Twelvefold way (tools/twelvefold_way.hpp)

Verified with

• 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/bostan_mori.test.cpp
• tests/convolution/double.test.cpp
• tests/convolution/dynamic_mod.test.cpp
• tests/convolution/mod1000000007.test.cpp
• tests/convolution/mod998244353.test.cpp
• tests/divisors_of_divisor.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/large_fact_mod_cache/binomial.test.cpp
• tests/large_fact_mod_cache/fact.test.cpp
• tests/multiplicative_structure.test.cpp
• tests/partition_function/all.test.cpp
• tests/partition_function/consistent.test.cpp
• tests/partition_function/diagonal.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/sample_point_shift.test.cpp
• tests/sparse_fps_pow/fraction.test.cpp
• tests/sparse_fps_pow/regular.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/subset_sum.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_AVAILABLE_FOR_MULTIPLE_RANGE_ADAPTORS_HPP
#define TOOLS_AVAILABLE_FOR_MULTIPLE_RANGE_ADAPTORS_HPP

#include <concepts>
#include <ranges>
#include <type_traits>
#include "tools/specialization_of.hpp"

namespace tools {
  template <typename T>
  concept available_for_multiple_range_adaptors = std::ranges::forward_range<T>
    && std::ranges::viewable_range<T>
    && std::copyable<std::views::all_t<T>>;
}

#endif

#line 1 "tools/available_for_multiple_range_adaptors.hpp"



#include <concepts>
#include <ranges>
#include <type_traits>
#line 1 "tools/specialization_of.hpp"



#line 5 "tools/specialization_of.hpp"

namespace tools {
  namespace detail {
    namespace specialization_of {
      template <typename, template <typename...> typename>
      struct trait : std::false_type {};

      template <template <typename...> typename U, typename... Args>
      struct trait<U<Args...>, U> : std::true_type {};
    }
  }

  template <typename T, template <typename...> typename U>
  concept specialization_of = tools::detail::specialization_of::trait<T, U>::value;
}


#line 8 "tools/available_for_multiple_range_adaptors.hpp"

namespace tools {
  template <typename T>
  concept available_for_multiple_range_adaptors = std::ranges::forward_range<T>
    && std::ranges::viewable_range<T>
    && std::copyable<std::views::all_t<T>>;
}

Back to top page