pounce-cli 0.4.0

//! Archive of accepted minima with per-dimension-scaled dedup, mirroring
//! `MinimaArchive` in `python/pounce/_minima.py`.
//!
//! Two points are "the same" when their Euclidean distance in the
//! per-dimension scaled space `‖(a−b)/L‖` is within `dedup`, where `L` is
//! the box width per variable (1.0 for unbounded dims). This makes `dedup`
//! scale-free and keeps it consistent with the anisotropic repulsion widths.

use pounce_common::types::Number;

/// Scaled Euclidean distance `‖(a−b)/L‖`.
pub fn scaled_distance(a: &[Number], b: &[Number], l: &[Number]) -> Number {
    let mut acc = 0.0;
    for i in 0..a.len() {
        let d = (a[i] - b[i]) / l[i];
        acc += d * d;
    }
    acc.sqrt()
}

/// Accepted minima plus the dedup test.
pub struct Archive {
    dedup: Number,
    /// Per-dimension scale `L` for the dedup metric.
    l: Vec<Number>,
    pub xs: Vec<Vec<Number>>,
    pub fs: Vec<Number>,
}

impl Archive {
    pub fn new(dedup: Number, l: Vec<Number>) -> Self {
        Self {
            dedup,
            l,
            xs: Vec::new(),
            fs: Vec::new(),
        }
    }

    pub fn len(&self) -> usize {
        self.xs.len()
    }

    pub fn is_empty(&self) -> bool {
        self.xs.is_empty()
    }

    /// Is `x` within `dedup` of any already-accepted minimum?
    pub fn is_known(&self, x: &[Number]) -> bool {
        self.xs
            .iter()
            .any(|m| scaled_distance(x, m, &self.l) <= self.dedup)
    }

    /// Is `x` within `radius` of any accepted minimum (MLSL clustering)?
    pub fn near_any(&self, x: &[Number], radius: Number) -> bool {
        self.xs
            .iter()
            .any(|m| scaled_distance(x, m, &self.l) <= radius)
    }

    pub fn add(&mut self, x: Vec<Number>, f: Number) {
        self.xs.push(x);
        self.fs.push(f);
    }

    /// Indices of the accepted minima ordered by ascending objective.
    pub fn order_by_objective(&self) -> Vec<usize> {
        let mut idx: Vec<usize> = (0..self.fs.len()).collect();
        idx.sort_by(|&a, &b| {
            self.fs[a]
                .partial_cmp(&self.fs[b])
                .unwrap_or(std::cmp::Ordering::Equal)
        });
        idx
    }
}