Custom function to hash values to improve faster comparaisons
Default compare function
Encode value to string using a simple non-colliding stable scheme.
Filter out all MISSING values from the object in-place
The object to filter
Returns the name of type as specified in the tag returned by a call to Object.prototype.toString
A value
Generate hash code This selected function is the result of benchmarking various hash functions. This version performs well and can hash 10^6 documents in ~3s with on average 100 collisions.
Returns the intersection between two arrays
The first array
The second array
Custom function to hash values, default the hashCode method
Result array
Check whether the given name passes for an operator. We assume AnyVal field name starting with '$' is an operator. This is cheap and safe to do since keys beginning with '$' should be reserved for internal use.
This is a generic memoization function
This implementation uses a cache independent of the function being memoized to allow old values to be garbage collected when the memoized function goes out of scope.
The function object to memoize
Deep merge objects or arrays. When the inputs have unmergeable types, the source value (right hand side) is returned. If inputs are arrays of same length and all elements are mergable, elements in the same position are merged together. If AnyVal of the elements are unmergeable, elements in the source are appended to the target.
the target to merge into
the source object
Removes an element from the container. If the selector resolves to an array and the leaf is a non-numeric key, the remove operation will be performed on objects of the array.
object or array
dot separated path to element to remove
Resolve the value of the field (dot separated) on the given object
the object context
dot separated path to field
Returns the full object to the resolved value given by the selector. This function excludes empty values as they aren't practically useful.
the object context
dot separated path to field
Returns a (stably) sorted copy of list, ranked in ascending order by the results of running each value through iteratee
This implementation treats null/undefined sort keys as less than every other type
The sort key function used to resolve sort keys
The comparator function to use for comparing keys. Defaults to standard comparison via compare(...)
Returns a new sorted array by the given key and comparator function
Return a new unique version of the collection
The input collection
A new collection with unique values
Generated using TypeDoc
Utility constants and functions