1 files changed, 12 insertions, 12 deletions

diff --git a/quanta/components/framewizard/treenode.h b/quanta/components/framewizard/treenode.h
index 82d312fb..c96d9b17 100644
--- a/quanta/components/framewizard/treenode.h
+++ b/quanta/components/framewizard/treenode.h
@@ -33,36 +33,36 @@ class treeNode {
       TQString m_label,
                    m_parentLabel;
       SplitType m_splitType;
-      TQPtrList<treeNode> m_childrenList;
+      TQPtrList<treeNode> m_tqchildrenList;
       areaAttribute *m_atts;
 
    public:
      treeNode(const TQString &l=TQString(), const TQString &pl=TQString());
       ~treeNode();
       void addChildNode(const TQString &L);
-      void addChildNode(treeNode *n){ m_childrenList.append(n); }
+      void addChildNode(treeNode *n){ m_tqchildrenList.append(n); }
       void removeChildNode(const TQString &l, bool autoDelete);
       void setSplitType(SplitType s) { m_splitType = s; }
       void setLabel(const TQString &l) { m_label = l; }
-      void removeChildren() { m_childrenList.clear(); }
+      void removeChildren() { m_tqchildrenList.clear(); }
       void setParentLabel(const TQString &s){ m_parentLabel = s;}
-      int  childPosition(treeNode* n){ return m_childrenList.find(n); }
-      bool insertChild(unsigned int pos, treeNode* n) { return m_childrenList.insert( pos, n); }
+      int  childPosition(treeNode* n){ return m_tqchildrenList.find(n); }
+      bool insertChild(unsigned int pos, treeNode* n) { return m_tqchildrenList.insert( pos, n); }
       TQString label() const { return m_label; }
       TQString parentLabel() const { return m_parentLabel; }
       SplitType splitType() const { return m_splitType; }
-      TQPtrList<treeNode> childrenList() { return m_childrenList; }
+      TQPtrList<treeNode> tqchildrenList() { return m_tqchildrenList; }
 
-      treeNode* firstChild() { return m_childrenList.first(); }
-      treeNode* nextChild() { return m_childrenList.next(); }
-      treeNode* lastChild() { return m_childrenList.last(); }
-      treeNode* currentChild()  { return m_childrenList.current(); }
+      treeNode* firstChild() { return m_tqchildrenList.first(); }
+      treeNode* nextChild() { return m_tqchildrenList.next(); }
+      treeNode* lastChild() { return m_tqchildrenList.last(); }
+      treeNode* currentChild()  { return m_tqchildrenList.current(); }
       treeNode* findChild(const TQString &L);
 
       areaAttribute* atts() { return m_atts; }
 
-      int countChildren() const { return m_childrenList.count(); }
-      bool hasChildren() const { return !m_childrenList.isEmpty(); }
+      int countChildren() const { return m_tqchildrenList.count(); }
+      bool hasChildren() const { return !m_tqchildrenList.isEmpty(); }
 };
 
 class tree{