diff options
Diffstat (limited to 'libktorrent/torrent/bnode.cpp')
| -rw-r--r-- | libktorrent/torrent/bnode.cpp | 177 |
1 files changed, 177 insertions, 0 deletions
diff --git a/libktorrent/torrent/bnode.cpp b/libktorrent/torrent/bnode.cpp new file mode 100644 index 0000000..e76dcf3 --- /dev/null +++ b/libktorrent/torrent/bnode.cpp @@ -0,0 +1,177 @@ +/*************************************************************************** + * Copyright (C) 2005 by Joris Guisson * + * [email protected] * + * * + * This program is free software; you can redistribute it and/or modify * + * it under the terms of the GNU General Public License as published by * + * the Free Software Foundation; either version 2 of the License, or * + * (at your option) any later version. * + * * + * This program is distributed in the hope that it will be useful, * + * but WITHOUT ANY WARRANTY; without even the implied warranty of * + * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * + * GNU General Public License for more details. * + * * + * You should have received a copy of the GNU General Public License * + * along with this program; if not, write to the * + * Free Software Foundation, Inc., * + * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * + ***************************************************************************/ +#include <util/log.h> +#include "bnode.h" +#include "globals.h" + +namespace bt +{ + + BNode::BNode(Type type,Uint32 off) : type(type),off(off),len(0) + { + } + + + BNode::~BNode() + {} + + //////////////////////////////////////////////// + + BValueNode::BValueNode(const Value & v,Uint32 off) : BNode(VALUE,off),v(v) + {} + + BValueNode::~BValueNode() + {} + + void BValueNode::printDebugInfo() + { + if (v.getType() == Value::INT) + Out() << "Value = " << v.toInt() << endl; + else + Out() << "Value = " << v.toString() << endl; + } + + //////////////////////////////////////////////// + + BDictNode::BDictNode(Uint32 off) : BNode(DICT,off) + { + } + + BDictNode::~BDictNode() + { + QValueList<DictEntry>::iterator i = children.begin(); + while (i != children.end()) + { + DictEntry & e = *i; + delete e.node; + i++; + } + } + + void BDictNode::insert(const QByteArray & key,BNode* node) + { + DictEntry entry; + entry.key = key; + entry.node = node; + children.append(entry); + } + + BNode* BDictNode::getData(const QString & key) + { + QValueList<DictEntry>::iterator i = children.begin(); + while (i != children.end()) + { + DictEntry & e = *i; + if (QString(e.key) == key) + return e.node; + i++; + } + return 0; + } + + BDictNode* BDictNode::getDict(const QByteArray & key) + { + QValueList<DictEntry>::iterator i = children.begin(); + while (i != children.end()) + { + DictEntry & e = *i; + if (e.key == key) + return dynamic_cast<BDictNode*>(e.node); + i++; + } + return 0; + } + + BListNode* BDictNode::getList(const QString & key) + { + BNode* n = getData(key); + return dynamic_cast<BListNode*>(n); + } + + BDictNode* BDictNode::getDict(const QString & key) + { + BNode* n = getData(key); + return dynamic_cast<BDictNode*>(n); + } + + BValueNode* BDictNode::getValue(const QString & key) + { + BNode* n = getData(key); + return dynamic_cast<BValueNode*>(n); + } + + void BDictNode::printDebugInfo() + { + Out() << "DICT" << endl; + QValueList<DictEntry>::iterator i = children.begin(); + while (i != children.end()) + { + DictEntry & e = *i; + Out() << QString(e.key) << ": " << endl; + e.node->printDebugInfo(); + i++; + } + Out() << "END" << endl; + } + + //////////////////////////////////////////////// + + BListNode::BListNode(Uint32 off) : BNode(LIST,off) + { + children.setAutoDelete(true); + } + + + BListNode::~BListNode() + {} + + + void BListNode::append(BNode* node) + { + children.append(node); + } + + BListNode* BListNode::getList(Uint32 idx) + { + return dynamic_cast<BListNode*>(getChild(idx)); + } + + BDictNode* BListNode::getDict(Uint32 idx) + { + return dynamic_cast<BDictNode*>(getChild(idx)); + } + + BValueNode* BListNode::getValue(Uint32 idx) + { + return dynamic_cast<BValueNode*>(getChild(idx)); + } + + void BListNode::printDebugInfo() + { + Out() << "LIST " << children.count() << endl; + for (Uint32 i = 0;i < children.count();i++) + { + BNode* n = children.at(i); + n->printDebugInfo(); + } + Out() << "END" << endl; + } +} + |