2002-07-17 04:07:32 +08:00
|
|
|
//C++ header - Open Scene Graph - Copyright (C) 1998-2002 Robert Osfield
|
2001-10-04 23:12:57 +08:00
|
|
|
//Distributed under the terms of the GNU Library General Public License (LGPL)
|
|
|
|
//as published by the Free Software Foundation.
|
|
|
|
|
2001-01-11 00:32:10 +08:00
|
|
|
#ifndef OSG_GROUP
|
|
|
|
#define OSG_GROUP 1
|
|
|
|
|
|
|
|
#include <osg/Node>
|
|
|
|
#include <osg/NodeVisitor>
|
|
|
|
|
|
|
|
namespace osg {
|
|
|
|
|
|
|
|
/** General group node which maintains a list of children.
|
2001-09-20 05:08:56 +08:00
|
|
|
Children are reference counted. This allows children to be shared
|
2001-01-11 00:32:10 +08:00
|
|
|
with memory management handled automatically via osg::Referenced.
|
|
|
|
*/
|
|
|
|
class SG_EXPORT Group : public Node
|
|
|
|
{
|
|
|
|
public :
|
|
|
|
|
|
|
|
typedef std::vector<ref_ptr<Node> > ChildList;
|
|
|
|
|
|
|
|
Group();
|
|
|
|
|
2002-01-29 22:04:06 +08:00
|
|
|
/** Copy constructor using CopyOp to manage deep vs shallow copy.*/
|
|
|
|
Group(const Group&,const CopyOp& copyop=CopyOp::SHALLOW_COPY);
|
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
|
|
|
|
2002-06-06 21:25:36 +08:00
|
|
|
META_Node(osg, Group);
|
2001-09-22 10:42:08 +08:00
|
|
|
|
2002-09-12 23:34:31 +08:00
|
|
|
virtual Group* asGroup() { return this; }
|
|
|
|
virtual const Group* asGroup() const { return this; }
|
|
|
|
|
2001-01-11 00:32:10 +08:00
|
|
|
virtual void traverse(NodeVisitor& nv);
|
|
|
|
|
|
|
|
/** Add Node to Group.
|
|
|
|
* If node is not NULL and is not contained in Group then increment its
|
|
|
|
* reference count, add it to the child list and dirty the bounding
|
|
|
|
* sphere to force it to recompute on next getBound() and return true for success.
|
2001-09-20 05:08:56 +08:00
|
|
|
* Otherwise return false. Scene nodes can't be added as child nodes.
|
2001-01-11 00:32:10 +08:00
|
|
|
*/
|
|
|
|
virtual bool addChild( Node *child );
|
|
|
|
|
|
|
|
/** Remove Node from Group.
|
|
|
|
* If Node is contained in Group then remove it from the child
|
|
|
|
* list, decrement its reference count, and dirty the
|
|
|
|
* bounding sphere to force it to recompute on next getBound() and
|
|
|
|
* return true for success. If Node is not found then return false
|
|
|
|
* and do not change the reference count of the Node.
|
|
|
|
*/
|
|
|
|
virtual bool removeChild( Node *child );
|
|
|
|
|
|
|
|
/** Replace specified Node with another Node.
|
|
|
|
* Decrement the reference count origNode and increments the
|
|
|
|
* reference count of newNode, and dirty the bounding sphere
|
|
|
|
* to force it to recompute on next getBound() and returns true.
|
|
|
|
* If origNode is not found then return false and do not
|
|
|
|
* add newNode. If newNode is NULL then return false and do
|
2001-09-20 05:08:56 +08:00
|
|
|
* not remove origNode. Also returns false if newChild is a Scene node.
|
2001-01-11 00:32:10 +08:00
|
|
|
*/
|
|
|
|
virtual bool replaceChild( Node *origChild, Node* newChild );
|
|
|
|
|
|
|
|
/** return the number of chilren nodes.*/
|
2002-09-02 20:31:35 +08:00
|
|
|
inline unsigned int getNumChildren() const { return _children.size(); }
|
2001-09-20 05:08:56 +08:00
|
|
|
|
|
|
|
/** return child node at position i.*/
|
2002-09-02 20:31:35 +08:00
|
|
|
inline Node *getChild( unsigned int i ) { return _children[i].get(); }
|
2001-01-11 00:32:10 +08:00
|
|
|
|
|
|
|
/** return child node at position i.*/
|
2002-09-02 20:31:35 +08:00
|
|
|
inline const Node *getChild( unsigned int i ) const { return _children[i].get(); }
|
2001-01-11 00:32:10 +08:00
|
|
|
|
2001-09-20 05:08:56 +08:00
|
|
|
/** return true if node is contained within Group.*/
|
|
|
|
inline bool containsNode( const Node* node ) const
|
2001-01-11 00:32:10 +08:00
|
|
|
{
|
|
|
|
|
2001-09-20 05:08:56 +08:00
|
|
|
for (ChildList::const_iterator itr=_children.begin();
|
2001-01-11 00:32:10 +08:00
|
|
|
itr!=_children.end();
|
|
|
|
++itr)
|
|
|
|
{
|
|
|
|
if (itr->get()==node) return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2001-09-20 05:08:56 +08:00
|
|
|
|
2001-09-29 04:10:41 +08:00
|
|
|
/** return the iterator position for specified Node.
|
|
|
|
* return _children.end() if node is not contained in Group.
|
2001-01-11 00:32:10 +08:00
|
|
|
*/
|
2001-09-20 05:08:56 +08:00
|
|
|
inline ChildList::iterator findNode( const Node* node )
|
2001-01-11 00:32:10 +08:00
|
|
|
{
|
|
|
|
for (ChildList::iterator itr=_children.begin();
|
|
|
|
itr!=_children.end();
|
|
|
|
++itr)
|
|
|
|
{
|
|
|
|
if (itr->get()==node) return itr;
|
|
|
|
}
|
|
|
|
return _children.end();
|
|
|
|
}
|
|
|
|
|
2001-09-29 04:10:41 +08:00
|
|
|
/** return the const_iterator position for specified Node.
|
|
|
|
* return _children.end() if node is not contained in Group.
|
2001-09-20 05:08:56 +08:00
|
|
|
*/
|
|
|
|
inline ChildList::const_iterator findNode( const Node* node ) const
|
|
|
|
{
|
|
|
|
for (ChildList::const_iterator itr=_children.begin();
|
|
|
|
itr!=_children.end();
|
|
|
|
++itr)
|
|
|
|
{
|
|
|
|
if (itr->get()==node) return itr;
|
|
|
|
}
|
|
|
|
return _children.end();
|
|
|
|
}
|
|
|
|
|
2001-01-11 00:32:10 +08:00
|
|
|
protected:
|
|
|
|
|
|
|
|
virtual ~Group();
|
|
|
|
|
2002-09-02 20:31:35 +08:00
|
|
|
virtual bool computeBound() const;
|
2001-01-11 00:32:10 +08:00
|
|
|
|
|
|
|
ChildList _children;
|
|
|
|
|
|
|
|
|
|
|
|
};
|
|
|
|
|
2002-02-03 20:33:41 +08:00
|
|
|
}
|
2001-01-11 00:32:10 +08:00
|
|
|
|
|
|
|
#endif
|