Javascript implementation of Luhn's Algorithm used for checking the validity of a Credit/Debit card 16 digit number.
JWA implementation (supports all JWS algorithms)
Implementation of JSON Web Signatures
Detect the indentation of code
Simple “Least Recently Used” (LRU) cache
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
Sniff the encoding from a HTML byte stream
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
The lightest signal library.
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
Parse a JSON string that has git merge conflicts, resolving if possible
The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement
Hashing made simple. Get the hash of a buffer/string/stream/file.
A JS library for finding optimal label position inside a polygon
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
SHA1 wrapper for browsers that prefers `window.crypto.subtle`.
graph algorithm
Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
Text hyphenation in Javascript.
Find the longest common subsequence.
oidc-token-hash validates (and generates) ID Token `_hash` claims such as `at_hash` or `c_hash`
Finite key-value map using the Least Recently Used (LRU) algorithm where the most recently used objects are keept in the map while less recently used items are evicted to make room for new ones.
LL(*) lookahead strategy for the Chevrotain parser library
A small implementation of the Luhn algorithm.
A simple Luhn-algorithm implementation
Luhn algorithm for computing checkdigits
A small implementation of the Luhn algorithm.
A lightweight implementation of the Luhn algorithm
Validate numbers using Luhn Algorithm
A simple fast implementation of the Luhn algorithm.
A Ruby gem to validate numbers with the Luhn algoritme
It's a simple tool that provides helper methods for credit card number validations using Luhn Algorithm.
Generate code with Luhn mod N algorithm using placeholder. e.g) Cdigits::Luhn.number('CA##-####-####-###?') #=> 'CA63-6485-2316-2675' Cdigits::Luhn.easy #=> '16TPF8RETL'
Verifies if the Credit/Debit Card is a valid card using Luhn's Algorithm. Returns True if yes, False if no
A simple Ruby utility to validate and generate Luhn-compliant numbers