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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
#pragma once
#include <utility>
#include <memory>
template<typename Kt>
struct Entity
{
Kt key_;
};
template<typename Kt, typename Ct>
struct cell: public Entity<Kt>, public Ct
{
cell(): cell{0} {}
template<typename ...TArgs>
cell(Kt const & key, TArgs&&... args): Entity<Kt>{key}, Ct{args...} {}
};
template<typename Kt, typename Ct>
class Field
{
using field_t = Field<Kt, Ct>;
using data_t = cell<Kt, Ct>;
using data_p = data_t*;
using cdata_t = const data_t;
using cdata_p = const data_t*;
using iterator = data_t*;
using const_iterator = const data_t*;
using component_t = Ct;
using key_t = Kt;
using Alloc_t = std::allocator<cell<Kt, Ct> >;
private:
data_p data_;
std::size_t size_;
std::size_t capacity_;
public:
Field(): data_{Alloc_t().allocate(20)}, size_{0}, capacity_{20}
{
}
Field(field_t const & cpy): size_{cpy.size_}, capacity_{cpy.capacity_}
{
std::size_t cpt {0};
for(const_iterator it { cpy.cbegin() }; it != cpy.cend(); ++it, ++cpt)
{
Alloc_t().construct(&data_[cpt], *it);
}
}
~Field()
{
if(!is_empty())
{
for(iterator it { &data_[0] }; it != &data_[size_]; ++it)
{
Alloc_t().destroy(it);
}
}
Alloc_t().deallocate(data_, capacity_);
}
inline iterator begin()
{
return &data_[0];
}
inline iterator end()
{
return &data_[size_];
}
inline const_iterator cbegin() const
{
return &data_[0];
}
inline const_iterator cend() const
{
return &data_[size_];
}
inline bool is_empty() const
{
return (size_ == 0);
}
inline std::size_t const & size()
{
return size_;
}
bool exist(key_t const & key) const
{
if(!is_empty())
{
for(const_iterator it {cbegin()}; it != cend(); ++it)
{
if(it->key_ == key)
{
return true;
}
}
}
return false;
}
std::size_t offsetOf(key_t const & key) const
{
if(!is_empty())
{
std::size_t cpt{0};
for(const_iterator it {cbegin()}; it != cend(); ++it, ++cpt)
{
if(it->key_ == key)
{
return cpt;
}
}
}
return -1;
}
field_t & reserve(std::size_t const & cap)
{
if(cap < capacity_)
{
return *this;
}
std::size_t cpt{0};
data_p buf_{ Alloc_t().allocate(cap) };
for(const_iterator it { cbegin() }; it != cend(); ++it, ++cpt)
{
Alloc_t().construct(&buf_[cpt], *it);
}
std::swap(data_, buf_);
for(iterator it { begin() }; it != end(); ++it)
{
Alloc_t().destroy(it);
}
Alloc_t().deallocate(buf_, capacity_);
capacity_ = cap;
return *this;
}
field_t & resize(std::size_t const & nSize)
{
if(nSize < size_)
{
for(iterator it {begin() + (nSize-1)} ; it != end(); ++it)
{
Alloc_t().destroy(it);
}
size_ = nSize;
}
return *this;
}
void remove(key_t const & key)
{
if(exist(key))
{
iterator itb { begin()+key };
iterator ite { end()-1 };
Alloc_t().destroy(itb);
Alloc_t().construct(itb, *ite);
Alloc_t().destroy(ite);
--size_;
}
}
field_t & push(data_t const & data)
{
if(!exist(data.key_))
{
if(++size_ >= capacity_)
{
reserve(capacity_ * 1.5f);
}
Alloc_t().construct(&data_[size_-1], data);
return *this;
}
data_[offsetOf(data.key_)] = data;
return *this;
}
template<typename ...TArgs>
inline field_t & push(key_t const & key, TArgs&&... args)
{
return push(data_t{key, args...});
}
inline data_t & get(std::size_t const & id)
{
return data_[id];
}
data_t const & operator[](key_t const & key)
{
for(iterator it { begin() }; it != end(); ++it)
{
if(it->key_ == key)
{
return *it;
}
}
if(++size_ >= capacity_)
{
reserve(capacity_ * 1.5f);
}
Alloc_t().construct(&data_[size_-1], data_t{key});
return data_[size_-1];
}
}; |
réaliser un iterateur sur attributs
Répondre avec citation
A méditer: La solution la plus simple est toujours la moins compliquée
Envoyé par BioKore
Partager