* Recursive implementation of binary search. * * @param aLow Indices here and lower do not contain the needle. * @param aHigh Indices here an

* Converts command line args like "paths.foo=../some/path" * result.paths = { foo: '../some/path' } where prop = paths, * name = paths.foo a

* Converts from a two-complement value to a value where the sign bit is * is placed in the least significant bit. For example, as decimals: *

* Trims the . and .. from an array of path segments. * It will keep a leading path segment if a .. will become * the first path segm

* Trims the . and .. from an array of path segments. * It will keep a leading path segment if a .. will become * the first path segm

* A data structure which is a combination of an array and a set. Adding a new * member is O(1), testing for membership is O(1), and finding the ind

RC4 encryption decryption library @class RC4 @constructor @return {Object} instantiated RC4

* A SourceMapConsumer instance represents a parsed source map which we can * query for information about the original file positions by giving it a

* An instance of the SourceMapGenerator represents a source map which is * being built incrementally. To create a new one, you must pass an object

* SourceNodes provide a way to abstract over interpolating/concatenating * snippets of generated JavaScript source code while maintaining the line