|
| ptr_list_hybrid_t () |
|
| ptr_list_hybrid_t (const ptr_list_hybrid_t< T, N > &p_source) |
|
| ptr_list_t () |
|
| ptr_list_t (const ptr_list_t< T > &p_source) |
|
void | delete_all () |
|
void | delete_by_idx (t_size p_index) |
|
void | delete_item (T *ptr) |
|
void | delete_mask (const bit_array &p_mask) |
|
void | free_all () |
|
void | free_by_idx (t_size n) |
|
void | free_mask (const bit_array &p_mask) |
|
T * | operator[] (t_size n) const |
|
t_self & | operator+= (t_in const &p_source) |
|
t_self & | operator= (t_in const &source) |
|
t_self & | operator|= (t_in const &p_source) |
|
| list_impl_t () |
|
| list_impl_t (const t_self &p_source) |
|
t_size | _insert_item_t (const t_in &item, t_size idx) |
|
t_size | _insert_items_v (const list_base_const_t< T * > &source, t_size base) |
|
t_size | add_item (const T *&item) |
|
t_size | add_item (const t_in &item) |
|
void | add_items (const t_in &in) |
|
void | filter_mask (const bit_array &mask) |
|
void | filter_mask (const bool *mask) |
|
t_size | find_duplicates_sorted_permutation_t (t_compare p_compare, t_permutation p_permutation, bit_array_var &p_out) |
|
t_size | find_duplicates_sorted_t (t_compare p_compare, bit_array_var &p_out) const |
|
t_size | find_item (const t_search &p_item) const |
|
t_size | get_count () const |
|
T * | get_item (t_size n) const |
|
void | get_item_ex (T *&p_out, t_size n) const |
|
const T *& | get_item_ref (t_size n) const |
|
void | get_items_mask (list_impl_t< T *, array_hybrid_t< T *, p_fixed_count, alloc_fast > > &out, const bit_array &mask) |
|
const T ** | get_ptr () const |
|
T ** | get_ptr () |
|
t_size | get_size () const |
|
bool | have_item (const t_search &p_item) const |
|
t_size | insert_item (const t_in &item, t_size idx) |
|
t_size | insert_item (const T *&item, t_size idx) |
|
t_size | insert_items (const list_base_const_t< T * > &source, t_size base) |
|
t_size | insert_items (const list_base_t< T * > &source, t_size base) |
|
t_size | insert_items (const t_in &source, t_size base) |
|
void | move_from (t_self &other) |
|
t_self & | operator+= (t_in const &p_source) |
|
t_self & | operator= (t_in const &source) |
|
const T *& | operator[] (t_size n) const |
|
T *& | operator[] (t_size n) |
|
t_self & | operator|= (t_in const &p_source) |
|
void | prealloc (t_size count) |
|
void | remove_all () |
|
T * | remove_by_idx (t_size idx) |
|
void | remove_from_idx (t_size idx, t_size num) |
|
void | remove_item (const T *&item) |
|
void | remove_mask (const bit_array &mask) |
|
void | remove_mask (const bool *mask) |
|
void | reorder_partial (t_size p_base, const t_size *p_order, t_size p_count) |
|
void | replace_item (t_size idx, const T *&item) |
|
void | set_count (t_size p_count) |
|
void | set_size (t_size p_count) |
|
void | sort () |
|
void | sort (typename t_base::sort_callback &p_callback) |
|
void | sort_stable (typename t_base::sort_callback &p_callback) |
|
void | sort_stable_t (t_compare p_compare) |
|
void | sort_t (t_compare p_compare) |
|
void | swap_item_with (t_size p_index, T *&p_item) |
|
void | swap_items (t_size p_index1, t_size p_index2) |
|
t_size | add_item (const T *&item) |
|
t_size | add_items (const list_base_const_t< T * > &items) |
|
t_size | add_items_fromptr (const T **source, t_size num) |
|
t_size | add_items_repeat (T *item, t_size num) |
|
void | for_each (t_func p_func) |
|
void | for_each (t_func p_func, const bit_array &p_mask) |
|
t_size | insert_item (const T *&item, t_size base) |
|
t_size | insert_items_fromptr (const T **source, t_size num, t_size base) |
|
t_size | insert_items_repeat (const T *&item, t_size num, t_size base) |
|
t_self & | operator+= (t_in const &p_source) |
|
t_self & | operator= (t_in const &source) |
|
T * | operator[] (t_size n) const |
|
t_self & | operator|= (t_in const &p_source) |
|
void | remove_all () |
|
void | remove_all_ex (t_releasefunc p_func) |
|
void | remove_duplicates_t (t_compare p_compare) |
|
void | remove_mask (const bit_array &mask) |
|
void | remove_mask_ex (const bit_array &p_mask, t_releasefunc p_func) |
|
void | reorder (const t_size *p_data) |
|
T * | replace_item_ex (t_size p_index, const T *&p_item) |
|
virtual void | sort (sort_callback &p_callback)=0 |
|
void | sort () |
|
void | sort_remove_duplicates_t (t_compare p_compare) |
|
virtual void | sort_stable (sort_callback &p_callback)=0 |
|
void | sort_stable_remove_duplicates_t (t_compare p_compare) |
|
void | sort_stable_t (t_compare p_compare) |
|
void | sort_t (t_compare p_compare) |
|
void | truncate (t_size val) |
|
bool | bsearch_permutation_t (t_compare p_compare, t_param const &p_param, const t_permutation &p_permutation, t_size &p_index) const |
|
bool | bsearch_t (t_compare p_compare, t_param const &p_param, t_size &p_index) const |
|
void | enumerate (t_callback &p_callback) const |
|
t_size | find_duplicates_sorted_permutation_t (t_compare p_compare, t_permutation const &p_permutation, bit_array_var &p_out) |
|
t_size | find_duplicates_sorted_t (t_compare p_compare, bit_array_var &p_out) const |
|
t_size | find_item (const t_search &p_item) const |
|
T * | get_item (t_size n) const |
|
t_size | get_size () const |
|
bool | have_item (const t_search &p_item) const |
|
bool | operator!= (const t_self &item2) const |
|
bool | operator== (const t_self &item2) const |
|
T * | operator[] (t_size n) const |
|
void | sort_get_permutation_t (t_compare p_compare, t_permutation const &p_permutation) const |
|
void | sort_stable_get_permutation_t (t_compare p_compare, t_permutation const &p_permutation) const |
|
template<typename T, t_size N>
class pfc::ptr_list_hybrid_t< T, N >
Definition at line 35 of file ptr_list.h.