Merge pull request #6 from pro-js/number_conversion

Number conversion

Author: jinnatul

lib/basic.js

@@ -60,3 +60,23 @@ export function average(...array) {
 export function getRemainder(firstNumber, secondNumber) {
   return ((firstNumber % secondNumber) + secondNumber) % secondNumber;
 }
+
+/**
+ * pass arguments or array and get the minimum number
+ * getMinimum([1,3,5,4,9]) // 1
+ * getMinimum(2,45,2,76,0,4) // 0
+ * @param  {...any} array
+ */
+export function getMinimum(...array) {
+  if (array[0][0] !== undefined) array = array[0];
+  return Math.min(...array);
+}
+
+/**
+ * pass arguments or array and get the maximum number
+ * @param  {...any} array
+ */
+export function getMaximum(...array) {
+  if (array[0][0] !== undefined) array = array[0];
+  return Math.max(...array);
+}

lib/conversion.js

@@ -42,3 +42,25 @@ export function radsToDegs(rad) {
 export function stringToNumber(str) {
   return parseFloat(str);
 }
+
+/**
+ * Pass the number in string format and then give fromBase and toBase
+ * means from which base to which base you want to convert the number.
+ * convertNumber('100111', 2, 16) // "27"
+ * convertNumber('23432', 8, 16) // "271a"
+ * convertNumber('23432', 10, 16) // "5b88"
+ * convertNumber('23432', 10, 8) //"55610"
+ * convertNumber('23432', 16, 2) // "100011010000110010"
+ * @param {*} n
+ * @param {*} fromBase
+ * @param {*} toBase
+ */
+function convertNumber(n, fromBase, toBase) {
+  if (fromBase === void 0) {
+    fromBase = 10;
+  }
+  if (toBase === void 0) {
+    toBase = 10;
+  }
+  return parseInt(n.toString(), fromBase).toString(toBase);
+}

lib/isMethod.js

@@ -44,10 +44,15 @@ export function isPrime(num) {
  * palindromeNumber(4567654); // true
  */
 
-exports.isPalindrome = (number) => {
-  var final = 0, temp = number;
-  while(number>0) { var rem = number % 10; number = parseInt(number / 10);
-      final = (final * 10) + rem; } return final == temp;
+export function isPalindrome(number) {
+  var final = 0,
+    temp = number;
+  while (number > 0) {
+    var rem = number % 10;
+    number = parseInt(number / 10);
+    final = final * 10 + rem;
+  }
+  return final == temp;
 }
 
 /**
@@ -56,7 +61,7 @@ exports.isPalindrome = (number) => {
  * isPositive(45674); // true
  * isPositive(-4567654); // false
  */
-exports.isPositive = (number) => {
+export function isPositive(number) {
   if (number === 0) return false;
   return ((number >> 31) & 1) === 0;
 }
@@ -67,7 +72,7 @@ exports.isPositive = (number) => {
  * isNegative(45674); // false
  * isNegative(-4567654); // true
  */
-exports.isNegative = (number) => {
+export function isNegative(number) {
   if (number === 0) return false;
   return ((number >> 31) & 1) === 1;
 }
@@ -78,7 +83,7 @@ exports.isNegative = (number) => {
  * isPowerOfTwo(35); // false
  * isPowerOfTwo(32); // true
  */
-exports.isPowerOfTwo = (number) => {
+export function isPowerOfTwo(number) {
   if (number < 1) return false;
   return (number & (number - 1)) === 0;
-}
+}

lib/number.js

@@ -55,7 +55,7 @@ let factorialCalculate = (number) => {
  * Pass a base number, power number and calculate the power of the number
  * @param {*} number
  */
-exports.bigPower = (base, power) => {
+export function bigPower(base, power) {
   if (power === 0) return 1;
   if (power % 2 === 0) {
     const multiplier = bigPower(base, power / 2);
@@ -71,8 +71,10 @@ exports.bigPower = (base, power) => {
  * @return {number[]}
  * console.log(fibSequence(10)) // [ 1, 1, 2, 3, 5, 8, 13, 21, 34, 55 ]
  */
-exports.fibSequence = (number) => {
-  let fibSeq = [1], currentValue = 1, previousValue = 0;
+export function fibSequence(number) {
+  let fibSeq = [1],
+    currentValue = 1,
+    previousValue = 0;
   if (number === 1) return fibSeq;
   let iterationsCounter = number - 1;
   while (iterationsCounter) {
@@ -90,8 +92,9 @@ exports.fibSequence = (number) => {
  * @return {number}
  * console.log(fibonacciNth(10)) // 55
  */
-exports.fibNth = (number) => {
-  let currentValue = 1, previousValue = 0;
+export function fibNth(number) {
+  let currentValue = 1,
+    previousValue = 0;
   if (number === 1) return 1;
   let iterationsCounter = number - 1;
   while (iterationsCounter) {
@@ -106,13 +109,15 @@ exports.fibNth = (number) => {
  * Get pascal Triangle
  * @param {number} lineNumber - zero based.
  * @return {number[]}
- * console.log(pascalTriangle(10)) 
+ * console.log(pascalTriangle(10))
  * [ 1, 10, 45, 120, 210, 252, 210, 120, 45, 10, 1 ]
  */
-exports.pascalTriangle = (lineNumber) => {
-  let currentLine = [1], currentLineSize = lineNumber + 1;
+export function pascalTriangle(lineNumber) {
+  let currentLine = [1],
+    currentLineSize = lineNumber + 1;
   for (let numIndex = 1; numIndex < currentLineSize; numIndex += 1) {
-    currentLine[numIndex] = currentLine[numIndex - 1] * (lineNumber - numIndex + 1) / numIndex;
+    currentLine[numIndex] =
+      (currentLine[numIndex - 1] * (lineNumber - numIndex + 1)) / numIndex;
   }
   return currentLine;
 }
@@ -123,13 +128,14 @@ exports.pascalTriangle = (lineNumber) => {
  * @return {primes[]}
  * console.log(getPrimeList(20)) // [ 2, 3, 5, 7, 11, 13, 17, 19 ]
  */
-exports.getPrimeList = (number) => {
-  let isPrime = new Array(number + 1).fill(true), primes = [];
+export function getPrimeList(number) {
+  let isPrime = new Array(number + 1).fill(true),
+    primes = [];
   isPrime[0] = false;
   isPrime[1] = false;
   for (let num = 2; num <= number; num += 1) {
     if (isPrime[num] === true) {
-      primes.push(num);    
+      primes.push(num);
       let nextnum = num * num;
       while (nextnum <= number) {
         isPrime[nextnum] = false;
@@ -139,3 +145,25 @@ exports.getPrimeList = (number) => {
   }
   return primes;
 }
+
+/**
+ * Pass minimum and maximum number to generate the random number between them
+ * randomNumber(3, 10) // 10
+ * randomNumber(3, 10) // 8
+ * @param {*} min
+ * @param {*} max
+ */
+export function randomNumber(min, max) {
+  return Math.floor(Math.random() * (max - min + 1)) + min;
+}
+
+/**
+ * Pass a number and get the reverse of that number with actual sign
+ * reverseNumber(32) // 23
+ * reverseNumber(-32) // -23
+ * @param {*} number
+ */
+export function reverseNumber(number) {
+  let reversed = number.toString().split("").reverse().join("");
+  return parseInt(reversed) * Math.sign(number);
+}