Description: This package implements a data structure similar to hashes
in Perl and dictionaries in Python but with a purposefully R
length.R set.R values.R get.R invert.R zzz.R

Title: Full feature implementation of hash/associated
flavor. For objects of appreciable size, access using hashes
outperforms native named lists and vectors.

flavor.  For objects of appreciable size, access using hashes

Title: Full Feature Implementation of Hash/Associated
Description: Implements a data structure similar to hashes

Title: Full Featured Implementation of Hash Tables/Associative
Description: Implements a data structure similar to hashes in Perl and dictionaries in Python but with a purposefully R flavor. For objects of appreciable size, access using hashes outperforms native named lists and vectors.
Packaged: 2022-03-21 15:05:06 UTC; johnhughes

Description: This package implements a data structure similar to dictionaries
in Python and hashes in Perl and other languages but with a implementation
and API with an R flavor. For objects of appreciable size, hashes outperform
native named lists and vectors for lookups. A comprehensive set of functions
methods and object make hashes flexible and easy to use.

Title: A collection of non-cryptographic hash functions
Description: This package provides common non-cryptographic hash
functions for R. For example, SpookyHash, Murmur3Hash, Google
Copyright: Under the allowance of MIT license, smhash
(https://code.google.com/p/smhasher/) codes have been adopted.

Title: Generate Short Unique YouTube-Like IDs (Hashes) from Integers
person("Alex", "Shum", email = "Alex@ALShum.com", role = c("aut", "cre")),
person("Ivan", "Akimov", email = "ivan@barreleye.com", role= c("aut"), comment = "original author of hashids -- implemented in javascript"),
person("David", "Aurelio", email = "dev@david-aurelio.com", role = c("ctb"), comment = "implemented hashids in python 2 and 3"))
Description: 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.
Ivan Akimov [aut] (original author of hashids -- implemented in
David Aurelio [ctb] (implemented hashids in python 2 and 3)