summaryrefslogtreecommitdiff
path: root/std/bytes/test.ts
diff options
context:
space:
mode:
authorRyan Dahl <ry@tinyclouds.org>2019-10-10 05:31:23 -0400
committerGitHub <noreply@github.com>2019-10-10 05:31:23 -0400
commite7562eed8c816cd0d97aab6b818d7c8453dbaa2b (patch)
treec5a9f536e79d2c8d2d02897511a9138acaf35394 /std/bytes/test.ts
parent3882c9d19a641e0c919f1350d87c6d7ee280cf78 (diff)
parent93f7f00c956c14620ef031626f124b57397ca867 (diff)
Merge deno_std in main repo (#3091)
The history of deno_std is persevered but rewritten to update links to issues and PRs Fixes denoland/deno_std#603
Diffstat (limited to 'std/bytes/test.ts')
m---------std0
-rw-r--r--std/bytes/test.ts74
2 files changed, 74 insertions, 0 deletions
diff --git a/std b/std
deleted file mode 160000
-Subproject 43aafbf33285753e7b42230f0eb7969b300f71c
diff --git a/std/bytes/test.ts b/std/bytes/test.ts
new file mode 100644
index 000000000..0a779dd3d
--- /dev/null
+++ b/std/bytes/test.ts
@@ -0,0 +1,74 @@
+// Copyright 2018-2019 the Deno authors. All rights reserved. MIT license.
+
+import { findIndex, findLastIndex, equal, hasPrefix, repeat } from "./mod.ts";
+import { test } from "../testing/mod.ts";
+import { assertEquals, assertThrows } from "../testing/asserts.ts";
+
+test(function bytesfindIndex1(): void {
+ const i = findIndex(
+ new Uint8Array([1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 3]),
+ new Uint8Array([0, 1, 2])
+ );
+ assertEquals(i, 2);
+});
+
+test(function bytesfindIndex2(): void {
+ const i = findIndex(new Uint8Array([0, 0, 1]), new Uint8Array([0, 1]));
+ assertEquals(i, 1);
+});
+
+test(function bytesfindLastIndex1(): void {
+ const i = findLastIndex(
+ new Uint8Array([0, 1, 2, 0, 1, 2, 0, 1, 3]),
+ new Uint8Array([0, 1, 2])
+ );
+ assertEquals(i, 3);
+});
+
+test(function bytesfindLastIndex2(): void {
+ const i = findLastIndex(new Uint8Array([0, 1, 1]), new Uint8Array([0, 1]));
+ assertEquals(i, 0);
+});
+
+test(function bytesBytesequal(): void {
+ const v = equal(new Uint8Array([0, 1, 2, 3]), new Uint8Array([0, 1, 2, 3]));
+ assertEquals(v, true);
+});
+
+test(function byteshasPrefix(): void {
+ const v = hasPrefix(new Uint8Array([0, 1, 2]), new Uint8Array([0, 1]));
+ assertEquals(v, true);
+});
+
+test(function bytesrepeat(): void {
+ // input / output / count / error message
+ const repeatTestCase = [
+ ["", "", 0],
+ ["", "", 1],
+ ["", "", 1.1, "bytes: repeat count must be an integer"],
+ ["", "", 2],
+ ["", "", 0],
+ ["-", "", 0],
+ ["-", "-", -1, "bytes: negative repeat count"],
+ ["-", "----------", 10],
+ ["abc ", "abc abc abc ", 3]
+ ];
+ for (const [input, output, count, errMsg] of repeatTestCase) {
+ if (errMsg) {
+ assertThrows(
+ (): void => {
+ repeat(new TextEncoder().encode(input as string), count as number);
+ },
+ Error,
+ errMsg as string
+ );
+ } else {
+ const newBytes = repeat(
+ new TextEncoder().encode(input as string),
+ count as number
+ );
+
+ assertEquals(new TextDecoder().decode(newBytes), output);
+ }
+ }
+});