Book Image

Modern Python Cookbook

Book Image

Modern Python Cookbook

Overview of this book

Python is the preferred choice of developers, engineers, data scientists, and hobbyists everywhere. It is a great scripting language that can power your applications and provide great speed, safety, and scalability. By exposing Python as a series of simple recipes, you can gain insight into specific language features in a particular context. Having a tangible context helps make the language or standard library feature easier to understand. This book comes with over 100 recipes on the latest version of Python. The recipes will benefit everyone ranging from beginner to an expert. The book is broken down into 13 chapters that build from simple language concepts to more complex applications of the language. The recipes will touch upon all the necessary Python concepts related to data structures, OOP, functional programming, as well as statistical programming. You will get acquainted with the nuances of Python syntax and how to effectively use the advantages that it offers. You will end the book equipped with the knowledge of testing, web services, and configuration and application integration tips and tricks. The recipes take a problem-solution approach to resolve issues commonly faced by Python programmers across the globe. You will be armed with the knowledge of creating applications with flexible logging, powerful configuration, and command-line options, automated unit tests, and good documentation.
Table of Contents (18 chapters)
Title Page
Credits
About the Author
About the Reviewers
www.PacktPub.com
Preface
Index

Defining an ordered collection


When simulating card games, the player's hand can be modeled as a set of cards or a list of cards. With most conventional single-deck games, a set works out nicely because there's only one instance of any given card, and the set class can do very fast operations to confirm that a given card is (or is not) in the set.

When modeling Pinochle, however, we have a challenging problem. The Pinochle deck is 48 cards; it has two of 9, 10, Jack, Queen, King, and Ace. A simple set won't work well for this; we would need a multiset or bag. This is a set that permits duplicate items.

The operations are still limited to membership tests. For example, we can add the object Card(9,'♢') object more than once, and then also remove it more than one time.

We have a number of ways to create a multiset:

  • We can use a list. Appending an item has a nearly fixed cost, characterized as O(1). Searching for an item has a bad performance problem. The complexity of testing for membership tends...