/* this file has been autogenerated by vtkNodeJsWrap */
/* editing this might proof futile */

#define VTK_WRAPPING_CXX
#define VTK_STREAMS_FWD_ONLY
#include <nan.h>

#include "vtkGraphAlgorithmWrap.h"
#include "vtkTreeDifferenceFilterWrap.h"
#include "vtkObjectBaseWrap.h"
#include "../../plus/plus.h"

using namespace v8;

extern Nan::Persistent<v8::Object> vtkNodeJsNoWrap;
Nan::Persistent<v8::FunctionTemplate> VtkTreeDifferenceFilterWrap::ptpl;

VtkTreeDifferenceFilterWrap::VtkTreeDifferenceFilterWrap()
{ }

VtkTreeDifferenceFilterWrap::VtkTreeDifferenceFilterWrap(vtkSmartPointer<vtkTreeDifferenceFilter> _native)
{ native = _native; }

VtkTreeDifferenceFilterWrap::~VtkTreeDifferenceFilterWrap()
{ }

void VtkTreeDifferenceFilterWrap::Init(v8::Local<v8::Object> exports)
{
	Nan::SetAccessor(exports, Nan::New("vtkTreeDifferenceFilter").ToLocalChecked(), ConstructorGetter);
	Nan::SetAccessor(exports, Nan::New("TreeDifferenceFilter").ToLocalChecked(), ConstructorGetter);
}

void VtkTreeDifferenceFilterWrap::ConstructorGetter(
	v8::Local<v8::String> property,
	const Nan::PropertyCallbackInfo<v8::Value>& info)
{
	InitPtpl();
	info.GetReturnValue().Set(Nan::New(ptpl)->GetFunction());
}

void VtkTreeDifferenceFilterWrap::InitPtpl()
{
	if (!ptpl.IsEmpty()) return;
	v8::Local<v8::FunctionTemplate> tpl = Nan::New<v8::FunctionTemplate>(New);
	VtkGraphAlgorithmWrap::InitPtpl( );
	tpl->Inherit(Nan::New<FunctionTemplate>(VtkGraphAlgorithmWrap::ptpl));
	tpl->SetClassName(Nan::New("VtkTreeDifferenceFilterWrap").ToLocalChecked());
	tpl->InstanceTemplate()->SetInternalFieldCount(1);

	Nan::SetPrototypeMethod(tpl, "GetComparisonArrayIsVertexData", GetComparisonArrayIsVertexData);
	Nan::SetPrototypeMethod(tpl, "getComparisonArrayIsVertexData", GetComparisonArrayIsVertexData);

	Nan::SetPrototypeMethod(tpl, "GetComparisonArrayName", GetComparisonArrayName);
	Nan::SetPrototypeMethod(tpl, "getComparisonArrayName", GetComparisonArrayName);

	Nan::SetPrototypeMethod(tpl, "GetIdArrayName", GetIdArrayName);
	Nan::SetPrototypeMethod(tpl, "getIdArrayName", GetIdArrayName);

	Nan::SetPrototypeMethod(tpl, "GetOutputArrayName", GetOutputArrayName);
	Nan::SetPrototypeMethod(tpl, "getOutputArrayName", GetOutputArrayName);

	Nan::SetPrototypeMethod(tpl, "NewInstance", NewInstance);
	Nan::SetPrototypeMethod(tpl, "newInstance", NewInstance);

	Nan::SetPrototypeMethod(tpl, "SafeDownCast", SafeDownCast);
	Nan::SetPrototypeMethod(tpl, "safeDownCast", SafeDownCast);

	Nan::SetPrototypeMethod(tpl, "SetComparisonArrayIsVertexData", SetComparisonArrayIsVertexData);
	Nan::SetPrototypeMethod(tpl, "setComparisonArrayIsVertexData", SetComparisonArrayIsVertexData);

	Nan::SetPrototypeMethod(tpl, "SetComparisonArrayName", SetComparisonArrayName);
	Nan::SetPrototypeMethod(tpl, "setComparisonArrayName", SetComparisonArrayName);

	Nan::SetPrototypeMethod(tpl, "SetIdArrayName", SetIdArrayName);
	Nan::SetPrototypeMethod(tpl, "setIdArrayName", SetIdArrayName);

	Nan::SetPrototypeMethod(tpl, "SetOutputArrayName", SetOutputArrayName);
	Nan::SetPrototypeMethod(tpl, "setOutputArrayName", SetOutputArrayName);

#ifdef VTK_NODE_PLUS_VTKTREEDIFFERENCEFILTERWRAP_INITPTPL
	VTK_NODE_PLUS_VTKTREEDIFFERENCEFILTERWRAP_INITPTPL
#endif
	ptpl.Reset( tpl );
}

void VtkTreeDifferenceFilterWrap::New(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	if(!info.IsConstructCall())
	{
		Nan::ThrowError("Constructor not called in a construct call.");
		return;
	}

	if(info.Length() == 0)
	{
		vtkSmartPointer<vtkTreeDifferenceFilter> native = vtkSmartPointer<vtkTreeDifferenceFilter>::New();
		VtkTreeDifferenceFilterWrap* obj = new VtkTreeDifferenceFilterWrap(native);
		obj->Wrap(info.This());
	}
	else
	{
		if(info[0]->ToObject() != vtkNodeJsNoWrap )
		{
			Nan::ThrowError("Parameter Error");
			return;
		}
	}

	info.GetReturnValue().Set(info.This());
}

void VtkTreeDifferenceFilterWrap::GetComparisonArrayIsVertexData(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	bool r;
	if(info.Length() != 0)
	{
		Nan::ThrowError("Too many parameters.");
		return;
	}
	r = native->GetComparisonArrayIsVertexData();
	info.GetReturnValue().Set(Nan::New(r));
}

void VtkTreeDifferenceFilterWrap::GetComparisonArrayName(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	char const * r;
	if(info.Length() != 0)
	{
		Nan::ThrowError("Too many parameters.");
		return;
	}
	r = native->GetComparisonArrayName();
	info.GetReturnValue().Set(Nan::New(r).ToLocalChecked());
}

void VtkTreeDifferenceFilterWrap::GetIdArrayName(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	char const * r;
	if(info.Length() != 0)
	{
		Nan::ThrowError("Too many parameters.");
		return;
	}
	r = native->GetIdArrayName();
	info.GetReturnValue().Set(Nan::New(r).ToLocalChecked());
}

void VtkTreeDifferenceFilterWrap::GetOutputArrayName(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	char const * r;
	if(info.Length() != 0)
	{
		Nan::ThrowError("Too many parameters.");
		return;
	}
	r = native->GetOutputArrayName();
	info.GetReturnValue().Set(Nan::New(r).ToLocalChecked());
}

void VtkTreeDifferenceFilterWrap::NewInstance(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	vtkTreeDifferenceFilter * r;
	if(info.Length() != 0)
	{
		Nan::ThrowError("Too many parameters.");
		return;
	}
	r = native->NewInstance();
	VtkTreeDifferenceFilterWrap::InitPtpl();
	v8::Local<v8::Value> argv[1] =
		{ Nan::New(vtkNodeJsNoWrap) };
	v8::Local<v8::Function> cons =
		Nan::New<v8::FunctionTemplate>(VtkTreeDifferenceFilterWrap::ptpl)->GetFunction();
	v8::Local<v8::Object> wo = cons->NewInstance(1, argv);
	VtkTreeDifferenceFilterWrap *w = new VtkTreeDifferenceFilterWrap();
	w->native = r;
	w->Wrap(wo);
	info.GetReturnValue().Set(wo);
}

void VtkTreeDifferenceFilterWrap::SafeDownCast(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	if(info.Length() > 0 && info[0]->IsObject() && (Nan::New(VtkObjectBaseWrap::ptpl))->HasInstance(info[0]))
	{
		VtkObjectBaseWrap *a0 = ObjectWrap::Unwrap<VtkObjectBaseWrap>(info[0]->ToObject());
		vtkTreeDifferenceFilter * r;
		if(info.Length() != 1)
		{
			Nan::ThrowError("Too many parameters.");
			return;
		}
		r = native->SafeDownCast(
			(vtkObjectBase *) a0->native.GetPointer()
		);
		VtkTreeDifferenceFilterWrap::InitPtpl();
		v8::Local<v8::Value> argv[1] =
			{ Nan::New(vtkNodeJsNoWrap) };
		v8::Local<v8::Function> cons =
			Nan::New<v8::FunctionTemplate>(VtkTreeDifferenceFilterWrap::ptpl)->GetFunction();
		v8::Local<v8::Object> wo = cons->NewInstance(1, argv);
		VtkTreeDifferenceFilterWrap *w = new VtkTreeDifferenceFilterWrap();
		w->native = r;
		w->Wrap(wo);
		info.GetReturnValue().Set(wo);
		return;
	}
	Nan::ThrowError("Parameter mismatch");
}

void VtkTreeDifferenceFilterWrap::SetComparisonArrayIsVertexData(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	if(info.Length() > 0 && info[0]->IsBoolean())
	{
				if(info.Length() != 1)
		{
			Nan::ThrowError("Too many parameters.");
			return;
		}
		native->SetComparisonArrayIsVertexData(
			info[0]->BooleanValue()
		);
		return;
	}
	Nan::ThrowError("Parameter mismatch");
}

void VtkTreeDifferenceFilterWrap::SetComparisonArrayName(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	if(info.Length() > 0 && info[0]->IsString())
	{
		Nan::Utf8String a0(info[0]);
				if(info.Length() != 1)
		{
			Nan::ThrowError("Too many parameters.");
			return;
		}
		native->SetComparisonArrayName(
			*a0
		);
		return;
	}
	Nan::ThrowError("Parameter mismatch");
}

void VtkTreeDifferenceFilterWrap::SetIdArrayName(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	if(info.Length() > 0 && info[0]->IsString())
	{
		Nan::Utf8String a0(info[0]);
				if(info.Length() != 1)
		{
			Nan::ThrowError("Too many parameters.");
			return;
		}
		native->SetIdArrayName(
			*a0
		);
		return;
	}
	Nan::ThrowError("Parameter mismatch");
}

void VtkTreeDifferenceFilterWrap::SetOutputArrayName(const Nan::FunctionCallbackInfo<v8::Value>& info)
{
	VtkTreeDifferenceFilterWrap *wrapper = ObjectWrap::Unwrap<VtkTreeDifferenceFilterWrap>(info.Holder());
	vtkTreeDifferenceFilter *native = (vtkTreeDifferenceFilter *)wrapper->native.GetPointer();
	if(info.Length() > 0 && info[0]->IsString())
	{
		Nan::Utf8String a0(info[0]);
				if(info.Length() != 1)
		{
			Nan::ThrowError("Too many parameters.");
			return;
		}
		native->SetOutputArrayName(
			*a0
		);
		return;
	}
	Nan::ThrowError("Parameter mismatch");
}