WASM implementation of common algorithms used in Telegram
A npm module containing the common searching and sorting algorithms
A collection of mostly common algorithms, data structures with visualizations and explanations.
Utility library for common algorithms. All self-implemented.
Algorithms to help you parse CSS from an array of tokens.
javascript approaches to common algorithms
Common algorithms
a js toolkit, contains common algorithms and data structures, also include TS version
Xml digital signature and encryption library for Node.js
Shared utilities for dashboard exports, expressions, data handling, and helper logic
JWA implementation (supports all JWS algorithms)
common algorithms
Browser Compatible Object Hashing
Six common algorithms
Crypto Lib is a powerful intuitive cryptographic JavaScript library that encapsulates common algorithms, functions and provides an interface for low-level cryptographic operations.
various machine learning routines for node
Boyer-Moore-Horspool algorithms
Lightning fast hash functions for browsers and Node.js using hand-tuned WebAssembly binaries (MD4, MD5, SHA-1, SHA-2, SHA-3, Keccak, BLAKE2, BLAKE3, PBKDF2, Argon2, bcrypt, scrypt, Adler-32, CRC32, CRC32C, RIPEMD-160, HMAC, xxHash, SM3, Whirlpool)
Implementation of JSON Web Signatures
A JavaScript implementation of the JSON Object Signing and Encryption (JOSE) for current web browsers and node.js-based servers
A library implementing different string similarity
Package implements data structures and algorithms for processing various types of graphs
Public Key Infrastructure (PKI) is the basis of how identity and key management is performed on the web today. PKIjs is a pure JavaScript library implementing the formats that are used in PKI applications. It is built on WebCrypto and aspires to make it p
Parse CSS media query lists.
Diff::LCS computes the difference between two Enumerable sequences using the McIlroy-Hunt longest common subsequence (LCS) algorithm. It includes utilities to create a simple HTML diff output format and a standard diff-like tool. This is release 2.0, which has significant breaking changes (removal of deprecations and workarounds) and requires at least Ruby 3.2 or higher. See full details in the `CHANGELOG`, but users of diff-lcs should not notice any significant changes to the APIs. ==== To Install:
Common algorithms and data structures as Ruby C extensions
This gem includes the common data structures and algorithms.
As3 Crypto is a cryptography library written in Actionscript 3 that provides several common algorithms.
This module provides common interface to HMAC functionality. HMAC is a kind of "Message Authentication Code" (MAC) algorithm whose standard is documented in RFC2104. Namely, a MAC provides a way to check the integrity of information transmitted over or stored in an unreliable medium, based on a secret key. Originally written by Daiki Ueno. Converted to a RubyGem by Geoffrey Grosenbach
Match strings approximately using multiple algorithms: Levenshtein edit distance, Damerau-Levenshtein with transpositions, Jaro-Winkler similarity, Dice coefficient, Hamming distance, and Longest Common Subsequence. Includes token-based matching, weighted scoring, Soundex and Metaphone phonetic matching, ranked search, and deduplication.
Rainpress does not apply common compression algorithms like gzip, it removes unnecessary characters and replaces some attributes with a shorter equivalent name
FSelector is a Ruby gem that aims to integrate various feature selection algorithms and related functions into one single package. Welcome to contact me (need47@gmail.com) if you'd like to contribute your own algorithms or report a bug. FSelector allows user to perform feature selection by using either a single algorithm or an ensemble of multiple algorithms, and other common tasks including normalization and discretization on continuous data, as well as replace missing feature values with certain criterion. FSelector acts on a full-feature data set in either CSV, LibSVM or WEKA file format and outputs a reduced data set with only selected subset of features, which can later be used as the input for various machine learning softwares such as LibSVM and WEKA. FSelector, as a collection of filter methods, does not implement any classifier like support vector machines or random forest.
QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net 2.0 and up. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc... QuickGraph supports MSAGL, GLEE, and Graphviz to render the graphs, serialization to GraphML, etc...
* Vincenty wrote an algorithm for calculating the bearing and distance between two coordinates on the earth and an algorithm for finding a second coordinate, given a starting coordinate, bearing and destination. The algorithms model the earth as an ellipsoid, using the WGS-84 model. This is the common GPS model for mapping to latitudes and longitudes. This is a Ruby implementation of Vincenty's algorithms, and the Vincenty class includes two methods for modeling the earth as a sphere. These were added as a reference for testing the Vincenty algorithm, but could be used on their own. The package also makes use of several other classes that may be useful in their own Right. These include class Angle, class Latitude (subclass of Angle), class Longitude (subclass of Angle), class TrackAndBearing and class coordinate (which class Vincenty is a subclass) Angle requires extensions to Numeric and String to provide to_radians (to_r) and to_degrees (to_d). String also includes a to_decimal_degrees(), which converts most string forms of Latitude and Longitude to decimal form. These extensions are included in the package in core_extensions.rb. Float has also been extended to change round to have an optional argument specifying the number of decimal places to round to. This is fully compatible with the Float.round, as the default is to round to 0 decimal places. * The Vincenty code is based on the wikipedia presentation of the Vincenty algorithm http://en.wikipedia.org/wiki/Vincenty%27s_formulae . * The algorithm was modified to include changes I found at http://www.movable-type.co.uk/scripts/latlong-vincenty-direct.html. * I also altered the formulae to correctly return the bearing for angles greater than 180. * Vincenty's original publication ** T Vincenty, "Direct and Inverse Solutions of Geodesics on the Ellipsoid with application of nested equations", Survey Review, vol XXII no 176, 1975 http://www.ngs.noaa.gov/PUBS_LIB/inverse.pdf
SunRiseSet is a ruby class calculates the times of the sunrise, solar noon and sunset. It also calculates astronomical, naval and civil twilight times. Not sure of the origin of the algorithm. I have seen a fortran version http://www.srrb.noaa.gov/highlights/sunrise/program.txt a .pl www.mso.anu.edu.au/~brian/grbs/astrosubs.pl and .vb versions for spreadsheets too. All had the same comments, so are of a common origin.
An educational Ruby C extension implementing the Eisel-Lemire algorithm for string-to-float conversion. This gem demonstrates why this optimization, despite being ~2.6x faster for complex numbers, was NOT submitted to Ruby core: it regresses performance by ~9% on simple numbers (the common case). Use this gem to learn about float parsing algorithms and their tradeoffs, or if you specifically work with high-precision scientific data.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.