Struct CrackingHintStore 

pub struct CrackingHintStore { /* private fields */ }

Minimal adaptive hint cache keyed by table name.

The planner records the last chosen index for each table and can reuse it as a soft preference on subsequent planning passes.

Implementations

impl CrackingHintStore

pub fn preferred_index(&self, table_name: &str) -> Option<&str>

pub fn record_access_path(&mut self, access_path: &AccessPath)

Trait Implementations

impl Clone for CrackingHintStore

fn clone(&self) -> CrackingHintStore

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for CrackingHintStore

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for CrackingHintStore

fn default() -> CrackingHintStore

Returns the “default value” for a type.

impl Eq for CrackingHintStore

impl PartialEq for CrackingHintStore

fn eq(&self, other: &CrackingHintStore) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for CrackingHintStore