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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
|
/*
* Copyright (c) 2003, 2004 Michael Pyne <[email protected]>
*
* This software 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 software 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 library; see the file COPYING.
* If not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#include <tqstringlist.h>
#include <tqiodevice.h>
#include <kdebug.h>
#include "bbase.h"
#include "bdict.h"
#include "bstring.h"
#include "bint.h"
#include "blist.h"
BDict::BDict (TQByteArray &dict, int start)
: m_map(), m_valid(false)
{
ByteTape tape(dict, start);
init (tape);
}
BDict::BDict (ByteTape &tape)
: m_map(), m_valid (false)
{
init (tape);
}
void BDict::init (ByteTape &tape)
{
if (*tape != 'd')
{
kdDebug(7034) << "This isn't a dictionary!" << endl;
return; // This isn't a dictionary
}
tape++;
// We need to loop and read in a string, then read in some data
while (*tape != 'e')
{
BBase *temp_item = 0;
// Read in string
TDESharedPtr<BString> str (new BString (tape));
// Ensure str will be automatically deleted
if (!str || !str->isValid())
{
kdDebug(7034) << (str ? "Invalid string" : "Unable to read String!") << endl;
return;
}
// Read in data
switch (*tape)
{
case 'l':
temp_item = new BList (tape);
break;
case 'i':
temp_item = new BInt (tape);
break;
case 'd':
temp_item = new BDict (tape);
break;
default:
// Hopefully this is a string
temp_item = new BString (tape);
}
if (!temp_item || !temp_item->isValid())
{
kdDebug(7034) << (temp_item ? "Invalid item!"
: "Unable to create keyed data!") << endl;
return;
}
m_map.insert(str->get_string(), temp_item);
}
// Move past the 'e'
tape++;
// Let the map delete the items
m_map.setAutoDelete (true);
// Oh yeah, we're valid now, too. :-)
m_valid = true;
}
BDict::~BDict ()
{
// TQDict will take care of deleting each entry that
// it holds.
}
BInt *BDict::findInt (const char *key)
{
BBase *base = find(key);
if (base && base->type_id() == bInt)
return dynamic_cast<BInt*>(base);
return 0;
}
BList *BDict::findList (const char *key)
{
BBase *base = find(key);
if (base && base->type_id() == bList)
return dynamic_cast<BList*>(base);
return 0;
}
BDict *BDict::findDict (const char *key)
{
BBase *base = find(key);
if (base && base->type_id() == bDict)
return dynamic_cast<BDict*>(base);
return 0;
}
BString *BDict::findStr (const char *key)
{
BBase *base = find(key);
if (base && base->type_id() == bString)
return dynamic_cast<BString*>(base);
return 0;
}
bool BDict::writeToDevice(TQIODevice &device)
{
if (!isValid())
return false;
const char *d_str = "d";
const char *e_str = "e";
TQ_LONG written = 0, result = 0;
written = device.writeBlock (d_str, 1);
while (written < 1)
{
if (written < 0 || result < 0)
return false;
result = device.writeBlock (d_str, 1);
written += result;
}
// Strings are supposed to be written in the dictionary such that
// the keys are in sorted order. TQDictIterator doesn't support an
// ordering, so we have to get a list of all the keys, sort it, and
// then go by the list.
BBaseHashIterator iter (m_map);
TQStringList key_list;
for ( ; iter.current(); ++iter)
key_list.append(iter.currentKey());
key_list.sort();
TQStringList::Iterator key_iter;
for (key_iter = key_list.begin(); key_iter != key_list.end(); ++key_iter)
{
TQCString utfString = (*key_iter).utf8();
TQString str = TQString("%1:").arg(utfString.size() - 1);
TQCString lenString = str.utf8();
// Write out length of key
device.writeBlock(lenString.data(), lenString.size() - 1);
// Write out actual key
device.writeBlock(utfString.data(), utfString.size() - 1);
// Write out the key's data
BBase *base = m_map.find(*key_iter);
if (!base->writeToDevice (device))
return false;
}
written = device.writeBlock (e_str, 1);
while ((uint) written < 1)
{
if (written < 0 || result < 0)
return false;
result = device.writeBlock (e_str, 1);
written += result;
}
return true;
}
|
