rubico 2.7.6 → 2.7.8

package/dist/x/size.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const objectKeysLength=e=>{let t=0;for(const n in e)t+=1;return t},size=e=>"string"==typeof e?e.length:null==e?0:"number"==typeof e.length?e.length:"number"==typeof e.size?e.size:e.constructor==Object?objectKeysLength(e):1;export default size;

package/dist/x/size.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/size.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/size.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/trace.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isPromise=r=>null!=r&&"function"==typeof r.then,funcConcat=(r,n)=>function(...e){const t=r(...e);return isPromise(t)?t.then(n):n(t)},always=r=>function(){return r},thunkifyArgs=(r,n)=>function(){return r(...n)},thunkConditional=(r,n,e)=>r?n():e(),__=Symbol.for("placeholder"),curry2ResolveArg0=(r,n)=>function(e){return r(e,n)},curry2ResolveArg1=(r,n)=>function(e){return r(n,e)},curry2=function(r,n,e){return n==__?curry2ResolveArg0(r,e):curry2ResolveArg1(r,n)},curry3ResolveArg0=(r,n,e)=>function(t){return r(t,n,e)},curry3ResolveArg1=(r,n,e)=>function(t){return r(n,t,e)},curry3ResolveArg2=(r,n,e)=>function(t){return r(n,e,t)},curry3=function(r,n,e,t){return n==__?curry3ResolveArg0(r,e,t):e==__?curry3ResolveArg1(r,n,t):curry3ResolveArg2(r,n,e)},curryArgs2ResolveArgs0=(r,n,e)=>function(...e){return r(e,n)},curryArgs2ResolveArgs1=(r,n,e)=>function(...e){return r(n,e)},curryArgs2=function(r,n,e){return n==__?curryArgs2ResolveArgs0(r,e):curryArgs2ResolveArgs1(r,n)},curryArgs3ResolveArgs0=(r,n,e)=>function(...t){return r(t,n,e)},curryArgs3ResolveArgs1=(r,n,e)=>function(...t){return r(n,t,e)},curryArgs3ResolveArgs2=(r,n,e)=>function(...t){return r(n,e,t)},curryArgs3=function(r,n,e,t){return n==__?curryArgs3ResolveArgs0(r,e,t):e==__?curryArgs3ResolveArgs1(r,n,t):curryArgs3ResolveArgs2(r,n,e)},isArray=Array.isArray,areAnyValuesPromises=function(r){if(isArray(r)){const n=r.length;let e=-1;for(;++e<n;){const n=r[e];if(isPromise(n))return!0}return!1}for(const n in r){const e=r[n];if(isPromise(e))return!0}return!1},promiseAll=Promise.all.bind(Promise),_tap=function(r,n){const e=r[0],t=n(...r);return isPromise(t)?t.then(always(e)):e},tap=function(...r){const n=r.pop();return 0==r.length?curryArgs2(_tap,__,n):areAnyValuesPromises(r)?promiseAll(r).then(curry2(_tap,__,n)):_tap(r,n)},_tapIf=function(r,n,e){const t=r(...e);if(isPromise(t))return t.then(curry3(thunkConditional,__,thunkifyArgs(tap(n),e),always(e[0])));if(t){const r=n(...e);if(isPromise(r))return r.then(always(e[0]))}return e[0]};tap.if=function(...r){if(2==r.length)return curryArgs3(_tapIf,r[0],r[1],__);const n=r.length,e=r[n-1],t=r[n-2],o=r.slice(0,-2);return areAnyValuesPromises(o)?promiseAll(o).then(curry3(_tapIf,t,e,__)):_tapIf(t,e,r)};const consoleLog=console.log,trace=function(...r){const n=r[0];return"function"==typeof n?tap(funcConcat(n,consoleLog)):tap(consoleLog)(...r)};export default trace;

package/dist/x/trace.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/trace.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/trace.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/unionWith.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isArray=Array.isArray,isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),__=Symbol.for("placeholder"),curry3ResolveArg0=(r,n,t)=>function(e){return r(e,n,t)},curry3ResolveArg1=(r,n,t)=>function(e){return r(n,e,t)},curry3ResolveArg2=(r,n,t)=>function(e){return r(n,t,e)},curry3=function(r,n,t,e){return n==__?curry3ResolveArg0(r,t,e):t==__?curry3ResolveArg1(r,n,e):curry3ResolveArg2(r,n,t)},thunkify2=(r,n,t)=>function(){return r(n,t)},thunkify4=(r,n,t,e,o)=>function(){return r(n,t,e,o)},funcConcatSync=(r,n)=>function(...t){return n(r(...t))},callPropUnary=(r,n,t)=>r[n](t),thunkConditional=(r,n,t)=>r?n():t(),arrayPush=function(r,n){return r.push(n),r},always=r=>function(){return r},curry2ResolveArg0=(r,n)=>function(t){return r(t,n)},curry2ResolveArg1=(r,n)=>function(t){return r(n,t)},curry2=function(r,n,t){return n==__?curry2ResolveArg0(r,t):curry2ResolveArg1(r,n)},getArg1=(r,n)=>n,identity=r=>r,asyncIteratorForEach=async function(r,n){const t=[];for await(const e of r){const r=n(e);isPromise(r)&&t.push(r)}return 0==t.length?r:promiseAll(t).then(always(r))},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,arrayFlatten=function(r){const n=r.length,t=[],e=[];let o=-1;for(;++o<n;){const n=r[o];if(isArray(n)){const r=n.length;let t=-1;for(;++t<r;)e.push(n[t])}else if(null==n)e.push(n);else if("function"==typeof n.then)t.push(n.then(curry2(arrayPush,e,__)));else if("function"==typeof n[symbolIterator])for(const r of n)e.push(r);else if("function"==typeof n[symbolAsyncIterator])t.push(asyncIteratorForEach(n[symbolAsyncIterator](),curry2(arrayPush,e,__)));else if("function"==typeof n.chain){const r=n.chain(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,e,__))):e.push(r)}else if("function"==typeof n.flatMap){const r=n.flatMap(identity);isPromise(r)?t.push(r.then(curry2(arrayPush,e,__))):e.push(r)}else if("function"==typeof n.reduce){const r=n.reduce(funcConcatSync(getArg1,curry2(arrayPush,e,__)),null);isPromise(r)&&t.push(r)}else if(n.constructor==Object)for(const r in n)e.push(n[r]);else e.push(n)}return 0==t.length?e:promiseAll(t).then(always(e))},noop=function(){},arrayIncludesWith=function(r,n,t){const e=r.length,o=[];let s=-1;for(;++s<e;){const e=t(n,r[s]);if(isPromise(e))o.push(e);else if(e)return!0}return 0!=o.length&&promiseAll(o).then(curry3(callPropUnary,__,"some",Boolean))},arrayUniqWithAsync=async function(r,n,t,e){const o=r.length;for(;++e<o;){const o=r[e],s=arrayIncludesWith(t,o,n);(isPromise(s)?await s:s)||t.push(o)}return t},arrayUniqWith=function(r,n){const t=r.length,e=[];let o=-1;for(;++o<t;){const t=r[o],s=arrayIncludesWith(e,t,n);if(isPromise(s))return s.then(funcConcatSync(curry3(thunkConditional,__,noop,thunkify2(arrayPush,e,t)),thunkify4(arrayUniqWithAsync,r,n,e,o)));s||e.push(t)}return e},unionWith=r=>function(n){if(isArray(n))return arrayUniqWith(arrayFlatten(n),r);throw new TypeError(`${n} is not an Array`)};export default unionWith;

package/dist/x/unionWith.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/unionWith.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/unionWith.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/uniq.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isArray=Array.isArray,uniq=r=>{if(!isArray(r))throw Error("uniq(arr): arr is not an array");return[...new Set(r)]};export default uniq;

package/dist/x/uniq.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/uniq.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/uniq.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/unless.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isPromise=r=>null!=r&&"function"==typeof r.then,always=r=>function(){return r},__=Symbol.for("placeholder"),thunkify1=(r,n)=>function(){return r(n)},curry3ResolveArg0=(r,n,u)=>function(e){return r(e,n,u)},curry3ResolveArg1=(r,n,u)=>function(e){return r(n,e,u)},curry3ResolveArg2=(r,n,u)=>function(e){return r(n,u,e)},curry3=function(r,n,u,e){return n==__?curry3ResolveArg0(r,u,e):u==__?curry3ResolveArg1(r,n,e):curry3ResolveArg2(r,n,u)},thunkConditional=(r,n,u)=>r?n():u(),unless=(r,n)=>function(u){const e=r(u);return isPromise(e)?e.then(curry3(thunkConditional,__,always(u),thunkify1(n,u))):e?u:n(u)};export default unless;

package/dist/x/unless.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/unless.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/unless.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/values.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const objectValues=Object.values,values=e=>null==e?[]:"function"==typeof e.values?[...e.values()]:objectValues(e);export default values;

package/dist/x/values.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/values.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/values.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/when.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

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

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 const isPromise=r=>null!=r&&"function"==typeof r.then,always=r=>function(){return r},__=Symbol.for("placeholder"),thunkify1=(r,n)=>function(){return r(n)},curry3ResolveArg0=(r,n,e)=>function(u){return r(u,n,e)},curry3ResolveArg1=(r,n,e)=>function(u){return r(n,u,e)},curry3ResolveArg2=(r,n,e)=>function(u){return r(n,e,u)},curry3=function(r,n,e,u){return n==__?curry3ResolveArg0(r,e,u):e==__?curry3ResolveArg1(r,n,u):curry3ResolveArg2(r,n,e)},thunkConditional=(r,n,e)=>r?n():e(),when=(r,n)=>function(e){const u=r(e);return isPromise(u)?u.then(curry3(thunkConditional,__,thunkify1(n,e),always(e))):u?n(e):e};export default when;

package/dist/x/when.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/when.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/dist/x/when.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/flatMap.js

@@ -111,7 +111,7 @@ const _flatMap = function (value, flatMapper) {
  * // [1, 1, 2, 3, 3, 5, 5, 8, 7, 7]
  * ```
  *
- * Values from async generators are muxed. Muxing, or asynchronously "mixing", is the process of combining multiple asynchronous sources into one source, with order determined by the asynchronous resolution of the individual elements.
+ * Values from async generators are muxed. Muxing, or asynchronously "mixing", is the process of combining multiple asynchronous sources into one source, with order determined by the asynchronous resolution of the individual promise elements.
  *
  * ```javascript [playground]
  * const sleep = ms => new Promise(resolve => setTimeout(resolve, ms))

package/index.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.6
+ * rubico v2.7.8
  * https://github.com/a-synchronous/rubico
- * (c) 2019-2025 Richard Tong
+ * (c) 2019-2026 Richard Tong
  * rubico may be freely distributed under the MIT license.
  */
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "rubico",
-  "version": "2.7.6",
+  "version": "2.7.8",
   "description": "[a]synchronous functional programming",
   "author": "Richard Tong",
   "license": "MIT",
@@ -76,24 +76,17 @@
     "operator"
   ],
   "devDependencies": {
-    "async": "latest",
-    "bluebird": "latest",
     "codecov": "^3.7.1",
-    "fantasy-land": "latest",
-    "lodash": "latest",
     "mocha": "^11.1.0",
     "node-fetch": "^2.6.1",
     "nyc": "^15.1.0",
-    "ramda": "latest",
     "terser": "^5.39.0",
-    "thunk-test": "latest",
-    "typescript": "latest"
+    "thunk-test": "latest"
   },
   "scripts": {
     "test": "mocha test.js *.test.js */**.test.js",
     "test-coverage": "nyc mocha test.js x/*.test.js monad/*.test.js",
     "build": "npm run dts && ./build",
-    "bench": "./bench",
-    "dts": "del *.d.ts _internal/*.d.ts x/*.d.ts && tsc"
+    "bench": "./bench"
   }
 }

package/x/append.d.ts

@@ -1,38 +0,0 @@
-export = append;
-/**
- * @name append
- *
- * @synopsis
- * ```coffeescript [specscript]
- * append(
- *   element string|Array,
- * )(value string|Array) -> string|array
- * ```
- *
- * @description
- * Append a string or an array.
- *
- * ```javascript [playground]
- * import append from 'https://unpkg.com/rubico/dist/x/append.es.js'
- *
- * const myArray = ['orange', 'apple']
- *
- * {
- *   const result = append(['ananas'])(myArray)
- *   console.log(result) // ['orange', 'apple', 'ananas']
- * }
- *
- * {
- *   const result = append('ananas')(myArray)
- *   console.log(result) // ['orange', 'apple', 'ananas']
- * }
- *
- * {
- *   const result = append('world')('hello ')
- *   console.log(result) // 'hello world'
- * }
- * ```
- *
- * @since 1.7.3
- */
-declare function append(element: any): (value: any) => string | any[];

package/x/callProp.d.ts

@@ -1,20 +0,0 @@
-export = callProp;
-/**
- * @name callProp
- *
- * @synopsis
- * ```coffeescript [specscript]
- * callProp(property string, ...args)(object) -> object[property](...args)
- * ```
- *
- * @description
- * Calls a property on an object with arguments.
- *
- * ```javascript [playground]
- * import callProp from 'https://unpkg.com/rubico/dist/x/callProp.es.js'
- *
- * const priceRoundedDown = callProp('toFixed', 2)(5.992)
- * console.log('priceRoundedDown:', priceRoundedDown) // '5.99'
- * ```
- */
-declare function callProp(property: any, ...args: any[]): (object: any) => any;

package/x/defaultsDeep.d.ts

@@ -1,42 +0,0 @@
-export = defaultsDeep;
-/**
- * @name defaultsDeep
- *
- * @synopsis
- * ```coffeescript [specscript]
- * var defaultCollection Array|Object,
- *   value Array|Object
- *
- * defaultsDeep(defaultCollection)(value) -> Array|Object
- * ```
- *
- * @description
- * Deeply assign default values to an array or object by an array or object of possibly nested default values.
- *
- * ```javascript [playground]
- * import defaultsDeep from 'https://unpkg.com/rubico/dist/x/defaultsDeep.es.js'
- *
- * const defaultUser = defaultsDeep({
- *   name: 'placeholder',
- *   images: [
- *     { url: 'https://via.placeholder.com/150' },
- *     { url: 'https://via.placeholder.com/150' },
- *     { url: 'https://via.placeholder.com/150' },
- *   ],
- * })
- *
- * console.log(defaultUser({
- *   name: 'John',
- *   images: [{ url: 'https://via.placeholder.com/150/0000FF/808080%20?Text=Digital.com' }],
- * }))
- * // {
- * //   name: 'John',
- * //   images: [
- * //    { url: 'https://via.placeholder.com/150/0000FF/808080%20?Text=Digital.com' },
- * //    { url: 'https://via.placeholder.com/150' },
- * //    { url: 'https://via.placeholder.com/150' },
- * //   ],
- * // }
- * ```
- */
-declare function defaultsDeep(defaultCollection: any): (value: any) => any;

package/x/differenceWith.d.ts

@@ -1,25 +0,0 @@
-export = differenceWith;
-/**
- * @name differenceWith
- *
- * @synopsis
- * ```coffeescript [specscript]
- * differenceWith(
- *   comparator (any, any)=>Promise|boolean,
- *   allValues Array,
- * )(values Array) -> someOrAllValues Array
- * ```
- *
- * @description
- * Create an array of all the values in an array that are not in another array as dictated by a comparator.
- *
- * ```javascript [playground]
- * import differenceWith from 'https://unpkg.com/rubico/dist/x/differenceWith.es.js'
- * import isDeepEqual from 'https://unpkg.com/rubico/dist/x/isDeepEqual.es.js'
- *
- * console.log(
- *   differenceWith(isDeepEqual, [{ a: 1 }, { b: 2 }, { c: 3 }])([{ b: 2 }]),
- * ) // [{ a: 1 }, { c: 3 }]
- * ```
- */
-declare function differenceWith(comparator: any, allValues: any): (values: any) => any;

package/x/filterOut.d.ts

@@ -1,39 +0,0 @@
-export = filterOut;
-/**
- * @name filterOut
- *
- * @synopsis
- * ```coffeescript [specscript]
- * filterOut(
- *   arrayPredicate (value any, index number, array Array)=>Promise|boolean
- * )(array) -> rejectedArray Promise|Array
- *
- * filterOut(
- *   objectPredicate (value any, key string, object Object)=>Promise|boolean
- * )(object) -> rejectedObject Promise|Object
- *
- * filterOut(
- *   setPredicate (value any, value, set Set)=>Promise|boolean
- * )(set) -> rejectedSet Promise|Set
- *
- * filterOut(
- *   mapPredicate (value any, key any, map Map)=>Promise|boolean
- * )(map) -> rejectedMap Promise|Map
- *
- * filterOut(
- *   predicate (value any)=>Promise|boolean
- * )(generatorFunction GeneratorFunction) -> rejectingGeneratorFunction GeneratorFunction
- *
- * filterOut(
- *   predicate (value any)=>Promise|boolean
- * )(asyncGeneratorFunction AsyncGeneratorFunction) -> rejectingAsyncGeneratorFunction AsyncGeneratorFunction
- *
- * filterOut(
- *   predicate (value any)=>Promise|boolean
- * )(reducer Reducer) -> rejectingReducer Reducer
- * ```
- *
- * @description
- * The inverse of `filter`. Values that test true by the predicate are filtered out, or "rejected".
- */
-declare function filterOut(predicate: any): any;