mirror of
https://github.com/denoland/deno.git
synced 2024-12-11 18:17:48 -05:00
ce75e31625
This commit changes "include_js_files!" macro from "deno_core" in a way that "dir" option doesn't cause specifiers to be rewritten to include it. Example: ``` include_js_files! { dir "js", "hello.js", } ``` The above definition required embedders to use: `import ... from "internal:<ext_name>/js/hello.js"`. But with this change, the "js" directory in which the files are stored is an implementation detail, which for embedders results in: `import ... from "internal:<ext_name>/hello.js"`. The directory the files are stored in, is an implementation detail and in some cases might result in a significant size difference for the snapshot. As an example, in "deno_node" extension, we store the source code in "polyfills" directory; which resulted in each specifier to look like "internal:deno_node/polyfills/<module_name>", but with this change it's "internal:deno_node/<module_name>". Given that "deno_node" has over 100 files, many of them having several import specifiers to the same extension, this change removes 10 characters from each import specifier.
160 lines
4 KiB
TypeScript
160 lines
4 KiB
TypeScript
// Copyright 2018-2023 the Deno authors. All rights reserved. MIT license.
|
|
import { Encodings } from "internal: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 };
|