51 lines
1.1 KiB
C++
51 lines
1.1 KiB
C++
#include "nodetoterminal.h"
|
|
#include <iostream>
|
|
QHash<QString,QVector<QString> > *NodeToTerminal::ht=NULL;
|
|
NodeToTerminal::NodeToTerminal()
|
|
{
|
|
if(!NodeToTerminal::ht)
|
|
{
|
|
// std::cout<<"create"<<std::endl;
|
|
NodeToTerminal::ht=new QHash<QString,QVector<QString> >;
|
|
// std::cout<<this->value("").toStdString()<<std::endl;
|
|
}
|
|
}
|
|
|
|
void NodeToTerminal::add(const QString& key,const QString& value)
|
|
{
|
|
// if(this->contains(key))
|
|
// {
|
|
// std::cout<<"duplicat"<<std::endl;
|
|
// }
|
|
(*NodeToTerminal::ht)[key].push_back(value);
|
|
}
|
|
|
|
bool NodeToTerminal::contains(const QString& key)
|
|
{
|
|
return NodeToTerminal::ht->contains(key);
|
|
}
|
|
|
|
QVector<QString> NodeToTerminal::value(const QString& key)
|
|
{
|
|
// if(NodeToTerminal::ht)
|
|
// {
|
|
// //return NodeToTerminal::ht->value(key);
|
|
// return "not null";
|
|
// }
|
|
// else
|
|
// {
|
|
// return "null";
|
|
// }
|
|
// return "";
|
|
return NodeToTerminal::ht->value(key);
|
|
}
|
|
|
|
NodeToTerminal::~NodeToTerminal()
|
|
{
|
|
// if(NodeToTerminal::ht)
|
|
// {
|
|
// delete NodeToTerminal::ht;
|
|
// NodeToTerminal::ht=NULL;
|
|
// }
|
|
}
|