3 files changed, 73 insertions, 75 deletions
diff --git a/bytes/bytes_test.ts b/bytes/bytes_test.ts
deleted file mode 100644
index e53f81fcd..000000000
--- a/bytes/bytes_test.ts
+++ /dev/null
@@ -1,74 +0,0 @@
-// Copyright 2018-2019 the Deno authors. All rights reserved. MIT license.
-
-import { findIndex, findLastIndex, equal, hasPrefix, repeat } from "./bytes.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);
-    }
-  }
-});
diff --git a/bytes/bytes.ts b/bytes/mod.ts
index a42eaffd2..a42eaffd2 100644
--- a/bytes/bytes.ts
+++ b/bytes/mod.ts
diff --git a/bytes/test.ts b/bytes/test.ts
index 711bf62c4..0a779dd3d 100644
--- a/bytes/test.ts
+++ b/bytes/test.ts
@@ -1,2 +1,74 @@
 // Copyright 2018-2019 the Deno authors. All rights reserved. MIT license.
-import "./bytes_test.ts";
+
+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);
+    }
+  }
+});