Struct QueuedEntityPlacer 

pub struct QueuedEntityPlacer<S, V, ES, VS>
where
    S: PlanningSolution,
    ES: EntitySelector<S>,
    VS: TypedValueSelector<S, V>,
{ /* private fields */ }

A queued entity placer that processes entities in order.

For each uninitialized entity, generates change moves for all possible values. Uses typed function pointers for zero-erasure access.

Type Parameters

• S - The planning solution type
• V - The value type
• ES - The entity selector type
• VS - The value selector type

Implementations

impl<S, V, ES, VS> QueuedEntityPlacer<S, V, ES, VS>

where S: PlanningSolution, ES: EntitySelector<S>, VS: TypedValueSelector<S, V>,

pub fn new( entity_selector: ES, value_selector: VS, getter: fn(&S, usize) -> Option<V>, setter: fn(&mut S, usize, Option<V>), descriptor_index: usize, variable_name: &'static str, ) -> Self

Creates a new queued entity placer with typed function pointers.

Trait Implementations

impl<S, V, ES, VS> Debug for QueuedEntityPlacer<S, V, ES, VS>

where S: PlanningSolution, ES: EntitySelector<S> + Debug, VS: TypedValueSelector<S, V> + Debug,

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

Formats the value using the given formatter.

impl<S, V, ES, VS> EntityPlacer<S, ChangeMove<S, V>> for QueuedEntityPlacer<S, V, ES, VS>

where S: PlanningSolution, V: Clone + PartialEq + Send + Sync + Debug + 'static, ES: EntitySelector<S>, VS: TypedValueSelector<S, V>,

fn get_placements<D: ScoreDirector<S>>( &self, score_director: &D, ) -> Vec<Placement<S, ChangeMove<S, V>>>

Returns all placements (entities + their candidate moves).