pub fn to_compressed(&self) -> [u8; 288] {
        let mut res = self.0.c1.to_bytes();

        // This point is in compressed form, so we set the most significant bit.
        res[0] |= 1u8 << 7;

        // Is the y-coordinate the lexicographically largest of the two associated with the
        // x-coordinate? If so, set the second-most significant bit so long as this is not
        // the point at infinity.
        res[0] |= u8::conditional_select(&0u8, &(1u8 << 6), self.0.c0.lexicographically_largest());

        res
    }
/// Serializes this element into compressed form. See [`notes::serialization`](crate::notes::serialization)
/// for details about how group elements are serialized.
Serializes this element into compressed form.
Serializes this element into compressed form .
pub fn to_compressed(&self) -> [u8; 288] {
        let mut res = self.0.c1.to_bytes();
        // This point is in compressed form, so we set the most significant bit.
        res[0] |= 1u8 << 7;
        // Is the y-coordinate the lexicographically largest of the two associated with the
        // x-coordinate? If so, set the second-most significant bit so long as this is not
        // the point at infinity.
        res[0] |= u8::conditional_select(&0u8, &(1u8 << 6), self.0.c0.lexicographically_largest());
        res
    }
pub fn to_compressed ( & self ) -> [ u8 ; 288 ] { let mut res = self . 0 . c1 . to_bytes ( ) ; // This point is in compressed form, so we set the most significant bit. res [ 0 ] |= 1u8 << 7 ; // Is the y-coordinate the lexicographically largest of the two associated with the // x-coordinate? If so, set the second-most significant bit so long as this is not // the point at infinity. res [ 0 ] |= u8 :: conditional_select ( & 0u8 , & ( 1u8 << 6 ) , self . 0 . c0 . lexicographically_largest ( ) ) ; res }
Serializes this element into compressed form.
Serializes this element into compressed form .
&self