{"bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"dist":{"shasum":"436723afbb9607863c1cc344e6dd89d4f0bb0a98","tarball":"https://registry.npmjs.org/ast-path/-/ast-path-0.1.0.tgz","integrity":"sha512-/gJ7rurIEAf8iuqtbMFXx2W1FvlBhXeJ2lxccVCunysT+/hwkkI17Bo5fuueWhMXOB4giWwXko1DixZIyudkUA==","signatures":[{"sig":"MEUCIG7uOgD1GphFPEisd+lzQHjnZBqaJpK5bbhCQV/GZ2OIAiEAkGB1f4ruSgx17Du0KiIv9a8kARjWaKFfH6Wlz24A5hM=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"main.js","name":"ast-path","_from":".","author":{"name":"Ben Newman","email":"bn@cs.stanford.edu"},"readme":"ast-path\n========\n\nLibrary for traversing syntax trees with easy access to an unbroken chain of parent references\n","engines":{"node":">= 0.6"},"scripts":{"test":"mocha --reporter spec test/tests.js"},"_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"homepage":"http://github.com/benjamn/ast-path","keywords":["ast","abstract syntax tree","trees","hierarchy","transformation","traversal"],"repository":{"url":"git://github.com/benjamn/ast-path.git","type":"git"},"_npmVersion":"1.3.11","description":"Library for traversing syntax trees with easy access to an unbroken chain of parent references","maintainers":[{"name":"benjamn","email":"bn@cs.stanford.edu"}],"dependencies":{"mocha":"~1.13.0","private":"~0.0.5"},"readmeFilename":"README.md","devDependencies":{},"optionalDependencies":{"mocha":"~1.13.0"},"_id":"ast-path@0.1.0","version":"0.1.0"}