| 1 | /*! | 
|---|
| 2 |  * @file p_node.h | 
|---|
| 3 |  * @brief Definition of THE Parenting Node | 
|---|
| 4 |  * | 
|---|
| 5 |  *  parenting is how coordinates are handled in orxonox, meaning, that all coordinates | 
|---|
| 6 |  *  are representet relative to another parent node. this nodes build a parenting | 
|---|
| 7 |  *  tree of one-sided references (from up to down referenced). | 
|---|
| 8 |  *  Every node manages itself a list of childrens (of whos it is parent - easy...). | 
|---|
| 9 |  * | 
|---|
| 10 |  *  absCoordinate, absDirection have to be recalculated as soon as there was a change in | 
|---|
| 11 |  *  place or ortientation. this is only the case if | 
|---|
| 12 |  *  o bRelCoorChanged is true (so moved) | 
|---|
| 13 |  *  o bRelDirChanged is true (so changed) | 
|---|
| 14 |  *  this conditions make it cheaper to recalculate the tree (reduces redundant work). | 
|---|
| 15 |  */ | 
|---|
| 16 |  | 
|---|
| 17 |  | 
|---|
| 18 | #ifndef _P_NODE_H | 
|---|
| 19 | #define _P_NODE_H | 
|---|
| 20 |  | 
|---|
| 21 | #include "base_object.h" | 
|---|
| 22 | #include "stdincl.h" | 
|---|
| 23 | #include "synchronizeable.h" | 
|---|
| 24 |  | 
|---|
| 25 | #include "vector.h" | 
|---|
| 26 | #include "quaternion.h" | 
|---|
| 27 | #include <list> | 
|---|
| 28 |  | 
|---|
| 29 | // FORWARD DECLARATION | 
|---|
| 30 | class TiXmlElement; | 
|---|
| 31 |  | 
|---|
| 32 | #define PNODE_ITERATION_DELTA    .001 | 
|---|
| 33 |  | 
|---|
| 34 | //! Parental linkage modes | 
|---|
| 35 | typedef enum | 
|---|
| 36 | { | 
|---|
| 37 |   // PARENTAL FOLLOWING | 
|---|
| 38 |   PNODE_LOCAL_ROTATE                   = 0x0001,    //!< Rotates all the children around their centers. | 
|---|
| 39 |   PNODE_ROTATE_MOVEMENT                = 0x0002,    //!< Moves all the children around the center of their parent, without the rotation around their own centers. | 
|---|
| 40 |  | 
|---|
| 41 |   PNODE_MOVEMENT                       = 0x0004,    //!< Moves all children along with the parent. | 
|---|
| 42 |   // special linkage modes | 
|---|
| 43 |   PNODE_ALL                            = 0x0003,    //!< Moves all children around the center of their parent, and also rotates their centers | 
|---|
| 44 |   PNODE_ROTATE_AND_MOVE                = 0x0005,    //!< Rotates all children around their axis, and moves them as the Parent Moves, but does not rotate around the center of their parent. | 
|---|
| 45 |  | 
|---|
| 46 |  | 
|---|
| 47 |   // REPARENTING | 
|---|
| 48 |   PNODE_REPARENT_TO_NULL               = 0x0010,    //!< Reparents to the Null, if the Parent is Removed. Meaning the Node wont have a parent anymore. | 
|---|
| 49 |   PNODE_REPARENT_TO_PARENTS_PARENT     = 0x0020,    //!< Reparents the Node to the parents (old) parent it the parent gets removed. | 
|---|
| 50 |   /////////////////////////////////////////////     //  ELSE: Reparents to the NullParent. | 
|---|
| 51 |   PNODE_REPARENT_DELETE_CHILDREN       = 0x0040,    //!< Deletes the Children of the node when This Node is Removed. (Use with care). | 
|---|
| 52 |   /// FIXME | 
|---|
| 53 |    PNODE_REPARENT_KEEP_POSITION         = 0x0080,    //!< Tries to keep the Position if the Node is reparented. | 
|---|
| 54 |  | 
|---|
| 55 |  | 
|---|
| 56 |   // DELETION | 
|---|
| 57 |   PNODE_PROHIBIT_CHILD_DELETE          = 0x0100,    //!< Prohibits the Children from being deleted if this Node gets deleted. | 
|---|
| 58 |   PNODE_PROHIBIT_DELETE_WITH_PARENT    = 0x0200,    //!< Prohibits the Node to be deleted if the Parent is. Child will be reparented according to the Repaenting-Rules | 
|---|
| 59 |   PNODE_REPARENT_CHILDREN_ON_REMOVE    = 0x0400,    //!< Reparents the Children of the Node if the Node gets Removed. | 
|---|
| 60 |   PNODE_REPARENT_ON_PARENTS_REMOVE     = 0x0800,    //!< The Node gets Reparented if its Parent gets removed. Child will be reparented according to the Reparenting-Rules. | 
|---|
| 61 |  | 
|---|
| 62 |   // VISIBILITY/ACTIVITY | 
|---|
| 63 |   PNODE_HIDE_CHILDREN_IF_HIDDEN        = 0x1000,    //!< Prohibits the Children from being drawn if this node isn't visible. (used for Draw)) | 
|---|
| 64 |   PNODE_HIDE_IF_PARENT_HIDDEN          = 0x2000,    //!< Prohibits the node from being drawn if the Parent is invisible. | 
|---|
| 65 |   PNODE_UPDATE_CHILDREN_IF_INACTIVE    = 0x4000,    //!< Updates the Children of this Node even if the Parent is Inactive (note if this's parent is inactive children won't be updated.) | 
|---|
| 66 |   PNODE_STATIC_NODE                    = 0x8000,    //!< Used for nodes that do not have any moving children, and that do not move. | 
|---|
| 67 |  | 
|---|
| 68 | } PARENT_MODE; | 
|---|
| 69 |  | 
|---|
| 70 | //! The default mode of the translation-binding. | 
|---|
| 71 | #define PNODE_PARENT_MODE_DEFAULT PNODE_ALL | \ | 
|---|
| 72 |                                   PNODE_REPARENT_KEEP_POSITION | 
|---|
| 73 |  | 
|---|
| 74 |  | 
|---|
| 75 | //! Patent Node is a Engine to calculate the position of an Object in respect to the position of its parent. | 
|---|
| 76 | class PNode : virtual public BaseObject, virtual public Synchronizeable { | 
|---|
| 77 |  public: | 
|---|
| 78 |   PNode (PNode* parent = PNode::getNullParent(), long nodeFlags = PNODE_PARENT_MODE_DEFAULT); | 
|---|
| 79 |   virtual ~PNode (); | 
|---|
| 80 |  | 
|---|
| 81 |   virtual void loadParams(const TiXmlElement* root); | 
|---|
| 82 |  | 
|---|
| 83 |   void init(); | 
|---|
| 84 |  | 
|---|
| 85 |   // ACTIVATION // | 
|---|
| 86 |   inline void activateNode() { this->bActive = this->bRelCoorChanged = this->bRelDirChanged = true; }; | 
|---|
| 87 |   inline void deactivateNode() { this->bActive = false; }; | 
|---|
| 88 |   inline bool getNodeActiveState() { return this->bActive; }; | 
|---|
| 89 |  | 
|---|
| 90 |   // POSITION // | 
|---|
| 91 |   void setRelCoor (const Vector& relCoord); | 
|---|
| 92 |   void setRelCoor (float x, float y, float z); | 
|---|
| 93 |   void setRelCoorSoft(const Vector& relCoordSoft, float bias = 1.0); | 
|---|
| 94 |   void setRelCoorSoft(float x, float y, float z, float bias = 1.0); | 
|---|
| 95 |   /** @returns the relative position */ | 
|---|
| 96 |   inline const Vector& getRelCoor () const { return this->prevRelCoordinate; }; | 
|---|
| 97 |   /** @returns the Relative Coordinate Destination */ | 
|---|
| 98 |   inline const Vector& getRelCoorSoft2D() const { return (this->toCoordinate)? *this->toCoordinate : this->relCoordinate; }; | 
|---|
| 99 |   void setAbsCoor (const Vector& absCoord); | 
|---|
| 100 |   void setAbsCoor (float x, float y, float z); | 
|---|
| 101 |   void setAbsCoorSoft(const Vector& absCoordSoft, float bias = 1.0); | 
|---|
| 102 |   void setAbsCoorSoft(float x, float y, float z, float bias = 1.0); | 
|---|
| 103 |   /** @returns the absolute position */ | 
|---|
| 104 |   inline const Vector& getAbsCoor () const { return this->absCoordinate; }; | 
|---|
| 105 |   void shiftCoor (const Vector& shift); | 
|---|
| 106 |   void shiftCoor (float x, float y, float z) { this->shiftCoor(Vector(x, y, z)); }; | 
|---|
| 107 |  | 
|---|
| 108 |   // SPEED // | 
|---|
| 109 |   /** @returns the Speed of the Node */ | 
|---|
| 110 |   inline float getSpeed() const { return this->velocity.len(); }; | 
|---|
| 111 |   /** @returns the Velocity of the Node */ | 
|---|
| 112 |   inline const Vector& getVelocity() const { return this->velocity; }; | 
|---|
| 113 |  | 
|---|
| 114 |  | 
|---|
| 115 |   // ROTATION // | 
|---|
| 116 |   void setRelDir (const Quaternion& relDir); | 
|---|
| 117 |   void setRelDir (float angle, float x, float y, float z); | 
|---|
| 118 |   void setRelDirSoft(const Quaternion& relDirSoft, float bias = 1.0); | 
|---|
| 119 |   void setRelDirSoft(float angle, float x, float y, float z, float bias = 1.0); | 
|---|
| 120 |   /** @returns the relative Direction */ | 
|---|
| 121 |   inline const Quaternion& getRelDir () const { return this->prevRelDirection; }; | 
|---|
| 122 |   /** @returns the Relative Directional Destination */ | 
|---|
| 123 |   inline const Quaternion& getRelDirSoft2D() const { return (this->toDirection)? *this->toDirection : this->relDirection; }; | 
|---|
| 124 |   /** @returns a Vector pointing into the relative Direction */ | 
|---|
| 125 |   inline Vector getRelDirV() const { return this->prevRelDirection.apply(Vector(0,1,0)); }; | 
|---|
| 126 |   void setAbsDir (const Quaternion& absDir); | 
|---|
| 127 |   void setAbsDir (float angle, float x, float y, float z); | 
|---|
| 128 |   void setAbsDirSoft(const Quaternion& absDirSoft, float bias = 1.0); | 
|---|
| 129 |   void setAbsDirSoft(float angle, float x, float y, float z, float bias = 1.0); | 
|---|
| 130 |   void shiftDir (const Quaternion& shift); | 
|---|
| 131 |   /** @returns the absolute Direction */ | 
|---|
| 132 |   inline const Quaternion& getAbsDir () const { return this->absDirection; }; | 
|---|
| 133 |   /** @returns a Vector pointing into the absolute Direction */ | 
|---|
| 134 |   inline Vector getAbsDirV() const { return this->absDirection.apply(Vector(0,1,0)); }; | 
|---|
| 135 |   /** @returns A Vector pointing into the forward direction (X) of the Node */ | 
|---|
| 136 |   inline Vector getAbsDirX() const { return this->absDirection.apply(Vector(1,0,0)); }; | 
|---|
| 137 |   /** @returns A Vector pointing into the upward direction (Y) of the Node */ | 
|---|
| 138 |   inline Vector getAbsDirY() const { return this->absDirection.apply(Vector(0,1,0)); }; | 
|---|
| 139 |   /** @returns A Vector pointing into the right direction (Z) of the Node */ | 
|---|
| 140 |   inline Vector getAbsDirZ() const { return this->absDirection.apply(Vector(0,0,1)); }; | 
|---|
| 141 |  | 
|---|
| 142 |  | 
|---|
| 143 |   // PARENTING // | 
|---|
| 144 |   void addChild (PNode* child); | 
|---|
| 145 |   void addChild (const char* childName); | 
|---|
| 146 |   void removeChild (PNode* child); | 
|---|
| 147 |   void removeNode(); | 
|---|
| 148 |  | 
|---|
| 149 |   PNode* seekNextAssignedPNode(PNode* node) const; | 
|---|
| 150 |  | 
|---|
| 151 |   /** @param parent the new parent of this node */ | 
|---|
| 152 |   inline void setParent (PNode* parent) { parent->addChild(this); }; | 
|---|
| 153 |   void setParent (const char* parentName); | 
|---|
| 154 |   /** @returns the parent of this PNode */ | 
|---|
| 155 |   inline PNode* getParent () const { return this->parent; }; | 
|---|
| 156 |   /** @returns the List of Children of this PNode */ | 
|---|
| 157 |   const std::list<PNode*>& getNodesChildren() const { return this->children; }; | 
|---|
| 158 |  | 
|---|
| 159 |   void setParentSoft(PNode* parentNode, float bias = 1.0); | 
|---|
| 160 |   void setParentSoft(const char* parentName, float bias = 1.0); | 
|---|
| 161 |  | 
|---|
| 162 |   // PARENTING_MODE AND OTHER FLAGS // | 
|---|
| 163 |   void setParentMode (PARENT_MODE parentMode); | 
|---|
| 164 |   void setParentMode (const char* parentingMode); | 
|---|
| 165 |   /** @returns the Parenting mode of this node */ | 
|---|
| 166 |   int getParentMode() const { return 0x000f & this->parentMode; }; | 
|---|
| 167 |  | 
|---|
| 168 |   void addNodeFlags(unsigned short nodeFlags); | 
|---|
| 169 |   void removeNodeFlags(unsigned short nodeFlags); | 
|---|
| 170 |  | 
|---|
| 171 |   // NULL_PARENT // | 
|---|
| 172 |   /** @returns the NullParent, the (main) ROOT of the PNode Tree. If it does not yet exist, it will be created. */ | 
|---|
| 173 |   static PNode* getNullParent()  { return (PNode::nullParent != NULL)? PNode::nullParent : PNode::createNullParent(); }; | 
|---|
| 174 |  | 
|---|
| 175 |   // UPDATING // | 
|---|
| 176 |   void updateNode (float dt); | 
|---|
| 177 |  | 
|---|
| 178 |   // DEBUG // | 
|---|
| 179 |   void countChildNodes(int& nodes) const; | 
|---|
| 180 |   void debugNodeSC (unsigned int depth = 1, unsigned int level = 0) { this->debugNode(depth, level); }; | 
|---|
| 181 |   void debugNode (unsigned int depth = 1, unsigned int level = 0) const; | 
|---|
| 182 |   void debugDraw(unsigned int depth = 1, float size = 1.0, const Vector& color = Vector(1, 0, 0), unsigned int level = 0) const; | 
|---|
| 183 |  | 
|---|
| 184 |   // HELPER_FUNCTIONS // | 
|---|
| 185 |   static const char* parentingModeToChar(int parentingMode); | 
|---|
| 186 |   static PARENT_MODE charToParentingMode(const char* parentingMode); | 
|---|
| 187 |  | 
|---|
| 188 |   int       writeState(const byte* data, int length, int sender); | 
|---|
| 189 |   int       readState(byte* data, int maxLength ); | 
|---|
| 190 |   int       writeSync(const byte* data, int length, int sender); | 
|---|
| 191 |   int       readSync(byte* data, int maxLength ); | 
|---|
| 192 |   bool      needsReadSync(); | 
|---|
| 193 |  | 
|---|
| 194 |  private: | 
|---|
| 195 |   /** tells the child that the parent's Coordinate has changed */ | 
|---|
| 196 |   inline void parentCoorChanged () { this->bRelCoorChanged = true; } | 
|---|
| 197 |   /** tells the child that the parent's Direction has changed */ | 
|---|
| 198 |   inline void parentDirChanged () { this->bRelDirChanged = true; } | 
|---|
| 199 |   /** @returns the last calculated coordinate */ | 
|---|
| 200 |   inline Vector getLastAbsCoor() { return this->lastAbsCoordinate; } | 
|---|
| 201 |  | 
|---|
| 202 |   static PNode* createNullParent(); | 
|---|
| 203 |   void reparent(); | 
|---|
| 204 |   bool checkIntegrity(const PNode* checkParent) const; | 
|---|
| 205 |   void eraseChild(PNode* child); | 
|---|
| 206 |  | 
|---|
| 207 |  private: | 
|---|
| 208 |   bool               bRelCoorChanged;    //!< If Relative Coordinate has changed since last time we checked | 
|---|
| 209 |   bool               bRelDirChanged;     //!< If Relative Direction has changed since last time we checked | 
|---|
| 210 |  | 
|---|
| 211 |   Vector             relCoordinate;      //!< coordinates relative to the parent | 
|---|
| 212 |   Vector             absCoordinate;      //!< absolute coordinates in the world ( from (0,0,0) ) | 
|---|
| 213 |   Quaternion         relDirection;       //!< direction relative to the parent | 
|---|
| 214 |   Quaternion         absDirection;       //!< absolute direvtion in the world ( from (0,0,1) ) | 
|---|
| 215 |  | 
|---|
| 216 |   Vector             prevRelCoordinate;  //!< The last Relative Coordinate from the last update-Cycle. | 
|---|
| 217 |   Vector             lastAbsCoordinate;  //!< this is used for speedcalculation, it stores the last coordinate | 
|---|
| 218 |   Quaternion         prevRelDirection;   //!< The last Relative Direciton from the last update-Cycle. | 
|---|
| 219 | //  Quaternion         lastAbsDirection; | 
|---|
| 220 |  | 
|---|
| 221 |   Vector             velocity;           //!< Saves the velocity. | 
|---|
| 222 |  | 
|---|
| 223 |   Vector*            toCoordinate;       //!< a position to which to iterate. (This is used in conjunction with setParentSoft.and set*CoorSoft) | 
|---|
| 224 |   Quaternion*        toDirection;        //!< a direction to which to iterate. (This is used in conjunction with setParentSoft and set*DirSoft) | 
|---|
| 225 |   float              bias;               //!< how fast to iterate to the given position (default is 1) | 
|---|
| 226 |   float              toStep; | 
|---|
| 227 |  | 
|---|
| 228 |   PNode*             parent;             //!< a pointer to the parent node. | 
|---|
| 229 |   std::list<PNode*>  children;           //!< list of the children of this PNode. | 
|---|
| 230 |  | 
|---|
| 231 |   bool               bActive;            //!< If the Node is Active (for cutting off the rest of the tree in update). | 
|---|
| 232 |   unsigned short     parentMode;         //!< the mode of the binding | 
|---|
| 233 |  | 
|---|
| 234 |  | 
|---|
| 235 |   static PNode*      nullParent;         //!< The ROOT of the main PNode Tree. | 
|---|
| 236 |  | 
|---|
| 237 |   private: | 
|---|
| 238 |     float coorx; | 
|---|
| 239 |     float coory; | 
|---|
| 240 |     float coorz; | 
|---|
| 241 |  | 
|---|
| 242 |     float rotw; | 
|---|
| 243 |     float rotx; | 
|---|
| 244 |     float roty; | 
|---|
| 245 |     float rotz; | 
|---|
| 246 | }; | 
|---|
| 247 |  | 
|---|
| 248 | #endif /* _P_NODE_H */ | 
|---|