| use std::collections::btree_map::Entry::{Occupied, Vacant}; |
| use std::collections::BTreeMap; |
| use std::convert::TryFrom; |
| use std::fmt::Debug; |
| use std::iter::FromIterator; |
| use std::ops::Bound::{self, Excluded, Included, Unbounded}; |
| use std::ops::RangeBounds; |
| use std::rc::Rc; |
| |
| use super::DeterministicRng; |
| |
| #[test] |
| 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 { |
| assert_eq!(map.insert(i, 10 * i), None); |
| assert_eq!(map.len(), i + 1); |
| } |
| |
| assert_eq!(map.first_key_value(), Some((&0, &0))); |
| assert_eq!(map.last_key_value(), Some((&(size - 1), &(10 * (size - 1))))); |
| assert_eq!(map.first_entry().unwrap().key(), &0); |
| assert_eq!(map.last_entry().unwrap().key(), &(size - 1)); |
| |
| for i in 0..size { |
| assert_eq!(map.get(&i).unwrap(), &(i * 10)); |
| } |
| |
| for i in size..size * 2 { |
| assert_eq!(map.get(&i), None); |
| } |
| |
| for i in 0..size { |
| assert_eq!(map.insert(i, 100 * i), Some(10 * i)); |
| assert_eq!(map.len(), size); |
| } |
| |
| for i in 0..size { |
| assert_eq!(map.get(&i).unwrap(), &(i * 100)); |
| } |
| |
| for i in 0..size / 2 { |
| assert_eq!(map.remove(&(i * 2)), Some(i * 200)); |
| assert_eq!(map.len(), size - i - 1); |
| } |
| |
| for i in 0..size / 2 { |
| assert_eq!(map.get(&(2 * i)), None); |
| assert_eq!(map.get(&(2 * i + 1)).unwrap(), &(i * 200 + 100)); |
| } |
| |
| for i in 0..size / 2 { |
| assert_eq!(map.remove(&(2 * i)), None); |
| assert_eq!(map.remove(&(2 * i + 1)), Some(i * 200 + 100)); |
| assert_eq!(map.len(), size / 2 - i - 1); |
| } |
| } |
| |
| #[test] |
| fn test_basic_small() { |
| let mut map = BTreeMap::new(); |
| // Empty, shared root: |
| assert_eq!(map.remove(&1), None); |
| assert_eq!(map.len(), 0); |
| assert_eq!(map.get(&1), None); |
| assert_eq!(map.get_mut(&1), None); |
| assert_eq!(map.first_key_value(), None); |
| assert_eq!(map.last_key_value(), None); |
| assert_eq!(map.keys().count(), 0); |
| assert_eq!(map.values().count(), 0); |
| assert_eq!(map.range(..).next(), None); |
| assert_eq!(map.range(..1).next(), None); |
| assert_eq!(map.range(1..).next(), None); |
| assert_eq!(map.range(1..=1).next(), None); |
| assert_eq!(map.range(1..2).next(), None); |
| assert_eq!(map.insert(1, 1), None); |
| |
| // 1 key-value pair: |
| assert_eq!(map.len(), 1); |
| assert_eq!(map.get(&1), Some(&1)); |
| assert_eq!(map.get_mut(&1), Some(&mut 1)); |
| assert_eq!(map.first_key_value(), Some((&1, &1))); |
| assert_eq!(map.last_key_value(), Some((&1, &1))); |
| assert_eq!(map.keys().collect::<Vec<_>>(), vec![&1]); |
| assert_eq!(map.values().collect::<Vec<_>>(), vec![&1]); |
| assert_eq!(map.insert(1, 2), Some(1)); |
| assert_eq!(map.len(), 1); |
| assert_eq!(map.get(&1), Some(&2)); |
| assert_eq!(map.get_mut(&1), Some(&mut 2)); |
| assert_eq!(map.first_key_value(), Some((&1, &2))); |
| assert_eq!(map.last_key_value(), Some((&1, &2))); |
| assert_eq!(map.keys().collect::<Vec<_>>(), vec![&1]); |
| assert_eq!(map.values().collect::<Vec<_>>(), vec![&2]); |
| assert_eq!(map.insert(2, 4), None); |
| |
| // 2 key-value pairs: |
| assert_eq!(map.len(), 2); |
| assert_eq!(map.get(&2), Some(&4)); |
| assert_eq!(map.get_mut(&2), Some(&mut 4)); |
| assert_eq!(map.first_key_value(), Some((&1, &2))); |
| assert_eq!(map.last_key_value(), Some((&2, &4))); |
| assert_eq!(map.keys().collect::<Vec<_>>(), vec![&1, &2]); |
| assert_eq!(map.values().collect::<Vec<_>>(), vec![&2, &4]); |
| assert_eq!(map.remove(&1), Some(2)); |
| |
| // 1 key-value pair: |
| assert_eq!(map.len(), 1); |
| assert_eq!(map.get(&1), None); |
| assert_eq!(map.get_mut(&1), None); |
| assert_eq!(map.get(&2), Some(&4)); |
| assert_eq!(map.get_mut(&2), Some(&mut 4)); |
| assert_eq!(map.first_key_value(), Some((&2, &4))); |
| assert_eq!(map.last_key_value(), Some((&2, &4))); |
| assert_eq!(map.keys().collect::<Vec<_>>(), vec![&2]); |
| assert_eq!(map.values().collect::<Vec<_>>(), vec![&4]); |
| assert_eq!(map.remove(&2), Some(4)); |
| |
| // Empty but private root: |
| assert_eq!(map.len(), 0); |
| assert_eq!(map.get(&1), None); |
| assert_eq!(map.get_mut(&1), None); |
| assert_eq!(map.first_key_value(), None); |
| assert_eq!(map.last_key_value(), None); |
| assert_eq!(map.keys().count(), 0); |
| assert_eq!(map.values().count(), 0); |
| assert_eq!(map.range(..).next(), None); |
| assert_eq!(map.range(..1).next(), None); |
| assert_eq!(map.range(1..).next(), None); |
| assert_eq!(map.range(1..=1).next(), None); |
| assert_eq!(map.range(1..2).next(), None); |
| assert_eq!(map.remove(&1), None); |
| } |
| |
| #[test] |
| fn test_iter() { |
| #[cfg(not(miri))] // Miri is too slow |
| let size = 10000; |
| #[cfg(miri)] |
| let size = 200; |
| |
| let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect(); |
| |
| fn test<T>(size: usize, mut iter: T) |
| where |
| T: Iterator<Item = (usize, usize)>, |
| { |
| for i in 0..size { |
| assert_eq!(iter.size_hint(), (size - i, Some(size - i))); |
| assert_eq!(iter.next().unwrap(), (i, i)); |
| } |
| assert_eq!(iter.size_hint(), (0, Some(0))); |
| assert_eq!(iter.next(), None); |
| } |
| test(size, map.iter().map(|(&k, &v)| (k, v))); |
| test(size, map.iter_mut().map(|(&k, &mut v)| (k, v))); |
| test(size, map.into_iter()); |
| } |
| |
| #[test] |
| fn test_iter_rev() { |
| #[cfg(not(miri))] // Miri is too slow |
| let size = 10000; |
| #[cfg(miri)] |
| let size = 200; |
| |
| let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect(); |
| |
| fn test<T>(size: usize, mut iter: T) |
| where |
| T: Iterator<Item = (usize, usize)>, |
| { |
| for i in 0..size { |
| assert_eq!(iter.size_hint(), (size - i, Some(size - i))); |
| assert_eq!(iter.next().unwrap(), (size - i - 1, size - i - 1)); |
| } |
| assert_eq!(iter.size_hint(), (0, Some(0))); |
| assert_eq!(iter.next(), None); |
| } |
| test(size, map.iter().rev().map(|(&k, &v)| (k, v))); |
| test(size, map.iter_mut().rev().map(|(&k, &mut v)| (k, v))); |
| test(size, map.into_iter().rev()); |
| } |
| |
| /// Specifically tests iter_mut's ability to mutate the value of pairs in-line |
| fn do_test_iter_mut_mutation<T>(size: usize) |
| where |
| T: Copy + Debug + Ord + TryFrom<usize>, |
| <T as std::convert::TryFrom<usize>>::Error: std::fmt::Debug, |
| { |
| let zero = T::try_from(0).unwrap(); |
| let mut map: BTreeMap<T, T> = (0..size).map(|i| (T::try_from(i).unwrap(), zero)).collect(); |
| |
| // Forward and backward iteration sees enough pairs (also tested elsewhere) |
| assert_eq!(map.iter_mut().count(), size); |
| assert_eq!(map.iter_mut().rev().count(), size); |
| |
| // Iterate forwards, trying to mutate to unique values |
| for (i, (k, v)) in map.iter_mut().enumerate() { |
| assert_eq!(*k, T::try_from(i).unwrap()); |
| assert_eq!(*v, zero); |
| *v = T::try_from(i + 1).unwrap(); |
| } |
| |
| // Iterate backwards, checking that mutations succeeded and trying to mutate again |
| for (i, (k, v)) in map.iter_mut().rev().enumerate() { |
| assert_eq!(*k, T::try_from(size - i - 1).unwrap()); |
| assert_eq!(*v, T::try_from(size - i).unwrap()); |
| *v = T::try_from(2 * size - i).unwrap(); |
| } |
| |
| // Check that backward mutations succeeded |
| for (i, (k, v)) in map.iter_mut().enumerate() { |
| assert_eq!(*k, T::try_from(i).unwrap()); |
| assert_eq!(*v, T::try_from(size + i + 1).unwrap()); |
| } |
| } |
| |
| #[derive(Clone, Copy, Debug, Eq, PartialEq, PartialOrd, Ord)] |
| #[repr(align(32))] |
| struct Align32(usize); |
| |
| impl TryFrom<usize> for Align32 { |
| type Error = (); |
| |
| fn try_from(s: usize) -> Result<Align32, ()> { |
| Ok(Align32(s)) |
| } |
| } |
| |
| #[test] |
| fn test_iter_mut_mutation() { |
| // Check many alignments because various fields precede array in NodeHeader. |
| // Check with size 0 which should not iterate at all. |
| // Check with size 1 for a tree with one kind of node (root = leaf). |
| // Check with size 12 for a tree with two kinds of nodes (root and leaves). |
| // Check with size 144 for a tree with all kinds of nodes (root, internals and leaves). |
| do_test_iter_mut_mutation::<u8>(0); |
| do_test_iter_mut_mutation::<u8>(1); |
| do_test_iter_mut_mutation::<u8>(12); |
| do_test_iter_mut_mutation::<u8>(127); // not enough unique values to test 144 |
| do_test_iter_mut_mutation::<u16>(1); |
| do_test_iter_mut_mutation::<u16>(12); |
| do_test_iter_mut_mutation::<u16>(144); |
| do_test_iter_mut_mutation::<u32>(1); |
| do_test_iter_mut_mutation::<u32>(12); |
| do_test_iter_mut_mutation::<u32>(144); |
| do_test_iter_mut_mutation::<u64>(1); |
| do_test_iter_mut_mutation::<u64>(12); |
| do_test_iter_mut_mutation::<u64>(144); |
| do_test_iter_mut_mutation::<u128>(1); |
| do_test_iter_mut_mutation::<u128>(12); |
| do_test_iter_mut_mutation::<u128>(144); |
| do_test_iter_mut_mutation::<Align32>(1); |
| do_test_iter_mut_mutation::<Align32>(12); |
| do_test_iter_mut_mutation::<Align32>(144); |
| } |
| |
| #[test] |
| fn test_into_key_slice_with_shared_root_past_bounds() { |
| let mut map: BTreeMap<Align32, ()> = BTreeMap::new(); |
| assert_eq!(map.get(&Align32(1)), None); |
| assert_eq!(map.get_mut(&Align32(1)), None); |
| } |
| |
| #[test] |
| fn test_values_mut() { |
| let mut a = BTreeMap::new(); |
| a.insert(1, String::from("hello")); |
| a.insert(2, String::from("goodbye")); |
| |
| for value in a.values_mut() { |
| value.push_str("!"); |
| } |
| |
| let values: Vec<String> = a.values().cloned().collect(); |
| assert_eq!(values, [String::from("hello!"), String::from("goodbye!")]); |
| } |
| |
| #[test] |
| fn test_iter_mixed() { |
| #[cfg(not(miri))] // Miri is too slow |
| let size = 10000; |
| #[cfg(miri)] |
| let size = 200; |
| |
| let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect(); |
| |
| fn test<T>(size: usize, mut iter: T) |
| where |
| T: Iterator<Item = (usize, usize)> + DoubleEndedIterator, |
| { |
| for i in 0..size / 4 { |
| assert_eq!(iter.size_hint(), (size - i * 2, Some(size - i * 2))); |
| assert_eq!(iter.next().unwrap(), (i, i)); |
| assert_eq!(iter.next_back().unwrap(), (size - i - 1, size - i - 1)); |
| } |
| for i in size / 4..size * 3 / 4 { |
| assert_eq!(iter.size_hint(), (size * 3 / 4 - i, Some(size * 3 / 4 - i))); |
| assert_eq!(iter.next().unwrap(), (i, i)); |
| } |
| assert_eq!(iter.size_hint(), (0, Some(0))); |
| assert_eq!(iter.next(), None); |
| } |
| test(size, map.iter().map(|(&k, &v)| (k, v))); |
| test(size, map.iter_mut().map(|(&k, &mut v)| (k, v))); |
| test(size, map.into_iter()); |
| } |
| |
| fn range_keys(map: &BTreeMap<i32, i32>, range: impl RangeBounds<i32>) -> Vec<i32> { |
| map.range(range) |
| .map(|(&k, &v)| { |
| assert_eq!(k, v); |
| k |
| }) |
| .collect() |
| } |
| |
| #[test] |
| fn test_range_small() { |
| let size = 4; |
| |
| let map: BTreeMap<_, _> = (1..=size).map(|i| (i, i)).collect(); |
| let all: Vec<_> = (1..=size).collect(); |
| let (first, last) = (vec![all[0]], vec![all[size as usize - 1]]); |
| |
| assert_eq!(range_keys(&map, (Excluded(0), Excluded(size + 1))), all); |
| assert_eq!(range_keys(&map, (Excluded(0), Included(size + 1))), all); |
| assert_eq!(range_keys(&map, (Excluded(0), Included(size))), all); |
| assert_eq!(range_keys(&map, (Excluded(0), Unbounded)), all); |
| assert_eq!(range_keys(&map, (Included(0), Excluded(size + 1))), all); |
| assert_eq!(range_keys(&map, (Included(0), Included(size + 1))), all); |
| assert_eq!(range_keys(&map, (Included(0), Included(size))), all); |
| assert_eq!(range_keys(&map, (Included(0), Unbounded)), all); |
| assert_eq!(range_keys(&map, (Included(1), Excluded(size + 1))), all); |
| assert_eq!(range_keys(&map, (Included(1), Included(size + 1))), all); |
| assert_eq!(range_keys(&map, (Included(1), Included(size))), all); |
| assert_eq!(range_keys(&map, (Included(1), Unbounded)), all); |
| assert_eq!(range_keys(&map, (Unbounded, Excluded(size + 1))), all); |
| assert_eq!(range_keys(&map, (Unbounded, Included(size + 1))), all); |
| assert_eq!(range_keys(&map, (Unbounded, Included(size))), all); |
| assert_eq!(range_keys(&map, ..), all); |
| |
| assert_eq!(range_keys(&map, (Excluded(0), Excluded(1))), vec![]); |
| assert_eq!(range_keys(&map, (Excluded(0), Included(0))), vec![]); |
| assert_eq!(range_keys(&map, (Included(0), Included(0))), vec![]); |
| assert_eq!(range_keys(&map, (Included(0), Excluded(1))), vec![]); |
| assert_eq!(range_keys(&map, (Unbounded, Excluded(1))), vec![]); |
| assert_eq!(range_keys(&map, (Unbounded, Included(0))), vec![]); |
| assert_eq!(range_keys(&map, (Excluded(0), Excluded(2))), first); |
| assert_eq!(range_keys(&map, (Excluded(0), Included(1))), first); |
| assert_eq!(range_keys(&map, (Included(0), Excluded(2))), first); |
| assert_eq!(range_keys(&map, (Included(0), Included(1))), first); |
| assert_eq!(range_keys(&map, (Included(1), Excluded(2))), first); |
| assert_eq!(range_keys(&map, (Included(1), Included(1))), first); |
| assert_eq!(range_keys(&map, (Unbounded, Excluded(2))), first); |
| assert_eq!(range_keys(&map, (Unbounded, Included(1))), first); |
| assert_eq!(range_keys(&map, (Excluded(size - 1), Excluded(size + 1))), last); |
| assert_eq!(range_keys(&map, (Excluded(size - 1), Included(size + 1))), last); |
| assert_eq!(range_keys(&map, (Excluded(size - 1), Included(size))), last); |
| assert_eq!(range_keys(&map, (Excluded(size - 1), Unbounded)), last); |
| assert_eq!(range_keys(&map, (Included(size), Excluded(size + 1))), last); |
| assert_eq!(range_keys(&map, (Included(size), Included(size + 1))), last); |
| assert_eq!(range_keys(&map, (Included(size), Included(size))), last); |
| assert_eq!(range_keys(&map, (Included(size), Unbounded)), last); |
| assert_eq!(range_keys(&map, (Excluded(size), Excluded(size + 1))), vec![]); |
| assert_eq!(range_keys(&map, (Excluded(size), Included(size))), vec![]); |
| assert_eq!(range_keys(&map, (Excluded(size), Unbounded)), vec![]); |
| assert_eq!(range_keys(&map, (Included(size + 1), Excluded(size + 1))), vec![]); |
| assert_eq!(range_keys(&map, (Included(size + 1), Included(size + 1))), vec![]); |
| assert_eq!(range_keys(&map, (Included(size + 1), Unbounded)), vec![]); |
| |
| assert_eq!(range_keys(&map, ..3), vec![1, 2]); |
| assert_eq!(range_keys(&map, 3..), vec![3, 4]); |
| assert_eq!(range_keys(&map, 2..=3), vec![2, 3]); |
| } |
| |
| #[test] |
| fn test_range_depth_2() { |
| // Assuming that node.CAPACITY is 11, having 12 pairs implies a depth 2 tree |
| // with 2 leaves. Depending on details we don't want or need to rely upon, |
| // the single key at the root will be 6 or 7. |
| |
| let map: BTreeMap<_, _> = (1..=12).map(|i| (i, i)).collect(); |
| for &root in &[6, 7] { |
| assert_eq!(range_keys(&map, (Excluded(root), Excluded(root + 1))), vec![]); |
| assert_eq!(range_keys(&map, (Excluded(root), Included(root + 1))), vec![root + 1]); |
| assert_eq!(range_keys(&map, (Included(root), Excluded(root + 1))), vec![root]); |
| assert_eq!(range_keys(&map, (Included(root), Included(root + 1))), vec![root, root + 1]); |
| |
| assert_eq!(range_keys(&map, (Excluded(root - 1), Excluded(root))), vec![]); |
| assert_eq!(range_keys(&map, (Included(root - 1), Excluded(root))), vec![root - 1]); |
| assert_eq!(range_keys(&map, (Excluded(root - 1), Included(root))), vec![root]); |
| assert_eq!(range_keys(&map, (Included(root - 1), Included(root))), vec![root - 1, root]); |
| } |
| } |
| |
| #[test] |
| fn test_range_large() { |
| let size = 200; |
| |
| let map: BTreeMap<_, _> = (1..=size).map(|i| (i, i)).collect(); |
| let all: Vec<_> = (1..=size).collect(); |
| let (first, last) = (vec![all[0]], vec![all[size as usize - 1]]); |
| |
| assert_eq!(range_keys(&map, (Excluded(0), Excluded(size + 1))), all); |
| assert_eq!(range_keys(&map, (Excluded(0), Included(size + 1))), all); |
| assert_eq!(range_keys(&map, (Excluded(0), Included(size))), all); |
| assert_eq!(range_keys(&map, (Excluded(0), Unbounded)), all); |
| assert_eq!(range_keys(&map, (Included(0), Excluded(size + 1))), all); |
| assert_eq!(range_keys(&map, (Included(0), Included(size + 1))), all); |
| assert_eq!(range_keys(&map, (Included(0), Included(size))), all); |
| assert_eq!(range_keys(&map, (Included(0), Unbounded)), all); |
| assert_eq!(range_keys(&map, (Included(1), Excluded(size + 1))), all); |
| assert_eq!(range_keys(&map, (Included(1), Included(size + 1))), all); |
| assert_eq!(range_keys(&map, (Included(1), Included(size))), all); |
| assert_eq!(range_keys(&map, (Included(1), Unbounded)), all); |
| assert_eq!(range_keys(&map, (Unbounded, Excluded(size + 1))), all); |
| assert_eq!(range_keys(&map, (Unbounded, Included(size + 1))), all); |
| assert_eq!(range_keys(&map, (Unbounded, Included(size))), all); |
| assert_eq!(range_keys(&map, ..), all); |
| |
| assert_eq!(range_keys(&map, (Excluded(0), Excluded(1))), vec![]); |
| assert_eq!(range_keys(&map, (Excluded(0), Included(0))), vec![]); |
| assert_eq!(range_keys(&map, (Included(0), Included(0))), vec![]); |
| assert_eq!(range_keys(&map, (Included(0), Excluded(1))), vec![]); |
| assert_eq!(range_keys(&map, (Unbounded, Excluded(1))), vec![]); |
| assert_eq!(range_keys(&map, (Unbounded, Included(0))), vec![]); |
| assert_eq!(range_keys(&map, (Excluded(0), Excluded(2))), first); |
| assert_eq!(range_keys(&map, (Excluded(0), Included(1))), first); |
| assert_eq!(range_keys(&map, (Included(0), Excluded(2))), first); |
| assert_eq!(range_keys(&map, (Included(0), Included(1))), first); |
| assert_eq!(range_keys(&map, (Included(1), Excluded(2))), first); |
| assert_eq!(range_keys(&map, (Included(1), Included(1))), first); |
| assert_eq!(range_keys(&map, (Unbounded, Excluded(2))), first); |
| assert_eq!(range_keys(&map, (Unbounded, Included(1))), first); |
| assert_eq!(range_keys(&map, (Excluded(size - 1), Excluded(size + 1))), last); |
| assert_eq!(range_keys(&map, (Excluded(size - 1), Included(size + 1))), last); |
| assert_eq!(range_keys(&map, (Excluded(size - 1), Included(size))), last); |
| assert_eq!(range_keys(&map, (Excluded(size - 1), Unbounded)), last); |
| assert_eq!(range_keys(&map, (Included(size), Excluded(size + 1))), last); |
| assert_eq!(range_keys(&map, (Included(size), Included(size + 1))), last); |
| assert_eq!(range_keys(&map, (Included(size), Included(size))), last); |
| assert_eq!(range_keys(&map, (Included(size), Unbounded)), last); |
| assert_eq!(range_keys(&map, (Excluded(size), Excluded(size + 1))), vec![]); |
| assert_eq!(range_keys(&map, (Excluded(size), Included(size))), vec![]); |
| assert_eq!(range_keys(&map, (Excluded(size), Unbounded)), vec![]); |
| assert_eq!(range_keys(&map, (Included(size + 1), Excluded(size + 1))), vec![]); |
| assert_eq!(range_keys(&map, (Included(size + 1), Included(size + 1))), vec![]); |
| assert_eq!(range_keys(&map, (Included(size + 1), Unbounded)), vec![]); |
| |
| fn check<'a, L, R>(lhs: L, rhs: R) |
| where |
| L: IntoIterator<Item = (&'a i32, &'a i32)>, |
| R: IntoIterator<Item = (&'a i32, &'a i32)>, |
| { |
| let lhs: Vec<_> = lhs.into_iter().collect(); |
| let rhs: Vec<_> = rhs.into_iter().collect(); |
| assert_eq!(lhs, rhs); |
| } |
| |
| check(map.range(..=100), map.range(..101)); |
| check(map.range(5..=8), vec![(&5, &5), (&6, &6), (&7, &7), (&8, &8)]); |
| check(map.range(-1..=2), vec![(&1, &1), (&2, &2)]); |
| } |
| |
| #[test] |
| fn test_range_inclusive_max_value() { |
| let max = std::usize::MAX; |
| let map: BTreeMap<_, _> = vec![(max, 0)].into_iter().collect(); |
| |
| assert_eq!(map.range(max..=max).collect::<Vec<_>>(), &[(&max, &0)]); |
| } |
| |
| #[test] |
| fn test_range_equal_empty_cases() { |
| let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect(); |
| assert_eq!(map.range((Included(2), Excluded(2))).next(), None); |
| assert_eq!(map.range((Excluded(2), Included(2))).next(), None); |
| } |
| |
| #[test] |
| #[should_panic] |
| fn test_range_equal_excluded() { |
| let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect(); |
| map.range((Excluded(2), Excluded(2))); |
| } |
| |
| #[test] |
| #[should_panic] |
| fn test_range_backwards_1() { |
| let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect(); |
| map.range((Included(3), Included(2))); |
| } |
| |
| #[test] |
| #[should_panic] |
| fn test_range_backwards_2() { |
| let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect(); |
| map.range((Included(3), Excluded(2))); |
| } |
| |
| #[test] |
| #[should_panic] |
| fn test_range_backwards_3() { |
| let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect(); |
| map.range((Excluded(3), Included(2))); |
| } |
| |
| #[test] |
| #[should_panic] |
| fn test_range_backwards_4() { |
| let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect(); |
| map.range((Excluded(3), Excluded(2))); |
| } |
| |
| #[test] |
| fn test_range_1000() { |
| #[cfg(not(miri))] // Miri is too slow |
| let size = 1000; |
| #[cfg(miri)] |
| 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>) { |
| let mut kvs = map.range((min, max)).map(|(&k, &v)| (k, v)); |
| let mut pairs = (0..size).map(|i| (i, i)); |
| |
| for (kv, pair) in kvs.by_ref().zip(pairs.by_ref()) { |
| assert_eq!(kv, pair); |
| } |
| assert_eq!(kvs.next(), None); |
| assert_eq!(pairs.next(), None); |
| } |
| test(&map, size, Included(&0), Excluded(&size)); |
| test(&map, size, Unbounded, Excluded(&size)); |
| test(&map, size, Included(&0), Included(&(size - 1))); |
| test(&map, size, Unbounded, Included(&(size - 1))); |
| test(&map, size, Included(&0), Unbounded); |
| test(&map, size, Unbounded, Unbounded); |
| } |
| |
| #[test] |
| fn test_range_borrowed_key() { |
| let mut map = BTreeMap::new(); |
| map.insert("aardvark".to_string(), 1); |
| map.insert("baboon".to_string(), 2); |
| map.insert("coyote".to_string(), 3); |
| map.insert("dingo".to_string(), 4); |
| // NOTE: would like to use simply "b".."d" here... |
| let mut iter = map.range::<str, _>((Included("b"), Excluded("d"))); |
| assert_eq!(iter.next(), Some((&"baboon".to_string(), &2))); |
| assert_eq!(iter.next(), Some((&"coyote".to_string(), &3))); |
| assert_eq!(iter.next(), None); |
| } |
| |
| #[test] |
| fn test_range() { |
| #[cfg(not(miri))] // Miri is too slow |
| let size = 200; |
| #[cfg(miri)] |
| let size = 30; |
| let map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect(); |
| |
| for i in 0..size { |
| for j in i..size { |
| let mut kvs = map.range((Included(&i), Included(&j))).map(|(&k, &v)| (k, v)); |
| let mut pairs = (i..=j).map(|i| (i, i)); |
| |
| for (kv, pair) in kvs.by_ref().zip(pairs.by_ref()) { |
| assert_eq!(kv, pair); |
| } |
| assert_eq!(kvs.next(), None); |
| assert_eq!(pairs.next(), None); |
| } |
| } |
| } |
| |
| #[test] |
| fn test_range_mut() { |
| #[cfg(not(miri))] // Miri is too slow |
| let size = 200; |
| #[cfg(miri)] |
| let size = 30; |
| let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect(); |
| |
| for i in 0..size { |
| for j in i..size { |
| let mut kvs = map.range_mut((Included(&i), Included(&j))).map(|(&k, &mut v)| (k, v)); |
| let mut pairs = (i..=j).map(|i| (i, i)); |
| |
| for (kv, pair) in kvs.by_ref().zip(pairs.by_ref()) { |
| assert_eq!(kv, pair); |
| } |
| assert_eq!(kvs.next(), None); |
| assert_eq!(pairs.next(), None); |
| } |
| } |
| } |
| |
| #[test] |
| fn test_borrow() { |
| // make sure these compile -- using the Borrow trait |
| { |
| let mut map = BTreeMap::new(); |
| map.insert("0".to_string(), 1); |
| assert_eq!(map["0"], 1); |
| } |
| |
| { |
| let mut map = BTreeMap::new(); |
| map.insert(Box::new(0), 1); |
| assert_eq!(map[&0], 1); |
| } |
| |
| { |
| let mut map = BTreeMap::new(); |
| map.insert(Box::new([0, 1]) as Box<[i32]>, 1); |
| assert_eq!(map[&[0, 1][..]], 1); |
| } |
| |
| { |
| let mut map = BTreeMap::new(); |
| map.insert(Rc::new(0), 1); |
| assert_eq!(map[&0], 1); |
| } |
| } |
| |
| #[test] |
| fn test_entry() { |
| let xs = [(1, 10), (2, 20), (3, 30), (4, 40), (5, 50), (6, 60)]; |
| |
| let mut map: BTreeMap<_, _> = xs.iter().cloned().collect(); |
| |
| // Existing key (insert) |
| match map.entry(1) { |
| Vacant(_) => unreachable!(), |
| Occupied(mut view) => { |
| assert_eq!(view.get(), &10); |
| assert_eq!(view.insert(100), 10); |
| } |
| } |
| assert_eq!(map.get(&1).unwrap(), &100); |
| assert_eq!(map.len(), 6); |
| |
| // Existing key (update) |
| match map.entry(2) { |
| Vacant(_) => unreachable!(), |
| Occupied(mut view) => { |
| let v = view.get_mut(); |
| *v *= 10; |
| } |
| } |
| assert_eq!(map.get(&2).unwrap(), &200); |
| assert_eq!(map.len(), 6); |
| |
| // Existing key (take) |
| match map.entry(3) { |
| Vacant(_) => unreachable!(), |
| Occupied(view) => { |
| assert_eq!(view.remove(), 30); |
| } |
| } |
| assert_eq!(map.get(&3), None); |
| assert_eq!(map.len(), 5); |
| |
| // Inexistent key (insert) |
| match map.entry(10) { |
| Occupied(_) => unreachable!(), |
| Vacant(view) => { |
| assert_eq!(*view.insert(1000), 1000); |
| } |
| } |
| assert_eq!(map.get(&10).unwrap(), &1000); |
| assert_eq!(map.len(), 6); |
| } |
| |
| #[test] |
| fn test_extend_ref() { |
| let mut a = BTreeMap::new(); |
| a.insert(1, "one"); |
| let mut b = BTreeMap::new(); |
| b.insert(2, "two"); |
| b.insert(3, "three"); |
| |
| a.extend(&b); |
| |
| assert_eq!(a.len(), 3); |
| assert_eq!(a[&1], "one"); |
| assert_eq!(a[&2], "two"); |
| assert_eq!(a[&3], "three"); |
| } |
| |
| #[test] |
| fn test_zst() { |
| let mut m = BTreeMap::new(); |
| assert_eq!(m.len(), 0); |
| |
| assert_eq!(m.insert((), ()), None); |
| assert_eq!(m.len(), 1); |
| |
| assert_eq!(m.insert((), ()), Some(())); |
| assert_eq!(m.len(), 1); |
| assert_eq!(m.iter().count(), 1); |
| |
| m.clear(); |
| assert_eq!(m.len(), 0); |
| |
| for _ in 0..100 { |
| m.insert((), ()); |
| } |
| |
| assert_eq!(m.len(), 1); |
| assert_eq!(m.iter().count(), 1); |
| } |
| |
| // This test's only purpose is to ensure that zero-sized keys with nonsensical orderings |
| // do not cause segfaults when used with zero-sized values. All other map behavior is |
| // undefined. |
| #[test] |
| fn test_bad_zst() { |
| use std::cmp::Ordering; |
| |
| struct Bad; |
| |
| impl PartialEq for Bad { |
| fn eq(&self, _: &Self) -> bool { |
| false |
| } |
| } |
| |
| impl Eq for Bad {} |
| |
| impl PartialOrd for Bad { |
| fn partial_cmp(&self, _: &Self) -> Option<Ordering> { |
| Some(Ordering::Less) |
| } |
| } |
| |
| impl Ord for Bad { |
| fn cmp(&self, _: &Self) -> Ordering { |
| Ordering::Less |
| } |
| } |
| |
| let mut m = BTreeMap::new(); |
| |
| for _ in 0..100 { |
| m.insert(Bad, Bad); |
| } |
| } |
| |
| #[test] |
| fn test_clone() { |
| let mut map = BTreeMap::new(); |
| #[cfg(not(miri))] // Miri is too slow |
| let size = 100; |
| #[cfg(miri)] |
| let size = 30; |
| assert_eq!(map.len(), 0); |
| |
| for i in 0..size { |
| assert_eq!(map.insert(i, 10 * i), None); |
| assert_eq!(map.len(), i + 1); |
| assert_eq!(map, map.clone()); |
| } |
| |
| for i in 0..size { |
| assert_eq!(map.insert(i, 100 * i), Some(10 * i)); |
| assert_eq!(map.len(), size); |
| assert_eq!(map, map.clone()); |
| } |
| |
| for i in 0..size / 2 { |
| assert_eq!(map.remove(&(i * 2)), Some(i * 200)); |
| assert_eq!(map.len(), size - i - 1); |
| assert_eq!(map, map.clone()); |
| } |
| |
| for i in 0..size / 2 { |
| assert_eq!(map.remove(&(2 * i)), None); |
| assert_eq!(map.remove(&(2 * i + 1)), Some(i * 200 + 100)); |
| assert_eq!(map.len(), size / 2 - i - 1); |
| assert_eq!(map, map.clone()); |
| } |
| } |
| |
| #[test] |
| fn test_clone_from() { |
| let mut map1 = BTreeMap::new(); |
| let size = 30; |
| |
| for i in 0..size { |
| let mut map2 = BTreeMap::new(); |
| for j in 0..i { |
| let mut map1_copy = map2.clone(); |
| map1_copy.clone_from(&map1); |
| assert_eq!(map1_copy, map1); |
| let mut map2_copy = map1.clone(); |
| map2_copy.clone_from(&map2); |
| assert_eq!(map2_copy, map2); |
| map2.insert(100 * j + 1, 2 * j + 1); |
| } |
| map1.insert(i, 10 * i); |
| } |
| } |
| |
| #[test] |
| #[allow(dead_code)] |
| fn test_variance() { |
| use std::collections::btree_map::{IntoIter, Iter, Keys, Range, Values}; |
| |
| fn map_key<'new>(v: BTreeMap<&'static str, ()>) -> BTreeMap<&'new str, ()> { |
| v |
| } |
| fn map_val<'new>(v: BTreeMap<(), &'static str>) -> BTreeMap<(), &'new str> { |
| v |
| } |
| fn iter_key<'a, 'new>(v: Iter<'a, &'static str, ()>) -> Iter<'a, &'new str, ()> { |
| v |
| } |
| fn iter_val<'a, 'new>(v: Iter<'a, (), &'static str>) -> Iter<'a, (), &'new str> { |
| v |
| } |
| fn into_iter_key<'new>(v: IntoIter<&'static str, ()>) -> IntoIter<&'new str, ()> { |
| v |
| } |
| fn into_iter_val<'new>(v: IntoIter<(), &'static str>) -> IntoIter<(), &'new str> { |
| v |
| } |
| fn range_key<'a, 'new>(v: Range<'a, &'static str, ()>) -> Range<'a, &'new str, ()> { |
| v |
| } |
| fn range_val<'a, 'new>(v: Range<'a, (), &'static str>) -> Range<'a, (), &'new str> { |
| v |
| } |
| fn keys<'a, 'new>(v: Keys<'a, &'static str, ()>) -> Keys<'a, &'new str, ()> { |
| v |
| } |
| fn vals<'a, 'new>(v: Values<'a, (), &'static str>) -> Values<'a, (), &'new str> { |
| v |
| } |
| } |
| |
| #[test] |
| fn test_occupied_entry_key() { |
| let mut a = BTreeMap::new(); |
| let key = "hello there"; |
| let value = "value goes here"; |
| assert!(a.is_empty()); |
| a.insert(key.clone(), value.clone()); |
| assert_eq!(a.len(), 1); |
| assert_eq!(a[key], value); |
| |
| match a.entry(key.clone()) { |
| Vacant(_) => panic!(), |
| Occupied(e) => assert_eq!(key, *e.key()), |
| } |
| assert_eq!(a.len(), 1); |
| assert_eq!(a[key], value); |
| } |
| |
| #[test] |
| fn test_vacant_entry_key() { |
| let mut a = BTreeMap::new(); |
| let key = "hello there"; |
| let value = "value goes here"; |
| |
| assert!(a.is_empty()); |
| match a.entry(key.clone()) { |
| Occupied(_) => panic!(), |
| Vacant(e) => { |
| assert_eq!(key, *e.key()); |
| e.insert(value.clone()); |
| } |
| } |
| assert_eq!(a.len(), 1); |
| assert_eq!(a[key], value); |
| } |
| |
| #[test] |
| fn test_first_last_entry() { |
| let mut a = BTreeMap::new(); |
| assert!(a.first_entry().is_none()); |
| assert!(a.last_entry().is_none()); |
| a.insert(1, 42); |
| assert_eq!(a.first_entry().unwrap().key(), &1); |
| assert_eq!(a.last_entry().unwrap().key(), &1); |
| a.insert(2, 24); |
| assert_eq!(a.first_entry().unwrap().key(), &1); |
| assert_eq!(a.last_entry().unwrap().key(), &2); |
| a.insert(0, 6); |
| assert_eq!(a.first_entry().unwrap().key(), &0); |
| assert_eq!(a.last_entry().unwrap().key(), &2); |
| let (k1, v1) = a.first_entry().unwrap().remove_entry(); |
| assert_eq!(k1, 0); |
| assert_eq!(v1, 6); |
| let (k2, v2) = a.last_entry().unwrap().remove_entry(); |
| assert_eq!(k2, 2); |
| assert_eq!(v2, 24); |
| assert_eq!(a.first_entry().unwrap().key(), &1); |
| assert_eq!(a.last_entry().unwrap().key(), &1); |
| } |
| |
| macro_rules! create_append_test { |
| ($name:ident, $len:expr) => { |
| #[test] |
| fn $name() { |
| let mut a = BTreeMap::new(); |
| for i in 0..8 { |
| a.insert(i, i); |
| } |
| |
| let mut b = BTreeMap::new(); |
| for i in 5..$len { |
| b.insert(i, 2 * i); |
| } |
| |
| a.append(&mut b); |
| |
| assert_eq!(a.len(), $len); |
| assert_eq!(b.len(), 0); |
| |
| for i in 0..$len { |
| if i < 5 { |
| assert_eq!(a[&i], i); |
| } else { |
| assert_eq!(a[&i], 2 * i); |
| } |
| } |
| |
| assert_eq!(a.remove(&($len - 1)), Some(2 * ($len - 1))); |
| assert_eq!(a.insert($len - 1, 20), None); |
| } |
| }; |
| } |
| |
| // These are mostly for testing the algorithm that "fixes" the right edge after insertion. |
| // Single node. |
| create_append_test!(test_append_9, 9); |
| // Two leafs that don't need fixing. |
| create_append_test!(test_append_17, 17); |
| // Two leafs where the second one ends up underfull and needs stealing at the end. |
| create_append_test!(test_append_14, 14); |
| // Two leafs where the second one ends up empty because the insertion finished at the root. |
| create_append_test!(test_append_12, 12); |
| // Three levels; insertion finished at the root. |
| create_append_test!(test_append_144, 144); |
| // Three levels; insertion finished at leaf while there is an empty node on the second level. |
| create_append_test!(test_append_145, 145); |
| // Tests for several randomly chosen sizes. |
| create_append_test!(test_append_170, 170); |
| create_append_test!(test_append_181, 181); |
| create_append_test!(test_append_239, 239); |
| #[cfg(not(miri))] // Miri is too slow |
| create_append_test!(test_append_1700, 1700); |
| |
| fn rand_data(len: usize) -> Vec<(u32, u32)> { |
| let mut rng = DeterministicRng::new(); |
| Vec::from_iter((0..len).map(|_| (rng.next(), rng.next()))) |
| } |
| |
| #[test] |
| fn test_split_off_empty_right() { |
| let mut data = rand_data(173); |
| |
| let mut map = BTreeMap::from_iter(data.clone()); |
| let right = map.split_off(&(data.iter().max().unwrap().0 + 1)); |
| |
| data.sort(); |
| assert!(map.into_iter().eq(data)); |
| assert!(right.into_iter().eq(None)); |
| } |
| |
| #[test] |
| fn test_split_off_empty_left() { |
| let mut data = rand_data(314); |
| |
| let mut map = BTreeMap::from_iter(data.clone()); |
| let right = map.split_off(&data.iter().min().unwrap().0); |
| |
| data.sort(); |
| assert!(map.into_iter().eq(None)); |
| assert!(right.into_iter().eq(data)); |
| } |
| |
| #[test] |
| fn test_split_off_large_random_sorted() { |
| #[cfg(not(miri))] // Miri is too slow |
| let mut data = rand_data(1529); |
| #[cfg(miri)] |
| let mut data = rand_data(529); |
| // special case with maximum height. |
| data.sort(); |
| |
| let mut map = BTreeMap::from_iter(data.clone()); |
| let key = data[data.len() / 2].0; |
| let right = map.split_off(&key); |
| |
| assert!(map.into_iter().eq(data.clone().into_iter().filter(|x| x.0 < key))); |
| assert!(right.into_iter().eq(data.into_iter().filter(|x| x.0 >= key))); |
| } |
