Intel(R) Threading Building Blocks Doxygen Documentation  version 4.2.3
tbb::concurrent_vector< T, A > Class Template Reference

Concurrent vector container. More...

#include <concurrent_vector.h>

Inheritance diagram for tbb::concurrent_vector< T, A >:
Collaboration diagram for tbb::concurrent_vector< T, A >:

Classes

class  generic_range_type
 
class  internal_loop_guide
 Exception-aware helper class for filling a segment by exception-danger operators of user class. More...
 
class  is_integer_tag
 True/false function override helper. More...
 
struct  push_back_helper
 

Public Types

typedef internal::concurrent_vector_base_v3::size_type size_type
 
typedef internal::allocator_base< T, A >::allocator_type allocator_type
 
typedef T value_type
 
typedef ptrdiff_t difference_type
 
typedef T & reference
 
typedef T * pointer
 
typedef internal::vector_iterator< concurrent_vector, T > iterator
 
typedef internal::vector_iterator< concurrent_vector, const T > const_iterator
 
typedef std::reverse_iterator< iteratorreverse_iterator
 
typedef std::reverse_iterator< const_iteratorconst_reverse_iterator
 
typedef generic_range_type< iteratorrange_type
 
typedef generic_range_type< const_iteratorconst_range_type
 

Public Member Functions

 concurrent_vector (const allocator_type &a=allocator_type())
 Construct empty vector. More...
 
 concurrent_vector (std::initializer_list< T > init_list, const allocator_type &a=allocator_type())
 Constructor from initializer_list. More...
 
 concurrent_vector (const concurrent_vector &vector, const allocator_type &a=allocator_type())
 Copying constructor. More...
 
 concurrent_vector (concurrent_vector &&source)
 Move constructor. More...
 
 concurrent_vector (concurrent_vector &&source, const allocator_type &a)
 
template<class M >
__TBB_DEPRECATED concurrent_vector (const concurrent_vector< T, M > &vector, const allocator_type &a=allocator_type())
 Copying constructor for vector with different allocator type. More...
 
 concurrent_vector (size_type n)
 Construction with initial size specified by argument n. More...
 
 concurrent_vector (size_type n, const_reference t, const allocator_type &a=allocator_type())
 Construction with initial size specified by argument n, initialization by copying of t, and given allocator instance. More...
 
template<class I >
 concurrent_vector (I first, I last, const allocator_type &a=allocator_type())
 Construction with copying iteration range and given allocator instance. More...
 
concurrent_vectoroperator= (const concurrent_vector &vector)
 Assignment. More...
 
concurrent_vectoroperator= (concurrent_vector &&other)
 Move assignment. More...
 
template<class M >
__TBB_DEPRECATED concurrent_vectoroperator= (const concurrent_vector< T, M > &vector)
 Assignment for vector with different allocator type. More...
 
concurrent_vectoroperator= (std::initializer_list< T > init_list)
 Assignment for initializer_list. More...
 
iterator grow_by (size_type delta)
 Grow by "delta" elements. More...
 
iterator grow_by (size_type delta, const_reference t)
 Grow by "delta" elements using copying constructor. More...
 
template<typename I >
iterator grow_by (I first, I last)
 
iterator grow_by (std::initializer_list< T > init_list)
 
iterator grow_to_at_least (size_type n)
 Append minimal sequence of elements such that size()>=n. More...
 
iterator grow_to_at_least (size_type n, const_reference t)
 
iterator push_back (const_reference item)
 Push item. More...
 
iterator push_back (T &&item)
 Push item, move-aware. More...
 
template<typename... Args>
iterator emplace_back (Args &&... args)
 Push item, create item "in place" with provided arguments. More...
 
reference operator[] (size_type index)
 Get reference to element at given index. More...
 
const_reference operator[] (size_type index) const
 Get const reference to element at given index. More...
 
reference at (size_type index)
 Get reference to element at given index. Throws exceptions on errors. More...
 
const_reference at (size_type index) const
 Get const reference to element at given index. Throws exceptions on errors. More...
 
range_type range (size_t grainsize=1)
 Get range for iterating with parallel algorithms. More...
 
const_range_type range (size_t grainsize=1) const
 Get const range for iterating with parallel algorithms. More...
 
size_type size () const
 Return size of vector. It may include elements under construction. More...
 
bool empty () const
 Return false if vector is not empty or has elements under construction at least. More...
 
size_type capacity () const
 Maximum size to which array can grow without allocating more memory. Concurrent allocations are not included in the value. More...
 
void reserve (size_type n)
 Allocate enough space to grow to size n without having to allocate more memory later. More...
 
void resize (size_type n)
 Resize the vector. Not thread-safe. More...
 
void resize (size_type n, const_reference t)
 Resize the vector, copy t for new elements. Not thread-safe. More...
 
void shrink_to_fit ()
 Optimize memory usage and fragmentation. More...
 
size_type max_size () const
 Upper bound on argument to reserve. More...
 
iterator begin ()
 start iterator More...
 
iterator end ()
 end iterator More...
 
const_iterator begin () const
 start const iterator More...
 
const_iterator end () const
 end const iterator More...
 
const_iterator cbegin () const
 start const iterator More...
 
const_iterator cend () const
 end const iterator More...
 
reverse_iterator rbegin ()
 reverse start iterator More...
 
reverse_iterator rend ()
 reverse end iterator More...
 
const_reverse_iterator rbegin () const
 reverse start const iterator More...
 
const_reverse_iterator rend () const
 reverse end const iterator More...
 
const_reverse_iterator crbegin () const
 reverse start const iterator More...
 
const_reverse_iterator crend () const
 reverse end const iterator More...
 
reference front ()
 the first item More...
 
const_reference front () const
 the first item const More...
 
reference back ()
 the last item More...
 
const_reference back () const
 the last item const More...
 
allocator_type get_allocator () const
 return allocator object More...
 
void assign (size_type n, const_reference t)
 assign n items by copying t item More...
 
template<class I >
void assign (I first, I last)
 assign range [first, last) More...
 
void assign (std::initializer_list< T > init_list)
 assigns an initializer list More...
 
void swap (concurrent_vector &vector)
 swap two instances More...
 
void clear ()
 Clear container while keeping memory allocated. More...
 
 ~concurrent_vector ()
 Clear and destroy vector. More...
 
const internal::concurrent_vector_base_v3internal_vector_base () const
 
template<typename I >
void copy_range (void *dst, const void *p_type_erased_iterator, size_type n)
 

Public Attributes

const typedef T & const_reference
 
const typedef T * const_pointer
 

Private Member Functions

void internal_free_segments (segment_t table[], segment_index_t k, segment_index_t first_block)
 Free k segments from table. More...
 
T & internal_subscript (size_type index) const
 Get reference to element at given index. More...
 
T & internal_subscript_with_exceptions (size_type index) const
 Get reference to element at given index with errors checks. More...
 
void internal_assign_n (size_type n, const_pointer p)
 assign n items by copying t More...
 
template<class I >
void internal_assign_range (I first, I last, is_integer_tag< true > *)
 assign integer items by copying when arguments are treated as iterators. See C++ Standard 2003 23.1.1p9 More...
 
template<class I >
void internal_assign_range (I first, I last, is_integer_tag< false > *)
 inline proxy assign by iterators More...
 
template<class I >
void internal_assign_iterators (I first, I last)
 assign by iterators More...
 

Static Private Member Functions

static voidinternal_allocator (internal::concurrent_vector_base_v3 &vb, size_t k)
 Allocate k items. More...
 
static void __TBB_EXPORTED_FUNC initialize_array (void *begin, const void *, size_type n)
 Construct n instances of T, starting at "begin". More...
 
static void __TBB_EXPORTED_FUNC initialize_array_by (void *begin, const void *src, size_type n)
 Copy-construct n instances of T, starting at "begin". More...
 
static void __TBB_EXPORTED_FUNC copy_array (void *dst, const void *src, size_type n)
 Copy-construct n instances of T by copying single element pointed to by src, starting at "dst". More...
 
static void __TBB_EXPORTED_FUNC move_array (void *dst, const void *src, size_type n)
 Move-construct n instances of T, starting at "dst" by copying according element of src array. More...
 
static void __TBB_EXPORTED_FUNC move_assign_array (void *dst, const void *src, size_type n)
 Move-assign (using operator=) n instances of T, starting at "dst" by assigning according element of src array. More...
 
template<typename Iterator >
static void __TBB_EXPORTED_FUNC copy_range (void *dst, const void *p_type_erased_iterator, size_type n)
 Copy-construct n instances of T, starting at "dst" by iterator range of [p_type_erased_iterator, p_type_erased_iterator+n). More...
 
static void __TBB_EXPORTED_FUNC assign_array (void *dst, const void *src, size_type n)
 Assign (using operator=) n instances of T, starting at "dst" by assigning according element of src array. More...
 
static void __TBB_EXPORTED_FUNC destroy_array (void *begin, size_type n)
 Destroy n instances of T, starting at "begin". More...
 

Friends

template<typename C , typename U >
class internal::vector_iterator
 

Detailed Description

template<typename T, class A>
class tbb::concurrent_vector< T, A >

Concurrent vector container.

concurrent_vector is a container having the following main properties:

  • It provides random indexed access to its elements. The index of the first element is 0.
  • It ensures safe concurrent growing its size (different threads can safely append new elements).
  • Adding new elements does not invalidate existing iterators and does not change indices of existing items.
Compatibility
The class meets all Container Requirements and Reversible Container Requirements from C++ Standard (See ISO/IEC 14882:2003(E), clause 23.1). But it doesn't meet Sequence Requirements due to absence of insert() and erase() methods.
Exception Safety
Methods working with memory allocation and/or new elements construction can throw an exception if allocator fails to allocate memory or element's default constructor throws one. Concurrent vector's element of type T must conform to the following requirements:
  • Throwing an exception is forbidden for destructor of T.
  • Default constructor of T must not throw an exception OR its non-virtual destructor must safely work when its object memory is zero-initialized.
Otherwise, the program's behavior is undefined.
If an exception happens inside growth or assignment operation, an instance of the vector becomes invalid unless it is stated otherwise in the method documentation. Invalid state means:
  • There are no guarantees that all items were initialized by a constructor. The rest of items is zero-filled, including item where exception happens.
  • An invalid vector instance cannot be repaired; it is unable to grow anymore.
  • Size and capacity reported by the vector are incorrect, and calculated as if the failed operation were successful.
  • Attempt to access not allocated elements using operator[] or iterators results in access violation or segmentation fault exception, and in case of using at() method a C++ exception is thrown.
If a concurrent grow operation successfully completes, all the elements it has added to the vector will remain valid and accessible even if one of subsequent grow operations fails.
Fragmentation
Unlike an STL vector, a concurrent_vector does not move existing elements if it needs to allocate more memory. The container is divided into a series of contiguous arrays of elements. The first reservation, growth, or assignment operation determines the size of the first array. Using small number of elements as initial size incurs fragmentation that may increase element access time. Internal layout can be optimized by method compact() that merges several smaller arrays into one solid.
Changes since TBB 2.1
  • Fixed guarantees of concurrent_vector::size() and grow_to_at_least() methods to assure elements are allocated.
  • Methods end()/rbegin()/back() are partly thread-safe since they use size() to get the end of vector
  • Added resize() methods (not thread-safe)
  • Added cbegin/cend/crbegin/crend methods
  • Changed return type of methods grow* and push_back to iterator
Changes since TBB 2.0
  • Implemented exception-safety guarantees
  • Added template argument for allocator
  • Added allocator argument in constructors
  • Faster index calculation
  • First growth call specifies a number of segments to be merged in the first allocation.
  • Fixed memory blow up for swarm of vector's instances of small size
  • Added grow_by(size_type n, const_reference t) growth using copying constructor to init new items.
  • Added STL-like constructors.
  • Added operators ==, < and derivatives
  • Added at() method, approved for using after an exception was thrown inside the vector
  • Added get_allocator() method.
  • Added assign() methods
  • Added compact() method to defragment first segments
  • Added swap() method
  • range() defaults on grainsize = 1 supporting auto grainsize algorithms.

Definition at line 64 of file concurrent_vector.h.

Member Typedef Documentation

◆ allocator_type

template<typename T , class A >
typedef internal::allocator_base<T, A>::allocator_type tbb::concurrent_vector< T, A >::allocator_type

Definition at line 575 of file concurrent_vector.h.

◆ const_iterator

template<typename T , class A >
typedef internal::vector_iterator<concurrent_vector,const T> tbb::concurrent_vector< T, A >::const_iterator

Definition at line 585 of file concurrent_vector.h.

◆ const_range_type

template<typename T , class A >
typedef generic_range_type<const_iterator> tbb::concurrent_vector< T, A >::const_range_type

Definition at line 601 of file concurrent_vector.h.

◆ const_reverse_iterator

template<typename T , class A >
typedef std::reverse_iterator<const_iterator> tbb::concurrent_vector< T, A >::const_reverse_iterator

Definition at line 590 of file concurrent_vector.h.

◆ difference_type

template<typename T , class A >
typedef ptrdiff_t tbb::concurrent_vector< T, A >::difference_type

Definition at line 578 of file concurrent_vector.h.

◆ iterator

template<typename T , class A >
typedef internal::vector_iterator<concurrent_vector,T> tbb::concurrent_vector< T, A >::iterator

Definition at line 584 of file concurrent_vector.h.

◆ pointer

template<typename T , class A >
typedef T* tbb::concurrent_vector< T, A >::pointer

Definition at line 581 of file concurrent_vector.h.

◆ range_type

template<typename T , class A >
typedef generic_range_type<iterator> tbb::concurrent_vector< T, A >::range_type

Definition at line 600 of file concurrent_vector.h.

◆ reference

template<typename T , class A >
typedef T& tbb::concurrent_vector< T, A >::reference

Definition at line 579 of file concurrent_vector.h.

◆ reverse_iterator

template<typename T , class A >
typedef std::reverse_iterator<iterator> tbb::concurrent_vector< T, A >::reverse_iterator

Definition at line 589 of file concurrent_vector.h.

◆ size_type

template<typename T , class A >
typedef internal::concurrent_vector_base_v3::size_type tbb::concurrent_vector< T, A >::size_type

Definition at line 574 of file concurrent_vector.h.

◆ value_type

template<typename T , class A >
typedef T tbb::concurrent_vector< T, A >::value_type

Definition at line 577 of file concurrent_vector.h.

Constructor & Destructor Documentation

◆ concurrent_vector() [1/9]

template<typename T , class A >
tbb::concurrent_vector< T, A >::concurrent_vector ( const allocator_type a = allocator_type())
inlineexplicit

Construct empty vector.

Definition at line 608 of file concurrent_vector.h.

609  : internal::allocator_base<T, A>(a), internal::concurrent_vector_base()
610  {
611  vector_allocator_ptr = &internal_allocator;
612  }

◆ concurrent_vector() [2/9]

template<typename T , class A >
tbb::concurrent_vector< T, A >::concurrent_vector ( std::initializer_list< T >  init_list,
const allocator_type a = allocator_type() 
)
inline

Constructor from initializer_list.

Definition at line 618 of file concurrent_vector.h.

619  : internal::allocator_base<T, A>(a), internal::concurrent_vector_base()
620  {
621  vector_allocator_ptr = &internal_allocator;
622  __TBB_TRY {
623  internal_assign_iterators(init_list.begin(), init_list.end());
624  } __TBB_CATCH(...) {
625  segment_t *table = my_segment.load<relaxed>();;
626  internal_free_segments( table, internal_clear(&destroy_array), my_first_block.load<relaxed>());
627  __TBB_RETHROW();
628  }
629 
630  }

◆ concurrent_vector() [3/9]

template<typename T , class A >
tbb::concurrent_vector< T, A >::concurrent_vector ( const concurrent_vector< T, A > &  vector,
const allocator_type a = allocator_type() 
)
inline

Copying constructor.

Definition at line 634 of file concurrent_vector.h.

635  : internal::allocator_base<T, A>(a), internal::concurrent_vector_base()
636  {
637  vector_allocator_ptr = &internal_allocator;
638  __TBB_TRY {
639  internal_copy(vector, sizeof(T), &copy_array);
640  } __TBB_CATCH(...) {
641  segment_t *table = my_segment.load<relaxed>();
642  internal_free_segments( table, internal_clear(&destroy_array), my_first_block.load<relaxed>());
643  __TBB_RETHROW();
644  }
645  }

◆ concurrent_vector() [4/9]

template<typename T , class A >
tbb::concurrent_vector< T, A >::concurrent_vector ( concurrent_vector< T, A > &&  source)
inline

Move constructor.

Definition at line 650 of file concurrent_vector.h.

651  : internal::allocator_base<T, A>(std::move(source)), internal::concurrent_vector_base()
652  {
653  vector_allocator_ptr = &internal_allocator;
655  }

◆ concurrent_vector() [5/9]

template<typename T , class A >
tbb::concurrent_vector< T, A >::concurrent_vector ( concurrent_vector< T, A > &&  source,
const allocator_type a 
)
inline

Definition at line 657 of file concurrent_vector.h.

658  : internal::allocator_base<T, A>(a), internal::concurrent_vector_base()
659  {
660  vector_allocator_ptr = &internal_allocator;
661  //C++ standard requires instances of an allocator being compared for equality,
662  //which means that memory allocated by one instance is possible to deallocate with the other one.
663  if (a == source.my_allocator) {
665  } else {
666  __TBB_TRY {
667  internal_copy(source, sizeof(T), &move_array);
668  } __TBB_CATCH(...) {
669  segment_t *table = my_segment.load<relaxed>();
670  internal_free_segments( table, internal_clear(&destroy_array), my_first_block.load<relaxed>());
671  __TBB_RETHROW();
672  }
673  }
674  }

◆ concurrent_vector() [6/9]

template<typename T , class A >
template<class M >
__TBB_DEPRECATED tbb::concurrent_vector< T, A >::concurrent_vector ( const concurrent_vector< T, M > &  vector,
const allocator_type a = allocator_type() 
)
inline

Copying constructor for vector with different allocator type.

Definition at line 680 of file concurrent_vector.h.

681  : internal::allocator_base<T, A>(a), internal::concurrent_vector_base()
682  {
683  vector_allocator_ptr = &internal_allocator;
684  __TBB_TRY {
685  internal_copy(vector.internal_vector_base(), sizeof(T), &copy_array);
686  } __TBB_CATCH(...) {
687  segment_t *table = my_segment.load<relaxed>();
688  internal_free_segments( table, internal_clear(&destroy_array), my_first_block.load<relaxed>() );
689  __TBB_RETHROW();
690  }
691  }

◆ concurrent_vector() [7/9]

template<typename T , class A >
tbb::concurrent_vector< T, A >::concurrent_vector ( size_type  n)
inlineexplicit

Construction with initial size specified by argument n.

Definition at line 694 of file concurrent_vector.h.

695  {
696  vector_allocator_ptr = &internal_allocator;
697  __TBB_TRY {
698  internal_resize( n, sizeof(T), max_size(), NULL, &destroy_array, &initialize_array );
699  } __TBB_CATCH(...) {
700  segment_t *table = my_segment.load<relaxed>();
701  internal_free_segments( table, internal_clear(&destroy_array), my_first_block.load<relaxed>() );
702  __TBB_RETHROW();
703  }
704  }

◆ concurrent_vector() [8/9]

template<typename T , class A >
tbb::concurrent_vector< T, A >::concurrent_vector ( size_type  n,
const_reference  t,
const allocator_type a = allocator_type() 
)
inline

Construction with initial size specified by argument n, initialization by copying of t, and given allocator instance.

Definition at line 707 of file concurrent_vector.h.

708  : internal::allocator_base<T, A>(a)
709  {
710  vector_allocator_ptr = &internal_allocator;
711  __TBB_TRY {
712  internal_resize( n, sizeof(T), max_size(), static_cast<const void*>(&t), &destroy_array, &initialize_array_by );
713  } __TBB_CATCH(...) {
714  segment_t *table = my_segment.load<relaxed>();
715  internal_free_segments( table, internal_clear(&destroy_array), my_first_block.load<relaxed>() );
716  __TBB_RETHROW();
717  }
718  }

◆ concurrent_vector() [9/9]

template<typename T , class A >
template<class I >
tbb::concurrent_vector< T, A >::concurrent_vector ( first,
last,
const allocator_type a = allocator_type() 
)
inline

Construction with copying iteration range and given allocator instance.

Definition at line 722 of file concurrent_vector.h.

723  : internal::allocator_base<T, A>(a)
724  {
725  vector_allocator_ptr = &internal_allocator;
726  __TBB_TRY {
727  internal_assign_range(first, last, static_cast<is_integer_tag<std::numeric_limits<I>::is_integer> *>(0) );
728  } __TBB_CATCH(...) {
729  segment_t *table = my_segment.load<relaxed>();
730  internal_free_segments( table, internal_clear(&destroy_array), my_first_block.load<relaxed>() );
731  __TBB_RETHROW();
732  }
733  }

◆ ~concurrent_vector()

template<typename T , class A >
tbb::concurrent_vector< T, A >::~concurrent_vector ( )
inline

Clear and destroy vector.

Definition at line 1023 of file concurrent_vector.h.

1023  {
1024  segment_t *table = my_segment.load<relaxed>();
1025  internal_free_segments( table, internal_clear(&destroy_array), my_first_block.load<relaxed>() );
1026  // base class destructor call should be then
1027  }

Member Function Documentation

◆ assign() [1/3]

template<typename T , class A >
template<class I >
void tbb::concurrent_vector< T, A >::assign ( first,
last 
)
inline

assign range [first, last)

Definition at line 996 of file concurrent_vector.h.

996  {
997  clear(); internal_assign_range( first, last, static_cast<is_integer_tag<std::numeric_limits<I>::is_integer> *>(0) );
998  }

◆ assign() [2/3]

template<typename T , class A >
void tbb::concurrent_vector< T, A >::assign ( size_type  n,
const_reference  t 
)
inline

assign n items by copying t item

Definition at line 989 of file concurrent_vector.h.

989  {
990  clear();
991  internal_resize( n, sizeof(T), max_size(), static_cast<const void*>(&t), &destroy_array, &initialize_array_by );
992  }

◆ assign() [3/3]

template<typename T , class A >
void tbb::concurrent_vector< T, A >::assign ( std::initializer_list< T >  init_list)
inline

assigns an initializer list

Definition at line 1002 of file concurrent_vector.h.

1002  {
1003  clear(); internal_assign_iterators( init_list.begin(), init_list.end());
1004  }

◆ assign_array()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::assign_array ( void dst,
const void src,
size_type  n 
)
staticprivate

Assign (using operator=) n instances of T, starting at "dst" by assigning according element of src array.

Definition at line 1330 of file concurrent_vector.h.

1330  {
1331  internal_loop_guide loop(n, dst); loop.assign(src);
1332 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::operator=().

Here is the caller graph for this function:

◆ at() [1/2]

template<typename T , class A >
reference tbb::concurrent_vector< T, A >::at ( size_type  index)
inline

Get reference to element at given index. Throws exceptions on errors.

Definition at line 877 of file concurrent_vector.h.

877  {
879  }

◆ at() [2/2]

template<typename T , class A >
const_reference tbb::concurrent_vector< T, A >::at ( size_type  index) const
inline

Get const reference to element at given index. Throws exceptions on errors.

Definition at line 882 of file concurrent_vector.h.

882  {
884  }

◆ back() [1/2]

template<typename T , class A >
reference tbb::concurrent_vector< T, A >::back ( )
inline

the last item

Definition at line 976 of file concurrent_vector.h.

976  {
977  __TBB_ASSERT( size()>0, NULL);
978  return internal_subscript( size()-1 );
979  }

◆ back() [2/2]

template<typename T , class A >
const_reference tbb::concurrent_vector< T, A >::back ( ) const
inline

the last item const

Definition at line 981 of file concurrent_vector.h.

981  {
982  __TBB_ASSERT( size()>0, NULL);
983  return internal_subscript( size()-1 );
984  }

◆ begin() [1/2]

template<typename T , class A >
iterator tbb::concurrent_vector< T, A >::begin ( )
inline

start iterator

Definition at line 940 of file concurrent_vector.h.

940 {return iterator(*this,0);}

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::crend(), tbb::concurrent_vector< padded_element, padded_allocator_type >::range(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::rend().

Here is the caller graph for this function:

◆ begin() [2/2]

template<typename T , class A >
const_iterator tbb::concurrent_vector< T, A >::begin ( ) const
inline

start const iterator

Definition at line 944 of file concurrent_vector.h.

944 {return const_iterator(*this,0);}

◆ capacity()

template<typename T , class A >
size_type tbb::concurrent_vector< T, A >::capacity ( ) const
inline

Maximum size to which array can grow without allocating more memory. Concurrent allocations are not included in the value.

Definition at line 909 of file concurrent_vector.h.

909 {return internal_capacity();}

◆ cbegin()

template<typename T , class A >
const_iterator tbb::concurrent_vector< T, A >::cbegin ( ) const
inline

start const iterator

Definition at line 948 of file concurrent_vector.h.

948 {return const_iterator(*this,0);}

◆ cend()

template<typename T , class A >
const_iterator tbb::concurrent_vector< T, A >::cend ( ) const
inline

end const iterator

Definition at line 950 of file concurrent_vector.h.

950 {return const_iterator(*this,size());}

◆ clear()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::clear ( )
inline

Clear container while keeping memory allocated.

To free up the memory, use in conjunction with method compact(). Not thread safe

Definition at line 1018 of file concurrent_vector.h.

1018  {
1019  internal_clear(&destroy_array);
1020  }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::assign(), and tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::clear().

Here is the caller graph for this function:

◆ copy_array()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::copy_array ( void dst,
const void src,
size_type  n 
)
staticprivate

Copy-construct n instances of T by copying single element pointed to by src, starting at "dst".

Definition at line 1300 of file concurrent_vector.h.

1300  {
1301  internal_loop_guide loop(n, dst); loop.copy(src);
1302 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::concurrent_vector(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::operator=().

Here is the caller graph for this function:

◆ copy_range() [1/2]

template<typename T , class A >
template<typename Iterator >
static void __TBB_EXPORTED_FUNC tbb::concurrent_vector< T, A >::copy_range ( void dst,
const void p_type_erased_iterator,
size_type  n 
)
staticprivate

Copy-construct n instances of T, starting at "dst" by iterator range of [p_type_erased_iterator, p_type_erased_iterator+n).

◆ copy_range() [2/2]

template<typename T , class A >
template<typename I >
void tbb::concurrent_vector< T, A >::copy_range ( void dst,
const void p_type_erased_iterator,
size_type  n 
)

Definition at line 1324 of file concurrent_vector.h.

1324  {
1325  internal_loop_guide loop(n, dst);
1326  loop.iterate( *(static_cast<I*>(const_cast<void*>(p_type_erased_iterator))) );
1327 }

◆ crbegin()

template<typename T , class A >
const_reverse_iterator tbb::concurrent_vector< T, A >::crbegin ( ) const
inline

reverse start const iterator

Definition at line 960 of file concurrent_vector.h.

960 {return const_reverse_iterator(end());}

◆ crend()

template<typename T , class A >
const_reverse_iterator tbb::concurrent_vector< T, A >::crend ( ) const
inline

reverse end const iterator

Definition at line 962 of file concurrent_vector.h.

962 {return const_reverse_iterator(begin());}

◆ destroy_array()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::destroy_array ( void begin,
size_type  n 
)
staticprivate

Destroy n instances of T, starting at "begin".

Definition at line 1340 of file concurrent_vector.h.

1340  {
1341  T* array = static_cast<T*>(begin);
1342  for( size_type j=n; j>0; --j )
1343  array[j-1].~T(); // destructors are supposed to not throw any exceptions
1344 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::assign(), tbb::concurrent_vector< padded_element, padded_allocator_type >::clear(), tbb::concurrent_vector< padded_element, padded_allocator_type >::concurrent_vector(), tbb::concurrent_vector< padded_element, padded_allocator_type >::internal_assign_n(), tbb::concurrent_vector< padded_element, padded_allocator_type >::operator=(), tbb::concurrent_vector< padded_element, padded_allocator_type >::resize(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::~concurrent_vector().

Here is the caller graph for this function:

◆ emplace_back()

template<typename T , class A >
template<typename... Args>
iterator tbb::concurrent_vector< T, A >::emplace_back ( Args &&...  args)
inline

Push item, create item "in place" with provided arguments.

Returns iterator pointing to the new element.

Definition at line 856 of file concurrent_vector.h.

857  {
858  push_back_helper prolog(*this);
859  new(prolog.internal_push_back_result()) T(std::forward<Args>(args)...);
860  return prolog.return_iterator_and_dismiss();
861  }

◆ empty()

template<typename T , class A >
bool tbb::concurrent_vector< T, A >::empty ( ) const
inline

Return false if vector is not empty or has elements under construction at least.

Definition at line 906 of file concurrent_vector.h.

906 {return !my_early_size;}

Referenced by tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::empty().

Here is the caller graph for this function:

◆ end() [1/2]

template<typename T , class A >
iterator tbb::concurrent_vector< T, A >::end ( )
inline

end iterator

Definition at line 942 of file concurrent_vector.h.

942 {return iterator(*this,size());}

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::crbegin(), tbb::concurrent_vector< padded_element, padded_allocator_type >::range(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::rbegin().

Here is the caller graph for this function:

◆ end() [2/2]

template<typename T , class A >
const_iterator tbb::concurrent_vector< T, A >::end ( ) const
inline

end const iterator

Definition at line 946 of file concurrent_vector.h.

946 {return const_iterator(*this,size());}

◆ front() [1/2]

template<typename T , class A >
reference tbb::concurrent_vector< T, A >::front ( )
inline

the first item

Definition at line 964 of file concurrent_vector.h.

964  {
965  __TBB_ASSERT( size()>0, NULL);
966  const segment_value_t& segment_value = my_segment[0].template load<relaxed>();
967  return (segment_value.template pointer<T>())[0];
968  }

◆ front() [2/2]

template<typename T , class A >
const_reference tbb::concurrent_vector< T, A >::front ( ) const
inline

the first item const

Definition at line 970 of file concurrent_vector.h.

970  {
971  __TBB_ASSERT( size()>0, NULL);
972  const segment_value_t& segment_value = my_segment[0].template load<relaxed>();
973  return (segment_value.template pointer<const T>())[0];
974  }

◆ get_allocator()

template<typename T , class A >
allocator_type tbb::concurrent_vector< T, A >::get_allocator ( ) const
inline

return allocator object

Definition at line 986 of file concurrent_vector.h.

986 { return this->my_allocator; }

◆ grow_by() [1/4]

template<typename T , class A >
template<typename I >
iterator tbb::concurrent_vector< T, A >::grow_by ( first,
last 
)
inline

Returns iterator pointing to the first new element.

Definition at line 795 of file concurrent_vector.h.

795  {
796  typename std::iterator_traits<I>::difference_type delta = std::distance(first, last);
797  __TBB_ASSERT( delta >= 0, NULL);
798 
799  return iterator(*this, delta ? internal_grow_by(delta, sizeof(T), &copy_range<I>, static_cast<const void*>(&first)) : my_early_size.load());
800  }

◆ grow_by() [2/4]

template<typename T , class A >
iterator tbb::concurrent_vector< T, A >::grow_by ( size_type  delta)
inline

Grow by "delta" elements.

Returns iterator pointing to the first new element.

Definition at line 783 of file concurrent_vector.h.

783  {
784  return iterator(*this, delta ? internal_grow_by( delta, sizeof(T), &initialize_array, NULL ) : my_early_size.load());
785  }

Referenced by tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::create_local(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::grow_by().

Here is the caller graph for this function:

◆ grow_by() [3/4]

template<typename T , class A >
iterator tbb::concurrent_vector< T, A >::grow_by ( size_type  delta,
const_reference  t 
)
inline

Grow by "delta" elements using copying constructor.

Returns iterator pointing to the first new element.

Definition at line 789 of file concurrent_vector.h.

789  {
790  return iterator(*this, delta ? internal_grow_by( delta, sizeof(T), &initialize_array_by, static_cast<const void*>(&t) ) : my_early_size.load());
791  }

◆ grow_by() [4/4]

template<typename T , class A >
iterator tbb::concurrent_vector< T, A >::grow_by ( std::initializer_list< T >  init_list)
inline

Returns iterator pointing to the first new element.

Definition at line 804 of file concurrent_vector.h.

804  {
805  return grow_by( init_list.begin(), init_list.end() );
806  }

◆ grow_to_at_least() [1/2]

template<typename T , class A >
iterator tbb::concurrent_vector< T, A >::grow_to_at_least ( size_type  n)
inline

Append minimal sequence of elements such that size()>=n.

The new elements are default constructed. Blocks until all elements in range [0..n) are allocated. May return while other elements are being constructed by other threads. Returns iterator that points to beginning of appended sequence. If no elements were appended, returns iterator pointing to nth element.

Definition at line 814 of file concurrent_vector.h.

814  {
815  size_type m=0;
816  if( n ) {
817  m = internal_grow_to_at_least_with_result( n, sizeof(T), &initialize_array, NULL );
818  if( m>n ) m=n;
819  }
820  return iterator(*this, m);
821  };

◆ grow_to_at_least() [2/2]

template<typename T , class A >
iterator tbb::concurrent_vector< T, A >::grow_to_at_least ( size_type  n,
const_reference  t 
)
inline

Analogous to grow_to_at_least( size_type n ) with exception that the new elements are initialized by copying of t instead of default construction.

Definition at line 825 of file concurrent_vector.h.

825  {
826  size_type m=0;
827  if( n ) {
828  m = internal_grow_to_at_least_with_result( n, sizeof(T), &initialize_array_by, &t);
829  if( m>n ) m=n;
830  }
831  return iterator(*this, m);
832  };

◆ initialize_array()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::initialize_array ( void begin,
const void ,
size_type  n 
)
staticprivate

Construct n instances of T, starting at "begin".

Definition at line 1290 of file concurrent_vector.h.

1290  {
1291  internal_loop_guide loop(n, begin); loop.init();
1292 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::concurrent_vector(), tbb::concurrent_vector< padded_element, padded_allocator_type >::grow_by(), tbb::concurrent_vector< padded_element, padded_allocator_type >::grow_to_at_least(), tbb::concurrent_vector< padded_element, padded_allocator_type >::internal_assign_n(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::resize().

Here is the caller graph for this function:

◆ initialize_array_by()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::initialize_array_by ( void begin,
const void src,
size_type  n 
)
staticprivate

◆ internal_allocator()

template<typename T , class A >
static void* tbb::concurrent_vector< T, A >::internal_allocator ( internal::concurrent_vector_base_v3 vb,
size_t  k 
)
inlinestaticprivate

Allocate k items.

Definition at line 1032 of file concurrent_vector.h.

1032  {
1033  return static_cast<concurrent_vector<T, A>&>(vb).my_allocator.allocate(k);
1034  }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::concurrent_vector().

Here is the caller graph for this function:

◆ internal_assign_iterators()

template<typename T , class A >
template<class I >
void tbb::concurrent_vector< T, A >::internal_assign_iterators ( first,
last 
)
private

assign by iterators

Definition at line 1269 of file concurrent_vector.h.

1269  {
1270  __TBB_ASSERT(my_early_size == 0, NULL);
1271  size_type n = std::distance(first, last);
1272  if( !n ) return;
1273  internal_reserve(n, sizeof(T), max_size());
1274  my_early_size = n;
1275  segment_index_t k = 0;
1276  //TODO: unify segment iteration code with concurrent_base_v3::helper
1277  size_type sz = segment_size( my_first_block );
1278  while( sz < n ) {
1279  internal_loop_guide loop(sz, my_segment[k].template load<relaxed>().template pointer<void>());
1280  loop.iterate(first);
1281  n -= sz;
1282  if( !k ) k = my_first_block;
1283  else { ++k; sz <<= 1; }
1284  }
1285  internal_loop_guide loop(n, my_segment[k].template load<relaxed>().template pointer<void>());
1286  loop.iterate(first);
1287 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::internal_assign_range().

Here is the caller graph for this function:

◆ internal_assign_n()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::internal_assign_n ( size_type  n,
const_pointer  p 
)
inlineprivate

assign n items by copying t

Definition at line 1045 of file concurrent_vector.h.

1045  {
1046  internal_resize( n, sizeof(T), max_size(), static_cast<const void*>(p), &destroy_array, p? &initialize_array_by : &initialize_array );
1047  }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::internal_assign_range().

Here is the caller graph for this function:

◆ internal_assign_range() [1/2]

template<typename T , class A >
template<class I >
void tbb::concurrent_vector< T, A >::internal_assign_range ( first,
last,
is_integer_tag< false > *   
)
inlineprivate

inline proxy assign by iterators

Definition at line 1065 of file concurrent_vector.h.

1065  {
1067  }

◆ internal_assign_range() [2/2]

template<typename T , class A >
template<class I >
void tbb::concurrent_vector< T, A >::internal_assign_range ( first,
last,
is_integer_tag< true > *   
)
inlineprivate

assign integer items by copying when arguments are treated as iterators. See C++ Standard 2003 23.1.1p9

Definition at line 1060 of file concurrent_vector.h.

1060  {
1061  internal_assign_n(static_cast<size_type>(first), &static_cast<T&>(last));
1062  }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::assign(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::concurrent_vector().

Here is the caller graph for this function:

◆ internal_free_segments()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::internal_free_segments ( segment_t  table[],
segment_index_t  k,
segment_index_t  first_block 
)
private

Free k segments from table.

Definition at line 1216 of file concurrent_vector.h.

1216  {
1217  // Free the arrays
1218  while( k > first_block ) {
1219  --k;
1220  segment_value_t segment_value = table[k].load<relaxed>();
1221  table[k].store<relaxed>(segment_not_used());
1222  if( segment_value == segment_allocated() ) // check for correct segment pointer
1223  this->my_allocator.deallocate( (segment_value.pointer<T>()), segment_size(k) );
1224  }
1225  segment_value_t segment_value = table[0].load<relaxed>();
1226  if( segment_value == segment_allocated() ) {
1227  __TBB_ASSERT( first_block > 0, NULL );
1228  while(k > 0) table[--k].store<relaxed>(segment_not_used());
1229  this->my_allocator.deallocate( (segment_value.pointer<T>()), segment_size(first_block) );
1230  }
1231 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::concurrent_vector(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::~concurrent_vector().

Here is the caller graph for this function:

◆ internal_subscript()

template<typename T , class A >
T & tbb::concurrent_vector< T, A >::internal_subscript ( size_type  index) const
private

Get reference to element at given index.

Definition at line 1234 of file concurrent_vector.h.

1234  {
1235  //TODO: unify both versions of internal_subscript
1236  __TBB_ASSERT( index < my_early_size, "index out of bounds" );
1237  size_type j = index;
1238  segment_index_t k = segment_base_index_of( j );
1239  __TBB_ASSERT( my_segment.load<acquire>() != my_storage || k < pointers_per_short_table, "index is being allocated" );
1240  //no need in load with acquire (load<acquire>) since thread works in own space or gets
1241  //the information about added elements via some form of external synchronization
1242  //TODO: why not make a load of my_segment relaxed as well ?
1243  //TODO: add an assertion that my_segment[k] is properly aligned to please ITT
1244  segment_value_t segment_value = my_segment[k].template load<relaxed>();
1245  __TBB_ASSERT( segment_value != segment_allocation_failed(), "the instance is broken by bad allocation. Use at() instead" );
1246  __TBB_ASSERT( segment_value != segment_not_used(), "index is being allocated" );
1247  return (( segment_value.pointer<T>()))[j];
1248 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::back(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::operator[]().

Here is the caller graph for this function:

◆ internal_subscript_with_exceptions()

template<typename T , class A >
T & tbb::concurrent_vector< T, A >::internal_subscript_with_exceptions ( size_type  index) const
private

Get reference to element at given index with errors checks.

Definition at line 1251 of file concurrent_vector.h.

1251  {
1252  if( index >= my_early_size )
1253  internal::throw_exception(internal::eid_out_of_range); // throw std::out_of_range
1254  size_type j = index;
1255  segment_index_t k = segment_base_index_of( j );
1256  //TODO: refactor this condition into separate helper function, e.g. fits_into_small_table
1257  if( my_segment.load<acquire>() == my_storage && k >= pointers_per_short_table )
1259  // no need in load with acquire (load<acquire>) since thread works in own space or gets
1260  //the information about added elements via some form of external synchronization
1261  //TODO: why not make a load of my_segment relaxed as well ?
1262  //TODO: add an assertion that my_segment[k] is properly aligned to please ITT
1263  segment_value_t segment_value = my_segment[k].template load<relaxed>();
1264  enforce_segment_allocated(segment_value, internal::eid_index_range_error);
1265  return (segment_value.pointer<T>())[j];
1266 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::at().

Here is the caller graph for this function:

◆ internal_vector_base()

template<typename T , class A >
const internal::concurrent_vector_base_v3& tbb::concurrent_vector< T, A >::internal_vector_base ( ) const
inline

Definition at line 1029 of file concurrent_vector.h.

1029 { return *this; }

◆ max_size()

template<typename T , class A >
size_type tbb::concurrent_vector< T, A >::max_size ( ) const
inline

◆ move_array()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::move_array ( void dst,
const void src,
size_type  n 
)
staticprivate

Move-construct n instances of T, starting at "dst" by copying according element of src array.

Definition at line 1306 of file concurrent_vector.h.

1306  {
1307  internal_loop_guide loop(n, dst); loop.move_construct(src);
1308 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::concurrent_vector(), and tbb::concurrent_vector< padded_element, padded_allocator_type >::operator=().

Here is the caller graph for this function:

◆ move_assign_array()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::move_assign_array ( void dst,
const void src,
size_type  n 
)
staticprivate

Move-assign (using operator=) n instances of T, starting at "dst" by assigning according element of src array.

Definition at line 1310 of file concurrent_vector.h.

1310  {
1311  internal_loop_guide loop(n, dst); loop.move_assign(src);
1312 }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::operator=().

Here is the caller graph for this function:

◆ operator=() [1/4]

template<typename T , class A >
concurrent_vector& tbb::concurrent_vector< T, A >::operator= ( concurrent_vector< T, A > &&  other)
inline

Move assignment.

Definition at line 745 of file concurrent_vector.h.

745  {
746  __TBB_ASSERT(this != &other, "Move assignment to itself is prohibited ");
748  if(pocma_t::value || this->my_allocator == other.my_allocator) {
749  concurrent_vector trash (std::move(*this));
750  internal_swap(other);
751  tbb::internal::allocator_move_assignment(this->my_allocator, other.my_allocator, pocma_t());
752  } else {
753  internal_assign(other, sizeof(T), &destroy_array, &move_assign_array, &move_array);
754  }
755  return *this;
756  }

◆ operator=() [2/4]

template<typename T , class A >
concurrent_vector& tbb::concurrent_vector< T, A >::operator= ( const concurrent_vector< T, A > &  vector)
inline

Assignment.

Definition at line 736 of file concurrent_vector.h.

736  {
737  if( this != &vector )
738  internal_assign(vector, sizeof(T), &destroy_array, &assign_array, &copy_array);
739  return *this;
740  }

◆ operator=() [3/4]

template<typename T , class A >
template<class M >
__TBB_DEPRECATED concurrent_vector& tbb::concurrent_vector< T, A >::operator= ( const concurrent_vector< T, M > &  vector)
inline

Assignment for vector with different allocator type.

Definition at line 762 of file concurrent_vector.h.

762  {
763  if( static_cast<void*>( this ) != static_cast<const void*>( &vector ) )
764  internal_assign(vector.internal_vector_base(),
765  sizeof(T), &destroy_array, &assign_array, &copy_array);
766  return *this;
767  }

◆ operator=() [4/4]

template<typename T , class A >
concurrent_vector& tbb::concurrent_vector< T, A >::operator= ( std::initializer_list< T >  init_list)
inline

Assignment for initializer_list.

Definition at line 771 of file concurrent_vector.h.

771  {
772  internal_clear(&destroy_array);
773  internal_assign_iterators(init_list.begin(), init_list.end());
774  return *this;
775  }

◆ operator[]() [1/2]

template<typename T , class A >
reference tbb::concurrent_vector< T, A >::operator[] ( size_type  index)
inline

Get reference to element at given index.

This method is thread-safe for concurrent reads, and also while growing the vector, as long as the calling thread has checked that index < size().

Definition at line 867 of file concurrent_vector.h.

867  {
868  return internal_subscript(index);
869  }

◆ operator[]() [2/2]

template<typename T , class A >
const_reference tbb::concurrent_vector< T, A >::operator[] ( size_type  index) const
inline

Get const reference to element at given index.

Definition at line 872 of file concurrent_vector.h.

872  {
873  return internal_subscript(index);
874  }

◆ push_back() [1/2]

template<typename T , class A >
iterator tbb::concurrent_vector< T, A >::push_back ( const_reference  item)
inline

Push item.

Returns iterator pointing to the new element.

Definition at line 836 of file concurrent_vector.h.

837  {
838  push_back_helper prolog(*this);
839  new(prolog.internal_push_back_result()) T(item);
840  return prolog.return_iterator_and_dismiss();
841  }

◆ push_back() [2/2]

template<typename T , class A >
iterator tbb::concurrent_vector< T, A >::push_back ( T &&  item)
inline

Push item, move-aware.

Returns iterator pointing to the new element.

Definition at line 846 of file concurrent_vector.h.

847  {
848  push_back_helper prolog(*this);
849  new(prolog.internal_push_back_result()) T(std::move(item));
850  return prolog.return_iterator_and_dismiss();
851  }

◆ range() [1/2]

template<typename T , class A >
range_type tbb::concurrent_vector< T, A >::range ( size_t  grainsize = 1)
inline

Get range for iterating with parallel algorithms.

Definition at line 887 of file concurrent_vector.h.

887  {
888  return range_type( begin(), end(), grainsize );
889  }

◆ range() [2/2]

template<typename T , class A >
const_range_type tbb::concurrent_vector< T, A >::range ( size_t  grainsize = 1) const
inline

Get const range for iterating with parallel algorithms.

Definition at line 892 of file concurrent_vector.h.

892  {
893  return const_range_type( begin(), end(), grainsize );
894  }

◆ rbegin() [1/2]

template<typename T , class A >
reverse_iterator tbb::concurrent_vector< T, A >::rbegin ( )
inline

reverse start iterator

Definition at line 952 of file concurrent_vector.h.

952 {return reverse_iterator(end());}

◆ rbegin() [2/2]

template<typename T , class A >
const_reverse_iterator tbb::concurrent_vector< T, A >::rbegin ( ) const
inline

reverse start const iterator

Definition at line 956 of file concurrent_vector.h.

956 {return const_reverse_iterator(end());}

◆ rend() [1/2]

template<typename T , class A >
reverse_iterator tbb::concurrent_vector< T, A >::rend ( )
inline

reverse end iterator

Definition at line 954 of file concurrent_vector.h.

954 {return reverse_iterator(begin());}

◆ rend() [2/2]

template<typename T , class A >
const_reverse_iterator tbb::concurrent_vector< T, A >::rend ( ) const
inline

reverse end const iterator

Definition at line 958 of file concurrent_vector.h.

958 {return const_reverse_iterator(begin());}

◆ reserve()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::reserve ( size_type  n)
inline

Allocate enough space to grow to size n without having to allocate more memory later.

Like most of the methods provided for STL compatibility, this method is not thread safe. The capacity afterwards may be bigger than the requested reservation.

Definition at line 914 of file concurrent_vector.h.

914  {
915  if( n )
916  internal_reserve(n, sizeof(T), max_size());
917  }

Referenced by tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::internal_copy().

Here is the caller graph for this function:

◆ resize() [1/2]

template<typename T , class A >
void tbb::concurrent_vector< T, A >::resize ( size_type  n)
inline

Resize the vector. Not thread-safe.

Definition at line 920 of file concurrent_vector.h.

920  {
921  internal_resize( n, sizeof(T), max_size(), NULL, &destroy_array, &initialize_array );
922  }

◆ resize() [2/2]

template<typename T , class A >
void tbb::concurrent_vector< T, A >::resize ( size_type  n,
const_reference  t 
)
inline

Resize the vector, copy t for new elements. Not thread-safe.

Definition at line 925 of file concurrent_vector.h.

925  {
926  internal_resize( n, sizeof(T), max_size(), static_cast<const void*>(&t), &destroy_array, &initialize_array_by );
927  }

◆ shrink_to_fit()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::shrink_to_fit

Optimize memory usage and fragmentation.

Definition at line 1193 of file concurrent_vector.h.

1193  {
1194  internal_segments_table old;
1195  __TBB_TRY {
1196  internal_array_op2 copy_or_move_array =
1197 #if __TBB_MOVE_IF_NOEXCEPT_PRESENT
1198  &move_array_if_noexcept
1199 #else
1200  &copy_array
1201 #endif
1202  ;
1203  if( internal_compact( sizeof(T), &old, &destroy_array, copy_or_move_array ) )
1204  internal_free_segments( old.table, pointers_per_long_table, old.first_block ); // free joined and unnecessary segments
1205  } __TBB_CATCH(...) {
1206  if( old.first_block ) // free segment allocated for compacting. Only for support of exceptions in ctor of user T[ype]
1207  internal_free_segments( old.table, 1, old.first_block );
1208  __TBB_RETHROW();
1209  }
1210 }

◆ size()

template<typename T , class A >
size_type tbb::concurrent_vector< T, A >::size ( ) const
inline

Return size of vector. It may include elements under construction.

Definition at line 900 of file concurrent_vector.h.

900  {
901  size_type sz = my_early_size, cp = internal_capacity();
902  return cp < sz ? cp : sz;
903  }

Referenced by tbb::concurrent_vector< padded_element, padded_allocator_type >::back(), tbb::concurrent_vector< padded_element, padded_allocator_type >::cend(), tbb::concurrent_vector< padded_element, padded_allocator_type >::end(), tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::end(), tbb::concurrent_vector< padded_element, padded_allocator_type >::front(), tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::internal_copy(), and tbb::interface6::enumerable_thread_specific< T, my_alloc, ets_no_key >::size().

Here is the caller graph for this function:

◆ swap()

template<typename T , class A >
void tbb::concurrent_vector< T, A >::swap ( concurrent_vector< T, A > &  vector)
inline

swap two instances

Definition at line 1008 of file concurrent_vector.h.

1008  {
1010  if( this != &vector && (this->my_allocator == vector.my_allocator || pocs_t::value) ) {
1011  concurrent_vector_base_v3::internal_swap(static_cast<concurrent_vector_base_v3&>(vector));
1012  tbb::internal::allocator_swap(this->my_allocator, vector.my_allocator, pocs_t());
1013  }
1014  }

Friends And Related Function Documentation

◆ internal::vector_iterator

template<typename T , class A >
template<typename C , typename U >
friend class internal::vector_iterator
friend

Definition at line 568 of file concurrent_vector.h.

Member Data Documentation

◆ const_pointer

template<typename T , class A >
const typedef T* tbb::concurrent_vector< T, A >::const_pointer

Definition at line 582 of file concurrent_vector.h.

◆ const_reference

template<typename T , class A >
const typedef T& tbb::concurrent_vector< T, A >::const_reference

Definition at line 580 of file concurrent_vector.h.


The documentation for this class was generated from the following file:
tbb::concurrent_vector::const_iterator
internal::vector_iterator< concurrent_vector, const T > const_iterator
Definition: concurrent_vector.h:585
tbb::acquire
@ acquire
Acquire.
Definition: atomic.h:57
tbb::relaxed
@ relaxed
No ordering.
Definition: atomic.h:61
tbb::concurrent_vector::move_array
static void __TBB_EXPORTED_FUNC move_array(void *dst, const void *src, size_type n)
Move-construct n instances of T, starting at "dst" by copying according element of src array.
Definition: concurrent_vector.h:1306
tbb::internal::eid_index_range_error
@ eid_index_range_error
Definition: tbb_exception.h:73
tbb::concurrent_vector::assign_array
static void __TBB_EXPORTED_FUNC assign_array(void *dst, const void *src, size_type n)
Assign (using operator=) n instances of T, starting at "dst" by assigning according element of src ar...
Definition: concurrent_vector.h:1330
__TBB_ASSERT
#define __TBB_ASSERT(predicate, comment)
No-op version of __TBB_ASSERT.
Definition: tbb_stddef.h:165
tbb::internal::concurrent_vector_base
concurrent_vector_base_v3 concurrent_vector_base
Definition: concurrent_vector.h:288
tbb::internal::allocator_move_assignment
void allocator_move_assignment(MyAlloc &my_allocator, OtherAlloc &other_allocator, traits_true_type)
Definition: _allocator_traits.h:59
tbb::concurrent_vector::const_reverse_iterator
std::reverse_iterator< const_iterator > const_reverse_iterator
Definition: concurrent_vector.h:590
tbb::internal::throw_exception
void throw_exception(exception_id eid)
Versionless convenience wrapper for throw_exception_v4()
Definition: tbb_exception.h:105
tbb::internal::eid_segment_range_error
@ eid_segment_range_error
Definition: tbb_exception.h:72
tbb::concurrent_vector::internal_assign_range
void internal_assign_range(I first, I last, is_integer_tag< true > *)
assign integer items by copying when arguments are treated as iterators. See C++ Standard 2003 23....
Definition: concurrent_vector.h:1060
tbb::concurrent_vector::internal_subscript_with_exceptions
T & internal_subscript_with_exceptions(size_type index) const
Get reference to element at given index with errors checks.
Definition: concurrent_vector.h:1251
tbb::internal::first
Container::iterator first(Container &c)
Definition: _range_iterator.h:46
tbb::internal::allocator_swap
void allocator_swap(MyAlloc &my_allocator, OtherAlloc &other_allocator, traits_true_type)
Definition: _allocator_traits.h:69
tbb::internal::last
Container::iterator last(Container &c)
Definition: _range_iterator.h:52
tbb::concurrent_vector::initialize_array
static void __TBB_EXPORTED_FUNC initialize_array(void *begin, const void *, size_type n)
Construct n instances of T, starting at "begin".
Definition: concurrent_vector.h:1290
tbb::concurrent_vector::initialize_array_by
static void __TBB_EXPORTED_FUNC initialize_array_by(void *begin, const void *src, size_type n)
Copy-construct n instances of T, starting at "begin".
Definition: concurrent_vector.h:1295
tbb::internal::eid_out_of_range
@ eid_out_of_range
Definition: tbb_exception.h:71
tbb::concurrent_vector::concurrent_vector
concurrent_vector(const allocator_type &a=allocator_type())
Construct empty vector.
Definition: concurrent_vector.h:608
tbb::internal::concurrent_vector_base_v3::internal_swap
void __TBB_EXPORTED_METHOD internal_swap(concurrent_vector_base_v3 &v)
Definition: concurrent_vector.cpp:582
tbb::concurrent_vector::size
size_type size() const
Return size of vector. It may include elements under construction.
Definition: concurrent_vector.h:900
tbb::move
void move(tbb_thread &t1, tbb_thread &t2)
Definition: tbb_thread.h:319
tbb::concurrent_vector::clear
void clear()
Clear container while keeping memory allocated.
Definition: concurrent_vector.h:1018
tbb::concurrent_vector::grow_by
iterator grow_by(size_type delta)
Grow by "delta" elements.
Definition: concurrent_vector.h:783
tbb::concurrent_vector::max_size
size_type max_size() const
Upper bound on argument to reserve.
Definition: concurrent_vector.h:933
tbb::concurrent_vector::size_type
internal::concurrent_vector_base_v3::size_type size_type
Definition: concurrent_vector.h:574
tbb::concurrent_vector::internal_allocator
static void * internal_allocator(internal::concurrent_vector_base_v3 &vb, size_t k)
Allocate k items.
Definition: concurrent_vector.h:1032
tbb::internal::bool_constant
Definition: tbb_stddef.h:486
__TBB_TRY
#define __TBB_TRY
Definition: tbb_stddef.h:283
tbb::concurrent_vector::internal_subscript
T & internal_subscript(size_type index) const
Get reference to element at given index.
Definition: concurrent_vector.h:1234
tbb::concurrent_vector::iterator
internal::vector_iterator< concurrent_vector, T > iterator
Definition: concurrent_vector.h:584
tbb::concurrent_vector::destroy_array
static void __TBB_EXPORTED_FUNC destroy_array(void *begin, size_type n)
Destroy n instances of T, starting at "begin".
Definition: concurrent_vector.h:1340
tbb::concurrent_vector::reverse_iterator
std::reverse_iterator< iterator > reverse_iterator
Definition: concurrent_vector.h:589
tbb::concurrent_vector::end
iterator end()
end iterator
Definition: concurrent_vector.h:942
tbb::concurrent_vector::move_assign_array
static void __TBB_EXPORTED_FUNC move_assign_array(void *dst, const void *src, size_type n)
Move-assign (using operator=) n instances of T, starting at "dst" by assigning according element of s...
Definition: concurrent_vector.h:1310
value
void const char const char int ITT_FORMAT __itt_group_sync x void const char ITT_FORMAT __itt_group_sync s void ITT_FORMAT __itt_group_sync p void ITT_FORMAT p void ITT_FORMAT p no args __itt_suppress_mode_t unsigned int void size_t ITT_FORMAT d void ITT_FORMAT p void ITT_FORMAT p __itt_model_site __itt_model_site_instance ITT_FORMAT p __itt_model_task __itt_model_task_instance ITT_FORMAT p void ITT_FORMAT p void ITT_FORMAT p void size_t ITT_FORMAT d void ITT_FORMAT p const wchar_t ITT_FORMAT s const char ITT_FORMAT s const char ITT_FORMAT s const char ITT_FORMAT s no args void ITT_FORMAT p size_t ITT_FORMAT d no args const wchar_t const wchar_t ITT_FORMAT s __itt_heap_function void size_t int ITT_FORMAT d __itt_heap_function void ITT_FORMAT p __itt_heap_function void void size_t int ITT_FORMAT d no args no args unsigned int ITT_FORMAT u const __itt_domain __itt_id ITT_FORMAT lu const __itt_domain __itt_id __itt_id __itt_string_handle ITT_FORMAT p const __itt_domain __itt_id ITT_FORMAT p const __itt_domain __itt_id __itt_timestamp __itt_timestamp ITT_FORMAT lu const __itt_domain __itt_id __itt_id __itt_string_handle ITT_FORMAT p const __itt_domain ITT_FORMAT p const __itt_domain __itt_string_handle unsigned long long value
Definition: ittnotify_static.h:192
tbb::concurrent_vector::const_range_type
generic_range_type< const_iterator > const_range_type
Definition: concurrent_vector.h:601
__TBB_CATCH
#define __TBB_CATCH(e)
Definition: tbb_stddef.h:284
p
void const char const char int ITT_FORMAT __itt_group_sync p
Definition: ittnotify_static.h:91
tbb::concurrent_vector::begin
iterator begin()
start iterator
Definition: concurrent_vector.h:940
tbb::concurrent_vector::range_type
generic_range_type< iterator > range_type
Definition: concurrent_vector.h:600
__TBB_RETHROW
#define __TBB_RETHROW()
Definition: tbb_stddef.h:286
tbb::concurrent_vector::internal_assign_iterators
void internal_assign_iterators(I first, I last)
assign by iterators
Definition: concurrent_vector.h:1269
tbb::concurrent_vector::internal_free_segments
void internal_free_segments(segment_t table[], segment_index_t k, segment_index_t first_block)
Free k segments from table.
Definition: concurrent_vector.h:1216
tbb::concurrent_vector::copy_array
static void __TBB_EXPORTED_FUNC copy_array(void *dst, const void *src, size_type n)
Copy-construct n instances of T by copying single element pointed to by src, starting at "dst".
Definition: concurrent_vector.h:1300
tbb::concurrent_vector::internal_assign_n
void internal_assign_n(size_type n, const_pointer p)
assign n items by copying t
Definition: concurrent_vector.h:1045

Copyright © 2005-2020 Intel Corporation. All Rights Reserved.

Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are registered trademarks or trademarks of Intel Corporation or its subsidiaries in the United States and other countries.

* Other names and brands may be claimed as the property of others.