pywalk Recursively walk through and manipulate dict/list/tuple trees
Download

pywalk Ranking & Summary

pywalk Tags

DICT manipulate tuple manipulate dict manipulate tuple

pywalk Description

Recursively walk through and manipulate dict/list/tuple trees Pywalk is a Python library 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': }print("Tree before: "+repr(tree))@walk(tree)def that_aint_my_zip_code(node): if node.value == : node.set()print("Tree after: "+repr(tree))For more, visit https://github.com/jesusabdullah/pywalk. Requirements: · Python

pywalk Related Software