fn candidate_chunks(&self, predicate: &Predicate) -> Vec<Arc<DbChunk>> {
        let partition_key = predicate.partition_key.as_deref();
        let table_names: TableNameFilter<'_> = predicate.table_names.as_ref().into();

        // Apply initial partition key / table name pruning
        let chunks = self
            .catalog
            .filtered_chunks(table_names, partition_key, DbChunk::snapshot);

        self.prune_chunks(chunks, predicate)
    }
/// Returns all chunks that may have data that passes the
/// specified predicates. The chunks are pruned as aggressively as
/// possible based on metadata.
Returns all chunks that may have data that passes the
specified predicates. The chunks are pruned as aggressively as
possible based on metadata.
Returns all chunks that may have data that passes the specified predicates . The chunks are pruned as aggressively as possible based on metadata .
fn candidate_chunks(&self, predicate: &Predicate) -> Vec<Arc<DbChunk>> {
        let partition_key = predicate.partition_key.as_deref();
        let table_names: TableNameFilter<'_> = predicate.table_names.as_ref().into();
        // Apply initial partition key / table name pruning
        let chunks = self
            .catalog
            .filtered_chunks(table_names, partition_key, DbChunk::snapshot);
        self.prune_chunks(chunks, predicate)
    }
fn candidate_chunks ( & self , predicate : & Predicate ) -> Vec < Arc < DbChunk > > { let partition_key = predicate . partition_key . as_deref ( ) ; let table_names : TableNameFilter < ' _ > = predicate . table_names . as_ref ( ) . into ( ) ; // Apply initial partition key / table name pruning let chunks = self . catalog . filtered_chunks ( table_names , partition_key , DbChunk :: snapshot ) ; self . prune_chunks ( chunks , predicate ) }
Returns all chunks that may have data that passes the
specified predicates.
Returns all chunks that may have data that passes the specified predicates .
&self
predicate
&Predicate
&self
predicate
&Predicate