rubico 1.9.7 → 2.0.1

package/thunkify.js

@@ -1,3 +1,9 @@
+const areAnyValuesPromises = require('./_internal/areAnyValuesPromises')
+const promiseAll = require('./_internal/promiseAll')
+const curry2 = require('./_internal/curry2')
+const __ = require('./_internal/placeholder')
+const funcApply = require('./_internal/funcApply')
+
 /**
  * @name thunkify
  *
@@ -18,6 +24,9 @@
  * ```
  */
 const thunkify = (func, ...args) => function thunk() {
+  if (areAnyValuesPromises(args)) {
+    return promiseAll(args).then(curry2(funcApply, func, __))
+  }
   return func(...args)
 }
 

package/tmp.js

@@ -0,0 +1 @@
+require('.')

package/transform.js

@@ -3,6 +3,19 @@ const __ = require('./_internal/placeholder')
 const curry3 = require('./_internal/curry3')
 const genericTransform = require('./_internal/genericTransform')
 
+// _transform(collection any, transducer function, initialValue function|any) -> Promise
+const _transform = function (collection, transducer, initialValue) {
+  if (typeof initialValue == 'function') {
+    const actualInitialValue = initialValue(collection)
+    return isPromise(actualInitialValue)
+      ? actualInitialValue.then(curry3(genericTransform, collection, transducer, __))
+      : genericTransform(collection, transducer, actualInitialValue)
+  }
+  return isPromise(initialValue)
+    ? initialValue.then(curry3(genericTransform, collection, transducer, __))
+    : genericTransform(collection, transducer, initialValue)
+}
+
 /**
  * @name transform
  *
@@ -10,19 +23,25 @@ const genericTransform = require('./_internal/genericTransform')
  * ```coffeescript [specscript]
  * type Reducer = (result any, item any)=>(result any)
  * type Transducer = Reducer=>Reducer
- * type Semigroup = Array|String|Set|TypedArray|{ concat: function }|{ write: function }|Object
- * type Foldable = Iterable|AsyncIterable|Object
+ * type Transformable = Array|String|Set|TypedArray|{ concat: function }|{ write: function }|Object
+ * type Foldable = Iterable|AsyncIterable|Object<value any>
  *
- * initialValue Semigroup|((foldable Foldable)=>Promise|Semigroup)
+ * initialValue Transformable|((foldable Foldable)=>Promise|Transformable)
+ *
+ * transform(
+ *   foldable Foldable,
+ *   transducer Transducer,
+ *   initialValue? Transformable|(Foldable=>Promise|Transformable),
+ * ) -> result Promise|Transformable
  *
  * transform(
  *   transducer Transducer,
- *   initialValue?,
- * )(foldable Foldable) -> result Promise|Semigroup
+ *   initialValue? Transformable|(Foldable=>Promise|Transformable),
+ * )(foldable Foldable) -> result Promise|Transformable
  * ```
  *
  * @description
- * Transforms a semigroup collection into any other semigroup collection. The type of transformation depends on the collection provided by the initial value. If the initial is a function it is used as a resolver for the provided collection. `transform` accepts semigroup collections, or collections that support a concatenation operation:
+ * Transforms a transformable collection into any other transformable collection. The type of transformation depends on the collection provided by the initial value. If the initial is a function it is used as a resolver for the provided collection. `transform` accepts transformable collections, or collections that support a concatenation operation:
  *
  *  * `Array`; concatenation defined by `result.concat(values)`
  *  * `string`; concatenation defined by `result + values`
@@ -115,18 +134,14 @@ const genericTransform = require('./_internal/genericTransform')
  *
  * TODO explore Semigroup = Iterator|AsyncIterator
  */
-const transform = function (transducer, init) {
-  if (typeof init == 'function') {
-    return function transforming(...args) {
-      const result = init(...args)
-      return isPromise(result)
-        ? result.then(curry3(genericTransform, args, transducer, __))
-        : genericTransform(args, transducer, result)
-    }
+const transform = function (...args) {
+  if (typeof args[0] == 'function') {
+    return curry3(_transform, __, args[0], args[1])
   }
-  return function transforming(...args) {
-    return genericTransform(args, transducer, init)
+  if (isPromise(args[0])) {
+    return args[0].then(curry3(_transform, __, args[1], args[2]))
   }
+  return _transform(args[0], args[1], args[2])
 }
 
 module.exports = transform

package/tryCatch.js

@@ -1,7 +1,21 @@
 const isPromise = require('./_internal/isPromise')
+const promiseAll = require('./_internal/promiseAll')
 const __ = require('./_internal/placeholder')
 const curry3 = require('./_internal/curry3')
 const catcherApply = require('./_internal/catcherApply')
+const areAnyValuesPromises = require('./_internal/areAnyValuesPromises')
+
+// _tryCatch(tryer function, catcher function, args Array) -> Promise
+const _tryCatch = function (tryer, catcher, args) {
+  try {
+    const result = tryer(...args)
+    return isPromise(result)
+      ? result.catch(curry3(catcherApply, catcher, __, args))
+      : result
+  } catch (error) {
+    return catcher(error, ...args)
+  }
+}
 
 /**
  * @name tryCatch
@@ -53,27 +67,17 @@ const tryCatch = function (...args) {
   if (args.length > 2) {
     const catcher = args.pop(),
       tryer = args.pop()
-    try {
-      const result = tryer(...args)
-      return isPromise(result)
-        ? result.catch(curry3(catcherApply, catcher, __, args))
-        : result
-    } catch (error) {
-      return catcher(error, ...args)
+    if (areAnyValuesPromises(args)) {
+      return promiseAll(args)
+        .then(curry3(_tryCatch, tryer, catcher, __))
     }
+    return _tryCatch(tryer, catcher, args)
   }
 
   const tryer = args[0],
     catcher = args[1]
   return function tryCatcher(...args) {
-    try {
-      const result = tryer(...args)
-      return isPromise(result)
-        ? result.catch(curry3(catcherApply, catcher, __, args))
-        : result
-    } catch (error) {
-      return catcher(error, ...args)
-    }
+    return _tryCatch(tryer, catcher, args)
   }
 }
 

package/x/differenceWith.js

@@ -6,7 +6,7 @@ const thunkify5 = require('../_internal/thunkify5')
 const thunkConditional = require('../_internal/thunkConditional')
 const isPromise = require('../_internal/isPromise')
 const isArray = require('../_internal/isArray')
-const arrayAny = require('../_internal/arrayAny')
+const arraySome = require('../_internal/arraySome')
 const arrayPush = require('../_internal/arrayPush')
 const funcConcatSync = require('../_internal/funcConcatSync')
 const noop = require('../_internal/noop')
@@ -33,7 +33,7 @@ const differenceWithArrayAsync = async function (
   const allValuesLength = allValues.length
   while (++index < allValuesLength) {
     const item = allValues[index]
-    let doesItemExistByComparator = arrayAny(array, curry2(comparator, item, __))
+    let doesItemExistByComparator = arraySome(array, curry2(comparator, item, __))
     if (isPromise(doesItemExistByComparator)) {
       doesItemExistByComparator = await doesItemExistByComparator
     }
@@ -62,7 +62,7 @@ const differenceWithArray = function (comparator, allValues, array) {
   let index = -1
   while (++index < allValuesLength) {
     const item = allValues[index],
-      doesItemExistByComparator = arrayAny(array, curry2(comparator, item, __))
+      doesItemExistByComparator = arraySome(array, curry2(comparator, item, __))
     if (isPromise(doesItemExistByComparator)) {
       return doesItemExistByComparator.then(funcConcatSync(
         curry3(thunkConditional, __, noop, thunkify2(arrayPush, result, item)),

package/x/filterOut.test.js

@@ -40,13 +40,13 @@ describe('filterOut', () => {
 
   it('creates a rejecting generator function when passed a generator', () => {
     const rejectOdds = filterOut(number => number % 2 == 1)
-    const oddsRejectingGeneratorFunc = rejectOdds(function* (array) {
+    const oddsRejectingGenerator = rejectOdds((function* (array) {
       for (const value of array) {
         yield value
       }
-    })
+    })([1, 2, 3, 4, 5]))
     const evensArray = []
-    for (const number of oddsRejectingGeneratorFunc([1, 2, 3, 4, 5])) {
+    for (const number of oddsRejectingGenerator) {
       evensArray.push(number)
     }
     assert.deepEqual(evensArray, [2, 4])
@@ -54,13 +54,13 @@ describe('filterOut', () => {
 
   it('creates a rejecting generator function when passed an async generator', async () => {
     const asyncRejectOdds = filterOut(async number => number % 2 == 1)
-    const oddsRejectingGeneratorFunc = asyncRejectOdds(async function* (array) {
+    const oddsRejectingGenerator = asyncRejectOdds((async function* (array) {
       for (const value of array) {
         yield value
       }
-    })
+    })([1, 2, 3, 4, 5]))
     const evensArray = []
-    for await (const number of oddsRejectingGeneratorFunc([1, 2, 3, 4, 5])) {
+    for await (const number of oddsRejectingGenerator) {
       evensArray.push(number)
     }
     assert.deepEqual(evensArray, [2, 4])

package/x/flatten.js

@@ -74,7 +74,7 @@ const flatten = function (value) {
   if (value.constructor == Object) {
     return objectFlatten(value)
   }
-  return flatMap(identity)(value)
+  return flatMap(value, identity)
 }
 
 module.exports = flatten

package/x/flatten.test.js

@@ -34,12 +34,4 @@ describe('flatten', () => {
   it('flatten(undefined)', async () => {
     assert.strictEqual(flatten(undefined), undefined)
   })
-  it('flatteningReducer', async () => {
-    const add = (a, b) => a + b
-    const flatteningAdd = flatten(add)
-    assert.strictEqual(
-      [[1], [2], [3], [4], [5]].reduce(flatteningAdd, 0),
-      15,
-    )
-  })
 })

package/x/index.js

@@ -7,7 +7,6 @@ const find = require('./find')
 const findIndex = require('./findIndex')
 const first = require('./first')
 const flatten = require('./flatten')
-const forEach = require('./forEach')
 const groupBy = require('./groupBy')
 const has = require('./has')
 const identity = require('./identity')
@@ -43,7 +42,6 @@ const rubicoX = {
   findIndex,
   first,
   flatten,
-  forEach,
   groupBy,
   has,
   identity,

package/x/pluck.js

@@ -7,28 +7,19 @@ const get = require('../get')
  *
  * @synopsis
  * ```coffeescript [specscript]
- * Functor<T> = Array<T>|Object<T>|Iterator<T>|AsyncIterator<T>|{ map: T=>any }
- * Reducer<T> = (any, T)=>Promise|any
+ * pluck(path string)(array Array) -> result Array
  *
- * var T any,
- *   mapper T=>Promise|any,
- *   functor Functor<T>
- *   args ...any,
- *   generatorFunction ...args=>Generator<T>,
- *   asyncGeneratorFunction ...args=>AsyncGenerator<T>,
- *   reducer Reducer<T>
- *
- * pluck(functor) -> Promise|Functor
- *
- * pluck(generatorFunction) -> ...args=>Generator
- *
- * pluck(asyncGeneratorFunction) -> ...args=>AsyncGenerator
- *
- * pluck(reducer) -> Reducer
+ * pluck(array Array, path string) -> result Array
  * ```
  *
  * @description
- * Apply a getter denoted by path across all items of a collection, creating a new collection of plucked values. Also works in transducer position.
+ * Creates an array of picked properties denoted by a path from another array.
+ *
+ * `pluck` supports three types of path patterns for nested property access.
+ *
+ *  * dot delimited - `'a.b.c'`
+ *  * bracket notation - `'a[0].value'`
+ *  * an array of keys or indices - `['a', 0, 'value']`
  *
  * ```javascript [playground]
  * import pluck from 'https://unpkg.com/rubico/dist/x/pluck.es.js'
@@ -39,18 +30,18 @@ const get = require('../get')
  *   { name: 'Jim', age: 22 },
  * ]
  *
- * const usernames = pluck('name')(users)
+ * const usernames = pluck(users, 'name')
  *
  * console.log(usernames) // ['George', 'Jane', 'Jim']
- *
- * const add = (a, b) => a + b
- *
- * console.log(
- *   'total age:',
- *   users.reduce(pluck('age')(add), 0),
- * ) // total age: 96
  * ```
  */
-const pluck = funcConcat(get, map)
+const pluck = function (...args) {
+  const path = args.pop()
+  const getter = get(path)
+  if (args.length == 0) {
+    return map(getter)
+  }
+  return map(args[0], getter)
+}
 
 module.exports = pluck

package/x/pluck.test.js

@@ -5,17 +5,13 @@ const createAbc = v => ({ a: { b: { c: v } } })
 
 describe('pluck', () => {
   it('creates a new collection by getting a path from every item of an old collection', async () => {
+    const nested = [1, 2, 3].map(createAbc)
     assert.deepEqual(
-      pluck('a.b.c')([1, 2, 3].map(createAbc)),
+      pluck('a.b.c')(nested),
       [1, 2, 3],
     )
-  })
-  it('works in transducer position', async () => {
     assert.deepEqual(
-      [1, 2, 3].map(createAbc).reduce(
-        pluck('a.b.c')((a, b) => a.concat([b])),
-        [],
-      ),
+      pluck(nested, 'a.b.c'),
       [1, 2, 3],
     )
   })

package/x/timeInLoop.js

@@ -1,23 +1,22 @@
+const _timeInLoop = require('../_internal/timeInLoop')
+const timeInLoopAsync = require('../_internal/timeInLoopAsync')
+
 /**
  * @name timeInLoop
  *
  * @synopsis
  * timeInLoop(desc string, loopCount number, fn function) -> undefined
  *
- * @catchphrase
- * How long does a function take to run this many loops
+ * @description
+ * Logs the amount of time required for a function to run a certain number of times
+ *
+ * ```coffeescript [specscript]
+ * timeInLoop('hello', 1e6, () => 'hello') // hello: 1e+6: 3.474ms
+ * ```
  *
- * @example
- * timeInLoop('yo', 1e6, () => 'yo') // yo: 1e+6: 3.474ms
+ * Reference: https://gist.github.com/funfunction/91b5876a5f562e1e352aed0fcabc3858
  */
-const timeInLoop = (desc, loopCount, fn) => {
-  const d = `${desc}: ${loopCount.toExponential()}`
-  console.time(d)
-  for (let i = 0; i < loopCount; i++) {
-    fn()
-  }
-  console.timeEnd(d)
-}
+const timeInLoop = _timeInLoop
 
 /**
  * @name timeInLoop.async
@@ -25,21 +24,13 @@ const timeInLoop = (desc, loopCount, fn) => {
  * @synopsis
  * timeInLoop.async(desc string, loopCount number, fn function) -> undefined
  *
- * @catchphrase
+ * @description
  * Like timeInLoop, but every call is awaited
  *
- * @example
- * timeInLoop.async('asyncYo', 1e6, async () => 'yo') // asyncYo: 1e+6: 116.006ms
+ * ```coffeescript [specscript]
+ * timeInLoop.async('async hello', 1e6, async () => 'hello') // async hello: 1e+6: 116.006ms
+ * ```
  */
-timeInLoop.async = async (desc, loopCount, fn) => {
-  const d = `${desc}: ${loopCount.toExponential()}`
-  console.time(d)
-  for (let i = 0; i < loopCount; i++) {
-    await fn()
-  }
-  console.timeEnd(d)
-}
+timeInLoop.async = timeInLoopAsync
 
 module.exports = timeInLoop
-
-// thanks: https://gist.github.com/funfunction/91b5876a5f562e1e352aed0fcabc3858

package/x/timeInLoop.test.js

@@ -3,14 +3,18 @@ const timeInLoop = require('./timeInLoop')
 
 describe('timeInLoop', () => {
   it('timeInLoop(desc string, loopCount number, fn function) -> y undefined', async () => {
-    const y = timeInLoop('hey', 1e5, () => 'hey')
-    assert.strictEqual(y, undefined)
+    const result = timeInLoop('hey', 1e5, () => 'hey')
+    assert.equal(result.description, 'hey')
+    assert.equal(result.loopCount, 1e5)
+    assert.equal(typeof result.duration, 'number')
   })
 
   it('timeInLoop.async(desc string, loopCount number, fn function) -> y undefined', async () => {
     const p = timeInLoop.async('asyncHey', 1e5, async () => 'asyncHey')
     assert(p instanceof Promise)
-    const y = await p
-    assert.strictEqual(y, undefined)
+    const result = await p
+    assert.equal(result.description, 'asyncHey')
+    assert.equal(result.loopCount, 1e5)
+    assert.equal(typeof result.duration, 'number')
   })
 })

package/any.js

@@ -1,82 +0,0 @@
-const isArray = require('./_internal/isArray')
-const objectValues = require('./_internal/objectValues')
-const arrayAny = require('./_internal/arrayAny')
-const iteratorAny = require('./_internal/iteratorAny')
-const asyncIteratorAny = require('./_internal/asyncIteratorAny')
-const reducerAny = require('./_internal/reducerAny')
-const symbolIterator = require('./_internal/symbolIterator')
-const symbolAsyncIterator = require('./_internal/symbolAsyncIterator')
-
-/**
- * @name any
- *
- * @synopsis
- * ```coffeescript [specscript]
- * type Foldable = Iterable|AsyncIterable|Object
- *
- * any(predicate function)(collection Foldable) -> result Promise|boolean
- * ```
- *
- * @description
- * Test a predicate concurrently across all items of a collection, returning true if any executions return truthy.
- *
- * ```javascript [playground]
- * const isOdd = number => number % 2 == 1
- *
- * console.log(
- *   any(isOdd)([1, 2, 3, 4, 5]),
- * ) // true
- * ```
- *
- * The collection can be any iterable, async iterable, or object values iterable collection. Below is an example of `any` accepting an async generator as the collection.
- *
- * ```javascript [playground]
- * const toTodosUrl = id => 'https://jsonplaceholder.typicode.com/todos/' + id
- *
- * const fetchedToJson = fetched => fetched.json()
- *
- * const fetchTodo = pipe([
- *   toTodosUrl,
- *   fetch,
- *   fetchedToJson,
- * ])
- *
- * const todoIDsGenerator = async function* () {
- *   yield 1; yield 2; yield 3; yield 4; yield 5
- * }
- *
- * any(pipe([
- *   fetchTodo,
- *   todo => todo.title.startsWith('fugiat'),
- * ]))(todoIDsGenerator()).then(console.log) // true
- * ```
- *
- * @execution concurrent
- *
- * @muxing
- *
- * @related or
- */
-const any = predicate => function anyTruthy(value) {
-  if (isArray(value)) {
-    return arrayAny(value, predicate)
-  }
-  if (value == null) {
-    return predicate(value)
-  }
-  if (typeof value[symbolIterator] == 'function') {
-    return iteratorAny(value[symbolIterator](), predicate)
-  }
-  if (typeof value[symbolAsyncIterator] == 'function') {
-    return asyncIteratorAny(value[symbolAsyncIterator](), predicate, new Set())
-  }
-  if (typeof value.reduce == 'function') {
-    return value.reduce(reducerAny(predicate), false)
-  }
-  if (value.constructor == Object) {
-    return arrayAny(objectValues(value), predicate)
-  }
-  return predicate(value)
-}
-
-module.exports = any

package/dist/__.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const __=Symbol.for("placeholder");export default __;

package/dist/all.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isArray=Array.isArray,__=Symbol.for("placeholder"),curry3ResolveArg0=(r,e,t)=>function(o){return r(o,e,t)},curry3ResolveArg1=(r,e,t)=>function(o){return r(e,o,t)},curry3ResolveArg2=(r,e,t)=>function(o){return r(e,t,o)},curry3=function(r,e,t,o){return e==__?curry3ResolveArg0(r,t,o):t==__?curry3ResolveArg1(r,e,o):curry3ResolveArg2(r,e,t)},isPromise=r=>null!=r&&"function"==typeof r.then,promiseAll=Promise.all.bind(Promise),callPropUnary=(r,e,t)=>r[e](t),arrayAll=function(r,e){const t=r.length,o=[];let n=-1;for(;++n<t;){const t=e(r[n]);if(isPromise(t))o.push(t);else if(!t)return!1}return 0==o.length||promiseAll(o).then(curry3(callPropUnary,__,"every",Boolean))},iteratorAll=function(r,e){const t=[];for(const o of r){const r=e(o);if(isPromise(r))t.push(r);else if(!r)return!1}return 0==t.length||promiseAll(t).then(curry3(callPropUnary,__,"every",Boolean))},SelfReferencingPromise=function(r){const e=r.then((r=>[r,e]));return e},promiseRace=Promise.race.bind(Promise),asyncIteratorAll=async function(r,e,t,o=20){let n=await r.next();for(;!n.done;){if(t.size>=o){const[r,e]=await promiseRace(t);if(t.delete(e),!r)return!1}const l=e(n.value);if(isPromise(l))t.add(SelfReferencingPromise(l));else if(!l)return!1;n=await r.next()}for(;t.size>0;){const[r,e]=await promiseRace(t);if(t.delete(e),!r)return!1}return!0},objectValues=Object.values,reducerAllSync=(r,e,t)=>!!e&&r(t),reducerAll=r=>function(e,t){return!1!==e&&(isPromise(e)?e.then(curry3(reducerAllSync,r,__,t)):!!e&&r(t))},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,all=r=>function(e){return isArray(e)?arrayAll(e,r):null==e?r(e):"function"==typeof e[symbolIterator]?iteratorAll(e[symbolIterator](),r):"function"==typeof e[symbolAsyncIterator]?asyncIteratorAll(e[symbolAsyncIterator](),r,new Set):"function"==typeof e.reduce?e.reduce(reducerAll(r),!0):e.constructor==Object?arrayAll(objectValues(e),r):r(e)};export default all;

package/dist/always.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const always=a=>function(){return a};export default always;

package/dist/and.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isPromise=n=>null!=n&&"function"==typeof n.then,__=Symbol.for("placeholder"),curry3ResolveArg0=(n,r,t)=>function(e){return n(e,r,t)},curry3ResolveArg1=(n,r,t)=>function(e){return n(r,e,t)},curry3ResolveArg2=(n,r,t)=>function(e){return n(r,t,e)},curry3=function(n,r,t,e){return r==__?curry3ResolveArg0(n,t,e):t==__?curry3ResolveArg1(n,r,e):curry3ResolveArg2(n,r,t)},thunkConditional=(n,r,t)=>n?r():t(),areAllValuesNonfunctions=function(n){const r=n.length;let t=-1;for(;++t<r;)if("function"==typeof n[t])return!1;return!0},thunkify2=(n,r,t)=>function(){return n(r,t)},thunkify3=(n,r,t,e)=>function(){return n(r,t,e)},always=n=>function(){return n},areAllNonfunctionsTruthy=function(n,r){const t=n.length;for(;++r<t;){let t=n[r];if(isPromise(t))return t.then(curry3(thunkConditional,__,thunkify2(areAllNonfunctionsTruthy,n,r),always(!1)));if(!t)return!1}return!0},asyncArePredicatesAllTruthy=async function(n,r,t){const e=n.length;for(;++t<e;){let e=n[t];if("function"==typeof e&&(e=e(r)),isPromise(e)&&(e=await e),!e)return!1}return!0},and=n=>areAllValuesNonfunctions(n)?areAllNonfunctionsTruthy(n,-1):function(r){const t=n.length;let e=-1;for(;++e<t;){let t=n[e];if("function"==typeof t&&(t=t(r)),isPromise(t))return t.then(curry3(thunkConditional,__,thunkify3(asyncArePredicatesAllTruthy,n,r,e),always(!1)));if(!t)return!1}return!0};export default and;

package/dist/any.es.min.js

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isArray=Array.isArray,objectValues=Object.values,SelfReferencingPromise=function(r){const e=r.then((r=>[r,e]));return e},isPromise=r=>null!=r&&"function"==typeof r.then,promiseRace=Promise.race.bind(Promise),asyncArrayAny=async function(r,e,n,t){const o=r.length;for(;++n<o;){const o=e(r[n]);if(isPromise(o))t.add(SelfReferencingPromise(o));else if(o)return!0}for(;t.size>0;){const[r,e]=await promiseRace(t);if(t.delete(e),r)return!0}return!1},arrayAny=function(r,e){const n=r.length;let t=-1;for(;++t<n;){const n=e(r[t]);if(isPromise(n))return asyncArrayAny(r,e,t,new Set([SelfReferencingPromise(n)]));if(n)return!0}return!1},asyncIteratorAny=async function(r,e,n,t=20){let o=r.next();for(isPromise(o)&&(o=await o);!o.done;){if(n.size>=t){const[r,e]=await promiseRace(n);if(n.delete(e),r)return!0}const i=e(o.value);if(isPromise(i))n.add(SelfReferencingPromise(i));else if(i)return!0;o=r.next(),isPromise(o)&&(o=await o)}for(;n.size>0;){const[r,e]=await promiseRace(n);if(n.delete(e),r)return!0}return!1},iteratorAny=function(r,e){for(const n of r){const t=e(n);if(isPromise(t))return asyncIteratorAny(r,e,new Set([SelfReferencingPromise(t)]));if(t)return!0}return!1},reducerAnySync=r=>function(e,n){return!!e||r(n)},__=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)},reducerAny=r=>function(e,n){return!0===e?e:isPromise(e)?e.then((t=reducerAnySync(r),i=n,(o=__)==__?curry2ResolveArg0(t,i):curry2ResolveArg1(t,o))):!!e||r(n);var t,o,i},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,any=r=>function(e){return isArray(e)?arrayAny(e,r):null==e?r(e):"function"==typeof e[symbolIterator]?iteratorAny(e[symbolIterator](),r):"function"==typeof e[symbolAsyncIterator]?asyncIteratorAny(e[symbolAsyncIterator](),r,new Set):"function"==typeof e.reduce?e.reduce(reducerAny(r),!1):e.constructor==Object?arrayAny(objectValues(e),r):r(e)};export default any;

package/dist/any.min.js

@@ -1,8 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 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.any=n}("object"==typeof globalThis?globalThis:this,function(){"use strict";const t=Array.isArray,n=Object.values,e=function(t){const n=t.then((t=>[t,n]));return n},r=t=>null!=t&&"function"==typeof t.then,o=Promise.race.bind(Promise),i=async function(t,n,i,u){const f=t.length;for(;++i<f;){const o=n(t[i]);if(r(o))u.add(e(o));else if(o)return!0}for(;u.size>0;){const[t,n]=await o(u);if(u.delete(n),t)return!0}return!1},u=function(t,n){const o=t.length;let u=-1;for(;++u<o;){const o=n(t[u]);if(r(o))return i(t,n,u,new Set([e(o)]));if(o)return!0}return!1},f=async function(t,n,i,u=20){let f=t.next();for(r(f)&&(f=await f);!f.done;){if(i.size>=u){const[t,n]=await o(i);if(i.delete(n),t)return!0}const c=n(f.value);if(r(c))i.add(e(c));else if(c)return!0;f=t.next(),r(f)&&(f=await f)}for(;i.size>0;){const[t,n]=await o(i);if(i.delete(n),t)return!0}return!1},c=Symbol.for("placeholder"),s=t=>function(n,e){return!0===n?n:r(n)?n.then((o=(t=>function(n,e){return!!n||t(e)})(t),u=e,(i=c)==c?((t,n)=>function(e){return t(e,n)})(o,u):((t,n)=>function(e){return t(n,e)})(o,i))):!!n||t(e);var o,i,u},a=Symbol.iterator,l=Symbol.asyncIterator;return o=>function(i){return t(i)?u(i,o):null==i?o(i):"function"==typeof i[a]?function(t,n){for(const o of t){const i=n(o);if(r(i))return f(t,n,new Set([e(i)]));if(i)return!0}return!1}(i[a](),o):"function"==typeof i[l]?f(i[l](),o,new Set):"function"==typeof i.reduce?i.reduce(s(o),!1):i.constructor==Object?u(n(i),o):o(i)}}());

package/dist/any.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const isArray=Array.isArray,objectValues=Object.values,SelfReferencingPromise=function(r){const e=r.then((r=>[r,e]));return e},isPromise=r=>null!=r&&"function"==typeof r.then,promiseRace=Promise.race.bind(Promise),asyncArrayAny=async function(r,e,n,t){const o=r.length;for(;++n<o;){const o=e(r[n]);if(isPromise(o))t.add(SelfReferencingPromise(o));else if(o)return!0}for(;t.size>0;){const[r,e]=await promiseRace(t);if(t.delete(e),r)return!0}return!1},arrayAny=function(r,e){const n=r.length;let t=-1;for(;++t<n;){const n=e(r[t]);if(isPromise(n))return asyncArrayAny(r,e,t,new Set([SelfReferencingPromise(n)]));if(n)return!0}return!1},asyncIteratorAny=async function(r,e,n,t=20){let o=r.next();for(isPromise(o)&&(o=await o);!o.done;){if(n.size>=t){const[r,e]=await promiseRace(n);if(n.delete(e),r)return!0}const i=e(o.value);if(isPromise(i))n.add(SelfReferencingPromise(i));else if(i)return!0;o=r.next(),isPromise(o)&&(o=await o)}for(;n.size>0;){const[r,e]=await promiseRace(n);if(n.delete(e),r)return!0}return!1},iteratorAny=function(r,e){for(const n of r){const t=e(n);if(isPromise(t))return asyncIteratorAny(r,e,new Set([SelfReferencingPromise(t)]));if(t)return!0}return!1},reducerAnySync=r=>function(e,n){return!!e||r(n)},__=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)},reducerAny=r=>function(e,n){return!0===e?e:isPromise(e)?e.then((t=reducerAnySync(r),i=n,(o=__)==__?curry2ResolveArg0(t,i):curry2ResolveArg1(t,o))):!!e||r(n);var t,o,i},symbolIterator=Symbol.iterator,symbolAsyncIterator=Symbol.asyncIterator,any=r=>function(e){return isArray(e)?arrayAny(e,r):null==e?r(e):"function"==typeof e[symbolIterator]?iteratorAny(e[symbolIterator](),r):"function"==typeof e[symbolAsyncIterator]?asyncIteratorAny(e[symbolAsyncIterator](),r,new Set):"function"==typeof e.reduce?e.reduce(reducerAny(r),!1):e.constructor==Object?arrayAny(objectValues(e),r):r(e)};export default any;

package/dist/assign.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 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"),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},funcObjectAll=r=>function(...n){const e={},t=[];for(const o in r){const c=r[o](...n);isPromise(c)?t.push(c.then(curry3(objectSet,e,o,__))):e[o]=c}return 0==t.length?e:promiseAll(t).then((o=e,function(){return o}));var o},assign=function(r){const n=funcObjectAll(r);return function(r){const e=n(r);return isPromise(e)?e.then(curry3(objectAssign,{},r,__)):{...r,...e}}};export default assign;

package/dist/curry.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 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/eq.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 Richard Tong
- * rubico may be freely distributed under the MIT license.
- */
-const spread2=e=>function([r,n]){return e(r,n)},isPromise=e=>null!=e&&"function"==typeof e.then,promiseAll=Promise.all.bind(Promise),sameValueZero=function(e,r){return e===r||e!=e&&r!=r},__=Symbol.for("placeholder"),curry2ResolveArg0=(e,r)=>function(n){return e(n,r)},curry2ResolveArg1=(e,r)=>function(n){return e(r,n)},curry2=function(e,r,n){return r==__?curry2ResolveArg0(e,n):curry2ResolveArg1(e,r)},always=e=>function(){return e},eq=function(e,r){const n="function"==typeof e,o="function"==typeof r;return n&&o?function(n){const o=e(n),u=r(n),t=isPromise(o),s=isPromise(u);return t&&s?promiseAll([o,u]).then((c=sameValueZero,function([e,r]){return c(e,r)})):t?o.then(curry2(sameValueZero,__,u)):s?u.then(curry2(sameValueZero,o,__)):sameValueZero(o,u);var c}:n?function(n){const o=e(n);return isPromise(o)?o.then(curry2(sameValueZero,__,r)):sameValueZero(o,r)}:o?function(n){const o=r(n);return isPromise(o)?o.then(curry2(sameValueZero,e,__)):sameValueZero(e,o)}:sameValueZero(e,r)};export default eq;

package/dist/filter.min.mjs

@@ -1,7 +0,0 @@
-/**
- * rubico v1.9.7
- * https://github.com/a-synchronous/rubico
- * (c) 2019-2021 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,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,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],c=t(n);if(isPromise(c))return promiseAll(arrayExtendMap([c],r,t,o)).then(curry4(arrayFilterByConditions,r,e,o-1,__));c&&(e[++i]=n)}return e},generatorFunctionFilter=(r,t)=>function*(...n){yield*FilteringIterator(r(...n),t)},asyncGeneratorFunctionFilter=(r,t)=>async function*(...n){yield*FilteringAsyncIterator(r(...n),t)},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)},thunkify2=(r,t,n)=>function(){return r(t,n)},thunkConditional=(r,t,n)=>r?t():n(),always=r=>function(){return r},reducerFilter=(r,t)=>function(n,e){const o=t(e);return isPromise(o)?o.then(curry3(thunkConditional,__,(i=r,c=n,u=e,function(){return i(c,u)}),always(n))):o?r(n,e):n;var i,c,u},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("")},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 c=t(i,i,r);isPromise(c)?o.push(c.then(curry3(thunkConditional,__,thunkify1(e,i),noop))):c&&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 c=t(i,o,r);isPromise(c)?e.push(c.then(curry3(thunkConditional,__,thunkify4(callPropBinary,n,"set",o,i),noop))):c&&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],c=t(i,o,r);isPromise(c)?e.push(c.then(curry4(objectSetIf,n,o,r[o],__))):c&&(n[o]=i)}return 0==e.length?n:promiseAll(e).then(always(n))},arrayExtendMapWithIndex=function(r,t,n,e){const o=t.length;let i=r.length-1;for(;++e<o;)r[++i]=n(t[e],e,t);return r},arrayFilterWithIndex=function(r,t){const n=r.length,e=[];let o=-1,i=-1;for(;++o<n;){const n=r[o],c=t(n,o,r);if(isPromise(c))return promiseAll(arrayExtendMapWithIndex([c],r,t,o)).then(curry4(arrayFilterByConditions,r,e,o-1,__));c&&(e[++i]=n)}return e},_filter=function(r,t){return isArray(r)?arrayFilter(r,t):"function"==typeof r?isGeneratorFunction(r)?generatorFunctionFilter(r,t):isAsyncGeneratorFunction(r)?asyncGeneratorFunctionFilter(r,t):reducerFilter(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){const t=r.pop();return r.length>0?_filter(r[0],t):(n=_filter,o=t,(e=__)==__?curry2ResolveArg0(n,o):curry2ResolveArg1(n,e));var n,e,o};filter.withIndex=r=>function(t){if(isArray(t))return arrayFilterWithIndex(t,r);throw new TypeError(`${t} is not an Array`)};export default filter;