133 |
|
ii++; |
134 |
|
} |
135 |
|
|
136 |
– |
// sort the foundBonds by the score: |
136 |
|
|
137 |
< |
std::sort(foundBonds.begin(), foundBonds.end()); |
138 |
< |
|
139 |
< |
int bestScore = foundBonds[0].first; |
140 |
< |
std::vector<std::string> theKeys = foundBonds[0].second; |
141 |
< |
|
142 |
< |
std::cout << "best matching bond = " << theKeys[0] << "\t" << theKeys[1] << "\t(score = "<< bestScore << ")\n"; |
143 |
< |
BondType* bestType = bondTypeCont_.find(theKeys); |
144 |
< |
if (bestType) |
145 |
< |
return bestType; |
146 |
< |
else { |
147 |
< |
//if no exact match found, try wild card match |
148 |
< |
return bondTypeCont_.find(keys, wildCardAtomTypeName_); |
137 |
> |
if (foundBonds.size() > 0) { |
138 |
> |
// sort the foundBonds by the score: |
139 |
> |
std::sort(foundBonds.begin(), foundBonds.end()); |
140 |
> |
|
141 |
> |
int bestScore = foundBonds[0].first; |
142 |
> |
std::vector<std::string> theKeys = foundBonds[0].second; |
143 |
> |
|
144 |
> |
BondType* bestType = bondTypeCont_.find(theKeys); |
145 |
> |
|
146 |
> |
return bestType; |
147 |
> |
} else { |
148 |
> |
//if no exact match found, try wild card match |
149 |
> |
return bondTypeCont_.find(keys, wildCardAtomTypeName_); |
150 |
|
} |
151 |
|
} |
152 |
|
} |
220 |
|
jj++; |
221 |
|
} |
222 |
|
|
223 |
< |
std::sort(foundBends.begin(), foundBends.end()); |
224 |
< |
|
225 |
< |
int jscore = foundBends[0].first; |
226 |
< |
int ikscore = foundBends[0].second; |
227 |
< |
std::vector<std::string> theKeys = foundBends[0].third; |
228 |
< |
|
229 |
< |
std::cout << "best matching bend = " << theKeys[0] << "\t" <<theKeys[1] << "\t" << theKeys[2] << "\t(scores = "<< jscore << "\t" << ikscore << ")\n"; |
230 |
< |
|
231 |
< |
BendType* bestType = bendTypeCont_.find(theKeys); |
232 |
< |
if (bestType) |
233 |
< |
return bestType; |
234 |
< |
else { |
235 |
< |
|
223 |
> |
if (foundBends.size() > 0) { |
224 |
> |
std::sort(foundBends.begin(), foundBends.end()); |
225 |
> |
int jscore = foundBends[0].first; |
226 |
> |
int ikscore = foundBends[0].second; |
227 |
> |
std::vector<std::string> theKeys = foundBends[0].third; |
228 |
> |
|
229 |
> |
BendType* bestType = bendTypeCont_.find(theKeys); |
230 |
> |
return bestType; |
231 |
> |
} else { |
232 |
|
//if no exact match found, try wild card match |
233 |
|
return bendTypeCont_.find(keys, wildCardAtomTypeName_); |
234 |
|
} |
235 |
|
} |
236 |
|
} |
237 |
|
|
242 |
– |
|
238 |
|
TorsionType* ForceField::getTorsionType(const std::string &at1, |
239 |
|
const std::string &at2, |
240 |
|
const std::string &at3, |
322 |
|
jj++; |
323 |
|
} |
324 |
|
|
325 |
< |
std::sort(foundTorsions.begin(), foundTorsions.end()); |
325 |
> |
if (foundTorsions.size() > 0) { |
326 |
> |
std::sort(foundTorsions.begin(), foundTorsions.end()); |
327 |
> |
int jkscore = foundTorsions[0].first; |
328 |
> |
int ilscore = foundTorsions[0].second; |
329 |
> |
std::vector<std::string> theKeys = foundTorsions[0].third; |
330 |
> |
|
331 |
> |
TorsionType* bestType = torsionTypeCont_.find(theKeys); |
332 |
> |
return bestType; |
333 |
> |
} else { |
334 |
> |
//if no exact match found, try wild card match |
335 |
> |
return torsionTypeCont_.find(keys, wildCardAtomTypeName_); |
336 |
> |
} |
337 |
> |
} |
338 |
> |
} |
339 |
|
|
340 |
< |
int jkscore = foundTorsions[0].first; |
341 |
< |
int ilscore = foundTorsions[0].second; |
342 |
< |
std::vector<std::string> theKeys = foundTorsions[0].third; |
340 |
> |
InversionType* ForceField::getInversionType(const std::string &at1, |
341 |
> |
const std::string &at2, |
342 |
> |
const std::string &at3, |
343 |
> |
const std::string &at4) { |
344 |
> |
std::vector<std::string> keys; |
345 |
> |
keys.push_back(at1); |
346 |
> |
keys.push_back(at2); |
347 |
> |
keys.push_back(at3); |
348 |
> |
keys.push_back(at4); |
349 |
|
|
350 |
< |
std::cout << "best matching torsion = " << theKeys[0] << "\t" <<theKeys[1] << "\t" << theKeys[2] << "\t" << theKeys[3] << "\t(scores = "<< jkscore << "\t" << ilscore << ")\n"; |
350 |
> |
//try exact match first |
351 |
> |
InversionType* inversionType = inversionTypeCont_.permutedFindSkippingFirstElement(keys); |
352 |
> |
if (inversionType) { |
353 |
> |
return inversionType; |
354 |
> |
} else { |
355 |
> |
|
356 |
> |
AtomType* atype1; |
357 |
> |
AtomType* atype2; |
358 |
> |
AtomType* atype3; |
359 |
> |
AtomType* atype4; |
360 |
> |
std::vector<std::string> at1key; |
361 |
> |
at1key.push_back(at1); |
362 |
> |
atype1 = atomTypeCont_.find(at1key); |
363 |
> |
|
364 |
> |
std::vector<std::string> at2key; |
365 |
> |
at2key.push_back(at2); |
366 |
> |
atype2 = atomTypeCont_.find(at2key); |
367 |
> |
|
368 |
> |
std::vector<std::string> at3key; |
369 |
> |
at3key.push_back(at3); |
370 |
> |
atype3 = atomTypeCont_.find(at3key); |
371 |
> |
|
372 |
> |
std::vector<std::string> at4key; |
373 |
> |
at4key.push_back(at4); |
374 |
> |
atype4 = atomTypeCont_.find(at4key); |
375 |
|
|
376 |
+ |
// query atom types for their chains of responsibility |
377 |
+ |
std::vector<AtomType*> at1Chain = atype1->allYourBase(); |
378 |
+ |
std::vector<AtomType*> at2Chain = atype2->allYourBase(); |
379 |
+ |
std::vector<AtomType*> at3Chain = atype3->allYourBase(); |
380 |
+ |
std::vector<AtomType*> at4Chain = atype4->allYourBase(); |
381 |
+ |
|
382 |
+ |
std::vector<AtomType*>::iterator i; |
383 |
+ |
std::vector<AtomType*>::iterator j; |
384 |
+ |
std::vector<AtomType*>::iterator k; |
385 |
+ |
std::vector<AtomType*>::iterator l; |
386 |
+ |
|
387 |
+ |
int ii = 0; |
388 |
+ |
int jj = 0; |
389 |
+ |
int kk = 0; |
390 |
+ |
int ll = 0; |
391 |
+ |
int Iscore; |
392 |
+ |
int JKLscore; |
393 |
|
|
394 |
< |
TorsionType* bestType = torsionTypeCont_.find(theKeys); |
395 |
< |
if (bestType) { |
396 |
< |
return bestType; |
394 |
> |
std::vector<tuple3<int, int, std::vector<std::string> > > foundInversions; |
395 |
> |
|
396 |
> |
for (j = at2Chain.begin(); j != at2Chain.end(); j++) { |
397 |
> |
kk = 0; |
398 |
> |
for (k = at3Chain.begin(); k != at3Chain.end(); k++) { |
399 |
> |
ii = 0; |
400 |
> |
for (i = at1Chain.begin(); i != at1Chain.end(); i++) { |
401 |
> |
ll = 0; |
402 |
> |
for (l = at4Chain.begin(); l != at4Chain.end(); l++) { |
403 |
> |
|
404 |
> |
Iscore = ii; |
405 |
> |
JKLscore = jj + kk + ll; |
406 |
> |
|
407 |
> |
std::vector<std::string> myKeys; |
408 |
> |
myKeys.push_back((*i)->getName()); |
409 |
> |
myKeys.push_back((*j)->getName()); |
410 |
> |
myKeys.push_back((*k)->getName()); |
411 |
> |
myKeys.push_back((*l)->getName()); |
412 |
> |
|
413 |
> |
InversionType* inversionType = inversionTypeCont_.permutedFindSkippingFirstElement(myKeys); |
414 |
> |
if (inversionType) { |
415 |
> |
foundInversions.push_back( make_tuple3(Iscore, JKLscore, myKeys) ); |
416 |
> |
} |
417 |
> |
ll++; |
418 |
> |
} |
419 |
> |
ii++; |
420 |
> |
} |
421 |
> |
kk++; |
422 |
> |
} |
423 |
> |
jj++; |
424 |
> |
} |
425 |
> |
|
426 |
> |
if (foundInversions.size() > 0) { |
427 |
> |
std::sort(foundInversions.begin(), foundInversions.end()); |
428 |
> |
int iscore = foundInversions[0].first; |
429 |
> |
int jklscore = foundInversions[0].second; |
430 |
> |
std::vector<std::string> theKeys = foundInversions[0].third; |
431 |
> |
|
432 |
> |
InversionType* bestType = inversionTypeCont_.permutedFindSkippingFirstElement(theKeys); |
433 |
> |
return bestType; |
434 |
|
} else { |
435 |
|
//if no exact match found, try wild card match |
436 |
< |
return torsionTypeCont_.find(keys, wildCardAtomTypeName_); |
436 |
> |
return inversionTypeCont_.find(keys, wildCardAtomTypeName_); |
437 |
|
} |
438 |
|
} |
439 |
|
} |
440 |
< |
|
440 |
> |
|
441 |
|
NonBondedInteractionType* ForceField::getNonBondedInteractionType(const std::string &at1, const std::string &at2) { |
442 |
|
std::vector<std::string> keys; |
443 |
|
keys.push_back(at1); |
482 |
|
keys.push_back(at4); |
483 |
|
return torsionTypeCont_.find(keys); |
484 |
|
} |
485 |
< |
|
485 |
> |
|
486 |
> |
InversionType* ForceField::getExactInversionType(const std::string &at1, |
487 |
> |
const std::string &at2, |
488 |
> |
const std::string &at3, |
489 |
> |
const std::string &at4){ |
490 |
> |
std::vector<std::string> keys; |
491 |
> |
keys.push_back(at1); |
492 |
> |
keys.push_back(at2); |
493 |
> |
keys.push_back(at3); |
494 |
> |
keys.push_back(at4); |
495 |
> |
return inversionTypeCont_.find(keys); |
496 |
> |
} |
497 |
> |
|
498 |
|
NonBondedInteractionType* ForceField::getExactNonBondedInteractionType(const std::string &at1, const std::string &at2){ |
499 |
|
std::vector<std::string> keys; |
500 |
|
keys.push_back(at1); |
501 |
|
keys.push_back(at2); |
502 |
|
return nonBondedInteractionTypeCont_.find(keys); |
503 |
|
} |
504 |
+ |
|
505 |
|
|
401 |
– |
|
506 |
|
bool ForceField::addAtomType(const std::string &at, AtomType* atomType) { |
507 |
|
std::vector<std::string> keys; |
508 |
|
keys.push_back(at); |
509 |
|
return atomTypeCont_.add(keys, atomType); |
510 |
|
} |
511 |
|
|
512 |
+ |
bool ForceField::replaceAtomType(const std::string &at, AtomType* atomType) { |
513 |
+ |
std::vector<std::string> keys; |
514 |
+ |
keys.push_back(at); |
515 |
+ |
return atomTypeCont_.replace(keys, atomType); |
516 |
+ |
} |
517 |
+ |
|
518 |
|
bool ForceField::addBondType(const std::string &at1, const std::string &at2, |
519 |
|
BondType* bondType) { |
520 |
|
std::vector<std::string> keys; |
545 |
|
return torsionTypeCont_.add(keys, torsionType); |
546 |
|
} |
547 |
|
|
548 |
+ |
bool ForceField::addInversionType(const std::string &at1, |
549 |
+ |
const std::string &at2, |
550 |
+ |
const std::string &at3, |
551 |
+ |
const std::string &at4, |
552 |
+ |
InversionType* inversionType) { |
553 |
+ |
std::vector<std::string> keys; |
554 |
+ |
keys.push_back(at1); |
555 |
+ |
keys.push_back(at2); |
556 |
+ |
keys.push_back(at3); |
557 |
+ |
keys.push_back(at4); |
558 |
+ |
return inversionTypeCont_.add(keys, inversionType); |
559 |
+ |
} |
560 |
+ |
|
561 |
|
bool ForceField::addNonBondedInteractionType(const std::string &at1, |
562 |
|
const std::string &at2, |
563 |
|
NonBondedInteractionType* nbiType) { |