Struct ReplicationPlanner 

pub struct ReplicationPlanner;

Simple range/visibility-based replication planner.

Implementations

impl ReplicationPlanner

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.

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.

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

Plans one viewer into caller-owned output while retaining its entity capacity.

pub fn plan_for_viewer_eligible_with_scratch_into<F, E>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, eligible: E, scratch: &mut ReplicationScratch, plan: &mut ReplicationPlan, )

where F: VisibilityFilter, E: Fn(&ViewerQuery, EntityHandle, &EntityRecord) -> bool,

Plans one viewer while applying caller-owned eligibility before budget use.

The predicate can implement dirty, per-client delivery, or gameplay-owned selection rules without transferring that state into SectorSync.

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.

pub fn plan_for_viewers_into<'a, F: VisibilityFilter>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewers: &[ViewerQuery], filter: &F, budget: ReplicationBudget, scratch: &mut ReplicationScratch, batch: &'a mut ReplicationBatchScratch, ) -> ReplicationBatchView<'a>

Plans viewers into caller-owned output slots while retaining all capacities.

pub fn plan_for_viewers_eligible_into<'a, F, E>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewers: &[ViewerQuery], filter: &F, budget: ReplicationBudget, eligible: E, scratch: &mut ReplicationScratch, batch: &'a mut ReplicationBatchScratch, ) -> ReplicationBatchView<'a>

where F: VisibilityFilter, E: Fn(&ViewerQuery, EntityHandle, &EntityRecord) -> bool,

Plans viewers with caller-owned eligibility and reusable output storage.

pub fn plan_for_viewer_work_bounded_with_scratch_into<F, E>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewer: &ViewerQuery, filter: &F, budget: ReplicationBudget, eligible: E, scratch: &mut ReplicationScratch, plan: &mut ReplicationPlan, )

where F: VisibilityFilter, E: Fn(&ViewerQuery, EntityHandle, &EntityRecord) -> bool,

Plans one viewer using deterministic first-fit selection with a bounded scan.

Planning stops as soon as the budget is full. This avoids exact post-budget accounting and does not provide global priority ordering.

pub fn plan_for_viewers_work_bounded_into<'a, F, E>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewers: &[ViewerQuery], filter: &F, budget: ReplicationBudget, eligible: E, scratch: &mut ReplicationScratch, batch: &'a mut ReplicationBatchScratch, ) -> ReplicationBatchView<'a>

where F: VisibilityFilter, E: Fn(&ViewerQuery, EntityHandle, &EntityRecord) -> bool,

Plans viewers using deterministic first-fit selection with bounded scans.

Each plan stops examining candidates as soon as its budget is full. This avoids exact post-budget accounting and does not provide global priority ordering; see ReplicationStats::unexamined_after_budget.

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.

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

Plans one range-only viewer into caller-owned reusable output.

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.

pub fn plan_for_viewers_range_into<'a>( station: &Station, index: &CellIndex, policies: &PolicyTable, viewers: &[ViewerQuery], budget: ReplicationBudget, scratch: &mut ReplicationScratch, batch: &'a mut ReplicationBatchScratch, ) -> ReplicationBatchView<'a>

Plans a range-only viewer batch into caller-owned reusable output slots.

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

where F: VisibilityFilter, L: Fn(EntityHandle) -> Option<Tick>,

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

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

where F: VisibilityFilter, L: Fn(EntityHandle) -> Option<Tick>,

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

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

where F: VisibilityFilter, L: Fn(EntityHandle) -> Option<Tick>,

Plans a cadence-aware frame into caller-owned reusable output.

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.

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.

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

Plans a priority frame into caller-owned reusable output.

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

where F: VisibilityFilter, L: Fn(EntityHandle) -> Option<Tick>,

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

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

where F: VisibilityFilter, L: Fn(EntityHandle) -> Option<Tick>,

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

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

where F: VisibilityFilter, L: Fn(EntityHandle) -> Option<Tick>,

Plans a priority/cadence frame into caller-owned reusable output.

Trait Implementations

impl Clone for ReplicationPlanner

fn clone(&self) -> ReplicationPlanner

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for ReplicationPlanner

impl Debug for ReplicationPlanner

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

Formats the value using the given formatter.

impl Default for ReplicationPlanner

fn default() -> ReplicationPlanner

Returns the “default value” for a type.