utility/index_offset.cpp

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

Required by

• graph/basic_graph.cpp
• graph/binary_optimization.cpp
• graph/dinic.cpp
• graph/primal_dual.cpp

Verified with

• test/bipartite_matching.test.cpp
• test/heavy_light_decomposition.test.cpp
• test/primal_dual_maxflow.test.cpp
• test/primal_dual_mincostflow.test.cpp
• test/strongly_connected_components.test.cpp

Code

#pragma once
#include <cassert>

class IndexOffset {
    int offset, len;

  public:
    constexpr IndexOffset() noexcept : offset(), len() {}
    explicit constexpr IndexOffset(const int o, const int l) noexcept : offset(o), len(l) {}
    constexpr int size() const { return len; }
    constexpr int operator[](const int i) const noexcept {
        assert(i < len);
        return offset + i;
    }
    constexpr int to_idx(const int i) const noexcept {
        assert(offset <= i and i < offset + len);
        return i - offset;
    }
};

#line 2 "utility/index_offset.cpp"
#include <cassert>

class IndexOffset {
    int offset, len;

  public:
    constexpr IndexOffset() noexcept : offset(), len() {}
    explicit constexpr IndexOffset(const int o, const int l) noexcept : offset(o), len(l) {}
    constexpr int size() const { return len; }
    constexpr int operator[](const int i) const noexcept {
        assert(i < len);
        return offset + i;
    }
    constexpr int to_idx(const int i) const noexcept {
        assert(offset <= i and i < offset + len);
        return i - offset;
    }
};

Back to top page