Function prime_tools::get_prime_factors_with_counts

pub fn get_prime_factors_with_counts(
    x: u32, 
    primes: &Vec<u32>
) -> HashMap<u32, u32>

Creates a map of prime factors -> prime factor counts.

To be used with get_primes_less_than_x.

Note: This will misbehave if any primes < √x are not included in primes.

Examples

use std::collections::HashMap;
let primes = prime_tools::get_primes_less_than_x(12);

let mut result = HashMap::new();
result.insert(2, 3);
result.insert(3, 1);
result.insert(5, 1);

assert_eq!(
    prime_tools::get_prime_factors_with_counts(
           120, 
           &primes
       ),
    result
);

use std::collections::HashMap;
let primes = prime_tools::get_primes_less_than_x(11);

let mut result = HashMap::new();
result.insert(101, 1);

assert_eq!(
    prime_tools::get_prime_factors_with_counts(
           101,
           &primes
       ),
    result
);