2001-10-22 05:27:40 +08:00
|
|
|
#include <osg/Node>
|
|
|
|
#include <osg/Group>
|
|
|
|
#include <osg/NodeVisitor>
|
|
|
|
#include <osg/Notify>
|
2001-01-11 00:32:10 +08:00
|
|
|
|
|
|
|
#include <algorithm>
|
|
|
|
|
|
|
|
using namespace osg;
|
|
|
|
|
|
|
|
Node::Node()
|
|
|
|
{
|
|
|
|
_bsphere_computed = false;
|
|
|
|
_nodeMask = 0xffffffff;
|
2001-09-22 10:42:08 +08:00
|
|
|
|
|
|
|
_numChildrenRequiringAppTraversal = 0;
|
2001-10-19 20:56:37 +08:00
|
|
|
|
|
|
|
_cullingActive = true;
|
|
|
|
_numChildrenWithCullingDisabled = 0;
|
|
|
|
|
2001-01-11 00:32:10 +08:00
|
|
|
}
|
|
|
|
|
2002-01-29 22:04:06 +08:00
|
|
|
Node::Node(const Node& node,const CopyOp& copyop):
|
|
|
|
Object(node,copyop),
|
Added support for shallow and deep copy of nodes, drawables and state, via a
copy constructor which takes an optional Cloner object, and the old
osg::Object::clone() has changed so that it now requires a Cloner as paramter.
This is passed on to the copy constructor to help control the shallow vs
deep copying. The old functionality of clone() which was clone of type has
been renamed to cloneType().
Updated all of the OSG to work with these new conventions, implemention all
the required copy constructors etc. A couple of areas will do shallow
copies by design, a couple of other still need to be updated to do either
shallow or deep.
Neither of the shallow or deep copy operations have been tested yet, only
the old functionality of the OSG has been checked so far, such running the
viewer on various demo datasets.
Also fixed a problem in osg::Optimize::RemoveRendundentNodesVisitor which
was not checking that Group didn't have have any attached StateSet's, Callbacks
or UserData. These checks have now been added, which fixes a bug which was
revealled by the new osgscribe demo, this related to removal of group acting
as state decorator.
method
2002-01-29 05:17:01 +08:00
|
|
|
_bsphere(_bsphere),
|
|
|
|
_bsphere_computed(node._bsphere_computed),
|
|
|
|
_name(node._name),
|
|
|
|
_parents(), // leave empty as parentList is managed by Group.
|
|
|
|
_appCallback(node._appCallback),
|
2002-01-29 20:52:04 +08:00
|
|
|
_numChildrenRequiringAppTraversal(0), // assume no children yet.
|
Added support for shallow and deep copy of nodes, drawables and state, via a
copy constructor which takes an optional Cloner object, and the old
osg::Object::clone() has changed so that it now requires a Cloner as paramter.
This is passed on to the copy constructor to help control the shallow vs
deep copying. The old functionality of clone() which was clone of type has
been renamed to cloneType().
Updated all of the OSG to work with these new conventions, implemention all
the required copy constructors etc. A couple of areas will do shallow
copies by design, a couple of other still need to be updated to do either
shallow or deep.
Neither of the shallow or deep copy operations have been tested yet, only
the old functionality of the OSG has been checked so far, such running the
viewer on various demo datasets.
Also fixed a problem in osg::Optimize::RemoveRendundentNodesVisitor which
was not checking that Group didn't have have any attached StateSet's, Callbacks
or UserData. These checks have now been added, which fixes a bug which was
revealled by the new osgscribe demo, this related to removal of group acting
as state decorator.
method
2002-01-29 05:17:01 +08:00
|
|
|
_cullingActive(node._cullingActive),
|
2002-01-29 20:52:04 +08:00
|
|
|
_numChildrenWithCullingDisabled(0), // assume no children yet.
|
2002-01-29 22:04:06 +08:00
|
|
|
_userData(copyop(node._userData.get())),
|
Added support for shallow and deep copy of nodes, drawables and state, via a
copy constructor which takes an optional Cloner object, and the old
osg::Object::clone() has changed so that it now requires a Cloner as paramter.
This is passed on to the copy constructor to help control the shallow vs
deep copying. The old functionality of clone() which was clone of type has
been renamed to cloneType().
Updated all of the OSG to work with these new conventions, implemention all
the required copy constructors etc. A couple of areas will do shallow
copies by design, a couple of other still need to be updated to do either
shallow or deep.
Neither of the shallow or deep copy operations have been tested yet, only
the old functionality of the OSG has been checked so far, such running the
viewer on various demo datasets.
Also fixed a problem in osg::Optimize::RemoveRendundentNodesVisitor which
was not checking that Group didn't have have any attached StateSet's, Callbacks
or UserData. These checks have now been added, which fixes a bug which was
revealled by the new osgscribe demo, this related to removal of group acting
as state decorator.
method
2002-01-29 05:17:01 +08:00
|
|
|
_nodeMask(node._nodeMask),
|
|
|
|
_descriptions(node._descriptions),
|
2002-01-29 22:04:06 +08:00
|
|
|
_dstate(copyop(node._dstate.get()))
|
Added support for shallow and deep copy of nodes, drawables and state, via a
copy constructor which takes an optional Cloner object, and the old
osg::Object::clone() has changed so that it now requires a Cloner as paramter.
This is passed on to the copy constructor to help control the shallow vs
deep copying. The old functionality of clone() which was clone of type has
been renamed to cloneType().
Updated all of the OSG to work with these new conventions, implemention all
the required copy constructors etc. A couple of areas will do shallow
copies by design, a couple of other still need to be updated to do either
shallow or deep.
Neither of the shallow or deep copy operations have been tested yet, only
the old functionality of the OSG has been checked so far, such running the
viewer on various demo datasets.
Also fixed a problem in osg::Optimize::RemoveRendundentNodesVisitor which
was not checking that Group didn't have have any attached StateSet's, Callbacks
or UserData. These checks have now been added, which fixes a bug which was
revealled by the new osgscribe demo, this related to removal of group acting
as state decorator.
method
2002-01-29 05:17:01 +08:00
|
|
|
{
|
|
|
|
}
|
2001-01-11 00:32:10 +08:00
|
|
|
|
|
|
|
Node::~Node()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2002-02-09 06:55:21 +08:00
|
|
|
void Node::addParent(osg::Group* node)
|
|
|
|
{
|
|
|
|
_parents.push_back(node);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::removeParent(osg::Group* node)
|
|
|
|
{
|
|
|
|
ParentList::iterator pitr = std::find(_parents.begin(),_parents.end(),node);
|
|
|
|
if (pitr!=_parents.end()) _parents.erase(pitr);
|
|
|
|
}
|
2001-01-11 00:32:10 +08:00
|
|
|
|
|
|
|
void Node::accept(NodeVisitor& nv)
|
|
|
|
{
|
2002-02-06 05:54:46 +08:00
|
|
|
if (nv.validNodeMask(*this))
|
|
|
|
{
|
|
|
|
nv.pushOntoNodePath(this);
|
|
|
|
nv.apply(*this);
|
|
|
|
nv.popFromNodePath();
|
|
|
|
}
|
2001-01-11 00:32:10 +08:00
|
|
|
}
|
|
|
|
|
2001-09-20 05:08:56 +08:00
|
|
|
|
2001-01-11 00:32:10 +08:00
|
|
|
void Node::ascend(NodeVisitor& nv)
|
|
|
|
{
|
|
|
|
std::for_each(_parents.begin(),_parents.end(),NodeAcceptOp(nv));
|
|
|
|
}
|
|
|
|
|
2001-09-22 10:42:08 +08:00
|
|
|
void Node::setAppCallback(NodeCallback* nc)
|
|
|
|
{
|
|
|
|
// if no changes just return.
|
|
|
|
if (_appCallback==nc) return;
|
|
|
|
|
|
|
|
// app callback has been changed, will need to update
|
|
|
|
// both _appCallback and possibly the numChildrenRequiringAppTraversal
|
|
|
|
// if the number of callbacks changes.
|
|
|
|
|
|
|
|
|
|
|
|
// update the parents numChildrenRequiringAppTraversal
|
|
|
|
// note, if _numChildrenRequiringAppTraversal!=0 then the
|
|
|
|
// parents won't be affected by any app callback change,
|
|
|
|
// so no need to inform them.
|
|
|
|
if (_numChildrenRequiringAppTraversal==0 && !_parents.empty())
|
|
|
|
{
|
|
|
|
int delta = 0;
|
|
|
|
if (_appCallback.valid()) --delta;
|
|
|
|
if (nc) ++delta;
|
|
|
|
if (delta!=0)
|
|
|
|
{
|
|
|
|
// the number of callbacks has changed, need to pass this
|
|
|
|
// on to parents so they know whether app traversal is
|
|
|
|
// reqired on this subgraph.
|
|
|
|
for(ParentList::iterator itr =_parents.begin();
|
|
|
|
itr != _parents.end();
|
|
|
|
++itr)
|
|
|
|
{
|
|
|
|
(*itr)->setNumChildrenRequiringAppTraversal(
|
|
|
|
(*itr)->getNumChildrenRequiringAppTraversal()+delta );
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// set the app callback itself.
|
|
|
|
_appCallback = nc;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setNumChildrenRequiringAppTraversal(const int num)
|
|
|
|
{
|
|
|
|
// if no changes just return.
|
|
|
|
if (_numChildrenRequiringAppTraversal==num) return;
|
|
|
|
|
|
|
|
// note, if _appCallback is set then the
|
|
|
|
// parents won't be affected by any changes to
|
|
|
|
// _numChildrenRequiringAppTraversal so no need to inform them.
|
|
|
|
if (!_appCallback && !_parents.empty())
|
|
|
|
{
|
|
|
|
|
|
|
|
// need to pass on changes to parents.
|
|
|
|
int delta = 0;
|
|
|
|
if (_numChildrenRequiringAppTraversal>0) --delta;
|
|
|
|
if (num>0) ++delta;
|
|
|
|
if (delta!=0)
|
|
|
|
{
|
|
|
|
// the number of callbacks has changed, need to pass this
|
|
|
|
// on to parents so they know whether app traversal is
|
|
|
|
// reqired on this subgraph.
|
|
|
|
for(ParentList::iterator itr =_parents.begin();
|
|
|
|
itr != _parents.end();
|
|
|
|
++itr)
|
|
|
|
{
|
|
|
|
(*itr)->setNumChildrenRequiringAppTraversal(
|
|
|
|
(*itr)->getNumChildrenRequiringAppTraversal()+delta
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// finally update this objects value.
|
|
|
|
_numChildrenRequiringAppTraversal=num;
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2001-10-19 20:56:37 +08:00
|
|
|
void Node::setCullingActive(const bool active)
|
|
|
|
{
|
|
|
|
// if no changes just return.
|
|
|
|
if (_cullingActive == active) return;
|
|
|
|
|
|
|
|
// culling active has been changed, will need to update
|
|
|
|
// both _cullActive and possibly the parents numChildrenWithCullingDisabled
|
|
|
|
// if culling disabled changes.
|
|
|
|
|
|
|
|
// update the parents _numChildrenWithCullingDisabled
|
|
|
|
// note, if _numChildrenWithCullingDisabled!=0 then the
|
|
|
|
// parents won't be affected by any app callback change,
|
|
|
|
// so no need to inform them.
|
|
|
|
if (_numChildrenWithCullingDisabled==0 && !_parents.empty())
|
|
|
|
{
|
|
|
|
int delta = 0;
|
|
|
|
if (!_cullingActive) --delta;
|
|
|
|
if (!active) ++delta;
|
|
|
|
if (delta!=0)
|
|
|
|
{
|
|
|
|
// the number of callbacks has changed, need to pass this
|
|
|
|
// on to parents so they know whether app traversal is
|
|
|
|
// reqired on this subgraph.
|
|
|
|
for(ParentList::iterator itr =_parents.begin();
|
|
|
|
itr != _parents.end();
|
|
|
|
++itr)
|
|
|
|
{
|
|
|
|
(*itr)->setNumChildrenWithCullingDisabled(
|
|
|
|
(*itr)->getNumChildrenWithCullingDisabled()+delta );
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// set the cullingActive itself.
|
|
|
|
_cullingActive = active;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Node::setNumChildrenWithCullingDisabled(const int num)
|
|
|
|
{
|
|
|
|
// if no changes just return.
|
|
|
|
if (_numChildrenWithCullingDisabled==num) return;
|
|
|
|
|
|
|
|
// note, if _cullingActive is false then the
|
|
|
|
// parents won't be affected by any changes to
|
|
|
|
// _numChildrenWithCullingDisabled so no need to inform them.
|
|
|
|
if (_cullingActive && !_parents.empty())
|
|
|
|
{
|
|
|
|
|
|
|
|
// need to pass on changes to parents.
|
|
|
|
int delta = 0;
|
|
|
|
if (_numChildrenWithCullingDisabled>0) --delta;
|
|
|
|
if (num>0) ++delta;
|
|
|
|
if (delta!=0)
|
|
|
|
{
|
|
|
|
// the number of callbacks has changed, need to pass this
|
|
|
|
// on to parents so they know whether app traversal is
|
|
|
|
// reqired on this subgraph.
|
|
|
|
for(ParentList::iterator itr =_parents.begin();
|
|
|
|
itr != _parents.end();
|
|
|
|
++itr)
|
|
|
|
{
|
|
|
|
(*itr)->setNumChildrenWithCullingDisabled(
|
|
|
|
(*itr)->getNumChildrenWithCullingDisabled()+delta
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// finally update this objects value.
|
|
|
|
_numChildrenWithCullingDisabled=num;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-09-20 05:08:56 +08:00
|
|
|
const bool Node::computeBound() const
|
2001-01-11 00:32:10 +08:00
|
|
|
{
|
|
|
|
_bsphere.init();
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
void Node::dirtyBound()
|
|
|
|
{
|
|
|
|
if (_bsphere_computed)
|
|
|
|
{
|
|
|
|
_bsphere_computed = false;
|
|
|
|
|
|
|
|
// dirty parent bounding sphere's to ensure that all are valid.
|
|
|
|
for(ParentList::iterator itr=_parents.begin();
|
2001-09-20 05:08:56 +08:00
|
|
|
itr!=_parents.end();
|
|
|
|
++itr)
|
2001-01-11 00:32:10 +08:00
|
|
|
{
|
|
|
|
(*itr)->dirtyBound();
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
}
|