fix: resolve TypeScript errors in frontend build

This commit is contained in:
Hiro
2026-03-30 23:16:07 +00:00
parent b733306773
commit 24925e1acb
2941 changed files with 418042 additions and 49 deletions

19
node_modules/orderedmap/LICENSE generated vendored Normal file
View File

@@ -0,0 +1,19 @@
Copyright (C) 2016 by Marijn Haverbeke <marijn@haverbeke.berlin> and others
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.

69
node_modules/orderedmap/README.md generated vendored Normal file
View File

@@ -0,0 +1,69 @@
# OrderedMap
Persistent data structure representing an ordered mapping from strings
to values, with some convenient update methods.
This is not an efficient data structure for large maps, just a minimal
helper for cleanly creating and managing small maps in a way that
makes their key order explicit and easy to think about.
License: MIT
## Reference
The exported value from this module is the class `OrderedMap`,
instances of which represent a mapping from strings to arbitrary
values.
**`OrderedMap.from`**`(value: ?Object | OrderedMap) → OrderedMap`
Return a map with the given content. If null, create an empty map. If
given an ordered map, return that map itself. If given an object,
create a map from the object's properties.
### Methods
Instances of `OrderedMap` have the following methods and properties:
**`get`**`(key: string) → ?any`
Retrieve the value stored under `key`, or return undefined when
no such key exists.
**`update`**`(key: string, value: any, newKey: ?string) → OrderedMap`
Create a new map by replacing the value of `key` with a new
value, or adding a binding to the end of the map. If `newKey` is
given, the key of the binding will be replaced with that key.
**`remove`**`(key: string) → OrderedMap`
Return a map with the given key removed, if it existed.
**`addToStart`**`(key: string, value: any) → OrderedMap`
Add a new key to the start of the map.
**`addToEnd`**`(key: string, value: any) → OrderedMap`
Add a new key to the end of the map.
**`addBefore`**`(place: string, key: value: string, value: any) → OrderedMap`
Add a key after the given key. If `place` is not found, the new
key is added to the end.
**`forEach`**`(f: (key: string, value: any))`
Call the given function for each key/value pair in the map, in
order.
**`prepend`**`(map: Object | OrderedMap) → OrderedMap`
Create a new map by prepending the keys in this map that don't
appear in `map` before the keys in `map`.
**`append`**`(map: Object | OrderedMap) → OrderedMap`
Create a new map by appending the keys in this map that don't
appear in `map` after the keys in `map`.
**`subtract`**`(map: Object | OrderedMap) → OrderedMap`
Create a map containing all the keys in this map that don't
appear in `map`.
**`toObject`**`() -> Object`
Return an object that has the same key/value pairs as the `map`.
**`size`**`: number`
The amount of keys in this map.

139
node_modules/orderedmap/dist/index.cjs generated vendored Normal file
View File

@@ -0,0 +1,139 @@
'use strict';
// ::- Persistent data structure representing an ordered mapping from
// strings to values, with some convenient update methods.
function OrderedMap(content) {
this.content = content;
}
OrderedMap.prototype = {
constructor: OrderedMap,
find: function(key) {
for (var i = 0; i < this.content.length; i += 2)
if (this.content[i] === key) return i
return -1
},
// :: (string) → ?any
// Retrieve the value stored under `key`, or return undefined when
// no such key exists.
get: function(key) {
var found = this.find(key);
return found == -1 ? undefined : this.content[found + 1]
},
// :: (string, any, ?string) → OrderedMap
// Create a new map by replacing the value of `key` with a new
// value, or adding a binding to the end of the map. If `newKey` is
// given, the key of the binding will be replaced with that key.
update: function(key, value, newKey) {
var self = newKey && newKey != key ? this.remove(newKey) : this;
var found = self.find(key), content = self.content.slice();
if (found == -1) {
content.push(newKey || key, value);
} else {
content[found + 1] = value;
if (newKey) content[found] = newKey;
}
return new OrderedMap(content)
},
// :: (string) → OrderedMap
// Return a map with the given key removed, if it existed.
remove: function(key) {
var found = this.find(key);
if (found == -1) return this
var content = this.content.slice();
content.splice(found, 2);
return new OrderedMap(content)
},
// :: (string, any) → OrderedMap
// Add a new key to the start of the map.
addToStart: function(key, value) {
return new OrderedMap([key, value].concat(this.remove(key).content))
},
// :: (string, any) → OrderedMap
// Add a new key to the end of the map.
addToEnd: function(key, value) {
var content = this.remove(key).content.slice();
content.push(key, value);
return new OrderedMap(content)
},
// :: (string, string, any) → OrderedMap
// Add a key after the given key. If `place` is not found, the new
// key is added to the end.
addBefore: function(place, key, value) {
var without = this.remove(key), content = without.content.slice();
var found = without.find(place);
content.splice(found == -1 ? content.length : found, 0, key, value);
return new OrderedMap(content)
},
// :: ((key: string, value: any))
// Call the given function for each key/value pair in the map, in
// order.
forEach: function(f) {
for (var i = 0; i < this.content.length; i += 2)
f(this.content[i], this.content[i + 1]);
},
// :: (union<Object, OrderedMap>) → OrderedMap
// Create a new map by prepending the keys in this map that don't
// appear in `map` before the keys in `map`.
prepend: function(map) {
map = OrderedMap.from(map);
if (!map.size) return this
return new OrderedMap(map.content.concat(this.subtract(map).content))
},
// :: (union<Object, OrderedMap>) → OrderedMap
// Create a new map by appending the keys in this map that don't
// appear in `map` after the keys in `map`.
append: function(map) {
map = OrderedMap.from(map);
if (!map.size) return this
return new OrderedMap(this.subtract(map).content.concat(map.content))
},
// :: (union<Object, OrderedMap>) → OrderedMap
// Create a map containing all the keys in this map that don't
// appear in `map`.
subtract: function(map) {
var result = this;
map = OrderedMap.from(map);
for (var i = 0; i < map.content.length; i += 2)
result = result.remove(map.content[i]);
return result
},
// :: () → Object
// Turn ordered map into a plain object.
toObject: function() {
var result = {};
this.forEach(function(key, value) { result[key] = value; });
return result
},
// :: number
// The amount of keys in this map.
get size() {
return this.content.length >> 1
}
};
// :: (?union<Object, OrderedMap>) → OrderedMap
// Return a map with the given content. If null, create an empty
// map. If given an ordered map, return that map itself. If given an
// object, create a map from the object's properties.
OrderedMap.from = function(value) {
if (value instanceof OrderedMap) return value
var content = [];
if (value) for (var prop in value) content.push(prop, value[prop]);
return new OrderedMap(content)
};
module.exports = OrderedMap;

33
node_modules/orderedmap/dist/index.d.cts generated vendored Normal file
View File

@@ -0,0 +1,33 @@
declare class OrderedMap<T = any> {
private constructor(content: Array<string | T>)
get(key: string): T | undefined
update(key: string, value: T, newKey?: string): OrderedMap<T>
remove(key: string): OrderedMap<T>
addToStart(key: string, value: T): OrderedMap<T>
addToEnd(key: string, value: T): OrderedMap<T>
addBefore(place: string, key: string, value: T): OrderedMap<T>
forEach(fn: (key: string, value: T) => any): void
prepend(map: MapLike<T>): OrderedMap<T>
append(map: MapLike<T>): OrderedMap<T>
subtract(map: MapLike<T>): OrderedMap<T>
toObject(): Record<string, T>;
readonly size: number
static from<T>(map: MapLike<T>): OrderedMap<T>
}
export type MapLike<T = any> = Record<string, T> | OrderedMap<T>
export default OrderedMap

33
node_modules/orderedmap/dist/index.d.ts generated vendored Normal file
View File

@@ -0,0 +1,33 @@
declare class OrderedMap<T = any> {
private constructor(content: Array<string | T>)
get(key: string): T | undefined
update(key: string, value: T, newKey?: string): OrderedMap<T>
remove(key: string): OrderedMap<T>
addToStart(key: string, value: T): OrderedMap<T>
addToEnd(key: string, value: T): OrderedMap<T>
addBefore(place: string, key: string, value: T): OrderedMap<T>
forEach(fn: (key: string, value: T) => any): void
prepend(map: MapLike<T>): OrderedMap<T>
append(map: MapLike<T>): OrderedMap<T>
subtract(map: MapLike<T>): OrderedMap<T>
toObject(): Record<string, T>;
readonly size: number
static from<T>(map: MapLike<T>): OrderedMap<T>
}
export type MapLike<T = any> = Record<string, T> | OrderedMap<T>
export default OrderedMap

137
node_modules/orderedmap/dist/index.js generated vendored Normal file
View File

@@ -0,0 +1,137 @@
// ::- Persistent data structure representing an ordered mapping from
// strings to values, with some convenient update methods.
function OrderedMap(content) {
this.content = content;
}
OrderedMap.prototype = {
constructor: OrderedMap,
find: function(key) {
for (var i = 0; i < this.content.length; i += 2)
if (this.content[i] === key) return i
return -1
},
// :: (string) → ?any
// Retrieve the value stored under `key`, or return undefined when
// no such key exists.
get: function(key) {
var found = this.find(key);
return found == -1 ? undefined : this.content[found + 1]
},
// :: (string, any, ?string) → OrderedMap
// Create a new map by replacing the value of `key` with a new
// value, or adding a binding to the end of the map. If `newKey` is
// given, the key of the binding will be replaced with that key.
update: function(key, value, newKey) {
var self = newKey && newKey != key ? this.remove(newKey) : this;
var found = self.find(key), content = self.content.slice();
if (found == -1) {
content.push(newKey || key, value);
} else {
content[found + 1] = value;
if (newKey) content[found] = newKey;
}
return new OrderedMap(content)
},
// :: (string) → OrderedMap
// Return a map with the given key removed, if it existed.
remove: function(key) {
var found = this.find(key);
if (found == -1) return this
var content = this.content.slice();
content.splice(found, 2);
return new OrderedMap(content)
},
// :: (string, any) → OrderedMap
// Add a new key to the start of the map.
addToStart: function(key, value) {
return new OrderedMap([key, value].concat(this.remove(key).content))
},
// :: (string, any) → OrderedMap
// Add a new key to the end of the map.
addToEnd: function(key, value) {
var content = this.remove(key).content.slice();
content.push(key, value);
return new OrderedMap(content)
},
// :: (string, string, any) → OrderedMap
// Add a key after the given key. If `place` is not found, the new
// key is added to the end.
addBefore: function(place, key, value) {
var without = this.remove(key), content = without.content.slice();
var found = without.find(place);
content.splice(found == -1 ? content.length : found, 0, key, value);
return new OrderedMap(content)
},
// :: ((key: string, value: any))
// Call the given function for each key/value pair in the map, in
// order.
forEach: function(f) {
for (var i = 0; i < this.content.length; i += 2)
f(this.content[i], this.content[i + 1]);
},
// :: (union<Object, OrderedMap>) → OrderedMap
// Create a new map by prepending the keys in this map that don't
// appear in `map` before the keys in `map`.
prepend: function(map) {
map = OrderedMap.from(map);
if (!map.size) return this
return new OrderedMap(map.content.concat(this.subtract(map).content))
},
// :: (union<Object, OrderedMap>) → OrderedMap
// Create a new map by appending the keys in this map that don't
// appear in `map` after the keys in `map`.
append: function(map) {
map = OrderedMap.from(map);
if (!map.size) return this
return new OrderedMap(this.subtract(map).content.concat(map.content))
},
// :: (union<Object, OrderedMap>) → OrderedMap
// Create a map containing all the keys in this map that don't
// appear in `map`.
subtract: function(map) {
var result = this;
map = OrderedMap.from(map);
for (var i = 0; i < map.content.length; i += 2)
result = result.remove(map.content[i]);
return result
},
// :: () → Object
// Turn ordered map into a plain object.
toObject: function() {
var result = {};
this.forEach(function(key, value) { result[key] = value; });
return result
},
// :: number
// The amount of keys in this map.
get size() {
return this.content.length >> 1
}
};
// :: (?union<Object, OrderedMap>) → OrderedMap
// Return a map with the given content. If null, create an empty
// map. If given an ordered map, return that map itself. If given an
// object, create a map from the object's properties.
OrderedMap.from = function(value) {
if (value instanceof OrderedMap) return value
var content = [];
if (value) for (var prop in value) content.push(prop, value[prop]);
return new OrderedMap(content)
};
export default OrderedMap;

39
node_modules/orderedmap/package.json generated vendored Normal file
View File

@@ -0,0 +1,39 @@
{
"name": "orderedmap",
"version": "2.1.1",
"description": "Persistent ordered mapping from strings",
"type": "module",
"main": "dist/index.cjs",
"types": "dist/index.d.ts",
"module": "dist/index.js",
"exports": {
"import": "./dist/index.js",
"require": "./dist/index.cjs"
},
"sideEffects": false,
"files": [
"dist/*"
],
"repository": {
"type": "git",
"url": "git+https://github.com/marijnh/orderedmap.git"
},
"keywords": [
"persistent",
"map"
],
"author": "Marijn Haverbeke <marijn@haverbeke.berlin>",
"license": "MIT",
"bugs": {
"url": "https://github.com/marijnh/orderedmap/issues"
},
"homepage": "https://github.com/marijnh/orderedmap#readme",
"scripts": {
"build": "rollup -c",
"watch": "rollup -c -w",
"prepare": "npm run build"
},
"devDependencies": {
"rollup": "^1.26.3"
}
}