summaryrefslogtreecommitdiffstats
path: root/libktorrent/torrent/bnode.h
diff options
context:
space:
mode:
authortpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-06-28 20:34:15 +0000
committertpearson <tpearson@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>2011-06-28 20:34:15 +0000
commit1c1403293485f35fd53db45aaa77a01cdd9627e7 (patch)
tree38559cd68cd4f63023fb5f6375def9db3b8b491e /libktorrent/torrent/bnode.h
parent894f94545727610df22c4f73911d62d58266f695 (diff)
downloadktorrent-1c1403293485f35fd53db45aaa77a01cdd9627e7.tar.gz
ktorrent-1c1403293485f35fd53db45aaa77a01cdd9627e7.zip
TQt4 port ktorrent
This enables compilation under both Qt3 and Qt4 git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/applications/ktorrent@1238733 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
Diffstat (limited to 'libktorrent/torrent/bnode.h')
-rw-r--r--libktorrent/torrent/bnode.h28
1 files changed, 14 insertions, 14 deletions
diff --git a/libktorrent/torrent/bnode.h b/libktorrent/torrent/bnode.h
index 685291c..ccd2c94 100644
--- a/libktorrent/torrent/bnode.h
+++ b/libktorrent/torrent/bnode.h
@@ -20,8 +20,8 @@
#ifndef BTBNODE_H
#define BTBNODE_H
-#include <qptrlist.h>
-#include <qvaluelist.h>
+#include <tqptrlist.h>
+#include <tqvaluelist.h>
#include <util/constants.h>
#include "value.h"
@@ -77,7 +77,7 @@ namespace bt
* @author Joris Guisson
* @brief Represents a value (string,bytearray or int) in bencoded data
*
- * @todo Use QVariant
+ * @todo Use TQVariant
*/
class BValueNode : public BNode
{
@@ -99,10 +99,10 @@ namespace bt
{
struct DictEntry
{
- QByteArray key;
+ TQByteArray key;
BNode* node;
};
- QValueList<DictEntry> children;
+ TQValueList<DictEntry> tqchildren;
public:
BDictNode(Uint32 off);
virtual ~BDictNode();
@@ -112,42 +112,42 @@ namespace bt
* @param key The key
* @param node The node
*/
- void insert(const QByteArray & key,BNode* node);
+ void insert(const TQByteArray & key,BNode* node);
/**
* Get a BNode.
* @param key The key
* @return The node or 0 if there is no node with has key @a key
*/
- BNode* getData(const QString & key);
+ BNode* getData(const TQString & key);
/**
* Get a BListNode.
* @param key The key
* @return The node or 0 if there is no list node with has key @a key
*/
- BListNode* getList(const QString & key);
+ BListNode* getList(const TQString & key);
/**
* Get a BDictNode.
* @param key The key
* @return The node or 0 if there is no dict node with has key @a key
*/
- BDictNode* getDict(const QString & key);
+ BDictNode* getDict(const TQString & key);
/**
* Get a BDictNode.
* @param key The key
* @return The node or 0 if there is no dict node with has key @a key
*/
- BDictNode* getDict(const QByteArray & key);
+ BDictNode* getDict(const TQByteArray & key);
/**
* Get a BValueNode.
* @param key The key
* @return The node or 0 if there is no value node with has key @a key
*/
- BValueNode* getValue(const QString & key);
+ BValueNode* getValue(const TQString & key);
void printDebugInfo();
};
@@ -159,7 +159,7 @@ namespace bt
*/
class BListNode : public BNode
{
- QPtrList<BNode> children;
+ TQPtrList<BNode> tqchildren;
public:
BListNode(Uint32 off);
virtual ~BListNode();
@@ -172,14 +172,14 @@ namespace bt
void printDebugInfo();
/// Get the number of nodes in the list.
- Uint32 getNumChildren() const {return children.count();}
+ Uint32 getNumChildren() const {return tqchildren.count();}
/**
* Get a node from the list
* @param idx The index
* @return The node or 0 if idx is out of bounds
*/
- BNode* getChild(Uint32 idx) {return children.at(idx);}
+ BNode* getChild(Uint32 idx) {return tqchildren.at(idx);}
/**
* Get a BListNode.