@tushar-br/desktop 1.0.280 → 1.0.282

package/staging_area/desktop/rilvox/node_modules/yaml/dist/visit.js

@@ -1,236 +0,0 @@
-'use strict';
-
-var identity = require('./nodes/identity.js');
-
-const BREAK = Symbol('break visit');
-const SKIP = Symbol('skip children');
-const REMOVE = Symbol('remove node');
-/**
- * Apply a visitor to an AST node or document.
- *
- * Walks through the tree (depth-first) starting from `node`, calling a
- * `visitor` function with three arguments:
- *   - `key`: For sequence values and map `Pair`, the node's index in the
- *     collection. Within a `Pair`, `'key'` or `'value'`, correspondingly.
- *     `null` for the root node.
- *   - `node`: The current node.
- *   - `path`: The ancestry of the current node.
- *
- * The return value of the visitor may be used to control the traversal:
- *   - `undefined` (default): Do nothing and continue
- *   - `visit.SKIP`: Do not visit the children of this node, continue with next
- *     sibling
- *   - `visit.BREAK`: Terminate traversal completely
- *   - `visit.REMOVE`: Remove the current node, then continue with the next one
- *   - `Node`: Replace the current node, then continue by visiting it
- *   - `number`: While iterating the items of a sequence or map, set the index
- *     of the next step. This is useful especially if the index of the current
- *     node has changed.
- *
- * If `visitor` is a single function, it will be called with all values
- * encountered in the tree, including e.g. `null` values. Alternatively,
- * separate visitor functions may be defined for each `Map`, `Pair`, `Seq`,
- * `Alias` and `Scalar` node. To define the same visitor function for more than
- * one node type, use the `Collection` (map and seq), `Value` (map, seq & scalar)
- * and `Node` (alias, map, seq & scalar) targets. Of all these, only the most
- * specific defined one will be used for each node.
- */
-function visit(node, visitor) {
-    const visitor_ = initVisitor(visitor);
-    if (identity.isDocument(node)) {
-        const cd = visit_(null, node.contents, visitor_, Object.freeze([node]));
-        if (cd === REMOVE)
-            node.contents = null;
-    }
-    else
-        visit_(null, node, visitor_, Object.freeze([]));
-}
-// Without the `as symbol` casts, TS declares these in the `visit`
-// namespace using `var`, but then complains about that because
-// `unique symbol` must be `const`.
-/** Terminate visit traversal completely */
-visit.BREAK = BREAK;
-/** Do not visit the children of the current node */
-visit.SKIP = SKIP;
-/** Remove the current node */
-visit.REMOVE = REMOVE;
-function visit_(key, node, visitor, path) {
-    const ctrl = callVisitor(key, node, visitor, path);
-    if (identity.isNode(ctrl) || identity.isPair(ctrl)) {
-        replaceNode(key, path, ctrl);
-        return visit_(key, ctrl, visitor, path);
-    }
-    if (typeof ctrl !== 'symbol') {
-        if (identity.isCollection(node)) {
-            path = Object.freeze(path.concat(node));
-            for (let i = 0; i < node.items.length; ++i) {
-                const ci = visit_(i, node.items[i], visitor, path);
-                if (typeof ci === 'number')
-                    i = ci - 1;
-                else if (ci === BREAK)
-                    return BREAK;
-                else if (ci === REMOVE) {
-                    node.items.splice(i, 1);
-                    i -= 1;
-                }
-            }
-        }
-        else if (identity.isPair(node)) {
-            path = Object.freeze(path.concat(node));
-            const ck = visit_('key', node.key, visitor, path);
-            if (ck === BREAK)
-                return BREAK;
-            else if (ck === REMOVE)
-                node.key = null;
-            const cv = visit_('value', node.value, visitor, path);
-            if (cv === BREAK)
-                return BREAK;
-            else if (cv === REMOVE)
-                node.value = null;
-        }
-    }
-    return ctrl;
-}
-/**
- * Apply an async visitor to an AST node or document.
- *
- * Walks through the tree (depth-first) starting from `node`, calling a
- * `visitor` function with three arguments:
- *   - `key`: For sequence values and map `Pair`, the node's index in the
- *     collection. Within a `Pair`, `'key'` or `'value'`, correspondingly.
- *     `null` for the root node.
- *   - `node`: The current node.
- *   - `path`: The ancestry of the current node.
- *
- * The return value of the visitor may be used to control the traversal:
- *   - `Promise`: Must resolve to one of the following values
- *   - `undefined` (default): Do nothing and continue
- *   - `visit.SKIP`: Do not visit the children of this node, continue with next
- *     sibling
- *   - `visit.BREAK`: Terminate traversal completely
- *   - `visit.REMOVE`: Remove the current node, then continue with the next one
- *   - `Node`: Replace the current node, then continue by visiting it
- *   - `number`: While iterating the items of a sequence or map, set the index
- *     of the next step. This is useful especially if the index of the current
- *     node has changed.
- *
- * If `visitor` is a single function, it will be called with all values
- * encountered in the tree, including e.g. `null` values. Alternatively,
- * separate visitor functions may be defined for each `Map`, `Pair`, `Seq`,
- * `Alias` and `Scalar` node. To define the same visitor function for more than
- * one node type, use the `Collection` (map and seq), `Value` (map, seq & scalar)
- * and `Node` (alias, map, seq & scalar) targets. Of all these, only the most
- * specific defined one will be used for each node.
- */
-async function visitAsync(node, visitor) {
-    const visitor_ = initVisitor(visitor);
-    if (identity.isDocument(node)) {
-        const cd = await visitAsync_(null, node.contents, visitor_, Object.freeze([node]));
-        if (cd === REMOVE)
-            node.contents = null;
-    }
-    else
-        await visitAsync_(null, node, visitor_, Object.freeze([]));
-}
-// Without the `as symbol` casts, TS declares these in the `visit`
-// namespace using `var`, but then complains about that because
-// `unique symbol` must be `const`.
-/** Terminate visit traversal completely */
-visitAsync.BREAK = BREAK;
-/** Do not visit the children of the current node */
-visitAsync.SKIP = SKIP;
-/** Remove the current node */
-visitAsync.REMOVE = REMOVE;
-async function visitAsync_(key, node, visitor, path) {
-    const ctrl = await callVisitor(key, node, visitor, path);
-    if (identity.isNode(ctrl) || identity.isPair(ctrl)) {
-        replaceNode(key, path, ctrl);
-        return visitAsync_(key, ctrl, visitor, path);
-    }
-    if (typeof ctrl !== 'symbol') {
-        if (identity.isCollection(node)) {
-            path = Object.freeze(path.concat(node));
-            for (let i = 0; i < node.items.length; ++i) {
-                const ci = await visitAsync_(i, node.items[i], visitor, path);
-                if (typeof ci === 'number')
-                    i = ci - 1;
-                else if (ci === BREAK)
-                    return BREAK;
-                else if (ci === REMOVE) {
-                    node.items.splice(i, 1);
-                    i -= 1;
-                }
-            }
-        }
-        else if (identity.isPair(node)) {
-            path = Object.freeze(path.concat(node));
-            const ck = await visitAsync_('key', node.key, visitor, path);
-            if (ck === BREAK)
-                return BREAK;
-            else if (ck === REMOVE)
-                node.key = null;
-            const cv = await visitAsync_('value', node.value, visitor, path);
-            if (cv === BREAK)
-                return BREAK;
-            else if (cv === REMOVE)
-                node.value = null;
-        }
-    }
-    return ctrl;
-}
-function initVisitor(visitor) {
-    if (typeof visitor === 'object' &&
-        (visitor.Collection || visitor.Node || visitor.Value)) {
-        return Object.assign({
-            Alias: visitor.Node,
-            Map: visitor.Node,
-            Scalar: visitor.Node,
-            Seq: visitor.Node
-        }, visitor.Value && {
-            Map: visitor.Value,
-            Scalar: visitor.Value,
-            Seq: visitor.Value
-        }, visitor.Collection && {
-            Map: visitor.Collection,
-            Seq: visitor.Collection
-        }, visitor);
-    }
-    return visitor;
-}
-function callVisitor(key, node, visitor, path) {
-    if (typeof visitor === 'function')
-        return visitor(key, node, path);
-    if (identity.isMap(node))
-        return visitor.Map?.(key, node, path);
-    if (identity.isSeq(node))
-        return visitor.Seq?.(key, node, path);
-    if (identity.isPair(node))
-        return visitor.Pair?.(key, node, path);
-    if (identity.isScalar(node))
-        return visitor.Scalar?.(key, node, path);
-    if (identity.isAlias(node))
-        return visitor.Alias?.(key, node, path);
-    return undefined;
-}
-function replaceNode(key, path, node) {
-    const parent = path[path.length - 1];
-    if (identity.isCollection(parent)) {
-        parent.items[key] = node;
-    }
-    else if (identity.isPair(parent)) {
-        if (key === 'key')
-            parent.key = node;
-        else
-            parent.value = node;
-    }
-    else if (identity.isDocument(parent)) {
-        parent.contents = node;
-    }
-    else {
-        const pt = identity.isAlias(parent) ? 'alias' : 'scalar';
-        throw new Error(`Cannot replace node with ${pt} parent`);
-    }
-}
-
-exports.visit = visit;
-exports.visitAsync = visitAsync;

package/staging_area/desktop/rilvox/node_modules/yaml/package.json

@@ -1,97 +0,0 @@
-{
-  "name": "yaml",
-  "version": "2.8.2",
-  "license": "ISC",
-  "author": "Eemeli Aro <eemeli@gmail.com>",
-  "funding": "https://github.com/sponsors/eemeli",
-  "repository": "github:eemeli/yaml",
-  "description": "JavaScript parser and stringifier for YAML",
-  "keywords": [
-    "YAML",
-    "parser",
-    "stringifier"
-  ],
-  "homepage": "https://eemeli.org/yaml/",
-  "files": [
-    "browser/",
-    "dist/",
-    "util.js"
-  ],
-  "type": "commonjs",
-  "main": "./dist/index.js",
-  "bin": "./bin.mjs",
-  "browser": {
-    "./dist/index.js": "./browser/index.js",
-    "./dist/util.js": "./browser/dist/util.js",
-    "./util.js": "./browser/dist/util.js"
-  },
-  "exports": {
-    ".": {
-      "types": "./dist/index.d.ts",
-      "node": "./dist/index.js",
-      "default": "./browser/index.js"
-    },
-    "./package.json": "./package.json",
-    "./util": {
-      "types": "./dist/util.d.ts",
-      "node": "./dist/util.js",
-      "default": "./browser/dist/util.js"
-    }
-  },
-  "scripts": {
-    "build": "npm run build:node && npm run build:browser",
-    "build:browser": "rollup -c config/rollup.browser-config.mjs",
-    "build:node": "rollup -c config/rollup.node-config.mjs",
-    "clean": "git clean -fdxe node_modules",
-    "lint": "eslint config/ src/",
-    "prettier": "prettier --write .",
-    "prestart": "rollup --sourcemap -c config/rollup.node-config.mjs",
-    "start": "node --enable-source-maps -i -e 'YAML=require(\"./dist/index.js\");const{parse,parseDocument,parseAllDocuments}=YAML'",
-    "test": "jest --config config/jest.config.js",
-    "test:all": "npm test && npm run test:types && npm run test:dist && npm run test:dist:types",
-    "test:browsers": "cd playground && npm test",
-    "test:dist": "npm run build:node && jest --config config/jest.config.js",
-    "test:dist:types": "tsc --allowJs --moduleResolution node --noEmit --target es5 dist/index.js",
-    "test:types": "tsc --noEmit && tsc --noEmit -p tests/tsconfig.json",
-    "docs:install": "cd docs-slate && bundle install",
-    "predocs:deploy": "node docs/prepare-docs.mjs",
-    "docs:deploy": "cd docs-slate && ./deploy.sh",
-    "predocs": "node docs/prepare-docs.mjs",
-    "docs": "cd docs-slate && bundle exec middleman server",
-    "preversion": "npm test && npm run build",
-    "prepublishOnly": "npm run clean && npm test && npm run build"
-  },
-  "browserslist": "defaults, not ie 11",
-  "prettier": {
-    "arrowParens": "avoid",
-    "semi": false,
-    "singleQuote": true,
-    "trailingComma": "none"
-  },
-  "devDependencies": {
-    "@babel/core": "^7.12.10",
-    "@babel/plugin-transform-typescript": "^7.12.17",
-    "@babel/preset-env": "^7.12.11",
-    "@eslint/js": "^9.9.1",
-    "@rollup/plugin-babel": "^6.0.3",
-    "@rollup/plugin-replace": "^6.0.3",
-    "@rollup/plugin-typescript": "^12.1.1",
-    "@types/jest": "^29.2.4",
-    "@types/node": "^20.11.20",
-    "babel-jest": "^29.0.1",
-    "eslint": "^9.9.1",
-    "eslint-config-prettier": "^10.1.8",
-    "fast-check": "^2.12.0",
-    "jest": "^29.0.1",
-    "jest-resolve": "^29.7.0",
-    "jest-ts-webcompat-resolver": "^1.0.0",
-    "prettier": "^3.0.2",
-    "rollup": "^4.12.0",
-    "tslib": "^2.8.1",
-    "typescript": "^5.7.2",
-    "typescript-eslint": "^8.4.0"
-  },
-  "engines": {
-    "node": ">= 14.6"
-  }
-}

package/staging_area/desktop/rilvox/node_modules/yaml/util.js

@@ -1,2 +0,0 @@
-// Re-exporter for Node.js < 12.16.0
-module.exports = require('./dist/util.js')

package/staging_area/desktop/rilvox/node_modules/yocto-queue/index.d.ts

@@ -1,56 +0,0 @@
-declare class Queue<ValueType> implements Iterable<ValueType> {
-	/**
-	The size of the queue.
-	*/
-	readonly size: number;
-
-	/**
-	Tiny queue data structure.
-
-	The instance is an [`Iterable`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols), which means you can iterate over the queue front to back with a “for…of” loop, or use spreading to convert the queue to an array. Don't do this unless you really need to though, since it's slow.
-
-	@example
-	```
-	import Queue = require('yocto-queue');
-
-	const queue = new Queue();
-
-	queue.enqueue('🦄');
-	queue.enqueue('🌈');
-
-	console.log(queue.size);
-	//=> 2
-
-	console.log(...queue);
-	//=> '🦄 🌈'
-
-	console.log(queue.dequeue());
-	//=> '🦄'
-
-	console.log(queue.dequeue());
-	//=> '🌈'
-	```
-	*/
-	constructor();
-
-	[Symbol.iterator](): IterableIterator<ValueType>;
-
-	/**
-	Add a value to the queue.
-	*/
-	enqueue(value: ValueType): void;
-
-	/**
-	Remove the next value in the queue.
-
-	@returns The removed value or `undefined` if the queue is empty.
-	*/
-	dequeue(): ValueType | undefined;
-
-	/**
-	Clear the queue.
-	*/
-	clear(): void;
-}
-
-export = Queue;

package/staging_area/desktop/rilvox/node_modules/yocto-queue/index.js

@@ -1,68 +0,0 @@
-class Node {
-	/// value;
-	/// next;
-
-	constructor(value) {
-		this.value = value;
-
-		// TODO: Remove this when targeting Node.js 12.
-		this.next = undefined;
-	}
-}
-
-class Queue {
-	// TODO: Use private class fields when targeting Node.js 12.
-	// #_head;
-	// #_tail;
-	// #_size;
-
-	constructor() {
-		this.clear();
-	}
-
-	enqueue(value) {
-		const node = new Node(value);
-
-		if (this._head) {
-			this._tail.next = node;
-			this._tail = node;
-		} else {
-			this._head = node;
-			this._tail = node;
-		}
-
-		this._size++;
-	}
-
-	dequeue() {
-		const current = this._head;
-		if (!current) {
-			return;
-		}
-
-		this._head = this._head.next;
-		this._size--;
-		return current.value;
-	}
-
-	clear() {
-		this._head = undefined;
-		this._tail = undefined;
-		this._size = 0;
-	}
-
-	get size() {
-		return this._size;
-	}
-
-	* [Symbol.iterator]() {
-		let current = this._head;
-
-		while (current) {
-			yield current.value;
-			current = current.next;
-		}
-	}
-}
-
-module.exports = Queue;

package/staging_area/desktop/rilvox/node_modules/yocto-queue/license

@@ -1,9 +0,0 @@
-MIT License
-
-Copyright (c) Sindre Sorhus <sindresorhus@gmail.com> (https://sindresorhus.com)
-
-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.

package/staging_area/desktop/rilvox/node_modules/yocto-queue/package.json

@@ -1,43 +0,0 @@
-{
-	"name": "yocto-queue",
-	"version": "0.1.0",
-	"description": "Tiny queue data structure",
-	"license": "MIT",
-	"repository": "sindresorhus/yocto-queue",
-	"funding": "https://github.com/sponsors/sindresorhus",
-	"author": {
-		"name": "Sindre Sorhus",
-		"email": "sindresorhus@gmail.com",
-		"url": "https://sindresorhus.com"
-	},
-	"engines": {
-		"node": ">=10"
-	},
-	"scripts": {
-		"test": "xo && ava && tsd"
-	},
-	"files": [
-		"index.js",
-		"index.d.ts"
-	],
-	"keywords": [
-		"queue",
-		"data",
-		"structure",
-		"algorithm",
-		"queues",
-		"queuing",
-		"list",
-		"array",
-		"linkedlist",
-		"fifo",
-		"enqueue",
-		"dequeue",
-		"data-structure"
-	],
-	"devDependencies": {
-		"ava": "^2.4.0",
-		"tsd": "^0.13.1",
-		"xo": "^0.35.0"
-	}
-}

package/staging_area/desktop/rilvox/node_modules/yocto-queue/readme.md

@@ -1,64 +0,0 @@
-# yocto-queue [![](https://badgen.net/bundlephobia/minzip/yocto-queue)](https://bundlephobia.com/result?p=yocto-queue)
-
-> Tiny queue data structure
-
-You should use this package instead of an array if you do a lot of `Array#push()` and `Array#shift()` on large arrays, since `Array#shift()` has [linear time complexity](https://medium.com/@ariel.salem1989/an-easy-to-use-guide-to-big-o-time-complexity-5dcf4be8a444#:~:text=O(N)%E2%80%94Linear%20Time) *O(n)* while `Queue#dequeue()` has [constant time complexity](https://medium.com/@ariel.salem1989/an-easy-to-use-guide-to-big-o-time-complexity-5dcf4be8a444#:~:text=O(1)%20%E2%80%94%20Constant%20Time) *O(1)*. That makes a huge difference for large arrays.
-
-> A [queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)) is an ordered list of elements where an element is inserted at the end of the queue and is removed from the front of the queue. A queue works based on the first-in, first-out ([FIFO](https://en.wikipedia.org/wiki/FIFO_(computing_and_electronics))) principle.
-
-## Install
-
-```
-$ npm install yocto-queue
-```
-
-## Usage
-
-```js
-const Queue = require('yocto-queue');
-
-const queue = new Queue();
-
-queue.enqueue('🦄');
-queue.enqueue('🌈');
-
-console.log(queue.size);
-//=> 2
-
-console.log(...queue);
-//=> '🦄 🌈'
-
-console.log(queue.dequeue());
-//=> '🦄'
-
-console.log(queue.dequeue());
-//=> '🌈'
-```
-
-## API
-
-### `queue = new Queue()`
-
-The instance is an [`Iterable`](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols), which means you can iterate over the queue front to back with a “for…of” loop, or use spreading to convert the queue to an array. Don't do this unless you really need to though, since it's slow.
-
-#### `.enqueue(value)`
-
-Add a value to the queue.
-
-#### `.dequeue()`
-
-Remove the next value in the queue.
-
-Returns the removed value or `undefined` if the queue is empty.
-
-#### `.clear()`
-
-Clear the queue.
-
-#### `.size`
-
-The size of the queue.
-
-## Related
-
-- [quick-lru](https://github.com/sindresorhus/quick-lru) - Simple “Least Recently Used” (LRU) cache

package/staging_area/desktop/rilvox/node_modules/zeptomatch/dist/convert/grammar.d.ts

@@ -1,2 +0,0 @@
-declare const Grammar: import("grammex").ExplicitRule<string>;
-export default Grammar;

package/staging_area/desktop/rilvox/node_modules/zeptomatch/dist/convert/grammar.js

@@ -1,65 +0,0 @@
-/* IMPORT */
-import { match, and, lazy, optional, or, star } from 'grammex';
-import { makeRangeAlpha, makeRangePaddedInt } from '../range.js';
-import { identity } from '../utils.js';
-import convert from './parser.js';
-/* MAIN */
-const Escaped = match(/\\./, identity);
-const Escape = match(/[$.*+?^(){}[\]\|]/, char => `\\${char}`);
-const Slash = match(/[\\/]/, '[\\\\/]');
-const Passthrough = match(/./, identity);
-// const ExtglobEscape = match ( /[$.*+?^({}[\]]/, char => `\\${char}` );
-// const ExtglobPassthrough = match ( /[^)]/, identity );
-// const ExtglobValue = lazy ( () => or ([ StarStar, Star, Question, Class, Range, Braces, Escaped, ExtglobEscape, ExtglobAlternation, ExtglobPassthrough ]) );
-// const ExtglobAlternation = match ( '|', identity );
-// const ExtglobQuestionOpen = match ( '?(', '(?:' );
-// const ExtglobQuestionClose = match ( ')', ')?' );
-// const ExtglobQuestion = and ([ ExtglobQuestionOpen, star ( ExtglobValue ), ExtglobQuestionClose ]);
-// const ExtglobStarOpen = match ( '*(', '(?:' );
-// const ExtglobStarClose = match ( ')', ')*' );
-// const ExtglobStar = and ([ ExtglobStarOpen, star ( ExtglobValue ), ExtglobStarClose ]);
-// const ExtglobPlusOpen = match ( '+(', '(?:' );
-// const ExtglobPlusClose = match ( ')', ')+?' );
-// const ExtglobPlus = and ([ ExtglobPlusOpen, star ( ExtglobValue ), ExtglobPlusClose ]);
-// const ExtglobNegationOpen = match ( '!(', '(?!' );
-// const ExtglobNegationClose = match ( ')', ').*?(?!$)' );
-// const ExtglobNegation = and ([ ExtglobNegationOpen, star ( ExtglobValue ), ExtglobNegationClose ]);
-// const Extglob = or ([ ExtglobQuestion, ExtglobStar, ExtglobPlus, ExtglobNegation ]);
-const NegationOdd = match(/^(?:!!)*!(.*)$/, (_, glob) => `(?!^${convert(glob)}$).*?`);
-const NegationEven = match(/^(!!)+/, '');
-const Negation = or([NegationOdd, NegationEven]);
-const StarStarBetween = match(/\/(\*\*\/)+/, '(?:[\\\\/].+[\\\\/]|[\\\\/])');
-const StarStarStart = match(/^(\*\*\/)+/, '(?:^|.*[\\\\/])');
-const StarStarEnd = match(/\/(\*\*)$/, '(?:[\\\\/].*|$)');
-const StarStarNone = match(/\*\*/, '.*');
-const StarStar = or([StarStarBetween, StarStarStart, StarStarEnd, StarStarNone]);
-const StarDouble = match(/\*\/(?!\*\*\/|\*$)/, '[^\\\\/]*[\\\\/]');
-const StarSingle = match(/\*/, '[^\\\\/]*');
-const Star = or([StarDouble, StarSingle]);
-const Question = match('?', '[^\\\\/]');
-const ClassOpen = match('[', identity);
-const ClassClose = match(']', identity);
-const ClassNegation = match(/[!^]/, '^\\\\/');
-const ClassRange = match(/[a-z]-[a-z]|[0-9]-[0-9]/i, identity);
-const ClassEscape = match(/[$.*+?^(){}[\|]/, char => `\\${char}`);
-const ClassPassthrough = match(/[^\]]/, identity);
-const ClassValue = or([Escaped, ClassEscape, ClassRange, ClassPassthrough]);
-const Class = and([ClassOpen, optional(ClassNegation), star(ClassValue), ClassClose]);
-const RangeOpen = match('{', '(?:');
-const RangeClose = match('}', ')');
-const RangeNumeric = match(/(\d+)\.\.(\d+)/, (_, $1, $2) => makeRangePaddedInt(+$1, +$2, Math.min($1.length, $2.length)).join('|'));
-const RangeAlphaLower = match(/([a-z]+)\.\.([a-z]+)/, (_, $1, $2) => makeRangeAlpha($1, $2).join('|'));
-const RangeAlphaUpper = match(/([A-Z]+)\.\.([A-Z]+)/, (_, $1, $2) => makeRangeAlpha($1.toLowerCase(), $2.toLowerCase()).join('|').toUpperCase());
-const RangeValue = or([RangeNumeric, RangeAlphaLower, RangeAlphaUpper]);
-const Range = and([RangeOpen, RangeValue, RangeClose]);
-const BracesOpen = match('{', '(?:');
-const BracesClose = match('}', ')');
-const BracesComma = match(',', '|');
-const BracesEscape = match(/[$.*+?^(){[\]\|]/, char => `\\${char}`);
-const BracesPassthrough = match(/[^}]/, identity);
-const BracesNested = lazy(() => Braces);
-const BracesValue = or([StarStar, Star, Question, Class, Range, BracesNested, Escaped, BracesEscape, BracesComma, BracesPassthrough]);
-const Braces = and([BracesOpen, star(BracesValue), BracesClose]);
-const Grammar = star(or([Negation, StarStar, Star, Question, Class, Range, Braces, Escaped, Escape, Slash, Passthrough]));
-/* EXPORT */
-export default Grammar;

package/staging_area/desktop/rilvox/node_modules/zeptomatch/dist/convert/parser.d.ts

@@ -1,2 +0,0 @@
-declare const parser: (input: string) => string;
-export default parser;

package/staging_area/desktop/rilvox/node_modules/zeptomatch/dist/convert/parser.js

@@ -1,7 +0,0 @@
-/* IMPORT */
-import { makeParser } from '../utils.js';
-import Grammar from './grammar.js';
-/* MAIN */
-const parser = makeParser(Grammar);
-/* EXPORT */
-export default parser;

package/staging_area/desktop/rilvox/node_modules/zeptomatch/dist/index.d.ts

@@ -1,5 +0,0 @@
-declare const zeptomatch: {
-    (glob: string | string[], path: string): boolean;
-    compile: (arg: string) => RegExp;
-};
-export default zeptomatch;