Structure used by AHI to contain information on record prefixes to be considered in hash index subsystem. More...

#include <buf0buf.h>

Public Member Functions
bool	equals_without_left_side (const btr_search_prefix_info_t &other) const

bool	operator== (const btr_search_prefix_info_t &other) const

bool	operator!= (const btr_search_prefix_info_t &other) const

Public Attributes
uint32_t	n_bytes
	recommended prefix: number of bytes in an incomplete field More...

uint16_t	n_fields
	recommended prefix length for hash search: number of full fields More...

bool	left_side
	true or false, depending on whether the leftmost record of several records with the same prefix should be indexed in the hash index More...

Detailed Description

Structure used by AHI to contain information on record prefixes to be considered in hash index subsystem.

It is meant for using as a single 64bit atomic value, thus it needs to be aligned properly.

Member Function Documentation

bool btr_search_prefix_info_t::equals_without_left_side ( const btr_search_prefix_info_t & other ) const

inline

bool btr_search_prefix_info_t::operator!= ( const btr_search_prefix_info_t & other ) const

inline

bool btr_search_prefix_info_t::operator== ( const btr_search_prefix_info_t & other ) const

inline

bool btr_search_prefix_info_t::left_side

true or false, depending on whether the leftmost record of several records with the same prefix should be indexed in the hash index

uint32_t btr_search_prefix_info_t::n_bytes

recommended prefix: number of bytes in an incomplete field

uint16_t btr_search_prefix_info_t::n_fields

recommended prefix length for hash search: number of full fields

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