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 crate::extensions::TryFromPatch;

// Vec<T> conversions

impl<T, const N: usize> TryFromPatch<Vec<T>> for [T; N] {
    fn try_from_value(v: Vec<T>) -> Option<Self> {
        v.try_into().ok()
    }
}

// #[cfg(feature = "indexmap")]
// impl<K1, V1, K2: TryFromPatch<K1>, V2: TryFromPatch<V1>>
//     TryFromPatch<indexmap::IndexMap<K1, V1>> for Vec<(K2, V2)>
// {
//     fn try_from_value(v: indexmap::IndexMap<K1, V1>) -> Option<Self> {
//         let mut new = Self::new();
//         for (k, v) in v {
//             new.push((K2::try_from_value(k)?, V2::try_from_value(v)?));
//         }
//         Some(new)
//     }
// }

// #[cfg(feature = "indexmap")]
// impl<
//         K1,
//         V1,
//         K2: core::hash::Hash + Eq + TryFromPatch<K1>,
//         V2: TryFromPatch<V1>,
//     > TryFromPatch<Vec<(K1, V1)>> for indexmap::IndexMap<K2, V2>
// {
//     fn try_from_value(v: Vec<(K1, V1)>) -> Option<Self> {
//         let mut new = Self::new();
//         for (k, v) in v {
//             new.insert(K2::try_from_value(k)?, V2::try_from_value(v)?);
//         }
//         Some(new)
//     }
// }