「java解析树形」java树状
今天给各位分享java解析树形的知识，其中也会对java树状进行解释，如果能碰巧解决你现在面临的问题，别忘了关注本站，现在开始吧！
本文目录一览：
java怎样解析owl文件树变成树状图
你针对这个表写个实体类，写出它的dao，然后取出所有数据放到List，把list放到request.setAttribute("all");在请求到的页面中用getAttribute取出，然后用js写DOM模型表示出来，js中的引用可以直接使用java的数据，例如：%
List l = (List)request.getAttribute("all");
for(int i==0;il.size();i++){
实体类 a = ( 实体类)l.get(i);
%
var url = %=a.get属性()%
%
}
%
DOM模型可以使js更好的控制我们想要实现的效果
老师让我们做一个用java解析的xml树形结构，可是不懂，该怎么做？？
给你个例子让你参考下~~
Java类：
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
import javax.xml.parsers.DocumentBuilder;
import javax.xml.parsers.DocumentBuilderFactory;
import javax.xml.parsers.ParserConfigurationException;
import org.w3c.dom.Document;
import org.w3c.dom.Element;
import org.w3c.dom.Node;
import org.w3c.dom.NodeList;
import org.xml.sax.SAXException;
public class XmlReader
{
public static void readXml(String inputXmlPath, ListServiceInfo infos)
throws ParserConfigurationException, SAXException, IOException
{
DocumentBuilderFactory docfac = DocumentBuilderFactory.newInstance();
DocumentBuilder builder = docfac.newDocumentBuilder();
InputStream in = new FileInputStream(inputXmlPath);
Document doc = builder.parse(in);
Element root = doc.getDocumentElement();
NodeList nodes = root.getElementsByTagName("service");
for (int i = 0; i nodes.getLength(); i++)
{
Node node = nodes.item(i);
NodeList childNodes = node.getChildNodes();
ServiceInfo info = new ServiceInfo();// 位置上移
for (int j = 0; j childNodes.getLength(); j++)
{
Node child = childNodes.item(j);
if (Node.ELEMENT_NODE == child.getNodeType())
{
if ("name".equals(child.getNodeName()))
{
info.setName(child.getTextContent());
}
if ("class".equals(child.getNodeName()))
{
info.setClassName(child.getTextContent());
}
}
}
infos.add(info);// 位置上移出现什么结果
}
}
public static void main(String[] args) throws ParserConfigurationException,
SAXException, IOException
{
ListServiceInfo infos = new ArrayListServiceInfo();
readXml("F:\\services.xml", infos);
System.out.println(infos);
}
}
class ServiceInfo
{
private String name;
private String className;
public String getClassName()
{
return className;
}
public void setClassName(String className)
{
this.className = className;
}
public String getName()
{
return name;
}
public void setName(String name)
{
this.name = name;
}
@Override
public String toString()
{
return new StringBuffer().append("name=" + name).append(
"class=" + className).toString();
}
}
XML文件：
?xml version="1.0" encoding="utf-8" ?
services
service
nameliaoliang/name
classcom.chinasoft.Liao/class
/service
service
nameerji/name
classcom.chinasoft.Erji/class
/service
/services
java 递归数据库生成 树形结构问题
1、准备表结构及对应的表数据
a、表结构：
create table TB_TREE
(
CID NUMBER not null,
CNAME VARCHAR2(50),
PID NUMBER //父节点
)
b、表数据：
insert into tb_tree (CID, CNAME, PID) values (1, '中国', 0);
insert into tb_tree (CID, CNAME, PID) values (2, '北京市', 1);
insert into tb_tree (CID, CNAME, PID) values (3, '广东省', 1);
insert into tb_tree (CID, CNAME, PID) values (4, '上海市', 1);
insert into tb_tree (CID, CNAME, PID) values (5, '广州市', 3);
insert into tb_tree (CID, CNAME, PID) values (6, '深圳市', 3);
insert into tb_tree (CID, CNAME, PID) values (7, '海珠区', 5);
insert into tb_tree (CID, CNAME, PID) values (8, '天河区', 5);
insert into tb_tree (CID, CNAME, PID) values (9, '福田区', 6);
insert into tb_tree (CID, CNAME, PID) values (10, '南山区', 6);
insert into tb_tree (CID, CNAME, PID) values (11, '密云县', 2);
insert into tb_tree (CID, CNAME, PID) values (12, '浦东', 4);
2、TreeNode对象，对应tb_tree
public class TreeNode implements Serializable {
private Integer cid;
private String cname;
private Integer pid;
private List nodes = new ArrayList();
public TreeNode() {
}
//getter、setter省略
}
3、测试数据
public class TreeNodeTest {
@Test
public void loadTree() throws Exception{
System.out.println(JsonUtils.javaToJson(recursiveTree(1)));
}
/**
* 递归算法解析成树形结构
*
* @param cid
* @return
* @author jiqinlin
*/
public TreeNode recursiveTree(int cid) {
//根据cid获取节点对象(SELECT * FROM tb_tree t WHERE t.cid=?)
TreeNode node = personService.getreeNode(cid);
//查询cid下的所有子节点(SELECT * FROM tb_tree t WHERE t.pid=?)
List childTreeNodes = personService.queryTreeNode(cid);
//遍历子节点
for(TreeNode child : childTreeNodes){
TreeNode n = recursiveTree(child.getCid()); //递归
node.getNodes().add(n);
}
return node;
}
}
输出的json格式如下：
{
"cid": 1,
"nodes": [
{
"cid": 2,
"nodes": [
{
"cid": 11,
"nodes": [
],
"cname": "密云县",
"pid": 2
}
],
"cname": "北京市",
"pid": 1
},
{
"cid": 3,
"nodes": [
{
"cid": 5,
"nodes": [
{
"cid": 7,
"nodes": [
],
"cname": "海珠区",
"pid": 5
},
{
"cid": 8,
"nodes": [
],
"cname": "天河区",
"pid": 5
}
],
"cname": "广州市",
"pid": 3
},
{
"cid": 6,
"nodes": [
{
"cid": 9,
"nodes": [
],
"cname": "福田区",
"pid": 6
},
{
"cid": 10,
"nodes": [
],
"cname": "南山区",
"pid": 6
}
],
"cname": "深圳市",
"pid": 3
}
],
"cname": "广东省",
"pid": 1
},
{
"cid": 4,
"nodes": [
{
"cid": 12,
"nodes": [
],
"cname": "浦东",
"pid": 4
}
],
"cname": "上海市",
"pid": 1
}
],
"cname": "中国",
"pid": 0
}
关于java解析树形和java树状的介绍到此就结束了，不知道你从中找到你需要的信息了吗 ？如果你还想了解更多这方面的信息，记得收藏关注本站。
发布于：2022-11-21，除非注明，否则均为原创文章，转载请注明出处。