A library of dependency-free common insertion sort algorithms
An insertion sort algorithm for education purposes
A wrapper package that uses `useInsertionEffect` or a fallback for it
Fast JavaScript array sorting by implementing Python's Timsort algorithm
A JavaScript text diff implementation.
Sort an array using the merge-sort algorithm.
Alphanumeric sorting algorithm
JWA implementation (supports all JWS algorithms)
Implementation of JSON Web Signatures
A tiny and fast selection algorithm in JavaScript.
Javascript natural sort algorithm with unicode support.
Sort Sails/Express-style route addresses by inclusivity
Fast and tiny fuzzy-search utility
Compare alphanumeric strings the same way a human would, using a natural order algorithm
Find the first config file matching a given name in the current directory or the nearest ancestor directory.
TimSort: Fast Sorting for Node.js
TypeScript class that validates UK bank account details using the modulus checking algorithm.
Sort an Object or package.json based on the well-known package.json keys
Algorithms and data structures for your JavaScript and TypeScript projects 🧑💻
JSS plugin that ensures style properties extend each other instead of override
Easy autofixable import sorting
HFS Plus string utilities
A thing that is a lot like ES6 `Map`, but without iterators, for use in environments where `for..of` syntax and `Map` are not available.
PostCSS plugin for sorting and combining CSS media queries with mobile first / **desktop first methodologies
Calculates algorithms and data structures for sorting and searching. Selects best one to use for particular data set. Currently supports: Bubble Sort, Insertion Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort, Stack, Queue, Linked List, Binary Search Tree
Proper related posts plugin for Jekyll - uses document correlation matrix on TF-IDF (optionally with Latent Semantic Indexing). Each document is tokenized and stemmed, every word found is treated as keyword for analysis (except for some stop words). TF-IDF matrix for the whole site is calculated (including extra provided weights), then if given accuraccy is lower than 1.0, LSI algorithm is used to compute new simplified vector space. Document correlation matrix is created using dot product of the matrix and its transpose. For each of the post' related documents are inserted into priority queue (sorted by score from document correlation matrix), assuming the score is greater than minimal required score. Selected few bests related posts are retrieven from the queue. Liquid template for each post is rendered and <related-posts /> is replaced with the outcomes of algorithm.
No description provided.
No description provided.