{"_id":"performant-array-to-tree","_rev":"4240451","name":"performant-array-to-tree","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","dist-tags":{"latest":"1.11.0"},"maintainers":[{"name":"philipstanislaus","email":""}],"time":{"modified":"2026-03-25T23:16:54.000Z","created":"2017-05-07T15:52:15.523Z","1.11.0":"2022-02-17T15:09:47.188Z","1.10.0":"2022-02-17T13:07:02.845Z","1.9.2":"2022-02-17T13:03:16.874Z","1.9.1":"2021-05-31T13:58:26.212Z","1.9.0":"2021-05-21T05:55:42.127Z","1.8.2":"2021-05-10T09:11:46.823Z","1.8.1":"2021-02-02T23:22:58.341Z","1.7.1":"2020-03-09T13:26:56.148Z","1.7.0":"2020-02-11T11:53:45.119Z","1.6.0":"2020-02-10T14:08:42.624Z","1.5.0":"2020-01-20T15:57:35.285Z","1.4.0":"2020-01-20T15:45:13.530Z","1.3.0":"2020-01-20T15:39:22.447Z","1.2.0":"2019-09-03T15:44:44.344Z","1.1.4":"2019-07-14T05:21:26.247Z","1.1.3":"2019-06-17T10:35:24.044Z","1.1.2":"2017-10-10T12:50:51.951Z","1.1.1":"2017-10-10T12:49:24.828Z","1.1.0":"2017-09-18T08:48:44.588Z","1.0.4":"2017-09-18T08:45:13.038Z","1.0.3":"2017-06-13T06:33:34.943Z","1.0.2":"2017-05-07T16:49:16.944Z","1.0.1":"2017-05-07T16:14:04.120Z","1.0.0":"2017-05-07T15:52:15.523Z"},"users":{},"author":{"name":"Philip Stanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"versions":{"1.11.0":{"name":"performant-array-to-tree","version":"1.11.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^9.1.0","chai":"^4.1.2","codecov":"^3.8.1","mocha":"^9.2.0","nyc":"^15.1.0","prettier":"^2.2.1","ts-mocha":"^9.0.2","tslint":"^6.1.3","tslint-config-prettier":"^1.18.0","typescript":"^4.1.3","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run format && npm run lint-fix && npm run build && npm run test","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","format":"yarn prettier --write .","lint":"tslint --project tsconfig.json './src/**/*.ts'","lint-fix":"tslint --project tsconfig.json './src/**/*.ts' --fix","test":"ts-mocha src/**/*.spec.ts --timeout 10000","test-coverage":"nyc npm test && codecov","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"ae56091b76de0065949bdf228096010e8c0117f7","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.11.0","_nodeVersion":"15.14.0","_npmVersion":"7.7.6","dist":{"shasum":"cbb6c4a1a41a89b3a209dca7a8715cbe7d5a6a33","size":11879,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.11.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.11.0.tgz"},"_npmUser":{"name":"philipstanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"directories":{},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.11.0_1645110587064_0.669406767315454"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2022-02-17T15:09:55.011Z","publish_time":1645110587188,"_cnpm_publish_time":1645110587188},"1.10.0":{"name":"performant-array-to-tree","version":"1.10.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^9.1.0","chai":"^4.1.2","codecov":"^3.8.1","mocha":"^9.2.0","nyc":"^15.1.0","prettier":"^2.2.1","ts-mocha":"^9.0.2","tslint":"^6.1.3","tslint-config-prettier":"^1.18.0","typescript":"^4.1.3","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run format && npm run lint-fix && npm run build && npm run test","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","format":"yarn prettier --write .","lint":"tslint --project tsconfig.json './src/**/*.ts'","lint-fix":"tslint --project tsconfig.json './src/**/*.ts' --fix","test":"ts-mocha src/**/*.spec.ts --timeout 10000","test-coverage":"nyc npm test && codecov","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"c2ae68b0acda850e2636e80d1f7372408f8314a7","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.10.0","_nodeVersion":"15.14.0","_npmVersion":"7.7.6","dist":{"shasum":"00b507dc0a14aa72195fb9843d863daaeafe2b45","size":11067,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.10.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.10.0.tgz"},"_npmUser":{"name":"philipstanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"directories":{},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.10.0_1645103222604_0.3680206272717206"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2022-02-17T13:07:06.122Z","publish_time":1645103222845,"_cnpm_publish_time":1645103222845},"1.9.2":{"name":"performant-array-to-tree","version":"1.9.2","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^9.1.0","chai":"^4.1.2","codecov":"^3.8.1","mocha":"^9.2.0","nyc":"^15.1.0","prettier":"^2.2.1","ts-mocha":"^9.0.2","tslint":"^6.1.3","tslint-config-prettier":"^1.18.0","typescript":"^4.1.3","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run format && npm run lint-fix && npm run build && npm run test","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","format":"yarn prettier --write .","lint":"tslint --project tsconfig.json './src/**/*.ts'","lint-fix":"tslint --project tsconfig.json './src/**/*.ts' --fix","test":"ts-mocha src/**/*.spec.ts --timeout 10000","test-coverage":"nyc npm test && codecov","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"1ab9bc4cf0b9ee181996318dfc706e80234f01d2","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.9.2","_nodeVersion":"15.14.0","_npmVersion":"7.7.6","dist":{"shasum":"4670cf4eb8bbfe636e3c1f4d1033e67864ca5d65","size":9948,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.9.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.9.2.tgz"},"_npmUser":{"name":"philipstanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"directories":{},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.9.2_1645102996644_0.43279993136139794"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2022-02-17T13:03:20.519Z","publish_time":1645102996874,"_cnpm_publish_time":1645102996874},"1.9.1":{"name":"performant-array-to-tree","version":"1.9.1","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^8.2.0","chai":"^4.1.2","codecov":"^3.8.1","mocha":"^8.2.1","nyc":"^15.1.0","prettier":"^2.2.1","ts-mocha":"^8.0.0","tslint":"^6.1.3","tslint-config-prettier":"^1.18.0","typescript":"^4.1.3","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run format && npm run lint-fix && npm run build && npm run test","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","format":"yarn prettier --write .","lint":"tslint --project tsconfig.json './src/**/*.ts'","lint-fix":"tslint --project tsconfig.json './src/**/*.ts' --fix","test":"ts-mocha src/**/*.spec.ts --timeout 10000","test-coverage":"nyc npm test && codecov","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"efe07a8694e74a7dd114149961e2baa4db0c4397","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.9.1","_nodeVersion":"15.5.0","_npmVersion":"7.3.0","dist":{"shasum":"24897a56dedaa00c1f9c1a7e7ba92103008d1059","size":9925,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.9.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.9.1.tgz"},"_npmUser":{"name":"philipstanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"directories":{},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.9.1_1622469506040_0.39703290950442294"},"_hasShrinkwrap":false,"publish_time":1622469506212,"_cnpm_publish_time":1622469506212,"_cnpmcore_publish_time":"2021-12-16T16:03:21.565Z"},"1.9.0":{"name":"performant-array-to-tree","version":"1.9.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^8.2.0","chai":"^4.1.2","codecov":"^3.8.1","mocha":"^8.2.1","nyc":"^15.1.0","prettier":"^2.2.1","ts-mocha":"^8.0.0","tslint":"^6.1.3","tslint-config-prettier":"^1.18.0","typescript":"^4.1.3","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run format && npm run lint-fix && npm run build && npm run test","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","format":"yarn prettier --write .","lint":"tslint --project tsconfig.json './src/**/*.ts'","lint-fix":"tslint --project tsconfig.json './src/**/*.ts' --fix","test":"ts-mocha src/**/*.spec.ts --timeout 10000","test-coverage":"nyc npm test && codecov","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"9a1f2d2e3423a2bd763a0e41601ab91f6d889adf","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.9.0","_nodeVersion":"15.5.0","_npmVersion":"7.3.0","dist":{"shasum":"864b51ad42aa7f2d79985c8fc563aeca81e2cbc5","size":9935,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.9.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.9.0.tgz"},"_npmUser":{"name":"philipstanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"directories":{},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.9.0_1621576542019_0.4918151495580443"},"_hasShrinkwrap":false,"publish_time":1621576542127,"_cnpm_publish_time":1621576542127,"_cnpmcore_publish_time":"2021-12-16T16:03:21.915Z"},"1.8.2":{"name":"performant-array-to-tree","version":"1.8.2","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^8.2.0","chai":"^4.1.2","codecov":"^3.8.1","mocha":"^8.2.1","nyc":"^15.1.0","prettier":"^2.2.1","ts-mocha":"^8.0.0","tslint":"^6.1.3","tslint-config-prettier":"^1.18.0","typescript":"^4.1.3","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run format && npm run lint-fix && npm run build && npm run test","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","format":"yarn prettier --write .","lint":"tslint --project tsconfig.json './src/**/*.ts'","lint-fix":"tslint --project tsconfig.json './src/**/*.ts' --fix","test":"ts-mocha src/**/*.spec.ts --timeout 10000","test-coverage":"nyc npm test && codecov","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"594f4d1c40d6e4e92918794d682ac8e6f2cb32ae","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.8.2","_nodeVersion":"15.5.0","_npmVersion":"7.3.0","dist":{"shasum":"e96307d6a5341d52db7300c71b35947a478095e4","size":9517,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.8.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.8.2.tgz"},"_npmUser":{"name":"philipstanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"directories":{},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.8.2_1620637906656_0.3746574581815987"},"_hasShrinkwrap":false,"publish_time":1620637906823,"_cnpm_publish_time":1620637906823,"_cnpmcore_publish_time":"2021-12-16T16:03:22.395Z"},"1.8.1":{"name":"performant-array-to-tree","version":"1.8.1","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^8.2.0","chai":"^4.1.2","codecov":"^3.8.1","mocha":"^8.2.1","nyc":"^15.1.0","prettier":"^2.2.1","ts-mocha":"^8.0.0","tslint":"^6.1.3","tslint-config-prettier":"^1.18.0","typescript":"^4.1.3","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run format && npm run lint-fix && npm run build && npm run test","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","format":"yarn prettier --write .","lint":"tslint --project tsconfig.json './src/**/*.ts'","lint-fix":"tslint --project tsconfig.json './src/**/*.ts' --fix","test":"ts-mocha src/**/*.spec.ts --timeout 10000","test-coverage":"nyc npm test && codecov","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"_id":"performant-array-to-tree@1.8.1","dist":{"shasum":"9748cccc0db7f068e5cd4df86a04fe0ee3428176","size":19113,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.8.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.8.1.tgz"},"_npmUser":{"name":"philipstanislaus","email":"6912756+philipstanislaus@users.noreply.github.com"},"directories":{},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.8.1_1612308178151_0.8155802105533723"},"_hasShrinkwrap":false,"publish_time":1612308178341,"_cnpm_publish_time":1612308178341,"_cnpmcore_publish_time":"2021-12-16T16:03:22.718Z"},"1.7.1":{"name":"performant-array-to-tree","version":"1.7.1","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^5.2.7","chai":"^4.1.2","coveralls":"^3.0.9","istanbul":"^0.4.5","mocha":"^7.0.0","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.13.0","tslint":"^5.20.1","tslint-config-standard":"^9.0.0","typescript":"^3.7.5","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"f8773dc3ede140ad439131a43e62a40fadc6ef1e","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.7.1","_nodeVersion":"12.6.0","_npmVersion":"6.9.0","dist":{"shasum":"15c90257b4c9f07e232ded8dd60252bcfd7a149a","size":7682,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.7.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.7.1.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.7.1_1583760415956_0.37301716167987786"},"_hasShrinkwrap":false,"publish_time":1583760416148,"_cnpm_publish_time":1583760416148,"_cnpmcore_publish_time":"2021-12-16T16:03:22.925Z"},"1.7.0":{"name":"performant-array-to-tree","version":"1.7.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^5.2.7","chai":"^4.1.2","coveralls":"^3.0.9","istanbul":"^0.4.5","mocha":"^7.0.0","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.13.0","tslint":"^5.20.1","tslint-config-standard":"^9.0.0","typescript":"^3.7.5","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"ad29b9c7e8ec7f0358e7bd3e27733e819b78f761","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.7.0","_nodeVersion":"12.6.0","_npmVersion":"6.9.0","dist":{"shasum":"2af347c70ded17527bf22ecab998ff804c0f6372","size":7488,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.7.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.7.0.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.7.0_1581422025004_0.7683595477323975"},"_hasShrinkwrap":false,"publish_time":1581422025119,"_cnpm_publish_time":1581422025119,"_cnpmcore_publish_time":"2021-12-16T16:03:23.142Z"},"1.6.0":{"name":"performant-array-to-tree","version":"1.6.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.2.7","@types/mocha":"^5.2.7","chai":"^4.1.2","coveralls":"^3.0.9","istanbul":"^0.4.5","mocha":"^7.0.0","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.13.0","tslint":"^5.20.1","tslint-config-standard":"^9.0.0","typescript":"^3.7.5","uglify-js":"^3.7.5"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"2b2216c693906522a45f6f1be5eadbbc63361433","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.6.0","_nodeVersion":"12.6.0","_npmVersion":"6.9.0","dist":{"shasum":"ed495c464f63e1a58d9d227effe4f41be5145b2c","size":6548,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.6.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.6.0.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.6.0_1581343722515_0.7481613296599046"},"_hasShrinkwrap":false,"publish_time":1581343722624,"_cnpm_publish_time":1581343722624,"_cnpmcore_publish_time":"2021-12-16T16:03:23.440Z"},"1.5.0":{"name":"performant-array-to-tree","version":"1.5.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^5.2.7","chai":"^4.1.2","coveralls":"^3.0.0","istanbul":"^0.4.5","mocha":"^6.1.4","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.13.0","tslint":"^5.2.0","tslint-config-standard":"^8.0.1","typescript":"^3.5.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"ae0f4f1ec5944d5ec0ee83ada055fc1171eaebbb","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.5.0","_nodeVersion":"12.6.0","_npmVersion":"6.9.0","dist":{"shasum":"309572d7e90cf350611c69dd9f6c00174f471ea9","size":6431,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.5.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.5.0.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.5.0_1579535855179_0.5748085547648178"},"_hasShrinkwrap":false,"publish_time":1579535855285,"_cnpm_publish_time":1579535855285,"_cnpmcore_publish_time":"2021-12-16T16:03:23.691Z"},"1.4.0":{"name":"performant-array-to-tree","version":"1.4.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^5.2.7","chai":"^4.1.2","coveralls":"^3.0.0","istanbul":"^0.4.5","mocha":"^6.1.4","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.13.0","tslint":"^5.2.0","tslint-config-standard":"^8.0.1","typescript":"^3.5.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"bc0a30a4f89acf0b4230a04c18e36895e75a4ab0","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.4.0","_nodeVersion":"12.6.0","_npmVersion":"6.9.0","dist":{"shasum":"a6385c0e4ca7a7850e418856d5eac3b525f21e54","size":6254,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.4.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.4.0.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.4.0_1579535113426_0.22405467157189096"},"_hasShrinkwrap":false,"publish_time":1579535113530,"_cnpm_publish_time":1579535113530,"_cnpmcore_publish_time":"2021-12-16T16:03:23.931Z"},"1.3.0":{"name":"performant-array-to-tree","version":"1.3.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^5.2.7","chai":"^4.1.2","coveralls":"^3.0.0","istanbul":"^0.4.5","mocha":"^6.1.4","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.13.0","tslint":"^5.2.0","tslint-config-standard":"^8.0.1","typescript":"^3.5.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"9c4247f18e08cd809678ffdbb38670b859f219b9","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.3.0","_nodeVersion":"12.6.0","_npmVersion":"6.9.0","dist":{"shasum":"15a06c171e1362a4c515a47f1c7a1112202ef9e0","size":6104,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.3.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.3.0.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.3.0_1579534762345_0.5394409372363991"},"_hasShrinkwrap":false,"publish_time":1579534762447,"_cnpm_publish_time":1579534762447,"_cnpmcore_publish_time":"2021-12-16T16:03:24.196Z"},"1.2.0":{"name":"performant-array-to-tree","version":"1.2.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","keywords":["array to tree","list to tree","unflatten","array-helper","array-manipulations","data-structures","datastructures","algorithms","tree-structure","array","list","collection","pointer","parent","children","child","tree","navigation","nested","util","traverse","descendants","ancestors"],"main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^5.2.7","chai":"^4.1.2","coveralls":"^3.0.0","istanbul":"^0.4.5","mocha":"^6.1.4","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.13.0","tslint":"^5.2.0","tslint-config-standard":"^8.0.1","typescript":"^3.5.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"ab807e8cf087be6952aa546a004a1187105d2cd1","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.2.0","_nodeVersion":"12.6.0","_npmVersion":"6.9.0","dist":{"shasum":"3b5171ac88a33f0767bc234958dcb8ca4441562b","size":22520,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.2.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.2.0.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.2.0_1567525484202_0.16034729792468339"},"_hasShrinkwrap":false,"publish_time":1567525484344,"_cnpm_publish_time":1567525484344,"_cnpmcore_publish_time":"2021-12-16T16:03:24.419Z"},"1.1.4":{"name":"performant-array-to-tree","version":"1.1.4","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^5.2.7","chai":"^4.1.2","coveralls":"^3.0.0","istanbul":"^0.4.5","mocha":"^6.1.4","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.13.0","tslint":"^5.2.0","tslint-config-standard":"^8.0.1","typescript":"^3.5.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"aecee0c72c21b57acd931fe38d9c0f2453a9b40b","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.1.4","_nodeVersion":"10.11.0","_npmVersion":"6.9.0","dist":{"shasum":"bc8f11e3fe203f656262e1f240590e9120d5834f","size":5586,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.1.4.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.1.4.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.1.4_1563081686108_0.4567993485888988"},"_hasShrinkwrap":false,"publish_time":1563081686247,"_cnpm_publish_time":1563081686247,"_cnpmcore_publish_time":"2021-12-16T16:03:24.622Z"},"1.1.3":{"name":"performant-array-to-tree","version":"1.1.3","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^5.2.7","chai":"^4.1.2","coveralls":"^3.0.0","istanbul":"^0.4.5","mocha":"^6.1.4","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.13.0","tslint":"^5.2.0","tslint-config-standard":"^8.0.1","typescript":"^3.5.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"fe91fafd419b6a24e6fed32c360529b399e64752","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.1.3","_npmVersion":"6.4.1","_nodeVersion":"10.11.0","_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"dist":{"shasum":"3f2401418d7a390e8dfef9358144baf20b8bb451","size":20076,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.1.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.1.3.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree_1.1.3_1560767723934_0.6918464882705055"},"_hasShrinkwrap":false,"publish_time":1560767724044,"_cnpm_publish_time":1560767724044,"_cnpmcore_publish_time":"2021-12-16T16:03:24.865Z"},"1.1.2":{"name":"performant-array-to-tree","version":"1.1.2","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^2.2.41","chai":"^4.1.2","coveralls":"^3.0.0","istanbul":"^0.4.5","mocha":"^4.0.1","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.9.5","tslint":"^5.2.0","tslint-config-standard":"^6.0.1","typescript":"^2.3.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"f500bbd6ed2f1b7ae0087716ebaa744855e5eb32","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.1.2","_npmVersion":"5.3.0","_nodeVersion":"8.5.0","_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"dist":{"shasum":"90e05ed41655d67e0cf623f0e117d419433f9d7d","size":20081,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.1.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.1.2.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree-1.1.2.tgz_1507639850829_0.5507672191597521"},"directories":{},"publish_time":1507639851951,"_hasShrinkwrap":false,"_cnpm_publish_time":1507639851951,"_cnpmcore_publish_time":"2021-12-16T16:03:25.269Z"},"1.1.1":{"name":"performant-array-to-tree","version":"1.1.1","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^2.2.41","chai":"^4.1.2","coveralls":"^3.0.0","istanbul":"^0.4.5","mocha":"^4.0.1","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.9.5","tslint":"^5.2.0","tslint-config-standard":"^6.0.1","typescript":"^2.3.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"04c49c9bdec70438df1d7c147d29ac57dcd2e2b6","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.1.1","_npmVersion":"5.3.0","_nodeVersion":"8.5.0","_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"dist":{"shasum":"79fae61b4682ef662589e2a39c5ac51a21f8ca14","size":20082,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.1.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.1.1.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree-1.1.1.tgz_1507639763763_0.32988879550248384"},"directories":{},"publish_time":1507639764828,"_hasShrinkwrap":false,"_cnpm_publish_time":1507639764828,"_cnpmcore_publish_time":"2021-12-16T16:03:25.687Z"},"1.1.0":{"name":"performant-array-to-tree","version":"1.1.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^2.2.41","chai":"^4.1.2","coveralls":"^2.13.1","istanbul":"^0.4.5","mocha":"^3.3.0","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.9.5","tslint":"^5.2.0","tslint-config-standard":"^6.0.1","typescript":"^2.3.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"e28ab4c3b02a973e89b1ac81c594bab2299e1bc1","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.1.0","_npmVersion":"5.3.0","_nodeVersion":"8.5.0","_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"dist":{"shasum":"38f9b0a3148049379c530449f009246fe72721cf","size":20321,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.1.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.1.0.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree-1.1.0.tgz_1505724523607_0.8724028880242258"},"directories":{},"publish_time":1505724524588,"_hasShrinkwrap":false,"_cnpm_publish_time":1505724524588,"_cnpmcore_publish_time":"2021-12-16T16:03:25.888Z"},"1.0.4":{"name":"performant-array-to-tree","version":"1.0.4","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"repository":{"type":"git","url":"git+https://github.com/philipstanislaus/performant-array-to-tree.git"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^4.0.4","@types/mocha":"^2.2.41","chai":"^4.1.2","coveralls":"^2.13.1","istanbul":"^0.4.5","mocha":"^3.3.0","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.9.5","tslint":"^5.2.0","tslint-config-standard":"^6.0.1","typescript":"^2.3.2","uglify-js":"^3.1.1"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"9c3627d5883c873fd694ee53c411b1940b60c751","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","_id":"performant-array-to-tree@1.0.4","_npmVersion":"5.3.0","_nodeVersion":"8.5.0","_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"dist":{"shasum":"a7f048410c2e692eb72dba35b87db547849666ae","size":18365,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.0.4.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.0.4.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree-1.0.4.tgz_1505724312017_0.8607358778826892"},"directories":{},"publish_time":1505724313038,"_hasShrinkwrap":false,"_cnpm_publish_time":1505724313038,"_cnpmcore_publish_time":"2021-12-16T16:03:26.489Z"},"1.0.3":{"name":"performant-array-to-tree","version":"1.0.3","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^3.5.2","@types/mocha":"^2.2.41","chai":"^3.5.0","coveralls":"^2.13.1","istanbul":"^0.4.5","mocha":"^3.3.0","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.9.5","tslint":"^5.2.0","tslint-config-standard":"^5.0.2","typescript":"^2.3.2","uglify-js":"^2.8.23"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"9aedc6273d2eae1184006605e37414b68add72c8","_id":"performant-array-to-tree@1.0.3","_shasum":"c41cab1df15c14c097a1b7a9a4efd87bd03d1286","_from":".","_npmVersion":"4.1.2","_nodeVersion":"7.6.0","_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"dist":{"shasum":"c41cab1df15c14c097a1b7a9a4efd87bd03d1286","size":19583,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.0.3.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.0.3.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/performant-array-to-tree-1.0.3.tgz_1497335613828_0.4847382279112935"},"directories":{},"publish_time":1497335614943,"_hasShrinkwrap":false,"_cnpm_publish_time":1497335614943,"_cnpmcore_publish_time":"2021-12-16T16:03:26.747Z"},"1.0.2":{"name":"performant-array-to-tree","version":"1.0.2","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^3.5.2","@types/mocha":"^2.2.41","chai":"^3.5.0","coveralls":"^2.13.1","istanbul":"^0.4.5","mocha":"^3.3.0","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.9.5","tslint":"^5.2.0","tslint-config-standard":"^5.0.2","typescript":"^2.3.2","uglify-js":"^2.8.23"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"20426936ed19a67830b6bdb5a8e5ba7a06591c82","_id":"performant-array-to-tree@1.0.2","_shasum":"2549306352790029489fc08d899c22f1cb16c8d5","_from":".","_npmVersion":"4.1.2","_nodeVersion":"7.6.0","_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"dist":{"shasum":"2549306352790029489fc08d899c22f1cb16c8d5","size":19628,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.0.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.0.2.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"packages-18-east.internal.npmjs.com","tmp":"tmp/performant-array-to-tree-1.0.2.tgz_1494175755027_0.2356862653978169"},"directories":{},"publish_time":1494175756944,"_hasShrinkwrap":false,"_cnpm_publish_time":1494175756944,"_cnpmcore_publish_time":"2021-12-16T16:03:27.051Z"},"1.0.1":{"name":"performant-array-to-tree","version":"1.0.1","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","types":"build/arrayToTree.d.ts","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^3.5.2","@types/mocha":"^2.2.41","chai":"^3.5.0","coveralls":"^2.13.1","istanbul":"^0.4.5","mocha":"^3.3.0","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.9.5","tslint":"^5.2.0","tslint-config-standard":"^5.0.2","typescript":"^2.3.2","uglify-js":"^2.8.23"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"98b53c3b84e9338e8f6c60b1f846b6392b9991ee","_id":"performant-array-to-tree@1.0.1","_shasum":"b11d8674fde899d556abff6fca7f7f27be25f191","_from":".","_npmVersion":"4.1.2","_nodeVersion":"7.6.0","_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"dist":{"shasum":"b11d8674fde899d556abff6fca7f7f27be25f191","size":19621,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.0.1.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.0.1.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/performant-array-to-tree-1.0.1.tgz_1494173642230_0.30512487469241023"},"directories":{},"publish_time":1494173644120,"_hasShrinkwrap":false,"_cnpm_publish_time":1494173644120,"_cnpmcore_publish_time":"2021-12-16T16:03:27.501Z"},"1.0.0":{"name":"performant-array-to-tree","version":"1.0.0","description":"Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.","main":"build/arrayToTree.min.js","author":{"name":"Philip Stanislaus","email":"stanislaus.philip@gmail.com"},"license":"MIT","dependencies":{},"devDependencies":{"@types/chai":"^3.5.2","@types/mocha":"^2.2.41","chai":"^3.5.0","coveralls":"^2.13.1","istanbul":"^0.4.5","mocha":"^3.3.0","mocha-lcov-reporter":"^1.3.0","remap-istanbul":"^0.9.5","tslint":"^5.2.0","tslint-config-standard":"^5.0.2","typescript":"^2.3.2","uglify-js":"^2.8.23"},"scripts":{"preversion":"yarn && npm run lint && npm run build && npm run test-and-send-cov-to-coveralls","version":"git add .","postversion":"git push && git push --tags","build":"rm -rf build && tsc && npm run uglify","lint":"rm -rf build && tslint --type-check --project tsconfig.json './src/**/*.ts'","test-spec":"mocha build/**/*.spec.js -R spec --bail","test-cov":"istanbul cover node_modules/mocha/bin/_mocha -- build/**/*.spec.js -R spec --bail","test-and-send-cov-to-coveralls":"istanbul cover ./node_modules/mocha/bin/_mocha --report lcovonly -- build/**/*.spec.js -R spec --bail && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js","test-remap":"remap-istanbul -i coverage/coverage.json -o coverage -t html","test":"npm run build && npm run test-cov && npm run test-remap","uglify":"uglifyjs build/arrayToTree.js --compress --mangle --output build/arrayToTree.min.js"},"gitHead":"9b6b287a2f2c0643c89462cc24317305484d6d01","_id":"performant-array-to-tree@1.0.0","_shasum":"cd68123c9dac660a0cb5598cf15475ac4abcd2e2","_from":".","_npmVersion":"4.1.2","_nodeVersion":"7.6.0","_npmUser":{"name":"philipstanislaus","email":"stanislaus.philip@gmail.com"},"dist":{"shasum":"cd68123c9dac660a0cb5598cf15475ac4abcd2e2","size":19608,"noattachment":false,"key":"/performant-array-to-tree/-/performant-array-to-tree-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/performant-array-to-tree/download/performant-array-to-tree-1.0.0.tgz"},"maintainers":[{"name":"philipstanislaus","email":""}],"_npmOperationalInternal":{"host":"packages-12-west.internal.npmjs.com","tmp":"tmp/performant-array-to-tree-1.0.0.tgz_1494172333658_0.013913735514506698"},"directories":{},"publish_time":1494172335523,"_hasShrinkwrap":false,"_cnpm_publish_time":1494172335523,"_cnpmcore_publish_time":"2021-12-16T16:03:27.751Z"}},"readme":"# Performant array to tree\n\n[![npm version](https://img.shields.io/npm/v/performant-array-to-tree.svg)](https://www.npmjs.com/package/performant-array-to-tree)\n[![minified size](https://img.shields.io/badge/minified_size-2.1_kb-brightgreen.svg)](https://github.com/philipstanislaus/performant-array-to-tree/blob/main/build/arrayToTree.min.js)\n[![CircleCI](https://circleci.com/gh/philipstanislaus/performant-array-to-tree/tree/main.svg?style=shield&circle-token=01828caf71908b915230609847a12272cc80c54d)](https://circleci.com/gh/philipstanislaus/performant-array-to-tree/tree/main)\n[![codecov](https://codecov.io/gh/philipstanislaus/performant-array-to-tree/branch/main/graph/badge.svg?token=qgGKoJkCVC)](https://codecov.io/gh/philipstanislaus/performant-array-to-tree)\n[![Dependency Status](https://img.shields.io/librariesio/release/npm/performant-array-to-tree)](https://libraries.io/npm/performant-array-to-tree)\n[![typings included](https://img.shields.io/badge/typings-included-brightgreen.svg)](#typescript)\n[![npm license](https://img.shields.io/npm/l/performant-array-to-tree.svg)](https://www.npmjs.com/package/performant-array-to-tree)\n\nConverts an array of items with ids and parent ids to a nested tree in a performant way (time complexity `O(n)`). Runs in browsers and node.\n\n## Why another package\n\nOther packages have stricter assumptions or are not as performant, as they often use nested loops or recursion. For example:\n\n[o-unflatten](https://www.npmjs.com/package/o-unflatten) requires the input to be ordered such that parent nodes always come before their children.\n[un-flatten-tree](https://www.npmjs.com/package/un-flatten-tree) uses 2 nested loops (time complexity `O(n^2)`).\n\nThis implementation does not require any order of items in the input array and focuses on runtime performance. It is the fastest amongst 4 different packages, you can find the benchmarks [here](https://github.com/philipstanislaus/array-to-tree-benchmarks). It uses an index and a single loop (time complexity `O(n)`). It was inspired by [this discussion](http://stackoverflow.com/questions/444296/how-to-efficiently-build-a-tree-from-a-flat-structure) on StackOverflow.\n\n## Installation\n\n`yarn add performant-array-to-tree`\n\nor if using npm\n\n`npm install --save performant-array-to-tree`\n\n## Usage\n\n```js\nconst tree = arrayToTree([\n  { id: \"4\", parentId: null, custom: \"abc\" },\n  { id: \"31\", parentId: \"4\", custom: \"12\" },\n  { id: \"1941\", parentId: \"418\", custom: \"de\" },\n  { id: \"1\", parentId: \"418\", custom: \"ZZZz\" },\n  { id: \"418\", parentId: null, custom: \"ü\" },\n]);\n```\n\nWhich results in the following array:\n\n```js\n[\n  {\n    data: { id: \"4\", parentId: null, custom: \"abc\" },\n    children: [\n      { data: { id: \"31\", parentId: \"4\", custom: \"12\" }, children: [] },\n    ],\n  },\n  {\n    data: { id: \"418\", parentId: null, custom: \"ü\" },\n    children: [\n      { data: { id: \"1941\", parentId: \"418\", custom: \"de\" }, children: [] },\n      { data: { id: \"1\", parentId: \"418\", custom: \"ZZZz\" }, children: [] },\n    ],\n  },\n];\n```\n\n## Configuration\n\nYou can provide a second argument to arrayToTree with configuration options. Right now, you can set the following:\n\n- `id`: Key of the id field of the item. Also works with nested properties (e. g. `\"nested.parentId\"`). Default: `\"id\"`.\n- `parentId`: Key of the parent's id field of the item. Also works with nested properties (e. g. `\"nested.parentId\"`). Default: `\"parentId\"`.\n- `nestedIds`: Option to enable/disable nested ids. Default: `true`.\n- `childrenField`: Key which will contain all child nodes of the parent node. Default: `\"children\"`\n- `dataField`: Key which will contain all properties/data of the original items. Set to null if you don't want a container. Default: `\"data\"`\n- `throwIfOrphans`: Option to throw an error if the array of items contains one or more items that have no parents in the array or if the array of items contains items with a circular parent/child relationship. This option has a small runtime penalty, so it's disabled by default. When enabled, the function will throw an error containing the parentIds that were not found in the items array, or in the case of only circular item relationships a generic error. The function will throw an error if the number of nodes in the tree is smaller than the number of nodes in the original array. When disabled, the function will just ignore orphans and circular relationships and not add them to the tree. Default: `false`\n- `rootParentIds`: Object with parent ids as keys and `true` as values that should be considered the top or root elements of the tree. This is useful when your tree is a subset of full tree, which means there is no item whose parent id is one of `undefined`, `null` or `''`. The array you pass in will be replace the default value. `undefined` and `null` are always considered to be rootParentIds. For more details, see [#23](https://github.com/philipstanislaus/performant-array-to-tree/issues/23). Default: `{'': true}`\n- `assign`: Option that enables `Object.assign` instead of the spread operator to create an item in the tree when `dataField` is `null`. This is useful if your items have a prototype that should be maintained. If enabled and `dataField` is `null`, the original node item will be used, and the `children` property will be assigned, calling any setters on that field. If `dataField` is not `null`, this option has no effect, since the original node will be used under the `dataField` of a new object. If you are unsure whether you need to enable this, it's likely fine to leave it disabled. Default: `false`\n\nExample:\n\n```js\nconst tree = arrayToTree(\n  [\n    { num: \"4\", ref: null, custom: \"abc\" },\n    { num: \"31\", ref: \"4\", custom: \"12\" },\n    { num: \"1941\", ref: \"418\", custom: \"de\" },\n    { num: \"1\", ref: \"418\", custom: \"ZZZz\" },\n    { num: \"418\", ref: null, custom: \"ü\" },\n  ],\n  { id: \"num\", parentId: \"ref\", childrenField: \"nodes\" }\n);\n```\n\nWhich produces:\n\n```js\n[\n  {\n    data: { num: \"4\", ref: null, custom: \"abc\" },\n    nodes: [{ data: { num: \"31\", ref: \"4\", custom: \"12\" }, nodes: [] }],\n  },\n  {\n    data: { num: \"418\", ref: null, custom: \"ü\" },\n    nodes: [\n      { data: { num: \"1941\", ref: \"418\", custom: \"de\" }, nodes: [] },\n      { data: { num: \"1\", ref: \"418\", custom: \"ZZZz\" }, nodes: [] },\n    ],\n  },\n];\n```\n\nExample with no data field:\n\n```js\nconst tree = arrayToTree(\n  [\n    { id: \"4\", parentId: null, custom: \"abc\" },\n    { id: \"31\", parentId: \"4\", custom: \"12\" },\n    { id: \"1941\", parentId: \"418\", custom: \"de\" },\n    { id: \"1\", parentId: \"418\", custom: \"ZZZz\" },\n    { id: \"418\", parentId: null, custom: \"ü\" },\n  ],\n  { dataField: null }\n);\n```\n\nWhich produces:\n\n```js\n[\n  {\n    id: \"4\",\n    parentId: null,\n    custom: \"abc\",\n    children: [{ id: \"31\", parentId: \"4\", custom: \"12\", children: [] }],\n  },\n  {\n    id: \"418\",\n    parentId: null,\n    custom: \"ü\",\n    children: [\n      { id: \"1941\", parentId: \"418\", custom: \"de\", children: [] },\n      { id: \"1\", parentId: \"418\", custom: \"ZZZz\", children: [] },\n    ],\n  },\n];\n```\n\nExample with nested id/parentId properties:\n\n```js\nconst tree = arrayToTree(\n  [\n    { num: { id: \"4\" }, parent: { parentId: null }, custom: \"abc\" },\n    { num: { id: \"31\" }, parent: { parentId: \"4\" }, custom: \"12\" },\n  ],\n  { id: \"num.id\", parentId: \"parent.parentId\" }\n);\n```\n\nWhich produces:\n\n```js\n[\n  {\n    data: { num: { id: \"4\" }, parent: { parentId: null }, custom: \"abc\" },\n    children: [\n      {\n        data: { num: { id: \"31\" }, parent: { parentId: \"4\" }, custom: \"12\" },\n        children: [],\n      },\n    ],\n  },\n];\n```\n\n## TypeScript\n\nThis project includes types, just import the module as usual:\n\n```ts\nimport { arrayToTree } from \"performant-array-to-tree\";\n\nconst tree = arrayToTree(array);\n```\n\n## Development\n\n`yarn version` to create a new version\n`npm login`\n`npm publish --access public` to publish it to npm\n","_attachments":{},"homepage":"https://github.com/philipstanislaus/performant-array-to-tree#readme","bugs":{"url":"https://github.com/philipstanislaus/performant-array-to-tree/issues"},"license":"MIT"}