Skip to main content

RetrievalExpr

Enum RetrievalExpr 

Source
pub enum RetrievalExpr {
Show 35 variants Empty, Term { query: String, field: Option<String>, scoring: Option<TextScoringMode>, }, Phrase { query: String, field: Option<String>, scoring: Option<TextScoringMode>, }, Filter { field: String, predicate: Predicate, source: Option<Box<Self>>, }, BayesianScore { source: Box<Self>, field: Option<String>, }, BayesianMatchWithPrior { field: String, query: String, prior_field: String, mode: ExternalPriorMode, }, Intersect(Vec<Self>), Union(Vec<Self>), Complement(Box<Self>), Composed(Vec<Self>), EncodeGraphPosting { source: Box<Self>, }, KNN { query_vector: Vec<f32>, k: usize, field: String, }, CalibratedVectorMatch { query_vector: Vec<f32>, k: usize, field: String, threshold: Option<f64>, }, CosineProbability(Box<Self>), BayesianEvidenceFusion { signals: Vec<Self>, base_rate: Option<f64>, }, RobustPositiveEvidencePool { signals: Vec<Self>, alpha: f64, gating: GatingSpec, weights: Option<Vec<f64>>, logit_min: Option<Vec<f64>>, logit_max: Option<Vec<f64>>, adaptive_weights: bool, }, AttentionFusion { signals: Vec<Self>, options: AttentionSpec, function_name: String, }, LearnedFusion { signals: Vec<Self>, alpha: f64, }, SparseThreshold { source: Box<Self>, threshold: f64, }, Traverse { start_vertex: u64, graph: String, label: Option<String>, max_hops: usize, }, GraphNeighbors { vertex: u64, graph: String, label: Option<String>, direction: Direction, }, GraphEdges { graph: String, label: Option<String>, }, RegularPathQuery { rpq_source: String, start_vertex: u64, graph: String, }, TemporalTraverse { start_vertex: u64, graph: String, label: Option<String>, max_hops: usize, temporal_filter: Option<TemporalFilterIR>, }, PageRank { graph: String, }, HITS { graph: String, }, BetweennessCentrality { graph: String, }, DeepPredict { model: String, }, MultiStage { stages: Vec<MultiStageEntry>, }, MultiFieldSearch { fields: Vec<String>, queries: Vec<String>, weights: Option<Vec<f64>>, }, TextSimilarityJoin { left: Box<Self>, right: Box<Self>, threshold: f64, }, VectorSimilarityJoin { left: Box<Self>, right: Box<Self>, threshold: f64, }, GraphJoin { left: Box<Self>, right: Box<Self>, label: Option<String>, graph: String, }, HybridJoin { left: Box<Self>, right: Box<Self>, }, CrossParadigmJoin { left: Box<Self>, right: Box<Self>, },
}
Expand description

SQL-owned retrieval algebra. Physical scorers, fusers, closures, index choices and top-k strategies do not belong to this representation.

Variants§

§

Empty

§

Term

Fields

§query: String
§

Phrase

Preserve the complete quoted input for one field-specific token-graph analysis.

Fields

§query: String
§

Filter

Fields

§field: String
§predicate: Predicate
§source: Option<Box<Self>>
§

BayesianScore

Fields

§source: Box<Self>
§

BayesianMatchWithPrior

Fields

§field: String
§query: String
§prior_field: String
§

Intersect(Vec<Self>)

§

Union(Vec<Self>)

§

Complement(Box<Self>)

§

Composed(Vec<Self>)

§

EncodeGraphPosting

Fields

§source: Box<Self>
§

KNN

Fields

§query_vector: Vec<f32>
§field: String
§

CalibratedVectorMatch

Fields

§query_vector: Vec<f32>
§field: String
§threshold: Option<f64>
§

CosineProbability(Box<Self>)

§

BayesianEvidenceFusion

Fields

§signals: Vec<Self>
§base_rate: Option<f64>
§

RobustPositiveEvidencePool

Fields

§signals: Vec<Self>
§alpha: f64
§gating: GatingSpec
§weights: Option<Vec<f64>>
§logit_min: Option<Vec<f64>>
§logit_max: Option<Vec<f64>>
§adaptive_weights: bool
§

AttentionFusion

Fields

§signals: Vec<Self>
§function_name: String
§

LearnedFusion

Fields

§signals: Vec<Self>
§alpha: f64
§

SparseThreshold

Fields

§source: Box<Self>
§threshold: f64
§

Traverse

Fields

§start_vertex: u64
§graph: String
§max_hops: usize
§

GraphNeighbors

Fields

§vertex: u64
§graph: String
§direction: Direction
§

GraphEdges

Fields

§graph: String
§

RegularPathQuery

Fields

§rpq_source: String
§start_vertex: u64
§graph: String
§

TemporalTraverse

Fields

§start_vertex: u64
§graph: String
§max_hops: usize
§temporal_filter: Option<TemporalFilterIR>
§

PageRank

Fields

§graph: String
§

HITS

Fields

§graph: String
§

BetweennessCentrality

Fields

§graph: String
§

DeepPredict

Fields

§model: String
§

MultiStage

Fields

§

MultiFieldSearch

Fields

§fields: Vec<String>
§queries: Vec<String>
§weights: Option<Vec<f64>>
§

TextSimilarityJoin

Fields

§left: Box<Self>
§right: Box<Self>
§threshold: f64
§

VectorSimilarityJoin

Fields

§left: Box<Self>
§right: Box<Self>
§threshold: f64
§

GraphJoin

Fields

§left: Box<Self>
§right: Box<Self>
§graph: String
§

HybridJoin

Fields

§left: Box<Self>
§right: Box<Self>
§

CrossParadigmJoin

Fields

§left: Box<Self>
§right: Box<Self>

Trait Implementations§

Source§

impl Clone for RetrievalExpr

Source§

fn clone(&self) -> RetrievalExpr

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for RetrievalExpr

Source§

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

Formats the value using the given formatter. Read more

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> ErasedDestructor for T
where T: 'static,

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> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

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

Source§

type Error = !

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

fn try_from(value: U) -> Result<T, !>

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.