tools/sliced.hpp

• View this file on GitHub
• Last update: 2023-07-08 14:12:19+09:00
• Include: #include "tools/sliced.hpp"

Depends on

• tools/base.hpp

Code

#pragma once

#include "./base.hpp"

#include <cassert>
#include <cstdint>
#include <string>
#include <vector>

namespace matumoto {
  struct Sliced {
    static constexpr int init = INT32_MAX;
    Sliced() {}

    template <typename T>
    vector<T> operator()(const vector<T> &v, int l, int r = init, int stride = init) {
      assert(stride != 0);
      if (r == init)
        r = v.size();
      if (stride == init)
        stride = 1;
      vector<T> res;
      int start = (stride > 0 ? l : r - 1);
      for (int i = start; (stride > 0 ? i < r : i >= l); i += stride) {
        if (i >= 0) {
          res.emplace_back(v[i]);
        } else {
          res.emplace_back(v.end()[i]);
        }
      }
      return res;
    }

    string operator()(const string &s, int l, int r = init, int stride = init) {
      assert(stride != 0);
      if (r == init)
        r = s.size();
      if (stride == init)
        stride = 1;
      string res;
      int start = (stride > 0 ? l : r - 1);
      for (int i = start; (stride > 0 ? i < r : i >= l); i += stride) {
        if (i >= 0) {
          res.push_back(s[i]);
        } else {
          res.push_back(s.end()[i]);
        }
      }
      return res;
    }
  };
} // namespace matumoto

#line 2 "tools/sliced.hpp"

#line 2 "tools/base.hpp"

namespace matumoto {
  using namespace std;
}
#line 4 "tools/sliced.hpp"

#include <cassert>
#include <cstdint>
#include <string>
#include <vector>

namespace matumoto {
  struct Sliced {
    static constexpr int init = INT32_MAX;
    Sliced() {}

    template <typename T>
    vector<T> operator()(const vector<T> &v, int l, int r = init, int stride = init) {
      assert(stride != 0);
      if (r == init)
        r = v.size();
      if (stride == init)
        stride = 1;
      vector<T> res;
      int start = (stride > 0 ? l : r - 1);
      for (int i = start; (stride > 0 ? i < r : i >= l); i += stride) {
        if (i >= 0) {
          res.emplace_back(v[i]);
        } else {
          res.emplace_back(v.end()[i]);
        }
      }
      return res;
    }

    string operator()(const string &s, int l, int r = init, int stride = init) {
      assert(stride != 0);
      if (r == init)
        r = s.size();
      if (stride == init)
        stride = 1;
      string res;
      int start = (stride > 0 ? l : r - 1);
      for (int i = start; (stride > 0 ? i < r : i >= l); i += stride) {
        if (i >= 0) {
          res.push_back(s[i]);
        } else {
          res.push_back(s.end()[i]);
        }
      }
      return res;
    }
  };
} // namespace matumoto

Back to top page