[{"authors":"Todd Resudek","built_at":"2016-02-14T00:00:00.000Z","created_at":"2016-02-14T21:39:53.759Z","description":"Taking an existing alphabetic hash (of any length), will return the next hash in sequence.\n                  If all characters in hash are rolled over, will append a new char (increase the length by 1.)\n                  [eg. 'ZZZZ' -> 'AAAAA']\n                  [eg. 'AAAZ' -> 'AABA']","downloads_count":3769,"metadata":{},"number":"1.0.0","summary":"Create unique alphabetical hashes","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 2.0.0","prerelease":false,"licenses":["Apache-2.0"],"requirements":[],"sha":"ef7505f9085b7d93bd59faa6b6cfed59816c27902772d9459cb2393db6d0b949","spec_sha":"759dddc5e03f1ebce56b82cd84b197ab6957692ce7eb354b2fcdcb8257890988"},{"authors":"Todd Resudek","built_at":"2014-11-18T00:00:00.000Z","created_at":"2014-11-19T06:09:41.170Z","description":"Taking an existing alphabetic hash (of any length), will return the next hash in sequence.\n                  If all characters in hash are rolled over, will append a new char (increase the length by 1.)\n                  [eg. 'ZZZZ' -> 'AAAAA']\n                  [eg. 'AAAZ' -> 'AABA']","downloads_count":3486,"metadata":{},"number":"0.0.4","summary":"Create unique alphabetical hashes","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 1.9.3","prerelease":false,"licenses":["Apache-2.0"],"requirements":[],"sha":"7960fd0de60bf079b7afab86f2e5329a02edd0218b378275e8bda198849b72f4","spec_sha":"faf893677a1cecf5af1600f3f969cd18bdb72cdf23af27db7e5cc77bd05b60b0"},{"authors":"Todd Resudek","built_at":"2014-11-18T00:00:00.000Z","created_at":"2014-11-19T05:54:24.868Z","description":"Taking an existing alphabetic hash (of any length), will return the next hash in sequence.\n                  If all characters in hash are rolled over, will append a new char (increase the length by 1.)\n                  eg. 'ZZZZ' -> 'AAAAA'\n                  eg. 'AAAZ' -> 'AABA'","downloads_count":3343,"metadata":{},"number":"0.0.3","summary":"Create unique alphabetical hashes","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 0","prerelease":false,"licenses":["Apache-2.0"],"requirements":[],"sha":"085c1574a06ae8d1fcbd25642abaedcf71cfb121251831d810dbb0ded003a80e","spec_sha":"0adae6124dd4cd3232de6499b033fcbcf7d00fab4c322d17304bc42e8a2e0983"},{"authors":"Todd Resudek","built_at":"2014-11-17T00:00:00.000Z","created_at":"2014-11-18T15:08:09.710Z","description":"Taking an existing alphabetic hash (of any length), will return the next hash in sequence.\n                  If all characters in hash are rolled over, will append a new char (increase the length by 1.)\n                  eg. 'ZZZZ' -> 'AAAAA'\n                  eg. 'AAAZ' -> 'AABA'","downloads_count":3317,"metadata":{},"number":"0.0.2","summary":"Create unique alphabetical hashes","platform":"ruby","rubygems_version":">= 0","ruby_version":">= 0","prerelease":false,"licenses":["Apache-2.0"],"requirements":[],"sha":"445525043cef84bc0ab2fc8f16a8d59925ac6f1fef769c0a8d9ca588ce19b3ba","spec_sha":"055066c39708eb6687a293bed9cc09c8187e0d9fc6e271bd4e89ae73db7377f0"}]