HAR files are generated and consumed by 'GEMPACK' applications. This package reads/writes 'HAR' files (and 'SL4' files) directly using basic R functions.

Harriet was Charles Darwin's pet tortoise (possibly). 'harrietr'
    implements some function to manipulate distance matrices and phylogenetic trees
    to make it easier to plot with 'ggplot2' and to manipulate using 'tidyverse'
    tools.

Implementation of characteristic palettes inspired in the Wizarding World and the Harry Potter movie franchise.

Aimed at applying the Harvest classification tree algorithm, modified algorithm of classic classification tree.The harvested tree has advantage of deleting redundant rules in trees, leading to a simplify and more efficient tree model.It was firstly used in drug discovery field, but it also performs well in other kinds of data, especially when the region of a class is disconnected. This package also improves the basic harvest classification tree algorithm by extending the field of data of algorithm to both continuous and categorical variables. To learn more about the harvest classification tree algorithm, you can go to http://www.stat.ubc.ca/Research/TechReports/techreports/220.pdf for more information.

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.

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.

A fast, vectorized hashmap that is built on top of 'C++' std::unordered_map <https://en.cppreference.com/w/cpp/container/unordered_map.html>.
    The map can hold any 'R' object as key / value as long as it is serializable and supports
    vectorized insertion, lookup, and deletion.