Tizen Native API
5.5
|
Vector algorithm variant for trivial types. More...
Protected Member Functions | |
VectorAlgorithms () | |
Empty constructor. | |
~VectorAlgorithms () | |
Empty destructor. | |
void | Copy (const VectorBase &rhs, SizeType elementSize) |
Copy vector contents. | |
void | Reserve (SizeType count, SizeType elementSize) |
Reserves space in the vector. | |
void | Resize (SizeType count, SizeType elementSize) |
Resizes the vector. Does not change capacity. | |
void | Clear () |
Clears the contents. | |
void | Release () |
Releases the vector. | |
void | Erase (uint8_t *address, SizeType elementSize) |
Erases an element. Does not change capacity. | |
uint8_t * | Erase (uint8_t *first, uint8_t *last, SizeType elementSize) |
Erases a range of elements. Does not change capacity. | |
void | Insert (uint8_t *at, uint8_t *from, uint8_t *to, SizeType elementSize) |
Inserts the given elements into the vector. |
Vector algorithm variant for trivial types.
Trivial types do not need destructor or copy constructor called.
Dali::VectorAlgorithms< IsTrivial >::VectorAlgorithms | ( | ) | [protected] |
Empty constructor.
Dali::VectorAlgorithms< IsTrivial >::~VectorAlgorithms | ( | ) | [protected] |
Empty destructor.
void Dali::VectorAlgorithms< IsTrivial >::Clear | ( | ) | [protected] |
Clears the contents.
For simple types, nothing to do.
Reimplemented in Dali::Vector< T, IsTrivialType >, Dali::Vector< SlotConnection * >, and Dali::Vector< SignalConnection * >.
void Dali::VectorAlgorithms< IsTrivial >::Copy | ( | const VectorBase & | rhs, |
SizeType | elementSize | ||
) | [protected] |
Copy vector contents.
[in] | rhs | VectorBase object to copy from |
[in] | elementSize | Size of the content |
Reimplemented from Dali::VectorBase.
void Dali::VectorAlgorithms< IsTrivial >::Erase | ( | uint8_t * | address, |
SizeType | elementSize | ||
) | [protected] |
Erases an element. Does not change capacity.
[in] | address | Address to erase from |
[in] | elementSize | Size to erase |
uint8_t* Dali::VectorAlgorithms< IsTrivial >::Erase | ( | uint8_t * | first, |
uint8_t * | last, | ||
SizeType | elementSize | ||
) | [protected] |
Erases a range of elements. Does not change capacity.
[in] | first | Address to the first element to be erased |
[in] | last | Address to the last element to be erased |
[in] | elementSize | Size of one of the elements to be erased |
void Dali::VectorAlgorithms< IsTrivial >::Insert | ( | uint8_t * | at, |
uint8_t * | from, | ||
uint8_t * | to, | ||
SizeType | elementSize | ||
) | [protected] |
Inserts the given elements into the vector.
[in] | at | Address where to insert the elements into the vector |
[in] | from | Address to the first element to be inserted |
[in] | to | Address to the last element to be inserted |
[in] | elementSize | Size of one of the elements to be inserted |
void Dali::VectorAlgorithms< IsTrivial >::Release | ( | ) | [protected] |
Releases the vector.
Reimplemented from Dali::VectorBase.
Reimplemented in Dali::Vector< T, IsTrivialType >, Dali::Vector< SlotConnection * >, and Dali::Vector< SignalConnection * >.
void Dali::VectorAlgorithms< IsTrivial >::Reserve | ( | SizeType | count, |
SizeType | elementSize | ||
) | [protected] |
Reserves space in the vector.
[in] | count | Count of elements to reserve |
[in] | elementSize | Size of a single element |
Reimplemented from Dali::VectorBase.
void Dali::VectorAlgorithms< IsTrivial >::Resize | ( | SizeType | count, |
SizeType | elementSize | ||
) | [protected] |
Resizes the vector. Does not change capacity.
[in] | count | Count to resize to |
[in] | elementSize | Size of a single element |