I feel like I saw a way to do this recently. Say I've got an empty dict and I want to set a value in a nested dict inside that empty dict, but obviously that nested dict hasn't been created yet. Is there a 1-line way to create the intermediate keys? This is what I want to do:
mydict = {}
mydict['foo']['bar']['foobar'] = 25
If you execute this code you'll get a KeyError exception for 'foo'. Is there a function to create intermediate keys?
Thanks.
from collections import defaultdict
recursivedict = lambda: defaultdict(recursivedict)
mydict = recursivedict()
When you access mydict['foo'], it sets mydict['foo'] to another recursivedict. It'll actually construct a recursivedict for mydict['foo']['bar']['foobar'] as well, but then it'll get thrown out by assigning that to 25.
mydict['foo'] = 15⏎ mydict['foo']['bar']['foobar'] = 25. On a large codebase the OP can't remember what value he assigned earlier.
__getitem__ return wrappers around the element stored overriding that element's __getitem__, which would make it tricky to put a list or whatever into the dict.
An alternative option - depending on your uses, is to use tuples as keys instead of nested dictionaries:
mydict = {}
mydict['foo', 'bar', 'foobar'] = 25
This will work perfectly well unless you want to get a branch of the tree at any point (you can't get mydict['foo'] in this case).
If you knew how many layers of nesting you want, you could also use functools.partial instead of lambda.
from functools import partial
from collections import defaultdict
tripledict = partial(defaultdict, partial(defaultdict, dict))
mydict = tripledict()
mydict['foo']['bar']['foobar'] = 25
Which some people find more readable, and is faster to create instances of than the equivalent lambda-based solution:
python -m timeit -s "from functools import partial" -s "from collections import defaultdict" -s "tripledefaultdict = partial(defaultdict, partial(defaultdict, dict))" "tripledefaultdict()"
1000000 loops, best of 3: 0.281 usec per loop
python -m timeit -s "from collections import defaultdict" -s "recursivedict = lambda: defaultdict(recursivedict)" "recursivedict()"
1000000 loops, best of 3: 0.446 usec per loop
Although, as always, there is no point optimising until you know there is a bottleneck, so pick what is most useful and readable before what is fastest.
prefix = ('foo', 'bar'); l = len(prefix); branch = { k[l:]: v for k, v in mydict.items() if k[:l] == prefix} -- though that needs to iterate over all the keys.
dicts.Not sure why you'd want to, but:
>>> from collections import defaultdict as dd
>>> mydict = dd(lambda: dd(lambda: {}))
>>> mydict['foo']['bar']['foobar'] = 25
>>> mydict
defaultdict(<function <lambda> at 0x021B8978>, {'foo': defaultdict(<function <lambda> at 0x021B8618>, {'bar': {'foobar': 25}})})
