Mercurial > hg > Members > tatsuki > bench > jungle-core
view src/main/java/jp/ac/u_ryukyu/ie/cr/tatsuki/jungle/query/PathNodeIterator.java @ 113:6a35bd6e5887
change Attribute
author | one |
---|---|
date | Tue, 16 Sep 2014 07:48:34 +0900 |
parents | cf17350a2415 |
children | b006861cb795 |
line wrap: on
line source
package jp.ac.u_ryukyu.ie.cr.tatsuki.jungle.query; import java.util.Iterator; import java.util.Stack; import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.NodePath; import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.DefaultNodePath; import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNode; import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.store.impl.TreeNodeChildren; import jp.ac.u_ryukyu.ie.cr.shoshi.jungle.util.Pair; public class PathNodeIterator implements Iterator<Pair<TreeNode, NodePath>> { NodePath path; TreeNode root; TreeNode node; int childNumber; private TreeNodeChildren children; private Stack<TreeNode> nodeStack = new Stack<TreeNode>(); private Stack<Integer> searchStack = new Stack<Integer>(); /* * get queryIndexCondition from query * if already index exists, use index * otherwise traverse tree and create index * * */ public PathNodeIterator(TreeNode root, Query query) { this.root = root; path = new DefaultNodePath(); node = root; } @Override public boolean hasNext() { return node != null; } @Override public Pair<TreeNode, NodePath> next() { TreeNode now = node; NodePath currentPath = path; if (node.getChildren().size() > 0) { // nodeStack.push(node); path = path.add(0); children = node.getChildren(); node = children.at(0).b(); childNumber = 1; searchStack.push(childNumber); } else if (node == root) { node = null; // no more node children = null; return new Pair<TreeNode, NodePath>(now, currentPath); }else if (children != null && children.size() > childNumber) { childNumber = searchStack.pop(); node = children.at(childNumber).b(); path = path.tail().add(childNumber); searchStack.push(++childNumber); } else { path = path.tail(); node = nodeStack.pop(); children = node.getChildren(); childNumber = searchStack.pop(); for (; children.size() == childNumber;) { if (node == root) { node = null; // no more node children = null; return new Pair<TreeNode, NodePath>(now, currentPath); } path = path.tail(); node = nodeStack.pop(); children = node.getChildren(); childNumber = searchStack.pop(); } if (node != null && childNumber < children.size()) { path = path.add(childNumber); nodeStack.push(node); node = children.at(childNumber).b(); searchStack.push(++childNumber); } } System.out.println(path.toString()); return new Pair<TreeNode, NodePath>(now, currentPath); } @Override public void remove() { // TODO Auto-generated method stub } }