initial commit
This commit is contained in:
117
node_modules/unenv/runtime/node/buffer/_base64.cjs
generated
vendored
Normal file
117
node_modules/unenv/runtime/node/buffer/_base64.cjs
generated
vendored
Normal file
@@ -0,0 +1,117 @@
|
||||
"use strict";
|
||||
|
||||
Object.defineProperty(exports, "__esModule", {
|
||||
value: true
|
||||
});
|
||||
exports.byteLength = byteLength;
|
||||
exports.fromByteArray = fromByteArray;
|
||||
exports.toByteArray = toByteArray;
|
||||
const lookup = [];
|
||||
const revLookup = [];
|
||||
const Arr = typeof Uint8Array !== "undefined" ? Uint8Array : Array;
|
||||
const code = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
||||
|
||||
for (let i = 0, len = code.length; i < len; ++i) {
|
||||
lookup[i] = code[i];
|
||||
revLookup[code.charCodeAt(i)] = i;
|
||||
}
|
||||
|
||||
revLookup["-".charCodeAt(0)] = 62;
|
||||
revLookup["_".charCodeAt(0)] = 63;
|
||||
|
||||
function getLens(b64) {
|
||||
const len = b64.length;
|
||||
|
||||
if (len % 4 > 0) {
|
||||
throw new Error("Invalid string. Length must be a multiple of 4");
|
||||
}
|
||||
|
||||
let validLen = b64.indexOf("=");
|
||||
|
||||
if (validLen === -1) {
|
||||
validLen = len;
|
||||
}
|
||||
|
||||
const placeHoldersLen = validLen === len ? 0 : 4 - validLen % 4;
|
||||
return [validLen, placeHoldersLen];
|
||||
}
|
||||
|
||||
function byteLength(b64) {
|
||||
const lens = getLens(b64);
|
||||
const validLen = lens[0];
|
||||
const placeHoldersLen = lens[1];
|
||||
return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
|
||||
}
|
||||
|
||||
function _byteLength(b64, validLen, placeHoldersLen) {
|
||||
return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
|
||||
}
|
||||
|
||||
function toByteArray(b64) {
|
||||
let tmp;
|
||||
const lens = getLens(b64);
|
||||
const validLen = lens[0];
|
||||
const placeHoldersLen = lens[1];
|
||||
const arr = new Arr(_byteLength(b64, validLen, placeHoldersLen));
|
||||
let curByte = 0;
|
||||
const len = placeHoldersLen > 0 ? validLen - 4 : validLen;
|
||||
let i;
|
||||
|
||||
for (i = 0; i < len; i += 4) {
|
||||
tmp = revLookup[b64.charCodeAt(i)] << 18 | revLookup[b64.charCodeAt(i + 1)] << 12 | revLookup[b64.charCodeAt(i + 2)] << 6 | revLookup[b64.charCodeAt(i + 3)];
|
||||
arr[curByte++] = tmp >> 16 & 255;
|
||||
arr[curByte++] = tmp >> 8 & 255;
|
||||
arr[curByte++] = tmp & 255;
|
||||
}
|
||||
|
||||
if (placeHoldersLen === 2) {
|
||||
tmp = revLookup[b64.charCodeAt(i)] << 2 | revLookup[b64.charCodeAt(i + 1)] >> 4;
|
||||
arr[curByte++] = tmp & 255;
|
||||
}
|
||||
|
||||
if (placeHoldersLen === 1) {
|
||||
tmp = revLookup[b64.charCodeAt(i)] << 10 | revLookup[b64.charCodeAt(i + 1)] << 4 | revLookup[b64.charCodeAt(i + 2)] >> 2;
|
||||
arr[curByte++] = tmp >> 8 & 255;
|
||||
arr[curByte++] = tmp & 255;
|
||||
}
|
||||
|
||||
return arr;
|
||||
}
|
||||
|
||||
function tripletToBase64(num) {
|
||||
return lookup[num >> 18 & 63] + lookup[num >> 12 & 63] + lookup[num >> 6 & 63] + lookup[num & 63];
|
||||
}
|
||||
|
||||
function encodeChunk(uint8, start, end) {
|
||||
let tmp;
|
||||
const output = [];
|
||||
|
||||
for (let i = start; i < end; i += 3) {
|
||||
tmp = (uint8[i] << 16 & 16711680) + (uint8[i + 1] << 8 & 65280) + (uint8[i + 2] & 255);
|
||||
output.push(tripletToBase64(tmp));
|
||||
}
|
||||
|
||||
return output.join("");
|
||||
}
|
||||
|
||||
function fromByteArray(uint8) {
|
||||
let tmp;
|
||||
const len = uint8.length;
|
||||
const extraBytes = len % 3;
|
||||
const parts = [];
|
||||
const maxChunkLength = 16383;
|
||||
|
||||
for (let i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {
|
||||
parts.push(encodeChunk(uint8, i, i + maxChunkLength > len2 ? len2 : i + maxChunkLength));
|
||||
}
|
||||
|
||||
if (extraBytes === 1) {
|
||||
tmp = uint8[len - 1];
|
||||
parts.push(lookup[tmp >> 2] + lookup[tmp << 4 & 63] + "==");
|
||||
} else if (extraBytes === 2) {
|
||||
tmp = (uint8[len - 2] << 8) + uint8[len - 1];
|
||||
parts.push(lookup[tmp >> 10] + lookup[tmp >> 4 & 63] + lookup[tmp << 2 & 63] + "=");
|
||||
}
|
||||
|
||||
return parts.join("");
|
||||
}
|
||||
3
node_modules/unenv/runtime/node/buffer/_base64.d.ts
generated
vendored
Normal file
3
node_modules/unenv/runtime/node/buffer/_base64.d.ts
generated
vendored
Normal file
@@ -0,0 +1,3 @@
|
||||
export declare function byteLength(b64: any): number;
|
||||
export declare function toByteArray(b64: any): any[] | Uint8Array;
|
||||
export declare function fromByteArray(uint8: any): string;
|
||||
91
node_modules/unenv/runtime/node/buffer/_base64.mjs
generated
vendored
Normal file
91
node_modules/unenv/runtime/node/buffer/_base64.mjs
generated
vendored
Normal file
@@ -0,0 +1,91 @@
|
||||
const lookup = [];
|
||||
const revLookup = [];
|
||||
const Arr = typeof Uint8Array !== "undefined" ? Uint8Array : Array;
|
||||
const code = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
|
||||
for (let i = 0, len = code.length; i < len; ++i) {
|
||||
lookup[i] = code[i];
|
||||
revLookup[code.charCodeAt(i)] = i;
|
||||
}
|
||||
revLookup["-".charCodeAt(0)] = 62;
|
||||
revLookup["_".charCodeAt(0)] = 63;
|
||||
function getLens(b64) {
|
||||
const len = b64.length;
|
||||
if (len % 4 > 0) {
|
||||
throw new Error("Invalid string. Length must be a multiple of 4");
|
||||
}
|
||||
let validLen = b64.indexOf("=");
|
||||
if (validLen === -1) {
|
||||
validLen = len;
|
||||
}
|
||||
const placeHoldersLen = validLen === len ? 0 : 4 - validLen % 4;
|
||||
return [validLen, placeHoldersLen];
|
||||
}
|
||||
export function byteLength(b64) {
|
||||
const lens = getLens(b64);
|
||||
const validLen = lens[0];
|
||||
const placeHoldersLen = lens[1];
|
||||
return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
|
||||
}
|
||||
function _byteLength(b64, validLen, placeHoldersLen) {
|
||||
return (validLen + placeHoldersLen) * 3 / 4 - placeHoldersLen;
|
||||
}
|
||||
export function toByteArray(b64) {
|
||||
let tmp;
|
||||
const lens = getLens(b64);
|
||||
const validLen = lens[0];
|
||||
const placeHoldersLen = lens[1];
|
||||
const arr = new Arr(_byteLength(b64, validLen, placeHoldersLen));
|
||||
let curByte = 0;
|
||||
const len = placeHoldersLen > 0 ? validLen - 4 : validLen;
|
||||
let i;
|
||||
for (i = 0; i < len; i += 4) {
|
||||
tmp = revLookup[b64.charCodeAt(i)] << 18 | revLookup[b64.charCodeAt(i + 1)] << 12 | revLookup[b64.charCodeAt(i + 2)] << 6 | revLookup[b64.charCodeAt(i + 3)];
|
||||
arr[curByte++] = tmp >> 16 & 255;
|
||||
arr[curByte++] = tmp >> 8 & 255;
|
||||
arr[curByte++] = tmp & 255;
|
||||
}
|
||||
if (placeHoldersLen === 2) {
|
||||
tmp = revLookup[b64.charCodeAt(i)] << 2 | revLookup[b64.charCodeAt(i + 1)] >> 4;
|
||||
arr[curByte++] = tmp & 255;
|
||||
}
|
||||
if (placeHoldersLen === 1) {
|
||||
tmp = revLookup[b64.charCodeAt(i)] << 10 | revLookup[b64.charCodeAt(i + 1)] << 4 | revLookup[b64.charCodeAt(i + 2)] >> 2;
|
||||
arr[curByte++] = tmp >> 8 & 255;
|
||||
arr[curByte++] = tmp & 255;
|
||||
}
|
||||
return arr;
|
||||
}
|
||||
function tripletToBase64(num) {
|
||||
return lookup[num >> 18 & 63] + lookup[num >> 12 & 63] + lookup[num >> 6 & 63] + lookup[num & 63];
|
||||
}
|
||||
function encodeChunk(uint8, start, end) {
|
||||
let tmp;
|
||||
const output = [];
|
||||
for (let i = start; i < end; i += 3) {
|
||||
tmp = (uint8[i] << 16 & 16711680) + (uint8[i + 1] << 8 & 65280) + (uint8[i + 2] & 255);
|
||||
output.push(tripletToBase64(tmp));
|
||||
}
|
||||
return output.join("");
|
||||
}
|
||||
export function fromByteArray(uint8) {
|
||||
let tmp;
|
||||
const len = uint8.length;
|
||||
const extraBytes = len % 3;
|
||||
const parts = [];
|
||||
const maxChunkLength = 16383;
|
||||
for (let i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {
|
||||
parts.push(encodeChunk(uint8, i, i + maxChunkLength > len2 ? len2 : i + maxChunkLength));
|
||||
}
|
||||
if (extraBytes === 1) {
|
||||
tmp = uint8[len - 1];
|
||||
parts.push(
|
||||
lookup[tmp >> 2] + lookup[tmp << 4 & 63] + "=="
|
||||
);
|
||||
} else if (extraBytes === 2) {
|
||||
tmp = (uint8[len - 2] << 8) + uint8[len - 1];
|
||||
parts.push(
|
||||
lookup[tmp >> 10] + lookup[tmp >> 4 & 63] + lookup[tmp << 2 & 63] + "="
|
||||
);
|
||||
}
|
||||
return parts.join("");
|
||||
}
|
||||
2249
node_modules/unenv/runtime/node/buffer/_buffer.cjs
generated
vendored
Normal file
2249
node_modules/unenv/runtime/node/buffer/_buffer.cjs
generated
vendored
Normal file
File diff suppressed because it is too large
Load Diff
26
node_modules/unenv/runtime/node/buffer/_buffer.d.ts
generated
vendored
Normal file
26
node_modules/unenv/runtime/node/buffer/_buffer.d.ts
generated
vendored
Normal file
@@ -0,0 +1,26 @@
|
||||
export declare const INSPECT_MAX_BYTES = 50;
|
||||
export declare const kMaxLength = 2147483647;
|
||||
/**
|
||||
* The Buffer constructor returns instances of `Uint8Array` that have their
|
||||
* prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of
|
||||
* `Uint8Array`, so the returned instances will have all the node `Buffer` methods
|
||||
* and the `Uint8Array` methods. Square bracket notation works as expected -- it
|
||||
* returns a single octet.
|
||||
*
|
||||
* The `Uint8Array` prototype remains unmodified.
|
||||
*/
|
||||
export declare function Buffer(arg: any, encodingOrOffset: any, length: any): any;
|
||||
export declare namespace Buffer {
|
||||
var TYPED_ARRAY_SUPPORT: boolean;
|
||||
var poolSize: number;
|
||||
var from: (value: any, encodingOrOffset: any, length: any) => any;
|
||||
var alloc: (size: any, fill: any, encoding: any) => Uint8Array;
|
||||
var allocUnsafe: (size: any) => Uint8Array;
|
||||
var allocUnsafeSlow: (size: any) => Uint8Array;
|
||||
var isBuffer: (b: any) => boolean;
|
||||
var compare: (a: any, b: any) => 0 | 1 | -1;
|
||||
var isEncoding: (encoding: any) => boolean;
|
||||
var concat: (list: any, length: any) => Uint8Array;
|
||||
var byteLength: (string: any, encoding: any) => any;
|
||||
}
|
||||
export declare function SlowBuffer(length: any): Uint8Array;
|
||||
1773
node_modules/unenv/runtime/node/buffer/_buffer.mjs
generated
vendored
Normal file
1773
node_modules/unenv/runtime/node/buffer/_buffer.mjs
generated
vendored
Normal file
File diff suppressed because it is too large
Load Diff
111
node_modules/unenv/runtime/node/buffer/_ieee754.cjs
generated
vendored
Normal file
111
node_modules/unenv/runtime/node/buffer/_ieee754.cjs
generated
vendored
Normal file
@@ -0,0 +1,111 @@
|
||||
"use strict";
|
||||
|
||||
Object.defineProperty(exports, "__esModule", {
|
||||
value: true
|
||||
});
|
||||
exports.read = read;
|
||||
exports.write = write;
|
||||
|
||||
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
|
||||
function read(buffer, offset, isLE, mLen, nBytes) {
|
||||
let e, m;
|
||||
const eLen = nBytes * 8 - mLen - 1;
|
||||
const eMax = (1 << eLen) - 1;
|
||||
const eBias = eMax >> 1;
|
||||
let nBits = -7;
|
||||
let i = isLE ? nBytes - 1 : 0;
|
||||
const d = isLE ? -1 : 1;
|
||||
let s = buffer[offset + i];
|
||||
i += d;
|
||||
e = s & (1 << -nBits) - 1;
|
||||
s >>= -nBits;
|
||||
nBits += eLen;
|
||||
|
||||
while (nBits > 0) {
|
||||
e = e * 256 + buffer[offset + i];
|
||||
i += d;
|
||||
nBits -= 8;
|
||||
}
|
||||
|
||||
m = e & (1 << -nBits) - 1;
|
||||
e >>= -nBits;
|
||||
nBits += mLen;
|
||||
|
||||
while (nBits > 0) {
|
||||
m = m * 256 + buffer[offset + i];
|
||||
i += d;
|
||||
nBits -= 8;
|
||||
}
|
||||
|
||||
if (e === 0) {
|
||||
e = 1 - eBias;
|
||||
} else if (e === eMax) {
|
||||
return m ? Number.NaN : (s ? -1 : 1) * Number.POSITIVE_INFINITY;
|
||||
} else {
|
||||
m = m + Math.pow(2, mLen);
|
||||
e = e - eBias;
|
||||
}
|
||||
|
||||
return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
|
||||
}
|
||||
|
||||
function write(buffer, value, offset, isLE, mLen, nBytes) {
|
||||
let e, m, c;
|
||||
let eLen = nBytes * 8 - mLen - 1;
|
||||
const eMax = (1 << eLen) - 1;
|
||||
const eBias = eMax >> 1;
|
||||
const rt = mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
|
||||
let i = isLE ? 0 : nBytes - 1;
|
||||
const d = isLE ? 1 : -1;
|
||||
const s = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0;
|
||||
value = Math.abs(value);
|
||||
|
||||
if (Number.isNaN(value) || value === Number.POSITIVE_INFINITY) {
|
||||
m = Number.isNaN(value) ? 1 : 0;
|
||||
e = eMax;
|
||||
} else {
|
||||
e = Math.floor(Math.log2(value));
|
||||
|
||||
if (value * (c = Math.pow(2, -e)) < 1) {
|
||||
e--;
|
||||
c *= 2;
|
||||
}
|
||||
|
||||
value += e + eBias >= 1 ? rt / c : rt * Math.pow(2, 1 - eBias);
|
||||
|
||||
if (value * c >= 2) {
|
||||
e++;
|
||||
c /= 2;
|
||||
}
|
||||
|
||||
if (e + eBias >= eMax) {
|
||||
m = 0;
|
||||
e = eMax;
|
||||
} else if (e + eBias >= 1) {
|
||||
m = (value * c - 1) * Math.pow(2, mLen);
|
||||
e = e + eBias;
|
||||
} else {
|
||||
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
|
||||
e = 0;
|
||||
}
|
||||
}
|
||||
|
||||
while (mLen >= 8) {
|
||||
buffer[offset + i] = m & 255;
|
||||
i += d;
|
||||
m /= 256;
|
||||
mLen -= 8;
|
||||
}
|
||||
|
||||
e = e << mLen | m;
|
||||
eLen += mLen;
|
||||
|
||||
while (eLen > 0) {
|
||||
buffer[offset + i] = e & 255;
|
||||
i += d;
|
||||
e /= 256;
|
||||
eLen -= 8;
|
||||
}
|
||||
|
||||
buffer[offset + i - d] |= s * 128;
|
||||
}
|
||||
3
node_modules/unenv/runtime/node/buffer/_ieee754.d.ts
generated
vendored
Normal file
3
node_modules/unenv/runtime/node/buffer/_ieee754.d.ts
generated
vendored
Normal file
@@ -0,0 +1,3 @@
|
||||
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
|
||||
export declare function read(buffer: Uint8Array, offset: number, isLE: boolean, mLen: number, nBytes: number): number;
|
||||
export declare function write(buffer: Uint8Array, value: number, offset: number, isLE: boolean, mLen: number, nBytes: number): void;
|
||||
88
node_modules/unenv/runtime/node/buffer/_ieee754.mjs
generated
vendored
Normal file
88
node_modules/unenv/runtime/node/buffer/_ieee754.mjs
generated
vendored
Normal file
@@ -0,0 +1,88 @@
|
||||
/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
|
||||
export function read(buffer, offset, isLE, mLen, nBytes) {
|
||||
let e, m;
|
||||
const eLen = nBytes * 8 - mLen - 1;
|
||||
const eMax = (1 << eLen) - 1;
|
||||
const eBias = eMax >> 1;
|
||||
let nBits = -7;
|
||||
let i = isLE ? nBytes - 1 : 0;
|
||||
const d = isLE ? -1 : 1;
|
||||
let s = buffer[offset + i];
|
||||
i += d;
|
||||
e = s & (1 << -nBits) - 1;
|
||||
s >>= -nBits;
|
||||
nBits += eLen;
|
||||
while (nBits > 0) {
|
||||
e = e * 256 + buffer[offset + i];
|
||||
i += d;
|
||||
nBits -= 8;
|
||||
}
|
||||
m = e & (1 << -nBits) - 1;
|
||||
e >>= -nBits;
|
||||
nBits += mLen;
|
||||
while (nBits > 0) {
|
||||
m = m * 256 + buffer[offset + i];
|
||||
i += d;
|
||||
nBits -= 8;
|
||||
}
|
||||
if (e === 0) {
|
||||
e = 1 - eBias;
|
||||
} else if (e === eMax) {
|
||||
return m ? Number.NaN : (s ? -1 : 1) * Number.POSITIVE_INFINITY;
|
||||
} else {
|
||||
m = m + Math.pow(2, mLen);
|
||||
e = e - eBias;
|
||||
}
|
||||
return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
|
||||
}
|
||||
export function write(buffer, value, offset, isLE, mLen, nBytes) {
|
||||
let e, m, c;
|
||||
let eLen = nBytes * 8 - mLen - 1;
|
||||
const eMax = (1 << eLen) - 1;
|
||||
const eBias = eMax >> 1;
|
||||
const rt = mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0;
|
||||
let i = isLE ? 0 : nBytes - 1;
|
||||
const d = isLE ? 1 : -1;
|
||||
const s = value < 0 || value === 0 && 1 / value < 0 ? 1 : 0;
|
||||
value = Math.abs(value);
|
||||
if (Number.isNaN(value) || value === Number.POSITIVE_INFINITY) {
|
||||
m = Number.isNaN(value) ? 1 : 0;
|
||||
e = eMax;
|
||||
} else {
|
||||
e = Math.floor(Math.log2(value));
|
||||
if (value * (c = Math.pow(2, -e)) < 1) {
|
||||
e--;
|
||||
c *= 2;
|
||||
}
|
||||
value += e + eBias >= 1 ? rt / c : rt * Math.pow(2, 1 - eBias);
|
||||
if (value * c >= 2) {
|
||||
e++;
|
||||
c /= 2;
|
||||
}
|
||||
if (e + eBias >= eMax) {
|
||||
m = 0;
|
||||
e = eMax;
|
||||
} else if (e + eBias >= 1) {
|
||||
m = (value * c - 1) * Math.pow(2, mLen);
|
||||
e = e + eBias;
|
||||
} else {
|
||||
m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
|
||||
e = 0;
|
||||
}
|
||||
}
|
||||
while (mLen >= 8) {
|
||||
buffer[offset + i] = m & 255;
|
||||
i += d;
|
||||
m /= 256;
|
||||
mLen -= 8;
|
||||
}
|
||||
e = e << mLen | m;
|
||||
eLen += mLen;
|
||||
while (eLen > 0) {
|
||||
buffer[offset + i] = e & 255;
|
||||
i += d;
|
||||
e /= 256;
|
||||
eLen -= 8;
|
||||
}
|
||||
buffer[offset + i - d] |= s * 128;
|
||||
}
|
||||
68
node_modules/unenv/runtime/node/buffer/index.cjs
generated
vendored
Normal file
68
node_modules/unenv/runtime/node/buffer/index.cjs
generated
vendored
Normal file
@@ -0,0 +1,68 @@
|
||||
"use strict";
|
||||
|
||||
Object.defineProperty(exports, "__esModule", {
|
||||
value: true
|
||||
});
|
||||
exports.Blob = void 0;
|
||||
Object.defineProperty(exports, "Buffer", {
|
||||
enumerable: true,
|
||||
get: function () {
|
||||
return _buffer.Buffer;
|
||||
}
|
||||
});
|
||||
Object.defineProperty(exports, "INSPECT_MAX_BYTES", {
|
||||
enumerable: true,
|
||||
get: function () {
|
||||
return _buffer.INSPECT_MAX_BYTES;
|
||||
}
|
||||
});
|
||||
Object.defineProperty(exports, "SlowBuffer", {
|
||||
enumerable: true,
|
||||
get: function () {
|
||||
return _buffer.SlowBuffer;
|
||||
}
|
||||
});
|
||||
module.exports = exports.constants = exports.btoa = exports.atob = void 0;
|
||||
Object.defineProperty(exports, "kMaxLength", {
|
||||
enumerable: true,
|
||||
get: function () {
|
||||
return _buffer.kMaxLength;
|
||||
}
|
||||
});
|
||||
exports.transcode = exports.resolveObjectURL = exports.kStringMaxLength = void 0;
|
||||
|
||||
var _utils = require("../../_internal/utils.cjs");
|
||||
|
||||
var _buffer = require("./_buffer.cjs");
|
||||
|
||||
const Blob = globalThis.Blob;
|
||||
exports.Blob = Blob;
|
||||
const resolveObjectURL = (0, _utils.notImplemented)("buffer.resolveObjectURL");
|
||||
exports.resolveObjectURL = resolveObjectURL;
|
||||
const transcode = (0, _utils.notImplemented)("buffer.transcode");
|
||||
exports.transcode = transcode;
|
||||
const btoa = global.btoa;
|
||||
exports.btoa = btoa;
|
||||
const atob = globalThis.atob;
|
||||
exports.atob = atob;
|
||||
const kStringMaxLength = 0;
|
||||
exports.kStringMaxLength = kStringMaxLength;
|
||||
const constants = {
|
||||
MAX_LENGTH: _buffer.kMaxLength,
|
||||
MAX_STRING_LENGTH: kStringMaxLength
|
||||
};
|
||||
exports.constants = constants;
|
||||
var _default = {
|
||||
Buffer: _buffer.Buffer,
|
||||
SlowBuffer: _buffer.SlowBuffer,
|
||||
kMaxLength: _buffer.kMaxLength,
|
||||
INSPECT_MAX_BYTES: _buffer.INSPECT_MAX_BYTES,
|
||||
Blob,
|
||||
resolveObjectURL,
|
||||
transcode,
|
||||
btoa,
|
||||
atob,
|
||||
kStringMaxLength,
|
||||
constants
|
||||
};
|
||||
module.exports = _default;
|
||||
16
node_modules/unenv/runtime/node/buffer/index.d.ts
generated
vendored
Normal file
16
node_modules/unenv/runtime/node/buffer/index.d.ts
generated
vendored
Normal file
@@ -0,0 +1,16 @@
|
||||
export { Buffer, kMaxLength, INSPECT_MAX_BYTES, SlowBuffer } from "./_buffer";
|
||||
export declare const Blob: {
|
||||
new (blobParts?: BlobPart[], options?: BlobPropertyBag): Blob;
|
||||
prototype: Blob;
|
||||
};
|
||||
export declare const resolveObjectURL: () => any;
|
||||
export declare const transcode: () => any;
|
||||
export declare const btoa: typeof globalThis.btoa;
|
||||
export declare const atob: typeof globalThis.atob;
|
||||
export declare const kStringMaxLength = 0;
|
||||
export declare const constants: {
|
||||
MAX_LENGTH: number;
|
||||
MAX_STRING_LENGTH: number;
|
||||
};
|
||||
declare const _default: any;
|
||||
export default _default;
|
||||
23
node_modules/unenv/runtime/node/buffer/index.mjs
generated
vendored
Normal file
23
node_modules/unenv/runtime/node/buffer/index.mjs
generated
vendored
Normal file
@@ -0,0 +1,23 @@
|
||||
import { notImplemented } from "../../_internal/utils.mjs";
|
||||
import { Buffer, kMaxLength, INSPECT_MAX_BYTES, SlowBuffer } from "./_buffer.mjs";
|
||||
export { Buffer, kMaxLength, INSPECT_MAX_BYTES, SlowBuffer } from "./_buffer.mjs";
|
||||
export const Blob = globalThis.Blob;
|
||||
export const resolveObjectURL = notImplemented("buffer.resolveObjectURL");
|
||||
export const transcode = notImplemented("buffer.transcode");
|
||||
export const btoa = global.btoa;
|
||||
export const atob = globalThis.atob;
|
||||
export const kStringMaxLength = 0;
|
||||
export const constants = { MAX_LENGTH: kMaxLength, MAX_STRING_LENGTH: kStringMaxLength };
|
||||
export default {
|
||||
Buffer,
|
||||
SlowBuffer,
|
||||
kMaxLength,
|
||||
INSPECT_MAX_BYTES,
|
||||
Blob,
|
||||
resolveObjectURL,
|
||||
transcode,
|
||||
btoa,
|
||||
atob,
|
||||
kStringMaxLength,
|
||||
constants
|
||||
};
|
||||
Reference in New Issue
Block a user