tree1.java

学习java 自己开发的企业管理系统,适合初学者

package zhican;
import zhican.Frame2;
import java.sql.Statement;
import java.sql.SQLException;
import java.sql.*;
import javax.swing.tree.*;
import zhican.sql;
public class tree1 {
    String []treedlz;//大类字符串数组
    String [][]treexlz;//小类字符串数组
    int treedls;//大类个数
    int treexls[];//小类个数
    int treexlmax;//最大
    public tree1() {

    }
    public String[] treedl(){
        int aa=0;
        try {
           ResultSet res=sql.sta.executeQuery("select 大类名称 from wwwtree group by 大类名称");//group by 自动排序
           res.last();
           treedls=res.getRow();
            //System.out.println(treedls);
           res.beforeFirst();
           treedlz=new String[treedls];
           while(res.next()){
              treedlz[aa]= res.getString(1);
              aa++;
           }

       } catch (SQLException ex) {
           System.out.println(ex);
       }
        return treedlz;
    }
    public String[][] treexl(){
        treexls=new int[treedls];
        for(int i=1;i<treedls;i++){
           if(treexls[i-1]>treexls[i]){
               treexls[i]=treexls[i-1];
           }
           treexlmax=treexls[i];
       }

       // treexlz=new String[treedls][treexlmax];
       treexlz=new String[10][20];
        try {
            for(int bb=0;bb<treedls;bb++){
                int cc=0;
                ResultSet res = sql.sta.executeQuery(
                        "select 小类名称 from wwwtree where 大类名称='" + treedlz[bb] +"'");
                res.last();
                treexls[bb]=res.getRow();
                res.beforeFirst();
                while (res.next()) {
                    treexlz[bb][cc] = res.getString(1);
                    cc++;
                }
            }
       } catch (SQLException ex) {
           System.out.println(ex);
       }


        return treexlz;
    }
    public void treeshow(DefaultMutableTreeNode root){//把查询到的接点放在新的数组里
       DefaultMutableTreeNode a[]= new DefaultMutableTreeNode[treedls];
       DefaultMutableTreeNode b[][];

       //b= new DefaultMutableTreeNode[treedls][treexlmax];
       b= new DefaultMutableTreeNode[10][20];
        for(int i=0;i<this.treedls;i++){
            a[i]=new DefaultMutableTreeNode(treedlz[i]);
            root.add(a[i]);
        }
        for(int i=0;i<this.treedls;i++){
            for(int j=0;j<this.treexls[i];j++){
                b[i][j]=new DefaultMutableTreeNode(treexlz[i][j]);
                a[i].add(b[i][j]);
            }
        }
    }
}