package com.taiyusoft.thread2;
import com.taiyusoft.Fc;
import java.io.File;
import java.util.*;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.CyclicBarrier;
public class LinklistRunnable1 implements Runnable {
private CountDownLatch count;
private CyclicBarrier barrier;
private LinkedList<Fc> linkedList1 = new LinkedList<Fc>();
private LinkedList<Fc> linkedList2 = new LinkedList<Fc>();
private List listoneNot1 = new ArrayList<Fc>();
private List listoneNot2 = new ArrayList<Fc>();
private LinkedHashSet<Fc> setOne1;
private LinkedHashSet<Fc> setOne2;
private int setOneSize1;
private int setOneSize2;
private int num1;
private int num2;
private int a;
private int b;
public LinklistRunnable1(CountDownLatch count, CyclicBarrier barrier,
List<Fc> listoneNot1, List<Fc> listoneNot2,
LinkedList<Fc> linkedList1, LinkedList<Fc> linkedList2,
LinkedHashSet<Fc> setOne1, LinkedHashSet<Fc> setOne2,
int setOneSize1, int setOneSize2,
int num1, int num2,
int a, int b
) {
this.count = count;
this.barrier = barrier;
this.listoneNot1 = listoneNot1;
this.listoneNot2 = listoneNot2;
this.linkedList1 = linkedList1;
this.linkedList2 = linkedList2;
this.setOne1 = setOne1;
this.setOne2 = setOne2;
this.setOneSize1 = setOneSize1;
this.setOneSize2 = setOneSize2;
this.num1 = num1;
this.num2 = num2;
this.a = a;
this.b = b;
}
Object lock = new Object();
@Override
public void run() {
try {
barrier.await();
} catch (Exception e) {
}
while (num1 > a) {
fileCompare1();
}
count.countDown();
}
public void fileCompare1() {
synchronized (lock) {
if (num1 > a) {
setOne1.add(linkedList2.get(a));
if (setOne1.size() != setOneSize1) {
listoneNot1.add(linkedList2.get(a));
setOne1.remove(linkedList2.get(a));
setOneSize1 = setOne1.size();
}
a++;
}
}
try {
Thread.sleep(10);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
package com.taiyusoft.thread2;
import com.taiyusoft.Fc;
import java.util.ArrayList;
import java.util.LinkedHashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.CyclicBarrier;
public class LinklistRunnable2 implements Runnable {
private CountDownLatch count;
private CyclicBarrier barrier;
private LinkedList<Fc> linkedList1 = new LinkedList<Fc>();
private LinkedList<Fc> linkedList2 = new LinkedList<Fc>();
private List listoneNot1 = new ArrayList<Fc>();
private List listoneNot2 = new ArrayList<Fc>();
private LinkedHashSet<Fc> setOne1;
private LinkedHashSet<Fc> setOne2;
private int setOneSize1;
private int setOneSize2;
private int num1;
private int num2;
private int a;
private int b;
public LinklistRunnable2(CountDownLatch count, CyclicBarrier barrier,
List<Fc> listoneNot1, List<Fc> listoneNot2,
LinkedList<Fc> linkedList1, LinkedList<Fc> linkedList2,
LinkedHashSet<Fc> setOne1, LinkedHashSet<Fc> setOne2,
int setOneSize1, int setOneSize2,
int num1, int num2,
int a, int b
) {
this.count = count;
this.barrier = barrier;
this.listoneNot1 = listoneNot1;
this.listoneNot2 = listoneNot2;
this.linkedList1 = linkedList1;
this.linkedList2 = linkedList2;
this.setOne1 = setOne1;
this.setOne2 = setOne2;
this.setOneSize1 = setOneSize1;
this.setOneSize2 = setOneSize2;
this.num1 = num1;
this.num2 = num2;
this.a = a;
this.b = b;
}
Object lock = new Object();
@Override
public void run() {
try {
barrier.await();
} catch (Exception e) {
}
while (num2 > b) {
fileCompare2();
}
count.countDown();
}
public void fileCompare1() {
synchronized (lock) {
if (num1 > a) {
setOne1.add(linkedList2.get(a));
if (setOne1.size() != setOneSize1) {
listoneNot1.add(linkedList2.get(a));
setOne1.remove(linkedList2.get(a));
setOneSize1 = setOne1.size();
}
a++;
}
}
try {
Thread.sleep(10);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
public void fileCompare2() {
synchronized (lock) {
if (num2 > b) {
setOne2.add(linkedList1.get(b));
if (setOne2.size() != setOneSize2) {
listoneNot2.add(linkedList1.get(b));
setOne2.remove(linkedList1.get(b));
setOneSize2 = setOne2.size();
}
b++;
}
}
try {
Thread.sleep(10);
} catch (InterruptedException e) {
e.printStackTrace();
}
}
}
package com.taiyusoft.thread2;
import com.taiyusoft.Fc;
import java.io.File;
import java.util.*;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
public class main {
private static List listoneNot1 = new ArrayList<Fc>();
private static List listoneNot2 = new ArrayList<Fc>();
private static LinkedList<Fc> linkedList1 = new LinkedList<Fc>();
private static LinkedList<Fc> linkedList2 = new LinkedList<Fc>();
static int num1;
static int num2;
static int a;
static int b;
private static LinkedHashSet<Fc> setOne1 = new LinkedHashSet<>();;
private static LinkedHashSet<Fc> setOne2 = new LinkedHashSet<>();;
private static int setOneSize1;
private static int setOneSize2;
public static void main(String[] args) {
long startTime = System.currentTimeMillis();
String dirName1 = "C:\\Users\\taiyu\\Desktop\\4444\\file1";
File file = new File(dirName1);
readFileSum1(file, dirName1);
String dirName2 = "C:\\Users\\taiyu\\Desktop\\file2";
File file1 = new File(dirName2);
readFileSum2(file1, dirName2);
num1 = linkedList2.size();
a = 0;
setOne1.addAll(linkedList1);
setOneSize1 = setOne1.size();
num2 = linkedList1.size();
b = 0;
setOne2.addAll(linkedList2);
setOneSize2 = setOne2.size();
int threadNum = 500;
final CyclicBarrier barrier = new CyclicBarrier(threadNum);
final CountDownLatch count = new CountDownLatch(threadNum);
System.out.println("数据源1开始进行对比");
LinklistRunnable1 th1 = new LinklistRunnable1(
count, barrier,
listoneNot1, listoneNot2,
linkedList1, linkedList2,
setOne1, setOne2,
setOneSize1, setOneSize2,
num1, num2,
a,b
);
ExecutorService executorService1 = Executors.newFixedThreadPool(threadNum);
for (int i = 0; i < threadNum; i++) {
executorService1.submit(th1);
}
try {
count.await();
executorService1.shutdown();
}catch(Exception e){
}
System.out.println("数据源2开始进行对比");
LinklistRunnable2 th2 = new LinklistRunnable2(
count, barrier,
listoneNot1, listoneNot2,
linkedList1, linkedList2,
setOne1, setOne2,
setOneSize1, setOneSize2,
num1, num2,
a,b
);
ExecutorService executorService2 = Executors.newFixedThreadPool(threadNum);
for (int i = 0; i < threadNum; i++) {
executorService2.submit(th2);
}
try {
count.await();
executorService2.shutdown();
} catch (InterruptedException e) {
e.printStackTrace();
}
List listoneNot3 = new ArrayList<Fc>();
for (int i = 0; i < listoneNot1.size(); i++) {
String path1 = ((Fc) listoneNot1.get(i)).getPath();
for (int j = 0; j < listoneNot2.size(); j++) {
String path2 = ((Fc) listoneNot2.get(j)).getPath();
if (path1.equals(path2)) {
listoneNot3.add(listoneNot2.get(j));
listoneNot2.remove(listoneNot2.get(j));
listoneNot1.remove(listoneNot1.get(i));
}
}
}
if (listoneNot1.size() > 0) {
System.out.println("**********************************************");
System.out.println("数据源1与数据源2相比,发生删除或者新增操作的文件...");
for (int i = 0; i < listoneNot1.size(); i++) {
System.out.println(dirName1 + ((Fc) listoneNot1.get(0)).getPath());
}
System.out.println("**********************************************");
} else {
System.out.println("**********************************************");
System.out.println("数据源1与数据源2相比,未检测到发生删除或者新增操作的文件...");
System.out.println("**********************************************");
}
if (listoneNot2.size() > 0) {
System.out.println("__________________________________________________");
System.out.println("数据源2中排除的文件...");
for (int i = 0; i < listoneNot2.size(); i++) {
System.out.println(dirName2 + ((Fc) listoneNot2.get(0)).getPath());
}
System.out.println("__________________________________________________");
} else {
System.out.println("__________________________________________________");
System.out.println("数据源2与数据源1相比,未检测到发生删除或者新增操作的文件...");
System.out.println("__________________________________________________");
}
if (listoneNot3.size() > 0) {
System.out.println("&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&");
System.out.println("两者之间发生修改的文件");
for (int i = 0; i < listoneNot3.size(); i++) {
System.out.println(((Fc) listoneNot3.get(i)).getPath());
}
System.out.println("&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&");
} else {
System.out.println("&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&");
System.out.println("数据源2与数据源1,未检测到发生修改的文件...");
System.out.println("&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&");
}
long endTime = System.currentTimeMillis();
System.out.println("程序运行时间:" + (double) (endTime - startTime) / 1000 + "s");
}
public static void readFileSum1(File root, String dirName1) {
if (root.exists()) {
if (root.isDirectory()) {
File[] files = root.listFiles();
if (files != null) {
for (int i = 0; i < files.length; i++) {
if (files[i].isFile()) {
Fc fc = new Fc();
fc.setPath(files[i].toString().replace(dirName1, ""));
fc.setLastmodified(String.valueOf(files[i].lastModified()));
linkedList1.add(fc);
} else if (files[i].isDirectory()) {
readFileSum1(files[i], dirName1);
}
files[i] = null;
}
}
files = null;
} else if (root.isFile()) {
Fc fc = new Fc();
fc.setPath(root.toString().replace(dirName1, ""));
fc.setLastmodified(String.valueOf(root.lastModified()));
linkedList1.add(fc);
}
}
}
public static void readFileSum2(File root, String dirName2) {
if (root.exists()) {
if (root.isDirectory()) {
File[] files = root.listFiles();
if (files != null) {
for (int i = 0; i < files.length; i++) {
if (files[i].isFile()) {
Fc fc = new Fc();
fc.setPath(files[i].toString().replace(dirName2, ""));
fc.setLastmodified(String.valueOf(files[i].lastModified()));
linkedList2.add(fc);
} else if (files[i].isDirectory()) {
readFileSum2(files[i], dirName2);
}
files[i] = null;
}
}
files = null;
} else if (root.isFile()) {
Fc fc = new Fc();
fc.setPath(root.toString().replace(dirName2, ""));
fc.setLastmodified(String.valueOf(root.lastModified()));
linkedList2.add(fc);
}
}
}
}
package com.taiyusoft;
public class Fc {
String path;
String lastmodified;
public String getPath() {
return path;
}
public void setPath(String path) {
this.path = path;
}
public String getLastmodified() {
return lastmodified;
}
public void setLastmodified(String lastmodified) {
this.lastmodified = lastmodified;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Fc fc = (Fc) o;
if (path != null ? !path.equals(fc.path) : fc.path != null) return false;
return lastmodified != null ? lastmodified.equals(fc.lastmodified) : fc.lastmodified == null;
}
@Override
public int hashCode() {
int result = path != null ? path.hashCode() : 0;
result = 31 * result + (lastmodified != null ? lastmodified.hashCode() : 0);
return result;
}
}