pub fn deserial_map_no_length_no_order_check<R: Read, K: Deserial + Ord, V: Deserial>(
source: &mut R,
len: usize
) -> ParseResult<BTreeMap<K, V>>
Expand description
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