/* * OpenSCAD (www.openscad.org) * Copyright (C) 2009-2011 Clifford Wolf and * Marius Kintel * * 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 "context.h" #include "builtin.h" #include "PolySetEvaluator.h" #include #include #include 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 *evaluate(const Context *ctx, const ModuleInstantiation *inst) const; }; AbstractNode *CgaladvModule::evaluate(const Context *ctx, const ModuleInstantiation *inst) const { CgaladvNode *node = new CgaladvNode(inst, type); std::vector argnames; std::vector argexpr; if (type == MINKOWSKI) argnames += "convexity"; if (type == GLIDE) argnames += "path", "convexity"; if (type == SUBDIV) argnames += "type", "level", "convexity"; Context c(ctx); c.args(argnames, argexpr, inst->argnames, inst->argvalues); 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); } 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 evaluatednodes = inst->evaluateChildren(); node->children.insert(node->children.end(), evaluatednodes.begin(), evaluatednodes.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; default: assert(false); } } 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; 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)); }