|
| 1 | +/* |
| 2 | + * Copyright 2017 M. Isuru Tharanga Chrishantha Perera |
| 3 | + * |
| 4 | + * Licensed under the Apache License, Version 2.0 (the "License"); |
| 5 | + * you may not use this file except in compliance with the License. |
| 6 | + * You may obtain a copy of the License at |
| 7 | + * |
| 8 | + * http://www.apache.org/licenses/LICENSE-2.0 |
| 9 | + * |
| 10 | + * Unless required by applicable law or agreed to in writing, software |
| 11 | + * distributed under the License is distributed on an "AS IS" BASIS, |
| 12 | + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 13 | + * See the License for the specific language governing permissions and |
| 14 | + * limitations under the License. |
| 15 | + */ |
| 16 | +package com.github.chrishantha.sample.hotmethods; |
| 17 | + |
| 18 | +import com.beust.jcommander.JCommander; |
| 19 | +import com.beust.jcommander.Parameter; |
| 20 | + |
| 21 | +import java.util.Collection; |
| 22 | +import java.util.HashSet; |
| 23 | +import java.util.LinkedList; |
| 24 | +import java.util.Random; |
| 25 | + |
| 26 | +public class App { |
| 27 | + |
| 28 | + @Parameter(names = "--count", description = "Random Numbers Count") |
| 29 | + private int randomNumbersCount = 1000000; |
| 30 | + |
| 31 | + @Parameter(names = "--max", description = "Maximum limit to generate prime numbers") |
| 32 | + private int max = 100000; |
| 33 | + |
| 34 | + @Parameter(names = "--use-set", description = "Use Hash Set for Prime Numbers", arity = 0) |
| 35 | + private boolean useSet; |
| 36 | + |
| 37 | + @Parameter(names = "--help", description = "Display Help", help = true) |
| 38 | + private boolean help; |
| 39 | + |
| 40 | + public static void main(String[] args) { |
| 41 | + App app = new App(); |
| 42 | + final JCommander jcmdr = new JCommander(app); |
| 43 | + jcmdr.setProgramName(App.class.getSimpleName()); |
| 44 | + jcmdr.parse(args); |
| 45 | + |
| 46 | + System.out.println(app); |
| 47 | + |
| 48 | + if (app.help) { |
| 49 | + jcmdr.usage(); |
| 50 | + return; |
| 51 | + } |
| 52 | + |
| 53 | + app.start(); |
| 54 | + } |
| 55 | + |
| 56 | + private void start() { |
| 57 | + Collection<Integer> primeNumbers = useSet ? new HashSet<>() : new LinkedList<>(); |
| 58 | + System.out.println("Generating Prime numbers between 1 and " + max); |
| 59 | + for (int i = 1; i < max; i++) { |
| 60 | + boolean isPrimeNumber = true; |
| 61 | + // Check whether the number is prime |
| 62 | + for (int j = 2; j < i; j++) { |
| 63 | + if (i % j == 0) { |
| 64 | + isPrimeNumber = false; |
| 65 | + break; |
| 66 | + } |
| 67 | + } |
| 68 | + |
| 69 | + if (isPrimeNumber) { |
| 70 | + primeNumbers.add(i); |
| 71 | + } |
| 72 | + } |
| 73 | + |
| 74 | + Random random = new Random(); |
| 75 | + System.out.println("Checking Random Prime numbers"); |
| 76 | + int count = 0; |
| 77 | + for (int i = 1; i < randomNumbersCount; i++) { |
| 78 | + int randomNumber = random.nextInt(max); |
| 79 | + if (primeNumbers.contains(randomNumber)) { |
| 80 | + count++; |
| 81 | + } |
| 82 | + } |
| 83 | + System.out.format("Found %d prime numbers from %d random numbers%n", count, randomNumbersCount); |
| 84 | + } |
| 85 | + |
| 86 | + @Override |
| 87 | + public String toString() { |
| 88 | + StringBuilder builder = new StringBuilder(); |
| 89 | + builder.append("App [randomNumbersCount="); |
| 90 | + builder.append(randomNumbersCount); |
| 91 | + builder.append(", max="); |
| 92 | + builder.append(max); |
| 93 | + builder.append(", useSet="); |
| 94 | + builder.append(useSet); |
| 95 | + builder.append("]"); |
| 96 | + return builder.toString(); |
| 97 | + } |
| 98 | +} |
0 commit comments