fileoperation.java

一宗队列算法

//Source file: E:/工作和学习/工作/硕士论文工作/程序/数据库缓存管理/20040304/src/MemCachePak/FileOperation.java

package MemCachePak;

import java.io.File;
import java.io.IOException;

public class FileOperation
{

   static
   {
   }

   /**
   @roseuid 41AD78DB01F4
   */
   public static boolean deletefile(String filename)
   {
     File dfile = new File(filename);
     return dfile.delete();
   }

   /**
   @roseuid 41AD79110148
   */
   public static boolean deletefile(String filepath, String filename)
   {
     File dfile = new File(filepath,filename);
     return dfile.delete();
   }

   /**
   @roseuid 41AD794D0119
   */
   public static boolean deletefolder(String folderpath)
   {
     File dfile = new File(folderpath);
     //System.out.println(dfile.exists());
     //System.out.println(dfile.getPath());
     int i;
     String[] tempS = dfile.list();
     if(dfile.list()!=null)
     {
       i = tempS.length;
     }
     else
     {
       i = 0;
     }
     //System.out.println(i);
     if(i>0)
     {
       while(i>0)
       {
         //System.out.println(tempS[i-1]);
         File childfile = new File(dfile.getAbsolutePath(),tempS[i-1]);

         if(childfile.isDirectory())
         {
           /*System.out.println("文件夹删除结果："+*/deletefolder(childfile.getAbsolutePath())/*)*/;
         }
         else
         {
           /*System.out.println("文件删除结果："+*/childfile.delete()/*)*/;
           i--;
         }
       }
     }
     return dfile.delete();
   }
}