src/selection/NameFinder.cpp

/*
 * Copyright (c) 2005 The University of Notre Dame. All Rights Reserved.
 *
 * The University of Notre Dame grants you ("Licensee") a
 * non-exclusive, royalty free, license to use, modify and
 * redistribute this software in source and binary code form, provided
 * that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the
 *    distribution.
 *
 * This software is provided "AS IS," without a warranty of any
 * kind. All express or implied conditions, representations and
 * warranties, including any implied warranty of merchantability,
 * fitness for a particular purpose or non-infringement, are hereby
 * excluded.  The University of Notre Dame and its licensors shall not
 * be liable for any damages suffered by licensee as a result of
 * using, modifying or distributing the software or its
 * derivatives. In no event will the University of Notre Dame or its
 * licensors be liable for any lost revenue, profit or data, or for
 * direct, indirect, special, consequential, incidental or punitive
 * damages, however caused and regardless of the theory of liability,
 * arising out of the use of or inability to use software, even if the
 * University of Notre Dame has been advised of the possibility of
 * such damages.
 *
 * SUPPORT OPEN SCIENCE!  If you use OpenMD or its source code in your
 * research, please cite the appropriate papers when you publish your
 * work.  Good starting points are:
 *                                                                      
 * [1]  Meineke, et al., J. Comp. Chem. 26, 252-271 (2005).             
 * [2]  Fennell & Gezelter, J. Chem. Phys. 124, 234104 (2006).          
 * [3]  Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (2008).          
 * [4]  Kuang & Gezelter,  J. Chem. Phys. 133, 164101 (2010).
 * [5]  Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011).
 */
#include "selection/NameFinder.hpp"
#include "utils/wildcards.hpp"
#include "utils/StringTokenizer.hpp"
#include "primitives/Molecule.hpp"
#include "utils/StringUtils.hpp"
namespace OpenMD {

  TreeNode::~TreeNode(){
    std::map<std::string, TreeNode*>::iterator i;
    for ( i = children.begin(); i != children.end(); ++i) {
      i->second->~TreeNode();
    }
    children.clear();
  }

  NameFinder::NameFinder(SimInfo* info) : info_(info), root_(NULL){
    nObjects_.push_back(info_->getNGlobalAtoms()+info_->getNGlobalRigidBodies());
    nObjects_.push_back(info_->getNGlobalBonds());
    nObjects_.push_back(info_->getNGlobalBends());
    nObjects_.push_back(info_->getNGlobalTorsions());
    nObjects_.push_back(info_->getNGlobalInversions());
    loadNames();
  }

  NameFinder::~NameFinder(){
    delete root_;
  }

  void NameFinder::loadNames() {
    SimInfo::MoleculeIterator mi;
    Molecule::AtomIterator ai;
    Molecule::RigidBodyIterator rbIter;
    Molecule::BondIterator bondIter;
    Molecule::BendIterator bendIter;
    Molecule::TorsionIterator torsionIter;
    Molecule::InversionIterator inversionIter;

    Molecule* mol;
    Atom* atom;
    RigidBody* rb;
    Bond* bond;
    Bend* bend;
    Torsion* torsion;
    Inversion* inversion;    

    root_ = new TreeNode;
    root_->bs.resize(nObjects_);
    root_->bs.setAll(); //
    
    for (mol = info_->beginMolecule(mi); mol != NULL; 
         mol = info_->nextMolecule(mi)) {
           
      std::string molName = mol->getMoleculeName();
      TreeNode* molNode = createNode(root_, molName);
        
      for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) {
        std::string atomName = atom->getType();
        TreeNode* atomNode = createNode(molNode, atomName);
            
        molNode->bs.bitsets_[STUNTDOUBLE].setBitOn(atom->getGlobalIndex());
        atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn(atom->getGlobalIndex());
      }

      for (rb = mol->beginRigidBody(rbIter); rb != NULL; 
           rb = mol->nextRigidBody(rbIter)) {
        std::string rbName = rb->getType();
        TreeNode* rbNode = createNode(molNode, rbName);
            
        molNode->bs.bitsets_[STUNTDOUBLE].setBitOn(rb->getGlobalIndex());
        rbNode->bs.bitsets_[STUNTDOUBLE].setBitOn(rb->getGlobalIndex());

        // COMMENTED OUT because rigid bodies are IntegrableObjects
        // (e.g. they are independently mobile, so selecting their
        // member atoms will give some odd results if we are computing
        // degrees of freedom elsewhere.

        // //create nodes for atoms belong to this rigidbody
        // for(atom = rb->beginAtom(ai); atom != NULL; atom = rb->nextAtom(ai)) {
        //   std::string rbAtomName = atom->getType();
        //   TreeNode* rbAtomNode = createNode(rbNode, rbAtomName);

        //   rbAtomNode->bs.bitsets_[STUNTDOUBLE].setBitOn(atom->getGlobalIndex());
        // }
      }

      for (bond = mol->beginBond(bondIter); bond != NULL; 
           bond = mol->nextBond(bondIter)) {

        std::string bondName = bond->getName();
        TreeNode* bondNode = createNode(molNode, bondName);

        molNode->bs.bitsets_[BOND].setBitOn(bond->getGlobalIndex());
        bondNode->bs.bitsets_[BOND].setBitOn(bond->getGlobalIndex());

        std::vector<Atom*> atoms = bond->getAtoms();
        std::vector<Atom*>::iterator ai;
        
        for (ai = atoms.begin(); ai != atoms.end(); ++ai) {
          std::string atomName = (*ai)->getType();
          TreeNode* atomNode = createNode(bondNode, atomName);
          atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn((*ai)->getGlobalIndex());
        }
      }
      for (bend = mol->beginBend(bendIter); bend != NULL; 
           bend = mol->nextBend(bendIter)) {

        std::string bendName = bend->getName();
        TreeNode* bendNode = createNode(molNode, bendName);

        molNode->bs.bitsets_[BEND].setBitOn(bend->getGlobalIndex());
        bendNode->bs.bitsets_[BEND].setBitOn(bend->getGlobalIndex());

        std::vector<Atom*> atoms = bend->getAtoms();
        std::vector<Atom*>::iterator ai;
        
        for (ai = atoms.begin(); ai != atoms.end(); ++ai) {
          std::string atomName = (*ai)->getType();
          TreeNode* atomNode = createNode(bendNode, atomName);
          atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn((*ai)->getGlobalIndex());
        }

      }
      for (torsion = mol->beginTorsion(torsionIter); torsion != NULL; 
           torsion = mol->nextTorsion(torsionIter)) {

        std::string torsionName = torsion->getName();
        TreeNode* torsionNode = createNode(molNode, torsionName);

        molNode->bs.bitsets_[TORSION].setBitOn(torsion->getGlobalIndex());
        torsionNode->bs.bitsets_[TORSION].setBitOn(torsion->getGlobalIndex());

        std::vector<Atom*> atoms = torsion->getAtoms();
        std::vector<Atom*>::iterator ai;
        
        for (ai = atoms.begin(); ai != atoms.end(); ++ai) {
          std::string atomName = (*ai)->getType();
          TreeNode* atomNode = createNode(torsionNode, atomName);
          atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn((*ai)->getGlobalIndex());
        }

      }
      for (inversion = mol->beginInversion(inversionIter); inversion != NULL; 
           inversion = mol->nextInversion(inversionIter)) {

        std::string inversionName = inversion->getName();
        TreeNode* inversionNode = createNode(molNode, inversionName);

        molNode->bs.bitsets_[INVERSION].setBitOn(inversion->getGlobalIndex());
        inversionNode->bs.bitsets_[INVERSION].setBitOn(inversion->getGlobalIndex());
        std::vector<Atom*> atoms = inversion->getAtoms();
        std::vector<Atom*>::iterator ai;
        
        for (ai = atoms.begin(); ai != atoms.end(); ++ai) {
          std::string atomName = (*ai)->getType();
          TreeNode* atomNode = createNode(inversionNode, atomName);
          atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn((*ai)->getGlobalIndex());
        }
      }
    }
  }

  TreeNode* NameFinder::createNode(TreeNode* parent, const std::string& name) {
    TreeNode* node;    
    std::map<std::string, TreeNode*>::iterator foundIter;
    foundIter = parent->children.find(name);
    if ( foundIter  == parent->children.end()) {
      node = new TreeNode;
      node->name = name;
      node->bs.resize(nObjects_);
      parent->children.insert(std::make_pair(name, node));
    }else {
      node = foundIter->second;
    }
    return node;
  }

  SelectionSet NameFinder::match(const std::string& name){
    SelectionSet bs(nObjects_);
  
    StringTokenizer tokenizer(name, ".");

    std::vector<std::string> names;
    while(tokenizer.hasMoreTokens()) {
      names.push_back(tokenizer.nextToken());
    }

    int size = names.size();

    switch(size) {
    case 1 :
      //could be molecule name, atom name and rigidbody name
      matchMolecule(names[0], bs);
      matchStuntDouble("*", names[0], bs);
      matchBond("*", names[0], bs);
      matchBend("*", names[0], bs);
      matchTorsion("*", names[0], bs);
      matchInversion("*", names[0], bs);
            
      break;
    case 2:
      //could be molecule.*(include atoms and rigidbodies) or rigidbody.*(atoms belong to rigidbody)

      if (!isInteger(names[1])){
        matchRigidAtoms("*", names[0], names[1], bs);
        matchStuntDouble(names[0], names[1], bs);
      } else {
        int internalIndex = lexi_cast<int>(names[1]);
        if (internalIndex < 0) {
          std::cerr << names[0] << ". " << names[1] << " is an invalid name" << std::endl;           
        } else {
          matchInternalIndex(names[0], internalIndex, bs);
        }
      }
            
      break;
    case 3:
      //must be molecule.rigidbody.*
      matchRigidAtoms(names[0], names[1], names[2], bs);
      break;
    default:      
      std::cerr << "invalid name: " << name << std::endl;
      break;           
    }

    return bs; 
  }

  void NameFinder::matchMolecule(const std::string& molName, SelectionSet& bs) {
    std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);            
    std::vector<TreeNode*>::iterator i;
    for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
      bs |= (*i)->bs;
    }    
  }

  void NameFinder::matchStuntDouble(const std::string& molName, const std::string& sdName, SelectionSet& bs){
    std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);            
    std::vector<TreeNode*>::iterator i;
    for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
      std::vector<TreeNode*> sdNodes = getMatchedChildren(*i, sdName);   
      std::vector<TreeNode*>::iterator j;
      for (j = sdNodes.begin(); j != sdNodes.end(); ++j) {
        bs |= (*j)->bs;
      }
    }

  }

  void NameFinder::matchBond(const std::string& molName, 
                             const std::string& bondName, SelectionSet& bs){
    std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);            
    std::vector<TreeNode*>::iterator i;
    for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
      std::vector<TreeNode*> bondNodes = getMatchedChildren(*i, bondName);   
      std::vector<TreeNode*>::iterator j;
      for (j = bondNodes.begin(); j != bondNodes.end(); ++j) {
        bs |= (*j)->bs;
        std::vector<TreeNode*> bondAtomNodes = getAllChildren(*j);
        std::vector<TreeNode*>::iterator k;
        for(k = bondAtomNodes.begin(); k != bondAtomNodes.end(); ++k){
          bs |= (*k)->bs;
        }
      }
    }
  }

  void NameFinder::matchBend(const std::string& molName, const std::string& bendName,  SelectionSet& bs){
    std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);            
    std::vector<TreeNode*>::iterator i;
    for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
      std::vector<TreeNode*> bendNodes = getMatchedChildren(*i, bendName);   
      std::vector<TreeNode*>::iterator j;
      for (j = bendNodes.begin(); j != bendNodes.end(); ++j) {
        std::vector<TreeNode*> bendAtomNodes = getAllChildren(*j);
        std::vector<TreeNode*>::iterator k;
        for(k = bendAtomNodes.begin(); k != bendAtomNodes.end(); ++k){
          bs |= (*k)->bs;
        }
      }
    }
  }
  void NameFinder::matchTorsion(const std::string& molName, const std::string& torsionName, SelectionSet& bs){
    std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);            
    std::vector<TreeNode*>::iterator i;
    for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
      std::vector<TreeNode*> torsionNodes = getMatchedChildren(*i, torsionName);   
      std::vector<TreeNode*>::iterator j;
      for (j = torsionNodes.begin(); j != torsionNodes.end(); ++j) {
        std::vector<TreeNode*> torsionAtomNodes = getAllChildren(*j);
        std::vector<TreeNode*>::iterator k;
        for(k = torsionAtomNodes.begin(); k != torsionAtomNodes.end(); ++k){
          bs |= (*k)->bs;
        }
      }
    }
  }
  void NameFinder::matchInversion(const std::string& molName, const std::string& inversionName, SelectionSet& bs){
    std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);            
    std::vector<TreeNode*>::iterator i;
    for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
      std::vector<TreeNode*> inversionNodes = getMatchedChildren(*i, inversionName);   
      std::vector<TreeNode*>::iterator j;
      for (j = inversionNodes.begin(); j != inversionNodes.end(); ++j) {
        std::vector<TreeNode*> inversionAtomNodes = getAllChildren(*j);
        std::vector<TreeNode*>::iterator k;
        for(k = inversionAtomNodes.begin(); k != inversionAtomNodes.end(); ++k){
          bs |= (*k)->bs;
        }
      }
    }
  }

  void NameFinder::matchRigidAtoms(const std::string& molName, const std::string& rbName, const std::string& rbAtomName, SelectionSet& bs){
    std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);            
    std::vector<TreeNode*>::iterator i;
    for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
      std::vector<TreeNode*> rbNodes = getMatchedChildren(*i, rbName);   
      std::vector<TreeNode*>::iterator j;
      for (j = rbNodes.begin(); j != rbNodes.end(); ++j) {
        std::vector<TreeNode*> rbAtomNodes = getMatchedChildren(*j, rbAtomName);
        std::vector<TreeNode*>::iterator k;
        for(k = rbAtomNodes.begin(); k != rbAtomNodes.end(); ++k){
          bs |= (*k)->bs;
        }
      }
    }

  }

  std::vector<TreeNode*> NameFinder::getAllChildren(TreeNode* node)  {
    std::vector<TreeNode*> childNodes;
    std::map<std::string, TreeNode*>::iterator i;
    for (i = node->children.begin(); i != node->children.end(); ++i) {
      childNodes.push_back(i->second);
    }
    return childNodes;
  }

  std::vector<TreeNode*> NameFinder::getMatchedChildren(TreeNode* node, const std::string& name) {
    std::vector<TreeNode*> matchedNodes;
    std::map<std::string, TreeNode*>::iterator i;
    for (i = node->children.begin(); i != node->children.end(); ++i) {
      if (isMatched( i->first, name)) {
        matchedNodes.push_back(i->second);
      }
    }

    return matchedNodes;
  }

  bool NameFinder::isMatched(const std::string& str, const std::string& wildcard) {
    return Wildcard::wildcardfit(wildcard.c_str(), str.c_str()) > 0 ? true : false;
  }


  void NameFinder::matchInternalIndex(const std::string& name, int internalIndex, SelectionSet& bs){

    SimInfo::MoleculeIterator mi;
    Molecule* mol;

    for (mol = info_->beginMolecule(mi); mol != NULL; 
         mol = info_->nextMolecule(mi)) {
           
      if (isMatched(mol->getMoleculeName(), name) ) {
        int natoms = mol->getNAtoms();
        int nrigidbodies = mol->getNRigidBodies();
        if (internalIndex >= natoms + nrigidbodies) {
          continue;
        } else if (internalIndex < natoms) {
          bs.bitsets_[STUNTDOUBLE].setBitOn(mol->getAtomAt(internalIndex)->getGlobalIndex());
          continue;
        } else if ( internalIndex < natoms + nrigidbodies) {
          bs.bitsets_[STUNTDOUBLE].setBitOn(mol->getRigidBodyAt(internalIndex - natoms)->getGlobalIndex());
        }
      }
    }
  }

  bool NameFinder::isInteger(const std::string &str) {
    for(unsigned int i = 0; i < str.size(); ++i){
      if (!std::isdigit(str[i])) {
        return false;
      }
    }
    return true;
  }
}
Revision:	1962
Committed:	Wed Jan 15 22:26:18 2014 UTC (11 years, 3 months ago) by gezelter
File size:	16064 byte(s)
Log Message:	Some potential bug fixes.
#	User	Rev	Content
1	tim	283	/*
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	gezelter	1390	* 1. Redistributions of source code must retain the above copyright
10	tim	283	* notice, this list of conditions and the following disclaimer.
11			*
12	gezelter	1390	* 2. Redistributions in binary form must reproduce the above copyright
13	tim	283	* notice, this list of conditions and the following disclaimer in the
14			* documentation and/or other materials provided with the
15			* distribution.
16			*
17			* This software is provided "AS IS," without a warranty of any
18			* kind. All express or implied conditions, representations and
19			* warranties, including any implied warranty of merchantability,
20			* fitness for a particular purpose or non-infringement, are hereby
21			* excluded. The University of Notre Dame and its licensors shall not
22			* be liable for any damages suffered by licensee as a result of
23			* using, modifying or distributing the software or its
24			* derivatives. In no event will the University of Notre Dame or its
25			* licensors be liable for any lost revenue, profit or data, or for
26			* direct, indirect, special, consequential, incidental or punitive
27			* damages, however caused and regardless of the theory of liability,
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	gezelter	1390	*
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	gezelter	1879	* [3] Sun, Lin & Gezelter, J. Chem. Phys. 128, 234107 (2008).
39	gezelter	1782	* [4] Kuang & Gezelter, J. Chem. Phys. 133, 164101 (2010).
40			* [5] Vardeman, Stocker & Gezelter, J. Chem. Theory Comput. 7, 834 (2011).
41	tim	283	*/
42			#include "selection/NameFinder.hpp"
43	tim	284	#include "utils/wildcards.hpp"
44	tim	287	#include "utils/StringTokenizer.hpp"
45			#include "primitives/Molecule.hpp"
46	tim	303	#include "utils/StringUtils.hpp"
47	gezelter	1390	namespace OpenMD {
48	tim	283
49	gezelter	507	TreeNode::~TreeNode(){
50	tim	284	std::map<std::string, TreeNode*>::iterator i;
51			for ( i = children.begin(); i != children.end(); ++i) {
52	gezelter	507	i->second->~TreeNode();
53	tim	284	}
54			children.clear();
55	gezelter	507	}
56	tim	284
57	gezelter	507	NameFinder::NameFinder(SimInfo* info) : info_(info), root_(NULL){
58	gezelter	1953	nObjects_.push_back(info_->getNGlobalAtoms()+info_->getNGlobalRigidBodies());
59			nObjects_.push_back(info_->getNGlobalBonds());
60			nObjects_.push_back(info_->getNGlobalBends());
61			nObjects_.push_back(info_->getNGlobalTorsions());
62			nObjects_.push_back(info_->getNGlobalInversions());
63	tim	283	loadNames();
64	gezelter	507	}
65	tim	283
66	gezelter	507	NameFinder::~NameFinder(){
67	tim	284	delete root_;
68	gezelter	507	}
69	tim	283
70	gezelter	507	void NameFinder::loadNames() {
71	gezelter	1953	SimInfo::MoleculeIterator mi;
72			Molecule::AtomIterator ai;
73			Molecule::RigidBodyIterator rbIter;
74			Molecule::BondIterator bondIter;
75			Molecule::BendIterator bendIter;
76			Molecule::TorsionIterator torsionIter;
77			Molecule::InversionIterator inversionIter;
78	tim	283
79			Molecule* mol;
80			Atom* atom;
81			RigidBody* rb;
82	gezelter	1953	Bond* bond;
83			Bend* bend;
84			Torsion* torsion;
85			Inversion* inversion;
86	tim	284
87			root_ = new TreeNode;
88	gezelter	1953	root_->bs.resize(nObjects_);
89	tim	284	root_->bs.setAll(); //
90
91	gezelter	1801	for (mol = info_->beginMolecule(mi); mol != NULL;
92			mol = info_->nextMolecule(mi)) {
93	tim	288
94	gezelter	507	std::string molName = mol->getMoleculeName();
95	gezelter	1953	TreeNode* molNode = createNode(root_, molName);
96	tim	283
97	gezelter	507	for(atom = mol->beginAtom(ai); atom != NULL; atom = mol->nextAtom(ai)) {
98			std::string atomName = atom->getType();
99	gezelter	1953	TreeNode* atomNode = createNode(molNode, atomName);
100	tim	288
101	gezelter	1953	molNode->bs.bitsets_[STUNTDOUBLE].setBitOn(atom->getGlobalIndex());
102			atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn(atom->getGlobalIndex());
103	gezelter	507	}
104	tim	284
105	gezelter	1801	for (rb = mol->beginRigidBody(rbIter); rb != NULL;
106			rb = mol->nextRigidBody(rbIter)) {
107	gezelter	507	std::string rbName = rb->getType();
108	gezelter	1953	TreeNode* rbNode = createNode(molNode, rbName);
109	tim	284
110	gezelter	1953	molNode->bs.bitsets_[STUNTDOUBLE].setBitOn(rb->getGlobalIndex());
111			rbNode->bs.bitsets_[STUNTDOUBLE].setBitOn(rb->getGlobalIndex());
112	tim	284
113	gezelter	1962	// COMMENTED OUT because rigid bodies are IntegrableObjects
114			// (e.g. they are independently mobile, so selecting their
115			// member atoms will give some odd results if we are computing
116			// degrees of freedom elsewhere.
117	tim	288
118	gezelter	1962	// //create nodes for atoms belong to this rigidbody
119			// for(atom = rb->beginAtom(ai); atom != NULL; atom = rb->nextAtom(ai)) {
120			// std::string rbAtomName = atom->getType();
121			// TreeNode* rbAtomNode = createNode(rbNode, rbAtomName);
122
123			// rbAtomNode->bs.bitsets_[STUNTDOUBLE].setBitOn(atom->getGlobalIndex());
124			// }
125	gezelter	507	}
126	gezelter	1953
127			for (bond = mol->beginBond(bondIter); bond != NULL;
128			bond = mol->nextBond(bondIter)) {
129
130			std::string bondName = bond->getName();
131			TreeNode* bondNode = createNode(molNode, bondName);
132
133			molNode->bs.bitsets_[BOND].setBitOn(bond->getGlobalIndex());
134			bondNode->bs.bitsets_[BOND].setBitOn(bond->getGlobalIndex());
135
136			std::vector<Atom*> atoms = bond->getAtoms();
137			std::vector<Atom*>::iterator ai;
138
139			for (ai = atoms.begin(); ai != atoms.end(); ++ai) {
140			std::string atomName = (*ai)->getType();
141			TreeNode* atomNode = createNode(bondNode, atomName);
142			atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn((*ai)->getGlobalIndex());
143			}
144			}
145			for (bend = mol->beginBend(bendIter); bend != NULL;
146			bend = mol->nextBend(bendIter)) {
147
148			std::string bendName = bend->getName();
149			TreeNode* bendNode = createNode(molNode, bendName);
150
151			molNode->bs.bitsets_[BEND].setBitOn(bend->getGlobalIndex());
152			bendNode->bs.bitsets_[BEND].setBitOn(bend->getGlobalIndex());
153
154			std::vector<Atom*> atoms = bend->getAtoms();
155			std::vector<Atom*>::iterator ai;
156
157			for (ai = atoms.begin(); ai != atoms.end(); ++ai) {
158			std::string atomName = (*ai)->getType();
159			TreeNode* atomNode = createNode(bendNode, atomName);
160			atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn((*ai)->getGlobalIndex());
161			}
162
163			}
164			for (torsion = mol->beginTorsion(torsionIter); torsion != NULL;
165			torsion = mol->nextTorsion(torsionIter)) {
166
167			std::string torsionName = torsion->getName();
168			TreeNode* torsionNode = createNode(molNode, torsionName);
169
170			molNode->bs.bitsets_[TORSION].setBitOn(torsion->getGlobalIndex());
171			torsionNode->bs.bitsets_[TORSION].setBitOn(torsion->getGlobalIndex());
172
173			std::vector<Atom*> atoms = torsion->getAtoms();
174			std::vector<Atom*>::iterator ai;
175
176			for (ai = atoms.begin(); ai != atoms.end(); ++ai) {
177			std::string atomName = (*ai)->getType();
178			TreeNode* atomNode = createNode(torsionNode, atomName);
179			atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn((*ai)->getGlobalIndex());
180			}
181
182			}
183			for (inversion = mol->beginInversion(inversionIter); inversion != NULL;
184			inversion = mol->nextInversion(inversionIter)) {
185
186			std::string inversionName = inversion->getName();
187			TreeNode* inversionNode = createNode(molNode, inversionName);
188
189			molNode->bs.bitsets_[INVERSION].setBitOn(inversion->getGlobalIndex());
190			inversionNode->bs.bitsets_[INVERSION].setBitOn(inversion->getGlobalIndex());
191			std::vector<Atom*> atoms = inversion->getAtoms();
192			std::vector<Atom*>::iterator ai;
193
194			for (ai = atoms.begin(); ai != atoms.end(); ++ai) {
195			std::string atomName = (*ai)->getType();
196			TreeNode* atomNode = createNode(inversionNode, atomName);
197			atomNode->bs.bitsets_[STUNTDOUBLE].setBitOn((*ai)->getGlobalIndex());
198			}
199			}
200	gezelter	1801	}
201	gezelter	507	}
202	tim	283
203	gezelter	507	TreeNode* NameFinder::createNode(TreeNode* parent, const std::string& name) {
204	tim	288	TreeNode* node;
205			std::map<std::string, TreeNode*>::iterator foundIter;
206			foundIter = parent->children.find(name);
207			if ( foundIter == parent->children.end()) {
208	gezelter	507	node = new TreeNode;
209			node->name = name;
210	gezelter	1953	node->bs.resize(nObjects_);
211	gezelter	507	parent->children.insert(std::make_pair(name, node));
212	tim	288	}else {
213	gezelter	507	node = foundIter->second;
214	tim	288	}
215			return node;
216	gezelter	507	}
217	tim	283
218	gezelter	1953	SelectionSet NameFinder::match(const std::string& name){
219			SelectionSet bs(nObjects_);
220	tim	288
221	tim	283	StringTokenizer tokenizer(name, ".");
222
223			std::vector<std::string> names;
224			while(tokenizer.hasMoreTokens()) {
225	gezelter	507	names.push_back(tokenizer.nextToken());
226	tim	283	}
227
228			int size = names.size();
229	gezelter	1953
230	tim	283	switch(size) {
231	gezelter	507	case 1 :
232			//could be molecule name, atom name and rigidbody name
233			matchMolecule(names[0], bs);
234			matchStuntDouble("*", names[0], bs);
235	gezelter	1953	matchBond("*", names[0], bs);
236			matchBend("*", names[0], bs);
237			matchTorsion("*", names[0], bs);
238			matchInversion("*", names[0], bs);
239	tim	284
240	gezelter	507	break;
241			case 2:
242			//could be molecule.(include atoms and rigidbodies) or rigidbody.(atoms belong to rigidbody)
243	tim	303
244	gezelter	507	if (!isInteger(names[1])){
245			matchRigidAtoms("*", names[0], names[1], bs);
246			matchStuntDouble(names[0], names[1], bs);
247			} else {
248			int internalIndex = lexi_cast<int>(names[1]);
249			if (internalIndex < 0) {
250			std::cerr << names[0] << ". " << names[1] << " is an invalid name" << std::endl;
251			} else {
252			matchInternalIndex(names[0], internalIndex, bs);
253			}
254			}
255	tim	284
256	gezelter	507	break;
257			case 3:
258			//must be molecule.rigidbody.*
259			matchRigidAtoms(names[0], names[1], names[2], bs);
260			break;
261			default:
262			std::cerr << "invalid name: " << name << std::endl;
263			break;
264	tim	283	}
265
266	tim	288	return bs;
267	gezelter	507	}
268	tim	283
269	gezelter	1953	void NameFinder::matchMolecule(const std::string& molName, SelectionSet& bs) {
270	tim	284	std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);
271			std::vector<TreeNode*>::iterator i;
272			for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
273	gezelter	507	bs \|= (*i)->bs;
274	tim	284	}
275	gezelter	507	}
276	tim	284
277	gezelter	1953	void NameFinder::matchStuntDouble(const std::string& molName, const std::string& sdName, SelectionSet& bs){
278	tim	284	std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);
279			std::vector<TreeNode*>::iterator i;
280			for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
281	gezelter	507	std::vector<TreeNode> sdNodes = getMatchedChildren(i, sdName);
282			std::vector<TreeNode*>::iterator j;
283			for (j = sdNodes.begin(); j != sdNodes.end(); ++j) {
284			bs \|= (*j)->bs;
285			}
286	tim	284	}
287
288	gezelter	507	}
289	tim	284
290	gezelter	1953	void NameFinder::matchBond(const std::string& molName,
291			const std::string& bondName, SelectionSet& bs){
292	tim	284	std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);
293			std::vector<TreeNode*>::iterator i;
294			for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
295	gezelter	1953	std::vector<TreeNode> bondNodes = getMatchedChildren(i, bondName);
296			std::vector<TreeNode*>::iterator j;
297			for (j = bondNodes.begin(); j != bondNodes.end(); ++j) {
298			bs \|= (*j)->bs;
299			std::vector<TreeNode> bondAtomNodes = getAllChildren(j);
300			std::vector<TreeNode*>::iterator k;
301			for(k = bondAtomNodes.begin(); k != bondAtomNodes.end(); ++k){
302			bs \|= (*k)->bs;
303			}
304			}
305			}
306			}
307
308			void NameFinder::matchBend(const std::string& molName, const std::string& bendName, SelectionSet& bs){
309			std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);
310			std::vector<TreeNode*>::iterator i;
311			for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
312			std::vector<TreeNode> bendNodes = getMatchedChildren(i, bendName);
313			std::vector<TreeNode*>::iterator j;
314			for (j = bendNodes.begin(); j != bendNodes.end(); ++j) {
315			std::vector<TreeNode> bendAtomNodes = getAllChildren(j);
316			std::vector<TreeNode*>::iterator k;
317			for(k = bendAtomNodes.begin(); k != bendAtomNodes.end(); ++k){
318			bs \|= (*k)->bs;
319			}
320			}
321			}
322			}
323			void NameFinder::matchTorsion(const std::string& molName, const std::string& torsionName, SelectionSet& bs){
324			std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);
325			std::vector<TreeNode*>::iterator i;
326			for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
327			std::vector<TreeNode> torsionNodes = getMatchedChildren(i, torsionName);
328			std::vector<TreeNode*>::iterator j;
329			for (j = torsionNodes.begin(); j != torsionNodes.end(); ++j) {
330			std::vector<TreeNode> torsionAtomNodes = getAllChildren(j);
331			std::vector<TreeNode*>::iterator k;
332			for(k = torsionAtomNodes.begin(); k != torsionAtomNodes.end(); ++k){
333			bs \|= (*k)->bs;
334			}
335			}
336			}
337			}
338			void NameFinder::matchInversion(const std::string& molName, const std::string& inversionName, SelectionSet& bs){
339			std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);
340			std::vector<TreeNode*>::iterator i;
341			for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
342			std::vector<TreeNode> inversionNodes = getMatchedChildren(i, inversionName);
343			std::vector<TreeNode*>::iterator j;
344			for (j = inversionNodes.begin(); j != inversionNodes.end(); ++j) {
345			std::vector<TreeNode> inversionAtomNodes = getAllChildren(j);
346			std::vector<TreeNode*>::iterator k;
347			for(k = inversionAtomNodes.begin(); k != inversionAtomNodes.end(); ++k){
348			bs \|= (*k)->bs;
349			}
350			}
351			}
352			}
353
354			void NameFinder::matchRigidAtoms(const std::string& molName, const std::string& rbName, const std::string& rbAtomName, SelectionSet& bs){
355			std::vector<TreeNode*> molNodes = getMatchedChildren(root_, molName);
356			std::vector<TreeNode*>::iterator i;
357			for( i = molNodes.begin(); i != molNodes.end(); ++i ) {
358	gezelter	507	std::vector<TreeNode> rbNodes = getMatchedChildren(i, rbName);
359			std::vector<TreeNode*>::iterator j;
360			for (j = rbNodes.begin(); j != rbNodes.end(); ++j) {
361			std::vector<TreeNode> rbAtomNodes = getMatchedChildren(j, rbAtomName);
362			std::vector<TreeNode*>::iterator k;
363			for(k = rbAtomNodes.begin(); k != rbAtomNodes.end(); ++k){
364			bs \|= (*k)->bs;
365			}
366			}
367	tim	284	}
368
369	gezelter	507	}
370	tim	284
371	gezelter	1953	std::vector<TreeNode> NameFinder::getAllChildren(TreeNode node) {
372			std::vector<TreeNode*> childNodes;
373			std::map<std::string, TreeNode*>::iterator i;
374			for (i = node->children.begin(); i != node->children.end(); ++i) {
375			childNodes.push_back(i->second);
376			}
377			return childNodes;
378			}
379	tim	284
380	gezelter	507	std::vector<TreeNode> NameFinder::getMatchedChildren(TreeNode node, const std::string& name) {
381	tim	284	std::vector<TreeNode*> matchedNodes;
382			std::map<std::string, TreeNode*>::iterator i;
383			for (i = node->children.begin(); i != node->children.end(); ++i) {
384	gezelter	507	if (isMatched( i->first, name)) {
385			matchedNodes.push_back(i->second);
386			}
387	tim	284	}
388
389			return matchedNodes;
390	gezelter	507	}
391	tim	284
392	gezelter	507	bool NameFinder::isMatched(const std::string& str, const std::string& wildcard) {
393	gezelter	1782	return Wildcard::wildcardfit(wildcard.c_str(), str.c_str()) > 0 ? true : false;
394	gezelter	507	}
395	tim	284
396	tim	303
397	gezelter	1953	void NameFinder::matchInternalIndex(const std::string& name, int internalIndex, SelectionSet& bs){
398	tim	303
399			SimInfo::MoleculeIterator mi;
400			Molecule* mol;
401
402	gezelter	1801	for (mol = info_->beginMolecule(mi); mol != NULL;
403			mol = info_->nextMolecule(mi)) {
404	tim	303
405	gezelter	507	if (isMatched(mol->getMoleculeName(), name) ) {
406			int natoms = mol->getNAtoms();
407			int nrigidbodies = mol->getNRigidBodies();
408			if (internalIndex >= natoms + nrigidbodies) {
409			continue;
410			} else if (internalIndex < natoms) {
411	gezelter	1953	bs.bitsets_[STUNTDOUBLE].setBitOn(mol->getAtomAt(internalIndex)->getGlobalIndex());
412	gezelter	507	continue;
413			} else if ( internalIndex < natoms + nrigidbodies) {
414	gezelter	1953	bs.bitsets_[STUNTDOUBLE].setBitOn(mol->getRigidBodyAt(internalIndex - natoms)->getGlobalIndex());
415	gezelter	507	}
416			}
417	gezelter	1801	}
418	gezelter	507	}
419	tim	303
420	gezelter	1879	bool NameFinder::isInteger(const std::string &str) {
421	gezelter	1782	for(unsigned int i = 0; i < str.size(); ++i){
422	gezelter	507	if (!std::isdigit(str[i])) {
423			return false;
424			}
425	tim	303	}
426			return true;
427	gezelter	507	}
428	tim	303	}