| 1 | tim | 281 | /* | 
| 2 |  |  | * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved. | 
| 3 |  |  | * | 
| 4 |  |  | * The University of Notre Dame grants you ("Licensee") a | 
| 5 |  |  | * non-exclusive, royalty free, license to use, modify and | 
| 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 | 
| 19 |  |  | *    notice, this list of conditions and the following disclaimer. | 
| 20 |  |  | * | 
| 21 |  |  | * 3. Redistributions in binary form must reproduce the above copyright | 
| 22 |  |  | *    notice, this list of conditions and the following disclaimer in the | 
| 23 |  |  | *    documentation and/or other materials provided with the | 
| 24 |  |  | *    distribution. | 
| 25 |  |  | * | 
| 26 |  |  | * This software is provided "AS IS," without a warranty of any | 
| 27 |  |  | * kind. All express or implied conditions, representations and | 
| 28 |  |  | * warranties, including any implied warranty of merchantability, | 
| 29 |  |  | * fitness for a particular purpose or non-infringement, are hereby | 
| 30 |  |  | * excluded.  The University of Notre Dame and its licensors shall not | 
| 31 |  |  | * be liable for any damages suffered by licensee as a result of | 
| 32 |  |  | * using, modifying or distributing the software or its | 
| 33 |  |  | * derivatives. In no event will the University of Notre Dame or its | 
| 34 |  |  | * licensors be liable for any lost revenue, profit or data, or for | 
| 35 |  |  | * direct, indirect, special, consequential, incidental or punitive | 
| 36 |  |  | * damages, however caused and regardless of the theory of liability, | 
| 37 |  |  | * arising out of the use of or inability to use software, even if the | 
| 38 |  |  | * University of Notre Dame has been advised of the possibility of | 
| 39 |  |  | * such damages. | 
| 40 |  |  | */ | 
| 41 |  |  |  | 
| 42 |  |  | #include "selection/TokenMap.hpp" | 
| 43 |  |  |  | 
| 44 |  |  | namespace oopse { | 
| 45 |  |  |  | 
| 46 |  |  | TokenMap* TokenMap::instance_ = NULL; | 
| 47 |  |  |  | 
| 48 |  |  | TokenMap::TokenMap() { | 
| 49 |  |  | tokenMap_.insert(std::make_pair("define", Token(Token::define, std::string("define")))); | 
| 50 |  |  | tokenMap_.insert(std::make_pair("select", Token(Token::select, std::string("select")))); | 
| 51 | tim | 283 | //tokenMap_.insert(std::make_pair("selected", Token(Token::selected, std::string("selected")))); | 
| 52 |  |  |  | 
| 53 | tim | 281 | //expressions | 
| 54 |  |  | tokenMap_.insert(std::make_pair("(", Token(Token::leftparen, std::string("(")))); | 
| 55 |  |  | tokenMap_.insert(std::make_pair(")", Token(Token::rightparen, std::string(")")))); | 
| 56 |  |  | tokenMap_.insert(std::make_pair("-", Token(Token::hyphen, std::string("-")))); | 
| 57 | tim | 283 |  | 
| 58 | tim | 281 | tokenMap_.insert(std::make_pair("and", Token(Token::opAnd, std::string("and")))); | 
| 59 | tim | 283 | tokenMap_.insert(std::make_pair("&", Token(Token::opAnd, std::string("and")))); | 
| 60 |  |  | tokenMap_.insert(std::make_pair("&&", Token(Token::opAnd, std::string("and")))); | 
| 61 |  |  |  | 
| 62 | tim | 281 | tokenMap_.insert(std::make_pair("or", Token(Token::opOr, std::string("or")))); | 
| 63 | tim | 283 | tokenMap_.insert(std::make_pair(",", Token(Token::opOr, std::string("or")))); | 
| 64 |  |  | tokenMap_.insert(std::make_pair("|", Token(Token::opOr, std::string("or")))); | 
| 65 |  |  | tokenMap_.insert(std::make_pair("||", Token(Token::opOr, std::string("or")))); | 
| 66 |  |  |  | 
| 67 | tim | 281 | tokenMap_.insert(std::make_pair("not", Token(Token::opNot, std::string("not")))); | 
| 68 | tim | 283 | tokenMap_.insert(std::make_pair("!", Token(Token::opNot, std::string("not")))); | 
| 69 |  |  |  | 
| 70 | tim | 281 | tokenMap_.insert(std::make_pair("<", Token(Token::opLT, std::string("<")))); | 
| 71 |  |  | tokenMap_.insert(std::make_pair("<=", Token(Token::opLE, std::string("<=")))); | 
| 72 |  |  | tokenMap_.insert(std::make_pair(">=", Token(Token::opGE, std::string(">=")))); | 
| 73 |  |  | tokenMap_.insert(std::make_pair(">", Token(Token::opGT, std::string(">=")))); | 
| 74 |  |  | tokenMap_.insert(std::make_pair("==", Token(Token::opEQ, std::string("==")))); | 
| 75 |  |  | tokenMap_.insert(std::make_pair("!=", Token(Token::opNE, std::string("!=")))); | 
| 76 |  |  | tokenMap_.insert(std::make_pair("within", Token(Token::within, std::string("within")))); | 
| 77 |  |  | tokenMap_.insert(std::make_pair(".", Token(Token::dot, std::string(".")))); | 
| 78 |  |  | tokenMap_.insert(std::make_pair("mass", Token(Token::mass, std::string("mass")))); | 
| 79 |  |  | tokenMap_.insert(std::make_pair("dipole", Token(Token::dipole, std::string("dipole")))); | 
| 80 |  |  | tokenMap_.insert(std::make_pair("charge", Token(Token::charge, std::string("charge")))); | 
| 81 | tim | 295 | tokenMap_.insert(std::make_pair("to", Token(Token::to, std::string("to")))); | 
| 82 |  |  |  | 
| 83 | tim | 283 | //tokenMap_.insert(std::make_pair("name", Token(Token::name, std::string("name")))); | 
| 84 |  |  | //tokenMap_.insert(std::make_pair("index", Token(Token::index, std::string("index")))); | 
| 85 |  |  | //tokenMap_.insert(std::make_pair("molname", Token(Token::molname, std::string("molname")))); | 
| 86 |  |  | //tokenMap_.insert(std::make_pair("molindex", Token(Token::molindex, std::string("molindex")))); | 
| 87 | tim | 281 |  | 
| 88 |  |  | tokenMap_.insert(std::make_pair("*", Token(Token::asterisk, std::string("*")))); | 
| 89 |  |  | tokenMap_.insert(std::make_pair("all", Token(Token::all, std::string("all")))); | 
| 90 |  |  | tokenMap_.insert(std::make_pair("none", Token(Token::none, std::string("none")))); | 
| 91 |  |  | } | 
| 92 |  |  |  | 
| 93 |  |  | Token* TokenMap::getToken(const std::string& ident) { | 
| 94 |  |  | std::map<std::string, Token>::iterator i = tokenMap_.find(ident); | 
| 95 |  |  |  | 
| 96 |  |  | return i != tokenMap_.end() ? &(i->second) : NULL; | 
| 97 |  |  | } | 
| 98 |  |  | } |