C++ (Cpp) BNode::Draw 예제들

예제 #1

파일: BSPnodes.cpp 프로젝트: FreeFalcon/freefalcon-contrib

//JAM 06Jan04
void BSubTree::Draw(void)
{
	BNode *child;

	TheStateStack.pCoords=pCoords;					// SAVES POOLS
	TheStateStack.pNormals=pNormals;				// SAVES POOLS

	if(SubTreeCount) NodeCount++;									// Node Counter;
	SubTreeCount=true;
	
	CV->AddShaderNormals(nNormals);

/*	TheStateStack.Light(pNormals,nNormals,pCoords); //- COBRA - RED - Call only if Normals available

	if(nDynamicCoords == 0)
		TheStateStack.Transform(pCoords,nCoords);
	else
	{
		TheStateStack.Transform(pCoords,nCoords-nDynamicCoords);
		TheStateStack.Transform(TheStateStack.CurrentInstance->DynamicCoords+DynamicCoordOffset,nDynamicCoords);
	}*/

	child = subTree;
//	ShiAssert(FALSE == F4IsBadReadPtr( child, sizeof*child) );

	do
	{
		child->Draw();
		child = child->sibling;
	}
	while(child); // JB 010306 CTD
}

예제 #2

파일: BSPnodes.cpp 프로젝트: FreeFalcon/freefalcon-contrib

void BSplitterNode::Draw(void)
{
	BNode	*child;

	ShiAssert( front );
	ShiAssert( back );
	NodeCount++;									// Node Counter;

/*	if (A*TheStateStack.ObjSpaceEye.x + 
		B*TheStateStack.ObjSpaceEye.y + 
		C*TheStateStack.ObjSpaceEye.z + D > 0.0f) {
*/
	if((int)front!=-1){
		child = front;
		do
		{
			child->Draw();
			child = child->sibling;
		} while (child);
	}

	if((int)back!=-1){
		child = back;
		do
		{
			child->Draw();
			child = child->sibling;
		} while (child);
	}
/*	}
	else
	{
		child = back;
		do
		{
			child->Draw();
			child = child->sibling;
		} while (child);

		child = front;
		do
		{
			child->Draw();
			child = child->sibling;
		} while (child);
	}*/
}

예제 #3

파일: bspnodes.cpp 프로젝트: aoighost/freefalcon-central

void BSplitterNode::Draw(void)
{
    BNode	*child;

    ShiAssert( front );
    ShiAssert( back );

    if (A*TheStateStack.ObjSpaceEye.x +
            B*TheStateStack.ObjSpaceEye.y +
            C*TheStateStack.ObjSpaceEye.z + D > 0.0f) {

        child = front;
        do
        {
            child->Draw();
            child = child->sibling;
        } while (child);

        child = back;
        do
        {
            child->Draw();
            child = child->sibling;
        } while (child);
    }
    else
    {
        child = back;
        do
        {
            child->Draw();
            child = child->sibling;
        } while (child);

        child = front;
        do
        {
            child->Draw();
            child = child->sibling;
        } while (child);
    }
}

예제 #4

파일: bspnodes.cpp 프로젝트: aoighost/freefalcon-central

//JAM 06Jan04
void BSubTree::Draw(void)
{
    BNode *child;

    if(nNormals) TheStateStack.Light(pNormals,nNormals,pCoords); //- COBRA - RED - Call only if Normals available

    if(nDynamicCoords == 0)
        TheStateStack.Transform(pCoords,nCoords);
    else
    {
        TheStateStack.Transform(pCoords,nCoords-nDynamicCoords);
        TheStateStack.Transform(TheStateStack.CurrentInstance->DynamicCoords+DynamicCoordOffset,nDynamicCoords);
    }

    child = subTree;
    ShiAssert(FALSE == F4IsBadReadPtr( child, sizeof*child) );

    do
    {
        child->Draw();
        child = child->sibling;
    }
    while(child); // JB 010306 CTD
}