{"_id":"@brendangooch/every-combination","name":"@brendangooch/every-combination","dist-tags":{"latest":"1.0.0"},"versions":{"1.0.0":{"name":"@brendangooch/every-combination","version":"1.0.0","description":"a single function that takes in an array of numbers and returns a new array containing the original array and the original array in every possible combination of sorting orders, minus any duplicates.  Currently works with arrays of length 3 - 6 values.  A","author":{"name":"B Gooch","email":"brendangooch@gmail.com"},"license":"MIT","type":"module","scripts":{"test":"NODE_OPTIONS=\"$NODE_OPTIONS --experimental-vm-modules\" NODE_NO_WARNINGS=1 jest","build":"tsc -p tsconfig.prod.json","pretest":"clear && npm run remove-tests && tsc --outdir tests","posttest":"npm run remove-tests","prebuild":"npm run remove-lib","prepack":"npm run build","remove-tests":"rm -rf tests","remove-lib":"rm -rf lib"},"private":false,"publishConfig":{"access":"public"},"exports":{".":"./lib/index.js"},"types":"./lib/index.d.ts","devDependencies":{"@brendangooch/jest-expect":"^1.0.0","@types/jest":"^29.5.14","jest":"^29.7.0","typescript":"^5.6.3"},"repository":{"type":"git","url":"git+https://github.com/brendangooch/every-combination.git"},"homepage":"https://github.com/brendangooch/every-combination#readme","bugs":{"url":"https://github.com/brendangooch/every-combinationissues","email":"brendangooch@gmail.com"},"keywords":[],"_id":"@brendangooch/every-combination@1.0.0","gitHead":"f474494ed6ae5af8ad5ed01a392060a53782eb7f","_nodeVersion":"21.4.0","_npmVersion":"10.9.0","dist":{"integrity":"sha512-wDm5Gdjw5sYSYXZMWJADqFJxlx7zRZZfxqqw2HFx5bhoGHflLg322cXn3u4juMOAWqxW4z+o62b1ZLCmcyXruQ==","shasum":"43c6748d1ed680dd5341c538f9df97b7e2492c2f","tarball":"https://registry.npmjs.org/@brendangooch/every-combination/-/every-combination-1.0.0.tgz","fileCount":5,"unpackedSize":4833,"signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIGz1bt8pCXZWbqw7K72BMQq40bPynNPZdwF4Wsjg/V3tAiEA6nLqGKlu0IVwHVVxPQuBMrO73X25wQ3+bXLjFm1vRKw="}]},"_npmUser":{"name":"brendangooch","email":"brendangooch@gmail.com"},"directories":{},"maintainers":[{"name":"brendangooch","email":"brendangooch@gmail.com"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/every-combination_1.0.0_1730744464052_0.6577084836086795"},"_hasShrinkwrap":false}},"time":{"created":"2024-11-04T18:21:03.945Z","1.0.0":"2024-11-04T18:21:04.299Z","modified":"2024-11-04T18:21:04.604Z"},"maintainers":[{"name":"brendangooch","email":"brendangooch@gmail.com"}],"description":"a single function that takes in an array of numbers and returns a new array containing the original array and the original array in every possible combination of sorting orders, minus any duplicates.  Currently works with arrays of length 3 - 6 values.  A","homepage":"https://github.com/brendangooch/every-combination#readme","keywords":[],"repository":{"type":"git","url":"git+https://github.com/brendangooch/every-combination.git"},"author":{"name":"B Gooch","email":"brendangooch@gmail.com"},"bugs":{"url":"https://github.com/brendangooch/every-combinationissues","email":"brendangooch@gmail.com"},"license":"MIT","readme":"# every-combination\na single function that takes in an array of numbers and returns a new array containing the original array and the original array in every possible combination of sorting orders, minus any duplicates.  Currently works with arrays of length 3 - 6 values.  Any larger and the function is seriously inefficient and slow\n","readmeFilename":"README.md"}