C# 클래스 UQtAlgo, uquadtree

파일 보기 프로젝트 열기: mc-gulu/uquadtree 1 사용 예제들

공개 메소드들

메소드	설명
BuildRecursively ( UQtNode, node ) : void
FindLeafRecursively ( UQtNode, node, Vector2 point ) : UQtLeaf,
GenerateSwappingLeaves ( UQtNode, node, UQtLeaf, active, List holdingLeaves, List &inLeaves, List &outLeaves ) : void
Intersects ( Rect nodeBound, IQtUserData userData ) : bool
Intersects ( Rect nodeBound, Vector2 targetCenter, float targetRadius ) : bool
TraverseAllLeaves ( UQtNode, node, UQtForeachLeaf func ) : void

비공개 메소드들

메소드	설명
GenerateLeavesByDist ( UQtNode, node, UQtLeaf, active, float dist, List &leaves ) : void

메소드 상세

BuildRecursively() 공개 정적인 메소드

public static BuildRecursively ( UQtNode, node ) : void
node	UQtNode,
리턴	void

FindLeafRecursively() 공개 정적인 메소드

public static FindLeafRecursively ( UQtNode, node, Vector2 point ) : UQtLeaf,
node	UQtNode,
point	Vector2
리턴	UQtLeaf,

GenerateSwappingLeaves() 공개 정적인 메소드

public static GenerateSwappingLeaves ( UQtNode, node, UQtLeaf, active, List holdingLeaves, List &inLeaves, List &outLeaves ) : void
node	UQtNode,
active	UQtLeaf,
holdingLeaves	List
inLeaves	List
outLeaves	List
리턴	void

Intersects() 공개 정적인 메소드

public static Intersects ( Rect nodeBound, IQtUserData userData ) : bool
nodeBound	Rect
userData	IQtUserData
리턴	bool

Intersects() 공개 정적인 메소드

public static Intersects ( Rect nodeBound, Vector2 targetCenter, float targetRadius ) : bool
nodeBound	Rect
targetCenter	Vector2
targetRadius	float
리턴	bool

TraverseAllLeaves() 공개 정적인 메소드

public static TraverseAllLeaves ( UQtNode, node, UQtForeachLeaf func ) : void
node	UQtNode,
func	UQtForeachLeaf
리턴	void