{"_id":"ast-path","_rev":"13-e12999e9ee6ed12b9493127d7b6d0bca","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"},"versions":{"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"},"readme":"ast-path\n========\n\nLibrary for traversing syntax trees with easy access to an unbroken chain of parent references\n","readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.0","dist":{"shasum":"436723afbb9607863c1cc344e6dd89d4f0bb0a98","tarball":"https://registry.npmjs.org/ast-path/-/ast-path-0.1.0.tgz","integrity":"sha512-/gJ7rurIEAf8iuqtbMFXx2W1FvlBhXeJ2lxccVCunysT+/hwkkI17Bo5fuueWhMXOB4giWwXko1DixZIyudkUA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIG7uOgD1GphFPEisd+lzQHjnZBqaJpK5bbhCQV/GZ2OIAiEAkGB1f4ruSgx17Du0KiIv9a8kARjWaKFfH6Wlz24A5hM="}]},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":"bn@cs.stanford.edu"}]},"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"},"readme":"ast-path\n========\n\nLibrary for traversing syntax trees with easy access to an unbroken chain of parent references\n","readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.1","dist":{"shasum":"14e17ed93a2f542bbcf8e89182a155397f3d5b1d","tarball":"https://registry.npmjs.org/ast-path/-/ast-path-0.1.1.tgz","integrity":"sha512-aeKYd+y7BN0GWX1fLazsLduHPLxgyGyiU3chBlYL3sdNZ579vifF5KvQGC6KdjLGJywz+pXgjEKhEwBY4t0Kxw==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEwtBitK9a761VOzanPjVq0SZqJm2Y6lZ4+YtsImvI7QAiBqqk51JQYYgtg8ANdx9GolU4FrReBHNUg/rB6sg5dF0w=="}]},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":"bn@cs.stanford.edu"}]},"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"},"readme":"ast-path\n========\n\nLibrary for traversing syntax trees with easy access to an unbroken chain of parent references\n","readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.2","dist":{"shasum":"108c63d42a22e4666e8a7ee549c24d09981f3a6e","tarball":"https://registry.npmjs.org/ast-path/-/ast-path-0.1.2.tgz","integrity":"sha512-8Mv8P6KIwWKx9hSccjeLFoQY/bS0PRN/0TL9HM0TOYNdwukIwtHfmwH8m2GrEx83FWrjovzlzQnEh4Gr97QWAA==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIBFlSCnse+9padK95qQZdFfrdwVgwpTG/k+eLq+BC3jmAiAn0gwks9gaMeb80BmwtOtvm3gMdYde0OrmV2SZXR7quw=="}]},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":"bn@cs.stanford.edu"}]},"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"},"readme":"ast-path\n========\n\nLibrary for traversing syntax trees with easy access to an unbroken chain of parent references\n","readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.3","dist":{"shasum":"cd88b364c6b4dc69c5be119f1bc16ed3a98c9b14","tarball":"https://registry.npmjs.org/ast-path/-/ast-path-0.1.3.tgz","integrity":"sha512-mFswiXuUIhXVKKgPwba1XmYUWLnIFJcCEXBBT/nUatmpTJkqET7RvQREev7iju5eyTOdkytBNNf4UL0V8QIMGg==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEYCIQCxhd7a/mmdBJ5tIi2ADLIjYVzaN73GOTAs7EQWtc1eBgIhAOzX92yQQZhLspV3vGDJmlUIwsfgnlwoZoWFZi6I24KE"}]},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","email":"bn@cs.stanford.edu"}]},"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"},"readme":"ast-path\n========\n\nLibrary for traversing syntax trees with easy access to an unbroken chain of parent references\n","readmeFilename":"README.md","bugs":{"url":"https://github.com/benjamn/ast-path/issues"},"_id":"ast-path@0.1.4","dist":{"shasum":"490602da871b92f655f08559c4b0c26a74095610","tarball":"https://registry.npmjs.org/ast-path/-/ast-path-0.1.4.tgz","integrity":"sha512-v1/09lQrqyStZftANo4a5NnLaHE4cth91ElCudb3ZS59w8XijVi9qu0nwWRvKCY3dMhkEQCDklC+aXKUm1HLdQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIBXIsB1LsRve1QCPOfv0tlAtYnIXpXJZJmegSa1d9LnHAiEAsxs14RJ9FyK/r/lFr6xmDc+ip2whXG/k4M4kkNb75gM="}]},"_from":".","_npmVersion":"1.3.11","_npmUser":{"name":"benjamn","email":"bn@cs.stanford.edu"},"maintainers":[{"name":"benjamn","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","maintainers":[{"name":"benjamn","email":"bn@cs.stanford.edu"}],"time":{"modified":"2022-06-13T03:35:02.135Z","created":"2013-10-03T15:50:53.009Z","0.1.0":"2013-10-03T15:50:54.338Z","0.1.1":"2013-10-09T15:10:06.246Z","0.1.2":"2013-10-09T21:13:52.327Z","0.1.3":"2013-10-10T15:45:20.675Z","0.1.4":"2013-10-10T16:17:15.815Z"},"author":{"name":"Ben Newman","email":"bn@cs.stanford.edu"},"repository":{"type":"git","url":"git://github.com/benjamn/ast-path.git"}}