rambda 10.2.0 → 10.3.1

package/dist/rambda.cjs

@@ -535,6 +535,53 @@ function equals(a) {
   return b => equalsFn(a, b)
 }
 
+class _Set {
+  constructor() {
+    this.set = new Set();
+    this.items = {};
+  }
+
+  checkUniqueness(item) {
+    const type$1 = type(item);
+    if (['Null', 'Undefined', 'NaN'].includes(type$1)) {
+      if (type$1 in this.items) {
+        return false
+      }
+      this.items[type$1] = true;
+
+      return true
+    }
+    if (!['Object', 'Array'].includes(type$1)) {
+      const prevSize = this.set.size;
+      this.set.add(item);
+
+      return this.set.size !== prevSize
+    }
+
+    if (!(type$1 in this.items)) {
+      this.items[type$1] = [item];
+
+      return true
+    }
+
+    if (_indexOf(item, this.items[type$1]) === -1) {
+      this.items[type$1].push(item);
+
+      return true
+    }
+
+    return false
+  }
+}
+
+function duplicateBy(fn) {
+  return list => {
+    const set = new _Set();
+
+    return list.filter(item => !set.checkUniqueness(fn(item)))
+  }
+}
+
 function eqBy(fn, a) {
   return b => equalsFn(fn(a), fn(b))
 }
@@ -586,6 +633,21 @@ function excludes(valueToFind) {
   return iterable => !includes(valueToFind)(iterable)
 }
 
+function filterAsync(predicate) {
+  return async list => {
+    const willReturn = [];
+    let index = 0;
+    for (const x of list) {
+      if (await predicate(x, index)) {
+        willReturn.push(list[index]);
+      }
+      index++;
+    }
+
+    return willReturn
+  }
+}
+
 function filterObject(predicate) {
   return obj => {
     const willReturn = {};
@@ -798,6 +860,21 @@ function head(listOrString) {
   return listOrString[0]
 }
 
+function indexBy(property){
+	return list => {
+		const toReturn = {};
+		for (let i = 0; i < list.length; i++){
+			const item = list[ i ];
+			const key = item[property];
+			if(key !== undefined){
+				toReturn[ key ] = item;
+			}
+		}
+	
+		return toReturn
+	}
+}
+
 function indexOf(valueToFind) {
   return list => _indexOf(valueToFind, list)
 }
@@ -936,8 +1013,8 @@ function mapAsync(fn) {
   return async list => {
     const willReturn = [];
     let i = 0;
-    for (const a of list) {
-      willReturn.push(await fn(a, i++));
+    for (const x of list) {
+      willReturn.push(await fn(x, i++));
     }
 
     return willReturn
@@ -971,6 +1048,17 @@ function mapParallelAsync(fn) {
   return async list =>  Promise.all(list.map((x, i) => fn(x, i)))
 }
 
+function mapPropObject(fn, prop) {
+  return obj => {
+		if (!Array.isArray(obj[prop])) return obj
+			
+			return {
+				...obj,
+				[prop]: obj[prop].map(fn)
+			}
+		}
+ 	 }
+
 function match(pattern) {
   return input => {
     const willReturn = input.match(pattern);
@@ -1395,7 +1483,7 @@ function propEq(valueToMatch, propToFind) {
   }
 }
 
-function propOr(defaultValue, property) {
+function propOr(property, defaultValue) {
   return obj => {
     if (!obj) {
       return defaultValue
@@ -1446,6 +1534,17 @@ function replace(pattern, replacer) {
   return str => str.replace(pattern, replacer)
 }
 
+function replaceAll(patterns, replacer) {
+  return input => {
+    let text = input;
+    patterns.forEach(singlePattern => {
+      text = text.replace(singlePattern, replacer);
+    });
+
+    return text
+  }
+}
+
 function shuffle(listInput) {
   const list = cloneList(listInput);
   let counter = list.length;
@@ -1676,45 +1775,6 @@ function union(x) {
   }
 }
 
-class _Set {
-  constructor() {
-    this.set = new Set();
-    this.items = {};
-  }
-
-  checkUniqueness(item) {
-    const type$1 = type(item);
-    if (['Null', 'Undefined', 'NaN'].includes(type$1)) {
-      if (type$1 in this.items) {
-        return false
-      }
-      this.items[type$1] = true;
-
-      return true
-    }
-    if (!['Object', 'Array'].includes(type$1)) {
-      const prevSize = this.set.size;
-      this.set.add(item);
-
-      return this.set.size !== prevSize
-    }
-
-    if (!(type$1 in this.items)) {
-      this.items[type$1] = [item];
-
-      return true
-    }
-
-    if (_indexOf(item, this.items[type$1]) === -1) {
-      this.items[type$1].push(item);
-
-      return true
-    }
-
-    return false
-  }
-}
-
 function uniq(list) {
   const set = new _Set();
   const willReturn = [];
@@ -1844,6 +1904,7 @@ exports.drop = drop;
 exports.dropLast = dropLast;
 exports.dropLastWhile = dropLastWhile;
 exports.dropWhile = dropWhile;
+exports.duplicateBy = duplicateBy;
 exports.eqBy = eqBy;
 exports.eqProps = eqProps;
 exports.equals = equals;
@@ -1851,6 +1912,7 @@ exports.equalsFn = equalsFn;
 exports.evolve = evolve;
 exports.excludes = excludes;
 exports.filter = filter;
+exports.filterAsync = filterAsync;
 exports.filterObject = filterObject;
 exports.find = find;
 exports.findIndex = findIndex;
@@ -1865,6 +1927,7 @@ exports.groupBy = groupBy;
 exports.groupByFallback = groupByFallback;
 exports.head = head;
 exports.includes = includes;
+exports.indexBy = indexBy;
 exports.indexOf = indexOf;
 exports.init = init;
 exports.innerJoin = innerJoin;
@@ -1881,6 +1944,7 @@ exports.mapKeys = mapKeys;
 exports.mapObject = mapObject;
 exports.mapObjectAsync = mapObjectAsync;
 exports.mapParallelAsync = mapParallelAsync;
+exports.mapPropObject = mapPropObject;
 exports.match = match;
 exports.maxBy = maxBy;
 exports.merge = merge;
@@ -1912,6 +1976,7 @@ exports.reduce = reduce;
 exports.reject = reject;
 exports.rejectObject = rejectObject;
 exports.replace = replace;
+exports.replaceAll = replaceAll;
 exports.shuffle = shuffle;
 exports.sort = sort;
 exports.sortBy = sortBy;

package/dist/rambda.js

@@ -533,6 +533,53 @@ function equals(a) {
   return b => equalsFn(a, b)
 }
 
+class _Set {
+  constructor() {
+    this.set = new Set();
+    this.items = {};
+  }
+
+  checkUniqueness(item) {
+    const type$1 = type(item);
+    if (['Null', 'Undefined', 'NaN'].includes(type$1)) {
+      if (type$1 in this.items) {
+        return false
+      }
+      this.items[type$1] = true;
+
+      return true
+    }
+    if (!['Object', 'Array'].includes(type$1)) {
+      const prevSize = this.set.size;
+      this.set.add(item);
+
+      return this.set.size !== prevSize
+    }
+
+    if (!(type$1 in this.items)) {
+      this.items[type$1] = [item];
+
+      return true
+    }
+
+    if (_indexOf(item, this.items[type$1]) === -1) {
+      this.items[type$1].push(item);
+
+      return true
+    }
+
+    return false
+  }
+}
+
+function duplicateBy(fn) {
+  return list => {
+    const set = new _Set();
+
+    return list.filter(item => !set.checkUniqueness(fn(item)))
+  }
+}
+
 function eqBy(fn, a) {
   return b => equalsFn(fn(a), fn(b))
 }
@@ -584,6 +631,21 @@ function excludes(valueToFind) {
   return iterable => !includes(valueToFind)(iterable)
 }
 
+function filterAsync(predicate) {
+  return async list => {
+    const willReturn = [];
+    let index = 0;
+    for (const x of list) {
+      if (await predicate(x, index)) {
+        willReturn.push(list[index]);
+      }
+      index++;
+    }
+
+    return willReturn
+  }
+}
+
 function filterObject(predicate) {
   return obj => {
     const willReturn = {};
@@ -796,6 +858,21 @@ function head(listOrString) {
   return listOrString[0]
 }
 
+function indexBy(property){
+	return list => {
+		const toReturn = {};
+		for (let i = 0; i < list.length; i++){
+			const item = list[ i ];
+			const key = item[property];
+			if(key !== undefined){
+				toReturn[ key ] = item;
+			}
+		}
+	
+		return toReturn
+	}
+}
+
 function indexOf(valueToFind) {
   return list => _indexOf(valueToFind, list)
 }
@@ -934,8 +1011,8 @@ function mapAsync(fn) {
   return async list => {
     const willReturn = [];
     let i = 0;
-    for (const a of list) {
-      willReturn.push(await fn(a, i++));
+    for (const x of list) {
+      willReturn.push(await fn(x, i++));
     }
 
     return willReturn
@@ -969,6 +1046,17 @@ function mapParallelAsync(fn) {
   return async list =>  Promise.all(list.map((x, i) => fn(x, i)))
 }
 
+function mapPropObject(fn, prop) {
+  return obj => {
+		if (!Array.isArray(obj[prop])) return obj
+			
+			return {
+				...obj,
+				[prop]: obj[prop].map(fn)
+			}
+		}
+ 	 }
+
 function match(pattern) {
   return input => {
     const willReturn = input.match(pattern);
@@ -1393,7 +1481,7 @@ function propEq(valueToMatch, propToFind) {
   }
 }
 
-function propOr(defaultValue, property) {
+function propOr(property, defaultValue) {
   return obj => {
     if (!obj) {
       return defaultValue
@@ -1444,6 +1532,17 @@ function replace(pattern, replacer) {
   return str => str.replace(pattern, replacer)
 }
 
+function replaceAll(patterns, replacer) {
+  return input => {
+    let text = input;
+    patterns.forEach(singlePattern => {
+      text = text.replace(singlePattern, replacer);
+    });
+
+    return text
+  }
+}
+
 function shuffle(listInput) {
   const list = cloneList(listInput);
   let counter = list.length;
@@ -1674,45 +1773,6 @@ function union(x) {
   }
 }
 
-class _Set {
-  constructor() {
-    this.set = new Set();
-    this.items = {};
-  }
-
-  checkUniqueness(item) {
-    const type$1 = type(item);
-    if (['Null', 'Undefined', 'NaN'].includes(type$1)) {
-      if (type$1 in this.items) {
-        return false
-      }
-      this.items[type$1] = true;
-
-      return true
-    }
-    if (!['Object', 'Array'].includes(type$1)) {
-      const prevSize = this.set.size;
-      this.set.add(item);
-
-      return this.set.size !== prevSize
-    }
-
-    if (!(type$1 in this.items)) {
-      this.items[type$1] = [item];
-
-      return true
-    }
-
-    if (_indexOf(item, this.items[type$1]) === -1) {
-      this.items[type$1].push(item);
-
-      return true
-    }
-
-    return false
-  }
-}
-
 function uniq(list) {
   const set = new _Set();
   const willReturn = [];
@@ -1814,4 +1874,4 @@ function zipWith(fn, x) {
     )
 }
 
-export { _arity, _includes, _indexOf, _lastIndexOf, addProp, addPropToObjects, all, allPass, any, anyPass, append, ascend, assertType, checkObjectWithSpec, compact, complement, concat, convertToType, count, countBy, createCompareFunction, createObjectFromKeys, defaultTo, descend, drop, dropLast, dropLastWhile, dropWhile, eqBy, eqProps, equals, equalsFn, evolve, excludes, filter, filterObject, find, findIndex, findLast, findLastIndex, findNth, flatMap, flatten, flattenObject, flattenObjectHelper, groupBy, groupByFallback, head, includes, indexOf, init, innerJoin, interpolate, intersection, intersperse, join, last, lastIndexOf, map, mapAsync, mapFn, mapKeys, mapObject, mapObjectAsync, mapParallelAsync, match, maxBy, merge, mergeTypes, minBy, modifyItemAtIndex, modifyPath, modifyProp, none, objOf, objectIncludes, omit, partition, partitionObject, path, pathSatisfies, permutations, pick, pipe, pipeAsync, pluck, prepend, prop, propEq, propOr, propSatisfies, range, reduce, reject, rejectObject, replace, shuffle, sort, sortBy, sortByDescending, sortByFn, sortByPath, sortByPathDescending, sortObject, sortWith, split, splitEvery, symmetricDifference, tail, take, takeLast, takeLastWhile, takeWhile, tap, test, transformFlatObject, tryCatch, type, union, uniq, uniqBy, uniqWith, unless, unwind, update, when, zip, zipWith };
+export { _arity, _includes, _indexOf, _lastIndexOf, addProp, addPropToObjects, all, allPass, any, anyPass, append, ascend, assertType, checkObjectWithSpec, compact, complement, concat, convertToType, count, countBy, createCompareFunction, createObjectFromKeys, defaultTo, descend, drop, dropLast, dropLastWhile, dropWhile, duplicateBy, eqBy, eqProps, equals, equalsFn, evolve, excludes, filter, filterAsync, filterObject, find, findIndex, findLast, findLastIndex, findNth, flatMap, flatten, flattenObject, flattenObjectHelper, groupBy, groupByFallback, head, includes, indexBy, indexOf, init, innerJoin, interpolate, intersection, intersperse, join, last, lastIndexOf, map, mapAsync, mapFn, mapKeys, mapObject, mapObjectAsync, mapParallelAsync, mapPropObject, match, maxBy, merge, mergeTypes, minBy, modifyItemAtIndex, modifyPath, modifyProp, none, objOf, objectIncludes, omit, partition, partitionObject, path, pathSatisfies, permutations, pick, pipe, pipeAsync, pluck, prepend, prop, propEq, propOr, propSatisfies, range, reduce, reject, rejectObject, replace, replaceAll, shuffle, sort, sortBy, sortByDescending, sortByFn, sortByPath, sortByPathDescending, sortObject, sortWith, split, splitEvery, symmetricDifference, tail, take, takeLast, takeLastWhile, takeWhile, tap, test, transformFlatObject, tryCatch, type, union, uniq, uniqBy, uniqWith, unless, unwind, update, when, zip, zipWith };

package/dist/rambda.umd.js

@@ -539,6 +539,53 @@
     return b => equalsFn(a, b)
   }
 
+  class _Set {
+    constructor() {
+      this.set = new Set();
+      this.items = {};
+    }
+
+    checkUniqueness(item) {
+      const type$1 = type(item);
+      if (['Null', 'Undefined', 'NaN'].includes(type$1)) {
+        if (type$1 in this.items) {
+          return false
+        }
+        this.items[type$1] = true;
+
+        return true
+      }
+      if (!['Object', 'Array'].includes(type$1)) {
+        const prevSize = this.set.size;
+        this.set.add(item);
+
+        return this.set.size !== prevSize
+      }
+
+      if (!(type$1 in this.items)) {
+        this.items[type$1] = [item];
+
+        return true
+      }
+
+      if (_indexOf(item, this.items[type$1]) === -1) {
+        this.items[type$1].push(item);
+
+        return true
+      }
+
+      return false
+    }
+  }
+
+  function duplicateBy(fn) {
+    return list => {
+      const set = new _Set();
+
+      return list.filter(item => !set.checkUniqueness(fn(item)))
+    }
+  }
+
   function eqBy(fn, a) {
     return b => equalsFn(fn(a), fn(b))
   }
@@ -590,6 +637,21 @@
     return iterable => !includes(valueToFind)(iterable)
   }
 
+  function filterAsync(predicate) {
+    return async list => {
+      const willReturn = [];
+      let index = 0;
+      for (const x of list) {
+        if (await predicate(x, index)) {
+          willReturn.push(list[index]);
+        }
+        index++;
+      }
+
+      return willReturn
+    }
+  }
+
   function filterObject(predicate) {
     return obj => {
       const willReturn = {};
@@ -802,6 +864,21 @@
     return listOrString[0]
   }
 
+  function indexBy(property){
+  	return list => {
+  		const toReturn = {};
+  		for (let i = 0; i < list.length; i++){
+  			const item = list[ i ];
+  			const key = item[property];
+  			if(key !== undefined){
+  				toReturn[ key ] = item;
+  			}
+  		}
+  	
+  		return toReturn
+  	}
+  }
+
   function indexOf(valueToFind) {
     return list => _indexOf(valueToFind, list)
   }
@@ -940,8 +1017,8 @@
     return async list => {
       const willReturn = [];
       let i = 0;
-      for (const a of list) {
-        willReturn.push(await fn(a, i++));
+      for (const x of list) {
+        willReturn.push(await fn(x, i++));
       }
 
       return willReturn
@@ -975,6 +1052,17 @@
     return async list =>  Promise.all(list.map((x, i) => fn(x, i)))
   }
 
+  function mapPropObject(fn, prop) {
+    return obj => {
+  		if (!Array.isArray(obj[prop])) return obj
+  			
+  			return {
+  				...obj,
+  				[prop]: obj[prop].map(fn)
+  			}
+  		}
+   	 }
+
   function match(pattern) {
     return input => {
       const willReturn = input.match(pattern);
@@ -1399,7 +1487,7 @@
     }
   }
 
-  function propOr(defaultValue, property) {
+  function propOr(property, defaultValue) {
     return obj => {
       if (!obj) {
         return defaultValue
@@ -1450,6 +1538,17 @@
     return str => str.replace(pattern, replacer)
   }
 
+  function replaceAll(patterns, replacer) {
+    return input => {
+      let text = input;
+      patterns.forEach(singlePattern => {
+        text = text.replace(singlePattern, replacer);
+      });
+
+      return text
+    }
+  }
+
   function shuffle(listInput) {
     const list = cloneList(listInput);
     let counter = list.length;
@@ -1680,45 +1779,6 @@
     }
   }
 
-  class _Set {
-    constructor() {
-      this.set = new Set();
-      this.items = {};
-    }
-
-    checkUniqueness(item) {
-      const type$1 = type(item);
-      if (['Null', 'Undefined', 'NaN'].includes(type$1)) {
-        if (type$1 in this.items) {
-          return false
-        }
-        this.items[type$1] = true;
-
-        return true
-      }
-      if (!['Object', 'Array'].includes(type$1)) {
-        const prevSize = this.set.size;
-        this.set.add(item);
-
-        return this.set.size !== prevSize
-      }
-
-      if (!(type$1 in this.items)) {
-        this.items[type$1] = [item];
-
-        return true
-      }
-
-      if (_indexOf(item, this.items[type$1]) === -1) {
-        this.items[type$1].push(item);
-
-        return true
-      }
-
-      return false
-    }
-  }
-
   function uniq(list) {
     const set = new _Set();
     const willReturn = [];
@@ -1848,6 +1908,7 @@
   exports.dropLast = dropLast;
   exports.dropLastWhile = dropLastWhile;
   exports.dropWhile = dropWhile;
+  exports.duplicateBy = duplicateBy;
   exports.eqBy = eqBy;
   exports.eqProps = eqProps;
   exports.equals = equals;
@@ -1855,6 +1916,7 @@
   exports.evolve = evolve;
   exports.excludes = excludes;
   exports.filter = filter;
+  exports.filterAsync = filterAsync;
   exports.filterObject = filterObject;
   exports.find = find;
   exports.findIndex = findIndex;
@@ -1869,6 +1931,7 @@
   exports.groupByFallback = groupByFallback;
   exports.head = head;
   exports.includes = includes;
+  exports.indexBy = indexBy;
   exports.indexOf = indexOf;
   exports.init = init;
   exports.innerJoin = innerJoin;
@@ -1885,6 +1948,7 @@
   exports.mapObject = mapObject;
   exports.mapObjectAsync = mapObjectAsync;
   exports.mapParallelAsync = mapParallelAsync;
+  exports.mapPropObject = mapPropObject;
   exports.match = match;
   exports.maxBy = maxBy;
   exports.merge = merge;
@@ -1916,6 +1980,7 @@
   exports.reject = reject;
   exports.rejectObject = rejectObject;
   exports.replace = replace;
+  exports.replaceAll = replaceAll;
   exports.shuffle = shuffle;
   exports.sort = sort;
   exports.sortBy = sortBy;