Java多线程-对歌式互动-5对夫妻

package com;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Random;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;


public class Test {

private static final int goldenCount = 100;//100 golden bricks
private static final int familyGroup = 5;
private static final String inputFile = "testInput.txt";

public static void generateTestFile() throws IOException{
PrintWriter pw = new PrintWriter(new FileWriter(new File(inputFile)),true);
Random random = new Random();
for(int i=0;i<goldenCount; i++){
pw.write(Math.abs(random.nextInt()) % goldenCount + ",");
}
pw.flush();
pw.close();
}


public static void main(String[] args) {
try{
generateTestFile();
BufferedReader reader = new BufferedReader(new FileReader(inputFile));
String str = reader.readLine();
reader.close();
String[] strs = str.split(",");
int index = 0;
int countForEachGroup = goldenCount/familyGroup;
for(int i=0; i < familyGroup; i++ ){
int records[] = new int[countForEachGroup];
for(int j=0; j<countForEachGroup; j++){
records[j] = Integer.parseInt(strs[index]);
index++;
}
Family family = new Family(records,i);
family.startFuck();
}
}catch(Exception ex){
ex.printStackTrace();
}
}
}




class Family{

private static volatile int finishCount = 0;

private Lock lock = new ReentrantLock();

private Condition oddLock = lock.newCondition();

private Condition evenLock = lock.newCondition();

private int records[];//all the family need to load

private PrintWriter writer;

private volatile int oddIndex = 0;

private volatile int evenIndex = 0;

private OddPrintThread oddPrintThread;

private EvenPrintThread evenPrintThread;

private volatile boolean first = true;

private int[] result = new int[20];

private int index = 0;

public Family(int[] records,int id) throws Exception{
this.records = records;
this.writer = new PrintWriter(new FileWriter(new File("output"+id+".txt")),true);
}
public void startFuck(){
oddPrintThread  = new OddPrintThread();
evenPrintThread = new EvenPrintThread();
oddPrintThread.start();
evenPrintThread.start();
}

private class OddPrintThread extends Thread{

public void run(){
while(true){
try{
lock.lock();
if(first){
first = false;
evenLock.await();
}
for(int i=0; i<10;){//print 10
if(oddIndex >= records.length && evenIndex >= records.length ){
writer.flush();
writer.close();
return;
}
if(oddIndex >= records.length ){
break;
}
if(records[oddIndex]%2  == 1){//if not?try next
i++;
writer.println(records[oddIndex] + " ");
result[index++] = records[oddIndex];
writer.flush();
addCount(this.getName());
}
oddIndex++;
}
oddLock.signal();
evenLock.await();
}catch(Exception ex){
ex.printStackTrace();
}finally{
oddLock.signal();
lock.unlock();
}
}
}
}

private class EvenPrintThread extends Thread{
public void run(){
while(true){
try{
while(first){
Thread.sleep(1);
}
lock.lock();
for(int i=0; i<10;){
if(oddIndex >= records.length && evenIndex >= records.length ){
String s = "";
for(int k=0; k< 20; k++){
s += (result[k]+ " " );
}
writer.flush();
return;
}
if(evenIndex >= records.length ){//this group finish?
break;
}
if(records[evenIndex] % 2 == 0){
i++;
writer.print(records[evenIndex] + " ");
result[index++] = records[evenIndex];
writer.flush();
addCount(this.getName());
}
evenIndex++;
}
evenLock.signal();
oddLock.await();
}catch(Exception ex){
ex.printStackTrace();
}
finally{
evenLock.signal();
lock.unlock();
}
}//end of while
}//end of run
}//end of class

private synchronized static void addCount(String threadName){
finishCount++;
if(finishCount%10 == 0){
System.out.println(threadName+" already finish:"+finishCount);
if(finishCount== 100){
System.out.println("Done!");
}
}
}
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值