util/comp.hpp

View this file on GitHub
Last update: 2024-11-09 00:49:07+00:00
Include: #include "util/comp.hpp"

Depends on

prelude.hpp

Verified with

Code

#pragma once
#include "prelude.hpp"

template <class T>
class compress {
 public:
  compress(vector<T> v = {}, bool uniq = true) : data(move(v)) {
    sort(data.begin(), data.end());
    if (uniq) data.erase(unique(data.begin(), data.end()), data.end());
  }
  template <class It>
  compress(It f, It l) : compress(vector<T>(f, l)) {}
  int size() const { return data.size(); }
  int operator()(const T& x) const {
    int i = lower_bound(x);
    assert(data[i] == x);
    return i;
  }
  bool contains(const T& x) const {
    return binary_search(data.begin(), data.end(), x);
  }
  const T& operator[](int i) const { return data[i]; }
  int lower_bound(const T& x) const {
    return std::lower_bound(data.begin(), data.end(), x) - data.begin();
  }
  int upper_bound(const T& x) const {
    return upper_bound(data.begin(), data.end(), x) - data.begin() - 1;
  }
  auto begin() const { return data.begin(); }
  auto end() const { return data.end(); }

 private:
  vector<T> data;
};

template <class It>
compress(It, It) -> compress<typename iterator_traits<It>::value_type>;

#line 2 "prelude.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vc = vector<char>;
#define rep2(i, m, n) for (auto i = (m); i < (n); i++)
#define rep(i, n) rep2(i, 0, n)
#define repr2(i, m, n) for (auto i = (n); i-- > (m);)
#define repr(i, n) repr2(i, 0, n)
#define all(x) begin(x), end(x)
auto ndvec(int n, auto e) { return vector(n, e); }
auto ndvec(int n, auto ...e) { return vector(n, ndvec(e...)); }
auto comp_key(auto&& f) { return [&](auto&& a, auto&& b) { return f(a) < f(b); }; }
auto& max(const auto& a, const auto& b) { return a < b ? b : a; }
auto& min(const auto& a, const auto& b) { return b < a ? b : a; }
#if __cpp_lib_ranges
namespace R = std::ranges;
namespace V = std::views;
#endif
#line 3 "util/comp.hpp"

template <class T>
class compress {
 public:
  compress(vector<T> v = {}, bool uniq = true) : data(move(v)) {
    sort(data.begin(), data.end());
    if (uniq) data.erase(unique(data.begin(), data.end()), data.end());
  }
  template <class It>
  compress(It f, It l) : compress(vector<T>(f, l)) {}
  int size() const { return data.size(); }
  int operator()(const T& x) const {
    int i = lower_bound(x);
    assert(data[i] == x);
    return i;
  }
  bool contains(const T& x) const {
    return binary_search(data.begin(), data.end(), x);
  }
  const T& operator[](int i) const { return data[i]; }
  int lower_bound(const T& x) const {
    return std::lower_bound(data.begin(), data.end(), x) - data.begin();
  }
  int upper_bound(const T& x) const {
    return upper_bound(data.begin(), data.end(), x) - data.begin() - 1;
  }
  auto begin() const { return data.begin(); }
  auto end() const { return data.end(); }

 private:
  vector<T> data;
};

template <class It>
compress(It, It) -> compress<typename iterator_traits<It>::value_type>;