Scribd
Upload
49 views2 pages

Number Prototype Enhancements

The document defines several enhancements to the Number and Array prototypes in JavaScript. It includes methods for number normalization, bit manipulation, formatting, and array element searching. These enhancements provide additional functionality for numerical operations and array handling.

Uploaded by

vanek198804
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
49 views2 pages

Number Prototype Enhancements

The document defines several enhancements to the Number and Array prototypes in JavaScript. It includes methods for number normalization, bit manipulation, formatting, and array element searching. These enhancements provide additional functionality for numerical operations and array handling.

Uploaded by

vanek198804
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

(function() {

var w = [Link];
[Link] = 2147483647;
[Link] = 4294967295;
Number.G = 1.7976931348623157E308;
var J = [1, 10, 100, 1E3, 1E4, 1E5, 1E6, 1E7, 1E8];
[Link] = function(q) {
0 > q && (q = 0);
8 < q && (q = 8);
q = J[q];
return 0 <= this ? [Link](this * q + .5000001) / q : [Link](this * q
- .5000001) / q
}
;
[Link].G = function(q) {
var k = this;
return q ? k | 1 : k & -2
}
;
[Link] = function(q) {
return !!(this & q)
}
;
[Link] = function() {
return this.G(![Link](1))
}
;
[Link] = function(q) {
q = (isFinite(this) ? this : 0).toFixed(q).split(".");
q[0] = q[0].replace(/(\d)(?=(\d\d\d)+([^\d]|$))/g, "$1" + [Link]);
return [Link](".")
}
;
[Link] = function() {
return 10 > this ? "0" + this : [Link]()
}
;
[Link] = function(q) {
if (void 0 === q || 1 > q)
return [Link](this).toString();
var k = [Link](8).split(".");
if (1 == [Link]) {
k[1] = "";
for (var C = 0; C < q; C++)
k[1] += "0"
} else if (k[1].length > q)
k[1] = k[1].substr(0, q);
else
for (; k[1].length < q; )
k[1] += "0";
return [Link](".")
}
}
)();
[Link].G || ([Link].G = function(w, J) {
if (null == this)
throw new TypeError("[Link] called on null or undefined");
if ("function" !== typeof w)
throw new TypeError("predicate must be a function");
for (var q = Object(this), k = [Link] >>> 0, C, g = 0; g < k; g++)
if (C = q[g],
[Link](J, C, g, q))
return C
}
);

You might also like