Struct datafusion::datasource::memory::MemTable

source ·
pub struct MemTable {
    pub sort_order: Arc<Mutex<Vec<Vec<Expr>>>>,
    /* private fields */
}
Expand description

In-memory data source for presenting a Vec<RecordBatch> as a data source that can be queried by DataFusion. This allows data to be pre-loaded into memory and then repeatedly queried without incurring additional file I/O overhead.

Fields§

§sort_order: Arc<Mutex<Vec<Vec<Expr>>>>

Optional pre-known sort order(s). Must be SortExprs. inserting data into this table removes the order

Implementations§

source§

impl MemTable

source

pub fn try_new( schema: SchemaRef, partitions: Vec<Vec<RecordBatch>> ) -> Result<Self>

Create a new in-memory table from the provided schema and record batches

source

pub fn with_constraints(self, constraints: Constraints) -> Self

Assign constraints

source

pub fn with_column_defaults( self, column_defaults: HashMap<String, Expr> ) -> Self

Assign column defaults

source

pub fn with_sort_order(self, sort_order: Vec<Vec<Expr>>) -> Self

Specify an optional pre-known sort order(s). Must be SortExprs.

If the data is not sorted by this order, DataFusion may produce incorrect results.

DataFusion may take advantage of this ordering to omit sorts or use more efficient algorithms.

Note that multiple sort orders are supported, if some are known to be equivalent,

source

pub async fn load( t: Arc<dyn TableProvider>, output_partitions: Option<usize>, state: &SessionState ) -> Result<Self>

Create a mem table by reading from another data source

Trait Implementations§

source§

impl Debug for MemTable

source§

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

Formats the value using the given formatter. Read more
source§

impl TableProvider for MemTable

source§

fn insert_into<'life0, 'life1, 'async_trait>( &'life0 self, _state: &'life1 SessionState, input: Arc<dyn ExecutionPlan>, overwrite: bool ) -> Pin<Box<dyn Future<Output = Result<Arc<dyn ExecutionPlan>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Returns an ExecutionPlan that inserts the execution results of a given ExecutionPlan into this MemTable.

The ExecutionPlan must have the same schema as this MemTable.

§Arguments
§Returns
  • A plan that returns the number of rows written.
source§

fn as_any(&self) -> &dyn Any

Returns the table provider as Any so that it can be downcast to a specific implementation.
source§

fn schema(&self) -> SchemaRef

Get a reference to the schema for this table
source§

fn constraints(&self) -> Option<&Constraints>

Get a reference to the constraints of the table. Returns: Read more
source§

fn table_type(&self) -> TableType

Get the type of this table for metadata/catalog purposes.
source§

fn scan<'life0, 'life1, 'life2, 'life3, 'async_trait>( &'life0 self, state: &'life1 SessionState, projection: Option<&'life2 Vec<usize>>, _filters: &'life3 [Expr], _limit: Option<usize> ) -> Pin<Box<dyn Future<Output = Result<Arc<dyn ExecutionPlan>>> + Send + 'async_trait>>
where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait, 'life2: 'async_trait, 'life3: 'async_trait,

Create an ExecutionPlan for scanning the table with optionally specified projection, filter and limit, described below. Read more
source§

fn get_column_default(&self, column: &str) -> Option<&Expr>

Get the default value for a column, if available.
source§

fn get_table_definition(&self) -> Option<&str>

Get the create statement used to create this table, if available.
source§

fn get_logical_plan(&self) -> Option<&LogicalPlan>

Get the LogicalPlan of this table, if available
source§

fn supports_filter_pushdown( &self, _filter: &Expr ) -> Result<TableProviderFilterPushDown>

👎Deprecated since 20.0.0: use supports_filters_pushdown instead
Tests whether the table provider can make use of a filter expression to optimise data retrieval.
source§

fn supports_filters_pushdown( &self, filters: &[&Expr] ) -> Result<Vec<TableProviderFilterPushDown>>

Tests whether the table provider can make use of any or all filter expressions to optimise data retrieval. Note: the returned vector much have the same size as the filters argument.
source§

fn statistics(&self) -> Option<Statistics>

Get statistics for this table, if available

Auto Trait Implementations§

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> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
source§

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

§

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>,

§

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.
source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

source§

fn vzip(self) -> V