Function libbruteforce::symbols::combinations_count

pub fn combinations_count(
    alphabet: &[char], 
    max_length: u32, 
    min_length: u32
) -> usize

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