Lines Matching defs:random
1810 fn random(n: usize) -> BTreeSet<usize> {
2011 set_bench! {intersection_random_100_vs_100, intersection, count, [random(100), random(100)]}
2012 set_bench! {intersection_random_100_vs_10k, intersection, count, [random(100), random(10_000)]}
2013 set_bench! {intersection_random_10k_vs_100, intersection, count, [random(10_000), random(100)]}
2014 set_bench! {intersection_random_10k_vs_10k, intersection, count, [random(10_000), random(10_000)]}
2018 set_bench! {difference_random_100_vs_100, difference, count, [random(100), random(100)]}
2019 set_bench! {difference_random_100_vs_10k, difference, count, [random(100), random(10_000)]}
2020 set_bench! {difference_random_10k_vs_100, difference, count, [random(10_000), random(100)]}
2021 set_bench! {difference_random_10k_vs_10k, difference, count, [random(10_000), random(10_000)]}
9689 // Sort using a completely random comparison function.
9722 // where the first item of each tuple is random, but
29847 /// and possibly other factors. Using linear search, searching for a random element is expected
29917 /// // could actually return some random value here - let's just return
34982 // Which also means it returns different predetermined pseudo-random keys,
44461 /// // a random order.