Struct BoundingBox 

pub struct BoundingBox<const D: usize> { /* private fields */ }

Axis-aligned bounding box for D-dimensional points. Storage is stack-allocated [f64; D] so the compiler can unroll the per-dim loops, vectorise via SIMD, and avoid any heap traffic.

Examples

use anomstream_core::BoundingBox;

let mut bbox = BoundingBox::<2>::from_point(&[0.0, 0.0]).unwrap();
bbox.extend(&[3.0, 4.0]).unwrap();
assert_eq!(bbox.range_sum(), 7.0);

Implementations

impl<const D: usize> BoundingBox<D>

pub fn from_point(point: &[f64]) -> RcfResult<Self>

Build a degenerate bounding box from a single point.

Errors

• RcfError::EmptyBoundingBox when D == 0.
• RcfError::DimensionMismatch when point.len() != D.

pub const fn dim(&self) -> usize

Dimensionality of the box (compile-time constant D).

pub fn min(&self) -> &[f64; D]

Per-dimension lower corner.

pub fn max(&self) -> &[f64; D]

Per-dimension upper corner.

pub fn range_at(&self, d: usize) -> f64

Range (max_d − min_d) for dimension d.

Panics

Panics when d >= D — call sites are internal and always size-checked.

pub fn range_sum(&self) -> f64

Sum of per-dimension ranges (Σ_d (max_d − min_d)).

This is the denominator used by Cut::random_cut to pick a dimension weighted by its range. Vectorised in 4-lane f64 chunks via wide::f64x4 for the AWS-default D = 16 hot path; a scalar tail handles dims that are not a multiple of 4.

pub fn extend(&mut self, point: &[f64]) -> RcfResult<()>

Extend the box in place to include point.

Errors

Returns RcfError::DimensionMismatch when point.len() != D.

pub fn merge_with(&mut self, other: &Self)

Merge other into self in place. Both boxes have the same type-level dimensionality so this is infallible.

pub fn merged(&self, other: &Self) -> Self

Return a new box equal to the union of self and other.

pub fn extension_per_dim(&self, point: &[f64]) -> RcfResult<[f64; D]>

Per-dimension extension required to accommodate point — Δ_d = max(0, point_d − max_d) + max(0, min_d − point_d).

When point already lies inside the box every Δ_d is 0 and the cut probability is 0.

Errors

Returns RcfError::DimensionMismatch when point.len() != D.

pub fn probability_of_cut(&self, point: &[f64]) -> RcfResult<(f64, [f64; D])>

Probability that a uniform random cut over the augmented box would isolate point from the original box.

Returns (total_probability, per_dim_contributions) where the per-dim array sums to total_probability.

Errors

Returns RcfError::DimensionMismatch when point.len() != D.

pub fn per_dim_cut_probabilities(&self, point: &[f64]) -> RcfResult<[f64; D]>

Convenience accessor returning only the per-dim contributions (ignores the total).

Errors

Returns RcfError::DimensionMismatch when point.len() != D.

pub fn augmented_range_at(&self, d: usize, point: &[f64]) -> f64

Per-dimension range of the bounding box augmented by point without materialising a fresh BoundingBox.

Panics

Panics in debug builds when d >= D or point.len() != D.

pub fn augmented_range_sum(&self, point: &[f64]) -> f64

Sum of augmented_range_at over every dimension.

Panics

Panics in debug builds when point.len() != D.

pub fn augmented_random_cut<R: Rng + ?Sized>( &self, point: &[f64], rng: &mut R, ) -> RcfResult<Cut>

Sample a random cut over the bounding box augmented by point without materialising the augmented box.

Errors

Returns RcfError::EmptyBoundingBox when every per-dim range of the augmented box is zero.

pub fn total_probability_of_cut(&self, point: &[f64]) -> RcfResult<f64>

Total cut probability without allocating the per-dim breakdown — fast path for crate::ScalarScoreVisitor.

Fuses the range_sum and extension passes into a single SIMD loop so self.min / self.max are loaded once per chunk. The previous split implementation did two passes and ate 2× the L1 bandwidth on deep tree descents where bbox reload dominates.

Errors

Returns RcfError::DimensionMismatch when point.len() != D.

Trait Implementations

impl<const D: usize> Clone for BoundingBox<D>

fn clone(&self) -> BoundingBox<D>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const D: usize> Debug for BoundingBox<D>

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

Formats the value using the given formatter.

impl<'de, const D: usize> Deserialize<'de> for BoundingBox<D>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<const D: usize> PartialEq for BoundingBox<D>

fn eq(&self, other: &BoundingBox<D>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const D: usize> Serialize for BoundingBox<D>

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<const D: usize> StructuralPartialEq for BoundingBox<D>