Struct Area 

pub struct Area<const MCL: usize, const MCC: usize, const MPL: usize, S> { /* private fields */ }

An Area is a box in three-dimensional willow space, consisting of all entries matching either a single subspace id or entries of arbitrary subspace ids, prefixed by some Path, and a TimeRange.

Areas are the default way by which application developers should aggregate entries. See the specification for more details.

use willow_data_model::prelude::*;

let a1 = Area::<2, 2, 2, u8>::new(None, Path::new(), ..Timestamp::from(17));

assert!(a1.wdm_includes(&(6, Path::new(), Timestamp::from(9))));
assert_eq!(a1.subspace(), None);

let a2 = Area::<2, 2, 2, u8>::new(Some(42), Path::new(), Timestamp::from(15)..);
assert_eq!(
    a1.wdm_intersection(&a2),
    Area::<2, 2, 2, u8>::new(
        Some(42),
        Path::new(),
        Timestamp::from(15)..Timestamp::from(17),
    ),
);

Specification

Implementations

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

pub fn new<TR>( subspace: Option<S>, path: Path<MCL, MCC, MPL>, times: TR, ) -> Self

where TR: Into<TimeRange>,

Creates a new Area from its constituent optional subspace id, Path, and TimeRange.

use willow_data_model::prelude::*;

let a = Area::<2, 2, 2, u8>::new(None, Path::new(), ..Timestamp::from(17));

assert!(a.wdm_includes(&(6, Path::new(), Timestamp::from(9))));
assert_eq!(a.subspace(), None);

pub fn subspace(&self) -> Option<&S>

Returns a reference to the inner subspace id, if any.

use willow_data_model::prelude::*;

let a1 = Area::<2, 2, 2, u8>::new(Some(17), Path::new(), ..Timestamp::from(17));
assert_eq!(a1.subspace(), Some(&17));

let a2 = Area::<2, 2, 2, u8>::new(None, Path::new(), ..Timestamp::from(17));
assert_eq!(a2.subspace(), None);

Definition.

pub fn path(&self) -> &Path<MCL, MCC, MPL>

Returns a reference to the inner Path.

use willow_data_model::prelude::*;

let a = Area::<2, 2, 2, u8>::new(Some(17), Path::new(), ..Timestamp::from(17));
assert_eq!(a.path(), &Path::new());

Definition.

pub fn times(&self) -> &TimeRange

Returns a reference to the inner TimeRange.

use willow_data_model::prelude::*;

let a = Area::<2, 2, 2, u8>::new(Some(17), Path::new(), ..Timestamp::from(17));
assert_eq!(a.times(), &WillowRange::from(..Timestamp::from(17)));

Definition.

pub fn set_subspace(&mut self, new_subspace: Option<S>)

Sets the inner subspace id.

pub fn set_path(&mut self, new_path: Path<MCL, MCC, MPL>)

Sets the inner Path.

pub fn set_times<TR>(&mut self, new_range: TR)

where TR: Into<TimeRange>,

Sets the inner TimeRange.

pub fn new_subspace(subspace_id: S) -> Self

Returns the subspace area for the given subspace id, i.e., the area which includes exactly the entries of the given subspace id.

use willow_data_model::prelude::*;

let a = Area::<2, 2, 2, u8>::new_subspace(17);

assert!(a.wdm_includes(&(17, Path::new(), Timestamp::from(9))));
assert!(!a.wdm_includes(&(18, Path::new(), Timestamp::from(9))));
assert_eq!(a.subspace(), Some(&17));

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

where S: Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

pub fn admits_pruning_by<Coord>(&self, coord: &Coord) -> bool

where Coord: Coordinatelike<MCL, MCC, MPL, S>,

Returns whether an Entry of the given coordinate could possibly cause prefix pruning in this area.

use willow_data_model::prelude::*;

let a = Area::<2, 2, 2, u8>::new(Some(17), Path::new(), ..Timestamp::from(17));

assert!(a.admits_pruning_by(&(17, Path::new(), Timestamp::from(9))));
assert!(!a.admits_pruning_by(&(18, Path::new(), Timestamp::from(9))));

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

where S: Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

pub fn full() -> Self

Returns the Area which includes every coordinate.

use willow_data_model::prelude::*;

let a = Area::<2, 2, 2, u8>::full();

assert!(a.wdm_includes(&(6, Path::new(), Timestamp::from(9))));
assert!(a.wdm_includes(&(16, Path::new(), Timestamp::from(9))));

pub fn is_full(&self) -> bool

Returns whether self is the full area, i.e., the area which includes every coordinate.

use willow_data_model::prelude::*;

assert!(Area::<2, 2, 2, u8>::full().is_full());
assert!(!Area::<2, 2, 2, u8>::new(Some(17), Path::new(), ..Timestamp::from(17)).is_full());

Trait Implementations

impl<'arbitrary, const MCL: usize, const MCC: usize, const MPL: usize, S: Arbitrary<'arbitrary>> Arbitrary<'arbitrary> for Area<MCL, MCC, MPL, S>

fn arbitrary(u: &mut Unstructured<'arbitrary>) -> Result<Self>

Generate an arbitrary value of Self from the given unstructured data.

fn arbitrary_take_rest(u: Unstructured<'arbitrary>) -> Result<Self>

Generate an arbitrary value of Self from the entirety of the given unstructured data.

fn size_hint(depth: usize) -> (usize, Option<usize>)

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

fn try_size_hint( depth: usize, ) -> Result<(usize, Option<usize>), MaxRecursionReached>

Get a size hint for how many bytes out of an Unstructured this type needs to construct itself.

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

fn clone(&self) -> Area<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 Area<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> From<Area<MCL, MCC, MPL, S>> for Range3d<MCL, MCC, MPL, S>

where S: Clone + SuccessorExceptForGreatest + LeastElement,

fn from(value: Area<MCL, MCC, MPL, S>) -> Self

Converts to this type from the input type.

impl<const MCL: usize, const MCC: usize, const MPL: usize, S> GreatestElement for Area<MCL, MCC, MPL, S>

where S: Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

fn greatest() -> Self

Returns the unique greatest element.

fn is_greatest(&self) -> bool

Returns true if and only if self is the greatest element.

impl<const MCL: usize, const MCC: usize, const MPL: usize, S> Grouping<MCL, MCC, MPL, S> for Area<MCL, MCC, MPL, S>

where S: Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

fn wdm_includes<Coord>(&self, coord: &Coord) -> bool

where Coord: Coordinatelike<MCL, MCC, MPL, S> + ?Sized,

Returns true iff the given Coordinatelike value is included in this grouping.

fn wdm_includes_grouping(&self, other: &Self) -> bool

Returns true iff every value included in other is also included in self.

fn wdm_strictly_includes_grouping(&self, other: &Self) -> bool

Returns true iff every value included in other is also included in self and self and other are not equal.

fn wdm_includes_in_intersection<Coord>( &self, other: &Self, coord: &Coord, ) -> bool

where Coord: Coordinatelike<MCL, MCC, MPL, S> + ?Sized,

Returns true iff the given Coordinatelike value is included in the intersection of self and other.

fn wdm_is_empty(&self) -> bool

Returns true iff self includes no values.

fn wdm_empty() -> Self

Returns a grouping which includes no values.

fn wdm_intersection(&self, other: &Self) -> Self

Returns a grouping which includes exactly those values included by both self and other.

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

where S: Hash + Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

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> LeastElement for Area<MCL, MCC, MPL, S>

where S: Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

fn least() -> Self

Returns the unique least element.

fn is_least(&self) -> bool

Returns true if and only if self is the least element.

impl<const MCL: usize, const MCC: usize, const MPL: usize, S> LowerSemilattice for Area<MCL, MCC, MPL, S>

where S: Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

fn greatest_lower_bound(&self, other: &Self) -> Self

Returns the greatest lower bound of self and other, i.e., the unique greatest element in the type which is less than or equal to both self and other.

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

where S: Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

An area is equal to another iff both include exactly the same values.

This implementation assumes that S is inhabited by more than one value.

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

where S: Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

An area is less than another iff all values included in the first are also included in the other.

This implementation assumes that S is inhabited by more than one value.

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

An area is less than another iff all values included in the first are also included in the other.

This implementation assumes that S is inhabited by more than one value.

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> UpperSemilattice for Area<MCL, MCC, MPL, S>

where S: Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,

fn least_upper_bound(&self, other: &Self) -> Self

Returns the least upper bound of self and other, i.e., the unique least element in the type which is greater than or equal to both self and other.

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

where S: Clone + Ord + PredecessorExceptForLeast + SuccessorExceptForGreatest,