243 lines
7.2 KiB
Rust
243 lines
7.2 KiB
Rust
use tiny_skia::*;
|
|
|
|
fn crate_triangle() -> Pixmap {
|
|
let mut paint = Paint::default();
|
|
paint.set_color_rgba8(50, 127, 150, 200);
|
|
paint.anti_alias = true;
|
|
|
|
let mut pb = PathBuilder::new();
|
|
pb.move_to(0.0, 20.0);
|
|
pb.line_to(20.0, 20.0);
|
|
pb.line_to(10.0, 0.0);
|
|
pb.close();
|
|
let path = pb.finish().unwrap();
|
|
|
|
let mut pixmap = Pixmap::new(20, 20).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
pixmap
|
|
}
|
|
|
|
#[test]
|
|
fn pad_nearest() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Pad,
|
|
FilterQuality::Nearest,
|
|
1.0,
|
|
Transform::identity(),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/pad-nearest.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|
|
|
|
#[test]
|
|
fn repeat_nearest() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Repeat,
|
|
FilterQuality::Nearest,
|
|
1.0,
|
|
Transform::identity(),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/repeat-nearest.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|
|
|
|
#[test]
|
|
fn reflect_nearest() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Reflect,
|
|
FilterQuality::Nearest,
|
|
1.0,
|
|
Transform::identity(),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/reflect-nearest.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|
|
|
|
// We have to test tile mode for bilinear/bicubic separately,
|
|
// because they're using a different algorithm from nearest.
|
|
#[test]
|
|
fn pad_bicubic() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Pad,
|
|
FilterQuality::Bicubic,
|
|
1.0,
|
|
// Transform must be set, otherwise we will fallback to Nearest.
|
|
Transform::from_row(1.1, 0.3, 0.0, 1.4, 0.0, 0.0),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/pad-bicubic.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|
|
|
|
#[test]
|
|
fn repeat_bicubic() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Repeat,
|
|
FilterQuality::Bicubic,
|
|
1.0,
|
|
// Transform must be set, otherwise we will fallback to Nearest.
|
|
Transform::from_row(1.1, 0.3, 0.0, 1.4, 0.0, 0.0),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/repeat-bicubic.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|
|
|
|
#[test]
|
|
fn reflect_bicubic() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Reflect,
|
|
FilterQuality::Bicubic,
|
|
1.0,
|
|
// Transform must be set, otherwise we will fallback to Nearest.
|
|
Transform::from_row(1.1, 0.3, 0.0, 1.4, 0.0, 0.0),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/reflect-bicubic.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|
|
|
|
#[test]
|
|
fn filter_nearest_no_ts() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Repeat,
|
|
FilterQuality::Nearest,
|
|
1.0,
|
|
Transform::identity(),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/filter-nearest-no-ts.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|
|
|
|
#[test]
|
|
fn filter_nearest() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Repeat,
|
|
FilterQuality::Nearest,
|
|
1.0,
|
|
Transform::from_row(1.5, 0.0, -0.4, -0.8, 5.0, 1.0),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/filter-nearest.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|
|
|
|
#[test]
|
|
fn filter_bilinear() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Repeat,
|
|
FilterQuality::Bilinear,
|
|
1.0,
|
|
Transform::from_row(1.5, 0.0, -0.4, -0.8, 5.0, 1.0),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/filter-bilinear.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|
|
|
|
#[test]
|
|
fn filter_bicubic() {
|
|
let triangle = crate_triangle();
|
|
|
|
let mut paint = Paint::default();
|
|
paint.shader = Pattern::new(
|
|
triangle.as_ref(),
|
|
SpreadMode::Repeat,
|
|
FilterQuality::Bicubic,
|
|
1.0,
|
|
Transform::from_row(1.5, 0.0, -0.4, -0.8, 5.0, 1.0),
|
|
);
|
|
|
|
let path = PathBuilder::from_rect(Rect::from_ltrb(10.0, 10.0, 190.0, 190.0).unwrap());
|
|
|
|
let mut pixmap = Pixmap::new(200, 200).unwrap();
|
|
pixmap.fill_path(&path, &paint, FillRule::Winding, Transform::identity(), None);
|
|
|
|
let expected = Pixmap::load_png("tests/images/pattern/filter-bicubic.png").unwrap();
|
|
assert_eq!(pixmap, expected);
|
|
}
|