forked from javascript-obfuscator/javascript-obfuscator
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNumberUtils.ts
More file actions
109 lines (88 loc) · 2.63 KB
/
Copy pathNumberUtils.ts
File metadata and controls
109 lines (88 loc) · 2.63 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
import { Utils } from './Utils';
export class NumberUtils {
/**
* @param {number} number
* @returns {string}
*/
public static toHex (number: number | bigint): string {
const radix: number = 16;
const basePart: string = typeof number === 'number'
? number.toString(radix)
: `${number.toString(radix)}n`;
return `${Utils.hexadecimalPrefix}${basePart}`;
}
/**
* @param {number} number
* @returns {boolean}
*/
public static isCeil (number: number | bigint): boolean {
return typeof number === 'number'
? number % 1 === 0
: true;
}
/**
* @param {number} number
* @returns {boolean}
*/
public static isPositive (number: number): boolean {
if (isNaN(number)) {
throw new Error('Given value is NaN');
}
if (number > 0) {
return true;
}
if (number < 0) {
return false;
}
if (1 / number === Number.POSITIVE_INFINITY) {
return true;
}
return false;
}
/**
* @param {number} number
* @returns {boolean}
*/
public static isUnsafeNumber (number: number): boolean {
if (isNaN(number)) {
throw new Error('Given value is NaN');
}
return number < Number.MIN_SAFE_INTEGER || number > Number.MAX_SAFE_INTEGER;
}
/**
* Returns all factors of a number
* Based on https://stackoverflow.com/a/43204663
*
* @param {number} number
* @returns {number[]}
*/
public static getFactors (number: number): number[] {
if (number === 0) {
throw new Error('Invalid number. Allowed only non-zero number');
}
number = Math.abs(number);
// special case for 1
if (number === 1) {
return [-number, number];
}
const factors: number[] = [];
const root: number = Math.sqrt(number);
const isEven: boolean = number % 2 === 0;
const incrementValue: number = isEven ? 1 : 2;
for (
let currentFactor = 1;
currentFactor <= root;
currentFactor += incrementValue
) {
if (number % currentFactor !== 0) {
continue;
}
factors.push(...[-currentFactor, currentFactor]);
const compliment: number = number / currentFactor;
if (compliment !== currentFactor) {
factors.push(...[-compliment, compliment]);
}
}
return factors.sort((a: number, b: number) => a - b);
}
}