|
97
|
1 package jp.ac.u_ryukyu.ie.cr.shoshi.jungle.traverser;
|
|
|
2
|
|
98
|
3 import java.util.Iterator;
|
|
|
4
|
|
104
|
5 import fj.data.List;
|
|
97
|
6 import fj.data.TreeMap;
|
|
98
|
7 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTree;
|
|
101
|
8 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.JungleTreeEditor;
|
|
97
|
9 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath;
|
|
|
10 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode;
|
|
101
|
11 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Either;
|
|
|
12 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Error;
|
|
97
|
13 import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Pair;
|
|
99
|
14 import jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.query.PathNodeIterator;
|
|
101
|
15 import jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.query.SearchQuery;
|
|
|
16 import jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.query.UpdateQuery;
|
|
97
|
17
|
|
100
|
18 public class InterfaceTraverser {
|
|
|
19 InterfaceTraverser traverser;
|
|
101
|
20
|
|
98
|
21 TreeNode node;
|
|
105
|
22 TreeMap<String,TreeMap<String, List<TreeNode>>> index;
|
|
101
|
23 JungleTreeEditor editor;
|
|
|
24
|
|
108
|
25 public InterfaceTraverser(TreeNode _root, TreeMap<String,TreeMap<String, List<TreeNode>>> treeMap, JungleTreeEditor editor) {
|
|
101
|
26 this.node = _root;
|
|
108
|
27 this.index = treeMap;
|
|
101
|
28 this.editor = editor;
|
|
98
|
29 }
|
|
101
|
30
|
|
108
|
31
|
|
100
|
32 public InterfaceTraverser getTraverser(JungleTree tree) {
|
|
105
|
33 return new InterfaceTraverser(tree.getRootNode(), tree.getIndex(), tree.getTreeEditor());
|
|
97
|
34 }
|
|
98
|
35
|
|
101
|
36 public void set(TreeNode root){
|
|
|
37 this.node = root;
|
|
|
38 }
|
|
|
39 /*
|
|
|
40 * public IteratorPathNode traverse(TreeNode _node ,NodePath _path ,int
|
|
|
41 * _pos){
|
|
|
42 *
|
|
|
43 * Children children = _node.getChildren(); Either<Error,TreeNode> either =
|
|
|
44 * children.at(0); IteratorPathNode list = new IteratorPathNodeImpl(); int
|
|
|
45 * pathCount = _pos; if(children.size() == 0){ list = list.add(new
|
|
|
46 * Pair<TreeNode, NodePath>(node, _path.add(_pos))); return list; }
|
|
|
47 *
|
|
|
48 * for(TreeNode child : children){ list =
|
|
|
49 * list.append(traverse(child,_path,pathCount)); pathCount++; }
|
|
|
50 *
|
|
|
51 * list = list.add(new Pair<TreeNode,NodePath>(_node, _path.add(_pos)));
|
|
|
52 * return list; }
|
|
|
53 *
|
|
|
54 * public int count(Query _query, String _key, String _attribute){ return
|
|
|
55 * this.find(_query,_key,_attribute); }
|
|
|
56 *
|
|
|
57 * public List<Pair<NodePath,TreeNode>> distinct(String _key ,String...
|
|
|
58 * _attribute){ return null; }
|
|
|
59 */
|
|
102
|
60
|
|
101
|
61 public JungleTreeEditor update(final UpdateQuery query) {
|
|
|
62 Iterator<Pair<TreeNode, NodePath>> findNode = find(query);
|
|
|
63 //do {
|
|
|
64 for (; findNode.hasNext();) {
|
|
|
65 Either<Error, JungleTreeEditor> either = editor.putAttribute(findNode.next().right(), "KEY", query.getUpdateAttribute());
|
|
|
66 if (either.isA())
|
|
|
67 ;// wait delay write
|
|
|
68 editor = either.b();
|
|
97
|
69 }
|
|
101
|
70 //} while (editor.success().isA());
|
|
|
71
|
|
|
72 return editor;
|
|
97
|
73 }
|
|
101
|
74
|
|
|
75 public Iterator<Pair<TreeNode, NodePath>> find(final SearchQuery query) {
|
|
105
|
76 final PathNodeIterator itNode = new PathNodeIterator(node, query);
|
|
|
77
|
|
99
|
78 return new Iterator<Pair<TreeNode, NodePath>>() {
|
|
|
79
|
|
101
|
80 private Pair<TreeNode, NodePath> matchPair = nextmatch(itNode);
|
|
|
81
|
|
|
82 private Pair<TreeNode, NodePath> nextmatch(PathNodeIterator itNode) {
|
|
|
83 for (; itNode.hasNext();) {
|
|
|
84 Pair<TreeNode, NodePath> pathNode = itNode.next();
|
|
|
85 if (query.condition(pathNode.left()))
|
|
|
86 return pathNode;
|
|
|
87 }
|
|
|
88 return null;
|
|
|
89 }
|
|
99
|
90
|
|
101
|
91 @Override
|
|
|
92 public boolean hasNext() {
|
|
|
93 return matchPair != null;
|
|
|
94 }
|
|
99
|
95
|
|
101
|
96 @Override
|
|
|
97 public Pair<TreeNode, NodePath> next() {
|
|
|
98 Pair<TreeNode, NodePath> currentPair = matchPair;
|
|
|
99 matchPair = nextmatch(itNode);
|
|
|
100 return currentPair;
|
|
|
101 }
|
|
99
|
102
|
|
101
|
103 @Override
|
|
|
104 public void remove() {
|
|
|
105 // TODO Auto-generated method stub
|
|
|
106
|
|
|
107 }
|
|
99
|
108
|
|
|
109 };
|
|
|
110
|
|
98
|
111 }
|
|
97
|
112
|
|
|
113 }
|
