rupert-fp

Rupert-fp

Build Status npm

Rupert-fp is a JavaScript static code analysis tool and functional programming helper. Its aim is to aid in the transition of moving from an object-oriented programming paradigm to a more functional one.

How It Works

Rupert-fp analyzes a data stream for the following rules:

By default, all of the nodes that match a rule will be collected and printed when found in the source code. However, this can be controlled through bit flags.

PointFree

Call expressions often are unnecessarily nested as in the example below. This is often seen in code structures that follow the callback pattern such as Promises.

The rule compares the caller’s params and the callee’s arguments and matches in the following scenarios:

Example:

callback(function (data) {
    doSomething(data);
});

This can be re-written as:

callback(doSomething);

ImpureFunction

A function that is pure contains no free variables.

Example:

module.exports = {
    Identifier(node, parent) {
        if (bitmask & ImpureFunction) {
            captureManager.capture(node.name, (parent.type === 'VariableDeclaration'));
        }
    }
};

This will match the bitmask, ImpureFunction and captureManager identifiers.

NoLoops

Loops… don’t use ‘em! Matches:

Example:

function double(nums) {
    for (let i = 0, len = nums.length; i < len; i++) {
        nums[i] *= 2;
    }

    return nums;
}

const nums = double([1, 2, 4]);

UnnecessaryBraces

With the introduction of fat arrow functions, ES 2015 became a lot more expressive. Function bodies that contain a single expression can take advantage of the leaner syntax by dropping the curly braces.

Example:

new Promise((resolve, reject) => {
    setTimeout(() => {
        resolve('foo');
    }, 1000);
})
.then(data => {
    console.log(data);
})
.catch(err => {
    console.error(err);
});

This can be re-written as:

new Promise((resolve, reject) =>
    setTimeout(() => resolve('foo'), 1000)
)
.then(data => console.log(data))
.catch(err => console.error(err));

Note that the callbacks suffer from the same unnecessary nesting as described in the PointFree rule. To fix this, the sample could be even further simplified:

new Promise((resolve, reject) =>
    setTimeout(() => resolve('foo'), 1000)
)
.then(console.log)
.catch(console.error);

Bit Flags and Bitmasks

Instead of requiring that each type to be captured is specified on the command line (which can get quite verbose), Rupert-fp allows for setting a bitmask that is the sum of the bit flags of the desired rules to use to filter the source code.

In other words, just add the flags and use that number as the bitmask. This bitmask is then used to filter which nodes are printed. The default is 255, which will dump all nodes.

Flag | Rule
--- | ---
1 | PointFree
2 | ImpureFunction
4 | NoLoops
8 | UnnecessaryBraces

Installation

npm i -g rupert-fp

Code Generattion

rupert-fs will use the default log and html generators provided by the onf-static framework. If you need more customization, you can develop your own and then tell the framework about it by calling setting the generator field in the setOptions call.

Usage

Property | Description
------------ | -------------
--bitmask, -b | The bitmask which determines the nodes to be captured
--debug, -d | Turns on debug mode
--html | Creates an html document of the analysis
--target, -t | The target to analyze
-v, -vv | The level of verbosity
--help, -h | Show help

Examples

Dump the tree to stdout (raw):

rupert-fp -t foo.js

Dump the tree to stdout (maximum verbosity, with code snippets that match the rules):

rupert-fp -t foo.js -vv

Create an html document of the same tree (always verbose):

rupert-fp -t foo.js --html

Output only ImpureFunction and NoLoops:

rupert-fp -t foo.js --bitmask 6

Output only PointFree, NoLoops and UnnecessaryBraces:

rupert-fp -t foo.js -b 13

The following are all the same (dumps all nodes matching any rule):

rupert-fp -t foo.js
rupert-fp -t foo.js -b 15
rupert-fp -t foo.js --bitmask 255

Known Issues

The following nodes are not yet supported and parsing them will produce surprising and unexpected results (even errors):

License

GPLv3

Author

Benjamin Toll

This site is open source. Improve this page.