/*
The Jenkov JSP Tree Tag provides extra tasks for Apaches Ant build tool
Copyright (C) 2003 Jenkov Development
Jenkov JSP Tree Tag is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
Jenkov JSP Tree Tag is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
Contact Details:
---------------------------------
Company: Jenkov Development - www.jenkov.com
Project URL: http://www.jenkov.dk/projects/treetag/treetag.jsp
Email: info@jenkov.com
*/
/**
* @version $revision$
* @author Jakob Jenkov
*/
package com.frameworkset.common.tag.tree.impl;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;
import com.frameworkset.common.tag.tree.itf.ITree;
import com.frameworkset.common.tag.tree.itf.ITreeIteratorElement;
import com.frameworkset.common.tag.tree.itf.ITreeNode;
public class TreeIterator implements Iterator{
private class TreeNodeStack{
protected List stackContents = new ArrayList();
public int size(){
return this.stackContents.size();
}
public void push(Object node){
this.stackContents.add(node);
}
public Object pop()
{
Object node = this.stackContents.get(this.stackContents.size()-1);
this.stackContents.remove(this.stackContents.size()-1);
return node;
}
public Object top(){
return this.stackContents.get(this.stackContents.size()-1);
}
}
protected ITree tree = null;
protected TreeNodeStack stack = new TreeNodeStack();
protected int level = 0;
/**
* 动静态生成树节点时，用来记录当前点击的节点indent值
*/
protected String parent_indent = "";
protected ITreeIteratorElement rootElement = null;
public TreeIterator (ITree tree, boolean includeRootNode){
this.tree = tree;
/**
* TreeIteratorElement(ITreeNode node, List indentationProfile,
boolean isExpanded , boolean isSelected,
boolean isFirstChild, boolean isLastChild)
*/
// if(tree.isDynamic())
this.stack.push(new TreeIteratorElement(tree.getRoot(), new ArrayList()
, tree.isExpanded(tree.getRoot().getId())
, tree.isSelected(tree.getRoot().getId())
, true, true
));
if(!includeRootNode){
pushChildren((ITreeIteratorElement)this.stack.pop());
}
}
/**
* 转换字符串indent为boolean值列表，例如：
* 010101－－》false,true,false,true,false,true
* @param parentIndent
* @return
*/
private List buildParentIndent(String indent)
{
List indentationProfile = new ArrayList();
if(indent == null || indent.equals(""))
{
return indentationProfile;
}
else
{
for(int i = 0; i < indent.length(); i ++)
{
char num = indent.charAt(i);
switch(num)
{
case '0':
Boolean f = new Boolean(false);
indentationProfile.add(f);
break;
case '1':
Boolean t = new Boolean(true);
indentationProfile.add(t);
break;
}
}
}
return indentationProfile;
}
public TreeIterator (ITree tree, String parentIndent){
this.tree = tree;
/**
* TreeIteratorElement(ITreeNode node, List indentationProfile,
boolean isExpanded , boolean isSelected,
boolean isFirstChild, boolean isLastChild)
*/
ITreeNode current = tree.getCurExpanded();
List indentationProfile = this.buildParentIndent(parentIndent);
// indentationProfile.add(new Boolean(current.getRightNode() == null));
ITreeIteratorElement element = new TreeIteratorElement(current, indentationProfile
, tree.isExpanded(current.getId())
, tree.isSelected(current.getId())
, current.getLeftNode() == null, current.getRightNode() == null
);
rootElement = element;
pushChildren(element);
}
public boolean hasNext(){
return this.stack.size() > 0;
}
public Object next(){
//获取堆栈顶层得树节点
ITreeIteratorElement element = (ITreeIteratorElement) this.stack.pop();
//如果element是展开的，那么则儿子节点压栈
if(this.tree.isExpanded(element.getNode().getId())
|| tree.isStatic()){
pushChildren(element);
}
return element;
}
public void remove() {
//not implemented
}
protected void pushChildren(ITreeIteratorElement element){
List indentationProfile = copyIndentationProfile(element);
indentationProfile.add(new Boolean(element.isLastChild()));
if(element.isLastChild())
{
indentationProfile.add(new Boolean(true));
indentationProfile.add(new Boolean(true));
}
List children = element.getNode().getChildren();
for(int i=0; i < children.size(); i++){
ITreeNode node = (ITreeNode) children.get(children.size()-i-1);
this.stack.push(
new TreeIteratorElement(
node
, indentationProfile
, this.tree.isExpanded(node.getId())
, this.tree.isSelected(node.getId())
, i == children.size() - 1
, i == 0
));
}
}
protected List copyIndentationProfile(ITreeIteratorElement element){
List copy = new ArrayList();
Iterator iterator = element.getIndendationProfile().iterator();
while(iterator.hasNext()){
copy.add(iterator.next());
}
return copy;
}
public ITreeIteratorElement getRootElement() {
return rootElement;
}
}