summaryrefslogtreecommitdiffstats
path: root/quanta/parts/kafka/kafkacommon.h
diff options
context:
space:
mode:
authortpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-06-16 19:02:47 +0000
committertpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-06-16 19:02:47 +0000
commite985f7e545f4739493965aad69bbecb136dc9346 (patch)
tree54afd409d8acd6202dd8ab611d24e78c28e4c0a0 /quanta/parts/kafka/kafkacommon.h
parentf7670c198945adc3b95ad69a959fe5f8ae55b493 (diff)
downloadtdewebdev-e985f7e545f4739493965aad69bbecb136dc9346.tar.gz
tdewebdev-e985f7e545f4739493965aad69bbecb136dc9346.zip
TQt4 port kdewebdev
This enables compilation under both Qt3 and Qt4 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdewebdev@1237029 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'quanta/parts/kafka/kafkacommon.h')
-rw-r--r--quanta/parts/kafka/kafkacommon.h148
1 files changed, 74 insertions, 74 deletions
diff --git a/quanta/parts/kafka/kafkacommon.h b/quanta/parts/kafka/kafkacommon.h
index 7de7d77e..0a1d25bd 100644
--- a/quanta/parts/kafka/kafkacommon.h
+++ b/quanta/parts/kafka/kafkacommon.h
@@ -58,7 +58,7 @@ public:
/**
* This function returns the next Node after node : the first child of
* node if available, else its next sibling if available, else the next
- * available next sibling of a parent of node.
+ * available next sibling of a tqparent of node.
* @param _node It is the Node from which we want the next Node.
* @param goUp This boolean specifies if we should go up (torwards the root Node)
* i.e. not looking at the childs of node, or make a standart iteration.
@@ -87,20 +87,20 @@ public:
/**
- * Returns the first common parent to startNode and endNode that isn't inline.
+ * Returns the first common tqparent to startNode and endNode that isn't inline.
* @param startNode Start node.
* @param endNode End node.
- * @param commonParentStartChildLocation Is the child of commonParent which is parent of startNode
- * @param commonParentEndChildLocation Is the child of commonParent which is parent of endNode
+ * @param commonParentStartChildLocation Is the child of commonParent which is tqparent of startNode
+ * @param commonParentEndChildLocation Is the child of commonParent which is tqparent of endNode
* @param nodeSubtree When startNode and endNode doesn't belong to the current document tree. Pass 0 if they do.
- * @return The first, non inline, common parent of startNode and endNode.
+ * @return The first, non inline, common tqparent of startNode and endNode.
*/
static Node* DTDGetNonInlineCommonParent(Node* startNode, Node* endNode,
TQValueList<int>& commonParentStartChildLocation,
TQValueList<int>& commonParentEndChildLocation, Node* nodeSubtree);
/**
- * Same as above, only that the common parent can be inline.
+ * Same as above, only that the common tqparent can be inline.
*/
static Node* DTDGetCommonParent(Node* startNode, Node* endNode,
TQValueList<int>& commonParentStartChildLocation,
@@ -109,14 +109,14 @@ public:
/**
* This function returns the next DOM::Node after node : the first child of
* DOM::Node if available, else its next sibling if available, else the next
- * available next sibling of a parent of node.
+ * available next sibling of a tqparent of node.
* @param node The DOM::Node the search starts from.
* @param goUp This boolean specifies if we should go up or down in the tree.
* For a normal use, It must be set to false at the
* beginning and then the same boolean must be used when using
* several times this function.
* @param returnParentNode Specifies if there are no child and next sibling, if
- * we should return the parent.
+ * we should return the tqparent.
* @param endNode Specifies at which DOM::Node the search should end. It is useful
* when setting returnParentNode to false.
* @return the next Node.
@@ -153,7 +153,7 @@ public:
static Node* getCorrectEndNode(Node* endNode, int& endOffset);
/**
- * Get the first child of commonParent which is parent of node
+ * Get the first child of commonParent which is tqparent of node
* @param node
* @param commonParent
* @return
@@ -186,7 +186,7 @@ public:
* generated by the undoRedo system. The undoRedo system can't create itself these Nodes
* because it will create them only during the synchronization, making all the TQValueList<int>
* Nodes location wrong.
- * WARNING n1 and n2 must be siblings or parent-child. If there are sibling and n1 is a XmlTag,
+ * WARNING n1 and n2 must be siblings or tqparent-child. If there are sibling and n1 is a XmlTag,
* n1 should not have non empty childs.
* @param n1 The start node.
* @param n2 The end node.
@@ -290,29 +290,29 @@ public:
* WARNING : baseNode is used as the rootNode.
* It will also try to merge text/Empty Nodes.
* @param node The node to insert.
- * @param parentNode This Node will be the parent of node.
+ * @param tqparentNode This Node will be the tqparent of node.
* @param nextSibling This Node will be the next Sibling of Node. If null, node will be appended at
- * the child list of parentNode.
+ * the child list of tqparentNode.
* TODO: @param rootNode The rootNode of the tree we want to insert the Node (usually &baseNode).
* @param modifs The changes made are logged into modifs. Put 0L if you don't want to log
* and if you know what you're doing!
* @param merge Try to merge with the siblings if possible.
* @return Returns a pointer to the node inserted.
*/
- static Node* insertNode(Node *node, Node* parentNode, Node* nextSibling,
+ static Node* insertNode(Node *node, Node* tqparentNode, Node* nextSibling,
NodeModifsSet *modifs/**, Node **rootNode*/, bool merge = true);
- static Node* insertNode(Node *node, Node* parentNode, Node* nextSibling, NodeSelection& selection,
+ static Node* insertNode(Node *node, Node* tqparentNode, Node* nextSibling, NodeSelection& selection,
NodeModifsSet *modifs, bool merge = true);
/**
* It behaves essentially like the above function except that it can "surround" a set of Nodes with the
* new Node. Thus, the closing Node is created if necessary.
- * nextSibling and nextEndSibling MUST have the same parent. If not, use the
+ * nextSibling and nextEndSibling MUST have the same tqparent. If not, use the
* DTDinsertNode.
* This function does not try to know if the location of the new Node is DTD valid.
* @param newNode The new Node to insert.
- * @param parent The parent of the Node.
+ * @param tqparent The tqparent of the Node.
* @param nextSibling The next sibling of the Node.
* @param nextEndSibling The next sibling of the closing Node if created. If nextEndSibling ==
* nextSibling, the closing Node will be placed at the right of the newly created Node.
@@ -320,13 +320,13 @@ public:
* @param modifs The changes made are logged into modifs.
* @return Returns a pointer to the node inserted.
*/
- static Node *insertNode(Node *newNode, Node *parent, Node *nextSibling, Node *nextEndSibling,
+ static Node *insertNode(Node *newNode, Node *tqparent, Node *nextSibling, Node *nextEndSibling,
NodeModifsSet *modifs, bool merge = true);
/**
* It behaves essentially like the above function except that it can split the endNodeToSurround and
* startNodeToSurround if necessary, according to the offsets.
- * startNodeToSurround et endNodeToSurround MUST have the same parent. If not, use the last
+ * startNodeToSurround et endNodeToSurround MUST have the same tqparent. If not, use the last
* DTDinsertNode.
* This function does not try to know if the location of the new Node is valid.
* @param startNodeToSurround The first Node which will be enclosed by the new Node.
@@ -334,7 +334,7 @@ public:
* @param startOffset The first Node will be splitted at offset startOffset, the right part will be enclosed.
* @param endOffset The last Node will be splitted at offset endOffset, the left part will be enclosed.
*/
- static Node* insertNode(Node *newNode, Node *parent, Node *startNodeToSurround,
+ static Node* insertNode(Node *newNode, Node *tqparent, Node *startNodeToSurround,
Node *endNodeToSurround, int startOffset, int endOffset, NodeModifsSet *modifs);
/**
@@ -353,7 +353,7 @@ public:
* @param cursorNode The cursor is inside cursorNode.
* @param cursorOffset The offset of the cursor inside cursorNode.
* </TEMPORARY>
- * @return Returns false if it wasn't possible to insert the tag because e.g. of an invalid parent.
+ * @return Returns false if it wasn't possible to insert the tag because e.g. of an invalid tqparent.
*/
static bool DTDinsertNode(Node *newNode, Node *startNode, int startOffset, Node *endNode,
int endOffset, Document *doc, Node **cursorNode, long &cursorOffset, NodeModifsSet *modifs);
@@ -373,26 +373,26 @@ public:
* WARNING : baseNode is used as the rootNode.
* It will also try to merge text/Empty Nodes.
* @param node The root node of the Node subtree to insert.
- * @param parentNode This Node will be the parent of node.
+ * @param tqparentNode This Node will be the tqparent of node.
* @param nextSibling This Node will be the next Sibling of Node. If null, node will be appended at
- * the child list of parentNode.
+ * the child list of tqparentNode.
* @param modifs The changes made are logged into modifs. Put 0L if you don't want to log
* and if you know what you're doing!
* @param merge Try to merge with the siblings if possible.
* @return Returns a pointer to the node inserted.
*/
- static Node* insertNodeSubtree(Node *node, Node* parentNode, Node* nextSibling,
+ static Node* insertNodeSubtree(Node *node, Node* tqparentNode, Node* nextSibling,
NodeModifsSet *modifs, bool merge = true);
/**
* It behaves essentially like the above function except that it can "surround" a set of Nodes with the
* new Node. Thus, the closing Node is created if necessary.
- * nextSibling and nextEndSibling MUST have the same parent. If not, use the
+ * nextSibling and nextEndSibling MUST have the same tqparent. If not, use the
* DTDinsertNode.
- * The Node Subtree MUST be a single-Node-per-parent subtree.
+ * The Node Subtree MUST be a single-Node-per-tqparent subtree.
* This function does not try to know if the location of the new Node is DTD valid.
* @param node The root node of the Node subtree to insert.
- * @param parent The parent of the Node.
+ * @param tqparent The tqparent of the Node.
* @param nextSibling The next sibling of the Node.
* @param nextEndSibling The next sibling of the closing Node if created. If nextEndSibling ==
* nextSibling, the closing Node will be placed at the right of the newly created Node.
@@ -401,7 +401,7 @@ public:
* @param modifs The changes made are logged into modifs.
* @return Returns a pointer to the node inserted.
*/
- static Node* insertNodeSubtree(Node *node, Node* parentNode, Node* nextSibling,
+ static Node* insertNodeSubtree(Node *node, Node* tqparentNode, Node* nextSibling,
Node* nextEndSibling, NodeModifsSet *modifs, bool merge = true);
/**
@@ -414,7 +414,7 @@ public:
static Node* DTDInsertNodeSubtree(Node *node, NodeSelectionInd& selection,
Node **cursorNode, long& cursorOffset, NodeModifsSet *modifs);
- static Node* DTDInsertNodeSubtree(Node* newNode, Node* parentNode, Node* nextSibling,
+ static Node* DTDInsertNodeSubtree(Node* newNode, Node* tqparentNode, Node* nextSibling,
NodeSelection& cursorHolder, NodeModifsSet *modifs);
/**
@@ -425,17 +425,17 @@ public:
* @param tagString The string of the tag.
* @param nodeType The type of the Node cf Tag::TokenType.
* @param doc The Node belongs to this Document.
- * @param parent The parent of the Node.
+ * @param tqparent The tqparent of the Node.
* @param nextSibling The next sibling of the Node.
* @return Returns a pointer to the newly created Node.
*/
static Node *createAndInsertNode(const TQString &nodeName, const TQString &tagString, int nodeType,
- Document *doc, Node* parent, Node* nextSibling, NodeModifsSet *modifs, bool merge = true);
+ Document *doc, Node* tqparent, Node* nextSibling, NodeModifsSet *modifs, bool merge = true);
/**
* It behaves essentially like the above function except that it reate its closing Node if necessary
- * and then insert them with parent as Node's parent.
- * nextSibling and nextEndSibling MUST have the same parent. If not, use the
+ * and then insert them with tqparent as Node's tqparent.
+ * nextSibling and nextEndSibling MUST have the same tqparent. If not, use the
* DTDcreateAndInsertNode.
* @param nextEndSibling The next sibling of the closing Node if created. If nextEndSibling ==
* nextSibling, the closing Node will be placed at the right of the newly created Node.
@@ -443,11 +443,11 @@ public:
* @param modifs The changes made are logged into modifs.
*/
static Node *createAndInsertNode(const TQString &nodeName, const TQString &tagString, int nodeType,
- Document *doc, Node *parent, Node *nextSibling, Node *nextEndSibling, NodeModifsSet *modifs);
+ Document *doc, Node *tqparent, Node *nextSibling, Node *nextEndSibling, NodeModifsSet *modifs);
/**
* It behaves essentially like the above function except that if necessary, it will split the Nodes.
- * startNodeToSurround et endNodeToSurround MUST have the same parent. If not, use the
+ * startNodeToSurround et endNodeToSurround MUST have the same tqparent. If not, use the
* DTDcreateAndInsertNode.
* This function does not try to know if the location of the new Node is valid.
* @param startNodeToSurround The first Node which will be enclosed by the new Node.
@@ -456,7 +456,7 @@ public:
* @param endOffset The last Node will be splitted at offset endOffset, the left part will be enclosed.
*/
static Node *createAndInsertNode(const TQString &nodeName, const TQString &tagString,
- int nodeType, Document *doc, Node *parent, Node *startNodeToSurround,
+ int nodeType, Document *doc, Node *tqparent, Node *startNodeToSurround,
Node *endNodeToSurround, int startOffset, int endOffset, NodeModifsSet *modifs);
/**
@@ -470,7 +470,7 @@ public:
* @param startOffset If firstNode is a text, specify at which offset the new Node must begin to surround.
* @param endNode The last Node which must be surrounded by the new Node.
* @param endOffset If endNode is a text, specify at which offset the new Node must stop to surround.
- * @return Returns false if it wasn't possible to insert the tag because e.g. of an invalid parent.
+ * @return Returns false if it wasn't possible to insert the tag because e.g. of an invalid tqparent.
*/
static bool DTDcreateAndInsertNode(const TQString &nodeName, const TQString &tagString, int nodeType,
Document *doc, Node *startNode, int startOffset, Node *endNode, int endOffset,
@@ -522,8 +522,8 @@ public:
* This mean that the undo/redo system will delete it when necessary so don't reuse it!!!!
* @param node The node to delete.
* @param modifs The changes made are logged into modifs.
- * @param extractChilds If we extract or move up the children. WARNING: it don't check
- * if the children of node are legal childs of the parent of node.
+ * @param extractChilds If we extract or move up the tqchildren. WARNING: it don't check
+ * if the tqchildren of node are legal childs of the tqparent of node.
* @param removeClosingTag Extract the closingTag if node isn't single and is Tag::XmlTag.
* TODO: @param removeEmbeddedTags Specifies if we delete the embedded Nodes e.g.
* <a href="<? boo ?>" > : the PHP block is an embedded block.
@@ -544,7 +544,7 @@ public:
/**
* Extract a node subtree in the tree. WARNING This function will log that the nodes were added.
- * This funtion not only extract the start node but also will extract inline parents.
+ * This funtion not only extract the start node but also will extract inline tqparents.
* @param startNode The node from which we start the removal.
* @param startOffset The offset of startNode from which we start the removal.
* @param endNode The node from which we end the removal.
@@ -576,7 +576,7 @@ public:
* Get a node subtree from the tree. It is similar to extractNodeSubtree()
* but it doesn't extract anything.
* It's useful to get a copy of the Node subtree from a selection, for example.
- * This funtion not only extract the start node but also will extract inline parents.
+ * This funtion not only extract the start node but also will extract inline tqparents.
* @param startNode The starting Node.
* @param startOffset If firstNode is a text, specify at which offset the new start Node will be splitted.
* @param endNode The ending Node.
@@ -588,12 +588,12 @@ public:
/**
* An enumeration of all the possible return states of DTDExtractNode
*/
- enum extractNodeStatus
+ enum extractNodetqStatus
{
//The node to extract was not found.
nothingExtracted = 0,
//The extract operation stopped because of a DTD error : if the node was removed, the child
- //weren't able to be childs of the node's parent, according to the DTD. Should not occur
+ //weren't able to be childs of the node's tqparent, according to the DTD. Should not occur
//except really bad HTML.
extractionStoppedDueToBadNodes,
//everything has gone fine
@@ -619,7 +619,7 @@ public:
* @param cursorOffset The offset of the cursor inside cursorNode.
* </TEMPORARY>
* @param modifs The usual modifs to log the modifications made for the undo/redo system.
- * @return Returns a kafkaCommon::extractNodeStatus.
+ * @return Returns a kafkaCommon::extractNodetqStatus.
*/
static int DTDExtractNode(const TQString &nodeName, Document *doc, Node *startNode,
int startOffset, Node *endNode, int endOffset, Node **cursorNode, long &cursorOffset,
@@ -628,9 +628,9 @@ public:
/**
* Moves a Node somewhere else.
* @param nodeToMove The node to move :-)
- * @param newParent The new parent of nodeToMove.
+ * @param newParent The new tqparent of nodeToMove.
* @param newNextSibling The new next Sibling of nodeToMove. If null, node will be appended at
- * the child list of parentNode.
+ * the child list of tqparentNode.
* @param modifs The changes made are logged into modifs.
* @param merge Specifies if it should try to merge the Node at its new location.
*/
@@ -695,10 +695,10 @@ public:
* @param startOffset
* @param endNode The node where a selection ends, for example.
* @param endOffset
- * @param commonParent This is the common parent between start and end node.
+ * @param commonParent This is the common tqparent between start and end node.
* If 0, it tries to find the commonParent, else it uses the passed node.
- * @param commonParentStartChildLocation The first child of commonParent which is parent of startNode is stored here.
- * @param commonParentEndChildLocation The first child of commonParent which is parent of endNode is stored here.
+ * @param commonParentStartChildLocation The first child of commonParent which is tqparent of startNode is stored here.
+ * @param commonParentEndChildLocation The first child of commonParent which is tqparent of endNode is stored here.
* @param cursorNode The cursor node is stored here.
* @param cursorOffset The cursor offset is stored here.
* @param subTree The node corresponding to the start of a subtree that doesn't belong to the current document, or 0.
@@ -809,8 +809,8 @@ public:
/**
* Get the node corresponding to a sublocation.
* @param loc A location of a Node.
- * @locOffset We want the (totalNumberOfParent - locOffset)th parent of Node.
- * @return Returns a parent of the node pointed by loc.
+ * @locOffset We want the (totalNumberOfParent - locOffset)th tqparent of Node.
+ * @return Returns a tqparent of the node pointed by loc.
*/
static Node* getNodeFromSubLocation(TQValueList<int> loc, int locOffset);
@@ -855,19 +855,19 @@ public:
/**
* Get the node's depth in the tree.
* @param node The node we want the depth.
- * @return Returns the depth of node. It is basically the number of parents of node.
- * It will return 0 if node has no parent Nodes, and -1 if node doesn't exists.
+ * @return Returns the depth of node. It is basically the number of tqparents of node.
+ * It will return 0 if node has no tqparent Nodes, and -1 if node doesn't exists.
*/
static int nodeDepth(Node *node);
/**
- * Looks if node has a parent which is named name.
- * @return Returns the first parent which is named name or 0L if not found.
+ * Looks if node has a tqparent which is named name.
+ * @return Returns the first tqparent which is named name or 0L if not found.
*/
static Node* hasParent(Node *node, const TQString &name);
/**
- * Tries to find the common parent to startNode and endNode, in the same conditions as above.
+ * Tries to find the common tqparent to startNode and endNode, in the same conditions as above.
*/
static Node* hasParent(Node* startNode, Node* endNode, const TQString &name);
@@ -879,12 +879,12 @@ public:
* WARNING : The postEnhancement is not done (cf htmlenhancer.h)
* Prefer using KafkaDocument::insertDomNode()
* @param node The node to insert.
- * @param parent The new parent of node. If null, insert node at the top level.
+ * @param tqparent The new tqparent of node. If null, insert node at the top level.
* @param nextSibling The new next sibling of node. If null, append node at the end of the child list.
- * @param rootNode The root DOM::Node of the DOM::Node tree. Useful when no parent is provided.
+ * @param rootNode The root DOM::Node of the DOM::Node tree. Useful when no tqparent is provided.
* @return Returns true if the operation was successfull.
*/
- static bool insertDomNode(DOM::Node node, DOM::Node parent = DOM::Node(),
+ static bool insertDomNode(DOM::Node node, DOM::Node tqparent = DOM::Node(),
DOM::Node nextSibling = DOM::Node(), DOM::Node rootNode = DOM::Node());
@@ -978,25 +978,25 @@ public:
const TQString &attrName, const TQString &attrValue, DOM::Document rootNode);
/**
- * Looks if domNode has a parent which is named name.
- * @return Returns the first parent which is named name or an empty DOM::Node if not found.
+ * Looks if domNode has a tqparent which is named name.
+ * @return Returns the first tqparent which is named name or an empty DOM::Node if not found.
*/
static DOM::Node hasParent(DOM::Node domNode, const TQString &name);
/**
* Returns the position of the child domNode.
* @param domNode This is the DOM::Node we want the position.
- * @return Returns the position of domNode inside domNode's parent's children or -1 if not found.
+ * @return Returns the position of domNode inside domNode's tqparent's tqchildren or -1 if not found.
*/
static int childPosition(DOM::Node domNode);
/**
- * Returns the position'th child of parentNode.
- * @param parentNode The parent Node of the node to return.
+ * Returns the position'th child of tqparentNode.
+ * @param tqparentNode The tqparent Node of the node to return.
* @param position We return the position'th child Node.
* @param fallback If set to true, it will always return a valid Node (except if there is no child!!)
*/
- static DOM::Node getChildNode(DOM::Node parentNode, int position, bool fallback = false);
+ static DOM::Node getChildNode(DOM::Node tqparentNode, int position, bool fallback = false);
/**
* Specify if a DOM::Node is inline (as specified in isInline()) or text.
@@ -1005,10 +1005,10 @@ public:
static bool isInline(DOM::Node domNode);
/**
- * Specify if parent supports the siblings DOM::Nodes starting from startNode to endNode
+ * Specify if tqparent supports the siblings DOM::Nodes starting from startNode to endNode
* according to the DTD dtd.
*/
- static bool parentSupports(DOM::Node parent, DOM::Node startNode, DOM::Node endNode,
+ static bool tqparentSupports(DOM::Node tqparent, DOM::Node startNode, DOM::Node endNode,
const DTDStruct* dtd);
@@ -1030,7 +1030,7 @@ public:
/**
* Prints in stdout the current Node tree.
* @param node The startNode
- * @param indent The number of little dots per parent relationship.
+ * @param indent The number of little dots per tqparent relationship.
*/
static void coutTree(Node *node, int indent);
@@ -1085,7 +1085,7 @@ public:
private:
/**
- * Split the last valid start parent (commonParentStartChild) into two.
+ * Split the last valid start tqparent (commonParentStartChild) into two.
* This and the method above are related and are used in sequence.
* The following tree:
* <body>
@@ -1120,14 +1120,14 @@ private:
* </b>
* </body>
* @param startNode The node where a selection starts, for example.
- * @param commonParent This is the common parent between start and end node.
- * @param commonParentStartChildLocation The first child of commonParent which is parent of startNode
+ * @param commonParent This is the common tqparent between start and end node.
+ * @param commonParentStartChildLocation The first child of commonParent which is tqparent of startNode
* @param modifs The changes made are logged into modifs.
*/
static void splitStartNodeSubtree(Node* startNode, Node* commonParent,
TQValueList<int>& commonParentStartChildLocation, NodeModifsSet* modifs);
/**
- * Split the last valid start parent (commonParentStartChild) into two.
+ * Split the last valid start tqparent (commonParentStartChild) into two.
* The following tree:
* <body>
* <b> --> commonParent
@@ -1162,9 +1162,9 @@ private:
* </b>
* </body>
* @param endNode The node where a selection ends, for example.
- * @param commonParent This is the common parent between start and end node.
- * @param commonParentStartChildLocation The first child of commonParent which is parent of startNode.
- * @param commonParentEndChildLocation The first child of commonParent which is parent of endNode.
+ * @param commonParent This is the common tqparent between start and end node.
+ * @param commonParentStartChildLocation The first child of commonParent which is tqparent of startNode.
+ * @param commonParentEndChildLocation The first child of commonParent which is tqparent of endNode.
* @param subTree True if we are dealing with a tree that doesn't belong to the current document.
* @param modifs The changes made are logged into modifs.
*/