dpath
Filesystem-like pathing and searching for dictionaries
Rank: #1397Downloads: 7,461,153 (30 days)Stars: 627Forks: 87
Description
dpath-python
============
|PyPI|
|Python Version|
|Build Status|
|Gitter|
A python library for accessing and searching dictionaries via
/slashed/paths ala xpath
Basically it lets you glob over a dictionary as if it were a filesystem.
It allows you to specify globs (ala the bash eglob syntax, through some
advanced fnmatch.fnmatch magic) to access dictionary elements, and
provides some facility for filtering those results.
sdists are available on pypi: http://pypi.python.org/pypi/dpath
Installing
==========
The best way to install dpath is via easy\_install or pip.
::
easy_install dpath
pip install dpath
Using Dpath
===========
.. code-block:: python
import dpath
Separators
==========
All of the functions in this library (except 'merge') accept a
'separator' argument, which is the character that should separate path
components. The default is '/', but you can set it to whatever you want.
Searching
=========
Suppose we have a dictionary like this:
.. code-block:: python
x = {
"a": {
"b": {
"3": 2,
"43": 30,
"c": [],
"d": ['red', 'buggy', 'bumpers'],
}
}
}
... And we want to ask a simple question, like "Get me the value of the
key '43' in the 'b' hash which is in the 'a' hash". That's easy.
.. code-block:: pycon
>>> help(dpath.get)
Help on function get in module dpath:
get(obj, glob, separator='/')
Given an object which contains only one possible match for the given glob,
return the value for the leaf matching the given glob.
If more than one leaf matches the glob, ValueError is raised. If the glob is
not found, KeyError is raised.
>>> dpath.get(x, '/a/b/43')
30
Or you could say "Give me a new dictionary with the values of all
elements in ``x['a']['b']`` where the key is equal to the glob ``'[cd]'``. Okay.
.. code-block:: pycon
>>> help(dpath.search)
Help on function search in module dpath:
search(obj, glob, yielded=False)
Given a path glob, return a dictionary containing all keys
that matched the given glob.
If 'yielded' is true, then a dictionary will not be returned.
Instead tuples will be yielded in the form of (path, value) for
every element in the document that matched the glob.
... Sounds easy!
.. code-block:: pycon
>>> result = dpath.search(x, "a/b/[cd]")
>>> print(json.dumps(result, indent=4, sort_keys=True))
{
"a": {
"b": {
"c": [],
"d": [
"red",
"buggy",
"bumpers"
]
}
}
}
... Wow that was easy. What if I want to iterate over the results, and
not get a merged view?
.. code-block:: pycon
>>> for x in dpath.search(x, "a/b/[cd]", yielded=True): print(x)
...
('a/b/c', [])
('a/b/d', ['red', 'buggy', 'bumpers'])
... Or what if I want to just get all the values back for the glob? I
don't care about the paths they were found at:
.. code-block:: pycon
>>> help(dpath.values)
Help on function values in module dpath:
values(obj, glob, separator='/', afilter=None, dirs=True)
Given an object and a path glob, return an array of all values which match
the glob. The arguments to this function are identical to those of search(),
and it is primarily a shorthand for a list comprehension over a yielded
search call.
>>> dpath.values(x, '/a/b/d/*')
['red', 'buggy', 'bumpers']
Example: Setting existing keys
==============================
Let's use that same dictionary, and set keys like 'a/b/[cd]' to the
value 'Waffles'.
.. code-block:: pycon
>>> help(dpath.set)
Help on function set in module dpath:
set(obj, glob, value)
Given a path glob, set all existing elements in the document
to the given value. Returns the number of elements changed.
>>> dpath.set(x, 'a/b/[cd]', 'Waffles')
2
>>> print(json.dumps(x, indent=4, sort_keys=True))
{
"a": {
"b": {
"3": 2,
"43": 30,
"c": "Waffles",
"d": "Waffles"
}
}
}
Example: Adding new keys
========================
Let's make a new key with the path 'a/b/e/f/g', set it to "Roffle". This
behaves like 'mkdir -p' in that it makes all the intermediate paths
necessary to get to the terminus.
.. code-block:: pycon
>>> help(dpath.new)
Help on function new in module dpath:
new(obj, path, value)
Set the element at the terminus of path to value, and create
it if it does not exist (as opposed to 'set' that can only
change existing keys).
path will NOT be treated like a glob. If it has globbing
characters in it, they will become part of the resulting
keys
>>> dpath.new(x, 'a/b/e/f/g', "Roffle")
>>> print(json.dumps(x, indent=4, sort_keys=True))
{
"a": {
"b": {
"3": 2,
"43": 30,
"c": "Waffles",
"d": "Waffles",
"e": {
"f": {
"g": "Roffle"
}
}
}
}
}
This works the way we expect with lists, as well. If you have a list
object and set index 10 of that list object, it will grow the list
object with None entries in order to make it big enough:
.. code-block:: pycon
>>> dpath.new(x, 'a/b/e/f/h', [])
>>> dpath.new(x, 'a/b/e/f/h/13', 'Wow this is a big array, it sure is lonely in here by myself')
>>> print(json.dumps(x, indent=4, sort_keys=True))
{
"a": {
"b": {
"3": 2,
"43": 30,
"c": "Waffles",
"d": "Waffles",
"e": {
"f": {
"g": "Roffle",
"h": [
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
null,
"Wow this is a big array, it sure is lonely in here by myself"
]
}
}
}
}
}
Handy!
Example: Deleting Existing Keys
===============================
To delete keys in an object, use dpath.delete, which accepts the same globbing syntax as the other methods.
.. code-block:: pycon
>>> help(dpath.delete)
delete(obj, glob, separator='/', afilter=None):
Given a path glob, delete all elements that match the glob.
Returns the number of deleted objects. Raises PathNotFound if
no paths are found to delete.
Example: Merging
================
Also, check out dpath.merge. The python dict update() method is
great and all but doesn't handle merging dictionaries deeply. This one
does.
.. code-block:: pycon
>>> help(dpath.merge)
Help on function merge in module dpath:
merge(dst, src, afilter=None, flags=4, _path='')
Merge source into destination. Like dict.update() but performs
deep merging.
flags is an OR'ed combination of MergeType enum members.
* ADDITIVE : List objects are combined onto one long
list (NOT a set). This is the default flag.
* REPLACE : Instead of combining list objects, when
2 list objects are at an equal depth of merge, replace
the destination with the source.
* TYPESAFE : When 2 keys at equal levels are of different
types, raise a TypeError exception. By default, the source
replaces the destination in this situation.
>>> y = {'a': {'b': { 'e': {'f': {'h': [None, 0, 1, None, 13, 14]}}}, 'c': 'RoffleWaffles'}}
>>> print(json.dumps(y, indent=4, sort_keys=True))
{
"a": {
"b": {
"e": {
"f": {
"h": [
null,
0,
1,
null,
13,
14
]
}
}
},
"c": "RoffleWaffles"
}
}
>>> dpath.merge(x, y)
>>> print(json.dumps(x, indent=4, sort_keys=True))
{
"a": {
"b": {
"3": 2,
"43": 30,
"c": "Waffles",
"d": "Waffles",
"e": {
"f": {
"g": "Roffle",
"h": [
null,
0,
1,
null,
13,
14,
null,
null,
null,
null,
null,
null,
null,
"Wow this is a big array, it sure is lonely in here by myself"
]
}
}
},
"c": "RoffleWaffles"
}
}
Now that's handy. You shouldn't try to use this as a replacement for the
deepcopy method, however - while merge does create new dict and list
objects inside the target, the terminus objects (strings and ints) are
not copied, they are just re-referenced in the merged object.
Filtering
=========
All of the methods in thi