TypedArrayUtils.d.ts 1.3 KB

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