diff --git a/README.md b/README.md
index 0b9caee..277e499 100644
--- a/README.md
+++ b/README.md
@@ -48,7 +48,7 @@ Lamb it's also delivered on a CDN, courtesy of [npmcdn](https://npmcdn.com/):
The URL above will retrieve the latest version, but you can target a specific version too:
```html
-
+
```
## Semantic Versioning.
@@ -85,6 +85,11 @@ You can refer to the [changelog](#changelog) to see if your code is affected.
## Changelog
+- **v0.17.0 - *2016/03/29***
+ - **Minor API change (shouldn't affect anyone):** changed integer conversions in `isIn`, `transpose` and currying functions
+ - **API change**: `getAt` no longer accepts strings as indexes
+ - Added `getArgAt` and `setAt`
+
- **v0.16.0 - *2016/03/23***
- **Fully compatible with versions down to 0.15.x**
- Added `init`, `tail`, `getAt`, `head`, `last`
diff --git a/dist/lamb.js b/dist/lamb.js
index 4e0119d..75bde76 100644
--- a/dist/lamb.js
+++ b/dist/lamb.js
@@ -1,7 +1,7 @@
/**
* @overview lamb - A lightweight, and docile, JavaScript library to help embracing functional programming.
* @author Andrea Scartabelli
- * @version 0.16.0
+ * @version 0.17.0
* @module lamb
* @license MIT
* @preserve
@@ -18,7 +18,7 @@
* @category Core
* @type String
*/
- lamb._version = "0.16.0";
+ lamb._version = "0.17.0";
// alias used as a placeholder argument for partial application
var _ = lamb;
@@ -578,7 +578,7 @@
/**
* Retrieves the element at the given index in an array-like object.
* Like {@link module:lamb.slice|slice} the index can be negative.
- * If the index isn't supplied, or if its value it's out of the array-like bounds,
+ * If the index isn't supplied, or if its value isn't an integer within the array-like bounds,
* the function will return undefined.
* @example
* var getFifthElement = _.getAt(4);
@@ -600,7 +600,7 @@
*/
function getAt (index) {
return function (arrayLike) {
- return arrayLike[index < 0 ? index + arrayLike.length : index];
+ return Math.floor(index) === index ? arrayLike[index < 0 ? index + arrayLike.length : index] : void 0;
};
}
@@ -663,7 +663,7 @@
* @returns {Object}
*/
function group (arrayLike, iteratee, iterateeContext) {
- var result = {};
+ var result = {};
var len = arrayLike.length;
for (var i = 0, element; i < len; i++) {
@@ -799,7 +799,7 @@
function isIn (arrayLike, value, fromIndex) {
var result = false;
- for (var i = fromIndex | 0, len = arrayLike.length; i < len; i++) {
+ for (var i = fromIndex >>> 0, len = arrayLike.length; i < len; i++) {
if (isSVZ(value, arrayLike[i])) {
result = true;
break;
@@ -870,6 +870,7 @@
*
* @memberof module:lamb
* @category Array
+ * @see {@link module:lamb.partitionWith|partitionWith}
* @param {ArrayLike} arrayLike
* @param {ListIteratorCallback} predicate
* @param {Object} [predicateContext]
@@ -911,6 +912,7 @@
*
* @memberof module:lamb
* @category Array
+ * @see {@link module:lamb.partition|partition}
* @param {ListIteratorCallback} predicate
* @param {Object} [predicateContext]
* @returns {Function}
@@ -941,6 +943,7 @@
*
* @memberof module:lamb
* @category Array
+ * @see {@link module:lamb.pluckKey|pluckKey}
* @param {ArrayLike} arrayLike
* @param {String} key
* @returns {Array}
@@ -965,6 +968,7 @@
*
* @memberof module:lamb
* @category Array
+ * @see {@link module:lamb.pluck|pluck}
* @function
* @param {String} key
* @returns {Function}
@@ -973,6 +977,42 @@
return mapWith(getKey(key));
}
+ /**
+ * Builds a function that creates a copy of an array-like object with the given
+ * index changed to the provided value.
+ * If the index is not an integer or if it's out of bounds, the function
+ * will return a copy of the original array.
+ * Negative indexes are allowed.
+ * @example
+ * var arr = [1, 2, 3, 4, 5];
+ *
+ * _.setAt(2, 99)(arr) // => [1, 2, 99, 4, 5]
+ * arr // => [1, 2, 3, 4, 5]
+ *
+ * _.setAt(10, 99)(arr) // => [1, 2, 3, 4, 5] (not a reference to `arr`)
+ *
+ * @example Using negative indexes
+ * _.setAt(-1, 99)(arr) // => [1, 2, 3, 4, 99]
+ *
+ * @memberof module:lamb
+ * @category Array
+ * @param {Number} index
+ * @param {*} value
+ * @returns {Function}
+ */
+ function setAt (index, value) {
+ return function (arrayLike) {
+ var result = slice(arrayLike);
+ var len = arrayLike.length;
+
+ if (clamp(index, -len, len - 1) === Math.floor(index)) {
+ result[index + (index < 0 ? len : 0)] = value;
+ }
+
+ return result;
+ };
+ }
+
/**
* Flattens the "first level" of an array.
* See also {@link module:lamb.flatten|flatten}.
@@ -1103,7 +1143,7 @@
*/
function transpose (arrayLike) {
var result = [];
- var minLen = apply(Math.min, pluck(arrayLike, "length")) | 0;
+ var minLen = apply(Math.min, pluck(arrayLike, "length")) >>> 0;
var len = arrayLike.length;
for (var i = 0, j; i < minLen; i++) {
@@ -1236,6 +1276,7 @@
lamb.partitionWith = partitionWith;
lamb.pluck = pluck;
lamb.pluckKey = pluckKey;
+ lamb.setAt = setAt;
lamb.shallowFlatten = shallowFlatten;
lamb.tail = tail;
lamb.take = take;
@@ -1558,7 +1599,7 @@
return a.length ? [a[0]] : [];
};
- if ((arity | 0) !== arity) {
+ if ((arity >>> 0) !== arity) {
arity = fn.length;
}
@@ -1787,6 +1828,31 @@
};
}
+ /**
+ * Builds a function that returns the argument received at the given index.
+ * As with {@link module:lamb.getAt|getAt} negative indexes are allowed.
+ * The resulting function will return undefined if no arguments are
+ * passed or if the index is out of bounds.
+ * @example
+ * var getFirstArg = getArgAt(0);
+ * var getLastArg = getArgAt(-1);
+ *
+ * getFirstArg(1, 2, 3) // => 1
+ * getLastArg(1, 2, 3) // => 3
+ *
+ * getArgAt()(1, 2, 3) // => undefined
+ * getArgAt(6)(1, 2, 3) // => undefined
+ * getArgAt(1)() // => undefined
+ *
+ * @memberof module:lamb
+ * @category Function
+ * @param {Number} index
+ * @returns {Function}
+ */
+ function getArgAt (index) {
+ return compose(getAt(index), list);
+ }
+
/**
* Accepts an object and builds a function expecting a method name, and optionally arguments, to call on such object.
* Like {@link module:lamb.invoker|invoker}, if no method with the given name is found the function will return undefined.
@@ -2010,6 +2076,7 @@
lamb.curryableRight = curryableRight;
lamb.debounce = debounce;
lamb.flip = flip;
+ lamb.getArgAt = getArgAt;
lamb.invokerOn = invokerOn;
lamb.invoker = invoker;
lamb.mapArgs = mapArgs;
@@ -2082,6 +2149,7 @@
*
* @memberof module:lamb
* @category Logic
+ * @see {@link module:lamb.anyOf|anyOf}
* @param {...Function} predicate
* @returns {Function}
*/
@@ -2112,6 +2180,7 @@
*
* @memberof module:lamb
* @category Logic
+ * @see {@link module:lamb.allOf|allOf}
* @param {...Function} predicate
* @returns {Function}
*/
@@ -3040,6 +3109,7 @@
*
* @memberof module:lamb
* @category Object
+ * @see {@link module:lamb.pickIf|pickIf}
* @param {Object} source
* @param {String[]} whitelist
* @returns {Object}
@@ -3067,6 +3137,7 @@
*
* @memberof module:lamb
* @category Object
+ * @see {@link module:lamb.pick|pick}
* @param {ObjectIteratorCallback} predicate
* @param {Object} [predicateContext]
* @returns {Function}
@@ -3095,6 +3166,7 @@
*
* @memberof module:lamb
* @category Object
+ * @see {@link module:lamb.skipIf|skipIf}
* @param {Object} source
* @param {String[]} blacklist
* @returns {Object}
@@ -3122,6 +3194,7 @@
*
* @memberof module:lamb
* @category Object
+ * @see {@link module:lamb.skip|skip}
* @param {ObjectIteratorCallback} predicate
* @param {Object} [predicateContext]
* @returns {Function}
diff --git a/dist/lamb.min.js b/dist/lamb.min.js
index 34ad30c..81372d4 100644
--- a/dist/lamb.min.js
+++ b/dist/lamb.min.js
@@ -1,10 +1,10 @@
/**
* @overview lamb - A lightweight, and docile, JavaScript library to help embracing functional programming.
* @author Andrea Scartabelli
- * @version 0.16.0
+ * @version 0.17.0
* @module lamb
* @license MIT
* @preserve
*/
-!function(n){"use strict";function r(n){return function(){return n}}function t(){var n=arguments;return function(){for(var r=arguments,t=n.length;t--;)r=[n[t].apply(this,r)];return r[0]}}function e(n){return n}function u(n){var r=or(arguments,1);return function(){for(var t,e=0,u=[],i=r.length,o=0;i>o;o++)t=r[o],u[o]=t===Jn?arguments[e++]:t;for(var c=arguments.length;c>e;e++)u.push(arguments[e]);return n.apply(this,u)}}function i(n,r,t){for(var e=-1,u=n.length;++ei;i++)if(u=n[i],r.call(t,u,i,n)){e=u;break}return e}function s(n,r,t){for(var e=-1,u=0,i=n.length;i>u;u++)if(r.call(t,n[u],u,n)){e=u;break}return e}function h(n,r){return u(ar,Jn,n,r)}function v(n){return o(n,[])}function y(n){return function(r){return r[0>n?n+r.length:n]}}function d(n,r,t){for(var e,u={},i=n.length,o=0;i>o;o++){e=n[o];var c=r.call(t,e,o,n);c in u?u[c].push(e):u[c]=[e]}return u}function g(n,r){return u(d,Jn,n,r)}function m(){var n=or(arguments,1);return T(arguments[0]).filter(function(r){return n.every(c(r))})}function b(n,r,t){for(var e=!1,u=0|t,i=n.length;i>u;u++)if(sn(r,n[u])){e=!0;break}return e}function k(){return 1===arguments.length?[arguments[0]]:Array.apply(null,arguments)}function O(n,r){return u(er,Jn,n,r)}function w(n,r,t){for(var e,u=[[],[]],i=n.length,o=0;i>o;o++)e=n[o],u[r.call(t,e,o,n)?0:1].push(e);return u}function x(n,r){return u(w,Jn,n,r)}function j(n,r){return er(n,Ar(r))}function W(n){return O(Ar(n))}function E(n){return Qn.concat.apply([],n)}function M(n,r){return function(t){return or(t,0,i(t,n,r))}}function A(n){for(var r,t=[],e=0|q(Math.min,j(n,"length")),u=n.length,i=0;e>i;i++)for(t.push([]),r=0;u>r;r++)t[i][r]=n[r][i];return t}function T(n,r,t){"function"!=typeof r&&(r=e);for(var u,i=[],o=[],c=0;cr||n!==n?t=1:(r>n||r!==r)&&(t=-1)),t}function N(n){var r=n.length;return function(t,e){for(var u,i,o=0,c=0;r>c;c++)if(i=n[c],o=i.compare(t.value,e.value),0!==o){u=n[c].isDescending;break}return 0===o&&(u=n[r-1].isDescending,o=t.index-e.index),u?-o:o}}function R(n,r,t,e,u){if(0===n.length)return 0;var i=e+u>>1,o=t({value:r,index:i},{value:n[i],index:i});return 1>=u-e?0>o?i:i+1:0>o?R(n,r,t,e,i):0===o?i+1:R(n,r,t,i,u)}function D(n){return n.length?n.map(F):[K()]}function F(n){return"function"==typeof Object(n).compare?n:K(n)}function K(n,r,t){return{isDescending:r===!0,compare:function(r,u){return"function"==typeof n&&n!==e&&(r=n(r),u=n(u)),(t||I)(r,u)}}}function P(n,r){var t=D(or(arguments,2)),e=n.concat(),u=R(n,r,N(t),0,n.length);return e.splice(u,0,r),e}function z(n){for(var r=D(or(arguments,1)),t=[],e=[],u=n.length,i=0;u>i;i++)t.push({value:n[i],index:i});for(t.sort(N(r)),i=0;u>i;i++)e.push(t[i].value);return e}function S(){var n=or(arguments);return function(r){return z.apply(null,[r].concat(n))}}function L(n,r,t,e,u){return function(){var i=u.concat(e(arguments));return i.length>=r?n.apply(this,t?i.reverse():i):L(n,r,t,e,i)}}function V(n,r,t,e){var u=e?or:function(n){return n.length?[n[0]]:[]};return(0|r)!==r&&(r=n.length),L(n,r,t,u,[])}function q(n,r){return n.apply(n,or(r))}function G(n,r){return function(){return q(n,or(arguments,0,r))}}function B(n){return function(r,t){return n(r,t)}}function U(n,r){return V(n,r,!1)}function Z(n,r){return V(n,r,!0)}function $(n,r){return V(n,r,!1,!0)}function _(n,r){return V(n,r,!0,!0)}function C(n,r){var t;return function(){var e=this,u=arguments,i=function(){t=null,n.apply(e,u)};clearTimeout(t),t=setTimeout(i,r)}}function H(n){return function(){var r=or(arguments).reverse();return n.apply(this,r)}}function J(n){return function(r){var t=or(arguments,1),e=n[r];return"Function"===Cn(e)?e.apply(n,t):void 0}}function Q(n){var r=or(arguments,1);return function(t){var e=or(arguments,1),u=t[n];return"Function"===Cn(u)?u.apply(t,r.concat(e)):void 0}}function X(n,r){return t(u(q,n),O(r),k)}function Y(n){var r=or(arguments,1);return function(){for(var t=arguments.length,e=[],u=0;t>u;u++)e.push(r[u]?r[u](arguments[u]):arguments[u]);return n.apply(this,e)}}function nn(n,r){var t,e=0;return function(){var u=Date.now();return u-e>=r&&(e=u,t=n.apply(this,arguments)),t}}function rn(n){return function(r){return n(r)}}function tn(){var n=or(arguments);return function(){for(var r,t=n.length,e=0;t>e&&(r=q(n[e],arguments),_n(r));e++);return r}}function en(){var n=or(arguments);return function(){var r=arguments;return n.every(function(n){return n.apply(null,r)})}}function un(){var n=or(arguments);return function(){var r=arguments;return n.some(function(n){return n.apply(null,r)})}}function on(n,r,t){return function(){var e=Or(arguments);return e(n)?e(r):t?e(t):void 0}}function cn(n,r){return 0===n&&0===r?1/n===1/r:sn(n,r)}function fn(n,r){return n>r}function an(n,r){return n>=r}function ln(n,r){return r>n}function pn(n,r){return r>=n}function sn(n,r){return n!==n?r!==r:n===r}function hn(n){return function(){return!n.apply(null,arguments)}}function vn(n,r){return n+r}function yn(n,r,t){return r>n?r:n>t?t:n}function dn(n,r){return n/r}function gn(n,r){return n-r*Math.floor(n/r)}function mn(n,r){return n*r}function bn(n,r){return Math.floor(Math.random()*(r-n+1)+n)}function kn(n,r,t){if(0===t||arguments.length<2)return[n];t||(t=1);var e=Math.max(Math.ceil((r-n)/t),0);return wn(n,e,u(vn,t))}function On(n,r){return n%r}function wn(n,r,t,e){for(var u=[n],i=0,o=r-1;o>i;i++)u.push(t.call(e,u[i],i,u));return u}function xn(n,r){return n-r}function jn(n,r){return-1===r.indexOf(n)&&(r.push(Object.freeze(n)),Object.getOwnPropertyNames(n).forEach(function(t){var e=n[t];"object"!=typeof e||Zn(e)||jn(e,r)})),n}function Wn(n){return[n,this[n]]}function En(n){return ur(or(arguments,1),function(r,t){return tr(n(t),function(n){r[n]=t[n]}),r},{})}function Mn(n,r,t,e){return function(i){var o=u(Nn,i,Jn,e);return n.apply(i,t.map(o))?[]:[r,t]}}function An(n){var r=[];for(var t in n)r.push(t);return r}function Tn(n){var r={};return n.forEach(function(n){r[n[0]]=n[1]}),r}function In(n,r){return n[r]}function Nn(n,r,t){return r.split(t||".").reduce(In,n)}function Rn(n,r){return r in n}function Dn(n){return jn(n,[])}function Fn(n,r){for(var t={},e=r.length,u=0,i=n.length;i>u;u++)t[n[u]]=e>u?r[u]:void 0;return t}function Kn(n,r){var t={};return r.forEach(function(r){r in n&&(t[r]=n[r])}),t}function Pn(n,r){return function(t){var e={};for(var u in t)n.call(r,t[u],u,t)&&(e[u]=t[u]);return e}}function zn(n,r){var t={};for(var e in n)-1===r.indexOf(e)&&(t[e]=n[e]);return t}function Sn(n,r){return Pn(hn(n),r)}function Ln(n,r){return r.reduce(function(r,t){var e=t(n);return e.length&&r.push(e),r},[])}function Vn(n,r,t){return Bn(r[0]||" ",Math.ceil(t-n.length))}function qn(n,r,t){return Vn(n,r,t)+n}function Gn(n,r,t){return n+Vn(n,r,t)}function Bn(n,r){for(var t="",e=0;r>e;e++)t+=n;return t}function Un(n){return Yn.test.bind(n)}function Zn(n){return null===n}function $n(n){return function(r){return Cn(r)===n}}function _n(n){return void 0===n}function Cn(n){return Xn.toString.call(n).replace(/^\[\w+\s+|\]$/g,"")}var Hn=Object.create(null);Hn._version="0.16.0";var Jn=Hn,Qn=Array.prototype,Xn=Object.prototype,Yn=RegExp.prototype,nr=Function.bind.bind(Function.call);Hn.always=r,Hn.compose=t,Hn.generic=nr,Hn.identity=e,Hn.partial=u;var rr=nr(Qn.filter),tr=nr(Qn.forEach),er=nr(Qn.map),ur=nr(Qn.reduce),ir=nr(Qn.reduceRight),or=nr(Qn.slice);Hn.filter=rr,Hn.forEach=tr,Hn.map=er,Hn.reduce=ur,Hn.reduceRight=ir,Hn.slice=or;var cr=B(or),fr=V(cr,2,!0),ar=t(E,er),lr=y(0),pr=u(or,Jn,0,-1),sr=y(-1),hr=u(or,Jn,1,void 0),vr=u(or,Jn,0,Jn),yr=V(vr,2,!0),dr=t(T,h(rn(or)),k),gr=t(A,k),mr=O(B(k));Hn.contains=c,Hn.difference=f,Hn.drop=cr,Hn.dropN=fr,Hn.dropWhile=a,Hn.filterWith=l,Hn.find=p,Hn.findIndex=s,Hn.flatMap=ar,Hn.flatMapWith=h,Hn.flatten=v,Hn.getAt=y,Hn.group=d,Hn.groupBy=g,Hn.head=lr,Hn.init=pr,Hn.intersection=m,Hn.isIn=b,Hn.last=sr,Hn.list=k,Hn.mapWith=O,Hn.partition=w,Hn.partitionWith=x,Hn.pluck=j,Hn.pluckKey=W,Hn.shallowFlatten=E,Hn.tail=hr,Hn.take=vr,Hn.takeN=yr,Hn.takeWhile=M,Hn.transpose=A,Hn.union=dr,Hn.uniques=T,Hn.zip=gr,Hn.zipWithIndex=mr;var br=u(K,Jn,!1,Jn),kr=u(K,Jn,!0,Jn);Hn.insert=P,Hn.sort=z,Hn.sorter=br,Hn.sorterDesc=kr,Hn.sortWith=S;var Or=V(q,2,!0),wr=H(t),xr=B(H(u));Hn.apply=q,Hn.applyArgs=Or,Hn.aritize=G,Hn.binary=B,Hn.curry=U,Hn.curryRight=Z,Hn.curryable=$,Hn.curryableRight=_,Hn.debounce=C,Hn.flip=H,Hn.invokerOn=J,Hn.invoker=Q,Hn.mapArgs=X,Hn.pipe=wr,Hn.tapArgs=Y,Hn.throttle=nn,Hn.unary=rn,Hn.wrap=xr;var jr=hn(cn);Hn.adapter=tn,Hn.allOf=en,Hn.anyOf=un,Hn.condition=on,Hn.is=cn,Hn.isGT=fn,Hn.isGTE=an,Hn.isLT=ln,Hn.isLTE=pn,Hn.isNot=jr,Hn.isSVZ=sn,Hn.not=hn,Hn.add=vn,Hn.clamp=yn,Hn.divide=dn,Hn.modulo=gn,Hn.multiply=mn,Hn.randomInt=bn,Hn.range=kn,Hn.remainder=On,Hn.sequence=wn,Hn.subtract=xn;var Wr=V(function(n,r){return n(r).map(Wn,r)}),Er=V(function(n,r){return n(r).reduce(function(n,t){return n[0].push(t),n[1].push(r[t]),n},[[],[]])}),Mr=V(function(n,r){return n(r).map(u(In,r))}),Ar=V(In,2,!0),Tr=V(Rn,2,!0),Ir=function(n,r){return t(u(cn,r),Ar(n))},Nr=nr(Xn.hasOwnProperty),Rr=V(Nr,2,!0),Dr=u(En,An),Fr=u(En,Object.keys),Kr=Wr(Object.keys),Pr=Mr(Object.keys),zr=Wr(An),Sr=Er(An),Lr=Er(Object.keys),Vr=V(Ln,2,!0),qr=Mr(An);Hn.checker=Mn,Hn.enumerables=An,Hn.fromPairs=Tn,Hn.get=In,Hn.getKey=Ar,Hn.getWithPath=Nn,Hn.has=Rn,Hn.hasKey=Tr,Hn.hasKeyValue=Ir,Hn.hasOwn=Nr,Hn.hasOwnKey=Rr,Hn.immutable=Dn,Hn.make=Fn,Hn.merge=Dr,Hn.mergeOwn=Fr,Hn.ownPairs=Kr,Hn.ownValues=Pr,Hn.pairs=zr,Hn.pick=Kn,Hn.pickIf=Pn,Hn.skip=zn,Hn.skipIf=Sn,Hn.tear=Sr,Hn.tearOwn=Lr,Hn.validate=Ln,Hn.validateWith=Vr,Hn.values=qr,Hn.padLeft=qn,Hn.padRight=Gn,Hn.repeat=Bn,Hn.testWith=Un;var Gr=un(Zn,_n);Hn.isNil=Gr,Hn.isNull=Zn,Hn.isType=$n,Hn.isUndefined=_n,Hn.type=Cn,"object"==typeof exports?module.exports=Hn:"function"==typeof define&&define.amd?define(function(){return Hn}):n.lamb=Hn}(this);
+!function(n){"use strict";function r(n){return function(){return n}}function t(){var n=arguments;return function(){for(var r=arguments,t=n.length;t--;)r=[n[t].apply(this,r)];return r[0]}}function e(n){return n}function u(n){var r=fr(arguments,1);return function(){for(var t,e=0,u=[],i=r.length,o=0;i>o;o++)t=r[o],u[o]=t===Xn?arguments[e++]:t;for(var c=arguments.length;c>e;e++)u.push(arguments[e]);return n.apply(this,u)}}function i(n,r,t){for(var e=-1,u=n.length;++ei;i++)if(u=n[i],r.call(t,u,i,n)){e=u;break}return e}function s(n,r,t){for(var e=-1,u=0,i=n.length;i>u;u++)if(r.call(t,n[u],u,n)){e=u;break}return e}function h(n,r){return u(pr,Xn,n,r)}function v(n){return o(n,[])}function y(n){return function(r){return Math.floor(n)===n?r[0>n?n+r.length:n]:void 0}}function d(n,r,t){for(var e,u={},i=n.length,o=0;i>o;o++){e=n[o];var c=r.call(t,e,o,n);c in u?u[c].push(e):u[c]=[e]}return u}function g(n,r){return u(d,Xn,n,r)}function m(){var n=fr(arguments,1);return I(arguments[0]).filter(function(r){return n.every(c(r))})}function b(n,r,t){for(var e=!1,u=t>>>0,i=n.length;i>u;u++)if(vn(r,n[u])){e=!0;break}return e}function k(){return 1===arguments.length?[arguments[0]]:Array.apply(null,arguments)}function O(n,r){return u(ir,Xn,n,r)}function w(n,r,t){for(var e,u=[[],[]],i=n.length,o=0;i>o;o++)e=n[o],u[r.call(t,e,o,n)?0:1].push(e);return u}function x(n,r){return u(w,Xn,n,r)}function j(n,r){return ir(n,Ir(r))}function A(n){return O(Ir(n))}function M(n,r){return function(t){var e=fr(t),u=t.length;return gn(n,-u,u-1)===Math.floor(n)&&(e[n+(0>n?u:0)]=r),e}}function W(n){return Yn.concat.apply([],n)}function E(n,r){return function(t){return fr(t,0,i(t,n,r))}}function T(n){for(var r,t=[],e=G(Math.min,j(n,"length"))>>>0,u=n.length,i=0;e>i;i++)for(t.push([]),r=0;u>r;r++)t[i][r]=n[r][i];return t}function I(n,r,t){"function"!=typeof r&&(r=e);for(var u,i=[],o=[],c=0;cr||n!==n?t=1:(r>n||r!==r)&&(t=-1)),t}function R(n){var r=n.length;return function(t,e){for(var u,i,o=0,c=0;r>c;c++)if(i=n[c],o=i.compare(t.value,e.value),0!==o){u=n[c].isDescending;break}return 0===o&&(u=n[r-1].isDescending,o=t.index-e.index),u?-o:o}}function D(n,r,t,e,u){if(0===n.length)return 0;var i=e+u>>1,o=t({value:r,index:i},{value:n[i],index:i});return 1>=u-e?0>o?i:i+1:0>o?D(n,r,t,e,i):0===o?i+1:D(n,r,t,i,u)}function F(n){return n.length?n.map(K):[P()]}function K(n){return"function"==typeof Object(n).compare?n:P(n)}function P(n,r,t){return{isDescending:r===!0,compare:function(r,u){return"function"==typeof n&&n!==e&&(r=n(r),u=n(u)),(t||N)(r,u)}}}function z(n,r){var t=F(fr(arguments,2)),e=n.concat(),u=D(n,r,R(t),0,n.length);return e.splice(u,0,r),e}function S(n){for(var r=F(fr(arguments,1)),t=[],e=[],u=n.length,i=0;u>i;i++)t.push({value:n[i],index:i});for(t.sort(R(r)),i=0;u>i;i++)e.push(t[i].value);return e}function L(){var n=fr(arguments);return function(r){return S.apply(null,[r].concat(n))}}function V(n,r,t,e,u){return function(){var i=u.concat(e(arguments));return i.length>=r?n.apply(this,t?i.reverse():i):V(n,r,t,e,i)}}function q(n,r,t,e){var u=e?fr:function(n){return n.length?[n[0]]:[]};return r>>>0!==r&&(r=n.length),V(n,r,t,u,[])}function G(n,r){return n.apply(n,fr(r))}function B(n,r){return function(){return G(n,fr(arguments,0,r))}}function U(n){return function(r,t){return n(r,t)}}function Z(n,r){return q(n,r,!1)}function $(n,r){return q(n,r,!0)}function _(n,r){return q(n,r,!1,!0)}function C(n,r){return q(n,r,!0,!0)}function H(n,r){var t;return function(){var e=this,u=arguments,i=function(){t=null,n.apply(e,u)};clearTimeout(t),t=setTimeout(i,r)}}function J(n){return function(){var r=fr(arguments).reverse();return n.apply(this,r)}}function Q(n){return t(y(n),k)}function X(n){return function(r){var t=fr(arguments,1),e=n[r];return"Function"===Jn(e)?e.apply(n,t):void 0}}function Y(n){var r=fr(arguments,1);return function(t){var e=fr(arguments,1),u=t[n];return"Function"===Jn(u)?u.apply(t,r.concat(e)):void 0}}function nn(n,r){return t(u(G,n),O(r),k)}function rn(n){var r=fr(arguments,1);return function(){for(var t=arguments.length,e=[],u=0;t>u;u++)e.push(r[u]?r[u](arguments[u]):arguments[u]);return n.apply(this,e)}}function tn(n,r){var t,e=0;return function(){var u=Date.now();return u-e>=r&&(e=u,t=n.apply(this,arguments)),t}}function en(n){return function(r){return n(r)}}function un(){var n=fr(arguments);return function(){for(var r,t=n.length,e=0;t>e&&(r=G(n[e],arguments),Hn(r));e++);return r}}function on(){var n=fr(arguments);return function(){var r=arguments;return n.every(function(n){return n.apply(null,r)})}}function cn(){var n=fr(arguments);return function(){var r=arguments;return n.some(function(n){return n.apply(null,r)})}}function fn(n,r,t){return function(){var e=xr(arguments);return e(n)?e(r):t?e(t):void 0}}function an(n,r){return 0===n&&0===r?1/n===1/r:vn(n,r)}function ln(n,r){return n>r}function pn(n,r){return n>=r}function sn(n,r){return r>n}function hn(n,r){return r>=n}function vn(n,r){return n!==n?r!==r:n===r}function yn(n){return function(){return!n.apply(null,arguments)}}function dn(n,r){return n+r}function gn(n,r,t){return r>n?r:n>t?t:n}function mn(n,r){return n/r}function bn(n,r){return n-r*Math.floor(n/r)}function kn(n,r){return n*r}function On(n,r){return Math.floor(Math.random()*(r-n+1)+n)}function wn(n,r,t){if(0===t||arguments.length<2)return[n];t||(t=1);var e=Math.max(Math.ceil((r-n)/t),0);return jn(n,e,u(dn,t))}function xn(n,r){return n%r}function jn(n,r,t,e){for(var u=[n],i=0,o=r-1;o>i;i++)u.push(t.call(e,u[i],i,u));return u}function An(n,r){return n-r}function Mn(n,r){return-1===r.indexOf(n)&&(r.push(Object.freeze(n)),Object.getOwnPropertyNames(n).forEach(function(t){var e=n[t];"object"!=typeof e||_n(e)||Mn(e,r)})),n}function Wn(n){return[n,this[n]]}function En(n){return or(fr(arguments,1),function(r,t){return ur(n(t),function(n){r[n]=t[n]}),r},{})}function Tn(n,r,t,e){return function(i){var o=u(Dn,i,Xn,e);return n.apply(i,t.map(o))?[]:[r,t]}}function In(n){var r=[];for(var t in n)r.push(t);return r}function Nn(n){var r={};return n.forEach(function(n){r[n[0]]=n[1]}),r}function Rn(n,r){return n[r]}function Dn(n,r,t){return r.split(t||".").reduce(Rn,n)}function Fn(n,r){return r in n}function Kn(n){return Mn(n,[])}function Pn(n,r){for(var t={},e=r.length,u=0,i=n.length;i>u;u++)t[n[u]]=e>u?r[u]:void 0;return t}function zn(n,r){var t={};return r.forEach(function(r){r in n&&(t[r]=n[r])}),t}function Sn(n,r){return function(t){var e={};for(var u in t)n.call(r,t[u],u,t)&&(e[u]=t[u]);return e}}function Ln(n,r){var t={};for(var e in n)-1===r.indexOf(e)&&(t[e]=n[e]);return t}function Vn(n,r){return Sn(yn(n),r)}function qn(n,r){return r.reduce(function(r,t){var e=t(n);return e.length&&r.push(e),r},[])}function Gn(n,r,t){return Zn(r[0]||" ",Math.ceil(t-n.length))}function Bn(n,r,t){return Gn(n,r,t)+n}function Un(n,r,t){return n+Gn(n,r,t)}function Zn(n,r){for(var t="",e=0;r>e;e++)t+=n;return t}function $n(n){return rr.test.bind(n)}function _n(n){return null===n}function Cn(n){return function(r){return Jn(r)===n}}function Hn(n){return void 0===n}function Jn(n){return nr.toString.call(n).replace(/^\[\w+\s+|\]$/g,"")}var Qn=Object.create(null);Qn._version="0.17.0";var Xn=Qn,Yn=Array.prototype,nr=Object.prototype,rr=RegExp.prototype,tr=Function.bind.bind(Function.call);Qn.always=r,Qn.compose=t,Qn.generic=tr,Qn.identity=e,Qn.partial=u;var er=tr(Yn.filter),ur=tr(Yn.forEach),ir=tr(Yn.map),or=tr(Yn.reduce),cr=tr(Yn.reduceRight),fr=tr(Yn.slice);Qn.filter=er,Qn.forEach=ur,Qn.map=ir,Qn.reduce=or,Qn.reduceRight=cr,Qn.slice=fr;var ar=U(fr),lr=q(ar,2,!0),pr=t(W,ir),sr=y(0),hr=u(fr,Xn,0,-1),vr=y(-1),yr=u(fr,Xn,1,void 0),dr=u(fr,Xn,0,Xn),gr=q(dr,2,!0),mr=t(I,h(en(fr)),k),br=t(T,k),kr=O(U(k));Qn.contains=c,Qn.difference=f,Qn.drop=ar,Qn.dropN=lr,Qn.dropWhile=a,Qn.filterWith=l,Qn.find=p,Qn.findIndex=s,Qn.flatMap=pr,Qn.flatMapWith=h,Qn.flatten=v,Qn.getAt=y,Qn.group=d,Qn.groupBy=g,Qn.head=sr,Qn.init=hr,Qn.intersection=m,Qn.isIn=b,Qn.last=vr,Qn.list=k,Qn.mapWith=O,Qn.partition=w,Qn.partitionWith=x,Qn.pluck=j,Qn.pluckKey=A,Qn.setAt=M,Qn.shallowFlatten=W,Qn.tail=yr,Qn.take=dr,Qn.takeN=gr,Qn.takeWhile=E,Qn.transpose=T,Qn.union=mr,Qn.uniques=I,Qn.zip=br,Qn.zipWithIndex=kr;var Or=u(P,Xn,!1,Xn),wr=u(P,Xn,!0,Xn);Qn.insert=z,Qn.sort=S,Qn.sorter=Or,Qn.sorterDesc=wr,Qn.sortWith=L;var xr=q(G,2,!0),jr=J(t),Ar=U(J(u));Qn.apply=G,Qn.applyArgs=xr,Qn.aritize=B,Qn.binary=U,Qn.curry=Z,Qn.curryRight=$,Qn.curryable=_,Qn.curryableRight=C,Qn.debounce=H,Qn.flip=J,Qn.getArgAt=Q,Qn.invokerOn=X,Qn.invoker=Y,Qn.mapArgs=nn,Qn.pipe=jr,Qn.tapArgs=rn,Qn.throttle=tn,Qn.unary=en,Qn.wrap=Ar;var Mr=yn(an);Qn.adapter=un,Qn.allOf=on,Qn.anyOf=cn,Qn.condition=fn,Qn.is=an,Qn.isGT=ln,Qn.isGTE=pn,Qn.isLT=sn,Qn.isLTE=hn,Qn.isNot=Mr,Qn.isSVZ=vn,Qn.not=yn,Qn.add=dn,Qn.clamp=gn,Qn.divide=mn,Qn.modulo=bn,Qn.multiply=kn,Qn.randomInt=On,Qn.range=wn,Qn.remainder=xn,Qn.sequence=jn,Qn.subtract=An;var Wr=q(function(n,r){return n(r).map(Wn,r)}),Er=q(function(n,r){return n(r).reduce(function(n,t){return n[0].push(t),n[1].push(r[t]),n},[[],[]])}),Tr=q(function(n,r){return n(r).map(u(Rn,r))}),Ir=q(Rn,2,!0),Nr=q(Fn,2,!0),Rr=function(n,r){return t(u(an,r),Ir(n))},Dr=tr(nr.hasOwnProperty),Fr=q(Dr,2,!0),Kr=u(En,In),Pr=u(En,Object.keys),zr=Wr(Object.keys),Sr=Tr(Object.keys),Lr=Wr(In),Vr=Er(In),qr=Er(Object.keys),Gr=q(qn,2,!0),Br=Tr(In);Qn.checker=Tn,Qn.enumerables=In,Qn.fromPairs=Nn,Qn.get=Rn,Qn.getKey=Ir,Qn.getWithPath=Dn,Qn.has=Fn,Qn.hasKey=Nr,Qn.hasKeyValue=Rr,Qn.hasOwn=Dr,Qn.hasOwnKey=Fr,Qn.immutable=Kn,Qn.make=Pn,Qn.merge=Kr,Qn.mergeOwn=Pr,Qn.ownPairs=zr,Qn.ownValues=Sr,Qn.pairs=Lr,Qn.pick=zn,Qn.pickIf=Sn,Qn.skip=Ln,Qn.skipIf=Vn,Qn.tear=Vr,Qn.tearOwn=qr,Qn.validate=qn,Qn.validateWith=Gr,Qn.values=Br,Qn.padLeft=Bn,Qn.padRight=Un,Qn.repeat=Zn,Qn.testWith=$n;var Ur=cn(_n,Hn);Qn.isNil=Ur,Qn.isNull=_n,Qn.isType=Cn,Qn.isUndefined=Hn,Qn.type=Jn,"object"==typeof exports?module.exports=Qn:"function"==typeof define&&define.amd?define(function(){return Qn}):n.lamb=Qn}(this);
//# sourceMappingURL=lamb.min.js.map
diff --git a/dist/lamb.min.js.map b/dist/lamb.min.js.map
index 5ad9a18..d196076 100644
--- a/dist/lamb.min.js.map
+++ b/dist/lamb.min.js.map
@@ -1 +1 @@
-{"version":3,"sources":["lamb.js"],"names":["host","always","value","compose","functions","arguments","args","len","length","apply","this","identity","partial","fn","slice","boundArg","lastArgumentIdx","newArgs","argsLen","i","_","push","_findSliceEndIndex","arrayLike","predicate","predicateContext","idx","call","_flatten","array","output","forEach","Array","isArray","contains","fromIndex","isIn","difference","rest","shallowFlatten","isInRest","filter","not","dropWhile","filterWith","find","result","element","findIndex","flatMapWith","iteratee","iterateeContext","flatMap","flatten","getAt","index","group","key","groupBy","intersection","uniques","item","every","isSVZ","list","mapWith","map","partition","el","partitionWith","pluck","getKey","pluckKey","_arrayProto","concat","takeWhile","transpose","j","minLen","Math","min","seen","_comparer","a","b","String","_compareWith","criteria","isDescSort","criterion","compare","isDescending","_getInsertionIndex","comparer","start","end","pivot","_makeCriteria","sorters","_makeCriterion","_sorter","Object","reader","insert","splice","sort","data","sortWith","_currier","arity","isRightCurry","slicer","argsHolder","reverse","_curry","isAutoCurry","aritize","binary","curry","curryRight","curryable","curryableRight","debounce","timespan","timeoutID","context","debounced","clearTimeout","setTimeout","flip","invokerOn","target","methodName","method","type","invoker","boundArgs","mapArgs","mapper","tapArgs","readers","throttle","lastCall","now","Date","unary","adapter","isUndefined","allOf","predicates","anyOf","some","condition","trueFn","falseFn","applyArgsTo","applyArgs","is","isGT","isGTE","isLT","isLTE","add","clamp","n","max","divide","modulo","floor","multiply","randomInt","random","range","limit","step","ceil","sequence","remainder","subtract","_immutable","obj","indexOf","freeze","getOwnPropertyNames","isNull","_keyToPair","_merge","getKeys","reduce","source","checker","message","keyPaths","pathSeparator","getValues","getWithPath","enumerables","keys","fromPairs","pairsList","pair","get","path","separator","split","has","immutable","make","values","valuesLen","pick","whitelist","pickIf","skip","blacklist","skipIf","validate","checkers","errors","_getPadding","char","repeat","padLeft","padRight","count","testWith","pattern","_reProto","test","bind","isType","typeName","_objectProto","toString","replace","lamb","create","_version","prototype","RegExp","generic","Function","reduceRight","drop","dropN","head","init","last","tail","take","takeN","union","zip","zipWithIndex","sorter","sorterDesc","pipe","wrap","isNot","_pairsFrom","_tearFrom","_valuesFrom","hasKey","hasKeyValue","hasOwn","hasOwnProperty","hasOwnKey","merge","mergeOwn","ownPairs","ownValues","pairs","tear","tearOwn","validateWith","isNil","exports","module","define","amd"],"mappings":";;;;;;;;CAQC,SAAUA,GACP,YA4CA,SAASC,GAAQC,GACb,MAAO,YACH,MAAOA,IA4Bf,QAASC,KACL,GAAIC,GAAYC,SAEhB,OAAO,YAIH,IAHA,GAAIC,GAAOD,UACPE,EAAMH,EAAUI,OAEbD,KACHD,GAAQF,EAAUG,GAAKE,MAAMC,KAAMJ,GAGvC,OAAOA,GAAK,IAsCpB,QAASK,GAAUT,GACf,MAAOA,GAkBX,QAASU,GAASC,GACd,GAAIP,GAAOQ,GAAMT,UAAW,EAE5B,OAAO,YAKH,IAAK,GAAWU,GAJZC,EAAkB,EAClBC,KACAC,EAAUZ,EAAKE,OAEVW,EAAI,EAAiBD,EAAJC,EAAaA,IACnCJ,EAAWT,EAAKa,GAChBF,EAAQE,GAAKJ,IAAaK,GAAIf,UAAUW,KAAqBD,CAGjE,KAAK,GAAIR,GAAMF,UAAUG,OAA0BD,EAAlBS,EAAuBA,IACpDC,EAAQI,KAAKhB,UAAUW,GAG3B,OAAOH,GAAGJ,MAAMC,KAAMO,IAgI9B,QAASK,GAAoBC,EAAWC,EAAWC,GAI/C,IAHA,GAAIC,GAAM,GACNnB,EAAMgB,EAAUf,SAEXkB,EAAMnB,GAAOiB,EAAUG,KAAKF,EAAkBF,EAAUG,GAAMA,EAAKH,KAE5E,MAAOG,GAGX,QAASE,GAAUC,EAAOC,GAStB,MARAD,GAAME,QAAQ,SAAU7B,GAChB8B,MAAMC,QAAQ/B,GACd0B,EAAS1B,EAAO4B,GAEhBA,EAAOT,KAAKnB,KAIb4B,EAmBX,QAASI,GAAUhC,EAAOiC,GACtB,MAAO,UAAUZ,GACb,MAAOa,GAAKb,EAAWrB,EAAOiC,IAqBtC,QAASE,GAAYR,GACjB,GAAIS,GAAOC,EAAezB,GAAMT,UAAW,IACvCmC,EAAW5B,EAAQwB,EAAME,EAAMlB,GAAG,EACtC,OAAOS,GAAMY,OAAOC,GAAIF,IAgE5B,QAASG,GAAWnB,EAAWC,GAC3B,MAAO,UAAUF,GACb,MAAOT,IAAMS,EAAWD,EAAmBC,EAAWC,EAAWC,KAsBzE,QAASmB,GAAYpB,EAAWC,GAC5B,MAAOb,GAAQ6B,GAAQrB,GAAGI,EAAWC,GAwBzC,QAASoB,GAAMtB,EAAWC,EAAWC,GAGjC,IAAK,GAFDqB,GAEoCC,EAA/B5B,EAAI,EAAGZ,EAAMgB,EAAUf,OAAqBD,EAAJY,EAASA,IAGtD,GAFA4B,EAAUxB,EAAUJ,GAEhBK,EAAUG,KAAKF,EAAkBsB,EAAS5B,EAAGI,GAAY,CACzDuB,EAASC,CACT,OAIR,MAAOD,GAwBX,QAASE,GAAWzB,EAAWC,EAAWC,GAGtC,IAAK,GAFDqB,GAAS,GAEJ3B,EAAI,EAAGZ,EAAMgB,EAAUf,OAAYD,EAAJY,EAASA,IAC7C,GAAIK,EAAUG,KAAKF,EAAkBF,EAAUJ,GAAIA,EAAGI,GAAY,CAC9DuB,EAAS3B,CACT,OAIR,MAAO2B,GAsCX,QAASG,GAAaC,EAAUC,GAC5B,MAAOvC,GAAQwC,GAAShC,GAAG8B,EAAUC,GAgBzC,QAASE,GAASxB,GACd,MAAOD,GAASC,MA0BpB,QAASyB,GAAOC,GACZ,MAAO,UAAUhC,GACb,MAAOA,GAAkB,EAARgC,EAAYA,EAAQhC,EAAUf,OAAS+C,IA8DhE,QAASC,GAAOjC,EAAW2B,EAAUC,GAIjC,IAAK,GAAWJ,GAHbD,KACCvC,EAAMgB,EAAUf,OAEXW,EAAI,EAAgBZ,EAAJY,EAASA,IAAK,CACnC4B,EAAUxB,EAAUJ,EACpB,IAAIsC,GAAMP,EAASvB,KAAKwB,EAAiBJ,EAAS5B,EAAGI,EAEjDkC,KAAOX,GACPA,EAAOW,GAAKpC,KAAK0B,GAEjBD,EAAOW,IAAQV,GAIvB,MAAOD,GAqCX,QAASY,GAASR,EAAUC,GACxB,MAAOvC,GAAQ4C,EAAOpC,GAAG8B,EAAUC,GAqDvC,QAASQ,KACL,GAAIrB,GAAOxB,GAAMT,UAAW,EAC5B,OAAOuD,GAAQvD,UAAU,IAAIoC,OAAO,SAAUoB,GAC1C,MAAOvB,GAAKwB,MAAM5B,EAAS2B,MAyBnC,QAASzB,GAAMb,EAAWrB,EAAOiC,GAG7B,IAAK,GAFDW,IAAS,EAEJ3B,EAAgB,EAAZgB,EAAe5B,EAAMgB,EAAUf,OAAYD,EAAJY,EAASA,IACzD,GAAI4C,GAAM7D,EAAOqB,EAAUJ,IAAK,CAC5B2B,GAAS,CACT,OAIR,MAAOA,GA8BX,QAASkB,KACL,MAA4B,KAArB3D,UAAUG,QAAgBH,UAAU,IAAM2B,MAAMvB,MAAM,KAAMJ,WAkBvE,QAAS4D,GAASf,EAAUC,GACxB,MAAOvC,GAAQsD,GAAK9C,GAAG8B,EAAUC,GAmBrC,QAASgB,GAAW5C,EAAWC,EAAWC,GAItC,IAAK,GAAW2C,GAHZtB,UACAvC,EAAMgB,EAAUf,OAEXW,EAAI,EAAWZ,EAAJY,EAASA,IACzBiD,EAAK7C,EAAUJ,GACf2B,EAAOtB,EAAUG,KAAKF,EAAkB2C,EAAIjD,EAAGI,GAAa,EAAI,GAAGF,KAAK+C,EAG5E,OAAOtB,GA+BX,QAASuB,GAAe7C,EAAWC,GAC/B,MAAOb,GAAQuD,EAAW/C,GAAGI,EAAWC,GA6B5C,QAAS6C,GAAO/C,EAAWkC,GACvB,MAAOS,IAAI3C,EAAWgD,GAAOd,IAuBjC,QAASe,GAAUf,GACf,MAAOQ,GAAQM,GAAOd,IAiB1B,QAASlB,GAAgBV,GACrB,MAAO4C,IAAYC,OAAOjE,SAAUoB,GAiFxC,QAAS8C,GAAWnD,EAAWC,GAC3B,MAAO,UAAUF,GACb,MAAOT,IAAMS,EAAW,EAAGD,EAAmBC,EAAWC,EAAWC,KA8B5E,QAASmD,GAAWrD,GAKhB,IAAK,GAAWsD,GAJZ/B,KACAgC,EAAuD,EAA9CrE,EAAMsE,KAAKC,IAAKV,EAAM/C,EAAW,WAC1ChB,EAAMgB,EAAUf,OAEXW,EAAI,EAAU2D,EAAJ3D,EAAYA,IAG3B,IAFA2B,EAAOzB,SAEFwD,EAAI,EAAOtE,EAAJsE,EAASA,IACjB/B,EAAO3B,GAAG0D,GAAKtD,EAAUsD,GAAG1D,EAIpC,OAAO2B,GA0CX,QAASc,GAASrC,EAAW2B,EAAUC,GACX,kBAAbD,KACPA,EAAWvC,EAOf,KAAK,GAFDT,GAFA4C,KACAmC,KAGK9D,EAAI,EAAGA,EAAII,EAAUf,OAAQW,IAClCjB,EAAQgD,EAASvB,KAAKwB,EAAiB5B,EAAUJ,GAAIA,EAAII,GAEpDa,EAAK6C,EAAM/E,KACZ+E,EAAK5D,KAAKnB,GACV4C,EAAOzB,KAAKE,EAAUJ,IAI9B,OAAO2B,GA0EX,QAASoC,GAAWC,EAAGC,GACnB,GAAItC,GAAS,CAeb,cAbWqC,UAAaC,KACpBD,EAAIE,OAAOF,GACXC,EAAIC,OAAOD,IAGVrB,GAAMoB,EAAGC,KACND,EAAIC,GAAKD,IAAMA,EACfrC,EAAS,GACEsC,EAAJD,GAASC,IAAMA,KACtBtC,EAAS,KAIVA,EAGX,QAASwC,GAAcC,GACnB,GAAIhF,GAAMgF,EAAS/E,MAEnB,OAAO,UAAU2E,EAAGC,GAKhB,IAAK,GAHDI,GACAC,EAFA3C,EAAS,EAIJ3B,EAAI,EAAOZ,EAAJY,EAASA,IAIrB,GAHAsE,EAAYF,EAASpE,GACrB2B,EAAS2C,EAAUC,QAAQP,EAAEjF,MAAOkF,EAAElF,OAEvB,IAAX4C,EAAc,CACd0C,EAAaD,EAASpE,GAAGwE,YACzB,OASR,MALe,KAAX7C,IACA0C,EAAaD,EAAShF,EAAM,GAAGoF,aAC/B7C,EAASqC,EAAE5B,MAAQ6B,EAAE7B,OAGlBiC,GAAc1C,EAASA,GAItC,QAAS8C,GAAoB/D,EAAOkB,EAAS8C,EAAUC,EAAOC,GAC1D,GAAqB,IAAjBlE,EAAMrB,OACN,MAAO,EAGX,IAAIwF,GAASF,EAAQC,GAAQ,EACzBjD,EAAS+C,GACT3F,MAAO6C,EACPQ,MAAOyC,IAEP9F,MAAO2B,EAAMmE,GACbzC,MAAOyC,GAGX,OAAmB,IAAfD,EAAMD,EACU,EAAThD,EAAakD,EAAQA,EAAQ,EACpB,EAATlD,EACA8C,EAAmB/D,EAAOkB,EAAS8C,EAAUC,EAAOE,GACzC,IAAXlD,EACAkD,EAAQ,EAERJ,EAAmB/D,EAAOkB,EAAS8C,EAAUG,EAAOD,GAInE,QAASE,GAAeC,GACpB,MAAOA,GAAQ1F,OAAS0F,EAAQhC,IAAIiC,IAAmBC,KAG3D,QAASD,GAAgBV,GACrB,MAA4C,kBAA9BY,QAAOZ,GAAWC,QAAyBD,EAAYW,EAAQX,GAGjF,QAASW,GAASE,EAAQX,EAAcE,GACpC,OACIF,aAAcA,KAAiB,EAC/BD,QAAS,SAAUP,EAAGC,GAMlB,MALsB,kBAAXkB,IAAyBA,IAAW3F,IAC3CwE,EAAImB,EAAOnB,GACXC,EAAIkB,EAAOlB,KAGPS,GAAYX,GAAWC,EAAGC,KA+C9C,QAASmB,GAAQ1E,EAAOkB,GACpB,GAAIwC,GAAWU,EAAcnF,GAAMT,UAAW,IAC1CyC,EAASjB,EAAM6C,SACfhD,EAAMkE,EAAmB/D,EAAOkB,EAASuC,EAAaC,GAAW,EAAG1D,EAAMrB,OAG9E,OADAsC,GAAO0D,OAAO9E,EAAK,EAAGqB,GACfD,EA8DX,QAAS2D,GAAMlF,GAMX,IAAK,GALDgE,GAAWU,EAAcnF,GAAMT,UAAW,IAC1CqG,KACA5D,KACAvC,EAAMgB,EAAUf,OAEXW,EAAI,EAAOZ,EAAJY,EAASA,IACrBuF,EAAKrF,MACDnB,MAAOqB,EAAUJ,GACjBoC,MAAOpC,GAMf,KAFAuF,EAAKD,KAAKnB,EAAaC,IAElBpE,EAAI,EAAOZ,EAAJY,EAASA,IACjB2B,EAAOzB,KAAKqF,EAAKvF,GAAGjB,MAGxB,OAAO4C,GAwDX,QAAS6D,KACL,GAAIT,GAAUpF,GAAMT,UAEpB,OAAO,UAAUkB,GACb,MAAOkF,GAAKhG,MAAM,MAAOc,GAAWmD,OAAOwB,KAWnD,QAASU,GAAU/F,EAAIgG,EAAOC,EAAcC,EAAQC,GAChD,MAAO,YACH,GAAI1G,GAAO0G,EAAWtC,OAAOqC,EAAO1G,WAEpC,OAAIC,GAAKE,QAAUqG,EACRhG,EAAGJ,MAAMC,KAAMoG,EAAexG,EAAK2G,UAAY3G,GAE/CsG,EAAS/F,EAAIgG,EAAOC,EAAcC,EAAQzG,IAK7D,QAAS4G,GAAQrG,EAAIgG,EAAOC,EAAcK,GACtC,GAAIJ,GAASI,EAAcrG,GAAQ,SAAUqE,GACzC,MAAOA,GAAE3E,QAAU2E,EAAE,OAOzB,QAJa,EAAR0B,KAAeA,IAChBA,EAAQhG,EAAGL,QAGRoG,EAAS/F,EAAIgG,EAAOC,EAAcC,MAc7C,QAAStG,GAAOI,EAAIP,GAChB,MAAOO,GAAGJ,MAAMI,EAAIC,GAAMR,IAsC9B,QAAS8G,GAASvG,EAAIgG,GAClB,MAAO,YACH,MAAOpG,GAAMI,EAAIC,GAAMT,UAAW,EAAGwG,KAkB7C,QAASQ,GAAQxG,GACb,MAAO,UAAUsE,EAAGC,GAChB,MAAOvE,GAAGsE,EAAGC,IA0BrB,QAASkC,GAAOzG,EAAIgG,GAChB,MAAOK,GAAOrG,EAAIgG,GAAO,GAiB7B,QAASU,GAAY1G,EAAIgG,GACrB,MAAOK,GAAOrG,EAAIgG,GAAO,GA2B7B,QAASW,GAAW3G,EAAIgG,GACpB,MAAOK,GAAOrG,EAAIgG,GAAO,GAAO,GAmBpC,QAASY,GAAgB5G,EAAIgG,GACzB,MAAOK,GAAOrG,EAAIgG,GAAO,GAAM,GAuBnC,QAASa,GAAU7G,EAAI8G,GACnB,GAAIC,EAEJ,OAAO,YACH,GAAIC,GAAUnH,KACVJ,EAAOD,UACPyH,EAAY,WACZF,EAAY,KACZ/G,EAAGJ,MAAMoH,EAASvH,GAGtByH,cAAaH,GACbA,EAAYI,WAAWF,EAAWH,IAe1C,QAASM,GAAMpH,GACX,MAAO,YACH,GAAIP,GAAOQ,GAAMT,WAAW4G,SAC5B,OAAOpG,GAAGJ,MAAMC,KAAMJ,IAqB9B,QAAS4H,GAAWC,GAChB,MAAO,UAAUC,GACb,GAAI9H,GAAOQ,GAAMT,UAAW,GACxBgI,EAASF,EAAOC,EACpB,OAAwB,aAAjBE,GAAKD,GAAyBA,EAAO5H,MAAM0H,EAAQ7H,GAAQ,QAmC1E,QAASiI,GAASH,GACd,GAAII,GAAY1H,GAAMT,UAAW,EAEjC,OAAO,UAAU8H,GACb,GAAI7H,GAAOQ,GAAMT,UAAW,GACxBgI,EAASF,EAAOC,EACpB,OAAwB,aAAjBE,GAAKD,GAAyBA,EAAO5H,MAAM0H,EAAQK,EAAU9D,OAAOpE,IAAS,QAuB5F,QAASmI,GAAS5H,EAAI6H,GAClB,MAAOvI,GAAQS,EAAQH,EAAOI,GAAKoD,EAAQyE,GAAS1E,GAqCxD,QAAS2E,GAAS9H,GACd,GAAI+H,GAAU9H,GAAMT,UAAW,EAE/B,OAAO,YAIH,IAAK,GAHDE,GAAMF,UAAUG,OAChBF,KAEKa,EAAI,EAAOZ,EAAJY,EAASA,IACrBb,EAAKe,KAAKuH,EAAQzH,GAAKyH,EAAQzH,GAAGd,UAAUc,IAAMd,UAAUc,GAGhE,OAAON,GAAGJ,MAAMC,KAAMJ,IAsB9B,QAASuI,IAAUhI,EAAI8G,GACnB,GAAI7E,GACAgG,EAAW,CAEf,OAAO,YACH,GAAIC,GAAMC,KAAKD,KAOf,OALIA,GAAMD,GAAYnB,IAClBmB,EAAWC,EACXjG,EAASjC,EAAGJ,MAAMC,KAAML,YAGrByC,GAmBf,QAASmG,IAAOpI,GACZ,MAAO,UAAUsE,GACb,MAAOtE,GAAGsE,IAyElB,QAAS+D,MACL,GAAI9I,GAAYU,GAAMT,UAEtB,OAAO,YAIH,IAAK,GAFDyC,GADAvC,EAAMH,EAAUI,OAGXW,EAAI,EAAOZ,EAAJY,IACZ2B,EAASrC,EAAML,EAAUe,GAAId,WAExB8I,GAAYrG,IAHI3B,KAQzB,MAAO2B,IAqBf,QAASsG,MACL,GAAIC,GAAavI,GAAMT,UAEvB,OAAO,YACH,GAAIC,GAAOD,SAEX,OAAOgJ,GAAWvF,MAAM,SAAUtC,GAC9B,MAAOA,GAAUf,MAAM,KAAMH,MAuBzC,QAASgJ,MACL,GAAID,GAAavI,GAAMT,UAEvB,OAAO,YACH,GAAIC,GAAOD,SAEX,OAAOgJ,GAAWE,KAAK,SAAU/H,GAC7B,MAAOA,GAAUf,MAAM,KAAMH,MA2BzC,QAASkJ,IAAWhI,EAAWiI,EAAQC,GACnC,MAAO,YACH,GAAIC,GAAcC,GAAUvJ,UAC5B,OAAOsJ,GAAYnI,GAAamI,EAAYF,GAAUC,EAAUC,EAAYD,GAAW,QA2B/F,QAASG,IAAI1E,EAAGC,GACZ,MAAa,KAAND,GAAiB,IAANC,EAAU,EAAID,IAAM,EAAIC,EAAIrB,GAAMoB,EAAGC,GAyB3D,QAAS0E,IAAM3E,EAAGC,GACd,MAAOD,GAAIC,EAmBf,QAAS2E,IAAO5E,EAAGC,GACf,MAAOD,IAAKC,EAyBhB,QAAS4E,IAAM7E,EAAGC,GACd,MAAWA,GAAJD,EAmBX,QAAS8E,IAAO9E,EAAGC,GACf,MAAYA,IAALD,EAwCX,QAASpB,IAAOoB,EAAGC,GACf,MAAOD,KAAMA,EAAIC,IAAMA,EAAID,IAAMC,EAiBrC,QAAS1C,IAAKlB,GACV,MAAO,YACH,OAAQA,EAAUf,MAAM,KAAMJ,YA6BtC,QAAS6J,IAAK/E,EAAGC,GACb,MAAOD,GAAIC,EAiBf,QAAS+E,IAAOC,EAAGpF,EAAKqF,GACpB,MAAWrF,GAAJoF,EAAUpF,EAAMoF,EAAIC,EAAMA,EAAMD,EAc3C,QAASE,IAAQnF,EAAGC,GAChB,MAAOD,GAAIC,EAqBf,QAASmF,IAAQpF,EAAGC,GAChB,MAAOD,GAAKC,EAAIL,KAAKyF,MAAMrF,EAAIC,GAcnC,QAASqF,IAAUtF,EAAGC,GAClB,MAAOD,GAAIC,EAkBf,QAASsF,IAAW1F,EAAKqF,GACrB,MAAOtF,MAAKyF,MAAMzF,KAAK4F,UAAYN,EAAMrF,EAAM,GAAKA,GAmBxD,QAAS4F,IAAO9E,EAAO+E,EAAOC,GAC1B,GAAa,IAATA,GAAczK,UAAUG,OAAS,EACjC,OAAQsF,EAGPgF,KACDA,EAAO,EAGX,IAAIvK,GAAMwE,KAAKsF,IAAItF,KAAKgG,MAAMF,EAAQ/E,GAASgF,GAAO,EACtD,OAAOE,IAASlF,EAAOvF,EAAKK,EAAQsJ,GAAKY,IAoB7C,QAASG,IAAW9F,EAAGC,GACnB,MAAOD,GAAIC,EAqBf,QAAS4F,IAAUlF,EAAOvF,EAAK2C,EAAUC,GAGrC,IAAK,GAFDL,IAAUgD,GAEL3E,EAAI,EAAG0J,EAAQtK,EAAM,EAAOsK,EAAJ1J,EAAWA,IACxC2B,EAAOzB,KAAK6B,EAASvB,KAAKwB,EAAiBL,EAAO3B,GAAIA,EAAG2B,GAG7D,OAAOA,GAcX,QAASoI,IAAU/F,EAAGC,GAClB,MAAOD,GAAIC,EAef,QAAS+F,IAAYC,EAAKnG,GAatB,MAZ0B,KAAtBA,EAAKoG,QAAQD,KACbnG,EAAK5D,KAAKgF,OAAOiF,OAAOF,IAExB/E,OAAOkF,oBAAoBH,GAAKrJ,QAAQ,SAAU0B,GAC9C,GAAIvD,GAAQkL,EAAI3H,EAEK,iBAAVvD,IAAuBsL,GAAOtL,IACrCiL,GAAWjL,EAAO+E,MAKvBmG,EAGX,QAASK,IAAYhI,GACjB,OAAQA,EAAK/C,KAAK+C,IAGtB,QAASiI,IAAQC,GACb,MAAOC,IAAO9K,GAAMT,UAAW,GAAI,SAAUyC,EAAQ+I,GAKjD,MAJA9J,IAAQ4J,EAAQE,GAAS,SAAUpI,GAC/BX,EAAOW,GAAOoI,EAAOpI,KAGlBX,OAyDf,QAASgJ,IAAStK,EAAWuK,EAASC,EAAUC,GAC5C,MAAO,UAAUb,GACb,GAAIc,GAAYtL,EAAQuL,GAAaf,EAAKhK,GAAG6K,EAC7C,OAAOzK,GAAUf,MAAM2K,EAAKY,EAAS9H,IAAIgI,QAAoBH,EAASC,IAqB9E,QAASI,IAAahB,GAClB,GAAIiB,KAEJ,KAAK,GAAI5I,KAAO2H,GACZiB,EAAKhL,KAAKoC,EAGd,OAAO4I,GAiBX,QAASC,IAAWC,GAChB,GAAIzJ,KAMJ,OAJAyJ,GAAUxK,QAAQ,SAAUyK,GACxB1J,EAAO0J,EAAK,IAAMA,EAAK,KAGpB1J,EAiBX,QAAS2J,IAAKrB,EAAK3H,GACf,MAAO2H,GAAI3H,GAmDf,QAAS0I,IAAaf,EAAKsB,EAAMC,GAC7B,MAAOD,GAAKE,MAAMD,GAAa,KAAKf,OAAOa,GAAKrB,GAuBpD,QAASyB,IAAKzB,EAAK3H,GACf,MAAOA,KAAO2H,GAgHlB,QAAS0B,IAAW1B,GAChB,MAAOD,IAAWC,MAoBtB,QAAS2B,IAAMV,EAAMW,GAIjB,IAAK,GAHDlK,MACAmK,EAAYD,EAAOxM,OAEdW,EAAI,EAAGZ,EAAM8L,EAAK7L,OAAYD,EAAJY,EAASA,IACxC2B,EAAOuJ,EAAKlL,IAAU8L,EAAJ9L,EAAgB6L,EAAO7L,GAAK,MAGlD,OAAO2B,GAgHX,QAASoK,IAAMrB,EAAQsB,GACnB,GAAIrK,KAQJ,OANAqK,GAAUpL,QAAQ,SAAU0B,GACpBA,IAAOoI,KACP/I,EAAOW,GAAOoI,EAAOpI,MAItBX,EAkBX,QAASsK,IAAQ5L,EAAWC,GACxB,MAAO,UAAUoK,GACb,GAAI/I,KAEJ,KAAK,GAAIW,KAAOoI,GACRrK,EAAUG,KAAKF,EAAkBoK,EAAOpI,GAAMA,EAAKoI,KACnD/I,EAAOW,GAAOoI,EAAOpI,GAI7B,OAAOX,IAkBf,QAASuK,IAAMxB,EAAQyB,GACnB,GAAIxK,KAEJ,KAAK,GAAIW,KAAOoI,GACmB,KAA3ByB,EAAUjC,QAAQ5H,KAClBX,EAAOW,GAAOoI,EAAOpI,GAI7B,OAAOX,GAkBX,QAASyK,IAAQ/L,EAAWC,GACxB,MAAO2L,IAAO1K,GAAIlB,GAAYC,GA+DlC,QAAS+L,IAAUpC,EAAKqC,GACpB,MAAOA,GAAS7B,OAAO,SAAU8B,EAAQ5B,GACrC,GAAIhJ,GAASgJ,EAAQV,EAErB,OADAtI,GAAOtC,QAAUkN,EAAOrM,KAAKyB,GACtB4K,OA4Ef,QAASC,IAAa9B,EAAQ+B,EAAMrN,GAChC,MAAOsN,IAAOD,EAAK,IAAM,IAAK7I,KAAKgG,KAAKxK,EAAMsL,EAAOrL,SAqBzD,QAASsN,IAASjC,EAAQ+B,EAAMrN,GAC5B,MAAOoN,IAAY9B,EAAQ+B,EAAMrN,GAAOsL,EAqB5C,QAASkC,IAAUlC,EAAQ+B,EAAMrN,GAC7B,MAAOsL,GAAS8B,GAAY9B,EAAQ+B,EAAMrN,GAkB9C,QAASsN,IAAQhC,EAAQmC,GAGrB,IAAK,GAFDlL,GAAS,GAEJ3B,EAAI,EAAO6M,EAAJ7M,EAAWA,IACvB2B,GAAU+I,CAGd,OAAO/I,GAgBX,QAASmL,IAAUC,GACf,MAAOC,IAASC,KAAKC,KAAKH,GAsC9B,QAAS1C,IAAQtL,GACb,MAAiB,QAAVA,EAgBX,QAASoO,IAAQC,GACb,MAAO,UAAUrO,GACb,MAAOoI,IAAKpI,KAAWqO,GAgB/B,QAASpF,IAAajJ,GAElB,MAAiB,UAAVA,EAsBX,QAASoI,IAAMpI,GACX,MAAOsO,IAAaC,SAAS9M,KAAKzB,GAAOwO,QAAQ,iBAAkB,IAt3GvE,GAAIC,IAAOtI,OAAOuI,OAAO,KASzBD,IAAKE,SAAY,QAGjB,IAAIzN,IAAIuN,GAGJlK,GAAczC,MAAM8M,UACpBN,GAAenI,OAAOyI,UACtBX,GAAWY,OAAOD,UAyFlBE,GAAUC,SAASZ,KAAKA,KAAKY,SAAStN,KAuD1CgN,IAAK1O,OAASA,EACd0O,GAAKxO,QAAUA,EACfwO,GAAKK,QAAUA,GACfL,GAAKhO,SAAWA,EAChBgO,GAAK/N,QAAUA,CAsBf,IAAI6B,IAASuM,GAAQvK,GAAYhC,QAuB7BV,GAAUiN,GAAQvK,GAAY1C,SAoB9BmC,GAAM8K,GAAQvK,GAAYP,KAgB1B0H,GAASoD,GAAQvK,GAAYmH,QAa7BsD,GAAcF,GAAQvK,GAAYyK,aAgBlCpO,GAAQkO,GAAQvK,GAAY3D,MAEhC6N,IAAKlM,OAASA,GACdkM,GAAK5M,QAAUA,GACf4M,GAAKzK,IAAMA,GACXyK,GAAK/C,OAASA,GACd+C,GAAKO,YAAcA,GACnBP,GAAK7N,MAAQA,EA0Fb,IAAIqO,IAAO9H,EAAOvG,IAoBdsO,GAAQlI,EAAOiI,GAAM,GAAG,GAwIxB/L,GAAUjD,EAAQoC,EAAgB2B,IAoMlCmL,GAAO/L,EAAM,GAiBbgM,GAAO1O,EAAQE,GAAOM,GAAG,EAAG,IA0E5BmO,GAAOjM,EAAM,IAsLbkM,GAAO5O,EAAQE,GAAOM,GAAG,EAAG,QAuB5BqO,GAAO7O,EAAQE,GAAOM,GAAG,EAAGA,IAoB5BsO,GAAQxI,EAAOuI,GAAM,GAAG,GAgFxBE,GAAQxP,EAAQyD,EAASX,EAAYgG,GAAMnI,KAASkD,GAmEpD4L,GAAMzP,EAAQyE,EAAWZ,GAazB6L,GAAe5L,EAAQoD,EAAOrD,GAElC2K,IAAKzM,SAAWA,EAChByM,GAAKtM,WAAaA,EAClBsM,GAAKQ,KAAOA,GACZR,GAAKS,MAAQA,GACbT,GAAKhM,UAAYA,EACjBgM,GAAK/L,WAAaA,EAClB+L,GAAK9L,KAAOA,EACZ8L,GAAK3L,UAAYA,EACjB2L,GAAKvL,QAAUA,GACfuL,GAAK1L,YAAcA,EACnB0L,GAAKtL,QAAUA,EACfsL,GAAKrL,MAAQA,EACbqL,GAAKnL,MAAQA,EACbmL,GAAKjL,QAAUA,EACfiL,GAAKU,KAAOA,GACZV,GAAKW,KAAOA,GACZX,GAAKhL,aAAeA,EACpBgL,GAAKvM,KAAOA,EACZuM,GAAKY,KAAOA,GACZZ,GAAK3K,KAAOA,EACZ2K,GAAK1K,QAAUA,EACf0K,GAAKxK,UAAYA,EACjBwK,GAAKtK,cAAgBA,EACrBsK,GAAKrK,MAAQA,EACbqK,GAAKnK,SAAWA,EAChBmK,GAAKpM,eAAiBA,EACtBoM,GAAKa,KAAOA,GACZb,GAAKc,KAAOA,GACZd,GAAKe,MAAQA,GACbf,GAAKhK,UAAYA,EACjBgK,GAAK/J,UAAYA,EACjB+J,GAAKgB,MAAQA,GACbhB,GAAK/K,QAAUA,EACf+K,GAAKiB,IAAMA,GACXjB,GAAKkB,aAAeA,EAkPpB,IAAIC,IAASlP,EAAQwF,EAAShF,IAAG,EAAOA,IAgBpC2O,GAAanP,EAAQwF,EAAShF,IAAG,EAAMA,GA+B3CuN,IAAKpI,OAASA,EACdoI,GAAKlI,KAAOA,EACZkI,GAAKmB,OAASA,GACdnB,GAAKoB,WAAaA,GAClBpB,GAAKhI,SAAWA,CA0DhB,IAAIiD,IAAY1C,EAAOzG,EAAO,GAAG,GAuS7BuP,GAAO/H,EAAK9H,GA2GZ8P,GAAO5I,EAAOY,EAAKrH,GAEvB+N,IAAKlO,MAAQA,EACbkO,GAAK/E,UAAYA,GACjB+E,GAAKvH,QAAUA,EACfuH,GAAKtH,OAASA,EACdsH,GAAKrH,MAAQA,EACbqH,GAAKpH,WAAaA,EAClBoH,GAAKnH,UAAYA,EACjBmH,GAAKlH,eAAiBA,EACtBkH,GAAKjH,SAAWA,EAChBiH,GAAK1G,KAAOA,EACZ0G,GAAKzG,UAAYA,EACjByG,GAAKpG,QAAUA,EACfoG,GAAKlG,QAAUA,EACfkG,GAAKqB,KAAOA,GACZrB,GAAKhG,QAAUA,EACfgG,GAAK9F,SAAWA,GAChB8F,GAAK1F,MAAQA,GACb0F,GAAKsB,KAAOA,EA+QZ,IAAIC,IAAQxN,GAAImH,GAgDhB8E,IAAKzF,QAAUA,GACfyF,GAAKvF,MAAQA,GACbuF,GAAKrF,MAAQA,GACbqF,GAAKnF,UAAYA,GACjBmF,GAAK9E,GAAKA,GACV8E,GAAK7E,KAAOA,GACZ6E,GAAK5E,MAAQA,GACb4E,GAAK3E,KAAOA,GACZ2E,GAAK1E,MAAQA,GACb0E,GAAKuB,MAAQA,GACbvB,GAAK5K,MAAQA,GACb4K,GAAKjM,IAAMA,GAwMXiM,GAAKzE,IAAMA,GACXyE,GAAKxE,MAAQA,GACbwE,GAAKrE,OAASA,GACdqE,GAAKpE,OAASA,GACdoE,GAAKlE,SAAWA,GAChBkE,GAAKjE,UAAYA,GACjBiE,GAAK/D,MAAQA,GACb+D,GAAK1D,UAAYA,GACjB0D,GAAK3D,SAAWA,GAChB2D,GAAKzD,SAAWA,EAiChB,IAAIiF,IAAajJ,EAAO,SAAUyE,EAASP,GACvC,MAAOO,GAAQP,GAAKlH,IAAIuH,GAAYL,KAGpCgF,GAAYlJ,EAAO,SAAWyE,EAASP,GACvC,MAAOO,GAAQP,GAAKQ,OAAO,SAAU9I,EAAQW,GAGzC,MAFAX,GAAO,GAAGzB,KAAKoC,GACfX,EAAO,GAAGzB,KAAK+J,EAAI3H,IACZX,cAIXuN,GAAcnJ,EAAO,SAAUyE,EAASP,GACxC,MAAOO,GAAQP,GAAKlH,IAAItD,EAAQ6L,GAAKrB,MAqIrC7G,GAAS2C,EAAOuF,GAAK,GAAG,GA4ExB6D,GAASpJ,EAAO2F,GAAK,GAAG,GAiBxB0D,GAAc,SAAU9M,EAAKvD,GAC7B,MAAOC,GAAQS,EAAQiJ,GAAI3J,GAAQqE,GAAOd,KAwB1C+M,GAASxB,GAAQR,GAAaiC,gBAmB9BC,GAAYxJ,EAAOsJ,GAAQ,GAAG,GA6E9BG,GAAQ/P,EAAQ8K,GAAQU,IAsBxBwE,GAAWhQ,EAAQ8K,GAAQrF,OAAOgG,MAqBlCwE,GAAWV,GAAW9J,OAAOgG,MAoB7ByE,GAAYT,GAAYhK,OAAOgG,MAe/B0E,GAAQZ,GAAW/D,IAsHnB4E,GAAOZ,GAAUhE,IAoBjB6E,GAAUb,GAAU/J,OAAOgG,MA0D3B6E,GAAehK,EAAOsG,GAAU,GAAG,GAgBnCR,GAASqD,GAAYjE,GAEzBuC,IAAK7C,QAAUA,GACf6C,GAAKvC,YAAcA,GACnBuC,GAAKrC,UAAYA,GACjBqC,GAAKlC,IAAMA,GACXkC,GAAKpK,OAASA,GACdoK,GAAKxC,YAAcA,GACnBwC,GAAK9B,IAAMA,GACX8B,GAAK2B,OAASA,GACd3B,GAAK4B,YAAcA,GACnB5B,GAAK6B,OAASA,GACd7B,GAAK+B,UAAYA,GACjB/B,GAAK7B,UAAYA,GACjB6B,GAAK5B,KAAOA,GACZ4B,GAAKgC,MAAQA,GACbhC,GAAKiC,SAAWA,GAChBjC,GAAKkC,SAAWA,GAChBlC,GAAKmC,UAAYA,GACjBnC,GAAKoC,MAAQA,GACbpC,GAAKzB,KAAOA,GACZyB,GAAKvB,OAASA,GACduB,GAAKtB,KAAOA,GACZsB,GAAKpB,OAASA,GACdoB,GAAKqC,KAAOA,GACZrC,GAAKsC,QAAUA,GACftC,GAAKnB,SAAWA,GAChBmB,GAAKuC,aAAeA,GACpBvC,GAAK3B,OAASA,GA6Fd2B,GAAKb,QAAUA,GACfa,GAAKZ,SAAWA,GAChBY,GAAKd,OAASA,GACdc,GAAKV,SAAWA,EAkBhB,IAAIkD,IAAQ7H,GAAMkC,GAAQrC,GA6E1BwF,IAAKwC,MAAQA,GACbxC,GAAKnD,OAASA,GACdmD,GAAKL,OAASA,GACdK,GAAKxF,YAAcA,GACnBwF,GAAKrG,KAAOA,GAGW,gBAAZ8I,SACPC,OAAOD,QAAUzC,GACQ,kBAAX2C,SAAyBA,OAAOC,IAC9CD,OAAO,WAAa,MAAO3C,MAE3B3O,EAAK2O,KAAOA,IAElBjO","file":"lamb.min.js","sourcesContent":["/**\n * @overview lamb - A lightweight, and docile, JavaScript library to help embracing functional programming.\n * @author Andrea Scartabelli \n * @version 0.16.0\n * @module lamb\n * @license MIT\n * @preserve\n */\n!function (host) {\n \"use strict\";\n\n var lamb = Object.create(null);\n\n /**\n * The current module version.\n * @memberof module:lamb\n * @private\n * @category Core\n * @type String\n */\n lamb._version = \"0.16.0\";\n\n // alias used as a placeholder argument for partial application\n var _ = lamb;\n\n // some prototype shortcuts for internal use\n var _arrayProto = Array.prototype;\n var _objectProto = Object.prototype;\n var _reProto = RegExp.prototype;\n\n /**\n * Builds a function that returns a constant value.\n * It's actually the simplest form of the K combinator or Kestrel.\n * @example\n * var truth = _.always(true);\n *\n * truth() // => true\n * truth(false) // => true\n * truth(1, 2) // => true\n *\n * // the value being returned is actually the\n * // very same value passed to the function\n * var foo = {bar: \"baz\"};\n * var alwaysFoo = _.always(foo);\n *\n * alwaysFoo() === foo // => true\n *\n * @memberof module:lamb\n * @category Core\n * @see [SKI combinator calculus]{@link https://en.wikipedia.org/wiki/SKI_combinator_calculus}\n * @param {*} value\n * @returns {Function}\n */\n function always (value) {\n return function () {\n return value;\n };\n }\n\n /**\n * Returns a function that is the composition of the functions given as parameters.\n * Each function consumes the result of the function that follows.\n * @example\n * var sayHi = function (name) { return \"Hi, \" + name; };\n * var capitalize = function (s) {\n * return s[0].toUpperCase() + s.substr(1).toLowerCase();\n * };\n * var fixNameAndSayHi = _.compose(sayHi, capitalize);\n *\n * sayHi(\"bOb\") // => \"Hi, bOb\"\n * fixNameAndSayHi(\"bOb\") // \"Hi, Bob\"\n *\n * var getName = _.getKey(\"name\");\n * var users = [{name: \"fred\"}, {name: \"bOb\"}];\n * var sayHiToUser = _.compose(fixNameAndSayHi, getName);\n *\n * users.map(sayHiToUser) // [\"Hi, Fred\", \"Hi, Bob\"]\n *\n * @memberof module:lamb\n * @category Function\n * @param {...Function} fn\n * @returns {Function}\n */\n function compose () {\n var functions = arguments;\n\n return function () {\n var args = arguments;\n var len = functions.length;\n\n while (len--) {\n args = [functions[len].apply(this, args)];\n }\n\n return args[0];\n };\n }\n\n /**\n * Creates generic functions out of methods.\n * @memberof module:lamb\n * @category Core\n * @author A very little change on a great idea by [Irakli Gozalishvili]{@link https://github.com/Gozala/}. Thanks for this *beautiful* one-liner (never liked your \"unbind\" naming choice, though).\n * @function\n * @example\n * // Lamb's \"filter\" is actually implemented like this\n * var filter = _.generic(Array.prototype.filter);\n * var isLowerCase = function (s) { return s.toLowerCase() === s; };\n *\n * filter([\"Foo\", \"bar\", \"baZ\"], isLowerCase) // => [\"bar\"]\n *\n * // the function will work with any array-like object\n * filter(\"fooBAR\", isLowerCase) // => [\"f\", \"o\", \"o\"]\n *\n * @param {Function} method\n * @returns {Function}\n */\n var generic = Function.bind.bind(Function.call);\n\n /**\n * The I combinator. Any value passed to the function is simply returned as it is.\n * @example\n * var foo = {bar: \"baz\"};\n *\n * _.identity(foo) === foo // true\n *\n * @memberof module:lamb\n * @category Core\n * @see [SKI combinator calculus]{@link https://en.wikipedia.org/wiki/SKI_combinator_calculus}\n * @param {*} value\n * @returns {*} The value passed as parameter.\n */\n function identity (value) {\n return value;\n }\n\n /**\n * Builds a partially applied function. The lamb object itself can be used as a placeholder argument:\n * it's useful to alias it as _ or __.\n * @example\n * var weights = [\"2 Kg\", \"10 Kg\", \"1 Kg\", \"7 Kg\"];\n * var parseInt10 = _.partial(parseInt, _, 10);\n *\n * weights.map(parseInt10) // => [2, 10, 1, 7]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {...*} args\n * @returns {Function}\n */\n function partial (fn) {\n var args = slice(arguments, 1);\n\n return function () {\n var lastArgumentIdx = 0;\n var newArgs = [];\n var argsLen = args.length;\n\n for (var i = 0, boundArg; i < argsLen; i++) {\n boundArg = args[i];\n newArgs[i] = boundArg === _ ? arguments[lastArgumentIdx++] : boundArg;\n }\n\n for (var len = arguments.length; lastArgumentIdx < len; lastArgumentIdx++) {\n newArgs.push(arguments[lastArgumentIdx]);\n }\n\n return fn.apply(this, newArgs);\n };\n }\n\n lamb.always = always;\n lamb.compose = compose;\n lamb.generic = generic;\n lamb.identity = identity;\n lamb.partial = partial;\n\n\n /**\n * Builds an array comprised of all values of the array-like object passing the predicate test.
\n * It's a generic version of [Array.prototype.filter]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter}.\n * @example\n * var isLowerCase = function (s) { return s.toLowerCase() === s; };\n *\n * _.filter([\"Foo\", \"bar\", \"baZ\"], isLowerCase) // => [\"bar\"]\n *\n * // the function will work with any array-like object\n * _.filter(\"fooBAR\", isLowerCase) // => [\"f\", \"o\", \"o\"]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Array}\n */\n var filter = generic(_arrayProto.filter);\n\n /**\n * Executes the provided iteratee for each element of the given array-like object.
\n * It's a generic version of [Array.prototype.forEach]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach}.\n * @example Adding a CSS class to all elements of a NodeList in a browser environment\n * var addClass = function (className) {\n * return function (element) {\n * element.classList.add(className);\n * };\n * };\n * var paragraphs = document.querySelectorAll(\"#some-container p\");\n *\n * _.forEach(paragraphs, addClass(\"main\"));\n * // each \"p\" element in the container will have the \"main\" class now\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n */\n var forEach = generic(_arrayProto.forEach);\n\n /**\n * Creates an array from the results of the provided iteratee.
\n * It's a generic version of [Array.prototype.map]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map}.\n * @example\n * function getSquareRoots () {\n * return _.map(arguments, Math.sqrt);\n * }\n *\n * getSquareRoots(4, 9, 16) // => [2, 3, 4]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Array}\n */\n var map = generic(_arrayProto.map);\n\n /**\n * Reduces (or folds) the values of an array-like object, starting from the first, to a new value using the provided accumulator function.
\n * It's a generic version of [Array.prototype.reduce]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce}.\n * @example\n * _.reduce([1, 2, 3, 4], _.add) // => 10\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {AccumulatorCallback} accumulator\n * @param {*} [initialValue]\n * @returns {*}\n */\n var reduce = generic(_arrayProto.reduce);\n\n /**\n * Same as {@link module:lamb.reduce|reduce}, but starts the fold operation from the last element instead.
\n * It's a generic version of [Array.prototype.reduceRight]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduceRight}.\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {AccumulatorCallback} accumulator\n * @param {*} [initialValue]\n * @returns {*}\n */\n var reduceRight = generic(_arrayProto.reduceRight);\n\n /**\n * Builds an array by extracting a portion of an array-like object.
\n * It's a generic version of [Array.prototype.slice]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice}.\n * @example\n * _.slice([\"foo\", \"bar\", \"baz\"], 0, 2) // => [\"foo\", \"bar\"]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike - Any array like object.\n * @param {Number} [start=0] - Zero-based index at which to begin extraction.\n * @param {Number} [end=arrayLike.length] - Zero-based index at which to end extraction. Extracts up to but not including end.\n * @returns {Array}\n */\n var slice = generic(_arrayProto.slice);\n\n lamb.filter = filter;\n lamb.forEach = forEach;\n lamb.map = map;\n lamb.reduce = reduce;\n lamb.reduceRight = reduceRight;\n lamb.slice = slice;\n\n\n function _findSliceEndIndex (arrayLike, predicate, predicateContext) {\n var idx = -1;\n var len = arrayLike.length;\n\n while (++idx < len && predicate.call(predicateContext, arrayLike[idx], idx, arrayLike));\n\n return idx;\n }\n\n function _flatten (array, output) {\n array.forEach(function (value) {\n if (Array.isArray(value)) {\n _flatten(value, output);\n } else {\n output.push(value);\n }\n });\n\n return output;\n }\n\n /**\n * Builds a predicate to check if an array-like object contains the given value.
\n * Please note that the equality test is made with {@link module:lamb.isSVZ|isSVZ}; so you can\n * check for NaN, but 0 and -0 are the same value.
\n * See also {@link module:lamb.isIn|isIn} for an uncurried version.\n * @example\n * var containsNaN = _.contains(NaN, 0);\n *\n * containsNaN([0, 1, 2, 3, NaN]) // => true\n *\n * @memberof module:lamb\n * @category Array\n * @param {*} value\n * @param {Number} [fromIndex=0] The position at which to begin searching for the given value.\n * @returns {Function}\n */\n function contains (value, fromIndex) {\n return function (arrayLike) {\n return isIn(arrayLike, value, fromIndex);\n };\n }\n\n /**\n * Returns an array of items present only in the first of the given arrays.
\n * Note that since version 0.13.0 this function uses the [\"SameValueZero\" comparison]{@link module:lamb.isSVZ|isSVZ}.\n * @example\n * var a1 = [1, 2, 3, 4];\n * var a2 = [2, 4, 5];\n * var a3 = [4, 5, 3, 1];\n *\n * _.difference(a1, a2) // => [1, 3]\n * _.difference(a1, a2, a3) // => []\n *\n * @memberof module:lamb\n * @category Array\n * @param {Array} array\n * @param {...Array} other\n * @returns {Array}\n */\n function difference (array) {\n var rest = shallowFlatten(slice(arguments, 1));\n var isInRest = partial(isIn, rest, _, 0);\n return array.filter(not(isInRest));\n }\n\n /**\n * Builds an array without the first n elements of the given array or array-like object.\n * Note that, being this only a shortcut for a specific use case of {@link module:lamb.slice|slice},\n * n can be a negative number.\n * @example\n * var arr = [1, 2, 3, 4, 5];\n *\n * _.drop(arr, 2) // => [3, 4, 5]\n * _.drop(arr, -1) // => [5]\n * _.drop(arr, -10) // => [1, 2, 3, 4, 5]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.dropN|dropN}\n * @see {@link module:lamb.take|take}, {@link module:lamb.takeN|takeN}\n * @see {@link module:lamb.takeWhile|takeWhile}, {@link module:lamb.dropWhile|dropWhile}\n * @param {ArrayLike} arrayLike\n * @param {Number} n\n * @returns {Array}\n */\n var drop = binary(slice);\n\n /**\n * A curried version of {@link module:lamb.drop|drop} that expects the number of elements\n * to drop to build a function waiting for the list to take the elements from.\n * See the note and examples for {@link module:lamb.drop|drop} about passing a negative n.\n * @example\n * var drop2 = _.dropN(2);\n *\n * drop2([1, 2, 3, 4, 5]) // => [3, 4, 5]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.drop|drop}\n * @see {@link module:lamb.take|take}, {@link module:lamb.takeN|takeN}\n * @see {@link module:lamb.takeWhile|takeWhile}, {@link module:lamb.dropWhile|dropWhile}\n * @param {Number} n\n * @returns {Function}\n */\n var dropN = _curry(drop, 2, true);\n\n /**\n * Builds a function that drops the first n elements satisfying a predicate from an array or array-like object.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var dropWhileIsEven = _.dropWhile(isEven);\n *\n * dropWhileIsEven([2, 4, 6, 8]) // => []\n * dropWhileIsEven([2, 4, 7, 8]) // => [7, 8]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.takeWhile|takeWhile}\n * @see {@link module:lamb.drop|drop}, {@link module:lamb.dropN|dropN}\n * @see {@link module:lamb.take|take}, {@link module:lamb.takeN|takeN}\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function dropWhile (predicate, predicateContext) {\n return function (arrayLike) {\n return slice(arrayLike, _findSliceEndIndex(arrayLike, predicate, predicateContext));\n };\n }\n\n /**\n * Returns a partial application of {@link module:lamb.filter|filter} that uses the given predicate and\n * the optional context to build a function expecting the array-like object to act upon.\n * @example\n * var isLowerCase = function (s) { return s.toLowerCase() === s; };\n * var getLowerCaseEntries = _.filterWith(isLowerCase);\n *\n * getLowerCaseEntries([\"Foo\", \"bar\", \"baZ\"]) // => [\"bar\"]\n *\n * // array-like objects can be used as well\n * getLowerCaseEntries(\"fooBAR\") // => [\"f\", \"o\", \"o\"]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function filterWith (predicate, predicateContext) {\n return partial(filter, _, predicate, predicateContext);\n }\n\n /**\n * Searches for an element satisfying the predicate in the given array-like object and returns it if\n * the search is successful. Returns undefined otherwise.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"age\": 12},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"age\": 18},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"age\": 40}\n * ];\n *\n * _.find(persons, _.hasKeyValue(\"age\", 40)) // => {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40}\n * _.find(persons, _.hasKeyValue(\"age\", 41)) // => undefined\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {*}\n */\n function find (arrayLike, predicate, predicateContext) {\n var result;\n\n for (var i = 0, len = arrayLike.length, element; i < len; i++) {\n element = arrayLike[i];\n\n if (predicate.call(predicateContext, element, i, arrayLike)) {\n result = element;\n break;\n }\n }\n\n return result;\n }\n\n /**\n * Searches for an element satisfying the predicate in the given array-like object and returns its\n * index if the search is successful. Returns -1 otherwise.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"age\": 12},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"age\": 18},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"age\": 40}\n * ];\n *\n * _.findIndex(persons, _.hasKeyValue(\"age\", 40)) // => 1\n * _.findIndex(persons, _.hasKeyValue(\"age\", 41)) // => -1\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Number}\n */\n function findIndex (arrayLike, predicate, predicateContext) {\n var result = -1;\n\n for (var i = 0, len = arrayLike.length; i < len; i++) {\n if (predicate.call(predicateContext, arrayLike[i], i, arrayLike)) {\n result = i;\n break;\n }\n }\n\n return result;\n }\n\n /**\n * Similar to {@link module:lamb.map|map}, but if the mapping function returns an array this will\n * be concatenated, rather than pushed, to the final result.\n * @example showing the difference with map\n * var words = [\"foo\", \"bar\"];\n * var toCharArray = function (s) { return s.split(\"\"); };\n *\n * _.map(words, toCharArray) // => [[\"f\", \"o\", \"o\"], [\"b\", \"a\", \"r\"]]\n * _.flatMap(words, toCharArray) // => [\"f\", \"o\", \"o\", \"b\", \"a\", \"r\"]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {Array} array\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Array}\n */\n var flatMap = compose(shallowFlatten, map);\n\n /**\n * Builds a partial application of {@link module:lamb.flatMap|flatMap} using the given iteratee\n * and the optional context. The resulting function expects the array to act upon.\n * @example\n * var toCharArray = function (s) { return s.split(\"\"); };\n * var wordsToCharArray = _.flatMapWith(toCharArray);\n *\n * wordsToCharArray([\"foo\", \"bar\"]) // => [\"f\", \"o\", \"o\", \"b\", \"a\", \"r\"]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Function}\n */\n function flatMapWith (iteratee, iterateeContext) {\n return partial(flatMap, _, iteratee, iterateeContext);\n }\n\n /**\n * Flattens an array. See also {@link module:lamb.shallowFlatten|shallowFlatten}.\n * @example showing the difference with shallowFlatten\n * var arr = [1, 2, [3, 4, [5, 6]], 7, 8];\n *\n * _.flatten(arr) // => [1, 2, 3, 4, 5, 6, 7, 8]\n * _.shallowFlatten(arr) // => [1, 2, 3, 4, [5, 6], 7, 8]\n *\n * @memberof module:lamb\n * @category Array\n * @param {Array} array\n * @returns {Array}\n */\n function flatten (array) {\n return _flatten(array, []);\n }\n\n /**\n * Retrieves the element at the given index in an array-like object.
\n * Like {@link module:lamb.slice|slice} the index can be negative.
\n * If the index isn't supplied, or if its value it's out of the array-like bounds,\n * the function will return undefined.\n * @example\n * var getFifthElement = _.getAt(4);\n *\n * getFifthElement([1, 2, 3, 4, 5]) // => 5\n * getFifthElement(\"foo bar\") // => \"b\"\n * getFifthElement([]) // => undefined\n * getFifthElement(\"foo\") // => undefined\n *\n * @example Using negative indexes\n * _.getAt(-2)([1, 2, 3]) // => 2\n * _.getAt(-3)(\"foo\") // => \"f\"\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.head|head} and {@link module:lamb.last|last} for common use cases shortcuts.\n * @param {Number} index\n * @returns {Function}\n */\n function getAt (index) {\n return function (arrayLike) {\n return arrayLike[index < 0 ? index + arrayLike.length : index];\n };\n }\n\n /**\n * Transforms an array-like object into a lookup table using the provided iteratee as a grouping\n * criterion to generate keys and values.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"city\": \"New York\"},\n * {\"name\": \"John\", \"city\": \"New York\"},\n * {\"name\": \"Mario\", \"city\": \"Rome\"},\n * {\"name\": \"Paolo\"}\n * ];\n * var getCity = _.getKey(\"city\");\n * var personsByCity = _.group(persons, getCity);\n *\n * // \"personsByCity\" holds:\n * // {\n * // \"New York\": [\n * // {\"name\": \"Jane\", \"city\": \"New York\"},\n * // {\"name\": \"John\", \"city\": \"New York\"}\n * // ],\n * // \"Rome\": [\n * // {\"name\": \"Mario\", \"city\": \"Rome\"}\n * // ],\n * // \"undefined\": [\n * // {\"name\": \"Paolo\"}\n * // ]\n * // }\n *\n * @example Adding a custom value for missing keys\n *\n * var getCityOrUnknown = _.condition(\n * _.hasKey(\"city\"),\n * getCity,\n * _.always(\"Unknown\")\n * );\n *\n * personsByCity = _.group(persons, getCityOrUnknown);\n *\n * // \"personsByCity\" now holds:\n * // {\n * // \"New York\": [\n * // {\"name\": \"Jane\", \"city\": \"New York\"},\n * // {\"name\": \"John\", \"city\": \"New York\"}\n * // ],\n * // \"Rome\": [\n * // {\"name\": \"Mario\", \"city\": \"Rome\"}\n * // ],\n * // \"Unknown\": [\n * // {\"name\": \"Paolo\"}\n * // ]\n * // }\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Object}\n */\n function group (arrayLike, iteratee, iterateeContext) {\n var result = {};\n var len = arrayLike.length;\n\n for (var i = 0, element; i < len; i++) {\n element = arrayLike[i];\n var key = iteratee.call(iterateeContext, element, i, arrayLike);\n\n if (key in result) {\n result[key].push(element);\n } else {\n result[key] = [element];\n }\n }\n\n return result;\n }\n\n /**\n * Using the provided iteratee, and its optional context, builds a [partial application]{@link module:lamb.partial}\n * of {@link module:lamb.group|group} expecting the array-like object to act upon.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"age\": 12},\n * {\"name\": \"John\", \"age\": 40},\n * {\"name\": \"Mario\", \"age\": 18},\n * {\"name\": \"Paolo\", \"age\": 15}\n * ];\n *\n * var getAgeStatus = function (person) { return person.age > 20 ? \"over 20\" : \"under 20\"; };\n * var groupByAgeStatus = _.groupBy(getAgeStatus);\n *\n * var personsByAgeStatus = groupByAgeStatus(persons);\n *\n * // \"personsByAgeStatus\" holds:\n * // {\n * // \"under 20\": [\n * // {\"name\": \"Jane\", \"age\": 12},\n * // {\"name\": \"Mario\", \"age\": 18},\n * // {\"name\": \"Paolo\", \"age\": 15}\n * // ],\n * // \"over 20\": [\n * // {\"name\": \"John\", \"age\": 40}\n * // ]\n * // }\n *\n * @memberof module:lamb\n * @category Array\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Function}\n */\n function groupBy (iteratee, iterateeContext) {\n return partial(group, _, iteratee, iterateeContext);\n }\n\n /**\n * Retrieves the first element of an array-like object.
\n * Just a common use case of {@link module:lamb.getAt|getAt} exposed for convenience.\n * @example\n * _.head([1, 2, 3]) // => 1\n * _.head(\"hello\") // => \"h\"\n * _.head([]) // => undefined\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.last|last}\n * @param {ArrayLike} arrayLike\n * @returns {*}\n */\n var head = getAt(0);\n\n /**\n * Returns a copy of the given array-like object without the last element.\n * @example\n * _.init([1, 2, 3, 4]) // => [1, 2, 3]\n * _.init([1]) // => []\n * _.init([]) // => []\n *\n * @memberOf module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.tail|tail}\n * @see {@link module:lamb.head|head}, {@link module:lamb.last|last}\n * @param {ArrayLike} arrayLike\n * @returns {Array}\n */\n var init = partial(slice, _, 0, -1);\n\n /**\n * Returns an array of every item present in all given arrays.
\n * Note that since version 0.13.0 this function uses the [\"SameValueZero\" comparison]{@link module:lamb.isSVZ|isSVZ}.\n * @example\n * var a1 = [1, 2, 3, 4];\n * var a2 = [2, 5, 4, 6];\n * var a3 = [5, 6, 7];\n *\n * _.intersection(a1, a2) // => [2, 4]\n * _.intersection(a1, a3) // => []\n *\n * @memberof module:lamb\n * @category Array\n * @param {...Array} array\n * @return {Array}\n */\n function intersection () {\n var rest = slice(arguments, 1);\n return uniques(arguments[0]).filter(function (item) {\n return rest.every(contains(item));\n });\n }\n\n /**\n * Checks if an array-like object contains the given value.
\n * Please note that the equality test is made with {@link module:lamb.isSVZ|isSVZ}; so you can\n * check for NaN, but 0 and -0 are the same value.
\n * See also {@link module:lamb.contains|contains} for a curried version building a predicate.\n * @example\n * var numbers = [0, 1, 2, 3, NaN];\n *\n * _.isIn(numbers, 1) // => true\n * _.isIn(numbers, 0) // => true\n * _.isIn(numbers, -0) // => true\n * _.isIn(numbers, NaN) // => true\n * _.isIn(numbers, 2, 3) // => false\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {*} value\n * @param {Number} [fromIndex=0] The position at which to begin searching for the given value.\n * @returns {Boolean}\n */\n function isIn (arrayLike, value, fromIndex) {\n var result = false;\n\n for (var i = fromIndex | 0, len = arrayLike.length; i < len; i++) {\n if (isSVZ(value, arrayLike[i])) {\n result = true;\n break;\n }\n }\n\n return result;\n }\n\n /**\n * Retrieves the last element of an array-like object.
\n * Just a common use case of {@link module:lamb.getAt|getAt} exposed for convenience.\n * @example\n * _.last([1, 2, 3]) // => 3\n * _.last(\"hello\") // => \"o\"\n * _.last([]) // => undefined\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.head|head}\n * @param {ArrayLike} arrayLike\n * @returns {*}\n */\n var last = getAt(-1);\n\n /**\n * Generates an array with the values passed as arguments.\n * @example\n * _.list(1, 2, 3) // => [1, 2, 3]\n *\n * @memberof module:lamb\n * @category Array\n * @param {...*} value\n * @returns {Array}\n */\n function list () {\n return arguments.length === 1 ? [arguments[0]] : Array.apply(null, arguments);\n }\n\n /**\n * Builds a partial application of {@link module:lamb.map|map} using the given iteratee and the optional context.\n * The resulting function expects the array-like object to act upon.\n * @example\n * var square = function (n) { return n * n; };\n * var getSquares = _.mapWith(square);\n *\n * getSquares([1, 2, 3, 4, 5]) // => [1, 4, 9, 16, 25]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {function}\n */\n function mapWith (iteratee, iterateeContext) {\n return partial(map, _, iteratee, iterateeContext);\n }\n\n /**\n * Splits an array-like object in two lists: the first with the elements satisfying the given predicate,\n * the others with the remaining elements.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];\n *\n * _.partition(numbers, isEven) // => [[2, 4, 6, 8, 10], [1, 3, 5, 7, 9]]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Array, Array<*>>}\n */\n function partition (arrayLike, predicate, predicateContext) {\n var result = [[], []];\n var len = arrayLike.length;\n\n for (var i = 0, el; i < len; i++) {\n el = arrayLike[i];\n result[predicate.call(predicateContext, el, i, arrayLike) ? 0 : 1].push(el);\n }\n\n return result;\n }\n\n /**\n * Builds a partial application of {@link module:lamb.partition|partition} using the given predicate and the optional context.\n * The resulting function expects the array-like object to act upon.\n * @example\n * var users = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"active\": false},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"active\": true},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"active\": true},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"active\": false}\n * ];\n * var isActive = _.hasKeyValue(\"active\", true);\n * var splitByActiveStatus = _.partitionWith(isActive);\n *\n * splitByActiveStatus(users) // =>\n * // [[\n * // {\"name\": \"John\", \"surname\": \"Doe\", \"active\": true},\n * // {\"name\": \"Mario\", \"surname\": \"Rossi\", \"active\": true}\n * // ], [\n * // {\"name\": \"Jane\", \"surname\": \"Doe\", \"active\": false},\n * // {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"active\": false}\n * // ]]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function partitionWith (predicate, predicateContext) {\n return partial(partition, _, predicate, predicateContext);\n }\n\n /**\n * \"Plucks\" the values of the specified key from a list of objects.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"age\": 12},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"age\": 18},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"age\": 15}\n * ];\n *\n * _.pluck(persons, \"age\") // => [12, 40, 18, 15]\n *\n * var lists = [\n * [1, 2],\n * [3, 4, 5],\n * [6]\n * ];\n *\n * _.pluck(lists, \"length\") // => [2, 3, 1]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {String} key\n * @returns {Array}\n */\n function pluck (arrayLike, key) {\n return map(arrayLike, getKey(key));\n }\n\n /**\n * A curried version of {@link module:lamb.pluck|pluck} expecting the key to retrieve to\n * build a function waiting for the array-like object to act upon.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"age\": 12},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"age\": 18},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"age\": 15}\n * ];\n * var getAges = _.pluckKey(\"age\");\n *\n * getAges(persons) // => [12, 40, 18, 15]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {String} key\n * @returns {Function}\n */\n function pluckKey (key) {\n return mapWith(getKey(key));\n }\n\n /**\n * Flattens the \"first level\" of an array.
\n * See also {@link module:lamb.flatten|flatten}.\n * @example showing the difference with flatten\n * var arr = [1, 2, [3, 4, [5, 6]], 7, 8];\n *\n * _.flatten(arr) // => [1, 2, 3, 4, 5, 6, 7, 8]\n * _.shallowFlatten(arr) // => [1, 2, 3, 4, [5, 6], 7, 8]\n *\n * @memberof module:lamb\n * @category Array\n * @param {Array} array\n * @returns {Array}\n */\n function shallowFlatten (array) {\n return _arrayProto.concat.apply([], array);\n }\n\n /**\n * Returns a copy of the given array-like object without the first element.\n * @example\n * _.tail([1, 2, 3, 4]) // => [2, 3, 4]\n * _.tail([1]) // => []\n * _.tail([]) // => []\n *\n * @memberOf module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.init|init}\n * @see {@link module:lamb.head|head}, {@link module:lamb.last|last}\n * @param {ArrayLike} arrayLike\n * @returns {Array}\n */\n var tail = partial(slice, _, 1, void 0);\n\n /**\n * Retrieves the first n elements from an array or array-like object.\n * Note that, being this a partial application of {@link module:lamb.slice|slice},\n * n can be a negative number.\n * @example\n * var arr = [1, 2, 3, 4, 5];\n *\n * _.take(arr, 3) // => [1, 2, 3]\n * _.take(arr, -1) // => [1, 2, 3, 4]\n * _.take(arr, -10) // => []\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.takeN|takeN}\n * @see {@link module:lamb.drop|drop}, {@link module:lamb.dropN|dropN}\n * @see {@link module:lamb.takeWhile|takeWhile}, {@link module:lamb.dropWhile|dropWhile}\n * @param {ArrayLike} arrayLike\n * @param {Number} n\n * @returns {Array}\n */\n var take = partial(slice, _, 0, _);\n\n /**\n * A curried version of {@link module:lamb.take|take} that expects the number of elements\n * to retrieve to build a function waiting for the list to take the elements from.\n * See the note and examples for {@link module:lamb.take|take} about passing a negative n.\n * @example\n * var take2 = _.takeN(2);\n *\n * take2([1, 2, 3, 4, 5]) // => [1, 2]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.take|take}\n * @see {@link module:lamb.drop|drop}, {@link module:lamb.dropN|dropN}\n * @see {@link module:lamb.takeWhile|takeWhile}, {@link module:lamb.dropWhile|dropWhile}\n * @param {Number} n\n * @returns {Function}\n */\n var takeN = _curry(take, 2, true);\n\n /**\n * Builds a function that takes the first n elements satisfying a predicate from an array or array-like object.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var takeWhileIsEven = _.takeWhile(isEven);\n *\n * takeWhileIsEven([1, 2, 4, 6, 8]) // => []\n * takeWhileIsEven([2, 4, 7, 8]) // => [2, 4]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.dropWhile|dropWhile}\n * @see {@link module:lamb.take|take}, {@link module:lamb.takeN|takeN}\n * @see {@link module:lamb.drop|drop}, {@link module:lamb.dropN|dropN}\n * @param {ListIteratorCallback} predicate\n * @param {Object} predicateContext\n * @returns {Function}\n */\n function takeWhile (predicate, predicateContext) {\n return function (arrayLike) {\n return slice(arrayLike, 0, _findSliceEndIndex(arrayLike, predicate, predicateContext));\n };\n }\n\n /**\n * Transposes a matrix. Can also be used to reverse a {@link module:lamb.zip|zip} operation.
\n * Just like {@link module:lamb.zip|zip}, the received array-like objects will be truncated to the\n * shortest length.\n * @example transposing a matrix\n * _.transpose([\n * [1, 2, 3],\n * [4, 5, 6],\n * [7, 8, 9]\n * ]) // =>\n * // [\n * // [1, 4, 7],\n * // [2, 5, 8],\n * // [3, 6, 9]\n * // ]\n *\n * @example showing the relationship with zip\n * var zipped = _.zip([\"a\", \"b\", \"c\"], [1, 2, 3]); // => [[\"a\", 1], [\"b\", 2], [\"c\", 3]]\n *\n * _.transpose(zipped) // => [[\"a\", \"b\", \"c\"], [1, 2, 3]]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike>} arrayLike\n * @returns {Array>}\n */\n function transpose (arrayLike) {\n var result = [];\n var minLen = apply(Math.min, pluck(arrayLike, \"length\")) | 0;\n var len = arrayLike.length;\n\n for (var i = 0, j; i < minLen; i++) {\n result.push([]);\n\n for (j = 0; j < len; j++) {\n result[i][j] = arrayLike[j][i];\n }\n }\n\n return result;\n }\n\n /**\n * Returns a list of every unique element present in the given array-like objects.\n * @example\n * _.union([1, 2, 3, 2], [3, 4], [1, 5]) // => [1, 2, 3, 4, 5]\n * _.union(\"abc\", \"bcd\", \"cde\") // => [\"a\", \"b\", \"c\", \"d\", \"e\"]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {...ArrayLike} arrayLike\n * @returns {Array}\n */\n var union = compose(uniques, flatMapWith(unary(slice)), list);\n\n /**\n * Returns an array comprised of the unique elements of the given array-like object.
\n * Can work with lists of complex objects if supplied with an iteratee.
\n * Note that since version 0.13.0 this function uses the [\"SameValueZero\" comparison]{@link module:lamb.isSVZ|isSVZ}.\n * @example with simple values\n * _.uniques([1, 2, 2, 3, 4, 3, 5, 1]) // => [1, 2, 3, 4, 5]\n *\n * @example with complex values\n * var data = [\n * {id: \"1\"},\n * {id: \"4\"},\n * {id: \"5\"},\n * {id: \"1\"},\n * {id: \"5\"},\n * ];\n *\n * _.uniques(data, _.getKey(\"id\")) // => [{id: \"1\"}, {id: \"4\"}, {\"id\": 5}]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} [iteratee] Defaults to the [identity function]{@link module:lamb.identity}.\n * @param {Object} [iterateeContext]\n * @returns {Array}\n */\n function uniques (arrayLike, iteratee, iterateeContext) {\n if (typeof iteratee !== \"function\") {\n iteratee = identity;\n }\n\n var result = [];\n var seen = [];\n var value;\n\n for (var i = 0; i < arrayLike.length; i++) {\n value = iteratee.call(iterateeContext, arrayLike[i], i , arrayLike);\n\n if (!isIn(seen, value)) {\n seen.push(value);\n result.push(arrayLike[i]);\n }\n }\n\n return result;\n }\n\n /**\n * Builds a list of arrays out of the given array-like objects by pairing items with the same index.
\n * The received array-like objects will be truncated to the shortest length.
\n * See also {@link module:lamb.zipWithIndex|zipWithIndex} and {@link module:lamb.transpose|transpose} for the reverse operation.\n * @example\n * _.zip(\n * [\"a\", \"b\", \"c\"],\n * [1, 2, 3],\n * [true, false, true]\n * ) // => [[\"a\", 1, true], [\"b\", 2, false], [\"c\", 3, true]]\n *\n * _.zip([1, 2, 3, 4], [5, 6, 7]) // => [[1, 5], [2, 6], [3, 7]]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {...ArrayLike} arrayLike\n * @returns {Array>}\n */\n var zip = compose(transpose, list);\n\n /**\n * \"{@link module:lamb.zip|Zips}\" an array-like object by pairing its values with their index.\n * @example\n * _.zipWithIndex([\"a\", \"b\", \"c\"]) // => [[\"a\", 0], [\"b\", 1], [\"c\", 2]]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @returns {Array>}\n */\n var zipWithIndex = mapWith(binary(list));\n\n lamb.contains = contains;\n lamb.difference = difference;\n lamb.drop = drop;\n lamb.dropN = dropN;\n lamb.dropWhile = dropWhile;\n lamb.filterWith = filterWith;\n lamb.find = find;\n lamb.findIndex = findIndex;\n lamb.flatMap = flatMap;\n lamb.flatMapWith = flatMapWith;\n lamb.flatten = flatten;\n lamb.getAt = getAt;\n lamb.group = group;\n lamb.groupBy = groupBy;\n lamb.head = head;\n lamb.init = init;\n lamb.intersection = intersection;\n lamb.isIn = isIn;\n lamb.last = last;\n lamb.list = list;\n lamb.mapWith = mapWith;\n lamb.partition = partition;\n lamb.partitionWith = partitionWith;\n lamb.pluck = pluck;\n lamb.pluckKey = pluckKey;\n lamb.shallowFlatten = shallowFlatten;\n lamb.tail = tail;\n lamb.take = take;\n lamb.takeN = takeN;\n lamb.takeWhile = takeWhile;\n lamb.transpose = transpose;\n lamb.union = union;\n lamb.uniques = uniques;\n lamb.zip = zip;\n lamb.zipWithIndex = zipWithIndex;\n\n\n function _comparer (a, b) {\n var result = 0;\n\n if (typeof a !== typeof b) {\n a = String(a);\n b = String(b);\n }\n\n if (!isSVZ(a, b)) {\n if (a > b || a !== a) {\n result = 1;\n } else if (a < b || b !== b) {\n result = -1;\n }\n }\n\n return result;\n }\n\n function _compareWith (criteria) {\n var len = criteria.length;\n\n return function (a, b) {\n var result = 0;\n var isDescSort;\n var criterion;\n\n for (var i = 0; i < len; i++) {\n criterion = criteria[i];\n result = criterion.compare(a.value, b.value);\n\n if (result !== 0) {\n isDescSort = criteria[i].isDescending;\n break;\n }\n }\n\n if (result === 0) {\n isDescSort = criteria[len - 1].isDescending;\n result = a.index - b.index;\n }\n\n return isDescSort ? -result : result;\n };\n }\n\n function _getInsertionIndex (array, element, comparer, start, end) {\n if (array.length === 0) {\n return 0;\n }\n\n var pivot = (start + end) >> 1;\n var result = comparer({\n value: element,\n index: pivot\n }, {\n value: array[pivot],\n index: pivot\n });\n\n if (end - start <= 1) {\n return result < 0 ? pivot : pivot + 1;\n } else if (result < 0) {\n return _getInsertionIndex(array, element, comparer, start, pivot);\n } else if (result === 0) {\n return pivot + 1;\n } else {\n return _getInsertionIndex(array, element, comparer, pivot, end);\n }\n }\n\n function _makeCriteria (sorters) {\n return sorters.length ? sorters.map(_makeCriterion) : [_sorter()];\n }\n\n function _makeCriterion (criterion) {\n return typeof Object(criterion).compare === \"function\" ? criterion : _sorter(criterion);\n }\n\n function _sorter (reader, isDescending, comparer) {\n return {\n isDescending: isDescending === true,\n compare: function (a, b) {\n if (typeof reader === \"function\" && reader !== identity) {\n a = reader(a);\n b = reader(b);\n }\n\n return (comparer || _comparer)(a, b);\n }\n };\n }\n\n /**\n * Inserts an element in a copy of a sorted array respecting the sort order.\n * @example with simple values\n * _.insert([], 1) // => [1]\n * _.insert([2, 4, 6], 5) // => [2, 4, 5, 6]\n * _.insert([4, 2, 1], 3, _.sorterDesc()) // => [4, 3, 2, 1]\n *\n * @example with complex values\n * var persons = [\n * {\"name\": \"jane\", \"surname\": \"doe\"},\n * {\"name\": \"John\", \"surname\": \"Doe\"},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\"}\n * ];\n *\n * var getLowerCaseName = _.compose(\n * _.invoker(\"toLowerCase\"),\n * _.getKey(\"name\")\n * );\n *\n * var result = _.insert(\n * persons,\n * {\"name\": \"marco\", \"surname\": \"Rossi\"},\n * getLowerCaseName\n * );\n *\n * // `result` holds:\n * // [\n * // {\"name\": \"jane\", \"surname\": \"doe\"},\n * // {\"name\": \"John\", \"surname\": \"Doe\"},\n * // {\"name\": \"marco\", \"surname\": \"Rossi\"},\n * // {\"name\": \"Mario\", \"surname\": \"Rossi\"}\n * // ]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.sort|sort}, {@link module:lamb.sortWith|sortWith}\n * @see {@link module:lamb.sorter|sorter}, {@link module:lamb.sorterDesc|sorterDesc}\n * @param {Array} array\n * @param {*} element\n * @param {...(Sorter|Function)} [sorter={@link module:lamb.sorter|sorter()}] - The sorting criteria used to sort the array.\n * @returns {Array}\n */\n function insert (array, element) {\n var criteria = _makeCriteria(slice(arguments, 2));\n var result = array.concat();\n var idx = _getInsertionIndex(array, element, _compareWith(criteria), 0, array.length);\n\n result.splice(idx, 0, element);\n return result;\n }\n\n /**\n * Returns a [stably]{@link https://en.wikipedia.org/wiki/Sorting_algorithm#Stability} sorted copy of an\n * array-like object using the given criteria.
\n * Sorting criteria are built using Lamb's {@link module:lamb.sorter|sorter} function, but you can also\n * pass simple \"reader\" functions and default ascending sorters will be built for you.
\n * A \"reader\" is a function that evaluates the array element and supplies the value to be used in the comparison.
\n * Please note that if the arguments received by the default comparer aren't of the same type, they will be compared as strings.\n *\n * @example Stable sort:\n * var persons = [\n * {\"name\": \"John\", \"surname\" :\"Doe\"},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\"},\n * {\"name\": \"John\", \"surname\" :\"Moe\"},\n * {\"name\": \"Jane\", \"surname\": \"Foe\"}\n * ];\n *\n * var personsByName = _.sort(persons, _.getKey(\"name\"));\n *\n * // personsByName holds:\n * // [\n * // {\"name\": \"Jane\", \"surname\": \"Foe\"},\n * // {\"name\": \"John\", \"surname\" :\"Doe\"},\n * // {\"name\": \"John\", \"surname\" :\"Moe\"},\n * // {\"name\": \"Mario\", \"surname\": \"Rossi\"}\n * // ]\n *\n * @example Stable multi-sort:\n * var personsByNameAscSurnameDesc = _.sort(\n * persons,\n * _.getKey(\"name\"),\n * _.sorterDesc(_.getKey(\"surname\"))\n * );\n *\n * // personsByNameAscSurnameDesc holds:\n * // [\n * // {\"name\": \"Jane\", \"surname\": \"Foe\"},\n * // {\"name\": \"John\", \"surname\" :\"Moe\"},\n * // {\"name\": \"John\", \"surname\" :\"Doe\"},\n * // {\"name\": \"Mario\", \"surname\": \"Rossi\"}\n * // ]\n *\n * @example Using custom comparers:\n * var localeSorter = new Intl.Collator(\"it\");\n * var chars = [\"a\", \"è\", \"à \", \"é\", \"c\", \"b\", \"e\"];\n *\n * _.sort(chars, localeSorter) // => [\"a\", \"à \", \"b\", \"c\", \"e\", \"é\", \"è\"]\n *\n * var localeSorterDesc = _.sorterDesc(_.identity, localeSorter.compare);\n *\n * _.sort(chars, localeSorterDesc) // => [\"è\", \"é\", \"e\", \"c\", \"b\", \"à \", \"a\"]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.sortWith|sortWith}\n * @see {@link module:lamb.sorter|sorter}, {@link module:lamb.sorterDesc|sorterDesc}\n * @param {ArrayLike} arrayLike\n * @param {...(Sorter|Function)} [sorter={@link module:lamb.sorter|sorter()}]\n * @returns {Array}\n */\n function sort (arrayLike) {\n var criteria = _makeCriteria(slice(arguments, 1));\n var data = [];\n var result = [];\n var len = arrayLike.length;\n\n for (var i = 0; i < len; i++) {\n data.push({\n value: arrayLike[i],\n index: i\n });\n }\n\n data.sort(_compareWith(criteria));\n\n for (i = 0; i < len; i++) {\n result.push(data[i].value);\n }\n\n return result;\n }\n\n /**\n * Creates an ascending sort criterion with the provided reader and comparer.
\n * See {@link module:lamb.sort|sort} for various examples.\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.insert|insert}\n * @see {@link module:lamb.sort|sort}, {@link module:lamb.sortWith|sortWith}\n * @see {@link module:lamb.sorterDesc|sorterDesc}\n * @param {Function} [reader={@link module:lamb.identity|identity}] A function meant to generate a simple value from a complex one. The function should evaluate the array element and supply the value to be passed to the comparer.\n * @param {Function} [comparer] An optional custom comparer function.\n * @returns {Sorter}\n */\n var sorter = partial(_sorter, _, false, _);\n\n /**\n * Creates a descending sort criterion with the provided reader and comparer.
\n * See {@link module:lamb.sort|sort} for various examples.\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.insert|insert}\n * @see {@link module:lamb.sort|sort}, {@link module:lamb.sortWith|sortWith}\n * @see {@link module:lamb.sorter|sorter}\n * @param {Function} [reader={@link module:lamb.identity|identity}] A function meant to generate a simple value from a complex one. The function should evaluate the array element and supply the value to be passed to the comparer.\n * @param {Function} [comparer] An optional custom comparer function.\n * @returns {Sorter}\n */\n var sorterDesc = partial(_sorter, _, true, _);\n\n /**\n * Builds a partial application of {@link module:lamb.sort|sort} using the provided criteria. The returned\n * function expects the array-like object to sort.\n * As usual, sorting criteria are built using Lamb's {@link module:lamb.sorter|sorter} function, but you can also\n * pass simple \"reader\" functions and default ascending sorters will be built.
\n * A \"reader\" is a function that evaluates the array element and supplies the value to be used in the comparison.
\n * See {@link module:lamb.sort|sort} for more examples.\n *\n * @example\n * var sortAsNumbers = _.sortWith(parseFloat);\n * var weights = [\"2 Kg\", \"10 Kg\", \"1 Kg\", \"7 Kg\"];\n *\n * sortAsNumbers(weights) // => [\"1 Kg\", \"2 Kg\", \"7 Kg\", \"10 Kg\"]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.sort|sort}\n * @see {@link module:lamb.sorter|sorter}, {@link module:lamb.sorterDesc|sorterDesc}\n * @param {...(Sorter|Function)} [sorter={@link module:lamb.sorter|sorter()}]\n * @returns {Function}\n */\n function sortWith () {\n var sorters = slice(arguments);\n\n return function (arrayLike) {\n return sort.apply(null, [arrayLike].concat(sorters));\n };\n }\n\n lamb.insert = insert;\n lamb.sort = sort;\n lamb.sorter = sorter;\n lamb.sorterDesc = sorterDesc;\n lamb.sortWith = sortWith;\n\n\n function _currier (fn, arity, isRightCurry, slicer, argsHolder) {\n return function () {\n var args = argsHolder.concat(slicer(arguments));\n\n if (args.length >= arity) {\n return fn.apply(this, isRightCurry ? args.reverse() : args);\n } else {\n return _currier(fn, arity, isRightCurry, slicer, args);\n }\n };\n }\n\n function _curry (fn, arity, isRightCurry, isAutoCurry) {\n var slicer = isAutoCurry ? slice : function (a) {\n return a.length ? [a[0]] : [];\n };\n\n if ((arity | 0) !== arity) {\n arity = fn.length;\n }\n\n return _currier(fn, arity, isRightCurry, slicer, []);\n }\n\n /**\n * Applies the passed function to the given argument list.\n * @example\n * _.apply(_.add, [3, 4]) // => 7\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {ArrayLike} args\n * @returns {*}\n */\n function apply (fn, args) {\n return fn.apply(fn, slice(args));\n }\n\n /**\n * A curried version of {@link module:lamb.apply|apply}. Expects an array-like object to use as arguments\n * and builds a function waiting for the target of the application.\n * @example\n * var data = [3, 4];\n * var applyDataTo = _.applyArgs(data);\n *\n * applyDataTo(_.add) // => 7\n * applyDataTo(_.multiply) // => 12\n *\n * @memberof module:lamb\n * @category Function\n * @function\n * @param {ArrayLike} args\n * @returns {Function}\n */\n var applyArgs = _curry(apply, 2, true);\n\n /**\n * Builds a function that passes only the specified amount of arguments to the given function.
\n * See also {@link module:lamb.binary|binary} and {@link module:lamb.unary|unary} for common use\n * cases shortcuts.\n * @example\n * var data = [\"1-2\", \"13-5\", \"6-23\"];\n * var getDashIndex = _.invoker(\"indexOf\", \"-\");\n *\n * data.map(getDashIndex) // => [1, 2, -1]\n * data.map(_.aritize(getDashIndex, 1)) // = > [1, 2, 1]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} arity\n * @returns {Function}\n */\n function aritize (fn, arity) {\n return function () {\n return apply(fn, slice(arguments, 0, arity));\n };\n }\n\n /**\n * Builds a function that passes only two arguments to the given function.
\n * It's simply a shortcut for a common use case of {@link module:lamb.aritize|aritize},\n * exposed for convenience.
\n * See also {@link module:lamb.unary|unary}.\n * @example\n * _.list(1, 2, 3, 4, 5) // => [1, 2, 3, 4, 5]\n * _.binary(_.list)(1, 2, 3, 4, 5) // => [1, 2]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @returns {Function}\n */\n function binary (fn) {\n return function (a, b) {\n return fn(a, b);\n };\n }\n\n /**\n * Transforms the evaluation of the given function in the evaluation of a sequence of functions\n * expecting only one argument. Each function of the sequence is a partial application of the\n * original one, which will be applied when the specified (or derived) arity is consumed.
\n * Currying will start from the leftmost argument: use {@link module:lamb.curryRight|curryRight}\n * for right currying.
\n * See also {@link module:lamb.curryable|curryable}, {@link module:lamb.curryableRight|curryableRight}\n * and {@link module:lamb.partial|partial}.\n * @example\n * var multiplyBy = _.curry(_.multiply);\n * var multiplyBy10 = multiplyBy(10);\n *\n * multiplyBy10(5) // => 50\n * multiplyBy10()(5) // => 50\n * multiplyBy10()()(2) // => 20\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} [arity=fn.length]\n * @returns {Function}\n */\n function curry (fn, arity) {\n return _curry(fn, arity, false);\n }\n\n /**\n * Same as {@link module:lamb.curry|curry}, but currying starts from the rightmost argument.\n * @example\n * var divideBy = _.curryRight(_.divide);\n * var halve = divideBy(2);\n * halve(3) // => 1.5\n * halve(3, 7) // => 1.5\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} [arity=fn.length]\n * @returns {Function}\n */\n function curryRight (fn, arity) {\n return _curry(fn, arity, true);\n }\n\n /**\n * Builds an auto-curried function. The resulting function can be called multiple times with\n * any number of arguments, and the original function will be applied only when the specified\n * (or derived) arity is consumed.
\n * Currying will start from the leftmost argument: use {@link module:lamb.curryableRight|curryableRight}\n * for right currying.
\n * Note that you can pass undefined values as arguments explicitly, if you are so inclined, but empty\n * calls doesn't consume the arity.
\n * See also {@link module:lamb.curry|curry}, {@link module:lamb.curryRight|curryRight} and\n * {@link module:lamb.partial|partial}.\n * @example\n * var collectFourElements = _.curryable(_.list, 4);\n *\n * collectFourElements(2)(3)(4)(5) // => [2, 3, 4, 5]\n * collectFourElements(2)(3, 4)(5) // => [2, 3, 4, 5]\n * collectFourElements(2, 3, 4, 5) // => [2, 3, 4, 5]\n * collectFourElements()(2)()(3, 4, 5) // => [2, 3, 4, 5]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} [arity=fn.length]\n * @returns {Function}\n */\n function curryable (fn, arity) {\n return _curry(fn, arity, false, true);\n }\n\n /**\n * Same as {@link module:lamb.curryable|curryable}, but currying starts from the rightmost argument.\n * @example\n * var collectFourElements = _.curryableRight(_.list, 4);\n *\n * collectFourElements(2)(3)(4)(5) // => [5, 4, 3, 2]\n * collectFourElements(2)(3, 4)(5) // => [5, 4, 3, 2]\n * collectFourElements(2, 3, 4, 5) // => [5, 4, 3, 2]\n * collectFourElements()(2)()(3, 4, 5) // => [5, 4, 3, 2]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} [arity=fn.length]\n * @returns {Function}\n */\n function curryableRight (fn, arity) {\n return _curry(fn, arity, true, true);\n }\n\n /**\n * Returns a function that will execute the given function only if it stops being called for the specified timespan.
\n * See also {@link module:lamb.throttle|throttle} for a different behaviour where the first call happens immediately.\n * @example A common use case of debounce in a browser environment\n * var updateLayout = function () {\n * // some heavy DOM operations here\n * };\n *\n * window.addEventListener(\"resize\", _.debounce(updateLayout, 200), false);\n *\n * // The resize event is fired repeteadly until the user stops resizing the\n * // window, while the `updateLayout` function is called only once: 200 ms\n * // after he stopped.\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} timespan - Expressed in milliseconds\n * @returns {Function}\n */\n function debounce (fn, timespan) {\n var timeoutID;\n\n return function () {\n var context = this;\n var args = arguments;\n var debounced = function () {\n timeoutID = null;\n fn.apply(context, args);\n };\n\n clearTimeout(timeoutID);\n timeoutID = setTimeout(debounced, timespan);\n };\n }\n\n /**\n * Returns a function that applies its arguments to the original function in reverse order.\n * @example\n * _.list(1, 2, 3) // => [1, 2, 3]\n * _.flip(_.list)(1, 2, 3) // => [3, 2, 1]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @returns {Function}\n */\n function flip (fn) {\n return function () {\n var args = slice(arguments).reverse();\n return fn.apply(this, args);\n };\n }\n\n /**\n * Accepts an object and builds a function expecting a method name, and optionally arguments, to call on such object.\n * Like {@link module:lamb.invoker|invoker}, if no method with the given name is found the function will return undefined.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var arr = [1, 2, 3, 4, 5];\n * var invokerOnArr = _.invokerOn(arr);\n *\n * invokerOnArr(\"filter\", isEven) // => [2, 4]\n * invokerOnArr(\"slice\", 1, 3) // => [2, 3]\n *\n * @memberof module:lamb\n * @category Function\n * @see {@link module:lamb.invoker|invoker}\n * @param {Object} target\n * @returns {Function}\n */\n function invokerOn (target) {\n return function (methodName) {\n var args = slice(arguments, 1);\n var method = target[methodName];\n return type(method) === \"Function\" ? method.apply(target, args) : void 0;\n };\n }\n\n /**\n * Builds a function that will invoke the given method name on any received object and return\n * the result. If no method with such name is found the function will return undefined.\n * Along with the method name it's possible to supply some arguments that will be bound to the method call.
\n * Further arguments can also be passed when the function is actually called, and they will be concatenated\n * to the bound ones.
\n * If different objects share a method name it's possible to build polymorphic functions as you can see in\n * the example below.
\n * {@link module:lamb.condition|Condition} can be used to wrap invoker to avoid this behaviour\n * by adding a predicate, while {@link module:lamb.adapter|adapter} can build more complex polymorphic functions\n * without the need of homonymy.
\n * Returning undefined or checking for such value is meant to favor composition and interoperability\n * between the aforementioned functions: for a more standard behaviour see also {@link module:lamb.generic|generic}.\n * See also {@link module:lamb.invokerOn|invokerOn}.\n * @example Basic polymorphism with invoker\n * var polySlice = _.invoker(\"slice\");\n *\n * polySlice([1, 2, 3, 4, 5], 1, 3) // => [2, 3]\n * polySlice(\"Hello world\", 1, 3) // => \"el\"\n *\n * @example With bound arguments\n * var substrFrom2 = _.invoker(\"substr\", 2);\n * substrFrom2(\"Hello world\") // => \"llo world\"\n * substrFrom2(\"Hello world\", 5) // => \"llo w\"\n *\n * @memberof module:lamb\n * @category Function\n * @param {String} methodName\n * @param {...*} [boundArg]\n * @returns {Function}\n */\n function invoker (methodName) {\n var boundArgs = slice(arguments, 1);\n\n return function (target) {\n var args = slice(arguments, 1);\n var method = target[methodName];\n return type(method) === \"Function\" ? method.apply(target, boundArgs.concat(args)) : void 0;\n };\n }\n\n /**\n * Builds a function that allows to map over the received arguments before applying them to the original one.\n * @example\n * var sumArray = _.invoker(\"reduce\", _.add);\n * var sum = _.compose(sumArray, _.list);\n *\n * sum(1, 2, 3, 4, 5) // => 15\n *\n * var square = _.partial(Math.pow, _, 2);\n * var sumSquares = _.mapArgs(sum, square);\n *\n * sumSquares(1, 2, 3, 4, 5) // => 55\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {ListIteratorCallback} mapper\n * @returns {Function}\n */\n function mapArgs (fn, mapper) {\n return compose(partial(apply, fn), mapWith(mapper), list);\n }\n\n /**\n * Creates a pipeline of functions, where each function consumes the result of the previous one.
\n * See also {@link module:lamb.compose|compose}.\n * @example\n * var square = _.partial(Math.pow, _, 2);\n * var getMaxAndSquare = _.pipe(Math.max, square);\n *\n * getMaxAndSquare(3, 5) // => 25\n *\n * @memberof module:lamb\n * @category Function\n * @function\n * @param {...Function} fn\n * @returns {Function}\n */\n var pipe = flip(compose);\n\n /**\n * Builds a function that allows to \"tap\" into the arguments of the original one.\n * This allows to extract simple values from complex ones, transform arguments or simply intercept them.\n * If a \"tapper\" isn't found the argument is passed as it is.\n * @example\n * var someObject = {count: 5};\n * var someArrayData = [2, 3, 123, 5, 6, 7, 54, 65, 76, 0];\n * var getDataAmount = _.tapArgs(_.add, _.getKey(\"count\"), _.getKey(\"length\"));\n *\n * getDataAmount(someObject, someArrayData); // => 15\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {...?Function} [tapper]\n * @returns {Function}\n */\n function tapArgs (fn) {\n var readers = slice(arguments, 1);\n\n return function () {\n var len = arguments.length;\n var args = [];\n\n for (var i = 0; i < len; i++) {\n args.push(readers[i] ? readers[i](arguments[i]) : arguments[i]);\n }\n\n return fn.apply(this, args);\n };\n }\n\n /**\n * Returns a function that will invoke the passed function at most once in the given timespan.
\n * The first call in this case happens as soon as the function is invoked; see also {@link module:lamb.debounce|debounce}\n * for a different behaviour where the first call is delayed.\n * @example\n * var log = _.throttle(console.log.bind(console), 5000);\n *\n * log(\"Hi\"); // console logs \"Hi\"\n * log(\"Hi again\"); // nothing happens\n * // after five seconds\n * log(\"Hello world\"); // console logs \"Hello world\"\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} timespan - Expressed in milliseconds.\n * @returns {Function}\n */\n function throttle (fn, timespan) {\n var result;\n var lastCall = 0;\n\n return function () {\n var now = Date.now();\n\n if (now - lastCall >= timespan) {\n lastCall = now;\n result = fn.apply(this, arguments);\n }\n\n return result;\n };\n }\n\n /**\n * Builds a function that passes only one argument to the given function.
\n * It's simply a shortcut for a common use case of {@link module:lamb.aritize|aritize},\n * exposed for convenience.
\n * See also {@link module:lamb.binary|binary}.\n * @example\n * var weights = [\"2 Kg\", \"10 Kg\", \"1 Kg\", \"7 Kg\"];\n *\n * weights.map(_.unary(parseInt)) // => [2, 10, 1, 7]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @returns {Function}\n */\n function unary (fn) {\n return function (a) {\n return fn(a);\n };\n }\n\n /**\n * Wraps the function fn inside a wrapper function.
\n * This allows to conditionally execute fn, to tamper with its arguments or return value\n * and to run code before and after its execution.
\n * Being this nothing more than a \"{@link module:lamb.flip|flipped}\" [partial application]{@link module:lamb.partial},\n * you can also easily build new functions from existent ones.\n * @example\n * var arrayMax = _.wrap(Math.max, _.apply);\n *\n * arrayMax([4, 5, 2, 6, 1]) // => 6\n *\n * @memberof module:lamb\n * @category Function\n * @function\n * @param {Function} fn\n * @param {Function} wrapper\n * @returns {Function}\n */\n var wrap = binary(flip(partial));\n\n lamb.apply = apply;\n lamb.applyArgs = applyArgs;\n lamb.aritize = aritize;\n lamb.binary = binary;\n lamb.curry = curry;\n lamb.curryRight = curryRight;\n lamb.curryable = curryable;\n lamb.curryableRight = curryableRight;\n lamb.debounce = debounce;\n lamb.flip = flip;\n lamb.invokerOn = invokerOn;\n lamb.invoker = invoker;\n lamb.mapArgs = mapArgs;\n lamb.pipe = pipe;\n lamb.tapArgs = tapArgs;\n lamb.throttle = throttle;\n lamb.unary = unary;\n lamb.wrap = wrap;\n\n\n /**\n * Accepts a series of functions and builds a function that applies the received arguments to each one and\n * returns the first non undefined value.
\n * Meant to work in sinergy with {@link module:lamb.condition|condition} and {@link module:lamb.invoker|invoker},\n * can be useful as a strategy pattern for functions, to mimic conditional logic and also to build polymorphic functions.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var filterString = _.compose(_.invoker(\"join\", \"\"), _.filter);\n * var filterAdapter = _.adapter(\n * _.invoker(\"filter\"),\n * _.condition(_.isType(\"String\"), filterString)\n * );\n *\n * filterAdapter([1, 2, 3, 4, 5, 6], isEven)) // => [2, 4, 6]\n * filterAdapter(\"123456\", isEven)) // => \"246\"\n * filterAdapter({}, isEven)) // => undefined\n *\n * // obviously it's composable\n * var filterWithDefault = _.adapter(filterAdapter, _.always(\"Not implemented\"));\n *\n * filterWithDefault([1, 2, 3, 4, 5, 6], isEven)) // => [2, 4, 6]\n * filterWithDefault(\"123456\", isEven)) // => \"246\"\n * filterWithDefault({}, isEven)) // => \"Not implemented\"\n *\n * @memberof module:lamb\n * @category Logic\n * @param {...Function} fn\n * @returns {Function}\n */\n function adapter () {\n var functions = slice(arguments);\n\n return function () {\n var len = functions.length;\n var result;\n\n for (var i = 0; i < len; i++) {\n result = apply(functions[i], arguments);\n\n if (!isUndefined(result)) {\n break;\n }\n }\n\n return result;\n };\n }\n\n /**\n * Builds a predicate that returns true if all the given predicates are satisfied.\n * The arguments passed to the resulting function are applied to every predicate unless one of them returns false.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var isPositive = function (n) { return n > 0; };\n * var isPositiveEven = _.allOf(isEven, isPositive);\n *\n * isPositiveEven(-2) // => false\n * isPositiveEven(11) // => false\n * isPositiveEven(6) // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {...Function} predicate\n * @returns {Function}\n */\n function allOf () {\n var predicates = slice(arguments);\n\n return function () {\n var args = arguments;\n\n return predicates.every(function (predicate) {\n return predicate.apply(null, args);\n });\n };\n }\n\n /**\n * Builds a predicate that returns true if at least one of the given predicates is satisfied.\n * The arguments passed to the resulting function are applied to every predicate until one of them returns true.\n * @example\n * // Lamb's \"isNil\" is actually implemented like this\n * var isNil = _.anyOf(_.isNull, _.isUndefined);\n *\n * isNil(NaN) // => false\n * isNil({}) // => false\n * isNil(null) // => true\n * isNil(void 0) // => true\n * isNil() // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {...Function} predicate\n * @returns {Function}\n */\n function anyOf () {\n var predicates = slice(arguments);\n\n return function () {\n var args = arguments;\n\n return predicates.some(function (predicate) {\n return predicate.apply(null, args);\n });\n };\n }\n\n /**\n * Builds a function that will apply the received arguments to trueFn, if the predicate is satisfied with\n * the same arguments, or to falseFn otherwise.
\n * If falseFn isn't provided and the predicate isn't satisfied the function will return undefined.
\n * Although you can use other conditions as trueFn or falseFn, it's probably better to\n * use {@link module:lamb.adapter|adapter} to build more complex behaviours.\n * @example\n * var isEven = function (n) { return n % 2 === 0};\n * var halve = function (n) { return n / 2; };\n * var halveIfEven = _.condition(isEven, halve, _.identity);\n *\n * halveIfEven(5) // => 5\n * halveIfEven(6) // => 3\n *\n * @memberof module:lamb\n * @category Logic\n * @see {@link module:lamb.invoker|invoker}\n * @param {Function} predicate\n * @param {Function} trueFn\n * @param {Function} [falseFn]\n * @returns {Function}\n */\n function condition (predicate, trueFn, falseFn) {\n return function () {\n var applyArgsTo = applyArgs(arguments);\n return applyArgsTo(predicate) ? applyArgsTo(trueFn) : falseFn ? applyArgsTo(falseFn) : void 0;\n };\n }\n\n /**\n * Verifies that the two supplied values are the same value using the \"SameValue\" comparison.
\n * Note that this doesn't behave as the strict equality operator, but rather as a shim of ES6's\n * [Object.is]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is}.\n * Differences are that 0 and -0 aren't the same value and, finally, NaN is equal to itself.
\n * See also {@link module:lamb.isSVZ|isSVZ} which performs the check using the \"SameValueZero\" comparison.\n * @example\n * var testObject = {};\n *\n * _.is({}, testObject) // => false\n * _.is(testObject, testObject) // => true\n * _.is(\"foo\", \"foo\") // => true\n * _.is(0, -0) // => false\n * _.is(0 / 0, NaN) // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @see [SameValue comparison]{@link https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevalue}\n * @see [SameValueZero comparison]{@link https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero}\n * @param {*} a\n * @param {*} b\n * @returns {Boolean}\n */\n function is (a, b) {\n return a === 0 && b === 0 ? 1 / a === 1 / b : isSVZ(a, b);\n }\n\n /**\n * Verifies that the first given value is greater than the second.\n * @example\n * var pastDate = new Date(2010, 2, 12);\n * var today = new Date();\n *\n * _.isGT(today, pastDate) // true\n * _.isGT(pastDate, today) // false\n * _.isGT(3, 4) // false\n * _.isGT(3, 3) // false\n * _.isGT(3, 2) // true\n * _.isGT(0, -0) // false\n * _.isGT(-0, 0) // false\n * _.isGT(\"a\", \"A\") // true\n * _.isGT(\"b\", \"a\") // true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Number|String|Date|Boolean} a\n * @param {Number|String|Date|Boolean} b\n * @returns {Boolean}\n */\n function isGT (a, b) {\n return a > b;\n }\n\n /**\n * Verifies that the first given value is greater than or equal to the second.\n * Regarding equality, beware that this is simply a wrapper for the native operator, so -0 === 0.\n * @example\n * _.isGTE(3, 4) // false\n * _.isGTE(3, 3) // true\n * _.isGTE(3, 2) // true\n * _.isGTE(0, -0) // true\n * _.isGTE(-0, 0) // true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Number|String|Date|Boolean} a\n * @param {Number|String|Date|Boolean} b\n * @returns {Boolean}\n */\n function isGTE (a, b) {\n return a >= b;\n }\n\n /**\n * Verifies that the first given value is less than the second.\n * @example\n * var pastDate = new Date(2010, 2, 12);\n * var today = new Date();\n *\n * _.isLT(today, pastDate) // false\n * _.isLT(pastDate, today) // true\n * _.isLT(3, 4) // true\n * _.isLT(3, 3) // false\n * _.isLT(3, 2) // false\n * _.isLT(0, -0) // false\n * _.isLT(-0, 0) // false\n * _.isLT(\"a\", \"A\") // false\n * _.isLT(\"a\", \"b\") // true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Number|String|Date|Boolean} a\n * @param {Number|String|Date|Boolean} b\n * @returns {Boolean}\n */\n function isLT (a, b) {\n return a < b;\n }\n\n /**\n * Verifies that the first given value is less than or equal to the second.\n * Regarding equality, beware that this is simply a wrapper for the native operator, so -0 === 0.\n * @example\n * _.isLTE(3, 4) // true\n * _.isLTE(3, 3) // true\n * _.isLTE(3, 2) // false\n * _.isLTE(0, -0) // true\n * _.isLTE(-0, 0) // true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Number|String|Date|Boolean} a\n * @param {Number|String|Date|Boolean} b\n * @returns {Boolean}\n */\n function isLTE (a, b) {\n return a <= b;\n }\n\n /**\n * A simple negation of {@link module:lamb.is|is}, exposed for convenience.\n * @example\n * _.isNot(\"foo\", \"foo\") // => false\n * _.isNot(0, -0) // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @function\n * @param {*} valueA\n * @param {*} valueB\n * @returns {Boolean}\n */\n var isNot = not(is);\n\n /**\n * Verifies that the two supplied values are the same value using the \"SameValueZero\" comparison.
\n * With this comparison NaN is equal to itself, but 0 and -0 are\n * considered the same value too.
\n * See also {@link module:lamb.is|is} to perform a \"SameValue\" comparison.\n * @example\n * var testObject = {};\n *\n * _.isSVZ({}, testObject) // => false\n * _.isSVZ(testObject, testObject) // => true\n * _.isSVZ(\"foo\", \"foo\") // => true\n * _.isSVZ(0, -0) // => true\n * _.isSVZ(0 / 0, NaN) // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @see [SameValue comparison]{@link https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevalue}\n * @see [SameValueZero comparison]{@link https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero}\n * @param {*} a\n * @param {*} b\n * @returns {Boolean}\n */\n function isSVZ (a, b) {\n return a !== a ? b !== b : a === b;\n }\n\n /**\n * Returns a predicate that negates the given one.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var isOdd = _.not(isEven);\n *\n * isOdd(5) // => true\n * isOdd(4) // => false\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Function} predicate\n * @returns {Function}\n */\n function not (predicate) {\n return function () {\n return !predicate.apply(null, arguments);\n };\n }\n\n lamb.adapter = adapter;\n lamb.allOf = allOf;\n lamb.anyOf = anyOf;\n lamb.condition = condition;\n lamb.is = is;\n lamb.isGT = isGT;\n lamb.isGTE = isGTE;\n lamb.isLT = isLT;\n lamb.isLTE = isLTE;\n lamb.isNot = isNot;\n lamb.isSVZ = isSVZ;\n lamb.not = not;\n\n\n /**\n * Adds two numbers.\n * @example\n * _.add(4, 5) // => 9\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function add (a, b) {\n return a + b;\n }\n\n /**\n * \"Clamps\" a number within the given limits.\n * @example\n * _.clamp(-5, 0, 10) // => 0\n * _.clamp(5, 0, 10) // => 5\n * _.clamp(15, 0, 10) // => 10\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} n\n * @param {Number} min\n * @param {Number} max\n * @returns {Number}\n */\n function clamp (n, min, max) {\n return n < min ? min : n > max ? max : n;\n }\n\n /**\n * Divides two numbers.\n * @example\n * _.divide(5, 2) // => 2.5\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function divide (a, b) {\n return a / b;\n }\n\n /**\n * Performs the modulo operation and should not be confused with the {@link module:lamb.remainder|remainder}.\n * The function performs a floored division to calculate the result and not a truncated one, hence the sign of\n * the dividend is not kept, unlike the {@link module:lamb.remainder|remainder}.\n * @example\n * _.modulo(5, 3) // => 2\n * _.remainder(5, 3) // => 2\n *\n * _.modulo(-5, 3) // => 1\n * _.remainder(-5, 3) // => -2\n *\n * @memberof module:lamb\n * @category Math\n * @see {@link http://en.wikipedia.org/wiki/Modulo_operation}\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function modulo (a, b) {\n return a - (b * Math.floor(a / b));\n }\n\n /**\n * Multiplies two numbers.\n * @example\n * _.multiply(5, 3) // => 15\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function multiply (a, b) {\n return a * b;\n }\n\n /**\n * Generates a random integer between two given integers, both included.\n * Note that no safety measure is taken if the provided arguments aren't integers, so\n * you may end up with unexpected (not really) results.\n * For example randomInt(0.1, 1.2) could be 2.\n * @example\n *\n * _.randomInt(1, 10) // => an integer >=1 && <= 10\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} min\n * @param {Number} max\n * @returns {Number}\n */\n function randomInt (min, max) {\n return Math.floor(Math.random() * (max - min + 1) + min);\n }\n\n /**\n * Generates an arithmetic progression of numbers starting from start up to,\n * but not including, limit, using the given step.\n * @example\n * _.range(2, 10) // => [2, 3, 4, 5, 6, 7, 8, 9]\n * _.range(2, 10, 0) // => [2]\n * _.range(1, -10, -2) // => [1, -1, -3, -5, -7, -9]\n * _.range(1, -10, 2) // => [1]\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} start\n * @param {Number} limit\n * @param {Number} [step=1]\n * @returns {Number[]}\n */\n function range (start, limit, step) {\n if (step === 0 || arguments.length < 2) {\n return [start];\n }\n\n if (!step) {\n step = 1;\n }\n\n var len = Math.max(Math.ceil((limit - start) / step), 0);\n return sequence(start, len, partial(add, step));\n }\n\n /**\n * Gets the remainder of the division of two numbers.\n * Not to be confused with the {@link module:lamb.modulo|modulo} as the remainder\n * keeps the sign of the dividend and may lead to some unexpected results.\n * @example\n * // example of wrong usage of the remainder\n * // (in this case the modulo operation should be used)\n * var isOdd = function (n) { return _.remainder(n, 2) === 1; };\n * isOdd(-3) // => false as -3 % 2 === -1\n *\n * @memberof module:lamb\n * @category Math\n * @see {@link http://en.wikipedia.org/wiki/Modulo_operation}\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function remainder (a, b) {\n return a % b;\n }\n\n /**\n * Generates a sequence of values of the desired length with the provided iteratee.\n * The values being iterated, and received by the iteratee, are the results generated so far.\n * @example\n * var fibonacci = function (n, idx, list) {\n * return n + (list[idx - 1] || 0);\n * };\n *\n * _.sequence(1, 10, fibonacci) // => [1, 1, 2, 3, 5, 8, 13, 21, 34, 55]\n *\n * @memberof module:lamb\n * @category Math\n * @param {*} start - The starting value\n * @param {Number} len - The desired length for the sequence\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Array}\n */\n function sequence (start, len, iteratee, iterateeContext) {\n var result = [start];\n\n for (var i = 0, limit = len - 1; i < limit; i++) {\n result.push(iteratee.call(iterateeContext, result[i], i, result));\n }\n\n return result;\n }\n\n /**\n * Subtracts two numbers.\n * @example\n * _.subtract(5, 3) // => 2\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function subtract (a, b) {\n return a - b;\n }\n\n lamb.add = add;\n lamb.clamp = clamp;\n lamb.divide = divide;\n lamb.modulo = modulo;\n lamb.multiply = multiply;\n lamb.randomInt = randomInt;\n lamb.range = range;\n lamb.remainder = remainder;\n lamb.sequence = sequence;\n lamb.subtract = subtract;\n\n\n function _immutable (obj, seen) {\n if (seen.indexOf(obj) === -1) {\n seen.push(Object.freeze(obj));\n\n Object.getOwnPropertyNames(obj).forEach(function (key) {\n var value = obj[key];\n\n if (typeof value === \"object\" && !isNull(value)) {\n _immutable(value, seen);\n }\n });\n }\n\n return obj;\n }\n\n function _keyToPair (key) {\n return [key, this[key]];\n }\n\n function _merge (getKeys) {\n return reduce(slice(arguments, 1), function (result, source) {\n forEach(getKeys(source), function (key) {\n result[key] = source[key];\n });\n\n return result;\n }, {});\n }\n\n var _pairsFrom = _curry(function (getKeys, obj) {\n return getKeys(obj).map(_keyToPair, obj);\n });\n\n var _tearFrom = _curry(function (getKeys, obj) {\n return getKeys(obj).reduce(function (result, key) {\n result[0].push(key);\n result[1].push(obj[key]);\n return result;\n }, [[], []]);\n });\n\n var _valuesFrom = _curry(function (getKeys, obj) {\n return getKeys(obj).map(partial(get, obj));\n });\n\n /**\n * Builds a checker function meant to be used with {@link module:lamb.validate|validate}.
\n * Note that the function accepts multiple keyPaths as a means to compare their values. In\n * other words all the received keyPaths will be passed as arguments to the predicate\n * to run the test.
\n * If you want to run the same single property check with multiple properties, you should build\n * multiple checkers and combine them with {@link module:lamb.validate|validate}.\n * @example\n * var user = {\n * name: \"John\",\n * surname: \"Doe\",\n * login: {\n * username: \"jdoe\",\n * password: \"abc123\",\n * passwordConfirm: \"abc123\"\n * }\n * };\n * var pwdMatch = _.checker(\n * _.is,\n * \"Passwords don't match\",\n * [\"login.password\", \"login.passwordConfirm\"]\n * );\n *\n * pwdMatch(user) // => []\n *\n * user.login.passwordConfirm = \"avc123\";\n *\n * pwdMatch(user) // => [\"Passwords don't match\", [\"login.password\", \"login.passwordConfirm\"]]\n *\n * @memberof module:lamb\n * @category Object\n * @param {Function} predicate - The predicate to test the object properties\n * @param {String} message - The error message\n * @param {String[]} keyPaths - The array of property names, or {@link module:lamb.getWithPath|paths}, to test.\n * @param {String} [pathSeparator=\".\"]\n * @returns {Array} An error in the form [\"message\", [\"propertyA\", \"propertyB\"]] or an empty array.\n */\n function checker (predicate, message, keyPaths, pathSeparator) {\n return function (obj) {\n var getValues = partial(getWithPath, obj, _, pathSeparator);\n return predicate.apply(obj, keyPaths.map(getValues)) ? [] : [message, keyPaths];\n };\n }\n\n /**\n * Creates an array with all the enumerable properties of the given object.\n * @example showing the difference with Object.keys\n * var baseFoo = Object.create({a: 1}, {b: {value: 2}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3},\n * d: {value: 4, enumerable: true}\n * });\n *\n * Object.keys(foo) // => [\"d\"]\n * _.enumerables(foo) // => [\"d\", \"a\"]\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @returns {String[]}\n */\n function enumerables (obj) {\n var keys = [];\n\n for (var key in obj) {\n keys.push(key);\n }\n\n return keys;\n }\n\n /**\n * Builds an object from a list of key / value pairs like the one\n * returned by [pairs]{@link module:lamb.pairs} or {@link module:lamb.ownPairs|ownPairs}.
\n * In case of duplicate keys the last key / value pair is used.\n * @example\n * _.fromPairs([[\"a\", 1], [\"b\", 2], [\"c\", 3]]) // => {\"a\": 1, \"b\": 2, \"c\": 3}\n * _.fromPairs([[\"a\", 1], [\"b\", 2], [\"a\", 3]]) // => {\"a\": 3, \"b\": 2}\n * _.fromPairs([[1], [void 0, 2], [null, 3]]) // => {\"1\": undefined, \"undefined\": 2, \"null\": 3}\n *\n * @memberof module:lamb\n * @category Object\n * @param {Array>} pairsList\n * @returns {Object}\n */\n function fromPairs (pairsList) {\n var result = {};\n\n pairsList.forEach(function (pair) {\n result[pair[0]] = pair[1];\n });\n\n return result;\n }\n\n /**\n * Returns the value of the object property with the given key.\n * @example\n * var user {name: \"John\"};\n *\n * _.get(user, \"name\") // => \"John\";\n * _.get(user, \"surname\") // => undefined\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @param {String} key\n * @returns {*}\n */\n function get (obj, key) {\n return obj[key];\n }\n\n /**\n * A curried version of {@link module:lamb.get|get}.
\n * Receives a property name and builds a function expecting the object from which we want to retrieve the property.\n * @example\n * var user1 = {name: \"john\"};\n * var user2 = {name: \"jane\"};\n * var getName = _.getKey(\"name\");\n *\n * getName(user1) // => \"john\"\n * getName(user2) // => \"jane\"\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {String} key\n * @returns {Function}\n */\n var getKey = _curry(get, 2, true);\n\n /**\n * Gets a nested property value from an object using the given path.
\n * The path is a string with property names separated by dots by default, but\n * it can be customised with the optional third parameter.\n * @example\n * var user = {\n * name: \"John\",\n * surname: \"Doe\",\n * login: {\n * \"user.name\": \"jdoe\",\n * password: \"abc123\"\n * }\n * };\n *\n * // same as _.get if no path is involved\n * _.getWithPath(user, \"name\") // => \"John\"\n *\n * _.getWithPath(user, \"login.password\") // => \"abc123\";\n * _.getWithPath(user, \"login/user.name\", \"/\") // => \"jdoe\"\n * _.getWithPath(user, \"name.foo\") // => undefined\n * _.getWithPath(user, \"name.foo.bar\") // => throws a TypeError\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object|ArrayLike} obj\n * @param {String} path\n * @param {String} [separator=\".\"]\n * @returns {*}\n */\n function getWithPath (obj, path, separator) {\n return path.split(separator || \".\").reduce(get, obj);\n }\n\n /**\n * Verifies the existence of a property in an object.\n * @example\n * var user1 = {name: \"john\"};\n *\n * _.has(user1, \"name\") // => true\n * _.has(user1, \"surname\") // => false\n * _.has(user1, \"toString\") // => true\n *\n * var user2 = Object.create(null);\n *\n * // not inherited through the prototype chain\n * _.has(user2, \"toString\") // => false\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @param {String} key\n * @returns {Boolean}\n */\n function has (obj, key) {\n return key in obj;\n }\n\n /**\n * Curried version of {@link module:lamb.has|has}.
\n * Returns a function expecting the object to check against the given key.\n * @example\n * var user1 = {name: \"john\"};\n * var user2 = {};\n * var hasName = _.hasKey(\"name\");\n *\n * hasName(user1) // => true\n * hasName(user2) // => false\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {String} key\n * @returns {Function}\n */\n var hasKey = _curry(has, 2, true);\n\n /**\n * Builds a function expecting an object to check against the given key / value pair.\n * @example\n * var hasTheCorrectAnswer = _.hasKeyValue(\"answer\", 42);\n *\n * hasTheCorrectAnswer({answer: 2}) // false\n * hasTheCorrectAnswer({answer: 42}) // true\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {String} key\n * @param {*} value\n * @returns {Function}\n */\n var hasKeyValue = function (key, value) {\n return compose(partial(is, value), getKey(key));\n };\n\n /**\n * Verifies if an object has the specified property and that the property isn't inherited through\n * the prototype chain.
\n * @example Comparison with has.\n * var user = {name: \"john\"};\n *\n * _.has(user, \"name\") // => true\n * _.has(user, \"surname\") // => false\n * _.has(user, \"toString\") // => true\n *\n * _.hasOwn(user, \"name\") // => true\n * _.hasOwn(user, \"surname\") // => false\n * _.hasOwn(user, \"toString\") // => false\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @param {String} key\n * @returns {Boolean}\n */\n var hasOwn = generic(_objectProto.hasOwnProperty);\n\n /**\n * Curried version of {@link module:lamb.hasOwn|hasOwn}.
\n * Returns a function expecting the object to check against the given key.\n * @example\n * var user = {name: \"john\"};\n * var hasOwnName = _.hasOwnKey(\"name\");\n * var hasOwnToString = _.hasOwnToString(\"toString\");\n *\n * hasOwnName(user) // => true\n * hasOwnToString(user) // => false\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {String} key\n * @returns {Function}\n */\n var hasOwnKey = _curry(hasOwn, 2, true);\n\n /**\n * Makes an object immutable by recursively calling [Object.freeze]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/freeze}\n * on its members.
\n * Any attempt to extend or modify the object can throw a TypeError or fail silently,\n * depending on the environment and the [strict mode]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Strict_mode} directive.\n * @example\n * var user = _.immutable({\n * name: \"John\",\n * surname: \"Doe\",\n * login: {\n * username: \"jdoe\",\n * password: \"abc123\"\n * },\n * luckyNumbers: [13, 17]\n * });\n *\n * // All of these statements will fail and possibly\n * // throw a TypeError (see the function description)\n * user.name = \"Joe\";\n * delete user.name;\n * user.newProperty = [];\n * user.login.password = \"foo\";\n * user.luckyNumbers.push(-13);\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @returns {Object}\n */\n function immutable (obj) {\n return _immutable(obj, []);\n }\n\n /**\n * Builds an object from the two given lists, using the first one as keys and the last one as values.
\n * If the list of keys is longer than the values one, the keys will be created with undefined values.
\n * If more values than keys are supplied, the extra values will be ignored.
\n * See also {@link module:lamb.tear|tear} and {@link module:lamb.tearOwn|tearOwn} for the reverse operation.\n * @example\n * _.make([\"a\", \"b\", \"c\"], [1, 2, 3]) // => {a: 1, b: 2, c: 3}\n * _.make([\"a\", \"b\", \"c\"], [1, 2]) // => {a: 1, b: 2, c: undefined}\n * _.make([\"a\", \"b\"], [1, 2, 3]) // => {a: 1, b: 2}\n * _.make([null, void 0, 2], [1, 2, 3]) // => {\"null\": 1, \"undefined\": 2, \"2\": 3}\n *\n * @memberof module:lamb\n * @category Object\n * @param {String[]} keys\n * @param {Array} values\n * @returns {Object}\n */\n function make (keys, values) {\n var result = {};\n var valuesLen = values.length;\n\n for (var i = 0, len = keys.length; i < len; i++) {\n result[keys[i]] = i < valuesLen ? values[i] : void 0;\n }\n\n return result;\n }\n\n /**\n * Merges the enumerable properties of the provided sources into a new object.
\n * In case of key homonymy each source has precedence over the previous one.
\n * See also {@link module:lamb.mergeOwn|mergeOwn} for merging only own properties of\n * the given sources.\n * @example\n * _.merge({a: 1}, {b: 3, c: 4}, {b: 5}) // => {a: 1, b: 5, c: 4}\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {...Object} source\n * @returns {Object}\n */\n var merge = partial(_merge, enumerables);\n\n /**\n * Same as {@link module:lamb.merge|merge}, but only the own properties of the sources are taken into account.\n * @example showing the difference with merge\n * var baseFoo = Object.create({a: 1}, {b: {value: 2, enumerable: true}, z: {value: 5}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3, enumerable: true}\n * });\n *\n * var bar = {d: 4};\n *\n * _.merge(foo, bar) // => {a: 1, b: 2, c: 3, d: 4}\n * _.mergeOwn(foo, bar) // => {c: 3, d: 4}\n *\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {...Object} source\n * @returns {Object}\n */\n var mergeOwn = partial(_merge, Object.keys);\n\n /**\n * Same as {@link module:lamb.pairs|pairs}, but only the own enumerable properties of the object are\n * taken into account.
\n * See also {@link module:lamb.fromPairs|fromPairs} for the reverse operation.\n * @example showing the difference with pairs\n * var baseFoo = Object.create({a: 1}, {b: {value: 2, enumerable: true}, z: {value: 5}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3, enumerable: true}\n * });\n *\n * _.pairs(foo) // => [[\"c\", 3], [\"b\", 2], [\"a\", 1]]\n * _.ownPairs(foo) // => [[\"c\", 3]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array>}\n */\n var ownPairs = _pairsFrom(Object.keys);\n\n /**\n * Same as {@link module:lamb.values|values}, but only the own enumerable properties of the object are\n * taken into account.
\n * @example showing the difference with values\n * var baseFoo = Object.create({a: 1}, {b: {value: 2, enumerable: true}, z: {value: 5}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3, enumerable: true}\n * });\n *\n * _.values(foo) // => [3, 2, 1]\n * _.ownValues(foo) // => [3]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array}\n */\n var ownValues = _valuesFrom(Object.keys);\n\n /**\n * Converts an object into an array of key / value pairs of its enumerable properties.
\n * See also {@link module:lamb.ownPairs|ownPairs} for picking only the own enumerable\n * properties and {@link module:lamb.fromPairs|fromPairs} for the reverse operation.\n * @example\n * _.pairs({a: 1, b: 2, c: 3}) // => [[\"a\", 1], [\"b\", 2], [\"c\", 3]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array>}\n */\n var pairs = _pairsFrom(enumerables);\n\n /**\n * Returns an object containing only the specified properties of the given object.
\n * Non existent properties will be ignored.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n *\n * _.pick(user, [\"name\", \"age\"]) // => {\"name\": \"john\", \"age\": 30};\n * _.pick(user, [\"name\", \"email\"]) // => {\"name\": \"john\"}\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} source\n * @param {String[]} whitelist\n * @returns {Object}\n */\n function pick (source, whitelist) {\n var result = {};\n\n whitelist.forEach(function (key) {\n if (key in source) {\n result[key] = source[key];\n }\n });\n\n return result;\n }\n\n /**\n * Builds a function expecting an object whose properties will be checked against the given predicate.
\n * The properties satisfying the predicate will be included in the resulting object.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n * var pickIfIsString = _.pickIf(_.isType(\"String\"));\n *\n * pickIfIsString(user) // => {name: \"john\", surname: \"doe\"}\n *\n * @memberof module:lamb\n * @category Object\n * @param {ObjectIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function pickIf (predicate, predicateContext) {\n return function (source) {\n var result = {};\n\n for (var key in source) {\n if (predicate.call(predicateContext, source[key], key, source)) {\n result[key] = source[key];\n }\n }\n\n return result;\n };\n }\n\n /**\n * Returns a copy of the source object without the specified properties.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n *\n * _.skip(user, [\"name\", \"age\"]) // => {surname: \"doe\"};\n * _.skip(user, [\"name\", \"email\"]) // => {surname: \"doe\", age: 30};\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} source\n * @param {String[]} blacklist\n * @returns {Object}\n */\n function skip (source, blacklist) {\n var result = {};\n\n for (var key in source) {\n if (blacklist.indexOf(key) === -1) {\n result[key] = source[key];\n }\n }\n\n return result;\n }\n\n /**\n * Builds a function expecting an object whose properties will be checked against the given predicate.
\n * The properties satisfying the predicate will be omitted in the resulting object.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n * var skipIfIstring = _.skipIf(_.isType(\"String\"));\n *\n * skipIfIstring(user) // => {age: 30}\n *\n * @memberof module:lamb\n * @category Object\n * @param {ObjectIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function skipIf (predicate, predicateContext) {\n return pickIf(not(predicate), predicateContext);\n }\n\n /**\n * Tears an object apart by transforming it in an array of two lists: one containing its enumerable keys,\n * the other containing the corresponding values.
\n * Although this \"tearing apart\" may sound as a rather violent process, the source object will be unharmed.
\n * See also {@link module:lamb.tearOwn|tearOwn} for picking only the own enumerable properties and\n * {@link module:lamb.make|make} for the reverse operation.\n * @example\n * _.tear({a: 1, b: 2, c: 3}) // => [[\"a\", \"b\", \"c\"], [1, 2, 3]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array, Array<*>>}\n */\n var tear = _tearFrom(enumerables);\n\n /**\n * Same as {@link module:lamb.tear|tear}, but only the own properties of the object are taken into account.
\n * See also {@link module:lamb.make|make} for the reverse operation.\n * @example showing the difference with tear\n * var baseFoo = Object.create({a: 1}, {b: {value: 2, enumerable: true}, z: {value: 5}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3, enumerable: true}\n * });\n *\n * _.tear(foo) // => [[\"c\", \"b\", \"a\"], [3, 2, 1]]\n * _.tearOwn(foo) // => [[\"c\"], [3]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array, Array<*>>}\n */\n var tearOwn = _tearFrom(Object.keys);\n\n /**\n * Validates an object with the given list of {@link module:lamb.checker|checker} functions.\n * @example\n * var hasContent = function (s) { return s.trim().length > 0; };\n * var isAdult = function (age) { return age >= 18; };\n * var userCheckers = [\n * _.checker(hasContent, \"Name is required\", [\"name\"]),\n * _.checker(hasContent, \"Surname is required\", [\"surname\"]),\n * _.checker(isAdult, \"Must be at least 18 years old\", [\"age\"])\n * ];\n *\n * var user1 = {name: \"john\", surname: \"doe\", age: 30};\n * var user2 = {name: \"jane\", surname: \"\", age: 15};\n *\n * _.validate(user1, userCheckers) // => []\n * _.validate(user2, userCheckers) // => [[\"Surname is required\", [\"surname\"]], [\"Must be at least 18 years old\", [\"age\"]]]\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @param {Function[]} checkers\n * @returns {Array>} An array of errors in the form returned by {@link module:lamb.checker|checker}, or an empty array.\n */\n function validate (obj, checkers) {\n return checkers.reduce(function (errors, checker) {\n var result = checker(obj);\n result.length && errors.push(result);\n return errors;\n }, []);\n }\n\n /**\n * A curried version of {@link module:lamb.validate|validate} accepting a list of {@link module:lamb.checker|checkers} and\n * returning a function expecting the object to validate.\n * @example\n * var hasContent = function (s) { return s.trim().length > 0; };\n * var isAdult = function (age) { return age >= 18; };\n * var userCheckers = [\n * _.checker(hasContent, \"Name is required\", [\"name\"]),\n * _.checker(hasContent, \"Surname is required\", [\"surname\"]),\n * _.checker(isAdult, \"Must be at least 18 years old\", [\"age\"])\n * ];\n * var validateUser = _.validateWith(userCheckers);\n *\n * var user1 = {name: \"john\", surname: \"doe\", age: 30};\n * var user2 = {name: \"jane\", surname: \"\", age: 15};\n *\n * validateUser(user1) // => []\n * validateUser(user2) // => [[\"Surname is required\", [\"surname\"]], [\"Must be at least 18 years old\", [\"age\"]]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Function[]} checkers\n * @returns {Function}\n */\n var validateWith = _curry(validate, 2, true);\n\n /**\n * Generates an array with the values of the enumerable properties of the given object.
\n * See also {@link module:lamb.ownValues|ownValues} for picking only the own properties of the object.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n *\n * _.values(user) // => [\"john\", \"doe\", 30]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array}\n */\n var values = _valuesFrom(enumerables);\n\n lamb.checker = checker;\n lamb.enumerables = enumerables;\n lamb.fromPairs = fromPairs;\n lamb.get = get;\n lamb.getKey = getKey;\n lamb.getWithPath = getWithPath;\n lamb.has = has;\n lamb.hasKey = hasKey;\n lamb.hasKeyValue = hasKeyValue;\n lamb.hasOwn = hasOwn;\n lamb.hasOwnKey = hasOwnKey;\n lamb.immutable = immutable;\n lamb.make = make;\n lamb.merge = merge;\n lamb.mergeOwn = mergeOwn;\n lamb.ownPairs = ownPairs;\n lamb.ownValues = ownValues;\n lamb.pairs = pairs;\n lamb.pick = pick;\n lamb.pickIf = pickIf;\n lamb.skip = skip;\n lamb.skipIf = skipIf;\n lamb.tear = tear;\n lamb.tearOwn = tearOwn;\n lamb.validate = validate;\n lamb.validateWith = validateWith;\n lamb.values = values;\n\n\n function _getPadding (source, char, len) {\n return repeat(char[0] || \" \", Math.ceil(len - source.length));\n }\n\n /**\n * Pads a string to the desired length with the given char starting from the beginning of the string.\n * @example\n * _.padLeft(\"foo\", \"-\", 0) // => \"foo\"\n * _.padLeft(\"foo\", \"-\", -1) // => \"foo\"\n * _.padLeft(\"foo\", \"-\", 5) // => \"--foo\"\n * _.padLeft(\"foo\", \"-\", 3) // => \"foo\"\n * _.padLeft(\"foo\", \"ab\", 7) // => \"aaaafoo\"\n * _.padLeft(\"foo\", \"\", 5) // => \" foo\"\n * _.padLeft(\"\", \"-\", 5) // => \"-----\"\n *\n * @memberof module:lamb\n * @category String\n * @param {String} source\n * @param {String} [char=\" \"] - The padding char. If a string is passed only the first char is used.\n * @param {Number} len\n * @returns {String}\n */\n function padLeft (source, char, len) {\n return _getPadding(source, char, len) + source;\n }\n\n /**\n * Pads a string to the desired length with the given char starting from the end of the string.\n * @example\n * _.padRight(\"foo\", \"-\", 0) // => \"foo\"\n * _.padRight(\"foo\", \"-\", -1) // => \"foo\"\n * _.padRight(\"foo\", \"-\", 5) // => \"foo--\"\n * _.padRight(\"foo\", \"-\", 3) // => \"foo\"\n * _.padRight(\"foo\", \"ab\", 7) // => \"fooaaaa\"\n * _.padRight(\"foo\", \"\", 5) // => \"foo \"\n * _.padRight(\"\", \"-\", 5) // => \"-----\"\n *\n * @memberof module:lamb\n * @category String\n * @param {String} source\n * @param {String} [char=\" \"] - The padding char. If a string is passed only the first char is used.\n * @param {Number} len\n * @returns {String}\n */\n function padRight (source, char, len) {\n return source + _getPadding(source, char, len);\n }\n\n /**\n * Builds a new string by repeating the source string the desired amount of times.
\n * Note that unlike the current ES6 proposal for [String.prototype.repeat]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/repeat},\n * this function doesn't throw a RangeError if count is negative, but returns an empty string instead.\n * @example\n * _.repeat(\"Hello\", -1) // => \"\"\n * _.repeat(\"Hello\", 1) // => \"Hello\"\n * _.repeat(\"Hello\", 3) // => \"HelloHelloHello\"\n *\n * @memberof module:lamb\n * @category String\n * @param {String} source\n * @param {Number} count\n * @returns {String}\n */\n function repeat (source, count) {\n var result = \"\";\n\n for (var i = 0; i < count; i++) {\n result += source;\n }\n\n return result;\n }\n\n /**\n * Builds a predicate expecting a string to test against the given regular expression pattern.\n * @example\n * var hasNumbersOnly = _.testWith(/^\\d+$/);\n *\n * hasNumbersOnly(\"123\") // => true\n * hasNumbersOnly(\"123 Kg\") // => false\n *\n * @memberof module:lamb\n * @category String\n * @param {RegExp} pattern\n * @returns {Function}\n */\n function testWith (pattern) {\n return _reProto.test.bind(pattern);\n }\n\n lamb.padLeft = padLeft;\n lamb.padRight = padRight;\n lamb.repeat = repeat;\n lamb.testWith = testWith;\n\n\n /**\n * Verifies if a value is null or undefined.\n * @example\n * _.isNil(NaN) // => false\n * _.isNil({}) // => false\n * _.isNil(null) // => true\n * _.isNil(void 0) // => true\n * _.isNil() // => true\n *\n * @memberof module:lamb\n * @category Type\n * @function\n * @param {*} value\n * @returns {Boolean}\n */\n var isNil = anyOf(isNull, isUndefined);\n\n /**\n * Verifies if a value is null.\n * @example\n * _.isNull(null) // => true\n * _.isNull(void 0) // => false\n * _.isNull(false) // => false\n *\n * @memberof module:lamb\n * @category Type\n * @param {*} value\n * @returns {Boolean}\n */\n function isNull (value) {\n return value === null;\n }\n\n /**\n * Builds a predicate that expects a value to check against the specified type.\n * @example\n * var isString = _.isType(\"String\");\n *\n * isString(\"Hello\") // => true\n * isString(new String(\"Hi\")) // => true\n *\n * @memberof module:lamb\n * @category Type\n * @param {String} typeTag\n * @returns {Function}\n */\n function isType (typeName) {\n return function (value) {\n return type(value) === typeName;\n };\n }\n\n /**\n * Verifies if a value is undefined.\n * @example\n * _.isUndefined(null) // => false\n * _.isUndefined(void 0) // => true\n * _.isUndefined(false) // => false\n *\n * @memberof module:lamb\n * @category Type\n * @param {*} value\n * @returns {Boolean}\n */\n function isUndefined (value) {\n // using void because undefined could be theoretically shadowed\n return value === void 0;\n }\n\n /**\n * Retrieves the \"type tag\" from the given value.\n * @example\n * var x = 5;\n * var y = new Number(5);\n *\n * typeof x // => \"number\"\n * typeof y // => \"object\"\n * _.type(x) // => \"Number\"\n * _.type(y) // => \"Number\"\n *\n * _.type(Object.prototype.toString) // => \"Function\"\n * _.type(/a/) // => \"RegExp\"\n *\n * @memberof module:lamb\n * @category Type\n * @param {*} value\n * @returns {String}\n */\n function type (value) {\n return _objectProto.toString.call(value).replace(/^\\[\\w+\\s+|\\]$/g, \"\");\n }\n\n lamb.isNil = isNil;\n lamb.isNull = isNull;\n lamb.isType = isType;\n lamb.isUndefined = isUndefined;\n lamb.type = type;\n\n /* istanbul ignore next */\n if (typeof exports === \"object\") {\n module.exports = lamb;\n } else if (typeof define === \"function\" && define.amd) {\n define(function() { return lamb; });\n } else {\n host.lamb = lamb;\n }\n}(this);\n\n/**\n * @callback AccumulatorCallback\n * @global\n * @param {*} previousValue The value returned it the last execution of the accumulator or, in the first iteration, the {@link module:lamb.reduce|initialValue} if supplied.\n * @param {*} currentValue The value being processed in the current iteration.\n * @param {Number} idx - The index of the element being processed.\n * @param {ArrayLike} arrayLike - The list being traversed.\n */\n\n/**\n * The built-in arguments object.\n * @typedef {arguments} arguments\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/arguments|arguments} in Mozilla documentation.\n */\n\n/**\n * The built-in Array object.\n * @typedef {Array} Array\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array|Array} in Mozilla documentation.\n */\n\n/**\n * Any array-like object.\n * @typedef {Array|String|arguments|?} ArrayLike\n * @global\n */\n\n/**\n * The built-in Boolean object.\n * @typedef {Boolean} Boolean\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Boolean|Boolean} in Mozilla documentation.\n */\n\n/**\n * The built-in Date object.\n * @typedef {Date} Date\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date|Date} in Mozilla documentation.\n */\n\n/**\n * The built-in Function object.\n * @typedef {Function} function\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function|Function} and\n * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions|Functions} in Mozilla documentation.\n */\n\n/**\n * @callback ListIteratorCallback\n * @global\n * @param {*} element - The element being evaluated.\n * @param {Number} idx - The index of the element within the list.\n * @param {ArrayLike} arrayLike - The list being traversed.\n */\n\n/**\n * The built-in Number object.\n * @typedef {Number} Number\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number|Number} in Mozilla documentation.\n */\n\n/**\n * The built-in Object object.\n * @typedef {Object} Object\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object|Object} in Mozilla documentation.\n */\n\n/**\n * @callback ObjectIteratorCallback\n * @global\n * @param {*} value - The value of the current property.\n * @param {String} key - The property name.\n * @param {Object} source - The object being traversed.\n */\n\n/**\n * The built-in RegExp object.\n * @typedef {RegExp} RegExp\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp|RegExp} in Mozilla documentation.\n */\n\n/**\n * Represent a sorting criteria used by {@link module:lamb.insert|insert}, {@link module:lamb.sort|sort} and {@link module:lamb.sortWith|sortWith},\n * and it's usually built using {@link module:lamb.sorter|sorter} and {@link module:lamb.sorterDesc|sorterDesc}.\n * @typedef {Sorter} Sorter\n * @global\n * @property {Boolean} isDescending\n * @property {Function} compare\n */\n\n/**\n * The built-in String object.\n * @typedef {String} String\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String|String} in Mozilla documentation.\n */\n"],"sourceRoot":"/source/"}
\ No newline at end of file
+{"version":3,"sources":["lamb.js"],"names":["host","always","value","compose","functions","arguments","args","len","length","apply","this","identity","partial","fn","slice","boundArg","lastArgumentIdx","newArgs","argsLen","i","_","push","_findSliceEndIndex","arrayLike","predicate","predicateContext","idx","call","_flatten","array","output","forEach","Array","isArray","contains","fromIndex","isIn","difference","rest","shallowFlatten","isInRest","filter","not","dropWhile","filterWith","find","result","element","findIndex","flatMapWith","iteratee","iterateeContext","flatMap","flatten","getAt","index","Math","floor","group","key","groupBy","intersection","uniques","item","every","isSVZ","list","mapWith","map","partition","el","partitionWith","pluck","getKey","pluckKey","setAt","clamp","_arrayProto","concat","takeWhile","transpose","j","minLen","min","seen","_comparer","a","b","String","_compareWith","criteria","isDescSort","criterion","compare","isDescending","_getInsertionIndex","comparer","start","end","pivot","_makeCriteria","sorters","_makeCriterion","_sorter","Object","reader","insert","splice","sort","data","sortWith","_currier","arity","isRightCurry","slicer","argsHolder","reverse","_curry","isAutoCurry","aritize","binary","curry","curryRight","curryable","curryableRight","debounce","timespan","timeoutID","context","debounced","clearTimeout","setTimeout","flip","getArgAt","invokerOn","target","methodName","method","type","invoker","boundArgs","mapArgs","mapper","tapArgs","readers","throttle","lastCall","now","Date","unary","adapter","isUndefined","allOf","predicates","anyOf","some","condition","trueFn","falseFn","applyArgsTo","applyArgs","is","isGT","isGTE","isLT","isLTE","add","n","max","divide","modulo","multiply","randomInt","random","range","limit","step","ceil","sequence","remainder","subtract","_immutable","obj","indexOf","freeze","getOwnPropertyNames","isNull","_keyToPair","_merge","getKeys","reduce","source","checker","message","keyPaths","pathSeparator","getValues","getWithPath","enumerables","keys","fromPairs","pairsList","pair","get","path","separator","split","has","immutable","make","values","valuesLen","pick","whitelist","pickIf","skip","blacklist","skipIf","validate","checkers","errors","_getPadding","char","repeat","padLeft","padRight","count","testWith","pattern","_reProto","test","bind","isType","typeName","_objectProto","toString","replace","lamb","create","_version","prototype","RegExp","generic","Function","reduceRight","drop","dropN","head","init","last","tail","take","takeN","union","zip","zipWithIndex","sorter","sorterDesc","pipe","wrap","isNot","_pairsFrom","_tearFrom","_valuesFrom","hasKey","hasKeyValue","hasOwn","hasOwnProperty","hasOwnKey","merge","mergeOwn","ownPairs","ownValues","pairs","tear","tearOwn","validateWith","isNil","exports","module","define","amd"],"mappings":";;;;;;;;CAQC,SAAUA,GACP,YA4CA,SAASC,GAAQC,GACb,MAAO,YACH,MAAOA,IA4Bf,QAASC,KACL,GAAIC,GAAYC,SAEhB,OAAO,YAIH,IAHA,GAAIC,GAAOD,UACPE,EAAMH,EAAUI,OAEbD,KACHD,GAAQF,EAAUG,GAAKE,MAAMC,KAAMJ,GAGvC,OAAOA,GAAK,IAsCpB,QAASK,GAAUT,GACf,MAAOA,GAkBX,QAASU,GAASC,GACd,GAAIP,GAAOQ,GAAMT,UAAW,EAE5B,OAAO,YAKH,IAAK,GAAWU,GAJZC,EAAkB,EAClBC,KACAC,EAAUZ,EAAKE,OAEVW,EAAI,EAAiBD,EAAJC,EAAaA,IACnCJ,EAAWT,EAAKa,GAChBF,EAAQE,GAAKJ,IAAaK,GAAIf,UAAUW,KAAqBD,CAGjE,KAAK,GAAIR,GAAMF,UAAUG,OAA0BD,EAAlBS,EAAuBA,IACpDC,EAAQI,KAAKhB,UAAUW,GAG3B,OAAOH,GAAGJ,MAAMC,KAAMO,IAgI9B,QAASK,GAAoBC,EAAWC,EAAWC,GAI/C,IAHA,GAAIC,GAAM,GACNnB,EAAMgB,EAAUf,SAEXkB,EAAMnB,GAAOiB,EAAUG,KAAKF,EAAkBF,EAAUG,GAAMA,EAAKH,KAE5E,MAAOG,GAGX,QAASE,GAAUC,EAAOC,GAStB,MARAD,GAAME,QAAQ,SAAU7B,GAChB8B,MAAMC,QAAQ/B,GACd0B,EAAS1B,EAAO4B,GAEhBA,EAAOT,KAAKnB,KAIb4B,EAmBX,QAASI,GAAUhC,EAAOiC,GACtB,MAAO,UAAUZ,GACb,MAAOa,GAAKb,EAAWrB,EAAOiC,IAqBtC,QAASE,GAAYR,GACjB,GAAIS,GAAOC,EAAezB,GAAMT,UAAW,IACvCmC,EAAW5B,EAAQwB,EAAME,EAAMlB,GAAG,EACtC,OAAOS,GAAMY,OAAOC,GAAIF,IAgE5B,QAASG,GAAWnB,EAAWC,GAC3B,MAAO,UAAUF,GACb,MAAOT,IAAMS,EAAWD,EAAmBC,EAAWC,EAAWC,KAsBzE,QAASmB,GAAYpB,EAAWC,GAC5B,MAAOb,GAAQ6B,GAAQrB,GAAGI,EAAWC,GAwBzC,QAASoB,GAAMtB,EAAWC,EAAWC,GAGjC,IAAK,GAFDqB,GAEoCC,EAA/B5B,EAAI,EAAGZ,EAAMgB,EAAUf,OAAqBD,EAAJY,EAASA,IAGtD,GAFA4B,EAAUxB,EAAUJ,GAEhBK,EAAUG,KAAKF,EAAkBsB,EAAS5B,EAAGI,GAAY,CACzDuB,EAASC,CACT,OAIR,MAAOD,GAwBX,QAASE,GAAWzB,EAAWC,EAAWC,GAGtC,IAAK,GAFDqB,GAAS,GAEJ3B,EAAI,EAAGZ,EAAMgB,EAAUf,OAAYD,EAAJY,EAASA,IAC7C,GAAIK,EAAUG,KAAKF,EAAkBF,EAAUJ,GAAIA,EAAGI,GAAY,CAC9DuB,EAAS3B,CACT,OAIR,MAAO2B,GAsCX,QAASG,GAAaC,EAAUC,GAC5B,MAAOvC,GAAQwC,GAAShC,GAAG8B,EAAUC,GAgBzC,QAASE,GAASxB,GACd,MAAOD,GAASC,MA0BpB,QAASyB,GAAOC,GACZ,MAAO,UAAUhC,GACb,MAAOiC,MAAKC,MAAMF,KAAWA,EAAQhC,EAAkB,EAARgC,EAAYA,EAAQhC,EAAUf,OAAS+C,GAAS,QA8DvG,QAASG,GAAOnC,EAAW2B,EAAUC,GAIjC,IAAK,GAAWJ,GAHZD,KACAvC,EAAMgB,EAAUf,OAEXW,EAAI,EAAgBZ,EAAJY,EAASA,IAAK,CACnC4B,EAAUxB,EAAUJ,EACpB,IAAIwC,GAAMT,EAASvB,KAAKwB,EAAiBJ,EAAS5B,EAAGI,EAEjDoC,KAAOb,GACPA,EAAOa,GAAKtC,KAAK0B,GAEjBD,EAAOa,IAAQZ,GAIvB,MAAOD,GAqCX,QAASc,GAASV,EAAUC,GACxB,MAAOvC,GAAQ8C,EAAOtC,GAAG8B,EAAUC,GAqDvC,QAASU,KACL,GAAIvB,GAAOxB,GAAMT,UAAW,EAC5B,OAAOyD,GAAQzD,UAAU,IAAIoC,OAAO,SAAUsB,GAC1C,MAAOzB,GAAK0B,MAAM9B,EAAS6B,MAyBnC,QAAS3B,GAAMb,EAAWrB,EAAOiC,GAG7B,IAAK,GAFDW,IAAS,EAEJ3B,EAAIgB,IAAc,EAAG5B,EAAMgB,EAAUf,OAAYD,EAAJY,EAASA,IAC3D,GAAI8C,GAAM/D,EAAOqB,EAAUJ,IAAK,CAC5B2B,GAAS,CACT,OAIR,MAAOA,GA8BX,QAASoB,KACL,MAA4B,KAArB7D,UAAUG,QAAgBH,UAAU,IAAM2B,MAAMvB,MAAM,KAAMJ,WAkBvE,QAAS8D,GAASjB,EAAUC,GACxB,MAAOvC,GAAQwD,GAAKhD,GAAG8B,EAAUC,GAoBrC,QAASkB,GAAW9C,EAAWC,EAAWC,GAItC,IAAK,GAAW6C,GAHZxB,UACAvC,EAAMgB,EAAUf,OAEXW,EAAI,EAAWZ,EAAJY,EAASA,IACzBmD,EAAK/C,EAAUJ,GACf2B,EAAOtB,EAAUG,KAAKF,EAAkB6C,EAAInD,EAAGI,GAAa,EAAI,GAAGF,KAAKiD,EAG5E,OAAOxB,GAgCX,QAASyB,GAAe/C,EAAWC,GAC/B,MAAOb,GAAQyD,EAAWjD,GAAGI,EAAWC,GA8B5C,QAAS+C,GAAOjD,EAAWoC,GACvB,MAAOS,IAAI7C,EAAWkD,GAAOd,IAwBjC,QAASe,GAAUf,GACf,MAAOQ,GAAQM,GAAOd,IA0B1B,QAASgB,GAAOpB,EAAOrD,GACnB,MAAO,UAAUqB,GACb,GAAIuB,GAAShC,GAAMS,GACfhB,EAAMgB,EAAUf,MAMpB,OAJIoE,IAAMrB,GAAQhD,EAAKA,EAAM,KAAOiD,KAAKC,MAAMF,KAC3CT,EAAOS,GAAiB,EAARA,EAAYhD,EAAM,IAAML,GAGrC4C,GAkBf,QAASP,GAAgBV,GACrB,MAAOgD,IAAYC,OAAOrE,SAAUoB,GAiFxC,QAASkD,GAAWvD,EAAWC,GAC3B,MAAO,UAAUF,GACb,MAAOT,IAAMS,EAAW,EAAGD,EAAmBC,EAAWC,EAAWC,KA8B5E,QAASuD,GAAWzD,GAKhB,IAAK,GAAW0D,GAJZnC,KACAoC,EAASzE,EAAM+C,KAAK2B,IAAKX,EAAMjD,EAAW,aAAe,EACzDhB,EAAMgB,EAAUf,OAEXW,EAAI,EAAU+D,EAAJ/D,EAAYA,IAG3B,IAFA2B,EAAOzB,SAEF4D,EAAI,EAAO1E,EAAJ0E,EAASA,IACjBnC,EAAO3B,GAAG8D,GAAK1D,EAAU0D,GAAG9D,EAIpC,OAAO2B,GA0CX,QAASgB,GAASvC,EAAW2B,EAAUC,GACX,kBAAbD,KACPA,EAAWvC,EAOf,KAAK,GAFDT,GAFA4C,KACAsC,KAGKjE,EAAI,EAAGA,EAAII,EAAUf,OAAQW,IAClCjB,EAAQgD,EAASvB,KAAKwB,EAAiB5B,EAAUJ,GAAIA,EAAII,GAEpDa,EAAKgD,EAAMlF,KACZkF,EAAK/D,KAAKnB,GACV4C,EAAOzB,KAAKE,EAAUJ,IAI9B,OAAO2B,GA2EX,QAASuC,GAAWC,EAAGC,GACnB,GAAIzC,GAAS,CAeb,cAbWwC,UAAaC,KACpBD,EAAIE,OAAOF,GACXC,EAAIC,OAAOD,IAGVtB,GAAMqB,EAAGC,KACND,EAAIC,GAAKD,IAAMA,EACfxC,EAAS,GACEyC,EAAJD,GAASC,IAAMA,KACtBzC,EAAS,KAIVA,EAGX,QAAS2C,GAAcC,GACnB,GAAInF,GAAMmF,EAASlF,MAEnB,OAAO,UAAU8E,EAAGC,GAKhB,IAAK,GAHDI,GACAC,EAFA9C,EAAS,EAIJ3B,EAAI,EAAOZ,EAAJY,EAASA,IAIrB,GAHAyE,EAAYF,EAASvE,GACrB2B,EAAS8C,EAAUC,QAAQP,EAAEpF,MAAOqF,EAAErF,OAEvB,IAAX4C,EAAc,CACd6C,EAAaD,EAASvE,GAAG2E,YACzB,OASR,MALe,KAAXhD,IACA6C,EAAaD,EAASnF,EAAM,GAAGuF,aAC/BhD,EAASwC,EAAE/B,MAAQgC,EAAEhC,OAGlBoC,GAAc7C,EAASA,GAItC,QAASiD,GAAoBlE,EAAOkB,EAASiD,EAAUC,EAAOC,GAC1D,GAAqB,IAAjBrE,EAAMrB,OACN,MAAO,EAGX,IAAI2F,GAASF,EAAQC,GAAQ,EACzBpD,EAASkD,GACT9F,MAAO6C,EACPQ,MAAO4C,IAEPjG,MAAO2B,EAAMsE,GACb5C,MAAO4C,GAGX,OAAmB,IAAfD,EAAMD,EACU,EAATnD,EAAaqD,EAAQA,EAAQ,EACpB,EAATrD,EACAiD,EAAmBlE,EAAOkB,EAASiD,EAAUC,EAAOE,GACzC,IAAXrD,EACAqD,EAAQ,EAERJ,EAAmBlE,EAAOkB,EAASiD,EAAUG,EAAOD,GAInE,QAASE,GAAeC,GACpB,MAAOA,GAAQ7F,OAAS6F,EAAQjC,IAAIkC,IAAmBC,KAG3D,QAASD,GAAgBV,GACrB,MAA4C,kBAA9BY,QAAOZ,GAAWC,QAAyBD,EAAYW,EAAQX,GAGjF,QAASW,GAASE,EAAQX,EAAcE,GACpC,OACIF,aAAcA,KAAiB,EAC/BD,QAAS,SAAUP,EAAGC,GAMlB,MALsB,kBAAXkB,IAAyBA,IAAW9F,IAC3C2E,EAAImB,EAAOnB,GACXC,EAAIkB,EAAOlB,KAGPS,GAAYX,GAAWC,EAAGC,KA+C9C,QAASmB,GAAQ7E,EAAOkB,GACpB,GAAI2C,GAAWU,EAActF,GAAMT,UAAW,IAC1CyC,EAASjB,EAAMiD,SACfpD,EAAMqE,EAAmBlE,EAAOkB,EAAS0C,EAAaC,GAAW,EAAG7D,EAAMrB,OAG9E,OADAsC,GAAO6D,OAAOjF,EAAK,EAAGqB,GACfD,EA8DX,QAAS8D,GAAMrF,GAMX,IAAK,GALDmE,GAAWU,EAActF,GAAMT,UAAW,IAC1CwG,KACA/D,KACAvC,EAAMgB,EAAUf,OAEXW,EAAI,EAAOZ,EAAJY,EAASA,IACrB0F,EAAKxF,MACDnB,MAAOqB,EAAUJ,GACjBoC,MAAOpC,GAMf,KAFA0F,EAAKD,KAAKnB,EAAaC,IAElBvE,EAAI,EAAOZ,EAAJY,EAASA,IACjB2B,EAAOzB,KAAKwF,EAAK1F,GAAGjB,MAGxB,OAAO4C,GAwDX,QAASgE,KACL,GAAIT,GAAUvF,GAAMT,UAEpB,OAAO,UAAUkB,GACb,MAAOqF,GAAKnG,MAAM,MAAOc,GAAWuD,OAAOuB,KAWnD,QAASU,GAAUlG,EAAImG,EAAOC,EAAcC,EAAQC,GAChD,MAAO,YACH,GAAI7G,GAAO6G,EAAWrC,OAAOoC,EAAO7G,WAEpC,OAAIC,GAAKE,QAAUwG,EACRnG,EAAGJ,MAAMC,KAAMuG,EAAe3G,EAAK8G,UAAY9G,GAE/CyG,EAASlG,EAAImG,EAAOC,EAAcC,EAAQ5G,IAK7D,QAAS+G,GAAQxG,EAAImG,EAAOC,EAAcK,GACtC,GAAIJ,GAASI,EAAcxG,GAAQ,SAAUwE,GACzC,MAAOA,GAAE9E,QAAU8E,EAAE,OAOzB,OAJK0B,KAAU,IAAOA,IAClBA,EAAQnG,EAAGL,QAGRuG,EAASlG,EAAImG,EAAOC,EAAcC,MAc7C,QAASzG,GAAOI,EAAIP,GAChB,MAAOO,GAAGJ,MAAMI,EAAIC,GAAMR,IAsC9B,QAASiH,GAAS1G,EAAImG,GAClB,MAAO,YACH,MAAOvG,GAAMI,EAAIC,GAAMT,UAAW,EAAG2G,KAkB7C,QAASQ,GAAQ3G,GACb,MAAO,UAAUyE,EAAGC,GAChB,MAAO1E,GAAGyE,EAAGC,IA0BrB,QAASkC,GAAO5G,EAAImG,GAChB,MAAOK,GAAOxG,EAAImG,GAAO,GAiB7B,QAASU,GAAY7G,EAAImG,GACrB,MAAOK,GAAOxG,EAAImG,GAAO,GA2B7B,QAASW,GAAW9G,EAAImG,GACpB,MAAOK,GAAOxG,EAAImG,GAAO,GAAO,GAmBpC,QAASY,GAAgB/G,EAAImG,GACzB,MAAOK,GAAOxG,EAAImG,GAAO,GAAM,GAuBnC,QAASa,GAAUhH,EAAIiH,GACnB,GAAIC,EAEJ,OAAO,YACH,GAAIC,GAAUtH,KACVJ,EAAOD,UACP4H,EAAY,WACZF,EAAY,KACZlH,EAAGJ,MAAMuH,EAAS1H,GAGtB4H,cAAaH,GACbA,EAAYI,WAAWF,EAAWH,IAe1C,QAASM,GAAMvH,GACX,MAAO,YACH,GAAIP,GAAOQ,GAAMT,WAAW+G,SAC5B,OAAOvG,GAAGJ,MAAMC,KAAMJ,IAyB9B,QAAS+H,GAAU9E,GACf,MAAOpD,GAAQmD,EAAMC,GAAQW,GAoBjC,QAASoE,GAAWC,GAChB,MAAO,UAAUC,GACb,GAAIlI,GAAOQ,GAAMT,UAAW,GACxBoI,EAASF,EAAOC,EACpB,OAAwB,aAAjBE,GAAKD,GAAyBA,EAAOhI,MAAM8H,EAAQjI,GAAQ,QAmC1E,QAASqI,GAASH,GACd,GAAII,GAAY9H,GAAMT,UAAW,EAEjC,OAAO,UAAUkI,GACb,GAAIjI,GAAOQ,GAAMT,UAAW,GACxBoI,EAASF,EAAOC,EACpB,OAAwB,aAAjBE,GAAKD,GAAyBA,EAAOhI,MAAM8H,EAAQK,EAAU9D,OAAOxE,IAAS,QAuB5F,QAASuI,IAAShI,EAAIiI,GAClB,MAAO3I,GAAQS,EAAQH,EAAOI,GAAKsD,EAAQ2E,GAAS5E,GAqCxD,QAAS6E,IAASlI,GACd,GAAImI,GAAUlI,GAAMT,UAAW,EAE/B,OAAO,YAIH,IAAK,GAHDE,GAAMF,UAAUG,OAChBF,KAEKa,EAAI,EAAOZ,EAAJY,EAASA,IACrBb,EAAKe,KAAK2H,EAAQ7H,GAAK6H,EAAQ7H,GAAGd,UAAUc,IAAMd,UAAUc,GAGhE,OAAON,GAAGJ,MAAMC,KAAMJ,IAsB9B,QAAS2I,IAAUpI,EAAIiH,GACnB,GAAIhF,GACAoG,EAAW,CAEf,OAAO,YACH,GAAIC,GAAMC,KAAKD,KAOf,OALIA,GAAMD,GAAYpB,IAClBoB,EAAWC,EACXrG,EAASjC,EAAGJ,MAAMC,KAAML,YAGrByC,GAmBf,QAASuG,IAAOxI,GACZ,MAAO,UAAUyE,GACb,MAAOzE,GAAGyE,IA0ElB,QAASgE,MACL,GAAIlJ,GAAYU,GAAMT,UAEtB,OAAO,YAIH,IAAK,GAFDyC,GADAvC,EAAMH,EAAUI,OAGXW,EAAI,EAAOZ,EAAJY,IACZ2B,EAASrC,EAAML,EAAUe,GAAId,WAExBkJ,GAAYzG,IAHI3B,KAQzB,MAAO2B,IAsBf,QAAS0G,MACL,GAAIC,GAAa3I,GAAMT,UAEvB,OAAO,YACH,GAAIC,GAAOD,SAEX,OAAOoJ,GAAWzF,MAAM,SAAUxC,GAC9B,MAAOA,GAAUf,MAAM,KAAMH,MAwBzC,QAASoJ,MACL,GAAID,GAAa3I,GAAMT,UAEvB,OAAO,YACH,GAAIC,GAAOD,SAEX,OAAOoJ,GAAWE,KAAK,SAAUnI,GAC7B,MAAOA,GAAUf,MAAM,KAAMH,MA2BzC,QAASsJ,IAAWpI,EAAWqI,EAAQC,GACnC,MAAO,YACH,GAAIC,GAAcC,GAAU3J,UAC5B,OAAO0J,GAAYvI,GAAauI,EAAYF,GAAUC,EAAUC,EAAYD,GAAW,QA2B/F,QAASG,IAAI3E,EAAGC,GACZ,MAAa,KAAND,GAAiB,IAANC,EAAU,EAAID,IAAM,EAAIC,EAAItB,GAAMqB,EAAGC,GAyB3D,QAAS2E,IAAM5E,EAAGC,GACd,MAAOD,GAAIC,EAmBf,QAAS4E,IAAO7E,EAAGC,GACf,MAAOD,IAAKC,EAyBhB,QAAS6E,IAAM9E,EAAGC,GACd,MAAWA,GAAJD,EAmBX,QAAS+E,IAAO/E,EAAGC,GACf,MAAYA,IAALD,EAwCX,QAASrB,IAAOqB,EAAGC,GACf,MAAOD,KAAMA,EAAIC,IAAMA,EAAID,IAAMC,EAiBrC,QAAS7C,IAAKlB,GACV,MAAO,YACH,OAAQA,EAAUf,MAAM,KAAMJ,YA6BtC,QAASiK,IAAKhF,EAAGC,GACb,MAAOD,GAAIC,EAiBf,QAASX,IAAO2F,EAAGpF,EAAKqF,GACpB,MAAWrF,GAAJoF,EAAUpF,EAAMoF,EAAIC,EAAMA,EAAMD,EAc3C,QAASE,IAAQnF,EAAGC,GAChB,MAAOD,GAAIC,EAqBf,QAASmF,IAAQpF,EAAGC,GAChB,MAAOD,GAAKC,EAAI/B,KAAKC,MAAM6B,EAAIC,GAcnC,QAASoF,IAAUrF,EAAGC,GAClB,MAAOD,GAAIC,EAkBf,QAASqF,IAAWzF,EAAKqF,GACrB,MAAOhH,MAAKC,MAAMD,KAAKqH,UAAYL,EAAMrF,EAAM,GAAKA,GAmBxD,QAAS2F,IAAO7E,EAAO8E,EAAOC,GAC1B,GAAa,IAATA,GAAc3K,UAAUG,OAAS,EACjC,OAAQyF,EAGP+E,KACDA,EAAO,EAGX,IAAIzK,GAAMiD,KAAKgH,IAAIhH,KAAKyH,MAAMF,EAAQ9E,GAAS+E,GAAO,EACtD,OAAOE,IAASjF,EAAO1F,EAAKK,EAAQ0J,GAAKU,IAoB7C,QAASG,IAAW7F,EAAGC,GACnB,MAAOD,GAAIC,EAqBf,QAAS2F,IAAUjF,EAAO1F,EAAK2C,EAAUC,GAGrC,IAAK,GAFDL,IAAUmD,GAEL9E,EAAI,EAAG4J,EAAQxK,EAAM,EAAOwK,EAAJ5J,EAAWA,IACxC2B,EAAOzB,KAAK6B,EAASvB,KAAKwB,EAAiBL,EAAO3B,GAAIA,EAAG2B,GAG7D,OAAOA,GAcX,QAASsI,IAAU9F,EAAGC,GAClB,MAAOD,GAAIC,EAef,QAAS8F,IAAYC,EAAKlG,GAatB,MAZ0B,KAAtBA,EAAKmG,QAAQD,KACblG,EAAK/D,KAAKmF,OAAOgF,OAAOF,IAExB9E,OAAOiF,oBAAoBH,GAAKvJ,QAAQ,SAAU4B,GAC9C,GAAIzD,GAAQoL,EAAI3H,EAEK,iBAAVzD,IAAuBwL,GAAOxL,IACrCmL,GAAWnL,EAAOkF,MAKvBkG,EAGX,QAASK,IAAYhI,GACjB,OAAQA,EAAKjD,KAAKiD,IAGtB,QAASiI,IAAQC,GACb,MAAOC,IAAOhL,GAAMT,UAAW,GAAI,SAAUyC,EAAQiJ,GAKjD,MAJAhK,IAAQ8J,EAAQE,GAAS,SAAUpI,GAC/Bb,EAAOa,GAAOoI,EAAOpI,KAGlBb,OAyDf,QAASkJ,IAASxK,EAAWyK,EAASC,EAAUC,GAC5C,MAAO,UAAUb,GACb,GAAIc,GAAYxL,EAAQyL,GAAaf,EAAKlK,GAAG+K,EAC7C,OAAO3K,GAAUf,MAAM6K,EAAKY,EAAS9H,IAAIgI,QAAoBH,EAASC,IAqB9E,QAASI,IAAahB,GAClB,GAAIiB,KAEJ,KAAK,GAAI5I,KAAO2H,GACZiB,EAAKlL,KAAKsC,EAGd,OAAO4I,GAiBX,QAASC,IAAWC,GAChB,GAAI3J,KAMJ,OAJA2J,GAAU1K,QAAQ,SAAU2K,GACxB5J,EAAO4J,EAAK,IAAMA,EAAK,KAGpB5J,EAiBX,QAAS6J,IAAKrB,EAAK3H,GACf,MAAO2H,GAAI3H,GAmDf,QAAS0I,IAAaf,EAAKsB,EAAMC,GAC7B,MAAOD,GAAKE,MAAMD,GAAa,KAAKf,OAAOa,GAAKrB,GAuBpD,QAASyB,IAAKzB,EAAK3H,GACf,MAAOA,KAAO2H,GAgHlB,QAAS0B,IAAW1B,GAChB,MAAOD,IAAWC,MAoBtB,QAAS2B,IAAMV,EAAMW,GAIjB,IAAK,GAHDpK,MACAqK,EAAYD,EAAO1M,OAEdW,EAAI,EAAGZ,EAAMgM,EAAK/L,OAAYD,EAAJY,EAASA,IACxC2B,EAAOyJ,EAAKpL,IAAUgM,EAAJhM,EAAgB+L,EAAO/L,GAAK,MAGlD,OAAO2B,GAiHX,QAASsK,IAAMrB,EAAQsB,GACnB,GAAIvK,KAQJ,OANAuK,GAAUtL,QAAQ,SAAU4B,GACpBA,IAAOoI,KACPjJ,EAAOa,GAAOoI,EAAOpI,MAItBb,EAmBX,QAASwK,IAAQ9L,EAAWC,GACxB,MAAO,UAAUsK,GACb,GAAIjJ,KAEJ,KAAK,GAAIa,KAAOoI,GACRvK,EAAUG,KAAKF,EAAkBsK,EAAOpI,GAAMA,EAAKoI,KACnDjJ,EAAOa,GAAOoI,EAAOpI,GAI7B,OAAOb,IAmBf,QAASyK,IAAMxB,EAAQyB,GACnB,GAAI1K,KAEJ,KAAK,GAAIa,KAAOoI,GACmB,KAA3ByB,EAAUjC,QAAQ5H,KAClBb,EAAOa,GAAOoI,EAAOpI,GAI7B,OAAOb,GAmBX,QAAS2K,IAAQjM,EAAWC,GACxB,MAAO6L,IAAO5K,GAAIlB,GAAYC,GA+DlC,QAASiM,IAAUpC,EAAKqC,GACpB,MAAOA,GAAS7B,OAAO,SAAU8B,EAAQ5B,GACrC,GAAIlJ,GAASkJ,EAAQV,EAErB,OADAxI,GAAOtC,QAAUoN,EAAOvM,KAAKyB,GACtB8K,OA4Ef,QAASC,IAAa9B,EAAQ+B,EAAMvN,GAChC,MAAOwN,IAAOD,EAAK,IAAM,IAAKtK,KAAKyH,KAAK1K,EAAMwL,EAAOvL,SAqBzD,QAASwN,IAASjC,EAAQ+B,EAAMvN,GAC5B,MAAOsN,IAAY9B,EAAQ+B,EAAMvN,GAAOwL,EAqB5C,QAASkC,IAAUlC,EAAQ+B,EAAMvN,GAC7B,MAAOwL,GAAS8B,GAAY9B,EAAQ+B,EAAMvN,GAkB9C,QAASwN,IAAQhC,EAAQmC,GAGrB,IAAK,GAFDpL,GAAS,GAEJ3B,EAAI,EAAO+M,EAAJ/M,EAAWA,IACvB2B,GAAUiJ,CAGd,OAAOjJ,GAgBX,QAASqL,IAAUC,GACf,MAAOC,IAASC,KAAKC,KAAKH,GAsC9B,QAAS1C,IAAQxL,GACb,MAAiB,QAAVA,EAgBX,QAASsO,IAAQC,GACb,MAAO,UAAUvO,GACb,MAAOwI,IAAKxI,KAAWuO,GAgB/B,QAASlF,IAAarJ,GAElB,MAAiB,UAAVA,EAsBX,QAASwI,IAAMxI,GACX,MAAOwO,IAAaC,SAAShN,KAAKzB,GAAO0O,QAAQ,iBAAkB,IA/7GvE,GAAIC,IAAOrI,OAAOsI,OAAO,KASzBD,IAAKE,SAAY,QAGjB,IAAI3N,IAAIyN,GAGJhK,GAAc7C,MAAMgN,UACpBN,GAAelI,OAAOwI,UACtBX,GAAWY,OAAOD,UAyFlBE,GAAUC,SAASZ,KAAKA,KAAKY,SAASxN,KAuD1CkN,IAAK5O,OAASA,EACd4O,GAAK1O,QAAUA,EACf0O,GAAKK,QAAUA,GACfL,GAAKlO,SAAWA,EAChBkO,GAAKjO,QAAUA,CAsBf,IAAI6B,IAASyM,GAAQrK,GAAYpC,QAuB7BV,GAAUmN,GAAQrK,GAAY9C,SAoB9BqC,GAAM8K,GAAQrK,GAAYT,KAgB1B0H,GAASoD,GAAQrK,GAAYiH,QAa7BsD,GAAcF,GAAQrK,GAAYuK,aAgBlCtO,GAAQoO,GAAQrK,GAAY/D,MAEhC+N,IAAKpM,OAASA,GACdoM,GAAK9M,QAAUA,GACf8M,GAAKzK,IAAMA,GACXyK,GAAK/C,OAASA,GACd+C,GAAKO,YAAcA,GACnBP,GAAK/N,MAAQA,EA0Fb,IAAIuO,IAAO7H,EAAO1G,IAoBdwO,GAAQjI,EAAOgI,GAAM,GAAG,GAwIxBjM,GAAUjD,EAAQoC,EAAgB6B,IAoMlCmL,GAAOjM,EAAM,GAiBbkM,GAAO5O,EAAQE,GAAOM,GAAG,EAAG,IA0E5BqO,GAAOnM,EAAM,IA8NboM,GAAO9O,EAAQE,GAAOM,GAAG,EAAG,QAuB5BuO,GAAO/O,EAAQE,GAAOM,GAAG,EAAGA,IAoB5BwO,GAAQvI,EAAOsI,GAAM,GAAG,GAgFxBE,GAAQ1P,EAAQ2D,EAASb,EAAYoG,GAAMvI,KAASoD,GAmEpD4L,GAAM3P,EAAQ6E,EAAWd,GAazB6L,GAAe5L,EAAQqD,EAAOtD,GAElC2K,IAAK3M,SAAWA,EAChB2M,GAAKxM,WAAaA,EAClBwM,GAAKQ,KAAOA,GACZR,GAAKS,MAAQA,GACbT,GAAKlM,UAAYA,EACjBkM,GAAKjM,WAAaA,EAClBiM,GAAKhM,KAAOA,EACZgM,GAAK7L,UAAYA,EACjB6L,GAAKzL,QAAUA,GACfyL,GAAK5L,YAAcA,EACnB4L,GAAKxL,QAAUA,EACfwL,GAAKvL,MAAQA,EACbuL,GAAKnL,MAAQA,EACbmL,GAAKjL,QAAUA,EACfiL,GAAKU,KAAOA,GACZV,GAAKW,KAAOA,GACZX,GAAKhL,aAAeA,EACpBgL,GAAKzM,KAAOA,EACZyM,GAAKY,KAAOA,GACZZ,GAAK3K,KAAOA,EACZ2K,GAAK1K,QAAUA,EACf0K,GAAKxK,UAAYA,EACjBwK,GAAKtK,cAAgBA,EACrBsK,GAAKrK,MAAQA,EACbqK,GAAKnK,SAAWA,EAChBmK,GAAKlK,MAAQA,EACbkK,GAAKtM,eAAiBA,EACtBsM,GAAKa,KAAOA,GACZb,GAAKc,KAAOA,GACZd,GAAKe,MAAQA,GACbf,GAAK9J,UAAYA,EACjB8J,GAAK7J,UAAYA,EACjB6J,GAAKgB,MAAQA,GACbhB,GAAK/K,QAAUA,EACf+K,GAAKiB,IAAMA,GACXjB,GAAKkB,aAAeA,EAkPpB,IAAIC,IAASpP,EAAQ2F,EAASnF,IAAG,EAAOA,IAgBpC6O,GAAarP,EAAQ2F,EAASnF,IAAG,EAAMA,GA+B3CyN,IAAKnI,OAASA,EACdmI,GAAKjI,KAAOA,EACZiI,GAAKmB,OAASA,GACdnB,GAAKoB,WAAaA,GAClBpB,GAAK/H,SAAWA,CA0DhB,IAAIkD,IAAY3C,EAAO5G,EAAO,GAAG,GAgU7ByP,GAAO9H,EAAKjI,GA2GZgQ,GAAO3I,EAAOY,EAAKxH,GAEvBiO,IAAKpO,MAAQA,EACboO,GAAK7E,UAAYA,GACjB6E,GAAKtH,QAAUA,EACfsH,GAAKrH,OAASA,EACdqH,GAAKpH,MAAQA,EACboH,GAAKnH,WAAaA,EAClBmH,GAAKlH,UAAYA,EACjBkH,GAAKjH,eAAiBA,EACtBiH,GAAKhH,SAAWA,EAChBgH,GAAKzG,KAAOA,EACZyG,GAAKxG,SAAWA,EAChBwG,GAAKvG,UAAYA,EACjBuG,GAAKlG,QAAUA,EACfkG,GAAKhG,QAAUA,GACfgG,GAAKqB,KAAOA,GACZrB,GAAK9F,QAAUA,GACf8F,GAAK5F,SAAWA,GAChB4F,GAAKxF,MAAQA,GACbwF,GAAKsB,KAAOA,EAiRZ,IAAIC,IAAQ1N,GAAIuH,GAgDhB4E,IAAKvF,QAAUA,GACfuF,GAAKrF,MAAQA,GACbqF,GAAKnF,MAAQA,GACbmF,GAAKjF,UAAYA,GACjBiF,GAAK5E,GAAKA,GACV4E,GAAK3E,KAAOA,GACZ2E,GAAK1E,MAAQA,GACb0E,GAAKzE,KAAOA,GACZyE,GAAKxE,MAAQA,GACbwE,GAAKuB,MAAQA,GACbvB,GAAK5K,MAAQA,GACb4K,GAAKnM,IAAMA,GAwMXmM,GAAKvE,IAAMA,GACXuE,GAAKjK,MAAQA,GACbiK,GAAKpE,OAASA,GACdoE,GAAKnE,OAASA,GACdmE,GAAKlE,SAAWA,GAChBkE,GAAKjE,UAAYA,GACjBiE,GAAK/D,MAAQA,GACb+D,GAAK1D,UAAYA,GACjB0D,GAAK3D,SAAWA,GAChB2D,GAAKzD,SAAWA,EAiChB,IAAIiF,IAAahJ,EAAO,SAAUwE,EAASP,GACvC,MAAOO,GAAQP,GAAKlH,IAAIuH,GAAYL,KAGpCgF,GAAYjJ,EAAO,SAAWwE,EAASP,GACvC,MAAOO,GAAQP,GAAKQ,OAAO,SAAUhJ,EAAQa,GAGzC,MAFAb,GAAO,GAAGzB,KAAKsC,GACfb,EAAO,GAAGzB,KAAKiK,EAAI3H,IACZb,cAIXyN,GAAclJ,EAAO,SAAUwE,EAASP,GACxC,MAAOO,GAAQP,GAAKlH,IAAIxD,EAAQ+L,GAAKrB,MAqIrC7G,GAAS4C,EAAOsF,GAAK,GAAG,GA4ExB6D,GAASnJ,EAAO0F,GAAK,GAAG,GAiBxB0D,GAAc,SAAU9M,EAAKzD,GAC7B,MAAOC,GAAQS,EAAQqJ,GAAI/J,GAAQuE,GAAOd,KAwB1C+M,GAASxB,GAAQR,GAAaiC,gBAmB9BC,GAAYvJ,EAAOqJ,GAAQ,GAAG,GA6E9BG,GAAQjQ,EAAQgL,GAAQU,IAsBxBwE,GAAWlQ,EAAQgL,GAAQpF,OAAO+F,MAqBlCwE,GAAWV,GAAW7J,OAAO+F,MAoB7ByE,GAAYT,GAAY/J,OAAO+F,MAe/B0E,GAAQZ,GAAW/D,IA0HnB4E,GAAOZ,GAAUhE,IAoBjB6E,GAAUb,GAAU9J,OAAO+F,MA0D3B6E,GAAe/J,EAAOqG,GAAU,GAAG,GAgBnCR,GAASqD,GAAYjE,GAEzBuC,IAAK7C,QAAUA,GACf6C,GAAKvC,YAAcA,GACnBuC,GAAKrC,UAAYA,GACjBqC,GAAKlC,IAAMA,GACXkC,GAAKpK,OAASA,GACdoK,GAAKxC,YAAcA,GACnBwC,GAAK9B,IAAMA,GACX8B,GAAK2B,OAASA,GACd3B,GAAK4B,YAAcA,GACnB5B,GAAK6B,OAASA,GACd7B,GAAK+B,UAAYA,GACjB/B,GAAK7B,UAAYA,GACjB6B,GAAK5B,KAAOA,GACZ4B,GAAKgC,MAAQA,GACbhC,GAAKiC,SAAWA,GAChBjC,GAAKkC,SAAWA,GAChBlC,GAAKmC,UAAYA,GACjBnC,GAAKoC,MAAQA,GACbpC,GAAKzB,KAAOA,GACZyB,GAAKvB,OAASA,GACduB,GAAKtB,KAAOA,GACZsB,GAAKpB,OAASA,GACdoB,GAAKqC,KAAOA,GACZrC,GAAKsC,QAAUA,GACftC,GAAKnB,SAAWA,GAChBmB,GAAKuC,aAAeA,GACpBvC,GAAK3B,OAASA,GA6Fd2B,GAAKb,QAAUA,GACfa,GAAKZ,SAAWA,GAChBY,GAAKd,OAASA,GACdc,GAAKV,SAAWA,EAkBhB,IAAIkD,IAAQ3H,GAAMgC,GAAQnC,GA6E1BsF,IAAKwC,MAAQA,GACbxC,GAAKnD,OAASA,GACdmD,GAAKL,OAASA,GACdK,GAAKtF,YAAcA,GACnBsF,GAAKnG,KAAOA,GAGW,gBAAZ4I,SACPC,OAAOD,QAAUzC,GACQ,kBAAX2C,SAAyBA,OAAOC,IAC9CD,OAAO,WAAa,MAAO3C,MAE3B7O,EAAK6O,KAAOA,IAElBnO","file":"lamb.min.js","sourcesContent":["/**\n * @overview lamb - A lightweight, and docile, JavaScript library to help embracing functional programming.\n * @author Andrea Scartabelli \n * @version 0.17.0\n * @module lamb\n * @license MIT\n * @preserve\n */\n!function (host) {\n \"use strict\";\n\n var lamb = Object.create(null);\n\n /**\n * The current module version.\n * @memberof module:lamb\n * @private\n * @category Core\n * @type String\n */\n lamb._version = \"0.17.0\";\n\n // alias used as a placeholder argument for partial application\n var _ = lamb;\n\n // some prototype shortcuts for internal use\n var _arrayProto = Array.prototype;\n var _objectProto = Object.prototype;\n var _reProto = RegExp.prototype;\n\n /**\n * Builds a function that returns a constant value.\n * It's actually the simplest form of the K combinator or Kestrel.\n * @example\n * var truth = _.always(true);\n *\n * truth() // => true\n * truth(false) // => true\n * truth(1, 2) // => true\n *\n * // the value being returned is actually the\n * // very same value passed to the function\n * var foo = {bar: \"baz\"};\n * var alwaysFoo = _.always(foo);\n *\n * alwaysFoo() === foo // => true\n *\n * @memberof module:lamb\n * @category Core\n * @see [SKI combinator calculus]{@link https://en.wikipedia.org/wiki/SKI_combinator_calculus}\n * @param {*} value\n * @returns {Function}\n */\n function always (value) {\n return function () {\n return value;\n };\n }\n\n /**\n * Returns a function that is the composition of the functions given as parameters.\n * Each function consumes the result of the function that follows.\n * @example\n * var sayHi = function (name) { return \"Hi, \" + name; };\n * var capitalize = function (s) {\n * return s[0].toUpperCase() + s.substr(1).toLowerCase();\n * };\n * var fixNameAndSayHi = _.compose(sayHi, capitalize);\n *\n * sayHi(\"bOb\") // => \"Hi, bOb\"\n * fixNameAndSayHi(\"bOb\") // \"Hi, Bob\"\n *\n * var getName = _.getKey(\"name\");\n * var users = [{name: \"fred\"}, {name: \"bOb\"}];\n * var sayHiToUser = _.compose(fixNameAndSayHi, getName);\n *\n * users.map(sayHiToUser) // [\"Hi, Fred\", \"Hi, Bob\"]\n *\n * @memberof module:lamb\n * @category Function\n * @param {...Function} fn\n * @returns {Function}\n */\n function compose () {\n var functions = arguments;\n\n return function () {\n var args = arguments;\n var len = functions.length;\n\n while (len--) {\n args = [functions[len].apply(this, args)];\n }\n\n return args[0];\n };\n }\n\n /**\n * Creates generic functions out of methods.\n * @memberof module:lamb\n * @category Core\n * @author A very little change on a great idea by [Irakli Gozalishvili]{@link https://github.com/Gozala/}. Thanks for this *beautiful* one-liner (never liked your \"unbind\" naming choice, though).\n * @function\n * @example\n * // Lamb's \"filter\" is actually implemented like this\n * var filter = _.generic(Array.prototype.filter);\n * var isLowerCase = function (s) { return s.toLowerCase() === s; };\n *\n * filter([\"Foo\", \"bar\", \"baZ\"], isLowerCase) // => [\"bar\"]\n *\n * // the function will work with any array-like object\n * filter(\"fooBAR\", isLowerCase) // => [\"f\", \"o\", \"o\"]\n *\n * @param {Function} method\n * @returns {Function}\n */\n var generic = Function.bind.bind(Function.call);\n\n /**\n * The I combinator. Any value passed to the function is simply returned as it is.\n * @example\n * var foo = {bar: \"baz\"};\n *\n * _.identity(foo) === foo // true\n *\n * @memberof module:lamb\n * @category Core\n * @see [SKI combinator calculus]{@link https://en.wikipedia.org/wiki/SKI_combinator_calculus}\n * @param {*} value\n * @returns {*} The value passed as parameter.\n */\n function identity (value) {\n return value;\n }\n\n /**\n * Builds a partially applied function. The lamb object itself can be used as a placeholder argument:\n * it's useful to alias it as _ or __.\n * @example\n * var weights = [\"2 Kg\", \"10 Kg\", \"1 Kg\", \"7 Kg\"];\n * var parseInt10 = _.partial(parseInt, _, 10);\n *\n * weights.map(parseInt10) // => [2, 10, 1, 7]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {...*} args\n * @returns {Function}\n */\n function partial (fn) {\n var args = slice(arguments, 1);\n\n return function () {\n var lastArgumentIdx = 0;\n var newArgs = [];\n var argsLen = args.length;\n\n for (var i = 0, boundArg; i < argsLen; i++) {\n boundArg = args[i];\n newArgs[i] = boundArg === _ ? arguments[lastArgumentIdx++] : boundArg;\n }\n\n for (var len = arguments.length; lastArgumentIdx < len; lastArgumentIdx++) {\n newArgs.push(arguments[lastArgumentIdx]);\n }\n\n return fn.apply(this, newArgs);\n };\n }\n\n lamb.always = always;\n lamb.compose = compose;\n lamb.generic = generic;\n lamb.identity = identity;\n lamb.partial = partial;\n\n\n /**\n * Builds an array comprised of all values of the array-like object passing the predicate test.
\n * It's a generic version of [Array.prototype.filter]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/filter}.\n * @example\n * var isLowerCase = function (s) { return s.toLowerCase() === s; };\n *\n * _.filter([\"Foo\", \"bar\", \"baZ\"], isLowerCase) // => [\"bar\"]\n *\n * // the function will work with any array-like object\n * _.filter(\"fooBAR\", isLowerCase) // => [\"f\", \"o\", \"o\"]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Array}\n */\n var filter = generic(_arrayProto.filter);\n\n /**\n * Executes the provided iteratee for each element of the given array-like object.
\n * It's a generic version of [Array.prototype.forEach]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/forEach}.\n * @example Adding a CSS class to all elements of a NodeList in a browser environment\n * var addClass = function (className) {\n * return function (element) {\n * element.classList.add(className);\n * };\n * };\n * var paragraphs = document.querySelectorAll(\"#some-container p\");\n *\n * _.forEach(paragraphs, addClass(\"main\"));\n * // each \"p\" element in the container will have the \"main\" class now\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n */\n var forEach = generic(_arrayProto.forEach);\n\n /**\n * Creates an array from the results of the provided iteratee.
\n * It's a generic version of [Array.prototype.map]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map}.\n * @example\n * function getSquareRoots () {\n * return _.map(arguments, Math.sqrt);\n * }\n *\n * getSquareRoots(4, 9, 16) // => [2, 3, 4]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Array}\n */\n var map = generic(_arrayProto.map);\n\n /**\n * Reduces (or folds) the values of an array-like object, starting from the first, to a new value using the provided accumulator function.
\n * It's a generic version of [Array.prototype.reduce]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduce}.\n * @example\n * _.reduce([1, 2, 3, 4], _.add) // => 10\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {AccumulatorCallback} accumulator\n * @param {*} [initialValue]\n * @returns {*}\n */\n var reduce = generic(_arrayProto.reduce);\n\n /**\n * Same as {@link module:lamb.reduce|reduce}, but starts the fold operation from the last element instead.
\n * It's a generic version of [Array.prototype.reduceRight]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/reduceRight}.\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @param {AccumulatorCallback} accumulator\n * @param {*} [initialValue]\n * @returns {*}\n */\n var reduceRight = generic(_arrayProto.reduceRight);\n\n /**\n * Builds an array by extracting a portion of an array-like object.
\n * It's a generic version of [Array.prototype.slice]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/slice}.\n * @example\n * _.slice([\"foo\", \"bar\", \"baz\"], 0, 2) // => [\"foo\", \"bar\"]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike - Any array like object.\n * @param {Number} [start=0] - Zero-based index at which to begin extraction.\n * @param {Number} [end=arrayLike.length] - Zero-based index at which to end extraction. Extracts up to but not including end.\n * @returns {Array}\n */\n var slice = generic(_arrayProto.slice);\n\n lamb.filter = filter;\n lamb.forEach = forEach;\n lamb.map = map;\n lamb.reduce = reduce;\n lamb.reduceRight = reduceRight;\n lamb.slice = slice;\n\n\n function _findSliceEndIndex (arrayLike, predicate, predicateContext) {\n var idx = -1;\n var len = arrayLike.length;\n\n while (++idx < len && predicate.call(predicateContext, arrayLike[idx], idx, arrayLike));\n\n return idx;\n }\n\n function _flatten (array, output) {\n array.forEach(function (value) {\n if (Array.isArray(value)) {\n _flatten(value, output);\n } else {\n output.push(value);\n }\n });\n\n return output;\n }\n\n /**\n * Builds a predicate to check if an array-like object contains the given value.
\n * Please note that the equality test is made with {@link module:lamb.isSVZ|isSVZ}; so you can\n * check for NaN, but 0 and -0 are the same value.
\n * See also {@link module:lamb.isIn|isIn} for an uncurried version.\n * @example\n * var containsNaN = _.contains(NaN, 0);\n *\n * containsNaN([0, 1, 2, 3, NaN]) // => true\n *\n * @memberof module:lamb\n * @category Array\n * @param {*} value\n * @param {Number} [fromIndex=0] The position at which to begin searching for the given value.\n * @returns {Function}\n */\n function contains (value, fromIndex) {\n return function (arrayLike) {\n return isIn(arrayLike, value, fromIndex);\n };\n }\n\n /**\n * Returns an array of items present only in the first of the given arrays.
\n * Note that since version 0.13.0 this function uses the [\"SameValueZero\" comparison]{@link module:lamb.isSVZ|isSVZ}.\n * @example\n * var a1 = [1, 2, 3, 4];\n * var a2 = [2, 4, 5];\n * var a3 = [4, 5, 3, 1];\n *\n * _.difference(a1, a2) // => [1, 3]\n * _.difference(a1, a2, a3) // => []\n *\n * @memberof module:lamb\n * @category Array\n * @param {Array} array\n * @param {...Array} other\n * @returns {Array}\n */\n function difference (array) {\n var rest = shallowFlatten(slice(arguments, 1));\n var isInRest = partial(isIn, rest, _, 0);\n return array.filter(not(isInRest));\n }\n\n /**\n * Builds an array without the first n elements of the given array or array-like object.\n * Note that, being this only a shortcut for a specific use case of {@link module:lamb.slice|slice},\n * n can be a negative number.\n * @example\n * var arr = [1, 2, 3, 4, 5];\n *\n * _.drop(arr, 2) // => [3, 4, 5]\n * _.drop(arr, -1) // => [5]\n * _.drop(arr, -10) // => [1, 2, 3, 4, 5]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.dropN|dropN}\n * @see {@link module:lamb.take|take}, {@link module:lamb.takeN|takeN}\n * @see {@link module:lamb.takeWhile|takeWhile}, {@link module:lamb.dropWhile|dropWhile}\n * @param {ArrayLike} arrayLike\n * @param {Number} n\n * @returns {Array}\n */\n var drop = binary(slice);\n\n /**\n * A curried version of {@link module:lamb.drop|drop} that expects the number of elements\n * to drop to build a function waiting for the list to take the elements from.\n * See the note and examples for {@link module:lamb.drop|drop} about passing a negative n.\n * @example\n * var drop2 = _.dropN(2);\n *\n * drop2([1, 2, 3, 4, 5]) // => [3, 4, 5]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.drop|drop}\n * @see {@link module:lamb.take|take}, {@link module:lamb.takeN|takeN}\n * @see {@link module:lamb.takeWhile|takeWhile}, {@link module:lamb.dropWhile|dropWhile}\n * @param {Number} n\n * @returns {Function}\n */\n var dropN = _curry(drop, 2, true);\n\n /**\n * Builds a function that drops the first n elements satisfying a predicate from an array or array-like object.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var dropWhileIsEven = _.dropWhile(isEven);\n *\n * dropWhileIsEven([2, 4, 6, 8]) // => []\n * dropWhileIsEven([2, 4, 7, 8]) // => [7, 8]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.takeWhile|takeWhile}\n * @see {@link module:lamb.drop|drop}, {@link module:lamb.dropN|dropN}\n * @see {@link module:lamb.take|take}, {@link module:lamb.takeN|takeN}\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function dropWhile (predicate, predicateContext) {\n return function (arrayLike) {\n return slice(arrayLike, _findSliceEndIndex(arrayLike, predicate, predicateContext));\n };\n }\n\n /**\n * Returns a partial application of {@link module:lamb.filter|filter} that uses the given predicate and\n * the optional context to build a function expecting the array-like object to act upon.\n * @example\n * var isLowerCase = function (s) { return s.toLowerCase() === s; };\n * var getLowerCaseEntries = _.filterWith(isLowerCase);\n *\n * getLowerCaseEntries([\"Foo\", \"bar\", \"baZ\"]) // => [\"bar\"]\n *\n * // array-like objects can be used as well\n * getLowerCaseEntries(\"fooBAR\") // => [\"f\", \"o\", \"o\"]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function filterWith (predicate, predicateContext) {\n return partial(filter, _, predicate, predicateContext);\n }\n\n /**\n * Searches for an element satisfying the predicate in the given array-like object and returns it if\n * the search is successful. Returns undefined otherwise.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"age\": 12},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"age\": 18},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"age\": 40}\n * ];\n *\n * _.find(persons, _.hasKeyValue(\"age\", 40)) // => {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40}\n * _.find(persons, _.hasKeyValue(\"age\", 41)) // => undefined\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {*}\n */\n function find (arrayLike, predicate, predicateContext) {\n var result;\n\n for (var i = 0, len = arrayLike.length, element; i < len; i++) {\n element = arrayLike[i];\n\n if (predicate.call(predicateContext, element, i, arrayLike)) {\n result = element;\n break;\n }\n }\n\n return result;\n }\n\n /**\n * Searches for an element satisfying the predicate in the given array-like object and returns its\n * index if the search is successful. Returns -1 otherwise.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"age\": 12},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"age\": 18},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"age\": 40}\n * ];\n *\n * _.findIndex(persons, _.hasKeyValue(\"age\", 40)) // => 1\n * _.findIndex(persons, _.hasKeyValue(\"age\", 41)) // => -1\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Number}\n */\n function findIndex (arrayLike, predicate, predicateContext) {\n var result = -1;\n\n for (var i = 0, len = arrayLike.length; i < len; i++) {\n if (predicate.call(predicateContext, arrayLike[i], i, arrayLike)) {\n result = i;\n break;\n }\n }\n\n return result;\n }\n\n /**\n * Similar to {@link module:lamb.map|map}, but if the mapping function returns an array this will\n * be concatenated, rather than pushed, to the final result.\n * @example showing the difference with map\n * var words = [\"foo\", \"bar\"];\n * var toCharArray = function (s) { return s.split(\"\"); };\n *\n * _.map(words, toCharArray) // => [[\"f\", \"o\", \"o\"], [\"b\", \"a\", \"r\"]]\n * _.flatMap(words, toCharArray) // => [\"f\", \"o\", \"o\", \"b\", \"a\", \"r\"]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {Array} array\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Array}\n */\n var flatMap = compose(shallowFlatten, map);\n\n /**\n * Builds a partial application of {@link module:lamb.flatMap|flatMap} using the given iteratee\n * and the optional context. The resulting function expects the array to act upon.\n * @example\n * var toCharArray = function (s) { return s.split(\"\"); };\n * var wordsToCharArray = _.flatMapWith(toCharArray);\n *\n * wordsToCharArray([\"foo\", \"bar\"]) // => [\"f\", \"o\", \"o\", \"b\", \"a\", \"r\"]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Function}\n */\n function flatMapWith (iteratee, iterateeContext) {\n return partial(flatMap, _, iteratee, iterateeContext);\n }\n\n /**\n * Flattens an array. See also {@link module:lamb.shallowFlatten|shallowFlatten}.\n * @example showing the difference with shallowFlatten\n * var arr = [1, 2, [3, 4, [5, 6]], 7, 8];\n *\n * _.flatten(arr) // => [1, 2, 3, 4, 5, 6, 7, 8]\n * _.shallowFlatten(arr) // => [1, 2, 3, 4, [5, 6], 7, 8]\n *\n * @memberof module:lamb\n * @category Array\n * @param {Array} array\n * @returns {Array}\n */\n function flatten (array) {\n return _flatten(array, []);\n }\n\n /**\n * Retrieves the element at the given index in an array-like object.
\n * Like {@link module:lamb.slice|slice} the index can be negative.
\n * If the index isn't supplied, or if its value isn't an integer within the array-like bounds,\n * the function will return undefined.\n * @example\n * var getFifthElement = _.getAt(4);\n *\n * getFifthElement([1, 2, 3, 4, 5]) // => 5\n * getFifthElement(\"foo bar\") // => \"b\"\n * getFifthElement([]) // => undefined\n * getFifthElement(\"foo\") // => undefined\n *\n * @example Using negative indexes\n * _.getAt(-2)([1, 2, 3]) // => 2\n * _.getAt(-3)(\"foo\") // => \"f\"\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.head|head} and {@link module:lamb.last|last} for common use cases shortcuts.\n * @param {Number} index\n * @returns {Function}\n */\n function getAt (index) {\n return function (arrayLike) {\n return Math.floor(index) === index ? arrayLike[index < 0 ? index + arrayLike.length : index] : void 0;\n };\n }\n\n /**\n * Transforms an array-like object into a lookup table using the provided iteratee as a grouping\n * criterion to generate keys and values.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"city\": \"New York\"},\n * {\"name\": \"John\", \"city\": \"New York\"},\n * {\"name\": \"Mario\", \"city\": \"Rome\"},\n * {\"name\": \"Paolo\"}\n * ];\n * var getCity = _.getKey(\"city\");\n * var personsByCity = _.group(persons, getCity);\n *\n * // \"personsByCity\" holds:\n * // {\n * // \"New York\": [\n * // {\"name\": \"Jane\", \"city\": \"New York\"},\n * // {\"name\": \"John\", \"city\": \"New York\"}\n * // ],\n * // \"Rome\": [\n * // {\"name\": \"Mario\", \"city\": \"Rome\"}\n * // ],\n * // \"undefined\": [\n * // {\"name\": \"Paolo\"}\n * // ]\n * // }\n *\n * @example Adding a custom value for missing keys\n *\n * var getCityOrUnknown = _.condition(\n * _.hasKey(\"city\"),\n * getCity,\n * _.always(\"Unknown\")\n * );\n *\n * personsByCity = _.group(persons, getCityOrUnknown);\n *\n * // \"personsByCity\" now holds:\n * // {\n * // \"New York\": [\n * // {\"name\": \"Jane\", \"city\": \"New York\"},\n * // {\"name\": \"John\", \"city\": \"New York\"}\n * // ],\n * // \"Rome\": [\n * // {\"name\": \"Mario\", \"city\": \"Rome\"}\n * // ],\n * // \"Unknown\": [\n * // {\"name\": \"Paolo\"}\n * // ]\n * // }\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Object}\n */\n function group (arrayLike, iteratee, iterateeContext) {\n var result = {};\n var len = arrayLike.length;\n\n for (var i = 0, element; i < len; i++) {\n element = arrayLike[i];\n var key = iteratee.call(iterateeContext, element, i, arrayLike);\n\n if (key in result) {\n result[key].push(element);\n } else {\n result[key] = [element];\n }\n }\n\n return result;\n }\n\n /**\n * Using the provided iteratee, and its optional context, builds a [partial application]{@link module:lamb.partial}\n * of {@link module:lamb.group|group} expecting the array-like object to act upon.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"age\": 12},\n * {\"name\": \"John\", \"age\": 40},\n * {\"name\": \"Mario\", \"age\": 18},\n * {\"name\": \"Paolo\", \"age\": 15}\n * ];\n *\n * var getAgeStatus = function (person) { return person.age > 20 ? \"over 20\" : \"under 20\"; };\n * var groupByAgeStatus = _.groupBy(getAgeStatus);\n *\n * var personsByAgeStatus = groupByAgeStatus(persons);\n *\n * // \"personsByAgeStatus\" holds:\n * // {\n * // \"under 20\": [\n * // {\"name\": \"Jane\", \"age\": 12},\n * // {\"name\": \"Mario\", \"age\": 18},\n * // {\"name\": \"Paolo\", \"age\": 15}\n * // ],\n * // \"over 20\": [\n * // {\"name\": \"John\", \"age\": 40}\n * // ]\n * // }\n *\n * @memberof module:lamb\n * @category Array\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Function}\n */\n function groupBy (iteratee, iterateeContext) {\n return partial(group, _, iteratee, iterateeContext);\n }\n\n /**\n * Retrieves the first element of an array-like object.
\n * Just a common use case of {@link module:lamb.getAt|getAt} exposed for convenience.\n * @example\n * _.head([1, 2, 3]) // => 1\n * _.head(\"hello\") // => \"h\"\n * _.head([]) // => undefined\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.last|last}\n * @param {ArrayLike} arrayLike\n * @returns {*}\n */\n var head = getAt(0);\n\n /**\n * Returns a copy of the given array-like object without the last element.\n * @example\n * _.init([1, 2, 3, 4]) // => [1, 2, 3]\n * _.init([1]) // => []\n * _.init([]) // => []\n *\n * @memberOf module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.tail|tail}\n * @see {@link module:lamb.head|head}, {@link module:lamb.last|last}\n * @param {ArrayLike} arrayLike\n * @returns {Array}\n */\n var init = partial(slice, _, 0, -1);\n\n /**\n * Returns an array of every item present in all given arrays.
\n * Note that since version 0.13.0 this function uses the [\"SameValueZero\" comparison]{@link module:lamb.isSVZ|isSVZ}.\n * @example\n * var a1 = [1, 2, 3, 4];\n * var a2 = [2, 5, 4, 6];\n * var a3 = [5, 6, 7];\n *\n * _.intersection(a1, a2) // => [2, 4]\n * _.intersection(a1, a3) // => []\n *\n * @memberof module:lamb\n * @category Array\n * @param {...Array} array\n * @return {Array}\n */\n function intersection () {\n var rest = slice(arguments, 1);\n return uniques(arguments[0]).filter(function (item) {\n return rest.every(contains(item));\n });\n }\n\n /**\n * Checks if an array-like object contains the given value.
\n * Please note that the equality test is made with {@link module:lamb.isSVZ|isSVZ}; so you can\n * check for NaN, but 0 and -0 are the same value.
\n * See also {@link module:lamb.contains|contains} for a curried version building a predicate.\n * @example\n * var numbers = [0, 1, 2, 3, NaN];\n *\n * _.isIn(numbers, 1) // => true\n * _.isIn(numbers, 0) // => true\n * _.isIn(numbers, -0) // => true\n * _.isIn(numbers, NaN) // => true\n * _.isIn(numbers, 2, 3) // => false\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {*} value\n * @param {Number} [fromIndex=0] The position at which to begin searching for the given value.\n * @returns {Boolean}\n */\n function isIn (arrayLike, value, fromIndex) {\n var result = false;\n\n for (var i = fromIndex >>> 0, len = arrayLike.length; i < len; i++) {\n if (isSVZ(value, arrayLike[i])) {\n result = true;\n break;\n }\n }\n\n return result;\n }\n\n /**\n * Retrieves the last element of an array-like object.
\n * Just a common use case of {@link module:lamb.getAt|getAt} exposed for convenience.\n * @example\n * _.last([1, 2, 3]) // => 3\n * _.last(\"hello\") // => \"o\"\n * _.last([]) // => undefined\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.head|head}\n * @param {ArrayLike} arrayLike\n * @returns {*}\n */\n var last = getAt(-1);\n\n /**\n * Generates an array with the values passed as arguments.\n * @example\n * _.list(1, 2, 3) // => [1, 2, 3]\n *\n * @memberof module:lamb\n * @category Array\n * @param {...*} value\n * @returns {Array}\n */\n function list () {\n return arguments.length === 1 ? [arguments[0]] : Array.apply(null, arguments);\n }\n\n /**\n * Builds a partial application of {@link module:lamb.map|map} using the given iteratee and the optional context.\n * The resulting function expects the array-like object to act upon.\n * @example\n * var square = function (n) { return n * n; };\n * var getSquares = _.mapWith(square);\n *\n * getSquares([1, 2, 3, 4, 5]) // => [1, 4, 9, 16, 25]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {function}\n */\n function mapWith (iteratee, iterateeContext) {\n return partial(map, _, iteratee, iterateeContext);\n }\n\n /**\n * Splits an array-like object in two lists: the first with the elements satisfying the given predicate,\n * the others with the remaining elements.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var numbers = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];\n *\n * _.partition(numbers, isEven) // => [[2, 4, 6, 8, 10], [1, 3, 5, 7, 9]]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.partitionWith|partitionWith}\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Array, Array<*>>}\n */\n function partition (arrayLike, predicate, predicateContext) {\n var result = [[], []];\n var len = arrayLike.length;\n\n for (var i = 0, el; i < len; i++) {\n el = arrayLike[i];\n result[predicate.call(predicateContext, el, i, arrayLike) ? 0 : 1].push(el);\n }\n\n return result;\n }\n\n /**\n * Builds a partial application of {@link module:lamb.partition|partition} using the given predicate and the optional context.\n * The resulting function expects the array-like object to act upon.\n * @example\n * var users = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"active\": false},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"active\": true},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"active\": true},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"active\": false}\n * ];\n * var isActive = _.hasKeyValue(\"active\", true);\n * var splitByActiveStatus = _.partitionWith(isActive);\n *\n * splitByActiveStatus(users) // =>\n * // [[\n * // {\"name\": \"John\", \"surname\": \"Doe\", \"active\": true},\n * // {\"name\": \"Mario\", \"surname\": \"Rossi\", \"active\": true}\n * // ], [\n * // {\"name\": \"Jane\", \"surname\": \"Doe\", \"active\": false},\n * // {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"active\": false}\n * // ]]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.partition|partition}\n * @param {ListIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function partitionWith (predicate, predicateContext) {\n return partial(partition, _, predicate, predicateContext);\n }\n\n /**\n * \"Plucks\" the values of the specified key from a list of objects.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"age\": 12},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"age\": 18},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"age\": 15}\n * ];\n *\n * _.pluck(persons, \"age\") // => [12, 40, 18, 15]\n *\n * var lists = [\n * [1, 2],\n * [3, 4, 5],\n * [6]\n * ];\n *\n * _.pluck(lists, \"length\") // => [2, 3, 1]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.pluckKey|pluckKey}\n * @param {ArrayLike} arrayLike\n * @param {String} key\n * @returns {Array}\n */\n function pluck (arrayLike, key) {\n return map(arrayLike, getKey(key));\n }\n\n /**\n * A curried version of {@link module:lamb.pluck|pluck} expecting the key to retrieve to\n * build a function waiting for the array-like object to act upon.\n * @example\n * var persons = [\n * {\"name\": \"Jane\", \"surname\": \"Doe\", \"age\": 12},\n * {\"name\": \"John\", \"surname\": \"Doe\", \"age\": 40},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\", \"age\": 18},\n * {\"name\": \"Paolo\", \"surname\": \"Bianchi\", \"age\": 15}\n * ];\n * var getAges = _.pluckKey(\"age\");\n *\n * getAges(persons) // => [12, 40, 18, 15]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.pluck|pluck}\n * @function\n * @param {String} key\n * @returns {Function}\n */\n function pluckKey (key) {\n return mapWith(getKey(key));\n }\n\n /**\n * Builds a function that creates a copy of an array-like object with the given\n * index changed to the provided value.
\n * If the index is not an integer or if it's out of bounds, the function\n * will return a copy of the original array.
\n * Negative indexes are allowed.\n * @example\n * var arr = [1, 2, 3, 4, 5];\n *\n * _.setAt(2, 99)(arr) // => [1, 2, 99, 4, 5]\n * arr // => [1, 2, 3, 4, 5]\n *\n * _.setAt(10, 99)(arr) // => [1, 2, 3, 4, 5] (not a reference to `arr`)\n *\n * @example Using negative indexes\n * _.setAt(-1, 99)(arr) // => [1, 2, 3, 4, 99]\n *\n * @memberof module:lamb\n * @category Array\n * @param {Number} index\n * @param {*} value\n * @returns {Function}\n */\n function setAt (index, value) {\n return function (arrayLike) {\n var result = slice(arrayLike);\n var len = arrayLike.length;\n\n if (clamp(index, -len, len - 1) === Math.floor(index)) {\n result[index + (index < 0 ? len : 0)] = value;\n }\n\n return result;\n };\n }\n\n /**\n * Flattens the \"first level\" of an array.
\n * See also {@link module:lamb.flatten|flatten}.\n * @example showing the difference with flatten\n * var arr = [1, 2, [3, 4, [5, 6]], 7, 8];\n *\n * _.flatten(arr) // => [1, 2, 3, 4, 5, 6, 7, 8]\n * _.shallowFlatten(arr) // => [1, 2, 3, 4, [5, 6], 7, 8]\n *\n * @memberof module:lamb\n * @category Array\n * @param {Array} array\n * @returns {Array}\n */\n function shallowFlatten (array) {\n return _arrayProto.concat.apply([], array);\n }\n\n /**\n * Returns a copy of the given array-like object without the first element.\n * @example\n * _.tail([1, 2, 3, 4]) // => [2, 3, 4]\n * _.tail([1]) // => []\n * _.tail([]) // => []\n *\n * @memberOf module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.init|init}\n * @see {@link module:lamb.head|head}, {@link module:lamb.last|last}\n * @param {ArrayLike} arrayLike\n * @returns {Array}\n */\n var tail = partial(slice, _, 1, void 0);\n\n /**\n * Retrieves the first n elements from an array or array-like object.\n * Note that, being this a partial application of {@link module:lamb.slice|slice},\n * n can be a negative number.\n * @example\n * var arr = [1, 2, 3, 4, 5];\n *\n * _.take(arr, 3) // => [1, 2, 3]\n * _.take(arr, -1) // => [1, 2, 3, 4]\n * _.take(arr, -10) // => []\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.takeN|takeN}\n * @see {@link module:lamb.drop|drop}, {@link module:lamb.dropN|dropN}\n * @see {@link module:lamb.takeWhile|takeWhile}, {@link module:lamb.dropWhile|dropWhile}\n * @param {ArrayLike} arrayLike\n * @param {Number} n\n * @returns {Array}\n */\n var take = partial(slice, _, 0, _);\n\n /**\n * A curried version of {@link module:lamb.take|take} that expects the number of elements\n * to retrieve to build a function waiting for the list to take the elements from.\n * See the note and examples for {@link module:lamb.take|take} about passing a negative n.\n * @example\n * var take2 = _.takeN(2);\n *\n * take2([1, 2, 3, 4, 5]) // => [1, 2]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.take|take}\n * @see {@link module:lamb.drop|drop}, {@link module:lamb.dropN|dropN}\n * @see {@link module:lamb.takeWhile|takeWhile}, {@link module:lamb.dropWhile|dropWhile}\n * @param {Number} n\n * @returns {Function}\n */\n var takeN = _curry(take, 2, true);\n\n /**\n * Builds a function that takes the first n elements satisfying a predicate from an array or array-like object.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var takeWhileIsEven = _.takeWhile(isEven);\n *\n * takeWhileIsEven([1, 2, 4, 6, 8]) // => []\n * takeWhileIsEven([2, 4, 7, 8]) // => [2, 4]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.dropWhile|dropWhile}\n * @see {@link module:lamb.take|take}, {@link module:lamb.takeN|takeN}\n * @see {@link module:lamb.drop|drop}, {@link module:lamb.dropN|dropN}\n * @param {ListIteratorCallback} predicate\n * @param {Object} predicateContext\n * @returns {Function}\n */\n function takeWhile (predicate, predicateContext) {\n return function (arrayLike) {\n return slice(arrayLike, 0, _findSliceEndIndex(arrayLike, predicate, predicateContext));\n };\n }\n\n /**\n * Transposes a matrix. Can also be used to reverse a {@link module:lamb.zip|zip} operation.
\n * Just like {@link module:lamb.zip|zip}, the received array-like objects will be truncated to the\n * shortest length.\n * @example transposing a matrix\n * _.transpose([\n * [1, 2, 3],\n * [4, 5, 6],\n * [7, 8, 9]\n * ]) // =>\n * // [\n * // [1, 4, 7],\n * // [2, 5, 8],\n * // [3, 6, 9]\n * // ]\n *\n * @example showing the relationship with zip\n * var zipped = _.zip([\"a\", \"b\", \"c\"], [1, 2, 3]); // => [[\"a\", 1], [\"b\", 2], [\"c\", 3]]\n *\n * _.transpose(zipped) // => [[\"a\", \"b\", \"c\"], [1, 2, 3]]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike>} arrayLike\n * @returns {Array>}\n */\n function transpose (arrayLike) {\n var result = [];\n var minLen = apply(Math.min, pluck(arrayLike, \"length\")) >>> 0;\n var len = arrayLike.length;\n\n for (var i = 0, j; i < minLen; i++) {\n result.push([]);\n\n for (j = 0; j < len; j++) {\n result[i][j] = arrayLike[j][i];\n }\n }\n\n return result;\n }\n\n /**\n * Returns a list of every unique element present in the given array-like objects.\n * @example\n * _.union([1, 2, 3, 2], [3, 4], [1, 5]) // => [1, 2, 3, 4, 5]\n * _.union(\"abc\", \"bcd\", \"cde\") // => [\"a\", \"b\", \"c\", \"d\", \"e\"]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {...ArrayLike} arrayLike\n * @returns {Array}\n */\n var union = compose(uniques, flatMapWith(unary(slice)), list);\n\n /**\n * Returns an array comprised of the unique elements of the given array-like object.
\n * Can work with lists of complex objects if supplied with an iteratee.
\n * Note that since version 0.13.0 this function uses the [\"SameValueZero\" comparison]{@link module:lamb.isSVZ|isSVZ}.\n * @example with simple values\n * _.uniques([1, 2, 2, 3, 4, 3, 5, 1]) // => [1, 2, 3, 4, 5]\n *\n * @example with complex values\n * var data = [\n * {id: \"1\"},\n * {id: \"4\"},\n * {id: \"5\"},\n * {id: \"1\"},\n * {id: \"5\"},\n * ];\n *\n * _.uniques(data, _.getKey(\"id\")) // => [{id: \"1\"}, {id: \"4\"}, {\"id\": 5}]\n *\n * @memberof module:lamb\n * @category Array\n * @param {ArrayLike} arrayLike\n * @param {ListIteratorCallback} [iteratee] Defaults to the [identity function]{@link module:lamb.identity}.\n * @param {Object} [iterateeContext]\n * @returns {Array}\n */\n function uniques (arrayLike, iteratee, iterateeContext) {\n if (typeof iteratee !== \"function\") {\n iteratee = identity;\n }\n\n var result = [];\n var seen = [];\n var value;\n\n for (var i = 0; i < arrayLike.length; i++) {\n value = iteratee.call(iterateeContext, arrayLike[i], i , arrayLike);\n\n if (!isIn(seen, value)) {\n seen.push(value);\n result.push(arrayLike[i]);\n }\n }\n\n return result;\n }\n\n /**\n * Builds a list of arrays out of the given array-like objects by pairing items with the same index.
\n * The received array-like objects will be truncated to the shortest length.
\n * See also {@link module:lamb.zipWithIndex|zipWithIndex} and {@link module:lamb.transpose|transpose} for the reverse operation.\n * @example\n * _.zip(\n * [\"a\", \"b\", \"c\"],\n * [1, 2, 3],\n * [true, false, true]\n * ) // => [[\"a\", 1, true], [\"b\", 2, false], [\"c\", 3, true]]\n *\n * _.zip([1, 2, 3, 4], [5, 6, 7]) // => [[1, 5], [2, 6], [3, 7]]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {...ArrayLike} arrayLike\n * @returns {Array>}\n */\n var zip = compose(transpose, list);\n\n /**\n * \"{@link module:lamb.zip|Zips}\" an array-like object by pairing its values with their index.\n * @example\n * _.zipWithIndex([\"a\", \"b\", \"c\"]) // => [[\"a\", 0], [\"b\", 1], [\"c\", 2]]\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @param {ArrayLike} arrayLike\n * @returns {Array>}\n */\n var zipWithIndex = mapWith(binary(list));\n\n lamb.contains = contains;\n lamb.difference = difference;\n lamb.drop = drop;\n lamb.dropN = dropN;\n lamb.dropWhile = dropWhile;\n lamb.filterWith = filterWith;\n lamb.find = find;\n lamb.findIndex = findIndex;\n lamb.flatMap = flatMap;\n lamb.flatMapWith = flatMapWith;\n lamb.flatten = flatten;\n lamb.getAt = getAt;\n lamb.group = group;\n lamb.groupBy = groupBy;\n lamb.head = head;\n lamb.init = init;\n lamb.intersection = intersection;\n lamb.isIn = isIn;\n lamb.last = last;\n lamb.list = list;\n lamb.mapWith = mapWith;\n lamb.partition = partition;\n lamb.partitionWith = partitionWith;\n lamb.pluck = pluck;\n lamb.pluckKey = pluckKey;\n lamb.setAt = setAt;\n lamb.shallowFlatten = shallowFlatten;\n lamb.tail = tail;\n lamb.take = take;\n lamb.takeN = takeN;\n lamb.takeWhile = takeWhile;\n lamb.transpose = transpose;\n lamb.union = union;\n lamb.uniques = uniques;\n lamb.zip = zip;\n lamb.zipWithIndex = zipWithIndex;\n\n\n function _comparer (a, b) {\n var result = 0;\n\n if (typeof a !== typeof b) {\n a = String(a);\n b = String(b);\n }\n\n if (!isSVZ(a, b)) {\n if (a > b || a !== a) {\n result = 1;\n } else if (a < b || b !== b) {\n result = -1;\n }\n }\n\n return result;\n }\n\n function _compareWith (criteria) {\n var len = criteria.length;\n\n return function (a, b) {\n var result = 0;\n var isDescSort;\n var criterion;\n\n for (var i = 0; i < len; i++) {\n criterion = criteria[i];\n result = criterion.compare(a.value, b.value);\n\n if (result !== 0) {\n isDescSort = criteria[i].isDescending;\n break;\n }\n }\n\n if (result === 0) {\n isDescSort = criteria[len - 1].isDescending;\n result = a.index - b.index;\n }\n\n return isDescSort ? -result : result;\n };\n }\n\n function _getInsertionIndex (array, element, comparer, start, end) {\n if (array.length === 0) {\n return 0;\n }\n\n var pivot = (start + end) >> 1;\n var result = comparer({\n value: element,\n index: pivot\n }, {\n value: array[pivot],\n index: pivot\n });\n\n if (end - start <= 1) {\n return result < 0 ? pivot : pivot + 1;\n } else if (result < 0) {\n return _getInsertionIndex(array, element, comparer, start, pivot);\n } else if (result === 0) {\n return pivot + 1;\n } else {\n return _getInsertionIndex(array, element, comparer, pivot, end);\n }\n }\n\n function _makeCriteria (sorters) {\n return sorters.length ? sorters.map(_makeCriterion) : [_sorter()];\n }\n\n function _makeCriterion (criterion) {\n return typeof Object(criterion).compare === \"function\" ? criterion : _sorter(criterion);\n }\n\n function _sorter (reader, isDescending, comparer) {\n return {\n isDescending: isDescending === true,\n compare: function (a, b) {\n if (typeof reader === \"function\" && reader !== identity) {\n a = reader(a);\n b = reader(b);\n }\n\n return (comparer || _comparer)(a, b);\n }\n };\n }\n\n /**\n * Inserts an element in a copy of a sorted array respecting the sort order.\n * @example with simple values\n * _.insert([], 1) // => [1]\n * _.insert([2, 4, 6], 5) // => [2, 4, 5, 6]\n * _.insert([4, 2, 1], 3, _.sorterDesc()) // => [4, 3, 2, 1]\n *\n * @example with complex values\n * var persons = [\n * {\"name\": \"jane\", \"surname\": \"doe\"},\n * {\"name\": \"John\", \"surname\": \"Doe\"},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\"}\n * ];\n *\n * var getLowerCaseName = _.compose(\n * _.invoker(\"toLowerCase\"),\n * _.getKey(\"name\")\n * );\n *\n * var result = _.insert(\n * persons,\n * {\"name\": \"marco\", \"surname\": \"Rossi\"},\n * getLowerCaseName\n * );\n *\n * // `result` holds:\n * // [\n * // {\"name\": \"jane\", \"surname\": \"doe\"},\n * // {\"name\": \"John\", \"surname\": \"Doe\"},\n * // {\"name\": \"marco\", \"surname\": \"Rossi\"},\n * // {\"name\": \"Mario\", \"surname\": \"Rossi\"}\n * // ]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.sort|sort}, {@link module:lamb.sortWith|sortWith}\n * @see {@link module:lamb.sorter|sorter}, {@link module:lamb.sorterDesc|sorterDesc}\n * @param {Array} array\n * @param {*} element\n * @param {...(Sorter|Function)} [sorter={@link module:lamb.sorter|sorter()}] - The sorting criteria used to sort the array.\n * @returns {Array}\n */\n function insert (array, element) {\n var criteria = _makeCriteria(slice(arguments, 2));\n var result = array.concat();\n var idx = _getInsertionIndex(array, element, _compareWith(criteria), 0, array.length);\n\n result.splice(idx, 0, element);\n return result;\n }\n\n /**\n * Returns a [stably]{@link https://en.wikipedia.org/wiki/Sorting_algorithm#Stability} sorted copy of an\n * array-like object using the given criteria.
\n * Sorting criteria are built using Lamb's {@link module:lamb.sorter|sorter} function, but you can also\n * pass simple \"reader\" functions and default ascending sorters will be built for you.
\n * A \"reader\" is a function that evaluates the array element and supplies the value to be used in the comparison.
\n * Please note that if the arguments received by the default comparer aren't of the same type, they will be compared as strings.\n *\n * @example Stable sort:\n * var persons = [\n * {\"name\": \"John\", \"surname\" :\"Doe\"},\n * {\"name\": \"Mario\", \"surname\": \"Rossi\"},\n * {\"name\": \"John\", \"surname\" :\"Moe\"},\n * {\"name\": \"Jane\", \"surname\": \"Foe\"}\n * ];\n *\n * var personsByName = _.sort(persons, _.getKey(\"name\"));\n *\n * // personsByName holds:\n * // [\n * // {\"name\": \"Jane\", \"surname\": \"Foe\"},\n * // {\"name\": \"John\", \"surname\" :\"Doe\"},\n * // {\"name\": \"John\", \"surname\" :\"Moe\"},\n * // {\"name\": \"Mario\", \"surname\": \"Rossi\"}\n * // ]\n *\n * @example Stable multi-sort:\n * var personsByNameAscSurnameDesc = _.sort(\n * persons,\n * _.getKey(\"name\"),\n * _.sorterDesc(_.getKey(\"surname\"))\n * );\n *\n * // personsByNameAscSurnameDesc holds:\n * // [\n * // {\"name\": \"Jane\", \"surname\": \"Foe\"},\n * // {\"name\": \"John\", \"surname\" :\"Moe\"},\n * // {\"name\": \"John\", \"surname\" :\"Doe\"},\n * // {\"name\": \"Mario\", \"surname\": \"Rossi\"}\n * // ]\n *\n * @example Using custom comparers:\n * var localeSorter = new Intl.Collator(\"it\");\n * var chars = [\"a\", \"è\", \"à \", \"é\", \"c\", \"b\", \"e\"];\n *\n * _.sort(chars, localeSorter) // => [\"a\", \"à \", \"b\", \"c\", \"e\", \"é\", \"è\"]\n *\n * var localeSorterDesc = _.sorterDesc(_.identity, localeSorter.compare);\n *\n * _.sort(chars, localeSorterDesc) // => [\"è\", \"é\", \"e\", \"c\", \"b\", \"à \", \"a\"]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.sortWith|sortWith}\n * @see {@link module:lamb.sorter|sorter}, {@link module:lamb.sorterDesc|sorterDesc}\n * @param {ArrayLike} arrayLike\n * @param {...(Sorter|Function)} [sorter={@link module:lamb.sorter|sorter()}]\n * @returns {Array}\n */\n function sort (arrayLike) {\n var criteria = _makeCriteria(slice(arguments, 1));\n var data = [];\n var result = [];\n var len = arrayLike.length;\n\n for (var i = 0; i < len; i++) {\n data.push({\n value: arrayLike[i],\n index: i\n });\n }\n\n data.sort(_compareWith(criteria));\n\n for (i = 0; i < len; i++) {\n result.push(data[i].value);\n }\n\n return result;\n }\n\n /**\n * Creates an ascending sort criterion with the provided reader and comparer.
\n * See {@link module:lamb.sort|sort} for various examples.\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.insert|insert}\n * @see {@link module:lamb.sort|sort}, {@link module:lamb.sortWith|sortWith}\n * @see {@link module:lamb.sorterDesc|sorterDesc}\n * @param {Function} [reader={@link module:lamb.identity|identity}] A function meant to generate a simple value from a complex one. The function should evaluate the array element and supply the value to be passed to the comparer.\n * @param {Function} [comparer] An optional custom comparer function.\n * @returns {Sorter}\n */\n var sorter = partial(_sorter, _, false, _);\n\n /**\n * Creates a descending sort criterion with the provided reader and comparer.
\n * See {@link module:lamb.sort|sort} for various examples.\n *\n * @memberof module:lamb\n * @category Array\n * @function\n * @see {@link module:lamb.insert|insert}\n * @see {@link module:lamb.sort|sort}, {@link module:lamb.sortWith|sortWith}\n * @see {@link module:lamb.sorter|sorter}\n * @param {Function} [reader={@link module:lamb.identity|identity}] A function meant to generate a simple value from a complex one. The function should evaluate the array element and supply the value to be passed to the comparer.\n * @param {Function} [comparer] An optional custom comparer function.\n * @returns {Sorter}\n */\n var sorterDesc = partial(_sorter, _, true, _);\n\n /**\n * Builds a partial application of {@link module:lamb.sort|sort} using the provided criteria. The returned\n * function expects the array-like object to sort.\n * As usual, sorting criteria are built using Lamb's {@link module:lamb.sorter|sorter} function, but you can also\n * pass simple \"reader\" functions and default ascending sorters will be built.
\n * A \"reader\" is a function that evaluates the array element and supplies the value to be used in the comparison.
\n * See {@link module:lamb.sort|sort} for more examples.\n *\n * @example\n * var sortAsNumbers = _.sortWith(parseFloat);\n * var weights = [\"2 Kg\", \"10 Kg\", \"1 Kg\", \"7 Kg\"];\n *\n * sortAsNumbers(weights) // => [\"1 Kg\", \"2 Kg\", \"7 Kg\", \"10 Kg\"]\n *\n * @memberof module:lamb\n * @category Array\n * @see {@link module:lamb.sort|sort}\n * @see {@link module:lamb.sorter|sorter}, {@link module:lamb.sorterDesc|sorterDesc}\n * @param {...(Sorter|Function)} [sorter={@link module:lamb.sorter|sorter()}]\n * @returns {Function}\n */\n function sortWith () {\n var sorters = slice(arguments);\n\n return function (arrayLike) {\n return sort.apply(null, [arrayLike].concat(sorters));\n };\n }\n\n lamb.insert = insert;\n lamb.sort = sort;\n lamb.sorter = sorter;\n lamb.sorterDesc = sorterDesc;\n lamb.sortWith = sortWith;\n\n\n function _currier (fn, arity, isRightCurry, slicer, argsHolder) {\n return function () {\n var args = argsHolder.concat(slicer(arguments));\n\n if (args.length >= arity) {\n return fn.apply(this, isRightCurry ? args.reverse() : args);\n } else {\n return _currier(fn, arity, isRightCurry, slicer, args);\n }\n };\n }\n\n function _curry (fn, arity, isRightCurry, isAutoCurry) {\n var slicer = isAutoCurry ? slice : function (a) {\n return a.length ? [a[0]] : [];\n };\n\n if ((arity >>> 0) !== arity) {\n arity = fn.length;\n }\n\n return _currier(fn, arity, isRightCurry, slicer, []);\n }\n\n /**\n * Applies the passed function to the given argument list.\n * @example\n * _.apply(_.add, [3, 4]) // => 7\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {ArrayLike} args\n * @returns {*}\n */\n function apply (fn, args) {\n return fn.apply(fn, slice(args));\n }\n\n /**\n * A curried version of {@link module:lamb.apply|apply}. Expects an array-like object to use as arguments\n * and builds a function waiting for the target of the application.\n * @example\n * var data = [3, 4];\n * var applyDataTo = _.applyArgs(data);\n *\n * applyDataTo(_.add) // => 7\n * applyDataTo(_.multiply) // => 12\n *\n * @memberof module:lamb\n * @category Function\n * @function\n * @param {ArrayLike} args\n * @returns {Function}\n */\n var applyArgs = _curry(apply, 2, true);\n\n /**\n * Builds a function that passes only the specified amount of arguments to the given function.
\n * See also {@link module:lamb.binary|binary} and {@link module:lamb.unary|unary} for common use\n * cases shortcuts.\n * @example\n * var data = [\"1-2\", \"13-5\", \"6-23\"];\n * var getDashIndex = _.invoker(\"indexOf\", \"-\");\n *\n * data.map(getDashIndex) // => [1, 2, -1]\n * data.map(_.aritize(getDashIndex, 1)) // = > [1, 2, 1]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} arity\n * @returns {Function}\n */\n function aritize (fn, arity) {\n return function () {\n return apply(fn, slice(arguments, 0, arity));\n };\n }\n\n /**\n * Builds a function that passes only two arguments to the given function.
\n * It's simply a shortcut for a common use case of {@link module:lamb.aritize|aritize},\n * exposed for convenience.
\n * See also {@link module:lamb.unary|unary}.\n * @example\n * _.list(1, 2, 3, 4, 5) // => [1, 2, 3, 4, 5]\n * _.binary(_.list)(1, 2, 3, 4, 5) // => [1, 2]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @returns {Function}\n */\n function binary (fn) {\n return function (a, b) {\n return fn(a, b);\n };\n }\n\n /**\n * Transforms the evaluation of the given function in the evaluation of a sequence of functions\n * expecting only one argument. Each function of the sequence is a partial application of the\n * original one, which will be applied when the specified (or derived) arity is consumed.
\n * Currying will start from the leftmost argument: use {@link module:lamb.curryRight|curryRight}\n * for right currying.
\n * See also {@link module:lamb.curryable|curryable}, {@link module:lamb.curryableRight|curryableRight}\n * and {@link module:lamb.partial|partial}.\n * @example\n * var multiplyBy = _.curry(_.multiply);\n * var multiplyBy10 = multiplyBy(10);\n *\n * multiplyBy10(5) // => 50\n * multiplyBy10()(5) // => 50\n * multiplyBy10()()(2) // => 20\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} [arity=fn.length]\n * @returns {Function}\n */\n function curry (fn, arity) {\n return _curry(fn, arity, false);\n }\n\n /**\n * Same as {@link module:lamb.curry|curry}, but currying starts from the rightmost argument.\n * @example\n * var divideBy = _.curryRight(_.divide);\n * var halve = divideBy(2);\n * halve(3) // => 1.5\n * halve(3, 7) // => 1.5\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} [arity=fn.length]\n * @returns {Function}\n */\n function curryRight (fn, arity) {\n return _curry(fn, arity, true);\n }\n\n /**\n * Builds an auto-curried function. The resulting function can be called multiple times with\n * any number of arguments, and the original function will be applied only when the specified\n * (or derived) arity is consumed.
\n * Currying will start from the leftmost argument: use {@link module:lamb.curryableRight|curryableRight}\n * for right currying.
\n * Note that you can pass undefined values as arguments explicitly, if you are so inclined, but empty\n * calls doesn't consume the arity.
\n * See also {@link module:lamb.curry|curry}, {@link module:lamb.curryRight|curryRight} and\n * {@link module:lamb.partial|partial}.\n * @example\n * var collectFourElements = _.curryable(_.list, 4);\n *\n * collectFourElements(2)(3)(4)(5) // => [2, 3, 4, 5]\n * collectFourElements(2)(3, 4)(5) // => [2, 3, 4, 5]\n * collectFourElements(2, 3, 4, 5) // => [2, 3, 4, 5]\n * collectFourElements()(2)()(3, 4, 5) // => [2, 3, 4, 5]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} [arity=fn.length]\n * @returns {Function}\n */\n function curryable (fn, arity) {\n return _curry(fn, arity, false, true);\n }\n\n /**\n * Same as {@link module:lamb.curryable|curryable}, but currying starts from the rightmost argument.\n * @example\n * var collectFourElements = _.curryableRight(_.list, 4);\n *\n * collectFourElements(2)(3)(4)(5) // => [5, 4, 3, 2]\n * collectFourElements(2)(3, 4)(5) // => [5, 4, 3, 2]\n * collectFourElements(2, 3, 4, 5) // => [5, 4, 3, 2]\n * collectFourElements()(2)()(3, 4, 5) // => [5, 4, 3, 2]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} [arity=fn.length]\n * @returns {Function}\n */\n function curryableRight (fn, arity) {\n return _curry(fn, arity, true, true);\n }\n\n /**\n * Returns a function that will execute the given function only if it stops being called for the specified timespan.
\n * See also {@link module:lamb.throttle|throttle} for a different behaviour where the first call happens immediately.\n * @example A common use case of debounce in a browser environment\n * var updateLayout = function () {\n * // some heavy DOM operations here\n * };\n *\n * window.addEventListener(\"resize\", _.debounce(updateLayout, 200), false);\n *\n * // The resize event is fired repeteadly until the user stops resizing the\n * // window, while the `updateLayout` function is called only once: 200 ms\n * // after he stopped.\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} timespan - Expressed in milliseconds\n * @returns {Function}\n */\n function debounce (fn, timespan) {\n var timeoutID;\n\n return function () {\n var context = this;\n var args = arguments;\n var debounced = function () {\n timeoutID = null;\n fn.apply(context, args);\n };\n\n clearTimeout(timeoutID);\n timeoutID = setTimeout(debounced, timespan);\n };\n }\n\n /**\n * Returns a function that applies its arguments to the original function in reverse order.\n * @example\n * _.list(1, 2, 3) // => [1, 2, 3]\n * _.flip(_.list)(1, 2, 3) // => [3, 2, 1]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @returns {Function}\n */\n function flip (fn) {\n return function () {\n var args = slice(arguments).reverse();\n return fn.apply(this, args);\n };\n }\n\n /**\n * Builds a function that returns the argument received at the given index.
\n * As with {@link module:lamb.getAt|getAt} negative indexes are allowed.
\n * The resulting function will return undefined if no arguments are\n * passed or if the index is out of bounds.\n * @example\n * var getFirstArg = getArgAt(0);\n * var getLastArg = getArgAt(-1);\n *\n * getFirstArg(1, 2, 3) // => 1\n * getLastArg(1, 2, 3) // => 3\n *\n * getArgAt()(1, 2, 3) // => undefined\n * getArgAt(6)(1, 2, 3) // => undefined\n * getArgAt(1)() // => undefined\n *\n * @memberof module:lamb\n * @category Function\n * @param {Number} index\n * @returns {Function}\n */\n function getArgAt (index) {\n return compose(getAt(index), list);\n }\n\n /**\n * Accepts an object and builds a function expecting a method name, and optionally arguments, to call on such object.\n * Like {@link module:lamb.invoker|invoker}, if no method with the given name is found the function will return undefined.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var arr = [1, 2, 3, 4, 5];\n * var invokerOnArr = _.invokerOn(arr);\n *\n * invokerOnArr(\"filter\", isEven) // => [2, 4]\n * invokerOnArr(\"slice\", 1, 3) // => [2, 3]\n *\n * @memberof module:lamb\n * @category Function\n * @see {@link module:lamb.invoker|invoker}\n * @param {Object} target\n * @returns {Function}\n */\n function invokerOn (target) {\n return function (methodName) {\n var args = slice(arguments, 1);\n var method = target[methodName];\n return type(method) === \"Function\" ? method.apply(target, args) : void 0;\n };\n }\n\n /**\n * Builds a function that will invoke the given method name on any received object and return\n * the result. If no method with such name is found the function will return undefined.\n * Along with the method name it's possible to supply some arguments that will be bound to the method call.
\n * Further arguments can also be passed when the function is actually called, and they will be concatenated\n * to the bound ones.
\n * If different objects share a method name it's possible to build polymorphic functions as you can see in\n * the example below.
\n * {@link module:lamb.condition|Condition} can be used to wrap invoker to avoid this behaviour\n * by adding a predicate, while {@link module:lamb.adapter|adapter} can build more complex polymorphic functions\n * without the need of homonymy.
\n * Returning undefined or checking for such value is meant to favor composition and interoperability\n * between the aforementioned functions: for a more standard behaviour see also {@link module:lamb.generic|generic}.\n * See also {@link module:lamb.invokerOn|invokerOn}.\n * @example Basic polymorphism with invoker\n * var polySlice = _.invoker(\"slice\");\n *\n * polySlice([1, 2, 3, 4, 5], 1, 3) // => [2, 3]\n * polySlice(\"Hello world\", 1, 3) // => \"el\"\n *\n * @example With bound arguments\n * var substrFrom2 = _.invoker(\"substr\", 2);\n * substrFrom2(\"Hello world\") // => \"llo world\"\n * substrFrom2(\"Hello world\", 5) // => \"llo w\"\n *\n * @memberof module:lamb\n * @category Function\n * @param {String} methodName\n * @param {...*} [boundArg]\n * @returns {Function}\n */\n function invoker (methodName) {\n var boundArgs = slice(arguments, 1);\n\n return function (target) {\n var args = slice(arguments, 1);\n var method = target[methodName];\n return type(method) === \"Function\" ? method.apply(target, boundArgs.concat(args)) : void 0;\n };\n }\n\n /**\n * Builds a function that allows to map over the received arguments before applying them to the original one.\n * @example\n * var sumArray = _.invoker(\"reduce\", _.add);\n * var sum = _.compose(sumArray, _.list);\n *\n * sum(1, 2, 3, 4, 5) // => 15\n *\n * var square = _.partial(Math.pow, _, 2);\n * var sumSquares = _.mapArgs(sum, square);\n *\n * sumSquares(1, 2, 3, 4, 5) // => 55\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {ListIteratorCallback} mapper\n * @returns {Function}\n */\n function mapArgs (fn, mapper) {\n return compose(partial(apply, fn), mapWith(mapper), list);\n }\n\n /**\n * Creates a pipeline of functions, where each function consumes the result of the previous one.
\n * See also {@link module:lamb.compose|compose}.\n * @example\n * var square = _.partial(Math.pow, _, 2);\n * var getMaxAndSquare = _.pipe(Math.max, square);\n *\n * getMaxAndSquare(3, 5) // => 25\n *\n * @memberof module:lamb\n * @category Function\n * @function\n * @param {...Function} fn\n * @returns {Function}\n */\n var pipe = flip(compose);\n\n /**\n * Builds a function that allows to \"tap\" into the arguments of the original one.\n * This allows to extract simple values from complex ones, transform arguments or simply intercept them.\n * If a \"tapper\" isn't found the argument is passed as it is.\n * @example\n * var someObject = {count: 5};\n * var someArrayData = [2, 3, 123, 5, 6, 7, 54, 65, 76, 0];\n * var getDataAmount = _.tapArgs(_.add, _.getKey(\"count\"), _.getKey(\"length\"));\n *\n * getDataAmount(someObject, someArrayData); // => 15\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {...?Function} [tapper]\n * @returns {Function}\n */\n function tapArgs (fn) {\n var readers = slice(arguments, 1);\n\n return function () {\n var len = arguments.length;\n var args = [];\n\n for (var i = 0; i < len; i++) {\n args.push(readers[i] ? readers[i](arguments[i]) : arguments[i]);\n }\n\n return fn.apply(this, args);\n };\n }\n\n /**\n * Returns a function that will invoke the passed function at most once in the given timespan.
\n * The first call in this case happens as soon as the function is invoked; see also {@link module:lamb.debounce|debounce}\n * for a different behaviour where the first call is delayed.\n * @example\n * var log = _.throttle(console.log.bind(console), 5000);\n *\n * log(\"Hi\"); // console logs \"Hi\"\n * log(\"Hi again\"); // nothing happens\n * // after five seconds\n * log(\"Hello world\"); // console logs \"Hello world\"\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @param {Number} timespan - Expressed in milliseconds.\n * @returns {Function}\n */\n function throttle (fn, timespan) {\n var result;\n var lastCall = 0;\n\n return function () {\n var now = Date.now();\n\n if (now - lastCall >= timespan) {\n lastCall = now;\n result = fn.apply(this, arguments);\n }\n\n return result;\n };\n }\n\n /**\n * Builds a function that passes only one argument to the given function.
\n * It's simply a shortcut for a common use case of {@link module:lamb.aritize|aritize},\n * exposed for convenience.
\n * See also {@link module:lamb.binary|binary}.\n * @example\n * var weights = [\"2 Kg\", \"10 Kg\", \"1 Kg\", \"7 Kg\"];\n *\n * weights.map(_.unary(parseInt)) // => [2, 10, 1, 7]\n *\n * @memberof module:lamb\n * @category Function\n * @param {Function} fn\n * @returns {Function}\n */\n function unary (fn) {\n return function (a) {\n return fn(a);\n };\n }\n\n /**\n * Wraps the function fn inside a wrapper function.
\n * This allows to conditionally execute fn, to tamper with its arguments or return value\n * and to run code before and after its execution.
\n * Being this nothing more than a \"{@link module:lamb.flip|flipped}\" [partial application]{@link module:lamb.partial},\n * you can also easily build new functions from existent ones.\n * @example\n * var arrayMax = _.wrap(Math.max, _.apply);\n *\n * arrayMax([4, 5, 2, 6, 1]) // => 6\n *\n * @memberof module:lamb\n * @category Function\n * @function\n * @param {Function} fn\n * @param {Function} wrapper\n * @returns {Function}\n */\n var wrap = binary(flip(partial));\n\n lamb.apply = apply;\n lamb.applyArgs = applyArgs;\n lamb.aritize = aritize;\n lamb.binary = binary;\n lamb.curry = curry;\n lamb.curryRight = curryRight;\n lamb.curryable = curryable;\n lamb.curryableRight = curryableRight;\n lamb.debounce = debounce;\n lamb.flip = flip;\n lamb.getArgAt = getArgAt;\n lamb.invokerOn = invokerOn;\n lamb.invoker = invoker;\n lamb.mapArgs = mapArgs;\n lamb.pipe = pipe;\n lamb.tapArgs = tapArgs;\n lamb.throttle = throttle;\n lamb.unary = unary;\n lamb.wrap = wrap;\n\n\n /**\n * Accepts a series of functions and builds a function that applies the received arguments to each one and\n * returns the first non undefined value.
\n * Meant to work in sinergy with {@link module:lamb.condition|condition} and {@link module:lamb.invoker|invoker},\n * can be useful as a strategy pattern for functions, to mimic conditional logic and also to build polymorphic functions.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var filterString = _.compose(_.invoker(\"join\", \"\"), _.filter);\n * var filterAdapter = _.adapter(\n * _.invoker(\"filter\"),\n * _.condition(_.isType(\"String\"), filterString)\n * );\n *\n * filterAdapter([1, 2, 3, 4, 5, 6], isEven)) // => [2, 4, 6]\n * filterAdapter(\"123456\", isEven)) // => \"246\"\n * filterAdapter({}, isEven)) // => undefined\n *\n * // obviously it's composable\n * var filterWithDefault = _.adapter(filterAdapter, _.always(\"Not implemented\"));\n *\n * filterWithDefault([1, 2, 3, 4, 5, 6], isEven)) // => [2, 4, 6]\n * filterWithDefault(\"123456\", isEven)) // => \"246\"\n * filterWithDefault({}, isEven)) // => \"Not implemented\"\n *\n * @memberof module:lamb\n * @category Logic\n * @param {...Function} fn\n * @returns {Function}\n */\n function adapter () {\n var functions = slice(arguments);\n\n return function () {\n var len = functions.length;\n var result;\n\n for (var i = 0; i < len; i++) {\n result = apply(functions[i], arguments);\n\n if (!isUndefined(result)) {\n break;\n }\n }\n\n return result;\n };\n }\n\n /**\n * Builds a predicate that returns true if all the given predicates are satisfied.\n * The arguments passed to the resulting function are applied to every predicate unless one of them returns false.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var isPositive = function (n) { return n > 0; };\n * var isPositiveEven = _.allOf(isEven, isPositive);\n *\n * isPositiveEven(-2) // => false\n * isPositiveEven(11) // => false\n * isPositiveEven(6) // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @see {@link module:lamb.anyOf|anyOf}\n * @param {...Function} predicate\n * @returns {Function}\n */\n function allOf () {\n var predicates = slice(arguments);\n\n return function () {\n var args = arguments;\n\n return predicates.every(function (predicate) {\n return predicate.apply(null, args);\n });\n };\n }\n\n /**\n * Builds a predicate that returns true if at least one of the given predicates is satisfied.\n * The arguments passed to the resulting function are applied to every predicate until one of them returns true.\n * @example\n * // Lamb's \"isNil\" is actually implemented like this\n * var isNil = _.anyOf(_.isNull, _.isUndefined);\n *\n * isNil(NaN) // => false\n * isNil({}) // => false\n * isNil(null) // => true\n * isNil(void 0) // => true\n * isNil() // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @see {@link module:lamb.allOf|allOf}\n * @param {...Function} predicate\n * @returns {Function}\n */\n function anyOf () {\n var predicates = slice(arguments);\n\n return function () {\n var args = arguments;\n\n return predicates.some(function (predicate) {\n return predicate.apply(null, args);\n });\n };\n }\n\n /**\n * Builds a function that will apply the received arguments to trueFn, if the predicate is satisfied with\n * the same arguments, or to falseFn otherwise.
\n * If falseFn isn't provided and the predicate isn't satisfied the function will return undefined.
\n * Although you can use other conditions as trueFn or falseFn, it's probably better to\n * use {@link module:lamb.adapter|adapter} to build more complex behaviours.\n * @example\n * var isEven = function (n) { return n % 2 === 0};\n * var halve = function (n) { return n / 2; };\n * var halveIfEven = _.condition(isEven, halve, _.identity);\n *\n * halveIfEven(5) // => 5\n * halveIfEven(6) // => 3\n *\n * @memberof module:lamb\n * @category Logic\n * @see {@link module:lamb.invoker|invoker}\n * @param {Function} predicate\n * @param {Function} trueFn\n * @param {Function} [falseFn]\n * @returns {Function}\n */\n function condition (predicate, trueFn, falseFn) {\n return function () {\n var applyArgsTo = applyArgs(arguments);\n return applyArgsTo(predicate) ? applyArgsTo(trueFn) : falseFn ? applyArgsTo(falseFn) : void 0;\n };\n }\n\n /**\n * Verifies that the two supplied values are the same value using the \"SameValue\" comparison.
\n * Note that this doesn't behave as the strict equality operator, but rather as a shim of ES6's\n * [Object.is]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/is}.\n * Differences are that 0 and -0 aren't the same value and, finally, NaN is equal to itself.
\n * See also {@link module:lamb.isSVZ|isSVZ} which performs the check using the \"SameValueZero\" comparison.\n * @example\n * var testObject = {};\n *\n * _.is({}, testObject) // => false\n * _.is(testObject, testObject) // => true\n * _.is(\"foo\", \"foo\") // => true\n * _.is(0, -0) // => false\n * _.is(0 / 0, NaN) // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @see [SameValue comparison]{@link https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevalue}\n * @see [SameValueZero comparison]{@link https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero}\n * @param {*} a\n * @param {*} b\n * @returns {Boolean}\n */\n function is (a, b) {\n return a === 0 && b === 0 ? 1 / a === 1 / b : isSVZ(a, b);\n }\n\n /**\n * Verifies that the first given value is greater than the second.\n * @example\n * var pastDate = new Date(2010, 2, 12);\n * var today = new Date();\n *\n * _.isGT(today, pastDate) // true\n * _.isGT(pastDate, today) // false\n * _.isGT(3, 4) // false\n * _.isGT(3, 3) // false\n * _.isGT(3, 2) // true\n * _.isGT(0, -0) // false\n * _.isGT(-0, 0) // false\n * _.isGT(\"a\", \"A\") // true\n * _.isGT(\"b\", \"a\") // true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Number|String|Date|Boolean} a\n * @param {Number|String|Date|Boolean} b\n * @returns {Boolean}\n */\n function isGT (a, b) {\n return a > b;\n }\n\n /**\n * Verifies that the first given value is greater than or equal to the second.\n * Regarding equality, beware that this is simply a wrapper for the native operator, so -0 === 0.\n * @example\n * _.isGTE(3, 4) // false\n * _.isGTE(3, 3) // true\n * _.isGTE(3, 2) // true\n * _.isGTE(0, -0) // true\n * _.isGTE(-0, 0) // true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Number|String|Date|Boolean} a\n * @param {Number|String|Date|Boolean} b\n * @returns {Boolean}\n */\n function isGTE (a, b) {\n return a >= b;\n }\n\n /**\n * Verifies that the first given value is less than the second.\n * @example\n * var pastDate = new Date(2010, 2, 12);\n * var today = new Date();\n *\n * _.isLT(today, pastDate) // false\n * _.isLT(pastDate, today) // true\n * _.isLT(3, 4) // true\n * _.isLT(3, 3) // false\n * _.isLT(3, 2) // false\n * _.isLT(0, -0) // false\n * _.isLT(-0, 0) // false\n * _.isLT(\"a\", \"A\") // false\n * _.isLT(\"a\", \"b\") // true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Number|String|Date|Boolean} a\n * @param {Number|String|Date|Boolean} b\n * @returns {Boolean}\n */\n function isLT (a, b) {\n return a < b;\n }\n\n /**\n * Verifies that the first given value is less than or equal to the second.\n * Regarding equality, beware that this is simply a wrapper for the native operator, so -0 === 0.\n * @example\n * _.isLTE(3, 4) // true\n * _.isLTE(3, 3) // true\n * _.isLTE(3, 2) // false\n * _.isLTE(0, -0) // true\n * _.isLTE(-0, 0) // true\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Number|String|Date|Boolean} a\n * @param {Number|String|Date|Boolean} b\n * @returns {Boolean}\n */\n function isLTE (a, b) {\n return a <= b;\n }\n\n /**\n * A simple negation of {@link module:lamb.is|is}, exposed for convenience.\n * @example\n * _.isNot(\"foo\", \"foo\") // => false\n * _.isNot(0, -0) // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @function\n * @param {*} valueA\n * @param {*} valueB\n * @returns {Boolean}\n */\n var isNot = not(is);\n\n /**\n * Verifies that the two supplied values are the same value using the \"SameValueZero\" comparison.
\n * With this comparison NaN is equal to itself, but 0 and -0 are\n * considered the same value too.
\n * See also {@link module:lamb.is|is} to perform a \"SameValue\" comparison.\n * @example\n * var testObject = {};\n *\n * _.isSVZ({}, testObject) // => false\n * _.isSVZ(testObject, testObject) // => true\n * _.isSVZ(\"foo\", \"foo\") // => true\n * _.isSVZ(0, -0) // => true\n * _.isSVZ(0 / 0, NaN) // => true\n *\n * @memberof module:lamb\n * @category Logic\n * @see [SameValue comparison]{@link https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevalue}\n * @see [SameValueZero comparison]{@link https://people.mozilla.org/~jorendorff/es6-draft.html#sec-samevaluezero}\n * @param {*} a\n * @param {*} b\n * @returns {Boolean}\n */\n function isSVZ (a, b) {\n return a !== a ? b !== b : a === b;\n }\n\n /**\n * Returns a predicate that negates the given one.\n * @example\n * var isEven = function (n) { return n % 2 === 0; };\n * var isOdd = _.not(isEven);\n *\n * isOdd(5) // => true\n * isOdd(4) // => false\n *\n * @memberof module:lamb\n * @category Logic\n * @param {Function} predicate\n * @returns {Function}\n */\n function not (predicate) {\n return function () {\n return !predicate.apply(null, arguments);\n };\n }\n\n lamb.adapter = adapter;\n lamb.allOf = allOf;\n lamb.anyOf = anyOf;\n lamb.condition = condition;\n lamb.is = is;\n lamb.isGT = isGT;\n lamb.isGTE = isGTE;\n lamb.isLT = isLT;\n lamb.isLTE = isLTE;\n lamb.isNot = isNot;\n lamb.isSVZ = isSVZ;\n lamb.not = not;\n\n\n /**\n * Adds two numbers.\n * @example\n * _.add(4, 5) // => 9\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function add (a, b) {\n return a + b;\n }\n\n /**\n * \"Clamps\" a number within the given limits.\n * @example\n * _.clamp(-5, 0, 10) // => 0\n * _.clamp(5, 0, 10) // => 5\n * _.clamp(15, 0, 10) // => 10\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} n\n * @param {Number} min\n * @param {Number} max\n * @returns {Number}\n */\n function clamp (n, min, max) {\n return n < min ? min : n > max ? max : n;\n }\n\n /**\n * Divides two numbers.\n * @example\n * _.divide(5, 2) // => 2.5\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function divide (a, b) {\n return a / b;\n }\n\n /**\n * Performs the modulo operation and should not be confused with the {@link module:lamb.remainder|remainder}.\n * The function performs a floored division to calculate the result and not a truncated one, hence the sign of\n * the dividend is not kept, unlike the {@link module:lamb.remainder|remainder}.\n * @example\n * _.modulo(5, 3) // => 2\n * _.remainder(5, 3) // => 2\n *\n * _.modulo(-5, 3) // => 1\n * _.remainder(-5, 3) // => -2\n *\n * @memberof module:lamb\n * @category Math\n * @see {@link http://en.wikipedia.org/wiki/Modulo_operation}\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function modulo (a, b) {\n return a - (b * Math.floor(a / b));\n }\n\n /**\n * Multiplies two numbers.\n * @example\n * _.multiply(5, 3) // => 15\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function multiply (a, b) {\n return a * b;\n }\n\n /**\n * Generates a random integer between two given integers, both included.\n * Note that no safety measure is taken if the provided arguments aren't integers, so\n * you may end up with unexpected (not really) results.\n * For example randomInt(0.1, 1.2) could be 2.\n * @example\n *\n * _.randomInt(1, 10) // => an integer >=1 && <= 10\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} min\n * @param {Number} max\n * @returns {Number}\n */\n function randomInt (min, max) {\n return Math.floor(Math.random() * (max - min + 1) + min);\n }\n\n /**\n * Generates an arithmetic progression of numbers starting from start up to,\n * but not including, limit, using the given step.\n * @example\n * _.range(2, 10) // => [2, 3, 4, 5, 6, 7, 8, 9]\n * _.range(2, 10, 0) // => [2]\n * _.range(1, -10, -2) // => [1, -1, -3, -5, -7, -9]\n * _.range(1, -10, 2) // => [1]\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} start\n * @param {Number} limit\n * @param {Number} [step=1]\n * @returns {Number[]}\n */\n function range (start, limit, step) {\n if (step === 0 || arguments.length < 2) {\n return [start];\n }\n\n if (!step) {\n step = 1;\n }\n\n var len = Math.max(Math.ceil((limit - start) / step), 0);\n return sequence(start, len, partial(add, step));\n }\n\n /**\n * Gets the remainder of the division of two numbers.\n * Not to be confused with the {@link module:lamb.modulo|modulo} as the remainder\n * keeps the sign of the dividend and may lead to some unexpected results.\n * @example\n * // example of wrong usage of the remainder\n * // (in this case the modulo operation should be used)\n * var isOdd = function (n) { return _.remainder(n, 2) === 1; };\n * isOdd(-3) // => false as -3 % 2 === -1\n *\n * @memberof module:lamb\n * @category Math\n * @see {@link http://en.wikipedia.org/wiki/Modulo_operation}\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function remainder (a, b) {\n return a % b;\n }\n\n /**\n * Generates a sequence of values of the desired length with the provided iteratee.\n * The values being iterated, and received by the iteratee, are the results generated so far.\n * @example\n * var fibonacci = function (n, idx, list) {\n * return n + (list[idx - 1] || 0);\n * };\n *\n * _.sequence(1, 10, fibonacci) // => [1, 1, 2, 3, 5, 8, 13, 21, 34, 55]\n *\n * @memberof module:lamb\n * @category Math\n * @param {*} start - The starting value\n * @param {Number} len - The desired length for the sequence\n * @param {ListIteratorCallback} iteratee\n * @param {Object} [iterateeContext]\n * @returns {Array}\n */\n function sequence (start, len, iteratee, iterateeContext) {\n var result = [start];\n\n for (var i = 0, limit = len - 1; i < limit; i++) {\n result.push(iteratee.call(iterateeContext, result[i], i, result));\n }\n\n return result;\n }\n\n /**\n * Subtracts two numbers.\n * @example\n * _.subtract(5, 3) // => 2\n *\n * @memberof module:lamb\n * @category Math\n * @param {Number} a\n * @param {Number} b\n * @returns {Number}\n */\n function subtract (a, b) {\n return a - b;\n }\n\n lamb.add = add;\n lamb.clamp = clamp;\n lamb.divide = divide;\n lamb.modulo = modulo;\n lamb.multiply = multiply;\n lamb.randomInt = randomInt;\n lamb.range = range;\n lamb.remainder = remainder;\n lamb.sequence = sequence;\n lamb.subtract = subtract;\n\n\n function _immutable (obj, seen) {\n if (seen.indexOf(obj) === -1) {\n seen.push(Object.freeze(obj));\n\n Object.getOwnPropertyNames(obj).forEach(function (key) {\n var value = obj[key];\n\n if (typeof value === \"object\" && !isNull(value)) {\n _immutable(value, seen);\n }\n });\n }\n\n return obj;\n }\n\n function _keyToPair (key) {\n return [key, this[key]];\n }\n\n function _merge (getKeys) {\n return reduce(slice(arguments, 1), function (result, source) {\n forEach(getKeys(source), function (key) {\n result[key] = source[key];\n });\n\n return result;\n }, {});\n }\n\n var _pairsFrom = _curry(function (getKeys, obj) {\n return getKeys(obj).map(_keyToPair, obj);\n });\n\n var _tearFrom = _curry(function (getKeys, obj) {\n return getKeys(obj).reduce(function (result, key) {\n result[0].push(key);\n result[1].push(obj[key]);\n return result;\n }, [[], []]);\n });\n\n var _valuesFrom = _curry(function (getKeys, obj) {\n return getKeys(obj).map(partial(get, obj));\n });\n\n /**\n * Builds a checker function meant to be used with {@link module:lamb.validate|validate}.
\n * Note that the function accepts multiple keyPaths as a means to compare their values. In\n * other words all the received keyPaths will be passed as arguments to the predicate\n * to run the test.
\n * If you want to run the same single property check with multiple properties, you should build\n * multiple checkers and combine them with {@link module:lamb.validate|validate}.\n * @example\n * var user = {\n * name: \"John\",\n * surname: \"Doe\",\n * login: {\n * username: \"jdoe\",\n * password: \"abc123\",\n * passwordConfirm: \"abc123\"\n * }\n * };\n * var pwdMatch = _.checker(\n * _.is,\n * \"Passwords don't match\",\n * [\"login.password\", \"login.passwordConfirm\"]\n * );\n *\n * pwdMatch(user) // => []\n *\n * user.login.passwordConfirm = \"avc123\";\n *\n * pwdMatch(user) // => [\"Passwords don't match\", [\"login.password\", \"login.passwordConfirm\"]]\n *\n * @memberof module:lamb\n * @category Object\n * @param {Function} predicate - The predicate to test the object properties\n * @param {String} message - The error message\n * @param {String[]} keyPaths - The array of property names, or {@link module:lamb.getWithPath|paths}, to test.\n * @param {String} [pathSeparator=\".\"]\n * @returns {Array} An error in the form [\"message\", [\"propertyA\", \"propertyB\"]] or an empty array.\n */\n function checker (predicate, message, keyPaths, pathSeparator) {\n return function (obj) {\n var getValues = partial(getWithPath, obj, _, pathSeparator);\n return predicate.apply(obj, keyPaths.map(getValues)) ? [] : [message, keyPaths];\n };\n }\n\n /**\n * Creates an array with all the enumerable properties of the given object.\n * @example showing the difference with Object.keys\n * var baseFoo = Object.create({a: 1}, {b: {value: 2}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3},\n * d: {value: 4, enumerable: true}\n * });\n *\n * Object.keys(foo) // => [\"d\"]\n * _.enumerables(foo) // => [\"d\", \"a\"]\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @returns {String[]}\n */\n function enumerables (obj) {\n var keys = [];\n\n for (var key in obj) {\n keys.push(key);\n }\n\n return keys;\n }\n\n /**\n * Builds an object from a list of key / value pairs like the one\n * returned by [pairs]{@link module:lamb.pairs} or {@link module:lamb.ownPairs|ownPairs}.
\n * In case of duplicate keys the last key / value pair is used.\n * @example\n * _.fromPairs([[\"a\", 1], [\"b\", 2], [\"c\", 3]]) // => {\"a\": 1, \"b\": 2, \"c\": 3}\n * _.fromPairs([[\"a\", 1], [\"b\", 2], [\"a\", 3]]) // => {\"a\": 3, \"b\": 2}\n * _.fromPairs([[1], [void 0, 2], [null, 3]]) // => {\"1\": undefined, \"undefined\": 2, \"null\": 3}\n *\n * @memberof module:lamb\n * @category Object\n * @param {Array>} pairsList\n * @returns {Object}\n */\n function fromPairs (pairsList) {\n var result = {};\n\n pairsList.forEach(function (pair) {\n result[pair[0]] = pair[1];\n });\n\n return result;\n }\n\n /**\n * Returns the value of the object property with the given key.\n * @example\n * var user {name: \"John\"};\n *\n * _.get(user, \"name\") // => \"John\";\n * _.get(user, \"surname\") // => undefined\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @param {String} key\n * @returns {*}\n */\n function get (obj, key) {\n return obj[key];\n }\n\n /**\n * A curried version of {@link module:lamb.get|get}.
\n * Receives a property name and builds a function expecting the object from which we want to retrieve the property.\n * @example\n * var user1 = {name: \"john\"};\n * var user2 = {name: \"jane\"};\n * var getName = _.getKey(\"name\");\n *\n * getName(user1) // => \"john\"\n * getName(user2) // => \"jane\"\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {String} key\n * @returns {Function}\n */\n var getKey = _curry(get, 2, true);\n\n /**\n * Gets a nested property value from an object using the given path.
\n * The path is a string with property names separated by dots by default, but\n * it can be customised with the optional third parameter.\n * @example\n * var user = {\n * name: \"John\",\n * surname: \"Doe\",\n * login: {\n * \"user.name\": \"jdoe\",\n * password: \"abc123\"\n * }\n * };\n *\n * // same as _.get if no path is involved\n * _.getWithPath(user, \"name\") // => \"John\"\n *\n * _.getWithPath(user, \"login.password\") // => \"abc123\";\n * _.getWithPath(user, \"login/user.name\", \"/\") // => \"jdoe\"\n * _.getWithPath(user, \"name.foo\") // => undefined\n * _.getWithPath(user, \"name.foo.bar\") // => throws a TypeError\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object|ArrayLike} obj\n * @param {String} path\n * @param {String} [separator=\".\"]\n * @returns {*}\n */\n function getWithPath (obj, path, separator) {\n return path.split(separator || \".\").reduce(get, obj);\n }\n\n /**\n * Verifies the existence of a property in an object.\n * @example\n * var user1 = {name: \"john\"};\n *\n * _.has(user1, \"name\") // => true\n * _.has(user1, \"surname\") // => false\n * _.has(user1, \"toString\") // => true\n *\n * var user2 = Object.create(null);\n *\n * // not inherited through the prototype chain\n * _.has(user2, \"toString\") // => false\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @param {String} key\n * @returns {Boolean}\n */\n function has (obj, key) {\n return key in obj;\n }\n\n /**\n * Curried version of {@link module:lamb.has|has}.
\n * Returns a function expecting the object to check against the given key.\n * @example\n * var user1 = {name: \"john\"};\n * var user2 = {};\n * var hasName = _.hasKey(\"name\");\n *\n * hasName(user1) // => true\n * hasName(user2) // => false\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {String} key\n * @returns {Function}\n */\n var hasKey = _curry(has, 2, true);\n\n /**\n * Builds a function expecting an object to check against the given key / value pair.\n * @example\n * var hasTheCorrectAnswer = _.hasKeyValue(\"answer\", 42);\n *\n * hasTheCorrectAnswer({answer: 2}) // false\n * hasTheCorrectAnswer({answer: 42}) // true\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {String} key\n * @param {*} value\n * @returns {Function}\n */\n var hasKeyValue = function (key, value) {\n return compose(partial(is, value), getKey(key));\n };\n\n /**\n * Verifies if an object has the specified property and that the property isn't inherited through\n * the prototype chain.
\n * @example Comparison with has.\n * var user = {name: \"john\"};\n *\n * _.has(user, \"name\") // => true\n * _.has(user, \"surname\") // => false\n * _.has(user, \"toString\") // => true\n *\n * _.hasOwn(user, \"name\") // => true\n * _.hasOwn(user, \"surname\") // => false\n * _.hasOwn(user, \"toString\") // => false\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @param {String} key\n * @returns {Boolean}\n */\n var hasOwn = generic(_objectProto.hasOwnProperty);\n\n /**\n * Curried version of {@link module:lamb.hasOwn|hasOwn}.
\n * Returns a function expecting the object to check against the given key.\n * @example\n * var user = {name: \"john\"};\n * var hasOwnName = _.hasOwnKey(\"name\");\n * var hasOwnToString = _.hasOwnToString(\"toString\");\n *\n * hasOwnName(user) // => true\n * hasOwnToString(user) // => false\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {String} key\n * @returns {Function}\n */\n var hasOwnKey = _curry(hasOwn, 2, true);\n\n /**\n * Makes an object immutable by recursively calling [Object.freeze]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/freeze}\n * on its members.
\n * Any attempt to extend or modify the object can throw a TypeError or fail silently,\n * depending on the environment and the [strict mode]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Strict_mode} directive.\n * @example\n * var user = _.immutable({\n * name: \"John\",\n * surname: \"Doe\",\n * login: {\n * username: \"jdoe\",\n * password: \"abc123\"\n * },\n * luckyNumbers: [13, 17]\n * });\n *\n * // All of these statements will fail and possibly\n * // throw a TypeError (see the function description)\n * user.name = \"Joe\";\n * delete user.name;\n * user.newProperty = [];\n * user.login.password = \"foo\";\n * user.luckyNumbers.push(-13);\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @returns {Object}\n */\n function immutable (obj) {\n return _immutable(obj, []);\n }\n\n /**\n * Builds an object from the two given lists, using the first one as keys and the last one as values.
\n * If the list of keys is longer than the values one, the keys will be created with undefined values.
\n * If more values than keys are supplied, the extra values will be ignored.
\n * See also {@link module:lamb.tear|tear} and {@link module:lamb.tearOwn|tearOwn} for the reverse operation.\n * @example\n * _.make([\"a\", \"b\", \"c\"], [1, 2, 3]) // => {a: 1, b: 2, c: 3}\n * _.make([\"a\", \"b\", \"c\"], [1, 2]) // => {a: 1, b: 2, c: undefined}\n * _.make([\"a\", \"b\"], [1, 2, 3]) // => {a: 1, b: 2}\n * _.make([null, void 0, 2], [1, 2, 3]) // => {\"null\": 1, \"undefined\": 2, \"2\": 3}\n *\n * @memberof module:lamb\n * @category Object\n * @param {String[]} keys\n * @param {Array} values\n * @returns {Object}\n */\n function make (keys, values) {\n var result = {};\n var valuesLen = values.length;\n\n for (var i = 0, len = keys.length; i < len; i++) {\n result[keys[i]] = i < valuesLen ? values[i] : void 0;\n }\n\n return result;\n }\n\n /**\n * Merges the enumerable properties of the provided sources into a new object.
\n * In case of key homonymy each source has precedence over the previous one.
\n * See also {@link module:lamb.mergeOwn|mergeOwn} for merging only own properties of\n * the given sources.\n * @example\n * _.merge({a: 1}, {b: 3, c: 4}, {b: 5}) // => {a: 1, b: 5, c: 4}\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {...Object} source\n * @returns {Object}\n */\n var merge = partial(_merge, enumerables);\n\n /**\n * Same as {@link module:lamb.merge|merge}, but only the own properties of the sources are taken into account.\n * @example showing the difference with merge\n * var baseFoo = Object.create({a: 1}, {b: {value: 2, enumerable: true}, z: {value: 5}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3, enumerable: true}\n * });\n *\n * var bar = {d: 4};\n *\n * _.merge(foo, bar) // => {a: 1, b: 2, c: 3, d: 4}\n * _.mergeOwn(foo, bar) // => {c: 3, d: 4}\n *\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {...Object} source\n * @returns {Object}\n */\n var mergeOwn = partial(_merge, Object.keys);\n\n /**\n * Same as {@link module:lamb.pairs|pairs}, but only the own enumerable properties of the object are\n * taken into account.
\n * See also {@link module:lamb.fromPairs|fromPairs} for the reverse operation.\n * @example showing the difference with pairs\n * var baseFoo = Object.create({a: 1}, {b: {value: 2, enumerable: true}, z: {value: 5}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3, enumerable: true}\n * });\n *\n * _.pairs(foo) // => [[\"c\", 3], [\"b\", 2], [\"a\", 1]]\n * _.ownPairs(foo) // => [[\"c\", 3]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array>}\n */\n var ownPairs = _pairsFrom(Object.keys);\n\n /**\n * Same as {@link module:lamb.values|values}, but only the own enumerable properties of the object are\n * taken into account.
\n * @example showing the difference with values\n * var baseFoo = Object.create({a: 1}, {b: {value: 2, enumerable: true}, z: {value: 5}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3, enumerable: true}\n * });\n *\n * _.values(foo) // => [3, 2, 1]\n * _.ownValues(foo) // => [3]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array}\n */\n var ownValues = _valuesFrom(Object.keys);\n\n /**\n * Converts an object into an array of key / value pairs of its enumerable properties.
\n * See also {@link module:lamb.ownPairs|ownPairs} for picking only the own enumerable\n * properties and {@link module:lamb.fromPairs|fromPairs} for the reverse operation.\n * @example\n * _.pairs({a: 1, b: 2, c: 3}) // => [[\"a\", 1], [\"b\", 2], [\"c\", 3]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array>}\n */\n var pairs = _pairsFrom(enumerables);\n\n /**\n * Returns an object containing only the specified properties of the given object.
\n * Non existent properties will be ignored.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n *\n * _.pick(user, [\"name\", \"age\"]) // => {\"name\": \"john\", \"age\": 30};\n * _.pick(user, [\"name\", \"email\"]) // => {\"name\": \"john\"}\n *\n * @memberof module:lamb\n * @category Object\n * @see {@link module:lamb.pickIf|pickIf}\n * @param {Object} source\n * @param {String[]} whitelist\n * @returns {Object}\n */\n function pick (source, whitelist) {\n var result = {};\n\n whitelist.forEach(function (key) {\n if (key in source) {\n result[key] = source[key];\n }\n });\n\n return result;\n }\n\n /**\n * Builds a function expecting an object whose properties will be checked against the given predicate.
\n * The properties satisfying the predicate will be included in the resulting object.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n * var pickIfIsString = _.pickIf(_.isType(\"String\"));\n *\n * pickIfIsString(user) // => {name: \"john\", surname: \"doe\"}\n *\n * @memberof module:lamb\n * @category Object\n * @see {@link module:lamb.pick|pick}\n * @param {ObjectIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function pickIf (predicate, predicateContext) {\n return function (source) {\n var result = {};\n\n for (var key in source) {\n if (predicate.call(predicateContext, source[key], key, source)) {\n result[key] = source[key];\n }\n }\n\n return result;\n };\n }\n\n /**\n * Returns a copy of the source object without the specified properties.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n *\n * _.skip(user, [\"name\", \"age\"]) // => {surname: \"doe\"};\n * _.skip(user, [\"name\", \"email\"]) // => {surname: \"doe\", age: 30};\n *\n * @memberof module:lamb\n * @category Object\n * @see {@link module:lamb.skipIf|skipIf}\n * @param {Object} source\n * @param {String[]} blacklist\n * @returns {Object}\n */\n function skip (source, blacklist) {\n var result = {};\n\n for (var key in source) {\n if (blacklist.indexOf(key) === -1) {\n result[key] = source[key];\n }\n }\n\n return result;\n }\n\n /**\n * Builds a function expecting an object whose properties will be checked against the given predicate.
\n * The properties satisfying the predicate will be omitted in the resulting object.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n * var skipIfIstring = _.skipIf(_.isType(\"String\"));\n *\n * skipIfIstring(user) // => {age: 30}\n *\n * @memberof module:lamb\n * @category Object\n * @see {@link module:lamb.skip|skip}\n * @param {ObjectIteratorCallback} predicate\n * @param {Object} [predicateContext]\n * @returns {Function}\n */\n function skipIf (predicate, predicateContext) {\n return pickIf(not(predicate), predicateContext);\n }\n\n /**\n * Tears an object apart by transforming it in an array of two lists: one containing its enumerable keys,\n * the other containing the corresponding values.
\n * Although this \"tearing apart\" may sound as a rather violent process, the source object will be unharmed.
\n * See also {@link module:lamb.tearOwn|tearOwn} for picking only the own enumerable properties and\n * {@link module:lamb.make|make} for the reverse operation.\n * @example\n * _.tear({a: 1, b: 2, c: 3}) // => [[\"a\", \"b\", \"c\"], [1, 2, 3]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array, Array<*>>}\n */\n var tear = _tearFrom(enumerables);\n\n /**\n * Same as {@link module:lamb.tear|tear}, but only the own properties of the object are taken into account.
\n * See also {@link module:lamb.make|make} for the reverse operation.\n * @example showing the difference with tear\n * var baseFoo = Object.create({a: 1}, {b: {value: 2, enumerable: true}, z: {value: 5}});\n * var foo = Object.create(baseFoo, {\n * c: {value: 3, enumerable: true}\n * });\n *\n * _.tear(foo) // => [[\"c\", \"b\", \"a\"], [3, 2, 1]]\n * _.tearOwn(foo) // => [[\"c\"], [3]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array, Array<*>>}\n */\n var tearOwn = _tearFrom(Object.keys);\n\n /**\n * Validates an object with the given list of {@link module:lamb.checker|checker} functions.\n * @example\n * var hasContent = function (s) { return s.trim().length > 0; };\n * var isAdult = function (age) { return age >= 18; };\n * var userCheckers = [\n * _.checker(hasContent, \"Name is required\", [\"name\"]),\n * _.checker(hasContent, \"Surname is required\", [\"surname\"]),\n * _.checker(isAdult, \"Must be at least 18 years old\", [\"age\"])\n * ];\n *\n * var user1 = {name: \"john\", surname: \"doe\", age: 30};\n * var user2 = {name: \"jane\", surname: \"\", age: 15};\n *\n * _.validate(user1, userCheckers) // => []\n * _.validate(user2, userCheckers) // => [[\"Surname is required\", [\"surname\"]], [\"Must be at least 18 years old\", [\"age\"]]]\n *\n * @memberof module:lamb\n * @category Object\n * @param {Object} obj\n * @param {Function[]} checkers\n * @returns {Array>} An array of errors in the form returned by {@link module:lamb.checker|checker}, or an empty array.\n */\n function validate (obj, checkers) {\n return checkers.reduce(function (errors, checker) {\n var result = checker(obj);\n result.length && errors.push(result);\n return errors;\n }, []);\n }\n\n /**\n * A curried version of {@link module:lamb.validate|validate} accepting a list of {@link module:lamb.checker|checkers} and\n * returning a function expecting the object to validate.\n * @example\n * var hasContent = function (s) { return s.trim().length > 0; };\n * var isAdult = function (age) { return age >= 18; };\n * var userCheckers = [\n * _.checker(hasContent, \"Name is required\", [\"name\"]),\n * _.checker(hasContent, \"Surname is required\", [\"surname\"]),\n * _.checker(isAdult, \"Must be at least 18 years old\", [\"age\"])\n * ];\n * var validateUser = _.validateWith(userCheckers);\n *\n * var user1 = {name: \"john\", surname: \"doe\", age: 30};\n * var user2 = {name: \"jane\", surname: \"\", age: 15};\n *\n * validateUser(user1) // => []\n * validateUser(user2) // => [[\"Surname is required\", [\"surname\"]], [\"Must be at least 18 years old\", [\"age\"]]]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Function[]} checkers\n * @returns {Function}\n */\n var validateWith = _curry(validate, 2, true);\n\n /**\n * Generates an array with the values of the enumerable properties of the given object.
\n * See also {@link module:lamb.ownValues|ownValues} for picking only the own properties of the object.\n * @example\n * var user = {name: \"john\", surname: \"doe\", age: 30};\n *\n * _.values(user) // => [\"john\", \"doe\", 30]\n *\n * @memberof module:lamb\n * @category Object\n * @function\n * @param {Object} obj\n * @returns {Array}\n */\n var values = _valuesFrom(enumerables);\n\n lamb.checker = checker;\n lamb.enumerables = enumerables;\n lamb.fromPairs = fromPairs;\n lamb.get = get;\n lamb.getKey = getKey;\n lamb.getWithPath = getWithPath;\n lamb.has = has;\n lamb.hasKey = hasKey;\n lamb.hasKeyValue = hasKeyValue;\n lamb.hasOwn = hasOwn;\n lamb.hasOwnKey = hasOwnKey;\n lamb.immutable = immutable;\n lamb.make = make;\n lamb.merge = merge;\n lamb.mergeOwn = mergeOwn;\n lamb.ownPairs = ownPairs;\n lamb.ownValues = ownValues;\n lamb.pairs = pairs;\n lamb.pick = pick;\n lamb.pickIf = pickIf;\n lamb.skip = skip;\n lamb.skipIf = skipIf;\n lamb.tear = tear;\n lamb.tearOwn = tearOwn;\n lamb.validate = validate;\n lamb.validateWith = validateWith;\n lamb.values = values;\n\n\n function _getPadding (source, char, len) {\n return repeat(char[0] || \" \", Math.ceil(len - source.length));\n }\n\n /**\n * Pads a string to the desired length with the given char starting from the beginning of the string.\n * @example\n * _.padLeft(\"foo\", \"-\", 0) // => \"foo\"\n * _.padLeft(\"foo\", \"-\", -1) // => \"foo\"\n * _.padLeft(\"foo\", \"-\", 5) // => \"--foo\"\n * _.padLeft(\"foo\", \"-\", 3) // => \"foo\"\n * _.padLeft(\"foo\", \"ab\", 7) // => \"aaaafoo\"\n * _.padLeft(\"foo\", \"\", 5) // => \" foo\"\n * _.padLeft(\"\", \"-\", 5) // => \"-----\"\n *\n * @memberof module:lamb\n * @category String\n * @param {String} source\n * @param {String} [char=\" \"] - The padding char. If a string is passed only the first char is used.\n * @param {Number} len\n * @returns {String}\n */\n function padLeft (source, char, len) {\n return _getPadding(source, char, len) + source;\n }\n\n /**\n * Pads a string to the desired length with the given char starting from the end of the string.\n * @example\n * _.padRight(\"foo\", \"-\", 0) // => \"foo\"\n * _.padRight(\"foo\", \"-\", -1) // => \"foo\"\n * _.padRight(\"foo\", \"-\", 5) // => \"foo--\"\n * _.padRight(\"foo\", \"-\", 3) // => \"foo\"\n * _.padRight(\"foo\", \"ab\", 7) // => \"fooaaaa\"\n * _.padRight(\"foo\", \"\", 5) // => \"foo \"\n * _.padRight(\"\", \"-\", 5) // => \"-----\"\n *\n * @memberof module:lamb\n * @category String\n * @param {String} source\n * @param {String} [char=\" \"] - The padding char. If a string is passed only the first char is used.\n * @param {Number} len\n * @returns {String}\n */\n function padRight (source, char, len) {\n return source + _getPadding(source, char, len);\n }\n\n /**\n * Builds a new string by repeating the source string the desired amount of times.
\n * Note that unlike the current ES6 proposal for [String.prototype.repeat]{@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/repeat},\n * this function doesn't throw a RangeError if count is negative, but returns an empty string instead.\n * @example\n * _.repeat(\"Hello\", -1) // => \"\"\n * _.repeat(\"Hello\", 1) // => \"Hello\"\n * _.repeat(\"Hello\", 3) // => \"HelloHelloHello\"\n *\n * @memberof module:lamb\n * @category String\n * @param {String} source\n * @param {Number} count\n * @returns {String}\n */\n function repeat (source, count) {\n var result = \"\";\n\n for (var i = 0; i < count; i++) {\n result += source;\n }\n\n return result;\n }\n\n /**\n * Builds a predicate expecting a string to test against the given regular expression pattern.\n * @example\n * var hasNumbersOnly = _.testWith(/^\\d+$/);\n *\n * hasNumbersOnly(\"123\") // => true\n * hasNumbersOnly(\"123 Kg\") // => false\n *\n * @memberof module:lamb\n * @category String\n * @param {RegExp} pattern\n * @returns {Function}\n */\n function testWith (pattern) {\n return _reProto.test.bind(pattern);\n }\n\n lamb.padLeft = padLeft;\n lamb.padRight = padRight;\n lamb.repeat = repeat;\n lamb.testWith = testWith;\n\n\n /**\n * Verifies if a value is null or undefined.\n * @example\n * _.isNil(NaN) // => false\n * _.isNil({}) // => false\n * _.isNil(null) // => true\n * _.isNil(void 0) // => true\n * _.isNil() // => true\n *\n * @memberof module:lamb\n * @category Type\n * @function\n * @param {*} value\n * @returns {Boolean}\n */\n var isNil = anyOf(isNull, isUndefined);\n\n /**\n * Verifies if a value is null.\n * @example\n * _.isNull(null) // => true\n * _.isNull(void 0) // => false\n * _.isNull(false) // => false\n *\n * @memberof module:lamb\n * @category Type\n * @param {*} value\n * @returns {Boolean}\n */\n function isNull (value) {\n return value === null;\n }\n\n /**\n * Builds a predicate that expects a value to check against the specified type.\n * @example\n * var isString = _.isType(\"String\");\n *\n * isString(\"Hello\") // => true\n * isString(new String(\"Hi\")) // => true\n *\n * @memberof module:lamb\n * @category Type\n * @param {String} typeTag\n * @returns {Function}\n */\n function isType (typeName) {\n return function (value) {\n return type(value) === typeName;\n };\n }\n\n /**\n * Verifies if a value is undefined.\n * @example\n * _.isUndefined(null) // => false\n * _.isUndefined(void 0) // => true\n * _.isUndefined(false) // => false\n *\n * @memberof module:lamb\n * @category Type\n * @param {*} value\n * @returns {Boolean}\n */\n function isUndefined (value) {\n // using void because undefined could be theoretically shadowed\n return value === void 0;\n }\n\n /**\n * Retrieves the \"type tag\" from the given value.\n * @example\n * var x = 5;\n * var y = new Number(5);\n *\n * typeof x // => \"number\"\n * typeof y // => \"object\"\n * _.type(x) // => \"Number\"\n * _.type(y) // => \"Number\"\n *\n * _.type(Object.prototype.toString) // => \"Function\"\n * _.type(/a/) // => \"RegExp\"\n *\n * @memberof module:lamb\n * @category Type\n * @param {*} value\n * @returns {String}\n */\n function type (value) {\n return _objectProto.toString.call(value).replace(/^\\[\\w+\\s+|\\]$/g, \"\");\n }\n\n lamb.isNil = isNil;\n lamb.isNull = isNull;\n lamb.isType = isType;\n lamb.isUndefined = isUndefined;\n lamb.type = type;\n\n /* istanbul ignore next */\n if (typeof exports === \"object\") {\n module.exports = lamb;\n } else if (typeof define === \"function\" && define.amd) {\n define(function() { return lamb; });\n } else {\n host.lamb = lamb;\n }\n}(this);\n\n/**\n * @callback AccumulatorCallback\n * @global\n * @param {*} previousValue The value returned it the last execution of the accumulator or, in the first iteration, the {@link module:lamb.reduce|initialValue} if supplied.\n * @param {*} currentValue The value being processed in the current iteration.\n * @param {Number} idx - The index of the element being processed.\n * @param {ArrayLike} arrayLike - The list being traversed.\n */\n\n/**\n * The built-in arguments object.\n * @typedef {arguments} arguments\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/arguments|arguments} in Mozilla documentation.\n */\n\n/**\n * The built-in Array object.\n * @typedef {Array} Array\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array|Array} in Mozilla documentation.\n */\n\n/**\n * Any array-like object.\n * @typedef {Array|String|arguments|?} ArrayLike\n * @global\n */\n\n/**\n * The built-in Boolean object.\n * @typedef {Boolean} Boolean\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Boolean|Boolean} in Mozilla documentation.\n */\n\n/**\n * The built-in Date object.\n * @typedef {Date} Date\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Date|Date} in Mozilla documentation.\n */\n\n/**\n * The built-in Function object.\n * @typedef {Function} function\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Function|Function} and\n * {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions|Functions} in Mozilla documentation.\n */\n\n/**\n * @callback ListIteratorCallback\n * @global\n * @param {*} element - The element being evaluated.\n * @param {Number} idx - The index of the element within the list.\n * @param {ArrayLike} arrayLike - The list being traversed.\n */\n\n/**\n * The built-in Number object.\n * @typedef {Number} Number\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Number|Number} in Mozilla documentation.\n */\n\n/**\n * The built-in Object object.\n * @typedef {Object} Object\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object|Object} in Mozilla documentation.\n */\n\n/**\n * @callback ObjectIteratorCallback\n * @global\n * @param {*} value - The value of the current property.\n * @param {String} key - The property name.\n * @param {Object} source - The object being traversed.\n */\n\n/**\n * The built-in RegExp object.\n * @typedef {RegExp} RegExp\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/RegExp|RegExp} in Mozilla documentation.\n */\n\n/**\n * Represent a sorting criteria used by {@link module:lamb.insert|insert}, {@link module:lamb.sort|sort} and {@link module:lamb.sortWith|sortWith},\n * and it's usually built using {@link module:lamb.sorter|sorter} and {@link module:lamb.sorterDesc|sorterDesc}.\n * @typedef {Sorter} Sorter\n * @global\n * @property {Boolean} isDescending\n * @property {Function} compare\n */\n\n/**\n * The built-in String object.\n * @typedef {String} String\n * @global\n * @see {@link https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String|String} in Mozilla documentation.\n */\n"],"sourceRoot":"/source/"}
\ No newline at end of file
diff --git a/package.json b/package.json
index cce3d46..d0fd424 100644
--- a/package.json
+++ b/package.json
@@ -31,7 +31,7 @@
"coveralls": "gulp coverage && cat ./coverage/lcov.info | ./node_modules/coveralls/bin/coveralls.js && rm -rf ./coverage"
},
"tonicExample": "var _ = require('lamb');",
- "version": "0.16.0",
+ "version": "0.17.0",
"devDependencies": {
"coveralls": "^2.11.8",
"gulp": "^3.9.1",