#include <list.h>

Public Member Functions | |
| list_impl_t () | |
| list_impl_t (const list_impl_t< T, t_storage > &p_source) | |
| void | prealloc (t_size count) |
| void | set_count (t_size p_count) |
| void | set_size (t_size p_count) |
| t_size | insert_item (const T &item, t_size idx) |
| T | remove_by_idx (t_size idx) |
| void | get_item_ex (T &p_out, t_size n) const |
| const T & | get_item_ref (t_size n) const |
| T | get_item (t_size n) const |
| t_size | get_count () const |
| t_size | get_size () const |
| const T & | operator[] (t_size n) const |
| const T * | get_ptr () const |
| T * | get_ptr () |
| T & | operator[] (t_size n) |
| void | remove_from_idx (t_size idx, t_size num) |
| t_size | insert_items (const list_base_const_t< T > &source, t_size base) |
| void | get_items_mask (list_impl_t< T, t_storage > &out, const bit_array &mask) |
| void | filter_mask (const bit_array &mask) |
| void | replace_item (t_size idx, const T &item) |
| void | sort () |
| template<typename t_compare> | |
| void | sort_t (t_compare p_compare) |
| template<typename t_compare> | |
| void | sort_stable_t (t_compare p_compare) |
| void | reorder_partial (t_size p_base, const t_size *p_order, t_size p_count) |
| template<typename t_compare> | |
| t_size | find_duplicates_sorted_t (t_compare p_compare, bit_array_var &p_out) const |
| template<typename t_compare, typename t_permutation> | |
| t_size | find_duplicates_sorted_permutation_t (t_compare p_compare, t_permutation p_permutation, bit_array_var &p_out) |
| void | sort (sort_callback &p_callback) |
| void | sort_stable (sort_callback &p_callback) |
| void | remove_mask (const bit_array &mask) |
| void | remove_mask (const bool *mask) |
| void | filter_mask (const bool *mask) |
| t_size | add_item (const T &item) |
| void | remove_all () |
| void | remove_item (const T &item) |
| void | swap_item_with (t_size p_index, T &p_item) |
| void | swap_items (t_size p_index1, t_size p_index2) |
| template<typename t_search> | |
| t_size | find_item (const t_search &p_item) const |
| template<typename t_search> | |
| bool | have_item (const t_search &p_item) const |
Static Public Member Functions | |
| static void | g_swap (list_impl_t< T, t_storage > &p_item1, list_impl_t< T, t_storage > &p_item2) |
Protected Attributes | |
| t_storage | m_buffer |
Classes | |
| class | sort_callback_wrapper |
| pfc::list_impl_t< T, t_storage >::list_impl_t | ( | ) | [inline] |
| pfc::list_impl_t< T, t_storage >::list_impl_t | ( | const list_impl_t< T, t_storage > & | p_source | ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::prealloc | ( | t_size | count | ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::set_count | ( | t_size | p_count | ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::set_size | ( | t_size | p_count | ) | [inline] |
| t_size pfc::list_impl_t< T, t_storage >::insert_item | ( | const T & | item, | |
| t_size | idx | |||
| ) | [inline] |
Reimplemented from pfc::list_base_t< T >.
| T pfc::list_impl_t< T, t_storage >::remove_by_idx | ( | t_size | idx | ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::get_item_ex | ( | T & | p_out, | |
| t_size | n | |||
| ) | const [inline, virtual] |
Implements pfc::list_base_const_t< T >.
| const T& pfc::list_impl_t< T, t_storage >::get_item_ref | ( | t_size | n | ) | const [inline] |
| T pfc::list_impl_t< T, t_storage >::get_item | ( | t_size | n | ) | const [inline] |
Reimplemented from pfc::list_base_const_t< T >.
| t_size pfc::list_impl_t< T, t_storage >::get_count | ( | ) | const [inline, virtual] |
Implements pfc::list_base_const_t< T >.
| t_size pfc::list_impl_t< T, t_storage >::get_size | ( | ) | const [inline] |
Reimplemented from pfc::list_base_const_t< T >.
| const T& pfc::list_impl_t< T, t_storage >::operator[] | ( | t_size | n | ) | const [inline] |
Reimplemented from pfc::list_base_t< T >.
Reimplemented in pfc::ptr_list_t< T, pfc::list_hybrid_t< T *, N > >, pfc::ptr_list_t< t_object, pfc::list_hybrid_t< t_object *, N > >, pfc::ptr_list_t< char >, and pfc::ptr_list_t< dsp_preset_impl >.
| const T* pfc::list_impl_t< T, t_storage >::get_ptr | ( | ) | const [inline] |
| T* pfc::list_impl_t< T, t_storage >::get_ptr | ( | ) | [inline] |
| T& pfc::list_impl_t< T, t_storage >::operator[] | ( | t_size | n | ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::remove_from_idx | ( | t_size | idx, | |
| t_size | num | |||
| ) | [inline] |
| t_size pfc::list_impl_t< T, t_storage >::insert_items | ( | const list_base_const_t< T > & | source, | |
| t_size | base | |||
| ) | [inline, virtual] |
Implements pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::get_items_mask | ( | list_impl_t< T, t_storage > & | out, | |
| const bit_array & | mask | |||
| ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::filter_mask | ( | const bit_array & | mask | ) | [inline, virtual] |
Implements pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::replace_item | ( | t_size | idx, | |
| const T & | item | |||
| ) | [inline, virtual] |
Implements pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::sort | ( | ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::sort_t | ( | t_compare | p_compare | ) | [inline] |
Reimplemented from pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::sort_stable_t | ( | t_compare | p_compare | ) | [inline] |
Reimplemented from pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::reorder_partial | ( | t_size | p_base, | |
| const t_size * | p_order, | |||
| t_size | p_count | |||
| ) | [inline, virtual] |
Implements pfc::list_base_t< T >.
| t_size pfc::list_impl_t< T, t_storage >::find_duplicates_sorted_t | ( | t_compare | p_compare, | |
| bit_array_var & | p_out | |||
| ) | const [inline] |
Reimplemented from pfc::list_base_const_t< T >.
| t_size pfc::list_impl_t< T, t_storage >::find_duplicates_sorted_permutation_t | ( | t_compare | p_compare, | |
| t_permutation | p_permutation, | |||
| bit_array_var & | p_out | |||
| ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::sort | ( | sort_callback & | p_callback | ) | [inline, virtual] |
Implements pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::sort_stable | ( | sort_callback & | p_callback | ) | [inline, virtual] |
Implements pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::remove_mask | ( | const bit_array & | mask | ) | [inline] |
Reimplemented from pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::remove_mask | ( | const bool * | mask | ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::filter_mask | ( | const bool * | mask | ) | [inline] |
| t_size pfc::list_impl_t< T, t_storage >::add_item | ( | const T & | item | ) | [inline] |
Reimplemented from pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::remove_all | ( | ) | [inline] |
Reimplemented from pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::remove_item | ( | const T & | item | ) | [inline] |
| void pfc::list_impl_t< T, t_storage >::swap_item_with | ( | t_size | p_index, | |
| T & | p_item | |||
| ) | [inline, virtual] |
Implements pfc::list_base_t< T >.
| void pfc::list_impl_t< T, t_storage >::swap_items | ( | t_size | p_index1, | |
| t_size | p_index2 | |||
| ) | [inline, virtual] |
Implements pfc::list_base_t< T >.
| static void pfc::list_impl_t< T, t_storage >::g_swap | ( | list_impl_t< T, t_storage > & | p_item1, | |
| list_impl_t< T, t_storage > & | p_item2 | |||
| ) | [inline, static] |
| t_size pfc::list_impl_t< T, t_storage >::find_item | ( | const t_search & | p_item | ) | const [inline] |
Reimplemented from pfc::list_base_const_t< T >.
| bool pfc::list_impl_t< T, t_storage >::have_item | ( | const t_search & | p_item | ) | const [inline] |
Reimplemented from pfc::list_base_const_t< T >.
t_storage pfc::list_impl_t< T, t_storage >::m_buffer [protected] |
1.5.5