osg::SplitGraphOp Class Reference
[Rendering Backend, Geometry]

#include <OSGSplitGraphOp.h>

Inheritance diagram for osg::SplitGraphOp:

List of all members.

Public Member Functions
Constructors
	SplitGraphOp (const char *name="Split", UInt16 max_polygons=1000)
GraphOp *	create ()
Destructors
virtual	~SplitGraphOp (void)
Main methods
bool	traverse (NodePtr &root)
Parameters
void	setParams (const std::string params)
void	setMaxPolygons (UInt16 max_polygons)
std::string	usage (void)
Main methods
const std::string &	getName (void)
void	setName (const char *name)
Exclusion
void	addToExcludeList (NodePtr &node)
void	addToExcludeList (const std::string &name)
void	removeFromExcludeList (NodePtr &node)
void	removeFromExcludeList (const std::string &name)
void	clearExcludeList (void)
bool	isInExcludeListNodes (NodePtr &node)
bool	isInExcludeListNames (const std::string &name)
bool	isInExcludeList (NodePtr &node)
Static Public Member Functions
Class Get
static const char *	getClassname (void)
Protected Attributes
std::list< NodePtr >	_excludeListNodes
std::list< std::string >	_excludeListNames
Private Member Functions
bool	isLeaf (NodePtr &node)
bool	isGroup (NodePtr &node)
bool	splitNode (NodePtr &node, std::vector< NodePtr > &split)
Action::ResultE	traverseEnter (NodePtr &node)
Action::ResultE	traverseLeave (NodePtr &node, Action::ResultE res)
Private Attributes
UInt16	_max_polygons

---

Detailed Description

SplitGraphOp class

A class used to optimize geometries a bit.

Definition at line 57 of file OSGSplitGraphOp.h.

---

Constructor & Destructor Documentation

SplitGraphOp::SplitGraphOp	(	const char *	name = "Split",
		UInt16	max_polygons = 1000
	)

Definition at line 81 of file OSGSplitGraphOp.cpp.

Referenced by create().

                                                               : 
    GraphOp(name), _max_polygons(max_polygons)
{
}

SplitGraphOp::~SplitGraphOp

(

void

)

[virtual]

Definition at line 86 of file OSGSplitGraphOp.cpp.

{
}

---

Member Function Documentation

static const char* osg::SplitGraphOp::getClassname

(

void

)

[inline, static]

Reimplemented from osg::GraphOp.

Definition at line 66 of file OSGSplitGraphOp.h.

{ return "SplitGraphOp"; };

GraphOp * SplitGraphOp::create

(

void

)

[virtual]

Implements osg::GraphOp.

Definition at line 90 of file OSGSplitGraphOp.cpp.

References SplitGraphOp().

{
    SplitGraphOp * inst = new SplitGraphOp();
    return inst;
}

bool SplitGraphOp::traverse

(

NodePtr &

root

)

[virtual]

Reimplemented from osg::GraphOp.

Definition at line 96 of file OSGSplitGraphOp.cpp.

References osg::beginEditCP(), osg::GroupBase::create(), osg::endEditCP(), osg::NodePtr::getCore(), isLeaf(), osg::makeNodeFor(), and osg::traverse().

{
    // If the root node is not a Group, make it one
    if (isLeaf(root))
    {
        NodePtr n = makeNodeFor(root->getCore());
        
        beginEditCP(root);
        root->setCore(Group::create());
        root->addChild(n);
        endEditCP(root);
    }  
    
    return GraphOp::traverse(root);
}

void SplitGraphOp::setParams

(

const std::string

params

)

[virtual]

Implements osg::GraphOp.

Definition at line 112 of file OSGSplitGraphOp.cpp.

References _max_polygons, FWARNING, and osg::GraphOp::ParamSet::getUnusedParams().

{
    ParamSet ps(params);   
    
    ps("max_polygons", _max_polygons);
    
    std::string out = ps.getUnusedParams();
    if(out.length())
    {
        FWARNING(("SplitGraphOp doesn't have parameters '%s'.\n",
                out.c_str()));
    }
}

void SplitGraphOp::setMaxPolygons

(

UInt16

max_polygons

)

Definition at line 134 of file OSGSplitGraphOp.cpp.

References _max_polygons.

{
    _max_polygons = max_polygons;
}

std::string SplitGraphOp::usage

(

void

)

[virtual]

Implements osg::GraphOp.

Definition at line 126 of file OSGSplitGraphOp.cpp.

{
    return 
    "Split: Split large geometries into smaller ones\n"
    "Params: name (type, default)\n"
    "  max_polygons (UInt32, 1000): maximum number of polygons allowed per Geo\n";
}

bool SplitGraphOp::isLeaf

(

NodePtr &

node

)

[private]

Definition at line 750 of file OSGSplitGraphOp.cpp.

Referenced by splitNode(), traverse(), traverseEnter(), and traverseLeave().

{
    if (node->getMFChildren()->getValues().begin()==
        node->getMFChildren()->getValues().end()) return true;
    else return false;    
}

bool SplitGraphOp::isGroup

(

NodePtr &

node

)

[private]

checks whether a node is a group and nothing else

Definition at line 759 of file OSGSplitGraphOp.cpp.

References osg::BillboardBase::getClassType(), osg::DistanceLODBase::getClassType(), osg::MaterialGroupBase::getClassType(), osg::SwitchBase::getClassType(), osg::ComponentTransformBase::getClassType(), osg::TransformBase::getClassType(), osg::GroupBase::getClassType(), osg::NodePtr::getCore(), osg::NodeCore::getType(), and osg::FieldContainerType::isDerivedFrom().

{
    if(  node->getCore()->getType().isDerivedFrom( Group::getClassType()              ) &&
        !node->getCore()->getType().isDerivedFrom( Transform::getClassType()          ) &&
        !node->getCore()->getType().isDerivedFrom( ComponentTransform::getClassType() ) &&
        !node->getCore()->getType().isDerivedFrom( Switch::getClassType()             ) &&
        !node->getCore()->getType().isDerivedFrom( MaterialGroup::getClassType()      ) &&
        !node->getCore()->getType().isDerivedFrom( DistanceLOD::getClassType()        ) &&
        !node->getCore()->getType().isDerivedFrom( Billboard::getClassType()          )) 
        return true;
    else return false;
}

bool SplitGraphOp::splitNode	(	NodePtr &	node,
		std::vector< NodePtr > &	split
	)			[private]

Definition at line 321 of file OSGSplitGraphOp.cpp.

References _max_polygons, addPoints, osg::beginEditCP(), osg::Node::CoreFieldMask, osg::Node::create(), osg::GeometryBase::create(), osg::FCPtr< BasePtrTypeT, FieldContainerTypeT >::dcast(), osg::AttachmentContainerPtr::dcast(), osg::endEditCP(), osg::GeometryBase::getClassType(), osg::NodePtr::getCore(), osg::PrimitiveIterator::getLength(), osg::PrimitiveIterator::getPosition(), osg::PrimitiveIterator::getType(), osg::NodeCore::getType(), osg::PrimitiveIterator::isAtEnd(), osg::FieldContainerType::isDerivedFrom(), osg::GraphOp::isInExcludeList(), isLeaf(), osg::NullFC, osg::PrimitiveIterator::setToBegin(), setupAttr, and SWARNING.

Referenced by traverseLeave().

{
    //split it only if it is a non special geometry leaf
    if (!isLeaf(node) || isInExcludeList(node) ||
        !node->getCore()->getType().isDerivedFrom(Geometry::getClassType())) return false;

    GeometryPtr geo = GeometryPtr::dcast(node->getCore());

    if ( geo->getPositions() == NullFC || geo->getPositions()->size() == 0 ||
         geo->getLengths()   == NullFC || geo->getLengths()->size() == 0 ||
         geo->getTypes()     == NullFC || geo->getTypes()->size() == 0 ) return false;

    //get all center points
    std::vector<Pnt3f> centers;
    int ind;

    PrimitiveIterator it(geo);

    while (!it.isAtEnd())
    {
        switch(it.getType())
        {
        case GL_POINTS:
        case GL_LINES:
        case GL_LINE_STRIP:
        case GL_LINE_LOOP:
        case GL_TRIANGLE_FAN:
        case GL_TRIANGLE_STRIP:
        case GL_QUAD_STRIP:
        case GL_POLYGON:
            {
                Pnt3f center(0,0,0);
                for (UInt32 i=0; i<it.getLength(); i++)
                    center+=(Vec3f)it.getPosition(i);
                center/=Real32(it.getLength());
                centers.push_back(center);                
            } 
            break;
            
        case GL_TRIANGLES:
            ind=0;
            while(it.getLength()-ind>=3)
            {
                Pnt3f center(0,0,0);
                for (UInt32 i=0; i<3; i++, ind++)
                    center+=(Vec3f)it.getPosition(ind);
                center/=3;
                centers.push_back(center);
            } 
            break;
            
        case GL_QUADS:
            ind=0;
            while(it.getLength()-ind>=4)
            {
                Pnt3f center(0,0,0);
                for (UInt32 i=0; i<4; i++, ind++)
                    center+=(Vec3f)it.getPosition(ind);
                center/=4;
                centers.push_back(center);
            } 
            break;

            
        default:
            SWARNING << "SplitGraphOp::splitLeave: encountered " 
                     << "unknown primitive type " 
                     << it.getType()
                     << ", ignoring!" << std::endl;
            break;
        }   
        
        ++it;        
    }    
    
    std::vector<int> order;    
    for (UInt32 i=0; i<centers.size(); i++)
        order.push_back(i);

    Pnt3fComparator comp(centers);
    std::sort(order.begin(), order.end(), comp);

    //now we need (centers.size()/_max_polygons) amount of new geometries
    int ngeos=int(ceil((double)centers.size()/(double)_max_polygons));

    if (ngeos<=1) return false;

    GeometryPtr       *geos    = new GeometryPtr[ngeos];
    GeoPTypesPtr      *types   = new GeoPTypesPtr[ngeos];
    GeoPLengthsPtr    *lens    = new GeoPLengthsPtr[ngeos];
    GeoPositionsPtr   *pnts    = new GeoPositionsPtr[ngeos];
    GeoNormalsPtr     *normals = new GeoNormalsPtr[ngeos];
    GeoColorsPtr      *colors  = new GeoColorsPtr[ngeos];
    GeoColorsPtr      *scolors = new GeoColorsPtr[ngeos];
    GeoTexCoordsPtr   *tex     = new GeoTexCoordsPtr[ngeos];
    GeoTexCoordsPtr   *tex1    = new GeoTexCoordsPtr[ngeos];
    GeoTexCoordsPtr   *tex2    = new GeoTexCoordsPtr[ngeos];
    GeoTexCoordsPtr   *tex3    = new GeoTexCoordsPtr[ngeos];
    GeoIndicesPtr     *indices = new GeoIndicesPtr[ngeos];

    int **pni  = new int*[ngeos];
    int **nni  = new int*[ngeos];
    int **cni  = new int*[ngeos];
    int **sni  = new int*[ngeos];
    int **tni  = new int*[ngeos];
    int **t1ni = new int*[ngeos];
    int **t2ni = new int*[ngeos];
    int **t3ni = new int*[ngeos];

    for (Int32 i=0; i<ngeos; i++)
    {
        geos[i]  = Geometry::create();

        beginEditCP(geos[i]); // Keep open until the end

        geos[i]->setMaterial(geo->getMaterial());

        if(geo->getMFIndexMapping() != NULL)
            geos[i]->getMFIndexMapping()->setValues(*(geo->getMFIndexMapping()));

        types[i]   = GeoPTypesPtr::dcast(geo->getTypes()->getType().createFieldContainer());
        lens[i]    = GeoPLengthsPtr::dcast(geo->getLengths()->getType().createFieldContainer());

        if (geo->getIndices()!=NullFC)
        {
            indices[i]  = GeoIndicesPtr::dcast(geo->getIndices()->getType().createFieldContainer());
            beginEditCP(indices[i]); // Keep open until the end
        }
        else
            indices[i]  = NullFC;

        beginEditCP(types[i]); // Keep open until the end
        beginEditCP(lens[i]); // Keep open until the end

        setupAttr( GeoPositionsPtr , pnts    , pni  , getPositions       );
        setupAttr( GeoNormalsPtr   , normals , nni  , getNormals         );
        setupAttr( GeoColorsPtr    , colors  , cni  , getColors          );
        setupAttr( GeoColorsPtr    , scolors , sni  , getSecondaryColors );
        setupAttr( GeoTexCoordsPtr , tex     , tni  , getTexCoords       );        
        setupAttr( GeoTexCoordsPtr , tex1    , t1ni , getTexCoords1      );
        setupAttr( GeoTexCoordsPtr , tex2    , t2ni , getTexCoords2      );
        setupAttr( GeoTexCoordsPtr , tex3    , t3ni , getTexCoords3      );
    }

    ind=0;
    it.setToBegin();

    while (!it.isAtEnd())
    {
        switch(it.getType())
        {
        case GL_POINTS:
        case GL_LINES:
        case GL_LINE_STRIP:
        case GL_LINE_LOOP:
        case GL_TRIANGLE_FAN:
        case GL_TRIANGLE_STRIP:
        case GL_QUAD_STRIP:
        case GL_POLYGON:
            {
                int geoIndex=order[ind]/_max_polygons;

                types[geoIndex]->push_back(it.getType());
                lens[geoIndex]->push_back(it.getLength());

                addPoints( 0 , it.getLength() );
                ++ind;
            } break;
            
        case GL_TRIANGLES:
            {
                UInt32 i=0;                
                while(it.getLength()-i>=3)
                {                    
                    i+=3;
                    ++ind;
                }
            } break;
            
        case GL_QUADS:
            {
                UInt32 i=0;
                while(it.getLength()-i>=4)
                {
                    i+=4;
                    ++ind;
                }
            } break;

            
        default:
            SWARNING << "SplitGraphOp::splitLeave: encountered " 
                     << "unknown primitive type " 
                     << it.getType()
                     << ", ignoring!" << std::endl;
            break;
        }
        ++it;        
    }

    ind=0;
    it.setToBegin();

    while (!it.isAtEnd())
    {
        switch(it.getType())
        {
        case GL_POINTS:
        case GL_LINES:
        case GL_LINE_STRIP:
        case GL_LINE_LOOP:
        case GL_TRIANGLE_FAN:
        case GL_TRIANGLE_STRIP:
        case GL_QUAD_STRIP:
        case GL_POLYGON:
            {
                ++ind;
            } break;
            
        case GL_TRIANGLES:
            {
                UInt32 i=0;
                int geoIndex;
                while(it.getLength()-i>=3)
                {                    
                    geoIndex = order[ind]/_max_polygons;
                    if (types[geoIndex]->size()>0 && types[geoIndex]->getValue(types[geoIndex]->size()-1) == GL_TRIANGLES)
                    {
                        int lind;
                        if ((lind=lens[geoIndex]->size()-1)>=0)
                            lens[geoIndex]->setValue(lens[geoIndex]->getValue(lind)+3, lind);
                        else
                            lens[geoIndex]->push_back(3);
                    }
                    else
                    {
                        types[geoIndex]->push_back(GL_TRIANGLES);
                        lens[geoIndex]->push_back(3);
                    }

                    addPoints( i ,3 );
                    i+=3;
                    ++ind;
                }
            } break;
            
        case GL_QUADS:
            {
                UInt32 i=0;
                while(it.getLength()-i>=4)
                {
                    i+=4;
                    ++ind;
                }
            } break;

            
        default:
            SWARNING << "SplitGraphOp::splitLeave: encountered " 
                     << "unknown primitive type " 
                     << it.getType()
                     << ", ignoring!" << std::endl;
            break;
        }        
        ++it;        
    }

    ind=0;
    it.setToBegin();

    while (!it.isAtEnd())
    {
        switch(it.getType())
        {
        case GL_POINTS:
        case GL_LINES:
        case GL_LINE_STRIP:
        case GL_LINE_LOOP:
        case GL_TRIANGLE_FAN:
        case GL_TRIANGLE_STRIP:
        case GL_QUAD_STRIP:
        case GL_POLYGON:
            {
                ++ind;
            } break;
            
        case GL_TRIANGLES:
            {
                UInt32 i=0;
                while(it.getLength()-i>=3)
                {
                    i+=3;
                    ++ind;
                }
            } break;
            
        case GL_QUADS:
            {
                UInt32 i=0;
                int geoIndex;
                while(it.getLength()-i>=4)
                {                    
                    geoIndex = order[ind]/_max_polygons;
                    if (types[geoIndex]->size()>0 && types[geoIndex]->getValue(types[geoIndex]->size()-1) == GL_QUADS)
                    {
                        int lind;
                        if ((lind=lens[geoIndex]->size()-1)>=0)
                            lens[geoIndex]->setValue(lens[geoIndex]->getValue(lind)+4, lind);
                        else
                            lens[geoIndex]->push_back(4);
                    }
                    else
                    {
                        types[geoIndex]->push_back(GL_QUADS);
                        lens[geoIndex]->push_back(4);
                    }

                    addPoints( i , 4 );
                    i+=4;
                    ++ind;
                }
            } break;
            
        default:
            SWARNING << "SplitGraphOp::splitLeave: encountered " 
                     << "unknown primitive type " 
                     << it.getType()
                     << ", ignoring!" << std::endl;
            break;
        }        
        ++it;        
    }

    for (Int32 i=0; i<ngeos; i++)
    {
        geos[i]->setTypes(types[i]);
        geos[i]->setLengths(lens[i]);
        geos[i]->setPositions(pnts[i]);

        // Now close the open FCs
        
        endEditCP(types[i]);
        endEditCP(lens[i]);
        endEditCP(pnts[i]);

        if (indices[i]!=NullFC)
        {
            geos[i]->setIndices(indices[i]);   
            endEditCP(indices[i]);
        }     

        if (normals[i]!=NullFC)
        {
            geos[i]->setNormals(normals[i]);
            endEditCP(normals[i]);
        }     

        if (colors[i]!=NullFC)
        {
            geos[i]->setColors(colors[i]);
            endEditCP(colors[i]);
        }     
        
        if (scolors[i]!=NullFC)
        {
            geos[i]->setSecondaryColors(scolors[i]);
            endEditCP(scolors[i]);
        }     
        
        if (tex[i]!=NullFC)
        {
            geos[i]->setTexCoords(tex[i]);
             endEditCP(tex[i]);
        }     
       
        if (tex1[i]!=NullFC)
        {
            geos[i]->setTexCoords1(tex1[i]);
            endEditCP(tex1[i]);
        }     
        
        if (tex2[i]!=NullFC)
        {
            geos[i]->setTexCoords2(tex2[i]);
            endEditCP(tex2[i]);
        }     
        
        if (tex3[i]!=NullFC)
        {
            geos[i]->setTexCoords3(tex3[i]);
            endEditCP(tex3[i]);
        }     

        endEditCP(geos[i]);        
        
        if (node->getParent()!=NullFC)
        {
            NodePtr n=Node::create();
            beginEditCP(n, Node::CoreFieldMask);
            n->setCore(geos[i]);
            endEditCP  (n, Node::CoreFieldMask);
            split.push_back(n);
        }        
    }

    for (Int32 i=0; i<ngeos; i++)
    {
        if (pni[i]) delete [] pni[i];
        if (nni[i]) delete [] nni[i];
        if (cni[i]) delete [] cni[i];
        if (sni[i]) delete [] sni[i];
        if (tni[i]) delete [] tni[i];
        if (t1ni[i]) delete [] t1ni[i];
        if (t2ni[i]) delete [] t2ni[i];
        if (t3ni[i]) delete [] t3ni[i];
    }

    delete [] pni;
    delete [] nni;
    delete [] cni;
    delete [] sni;
    delete [] tni;
    delete [] t1ni;
    delete [] t2ni;
    delete [] t3ni;

    return true;
}

Action::ResultE SplitGraphOp::traverseEnter

(

NodePtr &

node

)

[private, virtual]

Implements osg::GraphOp.

Definition at line 148 of file OSGSplitGraphOp.cpp.

References osg::Action::Continue, osg::AttachmentContainerPtr::dcast(), osg::NodePtr::getCore(), isLeaf(), osg::NullFC, and osg::Action::Skip.

{
    if (isLeaf(node)) return Action::Skip;

    SwitchPtr switch_ = SwitchPtr::dcast(node->getCore());
    if (switch_!=NullFC) return Action::Skip;
    
    DistanceLODPtr dlod = DistanceLODPtr::dcast(node->getCore());
    if (dlod!=NullFC) return Action::Skip;   
    
    return Action::Continue;    
}

Action::ResultE SplitGraphOp::traverseLeave	(	NodePtr &	node,
		Action::ResultE	res
	)			[private, virtual]

Implements osg::GraphOp.

Definition at line 279 of file OSGSplitGraphOp.cpp.

References osg::addRefCP(), osg::beginEditCP(), osg::Node::ChildrenFieldMask, osg::endEditCP(), osg::GraphOp::isInExcludeList(), isLeaf(), and splitNode().

{
    std::vector<NodePtr>::iterator it = node->getMFChildren()->getValues().begin();
    std::vector<NodePtr>::iterator en = node->getMFChildren()->getValues().end  ();
    std::vector<NodePtr> toAdd;
    std::vector<NodePtr> toSub;

    for ( ; it != en; ++it )
    {
        bool special=isInExcludeList(*it);
        bool leaf=isLeaf(*it);
        
        if (!special && leaf)
        {
            if (splitNode(*it, toAdd))
                toSub.push_back(*it);
        }
    }

    it = toAdd.begin();
    en = toAdd.end  ();
    
    for ( ; it != en; ++it )
    {
        beginEditCP(node, Node::ChildrenFieldMask);
        node->addChild(*it);
        endEditCP  (node, Node::ChildrenFieldMask);
    }
    
    it = toSub.begin();
    en = toSub.end  ();
    
    for ( ; it != en; ++it )
    {
        beginEditCP(node, Node::ChildrenFieldMask);
        addRefCP(*it);
        node->subChild(*it);
        endEditCP  (node, Node::ChildrenFieldMask);
    }
    return res;
}

const std::string & GraphOp::getName

(

void

)

[inherited]

Definition at line 112 of file OSGGraphOp.cpp.

References osg::GraphOp::_name.

Referenced by osg::GraphOpFactory::registerOp(), and osg::GraphOpFactory::unRegisterOp().

{
    return _name;
};

void GraphOp::setName

(

const char *

name

)

[inherited]

Definition at line 117 of file OSGGraphOp.cpp.

References osg::GraphOp::_name.

{
    _name = name;
};

void GraphOp::addToExcludeList

(

NodePtr &

node

)

[inherited]

Definition at line 124 of file OSGGraphOp.cpp.

References osg::GraphOp::_excludeListNodes, and osg::GraphOp::isInExcludeListNodes().

Referenced by osg::MergeGraphOp::excludeListLeave(), and osg::GraphOpSeq::setGraphOps().

{
    if (!isInExcludeListNodes(node))
        _excludeListNodes.push_back(node);
}

void GraphOp::addToExcludeList

(

const std::string &

name

)

[inherited]

Definition at line 130 of file OSGGraphOp.cpp.

References osg::GraphOp::_excludeListNames, and osg::GraphOp::isInExcludeListNames().

{
    if (!isInExcludeListNames(name))
        _excludeListNames.push_back(name);
}

void GraphOp::removeFromExcludeList

(

NodePtr &

node

)

[inherited]

Definition at line 136 of file OSGGraphOp.cpp.

References osg::GraphOp::_excludeListNodes.

{
    _excludeListNodes.remove(node);
}

void GraphOp::removeFromExcludeList

(

const std::string &

name

)

[inherited]

Definition at line 141 of file OSGGraphOp.cpp.

References osg::GraphOp::_excludeListNames.

{
    _excludeListNames.remove(name);
}

void GraphOp::clearExcludeList

(

void

)

[inherited]

Definition at line 146 of file OSGGraphOp.cpp.

References osg::GraphOp::_excludeListNames, and osg::GraphOp::_excludeListNodes.

{
    _excludeListNames.clear();
    _excludeListNodes.clear();
}

bool GraphOp::isInExcludeListNodes

(

NodePtr &

node

)

[inherited]

Definition at line 152 of file OSGGraphOp.cpp.

References osg::GraphOp::_excludeListNodes.

Referenced by osg::GraphOp::addToExcludeList(), and osg::GraphOp::isInExcludeList().

{
    std::list<NodePtr>::iterator list_iter;
    list_iter = std::find(_excludeListNodes.begin(),_excludeListNodes.end(),node);

    if (list_iter==_excludeListNodes.end()) 
        return false;
    else 
        return true;
}

bool GraphOp::isInExcludeListNames

(

const std::string &

name

)

[inherited]

Definition at line 163 of file OSGGraphOp.cpp.

References osg::GraphOp::_excludeListNames.

Referenced by osg::GraphOp::addToExcludeList(), and osg::GraphOp::isInExcludeList().

{
    std::list<std::string>::iterator namelist_iter;
    namelist_iter = std::find(_excludeListNames.begin(),_excludeListNames.end(),name);

    if (namelist_iter==_excludeListNames.end()) 
        return false;
    else 
        return true;
}

bool GraphOp::isInExcludeList

(

NodePtr &

node

)

[inherited]

Definition at line 174 of file OSGGraphOp.cpp.

References osg::getName(), osg::GraphOp::isInExcludeListNames(), and osg::GraphOp::isInExcludeListNodes().

Referenced by osg::MergeGraphOp::processGeometries(), osg::MergeGraphOp::processGroups(), osg::MergeGraphOp::processTransformations(), splitNode(), and traverseLeave().

{
    if (isInExcludeListNodes(node) || (OSG::getName(node)!=NULL && isInExcludeListNames(OSG::getName(node))))
        return true;
    else
        return false;
}

---

Member Data Documentation

UInt16 osg::SplitGraphOp::_max_polygons [private]

Definition at line 109 of file OSGSplitGraphOp.h.

Referenced by setMaxPolygons(), setParams(), and splitNode().

std::list<NodePtr> osg::GraphOp::_excludeListNodes [protected, inherited]

Definition at line 161 of file OSGGraphOp.h.

Referenced by osg::GraphOp::addToExcludeList(), osg::GraphOp::clearExcludeList(), osg::GraphOp::isInExcludeListNodes(), osg::MergeGraphOp::mergeOnce(), and osg::GraphOp::removeFromExcludeList().

std::list<std::string> osg::GraphOp::_excludeListNames [protected, inherited]

Definition at line 162 of file OSGGraphOp.h.

Referenced by osg::GraphOp::addToExcludeList(), osg::GraphOp::clearExcludeList(), osg::GraphOp::isInExcludeListNames(), and osg::GraphOp::removeFromExcludeList().

---

The documentation for this class was generated from the following files:

• OSGSplitGraphOp.h
• OSGSplitGraphOp.cpp