Struct MinCount

pub struct MinCount<T, U>(/* private fields */);

最小値とその個数の総和

Implementations

impl<T, U> MinCount<T, U>

pub fn new() -> Self

MinCount<T, U>を返す。

Trait Implementations

impl<T, U, A> Act<MinCount<T, U>> for AddMinCount<A>

where A: Monoid<Element = T> + Additive, MinCount<T, U>: Monoid<Element = (Option<T>, U)>,

type Monoid = A

作用させるモノイド

type Element = <A as Set>::Element

モノイドの元

fn monoid(&self) -> &Self::Monoid

作用させるモノイドへの参照を返す。

fn act( &self, _m: &MinCount<T, U>, val: (Option<T>, U), a: T, _len: usize, ) -> (Option<T>, U)

$val$をn個の値からなる列をモノイド$(\circ, e)$で畳み込んだ値であるとしたとき、 列の各値に$a$を作用させて畳み込んだ値を求める。

fn act_one(&self, m: &M, val: M::Element, a: Self::Element) -> M::Element

self.act(m, val, a, 1)

fn op(&self, a: Self::Element, b: Self::Element) -> Self::Element

二項演算

fn id(&self) -> Self::Element

単位元

impl<T: Ord, U: Add<Output = U>> BinaryOp for MinCount<T, U>

fn op(&self, a: Self::Element, b: Self::Element) -> Self::Element

二項演算

fn op_assign_r(&self, a: &mut Self::Element, b: Self::Element)

where Self::Element: Clone,

二項演算$\circ$で(右側から)代入操作($a \leftarrow a \circ b$)をする。

fn op_assign_l(&self, a: &mut Self::Element, b: Self::Element)

where Self::Element: Clone,

二項演算$\circ$で(左側から)代入操作($a \leftarrow b \circ a$)をする。

impl<T: Clone, U: Clone> Clone for MinCount<T, U>

fn clone(&self) -> MinCount<T, U>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug, U: Debug> Debug for MinCount<T, U>

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

Formats the value using the given formatter.

impl<T: Default, U: Default> Default for MinCount<T, U>

fn default() -> MinCount<T, U>

Returns the “default value” for a type.

impl<T: Hash, U: Hash> Hash for MinCount<T, U>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T, U: Zero + PartialEq> Identity for MinCount<T, U>

fn id(&self) -> Self::Element

単位元

fn is_id(&self, a: &Self::Element) -> bool

where Self::Element: PartialEq,

単位元の判定

impl<T: PartialEq, U: PartialEq> PartialEq for MinCount<T, U>

fn eq(&self, other: &MinCount<T, U>) -> 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<T, U> Set for MinCount<T, U>

type Element = (Option<T>, U)

集合の元

impl<T, U> Associative for MinCount<T, U>

impl<T, U> Commutative for MinCount<T, U>

impl<T: Copy, U: Copy> Copy for MinCount<T, U>

impl<T: Eq, U: Eq> Eq for MinCount<T, U>

impl<T, U> StructuralPartialEq for MinCount<T, U>