pub type ResultRow = BTreeMap<String, Value>;Aliased Type§
pub struct ResultRow { /* private fields */ }Trait Implementations§
Source§impl RowLookup for ResultRow
impl RowLookup for ResultRow
fn column(&self, name: &str) -> Option<&Value>
fn qualified_column(&self, _qualifier: &str, _column: &str) -> Option<&Value>
Source§fn visit_columns(&self, visitor: &mut dyn FnMut(&str, &Value))
fn visit_columns(&self, visitor: &mut dyn FnMut(&str, &Value))
Visit every logical column in schema order. Named rows use their map
order; positional execution rows override this without materializing a
map. The default keeps narrow projected lookup implementations source
compatible when they deliberately do not expose whole-row semantics.
Source§fn column_is_ambiguous(&self, _name: &str) -> bool
fn column_is_ambiguous(&self, _name: &str) -> bool
Whether an unqualified name identifies more than one visible input
column. Callers must report SQLSTATE 42702 instead of selecting an
arbitrary suffix match.
Source§fn qualified_column_is_ambiguous(&self, _qualifier: &str, _column: &str) -> bool
fn qualified_column_is_ambiguous(&self, _qualifier: &str, _column: &str) -> bool
Whether a qualified identity names more than one visible input column.
Source§fn positional_column(&self, _index: usize) -> Option<&Value>
fn positional_column(&self, _index: usize) -> Option<&Value>
Return a value by the physical schema position used to construct this
row view. Materialized named rows do not expose positional access;
projected execution sources override it so compiled hot paths can avoid
repeating string lookup for every expression and row.