graphene/rect.rs
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91
// Take a look at the license at the top of the repository in the LICENSE file.
use std::fmt;
use glib::translate::*;
use crate::{ffi, Rect, Vec2};
impl Rect {
/// Computes the four vertices of a [`Rect`][crate::Rect].
///
/// # Returns
///
///
/// ## `vertices`
/// return location for an array
/// of 4 [`Vec2`][crate::Vec2]
#[doc(alias = "graphene_rect_get_vertices")]
#[doc(alias = "get_vertices")]
pub fn vertices(&self) -> &[Vec2; 4] {
unsafe {
let mut out: [ffi::graphene_vec2_t; 4] = std::mem::zeroed();
ffi::graphene_rect_get_vertices(self.to_glib_none().0, &mut out as *mut _);
&*(&out as *const [ffi::graphene_vec2_t; 4] as *const [Vec2; 4])
}
}
/// Initializes the given [`Rect`][crate::Rect] with the given values.
///
/// This function will implicitly normalize the [`Rect`][crate::Rect]
/// before returning.
/// ## `x`
/// the X coordinate of the [`Rect`][crate::Rect]
/// ## `y`
/// the Y coordinate of the [`Rect`][crate::Rect]
/// ## `width`
/// the width of the [`Rect`][crate::Rect]
/// ## `height`
/// the height of the [`Rect`][crate::Rect]
///
/// # Returns
///
/// the initialized rectangle
#[doc(alias = "graphene_rect_init")]
pub fn new(x: f32, y: f32, width: f32, height: f32) -> Self {
assert_initialized_main_thread!();
unsafe {
let mut rect = Self::uninitialized();
ffi::graphene_rect_init(rect.to_glib_none_mut().0, x, y, width, height);
rect
}
}
}
impl fmt::Debug for Rect {
fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
f.debug_struct("Rect")
.field("x", &self.x())
.field("y", &self.y())
.field("width", &self.width())
.field("height", &self.height())
.finish()
}
}
impl Default for Rect {
fn default() -> Self {
Self::zero()
}
}
#[cfg(test)]
mod tests {
use super::*;
use crate::Point;
#[test]
fn contains_point() {
let rect = Rect::new(100., 100., 100., 100.);
let right = Point::new(250., 150.);
let below = Point::new(150., 50.);
let left = Point::new(50., 150.);
let above = Point::new(150., 250.);
assert!(!rect.contains_point(&right));
assert!(!rect.contains_point(&below));
assert!(!rect.contains_point(&left));
assert!(!rect.contains_point(&above));
}
}