wait
package money.thread;
import money.Log;
public class AddRunner extends ExecutableRunner {
private static final String TAG = "AddRunner";
public int a;
public AddRunner(Object readyTaskListLock, String description, int exclusiveValue, int type) {
super(readyTaskListLock, description, exclusiveValue, type);
a = 0;
}
@Override
public void run() {
while (true) {
a++;
Log.d(TAG, "description:" + description + " a:" + a);
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
e.printStackTrace();
}
if (a == 5) {
synchronized (readyTaskListLock) {
// TODO: modify state
readyTaskListLock.notify();
}
return;
}
}
}
}
package money; import money.thread.AddRunner;
import money.thread.ExecutableRunner; public class Test { private static final String TAG = "Test"; public static void main(String[] args) {
Processor processor = Processor.instance();
processor.start(); // wait for the initialization of processor
try {
Thread.sleep(300);
} catch (InterruptedException e) {
e.printStackTrace();
} for (int i = 0; i < 4; i++) {
ExecutableRunner runner = new AddRunner(processor.getReadyTaskListLock(), "" + i, 0, 0);
processor.addTask(runner); try {
Thread.sleep(2000);
} catch (InterruptedException e) {
e.printStackTrace();
}
} Log.d(TAG, "to add other task....");
}
}
随机推荐
- ubuntu 进入 pycharm(社区版)
先进入到pycharm所在的目录,然后进入bin 然后./pycharm.sh 例如,我把pycharm 放在桌面上 su ➜ xushukui cd '/home/xushukui/桌面/pycha ...
- [COGS2479 && COGS2639]高维偏序(CDQ分治,bitset)
COGS2479:四维偏序. CDQ套CDQ CDQ:对a分治,对b排序,再对a打标记,然后执行CDQ2 CDQ2:对b分治,对c归并排序,对d树状数组. #include<cstdio> ...
- 【手动开栈】【dfs序】【树状数组】【Tarjan】bzoj2819 Nim
考虑树状数组区间修改(只对其子树的答案有影响)点查询,每个点记录的是它到根路径上的权值异或和. 答案时query(L)^query(R)^a[lca]. 这种方法在支持区间加法.减法的树上询问的时候可 ...
- 【匈牙利算法模板】BZOJ1191-超级英雄
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> us ...
- [CF735E/736C]Ostap and Tree
题目大意: 一个$n(n\le100)$个点的树,将一些点染成黑点,求满足每个点到最近黑点的距离$\le k(k\le\min(20,n-1))$的方案数. 思路: 树形DP. 用$f[i][j]$表 ...
- 程序调控和监视(Logcat,Debug)
1.Logcat 2.效果图:实现点击Button,提示Logcat信息 (1)activity_main.xml <?xml version="1.0" encoding= ...
- maven-pom-profile
出处: http://blog.csdn.net/taiyangdao/article/details/52390095
- [测试技术分享]easyFuzzer使用案例分享
easyFuzzer使用案例分享 1.简介: easyFuzzer是wooyun的一位白帽子(光刃)提供的一款用于fuzz文件的工具.平时主要是和网络协议安全打交道,和本地软件安全打交道比较少,所以没 ...
- Why DNS Based Global Server Load Balancing (GSLB) Doesn’t Work
Why DNS Based Global Server Load Balancing (GSLB) Doesn't Work
- Codeforces D. Giving Awards 412 题解
就是依照一定顺序输出排序. 比方a欠b的钱就不能先输出a然后输出b. 本题的技巧就是.要求的是不能先输出a然后输出b,可是能够先输出b然后输出a. 故此能够依照a欠b的钱的关系.建立图,然后DFS深度 ...