Skip to main content

IndexFn

Enum IndexFn 

Source
pub enum IndexFn {
    Lattice {
        axis_sizes: Vec<u64>,
    },
    Lockstep {
        length: u64,
    },
    Modular {
        axis_sizes: Vec<u64>,
    },
    Concatenation {
        segment_sizes: Vec<u64>,
    },
    Continuous {
        intervals: Vec<Interval>,
        measure: ProductMeasure,
    },
    Hybrid {
        discrete_axes: Vec<u64>,
        continuous_axes: Vec<Interval>,
        measure: ProductMeasure,
    },
}
Expand description

Closed-form addressing schemes — spec §10.7.1.

Six variants. Each describes the bijection from a 0..cardinality index range to the node’s tuple shape. Continuous and Hybrid carry the cardinality’s interval+measure descriptors directly so the R2 push-down rules (Phase 6) can dispatch on them without recomputing.

Variants§

§

Lattice

Discrete cartesian. axis_sizes[i] is the i-th axis’s element count. Multi-index (i₀, i₁, …) maps to the per-axis tuple at those positions.

Fields

§axis_sizes: Vec<u64>

Element count per axis.

§

Lockstep

Zip Strict / Truncate. One index i ∈ 0..length maps to the per-child tuple at position i.

Fields

§length: u64

The common length.

§

Modular

Zip Cycle. Modular addressing — index i maps to each child at i mod child.cardinality. At least one child must be bounded (the cycling target).

Fields

§axis_sizes: Vec<u64>

Element count per child.

§

Concatenation

Union of index-addressable children. Index i ∈ 0..Σsegment_sizes maps to segment k where k is the smallest such that Σ₀^k segment_sizes > i, position i - Σ₀^{k-1} segment_sizes within that segment.

Fields

§segment_sizes: Vec<u64>

Element count per segment, in order.

§

Continuous

Continuous K-D box. Strategy push-down rules (Halton / Sobol / Lhs / Extrema on Continuous) draw from this directly; the discrete-to-continuous mapping is strategy-specific.

Fields

§intervals: Vec<Interval>

The interval of each axis.

§measure: ProductMeasure

The measure drawn from.

§

Hybrid

Mixed discrete × continuous cartesian. Discrete axes get integer indexing; continuous axes get measure-weighted sampling. Strategy push-down dispatches per-axis.

Fields

§discrete_axes: Vec<u64>

Element count per discrete axis.

§continuous_axes: Vec<Interval>

The interval of each continuous axis.

§measure: ProductMeasure

The measure over the continuous axes.

Implementations§

Source§

impl IndexFn

Source

pub fn has_continuous_axis(&self) -> bool

true if this index function carries any continuous axis. Used by per-strategy V4 checks to reject strategies that don’t accept continuous inputs.

Source

pub fn is_multi_axis_lattice(&self) -> bool

true if this index function is a multi-axis Lattice (discrete cartesian with ≥2 axes). Required by lattice-geometric strategies (Extrema / Shells / Diagonal / Antidiagonal) for non-degenerate behavior.

Trait Implementations§

Source§

impl Clone for IndexFn

Source§

fn clone(&self) -> IndexFn

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for IndexFn

Source§

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

Formats the value using the given formatter. Read more
Source§

impl<'de> Deserialize<'de> for IndexFn

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl PartialEq for IndexFn

Source§

fn eq(&self, other: &IndexFn) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl Serialize for IndexFn

Source§

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

Serialize this value into the given Serde serializer. Read more
Source§

impl StructuralPartialEq for IndexFn

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.