34concept Trivial = std::is_trivially_constructible_v<T>;
44template <std::constructible_from<NoInit> T>
58template <
typename V,
typename I>
71 [[nodiscard]]
auto capacity()
const {
return capacity_.val; }
72 [[nodiscard]]
auto size()
const {
return size_.val; }
73 [[nodiscard]]
bool empty()
const {
return size_.val == 0; }
75 void clear() { data_.reset(); capacity_ = {}; size_ = {}; }
79 if ( size_.val == newSize )
81 if ( newSize > capacity_.val )
88 std::uninitialized_default_construct_n( p, newSize );
91 data_ = std::unique_ptr<T[], Deleter>( p, Deleter{ newSize } );
92 capacity_.val = newSize;
99 assert( i < size_.val );
104 assert( i < size_.val );
112 [[nodiscard]] I
beginId()
const {
return I{ size_t(0) }; }
134 std::unique_ptr<T[], Deleter> data_;
139template <
typename T,
typename I>
142 return key ? T{bmap[key]} : def;
146template <
typename T,
typename I>
157 UndirectedEdgeBMap
e;
169 for ( T x( 0 ); x < b.
b.
size(); ++x )
172 if ( bx < a.
b.
size() )
#define MR_FINALLY
Definition MRFinally.h:10
#define MR_LIFETIMEBOUND
Definition MRMacros.h:86
#define MR_LIFETIMEBOUND_NESTED
Definition MRMacros.h:89
std::vector<V>-like container that is 1) resized without initialization of its elements,...
Definition MRBuffer.h:60
UndirectedEdgeBMap e
Definition MRBuffer.h:157
Buffer< LeafId, LeafId > b
Definition MRBuffer.h:149
I backId() const
returns the identifier of the back() element
Definition MRBuffer.h:115
friend auto begin(Buffer &a)
Definition MRBuffer.h:124
constexpr ZeroOnMove(ZeroOnMove &&z) noexcept
Definition MRBuffer.h:25
T val
Definition MRBuffer.h:22
void clear()
Definition MRBuffer.h:75
VertBMap v
Definition MRBuffer.h:159
void deallocate(T *p, std::size_t) noexcept
Definition MRAllocator.h:70
T * allocate(std::size_t n)
Definition MRAllocator.h:59
auto size() const
Definition MRBuffer.h:72
auto data()
Definition MRBuffer.h:108
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
FaceBMap f
Definition MRBuffer.h:158
void operator()(T *p) const
Definition MRBuffer.h:132
friend auto begin(const Buffer &a)
Definition MRBuffer.h:123
T type
Definition MRBuffer.h:40
typename NoCtor< V >::type T
Definition MRBuffer.h:62
bool empty() const
Definition MRBuffer.h:73
auto data() const
Definition MRBuffer.h:109
constexpr ZeroOnMove(const ZeroOnMove &) noexcept=delete
I beginId() const
returns the identifier of the first element
Definition MRBuffer.h:112
size_t heapBytes() const
returns the amount of memory this object occupies on heap
Definition MRBuffer.h:121
friend auto end(const Buffer &a)
Definition MRBuffer.h:125
size_t tsize
Definition MRBuffer.h:150
const_reference operator[](I i) const
Definition MRBuffer.h:97
T & reference
Definition MRBuffer.h:63
friend auto end(Buffer &a)
Definition MRBuffer.h:126
void resize(size_t newSize)
Definition MRBuffer.h:77
BMap< T, T > compose(const BMap< T, T > &a, const BMap< T, T > &b)
computes the composition of two mappings x -> a(b(x))
Definition MRBuffer.h:164
I endId() const
returns backId() + 1
Definition MRBuffer.h:118
reference operator[](I i)
Definition MRBuffer.h:102
constexpr ZeroOnMove & operator=(const ZeroOnMove &) noexcept=delete
const T & const_reference
Definition MRBuffer.h:64
const T * const_iterator
Definition MRBuffer.h:66
constexpr ZeroOnMove() noexcept
Definition MRBuffer.h:23
auto capacity() const
Definition MRBuffer.h:71
T * iterator
Definition MRBuffer.h:65
Buffer(size_t size)
Definition MRBuffer.h:69
size_t n
Definition MRBuffer.h:131
Only strictly necessary for the bindings (to make MR::MeshIntersectionResult a complete type).
Definition MRCameraOrientationPlugin.h:8
Definition MRAllocator.h:47
flat map: I -> T
Definition MRBuffer.h:148
this class is similar to T, but does not make default initialization of the fields for best performan...
Definition MRNoDefInit.h:14
Definition MRBuffer.h:156