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
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
// MIT License
//
// Copyright (c) 2023 Michael H. Phillips
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//

use scad_tree_math::Mt4;

use crate::prelude::*;

/// Viewer struct is used to view points, edges, and curves in OpenSCAD.
pub struct Viewer {
    point_radius: f64,
    edge_radius: f64,
    segments: u64,
    scad: Option<Scad>,
}

impl Viewer {
    pub fn new(point_radius: f64, edge_radius: f64, segments: u64) -> Self {
        Self {
            point_radius,
            edge_radius,
            segments,
            scad: None,
        }
    }

    pub fn add_pt2(&mut self, point: Pt2, color: ScadColor) {
        let s = translate!([point.x, point.y, 0.0],
            color!(c=color,
                sphere!(self.point_radius, fn=self.segments);
            );
        );
        if let Some(scad) = &mut self.scad {
            self.scad = Some(scad.clone() + s);
        } else {
            self.scad = Some(s);
        }
    }

    pub fn add_pt3(&mut self, point: Pt3, color: ScadColor) {
        let s = translate!([point.x, point.y, point.z],
            color!(c=color,
                sphere!(self.point_radius, fn=self.segments);
            );
        );
        if let Some(scad) = &mut self.scad {
            self.scad = Some(scad.clone() + s);
        } else {
            self.scad = Some(s);
        }
    }

    pub fn add_pt2s(&mut self, points: &Pt2s, color: ScadColor) {
        let mut children = Vec::with_capacity(points.len());
        for point in points.iter() {
            let s = translate!([point.x, point.y, 0.0],
                sphere!(self.point_radius, fn=self.segments);
            );
            children.push(s);
        }
        let child = Scad {
            op: ScadOp::Color {
                rgba: None,
                color: Some(color),
                hex: None,
                alpha: Some(1.0),
            },
            children,
        };
        if let Some(scad) = &mut self.scad {
            self.scad = Some(Scad {
                op: ScadOp::Union,
                children: vec![scad.clone(), child],
            });
        } else {
            self.scad = Some(Scad {
                op: ScadOp::Union,
                children: vec![child],
            });
        }
    }

    pub fn add_pt3s(&mut self, points: &Pt3s, color: ScadColor) {
        let mut children = Vec::with_capacity(points.len());
        for point in points.iter() {
            let s = translate!([point.x, point.y, point.z],
                sphere!(self.point_radius, fn=self.segments);
            );
            children.push(s);
        }
        let child = Scad {
            op: ScadOp::Color {
                rgba: None,
                color: Some(color),
                hex: None,
                alpha: Some(1.0),
            },
            children,
        };
        if let Some(scad) = &mut self.scad {
            self.scad = Some(Scad {
                op: ScadOp::Union,
                children: vec![scad.clone(), child],
            });
        } else {
            self.scad = Some(Scad {
                op: ScadOp::Union,
                children: vec![child],
            });
        }
    }

    pub fn add_lines2d(&mut self, edges: &Vec<(Pt2, Pt2)>, color: ScadColor) {
        let mut children = Vec::new();
        for (start, end) in edges {
            let matrix =
                Mt4::look_at_matrix_lh(start.as_pt3(0.0), end.as_pt3(0.0), Pt3::new(0.0, 0.0, 1.0));
            let mut c =
                Polyhedron::cylinder(self.edge_radius, (*end - *start).len(), self.segments);
            c.apply_matrix(&matrix);
            c.translate(start.as_pt3(0.0));

            children.push(polyhedron!(c.points, c.faces));
        }
        let child = Scad {
            op: ScadOp::Color {
                rgba: None,
                color: Some(color),
                hex: None,
                alpha: Some(1.0),
            },
            children,
        };
        if let Some(scad) = &mut self.scad {
            self.scad = Some(Scad {
                op: ScadOp::Union,
                children: vec![scad.clone(), child],
            });
        } else {
            self.scad = Some(Scad {
                op: ScadOp::Union,
                children: vec![child],
            });
        }
    }

    pub fn add_lines3d(&mut self, edges: &Vec<(Pt3, Pt3)>, color: ScadColor) {
        let mut children = Vec::new();
        for (start, end) in edges {
            let matrix = Mt4::look_at_matrix_lh(*start, *end, Pt3::new(0.0, 0.0, 1.0));
            let mut c =
                Polyhedron::cylinder(self.edge_radius, (*end - *start).len(), self.segments);
            c.apply_matrix(&matrix);
            c.translate(*start);

            children.push(polyhedron!(c.points, c.faces));
        }
        let child = Scad {
            op: ScadOp::Color {
                rgba: None,
                color: Some(color),
                hex: None,
                alpha: Some(1.0),
            },
            children,
        };
        if let Some(scad) = &mut self.scad {
            self.scad = Some(Scad {
                op: ScadOp::Union,
                children: vec![scad.clone(), child],
            });
        } else {
            self.scad = Some(Scad {
                op: ScadOp::Union,
                children: vec![child],
            });
        }
    }

    pub fn add_quadratic_bezier2d(&mut self, curve: &QuadraticBezier2D) {
        let points = curve.gen_points();
        self.add_pt2s(&points, ScadColor::DarkSlateGray);

        let edge_count = points.len() - 1;
        let mut edges = Vec::with_capacity(edge_count + 2); // 2 extra for handles
        for i in 0..points.len() - 1 {
            edges.push((points[i], points[i + 1]));
        }

        self.add_lines2d(&edges, ScadColor::White);
        self.add_lines2d(
            &vec![(curve.start, curve.control), (curve.end, curve.control)],
            ScadColor::Green,
        );
        self.add_pt2(curve.control, ScadColor::Green);
    }

    pub fn add_quadratic_bezier3d(&mut self, curve: &QuadraticBezier3D) {
        let points = curve.gen_points();
        self.add_pt3s(&points, ScadColor::DarkSlateGray);

        let edge_count = points.len() - 1;
        let mut edges = Vec::with_capacity(edge_count + 2); // 2 extra for handles
        for i in 0..points.len() - 1 {
            edges.push((points[i], points[i + 1]));
        }

        self.add_lines3d(&edges, ScadColor::White);
        self.add_lines3d(
            &vec![(curve.start, curve.control), (curve.end, curve.control)],
            ScadColor::Green,
        );
        self.add_pt3(curve.control, ScadColor::Green);
    }

    pub fn add_cubic_bezier2d(&mut self, curve: &CubicBezier2D) {
        let points = curve.gen_points();
        self.add_pt2s(&points, ScadColor::DarkSlateGray);

        let edge_count = points.len() - 1;
        let mut edges = Vec::with_capacity(edge_count + 2); // 2 extra for handles
        for i in 0..points.len() - 1 {
            edges.push((points[i], points[i + 1]));
        }

        self.add_lines2d(&edges, ScadColor::White);
        self.add_lines2d(
            &vec![(curve.start, curve.control1), (curve.end, curve.control2)],
            ScadColor::Green,
        );
        self.add_pt2(curve.control1, ScadColor::Green);
        self.add_pt2(curve.control2, ScadColor::Green);
    }

    pub fn add_cubic_bezier3d(&mut self, curve: &CubicBezier3D) {
        let points = curve.gen_points();
        self.add_pt3s(&points, ScadColor::DarkSlateGray);

        let edge_count = points.len() - 1;
        let mut edges = Vec::with_capacity(edge_count + 2); // 2 extra for handles
        for i in 0..points.len() - 1 {
            edges.push((points[i], points[i + 1]));
        }

        self.add_lines3d(&edges, ScadColor::White);
        self.add_lines3d(
            &vec![(curve.start, curve.control1), (curve.end, curve.control2)],
            ScadColor::Green,
        );
        self.add_pt3(curve.control1, ScadColor::Green);
        self.add_pt3(curve.control2, ScadColor::Green);
    }

    pub fn add_cubic_bezier_chain2d(&mut self, curve: &CubicBezierChain2D) {
        for c in &curve.curves {
            self.add_cubic_bezier2d(c);
        }
    }

    pub fn add_cubic_bezier_chain3d(&mut self, curve: &CubicBezierChain3D) {
        for c in &curve.curves {
            self.add_cubic_bezier3d(c);
        }
    }

    pub fn add_bezier_star(&mut self, star: &BezierStar) {
        self.add_cubic_bezier_chain2d(&star.chain);
    }

    pub fn into_scad(self) -> Scad {
        self.scad.unwrap()
    }
}