/*
 * Copyright Matt Palmer 2012, All rights reserved.
 *
 * This code is licensed under a standard 3-clause BSD license:
 *
 * Redistribution and use in source and binary forms, with or without modification,
 * are permitted provided that the following conditions are met:
 *
 *  * Redistributions of source code must retain the above copyright notice, 
 *    this list of conditions and the following disclaimer.
 * 
 *  * Redistributions in binary form must reproduce the above copyright notice, 
 *    this list of conditions and the following disclaimer in the documentation 
 *    and/or other materials provided with the distribution.
 * 
 *  * The names of its contributors may not be used to endorse or promote products
 *    derived from this software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE 
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 
 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 
 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 
 * POSSIBILITY OF SUCH DAMAGE.
 */
package net.domesdaybook.parser.tree.node;

import java.util.List;

import net.domesdaybook.parser.tree.ParseTree;
import net.domesdaybook.parser.tree.ParseTreeType;

public class StructuralNode extends BaseNode {

	private final List<ParseTree> children;	
	
	public StructuralNode(final ParseTreeType type, final List<ParseTree> children) {
		this(type, children, false);
	}
	
	public StructuralNode(final ParseTreeType type, final List<ParseTree> children,
						   final boolean inverted) {
		super(type, inverted);
		this.children = children;
	}

	@Override
	public List<ParseTree> getChildren() {
		return children;
	}

}

@@ -1647,16 +1647,44 @@
 .node;%0A%0A
+import java.util.ArrayList;%0A
 import j
@@ -1698,16 +1698,16 @@
 l.List;%0A
-
 %0Aimport 
@@ -1855,22 +1855,16 @@
 private 
-final 
 List%3CPar
@@ -1881,16 +1881,257 @@
 ildren;%09
+%0A%09%0A%09public StructuralNode(final ParseTreeType type) %7B%0A%09%09this(type, new ArrayList%3CParseTree%3E(), false);%0A%09%7D%0A%09%0A%09public StructuralNode(final ParseTreeType type, final boolean isInverted) %7B%0A%09%09this(type, new ArrayList%3CParseTree%3E(), isInverted);%0A%09%7D
 %0A%09%0A%09publ
@@ -2468,16 +2468,16 @@
 ren() %7B%0A
-
 %09%09return
@@ -2489,12 +2489,274 @@
 dren;%0A%09%7D
+%0A%09%0A%09public void setChildren(List%3CParseTree%3E children) %7B%0A%09%09this.children = children;%0A%09%7D%0A%09%0A%09public boolean addChild(final ParseTree child) %7B%0A%09%09return children.add(child);%0A%09%7D%0A%09%0A%09public boolean removeChild(final ParseTree child) %7B%0A%09%09return children.remove(child);%0A%09%7D
 %0A%0A%7D%0A

Add constructors which create own child list, and methods to set a new list, add and remove children.