// Do not edit this file!
//
// Automatically generated by Emacs:
//
//    node defs:  nodetypes.def
//    builder  :  tree-nodes.cc.el
//    timestamp:  Mon Aug 22 04:09:14 2005


#include <iostream>

#include "AST.h"
#include "c-types/CtType.h"
#if !defined(TREE1) && !defined(TREE2) && !defined(TREE3) && !defined(TREE4)
  #define TREE1 1
  #define TREE2 1
  #define TREE3 1
  #define TREE4 1
#endif




#if TREE1
	/* Class NameNode */
int NameNode::arity () const { return 1; }

const char* NameNode::oper_name () const { return "NameNode"; }

NameNode::NameNode(TreeNode * __qualifier, const string* __ident, Decl* __decl, SourcePosn _posn)
    : _ident(__ident),
_decl(__decl){
    children = _children;
    child(0, __qualifier);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class PrimitiveLitNode */
int PrimitiveLitNode::arity () const { return 0; }

const char* PrimitiveLitNode::oper_name () const { return "PrimitiveLitNode"; }

PrimitiveLitNode::PrimitiveLitNode(Literal __literal, SourcePosn _posn)
    : _literal(__literal){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class StringLitNode */
int StringLitNode::arity () const { return 0; }

const char* StringLitNode::oper_name () const { return "StringLitNode"; }

StringLitNode::StringLitNode(string16 __text, SourcePosn _posn)
    : _text(__text){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class BoolTypeNode */
int BoolTypeNode::arity () const { return 0; }

const char* BoolTypeNode::oper_name () const { return "BoolTypeNode"; }

BoolTypeNode::BoolTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class CharTypeNode */
int CharTypeNode::arity () const { return 0; }

const char* CharTypeNode::oper_name () const { return "CharTypeNode"; }

CharTypeNode::CharTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class ByteTypeNode */
int ByteTypeNode::arity () const { return 0; }

const char* ByteTypeNode::oper_name () const { return "ByteTypeNode"; }

ByteTypeNode::ByteTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class ShortTypeNode */
int ShortTypeNode::arity () const { return 0; }

const char* ShortTypeNode::oper_name () const { return "ShortTypeNode"; }

ShortTypeNode::ShortTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class IntTypeNode */
int IntTypeNode::arity () const { return 0; }

const char* IntTypeNode::oper_name () const { return "IntTypeNode"; }

IntTypeNode::IntTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class FloatTypeNode */
int FloatTypeNode::arity () const { return 0; }

const char* FloatTypeNode::oper_name () const { return "FloatTypeNode"; }

FloatTypeNode::FloatTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class LongTypeNode */
int LongTypeNode::arity () const { return 0; }

const char* LongTypeNode::oper_name () const { return "LongTypeNode"; }

LongTypeNode::LongTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class DoubleTypeNode */
int DoubleTypeNode::arity () const { return 0; }

const char* DoubleTypeNode::oper_name () const { return "DoubleTypeNode"; }

DoubleTypeNode::DoubleTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class TypeNameNode */
int TypeNameNode::arity () const { return 1; }

const char* TypeNameNode::oper_name () const { return "TypeNameNode"; }

TypeNameNode::TypeNameNode(TreeNode * __name, SourcePosn _posn)
{
    children = _children;
    child(0, __name);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class JavaArrayTypeNode */
int JavaArrayTypeNode::arity () const { return 1; }

const char* JavaArrayTypeNode::oper_name () const { return "JavaArrayTypeNode"; }

JavaArrayTypeNode::JavaArrayTypeNode(TypeNode * __elementType, SourcePosn _posn)
{
    children = _children;
    child(0, __elementType);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class CompileUnitNode */
int CompileUnitNode::arity () const { return 3; }

const char* CompileUnitNode::oper_name () const { return "CompileUnitNode"; }

CompileUnitNode::CompileUnitNode(const string* __ident, TreeNode * __package, llist<TreeNode*> * __imports, TreeNode * __types, Environ * __environ, SourcePosn _posn)
    : _ident(__ident),
_environ(__environ),
thePackage(NULL)
,importedPackages(NULL)
,ranLazyStaticSemantics(false)
{
    children = _children;
    child(0, __package);
    child(1, new TreeListNode(__imports));
    child(2, __types);
    setWhere (_posn);
}

CompileUnitNode::CompileUnitNode ()
    : _ident(NULL),
_environ(NULL),
thePackage(NULL)
,importedPackages(NULL)
,ranLazyStaticSemantics(false)
{
}

#endif


#if TREE3
	/* Class ImportNode */
int ImportNode::arity () const { return 1; }

const char* ImportNode::oper_name () const { return "ImportNode"; }

ImportNode::ImportNode(TreeNode * __name, SourcePosn _posn)
{
    children = _children;
    child(0, __name);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class ImportOnDemandNode */
int ImportOnDemandNode::arity () const { return 1; }

const char* ImportOnDemandNode::oper_name () const { return "ImportOnDemandNode"; }

ImportOnDemandNode::ImportOnDemandNode(TreeNode * __name, SourcePosn _posn)
{
    children = _children;
    child(0, __name);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class ClassDeclNode */
int ClassDeclNode::arity () const { return 5; }

const char* ClassDeclNode::oper_name () const { return "ClassDeclNode"; }

ClassDeclNode::ClassDeclNode(Common::Modifiers __flags, TreeNode * __simpName, TreeNode * __superClass, llist<TypeNode*> * __interfaces, llist<TreeNode*> * __members, TypeDeclNode * __enclosingType, TreeNode * __enclosingBlock, NameNode * __declaredName, bool __hasEnclosingInstance, TreeNode * __finalVars, TreeNode::AllocateContext * __allocateContext, int __classNum, SourcePosn _posn)
    : _flags(__flags),
_enclosingType(__enclosingType),
_enclosingBlock(__enclosingBlock),
_declaredName(__declaredName),
_hasEnclosingInstance(__hasEnclosingInstance),
_allocateContext(__allocateContext),
_classNum(__classNum),
_localCount(0)
,_anonCount(0)
{
    children = _children;
    child(0, __simpName);
    child(1, __superClass);
    child(2, new TypeListNode(__interfaces));
    child(3, new TreeListNode(__members));
    child(4, __finalVars);
    setWhere (_posn);
}

ClassDeclNode::ClassDeclNode ()
    : _flags((Common::Modifiers)0),
_enclosingType(NULL),
_enclosingBlock(NULL),
_declaredName(NULL),
_hasEnclosingInstance(false),
_allocateContext(NULL),
_classNum(0),
_localCount(0)
,_anonCount(0)
{
}

#endif


#if TREE2
	/* Class FieldDeclNode */
int FieldDeclNode::arity () const { return 3; }

const char* FieldDeclNode::oper_name () const { return "FieldDeclNode"; }

FieldDeclNode::FieldDeclNode(TypeNode * __dtype, TreeNode * __simpName, Common::Modifiers __flags, TreeNode * __initExpr, SourcePosn _posn)
    : _flags(__flags),
_compilerGeneratedInitExpr(false)
{
    children = _children;
    child(0, __dtype);
    child(1, __simpName);
    child(2, __initExpr);
    setWhere (_posn);
}

FieldDeclNode::FieldDeclNode ()
    : _flags((Common::Modifiers)0),
_compilerGeneratedInitExpr(false)
{
}

#endif


#if TREE3
	/* Class VarDeclNode */
int VarDeclNode::arity () const { return 3; }

const char* VarDeclNode::oper_name () const { return "VarDeclNode"; }

VarDeclNode::VarDeclNode(bool __isfinal, TypeNode * __dtype, TreeNode * __simpName, TreeNode * __initExpr, SourcePosn _posn)
    : _isfinal(__isfinal),
_mangledIdent(NULL)
,_needsDefaultInitialization(false)
{
    children = _children;
    child(0, __dtype);
    child(1, __simpName);
    child(2, __initExpr);
    setWhere (_posn);
}

VarDeclNode::VarDeclNode ()
    : _isfinal(false),
_mangledIdent(NULL)
,_needsDefaultInitialization(false)
{
}

#endif


#if TREE4
	/* Class MethodDeclNode */
int MethodDeclNode::arity () const { return 7; }

const char* MethodDeclNode::oper_name () const { return "MethodDeclNode"; }

MethodDeclNode::MethodDeclNode(Common::Modifiers __flags, llist<TreeNode*> * __params, TypeNode * __returnType, TypeNode * __declaredReturnType, TreeNode * __simpName, llist<TypeNode*> * __throws, llist<TreeNode*> * __overlaps, TreeNode * __body, SourcePosn _posn)
    : _flags(__flags),
bblockRoot(NULL)
,nodeStorage(NULL)
,_methodStatics(NULL)
,_inlineInfo(NULL)
{
    children = _children;
    child(0, new TreeListNode(__params));
    child(1, __returnType);
    child(2, __declaredReturnType);
    child(3, __simpName);
    child(4, new TypeListNode(__throws));
    child(5, new TreeListNode(__overlaps));
    child(6, __body);
    setWhere (_posn);
}

MethodDeclNode::MethodDeclNode ()
    : _flags((Common::Modifiers)0),
bblockRoot(NULL)
,nodeStorage(NULL)
,_methodStatics(NULL)
,_inlineInfo(NULL)
{
}

#endif


#if TREE1
	/* Class MethodSignatureNode */
int MethodSignatureNode::arity () const { return 5; }

const char* MethodSignatureNode::oper_name () const { return "MethodSignatureNode"; }

MethodSignatureNode::MethodSignatureNode(Common::Modifiers __flags, llist<TreeNode*> * __params, TypeNode * __returnType, TypeNode * __declaredReturnType, TreeNode * __simpName, llist<TypeNode*> * __throws, SourcePosn _posn)
    : _flags(__flags),
_methodStatics(NULL)
{
    children = _children;
    child(0, new TreeListNode(__params));
    child(1, __returnType);
    child(2, __declaredReturnType);
    child(3, __simpName);
    child(4, new TypeListNode(__throws));
    setWhere (_posn);
}

MethodSignatureNode::MethodSignatureNode ()
    : _flags((Common::Modifiers)0),
_methodStatics(NULL)
{
}

#endif


#if TREE2
	/* Class OverlapNode */
int OverlapNode::arity () const { return 2; }

const char* OverlapNode::oper_name () const { return "OverlapNode"; }

OverlapNode::OverlapNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class VoidTypeNode */
int VoidTypeNode::arity () const { return 0; }

const char* VoidTypeNode::oper_name () const { return "VoidTypeNode"; }

VoidTypeNode::VoidTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class ConstructorDeclNode */
int ConstructorDeclNode::arity () const { return 6; }

const char* ConstructorDeclNode::oper_name () const { return "ConstructorDeclNode"; }

ConstructorDeclNode::ConstructorDeclNode(Common::Modifiers __flags, llist<TreeNode*> * __params, TreeNode * __simpName, llist<TypeNode*> * __throws, TreeNode * __constructorCall, TreeNode * __body, TreeNode * __initEncloser, SourcePosn _posn)
    : _flags(__flags),
bblockRoot(NULL)
,nodeStorage(NULL)
,_methodStatics(NULL)
,_inlineInfo(NULL)
{
    children = _children;
    child(0, new TreeListNode(__params));
    child(1, __simpName);
    child(2, new TypeListNode(__throws));
    child(3, __constructorCall);
    child(4, __body);
    child(5, __initEncloser);
    setWhere (_posn);
}

ConstructorDeclNode::ConstructorDeclNode ()
    : _flags((Common::Modifiers)0),
bblockRoot(NULL)
,nodeStorage(NULL)
,_methodStatics(NULL)
,_inlineInfo(NULL)
{
}

#endif


#if TREE1
	/* Class ThisConstructorCallNode */
int ThisConstructorCallNode::arity () const { return 1; }

const char* ThisConstructorCallNode::oper_name () const { return "ThisConstructorCallNode"; }

ThisConstructorCallNode::ThisConstructorCallNode(llist<TreeNode*> * __args, Decl* __decl, bool __valid, SourcePosn _posn)
    : _decl(__decl),
_valid(__valid){
    children = _children;
    child(0, new TreeListNode(__args));
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class SuperConstructorCallNode */
int SuperConstructorCallNode::arity () const { return 2; }

const char* SuperConstructorCallNode::oper_name () const { return "SuperConstructorCallNode"; }

SuperConstructorCallNode::SuperConstructorCallNode(Common::Modifiers __flags, TreeNode * __qualifier, llist<TreeNode*> * __args, Decl* __decl, SourcePosn _posn)
    : _flags(__flags),
_decl(__decl){
    children = _children;
    child(0, __qualifier);
    child(1, new TreeListNode(__args));
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class StaticInitNode */
int StaticInitNode::arity () const { return 1; }

const char* StaticInitNode::oper_name () const { return "StaticInitNode"; }

StaticInitNode::StaticInitNode(TreeNode * __block, SourcePosn _posn)
{
    children = _children;
    child(0, __block);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class InstanceInitNode */
int InstanceInitNode::arity () const { return 1; }

const char* InstanceInitNode::oper_name () const { return "InstanceInitNode"; }

InstanceInitNode::InstanceInitNode(TreeNode * __block, SourcePosn _posn)
{
    children = _children;
    child(0, __block);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class InterfaceDeclNode */
int InterfaceDeclNode::arity () const { return 3; }

const char* InterfaceDeclNode::oper_name () const { return "InterfaceDeclNode"; }

InterfaceDeclNode::InterfaceDeclNode(Common::Modifiers __flags, TreeNode * __simpName, llist<TypeNode*> * __interfaces, llist<TreeNode*> * __members, TypeDeclNode * __enclosingType, NameNode * __declaredName, bool __hasEnclosingInstance, SourcePosn _posn)
    : _flags(__flags),
_enclosingType(__enclosingType),
_declaredName(__declaredName),
_hasEnclosingInstance(__hasEnclosingInstance),
_localCount(0)
,_anonCount(0)
{
    children = _children;
    child(0, __simpName);
    child(1, new TypeListNode(__interfaces));
    child(2, new TreeListNode(__members));
    setWhere (_posn);
}

InterfaceDeclNode::InterfaceDeclNode ()
    : _flags((Common::Modifiers)0),
_enclosingType(NULL),
_declaredName(NULL),
_hasEnclosingInstance(false),
_localCount(0)
,_anonCount(0)
{
}

#endif


#if TREE2
	/* Class ArrayInitNode */
int ArrayInitNode::arity () const { return 1; }

const char* ArrayInitNode::oper_name () const { return "ArrayInitNode"; }

ArrayInitNode::ArrayInitNode(llist<TreeNode*> * __initializers, SourcePosn _posn)
{
    children = _children;
    child(0, new TreeListNode(__initializers));
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class BlockNode */
int BlockNode::arity () const { return 1; }

const char* BlockNode::oper_name () const { return "BlockNode"; }

BlockNode::BlockNode(llist<TreeNode*> * __stmts, Environ * __environ, SourcePosn _posn)
    : _environ(__environ),
_declContainer(false)
,_blockContext(NULL)
{
    children = _children;
    child(0, new TreeListNode(__stmts));
    setWhere (_posn);
}

BlockNode::BlockNode ()
    : _environ(NULL),
_declContainer(false)
,_blockContext(NULL)
{
}

#endif


#if TREE4
	/* Class EmptyStmtNode */
int EmptyStmtNode::arity () const { return 0; }

const char* EmptyStmtNode::oper_name () const { return "EmptyStmtNode"; }

EmptyStmtNode::EmptyStmtNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class GotoNode */
int GotoNode::arity () const { return 0; }

const char* GotoNode::oper_name () const { return "GotoNode"; }

GotoNode::GotoNode(TreeNode * __destination, SourcePosn _posn)
    : _destination(__destination){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class LabeledStmtNode */
int LabeledStmtNode::arity () const { return 2; }

const char* LabeledStmtNode::oper_name () const { return "LabeledStmtNode"; }

LabeledStmtNode::LabeledStmtNode(TreeNode * __label, TreeNode * __stmt, SourcePosn _posn)
{
    children = _children;
    child(0, __label);
    child(1, __stmt);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class IfStmtNode */
int IfStmtNode::arity () const { return 3; }

const char* IfStmtNode::oper_name () const { return "IfStmtNode"; }

IfStmtNode::IfStmtNode(TreeNode * __condition, TreeNode * __thenPart, TreeNode * __elsePart, SourcePosn _posn)
{
    children = _children;
    child(0, __condition);
    child(1, __thenPart);
    child(2, __elsePart);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class SwitchNode */
int SwitchNode::arity () const { return 2; }

const char* SwitchNode::oper_name () const { return "SwitchNode"; }

SwitchNode::SwitchNode(TreeNode * __expr, llist<TreeNode*> * __switchBlocks, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    child(1, new TreeListNode(__switchBlocks));
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class CaseNode */
int CaseNode::arity () const { return 1; }

const char* CaseNode::oper_name () const { return "CaseNode"; }

CaseNode::CaseNode(TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class SwitchBranchNode */
int SwitchBranchNode::arity () const { return 2; }

const char* SwitchBranchNode::oper_name () const { return "SwitchBranchNode"; }

SwitchBranchNode::SwitchBranchNode(llist<TreeNode*> * __cases, llist<TreeNode*> * __stmts, SourcePosn _posn)
{
    children = _children;
    child(0, new TreeListNode(__cases));
    child(1, new TreeListNode(__stmts));
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class WhileNode */
int WhileNode::arity () const { return 2; }

const char* WhileNode::oper_name () const { return "WhileNode"; }

WhileNode::WhileNode(TreeNode * __test, TreeNode * __stmt, SourcePosn _posn)
{
    children = _children;
    child(0, __test);
    child(1, __stmt);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class DoNode */
int DoNode::arity () const { return 2; }

const char* DoNode::oper_name () const { return "DoNode"; }

DoNode::DoNode(TreeNode * __stmt, TreeNode * __test, SourcePosn _posn)
{
    children = _children;
    child(0, __stmt);
    child(1, __test);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class ForNode */
int ForNode::arity () const { return 4; }

const char* ForNode::oper_name () const { return "ForNode"; }

ForNode::ForNode(llist<TreeNode*> * __init, TreeNode * __test, llist<TreeNode*> * __update, TreeNode * __stmt, SourcePosn _posn)
{
    children = _children;
    child(0, new TreeListNode(__init));
    child(1, __test);
    child(2, new TreeListNode(__update));
    child(3, __stmt);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class BreakNode */
int BreakNode::arity () const { return 1; }

const char* BreakNode::oper_name () const { return "BreakNode"; }

BreakNode::BreakNode(TreeNode * __label, TreeNode * __destination, llist<TreeNode *> * __cleanups, SourcePosn _posn)
    : _destination(__destination),
_cleanups(__cleanups){
    children = _children;
    child(0, __label);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class ContinueNode */
int ContinueNode::arity () const { return 1; }

const char* ContinueNode::oper_name () const { return "ContinueNode"; }

ContinueNode::ContinueNode(TreeNode * __label, TreeNode * __destination, llist<TreeNode *> * __cleanups, SourcePosn _posn)
    : _destination(__destination),
_cleanups(__cleanups){
    children = _children;
    child(0, __label);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class ReturnNode */
int ReturnNode::arity () const { return 1; }

const char* ReturnNode::oper_name () const { return "ReturnNode"; }

ReturnNode::ReturnNode(TreeNode * __expr, llist<TreeNode *> * __cleanups, SourcePosn _posn)
    : _cleanups(__cleanups){
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class ThrowNode */
int ThrowNode::arity () const { return 1; }

const char* ThrowNode::oper_name () const { return "ThrowNode"; }

ThrowNode::ThrowNode(TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class SynchronizedNode */
int SynchronizedNode::arity () const { return 2; }

const char* SynchronizedNode::oper_name () const { return "SynchronizedNode"; }

SynchronizedNode::SynchronizedNode(TreeNode * __expr, TreeNode * __stmt, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    child(1, __stmt);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class CatchNode */
int CatchNode::arity () const { return 2; }

const char* CatchNode::oper_name () const { return "CatchNode"; }

CatchNode::CatchNode(TreeNode * __param, TreeNode * __block, SourcePosn _posn)
{
    children = _children;
    child(0, __param);
    child(1, __block);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class TryNode */
int TryNode::arity () const { return 1; }

const char* TryNode::oper_name () const { return "TryNode"; }

TryNode::TryNode(TreeNode * __block, SourcePosn _posn)
{
    children = _children;
    child(0, __block);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class FinallyNode */
int FinallyNode::arity () const { return 1; }

const char* FinallyNode::oper_name () const { return "FinallyNode"; }

FinallyNode::FinallyNode(TreeNode * __block, SourcePosn _posn)
{
    children = _children;
    child(0, __block);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class TryStmtNode */
int TryStmtNode::arity () const { return 3; }

const char* TryStmtNode::oper_name () const { return "TryStmtNode"; }

TryStmtNode::TryStmtNode(TreeNode * __block, llist<CatchNode*> * __catches, TreeNode * __finally, SourcePosn _posn)
{
    children = _children;
    child(0, __block);
    child(1, new CatchListNode(__catches));
    child(2, __finally);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class ExpressionStmtNode */
int ExpressionStmtNode::arity () const { return 1; }

const char* ExpressionStmtNode::oper_name () const { return "ExpressionStmtNode"; }

ExpressionStmtNode::ExpressionStmtNode(TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class DummyNode */
int DummyNode::arity () const { return 1; }

const char* DummyNode::oper_name () const { return "DummyNode"; }

DummyNode::DummyNode(TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class ParameterNode */
int ParameterNode::arity () const { return 2; }

const char* ParameterNode::oper_name () const { return "ParameterNode"; }

ParameterNode::ParameterNode(bool __isfinal, TypeNode * __dtype, TreeNode * __simpName, SourcePosn _posn)
    : _isfinal(__isfinal){
    children = _children;
    child(0, __dtype);
    child(1, __simpName);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class NullPntrNode */
int NullPntrNode::arity () const { return 0; }

const char* NullPntrNode::oper_name () const { return "NullPntrNode"; }

NullPntrNode::NullPntrNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class ThisNode */
int ThisNode::arity () const { return 1; }

const char* ThisNode::oper_name () const { return "ThisNode"; }

ThisNode::ThisNode(TreeNode * __qualifier, TreeNode * __theClass, Common::Modifiers __flags, SourcePosn _posn)
    : _theClass(__theClass),
_flags(__flags){
    children = _children;
    child(0, __qualifier);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class ArrayAccessNode */
int ArrayAccessNode::arity () const { return 2; }

const char* ArrayAccessNode::oper_name () const { return "ArrayAccessNode"; }

ArrayAccessNode::ArrayAccessNode(TreeNode * __array, TreeNode * __index, SourcePosn _posn)
{
    children = _children;
    child(0, __array);
    child(1, __index);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class JavaArrayAccessNode */
int JavaArrayAccessNode::arity () const { return 2; }

const char* JavaArrayAccessNode::oper_name () const { return "JavaArrayAccessNode"; }

JavaArrayAccessNode::JavaArrayAccessNode(TreeNode * __array, TreeNode * __index, SourcePosn _posn)
{
    children = _children;
    child(0, __array);
    child(1, __index);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class TitaniumArrayAccessNode */
int TitaniumArrayAccessNode::arity () const { return 2; }

const char* TitaniumArrayAccessNode::oper_name () const { return "TitaniumArrayAccessNode"; }

TitaniumArrayAccessNode::TitaniumArrayAccessNode(TreeNode * __array, TreeNode * __index, SourcePosn _posn)
{
    children = _children;
    child(0, __array);
    child(1, __index);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class PointArrayAccessNode */
int PointArrayAccessNode::arity () const { return 2; }

const char* PointArrayAccessNode::oper_name () const { return "PointArrayAccessNode"; }

PointArrayAccessNode::PointArrayAccessNode(TreeNode * __array, TreeNode * __index, SourcePosn _posn)
{
    children = _children;
    child(0, __array);
    child(1, __index);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class ObjectNode */
int ObjectNode::arity () const { return 1; }

const char* ObjectNode::oper_name () const { return "ObjectNode"; }

ObjectNode::ObjectNode(TreeNode * __name, SourcePosn _posn)
{
    children = _children;
    child(0, __name);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class ObjectFieldAccessNode */
int ObjectFieldAccessNode::arity () const { return 2; }

const char* ObjectFieldAccessNode::oper_name () const { return "ObjectFieldAccessNode"; }

ObjectFieldAccessNode::ObjectFieldAccessNode(TreeNode * __object, TreeNode * __simpName, SourcePosn _posn)
    : _isRewrittenSFAN(false)
,_isRewrittenQSFAN(false)
{
    children = _children;
    child(0, __object);
    child(1, __simpName);
    setWhere (_posn);
}

ObjectFieldAccessNode::ObjectFieldAccessNode ()
    : _isRewrittenSFAN(false)
,_isRewrittenQSFAN(false)
{
}

#endif


#if TREE2
	/* Class TypeFieldAccessNode */
int TypeFieldAccessNode::arity () const { return 2; }

const char* TypeFieldAccessNode::oper_name () const { return "TypeFieldAccessNode"; }

TypeFieldAccessNode::TypeFieldAccessNode(TypeNode * __ftype, TreeNode * __simpName, SourcePosn _posn)
{
    children = _children;
    child(0, __ftype);
    child(1, __simpName);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class ThisFieldAccessNode */
int ThisFieldAccessNode::arity () const { return 1; }

const char* ThisFieldAccessNode::oper_name () const { return "ThisFieldAccessNode"; }

ThisFieldAccessNode::ThisFieldAccessNode(TreeNode * __theClass, Common::Modifiers __flags, TreeNode * __simpName, SourcePosn _posn)
    : _theClass(__theClass),
_flags(__flags){
    children = _children;
    child(0, __simpName);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class SuperFieldAccessNode */
int SuperFieldAccessNode::arity () const { return 2; }

const char* SuperFieldAccessNode::oper_name () const { return "SuperFieldAccessNode"; }

SuperFieldAccessNode::SuperFieldAccessNode(TreeNode * __qualifier, TreeNode * __theClass, Common::Modifiers __flags, TreeNode * __simpName, SourcePosn _posn)
    : _theClass(__theClass),
_flags(__flags){
    children = _children;
    child(0, __qualifier);
    child(1, __simpName);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class MethodCallNode */
int MethodCallNode::arity () const { return 2; }

const char* MethodCallNode::oper_name () const { return "MethodCallNode"; }

MethodCallNode::MethodCallNode(TreeNode * __method, llist<TreeNode*> * __args, SourcePosn _posn)
    : _modifiesValues(NULL)
,_isRewrittenRHSOpOverload(false)
{
    children = _children;
    child(0, __method);
    child(1, new TreeListNode(__args));
    setWhere (_posn);
}

MethodCallNode::MethodCallNode ()
    : _modifiesValues(NULL)
,_isRewrittenRHSOpOverload(false)
{
}

#endif


#if TREE2
	/* Class MethodCallAssignNode */
int MethodCallAssignNode::arity () const { return 2; }

const char* MethodCallAssignNode::oper_name () const { return "MethodCallAssignNode"; }

MethodCallAssignNode::MethodCallAssignNode(TreeNode * __method, llist<TreeNode*> * __args, SourcePosn _posn)
    : _isRewrittenRHSOpOverload(false)
{
    children = _children;
    child(0, __method);
    child(1, new TreeListNode(__args));
    setWhere (_posn);
}

MethodCallAssignNode::MethodCallAssignNode ()
    : _isRewrittenRHSOpOverload(false)
{
}

#endif


#if TREE3
	/* Class AllocateNode */
int AllocateNode::arity () const { return 4; }

const char* AllocateNode::oper_name () const { return "AllocateNode"; }

AllocateNode::AllocateNode(TreeNode * __region, TypeNode * __dtype, llist<TreeNode*> * __args, Decl* __decl, TreeNode * __qualifier, TreeNode * __cbody, SourcePosn _posn)
    : _decl(__decl),
_cbody(__cbody),
_modifiesValues(NULL)
,_fieldResolutions(0)
{
    children = _children;
    child(0, __region);
    child(1, __dtype);
    child(2, new TreeListNode(__args));
    child(3, __qualifier);
    setWhere (_posn);
}

AllocateNode::AllocateNode ()
    : _decl(NULL),
_cbody(NULL),
_modifiesValues(NULL)
,_fieldResolutions(0)
{
}

#endif


#if TREE4
	/* Class AllocateSpaceNode */
int AllocateSpaceNode::arity () const { return 2; }

const char* AllocateSpaceNode::oper_name () const { return "AllocateSpaceNode"; }

AllocateSpaceNode::AllocateSpaceNode(TreeNode * __region, TypeNode * __dtype, SourcePosn _posn)
{
    children = _children;
    child(0, __region);
    child(1, __dtype);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class AllocateArrayNode */
int AllocateArrayNode::arity () const { return 4; }

const char* AllocateArrayNode::oper_name () const { return "AllocateArrayNode"; }

AllocateArrayNode::AllocateArrayNode(TreeNode * __region, TypeNode * __dtype, llist<TreeNode*> * __dimExprs, TreeNode * __initExpr, SourcePosn _posn)
{
    children = _children;
    child(0, __region);
    child(1, __dtype);
    child(2, new TreeListNode(__dimExprs));
    child(3, __initExpr);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class PostIncrNode */
int PostIncrNode::arity () const { return 1; }

const char* PostIncrNode::oper_name () const { return "PostIncrNode"; }

PostIncrNode::PostIncrNode(TreeNode * __opnd0, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class PostDecrNode */
int PostDecrNode::arity () const { return 1; }

const char* PostDecrNode::oper_name () const { return "PostDecrNode"; }

PostDecrNode::PostDecrNode(TreeNode * __opnd0, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class UnaryPlusNode */
int UnaryPlusNode::arity () const { return 1; }

const char* UnaryPlusNode::oper_name () const { return "UnaryPlusNode"; }

UnaryPlusNode::UnaryPlusNode(TreeNode * __opnd0, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class UnaryMinusNode */
int UnaryMinusNode::arity () const { return 1; }

const char* UnaryMinusNode::oper_name () const { return "UnaryMinusNode"; }

UnaryMinusNode::UnaryMinusNode(TreeNode * __opnd0, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class PreIncrNode */
int PreIncrNode::arity () const { return 1; }

const char* PreIncrNode::oper_name () const { return "PreIncrNode"; }

PreIncrNode::PreIncrNode(TreeNode * __opnd0, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class PreDecrNode */
int PreDecrNode::arity () const { return 1; }

const char* PreDecrNode::oper_name () const { return "PreDecrNode"; }

PreDecrNode::PreDecrNode(TreeNode * __opnd0, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class ComplementNode */
int ComplementNode::arity () const { return 1; }

const char* ComplementNode::oper_name () const { return "ComplementNode"; }

ComplementNode::ComplementNode(TreeNode * __opnd0, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class NotNode */
int NotNode::arity () const { return 1; }

const char* NotNode::oper_name () const { return "NotNode"; }

NotNode::NotNode(TreeNode * __opnd0, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class CastNode */
int CastNode::arity () const { return 2; }

const char* CastNode::oper_name () const { return "CastNode"; }

CastNode::CastNode(TreeNode * __opnd0, TypeNode * __dtype, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __dtype);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class MultNode */
int MultNode::arity () const { return 2; }

const char* MultNode::oper_name () const { return "MultNode"; }

MultNode::MultNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class DivNode */
int DivNode::arity () const { return 2; }

const char* DivNode::oper_name () const { return "DivNode"; }

DivNode::DivNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class RemNode */
int RemNode::arity () const { return 2; }

const char* RemNode::oper_name () const { return "RemNode"; }

RemNode::RemNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class PlusNode */
int PlusNode::arity () const { return 2; }

const char* PlusNode::oper_name () const { return "PlusNode"; }

PlusNode::PlusNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class StringConcatNode */
int StringConcatNode::arity () const { return 1; }

const char* StringConcatNode::oper_name () const { return "StringConcatNode"; }

StringConcatNode::StringConcatNode(llist<TreeNode*> * __addends, SourcePosn _posn)
{
    children = _children;
    child(0, new TreeListNode(__addends));
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class StringConcatAssignNode */
int StringConcatAssignNode::arity () const { return 2; }

const char* StringConcatAssignNode::oper_name () const { return "StringConcatAssignNode"; }

StringConcatAssignNode::StringConcatAssignNode(TreeNode * __opnd0, llist<TreeNode*> * __addends, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, new TreeListNode(__addends));
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class MinusNode */
int MinusNode::arity () const { return 2; }

const char* MinusNode::oper_name () const { return "MinusNode"; }

MinusNode::MinusNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class LeftShiftLogNode */
int LeftShiftLogNode::arity () const { return 2; }

const char* LeftShiftLogNode::oper_name () const { return "LeftShiftLogNode"; }

LeftShiftLogNode::LeftShiftLogNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class RightShiftLogNode */
int RightShiftLogNode::arity () const { return 2; }

const char* RightShiftLogNode::oper_name () const { return "RightShiftLogNode"; }

RightShiftLogNode::RightShiftLogNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class RightShiftArithNode */
int RightShiftArithNode::arity () const { return 2; }

const char* RightShiftArithNode::oper_name () const { return "RightShiftArithNode"; }

RightShiftArithNode::RightShiftArithNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class LTNode */
int LTNode::arity () const { return 2; }

const char* LTNode::oper_name () const { return "LTNode"; }

LTNode::LTNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class GTNode */
int GTNode::arity () const { return 2; }

const char* GTNode::oper_name () const { return "GTNode"; }

GTNode::GTNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class LENode */
int LENode::arity () const { return 2; }

const char* LENode::oper_name () const { return "LENode"; }

LENode::LENode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class GENode */
int GENode::arity () const { return 2; }

const char* GENode::oper_name () const { return "GENode"; }

GENode::GENode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class InstanceOfNode */
int InstanceOfNode::arity () const { return 2; }

const char* InstanceOfNode::oper_name () const { return "InstanceOfNode"; }

InstanceOfNode::InstanceOfNode(TreeNode * __opnd0, TypeNode * __dtype, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __dtype);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class EQNode */
int EQNode::arity () const { return 2; }

const char* EQNode::oper_name () const { return "EQNode"; }

EQNode::EQNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class NENode */
int NENode::arity () const { return 2; }

const char* NENode::oper_name () const { return "NENode"; }

NENode::NENode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class BitAndNode */
int BitAndNode::arity () const { return 2; }

const char* BitAndNode::oper_name () const { return "BitAndNode"; }

BitAndNode::BitAndNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class BitOrNode */
int BitOrNode::arity () const { return 2; }

const char* BitOrNode::oper_name () const { return "BitOrNode"; }

BitOrNode::BitOrNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class BitXorNode */
int BitXorNode::arity () const { return 2; }

const char* BitXorNode::oper_name () const { return "BitXorNode"; }

BitXorNode::BitXorNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class CandNode */
int CandNode::arity () const { return 2; }

const char* CandNode::oper_name () const { return "CandNode"; }

CandNode::CandNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class CorNode */
int CorNode::arity () const { return 2; }

const char* CorNode::oper_name () const { return "CorNode"; }

CorNode::CorNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class IfExprNode */
int IfExprNode::arity () const { return 3; }

const char* IfExprNode::oper_name () const { return "IfExprNode"; }

IfExprNode::IfExprNode(TreeNode * __condition, TreeNode * __thenOpnd, TreeNode * __elseOpnd, SourcePosn _posn)
{
    children = _children;
    child(0, __condition);
    child(1, __thenOpnd);
    child(2, __elseOpnd);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class AssignNode */
int AssignNode::arity () const { return 2; }

const char* AssignNode::oper_name () const { return "AssignNode"; }

AssignNode::AssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class MultAssignNode */
int MultAssignNode::arity () const { return 2; }

const char* MultAssignNode::oper_name () const { return "MultAssignNode"; }

MultAssignNode::MultAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class DivAssignNode */
int DivAssignNode::arity () const { return 2; }

const char* DivAssignNode::oper_name () const { return "DivAssignNode"; }

DivAssignNode::DivAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class RemAssignNode */
int RemAssignNode::arity () const { return 2; }

const char* RemAssignNode::oper_name () const { return "RemAssignNode"; }

RemAssignNode::RemAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class PlusAssignNode */
int PlusAssignNode::arity () const { return 2; }

const char* PlusAssignNode::oper_name () const { return "PlusAssignNode"; }

PlusAssignNode::PlusAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class MinusAssignNode */
int MinusAssignNode::arity () const { return 2; }

const char* MinusAssignNode::oper_name () const { return "MinusAssignNode"; }

MinusAssignNode::MinusAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class LeftShiftLogAssignNode */
int LeftShiftLogAssignNode::arity () const { return 2; }

const char* LeftShiftLogAssignNode::oper_name () const { return "LeftShiftLogAssignNode"; }

LeftShiftLogAssignNode::LeftShiftLogAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class RightShiftLogAssignNode */
int RightShiftLogAssignNode::arity () const { return 2; }

const char* RightShiftLogAssignNode::oper_name () const { return "RightShiftLogAssignNode"; }

RightShiftLogAssignNode::RightShiftLogAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class RightShiftArithAssignNode */
int RightShiftArithAssignNode::arity () const { return 2; }

const char* RightShiftArithAssignNode::oper_name () const { return "RightShiftArithAssignNode"; }

RightShiftArithAssignNode::RightShiftArithAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class BitAndAssignNode */
int BitAndAssignNode::arity () const { return 2; }

const char* BitAndAssignNode::oper_name () const { return "BitAndAssignNode"; }

BitAndAssignNode::BitAndAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class BitXorAssignNode */
int BitXorAssignNode::arity () const { return 2; }

const char* BitXorAssignNode::oper_name () const { return "BitXorAssignNode"; }

BitXorAssignNode::BitXorAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class BitOrAssignNode */
int BitOrAssignNode::arity () const { return 2; }

const char* BitOrAssignNode::oper_name () const { return "BitOrAssignNode"; }

BitOrAssignNode::BitOrAssignNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class PointTypeNode */
int PointTypeNode::arity () const { return 1; }

const char* PointTypeNode::oper_name () const { return "PointTypeNode"; }

PointTypeNode::PointTypeNode(TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class RectDomainTypeNode */
int RectDomainTypeNode::arity () const { return 1; }

const char* RectDomainTypeNode::oper_name () const { return "RectDomainTypeNode"; }

RectDomainTypeNode::RectDomainTypeNode(TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class DomainTypeNode */
int DomainTypeNode::arity () const { return 1; }

const char* DomainTypeNode::oper_name () const { return "DomainTypeNode"; }

DomainTypeNode::DomainTypeNode(TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class TitaniumArrayTypeNode */
int TitaniumArrayTypeNode::arity () const { return 2; }

const char* TitaniumArrayTypeNode::oper_name () const { return "TitaniumArrayTypeNode"; }

TitaniumArrayTypeNode::TitaniumArrayTypeNode(TypeNode * __elementType, TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __elementType);
    child(1, __expr);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class ForEachPairNode */
int ForEachPairNode::arity () const { return 3; }

const char* ForEachPairNode::oper_name () const { return "ForEachPairNode"; }

ForEachPairNode::ForEachPairNode(TreeNode * __simpName, TreeNode * __initExpr, TreeNode * __dtypeopt, SourcePosn _posn)
{
    children = _children;
    child(0, __simpName);
    child(1, __initExpr);
    child(2, __dtypeopt);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class ForEachSetupNode */
int ForEachSetupNode::arity () const { return 0; }

const char* ForEachSetupNode::oper_name () const { return "ForEachSetupNode"; }

ForEachSetupNode::ForEachSetupNode(TreeNode * __WRTloop, SourcePosn _posn)
    : _WRTloop(__WRTloop){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class StrippedForEachNode */
int StrippedForEachNode::arity () const { return 1; }

const char* StrippedForEachNode::oper_name () const { return "StrippedForEachNode"; }

StrippedForEachNode::StrippedForEachNode(TreeNode * __stmt, SourcePosn _posn)
{
    children = _children;
    child(0, __stmt);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class UpdatePointBeforeStmtNode */
int UpdatePointBeforeStmtNode::arity () const { return 1; }

const char* UpdatePointBeforeStmtNode::oper_name () const { return "UpdatePointBeforeStmtNode"; }

UpdatePointBeforeStmtNode::UpdatePointBeforeStmtNode(TreeNode * __stmt, string ** __pointValues, llist< pair<TreeNode *, TreeNode *> > * __rfrs, llist< pair<TreeNode *, TreeNode *> > * __sirs, llist< pair<TreeNode *, TreeNode *> > * __urs, TreeNode * __WRTloop, SourcePosn _posn)
    : _pointValues(__pointValues),
_rfrs(__rfrs),
_sirs(__sirs),
_urs(__urs),
_WRTloop(__WRTloop),
_valuesAreDeltas(false)
{
    children = _children;
    child(0, __stmt);
    setWhere (_posn);
}

UpdatePointBeforeStmtNode::UpdatePointBeforeStmtNode ()
    : _pointValues(NULL),
_rfrs( NULL),
_sirs( NULL),
_urs( NULL),
_WRTloop(NULL),
_valuesAreDeltas(false)
{
}

#endif


#if TREE2
	/* Class ForEachStmtNode */
int ForEachStmtNode::arity () const { return 2; }

const char* ForEachStmtNode::oper_name () const { return "ForEachStmtNode"; }

ForEachStmtNode::ForEachStmtNode(llist<TreeNode*> * __vars, TreeNode * __stmt, bool __isinline, SourcePosn _posn)
    : _isinline(__isinline),
_defs(NULL)
,_needPoint(false)
,_numLifted(0)
,_lo(NULL)
,_hi(NULL)
,_stride(NULL)
,_ordered(false)
,_tentative(false)
,_parallel(false)
,_junk_pre(NULL)
,_junk_post(NULL)
,_lifted_invariants(NULL)
,_invariants(NULL)
,_saveSRinfo(false)
,_shouldDeclare(true)
,_blockContext(NULL)
,_cannotBeEmpty(NULL)
,arrayAccesses(NULL)
,SR(NULL)
,_partialDomain(false)
{
    children = _children;
    child(0, new TreeListNode(__vars));
    child(1, __stmt);
    setWhere (_posn);
}

ForEachStmtNode::ForEachStmtNode ()
    : _isinline(false),
_defs(NULL)
,_needPoint(false)
,_numLifted(0)
,_lo(NULL)
,_hi(NULL)
,_stride(NULL)
,_ordered(false)
,_tentative(false)
,_parallel(false)
,_junk_pre(NULL)
,_junk_post(NULL)
,_lifted_invariants(NULL)
,_invariants(NULL)
,_saveSRinfo(false)
,_shouldDeclare(true)
,_blockContext(NULL)
,_cannotBeEmpty(NULL)
,arrayAccesses(NULL)
,SR(NULL)
,_partialDomain(false)
{
}

#endif


#if TREE3
	/* Class ReorderNode */
int ReorderNode::arity () const { return 1; }

const char* ReorderNode::oper_name () const { return "ReorderNode"; }

ReorderNode::ReorderNode(TreeNode * __stmt, set<StatementNode *> * __stmtsToDelete, treeSet * __declsToDelete, map<TreeNode *, TreeNode *> * __remap, SourcePosn _posn)
    : _stmtsToDelete(__stmtsToDelete),
_declsToDelete(__declsToDelete),
_remap(__remap){
    children = _children;
    child(0, __stmt);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class PartitionStmtNode */
int PartitionStmtNode::arity () const { return 2; }

const char* PartitionStmtNode::oper_name () const { return "PartitionStmtNode"; }

PartitionStmtNode::PartitionStmtNode(TreeNode * __simpName, llist<TreeNode*> * __cases, SourcePosn _posn)
{
    children = _children;
    child(0, __simpName);
    child(1, new TreeListNode(__cases));
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class PartitionClauseNode */
int PartitionClauseNode::arity () const { return 2; }

const char* PartitionClauseNode::oper_name () const { return "PartitionClauseNode"; }

PartitionClauseNode::PartitionClauseNode(TreeNode * __condition, TreeNode * __stmt, SourcePosn _posn)
{
    children = _children;
    child(0, __condition);
    child(1, __stmt);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class BroadcastNode */
int BroadcastNode::arity () const { return 2; }

const char* BroadcastNode::oper_name () const { return "BroadcastNode"; }

BroadcastNode::BroadcastNode(TreeNode * __expr, TreeNode * __proc, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    child(1, __proc);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class PointNode */
int PointNode::arity () const { return 1; }

const char* PointNode::oper_name () const { return "PointNode"; }

PointNode::PointNode(llist<TreeNode*> * __args, SourcePosn _posn)
{
    children = _children;
    child(0, new TreeListNode(__args));
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class DomainNode */
int DomainNode::arity () const { return 1; }

const char* DomainNode::oper_name () const { return "DomainNode"; }

DomainNode::DomainNode(llist<TreeNode*> * __args, SourcePosn _posn)
{
    children = _children;
    child(0, new TreeListNode(__args));
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class EmptyArrayNode */
int EmptyArrayNode::arity () const { return 0; }

const char* EmptyArrayNode::oper_name () const { return "EmptyArrayNode"; }

EmptyArrayNode::EmptyArrayNode(Common::Modifiers __flags, SourcePosn _posn)
    : _flags(__flags){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class ExpressionArrayNode */
int ExpressionArrayNode::arity () const { return 1; }

const char* ExpressionArrayNode::oper_name () const { return "ExpressionArrayNode"; }

ExpressionArrayNode::ExpressionArrayNode(TreeNode * __expr, Common::Modifiers __flags, SourcePosn _posn)
    : _flags(__flags){
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class TitaniumArrayNode */
int TitaniumArrayNode::arity () const { return 1; }

const char* TitaniumArrayNode::oper_name () const { return "TitaniumArrayNode"; }

TitaniumArrayNode::TitaniumArrayNode(TreeNode * __expr, Common::Modifiers __flags, SourcePosn _posn)
    : _flags(__flags){
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class AllocateArrayDimensionNode */
int AllocateArrayDimensionNode::arity () const { return 1; }

const char* AllocateArrayDimensionNode::oper_name () const { return "AllocateArrayDimensionNode"; }

AllocateArrayDimensionNode::AllocateArrayDimensionNode(TreeNode * __expr, Common::Modifiers __flags, SourcePosn _posn)
    : _flags(__flags){
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class ArrayNameNode */
int ArrayNameNode::arity () const { return 2; }

const char* ArrayNameNode::oper_name () const { return "ArrayNameNode"; }

ArrayNameNode::ArrayNameNode(TreeNode * __name, Common::Modifiers __flags, llist<TreeNode*> * __arrayspecifiers, SourcePosn _posn)
    : _flags(__flags){
    children = _children;
    child(0, __name);
    child(1, new TreeListNode(__arrayspecifiers));
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class PragmaNode */
int PragmaNode::arity () const { return 1; }

const char* PragmaNode::oper_name () const { return "PragmaNode"; }

PragmaNode::PragmaNode(TreeNode * __stmt, Pragma::Request __requests, SourcePosn _posn)
    : _requests(__requests){
    children = _children;
    child(0, __stmt);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class HasNoOverlapNode */
int HasNoOverlapNode::arity () const { return 2; }

const char* HasNoOverlapNode::oper_name () const { return "HasNoOverlapNode"; }

HasNoOverlapNode::HasNoOverlapNode(TreeNode * __opnd0, TreeNode * __opnd1, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    child(1, __opnd1);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class SRArrayAccessNode */
int SRArrayAccessNode::arity () const { return 2; }

const char* SRArrayAccessNode::oper_name () const { return "SRArrayAccessNode"; }

SRArrayAccessNode::SRArrayAccessNode(TreeNode * __array, TreeNode * __index, TreeNode * __WRTloop, string __codeString, bool __appearsOnEveryIter, SourcePosn _posn)
    : _WRTloop(__WRTloop),
_codeString(__codeString),
_appearsOnEveryIter(__appearsOnEveryIter){
    children = _children;
    child(0, __array);
    child(1, __index);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class OSRArrayAccessNode */
int OSRArrayAccessNode::arity () const { return 2; }

const char* OSRArrayAccessNode::oper_name () const { return "OSRArrayAccessNode"; }

OSRArrayAccessNode::OSRArrayAccessNode(TreeNode * __array, TreeNode * __index, TreeNode * __WRTloop, string __codeString, string __offsetString, bool __appearsOnEveryIter, SourcePosn _posn)
    : _WRTloop(__WRTloop),
_codeString(__codeString),
_offsetString(__offsetString),
_appearsOnEveryIter(__appearsOnEveryIter){
    children = _children;
    child(0, __array);
    child(1, __index);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class IBroadcastNode */
int IBroadcastNode::arity () const { return 2; }

const char* IBroadcastNode::oper_name () const { return "IBroadcastNode"; }

IBroadcastNode::IBroadcastNode(TreeNode * __expr, TreeNode * __proc, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    child(1, __proc);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class StringConcatAssignPreLoweringNode */
int StringConcatAssignPreLoweringNode::arity () const { return 1; }

const char* StringConcatAssignPreLoweringNode::oper_name () const { return "StringConcatAssignPreLoweringNode"; }

StringConcatAssignPreLoweringNode::StringConcatAssignPreLoweringNode(TreeNode * __opnd0, SourcePosn _posn)
{
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class MethodTypeNode */
int MethodTypeNode::arity () const { return 4; }

const char* MethodTypeNode::oper_name () const { return "MethodTypeNode"; }

MethodTypeNode::MethodTypeNode(llist<TypeNode*> * __paramTypes, TypeNode * __returnType, TypeNode * __declaredReturnType, llist<TypeNode*> * __throws, SourcePosn _posn)
{
    children = _children;
    child(0, new TypeListNode(__paramTypes));
    child(1, __returnType);
    child(2, __declaredReturnType);
    child(3, new TypeListNode(__throws));
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class NullTypeNode */
int NullTypeNode::arity () const { return 0; }

const char* NullTypeNode::oper_name () const { return "NullTypeNode"; }

NullTypeNode::NullTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class ArrayInitializerTypeNode */
int ArrayInitializerTypeNode::arity () const { return 0; }

const char* ArrayInitializerTypeNode::oper_name () const { return "ArrayInitializerTypeNode"; }

ArrayInitializerTypeNode::ArrayInitializerTypeNode(SourcePosn _posn)
{
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class CodeLiteralNode */
int CodeLiteralNode::arity () const { return 0; }

const char* CodeLiteralNode::oper_name () const { return "CodeLiteralNode"; }

CodeLiteralNode::CodeLiteralNode(string __codeString, SourcePosn _posn)
    : _codeString(__codeString){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class CodeLiteralExprNode */
int CodeLiteralExprNode::arity () const { return 0; }

const char* CodeLiteralExprNode::oper_name () const { return "CodeLiteralExprNode"; }

CodeLiteralExprNode::CodeLiteralExprNode(string __codeString, SourcePosn _posn)
    : _codeString(__codeString){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class CodeLiteralFieldAccessNode */
int CodeLiteralFieldAccessNode::arity () const { return 1; }

const char* CodeLiteralFieldAccessNode::oper_name () const { return "CodeLiteralFieldAccessNode"; }

CodeLiteralFieldAccessNode::CodeLiteralFieldAccessNode(TreeNode * __opnd0, string __codeString, SourcePosn _posn)
    : _codeString(__codeString){
    children = _children;
    child(0, __opnd0);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class LazyOptimizeNode */
int LazyOptimizeNode::arity () const { return 1; }

const char* LazyOptimizeNode::oper_name () const { return "LazyOptimizeNode"; }

LazyOptimizeNode::LazyOptimizeNode(TreeNode * __body, SourcePosn _posn)
{
    children = _children;
    child(0, __body);
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class MonitorFetchClassNode */
int MonitorFetchClassNode::arity () const { return 0; }

const char* MonitorFetchClassNode::oper_name () const { return "MonitorFetchClassNode"; }

MonitorFetchClassNode::MonitorFetchClassNode(Decl* __decl, SourcePosn _posn)
    : _decl(__decl){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class MonitorFetchInstanceNode */
int MonitorFetchInstanceNode::arity () const { return 1; }

const char* MonitorFetchInstanceNode::oper_name () const { return "MonitorFetchInstanceNode"; }

MonitorFetchInstanceNode::MonitorFetchInstanceNode(TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class MonitorLockNode */
int MonitorLockNode::arity () const { return 0; }

const char* MonitorLockNode::oper_name () const { return "MonitorLockNode"; }

MonitorLockNode::MonitorLockNode(MonitorFetchNode * __fetcher, SourcePosn _posn)
    : _fetcher(__fetcher){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class MonitorUnlockNode */
int MonitorUnlockNode::arity () const { return 0; }

const char* MonitorUnlockNode::oper_name () const { return "MonitorUnlockNode"; }

MonitorUnlockNode::MonitorUnlockNode(MonitorFetchNode * __fetcher, SourcePosn _posn)
    : _fetcher(__fetcher){
    children = NULL;
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class CheckNullNode */
int CheckNullNode::arity () const { return 1; }

const char* CheckNullNode::oper_name () const { return "CheckNullNode"; }

CheckNullNode::CheckNullNode(TreeNode * __expr, SourcePosn _posn)
{
    children = _children;
    child(0, __expr);
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class AssertNode */
int AssertNode::arity () const { return 2; }

const char* AssertNode::oper_name () const { return "AssertNode"; }

AssertNode::AssertNode(TreeNode * __condition, TreeNode * __value, SourcePosn _posn)
{
    children = _children;
    child(0, __condition);
    child(1, __value);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class TemplateNameNode */
int TemplateNameNode::arity () const { return 2; }

const char* TemplateNameNode::oper_name () const { return "TemplateNameNode"; }

TemplateNameNode::TemplateNameNode(TreeNode * __qualifier, TypeNode * __ttype, SourcePosn _posn)
{
    children = _children;
    child(0, __qualifier);
    child(1, __ttype);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class TemplateInstanceTypeNode */
int TemplateInstanceTypeNode::arity () const { return 2; }

const char* TemplateInstanceTypeNode::oper_name () const { return "TemplateInstanceTypeNode"; }

TemplateInstanceTypeNode::TemplateInstanceTypeNode(TypeNode * __dtype, llist<TreeNode*> * __args, ClassDecl* __decl, SourcePosn _posn)
    : _decl(__decl){
    children = _children;
    child(0, __dtype);
    child(1, new TreeListNode(__args));
    setWhere (_posn);
}

#endif


#if TREE3
	/* Class TemplateDeclNode */
int TemplateDeclNode::arity () const { return 2; }

const char* TemplateDeclNode::oper_name () const { return "TemplateDeclNode"; }

TemplateDeclNode::TemplateDeclNode(TypeDeclNode * __basis, llist<TreeNode*> * __params, Environ * __environ, SourcePosn _posn)
    : _environ(__environ){
    children = _children;
    child(0, __basis);
    child(1, new TreeListNode(__params));
    setWhere (_posn);
}

#endif


#if TREE4
	/* Class TemplateConstParamNode */
int TemplateConstParamNode::arity () const { return 2; }

const char* TemplateConstParamNode::oper_name () const { return "TemplateConstParamNode"; }

TemplateConstParamNode::TemplateConstParamNode(TypeNode * __dtype, TreeNode * __simpName, SourcePosn _posn)
{
    children = _children;
    child(0, __dtype);
    child(1, __simpName);
    setWhere (_posn);
}

#endif


#if TREE1
	/* Class TemplateTypeParamNode */
int TemplateTypeParamNode::arity () const { return 1; }

const char* TemplateTypeParamNode::oper_name () const { return "TemplateTypeParamNode"; }

TemplateTypeParamNode::TemplateTypeParamNode(TreeNode * __simpName, SourcePosn _posn)
{
    children = _children;
    child(0, __simpName);
    setWhere (_posn);
}

#endif


#if TREE2
	/* Class TemplateInstanceDeclNode */
int TemplateInstanceDeclNode::arity () const { return 1; }

const char* TemplateInstanceDeclNode::oper_name () const { return "TemplateInstanceDeclNode"; }

TemplateInstanceDeclNode::TemplateInstanceDeclNode(TypeDeclNode * __instance, Environ * __environ, SourcePosn _posn)
    : _environ(__environ){
    children = _children;
    child(0, __instance);
    setWhere (_posn);
}

#endif