vishap.backports package¶
Submodules¶
vishap.backports.collections module¶
- class vishap.backports.collections.Counter(iterable=None, **kwds)[source]¶
Bases: dict
Dict subclass for counting hashable objects. Sometimes called a bag or multiset. Elements are stored as dictionary keys and their counts are stored as dictionary values.
>>> Counter('zyzygy') Counter({'y': 3, 'z': 2, 'g': 1})
- elements()[source]¶
Iterator over elements repeating each as many times as its count.
>>> c = Counter('ABCABC') >>> sorted(c.elements()) ['A', 'A', 'B', 'B', 'C', 'C']
If an element’s count has been set to zero or is a negative number, elements() will ignore it.
- most_common(n=None)[source]¶
List the n most common elements and their counts from the most common to the least. If n is None, then list all element counts.
>>> Counter('abracadabra').most_common(3) [('a', 5), ('r', 2), ('b', 2)]
- update(iterable=None, **kwds)[source]¶
Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.
>>> c = Counter('which') >>> c.update('witch') # add elements from another iterable >>> d = Counter('watch') >>> c.update(d) # add elements from another counter >>> c['h'] # four 'h' in which, witch, and watch 4