Function simple_parallel::one_to_one::unordered_map

pub fn unordered_map<'a, I: IntoIterator, F, T>(scope: &Scope<'a>, iter: I, f: F) -> UnorderedParMap<T> where I::Item: Send + 'a, F: 'a + Send + Sync + Fn(I::Item) -> T, T: Send + 'a

Execute f on each element in iter, with unspecified yield order.

This behaves like simple_parallel::map, but does not make efforts to ensure that the elements are returned in the order of iter, hence this is cheaper.