1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266
|
/**
* $Id: SG_Node.h 20049 2009-05-04 06:59:10Z ben2610 $
*
* ***** BEGIN GPL LICENSE BLOCK *****
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL LICENSE BLOCK *****
*/
#ifndef __SG_NODE_H
#define __SG_NODE_H
#include "SG_Spatial.h"
#include <vector>
typedef std::vector<SG_Node*> NodeList;
/**
* Scenegraph node.
*/
class SG_Node : public SG_Spatial
{
public:
SG_Node(
void* clientobj,
void* clientinfo,
SG_Callbacks& callbacks
);
SG_Node(
const SG_Node & other
);
virtual ~SG_Node();
/**
* Add a child to this object. This also informs the child of
* it's parent.
* This just stores a pointer to the child and does not
* make a deep copy.
*/
void
AddChild(
SG_Node* child
);
/**
* Remove a child node from this object. This just removes the child
* pointer from the list of children - it does not destroy the child.
* This does not inform the child that this node is no longer it's parent.
* If the node was not a child of this object no action is performed.
*/
void
RemoveChild(
SG_Node* child
);
/**
* Get the current list of children. Do not use this interface for
* adding or removing children please use the methods of this class for
* that.
* @return a reference to the list of children of this node.
*/
NodeList& GetSGChildren()
{
return this->m_children;
}
/**
* Get the current list of children.
* @return a const reference to the current list of children of this node.
*/
const NodeList& GetSGChildren() const
{
return this->m_children;
}
/**
* Clear the list of children associated with this node
*/
void ClearSGChildren()
{
m_children.clear();
}
/**
* return the parent of this node if it exists.
*/
SG_Node* GetSGParent() const
{
return m_SGparent;
}
/**
* Set the parent of this node.
*/
void SetSGParent(SG_Node* parent)
{
m_SGparent = parent;
}
/**
* Return the top node in this node's Scene graph hierarchy
*/
const
SG_Node*
GetRootSGParent(
) const;
/**
* Disconnect this node from it's parent
*/
void
DisconnectFromParent(
);
/**
* Return vertex parent status.
*/
bool IsVertexParent()
{
if (m_parent_relation)
{
return m_parent_relation->IsVertexRelation();
}
return false;
}
/**
* Return slow parent status.
*/
bool IsSlowParent()
{
if (m_parent_relation)
{
return m_parent_relation->IsSlowRelation();
}
return false;
}
/**
* Update the spatial data of this node. Iterate through
* the children of this node and update their world data.
*/
void
UpdateWorldData(
double time,
bool parentUpdated=false
);
/**
* Update the simulation time of this node. Iterate through
* the children nodes and update their simulated time.
*/
void
SetSimulatedTime(
double time,
bool recurse
);
/**
* Schedule this node for update by placing it in head queue
*/
bool Schedule(SG_QList& head)
{
// Put top parent in front of list to make sure they are updated before their
// children => the children will be udpated and removed from the list before
// we get to them, should they be in the list too.
return (m_SGparent)?head.AddBack(this):head.AddFront(this);
}
/**
* Used during Scenegraph update
*/
static SG_Node* GetNextScheduled(SG_QList& head)
{
return static_cast<SG_Node*>(head.Remove());
}
/**
* Make this node ready for schedule on next update. This is needed for nodes
* that must always be updated (slow parent, bone parent)
*/
bool Reschedule(SG_QList& head)
{
return head.QAddBack(this);
}
/**
* Used during Scenegraph update
*/
static SG_Node* GetNextRescheduled(SG_QList& head)
{
return static_cast<SG_Node*>(head.QRemove());
}
/**
* Node replication functions.
*/
SG_Node*
GetSGReplica(
);
void
Destruct(
);
private:
void
ProcessSGReplica(
SG_Node** replica
);
/**
* The list of children of this node.
*/
NodeList m_children;
/**
* The parent of this node may be NULL
*/
SG_Node* m_SGparent;
};
#endif //__SG_NODE_H
|