math2d 0.1.3

//! Rounded rectangle. See the struct documentation for more information.

use ellipse::Ellipse;
use point2f::Point2f;
use rectf::{RectCorner, Rectf};

#[cfg(all(windows, feature = "d2d"))]
use winapi::um::d2d1::D2D1_ROUNDED_RECT;

/// Represents a rectangle with rounded corners described by ellipses that
/// touch the internal edges of the rectangle at the tangent points.
/// 
/// <img src="https://i.imgur.com/TFxM8zJ.png"
///      alt="Diagram visualizing the meaning of the structure components"
///      style="max-width: 350px" />
#[derive(Copy, Clone, Debug, Default, PartialEq)]
#[cfg_attr(feature = "serde_derive", derive(Serialize, Deserialize))]
#[repr(C)]
pub struct RoundedRect {
    /// The overall rectangle containing this rounded rectangle
    pub rect: Rectf,
    /// The x-radius of the ellipse nested in each corner.
    pub radius_x: f32,
    /// The y-radius of the ellipse nested in each corner.
    pub radius_y: f32,
}

impl RoundedRect {
    /// Constructs the rounded rectangle from its components
    #[inline]
    pub fn new(rect: impl Into<Rectf>, rx: f32, ry: f32) -> RoundedRect {
        RoundedRect {
            rect: rect.into(),
            radius_x: rx,
            radius_y: ry,
        }
    }

    /// Gets the ellipse that resides in the given corner of the rectangle
    #[inline]
    pub fn corner_ellipse(&self, corner: RectCorner) -> Ellipse {
        let rect_corner = self.rect.corner(corner);
        let center = match corner {
            RectCorner::TopLeft => rect_corner + [self.radius_x, self.radius_y],
            RectCorner::TopRight => rect_corner + [-self.radius_x, self.radius_y],
            RectCorner::BottomLeft => rect_corner + [self.radius_x, -self.radius_y],
            RectCorner::BottomRight => rect_corner + [-self.radius_x, -self.radius_y],
        };

        Ellipse {
            center,
            radius_x: self.radius_x,
            radius_y: self.radius_y,
        }
    }

    /// Checks if the given point resides within the rounded rectangle, taking
    /// care to exclude the parts of the corners that are excluded from the
    /// ellipses.
    #[inline]
    pub fn contains_point(&self, point: impl Into<Point2f>) -> bool {
        let point = point.into();

        if !self.rect.contains_point(point) {
            return false;
        }

        let center = self.rect.center();
        let rpoint = center + (point - center).abs();
        let corner = self.corner_ellipse(RectCorner::BottomRight);

        if rpoint.x <= corner.center.x || rpoint.y <= corner.center.y {
            return true;
        }

        corner.contains_point(rpoint)
    }

    /// Checks if the point resides within the rectangle without checking the
    /// corner cases of being inside the square rectangle but not inside the
    /// rounded corners. This function may be decently faster than
    /// `contains_point`.
    #[inline]
    pub fn contains_point_crude(&self, point: impl Into<Point2f>) -> bool {
        self.rect.contains_point(point)
    }
}

impl<R> From<(R, f32, f32)> for RoundedRect
where
    R: Into<Rectf>,
{
    #[inline]
    fn from((rect, rx, ry): (R, f32, f32)) -> RoundedRect {
        RoundedRect::new(rect, rx, ry)
    }
}

#[cfg(all(windows, feature = "d2d"))]
impl From<RoundedRect> for D2D1_ROUNDED_RECT {
    #[inline]
    fn from(rect: RoundedRect) -> D2D1_ROUNDED_RECT {
        D2D1_ROUNDED_RECT {
            rect: rect.rect.into(),
            radiusX: rect.radius_x,
            radiusY: rect.radius_y,
        }
    }
}

#[cfg(all(windows, feature = "d2d"))]
impl From<D2D1_ROUNDED_RECT> for RoundedRect {
    #[inline]
    fn from(rect: D2D1_ROUNDED_RECT) -> RoundedRect {
        RoundedRect {
            rect: rect.rect.into(),
            radius_x: rect.radiusX,
            radius_y: rect.radiusY,
        }
    }
}

#[cfg(test)]
mod tests {
    use rounded_rect::RoundedRect;

    #[test]
    fn contains_point() {
        let rect = RoundedRect::new([0.0, 0.0, 2.0, 2.0], 0.5, 0.25);

        assert!(rect.contains_point_crude((0.0, 0.0)));
        assert!(rect.contains_point_crude((0.0, 2.0)));
        assert!(rect.contains_point_crude((2.0, 0.0)));
        assert!(rect.contains_point_crude((2.0, 2.0)));

        assert!(!rect.contains_point((0.0, 0.0)));
        assert!(!rect.contains_point((0.0, 2.0)));
        assert!(!rect.contains_point((2.0, 0.0)));
        assert!(!rect.contains_point((2.0, 2.0)));

        assert!(rect.contains_point_crude((0.25, 0.125)));
        assert!(rect.contains_point_crude((0.25, 1.875)));
        assert!(rect.contains_point_crude((1.75, 0.125)));
        assert!(rect.contains_point_crude((1.75, 1.875)));

        assert!(rect.contains_point((0.25, 0.125)));
        assert!(rect.contains_point((0.25, 1.875)));
        assert!(rect.contains_point((1.75, 0.125)));
        assert!(rect.contains_point((1.75, 1.875)));

        assert!(rect.contains_point_crude((0.125, 0.0625)));
        assert!(rect.contains_point_crude((0.125, 1.9375)));
        assert!(rect.contains_point_crude((1.875, 0.0625)));
        assert!(rect.contains_point_crude((1.875, 1.9375)));

        assert!(!rect.contains_point((0.125, 0.0625)));
        assert!(!rect.contains_point((0.125, 1.9375)));
        assert!(!rect.contains_point((1.875, 0.0625)));
        assert!(!rect.contains_point((1.875, 1.9375)));
    }

    #[test]
    #[cfg(all(windows, feature = "d2d"))]
    fn round_rect_d2d_bin_compat() {
        use std::mem::size_of_val;
        use winapi::um::d2d1::D2D1_ROUNDED_RECT;

        fn ptr_eq<T>(a: &T, b: &T) -> bool {
            (a as *const T) == (b as *const T)
        }

        let rect = RoundedRect::new([0.0, 0.0, 2.0, 2.0], 1.0, 1.0);
        let d2d = unsafe { &*((&rect) as *const _ as *const D2D1_ROUNDED_RECT) };

        assert!(ptr_eq(&rect.rect.left, &d2d.rect.left));
        assert!(ptr_eq(&rect.rect.top, &d2d.rect.top));
        assert!(ptr_eq(&rect.rect.right, &d2d.rect.right));
        assert!(ptr_eq(&rect.rect.bottom, &d2d.rect.bottom));
        assert!(ptr_eq(&rect.radius_x, &d2d.radiusX));
        assert!(ptr_eq(&rect.radius_y, &d2d.radiusY));
        assert_eq!(size_of_val(&rect), size_of_val(d2d));
    }
}