pub struct HistPlot<'a, T: BarValue = usize> {
pub bins: Binning,
pub kmin: i32,
pub counts: &'a [T],
pub style: &'a dyn Fn(i32) -> Style,
pub subset: Option<&'a [T]>,
pub y_scale: Scale,
pub pointer: Option<i32>,
pub marks: Vec<(i32, &'static str, Style)>,
pub x_label: Option<&'a dyn Fn(i32) -> Option<String>>,
pub tick_every: Option<i32>,
}Fields§
§bins: Binning§kmin: i32§counts: &'a [T]§style: &'a dyn Fn(i32) -> StyleStyle of each bin’s bar, by key.
subset: Option<&'a [T]>A subset drawn in front, in the bar style; counts then draw dimmed
behind it.
y_scale: Scale§pointer: Option<i32>Bin under the accent rule and ▲.
marks: Vec<(i32, &'static str, Style)>Other symbols on the x axis, by key.
x_label: Option<&'a dyn Fn(i32) -> Option<String>>Tick label at bin k in place of the bin’s value; None from it
drops that tick, so the labels decide where ticks go (e.g. at
category boundaries with tick_every: Some(1)). Unset, every tick
shows its value.
tick_every: Option<i32>Ticks every this many bins, in place of the scale’s default.
Implementations§
Auto Trait Implementations§
impl<'a, T = usize> !RefUnwindSafe for HistPlot<'a, T>
impl<'a, T = usize> !Send for HistPlot<'a, T>
impl<'a, T = usize> !Sync for HistPlot<'a, T>
impl<'a, T = usize> !UnwindSafe for HistPlot<'a, T>
impl<'a, T> Freeze for HistPlot<'a, T>
impl<'a, T> Unpin for HistPlot<'a, T>
impl<'a, T> UnsafeUnpin for HistPlot<'a, T>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
impl<T> ErasedDestructor for Twhere
T: 'static,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
Source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.