Python: Elegantly merge dictionaries with sum() of values [duplicate]

by

Doesn’t get simpler than this, I think:

a=[("13.5",100)]
b=[("14.5",100), ("15.5", 100)]
c=[("15.5",100), ("16.5", 100)]
input=[a,b,c]

from collections import Counter

print sum(
    (Counter(dict(x)) for x in input),
    Counter())

Note that Counter (also known as a multiset) is the most natural data structure for your data (a type of set to which elements can belong more than once, or equivalently – a map with semantics Element -> OccurrenceCount. You could have used it in the first place, instead of lists of tuples.

Also possible:

from collections import Counter
from operator import add

print reduce(add, (Counter(dict(x)) for x in input))

Using reduce(add, seq) instead of sum(seq, initialValue) is generally more flexible and allows you to skip passing the redundant initial value.

Note that you could also use operator.and_ to find the intersection of the multisets instead of the sum.

The above variant is terribly slow, because a new Counter is created on every step. Let’s fix that.

We know that Counter+Counter returns a new Counter with merged data. This is OK, but we want to avoid extra creation. Let’s use Counter.update instead:

update(self, iterable=None, **kwds) unbound collections.Counter method

Like dict.update() but add counts instead of replacing them.
Source can be an iterable, a dictionary, or another Counter instance.

That’s what we want. Let’s wrap it with a function compatible with reduce and see what happens.

def updateInPlace(a,b):
    a.update(b)
    return a

print reduce(updateInPlace, (Counter(dict(x)) for x in input))

This is only marginally slower than the OP’s solution.

Benchmark: http://ideone.com/7IzSx (Updated with yet another solution, thanks to astynax)

(Also: If you desperately want an one-liner, you can replace updateInPlace by lambda x,y: x.update(y) or x which works the same way and even proves to be a split second faster, but fails at readability. Don’t :-))

More Related Contents:

  1. How to map dict into another dict Python
  2. Create a list of names whose height is higher than 160 – Explanation on nested dicts cycling [closed]
  3. Determine the type of an object?
  4. multiprocessing: How do I share a dict among multiple processes?
  5. I’m getting Key error in python
  6. Getting a list of values from a list of dicts
  7. Merge and sum of two dictionaries
  8. Creating a list of dictionaries results in a list of copies of the same dictionary
  9. Accessing elements of Python dictionary by index
  10. Intersecting two dictionaries
  11. How can I make a dictionary from separate lists of keys and values?
  12. Python creating a dictionary of lists
  13. Is a Python dictionary an example of a hash table?
  14. Python dictionary keys. “In” complexity
  15. Removing Duplicates From Dictionary
  16. Check if value already exists within list of dictionaries?
  17. Convert list into a dictionary [duplicate]
  18. Sort nested dictionary by value, and remainder by another value, in Python
  19. Float values as dictionary key
  20. Most Pythonic Way to Build Dictionary From Single List
  21. Python 3 dictionary with known keys typing
  22. Python: get a dict from a list based on something inside the dict
  23. How to sort dictionary by key in numerical order Python
  24. Check if a given key already exists in a dictionary and increment it
  25. JSON object must be str, bytes or bytearray, not dict
  26. How to convert a pymongo.cursor.Cursor into a dict?
  27. Are there any reasons not to use an OrderedDict?
  28. Dictionary vs Object – which is more efficient and why?
  29. Changing one dict changes all dicts in a list of dicts [duplicate]
  30. How do I send list of dictionary as Body parameter together with Files in FastAPI?

Leave a Comment