2022-02-02 14:21:39 +00:00
|
|
|
// Copyright 2018-2022 the Deno authors. All rights reserved. MIT license.
|
2021-10-06 17:10:43 +00:00
|
|
|
/** Check whether binary arrays are equal to each other using 8-bit comparisons.
|
|
|
|
* @private
|
|
|
|
* @param a first array to check equality
|
|
|
|
* @param b second array to check equality
|
|
|
|
*/
|
|
|
|
export function equalsNaive(a: Uint8Array, b: Uint8Array): boolean {
|
|
|
|
if (a.length !== b.length) return false;
|
|
|
|
for (let i = 0; i < b.length; i++) {
|
|
|
|
if (a[i] !== b[i]) return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Check whether binary arrays are equal to each other using 32-bit comparisons.
|
|
|
|
* @private
|
|
|
|
* @param a first array to check equality
|
|
|
|
* @param b second array to check equality
|
|
|
|
*/
|
|
|
|
export function equalsSimd(a: Uint8Array, b: Uint8Array): boolean {
|
|
|
|
if (a.length !== b.length) return false;
|
|
|
|
const len = a.length;
|
|
|
|
const compressable = Math.floor(len / 4);
|
|
|
|
const compressedA = new Uint32Array(a.buffer, 0, compressable);
|
|
|
|
const compressedB = new Uint32Array(b.buffer, 0, compressable);
|
|
|
|
for (let i = compressable * 4; i < len; i++) {
|
|
|
|
if (a[i] !== b[i]) return false;
|
|
|
|
}
|
|
|
|
for (let i = 0; i < compressedA.length; i++) {
|
|
|
|
if (compressedA[i] !== compressedB[i]) return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/** Check whether binary arrays are equal to each other.
|
|
|
|
* @param a first array to check equality
|
|
|
|
* @param b second array to check equality
|
|
|
|
*/
|
|
|
|
export function equals(a: Uint8Array, b: Uint8Array): boolean {
|
|
|
|
if (a.length < 1000) return equalsNaive(a, b);
|
|
|
|
return equalsSimd(a, b);
|
|
|
|
}
|