| [14de469] | 1 | /** \file helpers.hpp | 
|---|
|  | 2 | * | 
|---|
| [6ac7ee] | 3 | * Declaration of some auxiliary functions for memory dis-/allocation and so on | 
|---|
| [14de469] | 4 | */ | 
|---|
|  | 5 |  | 
|---|
|  | 6 | #ifndef HELPERS_HPP_ | 
|---|
|  | 7 | #define HELPERS_HPP_ | 
|---|
|  | 8 |  | 
|---|
|  | 9 | using namespace std; | 
|---|
|  | 10 |  | 
|---|
| [f66195] | 11 | /*********************************************** includes ***********************************/ | 
|---|
|  | 12 |  | 
|---|
| [cd4ccc] | 13 | // include config.h | 
|---|
|  | 14 | #ifdef HAVE_CONFIG_H | 
|---|
|  | 15 | #include <config.h> | 
|---|
|  | 16 | #endif | 
|---|
|  | 17 |  | 
|---|
| [14de469] | 18 | #include <fstream> | 
|---|
|  | 19 |  | 
|---|
| [e4fe8d] | 20 | #include "Helpers/defs.hpp" | 
|---|
| [ad011c] | 21 | #include "CodePatterns/Log.hpp" | 
|---|
| [6dea43] | 22 |  | 
|---|
| [99593f] | 23 | /********************************************** definitions *********************************/ | 
|---|
|  | 24 |  | 
|---|
| [14de469] | 25 | /********************************************** helpful functions *********************************/ | 
|---|
|  | 26 |  | 
|---|
| [d3a46d] | 27 | // taken out of TREMOLO | 
|---|
|  | 28 | /*@-namechecks@*/ | 
|---|
|  | 29 | #ifndef __GNUC__ | 
|---|
|  | 30 | # undef __attribute__ | 
|---|
|  | 31 | # define __attribute__(x) | 
|---|
|  | 32 | #endif | 
|---|
|  | 33 | /*@=namechecks@*/ | 
|---|
|  | 34 |  | 
|---|
|  | 35 | /* Behandelt aufgetretene Fehler. error ist der Fehlertyp(enum Errors) | 
|---|
| [042f82] | 36 | void *SpecialData ist ein untypisierter Zeiger auf Spezielle Daten zur Fehlerbehandlung. | 
|---|
|  | 37 | Man koennte auch noch einen Zeiger auf eine Funktion uebergeben */ | 
|---|
| [d3a46d] | 38 | extern void /*@exits@*/ debug(const char *output); | 
|---|
| [042f82] | 39 | //__attribute__ ((__return__)); | 
|---|
| [d3a46d] | 40 | #define debug(data) debug_in((data), __FILE__, __LINE__) | 
|---|
|  | 41 |  | 
|---|
|  | 42 | extern void /*@exits@*/ debug_in(const char *output, | 
|---|
| [042f82] | 43 | const char *file, const int line); | 
|---|
|  | 44 | //__attribute__ ((__return__)); | 
|---|
| [d3a46d] | 45 |  | 
|---|
| [f80e20] | 46 | typedef enum { | 
|---|
|  | 47 | Minus = -1, | 
|---|
|  | 48 | Zero = 0, | 
|---|
|  | 49 | Plus = +1 | 
|---|
|  | 50 | } sign_t; | 
|---|
|  | 51 |  | 
|---|
| [14de469] | 52 | char *FixedDigitNumber(const int FragmentNumber, const int digits); | 
|---|
| [6cd79d] | 53 | void performCriticalExit(); | 
|---|
| [f80e20] | 54 | sign_t sign(double value); | 
|---|
| [14de469] | 55 |  | 
|---|
| [6d35e4] | 56 | /********************************************** helpful template functions *********************************/ | 
|---|
|  | 57 |  | 
|---|
| [c144ed2] | 58 |  | 
|---|
| [8f75a4] | 59 | /** Creates a lookup table for true father's Atom::Nr -> atom ptr. | 
|---|
|  | 60 | * \param *start begin of chain list | 
|---|
|  | 61 | * \paran *end end of chain list | 
|---|
|  | 62 | * \param **Lookuptable pointer to return allocated lookup table (should be NULL on start) | 
|---|
| [3c349b] | 63 | * \param count optional predetermined size for table (otherwise we set the count to highest true father id) | 
|---|
| [8f75a4] | 64 | * \return true - success, false - failure | 
|---|
|  | 65 | */ | 
|---|
| [e138de] | 66 | template <typename T> bool CreateFatherLookupTable(T *start, T *end, T **&LookupTable, int count = 0) | 
|---|
| [8f75a4] | 67 | { | 
|---|
| [042f82] | 68 | bool status = true; | 
|---|
|  | 69 | T *Walker = NULL; | 
|---|
|  | 70 | int AtomNo; | 
|---|
|  | 71 |  | 
|---|
|  | 72 | if (LookupTable != NULL) { | 
|---|
| [0de7e8] | 73 | DoeLog(0) && (eLog() << Verbose(0) << "Pointer for Lookup table is not NULL! Aborting ..." <<endl); | 
|---|
| [042f82] | 74 | return false; | 
|---|
|  | 75 | } | 
|---|
|  | 76 |  | 
|---|
|  | 77 | // count them | 
|---|
|  | 78 | if (count == 0) { | 
|---|
|  | 79 | Walker = start; | 
|---|
|  | 80 | while (Walker->next != end) { // create a lookup table (Atom::nr -> atom) used as a marker table lateron | 
|---|
|  | 81 | Walker = Walker->next; | 
|---|
|  | 82 | count = (count < Walker->GetTrueFather()->nr) ? Walker->GetTrueFather()->nr : count; | 
|---|
|  | 83 | } | 
|---|
|  | 84 | } | 
|---|
|  | 85 | if (count <= 0) { | 
|---|
| [0de7e8] | 86 | DoeLog(1) && (eLog() << Verbose(1) << "Count of lookup list is 0 or less." << endl); | 
|---|
| [042f82] | 87 | return false; | 
|---|
|  | 88 | } | 
|---|
|  | 89 |  | 
|---|
| [7218f8] | 90 | // allocate and fill | 
|---|
| [920c70] | 91 | LookupTable = new T*[count]; | 
|---|
| [042f82] | 92 | if (LookupTable == NULL) { | 
|---|
| [58ed4a] | 93 | DoeLog(0) && (eLog()<< Verbose(0) << "LookupTable memory allocation failed!" << endl); | 
|---|
| [e359a8] | 94 | performCriticalExit(); | 
|---|
| [042f82] | 95 | status = false; | 
|---|
|  | 96 | } else { | 
|---|
|  | 97 | Walker = start; | 
|---|
|  | 98 | while (Walker->next != end) { // create a lookup table (Atom::nr -> atom) used as a marker table lateron | 
|---|
|  | 99 | Walker = Walker->next; | 
|---|
|  | 100 | AtomNo = Walker->GetTrueFather()->nr; | 
|---|
|  | 101 | if ((AtomNo >= 0) && (AtomNo < count)) { | 
|---|
|  | 102 | //*out << "Setting LookupTable[" << AtomNo << "] to " << *Walker << endl; | 
|---|
|  | 103 | LookupTable[AtomNo] = Walker; | 
|---|
|  | 104 | } else { | 
|---|
| [0de7e8] | 105 | DoeLog(2) && (eLog() << Verbose(2) << "Walker " << *Walker << " exceeded range of nuclear ids [0, " << count << ")." << endl); | 
|---|
| [042f82] | 106 | status = false; | 
|---|
|  | 107 | break; | 
|---|
|  | 108 | } | 
|---|
|  | 109 | } | 
|---|
|  | 110 | } | 
|---|
|  | 111 |  | 
|---|
|  | 112 | return status; | 
|---|
| [8f75a4] | 113 | }; | 
|---|
|  | 114 |  | 
|---|
| [1024cb] | 115 |  | 
|---|
| [7dad10] | 116 | #define PLURAL_S(v) (((v)==1)?"":"s") | 
|---|
| [f66195] | 117 |  | 
|---|
| [6e97e5] | 118 | // this is to allow different modes of access for | 
|---|
|  | 119 | // maps and sets | 
|---|
|  | 120 | template<typename Res,typename T> | 
|---|
|  | 121 | struct _take{ | 
|---|
|  | 122 | Res get(T value) const; | 
|---|
|  | 123 | }; | 
|---|
|  | 124 |  | 
|---|
|  | 125 | // if we have a set,vector etc we can directly access the result | 
|---|
|  | 126 | template<typename Res> | 
|---|
|  | 127 | struct _take<Res,Res>{ | 
|---|
|  | 128 | static inline Res get(Res value){ | 
|---|
|  | 129 | return value; | 
|---|
|  | 130 | } | 
|---|
|  | 131 | }; | 
|---|
|  | 132 |  | 
|---|
|  | 133 | // if we have a map we have to access the second part of | 
|---|
|  | 134 | // the pair | 
|---|
|  | 135 | template<typename Res,typename T1> | 
|---|
|  | 136 | struct _take<Res,std::pair<T1,Res> >{ | 
|---|
|  | 137 | static inline Res get(std::pair<T1,Res> value){ | 
|---|
|  | 138 | return value.second; | 
|---|
|  | 139 | } | 
|---|
|  | 140 | }; | 
|---|
|  | 141 |  | 
|---|
| [14de469] | 142 | #endif /*HELPERS_HPP_*/ | 
|---|