rubico 1.9.7 → 2.0.0

package/dist/not.es.js

@@ -1,29 +1,90 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
 const isPromise = value => value != null && typeof value.then == 'function'
 
-// true -> false
-const _not = value => !value
-
-const not = function (funcOrValue) {
-  if (typeof funcOrValue == 'function') {
-    return function logicalInverter(value) {
-      const boolean = funcOrValue(value)
-      return isPromise(boolean) ? boolean.then(_not) : !boolean
+const areAnyValuesPromises = function (values) {
+  const length = values.length
+  let index = -1
+  while (++index < length) {
+    const value = values[index]
+    if (isPromise(value)) {
+      return true
     }
   }
-  return !funcOrValue
+  return false
+}
+
+const promiseAll = Promise.all.bind(Promise)
+
+const __ = Symbol.for('placeholder')
+
+// argument resolver for curry2
+const curry2ResolveArg0 = (
+  baseFunc, arg1,
+) => function arg0Resolver(arg0) {
+  return baseFunc(arg0, arg1)
+}
+
+// argument resolver for curry2
+const curry2ResolveArg1 = (
+  baseFunc, arg0,
+) => function arg1Resolver(arg1) {
+  return baseFunc(arg0, arg1)
+}
+
+const curry2 = function (baseFunc, arg0, arg1) {
+  return arg0 == __
+    ? curry2ResolveArg0(baseFunc, arg1)
+    : curry2ResolveArg1(baseFunc, arg0)
+}
+
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1)
 }
 
-const notSync = func => function notSync(...args) {
-  return !func(...args)
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args)
 }
 
-not.sync = notSync
+const curryArgs2 = function (baseFunc, arg0, arg1) {
+  if (arg0 == __) {
+    return curryArgs2ResolveArgs0(baseFunc, arg1)
+  }
+  return curryArgs2ResolveArgs1(baseFunc, arg0)
+}
+
+// negate(value boolean) -> inverse boolean
+const negate = value => !value
+
+// _not(args Array, predicate function)
+const _not = function (args, predicate) {
+  const boolean = predicate(...args)
+  return isPromise(boolean) ? boolean.then(negate) : !boolean
+}
+
+const not = function (...args) {
+  const predicateOrValue = args.pop()
+  if (typeof predicateOrValue == 'function') {
+    if (args.length == 0) {
+      return curryArgs2(_not, __, predicateOrValue)
+    }
+    if (areAnyValuesPromises(args)) {
+      return promiseAll(args).then(curry2(_not, __, predicateOrValue))
+    }
+    return _not(args, predicateOrValue)
+  }
+  return !predicateOrValue
+}
 
 export default not

package/dist/not.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const isPromise=n=>null!=n&&"function"==typeof n.then,_not=n=>!n,not=function(n){return"function"==typeof n?function(t){const o=n(t);return isPromise(o)?o.then(_not):!o}:!n},notSync=n=>function(...t){return!n(...t)};not.sync=notSync;export default not;
+const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let n=-1;for(;++n<e;){const e=r[n];if(isPromise(e))return!0}return!1},promiseAll=Promise.all.bind(Promise),__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(n){return r(n,e)},curry2ResolveArg1=(r,e)=>function(n){return r(e,n)},curry2=function(r,e,n){return e==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,e)},curryArgs2ResolveArgs0=(r,e,n)=>function(...n){return r(n,e)},curryArgs2ResolveArgs1=(r,e,n)=>function(...n){return r(e,n)},curryArgs2=function(r,e,n){return e==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,e)},negate=r=>!r,_not=function(r,e){const n=e(...r);return isPromise(n)?n.then(negate):!n},not=function(...r){const e=r.pop();return"function"==typeof e?0==r.length?(n=_not,s=e,(o=__)==__?curryArgs2ResolveArgs0(n,s):curryArgs2ResolveArgs1(n,o)):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_not,__,e)):_not(r,e):!e;var n,o,s};export default not;

package/dist/not.js

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
@@ -13,24 +13,85 @@
 
 const isPromise = value => value != null && typeof value.then == 'function'
 
-// true -> false
-const _not = value => !value
-
-const not = function (funcOrValue) {
-  if (typeof funcOrValue == 'function') {
-    return function logicalInverter(value) {
-      const boolean = funcOrValue(value)
-      return isPromise(boolean) ? boolean.then(_not) : !boolean
+const areAnyValuesPromises = function (values) {
+  const length = values.length
+  let index = -1
+  while (++index < length) {
+    const value = values[index]
+    if (isPromise(value)) {
+      return true
     }
   }
-  return !funcOrValue
+  return false
+}
+
+const promiseAll = Promise.all.bind(Promise)
+
+const __ = Symbol.for('placeholder')
+
+// argument resolver for curry2
+const curry2ResolveArg0 = (
+  baseFunc, arg1,
+) => function arg0Resolver(arg0) {
+  return baseFunc(arg0, arg1)
+}
+
+// argument resolver for curry2
+const curry2ResolveArg1 = (
+  baseFunc, arg0,
+) => function arg1Resolver(arg1) {
+  return baseFunc(arg0, arg1)
+}
+
+const curry2 = function (baseFunc, arg0, arg1) {
+  return arg0 == __
+    ? curry2ResolveArg0(baseFunc, arg1)
+    : curry2ResolveArg1(baseFunc, arg0)
+}
+
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1)
 }
 
-const notSync = func => function notSync(...args) {
-  return !func(...args)
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args)
 }
 
-not.sync = notSync
+const curryArgs2 = function (baseFunc, arg0, arg1) {
+  if (arg0 == __) {
+    return curryArgs2ResolveArgs0(baseFunc, arg1)
+  }
+  return curryArgs2ResolveArgs1(baseFunc, arg0)
+}
+
+// negate(value boolean) -> inverse boolean
+const negate = value => !value
+
+// _not(args Array, predicate function)
+const _not = function (args, predicate) {
+  const boolean = predicate(...args)
+  return isPromise(boolean) ? boolean.then(negate) : !boolean
+}
+
+const not = function (...args) {
+  const predicateOrValue = args.pop()
+  if (typeof predicateOrValue == 'function') {
+    if (args.length == 0) {
+      return curryArgs2(_not, __, predicateOrValue)
+    }
+    if (areAnyValuesPromises(args)) {
+      return promiseAll(args).then(curry2(_not, __, predicateOrValue))
+    }
+    return _not(args, predicateOrValue)
+  }
+  return !predicateOrValue
+}
 
 return not
 }())))

package/dist/not.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 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.not=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=n=>!n,t=function(t){return"function"==typeof t?function(o){const e=t(o);return(n=>null!=n&&"function"==typeof n.then)(e)?e.then(n):!e}:!t};return t.sync=n=>function(...t){return!n(...t)},t}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.not=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=n=>!n,r=function(t,o){const r=o(...t);return n(r)?r.then(e):!r};return function(...e){const u=e.pop();return"function"==typeof u?0==e.length?(f=r,c=u,(i=o)==o?((n,t,o)=>function(...o){return n(o,t)})(f,c):((n,t,o)=>function(...o){return n(t,o)})(f,i)):function(t){const o=t.length;let e=-1;for(;++e<o;){const o=t[e];if(n(o))return!0}return!1}(e)?t(e).then(function(n,t,e){return t==o?((n,t)=>function(o){return n(o,t)})(n,e):((n,t)=>function(o){return n(t,o)})(n,t)}(r,o,u)):r(e,u):!u;var f,i,c}}());

package/dist/not.min.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const isPromise=n=>null!=n&&"function"==typeof n.then,_not=n=>!n,not=function(n){return"function"==typeof n?function(t){const o=n(t);return isPromise(o)?o.then(_not):!o}:!n},notSync=n=>function(...t){return!n(...t)};not.sync=notSync;export default not;
+const isPromise=r=>null!=r&&"function"==typeof r.then,areAnyValuesPromises=function(r){const e=r.length;let n=-1;for(;++n<e;){const e=r[n];if(isPromise(e))return!0}return!1},promiseAll=Promise.all.bind(Promise),__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(n){return r(n,e)},curry2ResolveArg1=(r,e)=>function(n){return r(e,n)},curry2=function(r,e,n){return e==__?curry2ResolveArg0(r,n):curry2ResolveArg1(r,e)},curryArgs2ResolveArgs0=(r,e,n)=>function(...n){return r(n,e)},curryArgs2ResolveArgs1=(r,e,n)=>function(...n){return r(e,n)},curryArgs2=function(r,e,n){return e==__?curryArgs2ResolveArgs0(r,n):curryArgs2ResolveArgs1(r,e)},negate=r=>!r,_not=function(r,e){const n=e(...r);return isPromise(n)?n.then(negate):!n},not=function(...r){const e=r.pop();return"function"==typeof e?0==r.length?(n=_not,s=e,(o=__)==__?curryArgs2ResolveArgs0(n,s):curryArgs2ResolveArgs1(n,o)):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_not,__,e)):_not(r,e):!e;var n,o,s};export default not;

package/dist/not.mjs

@@ -1,29 +1,90 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
 const isPromise = value => value != null && typeof value.then == 'function'
 
-// true -> false
-const _not = value => !value
-
-const not = function (funcOrValue) {
-  if (typeof funcOrValue == 'function') {
-    return function logicalInverter(value) {
-      const boolean = funcOrValue(value)
-      return isPromise(boolean) ? boolean.then(_not) : !boolean
+const areAnyValuesPromises = function (values) {
+  const length = values.length
+  let index = -1
+  while (++index < length) {
+    const value = values[index]
+    if (isPromise(value)) {
+      return true
     }
   }
-  return !funcOrValue
+  return false
+}
+
+const promiseAll = Promise.all.bind(Promise)
+
+const __ = Symbol.for('placeholder')
+
+// argument resolver for curry2
+const curry2ResolveArg0 = (
+  baseFunc, arg1,
+) => function arg0Resolver(arg0) {
+  return baseFunc(arg0, arg1)
+}
+
+// argument resolver for curry2
+const curry2ResolveArg1 = (
+  baseFunc, arg0,
+) => function arg1Resolver(arg1) {
+  return baseFunc(arg0, arg1)
+}
+
+const curry2 = function (baseFunc, arg0, arg1) {
+  return arg0 == __
+    ? curry2ResolveArg0(baseFunc, arg1)
+    : curry2ResolveArg1(baseFunc, arg0)
+}
+
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs0 = (
+  baseFunc, arg1, arg2,
+) => function args0Resolver(...args) {
+  return baseFunc(args, arg1)
 }
 
-const notSync = func => function notSync(...args) {
-  return !func(...args)
+// argument resolver for curryArgs2
+const curryArgs2ResolveArgs1 = (
+  baseFunc, arg0, arg2,
+) => function arg1Resolver(...args) {
+  return baseFunc(arg0, args)
 }
 
-not.sync = notSync
+const curryArgs2 = function (baseFunc, arg0, arg1) {
+  if (arg0 == __) {
+    return curryArgs2ResolveArgs0(baseFunc, arg1)
+  }
+  return curryArgs2ResolveArgs1(baseFunc, arg0)
+}
+
+// negate(value boolean) -> inverse boolean
+const negate = value => !value
+
+// _not(args Array, predicate function)
+const _not = function (args, predicate) {
+  const boolean = predicate(...args)
+  return isPromise(boolean) ? boolean.then(negate) : !boolean
+}
+
+const not = function (...args) {
+  const predicateOrValue = args.pop()
+  if (typeof predicateOrValue == 'function') {
+    if (args.length == 0) {
+      return curryArgs2(_not, __, predicateOrValue)
+    }
+    if (areAnyValuesPromises(args)) {
+      return promiseAll(args).then(curry2(_not, __, predicateOrValue))
+    }
+    return _not(args, predicateOrValue)
+  }
+  return !predicateOrValue
+}
 
 export default not

package/dist/omit.es.js

@@ -1,10 +1,12 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
+const isPromise = value => value != null && typeof value.then == 'function'
+
 const isArray = Array.isArray
 
 const memoizeCappedUnary = function (func, cap) {
@@ -170,6 +172,9 @@ const omit = function (arg0, arg1) {
   if (arg1 == null) {
     return curry2(_omit, __, arg0)
   }
+  if (isPromise(arg0)) {
+    return arg0.then(curry2(_omit, __, arg1))
+  }
   return _omit(arg0, arg1)
 }
 

package/dist/omit.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const isArray=Array.isArray,memoizeCappedUnary=function(r,e){const t=new Map,o=function(o){if(t.has(o))return t.get(o);const n=r(o);return t.set(o,n),t.size>e&&t.clear(),n};return o.cache=t,o},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const e=r.length-1,t="["==r[0],o="]"==r[e];return t&&o?r.slice(1,e).split(pathDelimiters):t?r.slice(1).split(pathDelimiters):o?r.slice(0,e).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,e){const t=propertyPathToArray(e),o=t.length;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;return c},deleteByPath=function(r,e){if(null==r)return;const t=propertyPathToArray(e),o=t.length-1;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;const p=t[n];null!=c&&p in c&&delete c[p]},objectCopyDeep=function(r){const e={};for(const t in r){const o=r[t];isArray(o)?e[t]=arrayCopyDeep(o):null!=o&&o.constructor==Object?e[t]=objectCopyDeep(o):e[t]=o}return e},arrayCopyDeep=function(r){const e=r.length,t=[];let o=-1;for(;++o<e;){const e=r[o];isArray(e)?t[o]=arrayCopyDeep(e):null!=e&&e.constructor==Object?t[o]=objectCopyDeep(e):t[o]=e}return t},copyDeep=function(r){return isArray(r)?arrayCopyDeep(r):null==r?r:r.constructor==Object?objectCopyDeep(r):r},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(t){return r(t,e)},curry2ResolveArg1=(r,e)=>function(t){return r(e,t)},curry2=function(r,e,t){return e==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,e)},_omit=function(r,e){const t=e.length,o=isArray(n=r)?arrayCopyDeep(n):null==n?n:n.constructor==Object?objectCopyDeep(n):n;var n;let c=-1;for(;++c<t;)deleteByPath(o,e[c]);return o},omit=function(r,e){return null==e?curry2(_omit,__,r):_omit(r,e)};export default omit;
+const isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,memoizeCappedUnary=function(r,e){const t=new Map,o=function(o){if(t.has(o))return t.get(o);const n=r(o);return t.set(o,n),t.size>e&&t.clear(),n};return o.cache=t,o},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const e=r.length-1,t="["==r[0],o="]"==r[e];return t&&o?r.slice(1,e).split(pathDelimiters):t?r.slice(1).split(pathDelimiters):o?r.slice(0,e).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,e){const t=propertyPathToArray(e),o=t.length;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;return c},deleteByPath=function(r,e){if(null==r)return;const t=propertyPathToArray(e),o=t.length-1;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;const i=t[n];null!=c&&i in c&&delete c[i]},objectCopyDeep=function(r){const e={};for(const t in r){const o=r[t];isArray(o)?e[t]=arrayCopyDeep(o):null!=o&&o.constructor==Object?e[t]=objectCopyDeep(o):e[t]=o}return e},arrayCopyDeep=function(r){const e=r.length,t=[];let o=-1;for(;++o<e;){const e=r[o];isArray(e)?t[o]=arrayCopyDeep(e):null!=e&&e.constructor==Object?t[o]=objectCopyDeep(e):t[o]=e}return t},copyDeep=function(r){return isArray(r)?arrayCopyDeep(r):null==r?r:r.constructor==Object?objectCopyDeep(r):r},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(t){return r(t,e)},curry2ResolveArg1=(r,e)=>function(t){return r(e,t)},curry2=function(r,e,t){return e==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,e)},_omit=function(r,e){const t=e.length,o=isArray(n=r)?arrayCopyDeep(n):null==n?n:n.constructor==Object?objectCopyDeep(n):n;var n;let c=-1;for(;++c<t;)deleteByPath(o,e[c]);return o},omit=function(r,e){return null==e?curry2(_omit,__,r):null!=(t=r)&&"function"==typeof t.then?r.then(curry2(_omit,__,e)):_omit(r,e);var t};export default omit;

package/dist/omit.js

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
@@ -11,6 +11,8 @@
   else (root.omit = omit) // Browser
 }(typeof globalThis == 'object' ? globalThis : this, (function () { 'use strict'
 
+const isPromise = value => value != null && typeof value.then == 'function'
+
 const isArray = Array.isArray
 
 const memoizeCappedUnary = function (func, cap) {
@@ -176,6 +178,9 @@ const omit = function (arg0, arg1) {
   if (arg1 == null) {
     return curry2(_omit, __, arg0)
   }
+  if (isPromise(arg0)) {
+    return arg0.then(curry2(_omit, __, arg1))
+  }
   return _omit(arg0, arg1)
 }
 

package/dist/omit.min.js

@@ -1,8 +1,8 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
-!function(t,n){"object"==typeof module?module.exports=n:"function"==typeof define?define((()=>n)):t.omit=n}("object"==typeof globalThis?globalThis:this,function(){"use strict";const t=Array.isArray,n=/[.|[|\]]+/,e=function(t,n){const e=new Map,o=function(o){if(e.has(o))return e.get(o);const r=t(o);return e.set(o,r),e.size>n&&e.clear(),r};return o.cache=e,o}((function(t){const e=t.length-1,o="["==t[0],r="]"==t[e];return o&&r?t.slice(1,e).split(n):o?t.slice(1).split(n):r?t.slice(0,e).split(n):t.split(n)}),500),o=n=>t(n)?n:"string"==typeof n?e(n):[n],r=function(t,n){if(null==t)return;const e=o(n),r=e.length-1;let c=-1,u=t;for(;++c<r;)if(u=u[e[c]],null==u)return;const l=e[c];null!=u&&l in u&&delete u[l]},c=function(n){const e={};for(const o in n){const r=n[o];t(r)?e[o]=u(r):null!=r&&r.constructor==Object?e[o]=c(r):e[o]=r}return e},u=function(n){const e=n.length,o=[];let r=-1;for(;++r<e;){const e=n[r];t(e)?o[r]=u(e):null!=e&&e.constructor==Object?o[r]=c(e):o[r]=e}return o},l=Symbol.for("placeholder"),i=function(n,e){const o=e.length,l=t(i=n)?u(i):null==i?i:i.constructor==Object?c(i):i;var i;let s=-1;for(;++s<o;)r(l,e[s]);return l};return function(t,n){return null==n?function(t,n,e){return n==l?((t,n)=>function(e){return t(e,n)})(t,e):((t,n)=>function(e){return t(n,e)})(t,n)}(i,l,t):i(t,n)}}());
+!function(n,t){"object"==typeof module?module.exports=t:"function"==typeof define?define((()=>t)):n.omit=t}("object"==typeof globalThis?globalThis:this,function(){"use strict";const n=Array.isArray,t=/[.|[|\]]+/,e=function(n,t){const e=new Map,o=function(o){if(e.has(o))return e.get(o);const r=n(o);return e.set(o,r),e.size>t&&e.clear(),r};return o.cache=e,o}((function(n){const e=n.length-1,o="["==n[0],r="]"==n[e];return o&&r?n.slice(1,e).split(t):o?n.slice(1).split(t):r?n.slice(0,e).split(t):n.split(t)}),500),o=t=>n(t)?t:"string"==typeof t?e(t):[t],r=function(n,t){if(null==n)return;const e=o(t),r=e.length-1;let c=-1,u=n;for(;++c<r;)if(u=u[e[c]],null==u)return;const l=e[c];null!=u&&l in u&&delete u[l]},c=function(t){const e={};for(const o in t){const r=t[o];n(r)?e[o]=u(r):null!=r&&r.constructor==Object?e[o]=c(r):e[o]=r}return e},u=function(t){const e=t.length,o=[];let r=-1;for(;++r<e;){const e=t[r];n(e)?o[r]=u(e):null!=e&&e.constructor==Object?o[r]=c(e):o[r]=e}return o},l=Symbol.for("placeholder"),i=function(n,t,e){return t==l?((n,t)=>function(e){return n(e,t)})(n,e):((n,t)=>function(e){return n(t,e)})(n,t)},s=function(t,e){const o=e.length,l=n(i=t)?u(i):null==i?i:i.constructor==Object?c(i):i;var i;let s=-1;for(;++s<o;)r(l,e[s]);return l};return function(n,t){return null==t?i(s,l,n):null!=(e=n)&&"function"==typeof e.then?n.then(i(s,l,t)):s(n,t);var e}}());

package/dist/omit.min.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
-const isArray=Array.isArray,memoizeCappedUnary=function(r,e){const t=new Map,o=function(o){if(t.has(o))return t.get(o);const n=r(o);return t.set(o,n),t.size>e&&t.clear(),n};return o.cache=t,o},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const e=r.length-1,t="["==r[0],o="]"==r[e];return t&&o?r.slice(1,e).split(pathDelimiters):t?r.slice(1).split(pathDelimiters):o?r.slice(0,e).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,e){const t=propertyPathToArray(e),o=t.length;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;return c},deleteByPath=function(r,e){if(null==r)return;const t=propertyPathToArray(e),o=t.length-1;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;const p=t[n];null!=c&&p in c&&delete c[p]},objectCopyDeep=function(r){const e={};for(const t in r){const o=r[t];isArray(o)?e[t]=arrayCopyDeep(o):null!=o&&o.constructor==Object?e[t]=objectCopyDeep(o):e[t]=o}return e},arrayCopyDeep=function(r){const e=r.length,t=[];let o=-1;for(;++o<e;){const e=r[o];isArray(e)?t[o]=arrayCopyDeep(e):null!=e&&e.constructor==Object?t[o]=objectCopyDeep(e):t[o]=e}return t},copyDeep=function(r){return isArray(r)?arrayCopyDeep(r):null==r?r:r.constructor==Object?objectCopyDeep(r):r},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(t){return r(t,e)},curry2ResolveArg1=(r,e)=>function(t){return r(e,t)},curry2=function(r,e,t){return e==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,e)},_omit=function(r,e){const t=e.length,o=isArray(n=r)?arrayCopyDeep(n):null==n?n:n.constructor==Object?objectCopyDeep(n):n;var n;let c=-1;for(;++c<t;)deleteByPath(o,e[c]);return o},omit=function(r,e){return null==e?curry2(_omit,__,r):_omit(r,e)};export default omit;
+const isPromise=r=>null!=r&&"function"==typeof r.then,isArray=Array.isArray,memoizeCappedUnary=function(r,e){const t=new Map,o=function(o){if(t.has(o))return t.get(o);const n=r(o);return t.set(o,n),t.size>e&&t.clear(),n};return o.cache=t,o},pathDelimiters=/[.|[|\]]+/,parsePropertyPath=function(r){const e=r.length-1,t="["==r[0],o="]"==r[e];return t&&o?r.slice(1,e).split(pathDelimiters):t?r.slice(1).split(pathDelimiters):o?r.slice(0,e).split(pathDelimiters):r.split(pathDelimiters)},memoizedCappedParsePropertyPath=memoizeCappedUnary(parsePropertyPath,500),propertyPathToArray=r=>isArray(r)?r:"string"==typeof r?memoizedCappedParsePropertyPath(r):[r],getByPath=function(r,e){const t=propertyPathToArray(e),o=t.length;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;return c},deleteByPath=function(r,e){if(null==r)return;const t=propertyPathToArray(e),o=t.length-1;let n=-1,c=r;for(;++n<o;)if(c=c[t[n]],null==c)return;const i=t[n];null!=c&&i in c&&delete c[i]},objectCopyDeep=function(r){const e={};for(const t in r){const o=r[t];isArray(o)?e[t]=arrayCopyDeep(o):null!=o&&o.constructor==Object?e[t]=objectCopyDeep(o):e[t]=o}return e},arrayCopyDeep=function(r){const e=r.length,t=[];let o=-1;for(;++o<e;){const e=r[o];isArray(e)?t[o]=arrayCopyDeep(e):null!=e&&e.constructor==Object?t[o]=objectCopyDeep(e):t[o]=e}return t},copyDeep=function(r){return isArray(r)?arrayCopyDeep(r):null==r?r:r.constructor==Object?objectCopyDeep(r):r},__=Symbol.for("placeholder"),curry2ResolveArg0=(r,e)=>function(t){return r(t,e)},curry2ResolveArg1=(r,e)=>function(t){return r(e,t)},curry2=function(r,e,t){return e==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,e)},_omit=function(r,e){const t=e.length,o=isArray(n=r)?arrayCopyDeep(n):null==n?n:n.constructor==Object?objectCopyDeep(n):n;var n;let c=-1;for(;++c<t;)deleteByPath(o,e[c]);return o},omit=function(r,e){return null==e?curry2(_omit,__,r):null!=(t=r)&&"function"==typeof t.then?r.then(curry2(_omit,__,e)):_omit(r,e);var t};export default omit;

package/dist/omit.mjs

@@ -1,10 +1,12 @@
 /**
- * rubico v1.9.7
+ * rubico v2.0.0
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
+ * (c) 2019-2023 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 
+const isPromise = value => value != null && typeof value.then == 'function'
+
 const isArray = Array.isArray
 
 const memoizeCappedUnary = function (func, cap) {
@@ -170,6 +172,9 @@ const omit = function (arg0, arg1) {
   if (arg1 == null) {
     return curry2(_omit, __, arg0)
   }
+  if (isPromise(arg0)) {
+    return arg0.then(curry2(_omit, __, arg1))
+  }
   return _omit(arg0, arg1)
 }