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

12.3 Composite design

The common mathematical notation for a composite function looks as follows:

f ∘g(x) = f(g(x))

The idea is that we can define a new function, f g(x), that combines two other functions, f(y) and g(x).

Python’s multiple-line definition of a composition function can be done through the following code:

@f_deco 
def g(x): 
    something

The resulting function can be essentially equivalent to f g(x). The @f_deco decorator must define and return the composite function by merging an internal definition of f(y) with the provided base function, g(x).

The implementation details show that Python actually provides a slightly more complex kind of composition. The structure of a wrapper makes it helpful to think of Python decorator composition as follows:

 ( ) w ∘g(x) = (wβ ∘g ∘w α)(x) = w β g(w α(x ))

A decorator applied to some application function, g(x), will include a wrapper function, w(y), that has two parts. One portion of the wrapper, wα(y), applies to the arguments of...

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}