collections.Counter.elements()

elements()

Return an iterator over elements repeating each as many times as its count. Elements are returned in arbitrary order. If an element’s count is less than one, elements() will ignore it.

>>> c = Counter(a=4, b=2, c=0, d=-2)
>>> sorted(c.elements())
['a', 'a', 'a', 'a', 'b', 'b']

Links:

https://docs.python.org/3.5/library/collections.html#collections.Counter.elements

doc_python

2016-10-07 17:28:55

Comments

Popular Articles

collections.Counter class collections.Counter([iterable-or-mapping]) A Counter is a dict subclass for counting hashable objects. It is an unordered collection where e

collections.Counter.subtract() subtract([iterable-or-mapping]) Elements are subtracted from an iterable or from another mapping (or counter). Like dict.update() but subtracts co

collections.Counter.update() update([iterable-or-mapping]) Elements are counted from an iterable or added-in from another mapping (or counter). Like dict.update() but adds cou

collections.Counter.fromkeys() fromkeys(iterable) This class method is not implemented for Counter objects.

collections.Counter.most_common() most_common([n]) Return a list of the n most common elements and their counts from the most common to the least. If n is omitted or None, most_com