ixy 0.6.0-alpha.7

use core::{fmt::Display, ops};

use crate::{
    Size,
    int::{Int, SignedInt},
    internal,
};

/// A macro that creates a position with the given `x` and `y` coordinates.
#[macro_export]
macro_rules! pos {
    ($x:expr, $y:expr) => {
        Pos::new($x, $y)
    };
}

/// A 2-dimensional point with integer precision.
///
/// The type parameter `T` is guaranteed to be a built-in Rust integer type, and defaults to `i32`.
///
/// ## Layout
///
/// The layout of `Pos<T>` is guaranteed to be the same as a C struct with two fields, `x` and `y`,
/// both of type `T`.
///
/// For example, a `Pos<i32>` is equivalent to the following C struct:
///
/// ```c
/// struct Pos {
///   int x;
///   int y;
/// }
/// ```
///
/// ## Ordering
///
/// Points are ordered _row-major_, or the point with the smaller `y` coordinate comes first.
///
/// If two points have the same `y` coordinate, the point with the smaller `x` coordinate is first.
///
/// This is the natural ordering for grid iteration: top-to-bottom, left-to-right within each row.
/// For lexicographic (x-primary) ordering, use [`Pos::cmp_lexicographic`].
///
/// ```rust
/// use ixy::Pos;
///
/// assert!(Pos::new(0, 3) > Pos::new(1, 2));   // y-primary: 3 > 2
/// assert!(Pos::new(1, 2) > Pos::new(2, 1));   // y-primary: 2 > 1
/// ```
///
/// ## Examples
///
/// Create a point, also known as a position, at `(3, 4)`:
///
/// ```rust
/// use ixy::Pos;
///
/// let p = Pos::new(3, 4);
/// assert_eq!(p.x, 3);
/// assert_eq!(p.y, 4);
/// ```
///
/// Or, to use a specific integer type, such as `u16`:
///
/// ```rust
/// use ixy::Pos;
///
/// let p = Pos::<u16>::new(3, 4);
/// assert_eq!(p.x, 3);
/// assert_eq!(p.y, 4);
/// ```
#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
#[repr(C)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct Pos<T = i32> {
    /// The x-coordinate, or _horizontal_ position from the origin.
    ///
    /// ```txt
    /// (x increases →)
    /// +---------→ x
    /// |
    /// |
    /// ↓
    /// y
    /// ```
    pub x: T,

    /// The y-coordinate, or _vertical_ position from the origin.
    ///
    /// ```txt
    /// (y increases ↓)
    /// +---------→ x
    /// |
    /// |
    /// ↓
    /// y
    /// ```
    pub y: T,
}

#[allow(private_bounds)]
impl<T: Int> Pos<T> {
    /// Origin point, i.e. `(0, 0)`.
    ///
    /// This is the same value returned by [`Pos::default()`].
    ///
    /// ```txt
    ///      ↑
    ///      |
    ///      |
    /// ←----O----→
    ///      |
    ///      |
    ///      ↓
    /// ```
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// assert_eq!(Pos::ORIGIN, Pos::new(0, 0));
    /// ```
    pub const ORIGIN: Self = Self {
        x: T::ZERO,
        y: T::ZERO,
    };

    /// The minimum point, i.e. `(T::MIN, T::MIN)`.
    ///
    /// For unsigned integers, this is always [`Self::ORIGIN`], or `O` in the diagram below:
    ///
    /// ```txt
    /// O---------→ x
    /// |
    /// |
    /// ↓
    /// y
    /// ```
    ///
    /// For signed integers, this is the negation of [`Self::MAX`], or `P` in the diagram below:
    /// ```txt
    /// P    ↑
    ///      |
    ///      |
    /// ←----O----→
    ///      |
    ///      |
    ///      ↓
    /// ```
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// assert_eq!(Pos::<i32>::MIN, Pos::<i32>::new(-2147483648, -2147483648));
    /// assert_eq!(Pos::<u32>::MIN, Pos::<u32>::new(0, 0));
    /// ```
    pub const MIN: Self = Self {
        x: T::MIN,
        y: T::MIN,
    };

    /// The maximum point, i.e. `(T::MAX, T::MAX)`.
    ///
    /// Each value is the maximum value of the integer type `T` (i.e. `i32::MAX` for `Pos<i32>`).
    ///
    /// ```txt
    /// O---------→ x
    /// |
    /// |
    /// ↓
    /// y           P
    /// ```
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// assert_eq!(Pos::<i32>::MAX, Pos::<i32>::new(2147483647, 2147483647));
    /// assert_eq!(Pos::<u32>::MAX, Pos::<u32>::new(4294967295, 4294967295));
    /// ```
    pub const MAX: Self = Self {
        x: T::MAX,
        y: T::MAX,
    };

    /// A unit vector of length `1` in the positive x-direction, i.e. `(1, 0)`.
    ///
    /// Useful in combination with [`ops::Mul`] or [`ops::MulAssign`] to scale the vector.
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// let p = Pos::X * 5; // Scales the unit vector by 5
    /// assert_eq!(p, Pos::new(5, 0));
    ///
    /// let mut q = Pos::X;
    /// q *= 3; // Scales the unit vector by 3
    /// assert_eq!(q, Pos::new(3, 0));
    /// ```
    pub const X: Self = Self {
        x: T::ONE,
        y: T::ZERO,
    };

    /// A unit vector of length `1` in the positive y-direction, i.e. `(0, 1)`.
    ///
    /// Useful in combination with [`ops::Mul`] or [`ops::MulAssign`] to scale the vector.
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// let p = Pos::Y * 5; // Scales the unit vector by 5
    /// assert_eq!(p, Pos::new(0, 5));
    ///
    /// let mut q = Pos::Y;
    /// q *= 3; // Scales the unit vector by 3
    /// assert_eq!(q, Pos::new(0, 3));
    /// ```
    pub const Y: Self = Self {
        x: T::ZERO,
        y: T::ONE,
    };

    /// Creates a new point with the given `x` and `y` coordinates.
    ///
    /// An alternative to using the `Pos { x, y }` syntax.
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// assert_eq!(Pos::new(3, 4), Pos { x: 3, y: 4 });
    /// ```
    #[must_use]
    pub const fn new(x: T, y: T) -> Self {
        Self { x, y }
    }

    /// Returns an approximate normalized vector of the position.
    ///
    /// Exact normalization with integer math is not possible, so thhis method returns an
    /// approximation that is close enough for most use cases, such as calculating directions or
    /// distances.
    ///
    /// The result is a vector with the same direction as `self`, but with a magnitude as close to
    /// `1` as possible; the result is not guaranteed to have a magnitude of exactly `1`.
    #[must_use]
    pub fn normalized_approx(&self) -> Self {
        if self == &Self::ORIGIN {
            Self::ORIGIN
        } else {
            let gcd = internal::gcd(self.x, self.y);
            Self {
                x: self.x / gcd,
                y: self.y / gcd,
            }
        }
    }

    /// Compares two positions in row-major order (y primary, then x).
    ///
    /// This is the default [`Ord`] ordering for [`Pos`]. Provided as an explicit method for use
    /// when the ordering matters.
    ///
    /// For lexicographic (x-primary) ordering, use [`Pos::cmp_lexicographic`].
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// // Row-major: y first, then x — matches Ord::cmp
    /// assert_eq!(
    ///     Pos::new(1, 2).cmp_row_major(&Pos::new(0, 3)),
    ///     Pos::new(1, 2).cmp(&Pos::new(0, 3)),
    /// );
    /// ```
    #[must_use]
    pub fn cmp_row_major(&self, other: &Self) -> core::cmp::Ordering {
        self.cmp(other)
    }

    /// Compares two positions in lexicographic order (x primary, then y).
    ///
    /// Contrast with the default [`Ord`] implementation, which is row-major (y primary).
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// // Lexicographic: x first, then y
    /// assert_eq!(
    ///     Pos::new(1, 2).cmp_lexicographic(&Pos::new(0, 3)),
    ///     core::cmp::Ordering::Greater
    /// );
    /// ```
    #[must_use]
    pub fn cmp_lexicographic(&self, other: &Self) -> core::cmp::Ordering {
        self.x.cmp(&other.x).then(self.y.cmp(&other.y))
    }
}

impl<T: SignedInt> Pos<T> {
    /// A unit vector of length `1` in the negative x-direction, i.e. `(-1, 0)`.
    ///
    /// This is the negation of [`Pos::X`].
    ///
    /// Useful in combination with [`ops::Mul`] or [`ops::MulAssign`] to scale the vector.
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// let p = Pos::NEG_X * 5; // Scales the unit vector by 5
    /// assert_eq!(p, Pos::new(-5, 0));
    ///
    /// let mut q = Pos::NEG_X;
    /// q *= 3; // Scales the unit vector by 3
    /// assert_eq!(q, Pos::new(-3, 0));
    /// ```
    pub const NEG_X: Self = Self {
        x: T::NEG_ONE,
        y: T::ZERO,
    };

    /// A unit vector of length `1` in the negative y-direction, i.e. `(0, -1)`.
    ///
    /// This is the negation of [`Pos::Y`].
    ///
    /// Useful in combination with [`ops::Mul`] or [`ops::MulAssign`] to scale the vector.
    ///
    /// ## Examples
    ///
    /// ```rust
    /// use ixy::Pos;
    ///
    /// let p = Pos::NEG_Y * 5; // Scales the unit vector by 5
    /// assert_eq!(p, Pos::new(0, -5));
    ///
    /// let mut q = Pos::NEG_Y;
    /// q *= 3; // Scales the unit vector by 3
    /// assert_eq!(q, Pos::new(0, -3));
    /// ```
    pub const NEG_Y: Self = Self {
        x: T::ZERO,
        y: T::NEG_ONE,
    };
}

impl<T: Int> Display for Pos<T> {
    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
        write!(f, "({}, {})", self.x, self.y)
    }
}

impl<T: Int> PartialOrd for Pos<T> {
    fn partial_cmp(&self, other: &Self) -> Option<core::cmp::Ordering> {
        Some(self.cmp(other))
    }
}

impl<T: Int> Ord for Pos<T> {
    /// Compares two positions in **row-major** order (y primary, then x).
    ///
    /// This is the natural ordering for grid iteration: top-to-bottom, left-to-right within each
    /// row. For lexicographic (x-primary) ordering, use [`Pos::cmp_lexicographic`].
    fn cmp(&self, other: &Self) -> core::cmp::Ordering {
        self.y.cmp(&other.y).then(self.x.cmp(&other.x))
    }
}

impl<T: Int> Default for Pos<T> {
    fn default() -> Self {
        Self::ORIGIN
    }
}

impl<T: SignedInt> ops::Neg for Pos<T> {
    type Output = Self;

    fn neg(self) -> Self::Output {
        Self {
            x: -self.x,
            y: -self.y,
        }
    }
}

impl<T: Int> ops::Add<Self> for Pos<T> {
    type Output = Self;

    fn add(self, rhs: Self) -> Self::Output {
        Self {
            x: self.x + rhs.x,
            y: self.y + rhs.y,
        }
    }
}

impl<T: Int> ops::AddAssign<Self> for Pos<T> {
    fn add_assign(&mut self, rhs: Self) {
        self.x += rhs.x;
        self.y += rhs.y;
    }
}

impl<T: Int> ops::Sub<Self> for Pos<T> {
    type Output = Self;

    fn sub(self, rhs: Self) -> Self::Output {
        Self {
            x: self.x - rhs.x,
            y: self.y - rhs.y,
        }
    }
}

impl<T: Int> ops::SubAssign<Self> for Pos<T> {
    fn sub_assign(&mut self, rhs: Self) {
        self.x -= rhs.x;
        self.y -= rhs.y;
    }
}

impl<T: Int> ops::Mul<T> for Pos<T> {
    type Output = Self;

    fn mul(self, rhs: T) -> Self::Output {
        Self {
            x: self.x * rhs,
            y: self.y * rhs,
        }
    }
}

impl<T: Int> ops::MulAssign<T> for Pos<T> {
    fn mul_assign(&mut self, rhs: T) {
        self.x *= rhs;
        self.y *= rhs;
    }
}

impl<T: Int> ops::Mul<Self> for Pos<T> {
    type Output = Self;

    fn mul(self, rhs: Self) -> Self::Output {
        Self {
            x: self.x * rhs.x,
            y: self.y * rhs.y,
        }
    }
}

impl<T: Int> ops::MulAssign<Self> for Pos<T> {
    fn mul_assign(&mut self, rhs: Self) {
        self.x *= rhs.x;
        self.y *= rhs.y;
    }
}

impl<T: Int> ops::Div<T> for Pos<T> {
    type Output = Self;

    fn div(self, rhs: T) -> Self::Output {
        Self {
            x: self.x / rhs,
            y: self.y / rhs,
        }
    }
}

impl<T: Int> ops::DivAssign<T> for Pos<T> {
    fn div_assign(&mut self, rhs: T) {
        self.x /= rhs;
        self.y /= rhs;
    }
}

impl<T: Int> ops::Div<Self> for Pos<T> {
    type Output = Self;

    fn div(self, rhs: Self) -> Self::Output {
        Self {
            x: self.x / rhs.x,
            y: self.y / rhs.y,
        }
    }
}

impl<T: Int> ops::DivAssign<Self> for Pos<T> {
    fn div_assign(&mut self, rhs: Self) {
        self.x /= rhs.x;
        self.y /= rhs.y;
    }
}

impl<T: Int> From<(T, T)> for Pos<T> {
    fn from(value: (T, T)) -> Self {
        Self::new(value.0, value.1)
    }
}

impl<T: Int> From<Pos<T>> for (T, T) {
    fn from(pos: Pos<T>) -> Self {
        (pos.x, pos.y)
    }
}

impl<T: Int> From<[T; 2]> for Pos<T> {
    fn from(value: [T; 2]) -> Self {
        Self::new(value[0], value[1])
    }
}

impl<T: Int> From<Pos<T>> for [T; 2] {
    fn from(pos: Pos<T>) -> Self {
        [pos.x, pos.y]
    }
}

/// A trait for converting a `Pos<T>` to another type.
pub trait TryFromPos<T: Int>: Sized {
    /// Returns the type that the `Pos<T>` can be converted to.
    ///
    /// ## Errors
    ///
    /// If the conversion fails, returns a `TryFromPosError`.
    fn try_from_pos(value: Pos<T>) -> Result<Self, TryFromPosError>;
}

/// A trait for converting a `Pos<T>` from another type.
pub trait TryIntoPos<T: Int>: Sized {
    /// Returns the type that the `Pos<T>` can be converted to.
    ///
    /// ## Errors
    ///
    /// If the conversion fails, returns a `TryFromPosError`.
    fn try_into_pos(self) -> Result<Pos<T>, TryFromPosError>;
}

impl<T, U> TryIntoPos<U> for Pos<T>
where
    Pos<U>: TryFromPos<T>,
    U: Int,
    T: Int,
{
    fn try_into_pos(self) -> Result<Pos<U>, TryFromPosError> {
        Pos::<U>::try_from_pos(self)
    }
}

/// An error type for when a `Pos<T>` cannot be converted to another type.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum TryFromPosError {
    /// The value is out of range for the target type.
    OutOfRange,
}

impl<S: Int, T: Int + TryFrom<S>> TryFromPos<S> for Pos<T> {
    fn try_from_pos(value: Pos<S>) -> Result<Self, TryFromPosError> {
        let x = T::try_from(value.x).map_err(|_| TryFromPosError::OutOfRange)?;
        let y = T::try_from(value.y).map_err(|_| TryFromPosError::OutOfRange)?;
        Ok(Self::new(x, y))
    }
}

impl<T: Int> TryFrom<Pos<T>> for Size {
    type Error = TryFromPosError;

    fn try_from(value: Pos<T>) -> Result<Self, TryFromPosError> {
        let width = value
            .x
            .checked_to_usize()
            .ok_or(TryFromPosError::OutOfRange)?;
        let height = value
            .y
            .checked_to_usize()
            .ok_or(TryFromPosError::OutOfRange)?;
        Ok(Self::new(width, height))
    }
}

/// A position using `u16` coordinates — the natural type for terminal grids.
pub type Pos16 = Pos<u16>;

/// A position using `i32` coordinates — useful for signed offsets and deltas.
pub type PosI = Pos<i32>;

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

    #[test]
    fn layout_is_c_struct() {
        // Verifies that Pos and a #[repr(C)] struct with the same fields share the same
        // size and field offsets, ensuring the documented C layout guarantee holds.
        use core::mem::{offset_of, size_of};

        #[repr(C)]
        struct CPos {
            x: i32,
            y: i32,
        }

        assert_eq!(size_of::<Pos<i32>>(), size_of::<CPos>());
        assert_eq!(offset_of!(Pos<i32>, x), offset_of!(CPos, x));
        assert_eq!(offset_of!(Pos<i32>, y), offset_of!(CPos, y));
    }

    #[test]
    fn pos_macro() {
        const P: Pos<i32> = pos!(3, 4);
        assert_eq!(P.x, 3);
        assert_eq!(P.y, 4);
    }

    #[test]
    fn ord_row_major() {
        // Row-major: y primary, then x
        assert!(Pos::new(1, 2) < Pos::new(1, 3)); // y: 2 < 3
        assert!(Pos::new(1, 2) < Pos::new(2, 2)); // y equal, x: 1 < 2
        assert!(Pos::new(0, 3) > Pos::new(1, 2)); // y: 3 > 2
        assert!(Pos::new(2, 1) < Pos::new(1, 2)); // y: 1 < 2
    }

    #[test]
    fn cmp_row_major_y_primary() {
        // Same x, different y: row-major puts smaller y first
        assert_eq!(
            Pos::new(5, 2).cmp_row_major(&Pos::new(5, 3)),
            core::cmp::Ordering::Less
        );
    }

    #[test]
    fn cmp_row_major_x_secondary() {
        // Same y: falls through to x comparison
        assert_eq!(
            Pos::new(1, 3).cmp_row_major(&Pos::new(2, 3)),
            core::cmp::Ordering::Less
        );
    }

    #[test]
    fn cmp_row_major_matches_ord() {
        // cmp_row_major delegates to Ord::cmp
        let a = Pos::new(1, 2);
        let b = Pos::new(0, 3);
        assert_eq!(a.cmp_row_major(&b), a.cmp(&b));
    }

    #[test]
    fn cmp_lexicographic_x_primary() {
        // Same y, different x: lexicographic puts smaller x first
        assert_eq!(
            Pos::new(2, 5).cmp_lexicographic(&Pos::new(1, 5)),
            core::cmp::Ordering::Greater
        );
    }

    #[test]
    fn cmp_lexicographic_y_secondary() {
        // Same x: falls through to y comparison
        assert_eq!(
            Pos::new(3, 1).cmp_lexicographic(&Pos::new(3, 2)),
            core::cmp::Ordering::Less
        );
    }

    #[test]
    fn cmp_lexicographic_differs_from_ord() {
        // Lexicographic (x first) vs row-major (y first)
        let a = Pos::new(1, 2);
        let b = Pos::new(0, 3);
        assert_eq!(a.cmp_lexicographic(&b), core::cmp::Ordering::Greater); // x: 1 > 0
        assert_eq!(a.cmp(&b), core::cmp::Ordering::Less); // y: 2 < 3
    }

    #[test]
    fn cmp_row_major_equal() {
        assert_eq!(
            Pos::new(4, 5).cmp_row_major(&Pos::new(4, 5)),
            core::cmp::Ordering::Equal
        );
    }

    #[test]
    fn generic_t_defaults_to_i32() {
        let p: Pos = Pos::default();
        assert_eq!(p, Pos::<i32>::ORIGIN);
    }

    #[test]
    fn origin_is_0_0() {
        assert_eq!(Pos::ORIGIN, Pos::new(0, 0));
    }

    #[test]
    fn min_is_min_min() {
        assert_eq!(Pos::MIN, Pos::new(i32::MIN, i32::MIN));
    }

    #[test]
    fn max_is_max_max() {
        assert_eq!(Pos::MAX, Pos::new(i32::MAX, i32::MAX));
    }

    #[test]
    fn x_is_1_0() {
        assert_eq!(Pos::X, Pos::new(1, 0));
    }

    #[test]
    fn y_is_0_1() {
        assert_eq!(Pos::Y, Pos::new(0, 1));
    }

    #[test]
    fn new_x_y() {
        let p = Pos::new(3, 4);
        assert_eq!(p.x, 3);
        assert_eq!(p.y, 4);
    }

    #[test]
    fn default_is_origin() {
        let p: Pos<i32> = Pos::default();
        assert_eq!(p, Pos::ORIGIN);
    }

    #[test]
    fn negate() {
        let p = Pos::new(3, 4);
        assert_eq!(-p, Pos::new(-3, -4));
    }

    #[test]
    fn mul_by_scalar() {
        let p = Pos::new(3, 4) * 2;
        assert_eq!(p, Pos::new(6, 8));
    }

    #[test]
    fn mul_assign_by_scalar() {
        let mut p = Pos::new(3, 4);
        p *= 2;
        assert_eq!(p, Pos::new(6, 8));
    }

    #[test]
    fn from_tuple() {
        let pos = Pos::from((3, 4));
        assert_eq!(pos.x, 3);
        assert_eq!(pos.y, 4);
    }

    #[test]
    fn from_array() {
        let pos = Pos::from([3, 4]);
        assert_eq!(pos.x, 3);
        assert_eq!(pos.y, 4);
    }

    #[test]
    fn into_tuple() {
        let pos = Pos::new(3, 4);
        let tuple: (i32, i32) = pos.into();
        assert_eq!(tuple, (3, 4));
    }

    #[test]
    fn into_array() {
        let pos = Pos::new(3, 4);
        let array: [i32; 2] = pos.into();
        assert_eq!(array, [3, 4]);
    }

    #[test]
    fn try_from_pos_ok() {
        let source: Pos<u8> = Pos::new(3, 4);
        let convert = Pos::<i32>::try_from_pos(source).unwrap();
        assert_eq!(convert.x, 3);
        assert_eq!(convert.y, 4);
    }

    #[test]
    fn try_from_pos_out_of_range() {
        let source: Pos<u16> = Pos::new(7000, 8000);
        let result = Pos::<u8>::try_from_pos(source);
        assert!(result.is_err());
    }

    #[test]
    fn try_into_pos_ok() {
        let source: Pos<u8> = Pos::new(3, 4);
        let convert: Pos<i32> = source.try_into_pos().unwrap();
        assert_eq!(convert.x, 3);
        assert_eq!(convert.y, 4);
    }

    #[test]
    fn try_into_pos_out_of_range() {
        let source: Pos<u16> = Pos::new(7000, 8000);
        let result: Result<Pos<u8>, TryFromPosError> = source.try_into_pos();
        assert!(result.is_err());
    }

    #[test]
    fn add_pos() {
        let p1 = Pos::new(3, 4);
        let p2 = Pos::new(1, 2);
        assert_eq!(p1 + p2, Pos::new(4, 6));
    }

    #[test]
    fn add_assign_pos() {
        let mut p1 = Pos::new(3, 4);
        let p2 = Pos::new(1, 2);
        p1 += p2;
        assert_eq!(p1, Pos::new(4, 6));
    }

    #[test]
    fn sub_pos() {
        let p1 = Pos::new(3, 4);
        let p2 = Pos::new(1, 2);
        assert_eq!(p1 - p2, Pos::new(2, 2));
    }

    #[test]
    fn sub_assign_pos() {
        let mut p1 = Pos::new(3, 4);
        let p2 = Pos::new(1, 2);
        p1 -= p2;
        assert_eq!(p1, Pos::new(2, 2));
    }

    #[test]
    fn into_size() {
        let pos = Pos::new(3, 4);
        let size = Size::try_from(pos).unwrap();
        assert_eq!(size.width, 3);
        assert_eq!(size.height, 4);
    }

    #[test]
    fn into_size_wrapped() {
        let pos = Pos::new(-3, -4);
        let size = Size::try_from(pos);
        assert!(size.is_err());
    }

    #[test]
    fn normalized() {
        assert_eq!(Pos::new(0, 0).normalized_approx(), Pos::ORIGIN);
        assert_eq!(Pos::new(1, 0).normalized_approx(), Pos::X);
        assert_eq!(Pos::new(0, 1).normalized_approx(), Pos::Y);
        assert_eq!(Pos::new(2, 0).normalized_approx(), Pos::X);
        assert_eq!(Pos::new(0, 2).normalized_approx(), Pos::Y);
        assert_eq!(
            Pos::new(6, 8).normalized_approx(),
            Pos::new(3, 4).normalized_approx()
        );
    }

    #[test]
    fn mul_scalar() {
        let p = Pos::new(3, 4) * 2;
        assert_eq!(p, Pos::new(6, 8));
    }

    #[test]
    fn mul_assign_scalar() {
        let mut p = Pos::new(3, 4);
        p *= 2;
        assert_eq!(p, Pos::new(6, 8));
    }

    #[test]
    fn mul_pos() {
        let p1 = Pos::new(3, 4);
        let p2 = Pos::new(2, 3);
        assert_eq!(p1 * p2, Pos::new(6, 12));
    }

    #[test]
    fn mul_assign_pos() {
        let mut p1 = Pos::new(3, 4);
        let p2 = Pos::new(2, 3);
        p1 *= p2;
        assert_eq!(p1, Pos::new(6, 12));
    }

    #[test]
    fn div_scalar() {
        let p = Pos::new(6, 8) / 2;
        assert_eq!(p, Pos::new(3, 4));
    }

    #[test]
    fn div_assign_scalar() {
        let mut p = Pos::new(6, 8);
        p /= 2;
        assert_eq!(p, Pos::new(3, 4));
    }

    #[test]
    fn div_pos() {
        let p1 = Pos::new(6, 8);
        let p2 = Pos::new(2, 4);
        assert_eq!(p1 / p2, Pos::new(3, 2));
    }

    #[test]
    fn div_assign_pos() {
        let mut p1 = Pos::new(6, 8);
        let p2 = Pos::new(2, 4);
        p1 /= p2;
        assert_eq!(p1, Pos::new(3, 2));
    }

    #[test]
    fn pos16_alias() {
        let p: Pos16 = Pos16::new(1, 2);
        assert_eq!(p.x, 1u16);
        assert_eq!(p.y, 2u16);
    }

    #[test]
    fn posi_alias() {
        let p: PosI = PosI::new(1, 2);
        assert_eq!(p.x, 1i32);
        assert_eq!(p.y, 2i32);
    }
}