Changes in src/molecule_fragmentation.cpp [e138de:e359a8]
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/molecule_fragmentation.cpp
re138de re359a8 111 111 if (!testGraphInsert.second) { 112 112 eLog() << Verbose(0) << "KeySet file must be corrupt as there are two equal key sets therein!" << endl; 113 performCriticalExit(); 113 114 } 114 115 } … … 211 212 } else { 212 213 eLog() << Verbose(0) << "Unable to open " << line << " for writing keysets!" << endl; 214 performCriticalExit(); 213 215 status = false; 214 216 } … … 368 370 } else { 369 371 eLog() << Verbose(0) << "Atom No. " << (*runner).second.first << " was not found in this molecule." << endl; 372 performCriticalExit(); 370 373 } 371 374 } … … 441 444 // transmorph graph keyset list into indexed KeySetList 442 445 if (GlobalKeySetList == NULL) { 443 Log() << Verbose(1) << "ERROR:Given global key set list (graph) is NULL!" << endl;446 eLog() << Verbose(1) << "Given global key set list (graph) is NULL!" << endl; 444 447 return false; 445 448 } … … 449 452 map<int, pair<double,int> > *AdaptiveCriteriaList = ScanAdaptiveFileIntoMap(path, *IndexKeySetList); // (Root No., (Value, Order)) ! 450 453 if (AdaptiveCriteriaList->empty()) { 451 eLog() << Verbose( 0) << "Unable to parse file, incrementing all." << endl;454 eLog() << Verbose(2) << "Unable to parse file, incrementing all." << endl; 452 455 while (Walker->next != end) { 453 456 Walker = Walker->next; … … 638 641 MolecularWalker->Leaf->FragmentBOSSANOVA(FragmentList[FragmentCounter], RootStack[FragmentCounter], MinimumRingSize); 639 642 } else { 640 eLog() << Verbose( 0) << "Subgraph " << MolecularWalker << " has no atoms!" << endl;643 eLog() << Verbose(1) << "Subgraph " << MolecularWalker << " has no atoms!" << endl; 641 644 } 642 645 FragmentCounter++; // next fragment list … … 898 901 } 899 902 } else { 900 Log() << Verbose(0) << "ERROR:Son " << Runner->Name << " has father " << FatherOfRunner->Name << " but its entry in SonList is " << SonList[FatherOfRunner->nr] << "!" << endl;903 eLog() << Verbose(1) << "Son " << Runner->Name << " has father " << FatherOfRunner->Name << " but its entry in SonList is " << SonList[FatherOfRunner->nr] << "!" << endl; 901 904 } 902 905 if ((LonelyFlag) && (Leaf->AtomCount > 1)) { … … 1133 1136 Log() << Verbose(0) << endl; 1134 1137 //if (!CheckForConnectedSubgraph(FragmentSearch->FragmentSet)) 1135 // Log() << Verbose(0) << "ERROR:The found fragment is not a connected subgraph!" << endl;1138 //eLog() << Verbose(1) << "The found fragment is not a connected subgraph!" << endl; 1136 1139 InsertFragmentIntoGraph(FragmentSearch); 1137 1140 }
Note:
See TracChangeset
for help on using the changeset viewer.