{"_id":"compute-gcd","_rev":"13-3a5d11655dc9fb0248d5a6166330b44a","name":"compute-gcd","description":"Computes the greatest common divisor (gcd).","dist-tags":{"latest":"1.2.1"},"versions":{"0.0.0":{"name":"compute-gcd","version":"0.0.0","description":"Computes the greatest common divisor (gcd).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/gcd.git"},"keywords":["compute.io","compute","computation","mathematics","math","euclid","stein","binary gcd","greatest common divisor","greatest common factor","gcd","gcf","arithmetic"],"bugs":{"url":"https://github.com/compute-io/gcd/issues"},"dependencies":{"validate.io-integer":"^1.0.2"},"devDependencies":{"chai":"1.x.x","mocha":"1.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"818c0a39af77f7d924c5fbd0906ed7c4e44674ab","homepage":"https://github.com/compute-io/gcd","_id":"compute-gcd@0.0.0","_shasum":"edc2d25e75c8699d3691be540cb1aabbcf6bbba8","_from":".","_npmVersion":"1.5.0-alpha-1","_npmUser":{"name":"kgryte","email":"kgryte@gmail.com"},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"}],"dist":{"shasum":"edc2d25e75c8699d3691be540cb1aabbcf6bbba8","tarball":"https://registry.npmjs.org/compute-gcd/-/compute-gcd-0.0.0.tgz","integrity":"sha512-5q219c0GNqhGcNIrcwnzz11VyR+P7jGYZdtt94RlCdXdm10qvAF40iFT52h2c6eO2v3EsnEVcQLzm/kqv4x6ow==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQCLgdyDrH1ztHk5PrAQCbX5rN4uP3XAb7jcisuJfHol2AIgHoYlOBmln/g50MP4xvazOm34Hd37JYw//LRmmtswK/k="}]},"directories":{}},"1.0.0":{"name":"compute-gcd","version":"1.0.0","description":"Computes the greatest common divisor (gcd).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/gcd.git"},"keywords":["compute.io","compute","computation","mathematics","math","euclid","stein","binary gcd","greatest common divisor","greatest common factor","gcd","gcf","arithmetic"],"bugs":{"url":"https://github.com/compute-io/gcd/issues"},"dependencies":{"validate.io-integer":"^1.0.2"},"devDependencies":{"chai":"1.x.x","mocha":"1.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"86691a9d7e1f831b12a361046ac5a7b244a28fa4","homepage":"https://github.com/compute-io/gcd","_id":"compute-gcd@1.0.0","_shasum":"0fecbf7fbe055ce5ede7b030c9962bd6803d0dd0","_from":".","_npmVersion":"1.5.0-alpha-1","_npmUser":{"name":"kgryte","email":"kgryte@gmail.com"},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"}],"dist":{"shasum":"0fecbf7fbe055ce5ede7b030c9962bd6803d0dd0","tarball":"https://registry.npmjs.org/compute-gcd/-/compute-gcd-1.0.0.tgz","integrity":"sha512-JJGlxZswaCmI7V1O8+Mu4aSOgXbdK11jAHKunl1ix3hmW0XSaC7t66WxtPMenKmHkzQrkSboEecL1zak/BP6og==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIEkjtj8SQWgGO/UdlCiRjhiwB+1tojF+MExB0LvAwIlTAiBandP844PYg1dhOVd7ZBpivTVjo9rb80WUdgTstD2NSw=="}]},"directories":{}},"1.0.1":{"name":"compute-gcd","version":"1.0.1","description":"Computes the greatest common divisor (gcd).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/gcd.git"},"keywords":["compute.io","compute","computation","mathematics","math","euclid","stein","binary gcd","greatest common divisor","greatest common factor","highest common factor","greatest common measure","highest common divisor","gcd","gcf","hcf","gcm","arithmetic"],"bugs":{"url":"https://github.com/compute-io/gcd/issues"},"dependencies":{"validate.io-integer":"^1.0.2"},"devDependencies":{"chai":"1.x.x","mocha":"1.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"e5599b99896e4a60a4ef131a5065501c3bef8dfb","homepage":"https://github.com/compute-io/gcd","_id":"compute-gcd@1.0.1","_shasum":"936fe85520dcc641d83f8094a7ca78748c4f3214","_from":".","_npmVersion":"1.5.0-alpha-1","_npmUser":{"name":"kgryte","email":"kgryte@gmail.com"},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"}],"dist":{"shasum":"936fe85520dcc641d83f8094a7ca78748c4f3214","tarball":"https://registry.npmjs.org/compute-gcd/-/compute-gcd-1.0.1.tgz","integrity":"sha512-c3WC9ClxVnR59klxobgPanG6d0KSCJbVxQcRcwygV9eOd5fOHxtB7AdQ3Dw5Iw8FBKVNG1S5EY0hLpnQmfvrWQ==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDoi6I5ObUbVdTgvRPtVighG858ZSTpqDLCUsvU3ykfaQIgbBn0/CnvkN/sIMLcbX+c7LZ7at2xbHeb0oXw1k+MQf0="}]},"directories":{}},"1.1.0":{"name":"compute-gcd","version":"1.1.0","description":"Computes the greatest common divisor (gcd).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"},{"name":"Philipp Burckhardt","email":"pburckhardt@outlook.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/gcd.git"},"keywords":["compute.io","compute","computation","mathematics","math","euclid","stein","binary gcd","greatest common divisor","greatest common factor","highest common factor","greatest common measure","highest common divisor","gcd","gcf","hcf","gcm","arithmetic","array","integer"],"bugs":{"url":"https://github.com/compute-io/gcd/issues"},"dependencies":{"validate.io-array":"^1.0.3","validate.io-function":"^1.0.2","validate.io-integer":"^1.0.5"},"devDependencies":{"chai":"2.x.x","mocha":"2.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0","jshint":"2.x.x","jshint-stylish":"^1.0.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"d12a9bdb43b45af2118cfdd5b53552300c06adc4","homepage":"https://github.com/compute-io/gcd#readme","_id":"compute-gcd@1.1.0","_shasum":"72374491d16daafb495e728f5e2385e30e30cdc8","_from":".","_npmVersion":"2.8.3","_nodeVersion":"0.10.29","_npmUser":{"name":"kgryte","email":"kgryte@gmail.com"},"dist":{"shasum":"72374491d16daafb495e728f5e2385e30e30cdc8","tarball":"https://registry.npmjs.org/compute-gcd/-/compute-gcd-1.1.0.tgz","integrity":"sha512-W2gvHXqtnhkG9XVUmQaXa4WfUia+WROyYII/h1ysTHo76+l0oCz9l9/A3t3maq13BRamae+AFAnw1uDlNCIx1w==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIQDl0HE2rtcU1XE4wdcZFQOjdnYciIes6RkjhuFfq51qtAIgFw6XbN6fAl+QwkTL/NXDIMicJDOQSGa4+nt0+RkPgI0="}]},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"}],"directories":{}},"1.2.0":{"name":"compute-gcd","version":"1.2.0","description":"Computes the greatest common divisor (gcd).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"},{"name":"Philipp Burckhardt","email":"pburckhardt@outlook.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/gcd.git"},"keywords":["compute.io","compute","computation","mathematics","math","euclid","stein","binary gcd","greatest common divisor","greatest common factor","highest common factor","greatest common measure","highest common divisor","gcd","gcf","hcf","gcm","arithmetic","array","integer"],"bugs":{"url":"https://github.com/compute-io/gcd/issues"},"dependencies":{"validate.io-array":"^1.0.3","validate.io-function":"^1.0.2","validate.io-integer-array":"^1.0.0"},"devDependencies":{"chai":"2.x.x","mocha":"2.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0","jshint":"2.x.x","jshint-stylish":"^1.0.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"f6270cf9730a5f8f4c1be840d63743e58122fc0c","homepage":"https://github.com/compute-io/gcd#readme","_id":"compute-gcd@1.2.0","_shasum":"fc1ede5b65001e950226502f46543863e4fea10e","_from":".","_npmVersion":"2.8.3","_nodeVersion":"0.10.29","_npmUser":{"name":"kgryte","email":"kgryte@gmail.com"},"dist":{"shasum":"fc1ede5b65001e950226502f46543863e4fea10e","tarball":"https://registry.npmjs.org/compute-gcd/-/compute-gcd-1.2.0.tgz","integrity":"sha512-E/n2S4m7JUOk+k7MubncFiCTP9bezvt5y+t20PiseMw8o8YwiOJvyFVpWP/nMQCrwPQPNsu8zITEnZjn162Wew==","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEUCIEfnWEily7w7ENWMyqkyxmKIoLww2KiDpBhwooCjqIc2AiEAyYBmHEZT08+BEn0KyELXMIowaFNJYasSXgqdMs6U5cc="}]},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"},{"name":"planeshifter","email":"pgb@andrew.cmu.edu"}],"directories":{}},"1.2.1":{"name":"compute-gcd","version":"1.2.1","description":"Computes the greatest common divisor (gcd).","author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"},{"name":"Philipp Burckhardt","email":"pburckhardt@outlook.com"}],"scripts":{"test":"mocha","test-cov":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coverage -- -R spec","coveralls":"istanbul cover ./node_modules/.bin/_mocha --dir ./reports/coveralls/coverage --report lcovonly -- -R spec && cat ./reports/coveralls/coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./reports/coveralls"},"main":"./lib","repository":{"type":"git","url":"git://github.com/compute-io/gcd.git"},"keywords":["compute.io","compute","computation","mathematics","math","euclid","stein","binary gcd","greatest common divisor","greatest common factor","highest common factor","greatest common measure","highest common divisor","gcd","gcf","hcf","gcm","arithmetic","array","integer"],"bugs":{"url":"https://github.com/compute-io/gcd/issues"},"dependencies":{"validate.io-array":"^1.0.3","validate.io-function":"^1.0.2","validate.io-integer-array":"^1.0.0"},"devDependencies":{"chai":"2.x.x","mocha":"2.x.x","coveralls":"^2.11.1","istanbul":"^0.3.0","jshint":"2.x.x","jshint-stylish":"^1.0.0"},"licenses":[{"type":"MIT","url":"http://www.opensource.org/licenses/MIT"}],"gitHead":"03e819a1704471f66d837966f90724bd2203d700","homepage":"https://github.com/compute-io/gcd#readme","_id":"compute-gcd@1.2.1","_nodeVersion":"12.9.1","_npmVersion":"6.14.9","dist":{"integrity":"sha512-TwMbxBNz0l71+8Sc4czv13h4kEqnchV9igQZBi6QUaz09dnz13juGnnaWWJTRsP3brxOoxeB4SA2WELLw1hCtg==","shasum":"34d639f3825625e1357ce81f0e456a6249d8c77f","tarball":"https://registry.npmjs.org/compute-gcd/-/compute-gcd-1.2.1.tgz","fileCount":4,"unpackedSize":11845,"npm-signature":"-----BEGIN PGP SIGNATURE-----\r\nVersion: OpenPGP.js v3.0.13\r\nComment: https://openpgpjs.org\r\n\r\nwsFcBAEBCAAQBQJfwzpWCRA9TVsSAnZWagAA8FUQAI128Du8jiQtw9b1g4o7\nBBggsO2/K7bOS/e9M8YpI/Dv0+AjDNMdbxkX3taxGuODdM2xAs4R6SHztfzV\n/Klik8Lv0/stFJTlvaI7ToX56ea6O1OxAe9NdYC8VGOS6ZdY9EJhH9zrVS1m\nVOYajR9S7vt+jP0atlx/evJayvIgjJGMyop7oiHNwdK110UZ6MDzeDGffUyV\nVkYgcbyUfZRXXPhMtks46dBmzXVYcfLrhEIGXhYqbuQwML5NMe+ElIFMzmID\n5VyFdnPm+lMbvRiiY7nuQDIko8ZNWBxC0o5kbcBEEOR+2hJX2tRsblAeOnIL\nsti1prVxUg6JBb3tGP24WNWO/huaqwBmfAvPysE/UQyzTYbR3ukwo8aGPY3C\n/eFPFHC1TKgESk0pSEpqR3ZJD6se7ta60KTaTX/xdfyKnKPBvFkkau1JWeRc\niD7sl1UGyhfSArcCiUJFo4uzrzl54+NpfDNFoZgMPQ4PYAnHSpHy+wVIGbPG\nxHmSmLCd169FlQdh/L7FtaXVcnKxW+w25GflSOeIFYSdkmwu2PJ+B9hZEvBT\nb0t2upEHPivK+RPOKRqWnEnCysJX8yNgi+ostzYwJ5WrRxP3jkk+T+Djyl6I\nRMRsM3MCq3v5/UCK4u7lt/hJEpBygKKpbttYXyBrW6qNJHR8fyaXqUB5PK/M\njeD7\r\n=kW5R\r\n-----END PGP SIGNATURE-----\r\n","signatures":[{"keyid":"SHA256:jl3bwswu80PjjokCgh0o2w5c2U4LhQAE57gj9cz1kzA","sig":"MEQCIB9dlcgXrNN8D/DcHNo2cA0u2nIXdiIZ1wilP0/GqzX9AiBqvRw/jeiHj20eQRIZxWqPZjFy1h0m0hERrMYzz1ODew=="}]},"_npmUser":{"name":"planeshifter","email":"pgb@andrew.cmu.edu"},"directories":{},"maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"},{"name":"planeshifter","email":"pgb@andrew.cmu.edu"}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/compute-gcd_1.2.1_1606629974104_0.18025909370088367"},"_hasShrinkwrap":false}},"readme":"Greatest Common Divisor\n===\n[![NPM version][npm-image]][npm-url] [![Build Status][travis-image]][travis-url] [![Coverage Status][coveralls-image]][coveralls-url] [![Dependencies][dependencies-image]][dependencies-url]\n\n> Computes the [greatest common divisor](http://en.wikipedia.org/wiki/Greatest_common_divisor) (gcd).\n\nNote: the gcd is also known as the __greatest common factor__ (gcf), __highest common factor__ (hcf), __highest common divisor__, and __greatest common measure__ (gcm).\n\n\n\n## Installation\n\n``` bash\n$ npm install compute-gcd\n```\n\nFor use in the browser, use [browserify](https://github.com/substack/node-browserify).\n\n\n## Usage\n\n``` javascript\nvar gcd = require( 'compute-gcd' );\n```\n\n\n#### gcd( a, b[, c,...,n] )\n\nComputes the [greatest common divisor](http://en.wikipedia.org/wiki/Greatest_common_divisor) (gcd) of two or more `integers`.\n\n``` javascript\nvar val = gcd( 48, 18 );\n// returns 6\n\nvar val = gcd( 8, 12, 16 );\n// returns 4\n```\n\n\n#### gcd( arr[, accessor] )\n\nComputes the [greatest common divisor](http://en.wikipedia.org/wiki/Greatest_common_divisor) (gcd) of two or more `integers`.\n\n``` javascript\nvar val = gcd( [48, 18] );\n// returns 6\n\nvar val = gcd( [8, 12, 16] );\n// returns 4\n```\n\nFor object `arrays`, provide an accessor `function` for accessing `array` values\n\n``` javascript\nvar data = [\n\t['beep', 4],\n\t['boop', 8],\n\t['bap', 12],\n\t['baz', 16]\n];\n\nfunction getValue( d, i ) {\n\treturn d[ 1 ];\n}\n\nvar arr = gcd( arr, getValue );\n// returns 4\n```\n\n\n\n## Notes\n\n-\tFor more than 3 values, a performance gain can be achieved if the values are sorted in ascending order.\n- \tIf provided an `array` with a length less than `2` or a single `integer` argument, the function returns `null`.\n\n\n\n## Examples\n\n``` javascript\nvar gcd = require( 'compute-gcd' );\n\n// Compute the gcd of random tuples...\nvar x, y, z, arr, val;\nfor ( var i = 0; i < 100; i++ ) {\n\tx = Math.round( Math.random()*50 );\n\ty = Math.round( Math.random()*50 );\n\tz = Math.round( Math.random()*50 );\n\tarr = [ x, y, z ];\n\tval = gcd( arr );\n\tconsole.log( arr, val );\n}\n```\n\nTo run the example code from the top-level application directory,\n\n``` bash\n$ node ./examples/index.js\n```\n\n\n\n\n## Tests\n\n### Unit\n\nUnit tests use the [Mocha](http://mochajs.org) test framework with [Chai](http://chaijs.com) assertions. To run the tests, execute the following command in the top-level application directory:\n\n``` bash\n$ make test\n```\n\nAll new feature development should have corresponding unit tests to validate correct functionality.\n\n\n### Test Coverage\n\nThis repository uses [Istanbul](https://github.com/gotwarlost/istanbul) as its code coverage tool. To generate a test coverage report, execute the following command in the top-level application directory:\n\n``` bash\n$ make test-cov\n```\n\nIstanbul creates a `./reports/coverage` directory. To access an HTML version of the report,\n\n``` bash\n$ make view-cov\n```\n\n\n---\n## License\n\n[MIT license](http://opensource.org/licenses/MIT).\n\n\n## Copyright\n\nCopyright &copy; 2014-2015. Athan Reines.\n\n\n[npm-image]: http://img.shields.io/npm/v/compute-gcd.svg\n[npm-url]: https://npmjs.org/package/compute-gcd\n\n[travis-image]: http://img.shields.io/travis/compute-io/gcd/master.svg\n[travis-url]: https://travis-ci.org/compute-io/gcd\n\n[coveralls-image]: https://img.shields.io/coveralls/compute-io/gcd/master.svg\n[coveralls-url]: https://coveralls.io/r/compute-io/gcd?branch=master\n\n[dependencies-image]: http://img.shields.io/david/compute-io/gcd.svg\n[dependencies-url]: https://david-dm.org/compute-io/gcd\n\n[dev-dependencies-image]: http://img.shields.io/david/dev/compute-io/gcd.svg\n[dev-dependencies-url]: https://david-dm.org/dev/compute-io/gcd\n\n[github-issues-image]: http://img.shields.io/github/issues/compute-io/gcd.svg\n[github-issues-url]: https://github.com/compute-io/gcd/issues\n","maintainers":[{"name":"kgryte","email":"kgryte@gmail.com"},{"name":"planeshifter","email":"pgb@andrew.cmu.edu"}],"time":{"modified":"2022-06-13T20:28:20.347Z","created":"2014-11-21T10:44:42.737Z","0.0.0":"2014-11-21T10:44:42.737Z","1.0.0":"2014-11-21T10:45:04.106Z","1.0.1":"2014-11-24T03:32:04.922Z","1.1.0":"2015-05-02T21:55:29.570Z","1.2.0":"2015-05-08T00:01:22.961Z","1.2.1":"2020-11-29T06:06:14.245Z"},"homepage":"https://github.com/compute-io/gcd#readme","keywords":["compute.io","compute","computation","mathematics","math","euclid","stein","binary gcd","greatest common divisor","greatest common factor","highest common factor","greatest common measure","highest common divisor","gcd","gcf","hcf","gcm","arithmetic","array","integer"],"repository":{"type":"git","url":"git://github.com/compute-io/gcd.git"},"contributors":[{"name":"Athan Reines","email":"kgryte@gmail.com"},{"name":"Philipp Burckhardt","email":"pburckhardt@outlook.com"}],"author":{"name":"Athan Reines","email":"kgryte@gmail.com"},"bugs":{"url":"https://github.com/compute-io/gcd/issues"},"readmeFilename":"README.md"}