mirror of https://github.com/vitalif/openscad
188 lines
5.3 KiB
C++
188 lines
5.3 KiB
C++
/*
|
|
* OpenSCAD (www.openscad.org)
|
|
* Copyright (C) 2009-2011 Clifford Wolf <clifford@clifford.at> and
|
|
* Marius Kintel <marius@kintel.net>
|
|
*
|
|
* This program is free software; you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation; either version 2 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* As a special exception, you have permission to link this program
|
|
* with the CGAL library and distribute executables, as long as you
|
|
* follow the requirements of the GNU GPL in regard to all of the
|
|
* software in the executable aside from CGAL.
|
|
*
|
|
* This program is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program; if not, write to the Free Software
|
|
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
|
|
*
|
|
*/
|
|
|
|
#include "cgaladvnode.h"
|
|
#include "module.h"
|
|
#include "evalcontext.h"
|
|
#include "builtin.h"
|
|
#include "PolySetEvaluator.h"
|
|
#include <sstream>
|
|
#include <assert.h>
|
|
#include <boost/assign/std/vector.hpp>
|
|
using namespace boost::assign; // bring 'operator+=()' into scope
|
|
|
|
class CgaladvModule : public AbstractModule
|
|
{
|
|
public:
|
|
cgaladv_type_e type;
|
|
CgaladvModule(cgaladv_type_e type) : type(type) { }
|
|
virtual AbstractNode *instantiate(const Context *ctx, const ModuleInstantiation *inst, const EvalContext *evalctx) const;
|
|
};
|
|
|
|
AbstractNode *CgaladvModule::instantiate(const Context *ctx, const ModuleInstantiation *inst, const EvalContext *evalctx) const
|
|
{
|
|
CgaladvNode *node = new CgaladvNode(inst, type);
|
|
|
|
AssignmentList args;
|
|
|
|
if (type == MINKOWSKI)
|
|
args += Assignment("convexity", NULL);
|
|
|
|
if (type == GLIDE)
|
|
args += Assignment("path", NULL), Assignment("convexity", NULL);
|
|
|
|
if (type == SUBDIV)
|
|
args += Assignment("type", NULL), Assignment("level", NULL), Assignment("convexity", NULL);
|
|
|
|
if (type == RESIZE)
|
|
args += Assignment("newsize", NULL), Assignment("auto", NULL);
|
|
|
|
Context c(ctx);
|
|
c.setVariables(args, evalctx);
|
|
|
|
Value convexity, path, subdiv_type, level;
|
|
|
|
if (type == MINKOWSKI) {
|
|
convexity = c.lookup_variable("convexity", true);
|
|
}
|
|
|
|
if (type == GLIDE) {
|
|
convexity = c.lookup_variable("convexity", true);
|
|
path = c.lookup_variable("path", false);
|
|
}
|
|
|
|
if (type == SUBDIV) {
|
|
convexity = c.lookup_variable("convexity", true);
|
|
subdiv_type = c.lookup_variable("type", false);
|
|
level = c.lookup_variable("level", true);
|
|
}
|
|
|
|
if (type == RESIZE) {
|
|
Value ns = c.lookup_variable("newsize");
|
|
node->newsize << 0,0,0;
|
|
if ( ns.type() == Value::VECTOR ) {
|
|
Value::VectorType vs = ns.toVector();
|
|
if ( vs.size() >= 1 ) node->newsize[0] = vs[0].toDouble();
|
|
if ( vs.size() >= 2 ) node->newsize[1] = vs[1].toDouble();
|
|
if ( vs.size() >= 3 ) node->newsize[2] = vs[2].toDouble();
|
|
}
|
|
Value autosize = c.lookup_variable("auto");
|
|
node->autosize << false, false, false;
|
|
if ( autosize.type() == Value::VECTOR ) {
|
|
Value::VectorType va = autosize.toVector();
|
|
if ( va.size() >= 1 ) node->autosize[0] = va[0].toBool();
|
|
if ( va.size() >= 2 ) node->autosize[1] = va[1].toBool();
|
|
if ( va.size() >= 3 ) node->autosize[2] = va[2].toBool();
|
|
}
|
|
else if ( autosize.type() == Value::BOOL ) {
|
|
node->autosize << autosize.toBool(),autosize.toBool(),autosize.toBool();
|
|
}
|
|
}
|
|
|
|
node->convexity = (int)convexity.toDouble();
|
|
node->path = path;
|
|
node->subdiv_type = subdiv_type.toString();
|
|
node->level = (int)level.toDouble();
|
|
|
|
if (node->level <= 1)
|
|
node->level = 1;
|
|
|
|
std::vector<AbstractNode *> instantiatednodes = inst->instantiateChildren(evalctx);
|
|
node->children.insert(node->children.end(), instantiatednodes.begin(), instantiatednodes.end());
|
|
|
|
return node;
|
|
}
|
|
|
|
PolySet *CgaladvNode::evaluate_polyset(PolySetEvaluator *ps) const
|
|
{
|
|
return ps->evaluatePolySet(*this);
|
|
}
|
|
|
|
std::string CgaladvNode::name() const
|
|
{
|
|
switch (this->type) {
|
|
case MINKOWSKI:
|
|
return "minkowski";
|
|
break;
|
|
case GLIDE:
|
|
return "glide";
|
|
break;
|
|
case SUBDIV:
|
|
return "subdiv";
|
|
break;
|
|
case HULL:
|
|
return "hull";
|
|
break;
|
|
case RESIZE:
|
|
return "resize";
|
|
break;
|
|
default:
|
|
assert(false);
|
|
}
|
|
return "internal_error";
|
|
}
|
|
|
|
std::string CgaladvNode::toString() const
|
|
{
|
|
std::stringstream stream;
|
|
|
|
stream << this->name();
|
|
switch (type) {
|
|
case MINKOWSKI:
|
|
stream << "(convexity = " << this->convexity << ")";
|
|
break;
|
|
case GLIDE:
|
|
stream << "(path = " << this->path << ", convexity = " << this->convexity << ")";
|
|
break;
|
|
case SUBDIV:
|
|
stream << "(level = " << this->level << ", convexity = " << this->convexity << ")";
|
|
break;
|
|
case HULL:
|
|
stream << "()";
|
|
break;
|
|
case RESIZE:
|
|
stream << "(newsize = ["
|
|
<< this->newsize[0] << "," << this->newsize[1] << "," << this->newsize[2] << "]"
|
|
<< ", auto = ["
|
|
<< this->autosize[0] << "," << this->autosize[1] << "," << this->autosize[2] << "]"
|
|
<< ")";
|
|
break;
|
|
default:
|
|
assert(false);
|
|
}
|
|
|
|
return stream.str();
|
|
}
|
|
|
|
void register_builtin_cgaladv()
|
|
{
|
|
Builtins::init("minkowski", new CgaladvModule(MINKOWSKI));
|
|
Builtins::init("glide", new CgaladvModule(GLIDE));
|
|
Builtins::init("subdiv", new CgaladvModule(SUBDIV));
|
|
Builtins::init("hull", new CgaladvModule(HULL));
|
|
Builtins::init("resize", new CgaladvModule(RESIZE));
|
|
}
|