Struct SpanNearQuery

pub struct SpanNearQuery { /* private fields */ }

Matches spans which are near one another. One can specify slop, the maximum number of intervening unmatched positions, as well as whether matches are required to be in-order. The span near query maps to Lucene SpanNearQuery.
The clauses element is a list of one or more other span type queries and the slop controls the maximum number of intervening unmatched positions permitted.

https://www.elastic.co/guide/en/elasticsearch/reference/current/query-dsl-span-near-query.html

Implementations

impl SpanNearQuery

pub fn serialize<__S>( __self: &SpanNearQuery, __serializer: __S, ) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

impl SpanNearQuery

pub fn in_order(self, in_order: bool) -> Self

Controls whether span matches are required to be in-order.

pub fn slop(self, slop: i32) -> Self

The slop parameter allows you to specify the number of positions by which the terms in the query can be transposed to match a document. A slop value of 0 (default) means that the terms must appear in the exact order specified in the query.

Trait Implementations

impl Clone for SpanNearQuery

fn clone(&self) -> SpanNearQuery

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for SpanNearQuery

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

Formats the value using the given formatter.

impl From<SpanNearQuery> for Option<Query>

fn from(q: SpanNearQuery) -> Self

Converts to this type from the input type.

impl From<SpanNearQuery> for Option<SpanQuery>

fn from(q: SpanNearQuery) -> Self

Converts to this type from the input type.

impl From<SpanNearQuery> for Query

fn from(q: SpanNearQuery) -> Self

Converts to this type from the input type.

impl From<SpanNearQuery> for SpanQuery

fn from(q: SpanNearQuery) -> Self

Converts to this type from the input type.

impl IntoIterator for SpanNearQuery

type Item = SpanNearQuery

The type of the elements being iterated over.

type IntoIter = IntoIter<<SpanNearQuery as IntoIterator>::Item>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq<Query> for SpanNearQuery

fn eq(&self, other: &Query) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq<SpanNearQuery> for Query

fn eq(&self, other: &SpanNearQuery) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq<SpanNearQuery> for SpanQuery

fn eq(&self, other: &SpanNearQuery) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq<SpanQuery> for SpanNearQuery

fn eq(&self, other: &SpanQuery) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialEq for SpanNearQuery

fn eq(&self, other: &SpanNearQuery) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for SpanNearQuery

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for SpanNearQuery