rubico 2.7.3 → 2.7.5

package/dist/x/flatten.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.7.3
+ * rubico v2.7.5
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2025 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -52,8 +52,8 @@ const funcConcatSync = (
 
 const asyncIteratorForEach = async function (asyncIterator, callback) {
   const promises = []
-  for await (const item of asyncIterator) {
-    const operation = callback(item)
+  for await (const element of asyncIterator) {
+    const operation = callback(element)
     if (isPromise(operation)) {
       promises.push(operation)
     }
@@ -73,44 +73,44 @@ const arrayFlatten = function (array) {
   let index = -1
 
   while (++index < length) {
-    const item = array[index]
-    if (isArray(item)) {
-      const itemLength = item.length
-      let itemIndex = -1
-      while (++itemIndex < itemLength) {
-        result.push(item[itemIndex])
+    const element = array[index]
+    if (isArray(element)) {
+      const elementLength = element.length
+      let elementIndex = -1
+      while (++elementIndex < elementLength) {
+        result.push(element[elementIndex])
       }
-    } else if (item == null) {
-      result.push(item)
-    } else if (typeof item.then == 'function') {
-      promises.push(item.then(curry2(arrayPush, result, __)))
-    } else if (typeof item[symbolIterator] == 'function') {
-      for (const subItem of item) {
-        result.push(subItem)
+    } else if (element == null) {
+      result.push(element)
+    } else if (typeof element.then == 'function') {
+      promises.push(element.then(curry2(arrayPush, result, __)))
+    } else if (typeof element[symbolIterator] == 'function') {
+      for (const subElement of element) {
+        result.push(subElement)
       }
-    } else if (typeof item[symbolAsyncIterator] == 'function') {
+    } else if (typeof element[symbolAsyncIterator] == 'function') {
       promises.push(asyncIteratorForEach(
-        item[symbolAsyncIterator](), curry2(arrayPush, result, __)))
-    } else if (typeof item.chain == 'function') {
-      const monadValue = item.chain(identity)
+        element[symbolAsyncIterator](), curry2(arrayPush, result, __)))
+    } else if (typeof element.chain == 'function') {
+      const monadValue = element.chain(identity)
       isPromise(monadValue)
         ? promises.push(monadValue.then(curry2(arrayPush, result, __)))
         : result.push(monadValue)
-    } else if (typeof item.flatMap == 'function') {
-      const monadValue = item.flatMap(identity)
+    } else if (typeof element.flatMap == 'function') {
+      const monadValue = element.flatMap(identity)
       isPromise(monadValue)
         ? promises.push(monadValue.then(curry2(arrayPush, result, __)))
         : result.push(monadValue)
-    } else if (typeof item.reduce == 'function') {
-      const folded = item.reduce(funcConcatSync(
+    } else if (typeof element.reduce == 'function') {
+      const folded = element.reduce(funcConcatSync(
         getArg1, curry2(arrayPush, result, __)), null)
       isPromise(folded) && promises.push(folded)
-    } else if (item.constructor == Object) {
-      for (const key in item) {
-        result.push(item[key])
+    } else if (element.constructor == Object) {
+      for (const key in element) {
+        result.push(element[key])
       }
     } else {
-      result.push(item)
+      result.push(element)
     }
   }
   return promises.length == 0
@@ -155,45 +155,45 @@ const setFlatten = function (set) {
   const size = set.size,
     promises = [],
     result = new Set(),
-    resultAddReducer = (_, subItem) => result.add(subItem),
+    resultAddReducer = (_, subElement) => result.add(subElement),
     resultAdd = curry3(callPropUnary, result, 'add', __),
     getResult = () => result
 
-  for (const item of set) {
-    if (isArray(item)) {
-      const itemLength = item.length
-      let itemIndex = -1
-      while (++itemIndex < itemLength) {
-        result.add(item[itemIndex])
+  for (const element of set) {
+    if (isArray(element)) {
+      const elementLength = element.length
+      let elementIndex = -1
+      while (++elementIndex < elementLength) {
+        result.add(element[elementIndex])
       }
-    } else if (item == null) {
-      result.add(item)
-    } else if (typeof item[symbolIterator] == 'function') {
-      for (const subItem of item) {
-        result.add(subItem)
+    } else if (element == null) {
+      result.add(element)
+    } else if (typeof element[symbolIterator] == 'function') {
+      for (const subElement of element) {
+        result.add(subElement)
       }
-    } else if (typeof item[symbolAsyncIterator] == 'function') {
+    } else if (typeof element[symbolAsyncIterator] == 'function') {
       promises.push(
-        asyncIteratorForEach(item[symbolAsyncIterator](), resultAdd))
-    } else if (typeof item.chain == 'function') {
-      const monadValue = item.chain(identity)
+        asyncIteratorForEach(element[symbolAsyncIterator](), resultAdd))
+    } else if (typeof element.chain == 'function') {
+      const monadValue = element.chain(identity)
       isPromise(monadValue)
         ? promises.push(monadValue.then(resultAdd))
         : result.add(monadValue)
-    } else if (typeof item.flatMap == 'function') {
-      const monadValue = item.flatMap(identity)
+    } else if (typeof element.flatMap == 'function') {
+      const monadValue = element.flatMap(identity)
       isPromise(monadValue)
         ? promises.push(monadValue.then(resultAdd))
         : result.add(monadValue)
-    } else if (typeof item.reduce == 'function') {
-      const folded = item.reduce(resultAddReducer, null)
+    } else if (typeof element.reduce == 'function') {
+      const folded = element.reduce(resultAddReducer, null)
       isPromise(folded) && promises.push(folded)
-    } else if (item.constructor == Object) {
-      for (const key in item) {
-        result.add(item[key])
+    } else if (element.constructor == Object) {
+      for (const key in element) {
+        result.add(element[key])
       }
     } else {
-      result.add(item)
+      result.add(element)
     }
   }
   return promises.length == 0 ? result : promiseAll(promises).then(getResult)
@@ -209,31 +209,31 @@ const objectFlatten = function (object) {
     getResult = () => result
 
   for (const key in object) {
-    const item = object[key]
-    if (item == null) {
+    const element = object[key]
+    if (element == null) {
       continue
-    } else if (typeof item[symbolIterator] == 'function') {
-      for (const monadItem of item) {
-        objectAssign(result, monadItem)
+    } else if (typeof element[symbolIterator] == 'function') {
+      for (const monadElement of element) {
+        objectAssign(result, monadElement)
       }
-    } else if (typeof item[symbolAsyncIterator] == 'function') {
+    } else if (typeof element[symbolAsyncIterator] == 'function') {
       promises.push(
-        asyncIteratorForEach(item[symbolAsyncIterator](), resultAssign))
-    } else if (typeof item.chain == 'function') {
-      const monadValue = item.chain(identity)
+        asyncIteratorForEach(element[symbolAsyncIterator](), resultAssign))
+    } else if (typeof element.chain == 'function') {
+      const monadValue = element.chain(identity)
       isPromise(monadValue)
         ? promises.push(monadValue.then(resultAssign))
         : objectAssign(result, monadValue)
-    } else if (typeof item.flatMap == 'function') {
-      const monadValue = item.flatMap(identity)
+    } else if (typeof element.flatMap == 'function') {
+      const monadValue = element.flatMap(identity)
       isPromise(monadValue)
         ? promises.push(monadValue.then(resultAssign))
         : resultAssign(monadValue)
-    } else if (typeof item.reduce == 'function') {
-      const folded = item.reduce(resultAssignReducer, null)
+    } else if (typeof element.reduce == 'function') {
+      const folded = element.reduce(resultAssignReducer, null)
       isPromise(folded) && promises.push(folded)
     } else {
-      objectAssign(result, item)
+      objectAssign(result, element)
     }
   }
   return promises.length == 0
@@ -526,11 +526,11 @@ const mapReduce = function (map, reducer, result) {
 
 const reducerConcat = (
   reducerA, reducerB,
-) => function pipedReducer(result, item) {
-  const intermediate = reducerA(result, item)
+) => function pipedReducer(result, element) {
+  const intermediate = reducerA(result, element)
   return isPromise(intermediate)
-    ? intermediate.then(curry2(reducerB, __, item))
-    : reducerB(intermediate, item)
+    ? intermediate.then(curry2(reducerB, __, element))
+    : reducerB(intermediate, element)
 }
 
 const genericReduce = function (collection, reducer, result) {
@@ -592,7 +592,7 @@ const FlatMappingIterator = function (iterator, flatMapper) {
       const monadAsArray = genericReduce(
         flatMapper(iteration.value),
         arrayPush,
-        []) // this will always have at least one item
+        []) // this will always have at least one element
       if (monadAsArray.length > 1) {
         buffer = monadAsArray
         bufferIndex = 1
@@ -668,11 +668,11 @@ const arrayMap = function (array, mapper) {
     isAsync = false
 
   while (++index < arrayLength) {
-    const resultItem = mapper(array[index], index, array)
-    if (isPromise(resultItem)) {
+    const resultElement = mapper(array[index], index, array)
+    if (isPromise(resultElement)) {
       isAsync = true
     }
-    result[index] = resultItem
+    result[index] = resultElement
   }
   return isAsync ? promiseAll(result) : result
 }
@@ -713,11 +713,11 @@ const objectMap = function (object, mapper) {
   const result = {}
   let isAsync = false
   for (const key in object) {
-    const resultItem = mapper(object[key], key, object)
-    if (isPromise(resultItem)) {
+    const resultElement = mapper(object[key], key, object)
+    if (isPromise(resultElement)) {
       isAsync = true
     }
-    result[key] = resultItem
+    result[key] = resultElement
   }
   return isAsync ? promiseObjectAll(result) : result
 }
@@ -732,12 +732,12 @@ const objectFlatMap = function (object, flatMapper) {
 const setMap = function (set, mapper) {
   const result = new Set(),
     promises = []
-  for (const item of set) {
-    const resultItem = mapper(item, item, set)
-    if (isPromise(resultItem)) {
-      promises.push(resultItem.then(curry3(callPropUnary, result, 'add', __)))
+  for (const element of set) {
+    const resultElement = mapper(element, element, set)
+    if (isPromise(resultElement)) {
+      promises.push(resultElement.then(curry3(callPropUnary, result, 'add', __)))
     } else {
-      result.add(resultItem)
+      result.add(resultElement)
     }
   }
   return promises.length == 0

package/dist/x/groupBy.es.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.7.3
+ * rubico v2.7.5
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2025 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -353,11 +353,11 @@ const mapReduce = function (map, reducer, result) {
 
 const reducerConcat = (
   reducerA, reducerB,
-) => function pipedReducer(result, item) {
-  const intermediate = reducerA(result, item)
+) => function pipedReducer(result, element) {
+  const intermediate = reducerA(result, element)
   return isPromise(intermediate)
-    ? intermediate.then(curry2(reducerB, __, item))
-    : reducerB(intermediate, item)
+    ? intermediate.then(curry2(reducerB, __, element))
+    : reducerB(intermediate, element)
 }
 
 const genericReduce = function (collection, reducer, result) {
@@ -421,33 +421,33 @@ const reduce = function (...args) {
   return _reduce(args[0], args[1], args[2])
 }
 
-// (mapOfArrays Map<any=>Array>, key any, item any) => mapOfArrays
+// (mapOfArrays Map<any=>Array>, key any, element any) => mapOfArrays
 // TODO: benchmark vs mapOfArrays.has(key)
-const group = function (mapOfArrays, key, item) {
+const group = function (mapOfArrays, key, element) {
   const array = mapOfArrays.get(key)
   if (array == null) {
-    mapOfArrays.set(key, [item])
+    mapOfArrays.set(key, [element])
   } else {
-    array.push(item)
+    array.push(element)
   }
   return mapOfArrays
 }
 
-// property string => (mapOfArrays Map<any=>Array>, item any) => mapOfArrays
+// property string => (mapOfArrays Map<any=>Array>, element any) => mapOfArrays
 const groupByProperty = property => function groupByPropertyReducer(
-  mapOfArrays, item,
+  mapOfArrays, element,
 ) {
-  return group(mapOfArrays, item[property], item)
+  return group(mapOfArrays, element[property], element)
 }
 
-// resolver any=>any => (mapOfArrays Map<any=>Array>, item any) => mapOfArrays
+// resolver any=>any => (mapOfArrays Map<any=>Array>, element any) => mapOfArrays
 const groupByResolver = resolver => function groupByResolverReducer(
-  mapOfArrays, item,
+  mapOfArrays, element,
 ) {
-  const key = resolver(item)
+  const key = resolver(element)
   return isPromise(key)
-    ? key.then(curry3(group, mapOfArrays, __, item))
-    : group(mapOfArrays, key, item)
+    ? key.then(curry3(group, mapOfArrays, __, element))
+    : group(mapOfArrays, key, element)
 }
 
 const groupBy = propertyOrResolver => typeof propertyOrResolver == 'function'

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

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

package/dist/x/groupBy.js

@@ -1,5 +1,5 @@
 /**
- * rubico v2.7.3
+ * rubico v2.7.5
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2025 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -359,11 +359,11 @@ const mapReduce = function (map, reducer, result) {
 
 const reducerConcat = (
   reducerA, reducerB,
-) => function pipedReducer(result, item) {
-  const intermediate = reducerA(result, item)
+) => function pipedReducer(result, element) {
+  const intermediate = reducerA(result, element)
   return isPromise(intermediate)
-    ? intermediate.then(curry2(reducerB, __, item))
-    : reducerB(intermediate, item)
+    ? intermediate.then(curry2(reducerB, __, element))
+    : reducerB(intermediate, element)
 }
 
 const genericReduce = function (collection, reducer, result) {
@@ -427,33 +427,33 @@ const reduce = function (...args) {
   return _reduce(args[0], args[1], args[2])
 }
 
-// (mapOfArrays Map<any=>Array>, key any, item any) => mapOfArrays
+// (mapOfArrays Map<any=>Array>, key any, element any) => mapOfArrays
 // TODO: benchmark vs mapOfArrays.has(key)
-const group = function (mapOfArrays, key, item) {
+const group = function (mapOfArrays, key, element) {
   const array = mapOfArrays.get(key)
   if (array == null) {
-    mapOfArrays.set(key, [item])
+    mapOfArrays.set(key, [element])
   } else {
-    array.push(item)
+    array.push(element)
   }
   return mapOfArrays
 }
 
-// property string => (mapOfArrays Map<any=>Array>, item any) => mapOfArrays
+// property string => (mapOfArrays Map<any=>Array>, element any) => mapOfArrays
 const groupByProperty = property => function groupByPropertyReducer(
-  mapOfArrays, item,
+  mapOfArrays, element,
 ) {
-  return group(mapOfArrays, item[property], item)
+  return group(mapOfArrays, element[property], element)
 }
 
-// resolver any=>any => (mapOfArrays Map<any=>Array>, item any) => mapOfArrays
+// resolver any=>any => (mapOfArrays Map<any=>Array>, element any) => mapOfArrays
 const groupByResolver = resolver => function groupByResolverReducer(
-  mapOfArrays, item,
+  mapOfArrays, element,
 ) {
-  const key = resolver(item)
+  const key = resolver(element)
   return isPromise(key)
-    ? key.then(curry3(group, mapOfArrays, __, item))
-    : group(mapOfArrays, key, item)
+    ? key.then(curry3(group, mapOfArrays, __, element))
+    : group(mapOfArrays, key, element)
 }
 
 const groupBy = propertyOrResolver => typeof propertyOrResolver == 'function'

package/dist/x/groupBy.min.js

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

package/dist/x/groupBy.mjs

@@ -1,5 +1,5 @@
 /**
- * rubico v2.7.3
+ * rubico v2.7.5
  * https://github.com/a-synchronous/rubico
  * (c) 2019-2025 Richard Tong
  * rubico may be freely distributed under the MIT license.
@@ -353,11 +353,11 @@ const mapReduce = function (map, reducer, result) {
 
 const reducerConcat = (
   reducerA, reducerB,
-) => function pipedReducer(result, item) {
-  const intermediate = reducerA(result, item)
+) => function pipedReducer(result, element) {
+  const intermediate = reducerA(result, element)
   return isPromise(intermediate)
-    ? intermediate.then(curry2(reducerB, __, item))
-    : reducerB(intermediate, item)
+    ? intermediate.then(curry2(reducerB, __, element))
+    : reducerB(intermediate, element)
 }
 
 const genericReduce = function (collection, reducer, result) {
@@ -421,33 +421,33 @@ const reduce = function (...args) {
   return _reduce(args[0], args[1], args[2])
 }
 
-// (mapOfArrays Map<any=>Array>, key any, item any) => mapOfArrays
+// (mapOfArrays Map<any=>Array>, key any, element any) => mapOfArrays
 // TODO: benchmark vs mapOfArrays.has(key)
-const group = function (mapOfArrays, key, item) {
+const group = function (mapOfArrays, key, element) {
   const array = mapOfArrays.get(key)
   if (array == null) {
-    mapOfArrays.set(key, [item])
+    mapOfArrays.set(key, [element])
   } else {
-    array.push(item)
+    array.push(element)
   }
   return mapOfArrays
 }
 
-// property string => (mapOfArrays Map<any=>Array>, item any) => mapOfArrays
+// property string => (mapOfArrays Map<any=>Array>, element any) => mapOfArrays
 const groupByProperty = property => function groupByPropertyReducer(
-  mapOfArrays, item,
+  mapOfArrays, element,
 ) {
-  return group(mapOfArrays, item[property], item)
+  return group(mapOfArrays, element[property], element)
 }
 
-// resolver any=>any => (mapOfArrays Map<any=>Array>, item any) => mapOfArrays
+// resolver any=>any => (mapOfArrays Map<any=>Array>, element any) => mapOfArrays
 const groupByResolver = resolver => function groupByResolverReducer(
-  mapOfArrays, item,
+  mapOfArrays, element,
 ) {
-  const key = resolver(item)
+  const key = resolver(element)
   return isPromise(key)
-    ? key.then(curry3(group, mapOfArrays, __, item))
-    : group(mapOfArrays, key, item)
+    ? key.then(curry3(group, mapOfArrays, __, element))
+    : group(mapOfArrays, key, element)
 }
 
 const groupBy = propertyOrResolver => typeof propertyOrResolver == 'function'

package/dist/x/has.es.js

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

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

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

package/dist/x/has.js

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

package/dist/x/has.min.js

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

package/dist/x/has.mjs

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

package/dist/x/identity.es.js

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

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

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

package/dist/x/identity.js

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

package/dist/x/identity.min.js

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

package/dist/x/identity.mjs

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

package/dist/x/includes.es.js

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

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

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

package/dist/x/includes.js

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

package/dist/x/includes.min.js

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

package/dist/x/includes.mjs

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

package/dist/x/isDeepEqual.es.js

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

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

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

package/dist/x/isDeepEqual.js

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

package/dist/x/isDeepEqual.min.js

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