private void GetIntersectingObjects(float[] r, CollisionQuery query, ISet resultSet, BSPCollisionNode startNode) { lock (cacheNodeStack) { cacheNodeStack.Clear(); try { if (startNode != null) { CollectionUtils.Add(cacheNodeStack, startNode); } int idx = 0; for (; !(cacheNodeStack.Count == 0) && idx < MAX_SIZE;) { BSPCollisionNode node = (BSPCollisionNode)cacheNodeStack .RemoveLast(); lock (node) { if (node.GetArea().Intersects(r[0], r[1], r[2], r[3])) { IIterator i = node.GetActorsIterator(); for (; i.HasNext();) { Actor left = (Actor)i.Next(); if (query.CheckCollision(left) && !CollectionUtils.Contains(left, resultSet)) { CollectionUtils.Add(resultSet, left); } } BSPCollisionNode left1 = node.GetLeft(); BSPCollisionNode right = node.GetRight(); if (left1 != null) { CollectionUtils.Add(cacheNodeStack, left1); } if (right != null) { CollectionUtils.Add(cacheNodeStack, right); } } } idx++; } } catch (Exception ex) { Loon.Utils.Debug.Log.Exception(ex); } } }
public Actor GetOnlyIntersectingUp(RectBox r, CollisionQuery query, Actor actor, BSPCollisionNode start) { for (; start != null && !start.GetArea().Contains(r);) { Actor res = this.CheckForOnlyCollision(actor, start, query); if (res != null) { return(res); } start = start.GetParent(); } return(null); }
private Actor GetOnlyObjectDownTree(Actor ignore, RectBox r, CollisionQuery query, BSPCollisionNode startNode) { if (startNode == null) { return(null); } else { lock (cacheNodeStack) { cacheNodeStack.Clear(); if (startNode != null) { CollectionUtils.Add(cacheNodeStack, startNode); } while (!(cacheNodeStack.Count == 0)) { BSPCollisionNode node = (BSPCollisionNode)cacheNodeStack .RemoveLast(); if (node.GetArea().Intersects(r)) { Actor res = this.CheckForOnlyCollision(ignore, node, query); if (res != null) { return(res); } BSPCollisionNode left = node.GetLeft(); BSPCollisionNode right = node.GetRight(); if (left != null) { CollectionUtils.Add(cacheNodeStack, left); } if (right != null) { CollectionUtils.Add(cacheNodeStack, right); } } } } return(null); } }
private Actor GetOnlyIntersectingDown(RectBox r, CollisionQuery query, Actor actor) { if (this.bspTree == null) { return(null); } else { lock (cacheNodeStack) { cacheNodeStack.Clear(); CollectionUtils.Add(cacheNodeStack, this.bspTree); int idx = 0; for (; !(cacheNodeStack.Count == 0) && idx < MAX_SIZE;) { BSPCollisionNode node = (BSPCollisionNode)cacheNodeStack .RemoveLast(); if (node.GetArea().Contains(r)) { Actor res = this.CheckForOnlyCollision(actor, node, query); if (res != null) { return(res); } BSPCollisionNode left = node.GetLeft(); BSPCollisionNode right = node.GetRight(); if (left != null) { CollectionUtils.Add(cacheNodeStack, left); } if (right != null) { CollectionUtils.Add(cacheNodeStack, right); } } } } return(null); } }
private BSPCollisionNode CheckRemoveNode(BSPCollisionNode node) { int idx = 0; for (; idx < MAX_SIZE;) { if (node != null && node.IsEmpty()) { BSPCollisionNode parent = node.GetParent(); int side = (parent != null) ? parent.GetChildSide(node) : 3; BSPCollisionNode left = node.GetLeft(); BSPCollisionNode right = node.GetRight(); if (left == null) { if (parent != null) { if (right != null) { right.SetArea(node.GetArea()); } parent.SetChild(side, right); } else { this.bspTree = right; if (right != null) { right.SetParent((BSPCollisionNode)null); } } node.SetChild(1, (BSPCollisionNode)null); ReturnNode(node); node = parent; continue; } if (right == null) { if (parent != null) { if (left != null) { left.SetArea(node.GetArea()); } parent.SetChild(side, left); } else { this.bspTree = left; if (left != null) { left.SetParent((BSPCollisionNode)null); } } node.SetChild(0, (BSPCollisionNode)null); ReturnNode(node); node = parent; continue; } } idx++; return(node); } return(null); }