pub struct Affine(_);
Expand description
A 2D affine transform.
Implementations§
§impl Affine
impl Affine
pub const FLIP_Y: Affine = Affine::new([1.0, 0., 0., -1.0, 0., 0.])
pub const FLIP_Y: Affine = Affine::new([1.0, 0., 0., -1.0, 0., 0.])
A transform that is flipped on the y-axis. Useful for converting between y-up and y-down spaces.
pub const FLIP_X: Affine = Affine::new([-1.0, 0., 0., 1.0, 0., 0.])
pub const FLIP_X: Affine = Affine::new([-1.0, 0., 0., 1.0, 0., 0.])
A transform that is flipped on the x-axis.
pub const fn new(c: [f64; 6]) -> Affine
pub const fn new(c: [f64; 6]) -> Affine
Construct an affine transform from coefficients.
If the coefficients are (a, b, c, d, e, f)
, then the resulting
transformation represents this augmented matrix:
| a c e |
| b d f |
| 0 0 1 |
Note that this convention is transposed from PostScript and
Direct2D, but is consistent with the
Wikipedia
formulation of affine transformation as augmented matrix. The
idea is that (A * B) * v == A * (B * v)
, where *
is the
Mul
trait.
pub const fn scale_non_uniform(s_x: f64, s_y: f64) -> Affine
pub const fn scale_non_uniform(s_x: f64, s_y: f64) -> Affine
An affine transform representing non-uniform scaling with different scale values for x and y
pub fn rotate(th: f64) -> Affine
pub fn rotate(th: f64) -> Affine
An affine transform representing rotation.
The convention for rotation is that a positive angle rotates a positive X direction into positive Y. Thus, in a Y-down coordinate system (as is common for graphics), it is a clockwise rotation, and in Y-up (traditional for math), it is anti-clockwise.
The angle, th
, is expressed in radians.
pub fn translate<V>(p: V) -> Affinewhere
V: Into<Vec2>,
pub fn translate<V>(p: V) -> Affinewhere
V: Into<Vec2>,
An affine transform representing translation.
pub fn map_unit_square(rect: Rect) -> Affine
pub fn map_unit_square(rect: Rect) -> Affine
Creates an affine transformation that takes the unit square to the given rectangle.
Useful when you want to draw into the unit square but have your output fill any rectangle.
In this case push the Affine
onto the transform stack.
pub fn determinant(self) -> f64
pub fn determinant(self) -> f64
Compute the determinant of this transform.
pub fn inverse(self) -> Affine
pub fn inverse(self) -> Affine
Compute the inverse transform.
Produces NaN values when the determinant is zero.
pub fn transform_rect_bbox(self, rect: Rect) -> Rect
pub fn transform_rect_bbox(self, rect: Rect) -> Rect
Compute the bounding box of a transformed rectangle.
Returns the minimal Rect
that encloses the given Rect
after affine transformation.
If the transform is axis-aligned, then this bounding box is “tight”, in other words the
returned Rect
is the transformed rectangle.
The returned rectangle always has non-negative width and height.
Trait Implementations§
§impl From<TranslateScale> for Affine
impl From<TranslateScale> for Affine
§fn from(ts: TranslateScale) -> Affine
fn from(ts: TranslateScale) -> Affine
§impl MulAssign<Affine> for Affine
impl MulAssign<Affine> for Affine
§fn mul_assign(&mut self, other: Affine)
fn mul_assign(&mut self, other: Affine)
*=
operation. Read more