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 IList GetIntersectingObjects(float[] r,
CollisionQuery query)
{
lock (cacheSet)
{
CollectionUtils.Clear(cacheSet);
GetIntersectingObjects(r, query, cacheSet, this.bspTree);
List <Actor> result = new List <Actor>(cacheSet.Count);
for (IEnumerator it = cacheSet.GetEnumerator(); it.MoveNext();)
{
result.Add((Actor)it.Current);
}
return(result);
}
}
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 Actor CheckForOnlyCollision(Actor ignore,
BSPCollisionNode node, CollisionQuery query)
{
if (node == null)
{
return(null);
}
IIterator i = node.GetActorsIterator();
Actor candidate;
do
{
if (!i.HasNext())
{
return(null);
}
candidate = (Actor)i.Next();
} while (ignore == candidate || !query.CheckCollision(candidate));
return(candidate);
}
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 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 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 CheckForOnlyCollision(Actor ignore,
BSPCollisionNode node, CollisionQuery query)
{
if (node == null)
{
return null;
}
IIterator i = node.GetActorsIterator();
Actor candidate;
do
{
if (!i.HasNext())
{
return null;
}
candidate = (Actor)i.Next();
} while (ignore == candidate || !query.CheckCollision(candidate));
return candidate;
}
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.Debugging.Log.Exception(ex);
}
}
}
private void IntersectingObjects(float[] r, CollisionQuery query,
ISet set)
{
this.GetIntersectingObjects(r, query, set, this.bspTree);
}
private IList GetIntersectingObjects(float[] r,
CollisionQuery query)
{
lock (cacheSet)
{
CollectionUtils.Clear(cacheSet);
GetIntersectingObjects(r, query, cacheSet, this.bspTree);
List<Actor> result = new List<Actor>(cacheSet.Count);
for (IEnumerator it = cacheSet.GetEnumerator(); it.MoveNext(); )
{
result.Add((Actor)it.Current);
}
return result;
}
}
private void IntersectingObjects(float[] r, CollisionQuery query,
ISet set)
{
this.GetIntersectingObjects(r, query, set, this.bspTree);
}
public CollisionClassQuery(Type c, CollisionQuery s) {
this.cls = c;
this.subQuery = s;
}
public CollisionClassQuery(Type c, CollisionQuery s)
{
this.cls = c;
this.subQuery = s;
}
