//typescriptClasses/Algorithms.ts
//Matthew Ellison
// Created: 10-19-20
//Modified: 03-10-21
//This class holds many algorithms that I have found it useful to keep around
/*
Copyright (C) 2021  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
	the Free Software Foundation, either version 3 of the License, or
	(at your option) any later version.

	This program is distributed in the hope that it will be useful,
	but WITHOUT ANY WARRANTY; without even the implied warranty of
	MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
	GNU Lesser General Public License for more details.

	You should have received a copy of the GNU Lesser General Public License
	along with this program.  If not, see <https://www.gnu.org/licenses/>.
*/


import assert = require("assert");
import { arrayEquals, getAllFib, getAllFibBig, getFactors, getFactorsBig, getPrimes, getPrimesBig, getNumPrimes, getNumPrimesBig } from "./Algorithms";


function testGetAllFib(){
	//Test 1
	let correctAnswer = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89];
	let highestNumber = 100;
	let answer = getAllFib(highestNumber);
	assert.ok(arrayEquals(answer, correctAnswer), "getAllFib number 1 failed");

	//Test 2
	correctAnswer = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987]
	highestNumber = 1000;
	answer = getAllFib(highestNumber);
	assert.ok(arrayEquals(answer, correctAnswer), "getAllFib number 2 failed");

	//Test 3
	let bigCorrectAnswer = [1n, 1n, 2n, 3n, 5n, 8n, 13n, 21n, 34n, 55n, 89n];
	let bigHighestNumber = 100n;
	let bigAnswer = getAllFibBig(bigHighestNumber);
	assert.ok(arrayEquals(bigAnswer, bigCorrectAnswer), "getAllFibBig failed");
	console.log("testGetAllFib passed");
}

function testGetPrimes(){
	//Test1
	let correctAnswer = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97];
	let topNum = 100;
	let answer = getPrimes(topNum);
	assert.ok(arrayEquals(answer, correctAnswer), "getPrimes number failed");

	//Test 2
	let bigCorrectAnswer = [2n, 3n, 5n, 7n, 11n, 13n, 17n, 19n, 23n, 29n, 31n, 37n, 41n, 43n, 47n, 53n, 59n, 61n, 67n, 71n, 73n, 79n, 83n, 89n, 97n];
	let bigTopNum = 100n;
	let bigAnswer = getPrimesBig(bigTopNum);
	assert.ok(arrayEquals(bigAnswer, bigCorrectAnswer), "getPrimesBig failed");

	console.log("getPrimes passed");
}

function testGetNumPrimes(){
	//Test1
	let correctAnswer = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97];
	let numPrimes = 25;
	let answer = getNumPrimes(numPrimes);
	assert.ok(arrayEquals(answer, correctAnswer), "getNumPrimes number failed");

	//Test2
	let bigCorrectAnswer = [2n, 3n, 5n, 7n, 11n, 13n, 17n, 19n, 23n, 29n, 31n, 37n, 41n, 43n, 47n, 53n, 59n, 61n, 67n, 71n, 73n, 79n, 83n, 89n, 97n];
	let bigNumPrimes = 25n;
	let bigAnswer = getNumPrimesBig(bigNumPrimes);
	assert.ok(arrayEquals(bigAnswer, bigCorrectAnswer), "getNumPrimesBig failed");

	console.log("getNumPrimes passed");
}

function testGetFactors(){
	//Test 1
	let correctAnswer = [2, 2, 5, 5];
	let number = 100;
	let answer = getFactors(number);
	assert.ok(arrayEquals(answer, correctAnswer), "getFactor number 1 failed");
	//Test 2
	correctAnswer = [2, 7, 7];
	number = 98;
	answer = getFactors(number);
	assert.ok(arrayEquals(answer, correctAnswer), "getFactor number 2 failed");

	//Test 3
	let bigCorrectAnswer = [2n, 7n, 7n];
	let bigNumber = 98n;
	let bigAnswer = getFactorsBig(bigNumber);
	assert.ok(arrayEquals(answer, correctAnswer), "getFactors BigInt failed");

	console.log("getFactors passed");
}


//Run all of the tests
testGetAllFib();
testGetPrimes();
testGetNumPrimes();
testGetFactors();