/*
 * 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.doublearray;

import java.io.OutputStreamWriter;

import org.trie4j.AbstractWikipediaTest;
import org.trie4j.Trie;

public class DoubleArrayWikipediaTest extends AbstractWikipediaTest{
	protected Trie buildSecondTrie(Trie first) {
		return new DoubleArray(first);
	}
	@Override
	protected void afterVerification(Trie trie) throws Exception {
		super.afterVerification(trie);
		((DoubleArray)trie).dump(new OutputStreamWriter(System.out));
		System.out.println("base.length: " + ((DoubleArray)trie).getBase().length);
		System.out.println("term.size: " + ((DoubleArray)trie).getTerm().size());
	}
}

@@ -698,16 +698,101 @@
 iaTest;%0A
+import org.trie4j.Algorithms;%0Aimport org.trie4j.Node;%0Aimport org.trie4j.NodeVisitor;%0A
 import o
@@ -1285,13 +1285,155 @@
 ize());%0A
+%09%09Algorithms.traverseByBreadth(trie.getRoot(), new NodeVisitor() %7B%0A%09%09%09public boolean visit(Node node, int nest) %7B%0A%09%09%09%09return true;%0A%09%09%09%7D%0A%09%09%7D);%0A
 %09%7D%0A%7D%0A

add test code.