mirl 9.2.0

Miners Rust Lib - A massive collection of ever growing and changing functions, structs, and enums. Check the description for compatibility and toggleable features! (Most of the lib is controlled by flags/features so the lib can continue to be lightweight despite its size)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39

// use std::{collections::HashMap, hash::BuildHasher};

// impl<
//         K1: core::cmp::Eq + core::hash::Hash + TryFromPatch<K2>,
//         K2: Clone,
//         V1: TryFromPatch<V2>,
//         V2: Clone,
//         S: BuildHasher + Default,
//     > TryFromPatch<HashMap<K2, V2, S>> for HashMap<K1, V1, S>
// {
//     fn try_from_value(value: HashMap<K2, V2, S>) -> Option<Self> {
//         let mut new = Self::with_hasher(S::default());
//         for (key, item) in value {
//             new.insert(K1::try_from_value(key)?, V1::try_from_value(item)?);
//         }
//         Some(new)
//     }
// }
use std::collections::BTreeMap;

use crate::{extensions::TryFromPatch, prelude::TryIntoPatch};

// TODO: Implement all functions from FromPatch here as well

impl<
        K1: Ord,
        K2: Clone + TryIntoPatch<K1>,
        V1,
        V2: Clone + TryIntoPatch<V1>,
    > TryFromPatch<BTreeMap<K2, V2>> for BTreeMap<K1, V1>
{
    fn try_from_value(value: BTreeMap<K2, V2>) -> Option<Self> {
        let mut new = Self::new();
        for (key, item) in value {
            new.insert((key).try_into_value()?, (item).try_into_value()?);
        }
        Some(new)
    }
}