Lines Matching defs:BTreeMap
1295 use std::collections::BTreeMap;
1402 map_insert_rand_bench! {insert_rand_100, 100, BTreeMap}
1403 map_insert_rand_bench! {insert_rand_10_000, 10_000, BTreeMap}
1405 map_insert_seq_bench! {insert_seq_100, 100, BTreeMap}
1406 map_insert_seq_bench! {insert_seq_10_000, 10_000, BTreeMap}
1408 map_find_rand_bench! {find_rand_100, 100, BTreeMap}
1409 map_find_rand_bench! {find_rand_10_000, 10_000, BTreeMap}
1411 map_find_seq_bench! {find_seq_100, 100, BTreeMap}
1412 map_find_seq_bench! {find_seq_10_000, 10_000, BTreeMap}
1415 let mut map = BTreeMap::<i32, i32>::new();
1445 let mut map = BTreeMap::<i32, i32>::new();
1475 let map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
1507 let map: BTreeMap<_, _> = (0..BENCH_RANGE_SIZE).map(|i| (i, i)).collect();
1541 let map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
1584 fn slim_map(n: usize) -> BTreeMap<usize, usize> {
1585 (0..n).map(|i| (i, i)).collect::<BTreeMap<_, _>>()
1589 fn fat_val_map(n: usize) -> BTreeMap<usize, [usize; FAT]> {
1590 (0..n).map(|i| (i, [i; FAT])).collect::<BTreeMap<_, _>>()
29200 /// a `BTreeMap`, both iterators should produce keys in strictly ascending
29297 /// as keys in a BTreeMap. The implementation intentionally uses does not rely
29565 /// in a `BTreeMap` is.
29623 panic!("range start and end are equal and excluded in BTreeMap")
29628 panic!("range start is greater than range end in BTreeMap")
29700 /// in a `BTreeMap` is.
29716 /// in a `BTreeMap` is.
29816 // A tree in a `BTreeMap` is a tree in the `node` module with additional invariants:
29865 /// use std::collections::BTreeMap;
29868 /// // would be `BTreeMap<&str, &str>` in this example).
29869 /// let mut movie_reviews = BTreeMap::new();
29904 /// `BTreeMap` also implements an [`Entry API`], which allows for more complex
29907 /// [`Entry API`]: BTreeMap::entry
29910 /// use std::collections::BTreeMap;
29913 /// // would be `BTreeMap<&str, u8>` in this example).
29914 /// let mut player_stats = BTreeMap::new();
29934 #[cfg_attr(not(test), rustc_diagnostic_item = "BTreeMap")]
29935 pub struct BTreeMap<K, V> {
29941 unsafe impl<#[may_dangle] K, #[may_dangle] V> Drop for BTreeMap<K, V> {
29950 impl<K: Clone, V: Clone> Clone for BTreeMap<K, V> {
29951 fn clone(&self) -> BTreeMap<K, V> {
29954 ) -> BTreeMap<K, V>
29961 let mut out_tree = BTreeMap { root: Some(Root::new()), length: 0 };
29986 let out_root = BTreeMap::ensure_is_owned(&mut out_tree.root);
29998 // because BTreeMap implements Drop
30017 // Ideally we'd call `BTreeMap::new` here, but that has the `K:
30019 BTreeMap { root: None, length: 0 }
30026 impl<K, Q: ?Sized> super::Recover<Q> for BTreeMap<K, ()>
30065 /// An iterator over the entries of a `BTreeMap`.
30067 /// This `struct` is created by the [`iter`] method on [`BTreeMap`]. See its
30070 /// [`iter`]: BTreeMap::iter
30084 /// A mutable iterator over the entries of a `BTreeMap`.
30086 /// This `struct` is created by the [`iter_mut`] method on [`BTreeMap`]. See its
30089 /// [`iter_mut`]: BTreeMap::iter_mut
30097 /// An owning iterator over the entries of a `BTreeMap`.
30099 /// This `struct` is created by the [`into_iter`] method on [`BTreeMap`]
30133 /// An iterator over the keys of a `BTreeMap`.
30135 /// This `struct` is created by the [`keys`] method on [`BTreeMap`]. See its
30138 /// [`keys`]: BTreeMap::keys
30151 /// An iterator over the values of a `BTreeMap`.
30153 /// This `struct` is created by the [`values`] method on [`BTreeMap`]. See its
30156 /// [`values`]: BTreeMap::values
30169 /// A mutable iterator over the values of a `BTreeMap`.
30171 /// This `struct` is created by the [`values_mut`] method on [`BTreeMap`]. See its
30174 /// [`values_mut`]: BTreeMap::values_mut
30187 /// An owning iterator over the keys of a `BTreeMap`.
30189 /// This `struct` is created by the [`into_keys`] method on [`BTreeMap`].
30192 /// [`into_keys`]: BTreeMap::into_keys
30205 /// An owning iterator over the values of a `BTreeMap`.
30207 /// This `struct` is created by the [`into_values`] method on [`BTreeMap`].
30210 /// [`into_values`]: BTreeMap::into_values
30223 /// An iterator over a sub-range of entries in a `BTreeMap`.
30225 /// This `struct` is created by the [`range`] method on [`BTreeMap`]. See its
30228 /// [`range`]: BTreeMap::range
30241 /// A mutable iterator over a sub-range of entries in a `BTreeMap`.
30243 /// This `struct` is created by the [`range_mut`] method on [`BTreeMap`]. See its
30246 /// [`range_mut`]: BTreeMap::range_mut
30263 impl<K, V> BTreeMap<K, V> {
30264 /// Makes a new, empty `BTreeMap`.
30273 /// use std::collections::BTreeMap;
30275 /// let mut map = BTreeMap::new();
30282 pub const fn new() -> BTreeMap<K, V>
30286 BTreeMap { root: None, length: 0 }
30296 /// use std::collections::BTreeMap;
30298 /// let mut a = BTreeMap::new();
30305 *self = BTreeMap { root: None, length: 0 };
30318 /// use std::collections::BTreeMap;
30320 /// let mut map = BTreeMap::new();
30346 /// use std::collections::BTreeMap;
30348 /// let mut map = BTreeMap::new();
30375 /// use std::collections::BTreeMap;
30377 /// let mut map = BTreeMap::new();
30399 /// use std::collections::BTreeMap;
30401 /// let mut map = BTreeMap::new();
30432 /// use std::collections::BTreeMap;
30434 /// let mut map = BTreeMap::new();
30459 /// use std::collections::BTreeMap;
30461 /// let mut map = BTreeMap::new();
30482 /// use std::collections::BTreeMap;
30484 /// let mut map = BTreeMap::new();
30515 /// use std::collections::BTreeMap;
30517 /// let mut map = BTreeMap::new();
30543 /// use std::collections::BTreeMap;
30545 /// let mut map = BTreeMap::new();
30569 /// use std::collections::BTreeMap;
30571 /// let mut map = BTreeMap::new();
30608 /// use std::collections::BTreeMap;
30610 /// let mut map = BTreeMap::new();
30645 /// use std::collections::BTreeMap;
30647 /// let mut map = BTreeMap::new();
30677 /// use std::collections::BTreeMap;
30679 /// let mut map = BTreeMap::new();
30705 /// use std::collections::BTreeMap;
30707 /// let mut map = BTreeMap::new();
30735 /// use std::collections::BTreeMap;
30737 /// let mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x*10)).collect();
30757 /// use std::collections::BTreeMap;
30759 /// let mut a = BTreeMap::new();
30764 /// let mut b = BTreeMap::new();
30798 let root = BTreeMap::ensure_is_owned(&mut self.root);
30819 /// use std::collections::BTreeMap;
30822 /// let mut map = BTreeMap::new();
30862 /// use std::collections::BTreeMap;
30864 /// let mut map: BTreeMap<&str, i32> = ["Alice", "Bob", "Carol", "Cheryl"]
30896 /// use std::collections::BTreeMap;
30898 /// let mut count: BTreeMap<&str, usize> = BTreeMap::new();
30931 /// use std::collections::BTreeMap;
30933 /// let mut a = BTreeMap::new();
30969 BTreeMap { root: Some(right_root), length: right_len }
30996 /// use std::collections::BTreeMap;
30998 /// let mut map: BTreeMap<i32, i32> = (0..8).map(|x| (x, x)).collect();
30999 /// let evens: BTreeMap<_, _> = map.drain_filter(|k, _v| k % 2 == 0).collect();
31038 /// use std::collections::BTreeMap;
31040 /// let mut a = BTreeMap::new();
31061 /// use std::collections::BTreeMap;
31063 /// let mut a = BTreeMap::new();
31078 impl<'a, K, V> IntoIterator for &'a BTreeMap<K, V> {
31147 impl<'a, K, V> IntoIterator for &'a mut BTreeMap<K, V> {
31217 impl<K, V> IntoIterator for BTreeMap<K, V> {
31403 /// An iterator produced by calling `drain_filter` on BTreeMap.
31720 impl<K: Ord, V> FromIterator<(K, V)> for BTreeMap<K, V> {
31721 fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> BTreeMap<K, V> {
31722 let mut map = BTreeMap::new();
31729 impl<K: Ord, V> Extend<(K, V)> for BTreeMap<K, V> {
31744 impl<'a, K: Ord + Copy, V: Copy> Extend<(&'a K, &'a V)> for BTreeMap<K, V> {
31756 impl<K: Hash, V: Hash> Hash for BTreeMap<K, V> {
31765 impl<K: Ord, V> Default for BTreeMap<K, V> {
31766 /// Creates an empty `BTreeMap`.
31767 fn default() -> BTreeMap<K, V> {
31768 BTreeMap::new()
31773 impl<K: PartialEq, V: PartialEq> PartialEq for BTreeMap<K, V> {
31774 fn eq(&self, other: &BTreeMap<K, V>) -> bool {
31780 impl<K: Eq, V: Eq> Eq for BTreeMap<K, V> {}
31783 impl<K: PartialOrd, V: PartialOrd> PartialOrd for BTreeMap<K, V> {
31785 fn partial_cmp(&self, other: &BTreeMap<K, V>) -> Option<Ordering> {
31791 impl<K: Ord, V: Ord> Ord for BTreeMap<K, V> {
31793 fn cmp(&self, other: &BTreeMap<K, V>) -> Ordering {
31799 impl<K: Debug, V: Debug> Debug for BTreeMap<K, V> {
31806 impl<K, Q: ?Sized, V> Index<&Q> for BTreeMap<K, V>
31817 /// Panics if the key is not present in the `BTreeMap`.
31824 impl<K, V> BTreeMap<K, V> {
31832 /// use std::collections::BTreeMap;
31834 /// let mut map = BTreeMap::new();
31864 /// use std::collections::BTreeMap;
31866 /// let mut map = BTreeMap::new();
31902 /// use std::collections::BTreeMap;
31904 /// let mut a = BTreeMap::new();
31923 /// use std::collections::BTreeMap;
31925 /// let mut a = BTreeMap::new();
31944 /// use std::collections::BTreeMap;
31946 /// let mut a = BTreeMap::new();
31970 /// use std::collections::BTreeMap;
31972 /// let mut a = BTreeMap::new();
31991 /// use std::collections::BTreeMap;
31993 /// let mut a = BTreeMap::new();
32005 /// own node. Is an associated function to avoid borrowing the entire BTreeMap.
32123 /// If `self` respects all `BTreeMap` tree invariants, then both
32167 // This is pretty much entirely stolen from TreeSet, since BTreeMap has an identical interface
32177 use super::map::{BTreeMap, Keys};
32185 /// See [`BTreeMap`]'s documentation for a detailed discussion of this collection's performance
32232 map: BTreeMap<T, ()>,
32411 BTreeSet { map: BTreeMap::new() }
33821 _ => unreachable!("BTreeMap has different depths"),
33847 _ => unreachable!("BTreeMap has different depths"),
33856 /// in a `BTreeMap` is.
33879 /// in a `BTreeMap` is.
35052 use super::BTreeMap;
35058 /// This `enum` is constructed from the [`entry`] method on [`BTreeMap`].
35060 /// [`entry`]: BTreeMap::entry
35082 /// A view into a vacant entry in a `BTreeMap`.
35088 pub(super) dormant_map: DormantMutRef<'a, BTreeMap<K, V>>,
35101 /// A view into an occupied entry in a `BTreeMap`.
35106 pub(super) dormant_map: DormantMutRef<'a, BTreeMap<K, V>>,
35119 /// The error returned by [`try_insert`](BTreeMap::try_insert) when the key already exists.
35161 /// use std::collections::BTreeMap;
35163 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35182 /// use std::collections::BTreeMap;
35184 /// let mut map: BTreeMap<&str, String> = BTreeMap::new();
35209 /// use std::collections::BTreeMap;
35211 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35234 /// use std::collections::BTreeMap;
35236 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35253 /// use std::collections::BTreeMap;
35255 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35290 /// use std::collections::BTreeMap;
35292 /// let mut map: BTreeMap<&str, Option<usize>> = BTreeMap::new();
35312 /// use std::collections::BTreeMap;
35314 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35327 /// use std::collections::BTreeMap;
35330 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35347 /// use std::collections::BTreeMap;
35350 /// let mut map: BTreeMap<&str, u32> = BTreeMap::new();
35388 /// use std::collections::BTreeMap;
35390 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35404 /// use std::collections::BTreeMap;
35407 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35428 /// use std::collections::BTreeMap;
35431 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35453 /// use std::collections::BTreeMap;
35456 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35483 /// use std::collections::BTreeMap;
35486 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35506 /// use std::collections::BTreeMap;
35509 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35527 /// use std::collections::BTreeMap;
35530 /// let mut map: BTreeMap<&str, usize> = BTreeMap::new();
35605 impl<K, V> BTreeMap<K, V> {
35679 let root = BTreeMap::ensure_is_owned(&mut self.root);
35701 let mut map = BTreeMap::new();
35740 let map: BTreeMap<_, _> = (0..2).map(|i| (Governed(i, &gov), ())).collect();
35749 let map: BTreeMap<_, _> = (0..2).map(|i| (Governed(i, &gov), ())).collect();
35756 let mut map = BTreeMap::new();
35809 let mut map = BTreeMap::new();
35898 let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
35921 let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
35946 let mut map: BTreeMap<T, T> = (0..size).map(|i| (T::try_from(i).unwrap(), zero)).collect();
36012 let mut a: BTreeMap<_, _> = (0..MIN_INSERTS_HEIGHT_2).map(|i| (i, i)).collect();
36019 let mut a = BTreeMap::new();
36034 let mut map: BTreeMap<_, _> = (0..2).map(|i| (i, i)).collect();
36051 let mut map: BTreeMap<_, _> = (0..MIN_INSERTS_HEIGHT_1).map(|i| (i, i)).collect();
36069 let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
36094 let mut a = BTreeMap::new();
36128 fn range_keys(map: &BTreeMap<i32, i32>, range: impl RangeBounds<i32>) -> Vec<i32> {
36141 let map: BTreeMap<_, _> = (1..=size).map(|i| (i, i)).collect();
36201 let map: BTreeMap<_, _> = (0..MIN_INSERTS_HEIGHT_1 as i32).map(|i| (i, i)).collect();
36220 let map: BTreeMap<_, _> = (1..=size).map(|i| (i, i)).collect();
36288 let map: BTreeMap<_, _> = vec![(max, 0)].into_iter().collect();
36295 let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect();
36303 let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect();
36310 let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect();
36317 let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect();
36324 let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect();
36331 let map: BTreeMap<_, _> = (0..5).map(|i| (i, i)).collect();
36337 let mut map = BTreeMap::new();
36383 let map = (0..12).map(|i| (CompositeKey(i, EvilTwin(i)), ())).collect::<BTreeMap<_, _>>();
36391 let map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
36393 fn test(map: &BTreeMap<u32, u32>, size: u32, min: Bound<&u32>, max: Bound<&u32>) {
36413 let mut map = BTreeMap::new();
36430 let map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
36451 let mut map: BTreeMap<_, _> = (0..size).map(|i| (i, i)).collect();
36470 let mut map: BTreeMap<i32, i32> = (0..100).map(|x| (x, x * 10)).collect();
36484 let mut map: BTreeMap<i32, i32> = BTreeMap::new();
36494 let mut map: BTreeMap<_, _> = pairs.collect();
36503 let mut map: BTreeMap<_, _> = pairs.clone().collect();
36513 let mut map: BTreeMap<_, _> = pairs.collect();
36530 let mut map: BTreeMap<_, _> = pairs.collect();
36545 let mut map: BTreeMap<_, _> = pairs.collect();
36555 let mut map: BTreeMap<_, _> = pairs.clone().collect();
36566 let mut map: BTreeMap<_, _> = pairs.clone().collect();
36576 let mut map: BTreeMap<_, _> = pairs.collect();
36585 let mut map: BTreeMap<_, _> = pairs.collect();
36595 let mut map: BTreeMap<_, _> = pairs.clone().collect();
36606 let mut map: BTreeMap<_, _> = pairs.clone().collect();
36616 let mut map: BTreeMap<_, _> = pairs.collect();
36624 let mut map: BTreeMap<_, _> = (0..16).map(|i| (i, i)).collect();
36633 let mut map: BTreeMap<_, _> = pairs.collect();
36643 let mut map: BTreeMap<_, _> = pairs.clone().collect();
36654 let mut map: BTreeMap<_, _> = pairs.clone().collect();
36665 let mut map: BTreeMap<_, _> = pairs.clone().collect();
36676 let mut map: BTreeMap<_, _> = pairs.clone().collect();
36686 let mut map: BTreeMap<_, _> = pairs.collect();
36697 let mut map = BTreeMap::new();
36717 let mut map = BTreeMap::new();
36743 let mut map = BTreeMap::new();
36774 let mut map = BTreeMap::new();
36780 let mut map = BTreeMap::new();
36786 let mut map = BTreeMap::new();
36792 let mut map = BTreeMap::new();
36798 fn get<T: Ord>(v: &BTreeMap<Box<T>, ()>, t: &T) {
36803 fn get_mut<T: Ord>(v: &mut BTreeMap<Box<T>, ()>, t: &T) {
36808 fn get_key_value<T: Ord>(v: &BTreeMap<Box<T>, ()>, t: &T) {
36813 fn contains_key<T: Ord>(v: &BTreeMap<Box<T>, ()>, t: &T) {
36818 fn range<T: Ord>(v: &BTreeMap<Box<T>, ()>, t: T) {
36823 fn range_mut<T: Ord>(v: &mut BTreeMap<Box<T>, ()>, t: T) {
36828 fn remove<T: Ord>(v: &mut BTreeMap<Box<T>, ()>, t: &T) {
36833 fn remove_entry<T: Ord>(v: &mut BTreeMap<Box<T>, ()>, t: &T) {
36838 fn split_off<T: Ord>(v: &mut BTreeMap<Box<T>, ()>, t: &T) {
36847 let mut map: BTreeMap<_, _> = xs.iter().cloned().collect();
36897 let mut a = BTreeMap::new();
36899 let mut b = BTreeMap::new();
36914 let mut m = BTreeMap::new();
36964 let mut m = BTreeMap::new();
36974 let mut map = BTreeMap::new();
36992 let mut map = BTreeMap::new();
37011 let mut map = BTreeMap::new();
37060 let mut map = BTreeMap::new();
37085 let mut map1 = BTreeMap::new();
37090 let mut map2 = BTreeMap::new();
37110 fn map_key<'new>(v: BTreeMap<&'static str, ()>) -> BTreeMap<&'new str, ()> {
37113 fn map_val<'new>(v: BTreeMap<(), &'static str>) -> BTreeMap<(), &'new str> {
37169 fn map<T: Sync>(v: &BTreeMap<T, T>) -> impl Sync + '_ {
37173 fn into_iter<T: Sync>(v: BTreeMap<T, T>) -> impl Sync {
37177 fn into_keys<T: Sync + Ord>(v: BTreeMap<T, T>) -> impl Sync {
37181 fn into_values<T: Sync + Ord>(v: BTreeMap<T, T>) -> impl Sync {
37185 fn drain_filter<T: Sync + Ord>(v: &mut BTreeMap<T, T>) -> impl Sync + '_ {
37189 fn iter<T: Sync>(v: &BTreeMap<T, T>) -> impl Sync + '_ {
37193 fn iter_mut<T: Sync>(v: &mut BTreeMap<T, T>) -> impl Sync + '_ {
37197 fn keys<T: Sync>(v: &BTreeMap<T, T>) -> impl Sync + '_ {
37201 fn values<T: Sync>(v: &BTreeMap<T, T>) -> impl Sync + '_ {
37205 fn values_mut<T: Sync>(v: &mut BTreeMap<T, T>) -> impl Sync + '_ {
37209 fn range<T: Sync + Ord>(v: &BTreeMap<T, T>) -> impl Sync + '_ {
37213 fn range_mut<T: Sync + Ord>(v: &mut BTreeMap<T, T>) -> impl Sync + '_ {
37217 fn entry<T: Sync + Ord + Default>(v: &mut BTreeMap<T, T>) -> impl Sync + '_ {
37221 fn occupied_entry<T: Sync + Ord + Default>(v: &mut BTreeMap<T, T>) -> impl Sync + '_ {
37228 fn vacant_entry<T: Sync + Ord + Default>(v: &mut BTreeMap<T, T>) -> impl Sync + '_ {
37238 fn map<T: Send>(v: BTreeMap<T, T>) -> impl Send {
37242 fn into_iter<T: Send>(v: BTreeMap<T, T>) -> impl Send {
37246 fn into_keys<T: Send + Ord>(v: BTreeMap<T, T>) -> impl Send {
37250 fn into_values<T: Send + Ord>(v: BTreeMap<T, T>) -> impl Send {
37254 fn drain_filter<T: Send + Ord>(v: &mut BTreeMap<T, T>) -> impl Send + '_ {
37258 fn iter<T: Send + Sync>(v: &BTreeMap<T, T>) -> impl Send + '_ {
37262 fn iter_mut<T: Send>(v: &mut BTreeMap<T, T>) -> impl Send + '_ {
37266 fn keys<T: Send + Sync>(v: &BTreeMap<T, T>) -> impl Send + '_ {
37270 fn values<T: Send + Sync>(v: &BTreeMap<T, T>) -> impl Send + '_ {
37274 fn values_mut<T: Send>(v: &mut BTreeMap<T, T>) -> impl Send + '_ {
37278 fn range<T: Send + Sync + Ord>(v: &BTreeMap<T, T>) -> impl Send + '_ {
37282 fn range_mut<T: Send + Ord>(v: &mut BTreeMap<T, T>) -> impl Send + '_ {
37286 fn entry<T: Send + Ord + Default>(v: &mut BTreeMap<T, T>) -> impl Send + '_ {
37290 fn occupied_entry<T: Send + Ord + Default>(v: &mut BTreeMap<T, T>) -> impl Send + '_ {
37297 fn vacant_entry<T: Send + Ord + Default>(v: &mut BTreeMap<T, T>) -> impl Send + '_ {
37307 fn map<K>(mut map: BTreeMap<K, ()>) {
37325 fn map_debug<K: Debug>(mut map: BTreeMap<K, ()>) {
37341 fn map_clone<K: Clone>(mut map: BTreeMap<K, ()>) {
37348 const MAP: &'static BTreeMap<(), ()> = &BTreeMap::new();
37355 let mut a = BTreeMap::new();
37374 let mut a = BTreeMap::new();
37393 let mut a = BTreeMap::new();
37420 let mut map: BTreeMap<_, _> = (0..size).map(|i| (i * 2 + 1, ())).collect();
37430 let mut map: BTreeMap<_, _> = (0..size).map(|i| (i * 2 + 1, ())).collect();
37446 let mut a = BTreeMap::new();
37451 let mut b = BTreeMap::new();
37503 let mut left = BTreeMap::new();
37504 let mut right = BTreeMap::new();
37519 let mut map1 = BTreeMap::new();
37522 let mut map2 = BTreeMap::new();
37547 let mut map = BTreeMap::from_iter(data.clone());
37561 let mut map = BTreeMap::from_iter(data.clone());
37576 let mut left: BTreeMap<_, _> = pairs.clone().collect();
37592 let mut left: BTreeMap<_, _> = pairs.clone().collect();
37609 let mut map = BTreeMap::from_iter(data.iter().copied());
37629 let mut map = BTreeMap::from_iter(data.clone());
37646 let mut map = BTreeMap::new();
37667 let map: BTreeMap<_, _> = (0..size)
37683 let map: BTreeMap<_, _> = vec.into_iter().collect();
37695 let map: BTreeMap<_, _> = vec.into_iter().collect();
37707 let mut map = BTreeMap::new();
37722 let mut map = BTreeMap::new();
37925 // struct BTreeMap<K, V> {
39931 pub use btree_map::BTreeMap;