comparison src/test/java/jp/ac/u_ryukyu/ie/cr/shoshi/jungle/traverse/BruteForceTraverserTest.java @ 100:9a7b7af838e0

add index TreeNodeEditor but node use
author one
date Thu, 11 Sep 2014 03:10:03 +0900
parents 95000ff9064d
children c297f0015d9e
comparison
equal deleted inserted replaced
99:92d0c6e4655c 100:9a7b7af838e0
5 5
6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath; 6 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath;
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath; 7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath;
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode; 8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode;
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeNode; 9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeNode;
10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.BruteForceTraverser; 10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.InterfaceTraverser;
11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.DefaultEvaluator; 11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.DefaultEvaluator;
12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.Direction; 12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.Direction;
13 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.Traversal; 13 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.Traversal;
14 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.Traverser; 14 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.Traverser;
15 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Either; 15 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Either;
23 import org.junit.Test; 23 import org.junit.Test;
24 24
25 import fj.data.List; 25 import fj.data.List;
26 26
27 public abstract class BruteForceTraverserTest extends TestCase{ 27 public abstract class BruteForceTraverserTest extends TestCase{
28 public abstract BruteForceTraverser instance(TreeNode node); 28 public abstract InterfaceTraverser instance(TreeNode node);
29 29
30 @Test 30 @Test
31 public void test1() { 31 public void test1() {
32 int maxHeight = 3; 32 int maxHeight = 3;
33 Pair<TreeNode, NodePath> test = null; 33 Pair<TreeNode, NodePath> test = null;
34 TreeNode root = createTree(0,0,maxHeight,new DefaultNodePath()); 34 TreeNode root = createTree(0,0,maxHeight,new DefaultNodePath());
35 BruteForceTraverser traverser = instance(root); 35 InterfaceTraverser traverser = instance(root);
36 Iterator<Pair<TreeNode, NodePath>> itNode = traverser.find(new SearchQuery("KEY","<-1>")); 36 Iterator<Pair<TreeNode, NodePath>> itNode = traverser.find(new SearchQuery("KEY","<-1>"));
37 for(;itNode.hasNext(); ){ 37 for(;itNode.hasNext(); ){
38 test = itNode.next(); 38 test = itNode.next();
39 39
40 } 40 }