Jump To …

neuron.js 

/*
 * neuron.js: Creates and manages jobs and job results. 
 *
 * (C) 2010 Charlie Robbins
 * MIT LICENSE
 *
 */

require.paths.unshift(__dirname);

var neuron = exports;

Version 0.3.0

 
neuron.version = [0, 3, 0];

Export Components

Export each of the core prototypes exposed by neuron.

 
neuron.JobManager = require('neuron/job-manager').JobManager;
neuron.Job        = require('neuron/job').Job;
neuron.Worker     = require('neuron/worker').Worker;

We create and expose a defaultManager so that the programmer may do the following without the need to create an instance of neuron.JobManager directly:

var neuron = require('neuron');
neuron.addJob('some-job', {
  work: function () { /* Do some work */ }
});

neuron.enqueue('some-job', { arguments: ['to', 'your', 'job'] });
neuron.on('finish', function (job, worker) {
  // The job is now finished
});

var defaultManager = new neuron.JobManager();
['addJob', 'enqueue', 'getWorker'].forEach(function (method) {
  neuron[method] = function () { 
    return defaultManager[method].apply(defaultManager, arguments);
  };
});

function randomString (bits)

@bits {int} Number of bits for the random string to have (base64)

randomString returns a pseude-random ASCII string which contains at least the specified number of bits of entropy the return value is a string of length ⌈bits/6⌉ of characters from the base64 alphabet

 
neuron.randomString = function (bits) {
  var chars, rand, i, ret;
  chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_';
  ret = '';

in v8, Math.random() yields 32 pseudo-random bits (in spidermonkey it gives 53)

 
  while (bits > 0) {
    rand = Math.floor(Math.random()*0x100000000) // 32-bit integer

base 64 means 6 bits per character, so we use the top 30 bits from rand to give 30/6=5 characters.

 
    for (i=26; i>0 && bits>0; i-=6, bits-=6) { 
      ret+=chars[0x3F & rand >>> i];
    }
  }
  return ret;
};