forked from roboticslibrary/rl
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathThread.h
137 lines (85 loc) · 3.79 KB
/
Thread.h
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
//
// Copyright (c) 2009, Markus Rickert
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.
//
#ifndef THREAD_H
#define THREAD_H
#include <QThread>
#include <rl/plan/Viewer.h>
class Thread : public QThread, public rl::plan::Viewer
{
Q_OBJECT
public:
Thread(QObject* parent = nullptr);
virtual ~Thread();
void drawConfiguration(const rl::math::Vector& q);
void drawConfigurationEdge(const rl::math::Vector& q0, const rl::math::Vector& q1, const bool& free = true);
void drawConfigurationPath(const rl::plan::VectorList& path);
void drawConfigurationVertex(const rl::math::Vector& q, const bool& free = true);
void drawLine(const rl::math::Vector& xyz0, const rl::math::Vector& xyz1);
void drawPoint(const rl::math::Vector& xyz);
void drawSphere(const rl::math::Vector& center, const rl::math::Real& radius);
void drawSweptVolume(const rl::plan::VectorList& path);
void drawWork(const rl::math::Transform& t);
void drawWorkEdge(const rl::math::Vector& q0, const rl::math::Vector& q1);
void drawWorkPath(const rl::plan::VectorList& path);
void drawWorkVertex(const rl::math::Vector& q);
void reset();
void resetEdges();
void resetLines();
void resetPoints();
void resetSpheres();
void resetVertices();
void run();
void showMessage(const std::string& message);
void stop();
bool animate;
bool quit;
bool swept;
protected:
private:
bool running;
signals:
void configurationRequested(const rl::math::Vector& q);
void configurationEdgeRequested(const rl::math::Vector& q0, const rl::math::Vector& q1, const bool& free);
void configurationVertexRequested(const rl::math::Vector& q, const bool& free);
void configurationPathRequested(const rl::plan::VectorList& path);
void edgeResetRequested();
void lineRequested(const rl::math::Vector& xyz0, const rl::math::Vector& xyz1);
void lineResetRequested();
void messageRequested(const std::string& message);
void pointRequested(const rl::math::Vector& xyz);
void pointResetRequested();
void resetRequested();
void sphereRequested(const rl::math::Vector& center, const rl::math::Real& radius);
void sphereResetRequested();
void statusChanged(const QString& message);
void sweptVolumeRequested(const rl::plan::VectorList& path);
void vertexResetRequested();
void workRequested(const rl::math::Transform& t);
void workEdgeRequested(const rl::math::Vector& q0, const rl::math::Vector& q1);
void workPathRequested(const rl::plan::VectorList& path);
void workVertexRequested(const rl::math::Vector& q);
};
#endif // THREAD_H