Struct TermsOrder

pub struct TermsOrder(/* private fields */);

Terms Aggregation sorting criterion

Implementations

impl TermsOrder

pub fn new<T>(key: T, order: SortOrder) -> Self

where T: ToString,

Creates an instance of TermsOrder

• key - Key to sort by
• order - Sorting order

pub fn ascending<T>(key: T) -> Self

where T: ToString,

Sorts terms by a given key in ascending order

pub fn descending<T>(key: T) -> Self

where T: ToString,

Sorts terms by a given key in descending order

pub fn count_ascending() -> Self

Sorts terms by count ascending

pub fn count_descending() -> Self

Sorts terms by count descending

pub fn key_ascending() -> Self

Sorts terms by count ascending

pub fn key_descending() -> Self

Sorts terms by count descending

Trait Implementations

impl Clone for TermsOrder

fn clone(&self) -> TermsOrder

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for TermsOrder

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

Formats the value using the given formatter.

impl From<TermsOrder> for TermsOrderCollection

fn from(value: TermsOrder) -> Self

Converts to this type from the input type.

impl PartialEq for TermsOrder

fn eq(&self, other: &TermsOrder) -> 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 TermsOrder

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for TermsOrder

impl StructuralPartialEq for TermsOrder