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
179
180
181
|
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
//
// copyright : (C) 2014 Eran Ifrah
// file name : wx_ordered_map.h
//
// -------------------------------------------------------------------------
// A
// _____ _ _ _ _
// / __ \ | | | | (_) |
// | / \/ ___ __| | ___| | _| |_ ___
// | | / _ \ / _ |/ _ \ | | | __/ _ )
// | \__/\ (_) | (_| | __/ |___| | || __/
// \____/\___/ \__,_|\___\_____/_|\__\___|
//
// F i l e
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
#ifndef WX_ORDERED_MAP_H
#define WX_ORDERED_MAP_H
#include <map>
#include <list>
#include "codelite_exports.h"
/// A container that allows fast insertions / retrieval of elements
/// And also maintains the order of which elements where inserted
template<typename Key, typename Value>
class wxOrderedMap
{
typedef std::pair<Key, Value> Pair_t;
typedef std::list<Pair_t> List_t;
typedef std::map<Key, typename List_t::iterator> Map_t;
public:
typedef typename List_t::const_iterator ConstIterator;
typedef typename List_t::const_iterator const_iterator;
typedef typename List_t::iterator Iterator;
typedef typename List_t::iterator iterator;
protected:
Map_t m_map;
List_t m_list;
public:
wxOrderedMap() {}
virtual ~wxOrderedMap() {}
wxOrderedMap(const wxOrderedMap& rhs) {
if(this == &rhs)
return;
*this = rhs;
}
wxOrderedMap<Key, Value>& operator=(const wxOrderedMap& rhs) {
if(this == &rhs)
return *this;
Clear();
m_map.insert(rhs.m_map.begin(), rhs.m_map.end());
m_list.insert(m_list.end(), rhs.m_list.begin(), rhs.m_list.end());
return *this;
}
void Clear() {
m_map.clear();
m_list.clear();
}
void PushBack(const Key& k, const Value& v) {
if( Contains(k) ) {
// we already got an instance of this item
Remove(k);
}
Iterator iter = m_list.insert(m_list.end(), Pair_t(k, v));
m_map.insert(std::make_pair(k, iter));
}
void PushFront(const Key& k, const Value& v) {
if( Contains(k) ) {
// we already got an instance of this item
Remove(k);
}
Iterator iter = m_list.insert(m_list.begin(), Pair_t(k, v));
m_map.insert(std::make_pair<Key, Iterator>(k, iter));
}
Value &Item(const Key& k) {
static Value NullValue;
typename Map_t::iterator iter = m_map.find(k);
if(iter == m_map.end())
return NullValue;
else {
return iter->second->second;
}
}
const Value &Item(const Key& k) const {
static Value NullValue;
typename Map_t::const_iterator iter = m_map.find(k);
if(iter == m_map.end())
return NullValue;
else {
return iter->second->second;
}
}
bool Contains(const Key& k) const {
return m_map.count(k);
}
void Remove(const Key &k) {
typename Map_t::iterator iter = m_map.find(k);
if(iter == m_map.end()) {
// nothing to remove here
return;
}
m_list.erase(iter->second);
m_map.erase(iter);
}
/**
* @brief is empty?
*/
bool IsEmpty() const { return m_list.empty(); }
// end()
ConstIterator End() const {
return m_list.end();
}
Iterator End() {
return m_list.end();
}
const_iterator end() const {
return m_list.end();
}
iterator end() {
return m_list.end();
}
// begin()
Iterator Begin() {
return m_list.begin();
}
ConstIterator Begin() const {
return m_list.begin();
}
const_iterator begin() const {
return m_list.begin();
}
iterator begin() {
return m_list.begin();
}
void DeleteValues() {
typename List_t::iterator iter = m_list.begin();
for(; iter != m_list.end(); ++iter) {
Value v = (*iter).second;
delete v;
}
Clear();
}
};
#endif // WX_ORDERED_MAP_H
|
