Mercurial > hg > Members > tatsuki > bench > jungle-core

comparison src/main/java/jp/ac/u_ryukyu/ie/cr/shoshi/jungle/traverser/InterfaceTraverser.java @ 105:78ef456c98a0

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
add Query Status but has error
author one
date Fri, 12 Sep 2014 19:47:25 +0900
parents f9a0e7069811
children 3e75124550e9
comparison
equal deleted inserted replaced
104:f9a0e7069811 105:78ef456c98a0
17 17
18 public class InterfaceTraverser { 18 public class InterfaceTraverser {
19 InterfaceTraverser traverser; 19 InterfaceTraverser traverser;
20 20
21 TreeNode node; 21 TreeNode node;
22 TreeMap<String,List<TreeNode>> index; 22 TreeMap<String,TreeMap<String, List<TreeNode>>> index;
23 JungleTreeEditor editor; 23 JungleTreeEditor editor;
24 24
25 public InterfaceTraverser(TreeNode _root, 25 public InterfaceTraverser(TreeNode _root,
26 TreeMap<String,List<TreeNode>> index, 26 TreeMap<String,TreeMap<String, List<TreeNode>>> index,
27 JungleTreeEditor editor) { 27 JungleTreeEditor editor) {
28 this.node = _root; 28 this.node = _root;
29 this.index = index; 29 this.index = index;
30 this.editor = editor; 30 this.editor = editor;
31 } 31 }
32 32
33 public InterfaceTraverser getTraverser(JungleTree tree) { 33 public InterfaceTraverser getTraverser(JungleTree tree) {
34 return new InterfaceTraverser(tree.getRootNode(), tree.getIndex(), 34 return new InterfaceTraverser(tree.getRootNode(), tree.getIndex(), tree.getTreeEditor());
35 tree.getTreeEditor());
36 } 35 }
37 36
38 public void set(TreeNode root){ 37 public void set(TreeNode root){
39 this.node = root; 38 this.node = root;
40 } 39 }
73 72
74 return editor; 73 return editor;
75 } 74 }
76 75
77 public Iterator<Pair<TreeNode, NodePath>> find(final SearchQuery query) { 76 public Iterator<Pair<TreeNode, NodePath>> find(final SearchQuery query) {
78 final PathNodeIterator itNode = new PathNodeIterator(node); 77 final PathNodeIterator itNode = new PathNodeIterator(node, query);
79 78
80 return new Iterator<Pair<TreeNode, NodePath>>() { 79 return new Iterator<Pair<TreeNode, NodePath>>() {
81 80
82 private Pair<TreeNode, NodePath> matchPair = nextmatch(itNode); 81 private Pair<TreeNode, NodePath> matchPair = nextmatch(itNode);
83 82
84 private Pair<TreeNode, NodePath> nextmatch(PathNodeIterator itNode) { 83 private Pair<TreeNode, NodePath> nextmatch(PathNodeIterator itNode) {