C++ for Scientists - Technische Universität Dresden

More documents

Recommendations

Info

Introduction “It would be nice if every kind of numeric software could be written in C++ without loss of efficiency, but unless something can be found that achieves this without compromising the C++ type system it may be preferable to rely on Fortran, assembler or architecture-specific extensions.” — Bjarne Stroustrup. The purpose of this script is doing you this favor, Bjarne. Amongst others. Conversely, the reader of this book shall learn the best way to benefit from C ++ features for writing scientific software. It is not our goal to explain all C ++ features in a well-balanced manner. We rather aim for an application-driven illustration of features that are valuable for writing • Well-structured; • Readable; • Maintanable; • Extensible; • Type-safe; • Reliable; • Portable; and last but not least • Highly performing software. 0.1 Programming languages for scientific programming Scientific programming is an old discipline in computer science. The first applications on computers were indeed computations. In the early decades, ALGOL was a relatively popular programming language, competing with FORTRAN. FORTRAN 77 became a standard in scientific programming because of its efficiency and portability. Other computer languages were developed in computer science but not frequently used in scientific computing : C, Ada, Java, C ++. They were merely used in universities and labs for research purposes. 9
Page 1 and 2: Technische Universität Dresden Fak
Page 3 and 4: Contents I Understanding C++ 7 Intr
Page 5 and 6: CONTENTS 5 10.5 Unix and Linux . .
Page 7: Part I Understanding C ++ 7
Page 11 and 12: Good and Bad Scientific Software Ch
Page 13 and 14: } } // q= A ∗ p; for (i= 0; i < s
Page 15 and 16: Vector p(resource(x)), q(resource(x
Page 17 and 18: general, any existing or new platfo
Page 19 and 20: C ++ Basics Chapter 2 In this first
Page 21 and 22: 2.2. VARIABLES 21 2.2.1 Constants S
Page 23 and 24: 2.2. VARIABLES 23 2.2.3 Scope of va
Page 25 and 26: 2.3. OPERATORS 25 if (x < 4) { int
Page 27 and 28: 2.3. OPERATORS 27 Operator Meaning
Page 29 and 30: 2.3. OPERATORS 29 2.3.5 Bracket ope
Page 31 and 32: 2.4. EXPRESSIONS AND STATEMENTS 31
Page 33 and 34: 2.5. CONTROL STATEMENTS 33 The expr
Page 35 and 36: 2.5. CONTROL STATEMENTS 35 if (x
Page 37 and 38: 2.5. CONTROL STATEMENTS 37 Here it
Page 39 and 40: 2.6. FUNCTIONS 39 case 3: v[i] = w[
Page 41 and 42: 2.6. FUNCTIONS 41 It should be ment
Page 43 and 44: 2.6. FUNCTIONS 43 foo takes one int
Page 45 and 46: 2.7. INPUT AND OUTPUT 45 std::ifstr
Page 47 and 48: 2.8. STRUCTURING SOFTWARE PROJECTS
Page 49 and 50: 2.9. ARRAYS 49 • : Complex number
Page 51 and 52: 2.10. POINTERS AND REFERENCES 51 Fu
Page 53 and 54: 2.11. REAL-WORLD EXAMPLE: MATRIX IN
Page 59 and 60:
2.11. REAL-WORLD EXAMPLE: MATRIX IN
Page 61 and 62:
2.11. REAL-WORLD EXAMPLE: MATRIX IN
Page 63 and 64:
2.12. EXERCISES 63 The first line t
Page 65 and 66:
Classes Chapter 3 “Computer scien
Page 67 and 68:
3.2. CLASS MEMBERS 67 though this a
Page 69 and 70:
3.3. CONSTRUCTORS 69 class complex
Page 71 and 72:
3.3. CONSTRUCTORS 71 Advise Define
Page 73 and 74:
3.3. CONSTRUCTORS 73 The implicit c
Page 75 and 76:
3.5. ASSIGNMENT 75 It must be paid
Page 77 and 78:
3.6. AUTOMATICALLY GENERATED OPERAT
Page 79 and 80:
3.7. ACCESSING OBJECT MEMBERS 79 Th
Page 81 and 82:
3.7. ACCESSING OBJECT MEMBERS 81 Of
Page 83 and 84:
3.7. ACCESSING OBJECT MEMBERS 83 {
Page 85 and 86:
3.7. ACCESSING OBJECT MEMBERS 85 };
Page 87 and 88:
3.7. ACCESSING OBJECT MEMBERS 87 co
Page 89 and 90:
Generic programming Chapter 4 In th
Page 91 and 92:
4.2. GENERIC FUNCTIONS 91 would not
Page 93 and 94:
4.2. GENERIC FUNCTIONS 93 Then the
Page 95 and 96:
4.3. GENERIC CLASSES 95 += operator
Page 97 and 98:
4.4. CONCEPTS AND MODELING 97 type
Page 99 and 100:
4.5. INHERITANCE OR GENERICS? 99 Fo
Page 101 and 102:
4.6. TEMPLATE SPECIALIZATION 101 an
Page 103 and 104:
4.6. TEMPLATE SPECIALIZATION 103 cl
Page 105 and 106:
4.6. TEMPLATE SPECIALIZATION 105 Ba
Page 107 and 108:
4.6. TEMPLATE SPECIALIZATION 107 te
Page 109 and 110:
4.7. NON-TYPE PARAMETERS FOR TEMPLA
Page 111 and 112:
4.8. FUNCTORS 111 vector x(3), y(4)
Page 113 and 114:
4.8. FUNCTORS 113 struct functor ba
Page 115 and 116:
4.8. FUNCTORS 115 Since we are usin
Page 117 and 118:
4.8. FUNCTORS 117 }; const F& f; T
Page 119 and 120:
4.8. FUNCTORS 119 std::cout ≪ ”
Page 121 and 122:
4.9. STL — THE MOTHER OF ALL GENE
Page 123 and 124:
4.10. CURSORS AND PROPERTY MAPS 123
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
4.11. EXERCISES 129 1 2 3 4 functio
Page 131 and 132:
4.11. EXERCISES 131 double operator
Page 133 and 134:
Meta-programming Chapter 5 ‘Meta-
Page 135 and 136:
5.2. PROVIDING TYPE INFORMATION 135
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
5.3. EXPRESSION TEMPLATES 151 } std
Page 153 and 154:
5.3. EXPRESSION TEMPLATES 153 cache
Page 155 and 156:
5.3. EXPRESSION TEMPLATES 155 } fri
Page 157 and 158:
5.4. META-TUNING: WRITE YOUR OWN CO
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Page 173 and 174:
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
5.5. EXERCISES 185 5.5 Exercises 5.
Page 187 and 188:
Inheritance Chapter 6 C ++ is a mul
Page 189 and 190:
6.3. REMOVE REDUNDANCY WITH BASE CL
Page 191 and 192:
6.4. CASTING UP AND DOWN AND ELSEWH
Page 193 and 194:
6.5. BARTON-NACKMAN TRICK 193 6.4.2
Page 195 and 196:
6.5. BARTON-NACKMAN TRICK 195 Likew
Page 197 and 198:
6.5. BARTON-NACKMAN TRICK 197 }; br
Page 199 and 200:
Effective Programming: The Polymorp
Page 201 and 202:
7.1. IMPERATIVE PROGRAMMING 201 7.1
Page 203 and 204:
7.2. GENERIC PROGRAMMING 203 7.2 Ge
Page 205 and 206:
7.2. GENERIC PROGRAMMING 205 • Gr
Page 207 and 208:
7.3. PROGRAMMING WITH OBJECTS 207 T
Page 209 and 210:
7.4. FUNCTIONAL PROGRAMMING 209 7.4
Page 211 and 212:
7.4. FUNCTIONAL PROGRAMMING 211 } }
Page 213 and 214:
7.5. FROM MONOMORPHIC TO POLYMORPHI
Page 215 and 216:
Page 217 and 218:
Page 219 and 220:
Page 221 and 222:
7.6. BEST OF BOTH WORLDS 221 7.6 Be
Page 223:
Part II Using C ++ 223
Page 226 and 227:
226 CHAPTER 8. FINITE WORLD OF COMP
Page 228 and 229:
Page 230 and 231:
Page 232 and 233:
Page 234 and 235:
234 CHAPTER 9. HOW TO HANDLE PHYSIC
Page 236 and 237:
236 CHAPTER 10. PROGRAMMING TOOLS T
Page 238 and 239:
238 CHAPTER 10. PROGRAMMING TOOLS 1
Page 240 and 241:
240 CHAPTER 10. PROGRAMMING TOOLS 0
Page 242 and 243:
242 CHAPTER 10. PROGRAMMING TOOLS
Page 244 and 245:
244 CHAPTER 11. C++ LIBRARIES FOR S
Page 246 and 247:
Page 248 and 249:
Page 250 and 251:
Page 252 and 253:
Page 254 and 255:
254 CHAPTER 12. REAL-WORLD PROGRAMM
Page 256 and 257:
Page 258 and 259:
Page 260 and 261:
260 CHAPTER 13. PARALLELISM } MPI F
Page 262 and 263:
262 CHAPTER 13. PARALLELISM
Page 264 and 265:
264 CHAPTER 14. NUMERICAL EXERCISES
Page 266 and 267:
Page 268 and 269:
Page 270 and 271:
Page 272 and 273:
Page 274 and 275:
Page 276 and 277:
Page 278 and 279:
Page 280 and 281:
Page 282 and 283:
Page 284 and 285:
Page 286 and 287:
286 KAPITEL 15. PROGRAMMIERPROJEKTE
Page 288 and 289:
Page 290 and 291:
Page 292 and 293:
292 CHAPTER 16. ACKNOWLEDGEMENT
show all

C++ for Scientists - Technische Universität Dresden

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?