rename the following methods:

tqparent parent
tqmask mask


git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdewebdev@1246260 283d02a7-25f6-0310-bc7c-ecb5cbfe19da

1 files changed, 11 insertions, 11 deletions

diff --git a/quanta/parsers/node.h b/quanta/parsers/node.h
index d2007482..4e3451af 100644
--- a/quanta/parsers/node.h
+++ b/quanta/parsers/node.h
@@ -36,7 +36,7 @@ struct GroupElement{
     Node *node;
     /* The tag which point to the actual place in the node */
     Tag *tag;
-    /*The tqparent node indicating the beginning of a structure */
+    /*The parent node indicating the beginning of a structure */
     Node *parentNode;
     bool global;
     bool deleted;
@@ -48,7 +48,7 @@ typedef TQValueList<GroupElement*> GroupElementList;
 typedef TQMap<TQString, GroupElementList> GroupElementMapList;
 
 /**
- * A Node is a basic unit of a Tree. It keeps track of his tqparent, his left neighbour, his right neighbour
+ * A Node is a basic unit of a Tree. It keeps track of his parent, his left neighbour, his right neighbour
  * and his first child.
  * It contains some functions to navigate through the tree, but some more are located at kafkacommon.h
  * (and should be moved here...)
@@ -61,7 +61,7 @@ typedef TQMap<TQString, GroupElementList> GroupElementMapList;
 class Node {
 
 public:
- Node( Node *tqparent );
+ Node( Node *parent );
  ~Node();
  
  /** 
@@ -73,7 +73,7 @@ public:
  static bool deleteNode(Node *node);
 
  /**
-  * Copy everything from node except prev, next, child, tqparent, listItem, group, groupTag, which are set to Null
+  * Copy everything from node except prev, next, child, parent, listItem, group, groupTag, which are set to Null
   * The groupElementsList is cleared.
   */
  void operator =(Node* node);
@@ -84,22 +84,22 @@ public:
 
  Node *next;
  Node *prev;
- Node *tqparent;
+ Node *parent;
  Node *child;
 
- /** Returns the child if available, else the next node, else the next node of the first tqparent which has one, else 0L.
+ /** Returns the child if available, else the next node, else the next node of the first parent which has one, else 0L.
        WARNING: it doesn't behave like DOM::Node::nextSibling() which give the next Node, or 0L if there is no next Node */
  Node *nextSibling();
  Node *previousSibling();
- /** Returns the next node, or the tqparent's next, if next doesn't exists,
-  or the grantqparent's next, if tqparent's next doesn't exists, etc. */
+ /** Returns the next node, or the parent's next, if next doesn't exists,
+  or the granparent's next, if parent's next doesn't exists, etc. */
  Node *nextNotChild();
 
 /** DOM like functions cf dom/dom_node.h */
  TQString nodeName();
  TQString nodeValue();
  void setNodeValue(const TQString &value);
- Node* parentNode() {return tqparent;}
+ Node* parentNode() {return parent;}
  Node* firstChild() {return child;}
  Node* lastChild();
  Node* DOMpreviousSibling() {return prev;}
@@ -113,7 +113,7 @@ public:
  /** Others functions. */
  // check if Node has node in its child subtree (and grand-child,...)
  bool hasForChild(Node *node);
- void setParent(Node *nodeParent) {tqparent = nodeParent;}
+ void setParent(Node *nodeParent) {parent = nodeParent;}
  //If Node is of type XmlTag or ScriptTag, return the corresponding XmlTagEnd if available
  Node *getClosingNode();
  //If Node is of type XmlTagEnd, return the corresponding XmlTag or ScriptTag if available
@@ -130,7 +130,7 @@ public:
  Node *lastChildNE();
 
 /**
- * The main problem manipulating the default links prev/next/tqparent/child is that we often want
+ * The main problem manipulating the default links prev/next/parent/child is that we often want
  * to manipulate only the "significant" Nodes e.g. XmlTag, Text, ScriptNode, like in a DOM::Node tree.
  * These functions, prefixed with "S" which stands for "simplified" or "significant", will only return
  * and manipulate XmlTag, Text and ScriptNode.