Sign In Start Free Trial

Functional Python Programming

By : Steven F. Lott

4 (9)

Functional Python Programming

4 (9)

By: Steven F. Lott

Overview of this book

This book is for developers who want to use Python to write programs that lean heavily on functional programming design patterns. You should be comfortable with Python programming, but no knowledge of functional programming paradigms is needed.

Preface

Preface

What this book covers

What you need for this book

Who this book is for

Conventions

Reader feedback

Customer support

Free Chapter

1. Introducing Functional Programming

1. Introducing Functional Programming

Identifying a paradigm

Subdividing the procedural paradigm

A classic example of functional programming

Exploratory Data Analysis

Summary

2. Introducing Some Functional Features

2. Introducing Some Functional Features

First-class functions

Immutable data

Strict and non-strict evaluation

Recursion instead of a explicit loop state

Functional type systems

Familiar territory

Saving some advanced concepts

Summary

3. Functions, Iterators, and Generators

3. Functions, Iterators, and Generators

Writing pure functions

Functions as first-class objects

Using strings

Using tuples and namedtuples

Cleaning raw data with generator functions

Using lists, dicts, and sets

Summary

4. Working with Collections

4. Working with Collections

An overview of function varieties

Working with iterables

Using zip() to structure and flatten sequences

Using reversed() to change the order

Using enumerate() to include a sequence number

Summary

5. Higher-order Functions

5. Higher-order Functions

Using max() and min() to find extrema

Using Python lambda forms

Lambdas and the lambda calculus

Using the map() function to apply a function to a collection

Using map() with multiple sequences

Using the filter() function to pass or reject data

Using filter() to identify outliers

The iter() function with a sentinel value

Using sorted() to put data in order

Writing higher-order functions

Writing higher-order mappings and filters

Writing generator functions

Building higher-order functions with Callables

Looking at some of the design patterns

Summary

6. Recursions and Reductions

6. Recursions and Reductions

Simple numerical recursions

Group-by reductions – from many to fewer

Summary

7. Additional Tuple Techniques

7. Additional Tuple Techniques

Using an immutable namedtuple as a record

Building namedtuples with functional constructors

Avoiding stateful classes by using families of tuples

Polymorphism and Pythonic pattern matching

Summary

8. The Itertools Module

8. The Itertools Module

Working with the infinite iterators

Using the finite iterators

Cloning iterators with tee()

The itertools recipes

Summary

9. More Itertools Techniques

9. More Itertools Techniques

Enumerating the Cartesian product

Reducing a product

Permuting a collection of values

Generating all combinations

Recipes

Summary

10. The Functools Module

10. The Functools Module

Function tools

Memoizing previous results with lru_cache

Defining classes with total ordering

Applying partial arguments with partial()

Reducing sets of data with reduce()

Summary

11. Decorator Design Techniques

11. Decorator Design Techniques

Decorators as higher-order functions

Cross-cutting concerns

Composite design

Adding a parameter to a decorator

Implementing more complex descriptors

Recognizing design limitations

Summary

12. The Multiprocessing and Threading Modules

12. The Multiprocessing and Threading Modules

What concurrency really means

The boundary conditions

Sharing resources with process or threads

Where benefits will accrue

Using multiprocessing pools and tasks

Using a multiprocessing pool for concurrent processing

Summary

13. Conditional Expressions and the Operator Module

13. Conditional Expressions and the Operator Module

Evaluating conditional expressions

Using the operator module instead of lambdas

Starmapping with operators

Reducing with operators

Summary

14. The PyMonad Library

14. The PyMonad Library

Downloading and installing

Functional composition and currying

Functional composition and the PyMonad multiplication operator

Functors and applicative functors

Monad concepts, the bind() function and the Binary Right Shift operator

Implementing simulation with monads

Additional PyMonad features

Summary

15. A Functional Approach to Web Services

15. A Functional Approach to Web Services

The HTTP request-response model

The WSGI standard

Defining web services as functions

Tracking usage

Summary

16. Optimizations and Improvements

16. Optimizations and Improvements

Memoization and caching

Specializing memoization

Optimizing storage

Optimizing accuracy

Case study – making a chi-squared decision

Computing expected values and displaying a contingency table

Summary

Index

Index

Customer Reviews

4 (9)

5 star

44.4%

4 star

33.3%

3 star

0

2 star

22.2%

1 star

0

Reducing sets of data with reduce()

The sum(), len(), max(), and min() functions are—in a way— all specializations of a more general algorithm expressed by the reduce() function. The reduce() function is a higher-order function that folds a function into each pair of items in an iterable.

A sequence object is given as follows:

d = [2, 4, 4, 4, 5, 5, 7, 9]

The function, reduce(lambda x,y: x+y, d), will fold in + operators to the list as follows:

2+4+4+4+5+5+7+9

Including () can show the effective grouping as follows:

((((((2+4)+4)+4)+5)+5)+7)+9

Python's standard interpretation of expressions involves a left-to-right evaluation of operators. The fold left isn't a big change in meaning.

We can also provide an initial value as follows:

reduce(lambda x,y: x+y**2, iterable, 0)

If we don't, the initial value from the sequence is used as the initialization. Providing an initial value is essential when there's a map() function as well as a reduce() function. Following is how the right answer is computed...

Search

Your notes and bookmarks