1 files changed, 7 insertions, 8 deletions
diff --git a/std/bytes/test.ts b/std/bytes/test.ts
index fc7089c2f..c1609ebdc 100644
--- a/std/bytes/test.ts
+++ b/std/bytes/test.ts
@@ -1,10 +1,9 @@
 // Copyright 2018-2020 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 {
+Deno.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])
@@ -12,12 +11,12 @@ test(function bytesfindIndex1(): void {
   assertEquals(i, 2);
 });
 
-test(function bytesfindIndex2(): void {
+Deno.test(function bytesfindIndex2(): void {
   const i = findIndex(new Uint8Array([0, 0, 1]), new Uint8Array([0, 1]));
   assertEquals(i, 1);
 });
 
-test(function bytesfindLastIndex1(): void {
+Deno.test(function bytesfindLastIndex1(): void {
   const i = findLastIndex(
     new Uint8Array([0, 1, 2, 0, 1, 2, 0, 1, 3]),
     new Uint8Array([0, 1, 2])
@@ -25,22 +24,22 @@ test(function bytesfindLastIndex1(): void {
   assertEquals(i, 3);
 });
 
-test(function bytesfindLastIndex2(): void {
+Deno.test(function bytesfindLastIndex2(): void {
   const i = findLastIndex(new Uint8Array([0, 1, 1]), new Uint8Array([0, 1]));
   assertEquals(i, 0);
 });
 
-test(function bytesBytesequal(): void {
+Deno.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 {
+Deno.test(function byteshasPrefix(): void {
   const v = hasPrefix(new Uint8Array([0, 1, 2]), new Uint8Array([0, 1]));
   assertEquals(v, true);
 });
 
-test(function bytesrepeat(): void {
+Deno.test(function bytesrepeat(): void {
   // input / output / count / error message
   const repeatTestCase = [
     ["", "", 0],