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
|
/*
* 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 <tqiodevice.h>
#include "bytetape.h"
#include "blist.h"
#include "bdict.h"
#include "bstring.h"
#include "bint.h"
BList::BList (ByteTape &tape)
: m_valid(false), m_array()
{
init (tape);
}
BList::BList (TQByteArray &dict, unsigned int start)
: m_valid(false), m_array()
{
ByteTape tape (dict, start);
init (tape);
}
void BList::init (ByteTape &tape)
{
BBase *temp;
if (*tape != 'l')
return;
tape++;
/* Repeat circling over the string until the list is over */
while (*tape != 'e')
{
switch (*tape)
{
case 'd':
temp = new BDict (tape);
break;
case 'l': /* This element is a list */
temp = new BList (tape);
break;
case 'i': /* This element is an int */
temp = new BInt (tape);
break;
default: /* Maybe a string? */
temp = new BString (tape);
}
if (!temp || !temp->isValid())
return; // Invalid list element
m_array.append (temp);
}
m_valid = true;
// Only way out is to detect 'e', so we need to increment tape past that.
tape++;
}
BList::~BList()
{
BBaseVectorIterator iter;
for (iter = begin(); iter != end(); ++iter)
delete *iter;
}
BBase* BList::index (unsigned int i)
{
if (i >= count())
return 0;
else
return m_array[i];
}
BList * BList::indexList (unsigned int i)
{
BBase *base = index(i);
if (base && base->type_id() == bList)
return dynamic_cast<BList*>(base);
return 0;
}
BInt * BList::indexInt (unsigned int i)
{
BBase *base = index(i);
if (base && base->type_id() == bInt)
return dynamic_cast<BInt*>(base);
return 0;
}
BDict * BList::indexDict (unsigned int i)
{
BBase *base = index(i);
if (base && base->type_id() == bDict)
return dynamic_cast<BDict*>(base);
return 0;
}
BString * BList::indexStr (unsigned int i)
{
BBase *base = index(i);
if (base && base->type_id() == bString)
return dynamic_cast<BString*>(base);
return 0;
}
bool BList::writeToDevice(TQIODevice &device)
{
if (!m_valid)
return false;
const char *l_str = "l";
const char *e_str = "e";
TQ_LONG written = 0, result = 0;
written = device.writeBlock (l_str, 1);
while (written < 1)
{
if (written < 0 || result < 0)
return false;
result = device.writeBlock (l_str, 1);
written += result;
}
BBaseVectorIterator iter;
for (iter = begin(); iter != end(); ++iter)
{
if (!((*iter)->writeToDevice (device)))
return false;
}
written = device.writeBlock (e_str, 1);
while (written < 1)
{
if (written < 0 || result < 0)
return false;
result = device.writeBlock (e_str, 1);
written += result;
}
return true;
}
|
