@thi.ng/distance 2.1.12 → 2.1.13
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +1 -1
- package/argmin.d.ts +2 -2
- package/knearest.d.ts +4 -4
- package/nearest.d.ts +4 -4
- package/package.json +12 -12
package/CHANGELOG.md
CHANGED
package/argmin.d.ts
CHANGED
|
@@ -31,7 +31,7 @@ export declare const argminN: (p: number, samples: NumericArray, dist?: Metric<n
|
|
|
31
31
|
* @param key -
|
|
32
32
|
* @param dist -
|
|
33
33
|
*/
|
|
34
|
-
export declare const argminT: <T>(p: T, samples: T[], key: Fn<T, ReadonlyVec>, dist?: Metric<ReadonlyVec> | IDistance<ReadonlyVec>
|
|
34
|
+
export declare const argminT: <T>(p: T, samples: T[], key: Fn<T, ReadonlyVec>, dist?: Metric<ReadonlyVec> | IDistance<ReadonlyVec>) => number;
|
|
35
35
|
/**
|
|
36
36
|
* Similar to {@link argmin}, but for k-nearest queries.
|
|
37
37
|
*
|
|
@@ -49,5 +49,5 @@ export declare const argminK: (k: number, p: ReadonlyVec, samples: ReadonlyVec[]
|
|
|
49
49
|
* @param samples -
|
|
50
50
|
* @param dist -
|
|
51
51
|
*/
|
|
52
|
-
export declare const argminKT: <T>(k: number, p: T, samples: T[], key: Fn<T, ReadonlyVec>, dist?: IDistance<ReadonlyVec>
|
|
52
|
+
export declare const argminKT: <T>(k: number, p: T, samples: T[], key: Fn<T, ReadonlyVec>, dist?: IDistance<ReadonlyVec>) => number[];
|
|
53
53
|
//# sourceMappingURL=argmin.d.ts.map
|
package/knearest.d.ts
CHANGED
|
@@ -56,7 +56,7 @@ export declare class KNearest<D, T> implements INeighborhood<D, T>, IDeref<Neigh
|
|
|
56
56
|
* @param dist -
|
|
57
57
|
* @param sorted -
|
|
58
58
|
*/
|
|
59
|
-
export declare const knearest: <T>(p: ReadonlyVec, k: number, r?: number
|
|
59
|
+
export declare const knearest: <T>(p: ReadonlyVec, k: number, r?: number, dist?: import("./squared.js").Squared<ReadonlyVec>, sorted?: boolean) => KNearest<ReadonlyVec, T>;
|
|
60
60
|
/**
|
|
61
61
|
* Defines a {@link KNearest} instance for 2D vector positions and, by default,
|
|
62
62
|
* using an infinite region radius and {@link DIST_SQ2} distance metric.
|
|
@@ -67,7 +67,7 @@ export declare const knearest: <T>(p: ReadonlyVec, k: number, r?: number | undef
|
|
|
67
67
|
* @param dist -
|
|
68
68
|
* @param sorted -
|
|
69
69
|
*/
|
|
70
|
-
export declare const knearest2: <T>(p: ReadonlyVec, k: number, r?: number
|
|
70
|
+
export declare const knearest2: <T>(p: ReadonlyVec, k: number, r?: number, dist?: import("./squared.js").Squared<ReadonlyVec>, sorted?: boolean) => KNearest<ReadonlyVec, T>;
|
|
71
71
|
/**
|
|
72
72
|
* Defines a {@link KNearest} instance for 3D vector positions, by default,
|
|
73
73
|
* using an infinite region radius and {@link DIST_SQ3} distance metric.
|
|
@@ -78,7 +78,7 @@ export declare const knearest2: <T>(p: ReadonlyVec, k: number, r?: number | unde
|
|
|
78
78
|
* @param dist -
|
|
79
79
|
* @param sorted -
|
|
80
80
|
*/
|
|
81
|
-
export declare const knearest3: <T>(p: ReadonlyVec, k: number, r?: number
|
|
81
|
+
export declare const knearest3: <T>(p: ReadonlyVec, k: number, r?: number, dist?: import("./squared.js").Squared<ReadonlyVec>, sorted?: boolean) => KNearest<ReadonlyVec, T>;
|
|
82
82
|
/**
|
|
83
83
|
* Defines a {@link KNearest} instance for numeric positions and, by default,
|
|
84
84
|
* using an infinite region radius and {@link DIST_SQ1} distance metric.
|
|
@@ -89,5 +89,5 @@ export declare const knearest3: <T>(p: ReadonlyVec, k: number, r?: number | unde
|
|
|
89
89
|
* @param dist -
|
|
90
90
|
* @param sorted -
|
|
91
91
|
*/
|
|
92
|
-
export declare const knearestN: <T>(p: number, k: number, r?: number
|
|
92
|
+
export declare const knearestN: <T>(p: number, k: number, r?: number, dist?: import("./squared.js").Squared<number>, sorted?: boolean) => KNearest<number, T>;
|
|
93
93
|
//# sourceMappingURL=knearest.d.ts.map
|
package/nearest.d.ts
CHANGED
|
@@ -34,7 +34,7 @@ export declare class Nearest<D, T> implements INeighborhood<D, T>, IDeref<Neighb
|
|
|
34
34
|
* @param r -
|
|
35
35
|
* @param dist -
|
|
36
36
|
*/
|
|
37
|
-
export declare const nearest: <T>(p: ReadonlyVec, r?: number
|
|
37
|
+
export declare const nearest: <T>(p: ReadonlyVec, r?: number, dist?: import("./squared.js").Squared<ReadonlyVec>) => Nearest<ReadonlyVec, T>;
|
|
38
38
|
/**
|
|
39
39
|
* Defines a {@link Nearest} instance for 2D vector positions, by default,
|
|
40
40
|
* using an infinite region radius and {@link DIST_SQ2} distance metric.
|
|
@@ -43,7 +43,7 @@ export declare const nearest: <T>(p: ReadonlyVec, r?: number | undefined, dist?:
|
|
|
43
43
|
* @param r -
|
|
44
44
|
* @param dist -
|
|
45
45
|
*/
|
|
46
|
-
export declare const nearest2: <T>(p: ReadonlyVec, r?: number
|
|
46
|
+
export declare const nearest2: <T>(p: ReadonlyVec, r?: number, dist?: import("./squared.js").Squared<ReadonlyVec>) => Nearest<ReadonlyVec, T>;
|
|
47
47
|
/**
|
|
48
48
|
* Defines a {@link Nearest} instance for 3D vector positions, by default,
|
|
49
49
|
* using an infinite region radius and {@link DIST_SQ3} distance metric.
|
|
@@ -52,7 +52,7 @@ export declare const nearest2: <T>(p: ReadonlyVec, r?: number | undefined, dist?
|
|
|
52
52
|
* @param r -
|
|
53
53
|
* @param dist -
|
|
54
54
|
*/
|
|
55
|
-
export declare const nearest3: <T>(p: ReadonlyVec, r?: number
|
|
55
|
+
export declare const nearest3: <T>(p: ReadonlyVec, r?: number, dist?: import("./squared.js").Squared<ReadonlyVec>) => Nearest<ReadonlyVec, T>;
|
|
56
56
|
/**
|
|
57
57
|
* Defines a {@link Nearest} instance for numeric positions and, by default,
|
|
58
58
|
* using an infinite region radius and {@link DIST_SQ1} distance metric.
|
|
@@ -61,5 +61,5 @@ export declare const nearest3: <T>(p: ReadonlyVec, r?: number | undefined, dist?
|
|
|
61
61
|
* @param r -
|
|
62
62
|
* @param dist -
|
|
63
63
|
*/
|
|
64
|
-
export declare const nearestN: <T>(p: number, r?: number
|
|
64
|
+
export declare const nearestN: <T>(p: number, r?: number, dist?: import("./squared.js").Squared<number>) => Nearest<number, T>;
|
|
65
65
|
//# sourceMappingURL=nearest.d.ts.map
|
package/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@thi.ng/distance",
|
|
3
|
-
"version": "2.1.
|
|
3
|
+
"version": "2.1.13",
|
|
4
4
|
"description": "N-dimensional distance metrics & K-nearest neighborhoods for point queries",
|
|
5
5
|
"type": "module",
|
|
6
6
|
"module": "./index.js",
|
|
@@ -34,20 +34,20 @@
|
|
|
34
34
|
"test": "testament test"
|
|
35
35
|
},
|
|
36
36
|
"dependencies": {
|
|
37
|
-
"@thi.ng/api": "^8.3.
|
|
38
|
-
"@thi.ng/checks": "^3.
|
|
39
|
-
"@thi.ng/errors": "^2.1.
|
|
40
|
-
"@thi.ng/heaps": "^2.1.
|
|
41
|
-
"@thi.ng/math": "^5.3.
|
|
42
|
-
"@thi.ng/vectors": "^7.5.
|
|
37
|
+
"@thi.ng/api": "^8.3.7",
|
|
38
|
+
"@thi.ng/checks": "^3.2.0",
|
|
39
|
+
"@thi.ng/errors": "^2.1.7",
|
|
40
|
+
"@thi.ng/heaps": "^2.1.7",
|
|
41
|
+
"@thi.ng/math": "^5.3.3",
|
|
42
|
+
"@thi.ng/vectors": "^7.5.5"
|
|
43
43
|
},
|
|
44
44
|
"devDependencies": {
|
|
45
|
-
"@microsoft/api-extractor": "^7.
|
|
46
|
-
"@thi.ng/testament": "^0.2.
|
|
45
|
+
"@microsoft/api-extractor": "^7.25.0",
|
|
46
|
+
"@thi.ng/testament": "^0.2.8",
|
|
47
47
|
"rimraf": "^3.0.2",
|
|
48
48
|
"tools": "^0.0.1",
|
|
49
|
-
"typedoc": "^0.22.
|
|
50
|
-
"typescript": "^4.
|
|
49
|
+
"typedoc": "^0.22.17",
|
|
50
|
+
"typescript": "^4.7.3"
|
|
51
51
|
},
|
|
52
52
|
"keywords": [
|
|
53
53
|
"distance",
|
|
@@ -109,5 +109,5 @@
|
|
|
109
109
|
],
|
|
110
110
|
"year": 2021
|
|
111
111
|
},
|
|
112
|
-
"gitHead": "
|
|
112
|
+
"gitHead": "9e516d30a1a537e027a6b3d78bf9121bc5831d31\n"
|
|
113
113
|
}
|