/*
+ * This file is part of the GROMACS molecular simulation package.
*
- * This source code is part of
+ * Copyright (c) 2010,2012,2014, by the GROMACS development team, led by
+ * Mark Abraham, David van der Spoel, Berk Hess, and Erik Lindahl,
+ * and including many others, as listed in the AUTHORS file in the
+ * top-level source directory and at http://www.gromacs.org.
*
- * G R O M A C S
+ * GROMACS is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public License
+ * as published by the Free Software Foundation; either version 2.1
+ * of the License, or (at your option) any later version.
*
- * GROningen MAchine for Chemical Simulations
+ * GROMACS 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
+ * Lesser General Public License for more details.
*
- * Written by David van der Spoel, Erik Lindahl, Berk Hess, and others.
- * Copyright (c) 1991-2000, University of Groningen, The Netherlands.
- * Copyright (c) 2001-2009, The GROMACS development team,
- * check out http://www.gromacs.org for more information.
-
- * 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.
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with GROMACS; if not, see
+ * http://www.gnu.org/licenses, or write to the Free Software Foundation,
+ * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
- * If you want to redistribute modifications, please consider that
- * scientific software is very special. Version control is crucial -
- * bugs must be traceable. We will be happy to consider code for
- * inclusion in the official distribution, but derived work must not
- * be called official GROMACS. Details are found in the README & COPYING
- * files - if they are missing, get the official version at www.gromacs.org.
+ * If you want to redistribute modifications to GROMACS, please
+ * consider that scientific software is very special. Version
+ * control is crucial - bugs must be traceable. We will be happy to
+ * consider code for inclusion in the official distribution, but
+ * derived work must not be called official GROMACS. Details are found
+ * in the README & COPYING files - if they are missing, get the
+ * official version at http://www.gromacs.org.
*
* To help us fund GROMACS development, we humbly ask that you cite
- * the papers on the package - you can find them in the top README file.
- *
- * For more info, check our website at http://www.gromacs.org
+ * the research papers on the package. Check out http://www.gromacs.org.
*/
/*! \internal \file
* \brief
* Implements classes in optionsvisitor.h.
*
- * \author Teemu Murtola <teemu.murtola@cbr.su.se>
+ * \author Teemu Murtola <teemu.murtola@gmail.com>
* \ingroup module_options
*/
-#include "gromacs/options/optionsvisitor.h"
+#include "gmxpre.h"
+
+#include "optionsvisitor.h"
#include "gromacs/options/abstractoptionstorage.h"
#include "gromacs/options/options.h"
{
/********************************************************************
- * OptionInfo
+ * OptionsIterator
*/
-OptionInfo::OptionInfo(const AbstractOptionStorage &option)
- : _option(option)
-{
-}
-
-bool OptionInfo::isBoolean() const
-{
- return _option.isBoolean();
-}
-
-bool OptionInfo::isFile() const
-{
- return _option.isFile();
-}
-
-bool OptionInfo::isHidden() const
-{
- return _option.isHidden();
-}
-
-const std::string &OptionInfo::name() const
-{
- return _option.name();
-}
-
-const std::string &OptionInfo::description() const
-{
- return _option.description();
-}
-
-const char *OptionInfo::type() const
-{
- return _option.typeString();
-}
-
-int OptionInfo::valueCount() const
+OptionsIterator::OptionsIterator(const Options &options)
+ : options_(options)
{
- return _option.valueCount();
}
-std::string OptionInfo::formatValue(int i) const
+void OptionsIterator::acceptSubSections(OptionsVisitor *visitor) const
{
- return _option.formatValue(i);
+ const Options::Impl::SubSectionList &subSectionList =
+ options_.impl_->subSections_;
+ Options::Impl::SubSectionList::const_iterator i;
+ for (i = subSectionList.begin(); i != subSectionList.end(); ++i)
+ {
+ visitor->visitSubSection(*(*i));
+ }
}
-std::string OptionInfo::formatValues() const
+void OptionsIterator::acceptOptions(OptionsVisitor *visitor) const
{
- std::string result;
- int count = valueCount();
- for (int i = 0; i < count; ++i)
+ const Options::Impl::OptionList &optionList =
+ options_.impl_->options_;
+ Options::Impl::OptionList::const_iterator i;
+ for (i = optionList.begin(); i != optionList.end(); ++i)
{
- if (i != 0)
- {
- result.append(" ");
- }
- result.append(formatValue(i));
+ // This is not strictly const-correct, since optionInfo() is
+ // not const (while the input options is), but this makes things much
+ // simpler.
+ visitor->visitOption((*i)->optionInfo());
}
- return result;
}
/********************************************************************
- * OptionsIterator
+ * OptionsModifyingIterator
*/
-OptionsIterator::OptionsIterator(const Options &options)
- : _options(options)
+OptionsModifyingIterator::OptionsModifyingIterator(Options *options)
+ : options_(*options)
{
}
-void OptionsIterator::acceptSubSections(OptionsVisitor *visitor) const
+void OptionsModifyingIterator::acceptSubSections(OptionsModifyingVisitor *visitor) const
{
- const Options::Impl::SubSectionList &subSectionList =
- _options._impl->_subSections;
+ const Options::Impl::SubSectionList &subSectionList =
+ options_.impl_->subSections_;
Options::Impl::SubSectionList::const_iterator i;
for (i = subSectionList.begin(); i != subSectionList.end(); ++i)
{
- visitor->visitSubSection(*(*i));
+ visitor->visitSubSection(*i);
}
}
-void OptionsIterator::acceptOptions(OptionsVisitor *visitor) const
+void OptionsModifyingIterator::acceptOptions(OptionsModifyingVisitor *visitor) const
{
- const Options::Impl::OptionList &optionList =
- _options._impl->_options;
+ const Options::Impl::OptionList &optionList =
+ options_.impl_->options_;
Options::Impl::OptionList::const_iterator i;
for (i = optionList.begin(); i != optionList.end(); ++i)
{
- visitor->visitOption(OptionInfo(*(*i)));
+ visitor->visitOption(&(*i)->optionInfo());
}
}
biod.pnpi.spb.ru / alexxy / gromacs.git / blobdiff