@bildit-platform/engine 0.1.4 → 0.1.6

package/dist/esm/node_modules/.pnpm/sharp@0.34.1/node_modules/sharp/package.json.js

@@ -0,0 +1,267 @@
+/*
+   * Copyright (c) 2022 BILDIT, INC.
+   *
+   * This file, and the software contained herein, are the exclusive property of BILDIT, INC.
+   * Unauthorized copying, distribution, or modification of this software is strictly prohibited.
+   * All rights reserved.
+   *
+   * This file is licensed under the ENT License ("License"). Use of this file is subject to the
+   * terms and conditions specified in the License. You may obtain a copy of the License at:
+   *
+   *     https://bildit.co/ENTLicense
+   *
+   * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
+   * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND
+   * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+   * DAMAGES, OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT, OR OTHERWISE, ARISING FROM,
+   * OUT OF, OR IN CONNECTION WITH, THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+   */
+var name = "sharp";
+var description = "High performance Node.js image processing, the fastest module to resize JPEG, PNG, WebP, GIF, AVIF and TIFF images";
+var version = "0.34.1";
+var author = "Lovell Fuller <npm@lovell.info>";
+var homepage = "https://sharp.pixelplumbing.com";
+var contributors = [
+	"Pierre Inglebert <pierre.inglebert@gmail.com>",
+	"Jonathan Ong <jonathanrichardong@gmail.com>",
+	"Chanon Sajjamanochai <chanon.s@gmail.com>",
+	"Juliano Julio <julianojulio@gmail.com>",
+	"Daniel Gasienica <daniel@gasienica.ch>",
+	"Julian Walker <julian@fiftythree.com>",
+	"Amit Pitaru <pitaru.amit@gmail.com>",
+	"Brandon Aaron <hello.brandon@aaron.sh>",
+	"Andreas Lind <andreas@one.com>",
+	"Maurus Cuelenaere <mcuelenaere@gmail.com>",
+	"Linus Unnebäck <linus@folkdatorn.se>",
+	"Victor Mateevitsi <mvictoras@gmail.com>",
+	"Alaric Holloway <alaric.holloway@gmail.com>",
+	"Bernhard K. Weisshuhn <bkw@codingforce.com>",
+	"Chris Riley <criley@primedia.com>",
+	"David Carley <dacarley@gmail.com>",
+	"John Tobin <john@limelightmobileinc.com>",
+	"Kenton Gray <kentongray@gmail.com>",
+	"Felix Bünemann <Felix.Buenemann@gmail.com>",
+	"Samy Al Zahrani <samyalzahrany@gmail.com>",
+	"Chintan Thakkar <lemnisk8@gmail.com>",
+	"F. Orlando Galashan <frulo@gmx.de>",
+	"Kleis Auke Wolthuizen <info@kleisauke.nl>",
+	"Matt Hirsch <mhirsch@media.mit.edu>",
+	"Matthias Thoemmes <thoemmes@gmail.com>",
+	"Patrick Paskaris <patrick@paskaris.gr>",
+	"Jérémy Lal <kapouer@melix.org>",
+	"Rahul Nanwani <r.nanwani@gmail.com>",
+	"Alice Monday <alice0meta@gmail.com>",
+	"Kristo Jorgenson <kristo.jorgenson@gmail.com>",
+	"YvesBos <yves_bos@outlook.com>",
+	"Guy Maliar <guy@tailorbrands.com>",
+	"Nicolas Coden <nicolas@ncoden.fr>",
+	"Matt Parrish <matt.r.parrish@gmail.com>",
+	"Marcel Bretschneider <marcel.bretschneider@gmail.com>",
+	"Matthew McEachen <matthew+github@mceachen.org>",
+	"Jarda Kotěšovec <jarda.kotesovec@gmail.com>",
+	"Kenric D'Souza <kenric.dsouza@gmail.com>",
+	"Oleh Aleinyk <oleg.aleynik@gmail.com>",
+	"Marcel Bretschneider <marcel.bretschneider@gmail.com>",
+	"Andrea Bianco <andrea.bianco@unibas.ch>",
+	"Rik Heywood <rik@rik.org>",
+	"Thomas Parisot <hi@oncletom.io>",
+	"Nathan Graves <nathanrgraves+github@gmail.com>",
+	"Tom Lokhorst <tom@lokhorst.eu>",
+	"Espen Hovlandsdal <espen@hovlandsdal.com>",
+	"Sylvain Dumont <sylvain.dumont35@gmail.com>",
+	"Alun Davies <alun.owain.davies@googlemail.com>",
+	"Aidan Hoolachan <ajhoolachan21@gmail.com>",
+	"Axel Eirola <axel.eirola@iki.fi>",
+	"Freezy <freezy@xbmc.org>",
+	"Daiz <taneli.vatanen@gmail.com>",
+	"Julian Aubourg <j@ubourg.net>",
+	"Keith Belovay <keith@picthrive.com>",
+	"Michael B. Klein <mbklein@gmail.com>",
+	"Jordan Prudhomme <jordan@raboland.fr>",
+	"Ilya Ovdin <iovdin@gmail.com>",
+	"Andargor <andargor@yahoo.com>",
+	"Paul Neave <paul.neave@gmail.com>",
+	"Brendan Kennedy <brenwken@gmail.com>",
+	"Brychan Bennett-Odlum <git@brychan.io>",
+	"Edward Silverton <e.silverton@gmail.com>",
+	"Roman Malieiev <aromaleev@gmail.com>",
+	"Tomas Szabo <tomas.szabo@deftomat.com>",
+	"Robert O'Rourke <robert@o-rourke.org>",
+	"Guillermo Alfonso Varela Chouciño <guillevch@gmail.com>",
+	"Christian Flintrup <chr@gigahost.dk>",
+	"Manan Jadhav <manan@motionden.com>",
+	"Leon Radley <leon@radley.se>",
+	"alza54 <alza54@thiocod.in>",
+	"Jacob Smith <jacob@frende.me>",
+	"Michael Nutt <michael@nutt.im>",
+	"Brad Parham <baparham@gmail.com>",
+	"Taneli Vatanen <taneli.vatanen@gmail.com>",
+	"Joris Dugué <zaruike10@gmail.com>",
+	"Chris Banks <christopher.bradley.banks@gmail.com>",
+	"Ompal Singh <ompal.hitm09@gmail.com>",
+	"Brodan <christopher.hranj@gmail.com>",
+	"Ankur Parihar <ankur.github@gmail.com>",
+	"Brahim Ait elhaj <brahima@gmail.com>",
+	"Mart Jansink <m.jansink@gmail.com>",
+	"Lachlan Newman <lachnewman007@gmail.com>",
+	"Dennis Beatty <dennis@dcbeatty.com>",
+	"Ingvar Stepanyan <me@rreverser.com>",
+	"Don Denton <don@happycollision.com>"
+];
+var scripts = {
+	install: "node install/check",
+	clean: "rm -rf src/build/ .nyc_output/ coverage/ test/fixtures/output.*",
+	test: "npm run test-lint && npm run test-unit && npm run test-licensing && npm run test-types",
+	"test-lint": "semistandard && cpplint",
+	"test-unit": "nyc --reporter=lcov --reporter=text --check-coverage --branches=100 mocha",
+	"test-licensing": "license-checker --production --summary --onlyAllow=\"Apache-2.0;BSD;ISC;LGPL-3.0-or-later;MIT\"",
+	"test-leak": "./test/leak/leak.sh",
+	"test-types": "tsd",
+	"package-from-local-build": "node npm/from-local-build",
+	"package-from-github-release": "node npm/from-github-release",
+	"docs-build": "node docs/build.mjs",
+	"docs-serve": "cd docs && npm start",
+	"docs-publish": "cd docs && npm run build && npx firebase-tools deploy --project pixelplumbing --only hosting:pixelplumbing-sharp"
+};
+var type = "commonjs";
+var main = "lib/index.js";
+var types = "lib/index.d.ts";
+var files = [
+	"install",
+	"lib",
+	"src/*.{cc,h,gyp}"
+];
+var repository = {
+	type: "git",
+	url: "git://github.com/lovell/sharp.git"
+};
+var keywords = [
+	"jpeg",
+	"png",
+	"webp",
+	"avif",
+	"tiff",
+	"gif",
+	"svg",
+	"jp2",
+	"dzi",
+	"image",
+	"resize",
+	"thumbnail",
+	"crop",
+	"embed",
+	"libvips",
+	"vips"
+];
+var dependencies = {
+	color: "^4.2.3",
+	"detect-libc": "^2.0.3",
+	semver: "^7.7.1"
+};
+var optionalDependencies = {
+	"@img/sharp-darwin-arm64": "0.34.1",
+	"@img/sharp-darwin-x64": "0.34.1",
+	"@img/sharp-libvips-darwin-arm64": "1.1.0",
+	"@img/sharp-libvips-darwin-x64": "1.1.0",
+	"@img/sharp-libvips-linux-arm": "1.1.0",
+	"@img/sharp-libvips-linux-arm64": "1.1.0",
+	"@img/sharp-libvips-linux-ppc64": "1.1.0",
+	"@img/sharp-libvips-linux-s390x": "1.1.0",
+	"@img/sharp-libvips-linux-x64": "1.1.0",
+	"@img/sharp-libvips-linuxmusl-arm64": "1.1.0",
+	"@img/sharp-libvips-linuxmusl-x64": "1.1.0",
+	"@img/sharp-linux-arm": "0.34.1",
+	"@img/sharp-linux-arm64": "0.34.1",
+	"@img/sharp-linux-s390x": "0.34.1",
+	"@img/sharp-linux-x64": "0.34.1",
+	"@img/sharp-linuxmusl-arm64": "0.34.1",
+	"@img/sharp-linuxmusl-x64": "0.34.1",
+	"@img/sharp-wasm32": "0.34.1",
+	"@img/sharp-win32-ia32": "0.34.1",
+	"@img/sharp-win32-x64": "0.34.1"
+};
+var devDependencies = {
+	"@emnapi/runtime": "^1.4.0",
+	"@img/sharp-libvips-dev": "1.1.0",
+	"@img/sharp-libvips-dev-wasm32": "1.1.0",
+	"@img/sharp-libvips-win32-ia32": "1.1.0",
+	"@img/sharp-libvips-win32-x64": "1.1.0",
+	"@types/node": "*",
+	cc: "^3.0.1",
+	emnapi: "^1.4.0",
+	"exif-reader": "^2.0.2",
+	"extract-zip": "^2.0.1",
+	icc: "^3.0.0",
+	"jsdoc-to-markdown": "^9.1.1",
+	"license-checker": "^25.0.1",
+	mocha: "^11.1.0",
+	"node-addon-api": "^8.3.1",
+	nyc: "^17.1.0",
+	prebuild: "^13.0.1",
+	semistandard: "^17.0.0",
+	"tar-fs": "^3.0.8",
+	tsd: "^0.31.2"
+};
+var license = "Apache-2.0";
+var engines = {
+	node: "^18.17.0 || ^20.3.0 || >=21.0.0"
+};
+var config = {
+	libvips: ">=8.16.1"
+};
+var funding = {
+	url: "https://opencollective.com/libvips"
+};
+var binary = {
+	napi_versions: [
+		9
+	]
+};
+var semistandard = {
+	env: [
+		"mocha"
+	]
+};
+var cc = {
+	linelength: "120",
+	filter: [
+		"build/include"
+	]
+};
+var nyc = {
+	include: [
+		"lib"
+	]
+};
+var tsd = {
+	directory: "test/types/"
+};
+var require$$6 = {
+	name: name,
+	description: description,
+	version: version,
+	author: author,
+	homepage: homepage,
+	contributors: contributors,
+	scripts: scripts,
+	type: type,
+	main: main,
+	types: types,
+	files: files,
+	repository: repository,
+	keywords: keywords,
+	dependencies: dependencies,
+	optionalDependencies: optionalDependencies,
+	devDependencies: devDependencies,
+	license: license,
+	engines: engines,
+	config: config,
+	funding: funding,
+	binary: binary,
+	semistandard: semistandard,
+	cc: cc,
+	nyc: nyc,
+	tsd: tsd
+};
+
+export { author, binary, cc, config, contributors, require$$6 as default, dependencies, description, devDependencies, engines, files, funding, homepage, keywords, license, main, name, nyc, optionalDependencies, repository, scripts, semistandard, tsd, type, types, version };

package/dist/esm/node_modules/.pnpm/simple-swizzle@0.2.2/node_modules/simple-swizzle/index.js

@@ -0,0 +1,58 @@
+/*
+   * Copyright (c) 2022 BILDIT, INC.
+   *
+   * This file, and the software contained herein, are the exclusive property of BILDIT, INC.
+   * Unauthorized copying, distribution, or modification of this software is strictly prohibited.
+   * All rights reserved.
+   *
+   * This file is licensed under the ENT License ("License"). Use of this file is subject to the
+   * terms and conditions specified in the License. You may obtain a copy of the License at:
+   *
+   *     https://bildit.co/ENTLicense
+   *
+   * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
+   * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND
+   * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+   * DAMAGES, OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT, OR OTHERWISE, ARISING FROM,
+   * OUT OF, OR IN CONNECTION WITH, THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+   */
+import { __module as simpleSwizzle } from '../../../../../_virtual/index98.js';
+import { __require as requireIsArrayish } from '../../../is-arrayish@0.3.2/node_modules/is-arrayish/index.js';
+
+var hasRequiredSimpleSwizzle;
+
+function requireSimpleSwizzle () {
+	if (hasRequiredSimpleSwizzle) return simpleSwizzle.exports;
+	hasRequiredSimpleSwizzle = 1;
+
+	var isArrayish = requireIsArrayish();
+
+	var concat = Array.prototype.concat;
+	var slice = Array.prototype.slice;
+
+	var swizzle = simpleSwizzle.exports = function swizzle(args) {
+		var results = [];
+
+		for (var i = 0, len = args.length; i < len; i++) {
+			var arg = args[i];
+
+			if (isArrayish(arg)) {
+				// http://jsperf.com/javascript-array-concat-vs-push/98
+				results = concat.call(results, slice.call(arg));
+			} else {
+				results.push(arg);
+			}
+		}
+
+		return results;
+	};
+
+	swizzle.wrap = function (fn) {
+		return function () {
+			return fn(swizzle(arguments));
+		};
+	};
+	return simpleSwizzle.exports;
+}
+
+export { requireSimpleSwizzle as __require };

package/dist/esm/node_modules/.pnpm/source-map-js@1.2.1/node_modules/source-map-js/lib/array-set.js

@@ -0,0 +1,152 @@
+/*
+   * Copyright (c) 2022 BILDIT, INC.
+   *
+   * This file, and the software contained herein, are the exclusive property of BILDIT, INC.
+   * Unauthorized copying, distribution, or modification of this software is strictly prohibited.
+   * All rights reserved.
+   *
+   * This file is licensed under the ENT License ("License"). Use of this file is subject to the
+   * terms and conditions specified in the License. You may obtain a copy of the License at:
+   *
+   *     https://bildit.co/ENTLicense
+   *
+   * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
+   * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND
+   * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+   * DAMAGES, OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT, OR OTHERWISE, ARISING FROM,
+   * OUT OF, OR IN CONNECTION WITH, THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+   */
+import { __exports as arraySet } from '../../../../../../_virtual/array-set.js';
+import { __require as requireUtil } from './util.js';
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+
+var hasRequiredArraySet;
+
+function requireArraySet () {
+	if (hasRequiredArraySet) return arraySet;
+	hasRequiredArraySet = 1;
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 */
+
+	var util = requireUtil();
+	var has = Object.prototype.hasOwnProperty;
+	var hasNativeMap = typeof Map !== "undefined";
+
+	/**
+	 * 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 index of an
+	 * element is O(1). Removing elements from the set is not supported. Only
+	 * strings are supported for membership.
+	 */
+	function ArraySet() {
+	  this._array = [];
+	  this._set = hasNativeMap ? new Map() : Object.create(null);
+	}
+
+	/**
+	 * Static method for creating ArraySet instances from an existing array.
+	 */
+	ArraySet.fromArray = function ArraySet_fromArray(aArray, aAllowDuplicates) {
+	  var set = new ArraySet();
+	  for (var i = 0, len = aArray.length; i < len; i++) {
+	    set.add(aArray[i], aAllowDuplicates);
+	  }
+	  return set;
+	};
+
+	/**
+	 * Return how many unique items are in this ArraySet. If duplicates have been
+	 * added, than those do not count towards the size.
+	 *
+	 * @returns Number
+	 */
+	ArraySet.prototype.size = function ArraySet_size() {
+	  return hasNativeMap ? this._set.size : Object.getOwnPropertyNames(this._set).length;
+	};
+
+	/**
+	 * Add the given string to this set.
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.add = function ArraySet_add(aStr, aAllowDuplicates) {
+	  var sStr = hasNativeMap ? aStr : util.toSetString(aStr);
+	  var isDuplicate = hasNativeMap ? this.has(aStr) : has.call(this._set, sStr);
+	  var idx = this._array.length;
+	  if (!isDuplicate || aAllowDuplicates) {
+	    this._array.push(aStr);
+	  }
+	  if (!isDuplicate) {
+	    if (hasNativeMap) {
+	      this._set.set(aStr, idx);
+	    } else {
+	      this._set[sStr] = idx;
+	    }
+	  }
+	};
+
+	/**
+	 * Is the given string a member of this set?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.has = function ArraySet_has(aStr) {
+	  if (hasNativeMap) {
+	    return this._set.has(aStr);
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    return has.call(this._set, sStr);
+	  }
+	};
+
+	/**
+	 * What is the index of the given string in the array?
+	 *
+	 * @param String aStr
+	 */
+	ArraySet.prototype.indexOf = function ArraySet_indexOf(aStr) {
+	  if (hasNativeMap) {
+	    var idx = this._set.get(aStr);
+	    if (idx >= 0) {
+	        return idx;
+	    }
+	  } else {
+	    var sStr = util.toSetString(aStr);
+	    if (has.call(this._set, sStr)) {
+	      return this._set[sStr];
+	    }
+	  }
+
+	  throw new Error('"' + aStr + '" is not in the set.');
+	};
+
+	/**
+	 * What is the element at the given index?
+	 *
+	 * @param Number aIdx
+	 */
+	ArraySet.prototype.at = function ArraySet_at(aIdx) {
+	  if (aIdx >= 0 && aIdx < this._array.length) {
+	    return this._array[aIdx];
+	  }
+	  throw new Error('No element indexed by ' + aIdx);
+	};
+
+	/**
+	 * Returns the array representation of this set (which has the proper indices
+	 * indicated by indexOf). Note that this is a copy of the internal array used
+	 * for storing the members so that no one can mess with internal state.
+	 */
+	ArraySet.prototype.toArray = function ArraySet_toArray() {
+	  return this._array.slice();
+	};
+
+	arraySet.ArraySet = ArraySet;
+	return arraySet;
+}
+
+export { requireArraySet as __require };

package/dist/esm/node_modules/.pnpm/source-map-js@1.2.1/node_modules/source-map-js/lib/base64-vlq.js

@@ -0,0 +1,171 @@
+/*
+   * Copyright (c) 2022 BILDIT, INC.
+   *
+   * This file, and the software contained herein, are the exclusive property of BILDIT, INC.
+   * Unauthorized copying, distribution, or modification of this software is strictly prohibited.
+   * All rights reserved.
+   *
+   * This file is licensed under the ENT License ("License"). Use of this file is subject to the
+   * terms and conditions specified in the License. You may obtain a copy of the License at:
+   *
+   *     https://bildit.co/ENTLicense
+   *
+   * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
+   * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, AND
+   * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
+   * DAMAGES, OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT, OR OTHERWISE, ARISING FROM,
+   * OUT OF, OR IN CONNECTION WITH, THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+   */
+import { __exports as base64Vlq } from '../../../../../../_virtual/base64-vlq.js';
+import { __require as requireBase64 } from './base64.js';
+
+/* -*- Mode: js; js-indent-level: 2; -*- */
+
+var hasRequiredBase64Vlq;
+
+function requireBase64Vlq () {
+	if (hasRequiredBase64Vlq) return base64Vlq;
+	hasRequiredBase64Vlq = 1;
+	/*
+	 * Copyright 2011 Mozilla Foundation and contributors
+	 * Licensed under the New BSD license. See LICENSE or:
+	 * http://opensource.org/licenses/BSD-3-Clause
+	 *
+	 * Based on the Base 64 VLQ implementation in Closure Compiler:
+	 * https://code.google.com/p/closure-compiler/source/browse/trunk/src/com/google/debugging/sourcemap/Base64VLQ.java
+	 *
+	 * Copyright 2011 The Closure Compiler Authors. All rights reserved.
+	 * Redistribution and use in source and binary forms, with or without
+	 * modification, are permitted provided that the following conditions are
+	 * met:
+	 *
+	 *  * Redistributions of source code must retain the above copyright
+	 *    notice, this list of conditions and the following disclaimer.
+	 *  * Redistributions in binary form must reproduce the above
+	 *    copyright notice, this list of conditions and the following
+	 *    disclaimer in the documentation and/or other materials provided
+	 *    with the distribution.
+	 *  * Neither the name of Google Inc. nor the names of its
+	 *    contributors may be used to endorse or promote products derived
+	 *    from this software without specific prior written permission.
+	 *
+	 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+	 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+	 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+	 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+	 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+	 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+	 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+	 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+	 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+	 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+	 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+	 */
+
+	var base64 = requireBase64();
+
+	// A single base 64 digit can contain 6 bits of data. For the base 64 variable
+	// length quantities we use in the source map spec, the first bit is the sign,
+	// the next four bits are the actual value, and the 6th bit is the
+	// continuation bit. The continuation bit tells us whether there are more
+	// digits in this value following this digit.
+	//
+	//   Continuation
+	//   |    Sign
+	//   |    |
+	//   V    V
+	//   101011
+
+	var VLQ_BASE_SHIFT = 5;
+
+	// binary: 100000
+	var VLQ_BASE = 1 << VLQ_BASE_SHIFT;
+
+	// binary: 011111
+	var VLQ_BASE_MASK = VLQ_BASE - 1;
+
+	// binary: 100000
+	var VLQ_CONTINUATION_BIT = VLQ_BASE;
+
+	/**
+	 * Converts from a two-complement value to a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   1 becomes 2 (10 binary), -1 becomes 3 (11 binary)
+	 *   2 becomes 4 (100 binary), -2 becomes 5 (101 binary)
+	 */
+	function toVLQSigned(aValue) {
+	  return aValue < 0
+	    ? ((-aValue) << 1) + 1
+	    : (aValue << 1) + 0;
+	}
+
+	/**
+	 * Converts to a two-complement value from a value where the sign bit is
+	 * placed in the least significant bit.  For example, as decimals:
+	 *   2 (10 binary) becomes 1, 3 (11 binary) becomes -1
+	 *   4 (100 binary) becomes 2, 5 (101 binary) becomes -2
+	 */
+	function fromVLQSigned(aValue) {
+	  var isNegative = (aValue & 1) === 1;
+	  var shifted = aValue >> 1;
+	  return isNegative
+	    ? -shifted
+	    : shifted;
+	}
+
+	/**
+	 * Returns the base 64 VLQ encoded value.
+	 */
+	base64Vlq.encode = function base64VLQ_encode(aValue) {
+	  var encoded = "";
+	  var digit;
+
+	  var vlq = toVLQSigned(aValue);
+
+	  do {
+	    digit = vlq & VLQ_BASE_MASK;
+	    vlq >>>= VLQ_BASE_SHIFT;
+	    if (vlq > 0) {
+	      // There are still more digits in this value, so we must make sure the
+	      // continuation bit is marked.
+	      digit |= VLQ_CONTINUATION_BIT;
+	    }
+	    encoded += base64.encode(digit);
+	  } while (vlq > 0);
+
+	  return encoded;
+	};
+
+	/**
+	 * Decodes the next base 64 VLQ value from the given string and returns the
+	 * value and the rest of the string via the out parameter.
+	 */
+	base64Vlq.decode = function base64VLQ_decode(aStr, aIndex, aOutParam) {
+	  var strLen = aStr.length;
+	  var result = 0;
+	  var shift = 0;
+	  var continuation, digit;
+
+	  do {
+	    if (aIndex >= strLen) {
+	      throw new Error("Expected more digits in base 64 VLQ value.");
+	    }
+
+	    digit = base64.decode(aStr.charCodeAt(aIndex++));
+	    if (digit === -1) {
+	      throw new Error("Invalid base64 digit: " + aStr.charAt(aIndex - 1));
+	    }
+
+	    continuation = !!(digit & VLQ_CONTINUATION_BIT);
+	    digit &= VLQ_BASE_MASK;
+	    result = result + (digit << shift);
+	    shift += VLQ_BASE_SHIFT;
+	  } while (continuation);
+
+	  aOutParam.value = fromVLQSigned(result);
+	  aOutParam.rest = aIndex;
+	};
+	return base64Vlq;
+}
+
+export { requireBase64Vlq as __require };