This crate provides a collection of literal
macros for HashMap
, HashSet
, BTreeMap
, and BTreeSet.
This crate includes implementations of string similarity metrics. It includes Hamming, Levenshtein, OSA, Damerau-Levenshtein, Jaro, and Jaro-Winkler.
This crate includes implementations of string similarity metrics. It includes Hamming, Levenshtein, OSA, Damerau-Levenshtein, Jaro, and Jaro-Winkler.
This package provides a Rust implementation of the WyHash fast portable non-cryptographic hashing algorithm and random number generator.
This package provides a Rust wrapper for libxml2, the XML C parser and toolkit developed for the GNOME project.
This package provides a fast, non-secure, hashing algorithm derived from an internal hasher used in FireFox and Rustc.
This crate includes implementations of string similarity metrics. It includes Hamming, Levenshtein, OSA, Damerau-Levenshtein, Jaro, and Jaro-Winkler.
This package provides a memory efficient container for nested collections (like Vec<String>
or Vec<Vec<T>>
).
This crate includes implementations of string similarity metrics. It includes Hamming, Levenshtein, OSA, Damerau-Levenshtein, Jaro, and Jaro-Winkler.
This crate includes implementations of string similarity metrics. It includes Hamming, Levenshtein, OSA, Damerau-Levenshtein, Jaro, and Jaro-Winkler.
This crate provides the ability to open a file or link with the default program configured on the system.
This crate includes implementations of string similarity metrics. It includes Hamming, Levenshtein, OSA, Damerau-Levenshtein, Jaro, and Jaro-Winkler.
This crate provides the ability to open a file or link with the default program configured on the system.
This crate provides functionality for defining pretty printers. It is particularly useful for printing structured recursive data like trees.
RTG-MATH provides a selection of the math routines most commonly needed for making realtime graphics in Lisp.
Timers offers a collections of one-shot and periodic timers, intended for use with event loops such as async.
For a sequence of event occurence times, we are interested in finding subsequences in it that are too "regular". We define regular as being significantly different from a homogeneous Poisson process. The departure from the Poisson process is measured using a L1 distance. See Di and Perlman 2007 for more details.
This is a port of Jonathan Shewchuk's Triangle library to R. From his description: "Triangle generates exact Delaunay triangulations, constrained Delaunay triangulations, conforming Delaunay triangulations, Voronoi diagrams, and high-quality triangular meshes. The latter can be generated with no small or large angles, and are thus suitable for finite element analysis.".
This is a Python package for rendering rich text, tables, progress bars, syntax highlighting, markdown and more to the terminal.
This package provides a client for AWS Polly <http://aws.amazon.com/documentation/polly>, a speech synthesis service.
Collect your data on digital marketing campaigns from Appsflyer using the Windsor.ai API <https://windsor.ai/api-fields/>.
Evaluation (S4-)classes based on package distr for evaluating procedures (estimators/tests) at data/simulation in a unified way.
This package provides a thin wrapper around the Datorama API. Ideal for analyzing marketing data from <https://datorama.com>.
This function provides an interface between Matlab and R in facilitating fast processing for reading and saving DICOM images.