1// This shader draws a checkerboard pattern
2#import bevy_ui::ui_vertex_output::UiVertexOutput
3
4@fragment
5fn fragment(in: UiVertexOutput) -> @location(0) vec4<f32> {
6    let uv = (in.uv - vec2<f32>(0.5, 0.5)) * in.size / 16.;
7    let check = select(0.0, 1.0, (fract(uv.x) < 0.5) != (fract(uv.y) < 0.5));
8    let bg = mix(vec3<f32>(0.2, 0.2, 0.2), vec3<f32>(0.6, 0.6, 0.6), check);
9
10    let size = vec2<f32>(in.size.x, in.size.y);
11    let external_distance = sd_rounded_box((in.uv - 0.5) * size, size, in.border_radius);
12    let alpha = smoothstep(0.5, -0.5, external_distance);
13
14    return vec4<f32>(bg, alpha);
15}
16
17// From: https://github.com/bevyengine/bevy/pull/8973
18// The returned value is the shortest distance from the given point to the boundary of the rounded box.
19// Negative values indicate that the point is inside the rounded box, positive values that the point is outside, and zero is exactly on the boundary.
20// arguments
21// point -> The function will return the distance from this point to the closest point on the boundary.
22// size -> The maximum width and height of the box.
23// corner_radii -> The radius of each rounded corner. Ordered counter clockwise starting top left:
24//                      x = top left, y = top right, z = bottom right, w = bottom left.
25fn sd_rounded_box(point: vec2<f32>, size: vec2<f32>, corner_radii: vec4<f32>) -> f32 {
26    // if 0.0 < y then select bottom left (w) and bottom right corner radius (z)
27    // else select top left (x) and top right corner radius (y)
28    let rs = select(corner_radii.xy, corner_radii.wz, 0.0 < point.y);
29    // w and z are swapped so that both pairs are in left to right order, otherwise this second select statement would return the incorrect value for the bottom pair.
30    let radius = select(rs.x, rs.y, 0.0 < point.x);
31    // Vector from the corner closest to the point, to the point
32    let corner_to_point = abs(point) - 0.5 * size;
33    // Vector from the center of the radius circle to the point
34    let q = corner_to_point + radius;
35    // length from center of the radius circle to the point, 0s a component if the point is not within the quadrant of the radius circle that is part of the curved corner.
36    let l = length(max(q, vec2(0.0)));
37    let m = min(max(q.x, q.y), 0.0);
38    return l + m - radius;
39}