@rings-webgpu/core 1.0.2 → 1.0.3

package/dist/src/core/tree/quad/QuadAABB.js

@@ -1,116 +0,0 @@
-import { Vector3 } from "../../../math/Vector3";
-export class QuadAABB {
-    static { this.TINY = 0.000001; }
-    constructor() {
-        this.minPosX = 0;
-        this.minPosY = 0;
-        this.maxPosX = 0;
-        this.maxPosY = 0;
-        this.testID = 0;
-        this.points = new Array();
-        this.offsetPosition = new Vector3(0, 0, 0, 0);
-        this.clear();
-    }
-    setAABox(cx, cy, sideX, sideY) {
-        this.minPosX = cx - sideX / 2 - QuadAABB.TINY;
-        this.maxPosX = cx + sideX / 2 + QuadAABB.TINY;
-        this.minPosY = cy - sideY / 2 - QuadAABB.TINY;
-        this.maxPosY = cy + sideY / 2 + QuadAABB.TINY;
-        this.offsetPosition.setTo(0, 0, 0);
-    }
-    setOffset(vec) {
-        this.maxPosX += vec.x - this.offsetPosition.x;
-        this.minPosX += vec.x - this.offsetPosition.x;
-        this.minPosY += vec.z - this.offsetPosition.z;
-        this.maxPosY += vec.z - this.offsetPosition.z;
-        this.offsetPosition.copyFrom(vec);
-    }
-    setContainRect(minX, minY, maxX, maxY) {
-        if (this.minPosX > minX)
-            this.minPosX = minX;
-        if (this.minPosY > minY)
-            this.minPosY = minY;
-        if (this.maxPosX < maxX)
-            this.maxPosX = maxX;
-        if (this.maxPosY < maxY)
-            this.maxPosY = maxY;
-    }
-    clear() {
-        var huge = 1000000000;
-        this.minPosX = this.minPosY = huge;
-        this.maxPosX = this.maxPosY = -huge;
-        this.points.length = 0;
-        this.testID = 0;
-        this.offsetPosition.setTo(0, 0, 0);
-    }
-    addPoint(pos) {
-        if (this.points.indexOf(pos) == -1) {
-            if (pos.x < this.minPosX)
-                this.minPosX = pos.x - QuadAABB.TINY;
-            if (pos.x > this.maxPosX)
-                this.maxPosX = pos.x + QuadAABB.TINY;
-            if (pos.z < this.minPosY)
-                this.minPosY = pos.z - QuadAABB.TINY;
-            if (pos.z > this.maxPosY)
-                this.maxPosY = pos.z + QuadAABB.TINY;
-            this.points.push(pos);
-        }
-    }
-    clone() {
-        var aabb = new QuadAABB();
-        aabb.minPosX = this.minPosX;
-        aabb.minPosY = this.minPosY;
-        aabb.maxPosX = this.maxPosX;
-        aabb.maxPosY = this.maxPosY;
-        return aabb;
-    }
-    get radius() {
-        return Math.sqrt((this.maxPosY - this.minPosY) * (this.maxPosY - this.minPosY) +
-            (this.maxPosX - this.minPosX) * (this.maxPosX - this.minPosX));
-    }
-    get sideX() {
-        return this.maxPosX - this.minPosX;
-    }
-    get sideY() {
-        return this.maxPosY - this.minPosY;
-    }
-    get centreX() {
-        return (this.maxPosX - this.minPosX) * 0.5 + this.minPosX;
-    }
-    get centreY() {
-        return (this.maxPosY - this.minPosY) * 0.5 + this.minPosY;
-    }
-    overlapTest(box) {
-        return this.minPosY >= box.maxPosY ||
-            this.maxPosY <= box.minPosY ||
-            this.minPosX >= box.maxPosX ||
-            this.maxPosX <= box.minPosX
-            ? false
-            : true;
-    }
-    isPointInside(pos) {
-        return (pos.x >= this.minPosX &&
-            pos.x <= this.maxPosX &&
-            pos.z >= this.minPosY &&
-            pos.z <= this.maxPosY);
-    }
-    isIntersectLineSegment(p1x, p1y, p2x, p2y) {
-        var isIntersect = false;
-        var A1 = p1y - p2y;
-        var B1 = p2x - p1x;
-        var C1 = p1x * p2y - p2x * p1y;
-        var LineIntersectY = (-C1 - A1 * this.minPosX) / B1;
-        if (LineIntersectY <= this.maxPosY && LineIntersectY >= this.minPosY)
-            isIntersect = true;
-        LineIntersectY = (-C1 - A1 * this.maxPosX) / B1;
-        if (LineIntersectY <= this.maxPosY && LineIntersectY >= this.minPosY)
-            isIntersect = true;
-        var LineIntersectX = (-C1 - B1 * this.minPosY) / A1;
-        if (LineIntersectX <= this.maxPosX && LineIntersectX >= this.minPosX)
-            isIntersect = true;
-        LineIntersectX = (-C1 - B1 * this.maxPosY) / A1;
-        if (LineIntersectX <= this.maxPosX && LineIntersectX >= this.minPosX)
-            isIntersect = true;
-        return isIntersect;
-    }
-}

package/dist/src/core/tree/quad/QuadRoot.d.ts

@@ -1,14 +0,0 @@
-import { Vector3 } from "../../../math/Vector3";
-import { IQuadNode } from "./IQuadNode";
-export declare class QuadRoot {
-    private _maxNodesPerCell;
-    private _minCellSize;
-    private _quadTree;
-    private _collisionNodesIdx;
-    private _segBox;
-    private _collisionNodes;
-    constructor(maxNodesPerCell?: number, minCellSize?: number);
-    createQuadTree(nodes: Array<IQuadNode>): void;
-    getNodesByAABB(minX: number, minY: number, maxX: number, maxY: number): Array<IQuadNode>;
-    getTriangleAtPoint(point: Vector3, threshold?: number): IQuadNode;
-}

package/dist/src/core/tree/quad/QuadRoot.js

@@ -1,67 +0,0 @@
-import { Vector3 } from "../../../math/Vector3";
-import { QuadAABB } from "./QuadAABB";
-import { QuadTree } from "./QuadTree";
-export class QuadRoot {
-    constructor(maxNodesPerCell = 10, minCellSize = 500) {
-        this._maxNodesPerCell = maxNodesPerCell;
-        this._minCellSize = minCellSize;
-        this._segBox = new QuadAABB();
-        this._collisionNodesIdx = new Array();
-        this._collisionNodes = new Array();
-    }
-    createQuadTree(nodes) {
-        this._quadTree = new QuadTree();
-        this._quadTree.initNodes(nodes);
-        this._quadTree.buildQuadTree(this._maxNodesPerCell, this._minCellSize);
-    }
-    getNodesByAABB(minX, minY, maxX, maxY) {
-        // 创建一个射线的boundingbox
-        this._segBox.clear();
-        this._segBox.maxPosX = maxX;
-        this._segBox.maxPosY = maxY;
-        this._segBox.minPosX = minX;
-        this._segBox.minPosY = minY;
-        // 获取Boundingbox中的nodes
-        this._collisionNodesIdx.length = 0;
-        this._collisionNodes.length = 0;
-        var numNodes = this._quadTree.getNodesIntersectingtAABox(this._collisionNodesIdx, this._segBox);
-        var quadNode;
-        for (var i = 0; i < this._collisionNodesIdx.length; i++) {
-            quadNode = this._quadTree.getQuadNode(this._collisionNodesIdx[i]);
-            this._collisionNodes.push(quadNode);
-        }
-        return this._collisionNodes;
-    }
-    getTriangleAtPoint(point, threshold = 5) {
-        // 创建一个射线的boundingbox
-        this._segBox.clear();
-        this._segBox.setAABox(point.x, point.z, 1, 1);
-        this._collisionNodesIdx.length = 0;
-        this._collisionNodes.length = 0;
-        // 获取Boundingbox中的node的ID
-        var numTriangles = this._quadTree.getNodesIntersectingtAABox(this._collisionNodesIdx, this._segBox);
-        // 检查那个三角与点(x,y)相交
-        var minDistance = 0xffffffff;
-        var curDistance = 0;
-        var minTriangle;
-        var quadNode;
-        var triangle;
-        var box;
-        for (var i = 0; i < this._collisionNodesIdx.length; i++) {
-            quadNode = this._quadTree.getQuadNode(this._collisionNodesIdx[i]);
-            box = quadNode.aabb;
-            if (!Vector3.pointInsideTriangle(point, box.points[0], box.points[1], box.points[2])) {
-                continue;
-            }
-            triangle = quadNode;
-            curDistance = Math.abs(triangle.plane.distance(point));
-            if (curDistance > threshold)
-                continue;
-            if (quadNode == null || curDistance <= minDistance) {
-                minTriangle = triangle;
-                minDistance = curDistance;
-            }
-        }
-        return minTriangle;
-    }
-}

package/dist/src/core/tree/quad/QuadTree.d.ts

@@ -1,22 +0,0 @@
-import { IQuadNode } from "./IQuadNode";
-import { QuadAABB } from "./QuadAABB";
-export declare class QuadTree {
-    private _cells;
-    private _rootCell;
-    private _quadNodes;
-    private _aabb;
-    private _cellsToTest;
-    private _testID;
-    constructor();
-    getQuadNode(idx: number): IQuadNode;
-    clear(): void;
-    initNodes(nodes: Array<IQuadNode>): void;
-    buildQuadTree(maxNodesPerCell: number, minCellSize: number): void;
-    private createAABox;
-    private doesNodeIntersectCell;
-    getNodesIntersectingtAABox(result: Array<number>, aabb: QuadAABB): number;
-    private pointInTriangle;
-    private incrementTestCounter;
-    private logDeep;
-    private logTree;
-}

package/dist/src/core/tree/quad/QuadTree.js

@@ -1,250 +0,0 @@
-import { QuadAABB } from "./QuadAABB";
-import { QuadTreeCell } from "./QuadTreeCell";
-export class QuadTree {
-    constructor() {
-        this.logDeep = 0;
-        this._testID = 0;
-        this._cells = new Array();
-        this._quadNodes = new Array();
-        this._cellsToTest = new Array();
-        this._aabb = new QuadAABB();
-    }
-    getQuadNode(idx) {
-        return this._quadNodes[idx];
-    }
-    clear() {
-        this._cells.length = 0;
-        this._quadNodes.length = 0;
-    }
-    initNodes(nodes) {
-        this.clear();
-        var i = 0;
-        var count = nodes.length;
-        while (i < count) {
-            nodes[i].calcGlobalQuadAABB();
-            this._quadNodes.push(nodes[i]);
-            i++;
-        }
-    }
-    buildQuadTree(maxNodesPerCell, minCellSize) {
-        this._aabb.clear();
-        for (var node of this._quadNodes) {
-            if (node.isTriangle) {
-                for (var vt of node.aabb.points) {
-                    this._aabb.addPoint(vt);
-                }
-            }
-            else {
-                this._aabb.setContainRect(node.aabb.minPosX, node.aabb.minPosY, node.aabb.maxPosX, node.aabb.maxPosY);
-            }
-        }
-        this._cells.length = 0;
-        this._rootCell = new QuadTreeCell(this._aabb); // 创建根节点
-        this._cells.push(this._rootCell);
-        var numTriangles = this._quadNodes.length;
-        for (var i = 0; i < numTriangles; i++) {
-            this._cells[0].nodeIndices[i] = i; // 先把所有的三角面放到根节点上
-        }
-        var cellsToProcess = new Array();
-        cellsToProcess.push(0);
-        var iTri;
-        var cellIndex;
-        var childCell;
-        while (cellsToProcess.length != 0) {
-            cellIndex = cellsToProcess.pop();
-            if (this._cells[cellIndex].nodeIndices.length <= maxNodesPerCell ||
-                this._cells[cellIndex].aabb.radius < minCellSize) {
-                continue; // 该cell中还可以放三角面
-            }
-            for (i = 0; i < QuadTreeCell.NUM_CHILDREN; i++) {
-                this._cells[cellIndex].childCellIndices[i] = this._cells.length;
-                cellsToProcess.push(this._cells.length);
-                this._cells.push(new QuadTreeCell(this.createAABox(this._cells[cellIndex].aabb, i)));
-                childCell = this._cells[this._cells.length - 1];
-                // 父节点上的三角型往子节点中放
-                numTriangles = this._cells[cellIndex].nodeIndices.length;
-                var pushCount = 0;
-                for (var j = 0; j < numTriangles; j++) {
-                    iTri = this._cells[cellIndex].nodeIndices[j];
-                    if (this.doesNodeIntersectCell(this._quadNodes[iTri], childCell)) {
-                        pushCount++;
-                        childCell.nodeIndices.push(iTri);
-                    }
-                }
-            }
-            this._cells[cellIndex].nodeIndices.length = 0;
-        }
-    }
-    createAABox(aabb, id) {
-        var centerX = aabb.centreX;
-        var centerY = aabb.centreY;
-        var dimX = aabb.sideX;
-        var dimY = aabb.sideY;
-        var result = new QuadAABB();
-        switch (id) {
-            case 0: // 1象限
-                result.setAABox(centerX + dimX / 4, centerY + dimY / 4, dimX / 2, dimY / 2);
-                break;
-            case 1: // 2象限
-                result.setAABox(centerX - dimX / 4, centerY + dimY / 4, dimX / 2, dimY / 2);
-                break;
-            case 2: // 3象限
-                result.setAABox(centerX - dimX / 4, centerY - dimY / 4, dimX / 2, dimY / 2);
-                break;
-            case 3: // 4象限
-                result.setAABox(centerX + dimX / 4, centerY - dimY / 4, dimX / 2, dimY / 2);
-                break;
-            default:
-                result.setAABox(centerX + dimX / 4, centerY - dimY / 4, dimX / 2, dimY / 2);
-                break;
-        }
-        return result;
-    }
-    doesNodeIntersectCell(node, cell) {
-        // boundingbox要重叠
-        var box = node.aabb;
-        if (!box.overlapTest(cell.aabb)) {
-            return false;
-        }
-        //如果不是三角形，则只需要检测aabb的相交
-        if (!node.isTriangle)
-            return true;
-        var points = box.points;
-        var p1 = points[0];
-        var p2 = points[1];
-        var p3 = points[2];
-        if (cell.aabb.isPointInside(p1) ||
-            cell.aabb.isPointInside(p2) ||
-            cell.aabb.isPointInside(p3)) {
-            // 三角型有顶点在cell中
-            return true;
-        }
-        // cell的顶点在三角型中
-        var isIntersect = this.pointInTriangle(cell.aabb.minPosX, cell.aabb.minPosY, p1, p2, p3) ||
-            this.pointInTriangle(cell.aabb.minPosX, cell.aabb.maxPosY, p1, p2, p3) ||
-            this.pointInTriangle(cell.aabb.maxPosX, cell.aabb.maxPosY, p1, p2, p3) ||
-            this.pointInTriangle(cell.aabb.maxPosX, cell.aabb.minPosY, p1, p2, p3);
-        if (isIntersect)
-            return true;
-        // 三角形的边是否与AABB的边相交
-        isIntersect =
-            cell.aabb.isIntersectLineSegment(p1.x, p1.z, p2.x, p2.z) ||
-                cell.aabb.isIntersectLineSegment(p1.x, p1.z, p3.x, p3.z) ||
-                cell.aabb.isIntersectLineSegment(p2.x, p2.z, p3.x, p3.z);
-        return isIntersect;
-    }
-    getNodesIntersectingtAABox(result, aabb) {
-        if (this._cells.length == 0)
-            return 0;
-        this._cellsToTest.length = 0;
-        this._cellsToTest.push(0);
-        this.incrementTestCounter();
-        var cellIndex, nTris, cell;
-        var nodeBox;
-        var i = 0;
-        while (this._cellsToTest.length != 0) {
-            cellIndex = this._cellsToTest.pop();
-            cell = this._cells[cellIndex];
-            if (!aabb.overlapTest(cell.aabb)) {
-                continue;
-            }
-            if (cell.isLeaf()) {
-                nTris = cell.nodeIndices.length;
-                for (i = 0; i < nTris; i++) {
-                    nodeBox = this.getQuadNode(cell.nodeIndices[i]).aabb;
-                    if (nodeBox.testID != this._testID) {
-                        nodeBox.testID = this._testID;
-                        if (aabb.overlapTest(nodeBox)) {
-                            result.push(cell.nodeIndices[i]);
-                        }
-                    }
-                }
-            }
-            else {
-                for (i = 0; i < QuadTreeCell.NUM_CHILDREN; i++) {
-                    this._cellsToTest.push(cell.childCellIndices[i]);
-                }
-            }
-        }
-        return result.length;
-    }
-    pointInTriangle(x, y, triP1, triP2, triP3) {
-        var p1 = triP1;
-        var p2 = triP2;
-        var p3 = triP3;
-        // 直线方程p1-p2
-        var A1 = p1.z - p2.z;
-        var B1 = p2.x - p1.x;
-        var C1 = p1.x * p2.z - p2.x * p1.z;
-        // 直线方程p2-p3
-        var A2 = p2.z - p3.z;
-        var B2 = p3.x - p2.x;
-        var C2 = p2.x * p3.z - p3.x * p2.z;
-        // 直线方程p3-p1
-        var A3 = p3.z - p1.z;
-        var B3 = p1.x - p3.x;
-        var C3 = p3.x * p1.z - p1.x * p3.z;
-        var isInTri = false;
-        var D1 = A1 * x + B1 * y + C1;
-        var D2 = A2 * x + B2 * y + C2;
-        var D3 = A3 * x + B3 * y + C3;
-        const Tiny = 0.01;
-        if ((D1 >= -Tiny && D2 >= -Tiny && D3 >= -Tiny) ||
-            (D1 <= Tiny && D2 <= Tiny && D3 <= Tiny))
-            isInTri = true;
-        return isInTri;
-    }
-    incrementTestCounter() {
-        ++this._testID;
-        if (this._testID == 0) {
-            var numTriangles = this._quadNodes.length;
-            for (var i = 0; i < numTriangles; i++) {
-                this._quadNodes[i].aabb.testID = 0;
-            }
-            this._testID = 1;
-        }
-    }
-    logTree(cellIndex) {
-        if (cellIndex < 0)
-            return;
-        this.logDeep++;
-        var cell = this._cells[cellIndex];
-        var spaces = "";
-        for (var si = 0; si < this.logDeep - 1; si++)
-            spaces += "-|";
-        console.log(spaces +
-            "i=" +
-            cellIndex +
-            " " +
-            cell.aabb.minPosX.toFixed(2) +
-            " " +
-            cell.aabb.maxPosX.toFixed(2) +
-            " " +
-            cell.aabb.minPosY.toFixed(2) +
-            " " +
-            cell.aabb.maxPosY.toFixed(2));
-        var i;
-        for (i = 0; i < cell.nodeIndices.length; i++) {
-            if (cell.nodeIndices[i] >= 0) {
-                var tri = this._quadNodes[cell.nodeIndices[i]];
-                console.log(spaces +
-                    " t=" +
-                    cell.nodeIndices[i] +
-                    " " +
-                    tri.aabb.minPosX.toFixed(2) +
-                    " " +
-                    tri.aabb.maxPosX.toFixed(2) +
-                    " " +
-                    tri.aabb.minPosY.toFixed(2) +
-                    " " +
-                    tri.aabb.maxPosY.toFixed(2));
-            }
-        }
-        for (i = 0; i < cell.childCellIndices.length; i++) {
-            if (cell.childCellIndices[i] >= 0) {
-                this.logTree(cell.childCellIndices[i]);
-            }
-        }
-        this.logDeep--;
-    }
-}

package/dist/src/core/tree/quad/QuadTreeCell.d.ts

@@ -1,23 +0,0 @@
-import { Vector3 } from "../../../math/Vector3";
-import { QuadAABB } from "./QuadAABB";
-/**
- * 四叉树节点单元类
- * 用于构建四叉树空间索引结构的基本单元
- */
-export declare class QuadTreeCell {
-    static NUM_CHILDREN: number;
-    childCellIndices: Array<number>;
-    nodeIndices: Array<number>;
-    aabb: QuadAABB;
-    points: Array<Vector3>;
-    constructor(aabox: QuadAABB);
-    /**
-     * 判断是否为叶节点
-     * @returns 如果是叶节点（不包含子节点）返回true
-     *
-     * @注 叶节点意味着当前节点包含实际对象数据，
-     * 而非叶节点则应该包含子节点（可能同时包含对象数据）
-     */
-    isLeaf(): boolean;
-    clear(): void;
-}

package/dist/src/core/tree/quad/QuadTreeCell.js

@@ -1,36 +0,0 @@
-import { QuadAABB } from "./QuadAABB";
-/**
- * 四叉树节点单元类
- * 用于构建四叉树空间索引结构的基本单元
- */
-export class QuadTreeCell {
-    static { this.NUM_CHILDREN = 4; } // 子节点数量常量（四叉树固定为4）
-    constructor(aabox) {
-        this.childCellIndices = new Array();
-        this.childCellIndices.length = QuadTreeCell.NUM_CHILDREN;
-        this.nodeIndices = new Array();
-        this.clear();
-        if (aabox) {
-            this.aabb = aabox.clone();
-        }
-        else {
-            this.aabb = new QuadAABB();
-        }
-    }
-    /**
-     * 判断是否为叶节点
-     * @returns 如果是叶节点（不包含子节点）返回true
-     *
-     * @注 叶节点意味着当前节点包含实际对象数据，
-     * 而非叶节点则应该包含子节点（可能同时包含对象数据）
-     */
-    isLeaf() {
-        return this.childCellIndices[0] == -1;
-    }
-    clear() {
-        for (var i = 0; i < QuadTreeCell.NUM_CHILDREN; i++) {
-            this.childCellIndices[i] = -1;
-        }
-        this.nodeIndices.splice(0, this.nodeIndices.length);
-    }
-}

package/dist/src/event/CEvent.d.ts

@@ -1,27 +0,0 @@
-import { View3D } from "../core/View3D";
-import { Object3D } from "../core/entities/Object3D";
-import { TouchData } from "../io/TouchData";
-import { CEventListener } from "./CEventListener";
-export declare class CEvent {
-    target: Object3D;
-    currentTarget: CEventListener;
-    type: string | null;
-    data?: any;
-    param: any;
-    time: number;
-    delay: number;
-    mouseCode: number;
-    ctrlKey: boolean;
-    metaKey: boolean;
-    altKey: boolean;
-    shiftKey: boolean;
-    targetTouches: Array<TouchData>;
-    changedTouches: Array<TouchData>;
-    touches: Array<TouchData>;
-    private _stopImmediatePropagation;
-    view: View3D;
-    constructor(eventType?: string | null, data?: any);
-    stopImmediatePropagation(): void;
-    reset(): void;
-    get isStopImmediatePropagation(): boolean;
-}

package/dist/src/event/CEvent.js

@@ -1,19 +0,0 @@
-export class CEvent {
-    constructor(eventType = null, data = null) {
-        this.time = 0;
-        this.delay = 0;
-        this.mouseCode = 0;
-        this._stopImmediatePropagation = false;
-        this.type = eventType;
-        this.data = data;
-    }
-    stopImmediatePropagation() {
-        this._stopImmediatePropagation = true;
-    }
-    reset() {
-        this._stopImmediatePropagation = false;
-    }
-    get isStopImmediatePropagation() {
-        return this._stopImmediatePropagation;
-    }
-}

package/dist/src/event/CEventDispatcher.d.ts

@@ -1,13 +0,0 @@
-import { CEvent } from "./CEvent";
-export declare class CEventDispatcher {
-    protected listeners: any;
-    data: any;
-    dispatchEvent(event: CEvent): void;
-    destroy(): void;
-    addEventListener(type: string | number, callback: Function, thisObject: any, param?: any, priority?: number): number;
-    removeEventListener(type: string | number, callback: Function, thisObject: any): void;
-    removeEventListenerAt(id: number): boolean;
-    removeAllEventListener(eventType?: string | number | null): void;
-    containEventListener(type: string): boolean;
-    hasEventListener(type: string | number, callback?: Function | null, thisObject?: any): boolean;
-}