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

Read a BTreeMap as a list of key-value pairs given some length. NB: This ensures there are no duplicates, hence the specialized type. Moreover this will only succeed if keys are listed in order.