Initial commit: New MoreminiMore website with fresh design

This commit is contained in:
MoreminiMore
2026-04-22 01:59:05 +07:00
commit 76409638cc
14010 changed files with 2052041 additions and 0 deletions

55
node_modules/common-ancestor-path/LICENSE.md generated vendored Normal file
View File

@@ -0,0 +1,55 @@
# Blue Oak Model License
Version 1.0.0
## Purpose
This license gives everyone as much permission to work with
this software as possible, while protecting contributors
from liability.
## Acceptance
In order to receive this license, you must agree to its
rules. The rules of this license are both obligations
under that agreement and conditions to your license.
You must not do anything with this software that triggers
a rule that you cannot or will not follow.
## Copyright
Each contributor licenses you to do everything with this
software that would otherwise infringe that contributor's
copyright in it.
## Notices
You must ensure that everyone who gets a copy of
any part of this software from you, with or without
changes, also gets the text of this license or a link to
<https://blueoakcouncil.org/license/1.0.0>.
## Excuse
If anyone notifies you in writing that you have not
complied with [Notices](#notices), you can keep your
license by taking all practical steps to comply within 30
days after the notice. If you do not do so, your license
ends immediately.
## Patent
Each contributor licenses you to do everything with this
software that would otherwise infringe any patent claims
they can license or become able to license.
## Reliability
No contributor can revoke this license.
## No Liability
***As far as the law allows, this software comes as is,
without any warranty or condition, and no contributor
will be liable to anyone for any damages related to this
software or this license, under any kind of legal claim.***

30
node_modules/common-ancestor-path/README.md generated vendored Normal file
View File

@@ -0,0 +1,30 @@
# common-ancestor-path
Find the common ancestor of 2 or more paths on Windows or Unix
## USAGE
Give it two or more path strings, and it'll do the thing.
```ts
import { commonAncestorPath } from 'common-ancestor-path'
// or:
// const { commonAncestorPath } = require('common-ancestor-path')
// output /a/b
console.log(commonAncestorPath('/a/b/c/d', '/a/b/x/y/z', '/a/b/c/i/j/k'))
// normalizes separators, but NOT cases, since it matters sometimes
console.log(commonAncestorPath('C:\\a\\b\\c', 'C:\\a\\b\\x'))
// no common ancestor on different windows drive letters
// so, this returns null
console.log(commonAncestorPath('c:\\a\\b\\c', 'd:\\d\\e\\f'))
```
## API
`commonAncestorPath(...paths)`
Returns the nearest (deepest) common ancestor path, or `null` if on
different roots on Windows.

View File

@@ -0,0 +1,2 @@
export declare const commonAncestorPath: (...paths: (string | null)[]) => string | null;
//# sourceMappingURL=index.d.ts.map

View File

@@ -0,0 +1 @@
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAkBA,eAAO,MAAM,kBAAkB,GAAI,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,kBAC3C,CAAA"}

View File

@@ -0,0 +1,20 @@
"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
exports.commonAncestorPath = void 0;
const node_path_1 = require("node:path");
function* commonArrayMembers(a, b) {
const [l, s] = a.length > b.length ? [a, b] : [b, a];
for (const x of s) {
if (x === l.shift())
yield x;
else
break;
}
}
const cap = (a, b) => a === b ? a
: !a || !b ? null
: (0, node_path_1.parse)(a).root !== (0, node_path_1.parse)(b).root ? null
: [...commonArrayMembers((0, node_path_1.normalize)(a).split(node_path_1.sep), (0, node_path_1.normalize)(b).split(node_path_1.sep))].join(node_path_1.sep);
const commonAncestorPath = (...paths) => paths.reduce(cap);
exports.commonAncestorPath = commonAncestorPath;
//# sourceMappingURL=index.js.map

View File

@@ -0,0 +1 @@
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":";;;AAAA,yCAAyD;AAEzD,QAAQ,CAAC,CAAC,kBAAkB,CAAC,CAAW,EAAE,CAAW;IACnD,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE;YAAE,MAAM,CAAC,CAAA;;YACvB,MAAK;IACZ,CAAC;AACH,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,CAAgB,EAAE,CAAgB,EAAE,EAAE,CACjD,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACX,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QACjB,CAAC,CAAC,IAAA,iBAAK,EAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAA,iBAAK,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;YACxC,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,KAAK,CAAC,eAAG,CAAC,EAAE,IAAA,qBAAI,EAAC,CAAC,CAAC,CAAC,KAAK,CAAC,eAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAClE,eAAG,CACJ,CAAA;AAEE,MAAM,kBAAkB,GAAG,CAAC,GAAG,KAAwB,EAAE,EAAE,CAChE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;AADN,QAAA,kBAAkB,sBACZ","sourcesContent":["import { parse, sep, normalize as norm } from 'node:path'\n\nfunction* commonArrayMembers(a: string[], b: string[]) {\n const [l, s] = a.length > b.length ? [a, b] : [b, a]\n for (const x of s) {\n if (x === l.shift()) yield x\n else break\n }\n}\n\nconst cap = (a: string | null, b: string | null) =>\n a === b ? a\n : !a || !b ? null\n : parse(a).root !== parse(b).root ? null\n : [...commonArrayMembers(norm(a).split(sep), norm(b).split(sep))].join(\n sep,\n )\n\nexport const commonAncestorPath = (...paths: (string | null)[]) =>\n paths.reduce(cap)\n"]}

View File

@@ -0,0 +1,3 @@
{
"type": "commonjs"
}

View File

@@ -0,0 +1,2 @@
export declare const commonAncestorPath: (...paths: (string | null)[]) => string | null;
//# sourceMappingURL=index.d.ts.map

View File

@@ -0,0 +1 @@
{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAkBA,eAAO,MAAM,kBAAkB,GAAI,GAAG,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,EAAE,kBAC3C,CAAA"}

16
node_modules/common-ancestor-path/dist/esm/index.js generated vendored Normal file
View File

@@ -0,0 +1,16 @@
import { parse, sep, normalize as norm } from 'node:path';
function* commonArrayMembers(a, b) {
const [l, s] = a.length > b.length ? [a, b] : [b, a];
for (const x of s) {
if (x === l.shift())
yield x;
else
break;
}
}
const cap = (a, b) => a === b ? a
: !a || !b ? null
: parse(a).root !== parse(b).root ? null
: [...commonArrayMembers(norm(a).split(sep), norm(b).split(sep))].join(sep);
export const commonAncestorPath = (...paths) => paths.reduce(cap);
//# sourceMappingURL=index.js.map

View File

@@ -0,0 +1 @@
{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,GAAG,EAAE,SAAS,IAAI,IAAI,EAAE,MAAM,WAAW,CAAA;AAEzD,QAAQ,CAAC,CAAC,kBAAkB,CAAC,CAAW,EAAE,CAAW;IACnD,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACpD,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;QAClB,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE;YAAE,MAAM,CAAC,CAAA;;YACvB,MAAK;IACZ,CAAC;AACH,CAAC;AAED,MAAM,GAAG,GAAG,CAAC,CAAgB,EAAE,CAAgB,EAAE,EAAE,CACjD,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACX,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QACjB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI;YACxC,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAClE,GAAG,CACJ,CAAA;AAEL,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,GAAG,KAAwB,EAAE,EAAE,CAChE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA","sourcesContent":["import { parse, sep, normalize as norm } from 'node:path'\n\nfunction* commonArrayMembers(a: string[], b: string[]) {\n const [l, s] = a.length > b.length ? [a, b] : [b, a]\n for (const x of s) {\n if (x === l.shift()) yield x\n else break\n }\n}\n\nconst cap = (a: string | null, b: string | null) =>\n a === b ? a\n : !a || !b ? null\n : parse(a).root !== parse(b).root ? null\n : [...commonArrayMembers(norm(a).split(sep), norm(b).split(sep))].join(\n sep,\n )\n\nexport const commonAncestorPath = (...paths: (string | null)[]) =>\n paths.reduce(cap)\n"]}

View File

@@ -0,0 +1,3 @@
{
"type": "module"
}

60
node_modules/common-ancestor-path/package.json generated vendored Normal file
View File

@@ -0,0 +1,60 @@
{
"name": "common-ancestor-path",
"version": "2.0.0",
"files": [
"dist"
],
"description": "Find the common ancestor of 2 or more paths on Windows or Unix",
"repository": {
"type": "git",
"url": "git@github.com:isaacs/common-ancestor-path"
},
"author": "Isaac Z. Schlueter <i@izs.me> (https://izs.me)",
"license": "BlueOak-1.0.0",
"scripts": {
"preversion": "npm test",
"postversion": "npm publish",
"prepublishOnly": "git push origin --follow-tags",
"prepare": "tshy",
"pretest": "npm run prepare",
"presnap": "npm run prepare",
"test": "tap",
"snap": "tap",
"format": "prettier --write . --log-level warn --cache",
"typedoc": "typedoc"
},
"devDependencies": {
"@types/node": "^24.10.1",
"prettier": "^3.6.2",
"require-inject": "^1.4.4",
"tap": "^21.1.6",
"tshy": "^3.1.0",
"typedoc": "^0.28.14"
},
"type": "module",
"tshy": {
"exports": {
"./package.json": "./package.json",
".": "./src/index.ts"
}
},
"exports": {
"./package.json": "./package.json",
".": {
"import": {
"types": "./dist/esm/index.d.ts",
"default": "./dist/esm/index.js"
},
"require": {
"types": "./dist/commonjs/index.d.ts",
"default": "./dist/commonjs/index.js"
}
}
},
"main": "./dist/commonjs/index.js",
"types": "./dist/commonjs/index.d.ts",
"module": "./dist/esm/index.js",
"engines": {
"node": ">= 18"
}
}