ea38a25af4
this is just the result of ``` find -iname "*.[ch]pp" | xargs sed -i "s/ *$//" find opm/parser/share/keywords -type f | xargs sed -i "s/ *$//" ``` so if it causes conflicts with other patches, the others should get priority. The rationale behind this patch is that some people tell their editor to remove white space which leads to larger than necessary patches...
80 lines
2.8 KiB
C++
80 lines
2.8 KiB
C++
/*
|
|
Copyright 2013 Statoil ASA.
|
|
|
|
This file is part of the Open Porous Media project (OPM).
|
|
|
|
OPM 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 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
OPM 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 OPM. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#include <opm/parser/eclipse/EclipseState/Schedule/GroupTreeNode.hpp>
|
|
#include <stdexcept>
|
|
|
|
namespace Opm {
|
|
|
|
GroupTreeNode::GroupTreeNode(const std::string& name_) {
|
|
m_name = name_;
|
|
}
|
|
|
|
const std::string& GroupTreeNode::name() const {
|
|
return m_name;
|
|
}
|
|
|
|
GroupTreeNodePtr GroupTreeNode::addChildGroup(const std::string& childName) {
|
|
if (hasChildGroup(childName)) {
|
|
throw std::invalid_argument("Child group with name \"" + childName + "\"already exists.");
|
|
}
|
|
GroupTreeNodePtr child(new GroupTreeNode(childName));
|
|
m_childGroups[childName] = child;
|
|
return child;
|
|
}
|
|
|
|
void GroupTreeNode::addChildGroup(std::shared_ptr<GroupTreeNode> childGroup) {
|
|
if (hasChildGroup(childGroup->name())) {
|
|
throw std::invalid_argument("Child group with name \"" + childGroup->name() + "\"already exists under node " + m_name);
|
|
}
|
|
m_childGroups[childGroup->name()] = childGroup;
|
|
}
|
|
|
|
|
|
void GroupTreeNode::removeChild(GroupTreeNodePtr child) {
|
|
if (!hasChildGroup(child->name())) {
|
|
throw std::invalid_argument("The node " + m_name + " does not have a child named " + child->name());
|
|
}
|
|
m_childGroups.erase(child->name());
|
|
}
|
|
|
|
bool GroupTreeNode::hasChildGroup(const std::string& childName) const {
|
|
return m_childGroups.find(childName) != m_childGroups.end();
|
|
}
|
|
|
|
GroupTreeNodePtr GroupTreeNode::getChildGroup(const std::string& childName) {
|
|
if (hasChildGroup(childName)) {
|
|
return m_childGroups[childName];
|
|
}
|
|
throw std::invalid_argument("Child group with name \"" + childName + "\" does not exist.");
|
|
}
|
|
|
|
GroupTreeNodePtr GroupTreeNode::createFieldNode() {
|
|
return GroupTreeNodePtr(new GroupTreeNode("FIELD"));
|
|
}
|
|
|
|
std::map<std::string, std::shared_ptr<GroupTreeNode> >::const_iterator GroupTreeNode::begin() const {
|
|
return m_childGroups.begin();
|
|
}
|
|
|
|
std::map<std::string, std::shared_ptr<GroupTreeNode> >::const_iterator GroupTreeNode::end() const {
|
|
return m_childGroups.end();
|
|
}
|
|
}
|