pub enum RankExpr {
Absolute(Box<RankExpr>),
Division {
left: Box<RankExpr>,
right: Box<RankExpr>,
},
Exponentiation(Box<RankExpr>),
Knn {
query: QueryVector,
key: Key,
limit: u32,
default: Option<f32>,
return_rank: bool,
},
Logarithm(Box<RankExpr>),
Maximum(Vec<RankExpr>),
Minimum(Vec<RankExpr>),
Multiplication(Vec<RankExpr>),
Subtraction {
left: Box<RankExpr>,
right: Box<RankExpr>,
},
Summation(Vec<RankExpr>),
Value(f32),
}Variants§
Absolute(Box<RankExpr>)
Division
Exponentiation(Box<RankExpr>)
Knn
Logarithm(Box<RankExpr>)
Maximum(Vec<RankExpr>)
Minimum(Vec<RankExpr>)
Multiplication(Vec<RankExpr>)
Subtraction
Summation(Vec<RankExpr>)
Value(f32)
Implementations§
Source§impl RankExpr
impl RankExpr
pub fn default_knn_key() -> Key
pub fn default_knn_limit() -> u32
pub fn knn_queries(&self) -> Vec<KnnQuery>
Trait Implementations§
Source§impl<'de> Deserialize<'de> for RankExpr
impl<'de> Deserialize<'de> for RankExpr
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for RankExpr
impl RefUnwindSafe for RankExpr
impl Send for RankExpr
impl Sync for RankExpr
impl Unpin for RankExpr
impl UnwindSafe for RankExpr
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<T> IntoRequest<T> for T
impl<T> IntoRequest<T> for T
Source§fn into_request(self) -> Request<T>
fn into_request(self) -> Request<T>
Wrap the input message
T in a tonic::RequestSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.