1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
|
export namespace TypedArrayUtils {
export function quicksortIP( arr: any[], eleSize: number, orderElement: number ): any[];
export class Kdtree {
self: this;
root: Node;
private maxDepth: number;
constructor( points: Int8Array | Int16Array | Int32Array | Uint8Array | Uint16Array | Uint32Array | Float32Array | Float64Array | Uint8ClampedArray, metric: ( a: any, b: any ) => number, eleSize: number );
getPointSet( points: any, pos: number );
buildTree(): Node;
getMaxDepth(): number;
nearest( point: [], maxNodes: number, maxDistance: number ): any[];
}
export namespace Kdtree {
export class Node {
obj: any;
left: Node | null;
right: Node | null;
parent: Node;
depth: number;
pos: any;
constructor( obj: any, depth: number, parent: Node, pos: any )
}
export class BinaryHeap {
content: any[];
scoreFunction: () => any;
constructor( scoreFunction?: () => any );
}
export namespace BinaryHeap {
export function push( element: any ): void;
export function pop(): any;
export function peek(): any;
export function remove( node: any ): any;
export function size(): number;
export function bubbleUp( n: number ): void;
export function sinkDown( n: number ): void;
}
}
}
|
