@visulima/bytes 1.0.0 → 2.0.0

package/CHANGELOG.md

@@ -1,3 +1,27 @@
+## @visulima/bytes [2.0.0](https://github.com/visulima/visulima/compare/@visulima/bytes@1.0.1...@visulima/bytes@2.0.0) (2025-10-15)
+
+### ⚠ BREAKING CHANGES
+
+* Adjusted the node engine requirement to support versions 20.19 and above
+
+### Bug Fixes
+
+* Adjusted the node engine requirement to support versions 20.19 and above ([e07d813](https://github.com/visulima/visulima/commit/e07d813093c1d731fc775cfecb6c19868c08671f))
+* update @visulima/packem to 2.0.0-alpha.30 across multiple packages for improved compatibility ([27b346e](https://github.com/visulima/visulima/commit/27b346eaa1c0fb0e420d9a9824482028307f4249))
+
+### Miscellaneous Chores
+
+* add Prettier configuration and update ESLint ignore patterns ([a9ba959](https://github.com/visulima/visulima/commit/a9ba959fae02a08b158b3b81a634a8fba8326b92))
+* **deps:** update build scripts and remove cross-env dependency ([7510e82](https://github.com/visulima/visulima/commit/7510e826b9235a0013fe61c82a7eb333bc4cbb78))
+* update package dependencies across multiple packages for improved compatibility and performance ([9567591](https://github.com/visulima/visulima/commit/9567591c415da3002f3a4fe08f8caf7ce01ca5f7))
+* update package.json and pnpm-lock.yaml to include publint@0.3.12 and adjust build/test commands to exclude shared-utils ([1f7b3c0](https://github.com/visulima/visulima/commit/1f7b3c0381d77edfeec80ea1bf57b3469e929414))
+
+## @visulima/bytes [1.0.1](https://github.com/visulima/visulima/compare/@visulima/bytes@1.0.0...@visulima/bytes@1.0.1) (2025-09-10)
+
+### Bug Fixes
+
+* **bytes:** restore require exports in package.json and add validation to packem.config.ts ([762b1f5](https://github.com/visulima/visulima/commit/762b1f5789398617032ef23f06763c4fd9f41eda))
+
 ## @visulima/bytes 1.0.0 (2025-06-03)
 
 ### Features

package/README.md

@@ -62,6 +62,7 @@ assert.deepStrictEqual(concat([a, b]), new Uint8Array([0, 1, 2, 3, 4, 5]));
 Copies bytes from the source array to the destination array.
 
 **Basic usage:**
+
 ```typescript
 import { copy } from "@visulima/bytes";
 import assert from "node:assert";
@@ -74,6 +75,7 @@ assert.deepStrictEqual(dst, new Uint8Array([9, 8, 7, 3, 4, 5]));
 ```
 
 **Copy with offset:**
+
 ```typescript
 import { copy } from "@visulima/bytes";
 import assert from "node:assert";
@@ -120,6 +122,7 @@ assert.deepStrictEqual(equals(a, c), false);
 Determines whether a byte slice contains a specific sequence of bytes.
 
 **Basic usage:**
+
 ```typescript
 import { includesNeedle } from "@visulima/bytes";
 import assert from "node:assert";
@@ -131,6 +134,7 @@ assert.deepStrictEqual(includesNeedle(source, needle), true);
 ```
 
 **With start index:**
+
 ```typescript
 import { includesNeedle } from "@visulima/bytes";
 import assert from "node:assert";
@@ -147,6 +151,7 @@ assert.deepStrictEqual(includesNeedle(source, needle, 6), false);
 Finds the first index of a specific sequence of bytes within a byte slice.
 
 **Basic usage:**
+
 ```typescript
 import { indexOfNeedle } from "@visulima/bytes";
 import assert from "node:assert";
@@ -160,6 +165,7 @@ assert.deepStrictEqual(indexOfNeedle(source, notNeedle), -1);
 ```
 
 **With start index:**
+
 ```typescript
 import { indexOfNeedle } from "@visulima/bytes";
 import assert from "node:assert";
@@ -176,6 +182,7 @@ assert.deepStrictEqual(indexOfNeedle(source, needle, 6), -1);
 Finds the last index of a specific sequence of bytes within a byte slice.
 
 **Basic usage:**
+
 ```typescript
 import { lastIndexOfNeedle } from "@visulima/bytes";
 import assert from "node:assert";
@@ -189,6 +196,7 @@ assert.deepStrictEqual(lastIndexOfNeedle(source, notNeedle), -1);
 ```
 
 **With start index:**
+
 ```typescript
 import { lastIndexOfNeedle } from "@visulima/bytes";
 import assert from "node:assert";
@@ -205,6 +213,7 @@ assert.deepStrictEqual(lastIndexOfNeedle(source, needle, 6), 5);
 Repeats a byte slice a specified number of times.
 
 **Basic usage:**
+
 ```typescript
 import { repeat } from "@visulima/bytes";
 import assert from "node:assert";
@@ -215,6 +224,7 @@ assert.deepStrictEqual(repeat(source, 3), new Uint8Array([0, 1, 2, 0, 1, 2, 0, 1
 ```
 
 **Zero count:**
+
 ```typescript
 import { repeat } from "@visulima/bytes";
 import assert from "node:assert";
@@ -242,20 +252,20 @@ assert.deepStrictEqual(startsWith(source, prefix), true);
 
 This package provides the following utility functions for working with `Uint8Array`s, similar to the Deno standard library module [`@std/bytes`](https://github.com/denoland/std/tree/main/bytes):
 
-*   **`concat`**: Concatenate an array of byte slices into a single slice.
-*   **`copy`**: Copy bytes from the source array to the destination array and returns the number of bytes copied.
-*   **`endsWith`**: Returns true if the suffix array appears at the end of the source array, false otherwise.
-*   **`equals`**: Check whether byte slices are equal to each other.
-*   **`includesNeedle`**: Determines whether the source array contains the needle array.
-*   **`indexOfNeedle`**: Returns the index of the first occurrence of the needle array in the source array, or -1 if it is not present.
-*   **`lastIndexOfNeedle`**: Returns the index of the last occurrence of the needle array in the source array, or -1 if it is not present.
-*   **`repeat`**: Returns a new byte slice composed of count repetitions of the source array.
-*   **`startsWith`**: Returns true if the prefix array appears at the start of the source array, false otherwise.
-*   **`bufferToUint8Array(buf: Buffer): Uint8Array`**: Converts a Node.js `Buffer` to a `Uint8Array`.
-*   **`isUint8Array(x: unknown): x is Uint8Array`**: Checks if a value is a `Uint8Array` or (in Node.js) a `Buffer`.
-*   **`asciiToUint8Array(txt: TemplateStringsArray | string | [string]): Uint8Array`**: Converts an ASCII string to a `Uint8Array`.
-*   **`utf8ToUint8Array(txt: TemplateStringsArray | string | [string]): Uint8Array`**: Converts a UTF-8 string to a `Uint8Array` (requires Node.js `Buffer` support).
-*   **`toUint8Array(data: unknown): Uint8Array`**: Attempts to convert various data types (like `ArrayBuffer`, `Array` of numbers, `Buffer`, strings via `Buffer.from`) to a `Uint8Array`.
+- **`concat`**: Concatenate an array of byte slices into a single slice.
+- **`copy`**: Copy bytes from the source array to the destination array and returns the number of bytes copied.
+- **`endsWith`**: Returns true if the suffix array appears at the end of the source array, false otherwise.
+- **`equals`**: Check whether byte slices are equal to each other.
+- **`includesNeedle`**: Determines whether the source array contains the needle array.
+- **`indexOfNeedle`**: Returns the index of the first occurrence of the needle array in the source array, or -1 if it is not present.
+- **`lastIndexOfNeedle`**: Returns the index of the last occurrence of the needle array in the source array, or -1 if it is not present.
+- **`repeat`**: Returns a new byte slice composed of count repetitions of the source array.
+- **`startsWith`**: Returns true if the prefix array appears at the start of the source array, false otherwise.
+- **`bufferToUint8Array(buf: Buffer): Uint8Array`**: Converts a Node.js `Buffer` to a `Uint8Array`.
+- **`isUint8Array(x: unknown): x is Uint8Array`**: Checks if a value is a `Uint8Array` or (in Node.js) a `Buffer`.
+- **`asciiToUint8Array(txt: TemplateStringsArray | string | [string]): Uint8Array`**: Converts an ASCII string to a `Uint8Array`.
+- **`utf8ToUint8Array(txt: TemplateStringsArray | string | [string]): Uint8Array`**: Converts a UTF-8 string to a `Uint8Array` (requires Node.js `Buffer` support).
+- **`toUint8Array(data: unknown): Uint8Array`**: Attempts to convert various data types (like `ArrayBuffer`, `Array` of numbers, `Buffer`, strings via `Buffer.from`) to a `Uint8Array`.
 
 ## Related
 
@@ -309,7 +319,7 @@ assert.deepStrictEqual(templateAscii, new Uint8Array([87, 111, 114, 108, 100]));
 
 Converts a UTF-8 string to a `Uint8Array`.
 
-```typescript
+````typescript
 import { utf8ToUint8Array } from "@visulima/bytes";
 import assert from "node:assert";
 
@@ -351,7 +361,7 @@ try {
 } catch (e: any) {
   assert.strictEqual(e.message, "UINT8ARRAY_INCOMPATIBLE: Cannot convert data to Uint8Array");
 }
-```
+````
 
 ## Supported Node.js Versions
 
@@ -366,9 +376,9 @@ If you would like to help take a look at the [list of issues](https://github.com
 
 ## Credits
 
--   The Deno Standard Library authors and contributors for their work on `@std/bytes`.
--   [Daniel Bannert](https://github.com/prisis)
--   [All Contributors](https://github.com/visulima/visulima/graphs/contributors)
+- The Deno Standard Library authors and contributors for their work on `@std/bytes`.
+- [Daniel Bannert](https://github.com/prisis)
+- [All Contributors](https://github.com/visulima/visulima/graphs/contributors)
 
 ## License
 

package/dist/index.js

@@ -0,0 +1 @@
+var y=Object.defineProperty;var s=(r,e)=>y(r,"name",{value:e,configurable:!0});import{createRequire as c}from"node:module";import{concat as h}from"./packem_shared/concat-Duja_Ciy.js";import{copy as w}from"./packem_shared/copy-CnXBfu7-.js";import{endsWith as j}from"./packem_shared/endsWith-BAFUPkAB.js";import{equals as O}from"./packem_shared/equals-CWGyNSTK.js";import{includesNeedle as I}from"./packem_shared/includesNeedle-hNG5BH2U.js";import{indexOfNeedle as C}from"./packem_shared/indexOfNeedle-C-5C1j-5.js";import{lastIndexOfNeedle as P}from"./packem_shared/lastIndexOfNeedle-wezgBke2.js";import{repeat as S}from"./packem_shared/repeat-BdWX5U9j.js";import{startsWith as L}from"./packem_shared/startsWith-DXk4IAVe.js";const p=c(import.meta.url),o=typeof globalThis<"u"&&typeof globalThis.process<"u"?globalThis.process:process,A=s(r=>{if(typeof o<"u"&&o.versions&&o.versions.node){const[e,n]=o.versions.node.split(".").map(Number);if(e>22||e===22&&n>=3||e===20&&n>=16)return o.getBuiltinModule(r)}return p(r)},"__cjs_getBuiltinModule"),{Buffer:t}=A("node:buffer");var l=Object.defineProperty,a=s((r,e)=>l(r,"name",{value:e,configurable:!0}),"i");const f=a(r=>new Uint8Array(r.buffer,r.byteOffset,r.length),"bufferToUint8Array"),_=typeof t=="function"?r=>r instanceof Uint8Array||t.isBuffer(r):r=>r instanceof Uint8Array,d=a(r=>{if(typeof r=="string")return d([r]);const[e]=Array.isArray(r)?r:[String.raw(r)],n=e.length,u=new Uint8Array(n);for(let i=0;i<n;i+=1)u[i]=e.charCodeAt(i)&255;return u},"asciiToUint8Array"),m=a(r=>{if(typeof r=="string")return m([r]);const[e]=Array.isArray(r)?r:[String.raw(r)];return f(t.from(e,"utf8"))},"utf8ToUint8Array"),b=a(r=>{if(typeof t=="function"&&t.isBuffer(r))return f(r);if(r instanceof Uint8Array)return r;if(r instanceof ArrayBuffer)return new Uint8Array(r);if(Array.isArray(r)&&r.every(e=>typeof e=="number"))return new Uint8Array(r);if(typeof t=="function"){if(t.isBuffer(r))return f(r);if(typeof r=="string")try{return f(t.from(r))}catch{}}throw new Error("UINT8ARRAY_INCOMPATIBLE: Cannot convert data to Uint8Array")},"toUint8Array");export{d as asciiToUint8Array,f as bufferToUint8Array,h as concat,w as copy,j as endsWith,O as equals,I as includesNeedle,C as indexOfNeedle,_ as isUint8Array,P as lastIndexOfNeedle,S as repeat,L as startsWith,b as toUint8Array,m as utf8ToUint8Array};

package/dist/packem_shared/concat-Duja_Ciy.js

@@ -0,0 +1 @@
+var a=Object.defineProperty;var o=(e,n)=>a(e,"name",{value:n,configurable:!0});var f=Object.defineProperty,l=o((e,n)=>f(e,"name",{value:n,configurable:!0}),"f");function u(e){let n=0;for(const t of e)n+=t.length;const r=new Uint8Array(n);let c=0;for(const t of e)r.set(t,c),c+=t.length;return r}o(u,"concat");l(u,"concat");export{u as concat};

package/dist/packem_shared/copy-CnXBfu7-.js

@@ -0,0 +1 @@
+var y=Object.defineProperty;var r=(e,t)=>y(e,"name",{value:t,configurable:!0});var b=Object.defineProperty,o=r((e,t)=>b(e,"name",{value:t,configurable:!0}),"y");function c(e,t,a=0){a=Math.max(0,Math.min(a,t.byteLength));const n=t.byteLength-a;return e.byteLength>n&&(e=e.subarray(0,n)),t.set(e,a),e.byteLength}r(c,"copy");o(c,"copy");export{c as copy};

package/dist/packem_shared/endsWith-BAFUPkAB.js

@@ -0,0 +1 @@
+var l=Object.defineProperty;var t=(r,e)=>l(r,"name",{value:e,configurable:!0});var u=Object.defineProperty,a=t((r,e)=>u(r,"name",{value:e,configurable:!0}),"l");function i(r,e){const f=r.length-e.length;if(f<0)return!1;for(let n=e.length-1;n>=0;n--)if(r[f+n]!==e[n])return!1;return!0}t(i,"endsWith");a(i,"endsWith");export{i as endsWith};

package/dist/packem_shared/equals-CWGyNSTK.js

@@ -0,0 +1 @@
+var c=Object.defineProperty;var l=(e,f)=>c(e,"name",{value:f,configurable:!0});var h=Object.defineProperty,a=l((e,f)=>h(e,"name",{value:f,configurable:!0}),"l");function o(e,f){for(let t=0;t<f.length;t++)if(e[t]!==f[t])return!1;return!0}l(o,"i");a(o,"equalsNaive");function i(e,f){const t=e.length,n=3-(e.byteOffset+3)%4,u=Math.floor((t-n)/4),s=new Uint32Array(e.buffer,e.byteOffset+n,u),b=new Uint32Array(f.buffer,f.byteOffset+n,u);for(let r=0;r<n;r++)if(e[r]!==f[r])return!1;for(let r=0;r<s.length;r++)if(s[r]!==b[r])return!1;for(let r=n+u*4;r<t;r++)if(e[r]!==f[r])return!1;return!0}l(i,"a");a(i,"equals32Bit");const y=160;function g(e,f){return e.length!==f.length?!1:e.length>=y&&e.byteOffset%4===f.byteOffset%4?i(e,f):o(e,f)}l(g,"equals");a(g,"equals");export{g as equals};

package/dist/packem_shared/includesNeedle-hNG5BH2U.js

@@ -0,0 +1 @@
+var d=Object.defineProperty;var n=(e,r)=>d(e,"name",{value:r,configurable:!0});import{indexOfNeedle as l}from"./indexOfNeedle-C-5C1j-5.js";var t=Object.defineProperty,u=n((e,r)=>t(e,"name",{value:r,configurable:!0}),"r");function o(e,r,i=0){return l(e,r,i)!==-1}n(o,"includesNeedle");u(o,"includesNeedle");export{o as includesNeedle};

package/dist/packem_shared/indexOfNeedle-C-5C1j-5.js

@@ -0,0 +1 @@
+var o=Object.defineProperty;var g=(e,n)=>o(e,"name",{value:n,configurable:!0});var u=Object.defineProperty,a=g((e,n)=>u(e,"name",{value:n,configurable:!0}),"g");function c(e,n,t=0){if(t<0&&(t=Math.max(0,e.length+t)),n.length>e.length-t)return-1;const h=n[0];for(let r=t;r<e.length;r++){if(e[r]!==h)continue;let l=1,f=r+1;for(;l<n.length&&e[f]===n[f-r];)l++,f++;if(l===n.length)return r}return-1}g(c,"indexOfNeedle");a(c,"indexOfNeedle");export{c as indexOfNeedle};

package/dist/packem_shared/lastIndexOfNeedle-wezgBke2.js

@@ -0,0 +1 @@
+var o=Object.defineProperty;var f=(l,e)=>o(l,"name",{value:e,configurable:!0});var u=Object.defineProperty,a=f((l,e)=>u(l,"name",{value:e,configurable:!0}),"f");function g(l,e,t=l.length-1){if(t<0)return-1;t>=l.length&&(t=l.length-1);const i=e[e.length-1];for(let n=t;n>=0;n--){if(l[n]!==i)continue;let r=1,h=n;for(;r<e.length&&l[--h]===e[e.length-1-(n-h)];)r++;if(r===e.length)return n-e.length+1}return-1}f(g,"lastIndexOfNeedle");a(g,"lastIndexOfNeedle");export{g as lastIndexOfNeedle};

package/dist/packem_shared/repeat-BdWX5U9j.js

@@ -0,0 +1 @@
+var a=Object.defineProperty;var o=(r,e)=>a(r,"name",{value:e,configurable:!0});import{copy as i}from"./copy-CnXBfu7-.js";var u=Object.defineProperty,g=o((r,e)=>u(r,"name",{value:e,configurable:!0}),"i");function f(r,e){if(e<0||!Number.isInteger(e))throw new RangeError("Count must be a non-negative integer");const n=new Uint8Array(r.length*e);let t=0;for(;t<n.length;)t+=i(r,n,t);return n}o(f,"repeat");g(f,"repeat");export{f as repeat};

package/dist/packem_shared/startsWith-DXk4IAVe.js

@@ -0,0 +1 @@
+var a=Object.defineProperty;var n=(r,e)=>a(r,"name",{value:e,configurable:!0});var l=Object.defineProperty,f=n((r,e)=>l(r,"name",{value:e,configurable:!0}),"r");function u(r,e){if(e.length>r.length)return!1;for(let t=0;t<e.length;t++)if(r[t]!==e[t])return!1;return!0}n(u,"startsWith");f(u,"startsWith");export{u as startsWith};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@visulima/bytes",
-  "version": "1.0.0",
+  "version": "2.0.0",
   "description": "Utility functions to make dealing with Uint8Arrays easier",
   "keywords": [
     "visulima",
@@ -34,35 +34,18 @@
   "type": "module",
   "exports": {
     ".": {
-      "require": {
-        "types": "./dist/index.d.cts",
-        "default": "./dist/index.cjs"
-      },
-      "import": {
-        "types": "./dist/index.d.mts",
-        "default": "./dist/index.mjs"
-      }
+      "types": "./dist/index.d.ts",
+      "default": "./dist/index.js"
     },
     "./package.json": "./package.json"
   },
-  "main": "dist/index.cjs",
-  "module": "dist/index.mjs",
-  "browser": "./dist/index.mjs",
-  "types": "dist/index.d.ts",
-  "typesVersions": {
-    ">=5.0": {
-      ".": [
-        "./dist/index.d.ts"
-      ]
-    }
-  },
   "files": [
     "dist",
     "README.md",
     "CHANGELOG.md"
   ],
   "engines": {
-    "node": ">=20.18 <=24.x"
+    "node": ">=20.19 <=24.x"
   },
   "publishConfig": {
     "access": "public",

package/dist/index.cjs

@@ -1,76 +0,0 @@
-'use strict';
-
-Object.defineProperties(exports, { __esModule: { value: true }, [Symbol.toStringTag]: { value: 'Module' } });
-
-const node_buffer = require('node:buffer');
-const concat = require('./packem_shared/concat-DO5DD91d.cjs');
-const copy = require('./packem_shared/copy-Bx6bRT8N.cjs');
-const endsWith = require('./packem_shared/endsWith-D8qAxWS-.cjs');
-const equals = require('./packem_shared/equals-lBip8nIE.cjs');
-const includesNeedle = require('./packem_shared/includesNeedle-rD-vGkdN.cjs');
-const indexOfNeedle = require('./packem_shared/indexOfNeedle-ByhaFu9G.cjs');
-const lastIndexOfNeedle = require('./packem_shared/lastIndexOfNeedle-Bw_wLjkK.cjs');
-const repeat = require('./packem_shared/repeat-BBMZqtbD.cjs');
-const startsWith = require('./packem_shared/startsWith-BOQEkHrk.cjs');
-
-var __defProp = Object.defineProperty;
-var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
-const bufferToUint8Array = /* @__PURE__ */ __name((buf) => new Uint8Array(buf.buffer, buf.byteOffset, buf.length), "bufferToUint8Array");
-const isUint8Array = typeof node_buffer.Buffer === "function" ? (x) => x instanceof Uint8Array || node_buffer.Buffer.isBuffer(x) : (x) => x instanceof Uint8Array;
-const asciiToUint8Array = /* @__PURE__ */ __name((txt) => {
-  if (typeof txt === "string")
-    return asciiToUint8Array([txt]);
-  const [input] = Array.isArray(txt) ? txt : [String.raw(txt)];
-  const inputLength = input.length;
-  const result = new Uint8Array(inputLength);
-  for (let index = 0; index < inputLength; index += 1) {
-    result[index] = input.charCodeAt(index) & 255;
-  }
-  return result;
-}, "asciiToUint8Array");
-const utf8ToUint8Array = /* @__PURE__ */ __name((txt) => {
-  if (typeof txt === "string")
-    return utf8ToUint8Array([txt]);
-  const [input] = Array.isArray(txt) ? txt : [String.raw(txt)];
-  return bufferToUint8Array(node_buffer.Buffer.from(input, "utf8"));
-}, "utf8ToUint8Array");
-const toUint8Array = /* @__PURE__ */ __name((data) => {
-  if (typeof node_buffer.Buffer === "function" && node_buffer.Buffer.isBuffer(data)) {
-    return bufferToUint8Array(data);
-  }
-  if (data instanceof Uint8Array) {
-    return data;
-  }
-  if (data instanceof ArrayBuffer)
-    return new Uint8Array(data);
-  if (Array.isArray(data) && data.every((item) => typeof item === "number")) {
-    return new Uint8Array(data);
-  }
-  if (typeof node_buffer.Buffer === "function") {
-    if (node_buffer.Buffer.isBuffer(data)) {
-      return bufferToUint8Array(data);
-    }
-    if (typeof data === "string") {
-      try {
-        return bufferToUint8Array(node_buffer.Buffer.from(data));
-      } catch {
-      }
-    }
-  }
-  throw new Error("UINT8ARRAY_INCOMPATIBLE: Cannot convert data to Uint8Array");
-}, "toUint8Array");
-
-exports.concat = concat.concat;
-exports.copy = copy.copy;
-exports.endsWith = endsWith.endsWith;
-exports.equals = equals.equals;
-exports.includesNeedle = includesNeedle.includesNeedle;
-exports.indexOfNeedle = indexOfNeedle.indexOfNeedle;
-exports.lastIndexOfNeedle = lastIndexOfNeedle.lastIndexOfNeedle;
-exports.repeat = repeat.repeat;
-exports.startsWith = startsWith.startsWith;
-exports.asciiToUint8Array = asciiToUint8Array;
-exports.bufferToUint8Array = bufferToUint8Array;
-exports.isUint8Array = isUint8Array;
-exports.toUint8Array = toUint8Array;
-exports.utf8ToUint8Array = utf8ToUint8Array;

package/dist/index.d.cts

@@ -1,287 +0,0 @@
-import { Buffer } from 'node:buffer';
-
-/**
- * Concatenate an array of byte slices into a single slice.
- *
- * @param buffers Array of byte slices to concatenate.
- * @returns A new byte slice containing all the input slices concatenated.
- *
- * @example Basic usage
- * ```ts
- * import { concat } from "@std/bytes/concat";
- * import { assertEquals } from "@std/assert";
- *
- * const a = new Uint8Array([0, 1, 2]);
- * const b = new Uint8Array([3, 4, 5]);
- *
- * assertEquals(concat([a, b]), new Uint8Array([0, 1, 2, 3, 4, 5]));
- * ```
- */ declare function concat(buffers: readonly Uint8Array[]): Uint8Array_;
-
-/**
- * Copy bytes from the source array to the destination array and returns the
- * number of bytes copied.
- *
- * If the source array is larger than what the `dst` array can hold, only the
- * amount of bytes that fit in the `dst` array are copied.
- *
- * @param src Source array to copy from.
- * @param dst Destination array to copy to.
- * @param offset Offset in the destination array to start copying to. Defaults
- * to 0.
- * @returns Number of bytes copied.
- *
- * @example Basic usage
- * ```ts
- * import { copy } from "@std/bytes/copy";
- * import { assertEquals } from "@std/assert";
- *
- * const src = new Uint8Array([9, 8, 7]);
- * const dst = new Uint8Array([0, 1, 2, 3, 4, 5]);
- *
- * assertEquals(copy(src, dst), 3);
- * assertEquals(dst, new Uint8Array([9, 8, 7, 3, 4, 5]));
- * ```
- *
- * @example Copy with offset
- * ```ts
- * import { copy } from "@std/bytes/copy";
- * import { assertEquals } from "@std/assert";
- *
- * const src = new Uint8Array([1, 1, 1, 1]);
- * const dst = new Uint8Array([0, 0, 0, 0]);
- *
- * assertEquals(copy(src, dst, 1), 3);
- * assertEquals(dst, new Uint8Array([0, 1, 1, 1]));
- * ```
- * Defining an offset will start copying at the specified index in the
- * destination array.
- */ declare function copy(src: Uint8Array, dst: Uint8Array, offset?: number): number;
-
-/**
- * Returns `true` if the suffix array appears at the end of the source array,
- * `false` otherwise.
- *
- * The complexity of this function is `O(suffix.length)`.
- *
- * @param source Source array to check.
- * @param suffix Suffix array to check for.
- * @returns `true` if the suffix array appears at the end of the source array,
- * `false` otherwise.
- *
- * @example Basic usage
- * ```ts
- * import { endsWith } from "@std/bytes/ends-with";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2, 1, 2, 1, 2, 3]);
- * const suffix = new Uint8Array([1, 2, 3]);
- *
- * assertEquals(endsWith(source, suffix), true);
- * ```
- */ declare function endsWith(source: Uint8Array, suffix: Uint8Array): boolean;
-
-/**
- * Check whether byte slices are equal to each other.
- *
- * @param a First array to check equality.
- * @param b Second array to check equality.
- * @returns `true` if the arrays are equal, `false` otherwise.
- *
- * @example Basic usage
- * ```ts
- * import { equals } from "@std/bytes/equals";
- * import { assertEquals } from "@std/assert";
- *
- * const a = new Uint8Array([1, 2, 3]);
- * const b = new Uint8Array([1, 2, 3]);
- * const c = new Uint8Array([4, 5, 6]);
- *
- * assertEquals(equals(a, b), true);
- * assertEquals(equals(a, c), false);
- * ```
- */ declare function equals(a: Uint8Array, b: Uint8Array): boolean;
-
-/**
- * Determines whether the source array contains the needle array.
- *
- * The complexity of this function is `O(source.length * needle.length)`.
- *
- * @param source Source array to check.
- * @param needle Needle array to check for.
- * @param start Start index in the source array to begin the search. Defaults to
- * 0.
- * @returns `true` if the source array contains the needle array, `false`
- * otherwise.
- *
- * @example Basic usage
- * ```ts
- * import { includesNeedle } from "@std/bytes/includes-needle";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2, 1, 2, 1, 2, 3]);
- * const needle = new Uint8Array([1, 2]);
- *
- * assertEquals(includesNeedle(source, needle), true);
- * ```
- *
- * @example Start index
- * ```ts
- * import { includesNeedle } from "@std/bytes/includes-needle";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2, 1, 2, 1, 2, 3]);
- * const needle = new Uint8Array([1, 2]);
- *
- * assertEquals(includesNeedle(source, needle, 3), true);
- * assertEquals(includesNeedle(source, needle, 6), false);
- * ```
- * The search will start at the specified index in the source array.
- */ declare function includesNeedle(source: Uint8Array, needle: Uint8Array, start?: number): boolean;
-
-/**
- * Returns the index of the first occurrence of the needle array in the source
- * array, or -1 if it is not present.
- *
- * A start index can be specified as the third argument that begins the search
- * at that given index. The start index defaults to the start of the array.
- *
- * The complexity of this function is `O(source.length * needle.length)`.
- *
- * @param source Source array to check.
- * @param needle Needle array to check for.
- * @param start Start index in the source array to begin the search. Defaults to
- * 0.
- * @returns Index of the first occurrence of the needle array in the source
- * array, or -1 if it is not present.
- *
- * @example Basic usage
- * ```ts
- * import { indexOfNeedle } from "@std/bytes/index-of-needle";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2, 1, 2, 1, 2, 3]);
- * const needle = new Uint8Array([1, 2]);
- * const notNeedle = new Uint8Array([5, 0]);
- *
- * assertEquals(indexOfNeedle(source, needle), 1);
- * assertEquals(indexOfNeedle(source, notNeedle), -1);
- * ```
- *
- * @example Start index
- * ```ts
- * import { indexOfNeedle } from "@std/bytes/index-of-needle";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2, 1, 2, 1, 2, 3]);
- * const needle = new Uint8Array([1, 2]);
- *
- * assertEquals(indexOfNeedle(source, needle, 2), 3);
- * assertEquals(indexOfNeedle(source, needle, 6), -1);
- * ```
- * Defining a start index will begin the search at the specified index in the
- * source array.
- */ declare function indexOfNeedle(source: Uint8Array, needle: Uint8Array, start?: number): number;
-
-/**
- * Returns the index of the last occurrence of the needle array in the source
- * array, or -1 if it is not present.
- *
- * The complexity of this function is `O(source.length * needle.length)`.
- *
- * @param source Source array to check.
- * @param needle Needle array to check for.
- * @param start Start index in the source array to begin the search. Defaults to
- * `source.length - 1`.
- * @returns Index of the last occurrence of the needle array in the source
- * array, or -1 if it is not present.
- *
- * @example Basic usage
- * ```ts
- * import { lastIndexOfNeedle } from "@std/bytes/last-index-of-needle";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2, 1, 2, 1, 2, 3]);
- * const needle = new Uint8Array([1, 2]);
- * const notNeedle = new Uint8Array([5, 0]);
- *
- * assertEquals(lastIndexOfNeedle(source, needle), 5);
- * assertEquals(lastIndexOfNeedle(source, notNeedle), -1);
- * ```
- *
- * @example Start index
- * ```ts
- * import { lastIndexOfNeedle } from "@std/bytes/last-index-of-needle";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2, 1, 2, 1, 2, 3]);
- * const needle = new Uint8Array([1, 2]);
- *
- * assertEquals(lastIndexOfNeedle(source, needle, 2), 1);
- * assertEquals(lastIndexOfNeedle(source, needle, 6), 5);
- * ```
- * Defining a start index will begin the search at the specified index in the
- * source array.
- */ declare function lastIndexOfNeedle(source: Uint8Array, needle: Uint8Array, start?: number): number;
-
-/**
- * Returns a new byte slice composed of `count` repetitions of the `source`
- * array.
- *
- * @param source Source array to repeat.
- * @param count Number of times to repeat the source array.
- * @returns A new byte slice composed of `count` repetitions of the `source`
- * array.
- *
- * @example Basic usage
- * ```ts
- * import { repeat } from "@std/bytes/repeat";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2]);
- *
- * assertEquals(repeat(source, 3), new Uint8Array([0, 1, 2, 0, 1, 2, 0, 1, 2]));
- * ```
- *
- * @example Zero count
- * ```ts
- * import { repeat } from "@std/bytes/repeat";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2]);
- *
- * assertEquals(repeat(source, 0), new Uint8Array());
- * ```
- */ declare function repeat(source: Uint8Array, count: number): Uint8Array_;
-
-/**
- * Returns `true` if the prefix array appears at the start of the source array,
- * `false` otherwise.
- *
- * The complexity of this function is `O(prefix.length)`.
- *
- * @param source Source array to check.
- * @param prefix Prefix array to check for.
- * @returns `true` if the prefix array appears at the start of the source array,
- * `false` otherwise.
- *
- * @example Basic usage
- * ```ts
- * import { startsWith } from "@std/bytes/starts-with";
- * import { assertEquals } from "@std/assert";
- *
- * const source = new Uint8Array([0, 1, 2, 1, 2, 1, 2, 3]);
- * const prefix = new Uint8Array([0, 1, 2]);
- *
- * assertEquals(startsWith(source, prefix), true);
- * ```
- */ declare function startsWith(source: Uint8Array, prefix: Uint8Array): boolean;
-
-declare const bufferToUint8Array: (buf: Buffer) => Uint8Array;
-declare const isUint8Array: (x: unknown) => x is Uint8Array;
-declare const asciiToUint8Array: (txt: TemplateStringsArray | string | [string]) => Uint8Array;
-declare const utf8ToUint8Array: (txt: TemplateStringsArray | [string] | string) => Uint8Array;
-declare const toUint8Array: (data: unknown) => Uint8Array;
-
-export { asciiToUint8Array, bufferToUint8Array, concat, copy, endsWith, equals, includesNeedle, indexOfNeedle, isUint8Array, lastIndexOfNeedle, repeat, startsWith, toUint8Array, utf8ToUint8Array };
-export type { Uint8Array_ };