Key_rec_less Struct Reference

Maps compare function to strict weak ordering required by Priority_queue. More...

#include <partition_handler.h>

Public Types
typedef int(*	key_compare_fun) (KEY **, uchar *, uchar *)

Public Member Functions
	Key_rec_less (KEY **keys)
bool	operator() (uchar *first, uchar *second)

Public Attributes
KEY **	m_keys
key_compare_fun	m_fun
uint	m_rec_offset
bool	m_max_at_top

Detailed Description

Maps compare function to strict weak ordering required by Priority_queue.

Member Typedef Documentation

key_compare_fun

typedef int(* Key_rec_less::key_compare_fun) (KEY **, uchar *, uchar *)

Constructor & Destructor Documentation

Key_rec_less()

Key_rec_less::Key_rec_less ( KEY **  keys )

inlineexplicit

Member Function Documentation

operator()()

bool Key_rec_less::operator() ( uchar *  first, uchar *  second  )

inline

Member Data Documentation

m_fun

key_compare_fun Key_rec_less::m_fun

m_keys

KEY** Key_rec_less::m_keys

m_max_at_top

bool Key_rec_less::m_max_at_top

m_rec_offset

uint Key_rec_less::m_rec_offset

---

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

• sql/partitioning/partition_handler.h