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

whenever.js

v0.4.0

Published

A javascript re-interpretation of Whenever

Downloads

4

Readme

whenever.js

An adaptation and implementation of Whenever into Javascript.

About

The biggest divergence from the original implementation is that whenever.js uses function declarations instead of statements and refers to them by their name string as opposed to by statement number. This way, we have access to all of the host Javascript's functionality at a snap, including the ability to declare global variables and access them from various statements.

The ultimate goal for this implementation is to be used as the engine for a text-adventure game.

If you are interested in a true-to-syntax implementation Whenever, check out Fredrik Hallenberg's repo.

Writing a Program

Whenever is an esolang playing with the idea of control flow. How do you write a program when statements are called out of sync?

In Whenever, functions are added to an execution bag and then executed in random order. That's pretty much it. Functions are removed from the bag on execution unless otherwise directed by in-built functions (see below).

Statements

The base of a whenever.js program is the simple statement. This is an argument-less function declaration (not assignment!):

function name() { ... }

When this statement is executed, the function will run. If you would like access to global variables, you can take advantage of the non-strict environment in which whenever runs and use assignment without var:

~~var~~ variable = value;

Comments

Whenever accepts Javascript style comments

// Single line

/* And also
   multiline!! */

Built-in Functions

Whenever.js includes most Whenever standard functions (except U()). In this case, they are called as normal Javascript functions within a statement. For instance:

// create monsters statement
function monsters() {
	console.log('OH NO MONSTERS RUN!!!!');
}

// add six more copies of the monster statement to the bag
function addMonsters() {
	add('monsters', 6);
}

Add

add('functionNameAsString', #oftimes)

Adds given number of copies to the execution bag.

Remove

remove('functionNameAsString', #oftimes)

Removes given number of copies from execution bag. If the number is greater than number of copies, it will leave 0.

Defer

defer(predicate, function(){} OR 'functionNameAsString')

defer will refrain from running the callback until the predicate returns false. The predicate can be a boolean value, or the name of a statement (which will be interpreted as N(statement) > 0). If a function name is passed, it will return true as long a copy of the function exists in the execution bag.

Again

again(predicate, function(){} OR 'functionNameAsString')

The first argument to again is a predicate, which can be either a boolean value or a statement name (which will be interpreted as N(statement) > 0). If the predicate is true, the callback statement is executed but remains in the bag, to be executed again some time later. If the argument is false, the statement is executed and removed from the to-do list as normal.

The predicate can be simply the name of a function as well as other boolean options. Writing the following, for instance, would execute monster as long as teeth has not been executed and removed:

function keepMonstersGoing() {
	again('teeth', 'monster')
}

N

N('functionNameAsString')

Will return the number of times the named function has been executed.

Installing & Running the Program

Install whenever globally via npm:

npm install whenever.js -g

Compile by running:

anytime <path/to/file/name.we>

Examples

Below are a funny little loop and a translation of the first 100 Fibonacci numbers from David Morgan-Mar. Feel free to PR anything else you make and hopefully I will also add more in the future.

Example script files are also located in the examples directory.

Silly Loop

function teeth() { 
  console.log('Bite with teeth');
}

function count() {
  console.log('teeth', N('teeth'));
}

function moo() {
 console.log('moo');
 theres_a_cow = true;

 add("roof");
 add("teeth");
}

function roof() {
 console.log('roof');
 theres_a_dog = true;

 if (theres_a_dog) {
   add("teeth");
   add("moo");
 }
}

Fibonacci

// Fibonacci Adaptation

function one(){
  // 1 again (1) defer (3 || N(1)<=N(2) || N(7)>99) 2#N(1),3,7;
  again(N('one') > 0, 'one');
  defer((N('three') > 0 || N('one') <= N('two') || N('seven') > 99), function(){
   add('two', N('one'));
   add('three');
   add('seven'); 
  });
}


function two(){
  // 2 again (2) defer (3 || N(2)<=N(1) || N(7)>99) 1#N(2),3,7;
  again(N('two') > 0, 'two');
  defer((N('three') > 0 || N('two') <= N('one') || N('seven') > 99), function(){
    add('one', N('two'));
    add('three');
    add('seven');
  });
}

function three(){
  // 3 defer (5) print(N(1)+N(2));
  defer('five', function(){
    console.log(N('one') + N('two'));
  });
}

function four(){
  // 4 defer (5) print("1");
  defer('five', function(){
    console.log('1');
  });
}

function five(){
  // 5 4,-3,7;
  add('four');
  remove('three');
  add('seven');
}

function six(){
  // 6 defer (4) 3;
  defer('four', function(){
    add('three');
  });
}

function seven(){
  // 7 7;
  add('seven');
}

function eight(){
  // 8 defer (N(7)<100) -1#N(1),-2#N(2),-7#100,-3;
  defer((N('seven') < 100 ), function(){
    remove('one', N('one'));
    remove('two', N('two'));
    remove('seven', 100);
    remove('three');
  });
}

function nine(){
  // 9 defer (3 || 6) 1,3;
  defer((N('three') > 0 || N('six') > 0), function(){
    add('one');
    add('three');
  });
}

License

MIT