Halc's Library

This documentation is automatically generated by online-judge-tools/verification-helper

---

Project maintained by halc-git Hosted on GitHub Pages — Theme by mattgraham

Misc/Compress.hpp

• View this file on GitHub
• Last update: 2024-05-10 16:22:37+09:00
• Include: #include "Misc/Compress.hpp"

Verified with

• Verify/verify-yosupo-datastructure/static_range_inversions_query-mo.test.cpp

Code

#pragma once
#include <cstdint>
#include <vector>
template <class T>
struct Compress {
    std::vector<T> data;
    void add(T x) { data.emplace_back(x); }
    void add(std::vector<T> x) {
        for (T i : x) add(i);
    }
    void build() {
        sort(data.begin(), data.end());
        data.erase(unique(data.begin(), data.end()), data.end());
    }
    int32_t get(T x) {
        return std::lower_bound(data.begin(), data.end(), x) - data.begin();
    }
    inline int32_t operator()(T x) { return get(x); }
    T operator[](int32_t i) { return data[i]; }
    int32_t size() { return data.size(); }
};

#line 2 "Misc/Compress.hpp"
#include <cstdint>
#include <vector>
template <class T>
struct Compress {
    std::vector<T> data;
    void add(T x) { data.emplace_back(x); }
    void add(std::vector<T> x) {
        for (T i : x) add(i);
    }
    void build() {
        sort(data.begin(), data.end());
        data.erase(unique(data.begin(), data.end()), data.end());
    }
    int32_t get(T x) {
        return std::lower_bound(data.begin(), data.end(), x) - data.begin();
    }
    inline int32_t operator()(T x) { return get(x); }
    T operator[](int32_t i) { return data[i]; }
    int32_t size() { return data.size(); }
};

Back to top page