bson 4.6.4 → 4.6.5
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/bower.json +1 -1
- package/bson.d.ts +8 -1
- package/dist/bson.browser.esm.js +95 -143
- package/dist/bson.browser.esm.js.map +1 -1
- package/dist/bson.browser.umd.js +95 -143
- package/dist/bson.browser.umd.js.map +1 -1
- package/dist/bson.bundle.js +95 -143
- package/dist/bson.bundle.js.map +1 -1
- package/dist/bson.esm.js +92 -143
- package/dist/bson.esm.js.map +1 -1
- package/lib/binary.js +13 -6
- package/lib/binary.js.map +1 -1
- package/lib/bson.js +19 -6
- package/lib/bson.js.map +1 -1
- package/lib/code.js +1 -1
- package/lib/code.js.map +1 -1
- package/lib/db_ref.js +2 -2
- package/lib/db_ref.js.map +1 -1
- package/lib/decimal128.js +13 -13
- package/lib/decimal128.js.map +1 -1
- package/lib/double.js +2 -2
- package/lib/double.js.map +1 -1
- package/lib/ensure_buffer.js +1 -1
- package/lib/ensure_buffer.js.map +1 -1
- package/lib/extended_json.js +24 -12
- package/lib/extended_json.js.map +1 -1
- package/lib/int_32.js +1 -1
- package/lib/int_32.js.map +1 -1
- package/lib/long.js +3 -3
- package/lib/long.js.map +1 -1
- package/lib/map.js +1 -1
- package/lib/map.js.map +1 -1
- package/lib/objectid.js +8 -8
- package/lib/objectid.js.map +1 -1
- package/lib/parser/calculate_size.js +10 -9
- package/lib/parser/calculate_size.js.map +1 -1
- package/lib/parser/deserializer.js +13 -10
- package/lib/parser/deserializer.js.map +1 -1
- package/lib/parser/serializer.js +25 -22
- package/lib/parser/serializer.js.map +1 -1
- package/lib/parser/utils.js +23 -19
- package/lib/parser/utils.js.map +1 -1
- package/lib/regexp.js +4 -4
- package/lib/regexp.js.map +1 -1
- package/lib/symbol.js +1 -1
- package/lib/symbol.js.map +1 -1
- package/lib/timestamp.js +3 -3
- package/lib/timestamp.js.map +1 -1
- package/lib/utils/global.js +1 -1
- package/lib/utils/global.js.map +1 -1
- package/lib/uuid.js +9 -9
- package/lib/uuid.js.map +1 -1
- package/lib/uuid_utils.js +1 -1
- package/lib/uuid_utils.js.map +1 -1
- package/package.json +16 -24
- package/src/binary.ts +7 -0
- package/src/code.ts +1 -1
- package/src/db_ref.ts +1 -1
- package/src/decimal128.ts +3 -3
- package/src/extended_json.ts +13 -2
- package/src/long.ts +32 -7
- package/src/objectid.ts +1 -1
- package/src/parser/calculate_size.ts +4 -3
- package/src/parser/deserializer.ts +6 -3
- package/src/parser/serializer.ts +14 -7
- package/src/parser/utils.ts +24 -20
- package/src/timestamp.ts +1 -1
- package/src/utils/global.ts +1 -1
- package/src/uuid.ts +1 -1
- package/bson-ts34.d.ts +0 -1133
- package/lib/float_parser.js +0 -137
- package/lib/float_parser.js.map +0 -1
- package/src/float_parser.ts +0 -152
package/lib/float_parser.js
DELETED
|
@@ -1,137 +0,0 @@
|
|
|
1
|
-
"use strict";
|
|
2
|
-
// Copyright (c) 2008, Fair Oaks Labs, Inc.
|
|
3
|
-
// All rights reserved.
|
|
4
|
-
//
|
|
5
|
-
// Redistribution and use in source and binary forms, with or without
|
|
6
|
-
// modification, are permitted provided that the following conditions are met:
|
|
7
|
-
//
|
|
8
|
-
// * Redistributions of source code must retain the above copyright notice,
|
|
9
|
-
// this list of conditions and the following disclaimer.
|
|
10
|
-
//
|
|
11
|
-
// * Redistributions in binary form must reproduce the above copyright notice,
|
|
12
|
-
// this list of conditions and the following disclaimer in the documentation
|
|
13
|
-
// and/or other materials provided with the distribution.
|
|
14
|
-
//
|
|
15
|
-
// * Neither the name of Fair Oaks Labs, Inc. nor the names of its contributors
|
|
16
|
-
// may be used to endorse or promote products derived from this software
|
|
17
|
-
// without specific prior written permission.
|
|
18
|
-
//
|
|
19
|
-
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
20
|
-
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
21
|
-
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
22
|
-
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
23
|
-
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
24
|
-
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
25
|
-
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
26
|
-
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
27
|
-
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
28
|
-
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
29
|
-
// POSSIBILITY OF SUCH DAMAGE.
|
|
30
|
-
//
|
|
31
|
-
//
|
|
32
|
-
// Modifications to writeIEEE754 to support negative zeroes made by Brian White
|
|
33
|
-
Object.defineProperty(exports, "__esModule", { value: true });
|
|
34
|
-
exports.writeIEEE754 = exports.readIEEE754 = void 0;
|
|
35
|
-
function readIEEE754(buffer, offset, endian, mLen, nBytes) {
|
|
36
|
-
var e;
|
|
37
|
-
var m;
|
|
38
|
-
var bBE = endian === 'big';
|
|
39
|
-
var eLen = nBytes * 8 - mLen - 1;
|
|
40
|
-
var eMax = (1 << eLen) - 1;
|
|
41
|
-
var eBias = eMax >> 1;
|
|
42
|
-
var nBits = -7;
|
|
43
|
-
var i = bBE ? 0 : nBytes - 1;
|
|
44
|
-
var d = bBE ? 1 : -1;
|
|
45
|
-
var s = buffer[offset + i];
|
|
46
|
-
i += d;
|
|
47
|
-
e = s & ((1 << -nBits) - 1);
|
|
48
|
-
s >>= -nBits;
|
|
49
|
-
nBits += eLen;
|
|
50
|
-
for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8)
|
|
51
|
-
;
|
|
52
|
-
m = e & ((1 << -nBits) - 1);
|
|
53
|
-
e >>= -nBits;
|
|
54
|
-
nBits += mLen;
|
|
55
|
-
for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8)
|
|
56
|
-
;
|
|
57
|
-
if (e === 0) {
|
|
58
|
-
e = 1 - eBias;
|
|
59
|
-
}
|
|
60
|
-
else if (e === eMax) {
|
|
61
|
-
return m ? NaN : (s ? -1 : 1) * Infinity;
|
|
62
|
-
}
|
|
63
|
-
else {
|
|
64
|
-
m = m + Math.pow(2, mLen);
|
|
65
|
-
e = e - eBias;
|
|
66
|
-
}
|
|
67
|
-
return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
|
|
68
|
-
}
|
|
69
|
-
exports.readIEEE754 = readIEEE754;
|
|
70
|
-
function writeIEEE754(buffer, value, offset, endian, mLen, nBytes) {
|
|
71
|
-
var e;
|
|
72
|
-
var m;
|
|
73
|
-
var c;
|
|
74
|
-
var bBE = endian === 'big';
|
|
75
|
-
var eLen = nBytes * 8 - mLen - 1;
|
|
76
|
-
var eMax = (1 << eLen) - 1;
|
|
77
|
-
var eBias = eMax >> 1;
|
|
78
|
-
var rt = mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
|
|
79
|
-
var i = bBE ? nBytes - 1 : 0;
|
|
80
|
-
var d = bBE ? -1 : 1;
|
|
81
|
-
var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
|
|
82
|
-
value = Math.abs(value);
|
|
83
|
-
if (isNaN(value) || value === Infinity) {
|
|
84
|
-
m = isNaN(value) ? 1 : 0;
|
|
85
|
-
e = eMax;
|
|
86
|
-
}
|
|
87
|
-
else {
|
|
88
|
-
e = Math.floor(Math.log(value) / Math.LN2);
|
|
89
|
-
if (value * (c = Math.pow(2, -e)) < 1) {
|
|
90
|
-
e--;
|
|
91
|
-
c *= 2;
|
|
92
|
-
}
|
|
93
|
-
if (e + eBias >= 1) {
|
|
94
|
-
value += rt / c;
|
|
95
|
-
}
|
|
96
|
-
else {
|
|
97
|
-
value += rt * Math.pow(2, 1 - eBias);
|
|
98
|
-
}
|
|
99
|
-
if (value * c >= 2) {
|
|
100
|
-
e++;
|
|
101
|
-
c /= 2;
|
|
102
|
-
}
|
|
103
|
-
if (e + eBias >= eMax) {
|
|
104
|
-
m = 0;
|
|
105
|
-
e = eMax;
|
|
106
|
-
}
|
|
107
|
-
else if (e + eBias >= 1) {
|
|
108
|
-
m = (value * c - 1) * Math.pow(2, mLen);
|
|
109
|
-
e = e + eBias;
|
|
110
|
-
}
|
|
111
|
-
else {
|
|
112
|
-
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
|
|
113
|
-
e = 0;
|
|
114
|
-
}
|
|
115
|
-
}
|
|
116
|
-
if (isNaN(value))
|
|
117
|
-
m = 0;
|
|
118
|
-
while (mLen >= 8) {
|
|
119
|
-
buffer[offset + i] = m & 0xff;
|
|
120
|
-
i += d;
|
|
121
|
-
m /= 256;
|
|
122
|
-
mLen -= 8;
|
|
123
|
-
}
|
|
124
|
-
e = (e << mLen) | m;
|
|
125
|
-
if (isNaN(value))
|
|
126
|
-
e += 8;
|
|
127
|
-
eLen += mLen;
|
|
128
|
-
while (eLen > 0) {
|
|
129
|
-
buffer[offset + i] = e & 0xff;
|
|
130
|
-
i += d;
|
|
131
|
-
e /= 256;
|
|
132
|
-
eLen -= 8;
|
|
133
|
-
}
|
|
134
|
-
buffer[offset + i - d] |= s * 128;
|
|
135
|
-
}
|
|
136
|
-
exports.writeIEEE754 = writeIEEE754;
|
|
137
|
-
//# sourceMappingURL=float_parser.js.map
|
package/lib/float_parser.js.map
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
{"version":3,"file":"float_parser.js","sourceRoot":"","sources":["../src/float_parser.ts"],"names":[],"mappings":";AAAA,2CAA2C;AAC3C,uBAAuB;AACvB,EAAE;AACF,qEAAqE;AACrE,8EAA8E;AAC9E,EAAE;AACF,4EAA4E;AAC5E,2DAA2D;AAC3D,EAAE;AACF,+EAA+E;AAC/E,+EAA+E;AAC/E,4DAA4D;AAC5D,EAAE;AACF,gFAAgF;AAChF,2EAA2E;AAC3E,gDAAgD;AAChD,EAAE;AACF,8EAA8E;AAC9E,4EAA4E;AAC5E,6EAA6E;AAC7E,4EAA4E;AAC5E,sEAAsE;AACtE,uEAAuE;AACvE,2EAA2E;AAC3E,0EAA0E;AAC1E,0EAA0E;AAC1E,6EAA6E;AAC7E,8BAA8B;AAC9B,EAAE;AACF,EAAE;AACF,+EAA+E;;;AAI/E,SAAgB,WAAW,CACzB,MAAyB,EACzB,MAAc,EACd,MAAwB,EACxB,IAAY,EACZ,MAAc;IAEd,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IACd,IAAM,GAAG,GAAG,MAAM,KAAK,KAAK,CAAC;IAC7B,IAAM,IAAI,GAAG,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACnC,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAM,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC;IACxB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC;IACf,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7B,IAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAE3B,CAAC,IAAI,CAAC,CAAC;IAEP,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC,KAAK,CAAC,KAAK,CAAC;IACb,KAAK,IAAI,IAAI,CAAC;IACd,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC;QAAC,CAAC;IAExE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC,KAAK,CAAC,KAAK,CAAC;IACb,KAAK,IAAI,IAAI,CAAC;IACd,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,IAAI,CAAC;QAAC,CAAC;IAExE,IAAI,CAAC,KAAK,CAAC,EAAE;QACX,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;KACf;SAAM,IAAI,CAAC,KAAK,IAAI,EAAE;QACrB,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;KAC1C;SAAM;QACL,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC1B,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;KACf;IACD,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;AAClD,CAAC;AAvCD,kCAuCC;AAED,SAAgB,YAAY,CAC1B,MAAyB,EACzB,KAAa,EACb,MAAc,EACd,MAAwB,EACxB,IAAY,EACZ,MAAc;IAEd,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IACd,IAAI,CAAS,CAAC;IACd,IAAM,GAAG,GAAG,MAAM,KAAK,KAAK,CAAC;IAC7B,IAAI,IAAI,GAAG,MAAM,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;IACjC,IAAM,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAM,KAAK,GAAG,IAAI,IAAI,CAAC,CAAC;IACxB,IAAM,EAAE,GAAG,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,IAAM,CAAC,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE9D,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAExB,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,KAAK,QAAQ,EAAE;QACtC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACzB,CAAC,GAAG,IAAI,CAAC;KACV;SAAM;QACL,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3C,IAAI,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;YACrC,CAAC,EAAE,CAAC;YACJ,CAAC,IAAI,CAAC,CAAC;SACR;QACD,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,EAAE;YAClB,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC;SACjB;aAAM;YACL,KAAK,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC;SACtC;QACD,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,EAAE;YAClB,CAAC,EAAE,CAAC;YACJ,CAAC,IAAI,CAAC,CAAC;SACR;QAED,IAAI,CAAC,GAAG,KAAK,IAAI,IAAI,EAAE;YACrB,CAAC,GAAG,CAAC,CAAC;YACN,CAAC,GAAG,IAAI,CAAC;SACV;aAAM,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,EAAE;YACzB,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;SACf;aAAM;YACL,CAAC,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACvD,CAAC,GAAG,CAAC,CAAC;SACP;KACF;IAED,IAAI,KAAK,CAAC,KAAK,CAAC;QAAE,CAAC,GAAG,CAAC,CAAC;IAExB,OAAO,IAAI,IAAI,CAAC,EAAE;QAChB,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QAC9B,CAAC,IAAI,CAAC,CAAC;QACP,CAAC,IAAI,GAAG,CAAC;QACT,IAAI,IAAI,CAAC,CAAC;KACX;IAED,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;IAEpB,IAAI,KAAK,CAAC,KAAK,CAAC;QAAE,CAAC,IAAI,CAAC,CAAC;IAEzB,IAAI,IAAI,IAAI,CAAC;IAEb,OAAO,IAAI,GAAG,CAAC,EAAE;QACf,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;QAC9B,CAAC,IAAI,CAAC,CAAC;QACP,CAAC,IAAI,GAAG,CAAC;QACT,IAAI,IAAI,CAAC,CAAC;KACX;IAED,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;AACpC,CAAC;AA5ED,oCA4EC"}
|
package/src/float_parser.ts
DELETED
|
@@ -1,152 +0,0 @@
|
|
|
1
|
-
// Copyright (c) 2008, Fair Oaks Labs, Inc.
|
|
2
|
-
// All rights reserved.
|
|
3
|
-
//
|
|
4
|
-
// Redistribution and use in source and binary forms, with or without
|
|
5
|
-
// modification, are permitted provided that the following conditions are met:
|
|
6
|
-
//
|
|
7
|
-
// * Redistributions of source code must retain the above copyright notice,
|
|
8
|
-
// this list of conditions and the following disclaimer.
|
|
9
|
-
//
|
|
10
|
-
// * Redistributions in binary form must reproduce the above copyright notice,
|
|
11
|
-
// this list of conditions and the following disclaimer in the documentation
|
|
12
|
-
// and/or other materials provided with the distribution.
|
|
13
|
-
//
|
|
14
|
-
// * Neither the name of Fair Oaks Labs, Inc. nor the names of its contributors
|
|
15
|
-
// may be used to endorse or promote products derived from this software
|
|
16
|
-
// without specific prior written permission.
|
|
17
|
-
//
|
|
18
|
-
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
19
|
-
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
20
|
-
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
21
|
-
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
22
|
-
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
23
|
-
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
24
|
-
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
25
|
-
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
26
|
-
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
27
|
-
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
28
|
-
// POSSIBILITY OF SUCH DAMAGE.
|
|
29
|
-
//
|
|
30
|
-
//
|
|
31
|
-
// Modifications to writeIEEE754 to support negative zeroes made by Brian White
|
|
32
|
-
|
|
33
|
-
type NumericalSequence = { [index: number]: number };
|
|
34
|
-
|
|
35
|
-
export function readIEEE754(
|
|
36
|
-
buffer: NumericalSequence,
|
|
37
|
-
offset: number,
|
|
38
|
-
endian: 'big' | 'little',
|
|
39
|
-
mLen: number,
|
|
40
|
-
nBytes: number
|
|
41
|
-
): number {
|
|
42
|
-
let e: number;
|
|
43
|
-
let m: number;
|
|
44
|
-
const bBE = endian === 'big';
|
|
45
|
-
const eLen = nBytes * 8 - mLen - 1;
|
|
46
|
-
const eMax = (1 << eLen) - 1;
|
|
47
|
-
const eBias = eMax >> 1;
|
|
48
|
-
let nBits = -7;
|
|
49
|
-
let i = bBE ? 0 : nBytes - 1;
|
|
50
|
-
const d = bBE ? 1 : -1;
|
|
51
|
-
let s = buffer[offset + i];
|
|
52
|
-
|
|
53
|
-
i += d;
|
|
54
|
-
|
|
55
|
-
e = s & ((1 << -nBits) - 1);
|
|
56
|
-
s >>= -nBits;
|
|
57
|
-
nBits += eLen;
|
|
58
|
-
for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8);
|
|
59
|
-
|
|
60
|
-
m = e & ((1 << -nBits) - 1);
|
|
61
|
-
e >>= -nBits;
|
|
62
|
-
nBits += mLen;
|
|
63
|
-
for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8);
|
|
64
|
-
|
|
65
|
-
if (e === 0) {
|
|
66
|
-
e = 1 - eBias;
|
|
67
|
-
} else if (e === eMax) {
|
|
68
|
-
return m ? NaN : (s ? -1 : 1) * Infinity;
|
|
69
|
-
} else {
|
|
70
|
-
m = m + Math.pow(2, mLen);
|
|
71
|
-
e = e - eBias;
|
|
72
|
-
}
|
|
73
|
-
return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
|
|
74
|
-
}
|
|
75
|
-
|
|
76
|
-
export function writeIEEE754(
|
|
77
|
-
buffer: NumericalSequence,
|
|
78
|
-
value: number,
|
|
79
|
-
offset: number,
|
|
80
|
-
endian: 'big' | 'little',
|
|
81
|
-
mLen: number,
|
|
82
|
-
nBytes: number
|
|
83
|
-
): void {
|
|
84
|
-
let e: number;
|
|
85
|
-
let m: number;
|
|
86
|
-
let c: number;
|
|
87
|
-
const bBE = endian === 'big';
|
|
88
|
-
let eLen = nBytes * 8 - mLen - 1;
|
|
89
|
-
const eMax = (1 << eLen) - 1;
|
|
90
|
-
const eBias = eMax >> 1;
|
|
91
|
-
const rt = mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
|
|
92
|
-
let i = bBE ? nBytes - 1 : 0;
|
|
93
|
-
const d = bBE ? -1 : 1;
|
|
94
|
-
const s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
|
|
95
|
-
|
|
96
|
-
value = Math.abs(value);
|
|
97
|
-
|
|
98
|
-
if (isNaN(value) || value === Infinity) {
|
|
99
|
-
m = isNaN(value) ? 1 : 0;
|
|
100
|
-
e = eMax;
|
|
101
|
-
} else {
|
|
102
|
-
e = Math.floor(Math.log(value) / Math.LN2);
|
|
103
|
-
if (value * (c = Math.pow(2, -e)) < 1) {
|
|
104
|
-
e--;
|
|
105
|
-
c *= 2;
|
|
106
|
-
}
|
|
107
|
-
if (e + eBias >= 1) {
|
|
108
|
-
value += rt / c;
|
|
109
|
-
} else {
|
|
110
|
-
value += rt * Math.pow(2, 1 - eBias);
|
|
111
|
-
}
|
|
112
|
-
if (value * c >= 2) {
|
|
113
|
-
e++;
|
|
114
|
-
c /= 2;
|
|
115
|
-
}
|
|
116
|
-
|
|
117
|
-
if (e + eBias >= eMax) {
|
|
118
|
-
m = 0;
|
|
119
|
-
e = eMax;
|
|
120
|
-
} else if (e + eBias >= 1) {
|
|
121
|
-
m = (value * c - 1) * Math.pow(2, mLen);
|
|
122
|
-
e = e + eBias;
|
|
123
|
-
} else {
|
|
124
|
-
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
|
|
125
|
-
e = 0;
|
|
126
|
-
}
|
|
127
|
-
}
|
|
128
|
-
|
|
129
|
-
if (isNaN(value)) m = 0;
|
|
130
|
-
|
|
131
|
-
while (mLen >= 8) {
|
|
132
|
-
buffer[offset + i] = m & 0xff;
|
|
133
|
-
i += d;
|
|
134
|
-
m /= 256;
|
|
135
|
-
mLen -= 8;
|
|
136
|
-
}
|
|
137
|
-
|
|
138
|
-
e = (e << mLen) | m;
|
|
139
|
-
|
|
140
|
-
if (isNaN(value)) e += 8;
|
|
141
|
-
|
|
142
|
-
eLen += mLen;
|
|
143
|
-
|
|
144
|
-
while (eLen > 0) {
|
|
145
|
-
buffer[offset + i] = e & 0xff;
|
|
146
|
-
i += d;
|
|
147
|
-
e /= 256;
|
|
148
|
-
eLen -= 8;
|
|
149
|
-
}
|
|
150
|
-
|
|
151
|
-
buffer[offset + i - d] |= s * 128;
|
|
152
|
-
}
|