718 lines
17 KiB
C++
718 lines
17 KiB
C++
/*
|
|
This file is part of Telegram Desktop,
|
|
the official desktop application for the Telegram messaging service.
|
|
|
|
For license and copyright information please follow this link:
|
|
https://github.com/telegramdesktop/tdesktop/blob/master/LEGAL
|
|
*/
|
|
#pragma once
|
|
|
|
#include <deque>
|
|
#include <algorithm>
|
|
|
|
namespace base {
|
|
|
|
using std::begin;
|
|
using std::end;
|
|
|
|
template <typename Type, typename Compare = std::less<>>
|
|
class flat_set;
|
|
|
|
template <typename Type, typename Compare = std::less<>>
|
|
class flat_multi_set;
|
|
|
|
template <typename Type, typename iterator_impl>
|
|
class flat_multi_set_iterator_impl;
|
|
|
|
template <typename Type, typename iterator_impl>
|
|
class flat_multi_set_iterator_impl {
|
|
public:
|
|
using iterator_category = typename iterator_impl::iterator_category;
|
|
|
|
using value_type = Type;
|
|
using difference_type = typename iterator_impl::difference_type;
|
|
using pointer = const Type*;
|
|
using reference = const Type&;
|
|
|
|
flat_multi_set_iterator_impl(
|
|
iterator_impl impl = iterator_impl())
|
|
: _impl(impl) {
|
|
}
|
|
template <typename other_iterator_impl>
|
|
flat_multi_set_iterator_impl(
|
|
const flat_multi_set_iterator_impl<
|
|
Type,
|
|
other_iterator_impl> &other)
|
|
: _impl(other._impl) {
|
|
}
|
|
|
|
reference operator*() const {
|
|
return *_impl;
|
|
}
|
|
pointer operator->() const {
|
|
return std::addressof(**this);
|
|
}
|
|
flat_multi_set_iterator_impl &operator++() {
|
|
++_impl;
|
|
return *this;
|
|
}
|
|
flat_multi_set_iterator_impl operator++(int) {
|
|
return _impl++;
|
|
}
|
|
flat_multi_set_iterator_impl &operator--() {
|
|
--_impl;
|
|
return *this;
|
|
}
|
|
flat_multi_set_iterator_impl operator--(int) {
|
|
return _impl--;
|
|
}
|
|
flat_multi_set_iterator_impl &operator+=(difference_type offset) {
|
|
_impl += offset;
|
|
return *this;
|
|
}
|
|
flat_multi_set_iterator_impl operator+(difference_type offset) const {
|
|
return _impl + offset;
|
|
}
|
|
flat_multi_set_iterator_impl &operator-=(difference_type offset) {
|
|
_impl -= offset;
|
|
return *this;
|
|
}
|
|
flat_multi_set_iterator_impl operator-(difference_type offset) const {
|
|
return _impl - offset;
|
|
}
|
|
template <typename other_iterator_impl>
|
|
difference_type operator-(
|
|
const flat_multi_set_iterator_impl<
|
|
Type,
|
|
other_iterator_impl> &right) const {
|
|
return _impl - right._impl;
|
|
}
|
|
reference operator[](difference_type offset) const {
|
|
return _impl[offset];
|
|
}
|
|
|
|
template <typename other_iterator_impl>
|
|
bool operator==(
|
|
const flat_multi_set_iterator_impl<
|
|
Type,
|
|
other_iterator_impl> &right) const {
|
|
return _impl == right._impl;
|
|
}
|
|
template <typename other_iterator_impl>
|
|
bool operator!=(
|
|
const flat_multi_set_iterator_impl<
|
|
Type,
|
|
other_iterator_impl> &right) const {
|
|
return _impl != right._impl;
|
|
}
|
|
template <typename other_iterator_impl>
|
|
bool operator<(
|
|
const flat_multi_set_iterator_impl<
|
|
Type,
|
|
other_iterator_impl> &right) const {
|
|
return _impl < right._impl;
|
|
}
|
|
|
|
private:
|
|
iterator_impl _impl;
|
|
|
|
template <typename OtherType, typename OtherCompare>
|
|
friend class flat_multi_set;
|
|
|
|
template <typename OtherType, typename OtherCompare>
|
|
friend class flat_set;
|
|
|
|
template <
|
|
typename OtherType,
|
|
typename other_iterator_impl>
|
|
friend class flat_multi_set_iterator_impl;
|
|
|
|
Type &wrapped() {
|
|
return _impl->wrapped();
|
|
}
|
|
|
|
};
|
|
|
|
template <typename Type>
|
|
class flat_multi_set_const_wrap {
|
|
public:
|
|
constexpr flat_multi_set_const_wrap(const Type &value)
|
|
: _value(value) {
|
|
}
|
|
constexpr flat_multi_set_const_wrap(Type &&value)
|
|
: _value(std::move(value)) {
|
|
}
|
|
inline constexpr operator const Type&() const {
|
|
return _value;
|
|
}
|
|
constexpr Type &wrapped() {
|
|
return _value;
|
|
}
|
|
|
|
private:
|
|
Type _value;
|
|
|
|
};
|
|
|
|
template <typename Type, typename Compare>
|
|
class flat_multi_set {
|
|
using const_wrap = flat_multi_set_const_wrap<Type>;
|
|
using impl_t = std::deque<const_wrap>;
|
|
|
|
public:
|
|
using value_type = Type;
|
|
using size_type = typename impl_t::size_type;
|
|
using difference_type = typename impl_t::difference_type;
|
|
using pointer = const Type*;
|
|
using reference = const Type&;
|
|
|
|
using iterator = flat_multi_set_iterator_impl<
|
|
Type,
|
|
typename impl_t::iterator>;
|
|
using const_iterator = flat_multi_set_iterator_impl<
|
|
Type,
|
|
typename impl_t::const_iterator>;
|
|
using reverse_iterator = flat_multi_set_iterator_impl<
|
|
Type,
|
|
typename impl_t::reverse_iterator>;
|
|
using const_reverse_iterator = flat_multi_set_iterator_impl<
|
|
Type,
|
|
typename impl_t::const_reverse_iterator>;
|
|
|
|
flat_multi_set() = default;
|
|
|
|
template <
|
|
typename Iterator,
|
|
typename = typename std::iterator_traits<Iterator>::iterator_category>
|
|
flat_multi_set(Iterator first, Iterator last)
|
|
: _data(first, last) {
|
|
std::sort(std::begin(impl()), std::end(impl()), compare());
|
|
}
|
|
|
|
flat_multi_set(std::initializer_list<Type> iter)
|
|
: flat_multi_set(iter.begin(), iter.end()) {
|
|
}
|
|
|
|
size_type size() const {
|
|
return impl().size();
|
|
}
|
|
bool empty() const {
|
|
return impl().empty();
|
|
}
|
|
void clear() {
|
|
impl().clear();
|
|
}
|
|
|
|
iterator begin() {
|
|
return impl().begin();
|
|
}
|
|
iterator end() {
|
|
return impl().end();
|
|
}
|
|
const_iterator begin() const {
|
|
return impl().begin();
|
|
}
|
|
const_iterator end() const {
|
|
return impl().end();
|
|
}
|
|
const_iterator cbegin() const {
|
|
return impl().cbegin();
|
|
}
|
|
const_iterator cend() const {
|
|
return impl().cend();
|
|
}
|
|
reverse_iterator rbegin() {
|
|
return impl().rbegin();
|
|
}
|
|
reverse_iterator rend() {
|
|
return impl().rend();
|
|
}
|
|
const_reverse_iterator rbegin() const {
|
|
return impl().rbegin();
|
|
}
|
|
const_reverse_iterator rend() const {
|
|
return impl().rend();
|
|
}
|
|
const_reverse_iterator crbegin() const {
|
|
return impl().crbegin();
|
|
}
|
|
const_reverse_iterator crend() const {
|
|
return impl().crend();
|
|
}
|
|
|
|
reference front() const {
|
|
return *begin();
|
|
}
|
|
reference back() const {
|
|
return *(end() - 1);
|
|
}
|
|
|
|
iterator insert(const Type &value) {
|
|
if (empty() || compare()(value, front())) {
|
|
impl().push_front(value);
|
|
return begin();
|
|
} else if (!compare()(value, back())) {
|
|
impl().push_back(value);
|
|
return (end() - 1);
|
|
}
|
|
auto where = getUpperBound(value);
|
|
return impl().insert(where, value);
|
|
}
|
|
iterator insert(Type &&value) {
|
|
if (empty() || compare()(value, front())) {
|
|
impl().push_front(std::move(value));
|
|
return begin();
|
|
} else if (!compare()(value, back())) {
|
|
impl().push_back(std::move(value));
|
|
return (end() - 1);
|
|
}
|
|
auto where = getUpperBound(value);
|
|
return impl().insert(where, std::move(value));
|
|
}
|
|
template <typename... Args>
|
|
iterator emplace(Args&&... args) {
|
|
return insert(Type(std::forward<Args>(args)...));
|
|
}
|
|
|
|
bool removeOne(const Type &value) {
|
|
if (empty()
|
|
|| compare()(value, front())
|
|
|| compare()(back(), value)) {
|
|
return false;
|
|
}
|
|
auto where = getLowerBound(value);
|
|
if (compare()(value, *where)) {
|
|
return false;
|
|
}
|
|
impl().erase(where);
|
|
return true;
|
|
}
|
|
int removeAll(const Type &value) {
|
|
if (empty()
|
|
|| compare()(value, front())
|
|
|| compare()(back(), value)) {
|
|
return 0;
|
|
}
|
|
auto range = getEqualRange(value);
|
|
if (range.first == range.second) {
|
|
return 0;
|
|
}
|
|
const auto result = (range.second - range.first);
|
|
impl().erase(range.first, range.second);
|
|
return result;
|
|
}
|
|
|
|
iterator erase(const_iterator where) {
|
|
return impl().erase(where._impl);
|
|
}
|
|
iterator erase(const_iterator from, const_iterator till) {
|
|
return impl().erase(from._impl, till._impl);
|
|
}
|
|
int erase(const Type &value) {
|
|
return removeAll(value);
|
|
}
|
|
|
|
iterator findFirst(const Type &value) {
|
|
if (empty()
|
|
|| compare()(value, front())
|
|
|| compare()(back(), value)) {
|
|
return end();
|
|
}
|
|
auto where = getLowerBound(value);
|
|
return compare()(value, *where) ? impl().end() : where;
|
|
}
|
|
|
|
const_iterator findFirst(const Type &value) const {
|
|
if (empty()
|
|
|| compare()(value, front())
|
|
|| compare()(back(), value)) {
|
|
return end();
|
|
}
|
|
auto where = getLowerBound(value);
|
|
return compare()(value, *where) ? impl().end() : where;
|
|
}
|
|
|
|
template <
|
|
typename OtherType,
|
|
typename = typename Compare::is_transparent>
|
|
iterator findFirst(const OtherType &value) {
|
|
if (empty()
|
|
|| compare()(value, front())
|
|
|| compare()(back(), value)) {
|
|
return end();
|
|
}
|
|
auto where = getLowerBound(value);
|
|
return compare()(value, *where) ? impl().end() : where;
|
|
}
|
|
|
|
template <
|
|
typename OtherType,
|
|
typename = typename Compare::is_transparent>
|
|
const_iterator findFirst(const OtherType &value) const {
|
|
if (empty()
|
|
|| compare()(value, front())
|
|
|| compare()(back(), value)) {
|
|
return end();
|
|
}
|
|
auto where = getLowerBound(value);
|
|
return compare()(value, *where) ? impl().end() : where;
|
|
}
|
|
|
|
bool contains(const Type &value) const {
|
|
return findFirst(value) != end();
|
|
}
|
|
int count(const Type &value) const {
|
|
if (empty()
|
|
|| compare()(value, front())
|
|
|| compare()(back(), value)) {
|
|
return 0;
|
|
}
|
|
auto range = getEqualRange(value);
|
|
return (range.second - range.first);
|
|
}
|
|
|
|
template <typename Action>
|
|
auto modify(iterator which, Action action) {
|
|
auto result = action(which.wrapped());
|
|
for (auto i = which + 1, e = end(); i != e; ++i) {
|
|
if (compare()(*i, *which)) {
|
|
std::swap(i.wrapped(), which.wrapped());
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
for (auto i = which, b = begin(); i != b;) {
|
|
--i;
|
|
if (compare()(*which, *i)) {
|
|
std::swap(i.wrapped(), which.wrapped());
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
template <
|
|
typename Iterator,
|
|
typename = typename std::iterator_traits<Iterator>::iterator_category>
|
|
void merge(Iterator first, Iterator last) {
|
|
impl().insert(impl().end(), first, last);
|
|
std::sort(std::begin(impl()), std::end(impl()), compare());
|
|
}
|
|
|
|
void merge(const flat_multi_set<Type, Compare> &other) {
|
|
merge(other.begin(), other.end());
|
|
}
|
|
|
|
void merge(std::initializer_list<Type> list) {
|
|
merge(list.begin(), list.end());
|
|
}
|
|
|
|
private:
|
|
friend class flat_set<Type, Compare>;
|
|
|
|
struct transparent_compare : Compare {
|
|
inline constexpr const Compare &initial() const noexcept {
|
|
return *this;
|
|
}
|
|
|
|
template <
|
|
typename OtherType1,
|
|
typename OtherType2,
|
|
typename = std::enable_if_t<
|
|
!std::is_same_v<std::decay_t<OtherType1>, const_wrap> &&
|
|
!std::is_same_v<std::decay_t<OtherType2>, const_wrap>>>
|
|
inline constexpr auto operator()(
|
|
OtherType1 &&a,
|
|
OtherType2 &&b) const {
|
|
return initial()(
|
|
std::forward<OtherType1>(a),
|
|
std::forward<OtherType2>(b));
|
|
}
|
|
template <
|
|
typename OtherType1,
|
|
typename OtherType2>
|
|
inline constexpr auto operator()(
|
|
OtherType1 &&a,
|
|
OtherType2 &&b) const -> std::enable_if_t<
|
|
std::is_same_v<std::decay_t<OtherType1>, const_wrap> &&
|
|
std::is_same_v<std::decay_t<OtherType2>, const_wrap>, bool> {
|
|
return initial()(
|
|
static_cast<const Type&>(a),
|
|
static_cast<const Type&>(b));
|
|
}
|
|
template <
|
|
typename OtherType,
|
|
typename = std::enable_if_t<
|
|
!std::is_same_v<std::decay_t<OtherType>, const_wrap>>>
|
|
inline constexpr auto operator()(
|
|
const const_wrap &a,
|
|
OtherType &&b) const {
|
|
return initial()(
|
|
static_cast<const Type&>(a),
|
|
std::forward<OtherType>(b));
|
|
}
|
|
template <
|
|
typename OtherType,
|
|
typename = std::enable_if_t<
|
|
!std::is_same_v<std::decay_t<OtherType>, const_wrap>>>
|
|
inline constexpr auto operator()(
|
|
OtherType &&a,
|
|
const const_wrap &b) const {
|
|
return initial()(
|
|
std::forward<OtherType>(a),
|
|
static_cast<const Type&>(b));
|
|
}
|
|
|
|
};
|
|
struct Data : transparent_compare {
|
|
template <typename ...Args>
|
|
Data(Args &&...args)
|
|
: elements(std::forward<Args>(args)...) {
|
|
}
|
|
|
|
impl_t elements;
|
|
};
|
|
|
|
Data _data;
|
|
const transparent_compare &compare() const {
|
|
return _data;
|
|
}
|
|
const impl_t &impl() const {
|
|
return _data.elements;
|
|
}
|
|
impl_t &impl() {
|
|
return _data.elements;
|
|
}
|
|
|
|
typename impl_t::iterator getLowerBound(const Type &value) {
|
|
return std::lower_bound(
|
|
std::begin(impl()),
|
|
std::end(impl()),
|
|
value,
|
|
compare());
|
|
}
|
|
typename impl_t::const_iterator getLowerBound(const Type &value) const {
|
|
return std::lower_bound(
|
|
std::begin(impl()),
|
|
std::end(impl()),
|
|
value,
|
|
compare());
|
|
}
|
|
template <
|
|
typename OtherType,
|
|
typename = typename Compare::is_transparent>
|
|
typename impl_t::iterator getLowerBound(const OtherType &value) {
|
|
return std::lower_bound(
|
|
std::begin(impl()),
|
|
std::end(impl()),
|
|
value,
|
|
compare());
|
|
}
|
|
template <
|
|
typename OtherType,
|
|
typename = typename Compare::is_transparent>
|
|
typename impl_t::const_iterator getLowerBound(const OtherType &value) const {
|
|
return std::lower_bound(
|
|
std::begin(impl()),
|
|
std::end(impl()),
|
|
value,
|
|
compare());
|
|
}
|
|
typename impl_t::iterator getUpperBound(const Type &value) {
|
|
return std::upper_bound(
|
|
std::begin(impl()),
|
|
std::end(impl()),
|
|
value,
|
|
compare());
|
|
}
|
|
typename impl_t::const_iterator getUpperBound(const Type &value) const {
|
|
return std::upper_bound(
|
|
std::begin(impl()),
|
|
std::end(impl()),
|
|
value,
|
|
compare());
|
|
}
|
|
std::pair<
|
|
typename impl_t::iterator,
|
|
typename impl_t::iterator
|
|
> getEqualRange(const Type &value) {
|
|
return std::equal_range(
|
|
std::begin(impl()),
|
|
std::end(impl()),
|
|
value,
|
|
compare());
|
|
}
|
|
std::pair<
|
|
typename impl_t::const_iterator,
|
|
typename impl_t::const_iterator
|
|
> getEqualRange(const Type &value) const {
|
|
return std::equal_range(
|
|
std::begin(impl()),
|
|
std::end(impl()),
|
|
value,
|
|
compare());
|
|
}
|
|
|
|
};
|
|
|
|
template <typename Type, typename Compare>
|
|
class flat_set : private flat_multi_set<Type, Compare> {
|
|
using parent = flat_multi_set<Type, Compare>;
|
|
|
|
public:
|
|
using iterator = typename parent::iterator;
|
|
using const_iterator = typename parent::const_iterator;
|
|
using reverse_iterator = typename parent::reverse_iterator;
|
|
using const_reverse_iterator = typename parent::const_reverse_iterator;
|
|
using value_type = typename parent::value_type;
|
|
using size_type = typename parent::size_type;
|
|
using difference_type = typename parent::difference_type;
|
|
using pointer = typename parent::pointer;
|
|
using reference = typename parent::reference;
|
|
|
|
flat_set() = default;
|
|
|
|
template <
|
|
typename Iterator,
|
|
typename = typename std::iterator_traits<Iterator>::iterator_category
|
|
>
|
|
flat_set(Iterator first, Iterator last) : parent(first, last) {
|
|
finalize();
|
|
}
|
|
|
|
flat_set(std::initializer_list<Type> iter) : parent(iter.begin(), iter.end()) {
|
|
finalize();
|
|
}
|
|
|
|
using parent::parent;
|
|
using parent::size;
|
|
using parent::empty;
|
|
using parent::clear;
|
|
using parent::begin;
|
|
using parent::end;
|
|
using parent::cbegin;
|
|
using parent::cend;
|
|
using parent::rbegin;
|
|
using parent::rend;
|
|
using parent::crbegin;
|
|
using parent::crend;
|
|
using parent::front;
|
|
using parent::back;
|
|
using parent::contains;
|
|
using parent::erase;
|
|
|
|
iterator insert(const Type &value) {
|
|
if (this->empty() || this->compare()(value, this->front())) {
|
|
this->impl().push_front(value);
|
|
return this->begin();
|
|
} else if (this->compare()(this->back(), value)) {
|
|
this->impl().push_back(value);
|
|
return (this->end() - 1);
|
|
}
|
|
auto where = this->getLowerBound(value);
|
|
if (this->compare()(value, *where)) {
|
|
return this->impl().insert(where, value);
|
|
}
|
|
return this->end();
|
|
}
|
|
iterator insert(Type &&value) {
|
|
if (this->empty() || this->compare()(value, this->front())) {
|
|
this->impl().push_front(std::move(value));
|
|
return this->begin();
|
|
} else if (this->compare()(this->back(), value)) {
|
|
this->impl().push_back(std::move(value));
|
|
return (this->end() - 1);
|
|
}
|
|
auto where = this->getLowerBound(value);
|
|
if (this->compare()(value, *where)) {
|
|
return this->impl().insert(where, std::move(value));
|
|
}
|
|
return this->end();
|
|
}
|
|
template <typename... Args>
|
|
iterator emplace(Args&&... args) {
|
|
return this->insert(Type(std::forward<Args>(args)...));
|
|
}
|
|
|
|
bool remove(const Type &value) {
|
|
return this->removeOne(value);
|
|
}
|
|
|
|
iterator find(const Type &value) {
|
|
return this->findFirst(value);
|
|
}
|
|
const_iterator find(const Type &value) const {
|
|
return this->findFirst(value);
|
|
}
|
|
template <
|
|
typename OtherType,
|
|
typename = typename Compare::is_transparent>
|
|
iterator find(const OtherType &value) {
|
|
return this->findFirst(value);
|
|
}
|
|
template <
|
|
typename OtherType,
|
|
typename = typename Compare::is_transparent>
|
|
const_iterator find(const OtherType &value) const {
|
|
return this->findFirst(value);
|
|
}
|
|
|
|
template <typename Action>
|
|
void modify(iterator which, Action action) {
|
|
action(which.wrapped());
|
|
for (auto i = iterator(which + 1), e = end(); i != e; ++i) {
|
|
if (this->compare()(*i, *which)) {
|
|
std::swap(i.wrapped(), which.wrapped());
|
|
} else if (!this->compare()(*which, *i)) {
|
|
erase(which);
|
|
return;
|
|
} else{
|
|
break;
|
|
}
|
|
}
|
|
for (auto i = which, b = begin(); i != b;) {
|
|
--i;
|
|
if (this->compare()(*which, *i)) {
|
|
std::swap(i.wrapped(), which.wrapped());
|
|
} else if (!this->compare()(*i, *which)) {
|
|
erase(which);
|
|
return;
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
template <
|
|
typename Iterator,
|
|
typename = typename std::iterator_traits<Iterator>::iterator_category>
|
|
void merge(Iterator first, Iterator last) {
|
|
parent::merge(first, last);
|
|
finalize();
|
|
}
|
|
|
|
void merge(const flat_multi_set<Type, Compare> &other) {
|
|
merge(other.begin(), other.end());
|
|
}
|
|
|
|
void merge(std::initializer_list<Type> list) {
|
|
merge(list.begin(), list.end());
|
|
}
|
|
|
|
private:
|
|
void finalize() {
|
|
this->impl().erase(
|
|
std::unique(
|
|
std::begin(this->impl()),
|
|
std::end(this->impl()),
|
|
[&](auto &&a, auto &&b) {
|
|
return !this->compare()(a, b);
|
|
}
|
|
),
|
|
std::end(this->impl()));
|
|
}
|
|
|
|
};
|
|
|
|
} // namespace base
|