code_ownership 2.1.4 → 2.2.0

data/ext/cargo-vendor/hashbrown-0.12.3/benches/insert_unique_unchecked.rs

@@ -1,32 +0,0 @@
-//! Compare `insert` and `insert_unique_unchecked` operations performance.
-
-#![feature(test)]
-
-extern crate test;
-
-use hashbrown::HashMap;
-use test::Bencher;
-
-#[bench]
-fn insert(b: &mut Bencher) {
-    let keys: Vec<String> = (0..1000).map(|i| format!("xxxx{}yyyy", i)).collect();
-    b.iter(|| {
-        let mut m = HashMap::with_capacity(1000);
-        for k in &keys {
-            m.insert(k, k);
-        }
-        m
-    });
-}
-
-#[bench]
-fn insert_unique_unchecked(b: &mut Bencher) {
-    let keys: Vec<String> = (0..1000).map(|i| format!("xxxx{}yyyy", i)).collect();
-    b.iter(|| {
-        let mut m = HashMap::with_capacity(1000);
-        for k in &keys {
-            m.insert_unique_unchecked(k, k);
-        }
-        m
-    });
-}

data/ext/cargo-vendor/hashbrown-0.12.3/clippy.toml

@@ -1 +0,0 @@
-doc-valid-idents = [ "CppCon", "SwissTable", "SipHash", "HashDoS" ]

data/ext/cargo-vendor/hashbrown-0.12.3/src/external_trait_impls/mod.rs

@@ -1,4 +0,0 @@
-#[cfg(feature = "rayon")]
-pub(crate) mod rayon;
-#[cfg(feature = "serde")]
-mod serde;

data/ext/cargo-vendor/hashbrown-0.12.3/src/external_trait_impls/rayon/helpers.rs

@@ -1,27 +0,0 @@
-use alloc::collections::LinkedList;
-use alloc::vec::Vec;
-
-use rayon::iter::{IntoParallelIterator, ParallelIterator};
-
-/// Helper for collecting parallel iterators to an intermediary
-#[allow(clippy::linkedlist)] // yes, we need linked list here for efficient appending!
-pub(super) fn collect<I: IntoParallelIterator>(iter: I) -> (LinkedList<Vec<I::Item>>, usize) {
-    let list = iter
-        .into_par_iter()
-        .fold(Vec::new, |mut vec, elem| {
-            vec.push(elem);
-            vec
-        })
-        .map(|vec| {
-            let mut list = LinkedList::new();
-            list.push_back(vec);
-            list
-        })
-        .reduce(LinkedList::new, |mut list1, mut list2| {
-            list1.append(&mut list2);
-            list1
-        });
-
-    let len = list.iter().map(Vec::len).sum();
-    (list, len)
-}