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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

// Copyright Amazon.com, Inc. or its affiliates. All Rights Reserved.
// Copyright by contributors to this project.
// SPDX-License-Identifier: (Apache-2.0 OR MIT)

use alloc::{collections::BTreeMap, vec::Vec};

#[cfg(feature = "std")]
use std::{collections::HashMap, hash::Hash};

use crate::{MlsDecode, MlsEncode, MlsSize};

#[cfg(feature = "std")]
impl<K, V> MlsSize for HashMap<K, V>
where
    K: MlsSize,
    V: MlsSize,
{
    fn mls_encoded_len(&self) -> usize {
        crate::iter::mls_encoded_len(self.iter())
    }
}

#[cfg(feature = "std")]
impl<K, V> MlsEncode for HashMap<K, V>
where
    K: MlsEncode,
    V: MlsEncode,
{
    fn mls_encode(&self, writer: &mut Vec<u8>) -> Result<(), crate::Error> {
        crate::iter::mls_encode(self.iter(), writer)
    }
}

#[cfg(feature = "std")]
impl<K, V> MlsDecode for HashMap<K, V>
where
    K: MlsDecode + Hash + Eq,
    V: MlsDecode,
{
    fn mls_decode(reader: &mut &[u8]) -> Result<Self, crate::Error> {
        crate::iter::mls_decode_collection(reader, |data| {
            let mut items = HashMap::new();

            while !data.is_empty() {
                items.insert(K::mls_decode(data)?, V::mls_decode(data)?);
            }

            Ok(items)
        })
    }
}

impl<K, V> MlsSize for BTreeMap<K, V>
where
    K: MlsSize,
    V: MlsSize,
{
    fn mls_encoded_len(&self) -> usize {
        crate::iter::mls_encoded_len(self.iter())
    }
}

impl<K, V> MlsEncode for BTreeMap<K, V>
where
    K: MlsEncode,
    V: MlsEncode,
{
    fn mls_encode(&self, writer: &mut Vec<u8>) -> Result<(), crate::Error> {
        crate::iter::mls_encode(self.iter(), writer)
    }
}

impl<K, V> MlsDecode for BTreeMap<K, V>
where
    K: MlsDecode + Eq + Ord,
    V: MlsDecode,
{
    fn mls_decode(reader: &mut &[u8]) -> Result<Self, crate::Error> {
        crate::iter::mls_decode_collection(reader, |data| {
            let mut items = BTreeMap::new();

            while !data.is_empty() {
                items.insert(K::mls_decode(data)?, V::mls_decode(data)?);
            }

            Ok(items)
        })
    }
}