{"name":"array-timsort","version":"1.0.2","description":"Fast JavaScript array sorting by implementing Python's Timsort algorithm","homepage":"https://github.com/kaelzhang/node-array-timsort","main":"./src","dependencies":{},"devDependencies":{"@ostai/eslint-config":"^3.5.0","ava":"^3.13.0","codecov":"^3.7.2","eslint":"^7.10.0","eslint-plugin-import":"^2.22.1","eslint-plugin-mocha":"^8.0.0","nyc":"^15.1.0"},"scripts":{"benchmark":"node benchmark/index.js","test":"npm run test:only","test:only":"NODE_DEBUG=array-timsort nyc ava --timeout=10s --verbose","test:dev":"npm run test:only && npm run report:dev","lint":"eslint .","fix":"eslint . --fix","posttest":"npm run report","report":"nyc report --reporter=text-lcov > coverage.lcov && codecov","report:dev":"nyc report --reporter=html && npm run report:open","report:open":"open coverage/index.html"},"ava":{"files":["test/*.test.js"]},"repository":{"type":"git","url":"git+https://github.com/kaelzhang/node-array-timsort.git"},"keywords":["fast sort","array soft","sort","compare","TimSort","algorithm","python","performance"],"license":"MIT","bugs":{"url":"https://github.com/kaelzhang/node-array-timsort/issues"},"gitHead":"f777f80b6b5bc5a35564e4cc1dec4d9db0aba485","_id":"array-timsort@1.0.2","_nodeVersion":"14.12.0","_npmVersion":"6.14.8","dist":{"shasum":"55262f7e581fecde0547d6ed75da0bef299e1a8f","size":9173,"noattachment":false,"key":"/array-timsort/-/array-timsort-1.0.2.tgz","tarball":"http://registry.cnpm.dingdandao.com/array-timsort/download/array-timsort-1.0.2.tgz"},"maintainers":[{"name":"kael","email":"i@kael.me"}],"_npmUser":{"name":"kael","email":"i@kael.me"},"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/array-timsort_1.0.2_1601566917289_0.9637300103320794"},"_hasShrinkwrap":false,"publish_time":1601566917440,"_cnpm_publish_time":1601566917440,"dist-tags":{"latest":"1.0.3"}}