Skip to content

Commit

Permalink
Deployed using Blazing fast GitHub Pages deploy
Browse files Browse the repository at this point in the history
  • Loading branch information
nin-jin committed Jan 8, 2024
1 parent 5a57eb9 commit 53adf1c
Show file tree
Hide file tree
Showing 8 changed files with 13 additions and 13 deletions.
4 changes: 2 additions & 2 deletions node.js
Original file line number Diff line number Diff line change
Expand Up @@ -1020,11 +1020,11 @@ var $;
return true;
}
function compare_buffer(left, right) {
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
const len = left.byteLength;
if (len !== right.byteLength)
return false;
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
for (let i = 0; i < len; ++i) {
if (left[i] !== right[i])
return false;
Expand Down
2 changes: 1 addition & 1 deletion node.js.map

Large diffs are not rendered by default.

4 changes: 2 additions & 2 deletions node.mjs
Original file line number Diff line number Diff line change
Expand Up @@ -1020,11 +1020,11 @@ var $;
return true;
}
function compare_buffer(left, right) {
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
const len = left.byteLength;
if (len !== right.byteLength)
return false;
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
for (let i = 0; i < len; ++i) {
if (left[i] !== right[i])
return false;
Expand Down
4 changes: 2 additions & 2 deletions node.test.js
Original file line number Diff line number Diff line change
Expand Up @@ -1012,11 +1012,11 @@ var $;
return true;
}
function compare_buffer(left, right) {
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
const len = left.byteLength;
if (len !== right.byteLength)
return false;
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
for (let i = 0; i < len; ++i) {
if (left[i] !== right[i])
return false;
Expand Down
2 changes: 1 addition & 1 deletion node.test.js.map

Large diffs are not rendered by default.

4 changes: 2 additions & 2 deletions web.js
Original file line number Diff line number Diff line change
Expand Up @@ -1011,11 +1011,11 @@ var $;
return true;
}
function compare_buffer(left, right) {
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
const len = left.byteLength;
if (len !== right.byteLength)
return false;
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
for (let i = 0; i < len; ++i) {
if (left[i] !== right[i])
return false;
Expand Down
2 changes: 1 addition & 1 deletion web.js.map

Large diffs are not rendered by default.

4 changes: 2 additions & 2 deletions web.mjs
Original file line number Diff line number Diff line change
Expand Up @@ -1011,11 +1011,11 @@ var $;
return true;
}
function compare_buffer(left, right) {
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
const len = left.byteLength;
if (len !== right.byteLength)
return false;
if (left instanceof DataView)
return compare_buffer(new Uint8Array(left.buffer, left.byteOffset, left.byteLength), new Uint8Array(right.buffer, left.byteOffset, left.byteLength));
for (let i = 0; i < len; ++i) {
if (left[i] !== right[i])
return false;
Expand Down

0 comments on commit 53adf1c

Please sign in to comment.