std/bytes/index_of_needle_test.ts

84 lines
2.0 KiB
TypeScript
Raw Permalink Normal View History

// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.
import { indexOfNeedle } from "./index_of_needle.ts";
import { assertEquals } from "@std/assert";
Deno.test("indexOfNeedle() handles repeating occurrence", () => {
const i = indexOfNeedle(
new Uint8Array([1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 3]),
new Uint8Array([0, 1, 2]),
);
assertEquals(i, 2);
});
Deno.test("indexOfNeedle() handles single occurrence", () => {
const i = indexOfNeedle(new Uint8Array([0, 0, 1]), new Uint8Array([0, 1]));
assertEquals(i, 1);
});
Deno.test("indexOfNeedle() handles text encoded occurrence", () => {
const encoder = new TextEncoder();
const i = indexOfNeedle(encoder.encode("Deno"), encoder.encode("D"));
assertEquals(i, 0);
});
Deno.test("indexOfNeedle() handles missing occurrence", () => {
const i = indexOfNeedle(new Uint8Array(), new Uint8Array([0, 1]));
assertEquals(i, -1);
});
Deno.test("indexOfNeedle() returns index of occurrence after start", () => {
const i = indexOfNeedle(
new Uint8Array([0, 1, 2, 0, 1, 2]),
new Uint8Array([0, 1]),
1,
);
assertEquals(i, 3);
});
Deno.test("indexOfNeedle() returns -1 if occurrence is before start", () => {
const i = indexOfNeedle(
new Uint8Array([0, 1, 2, 0, 1, 2]),
new Uint8Array([0, 1]),
7,
);
assertEquals(i, -1);
});
Deno.test("indexOfNeedle() handles start index less than 0", () => {
assertEquals(
indexOfNeedle(
new Uint8Array([0, 1, 2, 0, 1, 2]),
new Uint8Array([0, 1]),
3,
),
3,
);
assertEquals(
indexOfNeedle(
new Uint8Array([0, 1, 2, 1, 1, 2]),
new Uint8Array([0, 1]),
3,
),
-1,
);
});
Deno.test("indexOfNeedle() handles negative start index", () => {
assertEquals(
indexOfNeedle(
new Uint8Array([0, 1, 2, 0, 1, 2]),
new Uint8Array([0, 1]),
-3,
),
3,
);
assertEquals(
indexOfNeedle(
new Uint8Array([0, 1, 2, 1, 1, 2]),
new Uint8Array([0, 1]),
-3,
),
-1,
);
});