Function bitwise 

pub fn bitwise<T>(table: u8, x: T, y: T) -> T
where
    T: Clone + BitAnd<Output = T> + BitOr<Output = T> + BitXor<Output = T> + Not<Output = T>,

Applies the Boolean function whose truth table is table, indexed by 2*x+y, to every bit of x and y, the leading sign bits included. It computes the table’s algebraic normal form, a0 ^ (a1 & x) ^ (a2 & y) ^ (a3 & x & y), with each coefficient spread to every bit, so every table runs the same code. A match on the table would put 16 paths into each loop that inlines it. It takes any integer type, exact ones included.