Struct IntervalData 

pub struct IntervalData<'a> {
    pub interval_date: NaiveDate,
    pub interval_value: Vec<f64>,
    pub quality_method: LocatedSpan<&'a str>,
    pub reason_code: Option<LocatedSpan<&'a str>>,
    pub reason_description: Option<LocatedSpan<&'a str>>,
    pub update_datetime: NaiveDateTime,
    pub msats_load_datetime: Option<NaiveDateTime>,
    pub interval_events: Option<Vec<IntervalEvent<'a>>>,
}

Fields

interval_date: NaiveDate

interval_value: Vec<f64>

quality_method: LocatedSpan<&'a str>

reason_code: Option<LocatedSpan<&'a str>>

reason_description: Option<LocatedSpan<&'a str>>

update_datetime: NaiveDateTime

msats_load_datetime: Option<NaiveDateTime>

interval_events: Option<Vec<IntervalEvent<'a>>>

Implementations

impl<'a> IntervalData<'a>

pub fn parse( capacity: usize, input: LocatedSpan<&'a str>, ) -> IResult<LocatedSpan<&'a str>, IntervalData<'a>>

Trait Implementations

impl<'a> Clone for IntervalData<'a>

fn clone(&self) -> IntervalData<'a>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a> Debug for IntervalData<'a>

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

Formats the value using the given formatter.

impl<'a> PartialEq for IntervalData<'a>

fn eq(&self, other: &Self) -> 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<'a> Eq for IntervalData<'a>