pub trait WithinWeightThresholdMany<W> {
fn cells_within_weight_threshold_many<I, AGG>(
&self,
origin_cells: I,
weight_threshold: W,
agg_fn: AGG
) -> Result<H3CellMap<W>, Error>
where
I: IntoParallelIterator,
I::Item: Borrow<H3Cell>,
AGG: Fn(&mut W, W) + Sync;
}Expand description
Find all cells connected to the graph around a origin cell within a given threshold
Required Methods§
sourcefn cells_within_weight_threshold_many<I, AGG>(
&self,
origin_cells: I,
weight_threshold: W,
agg_fn: AGG
) -> Result<H3CellMap<W>, Error>where
I: IntoParallelIterator,
I::Item: Borrow<H3Cell>,
AGG: Fn(&mut W, W) + Sync,
fn cells_within_weight_threshold_many<I, AGG>(
&self,
origin_cells: I,
weight_threshold: W,
agg_fn: AGG
) -> Result<H3CellMap<W>, Error>where
I: IntoParallelIterator,
I::Item: Borrow<H3Cell>,
AGG: Fn(&mut W, W) + Sync,
Find all cells connected to the graph within a given weight_threshold around the
given origin_cells.
The weights for cells which are traversed from multiple origin_cells are aggregated using
agg_fn. This can be used - for example - to find the minimum or maximum weight for a cell.