| 6 | 
  | 
 * redistribute this software in source and binary code form, provided | 
| 7 | 
  | 
 * that the following conditions are met: | 
| 8 | 
  | 
 * | 
| 9 | 
< | 
 * 1. Acknowledgement of the program authors must be made in any | 
| 10 | 
< | 
 *    publication of scientific results based in part on use of the | 
| 11 | 
< | 
 *    program.  An acceptable form of acknowledgement is citation of | 
| 12 | 
< | 
 *    the article in which the program was described (Matthew | 
| 13 | 
< | 
 *    A. Meineke, Charles F. Vardeman II, Teng Lin, Christopher | 
| 14 | 
< | 
 *    J. Fennell and J. Daniel Gezelter, "OOPSE: An Object-Oriented | 
| 15 | 
< | 
 *    Parallel Simulation Engine for Molecular Dynamics," | 
| 16 | 
< | 
 *    J. Comput. Chem. 26, pp. 252-271 (2005)) | 
| 17 | 
< | 
 * | 
| 18 | 
< | 
 * 2. Redistributions of source code must retain the above copyright | 
| 9 | 
> | 
 * 1. Redistributions of source code must retain the above copyright | 
| 10 | 
  | 
 *    notice, this list of conditions and the following disclaimer. | 
| 11 | 
  | 
 * | 
| 12 | 
< | 
 * 3. Redistributions in binary form must reproduce the above copyright | 
| 12 | 
> | 
 * 2. Redistributions in binary form must reproduce the above copyright | 
| 13 | 
  | 
 *    notice, this list of conditions and the following disclaimer in the | 
| 14 | 
  | 
 *    documentation and/or other materials provided with the | 
| 15 | 
  | 
 *    distribution. | 
| 28 | 
  | 
 * arising out of the use of or inability to use software, even if the | 
| 29 | 
  | 
 * University of Notre Dame has been advised of the possibility of | 
| 30 | 
  | 
 * such damages. | 
| 31 | 
+ | 
 * | 
| 32 | 
+ | 
 * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your | 
| 33 | 
+ | 
 * research, please cite the appropriate papers when you publish your | 
| 34 | 
+ | 
 * work.  Good starting points are: | 
| 35 | 
+ | 
 *                                                                       | 
| 36 | 
+ | 
 * [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).              | 
| 37 | 
+ | 
 * [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).           | 
| 38 | 
+ | 
 * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (2008).           | 
| 39 | 
+ | 
 * [4]  Kuang & Gezelter,  J. Chem. Phys. 133, 164101 (2010). | 
| 40 | 
+ | 
 * [5]  Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011). | 
| 41 | 
  | 
 */ | 
| 42 | 
  | 
  | 
| 43 | 
  | 
#ifndef IO_PARAMCONSTRAINT_HPP | 
| 45 | 
  | 
#include <sstream> | 
| 46 | 
  | 
#include "utils/CaseConversion.hpp" | 
| 47 | 
  | 
#include "utils/StringTokenizer.hpp" | 
| 48 | 
< | 
namespace oopse { | 
| 48 | 
> | 
namespace OpenMD { | 
| 49 | 
  | 
  /** | 
| 50 | 
  | 
   * This class allows to recognize constraint predicates, so that they can be combined using | 
| 51 | 
  | 
   * composition operators. Every constraint predicate must be derived from this class | 
| 60 | 
  | 
  struct NotEmptyConstraint : public ParamConstraintFacade<NotEmptyConstraint>{ | 
| 61 | 
  | 
     | 
| 62 | 
  | 
    NotEmptyConstraint() { description_= "nonempty";} | 
| 63 | 
< | 
    bool operator()( const std::string data ) const { | 
| 63 | 
> | 
    bool operator()( const std::string &data ) const { | 
| 64 | 
  | 
      return !data.empty(); | 
| 65 | 
  | 
    } | 
| 66 | 
  | 
  }; | 
| 182 | 
  | 
 | 
| 183 | 
  | 
  struct EqualIgnoreCaseConstraint : public ParamConstraintFacade<EqualIgnoreCaseConstraint> { | 
| 184 | 
  | 
     | 
| 185 | 
< | 
    EqualIgnoreCaseConstraint(std::string rhs) : rhs_(oopse::toUpperCopy(rhs)){ | 
| 185 | 
> | 
    EqualIgnoreCaseConstraint(std::string rhs) : rhs_(OpenMD::toUpperCopy(rhs)){ | 
| 186 | 
  | 
      std::stringstream iss; | 
| 187 | 
  | 
      iss << "equal to (case insensitive) " << rhs; | 
| 188 | 
  | 
      this->description_ = iss.str(); | 
| 189 | 
  | 
    } | 
| 190 | 
  | 
     | 
| 191 | 
  | 
    bool operator()( std::string data ) const { | 
| 192 | 
< | 
      return oopse::toUpperCopy(data) == rhs_;  | 
| 192 | 
> | 
      return OpenMD::toUpperCopy(data) == rhs_;  | 
| 193 | 
  | 
    } | 
| 194 | 
  | 
     | 
| 195 | 
  | 
  private: | 
| 197 | 
  | 
  }; | 
| 198 | 
  | 
 | 
| 199 | 
  | 
  struct ContainsConstraint :  public ParamConstraintFacade<EqualIgnoreCaseConstraint> { | 
| 200 | 
< | 
    ContainsConstraint(std::string rhs) : rhs_(oopse::toUpperCopy(rhs)){ | 
| 200 | 
> | 
    ContainsConstraint(std::string rhs) : rhs_(OpenMD::toUpperCopy(rhs)){ | 
| 201 | 
  | 
      std::stringstream iss; | 
| 202 | 
  | 
      iss << "contains " << rhs; | 
| 203 | 
  | 
      this->description_ = iss.str(); | 
| 204 | 
  | 
    } | 
| 205 | 
  | 
     | 
| 206 | 
  | 
    bool operator()( std::string data ) const { | 
| 207 | 
< | 
      oopse::StringTokenizer tokenizer(oopse::toUpperCopy(data),  " ,;|\t\n\r"); | 
| 207 | 
> | 
      OpenMD::StringTokenizer tokenizer(OpenMD::toUpperCopy(data),  " ,;|\t\n\r"); | 
| 208 | 
  | 
      while (tokenizer.hasMoreTokens()) { | 
| 209 | 
  | 
        if (tokenizer.nextToken() == rhs_) { | 
| 210 | 
  | 
          return true; | 
| 361 | 
  | 
 | 
| 362 | 
  | 
  template<typename T> | 
| 363 | 
  | 
  inline LessThanOrEqualToConstraint<T> isLessThanOrEqualTo(T& v ) { | 
| 364 | 
< | 
    return ParamConstraintFacade<LessThanOrEqualToConstraint<T> >(v); | 
| 364 | 
> | 
    return LessThanOrEqualToConstraint<T>(v); | 
| 365 | 
  | 
  } | 
| 366 | 
  | 
 | 
| 367 | 
  | 
  template<typename T> |