feral-amf 0.2.1

Approximate Minimum Fill (AMF / HAMF4) fill-reducing ordering, quotient-graph algorithm (Amestoy 1999). Pure Rust, standalone.
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

//! Diagnostic counters exposed alongside the permutation.

/// Diagnostic counters collected during AMF ordering.
///
/// Mirrors [`feral_amd::AmdStats`] field-by-field; the AMF inner
/// loop populates the same `OrderDiagnostics` surface from the
/// shared `feral-ordering-core` workspace.
#[derive(Debug, Default, Clone, PartialEq, Eq)]
pub struct AmfStats {
    /// Number of garbage-collection compactions fired.
    pub ncmpa: u32,
    /// Number of mark-array generation-counter resets.
    ///
    /// Currently always `0`: not wired to a backing counter. The reset
    /// it would count (`clear_flag`) only fires when the generation
    /// counter `wflg` reaches `wbig = i32::MAX - n`, which during
    /// elimination requires `n` on the order of tens of thousands, so
    /// the true count is `0` on every practically testable input.
    pub n_clear_flag: u32,
    /// Number of variables absorbed by mass elimination.
    pub n_mass_elim: u32,
    /// Number of supervariable merges detected.
    pub n_supervar_merge: u32,
    /// Number of variables placed into the dense-deferred bucket
    /// at initialization.
    pub n_dense_deferred: u32,
    /// Flop counter: divisions.
    pub ndiv: u64,
    /// Flop counter: LU multiply-subtracts.
    pub nms_lu: u64,
    /// Flop counter: LDLᵀ multiply-subtracts.
    pub nms_ldl: u64,
}