Struct MinCount

pub struct MinCount<T, U>(pub Option<T>, pub U);

最小値とその個数の総和

Tuple Fields

0: Option<T>

1: U

Trait Implementations

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

fn op(self, b: Self) -> Self

二項演算

fn op_assign_r(&mut self, b: Self)

where Self: Clone,

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

fn op_assign_l(&mut self, b: Self)

where Self: 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 copy 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, U: Zero> Identity for MinCount<T, U>

fn id() -> Self

単位元

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> 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> Set for MinCount<T, U>

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