Skip to main content

ReplicationPlanner

Struct ReplicationPlanner 

Source
pub struct ReplicationPlanner;
Expand description

Simple range/visibility-based replication planner.

Implementations§

Source§

impl ReplicationPlanner

Source

pub fn plan_for_viewer<F: VisibilityFilter>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, ) -> ReplicationPlan

Plans a frame for one viewer using the station-local spatial index.

Source

pub fn plan_for_viewer_with_scratch<F: VisibilityFilter>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, scratch: &mut ReplicationScratch, ) -> ReplicationPlan

Plans a frame using caller-provided scratch storage.

Source

pub fn plan_for_viewers_with_scratch<F: VisibilityFilter>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewers: &[ViewerQuery], filter: &F, budget: ReplicationBudget, scratch: &mut ReplicationScratch, ) -> ReplicationBatchResult

Plans viewers in input order while reusing caller-provided scratch.

Source

pub fn plan_for_viewer_range_with_scratch( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, budget: ReplicationBudget, scratch: &mut ReplicationScratch, ) -> ReplicationPlan

Plans one range-only viewer using the optional SIMD candidate filter.

With the simd feature this evaluates candidate distances in eight-lane groups. Without it, the same API uses the scalar range-only planner.

Source

pub fn plan_for_viewers_range_with_scratch( station: &Station, index: &CellIndex, policies: &PolicyTable, viewers: &[ViewerQuery], budget: ReplicationBudget, scratch: &mut ReplicationScratch, ) -> ReplicationBatchResult

Plans a range-only viewer batch in input order with optional SIMD filtering.

Source

pub fn plan_for_viewer_with_cadence<F, L>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, last_sent: L, ) -> ReplicationPlan

Plans a frame and skips entities whose distance-based cadence has not elapsed.

Source

pub fn plan_for_viewer_with_cadence_and_scratch<F, L>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, last_sent: L, scratch: &mut ReplicationScratch, ) -> ReplicationPlan

Plans a cadence-aware frame using caller-provided scratch storage.

Source

pub fn plan_for_viewer_prioritized<F: VisibilityFilter>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, ) -> ReplicationPlan

Plans a frame and selects the highest-priority entities when budgeted.

Source

pub fn plan_for_viewer_prioritized_with_scratch<F: VisibilityFilter>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, scratch: &mut ReplicationScratch, ) -> ReplicationPlan

Plans a budgeted priority frame using caller-provided scratch storage.

Source

pub fn plan_for_viewer_prioritized_with_cadence<F, L>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, last_sent: L, ) -> ReplicationPlan

Plans a budgeted priority frame with distance-based cadence checks.

Source

pub fn plan_for_viewer_prioritized_with_cadence_and_scratch<F, L>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, last_sent: L, scratch: &mut ReplicationScratch, ) -> ReplicationPlan

Plans a priority/cadence frame using caller-provided scratch storage.

Trait Implementations§

Source§

impl Clone for ReplicationPlanner

Source§

fn clone(&self) -> ReplicationPlanner

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for ReplicationPlanner

Source§

impl Debug for ReplicationPlanner

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Default for ReplicationPlanner

Source§

fn default() -> ReplicationPlanner

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.