Interactive decision framework for AI coding agents, adapted from Elon Musk's five-step production method. Walks you through one discrete question at a time to find the real bottleneck, reason from first principles, and commit to the simplest reliable app
Match a Unicode property or property alias to its canonical property name per the algorithm used for RegExp Unicode property escapes in ECMAScript.
Match a Unicode property or property alias to its canonical property name per the algorithm used for RegExp Unicode property escapes in ECMAScript.
detect-content-type implements the algorithm described at http://mimesniff.spec.whatwg.org/ to determine the Content-Type of the given data. It considers at most the first 512 bytes of data. It always returns a valid MIME type: if it cannot determine a mo
The Algorithm Deva manages algorithms ensuring Quinn Michaels and his intellectual property is managed properly.
Fast and robust triangle-triangle intersection test with high precision for cross and coplanar triangles based on the algorithm by Devillers & Guigue.
JWA implementation (supports all JWS algorithms)
The algorithm to find the maximum matching of the bipartite graph.
Implementation of JSON Web Signatures
The algorithm to find the maximum matching of the bipartite graph.
Package with the algorithm to generate password
CLI for APCA (Lc) accessibility contrast checking — the algorithm WCAG 3 is built around.
This package provides a linear-space refinement of the algorithm described in "An O(NP) sequence comparison algorithm" by Wu et al. (1989).
The algorithm continuously evaluates and scores open source software projects in supported package managers based on their impact and value to the OSS ecosystem.
The algorithm used to calculate distance between sets of positions for NRKs Valgomat
The algorithm continuously evaluates and scores open source software projects in supported package managers based on their impact and value to the OSS ecosystem.
The algorithm continuously evaluates and scores open source software projects in supported package managers based on their impact and value to the OSS ecosystem.
The algorithm continuously evaluates and scores open source software projects in supported package managers based on their impact and value to the OSS ecosystem.
The algorithm continuously evaluates and scores open source software projects in supported package managers based on their impact and value to the OSS ecosystem.
The algorithm continuously evaluates and scores open source software projects in supported package managers based on their impact and value to the OSS ecosystem.
This is code for generating a 'naming language', using the algorithm behind [@unchartedatlas][uncharted].
The algorithm continuously evaluates and scores open source software projects in supported package managers based on their impact and value to the OSS ecosystem.
The algorithm continuously evaluates and scores open source software projects in supported package managers based on their impact and value to the OSS ecosystem.
The algorithm continuously evaluates and scores open source software projects in supported package managers based on their impact and value to the OSS ecosystem.
A collection of text algorithms: Levenshtein, Soundex, Metaphone, Double Metaphone, Porter Stemming
bcrypt() is a sophisticated and secure hash algorithm designed by The OpenBSD project for hashing passwords. The bcrypt Ruby gem provides a simple wrapper for safely handling passwords.
The scrypt key derivation function is designed to be far more secure against hardware brute-force attacks than alternative functions such as PBKDF2 or bcrypt.
Topological sorting using Tarjan's algorithm
Objects and Algorithms for 2D Geometry
RubyRC4 is a pure Ruby implementation of the RC4 algorithm.
bcrypt() is a sophisticated and secure hash algorithm designed by The OpenBSD project for hashing passwords. The bcrypt Ruby gem provides a simple wrapper for safely handling passwords.
Implements a pretty printing algorithm for readable structure.
A Ruby implementation of the Patience diff algorithm. Patience Diff creates more readable diffs than other algorithms in some cases, particularly when much of the content has changed between the documents being compared. There's a great explanation and example [here][example]. Patience diff was originally written by Bram Cohen and is used in the [Bazaar][bazaar] version control system. This version is loosely based off the Python implementation in Bazaar. [example]: http://alfedenzo.livejournal.com/170301.html [bazaar]: http://bazaar.canonical.com/
A Ruby binding to the Ed25519 elliptic curve public-key signature system described in RFC 8032.
A small implementation of the Luhn algorithm.
CMAC algorithm
No description provided.
No description provided.
No description provided.
No description provided.