martin f. krafft | f37f068 | 2013-06-14 16:36:20 +0200 | [diff] [blame] | 1 | # |
| 2 | # -*- coding: utf-8 -*- |
| 3 | # |
| 4 | # This file is part of reclass (http://github.com/madduck/reclass) |
| 5 | # |
| 6 | # Copyright © 2007–13 martin f. krafft <madduck@madduck.net> |
| 7 | # Released under the terms of the Artistic Licence 2.0 |
| 8 | # |
| 9 | from base import BaseDictMerger |
| 10 | |
| 11 | class DictRecursivePolicyUpdate(BaseDictMerger): |
| 12 | |
| 13 | def __init__(self, policy=None): |
| 14 | super(DictRecursivePolicyUpdate, self).__init__() |
| 15 | if policy is None: |
martin f. krafft | ae0a392 | 2013-06-16 12:46:05 +0200 | [diff] [blame] | 16 | first = lambda first, second: first |
| 17 | second = lambda first, second: second |
| 18 | |
| 19 | policy = {(dict,dict) : self.merge, |
| 20 | (list,list) : lambda x,y: x+y, |
| 21 | (dict,list) : lambda x,y: self.merge(x, dict(y)), |
| 22 | (dict,type(None)) : first, |
| 23 | (list,type(None)) : first, |
| 24 | None : second |
martin f. krafft | f37f068 | 2013-06-14 16:36:20 +0200 | [diff] [blame] | 25 | } |
| 26 | self._policy = policy |
| 27 | |
| 28 | def merge(self, first, second): |
martin f. krafft | a95eaa3 | 2013-06-16 11:56:41 +0200 | [diff] [blame] | 29 | if second is None: |
| 30 | return first |
| 31 | |
martin f. krafft | f37f068 | 2013-06-14 16:36:20 +0200 | [diff] [blame] | 32 | ret = first.copy() |
| 33 | for k,v in second.iteritems(): |
| 34 | if k in ret: |
martin f. krafft | ae0a392 | 2013-06-16 12:46:05 +0200 | [diff] [blame] | 35 | lookup = (type(ret[k]), type(v)) |
| 36 | pfn = self._policy.get(lookup, self._policy.get(None)) |
martin f. krafft | f37f068 | 2013-06-14 16:36:20 +0200 | [diff] [blame] | 37 | ret[k] = pfn(ret[k], v) |
| 38 | else: |
| 39 | ret[k] = v |
| 40 | return ret |