summaryrefslogtreecommitdiffstats
path: root/library/cpp/containers/ordered_map/ordered_map.h
blob: f2d1a47c095eadb14c51c50cf212ec3611cfe883 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
#pragma once

#include <util/generic/vector.h>
#include <util/generic/hash.h>

#include <functional>
#include <utility>


namespace NOrderedMap {
    template <class TKey, class TValue>
    class TOrderedMap : protected TVector<std::pair<const TKey, TValue>> {
        using TVectorBase = TVector<std::pair<const TKey, TValue>>;

    public:
        using typename TVectorBase::const_iterator;
        using typename TVectorBase::iterator;
        using typename TVectorBase::reference;
        using typename TVectorBase::value_type;
        using TVectorBase::size;
        using TVectorBase::empty;
        using TVectorBase::front;
        using TVectorBase::back;
        using TVectorBase::begin;
        using TVectorBase::end;
        using TVectorBase::operator bool;

        TOrderedMap() = default;

        TOrderedMap(const TOrderedMap& other) {
            for (const auto& item : other) {
                emplace_back(item.first, item.second);
            }
        }
        TOrderedMap(TOrderedMap&& other) noexcept : TVectorBase(std::move(other)), Map_(std::move(other.Map_)) {
            other.Map_.clear();
        }
        TOrderedMap& operator=(const TOrderedMap& other) {
            if (this != &other) {
                clear();
                for (const auto& item : other) {
                    emplace_back(item.first, item.second);
                }
            }
            return *this;
        }
        TOrderedMap& operator=(TOrderedMap&& other) noexcept {
            if (this != &other) {
                TVectorBase::operator=(std::move(other));
                Map_ = std::move(other.Map_);
                other.Map_.clear();
            }
            return *this;
        }

        template <class TheKey>
        TValue& operator[](const TheKey& key) {
            auto [mapIt, inserted] = Map_.try_emplace(key, TVectorBase::size());
            if (inserted) {
                TVectorBase::emplace_back(key, TValue{});
            }
            return TVectorBase::at(mapIt->second).second;
        }

        template <class TheKey>
        const TValue& at(const TheKey& key) const {
            return TVectorBase::at(Map_.at(key)).second;
        }

        template <class TheKey>
        TValue& at(const TheKey& key) {
            return TVectorBase::at(Map_.at(key)).second;
        }

        template <class TheKey>
        const_iterator find(const TheKey& key) const {
            auto mapIt = Map_.find(key);
            if (mapIt == Map_.end()) {
                return end();
            } else {
                return begin() + mapIt->second;
            }
        }

        template <class TheKey>
        iterator find(const TheKey& key) {
            auto mapIt = Map_.find(key);
            if (mapIt == Map_.end()) {
                return end();
            } else {
                return begin() + mapIt->second;
            }
        }

        template <class TheKey>
        bool contains(const TheKey& key) const {
            return Map_.contains(key);
        }

        void push_back(const value_type& x) {
            emplace_back(x);
        }

        void push_back(value_type&& x) {
            emplace_back(std::move(x));
        }

        template <class... TArgs>
        reference emplace_back(TArgs&&... args) {
            auto pos = size();
            auto& value = TVectorBase::emplace_back(std::forward<TArgs>(args)...);
            auto [mapIt, ok] = Map_.try_emplace(value.first, pos);
            if (ok) {
                return value;
            }
            TVectorBase::pop_back();
            return TVectorBase::at(mapIt->second);
        }

                template <class TheKey>
        size_t erase(const TheKey& key) {
            auto it = find(key);
            if (it == end()) {
                return 0;
            }
            erase(it);
            return 1;
        }
        void erase(iterator it) {
            if (it == end()) {
                return;
            }
            Map_.clear();
            TVector<std::pair<const TKey, TValue>> tmp;
            for (auto iter = begin(); iter != end(); ++iter) {
                if (iter != it) {
                    Map_[iter->first] = tmp.size();
                    tmp.emplace_back(std::move(*iter));
                }
            }
            TVectorBase::operator=(std::move(tmp));
        }

        void Sort() {
            TVector<std::pair<TKey, TValue>> tmp(begin(), end());
            TVectorBase::clear();
            std::ranges::sort(tmp, {}, &std::pair<TKey, TValue>::first);
            for (auto&& [k, v] : std::move(tmp)) {
                Map_[k] = size();
                TVectorBase::emplace_back(std::move(k), std::move(v));
            }
        }

        template <class TheKey>
        const TValue* FindPtr(const TheKey& key) const {
            auto mapIt = Map_.find(key);
            return mapIt != Map_.end()
                ? &TVectorBase::at(mapIt->second).second
                : nullptr;
        }

        template <class TheKey>
        TValue* FindPtr(const TheKey& key) {
            auto mapIt = Map_.find(key);
            return mapIt != Map_.end()
                ? &TVectorBase::at(mapIt->second).second
                : nullptr;
        }

        void clear() noexcept {
            TVectorBase::clear();
            Map_.clear();
        }

    private:
        THashMap<TKey, size_t> Map_{};
    };
}