Function fit 

pub fn fit(samples: &mut [(TimingGraph, f64)], candidates: &[Delays]) -> Fitted

The delays under which each graph’s depth comes nearest its measured depth (in the unit a delay of 100 is one of): of candidates, each scaled by the factor that fits it best. A candidate’s ratios choose every critical path, and a graph’s depth scales with all its delays together, so the best scale is the geometric mean of measure over depth, applied to every delay; the error is the root mean square of each log ratio of prediction to measure. Each graph is left reweighed to the delays fitted. The graphs are read from netlists and loop through no logic without a register; every measure is positive.