Skip to main content

Merge nested dicts according to a few specific rules

Project description

Prio merge

Merge two dictionaries on a deep level with one taking precedent over another, and by using a few rules:

If keys exist in just one of the dictionaries, it will be merged in the final dictionary

If two keys exist in the same nested depth, one of these things will happen

  • if the values have different types, prioritized dict value will take remain
  • if both values are lists, they will be combined according by appending the non-prioritized list to the other and then removing duplicates by casting to a list. This means that list order can not be guaranteed It also means that any list will end the recursive nature of the merge
  • if both values are dicts, the keys will be combined recursively using these rules
  • otherwise take the value from the prioritized dictionary

Usage

from prio_merge import prio_merge

prio_dict = {}

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

prio_merge-0.0.2.tar.gz (1.7 kB view hashes)

Uploaded Source

Built Distribution

prio_merge-0.0.2-py3-none-any.whl (3.0 kB view hashes)

Uploaded Python 3

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page