mirror of
https://bitbucket.org/Mattrixwv/javaclasses.git
synced 2025-12-07 23:43:58 -05:00
Updated libraries and increased test coverage
This commit is contained in:
@@ -1,10 +1,10 @@
|
||||
//JavaClasses/src/test/java/mattrixwv/TestNumberAlgorithms.java
|
||||
//Matthew Ellison
|
||||
// Created: 07-03-21
|
||||
//Modified: 06-26-22
|
||||
//Modified: 04-13-23
|
||||
//This class contains tests for my number algorithms
|
||||
/*
|
||||
Copyright (C) 2022 Matthew Ellison
|
||||
Copyright (C) 2023 Matthew Ellison
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License as published by
|
||||
@@ -115,94 +115,109 @@ public class TestNumberAlgorithms{
|
||||
int num = 4;
|
||||
boolean correctAnswer = false;
|
||||
boolean answer = NumberAlgorithms.isPrime(num);
|
||||
assertEquals(correctAnswer, answer, "isPrime int 1 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 2
|
||||
num = 9;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(num);
|
||||
assertEquals(correctAnswer, answer, "isPrime int 2 failed");
|
||||
//Test 3
|
||||
num = 15;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(num);
|
||||
assertEquals(correctAnswer, answer, "isPrime int 3 failed");
|
||||
//Test 4
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 3
|
||||
num = 97;
|
||||
correctAnswer = true;
|
||||
answer = NumberAlgorithms.isPrime(num);
|
||||
assertEquals(correctAnswer, answer, "isPrime int 4 failed");
|
||||
//Test 5
|
||||
num = 1000;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(num);
|
||||
assertEquals(correctAnswer, answer, "isPrime int 5 failed");
|
||||
//Test 6
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 4
|
||||
num = 1;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(num);
|
||||
assertEquals(correctAnswer, answer, "isPrime int 6 failed");
|
||||
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 5
|
||||
num = 2;
|
||||
correctAnswer = true;
|
||||
answer = NumberAlgorithms.isPrime(num);
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 6
|
||||
num = 49;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(num);
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 7
|
||||
long longNum = 4;
|
||||
num = 55;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(longNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime long 1 failed");
|
||||
answer = NumberAlgorithms.isPrime(num);
|
||||
assertEquals(correctAnswer, answer);
|
||||
|
||||
//Test 8
|
||||
longNum = 9;
|
||||
long longNum = 4L;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(longNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime long 2 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 9
|
||||
longNum = 15;
|
||||
longNum = 15L;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(longNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime long 3 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 10
|
||||
longNum = 97;
|
||||
longNum = 97L;
|
||||
correctAnswer = true;
|
||||
answer = NumberAlgorithms.isPrime(longNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime long 4 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 11
|
||||
longNum = 1000;
|
||||
longNum = 1L;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(longNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime long 5 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 12
|
||||
longNum = 1;
|
||||
longNum = 2L;
|
||||
correctAnswer = true;
|
||||
answer = NumberAlgorithms.isPrime(longNum);
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 13
|
||||
longNum = 49L;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(longNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime long 6 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 14
|
||||
longNum = 55L;
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(longNum);
|
||||
assertEquals(correctAnswer, answer);
|
||||
|
||||
//Test 13
|
||||
//Test 15
|
||||
BigInteger bigNum = BigInteger.valueOf(4);
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(bigNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime BigInteger 1 failed");
|
||||
//Test 14
|
||||
bigNum = BigInteger.valueOf(9);
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(bigNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime BigInteger 2 failed");
|
||||
//Test 15
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 16
|
||||
bigNum = BigInteger.valueOf(15);
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(bigNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime BigInteger 3 failed");
|
||||
//Test 16
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 17
|
||||
bigNum = BigInteger.valueOf(97);
|
||||
correctAnswer = true;
|
||||
answer = NumberAlgorithms.isPrime(bigNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime BigInteger 4 failed");
|
||||
//Test 17
|
||||
bigNum = BigInteger.valueOf(1000);
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(bigNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime BigInteger 5 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 18
|
||||
bigNum = BigInteger.ONE;
|
||||
bigNum = BigInteger.valueOf(1);
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(bigNum);
|
||||
assertEquals(correctAnswer, answer, "isPrime BigInteger 6 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 19
|
||||
bigNum = BigInteger.valueOf(2);
|
||||
correctAnswer = true;
|
||||
answer = NumberAlgorithms.isPrime(bigNum);
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 20
|
||||
bigNum = BigInteger.valueOf(49);
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(bigNum);
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 21
|
||||
bigNum = BigInteger.valueOf(55);
|
||||
correctAnswer = false;
|
||||
answer = NumberAlgorithms.isPrime(bigNum);
|
||||
assertEquals(correctAnswer, answer);
|
||||
}
|
||||
|
||||
@Test
|
||||
@@ -211,49 +226,66 @@ public class TestNumberAlgorithms{
|
||||
List<Integer> correctAnswer = Arrays.asList(2, 2, 5, 5);
|
||||
int number = 100;
|
||||
List<Integer> answer = NumberAlgorithms.getFactors(number);
|
||||
assertEquals(correctAnswer, answer, "getFactors int 1 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 2
|
||||
correctAnswer = Arrays.asList(2, 7, 7);
|
||||
number = 98;
|
||||
answer = NumberAlgorithms.getFactors(number);
|
||||
assertEquals(correctAnswer, answer, "getFactors int 2 failed");
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 3
|
||||
correctAnswer = Arrays.asList(7);
|
||||
number = 7;
|
||||
answer = NumberAlgorithms.getFactors(number);
|
||||
assertEquals(correctAnswer, answer, "getFactors int 3 failed");
|
||||
|
||||
assertEquals(correctAnswer, answer);
|
||||
//Test 4
|
||||
correctAnswer = Arrays.asList(2, 5);
|
||||
number = 10;
|
||||
answer = NumberAlgorithms.getFactors(number);
|
||||
assertEquals(correctAnswer, answer);
|
||||
|
||||
|
||||
//Test 5
|
||||
List<Long> longCorrectAnswer = Arrays.asList(2L, 2L, 5L, 5L);
|
||||
long longNumber = 100L;
|
||||
List<Long> longAnswer = NumberAlgorithms.getFactors(longNumber);
|
||||
assertEquals(longCorrectAnswer, longAnswer, "getFactors long 1 failed");
|
||||
//Test 5
|
||||
assertEquals(longCorrectAnswer, longAnswer);
|
||||
//Test 6
|
||||
longCorrectAnswer = Arrays.asList(2L, 7L, 7L);
|
||||
longNumber = 98;
|
||||
longAnswer = NumberAlgorithms.getFactors(longNumber);
|
||||
assertEquals(longCorrectAnswer, longAnswer, "getFactors long 2 failed");
|
||||
//Test 6
|
||||
assertEquals(longCorrectAnswer, longAnswer);
|
||||
//Test 7
|
||||
longCorrectAnswer = Arrays.asList(7L);
|
||||
longNumber = 7;
|
||||
longAnswer = NumberAlgorithms.getFactors(longNumber);
|
||||
assertEquals(longCorrectAnswer, longAnswer, "getFactors long 3 failed");
|
||||
assertEquals(longCorrectAnswer, longAnswer);
|
||||
//Test 8
|
||||
longCorrectAnswer = Arrays.asList(2L, 5L);
|
||||
longNumber = 10L;
|
||||
longAnswer = NumberAlgorithms.getFactors(longNumber);
|
||||
assertEquals(longCorrectAnswer, longAnswer);
|
||||
|
||||
//Test 7
|
||||
|
||||
//Test 9
|
||||
List<BigInteger> bigCorrectAnswer = Arrays.asList(BigInteger.TWO, BigInteger.TWO, BigInteger.valueOf(5), BigInteger.valueOf(5));
|
||||
BigInteger bigNumber = BigInteger.valueOf(100);
|
||||
List<BigInteger> bigAnswer = NumberAlgorithms.getFactors(bigNumber);
|
||||
assertEquals(bigCorrectAnswer, bigAnswer, "getFactors BigInteger failed");
|
||||
//Test 8
|
||||
assertEquals(bigCorrectAnswer, bigAnswer);
|
||||
//Test 10
|
||||
bigCorrectAnswer = Arrays.asList(BigInteger.valueOf(2), BigInteger.valueOf(7), BigInteger.valueOf(7));
|
||||
bigNumber = BigInteger.valueOf(98);
|
||||
bigAnswer = NumberAlgorithms.getFactors(bigNumber);
|
||||
assertEquals(bigCorrectAnswer, bigAnswer, "getFactors BigInteger failed");
|
||||
//Test 9
|
||||
assertEquals(bigCorrectAnswer, bigAnswer);
|
||||
//Test 11
|
||||
bigCorrectAnswer = Arrays.asList(BigInteger.valueOf(7));
|
||||
bigNumber = BigInteger.valueOf(7);
|
||||
bigAnswer = NumberAlgorithms.getFactors(bigNumber);
|
||||
assertEquals(bigCorrectAnswer, bigAnswer, "getFactors BigInteger failed");
|
||||
assertEquals(bigCorrectAnswer, bigAnswer);
|
||||
//Test 12
|
||||
bigCorrectAnswer = Arrays.asList(BigInteger.TWO, BigInteger.valueOf(5));
|
||||
bigNumber = BigInteger.valueOf(10);
|
||||
bigAnswer = NumberAlgorithms.getFactors(bigNumber);
|
||||
assertEquals(bigCorrectAnswer, bigAnswer);
|
||||
}
|
||||
|
||||
@Test
|
||||
|
||||
Reference in New Issue
Block a user