Function function 

pub fn function(xag: &Xag, root: u32, leaves: &[u32]) -> u64

The truth table of root over leaves (at most six): bit i of the table is the root’s value when leaf j holds bit j of i. Every path from the root down must end at a leaf, as a cut’s do.