prcp
A tiny and fast perceptual image hashing algorithm
A tiny and fast perceptual image hashing algorithm
this package provides validation of PAN Card of an individual. (Made in India)
Compare two string/text and find their similarity
A quite fast non-recursive permutation algorithm, Steinhaus–Johnson–Trotter algorithm (Even's speedup)
Compute a percentage repartition based on possibly fixed percentage values in a dataset
Checks if a number is prime or not
Fast leaky bucket algorithm implementation without timers
TypeScript implementation of the Porter Stemmer algorithm
Potsiu! is a simple utility function that allows you to update indexes of specific positions on a string after you apply some transformation to it. It is quite handy if you have data in which string indexes are specified, but for some reason you want to p
TS package contains parentheses valid functions
Rankr helps you score data sets based on multiple criterias.
Rapid Asymmetric Maximum (RAM) is a high throughput, hash-less, byte shift-resistant content-defined chunking algorithm for data deduplication.
algorithm
A lightning-fast implementation of the Levenshtein distance algorithm. Written in AssemblyScript, compiled to WebAssembly, and optimized for speed.
Queue, ArrayQueue. Javascript & Typescript Data Structure.
Just the cutest and tiniest queue/deque implementation!
Quartz plugin to render pseudocode at build-time using pseudocode.js. Works transparently with the Obsidian plugin obsidian-pseudocode.
Construct Merkle Trees and verify proofs
Implementation of Disjoint-set data structure algorithm (also called a union–find data structure or merge–find set).
A lightweight and efficient implementation of the Munkres (Hungarian) algorithm for optimal assignment in square and rectangular matrices.