1
0
Fork 0
mirror of https://github.com/denoland/deno.git synced 2024-11-26 16:09:27 -05:00
denoland-deno/std/bytes
2020-04-30 16:39:25 -04:00
..
mod.ts BREAKING: reorder std/io/utils copyBytes arguments (#5022) 2020-04-30 16:39:25 -04:00
README.md create readme for std/bytes (#4876) 2020-04-24 14:24:29 -04:00
test.ts Move encode, decode helpers to /std/encoding/utf8.ts, delete /std/strings/ (#4565) 2020-04-01 15:23:39 -04:00

bytes

bytes module is made to provide helpers to manipulation of bytes slice.

usage

All the following functions are exposed in mod.ts

findIndex

Find first index of binary pattern from given binary array.

import { findIndex } from "https://deno.land/std/bytes/mod.ts";

findIndex(
  new Uint8Array([1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 3]),
  new Uint8Array([0, 1, 2])
);

// => returns 2

findLastIndex

Find last index of binary pattern from given binary array.

import { findLastIndex } from "https://deno.land/std/bytes/mod.ts";

findLastIndex(
  new Uint8Array([0, 1, 2, 0, 1, 2, 0, 1, 3]),
  new Uint8Array([0, 1, 2])
);

// => returns 3

equal

Check whether given binary arrays are equal to each other.

import { equal } from "https://deno.land/std/bytes/mod.ts";

equal(new Uint8Array([0, 1, 2, 3]), new Uint8Array([0, 1, 2, 3])); // returns true
equal(new Uint8Array([0, 1, 2, 3]), new Uint8Array([0, 1, 2, 4])); // returns false

hasPrefix

Check whether binary array has binary prefix.

import { hasPrefix } from "https://deno.land/std/bytes/mod.ts";

hasPrefix(new Uint8Array([0, 1, 2]), new Uint8Array([0, 1])); // returns true
hasPrefix(new Uint8Array([0, 1, 2]), new Uint8Array([1, 2])); // returns false

repeat

Repeat bytes of given binary array and return new one.

import { repeat } from "https://deno.land/std/bytes/mod.ts";

repeat(new Uint8Array([1]), 3); // returns Uint8Array(3) [ 1, 1, 1 ]

concat

Concatenate two binary arrays and return new one.

import { concat } from "https://deno.land/std/bytes/mod.ts";

concat(new Uint8Array([1, 2]), new Uint8Array([3, 4])); // returns Uint8Array(4) [ 1, 2, 3, 4 ]