shade 0.0.5

Another graphics library
Documentation 
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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258

use super::*;


/// Paint tool, fills shapes.
#[derive(Clone, Debug, PartialEq)]
pub struct Paint<T> {
	/// Vertex template.
	pub template: T,
}

impl<V: TVertex, U: TUniform> DrawBuilder<V, U> {
	/// Fills a rectangle.
	#[inline(never)]
	pub fn fill_rect<T: ToVertex<V>>(&mut self, paint: &Paint<T>, rc: &Bounds2f) {
		let vertices = [
			paint.template.to_vertex(rc.bottom_left(), 0),
			paint.template.to_vertex(rc.top_left(), 1),
			paint.template.to_vertex(rc.top_right(), 2),
			paint.template.to_vertex(rc.bottom_right(), 3),
		];
		let mut cv = self.begin(PrimType::Triangles, 4, 2);
		cv.add_indices_quad();
		cv.add_vertices(&vertices);
	}

	/// Fills a rectangle with an outline.
	#[inline(never)]
	pub fn fill_edge_rect<T: ToVertex<V>>(&mut self, paint: &Paint<T>, rc: &Bounds2f, thickness: f32) {
		let vertices = [
			paint.template.to_vertex(rc.top_left(), 1),
			paint.template.to_vertex(rc.top_right(), 2),
			paint.template.to_vertex(rc.bottom_right(), 3),
			paint.template.to_vertex(rc.bottom_left(), 0),
			paint.template.to_vertex(rc.top_left() + Vec2(thickness, thickness), 5),
			paint.template.to_vertex(rc.top_right() + Vec2(-thickness, thickness), 6),
			paint.template.to_vertex(rc.bottom_right() + Vec2(-thickness, -thickness), 7),
			paint.template.to_vertex(rc.bottom_left() + Vec2(thickness, -thickness), 4)
		];
		let mut cv = self.begin(PrimType::Triangles, 8, 8);
		cv.add_indices(&[
			0, 5, 4, 0, 1, 5,
			1, 6, 5, 1, 2, 6,
			2, 7, 6, 2, 3, 7,
			3, 4, 7, 3, 0, 4,
		]);
		cv.add_vertices(&vertices);
	}

	/// Fills a rounded rectangle.
	#[inline(never)]
	pub fn fill_round_rect<T: ToVertex<V>>(&mut self, paint: &Paint<T>, rc: &Bounds2f, sx: f32, sy: f32, _segments: i32) {
		// Fixup parameters
		let sx = if sx + sx > rc.width() { rc.width() * 0.5 } else { sx };
		let sy = if sy + sy > rc.height() { rc.height() * 0.5 } else { sy };

		// Edge case: just fill a rectangle
		if sx <= 0.0 || sy <= 0.0 {
			return self.fill_rect(paint, rc);
		}

		// TODO? Do it properly so the edges are synced up
		unimplemented!()
	}

	/// Fills a convex shape.
	#[inline(never)]
	pub fn fill_convex<T: ToVertex<V>>(&mut self, paint: &Paint<T>, pts: &[Point2f]) {
		// Degenerate convex shape
		if pts.len() < 3 {
			return;
		}
		// n vertices, n - 2 primitives, (n - 2) * 3 indices
		let n = pts.len() - 2;
		let mut cv = self.begin(PrimType::Triangles, pts.len(), n);
		// Add indices
		for i in 0..n as u32 {
			cv.add_index3(i, i + 1, n as u32 + 1);
		}
		// Add vertices
		for v in 0..pts.len() {
			cv.add_vertex(paint.template.to_vertex(pts[v], v));
		}
	}

	/// Fills a polygon shape.
	#[inline(never)]
	pub fn fill_polygon<T: ToVertex<V>>(&mut self, paint: &Paint<T>, pts: &[Point2f], triangles: &[Index3]) {
		let mut cv = self.begin(PrimType::Triangles, pts.len(), triangles.len());
		// Add indices
		for i in 0..triangles.len() {
			// Must be indices into the points slice
			let Index3 { p1, p2, p3 } = triangles[i];
			let _ = pts[p1 as usize];
			let _ = pts[p2 as usize];
			let _ = pts[p3 as usize];
			cv.add_index3(p1 as u32, p2 as u32, p3 as u32);
		}
		// Add vertices
		for v in 0..pts.len() {
			cv.add_vertex(paint.template.to_vertex(pts[v], v));
		}
	}

	/// Fills a polygon shape with pre-made vertices.
	#[inline(never)]
	pub fn fill_polygon2(&mut self, vertices: &[V], triangles: &[Index3]) {
		let mut cv = self.begin(PrimType::Triangles, vertices.len(), triangles.len());
		// Add indices
		for i in 0..triangles.len() {
			// Must be indices into the points slice
			let Index3 { p1, p2, p3 } = triangles[i];
			let _ = vertices[p1 as usize];
			let _ = vertices[p2 as usize];
			let _ = vertices[p3 as usize];
			cv.add_index3(p1 as u32, p2 as u32, p3 as u32);
		}
		// Add vertices
		cv.add_vertices(vertices);
	}

	/// Fills an arbitrary quad.
	#[inline(never)]
	pub fn fill_quad<T: ToVertex<V>>(&mut self, paint: &Paint<T>, bottom_left: &Point2f, top_left: &Point2f, top_right: &Point2f, bottom_right: &Point2f) {
		let vertices = [
			paint.template.to_vertex(*bottom_left, 0),
			paint.template.to_vertex(*top_left, 1),
			paint.template.to_vertex(*top_right, 2),
			paint.template.to_vertex(*bottom_right, 3),
		];
		let mut cv = self.begin(PrimType::Triangles, 4, 2);
		cv.add_indices_quad();
		cv.add_vertices(&vertices);
	}

	/// Fills an ellipse.
	#[inline(never)]
	pub fn fill_ellipse<T: ToVertex<V>>(&mut self, paint: &Paint<T>, rc: &Bounds2f, segments: i32) {
		// n + 1 vertices, n primitives, n * 3 indices
		let n = cmp::max(3, segments) as usize;
		let mut cv = self.begin(PrimType::Triangles, n + 1, n);

		// Precompute trigs
		let (s, c) = (Angle::TURN / (n as i32 as f32)).sin_cos();
		let radius = rc.size() * 0.5;
		let center = rc.top_left() + radius;
		let mut pt = Point2(1.0, 0.0);

		// Add indices
		for i in 1..n {
			cv.add_index3(0, i as u32, i as u32 + 1);
		}
		cv.add_index3(0, n as u32 - 1, 1);

		// Add vertices
		// http://slabode.exofire.net/circle_draw.shtml
		cv.add_vertex(paint.template.to_vertex(center, 0));
		for i in 0..n {
			let pos = pt * radius + center;
			cv.add_vertex(paint.template.to_vertex(pos, i + 1));
			// Apply rotation matrix
			let x = pt.x;
			pt.x = c * x - s * pt.y;
			pt.y = s * x + c * pt.y;
		}
	}

	/// Fills a pie slice.
	#[inline(never)]
	pub fn fill_pie<T: ToVertex<V>>(&mut self, paint: &Paint<T>, rc: &Bounds2f, start: Angle<f32>, sweep: Angle<f32>, segments: i32) {
		// n + 2 vertices, n primitives, n * 3 indices
		let n = cmp::max(2, segments) as usize;
		let mut cv = self.begin(PrimType::Triangles, n + 2, n);

		// Add indices
		for i in 1..n + 1 {
			cv.add_index3(0, i as u32, i as u32 + 1);
		}

		// Precompute trigs
		let (s, c) = (sweep / (n as i32 as f32)).sin_cos();
		let radius = rc.size() * 0.5;
		let center = rc.top_left() + radius;
		let mut pt = {
			let (y, x) = start.sin_cos();
			Point2(x, y)
		};

		// Add vertices
		// http://slabode.exofire.net/circle_draw.shtml
		cv.add_vertex(paint.template.to_vertex(center, 0));
		for i in 0..n + 1 {
			let pos = pt * radius + center;
			cv.add_vertex(paint.template.to_vertex(pos, i + 1));
			// Apply rotation matrix
			let x = pt.x;
			pt.x = c * x - s * pt.y;
			pt.y = s * x + c * pt.y;
		}
	}

	/// Fills a ring.
	#[inline(never)]
	pub fn fill_ring<T: ToVertex<V>>(&mut self, paint: &Paint<T>, rc: &Bounds2f, thickness: f32, segments: i32) {
		// n * 2 vertices, n * 2 primitives, n * 6 indices
		let n = cmp::max(3, segments) as usize;
		let mut cv = self.begin(PrimType::Triangles, n * 2, n * 2);

		// Add indices
		for i in 0..n - 1 {
			let v = i * 2;
			cv.add_index3(v as u32, (v + 1) as u32, (v + 2) as u32);
			cv.add_index3((v + 1) as u32, (v + 2) as u32, (v + 3) as u32);
		}
		{
			let v = (n - 1) * 2;
			cv.add_index3(v as u32, (v + 1) as u32, 0);
			cv.add_index3((v + 1) as u32, 0, 1);
		}

		// Precompute trigs
		let (s, c) = (Angle::TURN / (n as i32 as f32)).sin_cos();
		let radius = rc.size() * 0.5;
		let width = radius - Point2::dup(thickness);
		let center = rc.top_left() + radius;
		let mut pt = Point2(1.0, 0.0);

		// Add vertices
		// http://slabode.exofire.net/circle_draw.shtml
		for i in 0..n {
			let pos = pt * radius + center;
			cv.add_vertex(paint.template.to_vertex(pos, i * 2));
			let pos = pt * width + center;
			cv.add_vertex(paint.template.to_vertex(pos, i * 2 + 1));
			// Apply rotation matrix
			let x = pt.x;
			pt.x = c * x - s * pt.y;
			pt.y = s * x + c * pt.y;
		}
	}

	pub fn fill_bezier2<T: ToVertex<V>>(&mut self, paint: &Paint<T>, pivot: &Point2f, pts: &[Point2f; 3], segments: i32) {
		// n + 2 vertices, n primitives, n * 3 indices
		let n = cmp::max(2, segments) as usize;
		let mut cv = self.begin(PrimType::Triangles, n + 2, n);

		// Add indices
		for i in 1..n + 1 {
			cv.add_index3(0, i as u32, i as u32 + 1);
		}

		// Add vertices
		cv.add_vertex(paint.template.to_vertex(*pivot, 0));
		for v in 1..n + 2 {
			let pt = curve::bezier2(v as i32 as f32 / n as i32 as f32, pts[0], pts[1], pts[2]);
			cv.add_vertex(paint.template.to_vertex(pt, v));
		}
	}
}