• <ruby id="5koa6"></ruby>
    <ruby id="5koa6"><option id="5koa6"><thead id="5koa6"></thead></option></ruby>

    <progress id="5koa6"></progress>

  • <strong id="5koa6"></strong>
    • 軟件測試技術
    • 軟件測試博客
    • 軟件測試視頻
    • 開源軟件測試技術
    • 軟件測試論壇
    • 軟件測試沙龍
    • 軟件測試資料下載
    • 軟件測試雜志
    • 軟件測試人才招聘
      暫時沒有公告

    字號: | 推薦給好友 上一篇 | 下一篇

    寫不下了

    發布: 2007-7-14 19:53 | 作者: 佚名    | 來源: 網絡轉載     | 查看: 8次 | 進入軟件測試論壇討論

    領測軟件測試網 ==================================================
    file name:
    dboper.inc.php
    codes:
    ==================================================
    <?
    class dboper {
        var $items;
        var $result=0;
        
        function find($l_value) {
            for($j=1;$j<=$this->items["info_all"];$j++) {
                if($l_value==$this->items["d_id][$j]"])
                { return($j);exit; }
            
            }
                
        }
        
        function del($id) {
            //echo "del"." ".$id."<br>";
            include("conn_db.php");
            $Sql_Query="delete from department where d_id=$id";
            $Query_Db=mysql_query($Sql_Query,$Connect);
            
            //echo $Sql_Query;
            include("conn_close.php");
        }
        
        function update($d_id,$f_node,$l_node,$r_node) {
            include("conn_db.php");
            $Sql_Query="update department set f_node=".$f_node.",l_node=".$l_node.",r_node=".$r_node." where d_id=".$d_id;
            $Query_Db=mysql_query($Sql_Query,$Connect);
            
            //echo $Sql_Query;
            include("conn_close.php");
        }
            
        function d_tree($id,$base_id){//
            //echo "do<br>";
            $m=$this->find($base_id);//m is the position of $base_id in arrays
            $i=$this->find($id);
            
            if(($this->items["l_node][$i]"]!=0))
            {    
                //echo "向左下一級";
                //echo "<br>";
                $i=$this->find($this->items["l_node][$i]"]);
                $this->d_tree($this->items["d_id][$i]"],$base_id);
                //exit;
            }
            if(($this->items["r_node][$i]"]!=0)&&($this->items["l_node][$i]"]==0))
            {    
                //echo "向右下一級";
                //echo "<br>";
                $i=$this->find($this->items["r_node][$i]"]);
                $this->d_tree($this->items["d_id][$i]"],$base_id);
                //exit;
            }        
            
            if(($this->items["r_node][$i]"]==0)&&($this->items["l_node][$i]"]==0))
            {
                if($this->result==1){//very important method to exit my function
                    return true;
                }
                $this->del($this->items["d_id][$i]"]);
                $j=$i;//save this node information
                $i=$this->find($this->items["f_node][$i]"]);//find it's parent node
                //begin-----------------------------------------------------
                //if this node is the node you want to delete,delete it and exit function
                if(($this->items["r_node][$i]"]==$base_id)||($this->items["l_node][$i]"]==$base_id))
                {
                    $this->result=1;
                    return true;
                }
                //end--------------------------------------------------------
                else {
                //begin------------------------------------------------------
                //if this node is the child node of you wanted to deleted node
                //up to parent node and continue find
                    if($this->items["r_node][$i]"]==$this->items["d_id][$j]"])
                    {
                        //echo "左上一級";
                        //echo "<br>";
                        $this->items["r_node][$i]"]=0;
                        $this->d_tree($this->items["d_id][$i]"],$base_id);
                        //exit;
                    }
                    
                    if($this->items["l_node][$i]"]==$this->items["d_id][$j]"])
                    {
                        //echo "右上一級";
                        //echo "<br>";
                        $this->items["l_node][$i]"]=0;
                        $this->d_tree($this->items["d_id][$i]"],$base_id);
                        //exit;
                    }
                //end----------------------------------------------------------    
                }
                
            }        
        }    

        function d_node_tree($id,$base_id) {
            $m=$this->find($base_id);//m is the position of $base_id in arrays
            $i=$this->find($id);
            
            if(($this->items["l_node][$m]"]!=0))
            {
                $i=$this->find($this->items["l_node][$m]"]);//current node's left child node
                $j=$this->find($this->items["f_node][$m]"]);//current node's parent
                $this->d_tree($this->items["d_id][$i]"],$this->items["d_id][$i]"]);//del whole left child tree
                if($this->items["r_node][$m]"]!=0) {
                    if($this->items["r_node][$j]"]==$this->items["d_id][$m]"])//if it's parent's right child node
                    {
                        $i=$this->find($this->items["r_node][$m]"]);
                        $this->items["r_node][$j]"]=$this->items["d_id][$i]"];
                        $this->update($this->items["d_id][$j]"],$this->items["f_node][$j]"],$this->items["l_node][$j]"],$this->items["r_node][$j]"]);
                        //update where id = $this->items["d_id][$j]"]
                        $this->items["f_node][$i]"]=$this->items["d_id][$j]"];
                        $this->update($this->items["d_id][$i]"],$this->items["f_node][$i]"],$this->items["l_node][$i]"],$this->items["r_node][$i]"]);
                        //update where id = $this->items["d_id][$i]"]
                    }
                    
                    if($this->items["l_node][$j]"]==$this->items["d_id][$m]"])//if it's parent's right child node
                    {
                        $i=$this->find($this->items["r_node][$m]"]);
                        $this->items["l_node][$j]"]=$this->items["d_id][$i]"];
                        $this->update($this->items["d_id][$j]"],$this->items["f_node][$j]"],$this->items["l_node][$j]"],$this->items["r_node][$j]"]);
                        //update where id = $this->items["d_id][$j]"]
                        $this->items["f_node][$i]"]=$this->items["d_id][$j]"];
                        $this->update($this->items["d_id][$i]"],$this->items["f_node][$i]"],$this->items["l_node][$i]"],$this->items["r_node][$i]"]);
                        //update where id = $this->items["d_id][$i]"]
                    }
                    $this->del($this->items["d_id][$m]"]);
                }
                
                if($this->items["r_node][$m]"]==0) {
                    if($this->items["r_node][$j]"]==$this->items["d_id][$m]"])//if it's parent's right child node
                    {
                        $this->items["r_node][$j]"]=0;
                        $this->update($this->items["d_id][$j]"],$this->items["f_node][$j]"],$this->items["l_node][$j]"],$this->items["r_node][$j]"]);
                        //update where id = $this->items["d_id][$j]"]
                    }
                    
                    if($this->items["l_node][$j]"]==$this->items["d_id][$m]"])//if it's parent's right child node
                    {
                        $this->items["l_node][$j]"]=0;
                        $this->update($this->items["d_id][$j]"],$this->items["f_node][$j]"],$this->items["l_node][$j]"],$this->items["r_node][$j]"]);
                        //update where id = $this->items["d_id][$j]"]
                    }
                    $this->del($this->items["d_id][$m]"]);//del node it self
                }
                return true;
            }
            
            if(($this->items["l_node][$m]"]==0))
            {
                if($this->items["r_node][$m]"]!=0) {
                    
                    $j=$this->find($this->items["f_node][$m]"]);//current node's parent
                    if($this->items["r_node][$j]"]==$this->items["d_id][$m]"])//if it's parent's right child node
                    {
                        $i=$this->find($this->items["r_node][$m]"]);//current node's right child node
                        $this->update($this->items["d_id][$j]"],$this->items["f_node][$j]"],$this->items["l_node][$j]"],$this->items["d_id][$i]"]);
                        //update where id = $this->items["d_id][$j]"]
                        $this->update($this->items["d_id][$i]"],$this->items["d_id][$j]"],$this->items["l_node][$i]"],$this->items["r_node][$i]"]);
                        //update where id = $this->items["d_id][$i]"]
                    }
                    
                    if($this->items["l_node][$j]"]==$this->items["d_id][$m]"])//if it's parent's right child node
                    {
                        $i=$this->find($this->items["r_node][$m]"]);
                        $this->update($this->items["d_id][$j]"],$this->items["f_node][$j]"],$this->items["d_id][$i]"],$this->items["r_node][$j]"]);
                        //update where id = $this->items["d_id][$j]"]
                        $this->items["f_node][$i]"]=$this->items["d_id][$j]"];
                        $this->update($this->items["d_id][$i]"],$this->items["d_id][$j]"],$this->items["l_node][$i]"],$this->items["r_node][$i]"]);
                        //update where id = $this->items["d_id][$i]"]
                    }
                }
                if($this->items["r_node][$m]"]==0) {
                    $j=$this->find($this->items["f_node][$m]"]);//current node's parent
                    if($this->items["r_node][$j]"]==$this->items["d_id][$m]"])
                    {
                        $this->items["r_node][$j]"]=0;
                        $this->update($this->items["d_id][$j]"],$this->items["f_node][$j]"],$this->items["l_node][$j]"],$this->items["r_node][$j]"]);
                        //update where id = $this->items["d_id][$j]"]
                    }
                    if($this->items["l_node][$j]"]==$this->items["d_id][$m]"])
                    {
                        $this->items["l_node][$j]"]=0;
                        $this->update($this->items["d_id][$j]"],$this->items["f_node][$j]"],$this->items["l_node][$j]"],$this->items["r_node][$j]"]);
                        //update where id = $this->items["d_id][$j]"]
                    }
                }        
                $this->del($this->items["d_id][$m]"]);
                return true;
            }
        }
        
        function showinfo_0($status){//
            include("conn_db.php");
            $Sql_Query="select * from department order by d_id";
            $Query_Db=mysql_query($Sql_Query,$Connect);
            $info_all=mysql_num_rows($Query_Db);
            $this->items["info_all"]=$info_all;
            if($status==1) {//when status=1 show all data gets from database
                $MNums=$info_all;
                }
            if($status==0) {//when status=0 show 6 messages gets from database
                $MNums=6;
                }
            for($i=1;$i<=$MNums;$i++)
                {
                $Messages=mysql_fetch_array($Query_Db);
                $this->items["d_id][$i]"]=$Messages["d_id"];
                $this->items["f_node][$i]"]=$Messages["f_node"];
                $this->items["node_value][$i]"]=$Messages["node_value"];
                $this->items["l_node][$i]"]=$Messages["l_node"];
                $this->items["r_node][$i]"]=$Messages["r_node"];
                }
            include("conn_close.php");
            }
    }
    ?>

    ==================================================
    file name:
    conn_db.php
    codes:
    ==================================================
    <?
    $Connect = @mysql_connect('localhost','root','') or die("could not connet to server please try later");
    mysql_select_db("testxxx",$Connect);
    ?>

    ==================================================
    file name:
    addnode.inc.php
    codes:
    ==================================================

    <?
    class addnode{
        
        function find($l_value) {
            for($j=1;$j<=$this->items["info_all"];$j++) {
                if($l_value==$this->items["d_id][$j]"])
                { return($j);exit; }
            
            }
                
        }
        
        function search_id() {
            include("conn_db.php");
            $Sql_Query="select * from department order by d_id desc";
            $Query_Db=mysql_query($Sql_Query,$Connect);
            $Messages=mysql_fetch_array($Query_Db);
            include("conn_close.php");
            return $Messages["d_id"];
            }    
            
        function insertnode($f_node,$node_value,$r_node) {
            include("conn_db.php");
            $Sql_Query="insert into department values('','$f_node','$node_value','0','$r_node')";
            $Query_Db=mysql_query($Sql_Query,$Connect);
            include("conn_close.php");
        }

        function update($d_id,$f_node,$l_node,$r_node) {
            include("conn_db.php");
            $Sql_Query="update department set f_node=".$f_node.",l_node=".$l_node.",r_node=".$r_node." where d_id=".$d_id;
            $Query_Db=mysql_query($Sql_Query,$Connect);
            
            //echo $Sql_Query;
            include("conn_close.php");
        }
            
        function add($id,$node_value) {
            $i=$this->find($id);
            if(($this->items["l_node][$i]"]!=0))
            {        
                $j=$this->find($this->items["l_node][$i]"]);
                
                $this->update($this->items["d_id][$j]"],0,$this->items["l_node][$j]"],$this->items["r_node][$j]"]);
                $this->insertnode($this->items["d_id][$i]"],$node_value,$this->items["d_id][$j]"]);
                $c_d_id=$this->search_id();
                $this->update($this->items["d_id][$i]"],$this->items["f_node][$i]"],$c_d_id,$this->items["r_node][$i]"]);
                $this->update($this->items["d_id][$j]"],$c_d_id,$this->items["l_node][$j]"],$this->items["r_node][$j]"]);
            }
            if(($this->items["l_node][$i]"]==0))
            {    
                $this->insertnode($this->items["d_id][$i]"],$node_value,0);
                $this->update($this->items["d_id][$i]"],$this->items["f_node][$i]"],$this->search_id($this->items["d_id][$i]"]),$this->items["r_node][$i]"]);
                
            }
            
            
        }

        function showinfo_0($status){//
            include("conn_db.php");
            $Sql_Query="select * from department order by d_id";
            $Query_Db=mysql_query($Sql_Query,$Connect);
            $info_all=mysql_num_rows($Query_Db);
            $this->items["info_all"]=$info_all;
            if($status==1) {//when status=1 show all data gets from database
                $MNums=$info_all;
                }
            if($status==0) {//when status=0 show 6 messages gets from database
                $MNums=6;
                }
            for($i=1;$i<=$MNums;$i++)
                {
                $Messages=mysql_fetch_array($Query_Db);
                $this->items["d_id][$i]"]=$Messages["d_id"];
                $this->items["f_node][$i]"]=$Messages["f_node"];
                $this->items["node_value][$i]"]=$Messages["node_value"];
                $this->items["l_node][$i]"]=$Messages["l_node"];
                $this->items["r_node][$i]"]=$Messages["r_node"];
                }
            include("conn_close.php");
            }

    }
    ?>

    文章來源于領測軟件測試網 http://www.kjueaiud.com/


    關于領測軟件測試網 | 領測軟件測試網合作伙伴 | 廣告服務 | 投稿指南 | 聯系我們 | 網站地圖 | 友情鏈接
    版權所有(C) 2003-2010 TestAge(領測軟件測試網)|領測國際科技(北京)有限公司|軟件測試工程師培訓網 All Rights Reserved
    北京市海淀區中關村南大街9號北京理工科技大廈1402室 京ICP備10010545號-5
    技術支持和業務聯系:info@testage.com.cn 電話:010-51297073

    軟件測試 | 領測國際ISTQBISTQB官網TMMiTMMi認證國際軟件測試工程師認證領測軟件測試網

    老湿亚洲永久精品ww47香蕉图片_日韩欧美中文字幕北美法律_国产AV永久无码天堂影院_久久婷婷综合色丁香五月

  • <ruby id="5koa6"></ruby>
    <ruby id="5koa6"><option id="5koa6"><thead id="5koa6"></thead></option></ruby>

    <progress id="5koa6"></progress>

  • <strong id="5koa6"></strong>