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

@engraft/refunc

v0.0.8

Published

Library for incremental computation

Downloads

115

Readme

Refunc

A library for incremental computation.

Tutorial

// This is a function packaged as a refunction,
// but it doesn't do any actual remembering.

const squareForgetful = hooks((x) => {
  console.log('squaring', x)
  return x * x;
});

// Every time we run it, we get a 'squaring' log.

var mem = new RefuncMemory();
console.log(squareForgetful(mem, 3));
// → squaring 3
// → 9
console.log(squareForgetful(mem, 3));
// → squaring 3
// → 9
console.log(squareForgetful(mem, 4));
// → squaring 4
// → 9
console.log(squareForgetful(mem, 4));
// → squaring 4
// → 9


// This refunction wraps the squaring work in `hookMemo`.
// It will keep the result of this work around in
// case it gets called again with the same input.

const square = hooks((x) => {
  const squared = hookMemo(() => {
    console.log('squaring', x)
    return x * x;
  }, [x]);
  return squared;
});

// Now repeated calls to `square` only do the
// squaring work once!

var mem = new RefuncMemory();
log(square(mem, 3));
// → squaring 3
// → 9
log(square(mem, 3));
// → 9
log(square(mem, 4));
// → squaring 4
// → 16
log(square(mem, 4));
// → 16
// But note that we only remember the very
// latest input:
log(square(mem, 3));
// → squaring 3
// → 9


// This refunction squares both of its arguments using
// the previously defined `square`. It uses
// `hookRefunc`, which makes the memories of these
// two calls part of the memory of the new

const twoSquares = hooks((x, y) => {
  const xSquared = hookRefunc(square, x);
  const ySquared = hookRefunc(square, y);
  return [xSquared, ySquared];
});

// Now each of the squarings is memoized.

var mem = new RefuncMemory();
log(twoSquares(mem, 3, 4));
// → squaring 3
// → squaring 4
// → [ 9, 16 ]
log(twoSquares(mem, 3, 4));
// → [ 9, 16 ]
log(twoSquares(mem, 3, 5));
// → squaring 5
// → [ 9, 25 ]
// But note that no memory is shared between the
// x-call and the y-call:
log(twoSquares(mem, 4, 4))
// → squaring 4
// → squaring 4
// → [ 16, 16 ]


// This refunction receives an object with numeric
// values and squares all the values. It uses
// `square` to memoize the squaring of each value.
// However, the number of values varies, so we
// cannot simply call `hookRefunc` in a loop.
// Instead, we use `hookFork` to spawn a variable
// number of keyed branches.

const keyedSquares = hooks((nums) => {
  const results = {};
  hookFork((branch) =>
    Object.entries(nums).forEach(([key, num]) =>
      branch(key, () => {
        results[key] = hookRefunc(square, num);
      })
    )
  )
  return results;
})

// It behaves like you'd expect.

var mem = new RefuncMemory();
log(keyedSquares(mem, {a: 3      }));
// → squaring 3
// → { a: 9 }
log(keyedSquares(mem, {a: 3, b: 4}));
// → squaring 4
// → { a: 9, b: 16 }
log(keyedSquares(mem, {a: 3, b: 4}));
// → { a: 9, b: 16 }
log(keyedSquares(mem, {a: 3, b: 5}));
// → squaring 5
// → { a: 9, b: 25 }
log(keyedSquares(mem, {      b: 5}));
// → { b: 25 }