本文整理汇总了C#中ICollidable.IsContained方法的典型用法代码示例。如果您正苦于以下问题：C# ICollidable.IsContained方法的具体用法？C# ICollidable.IsContained怎么用？C# ICollidable.IsContained使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类ICollidable的用法示例。
在下文中一共展示了ICollidable.IsContained方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: SubCollided
/// Return all components are collided with specified components
/// </summary>
/// <param name="cp">Component to check collide</param>
/// <returns>
/// This collision detect with sub-nodes only
/// </returns>
public List<ICollidable> SubCollided(ICollidable cp, List<ICollidable> collided)
{
//list of component found
foreach (CollisionQuadTreeNode node in this.SubNodes)
{
if (node.IsEmpty)
continue;
//Case 1: if cp completely be contained in sub-node
//Go down checking
if (cp.IsContained(node.Bound))
{
collided.AddRange(node.SubCollided(cp, collided));
break;
}
//Case 2: if cp intersect with sub-node
//Check in this node and continue search with other nodes
if (cp.Intersects(node.Bound))
{
foreach (ICollidable ccp in node.NodeContents)
{
if (cp.Collide(ccp) || (ccp.Collide(cp)))
collided.Add(ccp);
}
collided.AddRange(node.SubCollided(cp, collided));
}
}
return collided;
}示例2: Insert
/// <summary>
/// Insert a Collidable component to quad tree node
/// including sub-nodes
/// </summary>
/// <param name="cp">Component to insert</param>
public bool Insert(ICollidable cp)
{
if (!cp.IsContained(this.Bound))
return false;
//if sub-node are null: create them
if ((this.NodeContents.Count > 0) && (this.SubNodes.Count == 0))
{
this.CreateSubNodes();
ICollidable collideable = this.NodeContents[0];
this.NodeContents.Clear();
this.Insert(collideable);
}
//if component is contained by one of sub-nodes, add
//component to that sub-node
foreach (CollisionQuadTreeNode node in this.SubNodes)
{
if (cp.IsContained(node.Bound))
{
return node.Insert(cp);
}
}
//otherwise, if no sub-node are completely contain component
//or there's the smallest node
//add component to this node
this.NodeContents.Add(cp);
return true;
}