Universität Paderborn - Home Universität Paderborn
Die Universität der Informationsgesellschaft

Parallel Programming WS 2014/2015 - File PrimeTest.java

import java.util.Set;
import java.util.HashSet;
import java.util.Random;


class PrimeGenerator extends Thread {
   private Random rand = new Random(System.currentTimeMillis());

   private int getRandomNumber() {
      return Math.abs(rand.nextInt()) % 1000 + 2;
   }

   public void run() {
   }
}


class PrimeChecker extends Thread {

   private boolean isPrime(int n) {
      if (n % 2 == 0) {
            return false;
      }   // exclude even numbers;
      int div = 3;

      while (div * div <= n) {
            if (n % div == 0) {
               return false;
            }
            div += 2;
      }
      return true;
   }

   public void run() {
   }
}


class PrimeReporter extends Thread {
   private Set<Integer> oldNumbers = new HashSet<Integer>();

   private void reportNewNumber(Integer num) {
      if (oldNumbers.add(num)) {
            System.out.println("PrimeReporter reports " + num);
      }
   }

   public void run() {
   }
}


public class PrimeTest {
   private static final int N = 4; // number of PrimeCheckers


   public static void main(String[] args) {
   }
}

Generiert mit Camelot | Probleme mit Camelot? | Geändert am: 19.01.2015