npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

unreduce

v1.0.3

Published

The opposite of Array.prototype.reduce()

Downloads

3

Readme

unreduce

NPM version

You've all heard of reducers, but nobody has told you about ✨unreducers✨! Similar to unfold, this package provides a higher-order function that recursively invokes a callback, appending the result of each invocation to an output array.

Usage

unreduce(initial, config, callback)

unreduce(initial, config, callback)

initial required (number, array, or object): The initial value(s) that are passed to the callback and from which the unreduction starts

config required (number, object)
When number: The length of the output array
When object:

  • times (number): Number of times to run the callback function
  • until (number): Run the callback funtion until the value it returns goes from greater than to less than or equal to this value, or less than to greater than or equal to this value

callback(element, index, base) required (function): The callback function used to calculate the next element of the array from the last

  • element required (any): Last element of the array
  • index optional (number): Current index of the last element of the array
  • base optional (array): Entire current array

Examples:

// Simple length 5 array with addition
unreduce(0, 5, (n) => n + 2)
[0, 2, 4, 6, 8]

// Stop at -3
unreduce(0, {until: -3}, (n) => --n)
[0, -1, -2, -3]

// Run the callback 2 times
unreduce([10, 20, 30], {times: 2}, (n) => n + 10)
[10, 20, 30, 40, 50]

// Fibonacci Sequence
unreduce([0, 1],  30, (e, i, base) => base[i-1] + base[i-2])
[
      0,      1,      1,      2,      3,
      5,      8,     13,     21,     34,
     55,     89,    144,    233,    377,
    610,    987,   1597,   2584,   4181,
   6765,  10946,  17711,  28657,  46368,
  75025, 121393, 196418, 317811, 514229
]

// Powers of 2
unreduce(1, 5, (n) => n*2)
[ 1, 2, 4, 8, 16 ]

// Another way to create powers of 2 with only addition
unreduce(2, 5, (e, i, base) => base.reduce((acc, el) => acc + el))
[ 2, 2, 4, 8, 16 ]

// simple sequence by using the iterator
unreduce(0, 5, (e, i) => i)
[0, 1, 2, 3, 4]

// manipulate a string
unreduce('abc', 4, (e) => e[2] + e[0] + e[1])
[ 'abc', 'cab', 'bca', 'abc']