{"_id":"flat-tree","_rev":"23-e00b755f302577eebfbdfda503c8c471","name":"flat-tree","dist-tags":{"latest":"1.13.0"},"versions":{"1.0.0":{"name":"flat-tree","version":"1.0.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.0.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"38e3187415bd7cdc7454918d432d5443268d3238","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.0.0.tgz","integrity":"sha512-vrLJX6JOl8lhYz+U3Y/nO9xN0LBPK2lxhX5aVNyNhjjqwCw9w8N1KcR3syAmttYxNJF7im3PsWt3VbmR8zR7sQ==","signatures":[{"sig":"MEQCIC9WEXE2o8m/6T5PFq62fgJI6Gez6yq/hXUvSOAA/iIrAiBzWj9q1fhzWKddLkcamPvC7J3Amj1vRRTKypOguCmFnw==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"38e3187415bd7cdc7454918d432d5443268d3238","gitHead":"7e64bc820bf6d5e17880a05b02a7c0e0ed2454d3","scripts":{"test":"tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"2.11.0","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"2.2.1","dependencies":{},"devDependencies":{"tape":"^4.0.0"}},"1.0.1":{"name":"flat-tree","version":"1.0.1","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.0.1","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"832ff288dde03c873abc82557464e70d4d6cba7a","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.0.1.tgz","integrity":"sha512-S0HPnXFm9fF6tbOTF0cVGMr9hBJ+81KwyqF0fcNIJ51Wt1HALapb/K5q6X7TsZ5aoVGniO81OL2NAsJBsCFZrw==","signatures":[{"sig":"MEUCIBjuhcoy1DlTagQqipSF3rHFU1FPiihhhipOgcfpURm2AiEA9KZgaWOIgVxnmh/YB4ALWq6p6XcYJmQdJrscQp3qfyY=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"832ff288dde03c873abc82557464e70d4d6cba7a","gitHead":"6dbc402fbfa6aa282613fff610a3edd5fa523d78","scripts":{"test":"tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"2.11.0","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"2.2.1","dependencies":{},"devDependencies":{"tape":"^4.0.0"}},"1.1.0":{"name":"flat-tree","version":"1.1.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.1.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"736f33fc8eef242ad6c9e6cef09e2ab8a239357f","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.1.0.tgz","integrity":"sha512-OTgZTOALvB/+N8IarMAxRHe7LpeZZsrm7ufXTAHWXQR//AR5WNHpJk1UBrId6LY6Ug/DkStVk0pTdsOQ2z5Ckg==","signatures":[{"sig":"MEUCIDNQhxZ44OPbWHmR5HzcfDJWHE7PLdTYUpKpQdfo5xtRAiEArHyFmte7K7EcOFAGLaDUGQ8rJzs4JoMMWw+dZZY4Jxo=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"736f33fc8eef242ad6c9e6cef09e2ab8a239357f","gitHead":"5b6ba65c81cd423554d4e3cb7625f7a7182d8938","scripts":{"test":"tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"2.11.3","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"0.12.7","dependencies":{},"devDependencies":{"tape":"^4.0.0"}},"1.1.1":{"name":"flat-tree","version":"1.1.1","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.1.1","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"0d66520669cefc5e4d3b3b8f28828dc5643cabc2","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.1.1.tgz","integrity":"sha512-irBg0iBtmYjSIsif5SAkJWZgE5B9oSD3gA5v1tVZOu8e+FOJVQcS37Kw+C/q5uNZx4H5MTWRz6f75x5+wSiZjA==","signatures":[{"sig":"MEQCIAtW2II/ukBl8H72TkxHXyx1db9ZtbpyfHZLPGLex7pHAiAypoRcCQQ7j39vhHxC48cW0h5iIsM80vILap0VXC3fjw==","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"0d66520669cefc5e4d3b3b8f28828dc5643cabc2","gitHead":"178886478029c4c3eba77b92abd235bdde55281f","scripts":{"test":"tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"2.13.2","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"2.5.0","dependencies":{},"devDependencies":{"tape":"^4.0.0"}},"1.2.0":{"name":"flat-tree","version":"1.2.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.2.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"fda72047d114e38d894b8f876244fbc3c0994242","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.2.0.tgz","integrity":"sha512-WHNzsrGgoyvh5jMfbcKmx0erFU/AZH+lY/xl3fsvQvzkXonzq9TLeUlSakRKjMH9/1DAulNS/Ztn+VLBaraDug==","signatures":[{"sig":"MEUCIQCvEWWZwOZ68SZMg/B9VWtJl1jwkn42ITxjMIGbEkTOUwIgZwGt8/z3hjgjDMhITefizGRkzP2Fqma1F14SkcPzqKU=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"fda72047d114e38d894b8f876244fbc3c0994242","gitHead":"0a308065943547d0c3d85dfd8661ffe0329b32c5","scripts":{"test":"tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"2.13.2","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"2.5.0","dependencies":{},"devDependencies":{"tape":"^4.0.0"}},"1.2.1":{"name":"flat-tree","version":"1.2.1","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.2.1","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"2893700246b8a2f5d3ccdf356f4e8978b403f068","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.2.1.tgz","integrity":"sha512-Dd65GVQwNgPNUkFj6kIOlOxjLR9Os0Xqn0uGEj5Strn4X+wtNSAqJnc3O5jQt7g9Hqiftrfdyy4flNFxZEUEsA==","signatures":[{"sig":"MEUCIQCTL1eEfSwtb0hFwCC46dFbACEiufLXU0lS7SAztwAPqAIgB6xze2rwjxOQKBdYe8Tf7+iuZLBK4lyNvhGvvZo72L8=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"2893700246b8a2f5d3ccdf356f4e8978b403f068","gitHead":"6d001ee45d87ea864d8b2fa7e0310e6fbc822d70","scripts":{"test":"tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"2.14.4","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"4.1.1","dependencies":{},"devDependencies":{"tape":"^4.0.0"}},"1.3.0":{"name":"flat-tree","version":"1.3.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.3.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"90d755dc7fa9570cdfc2b7fa8c51d4efe85293ec","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.3.0.tgz","integrity":"sha512-gwkCyvTR2njqsxr9+HBpQf+UEyRIOjZn2cqL1w9SrOdTQ/7r6wV88RogoWwIm/w6rQSd0N2MCHfZQBIWOKOKpA==","signatures":[{"sig":"MEUCIQDXOPzgf5nWsZFOdfHFMbPR7+WSQPm8xoRkAQutvNaomwIgNyKZvF1LRvXuaRKqm+Qyz2RQ6nAjnDAusz3Z4QUh38E=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"90d755dc7fa9570cdfc2b7fa8c51d4efe85293ec","gitHead":"0c787e6affbd185385cf4af3ea2db05fe9ee1ccd","scripts":{"test":"tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"2.14.7","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"4.2.2","dependencies":{},"devDependencies":{"tape":"^4.0.0"}},"1.4.0":{"name":"flat-tree","version":"1.4.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.4.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"d976551e829b50f42a5213c913ccf9d81935181d","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.4.0.tgz","integrity":"sha512-rEDTk90PKCcj37+e2dDUYaasFA4PJ+8j//7PhelApHj12sBVThAZqcHNOALLeoPVjmkeXC9uX6GnAnXMS+bWHw==","signatures":[{"sig":"MEUCICVK0v43NI0SD1wH6c7GoT8mT12I46wPCfEjQU2NoV+4AiEAuMIRM689QGPQNHW7ptPc6YTlXvsqLJjXfS5+SbL0AK4=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"d976551e829b50f42a5213c913ccf9d81935181d","gitHead":"ca54a6f05cccbaa240729a38107226cda4dfddf8","scripts":{"test":"tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"2.14.12","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"4.3.1","dependencies":{},"devDependencies":{"tape":"^4.0.0"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree-1.4.0.tgz_1457378219839_0.5223089377395809","host":"packages-12-west.internal.npmjs.com"}},"1.5.0":{"name":"flat-tree","version":"1.5.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.5.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"6dc466174ee593eda4a59564f4bb20e8f3a618e9","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.5.0.tgz","integrity":"sha512-plFbeRWY4mp+xqbE/jdPWpDgt2Y8oiQGOuvuef/6b4xS4yud4LMdCmsE07mL8CB2xXQBZmFKfdGy9I7fCp0KTg==","signatures":[{"sig":"MEUCIDttlmnjr1uFm8a1x4kcmNrWFm+mBb29L50S9RX7c19zAiEAoKb6HL3HtlfKB9KyoGLbzoM3oy2qIhRBu7EOPEngQGs=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"6dc466174ee593eda4a59564f4bb20e8f3a618e9","gitHead":"763f9cdcc1738f4ad396b857057900d1eb89462b","scripts":{"test":"tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"3.10.10","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"6.9.5","dependencies":{},"devDependencies":{"tape":"^4.0.0"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree-1.5.0.tgz_1487736717547_0.7994100879877806","host":"packages-12-west.internal.npmjs.com"}},"1.6.0":{"name":"flat-tree","version":"1.6.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.6.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"fca30cddb9006fb656eb5ebc79aeb274e7fde9ed","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.6.0.tgz","integrity":"sha512-v9AW6GfcRTGHXoM9he4AxhW6kpLBL6F1co38ndkaZwQhF/MFTaFGhIRS1MvijYjE8kBsMbYnpeD1GDiUquKx6A==","signatures":[{"sig":"MEYCIQCw3kwe3BbKJRasY8sSxAo0zG8bRpJJeY5gOCkrNc7NIQIhALxDG22AQbXoNOo0aWIWtGm4/PmB9G7uZV6CowwM9itx","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}]},"main":"index.js","_from":".","_shasum":"fca30cddb9006fb656eb5ebc79aeb274e7fde9ed","gitHead":"351d19b9f99ff00fbc7caff651c17ab705c41782","scripts":{"test":"standard && tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"3.10.10","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"6.9.5","dependencies":{},"devDependencies":{"tape":"^4.0.0","standard":"^8.6.0"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree-1.6.0.tgz_1488290433959_0.9538641653489321","host":"packages-12-west.internal.npmjs.com"}},"1.7.0":{"name":"flat-tree","version":"1.7.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.7.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"cb0285428a9d8a64e1beaaf0d2f8fa1527b328ca","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.7.0.tgz","fileCount":6,"integrity":"sha512-dh9Dnlb5NLKDnJEtU6zP57FCDwusVoGhFAq3Uz1p/szjiuSlPdb3A3aoV31v4tlQMb3c8aDEUbqOpi+8DLDy7Q==","signatures":[{"sig":"MEYCIQDug1+4qrcNWdcHMMJ7JE09tSIhxPb/2NeaeZXISpNCkAIhALWsxsCuzRN7ZcALHNX/yNZsoCAPMhb+CmOKdXOTX8Ew","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":14494,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfsoCrCRA9TVsSAnZWagAAj+8P/0WyRJMeAFurdrLz+0L2\n9vmy0qB2UQ0y7fZQV4BsyZELE6OFebtYgBDJDRHutGAwKkiptY1Bb4pjv3xV\nkdKq/PjVqtp+Eb5v3GJUp6qqjalhVesNyA23l6nLI929nlR6yNRER1v2nR35\nG4Zk+5vt/cbwb5JVfMKYz6ZVxNEIAoU1KrSMgPcQilnq/r4i1tuQfQZSonjI\nfpjxfJ3U1BB+UuwDqIWojZ6Wq4/qXxU38eojB5sFMneOHqviqN0Gt08izmY5\nLBL+6z63kyp68ihgy58T/5t5EYnutlMBELuQ2PUAXydf6xMR8dgrlXcKJZwg\nW/cOlCq9/kNqmaeznuXMudhOXAay2t8ehgz/f68+syIAAQum+aW3LVt2fgu7\nQqkLihqZT+S5E32u+b3QLLaIwC+a3IXltyMrA/YDzphckY6n2ekLx+Lfe3N1\nhVgV0LGhXjRcPke1ksC9Aa/sAhXtfeMoD9z53hRoejE0xahOoxfhdhFeK4FW\npOKsRtlI6/tGkYwEizJ36rbqDXD8gApzSQVsnrgNF+rpZNDuIoSQUa2eLNlG\n1Mzvrhu0eO3ELlkqaxBtqEbug7+n4w6qRbwBrcZ5HihZq8FjU9h5cE1dw0ur\nMSHXbD4vU5GLbXHevWYWqvP5sQTrA86uTda+xFpiKsJpgS+EJTjJdxKd6yTN\n0V/c\r\n=sciU\r\n-----END PGP SIGNATURE-----\r\n"},"main":"index.js","gitHead":"0b74c14edcdf771e2639d32763ae3630e0cb9fb3","scripts":{"test":"standard && tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"6.14.8","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"14.15.0","dependencies":{},"_hasShrinkwrap":false,"devDependencies":{"tape":"^5.0.1","standard":"^14.3.4"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree_1.7.0_1605533866830_0.5186592500432505","host":"s3://npm-registry-packages"}},"1.8.0":{"name":"flat-tree","version":"1.8.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.8.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"0c3d4fcdbad92db81432ea253a12b6c612d17fb7","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.8.0.tgz","fileCount":6,"integrity":"sha512-VIdjqvARJGq1V+EhT18prwhrR4McbY2M6iH1vyKTgewfQtpyd1jhLXcnQJFZZDKBhpJM8zCB2kLQEiy51bhcOw==","signatures":[{"sig":"MEUCIGX99x7+bLOqeewpek4EA3Yrgl2Ljz9Psl6zhQ9hLvMnAiEAwZxQBjWxGLqUp5RkexBGlGywloLCjCMGWdLwqLB/Tv4=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":16093,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfyLOlCRA9TVsSAnZWagAA6DoQAISpACo7SR5zHSRjQuhF\nOsPUHahyu0O3OpoDB11jEo6bxTMA2JTVPnmjC6r52lPHINYL1Zq884HInoYp\nklTUwM17NQi5yL8xduMCmj/SVXqQqv3Q/Mo+J6w4pzdp0e4eJjoob0gCLfrO\nrFtc7Y+hMY/sRmK86j69flZdwbi9JWWHP6uf/ybdwNprRSeZWwqqnsbA9+LA\nTeEiA/bR5m9zuAPXUd4XeZTRGPGTW/DHxVpmX6+h1K4X6ym1JrOURe04fc2z\ndjmUCw7vUqN5fISmLJTouvsGYv/nKQbchQODmLMZvsuo8eIBSNpJ69ZidKYc\nxYvOM0dRWqdg8FO+4KEogafA2aB8uhEG+J8/4COZve8vPXFSg/kkwnboLFqC\nuEOVL0Kc6AAPp3GdlcBi3TB/sDg2fdheVRJ+yw0hh834o4GVgLxORUdnKobc\nbIbeyA0ulumPeiMTOjVXfk5Hsn/3PB58WXtmwSYesYMtvyXyRQe/q+DJ+AGm\nAgVo5gZVv3JsUvP/4o3jsjm/vB04h0Jc2kCa1ztYRNofrr+ckNodJRO/7QgS\n8j8MavI/1r5w70RuK3hZL0smYFCRzRALk6a64Wjnb3d8DImZrgmRMDsX9oBK\nbb8Z9ZWZkjtcqmMB7j0TiQJhSQrZRasZQIRuQgFshWKv7ylb4UTo4wwofdMm\n43IT\r\n=B8fd\r\n-----END PGP SIGNATURE-----\r\n"},"main":"index.js","gitHead":"e5e0667ee096485ea557c7dfa112f5c888ac2e31","scripts":{"test":"standard && tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"6.14.8","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"14.15.0","dependencies":{},"_hasShrinkwrap":false,"devDependencies":{"tape":"^5.0.1","standard":"^14.3.4"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree_1.8.0_1606988708497_0.3354731505130675","host":"s3://npm-registry-packages"}},"1.9.0":{"name":"flat-tree","version":"1.9.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.9.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"cdd9e9884b7fd1973a04709b694f75e47ee18b8c","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.9.0.tgz","fileCount":6,"integrity":"sha512-WRu5/q9fcdL9f7L6Ahq8fR153e5Zr5aU6plPHupN6JDWuvEJbMjrEQprge3/I7ytndHC6/GUNg5Rg8XEisuv5w==","signatures":[{"sig":"MEYCIQD3xT4pZP1sMl7WBo+Z3LYEairhJ66iWdP2ChjOMu3kWAIhAPWbIWD6e0b7axdR8oZTDOlZOWCizMMl0DIQkGOPzi21","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":17702,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJh2rMhCRA9TVsSAnZWagAAMWcP/1tCLOeFQnK6bFfm854R\nZ6pf3O82jpYj53/HDWIr3YCZLu0Kv4SR+5HziaYzRbcClIFZVLs16akxs5AC\ntR4thk4ovXq8pLdQSmDu3DcKkp6AZVS/UtHUKSHFt/RikIxJUgzlVc1okURG\nUZzsfdBY47IR/iA+rYo9hDJFBxyo8/2cimu4CBqBo43578lBNw0AH5BS7kGD\nsNK3+Nd3z1BBGDmNKrbfSwT7Hgvf04FohmuGq2CzRtl1hU0zDbgPF4g5xr3T\noygIbxGN5G6V21eytmuYn1lkpKAhFgjPMrE+RJy9h3B1Ram+lzTZnXePEI51\n8ScIphF9A3iqSQu6igSVyL0Bm7vZspVvIv0PrFIi24/8t+1nLt5YlObvya+L\nBaDyRxixVBweIhjgZXCqZ8AMKMXWUSCaCIUcWGO2D6TbekCXgQw+Nf+tKpVL\n4/JL6tPtPBkG2X7wigokjBoAQ9H0E/QTPSIhRI7Z5I9F6UJippwkkyEELOfp\nXNZDDCt1k0R4m74aKVsMO88Dp5DXtA5BYFQplxUW2UbMdojrP28ZfcmORO0/\n0EyhvLxC80kwsbOKeDT/wSlKcdEaW03eH7Ybflr232uIM0nWon2B1Jv2WFzX\nzx5Y13zy1bpwwaezWdiAUwJUBsNMZgJA2rRLhF+mSgvZngVqFNeC3mrCk52t\nURnW\r\n=mZ7x\r\n-----END PGP SIGNATURE-----\r\n"},"main":"index.js","gitHead":"93ce9742c833fcddbbe5c13c99bb6edede813e67","scripts":{"test":"standard && tape test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"6.14.15","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"16.8.0","dependencies":{},"_hasShrinkwrap":false,"devDependencies":{"tape":"^5.0.1","standard":"^14.3.4"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree_1.9.0_1635425974255_0.49269058609951166","host":"s3://npm-registry-packages"}},"1.10.0":{"name":"flat-tree","version":"1.10.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.10.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"9ea4d52593322678f80bd7ff5fdea79c8d48e452","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.10.0.tgz","fileCount":6,"integrity":"sha512-tbazIl4MxtOtkPRKVxripIkd0MTFBMGqEPBw1tV4tdgN8DIf/oMYRS3rkmObFw/b7zmaoWPjAbNDRz5QUgY/Ow==","signatures":[{"sig":"MEUCIGIaYi2JxNbH9iEE7Qlo5AfqQgTCpaC95p2FaEPbTxqpAiEA6CjFAfJmO9M1363yy2d1YpuJ5EH9X+nAhOav6CTXfnY=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":18997},"main":"index.js","gitHead":"6d9f395f9dd811169d592e2775a5308921ce6687","scripts":{"test":"standard && brittle test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"9.8.1","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"18.18.0","dependencies":{},"_hasShrinkwrap":false,"devDependencies":{"brittle":"^3.3.2","standard":"^17.1.0"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree_1.10.0_1699097464443_0.3426848028802809","host":"s3://npm-registry-packages"}},"1.11.0":{"name":"flat-tree","version":"1.11.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.11.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"7eee82036b87056c26ead6161aace42f52862c6e","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.11.0.tgz","fileCount":4,"integrity":"sha512-dO6oawiYBpTROI9RZQ1seCFyNTr5UGnIdk5Ep+h7MbluB8ijnpA+tufJG5AA1hb6HSjhYI8qRo+negHnkBPqVA==","signatures":[{"sig":"MEYCIQDdTrlpDLrBp75XnQ/U3tiQFXo41IjtToCqhSZ1GuPmEwIhAMQn68hKSQszOyclkmbIkdP8w19NTpRXjTAUIdeR5EFd","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":12644},"main":"index.js","gitHead":"4b6560ecf14a74491e31797ef7ac765b24ae7c60","scripts":{"test":"standard && brittle test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"10.7.0","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"20.11.1","dependencies":{},"_hasShrinkwrap":false,"devDependencies":{"brittle":"^3.3.2","standard":"^17.1.0"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree_1.11.0_1721138638148_0.44198421168962376","host":"s3://npm-registry-packages"}},"1.12.0":{"name":"flat-tree","version":"1.12.0","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.12.0","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"aa17046ba2023abaace474ffe60a4b8016eb884d","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.12.0.tgz","fileCount":4,"integrity":"sha512-hcDXNuIIugsOYPYogrDAvTwrvXw8q1AybTGyPNy+QdA8JWdgcnVceLfWpJIkAmH1itJiDeqjpjvLmnTFF6fi4Q==","signatures":[{"sig":"MEUCIGgqRXC7hK2fznSpfW+SCDTlyCBgPi/U4FS37UXMnNLaAiEA1sGCvcBxck/sV6oD7bXEK0vl0ZxNgsXf8d0xcf86Wgk=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":13432},"main":"index.js","gitHead":"fca7ddc29dcd6f2247108bf4979db731594c91b7","scripts":{"test":"standard && brittle test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"10.7.0","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"20.11.1","dependencies":{},"_hasShrinkwrap":false,"devDependencies":{"brittle":"^3.3.2","standard":"^17.1.0"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree_1.12.0_1729707937109_0.21838113738250775","host":"s3://npm-registry-packages"}},"1.12.1":{"name":"flat-tree","version":"1.12.1","author":{"url":"@mafintosh","name":"Mathias Buus"},"license":"MIT","_id":"flat-tree@1.12.1","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"homepage":"https://github.com/mafintosh/flat-tree","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"dist":{"shasum":"36a1849c94c6e877e9f2c8b9c3bf5129030f9065","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.12.1.tgz","fileCount":4,"integrity":"sha512-GchQ+onbnw5QaqsGbpcV6c8etAd396X/EVdDxutQMkGapB0lRvV9heIXS6ZffQVCse0hm2hBpK7GJz2Zp7qiMg==","signatures":[{"sig":"MEUCIA6OxBzgHg9lFPg+visKt7aWP0R1imApHrVdF52cmB5FAiEA7qjLeVU3/wUmz5qoe5tJXtrEpiDt69m9iGg3AQIoIuY=","keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA"}],"unpackedSize":13524},"main":"index.js","gitHead":"0f02503fb941397cc19ffa82cd3a67e7fe57fe1e","scripts":{"test":"standard && brittle test.js"},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"repository":{"url":"git+https://github.com/mafintosh/flat-tree.git","type":"git"},"_npmVersion":"10.7.0","description":"A series of functions to map a binary tree to a list","directories":{},"_nodeVersion":"20.11.1","dependencies":{},"_hasShrinkwrap":false,"devDependencies":{"brittle":"^3.3.2","standard":"^17.1.0"},"_npmOperationalInternal":{"tmp":"tmp/flat-tree_1.12.1_1730556657345_0.5695110993388994","host":"s3://npm-registry-packages"}},"1.13.0":{"name":"flat-tree","version":"1.13.0","description":"A series of functions to map a binary tree to a list","main":"index.js","dependencies":{},"devDependencies":{"brittle":"^3.3.2","standard":"^17.1.0"},"scripts":{"test":"standard && brittle test.js"},"repository":{"type":"git","url":"git+https://github.com/mafintosh/flat-tree.git"},"author":{"name":"Mathias Buus","url":"@mafintosh"},"license":"MIT","bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"homepage":"https://github.com/mafintosh/flat-tree","_id":"flat-tree@1.13.0","gitHead":"b480dc7768c2b35d2b983439ec314d585dd10098","_nodeVersion":"22.16.0","_npmVersion":"10.9.2","dist":{"integrity":"sha512-fT3HIuCPwHhFgJ20QYzDHgUG0zMmFg5cHvFiFo5h+QMSJ28TihsEVY0f8HGliuO+pOzmvjMx1odToeaEWkTnyQ==","shasum":"31f9135e583af3e7ed849a956c5284ffe33d57db","tarball":"https://registry.npmjs.org/flat-tree/-/flat-tree-1.13.0.tgz","fileCount":4,"unpackedSize":14098,"signatures":[{"keyid":"SHA256:DhQ8wR5APBvFHLF/+Tc+AYvPOdTpcIDqOhxsBHRwC7U","sig":"MEUCIQDcoyc52NhBGBpd4Zexp9QOORlQ1qooi/Yw/ZxC4OAaYwIgTpro6W4K0B3DpF9CeuxXtr3cLQr2LUV+9XWMoP9z5Gg="}]},"_npmUser":{"name":"mafintosh","email":"mathiasbuus@gmail.com"},"directories":{},"maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages-npm-production","tmp":"tmp/flat-tree_1.13.0_1757687826315_0.7096065226003923"},"_hasShrinkwrap":false}},"time":{"created":"2015-06-15T23:37:33.261Z","modified":"2025-09-12T14:37:06.666Z","1.0.0":"2015-06-15T23:37:33.261Z","1.0.1":"2015-06-15T23:43:07.469Z","1.1.0":"2015-07-21T08:36:27.906Z","1.1.1":"2015-09-05T11:16:46.208Z","1.2.0":"2015-09-20T18:51:00.678Z","1.2.1":"2015-10-07T12:44:30.507Z","1.3.0":"2015-11-30T08:21:25.602Z","1.4.0":"2016-03-07T19:17:01.886Z","1.5.0":"2017-02-22T04:11:59.522Z","1.6.0":"2017-02-28T14:00:35.567Z","1.7.0":"2020-11-16T13:37:46.950Z","1.8.0":"2020-12-03T09:45:08.698Z","1.9.0":"2021-10-28T12:59:34.369Z","1.10.0":"2023-11-04T11:31:04.670Z","1.11.0":"2024-07-16T14:03:58.292Z","1.12.0":"2024-10-23T18:25:37.381Z","1.12.1":"2024-11-02T14:10:57.519Z","1.13.0":"2025-09-12T14:37:06.485Z"},"bugs":{"url":"https://github.com/mafintosh/flat-tree/issues"},"author":{"name":"Mathias Buus","url":"@mafintosh"},"license":"MIT","homepage":"https://github.com/mafintosh/flat-tree","repository":{"type":"git","url":"git+https://github.com/mafintosh/flat-tree.git"},"description":"A series of functions to map a binary tree to a list","maintainers":[{"name":"mafintosh","email":"mathiasbuus@gmail.com"}],"readme":"# flat-tree\n\nA series of functions to map a binary tree to a list\n\n```\nnpm install flat-tree\n```\n\n## Usage\n\nYou can represent a binary tree in a simple flat list using the following structure\n\n```\n      3\n  1       5\n0   2   4   6  ...\n```\n\nThis module exposes a series of functions to help you build and maintain this data structure\n\n``` js\nvar tree = require('flat-tree')\nvar list = []\n\nvar i = tree.index(0, 0) // get array index for depth: 0, offset: 0\nvar j = tree.index(1, 0) // get array index for depth: 1, offset: 0\n\n// use these indexes to store some data\n\nlist[i] = 'a'\nlist[j] = 'b'\nlist[tree.parent(i)] = 'parent of a and b'\n```\n\n## API\n\n#### `index = tree.index(depth, offset)`\n\nReturns an array index for the tree element at the given depth and offset.\n\n#### `parentIndex = tree.parent(index)`\n\nReturns the index of the parent element in tree.\n\n#### `siblingIndex = tree.sibling(index)`\n\nReturns the index of this elements sibling.\n\n#### `children = tree.children(index)`\n\nReturns an array `[leftChild, rightChild]` with the indexes of this elements children.\nIf this element does not have any children it returns `null`.\n\n#### `range = tree.spans(index)`\n\nReturns the range (inclusive) the tree root at `index` spans.\nFor example `tree.spans(3)` would return `[0, 6]` (see the usage example).\n\n#### `index = tree.leftSpan(index)`\n\nReturns the left spanning in index in the tree `index` spans.\n\n#### `index = tree.rightSpan(index)`\n\nReturns the right spanning in index in the tree `index` spans.\n\n#### `count = tree.count(index)`\n\nReturns how many nodes (including parent nodes) a tree contains.\n\n#### `count = tree.countLeaves(index)`\n\nReturns how many nodes (excluding parent nodes) a tree contains.\n\n#### `depth = tree.depth(index)`\n\nReturns the depth of an element.\n\n#### `offset = tree.offset(index, [depth])`\n\nReturns the relative offset of an element.\n\n#### `roots = tree.fullRoots(index)`\n\nReturns a list of all the full roots (subtrees where all nodes have either 2 or 0 children) `<` index.\nFor example `fullRoots(8)` returns `[3]` since the subtree rooted at `3` spans `0 -> 6` and the tree\nrooted at `7` has a child located at `9` which is `>= 8`.\n\n#### `iterator = tree.iterator(index)`\n\nCreate a stateful tree iterator starting at a given index.\nThe iterator exposes the following methods.\n\n#### `index = iterator.next()`\n\nMove the iterator the next item in the tree.\n\n#### `index = iterator.prev()`\n\nMove the iterator the prev item in the tree.\n\n#### `iterator.seek(index)`\n\nMove the iterator the this specific tree index.\n\n#### `index = iterator.parent()`\n\nMove the iterator to the current parent index.\n\n#### `index = iterator.leftChild()`\n\nMove the iterator to the current left child index.\n\n#### `index = iterator.rightChild()`\n\nMove the iterator to the current right child index.\n\n#### `index = iterator.leftSpan()`\n\nMove the iterator to the current left span index.\n\n#### `index = iterator.rightSpan()`\n\nMove the iterator to the current right span index.\n\n#### `bool = iterator.isLeft()`\n\nIs the iterator at a left sibling?\n\n#### `bool = iterator.isRight()`\n\nIs the iterator at a right sibling?\n\n#### `index = iterator.sibling()`\n\nMove the iterator to the current sibling.\n\n#### `count = iterator.count()`\n\nReturns how many nodes (including parent nodes) the current tree contains.\n\n#### `count = iterator.countLeaves()`\n\nReturns how many nodes (excluding parent nodes) the current tree contains.\n\n## See also\n\n- [mafintosh/print-flat-tree][print]: A cli that can pretty print flat-trees.\n- [bcomnes/flattree][ftg]: A port of the node module to Go.\n- [arablocks/flat-tree.c](c): A port of the module to C\n- [datkt/flat-tree][kt]: A port of the module to Kotlin\n- [datrs/flat-tree][rs]: A port to Rust.\n- [bcomnes/flattree][ftg]: A port to Go.\n- [noffle/cl-flat-tree][clft]: A port to Common Lisp.\n- [dukeraphaelng/flat_tree][cr]: A port to Crystal.\n\n## License\n\nMIT\n\n[print]: https://github.com/mafintosh/print-flat-tree\n[rs]: https://github.com/datrs/flat-tree\n[ftg]: https://github.com/bcomnes/flattree\n[c]: https://github.com/arablocks/flat-tree.c\n[kt]: https://github.com/datkt/flat-tree\n[clft]: https://github.com/noffle/cl-flat-tree\n[cr]: https://github.com/dukeraphaelng/flat_tree\n","readmeFilename":"README.md"}