cnfy-uint 0.2.3

Zero-dependency 256-bit unsigned integer arithmetic for cryptographic applications
Documentation
//! Returns the five `u64` limbs in little-endian order.
use super::U320;

impl U320 {
    /// Returns the five `u64` limbs in little-endian order.
    ///
    /// The returned array is `[w0, w1, w2, w3, w4]` where the first element
    /// is the least significant limb and the last element is the most
    /// significant limb. Since the internal layout is already little-endian,
    /// this returns the raw limb array directly.
    ///
    /// # Examples
    ///
    /// ```
    /// use cnfy_uint::u320::U320;
    ///
    /// let v = U320::from_be_limbs([1, 2, 3, 4, 5]);
    /// assert_eq!(v.to_le_limbs(), [5, 4, 3, 2, 1]);
    /// ```
    #[inline]
    pub const fn to_le_limbs(&self) -> [u64; 5] {
        self.0
    }
}

#[cfg(test)]
mod ai_tests {
    use super::*;

    /// to_le_limbs returns the internal LE layout directly.
    #[test]
    fn le_limbs_reverses() {
        let v = U320::from_be_limbs([1, 2, 3, 4, 5]);
        assert_eq!(v.to_le_limbs(), [5, 4, 3, 2, 1]);
    }

    /// Zero in little-endian is still all zeros.
    #[test]
    fn le_limbs_zero() {
        assert_eq!(U320::from_be_limbs([0; 5]).to_le_limbs(), [0; 5]);
    }
}