newprimethreads.java

来自「21天学通JAVA2（第三版）（专业参考版）」· Java 代码 · 共 34 行

public class NewPrimeThreads {
    public static void main(String[] arguments) {
        try {
            NewPrimeFinder[] finder = new NewPrimeFinder[arguments.length];
            for (int i = 0; i < arguments.length; i++) {
                long count = Long.parseLong(arguments[i]);
                finder[i] = new NewPrimeFinder(count);
                System.out.println("Looking for prime " + count);
            }
            boolean complete = false;
            while (!complete) {
                complete = true;
                for (int j = 0; j < finder.length; j++) {
                    if (!finder[j].finished)
                        complete = false;
                }    
                try {
                    Thread.sleep(1000);
                } catch (InterruptedException ie) {
                    // do nothing
                }
            }
            for (int j = 0; j < finder.length; j++) {
                System.out.println("Prime " + finder[j].target
                    + " is " + finder[j].prime);
            }    
        } catch (NumberFormatException nfe) {
                System.out.println("Error: " + nfe.getMessage());
        } catch (NegativeNumberException nne) {
                System.out.println("Error: " + nne.getMessage());
        }
    }
}