Book Image

Learning C++ Functional Programming

By : Wisnu Anggoro
5 (1)
Book Image

Learning C++ Functional Programming

5 (1)
By: Wisnu Anggoro

Overview of this book

Functional programming allows developers to divide programs into smaller, reusable components that ease the creation, testing, and maintenance of software as a whole. Combined with the power of C++, you can develop robust and scalable applications that fulfill modern day software requirements. This book will help you discover all the C++ 17 features that can be applied to build software in a functional way. The book is divided into three modules—the first introduces the fundamentals of functional programming and how it is supported by modern C++. The second module explains how to efficiently implement C++ features such as pure functions and immutable states to build robust applications. The last module describes how to achieve concurrency and apply design patterns to enhance your application’s performance. Here, you will also learn to optimize code using metaprogramming in a functional way. By the end of the book, you will be familiar with the functional approach of programming and will be able to use these techniques on a daily basis.
Table of Contents (15 chapters)
Title Page
Credits
About the Author
About the Reviewer
www.PacktPub.com
Customer Feedback
Preface

Summary


This chapter has given us the technique for repeating the function invocation by using iteration and recursion. However, since recursion is more functional than iteration, we emphasized our discussion on recursion instead of iteration. We started with the difference between iteration and recursion. We then continued the discussion about refactoring the immutable function to become a recursive immutable function.

After we learned about the recursion, we found other better recursion techniques. We also discussed tail recursion to get this improved technique. Lastly, we enumerated three kinds of recursion--functional, procedural, and backtracking recursion. We usually use functional recursion when we expect the return value for the recursion. Otherwise, we use procedural recursion. And, if we need to break down the problem and undo the recursion performance when it doesn't work, we can use backtracking recursion to solve the problem.

In the next chapter, we will discuss lazy evaluation...