fn is_single(&self) -> Result<Option<(BuilderData, SliceData)>> {
        if let Some(root) = self.data() {
            let mut bit_len = self.bit_len();
            let mut cursor = LabelReader::with_cell(root);
            let key = cursor.get_label_raw(&mut bit_len, BuilderData::default())?;
            if bit_len == 0 {
                return Ok(Some((key, cursor.remainder()?)))
            }
        }
        Ok(None)
    }
/// determines if hashmap contains one element
determines if hashmap contains one element
determines if hashmap contains one element
fn is_single(&self) -> Result<Option<(BuilderData, SliceData)>> {
        if let Some(root) = self.data() {
            let mut bit_len = self.bit_len();
            let mut cursor = LabelReader::with_cell(root);
            let key = cursor.get_label_raw(&mut bit_len, BuilderData::default())?;
            if bit_len == 0 {
                return Ok(Some((key, cursor.remainder()?)))
            }
        }
        Ok(None)
    }
fn is_single ( & self ) -> Result < Option < ( BuilderData , SliceData ) > > { if let Some ( root ) = self . data ( ) { let mut bit_len = self . bit_len ( ) ; let mut cursor = LabelReader :: with_cell ( root ) ; let key = cursor . get_label_raw ( & mut bit_len , BuilderData :: default ( ) ) ? ; if bit_len == 0 { return Ok ( Some ( ( key , cursor . remainder ( ) ? ) ) ) } } Ok ( None ) }
determines if hashmap contains one element
determines if hashmap contains one element
&self
&self