rubico 2.6.0 → 2.6.2

package/dist/tryCatch.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -52,11 +52,23 @@ const catcherApply = function (catcher, err, args) {
   return catcher(err, ...args)
 }
 
+const isArray = Array.isArray
+
 const areAnyValuesPromises = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    const value = values[index]
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }

package/dist/tryCatch.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.tryCatch=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Promise.all.bind(Promise),o=Symbol.for("placeholder"),e=function(n,t,e,r){return t==o?((n,t,o)=>function(e){return n(e,t,o)})(n,e,r):e==o?((n,t,o)=>function(e){return n(t,e,o)})(n,t,r):((n,t,o)=>function(e){return n(t,o,e)})(n,t,e)},r=function(n,t,o){return n(t,...o)},u=function(t,u,c){try{const i=t(...c);return n(i)?i.catch(e(r,u,o,c)):i}catch(n){return u(n,...c)}};return function(...r){if(r.length>2){const c=r.pop(),i=r.pop();return function(t){const o=t.length;let e=-1;for(;++e<o;){const o=t[e];if(n(o))return!0}return!1}(r)?t(r).then(e(u,i,c,o)):u(i,c,r)}const c=r[0],i=r[1];return function(...n){return u(c,i,n)}}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.tryCatch=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>null!=n&&"function"==typeof n.then,t=Promise.all.bind(Promise),r=Symbol.for("placeholder"),o=function(n,t,o,e){return t==r?((n,t,r)=>function(o){return n(o,t,r)})(n,o,e):o==r?((n,t,r)=>function(o){return n(t,o,r)})(n,t,e):((n,t,r)=>function(o){return n(t,r,o)})(n,t,o)},e=function(n,t,r){return n(t,...r)},u=Array.isArray,c=function(t,u,c){try{const i=t(...c);return n(i)?i.catch(o(e,u,r,c)):i}catch(n){return u(n,...c)}};return function(...e){if(e.length>2){const i=e.pop(),f=e.pop();return function(t){if(u(t)){const r=t.length;let o=-1;for(;++o<r;){const r=t[o];if(n(r))return!0}return!1}for(const r in t){const o=t[r];if(n(o))return!0}return!1}(e)?t(e).then(o(c,f,i,r)):c(f,i,e)}const i=e[0],f=e[1];return function(...n){return c(i,f,n)}}}());

package/dist/tryCatch.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -46,11 +46,23 @@ const catcherApply = function (catcher, err, args) {
   return catcher(err, ...args)
 }
 
+const isArray = Array.isArray
+
 const areAnyValuesPromises = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    const value = values[index]
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }

package/dist/x/append.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/append.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/append.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/append.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/append.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/callProp.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/callProp.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/callProp.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/callProp.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/callProp.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/defaultsDeep.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/defaultsDeep.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/defaultsDeep.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/defaultsDeep.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/defaultsDeep.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/differenceWith.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/differenceWith.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/differenceWith.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/differenceWith.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/differenceWith.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/filterOut.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -319,10 +319,20 @@ const filter = function (arg0, arg1) {
 }
 
 const areAnyValuesPromises = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    const value = values[index]
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }

package/dist/x/filterOut.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const __=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(n){return r(n,t)},curry2ResolveArg1=(r,t)=>function(n){return r(t,n)},curry2=function(r,t,n){return t==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,t)},symbolIterator=Symbol.iterator,FilteringIterator=(r,t)=>({[symbolIterator](){return this},next(){let n=r.next();for(;!n.done;){const{value:e}=n;if(t(e))return{value:e,done:!1};n=r.next()}return n}}),isPromise=r=>null!=r&&"function"==typeof r.then,symbolAsyncIterator=Symbol.asyncIterator,FilteringAsyncIterator=(r,t)=>({isAsyncIteratorDone:!1,[symbolAsyncIterator](){return this},async next(){for(;!this.isAsyncIteratorDone;){const{value:n,done:e}=await r.next();if(e)this.isAsyncIteratorDone=!0;else{const r=t(n);if(isPromise(r)?await r:r)return{value:n,done:!1}}}return{value:void 0,done:!0}}}),isArray=Array.isArray,curry4ResolveArg0=(r,t,n,e)=>function(o){return r(o,t,n,e)},curry4ResolveArg1=(r,t,n,e)=>function(o){return r(t,o,n,e)},curry4ResolveArg2=(r,t,n,e)=>function(o){return r(t,n,o,e)},curry4ResolveArg3=(r,t,n,e)=>function(o){return r(t,n,e,o)},curry4=function(r,t,n,e,o){return t==__?curry4ResolveArg0(r,n,e,o):n==__?curry4ResolveArg1(r,t,e,o):e==__?curry4ResolveArg2(r,t,n,o):curry4ResolveArg3(r,t,n,e)},promiseAll=Promise.all.bind(Promise),arrayExtendMap=function(r,t,n,e){const o=t.length;let i=r.length-1;for(;++e<o;)r[++i]=n(t[e],e,r);return r},arrayFilterByConditions=function(r,t,n,e){const o=r.length;let i=-1;for(;++n<o;)e[++i]&&t.push(r[n]);return t},arrayFilter=function(r,t){const n=r.length,e=[];let o=-1,i=-1;for(;++o<n;){const n=r[o],s=t(n,o,r);if(isPromise(s))return promiseAll(arrayExtendMap([s],r,t,o)).then(curry4(arrayFilterByConditions,r,e,o-1,__));s&&(e[++i]=n)}return e},curry3ResolveArg0=(r,t,n)=>function(e){return r(e,t,n)},curry3ResolveArg1=(r,t,n)=>function(e){return r(t,e,n)},curry3ResolveArg2=(r,t,n)=>function(e){return r(t,n,e)},curry3=function(r,t,n,e){return t==__?curry3ResolveArg0(r,n,e):n==__?curry3ResolveArg1(r,t,e):curry3ResolveArg2(r,t,n)},callPropUnary=(r,t,n)=>r[t](n),stringFilter=function(r,t){const n=arrayFilter(r,t);return isPromise(n)?n.then(curry3(callPropUnary,__,"join","")):n.join("")},always=r=>function(){return r},thunkConditional=(r,t,n)=>r?t():n(),thunkify1=(r,t)=>function(){return r(t)},noop=function(){},setFilter=function(r,t){const n=new Set,e=n.add.bind(n),o=[];for(const i of r){const s=t(i,i,r);isPromise(s)?o.push(s.then(curry3(thunkConditional,__,thunkify1(e,i),noop))):s&&n.add(i)}return 0==o.length?n:promiseAll(o).then(always(n))},thunkify4=(r,t,n,e,o)=>function(){return r(t,n,e,o)},callPropBinary=(r,t,n,e)=>r[t](n,e),mapFilter=function(r,t){const n=new Map,e=[];for(const[o,i]of r){const s=t(i,o,r);isPromise(s)?e.push(s.then(curry3(thunkConditional,__,thunkify4(callPropBinary,n,"set",o,i),noop))):s&&n.set(o,i)}return 0==e.length?n:promiseAll(e).then(always(n))},objectSetIf=function(r,t,n,e){e&&(r[t]=n)},objectFilter=function(r,t){const n={},e=[];for(const o in r){const i=r[o],s=t(i,o,r);isPromise(s)?e.push(s.then(curry4(objectSetIf,n,o,r[o],__))):s&&(n[o]=i)}return 0==e.length?n:promiseAll(e).then(always(n))},_filter=function(r,t){return isArray(r)?arrayFilter(r,t):null==r?r:"string"==typeof r||r.constructor==String?stringFilter(r,t):r.constructor==Set?setFilter(r,t):r.constructor==Map?mapFilter(r,t):"function"==typeof r.filter?r.filter(t):"function"==typeof r[symbolIterator]?FilteringIterator(r[symbolIterator](),t):"function"==typeof r[symbolAsyncIterator]?FilteringAsyncIterator(r[symbolAsyncIterator](),t):r.constructor==Object?objectFilter(r,t):r},filter=function(r,t){return"function"==typeof r?curry2(_filter,__,r):_filter(r,t)},areAnyValuesPromises=function(r){const t=r.length;let n=-1;for(;++n<t;){const t=r[n];if(isPromise(t))return!0}return!1},curryArgs2ResolveArgs0=(r,t,n)=>function(...n){return r(n,t)},curryArgs2ResolveArgs1=(r,t,n)=>function(...n){return r(t,n)},curryArgs2=function(r,t,n){return t==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,t)},negate=r=>!r,_not=function(r,t){const n=t(...r);return isPromise(n)?n.then(negate):!n},not=function(...r){const t=r.pop();return"function"==typeof t?0==r.length?curryArgs2(_not,__,t):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_not,__,t)):_not(r,t):!t},filterOut=r=>filter(not(r));export default filterOut;
+const __=Symbol.for("placeholder"),curry2ResolveArg0=(r,t)=>function(n){return r(n,t)},curry2ResolveArg1=(r,t)=>function(n){return r(t,n)},curry2=function(r,t,n){return t==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,t)},symbolIterator=Symbol.iterator,FilteringIterator=(r,t)=>({[symbolIterator](){return this},next(){let n=r.next();for(;!n.done;){const{value:e}=n;if(t(e))return{value:e,done:!1};n=r.next()}return n}}),isPromise=r=>null!=r&&"function"==typeof r.then,symbolAsyncIterator=Symbol.asyncIterator,FilteringAsyncIterator=(r,t)=>({isAsyncIteratorDone:!1,[symbolAsyncIterator](){return this},async next(){for(;!this.isAsyncIteratorDone;){const{value:n,done:e}=await r.next();if(e)this.isAsyncIteratorDone=!0;else{const r=t(n);if(isPromise(r)?await r:r)return{value:n,done:!1}}}return{value:void 0,done:!0}}}),isArray=Array.isArray,curry4ResolveArg0=(r,t,n,e)=>function(o){return r(o,t,n,e)},curry4ResolveArg1=(r,t,n,e)=>function(o){return r(t,o,n,e)},curry4ResolveArg2=(r,t,n,e)=>function(o){return r(t,n,o,e)},curry4ResolveArg3=(r,t,n,e)=>function(o){return r(t,n,e,o)},curry4=function(r,t,n,e,o){return t==__?curry4ResolveArg0(r,n,e,o):n==__?curry4ResolveArg1(r,t,e,o):e==__?curry4ResolveArg2(r,t,n,o):curry4ResolveArg3(r,t,n,e)},promiseAll=Promise.all.bind(Promise),arrayExtendMap=function(r,t,n,e){const o=t.length;let i=r.length-1;for(;++e<o;)r[++i]=n(t[e],e,r);return r},arrayFilterByConditions=function(r,t,n,e){const o=r.length;let i=-1;for(;++n<o;)e[++i]&&t.push(r[n]);return t},arrayFilter=function(r,t){const n=r.length,e=[];let o=-1,i=-1;for(;++o<n;){const n=r[o],s=t(n,o,r);if(isPromise(s))return promiseAll(arrayExtendMap([s],r,t,o)).then(curry4(arrayFilterByConditions,r,e,o-1,__));s&&(e[++i]=n)}return e},curry3ResolveArg0=(r,t,n)=>function(e){return r(e,t,n)},curry3ResolveArg1=(r,t,n)=>function(e){return r(t,e,n)},curry3ResolveArg2=(r,t,n)=>function(e){return r(t,n,e)},curry3=function(r,t,n,e){return t==__?curry3ResolveArg0(r,n,e):n==__?curry3ResolveArg1(r,t,e):curry3ResolveArg2(r,t,n)},callPropUnary=(r,t,n)=>r[t](n),stringFilter=function(r,t){const n=arrayFilter(r,t);return isPromise(n)?n.then(curry3(callPropUnary,__,"join","")):n.join("")},always=r=>function(){return r},thunkConditional=(r,t,n)=>r?t():n(),thunkify1=(r,t)=>function(){return r(t)},noop=function(){},setFilter=function(r,t){const n=new Set,e=n.add.bind(n),o=[];for(const i of r){const s=t(i,i,r);isPromise(s)?o.push(s.then(curry3(thunkConditional,__,thunkify1(e,i),noop))):s&&n.add(i)}return 0==o.length?n:promiseAll(o).then(always(n))},thunkify4=(r,t,n,e,o)=>function(){return r(t,n,e,o)},callPropBinary=(r,t,n,e)=>r[t](n,e),mapFilter=function(r,t){const n=new Map,e=[];for(const[o,i]of r){const s=t(i,o,r);isPromise(s)?e.push(s.then(curry3(thunkConditional,__,thunkify4(callPropBinary,n,"set",o,i),noop))):s&&n.set(o,i)}return 0==e.length?n:promiseAll(e).then(always(n))},objectSetIf=function(r,t,n,e){e&&(r[t]=n)},objectFilter=function(r,t){const n={},e=[];for(const o in r){const i=r[o],s=t(i,o,r);isPromise(s)?e.push(s.then(curry4(objectSetIf,n,o,r[o],__))):s&&(n[o]=i)}return 0==e.length?n:promiseAll(e).then(always(n))},_filter=function(r,t){return isArray(r)?arrayFilter(r,t):null==r?r:"string"==typeof r||r.constructor==String?stringFilter(r,t):r.constructor==Set?setFilter(r,t):r.constructor==Map?mapFilter(r,t):"function"==typeof r.filter?r.filter(t):"function"==typeof r[symbolIterator]?FilteringIterator(r[symbolIterator](),t):"function"==typeof r[symbolAsyncIterator]?FilteringAsyncIterator(r[symbolAsyncIterator](),t):r.constructor==Object?objectFilter(r,t):r},filter=function(r,t){return"function"==typeof r?curry2(_filter,__,r):_filter(r,t)},areAnyValuesPromises=function(r){if(isArray(r)){const t=r.length;let n=-1;for(;++n<t;){const t=r[n];if(isPromise(t))return!0}return!1}for(const t in r){const n=r[t];if(isPromise(n))return!0}return!1},curryArgs2ResolveArgs0=(r,t,n)=>function(...n){return r(n,t)},curryArgs2ResolveArgs1=(r,t,n)=>function(...n){return r(t,n)},curryArgs2=function(r,t,n){return t==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,t)},negate=r=>!r,_not=function(r,t){const n=t(...r);return isPromise(n)?n.then(negate):!n},not=function(...r){const t=r.pop();return"function"==typeof t?0==r.length?curryArgs2(_not,__,t):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_not,__,t)):_not(r,t):!t},filterOut=r=>filter(not(r));export default filterOut;

package/dist/x/filterOut.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -325,10 +325,20 @@ const filter = function (arg0, arg1) {
 }
 
 const areAnyValuesPromises = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    const value = values[index]
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }

package/dist/x/filterOut.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.filterOut=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=function(t,e,o){return e==n?((n,t)=>function(e){return n(e,t)})(t,o):((n,t)=>function(e){return n(t,e)})(t,e)},e=Symbol.iterator,o=(n,t)=>({[e](){return this},next(){let e=n.next();for(;!e.done;){const{value:o}=e;if(t(o))return{value:o,done:!1};e=n.next()}return e}}),r=n=>null!=n&&"function"==typeof n.then,u=Symbol.asyncIterator,c=(n,t)=>({isAsyncIteratorDone:!1,[u](){return this},async next(){for(;!this.isAsyncIteratorDone;){const{value:e,done:o}=await n.next();if(o)this.isAsyncIteratorDone=!0;else{const n=t(e);if(r(n)?await n:n)return{value:e,done:!1}}}return{value:void 0,done:!0}}}),i=Array.isArray,f=function(t,e,o,r,u){return e==n?((n,t,e,o)=>function(r){return n(r,t,e,o)})(t,o,r,u):o==n?((n,t,e,o)=>function(r){return n(t,r,e,o)})(t,e,r,u):r==n?((n,t,e,o)=>function(r){return n(t,e,r,o)})(t,e,o,u):((n,t,e,o)=>function(r){return n(t,e,o,r)})(t,e,o,r)},s=Promise.all.bind(Promise),l=function(n,t,e,o){const r=t.length;let u=n.length-1;for(;++o<r;)n[++u]=e(t[o],o,n);return n},h=function(n,t,e,o){const r=n.length;let u=-1;for(;++e<r;)o[++u]&&t.push(n[e]);return t},a=function(t,e){const o=t.length,u=[];let c=-1,i=-1;for(;++c<o;){const o=t[c],a=e(o,c,t);if(r(a))return s(l([a],t,e,c)).then(f(h,t,u,c-1,n));a&&(u[++i]=o)}return u},p=function(t,e,o,r){return e==n?((n,t,e)=>function(o){return n(o,t,e)})(t,o,r):o==n?((n,t,e)=>function(o){return n(t,o,e)})(t,e,r):((n,t,e)=>function(o){return n(t,e,o)})(t,e,o)},y=(n,t,e)=>n[t](e),d=n=>function(){return n},g=(n,t,e)=>n?t():e(),b=(n,t)=>function(){return n(t)},v=function(){},m=(n,t,e,o,r)=>function(){return n(t,e,o,r)},x=(n,t,e,o)=>n[t](e,o),S=function(n,t,e,o){o&&(n[t]=e)},j=function(t,l){return i(t)?a(t,l):null==t?t:"string"==typeof t||t.constructor==String?function(t,e){const o=a(t,e);return r(o)?o.then(p(y,n,"join","")):o.join("")}(t,l):t.constructor==Set?function(t,e){const o=new Set,u=o.add.bind(o),c=[];for(const i of t){const f=e(i,i,t);r(f)?c.push(f.then(p(g,n,b(u,i),v))):f&&o.add(i)}return 0==c.length?o:s(c).then(d(o))}(t,l):t.constructor==Map?function(t,e){const o=new Map,u=[];for(const[c,i]of t){const f=e(i,c,t);r(f)?u.push(f.then(p(g,n,m(x,o,"set",c,i),v))):f&&o.set(c,i)}return 0==u.length?o:s(u).then(d(o))}(t,l):"function"==typeof t.filter?t.filter(l):"function"==typeof t[e]?o(t[e](),l):"function"==typeof t[u]?c(t[u](),l):t.constructor==Object?function(t,e){const o={},u=[];for(const c in t){const i=t[c],s=e(i,c,t);r(s)?u.push(s.then(f(S,o,c,t[c],n))):s&&(o[c]=i)}return 0==u.length?o:s(u).then(d(o))}(t,l):t},A=n=>!n,w=function(n,t){const e=t(...n);return r(e)?e.then(A):!e},I=function(...e){const o=e.pop();return"function"==typeof o?0==e.length?(u=w,i=o,(c=n)==n?((n,t)=>function(...e){return n(e,t)})(u,i):((n,t)=>function(...e){return n(t,e)})(u,c)):function(n){const t=n.length;let e=-1;for(;++e<t;){const t=n[e];if(r(t))return!0}return!1}(e)?s(e).then(t(w,n,o)):w(e,o):!o;var u,c,i};return e=>{return"function"==typeof(o=I(e))?t(j,n,o):j(o,r);var o,r}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.filterOut=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Symbol.for("placeholder"),t=function(t,r,e){return r==n?((n,t)=>function(r){return n(r,t)})(t,e):((n,t)=>function(r){return n(t,r)})(t,r)},r=Symbol.iterator,e=(n,t)=>({[r](){return this},next(){let r=n.next();for(;!r.done;){const{value:e}=r;if(t(e))return{value:e,done:!1};r=n.next()}return r}}),o=n=>null!=n&&"function"==typeof n.then,u=Symbol.asyncIterator,c=(n,t)=>({isAsyncIteratorDone:!1,[u](){return this},async next(){for(;!this.isAsyncIteratorDone;){const{value:r,done:e}=await n.next();if(e)this.isAsyncIteratorDone=!0;else{const n=t(r);if(o(n)?await n:n)return{value:r,done:!1}}}return{value:void 0,done:!0}}}),i=Array.isArray,f=function(t,r,e,o,u){return r==n?((n,t,r,e)=>function(o){return n(o,t,r,e)})(t,e,o,u):e==n?((n,t,r,e)=>function(o){return n(t,o,r,e)})(t,r,o,u):o==n?((n,t,r,e)=>function(o){return n(t,r,o,e)})(t,r,e,u):((n,t,r,e)=>function(o){return n(t,r,e,o)})(t,r,e,o)},s=Promise.all.bind(Promise),l=function(n,t,r,e){const o=t.length;let u=n.length-1;for(;++e<o;)n[++u]=r(t[e],e,n);return n},h=function(n,t,r,e){const o=n.length;let u=-1;for(;++r<o;)e[++u]&&t.push(n[r]);return t},a=function(t,r){const e=t.length,u=[];let c=-1,i=-1;for(;++c<e;){const e=t[c],a=r(e,c,t);if(o(a))return s(l([a],t,r,c)).then(f(h,t,u,c-1,n));a&&(u[++i]=e)}return u},p=function(t,r,e,o){return r==n?((n,t,r)=>function(e){return n(e,t,r)})(t,e,o):e==n?((n,t,r)=>function(e){return n(t,e,r)})(t,r,o):((n,t,r)=>function(e){return n(t,r,e)})(t,r,e)},y=(n,t,r)=>n[t](r),d=n=>function(){return n},g=(n,t,r)=>n?t():r(),b=(n,t)=>function(){return n(t)},v=function(){},m=(n,t,r,e,o)=>function(){return n(t,r,e,o)},x=(n,t,r,e)=>n[t](r,e),S=function(n,t,r,e){e&&(n[t]=r)},j=function(t,l){return i(t)?a(t,l):null==t?t:"string"==typeof t||t.constructor==String?function(t,r){const e=a(t,r);return o(e)?e.then(p(y,n,"join","")):e.join("")}(t,l):t.constructor==Set?function(t,r){const e=new Set,u=e.add.bind(e),c=[];for(const i of t){const f=r(i,i,t);o(f)?c.push(f.then(p(g,n,b(u,i),v))):f&&e.add(i)}return 0==c.length?e:s(c).then(d(e))}(t,l):t.constructor==Map?function(t,r){const e=new Map,u=[];for(const[c,i]of t){const f=r(i,c,t);o(f)?u.push(f.then(p(g,n,m(x,e,"set",c,i),v))):f&&e.set(c,i)}return 0==u.length?e:s(u).then(d(e))}(t,l):"function"==typeof t.filter?t.filter(l):"function"==typeof t[r]?e(t[r](),l):"function"==typeof t[u]?c(t[u](),l):t.constructor==Object?function(t,r){const e={},u=[];for(const c in t){const i=t[c],s=r(i,c,t);o(s)?u.push(s.then(f(S,e,c,t[c],n))):s&&(e[c]=i)}return 0==u.length?e:s(u).then(d(e))}(t,l):t},A=n=>!n,w=function(n,t){const r=t(...n);return o(r)?r.then(A):!r},I=function(...r){const e=r.pop();return"function"==typeof e?0==r.length?(u=w,f=e,(c=n)==n?((n,t)=>function(...r){return n(r,t)})(u,f):((n,t)=>function(...r){return n(t,r)})(u,c)):function(n){if(i(n)){const t=n.length;let r=-1;for(;++r<t;){const t=n[r];if(o(t))return!0}return!1}for(const t in n){const r=n[t];if(o(r))return!0}return!1}(r)?s(r).then(t(w,n,e)):w(r,e):!e;var u,c,f};return r=>{return"function"==typeof(e=I(r))?t(j,n,e):j(e,o);var e,o}}());

package/dist/x/filterOut.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -319,10 +319,20 @@ const filter = function (arg0, arg1) {
 }
 
 const areAnyValuesPromises = function (values) {
-  const length = values.length
-  let index = -1
-  while (++index < length) {
-    const value = values[index]
+  if (isArray(values)) {
+    const length = values.length
+    let index = -1
+    while (++index < length) {
+      const value = values[index]
+      if (isPromise(value)) {
+        return true
+      }
+    }
+    return false
+  }
+
+  for (const key in values) {
+    const value = values[key]
     if (isPromise(value)) {
       return true
     }

package/dist/x/find.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/find.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/find.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/find.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/find.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/findIndex.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/findIndex.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/findIndex.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/findIndex.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/findIndex.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/first.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/first.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/first.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/first.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/first.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/flatten.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/flatten.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/flatten.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/flatten.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/flatten.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/groupBy.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/groupBy.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/groupBy.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/groupBy.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/groupBy.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/has.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.

package/dist/x/has.es.min.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.6.0
+ * rubico v2.6.2
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.