|
122
|
1 package jp.ac.u_ryukyu.ie.cr.tatsuki.query;
|
|
|
2
|
|
|
3 import java.nio.ByteBuffer;
|
|
|
4 import java.security.KeyStore.Entry.Attribute;
|
|
|
5 import java.util.Iterator;
|
|
|
6
|
|
|
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.DefaultJungle;
|
|
|
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.DefaultJungleTree;
|
|
|
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.Jungle;
|
|
|
10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree;
|
|
|
11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTreeEditor;
|
|
|
12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath;
|
|
|
13 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath;
|
|
|
14 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultTreeEditor;
|
|
|
15 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode;
|
|
|
16 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.transaction.DefaultTreeNode;
|
|
|
17 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.DefaultTraverser;
|
|
|
18 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser.InterfaceTraverser;
|
|
|
19 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Either;
|
|
|
20 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Error;
|
|
|
21 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Pair;
|
|
124
|
22 import jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.query.PathNodeIndexIterator;
|
|
122
|
23
|
|
|
24 import org.junit.Assert;
|
|
|
25 import org.junit.Test;
|
|
|
26
|
|
125
|
27 import fj.data.List;
|
|
|
28 import fj.data.Option;
|
|
|
29 import fj.data.TreeMap;
|
|
|
30
|
|
122
|
31 public class SearchQueryTest {
|
|
|
32
|
|
|
33 @Test
|
|
|
34 public void SearchQueryTest() {
|
|
|
35 Jungle jungle = new DefaultJungle(null, "hogehoge",new DefaultTreeEditor(new DefaultTraverser()));
|
|
|
36 jungle.createNewTree("tree");
|
|
|
37 JungleTree tree = jungle.getTreeByName("tree");
|
|
|
38 createTree(tree);
|
|
|
39 InterfaceTraverser ifTraverser = tree.getTraverser();
|
|
126
|
40 TreeMap<String, TreeMap<String, List<Pair<TreeNode, NodePath>>>> cheackIndex = ifTraverser.getIndex();
|
|
|
41 Assert.assertTrue(cheackIndex.isEmpty());
|
|
|
42
|
|
124
|
43 Iterator<Pair<TreeNode, NodePath>> searchNode = ifTraverser.find(
|
|
122
|
44 (TreeNode node) -> {
|
|
|
45 ByteBuffer attribute = node.getAttributes().get(key);
|
|
|
46 if(attribute != null){
|
|
|
47 byte[] byteAttribute = attribute.array();
|
|
|
48 String str = new String(byteAttribute);
|
|
|
49 System.out.println("attribute = " + str);
|
|
124
|
50 return str.equals("<-1,0,1>");
|
|
122
|
51 }
|
|
|
52 return false;
|
|
|
53 }
|
|
124
|
54 ,key,"<-1,0,1>");
|
|
|
55
|
|
126
|
56
|
|
124
|
57 while (searchNode.hasNext()){
|
|
|
58 Assert.assertTrue(compare(searchNode.next().left(),"<-1,0,1>"));
|
|
|
59 }
|
|
126
|
60
|
|
125
|
61 TreeMap<String, TreeMap<String, List<Pair<TreeNode, NodePath>>>> index = ifTraverser.getIndex();
|
|
|
62 Option<TreeMap<String, List<Pair<TreeNode, NodePath>>>> opIndex = index.get(key);
|
|
|
63 Assert.assertTrue(!opIndex.isNone());
|
|
126
|
64 TreeMap<String, List<Pair<TreeNode, NodePath>>> innerIndex = opIndex.some();
|
|
|
65 Assert.assertTrue(!innerIndex.get("<-1,0,0>").isNone());
|
|
|
66
|
|
|
67 IndexPushThread wt = new IndexPushThread(index, tree);
|
|
|
68 wt.start();
|
|
|
69
|
|
|
70 JungleTree newTree = jungle.getTreeByName("tree");
|
|
|
71 InterfaceTraverser newIfTraverser = newTree.getTraverser();
|
|
|
72 TreeMap<String, TreeMap<String, List<Pair<TreeNode, NodePath>>>> newIndex = newIfTraverser.getIndex();
|
|
|
73 Assert.assertFalse(newIndex.isEmpty());
|
|
|
74
|
|
122
|
75 }
|
|
|
76
|
|
124
|
77
|
|
122
|
78 public boolean compare(TreeNode compareNode, String compareAttribute) {
|
|
|
79 String labName = compareNode.getAttributes().getString(key);
|
|
|
80 if (labName.equals(compareAttribute))
|
|
|
81 return true;
|
|
|
82 return false;
|
|
|
83 }
|
|
|
84
|
|
|
85 public static String key = "KEY";
|
|
|
86 public static DefaultTreeNode factory = new DefaultTreeNode();
|
|
|
87
|
|
|
88 public void createTree(JungleTree tree) {
|
|
|
89 NodePath root = new DefaultNodePath();
|
|
|
90 createChildren(tree, root, 0);
|
|
|
91
|
|
|
92 for (int x = 0; x < 2; x++) {
|
|
|
93 createChildren(tree, root.add(0), x);
|
|
|
94 for (int y = 0; y < 2; y++) {
|
|
|
95 createChildren(tree, root.add(0).add(x), y);
|
|
|
96 }
|
|
|
97 }
|
|
|
98
|
|
|
99 }
|
|
|
100
|
|
|
101 public void createChildren(JungleTree tree, NodePath root, int num) {
|
|
|
102 JungleTreeEditor editor = tree.getTreeEditor();// Treeのeditorを作成
|
|
|
103 Either<Error, JungleTreeEditor> either = editor.addNewChildAt(root,num); // 新しく入れるところへのパス
|
|
|
104 if (either.isA()) {
|
|
|
105 Assert.fail();
|
|
|
106 }
|
|
|
107 editor = either.b();
|
|
|
108 either = editor.success();
|
|
|
109 if (either.isA()) {
|
|
|
110 Assert.fail();
|
|
|
111 }
|
|
|
112 NodePath childPath = root.add(num);
|
|
|
113 editor = tree.getTreeEditor();
|
|
|
114 NodePath attribute = root.add(num);
|
|
|
115 System.out.println(attribute.toString());
|
|
|
116 either = editor.putAttribute(childPath, key,ByteBuffer.wrap(attribute.toString().getBytes()));
|
|
|
117 if (either.isA()) {
|
|
|
118 Assert.fail();
|
|
|
119 }
|
|
|
120 editor = either.b();
|
|
|
121 either = editor.success();
|
|
|
122 }
|
|
|
123 }
|
