坐井觀天

private ?Node?parent;? // 父對(duì)象
private ?Set?children? = ? new ?HashSet();? // 孩子集合

?1 < many-to-one
?2 ???????????? name ="parent"
?3 ????????????class ="com.norteksoft.bom.model.Node"
?4 ????????????cascade ="none"
?5 ????????????outer-join ="auto"
?6 ????????????column ="FK_NODE_ID"
?7 ???????? />
?8
?9 ???????? < set
10 ???????????? name ="children"
11 ????????????lazy ="true"
12 ????????????cascade ="all"
13 ????????????sort ="unsorted"
14 ???????? >
15
16 ?????????????? < key
17 ?????????????????? column ="FK_NODE_ID"
18 ?????????????? >
19 ?????????????? </ key >
20
21 ?????????????? < one-to-many
22 ?????????????????? class ="com.norteksoft.bom.model.Node"
23 ?????????????? />
24
25 ???????? </ set >
26
27

?1 ??/**
?2 ???*?查詢所有孩子節(jié)點(diǎn)
?3 ???*?@param?node?Node
?4 ???*?@param?list?List
?5 ???*?@return?List
?6 ???*/
?7 ??public?List?findAllChildrenNodes(Node?node,?List?list)?{
?8 ????if?(node.getChildren().size()?==?0)?{
?9 ??????return?list;
10 ????}?else?{
11 ??????for?(Iterator?it?=?node.getChildren().iterator();?it.hasNext();?)?{
12 ????????Node?theNode?=?(Node)?it.next();
13 ????????list.add(theNode);
14 ????????findAllChildrenNodes(theNode,?list);
15 ??????}
16
17 ??????return?list;
18 ????}
19 ??}
20
21