Function concordium_std::deserial_map_no_length_no_order_check

pub fn deserial_map_no_length_no_order_check<R, K, V>(
    source: &mut R,
    len: usize
) -> Result<BTreeMap<K, V>, ParseError>
where
    R: Read,
    K: Deserial + Ord,
    V: Deserial,

Read a BTreeMap as a list of key-value pairs given some length. Slightly faster version of deserial_map_no_length as it is skipping the order checking