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.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
0.9.0 |
rolling source/ R- | hashids_0.9.0.tar.gz |
10.3 KiB |
0.9.0 |
rolling linux/jammy R-4.5 | hashids_0.9.0.tar.gz |
42.7 KiB |
0.9.0 |
rolling linux/noble R-4.5 | hashids_0.9.0.tar.gz |
42.8 KiB |
0.9.0 |
latest source/ R- | hashids_0.9.0.tar.gz |
10.3 KiB |
0.9.0 |
latest linux/jammy R-4.5 | hashids_0.9.0.tar.gz |
42.7 KiB |
0.9.0 |
latest linux/noble R-4.5 | hashids_0.9.0.tar.gz |
42.8 KiB |
0.9.0 |
2026-04-23 source/ R- | hashids_0.9.0.tar.gz |
10.3 KiB |
0.9.0 |
2026-04-09 windows/windows R-4.5 | hashids_0.9.0.zip |
46.0 KiB |
0.9.0 |
2025-04-20 source/ R- | hashids_0.9.0.tar.gz |
10.3 KiB |