42 |
|
#define SELECTION_NAMEFINDER_HPP |
43 |
|
#include <set> |
44 |
|
#include <string> |
45 |
< |
|
45 |
> |
#include <map> |
46 |
> |
#include "brains/SimInfo.hpp" |
47 |
|
#include "utils/BitSet.hpp" |
48 |
|
namespace oopse { |
49 |
|
|
50 |
< |
enum NameNodeType { |
51 |
< |
rootNode, |
52 |
< |
molNode, |
53 |
< |
atomNode, |
54 |
< |
rbNode, |
55 |
< |
rbAtomNode, |
50 |
> |
class TreeNode{ |
51 |
> |
public: |
52 |
> |
~TreeNode(); |
53 |
> |
std::string name; |
54 |
> |
BitSet bs; |
55 |
> |
std::map<std::string, TreeNode*> children; |
56 |
|
}; |
57 |
|
|
57 |
– |
struct NameNode{ |
58 |
– |
std::string name; |
59 |
– |
BitSet bs; |
60 |
– |
std::vector<NameNode*> children; |
61 |
– |
NameNodeType type; |
62 |
– |
}; |
63 |
– |
|
58 |
|
class NameFinder{ |
59 |
|
public: |
60 |
|
NameFinder(SimInfo* info); |
61 |
< |
bool match(const std::string& name, BitSet& bs); |
61 |
> |
~NameFinder(); |
62 |
> |
BitSet match(const std::string& name); |
63 |
|
|
64 |
|
private: |
65 |
|
void loadNames(); |
66 |
< |
SimInfo* info_; |
66 |
> |
void matchMolecule(const std::string& molName, BitSet& bs); |
67 |
> |
void matchStuntDouble(const std::string& molName, const std::string& sdName, BitSet& bs); |
68 |
> |
void matchRigidAtoms(const std::string& molName, const std::string& rbName, const std::string& rbAtomName, BitSet& bs); |
69 |
|
|
70 |
< |
NameNode* root_; |
70 |
> |
void matchInternalIndex(const std::string& name, int internalIndex, BitSet& bs); |
71 |
> |
|
72 |
> |
TreeNode* createNode(TreeNode* parent, const std::string& name); |
73 |
> |
std::vector<TreeNode*> getMatchedChildren(TreeNode* node, const std::string& name); |
74 |
> |
bool isMatched(const std::string& str, const std::string& wildcard); |
75 |
> |
|
76 |
> |
bool isInteger(const std::string str); |
77 |
> |
|
78 |
> |
SimInfo* info_; |
79 |
> |
int nStuntDouble_; |
80 |
> |
TreeNode* root_; |
81 |
|
}; |
82 |
|
|
83 |
+ |
|
84 |
|
} |
85 |
|
#endif |