Enum holochain::prelude::dependencies::kitsune_p2p_types::dht::prelude::RegionSet

pub enum RegionSet<T = RegionData>
where
    T: RegionDataConstraints,
{
    Ltcs(RegionSetLtcs<T>),
}

The generic definition of a set of Regions. The current representation is very specific to our current algorithm, but this is an enum to make room for a more generic representation, e.g. a simple Vec<Region>, if we want a more intricate algorithm later.

Variants

Ltcs(RegionSetLtcs<T>)

Logarithmic Time, Constant Space.

Implementations

impl<D> RegionSet<D>

where D: RegionDataConstraints,

pub fn count(&self) -> usize

The number of regions specified

pub fn regions(&self) -> impl Iterator<Item = Region<D>>

Iterator over all Regions

pub fn query(&self, _bounds: &RegionBounds) -> !

The RegionSet can be used to answer questions about more regions than just the ones specified: If a larger region is queried, and this set contains a set of regions which over that larger region, then the larger region can be dynamically constructed.

This allows agents with differently computed RegionSets to still engage in gossip without needing to recompute regions.

pub fn update(&self, _c: SpacetimeQuantumCoords, _d: D) -> !

In order for this RegionSet to be queryable, new data needs to be integrated into it to avoid needing to recompute it from the database on each query.

pub fn diff(self, other: RegionSet<D>) -> Result<Vec<Region<D>>, GossipError>

Find a set of Regions which represents the intersection of the two input RegionSets.

Trait Implementations

impl<T> Debug for RegionSet<T>

where T: Debug + RegionDataConstraints,

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

Formats the value using the given formatter.

impl<T> From<RegionSetLtcs<T>> for RegionSet<T>

where T: RegionDataConstraints,

fn from(original: RegionSetLtcs<T>) -> RegionSet<T>

Converts to this type from the input type.