Skip to main content

AggregateBuilder

ratio_metadata::aggregate

Struct AggregateBuilder

pub struct AggregateBuilder<N, K, L, W, WV, A, S: State = Empty>where
    N: Field,
    K: Field,
    L: Field,
    W: Field,
    WV: WeightValue,
    A: Field,
{ /* private fields */ }

Expand description

Use builder syntax to set the inputs and finish with build().

Implementations§

impl<N, K, L, W, WV, A, S: State> AggregateBuilder<N, K, L, W, WV, A, S>
where N: Field, K: Field, L: Field, W: Field, WV: WeightValue, A: Field,

pub fn build(self) -> Aggregate<N, K, L, W, WV, A>
where S: IsComplete,

Finish building and return the requested object

pub fn items( self, value: usize, ) -> AggregateBuilder<N, K, L, W, WV, A, SetItems<S>>
where S::Items: IsUnset,

Optional (Some / Option setters). Default: 0.

Over how many items the aggregate has been taken.

pub fn maybe_items( self, value: Option<usize>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetItems<S>>
where S::Items: IsUnset,

Optional (Some / Option setters). Default: 0.

Over how many items the aggregate has been taken.

pub fn names( self, value: BTreeMap<N, usize>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetNames<S>>
where S::Names: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Name occurrence.

pub fn maybe_names( self, value: Option<BTreeMap<N, usize>>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetNames<S>>
where S::Names: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Name occurrence.

pub fn kinds( self, value: BTreeMap<K, usize>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetKinds<S>>
where S::Kinds: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Kind occurrence.

pub fn maybe_kinds( self, value: Option<BTreeMap<K, usize>>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetKinds<S>>
where S::Kinds: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Kind occurrence.

pub fn labels( self, value: BTreeMap<L, usize>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetLabels<S>>
where S::Labels: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Label occurrence.

pub fn maybe_labels( self, value: Option<BTreeMap<L, usize>>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetLabels<S>>
where S::Labels: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Label occurrence.

pub fn weights( self, value: BTreeMap<W, WV>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetWeights<S>>
where S::Weights: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Weight sum value.

pub fn maybe_weights( self, value: Option<BTreeMap<W, WV>>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetWeights<S>>
where S::Weights: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Weight sum value.

pub fn annotations( self, value: BTreeMap<A, usize>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetAnnotations<S>>
where S::Annotations: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Annotation key occurrence.

pub fn maybe_annotations( self, value: Option<BTreeMap<A, usize>>, ) -> AggregateBuilder<N, K, L, W, WV, A, SetAnnotations<S>>
where S::Annotations: IsUnset,

Optional (Some / Option setters). Default: BTreeMap::new().

Annotation key occurrence.

Auto Trait Implementations§

impl<N, K, L, W, WV, A, S> Freeze for AggregateBuilder<N, K, L, W, WV, A, S>

impl<N, K, L, W, WV, A, S> RefUnwindSafe for AggregateBuilder<N, K, L, W, WV, A, S>
where N: RefUnwindSafe, K: RefUnwindSafe, L: RefUnwindSafe, W: RefUnwindSafe, WV: RefUnwindSafe, A: RefUnwindSafe,

impl<N, K, L, W, WV, A, S> Send for AggregateBuilder<N, K, L, W, WV, A, S>
where N: Send, K: Send, L: Send, W: Send, WV: Send, A: Send,

impl<N, K, L, W, WV, A, S> Sync for AggregateBuilder<N, K, L, W, WV, A, S>
where N: Sync, K: Sync, L: Sync, W: Sync, WV: Sync, A: Sync,

impl<N, K, L, W, WV, A, S> Unpin for AggregateBuilder<N, K, L, W, WV, A, S>

impl<N, K, L, W, WV, A, S> UnsafeUnpin for AggregateBuilder<N, K, L, W, WV, A, S>

impl<N, K, L, W, WV, A, S> UnwindSafe for AggregateBuilder<N, K, L, W, WV, A, S>
where N: RefUnwindSafe, K: RefUnwindSafe, L: RefUnwindSafe, W: RefUnwindSafe, WV: RefUnwindSafe, A: RefUnwindSafe,

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

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

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

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

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.

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

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.