空中网面试题二SynchronousQueue
2015-08-15 23:58
465 查看
package com.jimmy;
import java.util.concurrent.SynchronousQueue;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
public class AirNet {
public static void main(String[] args) {
//final BlockingQueue<String> bk=new ArrayBlockingQueue<String>(4);
final SynchronousQueue<String> bk=new SynchronousQueue<String>(); //只有有线程等待,才能往队列放数据put
final Lock lk=new ReentrantLock();
System.out.println("begin:"+(System.currentTimeMillis()/1000));
for(int i=0;i<10;i++){ //这行不能改动4
new Thread(new Runnable(){
@Override
public void run() {
while(true){try {
lk.lock();
String str=bk.take();
String output = TestDo.doSome(str);
System.out.println(Thread.currentThread().getName()+ ":" + output);
lk.unlock();
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
}
}).start();
}
for(int i=0;i<10;i++){
String input = i+"";
try {
bk.put(input);
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
}
}
//不能改动此TestDo类
class TestDo {
public static String doSome(String input){
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
String output = input + ":"+ (System.currentTimeMillis() / 1000);
return output;
}
}
import java.util.concurrent.SynchronousQueue;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
public class AirNet {
public static void main(String[] args) {
//final BlockingQueue<String> bk=new ArrayBlockingQueue<String>(4);
final SynchronousQueue<String> bk=new SynchronousQueue<String>(); //只有有线程等待,才能往队列放数据put
final Lock lk=new ReentrantLock();
System.out.println("begin:"+(System.currentTimeMillis()/1000));
for(int i=0;i<10;i++){ //这行不能改动4
new Thread(new Runnable(){
@Override
public void run() {
while(true){try {
lk.lock();
String str=bk.take();
String output = TestDo.doSome(str);
System.out.println(Thread.currentThread().getName()+ ":" + output);
lk.unlock();
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
}
}).start();
}
for(int i=0;i<10;i++){
String input = i+"";
try {
bk.put(input);
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
}
}
//不能改动此TestDo类
class TestDo {
public static String doSome(String input){
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
String output = input + ":"+ (System.currentTimeMillis() / 1000);
return output;
}
}
相关文章推荐
- poj 1947 Rebuilding Roads 树形dp
- UIButton和UIImageView的区别一
- iOS开发UI篇—核心动画(UIView封装动画)
- pat(A) 1007. Maximum Subsequence Sum(和最大子段)
- HDU 1005.Number Sequence【很多问题是不能直接求的】【8月15】
- codeforces#FF DIV2C题DZY Loves Sequences(DP)
- HDU 2227 Find the nondecreasing subsequences
- 刀哥多线程全局队列gcd-09-global_queue
- zoj 2672 Fibonacci Subsequence(hash + dp)
- UINavigationControl
- CoreGraphics对UIImage图片裁剪
- 刀哥多线程之主队列gcd-06-main_queue
- 刀哥多线程之并发队列gcd-05-dispatch_queue_concurrent
- 刀哥多线程串行队列gcd-04-dispatch_queue_serial
- Codeforces Round #216 (Div. 2) E. Valera and Queries (BIT)
- WPF QuickStart系列之样式和模板(Style and Template)
- UIView的类别实现之设置frame
- IOS--UI--XML 解析
- UITableView的封装和类的交互2
- B. Jzzhu and Sequences