Skip to main content

LogicalPlanner

Struct LogicalPlanner 

Source
pub struct LogicalPlanner<'a> {
    pub context: PlannerContext<'a>,
}

Fields§

§context: PlannerContext<'a>

Implementations§

Source§

impl LogicalPlanner<'_>

Source

pub fn bind_expr(&self, sql: &Expr) -> QuillSQLResult<Expr>

Source

pub fn bind_value(&self, value: &Value) -> QuillSQLResult<Expr>

Source

pub fn bind_function(&self, function: &Function) -> QuillSQLResult<Expr>

Source

pub fn bind_function_arg(&self, arg: &FunctionArg) -> QuillSQLResult<Expr>

Source§

impl<'a> LogicalPlanner<'a>

Source

pub fn plan_create_index( &self, index_name: &ObjectName, table_name: &ObjectName, using: Option<&Ident>, columns: &[OrderByExpr], ) -> QuillSQLResult<LogicalPlan>

Source§

impl<'a> LogicalPlanner<'a>

Source

pub fn plan_create_table( &self, name: &ObjectName, column_defs: &Vec<ColumnDef>, if_not_exists: bool, engine: Option<&str>, ) -> QuillSQLResult<LogicalPlan>

Source§

impl<'a> LogicalPlanner<'a>

Source

pub fn plan_delete( &self, table: &TableWithJoins, selection: &Option<Expr>, ) -> QuillSQLResult<LogicalPlan>

Source§

impl<'a> LogicalPlanner<'a>

Source

pub fn plan_drop_table( &self, names: &[ObjectName], if_exists: bool, cascade: bool, purge: bool, ) -> QuillSQLResult<LogicalPlan>

Source

pub fn plan_drop_index( &self, names: &[ObjectName], if_exists: bool, cascade: bool, purge: bool, ) -> QuillSQLResult<LogicalPlan>

Source§

impl LogicalPlanner<'_>

Source

pub fn plan_explain( &mut self, statement: &Statement, ) -> QuillSQLResult<LogicalPlan>

Build a plan that returns the formatted logical plan as rows of text.

Source§

impl<'a> LogicalPlanner<'a>

Source

pub fn plan_insert( &self, table_name: &ObjectName, columns_ident: &[Ident], source: &Query, ) -> QuillSQLResult<LogicalPlan>

Source§

impl<'a> LogicalPlanner<'a>

Source

pub fn plan_query(&self, query: &Query) -> QuillSQLResult<LogicalPlan>

Source

pub fn plan_order_by( &self, input: LogicalPlan, order_by: &Vec<OrderByExpr>, ) -> QuillSQLResult<LogicalPlan>

Source

pub fn plan_limit( &self, input: LogicalPlan, limit: &Option<Expr>, offset: &Option<Offset>, ) -> QuillSQLResult<LogicalPlan>

Source§

impl LogicalPlanner<'_>

Source§

impl<'a> LogicalPlanner<'a>

Source

pub fn plan_update( &self, table: &TableWithJoins, assignments: &[Assignment], selection: &Option<Expr>, ) -> QuillSQLResult<LogicalPlan>

Source§

impl<'a> LogicalPlanner<'a>

Auto Trait Implementations§

§

impl<'a> Freeze for LogicalPlanner<'a>

§

impl<'a> !RefUnwindSafe for LogicalPlanner<'a>

§

impl<'a> Send for LogicalPlanner<'a>

§

impl<'a> Sync for LogicalPlanner<'a>

§

impl<'a> Unpin for LogicalPlanner<'a>

§

impl<'a> UnsafeUnpin for LogicalPlanner<'a>

§

impl<'a> !UnwindSafe for LogicalPlanner<'a>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.