{"dist":{"shasum":"a4e6870f122e39fee0c3cab9ce3273f2adadd5b6","tarball":"https://registry.npmjs.org/falafel/-/falafel-0.0.2.tgz","integrity":"sha512-54Dvdeofwo9WOu3Syjpm30oi0XvMvVfXtCtvMlwXJVkzz0RTrchX1kYjhrnRbNL3onFa6ceoAmDeNEB21Yci6A==","signatures":[{"sig":"MEYCIQCqQoFXPdqskYAgSeLtGI1MLwlovEFjYIkogV+qOo7y3AIhAM/bn+W6YD+wM8IkXV668uP7ZFJTqrtCAT8VGqe3xkij","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","name":"falafel","author":{"url":"http://substack.net","name":"James Halliday","email":"mail@substack.net"},"engines":{"node":">=0.4.0"},"license":"MIT","scripts":{"test":"tap test/*.js"},"_npmUser":{"name":"substack","email":"mail@substack.net"},"keywords":["ast","source","traversal","syntax","tree","burrito"],"repository":{"url":"git://github.com/substack/node-falafel.git","type":"git"},"_npmVersion":"1.1.19","description":"transform the ast on a recursive walk","directories":{"test":"test","example":"example"},"maintainers":[{"name":"substack","email":"mail@substack.net"}],"_nodeVersion":"v0.6.11","dependencies":{"esprima":"~0.9.9"},"_defaultsLoaded":true,"devDependencies":{"tap":"~0.2.4"},"_engineSupported":true,"optionalDependencies":{},"_id":"falafel@0.0.2","version":"0.0.2"}