diff --git a/README.md b/README.md
index 359ad16..149b6c8 100644
--- a/README.md
+++ b/README.md
@@ -1,2 +1,6 @@
# hwlz
+本软件系统是一个提供科学健康的养生知识;个性化的养生计划;提供养生食物搭配;给用户提供个性化建议及相关的养生知识
+
+的app。
+使用软件HbuilderX开发,主要使用JavaScript语言编程。
\ No newline at end of file
diff --git a/doc/01_行业和领域调研分析报告.docx b/doc/01_行业和领域调研分析报告.docx
new file mode 100644
index 0000000..6a57961
Binary files /dev/null and b/doc/01_行业和领域调研分析报告.docx differ
diff --git a/doc/02_软件系统的需求构思及描述.docx b/doc/02_软件系统的需求构思及描述.docx
new file mode 100644
index 0000000..ba1bca7
Binary files /dev/null and b/doc/02_软件系统的需求构思及描述.docx differ
diff --git a/doc/03_软件需求规格说明书.docx b/doc/03_软件需求规格说明书.docx
new file mode 100644
index 0000000..9335b17
Binary files /dev/null and b/doc/03_软件需求规格说明书.docx differ
diff --git a/doc/04_软件设计规格说明书.docx b/doc/04_软件设计规格说明书.docx
new file mode 100644
index 0000000..47011c9
Binary files /dev/null and b/doc/04_软件设计规格说明书.docx differ
diff --git a/model/2.txt b/model/2.txt
new file mode 100644
index 0000000..c200906
--- /dev/null
+++ b/model/2.txt
@@ -0,0 +1 @@
+222
diff --git a/model/数据流图.png b/model/数据流图.png
new file mode 100644
index 0000000..bc4a4d9
Binary files /dev/null and b/model/数据流图.png differ
diff --git a/model/界面外观设计-待办事项.png b/model/界面外观设计-待办事项.png
new file mode 100644
index 0000000..b9f7030
Binary files /dev/null and b/model/界面外观设计-待办事项.png differ
diff --git a/model/界面外观设计-我的.png b/model/界面外观设计-我的.png
new file mode 100644
index 0000000..931aefa
Binary files /dev/null and b/model/界面外观设计-我的.png differ
diff --git a/model/界面设计类图-待办事项.png b/model/界面设计类图-待办事项.png
new file mode 100644
index 0000000..951c549
Binary files /dev/null and b/model/界面设计类图-待办事项.png differ
diff --git a/model/界面设计类图-我的.png b/model/界面设计类图-我的.png
new file mode 100644
index 0000000..79dfaa9
Binary files /dev/null and b/model/界面设计类图-我的.png differ
diff --git a/model/界面设计类图-用户登录.png b/model/界面设计类图-用户登录.png
new file mode 100644
index 0000000..0577ffa
Binary files /dev/null and b/model/界面设计类图-用户登录.png differ
diff --git a/model/界面设计类图-知识库.png b/model/界面设计类图-知识库.png
new file mode 100644
index 0000000..92908d6
Binary files /dev/null and b/model/界面设计类图-知识库.png differ
diff --git a/model/界面设计类图-问卷个性化推荐.png b/model/界面设计类图-问卷个性化推荐.png
new file mode 100644
index 0000000..a86ad5d
Binary files /dev/null and b/model/界面设计类图-问卷个性化推荐.png differ
diff --git a/model/系统体系设计逻辑视图.png b/model/系统体系设计逻辑视图.png
new file mode 100644
index 0000000..07b67e4
Binary files /dev/null and b/model/系统体系设计逻辑视图.png differ
diff --git a/model/系统设计顺序图.png b/model/系统设计顺序图.png
new file mode 100644
index 0000000..94f3f5b
Binary files /dev/null and b/model/系统设计顺序图.png differ
diff --git a/model/设计文档_删除事项.png b/model/设计文档_删除事项.png
new file mode 100644
index 0000000..9b4660a
Binary files /dev/null and b/model/设计文档_删除事项.png differ
diff --git a/model/设计文档_填写问卷.png b/model/设计文档_填写问卷.png
new file mode 100644
index 0000000..a723a91
Binary files /dev/null and b/model/设计文档_填写问卷.png differ
diff --git a/model/设计文档_查看养生知识库.png b/model/设计文档_查看养生知识库.png
new file mode 100644
index 0000000..467717a
Binary files /dev/null and b/model/设计文档_查看养生知识库.png differ
diff --git a/model/设计文档_查看推荐方案.png b/model/设计文档_查看推荐方案.png
new file mode 100644
index 0000000..9494c14
Binary files /dev/null and b/model/设计文档_查看推荐方案.png differ
diff --git a/model/设计文档_查看资讯.png b/model/设计文档_查看资讯.png
new file mode 100644
index 0000000..3341866
Binary files /dev/null and b/model/设计文档_查看资讯.png differ
diff --git a/model/设计文档_用户注册.png b/model/设计文档_用户注册.png
new file mode 100644
index 0000000..212dd99
Binary files /dev/null and b/model/设计文档_用户注册.png differ
diff --git a/model/设计文档_用户登录.png b/model/设计文档_用户登录.png
new file mode 100644
index 0000000..8cde4d4
Binary files /dev/null and b/model/设计文档_用户登录.png differ
diff --git a/model/设计文档_编辑事项.png b/model/设计文档_编辑事项.png
new file mode 100644
index 0000000..3d52567
Binary files /dev/null and b/model/设计文档_编辑事项.png differ
diff --git a/model/设计类图.png b/model/设计类图.png
new file mode 100644
index 0000000..426b587
Binary files /dev/null and b/model/设计类图.png differ
diff --git a/model/软件外观设计-用户登录.png b/model/软件外观设计-用户登录.png
new file mode 100644
index 0000000..e712b95
Binary files /dev/null and b/model/软件外观设计-用户登录.png differ
diff --git a/model/软件外观设计-知识库.png b/model/软件外观设计-知识库.png
new file mode 100644
index 0000000..f0200fd
Binary files /dev/null and b/model/软件外观设计-知识库.png differ
diff --git a/model/软件外观设计-问卷个性化推荐.png b/model/软件外观设计-问卷个性化推荐.png
new file mode 100644
index 0000000..2acafc2
Binary files /dev/null and b/model/软件外观设计-问卷个性化推荐.png differ
diff --git a/model/软件需求分析类图.png b/model/软件需求分析类图.png
new file mode 100644
index 0000000..31d5dfe
Binary files /dev/null and b/model/软件需求分析类图.png differ
diff --git a/model/需求文档_删除事项用例顺序图.png b/model/需求文档_删除事项用例顺序图.png
new file mode 100644
index 0000000..8bd7c83
Binary files /dev/null and b/model/需求文档_删除事项用例顺序图.png differ
diff --git a/model/需求文档_填写问卷用例顺序图.png b/model/需求文档_填写问卷用例顺序图.png
new file mode 100644
index 0000000..9214a9f
Binary files /dev/null and b/model/需求文档_填写问卷用例顺序图.png differ
diff --git a/model/需求文档_查看养生知识库用例顺序图.png b/model/需求文档_查看养生知识库用例顺序图.png
new file mode 100644
index 0000000..4926d67
Binary files /dev/null and b/model/需求文档_查看养生知识库用例顺序图.png differ
diff --git a/model/需求文档_查看推荐方案用例顺序图.png b/model/需求文档_查看推荐方案用例顺序图.png
new file mode 100644
index 0000000..532778d
Binary files /dev/null and b/model/需求文档_查看推荐方案用例顺序图.png differ
diff --git a/model/需求文档_查看资讯用例顺序图.png b/model/需求文档_查看资讯用例顺序图.png
new file mode 100644
index 0000000..bc2102c
Binary files /dev/null and b/model/需求文档_查看资讯用例顺序图.png differ
diff --git a/model/需求文档_注册用例顺序图.png b/model/需求文档_注册用例顺序图.png
new file mode 100644
index 0000000..dc9d276
Binary files /dev/null and b/model/需求文档_注册用例顺序图.png differ
diff --git a/model/需求文档_登录用例顺序图.png b/model/需求文档_登录用例顺序图.png
new file mode 100644
index 0000000..33cc9f5
Binary files /dev/null and b/model/需求文档_登录用例顺序图.png differ
diff --git a/model/需求文档_编辑事项用例顺序图.png b/model/需求文档_编辑事项用例顺序图.png
new file mode 100644
index 0000000..38785e9
Binary files /dev/null and b/model/需求文档_编辑事项用例顺序图.png differ
diff --git a/other/05_软件工程课程设计汇报_韩慧燕(2024).pptx b/other/05_软件工程课程设计汇报_韩慧燕(2024).pptx
new file mode 100644
index 0000000..74fb180
Binary files /dev/null and b/other/05_软件工程课程设计汇报_韩慧燕(2024).pptx differ
diff --git a/other/06_软件开发项目的个人自评报告.xlsx b/other/06_软件开发项目的个人自评报告.xlsx
new file mode 100644
index 0000000..49cde6b
Binary files /dev/null and b/other/06_软件开发项目的个人自评报告.xlsx differ
diff --git a/other/07_软件开发项目的团队自评报告.xlsx b/other/07_软件开发项目的团队自评报告.xlsx
new file mode 100644
index 0000000..04dad0e
Binary files /dev/null and b/other/07_软件开发项目的团队自评报告.xlsx differ
diff --git a/other/08-220340111王蕊-实践总结报告.docx b/other/08-220340111王蕊-实践总结报告.docx
new file mode 100644
index 0000000..74e8d86
Binary files /dev/null and b/other/08-220340111王蕊-实践总结报告.docx differ
diff --git a/other/08_210340181周卢东-实践总结报告.docx b/other/08_210340181周卢东-实践总结报告.docx
new file mode 100644
index 0000000..ac3e7dd
Binary files /dev/null and b/other/08_210340181周卢东-实践总结报告.docx differ
diff --git a/other/08_220340098李明阳-实践总结报告.docx b/other/08_220340098李明阳-实践总结报告.docx
new file mode 100644
index 0000000..79c06ef
Binary files /dev/null and b/other/08_220340098李明阳-实践总结报告.docx differ
diff --git a/other/08_220340118韩慧燕-实践总结报告.docx b/other/08_220340118韩慧燕-实践总结报告.docx
new file mode 100644
index 0000000..a2e7552
Binary files /dev/null and b/other/08_220340118韩慧燕-实践总结报告.docx differ
diff --git a/other/09_演示运行视频.mp4 b/other/09_演示运行视频.mp4
new file mode 100644
index 0000000..b4bf501
Binary files /dev/null and b/other/09_演示运行视频.mp4 differ
diff --git a/other/10_项目宣传海报.png b/other/10_项目宣传海报.png
new file mode 100644
index 0000000..57890af
Binary files /dev/null and b/other/10_项目宣传海报.png differ
diff --git a/src/4.txt b/src/4.txt
new file mode 100644
index 0000000..cb856a4
--- /dev/null
+++ b/src/4.txt
@@ -0,0 +1 @@
+444
\ No newline at end of file
diff --git a/src/健康青年/.hbuilderx/launch.json b/src/健康青年/.hbuilderx/launch.json
new file mode 100644
index 0000000..1b8d0f6
--- /dev/null
+++ b/src/健康青年/.hbuilderx/launch.json
@@ -0,0 +1,9 @@
+{
+ "version" : "1.0",
+ "configurations" : [
+ {
+ "playground" : "custom",
+ "type" : "uni-app:app-android"
+ }
+ ]
+}
diff --git a/src/健康青年/.vscode/launch.json b/src/健康青年/.vscode/launch.json
new file mode 100644
index 0000000..ca478bc
--- /dev/null
+++ b/src/健康青年/.vscode/launch.json
@@ -0,0 +1,13 @@
+{
+
+ "version": "0.2.0",
+ "configurations": [
+ {
+ "type": "pwa-chrome",
+ "request": "launch",
+ "name": "Launch Chrome against localhost",
+ "url": "http://localhost:8080",
+ "webRoot": "${workspaceFolder}"
+ }
+ ]
+}
\ No newline at end of file
diff --git a/src/健康青年/App.vue b/src/健康青年/App.vue
new file mode 100644
index 0000000..8c2b732
--- /dev/null
+++ b/src/健康青年/App.vue
@@ -0,0 +1,17 @@
+
+
+
diff --git a/src/健康青年/androidPrivacy.json b/src/健康青年/androidPrivacy.json
new file mode 100644
index 0000000..12df862
--- /dev/null
+++ b/src/健康青年/androidPrivacy.json
@@ -0,0 +1,3 @@
+{
+ "prompt": "template"
+}
diff --git a/src/健康青年/components/newsbox/newsbox.vue b/src/健康青年/components/newsbox/newsbox.vue
new file mode 100644
index 0000000..db26c11
--- /dev/null
+++ b/src/健康青年/components/newsbox/newsbox.vue
@@ -0,0 +1,60 @@
+
+
+
+
+
+
+
+ 组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题
+ 组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题组内默认的标题
+
+
+ 作者:张三
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/健康青年/components/newsbox2/newsbox2.vue b/src/健康青年/components/newsbox2/newsbox2.vue
new file mode 100644
index 0000000..bc1e515
--- /dev/null
+++ b/src/健康青年/components/newsbox2/newsbox2.vue
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+
+ 人生,心态最重要(深度)
+
+
+ 作者:佚名
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/健康青年/components/newsbox3/newsbox3.vue b/src/健康青年/components/newsbox3/newsbox3.vue
new file mode 100644
index 0000000..cbd4387
--- /dev/null
+++ b/src/健康青年/components/newsbox3/newsbox3.vue
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+
+ 秋天里的长寿的一菜、第一果、第一粥,养肺补气血养人!
+
+
+ 医食参考
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/健康青年/components/newsbox4/newsbox4.vue b/src/健康青年/components/newsbox4/newsbox4.vue
new file mode 100644
index 0000000..2a02485
--- /dev/null
+++ b/src/健康青年/components/newsbox4/newsbox4.vue
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+
+ 养好脾肾并不难,只要掌握这4点!
+
+
+ 医食参考
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/健康青年/components/newsbox5/newsbox5.vue b/src/健康青年/components/newsbox5/newsbox5.vue
new file mode 100644
index 0000000..9ecf09c
--- /dev/null
+++ b/src/健康青年/components/newsbox5/newsbox5.vue
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+
+ 化痰第一药“陈皮”,煮水一杯,或能化解全身99%的痰
+
+
+ 作者:田医生看心脏
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/健康青年/components/newsbox6/newsbox6.vue b/src/健康青年/components/newsbox6/newsbox6.vue
new file mode 100644
index 0000000..667ade3
--- /dev/null
+++ b/src/健康青年/components/newsbox6/newsbox6.vue
@@ -0,0 +1,59 @@
+
+
+
+
+
+
+
+ 大脑供血不足。身体会出现4大异常,要及时采取干预
+
+
+ 作者:嘉佳健康科普
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/健康青年/components/newsbox7/newsbox7.vue b/src/健康青年/components/newsbox7/newsbox7.vue
new file mode 100644
index 0000000..141ab77
--- /dev/null
+++ b/src/健康青年/components/newsbox7/newsbox7.vue
@@ -0,0 +1,59 @@
+=
+
+
+
+
+
+
+ 口感舌燥、皮肤干燥,“秋燥”来袭,中医教您预防
+
+
+ 作者:广东中医药
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/src/健康青年/index.html b/src/健康青年/index.html
new file mode 100644
index 0000000..c3ff205
--- /dev/null
+++ b/src/健康青年/index.html
@@ -0,0 +1,20 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/src/健康青年/main.js b/src/健康青年/main.js
new file mode 100644
index 0000000..c1caf36
--- /dev/null
+++ b/src/健康青年/main.js
@@ -0,0 +1,22 @@
+import App from './App'
+
+// #ifndef VUE3
+import Vue from 'vue'
+import './uni.promisify.adaptor'
+Vue.config.productionTip = false
+App.mpType = 'app'
+const app = new Vue({
+ ...App
+})
+app.$mount()
+// #endif
+
+// #ifdef VUE3
+import { createSSRApp } from 'vue'
+export function createApp() {
+ const app = createSSRApp(App)
+ return {
+ app
+ }
+}
+// #endif
\ No newline at end of file
diff --git a/src/健康青年/manifest.json b/src/健康青年/manifest.json
new file mode 100644
index 0000000..d62f0fb
--- /dev/null
+++ b/src/健康青年/manifest.json
@@ -0,0 +1,78 @@
+{
+ "name" : "健康青年",
+ "appid" : "__UNI__3A6C46C",
+ "description" : "",
+ "versionName" : "1.0.0",
+ "versionCode" : "100",
+ "transformPx" : false,
+ /* 5+App特有相关 */
+ "app-plus" : {
+ "usingComponents" : true,
+ "nvueStyleCompiler" : "uni-app",
+ "compilerVersion" : 3,
+ "splashscreen" : {
+ "alwaysShowBeforeRender" : true,
+ "waiting" : true,
+ "autoclose" : true,
+ "delay" : 0
+ },
+ /* 模块配置 */
+ "modules" : {},
+ /* 应用发布信息 */
+ "distribute" : {
+ /* android打包配置 */
+ "android" : {
+ "permissions" : [
+ "",
+ "",
+ "",
+ "",
+ "",
+ "",
+ "",
+ "",
+ "",
+ "",
+ "",
+ "",
+ "",
+ "",
+ ""
+ ],
+ "abiFilters" : [ "arm64-v8a", "x86" ]
+ },
+ /* ios打包配置 */
+ "ios" : {
+ "dSYMs" : false
+ },
+ /* SDK配置 */
+ "sdkConfigs" : {},
+ "splashscreen" : {
+ "useOriginalMsgbox" : true
+ }
+ }
+ },
+ /* 快应用特有相关 */
+ "quickapp" : {},
+ /* 小程序特有相关 */
+ "mp-weixin" : {
+ "appid" : "",
+ "setting" : {
+ "urlCheck" : false
+ },
+ "usingComponents" : true
+ },
+ "mp-alipay" : {
+ "usingComponents" : true
+ },
+ "mp-baidu" : {
+ "usingComponents" : true
+ },
+ "mp-toutiao" : {
+ "usingComponents" : true
+ },
+ "uniStatistics" : {
+ "enable" : false
+ },
+ "vueVersion" : "3"
+}
diff --git a/src/健康青年/node_modules/.bin/acorn b/src/健康青年/node_modules/.bin/acorn
new file mode 100644
index 0000000..679bd16
--- /dev/null
+++ b/src/健康青年/node_modules/.bin/acorn
@@ -0,0 +1,16 @@
+#!/bin/sh
+basedir=$(dirname "$(echo "$0" | sed -e 's,\\,/,g')")
+
+case `uname` in
+ *CYGWIN*|*MINGW*|*MSYS*)
+ if command -v cygpath > /dev/null 2>&1; then
+ basedir=`cygpath -w "$basedir"`
+ fi
+ ;;
+esac
+
+if [ -x "$basedir/node" ]; then
+ exec "$basedir/node" "$basedir/../acorn/bin/acorn" "$@"
+else
+ exec node "$basedir/../acorn/bin/acorn" "$@"
+fi
diff --git a/src/健康青年/node_modules/.bin/acorn.cmd b/src/健康青年/node_modules/.bin/acorn.cmd
new file mode 100644
index 0000000..a9324df
--- /dev/null
+++ b/src/健康青年/node_modules/.bin/acorn.cmd
@@ -0,0 +1,17 @@
+@ECHO off
+GOTO start
+:find_dp0
+SET dp0=%~dp0
+EXIT /b
+:start
+SETLOCAL
+CALL :find_dp0
+
+IF EXIST "%dp0%\node.exe" (
+ SET "_prog=%dp0%\node.exe"
+) ELSE (
+ SET "_prog=node"
+ SET PATHEXT=%PATHEXT:;.JS;=;%
+)
+
+endLocal & goto #_undefined_# 2>NUL || title %COMSPEC% & "%_prog%" "%dp0%\..\acorn\bin\acorn" %*
diff --git a/src/健康青年/node_modules/.bin/acorn.ps1 b/src/健康青年/node_modules/.bin/acorn.ps1
new file mode 100644
index 0000000..6f6dcdd
--- /dev/null
+++ b/src/健康青年/node_modules/.bin/acorn.ps1
@@ -0,0 +1,28 @@
+#!/usr/bin/env pwsh
+$basedir=Split-Path $MyInvocation.MyCommand.Definition -Parent
+
+$exe=""
+if ($PSVersionTable.PSVersion -lt "6.0" -or $IsWindows) {
+ # Fix case when both the Windows and Linux builds of Node
+ # are installed in the same directory
+ $exe=".exe"
+}
+$ret=0
+if (Test-Path "$basedir/node$exe") {
+ # Support pipeline input
+ if ($MyInvocation.ExpectingInput) {
+ $input | & "$basedir/node$exe" "$basedir/../acorn/bin/acorn" $args
+ } else {
+ & "$basedir/node$exe" "$basedir/../acorn/bin/acorn" $args
+ }
+ $ret=$LASTEXITCODE
+} else {
+ # Support pipeline input
+ if ($MyInvocation.ExpectingInput) {
+ $input | & "node$exe" "$basedir/../acorn/bin/acorn" $args
+ } else {
+ & "node$exe" "$basedir/../acorn/bin/acorn" $args
+ }
+ $ret=$LASTEXITCODE
+}
+exit $ret
diff --git a/src/健康青年/node_modules/.package-lock.json b/src/健康青年/node_modules/.package-lock.json
new file mode 100644
index 0000000..77a1207
--- /dev/null
+++ b/src/健康青年/node_modules/.package-lock.json
@@ -0,0 +1,516 @@
+{
+ "name": "健康测试",
+ "lockfileVersion": 3,
+ "requires": true,
+ "packages": {
+ "node_modules/@antfu/utils": {
+ "version": "0.7.10",
+ "resolved": "https://registry.npmjs.org/@antfu/utils/-/utils-0.7.10.tgz",
+ "integrity": "sha512-+562v9k4aI80m1+VuMHehNJWLOFjBnXn3tdOitzD0il5b7smkSBal4+a3oKiQTbrwMmN/TBUMDvbdoWDehgOww==",
+ "license": "MIT",
+ "funding": {
+ "url": "https://github.com/sponsors/antfu"
+ }
+ },
+ "node_modules/@jridgewell/sourcemap-codec": {
+ "version": "1.5.0",
+ "resolved": "https://registry.npmjs.org/@jridgewell/sourcemap-codec/-/sourcemap-codec-1.5.0.tgz",
+ "integrity": "sha512-gv3ZRaISU3fjPAgNsriBRqGWQL6quFx04YMPW/zD8XMLsU32mhCCbfbO6KZFLjvYpCZ8zyDEgqsgf+PwPaM7GQ==",
+ "license": "MIT"
+ },
+ "node_modules/@nodelib/fs.scandir": {
+ "version": "2.1.5",
+ "resolved": "https://registry.npmjs.org/@nodelib/fs.scandir/-/fs.scandir-2.1.5.tgz",
+ "integrity": "sha512-vq24Bq3ym5HEQm2NKCr3yXDwjc7vTsEThRDnkp2DK9p1uqLR+DHurm/NOTo0KG7HYHU7eppKZj3MyqYuMBf62g==",
+ "license": "MIT",
+ "dependencies": {
+ "@nodelib/fs.stat": "2.0.5",
+ "run-parallel": "^1.1.9"
+ },
+ "engines": {
+ "node": ">= 8"
+ }
+ },
+ "node_modules/@nodelib/fs.stat": {
+ "version": "2.0.5",
+ "resolved": "https://registry.npmjs.org/@nodelib/fs.stat/-/fs.stat-2.0.5.tgz",
+ "integrity": "sha512-RkhPPp2zrqDAQA/2jNhnztcPAlv64XdhIp7a7454A5ovI7Bukxgt7MX7udwAu3zg1DcpPU0rz3VV1SeaqvY4+A==",
+ "license": "MIT",
+ "engines": {
+ "node": ">= 8"
+ }
+ },
+ "node_modules/@nodelib/fs.walk": {
+ "version": "1.2.8",
+ "resolved": "https://registry.npmjs.org/@nodelib/fs.walk/-/fs.walk-1.2.8.tgz",
+ "integrity": "sha512-oGB+UxlgWcgQkgwo8GcEGwemoTFt3FIO9ababBmaGwXIoBKZ+GTy0pP185beGg7Llih/NSHSV2XAs1lnznocSg==",
+ "license": "MIT",
+ "dependencies": {
+ "@nodelib/fs.scandir": "2.1.5",
+ "fastq": "^1.6.0"
+ },
+ "engines": {
+ "node": ">= 8"
+ }
+ },
+ "node_modules/@rollup/pluginutils": {
+ "version": "5.1.2",
+ "resolved": "https://registry.npmjs.org/@rollup/pluginutils/-/pluginutils-5.1.2.tgz",
+ "integrity": "sha512-/FIdS3PyZ39bjZlwqFnWqCOVnW7o963LtKMwQOD0NhQqw22gSr2YY1afu3FxRip4ZCZNsD5jq6Aaz6QV3D/Njw==",
+ "license": "MIT",
+ "dependencies": {
+ "@types/estree": "^1.0.0",
+ "estree-walker": "^2.0.2",
+ "picomatch": "^2.3.1"
+ },
+ "engines": {
+ "node": ">=14.0.0"
+ },
+ "peerDependencies": {
+ "rollup": "^1.20.0||^2.0.0||^3.0.0||^4.0.0"
+ },
+ "peerDependenciesMeta": {
+ "rollup": {
+ "optional": true
+ }
+ }
+ },
+ "node_modules/@types/estree": {
+ "version": "1.0.6",
+ "resolved": "https://registry.npmjs.org/@types/estree/-/estree-1.0.6.tgz",
+ "integrity": "sha512-AYnb1nQyY49te+VRAVgmzfcgjYS91mY5P0TKUDCLEM+gNnA+3T6rWITXRLYCpahpqSQbN5cE+gHpnPyXjHWxcw==",
+ "license": "MIT"
+ },
+ "node_modules/acorn": {
+ "version": "8.13.0",
+ "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.13.0.tgz",
+ "integrity": "sha512-8zSiw54Oxrdym50NlZ9sUusyO1Z1ZchgRLWRaK6c86XJFClyCgFKetdowBg5bKxyp/u+CDBJG4Mpp0m3HLZl9w==",
+ "license": "MIT",
+ "bin": {
+ "acorn": "bin/acorn"
+ },
+ "engines": {
+ "node": ">=0.4.0"
+ }
+ },
+ "node_modules/balanced-match": {
+ "version": "1.0.2",
+ "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.2.tgz",
+ "integrity": "sha512-3oSeUO0TMV67hN1AmbXsK4yaqU7tjiHlbxRDZOpH0KW9+CeX4bRAaX0Anxt0tx2MrpRpWwQaPwIlISEJhYU5Pw==",
+ "license": "MIT"
+ },
+ "node_modules/brace-expansion": {
+ "version": "2.0.1",
+ "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-2.0.1.tgz",
+ "integrity": "sha512-XnAIvQ8eM+kC6aULx6wuQiwVsnzsi9d3WxzV3FpWTGA19F621kwdbsAcFKXgKUHZWsy+mY6iL1sHTxWEFCytDA==",
+ "license": "MIT",
+ "dependencies": {
+ "balanced-match": "^1.0.0"
+ }
+ },
+ "node_modules/braces": {
+ "version": "3.0.3",
+ "resolved": "https://registry.npmjs.org/braces/-/braces-3.0.3.tgz",
+ "integrity": "sha512-yQbXgO/OSZVD2IsiLlro+7Hf6Q18EJrKSEsdoMzKePKXct3gvD8oLcOQdIzGupr5Fj+EDe8gO/lxc1BzfMpxvA==",
+ "license": "MIT",
+ "dependencies": {
+ "fill-range": "^7.1.1"
+ },
+ "engines": {
+ "node": ">=8"
+ }
+ },
+ "node_modules/confbox": {
+ "version": "0.1.8",
+ "resolved": "https://registry.npmjs.org/confbox/-/confbox-0.1.8.tgz",
+ "integrity": "sha512-RMtmw0iFkeR4YV+fUOSucriAQNb9g8zFR52MWCtl+cCZOFRNL6zeB395vPzFhEjjn4fMxXudmELnl/KF/WrK6w==",
+ "license": "MIT"
+ },
+ "node_modules/escape-string-regexp": {
+ "version": "5.0.0",
+ "resolved": "https://registry.npmjs.org/escape-string-regexp/-/escape-string-regexp-5.0.0.tgz",
+ "integrity": "sha512-/veY75JbMK4j1yjvuUxuVsiS/hr/4iHs9FTT6cgTexxdE0Ly/glccBAkloH/DofkjRbZU3bnoj38mOmhkZ0lHw==",
+ "license": "MIT",
+ "engines": {
+ "node": ">=12"
+ },
+ "funding": {
+ "url": "https://github.com/sponsors/sindresorhus"
+ }
+ },
+ "node_modules/estree-walker": {
+ "version": "2.0.2",
+ "resolved": "https://registry.npmjs.org/estree-walker/-/estree-walker-2.0.2.tgz",
+ "integrity": "sha512-Rfkk/Mp/DL7JVje3u18FxFujQlTNR2q6QfMSMB7AvCBx91NGj/ba3kCfza0f6dVDbw7YlRf/nDrn7pQrCCyQ/w==",
+ "license": "MIT"
+ },
+ "node_modules/fast-glob": {
+ "version": "3.3.2",
+ "resolved": "https://registry.npmjs.org/fast-glob/-/fast-glob-3.3.2.tgz",
+ "integrity": "sha512-oX2ruAFQwf/Orj8m737Y5adxDQO0LAB7/S5MnxCdTNDd4p6BsyIVsv9JQsATbTSq8KHRpLwIHbVlUNatxd+1Ow==",
+ "license": "MIT",
+ "dependencies": {
+ "@nodelib/fs.stat": "^2.0.2",
+ "@nodelib/fs.walk": "^1.2.3",
+ "glob-parent": "^5.1.2",
+ "merge2": "^1.3.0",
+ "micromatch": "^4.0.4"
+ },
+ "engines": {
+ "node": ">=8.6.0"
+ }
+ },
+ "node_modules/fastq": {
+ "version": "1.17.1",
+ "resolved": "https://registry.npmjs.org/fastq/-/fastq-1.17.1.tgz",
+ "integrity": "sha512-sRVD3lWVIXWg6By68ZN7vho9a1pQcN/WBFaAAsDDFzlJjvoGx0P8z7V1t72grFJfJhu3YPZBuu25f7Kaw2jN1w==",
+ "license": "ISC",
+ "dependencies": {
+ "reusify": "^1.0.4"
+ }
+ },
+ "node_modules/fill-range": {
+ "version": "7.1.1",
+ "resolved": "https://registry.npmjs.org/fill-range/-/fill-range-7.1.1.tgz",
+ "integrity": "sha512-YsGpe3WHLK8ZYi4tWDg2Jy3ebRz2rXowDxnld4bkQB00cc/1Zw9AWnC0i9ztDJitivtQvaI9KaLyKrc+hBW0yg==",
+ "license": "MIT",
+ "dependencies": {
+ "to-regex-range": "^5.0.1"
+ },
+ "engines": {
+ "node": ">=8"
+ }
+ },
+ "node_modules/glob-parent": {
+ "version": "5.1.2",
+ "resolved": "https://registry.npmjs.org/glob-parent/-/glob-parent-5.1.2.tgz",
+ "integrity": "sha512-AOIgSQCepiJYwP3ARnGx+5VnTu2HBYdzbGP45eLw1vr3zB3vZLeyed1sC9hnbcOc9/SrMyM5RPQrkGz4aS9Zow==",
+ "license": "ISC",
+ "dependencies": {
+ "is-glob": "^4.0.1"
+ },
+ "engines": {
+ "node": ">= 6"
+ }
+ },
+ "node_modules/is-extglob": {
+ "version": "2.1.1",
+ "resolved": "https://registry.npmjs.org/is-extglob/-/is-extglob-2.1.1.tgz",
+ "integrity": "sha512-SbKbANkN603Vi4jEZv49LeVJMn4yGwsbzZworEoyEiutsN3nJYdbO36zfhGJ6QEDpOZIFkDtnq5JRxmvl3jsoQ==",
+ "license": "MIT",
+ "engines": {
+ "node": ">=0.10.0"
+ }
+ },
+ "node_modules/is-glob": {
+ "version": "4.0.3",
+ "resolved": "https://registry.npmjs.org/is-glob/-/is-glob-4.0.3.tgz",
+ "integrity": "sha512-xelSayHH36ZgE7ZWhli7pW34hNbNl8Ojv5KVmkJD4hBdD3th8Tfk9vYasLM+mXWOZhFkgZfxhLSnrwRr4elSSg==",
+ "license": "MIT",
+ "dependencies": {
+ "is-extglob": "^2.1.1"
+ },
+ "engines": {
+ "node": ">=0.10.0"
+ }
+ },
+ "node_modules/is-number": {
+ "version": "7.0.0",
+ "resolved": "https://registry.npmjs.org/is-number/-/is-number-7.0.0.tgz",
+ "integrity": "sha512-41Cifkg6e8TylSpdtTpeLVMqvSBEVzTttHvERD741+pnZ8ANv0004MRL43QKPDlK9cGvNp6NZWZUBlbGXYxxng==",
+ "license": "MIT",
+ "engines": {
+ "node": ">=0.12.0"
+ }
+ },
+ "node_modules/js-tokens": {
+ "version": "9.0.0",
+ "resolved": "https://registry.npmjs.org/js-tokens/-/js-tokens-9.0.0.tgz",
+ "integrity": "sha512-WriZw1luRMlmV3LGJaR6QOJjWwgLUTf89OwT2lUOyjX2dJGBwgmIkbcz+7WFZjrZM635JOIR517++e/67CP9dQ==",
+ "license": "MIT"
+ },
+ "node_modules/local-pkg": {
+ "version": "0.5.0",
+ "resolved": "https://registry.npmjs.org/local-pkg/-/local-pkg-0.5.0.tgz",
+ "integrity": "sha512-ok6z3qlYyCDS4ZEU27HaU6x/xZa9Whf8jD4ptH5UZTQYZVYeb9bnZ3ojVhiJNLiXK1Hfc0GNbLXcmZ5plLDDBg==",
+ "license": "MIT",
+ "dependencies": {
+ "mlly": "^1.4.2",
+ "pkg-types": "^1.0.3"
+ },
+ "engines": {
+ "node": ">=14"
+ },
+ "funding": {
+ "url": "https://github.com/sponsors/antfu"
+ }
+ },
+ "node_modules/magic-string": {
+ "version": "0.30.12",
+ "resolved": "https://registry.npmjs.org/magic-string/-/magic-string-0.30.12.tgz",
+ "integrity": "sha512-Ea8I3sQMVXr8JhN4z+H/d8zwo+tYDgHE9+5G4Wnrwhs0gaK9fXTKx0Tw5Xwsd/bCPTTZNRAdpyzvoeORe9LYpw==",
+ "license": "MIT",
+ "dependencies": {
+ "@jridgewell/sourcemap-codec": "^1.5.0"
+ }
+ },
+ "node_modules/merge2": {
+ "version": "1.4.1",
+ "resolved": "https://registry.npmjs.org/merge2/-/merge2-1.4.1.tgz",
+ "integrity": "sha512-8q7VEgMJW4J8tcfVPy8g09NcQwZdbwFEqhe/WZkoIzjn/3TGDwtOCYtXGxA3O8tPzpczCCDgv+P2P5y00ZJOOg==",
+ "license": "MIT",
+ "engines": {
+ "node": ">= 8"
+ }
+ },
+ "node_modules/micromatch": {
+ "version": "4.0.8",
+ "resolved": "https://registry.npmjs.org/micromatch/-/micromatch-4.0.8.tgz",
+ "integrity": "sha512-PXwfBhYu0hBCPw8Dn0E+WDYb7af3dSLVWKi3HGv84IdF4TyFoC0ysxFd0Goxw7nSv4T/PzEJQxsYsEiFCKo2BA==",
+ "license": "MIT",
+ "dependencies": {
+ "braces": "^3.0.3",
+ "picomatch": "^2.3.1"
+ },
+ "engines": {
+ "node": ">=8.6"
+ }
+ },
+ "node_modules/minimatch": {
+ "version": "9.0.5",
+ "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-9.0.5.tgz",
+ "integrity": "sha512-G6T0ZX48xgozx7587koeX9Ys2NYy6Gmv//P89sEte9V9whIapMNF4idKxnW2QtCcLiTWlb/wfCabAtAFWhhBow==",
+ "license": "ISC",
+ "dependencies": {
+ "brace-expansion": "^2.0.1"
+ },
+ "engines": {
+ "node": ">=16 || 14 >=14.17"
+ },
+ "funding": {
+ "url": "https://github.com/sponsors/isaacs"
+ }
+ },
+ "node_modules/mlly": {
+ "version": "1.7.2",
+ "resolved": "https://registry.npmjs.org/mlly/-/mlly-1.7.2.tgz",
+ "integrity": "sha512-tN3dvVHYVz4DhSXinXIk7u9syPYaJvio118uomkovAtWBT+RdbP6Lfh/5Lvo519YMmwBafwlh20IPTXIStscpA==",
+ "license": "MIT",
+ "dependencies": {
+ "acorn": "^8.12.1",
+ "pathe": "^1.1.2",
+ "pkg-types": "^1.2.0",
+ "ufo": "^1.5.4"
+ }
+ },
+ "node_modules/pathe": {
+ "version": "1.1.2",
+ "resolved": "https://registry.npmjs.org/pathe/-/pathe-1.1.2.tgz",
+ "integrity": "sha512-whLdWMYL2TwI08hn8/ZqAbrVemu0LNaNNJZX73O6qaIdCTfXutsLhMkjdENX0qhsQ9uIimo4/aQOmXkoon2nDQ==",
+ "license": "MIT"
+ },
+ "node_modules/picomatch": {
+ "version": "2.3.1",
+ "resolved": "https://registry.npmjs.org/picomatch/-/picomatch-2.3.1.tgz",
+ "integrity": "sha512-JU3teHTNjmE2VCGFzuY8EXzCDVwEqB2a8fsIvwaStHhAWJEeVd1o1QD80CU6+ZdEXXSLbSsuLwJjkCBWqRQUVA==",
+ "license": "MIT",
+ "engines": {
+ "node": ">=8.6"
+ },
+ "funding": {
+ "url": "https://github.com/sponsors/jonschlinkert"
+ }
+ },
+ "node_modules/pkg-types": {
+ "version": "1.2.1",
+ "resolved": "https://registry.npmjs.org/pkg-types/-/pkg-types-1.2.1.tgz",
+ "integrity": "sha512-sQoqa8alT3nHjGuTjuKgOnvjo4cljkufdtLMnO2LBP/wRwuDlo1tkaEdMxCRhyGRPacv/ztlZgDPm2b7FAmEvw==",
+ "license": "MIT",
+ "dependencies": {
+ "confbox": "^0.1.8",
+ "mlly": "^1.7.2",
+ "pathe": "^1.1.2"
+ }
+ },
+ "node_modules/queue-microtask": {
+ "version": "1.2.3",
+ "resolved": "https://registry.npmjs.org/queue-microtask/-/queue-microtask-1.2.3.tgz",
+ "integrity": "sha512-NuaNSa6flKT5JaSYQzJok04JzTL1CA6aGhv5rfLW3PgqA+M2ChpZQnAC8h8i4ZFkBS8X5RqkDBHA7r4hej3K9A==",
+ "funding": [
+ {
+ "type": "github",
+ "url": "https://github.com/sponsors/feross"
+ },
+ {
+ "type": "patreon",
+ "url": "https://www.patreon.com/feross"
+ },
+ {
+ "type": "consulting",
+ "url": "https://feross.org/support"
+ }
+ ],
+ "license": "MIT"
+ },
+ "node_modules/reusify": {
+ "version": "1.0.4",
+ "resolved": "https://registry.npmjs.org/reusify/-/reusify-1.0.4.tgz",
+ "integrity": "sha512-U9nH88a3fc/ekCF1l0/UP1IosiuIjyTh7hBvXVMHYgVcfGvt897Xguj2UOLDeI5BG2m7/uwyaLVT6fbtCwTyzw==",
+ "license": "MIT",
+ "engines": {
+ "iojs": ">=1.0.0",
+ "node": ">=0.10.0"
+ }
+ },
+ "node_modules/run-parallel": {
+ "version": "1.2.0",
+ "resolved": "https://registry.npmjs.org/run-parallel/-/run-parallel-1.2.0.tgz",
+ "integrity": "sha512-5l4VyZR86LZ/lDxZTR6jqL8AFE2S0IFLMP26AbjsLVADxHdhB/c0GUsH+y39UfCi3dzz8OlQuPmnaJOMoDHQBA==",
+ "funding": [
+ {
+ "type": "github",
+ "url": "https://github.com/sponsors/feross"
+ },
+ {
+ "type": "patreon",
+ "url": "https://www.patreon.com/feross"
+ },
+ {
+ "type": "consulting",
+ "url": "https://feross.org/support"
+ }
+ ],
+ "license": "MIT",
+ "dependencies": {
+ "queue-microtask": "^1.2.2"
+ }
+ },
+ "node_modules/scule": {
+ "version": "1.3.0",
+ "resolved": "https://registry.npmjs.org/scule/-/scule-1.3.0.tgz",
+ "integrity": "sha512-6FtHJEvt+pVMIB9IBY+IcCJ6Z5f1iQnytgyfKMhDKgmzYG+TeH/wx1y3l27rshSbLiSanrR9ffZDrEsmjlQF2g==",
+ "license": "MIT"
+ },
+ "node_modules/strip-literal": {
+ "version": "2.1.0",
+ "resolved": "https://registry.npmjs.org/strip-literal/-/strip-literal-2.1.0.tgz",
+ "integrity": "sha512-Op+UycaUt/8FbN/Z2TWPBLge3jWrP3xj10f3fnYxf052bKuS3EKs1ZQcVGjnEMdsNVAM+plXRdmjrZ/KgG3Skw==",
+ "license": "MIT",
+ "dependencies": {
+ "js-tokens": "^9.0.0"
+ },
+ "funding": {
+ "url": "https://github.com/sponsors/antfu"
+ }
+ },
+ "node_modules/to-regex-range": {
+ "version": "5.0.1",
+ "resolved": "https://registry.npmjs.org/to-regex-range/-/to-regex-range-5.0.1.tgz",
+ "integrity": "sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==",
+ "license": "MIT",
+ "dependencies": {
+ "is-number": "^7.0.0"
+ },
+ "engines": {
+ "node": ">=8.0"
+ }
+ },
+ "node_modules/ufo": {
+ "version": "1.5.4",
+ "resolved": "https://registry.npmjs.org/ufo/-/ufo-1.5.4.tgz",
+ "integrity": "sha512-UsUk3byDzKd04EyoZ7U4DOlxQaD14JUKQl6/P7wiX4FNvUfm3XL246n9W5AmqwW5RSFJ27NAuM0iLscAOYUiGQ==",
+ "license": "MIT"
+ },
+ "node_modules/unimport": {
+ "version": "3.13.1",
+ "resolved": "https://registry.npmjs.org/unimport/-/unimport-3.13.1.tgz",
+ "integrity": "sha512-nNrVzcs93yrZQOW77qnyOVHtb68LegvhYFwxFMfuuWScmwQmyVCG/NBuN8tYsaGzgQUVYv34E/af+Cc9u4og4A==",
+ "license": "MIT",
+ "dependencies": {
+ "@rollup/pluginutils": "^5.1.2",
+ "acorn": "^8.12.1",
+ "escape-string-regexp": "^5.0.0",
+ "estree-walker": "^3.0.3",
+ "fast-glob": "^3.3.2",
+ "local-pkg": "^0.5.0",
+ "magic-string": "^0.30.11",
+ "mlly": "^1.7.1",
+ "pathe": "^1.1.2",
+ "pkg-types": "^1.2.0",
+ "scule": "^1.3.0",
+ "strip-literal": "^2.1.0",
+ "unplugin": "^1.14.1"
+ }
+ },
+ "node_modules/unimport/node_modules/estree-walker": {
+ "version": "3.0.3",
+ "resolved": "https://registry.npmjs.org/estree-walker/-/estree-walker-3.0.3.tgz",
+ "integrity": "sha512-7RUKfXgSMMkzt6ZuXmqapOurLGPPfgj6l9uRZ7lRGolvk0y2yocc35LdcxKC5PQZdn2DMqioAQ2NoWcrTKmm6g==",
+ "license": "MIT",
+ "dependencies": {
+ "@types/estree": "^1.0.0"
+ }
+ },
+ "node_modules/unplugin": {
+ "version": "1.14.1",
+ "resolved": "https://registry.npmjs.org/unplugin/-/unplugin-1.14.1.tgz",
+ "integrity": "sha512-lBlHbfSFPToDYp9pjXlUEFVxYLaue9f9T1HC+4OHlmj+HnMDdz9oZY+erXfoCe/5V/7gKUSY2jpXPb9S7f0f/w==",
+ "license": "MIT",
+ "dependencies": {
+ "acorn": "^8.12.1",
+ "webpack-virtual-modules": "^0.6.2"
+ },
+ "engines": {
+ "node": ">=14.0.0"
+ },
+ "peerDependencies": {
+ "webpack-sources": "^3"
+ },
+ "peerDependenciesMeta": {
+ "webpack-sources": {
+ "optional": true
+ }
+ }
+ },
+ "node_modules/unplugin-auto-import": {
+ "version": "0.18.3",
+ "resolved": "https://registry.npmjs.org/unplugin-auto-import/-/unplugin-auto-import-0.18.3.tgz",
+ "integrity": "sha512-q3FUtGQjYA2e+kb1WumyiQMjHM27MrTQ05QfVwtLRVhyYe+KF6TblBYaEX9L6Z0EibsqaXAiW+RFfkcQpfaXzg==",
+ "license": "MIT",
+ "dependencies": {
+ "@antfu/utils": "^0.7.10",
+ "@rollup/pluginutils": "^5.1.0",
+ "fast-glob": "^3.3.2",
+ "local-pkg": "^0.5.0",
+ "magic-string": "^0.30.11",
+ "minimatch": "^9.0.5",
+ "unimport": "^3.12.0",
+ "unplugin": "^1.14.1"
+ },
+ "engines": {
+ "node": ">=14"
+ },
+ "funding": {
+ "url": "https://github.com/sponsors/antfu"
+ },
+ "peerDependencies": {
+ "@nuxt/kit": "^3.2.2",
+ "@vueuse/core": "*"
+ },
+ "peerDependenciesMeta": {
+ "@nuxt/kit": {
+ "optional": true
+ },
+ "@vueuse/core": {
+ "optional": true
+ }
+ }
+ },
+ "node_modules/webpack-virtual-modules": {
+ "version": "0.6.2",
+ "resolved": "https://registry.npmjs.org/webpack-virtual-modules/-/webpack-virtual-modules-0.6.2.tgz",
+ "integrity": "sha512-66/V2i5hQanC51vBQKPH4aI8NMAcBW59FVBs+rC7eGHupMyfn34q7rZIE+ETlJ+XTevqfUhVVBgSUNSW2flEUQ==",
+ "license": "MIT"
+ }
+ }
+}
diff --git a/src/健康青年/node_modules/@antfu/utils/LICENSE b/src/健康青年/node_modules/@antfu/utils/LICENSE
new file mode 100644
index 0000000..d47cea5
--- /dev/null
+++ b/src/健康青年/node_modules/@antfu/utils/LICENSE
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2021 Anthony Fu
+
+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.
diff --git a/src/健康青年/node_modules/@antfu/utils/README.md b/src/健康青年/node_modules/@antfu/utils/README.md
new file mode 100644
index 0000000..7cea8ff
--- /dev/null
+++ b/src/健康青年/node_modules/@antfu/utils/README.md
@@ -0,0 +1,24 @@
+# @antfu/utils
+
+[![NPM version](https://img.shields.io/npm/v/@antfu/utils?color=a1b858&label=)](https://www.npmjs.com/package/@antfu/utils)
+[![Docs](https://img.shields.io/badge/docs-green)](https://www.jsdocs.io/package/@antfu/utils)
+
+Opinionated collection of common JavaScript / TypeScript utils by [@antfu](https://github.com/antfu).
+
+- Tree-shakable ESM
+- Fully typed - with TSDocs
+- Type utilities - `Arrayable`, `ElementOf`, etc.
+
+> This package is designed to be used as `devDependencies` and bundled into your dist.
+
+## Sponsors
+
+
+
+
+
+
+
+## License
+
+[MIT](./LICENSE) License © 2021-PRESENT [Anthony Fu](https://github.com/antfu)
diff --git a/src/健康青年/node_modules/@antfu/utils/dist/index.cjs b/src/健康青年/node_modules/@antfu/utils/dist/index.cjs
new file mode 100644
index 0000000..aa54819
--- /dev/null
+++ b/src/健康青年/node_modules/@antfu/utils/dist/index.cjs
@@ -0,0 +1,844 @@
+'use strict';
+
+function clamp(n, min, max) {
+ return Math.min(max, Math.max(min, n));
+}
+function sum(...args) {
+ return flattenArrayable(args).reduce((a, b) => a + b, 0);
+}
+function lerp(min, max, t) {
+ const interpolation = clamp(t, 0, 1);
+ return min + (max - min) * interpolation;
+}
+function remap(n, inMin, inMax, outMin, outMax) {
+ const interpolation = (n - inMin) / (inMax - inMin);
+ return lerp(outMin, outMax, interpolation);
+}
+
+function toArray(array) {
+ array = array ?? [];
+ return Array.isArray(array) ? array : [array];
+}
+function flattenArrayable(array) {
+ return toArray(array).flat(1);
+}
+function mergeArrayable(...args) {
+ return args.flatMap((i) => toArray(i));
+}
+function partition(array, ...filters) {
+ const result = Array.from({ length: filters.length + 1 }).fill(null).map(() => []);
+ array.forEach((e, idx, arr) => {
+ let i = 0;
+ for (const filter of filters) {
+ if (filter(e, idx, arr)) {
+ result[i].push(e);
+ return;
+ }
+ i += 1;
+ }
+ result[i].push(e);
+ });
+ return result;
+}
+function uniq(array) {
+ return Array.from(new Set(array));
+}
+function uniqueBy(array, equalFn) {
+ return array.reduce((acc, cur) => {
+ const index = acc.findIndex((item) => equalFn(cur, item));
+ if (index === -1)
+ acc.push(cur);
+ return acc;
+ }, []);
+}
+function last(array) {
+ return at(array, -1);
+}
+function remove(array, value) {
+ if (!array)
+ return false;
+ const index = array.indexOf(value);
+ if (index >= 0) {
+ array.splice(index, 1);
+ return true;
+ }
+ return false;
+}
+function at(array, index) {
+ const len = array.length;
+ if (!len)
+ return void 0;
+ if (index < 0)
+ index += len;
+ return array[index];
+}
+function range(...args) {
+ let start, stop, step;
+ if (args.length === 1) {
+ start = 0;
+ step = 1;
+ [stop] = args;
+ } else {
+ [start, stop, step = 1] = args;
+ }
+ const arr = [];
+ let current = start;
+ while (current < stop) {
+ arr.push(current);
+ current += step || 1;
+ }
+ return arr;
+}
+function move(arr, from, to) {
+ arr.splice(to, 0, arr.splice(from, 1)[0]);
+ return arr;
+}
+function clampArrayRange(n, arr) {
+ return clamp(n, 0, arr.length - 1);
+}
+function sample(arr, quantity) {
+ return Array.from({ length: quantity }, (_) => arr[Math.round(Math.random() * (arr.length - 1))]);
+}
+function shuffle(array) {
+ for (let i = array.length - 1; i > 0; i--) {
+ const j = Math.floor(Math.random() * (i + 1));
+ [array[i], array[j]] = [array[j], array[i]];
+ }
+ return array;
+}
+
+function assert(condition, message) {
+ if (!condition)
+ throw new Error(message);
+}
+const toString = (v) => Object.prototype.toString.call(v);
+function getTypeName(v) {
+ if (v === null)
+ return "null";
+ const type = toString(v).slice(8, -1).toLowerCase();
+ return typeof v === "object" || typeof v === "function" ? type : typeof v;
+}
+function noop() {
+}
+
+function isDeepEqual(value1, value2) {
+ const type1 = getTypeName(value1);
+ const type2 = getTypeName(value2);
+ if (type1 !== type2)
+ return false;
+ if (type1 === "array") {
+ if (value1.length !== value2.length)
+ return false;
+ return value1.every((item, i) => {
+ return isDeepEqual(item, value2[i]);
+ });
+ }
+ if (type1 === "object") {
+ const keyArr = Object.keys(value1);
+ if (keyArr.length !== Object.keys(value2).length)
+ return false;
+ return keyArr.every((key) => {
+ return isDeepEqual(value1[key], value2[key]);
+ });
+ }
+ return Object.is(value1, value2);
+}
+
+function notNullish(v) {
+ return v != null;
+}
+function noNull(v) {
+ return v !== null;
+}
+function notUndefined(v) {
+ return v !== void 0;
+}
+function isTruthy(v) {
+ return Boolean(v);
+}
+
+const isDef = (val) => typeof val !== "undefined";
+const isBoolean = (val) => typeof val === "boolean";
+const isFunction = (val) => typeof val === "function";
+const isNumber = (val) => typeof val === "number";
+const isString = (val) => typeof val === "string";
+const isObject = (val) => toString(val) === "[object Object]";
+const isUndefined = (val) => toString(val) === "[object Undefined]";
+const isNull = (val) => toString(val) === "[object Null]";
+const isRegExp = (val) => toString(val) === "[object RegExp]";
+const isDate = (val) => toString(val) === "[object Date]";
+const isWindow = (val) => typeof window !== "undefined" && toString(val) === "[object Window]";
+const isBrowser = typeof window !== "undefined";
+
+function slash(str) {
+ return str.replace(/\\/g, "/");
+}
+function ensurePrefix(prefix, str) {
+ if (!str.startsWith(prefix))
+ return prefix + str;
+ return str;
+}
+function ensureSuffix(suffix, str) {
+ if (!str.endsWith(suffix))
+ return str + suffix;
+ return str;
+}
+function template(str, ...args) {
+ const [firstArg, fallback] = args;
+ if (isObject(firstArg)) {
+ const vars = firstArg;
+ return str.replace(/{([\w\d]+)}/g, (_, key) => vars[key] || ((typeof fallback === "function" ? fallback(key) : fallback) ?? key));
+ } else {
+ return str.replace(/{(\d+)}/g, (_, key) => {
+ const index = Number(key);
+ if (Number.isNaN(index))
+ return key;
+ return args[index];
+ });
+ }
+}
+const urlAlphabet = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict";
+function randomStr(size = 16, dict = urlAlphabet) {
+ let id = "";
+ let i = size;
+ const len = dict.length;
+ while (i--)
+ id += dict[Math.random() * len | 0];
+ return id;
+}
+function capitalize(str) {
+ return str[0].toUpperCase() + str.slice(1).toLowerCase();
+}
+const _reFullWs = /^\s*$/;
+function unindent(str) {
+ const lines = (typeof str === "string" ? str : str[0]).split("\n");
+ const whitespaceLines = lines.map((line) => _reFullWs.test(line));
+ const commonIndent = lines.reduce((min, line, idx) => {
+ var _a;
+ if (whitespaceLines[idx])
+ return min;
+ const indent = (_a = line.match(/^\s*/)) == null ? void 0 : _a[0].length;
+ return indent === void 0 ? min : Math.min(min, indent);
+ }, Number.POSITIVE_INFINITY);
+ let emptyLinesHead = 0;
+ while (emptyLinesHead < lines.length && whitespaceLines[emptyLinesHead])
+ emptyLinesHead++;
+ let emptyLinesTail = 0;
+ while (emptyLinesTail < lines.length && whitespaceLines[lines.length - emptyLinesTail - 1])
+ emptyLinesTail++;
+ return lines.slice(emptyLinesHead, lines.length - emptyLinesTail).map((line) => line.slice(commonIndent)).join("\n");
+}
+
+const timestamp = () => +Date.now();
+
+function batchInvoke(functions) {
+ functions.forEach((fn) => fn && fn());
+}
+function invoke(fn) {
+ return fn();
+}
+function tap(value, callback) {
+ callback(value);
+ return value;
+}
+
+function objectMap(obj, fn) {
+ return Object.fromEntries(
+ Object.entries(obj).map(([k, v]) => fn(k, v)).filter(notNullish)
+ );
+}
+function isKeyOf(obj, k) {
+ return k in obj;
+}
+function objectKeys(obj) {
+ return Object.keys(obj);
+}
+function objectEntries(obj) {
+ return Object.entries(obj);
+}
+function deepMerge(target, ...sources) {
+ if (!sources.length)
+ return target;
+ const source = sources.shift();
+ if (source === void 0)
+ return target;
+ if (isMergableObject(target) && isMergableObject(source)) {
+ objectKeys(source).forEach((key) => {
+ if (key === "__proto__" || key === "constructor" || key === "prototype")
+ return;
+ if (isMergableObject(source[key])) {
+ if (!target[key])
+ target[key] = {};
+ if (isMergableObject(target[key])) {
+ deepMerge(target[key], source[key]);
+ } else {
+ target[key] = source[key];
+ }
+ } else {
+ target[key] = source[key];
+ }
+ });
+ }
+ return deepMerge(target, ...sources);
+}
+function deepMergeWithArray(target, ...sources) {
+ if (!sources.length)
+ return target;
+ const source = sources.shift();
+ if (source === void 0)
+ return target;
+ if (Array.isArray(target) && Array.isArray(source))
+ target.push(...source);
+ if (isMergableObject(target) && isMergableObject(source)) {
+ objectKeys(source).forEach((key) => {
+ if (key === "__proto__" || key === "constructor" || key === "prototype")
+ return;
+ if (Array.isArray(source[key])) {
+ if (!target[key])
+ target[key] = [];
+ deepMergeWithArray(target[key], source[key]);
+ } else if (isMergableObject(source[key])) {
+ if (!target[key])
+ target[key] = {};
+ deepMergeWithArray(target[key], source[key]);
+ } else {
+ target[key] = source[key];
+ }
+ });
+ }
+ return deepMergeWithArray(target, ...sources);
+}
+function isMergableObject(item) {
+ return isObject(item) && !Array.isArray(item);
+}
+function objectPick(obj, keys, omitUndefined = false) {
+ return keys.reduce((n, k) => {
+ if (k in obj) {
+ if (!omitUndefined || obj[k] !== void 0)
+ n[k] = obj[k];
+ }
+ return n;
+ }, {});
+}
+function clearUndefined(obj) {
+ Object.keys(obj).forEach((key) => obj[key] === void 0 ? delete obj[key] : {});
+ return obj;
+}
+function hasOwnProperty(obj, v) {
+ if (obj == null)
+ return false;
+ return Object.prototype.hasOwnProperty.call(obj, v);
+}
+
+function createSingletonPromise(fn) {
+ let _promise;
+ function wrapper() {
+ if (!_promise)
+ _promise = fn();
+ return _promise;
+ }
+ wrapper.reset = async () => {
+ const _prev = _promise;
+ _promise = void 0;
+ if (_prev)
+ await _prev;
+ };
+ return wrapper;
+}
+function sleep(ms, callback) {
+ return new Promise(
+ (resolve) => setTimeout(async () => {
+ await (callback == null ? void 0 : callback());
+ resolve();
+ }, ms)
+ );
+}
+function createPromiseLock() {
+ const locks = [];
+ return {
+ async run(fn) {
+ const p = fn();
+ locks.push(p);
+ try {
+ return await p;
+ } finally {
+ remove(locks, p);
+ }
+ },
+ async wait() {
+ await Promise.allSettled(locks);
+ },
+ isWaiting() {
+ return Boolean(locks.length);
+ },
+ clear() {
+ locks.length = 0;
+ }
+ };
+}
+function createControlledPromise() {
+ let resolve, reject;
+ const promise = new Promise((_resolve, _reject) => {
+ resolve = _resolve;
+ reject = _reject;
+ });
+ promise.resolve = resolve;
+ promise.reject = reject;
+ return promise;
+}
+
+/* eslint-disable no-undefined,no-param-reassign,no-shadow */
+
+/**
+ * Throttle execution of a function. Especially useful for rate limiting
+ * execution of handlers on events like resize and scroll.
+ *
+ * @param {number} delay - A zero-or-greater delay in milliseconds. For event callbacks, values around 100 or 250 (or even higher)
+ * are most useful.
+ * @param {Function} callback - A function to be executed after delay milliseconds. The `this` context and all arguments are passed through,
+ * as-is, to `callback` when the throttled-function is executed.
+ * @param {object} [options] - An object to configure options.
+ * @param {boolean} [options.noTrailing] - Optional, defaults to false. If noTrailing is true, callback will only execute every `delay` milliseconds
+ * while the throttled-function is being called. If noTrailing is false or unspecified, callback will be executed
+ * one final time after the last throttled-function call. (After the throttled-function has not been called for
+ * `delay` milliseconds, the internal counter is reset).
+ * @param {boolean} [options.noLeading] - Optional, defaults to false. If noLeading is false, the first throttled-function call will execute callback
+ * immediately. If noLeading is true, the first the callback execution will be skipped. It should be noted that
+ * callback will never executed if both noLeading = true and noTrailing = true.
+ * @param {boolean} [options.debounceMode] - If `debounceMode` is true (at begin), schedule `clear` to execute after `delay` ms. If `debounceMode` is
+ * false (at end), schedule `callback` to execute after `delay` ms.
+ *
+ * @returns {Function} A new, throttled, function.
+ */
+function throttle (delay, callback, options) {
+ var _ref = options || {},
+ _ref$noTrailing = _ref.noTrailing,
+ noTrailing = _ref$noTrailing === void 0 ? false : _ref$noTrailing,
+ _ref$noLeading = _ref.noLeading,
+ noLeading = _ref$noLeading === void 0 ? false : _ref$noLeading,
+ _ref$debounceMode = _ref.debounceMode,
+ debounceMode = _ref$debounceMode === void 0 ? undefined : _ref$debounceMode;
+ /*
+ * After wrapper has stopped being called, this timeout ensures that
+ * `callback` is executed at the proper times in `throttle` and `end`
+ * debounce modes.
+ */
+
+
+ var timeoutID;
+ var cancelled = false; // Keep track of the last time `callback` was executed.
+
+ var lastExec = 0; // Function to clear existing timeout
+
+ function clearExistingTimeout() {
+ if (timeoutID) {
+ clearTimeout(timeoutID);
+ }
+ } // Function to cancel next exec
+
+
+ function cancel(options) {
+ var _ref2 = options || {},
+ _ref2$upcomingOnly = _ref2.upcomingOnly,
+ upcomingOnly = _ref2$upcomingOnly === void 0 ? false : _ref2$upcomingOnly;
+
+ clearExistingTimeout();
+ cancelled = !upcomingOnly;
+ }
+ /*
+ * The `wrapper` function encapsulates all of the throttling / debouncing
+ * functionality and when executed will limit the rate at which `callback`
+ * is executed.
+ */
+
+
+ function wrapper() {
+ for (var _len = arguments.length, arguments_ = new Array(_len), _key = 0; _key < _len; _key++) {
+ arguments_[_key] = arguments[_key];
+ }
+
+ var self = this;
+ var elapsed = Date.now() - lastExec;
+
+ if (cancelled) {
+ return;
+ } // Execute `callback` and update the `lastExec` timestamp.
+
+
+ function exec() {
+ lastExec = Date.now();
+ callback.apply(self, arguments_);
+ }
+ /*
+ * If `debounceMode` is true (at begin) this is used to clear the flag
+ * to allow future `callback` executions.
+ */
+
+
+ function clear() {
+ timeoutID = undefined;
+ }
+
+ if (!noLeading && debounceMode && !timeoutID) {
+ /*
+ * Since `wrapper` is being called for the first time and
+ * `debounceMode` is true (at begin), execute `callback`
+ * and noLeading != true.
+ */
+ exec();
+ }
+
+ clearExistingTimeout();
+
+ if (debounceMode === undefined && elapsed > delay) {
+ if (noLeading) {
+ /*
+ * In throttle mode with noLeading, if `delay` time has
+ * been exceeded, update `lastExec` and schedule `callback`
+ * to execute after `delay` ms.
+ */
+ lastExec = Date.now();
+
+ if (!noTrailing) {
+ timeoutID = setTimeout(debounceMode ? clear : exec, delay);
+ }
+ } else {
+ /*
+ * In throttle mode without noLeading, if `delay` time has been exceeded, execute
+ * `callback`.
+ */
+ exec();
+ }
+ } else if (noTrailing !== true) {
+ /*
+ * In trailing throttle mode, since `delay` time has not been
+ * exceeded, schedule `callback` to execute `delay` ms after most
+ * recent execution.
+ *
+ * If `debounceMode` is true (at begin), schedule `clear` to execute
+ * after `delay` ms.
+ *
+ * If `debounceMode` is false (at end), schedule `callback` to
+ * execute after `delay` ms.
+ */
+ timeoutID = setTimeout(debounceMode ? clear : exec, debounceMode === undefined ? delay - elapsed : delay);
+ }
+ }
+
+ wrapper.cancel = cancel; // Return the wrapper function.
+
+ return wrapper;
+}
+
+/* eslint-disable no-undefined */
+/**
+ * Debounce execution of a function. Debouncing, unlike throttling,
+ * guarantees that a function is only executed a single time, either at the
+ * very beginning of a series of calls, or at the very end.
+ *
+ * @param {number} delay - A zero-or-greater delay in milliseconds. For event callbacks, values around 100 or 250 (or even higher) are most useful.
+ * @param {Function} callback - A function to be executed after delay milliseconds. The `this` context and all arguments are passed through, as-is,
+ * to `callback` when the debounced-function is executed.
+ * @param {object} [options] - An object to configure options.
+ * @param {boolean} [options.atBegin] - Optional, defaults to false. If atBegin is false or unspecified, callback will only be executed `delay` milliseconds
+ * after the last debounced-function call. If atBegin is true, callback will be executed only at the first debounced-function call.
+ * (After the throttled-function has not been called for `delay` milliseconds, the internal counter is reset).
+ *
+ * @returns {Function} A new, debounced function.
+ */
+
+function debounce (delay, callback, options) {
+ var _ref = options || {},
+ _ref$atBegin = _ref.atBegin,
+ atBegin = _ref$atBegin === void 0 ? false : _ref$atBegin;
+
+ return throttle(delay, callback, {
+ debounceMode: atBegin !== false
+ });
+}
+
+/*
+How it works:
+`this.#head` is an instance of `Node` which keeps track of its current value and nests another instance of `Node` that keeps the value that comes after it. When a value is provided to `.enqueue()`, the code needs to iterate through `this.#head`, going deeper and deeper to find the last value. However, iterating through every single item is slow. This problem is solved by saving a reference to the last value as `this.#tail` so that it can reference it to add a new value.
+*/
+
+class Node {
+ value;
+ next;
+
+ constructor(value) {
+ this.value = value;
+ }
+}
+
+class Queue {
+ #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;
+ }
+ }
+}
+
+const AsyncResource = {
+ bind(fn, _type, thisArg) {
+ return fn.bind(thisArg);
+ },
+};
+
+function pLimit(concurrency) {
+ if (!((Number.isInteger(concurrency) || concurrency === Number.POSITIVE_INFINITY) && concurrency > 0)) {
+ throw new TypeError('Expected `concurrency` to be a number from 1 and up');
+ }
+
+ const queue = new Queue();
+ let activeCount = 0;
+
+ const next = () => {
+ activeCount--;
+
+ if (queue.size > 0) {
+ queue.dequeue()();
+ }
+ };
+
+ const run = async (function_, resolve, arguments_) => {
+ activeCount++;
+
+ const result = (async () => function_(...arguments_))();
+
+ resolve(result);
+
+ try {
+ await result;
+ } catch {}
+
+ next();
+ };
+
+ const enqueue = (function_, resolve, arguments_) => {
+ queue.enqueue(
+ AsyncResource.bind(run.bind(undefined, function_, resolve, arguments_)),
+ );
+
+ (async () => {
+ // This function needs to wait until the next microtask before comparing
+ // `activeCount` to `concurrency`, because `activeCount` is updated asynchronously
+ // when the run function is dequeued and called. The comparison in the if-statement
+ // needs to happen asynchronously as well to get an up-to-date value for `activeCount`.
+ await Promise.resolve();
+
+ if (activeCount < concurrency && queue.size > 0) {
+ queue.dequeue()();
+ }
+ })();
+ };
+
+ const generator = (function_, ...arguments_) => new Promise(resolve => {
+ enqueue(function_, resolve, arguments_);
+ });
+
+ Object.defineProperties(generator, {
+ activeCount: {
+ get: () => activeCount,
+ },
+ pendingCount: {
+ get: () => queue.size,
+ },
+ clearQueue: {
+ value() {
+ queue.clear();
+ },
+ },
+ });
+
+ return generator;
+}
+
+const VOID = Symbol("p-void");
+class PInstance extends Promise {
+ constructor(items = [], options) {
+ super(() => {
+ });
+ this.items = items;
+ this.options = options;
+ this.promises = /* @__PURE__ */ new Set();
+ }
+ get promise() {
+ var _a;
+ let batch;
+ const items = [...Array.from(this.items), ...Array.from(this.promises)];
+ if ((_a = this.options) == null ? void 0 : _a.concurrency) {
+ const limit = pLimit(this.options.concurrency);
+ batch = Promise.all(items.map((p2) => limit(() => p2)));
+ } else {
+ batch = Promise.all(items);
+ }
+ return batch.then((l) => l.filter((i) => i !== VOID));
+ }
+ add(...args) {
+ args.forEach((i) => {
+ this.promises.add(i);
+ });
+ }
+ map(fn) {
+ return new PInstance(
+ Array.from(this.items).map(async (i, idx) => {
+ const v = await i;
+ if (v === VOID)
+ return VOID;
+ return fn(v, idx);
+ }),
+ this.options
+ );
+ }
+ filter(fn) {
+ return new PInstance(
+ Array.from(this.items).map(async (i, idx) => {
+ const v = await i;
+ const r = await fn(v, idx);
+ if (!r)
+ return VOID;
+ return v;
+ }),
+ this.options
+ );
+ }
+ forEach(fn) {
+ return this.map(fn).then();
+ }
+ reduce(fn, initialValue) {
+ return this.promise.then((array) => array.reduce(fn, initialValue));
+ }
+ clear() {
+ this.promises.clear();
+ }
+ then(fn) {
+ const p2 = this.promise;
+ if (fn)
+ return p2.then(fn);
+ else
+ return p2;
+ }
+ catch(fn) {
+ return this.promise.catch(fn);
+ }
+ finally(fn) {
+ return this.promise.finally(fn);
+ }
+}
+function p(items, options) {
+ return new PInstance(items, options);
+}
+
+exports.assert = assert;
+exports.at = at;
+exports.batchInvoke = batchInvoke;
+exports.capitalize = capitalize;
+exports.clamp = clamp;
+exports.clampArrayRange = clampArrayRange;
+exports.clearUndefined = clearUndefined;
+exports.createControlledPromise = createControlledPromise;
+exports.createPromiseLock = createPromiseLock;
+exports.createSingletonPromise = createSingletonPromise;
+exports.debounce = debounce;
+exports.deepMerge = deepMerge;
+exports.deepMergeWithArray = deepMergeWithArray;
+exports.ensurePrefix = ensurePrefix;
+exports.ensureSuffix = ensureSuffix;
+exports.flattenArrayable = flattenArrayable;
+exports.getTypeName = getTypeName;
+exports.hasOwnProperty = hasOwnProperty;
+exports.invoke = invoke;
+exports.isBoolean = isBoolean;
+exports.isBrowser = isBrowser;
+exports.isDate = isDate;
+exports.isDeepEqual = isDeepEqual;
+exports.isDef = isDef;
+exports.isFunction = isFunction;
+exports.isKeyOf = isKeyOf;
+exports.isNull = isNull;
+exports.isNumber = isNumber;
+exports.isObject = isObject;
+exports.isRegExp = isRegExp;
+exports.isString = isString;
+exports.isTruthy = isTruthy;
+exports.isUndefined = isUndefined;
+exports.isWindow = isWindow;
+exports.last = last;
+exports.lerp = lerp;
+exports.mergeArrayable = mergeArrayable;
+exports.move = move;
+exports.noNull = noNull;
+exports.noop = noop;
+exports.notNullish = notNullish;
+exports.notUndefined = notUndefined;
+exports.objectEntries = objectEntries;
+exports.objectKeys = objectKeys;
+exports.objectMap = objectMap;
+exports.objectPick = objectPick;
+exports.p = p;
+exports.partition = partition;
+exports.randomStr = randomStr;
+exports.range = range;
+exports.remap = remap;
+exports.remove = remove;
+exports.sample = sample;
+exports.shuffle = shuffle;
+exports.slash = slash;
+exports.sleep = sleep;
+exports.sum = sum;
+exports.tap = tap;
+exports.template = template;
+exports.throttle = throttle;
+exports.timestamp = timestamp;
+exports.toArray = toArray;
+exports.toString = toString;
+exports.unindent = unindent;
+exports.uniq = uniq;
+exports.uniqueBy = uniqueBy;
diff --git a/src/健康青年/node_modules/@antfu/utils/dist/index.d.cts b/src/健康青年/node_modules/@antfu/utils/dist/index.d.cts
new file mode 100644
index 0000000..cba2e64
--- /dev/null
+++ b/src/健康青年/node_modules/@antfu/utils/dist/index.d.cts
@@ -0,0 +1,614 @@
+/**
+ * Promise, or maybe not
+ */
+type Awaitable = T | PromiseLike;
+/**
+ * Null or whatever
+ */
+type Nullable = T | null | undefined;
+/**
+ * Array, or not yet
+ */
+type Arrayable = T | Array;
+/**
+ * Function
+ */
+type Fn = () => T;
+/**
+ * Constructor
+ */
+type Constructor = new (...args: any[]) => T;
+/**
+ * Infers the element type of an array
+ */
+type ElementOf = T extends (infer E)[] ? E : never;
+/**
+ * Defines an intersection type of all union items.
+ *
+ * @param U Union of any types that will be intersected.
+ * @returns U items intersected
+ * @see https://stackoverflow.com/a/50375286/9259330
+ */
+type UnionToIntersection = (U extends unknown ? (k: U) => void : never) extends ((k: infer I) => void) ? I : never;
+/**
+ * Infers the arguments type of a function
+ */
+type ArgumentsType = T extends ((...args: infer A) => any) ? A : never;
+type MergeInsertions = T extends object ? {
+ [K in keyof T]: MergeInsertions;
+} : T;
+type DeepMerge = MergeInsertions<{
+ [K in keyof F | keyof S]: K extends keyof S & keyof F ? DeepMerge : K extends keyof S ? S[K] : K extends keyof F ? F[K] : never;
+}>;
+
+/**
+ * Convert `Arrayable` to `Array`
+ *
+ * @category Array
+ */
+declare function toArray(array?: Nullable>): Array;
+/**
+ * Convert `Arrayable` to `Array` and flatten it
+ *
+ * @category Array
+ */
+declare function flattenArrayable(array?: Nullable>>): Array;
+/**
+ * Use rest arguments to merge arrays
+ *
+ * @category Array
+ */
+declare function mergeArrayable(...args: Nullable>[]): Array;
+type PartitionFilter = (i: T, idx: number, arr: readonly T[]) => any;
+/**
+ * Divide an array into two parts by a filter function
+ *
+ * @category Array
+ * @example const [odd, even] = partition([1, 2, 3, 4], i => i % 2 != 0)
+ */
+declare function partition(array: readonly T[], f1: PartitionFilter): [T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter): [T[], T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter, f3: PartitionFilter): [T[], T[], T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter, f3: PartitionFilter, f4: PartitionFilter): [T[], T[], T[], T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter, f3: PartitionFilter, f4: PartitionFilter, f5: PartitionFilter): [T[], T[], T[], T[], T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter, f3: PartitionFilter, f4: PartitionFilter, f5: PartitionFilter, f6: PartitionFilter): [T[], T[], T[], T[], T[], T[], T[]];
+/**
+ * Unique an Array
+ *
+ * @category Array
+ */
+declare function uniq(array: readonly T[]): T[];
+/**
+ * Unique an Array by a custom equality function
+ *
+ * @category Array
+ */
+declare function uniqueBy(array: readonly T[], equalFn: (a: any, b: any) => boolean): T[];
+/**
+ * Get last item
+ *
+ * @category Array
+ */
+declare function last(array: readonly []): undefined;
+declare function last(array: readonly T[]): T;
+/**
+ * Remove an item from Array
+ *
+ * @category Array
+ */
+declare function remove(array: T[], value: T): boolean;
+/**
+ * Get nth item of Array. Negative for backward
+ *
+ * @category Array
+ */
+declare function at(array: readonly [], index: number): undefined;
+declare function at(array: readonly T[], index: number): T;
+/**
+ * Genrate a range array of numbers. The `stop` is exclusive.
+ *
+ * @category Array
+ */
+declare function range(stop: number): number[];
+declare function range(start: number, stop: number, step?: number): number[];
+/**
+ * Move element in an Array
+ *
+ * @category Array
+ * @param arr
+ * @param from
+ * @param to
+ */
+declare function move(arr: T[], from: number, to: number): T[];
+/**
+ * Clamp a number to the index range of an array
+ *
+ * @category Array
+ */
+declare function clampArrayRange(n: number, arr: readonly unknown[]): number;
+/**
+ * Get random item(s) from an array
+ *
+ * @param arr
+ * @param quantity - quantity of random items which will be returned
+ */
+declare function sample(arr: T[], quantity: number): T[];
+/**
+ * Shuffle an array. This function mutates the array.
+ *
+ * @category Array
+ */
+declare function shuffle(array: T[]): T[];
+
+declare function assert(condition: boolean, message: string): asserts condition;
+declare const toString: (v: any) => string;
+declare function getTypeName(v: any): string;
+declare function noop(): void;
+
+declare function isDeepEqual(value1: any, value2: any): boolean;
+
+/**
+ * Type guard to filter out null-ish values
+ *
+ * @category Guards
+ * @example array.filter(notNullish)
+ */
+declare function notNullish(v: T | null | undefined): v is NonNullable;
+/**
+ * Type guard to filter out null values
+ *
+ * @category Guards
+ * @example array.filter(noNull)
+ */
+declare function noNull(v: T | null): v is Exclude;
+/**
+ * Type guard to filter out null-ish values
+ *
+ * @category Guards
+ * @example array.filter(notUndefined)
+ */
+declare function notUndefined(v: T): v is Exclude;
+/**
+ * Type guard to filter out falsy values
+ *
+ * @category Guards
+ * @example array.filter(isTruthy)
+ */
+declare function isTruthy(v: T): v is NonNullable;
+
+declare const isDef: (val?: T) => val is T;
+declare const isBoolean: (val: any) => val is boolean;
+declare const isFunction: (val: any) => val is T;
+declare const isNumber: (val: any) => val is number;
+declare const isString: (val: unknown) => val is string;
+declare const isObject: (val: any) => val is object;
+declare const isUndefined: (val: any) => val is undefined;
+declare const isNull: (val: any) => val is null;
+declare const isRegExp: (val: any) => val is RegExp;
+declare const isDate: (val: any) => val is Date;
+declare const isWindow: (val: any) => boolean;
+declare const isBrowser: boolean;
+
+declare function clamp(n: number, min: number, max: number): number;
+declare function sum(...args: number[] | number[][]): number;
+/**
+ * Linearly interpolates between `min` and `max` based on `t`
+ *
+ * @category Math
+ * @param min The minimum value
+ * @param max The maximum value
+ * @param t The interpolation value clamped between 0 and 1
+ * @example
+ * ```
+ * const value = lerp(0, 2, 0.5) // value will be 1
+ * ```
+ */
+declare function lerp(min: number, max: number, t: number): number;
+/**
+ * Linearly remaps a clamped value from its source range [`inMin`, `inMax`] to the destination range [`outMin`, `outMax`]
+ *
+ * @category Math
+ * @example
+ * ```
+ * const value = remap(0.5, 0, 1, 200, 400) // value will be 300
+ * ```
+ */
+declare function remap(n: number, inMin: number, inMax: number, outMin: number, outMax: number): number;
+
+/**
+ * Replace backslash to slash
+ *
+ * @category String
+ */
+declare function slash(str: string): string;
+/**
+ * Ensure prefix of a string
+ *
+ * @category String
+ */
+declare function ensurePrefix(prefix: string, str: string): string;
+/**
+ * Ensure suffix of a string
+ *
+ * @category String
+ */
+declare function ensureSuffix(suffix: string, str: string): string;
+/**
+ * Dead simple template engine, just like Python's `.format()`
+ * Support passing variables as either in index based or object/name based approach
+ * While using object/name based approach, you can pass a fallback value as the third argument
+ *
+ * @category String
+ * @example
+ * ```
+ * const result = template(
+ * 'Hello {0}! My name is {1}.',
+ * 'Inès',
+ * 'Anthony'
+ * ) // Hello Inès! My name is Anthony.
+ * ```
+ *
+ * ```
+ * const result = namedTemplate(
+ * '{greet}! My name is {name}.',
+ * { greet: 'Hello', name: 'Anthony' }
+ * ) // Hello! My name is Anthony.
+ * ```
+ *
+ * const result = namedTemplate(
+ * '{greet}! My name is {name}.',
+ * { greet: 'Hello' }, // name isn't passed hence fallback will be used for name
+ * 'placeholder'
+ * ) // Hello! My name is placeholder.
+ * ```
+ */
+declare function template(str: string, object: Record, fallback?: string | ((key: string) => string)): string;
+declare function template(str: string, ...args: (string | number | bigint | undefined | null)[]): string;
+/**
+ * Generate a random string
+ * @category String
+ */
+declare function randomStr(size?: number, dict?: string): string;
+/**
+ * First letter uppercase, other lowercase
+ * @category string
+ * @example
+ * ```
+ * capitalize('hello') => 'Hello'
+ * ```
+ */
+declare function capitalize(str: string): string;
+/**
+ * Remove common leading whitespace from a template string.
+ * Will also remove empty lines at the beginning and end.
+ * @category string
+ * @example
+ * ```ts
+ * const str = unindent`
+ * if (a) {
+ * b()
+ * }
+ * `
+ */
+declare function unindent(str: TemplateStringsArray | string): string;
+
+declare const timestamp: () => number;
+
+/**
+ * Call every function in an array
+ */
+declare function batchInvoke(functions: Nullable[]): void;
+/**
+ * Call the function
+ */
+declare function invoke(fn: Fn): void;
+/**
+ * Pass the value through the callback, and return the value
+ *
+ * @example
+ * ```
+ * function createUser(name: string): User {
+ * return tap(new User, user => {
+ * user.name = name
+ * })
+ * }
+ * ```
+ */
+declare function tap(value: T, callback: (value: T) => void): T;
+
+/**
+ * Map key/value pairs for an object, and construct a new one
+ *
+ *
+ * @category Object
+ *
+ * Transform:
+ * @example
+ * ```
+ * objectMap({ a: 1, b: 2 }, (k, v) => [k.toString().toUpperCase(), v.toString()])
+ * // { A: '1', B: '2' }
+ * ```
+ *
+ * Swap key/value:
+ * @example
+ * ```
+ * objectMap({ a: 1, b: 2 }, (k, v) => [v, k])
+ * // { 1: 'a', 2: 'b' }
+ * ```
+ *
+ * Filter keys:
+ * @example
+ * ```
+ * objectMap({ a: 1, b: 2 }, (k, v) => k === 'a' ? undefined : [k, v])
+ * // { b: 2 }
+ * ```
+ */
+declare function objectMap(obj: Record, fn: (key: K, value: V) => [NK, NV] | undefined): Record;
+/**
+ * Type guard for any key, `k`.
+ * Marks `k` as a key of `T` if `k` is in `obj`.
+ *
+ * @category Object
+ * @param obj object to query for key `k`
+ * @param k key to check existence in `obj`
+ */
+declare function isKeyOf(obj: T, k: keyof any): k is keyof T;
+/**
+ * Strict typed `Object.keys`
+ *
+ * @category Object
+ */
+declare function objectKeys(obj: T): (`${keyof T & undefined}` | `${keyof T & null}` | `${keyof T & string}` | `${keyof T & number}` | `${keyof T & false}` | `${keyof T & true}`)[];
+/**
+ * Strict typed `Object.entries`
+ *
+ * @category Object
+ */
+declare function objectEntries(obj: T): [keyof T, T[keyof T]][];
+/**
+ * Deep merge
+ *
+ * The first argument is the target object, the rest are the sources.
+ * The target object will be mutated and returned.
+ *
+ * @category Object
+ */
+declare function deepMerge(target: T, ...sources: S[]): DeepMerge;
+/**
+ * Deep merge
+ *
+ * Differs from `deepMerge` in that it merges arrays instead of overriding them.
+ *
+ * The first argument is the target object, the rest are the sources.
+ * The target object will be mutated and returned.
+ *
+ * @category Object
+ */
+declare function deepMergeWithArray(target: T, ...sources: S[]): DeepMerge;
+/**
+ * Create a new subset object by giving keys
+ *
+ * @category Object
+ */
+declare function objectPick(obj: O, keys: T[], omitUndefined?: boolean): Pick;
+/**
+ * Clear undefined fields from an object. It mutates the object
+ *
+ * @category Object
+ */
+declare function clearUndefined(obj: T): T;
+/**
+ * Determines whether an object has a property with the specified name
+ *
+ * @see https://eslint.org/docs/rules/no-prototype-builtins
+ * @category Object
+ */
+declare function hasOwnProperty(obj: T, v: PropertyKey): boolean;
+
+interface SingletonPromiseReturn {
+ (): Promise;
+ /**
+ * Reset current staled promise.
+ * Await it to have proper shutdown.
+ */
+ reset: () => Promise;
+}
+/**
+ * Create singleton promise function
+ *
+ * @category Promise
+ */
+declare function createSingletonPromise(fn: () => Promise): SingletonPromiseReturn;
+/**
+ * Promised `setTimeout`
+ *
+ * @category Promise
+ */
+declare function sleep(ms: number, callback?: Fn): Promise;
+/**
+ * Create a promise lock
+ *
+ * @category Promise
+ * @example
+ * ```
+ * const lock = createPromiseLock()
+ *
+ * lock.run(async () => {
+ * await doSomething()
+ * })
+ *
+ * // in anther context:
+ * await lock.wait() // it will wait all tasking finished
+ * ```
+ */
+declare function createPromiseLock(): {
+ run(fn: () => Promise): Promise;
+ wait(): Promise;
+ isWaiting(): boolean;
+ clear(): void;
+};
+/**
+ * Promise with `resolve` and `reject` methods of itself
+ */
+interface ControlledPromise extends Promise {
+ resolve: (value: T | PromiseLike) => void;
+ reject: (reason?: any) => void;
+}
+/**
+ * Return a Promise with `resolve` and `reject` methods
+ *
+ * @category Promise
+ * @example
+ * ```
+ * const promise = createControlledPromise()
+ *
+ * await promise
+ *
+ * // in anther context:
+ * promise.resolve(data)
+ * ```
+ */
+declare function createControlledPromise(): ControlledPromise;
+
+interface CancelOptions {
+ upcomingOnly?: boolean;
+}
+
+interface Cancel {
+ cancel: (options?: CancelOptions) => void;
+}
+
+interface NoReturn any> {
+ (...args: Parameters): void;
+}
+
+interface ThrottleOptions {
+ noTrailing?: boolean;
+ noLeading?: boolean;
+ debounceMode?: boolean;
+}
+
+interface DebounceOptions {
+ atBegin?: boolean;
+}
+
+type throttle any> = NoReturn & Cancel;
+
+/**
+ * Throttle execution of a function. Especially useful for rate limiting
+ * execution of handlers on events like resize and scroll.
+ *
+ * @param delay
+ * A zero-or-greater delay in milliseconds. For event callbacks, values around
+ * 100 or 250 (or even higher) are most useful.
+ *
+ * @param callback
+ * A function to be executed after delay milliseconds. The `this` context and
+ * all arguments are passed through, as-is, to `callback` when the
+ * throttled-function is executed.
+ *
+ * @param options
+ * An object to configure options.
+ *
+ * @param options.noTrailing
+ * Optional, defaults to false. If noTrailing is true, callback will only execute
+ * every `delay` milliseconds while the throttled-function is being called. If
+ * noTrailing is false or unspecified, callback will be executed one final time
+ * after the last throttled-function call. (After the throttled-function has not
+ * been called for `delay` milliseconds, the internal counter is reset)
+ *
+ * @param options.noLeading
+ * Optional, defaults to false. If noLeading is false, the first throttled-function
+ * call will execute callback immediately. If noLeading is true, the first the
+ * callback execution will be skipped. It should be noted that callback will never
+ * executed if both noLeading = true and noTrailing = true.
+ *
+ * @param options.debounceMode If `debounceMode` is true (at begin), schedule
+ * `callback` to execute after `delay` ms. If `debounceMode` is false (at end),
+ * schedule `callback` to execute after `delay` ms.
+ *
+ * @return
+ * A new, throttled, function.
+ */
+declare function throttle any>(
+ delay: number,
+ callback: T,
+ options?: ThrottleOptions,
+): throttle;
+type debounce any> = NoReturn & Cancel;
+
+/**
+ * Debounce execution of a function. Debouncing, unlike throttling,
+ * guarantees that a function is only executed a single time, either at the
+ * very beginning of a series of calls, or at the very end.
+ *
+ * @param delay
+ * A zero-or-greater delay in milliseconds. For event callbacks, values around
+ * 100 or 250 (or even higher) are most useful.
+ *
+ * @param callback
+ * A function to be executed after delay milliseconds. The `this` context and
+ * all arguments are passed through, as-is, to `callback` when the
+ * debounced-function is executed.
+ *
+ * @param options
+ * An object to configure options.
+ *
+ * @param options.atBegin
+ * If atBegin is false or unspecified, callback will only be executed `delay`
+ * milliseconds after the last debounced-function call. If atBegin is true,
+ * callback will be executed only at the first debounced-function call. (After
+ * the throttled-function has not been called for `delay` milliseconds, the
+ * internal counter is reset).
+ *
+ * @return
+ * A new, debounced function.
+ */
+declare function debounce any>(
+ delay: number,
+ callback: T,
+ options?: DebounceOptions,
+): debounce;
+
+interface POptions {
+ /**
+ * How many promises are resolved at the same time.
+ */
+ concurrency?: number | undefined;
+}
+declare class PInstance extends Promise[]> {
+ items: Iterable;
+ options?: POptions | undefined;
+ private promises;
+ get promise(): Promise[]>;
+ constructor(items?: Iterable, options?: POptions | undefined);
+ add(...args: (T | Promise)[]): void;
+ map(fn: (value: Awaited, index: number) => U): PInstance>;
+ filter(fn: (value: Awaited, index: number) => boolean | Promise): PInstance>;
+ forEach(fn: (value: Awaited, index: number) => void): Promise;
+ reduce(fn: (previousValue: U, currentValue: Awaited, currentIndex: number, array: Awaited[]) => U, initialValue: U): Promise;
+ clear(): void;
+ then(fn?: () => PromiseLike): Promise;
+ catch(fn?: (err: unknown) => PromiseLike): Promise;
+ finally(fn?: () => void): Promise[]>;
+}
+/**
+ * Utility for managing multiple promises.
+ *
+ * @see https://github.com/antfu/utils/tree/main/docs/p.md
+ * @category Promise
+ * @example
+ * ```
+ * import { p } from '@antfu/utils'
+ *
+ * const items = [1, 2, 3, 4, 5]
+ *
+ * await p(items)
+ * .map(async i => await multiply(i, 3))
+ * .filter(async i => await isEven(i))
+ * // [6, 12]
+ * ```
+ */
+declare function p(items?: Iterable, options?: POptions): PInstance;
+
+export { type ArgumentsType, type Arrayable, type Awaitable, type Constructor, type ControlledPromise, type DeepMerge, type ElementOf, type Fn, type MergeInsertions, type Nullable, type PartitionFilter, type SingletonPromiseReturn, type UnionToIntersection, assert, at, batchInvoke, capitalize, clamp, clampArrayRange, clearUndefined, createControlledPromise, createPromiseLock, createSingletonPromise, debounce, deepMerge, deepMergeWithArray, ensurePrefix, ensureSuffix, flattenArrayable, getTypeName, hasOwnProperty, invoke, isBoolean, isBrowser, isDate, isDeepEqual, isDef, isFunction, isKeyOf, isNull, isNumber, isObject, isRegExp, isString, isTruthy, isUndefined, isWindow, last, lerp, mergeArrayable, move, noNull, noop, notNullish, notUndefined, objectEntries, objectKeys, objectMap, objectPick, p, partition, randomStr, range, remap, remove, sample, shuffle, slash, sleep, sum, tap, template, throttle, timestamp, toArray, toString, unindent, uniq, uniqueBy };
diff --git a/src/健康青年/node_modules/@antfu/utils/dist/index.d.mts b/src/健康青年/node_modules/@antfu/utils/dist/index.d.mts
new file mode 100644
index 0000000..cba2e64
--- /dev/null
+++ b/src/健康青年/node_modules/@antfu/utils/dist/index.d.mts
@@ -0,0 +1,614 @@
+/**
+ * Promise, or maybe not
+ */
+type Awaitable = T | PromiseLike;
+/**
+ * Null or whatever
+ */
+type Nullable = T | null | undefined;
+/**
+ * Array, or not yet
+ */
+type Arrayable = T | Array;
+/**
+ * Function
+ */
+type Fn = () => T;
+/**
+ * Constructor
+ */
+type Constructor = new (...args: any[]) => T;
+/**
+ * Infers the element type of an array
+ */
+type ElementOf = T extends (infer E)[] ? E : never;
+/**
+ * Defines an intersection type of all union items.
+ *
+ * @param U Union of any types that will be intersected.
+ * @returns U items intersected
+ * @see https://stackoverflow.com/a/50375286/9259330
+ */
+type UnionToIntersection = (U extends unknown ? (k: U) => void : never) extends ((k: infer I) => void) ? I : never;
+/**
+ * Infers the arguments type of a function
+ */
+type ArgumentsType = T extends ((...args: infer A) => any) ? A : never;
+type MergeInsertions = T extends object ? {
+ [K in keyof T]: MergeInsertions;
+} : T;
+type DeepMerge = MergeInsertions<{
+ [K in keyof F | keyof S]: K extends keyof S & keyof F ? DeepMerge : K extends keyof S ? S[K] : K extends keyof F ? F[K] : never;
+}>;
+
+/**
+ * Convert `Arrayable` to `Array`
+ *
+ * @category Array
+ */
+declare function toArray(array?: Nullable>): Array;
+/**
+ * Convert `Arrayable` to `Array` and flatten it
+ *
+ * @category Array
+ */
+declare function flattenArrayable(array?: Nullable>>): Array;
+/**
+ * Use rest arguments to merge arrays
+ *
+ * @category Array
+ */
+declare function mergeArrayable(...args: Nullable>[]): Array;
+type PartitionFilter = (i: T, idx: number, arr: readonly T[]) => any;
+/**
+ * Divide an array into two parts by a filter function
+ *
+ * @category Array
+ * @example const [odd, even] = partition([1, 2, 3, 4], i => i % 2 != 0)
+ */
+declare function partition(array: readonly T[], f1: PartitionFilter): [T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter): [T[], T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter, f3: PartitionFilter): [T[], T[], T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter, f3: PartitionFilter, f4: PartitionFilter): [T[], T[], T[], T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter, f3: PartitionFilter, f4: PartitionFilter, f5: PartitionFilter): [T[], T[], T[], T[], T[], T[]];
+declare function partition(array: readonly T[], f1: PartitionFilter, f2: PartitionFilter, f3: PartitionFilter, f4: PartitionFilter, f5: PartitionFilter, f6: PartitionFilter): [T[], T[], T[], T[], T[], T[], T[]];
+/**
+ * Unique an Array
+ *
+ * @category Array
+ */
+declare function uniq(array: readonly T[]): T[];
+/**
+ * Unique an Array by a custom equality function
+ *
+ * @category Array
+ */
+declare function uniqueBy(array: readonly T[], equalFn: (a: any, b: any) => boolean): T[];
+/**
+ * Get last item
+ *
+ * @category Array
+ */
+declare function last(array: readonly []): undefined;
+declare function last(array: readonly T[]): T;
+/**
+ * Remove an item from Array
+ *
+ * @category Array
+ */
+declare function remove(array: T[], value: T): boolean;
+/**
+ * Get nth item of Array. Negative for backward
+ *
+ * @category Array
+ */
+declare function at(array: readonly [], index: number): undefined;
+declare function at(array: readonly T[], index: number): T;
+/**
+ * Genrate a range array of numbers. The `stop` is exclusive.
+ *
+ * @category Array
+ */
+declare function range(stop: number): number[];
+declare function range(start: number, stop: number, step?: number): number[];
+/**
+ * Move element in an Array
+ *
+ * @category Array
+ * @param arr
+ * @param from
+ * @param to
+ */
+declare function move(arr: T[], from: number, to: number): T[];
+/**
+ * Clamp a number to the index range of an array
+ *
+ * @category Array
+ */
+declare function clampArrayRange(n: number, arr: readonly unknown[]): number;
+/**
+ * Get random item(s) from an array
+ *
+ * @param arr
+ * @param quantity - quantity of random items which will be returned
+ */
+declare function sample(arr: T[], quantity: number): T[];
+/**
+ * Shuffle an array. This function mutates the array.
+ *
+ * @category Array
+ */
+declare function shuffle(array: T[]): T[];
+
+declare function assert(condition: boolean, message: string): asserts condition;
+declare const toString: (v: any) => string;
+declare function getTypeName(v: any): string;
+declare function noop(): void;
+
+declare function isDeepEqual(value1: any, value2: any): boolean;
+
+/**
+ * Type guard to filter out null-ish values
+ *
+ * @category Guards
+ * @example array.filter(notNullish)
+ */
+declare function notNullish(v: T | null | undefined): v is NonNullable;
+/**
+ * Type guard to filter out null values
+ *
+ * @category Guards
+ * @example array.filter(noNull)
+ */
+declare function noNull(v: T | null): v is Exclude;
+/**
+ * Type guard to filter out null-ish values
+ *
+ * @category Guards
+ * @example array.filter(notUndefined)
+ */
+declare function notUndefined(v: T): v is Exclude;
+/**
+ * Type guard to filter out falsy values
+ *
+ * @category Guards
+ * @example array.filter(isTruthy)
+ */
+declare function isTruthy(v: T): v is NonNullable;
+
+declare const isDef: (val?: T) => val is T;
+declare const isBoolean: (val: any) => val is boolean;
+declare const isFunction: (val: any) => val is T;
+declare const isNumber: (val: any) => val is number;
+declare const isString: (val: unknown) => val is string;
+declare const isObject: (val: any) => val is object;
+declare const isUndefined: (val: any) => val is undefined;
+declare const isNull: (val: any) => val is null;
+declare const isRegExp: (val: any) => val is RegExp;
+declare const isDate: (val: any) => val is Date;
+declare const isWindow: (val: any) => boolean;
+declare const isBrowser: boolean;
+
+declare function clamp(n: number, min: number, max: number): number;
+declare function sum(...args: number[] | number[][]): number;
+/**
+ * Linearly interpolates between `min` and `max` based on `t`
+ *
+ * @category Math
+ * @param min The minimum value
+ * @param max The maximum value
+ * @param t The interpolation value clamped between 0 and 1
+ * @example
+ * ```
+ * const value = lerp(0, 2, 0.5) // value will be 1
+ * ```
+ */
+declare function lerp(min: number, max: number, t: number): number;
+/**
+ * Linearly remaps a clamped value from its source range [`inMin`, `inMax`] to the destination range [`outMin`, `outMax`]
+ *
+ * @category Math
+ * @example
+ * ```
+ * const value = remap(0.5, 0, 1, 200, 400) // value will be 300
+ * ```
+ */
+declare function remap(n: number, inMin: number, inMax: number, outMin: number, outMax: number): number;
+
+/**
+ * Replace backslash to slash
+ *
+ * @category String
+ */
+declare function slash(str: string): string;
+/**
+ * Ensure prefix of a string
+ *
+ * @category String
+ */
+declare function ensurePrefix(prefix: string, str: string): string;
+/**
+ * Ensure suffix of a string
+ *
+ * @category String
+ */
+declare function ensureSuffix(suffix: string, str: string): string;
+/**
+ * Dead simple template engine, just like Python's `.format()`
+ * Support passing variables as either in index based or object/name based approach
+ * While using object/name based approach, you can pass a fallback value as the third argument
+ *
+ * @category String
+ * @example
+ * ```
+ * const result = template(
+ * 'Hello {0}! My name is {1}.',
+ * 'Inès',
+ * 'Anthony'
+ * ) // Hello Inès! My name is Anthony.
+ * ```
+ *
+ * ```
+ * const result = namedTemplate(
+ * '{greet}! My name is {name}.',
+ * { greet: 'Hello', name: 'Anthony' }
+ * ) // Hello! My name is Anthony.
+ * ```
+ *
+ * const result = namedTemplate(
+ * '{greet}! My name is {name}.',
+ * { greet: 'Hello' }, // name isn't passed hence fallback will be used for name
+ * 'placeholder'
+ * ) // Hello! My name is placeholder.
+ * ```
+ */
+declare function template(str: string, object: Record, fallback?: string | ((key: string) => string)): string;
+declare function template(str: string, ...args: (string | number | bigint | undefined | null)[]): string;
+/**
+ * Generate a random string
+ * @category String
+ */
+declare function randomStr(size?: number, dict?: string): string;
+/**
+ * First letter uppercase, other lowercase
+ * @category string
+ * @example
+ * ```
+ * capitalize('hello') => 'Hello'
+ * ```
+ */
+declare function capitalize(str: string): string;
+/**
+ * Remove common leading whitespace from a template string.
+ * Will also remove empty lines at the beginning and end.
+ * @category string
+ * @example
+ * ```ts
+ * const str = unindent`
+ * if (a) {
+ * b()
+ * }
+ * `
+ */
+declare function unindent(str: TemplateStringsArray | string): string;
+
+declare const timestamp: () => number;
+
+/**
+ * Call every function in an array
+ */
+declare function batchInvoke(functions: Nullable[]): void;
+/**
+ * Call the function
+ */
+declare function invoke(fn: Fn): void;
+/**
+ * Pass the value through the callback, and return the value
+ *
+ * @example
+ * ```
+ * function createUser(name: string): User {
+ * return tap(new User, user => {
+ * user.name = name
+ * })
+ * }
+ * ```
+ */
+declare function tap(value: T, callback: (value: T) => void): T;
+
+/**
+ * Map key/value pairs for an object, and construct a new one
+ *
+ *
+ * @category Object
+ *
+ * Transform:
+ * @example
+ * ```
+ * objectMap({ a: 1, b: 2 }, (k, v) => [k.toString().toUpperCase(), v.toString()])
+ * // { A: '1', B: '2' }
+ * ```
+ *
+ * Swap key/value:
+ * @example
+ * ```
+ * objectMap({ a: 1, b: 2 }, (k, v) => [v, k])
+ * // { 1: 'a', 2: 'b' }
+ * ```
+ *
+ * Filter keys:
+ * @example
+ * ```
+ * objectMap({ a: 1, b: 2 }, (k, v) => k === 'a' ? undefined : [k, v])
+ * // { b: 2 }
+ * ```
+ */
+declare function objectMap(obj: Record, fn: (key: K, value: V) => [NK, NV] | undefined): Record;
+/**
+ * Type guard for any key, `k`.
+ * Marks `k` as a key of `T` if `k` is in `obj`.
+ *
+ * @category Object
+ * @param obj object to query for key `k`
+ * @param k key to check existence in `obj`
+ */
+declare function isKeyOf(obj: T, k: keyof any): k is keyof T;
+/**
+ * Strict typed `Object.keys`
+ *
+ * @category Object
+ */
+declare function objectKeys(obj: T): (`${keyof T & undefined}` | `${keyof T & null}` | `${keyof T & string}` | `${keyof T & number}` | `${keyof T & false}` | `${keyof T & true}`)[];
+/**
+ * Strict typed `Object.entries`
+ *
+ * @category Object
+ */
+declare function objectEntries(obj: T): [keyof T, T[keyof T]][];
+/**
+ * Deep merge
+ *
+ * The first argument is the target object, the rest are the sources.
+ * The target object will be mutated and returned.
+ *
+ * @category Object
+ */
+declare function deepMerge(target: T, ...sources: S[]): DeepMerge;
+/**
+ * Deep merge
+ *
+ * Differs from `deepMerge` in that it merges arrays instead of overriding them.
+ *
+ * The first argument is the target object, the rest are the sources.
+ * The target object will be mutated and returned.
+ *
+ * @category Object
+ */
+declare function deepMergeWithArray(target: T, ...sources: S[]): DeepMerge;
+/**
+ * Create a new subset object by giving keys
+ *
+ * @category Object
+ */
+declare function objectPick(obj: O, keys: T[], omitUndefined?: boolean): Pick;
+/**
+ * Clear undefined fields from an object. It mutates the object
+ *
+ * @category Object
+ */
+declare function clearUndefined(obj: T): T;
+/**
+ * Determines whether an object has a property with the specified name
+ *
+ * @see https://eslint.org/docs/rules/no-prototype-builtins
+ * @category Object
+ */
+declare function hasOwnProperty(obj: T, v: PropertyKey): boolean;
+
+interface SingletonPromiseReturn {
+ (): Promise;
+ /**
+ * Reset current staled promise.
+ * Await it to have proper shutdown.
+ */
+ reset: () => Promise