1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
// Copyright 2018-2024 the Deno authors. All rights reserved. MIT license.import { assertEquals } from "../assert/mod.ts";import { lastIndexOfNeedle } from "./last_index_of_needle.ts";
Deno.test("lastIndexOfNeedle1() handles repeating occurence", () => {  const i = lastIndexOfNeedle(    new Uint8Array([0, 1, 2, 0, 1, 2, 0, 1, 3]),    new Uint8Array([0, 1, 2]),  );  assertEquals(i, 3);});
Deno.test("lastIndexOfNeedle() handles single occurence", () => {  const i = lastIndexOfNeedle(    new Uint8Array([0, 1, 1]),    new Uint8Array([0, 1]),  );  assertEquals(i, 0);});
Deno.test("lastIndexOfNeedle() handles missing occurence", () => {  const i = lastIndexOfNeedle(new Uint8Array(), new Uint8Array([0, 1]));  assertEquals(i, -1);});
Deno.test("lastIndexOfNeedle() returns index of occurence after start", () => {  const i = lastIndexOfNeedle(    new Uint8Array([0, 1, 2, 0, 1, 2]),    new Uint8Array([0, 1]),    2,  );  assertEquals(i, 0);});
Deno.test("lastIndexOfNeedle() returns -1 with too small start", () => {  const i = lastIndexOfNeedle(    new Uint8Array([0, 1, 2, 0, 1, 2]),    new Uint8Array([0, 1]),    -1,  );  assertEquals(i, -1);});
Deno.test("lastIndexOfNeedle() returns index if start is greater than source index", () => {  const i = lastIndexOfNeedle(    new Uint8Array([0, 1, 2, 0, 1, 2]),    new Uint8Array([0, 1]),    7,  );  assertEquals(i, 3);});
Deno.test("lastIndexOfNeedle() returns -1 if needle doesn't exist within source", () => {  const i = lastIndexOfNeedle(    new Uint8Array([0, 1, 2, 0, 1, 2]),    new Uint8Array([2, 3]),  );  assertEquals(i, -1);});