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