Download Safari Books Online apps: Apple iOS | Android

Entire Site

Safari Books Online

    Free Trial

    Safari Books Online is a digital library providing on-demand subscription access to thousands of learning resources.


    Copyright
    Preface
    Ch. 1. Text
    Ch. 2. Files
    Ch. 3. Time and Money
    Ch. 4. Python Shortcuts
    Ch. 5. Searching and Sorting
    Ch. 6. Object-Oriented Programming
    Ch. 7. Persistence and Databases
    Ch. 8. Debugging and Testing
    Ch. 9. Processes, Threads, and Synchronization
    Ch. 10. System Administration
    Ch. 11. User Interfaces
    Ch. 12. Processing XML
    Ch. 13. Network Programming
    Ch. 14. Web Programming
    Ch. 15. Distributed Programming
    Ch. 16. Programs About Programs
    Ch. 17. Extending and Embedding
    Ch. 18. Algorithms
    Introduction
    Recipe 18.1. Removing Duplicates from a Sequence
    Recipe 18.2. Removing Duplicates from a Sequence While Maintaining Sequence Order
    Recipe 18.3. Generating Random Samples with Replacement
    Recipe 18.4. Generating Random Samples Without Replacement
    Recipe 18.5. Memoizing (Caching) the Return Values of Functions
    Recipe 18.6. Implementing a FIFO Container
    Recipe 18.7. Caching Objects with a FIFO Pruning Strategy
    Recipe 18.8. Implementing a Bag (Multiset) Collection Type
    Recipe 18.9. Simulating the Ternary Operator in Python
    Recipe 18.10. Computing Prime Numbers
    Recipe 18.11. Formatting Integers as Binary Strings
    Recipe 18.12. Formatting Integers as Strings in Arbitrary Bases
    Recipe 18.13. Converting Numbers to Rationals via Farey Fractions
    Recipe 18.14. Doing Arithmetic with Error Propagation
    Recipe 18.15. Summing Numbers with Maximal Accuracy
    Recipe 18.16. Simulating Floating Point
    Recipe 18.17. Computing the Convex Hulls and Diameters of 2D Point Sets
    Ch. 19. Iterators and Generators
    Ch. 20. Descriptors, Decorators,and Metaclasses
    Colophon
    Index
    • Create BookmarkCreate Bookmark
    • Create Note or TagCreate Note or Tag
    • DownloadDownload
    • PrintPrint
    Share this Page URL
    Help

    Chapter 18. Algorithms > Implementing a Bag (Multiset) Collection Type

    Recipe 18.8. Implementing a Bag (Multiset) Collection Type

    Credit: Raymond Hettinger, Alex Martelli, Matt R

    18.9.1. Problem

    You need a set-like collection type that lets each element be in the set a number of times. In other words, you need a collection type of the kind that is known as multiset in C++ and SQL, and bag in Smalltalk, Objective C, and Haskell's Edison module.


      

    You are currently reading a PREVIEW of this book.

                                                                                            

    Get instant access to over
    $1 million worth of books and videos.

      

    Start a Free Trial