ibowankenobi-mergesort/util/prependModuleDef.js

Merge Sort algorithm implementation without recursion, using cached binary trees

!function(){
	var VERSION = process.env.npm_package_version,
		LOCATION = process.env.CUSTOM_LOC,
		lRgx = /mergesort\.(?:[0-9]+\.){3}(?:evergreen|es5)\.js/i,
		fs = require('fs'),
		path = require('path'),
		files = fs.readdirSync(LOCATION).filter(fName => lRgx.test(fName)),
		filePaths = files.map(fileBase => path.join(LOCATION, fileBase));
	
	filePaths.forEach(file => {
		let data = fs.readFileSync(file, 'utf8');
		data = 
`/**
* Mergesort module
* @module Mergesort
*/\n` 
		+ data;
		fs.writeFileSync(file,data);
	});
}();