//============================================================================= // // File : kvi_kvs_treenode_switchlist.cpp // Created on Tue 07 Oct 2003 02:06:53 by Szymon Stefanek // // This file is part of the KVIrc IRC client distribution // Copyright (C) 2003 Szymon Stefanek // // 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_switchlist.h" #include "kvi_kvs_runtimecontext.h" KviKvsTreeNodeSwitchList::KviKvsTreeNodeSwitchList(const TQChar * pLocation) : KviKvsTreeNode(pLocation) { m_pShortSwitchDict = 0; m_pLongSwitchDict = 0; } KviKvsTreeNodeSwitchList::~KviKvsTreeNodeSwitchList() { if(m_pShortSwitchDict)delete m_pShortSwitchDict; if(m_pLongSwitchDict)delete m_pLongSwitchDict; } void KviKvsTreeNodeSwitchList::contextDescription(TQString &szBuffer) { szBuffer = "Switch List Evaluation"; } void KviKvsTreeNodeSwitchList::dump(const char * prefix) { tqDebug("%s SwitchList",prefix); if(m_pShortSwitchDict) { KviPointerHashTableIterator it(*m_pShortSwitchDict); while(it.current()) { TQString tmp = prefix; tmp.append(" Sw("); TQChar c((unsigned short)it.currentKey()); tmp.append(c); tmp.append("): "); it.current()->dump(tmp.utf8().data()); ++it; } } if(m_pLongSwitchDict) { KviPointerHashTableIterator it(*m_pLongSwitchDict); while(it.current()) { TQString tmp = prefix; tmp.append(" Sw("); tmp.append(it.currentKey()); tmp.append("): "); it.current()->dump(tmp.utf8().data()); ++it; } } } void KviKvsTreeNodeSwitchList::addShort(int iShortKey,KviKvsTreeNodeData * p) { if(!m_pShortSwitchDict) { m_pShortSwitchDict = new KviPointerHashTable(11); m_pShortSwitchDict->setAutoDelete(true); } m_pShortSwitchDict->replace(iShortKey,p); p->setParent(this); } void KviKvsTreeNodeSwitchList::addLong(const TQString &szLongKey,KviKvsTreeNodeData * p) { if(!m_pLongSwitchDict) { m_pLongSwitchDict = new KviPointerHashTable(11); m_pLongSwitchDict->setAutoDelete(true); } m_pLongSwitchDict->replace(szLongKey,p); p->setParent(this); } bool KviKvsTreeNodeSwitchList::evaluate(KviKvsRunTimeContext * c,KviKvsSwitchList * pSwList) { pSwList->clear(); if(m_pShortSwitchDict) { KviPointerHashTableIterator it(*m_pShortSwitchDict); while(KviKvsTreeNodeData * d = it.current()) { KviKvsVariant * v = new KviKvsVariant(); if(!d->evaluateReadOnly(c,v)) { delete v; return false; } pSwList->addShort(it.currentKey(),v); ++it; } } if(m_pLongSwitchDict) { KviPointerHashTableIterator it(*m_pLongSwitchDict); while(KviKvsTreeNodeData * d = it.current()) { KviKvsVariant * v = new KviKvsVariant(); if(!d->evaluateReadOnly(c,v)) { delete v; return false; } pSwList->addLong(it.currentKey(),v); ++it; } } return true; } KviKvsTreeNodeData * KviKvsTreeNodeSwitchList::getStandardRebindingSwitch() { KviKvsTreeNodeData * d; if(m_pShortSwitchDict) { d = m_pShortSwitchDict->find('r'); if(d) { m_pShortSwitchDict->setAutoDelete(false); m_pShortSwitchDict->remove('r'); m_pShortSwitchDict->setAutoDelete(true); return d; } } if(m_pLongSwitchDict) { d = m_pLongSwitchDict->find("rebind"); if(d) { m_pLongSwitchDict->setAutoDelete(false); m_pLongSwitchDict->remove("rebind"); m_pLongSwitchDict->setAutoDelete(true); return d; } } return 0; }