use std::collections::BTreeMap;
use general_spice_core::ast::Statement;
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct DiodeNodes {
pub positive: String,
pub negative: String,
}
pub fn diode_nodes(statements: &[Statement]) -> BTreeMap<String, DiodeNodes> {
let mut result = BTreeMap::new();
for statement in statements {
let Statement::ElementInstance(element) = statement else {
continue;
};
if element.device_letter != 'D' {
continue;
}
if let [positive, negative, ..] = element.nodes.as_slice() {
result.insert(
element.name.clone(),
DiodeNodes {
positive: positive.clone(),
negative: negative.clone(),
},
);
}
}
result
}
pub fn is_ground(node: &str) -> bool {
node == "0" || node.eq_ignore_ascii_case("gnd")
}
pub fn node_index(unknowns: &[String], node: &str) -> Option<usize> {
if is_ground(node) {
return None;
}
let target = node.to_ascii_uppercase();
unknowns.iter().position(|unknown| {
unknown
.strip_prefix("V(")
.and_then(|rest| rest.strip_suffix(')'))
.map(|inner| inner.to_ascii_uppercase())
== Some(target.clone())
})
}