fix: standard style issues

Author: raklaptudirm

Conversions/BinaryToHex.js

@@ -1,5 +1,5 @@
 const pad = (num, padlen) => {
- var pad = new Array(1 + padlen).join(0)
+ const pad = new Array(1 + padlen).join(0)
  return (pad + num).slice(-pad.length)
 }
 

Conversions/DecimalToRoman.js

@@ -40,7 +40,7 @@ const orders = [
 
 function decimalToRoman (num) {
  let roman = ''
- for (var symbol of orders) {
+ for (const symbol of orders) {
  while (num >= values[symbol]) {
  roman += symbol
  num -= values[symbol]

Conversions/HexToDecimal.js

@@ -1,18 +1,16 @@
 function hexToInt (hexNum) {
  const numArr = hexNum.split('') // converts number to array
- numArr.map((item, index) => {
- if (!(item > 0)) {
- switch (item) {
- case 'A': return (numArr[index] = 10)
- case 'B': return (numArr[index] = 11)
- case 'C': return (numArr[index] = 12)
- case 'D': return (numArr[index] = 13)
- case 'E': return (numArr[index] = 14)
- case 'F': return (numArr[index] = 15)
- }
- } else numArr[index] = parseInt(item)
+ return numArr.map((item, index) => {
+ switch (item) {
+ case 'A': return 10
+ case 'B': return 11
+ case 'C': return 12
+ case 'D': return 13
+ case 'E': return 14
+ case 'F': return 15
+ default: return parseInt(item)
+ }
  })
- return numArr // returns an array only with integer numbers
 }
 
 function hexToDecimal (hexNum) {
@@ -23,9 +21,3 @@ function hexToDecimal (hexNum) {
 }
 
 export { hexToInt, hexToDecimal }
-
-// > hexToDecimal('5DE9A'))
-// 384666
-
-// > hexToDecimal('3D'))
-// 61

Data-Structures/Queue/CircularQueue.js

@@ -33,9 +33,7 @@ class CircularQueue {
  }
  const y = this.queue[this.front]
  this.queue[this.front] = '*'
- if (this.checkSingleelement()) {
-
- } else {
+ if (!this.checkSingleelement()) {
  if (this.front === this.maxLength) this.front = 1
  else {
  this.front += 1

Maths/ExtendedEuclideanGCD.js

@@ -2,19 +2,19 @@
  * Problem statement and explanation: https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm
  *
  * This algorithm plays an important role for modular arithmetic, and by extension for cyptography algorithms
- * 
+ *
  * Basic explanation:
  * The Extended Euclidean algorithm is a modification of the standard Euclidean GCD algorithm.
  * It allows to calculate coefficients x and y for the equation:
  * ax + by = gcd(a,b)
- * 
+ *
  * This is called Bézout's identity and the coefficients are called Bézout coefficients
- * 
+ *
  * The algorithm uses the Euclidean method of getting remainder:
  * r_i+1 = r_i-1 - qi*ri
  * and applies it to series s and t (with same quotient q at each stage)
  * When r_n reaches 0, the value r_n-1 gives the gcd, and s_n-1 and t_n-1 give the coefficients
- * 
+ *
  * This implementation uses an iterative approach to calculate the values
  */
 

Project-Euler/Problem007.js

@@ -26,7 +26,7 @@
  * @param {number} endIndex The end of the subarray
  * @returns The flipped array
  */
-export function flipArray(array, startIndex, endIndex) {
+export function flipArray (array, startIndex, endIndex) {
  while (startIndex < endIndex) {
  // swap front and back of the subarray
  const temp = array[startIndex]
@@ -49,7 +49,7 @@ export function flipArray(array, startIndex, endIndex) {
  * @param {*} endIndex The end of the subarray
  * @returns The index of the maximum number
  */
-export function findMax(array, startIndex, endIndex) {
+export function findMax (array, startIndex, endIndex) {
  let maxIndex = 0
  for (let i = startIndex; i <= endIndex; i++) {
  if (array[i] > array[maxIndex]) maxIndex = i
@@ -67,7 +67,7 @@ export function findMax(array, startIndex, endIndex) {
  * @param {number[]} array The array to sort
  * @returns The sorted array
  */
-export function pancakeSort(array) {
+export function pancakeSort (array) {
  for (let subarraySize = array.length; subarraySize > 1; subarraySize--) {
  const maximumIndex = findMax(array, 0, subarraySize - 1)