|
| | list_const_array_t (A p_data, t_size p_count) |
| |
| t_size | get_count () const |
| |
| void | get_item_ex (T &p_out, t_size n) const |
| |
| template<typename t_compare , typename t_param , typename t_permutation > |
| bool | bsearch_permutation_t (t_compare p_compare, t_param const &p_param, const t_permutation &p_permutation, t_size &p_index) const |
| |
| template<typename t_compare , typename t_param > |
| bool | bsearch_t (t_compare p_compare, t_param const &p_param, t_size &p_index) const |
| |
| template<typename t_callback > |
| void | enumerate (t_callback &p_callback) const |
| |
| template<typename t_compare , typename t_permutation > |
| t_size | find_duplicates_sorted_permutation_t (t_compare p_compare, t_permutation const &p_permutation, bit_array_var &p_out) |
| |
| template<typename t_compare > |
| t_size | find_duplicates_sorted_t (t_compare p_compare, bit_array_var &p_out) const |
| |
| template<typename t_search > |
| t_size | find_item (const t_search &p_item) const |
| |
| T | get_item (t_size n) const |
| |
| t_size | get_size () const |
| |
| template<typename t_search > |
| 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 |
| |
| template<typename t_compare , typename t_permutation > |
| void | sort_get_permutation_t (t_compare p_compare, t_permutation const &p_permutation) const |
| |
| template<typename t_compare , typename t_permutation > |
| void | sort_stable_get_permutation_t (t_compare p_compare, t_permutation const &p_permutation) const |
| |
template<typename T, typename A>
class pfc::list_const_array_t< T, A >
Definition at line 121 of file list.h.