Function libbruteforce::symbols::combinations_count

pub fn combinations_count(alphabet: &Box<[char]>, length: u32) -> usize

Calculates the amount of possible permutations if n symbols are given and m slots are available. Be aware that this solutions counts in that a password can be zero-length, one-length and so on.