{"_id":"ast-path","_rev":"34460","name":"ast-path","description":"Library for traversing syntax trees with easy access to an unbroken chain of parent references","dist-tags":{"latest":"0.1.4"},"maintainers":[{"name":"benjamn","email":""}],"time":{"modified":"2021-06-03T10:07:12.000Z","created":"2013-10-03T15:50:54.338Z","0.1.4":"2013-10-10T16:17:15.815Z","0.1.3":"2013-10-10T15:45:20.675Z","0.1.2":"2013-10-09T21:13:52.327Z","0.1.1":"2013-10-09T15:10:06.246Z","0.1.0":"2013-10-03T15:50:54.338Z"},"users":{},"author":{"name":"Ben Newman","email":"bn@cs.stanford.edu"},"repository":{"type":"git","url":"git://github.com/benjamn/ast-path.git"},"versions":{"0.1.4":{"author":{"name":"Ben Newman","email":"bn@cs.stanford.edu"},"name":"ast-path","description":"Library for traversing syntax trees with easy access to an unbroken chain of parent references","keywords":["ast","abstract syntax tree","trees","hierarchy","transformation","traversal"],"version":"0.1.4","homepage":"http://github.com/benjamn/ast-path","repository":{"type":"git","url":"git://github.com/benjamn/ast-path.git"},"main":"main.js","scripts":{"test":"mocha --reporter spec test/tests.js"},"dependencies":{"private":"~0.0.5","mocha":"~1.13.0"},"devDependencies":{},"optionalDependencies":{"mocha":"~1.13.0"},"engines":{"node":">= 0.6"},"readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.4","dist":{"shasum":"490602da871b92f655f08559c4b0c26a74095610","size":32616,"noattachment":false,"key":"/ast-path/-/ast-path-0.1.4.tgz","tarball":"http://registry.cnpm.dingdandao.com/ast-path/download/ast-path-0.1.4.tgz"},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":""}],"directories":{},"publish_time":1381421835815,"_hasShrinkwrap":false,"_cnpm_publish_time":1381421835815},"0.1.3":{"author":{"name":"Ben Newman","email":"bn@cs.stanford.edu"},"name":"ast-path","description":"Library for traversing syntax trees with easy access to an unbroken chain of parent references","keywords":["ast","abstract syntax tree","trees","hierarchy","transformation","traversal"],"version":"0.1.3","homepage":"http://github.com/benjamn/ast-path","repository":{"type":"git","url":"git://github.com/benjamn/ast-path.git"},"main":"main.js","scripts":{"test":"mocha --reporter spec test/tests.js"},"dependencies":{"private":"~0.0.5","mocha":"~1.13.0"},"devDependencies":{},"optionalDependencies":{"mocha":"~1.13.0"},"engines":{"node":">= 0.6"},"readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.3","dist":{"shasum":"cd88b364c6b4dc69c5be119f1bc16ed3a98c9b14","size":32360,"noattachment":false,"key":"/ast-path/-/ast-path-0.1.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/ast-path/download/ast-path-0.1.3.tgz"},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":""}],"directories":{},"publish_time":1381419920675,"_hasShrinkwrap":false,"_cnpm_publish_time":1381419920675},"0.1.2":{"author":{"name":"Ben Newman","email":"bn@cs.stanford.edu"},"name":"ast-path","description":"Library for traversing syntax trees with easy access to an unbroken chain of parent references","keywords":["ast","abstract syntax tree","trees","hierarchy","transformation","traversal"],"version":"0.1.2","homepage":"http://github.com/benjamn/ast-path","repository":{"type":"git","url":"git://github.com/benjamn/ast-path.git"},"main":"main.js","scripts":{"test":"mocha --reporter spec test/tests.js"},"dependencies":{"private":"~0.0.5","mocha":"~1.13.0"},"devDependencies":{},"optionalDependencies":{"mocha":"~1.13.0"},"engines":{"node":">= 0.6"},"readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.2","dist":{"shasum":"108c63d42a22e4666e8a7ee549c24d09981f3a6e","size":31966,"noattachment":false,"key":"/ast-path/-/ast-path-0.1.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/ast-path/download/ast-path-0.1.2.tgz"},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":""}],"directories":{},"publish_time":1381353232327,"_hasShrinkwrap":false,"_cnpm_publish_time":1381353232327},"0.1.1":{"author":{"name":"Ben Newman","email":"bn@cs.stanford.edu"},"name":"ast-path","description":"Library for traversing syntax trees with easy access to an unbroken chain of parent references","keywords":["ast","abstract syntax tree","trees","hierarchy","transformation","traversal"],"version":"0.1.1","homepage":"http://github.com/benjamn/ast-path","repository":{"type":"git","url":"git://github.com/benjamn/ast-path.git"},"main":"main.js","scripts":{"test":"mocha --reporter spec test/tests.js"},"dependencies":{"private":"~0.0.5","mocha":"~1.13.0"},"devDependencies":{},"optionalDependencies":{"mocha":"~1.13.0"},"engines":{"node":">= 0.6"},"readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.1","dist":{"shasum":"14e17ed93a2f542bbcf8e89182a155397f3d5b1d","size":31878,"noattachment":false,"key":"/ast-path/-/ast-path-0.1.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/ast-path/download/ast-path-0.1.1.tgz"},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":""}],"directories":{},"publish_time":1381331406246,"_hasShrinkwrap":false,"_cnpm_publish_time":1381331406246},"0.1.0":{"author":{"name":"Ben Newman","email":"bn@cs.stanford.edu"},"name":"ast-path","description":"Library for traversing syntax trees with easy access to an unbroken chain of parent references","keywords":["ast","abstract syntax tree","trees","hierarchy","transformation","traversal"],"version":"0.1.0","homepage":"http://github.com/benjamn/ast-path","repository":{"type":"git","url":"git://github.com/benjamn/ast-path.git"},"main":"main.js","scripts":{"test":"mocha --reporter spec test/tests.js"},"dependencies":{"private":"~0.0.5","mocha":"~1.13.0"},"devDependencies":{},"optionalDependencies":{"mocha":"~1.13.0"},"engines":{"node":">= 0.6"},"readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.0","dist":{"shasum":"436723afbb9607863c1cc344e6dd89d4f0bb0a98","size":31137,"noattachment":false,"key":"/ast-path/-/ast-path-0.1.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/ast-path/download/ast-path-0.1.0.tgz"},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":""}],"directories":{},"publish_time":1380815454338,"_hasShrinkwrap":false,"_cnpm_publish_time":1380815454338}},"readme":"ast-path\n========\n\nLibrary for traversing syntax trees with easy access to an unbroken chain of parent references\n","_attachments":{},"readmeFilename":"README.md","homepage":"http://github.com/benjamn/ast-path","bugs":{"url":"https://github.com/benjamn/ast-path/issues"}}