2.1.0 • Published 5 years ago
extended-collections v2.1.0
Extended Collections
Modern polyfills of Stage 1 Collection Methods, including additional utility methods adapted from other languages, such as C#, Haskell, Python, Hack, and Ruby to make Collections even more versatile.
Map*
new Map([iterable[, handler]])
Static
Map.fromMap.groupByMap.isMapMap.keyByMap.of
Instance
Map.prototype.at††Map.prototype.deleteAllMap.prototype.emplaceMap.prototype.everyMap.prototype.filterMap.prototype.findKeyMap.prototype.findMap.prototype.hasAllMap.prototype.includesMap.prototype.keyOfMap.prototype.mapKeysMap.prototype.mapValues†Map.prototype.mergeMap.prototype.partitionMap.prototype.randomMap.prototype.randomKeyMap.prototype.reduceMap.prototype.someMap.prototype.uniqueBy††Map.prototype.update
*If a method can be called on both keys and values, the method will target the Map's values by default and will have an implementation which targets the Map's keys (e.g., .find and .findKey)
† .mapValues is called .map for consistency
†† Adapted to work with Map
Planned
Map.prototype.flatMap.prototype.flatMap
Set
new Set([iterable[, coerceValue]])
Static
Instance
Set.prototype.addAllSet.prototype.at*Set.prototype.copyToSet.prototype.deleteAllSet.prototype.differenceSet.prototype.everySet.prototype.filterSet.prototype.findSet.prototype.hasAllSet.prototype.intersectionSet.prototype.isDisjointFromSet.prototype.isSubsetOfSet.prototype.isSupersetOfSet.prototype.joinSet.prototype.mapSet.prototype.partitionSet.prototype.reduceSet.prototype.someSet.prototype.symmetricDifferenceSet.prototype.union
* Adapted to work with Set
Planned
Set.prototype.flatSet.prototype.flatMap