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


Release history Release notifications

This version
History Node

0.0.2

History Node

0.0.1

Download files

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

Filename, size & hash SHA256 hash help File type Python version Upload date
pywalk-0.0.2.tar.gz (3.2 kB) Copy SHA256 hash SHA256 Source None May 25, 2011

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging CloudAMQP CloudAMQP RabbitMQ AWS AWS Cloud computing Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page