{"_id":"neotraverse","_rev":"20-d1740000f2a25ac32d1cd2f72db87635","name":"neotraverse","dist-tags":{"next":"0.6.9-next.0","latest":"1.0.1"},"versions":{"0.0.1":{"name":"neotraverse","version":"0.0.1","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.0.1","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/puruvj/neotraverse","bugs":{"url":"https://github.com/puruvj/neotraverse/issues"},"dist":{"shasum":"80d5afc14a589bc60dd5f783f9631ee83ca2125d","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.0.1.tgz","fileCount":41,"integrity":"sha512-1Epzum6gldW9KEN36bPfc0Y+a1O11sjJPcbLN4FVCabkjADwbzfKFx0F9wxUqmXlmt5bdxxaTaQxz3Zj1moliw==","signatures":[{"sig":"MEUCIG2sbEbco0yMWVvzb2WLvOykSyqDXcJ2T1NgTJsHbwIQAiEA0d/N3xSvyZ58R1nkeNtoi+DMFrRZPPU9KFygojs8tiY=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":131504},"main":"dist/index.js","type":"module","types":"./dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./src/index.js"},"default":"./dist/min/index.js"},"./legacy":{"node":"./dist/legacy/index.cjs","types":"./dist/index.d.ts","import":"./dist/legacy/index.js","default":"./dist/legacy/index.js"},"./package.json":"./package.json"},"gitHead":"e1028ae99c4afd551cc163b3f300c1c75dcb562a","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/puruvj/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","dependencies":{"gopd":"^1.0.1","klona":"^2.0.6","which-typed-array":"^1.1.15","typedarray.prototype.slice":"^1.0.3"},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.0.1_1720643350412_0.8027284883003818","host":"s3://npm-registry-packages"}},"0.0.2":{"name":"neotraverse","version":"0.0.2","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.0.2","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/puruvj/neotraverse","bugs":{"url":"https://github.com/puruvj/neotraverse/issues"},"dist":{"shasum":"fb00c9843c6ef05391d12dcdb6b7027118286a6b","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.0.2.tgz","fileCount":42,"integrity":"sha512-/l0/FZlOo+TK14yX7EzXKeK9lUR7Veh+7qHPOpMij/ea6Y8q68UlNgOKtv5K+uVyc6e3GM6J639faKmf50w30g==","signatures":[{"sig":"MEYCIQD3U10ktkUqUVf8mqXb83px/2gAzbX3+ZemMQ+G7o3aOgIhAN8mFswsAR9wUXLrwD+bSgmSBWG3QaEN6N25U3GydHUq","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":141710},"main":"dist/legacy/legacy.cjs","type":"module","types":"./dist/legacy/legacy.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./src/index.js"},"default":"./dist/min/index.js"},"./legacy":{"node":"./dist/legacy/legacy.cjs","types":"./dist/legacy/legacy.d.ts","import":"./dist/legacy/legacy.js","default":"./dist/legacy/legacy.js"},"./package.json":"./package.json"},"gitHead":"98680f7505a9113f7874eac3c44b0ba471c3e309","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/puruvj/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.0.2_1720645856722_0.9872757680840618","host":"s3://npm-registry-packages"}},"0.0.3":{"name":"neotraverse","version":"0.0.3","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.0.3","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/puruvj/neotraverse","bugs":{"url":"https://github.com/puruvj/neotraverse/issues"},"dist":{"shasum":"98db1b9b6acf459a5b8b4a00b965b22d6c7ebe40","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.0.3.tgz","fileCount":39,"integrity":"sha512-8VylRXVpVVhC4UAvmCbP7hDriu0mpZkfl11vi+OG8J6LOQP2Q8HePN/Xba6coUqyZb/mW9ELaDXnv8UF4E8Njg==","signatures":[{"sig":"MEQCID/stE674AYn42/yhvgkLtKzQHKJ8kM2+kVO+DBYTH3wAiA6cfkBRJzybV6wkaUd50YbFT+8vRx/mhJiJGR5Kg9ElA==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":124419},"main":"dist/legacy/legacy.cjs","type":"module","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./src/index.js"},"default":"./dist/min/index.js"},"./legacy":{"node":"./dist/legacy/legacy.cjs","types":"./dist/legacy/legacy.d.ts","import":"./dist/legacy/legacy.js","default":"./dist/legacy/legacy.js"},"./package.json":"./package.json"},"gitHead":"a67ee555eec5ed15418ec60f86195f77dfce0e75","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/puruvj/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.0.3_1720688211348_0.9821899220597294","host":"s3://npm-registry-packages"}},"0.0.5":{"name":"neotraverse","version":"0.0.5","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.0.5","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/puruvj/neotraverse","bugs":{"url":"https://github.com/puruvj/neotraverse/issues"},"dist":{"shasum":"ce69e2e0ba2d7eb8472044bfbcdef775068d9b63","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.0.5.tgz","fileCount":10,"integrity":"sha512-GWBK3fovX/Gox6ssVrc7lq8qDIhiNLztLc1CO/dUrg2WBZz6YuGup+4SoG2HiBuktrn0Mzo7xo0KSdarM2aTnA==","signatures":[{"sig":"MEUCIQC/C5X3bJlAOH/P49YBMaU/WKhIiPEP+npTvdoB6iRcMAIgTOuef1xyBf/si4ThARZ2xWo6HjEYtl9MM+Cr9h56Uz0=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":82551},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"node":"./dist/legacy/legacy.cjs","types":"./dist/legacy.d.ts","import":"./dist/legacy/legacy.mjs","default":"./dist/legacy/index.cjs"},"./package.json":"./package.json"},"gitHead":"542eb635aa40b746fa895df51842736a2c824e7a","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/puruvj/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.0.5_1720689535410_0.7470868297767614","host":"s3://npm-registry-packages"}},"0.6.8":{"name":"neotraverse","version":"0.6.8","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.8","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/puruvj/neotraverse","bugs":{"url":"https://github.com/puruvj/neotraverse/issues"},"dist":{"shasum":"3ab52fd8c4546e4abd39c511d89a53203cb471b5","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.8.tgz","fileCount":10,"integrity":"sha512-FYznZ27mJyj2w4VSxSPuS3Wow3ObwO3K3m3ePfoK7GTpdizMHrwLnROHM54/vM5Ftd+msTMKHdxxUdCcz4fiBw==","signatures":[{"sig":"MEUCICFG/KbN7QAye4ljdeGG4iLVoHraZetXeSPRvqc/g+wMAiEAnACocoUToKY6YAhPZQ0FRDCdxnplMwUI1o06X01JZCo=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":82808},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"node":"./dist/legacy/legacy.cjs","types":"./dist/legacy.d.ts","import":"./dist/legacy/legacy.mjs","default":"./dist/legacy/index.cjs"},"./package.json":"./package.json"},"gitHead":"4f2674426a8c85529680a6047ed309bd7a6ac1d4","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/puruvj/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.8_1720700015340_0.7750185552050408","host":"s3://npm-registry-packages"}},"0.6.8-test.1":{"name":"neotraverse","version":"0.6.8-test.1","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.8-test.1","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/puruvj/neotraverse","bugs":{"url":"https://github.com/puruvj/neotraverse/issues"},"dist":{"shasum":"3d7bf819b9033563f85b0e8355b78ffc51eef712","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.8-test.1.tgz","fileCount":13,"integrity":"sha512-GAgyhX9XuDo3n5v6QAElV86OjHjUylA92Ac92jhMsNVC1328LS0/we9UU54SfqTaL6OeS79gHvagKonB9HyTHw==","signatures":[{"sig":"MEQCIAP2QQsyr5qxx6wD7Wp/ZIBdnurTDA1W8X5RyquyayQ4AiBPa4cO/wPU/Dlj7r7j6624rO62x26RJhhqiJ9yozgycQ==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":69445},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"node":"./dist/legacy/legacy.cjs","types":"./dist/legacy.d.ts","import":"./dist/legacy/legacy.mjs","default":"./dist/legacy/index.cjs"},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/min/index.js"},"./package.json":"./package.json"},"gitHead":"5e14684a1efcd0affc49a1c9e456780f9b2ef1d6","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/puruvj/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.8-test.1_1720874393337_0.9939055328548967","host":"s3://npm-registry-packages"}},"0.6.9-test.1":{"name":"neotraverse","version":"0.6.9-test.1","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.9-test.1","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/puruvj/neotraverse","bugs":{"url":"https://github.com/puruvj/neotraverse/issues"},"dist":{"shasum":"2feb60ceaa91d20b4bdf913b88ebdfeef539009c","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.9-test.1.tgz","fileCount":13,"integrity":"sha512-6Dpca9wu7pVdQcl6P9sYfDArFd8zlZTpOnuXNuoVC+kG2vWZ9xS4IFZfeqyqxbzRUSxhqmkjlX9QMZsgRAa5VQ==","signatures":[{"sig":"MEUCIQD4ghg+wHBUHFq7B8RPitQLSOgJUJ48g3B7IjbCzvHhuwIgODwxg5TRT1weHP163rj4apeu8ZCgwQeqO0bZtwf7rTI=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":69445},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"node":"./dist/legacy/legacy.cjs","types":"./dist/legacy.d.ts","import":"./dist/legacy/legacy.mjs","default":"./dist/legacy/index.cjs"},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/min/index.js"},"./package.json":"./package.json"},"gitHead":"5e14684a1efcd0affc49a1c9e456780f9b2ef1d6","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/puruvj/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.9-test.1_1720874401864_0.9073334801388","host":"s3://npm-registry-packages"}},"0.6.9":{"name":"neotraverse","version":"0.6.9","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.9","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/puruvj/neotraverse","bugs":{"url":"https://github.com/puruvj/neotraverse/issues"},"dist":{"shasum":"b1a122b8895015d6355a4619df05fa922c6614fe","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.9.tgz","fileCount":13,"integrity":"sha512-IJ00Agk9rMj4ChQwT/nWhLG/vC7PgNAk+BEKOE0DU5ToOHrmv3wefk8+2TcPDb4TRTQNpq0TIaDlaqvmrTAbrw==","signatures":[{"sig":"MEYCIQCZQmfjG8vAdJfLzKg/e0o/4v6IFL+aOO8sTgqcgPxd7wIhAKDT3/TgymLeYs2Xdc3Y0DHsGSdnDwRriZhYQCM8BAV2","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":69438},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"node":"./dist/legacy/legacy.cjs","types":"./dist/legacy.d.ts","import":"./dist/legacy/legacy.mjs","default":"./dist/legacy/index.cjs"},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/min/index.js"},"./package.json":"./package.json"},"gitHead":"8047eb4331e2e707a669b3741d465ef086c9b32e","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/puruvj/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.9_1720874779132_0.4617495365386566","host":"s3://npm-registry-packages"}},"0.6.9-next.0":{"name":"neotraverse","version":"0.6.9-next.0","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.9-next.0","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"b6d4e04e717da02b3972701117ff27083a474e04","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.9-next.0.tgz","fileCount":13,"integrity":"sha512-Q9ZYOEmlCk5QU1ptYwBXNFYdVcYSeuCn9qz8/acuwnCmHgcjFnf6Y55dmUc/dNCklWT0wZcGqFKHdwgt4eGcRg==","signatures":[{"sig":"MEYCIQDnu7mS5TivX49rhGGbq0fh3OFbMkPapsOrGlMWGEZHcwIhANJGvzbA4BprX28bdKYNAGHr0f3o1zT4L6lM8Y2U5yqD","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":69452},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"node":"./dist/legacy/legacy.cjs","types":"./dist/legacy/legacy.d.ts","import":"./dist/legacy/legacy.mjs","default":"./dist/legacy/index.cjs"},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/min/index.js"},"./package.json":"./package.json"},"gitHead":"7ddd5df387596513a5ae49b10ff0493a0f037e62","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"readmeFilename":"README.md","devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.9-next.0_1721083396281_0.7976119034152434","host":"s3://npm-registry-packages"}},"0.6.10":{"name":"neotraverse","version":"0.6.10","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.10","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"8098a173faea19c5545c2341edea5952578cc30d","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.10.tgz","fileCount":13,"integrity":"sha512-+NM43c4KFNK5lI9ieU+uCdXxQiVp2XD8rW1+4z6QogDotRfMpElebgD7tsNu7Xqp+lTmwhQQPm1hIoDyUtHzfA==","signatures":[{"sig":"MEQCIEwirs2wWFmKF8ntqpQ31qP2PF7Jl86jDDUD4MDBGTnqAiBCncD37YZO5UBmKcN1oBVDPt/KruDBtDHTZCk7HwzqzA==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":103784},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/index.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/modern/index.js"},"./package.json":"./package.json"},"gitHead":"7d053ee67d78ea88965a271e9b4eaf480293c3f1","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.10_1721086991421_0.29184730364909695","host":"s3://npm-registry-packages"}},"0.6.11":{"name":"neotraverse","version":"0.6.11","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.11","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"160658d54e6224023d3335b147d2b01bd8d19a58","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.11.tgz","fileCount":13,"integrity":"sha512-OdydhNAkoRxXyxz1d8Cx2rQS0wfTcoSlBNIuv/PMC/0CrwTYUBMy+kIa7h3y18lVyvgARazb4ugVZ5n/aly2PA==","signatures":[{"sig":"MEUCIB6lPM6ZsITod7QqklpdxCoUcdbiPnRUp8svjslt3rRuAiEA3cbcdFVoP9oS3yEr5EQWmurbhysUDq4sSJrb2awkhrI=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":103297},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/modern/modern.js"},"./package.json":"./package.json"},"gitHead":"d34fbb8b96309002a2a80d9245f2c45aac1c928d","scripts":{"test":"vitest run","compile":"tsup"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.11_1721108876700_0.24926188813733363","host":"s3://npm-registry-packages"}},"0.6.12":{"name":"neotraverse","version":"0.6.12","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.12","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"eca4bca88a735e94150285524f93fd3834363026","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.12.tgz","fileCount":14,"integrity":"sha512-2+SB0CsPOjEs6f6PZ7ysDKANjn/jLPfJq65QWMQbEDPQWj/S/BzPkePhCDQRU5mmVquIl7FUt88DaCKGjfbZ3g==","signatures":[{"sig":"MEUCIHzmQQPJSX4uDTH/a16v/14alILz3P7myoKsIgw4Bf4aAiEAhuK0ou7gfSPcV29f3703Ywtu+iAsv23ya1RPPA0DFdQ=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":128443},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/modern/modern.js"},"./package.json":"./package.json"},"gitHead":"105c1add121063030ddbb618f0944122b2120cec","scripts":{"test":"vitest run","compile":"tsup && cp dist/legacy/legacy.cjs legacy.js"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.12_1721455027562_0.256773364931004","host":"s3://npm-registry-packages"}},"0.6.13":{"name":"neotraverse","version":"0.6.13","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.13","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"578042c508528b825df52751aadea3d5d58d6c57","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.13.tgz","fileCount":15,"integrity":"sha512-xpoemvyynsk/d/sHSq5psi5swYHMFyNOlsK4e1MBkx3ll9j4O6HLhExF90/72Wid52D6cqGmIVE96V3gw44s0Q==","signatures":[{"sig":"MEYCIQDbhdMoYBhW8utuA0zLb81uBRWWTJGDB+bDMckKGyjzKwIhANGypg3VRQse9xLyZJywkXg0NM0UG1ertg7KDpy/286k","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":139839},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/modern/modern.js"},"./package.json":"./package.json"},"gitHead":"d8ca3263447c0c64abf48ab4e2da1bb4f26f9d19","scripts":{"test":"vitest run","compile":"tsup && cp dist/legacy/legacy.cjs legacy.js && cp dist/legacy/legacy.d.cts legacy.d.ts"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.13_1721472189138_0.14417409135318504","host":"s3://npm-registry-packages"}},"0.6.14":{"name":"neotraverse","version":"0.6.14","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.14","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"67584525a67895cdb8f30830a2aca451315283a6","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.14.tgz","fileCount":15,"integrity":"sha512-co+mqQYo1wf3CRWRHWOT1ZgG7gsdNZSrrQkWxVnGAlD/UA/IZuPlE9UNkGZRwTLeml+dT5BytRW4ANqzPQeNLg==","signatures":[{"sig":"MEUCIQDLRR7kBcVPdencsnoPep8B3Kp6m3zhI60ozRvK7StlJQIgZGz2GSHJfQV6EuFTFoJVoe+6jLuNKhYjAyyD3bfJnCs=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":139810},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 18"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/modern/modern.js"},"./package.json":"./package.json"},"gitHead":"e96bb731452638a8dfca967cb04ecd5e84b45be4","scripts":{"test":"vitest run","compile":"tsup && cp dist/legacy/legacy.cjs legacy.js && cp dist/legacy/legacy.d.cts legacy.d.ts"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.14_1721489066383_0.575918578728523","host":"s3://npm-registry-packages"}},"0.6.15":{"name":"neotraverse","version":"0.6.15","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.15","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"dc4abb64700c52440f13bc53635b559862420360","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.15.tgz","fileCount":15,"integrity":"sha512-HZpdkco+JeXq0G+WWpMJ4NsX3pqb5O7eR9uGz3FfoFt+LYzU8iRWp49nJtud6hsDoywM8tIrDo3gjgmOqJA8LA==","signatures":[{"sig":"MEQCIBO/yNj4bD8XMhyxfibQAdfsGLqokAgMK+V7OFOJSxCAAiAYdlJ3UkEY7+dkcsC163ZLiJiwNzXglg3/byal2ZSuqQ==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":139810},"main":"dist/legacy/legacy.cjs","type":"module","types":"dist/index.d.ts","engines":{"node":">= 10"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/modern/modern.js"},"./package.json":"./package.json"},"gitHead":"bdb4f274021b2f3b3216ee9356b99952f589e15c","scripts":{"test":"vitest run","compile":"tsup && cp dist/legacy/legacy.cjs legacy.js && cp dist/legacy/legacy.d.cts legacy.d.ts"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.8.1","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"22.3.0","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.15_1721643703368_0.21793892235306989","host":"s3://npm-registry-packages"}},"0.6.16":{"name":"neotraverse","version":"0.6.16","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.16","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"0828b330fceb84f53f7b4097e6edfa48fc38eac2","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.16.tgz","fileCount":3,"integrity":"sha512-L+krXna1a70tEOSFsbrfT6rQZlIX8Ln6q3eTSZuIXAuPCwRlSO5+yljVXxBaWFUwcVqRuaeItcJ+yBjT5Gb54Q==","signatures":[{"sig":"MEUCIQCLuz6i6Ssz1xLYtmPRcmxvgUJQgNiuT57g/UV4clWmPwIgPlnF/lvlNIcju32NEwqaWqg/mvXNsvzGdY+DesFp1tY=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":14084},"main":"dist/legacy/legacy.cjs","type":"module","_from":"file:neotraverse-0.6.16.tgz","types":"dist/index.d.ts","engines":{"node":">= 10"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/modern/modern.js"},"./package.json":"./package.json"},"scripts":{"pub":"pnpm run compile && npm publish --access public --no-git-checks","test":"vitest run","compile":"tsup && cp dist/legacy/legacy.cjs legacy.js && cp dist/legacy/legacy.d.cts legacy.d.ts","changeset":"changeset","ci:release":"changeset publish","ci:version":"changeset version"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"_resolved":"/tmp/1ac88a556e396a7c314dabae4dbac869/neotraverse-0.6.16.tgz","_integrity":"sha512-L+krXna1a70tEOSFsbrfT6rQZlIX8Ln6q3eTSZuIXAuPCwRlSO5+yljVXxBaWFUwcVqRuaeItcJ+yBjT5Gb54Q==","repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.7.0","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"18.20.4","_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10","@changesets/cli":"^2.27.7"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.16_1723218832505_0.25629089710747777","host":"s3://npm-registry-packages"}},"0.6.17":{"name":"neotraverse","version":"0.6.17","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.17","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"5cf33b3619a233dbc7a539e49a3b960dbdc47fa1","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.17.tgz","fileCount":3,"integrity":"sha512-ElUg5iDI8rMW3yt3wlKXV+RtDigwJ0kvFFpmLlK5QOxteVPqm7S+tsno+Jk1WDTeHrF/iSX5FhuPncQd+MtpIg==","signatures":[{"sig":"MEUCIQCLPcBau2qwllDFP1tCIazkc8di/6dajvL+srPKnjlcqgIgCJWdg8qAwmMi9v5Ozws4H1R3v+2GGsWIiNrAPJfqPiw=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"attestations":{"url":"https://registry.npmjs.org/-/npm/v1/attestations/neotraverse@0.6.17","provenance":{"predicateType":"https://slsa.dev/provenance/v1"}},"unpackedSize":14133},"main":"dist/legacy/legacy.cjs","type":"module","_from":"file:neotraverse-0.6.17.tgz","types":"dist/index.d.ts","engines":{"node":">= 10"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/modern/modern.js"},"./package.json":"./package.json"},"scripts":{"pub":"pnpm run compile && npm publish --access public --no-git-checks","test":"vitest run","compile":"tsup && cp dist/legacy/legacy.cjs legacy.js && cp dist/legacy/legacy.d.cts legacy.d.ts","changeset":"changeset","ci:release":"changeset publish","ci:version":"changeset version"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"_resolved":"/tmp/1512e02189800409e47fb6ca063b258f/neotraverse-0.6.17.tgz","_integrity":"sha512-ElUg5iDI8rMW3yt3wlKXV+RtDigwJ0kvFFpmLlK5QOxteVPqm7S+tsno+Jk1WDTeHrF/iSX5FhuPncQd+MtpIg==","repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.7.0","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"18.20.4","publishConfig":{"provenance":true},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10","@changesets/cli":"^2.27.7"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.17_1723218997628_0.7597904435777587","host":"s3://npm-registry-packages"}},"0.6.18":{"name":"neotraverse","version":"0.6.18","keywords":["traverse","walk","recursive","map","forEach","deep","clone"],"author":{"name":"Puru Vijay, James Halliday"},"license":"MIT","_id":"neotraverse@0.6.18","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://github.com/PuruVJ/neotraverse","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"abcb33dda2e8e713cf6321b29405e822230cdb30","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-0.6.18.tgz","fileCount":15,"integrity":"sha512-Z4SmBUweYa09+o6pG+eASabEpP6QkQ70yHj351pQoEXIs8uHbaU2DWVmzBANKgflPa47A50PtB2+NgRpQvr7vA==","signatures":[{"sig":"MEYCIQDwlDWenoJrcpqR0V36/U9ABASvBAD3iRnO7DIBxJf2rgIhANDiRDZjnY/YdQOrAHCfQ6pKAkkyvizblxxKJoymuU2U","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"attestations":{"url":"https://registry.npmjs.org/-/npm/v1/attestations/neotraverse@0.6.18","provenance":{"predicateType":"https://slsa.dev/provenance/v1"}},"unpackedSize":140237},"main":"dist/legacy/legacy.cjs","type":"module","_from":"file:neotraverse-0.6.18.tgz","types":"dist/index.d.ts","engines":{"node":">= 10"},"exports":{".":{"types":"./dist/index.d.ts","import":{"default":"./dist/index.js","production":"./dist/min/index.js","development":"./dist/index.js"},"default":"./dist/min/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern/modern.d.ts","import":{"default":"./dist/modern/modern.js","production":"./dist/modern/min/modern.js","development":"./dist/modern/modern.js"},"default":"./dist/modern/modern.js"},"./package.json":"./package.json"},"scripts":{"pub":"pnpm run compile && npm publish --access public --no-git-checks","test":"vitest run","compile":"tsup && cp dist/legacy/legacy.cjs legacy.js && cp dist/legacy/legacy.d.cts legacy.d.ts","changeset":"changeset","ci:release":"changeset publish","ci:version":"changeset version"},"_npmUser":{"name":"puruvj","email":"awesomepuruvj@gmail.com"},"_resolved":"/tmp/ad2fe18adc5c9acc4d12cec2e76ed378/neotraverse-0.6.18.tgz","_integrity":"sha512-Z4SmBUweYa09+o6pG+eASabEpP6QkQ70yHj351pQoEXIs8uHbaU2DWVmzBANKgflPa47A50PtB2+NgRpQvr7vA==","repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git"},"_npmVersion":"10.7.0","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"_nodeVersion":"18.20.4","publishConfig":{"provenance":true},"_hasShrinkwrap":false,"devDependencies":{"tsup":"^8.1.0","terser":"^5.31.2","vitest":"^2.0.1","@swc/core":"^1.6.13","typescript":"^5.5.3","@types/node":"^20.14.10","@changesets/cli":"^2.27.7"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_0.6.18_1723222199071_0.19372791368361297","host":"s3://npm-registry-packages"}},"1.0.0":{"name":"neotraverse","version":"1.0.0","keywords":["clone","deep","forEach","map","recursive","traverse","walk"],"author":{"url":"https://puruvj.dev","name":"Puru Vijay"},"license":"MIT","_id":"neotraverse@1.0.0","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"homepage":"https://neotraverse.puruvj.dev","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"dist":{"shasum":"36a3a3679f4bba8c4d7ff9ef5c902436e86d084f","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-1.0.0.tgz","fileCount":17,"integrity":"sha512-DxwuwBj4rEIc3p2ffVjN9ACIvhgzhGwEv4PMXA/7jA74H3P9jyIQ1GzdfbEf7kuqJ230vQMl5gBAi/FcqmtClA==","signatures":[{"sig":"MEQCIEBvvPn8uwCGdWHf0iV0XR6vCr0F+VrUfOgKZ2xpfnV5AiAnBZIf+C/24PGDwdwURKPApHgVAFrMacBOvQeo05Q57Q==","keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U"}],"attestations":{"url":"https://registry.npmjs.org/-/npm/v1/attestations/neotraverse@1.0.0","provenance":{"predicateType":"https://slsa.dev/provenance/v1"}},"unpackedSize":235947},"main":"dist/legacy/legacy.cjs","type":"module","_from":"file:neotraverse-1.0.0.tgz","types":"dist/index.d.ts","engines":{"node":">= 10"},"exports":{".":{"types":"./dist/index.d.ts","default":"./dist/index.js"},"./safe":{"types":"./dist/safe/index.d.ts","default":"./dist/safe/index.js"},"./legacy":{"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs","require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"}},"./modern":{"types":"./dist/modern.d.ts","default":"./dist/modern.js"},"./package.json":"./package.json"},"scripts":{"test":"vp test","bench":"pnpm compile && node --expose-gc --max-semi-space-size=128 --import tsx bench/run.ts","compile":"vp pack","test:cov":"vp test --coverage","typecheck":"tsc --noEmit","bench:safe":"pnpm compile && node --expose-gc --max-semi-space-size=128 --import tsx bench/run-safe.ts","test:types":"vp test --typecheck","bundle-size":"node scripts/measure-bundle.mjs","bench:safe-memory":"pnpm compile && node --expose-gc --max-semi-space-size=128 --import tsx bench/safe-memory.ts"},"_npmUser":{"name":"GitHub Actions","email":"npm-oidc-no-reply@github.com","trustedPublisher":{"id":"github","oidcConfigId":"oidc:28099fa2-8d35-46c3-85b7-f811316800e8"}},"_resolved":"/tmp/4570aa560edc068c9221dd4380573481/neotraverse-1.0.0.tgz","_integrity":"sha512-DxwuwBj4rEIc3p2ffVjN9ACIvhgzhGwEv4PMXA/7jA74H3P9jyIQ1GzdfbEf7kuqJ230vQMl5gBAi/FcqmtClA==","repository":{"url":"git+https://github.com/PuruVJ/neotraverse.git","type":"git","directory":"packages/neotraverse"},"_npmVersion":"11.16.0","description":"traverse and transform objects by visiting every node on a recursive walk","directories":{},"sideEffects":false,"_nodeVersion":"24.16.0","publishConfig":{"provenance":true},"_hasShrinkwrap":false,"devDependencies":{"tsx":"^4.22.4","traverse":"^0.6.11","tinybench":"^6.0.2","typescript":"^6.0.3","@types/node":"^25.9.1"},"_npmOperationalInternal":{"tmp":"tmp/neotraverse_1.0.0_1781183049782_0.8120753904377778","host":"s3://npm-registry-packages-npm-production"}},"1.0.1":{"name":"neotraverse","version":"1.0.1","description":"traverse and transform objects by visiting every node on a recursive walk","keywords":["clone","deep","forEach","map","recursive","traverse","walk"],"homepage":"https://neotraverse.puruvj.dev","license":"MIT","author":{"name":"Puru Vijay","url":"https://puruvj.dev"},"repository":{"type":"git","url":"git+https://github.com/PuruVJ/neotraverse.git","directory":"packages/neotraverse"},"type":"module","sideEffects":false,"main":"dist/legacy/legacy.cjs","types":"dist/index.d.ts","exports":{".":{"types":"./dist/index.d.ts","default":"./dist/index.js"},"./modern":{"types":"./dist/modern.d.ts","default":"./dist/modern.js"},"./safe":{"types":"./dist/safe/index.d.ts","default":"./dist/safe/index.js"},"./legacy":{"require":{"types":"./dist/legacy/legacy.d.cts","default":"./dist/legacy/legacy.cjs"},"import":{"types":"./dist/legacy/legacy.d.ts","default":"./dist/legacy/legacy.mjs"},"default":"./dist/legacy/legacy.cjs"},"./package.json":"./package.json"},"publishConfig":{"provenance":true},"devDependencies":{"@types/node":"^25.9.1","tinybench":"^6.0.2","traverse":"^0.6.11","tsx":"^4.22.4","typescript":"^6.0.3"},"engines":{"node":">= 10"},"scripts":{"compile":"vp pack","test":"vp test","test:cov":"vp test --coverage","bench":"pnpm compile && node --expose-gc --max-semi-space-size=128 --import tsx bench/run.ts","bench:safe":"pnpm compile && node --expose-gc --max-semi-space-size=128 --import tsx bench/run-safe.ts","bench:safe-memory":"pnpm compile && node --expose-gc --max-semi-space-size=128 --import tsx bench/safe-memory.ts","typecheck":"tsc --noEmit","test:types":"vp test --typecheck","bundle-size":"node scripts/measure-bundle.mjs"},"_id":"neotraverse@1.0.1","bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"_integrity":"sha512-WmmLty1YWwJl9yZi77v2dVIV6X2kuYV8YYBI/G3LWGKdGHmHUvL1z7FW0iDvEvGAwNEoc5x1tOOOyDnf5jJw/w==","_resolved":"/tmp/1db1ddd55b7462dcc11365be6de91f4d/neotraverse-1.0.1.tgz","_from":"file:neotraverse-1.0.1.tgz","_nodeVersion":"24.16.0","_npmVersion":"11.16.0","dist":{"integrity":"sha512-WmmLty1YWwJl9yZi77v2dVIV6X2kuYV8YYBI/G3LWGKdGHmHUvL1z7FW0iDvEvGAwNEoc5x1tOOOyDnf5jJw/w==","shasum":"7c89b43f6504ef85928c718f578c68621576d194","tarball":"https://registry.npmjs.org/neotraverse/-/neotraverse-1.0.1.tgz","fileCount":17,"unpackedSize":238391,"attestations":{"url":"https://registry.npmjs.org/-/npm/v1/attestations/neotraverse@1.0.1","provenance":{"predicateType":"https://slsa.dev/provenance/v1"}},"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEICH24IU+EoNeEnqXoBlyVz86kFWDuxJPWG6CTy1ABOWMICHyfsU+9RFu5hgLpYtpJTfZBnVX/vsWy/Zx61sXx9vd0="}]},"_npmUser":{"name":"GitHub Actions","email":"npm-oidc-no-reply@github.com","trustedPublisher":{"id":"github","oidcConfigId":"oidc:28099fa2-8d35-46c3-85b7-f811316800e8"}},"directories":{},"maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/neotraverse_1.0.1_1781186669105_0.6188715567115068"},"_hasShrinkwrap":false}},"time":{"created":"2024-07-10T20:29:10.411Z","modified":"2026-06-11T14:04:29.495Z","0.0.1":"2024-07-10T20:29:10.595Z","0.0.2":"2024-07-10T21:10:56.937Z","0.0.3":"2024-07-11T08:56:51.558Z","0.0.5":"2024-07-11T09:18:55.606Z","0.6.8":"2024-07-11T12:13:35.769Z","0.6.8-test.1":"2024-07-13T12:39:53.517Z","0.6.9-test.1":"2024-07-13T12:40:02.063Z","0.6.9":"2024-07-13T12:46:19.274Z","0.6.9-next.0":"2024-07-15T22:43:16.481Z","0.6.10":"2024-07-15T23:43:11.606Z","0.6.11":"2024-07-16T05:47:56.955Z","0.6.12":"2024-07-20T05:57:07.732Z","0.6.13":"2024-07-20T10:43:09.341Z","0.6.14":"2024-07-20T15:24:26.542Z","0.6.15":"2024-07-22T10:21:43.572Z","0.6.16":"2024-08-09T15:53:52.766Z","0.6.17":"2024-08-09T15:56:37.777Z","0.6.18":"2024-08-09T16:49:59.256Z","1.0.0":"2026-06-11T13:04:09.927Z","1.0.1":"2026-06-11T14:04:29.252Z"},"bugs":{"url":"https://github.com/PuruVJ/neotraverse/issues"},"author":{"name":"Puru Vijay","url":"https://puruvj.dev"},"license":"MIT","homepage":"https://neotraverse.puruvj.dev","keywords":["clone","deep","forEach","map","recursive","traverse","walk"],"repository":{"type":"git","url":"git+https://github.com/PuruVJ/neotraverse.git","directory":"packages/neotraverse"},"description":"traverse and transform objects by visiting every node on a recursive walk","maintainers":[{"name":"puruvj","email":"awesomepuruvj@gmail.com"}],"readme":"# neotraverse\n\nTraverse and transform objects by visiting every node on a recursive walk. A TypeScript rewrite of [`traverse`](https://github.com/ljharb/js-traverse) with **0 dependencies**, **prototype-pollution hardening**, **~5× the throughput** and **~6× less allocation** with the functional API (up to **~10×** / **~11×** peaks on core walks).\n\n> 📖 **Full docs, security audit & live benchmarks:** **[neotraverse.puruvj.dev](https://neotraverse.puruvj.dev)**\n\n**Utility-first:** the default export is named functions (`sideEffects: false`), pay for what you use, not a monolithic class.\n\n- 🤌 **~2–6 KB brotli** (tree-shaken; ~2 KB for one walk like `forEach`, ~5.8 KB for every helper)\n- 🚥 Zero dependencies, no polyfills\n- 🎹 TypeScript: throw away `@types/traverse`\n- 🛡️ Safe on untrusted input ([prototype-pollution & injection hardened](#security))\n- ⚡ **~5× faster** and **~6× leaner** than `traverse` with the functional API (up to **~10×** / **~11×**); **~3×** speed and **~2×** less memory on the legacy drop-in build\n- 🛸 ESM-first, with a legacy ES2015 CJS/ESM build\n- 🛟 **[`neotraverse/safe`](#neotraversesafe):** an opt-in, stack-safe iterative core that walks **200,000-deep** trees recursion can't, with a lazy `visit` iterator and copy-on-write `transform` (Node 22+)\n\n## Benchmarks (summary)\n\nGeometric-mean speedup versus the original `traverse` across the full operation × shape matrix:\n\n| Build                               | Speedup vs `traverse`                                               | Allocation vs `traverse` (core walks)               |\n| ----------------------------------- | ------------------------------------------------------------------- | --------------------------------------------------- |\n| **neotraverse modern** (functional) | **≈ 4.9×** (full matrix) · **≈ 5.6×** (core walks) · **up to ~10×** | **≈ 5.7× less** · **up to ~11×** (`forEach · wide`) |\n| **neotraverse legacy** (drop-in)    | **≈ 3×**                                                            | **≈ 2× less**                                       |\n\nCore traversal ops (`forEach` / `map` / `clone` / `reduce` / `paths` / `nodes`) on the **functional** build land at **~3–10×** throughput and **~6× less heap** on average vs `traverse` (peaks: `clone · small` **~9.9×** speed, `forEach · wide` **~11×** memory). See the [full table](#benchmarks-full) or the [interactive benchmarks page](https://neotraverse.puruvj.dev/benchmarks). Reproduce with `pnpm bench`.\n\n## Install\n\n```sh\nnpm install neotraverse\n```\n\n## Bundle size (tree-shaken, brotli)\n\nMeasured with esbuild + brotli from published ESM ([`bench/bundle-sizes.json`](./bench/bundle-sizes.json); `pnpm bundle-size`):\n\n| Import                                                  | Brotli          |\n| ------------------------------------------------------- | --------------- |\n| One walk terminal (`forEach`, `map`, `find`, `size`, …) | **~2 KB**       |\n| Path only (`get` / `has` / `set` or `getPath`)          | **~0.3–0.5 KB** |\n| Every functional helper                                 | **~5.8 KB**     |\n\n## Quick start\n\n```ts\n// the default export: tree-shakeable functions, `ctx` argument (recommended)\nimport { forEach } from 'neotraverse';\n\nforEach({ a: 1, b: 2, c: [3, 4] }, (ctx, x) => {\n  if (typeof x === 'number') ctx.update(x * 10);\n});\n```\n\n```ts\n// classic `traverse`-compatible API (drop-in for the original `traverse`)\nimport traverse from 'neotraverse/legacy';\n\ntraverse({ a: 1, b: 2, c: [3, 4] }).forEach(function (x) {\n  if (typeof x === 'number') this.update(x * 10);\n});\n```\n\n```ts\n// the deprecated 0.x `Traverse` class lives here, removed in v2\nimport { Traverse } from 'neotraverse/modern';\n```\n\n## `neotraverse/safe`\n\nA second, opt-in entry point for input that is **deep, untrusted, huge, or only partially consumed**. The default `neotraverse` walk is recursive (fast, but it overflows the call stack on deep enough input). `neotraverse/safe` runs on an **iterative** engine, so it traverses arbitrarily deep trees that crash a recursive walker (measured: the default overflows past **~2,000** levels; `/safe` handles **200,000+**). It is also lazy and copy-on-write.\n\n```ts\nimport { visit, transform } from 'neotraverse/safe';\n\n// lazy iteration: stop early, never materialize the rest\nconst first5 = visit(huge)\n  .filter((v) => typeof v.value === 'string')\n  .take(5)\n  .toArray();\n\n// copy-on-write: shares untouched subtrees, returns the input by identity on a no-op\nconst redacted = transform(doc, {\n  '**.{password,token}': (v, { replace }) => replace('***')\n});\n```\n\nIt ships a twelve-export surface: `visit`, `transform` / `transformAsync`, `get` / `set` / `has`, `clone`, `equal`, `merge`, `diff`, `patch`, `resolveRefs`.\n\n**The honest trade-off:** on a full eager scan `/safe` runs at roughly **0.8×** the default (still ~4× faster than `traverse`), and materializing a whole tree costs a little more memory. It wins on **stack safety**, on **early-exit memory** (~6× less peak on a `filter().take()` chain), and on **copy-on-write** edits. Requires **Node 22+** / evergreen browsers (it uses native ES2025 iterator helpers). See the [`/safe` guide](https://neotraverse.puruvj.dev/guide/safe).\n\n## Builds & browser support\n\n| Build       | Import               | Contents                           | Module    | Target | Browsers                                      |\n| ----------- | -------------------- | ---------------------------------- | --------- | ------ | --------------------------------------------- |\n| **default** | `neotraverse`        | functional API (recommended)       | ESM       | ES2022 | Chrome/Edge 94+, Firefox 93+, Safari 15+      |\n| **safe**    | `neotraverse/safe`   | stack-safe iterative core (opt-in) | ESM       | ES2024 | Node 22+, evergreen browsers                  |\n| **modern**  | `neotraverse/modern` | deprecated `Traverse` class only   | ESM       | ES2022 | Chrome/Edge 94+, Firefox 93+, Safari 15+      |\n| **legacy**  | `neotraverse/legacy` | classic `traverse` drop-in         | CJS + ESM | ES2015 | Chrome 51+, Firefox 54+, Safari 10+, Edge 15+ |\n\n> ⚠️ **1.0 breaking changes:** the default export (`neotraverse`) is now the functional API, not the classic `traverse` default. Move classic drop-in imports to `neotraverse/legacy`, and `import { Traverse }` to `neotraverse/modern`. The legacy build also targets **ES2015** (was ES5); only environments needing literal ES5 (e.g. IE11) are affected.\n\n## Security\n\n`neotraverse` is safe to run on **untrusted data**:\n\n- **No prototype pollution:** `set(path, value)` refuses `__proto__` / `constructor` / `prototype` keys.\n- **No prototype injection:** `clone()` / `map()` of hostile JSON like `{\"__proto__\":{\"isAdmin\":true}}` keep their real prototype; `result.isAdmin` is `undefined`.\n- **Prototype preservation intact:** legitimate `instanceof` still works after a clone.\n- **No prototype-chain disclosure:** `get()` / `has()` follow only own properties.\n\n```ts\nimport { clone } from 'neotraverse';\n\nconst evil = JSON.parse('{\"user\":\"bob\",\"__proto__\":{\"isAdmin\":true}}');\nclone(evil).isAdmin; // undefined\n({}).isAdmin; // undefined, global prototype untouched\n```\n\nRead the full story in the [**1.0 release post**](https://puruvj.dev/blog/neotraverse-1-0).\n\n### DoS guard\n\nBound recursion on deeply-nested hostile input with `maxDepth` (throws a catchable `RangeError`; unlimited by default):\n\n```ts\nclone(untrusted, { maxDepth: 1000 });\n```\n\n> The hardening and DoS guards apply to the **functional** API. The `neotraverse/legacy` drop-in is intentionally kept behaviour-compatible with the original `traverse` and does **not** receive them — run untrusted data through the functional API.\n\n## Migrating from `traverse`\n\n**[Differences from traverse](https://neotraverse.puruvj.dev/guide/vs-traverse):** drop-in vs functional, what's new, which build to use.\n\n```diff\n-import traverse from 'traverse';\n+import traverse from 'neotraverse/legacy';\n```\n\n```sh\nnpm install neotraverse && npm uninstall traverse @types/traverse\n```\n\nThe legacy API is identical to `traverse`. For new code, prefer the functional default export.\n\n## API\n\n**Functional (`neotraverse`, recommended):** `forEach`, `map`, `clone`, `reduce`, `find`, `filter`, `some`, `every`, `paths`, `nodes`, `get`, `set`, `has`, `entries`, `values`, `walk`, `breadthFirst`, `mapBfs`, `forEachAsync`, `mapAsync`, plus `findPaths`, `filterPaths`, `getPath`, `setPath`, `hasPath`, `parsePath`, `parseDotPath`, `parseJsonPointer`, `pointerPath`, `parseGlob`, `count`, `size`, `getType`, `groupBy`, `skipWhere`, `deleteWhere`, `prune`, `pruneDeep`, `sanitize`, `deepEqual`, `merge`, `dereference`, `toJSON`, `freeze`, `diff`, `patch`, `select`. Options are always the last argument.\n\n**Deprecated class (`neotraverse/modern`):** the `Traverse` class (`.get`/`.has`/`.set`/`.map`/`.forEach`/`.reduce`/`.paths`/`.nodes`/`.clone`) is deprecated and **removed in v2** — use the functions above.\n\n**Classic (`neotraverse/legacy`):** `.map(fn)` · `.forEach(fn)` · `.reduce(fn, acc)` · `.paths()` · `.nodes()` · `.clone()` · `.get(path)` · `.set(path, value)` · `.has(path)` on a traversal instance (`this`-bound context).\n\nOptions: `{ immutable?, includeSymbols?, maxDepth?, signal? }` (`signal` is async-only on modern).\n\nEach callback gets a context (`ctx` in modern, `this` in classic) with `node`, `path`, `parent`, `key`, `isRoot`, `isLeaf`, `isFirst`, `isLast`, `level`, `circular`, and the mutators `update()`, `remove()`, `delete()`, `before()`, `after()`, `pre()`, `post()`, `stop()`, `block()`.\n\n👉 Full API reference, examples, and context docs: **[neotraverse.puruvj.dev/guide](https://neotraverse.puruvj.dev/guide)**.\n\n## Benchmarks (full) {#benchmarks-full}\n\n`neotraverse` vs `traverse`, ops/sec (and ×speedup). Generated by [`bench/run.ts`](./bench/run.ts) via [tinybench](https://github.com/tinylibs/tinybench); see [`bench/results.json`](./bench/results.json).\n\n| Operation · shape |   traverse | neotraverse legacy | neotraverse modern |\n| ----------------- | ---------: | -----------------: | -----------------: |\n| `forEach · small` |    841,043 |  2,414,704 (2.87×) |  4,016,013 (4.78×) |\n| `forEach · wide`  |     79,308 |    284,208 (3.58×) |    594,241 (7.49×) |\n| `forEach · deep`  |     53,214 |    160,316 (3.01×) |    330,800 (6.22×) |\n| `forEach · array` |      3,019 |     10,186 (3.37×) |     21,242 (7.04×) |\n| `forEach · json`  |     57,421 |    186,579 (3.25×) |    382,143 (6.66×) |\n| `map · small`     |    393,442 |  1,268,242 (3.22×) |  2,267,588 (5.76×) |\n| `map · wide`      |     50,468 |    106,498 (2.11×) |    183,870 (3.64×) |\n| `map · deep`      |     18,833 |     87,198 (4.63×) |    136,623 (7.25×) |\n| `map · array`     |      1,421 |      4,376 (3.08×) |      8,619 (6.07×) |\n| `map · json`      |     23,178 |     83,958 (3.62×) |    151,069 (6.52×) |\n| `clone · small`   |    494,252 |  3,356,979 (6.79×) |  4,884,062 (9.88×) |\n| `clone · wide`    |    209,591 |    309,111 (1.47×) |    574,325 (2.74×) |\n| `clone · deep`    |     27,853 |    170,807 (6.13×) |    260,473 (9.35×) |\n| `clone · array`   |      3,250 |     11,408 (3.51×) |     15,411 (4.74×) |\n| `clone · json`    |     42,207 |    205,740 (4.87×) |    303,054 (7.18×) |\n| `reduce · small`  |    796,994 |  2,201,209 (2.76×) |  3,536,758 (4.44×) |\n| `reduce · wide`   |     75,627 |    260,493 (3.44×) |    489,665 (6.47×) |\n| `reduce · deep`   |     50,668 |    145,498 (2.87×) |     288,933 (5.7×) |\n| `reduce · array`  |      2,909 |      9,229 (3.17×) |     17,781 (6.11×) |\n| `reduce · json`   |     55,255 |    173,837 (3.15×) |    328,782 (5.95×) |\n| `paths · small`   |    811,923 |  2,279,936 (2.81×) |  3,402,905 (4.19×) |\n| `paths · wide`    |     77,412 |    268,188 (3.46×) |    475,490 (6.14×) |\n| `paths · deep`    |     50,955 |    151,982 (2.98×) |    212,666 (4.17×) |\n| `paths · array`   |      2,976 |      9,566 (3.21×) |      16,368 (5.5×) |\n| `paths · json`    |     56,251 |    177,158 (3.15×) |    294,870 (5.24×) |\n| `nodes · small`   |    800,765 |  2,258,624 (2.82×) |  3,490,623 (4.36×) |\n| `nodes · wide`    |     76,618 |    265,446 (3.46×) |    506,638 (6.61×) |\n| `nodes · deep`    |     51,151 |    149,846 (2.93×) |    288,099 (5.63×) |\n| `nodes · array`   |      2,943 |      9,442 (3.21×) |     17,715 (6.02×) |\n| `nodes · json`    |     55,541 |    176,656 (3.18×) |    328,321 (5.91×) |\n| `get · json`      | 18,069,492 | 22,168,643 (1.23×) | 21,280,988 (1.18×) |\n| `has · json`      | 18,943,414 | 22,254,349 (1.17×) | 22,156,236 (1.17×) |\n| `set · json`      | 23,632,276 | 23,862,298 (1.01×) | 19,365,527 (0.82×) |\n\n> `get` / `has` / `set` are micro-ops (20M+ ops/s); all three builds are within noise of each other and of `traverse`. The legacy class stores its state in plain instance fields (not `#private`, which would downlevel to WeakMaps at ES2015), so these stay native-fast on the drop-in too.\n\n## License\n\n[MIT](./LICENSE), [Puru Vijay](https://puruvj.dev).\n","readmeFilename":"README.md"}