{"_id":"shortest","_rev":"398832","name":"shortest","description":"given an input character set, create an iterator function that returns the next shortest string available","dist-tags":{"latest":"0.0.0"},"maintainers":[{"name":"chrisdickinson","email":""}],"time":{"modified":"2021-08-04T04:23:40.000Z","created":"2012-11-24T04:01:17.708Z","0.0.0":"2012-11-24T04:01:17.708Z"},"users":{},"author":{"name":"Chris Dickinson","email":"chris@neversaw.us"},"repository":{"type":"git","url":"git://github.com/chrisdickinson/shortest.git"},"versions":{"0.0.0":{"name":"shortest","version":"0.0.0","description":"given an input character set, create an iterator function that returns the next shortest string available","main":"index.js","scripts":{"test":"node test.js"},"repository":{"type":"git","url":"git://github.com/chrisdickinson/shortest.git"},"keywords":["radix","conversion","shortest","identifier"],"author":{"name":"Chris Dickinson","email":"chris@neversaw.us"},"license":"MIT","_id":"shortest@0.0.0","dist":{"shasum":"dc4c8d0722e7a9208ec7d2098e4cda8cac6e567d","size":1544,"noattachment":false,"key":"/shortest/-/shortest-0.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/shortest/download/shortest-0.0.0.tgz"},"maintainers":[{"name":"chrisdickinson","email":""}],"directories":{},"publish_time":1353729677708,"_cnpm_publish_time":1353729677708,"_hasShrinkwrap":false}},"readme":"# shortest\n\n```javascript\n\nvar counter = require('shortest')('abcdefg'.split(''))\n\nfor(var i = 0, len = 100; i < len; ++i) {\n  process.stdout.write(counter()+' ')\n}\n\n/* output:\n\na b c d e f g ba bb bc bd be bf bg ca cb cc cd ce cf cg da db dc dd de df dg ea eb ec ed ee ef eg fa fb fc fd fe ff fg ga gb gc gd ge gf gg baa bab bac bad bae baf bag bba bbb bbc bbd bbe bbf bbg bca bcb bcc bcd bce bcf bcg bda bdb bdc bdd bde bdf bdg bea beb bec bed bee bef beg bfa bfb bfc bfd bfe bff bfg bga bgb bgc bgd bge bgf bgg caa cab\n\n*/\n\n```\n\nCreate a counter function that iterates through a provided space of characters.\n\n# api\n\n### counter = require('shortest')([character set])\n\ncreate a counter function.\n\n### counter() -> string\n\nreturn the next item in the sequence\n\n### counter.pos() -> position\n\nreturn the current position in the sequence\n\n### counter.skip(N) -> position\n\nskip N items and return the new position\n\n### counter.reset() -> 0\n\nreturn counter to 0\n\n# license\n\nMIT\n\n","_attachments":{},"license":"MIT"}