svelte-on-rails 0.0.30 → 0.0.32

data/lib/svelte_on_rails/node_modules/@jridgewell/set-array/README.md

@@ -1,37 +0,0 @@
-# @jridgewell/set-array
-
-> Like a Set, but provides the index of the `key` in the backing array
-
-This is designed to allow synchronizing a second array with the contents of the backing array, like
-how in a sourcemap `sourcesContent[i]` is the source content associated with `source[i]`, and there
-are never duplicates.
-
-## Installation
-
-```sh
-npm install @jridgewell/set-array
-```
-
-## Usage
-
-```js
-import { SetArray, get, put, pop } from '@jridgewell/set-array';
-
-const sa = new SetArray();
-
-let index = put(sa, 'first');
-assert.strictEqual(index, 0);
-
-index = put(sa, 'second');
-assert.strictEqual(index, 1);
-
-assert.deepEqual(sa.array, [ 'first', 'second' ]);
-
-index = get(sa, 'first');
-assert.strictEqual(index, 0);
-
-pop(sa);
-index = get(sa, 'second');
-assert.strictEqual(index, undefined);
-assert.deepEqual(sa.array, [ 'first' ]);
-```

data/lib/svelte_on_rails/node_modules/@jridgewell/set-array/dist/set-array.mjs

@@ -1,69 +0,0 @@
-/**
- * SetArray acts like a `Set` (allowing only one occurrence of a string `key`), but provides the
- * index of the `key` in the backing array.
- *
- * This is designed to allow synchronizing a second array with the contents of the backing array,
- * like how in a sourcemap `sourcesContent[i]` is the source content associated with `source[i]`,
- * and there are never duplicates.
- */
-class SetArray {
-    constructor() {
-        this._indexes = { __proto__: null };
-        this.array = [];
-    }
-}
-/**
- * Typescript doesn't allow friend access to private fields, so this just casts the set into a type
- * with public access modifiers.
- */
-function cast(set) {
-    return set;
-}
-/**
- * Gets the index associated with `key` in the backing array, if it is already present.
- */
-function get(setarr, key) {
-    return cast(setarr)._indexes[key];
-}
-/**
- * Puts `key` into the backing array, if it is not already present. Returns
- * the index of the `key` in the backing array.
- */
-function put(setarr, key) {
-    // The key may or may not be present. If it is present, it's a number.
-    const index = get(setarr, key);
-    if (index !== undefined)
-        return index;
-    const { array, _indexes: indexes } = cast(setarr);
-    const length = array.push(key);
-    return (indexes[key] = length - 1);
-}
-/**
- * Pops the last added item out of the SetArray.
- */
-function pop(setarr) {
-    const { array, _indexes: indexes } = cast(setarr);
-    if (array.length === 0)
-        return;
-    const last = array.pop();
-    indexes[last] = undefined;
-}
-/**
- * Removes the key, if it exists in the set.
- */
-function remove(setarr, key) {
-    const index = get(setarr, key);
-    if (index === undefined)
-        return;
-    const { array, _indexes: indexes } = cast(setarr);
-    for (let i = index + 1; i < array.length; i++) {
-        const k = array[i];
-        array[i - 1] = k;
-        indexes[k]--;
-    }
-    indexes[key] = undefined;
-    array.pop();
-}
-
-export { SetArray, get, pop, put, remove };
-//# sourceMappingURL=set-array.mjs.map

data/lib/svelte_on_rails/node_modules/@jridgewell/set-array/dist/set-array.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"set-array.mjs","sources":["../src/set-array.ts"],"sourcesContent":["type Key = string | number | symbol;\n\n/**\n * SetArray acts like a `Set` (allowing only one occurrence of a string `key`), but provides the\n * index of the `key` in the backing array.\n *\n * This is designed to allow synchronizing a second array with the contents of the backing array,\n * like how in a sourcemap `sourcesContent[i]` is the source content associated with `source[i]`,\n * and there are never duplicates.\n */\nexport class SetArray<T extends Key = Key> {\n  private declare _indexes: Record<T, number | undefined>;\n  declare array: readonly T[];\n\n  constructor() {\n    this._indexes = { __proto__: null } as any;\n    this.array = [];\n  }\n}\n\ninterface PublicSet<T extends Key> {\n  array: T[];\n  _indexes: SetArray<T>['_indexes'];\n}\n\n/**\n * Typescript doesn't allow friend access to private fields, so this just casts the set into a type\n * with public access modifiers.\n */\nfunction cast<T extends Key>(set: SetArray<T>): PublicSet<T> {\n  return set as any;\n}\n\n/**\n * Gets the index associated with `key` in the backing array, if it is already present.\n */\nexport function get<T extends Key>(setarr: SetArray<T>, key: T): number | undefined {\n  return cast(setarr)._indexes[key];\n}\n\n/**\n * Puts `key` into the backing array, if it is not already present. Returns\n * the index of the `key` in the backing array.\n */\nexport function put<T extends Key>(setarr: SetArray<T>, key: T): number {\n  // The key may or may not be present. If it is present, it's a number.\n  const index = get(setarr, key);\n  if (index !== undefined) return index;\n\n  const { array, _indexes: indexes } = cast(setarr);\n\n  const length = array.push(key);\n  return (indexes[key] = length - 1);\n}\n\n/**\n * Pops the last added item out of the SetArray.\n */\nexport function pop<T extends Key>(setarr: SetArray<T>): void {\n  const { array, _indexes: indexes } = cast(setarr);\n  if (array.length === 0) return;\n\n  const last = array.pop()!;\n  indexes[last] = undefined;\n}\n\n/**\n * Removes the key, if it exists in the set.\n */\nexport function remove<T extends Key>(setarr: SetArray<T>, key: T): void {\n  const index = get(setarr, key);\n  if (index === undefined) return;\n\n  const { array, _indexes: indexes } = cast(setarr);\n  for (let i = index + 1; i < array.length; i++) {\n    const k = array[i];\n    array[i - 1] = k;\n    indexes[k]!--;\n  }\n  indexes[key] = undefined;\n  array.pop();\n}\n"],"names":[],"mappings":"AAEA;;;;;;;;MAQa,QAAQ;IAInB;QACE,IAAI,CAAC,QAAQ,GAAG,EAAE,SAAS,EAAE,IAAI,EAAS,CAAC;QAC3C,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;KACjB;CACF;AAOD;;;;AAIA,SAAS,IAAI,CAAgB,GAAgB;IAC3C,OAAO,GAAU,CAAC;AACpB,CAAC;AAED;;;SAGgB,GAAG,CAAgB,MAAmB,EAAE,GAAM;IAC5D,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;AACpC,CAAC;AAED;;;;SAIgB,GAAG,CAAgB,MAAmB,EAAE,GAAM;;IAE5D,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC/B,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAEtC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAElD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,QAAQ,OAAO,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE;AACrC,CAAC;AAED;;;SAGgB,GAAG,CAAgB,MAAmB;IACpD,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAClD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAE/B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;IAC1B,OAAO,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;AAC5B,CAAC;AAED;;;SAGgB,MAAM,CAAgB,MAAmB,EAAE,GAAM;IAC/D,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC/B,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO;IAEhC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAClD,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC7C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC,CAAE,EAAE,CAAC;KACf;IACD,OAAO,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IACzB,KAAK,CAAC,GAAG,EAAE,CAAC;AACd;;;;"}

data/lib/svelte_on_rails/node_modules/@jridgewell/set-array/dist/set-array.umd.js

@@ -1,83 +0,0 @@
-(function (global, factory) {
-    typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
-    typeof define === 'function' && define.amd ? define(['exports'], factory) :
-    (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.setArray = {}));
-})(this, (function (exports) { 'use strict';
-
-    /**
-     * SetArray acts like a `Set` (allowing only one occurrence of a string `key`), but provides the
-     * index of the `key` in the backing array.
-     *
-     * This is designed to allow synchronizing a second array with the contents of the backing array,
-     * like how in a sourcemap `sourcesContent[i]` is the source content associated with `source[i]`,
-     * and there are never duplicates.
-     */
-    class SetArray {
-        constructor() {
-            this._indexes = { __proto__: null };
-            this.array = [];
-        }
-    }
-    /**
-     * Typescript doesn't allow friend access to private fields, so this just casts the set into a type
-     * with public access modifiers.
-     */
-    function cast(set) {
-        return set;
-    }
-    /**
-     * Gets the index associated with `key` in the backing array, if it is already present.
-     */
-    function get(setarr, key) {
-        return cast(setarr)._indexes[key];
-    }
-    /**
-     * Puts `key` into the backing array, if it is not already present. Returns
-     * the index of the `key` in the backing array.
-     */
-    function put(setarr, key) {
-        // The key may or may not be present. If it is present, it's a number.
-        const index = get(setarr, key);
-        if (index !== undefined)
-            return index;
-        const { array, _indexes: indexes } = cast(setarr);
-        const length = array.push(key);
-        return (indexes[key] = length - 1);
-    }
-    /**
-     * Pops the last added item out of the SetArray.
-     */
-    function pop(setarr) {
-        const { array, _indexes: indexes } = cast(setarr);
-        if (array.length === 0)
-            return;
-        const last = array.pop();
-        indexes[last] = undefined;
-    }
-    /**
-     * Removes the key, if it exists in the set.
-     */
-    function remove(setarr, key) {
-        const index = get(setarr, key);
-        if (index === undefined)
-            return;
-        const { array, _indexes: indexes } = cast(setarr);
-        for (let i = index + 1; i < array.length; i++) {
-            const k = array[i];
-            array[i - 1] = k;
-            indexes[k]--;
-        }
-        indexes[key] = undefined;
-        array.pop();
-    }
-
-    exports.SetArray = SetArray;
-    exports.get = get;
-    exports.pop = pop;
-    exports.put = put;
-    exports.remove = remove;
-
-    Object.defineProperty(exports, '__esModule', { value: true });
-
-}));
-//# sourceMappingURL=set-array.umd.js.map

data/lib/svelte_on_rails/node_modules/@jridgewell/set-array/dist/set-array.umd.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"set-array.umd.js","sources":["../src/set-array.ts"],"sourcesContent":["type Key = string | number | symbol;\n\n/**\n * SetArray acts like a `Set` (allowing only one occurrence of a string `key`), but provides the\n * index of the `key` in the backing array.\n *\n * This is designed to allow synchronizing a second array with the contents of the backing array,\n * like how in a sourcemap `sourcesContent[i]` is the source content associated with `source[i]`,\n * and there are never duplicates.\n */\nexport class SetArray<T extends Key = Key> {\n  private declare _indexes: Record<T, number | undefined>;\n  declare array: readonly T[];\n\n  constructor() {\n    this._indexes = { __proto__: null } as any;\n    this.array = [];\n  }\n}\n\ninterface PublicSet<T extends Key> {\n  array: T[];\n  _indexes: SetArray<T>['_indexes'];\n}\n\n/**\n * Typescript doesn't allow friend access to private fields, so this just casts the set into a type\n * with public access modifiers.\n */\nfunction cast<T extends Key>(set: SetArray<T>): PublicSet<T> {\n  return set as any;\n}\n\n/**\n * Gets the index associated with `key` in the backing array, if it is already present.\n */\nexport function get<T extends Key>(setarr: SetArray<T>, key: T): number | undefined {\n  return cast(setarr)._indexes[key];\n}\n\n/**\n * Puts `key` into the backing array, if it is not already present. Returns\n * the index of the `key` in the backing array.\n */\nexport function put<T extends Key>(setarr: SetArray<T>, key: T): number {\n  // The key may or may not be present. If it is present, it's a number.\n  const index = get(setarr, key);\n  if (index !== undefined) return index;\n\n  const { array, _indexes: indexes } = cast(setarr);\n\n  const length = array.push(key);\n  return (indexes[key] = length - 1);\n}\n\n/**\n * Pops the last added item out of the SetArray.\n */\nexport function pop<T extends Key>(setarr: SetArray<T>): void {\n  const { array, _indexes: indexes } = cast(setarr);\n  if (array.length === 0) return;\n\n  const last = array.pop()!;\n  indexes[last] = undefined;\n}\n\n/**\n * Removes the key, if it exists in the set.\n */\nexport function remove<T extends Key>(setarr: SetArray<T>, key: T): void {\n  const index = get(setarr, key);\n  if (index === undefined) return;\n\n  const { array, _indexes: indexes } = cast(setarr);\n  for (let i = index + 1; i < array.length; i++) {\n    const k = array[i];\n    array[i - 1] = k;\n    indexes[k]!--;\n  }\n  indexes[key] = undefined;\n  array.pop();\n}\n"],"names":[],"mappings":";;;;;;IAEA;;;;;;;;UAQa,QAAQ;QAInB;YACE,IAAI,CAAC,QAAQ,GAAG,EAAE,SAAS,EAAE,IAAI,EAAS,CAAC;YAC3C,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;SACjB;KACF;IAOD;;;;IAIA,SAAS,IAAI,CAAgB,GAAgB;QAC3C,OAAO,GAAU,CAAC;IACpB,CAAC;IAED;;;aAGgB,GAAG,CAAgB,MAAmB,EAAE,GAAM;QAC5D,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;IACpC,CAAC;IAED;;;;aAIgB,GAAG,CAAgB,MAAmB,EAAE,GAAM;;QAE5D,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAEtC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAElD,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC/B,QAAQ,OAAO,CAAC,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC,EAAE;IACrC,CAAC;IAED;;;aAGgB,GAAG,CAAgB,MAAmB;QACpD,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAClD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAE/B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC1B,OAAO,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;IAC5B,CAAC;IAED;;;aAGgB,MAAM,CAAgB,MAAmB,EAAE,GAAM;QAC/D,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO;QAEhC,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YAC7C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACjB,OAAO,CAAC,CAAC,CAAE,EAAE,CAAC;SACf;QACD,OAAO,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;QACzB,KAAK,CAAC,GAAG,EAAE,CAAC;IACd;;;;;;;;;;;;;;"}

data/lib/svelte_on_rails/node_modules/@jridgewell/set-array/dist/types/set-array.d.ts

@@ -1,32 +0,0 @@
-declare type Key = string | number | symbol;
-/**
- * SetArray acts like a `Set` (allowing only one occurrence of a string `key`), but provides the
- * index of the `key` in the backing array.
- *
- * This is designed to allow synchronizing a second array with the contents of the backing array,
- * like how in a sourcemap `sourcesContent[i]` is the source content associated with `source[i]`,
- * and there are never duplicates.
- */
-export declare class SetArray<T extends Key = Key> {
-    private _indexes;
-    array: readonly T[];
-    constructor();
-}
-/**
- * Gets the index associated with `key` in the backing array, if it is already present.
- */
-export declare function get<T extends Key>(setarr: SetArray<T>, key: T): number | undefined;
-/**
- * Puts `key` into the backing array, if it is not already present. Returns
- * the index of the `key` in the backing array.
- */
-export declare function put<T extends Key>(setarr: SetArray<T>, key: T): number;
-/**
- * Pops the last added item out of the SetArray.
- */
-export declare function pop<T extends Key>(setarr: SetArray<T>): void;
-/**
- * Removes the key, if it exists in the set.
- */
-export declare function remove<T extends Key>(setarr: SetArray<T>, key: T): void;
-export {};

data/lib/svelte_on_rails/node_modules/@jridgewell/set-array/package.json

@@ -1,65 +0,0 @@
-{
-  "name": "@jridgewell/set-array",
-  "version": "1.2.1",
-  "description": "Like a Set, but provides the index of the `key` in the backing array",
-  "keywords": [],
-  "author": "Justin Ridgewell <justin@ridgewell.name>",
-  "license": "MIT",
-  "repository": "https://github.com/jridgewell/set-array",
-  "main": "dist/set-array.umd.js",
-  "module": "dist/set-array.mjs",
-  "typings": "dist/types/set-array.d.ts",
-  "exports": {
-    ".": [
-      {
-        "types": "./dist/types/set-array.d.ts",
-        "browser": "./dist/set-array.umd.js",
-        "require": "./dist/set-array.umd.js",
-        "import": "./dist/set-array.mjs"
-      },
-      "./dist/set-array.umd.js"
-    ],
-    "./package.json": "./package.json"
-  },
-  "files": [
-    "dist"
-  ],
-  "engines": {
-    "node": ">=6.0.0"
-  },
-  "scripts": {
-    "prebuild": "rm -rf dist",
-    "build": "run-s -n build:*",
-    "build:rollup": "rollup -c rollup.config.js",
-    "build:ts": "tsc --project tsconfig.build.json",
-    "lint": "run-s -n lint:*",
-    "lint:prettier": "npm run test:lint:prettier -- --write",
-    "lint:ts": "npm run test:lint:ts -- --fix",
-    "test": "run-s -n test:lint test:only",
-    "test:debug": "mocha --inspect-brk",
-    "test:lint": "run-s -n test:lint:*",
-    "test:lint:prettier": "prettier --check '{src,test}/**/*.ts'",
-    "test:lint:ts": "eslint '{src,test}/**/*.ts'",
-    "test:only": "mocha",
-    "test:coverage": "c8 mocha",
-    "test:watch": "mocha --watch",
-    "prepublishOnly": "npm run preversion",
-    "preversion": "run-s test build"
-  },
-  "devDependencies": {
-    "@rollup/plugin-typescript": "8.3.0",
-    "@types/mocha": "9.1.1",
-    "@types/node": "17.0.29",
-    "@typescript-eslint/eslint-plugin": "5.10.0",
-    "@typescript-eslint/parser": "5.10.0",
-    "c8": "7.11.0",
-    "eslint": "8.7.0",
-    "eslint-config-prettier": "8.3.0",
-    "mocha": "9.2.0",
-    "npm-run-all": "4.1.5",
-    "prettier": "2.5.1",
-    "rollup": "2.66.0",
-    "tsx": "4.7.1",
-    "typescript": "4.5.5"
-  }
-}

data/lib/svelte_on_rails/node_modules/@jridgewell/sourcemap-codec/LICENSE

@@ -1,21 +0,0 @@
-The MIT License
-
-Copyright (c) 2015 Rich Harris
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.

data/lib/svelte_on_rails/node_modules/@jridgewell/sourcemap-codec/README.md

@@ -1,264 +0,0 @@
-# @jridgewell/sourcemap-codec
-
-Encode/decode the `mappings` property of a [sourcemap](https://docs.google.com/document/d/1U1RGAehQwRypUTovF1KRlpiOFze0b-_2gc6fAH0KY0k/edit).
-
-
-## Why?
-
-Sourcemaps are difficult to generate and manipulate, because the `mappings` property – the part that actually links the generated code back to the original source – is encoded using an obscure method called [Variable-length quantity](https://en.wikipedia.org/wiki/Variable-length_quantity). On top of that, each segment in the mapping contains offsets rather than absolute indices, which means that you can't look at a segment in isolation – you have to understand the whole sourcemap.
-
-This package makes the process slightly easier.
-
-
-## Installation
-
-```bash
-npm install @jridgewell/sourcemap-codec
-```
-
-
-## Usage
-
-```js
-import { encode, decode } from '@jridgewell/sourcemap-codec';
-
-var decoded = decode( ';EAEEA,EAAE,EAAC,CAAE;ECQY,UACC' );
-
-assert.deepEqual( decoded, [
-	// the first line (of the generated code) has no mappings,
-	// as shown by the starting semi-colon (which separates lines)
-	[],
-
-	// the second line contains four (comma-separated) segments
-	[
-		// segments are encoded as you'd expect:
-		// [ generatedCodeColumn, sourceIndex, sourceCodeLine, sourceCodeColumn, nameIndex ]
-
-		// i.e. the first segment begins at column 2, and maps back to the second column
-		// of the second line (both zero-based) of the 0th source, and uses the 0th
-		// name in the `map.names` array
-		[ 2, 0, 2, 2, 0 ],
-
-		// the remaining segments are 4-length rather than 5-length,
-		// because they don't map a name
-		[ 4, 0, 2, 4 ],
-		[ 6, 0, 2, 5 ],
-		[ 7, 0, 2, 7 ]
-	],
-
-	// the final line contains two segments
-	[
-		[ 2, 1, 10, 19 ],
-		[ 12, 1, 11, 20 ]
-	]
-]);
-
-var encoded = encode( decoded );
-assert.equal( encoded, ';EAEEA,EAAE,EAAC,CAAE;ECQY,UACC' );
-```
-
-## Benchmarks
-
-```
-node v20.10.0
-
-amp.js.map - 45120 segments
-
-Decode Memory Usage:
-local code                             5815135 bytes
-@jridgewell/sourcemap-codec 1.4.15     5868160 bytes
-sourcemap-codec                        5492584 bytes
-source-map-0.6.1                      13569984 bytes
-source-map-0.8.0                       6390584 bytes
-chrome dev tools                       8011136 bytes
-Smallest memory usage is sourcemap-codec
-
-Decode speed:
-decode: local code x 492 ops/sec ±1.22% (90 runs sampled)
-decode: @jridgewell/sourcemap-codec 1.4.15 x 499 ops/sec ±1.16% (89 runs sampled)
-decode: sourcemap-codec x 376 ops/sec ±1.66% (89 runs sampled)
-decode: source-map-0.6.1 x 34.99 ops/sec ±0.94% (48 runs sampled)
-decode: source-map-0.8.0 x 351 ops/sec ±0.07% (95 runs sampled)
-chrome dev tools x 165 ops/sec ±0.91% (86 runs sampled)
-Fastest is decode: @jridgewell/sourcemap-codec 1.4.15
-
-Encode Memory Usage:
-local code                              444248 bytes
-@jridgewell/sourcemap-codec 1.4.15      623024 bytes
-sourcemap-codec                        8696280 bytes
-source-map-0.6.1                       8745176 bytes
-source-map-0.8.0                       8736624 bytes
-Smallest memory usage is local code
-
-Encode speed:
-encode: local code x 796 ops/sec ±0.11% (97 runs sampled)
-encode: @jridgewell/sourcemap-codec 1.4.15 x 795 ops/sec ±0.25% (98 runs sampled)
-encode: sourcemap-codec x 231 ops/sec ±0.83% (86 runs sampled)
-encode: source-map-0.6.1 x 166 ops/sec ±0.57% (86 runs sampled)
-encode: source-map-0.8.0 x 203 ops/sec ±0.45% (88 runs sampled)
-Fastest is encode: local code,encode: @jridgewell/sourcemap-codec 1.4.15
-
-
-***
-
-
-babel.min.js.map - 347793 segments
-
-Decode Memory Usage:
-local code                            35424960 bytes
-@jridgewell/sourcemap-codec 1.4.15    35424696 bytes
-sourcemap-codec                       36033464 bytes
-source-map-0.6.1                      62253704 bytes
-source-map-0.8.0                      43843920 bytes
-chrome dev tools                      45111400 bytes
-Smallest memory usage is @jridgewell/sourcemap-codec 1.4.15
-
-Decode speed:
-decode: local code x 38.18 ops/sec ±5.44% (52 runs sampled)
-decode: @jridgewell/sourcemap-codec 1.4.15 x 38.36 ops/sec ±5.02% (52 runs sampled)
-decode: sourcemap-codec x 34.05 ops/sec ±4.45% (47 runs sampled)
-decode: source-map-0.6.1 x 4.31 ops/sec ±2.76% (15 runs sampled)
-decode: source-map-0.8.0 x 55.60 ops/sec ±0.13% (73 runs sampled)
-chrome dev tools x 16.94 ops/sec ±3.78% (46 runs sampled)
-Fastest is decode: source-map-0.8.0
-
-Encode Memory Usage:
-local code                             2606016 bytes
-@jridgewell/sourcemap-codec 1.4.15     2626440 bytes
-sourcemap-codec                       21152576 bytes
-source-map-0.6.1                      25023928 bytes
-source-map-0.8.0                      25256448 bytes
-Smallest memory usage is local code
-
-Encode speed:
-encode: local code x 127 ops/sec ±0.18% (83 runs sampled)
-encode: @jridgewell/sourcemap-codec 1.4.15 x 128 ops/sec ±0.26% (83 runs sampled)
-encode: sourcemap-codec x 29.31 ops/sec ±2.55% (53 runs sampled)
-encode: source-map-0.6.1 x 18.85 ops/sec ±3.19% (36 runs sampled)
-encode: source-map-0.8.0 x 19.34 ops/sec ±1.97% (36 runs sampled)
-Fastest is encode: @jridgewell/sourcemap-codec 1.4.15
-
-
-***
-
-
-preact.js.map - 1992 segments
-
-Decode Memory Usage:
-local code                              261696 bytes
-@jridgewell/sourcemap-codec 1.4.15      244296 bytes
-sourcemap-codec                         302816 bytes
-source-map-0.6.1                        939176 bytes
-source-map-0.8.0                           336 bytes
-chrome dev tools                        587368 bytes
-Smallest memory usage is source-map-0.8.0
-
-Decode speed:
-decode: local code x 17,782 ops/sec ±0.32% (97 runs sampled)
-decode: @jridgewell/sourcemap-codec 1.4.15 x 17,863 ops/sec ±0.40% (100 runs sampled)
-decode: sourcemap-codec x 12,453 ops/sec ±0.27% (101 runs sampled)
-decode: source-map-0.6.1 x 1,288 ops/sec ±1.05% (96 runs sampled)
-decode: source-map-0.8.0 x 9,289 ops/sec ±0.27% (101 runs sampled)
-chrome dev tools x 4,769 ops/sec ±0.18% (100 runs sampled)
-Fastest is decode: @jridgewell/sourcemap-codec 1.4.15
-
-Encode Memory Usage:
-local code                              262944 bytes
-@jridgewell/sourcemap-codec 1.4.15       25544 bytes
-sourcemap-codec                         323048 bytes
-source-map-0.6.1                        507808 bytes
-source-map-0.8.0                        507480 bytes
-Smallest memory usage is @jridgewell/sourcemap-codec 1.4.15
-
-Encode speed:
-encode: local code x 24,207 ops/sec ±0.79% (95 runs sampled)
-encode: @jridgewell/sourcemap-codec 1.4.15 x 24,288 ops/sec ±0.48% (96 runs sampled)
-encode: sourcemap-codec x 6,761 ops/sec ±0.21% (100 runs sampled)
-encode: source-map-0.6.1 x 5,374 ops/sec ±0.17% (99 runs sampled)
-encode: source-map-0.8.0 x 5,633 ops/sec ±0.32% (99 runs sampled)
-Fastest is encode: @jridgewell/sourcemap-codec 1.4.15,encode: local code
-
-
-***
-
-
-react.js.map - 5726 segments
-
-Decode Memory Usage:
-local code                              678816 bytes
-@jridgewell/sourcemap-codec 1.4.15      678816 bytes
-sourcemap-codec                         816400 bytes
-source-map-0.6.1                       2288864 bytes
-source-map-0.8.0                        721360 bytes
-chrome dev tools                       1012512 bytes
-Smallest memory usage is local code
-
-Decode speed:
-decode: local code x 6,178 ops/sec ±0.19% (98 runs sampled)
-decode: @jridgewell/sourcemap-codec 1.4.15 x 6,261 ops/sec ±0.22% (100 runs sampled)
-decode: sourcemap-codec x 4,472 ops/sec ±0.90% (99 runs sampled)
-decode: source-map-0.6.1 x 449 ops/sec ±0.31% (95 runs sampled)
-decode: source-map-0.8.0 x 3,219 ops/sec ±0.13% (100 runs sampled)
-chrome dev tools x 1,743 ops/sec ±0.20% (99 runs sampled)
-Fastest is decode: @jridgewell/sourcemap-codec 1.4.15
-
-Encode Memory Usage:
-local code                              140960 bytes
-@jridgewell/sourcemap-codec 1.4.15      159808 bytes
-sourcemap-codec                         969304 bytes
-source-map-0.6.1                        930520 bytes
-source-map-0.8.0                        930248 bytes
-Smallest memory usage is local code
-
-Encode speed:
-encode: local code x 8,013 ops/sec ±0.19% (100 runs sampled)
-encode: @jridgewell/sourcemap-codec 1.4.15 x 7,989 ops/sec ±0.20% (101 runs sampled)
-encode: sourcemap-codec x 2,472 ops/sec ±0.21% (99 runs sampled)
-encode: source-map-0.6.1 x 2,200 ops/sec ±0.17% (99 runs sampled)
-encode: source-map-0.8.0 x 2,220 ops/sec ±0.37% (99 runs sampled)
-Fastest is encode: local code
-
-
-***
-
-
-vscode.map - 2141001 segments
-
-Decode Memory Usage:
-local code                           198955264 bytes
-@jridgewell/sourcemap-codec 1.4.15   199175352 bytes
-sourcemap-codec                      199102688 bytes
-source-map-0.6.1                     386323432 bytes
-source-map-0.8.0                     244116432 bytes
-chrome dev tools                     293734280 bytes
-Smallest memory usage is local code
-
-Decode speed:
-decode: local code x 3.90 ops/sec ±22.21% (15 runs sampled)
-decode: @jridgewell/sourcemap-codec 1.4.15 x 3.95 ops/sec ±23.53% (15 runs sampled)
-decode: sourcemap-codec x 3.82 ops/sec ±17.94% (14 runs sampled)
-decode: source-map-0.6.1 x 0.61 ops/sec ±7.81% (6 runs sampled)
-decode: source-map-0.8.0 x 9.54 ops/sec ±0.28% (28 runs sampled)
-chrome dev tools x 2.18 ops/sec ±10.58% (10 runs sampled)
-Fastest is decode: source-map-0.8.0
-
-Encode Memory Usage:
-local code                            13509880 bytes
-@jridgewell/sourcemap-codec 1.4.15    13537648 bytes
-sourcemap-codec                       32540104 bytes
-source-map-0.6.1                     127531040 bytes
-source-map-0.8.0                     127535312 bytes
-Smallest memory usage is local code
-
-Encode speed:
-encode: local code x 20.10 ops/sec ±0.19% (38 runs sampled)
-encode: @jridgewell/sourcemap-codec 1.4.15 x 20.26 ops/sec ±0.32% (38 runs sampled)
-encode: sourcemap-codec x 5.44 ops/sec ±1.64% (18 runs sampled)
-encode: source-map-0.6.1 x 2.30 ops/sec ±4.79% (10 runs sampled)
-encode: source-map-0.8.0 x 2.46 ops/sec ±6.53% (10 runs sampled)
-Fastest is encode: @jridgewell/sourcemap-codec 1.4.15
-```
-
-# License
-
-MIT