mirror of https://github.com/python/cpython
Update comments and add an optimized path for Counter.update().
This commit is contained in:
parent
7bdca05a3b
commit
1bc1c8ac76
|
@ -253,8 +253,11 @@ class Counter(dict):
|
|||
|
||||
if iterable is not None:
|
||||
if isinstance(iterable, Mapping):
|
||||
if self:
|
||||
for elem, count in iterable.iteritems():
|
||||
self[elem] += count
|
||||
else:
|
||||
dict.update(self, iterable) # fast path when counter is empty
|
||||
else:
|
||||
for elem in iterable:
|
||||
self[elem] += 1
|
||||
|
@ -280,7 +283,6 @@ class Counter(dict):
|
|||
# Knuth TAOCP Volume II section 4.6.3 exercise 19
|
||||
# and at http://en.wikipedia.org/wiki/Multiset
|
||||
#
|
||||
# Results are undefined when inputs contain negative counts.
|
||||
# Outputs guaranteed to only include positive counts.
|
||||
#
|
||||
# To strip negative and zero counts, add-in an empty counter:
|
||||
|
|
Loading…
Reference in New Issue