kraken_engine/kraken
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Scene nodes now persist their order.

Browse Source 
Implemented error handling and insertion logic for KRContext::createNode
Refactored KRNode::m_childNodes to be a std::list rather than a std::set
Added stub function, KRNode::createNode, which accepts a KrCreateNodeInfo structure
This commit is contained in:
Kearwood Gilbert
2022-09-22 22:32:17 -07:00
parent 6c8bf9fa2c
commit ec65e788e0
8 changed files with 131 additions and 32 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
kraken/KRNode.h
View File

@@ -115,13 +115,17 @@ public:
virtual tinyxml2::XMLElement* saveXML(tinyxml2::XMLNode* parent);
static KRNode* LoadXML(KRScene& scene, tinyxml2::XMLElement* e);
static KrResult createNode(const KrCreateNodeInfo* pCreateNodeInfo, KRNode** node);
virtual void loadXML(tinyxml2::XMLElement* e);
virtual std::string getElementName();
const std::string& getName() const;
void addChild(KRNode* child);
const std::set<KRNode*>& getChildren();
void appendChild(KRNode* child);
void prependChild(KRNode* child);
void insertBefore(KRNode* child);
void insertAfter(KRNode* child);
const std::list<KRNode*>& getChildren();
KRNode* getParent();
void setLocalTranslation(const Vector3& v, bool set_original = false);
@@ -262,7 +266,7 @@ protected:
LodVisibility m_lod_visible;
KRNode* m_parentNode;
std::set<KRNode*> m_childNodes;
std::list<KRNode*> m_childNodes;
bool m_animation_mask[KRENGINE_NODE_ATTRIBUTE_COUNT];
@@ -319,7 +323,7 @@ public:
return match;
}
for (std::set<KRNode*>::const_iterator itr = m_childNodes.begin(); itr != m_childNodes.end(); ++itr) {
for (std::list<KRNode*>::const_iterator itr = m_childNodes.begin(); itr != m_childNodes.end(); ++itr) {
match = (*itr)->find<T>();
if (match) {
return match;
@@ -338,7 +342,7 @@ public:
}
}
for (std::set<KRNode*>::const_iterator itr = m_childNodes.begin(); itr != m_childNodes.end(); ++itr) {
for (std::list<KRNode*>::const_iterator itr = m_childNodes.begin(); itr != m_childNodes.end(); ++itr) {
match = (*itr)->find<T>(name);
if (match) {
return match;