use super::DeterministicRng;
#[test]
-#[cfg(not(miri))] // Miri is too slow
fn test_basic_large() {
let mut map = BTreeMap::new();
+ #[cfg(not(miri))] // Miri is too slow
let size = 10000;
+ #[cfg(miri)]
+ let size = 200;
assert_eq!(map.len(), 0);
for i in 0..size {
#[cfg(not(miri))] // Miri is too slow
let size = 10000;
#[cfg(miri)]
- let size = 100;
+ let size = 200;
// Forwards
let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
#[cfg(not(miri))] // Miri is too slow
let size = 10000;
#[cfg(miri)]
- let size = 100;
+ let size = 200;
// Forwards
let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
#[cfg(not(miri))] // Miri is too slow
let size = 10000;
#[cfg(miri)]
- let size = 100;
+ let size = 200;
// Forwards
let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
#[cfg(not(miri))] // Miri is too slow
let size = 1000;
#[cfg(miri)]
- let size = 100;
+ let size = 200;
let map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
fn test(map: &BTreeMap<u32, u32>, size: u32, min: Bound<&u32>, max: Bound<&u32>) {
#[cfg(not(miri))] // Miri is too slow
let size = 200;
#[cfg(miri)]
- let size = 20;
+ let size = 30;
let map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
for i in 0..size {
#[cfg(not(miri))] // Miri is too slow
let size = 200;
#[cfg(miri)]
- let size = 20;
+ let size = 30;
let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
for i in 0..size {
#[cfg(not(miri))] // Miri is too slow
let size = 100;
#[cfg(miri)]
- let size = 20;
+ let size = 30;
assert_eq!(map.len(), 0);
for i in 0..size {