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
|
//=============================================================================
//
// File : kvi_kvs_treenode_compositedata.cpp
// Created on Tue 07 Oct 2003 02:24:33 by Szymon Stefanek
//
// This file is part of the KVIrc IRC client distribution
// Copyright (C) 2003 Szymon Stefanek <pragma at kvirc dot net>
//
// 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 opinion) 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.
//
//=============================================================================
#define __KVIRC__
#include "kvi_kvs_treenode_compositedata.h"
#include "kvi_qstring.h"
#define DEBUGME
KviKvsTreeNodeCompositeData::KviKvsTreeNodeCompositeData(const TQChar * pLocation,KviPointerList<KviKvsTreeNodeData> * pSubData)
: KviKvsTreeNodeData(pLocation)
{
#ifdef DEBUGME
if(pSubData->count() < 2)debug("KviKvsTreeNodeCompositeData constructor called with less than two children!");
#endif
m_pSubData = pSubData;
m_pSubData->setAutoDelete(true);
for(KviKvsTreeNodeData * d = m_pSubData->first();d;d = m_pSubData->next())
d->setParent(this);
}
KviKvsTreeNodeCompositeData::~KviKvsTreeNodeCompositeData()
{
delete m_pSubData;
}
bool KviKvsTreeNodeCompositeData::evaluateReadOnly(KviKvsRunTimeContext * c,KviKvsVariant * pBuffer)
{
TQString * pS = new TQString();
pBuffer->setString(pS);
KviKvsVariant res;
// we need to use an iterator to accomodate recursion
KviPointerListIterator<KviKvsTreeNodeData> it(*m_pSubData);
while(KviKvsTreeNodeData * d = it.current())
{
if(!d->evaluateReadOnly(c,&res))return false;
res.appendAsString(*pS);
++it;
}
return true;
}
void KviKvsTreeNodeCompositeData::contextDescription(TQString &szBuffer)
{
szBuffer = "Composite Data Evaluation (Implicit String Cast)";
}
void KviKvsTreeNodeCompositeData::dump(const char * prefix)
{
debug("%s CompositeData",prefix);
TQString tmp = prefix;
tmp.append(" ");
for(KviKvsTreeNodeData * p = m_pSubData->first();p;p = m_pSubData->next())
{
p->dump(tmp.utf8().data());
}
}
|
