A JavaScript Modules Manager That Fits in a Tweet

ES6 does provide modules; but unless you’re using Babel you’ll have to rely on third-party libraries such as RequireJS until all major browsers support them.

I use D3 everyday to visualize data about ego networks and have a small (400-500 SLOC) JavaScript codebase I need to keep organized. In the context I work in I must keep things simple as I won’t always be there to maintain the code I’m writing today.

How simple a modules implementation could possibly be? It should at least be able to register modules and require a module inside another; much like Python’s import . It should also handle issues like circular dependencies (e.g. foo requires bar which requires foo ) and undeclared modules. Modules should be lazily loaded, i.e. only when they are required; and requiring twice the same module shouldn’t execute it twice.

Well, here is one:

p = { f : {}, m : {}, r : function ( a , b ){ p . f [ a ] = b }, g : function ( a ){ if ( ! p . m [ a ]){ if ( p . m [ a ] < 1 |! p . f [ a ]) throw "p:" + a ; p . m [ a ] = 0 ; p . m [ a ] = p . f [ a ]( p )} return p . m [ a ]}};

It’s 136-bytes long. 139 if you count the variable definition. At this level you can’t expect long function names but here is an usage example:

// register a "main" module. A module consists of a name and a // function that takes an object used to require other modules. p . r ( "main" , function ( r ) { // get the "num" module and store it in a `num` variable var num = r . g ( "num" ); // use it to print something console . log ( num . add ( 20 , 22 )); }); // register a "num" module p . r ( "num" , function ( r ) { // a module can export bindings by returning an object return { add : function ( a , b ) { return a + b ; }, }; }); // call the "main" module p . g ( "main" );

This code will print 42 in the console. It only uses two modules but the implementation works with an arbitrary number of modules. A module can depend on any number of other modules that can be declared in an arbitrary order.

Consider this example:

p . r ( "m1" , function ( r ) { r . g ( "m2" ); }); p . r ( "m2" , function ( r ) { r . g ( "m3" ); }); p . r ( "m3" , function ( r ) { r . g ( "m1" ); }); p . g ( "m1" );

m1 depends on m2 which depends on m3 which itself depends on m1 . The implementation won’t die in an endless loop leading to a stack overflow but will fail as soon as it detects the loop:

p : m1

Admittedly this error message doesn’t give us too information but we have to be thrifty in order to fit under 140 characters. The prefix p: tells you the error comes from p , and the part after is the faulty module. It can either be a wrong name (the module doesn’t exist) or a circular dependency.

Walk-through

Note: don’t use this at home. This is just an experiment; I eventually used Browserify for my project.

We need an object to map modules to their functions; we’ll populate it on calls to register . We need another object to store the result of their function call; i.e. what they export. I added a third object to “lock” a module while it’s executed in order to detect circular dependencies.

We’ll have something like that:

var p = { _fn : {}, // the functions _m : {}, // the modules’ exported values _lock : {}, // the locks register : function ( name , callback ) { // add the function in the object p . _fn [ name ] = callback ; }, get : function ( name ) { // if we have a value for this module let’s return it. // Note that we should use `.hasOwnProperty` here // because this’ll fail if the module returns a falsy // value. This is not really important for this problem. if ( p . _m [ name ]) { return p . _m [ name ]; } // if it’s locked that’s because we’re already getting // it; so there’s a recursive requirement if ( p . _lock [ name ]) { throw "Recursive requirement: '" + name + "'" ; } // if we don’t have any function for this we can’t // execute it and get its value. See also the // remark about `.hasOwnProperty` above. if ( ! p . _fn [ name ]) { throw "Unknown module '" + name + "'" ; } // we lock the module so we can detect circular // requirements. p . _lock [ name ] = true ; try { // execute the module's function and pass // ourselves to it so it can require other // modules with p.get. p . _m [ name ] = p . _fn [ name ]( p ); } finally { // ensure we *always* remove the lock. delete p . _lock [ name ]; } // return the result return p . _m [ name ]; }, };

This works and is pretty short; but that won’t fit in a Tweet ;)

Let’s compact the exceptions into one because those strings take a lot of place:

if ( p . _lock [ name ] || ! p . _fn [ name ]) { throw "Module error: " + name ; }

The error is less explicit but we’ll accept that here.

We try to get as little code as possible then use YUI Compressor to remove the spaces and rename the variables. This means we can still work with (mostly) readable code and let YUI Compressor do the rest for us.

I measure the final code size with the following command:

yuicompressor p.js | wc -c

Right now we have 240 bytes. We need a way to remove 100 bytes. Let’s rename the attributes. _fn becomes f ; _m becomes m , _lock becomes l and the public methods are reduced to their first letter. We can also remove the var since p will be global anyway. Let’s also reduce the error message prefix to "p:" .

p = { f : {}, m : {}, l : {}, r : function ( name , callback ) { p . f [ name ] = callback ; }, g : function ( name ) { if ( p . m [ name ]) { return p . m [ name ]; } if ( p . l [ name ] || ! p . f [ name ]) { throw "p:" + name ; } p . l [ name ] = true ; try { p . m [ name ] = p . f [ name ]( p ); } finally { delete p . l [ name ]; } return p . m [ name ]; }, };

That’s 186 bytes once compressed. Not bad! Note that we have twice the same line in the g function (previously known as “ get ”):

return p . m [ name ];

We can invert the first if condition and fit the whole code in it; combining both return s into one. This is equivalent to transforming this code:

function () { if ( A ) { return B ; } // ... return B ; }

Into this one:

function () { if ( ! A ) { // ... } return B ; }

The first form is preferable because it removes one indentation level for the function body. But here return is a keyword we can’t compress.

Speaking of keyword we can’t compress; how could we remove the delete ? All we care about is to know if there’s a lock or not, so we can set the value to false instead, at the expense of more memory. This saves us only one byte but since we only care about the boolean values we can replace true with 1 and false with 0 .

We’re now at 166 bytes and the g function looks like this:

function ( name ) { if ( ! p . m [ name ]) { if ( p . l [ name ] || ! p . f [ name ]) { throw "p:" + name ; } p . l [ name ] = 1 ; try { p . m [ name ] = p . f [ name ]( p ); } finally { p . l [ name ] = 0 ; } } return p . m [ name ]; }

Now, what if we tried to remove one of the three objects we’re using? We need to keep the functions and the results in separate objects but we might be able to remove the locks object without losing the functionality.

Assuming that modules only return objects let’s merge m and l . We’ll set p.m[A] to 0 if it’s locked and will then override the lock with the result. p.m[A] then have the following possible values:

undefined : the key doesn’t exist; the module hasn’t been required yet

: the key doesn’t exist; the module hasn’t been required yet 0 : the module is currently being executed

: the module is currently being executed something else: the module has already been executed; we have its return value

We need to modify our code a little bit for this:

function ( name ) { if ( ! p . m [ name ]) { if ( p . m [ name ] === 0 || ! p . f [ name ]) { throw "p:" + name ; } p . m [ name ] = 0 ; p . m [ name ] = p . f [ name ]( p ); } return p . m [ name ]; }

Note that this allowed us to get ride of the try / finally which let us go down to 143 bytes. We can already save two bytes by using < 1 instead of === 0 .

Replacing || (boolean OR ) with | (binary OR ) saves one more byte and allows us to fit in 140 bytes! We can go further and remove the brackets for the inner if since it only has one instruction. We need to do that after the compression because YUI Compressor adds brackets if they’re missing.

The final code looks like this:

p = { f : {}, m : {}, r : function ( name , callback ) { p . f [ name ] = callback ; }, g : function ( name ) { if ( ! p . m [ name ]) { if ( p . m [ name ] < 1 | ! p . f [ name ]) throw "p:" + name ; p . m [ name ] = 0 ; p . m [ name ] = p . f [ name ]( p ); } return p . m [ name ]; }, };

That’s 139 bytes once compressed! You can see the result at the top of this blog post.

Please add a comment below if you think of any way to reduce this further while preserving all existing features.

Thank you for reading!