Changes in src/periodentafel.cpp [49e1ae:745a85]
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
src/periodentafel.cpp
r49e1ae r745a85 10 10 #include <fstream> 11 11 #include <cstring> 12 #include <cassert> 12 13 13 14 #include "element.hpp" … … 18 19 #include "verbose.hpp" 19 20 21 using namespace std; 22 20 23 /************************************* Functions for class periodentafel ***************************/ 21 24 … … 23 26 * Initialises start and end of list and resets periodentafel::checkliste to false. 24 27 */ 25 periodentafel::periodentafel() : start(new element), end(new element) 26 { 27 start->previous = NULL; 28 start->next = end; 29 end->previous = start; 30 end->next = NULL; 31 }; 28 periodentafel::periodentafel() 29 {}; 32 30 33 31 /** destructor for class periodentafel … … 37 35 { 38 36 CleanupPeriodtable(); 39 delete(end);40 delete(start);41 37 }; 42 38 … … 45 41 * \return true - succeeded, false - does not occur 46 42 */ 47 bool periodentafel::AddElement(element * const pointer) 48 { 43 periodentafel::iterator periodentafel::AddElement(element * const pointer) 44 { 45 atomicNumber_t Z = pointer->getNumber(); 46 assert(!elements.count(Z)); 49 47 pointer->sort = &pointer->Z; 50 if (pointer-> Z < 1 && pointer->Z>= MAX_ELEMENTS)48 if (pointer->getNumber() < 1 && pointer->getNumber() >= MAX_ELEMENTS) 51 49 Log() << Verbose(0) << "Invalid Z number!\n"; 52 return add(pointer, end); 50 pair<iterator,bool> res = elements.insert(pair<atomicNumber_t,element*>(Z,pointer)); 51 return res.first; 53 52 }; 54 53 … … 57 56 * \return true - succeeded, false - element not found 58 57 */ 59 bool periodentafel::RemoveElement(element * const pointer) 60 { 61 return remove(pointer, start, end); 58 void periodentafel::RemoveElement(element * const pointer) 59 { 60 atomicNumber_t Z = pointer->getNumber(); 61 elements.erase(Z); 62 62 }; 63 63 … … 65 65 * \return true - succeeded, false - does not occur 66 66 */ 67 bool periodentafel::CleanupPeriodtable() 68 { 69 return cleanup(start,end); 67 void periodentafel::CleanupPeriodtable() 68 { 69 for(iterator iter=elements.begin();iter!=elements.end();++iter){ 70 delete(*iter).second; 71 } 72 elements.clear(); 70 73 }; 71 74 … … 75 78 * \return pointer to element or NULL if not found 76 79 */ 77 element * const periodentafel::FindElement(const int Z) const78 { 79 element *walker = find(&Z, start,end);80 return (walker);80 const element * periodentafel::FindElement(atomicNumber_t Z) const 81 { 82 const_iterator res = elements.find(Z); 83 return res!=elements.end()?((*res).second):0; 81 84 }; 82 85 … … 86 89 * \return pointer to element 87 90 */ 88 element * const periodentafel::FindElement(const char * const shorthand) const 89 { 90 element *walker = periodentafel::start; 91 while (walker->next != periodentafel::end) { 92 walker = walker->next; 93 if (strncmp(walker->symbol, shorthand, 3) == 0) 94 return(walker); 95 } 96 return (NULL); 91 const element * periodentafel::FindElement(const char * const shorthand) const 92 { 93 element *res = 0; 94 for(const_iterator iter=elements.begin();iter!=elements.end();++iter) { 95 if((*iter).second->getSymbol() == shorthand){ 96 res = (*iter).second; 97 break; 98 } 99 } 100 return res; 97 101 }; 98 102 99 103 /** Asks for element number and returns pointer to element 100 104 */ 101 element * constperiodentafel::AskElement() const102 { 103 element *walker = NULL;105 const element * periodentafel::AskElement() const 106 { 107 const element *walker = NULL; 104 108 int Z; 105 109 do { … … 114 118 * \return pointer to either present or newly created element 115 119 */ 116 element * constperiodentafel::EnterElement()117 { 118 element *walker= NULL;119 int Z = -1;120 const element * periodentafel::EnterElement() 121 { 122 const element *res = NULL; 123 atomicNumber_t Z = 0; 120 124 Log() << Verbose(0) << "Atomic number: " << Z << endl; 121 125 cin >> Z; 122 walker = FindElement(Z); 123 if (walker == NULL) { 126 res = FindElement(Z); 127 if (!res) { 128 // TODO: make this using the constructor 129 element *tmp; 124 130 Log() << Verbose(0) << "Element not found in database, please enter." << endl; 125 walker= new element;126 walker->Z = Z;131 tmp = new element; 132 tmp->Z = Z; 127 133 Log() << Verbose(0) << "Mass: " << endl; 128 cin >> walker->mass;134 cin >> tmp->mass; 129 135 Log() << Verbose(0) << "Name [max 64 chars]: " << endl; 130 cin >> walker->name;136 cin >> tmp->name; 131 137 Log() << Verbose(0) << "Short form [max 3 chars]: " << endl; 132 cin >> walker->symbol; 133 periodentafel::AddElement(walker); 134 } 135 return(walker); 136 }; 138 cin >> tmp->symbol; 139 AddElement(tmp); 140 res = tmp; 141 } 142 return res; 143 }; 144 145 146 /******************** Access to iterators ****************************/ 147 periodentafel::const_iterator periodentafel::begin(){ 148 return elements.begin(); 149 } 150 151 periodentafel::const_iterator periodentafel::end(){ 152 return elements.end(); 153 } 154 155 periodentafel::reverse_iterator periodentafel::rbegin(){ 156 return reverse_iterator(elements.end()); 157 } 158 159 periodentafel::reverse_iterator periodentafel::rend(){ 160 return reverse_iterator(elements.begin()); 161 } 137 162 138 163 /** Prints period table to given stream. 139 164 * \param output stream 140 165 */ 141 bool periodentafel::Output(o fstream * const output) const166 bool periodentafel::Output(ostream * const output) const 142 167 { 143 168 bool result = true; 144 element *walker = start;145 169 if (output != NULL) { 146 while (walker->next != end) { 147 walker = walker->next; 148 result = result && walker->Output(output); 170 for(const_iterator iter=elements.begin(); iter !=elements.end();++iter){ 171 result = result && (*iter).second->Output(output); 149 172 } 150 173 return result; … … 157 180 * \param *checkliste elements table for this molecule 158 181 */ 159 bool periodentafel::Checkout(ofstream * const output, const int * const checkliste) const 160 { 161 element *walker = start; 182 bool periodentafel::Checkout(ostream * const output, const int * const checkliste) const 183 { 162 184 bool result = true; 163 185 int No = 1; … … 166 188 *output << "# Ion type data (PP = PseudoPotential, Z = atomic number)" << endl; 167 189 *output << "#Ion_TypeNr.\tAmount\tZ\tRGauss\tL_Max(PP)L_Loc(PP)IonMass\t# chemical name, symbol" << endl; 168 while (walker->next != end) { 169 walker = walker->next; 170 if ((walker != NULL) && (walker->Z > 0) && (walker->Z < MAX_ELEMENTS) && (checkliste[walker->Z])) { 171 walker->No = No; 172 result = result && walker->Checkout(output, No++, checkliste[walker->Z]); 190 for(const_iterator iter=elements.begin(); iter!=elements.end();++iter){ 191 if (((*iter).first < MAX_ELEMENTS) && (checkliste[(*iter).first])) { 192 (*iter).second->No = No; 193 result = result && (*iter).second->Checkout(output, No++, checkliste[(*iter).first]); 173 194 } 174 195 } … … 184 205 { 185 206 ifstream infile; 186 double tmp;187 207 element *ptr; 208 map<atomicNumber_t,element*> parsedElems; 188 209 bool status = true; 189 210 bool otherstatus = true; … … 223 244 //neues->Output((ofstream *)&cout); 224 245 if ((neues->Z > 0) && (neues->Z < MAX_ELEMENTS)) 225 p eriodentafel::AddElement(neues);246 parsedElems[neues->getNumber()] = neues; 226 247 else { 227 248 Log() << Verbose(0) << "Could not parse element: "; … … 243 264 if (infile != NULL) { 244 265 while (!infile.eof()) { 245 infile >> tmp; 246 infile >> ws; 247 infile >> FindElement((int)tmp)->Valence; 266 atomicNumber_t Z; 267 infile >> Z; 268 infile >> ws; 269 infile >> parsedElems[Z]->Valence; 248 270 infile >> ws; 249 271 //Log() << Verbose(3) << "Element " << (int)tmp << " has " << FindElement((int)tmp)->Valence << " valence electrons." << endl; … … 261 283 if (infile != NULL) { 262 284 while (!infile.eof()) { 263 infile >> tmp; 264 infile >> ws; 265 infile >> FindElement((int)tmp)->NoValenceOrbitals; 285 atomicNumber_t Z; 286 infile >> Z; 287 infile >> ws; 288 infile >> parsedElems[Z]->NoValenceOrbitals; 266 289 infile >> ws; 267 290 //Log() << Verbose(3) << "Element " << (int)tmp << " has " << FindElement((int)tmp)->NoValenceOrbitals << " number of singly occupied valence orbitals." << endl; … … 279 302 if (infile != NULL) { 280 303 while (!infile.eof()) { 281 infile >> tmp; 282 ptr = FindElement((int)tmp); 304 atomicNumber_t Z; 305 infile >> Z; 306 ptr = parsedElems[Z]; 283 307 infile >> ws; 284 308 infile >> ptr->HBondDistance[0]; … … 300 324 if (infile != NULL) { 301 325 while (!infile.eof()) { 302 infile >> tmp; 303 ptr = FindElement((int)tmp); 326 atomicNumber_t Z; 327 infile >> Z; 328 ptr = parsedElems[Z]; 304 329 infile >> ws; 305 330 infile >> ptr->HBondAngle[0]; … … 313 338 otherstatus = false; 314 339 315 if (!otherstatus) 340 if (otherstatus){ 341 map<atomicNumber_t,element*>::iterator iter; 342 for(iter=parsedElems.begin();iter!=parsedElems.end();++iter){ 343 AddElement((*iter).second); 344 } 345 } 346 else{ 316 347 eLog() << Verbose(2) << "Something went wrong while parsing the other databases!" << endl; 348 map<atomicNumber_t,element*>::iterator iter; 349 for(iter=parsedElems.begin();iter!=parsedElems.end();++iter){ 350 AddElement((*iter).second); 351 } 352 } 317 353 318 354 return status; … … 334 370 f << header1 << endl; 335 371 f << header2 << endl; 336 element *walker = periodentafel::start; 337 while (walker->next != periodentafel::end) { 338 walker = walker->next; 339 result = result && walker->Output(&f); 372 for(const_iterator iter=elements.begin();iter!=elements.end();++iter){ 373 result = result && (*iter).second->Output(&f); 340 374 } 341 375 f.close();
Note:
See TracChangeset
for help on using the changeset viewer.