|
| | cfg_objList (const GUID &guid) |
| |
| template<typename TSource , unsigned Count> |
| | cfg_objList (const GUID &guid, const TSource(&source)[Count]) |
| |
| void | get_data_raw (stream_writer *p_stream, abort_callback &p_abort) |
| |
| template<typename t_in > |
| t_self & | operator+= (t_in const &p_source) |
| |
| template<typename t_in > |
| t_self & | operator= (t_in const &source) |
| |
| template<typename t_in > |
| t_self & | operator|= (t_in const &p_source) |
| |
| template<typename TSource , unsigned Count> |
| void | reset (const TSource(&source)[Count]) |
| |
| void | set_data_raw (stream_reader *p_stream, t_size p_sizehint, abort_callback &p_abort) |
| |
| GUID | get_guid () const |
| |
| | cfg_var_reader (const GUID &guid) |
| |
| | ~cfg_var_reader () |
| |
| | cfg_var_writer (const GUID &guid) |
| |
| | ~cfg_var_writer () |
| |
| 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< TObj > &source, t_size base) |
| |
| t_size | add_item (const TObj &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 |
| |
| TObj | get_item (t_size n) const |
| |
| void | get_item_ex (TObj &p_out, t_size n) const |
| |
| const TObj & | get_item_ref (t_size n) const |
| |
| void | get_items_mask (list_impl_t< TObj, array_t< TObj, alloc_fast > > &out, const bit_array &mask) |
| |
| const TObj * | get_ptr () const |
| |
| TObj * | 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 TObj &item, t_size idx) |
| |
| t_size | insert_items (const list_base_const_t< TObj > &source, t_size base) |
| |
| t_size | insert_items (const list_base_t< TObj > &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 TObj & | operator[] (t_size n) const |
| |
| TObj & | operator[] (t_size n) |
| |
| t_self & | operator|= (t_in const &p_source) |
| |
| void | prealloc (t_size count) |
| |
| void | remove_all () |
| |
| TObj | remove_by_idx (t_size idx) |
| |
| void | remove_from_idx (t_size idx, t_size num) |
| |
| void | remove_item (const TObj &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 TObj &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, TObj &p_item) |
| |
| void | swap_items (t_size p_index1, t_size p_index2) |
| |
| t_size | add_item (const TObj &item) |
| |
| t_size | add_items (const list_base_const_t< TObj > &items) |
| |
| t_size | add_items_fromptr (const TObj *source, t_size num) |
| |
| t_size | add_items_repeat (TObjitem, 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 TObj &item, t_size base) |
| |
| t_size | insert_items_fromptr (const TObj *source, t_size num, t_size base) |
| |
| t_size | insert_items_repeat (const TObj &item, t_size num, t_size base) |
| |
| t_self & | operator+= (t_in const &p_source) |
| |
| t_self & | operator= (t_in const &source) |
| |
| TObj | 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) |
| |
| TObj | replace_item_ex (t_size p_index, const TObj &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 |
| |
| TObj | 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 |
| |
| TObj | 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 TObj>
class cfg_objList< TObj >
Definition at line 170 of file cfg_var.h.