Struct TileAddr 

pub struct TileAddr {
    pub base: usize,
    pub steps: Vec<(LoopVar, usize)>,
    pub indirect: Option<IndirectTile>,
}

A tile id that is affine in the choreography’s loop variables: base + Σ env[var]·stride, plus an optional value-dependent term (IndirectTile).

Fields

base: usize

steps: Vec<(LoopVar, usize)>

indirect: Option<IndirectTile>

Implementations

impl TileAddr

pub fn constant(base: usize) -> TileAddr

pub fn resolve(&self, env: &BTreeMap<LoopVar, usize>) -> usize

The AFFINE part of the address. An indirect term is not resolved here — it has no value without the index buffer’s data, which is why the evaluator owns that resolution.

Trait Implementations

impl Clone for TileAddr

fn clone(&self) -> TileAddr

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TileAddr

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for TileAddr

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for TileAddr

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for TileAddr

fn eq(&self, other: &TileAddr) -> 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 Serialize for TileAddr

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Eq for TileAddr

impl StructuralPartialEq for TileAddr