summaryrefslogtreecommitdiffstats
path: root/quanta/parts/kafka/kafkacommon.h
diff options
context:
space:
mode:
authortpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2010-07-31 19:54:04 +0000
committertpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2010-07-31 19:54:04 +0000
commitdc6b8e72fed2586239e3514819238c520636c9d9 (patch)
tree88b200df0a0b7fab9d6f147596173556f1ed9a13 /quanta/parts/kafka/kafkacommon.h
parent6927d4436e54551917f600b706a8d6109e49de1c (diff)
downloadtdewebdev-dc6b8e72fed2586239e3514819238c520636c9d9.tar.gz
tdewebdev-dc6b8e72fed2586239e3514819238c520636c9d9.zip
Trinity Qt initial conversion
git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdewebdev@1157656 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'quanta/parts/kafka/kafkacommon.h')
-rw-r--r--quanta/parts/kafka/kafkacommon.h94
1 files changed, 47 insertions, 47 deletions
diff --git a/quanta/parts/kafka/kafkacommon.h b/quanta/parts/kafka/kafkacommon.h
index d71783aa..7de7d77e 100644
--- a/quanta/parts/kafka/kafkacommon.h
+++ b/quanta/parts/kafka/kafkacommon.h
@@ -18,7 +18,7 @@
#ifndef KAFKACOMMON_H
#define KAFKACOMMON_H
-#include <qvaluelist.h>
+#include <tqvaluelist.h>
#include <dom/dom_node.h>
namespace DOM
@@ -96,15 +96,15 @@ public:
* @return The first, non inline, common parent of startNode and endNode.
*/
static Node* DTDGetNonInlineCommonParent(Node* startNode, Node* endNode,
- QValueList<int>& commonParentStartChildLocation,
- QValueList<int>& commonParentEndChildLocation, Node* nodeSubtree);
+ TQValueList<int>& commonParentStartChildLocation,
+ TQValueList<int>& commonParentEndChildLocation, Node* nodeSubtree);
/**
* Same as above, only that the common parent can be inline.
*/
static Node* DTDGetCommonParent(Node* startNode, Node* endNode,
- QValueList<int>& commonParentStartChildLocation,
- QValueList<int>& commonParentEndChildLocation, Node* nodeSubtree);
+ TQValueList<int>& commonParentStartChildLocation,
+ TQValueList<int>& commonParentEndChildLocation, Node* nodeSubtree);
/**
* This function returns the next DOM::Node after node : the first child of
@@ -184,7 +184,7 @@ public:
/**
* Create/Delete the necessary Empty Nodes between n1 and n2 so that a nice indentation can be
* 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 QValueList<int>
+ * 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,
* n1 should not have non empty childs.
@@ -237,7 +237,7 @@ public:
* unlike the above example.
* @return Returns the modified string.
*/
- static QString removeUnnecessaryWhitespaces(const QString &string,
+ static TQString removeUnnecessaryWhitespaces(const TQString &string,
bool removeAllSpacesAtTheLeft = false, bool removeAllSpacesAtTheRight = false);
@@ -251,7 +251,7 @@ public:
* @param doc The document the Node will belong to.
* @return Returns the newly created node.
*/
- static Node* createNode(const QString &nodeName, const QString &tagString, int nodeType,
+ static Node* createNode(const TQString &nodeName, const TQString &tagString, int nodeType,
Document *doc);
/**
@@ -273,7 +273,7 @@ public:
* @param doc It needs the document where the xml node will be inserted.
* @param encoding The encoding to use (usually get it with quantaApp->defaultEncoding())
*/
- static Node *createXmlDeclarationNode(Document *doc, const QString &encoding);
+ static Node *createXmlDeclarationNode(Document *doc, const TQString &encoding);
/**
* Create a node subtree which contains the mandatory Nodes in order to be DTD compliant.
@@ -429,7 +429,7 @@ public:
* @param nextSibling The next sibling of the Node.
* @return Returns a pointer to the newly created Node.
*/
- static Node *createAndInsertNode(const QString &nodeName, const QString &tagString, int nodeType,
+ static Node *createAndInsertNode(const TQString &nodeName, const TQString &tagString, int nodeType,
Document *doc, Node* parent, Node* nextSibling, NodeModifsSet *modifs, bool merge = true);
/**
@@ -442,7 +442,7 @@ public:
* All the Nodes between the new Node and its closing Tag will be moved as childs of the new Node.
* @param modifs The changes made are logged into modifs.
*/
- static Node *createAndInsertNode(const QString &nodeName, const QString &tagString, int nodeType,
+ static Node *createAndInsertNode(const TQString &nodeName, const TQString &tagString, int nodeType,
Document *doc, Node *parent, Node *nextSibling, Node *nextEndSibling, NodeModifsSet *modifs);
/**
@@ -455,7 +455,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 *createAndInsertNode(const QString &nodeName, const QString &tagString,
+ static Node *createAndInsertNode(const TQString &nodeName, const TQString &tagString,
int nodeType, Document *doc, Node *parent, Node *startNodeToSurround,
Node *endNodeToSurround, int startOffset, int endOffset, NodeModifsSet *modifs);
@@ -472,7 +472,7 @@ public:
* @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.
*/
- static bool DTDcreateAndInsertNode(const QString &nodeName, const QString &tagString, int nodeType,
+ static bool DTDcreateAndInsertNode(const TQString &nodeName, const TQString &tagString, int nodeType,
Document *doc, Node *startNode, int startOffset, Node *endNode, int endOffset,
Node **cursorNode, long &cursorOffset, NodeModifsSet *modifs);
@@ -621,7 +621,7 @@ public:
* @param modifs The usual modifs to log the modifications made for the undo/redo system.
* @return Returns a kafkaCommon::extractNodeStatus.
*/
- static int DTDExtractNode(const QString &nodeName, Document *doc, Node *startNode,
+ static int DTDExtractNode(const TQString &nodeName, Document *doc, Node *startNode,
int startOffset, Node *endNode, int endOffset, Node **cursorNode, long &cursorOffset,
NodeModifsSet *modifs);
@@ -705,8 +705,8 @@ public:
* @param modifs The changes made are logged into modifs.
*/
static void splitStartAndEndNodeSubtree(Node*& startNode, int startOffset, Node*& endNode, int endOffset, Node*& commonParent,
- QValueList<int>& commonParentStartChildLocation,
- QValueList<int>& commonParentEndChildLocation,
+ TQValueList<int>& commonParentStartChildLocation,
+ TQValueList<int>& commonParentEndChildLocation,
NodeSelection& cursorHolder,
Node* subTree, NodeModifsSet* modifs, bool extractInlineParentNodes = true);
@@ -746,7 +746,7 @@ public:
* @param eLine Returns the line of the last letter of tagString.
* @param eCol Returns the col of the last letter of tagString.
*/
- static void getEndPosition(const QString & tagString, int bLine, int bCol, int &eLine, int &eCol);
+ static void getEndPosition(const TQString & tagString, int bLine, int bCol, int &eLine, int &eCol);
/**
* It behaves essentially like the above function except that the string is the Tag String of Node.
@@ -760,18 +760,18 @@ public:
* @param newTagString The new tag String :-)
* @param modifs The changes made are logged into modifs.
*/
- static void setTagString(Node *node, const QString &newTagString, NodeModifsSet* modifs);
+ static void setTagString(Node *node, const TQString &newTagString, NodeModifsSet* modifs);
/**
* This function behaves essentially like the above function except that all the others Nodes' position
* are updated too.
*/
- static void setTagStringAndFitsNodes(Node *node, const QString &newTagString, NodeModifsSet* modifs);
+ static void setTagStringAndFitsNodes(Node *node, const TQString &newTagString, NodeModifsSet* modifs);
/**
* This function behaves exactly like Node::editAttribute except that the change is logged inside a NodeModifsSet.
*/
- static void editNodeAttribute(Node* node, const QString& name, const QString& value, NodeModifsSet* modifs);
+ static void editNodeAttribute(Node* node, const TQString& name, const TQString& value, NodeModifsSet* modifs);
/**
* Gets the location of a Node in a pointer-independant suit of ints e.g. 1,3,5 means
@@ -780,31 +780,31 @@ public:
* @param node The Node we want the location.
* @return Returns the location.
*/
- static QValueList<int> getLocation(Node* node);
+ static TQValueList<int> getLocation(Node* node);
/**
* It behaves essentially like the above function except that it operate on DOM::Nodes.
*/
- static QValueList<int> getLocation(DOM::Node domNode);
+ static TQValueList<int> getLocation(DOM::Node domNode);
/**
* Get the node corresponding to a location. See the above function.
* @param loc We want the Node from this location.
* @return Returns the Node at location loc.
*/
- static Node* getNodeFromLocation(QValueList<int> loc);
+ static Node* getNodeFromLocation(TQValueList<int> loc);
/**
* Similar to the above function but instead of using baseNode it uses the passes Node tree.
* @param nodeTree Node tree where to get the location.
*/
- static Node* getNodeFromLocation(QValueList<int> loc, Node* nodeTree);
+ static Node* getNodeFromLocation(TQValueList<int> loc, Node* nodeTree);
/**
* It behaves essentially like the above function except that it operate on DOM::Nodes.
* @rootNode It needs the root Node of the DOM::Node Tree i.e. the document() Node.
*/
- static DOM::Node getNodeFromLocation(QValueList<int> loc, DOM::Node rootNode);
+ static DOM::Node getNodeFromLocation(TQValueList<int> loc, DOM::Node rootNode);
/**
* Get the node corresponding to a sublocation.
@@ -812,9 +812,9 @@ public:
* @locOffset We want the (totalNumberOfParent - locOffset)th parent of Node.
* @return Returns a parent of the node pointed by loc.
*/
- static Node* getNodeFromSubLocation(QValueList<int> loc, int locOffset);
+ static Node* getNodeFromSubLocation(TQValueList<int> loc, int locOffset);
- static Node* getNodeFromSubLocation(QValueList<int> loc, int locOffset, Node* nodeTree);
+ static Node* getNodeFromSubLocation(TQValueList<int> loc, int locOffset, Node* nodeTree);
/**
* A enumeration for kafkaCommon::compareNodePosition().
@@ -839,7 +839,7 @@ public:
* @param pos2 The location of the Node to be compared to.
* @return Return a kafkaCommon::position flag.
*/
- static int compareNodePosition(QValueList<int> pos1, QValueList<int> pos2);
+ static int compareNodePosition(TQValueList<int> pos1, TQValueList<int> pos2);
/**
* It behave essentially like the above function except that it is based on Nodes.
@@ -864,12 +864,12 @@ public:
* Looks if node has a parent which is named name.
* @return Returns the first parent which is named name or 0L if not found.
*/
- static Node* hasParent(Node *node, const QString &name);
+ static Node* hasParent(Node *node, const TQString &name);
/**
* Tries to find the common parent to startNode and endNode, in the same conditions as above.
*/
- static Node* hasParent(Node* startNode, Node* endNode, const QString &name);
+ static Node* hasParent(Node* startNode, Node* endNode, const TQString &name);
/** ----------------- DOM::NODE TREE MODIFICATIONS --------------------*/
@@ -907,7 +907,7 @@ public:
* @param rootNode The rootNode is needed in order to create a new DOM::Node.
* @return Returns the DOM::Node created or a null DOM::Node if nodeName is invalid.
*/
- static DOM::Node createDomNode(const QString &nodeName, const DTDStruct* dtd, DOM::Document rootNode);
+ static DOM::Node createDomNode(const TQString &nodeName, const DTDStruct* dtd, DOM::Document rootNode);
/**
* It behaves essentially like the above function.
@@ -921,7 +921,7 @@ public:
* @param rootNode The rootNode is needed in order to create a new Text DOM::Node.
* @return a new text DOM::Node.
*/
- static DOM::Node createTextDomNode(const QString &textString, DOM::Document rootNode);
+ static DOM::Node createTextDomNode(const TQString &textString, DOM::Document rootNode);
/**
* Create a new attribute and check if the attrName can have this attribute.
@@ -932,21 +932,21 @@ public:
* @param rootNode The rootNode is needed in order to create a new Attribute.
* @return Returns the new Attribute or a null DOM::Node if attrName is invalid.
*/
- static DOM::Node createDomNodeAttribute(const QString &nodeName, const DTDStruct* dtd,
- const QString &attrName, const QString &attrValue, DOM::Document rootNode);
+ static DOM::Node createDomNodeAttribute(const TQString &nodeName, const DTDStruct* dtd,
+ const TQString &attrName, const TQString &attrValue, DOM::Document rootNode);
/**
* It behaves essentially like the above function.
* @param node The corresponding DOM::Node of node will get the attribute. It don't add the attribute.
*/
- static DOM::Node createDomNodeAttribute(Node* node, const QString &attrName, DOM::Document rootNode);
+ static DOM::Node createDomNodeAttribute(Node* node, const TQString &attrName, DOM::Document rootNode);
/**
* It behaves essentially like the above function except that it use the DOM::Node->Node* link to get the
* corresponding Node. So be sure that the link is set.
* @param node The node which will get the attribute. It don't add the attribute.
*/
- //static DOM::node createDomNodeAttribute(DOM::Node node, const QString &attrName,
+ //static DOM::node createDomNodeAttribute(DOM::Node node, const TQString &attrName,
// DOM::Document rootNode);
/**
@@ -967,21 +967,21 @@ public:
* @param rootNode The rootNode is needed in order to create a new Attribute.
* @return Returns if the operation was successfull.
*/
- static bool editDomNodeAttribute(DOM::Node node, const QString &nodeName, const DTDStruct* dtd,
- const QString &attrName, const QString &attrValue, DOM::Document rootNode);
+ static bool editDomNodeAttribute(DOM::Node node, const TQString &nodeName, const DTDStruct* dtd,
+ const TQString &attrName, const TQString &attrValue, DOM::Document rootNode);
/**
* It behaves essentially like the above function.
* @param node The DOM::Node comes from this node.
*/
static bool editDomNodeAttribute(DOM::Node domNode, Node* node,
- const QString &attrName, const QString &attrValue, DOM::Document rootNode);
+ 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.
*/
- static DOM::Node hasParent(DOM::Node domNode, const QString &name);
+ static DOM::Node hasParent(DOM::Node domNode, const TQString &name);
/**
* Returns the position of the child domNode.
@@ -1018,7 +1018,7 @@ public:
* TEMPORARY, HTML specific
* @return Returns true if it is a inline Node. Official DTD List, unlike getNodeDisplay().
*/
- static bool isInline(const QString &nodename);
+ static bool isInline(const TQString &nodename);
/**
* Prints in stdout the current DOM::Node tree.
@@ -1043,10 +1043,10 @@ public:
* 1 is inside tag_name
* 0 mixed
*/
- static int isInsideTag(Node* start_node, Node* end_node, QString const& tag_name);
+ static int isInsideTag(Node* start_node, Node* end_node, TQString const& tag_name);
- static int isInsideTag(Node* start_node, Node* end_node, QString const& tag_name,
- QString const& attribute_name, QString const& attribute_value);
+ static int isInsideTag(Node* start_node, Node* end_node, TQString const& tag_name,
+ TQString const& attribute_name, TQString const& attribute_value);
/**
* Return whether the offset is placed between two words in a text node.
@@ -1125,7 +1125,7 @@ private:
* @param modifs The changes made are logged into modifs.
*/
static void splitStartNodeSubtree(Node* startNode, Node* commonParent,
- QValueList<int>& commonParentStartChildLocation, NodeModifsSet* modifs);
+ TQValueList<int>& commonParentStartChildLocation, NodeModifsSet* modifs);
/**
* Split the last valid start parent (commonParentStartChild) into two.
* The following tree:
@@ -1169,8 +1169,8 @@ private:
* @param modifs The changes made are logged into modifs.
*/
static void splitEndNodeSubtree(Node* endNode, Node* commonParent,
- QValueList<int>& commonParentStartChildLocation,
- QValueList<int>& commonParentEndChildLocation,
+ TQValueList<int>& commonParentStartChildLocation,
+ TQValueList<int>& commonParentEndChildLocation,
bool subTree, NodeModifsSet* modifs);
};