rubico 2.5.0 → 2.6.1

package/dist/x/isFunction.mjs

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

package/dist/x/isIn.es.js

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

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

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

package/dist/x/isIn.js

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

package/dist/x/isIn.min.js

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

package/dist/x/isIn.mjs

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

package/dist/x/isObject.es.js

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

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

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

package/dist/x/isObject.js

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

package/dist/x/isObject.min.js

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

package/dist/x/isObject.mjs

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

package/dist/x/isString.es.js

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

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

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

package/dist/x/isString.js

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

package/dist/x/isString.min.js

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

package/dist/x/isString.mjs

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

package/dist/x/keys.es.js

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

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

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

package/dist/x/keys.js

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

package/dist/x/keys.min.js

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

package/dist/x/keys.mjs

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

package/dist/x/last.es.js

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

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

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

package/dist/x/last.js

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

package/dist/x/last.min.js

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

package/dist/x/last.mjs

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

package/dist/x/maxBy.es.js

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

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

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

package/dist/x/maxBy.js

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

package/dist/x/maxBy.min.js

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

package/dist/x/maxBy.mjs

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

package/dist/x/noop.es.js

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

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

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

package/dist/x/noop.js

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

package/dist/x/noop.min.js

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

package/dist/x/noop.mjs

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

package/dist/x/pluck.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.5.0
+ * rubico v2.6.1
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2024 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -74,35 +74,6 @@ const curry2 = function (baseFunc, arg0, arg1) {
     : curry2ResolveArg1(baseFunc, arg0)
 }
 
-const isArray = Array.isArray
-
-const isObject = value => {
-  if (value == null) {
-    return false
-  }
-
-  const typeofValue = typeof value
-  return (typeofValue == 'object') || (typeofValue == 'function')
-}
-
-const promiseAll = Promise.all.bind(Promise)
-
-const arrayMap = function (array, mapper) {
-  const arrayLength = array.length,
-    result = Array(arrayLength)
-  let index = -1,
-    isAsync = false
-
-  while (++index < arrayLength) {
-    const resultItem = mapper(array[index], index, array)
-    if (isPromise(resultItem)) {
-      isAsync = true
-    }
-    result[index] = resultItem
-  }
-  return isAsync ? promiseAll(result) : result
-}
-
 // argument resolver for curry3
 const curry3ResolveArg0 = (
   baseFunc, arg1, arg2,
@@ -134,6 +105,35 @@ const curry3 = function (baseFunc, arg0, arg1, arg2) {
   return curry3ResolveArg2(baseFunc, arg0, arg1)
 }
 
+const isArray = Array.isArray
+
+const isObject = value => {
+  if (value == null) {
+    return false
+  }
+
+  const typeofValue = typeof value
+  return (typeofValue == 'object') || (typeofValue == 'function')
+}
+
+const promiseAll = Promise.all.bind(Promise)
+
+const arrayMap = function (array, mapper) {
+  const arrayLength = array.length,
+    result = Array(arrayLength)
+  let index = -1,
+    isAsync = false
+
+  while (++index < arrayLength) {
+    const resultItem = mapper(array[index], index, array)
+    if (isPromise(resultItem)) {
+      isAsync = true
+    }
+    result[index] = resultItem
+  }
+  return isAsync ? promiseAll(result) : result
+}
+
 const callPropUnary = (value, property, arg0) => value[property](arg0)
 
 const stringMap = function (string, mapper) {
@@ -335,6 +335,7 @@ const objectMapSeries = function (object, f) {
         thunkify4(_objectMapSeriesAsync, object, f, result, doneKeys),
       ))
     }
+    result[key] = resultItem
   }
   return result
 }
@@ -433,15 +434,14 @@ const tapSync = func => function tapping(...args) {
 const promiseRace = Promise.race.bind(Promise)
 
 const arrayMapPoolAsync = async function (
-  array, mapper, concurrencyLimit, result, index, promises,
+  array, f, concurrencyLimit, result, index, promises,
 ) {
   const arrayLength = array.length
   while (++index < arrayLength) {
     if (promises.size >= concurrencyLimit) {
       await promiseRace(promises)
     }
-
-    const resultItem = mapper(array[index])
+    const resultItem = f(array[index])
     if (isPromise(resultItem)) {
       const selfDeletingPromise = resultItem.then(
         tapSync(() => promises.delete(selfDeletingPromise)))
@@ -454,13 +454,12 @@ const arrayMapPoolAsync = async function (
   return promiseAll(result)
 }
 
-const arrayMapPool = function (array, mapper, concurrentLimit) {
+const arrayMapPool = function (array, concurrency, f) {
   const arrayLength = array.length,
     result = Array(arrayLength)
   let index = -1
   while (++index < arrayLength) {
-
-    const resultItem = mapper(array[index])
+    const resultItem = f(array[index])
     if (isPromise(resultItem)) {
       const promises = new Set(),
         selfDeletingPromise = resultItem.then(
@@ -468,13 +467,167 @@ const arrayMapPool = function (array, mapper, concurrentLimit) {
       promises.add(selfDeletingPromise)
       result[index] = selfDeletingPromise
       return arrayMapPoolAsync(
-        array, mapper, concurrentLimit, result, index, promises)
+        array, f, concurrency, result, index, promises)
     }
     result[index] = resultItem
   }
   return result
 }
 
+const stringMapPool = function (s, concurrency, f) {
+  const result = arrayMapPool(s, concurrency, f)
+  return isPromise(result)
+    ? result.then(curry3(callPropUnary, __, 'join', ''))
+    : result.join('')
+}
+
+const _setMapPoolAsync = async function (
+  s, iterator, concurrency, f, result, promises,
+) {
+  let iteration = iterator.next()
+  while (!iteration.done) {
+    if (promises.size >= concurrency) {
+      await promiseRace(promises)
+    }
+    const resultItem = f(iteration.value, iteration.value, s)
+    if (isPromise(resultItem)) {
+      const selfDeletingPromise = resultItem.then(resolvedValue => {
+        promises.delete(selfDeletingPromise)
+        result.add(resolvedValue)
+      })
+      promises.add(selfDeletingPromise)
+    } else {
+      result.add(resultItem)
+    }
+    iteration = iterator.next()
+  }
+  if (promises.size > 0) {
+    await promiseAll(promises)
+  }
+  return result
+}
+
+const setMapPool = function (s, concurrency, f) {
+  const result = new Set()
+  const iterator = s[symbolIterator]()
+  let iteration = iterator.next()
+  while (!iteration.done) {
+    const resultItem = f(iteration.value, iteration.value, s)
+    if (isPromise(resultItem)) {
+      const promises = new Set()
+      const selfDeletingPromise = resultItem.then(resolvedValue => {
+        promises.delete(selfDeletingPromise)
+        result.add(resolvedValue)
+      })
+      promises.add(selfDeletingPromise)
+      return _setMapPoolAsync(s, iterator, concurrency, f, result, promises)
+    }
+    result.add(resultItem)
+    iteration = iterator.next()
+  }
+  return result
+}
+
+const _mapMapPoolAsync = async function (
+  m, iterator, concurrency, f, result, promises,
+) {
+  let iteration = iterator.next()
+  while (!iteration.done) {
+    if (promises.size >= concurrency) {
+      await promiseRace(promises)
+    }
+    const key = iteration.value[0]
+    const resultItem = f(iteration.value[1], key, m)
+    if (isPromise(resultItem)) {
+      result.set(key, resultItem)
+      const selfDeletingPromise = resultItem.then(resolvedValue => {
+        promises.delete(selfDeletingPromise)
+        result.set(key, resolvedValue)
+      })
+      promises.add(selfDeletingPromise)
+    } else {
+      result.set(key, resultItem)
+    }
+    iteration = iterator.next()
+  }
+  if (promises.size > 0) {
+    await promiseAll(promises)
+  }
+  return result
+}
+
+const mapMapPool = function (m, concurrency, f) {
+  const result = new Map()
+  const iterator = m[symbolIterator]()
+  let iteration = iterator.next()
+  while (!iteration.done) {
+    const key = iteration.value[0]
+    const resultItem = f(iteration.value[1], key, m)
+    if (isPromise(resultItem)) {
+      const promises = new Set()
+      result.set(key, resultItem)
+      const selfDeletingPromise = resultItem.then(resolvedValue => {
+        promises.delete(selfDeletingPromise)
+        result.set(key, resolvedValue)
+      })
+      promises.add(selfDeletingPromise)
+      return _mapMapPoolAsync(m, iterator, concurrency, f, result, promises)
+    }
+    result.set(key, resultItem)
+    iteration = iterator.next()
+  }
+  return result
+}
+
+const _objectMapPoolAsync = async function (
+  o, concurrency, f, result, doneKeys, promises,
+) {
+  for (const key in o) {
+    if (key in doneKeys) {
+      continue
+    }
+    if (promises.size >= concurrency) {
+      await promiseRace(promises)
+    }
+    const resultItem = f(o[key], key, o)
+    if (isPromise(resultItem)) {
+      result[key] = resultItem
+      const selfDeletingPromise = resultItem.then(resolvedValue => {
+        promises.delete(selfDeletingPromise)
+        result[key] = resolvedValue
+      })
+      promises.add(selfDeletingPromise)
+    } else {
+      result[key] = resultItem
+    }
+  }
+  if (promises.size > 0) {
+    await promiseAll(promises)
+  }
+  return result
+}
+
+const objectMapPool = function (o, concurrency, f) {
+  const result = {}
+  const doneKeys = {}
+  for (const key in o) {
+    doneKeys[key] = true
+    const resultItem = f(o[key], key, o)
+    if (isPromise(resultItem)) {
+      const promises = new Set()
+      result[key] = resultItem
+      const selfDeletingPromise = resultItem.then(resolvedValue => {
+        promises.delete(selfDeletingPromise)
+        result[key] = resolvedValue
+      })
+      promises.add(selfDeletingPromise)
+      return _objectMapPoolAsync(o, concurrency, f, result, doneKeys, promises)
+    }
+    result[key] = resultItem
+  }
+  return result
+}
+
 const _curryArity = (arity, func, args) => function curried(...curriedArgs) {
   const argsLength = args.length,
     curriedArgsLength = curriedArgs.length,
@@ -610,7 +763,7 @@ const _map = function (value, mapper) {
 }
 
 const map = function (arg0, arg1) {
-  if (typeof arg0 == 'function') {
+  if (arg1 == null) {
     return curry2(_map, __, arg0)
   }
   return isPromise(arg0)
@@ -633,7 +786,7 @@ const _mapEntries = (value, mapper) => {
 }
 
 map.entries = function mapEntries(arg0, arg1) {
-  if (typeof arg0 == 'function') {
+  if (arg1 == null) {
     return curry2(_mapEntries, __, arg0)
   }
   return isPromise(arg0)
@@ -665,7 +818,7 @@ const _mapSeries = function (collection, f) {
 }
 
 map.series = function mapSeries(arg0, arg1) {
-  if (typeof arg0 == 'function') {
+  if (arg1 == null) {
     return curry2(_mapSeries, __, arg0)
   }
   return isPromise(arg0)
@@ -673,11 +826,35 @@ map.series = function mapSeries(arg0, arg1) {
     : _mapSeries(arg0, arg1)
 }
 
-map.pool = (concurrencyLimit, mapper) => function concurrentPoolMapping(value) {
-  if (isArray(value)) {
-    return arrayMapPool(value, mapper, concurrencyLimit)
+const _mapPool = function (collection, concurrency, f) {
+  if (isArray(collection)) {
+    return arrayMapPool(collection, concurrency, f)
   }
-  throw new TypeError(`${value} is not an Array`)
+  if (collection == null) {
+    throw new TypeError(`invalid collection ${collection}`)
+  }
+  if (typeof collection == 'string' || collection.constructor == String) {
+    return stringMapPool(collection, concurrency, f)
+  }
+  if (collection.constructor == Set) {
+    return setMapPool(collection, concurrency, f)
+  }
+  if (collection.constructor == Map) {
+    return mapMapPool(collection, concurrency, f)
+  }
+  if (collection.constructor == Object) {
+    return objectMapPool(collection, concurrency, f)
+  }
+  throw new TypeError(`invalid collection ${collection}`)
+}
+
+map.pool = function mapPool(arg0, arg1, arg2) {
+  if (arg2 == null) {
+    return curry3(_mapPool, __, arg0, arg1)
+  }
+  return isPromise(arg0)
+    ? arg0.then(curry3(_mapPool, __, arg1, arg2))
+    : _mapPool(arg0, arg1, arg2)
 }
 
 const memoizeCappedUnary = function (func, cap) {