utility/rep.cpp

• View this file on GitHub
• Last update: 2021-12-17 09:20:39+09:00

Required by

• algorithm/and_convolution.cpp
• algorithm/berlekamp_massey.cpp
• algorithm/convolution_arbitrary_mod.cpp
• algorithm/convolution_int.cpp
• algorithm/convolution_mod.cpp
• algorithm/monotone_minima.cpp
• algorithm/or_convolution.cpp
• algorithm/ranked_subset_mobius_transform.cpp
• algorithm/ranked_subset_zeta_transform.cpp
• algorithm/smawk.cpp
• algorithm/subset_convolution.cpp
• algorithm/subset_mobius_transform.cpp
• algorithm/subset_zeta_transform.cpp
• algorithm/superset_mobius_transform.cpp
• algorithm/superset_zeta_transform.cpp
• container/dual_segment_tree.cpp
• container/integer_hash_table.cpp
• container/lazy_segment_tree.cpp
• container/polynomial_hash.cpp
• container/segment_tree.cpp
• container/segment_tree_beats.cpp
• container/sparse_table.cpp
• graph/binary_optimization.cpp
• graph/dinic.cpp
• graph/primal_dual.cpp
• graph/re_rooting.cpp
• graph/strongly_connected_components.cpp
• graph/union_find.cpp
• internal/modulo_transform.cpp
• math/congruence_equations.cpp
• math/prime_sieve.cpp
• math/semiring_matrix.cpp
• utility/fast_io.cpp

Verified with

• test/and_convolution.test.cpp
• test/berlekamp_massey.test.cpp
• test/bipartite_matching.test.cpp
• test/convolution_arbitrary_mod.test.cpp
• test/convolution_mod.test.cpp
• test/dual_segment_tree.test.cpp
• test/fast_io.test.cpp
• test/fenwick_tree.test.cpp
• test/heavy_light_decomposition.test.cpp
• test/integer_hash_table.test.cpp
• test/integer_hash_table_verbose.test.cpp
• test/larsch.test.cpp
• test/lazy_segment_tree.test.cpp
• test/polynomial_hash.test.cpp
• test/primal_dual_maxflow.test.cpp
• test/primal_dual_mincostflow.test.cpp
• test/prime_sieve.test.cpp
• test/rollback_union_find.test.cpp
• test/segment_tree.test.cpp
• test/segment_tree_beats.test.cpp
• test/semiring_matrix.test.cpp
• test/sparse_table.test.cpp
• test/strongly_connected_components.test.cpp
• test/subset_convolution.test.cpp
• test/union_find.test.cpp
• test/z_algorithm.test.cpp

Code

#pragma once
#include <algorithm>

class Range {
    struct Iter {
        int itr;
        constexpr Iter(const int pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr int operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr Range(const int first, const int last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

constexpr Range rep(const int l, const int r) noexcept { return Range(l, r); }
constexpr Range rep(const int n) noexcept { return Range(0, n); }

#line 2 "utility/rep.cpp"
#include <algorithm>

class Range {
    struct Iter {
        int itr;
        constexpr Iter(const int pos) noexcept : itr(pos) {}
        constexpr void operator++() noexcept { ++itr; }
        constexpr bool operator!=(const Iter& other) const noexcept { return itr != other.itr; }
        constexpr int operator*() const noexcept { return itr; }
    };
    const Iter first, last;

  public:
    explicit constexpr Range(const int first, const int last) noexcept : first(first), last(std::max(first, last)) {}
    constexpr Iter begin() const noexcept { return first; }
    constexpr Iter end() const noexcept { return last; }
};

constexpr Range rep(const int l, const int r) noexcept { return Range(l, r); }
constexpr Range rep(const int n) noexcept { return Range(0, n); }

Back to top page