statictreeservice.java
来自「管理公司合同」· Java 代码 · 共 73 行
JAVA
73 行
/*
* Created on 2006-10-11 16:30:11
*
* By SinoBest
* Copyright hnisi.com.cn, 2005-2006, All rights reserved.
*/
package cn.com.juneng.system.common.taglib.tree;
import java.util.ArrayList;
import java.util.List;
/**
* 静态树结构(一层树型展示)
*
* @author yehailong
*
*/
public class StaticTreeService implements ITreeService {
ITreeNode[] nodes = null;
public StaticTreeService() {
}
public StaticTreeService(ITreeNode[] nodes) {
this.nodes = nodes;
}
public StaticTreeService(String[] nodeStrs) {
this.nodes = new ITreeNode[nodeStrs.length];
for (int i = 0; i < nodeStrs.length; i++) {
String nodeStr = nodeStrs[i];
String id = nodeStr.substring(0, nodeStr.indexOf(","));
String name = nodeStr.substring(nodeStr.indexOf(",") + 1);
SimpleTreeNode node = new SimpleTreeNode();
node.setNodeId(id);
node.setNodeName(name);
node.setParentId("0");
nodes[i] = node;
}
}
public List findAllRecords() {
List list = new ArrayList();
if (nodes != null) {
for (int i = 0; i < nodes.length; i++) {
list.add(nodes[i]);
}
}
return list;
}
public ITreeNode findByNodeId(String nodeId) {
if (nodes != null) {
for (int i = 0; i < nodes.length; i++) {
if (nodes[i].getNodeId().equals(nodeId)) {
return nodes[i];
}
}
}
return null;
}
public List findSubNode(String nodeId) {
// TODO Auto-generated method stub
return null;
}
}
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?