The world's most popular open source database
List< T > Class Template Reference
#include <sql_list.h>
Inheritance diagram for List< T >:
Public Member Functions | |
| List () | |
| List (const List< T > &tmp) | |
| bool | push_back (T *a) |
| bool | push_back (T *a, MEM_ROOT *mem_root) |
| bool | push_front (T *a) |
| T * | head () |
| T ** | head_ref () |
| T * | pop () |
| void | concat (List< T > *list) |
| void | disjoin (List< T > *list) |
| void | prepand (List< T > *list) |
| void | delete_elements (void) |
Detailed Description
template<class T>
class List< T >
Definition at line 346 of file sql_list.h.
Constructor & Destructor Documentation
Member Function Documentation
Definition at line 358 of file sql_list.h.
Referenced by imerge_list_and_list(), Item_equal::merge(), and store_natural_using_join_columns().
00358 { base_list::concat(list); }
Here is the caller graph for this function:
| void List< T >::delete_elements | ( | void | ) | [inline] |
Definition at line 361 of file sql_list.h.
Referenced by JOIN::cleanup(), QUICK_INDEX_MERGE_SELECT::~QUICK_INDEX_MERGE_SELECT(), QUICK_ROR_INTERSECT_SELECT::~QUICK_ROR_INTERSECT_SELECT(), and QUICK_ROR_UNION_SELECT::~QUICK_ROR_UNION_SELECT().
00362 { 00363 list_node *element,*next; 00364 for (element=first; element != &end_of_list; element=next) 00365 { 00366 next=element->next; 00367 delete (T*) element->info; 00368 } 00369 empty(); 00370 }
Here is the caller graph for this function:
| T* List< T >::head | ( | ) | [inline] |
Reimplemented from base_list.
Definition at line 355 of file sql_list.h.
Referenced by Item_equal::compare_collation(), sp_head::do_cont_backpatch(), eliminate_item_equal(), Item_equal::get_first(), imerge_list_or_list(), make_cond_for_info_schema(), make_cond_for_table(), mysqld_help(), read_sep_field(), JOIN::rollup_make_fields(), and substitute_for_best_equal_field().
00355 {return (T*) base_list::head(); }
Here is the caller graph for this function:
| T** List< T >::head_ref | ( | ) | [inline] |
Reimplemented from base_list.
Definition at line 356 of file sql_list.h.
Referenced by setup_new_fields().
00356 {return (T**) base_list::head_ref(); }
Here is the caller graph for this function:
| T* List< T >::pop | ( | void | ) | [inline] |
Reimplemented from base_list.
Definition at line 357 of file sql_list.h.
Referenced by build_equal_items_for_cond(), sp_head::destroy(), sp_head::do_cont_backpatch(), and sp_head::restore_lex().
00357 {return (T*) base_list::pop(); }
Here is the caller graph for this function:
Definition at line 360 of file sql_list.h.
Referenced by Item_cond::add_at_head().
00360 { base_list::prepand(list); }
Here is the caller graph for this function:
Definition at line 351 of file sql_list.h.
Referenced by Item_cond::add(), Item_equal::add(), build_equal_items(), analyse::change_columns(), change_refs_to_tmp_fields(), change_to_use_tmp_fields(), check_equality(), Item_cond::copy_andor_arguments(), create_table_from_items(), Table_triggers_list::create_trigger(), db_show_routine_status(), Event_scheduler::dump_internal_status(), eliminate_item_equal(), exts_handlerton(), st_table::fill_item_list(), get_all_items_for_category(), get_file_options_ulllist(), Field_iterator_table_ref::get_or_create_column_ref(), get_var_with_binlog(), ha_known_exts(), ha_show_status(), imerge_list_or_list(), QUICK_GROUP_MIN_MAX_SELECT::init(), create_field::init(), Item_func_match::init_search(), Log_event::init_show_field_list(), Item_cond::Item_cond(), Item_equal::Item_equal(), make_cond_for_info_schema(), make_cond_for_table(), memorize_variant_topic(), mysql_admin_table(), mysql_alter_table(), mysql_checksum_table(), mysql_copy_create_list(), mysql_copy_key_list(), mysql_load(), mysql_rm_known_files(), mysql_show_grants(), mysql_xa_recover(), mysqld_list_fields(), mysqld_list_processes(), mysqld_show_authors(), mysqld_show_column_types(), mysqld_show_contributors(), mysqld_show_create(), mysqld_show_create_db(), mysqld_show_privileges(), mysqld_show_storage_engines(), mysqld_show_warnings(), sp_instr_set_case_expr::opt_move(), sp_instr_jump_if_not::opt_move(), sp_instr_jump::opt_move(), sp_pcontext::push_context(), QUICK_ROR_UNION_SELECT::push_quick_back(), QUICK_ROR_INTERSECT_SELECT::push_quick_back(), QUICK_INDEX_MERGE_SELECT::push_quick_back(), sp_pcontext::retrieve_field_definitions(), JOIN::rollup_init(), search_categories(), select_describe(), send_answer_1(), send_header_2(), Load_log_event::set_fields(), Item_sum_distinct::setup(), setup_copy_fields(), Events::show_create_event(), sp_head::show_create_function(), sp_head::show_create_procedure(), sp_head::show_routine_code(), sp_grant_privileges(), store_natural_using_join_columns(), and tree_or().
00351 { return base_list::push_back(a); }
Here is the caller graph for this function:
Definition at line 354 of file sql_list.h.
Referenced by sp_head::add_cont_backpatch(), alloc_group_fields(), find_order_in_list(), mysql_alter_table(), sp_head::new_cont_backpatch(), QUICK_SELECT_DESC::QUICK_SELECT_DESC(), sp_head::reset_lex(), setup_new_fields(), and Item::split_sum_func2().
00354 { return base_list::push_front(a); }
Here is the caller graph for this function:
The documentation for this class was generated from the following file:
- mysql/src/5.1-dbg/sql/sql_list.h
Generated on Sat Sep 9 22:02:13 2006 for MySQL 5.1 by
1.4.7