jdk1.6中添加的future

最新推荐文章于 2022-03-20 23:33:55 发布

iteye_13304

最新推荐文章于 2022-03-20 23:33:55 发布

阅读量213

点赞数

CC 4.0 BY-SA版权

分类专栏： J2SE 文章标签： Java thread J# .net

本文链接：https://blog.youkuaiyun.com/iteye_13304/article/details/81601409

J2SE 专栏收录该内容

44 篇文章

订阅专栏

本文介绍了一个使用Java并发编程技术实现的素数计算程序。通过定义一个实现了Callable接口的PrimeCallable类来计算指定范围内的所有素数，并利用FutureTask和Thread进行异步任务调度。最后展示如何获取并打印计算结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

摘自：http://caterpillar.onlyfun.net/Gossip/JavaGossip-V2/CallableFuture.htm

package onlyfun.caterpillar;

import java.util.ArrayList;
import java.util.List;
import java.util.concurrent.Callable;

public class PrimeCallable implements Callable<int[]> {
	private int max;

	public PrimeCallable(int max) {
		this.max = max;
	}

	public int[] call() throws Exception {
		int[] prime = new int[max + 1];

		List<Integer> list = new ArrayList<Integer>();

		for (int i = 2; i <= max; i++)
			prime[i] = 1;

		for (int i = 2; i * i <= max; i++) {
			if (prime[i] == 1) {
				for (int j = 2 * i; j <= max; j++) {
					if (j % i == 0)
						prime[j] = 0;
				}
			}
		}

		for (int i = 2; i < max; i++) {
			if (prime[i] == 1) {
				list.add(i);
			}
		}

		int[] p = new int[list.size()];
		for (int i = 0; i < p.length; i++) {
			p[i] = list.get(i).intValue();
		}

		return p;
	}
}

package onlyfun.caterpillar;

import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.FutureTask;

public class FutureDemo {
	public static void main(String[] args) {
		Callable<int[]> primeCallable = new PrimeCallable(1000);
		FutureTask<int[]> primeTask = new FutureTask<int[]>(primeCallable);

		Thread t = new Thread(primeTask);
		t.start();

		try {
			Thread.sleep(5000);

			if (primeTask.isDone()) {
				int[] primes = primeTask.get();
				for (int prime : primes) {
					System.out.print(prime + " ");
				}
				System.out.println();
			}
		} catch (InterruptedException e) {
			e.printStackTrace();
		} catch (ExecutionException e) {
			e.printStackTrace();
		}
	}
}