/// sticky returns 1 if there's a 1 bit within the
/// i least significant bits, otherwise it returns 0.
sticky returns 1 if there's a 1 bit within the
i least significant bits, otherwise it returns 0.
sticky returns 1 if there ' s a 1 bit within the i least significant bits otherwise it returns 0 .
pub(super) fn sticky(&self, bits_num: usize) -> usize {
        if self.is_nan() {return 0;}
        let j = bits_num >> 5;
        if j >= self.as_vec().len() {
            if self == &0u32 {
                0
            } else {
                1
            }
        } else {
            for &x in self.iter().take(j) {
                if x != 0 {
                    return 1;
                }
            }
            let rom = bits_num & 31;
            if rom > 0 && (self.as_vec()[j] << (32 - rom)) != 0 {
                1
            } else {
                0
            }
        }
    }
pub ( super ) fn sticky ( & self , bits_num : usize ) -> usize { if self . is_nan ( ) { return 0 ; } let j = bits_num >> 5 ; if j >= self . as_vec ( ) . len ( ) { if self == & 0u32 { 0 } else { 1 } } else { for & x in self . iter ( ) . take ( j ) { if x != 0 { return 1 ; } } let rom = bits_num & 31 ; if rom > 0 && ( self . as_vec ( ) [ j ] << ( 32 - rom ) ) != 0 { 1 } else { 0 } } }
sticky returns 1 if there's a 1 bit within the
i least significant bits, otherwise it returns 0.
sticky returns 1 if there ' s a 1 bit within the i least significant bits otherwise it returns 0 .
&self
bits_num
usize