Skip to main content

Recursively walk through and manipulate dict/list/tuple trees

Project description

Pywalk is a python module written for traversing trees built of dictionaries, lists and tuples in a breadth-first manner.

This module is still under development. If you’re used to mature, polished python libraries you may want to avoid pywalk. Additionally, it has only been tested against Python 2.7.1+ (what happens to be what’s on my computer) so it may not work as expected in Python 3.x. However, if you’re a more adventurous developer with an urge (or need) for manipulating nested data structures, this just might be the library for you!

Pywalk is a spiritual port of js-traverse, in that it’s meant to solve similar problems.

How It Works:

walk(tree) returns a decorator that applies a callback to each node in the tree, in a breadth-first manner. For example:

tree = {'a': 1, 'b': [9, 9, 6, 7, 6]}

print("Tree before: "+repr(tree))

@walk(tree)
def that_aint_my_zip_code(node):
    if node.value == [9, 9, 6, 7, 6] :
        node.set([9, 9, 7, 7, 5])

print("Tree after: "+repr(tree))

For more, visit https://github.com/jesusabdullah/pywalk .

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

pywalk-0.0.2.tar.gz (3.2 kB view hashes)

Uploaded source

Supported by

AWS AWS Cloud computing Datadog Datadog Monitoring Facebook / Instagram Facebook / Instagram PSF Sponsor Fastly Fastly CDN Google Google Object Storage and Download Analytics Huawei Huawei PSF Sponsor Microsoft Microsoft PSF Sponsor NVIDIA NVIDIA PSF Sponsor Pingdom Pingdom Monitoring Salesforce Salesforce PSF Sponsor Sentry Sentry Error logging StatusPage StatusPage Status page