admin: update dist files; updated package-lock
This commit is contained in:
parent
eeb1a4b650
commit
416de27589
@ -3,7 +3,7 @@ Change Log
|
|||||||
|
|
||||||
This change log is maintained by `src.ts/_admin/update-changelog.ts` but may also be manually updated.
|
This change log is maintained by `src.ts/_admin/update-changelog.ts` but may also be manually updated.
|
||||||
|
|
||||||
ethers/v6.11.0 (2024-02-02 03:13)
|
ethers/v6.11.0 (2024-02-02 03:28)
|
||||||
---------------------------------
|
---------------------------------
|
||||||
|
|
||||||
- Assert BrowserProvider receives an EIP-1193 provider to fail early when passing undefined ethereum object ([b69f43b](https://github.com/ethers-io/ethers.js/commit/b69f43bc6f35da881ca7a0c8ccc5fda92edd076d)).
|
- Assert BrowserProvider receives an EIP-1193 provider to fail early when passing undefined ethereum object ([b69f43b](https://github.com/ethers-io/ethers.js/commit/b69f43bc6f35da881ca7a0c8ccc5fda92edd076d)).
|
||||||
|
49
dist/ethers.js
vendored
49
dist/ethers.js
vendored
@ -8406,7 +8406,7 @@ function id(value) {
|
|||||||
return keccak256(toUtf8Bytes(value));
|
return keccak256(toUtf8Bytes(value));
|
||||||
}
|
}
|
||||||
|
|
||||||
// created 2023-09-12T22:05:14.211Z
|
// created 2023-09-25T01:01:55.148Z
|
||||||
// compressed base64-encoded blob for include-ens data
|
// compressed base64-encoded blob for include-ens data
|
||||||
// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js
|
// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js
|
||||||
// see: https://github.com/adraffy/ens-normalize.js#security
|
// see: https://github.com/adraffy/ens-normalize.js#security
|
||||||
@ -8687,7 +8687,7 @@ function compare_arrays(a, b) {
|
|||||||
return c;
|
return c;
|
||||||
}
|
}
|
||||||
|
|
||||||
// created 2023-09-12T22:05:14.211Z
|
// created 2023-09-25T01:01:55.148Z
|
||||||
// compressed base64-encoded blob for include-nf data
|
// compressed base64-encoded blob for include-nf data
|
||||||
// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js
|
// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js
|
||||||
// see: https://github.com/adraffy/ens-normalize.js#security
|
// see: https://github.com/adraffy/ens-normalize.js#security
|
||||||
@ -8903,6 +8903,7 @@ function init() {
|
|||||||
let r = read_compressed_payload(COMPRESSED$1);
|
let r = read_compressed_payload(COMPRESSED$1);
|
||||||
const read_sorted_array = () => read_sorted(r);
|
const read_sorted_array = () => read_sorted(r);
|
||||||
const read_sorted_set = () => new Set(read_sorted_array());
|
const read_sorted_set = () => new Set(read_sorted_array());
|
||||||
|
const set_add_many = (set, v) => v.forEach(x => set.add(x));
|
||||||
|
|
||||||
MAPPED = new Map(read_mapped(r));
|
MAPPED = new Map(read_mapped(r));
|
||||||
IGNORED = read_sorted_set(); // ignored characters are not valid, so just read raw codepoints
|
IGNORED = read_sorted_set(); // ignored characters are not valid, so just read raw codepoints
|
||||||
@ -8925,13 +8926,20 @@ function init() {
|
|||||||
|
|
||||||
let chunks = read_sorted_arrays(r);
|
let chunks = read_sorted_arrays(r);
|
||||||
let unrestricted = r();
|
let unrestricted = r();
|
||||||
const read_chunked = () => new Set(read_sorted_array().flatMap(i => chunks[i]).concat(read_sorted_array()));
|
//const read_chunked = () => new Set(read_sorted_array().flatMap(i => chunks[i]).concat(read_sorted_array()));
|
||||||
|
const read_chunked = () => {
|
||||||
|
// 20230921: build set in parts, 2x faster
|
||||||
|
let set = new Set();
|
||||||
|
read_sorted_array().forEach(i => set_add_many(set, chunks[i]));
|
||||||
|
set_add_many(set, read_sorted_array());
|
||||||
|
return set;
|
||||||
|
};
|
||||||
GROUPS = read_array_while(i => {
|
GROUPS = read_array_while(i => {
|
||||||
// minifier property mangling seems unsafe
|
// minifier property mangling seems unsafe
|
||||||
// so these are manually renamed to single chars
|
// so these are manually renamed to single chars
|
||||||
let N = read_array_while(r).map(x => x+0x60);
|
let N = read_array_while(r).map(x => x+0x60);
|
||||||
if (N.length) {
|
if (N.length) {
|
||||||
let R = i >= unrestricted; // first arent restricted
|
let R = i >= unrestricted; // unrestricted then restricted
|
||||||
N[0] -= 32; // capitalize
|
N[0] -= 32; // capitalize
|
||||||
N = str_from_cps(N);
|
N = str_from_cps(N);
|
||||||
if (R) N=`Restricted[${N}]`;
|
if (R) N=`Restricted[${N}]`;
|
||||||
@ -8969,6 +8977,7 @@ function init() {
|
|||||||
});
|
});
|
||||||
|
|
||||||
// compute confusable-extent complements
|
// compute confusable-extent complements
|
||||||
|
// usage: WHOLE_MAP.get(cp).M.get(cp) = complement set
|
||||||
for (let {V, M} of new Set(WHOLE_MAP.values())) {
|
for (let {V, M} of new Set(WHOLE_MAP.values())) {
|
||||||
// connect all groups that have each whole character
|
// connect all groups that have each whole character
|
||||||
let recs = [];
|
let recs = [];
|
||||||
@ -8980,34 +8989,37 @@ function init() {
|
|||||||
recs.push(rec);
|
recs.push(rec);
|
||||||
}
|
}
|
||||||
rec.V.push(cp);
|
rec.V.push(cp);
|
||||||
gs.forEach(g => rec.G.add(g));
|
set_add_many(rec.G, gs);
|
||||||
}
|
}
|
||||||
// per character cache groups which are not a member of the extent
|
// per character cache groups which are not a member of the extent
|
||||||
let union = recs.flatMap(x => Array_from(x.G));
|
let union = recs.flatMap(x => Array_from(x.G)); // all of the groups used by this whole
|
||||||
for (let {G, V} of recs) {
|
for (let {G, V} of recs) {
|
||||||
let complement = new Set(union.filter(g => !G.has(g)));
|
let complement = new Set(union.filter(g => !G.has(g))); // groups not covered by the extent
|
||||||
for (let cp of V) {
|
for (let cp of V) {
|
||||||
M.set(cp, complement);
|
M.set(cp, complement); // this is the same reference
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// compute valid set
|
// compute valid set
|
||||||
let union = new Set(); // exists in 1+ groups
|
// 20230924: VALID was union but can be re-used
|
||||||
|
VALID = new Set(); // exists in 1+ groups
|
||||||
let multi = new Set(); // exists in 2+ groups
|
let multi = new Set(); // exists in 2+ groups
|
||||||
const add_to_union = cp => union.has(cp) ? multi.add(cp) : union.add(cp);
|
const add_to_union = cp => VALID.has(cp) ? multi.add(cp) : VALID.add(cp);
|
||||||
for (let g of GROUPS) {
|
for (let g of GROUPS) {
|
||||||
for (let cp of g.P) add_to_union(cp);
|
for (let cp of g.P) add_to_union(cp);
|
||||||
for (let cp of g.Q) add_to_union(cp);
|
for (let cp of g.Q) add_to_union(cp);
|
||||||
}
|
}
|
||||||
// dual purpose WHOLE_MAP: return placeholder if unique non-confusable
|
// dual purpose WHOLE_MAP: return placeholder if unique non-confusable
|
||||||
for (let cp of union) {
|
for (let cp of VALID) {
|
||||||
if (!WHOLE_MAP.has(cp) && !multi.has(cp)) {
|
if (!WHOLE_MAP.has(cp) && !multi.has(cp)) {
|
||||||
WHOLE_MAP.set(cp, UNIQUE_PH);
|
WHOLE_MAP.set(cp, UNIQUE_PH);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
VALID = new Set(Array_from(union).concat(Array_from(nfd(union)))); // possibly valid
|
// add all decomposed parts
|
||||||
|
// see derive: "Valid is Closed (via Brute-force)"
|
||||||
|
set_add_many(VALID, nfd(VALID));
|
||||||
|
|
||||||
// decode emoji
|
// decode emoji
|
||||||
// 20230719: emoji are now fully-expanded to avoid quirk logic
|
// 20230719: emoji are now fully-expanded to avoid quirk logic
|
||||||
EMOJI_LIST = read_trie(r).map(v => Emoji.from(v)).sort(compare_arrays);
|
EMOJI_LIST = read_trie(r).map(v => Emoji.from(v)).sort(compare_arrays);
|
||||||
@ -9060,7 +9072,7 @@ function bidi_qq(s) {
|
|||||||
|
|
||||||
function check_label_extension(cps) {
|
function check_label_extension(cps) {
|
||||||
if (cps.length >= 4 && cps[2] == HYPHEN && cps[3] == HYPHEN) {
|
if (cps.length >= 4 && cps[2] == HYPHEN && cps[3] == HYPHEN) {
|
||||||
throw new Error(`invalid label extension: "${str_from_cps(cps.slice(0, 4))}"`);
|
throw new Error(`invalid label extension: "${str_from_cps(cps.slice(0, 4))}"`); // this can only be ascii so cant be bidi
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
function check_leading_underscore(cps) {
|
function check_leading_underscore(cps) {
|
||||||
@ -9094,13 +9106,18 @@ function check_fenced(cps) {
|
|||||||
// create a safe to print string
|
// create a safe to print string
|
||||||
// invisibles are escaped
|
// invisibles are escaped
|
||||||
// leading cm uses placeholder
|
// leading cm uses placeholder
|
||||||
|
// if cps exceed max, middle truncate with ellipsis
|
||||||
// quoter(cp) => string, eg. 3000 => "{3000}"
|
// quoter(cp) => string, eg. 3000 => "{3000}"
|
||||||
// note: in html, you'd call this function then replace [<>&] with entities
|
// note: in html, you'd call this function then replace [<>&] with entities
|
||||||
function safe_str_from_cps(cps, quoter = quote_cp) {
|
function safe_str_from_cps(cps, max = Infinity, quoter = quote_cp) {
|
||||||
//if (Number.isInteger(cps)) cps = [cps];
|
//if (Number.isInteger(cps)) cps = [cps];
|
||||||
//if (!Array.isArray(cps)) throw new TypeError(`expected codepoints`);
|
//if (!Array.isArray(cps)) throw new TypeError(`expected codepoints`);
|
||||||
let buf = [];
|
let buf = [];
|
||||||
if (is_combining_mark(cps[0])) buf.push('◌');
|
if (is_combining_mark(cps[0])) buf.push('◌');
|
||||||
|
if (cps.length > max) {
|
||||||
|
max >>= 1;
|
||||||
|
cps = [...cps.slice(0, max), 0x2026, ...cps.slice(-max)];
|
||||||
|
}
|
||||||
let prev = 0;
|
let prev = 0;
|
||||||
let n = cps.length;
|
let n = cps.length;
|
||||||
for (let i = 0; i < n; i++) {
|
for (let i = 0; i < n; i++) {
|
||||||
@ -9265,7 +9282,7 @@ function flatten(split) {
|
|||||||
// don't print label again if just a single label
|
// don't print label again if just a single label
|
||||||
let msg = error.message;
|
let msg = error.message;
|
||||||
// bidi_qq() only necessary if msg is digits
|
// bidi_qq() only necessary if msg is digits
|
||||||
throw new Error(split.length == 1 ? msg : `Invalid label ${bidi_qq(safe_str_from_cps(input))}: ${msg}`);
|
throw new Error(split.length == 1 ? msg : `Invalid label ${bidi_qq(safe_str_from_cps(input, 63))}: ${msg}`);
|
||||||
}
|
}
|
||||||
return str_from_cps(output);
|
return str_from_cps(output);
|
||||||
}).join(STOP_CH);
|
}).join(STOP_CH);
|
||||||
|
2
dist/ethers.js.map
vendored
2
dist/ethers.js.map
vendored
File diff suppressed because one or more lines are too long
2
dist/ethers.min.js
vendored
2
dist/ethers.min.js
vendored
File diff suppressed because one or more lines are too long
49
dist/ethers.umd.js
vendored
49
dist/ethers.umd.js
vendored
@ -8412,7 +8412,7 @@ const __$G = (typeof globalThis !== 'undefined' ? globalThis: typeof window !==
|
|||||||
return keccak256(toUtf8Bytes(value));
|
return keccak256(toUtf8Bytes(value));
|
||||||
}
|
}
|
||||||
|
|
||||||
// created 2023-09-12T22:05:14.211Z
|
// created 2023-09-25T01:01:55.148Z
|
||||||
// compressed base64-encoded blob for include-ens data
|
// compressed base64-encoded blob for include-ens data
|
||||||
// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js
|
// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js
|
||||||
// see: https://github.com/adraffy/ens-normalize.js#security
|
// see: https://github.com/adraffy/ens-normalize.js#security
|
||||||
@ -8693,7 +8693,7 @@ const __$G = (typeof globalThis !== 'undefined' ? globalThis: typeof window !==
|
|||||||
return c;
|
return c;
|
||||||
}
|
}
|
||||||
|
|
||||||
// created 2023-09-12T22:05:14.211Z
|
// created 2023-09-25T01:01:55.148Z
|
||||||
// compressed base64-encoded blob for include-nf data
|
// compressed base64-encoded blob for include-nf data
|
||||||
// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js
|
// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js
|
||||||
// see: https://github.com/adraffy/ens-normalize.js#security
|
// see: https://github.com/adraffy/ens-normalize.js#security
|
||||||
@ -8909,6 +8909,7 @@ const __$G = (typeof globalThis !== 'undefined' ? globalThis: typeof window !==
|
|||||||
let r = read_compressed_payload(COMPRESSED$1);
|
let r = read_compressed_payload(COMPRESSED$1);
|
||||||
const read_sorted_array = () => read_sorted(r);
|
const read_sorted_array = () => read_sorted(r);
|
||||||
const read_sorted_set = () => new Set(read_sorted_array());
|
const read_sorted_set = () => new Set(read_sorted_array());
|
||||||
|
const set_add_many = (set, v) => v.forEach(x => set.add(x));
|
||||||
|
|
||||||
MAPPED = new Map(read_mapped(r));
|
MAPPED = new Map(read_mapped(r));
|
||||||
IGNORED = read_sorted_set(); // ignored characters are not valid, so just read raw codepoints
|
IGNORED = read_sorted_set(); // ignored characters are not valid, so just read raw codepoints
|
||||||
@ -8931,13 +8932,20 @@ const __$G = (typeof globalThis !== 'undefined' ? globalThis: typeof window !==
|
|||||||
|
|
||||||
let chunks = read_sorted_arrays(r);
|
let chunks = read_sorted_arrays(r);
|
||||||
let unrestricted = r();
|
let unrestricted = r();
|
||||||
const read_chunked = () => new Set(read_sorted_array().flatMap(i => chunks[i]).concat(read_sorted_array()));
|
//const read_chunked = () => new Set(read_sorted_array().flatMap(i => chunks[i]).concat(read_sorted_array()));
|
||||||
|
const read_chunked = () => {
|
||||||
|
// 20230921: build set in parts, 2x faster
|
||||||
|
let set = new Set();
|
||||||
|
read_sorted_array().forEach(i => set_add_many(set, chunks[i]));
|
||||||
|
set_add_many(set, read_sorted_array());
|
||||||
|
return set;
|
||||||
|
};
|
||||||
GROUPS = read_array_while(i => {
|
GROUPS = read_array_while(i => {
|
||||||
// minifier property mangling seems unsafe
|
// minifier property mangling seems unsafe
|
||||||
// so these are manually renamed to single chars
|
// so these are manually renamed to single chars
|
||||||
let N = read_array_while(r).map(x => x+0x60);
|
let N = read_array_while(r).map(x => x+0x60);
|
||||||
if (N.length) {
|
if (N.length) {
|
||||||
let R = i >= unrestricted; // first arent restricted
|
let R = i >= unrestricted; // unrestricted then restricted
|
||||||
N[0] -= 32; // capitalize
|
N[0] -= 32; // capitalize
|
||||||
N = str_from_cps(N);
|
N = str_from_cps(N);
|
||||||
if (R) N=`Restricted[${N}]`;
|
if (R) N=`Restricted[${N}]`;
|
||||||
@ -8975,6 +8983,7 @@ const __$G = (typeof globalThis !== 'undefined' ? globalThis: typeof window !==
|
|||||||
});
|
});
|
||||||
|
|
||||||
// compute confusable-extent complements
|
// compute confusable-extent complements
|
||||||
|
// usage: WHOLE_MAP.get(cp).M.get(cp) = complement set
|
||||||
for (let {V, M} of new Set(WHOLE_MAP.values())) {
|
for (let {V, M} of new Set(WHOLE_MAP.values())) {
|
||||||
// connect all groups that have each whole character
|
// connect all groups that have each whole character
|
||||||
let recs = [];
|
let recs = [];
|
||||||
@ -8986,34 +8995,37 @@ const __$G = (typeof globalThis !== 'undefined' ? globalThis: typeof window !==
|
|||||||
recs.push(rec);
|
recs.push(rec);
|
||||||
}
|
}
|
||||||
rec.V.push(cp);
|
rec.V.push(cp);
|
||||||
gs.forEach(g => rec.G.add(g));
|
set_add_many(rec.G, gs);
|
||||||
}
|
}
|
||||||
// per character cache groups which are not a member of the extent
|
// per character cache groups which are not a member of the extent
|
||||||
let union = recs.flatMap(x => Array_from(x.G));
|
let union = recs.flatMap(x => Array_from(x.G)); // all of the groups used by this whole
|
||||||
for (let {G, V} of recs) {
|
for (let {G, V} of recs) {
|
||||||
let complement = new Set(union.filter(g => !G.has(g)));
|
let complement = new Set(union.filter(g => !G.has(g))); // groups not covered by the extent
|
||||||
for (let cp of V) {
|
for (let cp of V) {
|
||||||
M.set(cp, complement);
|
M.set(cp, complement); // this is the same reference
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
// compute valid set
|
// compute valid set
|
||||||
let union = new Set(); // exists in 1+ groups
|
// 20230924: VALID was union but can be re-used
|
||||||
|
VALID = new Set(); // exists in 1+ groups
|
||||||
let multi = new Set(); // exists in 2+ groups
|
let multi = new Set(); // exists in 2+ groups
|
||||||
const add_to_union = cp => union.has(cp) ? multi.add(cp) : union.add(cp);
|
const add_to_union = cp => VALID.has(cp) ? multi.add(cp) : VALID.add(cp);
|
||||||
for (let g of GROUPS) {
|
for (let g of GROUPS) {
|
||||||
for (let cp of g.P) add_to_union(cp);
|
for (let cp of g.P) add_to_union(cp);
|
||||||
for (let cp of g.Q) add_to_union(cp);
|
for (let cp of g.Q) add_to_union(cp);
|
||||||
}
|
}
|
||||||
// dual purpose WHOLE_MAP: return placeholder if unique non-confusable
|
// dual purpose WHOLE_MAP: return placeholder if unique non-confusable
|
||||||
for (let cp of union) {
|
for (let cp of VALID) {
|
||||||
if (!WHOLE_MAP.has(cp) && !multi.has(cp)) {
|
if (!WHOLE_MAP.has(cp) && !multi.has(cp)) {
|
||||||
WHOLE_MAP.set(cp, UNIQUE_PH);
|
WHOLE_MAP.set(cp, UNIQUE_PH);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
VALID = new Set(Array_from(union).concat(Array_from(nfd(union)))); // possibly valid
|
// add all decomposed parts
|
||||||
|
// see derive: "Valid is Closed (via Brute-force)"
|
||||||
|
set_add_many(VALID, nfd(VALID));
|
||||||
|
|
||||||
// decode emoji
|
// decode emoji
|
||||||
// 20230719: emoji are now fully-expanded to avoid quirk logic
|
// 20230719: emoji are now fully-expanded to avoid quirk logic
|
||||||
EMOJI_LIST = read_trie(r).map(v => Emoji.from(v)).sort(compare_arrays);
|
EMOJI_LIST = read_trie(r).map(v => Emoji.from(v)).sort(compare_arrays);
|
||||||
@ -9066,7 +9078,7 @@ const __$G = (typeof globalThis !== 'undefined' ? globalThis: typeof window !==
|
|||||||
|
|
||||||
function check_label_extension(cps) {
|
function check_label_extension(cps) {
|
||||||
if (cps.length >= 4 && cps[2] == HYPHEN && cps[3] == HYPHEN) {
|
if (cps.length >= 4 && cps[2] == HYPHEN && cps[3] == HYPHEN) {
|
||||||
throw new Error(`invalid label extension: "${str_from_cps(cps.slice(0, 4))}"`);
|
throw new Error(`invalid label extension: "${str_from_cps(cps.slice(0, 4))}"`); // this can only be ascii so cant be bidi
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
function check_leading_underscore(cps) {
|
function check_leading_underscore(cps) {
|
||||||
@ -9100,13 +9112,18 @@ const __$G = (typeof globalThis !== 'undefined' ? globalThis: typeof window !==
|
|||||||
// create a safe to print string
|
// create a safe to print string
|
||||||
// invisibles are escaped
|
// invisibles are escaped
|
||||||
// leading cm uses placeholder
|
// leading cm uses placeholder
|
||||||
|
// if cps exceed max, middle truncate with ellipsis
|
||||||
// quoter(cp) => string, eg. 3000 => "{3000}"
|
// quoter(cp) => string, eg. 3000 => "{3000}"
|
||||||
// note: in html, you'd call this function then replace [<>&] with entities
|
// note: in html, you'd call this function then replace [<>&] with entities
|
||||||
function safe_str_from_cps(cps, quoter = quote_cp) {
|
function safe_str_from_cps(cps, max = Infinity, quoter = quote_cp) {
|
||||||
//if (Number.isInteger(cps)) cps = [cps];
|
//if (Number.isInteger(cps)) cps = [cps];
|
||||||
//if (!Array.isArray(cps)) throw new TypeError(`expected codepoints`);
|
//if (!Array.isArray(cps)) throw new TypeError(`expected codepoints`);
|
||||||
let buf = [];
|
let buf = [];
|
||||||
if (is_combining_mark(cps[0])) buf.push('◌');
|
if (is_combining_mark(cps[0])) buf.push('◌');
|
||||||
|
if (cps.length > max) {
|
||||||
|
max >>= 1;
|
||||||
|
cps = [...cps.slice(0, max), 0x2026, ...cps.slice(-max)];
|
||||||
|
}
|
||||||
let prev = 0;
|
let prev = 0;
|
||||||
let n = cps.length;
|
let n = cps.length;
|
||||||
for (let i = 0; i < n; i++) {
|
for (let i = 0; i < n; i++) {
|
||||||
@ -9271,7 +9288,7 @@ const __$G = (typeof globalThis !== 'undefined' ? globalThis: typeof window !==
|
|||||||
// don't print label again if just a single label
|
// don't print label again if just a single label
|
||||||
let msg = error.message;
|
let msg = error.message;
|
||||||
// bidi_qq() only necessary if msg is digits
|
// bidi_qq() only necessary if msg is digits
|
||||||
throw new Error(split.length == 1 ? msg : `Invalid label ${bidi_qq(safe_str_from_cps(input))}: ${msg}`);
|
throw new Error(split.length == 1 ? msg : `Invalid label ${bidi_qq(safe_str_from_cps(input, 63))}: ${msg}`);
|
||||||
}
|
}
|
||||||
return str_from_cps(output);
|
return str_from_cps(output);
|
||||||
}).join(STOP_CH);
|
}).join(STOP_CH);
|
||||||
|
2
dist/ethers.umd.js.map
vendored
2
dist/ethers.umd.js.map
vendored
File diff suppressed because one or more lines are too long
2
dist/ethers.umd.min.js
vendored
2
dist/ethers.umd.min.js
vendored
File diff suppressed because one or more lines are too long
18
package-lock.json
generated
18
package-lock.json
generated
@ -1,12 +1,12 @@
|
|||||||
{
|
{
|
||||||
"name": "ethers",
|
"name": "ethers",
|
||||||
"version": "6.8.0",
|
"version": "6.11.0",
|
||||||
"lockfileVersion": 2,
|
"lockfileVersion": 2,
|
||||||
"requires": true,
|
"requires": true,
|
||||||
"packages": {
|
"packages": {
|
||||||
"": {
|
"": {
|
||||||
"name": "ethers",
|
"name": "ethers",
|
||||||
"version": "6.8.0",
|
"version": "6.11.0",
|
||||||
"funding": [
|
"funding": [
|
||||||
{
|
{
|
||||||
"type": "individual",
|
"type": "individual",
|
||||||
@ -19,7 +19,7 @@
|
|||||||
],
|
],
|
||||||
"license": "MIT",
|
"license": "MIT",
|
||||||
"dependencies": {
|
"dependencies": {
|
||||||
"@adraffy/ens-normalize": "1.10.0",
|
"@adraffy/ens-normalize": "1.10.1",
|
||||||
"@noble/curves": "1.2.0",
|
"@noble/curves": "1.2.0",
|
||||||
"@noble/hashes": "1.3.2",
|
"@noble/hashes": "1.3.2",
|
||||||
"@types/node": "18.15.13",
|
"@types/node": "18.15.13",
|
||||||
@ -43,9 +43,9 @@
|
|||||||
}
|
}
|
||||||
},
|
},
|
||||||
"node_modules/@adraffy/ens-normalize": {
|
"node_modules/@adraffy/ens-normalize": {
|
||||||
"version": "1.10.0",
|
"version": "1.10.1",
|
||||||
"resolved": "https://registry.npmjs.org/@adraffy/ens-normalize/-/ens-normalize-1.10.0.tgz",
|
"resolved": "https://registry.npmjs.org/@adraffy/ens-normalize/-/ens-normalize-1.10.1.tgz",
|
||||||
"integrity": "sha512-nA9XHtlAkYfJxY7bce8DcN7eKxWWCWkU+1GR9d+U6MbNpfwQp8TI7vqOsBsMcHoT4mBu2kypKoSKnghEzOOq5Q=="
|
"integrity": "sha512-96Z2IP3mYmF1Xg2cDm8f1gWGf/HUVedQ3FMifV4kG/PQ4yEP51xDtRAEfhVNt5f/uzpNkZHwWQuUcu6D6K+Ekw=="
|
||||||
},
|
},
|
||||||
"node_modules/@bcoe/v8-coverage": {
|
"node_modules/@bcoe/v8-coverage": {
|
||||||
"version": "0.2.3",
|
"version": "0.2.3",
|
||||||
@ -1565,9 +1565,9 @@
|
|||||||
},
|
},
|
||||||
"dependencies": {
|
"dependencies": {
|
||||||
"@adraffy/ens-normalize": {
|
"@adraffy/ens-normalize": {
|
||||||
"version": "1.10.0",
|
"version": "1.10.1",
|
||||||
"resolved": "https://registry.npmjs.org/@adraffy/ens-normalize/-/ens-normalize-1.10.0.tgz",
|
"resolved": "https://registry.npmjs.org/@adraffy/ens-normalize/-/ens-normalize-1.10.1.tgz",
|
||||||
"integrity": "sha512-nA9XHtlAkYfJxY7bce8DcN7eKxWWCWkU+1GR9d+U6MbNpfwQp8TI7vqOsBsMcHoT4mBu2kypKoSKnghEzOOq5Q=="
|
"integrity": "sha512-96Z2IP3mYmF1Xg2cDm8f1gWGf/HUVedQ3FMifV4kG/PQ4yEP51xDtRAEfhVNt5f/uzpNkZHwWQuUcu6D6K+Ekw=="
|
||||||
},
|
},
|
||||||
"@bcoe/v8-coverage": {
|
"@bcoe/v8-coverage": {
|
||||||
"version": "0.2.3",
|
"version": "0.2.3",
|
||||||
|
Loading…
Reference in New Issue
Block a user