Пример #1
0
 public virtual IIterator GetActorsIterator()
 {
     if (bspTree != null)
     {
         return(bspTree.GetActorsIterator());
     }
     return(null);
 }
Пример #2
0
 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);
         }
     }
 }
Пример #3
0
 public virtual IList GetObjects(Type cls)
 {
     lock (cacheSet)
     {
         CollectionUtils.Clear(cacheSet);
     }
     lock (cacheNodeStack)
     {
         if (this.bspTree != null)
         {
             CollectionUtils.Add(cacheNodeStack, this.bspTree);
         }
         for (; !(cacheNodeStack.Count == 0);)
         {
             BSPCollisionNode node = (BSPCollisionNode)cacheNodeStack
                                     .RemoveLast();
             IIterator i = node.GetActorsIterator();
             while (i.HasNext())
             {
                 Actor left = (Actor)i.Next();
                 if (cls == null || cls.IsInstanceOfType(left))
                 {
                     CollectionUtils.Add(cacheSet, left);
                 }
             }
             BSPCollisionNode left1 = node.GetLeft();
             BSPCollisionNode right = node.GetRight();
             if (left1 != null)
             {
                 CollectionUtils.Add(cacheNodeStack, left1);
             }
             if (right != null)
             {
                 CollectionUtils.Add(cacheNodeStack, right);
             }
         }
         List <Actor> result = new List <Actor>(cacheSet.Count);
         for (IEnumerator it = cacheSet.GetEnumerator(); it.MoveNext();)
         {
             result.Add((Actor)it.Current);
         }
         return(result);
     }
 }
Пример #4
0
        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);
        }