/*
 *  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 "transformnode.h"
#include "module.h"
#include "context.h"
#include "dxfdata.h"
#include "csgterm.h"
#include "polyset.h"
#include "dxftess.h"
#include "builtin.h"
#include "printutils.h"
#include "visitor.h"
#include <sstream>
#include <vector>
#include <assert.h>

enum transform_type_e {
	SCALE,
	ROTATE,
	MIRROR,
	TRANSLATE,
	MULTMATRIX
};

class TransformModule : public AbstractModule
{
public:
	transform_type_e type;
	TransformModule(transform_type_e type) : type(type) { }
	virtual AbstractNode *evaluate(const Context *ctx, const ModuleInstantiation *inst) const;
};

using std::string;
using std::vector;

static vector<string> split(const string &str, const string &delim)
{
  assert(delim.size() > 0);

	vector<string> strvec;
  size_t start = 0, end = 0;
  while (end != string::npos) {
    end = str.find(delim, start);
		// If at end, use length=maxLength.  Else use length=end-start.
    strvec.push_back(str.substr(start, (end == string::npos) ? string::npos : end - start));
		// If at end, use start=maxSize.  Else use start=end+delimiter.
    start = ((end > (string::npos - delim.size())) ? string::npos : end + delim.size());
  }
	return strvec;
}

template <class T> static bool from_string(T &t, const string &s)
{
  std::istringstream iss(s);
  return !(iss >> t).fail();
}

AbstractNode *TransformModule::evaluate(const Context *ctx, const ModuleInstantiation *inst) const
{
	TransformNode *node = new TransformNode(inst);

	for (int i = 0; i < 16; i++)
		node->matrix[i] = i % 5 == 0 ? 1.0 : 0.0;

	QVector<QString> argnames;
	QVector<Expression*> argexpr;

	switch (this->type) {
	case SCALE:
		argnames = QVector<QString>() << "v";
		break;
	case ROTATE:
		argnames = QVector<QString>() << "a" << "v";
		break;
	case MIRROR:
		argnames = QVector<QString>() << "v";
		break;
	case TRANSLATE:
		argnames = QVector<QString>() << "v";
		break;
	case MULTMATRIX:
		argnames = QVector<QString>() << "m";
		break;
	default:
		assert(false);
	}

	Context c(ctx);
	c.args(argnames, argexpr, inst->argnames, inst->argvalues);

	if (this->type == SCALE)
	{
		Value v = c.lookup_variable("v");
		v.getnum(node->matrix[0]);
		v.getnum(node->matrix[5]);
		v.getnum(node->matrix[10]);
		v.getv3(node->matrix[0], node->matrix[5], node->matrix[10]);
		if (node->matrix[10] <= 0)
			node->matrix[10] = 1;
	}
	else if (this->type == ROTATE)
	{
		Value val_a = c.lookup_variable("a");
		if (val_a.type == Value::VECTOR)
		{
			for (int i = 0; i < 3 && i < val_a.vec.size(); i++) {
				double a;
				val_a.vec[i]->getnum(a);
				double c = cos(a*M_PI/180.0);
				double s = sin(a*M_PI/180.0);
				double x = i == 0, y = i == 1, z = i == 2;
				double mr[16] = {
					x*x*(1-c)+c,
					y*x*(1-c)+z*s,
					z*x*(1-c)-y*s,
					0,
					x*y*(1-c)-z*s,
					y*y*(1-c)+c,
					z*y*(1-c)+x*s,
					0,
					x*z*(1-c)+y*s,
					y*z*(1-c)-x*s,
					z*z*(1-c)+c,
					0,
					0, 0, 0, 1
				};
				double m[16];
				for (int x = 0; x < 4; x++)
				for (int y = 0; y < 4; y++)
				{
					m[x+y*4] = 0;
					for (int i = 0; i < 4; i++)
						m[x+y*4] += node->matrix[i+y*4] * mr[x+i*4];
				}
				for (int i = 0; i < 16; i++)
					node->matrix[i] = m[i];
			}
		}
		else
		{
			Value val_v = c.lookup_variable("v");
			double a = 0, x = 0, y = 0, z = 1;

			val_a.getnum(a);

			if (val_v.getv3(x, y, z)) {
				if (x != 0.0 || y != 0.0 || z != 0.0) {
					double sn = 1.0 / sqrt(x*x + y*y + z*z);
					x *= sn, y *= sn, z *= sn;
				}
			}

			if (x != 0.0 || y != 0.0 || z != 0.0)
			{
				double c = cos(a*M_PI/180.0);
				double s = sin(a*M_PI/180.0);

				node->matrix[ 0] = x*x*(1-c)+c;
				node->matrix[ 1] = y*x*(1-c)+z*s;
				node->matrix[ 2] = z*x*(1-c)-y*s;

				node->matrix[ 4] = x*y*(1-c)-z*s;
				node->matrix[ 5] = y*y*(1-c)+c;
				node->matrix[ 6] = z*y*(1-c)+x*s;

				node->matrix[ 8] = x*z*(1-c)+y*s;
				node->matrix[ 9] = y*z*(1-c)-x*s;
				node->matrix[10] = z*z*(1-c)+c;
			}
		}
	}
	else if (this->type == MIRROR)
	{
		Value val_v = c.lookup_variable("v");
		double x = 1, y = 0, z = 0;
	
		if (val_v.getv3(x, y, z)) {
			if (x != 0.0 || y != 0.0 || z != 0.0) {
				double sn = 1.0 / sqrt(x*x + y*y + z*z);
				x *= sn, y *= sn, z *= sn;
			}
		}

		if (x != 0.0 || y != 0.0 || z != 0.0)
		{
			node->matrix[ 0] = 1-2*x*x;
			node->matrix[ 1] = -2*y*x;
			node->matrix[ 2] = -2*z*x;

			node->matrix[ 4] = -2*x*y;
			node->matrix[ 5] = 1-2*y*y;
			node->matrix[ 6] = -2*z*y;

			node->matrix[ 8] = -2*x*z;
			node->matrix[ 9] = -2*y*z;
			node->matrix[10] = 1-2*z*z;
		}
	}
	else if (this->type == TRANSLATE)
	{
		Value v = c.lookup_variable("v");
		v.getv3(node->matrix[12], node->matrix[13], node->matrix[14]);
	}
	else if (this->type == MULTMATRIX)
	{
		Value v = c.lookup_variable("m");
		if (v.type == Value::VECTOR) {
			for (int i = 0; i < 16; i++) {
				int x = i / 4, y = i % 4;
				if (y < v.vec.size() && v.vec[y]->type == Value::VECTOR && x < v.vec[y]->vec.size())
					v.vec[y]->vec[x]->getnum(node->matrix[i]);
			}
		}
	}

	foreach (ModuleInstantiation *v, inst->children) {
		AbstractNode *n = v->evaluate(inst->ctx);
		if (n != NULL)
			node->children.push_back(n);
	}

	return node;
}

string TransformNode::toString() const
{
	std::stringstream stream;

	stream << "multmatrix([";
	for (int j=0;j<4;j++) {
		stream << "[";
		for (int i=0;i<4;i++) {
			// FIXME: The 0 test is to avoid a leading minus before a single 0 (cosmetics)
			stream << ((this->matrix[i*4+j]==0)?0:this->matrix[i*4+j]);
			if (i != 3) stream << ", ";
		}
		stream << "]";
		if (j != 3) stream << ", ";
	}
	stream << "])";

	return stream.str();
}

string TransformNode::name() const
{
	return "transform";
}

void register_builtin_transform()
{
	builtin_modules["scale"] = new TransformModule(SCALE);
	builtin_modules["rotate"] = new TransformModule(ROTATE);
	builtin_modules["mirror"] = new TransformModule(MIRROR);
	builtin_modules["translate"] = new TransformModule(TRANSLATE);
	builtin_modules["multmatrix"] = new TransformModule(MULTMATRIX);
}