aria2/src/Dictionary.cc

88 lines
2.7 KiB
C++

/* <!-- copyright */
/*
* aria2 - The high speed download utility
*
* Copyright (C) 2006 Tatsuhiro Tsujikawa
*
* 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 option) 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
*
* In addition, as a special exception, the copyright holders give
* permission to link the code of portions of this program with the
* OpenSSL library under certain conditions as described in each
* individual source file, and distribute linked combinations
* including the two.
* You must obey the GNU General Public License in all respects
* for all of the code used other than OpenSSL. If you modify
* file(s) with this exception, you may extend this exception to your
* version of the file(s), but you are not obligated to do so. If you
* do not wish to do so, delete this exception statement from your
* version. If you delete this exception statement from all source
* files in the program, then also delete it here.
*/
/* copyright --> */
#include "Dictionary.h"
#include "MetaEntryVisitor.h"
#include <algorithm>
namespace aria2 {
Dictionary::Dictionary() {}
Dictionary::~Dictionary() {
clearTable();
}
void Dictionary::clearTable() {
for(std::map<std::string, MetaEntry*>::iterator itr = table.begin();
itr != table.end(); itr++) {
delete itr->second;
}
table.clear();
}
const MetaEntry* Dictionary::get(const std::string& name) const {
std::map<std::string, MetaEntry*>::const_iterator itr = table.find(name);
if(itr == table.end()) {
return NULL;
} else {
return itr->second;
}
}
void Dictionary::put(const std::string& name, MetaEntry* entry) {
table[name] = entry;
order.push_back(name);
}
void Dictionary::remove(const std::string& name)
{
std::map<std::string, MetaEntry*>::iterator i = table.find(name);
if(i != table.end()) {
delete i->second;
table.erase(i);
order.erase(std::remove(order.begin(), order.end(), name), order.end());
}
}
void Dictionary::accept(MetaEntryVisitor* v) const {
v->visit(this);
}
const std::deque<std::string>& Dictionary::getOrder() const {
return order;
}
} // namespace aria2