更新代码

This commit is contained in:
ChenX
2024-08-14 17:08:00 +08:00
parent cad3b381d9
commit 53ec26cde9
2066 changed files with 33913 additions and 5836 deletions

44
types/Nest/Common/ArrayExt.d.ts vendored Normal file
View File

@@ -0,0 +1,44 @@
/**
* 删除数组中指定的元素,返回数组本身
* @param {Array<any>} arr 需要操作的数组
* @param {*} el 需要移除的元素
*/
export declare function arrayRemove<T>(arr: Array<T>, el: T): Array<T>;
export declare function arrayRemoveOnce<T>(arr: Array<T>, el: T): Array<T>;
/**
* 删除通过函数校验的元素
* @param {(e: T) => boolean} checkFuntion 校验函数
*/
export declare function arrayRemoveIf<T>(arr: Array<T>, checkFuntion: (e: T) => boolean): Array<T>;
export declare function arrayFirst<T>(arr: Array<T>): T;
export declare function arrayLast<T>(arr: {
[key: number]: T;
length: number;
}): T;
/**
* 根据数值从小到大排序数组
* @param {Array<T>} arr
* @returns {Array<T>} 返回自身
*/
export declare function arraySortByNumber<T>(arr: Array<T>): Array<T>;
/**
* 对排序好的数组进行去重操作
* @param {(e1, e2) => boolean} [checkFuction] 校验对象相等函数
* @returns {Array<T>} 返回自身
*/
export declare function arrayRemoveDuplicateBySort<T>(arr: Array<T>, checkFuction?: (e1: T, e2: T) => boolean): Array<T>;
export declare function arrayMap<T>(arr: Array<T>, mapFunc: (v: T) => T): Array<T>;
declare function checkEqual(e1: any, e2: any): boolean;
/**
* 改变数组的值顺序
* @param arr 需要改变初始值位置的数组
* @param index //将index位置以后的值放到起始位置
*/
export declare function changeArrayStartIndex<T>(arr: T[], index: number): T[];
export declare function equalArray<T>(a: T[], b: T[], checkF?: typeof checkEqual): boolean;
export declare function arrayClone<T>(arr: T[]): T[];
export declare function arrayPushArray<T>(arr1: T[], arr2: T[]): T[];
export declare function arraySum(arr: number[]): number;
export declare function FilterSet<T>(s: Set<T>, fn: (el: T) => boolean): Set<T>;
export {};
//# sourceMappingURL=ArrayExt.d.ts.map

View File

@@ -0,0 +1 @@
{"version":3,"file":"ArrayExt.d.ts","sourceRoot":"","sources":["../../../../src/Nest/Common/ArrayExt.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,wBAAgB,WAAW,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAa7D;AAGD,wBAAgB,eAAe,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAMjE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAazF;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAG9C;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,GAAG,EAAE;IAAE,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,CAAC;IAAC,MAAM,EAAE,MAAM,CAAC;CAAE,GAAG,CAAC,CAG1E;AAED;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAI5D;AAED;;;;GAIG;AACH,wBAAgB,0BAA0B,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,YAAY,GAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,OAAoB,GAAG,KAAK,CAAC,CAAC,CAAC,CAS3H;AAGD,wBAAgB,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAKzE;AAOD,iBAAS,UAAU,CAAC,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,OAAO,CAG7C;AAED;;;;GAIG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,CAAC,EAAE,CAIrE;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,MAAM,oBAAa,WAOhE;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAG3C;AAGD,wBAAgB,cAAc,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAS3D;AAED,wBAAgB,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,UAKrC;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAStE"}

23
types/Nest/Common/ComparePoint.d.ts vendored Normal file
View File

@@ -0,0 +1,23 @@
interface Vec2 {
x: number;
y: number;
}
export type CompareVectorFn = (v1: Vec2, v2: Vec2) => number;
/**
* 构建返回一个用来排序的函数.根据key创建排序规则.
*
* 当key = "xyz" 时,点集按 x从小到大,y从小到大 z从小到大
* key = "X" 时,点集按 x从大到小
* 以此类推.
*
* 例子:
* let pts:Vector3[] =...;
* pts.sort(comparePoint("x")); //x从小到大排序
* pts.sort(comparePoint("zX")); //z从小到大 x从大到小
*
* @export
* @param {string} sortKey
*/
export declare function ComparePoint(sortKey: string): CompareVectorFn;
export {};
//# sourceMappingURL=ComparePoint.d.ts.map

View File

@@ -0,0 +1 @@
{"version":3,"file":"ComparePoint.d.ts","sourceRoot":"","sources":["../../../../src/Nest/Common/ComparePoint.ts"],"names":[],"mappings":"AAAA,UAAU,IAAI;IAAG,CAAC,EAAE,MAAM,CAAC;IAAC,CAAC,EAAE,MAAM,CAAC;CAAE;AAExC,MAAM,MAAM,eAAe,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,KAAK,MAAM,CAAC;AAO7D;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,eAAe,CAiC7D"}

3
types/Nest/Common/ConvexHull2D.d.ts vendored Normal file
View File

@@ -0,0 +1,3 @@
import { Point } from "./Point";
export declare function ConvexHull2D(points: Point[]): Point[];
//# sourceMappingURL=ConvexHull2D.d.ts.map

View File

@@ -0,0 +1 @@
{"version":3,"file":"ConvexHull2D.d.ts","sourceRoot":"","sources":["../../../../src/Nest/Common/ConvexHull2D.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAEhC,wBAAgB,YAAY,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,KAAK,EAAE,CAKrD"}

2
types/Nest/Common/Random.d.ts vendored Normal file
View File

@@ -0,0 +1,2 @@
export declare function RandomIndex(count: number, exclude?: number): number;
//# sourceMappingURL=Random.d.ts.map

View File

@@ -0,0 +1 @@
{"version":3,"file":"Random.d.ts","sourceRoot":"","sources":["../../../../src/Nest/Common/Random.ts"],"names":[],"mappings":"AAEA,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,MAAM,CAMnE"}

2
types/Nest/Common/Sleep.d.ts vendored Normal file
View File

@@ -0,0 +1,2 @@
export declare function Sleep(time: number): Promise<unknown>;
//# sourceMappingURL=Sleep.d.ts.map

View File

@@ -0,0 +1 @@
{"version":3,"file":"Sleep.d.ts","sourceRoot":"","sources":["../../../../src/Nest/Common/Sleep.ts"],"names":[],"mappings":"AAAA,wBAAsB,KAAK,CAAC,IAAI,EAAE,MAAM,oBAMvC"}