node's assert.deepEqual algorithm except for NaN being equal to NaN
Measure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm
node's assert.deepEqual algorithm
Compare strings containing a mix of letters and numbers in the way a human being would in sort order.
Compare DNS record strings for equality
Type check values
TimSort: Fast Sorting for Node.js
Damerau - Levenshtein distance by The Spanish Inquisition + relative distance
Like lodash isEqualWith but for shallow equal.
compare two semver version strings, returning -1, 0, or 1
Does a shallow comparison of two objects, returning false if the keys or values differ.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Fastest deep equal comparison for React. Great for React.memo & shouldComponentUpdate. Also really fast general-purpose deep comparison.
Compare semver version strings to find greater, equal or lesser.
Minimalistic shallow equality check for arrays/objects
Get a compare function for array to sort
Basic sort algorithm that has similar behavior to Array.prototype.sort for null and undefined, but also allows sorting by an object property.
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.