Search icon
Subscription
0
Cart icon
Close icon
You have no products in your basket yet
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletters
Free Learning
Arrow right icon
Functional Python Programming, 3rd edition - Third Edition

You're reading from  Functional Python Programming, 3rd edition - Third Edition

Product type Book
Published in Dec 2022
Publisher Packt
ISBN-13 9781803232577
Pages 576 pages
Edition 3rd Edition
Languages
Author (1):
Steven F. Lott Steven F. Lott
Profile icon Steven F. Lott

Table of Contents (18) Chapters

Preface
1. Chapter 1: Understanding Functional Programming 2. Chapter 2: Introducing Essential Functional Concepts 3. Chapter 3: Functions, Iterators, and Generators 4. Chapter 4: Working with Collections 5. Chapter 5: Higher-Order Functions 6. Chapter 6: Recursions and Reductions 7. Chapter 7: Complex Stateless Objects 8. Chapter 8: The Itertools Module 9. Chapter 9: Itertools for Combinatorics – Permutations and Combinations 10. Chapter 10: The Functools Module 11. Chapter 11: The Toolz Package 12. Chapter 12: Decorator Design Techniques 13. Chapter 13: The PyMonad Library 14. Chapter 14: The Multiprocessing, Threading, and Concurrent.Futures Modules 15. Chapter 15: A Functional Approach to Web Services 16. Other Books You Might Enjoy
17. Index

5.10 Summary

In this chapter, we have seen two reductions that are higher-order functions: max() and min(). We looked at the two central higher-order functions, map() and filter(). We also looked at sorted().

In addition, we looked at how to use a higher-order function to transform the structure of data. We can perform several common transformations, including wrapping, unwrapping, flattening, and structuring sequences of different kinds.

We looked at two ways to define our own higher-order functions, which are as follows:

  • The def statement. Similar to a lambda form that we assign to a variable.

  • Defining a callable class as a kind of function that emits composite functions.

We can also use decorators to emit composite functions. We’ll return to this in Chapter 12, Decorator Design Techniques.

In the next chapter, we’ll look at the idea of purely functional iteration via recursion. We’ll use Pythonic structures to make several common improvements over purely...

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 €14.99/month. Cancel anytime}