DepthSortList Class Reference#include <depthSortList.h>
Inheritance diagram for DepthSortList:
[legend]List of all members.
|
Public Types |
| typedef Vector< PolyExtents > | PolyExtentsList |
| typedef Vector< U32 > | PolyIndexList |
Public Member Functions |
| void | setBase (S32) |
| bool | splitPoly (const Poly &sourcePoly, Point3F &normal, F32 k, Poly &front, Poly &back) |
| bool | overlap (Poly *, Poly *) |
| void | handleOverlap (Poly *testPoly, Point3F &testNormal, F32 testDot, S32 &testOffset, bool &switched) |
| void | sortByYExtents () |
| void | setExtents (Poly &, PolyExtents &) |
| bool | sortNext () |
| void | cookieCutter (Poly &cutter, Poly &cuttee, Vector< Poly > &scraps, Vector< Poly > &cookies, Vector< Point3F > &cookieVerts) |
| | DepthSortList () |
| | ~DepthSortList () |
| void | set (const MatrixF &mat, Point3F &extents) |
| void | clear () |
| void | clearSort () |
| void | sort () |
| void | depthPartition (const Point3F *sourceVerts, U32 numVerts, Vector< Poly > &partition, Vector< Point3F > &partitionVerts) |
| void | end () |
| | Mark the end of a surface.
|
| bool | getMapping (MatrixF *, Box3F *) |
| | Return list transform and bounds in list space.
|
| void | getOrderedPoly (U32 ith, Poly **poly, PolyExtents **polyExtent) |
| PolyExtents & | getExtents (U32 idx) |
| Poly & | getPoly (U32 idx) |
Public Attributes |
| PolyExtentsList | mPolyExtentsList |
| PolyIndexList | mPolyIndexList |
| Point3F | mExtent |
| S32 | mBase |
| Poly * | mBasePoly |
| Point3F * | mBaseNormal |
| F32 | mBaseDot |
| F32 | mBaseYMax |
| S32 | mMaxTouched |
| PolyExtents * | mBaseExtents |
Private Types |
| typedef ClippedPolyList | Parent |
Classes |
| struct | PolyExtents |
Member Typedef Documentation
Constructor & Destructor Documentation
| DepthSortList::DepthSortList |
( |
|
) |
|
| DepthSortList::~DepthSortList |
( |
|
) |
|
Member Function Documentation
| void DepthSortList::setBase |
( |
S32 |
|
) |
|
| bool DepthSortList::splitPoly |
( |
const Poly & |
sourcePoly, |
|
|
Point3F & |
normal, |
|
|
F32 |
k, |
|
|
Poly & |
front, |
|
|
Poly & |
back | |
|
) |
| | |
| bool DepthSortList::overlap |
( |
Poly * |
, |
|
|
Poly * |
| |
|
) |
| | |
| void DepthSortList::handleOverlap |
( |
Poly * |
testPoly, |
|
|
Point3F & |
testNormal, |
|
|
F32 |
testDot, |
|
|
S32 & |
testOffset, |
|
|
bool & |
switched | |
|
) |
| | |
| void DepthSortList::sortByYExtents |
( |
|
) |
|
| bool DepthSortList::sortNext |
( |
|
) |
|
| void DepthSortList::cookieCutter |
( |
Poly & |
cutter, |
|
|
Poly & |
cuttee, |
|
|
Vector< Poly > & |
scraps, |
|
|
Vector< Poly > & |
cookies, |
|
|
Vector< Point3F > & |
cookieVerts | |
|
) |
| | |
| void DepthSortList::clear |
( |
|
) |
|
| void DepthSortList::clearSort |
( |
|
) |
|
| void DepthSortList::sort |
( |
|
) |
|
| void DepthSortList::end |
( |
|
) |
[virtual] |
Return list transform and bounds in list space.
- Returns:
- False if no data is available.
Reimplemented from AbstractPolyList.
| void DepthSortList::getOrderedPoly |
( |
U32 |
ith, |
|
|
Poly ** |
poly, |
|
|
PolyExtents ** |
polyExtent | |
|
) |
| | [inline] |
| Poly& DepthSortList::getPoly |
( |
U32 |
idx |
) |
[inline] |
Member Data Documentation
|