1.冒泡算法 2.快速排序 3.插入排序,4数组去重,5.质数判定,6.日历算法,7.颜色轮训算法,8.类的多重继承 9.生成随机数
JWA implementation (supports all JWS algorithms)
Implementation of JSON Web Signatures
Detect the indentation of code
Simple “Least Recently Used” (LRU) cache
Sniff the encoding from a HTML byte stream
Efficient implementation of Levenshtein algorithm with locale-specific collator support.
The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
Fast 2D concave hull algorithm in JavaScript (generates an outline of a point set)
The lightest signal library.
An implementation of the Unicode Line Breaking Algorithm (UAX #14)
The fCoSE layout for Cytoscape.js by Bilkent with fast compound node placement
Parse a JSON string that has git merge conflicts, resolving if possible
Hashing made simple. Get the hash of a buffer/string/stream/file.
A JS library for finding optimal label position inside a polygon
SHA1 wrapper for browsers that prefers `window.crypto.subtle`.
A point in polygon based on the paper Optimal Reliable Point-in-Polygon Test and Differential Coding Boolean Operations on Polygons
Martinez polygon clipping algorithm, does boolean operation on polygons (multipolygons, polygons with holes etc): intersection, union, difference, xor
graph algorithm
Text hyphenation in Javascript.
Find the longest common subsequence.
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.
oidc-token-hash validates (and generates) ID Token `_hash` claims such as `at_hash` or `c_hash`
UnRS Resolver Node API