Hibernate树型结构的算法,附源码

/** 
* @hibernate.class 
*  table="tree" 
*/ 
public class Component { 
        
        private long id; 

        private String name; 
        
        private Component parent; 
        
        private Set children=new HashSet(); 
        
        private Component(){} 
        
        public Component(String name){ 
                this.name=name; 
        } 
        
        /** 
        * @hibernate.id 
        *  generator-class = "native" 
        */  
        public getId(){ 
                return Id; 
        } 
        
        private setId(long id){ 
                this.id=id; 
        } 
        
        /** 
        * @hibernate.property 
        *  length="64" 
        *  not-null="true" 
        */ 
        public String getName(){ 
                return name; 
        } 
        
        public void setName(String name){ 
                this.name=name; 
        } 
        
        /** 
        * 获得父节点 
        * @hibernate.many-to-one 
        *  column="parentId" 
        */ 
        public Component getParent(){ 
                return parent; 
        } 
        
        public void setParent(Component parent){ 
                this.parent=parent; 
        } 
        
        /** 
        * 获得子节点 
        * @hibernate.set 
        *  lazy = "true" 
        *  table = "tree" 
        * @hibernate.collection-key 
        *  column = "parentId" 
        * @hibernate.collection-one-to-many 
        *  class = "Component" 
        */ 
        public Set getChildren(){ 
                return children; 
        } 
        
        private void setChildren(Set children){ 
                this.children=children; 
        } 
        
        public void addChild(Component child){ 
                children.add(child); 
        } 
        
        public void removeChild(Component child){ 
                childrent.remove(child); 
        } 
        
        public void clearChildren(){ 
                children=new HashSet(); 
        } 
}

 来源:http://www.360doc.com/content/06/0613/21/677_134134.shtml

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值