MeshLib C++ Docs
Loading...
Searching...
No Matches
MRVector.h
Go to the documentation of this file.
1#pragma once
2
3#include "MRMacros.h"
4#include "MRMeshFwd.h"
5#include "MRAllocator.h"
6#include "MRResizeNoInit.h"
7#include "MRPch/MRBindingMacros.h"
8#include <cassert>
9
10namespace MR
11{
14
15
22template <typename T, typename I>
23class Vector
24{
25public:
26 using StdVector = std::vector<T, Allocator<T>>;
27 using value_type = typename StdVector::value_type;
28 using reference = typename StdVector::reference;
29 using const_reference = typename StdVector::const_reference;
30 using size_type = typename StdVector::size_type;
31 using difference_type = typename StdVector::difference_type;
32
33 using iterator MR_BIND_IGNORE = typename StdVector::iterator;
34 using const_iterator MR_BIND_IGNORE = typename StdVector::const_iterator;
35 using reverse_iterator MR_BIND_IGNORE = typename StdVector::reverse_iterator;
36 using const_reverse_iterator MR_BIND_IGNORE = typename StdVector::const_reverse_iterator;
37 using pointer = typename StdVector::pointer;
38 using const_pointer = typename StdVector::const_pointer;
39
41 Vector() = default;
42
44 MR_BIND_OVERLOAD_SUFFIX() explicit Vector( size_t size ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::default_initializable<T> ) : vec( size ) { }
45
47 MR_BIND_OVERLOAD_SUFFIX(fill) explicit Vector( size_t size, const T & val ) : vec( size, val ) { }
48
49 template< class InputIt >
50 Vector( InputIt first, InputIt last ) : vec( first, last ) { }
51
52 Vector( std::initializer_list<T> init ) : vec( init ) { }
53
55 void assign( size_t count, const T & val MR_LIFETIME_CAPTURE_BY_NESTED(this) ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::is_copy_assignable_v<T> ) { vec.assign( count, val ); }
56
58 template< class InputIt >
59 void assign( InputIt first, InputIt last ) { vec.assign( first, last ); }
60
61 void assign( std::initializer_list<T> init ) { vec.assign( init ); }
62
63 [[nodiscard]] bool operator == ( const Vector & b ) const MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::equality_comparable<T> ) { return vec == b.vec; }
64 [[nodiscard]] bool operator != ( const Vector & b ) const MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::equality_comparable<T> ) { return vec != b.vec; }
65
66 void clear() { vec.clear(); }
67
68 [[nodiscard]] bool empty() const { return vec.empty(); }
69
70 [[nodiscard]] std::size_t size() const { return vec.size(); }
71
72 [[nodiscard]] std::size_t max_size() const { return vec.max_size(); }
73
74 void resize( size_t newSize ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::movable<T> && std::default_initializable<T> ) { vec.resize( newSize ); }
75 void resize( size_t newSize, const T & t ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::movable<T> ) { vec.resize( newSize, t ); }
76
78 void resizeNoInit( size_t targetSize, ReserveMode mode = ReserveMode::Exact ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::constructible_from<T, NoInit> ) { MR::resizeNoInit( vec, targetSize, mode ); }
79
80 [[nodiscard]] std::size_t capacity() const { return vec.capacity(); }
81
82 void reserve( size_t capacity ) { vec.reserve( capacity ); }
83
84 void shrink_to_fit() { vec.shrink_to_fit(); }
85
86 [[nodiscard]] const_reference operator[]( I i ) const MR_LIFETIMEBOUND
87 {
88 assert( i < vec.size() );
89 return vec[i];
90 }
92 {
93 assert( i < vec.size() );
94 return vec[i];
95 }
96
98 [[deprecated( "use resize() instead" )]]
99 void resizeWithReserve( size_t newSize ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::default_initializable<T> )
100 {
101 vec.resize( newSize );
102 }
103
105 [[deprecated( "use resize() instead" )]]
106 void resizeWithReserve( size_t newSize, const T & value ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::movable<T> )
107 {
108 vec.resize( newSize, value );
109 }
110
113 void autoResizeSet( I pos, size_t len, T val ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::movable<T> && std::is_copy_assignable_v<T> )
114 {
115 assert( pos );
116 const size_t p = pos;
117 if ( const auto sz = size(); p + len > sz )
118 {
120 vec.resize( p + len, val );
121 if ( p >= sz )
122 return;
124 len = sz - p;
125 }
127 for ( size_t i = 0; i < len; ++i )
128 vec[ p + i ] = val;
129 }
130
132 void autoResizeSet( I i, T val ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::is_copy_assignable_v<T> )
133 {
134 autoResizeSet( i, 1, val );
135 }
136
138 [[nodiscard]] reference autoResizeAt( I i ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::default_initializable<T> )
139 {
140 if ( i + 1 > size() )
141 vec.resize( i + 1 );
142 return vec[i];
143 }
144
145 void push_back( const T & t MR_LIFETIME_CAPTURE_BY_NESTED(this) ) { vec.push_back( t ); }
146 void push_back( T && t MR_LIFETIME_CAPTURE_BY_NESTED(this) ) { vec.push_back( std::move( t ) ); }
147 void pop_back() { vec.pop_back(); }
148
150 MR_BIND_IGNORE iterator insert( const_iterator pos, const T & t MR_LIFETIME_CAPTURE_BY_NESTED(this) ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::copy_constructible<T> && std::movable<T> ) { return vec.insert( pos, t ); }
151 MR_BIND_IGNORE iterator insert( const_iterator pos, T && t MR_LIFETIME_CAPTURE_BY_NESTED(this) ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::movable<T> ) { return vec.insert( pos, std::move( t ) ); }
152
154 MR_BIND_IGNORE iterator insert( const_iterator pos, size_t count, const T & t MR_LIFETIME_CAPTURE_BY_NESTED(this) ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::copy_constructible<T> && std::movable<T> ) { return vec.insert( pos, count, t ); }
155
157 template<class InputIt>
158 iterator insert( const_iterator pos, InputIt first, InputIt last ) { return vec.insert( pos, first, last ); }
159
160 MR_BIND_IGNORE iterator insert( const_iterator pos, std::initializer_list<T> init ) { return vec.insert( pos, init ); }
161
163 template<typename... Args> MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::constructible_from<T, Args &&...> && std::movable<T> )
164 iterator emplace( const_iterator pos, Args&&... args ) { return vec.emplace( pos, std::forward<Args>(args)... ); }
165
167 MR_BIND_IGNORE iterator erase( const_iterator pos ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::movable<T> ) { return vec.erase( pos ); }
168
170 MR_BIND_IGNORE iterator erase( const_iterator first, const_iterator last ) MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::movable<T> ) { return vec.erase( first, last ); }
171
172 template<typename... Args> MR_REQUIRES_IF_SUPPORTED( sizeof(T)>0 && std::constructible_from<T, Args &&...> )
173 T& emplace_back( Args&&... args ) { return vec.emplace_back( std::forward<Args>(args)... ); }
174
175 [[nodiscard]] const_reference front() const MR_LIFETIMEBOUND { return vec.front(); }
176 [[nodiscard]] reference front() MR_LIFETIMEBOUND { return vec.front(); }
177 [[nodiscard]] const_reference back() const MR_LIFETIMEBOUND { return vec.back(); }
178 [[nodiscard]] reference back() MR_LIFETIMEBOUND { return vec.back(); }
179
181 [[nodiscard]] I beginId() const { return I( size_t(0) ); }
182
184 [[nodiscard]] I backId() const { assert( !vec.empty() ); return I( vec.size() - 1 ); }
185
187 [[nodiscard]] I endId() const { return I( vec.size() ); }
188
189 [[nodiscard]] T* data() MR_LIFETIMEBOUND { return vec.data(); }
190 [[nodiscard]] const T* data() const MR_LIFETIMEBOUND { return vec.data(); }
191
192 [[nodiscard]] MR_BIND_IGNORE iterator begin() MR_LIFETIMEBOUND { return vec.begin(); }
193 [[nodiscard]] MR_BIND_IGNORE const_iterator begin() const MR_LIFETIMEBOUND { return vec.begin(); }
194 [[nodiscard]] MR_BIND_IGNORE const_iterator cbegin() const MR_LIFETIMEBOUND { return vec.cbegin(); }
195 [[nodiscard]] MR_BIND_IGNORE iterator end() MR_LIFETIMEBOUND { return vec.end(); }
196 [[nodiscard]] MR_BIND_IGNORE const_iterator end() const MR_LIFETIMEBOUND { return vec.end(); }
197 [[nodiscard]] MR_BIND_IGNORE const_iterator cend() const MR_LIFETIMEBOUND { return vec.cend(); }
198 [[nodiscard]] MR_BIND_IGNORE reverse_iterator rbegin() MR_LIFETIMEBOUND { return vec.rbegin(); }
199 [[nodiscard]] MR_BIND_IGNORE const_reverse_iterator rbegin() const MR_LIFETIMEBOUND { return vec.rbegin(); }
200 [[nodiscard]] MR_BIND_IGNORE const_reverse_iterator crbegin() const MR_LIFETIMEBOUND { return vec.crbegin(); }
201 [[nodiscard]] MR_BIND_IGNORE reverse_iterator rend() MR_LIFETIMEBOUND { return vec.rend(); }
202 [[nodiscard]] MR_BIND_IGNORE const_reverse_iterator rend() const MR_LIFETIMEBOUND { return vec.rend(); }
203 [[nodiscard]] MR_BIND_IGNORE const_reverse_iterator crend() const MR_LIFETIMEBOUND { return vec.crend(); }
204
205 void swap( Vector & b ) { vec.swap( b.vec ); }
206
208 [[nodiscard]] size_t heapBytes() const { return capacity() * sizeof(T); }
209
210 [[nodiscard]] MR_BIND_IGNORE friend const_iterator begin( const Vector<T, I> & a ) { return a.vec.begin(); }
211 [[nodiscard]] MR_BIND_IGNORE friend iterator begin( Vector<T, I> & a ) { return a.vec.begin(); }
212 [[nodiscard]] MR_BIND_IGNORE friend const_iterator end( const Vector<T, I> & a ) { return a.vec.end(); }
213 [[nodiscard]] MR_BIND_IGNORE friend iterator end( Vector<T, I> & a ) { return a.vec.end(); }
214
216 template <typename U>
217 friend size_t erase( Vector<T, I> & a, const U & value ) { return std::erase( a.vec, value ); }
218
220 template <typename Pred>
221 friend size_t erase_if( Vector<T, I> & a, Pred pred ) { return std::erase_if( a.vec, pred ); }
222
225
226#if defined( MR_PARSING_FOR_ANY_BINDINGS ) || defined( MR_COMPILING_ANY_BINDINGS )
227 static_assert( sizeof(T) > 0 );
228#endif
229};
230
232template <typename T>
233[[nodiscard]] inline T getAt( const std::vector<T>& a, size_t id, T def = {} )
234{
235 return id < a.size() ? a[id] : def;
236}
237
239template <typename T, typename I>
240[[nodiscard]] inline T getAt( const Vector<T, I> & a, I id, T def = {} )
241{
242 return size_t( id ) < a.size() ? a[id] : def;
243}
244
245}
#define MR_LIFETIMEBOUND
Definition MRMacros.h:86
#define MR_LIFETIME_CAPTURE_BY_NESTED(x)
Definition MRMacros.h:91
#define MR_REQUIRES_IF_SUPPORTED(...)
Definition MRMacros.h:33
Vector<T> is indexed by size_t.
Definition MRVector.h:24
reverse_iterator rbegin()
Definition MRVector.h:198
void push_back(T &&t MR_LIFETIME_CAPTURE_BY_NESTED(this))
Definition MRVector.h:146
std::vector< Node, Allocator< Node > > StdVector
Definition MRVector.h:26
void pop_back()
Definition MRVector.h:147
Vector()=default
creates empty vector
void assign(size_t count, const T &val MR_LIFETIME_CAPTURE_BY_NESTED(this))
replaces the contents with count copies of val
Definition MRVector.h:55
void clear()
Definition MRVector.h:66
void resizeNoInit(std::vector< T, A > &vec, size_t targetSize, ReserveMode mode=ReserveMode::Exact)
Definition MRResizeNoInit.h:67
reference front()
Definition MRVector.h:176
void autoResizeSet(I i, T val)
sets the element i to the given value, adjusting the size of the vector to include new element
Definition MRVector.h:132
std::size_t size() const
Definition MRVector.h:70
std::size_t capacity() const
Definition MRVector.h:80
void shrink_to_fit()
Definition MRVector.h:84
bool operator==(const Vector &b) const
Definition MRVector.h:63
iterator insert(const_iterator pos, InputIt first, InputIt last)
inserts elements from range [first, last) before pos
Definition MRVector.h:158
void resizeWithReserve(size_t newSize)
same as resize(newSize), which already grows the capacity geometrically
Definition MRVector.h:99
typename StdVector::const_reference const_reference
Definition MRVector.h:29
reference operator[](I i)
Definition MRVector.h:91
T getAt(const Buffer< T, I > &bmap, I key, T def={})
given some buffer map and a key, returns the value associated with the key, or default value if key i...
Definition MRBuffer.h:140
void autoResizeSet(I pos, size_t len, T val)
Definition MRVector.h:113
typename StdVector::reverse_iterator reverse_iterator
Definition MRVector.h:35
typename StdVector::reference reference
Definition MRVector.h:28
void assign(InputIt first, InputIt last)
replaces the contents with elements from range [first, last)
Definition MRVector.h:59
friend const_iterator begin(const Vector< T, I > &a)
Definition MRVector.h:210
void resizeNoInit(size_t targetSize, ReserveMode mode=ReserveMode::Exact)
resizes the vector skipping initialization of its elements (more precisely initializing them using ( ...
Definition MRVector.h:78
StdVector vec
Definition MRVector.h:224
friend const_iterator end(const Vector< T, I > &a)
Definition MRVector.h:212
T * data()
Definition MRVector.h:189
friend iterator end(Vector< T, I > &a)
Definition MRVector.h:213
void push_back(const T &t MR_LIFETIME_CAPTURE_BY_NESTED(this))
Definition MRVector.h:145
iterator insert(const_iterator pos, T &&t MR_LIFETIME_CAPTURE_BY_NESTED(this))
Definition MRVector.h:151
Vector(InputIt first, InputIt last)
Definition MRVector.h:50
typename StdVector::pointer pointer
Definition MRVector.h:37
void reserve(size_t capacity)
Definition MRVector.h:82
typename StdVector::size_type size_type
Definition MRVector.h:30
I beginId() const
returns the identifier of the first element
Definition MRVector.h:181
void assign(std::initializer_list< T > init)
Definition MRVector.h:61
const_reverse_iterator rend() const
Definition MRVector.h:202
typename StdVector::value_type value_type
Definition MRVector.h:27
iterator insert(const_iterator pos, const T &t MR_LIFETIME_CAPTURE_BY_NESTED(this))
inserts t before pos
Definition MRVector.h:150
size_t heapBytes() const
returns the amount of memory this object occupies on heap
Definition MRVector.h:208
iterator erase(const_iterator first, const_iterator last)
removes the elements in range [first, last)
Definition MRVector.h:170
const_reference operator[](I i) const
Definition MRVector.h:86
friend size_t erase(Vector< T, I > &a, const U &value)
removes all elements equal to value, returns the number of removed elements
Definition MRVector.h:217
I backId() const
returns the identifier of the back() element
Definition MRVector.h:184
const_reverse_iterator crbegin() const
Definition MRVector.h:200
Vector(std::initializer_list< T > init)
Definition MRVector.h:52
iterator emplace(const_iterator pos, Args &&... args)
Definition MRVector.h:164
friend size_t erase_if(Vector< T, I > &a, Pred pred)
removes all elements satisfying pred, returns the number of removed elements
Definition MRVector.h:221
typename StdVector::difference_type difference_type
Definition MRVector.h:31
const_iterator begin() const
Definition MRVector.h:193
reference back()
Definition MRVector.h:178
const_iterator cend() const
Definition MRVector.h:197
typename StdVector::const_pointer const_pointer
Definition MRVector.h:38
void resizeWithReserve(size_t newSize, const T &value)
same as resize(newSize, value), which already grows the capacity geometrically
Definition MRVector.h:106
const_iterator end() const
Definition MRVector.h:196
reverse_iterator rend()
Definition MRVector.h:201
const T * data() const
Definition MRVector.h:190
iterator begin()
Definition MRVector.h:192
iterator end()
Definition MRVector.h:195
const_reverse_iterator rbegin() const
Definition MRVector.h:199
iterator insert(const_iterator pos, size_t count, const T &t MR_LIFETIME_CAPTURE_BY_NESTED(this))
inserts count copies of t before pos
Definition MRVector.h:154
friend iterator begin(Vector< T, I > &a)
Definition MRVector.h:211
bool empty() const
Definition MRVector.h:68
bool operator!=(const Vector &b) const
Definition MRVector.h:64
Vector(size_t size, const T &val)
creates a vector with size elements with the given value
Definition MRVector.h:47
typename StdVector::const_iterator const_iterator
Definition MRVector.h:34
iterator erase(const_iterator pos)
removes the element at pos
Definition MRVector.h:167
typename StdVector::const_reverse_iterator const_reverse_iterator
Definition MRVector.h:36
void resize(size_t newSize)
Definition MRVector.h:74
reference autoResizeAt(I i)
this accessor automatically adjusts the size of the vector
Definition MRVector.h:138
typename StdVector::iterator iterator
Definition MRVector.h:33
const_iterator cbegin() const
Definition MRVector.h:194
void resize(size_t newSize, const T &t)
Definition MRVector.h:75
void swap(Vector &b)
Definition MRVector.h:205
std::size_t max_size() const
Definition MRVector.h:72
iterator insert(const_iterator pos, std::initializer_list< T > init)
Definition MRVector.h:160
ReserveMode
how resizeNoInit reserves the memory when the capacity is short
Definition MRResizeNoInit.h:58
const_reverse_iterator crend() const
Definition MRVector.h:203
const_reference front() const
Definition MRVector.h:175
Node & emplace_back(Args &&... args)
Definition MRVector.h:173
const_reference back() const
Definition MRVector.h:177
I endId() const
returns backId() + 1
Definition MRVector.h:187
@ Exact
exactly the target size: for a vector resized once
Definition MRResizeNoInit.h:59
Only strictly necessary for the bindings (to make MR::MeshIntersectionResult a complete type).
Definition MRCameraOrientationPlugin.h:8