| 49 |  | namespace oopse { | 
| 50 |  |  | 
| 51 |  |  | 
| 52 | < | SelectionEvaluator::SelectionEvaluator(SimInfo* si, const std::string& script) : info(si), finder(info){ | 
| 52 | > | SelectionEvaluator::SelectionEvaluator(SimInfo* si) | 
| 53 | > | : info(si), nameFinder(info), distanceFinder(info), indexFinder(info), isLoaded_(false){ | 
| 54 | > |  | 
| 55 | > | nStuntDouble = info->getNGlobalAtoms() + info->getNRigidBodies(); | 
| 56 |  | } | 
| 57 |  |  | 
| 58 |  | bool SelectionEvaluator::loadScript(const std::string& filename, const std::string& script) { | 
| 59 | + | clearDefinitionsAndLoadPredefined(); | 
| 60 |  | this->filename = filename; | 
| 61 |  | this->script = script; | 
| 62 |  | if (! compiler.compile(filename, script)) { | 
| 63 |  | error = true; | 
| 64 |  | errorMessage = compiler.getErrorMessage(); | 
| 65 | + | std::cerr << "SelectionCompiler Error: " << errorMessage << std::endl; | 
| 66 |  | return false; | 
| 67 |  | } | 
| 68 |  |  | 
| 70 |  | aatoken = compiler.getAatokenCompiled(); | 
| 71 |  | linenumbers = compiler.getLineNumbers(); | 
| 72 |  | lineIndices = compiler.getLineIndices(); | 
| 73 | + |  | 
| 74 | + | std::vector<std::vector<Token> >::const_iterator i; | 
| 75 | + |  | 
| 76 | + | isDynamic_ = false; | 
| 77 | + | for (i = aatoken.begin(); i != aatoken.end(); ++i) { | 
| 78 | + | if (containDynamicToken(*i)) { | 
| 79 | + | isDynamic_ = true; | 
| 80 | + | break; | 
| 81 | + | } | 
| 82 | + | } | 
| 83 | + |  | 
| 84 | + | isLoaded_ = true; | 
| 85 |  | return true; | 
| 86 |  | } | 
| 87 |  |  | 
| 88 |  | void SelectionEvaluator::clearState() { | 
| 89 | < | for (int i = scriptLevelMax; --i >= 0; ) | 
| 90 | < | stack[i].clear(); | 
| 91 | < | scriptLevel = 0; | 
| 89 | > | //for (int i = scriptLevelMax; --i >= 0; ) | 
| 90 | > | //    stack[i].clear(); | 
| 91 | > | //scriptLevel = 0; | 
| 92 |  | error = false; | 
| 93 |  | errorMessage = ""; | 
| 94 |  | } | 
| 104 |  | } | 
| 105 |  |  | 
| 106 |  | bool SelectionEvaluator::loadScriptFileInternal(const  std::string & filename) { | 
| 107 | < | return true; /**@todo */ | 
| 108 | < | } | 
| 107 | > | std::ifstream ifs(filename.c_str()); | 
| 108 | > | if (!ifs.is_open()) { | 
| 109 | > | return false; | 
| 110 | > | } | 
| 111 |  |  | 
| 112 | < | void SelectionEvaluator::instructionDispatchLoop(){ | 
| 112 | > | const int bufferSize = 65535; | 
| 113 | > | char buffer[bufferSize]; | 
| 114 | > | std::string script; | 
| 115 | > | while(ifs.getline(buffer, bufferSize)) { | 
| 116 | > | script += buffer; | 
| 117 | > | } | 
| 118 | > | return loadScript(filename, script); | 
| 119 | > | } | 
| 120 |  |  | 
| 121 | + | void SelectionEvaluator::instructionDispatchLoop(BitSet& bs){ | 
| 122 | + |  | 
| 123 |  | while ( pc < aatoken.size()) { | 
| 124 |  | statement = aatoken[pc++]; | 
| 125 |  | statementLength = statement.size(); | 
| 129 |  | define(); | 
| 130 |  | break; | 
| 131 |  | case Token::select: | 
| 132 | < | select(); | 
| 132 | > | select(bs); | 
| 133 |  | break; | 
| 134 |  | default: | 
| 135 |  | unrecognizedCommand(token); | 
| 136 |  | return; | 
| 137 |  | } | 
| 138 |  | } | 
| 139 | + |  | 
| 140 |  | } | 
| 141 |  |  | 
| 142 |  | BitSet SelectionEvaluator::expression(const std::vector<Token>& code, int pcStart) { | 
| 143 |  | BitSet bs; | 
| 144 |  | std::stack<BitSet> stack; | 
| 145 |  |  | 
| 146 | < | for (int pc = pcStart; ; ++pc) { | 
| 146 | > | for (int pc = pcStart; pc < code.size(); ++pc) { | 
| 147 |  | Token instruction = code[pc]; | 
| 148 |  |  | 
| 149 |  | switch (instruction.tok) { | 
| 183 |  | case Token::name: | 
| 184 |  | stack.push(nameInstruction(boost::any_cast<std::string>(instruction.value))); | 
| 185 |  | break; | 
| 186 | + | case Token::index: | 
| 187 | + | stack.push(indexInstruction(instruction.value)); | 
| 188 |  | break; | 
| 189 |  | case Token::identifier: | 
| 190 |  | stack.push(lookupValue(boost::any_cast<std::string>(instruction.value))); | 
| 215 |  | float comparisonValue = boost::any_cast<float>(instruction.value); | 
| 216 |  | float propertyValue; | 
| 217 |  | BitSet bs(nStuntDouble); | 
| 218 | + | bs.clearAll(); | 
| 219 |  |  | 
| 220 |  | SimInfo::MoleculeIterator mi; | 
| 221 |  | Molecule* mol; | 
| 282 |  | } | 
| 283 |  |  | 
| 284 |  | void SelectionEvaluator::withinInstruction(const Token& instruction, BitSet& bs){ | 
| 285 | < |  | 
| 285 | > |  | 
| 286 |  | boost::any withinSpec = instruction.value; | 
| 287 | + | float distance; | 
| 288 |  | if (withinSpec.type() == typeid(float)){ | 
| 289 | < | // | 
| 290 | < | return; | 
| 289 | > | distance = boost::any_cast<float>(withinSpec); | 
| 290 | > | } else if (withinSpec.type() == typeid(int)) { | 
| 291 | > | distance = boost::any_cast<int>(withinSpec); | 
| 292 | > | } else { | 
| 293 | > | evalError("casting error in withinInstruction"); | 
| 294 | > | bs.clearAll(); | 
| 295 |  | } | 
| 296 |  |  | 
| 297 | < | evalError("Unrecognized within parameter"); | 
| 297 | > | bs = distanceFinder.find(bs, distance); | 
| 298 |  | } | 
| 299 |  |  | 
| 300 |  | void SelectionEvaluator::define() { | 
| 302 |  |  | 
| 303 |  | std::string variable = boost::any_cast<std::string>(statement[1].value); | 
| 304 |  |  | 
| 305 | < | variables.insert(std::make_pair(variable, expression(statement, 2))); | 
| 305 | > | variables.insert(VariablesType::value_type(variable, expression(statement, 2))); | 
| 306 |  | } | 
| 307 |  |  | 
| 308 |  |  | 
| 321 |  | int tok = statement[1].tok; | 
| 322 |  | if (tok == Token::identifier || (tok & Token::predefinedset) == Token::predefinedset) { | 
| 323 |  | std::string variable = boost::any_cast<std::string>(statement[1].value); | 
| 324 | < | variables.insert(std::make_pair(variable, statement)); | 
| 324 | > | variables.insert(VariablesType::value_type(variable, statement)); | 
| 325 |  |  | 
| 326 |  | } else { | 
| 327 |  | evalError("invalid variable name:" + script); | 
| 338 |  |  | 
| 339 |  | } | 
| 340 |  |  | 
| 341 | < | void SelectionEvaluator::select(){ | 
| 342 | < | //viewer.setSelectionSet(expression(statement, 1)); | 
| 341 | > | void SelectionEvaluator::select(BitSet& bs){ | 
| 342 | > | bs = expression(statement, 1); | 
| 343 |  | } | 
| 344 |  |  | 
| 345 |  | BitSet SelectionEvaluator::lookupValue(const std::string& variable){ | 
| 346 |  |  | 
| 347 | + | BitSet bs(nStuntDouble); | 
| 348 |  | std::map<std::string, boost::any>::iterator i = variables.find(variable); | 
| 349 | < |  | 
| 349 | > |  | 
| 350 |  | if (i != variables.end()) { | 
| 351 |  | if (i->second.type() == typeid(BitSet)) { | 
| 352 |  | return boost::any_cast<BitSet>(i->second); | 
| 353 |  | } else if (i->second.type() ==  typeid(std::vector<Token>)){ | 
| 354 | < | BitSet bs = expression(boost::any_cast<std::vector<Token> >(i->second), 2); | 
| 354 | > | bs = expression(boost::any_cast<std::vector<Token> >(i->second), 2); | 
| 355 |  | i->second =  bs; /**@todo fixme */ | 
| 356 |  | return bs; | 
| 357 |  | } | 
| 358 |  | } else { | 
| 359 |  | unrecognizedIdentifier(variable); | 
| 360 |  | } | 
| 361 | + |  | 
| 362 | + | return bs; | 
| 363 |  | } | 
| 364 |  |  | 
| 365 |  | BitSet SelectionEvaluator::nameInstruction(const std::string& name){ | 
| 326 | – | BitSet bs(nStuntDouble); | 
| 366 |  |  | 
| 367 | < | bool hasError = finder.match(name, bs); | 
| 368 | < |  | 
| 330 | < | return bs; | 
| 367 | > | return nameFinder.match(name); | 
| 368 | > |  | 
| 369 |  | } | 
| 370 |  |  | 
| 371 | + | bool SelectionEvaluator::containDynamicToken(const std::vector<Token>& tokens){ | 
| 372 | + | std::vector<Token>::const_iterator i; | 
| 373 | + | for (i = tokens.begin(); i != tokens.end(); ++i) { | 
| 374 | + | if (i->tok & Token::dynamic) { | 
| 375 | + | return true; | 
| 376 | + | } | 
| 377 | + | } | 
| 378 |  |  | 
| 379 | + | return false; | 
| 380 | + | } | 
| 381 | + |  | 
| 382 | + | void SelectionEvaluator::clearDefinitionsAndLoadPredefined() { | 
| 383 | + | variables.clear(); | 
| 384 | + | //load predefine | 
| 385 | + | //predefine(); | 
| 386 |  | } | 
| 387 | + |  | 
| 388 | + | BitSet SelectionEvaluator::evaluate() { | 
| 389 | + | BitSet bs(nStuntDouble); | 
| 390 | + | if (isLoaded_) { | 
| 391 | + | pc = 0; | 
| 392 | + | instructionDispatchLoop(bs); | 
| 393 | + | } | 
| 394 | + |  | 
| 395 | + | return bs; | 
| 396 | + | } | 
| 397 | + |  | 
| 398 | + | BitSet SelectionEvaluator::indexInstruction(const boost::any& value) { | 
| 399 | + | BitSet bs(nStuntDouble); | 
| 400 | + |  | 
| 401 | + | if (value.type() == typeid(int)) { | 
| 402 | + | int index = boost::any_cast<int>(value); | 
| 403 | + | if (index < 0 || index >= bs.size()) { | 
| 404 | + | invalidIndex(index); | 
| 405 | + | } else { | 
| 406 | + | indexFinder.find(index); | 
| 407 | + | } | 
| 408 | + | } else if (value.type() == typeid(std::pair<int, int>)) { | 
| 409 | + | std::pair<int, int> indexRange= boost::any_cast<std::pair<int, int> >(value); | 
| 410 | + | assert(indexRange.first <= indexRange.second); | 
| 411 | + | if (indexRange.first < 0 || indexRange.second >= bs.size()) { | 
| 412 | + | invalidIndexRange(indexRange); | 
| 413 | + | }else { | 
| 414 | + | indexFinder.find(indexRange.first, indexRange.second); | 
| 415 | + | } | 
| 416 | + | } | 
| 417 | + |  | 
| 418 | + | return bs; | 
| 419 | + | } | 
| 420 | + |  | 
| 421 | + | } |