pub fn project(race: &Race, dice: &Dice) -> Chances {
    let mut tree = Tree::singleton(race.clone());
    tree.expand(dice);

    let mut counter: LeafCounter = Default::default();
    tree.visit_leaves(&mut counter);

    counter.chances()
}
/// Determines the win chances for each camel.
///
/// The `Distribution` returns for each camel present in the race, the chance of winning.
Determines the win chances for each camel.
The `Distribution` returns for each camel present in the race, the chance of winning.
Determines the win chances for each camel . The ` Distribution ` returns for each camel present in the race the chance of winning .
pub fn project(race: &Race, dice: &Dice) -> Chances {
    let mut tree = Tree::singleton(race.clone());
    tree.expand(dice);
    let mut counter: LeafCounter = Default::default();
    tree.visit_leaves(&mut counter);
    counter.chances()
}
pub fn project ( race : & Race , dice : & Dice ) -> Chances { let mut tree = Tree :: singleton ( race . clone ( ) ) ; tree . expand ( dice ) ; let mut counter : LeafCounter = Default :: default ( ) ; tree . visit_leaves ( & mut counter ) ; counter . chances ( ) }
Determines the win chances for each camel.
Determines the win chances for each camel .
race
&Race
dice
&Dice
race
&Race
dice
&Dice