Browse Library
Sign In Start Free Trial
Close icon Search icon
Account
Browse Library Advanced Search Sign In Start Free Trial

Add to playlist

Create a Playlist

Modal Close icon
You need to login to use this feature.
  • Book Overview & Buying Functional Python Programming, 3rd edition
  • Table Of Contents Toc
  • Feedback & Rating feedback
Functional Python Programming, 3rd edition

Functional Python Programming, 3rd edition - Third Edition

By : Steven F. Lott
4.5 (28)
Buy this Book
close
close
Functional Python Programming, 3rd edition

Functional Python Programming, 3rd edition

4.5 (28)
By: Steven F. Lott
Buy this Book

Overview of this book

Not enough developers understand the benefits of functional programming, or even what it is. Author Steven Lott demystifies the approach, teaching you how to improve the way you code in Python and make gains in memory use and performance. If you’re a leetcoder preparing for coding interviews, this book is for you. Starting from the fundamentals, this book shows you how to apply functional thinking and techniques in a range of scenarios, with Python 3.10+ examples focused on mathematical and statistical algorithms, data cleaning, and exploratory data analysis. You'll learn how to use generator expressions, list comprehensions, and decorators to your advantage. You don't have to abandon object-oriented design completely, though – you'll also see how Python's native object orientation is used in conjunction with functional programming techniques. By the end of this book, you'll be well-versed in the essential functional programming features of Python and understand why and when functional thinking helps. You'll also have all the tools you need to pursue any additional functional topics that are not part of the Python language.
Table of Contents (18 chapters)
close
close
close
Preface
Icon
Preface
Lock Free Chapter
1
Chapter 1: Understanding Functional Programming
Icon
Chapter 1: Understanding Functional Programming
Icon
1.1 The functional style of programming
Icon
1.2 Comparing and contrasting procedural and functional styles
Icon
1.3 A classic example of functional programming
Icon
1.4 Exploratory data analysis
Icon
1.5 Summary
Icon
1.6 Exercises
Icon
Join our community Discord space
2
Chapter 2: Introducing Essential Functional Concepts
Icon
Chapter 2: Introducing Essential Functional Concepts
Icon
2.1 Functions as first-class objects
Icon
2.2 Immutable data
Icon
2.3 Strict and non-strict evaluation
Icon
2.4 Lazy and eager evaluation
Icon
2.5 Recursion instead of an explicit loop state
Icon
2.6 Functional type systems
Icon
2.7 Familiar territory
Icon
2.8 Learning some advanced concepts
Icon
2.9 Summary
Icon
2.10 Exercises
Icon
Join our community Discord space
3
Chapter 3: Functions, Iterators, and Generators
Icon
Chapter 3: Functions, Iterators, and Generators
Icon
3.1 Writing pure functions
Icon
3.2 Functions as first-class objects
Icon
3.3 Using strings
Icon
3.4 Using tuples and named tuples
Icon
3.5 Using generator expressions
Icon
3.6 Cleaning raw data with generator functions
Icon
3.7 Applying generators to built-in collections
Icon
3.8 Summary
Icon
3.9 Exercises
Icon
Join our community Discord space
4
Chapter 4: Working with Collections
Icon
Chapter 4: Working with Collections
Icon
4.1 An overview of function varieties
Icon
4.2 Working with iterables
Icon
4.3 Using any() and all() as reductions
Icon
4.4 Using len() and sum() on collections
Icon
4.5 Using zip() to structure and flatten sequences
Icon
4.6 Using sorted() and reversed() to change the order
Icon
4.7 Using enumerate() to include a sequence number
Icon
4.8 Summary
Icon
4.9 Exercises
Icon
Join our community Discord space
5
Chapter 5: Higher-Order Functions
Icon
Chapter 5: Higher-Order Functions
Icon
5.1 Using max() and min() to find extrema
Icon
5.2 Using the map() function to apply a function to a collection
Icon
5.3 Using the filter() function to pass or reject data
Icon
5.4 The iter() function with a sentinel value
Icon
5.5 Using sorted() to put data in order
Icon
5.6 Overview of writing higher-order functions
Icon
5.7 Writing higher-order mappings and filters
Icon
5.8 Building higher-order functions with callables
Icon
5.9 Review of some design patterns
Icon
5.10 Summary
Icon
5.11 Exercises
Icon
Join our community Discord space
6
Chapter 6: Recursions and Reductions
Icon
Chapter 6: Recursions and Reductions
Icon
6.1 Simple numerical recursions
Icon
6.2 Reductions and folding a collection from many items to one
Icon
6.3 Group-by reduction from many items to fewer
Icon
6.4 Summary
Icon
6.5 Exercises
Icon
Join our community Discord space
7
Chapter 7: Complex Stateless Objects
Icon
Chapter 7: Complex Stateless Objects
Icon
7.1 Using tuples to collect data
Icon
7.2 Using NamedTuple to collect data
Icon
7.3 Using frozen dataclasses to collect data
Icon
7.4 Complicated object initialization and property computations
Icon
7.5 Using pyrsistent to collect data
Icon
7.6 Avoiding stateful classes by using families of tuples
Icon
7.7 Polymorphism and type pattern matching
Icon
7.8 Summary
Icon
7.9 Exercises
Icon
Join our community Discord space
8
Chapter 8: The Itertools Module
Icon
Chapter 8: The Itertools Module
Icon
8.1 Working with the infinite iterators
Icon
8.2 Using the finite iterators
Icon
8.3 Cloning iterators with tee()
Icon
8.4 The itertools recipes
Icon
8.5 Summary
Icon
8.6 Exercises
Icon
Join our community Discord space
9
Chapter 9: Itertools for Combinatorics – Permutations and Combinations
Icon
Chapter 9: Itertools for Combinatorics – Permutations and Combinations
Icon
9.1 Enumerating the Cartesian product
Icon
9.2 Reducing a product
Icon
9.3 Performance improvements
Icon
9.4 Permuting a collection of values
Icon
9.5 Generating all combinations
Icon
9.6 Recipes
Icon
9.7 Summary
Icon
9.8 Exercises
Icon
Join our community Discord space
10
Chapter 10: The Functools Module
chevron up
Icon
Chapter 10: The Functools Module
Icon
10.1 Function tools
Icon
10.2 Memoizing previous results with cache
Icon
10.3 Defining classes with total ordering
Icon
10.4 Applying partial arguments with partial()
Icon
10.5 Reducing sets of data with the reduce() function
Icon
10.6 Handling multiple types with singledispatch
Icon
10.7 Summary
Icon
10.8 Exercises
Icon
Join our community Discord space
11
Chapter 11: The Toolz Package
Icon
Chapter 11: The Toolz Package
Icon
11.1 The itertools star map function
Icon
11.2 Reducing with operator module functions
Icon
11.3 Using the toolz package
Icon
11.4 Summary
Icon
11.5 Exercises
12
Chapter 12: Decorator Design Techniques
Icon
Chapter 12: Decorator Design Techniques
Icon
12.1 Decorators as higher-order functions
Icon
12.2 Cross-cutting concerns
Icon
12.3 Composite design
Icon
12.4 Adding a parameter to a decorator
Icon
12.5 Implementing more complex decorators
Icon
12.6 Complicated design considerations
Icon
12.7 Summary
Icon
12.8 Exercises
13
Chapter 13: The PyMonad Library
Icon
Chapter 13: The PyMonad Library
Icon
13.1 Downloading and installing
Icon
13.2 Functional composition and currying
Icon
13.3 Functors – making everything a function
Icon
13.4 Monad bind() function
Icon
13.5 Implementing simulation with monads
Icon
13.6 Additional PyMonad features
Icon
13.7 Summary
Icon
13.8 Exercises
Icon
Join our community Discord space
14
Chapter 14: The Multiprocessing, Threading, and Concurrent.Futures Modules
Icon
Chapter 14: The Multiprocessing, Threading, and Concurrent.Futures Modules
Icon
14.1 Functional programming and concurrency
Icon
14.2 What concurrency really means
Icon
14.3 Using multiprocessing pools and tasks
Icon
14.4 Using a multiprocessing pool for concurrent processing
Icon
14.5 Summary
Icon
14.6 Exercises
15
Chapter 15: A Functional Approach to Web Services
Icon
Chapter 15: A Functional Approach to Web Services
Icon
15.1 The HTTP request-response model
Icon
15.2 The WSGI standard
Icon
15.3 Defining web services as functions
Icon
15.4 Tracking usage
Icon
15.5 Summary
Icon
15.6 Exercises
Icon
Join our community Discord space
16
Other Books You Might Enjoy
Icon
Other Books You Might Enjoy
17
Index
Icon
Index

10.2 Memoizing previous results with cache

The @cache and @lru_cache decorators transform a given function into a function that might perform more quickly. LRU means Least Recently Used—a finite pool of recently used items is retained. Items not recently used are discarded to keep the pool to a bounded size. The @cache has no storage management and requires a little bit of consideration to be sure it won’t consume all available memory.

Since these are decorators, we can apply one of them to any function that might benefit from caching previous results. We can use it as follows:

from functools import lru_cache 
 
@lru_cache(128) 
def fibc(n: int) -> int: 
    if n == 0: return 0 
    if n == 1: return 1 
    return fibc(n-1) + fibc(n-2)

This is an example based on Chapter 6, Recursions and Reductions. We’ve applied the @lru_cache decorator to the naive Fibonacci number...

Visually different images
CONTINUE READING
83
Tech Concepts
36
Programming languages
73
Tech Tools
Icon Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.
Icon Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.
Icon 50+ new titles added per month and exclusive early access to books as they are being written.
Functional Python Programming, 3rd edition
End of Section 10
Next Section
notes
bookmark Notes and Bookmarks search Search in title playlist Add to playlist download Download options
font-size Font size

Change the font size

margin-width Margin width

Change margin width

day-mode Day/Sepia/Night Modes

Change background colour

Close icon Search
Country selected
Close icon Your notes and bookmarks

Confirmation

Modal Close icon
claim successful
Order Page Read Now

Buy this book with your credits?

Modal Close icon
Are you sure you want to buy this book with one of your credits?
Close
YES, BUY

Submit Your Feedback

Modal Close icon
Modal Close icon
Modal Close icon