This document is for a version of USD that is under development. See this page for the current release.
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
TfSmallVector< T, N > Class Template Reference

This is a small-vector class with local storage optimization, the local storage can be specified via a template parameter, and expresses the number of entries the container can store locally. More...

#include <smallVector.h>

Inherits TfSmallVectorBase.

Public Types

Relevant Typedefs.

XXX: Functionality currently missing, and which we would like to add as needed:

  • emplace
  • shrink_to_fit
  • shrink_to_local / shrink_to_internal (or similar, free standing function)
typedef T value_type
 
typedef T & reference
 
typedef const T & const_reference
 

Public Member Functions

reference front ()
 Returns the first element in the vector.
 
const_reference front () const
 Returns the first element in the vector.
 
reference back ()
 Returns the last element in the vector.
 
const_reference back () const
 Returns the last elements in the vector.
 
reference operator[] (size_type i)
 Access the specified element.
 
const_reference operator[] (size_type i) const
 Access the specified element.
 
value_type * data ()
 Direct access to the underlying array.
 
const value_type * data () const
 Direct access to the underlying array.
 
bool operator== (const TfSmallVector &rhs) const
 Lexicographically compares the elements in the vectors for equality.
 
bool operator!= (const TfSmallVector &rhs) const
 Lexicographically compares the elements in the vectors for inequality.
 
Returns an iterator to the beginning of the vector.
iterator begin ()
 
const_iterator begin () const
 
const_iterator cbegin () const
 
Returns an iterator to the end of the vector.
iterator end ()
 
const_iterator end () const
 
const_iterator cend () const
 
Returns a reverse iterator to the beginning of the vector.
reverse_iterator rbegin ()
 
const_reverse_iterator rbegin () const
 
const_reverse_iterator crbegin () const
 
Returns a reverse iterator to the end of the vector.
reverse_iterator rend ()
 
const_reverse_iterator rend () const
 
const_reverse_iterator crend () const
 

Iterator Support.

}@

enum  DefaultInitTag { DefaultInit }
 Construct a vector holding n default-initialized elements. More...
 
using iterator = T *
 
using const_iterator = const T *
 
typedef std::reverse_iterator< iterator > reverse_iterator
 
typedef std::reverse_iterator< const_iterator > const_reverse_iterator
 
 TfSmallVector ()
 }@
 
 TfSmallVector (size_type n)
 Construct a vector holding n value-initialized elements.
 
 TfSmallVector (size_type n, const value_type &v)
 Construct a vector holding n copies of v.
 
 TfSmallVector (size_type n, DefaultInitTag)
 
 TfSmallVector (const TfSmallVector &rhs)
 Copy constructor.
 
 TfSmallVector (TfSmallVector &&rhs)
 Move constructor.
 
 TfSmallVector (std::initializer_list< T > values)
 Construct a new vector from initializer list.
 
template<typename ForwardIterator , typename = _EnableIfForwardIterator<ForwardIterator>>
 TfSmallVector (ForwardIterator first, ForwardIterator last)
 Creates a new vector containing copies of the data between first and last.
 
 ~TfSmallVector ()
 Destructor.
 
TfSmallVectoroperator= (const TfSmallVector &rhs)
 Assignment operator.
 
TfSmallVectoroperator= (TfSmallVector &&rhs)
 Move assignment operator.
 
TfSmallVectoroperator= (std::initializer_list< T > ilist)
 Replace existing contents with the contents of ilist.
 
void swap (TfSmallVector &rhs)
 Swap two vector instances.
 
iterator insert (const_iterator it, value_type &&v)
 Insert an rvalue-reference entry at the given iterator position.
 
iterator insert (const_iterator it, const value_type &v)
 Insert an entry at the given iterator.
 
iterator erase (const_iterator it)
 Erase an entry at the given iterator.
 
iterator erase (const_iterator it, const_iterator last)
 Erase entries between [ first, last ) from the vector.
 
void reserve (size_type newCapacity)
 Reserve storage for newCapacity entries.
 
void resize (size_type newSize, const value_type &v=value_type())
 Resize the vector to newSize and insert copies of \v.
 
void clear ()
 Clear the entries in the vector.
 
template<typename ForwardIterator , typename = _EnableIfForwardIterator<ForwardIterator>>
void assign (ForwardIterator first, ForwardIterator last)
 Clears any previously held entries, and copies entries between [ first, last ) to this vector.
 
void assign (std::initializer_list< T > ilist)
 Replace existing contents with the contents of ilist.
 
template<typename... Args>
void emplace_back (Args &&... args)
 Emplace an entry at the back of the vector.
 
void push_back (const value_type &v)
 Copy an entry to the back of the vector,.
 
void push_back (value_type &&v)
 Move an entry to the back of the vector.
 
template<typename ForwardIterator >
void insert (iterator pos, ForwardIterator first, ForwardIterator last)
 Copy the range denoted by [first, last) into this vector before pos.
 
void insert (iterator pos, std::initializer_list< T > ilist)
 Insert elements from ilist starting at position pos.
 
void pop_back ()
 Remove the entry at the back of the vector.
 
size_type size () const
 Returns the current size of the vector.
 
bool empty () const
 Returns true if this vector is empty.
 
size_type capacity () const
 Returns the current capacity of this vector.
 
static constexpr size_type max_size ()
 Returns the maximum size of this vector.
 
static constexpr size_type internal_capacity ()
 Returns the local storage capacity.
 

Detailed Description

template<typename T, uint32_t N>
class TfSmallVector< T, N >

This is a small-vector class with local storage optimization, the local storage can be specified via a template parameter, and expresses the number of entries the container can store locally.

In addition to the local storage optimization, this vector is also optimized for storing a smaller number of entries on the heap: It features a reduced memory footprint (minimum 16 bytes) by limiting max_size() to 2^32, which should still be more than enough for most use cases where a small-vector is advantageous.

TfSmallVector mimics the std::vector API, and can thus be easily used as a drop-in replacement where appropriate. Note, however, that not all the methods on std::vector are implemented here, and that TfSmallVector may have methods in addition to those that you would find on std::vector.

Note that a TfSmallVector that has grown beyond its local storage, will NOT move its entries back into the local storage once it shrinks back to N.

Definition at line 156 of file smallVector.h.

Member Typedef Documentation

◆ const_iterator

using const_iterator = const T*

Definition at line 180 of file smallVector.h.

◆ const_reference

typedef const T& const_reference

Definition at line 172 of file smallVector.h.

◆ const_reverse_iterator

typedef std::reverse_iterator<const_iterator> const_reverse_iterator

Definition at line 182 of file smallVector.h.

◆ iterator

using iterator = T*

Definition at line 179 of file smallVector.h.

◆ reference

typedef T& reference

Definition at line 171 of file smallVector.h.

◆ reverse_iterator

typedef std::reverse_iterator<iterator> reverse_iterator

Definition at line 181 of file smallVector.h.

◆ value_type

typedef T value_type

Definition at line 170 of file smallVector.h.

Member Enumeration Documentation

◆ DefaultInitTag

Construct a vector holding n default-initialized elements.

Definition at line 211 of file smallVector.h.

Constructor & Destructor Documentation

◆ TfSmallVector() [1/8]

TfSmallVector ( )
inline

}@

Default constructor.

Definition at line 188 of file smallVector.h.

◆ TfSmallVector() [2/8]

TfSmallVector ( size_type  n)
inlineexplicit

Construct a vector holding n value-initialized elements.

Definition at line 192 of file smallVector.h.

◆ TfSmallVector() [3/8]

TfSmallVector ( size_type  n,
const value_type &  v 
)
inline

Construct a vector holding n copies of v.

Definition at line 203 of file smallVector.h.

◆ TfSmallVector() [4/8]

TfSmallVector ( size_type  n,
DefaultInitTag   
)
inline

Definition at line 212 of file smallVector.h.

◆ TfSmallVector() [5/8]

TfSmallVector ( const TfSmallVector< T, N > &  rhs)
inline

Copy constructor.

Definition at line 223 of file smallVector.h.

◆ TfSmallVector() [6/8]

TfSmallVector ( TfSmallVector< T, N > &&  rhs)
inline

Move constructor.

Definition at line 230 of file smallVector.h.

◆ TfSmallVector() [7/8]

TfSmallVector ( std::initializer_list< T >  values)
inline

Construct a new vector from initializer list.

Definition at line 250 of file smallVector.h.

◆ TfSmallVector() [8/8]

TfSmallVector ( ForwardIterator  first,
ForwardIterator  last 
)
inline

Creates a new vector containing copies of the data between first and last.


Definition at line 258 of file smallVector.h.

◆ ~TfSmallVector()

~TfSmallVector ( )
inline

Destructor.

Definition at line 266 of file smallVector.h.

Member Function Documentation

◆ assign() [1/2]

void assign ( ForwardIterator  first,
ForwardIterator  last 
)
inline

Clears any previously held entries, and copies entries between [ first, last ) to this vector.

Definition at line 451 of file smallVector.h.

◆ assign() [2/2]

void assign ( std::initializer_list< T >  ilist)
inline

Replace existing contents with the contents of ilist.

Definition at line 461 of file smallVector.h.

◆ back() [1/2]

reference back ( )
inline

Returns the last element in the vector.

Definition at line 711 of file smallVector.h.

◆ back() [2/2]

const_reference back ( ) const
inline

Returns the last elements in the vector.

Definition at line 717 of file smallVector.h.

◆ begin() [1/2]

iterator begin ( )
inline

Definition at line 632 of file smallVector.h.

◆ begin() [2/2]

const_iterator begin ( ) const
inline

Definition at line 636 of file smallVector.h.

◆ capacity()

size_type capacity ( ) const
inline

Returns the current capacity of this vector.

Note that if the returned value is <= N, it does NOT mean the storage is local. A vector that has previously grown beyond its local storage, will not move entries back to the local storage once it shrinks to N.

Definition at line 617 of file smallVector.h.

◆ cbegin()

const_iterator cbegin ( ) const
inline

Definition at line 640 of file smallVector.h.

◆ cend()

const_iterator cend ( ) const
inline

Definition at line 657 of file smallVector.h.

◆ clear()

void clear ( )
inline

Clear the entries in the vector.

Does not let go of the underpinning storage.

Definition at line 441 of file smallVector.h.

◆ crbegin()

const_reverse_iterator crbegin ( ) const
inline

Definition at line 674 of file smallVector.h.

◆ crend()

const_reverse_iterator crend ( ) const
inline

Definition at line 691 of file smallVector.h.

◆ data() [1/2]

value_type * data ( )
inline

Direct access to the underlying array.

Definition at line 735 of file smallVector.h.

◆ data() [2/2]

const value_type * data ( ) const
inline

Direct access to the underlying array.

Definition at line 741 of file smallVector.h.

◆ emplace_back()

void emplace_back ( Args &&...  args)
inline

Emplace an entry at the back of the vector.

Definition at line 468 of file smallVector.h.

◆ empty()

bool empty ( ) const
inline

Returns true if this vector is empty.

Definition at line 608 of file smallVector.h.

◆ end() [1/2]

iterator end ( )
inline

Definition at line 649 of file smallVector.h.

◆ end() [2/2]

const_iterator end ( ) const
inline

Definition at line 653 of file smallVector.h.

◆ erase() [1/2]

iterator erase ( const_iterator  it)
inline

Erase an entry at the given iterator.

Definition at line 375 of file smallVector.h.

◆ erase() [2/2]

iterator erase ( const_iterator  it,
const_iterator  last 
)
inline

Erase entries between [ first, last ) from the vector.

Definition at line 381 of file smallVector.h.

◆ front() [1/2]

reference front ( )
inline

Returns the first element in the vector.

Definition at line 699 of file smallVector.h.

◆ front() [2/2]

const_reference front ( ) const
inline

Returns the first element in the vector.

Definition at line 705 of file smallVector.h.

◆ insert() [1/4]

iterator insert ( const_iterator  it,
const value_type &  v 
)
inline

Insert an entry at the given iterator.

Definition at line 369 of file smallVector.h.

◆ insert() [2/4]

iterator insert ( const_iterator  it,
value_type &&  v 
)
inline

Insert an rvalue-reference entry at the given iterator position.

Definition at line 363 of file smallVector.h.

◆ insert() [3/4]

void insert ( iterator  pos,
ForwardIterator  first,
ForwardIterator  last 
)
inline

Copy the range denoted by [first, last) into this vector before pos.

Definition at line 492 of file smallVector.h.

◆ insert() [4/4]

void insert ( iterator  pos,
std::initializer_list< T >  ilist 
)
inline

Insert elements from ilist starting at position pos.

Definition at line 583 of file smallVector.h.

◆ internal_capacity()

static constexpr size_type internal_capacity ( )
inlinestaticconstexpr

Returns the local storage capacity.

The vector uses its local storage if capacity() <= internal_capacity(). This method mimics the boost::container::small_vector interface.

Definition at line 625 of file smallVector.h.

◆ max_size()

static constexpr size_type max_size ( )
inlinestaticconstexpr

Returns the maximum size of this vector.

Definition at line 602 of file smallVector.h.

◆ operator!=()

bool operator!= ( const TfSmallVector< T, N > &  rhs) const
inline

Lexicographically compares the elements in the vectors for inequality.

Definition at line 753 of file smallVector.h.

◆ operator=() [1/3]

TfSmallVector & operator= ( const TfSmallVector< T, N > &  rhs)
inline

Assignment operator.

Definition at line 273 of file smallVector.h.

◆ operator=() [2/3]

TfSmallVector & operator= ( std::initializer_list< T >  ilist)
inline

Replace existing contents with the contents of ilist.

Definition at line 291 of file smallVector.h.

◆ operator=() [3/3]

TfSmallVector & operator= ( TfSmallVector< T, N > &&  rhs)
inline

Move assignment operator.

Definition at line 282 of file smallVector.h.

◆ operator==()

bool operator== ( const TfSmallVector< T, N > &  rhs) const
inline

Lexicographically compares the elements in the vectors for equality.

Definition at line 747 of file smallVector.h.

◆ operator[]() [1/2]

reference operator[] ( size_type  i)
inline

Access the specified element.

Definition at line 723 of file smallVector.h.

◆ operator[]() [2/2]

const_reference operator[] ( size_type  i) const
inline

Access the specified element.

Definition at line 729 of file smallVector.h.

◆ pop_back()

void pop_back ( )
inline

Remove the entry at the back of the vector.

Definition at line 589 of file smallVector.h.

◆ push_back() [1/2]

void push_back ( const value_type &  v)
inline

Copy an entry to the back of the vector,.

Definition at line 478 of file smallVector.h.

◆ push_back() [2/2]

void push_back ( value_type &&  v)
inline

Move an entry to the back of the vector.

Definition at line 484 of file smallVector.h.

◆ rbegin() [1/2]

reverse_iterator rbegin ( )
inline

Definition at line 666 of file smallVector.h.

◆ rbegin() [2/2]

const_reverse_iterator rbegin ( ) const
inline

Definition at line 670 of file smallVector.h.

◆ rend() [1/2]

reverse_iterator rend ( )
inline

Definition at line 683 of file smallVector.h.

◆ rend() [2/2]

const_reverse_iterator rend ( ) const
inline

Definition at line 687 of file smallVector.h.

◆ reserve()

void reserve ( size_type  newCapacity)
inline

Reserve storage for newCapacity entries.

Definition at line 410 of file smallVector.h.

◆ resize()

void resize ( size_type  newSize,
const value_type &  v = value_type() 
)
inline

Resize the vector to newSize and insert copies of \v.

Definition at line 421 of file smallVector.h.

◆ size()

size_type size ( ) const
inline

Returns the current size of the vector.

Definition at line 596 of file smallVector.h.

◆ swap()

void swap ( TfSmallVector< T, N > &  rhs)
inline

Swap two vector instances.

Definition at line 298 of file smallVector.h.


The documentation for this class was generated from the following file: