pub fn pairs(pairs: &[(&str, &str)]) -> Key {
        debug_assert!(pairs.iter().zip(pairs.iter().skip(1))
            .all(|(&(a, _), &(b, _))| a < b));
        Key::from_iter(pairs.iter().cloned())
    }
/// Creates a key from list of pairs, asserts that pairs are in right
/// order. This method is inteded to be used with literal values put in
/// the code, so it should be easy to put them in the right order
Creates a key from list of pairs, asserts that pairs are in right
order. This method is inteded to be used with literal values put in
the code, so it should be easy to put them in the right order
Creates a key from list of pairs asserts that pairs are in right order . This method is inteded to be used with literal values put in the code so it should be easy to put them in the right order
pub fn pairs(pairs: &[(&str, &str)]) -> Key {
        debug_assert!(pairs.iter().zip(pairs.iter().skip(1))
            .all(|(&(a, _), &(b, _))| a < b));
        Key::from_iter(pairs.iter().cloned())
    }
pub fn pairs ( pairs : & [ ( & str , & str ) ] ) -> Key { debug_assert ! ( pairs iter ( ) zip ( pairs iter ( ) skip ( 1 ) ) all ( ( ( a ) ( b ) ) a b ) ) ; Key :: from_iter ( pairs . iter ( ) . cloned ( ) ) }
Creates a key from list of pairs, asserts that pairs are in right
order.
Creates a key from list of pairs asserts that pairs are in right order .
pairs
&[(&str, &str)]
pairs
&[(&str, &str)]