Struct Selection

Source

pub struct Selection(/* private fields */);

Expand description

A pixel selection within a view.

Implementations§

Source §

impl Selection

Source

pub fn new(x1: i32, y1: i32, x2: i32, y2: i32) -> Self

Create a new selection from a rectangle.

Source

pub fn from(r: Rect<i32>) -> Self

Create a new selection from a rectangle.

Source

pub fn bounds(&self) -> Rect<i32>

Return the selection bounds as a non-empty rectangle. This function will never return an empty rectangle.

Source

pub fn abs(&self) -> Selection

Return the absolute selection.

Source

pub fn translate(&mut self, x: i32, y: i32)

Translate the selection rectangle.

Source

pub fn resize(&mut self, x: i32, y: i32)

Resize the selection by a certain amount.

Methods from Deref<Target = Rect<i32>>§

Source

pub fn scale(&self, x: T, y: T) -> Rect<T>
where T: Mul<Output = T> + Copy,

Source

pub fn with_origin(&self, x: T, y: T) -> Rect<T>
where T: Add<Output = T> + Sub<Output = T> + Copy,

Return the rectangle with a different origin.

§Examples

use rgx::rect::Rect;

let r = Rect::new(1, 1, 4, 4);
assert_eq!(r.with_origin(0, 0), Rect::new(0, 0, 3, 3));

Source

pub fn with_size(&self, w: T, h: T) -> Rect<T>
where T: Add<Output = T> + Sub<Output = T> + Copy,

Return the rectangle with a different size.

§Examples

use rgx::rect::Rect;

let r = Rect::new(1, 1, 4, 4);
assert_eq!(r.with_size(9, 9), Rect::new(1, 1, 10, 10));

Source

pub fn expand(&self, x1: T, y1: T, x2: T, y2: T) -> Rect<T>
where T: Add<Output = T> + Sub<Output = T> + PartialOrd + Copy,

Return an expanded rectangle by a constant amount.

§Examples

use rgx::rect::Rect;

let r = Rect::new(0, 0, 3, 3);
assert_eq!(r.expand(1, 1, 1, 1), Rect::new(-1, -1, 4, 4));

let r = Rect::new(3, 3, 0, 0);
assert_eq!(r.expand(1, 1, 1, 1), Rect::new(4, 4, -1, -1));

let r = Rect::new(-1, 1, 1, -1);
assert_eq!(r.expand(4, 4, 4, 4), Rect::new(-5, 5, 5, -5));

Source

pub fn flip_y(&self) -> Rect<T>
where T: Copy,

Return the rectangle flipped in the Y axis.

Source

pub fn flip_x(&self) -> Rect<T>
where T: Copy,

Return the rectangle flipped in the X axis.

Source

pub fn area(&self) -> T
where T: Copy + Sub<Output = T> + PartialOrd + Mul<Output = T>,

Return the area of a rectangle.

Source

pub fn is_empty(&self) -> bool
where T: PartialEq,

Source

pub fn is_zero(&self) -> bool
where T: Zero,

Source

pub fn width(&self) -> T
where T: Copy + PartialOrd + Sub<Output = T>,

Return the width of the rectangle.

§Examples

use rgx::rect::Rect;

let r = Rect::new(0, 0, 3, 3);
assert_eq!(r.width(), 3);

Source

pub fn height(&self) -> T
where T: Copy + PartialOrd + Sub<Output = T>,

Return the height of the rectangle.

§Examples

use rgx::rect::Rect;

let r = Rect::origin(-6, -6);
assert_eq!(r.height(), 6);

Source

pub fn min(&self) -> Point2<T>
where T: PartialOrd + Copy,

Return the minimum point of a rectangle.

§Examples

use rgx::rect::Rect;
use rgx::math::Point2;

let r = Rect::new(0, 0, 1, -1);
assert_eq!(r.min(), Point2::new(0, -1));

Source

pub fn max(&self) -> Point2<T>
where T: PartialOrd + Copy,

Return the maximum point of a rectangle.

§Examples

use rgx::rect::Rect;
use rgx::math::Point2;

let r = Rect::origin(-1, 1);
assert_eq!(r.max(), Point2::new(0, 1));

Source

pub fn center(&self) -> Point2<T>
where T: Div<Output = T> + Copy + Ord + From<i16> + PartialOrd + Zero + Neg<Output = T> + Sub<Output = T>,

Return the center of the rectangle.

§Examples

use rgx::rect::Rect;
use rgx::math::Point2;

let r = Rect::origin(8, 8);
assert_eq!(r.center(), Point2::new(4, 4));

let r = Rect::new(0, 0, -8, -8);
assert_eq!(r.center(), Point2::new(-4, -4));

Source

pub fn radius(&self) -> T
where T: Div<Output = T> + Copy + From<i16> + PartialOrd + Zero + Neg<Output = T> + Sub<Output = T>,

Source

pub fn contains(&self, p: Point2<T>) -> bool
where T: Copy + PartialOrd,

Check whether the given point is contained in the rectangle.

use rgx::rect::Rect;
use rgx::math::Point2;

let r = Rect::origin(6, 6);
assert!(r.contains(Point2::new(0, 0)));
assert!(r.contains(Point2::new(3, 3)));
assert!(!r.contains(Point2::new(6, 6)));

let r = Rect::new(0, 0, -6, -6);
assert!(r.contains(Point2::new(-3, -3)));

Source

pub fn intersects(&self, other: Rect<T>) -> bool
where T: PartialOrd,

Source

pub fn abs(&self) -> Rect<T>
where T: Ord + Copy,

Return the absolute rectangle.

§Examples

use rgx::rect::Rect;

let r = Rect::new(3, 3, 1, 1).abs();
assert_eq!(r, Rect::new(1, 1, 3, 3));

let r = Rect::new(-1, -1, 1, 1).abs();
assert_eq!(r, Rect::new(-1, -1, 1, 1));

Source

pub fn intersection(&self, other: Rect<T>) -> Rect<T>
where T: Ord + Copy,

Return the intersection between two rectangles.

§Examples

use rgx::rect::Rect;

let other = Rect::new(0, 0, 3, 3);

let r = Rect::new(1, 1, 6, 6);
assert_eq!(r.intersection(other), Rect::new(1, 1, 3, 3));

let r = Rect::new(1, 1, 2, 2);
assert_eq!(r.intersection(other), Rect::new(1, 1, 2, 2));

let r = Rect::new(-1, -1, 3, 3);
assert_eq!(r.intersection(other), Rect::new(0, 0, 3, 3));

let r = Rect::new(-1, -1, 4, 4);
assert_eq!(r.intersection(other), other);

let r = Rect::new(4, 4, 5, 5);
assert!(r.intersection(other).is_empty());