Cacher is the code snippet organizer for pro developers

//binary computation tree

//simulates infinite binary tree of pluses using boxes
enum BinComp {
    Int(i32),
    Plus(Box<BinComp>, Box<BinComp>)
}

impl BinComp {
    fn call(self) -> i32 {
        match self {
            BinComp::Int(num) => num,
            BinComp::Plus(l, r) => l.call() + r.call()
        }
    }
}

fn main() {
   let f = BinComp::Plus(Box::new(BinComp::Int(8)), Box::new(BinComp::Int(6)));
   println!("{}", f.call());
   //14
}