|
template<typename T , size_t nodeCount, bool bEnableOverflow = true, typename OverflowAllocator = typename eastl::type_select<bEnableOverflow, EASTLAllocatorType, EASTLDummyAllocatorType>::type> |
void | Divide::efficient_clear (eastl::fixed_vector< T, nodeCount, bEnableOverflow, OverflowAllocator > &fixed_vector) |
|
template<typename T , typename A > |
void | Divide::efficient_clear (eastl::vector< T, A > &vec) |
|
template<typename T , typename Pred , typename A > |
eastl::vector< T, A >::iterator | Divide::insert_sorted (eastl::vector< T, A > &vec, T const &item, Pred &&pred) |
|
template<typename T , typename A > |
void | Divide::insert_unique (eastl::vector< T, A > &target, const T &item) |
|
template<typename T , typename A1 , typename A2 > |
void | Divide::insert_unique (eastl::vector< T, A1 > &target, const eastl::vector< T, A2 > &source) |
|
template<typename T , typename A1 , typename A2 > |
void | Divide::insert (eastl::vector< T, A1 > &target, const eastl::vector< T, A2 > &source) |
|
template<typename T , typename A > |
bool | Divide::contains (eastl::vector< T, A > &vec, const T &val) |
|
template<typename T , typename A , class Predicate > |
bool | Divide::dvd_erase_if (eastl::vector< T, A > &vec, Predicate &&pred) |
|
template<typename T , typename A > |
void | Divide::pop_front (eastl::vector< T, A > &vec) |
|
template<typename T , typename A1 , typename A2 > |
void | Divide::unchecked_copy (eastl::vector< T, A1 > &dst, const eastl::vector< T, A2 > &src) |
|
template<typename T , typename U , typename A > |
eastl::vector< T, A > | Divide::convert (const eastl::vector< U, A > &data) |
|
template<typename Cont , typename It > |
auto | Divide::ToggleIndices (Cont &cont, It beg, It end) -> decltype(eastl::end(cont)) |
|
template<typename Cont , typename IndCont > |
void | Divide::EraseIndicesSorted (Cont &cont, IndCont &indices) |
|
template<typename Cont , typename IndCont > |
void | Divide::EraseIndices (Cont &cont, IndCont &indices) |
|
template<typename T , typename A1 , typename A2 > |
eastl::vector< T, A1 > | Divide::erase_indices (const eastl::vector< T, A1 > &data, eastl::vector< size_t, A2 > &indicesToDelete) |
|
template<typename T , typename A1 , typename A2 > |
eastl::vector< T, A1 > | Divide::erase_sorted_indices (const eastl::vector< T, A1 > &data, eastl::vector< size_t, A2 > &indicesToDelete) |
|