ellmau/adf-obdd
1
0
Fork 0
mirror of https://github.com/ellmau/adf-obdd.git synced 2025-12-19 09:29:36 +01:00
Code Issues Projects Releases Wiki Activity

dbg args in target function.

Browse Source
This commit is contained in:
drwadu 2022-04-05 11:50:21 +02:00
parent 99957cec7d
commit c0c05b2789
1 changed files with 16 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
lib/src/adf.rs
View File

@ -388,6 +388,7 @@ impl Adf {
} }
fn two_val_model_counts(&mut self, interpr: &[Term]) -> Vec<Vec<Term>> { fn two_val_model_counts(&mut self, interpr: &[Term]) -> Vec<Vec<Term>> {
// base case
self.two_val_model_counts_logic(interpr, &vec![Term::UND; interpr.len()], 0) self.two_val_model_counts_logic(interpr, &vec![Term::UND; interpr.len()], 0)
} }
@ -397,7 +398,22 @@ impl Adf {
will_be: &[Term], will_be: &[Term],
depth: usize, depth: usize,
) -> Vec<Vec<Term>> { ) -> Vec<Vec<Term>> {
log::debug!("interpr: {:?}", &interpr);
#[cfg(feature = "debug")]
interpr.iter().enumerate().for_each(|(i, t)| {
log::debug!("idx={:?} paths: {:?}", i, self.bdd.paths(t, true));
log::debug!(
"idx={:?} var_impact: {:?}",
i,
self.bdd.var_impact(Var(i), &interpr)
);
log::debug!("idx={:?} max_depth: {:?}", i, self.bdd.max_depth(t));
});
log::debug!("will_be: {:?}", &will_be);
log::debug!("two_val_model_recursion_depth: {}/{}", depth, interpr.len()); log::debug!("two_val_model_recursion_depth: {}/{}", depth, interpr.len());
if let Some((idx, ac)) = interpr if let Some((idx, ac)) = interpr
.iter() .iter()
.enumerate() .enumerate()