本文整理汇总了C#中QuadTree.Equals方法的典型用法代码示例。如果您正苦于以下问题：C# QuadTree.Equals方法的具体用法？C# QuadTree.Equals怎么用？C# QuadTree.Equals使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类QuadTree的用法示例。
在下文中一共展示了QuadTree.Equals方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: getObjectsColliding
private void getObjectsColliding(Rectangle bounds, QuadTree<Object.Object>.QuadNode currentNode, List<Object.Object> result, List<SearchFlags.Searchflag> _SearchFlags)
{
if (Utility.Collision.Intersection.RectangleIsInRectangle(bounds, currentNode.Bounds))
{
//Circle fits in node, so search in subnodes
Boolean circleFitsInSubnode = false;
foreach (QuadTree<Object.Object>.QuadNode node in currentNode.Nodes)
{
if (node != null)
{
if (Utility.Collision.Intersection.RectangleIsInRectangle(bounds, node.Bounds))
{
circleFitsInSubnode = true;
getObjectsInRange(bounds, node, result, _SearchFlags);
}
}
}
//Aggrocircle fit into a subnode? then
if (!circleFitsInSubnode)
{
addAllObjectsInRange(currentNode, bounds, result, _SearchFlags);
}
return;
}
if (currentNode.Equals(this.quadTreeObject.Root))
{
addAllObjectsInRange(currentNode, bounds, result, _SearchFlags);
}
}示例2: getObjectsInRange
private void getObjectsInRange(Rectangle bounds, QuadTree<Object.Object>.QuadNode currentNode, List<Object.Object> result, List<SearchFlags.Searchflag> _SearchFlags)
{
if (Utility.Collision.Intersection.RectangleIsInRectangle(bounds, currentNode.Bounds))
{
System.Collections.ObjectModel.ReadOnlyCollection<QuadTree<Object.Object>.QuadNode> var_Copy = new System.Collections.ObjectModel.ReadOnlyCollection<QuadTree<Object.Object>.QuadNode>(currentNode.Nodes);
foreach (QuadTree<Object.Object>.QuadNode node in var_Copy)
{
if (node != null)
{
if (Utility.Collision.Intersection.RectangleIsInRectangle(bounds, node.Bounds))
{
getObjectsInRange(bounds, node, result, _SearchFlags);
}
}
}
//Aggrocircle fit into a subnode? then
addAllObjectsInRange(currentNode, bounds, result, _SearchFlags);
return;
}
if (currentNode.Equals(this.quadTreeObject.Root))
{
addAllObjectsInRange(currentNode, bounds, result, _SearchFlags);
}
}