     1
     2
     3
     4
     5
     6
     7
     8
     9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20
    21
    22
    23
    24
    25
    26
    27
    28
    29
    30
    31
    32
    33
    34
    35
    36
    37
    38
    39
    40
    41
    42
    43
    44
    45
    46
    47
    48
    49
    50
    51
    52
    53
    54
    55
    56
    57
    58
    59
    60
    61
    62
    63
    64
    65
    66
    67
    68
    69
    70
    71
    72
    73
    74
    75
    76
    77
    78
    79

    // Copyright 2015-2017 Parity Technologies (UK) Ltd.
    // This file is part of Parity.

    // Parity is free software: you can redistribute it and/or modify
    // it under the terms of the GNU General Public License as published by
    // the Free Software Foundation, either version 3 of the License, or
    // (at your option) any later version.

    // Parity is distributed in the hope that it will be useful,
    // but WITHOUT ANY WARRANTY; without even the implied warranty of
    // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    // GNU General Public License for more details.

    // You should have received a copy of the GNU General Public License
    // along with Parity.  If not, see <http://www.gnu.org/licenses/>.

    use rand::{Rng, OsRng};
    use itertools::Itertools;

    pub trait Random {
    	fn random() -> Self where Self: Sized;
    }

    impl Random for [u8; 16] {
    	fn random() -> Self {
    		let mut result = [0u8; 16];
    		let mut rng = OsRng::new().unwrap();
    		rng.fill_bytes(&mut result);
    		result
    	}
    }

    impl Random for [u8; 32] {
    	fn random() -> Self {
    		let mut result = [0u8; 32];
    		let mut rng = OsRng::new().unwrap();
    		rng.fill_bytes(&mut result);
    		result
    	}
    }

    /// Generate a string which is a random phrase of a number of lowercase words.
    ///
    /// `words` is the number of words, chosen from a dictionary of 7,530. An value of
    /// 12 gives 155 bits of entropy (almost saturating address space); 20 gives 258 bits
    /// which is enough to saturate 32-byte key space
    pub fn random_phrase(words: usize) -> String {
    	lazy_static! {
    		static ref WORDS: Vec<String> = String::from_utf8_lossy(include_bytes!("../res/wordlist.txt"))
    			.lines()
    			.map(|s| s.to_owned())
    			.collect();
    	}
    	let mut rng = OsRng::new().expect("Not able to operate without random source.");
    	(0..words).map(|_| rng.choose(&WORDS).unwrap()).join(" ")
    }

    /// Generate a random string of given length.
    pub fn random_string(length: usize) -> String {
    	let mut rng = OsRng::new().expect("Not able to operate without random source.");
    	rng.gen_ascii_chars().take(length).collect()
    }

    #[cfg(test)]
    mod tests {
    	use super::random_phrase;

    	#[test]
    	fn should_produce_right_number_of_words() {
    		let p = random_phrase(10);
    		assert_eq!(p.split(" ").count(), 10);
    	}

    	#[test]
    	fn should_not_include_carriage_return() {
    		let p = random_phrase(10);
    		assert!(!p.contains('\r'), "Carriage return should be trimmed.");
    	}
    }

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result
+
  Collapse/expand all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)