1
0
Fork 0
mirror of https://github.com/denoland/deno.git synced 2024-11-22 15:06:54 -05:00
denoland-deno/ext/node/polyfills/internal_binding/buffer.ts
2024-01-01 19:58:21 +00:00

164 lines
4.1 KiB
TypeScript

// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
// TODO(petamoriken): enable prefer-primordials for node polyfills
// deno-lint-ignore-file prefer-primordials
import { Encodings } from "ext:deno_node/internal_binding/_node.ts";
export function indexOfNeedle(
source: Uint8Array,
needle: Uint8Array,
start = 0,
): number {
if (start >= source.length) {
return -1;
}
if (start < 0) {
start = Math.max(0, source.length + start);
}
const s = needle[0];
for (let i = start; i < source.length; i++) {
if (source[i] !== s) continue;
const pin = i;
let matched = 1;
let j = i;
while (matched < needle.length) {
j++;
if (source[j] !== needle[j - pin]) {
break;
}
matched++;
}
if (matched === needle.length) {
return pin;
}
}
return -1;
}
export function numberToBytes(n: number): Uint8Array {
if (n === 0) return new Uint8Array([0]);
const bytes = [];
bytes.unshift(n & 255);
while (n >= 256) {
n = n >>> 8;
bytes.unshift(n & 255);
}
return new Uint8Array(bytes);
}
// TODO(Soremwar)
// Check if offset or buffer can be transform in order to just use std's lastIndexOf directly
// This implementation differs from std's lastIndexOf in the fact that
// it also includes items outside of the offset as long as part of the
// set is contained inside of the offset
// Probably way slower too
function findLastIndex(
targetBuffer: Uint8Array,
buffer: Uint8Array,
offset: number,
) {
offset = offset > targetBuffer.length ? targetBuffer.length : offset;
const searchableBuffer = targetBuffer.slice(0, offset + buffer.length);
const searchableBufferLastIndex = searchableBuffer.length - 1;
const bufferLastIndex = buffer.length - 1;
// Important to keep track of the last match index in order to backtrack after an incomplete match
// Not doing this will cause the search to skip all possible matches that happened in the
// last match range
let lastMatchIndex = -1;
let matches = 0;
let index = -1;
for (let x = 0; x <= searchableBufferLastIndex; x++) {
if (
searchableBuffer[searchableBufferLastIndex - x] ===
buffer[bufferLastIndex - matches]
) {
if (lastMatchIndex === -1) {
lastMatchIndex = x;
}
matches++;
} else {
matches = 0;
if (lastMatchIndex !== -1) {
// Restart the search right after the last index was ignored
x = lastMatchIndex + 1;
lastMatchIndex = -1;
}
continue;
}
if (matches === buffer.length) {
index = x;
break;
}
}
if (index === -1) return index;
return searchableBufferLastIndex - index;
}
// TODO(@bartlomieju):
// Take encoding into account when evaluating index
function indexOfBuffer(
targetBuffer: Uint8Array,
buffer: Uint8Array,
byteOffset: number,
encoding: Encodings,
forwardDirection: boolean,
) {
if (!Encodings[encoding] === undefined) {
throw new Error(`Unknown encoding code ${encoding}`);
}
if (!forwardDirection) {
// If negative the offset is calculated from the end of the buffer
if (byteOffset < 0) {
byteOffset = targetBuffer.length + byteOffset;
}
if (buffer.length === 0) {
return byteOffset <= targetBuffer.length
? byteOffset
: targetBuffer.length;
}
return findLastIndex(targetBuffer, buffer, byteOffset);
}
if (buffer.length === 0) {
return byteOffset <= targetBuffer.length ? byteOffset : targetBuffer.length;
}
return indexOfNeedle(targetBuffer, buffer, byteOffset);
}
// TODO(Soremwar)
// Node's implementation is a very obscure algorithm that I haven't been able to crack just yet
function indexOfNumber(
targetBuffer: Uint8Array,
number: number,
byteOffset: number,
forwardDirection: boolean,
) {
const bytes = numberToBytes(number);
if (bytes.length > 1) {
throw new Error("Multi byte number search is not supported");
}
return indexOfBuffer(
targetBuffer,
numberToBytes(number),
byteOffset,
Encodings.UTF8,
forwardDirection,
);
}
export default { indexOfBuffer, indexOfNumber };
export { indexOfBuffer, indexOfNumber };