1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
/***************************************************************************
* Copyright (C) 2005 by Joris Guisson *
* joris.guisson@gmail.com *
* *
* 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. *
***************************************************************************/
#ifndef BTBDECODER_H
#define BTBDECODER_H
#include <tqstring.h>
#include <util/constants.h>
namespace bt
{
class BNode;
class BListNode;
class BDictNode;
class BValueNode;
/**
* @author Joris Guisson
* @brief Decodes b-encoded data
*
* Class to decode b-encoded data.
*/
class BDecoder
{
const TQByteArray & data;
Uint32 pos;
bool verbose;
public:
/**
* Constructor, passes in the data to decode.
* @param data The data
* @param verbose Verbose output to the log
* @param off Offset to start parsing
*/
BDecoder(const TQByteArray & data,bool verbose,Uint32 off = 0);
virtual ~BDecoder();
/**
* Decode the data, the root node gets
* returned. (Note that the caller must delete this node)
* @return The root node
*/
BNode* decode();
private:
BDictNode* parseDict();
BListNode* parseList();
BValueNode* parseInt();
BValueNode* parseString();
};
}
#endif
|
