Skip to main content

InputCharacteristics

competitive::math::min_plus_convolution::selector

Struct InputCharacteristics 

Source 
struct InputCharacteristics<T> {
    finite_count: usize,
    finite_prefix_len: usize,
    finite_entries: Vec<(usize, T)>,
    run_entries: Option<Vec<(usize, T)>>,
    extrema: Option<(T, T)>,
    is_convex: bool,
    is_concave: bool,
    is_nondecreasing: bool,
    is_nonincreasing: bool,
    run_count: usize,
    piece_count: usize,
}

Fields§

§finite_count: usize§finite_prefix_len: usize§finite_entries: Vec<(usize, T)>§run_entries: Option<Vec<(usize, T)>>§extrema: Option<(T, T)>§is_convex: bool§is_concave: bool§is_nondecreasing: bool§is_nonincreasing: bool§run_count: usize§piece_count: usize

Auto Trait Implementations§

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

Source§

fn into(self) -> U

Calls U::from(self).

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

Source§

impl<T> ToArrayVecScalar for T

Source§

fn to_array_vec_scalar(self) -> ArrayVecScalar<T>

Source§

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

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.