solverforge-solver 0.18.0

Solver engine for SolverForge
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
//! One physical list-slot carrier for the compiled runtime graph.
//!
//! Static and dynamic list variables retain their native access mechanisms,
//! but every runtime kernel sees the same [`RuntimeListSlot`] and
//! [`RuntimeListElement`] protocol.  This is deliberately not a second
//! selector implementation: future construction and neighborhood cursors are
//! generic over `ListAccess` and receive this carrier for both source kinds.

use solverforge_core::domain::DynamicListVariableSlot;
use std::fmt;

use crate::heuristic::selector::k_opt::ListPositionDistanceMeter;
use crate::heuristic::selector::nearby_list_change::CrossEntityDistanceMeter;

use super::runtime_list_metadata_policy::StaticListMetadataBindings;
use super::runtime_list_route_policy::{RuntimeDynamicListSlot, StaticRouteBindings};
use super::{
    list_access::{ListAccess, ListAccessCapability, ListAccessError},
    ListVariableSlot,
};

/// Element payload carried by a runtime list move.
///
/// The tag is an internal invariant established by the selected slot.  It
/// prevents a mixed static/dynamic model from accidentally treating a native
/// element as a dynamic index (or vice versa) while still allowing one list
/// kernel to operate over both kinds.
#[derive(Clone, Debug, PartialEq, Eq)]
pub(crate) enum RuntimeListElement<V> {
    Static(V),
    Dynamic(usize),
}

/// The declaration-resolved list slot consumed by the compiled runtime graph.
///
/// A static slot keeps its real value type and distance meters.  A dynamic
/// slot keeps the bridge-owned direct access/metadata objects.  The outer enum
/// is only physical dispatch; candidate order, construction, move legality,
/// mutation, and notifications are owned by the shared runtime kernels.
#[derive(Clone)]
#[expect(
    clippy::large_enum_variant,
    reason = "runtime list slots stay value-owned without per-slot heap indirection"
)]
pub(crate) enum RuntimeListSlot<S, V, DM, IDM> {
    Static {
        slot: ListVariableSlot<S, V, DM, IDM>,
        /// Descriptor-local variable coordinate resolved exactly once from
        /// the authoritative solution descriptor.
        variable_index: usize,
        /// Resolved typed route/savings sources. Every successful static
        /// kernel call uses its non-null function pointer directly.
        route_bindings: StaticRouteBindings<S>,
        /// Resolved typed optional metadata. Its policies preserve the public
        /// meaning of absent ownership, order, and precedence hooks.
        metadata_bindings: StaticListMetadataBindings<S, V>,
    },
    Dynamic(RuntimeDynamicListSlot<S>),
}

fn element_mismatch() -> ! {
    panic!("runtime list move element does not belong to its selected list slot")
}

fn static_element<V>(element: RuntimeListElement<V>) -> V {
    match element {
        RuntimeListElement::Static(value) => value,
        RuntimeListElement::Dynamic(_) => element_mismatch(),
    }
}

fn dynamic_element<V>(element: RuntimeListElement<V>) -> usize {
    match element {
        RuntimeListElement::Dynamic(value) => value,
        RuntimeListElement::Static(_) => element_mismatch(),
    }
}

fn missing_metadata(
    entity_type_name: &'static str,
    variable_name: &'static str,
    capability: ListAccessCapability,
) -> ListAccessError {
    ListAccessError {
        capability,
        entity_type_name,
        variable_name,
    }
}

impl<S, V, DM, IDM> ListAccess<S> for RuntimeListSlot<S, V, DM, IDM>
where
    S: Clone + Send + Sync + 'static,
    V: Clone + PartialEq + Send + Sync + fmt::Debug + 'static,
    DM: Clone + Send + Sync + fmt::Debug + CrossEntityDistanceMeter<S>,
    IDM: Clone + Send + Sync + fmt::Debug + CrossEntityDistanceMeter<S>,
{
    type Element = RuntimeListElement<V>;

    fn entity_type_name(&self) -> &'static str {
        match self {
            Self::Static { slot, .. } => slot.entity_type_name(),
            Self::Dynamic(slot) => slot.entity_type_name(),
        }
    }

    fn variable_name(&self) -> &'static str {
        match self {
            Self::Static { slot, .. } => slot.variable_name(),
            Self::Dynamic(slot) => slot.variable_name(),
        }
    }

    fn descriptor_index(&self) -> usize {
        match self {
            Self::Static { slot, .. } => slot.descriptor_index(),
            Self::Dynamic(slot) => slot.descriptor_index(),
        }
    }

    fn entity_count(&self, solution: &S) -> usize {
        match self {
            Self::Static { slot, .. } => slot.entity_count(solution),
            Self::Dynamic(slot) => slot.entity_count(solution),
        }
    }

    fn element_count(&self, solution: &S) -> usize {
        match self {
            Self::Static { slot, .. } => slot.element_count(solution),
            Self::Dynamic(slot) => slot.element_count(solution),
        }
    }

    fn index_to_element(&self, solution: &S, element_index: usize) -> Option<Self::Element> {
        match self {
            Self::Static { slot, .. } => slot
                .index_to_element(solution, element_index)
                .map(RuntimeListElement::Static),
            Self::Dynamic(slot) => slot
                .index_to_element(solution, element_index)
                .map(RuntimeListElement::Dynamic),
        }
    }

    fn element_source_key(&self, solution: &S, element: &Self::Element) -> usize {
        match self {
            Self::Static { slot, .. } => match element {
                RuntimeListElement::Static(value) => slot.element_source_key(solution, value),
                RuntimeListElement::Dynamic(_) => element_mismatch(),
            },
            Self::Dynamic(_) => match element {
                RuntimeListElement::Dynamic(value) => *value,
                RuntimeListElement::Static(_) => element_mismatch(),
            },
        }
    }

    fn assigned_elements(&self, solution: &S) -> Vec<Self::Element> {
        match self {
            Self::Static { slot, .. } => slot
                .assigned_elements(solution)
                .into_iter()
                .map(RuntimeListElement::Static)
                .collect(),
            Self::Dynamic(slot) => slot
                .assigned_elements(solution)
                .into_iter()
                .map(RuntimeListElement::Dynamic)
                .collect(),
        }
    }

    fn list_len(&self, solution: &S, entity: usize) -> usize {
        match self {
            Self::Static { slot, .. } => slot.list_len(solution, entity),
            Self::Dynamic(slot) => slot.list_len(solution, entity),
        }
    }

    fn list_get(&self, solution: &S, entity: usize, position: usize) -> Option<Self::Element> {
        match self {
            Self::Static { slot, .. } => slot
                .list_get(solution, entity, position)
                .map(RuntimeListElement::Static),
            Self::Dynamic(slot) => slot
                .list_get(solution, entity, position)
                .map(RuntimeListElement::Dynamic),
        }
    }

    fn list_insert(&self, solution: &mut S, entity: usize, position: usize, value: Self::Element) {
        match self {
            Self::Static { slot, .. } => {
                slot.list_insert(solution, entity, position, static_element(value));
            }
            Self::Dynamic(slot) => {
                slot.list_insert(solution, entity, position, dynamic_element(value));
            }
        }
    }

    fn list_remove(
        &self,
        solution: &mut S,
        entity: usize,
        position: usize,
    ) -> Option<Self::Element> {
        match self {
            Self::Static { slot, .. } => slot
                .list_remove(solution, entity, position)
                .map(RuntimeListElement::Static),
            Self::Dynamic(slot) => slot
                .list_remove(solution, entity, position)
                .map(RuntimeListElement::Dynamic),
        }
    }

    fn list_set(
        &self,
        solution: &mut S,
        entity: usize,
        position: usize,
        value: Self::Element,
    ) -> Result<(), ListAccessError> {
        match self {
            Self::Static { slot, .. } => {
                slot.list_set(solution, entity, position, static_element(value))
            }
            Self::Dynamic(slot) => <DynamicListVariableSlot<S> as ListAccess<S>>::list_set(
                slot,
                solution,
                entity,
                position,
                dynamic_element(value),
            ),
        }
    }

    fn list_reverse(
        &self,
        solution: &mut S,
        entity: usize,
        start: usize,
        end: usize,
    ) -> Result<(), ListAccessError> {
        match self {
            Self::Static { slot, .. } => slot.list_reverse(solution, entity, start, end),
            Self::Dynamic(slot) => <DynamicListVariableSlot<S> as ListAccess<S>>::list_reverse(
                slot, solution, entity, start, end,
            ),
        }
    }

    fn sublist_remove(
        &self,
        solution: &mut S,
        entity: usize,
        start: usize,
        end: usize,
    ) -> Result<Vec<Self::Element>, ListAccessError> {
        match self {
            Self::Static { slot, .. } => Ok(slot
                .sublist_remove(solution, entity, start, end)?
                .into_iter()
                .map(RuntimeListElement::Static)
                .collect()),
            Self::Dynamic(slot) => Ok(
                <DynamicListVariableSlot<S> as ListAccess<S>>::sublist_remove(
                    slot, solution, entity, start, end,
                )?
                .into_iter()
                .map(RuntimeListElement::Dynamic)
                .collect(),
            ),
        }
    }

    fn sublist_insert(
        &self,
        solution: &mut S,
        entity: usize,
        position: usize,
        values: Vec<Self::Element>,
    ) -> Result<(), ListAccessError> {
        match self {
            Self::Static { slot, .. } => slot.sublist_insert(
                solution,
                entity,
                position,
                values.into_iter().map(static_element).collect(),
            ),
            Self::Dynamic(slot) => <DynamicListVariableSlot<S> as ListAccess<S>>::sublist_insert(
                slot,
                solution,
                entity,
                position,
                values.into_iter().map(dynamic_element).collect(),
            ),
        }
    }

    fn element_owner(
        &self,
        solution: &S,
        element: &Self::Element,
    ) -> Result<Option<usize>, ListAccessError> {
        match self {
            Self::Static {
                metadata_bindings, ..
            } => match element {
                RuntimeListElement::Static(value) => {
                    Ok((metadata_bindings.element_owner)(solution, value))
                }
                RuntimeListElement::Dynamic(_) => element_mismatch(),
            },
            Self::Dynamic(slot) => match element {
                RuntimeListElement::Dynamic(value) => {
                    if slot.ownership_policy().is_explicit() {
                        slot.element_owner(solution, value)
                    } else {
                        Ok(None)
                    }
                }
                RuntimeListElement::Static(_) => element_mismatch(),
            },
        }
    }

    fn construction_order_key(
        &self,
        solution: &S,
        element: Self::Element,
    ) -> Result<i64, ListAccessError> {
        match self {
            Self::Static {
                metadata_bindings, ..
            } => Ok((metadata_bindings.construction_order)(
                solution,
                static_element(element),
            )),
            Self::Dynamic(slot) => {
                if slot.construction_order_policy().is_explicit() {
                    slot.construction_order_key(solution, dynamic_element(element))
                } else {
                    Ok(0)
                }
            }
        }
    }

    fn extend_precedence_successors(
        &self,
        solution: &S,
        element: Self::Element,
        successors: &mut Vec<Self::Element>,
    ) -> Result<(), ListAccessError> {
        match self {
            Self::Static {
                slot,
                metadata_bindings,
                ..
            } => {
                if !metadata_bindings.precedence_policy.has_successors() {
                    return Err(missing_metadata(
                        slot.entity_type_name,
                        slot.variable_name,
                        ListAccessCapability::Precedence,
                    ));
                }
                let mut values = Vec::new();
                (metadata_bindings.precedence_successors)(
                    solution,
                    static_element(element),
                    &mut values,
                );
                successors.extend(values.into_iter().map(RuntimeListElement::Static));
                Ok(())
            }
            Self::Dynamic(slot) => {
                if !slot.precedence_policy().has_successors() {
                    return Err(missing_metadata(
                        slot.entity_type_name,
                        slot.variable_name,
                        ListAccessCapability::Precedence,
                    ));
                }
                let mut values = Vec::new();
                slot.extend_precedence_successors(solution, dynamic_element(element), &mut values)?;
                successors.extend(values.into_iter().map(RuntimeListElement::Dynamic));
                Ok(())
            }
        }
    }

    fn precedence_duration(
        &self,
        solution: &S,
        element: Self::Element,
    ) -> Result<usize, ListAccessError> {
        match self {
            Self::Static {
                slot,
                metadata_bindings,
                ..
            } => {
                if !metadata_bindings.precedence_policy.is_explicit() {
                    return Err(missing_metadata(
                        slot.entity_type_name,
                        slot.variable_name,
                        ListAccessCapability::Precedence,
                    ));
                }
                Ok((metadata_bindings.precedence_duration)(
                    solution,
                    static_element(element),
                ))
            }
            Self::Dynamic(slot) => {
                if slot.precedence_policy().is_explicit() {
                    slot.precedence_duration(solution, dynamic_element(element))
                } else {
                    Err(missing_metadata(
                        slot.entity_type_name,
                        slot.variable_name,
                        ListAccessCapability::Precedence,
                    ))
                }
            }
        }
    }

    fn cross_position_distance(
        &self,
        solution: &S,
        from_entity: usize,
        from_position: usize,
        to_entity: usize,
        to_position: usize,
    ) -> Result<f64, ListAccessError> {
        match self {
            Self::Static { slot, .. } => slot.cross_position_distance(
                solution,
                from_entity,
                from_position,
                to_entity,
                to_position,
            ),
            Self::Dynamic(slot) => slot.cross_position_distance(
                solution,
                from_entity,
                from_position,
                to_entity,
                to_position,
            ),
        }
    }

    fn intra_position_distance(
        &self,
        solution: &S,
        entity: usize,
        from_position: usize,
        to_position: usize,
    ) -> Result<f64, ListAccessError> {
        match self {
            Self::Static { slot, .. } => Ok(slot.intra_distance_meter.distance(
                solution,
                entity,
                from_position,
                entity,
                to_position,
            )),
            Self::Dynamic(slot) => {
                slot.intra_position_distance(solution, entity, from_position, to_position)
            }
        }
    }
}

/// The one position-metric adapter for compiled list slots.
///
/// Native list declarations retain their established intra metric as a
/// cross-entity meter and are invoked with the same source and destination
/// entity. Dynamic slots never use that generic meter: they delegate to their
/// explicitly bound dynamic metadata. Compilation validates the corresponding
/// capability before a K-opt consumer can call this adapter.
impl<S, V, DM, IDM> ListPositionDistanceMeter<S> for RuntimeListSlot<S, V, DM, IDM>
where
    S: Clone + Send + Sync + 'static,
    V: Clone + PartialEq + Send + Sync + fmt::Debug + 'static,
    DM: Clone + Send + Sync + fmt::Debug + CrossEntityDistanceMeter<S>,
    IDM: Clone + Send + Sync + fmt::Debug + CrossEntityDistanceMeter<S>,
{
    fn distance(
        &self,
        solution: &S,
        entity: usize,
        from_position: usize,
        to_position: usize,
    ) -> f64 {
        ListAccess::intra_position_distance(self, solution, entity, from_position, to_position)
            .expect("compiled list position distance requires a validated slot capability")
    }
}