/*
 * Copyright 2012 Takao Nakaguchi
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */
package org.trie4j;

/**
 * Represents the Node of Trie.
 * @author Takao Nakaguchi
 */
public interface Node {
	/**
	 * Returns the letter of this Node.
	 * @return letter
	 */
	char[] getLetters();

	/**
	 * Returns true if this node is terminal (leaf).
	 * @return true if the terminal
	 */
	boolean isTerminate();

	/**
	 * Get the child that has character passed by c as the first letter.
	 * @param c first letter of child node.
	 * @return child node or null if no child node that has c exist.
	 */
	Node getChild(char c);
	Node[] getChildren();
}

@@ -640,19 +640,464 @@
 ode of T
-rie
+RIE.%0A * The Node is the abstraction of internal data expression in each Trie implementation.%0A * One implementation might have manage data using a subclass of this Node and%0A * other might temporally create a instance of this Node when its needed.%0A * In addition, the order of children and how the Node represents Trie are depends%0A * on each implementation. For the latter, in detail, storing %22hello%22 with 1 nodes%0A * and with 5 nodes are both correct
 .%0A * @au
@@ -1539,16 +1539,16 @@
 t.%0A%09 */%0A
-
 %09Node ge
@@ -1562,16 +1562,129 @@
 char c);
+%0A%0A%09/**%0A%09 * Returns the children of this node.%0A%09 * The order of children is not defined.%0A%09 * @return children%0A%09 */
 %0A%09Node%5B%5D

add description of Node class.