The world's most popular open source database

MySQL 5.1: Bitmap< 64 > Class Template Reference

Bitmap< 64 > Class Template Reference

#include <sql_bitmap.h>


Public Member Functions
	Bitmap ()
	Bitmap (uint prefix_to_set)
void	init ()
void	init (uint prefix_to_set)
uint	length () const
void	set_bit (uint n)
void	clear_bit (uint n)
void	set_prefix (uint n)
void	set_all ()
void	clear_all ()
void	intersect (Bitmap< 64 > &map2)
void	intersect (ulonglong map2)
void	intersect_extended (ulonglong map2)
void	subtract (Bitmap< 64 > &map2)
void	merge (Bitmap< 64 > &map2)
my_bool	is_set (uint n) const
my_bool	is_prefix (uint n) const
my_bool	is_clear_all () const
my_bool	is_set_all () const
my_bool	is_subset (const Bitmap< 64 > &map2) const
my_bool	is_overlapping (const Bitmap< 64 > &map2) const
my_bool	operator== (const Bitmap< 64 > &map2) const
char *	print (char *buf) const
ulonglong	to_ulonglong () const
Private Attributes
ulonglong	map

Detailed Description

template<>
class Bitmap< 64 >

Definition at line 97 of file sql_bitmap.h.

Constructor & Destructor Documentation

Bitmap< 64 >::Bitmap ( ) [inline]

Bitmap< 64 >::Bitmap ( uint prefix_to_set ) [inline, explicit]

Member Function Documentation

void Bitmap< 64 >::clear_all ( ) [inline]

Definition at line 125 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by get_best_group_min_max(), get_key_scans_params(), make_join_statistics(), mysql_delete(), partition_info::partition_info(), prepare_simple_select(), SEL_TREE::SEL_TREE(), ha_heap::set_keys_for_scanning(), SQL_SELECT::SQL_SELECT(), test_if_skip_sort_order(), SQL_SELECT::test_quick_select(), tree_and(), and tree_or().

00125 { map=(ulonglong)0; }

Here is the caller graph for this function:

void Bitmap< 64 >::clear_bit ( uint n ) [inline]

Definition at line 116 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by remove_nonrange_trees().

00116 { map&= ~(((ulonglong)1) << n); }

Here is the caller graph for this function:

void Bitmap< 64 >::init ( uint prefix_to_set ) [inline]

Definition at line 113 of file sql_bitmap.h.

References Bitmap< default_width >::set_prefix().

00113 { set_prefix(prefix_to_set); }

Here is the call graph for this function:

void Bitmap< 64 >::init ( ) [inline]

Definition at line 112 of file sql_bitmap.h.

Referenced by make_join_statistics(), make_simple_join(), and open_binary_frm().

00112 { }

Here is the caller graph for this function:

void Bitmap< 64 >::intersect ( ulonglong map2 ) [inline]

Definition at line 127 of file sql_bitmap.h.

References Bitmap< default_width >::map.

00127 { map&= map2; }

void Bitmap< 64 >::intersect ( Bitmap< 64 > & map2 ) [inline]

Definition at line 126 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by add_group_and_distinct_keys(), add_key_field(), Item_field::fix_fields(), ha_myisam::info(), insert_fields(), mark_common_columns(), sel_trees_can_be_ored(), test_if_skip_sort_order(), SQL_SELECT::test_quick_select(), and update_field_dependencies().

00126 { map&= map2.map; }

Here is the caller graph for this function:

void Bitmap< 64 >::intersect_extended ( ulonglong map2 ) [inline]

Definition at line 128 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by ha_myisam::info().

00128 { map&= map2; }

Here is the caller graph for this function:

my_bool Bitmap< 64 >::is_clear_all ( ) const [inline]

Definition at line 133 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by add_group_and_distinct_keys(), best_access_path(), find_shortest_key(), get_best_combination(), make_join_readinfo(), mysql_delete(), ha_myisam::preload_keys(), sel_trees_can_be_ored(), select_describe(), test_if_skip_sort_order(), SQL_SELECT::test_quick_select(), and tree_and().

00133 { return map == (ulonglong)0; }

Here is the caller graph for this function:

my_bool Bitmap< 64 >::is_overlapping ( const Bitmap< 64 > & map2 ) const [inline]

Definition at line 136 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by st_table::mark_columns_needed_for_update().

00136 { return (map & map2.map)!= 0; }

Here is the caller graph for this function:

my_bool Bitmap< 64 >::is_prefix ( uint n ) const [inline]

Definition at line 132 of file sql_bitmap.h.

References Bitmap< default_width >::map.

00132 { return map == (((ulonglong)1) << n)-1; }

my_bool Bitmap< 64 >::is_set ( uint n ) const [inline]

Definition at line 131 of file sql_bitmap.h.

References Bitmap< default_width >::map, and test.

Referenced by add_key_part(), best_access_path(), find_key_for_maxmin(), find_shortest_key(), Item_func_match::fix_index(), get_best_group_min_max(), get_best_ror_intersect(), get_index_for_order(), get_key_scans_params(), get_schema_stat_record(), join_read_const_table(), join_read_first(), join_read_last(), make_join_readinfo(), print_sel_tree(), sel_trees_can_be_ored(), select_describe(), test_if_skip_sort_order(), test_if_subkey(), and SQL_SELECT::test_quick_select().

00131 { return test(map & (((ulonglong)1) << n)); }

Here is the caller graph for this function:

my_bool Bitmap< 64 >::is_set_all ( ) const [inline]

Definition at line 134 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by ha_myisam::preload_keys().

00134 { return map == ~(ulonglong)0; }

Here is the caller graph for this function:

my_bool Bitmap< 64 >::is_subset ( const Bitmap< 64 > & map2 ) const [inline]

Definition at line 135 of file sql_bitmap.h.

References Bitmap< default_width >::map.

00135 { return !(map & ~map2.map); }

uint Bitmap< 64 >::length ( ) const [inline]

Definition at line 114 of file sql_bitmap.h.

00114 { return 64; }

void Bitmap< 64 >::merge ( Bitmap< 64 > & map2 ) [inline]

Definition at line 130 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by add_group_and_distinct_keys(), add_key_field(), insert_fields(), mark_common_columns(), and update_field_dependencies().

00130 { map|= map2.map; }

Here is the caller graph for this function:

my_bool Bitmap< 64 >::operator== ( const Bitmap< 64 > & map2 ) const [inline]

Definition at line 137 of file sql_bitmap.h.

References Bitmap< default_width >::map.

00137 { return map == map2.map; }

char* Bitmap< 64 >::print ( char * buf ) const [inline]

Definition at line 138 of file sql_bitmap.h.

References longlong2str, and Bitmap< default_width >::map.

Referenced by print_quick(), and select_describe().

00138 { longlong2str(map,buf,16); return buf; }

Here is the caller graph for this function:

void Bitmap< 64 >::set_all ( ) [inline]

Definition at line 124 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by SQL_SELECT::check_quick(), make_simple_join(), and mysql_init_variables().

00124 { map=~(ulonglong)0; }

Here is the caller graph for this function:

void Bitmap< 64 >::set_bit ( uint n ) [inline]

Definition at line 115 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by check_quick_select(), get_best_group_min_max(), get_key_scans_params(), get_mm_parts(), ha_heap::set_keys_for_scanning(), test_if_skip_sort_order(), tree_and(), and tree_or().

00115 { map|= ((ulonglong)1) << n; }

Here is the caller graph for this function:

void Bitmap< 64 >::set_prefix ( uint n ) [inline]

Definition at line 117 of file sql_bitmap.h.

References Bitmap< default_width >::length(), Bitmap< default_width >::map, and Bitmap< default_width >::set_all().

Referenced by ha_myisammrg::info(), and ha_myisam::info().

00118   {
00119     if (n >= length())
00120       set_all();
00121     else
00122       map= (((ulonglong)1) << n)-1;
00123   }

Here is the call graph for this function:

Here is the caller graph for this function:

void Bitmap< 64 >::subtract ( Bitmap< 64 > & map2 ) [inline]

Definition at line 129 of file sql_bitmap.h.

References Bitmap< default_width >::map.

00129 { map&= ~map2.map; }

ulonglong Bitmap< 64 >::to_ulonglong ( ) const [inline]

Definition at line 139 of file sql_bitmap.h.

References Bitmap< default_width >::map.

Referenced by ha_myisam::assign_to_keycache(), get_best_group_min_max(), ha_myisam::preload_keys(), and SQL_SELECT::test_quick_select().

00139 { return map; }

Here is the caller graph for this function:

Member Data Documentation

ulonglong Bitmap< 64 >::map [private]

Definition at line 99 of file sql_bitmap.h.

The documentation for this class was generated from the following file:

mysql/src/5.1-dbg/sql/sql_bitmap.h

Generated on Sat Sep 9 20:01:10 2006 for MySQL 5.1 by

1.4.7

The world's most popular open source database

Bitmap< 64 > Class Template Reference

Public Member Functions

Private Attributes

Detailed Description

template<> class Bitmap< 64 >

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation

template<>
class Bitmap< 64 >