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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
|
// Copyright (c) 2015 Noah Lopez
// Use, modification, and distribution is subject to the Boost Software
// License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#pragma once
#ifndef MSEMSTDVECTOR_H
#define MSEMSTDVECTOR_H
#include "debug/mse/msemsevector.h"
#ifdef MSE_SAFER_SUBSTITUTES_DISABLED
#define MSE_MSTDVECTOR_DISABLED
#endif /*MSE_SAFER_SUBSTITUTES_DISABLED*/
namespace mse {
namespace mstd {
#ifdef MSE_MSTDVECTOR_DISABLED
template<class _Ty, class _A = std::allocator<_Ty> > using vector = std::vector<_Ty, _A>;
#else /*MSE_MSTDVECTOR_DISABLED*/
#ifndef _NOEXCEPT
#define _NOEXCEPT
#endif /*_NOEXCEPT*/
template<class _Ty, class _A = std::allocator<_Ty> >
class vector {
public:
typedef mse::mstd::vector<_Ty, _A> _Myt;
typedef mse::msevector<_Ty, _A> _MV;
typedef typename _MV::allocator_type allocator_type;
typedef typename _MV::value_type value_type;
typedef typename _MV::size_type size_type;
typedef typename _MV::difference_type difference_type;
typedef typename _MV::pointer pointer;
typedef typename _MV::const_pointer const_pointer;
typedef typename _MV::reference reference;
typedef typename _MV::const_reference const_reference;
const _MV& msevector() const { return (*m_shptr); }
_MV& msevector() { return (*m_shptr); }
operator const _MV() const { return msevector(); }
operator _MV() { return msevector(); }
explicit vector(const _A& _Al = _A()) : m_shptr(std::make_shared<_MV>(_Al)) {}
explicit vector(size_type _N) : m_shptr(std::make_shared<_MV>(_N)) {}
explicit vector(size_type _N, const _Ty& _V, const _A& _Al = _A()) : m_shptr(std::make_shared<_MV>(_N, _V, _Al)) {}
vector(_Myt&& _X) : m_shptr(std::make_shared<_MV>(std::move(_X.msevector()))) {}
vector(const _Myt& _X) : m_shptr(std::make_shared<_MV>(_X.msevector())) {}
vector(_MV&& _X) : m_shptr(std::make_shared<_MV>(std::move(_X))) {}
vector(const _MV& _X) : m_shptr(std::make_shared<_MV>(_X)) {}
vector(std::vector<_Ty>&& _X) : m_shptr(std::make_shared<_MV>(std::move(_X))) {}
vector(const std::vector<_Ty>& _X) : m_shptr(std::make_shared<_MV>(_X)) {}
typedef typename _MV::const_iterator _It;
vector(_It _F, _It _L, const _A& _Al = _A()) : m_shptr(std::make_shared<_MV>(_F, _L, _Al)) {}
vector(const _Ty* _F, const _Ty* _L, const _A& _Al = _A()) : m_shptr(std::make_shared<_MV>(_F, _L, _Al)) {}
template<class _Iter, class = typename std::enable_if<_mse_Is_iterator<_Iter>::value, void>::type>
vector(_Iter _First, _Iter _Last) : m_shptr(std::make_shared<_MV>(_First, _Last)) {}
template<class _Iter, class = typename std::enable_if<_mse_Is_iterator<_Iter>::value, void>::type>
vector(_Iter _First, _Iter _Last, const _A& _Al) : m_shptr(std::make_shared<_MV>(_First, _Last, _Al)) {}
_Myt& operator=(_MV&& _X) { m_shptr->operator=(std::move(_X)); return (*this); }
_Myt& operator=(const _MV& _X) { m_shptr->operator=(_X); return (*this); }
_Myt& operator=(_Myt&& _X) { m_shptr->operator=(std::move(_X.msevector())); return (*this); }
_Myt& operator=(const _Myt& _X) { m_shptr->operator=(_X.msevector()); return (*this); }
void reserve(size_type _Count) { m_shptr->reserve(_Count); }
void resize(size_type _N, const _Ty& _X = _Ty()) { m_shptr->resize(_N, _X); }
typename _MV::const_reference operator[](size_type _P) const { return m_shptr->operator[](_P); }
typename _MV::reference operator[](size_type _P) { return m_shptr->operator[](_P); }
void push_back(_Ty&& _X) { m_shptr->push_back(std::move(_X)); }
void push_back(const _Ty& _X) { m_shptr->push_back(_X); }
void pop_back() { m_shptr->pop_back(); }
void assign(_It _F, _It _L) { m_shptr->assign(_F, _L); }
void assign(size_type _N, const _Ty& _X = _Ty()) { m_shptr->assign(_N, _X); }
template<class ..._Valty>
void emplace_back(_Valty&& ..._Val) { m_shptr->emplace_back(std::forward<_Valty>(_Val)...); }
void clear() { m_shptr->clear(); }
void swap(_MV& _X) { m_shptr->swap(_X); }
void swap(_Myt& _X) { m_shptr->swap(_X.msevector()); }
vector(_XSTD initializer_list<typename _MV::value_type> _Ilist, const _A& _Al = _A()) : m_shptr(std::make_shared<_MV>(_Ilist, _Al)) {}
_Myt& operator=(_XSTD initializer_list<typename _MV::value_type> _Ilist) { m_shptr->operator=(_Ilist); return (*this); }
void assign(_XSTD initializer_list<typename _MV::value_type> _Ilist) { m_shptr->assign(_Ilist); }
size_type capacity() const _NOEXCEPT{ return m_shptr->capacity(); }
void shrink_to_fit() { m_shptr->shrink_to_fit(); }
size_type size() const _NOEXCEPT{ return m_shptr->size(); }
size_type max_size() const _NOEXCEPT{ return m_shptr->max_size(); }
bool empty() const _NOEXCEPT{ return m_shptr->empty(); }
_A get_allocator() const _NOEXCEPT{ return m_shptr->get_allocator(); }
typename _MV::const_reference at(size_type _Pos) const { return m_shptr->at(_Pos); }
typename _MV::reference at(size_type _Pos) { return m_shptr->at(_Pos); }
typename _MV::reference front() { return m_shptr->front(); }
typename _MV::const_reference front() const { return m_shptr->front(); }
typename _MV::reference back() { return m_shptr->back(); }
typename _MV::const_reference back() const { return m_shptr->back(); }
/* Try to avoid using these whenever possible. */
value_type *data() _NOEXCEPT {
return m_shptr->data();
}
const value_type *data() const _NOEXCEPT {
return m_shptr->data();
}
class const_iterator : public _MV::random_access_const_iterator_base {
public:
typedef typename _MV::ss_const_iterator_type::iterator_category iterator_category;
typedef typename _MV::ss_const_iterator_type::value_type value_type;
typedef typename _MV::ss_const_iterator_type::difference_type difference_type;
typedef typename _MV::difference_type distance_type; // retained
typedef typename _MV::ss_const_iterator_type::pointer pointer;
typedef typename _MV::ss_const_iterator_type::reference reference;
const_iterator() {}
const_iterator(const const_iterator& src_cref) : m_msevector_cshptr(src_cref.m_msevector_cshptr) {
(*this) = src_cref;
}
~const_iterator() {}
const typename _MV::ss_const_iterator_type& msevector_ss_const_iterator_type() const { return m_ss_const_iterator; }
typename _MV::ss_const_iterator_type& msevector_ss_const_iterator_type() { return m_ss_const_iterator; }
const typename _MV::ss_const_iterator_type& mvssci() const { return msevector_ss_const_iterator_type(); }
typename _MV::ss_const_iterator_type& mvssci() { return msevector_ss_const_iterator_type(); }
void reset() { msevector_ss_const_iterator_type().reset(); }
bool points_to_an_item() const { return msevector_ss_const_iterator_type().points_to_an_item(); }
bool points_to_end_marker() const { return msevector_ss_const_iterator_type().points_to_end_marker(); }
bool points_to_beginning() const { return msevector_ss_const_iterator_type().points_to_beginning(); }
/* has_next_item_or_end_marker() is just an alias for points_to_an_item(). */
bool has_next_item_or_end_marker() const { return msevector_ss_const_iterator_type().has_next_item_or_end_marker(); }
/* has_next() is just an alias for points_to_an_item() that's familiar to java programmers. */
bool has_next() const { return msevector_ss_const_iterator_type().has_next(); }
bool has_previous() const { return msevector_ss_const_iterator_type().has_previous(); }
void set_to_beginning() { msevector_ss_const_iterator_type().set_to_beginning(); }
void set_to_end_marker() { msevector_ss_const_iterator_type().set_to_end_marker(); }
void set_to_next() { msevector_ss_const_iterator_type().set_to_next(); }
void set_to_previous() { msevector_ss_const_iterator_type().set_to_previous(); }
const_iterator& operator ++() { msevector_ss_const_iterator_type().operator ++(); return (*this); }
const_iterator operator++(int) { const_iterator _Tmp = *this; ++*this; return (_Tmp); }
const_iterator& operator --() { msevector_ss_const_iterator_type().operator --(); return (*this); }
const_iterator operator--(int) { const_iterator _Tmp = *this; --*this; return (_Tmp); }
void advance(typename _MV::difference_type n) { msevector_ss_const_iterator_type().advance(n); }
void regress(typename _MV::difference_type n) { msevector_ss_const_iterator_type().regress(n); }
const_iterator& operator +=(difference_type n) { msevector_ss_const_iterator_type().operator +=(n); return (*this); }
const_iterator& operator -=(difference_type n) { msevector_ss_const_iterator_type().operator -=(n); return (*this); }
const_iterator operator+(difference_type n) const { auto retval = (*this); retval += n; return retval; }
const_iterator operator-(difference_type n) const { return ((*this) + (-n)); }
typename _MV::difference_type operator-(const const_iterator& _Right_cref) const { return msevector_ss_const_iterator_type() - (_Right_cref.msevector_ss_const_iterator_type()); }
typename _MV::const_reference operator*() const { return msevector_ss_const_iterator_type().operator*(); }
typename _MV::const_reference item() const { return operator*(); }
typename _MV::const_reference previous_item() const { return msevector_ss_const_iterator_type().previous_item(); }
typename _MV::const_pointer operator->() const { return msevector_ss_const_iterator_type().operator->(); }
typename _MV::const_reference operator[](typename _MV::difference_type _Off) const { return (*(*this + _Off)); }
bool operator==(const const_iterator& _Right_cref) const { return msevector_ss_const_iterator_type().operator==(_Right_cref.msevector_ss_const_iterator_type()); }
bool operator!=(const const_iterator& _Right_cref) const { return (!(_Right_cref == (*this))); }
bool operator<(const const_iterator& _Right) const { return (msevector_ss_const_iterator_type() < _Right.msevector_ss_const_iterator_type()); }
bool operator<=(const const_iterator& _Right) const { return (msevector_ss_const_iterator_type() <= _Right.msevector_ss_const_iterator_type()); }
bool operator>(const const_iterator& _Right) const { return (msevector_ss_const_iterator_type() > _Right.msevector_ss_const_iterator_type()); }
bool operator>=(const const_iterator& _Right) const { return (msevector_ss_const_iterator_type() >= _Right.msevector_ss_const_iterator_type()); }
void set_to_const_item_pointer(const const_iterator& _Right_cref) { msevector_ss_const_iterator_type().set_to_const_item_pointer(_Right_cref.msevector_ss_const_iterator_type()); }
msev_size_t position() const { return msevector_ss_const_iterator_type().position(); }
private:
const_iterator(std::shared_ptr<_MV> msevector_shptr) : m_msevector_cshptr(msevector_shptr) {
m_ss_const_iterator = msevector_shptr->ss_cbegin();
}
std::shared_ptr<const _MV> m_msevector_cshptr;
/* m_ss_const_iterator needs to be declared after m_msevector_cshptr so that it's destructor will be called first. */
typename _MV::ss_const_iterator_type m_ss_const_iterator;
friend class /*_Myt*/vector<_Ty, _A>;
friend class iterator;
};
class iterator : public _MV::random_access_iterator_base {
public:
typedef typename _MV::ss_iterator_type::iterator_category iterator_category;
typedef typename _MV::ss_iterator_type::value_type value_type;
typedef typename _MV::ss_iterator_type::difference_type difference_type;
typedef typename _MV::difference_type distance_type; // retained
typedef typename _MV::ss_iterator_type::pointer pointer;
typedef typename _MV::ss_iterator_type::reference reference;
iterator() {}
iterator(const iterator& src_cref) : m_msevector_shptr(src_cref.m_msevector_shptr) {
(*this) = src_cref;
}
~iterator() {}
const typename _MV::ss_iterator_type& msevector_ss_iterator_type() const { return m_ss_iterator; }
typename _MV::ss_iterator_type& msevector_ss_iterator_type() { return m_ss_iterator; }
const typename _MV::ss_iterator_type& mvssi() const { return msevector_ss_iterator_type(); }
typename _MV::ss_iterator_type& mvssi() { return msevector_ss_iterator_type(); }
operator const_iterator() const {
const_iterator retval(m_msevector_shptr);
if (m_msevector_shptr) {
retval.msevector_ss_const_iterator_type().set_to_beginning();
retval.msevector_ss_const_iterator_type().advance(msev_int(msevector_ss_iterator_type().position()));
}
return retval;
}
void reset() { msevector_ss_iterator_type().reset(); }
bool points_to_an_item() const { return msevector_ss_iterator_type().points_to_an_item(); }
bool points_to_end_marker() const { return msevector_ss_iterator_type().points_to_end_marker(); }
bool points_to_beginning() const { return msevector_ss_iterator_type().points_to_beginning(); }
/* has_next_item_or_end_marker() is just an alias for points_to_an_item(). */
bool has_next_item_or_end_marker() const { return msevector_ss_iterator_type().has_next_item_or_end_marker(); }
/* has_next() is just an alias for points_to_an_item() that's familiar to java programmers. */
bool has_next() const { return msevector_ss_iterator_type().has_next(); }
bool has_previous() const { return msevector_ss_iterator_type().has_previous(); }
void set_to_beginning() { msevector_ss_iterator_type().set_to_beginning(); }
void set_to_end_marker() { msevector_ss_iterator_type().set_to_end_marker(); }
void set_to_next() { msevector_ss_iterator_type().set_to_next(); }
void set_to_previous() { msevector_ss_iterator_type().set_to_previous(); }
iterator& operator ++() { msevector_ss_iterator_type().operator ++(); return (*this); }
iterator operator++(int) { iterator _Tmp = *this; ++*this; return (_Tmp); }
iterator& operator --() { msevector_ss_iterator_type().operator --(); return (*this); }
iterator operator--(int) { iterator _Tmp = *this; --*this; return (_Tmp); }
void advance(typename _MV::difference_type n) { msevector_ss_iterator_type().advance(n); }
void regress(typename _MV::difference_type n) { msevector_ss_iterator_type().regress(n); }
iterator& operator +=(difference_type n) { msevector_ss_iterator_type().operator +=(n); return (*this); }
iterator& operator -=(difference_type n) { msevector_ss_iterator_type().operator -=(n); return (*this); }
iterator operator+(difference_type n) const { auto retval = (*this); retval += n; return retval; }
iterator operator-(difference_type n) const { return ((*this) + (-n)); }
typename _MV::difference_type operator-(const iterator& _Right_cref) const { return msevector_ss_iterator_type() - (_Right_cref.msevector_ss_iterator_type()); }
typename _MV::reference operator*() const { return msevector_ss_iterator_type().operator*(); }
typename _MV::reference item() const { return operator*(); }
typename _MV::reference previous_item() const { return msevector_ss_iterator_type().previous_item(); }
typename _MV::pointer operator->() const { return msevector_ss_iterator_type().operator->(); }
typename _MV::reference operator[](typename _MV::difference_type _Off) const { return (*(*this + _Off)); }
bool operator==(const iterator& _Right_cref) const { return msevector_ss_iterator_type().operator==(_Right_cref.msevector_ss_iterator_type()); }
bool operator!=(const iterator& _Right_cref) const { return (!(_Right_cref == (*this))); }
bool operator<(const iterator& _Right) const { return (msevector_ss_iterator_type() < _Right.msevector_ss_iterator_type()); }
bool operator<=(const iterator& _Right) const { return (msevector_ss_iterator_type() <= _Right.msevector_ss_iterator_type()); }
bool operator>(const iterator& _Right) const { return (msevector_ss_iterator_type() > _Right.msevector_ss_iterator_type()); }
bool operator>=(const iterator& _Right) const { return (msevector_ss_iterator_type() >= _Right.msevector_ss_iterator_type()); }
void set_to_item_pointer(const iterator& _Right_cref) { msevector_ss_iterator_type().set_to_item_pointer(_Right_cref.msevector_ss_iterator_type()); }
msev_size_t position() const { return msevector_ss_iterator_type().position(); }
private:
std::shared_ptr<_MV> m_msevector_shptr;
/* m_ss_iterator needs to be declared after m_msevector_shptr so that it's destructor will be called first. */
typename _MV::ss_iterator_type m_ss_iterator;
friend class /*_Myt*/vector<_Ty, _A>;
};
iterator begin()
{ // return iterator for beginning of mutable sequence
iterator retval; retval.m_msevector_shptr = this->m_shptr;
(retval.m_ss_iterator) = m_shptr->ss_begin();
return retval;
}
const_iterator begin() const
{ // return iterator for beginning of nonmutable sequence
const_iterator retval; retval.m_msevector_cshptr = this->m_shptr;
(retval.m_ss_const_iterator) = m_shptr->ss_begin();
return retval;
}
iterator end() { // return iterator for end of mutable sequence
iterator retval; retval.m_msevector_shptr = this->m_shptr;
(retval.m_ss_iterator) = m_shptr->ss_end();
return retval;
}
const_iterator end() const { // return iterator for end of nonmutable sequence
const_iterator retval; retval.m_msevector_cshptr = this->m_shptr;
(retval.m_ss_const_iterator) = m_shptr->ss_end();
return retval;
}
const_iterator cbegin() const { // return iterator for beginning of nonmutable sequence
const_iterator retval; retval.m_msevector_cshptr = this->m_shptr;
(retval.m_ss_const_iterator) = m_shptr->ss_cbegin();
return retval;
}
const_iterator cend() const { // return iterator for end of nonmutable sequence
const_iterator retval; retval.m_msevector_cshptr = this->m_shptr;
(retval.m_ss_const_iterator) = m_shptr->ss_cend();
return retval;
}
vector(const const_iterator &start, const const_iterator &end, const _A& _Al = _A())
: m_shptr(std::make_shared<_MV>(start.msevector_ss_const_iterator_type(), end.msevector_ss_const_iterator_type(), _Al)) {}
void assign(const const_iterator &start, const const_iterator &end) {
m_shptr->assign(start.msevector_ss_const_iterator_type(), end.msevector_ss_const_iterator_type());
}
void assign_inclusive(const const_iterator &first, const const_iterator &last) {
m_shptr->assign_inclusive(first.msevector_ss_const_iterator_type(), last.msevector_ss_const_iterator_type());
}
iterator insert_before(const const_iterator &pos, size_type _M, const _Ty& _X) {
auto res = m_shptr->insert_before(pos.msevector_ss_const_iterator_type(), _M, _X);
iterator retval = begin(); retval.msevector_ss_iterator_type() = res;
return retval;
}
iterator insert_before(const const_iterator &pos, _Ty&& _X) {
auto res = m_shptr->insert_before(pos.msevector_ss_const_iterator_type(), std::move(_X));
iterator retval = begin(); retval.msevector_ss_iterator_type() = res;
return retval;
}
iterator insert_before(const const_iterator &pos, const _Ty& _X = _Ty()) { return insert_before(pos, 1, _X); }
template<class _Iter
//>typename std::enable_if<_mse_Is_iterator<_Iter>::value, typename base_class::iterator>::type
, class = _mse_RequireInputIter<_Iter> >
iterator insert_before(const const_iterator &pos, const _Iter &start, const _Iter &end) {
auto res = m_shptr->insert_before(pos.msevector_ss_const_iterator_type(), start, end);
iterator retval = begin(); retval.msevector_ss_iterator_type() = res;
return retval;
}
template<class _Iter
//>typename std::enable_if<_mse_Is_iterator<_Iter>::value, typename base_class::iterator>::type
, class = _mse_RequireInputIter<_Iter> >
iterator insert_before_inclusive(const const_iterator &pos, const _Iter &first, const _Iter &last) {
auto end = last; end++;
return insert_before(pos, first, end);
}
iterator insert_before(const const_iterator &pos, _XSTD initializer_list<typename _MV::value_type> _Ilist) { // insert initializer_list
auto res = m_shptr->insert_before(pos.msevector_ss_const_iterator_type(), _Ilist);
iterator retval = begin(); retval.msevector_ss_iterator_type() = res;
return retval;
}
void insert_before(msev_size_t pos, const _Ty& _X = _Ty()) {
m_shptr->insert_before(pos, _X);
}
void insert_before(msev_size_t pos, size_type _M, const _Ty& _X) {
m_shptr->insert_before(pos, _M, _X);
}
void insert_before(msev_size_t pos, _XSTD initializer_list<typename _MV::value_type> _Ilist) { // insert initializer_list
m_shptr->insert_before(pos, _Ilist);
}
/* These insert() functions are just aliases for their corresponding insert_before() functions. */
iterator insert(const const_iterator &pos, size_type _M, const _Ty& _X) { return insert_before(pos, _M, _X); }
iterator insert(const const_iterator &pos, _Ty&& _X) { return insert_before(pos, std::move(_X)); }
iterator insert(const const_iterator &pos, const _Ty& _X = _Ty()) { return insert_before(pos, _X); }
template<class _Iter
//>typename std::enable_if<_mse_Is_iterator<_Iter>::value, typename base_class::iterator>::type
, class = _mse_RequireInputIter<_Iter> >
iterator insert(const const_iterator &pos, const _Iter &start, const _Iter &end) { return insert_before(pos, start, end); }
iterator insert(const const_iterator &pos, const _Ty* start, const _Ty* end) { return insert_before(pos, start, end); }
iterator insert(const const_iterator &pos, _XSTD initializer_list<typename _MV::value_type> _Ilist) { return insert_before(pos, _Ilist); }
template<class ..._Valty>
iterator emplace(const const_iterator &pos, _Valty&& ..._Val) {
auto res = m_shptr->emplace(pos.msevector_ss_const_iterator_type(), std::forward<_Valty>(_Val)...);
iterator retval = begin(); retval.msevector_ss_iterator_type() = res;
return retval;
}
iterator erase(const const_iterator &pos) {
auto res = m_shptr->erase(pos.msevector_ss_const_iterator_type());
iterator retval = begin(); retval.msevector_ss_iterator_type() = res;
return retval;
}
iterator erase(const const_iterator &start, const const_iterator &end) {
auto res = m_shptr->erase(start.msevector_ss_const_iterator_type(), end.msevector_ss_const_iterator_type());
iterator retval = begin(); retval.msevector_ss_iterator_type() = res;
return retval;
}
iterator erase_inclusive(const const_iterator &first, const const_iterator &last) {
auto end = last; end.set_to_next();
return erase_inclusive(first, end);
}
bool operator==(const _Myt& _Right) const { // test for vector equality
return ((*(_Right.m_shptr)) == (*m_shptr));
}
bool operator<(const _Myt& _Right) const { // test if _Left < _Right for vectors
return ((*m_shptr) < (*(_Right.m_shptr)));
}
private:
std::shared_ptr<_MV> m_shptr;
};
template<class _Ty, class _Alloc> inline bool operator!=(const vector<_Ty, _Alloc>& _Left,
const vector<_Ty, _Alloc>& _Right) { // test for vector inequality
return (!(_Left == _Right));
}
template<class _Ty, class _Alloc> inline bool operator>(const vector<_Ty, _Alloc>& _Left,
const vector<_Ty, _Alloc>& _Right) { // test if _Left > _Right for vectors
return (_Right < _Left);
}
template<class _Ty, class _Alloc> inline bool operator<=(const vector<_Ty, _Alloc>& _Left,
const vector<_Ty, _Alloc>& _Right) { // test if _Left <= _Right for vectors
return (!(_Right < _Left));
}
template<class _Ty, class _Alloc> inline bool operator>=(const vector<_Ty, _Alloc>& _Left,
const vector<_Ty, _Alloc>& _Right) { // test if _Left >= _Right for vectors
return (!(_Left < _Right));
}
#endif /*MSE_MSTDVECTOR_DISABLED*/
}
}
#endif /*ndef MSEMSTDVECTOR_H*/
|
