rubico 2.7.7 → 2.7.9

package/README.md

@@ -7,7 +7,7 @@
 [![npm version](https://img.shields.io/npm/v/rubico.svg?style=flat)](https://www.npmjs.com/package/rubico)
 [![License: MIT](https://img.shields.io/badge/License-MIT-blue.svg)](https://opensource.org/licenses/MIT)
 
-## [a]synchronous functional programming
+## [A]synchronous Functional Programming
 
 ```javascript [playground]
 const { pipe, map, filter } = rubico
@@ -34,7 +34,7 @@ npm i rubico
 ```
 
 
-require `rubico` in [CommonJS](https://nodejs.org/docs/latest/api/modules.html#modules-commonjs-modules):
+require Rubico in [CommonJS](https://nodejs.org/docs/latest/api/modules.html#modules-commonjs-modules):
 ```javascript
 // import rubico core globally
 require('rubico/global')
@@ -56,7 +56,7 @@ const Transducer = require('rubico/Transducer')
 ```
 
 
-import `rubico` in the browser:
+import Rubico in the browser:
 ```html [htmlmixed]
 <!-- import rubico core globally -->
 <script src="https://unpkg.com/rubico/dist/global.min.js"></script>
@@ -77,9 +77,9 @@ import `rubico` in the browser:
 ## Motivation
 
 A note from the author
-> At a certain point in my career, I grew frustrated with the entanglement of my own code. While looking for something better, I found functional programming. I was excited by the idea of functional composition, but disillusioned by the redundancy of effectful types. I started rubico to capitalize on the prior while rebuking the latter. Many iterations since then, the library has grown into something I personally enjoy using, and continue to use to this day.
+> At a certain point in my career, I grew frustrated with the entanglement of my own code. While looking for something better, I found functional programming. I was excited by the idea of functional composition, but disillusioned by the redundancy of effectful types. I started Rubico to capitalize on the prior while rebuking the latter. Many iterations since then, the library has grown into something I personally enjoy using, and continue to use to this day.
 
-rubico is founded on the following principles:
+Rubico is founded on the following principles:
  * asynchronous code should be simple
  * functional style should not care about async
  * functional transformations should be composable, performant, and simple to express
@@ -88,7 +88,7 @@ When you import this library, you obtain the freedom that comes from having thos
 
 ## Introduction
 
-rubico is a library for [A]synchronous Functional Programming in JavaScript. The library supports a simple and composable functional style in asynchronous environments.
+Rubico is a library for [A]synchronous Functional Programming in JavaScript. The library supports a simple and composable functional style in asynchronous environments.
 
 ```javascript
 const {
@@ -135,7 +135,7 @@ pipe(helloPromise, [ // helloPromise is resolved for 'hello'
 ])
 ```
 
-All rubico operators support both eager and lazy APIs. The eager API takes all required arguments and executes at once, while the lazy API takes only the setup arguments and returns a function that executes later. This dual API supports a natural and composable code style.
+All Rubico operators support both eager and lazy APIs. The eager API takes all required arguments and executes at once, while the lazy API takes only the setup arguments and returns a function that executes later. This dual API supports a natural and composable code style.
 
 ```javascript [playground]
 const myObj = { a: 1, b: 2, c: 3 }
@@ -152,7 +152,7 @@ console.log(myDuplicatedSquaredObject)
 // { a: [1, 1], b: [4, 4], c: [9, 9] }
 ```
 
-The rubico operators are versatile and act on a wide range of vanilla JavaScript types to create declarative, extensible, and async-enabled function compositions. The same operator `map` can act on an array and also a `Map` data structure.
+The Rubico operators are versatile and act on a wide range of vanilla JavaScript types to create declarative, extensible, and async-enabled function compositions. The same operator `map` can act on an array and also a `Map` data structure.
 
 ```javascript [playground]
 const { pipe, tap, map, filter } = rubico
@@ -205,7 +205,7 @@ pipe(todoIDs, [
 ])
 ```
 
-rubico offers transducers through its `Transducer` module. You can consume these transducers with rubico's `transform` and `compose` operators. You can use `compose` to chain a left-to-right composition of transducers.
+Rubico offers transducers through its `Transducer` module. You can consume these transducers with Rubico's `transform` and `compose` operators. You can use `compose` to chain a left-to-right composition of transducers.
 
 ```javascript [playground]
 const isOdd = number => number % 2 == 1
@@ -229,7 +229,7 @@ pipe(generateNumbers(), [
 ])
 ```
 
-For advanced asynchronous use cases, some of the rubico operators have property functions that have various asynchronous behavior, e.g.
+For advanced asynchronous use cases, some of the Rubico operators have property functions that have various asynchronous behavior, e.g.
  * `map` - applies a mapper function concurrently
  * `map.pool` - applies a mapper function concurrently with a concurrency limit
  * `map.series` - applies a mapper function serially
@@ -250,7 +250,7 @@ Pull requests should provide some basic context and link the relevant issue. Her
 For more information please see [CONTRIBUTING.md](/CONTRIBUTING.md)
 
 ## License
-rubico is [MIT Licensed](https://github.com/a-synchronous/rubico/blob/master/LICENSE).
+Rubico is [MIT Licensed](https://github.com/a-synchronous/rubico/blob/master/LICENSE).
 
 ## Support
  * minimum Node.js version: 16
@@ -259,9 +259,5 @@ rubico is [MIT Licensed](https://github.com/a-synchronous/rubico/blob/master/LIC
  * minimum Edge version: 79
  * minimum Safari version: 11.1
 
-## Awesome Resources
-[rubico simplifies asynchronous code](https://dev.to/richytong/rubico-a-synchrnous-functional-syntax-motivation-20hf)
-<br>
-
 ## Blog
-Check out the rubico blog at [https://rubico.land/blog](https://rubico.land/blog)
+Learn more about Rubico and [A]synchronous Functional Programming at [https://rubico.land/blog](https://rubico.land/blog).

package/_internal/arrayForEach.js

@@ -24,7 +24,7 @@ const arrayForEach = function (array, callback) {
     promises = []
   let index = -1
   while (++index < length) {
-    const operation = callback(array[index])
+    const operation = callback(array[index], index, array)
     if (isPromise(operation)) {
       promises.push(operation)
     }

package/_internal/arrayForEachSeries.js

@@ -36,7 +36,7 @@ const arrayForEachSeries = function (array, callback) {
   const length = array.length
   let index = -1
   while (++index < length) {
-    const operation = callback(array[index])
+    const operation = callback(array[index], index, array)
     if (isPromise(operation)) {
       return operation
         .then(thunkify3(_arrayForEachSeriesAsync, array, callback, index))

package/_internal/objectForEach.js

@@ -20,7 +20,7 @@ const always = require('./always')
 const objectForEach = function (object, callback) {
   const promises = []
   for (const key in object) {
-    const operation = callback(object[key])
+    const operation = callback(object[key], key, object)
     if (isPromise(operation)) {
       promises.push(operation)
     }

package/_internal/objectForEachSeries.js

@@ -34,7 +34,7 @@ const objectForEachSeries = function (object, callback) {
   const doneKeys = {}
   for (const key in object) {
     doneKeys[key] = true
-    const operation = callback(object[key])
+    const operation = callback(object[key], key, object)
     if (isPromise(operation)) {
       return operation
         .then(thunkify3(_objectForEachSeriesAsync, object, callback, doneKeys))

package/dist/Transducer.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/Transducer.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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,e)=>function(...n){const t=r(...n);return isPromise(t)?t.then(e):e(t)},__=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)},reducerMap=(r,e)=>function(n,t){const c=e(t);return isPromise(c)?c.then(curry2(r,n,__)):r(n,c)},curry3ResolveArg0=(r,e,n)=>function(t){return r(t,e,n)},curry3ResolveArg1=(r,e,n)=>function(t){return r(e,t,n)},curry3ResolveArg2=(r,e,n)=>function(t){return r(e,n,t)},curry3=function(r,e,n,t){return e==__?curry3ResolveArg0(r,n,t):n==__?curry3ResolveArg1(r,e,t):curry3ResolveArg2(r,e,n)},thunkify2=(r,e,n)=>function(){return r(e,n)},thunkConditional=(r,e,n)=>r?e():n(),always=r=>function(){return r},reducerFilter=(r,e)=>function(n,t){const c=e(t);return isPromise(c)?c.then(curry3(thunkConditional,__,thunkify2(r,n,t),always(n))):c?r(n,t):n},isArray=Array.isArray,objectValues=Object.values,objectProto=Object.prototype,nativeObjectToString=objectProto.toString,objectToString=r=>nativeObjectToString.call(r),generatorFunctionTag="[object GeneratorFunction]",isGeneratorFunction=r=>objectToString(r)==generatorFunctionTag,asyncGeneratorFunctionTag="[object AsyncGeneratorFunction]",isAsyncGeneratorFunction=r=>objectToString(r)==asyncGeneratorFunctionTag,iteratorReduceAsync=async function(r,e,n){let t=r.next();if(t.done)return n;for(;!t.done;)n=e(n,t.value),isPromise(n)&&(n=await n),t=r.next();return n},iteratorReduce=function(r,e,n){let t=r.next();if(t.done)return n;for(void 0===n&&(n=t.value,t=r.next());!t.done;){if(n=e(n,t.value),isPromise(n))return n.then(curry3(iteratorReduceAsync,r,e,__));t=r.next()}return n},asyncIteratorReduce=async function(r,e,n){let t=await r.next();if(t.done)return n;for(void 0===n&&(n=t.value,t=await r.next());!t.done;)n=await e(n,t.value),t=await r.next();return n},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,curryArgs3ResolveArgs0=(r,e,n)=>function(...t){return r(t,e,n)},curryArgs3ResolveArgs1=(r,e,n)=>function(...t){return r(e,t,n)},curryArgs3ResolveArgs2=(r,e,n)=>function(...t){return r(e,n,t)},curryArgs3=function(r,e,n,t){return e==__?curryArgs3ResolveArgs0(r,n,t):n==__?curryArgs3ResolveArgs1(r,e,t):curryArgs3ResolveArgs2(r,e,n)},curry4ResolveArg0=(r,e,n,t)=>function(c){return r(c,e,n,t)},curry4ResolveArg1=(r,e,n,t)=>function(c){return r(e,c,n,t)},curry4ResolveArg2=(r,e,n,t)=>function(c){return r(e,n,c,t)},curry4ResolveArg3=(r,e,n,t)=>function(c){return r(e,n,t,c)},curry4=function(r,e,n,t,c){return e==__?curry4ResolveArg0(r,n,t,c):n==__?curry4ResolveArg1(r,e,t,c):t==__?curry4ResolveArg2(r,e,n,c):curry4ResolveArg3(r,e,n,t)},arrayReduceAsync=async function(r,e,n,t){const c=r.length;for(;++t<c;)n=e(n,r[t],t,r),isPromise(n)&&(n=await n);return n},arrayReduce=function(r,e,n){const t=r.length;let c=-1;for(void 0===n&&(n=r[++c]);++c<t;)if(n=e(n,r[c],c,r),isPromise(n))return n.then(curry4(arrayReduceAsync,r,e,__,c));return n},curry5ResolveArg0=(r,e,n,t,c)=>function(o){return r(o,e,n,t,c)},curry5ResolveArg1=(r,e,n,t,c)=>function(o){return r(e,o,n,t,c)},curry5ResolveArg2=(r,e,n,t,c)=>function(o){return r(e,n,o,t,c)},curry5ResolveArg3=(r,e,n,t,c)=>function(o){return r(e,n,t,o,c)},curry5ResolveArg4=(r,e,n,t,c)=>function(o){return r(e,n,t,c,o)},curry5=function(r,e,n,t,c,o){return e==__?curry5ResolveArg0(r,n,t,c,o):n==__?curry5ResolveArg1(r,e,t,c,o):t==__?curry5ResolveArg2(r,e,n,c,o):c==__?curry5ResolveArg3(r,e,n,t,o):curry5ResolveArg4(r,e,n,t,c)},objectKeys=Object.keys,objectReduceAsync=async function(r,e,n,t,c){const o=t.length;for(;++c<o;){const o=t[c];n=e(n,r[o],o,r),isPromise(n)&&(n=await n)}return n},objectReduce=function(r,e,n){const t=objectKeys(r),c=t.length;let o=-1;for(void 0===n&&(n=r[t[++o]]);++o<c;){const c=t[o];if(n=e(n,r[c],c,r),isPromise(n))return n.then(curry5(objectReduceAsync,r,e,__,t,o))}return n},mapReduceAsync=async function(r,e,n,t){for(const[c,o]of t)n=e(n,o,c,r),isPromise(n)&&(n=await n);return n},mapReduce=function(r,e,n){const t=r.entries();if(void 0===n){const r=t.next();if(r.done)return n;n=r.value[1]}for(const[c,o]of t)if(n=e(n,o,c,r),isPromise(n))return n.then(curry4(mapReduceAsync,r,e,__,t));return n},reducerConcat=(r,e)=>function(n,t){const c=r(n,t);return isPromise(c)?c.then(curry2(e,__,t)):e(c,t)},genericReduce=function(r,e,n){return isArray(r)?arrayReduce(r,e,n):null==r?void 0===n?curry2(e,r,__):e(n,r):r.constructor==Map?mapReduce(r,e,n):"function"==typeof r[symbolIterator]?iteratorReduce(r[symbolIterator](),e,n):"function"==typeof r[symbolAsyncIterator]?asyncIteratorReduce(r[symbolAsyncIterator](),e,n):"function"==typeof r.reduce?r.reduce(e,n):"function"==typeof r.chain?r.chain(curry2(e,n,__)):"function"==typeof r.flatMap?r.flatMap(curry2(e,n,__)):r.constructor==Object?objectReduce(r,e,n):void 0===n?curry2(e,r,__):e(n,r)},reducerFlatMap=(r,e)=>function(n,t){const c=e(t);return isPromise(c)?c.then(curry3(genericReduce,__,r,n)):genericReduce(c,r,n)},reducerForEach=(r,e)=>function(n,t){const c=e(t);return isPromise(c)?c.then(thunkify2(r,n,t)):r(n,t)},_reducerTryCatchErrorHandler=function(r,e,n,t,c){const o=r(n,c);return isPromise(o)?o.then(curry2(e,t,__)):e(t,o)},reducerTryCatch=function(r,e,n){const t=e(r);return function(e,c){try{const o=t(e,c);return isPromise(o)?o.catch(curry5(_reducerTryCatchErrorHandler,n,r,__,e,c)):o}catch(t){return _reducerTryCatchErrorHandler(n,r,t,e,c)}}},Transducer={map:function(r){return curry2(reducerMap,__,r)},filter:function(r){return curry2(reducerFilter,__,r)},flatMap:function(r){return curry2(reducerFlatMap,__,r)},forEach:function(r){return curry2(reducerForEach,__,r)},passthrough:function(r){return r},tryCatch:function(r,e){return curry3(reducerTryCatch,__,r,e)}};export default Transducer;

package/dist/Transducer.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/Transducer.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/Transducer.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/__.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 __ = Symbol.for('placeholder')

package/dist/__.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 __=Symbol.for("placeholder");export default __;

package/dist/__.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/__.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/__.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 __ = Symbol.for('placeholder')

package/dist/all.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/all.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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,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},areAllValuesNonfunctions=function(r){if(isArray(r)){const n=r.length;let e=-1;for(;++e<n;)if("function"==typeof r[e])return!1;return!0}for(const n in r)if("function"==typeof r[n])return!1;return!0},promiseAll=Promise.all.bind(Promise),promiseObjectAllExecutor=r=>function(n){const e={};let t=0;for(const o in r){const u=r[o];isPromise(u)?(t+=1,u.then((r=>function(o){e[r]=o,t-=1,0==t&&n(e)})(o))):e[o]=u}0==t&&n(e)},promiseObjectAll=r=>new Promise(promiseObjectAllExecutor(r)),__=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)},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)},functionArrayAll=function(r,n){const e=r.length,t=Array(e);let o=-1,u=!1;for(;++o<e;){const e=r[o],s="function"==typeof e?e(...n):e;isPromise(s)&&(u=!0),t[o]=s}return u?promiseAll(t):t},funcConcat=(r,n)=>function(...e){const t=r(...e);return isPromise(t)?t.then(n):n(t)},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)},curry4ResolveArg0=(r,n,e,t)=>function(o){return r(o,n,e,t)},curry4ResolveArg1=(r,n,e,t)=>function(o){return r(n,o,e,t)},curry4ResolveArg2=(r,n,e,t)=>function(o){return r(n,e,o,t)},curry4ResolveArg3=(r,n,e,t)=>function(o){return r(n,e,t,o)},curry4=function(r,n,e,t,o){return n==__?curry4ResolveArg0(r,e,t,o):e==__?curry4ResolveArg1(r,n,t,o):t==__?curry4ResolveArg2(r,n,e,o):curry4ResolveArg3(r,n,e,t)},objectSet=function(r,n,e){return r[n]=e,r},asyncFunctionArrayAllSeries=async function(r,n,e,t){const o=r.length;for(;++t<o;){const o=r[t](...n);e[t]=isPromise(o)?await o:o}return e},functionArrayAllSeries=function(r,n){const e=r.length,t=[];let o=-1;for(;++o<e;){const e=r[o](...n);if(isPromise(e))return e.then(funcConcat(curry3(objectSet,t,o,__),curry4(asyncFunctionArrayAllSeries,r,n,__,o)));t[o]=e}return t},always=r=>function(){return r},functionObjectAll=function(r,n){const e={},t=[];for(const o in r){const u=r[o],s="function"==typeof u?u(...n):u;isPromise(s)?t.push(s.then(curry3(objectSet,e,o,__))):e[o]=s}return 0==t.length?e:promiseAll(t).then(always(e))},_allValues=function(r){return isArray(r)?areAnyValuesPromises(r)?promiseAll(r):r:areAnyValuesPromises(r)?promiseObjectAll(r):r},all=function(...r){if(1==r.length){const n=r[0];return isPromise(n)?n.then(_allValues):areAllValuesNonfunctions(n)?_allValues(n):isArray(n)?curryArgs2(functionArrayAll,n,__):curryArgs2(functionObjectAll,n,__)}const n=r[r.length-1],e=r.slice(0,-1);return areAnyValuesPromises(e)?isArray(n)?promiseAll(e).then(curry2(functionArrayAll,n,__)):promiseAll(e).then(curry2(functionObjectAll,n,__)):isArray(n)?functionArrayAll(n,e):functionObjectAll(n,e)};all.series=function(...r){const n=r.pop();return 0==r.length?curryArgs2(functionArrayAllSeries,n,__):areAnyValuesPromises(r)?promiseAll(r).then(curry2(functionArrayAllSeries,n,__)):functionArrayAllSeries(n,r)};export default all;

package/dist/all.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/all.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/all.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/always.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/always.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 always=a=>function(){return a};export default always;

package/dist/always.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/always.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/always.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/and.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/and.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 promiseAll=Promise.all.bind(Promise),isPromise=r=>null!=r&&"function"==typeof r.then,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},__=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)},thunkConditional=(r,n,e)=>r?n():e(),areAllValuesNonfunctions=function(r){if(isArray(r)){const n=r.length;let e=-1;for(;++e<n;)if("function"==typeof r[e])return!1;return!0}for(const n in r)if("function"==typeof r[n])return!1;return!0},thunkify2=(r,n,e)=>function(){return r(n,e)},thunkify3=(r,n,e,t)=>function(){return r(n,e,t)},always=r=>function(){return r},areAllValuesTruthy=function(r,n){const e=r.length;for(;++n<e;){const e=r[n];if(isPromise(e))return e.then(curry3(thunkConditional,__,thunkify2(areAllValuesTruthy,r,n),always(!1)));if(!e)return!1}return!0},asyncArePredicatesAllTruthy=async function(r,n,e){const t=n.length;for(;++e<t;){let t=n[e];if("function"==typeof t&&(t=t(...r)),isPromise(t)&&(t=await t),!t)return!1}return!0},areAllPredicatesTruthy=function(r,n){const e=n.length;let t=-1;for(;++t<e;){let e=n[t];if("function"==typeof e&&(e=e(...r)),isPromise(e))return e.then(curry3(thunkConditional,__,thunkify3(asyncArePredicatesAllTruthy,r,n,t),always(!1)));if(!e)return!1}return!0},and=function(...r){const n=r.pop();return areAllValuesNonfunctions(n)?areAllValuesTruthy(n,-1):0==r.length?curryArgs2(areAllPredicatesTruthy,__,n):areAnyValuesPromises(r)?promiseAll(r).then(curry2(areAllPredicatesTruthy,__,n)):areAllPredicatesTruthy(r,n)};export default and;

package/dist/and.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/and.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/and.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/assign.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/assign.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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,objectAssign=Object.assign,__=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)},always=r=>function(){return r},promiseAll=Promise.all.bind(Promise),objectSet=function(r,n,e){return r[n]=e,r},functionObjectAll=function(r,n){const e={},t=[];for(const o in r){const s=r[o],u="function"==typeof s?s(...n):s;isPromise(u)?t.push(u.then(curry3(objectSet,e,o,__))):e[o]=u}return 0==t.length?e:promiseAll(t).then(always(e))},_assign=function(r,n){const e=functionObjectAll(n,[r]);return isPromise(e)?e.then(curry3(objectAssign,{},r,__)):{...r,...e}},assign=function(r,n){return null==n?curry2(_assign,__,r):isPromise(r)?r.then(curry2(_assign,__,n)):_assign(r,n)};export default assign;

package/dist/assign.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/assign.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/assign.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/compose.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 __ = Symbol.for('placeholder')

package/dist/compose.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 __=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)},promiseAll=Promise.all.bind(Promise),funcApply=(r,n)=>r(...n),isArray=Array.isArray,isPromise=r=>null!=r&&"function"==typeof r.then,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},funcConcat=(r,n)=>function(...e){const o=r(...e);return isPromise(o)?o.then(n):n(o)},compose=function(...r){if("function"==typeof r[0])return r.reduceRight(funcConcat);const n=r.pop().reduceRight(funcConcat);return 0==r.length?n:areAnyValuesPromises(r)?promiseAll(r).then(curry2(funcApply,n,__)):n(...r)};export default compose;

package/dist/compose.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/compose.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/compose.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 __ = Symbol.for('placeholder')

package/dist/curry.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 __ = Symbol.for('placeholder')

package/dist/curry.es.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 __=Symbol.for("placeholder"),_curryArity=(r,t,u)=>function(...n){const y=u.length,c=n.length,e=[];let i=-1,o=-1,f=0;for(;++i<y;){const y=u[i];if(y==__&&(o+=1)<c){const r=n[o];r==__&&(f+=1),e.push(r)}else e.push(y);if(e.length==r)return 0==f?t(...e):curryArity(r,t,e)}for(;++o<c;){const u=n[o];if(u==__&&(f+=1),e.push(u),e.length==r)return 0==f?t(...e):curryArity(r,t,e)}return curryArity(r,t,e)},curryArity=function(r,t,u){const n=u.length;if(n<r)return _curryArity(r,t,u);let y=-1;for(;++y<n;){if(u[y]==__)return _curryArity(r,t,u)}return t(...u)},curry=(r,...t)=>curryArity(r.length,r,t);curry.arity=function(r,t,...u){return curryArity(r,t,u)};export default curry;

package/dist/curry.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/curry.min.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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/curry.mjs

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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 __ = Symbol.for('placeholder')

package/dist/eq.es.js

@@ -1,7 +1,7 @@
 /**
- * rubico v2.7.7
+ * rubico v2.7.9
  * 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.
  */