|
| metadb_io_hintlist_wrapper_part3 (const pfc::list_base_const_t< metadb_io_hintlist::t_entry > &p_list) |
|
t_size | get_count () const |
|
void | get_item_ex (t_filestats &p_out, t_size n) const |
|
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_filestats | 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_filestats | 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 |
|
Definition at line 32 of file metadb_io_hintlist.h.
t_size metadb_io_hintlist::metadb_io_hintlist_wrapper_part3::get_count |
( |
| ) |
const |
|
inlinevirtual |
void metadb_io_hintlist::metadb_io_hintlist_wrapper_part3::get_item_ex |
( |
t_filestats & |
p_out, |
|
|
t_size |
n |
|
) |
| const |
|
inlinevirtual |
The documentation for this class was generated from the following file: