Multisets
From charlesreid1
Multiset data structure
Multisets can be thought of as counting dictionaries - that is, dictionaries where the keys are unique objects, and their corresponding values are counts of their frequencies of occurrence. In fact, in Python the built-in collections module provides a Counting object precisely for this purpose.
Multiset combinatorics
In mathematics, a multiset is defined formally as a 2-tuple, in which each element of a set maps to a natural number that indicates the number of occurrences of that element.
See AOCP/Multisets
Maps and Dictionaries Part of Computer Science Notes
Series on Data Structures
Maps/Dictionaries Maps · Maps/ADT · Maps in Java · Maps/OOP · Maps/Operations and Performance Map implementations: Maps/AbstractMap · Maps/UnsortedArrayMap · Maps/SortedArrayMap Dictionary implementations: Dictionaries/LinkedDict · Dictionaries/ArrayDict
Hashes Hash Maps/OOP · Hash Maps/Operations and Performance Hash Maps/Dynamic Resizing · Hash Maps/Collision Handling with Chaining Hash functions: Hash Functions · Hash Functions/Cyclic Permutation Hash map implementations: Hash Maps/AbstractHashMap · Hash Maps/ChainedHashMap
Skip Lists · Java/ConcurrentSkipList · Java implementations: SkipList
Sets Sets · Sets/ADT · Sets in Java · Sets/OOP · Multisets
|