Open3D (C++ API)
0.17.0
|
#include <SmallVector.h>
Protected Types | |
using | ValueParamT = const T & |
Protected Member Functions | |
SmallVectorTemplateBase (size_t Size) | |
void | grow (size_t MinSize=0) |
T * | mallocForGrow (size_t MinSize, size_t &NewCapacity) |
void | moveElementsForGrow (T *NewElts) |
void | takeAllocationForGrow (T *NewElts, size_t NewCapacity) |
Transfer ownership of the allocation, finishing up grow(). More... | |
const T * | reserveForParamAndGetAddress (const T &Elt, size_t N=1) |
T * | reserveForParamAndGetAddress (T &Elt, size_t N=1) |
void | growAndAssign (size_t NumElts, const T &Elt) |
template<typename... ArgTypes> | |
T & | growAndEmplaceBack (ArgTypes &&... Args) |
![]() | |
SmallVectorTemplateCommon (size_t Size) | |
void | grow_pod (size_t MinSize, size_t TSize) |
bool | isSmall () const |
void | resetToSmall () |
Put this vector in a state of being small. More... | |
bool | isReferenceToRange (const void *V, const void *First, const void *Last) const |
Return true if V is an internal reference to the given range. More... | |
bool | isReferenceToStorage (const void *V) const |
Return true if V is an internal reference to this vector. More... | |
bool | isRangeInStorage (const void *First, const void *Last) const |
bool | isSafeToReferenceAfterResize (const void *Elt, size_t NewSize) |
void | assertSafeToReferenceAfterResize (const void *Elt, size_t NewSize) |
Check whether Elt will be invalidated by resizing the vector to NewSize. More... | |
void | assertSafeToAdd (const void *Elt, size_t N=1) |
void | assertSafeToReferenceAfterClear (const T *From, const T *To) |
Check whether any part of the range will be invalidated by clearing. More... | |
template<class ItTy , std::enable_if_t< !std::is_same< std::remove_const_t< ItTy >, T * >::value, bool > = false> | |
void | assertSafeToReferenceAfterClear (ItTy, ItTy) |
void | assertSafeToAddRange (const T *From, const T *To) |
Check whether any part of the range will be invalidated by growing. More... | |
template<class ItTy , std::enable_if_t< !std::is_same< std::remove_const_t< ItTy >, T * >::value, bool > = false> | |
void | assertSafeToAddRange (ItTy, ItTy) |
![]() | |
SmallVectorBase ()=delete | |
SmallVectorBase (void *FirstEl, size_t TotalCapacity) | |
void * | mallocForGrow (size_t MinSize, size_t TSize, size_t &NewCapacity) |
void | grow_pod (void *FirstEl, size_t MinSize, size_t TSize) |
void | set_size (size_t N) |
Static Protected Member Functions | |
static void | destroy_range (T *S, T *E) |
template<typename It1 , typename It2 > | |
static void | uninitialized_move (It1 I, It1 E, It2 Dest) |
template<typename It1 , typename It2 > | |
static void | uninitialized_copy (It1 I, It1 E, It2 Dest) |
static T && | forward_value_param (T &&V) |
static const T & | forward_value_param (const T &V) |
![]() | |
template<class U > | |
static const T * | reserveForParamAndGetAddressImpl (U *This, const T &Elt, size_t N) |
![]() | |
static constexpr size_t | SizeTypeMax () |
The maximum value of the Size_T used. More... | |
Static Protected Attributes | |
static constexpr bool | TakesParamByValue = false |
Friends | |
class | SmallVectorTemplateCommon< T > |
Additional Inherited Members | |
![]() | |
using | size_type = size_t |
using | difference_type = ptrdiff_t |
using | value_type = T |
using | iterator = T * |
using | const_iterator = const T * |
using | const_reverse_iterator = std::reverse_iterator< const_iterator > |
using | reverse_iterator = std::reverse_iterator< iterator > |
using | reference = T & |
using | const_reference = const T & |
using | pointer = T * |
using | const_pointer = const T * |
![]() | |
void * | BeginX |
SmallVectorSizeType< T > | Size |
SmallVectorSizeType< T > | Capacity |
SmallVectorTemplateBase<TriviallyCopyable = false> - This is where we put method implementations that are designed to work with non-trivial T's.
We approximate is_trivially_copyable with trivial move/copy construction and trivial destruction. While the standard doesn't specify that you're allowed copy these types with memcpy, there is no way for the type to observe this. This catches the important case of std::pair<POD, POD>, which is not trivially assignable.
|
protected |
|
inlineprotected |
|
inlinestaticprotected |
|
inlinestaticprotected |
|
inlinestaticprotected |
|
protected |
Grow the allocated memory (without initializing new elements), doubling the size of the allocated memory. Guarantees space for at least one more element, or MinSize more elements if specified.
|
inlineprotected |
|
inlineprotected |
|
inlineprotected |
Create a new allocation big enough for MinSize
and pass back its size in NewCapacity
. This is the first section of grow().
|
protected |
Move existing elements over to the new allocation NewElts
, the middle section of grow().
|
inline |
|
inline |
|
inline |
|
inlineprotected |
Reserve enough space to add one element, and return the updated element pointer in case it was a reference to the storage.
|
inlineprotected |
Reserve enough space to add one element, and return the updated element pointer in case it was a reference to the storage.
|
protected |
Transfer ownership of the allocation, finishing up grow().
|
inlinestaticprotected |
Copy the range [I, E) onto the uninitialized memory starting with "Dest", constructing elements as needed.
|
inlinestaticprotected |
Move the range [I, E) into the uninitialized memory starting with "Dest", constructing elements as needed.
|
friend |
|
staticconstexprprotected |