This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub kmyk/competitive-programming-library
#include "utils/coordinate_compression.hpp"
#pragma once
#include <algorithm>
#include <vector>
#include "../utils/macros.hpp"
template <class T>
struct coordinate_compression {
std::vector<T> data;
coordinate_compression() = default;
template <class Iterator>
coordinate_compression(Iterator first, Iterator last) {
unsafe_insert(first, last);
unsafe_rebuild();
}
template <class Iterator>
void unsafe_insert(Iterator first, Iterator last) {
data.insert(data.end(), first, last);
}
void unsafe_rebuild() {
std::sort(ALL(data));
data.erase(std::unique(ALL(data)), data.end());
}
int operator [] (const T & value) {
return std::lower_bound(ALL(data), value) - data.begin();
}
};
#line 2 "utils/coordinate_compression.hpp"
#include <algorithm>
#include <vector>
#line 2 "utils/macros.hpp"
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i))
#define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i))
#define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i))
#define ALL(x) std::begin(x), std::end(x)
#line 5 "utils/coordinate_compression.hpp"
template <class T>
struct coordinate_compression {
std::vector<T> data;
coordinate_compression() = default;
template <class Iterator>
coordinate_compression(Iterator first, Iterator last) {
unsafe_insert(first, last);
unsafe_rebuild();
}
template <class Iterator>
void unsafe_insert(Iterator first, Iterator last) {
data.insert(data.end(), first, last);
}
void unsafe_rebuild() {
std::sort(ALL(data));
data.erase(std::unique(ALL(data)), data.end());
}
int operator [] (const T & value) {
return std::lower_bound(ALL(data), value) - data.begin();
}
};