Function concordium_std::deserial_set_no_length_no_order_check

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

Read a BTreeSet as an list of key-value pairs given some length. Slightly faster version of deserial_set_no_length as it is skipping the order checking. The only check that is made to the set is that there are no duplicates.