hashids: Generate Short Unique YouTube-Like IDs (Hashes) from Integers

An R port of the hashids library. hashids generates YouTube-like hashes from integers or vector of integers. Hashes generated from integers are relatively short, unique and non-seqential. hashids can be used to generate unique ids for URLs and hide database row numbers from the user. By default hashids will avoid generating common English cursewords by preventing certain letters being next to each other. hashids are not one-way: it is easy to encode an integer to a hashid and decode a hashid back into an integer.

Version: 0.9.0
Depends: R (≥ 3.2.2)
Suggests: testthat
Published: 2015-09-11
Author: Alex Shum [aut, cre], Ivan Akimov [aut] (original author of hashids -- implemented in javascript), David Aurelio [ctb] (implemented hashids in python 2 and 3)
Maintainer: Alex Shum <Alex at ALShum.com>
BugReports: https://github.com/ALShum/hashids-r/issues
License: MIT + file LICENSE
URL: https://github.com/ALShum/hashids-r/, http://hashids.org
NeedsCompilation: no
Materials: README
CRAN checks: hashids results


Reference manual: hashids.pdf
Package source: hashids_0.9.0.tar.gz
Windows binaries: r-devel: hashids_0.9.0.zip, r-release: hashids_0.9.0.zip, r-oldrel: hashids_0.9.0.zip
OS X Mavericks binaries: r-release: hashids_0.9.0.tgz, r-oldrel: hashids_0.9.0.tgz


Please use the canonical form https://CRAN.R-project.org/package=hashids to link to this page.