fn min_candidates(&self) -> usize {
        self.remaining_siblings.as_slice().get(0).map(|&(_, ref candidates, _)| {
            candidates.len()
        }).unwrap_or(0)
    }
/// Returns the least number of candidates that any of this frame's siblings
/// has.
///
/// The `remaining_siblings` array is already sorted with the smallest
/// number of candidates at the front, so we just return the number of
/// candidates in that entry.
Returns the least number of candidates that any of this frame's siblings
has.

The `remaining_siblings` array is already sorted with the smallest
number of candidates at the front, so we just return the number of
candidates in that entry.
Returns the least number of candidates that any of this frame ' s siblings has . The ` remaining_siblings ` array is already sorted with the smallest number of candidates at the front so we just return the number of candidates in that entry .
fn min_candidates(&self) -> usize {
        self.remaining_siblings.as_slice().get(0).map(|&(_, ref candidates, _)| {
            candidates.len()
        }).unwrap_or(0)
    }
fn min_candidates ( & self ) -> usize { self . remaining_siblings . as_slice ( ) . get ( 0 ) . map ( | & ( _ , ref candidates , _ ) | { candidates . len ( ) } ) . unwrap_or ( 0 ) }
Returns the least number of candidates that any of this frame's siblings
has.
Returns the least number of candidates that any of this frame ' s siblings has .
&self
&self