graphcal-compiler 0.0.1-alpha.14

Type-safe, unit-aware, Git-friendly reactive programming language for engineering calculations
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

//! Type inference for expressions.
//!
//! Inference walks module-aware HIR exclusively (see [`hir`]); the shared
//! typing-rule kernels live in [`rules`]. The former resolved-syntax-AST
//! walker was retired once every boundary expression (declaration bodies,
//! domain bounds, CLI overrides) gained a stored HIR form (#765).

pub(super) mod hir;
mod rules;

use super::InferredIndex;
use crate::registry::types::Registry;

/// Look up the canonical index definition for an inferred index identity.
///
/// Concrete Nat ranges come from the registry; declared indexes come from the
/// DAG's semantic collection refs.
pub(super) fn index_def_for_inferred<'a>(
    index: &InferredIndex,
    dag: Option<&'a crate::tir::typed::DagTIR>,
    registry: &'a Registry,
) -> Option<&'a crate::registry::types::IndexDef> {
    if let Some(nat_range) = index.concrete_nat_range() {
        return registry.indexes.get_nat_range(nat_range);
    }
    let resolved = index.declared_resolved()?;
    dag.map(|dag| &dag.semantic.collection_refs)
        .and_then(|refs| refs.index_defs.get(resolved))
}