formula-haversine
[Javascript/Typescript] - The fastest implementation of the haversine algorithm to calculate distances between to coordinates
[Javascript/Typescript] - The fastest implementation of the haversine algorithm to calculate distances between to coordinates
User friendly algorithms for generating image hashes.
Over simplistic fuzzy search library using Damerau-Levenshtein and optionally the keyboard layout to calculate distances.
Builds a hierarchy of clusters.
Fastest SIMD-Accelerated Vector Similarity Functions for x86 and Arm
Calculate the L2-norm of a double-precision floating-point vector.
Return the stride along a specified dimension for a provided ndarray.
Return the stride along a specified dimension for a provided ndarray.
Calculate the L2-norm of a vector.
Compute a moving mean absolute error (MAE) incrementally.
Compute the mean absolute error (MAE) incrementally.
Calculate the Hamming distance between two equal-length strings.
Calculates the Levenshtein (edit) distance between two strings.
Compute a sample Pearson product-moment correlation distance.
Compute a sample Pearson product-moment correlation distance matrix incrementally.
Compute a moving residual sum of squares (RSS) incrementally.
Compute a moving sample Pearson product-moment correlation distance incrementally.
Compute the residual sum of squares (RSS) incrementally.
Compute the absolute value of a double-precision complex floating-point number.
Compute the squared absolute value of a double-precision complex floating-point number.