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
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148

use std::collections::BTreeMap;

#[derive(Debug, Default)]
pub struct File {
    pub uses: Vec<Use>,
    pub model: Model,
}

#[derive(Debug)]
pub struct Use {
    pub model: String,
    pub origin: UseOrigin,
}

#[derive(Debug)]
pub enum UseOrigin {
    Site(String),
    User(String),
    Local,
}

#[derive(Debug, Default)]
pub struct Model {
    pub name: String,
    pub inner: ModelInner,
    pub is_extern: bool,
}

#[derive(Debug, Default)]
pub struct ModelInner {
    pub variables: Vec<Variable>,
    pub children: Vec<Model>,
    pub graph: Vec<Graph>,
}

#[derive(Clone, Debug, Default)]
pub struct Variable {
    pub name: Option<String>,
    pub description: String,
    pub default: Option<Value>,
    pub is_model: bool,
}

#[derive(Clone, Debug)]
pub enum Value {
    Bool(bool),
    Int(i64),
    UInt(u64),
    Real(f64),
    Model(String),
}

#[derive(Debug, Default)]
pub struct Graph {
    pub id: Node,
    pub passes: Vec<GraphPass>,
    pub inline: Option<Model>,
    pub shapes: Option<Shapes>,
}

#[derive(Debug, Default)]
pub struct GraphPass {
    pub name: String,
    pub args: Vec<GraphPassArg>,
    pub repeat: u64,
}

#[derive(Clone, Debug)]
pub enum GraphPassArg {
    NodeArg(Vec<NodeArg>),
    Keyword { name: String, value: Value },
}

impl GraphPassArg {
    pub fn is_named(&self, name: &str) -> bool {
        match self {
            Self::Keyword {
                name: k_name,
                value: _,
            } => name == k_name,
            _ => false,
        }
    }

    pub fn unwrap_name(&self) -> &str {
        match self {
            Self::Keyword { name, value: _ } => name,
            _ => unreachable!(),
        }
    }

    pub fn unwrap_value(&self) -> &Value {
        match self {
            Self::Keyword { name: _, value } => value,
            _ => unreachable!(),
        }
    }
}

#[derive(Debug, Default)]
pub struct Shapes(pub BTreeMap<Node, Shape>);

impl Shapes {
    pub(crate) fn one(shape: Shape) -> Self {
        Self(vec![(0u64, shape)].into_iter().collect())
    }

    pub(crate) fn many(shapes: Vec<(u64, Shape)>) -> Self {
        Self(shapes.into_iter().collect())
    }
}

#[derive(Debug, Default)]
pub struct Shape(pub Vec<Dim>);

#[derive(Clone, Debug)]
pub enum Dim {
    Fixed(u64),
    Semantic(String),
    Expr {
        lhs: Box<Dim>,
        rhs: Box<Dim>,
        op: DimOp,
    },
}

#[derive(Copy, Clone, Debug)]
pub enum DimOp {
    Add,
    Sub,
    Mul,
    Div,
}

pub mod temp {
    pub struct VariableNameDesc {
        pub name: Option<String>,
        pub description: String,
    }
}

#[derive(Copy, Clone, Debug)]
pub struct NodeArg {
    pub node: Node,
    pub arg: Node,
}

pub type Node = u64;