152

I have two dictionaries, and I need to find the difference between the two, which should give me both a key and a value.

I have searched and found some addons/packages like datadiff and dictdiff-master, but when I try to import them in Python 2.7, it says that no such modules are defined.

I used a set here:

first_dict = {}
second_dict = {}
 
value = set(second_dict) - set(first_dict)
print value

My output is:

>>> set(['SCD-3547', 'SCD-3456'])

I am getting only keys, and I need to also get the values.

Darrius
  • 313
  • 2
  • 14
Jayashree Shetty
  • 1,695
  • 2
  • 11
  • 8

20 Answers20

204

I think it's better to use the symmetric difference operation of sets to do that Here is the link to the doc.

>>> dict1 = {1:'donkey', 2:'chicken', 3:'dog'}
>>> dict2 = {1:'donkey', 2:'chimpansee', 4:'chicken'}
>>> set1 = set(dict1.items())
>>> set2 = set(dict2.items())
>>> set1 ^ set2
{(2, 'chimpansee'), (4, 'chicken'), (2, 'chicken'), (3, 'dog')}

It is symmetric because:

>>> set2 ^ set1
{(2, 'chimpansee'), (4, 'chicken'), (2, 'chicken'), (3, 'dog')}

This is not the case when using the difference operator.

>>> set1 - set2
{(2, 'chicken'), (3, 'dog')}
>>> set2 - set1
{(2, 'chimpansee'), (4, 'chicken')}

However it may not be a good idea to convert the resulting set to a dictionary because you may lose information:

>>> dict(set1 ^ set2)
{2: 'chicken', 3: 'dog', 4: 'chicken'}
federicober
  • 113
  • 1
  • 10
Roedy
  • 2,065
  • 1
  • 9
  • 3
  • 5
    Excellent, this is more or less the same solution suggested by Raymond Hettinger nearly 9 years ago on another forum: http://code.activestate.com/recipes/576644-diff-two-dictionaries/#c1 – cscanlin Dec 17 '17 at 20:11
  • 42
    Elegant solution. But it cannot apply on the dicts with unhashable values. – Craynic Cai Oct 08 '18 at 12:34
  • 1
    I suspect this answer is what OP really needed and should be the accepted answer. – Andrey Portnoy Oct 23 '18 at 17:50
  • Helps me to do the math in one line : dict(set(a.items()) ^ set(b.items())) – Bhumi Singhal Mar 06 '19 at 12:15
  • 14
    `TypeError: unhashable type: 'dict'` – Lei Yang May 13 '19 at 10:19
  • Nice. But you probably also want to know which dict was responsible for which key/value pair. – Christopher Barber Jun 18 '19 at 20:59
  • @LeiYang your dictionary maybe surrounded by "[]' which means it is list. So first make dictionary from list. – foobar Oct 18 '19 at 11:19
  • 26
    @LeiYang you get `TypeError: unhashable type: 'dict'` because one of the values inside your "top level dict" is another dict. **This proposed solution only works for *flat* dictionaries** – josebama Mar 30 '20 at 12:00
  • I am using dictionary inside dictionary and it is failing with error message : ```TypeError: unhashable type: 'dict'``` – theashwanisingla Sep 28 '20 at 09:08
  • Set elements must be immutable. For example, a tuple may be included in a set: `x = { 10 , ('a', 'b', 'c'), 'hello' , 2.71}` But lists and dictionaries are mutable, so they can't be set elements, so you get TypeError: unhashable type: 'list' or TypeError: unhashable type: 'dict' – Alex.Salnikov Jul 30 '21 at 01:08
  • 1
    None of the presented solutions which utilize `set(...)` will operate on unhashable types present in either dictionary keys or values. – Levko Ivanchuk May 26 '22 at 05:31
  • 1
    it won't work if you have nested dictionaries – Santiago Ortiz Ceballos Oct 07 '22 at 16:41
113

Try the following snippet, using a dictionary comprehension:

value = { k : second_dict[k] for k in set(second_dict) - set(first_dict) }

In the above code we find the difference of the keys and then rebuild a dict taking the corresponding values.

Óscar López
  • 232,561
  • 37
  • 312
  • 386
  • 11
    Since both `dict` and `set` are hashmaps, I don't know why `dict` can't support a `difference()` method, given that `set` does. – Ray Aug 04 '17 at 12:53
  • 6
    That just gives you the dict for the keys which were in the second dict but not in the first. What about the things which were in the first but not in second? – henryJack Jan 31 '18 at 14:20
  • 13
    @henryJack You can do something like the following to also compare values: `value = { k : second_dict[k] for k, _ in set(second_dict.items()) - set(first_dict.items()) }` Doing `dict.items()` gives tuples from keys to values, and those are compared in the set difference. So this will give all new keys as well as changed values. – ascrookes Jan 31 '18 at 15:46
  • @ascrookes - Yes! I'll update my answer to reflect this... https://stackoverflow.com/a/48544451/6782278 – henryJack Feb 01 '18 at 10:22
  • 6
    I am getting `TypeError: unhashable type: 'dict'` – wander95 Mar 08 '19 at 17:58
  • To be sure to see a difference that might be there you have to do it again while switching `second_dict` and `first_dict` making the result symmetric. – Sandro Nov 16 '19 at 23:45
  • 2
    I think you don't need to convert the dict keys to sets, you can just use the set operations on the keys, like so: `second_dict.keys() - first_dict.keys()` – Boris Verkhovskiy Jan 02 '20 at 04:08
  • How about `{ k: v for k,v in dict1.items() if k not in dict2}` ? – Yuri Pozniak Jun 11 '20 at 21:56
  • I'm impressed how @henryJack used these comments to enhance his submitted answer to the OP's question. Nice 'circle back around'. – harperville Sep 06 '20 at 21:06
  • @Óscar López I have a question, what if it has the same keys but a different hash. – Muneeb Ahmad Khurram Jun 19 '21 at 09:12
  • Set elements must be immutable. For example, a tuple may be included in a set: `x = { 10 , ('a', 'b', 'c'), 'hello' , 2.71}` But lists and dictionaries are mutable, so they can't be set elements, so you get TypeError: unhashable type: 'list' or TypeError: unhashable type: 'dict' – Alex.Salnikov Jul 30 '21 at 01:12
  • 1
    @MuneebAhmadKhurram The hash of a key is used for lookup, not for determining if a key is already present. There is always the possibility of a hash collision, as a hash function only guarantees that `hash(x) == hash(y)` if `x == y`; it says nothing about the relationship between `hash(x)` and `hash(y)` if `x != y`. When distinct keys have the same hash, it can slow down key access, but not break it. – chepner Aug 03 '21 at 20:15
  • This doesn't work for dictionaries with same keys but different values – Ghasem Aug 31 '23 at 13:27
  • @Ghasem lol, and it will never, ever work like that. Dictionaries _by their own definition_ map a single key to a unique value, there's no such thing as having "same keys with different values", you want a multimap for that. – Óscar López Aug 31 '23 at 13:37
80

Another solution would be dictdiffer (https://github.com/inveniosoftware/dictdiffer).

import dictdiffer                                          

a_dict = {                                                 
  'a': 'foo',
  'b': 'bar',
  'd': 'barfoo'
}                                                          

b_dict = {                                                 
  'a': 'foo',                                              
  'b': 'BAR',
  'c': 'foobar'
}                                                          

for diff in list(dictdiffer.diff(a_dict, b_dict)):         
    print(diff)

A diff is a tuple with the type of change, the changed value, and the path to the entry.

('change', 'b', ('bar', 'BAR'))
('add', '', [('c', 'foobar')])
('remove', '', [('d', 'barfoo')])
G M
  • 20,759
  • 10
  • 81
  • 84
Christian Berendt
  • 1,617
  • 13
  • 17
20

You can use DeepDiff:

pip install deepdiff

Among other things, it lets you recursively calculate the difference of dictionaries, iterables, strings and other objects:

>>> from deepdiff import DeepDiff

>>> d1 = {1:1, 2:2, 3:3, "foo":4}
>>> d2 = {1:1, 2:4, 3:3, "bar":5, 6:6}
>>> DeepDiff(d1, d2)
{'dictionary_item_added': [root['bar'], root[6]],
 'dictionary_item_removed': [root['foo']],
 'values_changed': {'root[2]': {'new_value': 4, 'old_value': 2}}}

It lets you see what changed (even types), what was added and what was removed. It also lets you do many other things like ignoring duplicates and ignoring paths (defined by regex).

Peque
  • 13,638
  • 11
  • 69
  • 105
13

A solution is to use the unittest module:

from unittest import TestCase
TestCase().assertDictEqual(expected_dict, actual_dict)

Obtained from How can you test that two dictionaries are equal with pytest in python

Brainless
  • 1,522
  • 1
  • 16
  • 30
12

You were right to look at using a set, we just need to dig in a little deeper to get your method to work.

First, the example code:

test_1 = {"foo": "bar", "FOO": "BAR"}
test_2 = {"foo": "bar", "f00": "b@r"}

We can see right now that both dictionaries contain a similar key/value pair:

{"foo": "bar", ...}

Each dictionary also contains a completely different key value pair. But how do we detect the difference? Dictionaries don't support that. Instead, you'll want to use a set.

Here is how to turn each dictionary into a set we can use:

set_1 = set(test_1.items())
set_2 = set(test_2.items())

This returns a set containing a series of tuples. Each tuple represents one key/value pair from your dictionary.

Now, to find the difference between set_1 and set_2:

print set_1 - set_2
>>> {('FOO', 'BAR')}

Want a dictionary back? Easy, just:

dict(set_1 - set_2)
>>> {'FOO': 'BAR'}
jesseops
  • 396
  • 1
  • 6
  • 1
    Please note this is not symmetrical, you'll need to do `(set 2 - set 1)` in addition to `(set 1 - set 2)`. Else you will not capture all the differences, such as `{("f00": "b@r")}`, which is missing here in the output. – PJ_ Jul 20 '21 at 17:13
8

This function gives you all the diffs (and what stayed the same) based on the dictionary keys only. It also highlights some nice Dict comprehension, Set operations and python 3.6 type annotations :)

from typing import Dict, Any, Tuple
def get_dict_diffs(a: Dict[str, Any], b: Dict[str, Any]) -> Tuple[Dict[str, Any], Dict[str, Any], Dict[str, Any], Dict[str, Any]]:

    added_to_b_dict: Dict[str, Any] = {k: b[k] for k in set(b) - set(a)}
    removed_from_a_dict: Dict[str, Any] = {k: a[k] for k in set(a) - set(b)}
    common_dict_a: Dict[str, Any] = {k: a[k] for k in set(a) & set(b)}
    common_dict_b: Dict[str, Any] = {k: b[k] for k in set(a) & set(b)}
    return added_to_b_dict, removed_from_a_dict, common_dict_a, common_dict_b

If you want to compare the dictionary values:

values_in_b_not_a_dict = {k : b[k] for k, _ in set(b.items()) - set(a.items())}
Gustafino
  • 40
  • 4
henryJack
  • 4,220
  • 2
  • 20
  • 24
  • Wouldn't common_dict_a and common_dict_b be the same? Whatever is common to A and B is one set of key:value pairs. No need to duplicate. – codingknob Oct 25 '20 at 01:42
  • The keys are the same; but the values might be different. That is why that is there. – juandesant Aug 20 '21 at 11:07
8

A function using the symmetric difference set operator, as mentioned in other answers, which preserves the origins of the values:

def diff_dicts(a, b, missing=KeyError):
    """
    Find keys and values which differ from `a` to `b` as a dict.

    If a value differs from `a` to `b` then the value in the returned dict will
    be: `(a_value, b_value)`. If either is missing then the token from 
    `missing` will be used instead.

    :param a: The from dict
    :param b: The to dict
    :param missing: A token used to indicate the dict did not include this key
    :return: A dict of keys to tuples with the matching value from a and b
    """
    return {
        key: (a.get(key, missing), b.get(key, missing))
        for key in dict(
            set(a.items()) ^ set(b.items())
        ).keys()
    }

Example

print(diff_dicts({'a': 1, 'b': 1}, {'b': 2, 'c': 2}))

# {'c': (<class 'KeyError'>, 2), 'a': (1, <class 'KeyError'>), 'b': (1, 2)}

How this works

We use the symmetric difference set operator on the tuples generated from taking items. This generates a set of distinct (key, value) tuples from the two dicts.

We then make a new dict from that to collapse the keys together and iterate over these. These are the only keys that have changed from one dict to the next.

We then compose a new dict using these keys with a tuple of the values from each dict substituting in our missing token when the key isn't present.

Jon Betts
  • 3,053
  • 1
  • 14
  • 12
  • 2
    This works great! But it not working when one or both dicts contains lists: set(a.items()) ^ set(b.items()) TypeError: unhashable type: 'list' – Qlii256 Sep 23 '20 at 14:14
8

Not sure this is what the OP asked for, but this is what I was looking for when I came across this question - specifically, how to show key by key the difference between two dicts:

Pitfall: when one dict has a missing key, and the second has it with a None value, the function would assume they are similar

This is not optimized at all - suitable for small dicts

def diff_dicts(a, b, drop_similar=True):
    res = a.copy()

    for k in res:
        if k not in b:
            res[k] = (res[k], None)

    for k in b:
        if k in res:
            res[k] = (res[k], b[k])
        else:
            res[k] = (None, b[k])

    if drop_similar:
        res = {k:v for k,v in res.items() if v[0] != v[1]}

    return res


print(diff_dicts({'a': 1}, {}))
print(diff_dicts({'a': 1}, {'a': 2}))
print(diff_dicts({'a': 2}, {'a': 2}))
print(diff_dicts({'a': 2}, {'b': 2}))
print(diff_dicts({'a': 2}, {'a': 2, 'b': 1}))

Output:

{'a': (1, None)}
{'a': (1, 2)}
{}
{'a': (2, None), 'b': (None, 2)}
{'b': (None, 1)}
CIsForCookies
  • 12,097
  • 11
  • 59
  • 124
8

This is my own version, from combining https://stackoverflow.com/a/67263119/919692 with https://stackoverflow.com/a/48544451/919692, and now I see it is quite similar to https://stackoverflow.com/a/47433207/919692:

def dict_diff(dict_a, dict_b, show_value_diff=True):
  result = {}
  result['added']   = {k: dict_b[k] for k in set(dict_b) - set(dict_a)}
  result['removed'] = {k: dict_a[k] for k in set(dict_a) - set(dict_b)}
  if show_value_diff:
    common_keys =  set(dict_a) & set(dict_b)
    result['value_diffs'] = {
      k:(dict_a[k], dict_b[k])
      for k in common_keys
      if dict_a[k] != dict_b[k]
    }
  return result
juandesant
  • 703
  • 8
  • 16
8

I would recommend using something already written by good developers. Like pytest. It has a deal with any data type, not only dicts. And, BTW, pytest is very good at testing.

from _pytest.assertion.util import _compare_eq_any

print('\n'.join(_compare_eq_any({'a': 'b'}, {'aa': 'vv'}, verbose=3)))

Output is:

Left contains 1 more item:
{'a': 'b'}
Right contains 1 more item:
{'aa': 'vv'}
Full diff:
- {'aa': 'vv'}
?    -    ^^
+ {'a': 'b'}
?        ^

If you don't like using private functions (started with _), just have a look at the source code and copy/paste the function to your code.

P.S.: Tested with pytest==6.2.4

mrvol
  • 2,575
  • 18
  • 21
5

What about this? Not as pretty but explicit.

orig_dict = {'a' : 1, 'b' : 2}
new_dict = {'a' : 2, 'v' : 'hello', 'b' : 2}

updates = {}
for k2, v2 in new_dict.items():
    if k2 in orig_dict:    
        if v2 != orig_dict[k2]:
            updates.update({k2 : v2})
    else:
        updates.update({k2 : v2})

#test it
#value of 'a' was changed
#'v' is a completely new entry
assert all(k in updates for k in ['a', 'v'])
joshE
  • 81
  • 2
  • 8
5
def flatten_it(d):
    if isinstance(d, list) or isinstance(d, tuple):
        return tuple([flatten_it(item) for item in d])
    elif isinstance(d, dict):
        return tuple([(flatten_it(k), flatten_it(v)) for k, v in sorted(d.items())])
    else:
        return d

dict1 = {'a': 1, 'b': 2, 'c': 3}
dict2 = {'a': 1, 'b': 1}

print set(flatten_it(dict1)) - set(flatten_it(dict2)) # set([('b', 2), ('c', 3)])
# or 
print set(flatten_it(dict2)) - set(flatten_it(dict1)) # set([('b', 1)])
cadl
  • 106
  • 2
  • 4
3

Old question, but thought I'd share my solution anyway. Pretty simple.

dicta_set = set(dicta.items()) # creates a set of tuples (k/v pairs)
dictb_set = set(dictb.items())
setdiff = dictb_set.difference(dicta_set) # any set method you want for comparisons
for k, v in setdiff: # unpack the tuples for processing
    print(f"k/v differences = {k}: {v}")

This code creates two sets of tuples representing the k/v pairs. It then uses a set method of your choosing to compare the tuples. Lastly, it unpacks the tuples (k/v pairs) for processing.

zs4
  • 41
  • 3
1

This will return a new dict (only changed data).

def get_difference(obj_1: dict, obj_2: dict) -> dict:
result = {}

for key in obj_1.keys():
    value = obj_1[key]

    if isinstance(value, dict):
        difference = get_difference(value, obj_2.get(key, {}))

        if difference:
            result[key] = difference

    elif value != obj_2.get(key):
        result[key] = obj_2.get(key, None)

return result
devStarkes
  • 11
  • 3
1

For one side comparison you can use dict comprehension:

dict1 = {'a': 1, 'b': 2, 'c': 3, 'd': 4}
dict2 = {'a': OMG, 'b': 2, 'c': 3, 'd': 4}

data = {a:dict1[a] for a in dict1 if dict1[a] != dict2[a]}

output: {'a': 1}

Kihaf
  • 65
  • 1
  • 4
0

Here is a variation that lets you update dict1 values if you know the values in dict2 are right.

Consider:

dict1.update((k, dict2.get(k)) for k, v in dict1.items())
John Stud
  • 1,506
  • 23
  • 46
0
a_dic={'a':1, 'b':2}
b_dic={'a':1, 'b':20}

sharedmLst = set(a_dic.items()).intersection(b_dic.items())
diff_from_b = set(a_dic.items()) - sharedmLst
diff_from_a = set(b_dic.items()) - sharedmLst

print("Among the items in a_dic, the item different from b_dic",diff_from_b)
print("Among the items in b_dic, the item different from a_dic",diff_from_a)

Result :
Among the items in a_dic, the item different from b_dic {('b', 2)}
Among the items in b_dic, the item different from a_dic {('b', 20)}
Damien
  • 1,624
  • 2
  • 19
  • 26
Minho
  • 53
  • 1
  • 2
  • 6
0

This solution works perfectly with unhashable dicts, which fixes this error:

TypeError: Unhashable type 'dict'.

Start with the top-ranked solution from @Roedy. We create a dictionary of lists, which are a good example of something that is non-hashable:

>>> dict1 = {1:['donkey'], 2:['chicken'], 3:['dog']}
>>> dict2 = {1:['donkey'], 2:['chimpansee'], 4:['chicken']}

Then we preprocess to make each value hashable using str(value):

>>> set1 = set([(key, str(value)) for key, value in dict1.items()])
>>> set2 = set([(key, str(value)) for key, value in dict2.items()])

Then we continue as per answer from @Reody:

>>> set1 ^ set2
{(3, "['dog']"), (4, "['chicken']"), (2, "['chimpansee']"), (2,"['chicken']")}
Contango
  • 76,540
  • 58
  • 260
  • 305
  • Note: The values are now display-only, as they have been converted to a string so they can be hashed. However, now we know the differences, we can refer back to the original dictionary. – Contango Jan 31 '23 at 13:46
  • Note: Efficiency wise, this is not all that fast as it converts all values to a string, it may be quicker to use the hash function on each value. – Contango Jan 31 '23 at 13:47
0

For testing, the datatest package will check for differences in dictionaries, numpy arrays, pandas dataframes, etc. Datatest also lets you also set a tolerance for floating point comparisons.

from datatest import validate, accepted
def test_compare_dict():
    expected = {"key1": 0.5}
    actual = {"key1": 0.499}
    with accepted.tolerance(0.1):
        validate(expected, actual)

Differences result in a datatest.ValidationError that contains the relevant Invalid, Deviation, Missing, or Extra items.

Mark Teese
  • 651
  • 5
  • 16