u盘检测java软件_Java之——U盘检测程序文件递归

转载请注明出处&＃xff1a;http://blog.csdn.net/l1028386804/article/details/53439922

今天&＃xff0c;给大家带来一篇由Java实现U盘监测和文件递归的文章&＃xff0c;其中代码主要通过File类中的listroots对文件系统进行遍历&＃xff0c;比较出盘符的变化&＃xff0c;进而通过递归遍历出U盘中的内容。好了&＃xff0c;不多说了&＃xff0c;我们直接上代码

package com.lyz.disk.test;

import java.io.File;

import java.util.Vector;

/**

* 搜索文件系统的盘符

* &＃64;author liuyazhuang

*

*/

public class DiskSearchThread implements Runnable {

/** root 现有文件系统的盘符 */

private File[] roots &＃61; File.listRoots();

/** fileVector 为了遍历U盘内文件 */

private VectorfileVector &＃61; new Vector();

volatile boolean sign &＃61; false;

SearchFileThread t &＃61; null;

public DiskSearchThread() {

}

&＃64;Override

public void run() {

System.out.println("Checking System...");

while (true) {

File[] tempFiles &＃61; File.listRoots();

fileVector.removeAllElements();

/** 检测到了有U盘插入 */

if (tempFiles.length > roots.length) {

for (int i &＃61; tempFiles.length - 1; i >&＃61; 0; i--) {

sign &＃61; false;

for (int j &＃61; roots.length - 1; j >&＃61; 0; j--) {

/** 如果前后比较的盘符相同 */

if (tempFiles[i].equals(roots[j])) {

sign &＃61; true;

}

}

/** 如果前后比较的盘符不相同&＃xff0c;将不相同的盘符写入向量&＃xff0c;并做进一步处理 */

if (!sign) {

fileVector.add(tempFiles[i]);

}

}

roots &＃61; File.listRoots();

t &＃61; new SearchFileThread(fileVector);

t.start();

} else {

for (int i &＃61; roots.length - 1; i >&＃61; 0; i--) {

sign &＃61; false;

for (int j &＃61; tempFiles.length - 1; j >&＃61; 0; j--) {

if (tempFiles[j].equals(roots[i])) {

sign &＃61; true;

}

}

/** 如果前后比较的盘符不相同&＃xff0c;表明U盘被拔出 */

if (!sign) {

System.out.println("QUIT:" &＃43; roots[i].toString());

fileVector.removeAllElements();

t.setIsExistToFalse();

// roots&＃61;File.listRoots();

}

}

roots &＃61; File.listRoots();

}

try {

Thread.sleep(1000);

} catch (InterruptedException e) {

e.printStackTrace();

}

}

}

public static void main(String[] args) {

new Thread(new DiskSearchThread()).start();

}

}

package com.lyz.disk.test;

import java.io.File;

import java.util.Vector;

/**

* 搜索文件的线程

* &＃64;author liuyazhuang

*

*/

public class SearchFileThread extends Thread {

private VectorfileVector &＃61; null;

private int scanNum &＃61; 1;

/** 线程安全的变量&＃xff0c;用于退出线程 */

volatile boolean isExist &＃61; true;

public SearchFileThread(VectorfileVector) {

this.fileVector &＃61; fileVector;

System.out.println("fileVector size:" &＃43; fileVector.size());

}

&＃64;Override

public void run() {

File file &＃61; fileVector.elementAt(scanNum - 1);

long totalMemory &＃61; file.getFreeSpace();

while (isExist) {

while (scanNum <&＃61; fileVector.size()) {

try {

System.out.println("search:"

&＃43; fileVector.elementAt(scanNum - 1).toString()

&＃43; " Total Space:"

&＃43; fileVector.elementAt(scanNum - 1).getTotalSpace()

/ 1024 / 1024 &＃43; "MB Free Space:"

&＃43; fileVector.elementAt(scanNum - 1).getFreeSpace()

/ 1024 / 1024 &＃43; "MB");

/** 遍历文件内容 */

getFiles(fileVector.elementAt(scanNum - 1).getPath());

scanNum&＃43;&＃43;;

} catch (Exception e) {

e.printStackTrace();

scanNum&＃43;&＃43;;

}

}

/** 如果盘符的大小发生变化&＃xff0c;则有文件进出 */

if (totalMemory !&＃61; file.getFreeSpace()) {

System.out.println("文件发生变化----------------------");

getFiles(file.getPath());

totalMemory &＃61; file.getFreeSpace();

}

}

}

/**

* 递归遍历文件

* &＃64;param path

*/

public void getFiles(String path) {

try {

File file &＃61; new File(path);

if (file.isDirectory()) {

File[] list &＃61; file.listFiles();

for (int i &＃61; 0; i

if (list[i].isDirectory()) {

/** 递归调用 */

getFiles(list[i].getPath());

}

System.out.println("Find File:" &＃43; list[i].getName());

}

}

} catch (Exception e) {

e.printStackTrace();

}

}

public synchronized void setIsExistToFalse() {

if (isExist)

isExist &＃61; false;

}

}