Struct AreaOfInterest

pub struct AreaOfInterest<const MCL: usize, const MCC: usize, const MPL: usize, S> {
    pub area: Area<MCL, MCC, MPL, S>,
    pub max_count: u64,
    pub max_size: u64,
}

A grouping of crate::Entrys that are among the newest in some store.

Definition.

Fields

area: Area<MCL, MCC, MPL, S>

To be included in this AreaOfInterest, an crate::Entry must be included in the Area.

max_count: u64

To be included in this AreaOfInterest, an Entry’s timestamp must be among the max_count greatest Timestamps, unless max_count is zero.

max_size: u64

The total payload_lengths of all included Entries is at most max_size, unless max_size is zero.

Implementations

impl<const MCL: usize, const MCC: usize, const MPL: usize, S> AreaOfInterest<MCL, MCC, MPL, S>

pub fn new(area: Area<MCL, MCC, MPL, S>, max_count: u64, max_size: u64) -> Self

Creates a new AreaOfInterest.

impl<const MCL: usize, const MCC: usize, const MPL: usize, S> AreaOfInterest<MCL, MCC, MPL, S>

where S: PartialOrd + Clone,

pub fn intersection( &self, other: &AreaOfInterest<MCL, MCC, MPL, S>, ) -> Option<AreaOfInterest<MCL, MCC, MPL, S>>

Returns the intersection of this AreaOfInterest with another.

Definition.

Trait Implementations

impl<const MCL: usize, const MCC: usize, const MPL: usize, S: Clone> Clone for AreaOfInterest<MCL, MCC, MPL, S>

fn clone(&self) -> AreaOfInterest<MCL, MCC, MPL, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const MCL: usize, const MCC: usize, const MPL: usize, S: Debug> Debug for AreaOfInterest<MCL, MCC, MPL, S>

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

Formats the value using the given formatter.

impl<const MCL: usize, const MCC: usize, const MPL: usize, S: Hash> Hash for AreaOfInterest<MCL, MCC, MPL, S>

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<const MCL: usize, const MCC: usize, const MPL: usize, S: Ord> Ord for AreaOfInterest<MCL, MCC, MPL, S>

fn cmp(&self, other: &AreaOfInterest<MCL, MCC, MPL, S>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<const MCL: usize, const MCC: usize, const MPL: usize, S: PartialEq> PartialEq for AreaOfInterest<MCL, MCC, MPL, S>

fn eq(&self, other: &AreaOfInterest<MCL, MCC, MPL, S>) -> 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<const MCL: usize, const MCC: usize, const MPL: usize, S: PartialOrd> PartialOrd for AreaOfInterest<MCL, MCC, MPL, S>

fn partial_cmp( &self, other: &AreaOfInterest<MCL, MCC, MPL, S>, ) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<const MCL: usize, const MCC: usize, const MPL: usize, S: Eq> Eq for AreaOfInterest<MCL, MCC, MPL, S>

impl<const MCL: usize, const MCC: usize, const MPL: usize, S> StructuralPartialEq for AreaOfInterest<MCL, MCC, MPL, S>