Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Learning C++ Functional Programming

You're reading from   Learning C++ Functional Programming Explore functional C++ with concepts like currying, metaprogramming and more

Arrow left icon
Product type Paperback
Published in Aug 2017
Publisher
ISBN-13 9781787281974
Length 304 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Wisnu Anggoro Wisnu Anggoro
Author Profile Icon Wisnu Anggoro
Wisnu Anggoro
Arrow right icon
View More author details
Toc

Table of Contents (9) Chapters Close

Preface 1. Diving into Modern C++ 2. Manipulating Functions in Functional Programming FREE CHAPTER 3. Applying Immutable State to the Function 4. Repeating Method Invocation Using Recursive Algorithm 5. Procrastinating the Execution Process Using Lazy Evaluation 6. Optimizing Code with Metaprogramming 7. Running Parallel Execution Using Concurrency 8. Creating and Debugging Application in Functional Approach

Benefits and drawbacks of metaprogramming


After our discussion about template metaprogramming, the following are the advantages we derive:

  • Template metaprogramming has no side effect since it is immutable, so we cannot modify an existing type
  • There is better code readability compared to code that does not implement metaprogramming
  • It reduces repetition of the code

Although we can gain benefits from template metaprogramming, there are several disadvantages, which are as follows:

  • The syntax is quite complex.
  • The compilation time takes longer since we now execute code during compile-time.
  • The compiler can optimize the generated code much better and perform inlining, for instance, the C qsort() function and the C++ sort template. In C, the qsort() function takes a pointer to a comparison function, so there will be one copy of the qsort code that is not inlined. It will make a call through the pointer to the comparison routine. In C++, std::sort is a template, and it can take a functor object as a comparator...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image