@woosh/meep-engine 2.91.0 → 2.91.1
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/package.json +1 -1
- package/src/core/geom/2d/bvh/BVH2D.d.ts +7 -0
- package/src/core/geom/2d/bvh/BVH2D.d.ts.map +1 -1
- package/src/core/geom/2d/bvh/BVH2D.js +1 -1
- package/src/core/geom/2d/bvh/bvh2d_query_all_data_by_circle.d.ts +13 -0
- package/src/core/geom/2d/bvh/bvh2d_query_all_data_by_circle.d.ts.map +1 -0
- package/src/core/geom/2d/bvh/bvh2d_query_all_data_by_circle.js +83 -0
package/package.json
CHANGED
|
@@ -2,6 +2,13 @@ export const COLUMN_PARENT: 4;
|
|
|
2
2
|
export const COLUMN_CHILD_1: 5;
|
|
3
3
|
export const COLUMN_CHILD_2: 6;
|
|
4
4
|
export const COLUMN_HEIGHT: 7;
|
|
5
|
+
/**
|
|
6
|
+
* A non-leaf node have both CHILD_1 and CHILD_2 set, when CHILD_1 is not set - it's a leaf node
|
|
7
|
+
* So we can utilize space of CHILD_2 to store USER_DATA, hence there is overlap in schema
|
|
8
|
+
* @readonly
|
|
9
|
+
* @type {number}
|
|
10
|
+
*/
|
|
11
|
+
export const COLUMN_USER_DATA: number;
|
|
5
12
|
/**
|
|
6
13
|
*
|
|
7
14
|
* @type {number}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"BVH2D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/bvh/BVH2D.js"],"names":[],"mappings":"AASA,8BAA+B;AAC/B,+BAAgC;AAChC,+BAAgC;AAChC,8BAA+B;
|
|
1
|
+
{"version":3,"file":"BVH2D.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/bvh/BVH2D.js"],"names":[],"mappings":"AASA,8BAA+B;AAC/B,+BAAgC;AAChC,+BAAgC;AAChC,8BAA+B;AAE/B;;;;;GAKG;AACH,+BAFU,MAAM,CAE+B;AAE/C;;;GAGG;AACH,wBAFU,MAAM,CAEoB;AAcpC;;;;;GAKG;AACH,iCAFU,MAAM,CAEoB;AAgBpC;;;;GAIG;AACH;IAEI;;;;OAIG;IACH,sBAA2E;IAE3E;;;;OAIG;IACH,uBAAsD;IAEtD;;;;OAIG;IACH,sBAAoD;IAEpD;;;;OAIG;IACH,mBAA8B;IAE9B;;;;OAIG;IACH,eAAW;IAEX;;;;OAIG;IACH,eAAY;IAEZ;;;;OAIG;IACH,uBAAmB;IAEnB;;;;OAIG;IACH,eAAmB;IAEnB;;;OAGG;IACH,mBAEC;IAUD;;;OAGG;IACH,+BAMC;IAlBD;;;OAGG;IACH,4BAEC;IAcD,wBAgBC;IAED;;;;OAIG;IACH,uBAqBC;IAED;;OAEG;IACH,aAIC;IAED;;;OAGG;IACH,iBAFa,MAAM,CAmDlB;IAED;;;;OAIG;IACH,iBAFW,MAAM,QAMhB;IAED;;;;OAIG;IACH,iBAHW,MAAM,GACJ,OAAO,CAOnB;IAED;;;;OAIG;IACH,uBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,uBAHW,MAAM,SACN,MAAM,QAOhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAED;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,sBAHW,MAAM,UACN,MAAM,QAIhB;IAGD;;;;OAIG;IACH,oBAHW,MAAM,GACJ,MAAM,CAKlB;IAED;;;;OAIG;IACH,oBAHW,MAAM,UACN,MAAM,QAKhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,UACN,MAAM,EAAE,GAAC,YAAY,QAa/B;IAED;;;;OAIG;IACH,kBAHW,MAAM,QACN,MAAM,EAAE,GAAC,UAAU,MAAM,CAAC,QAkBpC;IAED;;;;OAIG;IACH,mBAHW,MAAM,QACN,MAAM,EAAE,QAWlB;IAED;;;;;;;;;OASG;IACH,4BARW,MAAM,MACN,MAAM,MACN,MAAM,MAEN,MAAM,MACN,MAAM,QAkBhB;IAED;;;;OAIG;IACH,0BAHW,MAAM,GACJ,MAAM,CAkBlB;IAED;;;;;OAKG;IACH,wCAJW,MAAM,WACN,MAAM,GACJ,MAAM,CA6BlB;IAED;;;;;OAKG;IACH,oCAJW,MAAM,WACN,MAAM,WACN,MAAM,QA+BhB;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA0GhB;IAED;;;;;OAKG;IACH,wBAuBC;IAED;;;;OAIG;IACH,yBA4BC;IAED;;;;OAIG;IACH,kBAHW,MAAM,GACJ,IAAI,CA6ChB;IAED;;;;;;OAMG;IACH,gBAoMC;IAED;;;OAGG;IACH,oBAIC;IAED;;;;OAIG;IACH,yCA8BC;IAED;;;;;OAKG;IACH,+BAJW,MAAM,EAAE,sBACR,MAAM,GACJ,MAAM,CAWlB;IAED;;;;;OAKG;IACH,0BA6BC;IAED;;;;;OAKG;IACH,cAJW,MAAM,KACN,MAAM,GACJ,OAAO,CAsCnB;CACJ"}
|
|
@@ -0,0 +1,13 @@
|
|
|
1
|
+
/**
|
|
2
|
+
*
|
|
3
|
+
* @param {BVH2D} bvh
|
|
4
|
+
* @param {number} root
|
|
5
|
+
* @param {number[]|Uint32Array} result
|
|
6
|
+
* @param {number} result_offset
|
|
7
|
+
* @param {number} center_x
|
|
8
|
+
* @param {number} center_y
|
|
9
|
+
* @param {number} radius
|
|
10
|
+
* @return {number}
|
|
11
|
+
*/
|
|
12
|
+
export function bvh2d_query_all_data_by_circle(bvh: BVH2D, root: number, result: number[] | Uint32Array, result_offset: number, center_x: number, center_y: number, radius: number): number;
|
|
13
|
+
//# sourceMappingURL=bvh2d_query_all_data_by_circle.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"bvh2d_query_all_data_by_circle.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/bvh/bvh2d_query_all_data_by_circle.js"],"names":[],"mappings":"AAMA;;;;;;;;;;GAUG;AACH,iEARW,MAAM,UACN,MAAM,EAAE,GAAC,WAAW,iBACpB,MAAM,YACN,MAAM,YACN,MAAM,UACN,MAAM,GACL,MAAM,CAmEjB"}
|
|
@@ -0,0 +1,83 @@
|
|
|
1
|
+
import { SCRATCH_UINT32_TRAVERSAL_STACK } from "../../../collection/SCRATCH_UINT32_TRAVERSAL_STACK.js";
|
|
2
|
+
import { aabb2_intersects_circle } from "../aabb/aabb2_intersects_circle.js";
|
|
3
|
+
import { COLUMN_CHILD_1, COLUMN_CHILD_2, COLUMN_USER_DATA, ELEMENT_WORD_COUNT, NULL_NODE } from "./BVH2D.js";
|
|
4
|
+
|
|
5
|
+
const stack = SCRATCH_UINT32_TRAVERSAL_STACK;
|
|
6
|
+
|
|
7
|
+
/**
|
|
8
|
+
*
|
|
9
|
+
* @param {BVH2D} bvh
|
|
10
|
+
* @param {number} root
|
|
11
|
+
* @param {number[]|Uint32Array} result
|
|
12
|
+
* @param {number} result_offset
|
|
13
|
+
* @param {number} center_x
|
|
14
|
+
* @param {number} center_y
|
|
15
|
+
* @param {number} radius
|
|
16
|
+
* @return {number}
|
|
17
|
+
*/
|
|
18
|
+
export function bvh2d_query_all_data_by_circle(
|
|
19
|
+
bvh, root,
|
|
20
|
+
result, result_offset,
|
|
21
|
+
center_x, center_y, radius
|
|
22
|
+
) {
|
|
23
|
+
|
|
24
|
+
if (root === NULL_NODE) {
|
|
25
|
+
return 0;
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
/**
|
|
29
|
+
*
|
|
30
|
+
* @type {number}
|
|
31
|
+
*/
|
|
32
|
+
const stack_top = stack.pointer++;
|
|
33
|
+
|
|
34
|
+
stack[stack_top] = root;
|
|
35
|
+
|
|
36
|
+
let result_cursor = result_offset;
|
|
37
|
+
|
|
38
|
+
/*
|
|
39
|
+
For performance, we bind data directly to avoid extra copies required to read out AABB
|
|
40
|
+
*/
|
|
41
|
+
const float32 = bvh.__data_float32;
|
|
42
|
+
const uint32 = bvh.__data_uint32;
|
|
43
|
+
|
|
44
|
+
do {
|
|
45
|
+
stack.pointer--;
|
|
46
|
+
|
|
47
|
+
/**
|
|
48
|
+
*
|
|
49
|
+
* @type {number}
|
|
50
|
+
*/
|
|
51
|
+
const node = stack[stack.pointer];
|
|
52
|
+
|
|
53
|
+
const address = node * ELEMENT_WORD_COUNT;
|
|
54
|
+
|
|
55
|
+
// test node against the ray
|
|
56
|
+
const intersects = aabb2_intersects_circle(
|
|
57
|
+
float32[address], float32[address + 1],
|
|
58
|
+
float32[address + 2], float32[address + 3],
|
|
59
|
+
center_x, center_y, radius
|
|
60
|
+
);
|
|
61
|
+
|
|
62
|
+
if (!intersects) {
|
|
63
|
+
continue;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
// get fist child to check if this is a leaf node or not
|
|
67
|
+
const child_1 = uint32[address + COLUMN_CHILD_1];
|
|
68
|
+
|
|
69
|
+
if (child_1 !== NULL_NODE) {
|
|
70
|
+
|
|
71
|
+
// this is not a leaf node, push children onto traversal stack
|
|
72
|
+
stack[stack.pointer++] = child_1;
|
|
73
|
+
stack[stack.pointer++] = uint32[address + COLUMN_CHILD_2];
|
|
74
|
+
|
|
75
|
+
} else {
|
|
76
|
+
// leaf node
|
|
77
|
+
|
|
78
|
+
result[result_cursor++] = uint32[address + COLUMN_USER_DATA];
|
|
79
|
+
}
|
|
80
|
+
} while (stack.pointer > stack_top);
|
|
81
|
+
|
|
82
|
+
return result_cursor - result_offset;
|
|
83
|
+
}
|