You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
kvirc/src/kvirc/kvs/kvi_kvs_treenode_arrayeleme...

162 lines
4.4 KiB

//=============================================================================
//
// File : kvi_kvs_treenode_arrayelement.cpp
// Created on Tue 07 Oct 2003 02:58: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_arrayelement.h"
#include "kvi_kvs_runtimecontext.h"
#include "kvi_locale.h"
#include "kvi_kvs_array.h"
#include "kvi_kvs_object.h"
KviKvsTreeNodeArrayElement::KviKvsTreeNodeArrayElement(const TQChar * pLocation,KviKvsTreeNodeData * pSource,KviKvsTreeNodeExpression * pIndex)
: KviKvsTreeNodeArrayOrHashElement(pLocation,pSource)
{
#ifdef COMPILE_NEW_KVS
m_pIndex = pIndex;
m_pIndex->setParent(this);
#endif
}
KviKvsTreeNodeArrayElement::~KviKvsTreeNodeArrayElement()
{
#ifdef COMPILE_NEW_KVS
delete m_pIndex;
#endif
}
void KviKvsTreeNodeArrayElement::contextDescription(TQString &szBuffer)
{
szBuffer = "Array Element Evaluation";
}
void KviKvsTreeNodeArrayElement::dump(const char * prefix)
{
#ifdef COMPILE_NEW_KVS
tqDebug("%s ArrayElement",prefix);
TQString tmp = prefix;
tmp.append(" ");
m_pSource->dump(tmp.utf8().data());
m_pIndex->dump(tmp.utf8().data());
#endif
}
bool KviKvsTreeNodeArrayElement::evaluateIndex(KviKvsRunTimeContext *c,kvs_int_t &iVal)
{
KviKvsVariant idx;
if(!m_pIndex->evaluateReadOnly(c,&idx))return false;
if(!idx.asInteger(iVal))
{
c->error(this,__tr2qs("Array index didn't evaluate to an integer"));
return false;
}
if(iVal < 0)
{
c->error(this,__tr2qs("Array index evaluated to a negative integer (non negative integer expected)"));
return false;
}
return true;
}
bool KviKvsTreeNodeArrayElement::evaluateReadOnlyInObjectScope(KviKvsObject * o,KviKvsRunTimeContext * c,KviKvsVariant * pBuffer)
{
#ifdef COMPILE_NEW_KVS
kvs_int_t iVal;
if(!evaluateIndex(c,iVal))return false;
KviKvsVariant val;
if(o)
{
if(!m_pSource->evaluateReadOnlyInObjectScope(o,c,&val))return false;
} else {
if(!m_pSource->evaluateReadOnly(c,&val))return false;
}
if(!val.isArray())
{
if(!val.isNothing())
{
TQString szType;
val.getTypeName(szType);
c->warning(this,__tr2qs("The argument of the [] subscript didn't evaluate to an array: automatic conversion from %Q supplied"),&szType);
}
pBuffer->setNothing();
return true;
}
KviKvsVariant * v = val.array()->at(iVal);
if(!v)
{
pBuffer->setNothing();
return true;
}
pBuffer->copyFrom(v);
#endif
return true;
}
KviKvsRWEvaluationResult * KviKvsTreeNodeArrayElement::evaluateReadWriteInObjectScope(KviKvsObject *o,KviKvsRunTimeContext * c)
{
#ifdef COMPILE_NEW_KVS
kvs_int_t iVal;
if(!evaluateIndex(c,iVal))return 0;
KviKvsRWEvaluationResult * result;
if(o)result = m_pSource->evaluateReadWriteInObjectScope(o,c);
else result = m_pSource->evaluateReadWrite(c);
if(!result)return 0;
if(!result->result()->isArray())
{
// convert to hash in some way
if(!result->result()->isNothing())
{
TQString szType;
result->result()->getTypeName(szType);
c->warning(this,__tr2qs("The argument of the [] subscript didn't evaluate to an array: automatic conversion from type '%Q' supplied"),&szType);
}
result->result()->setArray(new KviKvsArray());
}
return new KviKvsArrayElement(result,result->result()->array()->getAt(iVal),result->result()->array(),iVal);
#else
return 0;
#endif
}
bool KviKvsTreeNodeArrayElement::evaluateReadOnly(KviKvsRunTimeContext * c,KviKvsVariant * pBuffer)
{
return evaluateReadOnlyInObjectScope(0,c,pBuffer);
}
KviKvsRWEvaluationResult * KviKvsTreeNodeArrayElement::evaluateReadWrite(KviKvsRunTimeContext * c)
{
return evaluateReadWriteInObjectScope(0,c);
}