d7968978ad
This commit changes the awfully specific code for dialogs with messages duplicated three times to go through a generic interface. It also fixes some issues with the way translated messages were parameterized. This commit removes the custom message dialog box used on Windows, for several reasons. First, it was the last element not respecting HiDPI displays. Second, other OSes do not easily provide this much control over rendering default message boxes, and both Gnome and macOS frown upon non-standard renderings such as those; so the custom rendering was already not used on the other OSes.
262 lines
8.9 KiB
C++
262 lines
8.9 KiB
C++
//-----------------------------------------------------------------------------
|
|
// A library wrapper around SolveSpace, to permit someone to use its constraint
|
|
// solver without coupling their program too much to SolveSpace's internals.
|
|
//
|
|
// Copyright 2008-2013 Jonathan Westhues.
|
|
//-----------------------------------------------------------------------------
|
|
#include "solvespace.h"
|
|
#define EXPORT_DLL
|
|
#include <slvs.h>
|
|
|
|
Sketch SolveSpace::SK = {};
|
|
static System SYS;
|
|
|
|
static int IsInit = 0;
|
|
|
|
void SolveSpace::Platform::FatalError(std::string message) {
|
|
fprintf(stderr, "%s", message.c_str());
|
|
abort();
|
|
}
|
|
|
|
void Group::GenerateEquations(IdList<Equation,hEquation> *) {
|
|
// Nothing to do for now.
|
|
}
|
|
|
|
extern "C" {
|
|
|
|
void Slvs_QuaternionU(double qw, double qx, double qy, double qz,
|
|
double *x, double *y, double *z)
|
|
{
|
|
Quaternion q = Quaternion::From(qw, qx, qy, qz);
|
|
Vector v = q.RotationU();
|
|
*x = v.x;
|
|
*y = v.y;
|
|
*z = v.z;
|
|
}
|
|
|
|
void Slvs_QuaternionV(double qw, double qx, double qy, double qz,
|
|
double *x, double *y, double *z)
|
|
{
|
|
Quaternion q = Quaternion::From(qw, qx, qy, qz);
|
|
Vector v = q.RotationV();
|
|
*x = v.x;
|
|
*y = v.y;
|
|
*z = v.z;
|
|
}
|
|
|
|
void Slvs_QuaternionN(double qw, double qx, double qy, double qz,
|
|
double *x, double *y, double *z)
|
|
{
|
|
Quaternion q = Quaternion::From(qw, qx, qy, qz);
|
|
Vector v = q.RotationN();
|
|
*x = v.x;
|
|
*y = v.y;
|
|
*z = v.z;
|
|
}
|
|
|
|
void Slvs_MakeQuaternion(double ux, double uy, double uz,
|
|
double vx, double vy, double vz,
|
|
double *qw, double *qx, double *qy, double *qz)
|
|
{
|
|
Vector u = Vector::From(ux, uy, uz),
|
|
v = Vector::From(vx, vy, vz);
|
|
Quaternion q = Quaternion::From(u, v);
|
|
*qw = q.w;
|
|
*qx = q.vx;
|
|
*qy = q.vy;
|
|
*qz = q.vz;
|
|
}
|
|
|
|
void Slvs_Solve(Slvs_System *ssys, Slvs_hGroup shg)
|
|
{
|
|
if(!IsInit) {
|
|
InitPlatform(0, NULL);
|
|
IsInit = 1;
|
|
}
|
|
|
|
int i;
|
|
for(i = 0; i < ssys->params; i++) {
|
|
Slvs_Param *sp = &(ssys->param[i]);
|
|
Param p = {};
|
|
|
|
p.h.v = sp->h;
|
|
p.val = sp->val;
|
|
SK.param.Add(&p);
|
|
if(sp->group == shg) {
|
|
SYS.param.Add(&p);
|
|
}
|
|
}
|
|
|
|
for(i = 0; i < ssys->entities; i++) {
|
|
Slvs_Entity *se = &(ssys->entity[i]);
|
|
EntityBase e = {};
|
|
|
|
switch(se->type) {
|
|
case SLVS_E_POINT_IN_3D: e.type = Entity::Type::POINT_IN_3D; break;
|
|
case SLVS_E_POINT_IN_2D: e.type = Entity::Type::POINT_IN_2D; break;
|
|
case SLVS_E_NORMAL_IN_3D: e.type = Entity::Type::NORMAL_IN_3D; break;
|
|
case SLVS_E_NORMAL_IN_2D: e.type = Entity::Type::NORMAL_IN_2D; break;
|
|
case SLVS_E_DISTANCE: e.type = Entity::Type::DISTANCE; break;
|
|
case SLVS_E_WORKPLANE: e.type = Entity::Type::WORKPLANE; break;
|
|
case SLVS_E_LINE_SEGMENT: e.type = Entity::Type::LINE_SEGMENT; break;
|
|
case SLVS_E_CUBIC: e.type = Entity::Type::CUBIC; break;
|
|
case SLVS_E_CIRCLE: e.type = Entity::Type::CIRCLE; break;
|
|
case SLVS_E_ARC_OF_CIRCLE: e.type = Entity::Type::ARC_OF_CIRCLE; break;
|
|
|
|
default: dbp("bad entity type %d", se->type); return;
|
|
}
|
|
e.h.v = se->h;
|
|
e.group.v = se->group;
|
|
e.workplane.v = se->wrkpl;
|
|
e.point[0].v = se->point[0];
|
|
e.point[1].v = se->point[1];
|
|
e.point[2].v = se->point[2];
|
|
e.point[3].v = se->point[3];
|
|
e.normal.v = se->normal;
|
|
e.distance.v = se->distance;
|
|
e.param[0].v = se->param[0];
|
|
e.param[1].v = se->param[1];
|
|
e.param[2].v = se->param[2];
|
|
e.param[3].v = se->param[3];
|
|
|
|
SK.entity.Add(&e);
|
|
}
|
|
IdList<Param, hParam> params = {};
|
|
for(i = 0; i < ssys->constraints; i++) {
|
|
Slvs_Constraint *sc = &(ssys->constraint[i]);
|
|
ConstraintBase c = {};
|
|
|
|
Constraint::Type t;
|
|
switch(sc->type) {
|
|
case SLVS_C_POINTS_COINCIDENT: t = Constraint::Type::POINTS_COINCIDENT; break;
|
|
case SLVS_C_PT_PT_DISTANCE: t = Constraint::Type::PT_PT_DISTANCE; break;
|
|
case SLVS_C_PT_PLANE_DISTANCE: t = Constraint::Type::PT_PLANE_DISTANCE; break;
|
|
case SLVS_C_PT_LINE_DISTANCE: t = Constraint::Type::PT_LINE_DISTANCE; break;
|
|
case SLVS_C_PT_FACE_DISTANCE: t = Constraint::Type::PT_FACE_DISTANCE; break;
|
|
case SLVS_C_PT_IN_PLANE: t = Constraint::Type::PT_IN_PLANE; break;
|
|
case SLVS_C_PT_ON_LINE: t = Constraint::Type::PT_ON_LINE; break;
|
|
case SLVS_C_PT_ON_FACE: t = Constraint::Type::PT_ON_FACE; break;
|
|
case SLVS_C_EQUAL_LENGTH_LINES: t = Constraint::Type::EQUAL_LENGTH_LINES; break;
|
|
case SLVS_C_LENGTH_RATIO: t = Constraint::Type::LENGTH_RATIO; break;
|
|
case SLVS_C_EQ_LEN_PT_LINE_D: t = Constraint::Type::EQ_LEN_PT_LINE_D; break;
|
|
case SLVS_C_EQ_PT_LN_DISTANCES: t = Constraint::Type::EQ_PT_LN_DISTANCES; break;
|
|
case SLVS_C_EQUAL_ANGLE: t = Constraint::Type::EQUAL_ANGLE; break;
|
|
case SLVS_C_EQUAL_LINE_ARC_LEN: t = Constraint::Type::EQUAL_LINE_ARC_LEN; break;
|
|
case SLVS_C_LENGTH_DIFFERENCE: t = Constraint::Type::LENGTH_DIFFERENCE; break;
|
|
case SLVS_C_SYMMETRIC: t = Constraint::Type::SYMMETRIC; break;
|
|
case SLVS_C_SYMMETRIC_HORIZ: t = Constraint::Type::SYMMETRIC_HORIZ; break;
|
|
case SLVS_C_SYMMETRIC_VERT: t = Constraint::Type::SYMMETRIC_VERT; break;
|
|
case SLVS_C_SYMMETRIC_LINE: t = Constraint::Type::SYMMETRIC_LINE; break;
|
|
case SLVS_C_AT_MIDPOINT: t = Constraint::Type::AT_MIDPOINT; break;
|
|
case SLVS_C_HORIZONTAL: t = Constraint::Type::HORIZONTAL; break;
|
|
case SLVS_C_VERTICAL: t = Constraint::Type::VERTICAL; break;
|
|
case SLVS_C_DIAMETER: t = Constraint::Type::DIAMETER; break;
|
|
case SLVS_C_PT_ON_CIRCLE: t = Constraint::Type::PT_ON_CIRCLE; break;
|
|
case SLVS_C_SAME_ORIENTATION: t = Constraint::Type::SAME_ORIENTATION; break;
|
|
case SLVS_C_ANGLE: t = Constraint::Type::ANGLE; break;
|
|
case SLVS_C_PARALLEL: t = Constraint::Type::PARALLEL; break;
|
|
case SLVS_C_PERPENDICULAR: t = Constraint::Type::PERPENDICULAR; break;
|
|
case SLVS_C_ARC_LINE_TANGENT: t = Constraint::Type::ARC_LINE_TANGENT; break;
|
|
case SLVS_C_CUBIC_LINE_TANGENT: t = Constraint::Type::CUBIC_LINE_TANGENT; break;
|
|
case SLVS_C_EQUAL_RADIUS: t = Constraint::Type::EQUAL_RADIUS; break;
|
|
case SLVS_C_PROJ_PT_DISTANCE: t = Constraint::Type::PROJ_PT_DISTANCE; break;
|
|
case SLVS_C_WHERE_DRAGGED: t = Constraint::Type::WHERE_DRAGGED; break;
|
|
case SLVS_C_CURVE_CURVE_TANGENT:t = Constraint::Type::CURVE_CURVE_TANGENT; break;
|
|
|
|
default: dbp("bad constraint type %d", sc->type); return;
|
|
}
|
|
|
|
c.type = t;
|
|
|
|
c.h.v = sc->h;
|
|
c.group.v = sc->group;
|
|
c.workplane.v = sc->wrkpl;
|
|
c.valA = sc->valA;
|
|
c.ptA.v = sc->ptA;
|
|
c.ptB.v = sc->ptB;
|
|
c.entityA.v = sc->entityA;
|
|
c.entityB.v = sc->entityB;
|
|
c.entityC.v = sc->entityC;
|
|
c.entityD.v = sc->entityD;
|
|
c.other = (sc->other) ? true : false;
|
|
c.other2 = (sc->other2) ? true : false;
|
|
|
|
c.Generate(¶ms);
|
|
if(params.n > 0) {
|
|
for(Param &p : params) {
|
|
p.h = SK.param.AddAndAssignId(&p);
|
|
c.valP = p.h;
|
|
SYS.param.Add(&p);
|
|
}
|
|
params.Clear();
|
|
c.ModifyToSatisfy();
|
|
}
|
|
|
|
SK.constraint.Add(&c);
|
|
}
|
|
|
|
for(i = 0; i < (int)arraylen(ssys->dragged); i++) {
|
|
if(ssys->dragged[i]) {
|
|
hParam hp = { ssys->dragged[i] };
|
|
SYS.dragged.Add(&hp);
|
|
}
|
|
}
|
|
|
|
Group g = {};
|
|
g.h.v = shg;
|
|
|
|
List<hConstraint> bad = {};
|
|
|
|
// Now we're finally ready to solve!
|
|
bool andFindBad = ssys->calculateFaileds ? true : false;
|
|
SolveResult how = SYS.Solve(&g, &(ssys->dof), &bad, andFindBad, /*andFindFree=*/false);
|
|
|
|
switch(how) {
|
|
case SolveResult::OKAY:
|
|
ssys->result = SLVS_RESULT_OKAY;
|
|
break;
|
|
|
|
case SolveResult::DIDNT_CONVERGE:
|
|
ssys->result = SLVS_RESULT_DIDNT_CONVERGE;
|
|
break;
|
|
|
|
case SolveResult::REDUNDANT_DIDNT_CONVERGE:
|
|
case SolveResult::REDUNDANT_OKAY:
|
|
ssys->result = SLVS_RESULT_INCONSISTENT;
|
|
break;
|
|
|
|
case SolveResult::TOO_MANY_UNKNOWNS:
|
|
ssys->result = SLVS_RESULT_TOO_MANY_UNKNOWNS;
|
|
break;
|
|
}
|
|
|
|
// Write the new parameter values back to our caller.
|
|
for(i = 0; i < ssys->params; i++) {
|
|
Slvs_Param *sp = &(ssys->param[i]);
|
|
hParam hp = { sp->h };
|
|
sp->val = SK.GetParam(hp)->val;
|
|
}
|
|
|
|
if(ssys->failed) {
|
|
// Copy over any the list of problematic constraints.
|
|
for(i = 0; i < ssys->faileds && i < bad.n; i++) {
|
|
ssys->failed[i] = bad.elem[i].v;
|
|
}
|
|
ssys->faileds = bad.n;
|
|
}
|
|
|
|
bad.Clear();
|
|
SYS.param.Clear();
|
|
SYS.entity.Clear();
|
|
SYS.eq.Clear();
|
|
SYS.dragged.Clear();
|
|
|
|
SK.param.Clear();
|
|
SK.entity.Clear();
|
|
SK.constraint.Clear();
|
|
|
|
FreeAllTemporary();
|
|
}
|
|
|
|
} /* extern "C" */
|