Understanding C++ Expression Templates - Angelika Langer

More documents

Recommendations

Info

48Benefits of Meta-ProgrammingVery good performance due to! exclusive use of static binding;polymorphic behavior can be simulated statically.! inlining;enables the compiler to optimize aggressively.© Copyright 1995-2000 by Angelika Langer. All Rights Reserved.http://www.AngelikaLanger.com(108)last update: 11/7/2005 ,21:37Problems with Meta-Programming! Debugging.practically not possible; there are tricks though.! Error reporting.no influence on the compiler message.! Readability of code.it looks awkward.! Compilation times.increases by orders of magnitude.! Compiler limits.truncation of identifiers, loop limits exceeded.! Portability.some compilers still not support standard C++© Copyright 1995-2000 by Angelika Langer. All Rights Reserved.http://www.AngelikaLanger.com(109)last update: 11/7/2005 ,21:37
49Expression Template LibrariesReferencesThe Blitz Projecthttp://oonumerics.org/blitz/A C++ class library for scientific computing which uses templatetechniques to achieve high performance.PETE (Portable Expression Template Engine)http://www.acl.lanl.gov/pete/A portable C++ framework to easily add powerful expressiontemplates.© Copyright 1995-2000 by Angelika Langer. All Rights Reserved.http://www.AngelikaLanger.com(110)last update: 11/7/2005 ,21:37Expression Template LibrariesReferencesPOOMA (Parallel Object-Oriented Methods and Applications)http://www.acl.lanl.gov/pooma/– An object-oriented framework for applications in computationalscience requiring high-performance parallel computers.– Considerable success in real applications including gyrokinetic particle-incellplasma simulation and multimaterial compressible hydrodynamics.– Developed at Los Alamos National Laboratory, New Mexico.© Copyright 1995-2000 by Angelika Langer. All Rights Reserved.http://www.AngelikaLanger.com(111)last update: 11/7/2005 ,21:37
Page 1 and 2: 1Understanding C++Expression Templa
Page 3 and 4: 3Runtime Computation of FactorialTh
Page 5 and 6: 5The RecursionRecursive definition
Page 7 and 8: 7Goal! efficient computation of ari
Page 9 and 10: 9Agenda! compile-time computation o
Page 11 and 12: 11A Typical Composite StructureaCom
Page 13 and 14: 13The ComponentThe base class that
Page 15 and 16: 15A Simplified OO ImplementationEli
Page 17: 17Implementation Using TemplatesDot
Page 20 and 21: 20The Interpreter PatternThe Interp
Page 22 and 23: 22OO Implementation à la GOFAbstra
Page 24 and 25: 24The ClientThe code that creates t
Page 26 and 27: 26The Non-Terminal Expressionstempl
Page 28 and 29: 28First attemptDefine the creator f
Page 30 and 31: 30Fine TuningDefine a helper functi
Page 33 and 34: 33Incorporating FunctionsWe can inc
Page 35 and 36: 35Run-Time PolymorphismClassic obje
Page 37 and 38: 37Run-Time vs. Compile-Time Dispatc
Page 39 and 40: 39The Strategy PatternContextStrate
Page 41 and 42: 41The Strategiesclass Comparator {p
Page 43 and 44: 43The Strategiesclass Ascii {public
Page 45 and 46: 45Examples from Standard C++! sorti
Page 47: 47Alexandrescu’s Smart Pointer! t
Page 51: 51Contact InfoAngelika LangerTraini

Understanding C++ Expression Templates - Angelika Langer

Create successful ePaper yourself

Delete template?

Save as template?