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
|
//=============================================================================
//
// File : kvi_kvs_treenode_datalist.cpp
// Created on Tue 07 Oct 2003 02:03:41 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_datalist.h"
#include "kvi_kvs_runtimecontext.h"
#include "kvi_qstring.h"
KviKvsTreeNodeDataList::KviKvsTreeNodeDataList(const TQChar * pLocation)
: KviKvsTreeNode(pLocation)
{
m_pDataList = new KviPointerList<KviKvsTreeNodeData>();
m_pDataList->setAutoDelete(true);
}
KviKvsTreeNodeDataList::~KviKvsTreeNodeDataList()
{
delete m_pDataList;
}
KviKvsTreeNodeData * KviKvsTreeNodeDataList::releaseFirst()
{
KviKvsTreeNodeData * d = m_pDataList->first();
if(d)
{
m_pDataList->setAutoDelete(false);
m_pDataList->removeFirst();
m_pDataList->setAutoDelete(true);
}
return d;
}
KviKvsTreeNodeData * KviKvsTreeNodeDataList::item(unsigned int uIdx)
{
if(uIdx >= m_pDataList->count())return 0;
return m_pDataList->at(uIdx);
}
void KviKvsTreeNodeDataList::contextDescription(TQString &szBuffer)
{
szBuffer = "Data List Evaluation";
}
void KviKvsTreeNodeDataList::dump(const char * prefix)
{
tqDebug("%s DataList",prefix);
TQString tmp = prefix;
tmp.append(" ");
for(KviKvsTreeNodeData * t = m_pDataList->first();t;t = m_pDataList->next())
{
t->dump(tmp.utf8().data());
}
}
bool KviKvsTreeNodeDataList::evaluate(KviKvsRunTimeContext * c,KviKvsVariantList * pBuffer)
{
pBuffer->clear();
// we use an iterator to accomodate recursion
KviPointerListIterator<KviKvsTreeNodeData> it(*m_pDataList);
while(KviKvsTreeNodeData * t = it.current())
{
KviKvsVariant * v = new KviKvsVariant();
if(!t->evaluateReadOnly(c,v))
{
delete v;
pBuffer->clear();
return false;
}
pBuffer->append(v);
++it;
}
return true;
}
void KviKvsTreeNodeDataList::addItem(KviKvsTreeNodeData * p)
{
m_pDataList->append(p);
p->setParent(this);
}
void KviKvsTreeNodeDataList::prependItem(KviKvsTreeNodeData * p)
{
m_pDataList->prepend(p);
p->setParent(this);
}
|
