Gecko [ goons4good.org ]

Name	Size	Permission	Date
__pycache__	[ DIR ]	drwxr-xr-x	2022-10-11 05:09
decorators	[ DIR ]	drwxr-xr-x	2022-10-11 05:09
dockermod	[ DIR ]	drwxr-xr-x	2022-10-11 05:09
openstack	[ DIR ]	drwxr-xr-x	2022-10-11 05:09
pkg	[ DIR ]	drwxr-xr-x	2022-10-11 05:09
validate	[ DIR ]	drwxr-xr-x	2022-10-11 05:09
__init__.py	237 B	-rw-r--r--	2022-05-16 09:16
aggregation.py	5.17 KB	-rw-r--r--	2022-05-16 09:16
args.py	19.86 KB	-rw-r--r--	2022-05-16 09:16
asynchronous.py	4.07 KB	-rw-r--r--	2022-05-16 09:16
atomicfile.py	5.33 KB	-rw-r--r--	2022-05-16 09:16
aws.py	19.38 KB	-rw-r--r--	2022-05-16 09:16
azurearm.py	11.38 KB	-rw-r--r--	2022-05-16 09:16
beacons.py	517 B	-rw-r--r--	2022-05-16 09:16
boto3_elasticsearch.py	3.73 KB	-rw-r--r--	2022-05-16 09:16
boto3mod.py	8.36 KB	-rw-r--r--	2022-05-16 09:16
boto_elb_tag.py	3.02 KB	-rw-r--r--	2022-05-16 09:16
botomod.py	7.98 KB	-rw-r--r--	2022-05-16 09:16
cache.py	9.81 KB	-rw-r--r--	2022-05-16 09:16
cloud.py	117.04 KB	-rw-r--r--	2022-05-16 09:16
color.py	2.72 KB	-rw-r--r--	2022-05-16 09:16
compat.py	1.81 KB	-rw-r--r--	2022-05-16 09:16
configcomparer.py	3.88 KB	-rw-r--r--	2022-05-16 09:16
configparser.py	10.82 KB	-rw-r--r--	2022-05-16 09:16
context.py	6.8 KB	-rw-r--r--	2022-05-16 09:16
crypt.py	4.71 KB	-rw-r--r--	2022-05-16 09:16
ctx.py	1.42 KB	-rw-r--r--	2022-05-16 09:16
data.py	49.28 KB	-rw-r--r--	2022-05-16 09:16
dateutils.py	2.31 KB	-rw-r--r--	2022-05-16 09:16
debug.py	4.19 KB	-rw-r--r--	2022-05-16 09:16
dictdiffer.py	14.16 KB	-rw-r--r--	2022-05-16 09:16
dicttrim.py	3.9 KB	-rw-r--r--	2022-05-16 09:16
dictupdate.py	11.33 KB	-rw-r--r--	2022-05-16 09:16
dns.py	35.17 KB	-rw-r--r--	2022-05-16 09:16
doc.py	2.25 KB	-rw-r--r--	2022-05-16 09:16
entrypoints.py	2.28 KB	-rw-r--r--	2022-05-16 09:16
environment.py	2.2 KB	-rw-r--r--	2022-05-16 09:16
error.py	1.18 KB	-rw-r--r--	2022-05-16 09:16
etcd_util.py	14.22 KB	-rw-r--r--	2022-05-16 09:16
event.py	52.3 KB	-rw-r--r--	2022-05-16 09:16
extend.py	8.87 KB	-rw-r--r--	2022-05-16 09:16
extmods.py	5.67 KB	-rw-r--r--	2022-05-16 09:16
filebuffer.py	3.15 KB	-rw-r--r--	2022-05-16 09:16
files.py	27.6 KB	-rw-r--r--	2022-05-16 09:16
find.py	22.09 KB	-rw-r--r--	2022-05-16 09:16
fsutils.py	3.29 KB	-rw-r--r--	2022-05-16 09:16
functools.py	5.02 KB	-rw-r--r--	2022-05-16 09:16
gitfs.py	124.49 KB	-rw-r--r--	2022-05-16 09:16
github.py	1.52 KB	-rw-r--r--	2022-05-16 09:16
gzip_util.py	2.86 KB	-rw-r--r--	2022-05-16 09:16
hashutils.py	5.91 KB	-rw-r--r--	2022-05-16 09:16
http.py	34.36 KB	-rw-r--r--	2022-05-16 09:16
iam.py	1.22 KB	-rw-r--r--	2022-05-16 09:16
icinga2.py	754 B	-rw-r--r--	2022-05-16 09:16
idem.py	1.22 KB	-rw-r--r--	2022-05-16 09:16
immutabletypes.py	2.46 KB	-rw-r--r--	2022-05-16 09:16
itertools.py	2.36 KB	-rw-r--r--	2022-05-16 09:16
jid.py	3 KB	-rw-r--r--	2022-05-16 09:16
jinja.py	31.54 KB	-rw-r--r--	2022-05-16 09:16
job.py	6.01 KB	-rw-r--r--	2022-05-16 09:16
json.py	3.78 KB	-rw-r--r--	2022-05-16 09:16
kickstart.py	41.04 KB	-rw-r--r--	2022-05-16 09:16
kinds.py	493 B	-rw-r--r--	2022-05-16 09:16
lazy.py	3.06 KB	-rw-r--r--	2022-05-16 09:16
listdiffer.py	10.9 KB	-rw-r--r--	2022-05-16 09:16
locales.py	2.06 KB	-rw-r--r--	2022-05-16 09:16
mac_utils.py	14.01 KB	-rw-r--r--	2022-05-16 09:16
mako.py	3.63 KB	-rw-r--r--	2022-05-16 09:16
master.py	29.57 KB	-rw-r--r--	2022-05-16 09:16
mattermost.py	1.77 KB	-rw-r--r--	2022-05-16 09:16
memcached.py	3.56 KB	-rw-r--r--	2022-05-16 09:16
migrations.py	1.46 KB	-rw-r--r--	2022-05-16 09:16
mine.py	3.68 KB	-rw-r--r--	2022-05-16 09:16
minion.py	4.13 KB	-rw-r--r--	2022-05-16 09:16
minions.py	43.4 KB	-rw-r--r--	2022-05-16 09:16
mount.py	1.15 KB	-rw-r--r--	2022-05-16 09:16
msazure.py	5.36 KB	-rw-r--r--	2022-05-16 09:16
msgpack.py	4.69 KB	-rw-r--r--	2022-05-16 09:16
nacl.py	13.58 KB	-rw-r--r--	2022-05-16 09:16
namecheap.py	4.32 KB	-rw-r--r--	2022-05-16 09:16
napalm.py	23.79 KB	-rw-r--r--	2022-05-16 09:16
nb_popen.py	7.24 KB	-rw-r--r--	2022-05-16 09:16
network.py	71.07 KB	-rw-r--r--	2022-05-16 09:16
nxos.py	12.94 KB	-rw-r--r--	2022-05-16 09:16
nxos_api.py	4 KB	-rw-r--r--	2022-05-16 09:16
odict.py	13.16 KB	-rw-r--r--	2022-05-16 09:16
oset.py	6.41 KB	-rw-r--r--	2022-05-16 09:16
pagerduty.py	3.03 KB	-rw-r--r--	2022-05-16 09:16
parsers.py	125.31 KB	-rw-r--r--	2022-05-16 09:16
path.py	10.78 KB	-rw-r--r--	2022-05-16 09:16
pbm.py	9.81 KB	-rw-r--r--	2022-05-16 09:16
platform.py	5.16 KB	-rw-r--r--	2022-05-16 09:16
powershell.py	4.15 KB	-rw-r--r--	2022-05-16 09:16
preseed.py	2.64 KB	-rw-r--r--	2022-05-16 09:16
process.py	43.34 KB	-rw-r--r--	2022-05-16 09:16
profile.py	3.21 KB	-rw-r--r--	2022-05-16 09:16
proxy.py	331 B	-rw-r--r--	2022-05-16 09:16
psutil_compat.py	3.65 KB	-rw-r--r--	2022-05-16 09:16
pushover.py	4.51 KB	-rw-r--r--	2022-05-16 09:16
pycrypto.py	5.39 KB	-rw-r--r--	2022-05-16 09:16
pydsl.py	13.74 KB	-rw-r--r--	2022-05-16 09:16
pyobjects.py	10.75 KB	-rw-r--r--	2022-05-16 09:16
reactor.py	19.09 KB	-rw-r--r--	2022-05-16 09:16
reclass.py	752 B	-rw-r--r--	2022-05-16 09:16
roster_matcher.py	3.55 KB	-rw-r--r--	2022-05-16 09:16
rsax931.py	8.07 KB	-rw-r--r--	2022-05-16 09:16
s3.py	8.78 KB	-rw-r--r--	2022-05-16 09:16
saltclass.py	14.27 KB	-rw-r--r--	2022-05-16 09:16
sanitizers.py	2.51 KB	-rw-r--r--	2022-05-16 09:16
schedule.py	70.67 KB	-rw-r--r--	2022-05-16 09:16
schema.py	54.26 KB	-rw-r--r--	2022-05-16 09:16
sdb.py	4.04 KB	-rw-r--r--	2022-05-16 09:16
slack.py	3.57 KB	-rw-r--r--	2022-05-16 09:16
smb.py	11.16 KB	-rw-r--r--	2022-05-16 09:16
smtp.py	3.27 KB	-rw-r--r--	2022-05-16 09:16
ssdp.py	14.75 KB	-rw-r--r--	2022-05-16 09:16
ssh.py	769 B	-rw-r--r--	2022-05-16 09:16
state.py	8.43 KB	-rw-r--r--	2022-05-16 09:16
stringio.py	355 B	-rw-r--r--	2022-05-16 09:16
stringutils.py	16.63 KB	-rw-r--r--	2022-05-16 09:16
systemd.py	5.51 KB	-rw-r--r--	2022-05-16 09:16
templates.py	23.92 KB	-rw-r--r--	2022-05-16 09:16
textformat.py	5.03 KB	-rw-r--r--	2022-05-16 09:16
thin.py	31.64 KB	-rw-r--r--	2022-05-16 09:16
timed_subprocess.py	4.06 KB	-rw-r--r--	2022-05-16 09:16
timeout.py	1.53 KB	-rw-r--r--	2022-05-16 09:16
timeutil.py	2.4 KB	-rw-r--r--	2022-05-16 09:16
url.py	4.96 KB	-rw-r--r--	2022-05-16 09:16
user.py	10.92 KB	-rw-r--r--	2022-05-16 09:16
value.py	247 B	-rw-r--r--	2022-05-16 09:16
vault.py	19.23 KB	-rw-r--r--	2022-05-16 09:16
verify.py	26.97 KB	-rw-r--r--	2022-05-16 09:16
versions.py	16.32 KB	-rw-r--r--	2022-05-16 09:16
virt.py	3.24 KB	-rw-r--r--	2022-05-16 09:16
virtualbox.py	22.43 KB	-rw-r--r--	2022-05-16 09:16
vmware.py	129.74 KB	-rw-r--r--	2022-05-16 09:16
vsan.py	17.18 KB	-rw-r--r--	2022-05-16 09:16
vt.py	30.25 KB	-rw-r--r--	2022-05-16 09:16
vt_helper.py	4.4 KB	-rw-r--r--	2022-05-16 09:16
win_chcp.py	3.7 KB	-rw-r--r--	2022-05-16 09:16
win_dacl.py	94.69 KB	-rw-r--r--	2022-05-16 09:16
win_dotnet.py	4.75 KB	-rw-r--r--	2022-05-16 09:16
win_functions.py	12.69 KB	-rw-r--r--	2022-05-16 09:16
win_lgpo_auditpol.py	8.48 KB	-rw-r--r--	2022-05-16 09:16
win_lgpo_netsh.py	17.87 KB	-rw-r--r--	2022-05-16 09:16
win_network.py	12.41 KB	-rw-r--r--	2022-05-16 09:16
win_osinfo.py	2.83 KB	-rw-r--r--	2022-05-16 09:16
win_pdh.py	13.85 KB	-rw-r--r--	2022-05-16 09:16
win_reg.py	30.05 KB	-rw-r--r--	2022-05-16 09:16
win_runas.py	10.55 KB	-rw-r--r--	2022-05-16 09:16
win_service.py	5.2 KB	-rw-r--r--	2022-05-16 09:16
win_system.py	14.47 KB	-rw-r--r--	2022-05-16 09:16
win_update.py	40.36 KB	-rw-r--r--	2022-05-16 09:16
winapi.py	818 B	-rw-r--r--	2022-05-16 09:16
xdg.py	316 B	-rw-r--r--	2022-05-16 09:16
xmlutil.py	13.91 KB	-rw-r--r--	2022-05-16 09:16
yaml.py	348 B	-rw-r--r--	2022-05-16 09:16
yamldumper.py	3.38 KB	-rw-r--r--	2022-05-16 09:16
yamlencoding.py	1.55 KB	-rw-r--r--	2022-05-16 09:16
yamlloader.py	6.21 KB	-rw-r--r--	2022-05-16 09:16
yamlloader_old.py	8.33 KB	-rw-r--r--	2022-05-16 09:16
yast.py	619 B	-rw-r--r--	2022-05-16 09:16
zeromq.py	1.65 KB	-rw-r--r--	2022-05-16 09:16
zfs.py	19.2 KB	-rw-r--r--	2022-05-16 09:16

Rename

"""
 Calculate the difference between two dictionaries as:
    (1) items added
    (2) items removed
    (3) keys same in both but changed values
    (4) keys same in both and unchanged values

Originally posted at http://stackoverflow.com/questions/1165352/fast-comparison-between-two-python-dictionary/1165552#1165552
  Available at repository: https://github.com/hughdbrown/dictdiffer

Added the ability to recursively compare dictionaries
"""

import copy
from collections.abc import Mapping

def diff(current_dict, past_dict):
    return DictDiffer(current_dict, past_dict)

class DictDiffer:
    """
    Calculate the difference between two dictionaries as:
    (1) items added
    (2) items removed
    (3) keys same in both but changed values
    (4) keys same in both and unchanged values
    """

def __init__(self, current_dict, past_dict):
        self.current_dict, self.past_dict = current_dict, past_dict
        self.set_current, self.set_past = set(list(current_dict)), set(list(past_dict))
        self.intersect = self.set_current.intersection(self.set_past)

def added(self):
        return self.set_current - self.intersect

def removed(self):
        return self.set_past - self.intersect

def changed(self):
        return {o for o in self.intersect if self.past_dict[o] != self.current_dict[o]}

def unchanged(self):
        return {o for o in self.intersect if self.past_dict[o] == self.current_dict[o]}

def deep_diff(old, new, ignore=None):
    ignore = ignore or []
    res = {}
    old = copy.deepcopy(old)
    new = copy.deepcopy(new)
    stack = [(old, new, False)]

while stack:
        tmps = []
        tmp_old, tmp_new, reentrant = stack.pop()
        for key in set(list(tmp_old) + list(tmp_new)):
            if key in tmp_old and key in tmp_new and tmp_old[key] == tmp_new[key]:
                del tmp_old[key]
                del tmp_new[key]
                continue
            if not reentrant:
                if key in tmp_old and key in ignore:
                    del tmp_old[key]
                if key in tmp_new and key in ignore:
                    del tmp_new[key]
                if isinstance(tmp_old.get(key), Mapping) and isinstance(
                    tmp_new.get(key), Mapping
                ):
                    tmps.append((tmp_old[key], tmp_new[key], False))
        if tmps:
            stack.extend([(tmp_old, tmp_new, True)] + tmps)
    if old:
        res["old"] = old
    if new:
        res["new"] = new
    return res

def recursive_diff(past_dict, current_dict, ignore_missing_keys=True):
    """
    Returns a RecursiveDictDiffer object that computes the recursive diffs
    between two dictionaries

past_dict
            Past dictionary

current_dict
        Current dictionary

class RecursiveDictDiffer(DictDiffer):
    """
    Calculates a recursive diff between the current_dict and the past_dict
    creating a diff in the format

{'new': new_value, 'old': old_value}

It recursively searches differences in common keys whose values are
    dictionaries creating a diff dict in the format

{'common_key' : {'new': new_value, 'old': old_value}

The class overrides all DictDiffer methods, returning lists of keys and
    subkeys using the . notation (i.e 'common_key1.common_key2.changed_key')

The class provides access to:
        (1) the added, removed, changes keys and subkeys (using the . notation)
               ``added``, ``removed``, ``changed`` methods
        (2) the diffs in the format above (diff property)
                ``diffs`` property
        (3) a dict with the new changed values only (new_values property)
                ``new_values`` property
        (4) a dict with the old changed values only (old_values property)
                ``old_values`` property
        (5) a string representation of the changes in the format:
                ``changes_str`` property

Note:
        The <_null_> value is a reserved value

.. code-block:: text

common_key1:
          common_key2:
            changed_key1 from '<old_str>' to '<new_str>'
            changed_key2 from '[<old_elem1>, ..]' to '[<new_elem1>, ..]'
        common_key3:
          changed_key3 from <old_int> to <new_int>

"""

NONE_VALUE = "<_null_>"

def __init__(self, past_dict, current_dict, ignore_missing_keys):
        """
        past_dict
            Past dictionary.

current_dict
            Current dictionary.

ignore_missing_keys
            Flag specifying whether to ignore keys that no longer exist in the
            current_dict, but exist in the past_dict. If true, the diff will
            not contain the missing keys.
        """
        super().__init__(current_dict, past_dict)
        self._diffs = self._get_diffs(
            self.current_dict, self.past_dict, ignore_missing_keys
        )
        # Ignores unet values when assessing the changes
        self.ignore_unset_values = True

@classmethod
    def _get_diffs(cls, dict1, dict2, ignore_missing_keys):
        """
        Returns a dict with the differences between dict1 and dict2

Notes:
            Keys that only exist in dict2 are not included in the diff if
            ignore_missing_keys is True, otherwise they are
            Simple compares are done on lists
        """
        ret_dict = {}
        for p in dict1.keys():
            if p not in dict2:
                ret_dict.update({p: {"new": dict1[p], "old": cls.NONE_VALUE}})
            elif dict1[p] != dict2[p]:
                if isinstance(dict1[p], dict) and isinstance(dict2[p], dict):
                    sub_diff_dict = cls._get_diffs(
                        dict1[p], dict2[p], ignore_missing_keys
                    )
                    if sub_diff_dict:
                        ret_dict.update({p: sub_diff_dict})
                else:
                    ret_dict.update({p: {"new": dict1[p], "old": dict2[p]}})
        if not ignore_missing_keys:
            for p in dict2.keys():
                if p not in dict1.keys():
                    ret_dict.update({p: {"new": cls.NONE_VALUE, "old": dict2[p]}})
        return ret_dict

@classmethod
    def _get_values(cls, diff_dict, type="new"):
        """
        Returns a dictionaries with the 'new' values in a diff dict.

type
            Which values to return, 'new' or 'old'
        """
        ret_dict = {}
        for p in diff_dict.keys():
            if type in diff_dict[p].keys():
                ret_dict.update({p: diff_dict[p][type]})
            else:
                ret_dict.update({p: cls._get_values(diff_dict[p], type=type)})
        return ret_dict

@classmethod
    def _get_changes(cls, diff_dict):
        """
        Returns a list of string message with the differences in a diff dict.

Each inner difference is tabulated two space deeper
        """
        changes_strings = []
        for p in sorted(diff_dict.keys()):
            if sorted(diff_dict[p].keys()) == ["new", "old"]:
                # Some string formatting
                old_value = diff_dict[p]["old"]
                if diff_dict[p]["old"] == cls.NONE_VALUE:
                    old_value = "nothing"
                elif isinstance(diff_dict[p]["old"], str):
                    old_value = "'{}'".format(diff_dict[p]["old"])
                elif isinstance(diff_dict[p]["old"], list):
                    old_value = "'{}'".format(", ".join(diff_dict[p]["old"]))
                new_value = diff_dict[p]["new"]
                if diff_dict[p]["new"] == cls.NONE_VALUE:
                    new_value = "nothing"
                elif isinstance(diff_dict[p]["new"], str):
                    new_value = "'{}'".format(diff_dict[p]["new"])
                elif isinstance(diff_dict[p]["new"], list):
                    new_value = "'{}'".format(", ".join(diff_dict[p]["new"]))
                changes_strings.append(
                    "{} from {} to {}".format(p, old_value, new_value)
                )
            else:
                sub_changes = cls._get_changes(diff_dict[p])
                if sub_changes:
                    changes_strings.append("{}:".format(p))
                    changes_strings.extend(["  {}".format(c) for c in sub_changes])
        return changes_strings

def added(self):
        """
        Returns all keys that have been added.

If the keys are in child dictionaries they will be represented with
        . notation
        """

def _added(diffs, prefix):
            keys = []
            for key in diffs.keys():
                if isinstance(diffs[key], dict) and "old" not in diffs[key]:
                    keys.extend(_added(diffs[key], prefix="{}{}.".format(prefix, key)))
                elif diffs[key]["old"] == self.NONE_VALUE:
                    if isinstance(diffs[key]["new"], dict):
                        keys.extend(
                            _added(
                                diffs[key]["new"], prefix="{}{}.".format(prefix, key)
                            )
                        )
                    else:
                        keys.append("{}{}".format(prefix, key))
            return keys

return sorted(_added(self._diffs, prefix=""))

def removed(self):
        """
        Returns all keys that have been removed.

If the keys are in child dictionaries they will be represented with
        . notation
        """

def _removed(diffs, prefix):
            keys = []
            for key in diffs.keys():
                if isinstance(diffs[key], dict) and "old" not in diffs[key]:
                    keys.extend(
                        _removed(diffs[key], prefix="{}{}.".format(prefix, key))
                    )
                elif diffs[key]["new"] == self.NONE_VALUE:
                    keys.append("{}{}".format(prefix, key))
                elif isinstance(diffs[key]["new"], dict):
                    keys.extend(
                        _removed(diffs[key]["new"], prefix="{}{}.".format(prefix, key))
                    )
            return keys

return sorted(_removed(self._diffs, prefix=""))

def changed(self):
        """
        Returns all keys that have been changed.

If the keys are in child dictionaries they will be represented with
        . notation
        """

def _changed(diffs, prefix):
            keys = []
            for key in diffs.keys():
                if not isinstance(diffs[key], dict):
                    continue

if isinstance(diffs[key], dict) and "old" not in diffs[key]:
                    keys.extend(
                        _changed(diffs[key], prefix="{}{}.".format(prefix, key))
                    )
                    continue
                if self.ignore_unset_values:
                    if (
                        "old" in diffs[key]
                        and "new" in diffs[key]
                        and diffs[key]["old"] != self.NONE_VALUE
                        and diffs[key]["new"] != self.NONE_VALUE
                    ):
                        if isinstance(diffs[key]["new"], dict):
                            keys.extend(
                                _changed(
                                    diffs[key]["new"],
                                    prefix="{}{}.".format(prefix, key),
                                )
                            )
                        else:
                            keys.append("{}{}".format(prefix, key))
                    elif isinstance(diffs[key], dict):
                        keys.extend(
                            _changed(diffs[key], prefix="{}{}.".format(prefix, key))
                        )
                else:
                    if "old" in diffs[key] and "new" in diffs[key]:
                        if isinstance(diffs[key]["new"], dict):
                            keys.extend(
                                _changed(
                                    diffs[key]["new"],
                                    prefix="{}{}.".format(prefix, key),
                                )
                            )
                        else:
                            keys.append("{}{}".format(prefix, key))
                    elif isinstance(diffs[key], dict):
                        keys.extend(
                            _changed(diffs[key], prefix="{}{}.".format(prefix, key))
                        )

return keys

return sorted(_changed(self._diffs, prefix=""))

def unchanged(self):
        """
        Returns all keys that have been unchanged.

If the keys are in child dictionaries they will be represented with
        . notation
        """

def _unchanged(current_dict, diffs, prefix):
            keys = []
            for key in current_dict.keys():
                if key not in diffs:
                    keys.append("{}{}".format(prefix, key))
                elif isinstance(current_dict[key], dict):
                    if "new" in diffs[key]:
                        # There is a diff
                        continue
                    else:
                        keys.extend(
                            _unchanged(
                                current_dict[key],
                                diffs[key],
                                prefix="{}{}.".format(prefix, key),
                            )
                        )

return keys

return sorted(_unchanged(self.current_dict, self._diffs, prefix=""))

@property
    def diffs(self):
        """Returns a dict with the recursive diffs current_dict - past_dict"""
        return self._diffs

@property
    def new_values(self):
        """Returns a dictionary with the new values"""
        return self._get_values(self._diffs, type="new")

@property
    def old_values(self):
        """Returns a dictionary with the old values"""
        return self._get_values(self._diffs, type="old")

@property
    def changes_str(self):
        """Returns a string describing the changes"""
        return "\n".join(self._get_changes(self._diffs))