diff --git a/dist/g.js b/dist/g.js
index beafbed..2277060 100644
--- a/dist/g.js
+++ b/dist/g.js
@@ -1,9770 +1,9603 @@
 (function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.g = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
-(function (process){
-/*global setImmediate: false, setTimeout: false, console: false */
-(function () {
+(function (process,global){
+(function (global, factory) {
+    typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
+    typeof define === 'function' && define.amd ? define(['exports'], factory) :
+    (factory((global.async = global.async || {})));
+}(this, (function (exports) { 'use strict';
+
+/**
+ * A faster alternative to `Function#apply`, this function invokes `func`
+ * with the `this` binding of `thisArg` and the arguments of `args`.
+ *
+ * @private
+ * @param {Function} func The function to invoke.
+ * @param {*} thisArg The `this` binding of `func`.
+ * @param {Array} args The arguments to invoke `func` with.
+ * @returns {*} Returns the result of `func`.
+ */
+function apply(func, thisArg, args) {
+  switch (args.length) {
+    case 0: return func.call(thisArg);
+    case 1: return func.call(thisArg, args[0]);
+    case 2: return func.call(thisArg, args[0], args[1]);
+    case 3: return func.call(thisArg, args[0], args[1], args[2]);
+  }
+  return func.apply(thisArg, args);
+}
 
-    var async = {};
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeMax = Math.max;
 
-    // global on the server, window in the browser
-    var root, previous_async;
+/**
+ * A specialized version of `baseRest` which transforms the rest array.
+ *
+ * @private
+ * @param {Function} func The function to apply a rest parameter to.
+ * @param {number} [start=func.length-1] The start position of the rest parameter.
+ * @param {Function} transform The rest array transform.
+ * @returns {Function} Returns the new function.
+ */
+function overRest$1(func, start, transform) {
+  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);
+  return function() {
+    var args = arguments,
+        index = -1,
+        length = nativeMax(args.length - start, 0),
+        array = Array(length);
 
-    root = this;
-    if (root != null) {
-      previous_async = root.async;
+    while (++index < length) {
+      array[index] = args[start + index];
+    }
+    index = -1;
+    var otherArgs = Array(start + 1);
+    while (++index < start) {
+      otherArgs[index] = args[index];
     }
+    otherArgs[start] = transform(array);
+    return apply(func, this, otherArgs);
+  };
+}
 
-    async.noConflict = function () {
-        root.async = previous_async;
-        return async;
-    };
+/**
+ * This method returns the first argument it receives.
+ *
+ * @static
+ * @since 0.1.0
+ * @memberOf _
+ * @category Util
+ * @param {*} value Any value.
+ * @returns {*} Returns `value`.
+ * @example
+ *
+ * var object = { 'a': 1 };
+ *
+ * console.log(_.identity(object) === object);
+ * // => true
+ */
+function identity(value) {
+  return value;
+}
 
-    function only_once(fn) {
-        var called = false;
-        return function() {
-            if (called) throw new Error("Callback was already called.");
-            called = true;
-            fn.apply(root, arguments);
-        }
-    }
+// Lodash rest function without function.toString()
+// remappings
+function rest(func, start) {
+    return overRest$1(func, start, identity);
+}
 
-    //// cross-browser compatiblity functions ////
+var initialParams = function (fn) {
+    return rest(function (args /*..., callback*/) {
+        var callback = args.pop();
+        fn.call(this, args, callback);
+    });
+};
 
-    var _each = function (arr, iterator) {
-        if (arr.forEach) {
-            return arr.forEach(iterator);
-        }
-        for (var i = 0; i < arr.length; i += 1) {
-            iterator(arr[i], i, arr);
+function applyEach$1(eachfn) {
+    return rest(function (fns, args) {
+        var go = initialParams(function (args, callback) {
+            var that = this;
+            return eachfn(fns, function (fn, cb) {
+                fn.apply(that, args.concat([cb]));
+            }, callback);
+        });
+        if (args.length) {
+            return go.apply(this, args);
+        } else {
+            return go;
         }
-    };
+    });
+}
 
-    var _map = function (arr, iterator) {
-        if (arr.map) {
-            return arr.map(iterator);
-        }
-        var results = [];
-        _each(arr, function (x, i, a) {
-            results.push(iterator(x, i, a));
-        });
-        return results;
-    };
+/** Detect free variable `global` from Node.js. */
+var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;
 
-    var _reduce = function (arr, iterator, memo) {
-        if (arr.reduce) {
-            return arr.reduce(iterator, memo);
-        }
-        _each(arr, function (x, i, a) {
-            memo = iterator(memo, x, i, a);
-        });
-        return memo;
-    };
+/** Detect free variable `self`. */
+var freeSelf = typeof self == 'object' && self && self.Object === Object && self;
 
-    var _keys = function (obj) {
-        if (Object.keys) {
-            return Object.keys(obj);
-        }
-        var keys = [];
-        for (var k in obj) {
-            if (obj.hasOwnProperty(k)) {
-                keys.push(k);
-            }
-        }
-        return keys;
-    };
+/** Used as a reference to the global object. */
+var root = freeGlobal || freeSelf || Function('return this')();
 
-    //// exported async module functions ////
+/** Built-in value references. */
+var Symbol$1 = root.Symbol;
 
-    //// nextTick implementation with browser-compatible fallback ////
-    if (typeof process === 'undefined' || !(process.nextTick)) {
-        if (typeof setImmediate === 'function') {
-            async.nextTick = function (fn) {
-                // not a direct alias for IE10 compatibility
-                setImmediate(fn);
-            };
-            async.setImmediate = async.nextTick;
-        }
-        else {
-            async.nextTick = function (fn) {
-                setTimeout(fn, 0);
-            };
-            async.setImmediate = async.nextTick;
-        }
-    }
-    else {
-        async.nextTick = process.nextTick;
-        if (typeof setImmediate !== 'undefined') {
-            async.setImmediate = function (fn) {
-              // not a direct alias for IE10 compatibility
-              setImmediate(fn);
-            };
-        }
-        else {
-            async.setImmediate = async.nextTick;
-        }
+/** Used for built-in method references. */
+var objectProto = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty = objectProto.hasOwnProperty;
+
+/**
+ * Used to resolve the
+ * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+ * of values.
+ */
+var nativeObjectToString = objectProto.toString;
+
+/** Built-in value references. */
+var symToStringTag$1 = Symbol$1 ? Symbol$1.toStringTag : undefined;
+
+/**
+ * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.
+ *
+ * @private
+ * @param {*} value The value to query.
+ * @returns {string} Returns the raw `toStringTag`.
+ */
+function getRawTag(value) {
+  var isOwn = hasOwnProperty.call(value, symToStringTag$1),
+      tag = value[symToStringTag$1];
+
+  try {
+    value[symToStringTag$1] = undefined;
+    var unmasked = true;
+  } catch (e) {}
+
+  var result = nativeObjectToString.call(value);
+  if (unmasked) {
+    if (isOwn) {
+      value[symToStringTag$1] = tag;
+    } else {
+      delete value[symToStringTag$1];
     }
+  }
+  return result;
+}
 
-    async.each = function (arr, iterator, callback) {
-        callback = callback || function () {};
-        if (!arr.length) {
-            return callback();
-        }
-        var completed = 0;
-        _each(arr, function (x) {
-            iterator(x, only_once(function (err) {
-                if (err) {
-                    callback(err);
-                    callback = function () {};
-                }
-                else {
-                    completed += 1;
-                    if (completed >= arr.length) {
-                        callback(null);
-                    }
-                }
-            }));
-        });
-    };
-    async.forEach = async.each;
+/** Used for built-in method references. */
+var objectProto$1 = Object.prototype;
 
-    async.eachSeries = function (arr, iterator, callback) {
-        callback = callback || function () {};
-        if (!arr.length) {
-            return callback();
-        }
-        var completed = 0;
-        var iterate = function () {
-            iterator(arr[completed], function (err) {
-                if (err) {
-                    callback(err);
-                    callback = function () {};
-                }
-                else {
-                    completed += 1;
-                    if (completed >= arr.length) {
-                        callback(null);
-                    }
-                    else {
-                        iterate();
-                    }
-                }
-            });
-        };
-        iterate();
-    };
-    async.forEachSeries = async.eachSeries;
+/**
+ * Used to resolve the
+ * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+ * of values.
+ */
+var nativeObjectToString$1 = objectProto$1.toString;
 
-    async.eachLimit = function (arr, limit, iterator, callback) {
-        var fn = _eachLimit(limit);
-        fn.apply(null, [arr, iterator, callback]);
-    };
-    async.forEachLimit = async.eachLimit;
+/**
+ * Converts `value` to a string using `Object.prototype.toString`.
+ *
+ * @private
+ * @param {*} value The value to convert.
+ * @returns {string} Returns the converted string.
+ */
+function objectToString(value) {
+  return nativeObjectToString$1.call(value);
+}
 
-    var _eachLimit = function (limit) {
+/** `Object#toString` result references. */
+var nullTag = '[object Null]';
+var undefinedTag = '[object Undefined]';
 
-        return function (arr, iterator, callback) {
-            callback = callback || function () {};
-            if (!arr.length || limit <= 0) {
-                return callback();
-            }
-            var completed = 0;
-            var started = 0;
-            var running = 0;
+/** Built-in value references. */
+var symToStringTag = Symbol$1 ? Symbol$1.toStringTag : undefined;
 
-            (function replenish () {
-                if (completed >= arr.length) {
-                    return callback();
-                }
+/**
+ * The base implementation of `getTag` without fallbacks for buggy environments.
+ *
+ * @private
+ * @param {*} value The value to query.
+ * @returns {string} Returns the `toStringTag`.
+ */
+function baseGetTag(value) {
+  if (value == null) {
+    return value === undefined ? undefinedTag : nullTag;
+  }
+  value = Object(value);
+  return (symToStringTag && symToStringTag in value)
+    ? getRawTag(value)
+    : objectToString(value);
+}
 
-                while (running < limit && started < arr.length) {
-                    started += 1;
-                    running += 1;
-                    iterator(arr[started - 1], function (err) {
-                        if (err) {
-                            callback(err);
-                            callback = function () {};
-                        }
-                        else {
-                            completed += 1;
-                            running -= 1;
-                            if (completed >= arr.length) {
-                                callback();
-                            }
-                            else {
-                                replenish();
-                            }
-                        }
-                    });
-                }
-            })();
-        };
-    };
+/**
+ * Checks if `value` is the
+ * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)
+ * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an object, else `false`.
+ * @example
+ *
+ * _.isObject({});
+ * // => true
+ *
+ * _.isObject([1, 2, 3]);
+ * // => true
+ *
+ * _.isObject(_.noop);
+ * // => true
+ *
+ * _.isObject(null);
+ * // => false
+ */
+function isObject(value) {
+  var type = typeof value;
+  return value != null && (type == 'object' || type == 'function');
+}
 
+/** `Object#toString` result references. */
+var asyncTag = '[object AsyncFunction]';
+var funcTag = '[object Function]';
+var genTag = '[object GeneratorFunction]';
+var proxyTag = '[object Proxy]';
 
-    var doParallel = function (fn) {
-        return function () {
-            var args = Array.prototype.slice.call(arguments);
-            return fn.apply(null, [async.each].concat(args));
-        };
-    };
-    var doParallelLimit = function(limit, fn) {
-        return function () {
-            var args = Array.prototype.slice.call(arguments);
-            return fn.apply(null, [_eachLimit(limit)].concat(args));
-        };
-    };
-    var doSeries = function (fn) {
-        return function () {
-            var args = Array.prototype.slice.call(arguments);
-            return fn.apply(null, [async.eachSeries].concat(args));
-        };
-    };
+/**
+ * Checks if `value` is classified as a `Function` object.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a function, else `false`.
+ * @example
+ *
+ * _.isFunction(_);
+ * // => true
+ *
+ * _.isFunction(/abc/);
+ * // => false
+ */
+function isFunction(value) {
+  if (!isObject(value)) {
+    return false;
+  }
+  // The use of `Object#toString` avoids issues with the `typeof` operator
+  // in Safari 9 which returns 'object' for typed arrays and other constructors.
+  var tag = baseGetTag(value);
+  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;
+}
 
+/** Used as references for various `Number` constants. */
+var MAX_SAFE_INTEGER = 9007199254740991;
 
-    var _asyncMap = function (eachfn, arr, iterator, callback) {
-        var results = [];
-        arr = _map(arr, function (x, i) {
-            return {index: i, value: x};
-        });
-        eachfn(arr, function (x, callback) {
-            iterator(x.value, function (err, v) {
-                results[x.index] = v;
-                callback(err);
-            });
-        }, function (err) {
-            callback(err, results);
-        });
-    };
-    async.map = doParallel(_asyncMap);
-    async.mapSeries = doSeries(_asyncMap);
-    async.mapLimit = function (arr, limit, iterator, callback) {
-        return _mapLimit(limit)(arr, iterator, callback);
-    };
+/**
+ * Checks if `value` is a valid array-like length.
+ *
+ * **Note:** This method is loosely based on
+ * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.
+ * @example
+ *
+ * _.isLength(3);
+ * // => true
+ *
+ * _.isLength(Number.MIN_VALUE);
+ * // => false
+ *
+ * _.isLength(Infinity);
+ * // => false
+ *
+ * _.isLength('3');
+ * // => false
+ */
+function isLength(value) {
+  return typeof value == 'number' &&
+    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
+}
 
-    var _mapLimit = function(limit) {
-        return doParallelLimit(limit, _asyncMap);
-    };
+/**
+ * Checks if `value` is array-like. A value is considered array-like if it's
+ * not a function and has a `value.length` that's an integer greater than or
+ * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
+ * @example
+ *
+ * _.isArrayLike([1, 2, 3]);
+ * // => true
+ *
+ * _.isArrayLike(document.body.children);
+ * // => true
+ *
+ * _.isArrayLike('abc');
+ * // => true
+ *
+ * _.isArrayLike(_.noop);
+ * // => false
+ */
+function isArrayLike(value) {
+  return value != null && isLength(value.length) && !isFunction(value);
+}
 
-    // reduce only has a series version, as doing reduce in parallel won't
-    // work in many situations.
-    async.reduce = function (arr, memo, iterator, callback) {
-        async.eachSeries(arr, function (x, callback) {
-            iterator(memo, x, function (err, v) {
-                memo = v;
-                callback(err);
-            });
-        }, function (err) {
-            callback(err, memo);
-        });
-    };
-    // inject alias
-    async.inject = async.reduce;
-    // foldl alias
-    async.foldl = async.reduce;
-
-    async.reduceRight = function (arr, memo, iterator, callback) {
-        var reversed = _map(arr, function (x) {
-            return x;
-        }).reverse();
-        async.reduce(reversed, memo, iterator, callback);
-    };
-    // foldr alias
-    async.foldr = async.reduceRight;
+/**
+ * This method returns `undefined`.
+ *
+ * @static
+ * @memberOf _
+ * @since 2.3.0
+ * @category Util
+ * @example
+ *
+ * _.times(2, _.noop);
+ * // => [undefined, undefined]
+ */
+function noop() {
+  // No operation performed.
+}
 
-    var _filter = function (eachfn, arr, iterator, callback) {
-        var results = [];
-        arr = _map(arr, function (x, i) {
-            return {index: i, value: x};
-        });
-        eachfn(arr, function (x, callback) {
-            iterator(x.value, function (v) {
-                if (v) {
-                    results.push(x);
-                }
-                callback();
-            });
-        }, function (err) {
-            callback(_map(results.sort(function (a, b) {
-                return a.index - b.index;
-            }), function (x) {
-                return x.value;
-            }));
-        });
+function once(fn) {
+    return function () {
+        if (fn === null) return;
+        var callFn = fn;
+        fn = null;
+        callFn.apply(this, arguments);
     };
-    async.filter = doParallel(_filter);
-    async.filterSeries = doSeries(_filter);
-    // select alias
-    async.select = async.filter;
-    async.selectSeries = async.filterSeries;
+}
 
-    var _reject = function (eachfn, arr, iterator, callback) {
-        var results = [];
-        arr = _map(arr, function (x, i) {
-            return {index: i, value: x};
-        });
-        eachfn(arr, function (x, callback) {
-            iterator(x.value, function (v) {
-                if (!v) {
-                    results.push(x);
-                }
-                callback();
-            });
-        }, function (err) {
-            callback(_map(results.sort(function (a, b) {
-                return a.index - b.index;
-            }), function (x) {
-                return x.value;
-            }));
-        });
-    };
-    async.reject = doParallel(_reject);
-    async.rejectSeries = doSeries(_reject);
-
-    var _detect = function (eachfn, arr, iterator, main_callback) {
-        eachfn(arr, function (x, callback) {
-            iterator(x, function (result) {
-                if (result) {
-                    main_callback(x);
-                    main_callback = function () {};
-                }
-                else {
-                    callback();
-                }
-            });
-        }, function (err) {
-            main_callback();
-        });
-    };
-    async.detect = doParallel(_detect);
-    async.detectSeries = doSeries(_detect);
+var iteratorSymbol = typeof Symbol === 'function' && Symbol.iterator;
 
-    async.some = function (arr, iterator, main_callback) {
-        async.each(arr, function (x, callback) {
-            iterator(x, function (v) {
-                if (v) {
-                    main_callback(true);
-                    main_callback = function () {};
-                }
-                callback();
-            });
-        }, function (err) {
-            main_callback(false);
-        });
-    };
-    // any alias
-    async.any = async.some;
-
-    async.every = function (arr, iterator, main_callback) {
-        async.each(arr, function (x, callback) {
-            iterator(x, function (v) {
-                if (!v) {
-                    main_callback(false);
-                    main_callback = function () {};
-                }
-                callback();
-            });
-        }, function (err) {
-            main_callback(true);
-        });
-    };
-    // all alias
-    async.all = async.every;
+var getIterator = function (coll) {
+    return iteratorSymbol && coll[iteratorSymbol] && coll[iteratorSymbol]();
+};
 
-    async.sortBy = function (arr, iterator, callback) {
-        async.map(arr, function (x, callback) {
-            iterator(x, function (err, criteria) {
-                if (err) {
-                    callback(err);
-                }
-                else {
-                    callback(null, {value: x, criteria: criteria});
-                }
-            });
-        }, function (err, results) {
-            if (err) {
-                return callback(err);
-            }
-            else {
-                var fn = function (left, right) {
-                    var a = left.criteria, b = right.criteria;
-                    return a < b ? -1 : a > b ? 1 : 0;
-                };
-                callback(null, _map(results.sort(fn), function (x) {
-                    return x.value;
-                }));
-            }
-        });
-    };
+/**
+ * The base implementation of `_.times` without support for iteratee shorthands
+ * or max array length checks.
+ *
+ * @private
+ * @param {number} n The number of times to invoke `iteratee`.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns the array of results.
+ */
+function baseTimes(n, iteratee) {
+  var index = -1,
+      result = Array(n);
 
-    async.auto = function (tasks, callback) {
-        callback = callback || function () {};
-        var keys = _keys(tasks);
-        if (!keys.length) {
-            return callback(null);
-        }
+  while (++index < n) {
+    result[index] = iteratee(index);
+  }
+  return result;
+}
 
-        var results = {};
+/**
+ * Checks if `value` is object-like. A value is object-like if it's not `null`
+ * and has a `typeof` result of "object".
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
+ * @example
+ *
+ * _.isObjectLike({});
+ * // => true
+ *
+ * _.isObjectLike([1, 2, 3]);
+ * // => true
+ *
+ * _.isObjectLike(_.noop);
+ * // => false
+ *
+ * _.isObjectLike(null);
+ * // => false
+ */
+function isObjectLike(value) {
+  return value != null && typeof value == 'object';
+}
 
-        var listeners = [];
-        var addListener = function (fn) {
-            listeners.unshift(fn);
-        };
-        var removeListener = function (fn) {
-            for (var i = 0; i < listeners.length; i += 1) {
-                if (listeners[i] === fn) {
-                    listeners.splice(i, 1);
-                    return;
-                }
-            }
-        };
-        var taskComplete = function () {
-            _each(listeners.slice(0), function (fn) {
-                fn();
-            });
-        };
+/** `Object#toString` result references. */
+var argsTag = '[object Arguments]';
 
-        addListener(function () {
-            if (_keys(results).length === keys.length) {
-                callback(null, results);
-                callback = function () {};
-            }
-        });
+/**
+ * The base implementation of `_.isArguments`.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an `arguments` object,
+ */
+function baseIsArguments(value) {
+  return isObjectLike(value) && baseGetTag(value) == argsTag;
+}
 
-        _each(keys, function (k) {
-            var task = (tasks[k] instanceof Function) ? [tasks[k]]: tasks[k];
-            var taskCallback = function (err) {
-                var args = Array.prototype.slice.call(arguments, 1);
-                if (args.length <= 1) {
-                    args = args[0];
-                }
-                if (err) {
-                    var safeResults = {};
-                    _each(_keys(results), function(rkey) {
-                        safeResults[rkey] = results[rkey];
-                    });
-                    safeResults[k] = args;
-                    callback(err, safeResults);
-                    // stop subsequent errors hitting callback multiple times
-                    callback = function () {};
-                }
-                else {
-                    results[k] = args;
-                    async.setImmediate(taskComplete);
-                }
-            };
-            var requires = task.slice(0, Math.abs(task.length - 1)) || [];
-            var ready = function () {
-                return _reduce(requires, function (a, x) {
-                    return (a && results.hasOwnProperty(x));
-                }, true) && !results.hasOwnProperty(k);
-            };
-            if (ready()) {
-                task[task.length - 1](taskCallback, results);
-            }
-            else {
-                var listener = function () {
-                    if (ready()) {
-                        removeListener(listener);
-                        task[task.length - 1](taskCallback, results);
-                    }
-                };
-                addListener(listener);
-            }
-        });
-    };
+/** Used for built-in method references. */
+var objectProto$3 = Object.prototype;
 
-    async.waterfall = function (tasks, callback) {
-        callback = callback || function () {};
-        if (tasks.constructor !== Array) {
-          var err = new Error('First argument to waterfall must be an array of functions');
-          return callback(err);
-        }
-        if (!tasks.length) {
-            return callback();
-        }
-        var wrapIterator = function (iterator) {
-            return function (err) {
-                if (err) {
-                    callback.apply(null, arguments);
-                    callback = function () {};
-                }
-                else {
-                    var args = Array.prototype.slice.call(arguments, 1);
-                    var next = iterator.next();
-                    if (next) {
-                        args.push(wrapIterator(next));
-                    }
-                    else {
-                        args.push(callback);
-                    }
-                    async.setImmediate(function () {
-                        iterator.apply(null, args);
-                    });
-                }
-            };
-        };
-        wrapIterator(async.iterator(tasks))();
-    };
+/** Used to check objects for own properties. */
+var hasOwnProperty$2 = objectProto$3.hasOwnProperty;
 
-    var _parallel = function(eachfn, tasks, callback) {
-        callback = callback || function () {};
-        if (tasks.constructor === Array) {
-            eachfn.map(tasks, function (fn, callback) {
-                if (fn) {
-                    fn(function (err) {
-                        var args = Array.prototype.slice.call(arguments, 1);
-                        if (args.length <= 1) {
-                            args = args[0];
-                        }
-                        callback.call(null, err, args);
-                    });
-                }
-            }, callback);
-        }
-        else {
-            var results = {};
-            eachfn.each(_keys(tasks), function (k, callback) {
-                tasks[k](function (err) {
-                    var args = Array.prototype.slice.call(arguments, 1);
-                    if (args.length <= 1) {
-                        args = args[0];
-                    }
-                    results[k] = args;
-                    callback(err);
-                });
-            }, function (err) {
-                callback(err, results);
-            });
-        }
-    };
+/** Built-in value references. */
+var propertyIsEnumerable = objectProto$3.propertyIsEnumerable;
 
-    async.parallel = function (tasks, callback) {
-        _parallel({ map: async.map, each: async.each }, tasks, callback);
-    };
+/**
+ * Checks if `value` is likely an `arguments` object.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an `arguments` object,
+ *  else `false`.
+ * @example
+ *
+ * _.isArguments(function() { return arguments; }());
+ * // => true
+ *
+ * _.isArguments([1, 2, 3]);
+ * // => false
+ */
+var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {
+  return isObjectLike(value) && hasOwnProperty$2.call(value, 'callee') &&
+    !propertyIsEnumerable.call(value, 'callee');
+};
 
-    async.parallelLimit = function(tasks, limit, callback) {
-        _parallel({ map: _mapLimit(limit), each: _eachLimit(limit) }, tasks, callback);
-    };
+/**
+ * Checks if `value` is classified as an `Array` object.
+ *
+ * @static
+ * @memberOf _
+ * @since 0.1.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is an array, else `false`.
+ * @example
+ *
+ * _.isArray([1, 2, 3]);
+ * // => true
+ *
+ * _.isArray(document.body.children);
+ * // => false
+ *
+ * _.isArray('abc');
+ * // => false
+ *
+ * _.isArray(_.noop);
+ * // => false
+ */
+var isArray = Array.isArray;
 
-    async.series = function (tasks, callback) {
-        callback = callback || function () {};
-        if (tasks.constructor === Array) {
-            async.mapSeries(tasks, function (fn, callback) {
-                if (fn) {
-                    fn(function (err) {
-                        var args = Array.prototype.slice.call(arguments, 1);
-                        if (args.length <= 1) {
-                            args = args[0];
-                        }
-                        callback.call(null, err, args);
-                    });
-                }
-            }, callback);
-        }
-        else {
-            var results = {};
-            async.eachSeries(_keys(tasks), function (k, callback) {
-                tasks[k](function (err) {
-                    var args = Array.prototype.slice.call(arguments, 1);
-                    if (args.length <= 1) {
-                        args = args[0];
-                    }
-                    results[k] = args;
-                    callback(err);
-                });
-            }, function (err) {
-                callback(err, results);
-            });
-        }
-    };
+/**
+ * This method returns `false`.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.13.0
+ * @category Util
+ * @returns {boolean} Returns `false`.
+ * @example
+ *
+ * _.times(2, _.stubFalse);
+ * // => [false, false]
+ */
+function stubFalse() {
+  return false;
+}
 
-    async.iterator = function (tasks) {
-        var makeCallback = function (index) {
-            var fn = function () {
-                if (tasks.length) {
-                    tasks[index].apply(null, arguments);
-                }
-                return fn.next();
-            };
-            fn.next = function () {
-                return (index < tasks.length - 1) ? makeCallback(index + 1): null;
-            };
-            return fn;
-        };
-        return makeCallback(0);
-    };
+/** Detect free variable `exports`. */
+var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;
 
-    async.apply = function (fn) {
-        var args = Array.prototype.slice.call(arguments, 1);
-        return function () {
-            return fn.apply(
-                null, args.concat(Array.prototype.slice.call(arguments))
-            );
-        };
-    };
+/** Detect free variable `module`. */
+var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;
 
-    var _concat = function (eachfn, arr, fn, callback) {
-        var r = [];
-        eachfn(arr, function (x, cb) {
-            fn(x, function (err, y) {
-                r = r.concat(y || []);
-                cb(err);
-            });
-        }, function (err) {
-            callback(err, r);
-        });
-    };
-    async.concat = doParallel(_concat);
-    async.concatSeries = doSeries(_concat);
+/** Detect the popular CommonJS extension `module.exports`. */
+var moduleExports = freeModule && freeModule.exports === freeExports;
 
-    async.whilst = function (test, iterator, callback) {
-        if (test()) {
-            iterator(function (err) {
-                if (err) {
-                    return callback(err);
-                }
-                async.whilst(test, iterator, callback);
-            });
-        }
-        else {
-            callback();
-        }
-    };
+/** Built-in value references. */
+var Buffer = moduleExports ? root.Buffer : undefined;
 
-    async.doWhilst = function (iterator, test, callback) {
-        iterator(function (err) {
-            if (err) {
-                return callback(err);
-            }
-            if (test()) {
-                async.doWhilst(iterator, test, callback);
-            }
-            else {
-                callback();
-            }
-        });
-    };
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;
 
-    async.until = function (test, iterator, callback) {
-        if (!test()) {
-            iterator(function (err) {
-                if (err) {
-                    return callback(err);
-                }
-                async.until(test, iterator, callback);
-            });
-        }
-        else {
-            callback();
-        }
-    };
+/**
+ * Checks if `value` is a buffer.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.3.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.
+ * @example
+ *
+ * _.isBuffer(new Buffer(2));
+ * // => true
+ *
+ * _.isBuffer(new Uint8Array(2));
+ * // => false
+ */
+var isBuffer = nativeIsBuffer || stubFalse;
 
-    async.doUntil = function (iterator, test, callback) {
-        iterator(function (err) {
-            if (err) {
-                return callback(err);
-            }
-            if (!test()) {
-                async.doUntil(iterator, test, callback);
-            }
-            else {
-                callback();
-            }
-        });
-    };
+/** Used as references for various `Number` constants. */
+var MAX_SAFE_INTEGER$1 = 9007199254740991;
 
-    async.queue = function (worker, concurrency) {
-        if (concurrency === undefined) {
-            concurrency = 1;
-        }
-        function _insert(q, data, pos, callback) {
-          if(data.constructor !== Array) {
-              data = [data];
-          }
-          _each(data, function(task) {
-              var item = {
-                  data: task,
-                  callback: typeof callback === 'function' ? callback : null
-              };
-
-              if (pos) {
-                q.tasks.unshift(item);
-              } else {
-                q.tasks.push(item);
-              }
-
-              if (q.saturated && q.tasks.length === concurrency) {
-                  q.saturated();
-              }
-              async.setImmediate(q.process);
-          });
-        }
+/** Used to detect unsigned integer values. */
+var reIsUint = /^(?:0|[1-9]\d*)$/;
 
-        var workers = 0;
-        var q = {
-            tasks: [],
-            concurrency: concurrency,
-            saturated: null,
-            empty: null,
-            drain: null,
-            push: function (data, callback) {
-              _insert(q, data, false, callback);
-            },
-            unshift: function (data, callback) {
-              _insert(q, data, true, callback);
-            },
-            process: function () {
-                if (workers < q.concurrency && q.tasks.length) {
-                    var task = q.tasks.shift();
-                    if (q.empty && q.tasks.length === 0) {
-                        q.empty();
-                    }
-                    workers += 1;
-                    var next = function () {
-                        workers -= 1;
-                        if (task.callback) {
-                            task.callback.apply(task, arguments);
-                        }
-                        if (q.drain && q.tasks.length + workers === 0) {
-                            q.drain();
-                        }
-                        q.process();
-                    };
-                    var cb = only_once(next);
-                    worker(task.data, cb);
-                }
-            },
-            length: function () {
-                return q.tasks.length;
-            },
-            running: function () {
-                return workers;
-            }
-        };
-        return q;
-    };
+/**
+ * Checks if `value` is a valid array-like index.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
+ * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
+ */
+function isIndex(value, length) {
+  length = length == null ? MAX_SAFE_INTEGER$1 : length;
+  return !!length &&
+    (typeof value == 'number' || reIsUint.test(value)) &&
+    (value > -1 && value % 1 == 0 && value < length);
+}
 
-    async.cargo = function (worker, payload) {
-        var working     = false,
-            tasks       = [];
-
-        var cargo = {
-            tasks: tasks,
-            payload: payload,
-            saturated: null,
-            empty: null,
-            drain: null,
-            push: function (data, callback) {
-                if(data.constructor !== Array) {
-                    data = [data];
-                }
-                _each(data, function(task) {
-                    tasks.push({
-                        data: task,
-                        callback: typeof callback === 'function' ? callback : null
-                    });
-                    if (cargo.saturated && tasks.length === payload) {
-                        cargo.saturated();
-                    }
-                });
-                async.setImmediate(cargo.process);
-            },
-            process: function process() {
-                if (working) return;
-                if (tasks.length === 0) {
-                    if(cargo.drain) cargo.drain();
-                    return;
-                }
+/** `Object#toString` result references. */
+var argsTag$1 = '[object Arguments]';
+var arrayTag = '[object Array]';
+var boolTag = '[object Boolean]';
+var dateTag = '[object Date]';
+var errorTag = '[object Error]';
+var funcTag$1 = '[object Function]';
+var mapTag = '[object Map]';
+var numberTag = '[object Number]';
+var objectTag = '[object Object]';
+var regexpTag = '[object RegExp]';
+var setTag = '[object Set]';
+var stringTag = '[object String]';
+var weakMapTag = '[object WeakMap]';
+
+var arrayBufferTag = '[object ArrayBuffer]';
+var dataViewTag = '[object DataView]';
+var float32Tag = '[object Float32Array]';
+var float64Tag = '[object Float64Array]';
+var int8Tag = '[object Int8Array]';
+var int16Tag = '[object Int16Array]';
+var int32Tag = '[object Int32Array]';
+var uint8Tag = '[object Uint8Array]';
+var uint8ClampedTag = '[object Uint8ClampedArray]';
+var uint16Tag = '[object Uint16Array]';
+var uint32Tag = '[object Uint32Array]';
+
+/** Used to identify `toStringTag` values of typed arrays. */
+var typedArrayTags = {};
+typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
+typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
+typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
+typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
+typedArrayTags[uint32Tag] = true;
+typedArrayTags[argsTag$1] = typedArrayTags[arrayTag] =
+typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
+typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =
+typedArrayTags[errorTag] = typedArrayTags[funcTag$1] =
+typedArrayTags[mapTag] = typedArrayTags[numberTag] =
+typedArrayTags[objectTag] = typedArrayTags[regexpTag] =
+typedArrayTags[setTag] = typedArrayTags[stringTag] =
+typedArrayTags[weakMapTag] = false;
 
-                var ts = typeof payload === 'number'
-                            ? tasks.splice(0, payload)
-                            : tasks.splice(0);
+/**
+ * The base implementation of `_.isTypedArray` without Node.js optimizations.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
+ */
+function baseIsTypedArray(value) {
+  return isObjectLike(value) &&
+    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];
+}
 
-                var ds = _map(ts, function (task) {
-                    return task.data;
-                });
+/**
+ * The base implementation of `_.unary` without support for storing metadata.
+ *
+ * @private
+ * @param {Function} func The function to cap arguments for.
+ * @returns {Function} Returns the new capped function.
+ */
+function baseUnary(func) {
+  return function(value) {
+    return func(value);
+  };
+}
 
-                if(cargo.empty) cargo.empty();
-                working = true;
-                worker(ds, function () {
-                    working = false;
+/** Detect free variable `exports`. */
+var freeExports$1 = typeof exports == 'object' && exports && !exports.nodeType && exports;
 
-                    var args = arguments;
-                    _each(ts, function (data) {
-                        if (data.callback) {
-                            data.callback.apply(null, args);
-                        }
-                    });
+/** Detect free variable `module`. */
+var freeModule$1 = freeExports$1 && typeof module == 'object' && module && !module.nodeType && module;
 
-                    process();
-                });
-            },
-            length: function () {
-                return tasks.length;
-            },
-            running: function () {
-                return working;
-            }
-        };
-        return cargo;
-    };
+/** Detect the popular CommonJS extension `module.exports`. */
+var moduleExports$1 = freeModule$1 && freeModule$1.exports === freeExports$1;
 
-    var _console_fn = function (name) {
-        return function (fn) {
-            var args = Array.prototype.slice.call(arguments, 1);
-            fn.apply(null, args.concat([function (err) {
-                var args = Array.prototype.slice.call(arguments, 1);
-                if (typeof console !== 'undefined') {
-                    if (err) {
-                        if (console.error) {
-                            console.error(err);
-                        }
-                    }
-                    else if (console[name]) {
-                        _each(args, function (x) {
-                            console[name](x);
-                        });
-                    }
-                }
-            }]));
-        };
-    };
-    async.log = _console_fn('log');
-    async.dir = _console_fn('dir');
-    /*async.info = _console_fn('info');
-    async.warn = _console_fn('warn');
-    async.error = _console_fn('error');*/
-
-    async.memoize = function (fn, hasher) {
-        var memo = {};
-        var queues = {};
-        hasher = hasher || function (x) {
-            return x;
-        };
-        var memoized = function () {
-            var args = Array.prototype.slice.call(arguments);
-            var callback = args.pop();
-            var key = hasher.apply(null, args);
-            if (key in memo) {
-                callback.apply(null, memo[key]);
-            }
-            else if (key in queues) {
-                queues[key].push(callback);
-            }
-            else {
-                queues[key] = [callback];
-                fn.apply(null, args.concat([function () {
-                    memo[key] = arguments;
-                    var q = queues[key];
-                    delete queues[key];
-                    for (var i = 0, l = q.length; i < l; i++) {
-                      q[i].apply(null, arguments);
-                    }
-                }]));
-            }
-        };
-        memoized.memo = memo;
-        memoized.unmemoized = fn;
-        return memoized;
-    };
+/** Detect free variable `process` from Node.js. */
+var freeProcess = moduleExports$1 && freeGlobal.process;
 
-    async.unmemoize = function (fn) {
-      return function () {
-        return (fn.unmemoized || fn).apply(null, arguments);
-      };
+/** Used to access faster Node.js helpers. */
+var nodeUtil = (function() {
+  try {
+    return freeProcess && freeProcess.binding('util');
+  } catch (e) {}
+}());
+
+/* Node.js helper references. */
+var nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;
+
+/**
+ * Checks if `value` is classified as a typed array.
+ *
+ * @static
+ * @memberOf _
+ * @since 3.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
+ * @example
+ *
+ * _.isTypedArray(new Uint8Array);
+ * // => true
+ *
+ * _.isTypedArray([]);
+ * // => false
+ */
+var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;
+
+/** Used for built-in method references. */
+var objectProto$2 = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty$1 = objectProto$2.hasOwnProperty;
+
+/**
+ * Creates an array of the enumerable property names of the array-like `value`.
+ *
+ * @private
+ * @param {*} value The value to query.
+ * @param {boolean} inherited Specify returning inherited property names.
+ * @returns {Array} Returns the array of property names.
+ */
+function arrayLikeKeys(value, inherited) {
+  var isArr = isArray(value),
+      isArg = !isArr && isArguments(value),
+      isBuff = !isArr && !isArg && isBuffer(value),
+      isType = !isArr && !isArg && !isBuff && isTypedArray(value),
+      skipIndexes = isArr || isArg || isBuff || isType,
+      result = skipIndexes ? baseTimes(value.length, String) : [],
+      length = result.length;
+
+  for (var key in value) {
+    if ((inherited || hasOwnProperty$1.call(value, key)) &&
+        !(skipIndexes && (
+           // Safari 9 has enumerable `arguments.length` in strict mode.
+           key == 'length' ||
+           // Node.js 0.10 has enumerable non-index properties on buffers.
+           (isBuff && (key == 'offset' || key == 'parent')) ||
+           // PhantomJS 2 has enumerable non-index properties on typed arrays.
+           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||
+           // Skip index properties.
+           isIndex(key, length)
+        ))) {
+      result.push(key);
+    }
+  }
+  return result;
+}
+
+/** Used for built-in method references. */
+var objectProto$5 = Object.prototype;
+
+/**
+ * Checks if `value` is likely a prototype object.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
+ */
+function isPrototype(value) {
+  var Ctor = value && value.constructor,
+      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto$5;
+
+  return value === proto;
+}
+
+/**
+ * Creates a unary function that invokes `func` with its argument transformed.
+ *
+ * @private
+ * @param {Function} func The function to wrap.
+ * @param {Function} transform The argument transform.
+ * @returns {Function} Returns the new function.
+ */
+function overArg(func, transform) {
+  return function(arg) {
+    return func(transform(arg));
+  };
+}
+
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeKeys = overArg(Object.keys, Object);
+
+/** Used for built-in method references. */
+var objectProto$4 = Object.prototype;
+
+/** Used to check objects for own properties. */
+var hasOwnProperty$3 = objectProto$4.hasOwnProperty;
+
+/**
+ * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.
+ *
+ * @private
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ */
+function baseKeys(object) {
+  if (!isPrototype(object)) {
+    return nativeKeys(object);
+  }
+  var result = [];
+  for (var key in Object(object)) {
+    if (hasOwnProperty$3.call(object, key) && key != 'constructor') {
+      result.push(key);
+    }
+  }
+  return result;
+}
+
+/**
+ * Creates an array of the own enumerable property names of `object`.
+ *
+ * **Note:** Non-object values are coerced to objects. See the
+ * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
+ * for more details.
+ *
+ * @static
+ * @since 0.1.0
+ * @memberOf _
+ * @category Object
+ * @param {Object} object The object to query.
+ * @returns {Array} Returns the array of property names.
+ * @example
+ *
+ * function Foo() {
+ *   this.a = 1;
+ *   this.b = 2;
+ * }
+ *
+ * Foo.prototype.c = 3;
+ *
+ * _.keys(new Foo);
+ * // => ['a', 'b'] (iteration order is not guaranteed)
+ *
+ * _.keys('hi');
+ * // => ['0', '1']
+ */
+function keys(object) {
+  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);
+}
+
+function createArrayIterator(coll) {
+    var i = -1;
+    var len = coll.length;
+    return function next() {
+        return ++i < len ? { value: coll[i], key: i } : null;
     };
+}
 
-    async.times = function (count, iterator, callback) {
-        var counter = [];
-        for (var i = 0; i < count; i++) {
-            counter.push(i);
-        }
-        return async.map(counter, iterator, callback);
+function createES2015Iterator(iterator) {
+    var i = -1;
+    return function next() {
+        var item = iterator.next();
+        if (item.done) return null;
+        i++;
+        return { value: item.value, key: i };
     };
+}
 
-    async.timesSeries = function (count, iterator, callback) {
-        var counter = [];
-        for (var i = 0; i < count; i++) {
-            counter.push(i);
-        }
-        return async.mapSeries(counter, iterator, callback);
+function createObjectIterator(obj) {
+    var okeys = keys(obj);
+    var i = -1;
+    var len = okeys.length;
+    return function next() {
+        var key = okeys[++i];
+        return i < len ? { value: obj[key], key: key } : null;
     };
+}
 
-    async.compose = function (/* functions... */) {
-        var fns = Array.prototype.reverse.call(arguments);
-        return function () {
-            var that = this;
-            var args = Array.prototype.slice.call(arguments);
-            var callback = args.pop();
-            async.reduce(fns, args, function (newargs, fn, cb) {
-                fn.apply(that, newargs.concat([function () {
-                    var err = arguments[0];
-                    var nextargs = Array.prototype.slice.call(arguments, 1);
-                    cb(err, nextargs);
-                }]))
-            },
-            function (err, results) {
-                callback.apply(that, [err].concat(results));
-            });
-        };
+function iterator(coll) {
+    if (isArrayLike(coll)) {
+        return createArrayIterator(coll);
+    }
+
+    var iterator = getIterator(coll);
+    return iterator ? createES2015Iterator(iterator) : createObjectIterator(coll);
+}
+
+function onlyOnce(fn) {
+    return function () {
+        if (fn === null) throw new Error("Callback was already called.");
+        var callFn = fn;
+        fn = null;
+        callFn.apply(this, arguments);
     };
+}
 
-    var _applyEach = function (eachfn, fns /*args...*/) {
-        var go = function () {
-            var that = this;
-            var args = Array.prototype.slice.call(arguments);
-            var callback = args.pop();
-            return eachfn(fns, function (fn, cb) {
-                fn.apply(that, args.concat([cb]));
-            },
-            callback);
-        };
-        if (arguments.length > 2) {
-            var args = Array.prototype.slice.call(arguments, 2);
-            return go.apply(this, args);
-        }
-        else {
-            return go;
+// A temporary value used to identify if the loop should be broken.
+// See #1064, #1293
+var breakLoop = {};
+
+function _eachOfLimit(limit) {
+    return function (obj, iteratee, callback) {
+        callback = once(callback || noop);
+        if (limit <= 0 || !obj) {
+            return callback(null);
         }
-    };
-    async.applyEach = doParallel(_applyEach);
-    async.applyEachSeries = doSeries(_applyEach);
+        var nextElem = iterator(obj);
+        var done = false;
+        var running = 0;
 
-    async.forever = function (fn, callback) {
-        function next(err) {
+        function iterateeCallback(err, value) {
+            running -= 1;
             if (err) {
-                if (callback) {
-                    return callback(err);
+                done = true;
+                callback(err);
+            } else if (value === breakLoop || done && running <= 0) {
+                done = true;
+                return callback(null);
+            } else {
+                replenish();
+            }
+        }
+
+        function replenish() {
+            while (running < limit && !done) {
+                var elem = nextElem();
+                if (elem === null) {
+                    done = true;
+                    if (running <= 0) {
+                        callback(null);
+                    }
+                    return;
                 }
-                throw err;
+                running += 1;
+                iteratee(elem.value, elem.key, onlyOnce(iterateeCallback));
             }
-            fn(next);
         }
-        next();
+
+        replenish();
+    };
+}
+
+/**
+ * The same as [`eachOf`]{@link module:Collections.eachOf} but runs a maximum of `limit` async operations at a
+ * time.
+ *
+ * @name eachOfLimit
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.eachOf]{@link module:Collections.eachOf}
+ * @alias forEachOfLimit
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - A function to apply to each
+ * item in `coll`. The `key` is the item's key, or index in the case of an
+ * array. The iteratee is passed a `callback(err)` which must be called once it
+ * has completed. If no error has occurred, the callback should be run without
+ * arguments or with an explicit `null` argument. Invoked with
+ * (item, key, callback).
+ * @param {Function} [callback] - A callback which is called when all
+ * `iteratee` functions have finished, or an error occurs. Invoked with (err).
+ */
+function eachOfLimit(coll, limit, iteratee, callback) {
+  _eachOfLimit(limit)(coll, iteratee, callback);
+}
+
+function doLimit(fn, limit) {
+    return function (iterable, iteratee, callback) {
+        return fn(iterable, limit, iteratee, callback);
     };
+}
 
-    // AMD / RequireJS
-    if (typeof define !== 'undefined' && define.amd) {
-        define([], function () {
-            return async;
-        });
+// eachOf implementation optimized for array-likes
+function eachOfArrayLike(coll, iteratee, callback) {
+    callback = once(callback || noop);
+    var index = 0,
+        completed = 0,
+        length = coll.length;
+    if (length === 0) {
+        callback(null);
     }
-    // Node.js
-    else if (typeof module !== 'undefined' && module.exports) {
-        module.exports = async;
+
+    function iteratorCallback(err) {
+        if (err) {
+            callback(err);
+        } else if (++completed === length) {
+            callback(null);
+        }
     }
-    // included directly via <script> tag
-    else {
-        root.async = async;
+
+    for (; index < length; index++) {
+        iteratee(coll[index], index, onlyOnce(iteratorCallback));
     }
+}
 
-}());
+// a generic version of eachOf which can handle array, object, and iterator cases.
+var eachOfGeneric = doLimit(eachOfLimit, Infinity);
 
-}).call(this,require('_process'))
-},{"_process":4}],2:[function(require,module,exports){
-// rev 452
-/********************************************************************************
-*                                                                              *
-* Author    :  Angus Johnson                                                   *
-* Version   :  6.1.3a                                                          *
-* Date      :  22 January 2014                                                 *
-* Website   :  http://www.angusj.com                                           *
-* Copyright :  Angus Johnson 2010-2014                                         *
-*                                                                              *
-* License:                                                                     *
-* Use, modification & distribution is subject to Boost Software License Ver 1. *
-* http://www.boost.org/LICENSE_1_0.txt                                         *
-*                                                                              *
-* Attributions:                                                                *
-* The code in this library is an extension of Bala Vatti's clipping algorithm: *
-* "A generic solution to polygon clipping"                                     *
-* Communications of the ACM, Vol 35, Issue 7 (July 1992) pp 56-63.             *
-* http://portal.acm.org/citation.cfm?id=129906                                 *
-*                                                                              *
-* Computer graphics and geometric modeling: implementation and algorithms      *
-* By Max K. Agoston                                                            *
-* Springer; 1 edition (January 4, 2005)                                        *
-* http://books.google.com/books?q=vatti+clipping+agoston                       *
-*                                                                              *
-* See also:                                                                    *
-* "Polygon Offsetting by Computing Winding Numbers"                            *
-* Paper no. DETC2005-85513 pp. 565-575                                         *
-* ASME 2005 International Design Engineering Technical Conferences             *
-* and Computers and Information in Engineering Conference (IDETC/CIE2005)      *
-* September 24-28, 2005 , Long Beach, California, USA                          *
-* http://www.me.berkeley.edu/~mcmains/pubs/DAC05OffsetPolygon.pdf              *
-*                                                                              *
-*******************************************************************************/
-/*******************************************************************************
-*                                                                              *
-* Author    :  Timo                                                            *
-* Version   :  6.1.3.2                                                         *
-* Date      :  1 February 2014                                                 *
-*                                                                              *
-* This is a translation of the C# Clipper library to Javascript.               *
-* Int128 struct of C# is implemented using JSBN of Tom Wu.                     *
-* Because Javascript lacks support for 64-bit integers, the space              *
-* is a little more restricted than in C# version.                              *
-*                                                                              *
-* C# version has support for coordinate space:                                 *
-* +-4611686018427387903 ( sqrt(2^127 -1)/2 )                                   *
-* while Javascript version has support for space:                              *
-* +-4503599627370495 ( sqrt(2^106 -1)/2 )                                      *
-*                                                                              *
-* Tom Wu's JSBN proved to be the fastest big integer library:                  *
-* http://jsperf.com/big-integer-library-test                                   *
-*                                                                              *
-* This class can be made simpler when (if ever) 64-bit integer support comes.  *
-*                                                                              *
-*******************************************************************************/
-/*******************************************************************************
-*                                                                              *
-* Basic JavaScript BN library - subset useful for RSA encryption.              *
-* http://www-cs-students.stanford.edu/~tjw/jsbn/                               *
-* Copyright (c) 2005  Tom Wu                                                   *
-* All Rights Reserved.                                                         *
-* See "LICENSE" for details:                                                   *
-* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE                        *
-*                                                                              *
-*******************************************************************************/
-
-"use strict";
-//use_int32: When enabled 32bit ints are used instead of 64bit ints. This
-//improve performance but coordinate values are limited to the range +/- 46340
-var use_int32 = false;
-//use_xyz: adds a Z member to IntPoint. Adds a minor cost to performance.
-var use_xyz = false;
-//UseLines: Enables line clipping. Adds a very minor cost to performance.
-var use_lines = true;
-//use_deprecated: Enables support for the obsolete OffsetPaths() function
-//which has been replace with the ClipperOffset class.
-var use_deprecated = false;
-
-var ClipperLib = {};
-var isNode = false;
-if (typeof module !== 'undefined' && module.exports)
-{
-  module.exports = ClipperLib;
-  isNode = true;
-}
-else
-{
-  if (typeof (document) !== "undefined") window.ClipperLib = ClipperLib;
-  else self['ClipperLib'] = ClipperLib;
-}
-var navigator_appName;
-if (!isNode)
-{
-  var nav = navigator.userAgent.toString().toLowerCase();
-  navigator_appName = navigator.appName;
-}
-else
-{
-  var nav = "chrome"; // Node.js uses Chrome's V8 engine
-  navigator_appName = "Netscape"; // Firefox, Chrome and Safari returns "Netscape", so Node.js should also
-}
-// Browser test to speedup performance critical functions
-var browser = {};
-if (nav.indexOf("chrome") != -1 && nav.indexOf("chromium") == -1) browser.chrome = 1;
-else browser.chrome = 0;
-if (nav.indexOf("chromium") != -1) browser.chromium = 1;
-else browser.chromium = 0;
-if (nav.indexOf("safari") != -1 && nav.indexOf("chrome") == -1 && nav.indexOf("chromium") == -1) browser.safari = 1;
-else browser.safari = 0;
-if (nav.indexOf("firefox") != -1) browser.firefox = 1;
-else browser.firefox = 0;
-if (nav.indexOf("firefox/17") != -1) browser.firefox17 = 1;
-else browser.firefox17 = 0;
-if (nav.indexOf("firefox/15") != -1) browser.firefox15 = 1;
-else browser.firefox15 = 0;
-if (nav.indexOf("firefox/3") != -1) browser.firefox3 = 1;
-else browser.firefox3 = 0;
-if (nav.indexOf("opera") != -1) browser.opera = 1;
-else browser.opera = 0;
-if (nav.indexOf("msie 10") != -1) browser.msie10 = 1;
-else browser.msie10 = 0;
-if (nav.indexOf("msie 9") != -1) browser.msie9 = 1;
-else browser.msie9 = 0;
-if (nav.indexOf("msie 8") != -1) browser.msie8 = 1;
-else browser.msie8 = 0;
-if (nav.indexOf("msie 7") != -1) browser.msie7 = 1;
-else browser.msie7 = 0;
-if (nav.indexOf("msie ") != -1) browser.msie = 1;
-else browser.msie = 0;
-ClipperLib.biginteger_used = null;
-// Copyright (c) 2005  Tom Wu
-// All Rights Reserved.
-// See "LICENSE" for details.
-// Basic JavaScript BN library - subset useful for RSA encryption.
-// Bits per digit
-var dbits;
-// JavaScript engine analysis
-var canary = 0xdeadbeefcafe;
-var j_lm = ((canary & 0xffffff) == 0xefcafe);
-// (public) Constructor
-function BigInteger(a, b, c)
-{
-  // This test variable can be removed,
-  // but at least for performance tests it is useful piece of knowledge
-  // This is the only ClipperLib related variable in BigInteger library
-  ClipperLib.biginteger_used = 1;
-  if (a != null)
-    if ("number" == typeof a && "undefined" == typeof (b)) this.fromInt(a); // faster conversion
-    else if ("number" == typeof a) this.fromNumber(a, b, c);
-  else if (b == null && "string" != typeof a) this.fromString(a, 256);
-  else this.fromString(a, b);
-}
-// return new, unset BigInteger
-function nbi()
-{
-  return new BigInteger(null);
-}
-// am: Compute w_j += (x*this_i), propagate carries,
-// c is initial carry, returns final carry.
-// c < 3*dvalue, x < 2*dvalue, this_i < dvalue
-// We need to select the fastest one that works in this environment.
-// am1: use a single mult and divide to get the high bits,
-// max digit bits should be 26 because
-// max internal value = 2*dvalue^2-2*dvalue (< 2^53)
-function am1(i, x, w, j, c, n)
-{
-  while (--n >= 0)
-  {
-    var v = x * this[i++] + w[j] + c;
-    c = Math.floor(v / 0x4000000);
-    w[j++] = v & 0x3ffffff;
-  }
-  return c;
-}
-// am2 avoids a big mult-and-extract completely.
-// Max digit bits should be <= 30 because we do bitwise ops
-// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
-function am2(i, x, w, j, c, n)
-{
-  var xl = x & 0x7fff,
-    xh = x >> 15;
-  while (--n >= 0)
-  {
-    var l = this[i] & 0x7fff;
-    var h = this[i++] >> 15;
-    var m = xh * l + h * xl;
-    l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);
-    c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);
-    w[j++] = l & 0x3fffffff;
-  }
-  return c;
-}
-// Alternately, set max digit bits to 28 since some
-// browsers slow down when dealing with 32-bit numbers.
-function am3(i, x, w, j, c, n)
-{
-  var xl = x & 0x3fff,
-    xh = x >> 14;
-  while (--n >= 0)
-  {
-    var l = this[i] & 0x3fff;
-    var h = this[i++] >> 14;
-    var m = xh * l + h * xl;
-    l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;
-    c = (l >> 28) + (m >> 14) + xh * h;
-    w[j++] = l & 0xfffffff;
-  }
-  return c;
-}
-if (j_lm && (navigator_appName == "Microsoft Internet Explorer"))
-{
-  BigInteger.prototype.am = am2;
-  dbits = 30;
-}
-else if (j_lm && (navigator_appName != "Netscape"))
-{
-  BigInteger.prototype.am = am1;
-  dbits = 26;
-}
-else
-{ // Mozilla/Netscape seems to prefer am3
-  BigInteger.prototype.am = am3;
-  dbits = 28;
-}
-BigInteger.prototype.DB = dbits;
-BigInteger.prototype.DM = ((1 << dbits) - 1);
-BigInteger.prototype.DV = (1 << dbits);
-var BI_FP = 52;
-BigInteger.prototype.FV = Math.pow(2, BI_FP);
-BigInteger.prototype.F1 = BI_FP - dbits;
-BigInteger.prototype.F2 = 2 * dbits - BI_FP;
-// Digit conversions
-var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
-var BI_RC = new Array();
-var rr, vv;
-rr = "0".charCodeAt(0);
-for (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
-rr = "a".charCodeAt(0);
-for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
-rr = "A".charCodeAt(0);
-for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
-
-function int2char(n)
-{
-  return BI_RM.charAt(n);
-}
+/**
+ * Like [`each`]{@link module:Collections.each}, except that it passes the key (or index) as the second argument
+ * to the iteratee.
+ *
+ * @name eachOf
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @alias forEachOf
+ * @category Collection
+ * @see [async.each]{@link module:Collections.each}
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each
+ * item in `coll`. The `key` is the item's key, or index in the case of an
+ * array. The iteratee is passed a `callback(err)` which must be called once it
+ * has completed. If no error has occurred, the callback should be run without
+ * arguments or with an explicit `null` argument. Invoked with
+ * (item, key, callback).
+ * @param {Function} [callback] - A callback which is called when all
+ * `iteratee` functions have finished, or an error occurs. Invoked with (err).
+ * @example
+ *
+ * var obj = {dev: "/dev.json", test: "/test.json", prod: "/prod.json"};
+ * var configs = {};
+ *
+ * async.forEachOf(obj, function (value, key, callback) {
+ *     fs.readFile(__dirname + value, "utf8", function (err, data) {
+ *         if (err) return callback(err);
+ *         try {
+ *             configs[key] = JSON.parse(data);
+ *         } catch (e) {
+ *             return callback(e);
+ *         }
+ *         callback();
+ *     });
+ * }, function (err) {
+ *     if (err) console.error(err.message);
+ *     // configs is now a map of JSON data
+ *     doSomethingWith(configs);
+ * });
+ */
+var eachOf = function (coll, iteratee, callback) {
+    var eachOfImplementation = isArrayLike(coll) ? eachOfArrayLike : eachOfGeneric;
+    eachOfImplementation(coll, iteratee, callback);
+};
 
-function intAt(s, i)
-{
-  var c = BI_RC[s.charCodeAt(i)];
-  return (c == null) ? -1 : c;
+function doParallel(fn) {
+    return function (obj, iteratee, callback) {
+        return fn(eachOf, obj, iteratee, callback);
+    };
 }
-// (protected) copy this to r
-function bnpCopyTo(r)
-{
-  for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];
-  r.t = this.t;
-  r.s = this.s;
+
+function _asyncMap(eachfn, arr, iteratee, callback) {
+    callback = callback || noop;
+    arr = arr || [];
+    var results = [];
+    var counter = 0;
+
+    eachfn(arr, function (value, _, callback) {
+        var index = counter++;
+        iteratee(value, function (err, v) {
+            results[index] = v;
+            callback(err);
+        });
+    }, function (err) {
+        callback(err, results);
+    });
 }
-// (protected) set from integer value x, -DV <= x < DV
-function bnpFromInt(x)
-{
-  this.t = 1;
-  this.s = (x < 0) ? -1 : 0;
-  if (x > 0) this[0] = x;
-  else if (x < -1) this[0] = x + this.DV;
-  else this.t = 0;
+
+/**
+ * Produces a new collection of values by mapping each value in `coll` through
+ * the `iteratee` function. The `iteratee` is called with an item from `coll`
+ * and a callback for when it has finished processing. Each of these callback
+ * takes 2 arguments: an `error`, and the transformed item from `coll`. If
+ * `iteratee` passes an error to its callback, the main `callback` (for the
+ * `map` function) is immediately called with the error.
+ *
+ * Note, that since this function applies the `iteratee` to each item in
+ * parallel, there is no guarantee that the `iteratee` functions will complete
+ * in order. However, the results array will be in the same order as the
+ * original `coll`.
+ *
+ * If `map` is passed an Object, the results will be an Array.  The results
+ * will roughly be in the order of the original Objects' keys (but this can
+ * vary across JavaScript engines)
+ *
+ * @name map
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each item in `coll`.
+ * The iteratee is passed a `callback(err, transformed)` which must be called
+ * once it has completed with an error (which can be `null`) and a
+ * transformed item. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called when all `iteratee`
+ * functions have finished, or an error occurs. Results is an Array of the
+ * transformed items from the `coll`. Invoked with (err, results).
+ * @example
+ *
+ * async.map(['file1','file2','file3'], fs.stat, function(err, results) {
+ *     // results is now an array of stats for each file
+ * });
+ */
+var map = doParallel(_asyncMap);
+
+/**
+ * Applies the provided arguments to each function in the array, calling
+ * `callback` after all functions have completed. If you only provide the first
+ * argument, `fns`, then it will return a function which lets you pass in the
+ * arguments as if it were a single function call. If more arguments are
+ * provided, `callback` is required while `args` is still optional.
+ *
+ * @name applyEach
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Array|Iterable|Object} fns - A collection of asynchronous functions
+ * to all call with the same arguments
+ * @param {...*} [args] - any number of separate arguments to pass to the
+ * function.
+ * @param {Function} [callback] - the final argument should be the callback,
+ * called when all functions have completed processing.
+ * @returns {Function} - If only the first argument, `fns`, is provided, it will
+ * return a function which lets you pass in the arguments as if it were a single
+ * function call. The signature is `(..args, callback)`. If invoked with any
+ * arguments, `callback` is required.
+ * @example
+ *
+ * async.applyEach([enableSearch, updateSchema], 'bucket', callback);
+ *
+ * // partial application example:
+ * async.each(
+ *     buckets,
+ *     async.applyEach([enableSearch, updateSchema]),
+ *     callback
+ * );
+ */
+var applyEach = applyEach$1(map);
+
+function doParallelLimit(fn) {
+    return function (obj, limit, iteratee, callback) {
+        return fn(_eachOfLimit(limit), obj, iteratee, callback);
+    };
 }
-// return bigint initialized to value
-function nbv(i)
-{
-  var r = nbi();
-  r.fromInt(i);
-  return r;
+
+/**
+ * The same as [`map`]{@link module:Collections.map} but runs a maximum of `limit` async operations at a time.
+ *
+ * @name mapLimit
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.map]{@link module:Collections.map}
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - A function to apply to each item in `coll`.
+ * The iteratee is passed a `callback(err, transformed)` which must be called
+ * once it has completed with an error (which can be `null`) and a transformed
+ * item. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called when all `iteratee`
+ * functions have finished, or an error occurs. Results is an array of the
+ * transformed items from the `coll`. Invoked with (err, results).
+ */
+var mapLimit = doParallelLimit(_asyncMap);
+
+/**
+ * The same as [`map`]{@link module:Collections.map} but runs only a single async operation at a time.
+ *
+ * @name mapSeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.map]{@link module:Collections.map}
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each item in `coll`.
+ * The iteratee is passed a `callback(err, transformed)` which must be called
+ * once it has completed with an error (which can be `null`) and a
+ * transformed item. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called when all `iteratee`
+ * functions have finished, or an error occurs. Results is an array of the
+ * transformed items from the `coll`. Invoked with (err, results).
+ */
+var mapSeries = doLimit(mapLimit, 1);
+
+/**
+ * The same as [`applyEach`]{@link module:ControlFlow.applyEach} but runs only a single async operation at a time.
+ *
+ * @name applyEachSeries
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.applyEach]{@link module:ControlFlow.applyEach}
+ * @category Control Flow
+ * @param {Array|Iterable|Object} fns - A collection of asynchronous functions to all
+ * call with the same arguments
+ * @param {...*} [args] - any number of separate arguments to pass to the
+ * function.
+ * @param {Function} [callback] - the final argument should be the callback,
+ * called when all functions have completed processing.
+ * @returns {Function} - If only the first argument is provided, it will return
+ * a function which lets you pass in the arguments as if it were a single
+ * function call.
+ */
+var applyEachSeries = applyEach$1(mapSeries);
+
+/**
+ * Creates a continuation function with some arguments already applied.
+ *
+ * Useful as a shorthand when combined with other control flow functions. Any
+ * arguments passed to the returned function are added to the arguments
+ * originally passed to apply.
+ *
+ * @name apply
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @category Util
+ * @param {Function} function - The function you want to eventually apply all
+ * arguments to. Invokes with (arguments...).
+ * @param {...*} arguments... - Any number of arguments to automatically apply
+ * when the continuation is called.
+ * @example
+ *
+ * // using apply
+ * async.parallel([
+ *     async.apply(fs.writeFile, 'testfile1', 'test1'),
+ *     async.apply(fs.writeFile, 'testfile2', 'test2')
+ * ]);
+ *
+ *
+ * // the same process without using apply
+ * async.parallel([
+ *     function(callback) {
+ *         fs.writeFile('testfile1', 'test1', callback);
+ *     },
+ *     function(callback) {
+ *         fs.writeFile('testfile2', 'test2', callback);
+ *     }
+ * ]);
+ *
+ * // It's possible to pass any number of additional arguments when calling the
+ * // continuation:
+ *
+ * node> var fn = async.apply(sys.puts, 'one');
+ * node> fn('two', 'three');
+ * one
+ * two
+ * three
+ */
+var apply$2 = rest(function (fn, args) {
+    return rest(function (callArgs) {
+        return fn.apply(null, args.concat(callArgs));
+    });
+});
+
+/**
+ * Take a sync function and make it async, passing its return value to a
+ * callback. This is useful for plugging sync functions into a waterfall,
+ * series, or other async functions. Any arguments passed to the generated
+ * function will be passed to the wrapped function (except for the final
+ * callback argument). Errors thrown will be passed to the callback.
+ *
+ * If the function passed to `asyncify` returns a Promise, that promises's
+ * resolved/rejected state will be used to call the callback, rather than simply
+ * the synchronous return value.
+ *
+ * This also means you can asyncify ES2016 `async` functions.
+ *
+ * @name asyncify
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @alias wrapSync
+ * @category Util
+ * @param {Function} func - The synchronous function to convert to an
+ * asynchronous function.
+ * @returns {Function} An asynchronous wrapper of the `func`. To be invoked with
+ * (callback).
+ * @example
+ *
+ * // passing a regular synchronous function
+ * async.waterfall([
+ *     async.apply(fs.readFile, filename, "utf8"),
+ *     async.asyncify(JSON.parse),
+ *     function (data, next) {
+ *         // data is the result of parsing the text.
+ *         // If there was a parsing error, it would have been caught.
+ *     }
+ * ], callback);
+ *
+ * // passing a function returning a promise
+ * async.waterfall([
+ *     async.apply(fs.readFile, filename, "utf8"),
+ *     async.asyncify(function (contents) {
+ *         return db.model.create(contents);
+ *     }),
+ *     function (model, next) {
+ *         // `model` is the instantiated model object.
+ *         // If there was an error, this function would be skipped.
+ *     }
+ * ], callback);
+ *
+ * // es6 example
+ * var q = async.queue(async.asyncify(async function(file) {
+ *     var intermediateStep = await processFile(file);
+ *     return await somePromise(intermediateStep)
+ * }));
+ *
+ * q.push(files);
+ */
+function asyncify(func) {
+    return initialParams(function (args, callback) {
+        var result;
+        try {
+            result = func.apply(this, args);
+        } catch (e) {
+            return callback(e);
+        }
+        // if result is Promise object
+        if (isObject(result) && typeof result.then === 'function') {
+            result.then(function (value) {
+                callback(null, value);
+            }, function (err) {
+                callback(err.message ? err : new Error(err));
+            });
+        } else {
+            callback(null, result);
+        }
+    });
 }
-// (protected) set from string and radix
-function bnpFromString(s, b)
-{
-  var k;
-  if (b == 16) k = 4;
-  else if (b == 8) k = 3;
-  else if (b == 256) k = 8; // byte array
-  else if (b == 2) k = 1;
-  else if (b == 32) k = 5;
-  else if (b == 4) k = 2;
-  else
-  {
-    this.fromRadix(s, b);
-    return;
-  }
-  this.t = 0;
-  this.s = 0;
-  var i = s.length,
-    mi = false,
-    sh = 0;
-  while (--i >= 0)
-  {
-    var x = (k == 8) ? s[i] & 0xff : intAt(s, i);
-    if (x < 0)
-    {
-      if (s.charAt(i) == "-") mi = true;
-      continue;
-    }
-    mi = false;
-    if (sh == 0)
-      this[this.t++] = x;
-    else if (sh + k > this.DB)
-    {
-      this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;
-      this[this.t++] = (x >> (this.DB - sh));
+
+/**
+ * A specialized version of `_.forEach` for arrays without support for
+ * iteratee shorthands.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns `array`.
+ */
+function arrayEach(array, iteratee) {
+  var index = -1,
+      length = array == null ? 0 : array.length;
+
+  while (++index < length) {
+    if (iteratee(array[index], index, array) === false) {
+      break;
     }
-    else
-      this[this.t - 1] |= x << sh;
-    sh += k;
-    if (sh >= this.DB) sh -= this.DB;
-  }
-  if (k == 8 && (s[0] & 0x80) != 0)
-  {
-    this.s = -1;
-    if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;
   }
-  this.clamp();
-  if (mi) BigInteger.ZERO.subTo(this, this);
-}
-// (protected) clamp off excess high words
-function bnpClamp()
-{
-  var c = this.s & this.DM;
-  while (this.t > 0 && this[this.t - 1] == c)--this.t;
+  return array;
 }
-// (public) return string representation in given radix
-function bnToString(b)
-{
-  if (this.s < 0) return "-" + this.negate().toString(b);
-  var k;
-  if (b == 16) k = 4;
-  else if (b == 8) k = 3;
-  else if (b == 2) k = 1;
-  else if (b == 32) k = 5;
-  else if (b == 4) k = 2;
-  else return this.toRadix(b);
-  var km = (1 << k) - 1,
-    d, m = false,
-    r = "",
-    i = this.t;
-  var p = this.DB - (i * this.DB) % k;
-  if (i-- > 0)
-  {
-    if (p < this.DB && (d = this[i] >> p) > 0)
-    {
-      m = true;
-      r = int2char(d);
-    }
-    while (i >= 0)
-    {
-      if (p < k)
-      {
-        d = (this[i] & ((1 << p) - 1)) << (k - p);
-        d |= this[--i] >> (p += this.DB - k);
-      }
-      else
-      {
-        d = (this[i] >> (p -= k)) & km;
-        if (p <= 0)
-        {
-          p += this.DB;
-          --i;
-        }
+
+/**
+ * Creates a base function for methods like `_.forIn` and `_.forOwn`.
+ *
+ * @private
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Function} Returns the new base function.
+ */
+function createBaseFor(fromRight) {
+  return function(object, iteratee, keysFunc) {
+    var index = -1,
+        iterable = Object(object),
+        props = keysFunc(object),
+        length = props.length;
+
+    while (length--) {
+      var key = props[fromRight ? length : ++index];
+      if (iteratee(iterable[key], key, iterable) === false) {
+        break;
       }
-      if (d > 0) m = true;
-      if (m) r += int2char(d);
     }
-  }
-  return m ? r : "0";
-}
-// (public) -this
-function bnNegate()
-{
-  var r = nbi();
-  BigInteger.ZERO.subTo(this, r);
-  return r;
-}
-// (public) |this|
-function bnAbs()
-{
-  return (this.s < 0) ? this.negate() : this;
-}
-// (public) return + if this > a, - if this < a, 0 if equal
-function bnCompareTo(a)
-{
-  var r = this.s - a.s;
-  if (r != 0) return r;
-  var i = this.t;
-  r = i - a.t;
-  if (r != 0) return (this.s < 0) ? -r : r;
-  while (--i >= 0)
-    if ((r = this[i] - a[i]) != 0) return r;
-  return 0;
-}
-// returns bit length of the integer x
-function nbits(x)
-{
-  var r = 1,
-    t;
-  if ((t = x >>> 16) != 0)
-  {
-    x = t;
-    r += 16;
-  }
-  if ((t = x >> 8) != 0)
-  {
-    x = t;
-    r += 8;
-  }
-  if ((t = x >> 4) != 0)
-  {
-    x = t;
-    r += 4;
-  }
-  if ((t = x >> 2) != 0)
-  {
-    x = t;
-    r += 2;
-  }
-  if ((t = x >> 1) != 0)
-  {
-    x = t;
-    r += 1;
-  }
-  return r;
-}
-// (public) return the number of bits in "this"
-function bnBitLength()
-{
-  if (this.t <= 0) return 0;
-  return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));
-}
-// (protected) r = this << n*DB
-function bnpDLShiftTo(n, r)
-{
-  var i;
-  for (i = this.t - 1; i >= 0; --i) r[i + n] = this[i];
-  for (i = n - 1; i >= 0; --i) r[i] = 0;
-  r.t = this.t + n;
-  r.s = this.s;
+    return object;
+  };
 }
-// (protected) r = this >> n*DB
-function bnpDRShiftTo(n, r)
-{
-  for (var i = n; i < this.t; ++i) r[i - n] = this[i];
-  r.t = Math.max(this.t - n, 0);
-  r.s = this.s;
+
+/**
+ * The base implementation of `baseForOwn` which iterates over `object`
+ * properties returned by `keysFunc` and invokes `iteratee` for each property.
+ * Iteratee functions may exit iteration early by explicitly returning `false`.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @param {Function} keysFunc The function to get the keys of `object`.
+ * @returns {Object} Returns `object`.
+ */
+var baseFor = createBaseFor();
+
+/**
+ * The base implementation of `_.forOwn` without support for iteratee shorthands.
+ *
+ * @private
+ * @param {Object} object The object to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Object} Returns `object`.
+ */
+function baseForOwn(object, iteratee) {
+  return object && baseFor(object, iteratee, keys);
 }
-// (protected) r = this << n
-function bnpLShiftTo(n, r)
-{
-  var bs = n % this.DB;
-  var cbs = this.DB - bs;
-  var bm = (1 << cbs) - 1;
-  var ds = Math.floor(n / this.DB),
-    c = (this.s << bs) & this.DM,
-    i;
-  for (i = this.t - 1; i >= 0; --i)
-  {
-    r[i + ds + 1] = (this[i] >> cbs) | c;
-    c = (this[i] & bm) << bs;
+
+/**
+ * The base implementation of `_.findIndex` and `_.findLastIndex` without
+ * support for iteratee shorthands.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {Function} predicate The function invoked per iteration.
+ * @param {number} fromIndex The index to search from.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function baseFindIndex(array, predicate, fromIndex, fromRight) {
+  var length = array.length,
+      index = fromIndex + (fromRight ? 1 : -1);
+
+  while ((fromRight ? index-- : ++index < length)) {
+    if (predicate(array[index], index, array)) {
+      return index;
+    }
   }
-  for (i = ds - 1; i >= 0; --i) r[i] = 0;
-  r[ds] = c;
-  r.t = this.t + ds + 1;
-  r.s = this.s;
-  r.clamp();
+  return -1;
 }
-// (protected) r = this >> n
-function bnpRShiftTo(n, r)
-{
-  r.s = this.s;
-  var ds = Math.floor(n / this.DB);
-  if (ds >= this.t)
-  {
-    r.t = 0;
-    return;
-  }
-  var bs = n % this.DB;
-  var cbs = this.DB - bs;
-  var bm = (1 << bs) - 1;
-  r[0] = this[ds] >> bs;
-  for (var i = ds + 1; i < this.t; ++i)
-  {
-    r[i - ds - 1] |= (this[i] & bm) << cbs;
-    r[i - ds] = this[i] >> bs;
-  }
-  if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;
-  r.t = this.t - ds;
-  r.clamp();
+
+/**
+ * The base implementation of `_.isNaN` without support for number objects.
+ *
+ * @private
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+ */
+function baseIsNaN(value) {
+  return value !== value;
 }
-// (protected) r = this - a
-function bnpSubTo(a, r)
-{
-  var i = 0,
-    c = 0,
-    m = Math.min(a.t, this.t);
-  while (i < m)
-  {
-    c += this[i] - a[i];
-    r[i++] = c & this.DM;
-    c >>= this.DB;
-  }
-  if (a.t < this.t)
-  {
-    c -= a.s;
-    while (i < this.t)
-    {
-      c += this[i];
-      r[i++] = c & this.DM;
-      c >>= this.DB;
-    }
-    c += this.s;
-  }
-  else
-  {
-    c += this.s;
-    while (i < a.t)
-    {
-      c -= a[i];
-      r[i++] = c & this.DM;
-      c >>= this.DB;
+
+/**
+ * A specialized version of `_.indexOf` which performs strict equality
+ * comparisons of values, i.e. `===`.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function strictIndexOf(array, value, fromIndex) {
+  var index = fromIndex - 1,
+      length = array.length;
+
+  while (++index < length) {
+    if (array[index] === value) {
+      return index;
     }
-    c -= a.s;
   }
-  r.s = (c < 0) ? -1 : 0;
-  if (c < -1) r[i++] = this.DV + c;
-  else if (c > 0) r[i++] = c;
-  r.t = i;
-  r.clamp();
+  return -1;
 }
-// (protected) r = this * a, r != this,a (HAC 14.12)
-// "this" should be the larger one if appropriate.
-function bnpMultiplyTo(a, r)
-{
-  var x = this.abs(),
-    y = a.abs();
-  var i = x.t;
-  r.t = i + y.t;
-  while (--i >= 0) r[i] = 0;
-  for (i = 0; i < y.t; ++i) r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
-  r.s = 0;
-  r.clamp();
-  if (this.s != a.s) BigInteger.ZERO.subTo(r, r);
+
+/**
+ * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {*} value The value to search for.
+ * @param {number} fromIndex The index to search from.
+ * @returns {number} Returns the index of the matched value, else `-1`.
+ */
+function baseIndexOf(array, value, fromIndex) {
+  return value === value
+    ? strictIndexOf(array, value, fromIndex)
+    : baseFindIndex(array, baseIsNaN, fromIndex);
 }
-// (protected) r = this^2, r != this (HAC 14.16)
-function bnpSquareTo(r)
-{
-  var x = this.abs();
-  var i = r.t = 2 * x.t;
-  while (--i >= 0) r[i] = 0;
-  for (i = 0; i < x.t - 1; ++i)
-  {
-    var c = x.am(i, x[i], r, 2 * i, 0, 1);
-    if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV)
-    {
-      r[i + x.t] -= x.DV;
-      r[i + x.t + 1] = 1;
+
+/**
+ * Determines the best order for running the functions in `tasks`, based on
+ * their requirements. Each function can optionally depend on other functions
+ * being completed first, and each function is run as soon as its requirements
+ * are satisfied.
+ *
+ * If any of the functions pass an error to their callback, the `auto` sequence
+ * will stop. Further tasks will not execute (so any other functions depending
+ * on it will not run), and the main `callback` is immediately called with the
+ * error.
+ *
+ * Functions also receive an object containing the results of functions which
+ * have completed so far as the first argument, if they have dependencies. If a
+ * task function has no dependencies, it will only be passed a callback.
+ *
+ * @name auto
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Object} tasks - An object. Each of its properties is either a
+ * function or an array of requirements, with the function itself the last item
+ * in the array. The object's key of a property serves as the name of the task
+ * defined by that property, i.e. can be used when specifying requirements for
+ * other tasks. The function receives one or two arguments:
+ * * a `results` object, containing the results of the previously executed
+ *   functions, only passed if the task has any dependencies,
+ * * a `callback(err, result)` function, which must be called when finished,
+ *   passing an `error` (which can be `null`) and the result of the function's
+ *   execution.
+ * @param {number} [concurrency=Infinity] - An optional `integer` for
+ * determining the maximum number of tasks that can be run in parallel. By
+ * default, as many as possible.
+ * @param {Function} [callback] - An optional callback which is called when all
+ * the tasks have been completed. It receives the `err` argument if any `tasks`
+ * pass an error to their callback. Results are always returned; however, if an
+ * error occurs, no further `tasks` will be performed, and the results object
+ * will only contain partial results. Invoked with (err, results).
+ * @returns undefined
+ * @example
+ *
+ * async.auto({
+ *     // this function will just be passed a callback
+ *     readData: async.apply(fs.readFile, 'data.txt', 'utf-8'),
+ *     showData: ['readData', function(results, cb) {
+ *         // results.readData is the file's contents
+ *         // ...
+ *     }]
+ * }, callback);
+ *
+ * async.auto({
+ *     get_data: function(callback) {
+ *         console.log('in get_data');
+ *         // async code to get some data
+ *         callback(null, 'data', 'converted to array');
+ *     },
+ *     make_folder: function(callback) {
+ *         console.log('in make_folder');
+ *         // async code to create a directory to store a file in
+ *         // this is run at the same time as getting the data
+ *         callback(null, 'folder');
+ *     },
+ *     write_file: ['get_data', 'make_folder', function(results, callback) {
+ *         console.log('in write_file', JSON.stringify(results));
+ *         // once there is some data and the directory exists,
+ *         // write the data to a file in the directory
+ *         callback(null, 'filename');
+ *     }],
+ *     email_link: ['write_file', function(results, callback) {
+ *         console.log('in email_link', JSON.stringify(results));
+ *         // once the file is written let's email a link to it...
+ *         // results.write_file contains the filename returned by write_file.
+ *         callback(null, {'file':results.write_file, 'email':'user@example.com'});
+ *     }]
+ * }, function(err, results) {
+ *     console.log('err = ', err);
+ *     console.log('results = ', results);
+ * });
+ */
+var auto = function (tasks, concurrency, callback) {
+    if (typeof concurrency === 'function') {
+        // concurrency is optional, shift the args.
+        callback = concurrency;
+        concurrency = null;
     }
-  }
-  if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
-  r.s = 0;
-  r.clamp();
-}
-// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
-// r != q, this != m.  q or r may be null.
-function bnpDivRemTo(m, q, r)
-{
-  var pm = m.abs();
-  if (pm.t <= 0) return;
-  var pt = this.abs();
-  if (pt.t < pm.t)
-  {
-    if (q != null) q.fromInt(0);
-    if (r != null) this.copyTo(r);
-    return;
-  }
-  if (r == null) r = nbi();
-  var y = nbi(),
-    ts = this.s,
-    ms = m.s;
-  var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus
-  if (nsh > 0)
-  {
-    pm.lShiftTo(nsh, y);
-    pt.lShiftTo(nsh, r);
-  }
-  else
-  {
-    pm.copyTo(y);
-    pt.copyTo(r);
-  }
-  var ys = y.t;
-  var y0 = y[ys - 1];
-  if (y0 == 0) return;
-  var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);
-  var d1 = this.FV / yt,
-    d2 = (1 << this.F1) / yt,
-    e = 1 << this.F2;
-  var i = r.t,
-    j = i - ys,
-    t = (q == null) ? nbi() : q;
-  y.dlShiftTo(j, t);
-  if (r.compareTo(t) >= 0)
-  {
-    r[r.t++] = 1;
-    r.subTo(t, r);
-  }
-  BigInteger.ONE.dlShiftTo(ys, t);
-  t.subTo(y, y); // "negative" y so we can replace sub with am later
-  while (y.t < ys) y[y.t++] = 0;
-  while (--j >= 0)
-  {
-    // Estimate quotient digit
-    var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
-    if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd)
-    { // Try it out
-      y.dlShiftTo(j, t);
-      r.subTo(t, r);
-      while (r[i] < --qd) r.subTo(t, r);
+    callback = once(callback || noop);
+    var keys$$1 = keys(tasks);
+    var numTasks = keys$$1.length;
+    if (!numTasks) {
+        return callback(null);
+    }
+    if (!concurrency) {
+        concurrency = numTasks;
     }
-  }
-  if (q != null)
-  {
-    r.drShiftTo(ys, q);
-    if (ts != ms) BigInteger.ZERO.subTo(q, q);
-  }
-  r.t = ys;
-  r.clamp();
-  if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder
-  if (ts < 0) BigInteger.ZERO.subTo(r, r);
-}
-// (public) this mod a
-function bnMod(a)
-{
-  var r = nbi();
-  this.abs().divRemTo(a, null, r);
-  if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r);
-  return r;
-}
-// Modular reduction using "classic" algorithm
-function Classic(m)
-{
-  this.m = m;
-}
 
-function cConvert(x)
-{
-  if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
-  else return x;
-}
+    var results = {};
+    var runningTasks = 0;
+    var hasError = false;
 
-function cRevert(x)
-{
-  return x;
-}
+    var listeners = {};
 
-function cReduce(x)
-{
-  x.divRemTo(this.m, null, x);
-}
+    var readyTasks = [];
 
-function cMulTo(x, y, r)
-{
-  x.multiplyTo(y, r);
-  this.reduce(r);
-}
+    // for cycle detection:
+    var readyToCheck = []; // tasks that have been identified as reachable
+    // without the possibility of returning to an ancestor task
+    var uncheckedDependencies = {};
 
-function cSqrTo(x, r)
-{
-  x.squareTo(r);
-  this.reduce(r);
-}
-Classic.prototype.convert = cConvert;
-Classic.prototype.revert = cRevert;
-Classic.prototype.reduce = cReduce;
-Classic.prototype.mulTo = cMulTo;
-Classic.prototype.sqrTo = cSqrTo;
-// (protected) return "-1/this % 2^DB"; useful for Mont. reduction
-// justification:
-//         xy == 1 (mod m)
-//         xy =  1+km
-//   xy(2-xy) = (1+km)(1-km)
-// x[y(2-xy)] = 1-k^2m^2
-// x[y(2-xy)] == 1 (mod m^2)
-// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
-// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
-// JS multiply "overflows" differently from C/C++, so care is needed here.
-function bnpInvDigit()
-{
-  if (this.t < 1) return 0;
-  var x = this[0];
-  if ((x & 1) == 0) return 0;
-  var y = x & 3; // y == 1/x mod 2^2
-  y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4
-  y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8
-  y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16
-  // last step - calculate inverse mod DV directly;
-  // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
-  y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits
-  // we really want the negative inverse, and -DV < y < DV
-  return (y > 0) ? this.DV - y : -y;
-}
-// Montgomery reduction
-function Montgomery(m)
-{
-  this.m = m;
-  this.mp = m.invDigit();
-  this.mpl = this.mp & 0x7fff;
-  this.mph = this.mp >> 15;
-  this.um = (1 << (m.DB - 15)) - 1;
-  this.mt2 = 2 * m.t;
-}
-// xR mod m
-function montConvert(x)
-{
-  var r = nbi();
-  x.abs().dlShiftTo(this.m.t, r);
-  r.divRemTo(this.m, null, r);
-  if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r);
-  return r;
-}
-// x/R mod m
-function montRevert(x)
-{
-  var r = nbi();
-  x.copyTo(r);
-  this.reduce(r);
-  return r;
-}
-// x = x/R mod m (HAC 14.32)
-function montReduce(x)
-{
-  while (x.t <= this.mt2) // pad x so am has enough room later
-    x[x.t++] = 0;
-  for (var i = 0; i < this.m.t; ++i)
-  {
-    // faster way of calculating u0 = x[i]*mp mod DV
-    var j = x[i] & 0x7fff;
-    var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;
-    // use am to combine the multiply-shift-add into one call
-    j = i + this.m.t;
-    x[j] += this.m.am(0, u0, x, i, 0, this.m.t);
-    // propagate carry
-    while (x[j] >= x.DV)
-    {
-      x[j] -= x.DV;
-      x[++j]++;
-    }
-  }
-  x.clamp();
-  x.drShiftTo(this.m.t, x);
-  if (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
-}
-// r = "x^2/R mod m"; x != r
-function montSqrTo(x, r)
-{
-  x.squareTo(r);
-  this.reduce(r);
-}
-// r = "xy/R mod m"; x,y != r
-function montMulTo(x, y, r)
-{
-  x.multiplyTo(y, r);
-  this.reduce(r);
-}
-Montgomery.prototype.convert = montConvert;
-Montgomery.prototype.revert = montRevert;
-Montgomery.prototype.reduce = montReduce;
-Montgomery.prototype.mulTo = montMulTo;
-Montgomery.prototype.sqrTo = montSqrTo;
-// (protected) true iff this is even
-function bnpIsEven()
-{
-  return ((this.t > 0) ? (this[0] & 1) : this.s) == 0;
-}
-// (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
-function bnpExp(e, z)
-{
-  if (e > 0xffffffff || e < 1) return BigInteger.ONE;
-  var r = nbi(),
-    r2 = nbi(),
-    g = z.convert(this),
-    i = nbits(e) - 1;
-  g.copyTo(r);
-  while (--i >= 0)
-  {
-    z.sqrTo(r, r2);
-    if ((e & (1 << i)) > 0) z.mulTo(r2, g, r);
-    else
-    {
-      var t = r;
-      r = r2;
-      r2 = t;
+    baseForOwn(tasks, function (task, key) {
+        if (!isArray(task)) {
+            // no dependencies
+            enqueueTask(key, [task]);
+            readyToCheck.push(key);
+            return;
+        }
+
+        var dependencies = task.slice(0, task.length - 1);
+        var remainingDependencies = dependencies.length;
+        if (remainingDependencies === 0) {
+            enqueueTask(key, task);
+            readyToCheck.push(key);
+            return;
+        }
+        uncheckedDependencies[key] = remainingDependencies;
+
+        arrayEach(dependencies, function (dependencyName) {
+            if (!tasks[dependencyName]) {
+                throw new Error('async.auto task `' + key + '` has a non-existent dependency in ' + dependencies.join(', '));
+            }
+            addListener(dependencyName, function () {
+                remainingDependencies--;
+                if (remainingDependencies === 0) {
+                    enqueueTask(key, task);
+                }
+            });
+        });
+    });
+
+    checkForDeadlocks();
+    processQueue();
+
+    function enqueueTask(key, task) {
+        readyTasks.push(function () {
+            runTask(key, task);
+        });
     }
-  }
-  return z.revert(r);
-}
-// (public) this^e % m, 0 <= e < 2^32
-function bnModPowInt(e, m)
-{
-  var z;
-  if (e < 256 || m.isEven()) z = new Classic(m);
-  else z = new Montgomery(m);
-  return this.exp(e, z);
-}
-// protected
-BigInteger.prototype.copyTo = bnpCopyTo;
-BigInteger.prototype.fromInt = bnpFromInt;
-BigInteger.prototype.fromString = bnpFromString;
-BigInteger.prototype.clamp = bnpClamp;
-BigInteger.prototype.dlShiftTo = bnpDLShiftTo;
-BigInteger.prototype.drShiftTo = bnpDRShiftTo;
-BigInteger.prototype.lShiftTo = bnpLShiftTo;
-BigInteger.prototype.rShiftTo = bnpRShiftTo;
-BigInteger.prototype.subTo = bnpSubTo;
-BigInteger.prototype.multiplyTo = bnpMultiplyTo;
-BigInteger.prototype.squareTo = bnpSquareTo;
-BigInteger.prototype.divRemTo = bnpDivRemTo;
-BigInteger.prototype.invDigit = bnpInvDigit;
-BigInteger.prototype.isEven = bnpIsEven;
-BigInteger.prototype.exp = bnpExp;
-// public
-BigInteger.prototype.toString = bnToString;
-BigInteger.prototype.negate = bnNegate;
-BigInteger.prototype.abs = bnAbs;
-BigInteger.prototype.compareTo = bnCompareTo;
-BigInteger.prototype.bitLength = bnBitLength;
-BigInteger.prototype.mod = bnMod;
-BigInteger.prototype.modPowInt = bnModPowInt;
-// "constants"
-BigInteger.ZERO = nbv(0);
-BigInteger.ONE = nbv(1);
-// Copyright (c) 2005-2009  Tom Wu
-// All Rights Reserved.
-// See "LICENSE" for details.
-// Extended JavaScript BN functions, required for RSA private ops.
-// Version 1.1: new BigInteger("0", 10) returns "proper" zero
-// Version 1.2: square() API, isProbablePrime fix
-// (public)
-function bnClone()
-{
-  var r = nbi();
-  this.copyTo(r);
-  return r;
-}
-// (public) return value as integer
-function bnIntValue()
-{
-  if (this.s < 0)
-  {
-    if (this.t == 1) return this[0] - this.DV;
-    else if (this.t == 0) return -1;
-  }
-  else if (this.t == 1) return this[0];
-  else if (this.t == 0) return 0;
-  // assumes 16 < DB < 32
-  return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];
-}
-// (public) return value as byte
-function bnByteValue()
-{
-  return (this.t == 0) ? this.s : (this[0] << 24) >> 24;
-}
-// (public) return value as short (assumes DB>=16)
-function bnShortValue()
-{
-  return (this.t == 0) ? this.s : (this[0] << 16) >> 16;
-}
-// (protected) return x s.t. r^x < DV
-function bnpChunkSize(r)
-{
-  return Math.floor(Math.LN2 * this.DB / Math.log(r));
-}
-// (public) 0 if this == 0, 1 if this > 0
-function bnSigNum()
-{
-  if (this.s < 0) return -1;
-  else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
-  else return 1;
-}
-// (protected) convert to radix string
-function bnpToRadix(b)
-{
-  if (b == null) b = 10;
-  if (this.signum() == 0 || b < 2 || b > 36) return "0";
-  var cs = this.chunkSize(b);
-  var a = Math.pow(b, cs);
-  var d = nbv(a),
-    y = nbi(),
-    z = nbi(),
-    r = "";
-  this.divRemTo(d, y, z);
-  while (y.signum() > 0)
-  {
-    r = (a + z.intValue()).toString(b).substr(1) + r;
-    y.divRemTo(d, y, z);
-  }
-  return z.intValue().toString(b) + r;
-}
-// (protected) convert from radix string
-function bnpFromRadix(s, b)
-{
-  this.fromInt(0);
-  if (b == null) b = 10;
-  var cs = this.chunkSize(b);
-  var d = Math.pow(b, cs),
-    mi = false,
-    j = 0,
-    w = 0;
-  for (var i = 0; i < s.length; ++i)
-  {
-    var x = intAt(s, i);
-    if (x < 0)
-    {
-      if (s.charAt(i) == "-" && this.signum() == 0) mi = true;
-      continue;
+
+    function processQueue() {
+        if (readyTasks.length === 0 && runningTasks === 0) {
+            return callback(null, results);
+        }
+        while (readyTasks.length && runningTasks < concurrency) {
+            var run = readyTasks.shift();
+            run();
+        }
     }
-    w = b * w + x;
-    if (++j >= cs)
-    {
-      this.dMultiply(d);
-      this.dAddOffset(w, 0);
-      j = 0;
-      w = 0;
+
+    function addListener(taskName, fn) {
+        var taskListeners = listeners[taskName];
+        if (!taskListeners) {
+            taskListeners = listeners[taskName] = [];
+        }
+
+        taskListeners.push(fn);
     }
-  }
-  if (j > 0)
-  {
-    this.dMultiply(Math.pow(b, j));
-    this.dAddOffset(w, 0);
-  }
-  if (mi) BigInteger.ZERO.subTo(this, this);
-}
-// (protected) alternate constructor
-function bnpFromNumber(a, b, c)
-{
-  if ("number" == typeof b)
-  {
-    // new BigInteger(int,int,RNG)
-    if (a < 2) this.fromInt(1);
-    else
-    {
-      this.fromNumber(a, c);
-      if (!this.testBit(a - 1)) // force MSB set
-        this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
-      if (this.isEven()) this.dAddOffset(1, 0); // force odd
-      while (!this.isProbablePrime(b))
-      {
-        this.dAddOffset(2, 0);
-        if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
-      }
+
+    function taskComplete(taskName) {
+        var taskListeners = listeners[taskName] || [];
+        arrayEach(taskListeners, function (fn) {
+            fn();
+        });
+        processQueue();
     }
-  }
-  else
-  {
-    // new BigInteger(int,RNG)
-    var x = new Array(),
-      t = a & 7;
-    x.length = (a >> 3) + 1;
-    b.nextBytes(x);
-    if (t > 0) x[0] &= ((1 << t) - 1);
-    else x[0] = 0;
-    this.fromString(x, 256);
-  }
-}
-// (public) convert to bigendian byte array
-function bnToByteArray()
-{
-  var i = this.t,
-    r = new Array();
-  r[0] = this.s;
-  var p = this.DB - (i * this.DB) % 8,
-    d, k = 0;
-  if (i-- > 0)
-  {
-    if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p)
-      r[k++] = d | (this.s << (this.DB - p));
-    while (i >= 0)
-    {
-      if (p < 8)
-      {
-        d = (this[i] & ((1 << p) - 1)) << (8 - p);
-        d |= this[--i] >> (p += this.DB - 8);
-      }
-      else
-      {
-        d = (this[i] >> (p -= 8)) & 0xff;
-        if (p <= 0)
-        {
-          p += this.DB;
-          --i;
+
+    function runTask(key, task) {
+        if (hasError) return;
+
+        var taskCallback = onlyOnce(rest(function (err, args) {
+            runningTasks--;
+            if (args.length <= 1) {
+                args = args[0];
+            }
+            if (err) {
+                var safeResults = {};
+                baseForOwn(results, function (val, rkey) {
+                    safeResults[rkey] = val;
+                });
+                safeResults[key] = args;
+                hasError = true;
+                listeners = [];
+
+                callback(err, safeResults);
+            } else {
+                results[key] = args;
+                taskComplete(key);
+            }
+        }));
+
+        runningTasks++;
+        var taskFn = task[task.length - 1];
+        if (task.length > 1) {
+            taskFn(results, taskCallback);
+        } else {
+            taskFn(taskCallback);
+        }
+    }
+
+    function checkForDeadlocks() {
+        // Kahn's algorithm
+        // https://en.wikipedia.org/wiki/Topological_sorting#Kahn.27s_algorithm
+        // http://connalle.blogspot.com/2013/10/topological-sortingkahn-algorithm.html
+        var currentTask;
+        var counter = 0;
+        while (readyToCheck.length) {
+            currentTask = readyToCheck.pop();
+            counter++;
+            arrayEach(getDependents(currentTask), function (dependent) {
+                if (--uncheckedDependencies[dependent] === 0) {
+                    readyToCheck.push(dependent);
+                }
+            });
         }
-      }
-      if ((d & 0x80) != 0) d |= -256;
-      if (k == 0 && (this.s & 0x80) != (d & 0x80))++k;
-      if (k > 0 || d != this.s) r[k++] = d;
+
+        if (counter !== numTasks) {
+            throw new Error('async.auto cannot execute tasks due to a recursive dependency');
+        }
+    }
+
+    function getDependents(taskName) {
+        var result = [];
+        baseForOwn(tasks, function (task, key) {
+            if (isArray(task) && baseIndexOf(task, taskName, 0) >= 0) {
+                result.push(key);
+            }
+        });
+        return result;
     }
+};
+
+/**
+ * A specialized version of `_.map` for arrays without support for iteratee
+ * shorthands.
+ *
+ * @private
+ * @param {Array} [array] The array to iterate over.
+ * @param {Function} iteratee The function invoked per iteration.
+ * @returns {Array} Returns the new mapped array.
+ */
+function arrayMap(array, iteratee) {
+  var index = -1,
+      length = array == null ? 0 : array.length,
+      result = Array(length);
+
+  while (++index < length) {
+    result[index] = iteratee(array[index], index, array);
   }
-  return r;
+  return result;
 }
 
-function bnEquals(a)
-{
-  return (this.compareTo(a) == 0);
-}
+/** `Object#toString` result references. */
+var symbolTag = '[object Symbol]';
 
-function bnMin(a)
-{
-  return (this.compareTo(a) < 0) ? this : a;
+/**
+ * Checks if `value` is classified as a `Symbol` primitive or object.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to check.
+ * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.
+ * @example
+ *
+ * _.isSymbol(Symbol.iterator);
+ * // => true
+ *
+ * _.isSymbol('abc');
+ * // => false
+ */
+function isSymbol(value) {
+  return typeof value == 'symbol' ||
+    (isObjectLike(value) && baseGetTag(value) == symbolTag);
 }
 
-function bnMax(a)
-{
-  return (this.compareTo(a) > 0) ? this : a;
-}
-// (protected) r = this op a (bitwise)
-function bnpBitwiseTo(a, op, r)
-{
-  var i, f, m = Math.min(a.t, this.t);
-  for (i = 0; i < m; ++i) r[i] = op(this[i], a[i]);
-  if (a.t < this.t)
-  {
-    f = a.s & this.DM;
-    for (i = m; i < this.t; ++i) r[i] = op(this[i], f);
-    r.t = this.t;
+/** Used as references for various `Number` constants. */
+var INFINITY = 1 / 0;
+
+/** Used to convert symbols to primitives and strings. */
+var symbolProto = Symbol$1 ? Symbol$1.prototype : undefined;
+var symbolToString = symbolProto ? symbolProto.toString : undefined;
+
+/**
+ * The base implementation of `_.toString` which doesn't convert nullish
+ * values to empty strings.
+ *
+ * @private
+ * @param {*} value The value to process.
+ * @returns {string} Returns the string.
+ */
+function baseToString(value) {
+  // Exit early for strings to avoid a performance hit in some environments.
+  if (typeof value == 'string') {
+    return value;
   }
-  else
-  {
-    f = this.s & this.DM;
-    for (i = m; i < a.t; ++i) r[i] = op(f, a[i]);
-    r.t = a.t;
+  if (isArray(value)) {
+    // Recursively convert values (susceptible to call stack limits).
+    return arrayMap(value, baseToString) + '';
   }
-  r.s = op(this.s, a.s);
-  r.clamp();
-}
-// (public) this & a
-function op_and(x, y)
-{
-  return x & y;
+  if (isSymbol(value)) {
+    return symbolToString ? symbolToString.call(value) : '';
+  }
+  var result = (value + '');
+  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
 }
 
-function bnAnd(a)
-{
-  var r = nbi();
-  this.bitwiseTo(a, op_and, r);
-  return r;
-}
-// (public) this | a
-function op_or(x, y)
-{
-  return x | y;
+/**
+ * The base implementation of `_.slice` without an iteratee call guard.
+ *
+ * @private
+ * @param {Array} array The array to slice.
+ * @param {number} [start=0] The start position.
+ * @param {number} [end=array.length] The end position.
+ * @returns {Array} Returns the slice of `array`.
+ */
+function baseSlice(array, start, end) {
+  var index = -1,
+      length = array.length;
+
+  if (start < 0) {
+    start = -start > length ? 0 : (length + start);
+  }
+  end = end > length ? length : end;
+  if (end < 0) {
+    end += length;
+  }
+  length = start > end ? 0 : ((end - start) >>> 0);
+  start >>>= 0;
+
+  var result = Array(length);
+  while (++index < length) {
+    result[index] = array[index + start];
+  }
+  return result;
 }
 
-function bnOr(a)
-{
-  var r = nbi();
-  this.bitwiseTo(a, op_or, r);
-  return r;
+/**
+ * Casts `array` to a slice if it's needed.
+ *
+ * @private
+ * @param {Array} array The array to inspect.
+ * @param {number} start The start position.
+ * @param {number} [end=array.length] The end position.
+ * @returns {Array} Returns the cast slice.
+ */
+function castSlice(array, start, end) {
+  var length = array.length;
+  end = end === undefined ? length : end;
+  return (!start && end >= length) ? array : baseSlice(array, start, end);
 }
-// (public) this ^ a
-function op_xor(x, y)
-{
-  return x ^ y;
+
+/**
+ * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol
+ * that is not found in the character symbols.
+ *
+ * @private
+ * @param {Array} strSymbols The string symbols to inspect.
+ * @param {Array} chrSymbols The character symbols to find.
+ * @returns {number} Returns the index of the last unmatched string symbol.
+ */
+function charsEndIndex(strSymbols, chrSymbols) {
+  var index = strSymbols.length;
+
+  while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
+  return index;
 }
 
-function bnXor(a)
-{
-  var r = nbi();
-  this.bitwiseTo(a, op_xor, r);
-  return r;
+/**
+ * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol
+ * that is not found in the character symbols.
+ *
+ * @private
+ * @param {Array} strSymbols The string symbols to inspect.
+ * @param {Array} chrSymbols The character symbols to find.
+ * @returns {number} Returns the index of the first unmatched string symbol.
+ */
+function charsStartIndex(strSymbols, chrSymbols) {
+  var index = -1,
+      length = strSymbols.length;
+
+  while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
+  return index;
 }
-// (public) this & ~a
-function op_andnot(x, y)
-{
-  return x & ~y;
+
+/**
+ * Converts an ASCII `string` to an array.
+ *
+ * @private
+ * @param {string} string The string to convert.
+ * @returns {Array} Returns the converted array.
+ */
+function asciiToArray(string) {
+  return string.split('');
 }
 
-function bnAndNot(a)
-{
-  var r = nbi();
-  this.bitwiseTo(a, op_andnot, r);
-  return r;
+/** Used to compose unicode character classes. */
+var rsAstralRange = '\\ud800-\\udfff';
+var rsComboMarksRange = '\\u0300-\\u036f\\ufe20-\\ufe23';
+var rsComboSymbolsRange = '\\u20d0-\\u20f0';
+var rsVarRange = '\\ufe0e\\ufe0f';
+
+/** Used to compose unicode capture groups. */
+var rsZWJ = '\\u200d';
+
+/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
+var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboMarksRange + rsComboSymbolsRange + rsVarRange + ']');
+
+/**
+ * Checks if `string` contains Unicode symbols.
+ *
+ * @private
+ * @param {string} string The string to inspect.
+ * @returns {boolean} Returns `true` if a symbol is found, else `false`.
+ */
+function hasUnicode(string) {
+  return reHasUnicode.test(string);
 }
-// (public) ~this
-function bnNot()
-{
-  var r = nbi();
-  for (var i = 0; i < this.t; ++i) r[i] = this.DM & ~this[i];
-  r.t = this.t;
-  r.s = ~this.s;
-  return r;
+
+/** Used to compose unicode character classes. */
+var rsAstralRange$1 = '\\ud800-\\udfff';
+var rsComboMarksRange$1 = '\\u0300-\\u036f\\ufe20-\\ufe23';
+var rsComboSymbolsRange$1 = '\\u20d0-\\u20f0';
+var rsVarRange$1 = '\\ufe0e\\ufe0f';
+
+/** Used to compose unicode capture groups. */
+var rsAstral = '[' + rsAstralRange$1 + ']';
+var rsCombo = '[' + rsComboMarksRange$1 + rsComboSymbolsRange$1 + ']';
+var rsFitz = '\\ud83c[\\udffb-\\udfff]';
+var rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')';
+var rsNonAstral = '[^' + rsAstralRange$1 + ']';
+var rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}';
+var rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]';
+var rsZWJ$1 = '\\u200d';
+
+/** Used to compose unicode regexes. */
+var reOptMod = rsModifier + '?';
+var rsOptVar = '[' + rsVarRange$1 + ']?';
+var rsOptJoin = '(?:' + rsZWJ$1 + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*';
+var rsSeq = rsOptVar + reOptMod + rsOptJoin;
+var rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';
+
+/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
+var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');
+
+/**
+ * Converts a Unicode `string` to an array.
+ *
+ * @private
+ * @param {string} string The string to convert.
+ * @returns {Array} Returns the converted array.
+ */
+function unicodeToArray(string) {
+  return string.match(reUnicode) || [];
 }
-// (public) this << n
-function bnShiftLeft(n)
-{
-  var r = nbi();
-  if (n < 0) this.rShiftTo(-n, r);
-  else this.lShiftTo(n, r);
-  return r;
+
+/**
+ * Converts `string` to an array.
+ *
+ * @private
+ * @param {string} string The string to convert.
+ * @returns {Array} Returns the converted array.
+ */
+function stringToArray(string) {
+  return hasUnicode(string)
+    ? unicodeToArray(string)
+    : asciiToArray(string);
 }
-// (public) this >> n
-function bnShiftRight(n)
-{
-  var r = nbi();
-  if (n < 0) this.lShiftTo(-n, r);
-  else this.rShiftTo(n, r);
-  return r;
+
+/**
+ * Converts `value` to a string. An empty string is returned for `null`
+ * and `undefined` values. The sign of `-0` is preserved.
+ *
+ * @static
+ * @memberOf _
+ * @since 4.0.0
+ * @category Lang
+ * @param {*} value The value to convert.
+ * @returns {string} Returns the converted string.
+ * @example
+ *
+ * _.toString(null);
+ * // => ''
+ *
+ * _.toString(-0);
+ * // => '-0'
+ *
+ * _.toString([1, 2, 3]);
+ * // => '1,2,3'
+ */
+function toString(value) {
+  return value == null ? '' : baseToString(value);
 }
-// return index of lowest 1-bit in x, x < 2^31
-function lbit(x)
-{
-  if (x == 0) return -1;
-  var r = 0;
-  if ((x & 0xffff) == 0)
-  {
-    x >>= 16;
-    r += 16;
-  }
-  if ((x & 0xff) == 0)
-  {
-    x >>= 8;
-    r += 8;
-  }
-  if ((x & 0xf) == 0)
-  {
-    x >>= 4;
-    r += 4;
+
+/** Used to match leading and trailing whitespace. */
+var reTrim = /^\s+|\s+$/g;
+
+/**
+ * Removes leading and trailing whitespace or specified characters from `string`.
+ *
+ * @static
+ * @memberOf _
+ * @since 3.0.0
+ * @category String
+ * @param {string} [string=''] The string to trim.
+ * @param {string} [chars=whitespace] The characters to trim.
+ * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+ * @returns {string} Returns the trimmed string.
+ * @example
+ *
+ * _.trim('  abc  ');
+ * // => 'abc'
+ *
+ * _.trim('-_-abc-_-', '_-');
+ * // => 'abc'
+ *
+ * _.map(['  foo  ', '  bar  '], _.trim);
+ * // => ['foo', 'bar']
+ */
+function trim(string, chars, guard) {
+  string = toString(string);
+  if (string && (guard || chars === undefined)) {
+    return string.replace(reTrim, '');
   }
-  if ((x & 3) == 0)
-  {
-    x >>= 2;
-    r += 2;
+  if (!string || !(chars = baseToString(chars))) {
+    return string;
   }
-  if ((x & 1) == 0)++r;
-  return r;
+  var strSymbols = stringToArray(string),
+      chrSymbols = stringToArray(chars),
+      start = charsStartIndex(strSymbols, chrSymbols),
+      end = charsEndIndex(strSymbols, chrSymbols) + 1;
+
+  return castSlice(strSymbols, start, end).join('');
 }
-// (public) returns index of lowest 1-bit (or -1 if none)
-function bnGetLowestSetBit()
-{
-  for (var i = 0; i < this.t; ++i)
-    if (this[i] != 0) return i * this.DB + lbit(this[i]);
-  if (this.s < 0) return this.t * this.DB;
-  return -1;
+
+var FN_ARGS = /^(function)?\s*[^\(]*\(\s*([^\)]*)\)/m;
+var FN_ARG_SPLIT = /,/;
+var FN_ARG = /(=.+)?(\s*)$/;
+var STRIP_COMMENTS = /((\/\/.*$)|(\/\*[\s\S]*?\*\/))/mg;
+
+function parseParams(func) {
+    func = func.toString().replace(STRIP_COMMENTS, '');
+    func = func.match(FN_ARGS)[2].replace(' ', '');
+    func = func ? func.split(FN_ARG_SPLIT) : [];
+    func = func.map(function (arg) {
+        return trim(arg.replace(FN_ARG, ''));
+    });
+    return func;
 }
-// return number of 1 bits in x
-function cbit(x)
-{
-  var r = 0;
-  while (x != 0)
-  {
-    x &= x - 1;
-    ++r;
-  }
-  return r;
+
+/**
+ * A dependency-injected version of the [async.auto]{@link module:ControlFlow.auto} function. Dependent
+ * tasks are specified as parameters to the function, after the usual callback
+ * parameter, with the parameter names matching the names of the tasks it
+ * depends on. This can provide even more readable task graphs which can be
+ * easier to maintain.
+ *
+ * If a final callback is specified, the task results are similarly injected,
+ * specified as named parameters after the initial error parameter.
+ *
+ * The autoInject function is purely syntactic sugar and its semantics are
+ * otherwise equivalent to [async.auto]{@link module:ControlFlow.auto}.
+ *
+ * @name autoInject
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.auto]{@link module:ControlFlow.auto}
+ * @category Control Flow
+ * @param {Object} tasks - An object, each of whose properties is a function of
+ * the form 'func([dependencies...], callback). The object's key of a property
+ * serves as the name of the task defined by that property, i.e. can be used
+ * when specifying requirements for other tasks.
+ * * The `callback` parameter is a `callback(err, result)` which must be called
+ *   when finished, passing an `error` (which can be `null`) and the result of
+ *   the function's execution. The remaining parameters name other tasks on
+ *   which the task is dependent, and the results from those tasks are the
+ *   arguments of those parameters.
+ * @param {Function} [callback] - An optional callback which is called when all
+ * the tasks have been completed. It receives the `err` argument if any `tasks`
+ * pass an error to their callback, and a `results` object with any completed
+ * task results, similar to `auto`.
+ * @example
+ *
+ * //  The example from `auto` can be rewritten as follows:
+ * async.autoInject({
+ *     get_data: function(callback) {
+ *         // async code to get some data
+ *         callback(null, 'data', 'converted to array');
+ *     },
+ *     make_folder: function(callback) {
+ *         // async code to create a directory to store a file in
+ *         // this is run at the same time as getting the data
+ *         callback(null, 'folder');
+ *     },
+ *     write_file: function(get_data, make_folder, callback) {
+ *         // once there is some data and the directory exists,
+ *         // write the data to a file in the directory
+ *         callback(null, 'filename');
+ *     },
+ *     email_link: function(write_file, callback) {
+ *         // once the file is written let's email a link to it...
+ *         // write_file contains the filename returned by write_file.
+ *         callback(null, {'file':write_file, 'email':'user@example.com'});
+ *     }
+ * }, function(err, results) {
+ *     console.log('err = ', err);
+ *     console.log('email_link = ', results.email_link);
+ * });
+ *
+ * // If you are using a JS minifier that mangles parameter names, `autoInject`
+ * // will not work with plain functions, since the parameter names will be
+ * // collapsed to a single letter identifier.  To work around this, you can
+ * // explicitly specify the names of the parameters your task function needs
+ * // in an array, similar to Angular.js dependency injection.
+ *
+ * // This still has an advantage over plain `auto`, since the results a task
+ * // depends on are still spread into arguments.
+ * async.autoInject({
+ *     //...
+ *     write_file: ['get_data', 'make_folder', function(get_data, make_folder, callback) {
+ *         callback(null, 'filename');
+ *     }],
+ *     email_link: ['write_file', function(write_file, callback) {
+ *         callback(null, {'file':write_file, 'email':'user@example.com'});
+ *     }]
+ *     //...
+ * }, function(err, results) {
+ *     console.log('err = ', err);
+ *     console.log('email_link = ', results.email_link);
+ * });
+ */
+function autoInject(tasks, callback) {
+    var newTasks = {};
+
+    baseForOwn(tasks, function (taskFn, key) {
+        var params;
+
+        if (isArray(taskFn)) {
+            params = taskFn.slice(0, -1);
+            taskFn = taskFn[taskFn.length - 1];
+
+            newTasks[key] = params.concat(params.length > 0 ? newTask : taskFn);
+        } else if (taskFn.length === 1) {
+            // no dependencies, use the function as-is
+            newTasks[key] = taskFn;
+        } else {
+            params = parseParams(taskFn);
+            if (taskFn.length === 0 && params.length === 0) {
+                throw new Error("autoInject task functions require explicit parameters.");
+            }
+
+            params.pop();
+
+            newTasks[key] = params.concat(newTask);
+        }
+
+        function newTask(results, taskCb) {
+            var newArgs = arrayMap(params, function (name) {
+                return results[name];
+            });
+            newArgs.push(taskCb);
+            taskFn.apply(null, newArgs);
+        }
+    });
+
+    auto(newTasks, callback);
 }
-// (public) return number of set bits
-function bnBitCount()
-{
-  var r = 0,
-    x = this.s & this.DM;
-  for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);
-  return r;
+
+var hasSetImmediate = typeof setImmediate === 'function' && setImmediate;
+var hasNextTick = typeof process === 'object' && typeof process.nextTick === 'function';
+
+function fallback(fn) {
+    setTimeout(fn, 0);
 }
-// (public) true iff nth bit is set
-function bnTestBit(n)
-{
-  var j = Math.floor(n / this.DB);
-  if (j >= this.t) return (this.s != 0);
-  return ((this[j] & (1 << (n % this.DB))) != 0);
+
+function wrap(defer) {
+    return rest(function (fn, args) {
+        defer(function () {
+            fn.apply(null, args);
+        });
+    });
 }
-// (protected) this op (1<<n)
-function bnpChangeBit(n, op)
-{
-  var r = BigInteger.ONE.shiftLeft(n);
-  this.bitwiseTo(r, op, r);
-  return r;
+
+var _defer;
+
+if (hasSetImmediate) {
+    _defer = setImmediate;
+} else if (hasNextTick) {
+    _defer = process.nextTick;
+} else {
+    _defer = fallback;
 }
-// (public) this | (1<<n)
-function bnSetBit(n)
-{
-  return this.changeBit(n, op_or);
+
+var setImmediate$1 = wrap(_defer);
+
+// Simple doubly linked list (https://en.wikipedia.org/wiki/Doubly_linked_list) implementation
+// used for queues. This implementation assumes that the node provided by the user can be modified
+// to adjust the next and last properties. We implement only the minimal functionality
+// for queue support.
+function DLL() {
+    this.head = this.tail = null;
+    this.length = 0;
 }
-// (public) this & ~(1<<n)
-function bnClearBit(n)
-{
-  return this.changeBit(n, op_andnot);
-}
-// (public) this ^ (1<<n)
-function bnFlipBit(n)
-{
-  return this.changeBit(n, op_xor);
+
+function setInitial(dll, node) {
+    dll.length = 1;
+    dll.head = dll.tail = node;
 }
-// (protected) r = this + a
-function bnpAddTo(a, r)
-{
-  var i = 0,
-    c = 0,
-    m = Math.min(a.t, this.t);
-  while (i < m)
-  {
-    c += this[i] + a[i];
-    r[i++] = c & this.DM;
-    c >>= this.DB;
-  }
-  if (a.t < this.t)
-  {
-    c += a.s;
-    while (i < this.t)
-    {
-      c += this[i];
-      r[i++] = c & this.DM;
-      c >>= this.DB;
+
+DLL.prototype.removeLink = function (node) {
+    if (node.prev) node.prev.next = node.next;else this.head = node.next;
+    if (node.next) node.next.prev = node.prev;else this.tail = node.prev;
+
+    node.prev = node.next = null;
+    this.length -= 1;
+    return node;
+};
+
+DLL.prototype.empty = DLL;
+
+DLL.prototype.insertAfter = function (node, newNode) {
+    newNode.prev = node;
+    newNode.next = node.next;
+    if (node.next) node.next.prev = newNode;else this.tail = newNode;
+    node.next = newNode;
+    this.length += 1;
+};
+
+DLL.prototype.insertBefore = function (node, newNode) {
+    newNode.prev = node.prev;
+    newNode.next = node;
+    if (node.prev) node.prev.next = newNode;else this.head = newNode;
+    node.prev = newNode;
+    this.length += 1;
+};
+
+DLL.prototype.unshift = function (node) {
+    if (this.head) this.insertBefore(this.head, node);else setInitial(this, node);
+};
+
+DLL.prototype.push = function (node) {
+    if (this.tail) this.insertAfter(this.tail, node);else setInitial(this, node);
+};
+
+DLL.prototype.shift = function () {
+    return this.head && this.removeLink(this.head);
+};
+
+DLL.prototype.pop = function () {
+    return this.tail && this.removeLink(this.tail);
+};
+
+function queue(worker, concurrency, payload) {
+    if (concurrency == null) {
+        concurrency = 1;
+    } else if (concurrency === 0) {
+        throw new Error('Concurrency must not be zero');
     }
-    c += this.s;
-  }
-  else
-  {
-    c += this.s;
-    while (i < a.t)
-    {
-      c += a[i];
-      r[i++] = c & this.DM;
-      c >>= this.DB;
+
+    function _insert(data, insertAtFront, callback) {
+        if (callback != null && typeof callback !== 'function') {
+            throw new Error('task callback must be a function');
+        }
+        q.started = true;
+        if (!isArray(data)) {
+            data = [data];
+        }
+        if (data.length === 0 && q.idle()) {
+            // call drain immediately if there are no tasks
+            return setImmediate$1(function () {
+                q.drain();
+            });
+        }
+
+        for (var i = 0, l = data.length; i < l; i++) {
+            var item = {
+                data: data[i],
+                callback: callback || noop
+            };
+
+            if (insertAtFront) {
+                q._tasks.unshift(item);
+            } else {
+                q._tasks.push(item);
+            }
+        }
+        setImmediate$1(q.process);
     }
-    c += a.s;
-  }
-  r.s = (c < 0) ? -1 : 0;
-  if (c > 0) r[i++] = c;
-  else if (c < -1) r[i++] = this.DV + c;
-  r.t = i;
-  r.clamp();
-}
-// (public) this + a
-function bnAdd(a)
-{
-  var r = nbi();
-  this.addTo(a, r);
-  return r;
-}
-// (public) this - a
-function bnSubtract(a)
-{
-  var r = nbi();
-  this.subTo(a, r);
-  return r;
-}
-// (public) this * a
-function bnMultiply(a)
-{
-  var r = nbi();
-  this.multiplyTo(a, r);
-  return r;
+
+    function _next(tasks) {
+        return rest(function (args) {
+            workers -= 1;
+
+            for (var i = 0, l = tasks.length; i < l; i++) {
+                var task = tasks[i];
+                var index = baseIndexOf(workersList, task, 0);
+                if (index >= 0) {
+                    workersList.splice(index);
+                }
+
+                task.callback.apply(task, args);
+
+                if (args[0] != null) {
+                    q.error(args[0], task.data);
+                }
+            }
+
+            if (workers <= q.concurrency - q.buffer) {
+                q.unsaturated();
+            }
+
+            if (q.idle()) {
+                q.drain();
+            }
+            q.process();
+        });
+    }
+
+    var workers = 0;
+    var workersList = [];
+    var q = {
+        _tasks: new DLL(),
+        concurrency: concurrency,
+        payload: payload,
+        saturated: noop,
+        unsaturated: noop,
+        buffer: concurrency / 4,
+        empty: noop,
+        drain: noop,
+        error: noop,
+        started: false,
+        paused: false,
+        push: function (data, callback) {
+            _insert(data, false, callback);
+        },
+        kill: function () {
+            q.drain = noop;
+            q._tasks.empty();
+        },
+        unshift: function (data, callback) {
+            _insert(data, true, callback);
+        },
+        process: function () {
+            while (!q.paused && workers < q.concurrency && q._tasks.length) {
+                var tasks = [],
+                    data = [];
+                var l = q._tasks.length;
+                if (q.payload) l = Math.min(l, q.payload);
+                for (var i = 0; i < l; i++) {
+                    var node = q._tasks.shift();
+                    tasks.push(node);
+                    data.push(node.data);
+                }
+
+                if (q._tasks.length === 0) {
+                    q.empty();
+                }
+                workers += 1;
+                workersList.push(tasks[0]);
+
+                if (workers === q.concurrency) {
+                    q.saturated();
+                }
+
+                var cb = onlyOnce(_next(tasks));
+                worker(data, cb);
+            }
+        },
+        length: function () {
+            return q._tasks.length;
+        },
+        running: function () {
+            return workers;
+        },
+        workersList: function () {
+            return workersList;
+        },
+        idle: function () {
+            return q._tasks.length + workers === 0;
+        },
+        pause: function () {
+            q.paused = true;
+        },
+        resume: function () {
+            if (q.paused === false) {
+                return;
+            }
+            q.paused = false;
+            var resumeCount = Math.min(q.concurrency, q._tasks.length);
+            // Need to call q.process once per concurrent
+            // worker to preserve full concurrency after pause
+            for (var w = 1; w <= resumeCount; w++) {
+                setImmediate$1(q.process);
+            }
+        }
+    };
+    return q;
 }
-// (public) this^2
-function bnSquare()
-{
-  var r = nbi();
-  this.squareTo(r);
-  return r;
+
+/**
+ * A cargo of tasks for the worker function to complete. Cargo inherits all of
+ * the same methods and event callbacks as [`queue`]{@link module:ControlFlow.queue}.
+ * @typedef {Object} CargoObject
+ * @memberOf module:ControlFlow
+ * @property {Function} length - A function returning the number of items
+ * waiting to be processed. Invoke like `cargo.length()`.
+ * @property {number} payload - An `integer` for determining how many tasks
+ * should be process per round. This property can be changed after a `cargo` is
+ * created to alter the payload on-the-fly.
+ * @property {Function} push - Adds `task` to the `queue`. The callback is
+ * called once the `worker` has finished processing the task. Instead of a
+ * single task, an array of `tasks` can be submitted. The respective callback is
+ * used for every task in the list. Invoke like `cargo.push(task, [callback])`.
+ * @property {Function} saturated - A callback that is called when the
+ * `queue.length()` hits the concurrency and further tasks will be queued.
+ * @property {Function} empty - A callback that is called when the last item
+ * from the `queue` is given to a `worker`.
+ * @property {Function} drain - A callback that is called when the last item
+ * from the `queue` has returned from the `worker`.
+ * @property {Function} idle - a function returning false if there are items
+ * waiting or being processed, or true if not. Invoke like `cargo.idle()`.
+ * @property {Function} pause - a function that pauses the processing of tasks
+ * until `resume()` is called. Invoke like `cargo.pause()`.
+ * @property {Function} resume - a function that resumes the processing of
+ * queued tasks when the queue is paused. Invoke like `cargo.resume()`.
+ * @property {Function} kill - a function that removes the `drain` callback and
+ * empties remaining tasks from the queue forcing it to go idle. Invoke like `cargo.kill()`.
+ */
+
+/**
+ * Creates a `cargo` object with the specified payload. Tasks added to the
+ * cargo will be processed altogether (up to the `payload` limit). If the
+ * `worker` is in progress, the task is queued until it becomes available. Once
+ * the `worker` has completed some tasks, each callback of those tasks is
+ * called. Check out [these](https://camo.githubusercontent.com/6bbd36f4cf5b35a0f11a96dcd2e97711ffc2fb37/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130382f62626330636662302d356632392d313165322d393734662d3333393763363464633835382e676966) [animations](https://camo.githubusercontent.com/f4810e00e1c5f5f8addbe3e9f49064fd5d102699/68747470733a2f2f662e636c6f75642e6769746875622e636f6d2f6173736574732f313637363837312f36383130312f38346339323036362d356632392d313165322d383134662d3964336430323431336266642e676966)
+ * for how `cargo` and `queue` work.
+ *
+ * While [`queue`]{@link module:ControlFlow.queue} passes only one task to one of a group of workers
+ * at a time, cargo passes an array of tasks to a single worker, repeating
+ * when the worker is finished.
+ *
+ * @name cargo
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.queue]{@link module:ControlFlow.queue}
+ * @category Control Flow
+ * @param {Function} worker - An asynchronous function for processing an array
+ * of queued tasks, which must call its `callback(err)` argument when finished,
+ * with an optional `err` argument. Invoked with `(tasks, callback)`.
+ * @param {number} [payload=Infinity] - An optional `integer` for determining
+ * how many tasks should be processed per round; if omitted, the default is
+ * unlimited.
+ * @returns {module:ControlFlow.CargoObject} A cargo object to manage the tasks. Callbacks can
+ * attached as certain properties to listen for specific events during the
+ * lifecycle of the cargo and inner queue.
+ * @example
+ *
+ * // create a cargo object with payload 2
+ * var cargo = async.cargo(function(tasks, callback) {
+ *     for (var i=0; i<tasks.length; i++) {
+ *         console.log('hello ' + tasks[i].name);
+ *     }
+ *     callback();
+ * }, 2);
+ *
+ * // add some items
+ * cargo.push({name: 'foo'}, function(err) {
+ *     console.log('finished processing foo');
+ * });
+ * cargo.push({name: 'bar'}, function(err) {
+ *     console.log('finished processing bar');
+ * });
+ * cargo.push({name: 'baz'}, function(err) {
+ *     console.log('finished processing baz');
+ * });
+ */
+function cargo(worker, payload) {
+  return queue(worker, 1, payload);
 }
-// (public) this / a
-function bnDivide(a)
-{
-  var r = nbi();
-  this.divRemTo(a, r, null);
-  return r;
+
+/**
+ * The same as [`eachOf`]{@link module:Collections.eachOf} but runs only a single async operation at a time.
+ *
+ * @name eachOfSeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.eachOf]{@link module:Collections.eachOf}
+ * @alias forEachOfSeries
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each item in `coll`. The
+ * `key` is the item's key, or index in the case of an array. The iteratee is
+ * passed a `callback(err)` which must be called once it has completed. If no
+ * error has occurred, the callback should be run without arguments or with an
+ * explicit `null` argument. Invoked with (item, key, callback).
+ * @param {Function} [callback] - A callback which is called when all `iteratee`
+ * functions have finished, or an error occurs. Invoked with (err).
+ */
+var eachOfSeries = doLimit(eachOfLimit, 1);
+
+/**
+ * Reduces `coll` into a single value using an async `iteratee` to return each
+ * successive step. `memo` is the initial state of the reduction. This function
+ * only operates in series.
+ *
+ * For performance reasons, it may make sense to split a call to this function
+ * into a parallel map, and then use the normal `Array.prototype.reduce` on the
+ * results. This function is for situations where each step in the reduction
+ * needs to be async; if you can get the data before reducing it, then it's
+ * probably a good idea to do so.
+ *
+ * @name reduce
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @alias inject
+ * @alias foldl
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {*} memo - The initial state of the reduction.
+ * @param {Function} iteratee - A function applied to each item in the
+ * array to produce the next step in the reduction. The `iteratee` is passed a
+ * `callback(err, reduction)` which accepts an optional error as its first
+ * argument, and the state of the reduction as the second. If an error is
+ * passed to the callback, the reduction is stopped and the main `callback` is
+ * immediately called with the error. Invoked with (memo, item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Result is the reduced value. Invoked with
+ * (err, result).
+ * @example
+ *
+ * async.reduce([1,2,3], 0, function(memo, item, callback) {
+ *     // pointless async:
+ *     process.nextTick(function() {
+ *         callback(null, memo + item)
+ *     });
+ * }, function(err, result) {
+ *     // result is now equal to the last value of memo, which is 6
+ * });
+ */
+function reduce(coll, memo, iteratee, callback) {
+    callback = once(callback || noop);
+    eachOfSeries(coll, function (x, i, callback) {
+        iteratee(memo, x, function (err, v) {
+            memo = v;
+            callback(err);
+        });
+    }, function (err) {
+        callback(err, memo);
+    });
 }
-// (public) this % a
-function bnRemainder(a)
-{
-  var r = nbi();
-  this.divRemTo(a, null, r);
-  return r;
+
+/**
+ * Version of the compose function that is more natural to read. Each function
+ * consumes the return value of the previous function. It is the equivalent of
+ * [compose]{@link module:ControlFlow.compose} with the arguments reversed.
+ *
+ * Each function is executed with the `this` binding of the composed function.
+ *
+ * @name seq
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.compose]{@link module:ControlFlow.compose}
+ * @category Control Flow
+ * @param {...Function} functions - the asynchronous functions to compose
+ * @returns {Function} a function that composes the `functions` in order
+ * @example
+ *
+ * // Requires lodash (or underscore), express3 and dresende's orm2.
+ * // Part of an app, that fetches cats of the logged user.
+ * // This example uses `seq` function to avoid overnesting and error
+ * // handling clutter.
+ * app.get('/cats', function(request, response) {
+ *     var User = request.models.User;
+ *     async.seq(
+ *         _.bind(User.get, User),  // 'User.get' has signature (id, callback(err, data))
+ *         function(user, fn) {
+ *             user.getCats(fn);      // 'getCats' has signature (callback(err, data))
+ *         }
+ *     )(req.session.user_id, function (err, cats) {
+ *         if (err) {
+ *             console.error(err);
+ *             response.json({ status: 'error', message: err.message });
+ *         } else {
+ *             response.json({ status: 'ok', message: 'Cats found', data: cats });
+ *         }
+ *     });
+ * });
+ */
+var seq$1 = rest(function seq(functions) {
+    return rest(function (args) {
+        var that = this;
+
+        var cb = args[args.length - 1];
+        if (typeof cb == 'function') {
+            args.pop();
+        } else {
+            cb = noop;
+        }
+
+        reduce(functions, args, function (newargs, fn, cb) {
+            fn.apply(that, newargs.concat([rest(function (err, nextargs) {
+                cb(err, nextargs);
+            })]));
+        }, function (err, results) {
+            cb.apply(that, [err].concat(results));
+        });
+    });
+});
+
+/**
+ * Creates a function which is a composition of the passed asynchronous
+ * functions. Each function consumes the return value of the function that
+ * follows. Composing functions `f()`, `g()`, and `h()` would produce the result
+ * of `f(g(h()))`, only this version uses callbacks to obtain the return values.
+ *
+ * Each function is executed with the `this` binding of the composed function.
+ *
+ * @name compose
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {...Function} functions - the asynchronous functions to compose
+ * @returns {Function} an asynchronous function that is the composed
+ * asynchronous `functions`
+ * @example
+ *
+ * function add1(n, callback) {
+ *     setTimeout(function () {
+ *         callback(null, n + 1);
+ *     }, 10);
+ * }
+ *
+ * function mul3(n, callback) {
+ *     setTimeout(function () {
+ *         callback(null, n * 3);
+ *     }, 10);
+ * }
+ *
+ * var add1mul3 = async.compose(mul3, add1);
+ * add1mul3(4, function (err, result) {
+ *     // result now equals 15
+ * });
+ */
+var compose = rest(function (args) {
+  return seq$1.apply(null, args.reverse());
+});
+
+function concat$1(eachfn, arr, fn, callback) {
+    var result = [];
+    eachfn(arr, function (x, index, cb) {
+        fn(x, function (err, y) {
+            result = result.concat(y || []);
+            cb(err);
+        });
+    }, function (err) {
+        callback(err, result);
+    });
 }
-// (public) [this/a,this%a]
-function bnDivideAndRemainder(a)
-{
-  var q = nbi(),
-    r = nbi();
-  this.divRemTo(a, q, r);
-  return new Array(q, r);
+
+/**
+ * Applies `iteratee` to each item in `coll`, concatenating the results. Returns
+ * the concatenated list. The `iteratee`s are called in parallel, and the
+ * results are concatenated as they return. There is no guarantee that the
+ * results array will be returned in the original order of `coll` passed to the
+ * `iteratee` function.
+ *
+ * @name concat
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each item in `coll`.
+ * The iteratee is passed a `callback(err, results)` which must be called once
+ * it has completed with an error (which can be `null`) and an array of results.
+ * Invoked with (item, callback).
+ * @param {Function} [callback(err)] - A callback which is called after all the
+ * `iteratee` functions have finished, or an error occurs. Results is an array
+ * containing the concatenated results of the `iteratee` function. Invoked with
+ * (err, results).
+ * @example
+ *
+ * async.concat(['dir1','dir2','dir3'], fs.readdir, function(err, files) {
+ *     // files is now a list of filenames that exist in the 3 directories
+ * });
+ */
+var concat = doParallel(concat$1);
+
+function doSeries(fn) {
+    return function (obj, iteratee, callback) {
+        return fn(eachOfSeries, obj, iteratee, callback);
+    };
 }
-// (protected) this *= n, this >= 0, 1 < n < DV
-function bnpDMultiply(n)
-{
-  this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);
-  ++this.t;
-  this.clamp();
+
+/**
+ * The same as [`concat`]{@link module:Collections.concat} but runs only a single async operation at a time.
+ *
+ * @name concatSeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.concat]{@link module:Collections.concat}
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each item in `coll`.
+ * The iteratee is passed a `callback(err, results)` which must be called once
+ * it has completed with an error (which can be `null`) and an array of results.
+ * Invoked with (item, callback).
+ * @param {Function} [callback(err)] - A callback which is called after all the
+ * `iteratee` functions have finished, or an error occurs. Results is an array
+ * containing the concatenated results of the `iteratee` function. Invoked with
+ * (err, results).
+ */
+var concatSeries = doSeries(concat$1);
+
+/**
+ * Returns a function that when called, calls-back with the values provided.
+ * Useful as the first function in a [`waterfall`]{@link module:ControlFlow.waterfall}, or for plugging values in to
+ * [`auto`]{@link module:ControlFlow.auto}.
+ *
+ * @name constant
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @category Util
+ * @param {...*} arguments... - Any number of arguments to automatically invoke
+ * callback with.
+ * @returns {Function} Returns a function that when invoked, automatically
+ * invokes the callback with the previous given arguments.
+ * @example
+ *
+ * async.waterfall([
+ *     async.constant(42),
+ *     function (value, next) {
+ *         // value === 42
+ *     },
+ *     //...
+ * ], callback);
+ *
+ * async.waterfall([
+ *     async.constant(filename, "utf8"),
+ *     fs.readFile,
+ *     function (fileData, next) {
+ *         //...
+ *     }
+ *     //...
+ * ], callback);
+ *
+ * async.auto({
+ *     hostname: async.constant("https://server.net/"),
+ *     port: findFreePort,
+ *     launchServer: ["hostname", "port", function (options, cb) {
+ *         startServer(options, cb);
+ *     }],
+ *     //...
+ * }, callback);
+ */
+var constant = rest(function (values) {
+    var args = [null].concat(values);
+    return initialParams(function (ignoredArgs, callback) {
+        return callback.apply(this, args);
+    });
+});
+
+function _createTester(eachfn, check, getResult) {
+    return function (arr, limit, iteratee, cb) {
+        function done() {
+            if (cb) {
+                cb(null, getResult(false));
+            }
+        }
+        function wrappedIteratee(x, _, callback) {
+            if (!cb) return callback();
+            iteratee(x, function (err, v) {
+                // Check cb as another iteratee may have resolved with a
+                // value or error since we started this iteratee
+                if (cb && (err || check(v))) {
+                    if (err) cb(err);else cb(err, getResult(true, x));
+                    cb = iteratee = false;
+                    callback(err, breakLoop);
+                } else {
+                    callback();
+                }
+            });
+        }
+        if (arguments.length > 3) {
+            cb = cb || noop;
+            eachfn(arr, limit, wrappedIteratee, done);
+        } else {
+            cb = iteratee;
+            cb = cb || noop;
+            iteratee = limit;
+            eachfn(arr, wrappedIteratee, done);
+        }
+    };
 }
-// (protected) this += n << w words, this >= 0
-function bnpDAddOffset(n, w)
-{
-  if (n == 0) return;
-  while (this.t <= w) this[this.t++] = 0;
-  this[w] += n;
-  while (this[w] >= this.DV)
-  {
-    this[w] -= this.DV;
-    if (++w >= this.t) this[this.t++] = 0;
-    ++this[w];
-  }
+
+function _findGetResult(v, x) {
+    return x;
 }
-// A "null" reducer
-function NullExp()
-{}
 
-function nNop(x)
-{
-  return x;
+/**
+ * Returns the first value in `coll` that passes an async truth test. The
+ * `iteratee` is applied in parallel, meaning the first iteratee to return
+ * `true` will fire the detect `callback` with that result. That means the
+ * result might not be the first item in the original `coll` (in terms of order)
+ * that passes the test.
+
+ * If order within the original `coll` is important, then look at
+ * [`detectSeries`]{@link module:Collections.detectSeries}.
+ *
+ * @name detect
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @alias find
+ * @category Collections
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in `coll`.
+ * The iteratee is passed a `callback(err, truthValue)` which must be called
+ * with a boolean argument once it has completed. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called as soon as any
+ * iteratee returns `true`, or after all the `iteratee` functions have finished.
+ * Result will be the first item in the array that passes the truth test
+ * (iteratee) or the value `undefined` if none passed. Invoked with
+ * (err, result).
+ * @example
+ *
+ * async.detect(['file1','file2','file3'], function(filePath, callback) {
+ *     fs.access(filePath, function(err) {
+ *         callback(null, !err)
+ *     });
+ * }, function(err, result) {
+ *     // result now equals the first file in the list that exists
+ * });
+ */
+var detect = _createTester(eachOf, identity, _findGetResult);
+
+/**
+ * The same as [`detect`]{@link module:Collections.detect} but runs a maximum of `limit` async operations at a
+ * time.
+ *
+ * @name detectLimit
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.detect]{@link module:Collections.detect}
+ * @alias findLimit
+ * @category Collections
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - A truth test to apply to each item in `coll`.
+ * The iteratee is passed a `callback(err, truthValue)` which must be called
+ * with a boolean argument once it has completed. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called as soon as any
+ * iteratee returns `true`, or after all the `iteratee` functions have finished.
+ * Result will be the first item in the array that passes the truth test
+ * (iteratee) or the value `undefined` if none passed. Invoked with
+ * (err, result).
+ */
+var detectLimit = _createTester(eachOfLimit, identity, _findGetResult);
+
+/**
+ * The same as [`detect`]{@link module:Collections.detect} but runs only a single async operation at a time.
+ *
+ * @name detectSeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.detect]{@link module:Collections.detect}
+ * @alias findSeries
+ * @category Collections
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in `coll`.
+ * The iteratee is passed a `callback(err, truthValue)` which must be called
+ * with a boolean argument once it has completed. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called as soon as any
+ * iteratee returns `true`, or after all the `iteratee` functions have finished.
+ * Result will be the first item in the array that passes the truth test
+ * (iteratee) or the value `undefined` if none passed. Invoked with
+ * (err, result).
+ */
+var detectSeries = _createTester(eachOfSeries, identity, _findGetResult);
+
+function consoleFunc(name) {
+    return rest(function (fn, args) {
+        fn.apply(null, args.concat([rest(function (err, args) {
+            if (typeof console === 'object') {
+                if (err) {
+                    if (console.error) {
+                        console.error(err);
+                    }
+                } else if (console[name]) {
+                    arrayEach(args, function (x) {
+                        console[name](x);
+                    });
+                }
+            }
+        })]));
+    });
 }
 
-function nMulTo(x, y, r)
-{
-  x.multiplyTo(y, r);
+/**
+ * Logs the result of an `async` function to the `console` using `console.dir`
+ * to display the properties of the resulting object. Only works in Node.js or
+ * in browsers that support `console.dir` and `console.error` (such as FF and
+ * Chrome). If multiple arguments are returned from the async function,
+ * `console.dir` is called on each argument in order.
+ *
+ * @name dir
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @category Util
+ * @param {Function} function - The function you want to eventually apply all
+ * arguments to.
+ * @param {...*} arguments... - Any number of arguments to apply to the function.
+ * @example
+ *
+ * // in a module
+ * var hello = function(name, callback) {
+ *     setTimeout(function() {
+ *         callback(null, {hello: name});
+ *     }, 1000);
+ * };
+ *
+ * // in the node repl
+ * node> async.dir(hello, 'world');
+ * {hello: 'world'}
+ */
+var dir = consoleFunc('dir');
+
+/**
+ * The post-check version of [`during`]{@link module:ControlFlow.during}. To reflect the difference in
+ * the order of operations, the arguments `test` and `fn` are switched.
+ *
+ * Also a version of [`doWhilst`]{@link module:ControlFlow.doWhilst} with asynchronous `test` function.
+ * @name doDuring
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.during]{@link module:ControlFlow.during}
+ * @category Control Flow
+ * @param {Function} fn - A function which is called each time `test` passes.
+ * The function is passed a `callback(err)`, which must be called once it has
+ * completed with an optional `err` argument. Invoked with (callback).
+ * @param {Function} test - asynchronous truth test to perform before each
+ * execution of `fn`. Invoked with (...args, callback), where `...args` are the
+ * non-error args from the previous callback of `fn`.
+ * @param {Function} [callback] - A callback which is called after the test
+ * function has failed and repeated execution of `fn` has stopped. `callback`
+ * will be passed an error if one occured, otherwise `null`.
+ */
+function doDuring(fn, test, callback) {
+    callback = onlyOnce(callback || noop);
+
+    var next = rest(function (err, args) {
+        if (err) return callback(err);
+        args.push(check);
+        test.apply(this, args);
+    });
+
+    function check(err, truth) {
+        if (err) return callback(err);
+        if (!truth) return callback(null);
+        fn(next);
+    }
+
+    check(null, true);
 }
 
-function nSqrTo(x, r)
-{
-  x.squareTo(r);
+/**
+ * The post-check version of [`whilst`]{@link module:ControlFlow.whilst}. To reflect the difference in
+ * the order of operations, the arguments `test` and `iteratee` are switched.
+ *
+ * `doWhilst` is to `whilst` as `do while` is to `while` in plain JavaScript.
+ *
+ * @name doWhilst
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.whilst]{@link module:ControlFlow.whilst}
+ * @category Control Flow
+ * @param {Function} iteratee - A function which is called each time `test`
+ * passes. The function is passed a `callback(err)`, which must be called once
+ * it has completed with an optional `err` argument. Invoked with (callback).
+ * @param {Function} test - synchronous truth test to perform after each
+ * execution of `iteratee`. Invoked with the non-error callback results of 
+ * `iteratee`.
+ * @param {Function} [callback] - A callback which is called after the test
+ * function has failed and repeated execution of `iteratee` has stopped.
+ * `callback` will be passed an error and any arguments passed to the final
+ * `iteratee`'s callback. Invoked with (err, [results]);
+ */
+function doWhilst(iteratee, test, callback) {
+    callback = onlyOnce(callback || noop);
+    var next = rest(function (err, args) {
+        if (err) return callback(err);
+        if (test.apply(this, args)) return iteratee(next);
+        callback.apply(null, [null].concat(args));
+    });
+    iteratee(next);
 }
-NullExp.prototype.convert = nNop;
-NullExp.prototype.revert = nNop;
-NullExp.prototype.mulTo = nMulTo;
-NullExp.prototype.sqrTo = nSqrTo;
-// (public) this^e
-function bnPow(e)
-{
-  return this.exp(e, new NullExp());
+
+/**
+ * Like ['doWhilst']{@link module:ControlFlow.doWhilst}, except the `test` is inverted. Note the
+ * argument ordering differs from `until`.
+ *
+ * @name doUntil
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.doWhilst]{@link module:ControlFlow.doWhilst}
+ * @category Control Flow
+ * @param {Function} fn - A function which is called each time `test` fails.
+ * The function is passed a `callback(err)`, which must be called once it has
+ * completed with an optional `err` argument. Invoked with (callback).
+ * @param {Function} test - synchronous truth test to perform after each
+ * execution of `fn`. Invoked with the non-error callback results of `fn`.
+ * @param {Function} [callback] - A callback which is called after the test
+ * function has passed and repeated execution of `fn` has stopped. `callback`
+ * will be passed an error and any arguments passed to the final `fn`'s
+ * callback. Invoked with (err, [results]);
+ */
+function doUntil(fn, test, callback) {
+    doWhilst(fn, function () {
+        return !test.apply(this, arguments);
+    }, callback);
 }
-// (protected) r = lower n words of "this * a", a.t <= n
-// "this" should be the larger one if appropriate.
-function bnpMultiplyLowerTo(a, n, r)
-{
-  var i = Math.min(this.t + a.t, n);
-  r.s = 0; // assumes a,this >= 0
-  r.t = i;
-  while (i > 0) r[--i] = 0;
-  var j;
-  for (j = r.t - this.t; i < j; ++i) r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
-  for (j = Math.min(a.t, n); i < j; ++i) this.am(0, a[i], r, i, 0, n - i);
-  r.clamp();
+
+/**
+ * Like [`whilst`]{@link module:ControlFlow.whilst}, except the `test` is an asynchronous function that
+ * is passed a callback in the form of `function (err, truth)`. If error is
+ * passed to `test` or `fn`, the main callback is immediately called with the
+ * value of the error.
+ *
+ * @name during
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.whilst]{@link module:ControlFlow.whilst}
+ * @category Control Flow
+ * @param {Function} test - asynchronous truth test to perform before each
+ * execution of `fn`. Invoked with (callback).
+ * @param {Function} fn - A function which is called each time `test` passes.
+ * The function is passed a `callback(err)`, which must be called once it has
+ * completed with an optional `err` argument. Invoked with (callback).
+ * @param {Function} [callback] - A callback which is called after the test
+ * function has failed and repeated execution of `fn` has stopped. `callback`
+ * will be passed an error, if one occured, otherwise `null`.
+ * @example
+ *
+ * var count = 0;
+ *
+ * async.during(
+ *     function (callback) {
+ *         return callback(null, count < 5);
+ *     },
+ *     function (callback) {
+ *         count++;
+ *         setTimeout(callback, 1000);
+ *     },
+ *     function (err) {
+ *         // 5 seconds have passed
+ *     }
+ * );
+ */
+function during(test, fn, callback) {
+    callback = onlyOnce(callback || noop);
+
+    function next(err) {
+        if (err) return callback(err);
+        test(check);
+    }
+
+    function check(err, truth) {
+        if (err) return callback(err);
+        if (!truth) return callback(null);
+        fn(next);
+    }
+
+    test(check);
 }
-// (protected) r = "this * a" without lower n words, n > 0
-// "this" should be the larger one if appropriate.
-function bnpMultiplyUpperTo(a, n, r)
-{
-  --n;
-  var i = r.t = this.t + a.t - n;
-  r.s = 0; // assumes a,this >= 0
-  while (--i >= 0) r[i] = 0;
-  for (i = Math.max(n - this.t, 0); i < a.t; ++i)
-    r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);
-  r.clamp();
-  r.drShiftTo(1, r);
+
+function _withoutIndex(iteratee) {
+    return function (value, index, callback) {
+        return iteratee(value, callback);
+    };
 }
-// Barrett modular reduction
-function Barrett(m)
-{
-  // setup Barrett
-  this.r2 = nbi();
-  this.q3 = nbi();
-  BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);
-  this.mu = this.r2.divide(m);
-  this.m = m;
+
+/**
+ * Applies the function `iteratee` to each item in `coll`, in parallel.
+ * The `iteratee` is called with an item from the list, and a callback for when
+ * it has finished. If the `iteratee` passes an error to its `callback`, the
+ * main `callback` (for the `each` function) is immediately called with the
+ * error.
+ *
+ * Note, that since this function applies `iteratee` to each item in parallel,
+ * there is no guarantee that the iteratee functions will complete in order.
+ *
+ * @name each
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @alias forEach
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each item
+ * in `coll`. The iteratee is passed a `callback(err)` which must be called once
+ * it has completed. If no error has occurred, the `callback` should be run
+ * without arguments or with an explicit `null` argument. The array index is not
+ * passed to the iteratee. Invoked with (item, callback). If you need the index,
+ * use `eachOf`.
+ * @param {Function} [callback] - A callback which is called when all
+ * `iteratee` functions have finished, or an error occurs. Invoked with (err).
+ * @example
+ *
+ * // assuming openFiles is an array of file names and saveFile is a function
+ * // to save the modified contents of that file:
+ *
+ * async.each(openFiles, saveFile, function(err){
+ *   // if any of the saves produced an error, err would equal that error
+ * });
+ *
+ * // assuming openFiles is an array of file names
+ * async.each(openFiles, function(file, callback) {
+ *
+ *     // Perform operation on file here.
+ *     console.log('Processing file ' + file);
+ *
+ *     if( file.length > 32 ) {
+ *       console.log('This file name is too long');
+ *       callback('File name too long');
+ *     } else {
+ *       // Do work to process file here
+ *       console.log('File processed');
+ *       callback();
+ *     }
+ * }, function(err) {
+ *     // if any of the file processing produced an error, err would equal that error
+ *     if( err ) {
+ *       // One of the iterations produced an error.
+ *       // All processing will now stop.
+ *       console.log('A file failed to process');
+ *     } else {
+ *       console.log('All files have been processed successfully');
+ *     }
+ * });
+ */
+function eachLimit(coll, iteratee, callback) {
+  eachOf(coll, _withoutIndex(iteratee), callback);
 }
 
-function barrettConvert(x)
-{
-  if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);
-  else if (x.compareTo(this.m) < 0) return x;
-  else
-  {
-    var r = nbi();
-    x.copyTo(r);
-    this.reduce(r);
-    return r;
-  }
+/**
+ * The same as [`each`]{@link module:Collections.each} but runs a maximum of `limit` async operations at a time.
+ *
+ * @name eachLimit
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.each]{@link module:Collections.each}
+ * @alias forEachLimit
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - A function to apply to each item in `coll`. The
+ * iteratee is passed a `callback(err)` which must be called once it has
+ * completed. If no error has occurred, the `callback` should be run without
+ * arguments or with an explicit `null` argument. The array index is not passed
+ * to the iteratee. Invoked with (item, callback). If you need the index, use
+ * `eachOfLimit`.
+ * @param {Function} [callback] - A callback which is called when all
+ * `iteratee` functions have finished, or an error occurs. Invoked with (err).
+ */
+function eachLimit$1(coll, limit, iteratee, callback) {
+  _eachOfLimit(limit)(coll, _withoutIndex(iteratee), callback);
 }
 
-function barrettRevert(x)
-{
-  return x;
+/**
+ * The same as [`each`]{@link module:Collections.each} but runs only a single async operation at a time.
+ *
+ * @name eachSeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.each]{@link module:Collections.each}
+ * @alias forEachSeries
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each
+ * item in `coll`. The iteratee is passed a `callback(err)` which must be called
+ * once it has completed. If no error has occurred, the `callback` should be run
+ * without arguments or with an explicit `null` argument. The array index is
+ * not passed to the iteratee. Invoked with (item, callback). If you need the
+ * index, use `eachOfSeries`.
+ * @param {Function} [callback] - A callback which is called when all
+ * `iteratee` functions have finished, or an error occurs. Invoked with (err).
+ */
+var eachSeries = doLimit(eachLimit$1, 1);
+
+/**
+ * Wrap an async function and ensure it calls its callback on a later tick of
+ * the event loop.  If the function already calls its callback on a next tick,
+ * no extra deferral is added. This is useful for preventing stack overflows
+ * (`RangeError: Maximum call stack size exceeded`) and generally keeping
+ * [Zalgo](http://blog.izs.me/post/59142742143/designing-apis-for-asynchrony)
+ * contained.
+ *
+ * @name ensureAsync
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @category Util
+ * @param {Function} fn - an async function, one that expects a node-style
+ * callback as its last argument.
+ * @returns {Function} Returns a wrapped function with the exact same call
+ * signature as the function passed in.
+ * @example
+ *
+ * function sometimesAsync(arg, callback) {
+ *     if (cache[arg]) {
+ *         return callback(null, cache[arg]); // this would be synchronous!!
+ *     } else {
+ *         doSomeIO(arg, callback); // this IO would be asynchronous
+ *     }
+ * }
+ *
+ * // this has a risk of stack overflows if many results are cached in a row
+ * async.mapSeries(args, sometimesAsync, done);
+ *
+ * // this will defer sometimesAsync's callback if necessary,
+ * // preventing stack overflows
+ * async.mapSeries(args, async.ensureAsync(sometimesAsync), done);
+ */
+function ensureAsync(fn) {
+    return initialParams(function (args, callback) {
+        var sync = true;
+        args.push(function () {
+            var innerArgs = arguments;
+            if (sync) {
+                setImmediate$1(function () {
+                    callback.apply(null, innerArgs);
+                });
+            } else {
+                callback.apply(null, innerArgs);
+            }
+        });
+        fn.apply(this, args);
+        sync = false;
+    });
 }
-// x = x mod m (HAC 14.42)
-function barrettReduce(x)
-{
-  x.drShiftTo(this.m.t - 1, this.r2);
-  if (x.t > this.m.t + 1)
-  {
-    x.t = this.m.t + 1;
-    x.clamp();
-  }
-  this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);
-  this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);
-  while (x.compareTo(this.r2) < 0) x.dAddOffset(1, this.m.t + 1);
-  x.subTo(this.r2, x);
-  while (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
+
+function notId(v) {
+    return !v;
 }
-// r = x^2 mod m; x != r
-function barrettSqrTo(x, r)
-{
-  x.squareTo(r);
-  this.reduce(r);
+
+/**
+ * Returns `true` if every element in `coll` satisfies an async test. If any
+ * iteratee call returns `false`, the main `callback` is immediately called.
+ *
+ * @name every
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @alias all
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in the
+ * collection in parallel. The iteratee is passed a `callback(err, truthValue)`
+ * which must be called with a  boolean argument once it has completed. Invoked
+ * with (item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Result will be either `true` or `false`
+ * depending on the values of the async tests. Invoked with (err, result).
+ * @example
+ *
+ * async.every(['file1','file2','file3'], function(filePath, callback) {
+ *     fs.access(filePath, function(err) {
+ *         callback(null, !err)
+ *     });
+ * }, function(err, result) {
+ *     // if result is true then every file exists
+ * });
+ */
+var every = _createTester(eachOf, notId, notId);
+
+/**
+ * The same as [`every`]{@link module:Collections.every} but runs a maximum of `limit` async operations at a time.
+ *
+ * @name everyLimit
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.every]{@link module:Collections.every}
+ * @alias allLimit
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - A truth test to apply to each item in the
+ * collection in parallel. The iteratee is passed a `callback(err, truthValue)`
+ * which must be called with a  boolean argument once it has completed. Invoked
+ * with (item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Result will be either `true` or `false`
+ * depending on the values of the async tests. Invoked with (err, result).
+ */
+var everyLimit = _createTester(eachOfLimit, notId, notId);
+
+/**
+ * The same as [`every`]{@link module:Collections.every} but runs only a single async operation at a time.
+ *
+ * @name everySeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.every]{@link module:Collections.every}
+ * @alias allSeries
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in the
+ * collection in parallel. The iteratee is passed a `callback(err, truthValue)`
+ * which must be called with a  boolean argument once it has completed. Invoked
+ * with (item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Result will be either `true` or `false`
+ * depending on the values of the async tests. Invoked with (err, result).
+ */
+var everySeries = doLimit(everyLimit, 1);
+
+/**
+ * The base implementation of `_.property` without support for deep paths.
+ *
+ * @private
+ * @param {string} key The key of the property to get.
+ * @returns {Function} Returns the new accessor function.
+ */
+function baseProperty(key) {
+  return function(object) {
+    return object == null ? undefined : object[key];
+  };
 }
-// r = x*y mod m; x,y != r
-function barrettMulTo(x, y, r)
-{
-  x.multiplyTo(y, r);
-  this.reduce(r);
+
+function filterArray(eachfn, arr, iteratee, callback) {
+    var truthValues = new Array(arr.length);
+    eachfn(arr, function (x, index, callback) {
+        iteratee(x, function (err, v) {
+            truthValues[index] = !!v;
+            callback(err);
+        });
+    }, function (err) {
+        if (err) return callback(err);
+        var results = [];
+        for (var i = 0; i < arr.length; i++) {
+            if (truthValues[i]) results.push(arr[i]);
+        }
+        callback(null, results);
+    });
 }
-Barrett.prototype.convert = barrettConvert;
-Barrett.prototype.revert = barrettRevert;
-Barrett.prototype.reduce = barrettReduce;
-Barrett.prototype.mulTo = barrettMulTo;
-Barrett.prototype.sqrTo = barrettSqrTo;
-// (public) this^e % m (HAC 14.85)
-function bnModPow(e, m)
-{
-  var i = e.bitLength(),
-    k, r = nbv(1),
-    z;
-  if (i <= 0) return r;
-  else if (i < 18) k = 1;
-  else if (i < 48) k = 3;
-  else if (i < 144) k = 4;
-  else if (i < 768) k = 5;
-  else k = 6;
-  if (i < 8)
-    z = new Classic(m);
-  else if (m.isEven())
-    z = new Barrett(m);
-  else
-    z = new Montgomery(m);
-  // precomputation
-  var g = new Array(),
-    n = 3,
-    k1 = k - 1,
-    km = (1 << k) - 1;
-  g[1] = z.convert(this);
-  if (k > 1)
-  {
-    var g2 = nbi();
-    z.sqrTo(g[1], g2);
-    while (n <= km)
-    {
-      g[n] = nbi();
-      z.mulTo(g2, g[n - 2], g[n]);
-      n += 2;
-    }
-  }
-  var j = e.t - 1,
-    w, is1 = true,
-    r2 = nbi(),
-    t;
-  i = nbits(e[j]) - 1;
-  while (j >= 0)
-  {
-    if (i >= k1) w = (e[j] >> (i - k1)) & km;
-    else
-    {
-      w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);
-      if (j > 0) w |= e[j - 1] >> (this.DB + i - k1);
-    }
-    n = k;
-    while ((w & 1) == 0)
-    {
-      w >>= 1;
-      --n;
-    }
-    if ((i -= n) < 0)
-    {
-      i += this.DB;
-      --j;
-    }
-    if (is1)
-    { // ret == 1, don't bother squaring or multiplying it
-      g[w].copyTo(r);
-      is1 = false;
-    }
-    else
-    {
-      while (n > 1)
-      {
-        z.sqrTo(r, r2);
-        z.sqrTo(r2, r);
-        n -= 2;
-      }
-      if (n > 0) z.sqrTo(r, r2);
-      else
-      {
-        t = r;
-        r = r2;
-        r2 = t;
-      }
-      z.mulTo(r2, g[w], r);
-    }
-    while (j >= 0 && (e[j] & (1 << i)) == 0)
-    {
-      z.sqrTo(r, r2);
-      t = r;
-      r = r2;
-      r2 = t;
-      if (--i < 0)
-      {
-        i = this.DB - 1;
-        --j;
-      }
-    }
-  }
-  return z.revert(r);
+
+function filterGeneric(eachfn, coll, iteratee, callback) {
+    var results = [];
+    eachfn(coll, function (x, index, callback) {
+        iteratee(x, function (err, v) {
+            if (err) {
+                callback(err);
+            } else {
+                if (v) {
+                    results.push({ index: index, value: x });
+                }
+                callback();
+            }
+        });
+    }, function (err) {
+        if (err) {
+            callback(err);
+        } else {
+            callback(null, arrayMap(results.sort(function (a, b) {
+                return a.index - b.index;
+            }), baseProperty('value')));
+        }
+    });
 }
-// (public) gcd(this,a) (HAC 14.54)
-function bnGCD(a)
-{
-  var x = (this.s < 0) ? this.negate() : this.clone();
-  var y = (a.s < 0) ? a.negate() : a.clone();
-  if (x.compareTo(y) < 0)
-  {
-    var t = x;
-    x = y;
-    y = t;
-  }
-  var i = x.getLowestSetBit(),
-    g = y.getLowestSetBit();
-  if (g < 0) return x;
-  if (i < g) g = i;
-  if (g > 0)
-  {
-    x.rShiftTo(g, x);
-    y.rShiftTo(g, y);
-  }
-  while (x.signum() > 0)
-  {
-    if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x);
-    if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y);
-    if (x.compareTo(y) >= 0)
-    {
-      x.subTo(y, x);
-      x.rShiftTo(1, x);
-    }
-    else
-    {
-      y.subTo(x, y);
-      y.rShiftTo(1, y);
+
+function _filter(eachfn, coll, iteratee, callback) {
+    var filter = isArrayLike(coll) ? filterArray : filterGeneric;
+    filter(eachfn, coll, iteratee, callback || noop);
+}
+
+/**
+ * Returns a new array of all the values in `coll` which pass an async truth
+ * test. This operation is performed in parallel, but the results array will be
+ * in the same order as the original.
+ *
+ * @name filter
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @alias select
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in `coll`.
+ * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
+ * with a boolean argument once it has completed. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Invoked with (err, results).
+ * @example
+ *
+ * async.filter(['file1','file2','file3'], function(filePath, callback) {
+ *     fs.access(filePath, function(err) {
+ *         callback(null, !err)
+ *     });
+ * }, function(err, results) {
+ *     // results now equals an array of the existing files
+ * });
+ */
+var filter = doParallel(_filter);
+
+/**
+ * The same as [`filter`]{@link module:Collections.filter} but runs a maximum of `limit` async operations at a
+ * time.
+ *
+ * @name filterLimit
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.filter]{@link module:Collections.filter}
+ * @alias selectLimit
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - A truth test to apply to each item in `coll`.
+ * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
+ * with a boolean argument once it has completed. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Invoked with (err, results).
+ */
+var filterLimit = doParallelLimit(_filter);
+
+/**
+ * The same as [`filter`]{@link module:Collections.filter} but runs only a single async operation at a time.
+ *
+ * @name filterSeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.filter]{@link module:Collections.filter}
+ * @alias selectSeries
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in `coll`.
+ * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
+ * with a boolean argument once it has completed. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Invoked with (err, results)
+ */
+var filterSeries = doLimit(filterLimit, 1);
+
+/**
+ * Calls the asynchronous function `fn` with a callback parameter that allows it
+ * to call itself again, in series, indefinitely.
+
+ * If an error is passed to the
+ * callback then `errback` is called with the error, and execution stops,
+ * otherwise it will never be called.
+ *
+ * @name forever
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Function} fn - a function to call repeatedly. Invoked with (next).
+ * @param {Function} [errback] - when `fn` passes an error to it's callback,
+ * this function will be called, and execution stops. Invoked with (err).
+ * @example
+ *
+ * async.forever(
+ *     function(next) {
+ *         // next is suitable for passing to things that need a callback(err [, whatever]);
+ *         // it will result in this function being called again.
+ *     },
+ *     function(err) {
+ *         // if next is called with a value in its first parameter, it will appear
+ *         // in here as 'err', and execution will stop.
+ *     }
+ * );
+ */
+function forever(fn, errback) {
+    var done = onlyOnce(errback || noop);
+    var task = ensureAsync(fn);
+
+    function next(err) {
+        if (err) return done(err);
+        task(next);
     }
-  }
-  if (g > 0) y.lShiftTo(g, y);
-  return y;
+    next();
 }
-// (protected) this % n, n < 2^26
-function bnpModInt(n)
-{
-  if (n <= 0) return 0;
-  var d = this.DV % n,
-    r = (this.s < 0) ? n - 1 : 0;
-  if (this.t > 0)
-    if (d == 0) r = this[0] % n;
-    else
-      for (var i = this.t - 1; i >= 0; --i) r = (d * r + this[i]) % n;
-  return r;
+
+/**
+ * Logs the result of an `async` function to the `console`. Only works in
+ * Node.js or in browsers that support `console.log` and `console.error` (such
+ * as FF and Chrome). If multiple arguments are returned from the async
+ * function, `console.log` is called on each argument in order.
+ *
+ * @name log
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @category Util
+ * @param {Function} function - The function you want to eventually apply all
+ * arguments to.
+ * @param {...*} arguments... - Any number of arguments to apply to the function.
+ * @example
+ *
+ * // in a module
+ * var hello = function(name, callback) {
+ *     setTimeout(function() {
+ *         callback(null, 'hello ' + name);
+ *     }, 1000);
+ * };
+ *
+ * // in the node repl
+ * node> async.log(hello, 'world');
+ * 'hello world'
+ */
+var log = consoleFunc('log');
+
+/**
+ * The same as [`mapValues`]{@link module:Collections.mapValues} but runs a maximum of `limit` async operations at a
+ * time.
+ *
+ * @name mapValuesLimit
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.mapValues]{@link module:Collections.mapValues}
+ * @category Collection
+ * @param {Object} obj - A collection to iterate over.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - A function to apply to each value in `obj`.
+ * The iteratee is passed a `callback(err, transformed)` which must be called
+ * once it has completed with an error (which can be `null`) and a
+ * transformed value. Invoked with (value, key, callback).
+ * @param {Function} [callback] - A callback which is called when all `iteratee`
+ * functions have finished, or an error occurs. `result` is a new object consisting
+ * of each key from `obj`, with each transformed value on the right-hand side.
+ * Invoked with (err, result).
+ */
+function mapValuesLimit(obj, limit, iteratee, callback) {
+    callback = once(callback || noop);
+    var newObj = {};
+    eachOfLimit(obj, limit, function (val, key, next) {
+        iteratee(val, key, function (err, result) {
+            if (err) return next(err);
+            newObj[key] = result;
+            next();
+        });
+    }, function (err) {
+        callback(err, newObj);
+    });
 }
-// (public) 1/this % m (HAC 14.61)
-function bnModInverse(m)
-{
-  var ac = m.isEven();
-  if ((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;
-  var u = m.clone(),
-    v = this.clone();
-  var a = nbv(1),
-    b = nbv(0),
-    c = nbv(0),
-    d = nbv(1);
-  while (u.signum() != 0)
-  {
-    while (u.isEven())
-    {
-      u.rShiftTo(1, u);
-      if (ac)
-      {
-        if (!a.isEven() || !b.isEven())
-        {
-          a.addTo(this, a);
-          b.subTo(m, b);
-        }
-        a.rShiftTo(1, a);
-      }
-      else if (!b.isEven()) b.subTo(m, b);
-      b.rShiftTo(1, b);
-    }
-    while (v.isEven())
-    {
-      v.rShiftTo(1, v);
-      if (ac)
-      {
-        if (!c.isEven() || !d.isEven())
-        {
-          c.addTo(this, c);
-          d.subTo(m, d);
+
+/**
+ * A relative of [`map`]{@link module:Collections.map}, designed for use with objects.
+ *
+ * Produces a new Object by mapping each value of `obj` through the `iteratee`
+ * function. The `iteratee` is called each `value` and `key` from `obj` and a
+ * callback for when it has finished processing. Each of these callbacks takes
+ * two arguments: an `error`, and the transformed item from `obj`. If `iteratee`
+ * passes an error to its callback, the main `callback` (for the `mapValues`
+ * function) is immediately called with the error.
+ *
+ * Note, the order of the keys in the result is not guaranteed.  The keys will
+ * be roughly in the order they complete, (but this is very engine-specific)
+ *
+ * @name mapValues
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @category Collection
+ * @param {Object} obj - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each value and key in
+ * `coll`. The iteratee is passed a `callback(err, transformed)` which must be
+ * called once it has completed with an error (which can be `null`) and a
+ * transformed value. Invoked with (value, key, callback).
+ * @param {Function} [callback] - A callback which is called when all `iteratee`
+ * functions have finished, or an error occurs. `result` is a new object consisting
+ * of each key from `obj`, with each transformed value on the right-hand side.
+ * Invoked with (err, result).
+ * @example
+ *
+ * async.mapValues({
+ *     f1: 'file1',
+ *     f2: 'file2',
+ *     f3: 'file3'
+ * }, function (file, key, callback) {
+ *   fs.stat(file, callback);
+ * }, function(err, result) {
+ *     // result is now a map of stats for each file, e.g.
+ *     // {
+ *     //     f1: [stats for file1],
+ *     //     f2: [stats for file2],
+ *     //     f3: [stats for file3]
+ *     // }
+ * });
+ */
+
+var mapValues = doLimit(mapValuesLimit, Infinity);
+
+/**
+ * The same as [`mapValues`]{@link module:Collections.mapValues} but runs only a single async operation at a time.
+ *
+ * @name mapValuesSeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.mapValues]{@link module:Collections.mapValues}
+ * @category Collection
+ * @param {Object} obj - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each value in `obj`.
+ * The iteratee is passed a `callback(err, transformed)` which must be called
+ * once it has completed with an error (which can be `null`) and a
+ * transformed value. Invoked with (value, key, callback).
+ * @param {Function} [callback] - A callback which is called when all `iteratee`
+ * functions have finished, or an error occurs. `result` is a new object consisting
+ * of each key from `obj`, with each transformed value on the right-hand side.
+ * Invoked with (err, result).
+ */
+var mapValuesSeries = doLimit(mapValuesLimit, 1);
+
+function has(obj, key) {
+    return key in obj;
+}
+
+/**
+ * Caches the results of an `async` function. When creating a hash to store
+ * function results against, the callback is omitted from the hash and an
+ * optional hash function can be used.
+ *
+ * If no hash function is specified, the first argument is used as a hash key,
+ * which may work reasonably if it is a string or a data type that converts to a
+ * distinct string. Note that objects and arrays will not behave reasonably.
+ * Neither will cases where the other arguments are significant. In such cases,
+ * specify your own hash function.
+ *
+ * The cache of results is exposed as the `memo` property of the function
+ * returned by `memoize`.
+ *
+ * @name memoize
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @category Util
+ * @param {Function} fn - The function to proxy and cache results from.
+ * @param {Function} hasher - An optional function for generating a custom hash
+ * for storing results. It has all the arguments applied to it apart from the
+ * callback, and must be synchronous.
+ * @returns {Function} a memoized version of `fn`
+ * @example
+ *
+ * var slow_fn = function(name, callback) {
+ *     // do something
+ *     callback(null, result);
+ * };
+ * var fn = async.memoize(slow_fn);
+ *
+ * // fn can now be used as if it were slow_fn
+ * fn('some name', function() {
+ *     // callback
+ * });
+ */
+function memoize(fn, hasher) {
+    var memo = Object.create(null);
+    var queues = Object.create(null);
+    hasher = hasher || identity;
+    var memoized = initialParams(function memoized(args, callback) {
+        var key = hasher.apply(null, args);
+        if (has(memo, key)) {
+            setImmediate$1(function () {
+                callback.apply(null, memo[key]);
+            });
+        } else if (has(queues, key)) {
+            queues[key].push(callback);
+        } else {
+            queues[key] = [callback];
+            fn.apply(null, args.concat([rest(function (args) {
+                memo[key] = args;
+                var q = queues[key];
+                delete queues[key];
+                for (var i = 0, l = q.length; i < l; i++) {
+                    q[i].apply(null, args);
+                }
+            })]));
         }
-        c.rShiftTo(1, c);
-      }
-      else if (!d.isEven()) d.subTo(m, d);
-      d.rShiftTo(1, d);
-    }
-    if (u.compareTo(v) >= 0)
-    {
-      u.subTo(v, u);
-      if (ac) a.subTo(c, a);
-      b.subTo(d, b);
-    }
-    else
-    {
-      v.subTo(u, v);
-      if (ac) c.subTo(a, c);
-      d.subTo(b, d);
-    }
-  }
-  if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
-  if (d.compareTo(m) >= 0) return d.subtract(m);
-  if (d.signum() < 0) d.addTo(m, d);
-  else return d;
-  if (d.signum() < 0) return d.add(m);
-  else return d;
+    });
+    memoized.memo = memo;
+    memoized.unmemoized = fn;
+    return memoized;
 }
-var lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];
-var lplim = (1 << 26) / lowprimes[lowprimes.length - 1];
-// (public) test primality with certainty >= 1-.5^t
-function bnIsProbablePrime(t)
-{
-  var i, x = this.abs();
-  if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1])
-  {
-    for (i = 0; i < lowprimes.length; ++i)
-      if (x[0] == lowprimes[i]) return true;
-    return false;
-  }
-  if (x.isEven()) return false;
-  i = 1;
-  while (i < lowprimes.length)
-  {
-    var m = lowprimes[i],
-      j = i + 1;
-    while (j < lowprimes.length && m < lplim) m *= lowprimes[j++];
-    m = x.modInt(m);
-    while (i < j)
-      if (m % lowprimes[i++] == 0) return false;
-  }
-  return x.millerRabin(t);
+
+/**
+ * Calls `callback` on a later loop around the event loop. In Node.js this just
+ * calls `setImmediate`.  In the browser it will use `setImmediate` if
+ * available, otherwise `setTimeout(callback, 0)`, which means other higher
+ * priority events may precede the execution of `callback`.
+ *
+ * This is used internally for browser-compatibility purposes.
+ *
+ * @name nextTick
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @alias setImmediate
+ * @category Util
+ * @param {Function} callback - The function to call on a later loop around
+ * the event loop. Invoked with (args...).
+ * @param {...*} args... - any number of additional arguments to pass to the
+ * callback on the next tick.
+ * @example
+ *
+ * var call_order = [];
+ * async.nextTick(function() {
+ *     call_order.push('two');
+ *     // call_order now equals ['one','two']
+ * });
+ * call_order.push('one');
+ *
+ * async.setImmediate(function (a, b, c) {
+ *     // a, b, and c equal 1, 2, and 3
+ * }, 1, 2, 3);
+ */
+var _defer$1;
+
+if (hasNextTick) {
+    _defer$1 = process.nextTick;
+} else if (hasSetImmediate) {
+    _defer$1 = setImmediate;
+} else {
+    _defer$1 = fallback;
 }
-// (protected) true if probably prime (HAC 4.24, Miller-Rabin)
-function bnpMillerRabin(t)
-{
-  var n1 = this.subtract(BigInteger.ONE);
-  var k = n1.getLowestSetBit();
-  if (k <= 0) return false;
-  var r = n1.shiftRight(k);
-  t = (t + 1) >> 1;
-  if (t > lowprimes.length) t = lowprimes.length;
-  var a = nbi();
-  for (var i = 0; i < t; ++i)
-  {
-    //Pick bases at random, instead of starting at 2
-    a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);
-    var y = a.modPow(r, this);
-    if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0)
-    {
-      var j = 1;
-      while (j++ < k && y.compareTo(n1) != 0)
-      {
-        y = y.modPowInt(2, this);
-        if (y.compareTo(BigInteger.ONE) == 0) return false;
-      }
-      if (y.compareTo(n1) != 0) return false;
-    }
-  }
-  return true;
+
+var nextTick = wrap(_defer$1);
+
+function _parallel(eachfn, tasks, callback) {
+    callback = callback || noop;
+    var results = isArrayLike(tasks) ? [] : {};
+
+    eachfn(tasks, function (task, key, callback) {
+        task(rest(function (err, args) {
+            if (args.length <= 1) {
+                args = args[0];
+            }
+            results[key] = args;
+            callback(err);
+        }));
+    }, function (err) {
+        callback(err, results);
+    });
 }
-// protected
-BigInteger.prototype.chunkSize = bnpChunkSize;
-BigInteger.prototype.toRadix = bnpToRadix;
-BigInteger.prototype.fromRadix = bnpFromRadix;
-BigInteger.prototype.fromNumber = bnpFromNumber;
-BigInteger.prototype.bitwiseTo = bnpBitwiseTo;
-BigInteger.prototype.changeBit = bnpChangeBit;
-BigInteger.prototype.addTo = bnpAddTo;
-BigInteger.prototype.dMultiply = bnpDMultiply;
-BigInteger.prototype.dAddOffset = bnpDAddOffset;
-BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;
-BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;
-BigInteger.prototype.modInt = bnpModInt;
-BigInteger.prototype.millerRabin = bnpMillerRabin;
-// public
-BigInteger.prototype.clone = bnClone;
-BigInteger.prototype.intValue = bnIntValue;
-BigInteger.prototype.byteValue = bnByteValue;
-BigInteger.prototype.shortValue = bnShortValue;
-BigInteger.prototype.signum = bnSigNum;
-BigInteger.prototype.toByteArray = bnToByteArray;
-BigInteger.prototype.equals = bnEquals;
-BigInteger.prototype.min = bnMin;
-BigInteger.prototype.max = bnMax;
-BigInteger.prototype.and = bnAnd;
-BigInteger.prototype.or = bnOr;
-BigInteger.prototype.xor = bnXor;
-BigInteger.prototype.andNot = bnAndNot;
-BigInteger.prototype.not = bnNot;
-BigInteger.prototype.shiftLeft = bnShiftLeft;
-BigInteger.prototype.shiftRight = bnShiftRight;
-BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;
-BigInteger.prototype.bitCount = bnBitCount;
-BigInteger.prototype.testBit = bnTestBit;
-BigInteger.prototype.setBit = bnSetBit;
-BigInteger.prototype.clearBit = bnClearBit;
-BigInteger.prototype.flipBit = bnFlipBit;
-BigInteger.prototype.add = bnAdd;
-BigInteger.prototype.subtract = bnSubtract;
-BigInteger.prototype.multiply = bnMultiply;
-BigInteger.prototype.divide = bnDivide;
-BigInteger.prototype.remainder = bnRemainder;
-BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;
-BigInteger.prototype.modPow = bnModPow;
-BigInteger.prototype.modInverse = bnModInverse;
-BigInteger.prototype.pow = bnPow;
-BigInteger.prototype.gcd = bnGCD;
-BigInteger.prototype.isProbablePrime = bnIsProbablePrime;
-// JSBN-specific extension
-BigInteger.prototype.square = bnSquare;
-var Int128 = BigInteger;
-// BigInteger interfaces not implemented in jsbn:
-// BigInteger(int signum, byte[] magnitude)
-// double doubleValue()
-// float floatValue()
-// int hashCode()
-// long longValue()
-// static BigInteger valueOf(long val)
-// Helper functions to make BigInteger functions callable with two parameters
-// as in original C# Clipper
-Int128.prototype.IsNegative = function ()
-{
-  if (this.compareTo(Int128.ZERO) == -1) return true;
-  else return false;
-};
-Int128.op_Equality = function (val1, val2)
-{
-  if (val1.compareTo(val2) == 0) return true;
-  else return false;
-};
-Int128.op_Inequality = function (val1, val2)
-{
-  if (val1.compareTo(val2) != 0) return true;
-  else return false;
-};
-Int128.op_GreaterThan = function (val1, val2)
-{
-  if (val1.compareTo(val2) > 0) return true;
-  else return false;
+
+/**
+ * Run the `tasks` collection of functions in parallel, without waiting until
+ * the previous function has completed. If any of the functions pass an error to
+ * its callback, the main `callback` is immediately called with the value of the
+ * error. Once the `tasks` have completed, the results are passed to the final
+ * `callback` as an array.
+ *
+ * **Note:** `parallel` is about kicking-off I/O tasks in parallel, not about
+ * parallel execution of code.  If your tasks do not use any timers or perform
+ * any I/O, they will actually be executed in series.  Any synchronous setup
+ * sections for each task will happen one after the other.  JavaScript remains
+ * single-threaded.
+ *
+ * It is also possible to use an object instead of an array. Each property will
+ * be run as a function and the results will be passed to the final `callback`
+ * as an object instead of an array. This can be a more readable way of handling
+ * results from {@link async.parallel}.
+ *
+ * @name parallel
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Array|Iterable|Object} tasks - A collection containing functions to run.
+ * Each function is passed a `callback(err, result)` which it must call on
+ * completion with an error `err` (which can be `null`) and an optional `result`
+ * value.
+ * @param {Function} [callback] - An optional callback to run once all the
+ * functions have completed successfully. This function gets a results array
+ * (or object) containing all the result arguments passed to the task callbacks.
+ * Invoked with (err, results).
+ * @example
+ * async.parallel([
+ *     function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 'one');
+ *         }, 200);
+ *     },
+ *     function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 'two');
+ *         }, 100);
+ *     }
+ * ],
+ * // optional callback
+ * function(err, results) {
+ *     // the results array will equal ['one','two'] even though
+ *     // the second function had a shorter timeout.
+ * });
+ *
+ * // an example using an object instead of an array
+ * async.parallel({
+ *     one: function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 1);
+ *         }, 200);
+ *     },
+ *     two: function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 2);
+ *         }, 100);
+ *     }
+ * }, function(err, results) {
+ *     // results is now equals to: {one: 1, two: 2}
+ * });
+ */
+function parallelLimit(tasks, callback) {
+  _parallel(eachOf, tasks, callback);
+}
+
+/**
+ * The same as [`parallel`]{@link module:ControlFlow.parallel} but runs a maximum of `limit` async operations at a
+ * time.
+ *
+ * @name parallelLimit
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.parallel]{@link module:ControlFlow.parallel}
+ * @category Control Flow
+ * @param {Array|Collection} tasks - A collection containing functions to run.
+ * Each function is passed a `callback(err, result)` which it must call on
+ * completion with an error `err` (which can be `null`) and an optional `result`
+ * value.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} [callback] - An optional callback to run once all the
+ * functions have completed successfully. This function gets a results array
+ * (or object) containing all the result arguments passed to the task callbacks.
+ * Invoked with (err, results).
+ */
+function parallelLimit$1(tasks, limit, callback) {
+  _parallel(_eachOfLimit(limit), tasks, callback);
+}
+
+/**
+ * A queue of tasks for the worker function to complete.
+ * @typedef {Object} QueueObject
+ * @memberOf module:ControlFlow
+ * @property {Function} length - a function returning the number of items
+ * waiting to be processed. Invoke with `queue.length()`.
+ * @property {boolean} started - a boolean indicating whether or not any
+ * items have been pushed and processed by the queue.
+ * @property {Function} running - a function returning the number of items
+ * currently being processed. Invoke with `queue.running()`.
+ * @property {Function} workersList - a function returning the array of items
+ * currently being processed. Invoke with `queue.workersList()`.
+ * @property {Function} idle - a function returning false if there are items
+ * waiting or being processed, or true if not. Invoke with `queue.idle()`.
+ * @property {number} concurrency - an integer for determining how many `worker`
+ * functions should be run in parallel. This property can be changed after a
+ * `queue` is created to alter the concurrency on-the-fly.
+ * @property {Function} push - add a new task to the `queue`. Calls `callback`
+ * once the `worker` has finished processing the task. Instead of a single task,
+ * a `tasks` array can be submitted. The respective callback is used for every
+ * task in the list. Invoke with `queue.push(task, [callback])`,
+ * @property {Function} unshift - add a new task to the front of the `queue`.
+ * Invoke with `queue.unshift(task, [callback])`.
+ * @property {Function} saturated - a callback that is called when the number of
+ * running workers hits the `concurrency` limit, and further tasks will be
+ * queued.
+ * @property {Function} unsaturated - a callback that is called when the number
+ * of running workers is less than the `concurrency` & `buffer` limits, and
+ * further tasks will not be queued.
+ * @property {number} buffer - A minimum threshold buffer in order to say that
+ * the `queue` is `unsaturated`.
+ * @property {Function} empty - a callback that is called when the last item
+ * from the `queue` is given to a `worker`.
+ * @property {Function} drain - a callback that is called when the last item
+ * from the `queue` has returned from the `worker`.
+ * @property {Function} error - a callback that is called when a task errors.
+ * Has the signature `function(error, task)`.
+ * @property {boolean} paused - a boolean for determining whether the queue is
+ * in a paused state.
+ * @property {Function} pause - a function that pauses the processing of tasks
+ * until `resume()` is called. Invoke with `queue.pause()`.
+ * @property {Function} resume - a function that resumes the processing of
+ * queued tasks when the queue is paused. Invoke with `queue.resume()`.
+ * @property {Function} kill - a function that removes the `drain` callback and
+ * empties remaining tasks from the queue forcing it to go idle. Invoke with `queue.kill()`.
+ */
+
+/**
+ * Creates a `queue` object with the specified `concurrency`. Tasks added to the
+ * `queue` are processed in parallel (up to the `concurrency` limit). If all
+ * `worker`s are in progress, the task is queued until one becomes available.
+ * Once a `worker` completes a `task`, that `task`'s callback is called.
+ *
+ * @name queue
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Function} worker - An asynchronous function for processing a queued
+ * task, which must call its `callback(err)` argument when finished, with an
+ * optional `error` as an argument.  If you want to handle errors from an
+ * individual task, pass a callback to `q.push()`. Invoked with
+ * (task, callback).
+ * @param {number} [concurrency=1] - An `integer` for determining how many
+ * `worker` functions should be run in parallel.  If omitted, the concurrency
+ * defaults to `1`.  If the concurrency is `0`, an error is thrown.
+ * @returns {module:ControlFlow.QueueObject} A queue object to manage the tasks. Callbacks can
+ * attached as certain properties to listen for specific events during the
+ * lifecycle of the queue.
+ * @example
+ *
+ * // create a queue object with concurrency 2
+ * var q = async.queue(function(task, callback) {
+ *     console.log('hello ' + task.name);
+ *     callback();
+ * }, 2);
+ *
+ * // assign a callback
+ * q.drain = function() {
+ *     console.log('all items have been processed');
+ * };
+ *
+ * // add some items to the queue
+ * q.push({name: 'foo'}, function(err) {
+ *     console.log('finished processing foo');
+ * });
+ * q.push({name: 'bar'}, function (err) {
+ *     console.log('finished processing bar');
+ * });
+ *
+ * // add some items to the queue (batch-wise)
+ * q.push([{name: 'baz'},{name: 'bay'},{name: 'bax'}], function(err) {
+ *     console.log('finished processing item');
+ * });
+ *
+ * // add some items to the front of the queue
+ * q.unshift({name: 'bar'}, function (err) {
+ *     console.log('finished processing bar');
+ * });
+ */
+var queue$1 = function (worker, concurrency) {
+  return queue(function (items, cb) {
+    worker(items[0], cb);
+  }, concurrency, 1);
 };
-Int128.op_LessThan = function (val1, val2)
-{
-  if (val1.compareTo(val2) < 0) return true;
-  else return false;
+
+/**
+ * The same as [async.queue]{@link module:ControlFlow.queue} only tasks are assigned a priority and
+ * completed in ascending priority order.
+ *
+ * @name priorityQueue
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.queue]{@link module:ControlFlow.queue}
+ * @category Control Flow
+ * @param {Function} worker - An asynchronous function for processing a queued
+ * task, which must call its `callback(err)` argument when finished, with an
+ * optional `error` as an argument.  If you want to handle errors from an
+ * individual task, pass a callback to `q.push()`. Invoked with
+ * (task, callback).
+ * @param {number} concurrency - An `integer` for determining how many `worker`
+ * functions should be run in parallel.  If omitted, the concurrency defaults to
+ * `1`.  If the concurrency is `0`, an error is thrown.
+ * @returns {module:ControlFlow.QueueObject} A priorityQueue object to manage the tasks. There are two
+ * differences between `queue` and `priorityQueue` objects:
+ * * `push(task, priority, [callback])` - `priority` should be a number. If an
+ *   array of `tasks` is given, all tasks will be assigned the same priority.
+ * * The `unshift` method was removed.
+ */
+var priorityQueue = function (worker, concurrency) {
+    // Start with a normal queue
+    var q = queue$1(worker, concurrency);
+
+    // Override push to accept second parameter representing priority
+    q.push = function (data, priority, callback) {
+        if (callback == null) callback = noop;
+        if (typeof callback !== 'function') {
+            throw new Error('task callback must be a function');
+        }
+        q.started = true;
+        if (!isArray(data)) {
+            data = [data];
+        }
+        if (data.length === 0) {
+            // call drain immediately if there are no tasks
+            return setImmediate$1(function () {
+                q.drain();
+            });
+        }
+
+        priority = priority || 0;
+        var nextNode = q._tasks.head;
+        while (nextNode && priority >= nextNode.priority) {
+            nextNode = nextNode.next;
+        }
+
+        for (var i = 0, l = data.length; i < l; i++) {
+            var item = {
+                data: data[i],
+                priority: priority,
+                callback: callback
+            };
+
+            if (nextNode) {
+                q._tasks.insertBefore(nextNode, item);
+            } else {
+                q._tasks.push(item);
+            }
+        }
+        setImmediate$1(q.process);
+    };
+
+    // Remove unshift function
+    delete q.unshift;
+
+    return q;
 };
-Int128.op_Addition = function (lhs, rhs)
-{
-  return new Int128(lhs).add(new Int128(rhs));
-};
-Int128.op_Subtraction = function (lhs, rhs)
-{
-  return new Int128(lhs).subtract(new Int128(rhs));
-};
-Int128.Int128Mul = function (lhs, rhs)
-{
-  return new Int128(lhs).multiply(new Int128(rhs));
-};
-Int128.op_Division = function (lhs, rhs)
-{
-  return lhs.divide(rhs);
-};
-Int128.prototype.ToDouble = function ()
-{
-  return parseFloat(this.toString()); // This could be something faster
-};
-// end of Int128 section
-/*
-// Uncomment the following two lines if you want to use Int128 outside ClipperLib
-if (typeof(document) !== "undefined") window.Int128 = Int128;
-else self.Int128 = Int128;
-*/
-// ---------------------------------------------  
-// Here starts the actual Clipper library:
-// Helper function to support Inheritance in Javascript
-if (typeof (Inherit) == 'undefined')
-{
-  var Inherit = function (ce, ce2)
-  {
-    var p;
-    if (typeof (Object.getOwnPropertyNames) == 'undefined')
-    {
-      for (p in ce2.prototype)
-        if (typeof (ce.prototype[p]) == 'undefined' || ce.prototype[p] == Object.prototype[p]) ce.prototype[p] = ce2.prototype[p];
-      for (p in ce2)
-        if (typeof (ce[p]) == 'undefined') ce[p] = ce2[p];
-      ce.$baseCtor = ce2;
+
+/**
+ * Runs the `tasks` array of functions in parallel, without waiting until the
+ * previous function has completed. Once any of the `tasks` complete or pass an
+ * error to its callback, the main `callback` is immediately called. It's
+ * equivalent to `Promise.race()`.
+ *
+ * @name race
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Array} tasks - An array containing functions to run. Each function
+ * is passed a `callback(err, result)` which it must call on completion with an
+ * error `err` (which can be `null`) and an optional `result` value.
+ * @param {Function} callback - A callback to run once any of the functions have
+ * completed. This function gets an error or result from the first function that
+ * completed. Invoked with (err, result).
+ * @returns undefined
+ * @example
+ *
+ * async.race([
+ *     function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 'one');
+ *         }, 200);
+ *     },
+ *     function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 'two');
+ *         }, 100);
+ *     }
+ * ],
+ * // main callback
+ * function(err, result) {
+ *     // the result will be equal to 'two' as it finishes earlier
+ * });
+ */
+function race(tasks, callback) {
+    callback = once(callback || noop);
+    if (!isArray(tasks)) return callback(new TypeError('First argument to race must be an array of functions'));
+    if (!tasks.length) return callback();
+    for (var i = 0, l = tasks.length; i < l; i++) {
+        tasks[i](callback);
     }
-    else
-    {
-      var props = Object.getOwnPropertyNames(ce2.prototype);
-      for (var i = 0; i < props.length; i++)
-        if (typeof (Object.getOwnPropertyDescriptor(ce.prototype, props[i])) == 'undefined') Object.defineProperty(ce.prototype, props[i], Object.getOwnPropertyDescriptor(ce2.prototype, props[i]));
-      for (p in ce2)
-        if (typeof (ce[p]) == 'undefined') ce[p] = ce2[p];
-      ce.$baseCtor = ce2;
+}
+
+var slice = Array.prototype.slice;
+
+/**
+ * Same as [`reduce`]{@link module:Collections.reduce}, only operates on `array` in reverse order.
+ *
+ * @name reduceRight
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.reduce]{@link module:Collections.reduce}
+ * @alias foldr
+ * @category Collection
+ * @param {Array} array - A collection to iterate over.
+ * @param {*} memo - The initial state of the reduction.
+ * @param {Function} iteratee - A function applied to each item in the
+ * array to produce the next step in the reduction. The `iteratee` is passed a
+ * `callback(err, reduction)` which accepts an optional error as its first
+ * argument, and the state of the reduction as the second. If an error is
+ * passed to the callback, the reduction is stopped and the main `callback` is
+ * immediately called with the error. Invoked with (memo, item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Result is the reduced value. Invoked with
+ * (err, result).
+ */
+function reduceRight(array, memo, iteratee, callback) {
+  var reversed = slice.call(array).reverse();
+  reduce(reversed, memo, iteratee, callback);
+}
+
+/**
+ * Wraps the function in another function that always returns data even when it
+ * errors.
+ *
+ * The object returned has either the property `error` or `value`.
+ *
+ * @name reflect
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @category Util
+ * @param {Function} fn - The function you want to wrap
+ * @returns {Function} - A function that always passes null to it's callback as
+ * the error. The second argument to the callback will be an `object` with
+ * either an `error` or a `value` property.
+ * @example
+ *
+ * async.parallel([
+ *     async.reflect(function(callback) {
+ *         // do some stuff ...
+ *         callback(null, 'one');
+ *     }),
+ *     async.reflect(function(callback) {
+ *         // do some more stuff but error ...
+ *         callback('bad stuff happened');
+ *     }),
+ *     async.reflect(function(callback) {
+ *         // do some more stuff ...
+ *         callback(null, 'two');
+ *     })
+ * ],
+ * // optional callback
+ * function(err, results) {
+ *     // values
+ *     // results[0].value = 'one'
+ *     // results[1].error = 'bad stuff happened'
+ *     // results[2].value = 'two'
+ * });
+ */
+function reflect(fn) {
+    return initialParams(function reflectOn(args, reflectCallback) {
+        args.push(rest(function callback(err, cbArgs) {
+            if (err) {
+                reflectCallback(null, {
+                    error: err
+                });
+            } else {
+                var value = null;
+                if (cbArgs.length === 1) {
+                    value = cbArgs[0];
+                } else if (cbArgs.length > 1) {
+                    value = cbArgs;
+                }
+                reflectCallback(null, {
+                    value: value
+                });
+            }
+        }));
+
+        return fn.apply(this, args);
+    });
+}
+
+function reject$1(eachfn, arr, iteratee, callback) {
+    _filter(eachfn, arr, function (value, cb) {
+        iteratee(value, function (err, v) {
+            cb(err, !v);
+        });
+    }, callback);
+}
+
+/**
+ * The opposite of [`filter`]{@link module:Collections.filter}. Removes values that pass an `async` truth test.
+ *
+ * @name reject
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.filter]{@link module:Collections.filter}
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in `coll`.
+ * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
+ * with a boolean argument once it has completed. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Invoked with (err, results).
+ * @example
+ *
+ * async.reject(['file1','file2','file3'], function(filePath, callback) {
+ *     fs.access(filePath, function(err) {
+ *         callback(null, !err)
+ *     });
+ * }, function(err, results) {
+ *     // results now equals an array of missing files
+ *     createFiles(results);
+ * });
+ */
+var reject = doParallel(reject$1);
+
+/**
+ * A helper function that wraps an array or an object of functions with reflect.
+ *
+ * @name reflectAll
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @see [async.reflect]{@link module:Utils.reflect}
+ * @category Util
+ * @param {Array} tasks - The array of functions to wrap in `async.reflect`.
+ * @returns {Array} Returns an array of functions, each function wrapped in
+ * `async.reflect`
+ * @example
+ *
+ * let tasks = [
+ *     function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 'one');
+ *         }, 200);
+ *     },
+ *     function(callback) {
+ *         // do some more stuff but error ...
+ *         callback(new Error('bad stuff happened'));
+ *     },
+ *     function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 'two');
+ *         }, 100);
+ *     }
+ * ];
+ *
+ * async.parallel(async.reflectAll(tasks),
+ * // optional callback
+ * function(err, results) {
+ *     // values
+ *     // results[0].value = 'one'
+ *     // results[1].error = Error('bad stuff happened')
+ *     // results[2].value = 'two'
+ * });
+ *
+ * // an example using an object instead of an array
+ * let tasks = {
+ *     one: function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 'one');
+ *         }, 200);
+ *     },
+ *     two: function(callback) {
+ *         callback('two');
+ *     },
+ *     three: function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 'three');
+ *         }, 100);
+ *     }
+ * };
+ *
+ * async.parallel(async.reflectAll(tasks),
+ * // optional callback
+ * function(err, results) {
+ *     // values
+ *     // results.one.value = 'one'
+ *     // results.two.error = 'two'
+ *     // results.three.value = 'three'
+ * });
+ */
+function reflectAll(tasks) {
+    var results;
+    if (isArray(tasks)) {
+        results = arrayMap(tasks, reflect);
+    } else {
+        results = {};
+        baseForOwn(tasks, function (task, key) {
+            results[key] = reflect.call(this, task);
+        });
     }
+    return results;
+}
+
+/**
+ * The same as [`reject`]{@link module:Collections.reject} but runs a maximum of `limit` async operations at a
+ * time.
+ *
+ * @name rejectLimit
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.reject]{@link module:Collections.reject}
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - A truth test to apply to each item in `coll`.
+ * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
+ * with a boolean argument once it has completed. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Invoked with (err, results).
+ */
+var rejectLimit = doParallelLimit(reject$1);
+
+/**
+ * The same as [`reject`]{@link module:Collections.reject} but runs only a single async operation at a time.
+ *
+ * @name rejectSeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.reject]{@link module:Collections.reject}
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in `coll`.
+ * The `iteratee` is passed a `callback(err, truthValue)`, which must be called
+ * with a boolean argument once it has completed. Invoked with (item, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Invoked with (err, results).
+ */
+var rejectSeries = doLimit(rejectLimit, 1);
+
+/**
+ * Creates a function that returns `value`.
+ *
+ * @static
+ * @memberOf _
+ * @since 2.4.0
+ * @category Util
+ * @param {*} value The value to return from the new function.
+ * @returns {Function} Returns the new constant function.
+ * @example
+ *
+ * var objects = _.times(2, _.constant({ 'a': 1 }));
+ *
+ * console.log(objects);
+ * // => [{ 'a': 1 }, { 'a': 1 }]
+ *
+ * console.log(objects[0] === objects[1]);
+ * // => true
+ */
+function constant$1(value) {
+  return function() {
+    return value;
   };
 }
-ClipperLib.Path = function ()
-{
-  return [];
-};
-ClipperLib.Paths = function ()
-{
-  return []; // Was previously [[]], but caused problems when pushed
-};
-// Preserves the calling way of original C# Clipper
-// Is essential due to compatibility, because DoublePoint is public class in original C# version
-ClipperLib.DoublePoint = function ()
-{
-  var a = arguments;
-  this.X = 0;
-  this.Y = 0;
-  // public DoublePoint(DoublePoint dp)
-  // public DoublePoint(IntPoint ip)
-  if (a.length == 1)
-  {
-    this.X = a[0].X;
-    this.Y = a[0].Y;
-  }
-  else if (a.length == 2)
-  {
-    this.X = a[0];
-    this.Y = a[1];
-  }
-}; // This is internal faster function when called without arguments
-ClipperLib.DoublePoint0 = function ()
-{
-  this.X = 0;
-  this.Y = 0;
-};
-// This is internal faster function when called with 1 argument (dp or ip)
-ClipperLib.DoublePoint1 = function (dp)
-{
-  this.X = dp.X;
-  this.Y = dp.Y;
-};
-// This is internal faster function when called with 2 arguments (x and y)
-ClipperLib.DoublePoint2 = function (x, y)
-{
-  this.X = x;
-  this.Y = y;
-};
-// PolyTree & PolyNode start
-// -------------------------------
-ClipperLib.PolyNode = function ()
-{
-  this.m_Parent = null;
-  this.m_polygon = new ClipperLib.Path();
-  this.m_Index = 0;
-  this.m_jointype = 0;
-  this.m_endtype = 0;
-  this.m_Childs = [];
-  this.IsOpen = false;
-};
-ClipperLib.PolyNode.prototype.IsHoleNode = function ()
-{
-  var result = true;
-  var node = this.m_Parent;
-  while (node !== null)
-  {
-    result = !result;
-    node = node.m_Parent;
-  }
-  return result;
-};
-ClipperLib.PolyNode.prototype.ChildCount = function ()
-{
-  return this.m_Childs.length;
-};
-ClipperLib.PolyNode.prototype.Contour = function ()
-{
-  return this.m_polygon;
-};
-ClipperLib.PolyNode.prototype.AddChild = function (Child)
-{
-  var cnt = this.m_Childs.length;
-  this.m_Childs.push(Child);
-  Child.m_Parent = this;
-  Child.m_Index = cnt;
-};
-ClipperLib.PolyNode.prototype.GetNext = function ()
-{
-  if (this.m_Childs.length > 0)
-    return this.m_Childs[0];
-  else
-    return this.GetNextSiblingUp();
-};
-ClipperLib.PolyNode.prototype.GetNextSiblingUp = function ()
-{
-  if (this.m_Parent === null)
-    return null;
-  else if (this.m_Index == this.m_Parent.m_Childs.length - 1)
-    return this.m_Parent.GetNextSiblingUp();
-  else
-    return this.m_Parent.m_Childs[this.m_Index + 1];
-};
-ClipperLib.PolyNode.prototype.Childs = function ()
-{
-  return this.m_Childs;
-};
-ClipperLib.PolyNode.prototype.Parent = function ()
-{
-  return this.m_Parent;
-};
-ClipperLib.PolyNode.prototype.IsHole = function ()
-{
-  return this.IsHoleNode();
-};
-// PolyTree : PolyNode
-ClipperLib.PolyTree = function ()
-{
-  this.m_AllPolys = [];
-  ClipperLib.PolyNode.call(this);
-};
-ClipperLib.PolyTree.prototype.Clear = function ()
-{
-  for (var i = 0, ilen = this.m_AllPolys.length; i < ilen; i++)
-    this.m_AllPolys[i] = null;
-  this.m_AllPolys.length = 0;
-  this.m_Childs.length = 0;
-};
-ClipperLib.PolyTree.prototype.GetFirst = function ()
-{
-  if (this.m_Childs.length > 0)
-    return this.m_Childs[0];
-  else
-    return null;
-};
-ClipperLib.PolyTree.prototype.Total = function ()
-{
-  return this.m_AllPolys.length;
-};
-Inherit(ClipperLib.PolyTree, ClipperLib.PolyNode);
-// -------------------------------
-// PolyTree & PolyNode end
-ClipperLib.Math_Abs_Int64 = ClipperLib.Math_Abs_Int32 = ClipperLib.Math_Abs_Double = function (a)
-{
-  return Math.abs(a);
-};
-ClipperLib.Math_Max_Int32_Int32 = function (a, b)
-{
-  return Math.max(a, b);
-};
-/*
------------------------------------
-cast_32 speedtest: http://jsperf.com/truncate-float-to-integer/2
------------------------------------
-*/
-if (browser.msie || browser.opera || browser.safari) ClipperLib.Cast_Int32 = function (a)
-{
-  return a | 0;
-};
-else ClipperLib.Cast_Int32 = function (a)
-{ // eg. browser.chrome || browser.chromium || browser.firefox
-  return~~ a;
-};
-/*
---------------------------
-cast_64 speedtests: http://jsperf.com/truncate-float-to-integer
-Chrome: bitwise_not_floor
-Firefox17: toInteger (typeof test)
-IE9: bitwise_or_floor
-IE7 and IE8: to_parseint
-Chromium: to_floor_or_ceil
-Firefox3: to_floor_or_ceil
-Firefox15: to_floor_or_ceil
-Opera: to_floor_or_ceil
-Safari: to_floor_or_ceil
---------------------------
-*/
-if (browser.chrome) ClipperLib.Cast_Int64 = function (a)
-{
-  if (a < -2147483648 || a > 2147483647)
-    return a < 0 ? Math.ceil(a) : Math.floor(a);
-  else return~~ a;
-};
-else if (browser.firefox && typeof (Number.toInteger) == "function") ClipperLib.Cast_Int64 = function (a)
-{
-  return Number.toInteger(a);
-};
-else if (browser.msie7 || browser.msie8) ClipperLib.Cast_Int64 = function (a)
-{
-  return parseInt(a, 10);
-};
-else if (browser.msie) ClipperLib.Cast_Int64 = function (a)
-{
-  if (a < -2147483648 || a > 2147483647)
-    return a < 0 ? Math.ceil(a) : Math.floor(a);
-  return a | 0;
-};
-// eg. browser.chromium || browser.firefox || browser.opera || browser.safari
-else ClipperLib.Cast_Int64 = function (a)
-{
-  return a < 0 ? Math.ceil(a) : Math.floor(a);
-};
-ClipperLib.Clear = function (a)
-{
-  a.length = 0;
-};
-//ClipperLib.MaxSteps = 64; // How many steps at maximum in arc in BuildArc() function
-ClipperLib.PI = 3.141592653589793;
-ClipperLib.PI2 = 2 * 3.141592653589793;
-ClipperLib.IntPoint = function ()
-{
-  var a = arguments,
-    alen = a.length;
-  this.X = 0;
-  this.Y = 0;
-  if (use_xyz)
-  {
-    this.Z = 0;
-    if (alen == 3) // public IntPoint(cInt x, cInt y, cInt z = 0)
-    {
-      this.X = a[0];
-      this.Y = a[1];
-      this.Z = a[2];
-    }
-    else if (alen == 2) // public IntPoint(cInt x, cInt y)
-    {
-      this.X = a[0];
-      this.Y = a[1];
-      this.Z = 0;
-    }
-    else if (alen == 1)
-    {
-      if (a[0] instanceof ClipperLib.DoublePoint) // public IntPoint(DoublePoint dp)
-      {
-        var dp = a[0];
-        this.X = ClipperLib.Clipper.Round(dp.X);
-        this.Y = ClipperLib.Clipper.Round(dp.Y);
-        this.Z = 0;
-      }
-      else // public IntPoint(IntPoint pt)
-      {
-        var pt = a[0];
-        if (typeof (pt.Z) == "undefined") pt.Z = 0;
-        this.X = pt.X;
-        this.Y = pt.Y;
-        this.Z = pt.Z;
-      }
+
+/**
+ * Attempts to get a successful response from `task` no more than `times` times
+ * before returning an error. If the task is successful, the `callback` will be
+ * passed the result of the successful task. If all attempts fail, the callback
+ * will be passed the error and result (if any) of the final attempt.
+ *
+ * @name retry
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Object|number} [opts = {times: 5, interval: 0}| 5] - Can be either an
+ * object with `times` and `interval` or a number.
+ * * `times` - The number of attempts to make before giving up.  The default
+ *   is `5`.
+ * * `interval` - The time to wait between retries, in milliseconds.  The
+ *   default is `0`. The interval may also be specified as a function of the
+ *   retry count (see example).
+ * * `errorFilter` - An optional synchronous function that is invoked on
+ *   erroneous result. If it returns `true` the retry attempts will continue;
+ *   if the function returns `false` the retry flow is aborted with the current
+ *   attempt's error and result being returned to the final callback.
+ *   Invoked with (err).
+ * * If `opts` is a number, the number specifies the number of times to retry,
+ *   with the default interval of `0`.
+ * @param {Function} task - A function which receives two arguments: (1) a
+ * `callback(err, result)` which must be called when finished, passing `err`
+ * (which can be `null`) and the `result` of the function's execution, and (2)
+ * a `results` object, containing the results of the previously executed
+ * functions (if nested inside another control flow). Invoked with
+ * (callback, results).
+ * @param {Function} [callback] - An optional callback which is called when the
+ * task has succeeded, or after the final failed attempt. It receives the `err`
+ * and `result` arguments of the last attempt at completing the `task`. Invoked
+ * with (err, results).
+ * @example
+ *
+ * // The `retry` function can be used as a stand-alone control flow by passing
+ * // a callback, as shown below:
+ *
+ * // try calling apiMethod 3 times
+ * async.retry(3, apiMethod, function(err, result) {
+ *     // do something with the result
+ * });
+ *
+ * // try calling apiMethod 3 times, waiting 200 ms between each retry
+ * async.retry({times: 3, interval: 200}, apiMethod, function(err, result) {
+ *     // do something with the result
+ * });
+ *
+ * // try calling apiMethod 10 times with exponential backoff
+ * // (i.e. intervals of 100, 200, 400, 800, 1600, ... milliseconds)
+ * async.retry({
+ *   times: 10,
+ *   interval: function(retryCount) {
+ *     return 50 * Math.pow(2, retryCount);
+ *   }
+ * }, apiMethod, function(err, result) {
+ *     // do something with the result
+ * });
+ *
+ * // try calling apiMethod the default 5 times no delay between each retry
+ * async.retry(apiMethod, function(err, result) {
+ *     // do something with the result
+ * });
+ *
+ * // try calling apiMethod only when error condition satisfies, all other
+ * // errors will abort the retry control flow and return to final callback
+ * async.retry({
+ *   errorFilter: function(err) {
+ *     return err.message === 'Temporary error'; // only retry on a specific error
+ *   }
+ * }, apiMethod, function(err, result) {
+ *     // do something with the result
+ * });
+ *
+ * // It can also be embedded within other control flow functions to retry
+ * // individual methods that are not as reliable, like this:
+ * async.auto({
+ *     users: api.getUsers.bind(api),
+ *     payments: async.retry(3, api.getPayments.bind(api))
+ * }, function(err, results) {
+ *     // do something with the results
+ * });
+ *
+ */
+function retry(opts, task, callback) {
+    var DEFAULT_TIMES = 5;
+    var DEFAULT_INTERVAL = 0;
+
+    var options = {
+        times: DEFAULT_TIMES,
+        intervalFunc: constant$1(DEFAULT_INTERVAL)
+    };
+
+    function parseTimes(acc, t) {
+        if (typeof t === 'object') {
+            acc.times = +t.times || DEFAULT_TIMES;
+
+            acc.intervalFunc = typeof t.interval === 'function' ? t.interval : constant$1(+t.interval || DEFAULT_INTERVAL);
+
+            acc.errorFilter = t.errorFilter;
+        } else if (typeof t === 'number' || typeof t === 'string') {
+            acc.times = +t || DEFAULT_TIMES;
+        } else {
+            throw new Error("Invalid arguments for async.retry");
+        }
     }
-    else // public IntPoint()
-    {
-      this.X = 0;
-      this.Y = 0;
-      this.Z = 0;
+
+    if (arguments.length < 3 && typeof opts === 'function') {
+        callback = task || noop;
+        task = opts;
+    } else {
+        parseTimes(options, opts);
+        callback = callback || noop;
     }
-  }
-  else // if (!use_xyz)
-  {
-    if (alen == 2) // public IntPoint(cInt X, cInt Y)
-    {
-      this.X = a[0];
-      this.Y = a[1];
+
+    if (typeof task !== 'function') {
+        throw new Error("Invalid arguments for async.retry");
     }
-    else if (alen == 1)
-    {
-      if (a[0] instanceof ClipperLib.DoublePoint) // public IntPoint(DoublePoint dp)
-      {
-        var dp = a[0];
-        this.X = ClipperLib.Clipper.Round(dp.X);
-        this.Y = ClipperLib.Clipper.Round(dp.Y);
-      }
-      else // public IntPoint(IntPoint pt)
-      {
-        var pt = a[0];
-        this.X = pt.X;
-        this.Y = pt.Y;
-      }
+
+    var attempt = 1;
+    function retryAttempt() {
+        task(function (err) {
+            if (err && attempt++ < options.times && (typeof options.errorFilter != 'function' || options.errorFilter(err))) {
+                setTimeout(retryAttempt, options.intervalFunc(attempt));
+            } else {
+                callback.apply(null, arguments);
+            }
+        });
     }
-    else // public IntPoint(IntPoint pt)
-    {
-      this.X = 0;
-      this.Y = 0;
+
+    retryAttempt();
+}
+
+/**
+ * A close relative of [`retry`]{@link module:ControlFlow.retry}.  This method wraps a task and makes it
+ * retryable, rather than immediately calling it with retries.
+ *
+ * @name retryable
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.retry]{@link module:ControlFlow.retry}
+ * @category Control Flow
+ * @param {Object|number} [opts = {times: 5, interval: 0}| 5] - optional
+ * options, exactly the same as from `retry`
+ * @param {Function} task - the asynchronous function to wrap
+ * @returns {Functions} The wrapped function, which when invoked, will retry on
+ * an error, based on the parameters specified in `opts`.
+ * @example
+ *
+ * async.auto({
+ *     dep1: async.retryable(3, getFromFlakyService),
+ *     process: ["dep1", async.retryable(3, function (results, cb) {
+ *         maybeProcessData(results.dep1, cb);
+ *     })]
+ * }, callback);
+ */
+var retryable = function (opts, task) {
+    if (!task) {
+        task = opts;
+        opts = null;
     }
-  }
-};
-ClipperLib.IntPoint.op_Equality = function (a, b)
-{
-  //return a == b;
-  return a.X == b.X && a.Y == b.Y;
-};
-ClipperLib.IntPoint.op_Inequality = function (a, b)
-{
-  //return a != b;
-  return a.X != b.X || a.Y != b.Y;
-};
-/*
-ClipperLib.IntPoint.prototype.Equals = function (obj)
-{
-  if (obj === null)
-      return false;
-  if (obj instanceof ClipperLib.IntPoint)
-  {
-      var a = Cast(obj, ClipperLib.IntPoint);
-      return (this.X == a.X) && (this.Y == a.Y);
-  }
-  else
-      return false;
+    return initialParams(function (args, callback) {
+        function taskFn(cb) {
+            task.apply(null, args.concat([cb]));
+        }
+
+        if (opts) retry(opts, taskFn, callback);else retry(taskFn, callback);
+    });
 };
-*/
-if (use_xyz)
-{
-  ClipperLib.IntPoint0 = function ()
-  {
-    this.X = 0;
-    this.Y = 0;
-    this.Z = 0;
-  };
-  ClipperLib.IntPoint1 = function (pt)
-  {
-    this.X = pt.X;
-    this.Y = pt.Y;
-    this.Z = pt.Z;
-  };
-  ClipperLib.IntPoint1dp = function (dp)
-  {
-    this.X = ClipperLib.Clipper.Round(dp.X);
-    this.Y = ClipperLib.Clipper.Round(dp.Y);
-    this.Z = 0;
-  };
-  ClipperLib.IntPoint2 = function (x, y)
-  {
-    this.X = x;
-    this.Y = y;
-    this.Z = 0;
-  };
-  ClipperLib.IntPoint3 = function (x, y, z)
-  {
-    this.X = x;
-    this.Y = y;
-    this.Z = z;
-  };
-}
-else // if (!use_xyz)
-{
-  ClipperLib.IntPoint0 = function ()
-  {
-    this.X = 0;
-    this.Y = 0;
-  };
-  ClipperLib.IntPoint1 = function (pt)
-  {
-    this.X = pt.X;
-    this.Y = pt.Y;
-  };
-  ClipperLib.IntPoint1dp = function (dp)
-  {
-    this.X = ClipperLib.Clipper.Round(dp.X);
-    this.Y = ClipperLib.Clipper.Round(dp.Y);
-  };
-  ClipperLib.IntPoint2 = function (x, y)
-  {
-    this.X = x;
-    this.Y = y;
-  };
-}
-ClipperLib.IntRect = function ()
-{
-  var a = arguments,
-    alen = a.length;
-  if (alen == 4) // function (l, t, r, b)
-  {
-    this.left = a[0];
-    this.top = a[1];
-    this.right = a[2];
-    this.bottom = a[3];
-  }
-  else if (alen == 1) // function (ir)
-  {
-    this.left = ir.left;
-    this.top = ir.top;
-    this.right = ir.right;
-    this.bottom = ir.bottom;
-  }
-  else // function ()
-  {
-    this.left = 0;
-    this.top = 0;
-    this.right = 0;
-    this.bottom = 0;
-  }
-};
-ClipperLib.IntRect0 = function ()
-{
-  this.left = 0;
-  this.top = 0;
-  this.right = 0;
-  this.bottom = 0;
-};
-ClipperLib.IntRect1 = function (ir)
-{
-  this.left = ir.left;
-  this.top = ir.top;
-  this.right = ir.right;
-  this.bottom = ir.bottom;
-};
-ClipperLib.IntRect4 = function (l, t, r, b)
-{
-  this.left = l;
-  this.top = t;
-  this.right = r;
-  this.bottom = b;
-};
-ClipperLib.ClipType = {
-  ctIntersection: 0,
-  ctUnion: 1,
-  ctDifference: 2,
-  ctXor: 3
-};
-ClipperLib.PolyType = {
-  ptSubject: 0,
-  ptClip: 1
-};
-ClipperLib.PolyFillType = {
-  pftEvenOdd: 0,
-  pftNonZero: 1,
-  pftPositive: 2,
-  pftNegative: 3
-};
-ClipperLib.JoinType = {
-  jtSquare: 0,
-  jtRound: 1,
-  jtMiter: 2
-};
-ClipperLib.EndType = {
-  etOpenSquare: 0,
-  etOpenRound: 1,
-  etOpenButt: 2,
-  etClosedLine: 3,
-  etClosedPolygon: 4
-};
-if (use_deprecated)
-  ClipperLib.EndType_ = {
-    etSquare: 0,
-    etRound: 1,
-    etButt: 2,
-    etClosed: 3
-  };
-ClipperLib.EdgeSide = {
-  esLeft: 0,
-  esRight: 1
-};
-ClipperLib.Direction = {
-  dRightToLeft: 0,
-  dLeftToRight: 1
-};
-ClipperLib.TEdge = function ()
-{
-  this.Bot = new ClipperLib.IntPoint();
-  this.Curr = new ClipperLib.IntPoint();
-  this.Top = new ClipperLib.IntPoint();
-  this.Delta = new ClipperLib.IntPoint();
-  this.Dx = 0;
-  this.PolyTyp = ClipperLib.PolyType.ptSubject;
-  this.Side = ClipperLib.EdgeSide.esLeft;
-  this.WindDelta = 0;
-  this.WindCnt = 0;
-  this.WindCnt2 = 0;
-  this.OutIdx = 0;
-  this.Next = null;
-  this.Prev = null;
-  this.NextInLML = null;
-  this.NextInAEL = null;
-  this.PrevInAEL = null;
-  this.NextInSEL = null;
-  this.PrevInSEL = null;
-};
-ClipperLib.IntersectNode = function ()
-{
-  this.Edge1 = null;
-  this.Edge2 = null;
-  this.Pt = new ClipperLib.IntPoint();
-};
-ClipperLib.MyIntersectNodeSort = function () {};
-ClipperLib.MyIntersectNodeSort.Compare = function (node1, node2)
-{
-  return (node2.Pt.Y - node1.Pt.Y);
-};
-ClipperLib.LocalMinima = function ()
-{
-  this.Y = 0;
-  this.LeftBound = null;
-  this.RightBound = null;
-  this.Next = null;
-};
-ClipperLib.Scanbeam = function ()
-{
-  this.Y = 0;
-  this.Next = null;
-};
-ClipperLib.OutRec = function ()
-{
-  this.Idx = 0;
-  this.IsHole = false;
-  this.IsOpen = false;
-  this.FirstLeft = null;
-  this.Pts = null;
-  this.BottomPt = null;
-  this.PolyNode = null;
-};
-ClipperLib.OutPt = function ()
-{
-  this.Idx = 0;
-  this.Pt = new ClipperLib.IntPoint();
-  this.Next = null;
-  this.Prev = null;
-};
-ClipperLib.Join = function ()
-{
-  this.OutPt1 = null;
-  this.OutPt2 = null;
-  this.OffPt = new ClipperLib.IntPoint();
-};
-ClipperLib.ClipperBase = function ()
-{
-  this.m_MinimaList = null;
-  this.m_CurrentLM = null;
-  this.m_edges = new Array();
-  this.m_UseFullRange = false;
-  this.m_HasOpenPaths = false;
-  this.PreserveCollinear = false;
-  this.m_MinimaList = null;
-  this.m_CurrentLM = null;
-  this.m_UseFullRange = false;
-  this.m_HasOpenPaths = false;
-};
-// Ranges are in original C# too high for Javascript (in current state 2013 september):
-// protected const double horizontal = -3.4E+38;
-// internal const cInt loRange = 0x3FFFFFFF; // = 1073741823 = sqrt(2^63 -1)/2
-// internal const cInt hiRange = 0x3FFFFFFFFFFFFFFFL; // = 4611686018427387903 = sqrt(2^127 -1)/2
-// So had to adjust them to more suitable for Javascript.
-// If JS some day supports truly 64-bit integers, then these ranges can be as in C#
-// and biginteger library can be more simpler (as then 128bit can be represented as two 64bit numbers)
-ClipperLib.ClipperBase.horizontal = -9007199254740992; //-2^53
-ClipperLib.ClipperBase.Skip = -2;
-ClipperLib.ClipperBase.Unassigned = -1;
-ClipperLib.ClipperBase.tolerance = 1E-20;
-if (use_int32)
-{
-  ClipperLib.ClipperBase.loRange = 46340;
-  ClipperLib.ClipperBase.hiRange = 46340;
+
+/**
+ * Run the functions in the `tasks` collection in series, each one running once
+ * the previous function has completed. If any functions in the series pass an
+ * error to its callback, no more functions are run, and `callback` is
+ * immediately called with the value of the error. Otherwise, `callback`
+ * receives an array of results when `tasks` have completed.
+ *
+ * It is also possible to use an object instead of an array. Each property will
+ * be run as a function, and the results will be passed to the final `callback`
+ * as an object instead of an array. This can be a more readable way of handling
+ *  results from {@link async.series}.
+ *
+ * **Note** that while many implementations preserve the order of object
+ * properties, the [ECMAScript Language Specification](http://www.ecma-international.org/ecma-262/5.1/#sec-8.6)
+ * explicitly states that
+ *
+ * > The mechanics and order of enumerating the properties is not specified.
+ *
+ * So if you rely on the order in which your series of functions are executed,
+ * and want this to work on all platforms, consider using an array.
+ *
+ * @name series
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Array|Iterable|Object} tasks - A collection containing functions to run, each
+ * function is passed a `callback(err, result)` it must call on completion with
+ * an error `err` (which can be `null`) and an optional `result` value.
+ * @param {Function} [callback] - An optional callback to run once all the
+ * functions have completed. This function gets a results array (or object)
+ * containing all the result arguments passed to the `task` callbacks. Invoked
+ * with (err, result).
+ * @example
+ * async.series([
+ *     function(callback) {
+ *         // do some stuff ...
+ *         callback(null, 'one');
+ *     },
+ *     function(callback) {
+ *         // do some more stuff ...
+ *         callback(null, 'two');
+ *     }
+ * ],
+ * // optional callback
+ * function(err, results) {
+ *     // results is now equal to ['one', 'two']
+ * });
+ *
+ * async.series({
+ *     one: function(callback) {
+ *         setTimeout(function() {
+ *             callback(null, 1);
+ *         }, 200);
+ *     },
+ *     two: function(callback){
+ *         setTimeout(function() {
+ *             callback(null, 2);
+ *         }, 100);
+ *     }
+ * }, function(err, results) {
+ *     // results is now equal to: {one: 1, two: 2}
+ * });
+ */
+function series(tasks, callback) {
+  _parallel(eachOfSeries, tasks, callback);
 }
-else
-{
-  ClipperLib.ClipperBase.loRange = 47453132; // sqrt(2^53 -1)/2
-  ClipperLib.ClipperBase.hiRange = 4503599627370495; // sqrt(2^106 -1)/2
+
+/**
+ * Returns `true` if at least one element in the `coll` satisfies an async test.
+ * If any iteratee call returns `true`, the main `callback` is immediately
+ * called.
+ *
+ * @name some
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @alias any
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in the array
+ * in parallel. The iteratee is passed a `callback(err, truthValue)` which must
+ * be called with a boolean argument once it has completed. Invoked with
+ * (item, callback).
+ * @param {Function} [callback] - A callback which is called as soon as any
+ * iteratee returns `true`, or after all the iteratee functions have finished.
+ * Result will be either `true` or `false` depending on the values of the async
+ * tests. Invoked with (err, result).
+ * @example
+ *
+ * async.some(['file1','file2','file3'], function(filePath, callback) {
+ *     fs.access(filePath, function(err) {
+ *         callback(null, !err)
+ *     });
+ * }, function(err, result) {
+ *     // if result is true then at least one of the files exists
+ * });
+ */
+var some = _createTester(eachOf, Boolean, identity);
+
+/**
+ * The same as [`some`]{@link module:Collections.some} but runs a maximum of `limit` async operations at a time.
+ *
+ * @name someLimit
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.some]{@link module:Collections.some}
+ * @alias anyLimit
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - A truth test to apply to each item in the array
+ * in parallel. The iteratee is passed a `callback(err, truthValue)` which must
+ * be called with a boolean argument once it has completed. Invoked with
+ * (item, callback).
+ * @param {Function} [callback] - A callback which is called as soon as any
+ * iteratee returns `true`, or after all the iteratee functions have finished.
+ * Result will be either `true` or `false` depending on the values of the async
+ * tests. Invoked with (err, result).
+ */
+var someLimit = _createTester(eachOfLimit, Boolean, identity);
+
+/**
+ * The same as [`some`]{@link module:Collections.some} but runs only a single async operation at a time.
+ *
+ * @name someSeries
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @see [async.some]{@link module:Collections.some}
+ * @alias anySeries
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A truth test to apply to each item in the array
+ * in parallel. The iteratee is passed a `callback(err, truthValue)` which must
+ * be called with a boolean argument once it has completed. Invoked with
+ * (item, callback).
+ * @param {Function} [callback] - A callback which is called as soon as any
+ * iteratee returns `true`, or after all the iteratee functions have finished.
+ * Result will be either `true` or `false` depending on the values of the async
+ * tests. Invoked with (err, result).
+ */
+var someSeries = doLimit(someLimit, 1);
+
+/**
+ * Sorts a list by the results of running each `coll` value through an async
+ * `iteratee`.
+ *
+ * @name sortBy
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {Function} iteratee - A function to apply to each item in `coll`.
+ * The iteratee is passed a `callback(err, sortValue)` which must be called once
+ * it has completed with an error (which can be `null`) and a value to use as
+ * the sort criteria. Invoked with (item, callback).
+ * @param {Function} callback - A callback which is called after all the
+ * `iteratee` functions have finished, or an error occurs. Results is the items
+ * from the original `coll` sorted by the values returned by the `iteratee`
+ * calls. Invoked with (err, results).
+ * @example
+ *
+ * async.sortBy(['file1','file2','file3'], function(file, callback) {
+ *     fs.stat(file, function(err, stats) {
+ *         callback(err, stats.mtime);
+ *     });
+ * }, function(err, results) {
+ *     // results is now the original array of files sorted by
+ *     // modified date
+ * });
+ *
+ * // By modifying the callback parameter the
+ * // sorting order can be influenced:
+ *
+ * // ascending order
+ * async.sortBy([1,9,3,5], function(x, callback) {
+ *     callback(null, x);
+ * }, function(err,result) {
+ *     // result callback
+ * });
+ *
+ * // descending order
+ * async.sortBy([1,9,3,5], function(x, callback) {
+ *     callback(null, x*-1);    //<- x*-1 instead of x, turns the order around
+ * }, function(err,result) {
+ *     // result callback
+ * });
+ */
+function sortBy(coll, iteratee, callback) {
+    map(coll, function (x, callback) {
+        iteratee(x, function (err, criteria) {
+            if (err) return callback(err);
+            callback(null, { value: x, criteria: criteria });
+        });
+    }, function (err, results) {
+        if (err) return callback(err);
+        callback(null, arrayMap(results.sort(comparator), baseProperty('value')));
+    });
+
+    function comparator(left, right) {
+        var a = left.criteria,
+            b = right.criteria;
+        return a < b ? -1 : a > b ? 1 : 0;
+    }
 }
-ClipperLib.ClipperBase.near_zero = function (val)
-{
-  return (val > -ClipperLib.ClipperBase.tolerance) && (val < ClipperLib.ClipperBase.tolerance);
-};
-ClipperLib.ClipperBase.IsHorizontal = function (e)
-{
-  return e.Delta.Y === 0;
-};
-ClipperLib.ClipperBase.prototype.PointIsVertex = function (pt, pp)
-{
-  var pp2 = pp;
-  do {
-    if (ClipperLib.IntPoint.op_Equality(pp2.Pt, pt))
-      return true;
-    pp2 = pp2.Next;
-  }
-  while (pp2 != pp)
-  return false;
-};
-ClipperLib.ClipperBase.prototype.PointOnLineSegment = function (pt, linePt1, linePt2, UseFullRange)
-{
-  if (UseFullRange)
-    return ((pt.X == linePt1.X) && (pt.Y == linePt1.Y)) ||
-      ((pt.X == linePt2.X) && (pt.Y == linePt2.Y)) ||
-      (((pt.X > linePt1.X) == (pt.X < linePt2.X)) &&
-      ((pt.Y > linePt1.Y) == (pt.Y < linePt2.Y)) &&
-      (Int128.op_Equality(Int128.Int128Mul((pt.X - linePt1.X), (linePt2.Y - linePt1.Y)),
-        Int128.Int128Mul((linePt2.X - linePt1.X), (pt.Y - linePt1.Y)))));
-  else
-    return ((pt.X == linePt1.X) && (pt.Y == linePt1.Y)) || ((pt.X == linePt2.X) && (pt.Y == linePt2.Y)) || (((pt.X > linePt1.X) == (pt.X < linePt2.X)) && ((pt.Y > linePt1.Y) == (pt.Y < linePt2.Y)) && ((pt.X - linePt1.X) * (linePt2.Y - linePt1.Y) == (linePt2.X - linePt1.X) * (pt.Y - linePt1.Y)));
-};
-ClipperLib.ClipperBase.prototype.PointOnPolygon = function (pt, pp, UseFullRange)
-{
-  var pp2 = pp;
-  while (true)
-  {
-    if (this.PointOnLineSegment(pt, pp2.Pt, pp2.Next.Pt, UseFullRange))
-      return true;
-    pp2 = pp2.Next;
-    if (pp2 == pp)
-      break;
-  }
-  return false;
-};
-ClipperLib.ClipperBase.prototype.SlopesEqual = ClipperLib.ClipperBase.SlopesEqual = function ()
-{
-  var a = arguments,
-    alen = a.length;
-  var e1, e2, pt1, pt2, pt3, pt4, UseFullRange;
-  if (alen == 3) // function (e1, e2, UseFullRange)
-  {
-    e1 = a[0];
-    e2 = a[1];
-    UseFullRange = a[2];
-    if (UseFullRange)
-      return Int128.op_Equality(Int128.Int128Mul(e1.Delta.Y, e2.Delta.X), Int128.Int128Mul(e1.Delta.X, e2.Delta.Y));
-    else
-      return ClipperLib.Cast_Int64((e1.Delta.Y) * (e2.Delta.X)) == ClipperLib.Cast_Int64((e1.Delta.X) * (e2.Delta.Y));
-  }
-  else if (alen == 4) // function (pt1, pt2, pt3, UseFullRange)
-  {
-    pt1 = a[0];
-    pt2 = a[1];
-    pt3 = a[2];
-    UseFullRange = a[3];
-    if (UseFullRange)
-      return Int128.op_Equality(Int128.Int128Mul(pt1.Y - pt2.Y, pt2.X - pt3.X), Int128.Int128Mul(pt1.X - pt2.X, pt2.Y - pt3.Y));
-    else
-      return ClipperLib.Cast_Int64((pt1.Y - pt2.Y) * (pt2.X - pt3.X)) - ClipperLib.Cast_Int64((pt1.X - pt2.X) * (pt2.Y - pt3.Y)) === 0;
-  }
-  else // function (pt1, pt2, pt3, pt4, UseFullRange)
-  {
-    pt1 = a[0];
-    pt2 = a[1];
-    pt3 = a[2];
-    pt4 = a[3];
-    UseFullRange = a[4];
-    if (UseFullRange)
-      return Int128.op_Equality(Int128.Int128Mul(pt1.Y - pt2.Y, pt3.X - pt4.X), Int128.Int128Mul(pt1.X - pt2.X, pt3.Y - pt4.Y));
-    else
-      return ClipperLib.Cast_Int64((pt1.Y - pt2.Y) * (pt3.X - pt4.X)) - ClipperLib.Cast_Int64((pt1.X - pt2.X) * (pt3.Y - pt4.Y)) === 0;
-  }
-};
-ClipperLib.ClipperBase.SlopesEqual3 = function (e1, e2, UseFullRange)
-{
-  if (UseFullRange)
-    return Int128.op_Equality(Int128.Int128Mul(e1.Delta.Y, e2.Delta.X), Int128.Int128Mul(e1.Delta.X, e2.Delta.Y));
-  else
-    return ClipperLib.Cast_Int64((e1.Delta.Y) * (e2.Delta.X)) == ClipperLib.Cast_Int64((e1.Delta.X) * (e2.Delta.Y));
-};
-ClipperLib.ClipperBase.SlopesEqual4 = function (pt1, pt2, pt3, UseFullRange)
-{
-  if (UseFullRange)
-    return Int128.op_Equality(Int128.Int128Mul(pt1.Y - pt2.Y, pt2.X - pt3.X), Int128.Int128Mul(pt1.X - pt2.X, pt2.Y - pt3.Y));
-  else
-    return ClipperLib.Cast_Int64((pt1.Y - pt2.Y) * (pt2.X - pt3.X)) - ClipperLib.Cast_Int64((pt1.X - pt2.X) * (pt2.Y - pt3.Y)) === 0;
-};
-ClipperLib.ClipperBase.SlopesEqual5 = function (pt1, pt2, pt3, pt4, UseFullRange)
-{
-  if (UseFullRange)
-    return Int128.op_Equality(Int128.Int128Mul(pt1.Y - pt2.Y, pt3.X - pt4.X), Int128.Int128Mul(pt1.X - pt2.X, pt3.Y - pt4.Y));
-  else
-    return ClipperLib.Cast_Int64((pt1.Y - pt2.Y) * (pt3.X - pt4.X)) - ClipperLib.Cast_Int64((pt1.X - pt2.X) * (pt3.Y - pt4.Y)) === 0;
-};
-ClipperLib.ClipperBase.prototype.Clear = function ()
-{
-  this.DisposeLocalMinimaList();
-  for (var i = 0, ilen = this.m_edges.length; i < ilen; ++i)
-  {
-    for (var j = 0, jlen = this.m_edges[i].length; j < jlen; ++j)
-      this.m_edges[i][j] = null;
-    ClipperLib.Clear(this.m_edges[i]);
-  }
-  ClipperLib.Clear(this.m_edges);
-  this.m_UseFullRange = false;
-  this.m_HasOpenPaths = false;
-};
-ClipperLib.ClipperBase.prototype.DisposeLocalMinimaList = function ()
-{
-  while (this.m_MinimaList !== null)
-  {
-    var tmpLm = this.m_MinimaList.Next;
-    this.m_MinimaList = null;
-    this.m_MinimaList = tmpLm;
-  }
-  this.m_CurrentLM = null;
-};
-ClipperLib.ClipperBase.prototype.RangeTest = function (Pt, useFullRange)
-{
-  if (useFullRange.Value)
-  {
-    if (Pt.X > ClipperLib.ClipperBase.hiRange || Pt.Y > ClipperLib.ClipperBase.hiRange || -Pt.X > ClipperLib.ClipperBase.hiRange || -Pt.Y > ClipperLib.ClipperBase.hiRange)
-      ClipperLib.Error("Coordinate outside allowed range in RangeTest().");
-  }
-  else if (Pt.X > ClipperLib.ClipperBase.loRange || Pt.Y > ClipperLib.ClipperBase.loRange || -Pt.X > ClipperLib.ClipperBase.loRange || -Pt.Y > ClipperLib.ClipperBase.loRange)
-  {
-    useFullRange.Value = true;
-    this.RangeTest(Pt, useFullRange);
-  }
-};
-ClipperLib.ClipperBase.prototype.InitEdge = function (e, eNext, ePrev, pt)
-{
-  e.Next = eNext;
-  e.Prev = ePrev;
-  //e.Curr = pt;
-  e.Curr.X = pt.X;
-  e.Curr.Y = pt.Y;
-  e.OutIdx = -1;
-};
-ClipperLib.ClipperBase.prototype.InitEdge2 = function (e, polyType)
-{
-  if (e.Curr.Y >= e.Next.Curr.Y)
-  {
-    //e.Bot = e.Curr;
-    e.Bot.X = e.Curr.X;
-    e.Bot.Y = e.Curr.Y;
-    //e.Top = e.Next.Curr;
-    e.Top.X = e.Next.Curr.X;
-    e.Top.Y = e.Next.Curr.Y;
-  }
-  else
-  {
-    //e.Top = e.Curr;
-    e.Top.X = e.Curr.X;
-    e.Top.Y = e.Curr.Y;
-    //e.Bot = e.Next.Curr;
-    e.Bot.X = e.Next.Curr.X;
-    e.Bot.Y = e.Next.Curr.Y;
-  }
-  this.SetDx(e);
-  e.PolyTyp = polyType;
-};
-ClipperLib.ClipperBase.prototype.FindNextLocMin = function (E)
-{
-  var E2;
-  for (;;)
-  {
-    while (ClipperLib.IntPoint.op_Inequality(E.Bot, E.Prev.Bot) || ClipperLib.IntPoint.op_Equality(E.Curr, E.Top))
-      E = E.Next;
-    if (E.Dx != ClipperLib.ClipperBase.horizontal && E.Prev.Dx != ClipperLib.ClipperBase.horizontal)
-      break;
-    while (E.Prev.Dx == ClipperLib.ClipperBase.horizontal)
-      E = E.Prev;
-    E2 = E;
-    while (E.Dx == ClipperLib.ClipperBase.horizontal)
-      E = E.Next;
-    if (E.Top.Y == E.Prev.Bot.Y)
-      continue;
-    //ie just an intermediate horz.
-    if (E2.Prev.Bot.X < E.Bot.X)
-      E = E2;
-    break;
-  }
-  return E;
-};
-ClipperLib.ClipperBase.prototype.ProcessBound = function (E, IsClockwise)
-{
-  var EStart = E,
-    Result = E;
-  var Horz;
-  var StartX;
-  if (E.Dx == ClipperLib.ClipperBase.horizontal)
-  {
-    //it's possible for adjacent overlapping horz edges to start heading left
-    //before finishing right, so ...
-    if (IsClockwise)
-      StartX = E.Prev.Bot.X;
-    else
-      StartX = E.Next.Bot.X;
-    if (E.Bot.X != StartX)
-      this.ReverseHorizontal(E);
-  }
-  if (Result.OutIdx != ClipperLib.ClipperBase.Skip)
-  {
-    if (IsClockwise)
-    {
-      while (Result.Top.Y == Result.Next.Bot.Y && Result.Next.OutIdx != ClipperLib.ClipperBase.Skip)
-        Result = Result.Next;
-      if (Result.Dx == ClipperLib.ClipperBase.horizontal && Result.Next.OutIdx != ClipperLib.ClipperBase.Skip)
-      {
-        //nb: at the top of a bound, horizontals are added to the bound
-        //only when the preceding edge attaches to the horizontal's left vertex
-        //unless a Skip edge is encountered when that becomes the top divide
-        Horz = Result;
-        while (Horz.Prev.Dx == ClipperLib.ClipperBase.horizontal)
-          Horz = Horz.Prev;
-        if (Horz.Prev.Top.X == Result.Next.Top.X)
-        {
-          if (!IsClockwise)
-            Result = Horz.Prev;
+
+/**
+ * Sets a time limit on an asynchronous function. If the function does not call
+ * its callback within the specified milliseconds, it will be called with a
+ * timeout error. The code property for the error object will be `'ETIMEDOUT'`.
+ *
+ * @name timeout
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @category Util
+ * @param {Function} asyncFn - The asynchronous function you want to set the
+ * time limit.
+ * @param {number} milliseconds - The specified time limit.
+ * @param {*} [info] - Any variable you want attached (`string`, `object`, etc)
+ * to timeout Error for more information..
+ * @returns {Function} Returns a wrapped function that can be used with any of
+ * the control flow functions. Invoke this function with the same
+ * parameters as you would `asyncFunc`.
+ * @example
+ *
+ * function myFunction(foo, callback) {
+ *     doAsyncTask(foo, function(err, data) {
+ *         // handle errors
+ *         if (err) return callback(err);
+ *
+ *         // do some stuff ...
+ *
+ *         // return processed data
+ *         return callback(null, data);
+ *     });
+ * }
+ *
+ * var wrapped = async.timeout(myFunction, 1000);
+ *
+ * // call `wrapped` as you would `myFunction`
+ * wrapped({ bar: 'bar' }, function(err, data) {
+ *     // if `myFunction` takes < 1000 ms to execute, `err`
+ *     // and `data` will have their expected values
+ *
+ *     // else `err` will be an Error with the code 'ETIMEDOUT'
+ * });
+ */
+function timeout(asyncFn, milliseconds, info) {
+    var originalCallback, timer;
+    var timedOut = false;
+
+    function injectedCallback() {
+        if (!timedOut) {
+            originalCallback.apply(null, arguments);
+            clearTimeout(timer);
         }
-        else if (Horz.Prev.Top.X > Result.Next.Top.X)
-          Result = Horz.Prev;
-      }
-      while (E != Result)
-      {
-        E.NextInLML = E.Next;
-        if (E.Dx == ClipperLib.ClipperBase.horizontal && E != EStart && E.Bot.X != E.Prev.Top.X)
-          this.ReverseHorizontal(E);
-        E = E.Next;
-      }
-      if (E.Dx == ClipperLib.ClipperBase.horizontal && E != EStart && E.Bot.X != E.Prev.Top.X)
-        this.ReverseHorizontal(E);
-      Result = Result.Next;
-      //move to the edge just beyond current bound
     }
-    else
-    {
-      while (Result.Top.Y == Result.Prev.Bot.Y && Result.Prev.OutIdx != ClipperLib.ClipperBase.Skip)
-        Result = Result.Prev;
-      if (Result.Dx == ClipperLib.ClipperBase.horizontal && Result.Prev.OutIdx != ClipperLib.ClipperBase.Skip)
-      {
-        Horz = Result;
-        while (Horz.Next.Dx == ClipperLib.ClipperBase.horizontal)
-          Horz = Horz.Next;
-        if (Horz.Next.Top.X == Result.Prev.Top.X)
-        {
-          if (!IsClockwise)
-            Result = Horz.Next;
+
+    function timeoutCallback() {
+        var name = asyncFn.name || 'anonymous';
+        var error = new Error('Callback function "' + name + '" timed out.');
+        error.code = 'ETIMEDOUT';
+        if (info) {
+            error.info = info;
         }
-        else if (Horz.Next.Top.X > Result.Prev.Top.X)
-          Result = Horz.Next;
-      }
-      while (E != Result)
-      {
-        E.NextInLML = E.Prev;
-        if (E.Dx == ClipperLib.ClipperBase.horizontal && E != EStart && E.Bot.X != E.Next.Top.X)
-          this.ReverseHorizontal(E);
-        E = E.Prev;
-      }
-      if (E.Dx == ClipperLib.ClipperBase.horizontal && E != EStart && E.Bot.X != E.Next.Top.X)
-        this.ReverseHorizontal(E);
-      Result = Result.Prev;
-      //move to the edge just beyond current bound
-    }
-  }
-  if (Result.OutIdx == ClipperLib.ClipperBase.Skip)
-  {
-    //if edges still remain in the current bound beyond the skip edge then
-    //create another LocMin and call ProcessBound once more
-    E = Result;
-    if (IsClockwise)
-    {
-      while (E.Top.Y == E.Next.Bot.Y)
-        E = E.Next;
-      //don't include top horizontals when parsing a bound a second time,
-      //they will be contained in the opposite bound ...
-      while (E != Result && E.Dx == ClipperLib.ClipperBase.horizontal)
-        E = E.Prev;
-    }
-    else
-    {
-      while (E.Top.Y == E.Prev.Bot.Y)
-        E = E.Prev;
-      while (E != Result && E.Dx == ClipperLib.ClipperBase.horizontal)
-        E = E.Next;
-    }
-    if (E == Result)
-    {
-      if (IsClockwise)
-        Result = E.Next;
-      else
-        Result = E.Prev;
-    }
-    else
-    {
-      //there are more edges in the bound beyond result starting with E
-      if (IsClockwise)
-        E = Result.Next;
-      else
-        E = Result.Prev;
-      var locMin = new ClipperLib.LocalMinima();
-      locMin.Next = null;
-      locMin.Y = E.Bot.Y;
-      locMin.LeftBound = null;
-      locMin.RightBound = E;
-      locMin.RightBound.WindDelta = 0;
-      Result = this.ProcessBound(locMin.RightBound, IsClockwise);
-      this.InsertLocalMinima(locMin);
+        timedOut = true;
+        originalCallback(error);
     }
-  }
-  return Result;
-};
-ClipperLib.ClipperBase.prototype.AddPath = function (pg, polyType, Closed)
-{
-  if (use_lines)
-  {
-    if (!Closed && polyType == ClipperLib.PolyType.ptClip)
-      ClipperLib.Error("AddPath: Open paths must be subject.");
-  }
-  else
-  {
-    if (!Closed)
-      ClipperLib.Error("AddPath: Open paths have been disabled.");
-  }
-  var highI = pg.length - 1;
-  if (Closed)
-    while (highI > 0 && (ClipperLib.IntPoint.op_Equality(pg[highI], pg[0])))
-  --highI;
-  while (highI > 0 && (ClipperLib.IntPoint.op_Equality(pg[highI], pg[highI - 1])))
-  --highI;
-  if ((Closed && highI < 2) || (!Closed && highI < 1))
-    return false;
-  //create a new edge array ...
-  var edges = new Array();
-  for (var i = 0; i <= highI; i++)
-    edges.push(new ClipperLib.TEdge());
-  var IsFlat = true;
-  //1. Basic (first) edge initialization ...
-
-  //edges[1].Curr = pg[1];
-  edges[1].Curr.X = pg[1].X;
-  edges[1].Curr.Y = pg[1].Y;
 
-  var $1 = {Value: this.m_UseFullRange};
-  this.RangeTest(pg[0], $1);
-  this.m_UseFullRange = $1.Value;
+    return initialParams(function (args, origCallback) {
+        originalCallback = origCallback;
+        // setup timer and call original function
+        timer = setTimeout(timeoutCallback, milliseconds);
+        asyncFn.apply(null, args.concat(injectedCallback));
+    });
+}
 
-  $1.Value = this.m_UseFullRange;
-  this.RangeTest(pg[highI], $1);
-  this.m_UseFullRange = $1.Value;
+/* Built-in method references for those with the same name as other `lodash` methods. */
+var nativeCeil = Math.ceil;
+var nativeMax$1 = Math.max;
 
-  this.InitEdge(edges[0], edges[1], edges[highI], pg[0]);
-  this.InitEdge(edges[highI], edges[0], edges[highI - 1], pg[highI]);
-  for (var i = highI - 1; i >= 1; --i)
-  {
-    $1.Value = this.m_UseFullRange;
-    this.RangeTest(pg[i], $1);
-    this.m_UseFullRange = $1.Value;
+/**
+ * The base implementation of `_.range` and `_.rangeRight` which doesn't
+ * coerce arguments.
+ *
+ * @private
+ * @param {number} start The start of the range.
+ * @param {number} end The end of the range.
+ * @param {number} step The value to increment or decrement by.
+ * @param {boolean} [fromRight] Specify iterating from right to left.
+ * @returns {Array} Returns the range of numbers.
+ */
+function baseRange(start, end, step, fromRight) {
+  var index = -1,
+      length = nativeMax$1(nativeCeil((end - start) / (step || 1)), 0),
+      result = Array(length);
 
-    this.InitEdge(edges[i], edges[i + 1], edges[i - 1], pg[i]);
+  while (length--) {
+    result[fromRight ? length : ++index] = start;
+    start += step;
   }
+  return result;
+}
 
-  var eStart = edges[0];
-  //2. Remove duplicate vertices, and (when closed) collinear edges ...
-  var E = eStart,
-    eLoopStop = eStart;
-  for (;;)
-  {
-    if (ClipperLib.IntPoint.op_Equality(E.Curr, E.Next.Curr))
-    {
-      if (E == E.Next)
-        break;
-      if (E == eStart)
-        eStart = E.Next;
-      E = this.RemoveEdge(E);
-      eLoopStop = E;
-      continue;
-    }
-    if (E.Prev == E.Next)
-      break;
-    else if (Closed && ClipperLib.ClipperBase.SlopesEqual(E.Prev.Curr, E.Curr, E.Next.Curr, this.m_UseFullRange) && (!this.PreserveCollinear || !this.Pt2IsBetweenPt1AndPt3(E.Prev.Curr, E.Curr, E.Next.Curr)))
-    {
-      //Collinear edges are allowed for open paths but in closed paths
-      //the default is to merge adjacent collinear edges into a single edge.
-      //However, if the PreserveCollinear property is enabled, only overlapping
-      //collinear edges (ie spikes) will be removed from closed paths.
-      if (E == eStart)
-        eStart = E.Next;
-      E = this.RemoveEdge(E);
-      E = E.Prev;
-      eLoopStop = E;
-      continue;
-    }
-    E = E.Next;
-    if (E == eLoopStop)
-      break;
-  }
-  if ((!Closed && (E == E.Next)) || (Closed && (E.Prev == E.Next)))
-    return false;
-  if (!Closed)
-  {
-    this.m_HasOpenPaths = true;
-    eStart.Prev.OutIdx = ClipperLib.ClipperBase.Skip;
-  }
-  //3. Do second stage of edge initialization ...
-  var eHighest = eStart;
-  E = eStart;
-  do {
-    this.InitEdge2(E, polyType);
-    E = E.Next;
-    if (IsFlat && E.Curr.Y != eStart.Curr.Y)
-      IsFlat = false;
-  }
-  while (E != eStart)
-  //4. Finally, add edge bounds to LocalMinima list ...
-  //Totally flat paths must be handled differently when adding them
-  //to LocalMinima list to avoid endless loops etc ...
-  if (IsFlat)
-  {
-    if (Closed)
-      return false;
-    E.Prev.OutIdx = ClipperLib.ClipperBase.Skip;
-    if (E.Prev.Bot.X < E.Prev.Top.X)
-      this.ReverseHorizontal(E.Prev);
-    var locMin = new ClipperLib.LocalMinima();
-    locMin.Next = null;
-    locMin.Y = E.Bot.Y;
-    locMin.LeftBound = null;
-    locMin.RightBound = E;
-    locMin.RightBound.Side = ClipperLib.EdgeSide.esRight;
-    locMin.RightBound.WindDelta = 0;
-    while (E.Next.OutIdx != ClipperLib.ClipperBase.Skip)
-    {
-      E.NextInLML = E.Next;
-      if (E.Bot.X != E.Prev.Top.X)
-        this.ReverseHorizontal(E);
-      E = E.Next;
-    }
-    this.InsertLocalMinima(locMin);
-    this.m_edges.push(edges);
-    return true;
-  }
-  this.m_edges.push(edges);
-  var clockwise;
-  var EMin = null;
-  for (;;)
-  {
-    E = this.FindNextLocMin(E);
-    if (E == EMin)
-      break;
-    else if (EMin == null)
-      EMin = E;
-    //E and E.Prev now share a local minima (left aligned if horizontal).
-    //Compare their slopes to find which starts which bound ...
-    var locMin = new ClipperLib.LocalMinima();
-    locMin.Next = null;
-    locMin.Y = E.Bot.Y;
-    if (E.Dx < E.Prev.Dx)
-    {
-      locMin.LeftBound = E.Prev;
-      locMin.RightBound = E;
-      clockwise = false;
-      //Q.nextInLML = Q.prev
-    }
-    else
-    {
-      locMin.LeftBound = E;
-      locMin.RightBound = E.Prev;
-      clockwise = true;
-      //Q.nextInLML = Q.next
-    }
-    locMin.LeftBound.Side = ClipperLib.EdgeSide.esLeft;
-    locMin.RightBound.Side = ClipperLib.EdgeSide.esRight;
-    if (!Closed)
-      locMin.LeftBound.WindDelta = 0;
-    else if (locMin.LeftBound.Next == locMin.RightBound)
-      locMin.LeftBound.WindDelta = -1;
-    else
-      locMin.LeftBound.WindDelta = 1;
-    locMin.RightBound.WindDelta = -locMin.LeftBound.WindDelta;
-    E = this.ProcessBound(locMin.LeftBound, clockwise);
-    var E2 = this.ProcessBound(locMin.RightBound, !clockwise);
-    if (locMin.LeftBound.OutIdx == ClipperLib.ClipperBase.Skip)
-      locMin.LeftBound = null;
-    else if (locMin.RightBound.OutIdx == ClipperLib.ClipperBase.Skip)
-      locMin.RightBound = null;
-    this.InsertLocalMinima(locMin);
-    if (!clockwise)
-      E = E2;
-  }
-  return true;
-};
-ClipperLib.ClipperBase.prototype.AddPaths = function (ppg, polyType, closed)
-{
-  //  console.log("-------------------------------------------");
-  //  console.log(JSON.stringify(ppg));
-  var result = false;
-  for (var i = 0, ilen = ppg.length; i < ilen; ++i)
-    if (this.AddPath(ppg[i], polyType, closed))
-      result = true;
-  return result;
-};
-//------------------------------------------------------------------------------
-ClipperLib.ClipperBase.prototype.Pt2IsBetweenPt1AndPt3 = function (pt1, pt2, pt3)
-{
-  if ((ClipperLib.IntPoint.op_Equality(pt1, pt3)) || (ClipperLib.IntPoint.op_Equality(pt1, pt2)) ||
-    (ClipperLib.IntPoint.op_Equality(pt3, pt2)))
-    return false;
-  else if (pt1.X != pt3.X)
-    return (pt2.X > pt1.X) == (pt2.X < pt3.X);
-  else
-    return (pt2.Y > pt1.Y) == (pt2.Y < pt3.Y);
-};
-ClipperLib.ClipperBase.prototype.RemoveEdge = function (e)
-{
-  //removes e from double_linked_list (but without removing from memory)
-  e.Prev.Next = e.Next;
-  e.Next.Prev = e.Prev;
-  var result = e.Next;
-  e.Prev = null; //flag as removed (see ClipperBase.Clear)
-  return result;
-};
-ClipperLib.ClipperBase.prototype.SetDx = function (e)
-{
-  e.Delta.X = (e.Top.X - e.Bot.X);
-  e.Delta.Y = (e.Top.Y - e.Bot.Y);
-  if (e.Delta.Y === 0) e.Dx = ClipperLib.ClipperBase.horizontal;
-  else e.Dx = (e.Delta.X) / (e.Delta.Y);
-};
-ClipperLib.ClipperBase.prototype.InsertLocalMinima = function (newLm)
-{
-  if (this.m_MinimaList === null)
-  {
-    this.m_MinimaList = newLm;
-  }
-  else if (newLm.Y >= this.m_MinimaList.Y)
-  {
-    newLm.Next = this.m_MinimaList;
-    this.m_MinimaList = newLm;
-  }
-  else
-  {
-    var tmpLm = this.m_MinimaList;
-    while (tmpLm.Next !== null && (newLm.Y < tmpLm.Next.Y))
-      tmpLm = tmpLm.Next;
-    newLm.Next = tmpLm.Next;
-    tmpLm.Next = newLm;
-  }
-};
-ClipperLib.ClipperBase.prototype.PopLocalMinima = function ()
-{
-  if (this.m_CurrentLM === null)
-    return;
-  this.m_CurrentLM = this.m_CurrentLM.Next;
-};
-ClipperLib.ClipperBase.prototype.ReverseHorizontal = function (e)
-{
-  //swap horizontal edges' top and bottom x's so they follow the natural
-  //progression of the bounds - ie so their xbots will align with the
-  //adjoining lower edge. [Helpful in the ProcessHorizontal() method.]
-  var tmp = e.Top.X;
-  e.Top.X = e.Bot.X;
-  e.Bot.X = tmp;
-  if (use_xyz)
-  {
-    tmp = e.Top.Z;
-    e.Top.Z = e.Bot.Z;
-    e.Bot.Z = tmp;
-  }
-};
-ClipperLib.ClipperBase.prototype.Reset = function ()
-{
-  this.m_CurrentLM = this.m_MinimaList;
-  if (this.m_CurrentLM == null)
-    return;
-  //ie nothing to process
-  //reset all edges ...
-  var lm = this.m_MinimaList;
-  while (lm != null)
-  {
-    var e = lm.LeftBound;
-    if (e != null)
-    {
-      //e.Curr = e.Bot;
-      e.Curr.X = e.Bot.X;
-      e.Curr.Y = e.Bot.Y;
-      e.Side = ClipperLib.EdgeSide.esLeft;
-      e.OutIdx = ClipperLib.ClipperBase.Unassigned;
-    }
-    e = lm.RightBound;
-    if (e != null)
-    {
-      //e.Curr = e.Bot;
-      e.Curr.X = e.Bot.X;
-      e.Curr.Y = e.Bot.Y;
-      e.Side = ClipperLib.EdgeSide.esRight;
-      e.OutIdx = ClipperLib.ClipperBase.Unassigned;
-    }
-    lm = lm.Next;
-  }
-};
-ClipperLib.Clipper = function (InitOptions) // public Clipper(int InitOptions = 0)
-{
-  if (typeof (InitOptions) == "undefined") InitOptions = 0;
-  this.m_PolyOuts = null;
-  this.m_ClipType = ClipperLib.ClipType.ctIntersection;
-  this.m_Scanbeam = null;
-  this.m_ActiveEdges = null;
-  this.m_SortedEdges = null;
-  this.m_IntersectList = null;
-  this.m_IntersectNodeComparer = null;
-  this.m_ExecuteLocked = false;
-  this.m_ClipFillType = ClipperLib.PolyFillType.pftEvenOdd;
-  this.m_SubjFillType = ClipperLib.PolyFillType.pftEvenOdd;
-  this.m_Joins = null;
-  this.m_GhostJoins = null;
-  this.m_UsingPolyTree = false;
-  this.ReverseSolution = false;
-  this.StrictlySimple = false;
-  ClipperLib.ClipperBase.call(this);
-  this.m_Scanbeam = null;
-  this.m_ActiveEdges = null;
-  this.m_SortedEdges = null;
-  this.m_IntersectList = new Array();
-  this.m_IntersectNodeComparer = ClipperLib.MyIntersectNodeSort.Compare;
-  this.m_ExecuteLocked = false;
-  this.m_UsingPolyTree = false;
-  this.m_PolyOuts = new Array();
-  this.m_Joins = new Array();
-  this.m_GhostJoins = new Array();
-  this.ReverseSolution = (1 & InitOptions) !== 0;
-  this.StrictlySimple = (2 & InitOptions) !== 0;
-  this.PreserveCollinear = (4 & InitOptions) !== 0;
-  if (use_xyz)
-  {
-    this.ZFillFunction = null; // function (IntPoint vert1, IntPoint vert2, ref IntPoint intersectPt);
-  }
-};
-ClipperLib.Clipper.ioReverseSolution = 1;
-ClipperLib.Clipper.ioStrictlySimple = 2;
-ClipperLib.Clipper.ioPreserveCollinear = 4;
+/**
+ * The same as [times]{@link module:ControlFlow.times} but runs a maximum of `limit` async operations at a
+ * time.
+ *
+ * @name timesLimit
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.times]{@link module:ControlFlow.times}
+ * @category Control Flow
+ * @param {number} count - The number of times to run the function.
+ * @param {number} limit - The maximum number of async operations at a time.
+ * @param {Function} iteratee - The function to call `n` times. Invoked with the
+ * iteration index and a callback (n, next).
+ * @param {Function} callback - see [async.map]{@link module:Collections.map}.
+ */
+function timeLimit(count, limit, iteratee, callback) {
+  mapLimit(baseRange(0, count, 1), limit, iteratee, callback);
+}
 
-ClipperLib.Clipper.prototype.Clear = function ()
-{
-  if (this.m_edges.length === 0)
-    return;
-  //avoids problems with ClipperBase destructor
-  this.DisposeAllPolyPts();
-  ClipperLib.ClipperBase.prototype.Clear.call(this);
-};
+/**
+ * Calls the `iteratee` function `n` times, and accumulates results in the same
+ * manner you would use with [map]{@link module:Collections.map}.
+ *
+ * @name times
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.map]{@link module:Collections.map}
+ * @category Control Flow
+ * @param {number} n - The number of times to run the function.
+ * @param {Function} iteratee - The function to call `n` times. Invoked with the
+ * iteration index and a callback (n, next).
+ * @param {Function} callback - see {@link module:Collections.map}.
+ * @example
+ *
+ * // Pretend this is some complicated async factory
+ * var createUser = function(id, callback) {
+ *     callback(null, {
+ *         id: 'user' + id
+ *     });
+ * };
+ *
+ * // generate 5 users
+ * async.times(5, function(n, next) {
+ *     createUser(n, function(err, user) {
+ *         next(err, user);
+ *     });
+ * }, function(err, users) {
+ *     // we should now have 5 users
+ * });
+ */
+var times = doLimit(timeLimit, Infinity);
 
-ClipperLib.Clipper.prototype.DisposeScanbeamList = function ()
-{
-  while (this.m_Scanbeam !== null)
-  {
-    var sb2 = this.m_Scanbeam.Next;
-    this.m_Scanbeam = null;
-    this.m_Scanbeam = sb2;
-  }
-};
-ClipperLib.Clipper.prototype.Reset = function ()
-{
-  ClipperLib.ClipperBase.prototype.Reset.call(this);
-  this.m_Scanbeam = null;
-  this.m_ActiveEdges = null;
-  this.m_SortedEdges = null;
+/**
+ * The same as [times]{@link module:ControlFlow.times} but runs only a single async operation at a time.
+ *
+ * @name timesSeries
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.times]{@link module:ControlFlow.times}
+ * @category Control Flow
+ * @param {number} n - The number of times to run the function.
+ * @param {Function} iteratee - The function to call `n` times. Invoked with the
+ * iteration index and a callback (n, next).
+ * @param {Function} callback - see {@link module:Collections.map}.
+ */
+var timesSeries = doLimit(timeLimit, 1);
 
-  var lm = this.m_MinimaList;
-  while (lm !== null)
-  {
-    this.InsertScanbeam(lm.Y);
-    lm = lm.Next;
-  }
-};
-ClipperLib.Clipper.prototype.InsertScanbeam = function (Y)
-{
-  if (this.m_Scanbeam === null)
-  {
-    this.m_Scanbeam = new ClipperLib.Scanbeam();
-    this.m_Scanbeam.Next = null;
-    this.m_Scanbeam.Y = Y;
-  }
-  else if (Y > this.m_Scanbeam.Y)
-  {
-    var newSb = new ClipperLib.Scanbeam();
-    newSb.Y = Y;
-    newSb.Next = this.m_Scanbeam;
-    this.m_Scanbeam = newSb;
-  }
-  else
-  {
-    var sb2 = this.m_Scanbeam;
-    while (sb2.Next !== null && (Y <= sb2.Next.Y))
-      sb2 = sb2.Next;
-    if (Y == sb2.Y)
-      return;
-    //ie ignores duplicates
-    var newSb = new ClipperLib.Scanbeam();
-    newSb.Y = Y;
-    newSb.Next = sb2.Next;
-    sb2.Next = newSb;
-  }
-};
-// ************************************
-ClipperLib.Clipper.prototype.Execute = function ()
-{
-  var a = arguments,
-    alen = a.length,
-    ispolytree = a[1] instanceof ClipperLib.PolyTree;
-  if (alen == 4 && !ispolytree) // function (clipType, solution, subjFillType, clipFillType)
-  {
-    var clipType = a[0],
-      solution = a[1],
-      subjFillType = a[2],
-      clipFillType = a[3];
-    if (this.m_ExecuteLocked)
-      return false;
-    if (this.m_HasOpenPaths)
-      ClipperLib.Error("Error: PolyTree struct is need for open path clipping.");
-    this.m_ExecuteLocked = true;
-    ClipperLib.Clear(solution);
-    this.m_SubjFillType = subjFillType;
-    this.m_ClipFillType = clipFillType;
-    this.m_ClipType = clipType;
-    this.m_UsingPolyTree = false;
-    try
-    {
-      var succeeded = this.ExecuteInternal();
-      //build the return polygons ...
-      if (succeeded) this.BuildResult(solution);
-    }
-    finally
-    {
-      this.DisposeAllPolyPts();
-      this.m_ExecuteLocked = false;
-    }
-    return succeeded;
-  }
-  else if (alen == 4 && ispolytree) // function (clipType, polytree, subjFillType, clipFillType)
-  {
-    var clipType = a[0],
-      polytree = a[1],
-      subjFillType = a[2],
-      clipFillType = a[3];
-    if (this.m_ExecuteLocked)
-      return false;
-    this.m_ExecuteLocked = true;
-    this.m_SubjFillType = subjFillType;
-    this.m_ClipFillType = clipFillType;
-    this.m_ClipType = clipType;
-    this.m_UsingPolyTree = true;
-    try
-    {
-      var succeeded = this.ExecuteInternal();
-      //build the return polygons ...
-      if (succeeded) this.BuildResult2(polytree);
-    }
-    finally
-    {
-      this.DisposeAllPolyPts();
-      this.m_ExecuteLocked = false;
-    }
-    return succeeded;
-  }
-  else if (alen == 2 && !ispolytree) // function (clipType, solution)
-  {
-    var clipType = a[0],
-      solution = a[1];
-    return this.Execute(clipType, solution, ClipperLib.PolyFillType.pftEvenOdd, ClipperLib.PolyFillType.pftEvenOdd);
-  }
-  else if (alen == 2 && ispolytree) // function (clipType, polytree)
-  {
-    var clipType = a[0],
-      polytree = a[1];
-    return this.Execute(clipType, polytree, ClipperLib.PolyFillType.pftEvenOdd, ClipperLib.PolyFillType.pftEvenOdd);
-  }
-};
-ClipperLib.Clipper.prototype.FixHoleLinkage = function (outRec)
-{
-  //skip if an outermost polygon or
-  //already already points to the correct FirstLeft ...
-  if (outRec.FirstLeft === null || (outRec.IsHole != outRec.FirstLeft.IsHole && outRec.FirstLeft.Pts !== null))
-    return;
-  var orfl = outRec.FirstLeft;
-  while (orfl !== null && ((orfl.IsHole == outRec.IsHole) || orfl.Pts === null))
-    orfl = orfl.FirstLeft;
-  outRec.FirstLeft = orfl;
-};
-ClipperLib.Clipper.prototype.ExecuteInternal = function ()
-{
-  try
-  {
-    this.Reset();
-    if (this.m_CurrentLM === null)
-      return false;
-    var botY = this.PopScanbeam();
-    do {
-      this.InsertLocalMinimaIntoAEL(botY);
-      ClipperLib.Clear(this.m_GhostJoins);
-      this.ProcessHorizontals(false);
-      if (this.m_Scanbeam === null)
-        break;
-      var topY = this.PopScanbeam();
-      //console.log("botY:" + botY + ", topY:" + topY);
-      if (!this.ProcessIntersections(botY, topY))
-        return false;
-      this.ProcessEdgesAtTopOfScanbeam(topY);
-      botY = topY;
-    }
-    while (this.m_Scanbeam !== null || this.m_CurrentLM !== null)
-    //fix orientations ...
-    for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
-    {
-      var outRec = this.m_PolyOuts[i];
-      if (outRec.Pts === null || outRec.IsOpen)
-        continue;
-      if ((outRec.IsHole ^ this.ReverseSolution) == (this.Area(outRec) > 0))
-        this.ReversePolyPtLinks(outRec.Pts);
-    }
-    this.JoinCommonEdges();
-    for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
-    {
-      var outRec = this.m_PolyOuts[i];
-      if (outRec.Pts !== null && !outRec.IsOpen)
-        this.FixupOutPolygon(outRec);
-    }
-    if (this.StrictlySimple)
-      this.DoSimplePolygons();
-    return true;
-  }
-  finally
-  {
-    ClipperLib.Clear(this.m_Joins);
-    ClipperLib.Clear(this.m_GhostJoins);
-  }
-};
-ClipperLib.Clipper.prototype.PopScanbeam = function ()
-{
-  var Y = this.m_Scanbeam.Y;
-  var sb2 = this.m_Scanbeam;
-  this.m_Scanbeam = this.m_Scanbeam.Next;
-  sb2 = null;
-  return Y;
-};
-ClipperLib.Clipper.prototype.DisposeAllPolyPts = function ()
-{
-  for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; ++i)
-    this.DisposeOutRec(i);
-  ClipperLib.Clear(this.m_PolyOuts);
-};
-ClipperLib.Clipper.prototype.DisposeOutRec = function (index)
-{
-  var outRec = this.m_PolyOuts[index];
-  if (outRec.Pts !== null)
-    this.DisposeOutPts(outRec.Pts);
-  outRec = null;
-  this.m_PolyOuts[index] = null;
-};
-ClipperLib.Clipper.prototype.DisposeOutPts = function (pp)
-{
-  if (pp === null)
-    return;
-  var tmpPp = null;
-  pp.Prev.Next = null;
-  while (pp !== null)
-  {
-    tmpPp = pp;
-    pp = pp.Next;
-    tmpPp = null;
-  }
-};
-ClipperLib.Clipper.prototype.AddJoin = function (Op1, Op2, OffPt)
-{
-  var j = new ClipperLib.Join();
-  j.OutPt1 = Op1;
-  j.OutPt2 = Op2;
-  //j.OffPt = OffPt;
-  j.OffPt.X = OffPt.X;
-  j.OffPt.Y = OffPt.Y;
-  this.m_Joins.push(j);
-};
-ClipperLib.Clipper.prototype.AddGhostJoin = function (Op, OffPt)
-{
-  var j = new ClipperLib.Join();
-  j.OutPt1 = Op;
-  //j.OffPt = OffPt;
-  j.OffPt.X = OffPt.X;
-  j.OffPt.Y = OffPt.Y;
-  this.m_GhostJoins.push(j);
-};
-if (use_xyz)
-{
-  ClipperLib.Clipper.prototype.SetZ = function (pt, e)
-  {
-    pt.Z = 0;
-    if (this.ZFillFunction !== null)
-    {
-      //put the 'preferred' point as first parameter ...
-      if (e.OutIdx < 0)
-        this.ZFillFunction(e.Bot, e.Top, pt); //outside a path so presume entering
-      else
-        this.ZFillFunction(e.Top, e.Bot, pt); //inside a path so presume exiting
-    }
-  };
-  //------------------------------------------------------------------------------
+/**
+ * A relative of `reduce`.  Takes an Object or Array, and iterates over each
+ * element in series, each step potentially mutating an `accumulator` value.
+ * The type of the accumulator defaults to the type of collection passed in.
+ *
+ * @name transform
+ * @static
+ * @memberOf module:Collections
+ * @method
+ * @category Collection
+ * @param {Array|Iterable|Object} coll - A collection to iterate over.
+ * @param {*} [accumulator] - The initial state of the transform.  If omitted,
+ * it will default to an empty Object or Array, depending on the type of `coll`
+ * @param {Function} iteratee - A function applied to each item in the
+ * collection that potentially modifies the accumulator. The `iteratee` is
+ * passed a `callback(err)` which accepts an optional error as its first
+ * argument. If an error is passed to the callback, the transform is stopped
+ * and the main `callback` is immediately called with the error.
+ * Invoked with (accumulator, item, key, callback).
+ * @param {Function} [callback] - A callback which is called after all the
+ * `iteratee` functions have finished. Result is the transformed accumulator.
+ * Invoked with (err, result).
+ * @example
+ *
+ * async.transform([1,2,3], function(acc, item, index, callback) {
+ *     // pointless async:
+ *     process.nextTick(function() {
+ *         acc.push(item * 2)
+ *         callback(null)
+ *     });
+ * }, function(err, result) {
+ *     // result is now equal to [2, 4, 6]
+ * });
+ *
+ * @example
+ *
+ * async.transform({a: 1, b: 2, c: 3}, function (obj, val, key, callback) {
+ *     setImmediate(function () {
+ *         obj[key] = val * 2;
+ *         callback();
+ *     })
+ * }, function (err, result) {
+ *     // result is equal to {a: 2, b: 4, c: 6}
+ * })
+ */
+function transform(coll, accumulator, iteratee, callback) {
+    if (arguments.length === 3) {
+        callback = iteratee;
+        iteratee = accumulator;
+        accumulator = isArray(coll) ? [] : {};
+    }
+    callback = once(callback || noop);
+
+    eachOf(coll, function (v, k, cb) {
+        iteratee(accumulator, v, k, cb);
+    }, function (err) {
+        callback(err, accumulator);
+    });
 }
-ClipperLib.Clipper.prototype.InsertLocalMinimaIntoAEL = function (botY)
-{
-  while (this.m_CurrentLM !== null && (this.m_CurrentLM.Y == botY))
-  {
-    var lb = this.m_CurrentLM.LeftBound;
-    var rb = this.m_CurrentLM.RightBound;
-    this.PopLocalMinima();
-    var Op1 = null;
-    if (lb === null)
-    {
-      this.InsertEdgeIntoAEL(rb, null);
-      this.SetWindingCount(rb);
-      if (this.IsContributing(rb))
-        Op1 = this.AddOutPt(rb, rb.Bot);
-    }
-    else if (rb == null)
-    {
-      this.InsertEdgeIntoAEL(lb, null);
-      this.SetWindingCount(lb);
-      if (this.IsContributing(lb))
-        Op1 = this.AddOutPt(lb, lb.Bot);
-      this.InsertScanbeam(lb.Top.Y);
-    }
-    else
-    {
-      this.InsertEdgeIntoAEL(lb, null);
-      this.InsertEdgeIntoAEL(rb, lb);
-      this.SetWindingCount(lb);
-      rb.WindCnt = lb.WindCnt;
-      rb.WindCnt2 = lb.WindCnt2;
-      if (this.IsContributing(lb))
-        Op1 = this.AddLocalMinPoly(lb, rb, lb.Bot);
-      this.InsertScanbeam(lb.Top.Y);
-    }
-    if (rb != null)
-    {
-      if (ClipperLib.ClipperBase.IsHorizontal(rb))
-        this.AddEdgeToSEL(rb);
-      else
-        this.InsertScanbeam(rb.Top.Y);
-    }
-    if (lb == null || rb == null) continue;
-    //if output polygons share an Edge with a horizontal rb, they'll need joining later ...
-    if (Op1 !== null && ClipperLib.ClipperBase.IsHorizontal(rb) && this.m_GhostJoins.length > 0 && rb.WindDelta !== 0)
-    {
-      for (var i = 0, ilen = this.m_GhostJoins.length; i < ilen; i++)
-      {
-        //if the horizontal Rb and a 'ghost' horizontal overlap, then convert
-        //the 'ghost' join to a real join ready for later ...
-        var j = this.m_GhostJoins[i];
-        if (this.HorzSegmentsOverlap(j.OutPt1.Pt, j.OffPt, rb.Bot, rb.Top))
-          this.AddJoin(j.OutPt1, Op1, j.OffPt);
-      }
-    }
-    if (lb.OutIdx >= 0 && lb.PrevInAEL !== null &&
-      lb.PrevInAEL.Curr.X == lb.Bot.X &&
-      lb.PrevInAEL.OutIdx >= 0 &&
-      ClipperLib.ClipperBase.SlopesEqual(lb.PrevInAEL, lb, this.m_UseFullRange) &&
-      lb.WindDelta !== 0 && lb.PrevInAEL.WindDelta !== 0)
-    {
-      var Op2 = this.AddOutPt(lb.PrevInAEL, lb.Bot);
-      this.AddJoin(Op1, Op2, lb.Top);
-    }
-    if (lb.NextInAEL != rb)
-    {
-      if (rb.OutIdx >= 0 && rb.PrevInAEL.OutIdx >= 0 &&
-        ClipperLib.ClipperBase.SlopesEqual(rb.PrevInAEL, rb, this.m_UseFullRange) &&
-        rb.WindDelta !== 0 && rb.PrevInAEL.WindDelta !== 0)
-      {
-        var Op2 = this.AddOutPt(rb.PrevInAEL, rb.Bot);
-        this.AddJoin(Op1, Op2, rb.Top);
-      }
-      var e = lb.NextInAEL;
-      if (e !== null)
-        while (e != rb)
-        {
-          //nb: For calculating winding counts etc, IntersectEdges() assumes
-          //that param1 will be to the right of param2 ABOVE the intersection ...
-          this.IntersectEdges(rb, e, lb.Curr, false);
-          //order important here
-          e = e.NextInAEL;
+
+/**
+ * Undoes a [memoize]{@link module:Utils.memoize}d function, reverting it to the original,
+ * unmemoized form. Handy for testing.
+ *
+ * @name unmemoize
+ * @static
+ * @memberOf module:Utils
+ * @method
+ * @see [async.memoize]{@link module:Utils.memoize}
+ * @category Util
+ * @param {Function} fn - the memoized function
+ * @returns {Function} a function that calls the original unmemoized function
+ */
+function unmemoize(fn) {
+    return function () {
+        return (fn.unmemoized || fn).apply(null, arguments);
+    };
+}
+
+/**
+ * Repeatedly call `iteratee`, while `test` returns `true`. Calls `callback` when
+ * stopped, or an error occurs.
+ *
+ * @name whilst
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Function} test - synchronous truth test to perform before each
+ * execution of `iteratee`. Invoked with ().
+ * @param {Function} iteratee - A function which is called each time `test` passes.
+ * The function is passed a `callback(err)`, which must be called once it has
+ * completed with an optional `err` argument. Invoked with (callback).
+ * @param {Function} [callback] - A callback which is called after the test
+ * function has failed and repeated execution of `iteratee` has stopped. `callback`
+ * will be passed an error and any arguments passed to the final `iteratee`'s
+ * callback. Invoked with (err, [results]);
+ * @returns undefined
+ * @example
+ *
+ * var count = 0;
+ * async.whilst(
+ *     function() { return count < 5; },
+ *     function(callback) {
+ *         count++;
+ *         setTimeout(function() {
+ *             callback(null, count);
+ *         }, 1000);
+ *     },
+ *     function (err, n) {
+ *         // 5 seconds have passed, n = 5
+ *     }
+ * );
+ */
+function whilst(test, iteratee, callback) {
+    callback = onlyOnce(callback || noop);
+    if (!test()) return callback(null);
+    var next = rest(function (err, args) {
+        if (err) return callback(err);
+        if (test()) return iteratee(next);
+        callback.apply(null, [null].concat(args));
+    });
+    iteratee(next);
+}
+
+/**
+ * Repeatedly call `fn` until `test` returns `true`. Calls `callback` when
+ * stopped, or an error occurs. `callback` will be passed an error and any
+ * arguments passed to the final `fn`'s callback.
+ *
+ * The inverse of [whilst]{@link module:ControlFlow.whilst}.
+ *
+ * @name until
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @see [async.whilst]{@link module:ControlFlow.whilst}
+ * @category Control Flow
+ * @param {Function} test - synchronous truth test to perform before each
+ * execution of `fn`. Invoked with ().
+ * @param {Function} fn - A function which is called each time `test` fails.
+ * The function is passed a `callback(err)`, which must be called once it has
+ * completed with an optional `err` argument. Invoked with (callback).
+ * @param {Function} [callback] - A callback which is called after the test
+ * function has passed and repeated execution of `fn` has stopped. `callback`
+ * will be passed an error and any arguments passed to the final `fn`'s
+ * callback. Invoked with (err, [results]);
+ */
+function until(test, fn, callback) {
+    whilst(function () {
+        return !test.apply(this, arguments);
+    }, fn, callback);
+}
+
+/**
+ * Runs the `tasks` array of functions in series, each passing their results to
+ * the next in the array. However, if any of the `tasks` pass an error to their
+ * own callback, the next function is not executed, and the main `callback` is
+ * immediately called with the error.
+ *
+ * @name waterfall
+ * @static
+ * @memberOf module:ControlFlow
+ * @method
+ * @category Control Flow
+ * @param {Array} tasks - An array of functions to run, each function is passed
+ * a `callback(err, result1, result2, ...)` it must call on completion. The
+ * first argument is an error (which can be `null`) and any further arguments
+ * will be passed as arguments in order to the next task.
+ * @param {Function} [callback] - An optional callback to run once all the
+ * functions have completed. This will be passed the results of the last task's
+ * callback. Invoked with (err, [results]).
+ * @returns undefined
+ * @example
+ *
+ * async.waterfall([
+ *     function(callback) {
+ *         callback(null, 'one', 'two');
+ *     },
+ *     function(arg1, arg2, callback) {
+ *         // arg1 now equals 'one' and arg2 now equals 'two'
+ *         callback(null, 'three');
+ *     },
+ *     function(arg1, callback) {
+ *         // arg1 now equals 'three'
+ *         callback(null, 'done');
+ *     }
+ * ], function (err, result) {
+ *     // result now equals 'done'
+ * });
+ *
+ * // Or, with named functions:
+ * async.waterfall([
+ *     myFirstFunction,
+ *     mySecondFunction,
+ *     myLastFunction,
+ * ], function (err, result) {
+ *     // result now equals 'done'
+ * });
+ * function myFirstFunction(callback) {
+ *     callback(null, 'one', 'two');
+ * }
+ * function mySecondFunction(arg1, arg2, callback) {
+ *     // arg1 now equals 'one' and arg2 now equals 'two'
+ *     callback(null, 'three');
+ * }
+ * function myLastFunction(arg1, callback) {
+ *     // arg1 now equals 'three'
+ *     callback(null, 'done');
+ * }
+ */
+var waterfall = function (tasks, callback) {
+    callback = once(callback || noop);
+    if (!isArray(tasks)) return callback(new Error('First argument to waterfall must be an array of functions'));
+    if (!tasks.length) return callback();
+    var taskIndex = 0;
+
+    function nextTask(args) {
+        if (taskIndex === tasks.length) {
+            return callback.apply(null, [null].concat(args));
         }
+
+        var taskCallback = onlyOnce(rest(function (err, args) {
+            if (err) {
+                return callback.apply(null, [err].concat(args));
+            }
+            nextTask(args);
+        }));
+
+        args.push(taskCallback);
+
+        var task = tasks[taskIndex++];
+        task.apply(null, args);
     }
-  }
-};
-ClipperLib.Clipper.prototype.InsertEdgeIntoAEL = function (edge, startEdge)
-{
-  if (this.m_ActiveEdges === null)
-  {
-    edge.PrevInAEL = null;
-    edge.NextInAEL = null;
-    this.m_ActiveEdges = edge;
-  }
-  else if (startEdge === null && this.E2InsertsBeforeE1(this.m_ActiveEdges, edge))
-  {
-    edge.PrevInAEL = null;
-    edge.NextInAEL = this.m_ActiveEdges;
-    this.m_ActiveEdges.PrevInAEL = edge;
-    this.m_ActiveEdges = edge;
-  }
-  else
-  {
-    if (startEdge === null)
-      startEdge = this.m_ActiveEdges;
-    while (startEdge.NextInAEL !== null && !this.E2InsertsBeforeE1(startEdge.NextInAEL, edge))
-      startEdge = startEdge.NextInAEL;
-    edge.NextInAEL = startEdge.NextInAEL;
-    if (startEdge.NextInAEL !== null)
-      startEdge.NextInAEL.PrevInAEL = edge;
-    edge.PrevInAEL = startEdge;
-    startEdge.NextInAEL = edge;
-  }
-};
-ClipperLib.Clipper.prototype.E2InsertsBeforeE1 = function (e1, e2)
-{
-  if (e2.Curr.X == e1.Curr.X)
-  {
-    if (e2.Top.Y > e1.Top.Y)
-      return e2.Top.X < ClipperLib.Clipper.TopX(e1, e2.Top.Y);
-    else
-      return e1.Top.X > ClipperLib.Clipper.TopX(e2, e1.Top.Y);
-  }
-  else
-    return e2.Curr.X < e1.Curr.X;
-};
-ClipperLib.Clipper.prototype.IsEvenOddFillType = function (edge)
-{
-  if (edge.PolyTyp == ClipperLib.PolyType.ptSubject)
-    return this.m_SubjFillType == ClipperLib.PolyFillType.pftEvenOdd;
-  else
-    return this.m_ClipFillType == ClipperLib.PolyFillType.pftEvenOdd;
-};
-ClipperLib.Clipper.prototype.IsEvenOddAltFillType = function (edge)
-{
-  if (edge.PolyTyp == ClipperLib.PolyType.ptSubject)
-    return this.m_ClipFillType == ClipperLib.PolyFillType.pftEvenOdd;
-  else
-    return this.m_SubjFillType == ClipperLib.PolyFillType.pftEvenOdd;
+
+    nextTask([]);
 };
-ClipperLib.Clipper.prototype.IsContributing = function (edge)
-{
-  var pft, pft2;
-  if (edge.PolyTyp == ClipperLib.PolyType.ptSubject)
-  {
-    pft = this.m_SubjFillType;
-    pft2 = this.m_ClipFillType;
-  }
-  else
-  {
-    pft = this.m_ClipFillType;
-    pft2 = this.m_SubjFillType;
-  }
-  switch (pft)
-  {
-  case ClipperLib.PolyFillType.pftEvenOdd:
-    if (edge.WindDelta === 0 && edge.WindCnt != 1)
-      return false;
-    break;
-  case ClipperLib.PolyFillType.pftNonZero:
-    if (Math.abs(edge.WindCnt) != 1)
-      return false;
-    break;
-  case ClipperLib.PolyFillType.pftPositive:
-    if (edge.WindCnt != 1)
-      return false;
-    break;
-  default:
-    if (edge.WindCnt != -1)
-      return false;
-    break;
-  }
-  switch (this.m_ClipType)
-  {
-  case ClipperLib.ClipType.ctIntersection:
-    switch (pft2)
-    {
-    case ClipperLib.PolyFillType.pftEvenOdd:
-    case ClipperLib.PolyFillType.pftNonZero:
-      return (edge.WindCnt2 !== 0);
-    case ClipperLib.PolyFillType.pftPositive:
-      return (edge.WindCnt2 > 0);
-    default:
-      return (edge.WindCnt2 < 0);
+
+/**
+ * Async is a utility module which provides straight-forward, powerful functions
+ * for working with asynchronous JavaScript. Although originally designed for
+ * use with [Node.js](http://nodejs.org) and installable via
+ * `npm install --save async`, it can also be used directly in the browser.
+ * @module async
+ */
+
+/**
+ * A collection of `async` functions for manipulating collections, such as
+ * arrays and objects.
+ * @module Collections
+ */
+
+/**
+ * A collection of `async` functions for controlling the flow through a script.
+ * @module ControlFlow
+ */
+
+/**
+ * A collection of `async` utility functions.
+ * @module Utils
+ */
+var index = {
+  applyEach: applyEach,
+  applyEachSeries: applyEachSeries,
+  apply: apply$2,
+  asyncify: asyncify,
+  auto: auto,
+  autoInject: autoInject,
+  cargo: cargo,
+  compose: compose,
+  concat: concat,
+  concatSeries: concatSeries,
+  constant: constant,
+  detect: detect,
+  detectLimit: detectLimit,
+  detectSeries: detectSeries,
+  dir: dir,
+  doDuring: doDuring,
+  doUntil: doUntil,
+  doWhilst: doWhilst,
+  during: during,
+  each: eachLimit,
+  eachLimit: eachLimit$1,
+  eachOf: eachOf,
+  eachOfLimit: eachOfLimit,
+  eachOfSeries: eachOfSeries,
+  eachSeries: eachSeries,
+  ensureAsync: ensureAsync,
+  every: every,
+  everyLimit: everyLimit,
+  everySeries: everySeries,
+  filter: filter,
+  filterLimit: filterLimit,
+  filterSeries: filterSeries,
+  forever: forever,
+  log: log,
+  map: map,
+  mapLimit: mapLimit,
+  mapSeries: mapSeries,
+  mapValues: mapValues,
+  mapValuesLimit: mapValuesLimit,
+  mapValuesSeries: mapValuesSeries,
+  memoize: memoize,
+  nextTick: nextTick,
+  parallel: parallelLimit,
+  parallelLimit: parallelLimit$1,
+  priorityQueue: priorityQueue,
+  queue: queue$1,
+  race: race,
+  reduce: reduce,
+  reduceRight: reduceRight,
+  reflect: reflect,
+  reflectAll: reflectAll,
+  reject: reject,
+  rejectLimit: rejectLimit,
+  rejectSeries: rejectSeries,
+  retry: retry,
+  retryable: retryable,
+  seq: seq$1,
+  series: series,
+  setImmediate: setImmediate$1,
+  some: some,
+  someLimit: someLimit,
+  someSeries: someSeries,
+  sortBy: sortBy,
+  timeout: timeout,
+  times: times,
+  timesLimit: timeLimit,
+  timesSeries: timesSeries,
+  transform: transform,
+  unmemoize: unmemoize,
+  until: until,
+  waterfall: waterfall,
+  whilst: whilst,
+
+  // aliases
+  all: every,
+  any: some,
+  forEach: eachLimit,
+  forEachSeries: eachSeries,
+  forEachLimit: eachLimit$1,
+  forEachOf: eachOf,
+  forEachOfSeries: eachOfSeries,
+  forEachOfLimit: eachOfLimit,
+  inject: reduce,
+  foldl: reduce,
+  foldr: reduceRight,
+  select: filter,
+  selectLimit: filterLimit,
+  selectSeries: filterSeries,
+  wrapSync: asyncify
+};
+
+exports['default'] = index;
+exports.applyEach = applyEach;
+exports.applyEachSeries = applyEachSeries;
+exports.apply = apply$2;
+exports.asyncify = asyncify;
+exports.auto = auto;
+exports.autoInject = autoInject;
+exports.cargo = cargo;
+exports.compose = compose;
+exports.concat = concat;
+exports.concatSeries = concatSeries;
+exports.constant = constant;
+exports.detect = detect;
+exports.detectLimit = detectLimit;
+exports.detectSeries = detectSeries;
+exports.dir = dir;
+exports.doDuring = doDuring;
+exports.doUntil = doUntil;
+exports.doWhilst = doWhilst;
+exports.during = during;
+exports.each = eachLimit;
+exports.eachLimit = eachLimit$1;
+exports.eachOf = eachOf;
+exports.eachOfLimit = eachOfLimit;
+exports.eachOfSeries = eachOfSeries;
+exports.eachSeries = eachSeries;
+exports.ensureAsync = ensureAsync;
+exports.every = every;
+exports.everyLimit = everyLimit;
+exports.everySeries = everySeries;
+exports.filter = filter;
+exports.filterLimit = filterLimit;
+exports.filterSeries = filterSeries;
+exports.forever = forever;
+exports.log = log;
+exports.map = map;
+exports.mapLimit = mapLimit;
+exports.mapSeries = mapSeries;
+exports.mapValues = mapValues;
+exports.mapValuesLimit = mapValuesLimit;
+exports.mapValuesSeries = mapValuesSeries;
+exports.memoize = memoize;
+exports.nextTick = nextTick;
+exports.parallel = parallelLimit;
+exports.parallelLimit = parallelLimit$1;
+exports.priorityQueue = priorityQueue;
+exports.queue = queue$1;
+exports.race = race;
+exports.reduce = reduce;
+exports.reduceRight = reduceRight;
+exports.reflect = reflect;
+exports.reflectAll = reflectAll;
+exports.reject = reject;
+exports.rejectLimit = rejectLimit;
+exports.rejectSeries = rejectSeries;
+exports.retry = retry;
+exports.retryable = retryable;
+exports.seq = seq$1;
+exports.series = series;
+exports.setImmediate = setImmediate$1;
+exports.some = some;
+exports.someLimit = someLimit;
+exports.someSeries = someSeries;
+exports.sortBy = sortBy;
+exports.timeout = timeout;
+exports.times = times;
+exports.timesLimit = timeLimit;
+exports.timesSeries = timesSeries;
+exports.transform = transform;
+exports.unmemoize = unmemoize;
+exports.until = until;
+exports.waterfall = waterfall;
+exports.whilst = whilst;
+exports.all = every;
+exports.allLimit = everyLimit;
+exports.allSeries = everySeries;
+exports.any = some;
+exports.anyLimit = someLimit;
+exports.anySeries = someSeries;
+exports.find = detect;
+exports.findLimit = detectLimit;
+exports.findSeries = detectSeries;
+exports.forEach = eachLimit;
+exports.forEachSeries = eachSeries;
+exports.forEachLimit = eachLimit$1;
+exports.forEachOf = eachOf;
+exports.forEachOfSeries = eachOfSeries;
+exports.forEachOfLimit = eachOfLimit;
+exports.inject = reduce;
+exports.foldl = reduce;
+exports.foldr = reduceRight;
+exports.select = filter;
+exports.selectLimit = filterLimit;
+exports.selectSeries = filterSeries;
+exports.wrapSync = asyncify;
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+})));
+
+}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
+},{"_process":3}],2:[function(require,module,exports){
+(function (global){
+/**
+ * @license
+ * Lodash <https://lodash.com/>
+ * Copyright JS Foundation and other contributors <https://js.foundation/>
+ * Released under MIT license <https://lodash.com/license>
+ * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
+ * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+ */
+;(function() {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined;
+
+  /** Used as the semantic version number. */
+  var VERSION = '4.17.4';
+
+  /** Used as the size to enable large array optimizations. */
+  var LARGE_ARRAY_SIZE = 200;
+
+  /** Error message constants. */
+  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',
+      FUNC_ERROR_TEXT = 'Expected a function';
+
+  /** Used to stand-in for `undefined` hash values. */
+  var HASH_UNDEFINED = '__lodash_hash_undefined__';
+
+  /** Used as the maximum memoize cache size. */
+  var MAX_MEMOIZE_SIZE = 500;
+
+  /** Used as the internal argument placeholder. */
+  var PLACEHOLDER = '__lodash_placeholder__';
+
+  /** Used to compose bitmasks for cloning. */
+  var CLONE_DEEP_FLAG = 1,
+      CLONE_FLAT_FLAG = 2,
+      CLONE_SYMBOLS_FLAG = 4;
+
+  /** Used to compose bitmasks for value comparisons. */
+  var COMPARE_PARTIAL_FLAG = 1,
+      COMPARE_UNORDERED_FLAG = 2;
+
+  /** Used to compose bitmasks for function metadata. */
+  var WRAP_BIND_FLAG = 1,
+      WRAP_BIND_KEY_FLAG = 2,
+      WRAP_CURRY_BOUND_FLAG = 4,
+      WRAP_CURRY_FLAG = 8,
+      WRAP_CURRY_RIGHT_FLAG = 16,
+      WRAP_PARTIAL_FLAG = 32,
+      WRAP_PARTIAL_RIGHT_FLAG = 64,
+      WRAP_ARY_FLAG = 128,
+      WRAP_REARG_FLAG = 256,
+      WRAP_FLIP_FLAG = 512;
+
+  /** Used as default options for `_.truncate`. */
+  var DEFAULT_TRUNC_LENGTH = 30,
+      DEFAULT_TRUNC_OMISSION = '...';
+
+  /** Used to detect hot functions by number of calls within a span of milliseconds. */
+  var HOT_COUNT = 800,
+      HOT_SPAN = 16;
+
+  /** Used to indicate the type of lazy iteratees. */
+  var LAZY_FILTER_FLAG = 1,
+      LAZY_MAP_FLAG = 2,
+      LAZY_WHILE_FLAG = 3;
+
+  /** Used as references for various `Number` constants. */
+  var INFINITY = 1 / 0,
+      MAX_SAFE_INTEGER = 9007199254740991,
+      MAX_INTEGER = 1.7976931348623157e+308,
+      NAN = 0 / 0;
+
+  /** Used as references for the maximum length and index of an array. */
+  var MAX_ARRAY_LENGTH = 4294967295,
+      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,
+      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
+
+  /** Used to associate wrap methods with their bit flags. */
+  var wrapFlags = [
+    ['ary', WRAP_ARY_FLAG],
+    ['bind', WRAP_BIND_FLAG],
+    ['bindKey', WRAP_BIND_KEY_FLAG],
+    ['curry', WRAP_CURRY_FLAG],
+    ['curryRight', WRAP_CURRY_RIGHT_FLAG],
+    ['flip', WRAP_FLIP_FLAG],
+    ['partial', WRAP_PARTIAL_FLAG],
+    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],
+    ['rearg', WRAP_REARG_FLAG]
+  ];
+
+  /** `Object#toString` result references. */
+  var argsTag = '[object Arguments]',
+      arrayTag = '[object Array]',
+      asyncTag = '[object AsyncFunction]',
+      boolTag = '[object Boolean]',
+      dateTag = '[object Date]',
+      domExcTag = '[object DOMException]',
+      errorTag = '[object Error]',
+      funcTag = '[object Function]',
+      genTag = '[object GeneratorFunction]',
+      mapTag = '[object Map]',
+      numberTag = '[object Number]',
+      nullTag = '[object Null]',
+      objectTag = '[object Object]',
+      promiseTag = '[object Promise]',
+      proxyTag = '[object Proxy]',
+      regexpTag = '[object RegExp]',
+      setTag = '[object Set]',
+      stringTag = '[object String]',
+      symbolTag = '[object Symbol]',
+      undefinedTag = '[object Undefined]',
+      weakMapTag = '[object WeakMap]',
+      weakSetTag = '[object WeakSet]';
+
+  var arrayBufferTag = '[object ArrayBuffer]',
+      dataViewTag = '[object DataView]',
+      float32Tag = '[object Float32Array]',
+      float64Tag = '[object Float64Array]',
+      int8Tag = '[object Int8Array]',
+      int16Tag = '[object Int16Array]',
+      int32Tag = '[object Int32Array]',
+      uint8Tag = '[object Uint8Array]',
+      uint8ClampedTag = '[object Uint8ClampedArray]',
+      uint16Tag = '[object Uint16Array]',
+      uint32Tag = '[object Uint32Array]';
+
+  /** Used to match empty string literals in compiled template source. */
+  var reEmptyStringLeading = /\b__p \+= '';/g,
+      reEmptyStringMiddle = /\b(__p \+=) '' \+/g,
+      reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g;
+
+  /** Used to match HTML entities and HTML characters. */
+  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,
+      reUnescapedHtml = /[&<>"']/g,
+      reHasEscapedHtml = RegExp(reEscapedHtml.source),
+      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);
+
+  /** Used to match template delimiters. */
+  var reEscape = /<%-([\s\S]+?)%>/g,
+      reEvaluate = /<%([\s\S]+?)%>/g,
+      reInterpolate = /<%=([\s\S]+?)%>/g;
+
+  /** Used to match property names within property paths. */
+  var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
+      reIsPlainProp = /^\w*$/,
+      reLeadingDot = /^\./,
+      rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g;
+
+  /**
+   * Used to match `RegExp`
+   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
+   */
+  var reRegExpChar = /[\\^$.*+?()[\]{}|]/g,
+      reHasRegExpChar = RegExp(reRegExpChar.source);
+
+  /** Used to match leading and trailing whitespace. */
+  var reTrim = /^\s+|\s+$/g,
+      reTrimStart = /^\s+/,
+      reTrimEnd = /\s+$/;
+
+  /** Used to match wrap detail comments. */
+  var reWrapComment = /\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/,
+      reWrapDetails = /\{\n\/\* \[wrapped with (.+)\] \*/,
+      reSplitDetails = /,? & /;
+
+  /** Used to match words composed of alphanumeric characters. */
+  var reAsciiWord = /[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g;
+
+  /** Used to match backslashes in property paths. */
+  var reEscapeChar = /\\(\\)?/g;
+
+  /**
+   * Used to match
+   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).
+   */
+  var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g;
+
+  /** Used to match `RegExp` flags from their coerced string values. */
+  var reFlags = /\w*$/;
+
+  /** Used to detect bad signed hexadecimal string values. */
+  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
+
+  /** Used to detect binary string values. */
+  var reIsBinary = /^0b[01]+$/i;
+
+  /** Used to detect host constructors (Safari). */
+  var reIsHostCtor = /^\[object .+?Constructor\]$/;
+
+  /** Used to detect octal string values. */
+  var reIsOctal = /^0o[0-7]+$/i;
+
+  /** Used to detect unsigned integer values. */
+  var reIsUint = /^(?:0|[1-9]\d*)$/;
+
+  /** Used to match Latin Unicode letters (excluding mathematical operators). */
+  var reLatin = /[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/g;
+
+  /** Used to ensure capturing order of template delimiters. */
+  var reNoMatch = /($^)/;
+
+  /** Used to match unescaped characters in compiled string literals. */
+  var reUnescapedString = /['\n\r\u2028\u2029\\]/g;
+
+  /** Used to compose unicode character classes. */
+  var rsAstralRange = '\\ud800-\\udfff',
+      rsComboMarksRange = '\\u0300-\\u036f',
+      reComboHalfMarksRange = '\\ufe20-\\ufe2f',
+      rsComboSymbolsRange = '\\u20d0-\\u20ff',
+      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
+      rsDingbatRange = '\\u2700-\\u27bf',
+      rsLowerRange = 'a-z\\xdf-\\xf6\\xf8-\\xff',
+      rsMathOpRange = '\\xac\\xb1\\xd7\\xf7',
+      rsNonCharRange = '\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf',
+      rsPunctuationRange = '\\u2000-\\u206f',
+      rsSpaceRange = ' \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000',
+      rsUpperRange = 'A-Z\\xc0-\\xd6\\xd8-\\xde',
+      rsVarRange = '\\ufe0e\\ufe0f',
+      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;
+
+  /** Used to compose unicode capture groups. */
+  var rsApos = "['\u2019]",
+      rsAstral = '[' + rsAstralRange + ']',
+      rsBreak = '[' + rsBreakRange + ']',
+      rsCombo = '[' + rsComboRange + ']',
+      rsDigits = '\\d+',
+      rsDingbat = '[' + rsDingbatRange + ']',
+      rsLower = '[' + rsLowerRange + ']',
+      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',
+      rsFitz = '\\ud83c[\\udffb-\\udfff]',
+      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',
+      rsNonAstral = '[^' + rsAstralRange + ']',
+      rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}',
+      rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]',
+      rsUpper = '[' + rsUpperRange + ']',
+      rsZWJ = '\\u200d';
+
+  /** Used to compose unicode regexes. */
+  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',
+      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',
+      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',
+      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',
+      reOptMod = rsModifier + '?',
+      rsOptVar = '[' + rsVarRange + ']?',
+      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
+      rsOrdLower = '\\d*(?:(?:1st|2nd|3rd|(?![123])\\dth)\\b)',
+      rsOrdUpper = '\\d*(?:(?:1ST|2ND|3RD|(?![123])\\dTH)\\b)',
+      rsSeq = rsOptVar + reOptMod + rsOptJoin,
+      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,
+      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';
+
+  /** Used to match apostrophes. */
+  var reApos = RegExp(rsApos, 'g');
+
+  /**
+   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and
+   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).
+   */
+  var reComboMark = RegExp(rsCombo, 'g');
+
+  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
+  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');
+
+  /** Used to match complex or compound words. */
+  var reUnicodeWord = RegExp([
+    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',
+    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',
+    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,
+    rsUpper + '+' + rsOptContrUpper,
+    rsOrdUpper,
+    rsOrdLower,
+    rsDigits,
+    rsEmoji
+  ].join('|'), 'g');
+
+  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
+  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');
+
+  /** Used to detect strings that need a more robust regexp to match words. */
+  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2,}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;
+
+  /** Used to assign default `context` object properties. */
+  var contextProps = [
+    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',
+    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',
+    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',
+    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',
+    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'
+  ];
+
+  /** Used to make template sourceURLs easier to identify. */
+  var templateCounter = -1;
+
+  /** Used to identify `toStringTag` values of typed arrays. */
+  var typedArrayTags = {};
+  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
+  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
+  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
+  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
+  typedArrayTags[uint32Tag] = true;
+  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =
+  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
+  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =
+  typedArrayTags[errorTag] = typedArrayTags[funcTag] =
+  typedArrayTags[mapTag] = typedArrayTags[numberTag] =
+  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =
+  typedArrayTags[setTag] = typedArrayTags[stringTag] =
+  typedArrayTags[weakMapTag] = false;
+
+  /** Used to identify `toStringTag` values supported by `_.clone`. */
+  var cloneableTags = {};
+  cloneableTags[argsTag] = cloneableTags[arrayTag] =
+  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =
+  cloneableTags[boolTag] = cloneableTags[dateTag] =
+  cloneableTags[float32Tag] = cloneableTags[float64Tag] =
+  cloneableTags[int8Tag] = cloneableTags[int16Tag] =
+  cloneableTags[int32Tag] = cloneableTags[mapTag] =
+  cloneableTags[numberTag] = cloneableTags[objectTag] =
+  cloneableTags[regexpTag] = cloneableTags[setTag] =
+  cloneableTags[stringTag] = cloneableTags[symbolTag] =
+  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
+  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
+  cloneableTags[errorTag] = cloneableTags[funcTag] =
+  cloneableTags[weakMapTag] = false;
+
+  /** Used to map Latin Unicode letters to basic Latin letters. */
+  var deburredLetters = {
+    // Latin-1 Supplement block.
+    '\xc0': 'A',  '\xc1': 'A', '\xc2': 'A', '\xc3': 'A', '\xc4': 'A', '\xc5': 'A',
+    '\xe0': 'a',  '\xe1': 'a', '\xe2': 'a', '\xe3': 'a', '\xe4': 'a', '\xe5': 'a',
+    '\xc7': 'C',  '\xe7': 'c',
+    '\xd0': 'D',  '\xf0': 'd',
+    '\xc8': 'E',  '\xc9': 'E', '\xca': 'E', '\xcb': 'E',
+    '\xe8': 'e',  '\xe9': 'e', '\xea': 'e', '\xeb': 'e',
+    '\xcc': 'I',  '\xcd': 'I', '\xce': 'I', '\xcf': 'I',
+    '\xec': 'i',  '\xed': 'i', '\xee': 'i', '\xef': 'i',
+    '\xd1': 'N',  '\xf1': 'n',
+    '\xd2': 'O',  '\xd3': 'O', '\xd4': 'O', '\xd5': 'O', '\xd6': 'O', '\xd8': 'O',
+    '\xf2': 'o',  '\xf3': 'o', '\xf4': 'o', '\xf5': 'o', '\xf6': 'o', '\xf8': 'o',
+    '\xd9': 'U',  '\xda': 'U', '\xdb': 'U', '\xdc': 'U',
+    '\xf9': 'u',  '\xfa': 'u', '\xfb': 'u', '\xfc': 'u',
+    '\xdd': 'Y',  '\xfd': 'y', '\xff': 'y',
+    '\xc6': 'Ae', '\xe6': 'ae',
+    '\xde': 'Th', '\xfe': 'th',
+    '\xdf': 'ss',
+    // Latin Extended-A block.
+    '\u0100': 'A',  '\u0102': 'A', '\u0104': 'A',
+    '\u0101': 'a',  '\u0103': 'a', '\u0105': 'a',
+    '\u0106': 'C',  '\u0108': 'C', '\u010a': 'C', '\u010c': 'C',
+    '\u0107': 'c',  '\u0109': 'c', '\u010b': 'c', '\u010d': 'c',
+    '\u010e': 'D',  '\u0110': 'D', '\u010f': 'd', '\u0111': 'd',
+    '\u0112': 'E',  '\u0114': 'E', '\u0116': 'E', '\u0118': 'E', '\u011a': 'E',
+    '\u0113': 'e',  '\u0115': 'e', '\u0117': 'e', '\u0119': 'e', '\u011b': 'e',
+    '\u011c': 'G',  '\u011e': 'G', '\u0120': 'G', '\u0122': 'G',
+    '\u011d': 'g',  '\u011f': 'g', '\u0121': 'g', '\u0123': 'g',
+    '\u0124': 'H',  '\u0126': 'H', '\u0125': 'h', '\u0127': 'h',
+    '\u0128': 'I',  '\u012a': 'I', '\u012c': 'I', '\u012e': 'I', '\u0130': 'I',
+    '\u0129': 'i',  '\u012b': 'i', '\u012d': 'i', '\u012f': 'i', '\u0131': 'i',
+    '\u0134': 'J',  '\u0135': 'j',
+    '\u0136': 'K',  '\u0137': 'k', '\u0138': 'k',
+    '\u0139': 'L',  '\u013b': 'L', '\u013d': 'L', '\u013f': 'L', '\u0141': 'L',
+    '\u013a': 'l',  '\u013c': 'l', '\u013e': 'l', '\u0140': 'l', '\u0142': 'l',
+    '\u0143': 'N',  '\u0145': 'N', '\u0147': 'N', '\u014a': 'N',
+    '\u0144': 'n',  '\u0146': 'n', '\u0148': 'n', '\u014b': 'n',
+    '\u014c': 'O',  '\u014e': 'O', '\u0150': 'O',
+    '\u014d': 'o',  '\u014f': 'o', '\u0151': 'o',
+    '\u0154': 'R',  '\u0156': 'R', '\u0158': 'R',
+    '\u0155': 'r',  '\u0157': 'r', '\u0159': 'r',
+    '\u015a': 'S',  '\u015c': 'S', '\u015e': 'S', '\u0160': 'S',
+    '\u015b': 's',  '\u015d': 's', '\u015f': 's', '\u0161': 's',
+    '\u0162': 'T',  '\u0164': 'T', '\u0166': 'T',
+    '\u0163': 't',  '\u0165': 't', '\u0167': 't',
+    '\u0168': 'U',  '\u016a': 'U', '\u016c': 'U', '\u016e': 'U', '\u0170': 'U', '\u0172': 'U',
+    '\u0169': 'u',  '\u016b': 'u', '\u016d': 'u', '\u016f': 'u', '\u0171': 'u', '\u0173': 'u',
+    '\u0174': 'W',  '\u0175': 'w',
+    '\u0176': 'Y',  '\u0177': 'y', '\u0178': 'Y',
+    '\u0179': 'Z',  '\u017b': 'Z', '\u017d': 'Z',
+    '\u017a': 'z',  '\u017c': 'z', '\u017e': 'z',
+    '\u0132': 'IJ', '\u0133': 'ij',
+    '\u0152': 'Oe', '\u0153': 'oe',
+    '\u0149': "'n", '\u017f': 's'
+  };
+
+  /** Used to map characters to HTML entities. */
+  var htmlEscapes = {
+    '&': '&amp;',
+    '<': '&lt;',
+    '>': '&gt;',
+    '"': '&quot;',
+    "'": '&#39;'
+  };
+
+  /** Used to map HTML entities to characters. */
+  var htmlUnescapes = {
+    '&amp;': '&',
+    '&lt;': '<',
+    '&gt;': '>',
+    '&quot;': '"',
+    '&#39;': "'"
+  };
+
+  /** Used to escape characters for inclusion in compiled string literals. */
+  var stringEscapes = {
+    '\\': '\\',
+    "'": "'",
+    '\n': 'n',
+    '\r': 'r',
+    '\u2028': 'u2028',
+    '\u2029': 'u2029'
+  };
+
+  /** Built-in method references without a dependency on `root`. */
+  var freeParseFloat = parseFloat,
+      freeParseInt = parseInt;
+
+  /** Detect free variable `global` from Node.js. */
+  var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;
+
+  /** Detect free variable `self`. */
+  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;
+
+  /** Used as a reference to the global object. */
+  var root = freeGlobal || freeSelf || Function('return this')();
+
+  /** Detect free variable `exports`. */
+  var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;
+
+  /** Detect free variable `module`. */
+  var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;
+
+  /** Detect the popular CommonJS extension `module.exports`. */
+  var moduleExports = freeModule && freeModule.exports === freeExports;
+
+  /** Detect free variable `process` from Node.js. */
+  var freeProcess = moduleExports && freeGlobal.process;
+
+  /** Used to access faster Node.js helpers. */
+  var nodeUtil = (function() {
+    try {
+      return freeProcess && freeProcess.binding && freeProcess.binding('util');
+    } catch (e) {}
+  }());
+
+  /* Node.js helper references. */
+  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,
+      nodeIsDate = nodeUtil && nodeUtil.isDate,
+      nodeIsMap = nodeUtil && nodeUtil.isMap,
+      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,
+      nodeIsSet = nodeUtil && nodeUtil.isSet,
+      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;
+
+  /*--------------------------------------------------------------------------*/
+
+  /**
+   * Adds the key-value `pair` to `map`.
+   *
+   * @private
+   * @param {Object} map The map to modify.
+   * @param {Array} pair The key-value pair to add.
+   * @returns {Object} Returns `map`.
+   */
+  function addMapEntry(map, pair) {
+    // Don't return `map.set` because it's not chainable in IE 11.
+    map.set(pair[0], pair[1]);
+    return map;
+  }
+
+  /**
+   * Adds `value` to `set`.
+   *
+   * @private
+   * @param {Object} set The set to modify.
+   * @param {*} value The value to add.
+   * @returns {Object} Returns `set`.
+   */
+  function addSetEntry(set, value) {
+    // Don't return `set.add` because it's not chainable in IE 11.
+    set.add(value);
+    return set;
+  }
+
+  /**
+   * A faster alternative to `Function#apply`, this function invokes `func`
+   * with the `this` binding of `thisArg` and the arguments of `args`.
+   *
+   * @private
+   * @param {Function} func The function to invoke.
+   * @param {*} thisArg The `this` binding of `func`.
+   * @param {Array} args The arguments to invoke `func` with.
+   * @returns {*} Returns the result of `func`.
+   */
+  function apply(func, thisArg, args) {
+    switch (args.length) {
+      case 0: return func.call(thisArg);
+      case 1: return func.call(thisArg, args[0]);
+      case 2: return func.call(thisArg, args[0], args[1]);
+      case 3: return func.call(thisArg, args[0], args[1], args[2]);
     }
-  case ClipperLib.ClipType.ctUnion:
-    switch (pft2)
-    {
-    case ClipperLib.PolyFillType.pftEvenOdd:
-    case ClipperLib.PolyFillType.pftNonZero:
-      return (edge.WindCnt2 === 0);
-    case ClipperLib.PolyFillType.pftPositive:
-      return (edge.WindCnt2 <= 0);
-    default:
-      return (edge.WindCnt2 >= 0);
+    return func.apply(thisArg, args);
+  }
+
+  /**
+   * A specialized version of `baseAggregator` for arrays.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} setter The function to set `accumulator` values.
+   * @param {Function} iteratee The iteratee to transform keys.
+   * @param {Object} accumulator The initial aggregated object.
+   * @returns {Function} Returns `accumulator`.
+   */
+  function arrayAggregator(array, setter, iteratee, accumulator) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
+
+    while (++index < length) {
+      var value = array[index];
+      setter(accumulator, value, iteratee(value), array);
     }
-  case ClipperLib.ClipType.ctDifference:
-    if (edge.PolyTyp == ClipperLib.PolyType.ptSubject)
-      switch (pft2)
-      {
-      case ClipperLib.PolyFillType.pftEvenOdd:
-      case ClipperLib.PolyFillType.pftNonZero:
-        return (edge.WindCnt2 === 0);
-      case ClipperLib.PolyFillType.pftPositive:
-        return (edge.WindCnt2 <= 0);
-      default:
-        return (edge.WindCnt2 >= 0);
-      }
-    else
-      switch (pft2)
-      {
-      case ClipperLib.PolyFillType.pftEvenOdd:
-      case ClipperLib.PolyFillType.pftNonZero:
-        return (edge.WindCnt2 !== 0);
-      case ClipperLib.PolyFillType.pftPositive:
-        return (edge.WindCnt2 > 0);
-      default:
-        return (edge.WindCnt2 < 0);
-      }
-  case ClipperLib.ClipType.ctXor:
-    if (edge.WindDelta === 0)
-      switch (pft2)
-      {
-      case ClipperLib.PolyFillType.pftEvenOdd:
-      case ClipperLib.PolyFillType.pftNonZero:
-        return (edge.WindCnt2 === 0);
-      case ClipperLib.PolyFillType.pftPositive:
-        return (edge.WindCnt2 <= 0);
-      default:
-        return (edge.WindCnt2 >= 0);
-      }
-    else
-      return true;
-  }
-  return true;
-};
-ClipperLib.Clipper.prototype.SetWindingCount = function (edge)
-{
-  var e = edge.PrevInAEL;
-  //find the edge of the same polytype that immediately preceeds 'edge' in AEL
-  while (e !== null && ((e.PolyTyp != edge.PolyTyp) || (e.WindDelta === 0)))
-    e = e.PrevInAEL;
-  if (e === null)
-  {
-    edge.WindCnt = (edge.WindDelta === 0 ? 1 : edge.WindDelta);
-    edge.WindCnt2 = 0;
-    e = this.m_ActiveEdges;
-    //ie get ready to calc WindCnt2
-  }
-  else if (edge.WindDelta === 0 && this.m_ClipType != ClipperLib.ClipType.ctUnion)
-  {
-    edge.WindCnt = 1;
-    edge.WindCnt2 = e.WindCnt2;
-    e = e.NextInAEL;
-    //ie get ready to calc WindCnt2
+    return accumulator;
   }
-  else if (this.IsEvenOddFillType(edge))
-  {
-    //EvenOdd filling ...
-    if (edge.WindDelta === 0)
-    {
-      //are we inside a subj polygon ...
-      var Inside = true;
-      var e2 = e.PrevInAEL;
-      while (e2 !== null)
-      {
-        if (e2.PolyTyp == e.PolyTyp && e2.WindDelta !== 0)
-          Inside = !Inside;
-        e2 = e2.PrevInAEL;
+
+  /**
+   * A specialized version of `_.forEach` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {Array} Returns `array`.
+   */
+  function arrayEach(array, iteratee) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
+
+    while (++index < length) {
+      if (iteratee(array[index], index, array) === false) {
+        break;
       }
-      edge.WindCnt = (Inside ? 0 : 1);
-    }
-    else
-    {
-      edge.WindCnt = edge.WindDelta;
     }
-    edge.WindCnt2 = e.WindCnt2;
-    e = e.NextInAEL;
-    //ie get ready to calc WindCnt2
+    return array;
   }
-  else
-  {
-    //nonZero, Positive or Negative filling ...
-    if (e.WindCnt * e.WindDelta < 0)
-    {
-      //prev edge is 'decreasing' WindCount (WC) toward zero
-      //so we're outside the previous polygon ...
-      if (Math.abs(e.WindCnt) > 1)
-      {
-        //outside prev poly but still inside another.
-        //when reversing direction of prev poly use the same WC 
-        if (e.WindDelta * edge.WindDelta < 0)
-          edge.WindCnt = e.WindCnt;
-        else
-          edge.WindCnt = e.WindCnt + edge.WindDelta;
+
+  /**
+   * A specialized version of `_.forEachRight` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {Array} Returns `array`.
+   */
+  function arrayEachRight(array, iteratee) {
+    var length = array == null ? 0 : array.length;
+
+    while (length--) {
+      if (iteratee(array[length], length, array) === false) {
+        break;
       }
-      else
-        edge.WindCnt = (edge.WindDelta === 0 ? 1 : edge.WindDelta);
-    }
-    else
-    {
-      //prev edge is 'increasing' WindCount (WC) away from zero
-      //so we're inside the previous polygon ...
-      if (edge.WindDelta === 0)
-        edge.WindCnt = (e.WindCnt < 0 ? e.WindCnt - 1 : e.WindCnt + 1);
-      else if (e.WindDelta * edge.WindDelta < 0)
-        edge.WindCnt = e.WindCnt;
-      else
-        edge.WindCnt = e.WindCnt + edge.WindDelta;
-    }
-    edge.WindCnt2 = e.WindCnt2;
-    e = e.NextInAEL;
-    //ie get ready to calc WindCnt2
-  }
-  //update WindCnt2 ...
-  if (this.IsEvenOddAltFillType(edge))
-  {
-    //EvenOdd filling ...
-    while (e != edge)
-    {
-      if (e.WindDelta !== 0)
-        edge.WindCnt2 = (edge.WindCnt2 === 0 ? 1 : 0);
-      e = e.NextInAEL;
     }
+    return array;
   }
-  else
-  {
-    //nonZero, Positive or Negative filling ...
-    while (e != edge)
-    {
-      edge.WindCnt2 += e.WindDelta;
-      e = e.NextInAEL;
+
+  /**
+   * A specialized version of `_.every` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} predicate The function invoked per iteration.
+   * @returns {boolean} Returns `true` if all elements pass the predicate check,
+   *  else `false`.
+   */
+  function arrayEvery(array, predicate) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
+
+    while (++index < length) {
+      if (!predicate(array[index], index, array)) {
+        return false;
+      }
     }
+    return true;
   }
-};
-ClipperLib.Clipper.prototype.AddEdgeToSEL = function (edge)
-{
-  //SEL pointers in PEdge are reused to build a list of horizontal edges.
-  //However, we don't need to worry about order with horizontal edge processing.
-  if (this.m_SortedEdges === null)
-  {
-    this.m_SortedEdges = edge;
-    edge.PrevInSEL = null;
-    edge.NextInSEL = null;
-  }
-  else
-  {
-    edge.NextInSEL = this.m_SortedEdges;
-    edge.PrevInSEL = null;
-    this.m_SortedEdges.PrevInSEL = edge;
-    this.m_SortedEdges = edge;
-  }
-};
-ClipperLib.Clipper.prototype.CopyAELToSEL = function ()
-{
-  var e = this.m_ActiveEdges;
-  this.m_SortedEdges = e;
-  while (e !== null)
-  {
-    e.PrevInSEL = e.PrevInAEL;
-    e.NextInSEL = e.NextInAEL;
-    e = e.NextInAEL;
-  }
-};
-ClipperLib.Clipper.prototype.SwapPositionsInAEL = function (edge1, edge2)
-{
-  //check that one or other edge hasn't already been removed from AEL ...
-  if (edge1.NextInAEL == edge1.PrevInAEL || edge2.NextInAEL == edge2.PrevInAEL)
-    return;
-  if (edge1.NextInAEL == edge2)
-  {
-    var next = edge2.NextInAEL;
-    if (next !== null)
-      next.PrevInAEL = edge1;
-    var prev = edge1.PrevInAEL;
-    if (prev !== null)
-      prev.NextInAEL = edge2;
-    edge2.PrevInAEL = prev;
-    edge2.NextInAEL = edge1;
-    edge1.PrevInAEL = edge2;
-    edge1.NextInAEL = next;
-  }
-  else if (edge2.NextInAEL == edge1)
-  {
-    var next = edge1.NextInAEL;
-    if (next !== null)
-      next.PrevInAEL = edge2;
-    var prev = edge2.PrevInAEL;
-    if (prev !== null)
-      prev.NextInAEL = edge1;
-    edge1.PrevInAEL = prev;
-    edge1.NextInAEL = edge2;
-    edge2.PrevInAEL = edge1;
-    edge2.NextInAEL = next;
-  }
-  else
-  {
-    var next = edge1.NextInAEL;
-    var prev = edge1.PrevInAEL;
-    edge1.NextInAEL = edge2.NextInAEL;
-    if (edge1.NextInAEL !== null)
-      edge1.NextInAEL.PrevInAEL = edge1;
-    edge1.PrevInAEL = edge2.PrevInAEL;
-    if (edge1.PrevInAEL !== null)
-      edge1.PrevInAEL.NextInAEL = edge1;
-    edge2.NextInAEL = next;
-    if (edge2.NextInAEL !== null)
-      edge2.NextInAEL.PrevInAEL = edge2;
-    edge2.PrevInAEL = prev;
-    if (edge2.PrevInAEL !== null)
-      edge2.PrevInAEL.NextInAEL = edge2;
-  }
-  if (edge1.PrevInAEL === null)
-    this.m_ActiveEdges = edge1;
-  else if (edge2.PrevInAEL === null)
-    this.m_ActiveEdges = edge2;
-};
-ClipperLib.Clipper.prototype.SwapPositionsInSEL = function (edge1, edge2)
-{
-  if (edge1.NextInSEL === null && edge1.PrevInSEL === null)
-    return;
-  if (edge2.NextInSEL === null && edge2.PrevInSEL === null)
-    return;
-  if (edge1.NextInSEL == edge2)
-  {
-    var next = edge2.NextInSEL;
-    if (next !== null)
-      next.PrevInSEL = edge1;
-    var prev = edge1.PrevInSEL;
-    if (prev !== null)
-      prev.NextInSEL = edge2;
-    edge2.PrevInSEL = prev;
-    edge2.NextInSEL = edge1;
-    edge1.PrevInSEL = edge2;
-    edge1.NextInSEL = next;
-  }
-  else if (edge2.NextInSEL == edge1)
-  {
-    var next = edge1.NextInSEL;
-    if (next !== null)
-      next.PrevInSEL = edge2;
-    var prev = edge2.PrevInSEL;
-    if (prev !== null)
-      prev.NextInSEL = edge1;
-    edge1.PrevInSEL = prev;
-    edge1.NextInSEL = edge2;
-    edge2.PrevInSEL = edge1;
-    edge2.NextInSEL = next;
-  }
-  else
-  {
-    var next = edge1.NextInSEL;
-    var prev = edge1.PrevInSEL;
-    edge1.NextInSEL = edge2.NextInSEL;
-    if (edge1.NextInSEL !== null)
-      edge1.NextInSEL.PrevInSEL = edge1;
-    edge1.PrevInSEL = edge2.PrevInSEL;
-    if (edge1.PrevInSEL !== null)
-      edge1.PrevInSEL.NextInSEL = edge1;
-    edge2.NextInSEL = next;
-    if (edge2.NextInSEL !== null)
-      edge2.NextInSEL.PrevInSEL = edge2;
-    edge2.PrevInSEL = prev;
-    if (edge2.PrevInSEL !== null)
-      edge2.PrevInSEL.NextInSEL = edge2;
-  }
-  if (edge1.PrevInSEL === null)
-    this.m_SortedEdges = edge1;
-  else if (edge2.PrevInSEL === null)
-    this.m_SortedEdges = edge2;
-};
-ClipperLib.Clipper.prototype.AddLocalMaxPoly = function (e1, e2, pt)
-{
-  this.AddOutPt(e1, pt);
-  if (e2.WindDelta == 0) this.AddOutPt(e2, pt);
-  if (e1.OutIdx == e2.OutIdx)
-  {
-    e1.OutIdx = -1;
-    e2.OutIdx = -1;
-  }
-  else if (e1.OutIdx < e2.OutIdx)
-    this.AppendPolygon(e1, e2);
-  else
-    this.AppendPolygon(e2, e1);
-};
-ClipperLib.Clipper.prototype.AddLocalMinPoly = function (e1, e2, pt)
-{
-  var result;
-  var e, prevE;
-  if (ClipperLib.ClipperBase.IsHorizontal(e2) || (e1.Dx > e2.Dx))
-  {
-    result = this.AddOutPt(e1, pt);
-    e2.OutIdx = e1.OutIdx;
-    e1.Side = ClipperLib.EdgeSide.esLeft;
-    e2.Side = ClipperLib.EdgeSide.esRight;
-    e = e1;
-    if (e.PrevInAEL == e2)
-      prevE = e2.PrevInAEL;
-    else
-      prevE = e.PrevInAEL;
-  }
-  else
-  {
-    result = this.AddOutPt(e2, pt);
-    e1.OutIdx = e2.OutIdx;
-    e1.Side = ClipperLib.EdgeSide.esRight;
-    e2.Side = ClipperLib.EdgeSide.esLeft;
-    e = e2;
-    if (e.PrevInAEL == e1)
-      prevE = e1.PrevInAEL;
-    else
-      prevE = e.PrevInAEL;
-  }
-  if (prevE !== null && prevE.OutIdx >= 0 && (ClipperLib.Clipper.TopX(prevE, pt.Y) == ClipperLib.Clipper.TopX(e, pt.Y)) && ClipperLib.ClipperBase.SlopesEqual(e, prevE, this.m_UseFullRange) && (e.WindDelta !== 0) && (prevE.WindDelta !== 0))
-  {
-    var outPt = this.AddOutPt(prevE, pt);
-    this.AddJoin(result, outPt, e.Top);
-  }
-  return result;
-};
-ClipperLib.Clipper.prototype.CreateOutRec = function ()
-{
-  var result = new ClipperLib.OutRec();
-  result.Idx = -1;
-  result.IsHole = false;
-  result.IsOpen = false;
-  result.FirstLeft = null;
-  result.Pts = null;
-  result.BottomPt = null;
-  result.PolyNode = null;
-  this.m_PolyOuts.push(result);
-  result.Idx = this.m_PolyOuts.length - 1;
-  return result;
-};
-ClipperLib.Clipper.prototype.AddOutPt = function (e, pt)
-{
-  var ToFront = (e.Side == ClipperLib.EdgeSide.esLeft);
-  if (e.OutIdx < 0)
-  {
-    var outRec = this.CreateOutRec();
-    outRec.IsOpen = (e.WindDelta === 0);
-    var newOp = new ClipperLib.OutPt();
-    outRec.Pts = newOp;
-    newOp.Idx = outRec.Idx;
-    //newOp.Pt = pt;
-    newOp.Pt.X = pt.X;
-    newOp.Pt.Y = pt.Y;
-    newOp.Next = newOp;
-    newOp.Prev = newOp;
-    if (!outRec.IsOpen)
-      this.SetHoleState(e, outRec);
-    if (use_xyz)
-    {
-      if (ClipperLib.IntPoint.op_Equality(pt, e.Bot))
-      {
-        //newOp.Pt = e.Bot;
-        newOp.Pt.X = e.Bot.X;
-        newOp.Pt.Y = e.Bot.Y;
-        newOp.Pt.Z = e.Bot.Z;
-      }
-      else if (ClipperLib.IntPoint.op_Equality(pt, e.Top))
-      {
-        //newOp.Pt = e.Top;
-        newOp.Pt.X = e.Top.X;
-        newOp.Pt.Y = e.Top.Y;
-        newOp.Pt.Z = e.Top.Z;
+
+  /**
+   * A specialized version of `_.filter` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} predicate The function invoked per iteration.
+   * @returns {Array} Returns the new filtered array.
+   */
+  function arrayFilter(array, predicate) {
+    var index = -1,
+        length = array == null ? 0 : array.length,
+        resIndex = 0,
+        result = [];
+
+    while (++index < length) {
+      var value = array[index];
+      if (predicate(value, index, array)) {
+        result[resIndex++] = value;
       }
-      else
-        this.SetZ(newOp.Pt, e);
     }
-    e.OutIdx = outRec.Idx;
-    //nb: do this after SetZ !
-    return newOp;
+    return result;
   }
-  else
-  {
-    var outRec = this.m_PolyOuts[e.OutIdx];
-    //OutRec.Pts is the 'Left-most' point & OutRec.Pts.Prev is the 'Right-most'
-    var op = outRec.Pts;
-    if (ToFront && ClipperLib.IntPoint.op_Equality(pt, op.Pt))
-      return op;
-    else if (!ToFront && ClipperLib.IntPoint.op_Equality(pt, op.Prev.Pt))
-      return op.Prev;
-    var newOp = new ClipperLib.OutPt();
-    newOp.Idx = outRec.Idx;
-    //newOp.Pt = pt;
-    newOp.Pt.X = pt.X;
-    newOp.Pt.Y = pt.Y;
-    newOp.Next = op;
-    newOp.Prev = op.Prev;
-    newOp.Prev.Next = newOp;
-    op.Prev = newOp;
-    if (ToFront)
-      outRec.Pts = newOp;
-    if (use_xyz)
-    {
-      if (ClipperLib.IntPoint.op_Equality(pt, e.Bot))
-      {
-        //newOp.Pt = e.Bot;
-        newOp.Pt.X = e.Bot.X;
-        newOp.Pt.Y = e.Bot.Y;
-        newOp.Pt.Z = e.Bot.Z;
-      }
-      else if (ClipperLib.IntPoint.op_Equality(pt, e.Top))
-      {
-        //newOp.Pt = e.Top;
-        newOp.Pt.X = e.Top.X;
-        newOp.Pt.Y = e.Top.Y;
-        newOp.Pt.Z = e.Top.Z;
+
+  /**
+   * A specialized version of `_.includes` for arrays without support for
+   * specifying an index to search from.
+   *
+   * @private
+   * @param {Array} [array] The array to inspect.
+   * @param {*} target The value to search for.
+   * @returns {boolean} Returns `true` if `target` is found, else `false`.
+   */
+  function arrayIncludes(array, value) {
+    var length = array == null ? 0 : array.length;
+    return !!length && baseIndexOf(array, value, 0) > -1;
+  }
+
+  /**
+   * This function is like `arrayIncludes` except that it accepts a comparator.
+   *
+   * @private
+   * @param {Array} [array] The array to inspect.
+   * @param {*} target The value to search for.
+   * @param {Function} comparator The comparator invoked per element.
+   * @returns {boolean} Returns `true` if `target` is found, else `false`.
+   */
+  function arrayIncludesWith(array, value, comparator) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
+
+    while (++index < length) {
+      if (comparator(value, array[index])) {
+        return true;
       }
-      else
-        this.SetZ(newOp.Pt, e);
     }
-    return newOp;
-  }
-};
-ClipperLib.Clipper.prototype.SwapPoints = function (pt1, pt2)
-{
-  var tmp = new ClipperLib.IntPoint(pt1.Value);
-  //pt1.Value = pt2.Value;
-  pt1.Value.X = pt2.Value.X;
-  pt1.Value.Y = pt2.Value.Y;
-  //pt2.Value = tmp;
-  pt2.Value.X = tmp.X;
-  pt2.Value.Y = tmp.Y;
-};
-ClipperLib.Clipper.prototype.HorzSegmentsOverlap = function (Pt1a, Pt1b, Pt2a, Pt2b)
-{
-  //precondition: both segments are horizontal
-  if ((Pt1a.X > Pt2a.X) == (Pt1a.X < Pt2b.X))
-    return true;
-  else if ((Pt1b.X > Pt2a.X) == (Pt1b.X < Pt2b.X))
-    return true;
-  else if ((Pt2a.X > Pt1a.X) == (Pt2a.X < Pt1b.X))
-    return true;
-  else if ((Pt2b.X > Pt1a.X) == (Pt2b.X < Pt1b.X))
-    return true;
-  else if ((Pt1a.X == Pt2a.X) && (Pt1b.X == Pt2b.X))
-    return true;
-  else if ((Pt1a.X == Pt2b.X) && (Pt1b.X == Pt2a.X))
-    return true;
-  else
     return false;
-};
-ClipperLib.Clipper.prototype.InsertPolyPtBetween = function (p1, p2, pt)
-{
-  var result = new ClipperLib.OutPt();
-  //result.Pt = pt;
-  result.Pt.X = pt.X;
-  result.Pt.Y = pt.Y;
-  if (p2 == p1.Next)
-  {
-    p1.Next = result;
-    p2.Prev = result;
-    result.Next = p2;
-    result.Prev = p1;
   }
-  else
-  {
-    p2.Next = result;
-    p1.Prev = result;
-    result.Next = p1;
-    result.Prev = p2;
+
+  /**
+   * A specialized version of `_.map` for arrays without support for iteratee
+   * shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {Array} Returns the new mapped array.
+   */
+  function arrayMap(array, iteratee) {
+    var index = -1,
+        length = array == null ? 0 : array.length,
+        result = Array(length);
+
+    while (++index < length) {
+      result[index] = iteratee(array[index], index, array);
+    }
+    return result;
   }
-  return result;
-};
-ClipperLib.Clipper.prototype.SetHoleState = function (e, outRec)
-{
-  var isHole = false;
-  var e2 = e.PrevInAEL;
-  while (e2 !== null)
-  {
-    if (e2.OutIdx >= 0 && e2.WindDelta != 0)
-    {
-      isHole = !isHole;
-      if (outRec.FirstLeft === null)
-        outRec.FirstLeft = this.m_PolyOuts[e2.OutIdx];
+
+  /**
+   * Appends the elements of `values` to `array`.
+   *
+   * @private
+   * @param {Array} array The array to modify.
+   * @param {Array} values The values to append.
+   * @returns {Array} Returns `array`.
+   */
+  function arrayPush(array, values) {
+    var index = -1,
+        length = values.length,
+        offset = array.length;
+
+    while (++index < length) {
+      array[offset + index] = values[index];
     }
-    e2 = e2.PrevInAEL;
+    return array;
   }
-  if (isHole)
-    outRec.IsHole = true;
-};
-ClipperLib.Clipper.prototype.GetDx = function (pt1, pt2)
-{
-  if (pt1.Y == pt2.Y)
-    return ClipperLib.ClipperBase.horizontal;
-  else
-    return (pt2.X - pt1.X) / (pt2.Y - pt1.Y);
-};
-ClipperLib.Clipper.prototype.FirstIsBottomPt = function (btmPt1, btmPt2)
-{
-  var p = btmPt1.Prev;
-  while ((ClipperLib.IntPoint.op_Equality(p.Pt, btmPt1.Pt)) && (p != btmPt1))
-    p = p.Prev;
-  var dx1p = Math.abs(this.GetDx(btmPt1.Pt, p.Pt));
-  p = btmPt1.Next;
-  while ((ClipperLib.IntPoint.op_Equality(p.Pt, btmPt1.Pt)) && (p != btmPt1))
-    p = p.Next;
-  var dx1n = Math.abs(this.GetDx(btmPt1.Pt, p.Pt));
-  p = btmPt2.Prev;
-  while ((ClipperLib.IntPoint.op_Equality(p.Pt, btmPt2.Pt)) && (p != btmPt2))
-    p = p.Prev;
-  var dx2p = Math.abs(this.GetDx(btmPt2.Pt, p.Pt));
-  p = btmPt2.Next;
-  while ((ClipperLib.IntPoint.op_Equality(p.Pt, btmPt2.Pt)) && (p != btmPt2))
-    p = p.Next;
-  var dx2n = Math.abs(this.GetDx(btmPt2.Pt, p.Pt));
-  return (dx1p >= dx2p && dx1p >= dx2n) || (dx1n >= dx2p && dx1n >= dx2n);
-};
-ClipperLib.Clipper.prototype.GetBottomPt = function (pp)
-{
-  var dups = null;
-  var p = pp.Next;
-  while (p != pp)
-  {
-    if (p.Pt.Y > pp.Pt.Y)
-    {
-      pp = p;
-      dups = null;
+
+  /**
+   * A specialized version of `_.reduce` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @param {*} [accumulator] The initial value.
+   * @param {boolean} [initAccum] Specify using the first element of `array` as
+   *  the initial value.
+   * @returns {*} Returns the accumulated value.
+   */
+  function arrayReduce(array, iteratee, accumulator, initAccum) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
+
+    if (initAccum && length) {
+      accumulator = array[++index];
     }
-    else if (p.Pt.Y == pp.Pt.Y && p.Pt.X <= pp.Pt.X)
-    {
-      if (p.Pt.X < pp.Pt.X)
-      {
-        dups = null;
-        pp = p;
-      }
-      else
-      {
-        if (p.Next != pp && p.Prev != pp)
-          dups = p;
-      }
+    while (++index < length) {
+      accumulator = iteratee(accumulator, array[index], index, array);
     }
-    p = p.Next;
+    return accumulator;
   }
-  if (dups !== null)
-  {
-    //there appears to be at least 2 vertices at bottomPt so ...
-    while (dups != p)
-    {
-      if (!this.FirstIsBottomPt(p, dups))
-        pp = dups;
-      dups = dups.Next;
-      while (ClipperLib.IntPoint.op_Inequality(dups.Pt, pp.Pt))
-        dups = dups.Next;
+
+  /**
+   * A specialized version of `_.reduceRight` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @param {*} [accumulator] The initial value.
+   * @param {boolean} [initAccum] Specify using the last element of `array` as
+   *  the initial value.
+   * @returns {*} Returns the accumulated value.
+   */
+  function arrayReduceRight(array, iteratee, accumulator, initAccum) {
+    var length = array == null ? 0 : array.length;
+    if (initAccum && length) {
+      accumulator = array[--length];
     }
+    while (length--) {
+      accumulator = iteratee(accumulator, array[length], length, array);
+    }
+    return accumulator;
   }
-  return pp;
-};
-ClipperLib.Clipper.prototype.GetLowermostRec = function (outRec1, outRec2)
-{
-  //work out which polygon fragment has the correct hole state ...
-  if (outRec1.BottomPt === null)
-    outRec1.BottomPt = this.GetBottomPt(outRec1.Pts);
-  if (outRec2.BottomPt === null)
-    outRec2.BottomPt = this.GetBottomPt(outRec2.Pts);
-  var bPt1 = outRec1.BottomPt;
-  var bPt2 = outRec2.BottomPt;
-  if (bPt1.Pt.Y > bPt2.Pt.Y)
-    return outRec1;
-  else if (bPt1.Pt.Y < bPt2.Pt.Y)
-    return outRec2;
-  else if (bPt1.Pt.X < bPt2.Pt.X)
-    return outRec1;
-  else if (bPt1.Pt.X > bPt2.Pt.X)
-    return outRec2;
-  else if (bPt1.Next == bPt1)
-    return outRec2;
-  else if (bPt2.Next == bPt2)
-    return outRec1;
-  else if (this.FirstIsBottomPt(bPt1, bPt2))
-    return outRec1;
-  else
-    return outRec2;
-};
-ClipperLib.Clipper.prototype.Param1RightOfParam2 = function (outRec1, outRec2)
-{
-  do {
-    outRec1 = outRec1.FirstLeft;
-    if (outRec1 == outRec2)
-      return true;
-  }
-  while (outRec1 !== null)
-  return false;
-};
-ClipperLib.Clipper.prototype.GetOutRec = function (idx)
-{
-  var outrec = this.m_PolyOuts[idx];
-  while (outrec != this.m_PolyOuts[outrec.Idx])
-    outrec = this.m_PolyOuts[outrec.Idx];
-  return outrec;
-};
-ClipperLib.Clipper.prototype.AppendPolygon = function (e1, e2)
-{
-  //get the start and ends of both output polygons ...
-  var outRec1 = this.m_PolyOuts[e1.OutIdx];
-  var outRec2 = this.m_PolyOuts[e2.OutIdx];
-  var holeStateRec;
-  if (this.Param1RightOfParam2(outRec1, outRec2))
-    holeStateRec = outRec2;
-  else if (this.Param1RightOfParam2(outRec2, outRec1))
-    holeStateRec = outRec1;
-  else
-    holeStateRec = this.GetLowermostRec(outRec1, outRec2);
-  var p1_lft = outRec1.Pts;
-  var p1_rt = p1_lft.Prev;
-  var p2_lft = outRec2.Pts;
-  var p2_rt = p2_lft.Prev;
-  var side;
-  //join e2 poly onto e1 poly and delete pointers to e2 ...
-  if (e1.Side == ClipperLib.EdgeSide.esLeft)
-  {
-    if (e2.Side == ClipperLib.EdgeSide.esLeft)
-    {
-      //z y x a b c
-      this.ReversePolyPtLinks(p2_lft);
-      p2_lft.Next = p1_lft;
-      p1_lft.Prev = p2_lft;
-      p1_rt.Next = p2_rt;
-      p2_rt.Prev = p1_rt;
-      outRec1.Pts = p2_rt;
-    }
-    else
-    {
-      //x y z a b c
-      p2_rt.Next = p1_lft;
-      p1_lft.Prev = p2_rt;
-      p2_lft.Prev = p1_rt;
-      p1_rt.Next = p2_lft;
-      outRec1.Pts = p2_lft;
-    }
-    side = ClipperLib.EdgeSide.esLeft;
-  }
-  else
-  {
-    if (e2.Side == ClipperLib.EdgeSide.esRight)
-    {
-      //a b c z y x
-      this.ReversePolyPtLinks(p2_lft);
-      p1_rt.Next = p2_rt;
-      p2_rt.Prev = p1_rt;
-      p2_lft.Next = p1_lft;
-      p1_lft.Prev = p2_lft;
-    }
-    else
-    {
-      //a b c x y z
-      p1_rt.Next = p2_lft;
-      p2_lft.Prev = p1_rt;
-      p1_lft.Prev = p2_rt;
-      p2_rt.Next = p1_lft;
+
+  /**
+   * A specialized version of `_.some` for arrays without support for iteratee
+   * shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} predicate The function invoked per iteration.
+   * @returns {boolean} Returns `true` if any element passes the predicate check,
+   *  else `false`.
+   */
+  function arraySome(array, predicate) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
+
+    while (++index < length) {
+      if (predicate(array[index], index, array)) {
+        return true;
+      }
     }
-    side = ClipperLib.EdgeSide.esRight;
-  }
-  outRec1.BottomPt = null;
-  if (holeStateRec == outRec2)
-  {
-    if (outRec2.FirstLeft != outRec1)
-      outRec1.FirstLeft = outRec2.FirstLeft;
-    outRec1.IsHole = outRec2.IsHole;
+    return false;
   }
-  outRec2.Pts = null;
-  outRec2.BottomPt = null;
-  outRec2.FirstLeft = outRec1;
-  var OKIdx = e1.OutIdx;
-  var ObsoleteIdx = e2.OutIdx;
-  e1.OutIdx = -1;
-  //nb: safe because we only get here via AddLocalMaxPoly
-  e2.OutIdx = -1;
-  var e = this.m_ActiveEdges;
-  while (e !== null)
-  {
-    if (e.OutIdx == ObsoleteIdx)
-    {
-      e.OutIdx = OKIdx;
-      e.Side = side;
-      break;
-    }
-    e = e.NextInAEL;
+
+  /**
+   * Gets the size of an ASCII `string`.
+   *
+   * @private
+   * @param {string} string The string inspect.
+   * @returns {number} Returns the string size.
+   */
+  var asciiSize = baseProperty('length');
+
+  /**
+   * Converts an ASCII `string` to an array.
+   *
+   * @private
+   * @param {string} string The string to convert.
+   * @returns {Array} Returns the converted array.
+   */
+  function asciiToArray(string) {
+    return string.split('');
   }
-  outRec2.Idx = outRec1.Idx;
-};
-ClipperLib.Clipper.prototype.ReversePolyPtLinks = function (pp)
-{
-  if (pp === null)
-    return;
-  var pp1;
-  var pp2;
-  pp1 = pp;
-  do {
-    pp2 = pp1.Next;
-    pp1.Next = pp1.Prev;
-    pp1.Prev = pp2;
-    pp1 = pp2;
+
+  /**
+   * Splits an ASCII `string` into an array of its words.
+   *
+   * @private
+   * @param {string} The string to inspect.
+   * @returns {Array} Returns the words of `string`.
+   */
+  function asciiWords(string) {
+    return string.match(reAsciiWord) || [];
   }
-  while (pp1 != pp)
-};
-ClipperLib.Clipper.SwapSides = function (edge1, edge2)
-{
-  var side = edge1.Side;
-  edge1.Side = edge2.Side;
-  edge2.Side = side;
-};
-ClipperLib.Clipper.SwapPolyIndexes = function (edge1, edge2)
-{
-  var outIdx = edge1.OutIdx;
-  edge1.OutIdx = edge2.OutIdx;
-  edge2.OutIdx = outIdx;
-};
-ClipperLib.Clipper.prototype.IntersectEdges = function (e1, e2, pt, protect)
-{
-  //e1 will be to the left of e2 BELOW the intersection. Therefore e1 is before
-  //e2 in AEL except when e1 is being inserted at the intersection point ...
-  var e1stops = !protect && e1.NextInLML === null &&
-    e1.Top.X == pt.X && e1.Top.Y == pt.Y;
-  var e2stops = !protect && e2.NextInLML === null &&
-    e2.Top.X == pt.X && e2.Top.Y == pt.Y;
-  var e1Contributing = (e1.OutIdx >= 0);
-  var e2Contributing = (e2.OutIdx >= 0);
-  if (use_lines)
-  {
-    //if either edge is on an OPEN path ...
-    if (e1.WindDelta === 0 || e2.WindDelta === 0)
-    {
-      //ignore subject-subject open path intersections UNLESS they
-      //are both open paths, AND they are both 'contributing maximas' ...
-      if (e1.WindDelta === 0 && e2.WindDelta === 0)
-      {
-        if ((e1stops || e2stops) && e1Contributing && e2Contributing)
-          this.AddLocalMaxPoly(e1, e2, pt);
-      }
-      //if intersecting a subj line with a subj poly ...
-      else if (e1.PolyTyp == e2.PolyTyp &&
-        e1.WindDelta != e2.WindDelta && this.m_ClipType == ClipperLib.ClipType.ctUnion)
-      {
-        if (e1.WindDelta === 0)
-        {
-          if (e2Contributing)
-          {
-            this.AddOutPt(e1, pt);
-            if (e1Contributing)
-              e1.OutIdx = -1;
-          }
-        }
-        else
-        {
-          if (e1Contributing)
-          {
-            this.AddOutPt(e2, pt);
-            if (e2Contributing)
-              e2.OutIdx = -1;
-          }
-        }
-      }
-      else if (e1.PolyTyp != e2.PolyTyp)
-      {
-        if ((e1.WindDelta === 0) && Math.abs(e2.WindCnt) == 1 &&
-          (this.m_ClipType != ClipperLib.ClipType.ctUnion || e2.WindCnt2 === 0))
-        {
-          this.AddOutPt(e1, pt);
-          if (e1Contributing)
-            e1.OutIdx = -1;
-        }
-        else if ((e2.WindDelta === 0) && (Math.abs(e1.WindCnt) == 1) &&
-          (this.m_ClipType != ClipperLib.ClipType.ctUnion || e1.WindCnt2 === 0))
-        {
-          this.AddOutPt(e2, pt);
-          if (e2Contributing)
-            e2.OutIdx = -1;
-        }
+
+  /**
+   * The base implementation of methods like `_.findKey` and `_.findLastKey`,
+   * without support for iteratee shorthands, which iterates over `collection`
+   * using `eachFunc`.
+   *
+   * @private
+   * @param {Array|Object} collection The collection to inspect.
+   * @param {Function} predicate The function invoked per iteration.
+   * @param {Function} eachFunc The function to iterate over `collection`.
+   * @returns {*} Returns the found element or its key, else `undefined`.
+   */
+  function baseFindKey(collection, predicate, eachFunc) {
+    var result;
+    eachFunc(collection, function(value, key, collection) {
+      if (predicate(value, key, collection)) {
+        result = key;
+        return false;
       }
-      if (e1stops)
-        if (e1.OutIdx < 0)
-          this.DeleteFromAEL(e1);
-        else
-          ClipperLib.Error("Error intersecting polylines");
-      if (e2stops)
-        if (e2.OutIdx < 0)
-          this.DeleteFromAEL(e2);
-        else
-          ClipperLib.Error("Error intersecting polylines");
-      return;
-    }
+    });
+    return result;
   }
-  //update winding counts...
-  //assumes that e1 will be to the Right of e2 ABOVE the intersection
-  if (e1.PolyTyp == e2.PolyTyp)
-  {
-    if (this.IsEvenOddFillType(e1))
-    {
-      var oldE1WindCnt = e1.WindCnt;
-      e1.WindCnt = e2.WindCnt;
-      e2.WindCnt = oldE1WindCnt;
-    }
-    else
-    {
-      if (e1.WindCnt + e2.WindDelta === 0)
-        e1.WindCnt = -e1.WindCnt;
-      else
-        e1.WindCnt += e2.WindDelta;
-      if (e2.WindCnt - e1.WindDelta === 0)
-        e2.WindCnt = -e2.WindCnt;
-      else
-        e2.WindCnt -= e1.WindDelta;
+
+  /**
+   * The base implementation of `_.findIndex` and `_.findLastIndex` without
+   * support for iteratee shorthands.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {Function} predicate The function invoked per iteration.
+   * @param {number} fromIndex The index to search from.
+   * @param {boolean} [fromRight] Specify iterating from right to left.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function baseFindIndex(array, predicate, fromIndex, fromRight) {
+    var length = array.length,
+        index = fromIndex + (fromRight ? 1 : -1);
+
+    while ((fromRight ? index-- : ++index < length)) {
+      if (predicate(array[index], index, array)) {
+        return index;
+      }
     }
+    return -1;
   }
-  else
-  {
-    if (!this.IsEvenOddFillType(e2))
-      e1.WindCnt2 += e2.WindDelta;
-    else
-      e1.WindCnt2 = (e1.WindCnt2 === 0) ? 1 : 0;
-    if (!this.IsEvenOddFillType(e1))
-      e2.WindCnt2 -= e1.WindDelta;
-    else
-      e2.WindCnt2 = (e2.WindCnt2 === 0) ? 1 : 0;
+
+  /**
+   * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} value The value to search for.
+   * @param {number} fromIndex The index to search from.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function baseIndexOf(array, value, fromIndex) {
+    return value === value
+      ? strictIndexOf(array, value, fromIndex)
+      : baseFindIndex(array, baseIsNaN, fromIndex);
   }
-  var e1FillType, e2FillType, e1FillType2, e2FillType2;
-  if (e1.PolyTyp == ClipperLib.PolyType.ptSubject)
-  {
-    e1FillType = this.m_SubjFillType;
-    e1FillType2 = this.m_ClipFillType;
+
+  /**
+   * This function is like `baseIndexOf` except that it accepts a comparator.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} value The value to search for.
+   * @param {number} fromIndex The index to search from.
+   * @param {Function} comparator The comparator invoked per element.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function baseIndexOfWith(array, value, fromIndex, comparator) {
+    var index = fromIndex - 1,
+        length = array.length;
+
+    while (++index < length) {
+      if (comparator(array[index], value)) {
+        return index;
+      }
+    }
+    return -1;
   }
-  else
-  {
-    e1FillType = this.m_ClipFillType;
-    e1FillType2 = this.m_SubjFillType;
+
+  /**
+   * The base implementation of `_.isNaN` without support for number objects.
+   *
+   * @private
+   * @param {*} value The value to check.
+   * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+   */
+  function baseIsNaN(value) {
+    return value !== value;
   }
-  if (e2.PolyTyp == ClipperLib.PolyType.ptSubject)
-  {
-    e2FillType = this.m_SubjFillType;
-    e2FillType2 = this.m_ClipFillType;
+
+  /**
+   * The base implementation of `_.mean` and `_.meanBy` without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} array The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {number} Returns the mean.
+   */
+  function baseMean(array, iteratee) {
+    var length = array == null ? 0 : array.length;
+    return length ? (baseSum(array, iteratee) / length) : NAN;
   }
-  else
-  {
-    e2FillType = this.m_ClipFillType;
-    e2FillType2 = this.m_SubjFillType;
+
+  /**
+   * The base implementation of `_.property` without support for deep paths.
+   *
+   * @private
+   * @param {string} key The key of the property to get.
+   * @returns {Function} Returns the new accessor function.
+   */
+  function baseProperty(key) {
+    return function(object) {
+      return object == null ? undefined : object[key];
+    };
   }
-  var e1Wc, e2Wc;
-  switch (e1FillType)
-  {
-  case ClipperLib.PolyFillType.pftPositive:
-    e1Wc = e1.WindCnt;
-    break;
-  case ClipperLib.PolyFillType.pftNegative:
-    e1Wc = -e1.WindCnt;
-    break;
-  default:
-    e1Wc = Math.abs(e1.WindCnt);
-    break;
+
+  /**
+   * The base implementation of `_.propertyOf` without support for deep paths.
+   *
+   * @private
+   * @param {Object} object The object to query.
+   * @returns {Function} Returns the new accessor function.
+   */
+  function basePropertyOf(object) {
+    return function(key) {
+      return object == null ? undefined : object[key];
+    };
   }
-  switch (e2FillType)
-  {
-  case ClipperLib.PolyFillType.pftPositive:
-    e2Wc = e2.WindCnt;
-    break;
-  case ClipperLib.PolyFillType.pftNegative:
-    e2Wc = -e2.WindCnt;
-    break;
-  default:
-    e2Wc = Math.abs(e2.WindCnt);
-    break;
+
+  /**
+   * The base implementation of `_.reduce` and `_.reduceRight`, without support
+   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.
+   *
+   * @private
+   * @param {Array|Object} collection The collection to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @param {*} accumulator The initial value.
+   * @param {boolean} initAccum Specify using the first or last element of
+   *  `collection` as the initial value.
+   * @param {Function} eachFunc The function to iterate over `collection`.
+   * @returns {*} Returns the accumulated value.
+   */
+  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {
+    eachFunc(collection, function(value, index, collection) {
+      accumulator = initAccum
+        ? (initAccum = false, value)
+        : iteratee(accumulator, value, index, collection);
+    });
+    return accumulator;
   }
-  if (e1Contributing && e2Contributing)
-  {
-    if (e1stops || e2stops || (e1Wc !== 0 && e1Wc != 1) || (e2Wc !== 0 && e2Wc != 1) ||
-      (e1.PolyTyp != e2.PolyTyp && this.m_ClipType != ClipperLib.ClipType.ctXor))
-      this.AddLocalMaxPoly(e1, e2, pt);
-    else
-    {
-      this.AddOutPt(e1, pt);
-      this.AddOutPt(e2, pt);
-      ClipperLib.Clipper.SwapSides(e1, e2);
-      ClipperLib.Clipper.SwapPolyIndexes(e1, e2);
+
+  /**
+   * The base implementation of `_.sortBy` which uses `comparer` to define the
+   * sort order of `array` and replaces criteria objects with their corresponding
+   * values.
+   *
+   * @private
+   * @param {Array} array The array to sort.
+   * @param {Function} comparer The function to define sort order.
+   * @returns {Array} Returns `array`.
+   */
+  function baseSortBy(array, comparer) {
+    var length = array.length;
+
+    array.sort(comparer);
+    while (length--) {
+      array[length] = array[length].value;
     }
+    return array;
   }
-  else if (e1Contributing)
-  {
-    if (e2Wc === 0 || e2Wc == 1)
-    {
-      this.AddOutPt(e1, pt);
-      ClipperLib.Clipper.SwapSides(e1, e2);
-      ClipperLib.Clipper.SwapPolyIndexes(e1, e2);
+
+  /**
+   * The base implementation of `_.sum` and `_.sumBy` without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} array The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {number} Returns the sum.
+   */
+  function baseSum(array, iteratee) {
+    var result,
+        index = -1,
+        length = array.length;
+
+    while (++index < length) {
+      var current = iteratee(array[index]);
+      if (current !== undefined) {
+        result = result === undefined ? current : (result + current);
+      }
     }
+    return result;
   }
-  else if (e2Contributing)
-  {
-    if (e1Wc === 0 || e1Wc == 1)
-    {
-      this.AddOutPt(e2, pt);
-      ClipperLib.Clipper.SwapSides(e1, e2);
-      ClipperLib.Clipper.SwapPolyIndexes(e1, e2);
+
+  /**
+   * The base implementation of `_.times` without support for iteratee shorthands
+   * or max array length checks.
+   *
+   * @private
+   * @param {number} n The number of times to invoke `iteratee`.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {Array} Returns the array of results.
+   */
+  function baseTimes(n, iteratee) {
+    var index = -1,
+        result = Array(n);
+
+    while (++index < n) {
+      result[index] = iteratee(index);
     }
+    return result;
   }
-  else if ((e1Wc === 0 || e1Wc == 1) &&
-    (e2Wc === 0 || e2Wc == 1) && !e1stops && !e2stops)
-  {
-    //neither edge is currently contributing ...
-    var e1Wc2, e2Wc2;
-    switch (e1FillType2)
-    {
-    case ClipperLib.PolyFillType.pftPositive:
-      e1Wc2 = e1.WindCnt2;
-      break;
-    case ClipperLib.PolyFillType.pftNegative:
-      e1Wc2 = -e1.WindCnt2;
-      break;
-    default:
-      e1Wc2 = Math.abs(e1.WindCnt2);
-      break;
-    }
-    switch (e2FillType2)
-    {
-    case ClipperLib.PolyFillType.pftPositive:
-      e2Wc2 = e2.WindCnt2;
-      break;
-    case ClipperLib.PolyFillType.pftNegative:
-      e2Wc2 = -e2.WindCnt2;
-      break;
-    default:
-      e2Wc2 = Math.abs(e2.WindCnt2);
-      break;
-    }
-    if (e1.PolyTyp != e2.PolyTyp)
-      this.AddLocalMinPoly(e1, e2, pt);
-    else if (e1Wc == 1 && e2Wc == 1)
-      switch (this.m_ClipType)
-      {
-      case ClipperLib.ClipType.ctIntersection:
-        if (e1Wc2 > 0 && e2Wc2 > 0)
-          this.AddLocalMinPoly(e1, e2, pt);
-        break;
-      case ClipperLib.ClipType.ctUnion:
-        if (e1Wc2 <= 0 && e2Wc2 <= 0)
-          this.AddLocalMinPoly(e1, e2, pt);
-        break;
-      case ClipperLib.ClipType.ctDifference:
-        if (((e1.PolyTyp == ClipperLib.PolyType.ptClip) && (e1Wc2 > 0) && (e2Wc2 > 0)) ||
-          ((e1.PolyTyp == ClipperLib.PolyType.ptSubject) && (e1Wc2 <= 0) && (e2Wc2 <= 0)))
-          this.AddLocalMinPoly(e1, e2, pt);
-        break;
-      case ClipperLib.ClipType.ctXor:
-        this.AddLocalMinPoly(e1, e2, pt);
-        break;
-      }
-    else
-      ClipperLib.Clipper.SwapSides(e1, e2);
+
+  /**
+   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array
+   * of key-value pairs for `object` corresponding to the property names of `props`.
+   *
+   * @private
+   * @param {Object} object The object to query.
+   * @param {Array} props The property names to get values for.
+   * @returns {Object} Returns the key-value pairs.
+   */
+  function baseToPairs(object, props) {
+    return arrayMap(props, function(key) {
+      return [key, object[key]];
+    });
   }
-  if ((e1stops != e2stops) &&
-    ((e1stops && (e1.OutIdx >= 0)) || (e2stops && (e2.OutIdx >= 0))))
-  {
-    ClipperLib.Clipper.SwapSides(e1, e2);
-    ClipperLib.Clipper.SwapPolyIndexes(e1, e2);
+
+  /**
+   * The base implementation of `_.unary` without support for storing metadata.
+   *
+   * @private
+   * @param {Function} func The function to cap arguments for.
+   * @returns {Function} Returns the new capped function.
+   */
+  function baseUnary(func) {
+    return function(value) {
+      return func(value);
+    };
   }
-  //finally, delete any non-contributing maxima edges  ...
-  if (e1stops)
-    this.DeleteFromAEL(e1);
-  if (e2stops)
-    this.DeleteFromAEL(e2);
-};
-ClipperLib.Clipper.prototype.DeleteFromAEL = function (e)
-{
-  var AelPrev = e.PrevInAEL;
-  var AelNext = e.NextInAEL;
-  if (AelPrev === null && AelNext === null && (e != this.m_ActiveEdges))
-    return;
-  //already deleted
-  if (AelPrev !== null)
-    AelPrev.NextInAEL = AelNext;
-  else
-    this.m_ActiveEdges = AelNext;
-  if (AelNext !== null)
-    AelNext.PrevInAEL = AelPrev;
-  e.NextInAEL = null;
-  e.PrevInAEL = null;
-};
-ClipperLib.Clipper.prototype.DeleteFromSEL = function (e)
-{
-  var SelPrev = e.PrevInSEL;
-  var SelNext = e.NextInSEL;
-  if (SelPrev === null && SelNext === null && (e != this.m_SortedEdges))
-    return;
-  //already deleted
-  if (SelPrev !== null)
-    SelPrev.NextInSEL = SelNext;
-  else
-    this.m_SortedEdges = SelNext;
-  if (SelNext !== null)
-    SelNext.PrevInSEL = SelPrev;
-  e.NextInSEL = null;
-  e.PrevInSEL = null;
-};
-ClipperLib.Clipper.prototype.UpdateEdgeIntoAEL = function (e)
-{
-  if (e.NextInLML === null)
-    ClipperLib.Error("UpdateEdgeIntoAEL: invalid call");
-  var AelPrev = e.PrevInAEL;
-  var AelNext = e.NextInAEL;
-  e.NextInLML.OutIdx = e.OutIdx;
-  if (AelPrev !== null)
-    AelPrev.NextInAEL = e.NextInLML;
-  else
-    this.m_ActiveEdges = e.NextInLML;
-  if (AelNext !== null)
-    AelNext.PrevInAEL = e.NextInLML;
-  e.NextInLML.Side = e.Side;
-  e.NextInLML.WindDelta = e.WindDelta;
-  e.NextInLML.WindCnt = e.WindCnt;
-  e.NextInLML.WindCnt2 = e.WindCnt2;
-  e = e.NextInLML;
-  //    e.Curr = e.Bot;
-  e.Curr.X = e.Bot.X;
-  e.Curr.Y = e.Bot.Y;
-  e.PrevInAEL = AelPrev;
-  e.NextInAEL = AelNext;
-  if (!ClipperLib.ClipperBase.IsHorizontal(e))
-    this.InsertScanbeam(e.Top.Y);
-  return e;
-};
-ClipperLib.Clipper.prototype.ProcessHorizontals = function (isTopOfScanbeam)
-{
-  var horzEdge = this.m_SortedEdges;
-  while (horzEdge !== null)
-  {
-    this.DeleteFromSEL(horzEdge);
-    this.ProcessHorizontal(horzEdge, isTopOfScanbeam);
-    horzEdge = this.m_SortedEdges;
+
+  /**
+   * The base implementation of `_.values` and `_.valuesIn` which creates an
+   * array of `object` property values corresponding to the property names
+   * of `props`.
+   *
+   * @private
+   * @param {Object} object The object to query.
+   * @param {Array} props The property names to get values for.
+   * @returns {Object} Returns the array of property values.
+   */
+  function baseValues(object, props) {
+    return arrayMap(props, function(key) {
+      return object[key];
+    });
   }
-};
-ClipperLib.Clipper.prototype.GetHorzDirection = function (HorzEdge, $var)
-{
-  if (HorzEdge.Bot.X < HorzEdge.Top.X)
-  {
-      $var.Left = HorzEdge.Bot.X;
-      $var.Right = HorzEdge.Top.X;
-      $var.Dir = ClipperLib.Direction.dLeftToRight;
+
+  /**
+   * Checks if a `cache` value for `key` exists.
+   *
+   * @private
+   * @param {Object} cache The cache to query.
+   * @param {string} key The key of the entry to check.
+   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+   */
+  function cacheHas(cache, key) {
+    return cache.has(key);
   }
-  else
-  {
-      $var.Left = HorzEdge.Top.X;
-      $var.Right = HorzEdge.Bot.X;
-      $var.Dir = ClipperLib.Direction.dRightToLeft;
+
+  /**
+   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol
+   * that is not found in the character symbols.
+   *
+   * @private
+   * @param {Array} strSymbols The string symbols to inspect.
+   * @param {Array} chrSymbols The character symbols to find.
+   * @returns {number} Returns the index of the first unmatched string symbol.
+   */
+  function charsStartIndex(strSymbols, chrSymbols) {
+    var index = -1,
+        length = strSymbols.length;
+
+    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
+    return index;
   }
-};
-ClipperLib.Clipper.prototype.PrepareHorzJoins = function (horzEdge, isTopOfScanbeam)
-{
-  //get the last Op for this horizontal edge
-  //the point may be anywhere along the horizontal ...
-  var outPt = this.m_PolyOuts[horzEdge.OutIdx].Pts;
-  if (horzEdge.Side != ClipperLib.EdgeSide.esLeft)
-    outPt = outPt.Prev;
-  //First, match up overlapping horizontal edges (eg when one polygon's
-  //intermediate horz edge overlaps an intermediate horz edge of another, or
-  //when one polygon sits on top of another) ...
-  //for (var i = 0, ilen = this.m_GhostJoins.length; i < ilen; ++i) {
-  //  var j = this.m_GhostJoins[i];
-  //  if (this.HorzSegmentsOverlap(j.OutPt1.Pt, j.OffPt, horzEdge.Bot, horzEdge.Top))
-  //    this.AddJoin(j.OutPt1, outPt, j.OffPt);
-  //}
 
-  //Also, since horizontal edges at the top of one SB are often removed from
-  //the AEL before we process the horizontal edges at the bottom of the next,
-  //we need to create 'ghost' Join records of 'contrubuting' horizontals that
-  //we can compare with horizontals at the bottom of the next SB.
-  if (isTopOfScanbeam)
-    if (ClipperLib.IntPoint.op_Equality(outPt.Pt, horzEdge.Top))
-      this.AddGhostJoin(outPt, horzEdge.Bot);
-    else
-      this.AddGhostJoin(outPt, horzEdge.Top);
-};
-ClipperLib.Clipper.prototype.ProcessHorizontal = function (horzEdge, isTopOfScanbeam)
-{
-  var $var = {Dir: null, Left: null, Right: null};
-  this.GetHorzDirection(horzEdge, $var);
-  var dir = $var.Dir;
-  var horzLeft = $var.Left;
-  var horzRight = $var.Right;
-
-  var eLastHorz = horzEdge,
-    eMaxPair = null;
-  while (eLastHorz.NextInLML !== null && ClipperLib.ClipperBase.IsHorizontal(eLastHorz.NextInLML))
-    eLastHorz = eLastHorz.NextInLML;
-  if (eLastHorz.NextInLML === null)
-    eMaxPair = this.GetMaximaPair(eLastHorz);
-  for (;;)
-  {
-    var IsLastHorz = (horzEdge == eLastHorz);
-    var e = this.GetNextInAEL(horzEdge, dir);
-    while (e !== null)
-    {
-      //Break if we've got to the end of an intermediate horizontal edge ...
-      //nb: Smaller Dx's are to the right of larger Dx's ABOVE the horizontal.
-      if (e.Curr.X == horzEdge.Top.X && horzEdge.NextInLML !== null && e.Dx < horzEdge.NextInLML.Dx)
-        break;
-      var eNext = this.GetNextInAEL(e, dir);
-      //saves eNext for later
-      if ((dir == ClipperLib.Direction.dLeftToRight && e.Curr.X <= horzRight) || (dir == ClipperLib.Direction.dRightToLeft && e.Curr.X >= horzLeft))
-      {
+  /**
+   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol
+   * that is not found in the character symbols.
+   *
+   * @private
+   * @param {Array} strSymbols The string symbols to inspect.
+   * @param {Array} chrSymbols The character symbols to find.
+   * @returns {number} Returns the index of the last unmatched string symbol.
+   */
+  function charsEndIndex(strSymbols, chrSymbols) {
+    var index = strSymbols.length;
 
-        if (horzEdge.OutIdx >= 0 && horzEdge.WindDelta != 0)
-          this.PrepareHorzJoins(horzEdge, isTopOfScanbeam);
+    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
+    return index;
+  }
 
-        //so far we're still in range of the horizontal Edge  but make sure
-        //we're at the last of consec. horizontals when matching with eMaxPair
-        if (e == eMaxPair && IsLastHorz)
-        {
-          if (dir == ClipperLib.Direction.dLeftToRight)
-            this.IntersectEdges(horzEdge, e, e.Top, false);
-          else
-            this.IntersectEdges(e, horzEdge, e.Top, false);
-          if (eMaxPair.OutIdx >= 0)
-            ClipperLib.Error("ProcessHorizontal error");
-          return;
-        }
-        else if (dir == ClipperLib.Direction.dLeftToRight)
-        {
-          var Pt = new ClipperLib.IntPoint(e.Curr.X, horzEdge.Curr.Y);
-          this.IntersectEdges(horzEdge, e, Pt, true);
-        }
-        else
-        {
-          var Pt = new ClipperLib.IntPoint(e.Curr.X, horzEdge.Curr.Y);
-          this.IntersectEdges(e, horzEdge, Pt, true);
-        }
-        this.SwapPositionsInAEL(horzEdge, e);
+  /**
+   * Gets the number of `placeholder` occurrences in `array`.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} placeholder The placeholder to search for.
+   * @returns {number} Returns the placeholder count.
+   */
+  function countHolders(array, placeholder) {
+    var length = array.length,
+        result = 0;
+
+    while (length--) {
+      if (array[length] === placeholder) {
+        ++result;
       }
-      else if ((dir == ClipperLib.Direction.dLeftToRight && e.Curr.X >= horzRight) || (dir == ClipperLib.Direction.dRightToLeft && e.Curr.X <= horzLeft))
-        break;
-      e = eNext;
-    }
-    //end while
-    if (horzEdge.OutIdx >= 0 && horzEdge.WindDelta !== 0)
-      this.PrepareHorzJoins(horzEdge, isTopOfScanbeam);
-    if (horzEdge.NextInLML !== null && ClipperLib.ClipperBase.IsHorizontal(horzEdge.NextInLML))
-    {
-      horzEdge = this.UpdateEdgeIntoAEL(horzEdge);
-      if (horzEdge.OutIdx >= 0)
-        this.AddOutPt(horzEdge, horzEdge.Bot);
-        
-        var $var = {Dir: dir, Left: horzLeft, Right: horzRight};
-        this.GetHorzDirection(horzEdge, $var);
-        dir = $var.Dir;
-        horzLeft = $var.Left;
-        horzRight = $var.Right;
     }
-    else
-      break;
+    return result;
   }
-  //end for (;;)
-  if (horzEdge.NextInLML !== null)
-  {
-    if (horzEdge.OutIdx >= 0)
-    {
-      var op1 = this.AddOutPt(horzEdge, horzEdge.Top);
-      horzEdge = this.UpdateEdgeIntoAEL(horzEdge);
-      if (horzEdge.WindDelta === 0)
-        return;
-      //nb: HorzEdge is no longer horizontal here
-      var ePrev = horzEdge.PrevInAEL;
-      var eNext = horzEdge.NextInAEL;
-      if (ePrev !== null && ePrev.Curr.X == horzEdge.Bot.X &&
-        ePrev.Curr.Y == horzEdge.Bot.Y && ePrev.WindDelta !== 0 &&
-        (ePrev.OutIdx >= 0 && ePrev.Curr.Y > ePrev.Top.Y &&
-          ClipperLib.ClipperBase.SlopesEqual(horzEdge, ePrev, this.m_UseFullRange)))
-      {
-        var op2 = this.AddOutPt(ePrev, horzEdge.Bot);
-        this.AddJoin(op1, op2, horzEdge.Top);
-      }
-      else if (eNext !== null && eNext.Curr.X == horzEdge.Bot.X &&
-        eNext.Curr.Y == horzEdge.Bot.Y && eNext.WindDelta !== 0 &&
-        eNext.OutIdx >= 0 && eNext.Curr.Y > eNext.Top.Y &&
-        ClipperLib.ClipperBase.SlopesEqual(horzEdge, eNext, this.m_UseFullRange))
-      {
-        var op2 = this.AddOutPt(eNext, horzEdge.Bot);
-        this.AddJoin(op1, op2, horzEdge.Top);
-      }
-    }
-    else horzEdge = this.UpdateEdgeIntoAEL(horzEdge);
+
+  /**
+   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A
+   * letters to basic Latin letters.
+   *
+   * @private
+   * @param {string} letter The matched letter to deburr.
+   * @returns {string} Returns the deburred letter.
+   */
+  var deburrLetter = basePropertyOf(deburredLetters);
+
+  /**
+   * Used by `_.escape` to convert characters to HTML entities.
+   *
+   * @private
+   * @param {string} chr The matched character to escape.
+   * @returns {string} Returns the escaped character.
+   */
+  var escapeHtmlChar = basePropertyOf(htmlEscapes);
+
+  /**
+   * Used by `_.template` to escape characters for inclusion in compiled string literals.
+   *
+   * @private
+   * @param {string} chr The matched character to escape.
+   * @returns {string} Returns the escaped character.
+   */
+  function escapeStringChar(chr) {
+    return '\\' + stringEscapes[chr];
   }
-  else if (eMaxPair !== null)
-  {
-    if (eMaxPair.OutIdx >= 0)
-    {
-      if (dir == ClipperLib.Direction.dLeftToRight)
-        this.IntersectEdges(horzEdge, eMaxPair, horzEdge.Top, false);
-      else
-        this.IntersectEdges(eMaxPair, horzEdge, horzEdge.Top, false);
-      if (eMaxPair.OutIdx >= 0)
-        ClipperLib.Error("ProcessHorizontal error");
-    }
-    else
-    {
-      this.DeleteFromAEL(horzEdge);
-      this.DeleteFromAEL(eMaxPair);
-    }
+
+  /**
+   * Gets the value at `key` of `object`.
+   *
+   * @private
+   * @param {Object} [object] The object to query.
+   * @param {string} key The key of the property to get.
+   * @returns {*} Returns the property value.
+   */
+  function getValue(object, key) {
+    return object == null ? undefined : object[key];
   }
-  else
-  {
-    if (horzEdge.OutIdx >= 0)
-      this.AddOutPt(horzEdge, horzEdge.Top);
-    this.DeleteFromAEL(horzEdge);
+
+  /**
+   * Checks if `string` contains Unicode symbols.
+   *
+   * @private
+   * @param {string} string The string to inspect.
+   * @returns {boolean} Returns `true` if a symbol is found, else `false`.
+   */
+  function hasUnicode(string) {
+    return reHasUnicode.test(string);
   }
-};
-ClipperLib.Clipper.prototype.GetNextInAEL = function (e, Direction)
-{
-  return Direction == ClipperLib.Direction.dLeftToRight ? e.NextInAEL : e.PrevInAEL;
-};
-ClipperLib.Clipper.prototype.IsMinima = function (e)
-{
-  return e !== null && (e.Prev.NextInLML != e) && (e.Next.NextInLML != e);
-};
-ClipperLib.Clipper.prototype.IsMaxima = function (e, Y)
-{
-  return (e !== null && e.Top.Y == Y && e.NextInLML === null);
-};
-ClipperLib.Clipper.prototype.IsIntermediate = function (e, Y)
-{
-  return (e.Top.Y == Y && e.NextInLML !== null);
-};
-ClipperLib.Clipper.prototype.GetMaximaPair = function (e)
-{
-  var result = null;
-  if ((ClipperLib.IntPoint.op_Equality(e.Next.Top, e.Top)) && e.Next.NextInLML === null)
-    result = e.Next;
-  else if ((ClipperLib.IntPoint.op_Equality(e.Prev.Top, e.Top)) && e.Prev.NextInLML === null)
-    result = e.Prev;
-  if (result !== null && (result.OutIdx == -2 || (result.NextInAEL == result.PrevInAEL && !ClipperLib.ClipperBase.IsHorizontal(result))))
-    return null;
-  return result;
-};
-ClipperLib.Clipper.prototype.ProcessIntersections = function (botY, topY)
-{
-  if (this.m_ActiveEdges == null)
-    return true;
-  try
-  {
-    this.BuildIntersectList(botY, topY);
-    if (this.m_IntersectList.length == 0)
-      return true;
-    if (this.m_IntersectList.length == 1 || this.FixupIntersectionOrder())
-      this.ProcessIntersectList();
-    else
-      return false;
+
+  /**
+   * Checks if `string` contains a word composed of Unicode symbols.
+   *
+   * @private
+   * @param {string} string The string to inspect.
+   * @returns {boolean} Returns `true` if a word is found, else `false`.
+   */
+  function hasUnicodeWord(string) {
+    return reHasUnicodeWord.test(string);
   }
-  catch ($$e2)
-  {
-    this.m_SortedEdges = null;
-    this.m_IntersectList.length = 0;
-    ClipperLib.Error("ProcessIntersections error");
+
+  /**
+   * Converts `iterator` to an array.
+   *
+   * @private
+   * @param {Object} iterator The iterator to convert.
+   * @returns {Array} Returns the converted array.
+   */
+  function iteratorToArray(iterator) {
+    var data,
+        result = [];
+
+    while (!(data = iterator.next()).done) {
+      result.push(data.value);
+    }
+    return result;
   }
-  this.m_SortedEdges = null;
-  return true;
-};
-ClipperLib.Clipper.prototype.BuildIntersectList = function (botY, topY)
-{
-  if (this.m_ActiveEdges === null)
-    return;
-  //prepare for sorting ...
-  var e = this.m_ActiveEdges;
-  //console.log(JSON.stringify(JSON.decycle( e )));
-  this.m_SortedEdges = e;
-  while (e !== null)
-  {
-    e.PrevInSEL = e.PrevInAEL;
-    e.NextInSEL = e.NextInAEL;
-    e.Curr.X = ClipperLib.Clipper.TopX(e, topY);
-    e = e.NextInAEL;
+
+  /**
+   * Converts `map` to its key-value pairs.
+   *
+   * @private
+   * @param {Object} map The map to convert.
+   * @returns {Array} Returns the key-value pairs.
+   */
+  function mapToArray(map) {
+    var index = -1,
+        result = Array(map.size);
+
+    map.forEach(function(value, key) {
+      result[++index] = [key, value];
+    });
+    return result;
   }
-  //bubblesort ...
-  var isModified = true;
-  while (isModified && this.m_SortedEdges !== null)
-  {
-    isModified = false;
-    e = this.m_SortedEdges;
-    while (e.NextInSEL !== null)
-    {
-      var eNext = e.NextInSEL;
-      var pt = new ClipperLib.IntPoint();
-      //console.log("e.Curr.X: " + e.Curr.X + " eNext.Curr.X" + eNext.Curr.X);
-      if (e.Curr.X > eNext.Curr.X)
-      {
-        if (!this.IntersectPoint(e, eNext, pt) && e.Curr.X > eNext.Curr.X + 1)
-        {
-          //console.log("e.Curr.X: "+JSON.stringify(JSON.decycle( e.Curr.X )));
-          //console.log("eNext.Curr.X+1: "+JSON.stringify(JSON.decycle( eNext.Curr.X+1)));
-          ClipperLib.Error("Intersection error");
-        }
-        if (pt.Y > botY)
-        {
-          pt.Y = botY;
-          if (Math.abs(e.Dx) > Math.abs(eNext.Dx))
-            pt.X = ClipperLib.Clipper.TopX(eNext, botY);
-          else
-            pt.X = ClipperLib.Clipper.TopX(e, botY);
-        }
-        var newNode = new ClipperLib.IntersectNode();
-        newNode.Edge1 = e;
-        newNode.Edge2 = eNext;
-        //newNode.Pt = pt;
-        newNode.Pt.X = pt.X;
-        newNode.Pt.Y = pt.Y;
-        this.m_IntersectList.push(newNode);
-        this.SwapPositionsInSEL(e, eNext);
-        isModified = true;
+
+  /**
+   * Creates a unary function that invokes `func` with its argument transformed.
+   *
+   * @private
+   * @param {Function} func The function to wrap.
+   * @param {Function} transform The argument transform.
+   * @returns {Function} Returns the new function.
+   */
+  function overArg(func, transform) {
+    return function(arg) {
+      return func(transform(arg));
+    };
+  }
+
+  /**
+   * Replaces all `placeholder` elements in `array` with an internal placeholder
+   * and returns an array of their indexes.
+   *
+   * @private
+   * @param {Array} array The array to modify.
+   * @param {*} placeholder The placeholder to replace.
+   * @returns {Array} Returns the new array of placeholder indexes.
+   */
+  function replaceHolders(array, placeholder) {
+    var index = -1,
+        length = array.length,
+        resIndex = 0,
+        result = [];
+
+    while (++index < length) {
+      var value = array[index];
+      if (value === placeholder || value === PLACEHOLDER) {
+        array[index] = PLACEHOLDER;
+        result[resIndex++] = index;
       }
-      else
-        e = eNext;
     }
-    if (e.PrevInSEL !== null)
-      e.PrevInSEL.NextInSEL = null;
-    else
-      break;
+    return result;
   }
-  this.m_SortedEdges = null;
-};
-ClipperLib.Clipper.prototype.EdgesAdjacent = function (inode)
-{
-  return (inode.Edge1.NextInSEL == inode.Edge2) || (inode.Edge1.PrevInSEL == inode.Edge2);
-};
-ClipperLib.Clipper.IntersectNodeSort = function (node1, node2)
-{
-  //the following typecast is safe because the differences in Pt.Y will
-  //be limited to the height of the scanbeam.
-  return (node2.Pt.Y - node1.Pt.Y);
-};
-ClipperLib.Clipper.prototype.FixupIntersectionOrder = function ()
-{
-  //pre-condition: intersections are sorted bottom-most first.
-  //Now it's crucial that intersections are made only between adjacent edges,
-  //so to ensure this the order of intersections may need adjusting ...
-  this.m_IntersectList.sort(this.m_IntersectNodeComparer);
-  this.CopyAELToSEL();
-  var cnt = this.m_IntersectList.length;
-  for (var i = 0; i < cnt; i++)
-  {
-    if (!this.EdgesAdjacent(this.m_IntersectList[i]))
-    {
-      var j = i + 1;
-      while (j < cnt && !this.EdgesAdjacent(this.m_IntersectList[j]))
-        j++;
-      if (j == cnt)
-        return false;
-      var tmp = this.m_IntersectList[i];
-      this.m_IntersectList[i] = this.m_IntersectList[j];
-      this.m_IntersectList[j] = tmp;
-    }
-    this.SwapPositionsInSEL(this.m_IntersectList[i].Edge1, this.m_IntersectList[i].Edge2);
+
+  /**
+   * Converts `set` to an array of its values.
+   *
+   * @private
+   * @param {Object} set The set to convert.
+   * @returns {Array} Returns the values.
+   */
+  function setToArray(set) {
+    var index = -1,
+        result = Array(set.size);
+
+    set.forEach(function(value) {
+      result[++index] = value;
+    });
+    return result;
   }
-  return true;
-};
-ClipperLib.Clipper.prototype.ProcessIntersectList = function ()
-{
-  for (var i = 0, ilen = this.m_IntersectList.length; i < ilen; i++)
-  {
-    var iNode = this.m_IntersectList[i];
-    this.IntersectEdges(iNode.Edge1, iNode.Edge2, iNode.Pt, true);
-    this.SwapPositionsInAEL(iNode.Edge1, iNode.Edge2);
+
+  /**
+   * Converts `set` to its value-value pairs.
+   *
+   * @private
+   * @param {Object} set The set to convert.
+   * @returns {Array} Returns the value-value pairs.
+   */
+  function setToPairs(set) {
+    var index = -1,
+        result = Array(set.size);
+
+    set.forEach(function(value) {
+      result[++index] = [value, value];
+    });
+    return result;
   }
-  this.m_IntersectList.length = 0;
-};
-/*
---------------------------------
-Round speedtest: http://jsperf.com/fastest-round
---------------------------------
-*/
-var R1 = function (a)
-{
-  return a < 0 ? Math.ceil(a - 0.5) : Math.round(a)
-};
-var R2 = function (a)
-{
-  return a < 0 ? Math.ceil(a - 0.5) : Math.floor(a + 0.5)
-};
-var R3 = function (a)
-{
-  return a < 0 ? -Math.round(Math.abs(a)) : Math.round(a)
-};
-var R4 = function (a)
-{
-  if (a < 0)
-  {
-    a -= 0.5;
-    return a < -2147483648 ? Math.ceil(a) : a | 0;
-  }
-  else
-  {
-    a += 0.5;
-    return a > 2147483647 ? Math.floor(a) : a | 0;
-  }
-};
-if (browser.msie) ClipperLib.Clipper.Round = R1;
-else if (browser.chromium) ClipperLib.Clipper.Round = R3;
-else if (browser.safari) ClipperLib.Clipper.Round = R4;
-else ClipperLib.Clipper.Round = R2; // eg. browser.chrome || browser.firefox || browser.opera
-ClipperLib.Clipper.TopX = function (edge, currentY)
-{
-  //if (edge.Bot == edge.Curr) alert ("edge.Bot = edge.Curr");
-  //if (edge.Bot == edge.Top) alert ("edge.Bot = edge.Top");
-  if (currentY == edge.Top.Y)
-    return edge.Top.X;
-  return edge.Bot.X + ClipperLib.Clipper.Round(edge.Dx * (currentY - edge.Bot.Y));
-};
-ClipperLib.Clipper.prototype.IntersectPoint = function (edge1, edge2, ip)
-{
-  ip.X = 0;
-  ip.Y = 0;
-  var b1, b2;
-  //nb: with very large coordinate values, it's possible for SlopesEqual() to 
-  //return false but for the edge.Dx value be equal due to double precision rounding.
-  if (ClipperLib.ClipperBase.SlopesEqual(edge1, edge2, this.m_UseFullRange) || edge1.Dx == edge2.Dx)
-  {
-    if (edge2.Bot.Y > edge1.Bot.Y)
-    {
-      ip.X = edge2.Bot.X;
-      ip.Y = edge2.Bot.Y;
-    }
-    else
-    {
-      ip.X = edge1.Bot.X;
-      ip.Y = edge1.Bot.Y;
-    }
-    return false;
-  }
-  else if (edge1.Delta.X === 0)
-  {
-    ip.X = edge1.Bot.X;
-    if (ClipperLib.ClipperBase.IsHorizontal(edge2))
-    {
-      ip.Y = edge2.Bot.Y;
-    }
-    else
-    {
-      b2 = edge2.Bot.Y - (edge2.Bot.X / edge2.Dx);
-      ip.Y = ClipperLib.Clipper.Round(ip.X / edge2.Dx + b2);
-    }
-  }
-  else if (edge2.Delta.X === 0)
-  {
-    ip.X = edge2.Bot.X;
-    if (ClipperLib.ClipperBase.IsHorizontal(edge1))
-    {
-      ip.Y = edge1.Bot.Y;
-    }
-    else
-    {
-      b1 = edge1.Bot.Y - (edge1.Bot.X / edge1.Dx);
-      ip.Y = ClipperLib.Clipper.Round(ip.X / edge1.Dx + b1);
-    }
-  }
-  else
-  {
-    b1 = edge1.Bot.X - edge1.Bot.Y * edge1.Dx;
-    b2 = edge2.Bot.X - edge2.Bot.Y * edge2.Dx;
-    var q = (b2 - b1) / (edge1.Dx - edge2.Dx);
-    ip.Y = ClipperLib.Clipper.Round(q);
-    if (Math.abs(edge1.Dx) < Math.abs(edge2.Dx))
-      ip.X = ClipperLib.Clipper.Round(edge1.Dx * q + b1);
-    else
-      ip.X = ClipperLib.Clipper.Round(edge2.Dx * q + b2);
-  }
-  if (ip.Y < edge1.Top.Y || ip.Y < edge2.Top.Y)
-  {
-    if (edge1.Top.Y > edge2.Top.Y)
-    {
-      ip.Y = edge1.Top.Y;
-      ip.X = ClipperLib.Clipper.TopX(edge2, edge1.Top.Y);
-      return ip.X < edge1.Top.X;
-    }
-    else
-      ip.Y = edge2.Top.Y;
-    if (Math.abs(edge1.Dx) < Math.abs(edge2.Dx))
-      ip.X = ClipperLib.Clipper.TopX(edge1, ip.Y);
-    else
-      ip.X = ClipperLib.Clipper.TopX(edge2, ip.Y);
-  }
-  return true;
-};
-ClipperLib.Clipper.prototype.ProcessEdgesAtTopOfScanbeam = function (topY)
-{
-  var e = this.m_ActiveEdges;
-  while (e !== null)
-  {
-    //1. process maxima, treating them as if they're 'bent' horizontal edges,
-    //   but exclude maxima with horizontal edges. nb: e can't be a horizontal.
-    var IsMaximaEdge = this.IsMaxima(e, topY);
-    if (IsMaximaEdge)
-    {
-      var eMaxPair = this.GetMaximaPair(e);
-      IsMaximaEdge = (eMaxPair === null || !ClipperLib.ClipperBase.IsHorizontal(eMaxPair));
-    }
-    if (IsMaximaEdge)
-    {
-      var ePrev = e.PrevInAEL;
-      this.DoMaxima(e);
-      if (ePrev === null)
-        e = this.m_ActiveEdges;
-      else
-        e = ePrev.NextInAEL;
-    }
-    else
-    {
-      //2. promote horizontal edges, otherwise update Curr.X and Curr.Y ...
-      if (this.IsIntermediate(e, topY) && ClipperLib.ClipperBase.IsHorizontal(e.NextInLML))
-      {
-        e = this.UpdateEdgeIntoAEL(e);
-        if (e.OutIdx >= 0)
-          this.AddOutPt(e, e.Bot);
-        this.AddEdgeToSEL(e);
-      }
-      else
-      {
-        e.Curr.X = ClipperLib.Clipper.TopX(e, topY);
-        e.Curr.Y = topY;
-      }
-      if (this.StrictlySimple)
-      {
-        var ePrev = e.PrevInAEL;
-        if ((e.OutIdx >= 0) && (e.WindDelta !== 0) && ePrev !== null &&
-          (ePrev.OutIdx >= 0) && (ePrev.Curr.X == e.Curr.X) &&
-          (ePrev.WindDelta !== 0))
-        {
-          var op = this.AddOutPt(ePrev, e.Curr);
-          var op2 = this.AddOutPt(e, e.Curr);
-          this.AddJoin(op, op2, e.Curr);
-          //StrictlySimple (type-3) join
-        }
+
+  /**
+   * A specialized version of `_.indexOf` which performs strict equality
+   * comparisons of values, i.e. `===`.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} value The value to search for.
+   * @param {number} fromIndex The index to search from.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function strictIndexOf(array, value, fromIndex) {
+    var index = fromIndex - 1,
+        length = array.length;
+
+    while (++index < length) {
+      if (array[index] === value) {
+        return index;
       }
-      e = e.NextInAEL;
     }
+    return -1;
   }
-  //3. Process horizontals at the Top of the scanbeam ...
-  this.ProcessHorizontals(true);
-  //4. Promote intermediate vertices ...
-  e = this.m_ActiveEdges;
-  while (e !== null)
-  {
-    if (this.IsIntermediate(e, topY))
-    {
-      var op = null;
-      if (e.OutIdx >= 0)
-        op = this.AddOutPt(e, e.Top);
-      e = this.UpdateEdgeIntoAEL(e);
-      //if output polygons share an edge, they'll need joining later ...
-      var ePrev = e.PrevInAEL;
-      var eNext = e.NextInAEL;
-      if (ePrev !== null && ePrev.Curr.X == e.Bot.X &&
-        ePrev.Curr.Y == e.Bot.Y && op !== null &&
-        ePrev.OutIdx >= 0 && ePrev.Curr.Y > ePrev.Top.Y &&
-        ClipperLib.ClipperBase.SlopesEqual(e, ePrev, this.m_UseFullRange) &&
-        (e.WindDelta !== 0) && (ePrev.WindDelta !== 0))
-      {
-        var op2 = this.AddOutPt(ePrev, e.Bot);
-        this.AddJoin(op, op2, e.Top);
-      }
-      else if (eNext !== null && eNext.Curr.X == e.Bot.X &&
-        eNext.Curr.Y == e.Bot.Y && op !== null &&
-        eNext.OutIdx >= 0 && eNext.Curr.Y > eNext.Top.Y &&
-        ClipperLib.ClipperBase.SlopesEqual(e, eNext, this.m_UseFullRange) &&
-        (e.WindDelta !== 0) && (eNext.WindDelta !== 0))
-      {
-        var op2 = this.AddOutPt(eNext, e.Bot);
-        this.AddJoin(op, op2, e.Top);
+
+  /**
+   * A specialized version of `_.lastIndexOf` which performs strict equality
+   * comparisons of values, i.e. `===`.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} value The value to search for.
+   * @param {number} fromIndex The index to search from.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function strictLastIndexOf(array, value, fromIndex) {
+    var index = fromIndex + 1;
+    while (index--) {
+      if (array[index] === value) {
+        return index;
       }
     }
-    e = e.NextInAEL;
-  }
-};
-ClipperLib.Clipper.prototype.DoMaxima = function (e)
-{
-  var eMaxPair = this.GetMaximaPair(e);
-  if (eMaxPair === null)
-  {
-    if (e.OutIdx >= 0)
-      this.AddOutPt(e, e.Top);
-    this.DeleteFromAEL(e);
-    return;
-  }
-  var eNext = e.NextInAEL;
-  var use_lines = true;
-  while (eNext !== null && eNext != eMaxPair)
-  {
-    this.IntersectEdges(e, eNext, e.Top, true);
-    this.SwapPositionsInAEL(e, eNext);
-    eNext = e.NextInAEL;
-  }
-  if (e.OutIdx == -1 && eMaxPair.OutIdx == -1)
-  {
-    this.DeleteFromAEL(e);
-    this.DeleteFromAEL(eMaxPair);
-  }
-  else if (e.OutIdx >= 0 && eMaxPair.OutIdx >= 0)
-  {
-    this.IntersectEdges(e, eMaxPair, e.Top, false);
-  }
-  else if (use_lines && e.WindDelta === 0)
-  {
-    if (e.OutIdx >= 0)
-    {
-      this.AddOutPt(e, e.Top);
-      e.OutIdx = -1;
-    }
-    this.DeleteFromAEL(e);
-    if (eMaxPair.OutIdx >= 0)
-    {
-      this.AddOutPt(eMaxPair, e.Top);
-      eMaxPair.OutIdx = -1;
-    }
-    this.DeleteFromAEL(eMaxPair);
-  }
-  else
-    ClipperLib.Error("DoMaxima error");
-};
-ClipperLib.Clipper.ReversePaths = function (polys)
-{
-  for (var i = 0, len = polys.length; i < len; i++)
-    polys[i].reverse();
-};
-ClipperLib.Clipper.Orientation = function (poly)
-{
-  return ClipperLib.Clipper.Area(poly) >= 0;
-};
-ClipperLib.Clipper.prototype.PointCount = function (pts)
-{
-  if (pts === null)
-    return 0;
-  var result = 0;
-  var p = pts;
-  do {
-    result++;
-    p = p.Next;
-  }
-  while (p != pts)
-  return result;
-};
-ClipperLib.Clipper.prototype.BuildResult = function (polyg)
-{
-  ClipperLib.Clear(polyg);
-  for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
-  {
-    var outRec = this.m_PolyOuts[i];
-    if (outRec.Pts === null)
-      continue;
-    var p = outRec.Pts.Prev;
-    var cnt = this.PointCount(p);
-    if (cnt < 2)
-      continue;
-    var pg = new Array(cnt);
-    for (var j = 0; j < cnt; j++)
-    {
-      pg[j] = p.Pt;
-      p = p.Prev;
-    }
-    polyg.push(pg);
-  }
-};
-ClipperLib.Clipper.prototype.BuildResult2 = function (polytree)
-{
-  polytree.Clear();
-  //add each output polygon/contour to polytree ...
-  //polytree.m_AllPolys.set_Capacity(this.m_PolyOuts.length);
-  for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
-  {
-    var outRec = this.m_PolyOuts[i];
-    var cnt = this.PointCount(outRec.Pts);
-    if ((outRec.IsOpen && cnt < 2) || (!outRec.IsOpen && cnt < 3))
-      continue;
-    this.FixHoleLinkage(outRec);
-    var pn = new ClipperLib.PolyNode();
-    polytree.m_AllPolys.push(pn);
-    outRec.PolyNode = pn;
-    pn.m_polygon.length = cnt;
-    var op = outRec.Pts.Prev;
-    for (var j = 0; j < cnt; j++)
-    {
-      pn.m_polygon[j] = op.Pt;
-      op = op.Prev;
-    }
-  }
-  //fixup PolyNode links etc ...
-  //polytree.m_Childs.set_Capacity(this.m_PolyOuts.length);
-  for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
-  {
-    var outRec = this.m_PolyOuts[i];
-    if (outRec.PolyNode === null)
-      continue;
-    else if (outRec.IsOpen)
-    {
-      outRec.PolyNode.IsOpen = true;
-      polytree.AddChild(outRec.PolyNode);
-    }
-    else if (outRec.FirstLeft !== null && outRec.FirstLeft.PolyNode != null)
-      outRec.FirstLeft.PolyNode.AddChild(outRec.PolyNode);
-    else
-      polytree.AddChild(outRec.PolyNode);
-  }
-};
-ClipperLib.Clipper.prototype.FixupOutPolygon = function (outRec)
-{
-  //FixupOutPolygon() - removes duplicate points and simplifies consecutive
-  //parallel edges by removing the middle vertex.
-  var lastOK = null;
-  outRec.BottomPt = null;
-  var pp = outRec.Pts;
-  for (;;)
-  {
-    if (pp.Prev == pp || pp.Prev == pp.Next)
-    {
-      this.DisposeOutPts(pp);
-      outRec.Pts = null;
-      return;
-    }
-    //test for duplicate points and collinear edges ...
-    if ((ClipperLib.IntPoint.op_Equality(pp.Pt, pp.Next.Pt)) || (ClipperLib.IntPoint.op_Equality(pp.Pt, pp.Prev.Pt)) ||
-      (ClipperLib.ClipperBase.SlopesEqual(pp.Prev.Pt, pp.Pt, pp.Next.Pt, this.m_UseFullRange) &&
-        (!this.PreserveCollinear || !this.Pt2IsBetweenPt1AndPt3(pp.Prev.Pt, pp.Pt, pp.Next.Pt))))
-    {
-      lastOK = null;
-      var tmp = pp;
-      pp.Prev.Next = pp.Next;
-      pp.Next.Prev = pp.Prev;
-      pp = pp.Prev;
-      tmp = null;
-    }
-    else if (pp == lastOK)
-      break;
-    else
-    {
-      if (lastOK === null)
-        lastOK = pp;
-      pp = pp.Next;
-    }
-  }
-  outRec.Pts = pp;
-};
-ClipperLib.Clipper.prototype.DupOutPt = function (outPt, InsertAfter)
-{
-  var result = new ClipperLib.OutPt();
-  //result.Pt = outPt.Pt;
-  result.Pt.X = outPt.Pt.X;
-  result.Pt.Y = outPt.Pt.Y;
-  result.Idx = outPt.Idx;
-  if (InsertAfter)
-  {
-    result.Next = outPt.Next;
-    result.Prev = outPt;
-    outPt.Next.Prev = result;
-    outPt.Next = result;
-  }
-  else
-  {
-    result.Prev = outPt.Prev;
-    result.Next = outPt;
-    outPt.Prev.Next = result;
-    outPt.Prev = result;
-  }
-  return result;
-};
-ClipperLib.Clipper.prototype.GetOverlap = function (a1, a2, b1, b2, $val)
-{
-  if (a1 < a2)
-  {
-    if (b1 < b2)
-    {
-      $val.Left = Math.max(a1, b1);
-      $val.Right = Math.min(a2, b2);
-    }
-    else
-    {
-      $val.Left = Math.max(a1, b2);
-      $val.Right = Math.min(a2, b1);
-    }
-  }
-  else
-  {
-    if (b1 < b2)
-    {
-      $val.Left = Math.max(a2, b1);
-      $val.Right = Math.min(a1, b2);
-    }
-    else
-    {
-      $val.Left = Math.max(a2, b2);
-      $val.Right = Math.min(a1, b1);
-    }
-  }
-  return $val.Left < $val.Right;
-};
-ClipperLib.Clipper.prototype.JoinHorz = function (op1, op1b, op2, op2b, Pt, DiscardLeft)
-{
-  var Dir1 = (op1.Pt.X > op1b.Pt.X ? ClipperLib.Direction.dRightToLeft : ClipperLib.Direction.dLeftToRight);
-  var Dir2 = (op2.Pt.X > op2b.Pt.X ? ClipperLib.Direction.dRightToLeft : ClipperLib.Direction.dLeftToRight);
-  if (Dir1 == Dir2)
-    return false;
-  //When DiscardLeft, we want Op1b to be on the Left of Op1, otherwise we
-  //want Op1b to be on the Right. (And likewise with Op2 and Op2b.)
-  //So, to facilitate this while inserting Op1b and Op2b ...
-  //when DiscardLeft, make sure we're AT or RIGHT of Pt before adding Op1b,
-  //otherwise make sure we're AT or LEFT of Pt. (Likewise with Op2b.)
-  if (Dir1 == ClipperLib.Direction.dLeftToRight)
-  {
-    while (op1.Next.Pt.X <= Pt.X &&
-      op1.Next.Pt.X >= op1.Pt.X && op1.Next.Pt.Y == Pt.Y)
-      op1 = op1.Next;
-    if (DiscardLeft && (op1.Pt.X != Pt.X))
-      op1 = op1.Next;
-    op1b = this.DupOutPt(op1, !DiscardLeft);
-    if (ClipperLib.IntPoint.op_Inequality(op1b.Pt, Pt))
-    {
-      op1 = op1b;
-      //op1.Pt = Pt;
-      op1.Pt.X = Pt.X;
-      op1.Pt.Y = Pt.Y;
-      op1b = this.DupOutPt(op1, !DiscardLeft);
-    }
+    return index;
   }
-  else
-  {
-    while (op1.Next.Pt.X >= Pt.X &&
-      op1.Next.Pt.X <= op1.Pt.X && op1.Next.Pt.Y == Pt.Y)
-      op1 = op1.Next;
-    if (!DiscardLeft && (op1.Pt.X != Pt.X))
-      op1 = op1.Next;
-    op1b = this.DupOutPt(op1, DiscardLeft);
-    if (ClipperLib.IntPoint.op_Inequality(op1b.Pt, Pt))
-    {
-      op1 = op1b;
-      //op1.Pt = Pt;
-      op1.Pt.X = Pt.X;
-      op1.Pt.Y = Pt.Y;
-      op1b = this.DupOutPt(op1, DiscardLeft);
-    }
+
+  /**
+   * Gets the number of symbols in `string`.
+   *
+   * @private
+   * @param {string} string The string to inspect.
+   * @returns {number} Returns the string size.
+   */
+  function stringSize(string) {
+    return hasUnicode(string)
+      ? unicodeSize(string)
+      : asciiSize(string);
   }
-  if (Dir2 == ClipperLib.Direction.dLeftToRight)
-  {
-    while (op2.Next.Pt.X <= Pt.X &&
-      op2.Next.Pt.X >= op2.Pt.X && op2.Next.Pt.Y == Pt.Y)
-      op2 = op2.Next;
-    if (DiscardLeft && (op2.Pt.X != Pt.X))
-      op2 = op2.Next;
-    op2b = this.DupOutPt(op2, !DiscardLeft);
-    if (ClipperLib.IntPoint.op_Inequality(op2b.Pt, Pt))
-    {
-      op2 = op2b;
-      //op2.Pt = Pt;
-      op2.Pt.X = Pt.X;
-      op2.Pt.Y = Pt.Y;
-      op2b = this.DupOutPt(op2, !DiscardLeft);
-    }
+
+  /**
+   * Converts `string` to an array.
+   *
+   * @private
+   * @param {string} string The string to convert.
+   * @returns {Array} Returns the converted array.
+   */
+  function stringToArray(string) {
+    return hasUnicode(string)
+      ? unicodeToArray(string)
+      : asciiToArray(string);
   }
-  else
-  {
-    while (op2.Next.Pt.X >= Pt.X &&
-      op2.Next.Pt.X <= op2.Pt.X && op2.Next.Pt.Y == Pt.Y)
-      op2 = op2.Next;
-    if (!DiscardLeft && (op2.Pt.X != Pt.X))
-      op2 = op2.Next;
-    op2b = this.DupOutPt(op2, DiscardLeft);
-    if (ClipperLib.IntPoint.op_Inequality(op2b.Pt, Pt))
-    {
-      op2 = op2b;
-      //op2.Pt = Pt;
-      op2.Pt.X = Pt.X;
-      op2.Pt.Y = Pt.Y;
-      op2b = this.DupOutPt(op2, DiscardLeft);
+
+  /**
+   * Used by `_.unescape` to convert HTML entities to characters.
+   *
+   * @private
+   * @param {string} chr The matched character to unescape.
+   * @returns {string} Returns the unescaped character.
+   */
+  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);
+
+  /**
+   * Gets the size of a Unicode `string`.
+   *
+   * @private
+   * @param {string} string The string inspect.
+   * @returns {number} Returns the string size.
+   */
+  function unicodeSize(string) {
+    var result = reUnicode.lastIndex = 0;
+    while (reUnicode.test(string)) {
+      ++result;
     }
+    return result;
   }
-  if ((Dir1 == ClipperLib.Direction.dLeftToRight) == DiscardLeft)
-  {
-    op1.Prev = op2;
-    op2.Next = op1;
-    op1b.Next = op2b;
-    op2b.Prev = op1b;
+
+  /**
+   * Converts a Unicode `string` to an array.
+   *
+   * @private
+   * @param {string} string The string to convert.
+   * @returns {Array} Returns the converted array.
+   */
+  function unicodeToArray(string) {
+    return string.match(reUnicode) || [];
   }
-  else
-  {
-    op1.Next = op2;
-    op2.Prev = op1;
-    op1b.Prev = op2b;
-    op2b.Next = op1b;
+
+  /**
+   * Splits a Unicode `string` into an array of its words.
+   *
+   * @private
+   * @param {string} The string to inspect.
+   * @returns {Array} Returns the words of `string`.
+   */
+  function unicodeWords(string) {
+    return string.match(reUnicodeWord) || [];
   }
-  return true;
-};
-ClipperLib.Clipper.prototype.JoinPoints = function (j, outRec1, outRec2)
-{
-  var op1 = j.OutPt1,
-    op1b = new ClipperLib.OutPt();
-  var op2 = j.OutPt2,
-    op2b = new ClipperLib.OutPt();
-  //There are 3 kinds of joins for output polygons ...
-  //1. Horizontal joins where Join.OutPt1 & Join.OutPt2 are a vertices anywhere
-  //along (horizontal) collinear edges (& Join.OffPt is on the same horizontal).
-  //2. Non-horizontal joins where Join.OutPt1 & Join.OutPt2 are at the same
-  //location at the Bottom of the overlapping segment (& Join.OffPt is above).
-  //3. StrictlySimple joins where edges touch but are not collinear and where
-  //Join.OutPt1, Join.OutPt2 & Join.OffPt all share the same point.
-  var isHorizontal = (j.OutPt1.Pt.Y == j.OffPt.Y);
-  if (isHorizontal && (ClipperLib.IntPoint.op_Equality(j.OffPt, j.OutPt1.Pt)) && (ClipperLib.IntPoint.op_Equality(j.OffPt, j.OutPt2.Pt)))
-  {
-    //Strictly Simple join ...
-    op1b = j.OutPt1.Next;
-    while (op1b != op1 && (ClipperLib.IntPoint.op_Equality(op1b.Pt, j.OffPt)))
-      op1b = op1b.Next;
-    var reverse1 = (op1b.Pt.Y > j.OffPt.Y);
-    op2b = j.OutPt2.Next;
-    while (op2b != op2 && (ClipperLib.IntPoint.op_Equality(op2b.Pt, j.OffPt)))
-      op2b = op2b.Next;
-    var reverse2 = (op2b.Pt.Y > j.OffPt.Y);
-    if (reverse1 == reverse2)
-      return false;
-    if (reverse1)
-    {
-      op1b = this.DupOutPt(op1, false);
-      op2b = this.DupOutPt(op2, true);
-      op1.Prev = op2;
-      op2.Next = op1;
-      op1b.Next = op2b;
-      op2b.Prev = op1b;
-      j.OutPt1 = op1;
-      j.OutPt2 = op1b;
-      return true;
-    }
-    else
-    {
-      op1b = this.DupOutPt(op1, true);
-      op2b = this.DupOutPt(op2, false);
-      op1.Next = op2;
-      op2.Prev = op1;
-      op1b.Prev = op2b;
-      op2b.Next = op1b;
-      j.OutPt1 = op1;
-      j.OutPt2 = op1b;
-      return true;
-    }
-  }
-  else if (isHorizontal)
-  {
-    //treat horizontal joins differently to non-horizontal joins since with
-    //them we're not yet sure where the overlapping is. OutPt1.Pt & OutPt2.Pt
-    //may be anywhere along the horizontal edge.
-    op1b = op1;
-    while (op1.Prev.Pt.Y == op1.Pt.Y && op1.Prev != op1b && op1.Prev != op2)
-      op1 = op1.Prev;
-    while (op1b.Next.Pt.Y == op1b.Pt.Y && op1b.Next != op1 && op1b.Next != op2)
-      op1b = op1b.Next;
-    if (op1b.Next == op1 || op1b.Next == op2)
-      return false;
-    //a flat 'polygon'
-    op2b = op2;
-    while (op2.Prev.Pt.Y == op2.Pt.Y && op2.Prev != op2b && op2.Prev != op1b)
-      op2 = op2.Prev;
-    while (op2b.Next.Pt.Y == op2b.Pt.Y && op2b.Next != op2 && op2b.Next != op1)
-      op2b = op2b.Next;
-    if (op2b.Next == op2 || op2b.Next == op1)
-      return false;
-    //a flat 'polygon'
-    //Op1 -. Op1b & Op2 -. Op2b are the extremites of the horizontal edges
 
-    var $val = {Left: null, Right: null};
-    if (!this.GetOverlap(op1.Pt.X, op1b.Pt.X, op2.Pt.X, op2b.Pt.X, $val))
-      return false;
-    var Left = $val.Left;
-    var Right = $val.Right;
-
-    //DiscardLeftSide: when overlapping edges are joined, a spike will created
-    //which needs to be cleaned up. However, we don't want Op1 or Op2 caught up
-    //on the discard Side as either may still be needed for other joins ...
-    var Pt = new ClipperLib.IntPoint();
-    var DiscardLeftSide;
-    if (op1.Pt.X >= Left && op1.Pt.X <= Right)
-    {
-      //Pt = op1.Pt;
-      Pt.X = op1.Pt.X;
-      Pt.Y = op1.Pt.Y;
-      DiscardLeftSide = (op1.Pt.X > op1b.Pt.X);
-    }
-    else if (op2.Pt.X >= Left && op2.Pt.X <= Right)
-    {
-      //Pt = op2.Pt;
-      Pt.X = op2.Pt.X;
-      Pt.Y = op2.Pt.Y;
-      DiscardLeftSide = (op2.Pt.X > op2b.Pt.X);
-    }
-    else if (op1b.Pt.X >= Left && op1b.Pt.X <= Right)
-    {
-      //Pt = op1b.Pt;
-      Pt.X = op1b.Pt.X;
-      Pt.Y = op1b.Pt.Y;
-      DiscardLeftSide = op1b.Pt.X > op1.Pt.X;
-    }
-    else
-    {
-      //Pt = op2b.Pt;
-      Pt.X = op2b.Pt.X;
-      Pt.Y = op2b.Pt.Y;
-      DiscardLeftSide = (op2b.Pt.X > op2.Pt.X);
-    }
-    j.OutPt1 = op1;
-    j.OutPt2 = op2;
-    return this.JoinHorz(op1, op1b, op2, op2b, Pt, DiscardLeftSide);
-  }
-  else
-  {
-    //nb: For non-horizontal joins ...
-    //    1. Jr.OutPt1.Pt.Y == Jr.OutPt2.Pt.Y
-    //    2. Jr.OutPt1.Pt > Jr.OffPt.Y
-    //make sure the polygons are correctly oriented ...
-    op1b = op1.Next;
-    while ((ClipperLib.IntPoint.op_Equality(op1b.Pt, op1.Pt)) && (op1b != op1))
-      op1b = op1b.Next;
-    var Reverse1 = ((op1b.Pt.Y > op1.Pt.Y) || !ClipperLib.ClipperBase.SlopesEqual(op1.Pt, op1b.Pt, j.OffPt, this.m_UseFullRange));
-    if (Reverse1)
-    {
-      op1b = op1.Prev;
-      while ((ClipperLib.IntPoint.op_Equality(op1b.Pt, op1.Pt)) && (op1b != op1))
-        op1b = op1b.Prev;
-      if ((op1b.Pt.Y > op1.Pt.Y) || !ClipperLib.ClipperBase.SlopesEqual(op1.Pt, op1b.Pt, j.OffPt, this.m_UseFullRange))
-        return false;
-    }
-    op2b = op2.Next;
-    while ((ClipperLib.IntPoint.op_Equality(op2b.Pt, op2.Pt)) && (op2b != op2))
-      op2b = op2b.Next;
-    var Reverse2 = ((op2b.Pt.Y > op2.Pt.Y) || !ClipperLib.ClipperBase.SlopesEqual(op2.Pt, op2b.Pt, j.OffPt, this.m_UseFullRange));
-    if (Reverse2)
-    {
-      op2b = op2.Prev;
-      while ((ClipperLib.IntPoint.op_Equality(op2b.Pt, op2.Pt)) && (op2b != op2))
-        op2b = op2b.Prev;
-      if ((op2b.Pt.Y > op2.Pt.Y) || !ClipperLib.ClipperBase.SlopesEqual(op2.Pt, op2b.Pt, j.OffPt, this.m_UseFullRange))
-        return false;
-    }
-    if ((op1b == op1) || (op2b == op2) || (op1b == op2b) ||
-      ((outRec1 == outRec2) && (Reverse1 == Reverse2)))
-      return false;
-    if (Reverse1)
-    {
-      op1b = this.DupOutPt(op1, false);
-      op2b = this.DupOutPt(op2, true);
-      op1.Prev = op2;
-      op2.Next = op1;
-      op1b.Next = op2b;
-      op2b.Prev = op1b;
-      j.OutPt1 = op1;
-      j.OutPt2 = op1b;
-      return true;
-    }
-    else
-    {
-      op1b = this.DupOutPt(op1, true);
-      op2b = this.DupOutPt(op2, false);
-      op1.Next = op2;
-      op2.Prev = op1;
-      op1b.Prev = op2b;
-      op2b.Next = op1b;
-      j.OutPt1 = op1;
-      j.OutPt2 = op1b;
-      return true;
-    }
-  }
-};
-ClipperLib.Clipper.GetBounds = function (paths)
-{
-  var i = 0,
-    cnt = paths.length;
-  while (i < cnt && paths[i].length == 0) i++;
-  if (i == cnt) return new ClipperLib.IntRect(0, 0, 0, 0);
-  var result = new ClipperLib.IntRect();
-  result.left = paths[i][0].X;
-  result.right = result.left;
-  result.top = paths[i][0].Y;
-  result.bottom = result.top;
-  for (; i < cnt; i++)
-    for (var j = 0, jlen = paths[i].length; j < jlen; j++)
-    {
-      if (paths[i][j].X < result.left) result.left = paths[i][j].X;
-      else if (paths[i][j].X > result.right) result.right = paths[i][j].X;
-      if (paths[i][j].Y < result.top) result.top = paths[i][j].Y;
-      else if (paths[i][j].Y > result.bottom) result.bottom = paths[i][j].Y;
-    }
-  return result;
-}
-ClipperLib.Clipper.prototype.GetBounds2 = function (ops)
-{
-  var opStart = ops;
-  var result = new ClipperLib.IntRect();
-  result.left = ops.Pt.X;
-  result.right = ops.Pt.X;
-  result.top = ops.Pt.Y;
-  result.bottom = ops.Pt.Y;
-  ops = ops.Next;
-  while (ops != opStart)
-  {
-    if (ops.Pt.X < result.left)
-      result.left = ops.Pt.X;
-    if (ops.Pt.X > result.right)
-      result.right = ops.Pt.X;
-    if (ops.Pt.Y < result.top)
-      result.top = ops.Pt.Y;
-    if (ops.Pt.Y > result.bottom)
-      result.bottom = ops.Pt.Y;
-    ops = ops.Next;
-  }
-  return result;
-};
+  /*--------------------------------------------------------------------------*/
 
-ClipperLib.Clipper.PointInPolygon = function (pt, path)
-{
-  //returns 0 if false, +1 if true, -1 if pt ON polygon boundary
-  //http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.88.5498&rep=rep1&type=pdf
-  var result = 0,
-    cnt = path.length;
-  if (cnt < 3)
-    return 0;
-  var ip = path[0];
-  for (var i = 1; i <= cnt; ++i)
-  {
-    var ipNext = (i == cnt ? path[0] : path[i]);
-    if (ipNext.Y == pt.Y)
-    {
-      if ((ipNext.X == pt.X) || (ip.Y == pt.Y && ((ipNext.X > pt.X) == (ip.X < pt.X))))
-        return -1;
-    }
-    if ((ip.Y < pt.Y) != (ipNext.Y < pt.Y))
-    {
-      if (ip.X >= pt.X)
-      {
-        if (ipNext.X > pt.X)
-          result = 1 - result;
-        else
-        {
-          var d = (ip.X - pt.X) * (ipNext.Y - pt.Y) - (ipNext.X - pt.X) * (ip.Y - pt.Y);
-          if (d == 0)
-            return -1;
-          else if ((d > 0) == (ipNext.Y > ip.Y))
-            result = 1 - result;
+  /**
+   * Create a new pristine `lodash` function using the `context` object.
+   *
+   * @static
+   * @memberOf _
+   * @since 1.1.0
+   * @category Util
+   * @param {Object} [context=root] The context object.
+   * @returns {Function} Returns a new `lodash` function.
+   * @example
+   *
+   * _.mixin({ 'foo': _.constant('foo') });
+   *
+   * var lodash = _.runInContext();
+   * lodash.mixin({ 'bar': lodash.constant('bar') });
+   *
+   * _.isFunction(_.foo);
+   * // => true
+   * _.isFunction(_.bar);
+   * // => false
+   *
+   * lodash.isFunction(lodash.foo);
+   * // => false
+   * lodash.isFunction(lodash.bar);
+   * // => true
+   *
+   * // Create a suped-up `defer` in Node.js.
+   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;
+   */
+  var runInContext = (function runInContext(context) {
+    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));
+
+    /** Built-in constructor references. */
+    var Array = context.Array,
+        Date = context.Date,
+        Error = context.Error,
+        Function = context.Function,
+        Math = context.Math,
+        Object = context.Object,
+        RegExp = context.RegExp,
+        String = context.String,
+        TypeError = context.TypeError;
+
+    /** Used for built-in method references. */
+    var arrayProto = Array.prototype,
+        funcProto = Function.prototype,
+        objectProto = Object.prototype;
+
+    /** Used to detect overreaching core-js shims. */
+    var coreJsData = context['__core-js_shared__'];
+
+    /** Used to resolve the decompiled source of functions. */
+    var funcToString = funcProto.toString;
+
+    /** Used to check objects for own properties. */
+    var hasOwnProperty = objectProto.hasOwnProperty;
+
+    /** Used to generate unique IDs. */
+    var idCounter = 0;
+
+    /** Used to detect methods masquerading as native. */
+    var maskSrcKey = (function() {
+      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');
+      return uid ? ('Symbol(src)_1.' + uid) : '';
+    }());
+
+    /**
+     * Used to resolve the
+     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+     * of values.
+     */
+    var nativeObjectToString = objectProto.toString;
+
+    /** Used to infer the `Object` constructor. */
+    var objectCtorString = funcToString.call(Object);
+
+    /** Used to restore the original `_` reference in `_.noConflict`. */
+    var oldDash = root._;
+
+    /** Used to detect if a method is native. */
+    var reIsNative = RegExp('^' +
+      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
+      .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
+    );
+
+    /** Built-in value references. */
+    var Buffer = moduleExports ? context.Buffer : undefined,
+        Symbol = context.Symbol,
+        Uint8Array = context.Uint8Array,
+        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,
+        getPrototype = overArg(Object.getPrototypeOf, Object),
+        objectCreate = Object.create,
+        propertyIsEnumerable = objectProto.propertyIsEnumerable,
+        splice = arrayProto.splice,
+        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,
+        symIterator = Symbol ? Symbol.iterator : undefined,
+        symToStringTag = Symbol ? Symbol.toStringTag : undefined;
+
+    var defineProperty = (function() {
+      try {
+        var func = getNative(Object, 'defineProperty');
+        func({}, '', {});
+        return func;
+      } catch (e) {}
+    }());
+
+    /** Mocked built-ins. */
+    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,
+        ctxNow = Date && Date.now !== root.Date.now && Date.now,
+        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;
+
+    /* Built-in method references for those with the same name as other `lodash` methods. */
+    var nativeCeil = Math.ceil,
+        nativeFloor = Math.floor,
+        nativeGetSymbols = Object.getOwnPropertySymbols,
+        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,
+        nativeIsFinite = context.isFinite,
+        nativeJoin = arrayProto.join,
+        nativeKeys = overArg(Object.keys, Object),
+        nativeMax = Math.max,
+        nativeMin = Math.min,
+        nativeNow = Date.now,
+        nativeParseInt = context.parseInt,
+        nativeRandom = Math.random,
+        nativeReverse = arrayProto.reverse;
+
+    /* Built-in method references that are verified to be native. */
+    var DataView = getNative(context, 'DataView'),
+        Map = getNative(context, 'Map'),
+        Promise = getNative(context, 'Promise'),
+        Set = getNative(context, 'Set'),
+        WeakMap = getNative(context, 'WeakMap'),
+        nativeCreate = getNative(Object, 'create');
+
+    /** Used to store function metadata. */
+    var metaMap = WeakMap && new WeakMap;
+
+    /** Used to lookup unminified function names. */
+    var realNames = {};
+
+    /** Used to detect maps, sets, and weakmaps. */
+    var dataViewCtorString = toSource(DataView),
+        mapCtorString = toSource(Map),
+        promiseCtorString = toSource(Promise),
+        setCtorString = toSource(Set),
+        weakMapCtorString = toSource(WeakMap);
+
+    /** Used to convert symbols to primitives and strings. */
+    var symbolProto = Symbol ? Symbol.prototype : undefined,
+        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,
+        symbolToString = symbolProto ? symbolProto.toString : undefined;
+
+    /*------------------------------------------------------------------------*/
+
+    /**
+     * Creates a `lodash` object which wraps `value` to enable implicit method
+     * chain sequences. Methods that operate on and return arrays, collections,
+     * and functions can be chained together. Methods that retrieve a single value
+     * or may return a primitive value will automatically end the chain sequence
+     * and return the unwrapped value. Otherwise, the value must be unwrapped
+     * with `_#value`.
+     *
+     * Explicit chain sequences, which must be unwrapped with `_#value`, may be
+     * enabled using `_.chain`.
+     *
+     * The execution of chained methods is lazy, that is, it's deferred until
+     * `_#value` is implicitly or explicitly called.
+     *
+     * Lazy evaluation allows several methods to support shortcut fusion.
+     * Shortcut fusion is an optimization to merge iteratee calls; this avoids
+     * the creation of intermediate arrays and can greatly reduce the number of
+     * iteratee executions. Sections of a chain sequence qualify for shortcut
+     * fusion if the section is applied to an array and iteratees accept only
+     * one argument. The heuristic for whether a section qualifies for shortcut
+     * fusion is subject to change.
+     *
+     * Chaining is supported in custom builds as long as the `_#value` method is
+     * directly or indirectly included in the build.
+     *
+     * In addition to lodash methods, wrappers have `Array` and `String` methods.
+     *
+     * The wrapper `Array` methods are:
+     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`
+     *
+     * The wrapper `String` methods are:
+     * `replace` and `split`
+     *
+     * The wrapper methods that support shortcut fusion are:
+     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,
+     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,
+     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`
+     *
+     * The chainable wrapper methods are:
+     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,
+     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,
+     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,
+     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,
+     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,
+     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,
+     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,
+     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,
+     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,
+     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,
+     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,
+     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,
+     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,
+     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,
+     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,
+     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,
+     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,
+     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,
+     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,
+     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,
+     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,
+     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,
+     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,
+     * `zipObject`, `zipObjectDeep`, and `zipWith`
+     *
+     * The wrapper methods that are **not** chainable by default are:
+     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,
+     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,
+     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,
+     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,
+     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,
+     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,
+     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,
+     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,
+     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,
+     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,
+     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,
+     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,
+     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,
+     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,
+     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,
+     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,
+     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,
+     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,
+     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,
+     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,
+     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,
+     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,
+     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,
+     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,
+     * `upperFirst`, `value`, and `words`
+     *
+     * @name _
+     * @constructor
+     * @category Seq
+     * @param {*} value The value to wrap in a `lodash` instance.
+     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @example
+     *
+     * function square(n) {
+     *   return n * n;
+     * }
+     *
+     * var wrapped = _([1, 2, 3]);
+     *
+     * // Returns an unwrapped value.
+     * wrapped.reduce(_.add);
+     * // => 6
+     *
+     * // Returns a wrapped value.
+     * var squares = wrapped.map(square);
+     *
+     * _.isArray(squares);
+     * // => false
+     *
+     * _.isArray(squares.value());
+     * // => true
+     */
+    function lodash(value) {
+      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {
+        if (value instanceof LodashWrapper) {
+          return value;
         }
-      }
-      else
-      {
-        if (ipNext.X > pt.X)
-        {
-          var d = (ip.X - pt.X) * (ipNext.Y - pt.Y) - (ipNext.X - pt.X) * (ip.Y - pt.Y);
-          if (d == 0)
-            return -1;
-          else if ((d > 0) == (ipNext.Y > ip.Y))
-            result = 1 - result;
+        if (hasOwnProperty.call(value, '__wrapped__')) {
+          return wrapperClone(value);
         }
       }
+      return new LodashWrapper(value);
     }
-    ip = ipNext;
-  }
-  return result;
-};
-    
-ClipperLib.Clipper.prototype.PointInPolygon = function (pt, op)
-{
-  //returns 0 if false, +1 if true, -1 if pt ON polygon boundary
-  //http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.88.5498&rep=rep1&type=pdf
-  var result = 0;
-  var startOp = op;
-  for (;;)
-  {
-    var poly0x = op.Pt.X,
-      poly0y = op.Pt.Y;
-    var poly1x = op.Next.Pt.X,
-      poly1y = op.Next.Pt.Y;
-    if (poly1y == pt.Y)
-    {
-      if ((poly1x == pt.X) || (poly0y == pt.Y && ((poly1x > pt.X) == (poly0x < pt.X))))
-        return -1;
-    }
-    if ((poly0y < pt.Y) != (poly1y < pt.Y))
-    {
-      if (poly0x >= pt.X)
-      {
-        if (poly1x > pt.X)
-          result = 1 - result;
-        else
-        {
-          var d = (poly0x - pt.X) * (poly1y - pt.Y) - (poly1x - pt.X) * (poly0y - pt.Y);
-          if (d == 0)
-            return -1;
-          if ((d > 0) == (poly1y > poly0y))
-            result = 1 - result;
+
+    /**
+     * The base implementation of `_.create` without support for assigning
+     * properties to the created object.
+     *
+     * @private
+     * @param {Object} proto The object to inherit from.
+     * @returns {Object} Returns the new object.
+     */
+    var baseCreate = (function() {
+      function object() {}
+      return function(proto) {
+        if (!isObject(proto)) {
+          return {};
         }
-      }
-      else
-      {
-        if (poly1x > pt.X)
-        {
-          var d = (poly0x - pt.X) * (poly1y - pt.Y) - (poly1x - pt.X) * (poly0y - pt.Y);
-          if (d == 0)
-            return -1;
-          if ((d > 0) == (poly1y > poly0y))
-            result = 1 - result;
+        if (objectCreate) {
+          return objectCreate(proto);
         }
-      }
+        object.prototype = proto;
+        var result = new object;
+        object.prototype = undefined;
+        return result;
+      };
+    }());
+
+    /**
+     * The function whose prototype chain sequence wrappers inherit from.
+     *
+     * @private
+     */
+    function baseLodash() {
+      // No operation performed.
     }
-    op = op.Next;
-    if (startOp == op)
-      break;
-  }
-  return result;
-};
 
-ClipperLib.Clipper.prototype.Poly2ContainsPoly1 = function (outPt1, outPt2)
-{
-  var op = outPt1;
-  do {
-    var res = this.PointInPolygon(op.Pt, outPt2);
-    if (res >= 0)
-      return res != 0;
-    op = op.Next;
-  }
-  while (op != outPt1)
-  return true;
-};
-ClipperLib.Clipper.prototype.FixupFirstLefts1 = function (OldOutRec, NewOutRec)
-{
-  for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
-  {
-    var outRec = this.m_PolyOuts[i];
-    if (outRec.Pts !== null && outRec.FirstLeft == OldOutRec)
-    {
-      if (this.Poly2ContainsPoly1(outRec.Pts, NewOutRec.Pts))
-        outRec.FirstLeft = NewOutRec;
+    /**
+     * The base constructor for creating `lodash` wrapper objects.
+     *
+     * @private
+     * @param {*} value The value to wrap.
+     * @param {boolean} [chainAll] Enable explicit method chain sequences.
+     */
+    function LodashWrapper(value, chainAll) {
+      this.__wrapped__ = value;
+      this.__actions__ = [];
+      this.__chain__ = !!chainAll;
+      this.__index__ = 0;
+      this.__values__ = undefined;
     }
-  }
-};
-ClipperLib.Clipper.prototype.FixupFirstLefts2 = function (OldOutRec, NewOutRec)
-{
-  for (var $i2 = 0, $t2 = this.m_PolyOuts, $l2 = $t2.length, outRec = $t2[$i2]; $i2 < $l2; $i2++, outRec = $t2[$i2])
-    if (outRec.FirstLeft == OldOutRec)
-      outRec.FirstLeft = NewOutRec;
-};
-ClipperLib.Clipper.ParseFirstLeft = function (FirstLeft)
-{
-  while (FirstLeft != null && FirstLeft.Pts == null)
-    FirstLeft = FirstLeft.FirstLeft;
-  return FirstLeft;
-};
-ClipperLib.Clipper.prototype.JoinCommonEdges = function ()
-{
-  for (var i = 0, ilen = this.m_Joins.length; i < ilen; i++)
-  {
-    var join = this.m_Joins[i];
-    var outRec1 = this.GetOutRec(join.OutPt1.Idx);
-    var outRec2 = this.GetOutRec(join.OutPt2.Idx);
-    if (outRec1.Pts == null || outRec2.Pts == null)
-      continue;
-    //get the polygon fragment with the correct hole state (FirstLeft)
-    //before calling JoinPoints() ...
-    var holeStateRec;
-    if (outRec1 == outRec2)
-      holeStateRec = outRec1;
-    else if (this.Param1RightOfParam2(outRec1, outRec2))
-      holeStateRec = outRec2;
-    else if (this.Param1RightOfParam2(outRec2, outRec1))
-      holeStateRec = outRec1;
-    else
-      holeStateRec = this.GetLowermostRec(outRec1, outRec2);
 
-    if (!this.JoinPoints(join, outRec1, outRec2)) continue;
+    /**
+     * By default, the template delimiters used by lodash are like those in
+     * embedded Ruby (ERB) as well as ES2015 template strings. Change the
+     * following template settings to use alternative delimiters.
+     *
+     * @static
+     * @memberOf _
+     * @type {Object}
+     */
+    lodash.templateSettings = {
+
+      /**
+       * Used to detect `data` property values to be HTML-escaped.
+       *
+       * @memberOf _.templateSettings
+       * @type {RegExp}
+       */
+      'escape': reEscape,
 
-    if (outRec1 == outRec2)
-    {
-      //instead of joining two polygons, we've just created a new one by
-      //splitting one polygon into two.
-      outRec1.Pts = join.OutPt1;
-      outRec1.BottomPt = null;
-      outRec2 = this.CreateOutRec();
-      outRec2.Pts = join.OutPt2;
-      //update all OutRec2.Pts Idx's ...
-      this.UpdateOutPtIdxs(outRec2);
-      //We now need to check every OutRec.FirstLeft pointer. If it points
-      //to OutRec1 it may need to point to OutRec2 instead ...
-      if (this.m_UsingPolyTree)
-        for (var j = 0, jlen = this.m_PolyOuts.length; j < jlen - 1; j++)
-        {
-          var oRec = this.m_PolyOuts[j];
-          if (oRec.Pts == null || ClipperLib.Clipper.ParseFirstLeft(oRec.FirstLeft) != outRec1 || oRec.IsHole == outRec1.IsHole)
-            continue;
-          if (this.Poly2ContainsPoly1(oRec.Pts, join.OutPt2))
-            oRec.FirstLeft = outRec2;
-        }
-      if (this.Poly2ContainsPoly1(outRec2.Pts, outRec1.Pts))
-      {
-        //outRec2 is contained by outRec1 ...
-        outRec2.IsHole = !outRec1.IsHole;
-        outRec2.FirstLeft = outRec1;
-        //fixup FirstLeft pointers that may need reassigning to OutRec1
-        if (this.m_UsingPolyTree)
-          this.FixupFirstLefts2(outRec2, outRec1);
-        if ((outRec2.IsHole ^ this.ReverseSolution) == (this.Area(outRec2) > 0))
-          this.ReversePolyPtLinks(outRec2.Pts);
-      }
-      else if (this.Poly2ContainsPoly1(outRec1.Pts, outRec2.Pts))
-      {
-        //outRec1 is contained by outRec2 ...
-        outRec2.IsHole = outRec1.IsHole;
-        outRec1.IsHole = !outRec2.IsHole;
-        outRec2.FirstLeft = outRec1.FirstLeft;
-        outRec1.FirstLeft = outRec2;
-        //fixup FirstLeft pointers that may need reassigning to OutRec1
-        if (this.m_UsingPolyTree)
-          this.FixupFirstLefts2(outRec1, outRec2);
-        if ((outRec1.IsHole ^ this.ReverseSolution) == (this.Area(outRec1) > 0))
-          this.ReversePolyPtLinks(outRec1.Pts);
-      }
-      else
-      {
-        //the 2 polygons are completely separate ...
-        outRec2.IsHole = outRec1.IsHole;
-        outRec2.FirstLeft = outRec1.FirstLeft;
-        //fixup FirstLeft pointers that may need reassigning to OutRec2
-        if (this.m_UsingPolyTree)
-          this.FixupFirstLefts1(outRec1, outRec2);
+      /**
+       * Used to detect code to be evaluated.
+       *
+       * @memberOf _.templateSettings
+       * @type {RegExp}
+       */
+      'evaluate': reEvaluate,
+
+      /**
+       * Used to detect `data` property values to inject.
+       *
+       * @memberOf _.templateSettings
+       * @type {RegExp}
+       */
+      'interpolate': reInterpolate,
+
+      /**
+       * Used to reference the data object in the template text.
+       *
+       * @memberOf _.templateSettings
+       * @type {string}
+       */
+      'variable': '',
+
+      /**
+       * Used to import variables into the compiled template.
+       *
+       * @memberOf _.templateSettings
+       * @type {Object}
+       */
+      'imports': {
+
+        /**
+         * A reference to the `lodash` function.
+         *
+         * @memberOf _.templateSettings.imports
+         * @type {Function}
+         */
+        '_': lodash
       }
+    };
+
+    // Ensure wrappers are instances of `baseLodash`.
+    lodash.prototype = baseLodash.prototype;
+    lodash.prototype.constructor = lodash;
+
+    LodashWrapper.prototype = baseCreate(baseLodash.prototype);
+    LodashWrapper.prototype.constructor = LodashWrapper;
+
+    /*------------------------------------------------------------------------*/
+
+    /**
+     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.
+     *
+     * @private
+     * @constructor
+     * @param {*} value The value to wrap.
+     */
+    function LazyWrapper(value) {
+      this.__wrapped__ = value;
+      this.__actions__ = [];
+      this.__dir__ = 1;
+      this.__filtered__ = false;
+      this.__iteratees__ = [];
+      this.__takeCount__ = MAX_ARRAY_LENGTH;
+      this.__views__ = [];
     }
-    else
-    {
-      //joined 2 polygons together ...
-      outRec2.Pts = null;
-      outRec2.BottomPt = null;
-      outRec2.Idx = outRec1.Idx;
-      outRec1.IsHole = holeStateRec.IsHole;
-      if (holeStateRec == outRec2)
-        outRec1.FirstLeft = outRec2.FirstLeft;
-      outRec2.FirstLeft = outRec1;
-      //fixup FirstLeft pointers that may need reassigning to OutRec1
-      if (this.m_UsingPolyTree)
-        this.FixupFirstLefts2(outRec2, outRec1);
+
+    /**
+     * Creates a clone of the lazy wrapper object.
+     *
+     * @private
+     * @name clone
+     * @memberOf LazyWrapper
+     * @returns {Object} Returns the cloned `LazyWrapper` object.
+     */
+    function lazyClone() {
+      var result = new LazyWrapper(this.__wrapped__);
+      result.__actions__ = copyArray(this.__actions__);
+      result.__dir__ = this.__dir__;
+      result.__filtered__ = this.__filtered__;
+      result.__iteratees__ = copyArray(this.__iteratees__);
+      result.__takeCount__ = this.__takeCount__;
+      result.__views__ = copyArray(this.__views__);
+      return result;
     }
-  }
-};
-ClipperLib.Clipper.prototype.UpdateOutPtIdxs = function (outrec)
-{
-  var op = outrec.Pts;
-  do {
-    op.Idx = outrec.Idx;
-    op = op.Prev;
-  }
-  while (op != outrec.Pts)
-};
-ClipperLib.Clipper.prototype.DoSimplePolygons = function ()
-{
-  var i = 0;
-  while (i < this.m_PolyOuts.length)
-  {
-    var outrec = this.m_PolyOuts[i++];
-    var op = outrec.Pts;
-    if (op === null)
-      continue;
-    do //for each Pt in Polygon until duplicate found do ...
-    {
-      var op2 = op.Next;
-      while (op2 != outrec.Pts)
-      {
-        if ((ClipperLib.IntPoint.op_Equality(op.Pt, op2.Pt)) && op2.Next != op && op2.Prev != op)
-        {
-          //split the polygon into two ...
-          var op3 = op.Prev;
-          var op4 = op2.Prev;
-          op.Prev = op4;
-          op4.Next = op;
-          op2.Prev = op3;
-          op3.Next = op2;
-          outrec.Pts = op;
-          var outrec2 = this.CreateOutRec();
-          outrec2.Pts = op2;
-          this.UpdateOutPtIdxs(outrec2);
-          if (this.Poly2ContainsPoly1(outrec2.Pts, outrec.Pts))
-          {
-            //OutRec2 is contained by OutRec1 ...
-            outrec2.IsHole = !outrec.IsHole;
-            outrec2.FirstLeft = outrec;
-          }
-          else if (this.Poly2ContainsPoly1(outrec.Pts, outrec2.Pts))
-          {
-            //OutRec1 is contained by OutRec2 ...
-            outrec2.IsHole = outrec.IsHole;
-            outrec.IsHole = !outrec2.IsHole;
-            outrec2.FirstLeft = outrec.FirstLeft;
-            outrec.FirstLeft = outrec2;
-          }
-          else
-          {
-            //the 2 polygons are separate ...
-            outrec2.IsHole = outrec.IsHole;
-            outrec2.FirstLeft = outrec.FirstLeft;
+
+    /**
+     * Reverses the direction of lazy iteration.
+     *
+     * @private
+     * @name reverse
+     * @memberOf LazyWrapper
+     * @returns {Object} Returns the new reversed `LazyWrapper` object.
+     */
+    function lazyReverse() {
+      if (this.__filtered__) {
+        var result = new LazyWrapper(this);
+        result.__dir__ = -1;
+        result.__filtered__ = true;
+      } else {
+        result = this.clone();
+        result.__dir__ *= -1;
+      }
+      return result;
+    }
+
+    /**
+     * Extracts the unwrapped value from its lazy wrapper.
+     *
+     * @private
+     * @name value
+     * @memberOf LazyWrapper
+     * @returns {*} Returns the unwrapped value.
+     */
+    function lazyValue() {
+      var array = this.__wrapped__.value(),
+          dir = this.__dir__,
+          isArr = isArray(array),
+          isRight = dir < 0,
+          arrLength = isArr ? array.length : 0,
+          view = getView(0, arrLength, this.__views__),
+          start = view.start,
+          end = view.end,
+          length = end - start,
+          index = isRight ? end : (start - 1),
+          iteratees = this.__iteratees__,
+          iterLength = iteratees.length,
+          resIndex = 0,
+          takeCount = nativeMin(length, this.__takeCount__);
+
+      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {
+        return baseWrapperValue(array, this.__actions__);
+      }
+      var result = [];
+
+      outer:
+      while (length-- && resIndex < takeCount) {
+        index += dir;
+
+        var iterIndex = -1,
+            value = array[index];
+
+        while (++iterIndex < iterLength) {
+          var data = iteratees[iterIndex],
+              iteratee = data.iteratee,
+              type = data.type,
+              computed = iteratee(value);
+
+          if (type == LAZY_MAP_FLAG) {
+            value = computed;
+          } else if (!computed) {
+            if (type == LAZY_FILTER_FLAG) {
+              continue outer;
+            } else {
+              break outer;
+            }
           }
-          op2 = op;
-          //ie get ready for the next iteration
         }
-        op2 = op2.Next;
+        result[resIndex++] = value;
       }
-      op = op.Next;
+      return result;
     }
-    while (op != outrec.Pts)
-  }
-};
-ClipperLib.Clipper.Area = function (poly)
-{
-  var cnt = poly.length;
-  if (cnt < 3)
-    return 0;
-  var a = 0;
-  for (var i = 0, j = cnt - 1; i < cnt; ++i)
-  {
-    a += (poly[j].X + poly[i].X) * (poly[j].Y - poly[i].Y);
-    j = i;
-  }
-  return -a * 0.5;
-};
-ClipperLib.Clipper.prototype.Area = function (outRec)
-{
-  var op = outRec.Pts;
-  if (op == null)
-    return 0;
-  var a = 0;
-  do {
-    a = a + (op.Prev.Pt.X + op.Pt.X) * (op.Prev.Pt.Y - op.Pt.Y);
-    op = op.Next;
-  }
-  while (op != outRec.Pts)
-  return a * 0.5;
-};
-if (use_deprecated)
-{
-  ClipperLib.Clipper.OffsetPaths = function (polys, delta, jointype, endtype, MiterLimit)
-  {
-    var result = new ClipperLib.Paths();
-    var co = new ClipperLib.ClipperOffset(MiterLimit, MiterLimit);
-    co.AddPaths(polys, jointype, endtype);
-    co.Execute(result, delta);
-    return result;
-  };
-}
-ClipperLib.Clipper.SimplifyPolygon = function (poly, fillType)
-{
-  var result = new Array();
-  var c = new ClipperLib.Clipper(0);
-  c.StrictlySimple = true;
-  c.AddPath(poly, ClipperLib.PolyType.ptSubject, true);
-  c.Execute(ClipperLib.ClipType.ctUnion, result, fillType, fillType);
-  return result;
-};
-ClipperLib.Clipper.SimplifyPolygons = function (polys, fillType)
-{
-  if (typeof (fillType) == "undefined") fillType = ClipperLib.PolyFillType.pftEvenOdd;
-  var result = new Array();
-  var c = new ClipperLib.Clipper(0);
-  c.StrictlySimple = true;
-  c.AddPaths(polys, ClipperLib.PolyType.ptSubject, true);
-  c.Execute(ClipperLib.ClipType.ctUnion, result, fillType, fillType);
-  return result;
-};
-ClipperLib.Clipper.DistanceSqrd = function (pt1, pt2)
-{
-  var dx = (pt1.X - pt2.X);
-  var dy = (pt1.Y - pt2.Y);
-  return (dx * dx + dy * dy);
-};
-ClipperLib.Clipper.DistanceFromLineSqrd = function (pt, ln1, ln2)
-{
-  //The equation of a line in general form (Ax + By + C = 0)
-  //given 2 points (x�,y�) & (x�,y�) is ...
-  //(y� - y�)x + (x� - x�)y + (y� - y�)x� - (x� - x�)y� = 0
-  //A = (y� - y�); B = (x� - x�); C = (y� - y�)x� - (x� - x�)y�
-  //perpendicular distance of point (x�,y�) = (Ax� + By� + C)/Sqrt(A� + B�)
-  //see http://en.wikipedia.org/wiki/Perpendicular_distance
-  var A = ln1.Y - ln2.Y;
-  var B = ln2.X - ln1.X;
-  var C = A * ln1.X + B * ln1.Y;
-  C = A * pt.X + B * pt.Y - C;
-  return (C * C) / (A * A + B * B);
-};
-ClipperLib.Clipper.SlopesNearCollinear = function (pt1, pt2, pt3, distSqrd)
-{
-  return ClipperLib.Clipper.DistanceFromLineSqrd(pt2, pt1, pt3) < distSqrd;
-};
-ClipperLib.Clipper.PointsAreClose = function (pt1, pt2, distSqrd)
-{
-  var dx = pt1.X - pt2.X;
-  var dy = pt1.Y - pt2.Y;
-  return ((dx * dx) + (dy * dy) <= distSqrd);
-};
-//------------------------------------------------------------------------------
-ClipperLib.Clipper.ExcludeOp = function (op)
-{
-  var result = op.Prev;
-  result.Next = op.Next;
-  op.Next.Prev = result;
-  result.Idx = 0;
-  return result;
-};
-ClipperLib.Clipper.CleanPolygon = function (path, distance)
-{
-  if (typeof (distance) == "undefined") distance = 1.415;
-  //distance = proximity in units/pixels below which vertices will be stripped. 
-  //Default ~= sqrt(2) so when adjacent vertices or semi-adjacent vertices have 
-  //both x & y coords within 1 unit, then the second vertex will be stripped.
-  var cnt = path.length;
-  if (cnt == 0)
-    return new Array();
-  var outPts = new Array(cnt);
-  for (var i = 0; i < cnt; ++i)
-    outPts[i] = new ClipperLib.OutPt();
-  for (var i = 0; i < cnt; ++i)
-  {
-    outPts[i].Pt = path[i];
-    outPts[i].Next = outPts[(i + 1) % cnt];
-    outPts[i].Next.Prev = outPts[i];
-    outPts[i].Idx = 0;
-  }
-  var distSqrd = distance * distance;
-  var op = outPts[0];
-  while (op.Idx == 0 && op.Next != op.Prev)
-  {
-    if (ClipperLib.Clipper.PointsAreClose(op.Pt, op.Prev.Pt, distSqrd))
-    {
-      op = ClipperLib.Clipper.ExcludeOp(op);
-      cnt--;
+
+    // Ensure `LazyWrapper` is an instance of `baseLodash`.
+    LazyWrapper.prototype = baseCreate(baseLodash.prototype);
+    LazyWrapper.prototype.constructor = LazyWrapper;
+
+    /*------------------------------------------------------------------------*/
+
+    /**
+     * Creates a hash object.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [entries] The key-value pairs to cache.
+     */
+    function Hash(entries) {
+      var index = -1,
+          length = entries == null ? 0 : entries.length;
+
+      this.clear();
+      while (++index < length) {
+        var entry = entries[index];
+        this.set(entry[0], entry[1]);
+      }
     }
-    else if (ClipperLib.Clipper.PointsAreClose(op.Prev.Pt, op.Next.Pt, distSqrd))
-    {
-      ClipperLib.Clipper.ExcludeOp(op.Next);
-      op = ClipperLib.Clipper.ExcludeOp(op);
-      cnt -= 2;
+
+    /**
+     * Removes all key-value entries from the hash.
+     *
+     * @private
+     * @name clear
+     * @memberOf Hash
+     */
+    function hashClear() {
+      this.__data__ = nativeCreate ? nativeCreate(null) : {};
+      this.size = 0;
     }
-    else if (ClipperLib.Clipper.SlopesNearCollinear(op.Prev.Pt, op.Pt, op.Next.Pt, distSqrd))
-    {
-      op = ClipperLib.Clipper.ExcludeOp(op);
-      cnt--;
+
+    /**
+     * Removes `key` and its value from the hash.
+     *
+     * @private
+     * @name delete
+     * @memberOf Hash
+     * @param {Object} hash The hash to modify.
+     * @param {string} key The key of the value to remove.
+     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     */
+    function hashDelete(key) {
+      var result = this.has(key) && delete this.__data__[key];
+      this.size -= result ? 1 : 0;
+      return result;
     }
-    else
-    {
-      op.Idx = 1;
-      op = op.Next;
+
+    /**
+     * Gets the hash value for `key`.
+     *
+     * @private
+     * @name get
+     * @memberOf Hash
+     * @param {string} key The key of the value to get.
+     * @returns {*} Returns the entry value.
+     */
+    function hashGet(key) {
+      var data = this.__data__;
+      if (nativeCreate) {
+        var result = data[key];
+        return result === HASH_UNDEFINED ? undefined : result;
+      }
+      return hasOwnProperty.call(data, key) ? data[key] : undefined;
     }
-  }
-  if (cnt < 3)
-    cnt = 0;
-  var result = new Array(cnt);
-  for (var i = 0; i < cnt; ++i)
-  {
-    result[i] = new ClipperLib.IntPoint(op.Pt);
-    op = op.Next;
-  }
-  outPts = null;
-  return result;
-};
-ClipperLib.Clipper.CleanPolygons = function (polys, distance)
-{
-  var result = new Array(polys.length);
-  for (var i = 0, ilen = polys.length; i < ilen; i++)
-    result[i] = ClipperLib.Clipper.CleanPolygon(polys[i], distance);
-  return result;
-};
-ClipperLib.Clipper.Minkowski = function (pattern, path, IsSum, IsClosed)
-{
-  var delta = (IsClosed ? 1 : 0);
-  var polyCnt = pattern.length;
-  var pathCnt = path.length;
-  var result = new Array();
-  if (IsSum)
-    for (var i = 0; i < pathCnt; i++)
-    {
-      var p = new Array(polyCnt);
-      for (var j = 0, jlen = pattern.length, ip = pattern[j]; j < jlen; j++, ip = pattern[j])
-        p[j] = new ClipperLib.IntPoint(path[i].X + ip.X, path[i].Y + ip.Y);
-      result.push(p);
+
+    /**
+     * Checks if a hash value for `key` exists.
+     *
+     * @private
+     * @name has
+     * @memberOf Hash
+     * @param {string} key The key of the entry to check.
+     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     */
+    function hashHas(key) {
+      var data = this.__data__;
+      return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);
     }
-  else
-    for (var i = 0; i < pathCnt; i++)
-    {
-      var p = new Array(polyCnt);
-      for (var j = 0, jlen = pattern.length, ip = pattern[j]; j < jlen; j++, ip = pattern[j])
-        p[j] = new ClipperLib.IntPoint(path[i].X - ip.X, path[i].Y - ip.Y);
-      result.push(p);
-    }
-  var quads = new Array();
-  for (var i = 0; i < pathCnt - 1 + delta; i++)
-    for (var j = 0; j < polyCnt; j++)
-    {
-      var quad = new Array();
-      quad.push(result[i % pathCnt][j % polyCnt]);
-      quad.push(result[(i + 1) % pathCnt][j % polyCnt]);
-      quad.push(result[(i + 1) % pathCnt][(j + 1) % polyCnt]);
-      quad.push(result[i % pathCnt][(j + 1) % polyCnt]);
-      if (!ClipperLib.Clipper.Orientation(quad))
-        quad.reverse();
-      quads.push(quad);
-    }
-  var c = new ClipperLib.Clipper(0);
-  c.AddPaths(quads, ClipperLib.PolyType.ptSubject, true);
-  c.Execute(ClipperLib.ClipType.ctUnion, result, ClipperLib.PolyFillType.pftNonZero, ClipperLib.PolyFillType.pftNonZero);
-  return result;
-};
 
-ClipperLib.Clipper.MinkowskiSum = function ()
-{
-  var a = arguments,
-    alen = a.length;
-  if (alen == 3) // MinkowskiSum(Path pattern, path, pathIsClosed)
-  {
-    var pattern = a[0],
-      path = a[1],
-      pathIsClosed = a[2];
-    return ClipperLib.Clipper.Minkowski(pattern, path, true, pathIsClosed);
-  }
-  else if (alen == 4) // MinkowskiSum(pattern, paths, pathFillType, pathIsClosed)
-  {
-    var pattern = a[0],
-      paths = a[1],
-      pathFillType = a[2],
-      pathIsClosed = a[3];
-    var c = new ClipperLib.Clipper(),
-      tmp;
-    for (var i = 0, ilen = paths.length; i < ilen; ++i)
-    {
-      var tmp = ClipperLib.Clipper.Minkowski(pattern, paths[i], true, pathIsClosed);
-      c.AddPaths(tmp, ClipperLib.PolyType.ptSubject, true);
+    /**
+     * Sets the hash `key` to `value`.
+     *
+     * @private
+     * @name set
+     * @memberOf Hash
+     * @param {string} key The key of the value to set.
+     * @param {*} value The value to set.
+     * @returns {Object} Returns the hash instance.
+     */
+    function hashSet(key, value) {
+      var data = this.__data__;
+      this.size += this.has(key) ? 0 : 1;
+      data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;
+      return this;
     }
-    if (pathIsClosed) c.AddPaths(paths, ClipperLib.PolyType.ptClip, true);
-    var solution = new ClipperLib.Paths();
-    c.Execute(ClipperLib.ClipType.ctUnion, solution, pathFillType, pathFillType);
-    return solution;
-  }
-};
 
-ClipperLib.Clipper.MinkowskiDiff = function (pattern, path, pathIsClosed)
-{
-  return ClipperLib.Clipper.Minkowski(pattern, path, false, pathIsClosed);
-};
+    // Add methods to `Hash`.
+    Hash.prototype.clear = hashClear;
+    Hash.prototype['delete'] = hashDelete;
+    Hash.prototype.get = hashGet;
+    Hash.prototype.has = hashHas;
+    Hash.prototype.set = hashSet;
 
-ClipperLib.Clipper.PolyTreeToPaths = function (polytree)
-{
-  var result = new Array();
-  //result.set_Capacity(polytree.get_Total());
-  ClipperLib.Clipper.AddPolyNodeToPaths(polytree, ClipperLib.Clipper.NodeType.ntAny, result);
-  return result;
-};
-ClipperLib.Clipper.AddPolyNodeToPaths = function (polynode, nt, paths)
-{
-  var match = true;
-  switch (nt)
-  {
-  case ClipperLib.Clipper.NodeType.ntOpen:
-    return;
-  case ClipperLib.Clipper.NodeType.ntClosed:
-    match = !polynode.IsOpen;
-    break;
-  default:
-    break;
-  }
-  if (polynode.m_polygon.length > 0 && match)
-    paths.push(polynode.m_polygon);
-  for (var $i3 = 0, $t3 = polynode.Childs(), $l3 = $t3.length, pn = $t3[$i3]; $i3 < $l3; $i3++, pn = $t3[$i3])
-    ClipperLib.Clipper.AddPolyNodeToPaths(pn, nt, paths);
-};
-ClipperLib.Clipper.OpenPathsFromPolyTree = function (polytree)
-{
-  var result = new ClipperLib.Paths();
-  //result.set_Capacity(polytree.ChildCount());
-  for (var i = 0, ilen = polytree.ChildCount(); i < ilen; i++)
-    if (polytree.Childs()[i].IsOpen)
-      result.push(polytree.Childs()[i].m_polygon);
-  return result;
-};
-ClipperLib.Clipper.ClosedPathsFromPolyTree = function (polytree)
-{
-  var result = new ClipperLib.Paths();
-  //result.set_Capacity(polytree.Total());
-  ClipperLib.Clipper.AddPolyNodeToPaths(polytree, ClipperLib.Clipper.NodeType.ntClosed, result);
-  return result;
-};
-Inherit(ClipperLib.Clipper, ClipperLib.ClipperBase);
-ClipperLib.Clipper.NodeType = {
-  ntAny: 0,
-  ntOpen: 1,
-  ntClosed: 2
-};
-ClipperLib.ClipperOffset = function (miterLimit, arcTolerance)
-{
-  if (typeof (miterLimit) == "undefined") miterLimit = 2;
-  if (typeof (arcTolerance) == "undefined") arcTolerance = ClipperLib.ClipperOffset.def_arc_tolerance;
-  this.m_destPolys = new ClipperLib.Paths();
-  this.m_srcPoly = new ClipperLib.Path();
-  this.m_destPoly = new ClipperLib.Path();
-  this.m_normals = new Array();
-  this.m_delta = 0;
-  this.m_sinA = 0;
-  this.m_sin = 0;
-  this.m_cos = 0;
-  this.m_miterLim = 0;
-  this.m_StepsPerRad = 0;
-  this.m_lowest = new ClipperLib.IntPoint();
-  this.m_polyNodes = new ClipperLib.PolyNode();
-  this.MiterLimit = miterLimit;
-  this.ArcTolerance = arcTolerance;
-  this.m_lowest.X = -1;
-};
-ClipperLib.ClipperOffset.two_pi = 6.28318530717959;
-ClipperLib.ClipperOffset.def_arc_tolerance = 0.25;
-ClipperLib.ClipperOffset.prototype.Clear = function ()
-{
-  ClipperLib.Clear(this.m_polyNodes.Childs());
-  this.m_lowest.X = -1;
-};
-ClipperLib.ClipperOffset.Round = ClipperLib.Clipper.Round;
-ClipperLib.ClipperOffset.prototype.AddPath = function (path, joinType, endType)
-{
-  var highI = path.length - 1;
-  if (highI < 0)
-    return;
-  var newNode = new ClipperLib.PolyNode();
-  newNode.m_jointype = joinType;
-  newNode.m_endtype = endType;
-  //strip duplicate points from path and also get index to the lowest point ...
-  if (endType == ClipperLib.EndType.etClosedLine || endType == ClipperLib.EndType.etClosedPolygon)
-    while (highI > 0 && ClipperLib.IntPoint.op_Equality(path[0], path[highI]))
-      highI--;
-  //newNode.m_polygon.set_Capacity(highI + 1);
-  newNode.m_polygon.push(path[0]);
-  var j = 0,
-    k = 0;
-  for (var i = 1; i <= highI; i++)
-    if (ClipperLib.IntPoint.op_Inequality(newNode.m_polygon[j], path[i]))
-    {
-      j++;
-      newNode.m_polygon.push(path[i]);
-      if (path[i].Y > newNode.m_polygon[k].Y || (path[i].Y == newNode.m_polygon[k].Y && path[i].X < newNode.m_polygon[k].X))
-        k = j;
-    }
-  if ((endType == ClipperLib.EndType.etClosedPolygon && j < 2) || (endType != ClipperLib.EndType.etClosedPolygon && j < 0))
-    return;
-  this.m_polyNodes.AddChild(newNode);
-  //if this path's lowest pt is lower than all the others then update m_lowest
-  if (endType != ClipperLib.EndType.etClosedPolygon)
-    return;
-  if (this.m_lowest.X < 0)
-    this.m_lowest = new ClipperLib.IntPoint(0, k);
-  else
-  {
-    var ip = this.m_polyNodes.Childs()[this.m_lowest.X].m_polygon[this.m_lowest.Y];
-    if (newNode.m_polygon[k].Y > ip.Y || (newNode.m_polygon[k].Y == ip.Y && newNode.m_polygon[k].X < ip.X))
-      this.m_lowest = new ClipperLib.IntPoint(this.m_polyNodes.ChildCount() - 1, k);
-  }
-};
-ClipperLib.ClipperOffset.prototype.AddPaths = function (paths, joinType, endType)
-{
-  for (var i = 0, ilen = paths.length; i < ilen; i++)
-    this.AddPath(paths[i], joinType, endType);
-};
-ClipperLib.ClipperOffset.prototype.FixOrientations = function ()
-{
-  //fixup orientations of all closed paths if the orientation of the
-  //closed path with the lowermost vertex is wrong ...
-  if (this.m_lowest.X >= 0 && !ClipperLib.Clipper.Orientation(this.m_polyNodes.Childs()[this.m_lowest.X].m_polygon))
-  {
-    for (var i = 0; i < this.m_polyNodes.ChildCount(); i++)
-    {
-      var node = this.m_polyNodes.Childs()[i];
-      if (node.m_endtype == ClipperLib.EndType.etClosedPolygon || (node.m_endtype == ClipperLib.EndType.etClosedLine && ClipperLib.Clipper.Orientation(node.m_polygon)))
-        node.m_polygon.reverse();
-    }
-  }
-  else
-  {
-    for (var i = 0; i < this.m_polyNodes.ChildCount(); i++)
-    {
-      var node = this.m_polyNodes.Childs()[i];
-      if (node.m_endtype == ClipperLib.EndType.etClosedLine && !ClipperLib.Clipper.Orientation(node.m_polygon))
-        node.m_polygon.reverse();
-    }
-  }
-};
-ClipperLib.ClipperOffset.GetUnitNormal = function (pt1, pt2)
-{
-  var dx = (pt2.X - pt1.X);
-  var dy = (pt2.Y - pt1.Y);
-  if ((dx == 0) && (dy == 0))
-    return new ClipperLib.DoublePoint(0, 0);
-  var f = 1 / Math.sqrt(dx * dx + dy * dy);
-  dx *= f;
-  dy *= f;
-  return new ClipperLib.DoublePoint(dy, -dx);
-};
-ClipperLib.ClipperOffset.prototype.DoOffset = function (delta)
-{
-  this.m_destPolys = new Array();
-  this.m_delta = delta;
-  //if Zero offset, just copy any CLOSED polygons to m_p and return ...
-  if (ClipperLib.ClipperBase.near_zero(delta))
-  {
-    //this.m_destPolys.set_Capacity(this.m_polyNodes.ChildCount);
-    for (var i = 0; i < this.m_polyNodes.ChildCount(); i++)
-    {
-      var node = this.m_polyNodes.Childs()[i];
-      if (node.m_endtype == ClipperLib.EndType.etClosedPolygon)
-        this.m_destPolys.push(node.m_polygon);
-    }
-    return;
-  }
-  //see offset_triginometry3.svg in the documentation folder ...
-  if (this.MiterLimit > 2)
-    this.m_miterLim = 2 / (this.MiterLimit * this.MiterLimit);
-  else
-    this.m_miterLim = 0.5;
-  var y;
-  if (this.ArcTolerance <= 0)
-    y = ClipperLib.ClipperOffset.def_arc_tolerance;
-  else if (this.ArcTolerance > Math.abs(delta) * ClipperLib.ClipperOffset.def_arc_tolerance)
-    y = Math.abs(delta) * ClipperLib.ClipperOffset.def_arc_tolerance;
-  else
-    y = this.ArcTolerance;
-  //see offset_triginometry2.svg in the documentation folder ...
-  var steps = 3.14159265358979 / Math.acos(1 - y / Math.abs(delta));
-  this.m_sin = Math.sin(ClipperLib.ClipperOffset.two_pi / steps);
-  this.m_cos = Math.cos(ClipperLib.ClipperOffset.two_pi / steps);
-  this.m_StepsPerRad = steps / ClipperLib.ClipperOffset.two_pi;
-  if (delta < 0)
-    this.m_sin = -this.m_sin;
-  //this.m_destPolys.set_Capacity(this.m_polyNodes.ChildCount * 2);
-  for (var i = 0; i < this.m_polyNodes.ChildCount(); i++)
-  {
-    var node = this.m_polyNodes.Childs()[i];
-    this.m_srcPoly = node.m_polygon;
-    var len = this.m_srcPoly.length;
-    if (len == 0 || (delta <= 0 && (len < 3 || node.m_endtype != ClipperLib.EndType.etClosedPolygon)))
-      continue;
-    this.m_destPoly = new Array();
-    if (len == 1)
-    {
-      if (node.m_jointype == ClipperLib.JoinType.jtRound)
-      {
-        var X = 1,
-          Y = 0;
-        for (var j = 1; j <= steps; j++)
-        {
-          this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X + X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y + Y * delta)));
-          var X2 = X;
-          X = X * this.m_cos - this.m_sin * Y;
-          Y = X2 * this.m_sin + Y * this.m_cos;
-        }
-      }
-      else
-      {
-        var X = -1,
-          Y = -1;
-        for (var j = 0; j < 4; ++j)
-        {
-          this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X + X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y + Y * delta)));
-          if (X < 0)
-            X = 1;
-          else if (Y < 0)
-            Y = 1;
-          else
-            X = -1;
-        }
+    /*------------------------------------------------------------------------*/
+
+    /**
+     * Creates an list cache object.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [entries] The key-value pairs to cache.
+     */
+    function ListCache(entries) {
+      var index = -1,
+          length = entries == null ? 0 : entries.length;
+
+      this.clear();
+      while (++index < length) {
+        var entry = entries[index];
+        this.set(entry[0], entry[1]);
       }
-      this.m_destPolys.push(this.m_destPoly);
-      continue;
-    }
-    //build m_normals ...
-    this.m_normals.length = 0;
-    //this.m_normals.set_Capacity(len);
-    for (var j = 0; j < len - 1; j++)
-      this.m_normals.push(ClipperLib.ClipperOffset.GetUnitNormal(this.m_srcPoly[j], this.m_srcPoly[j + 1]));
-    if (node.m_endtype == ClipperLib.EndType.etClosedLine || node.m_endtype == ClipperLib.EndType.etClosedPolygon)
-      this.m_normals.push(ClipperLib.ClipperOffset.GetUnitNormal(this.m_srcPoly[len - 1], this.m_srcPoly[0]));
-    else
-      this.m_normals.push(new ClipperLib.DoublePoint(this.m_normals[len - 2]));
-    if (node.m_endtype == ClipperLib.EndType.etClosedPolygon)
-    {
-      var k = len - 1;
-      for (var j = 0; j < len; j++)
-        k = this.OffsetPoint(j, k, node.m_jointype);
-      this.m_destPolys.push(this.m_destPoly);
     }
-    else if (node.m_endtype == ClipperLib.EndType.etClosedLine)
-    {
-      var k = len - 1;
-      for (var j = 0; j < len; j++)
-        k = this.OffsetPoint(j, k, node.m_jointype);
-      this.m_destPolys.push(this.m_destPoly);
-      this.m_destPoly = new Array();
-      //re-build m_normals ...
-      var n = this.m_normals[len - 1];
-      for (var j = len - 1; j > 0; j--)
-        this.m_normals[j] = new ClipperLib.DoublePoint(-this.m_normals[j - 1].X, -this.m_normals[j - 1].Y);
-      this.m_normals[0] = new ClipperLib.DoublePoint(-n.X, -n.Y);
-      k = 0;
-      for (var j = len - 1; j >= 0; j--)
-        k = this.OffsetPoint(j, k, node.m_jointype);
-      this.m_destPolys.push(this.m_destPoly);
+
+    /**
+     * Removes all key-value entries from the list cache.
+     *
+     * @private
+     * @name clear
+     * @memberOf ListCache
+     */
+    function listCacheClear() {
+      this.__data__ = [];
+      this.size = 0;
     }
-    else
-    {
-      var k = 0;
-      for (var j = 1; j < len - 1; ++j)
-        k = this.OffsetPoint(j, k, node.m_jointype);
-      var pt1;
-      if (node.m_endtype == ClipperLib.EndType.etOpenButt)
-      {
-        var j = len - 1;
-        pt1 = new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_normals[j].X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_normals[j].Y * delta));
-        this.m_destPoly.push(pt1);
-        pt1 = new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X - this.m_normals[j].X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y - this.m_normals[j].Y * delta));
-        this.m_destPoly.push(pt1);
-      }
-      else
-      {
-        var j = len - 1;
-        k = len - 2;
-        this.m_sinA = 0;
-        this.m_normals[j] = new ClipperLib.DoublePoint(-this.m_normals[j].X, -this.m_normals[j].Y);
-        if (node.m_endtype == ClipperLib.EndType.etOpenSquare)
-          this.DoSquare(j, k);
-        else
-          this.DoRound(j, k);
-      }
-      //re-build m_normals ...
-      for (var j = len - 1; j > 0; j--)
-        this.m_normals[j] = new ClipperLib.DoublePoint(-this.m_normals[j - 1].X, -this.m_normals[j - 1].Y);
-      this.m_normals[0] = new ClipperLib.DoublePoint(-this.m_normals[1].X, -this.m_normals[1].Y);
-      k = len - 1;
-      for (var j = k - 1; j > 0; --j)
-        k = this.OffsetPoint(j, k, node.m_jointype);
-      if (node.m_endtype == ClipperLib.EndType.etOpenButt)
-      {
-        pt1 = new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X - this.m_normals[0].X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y - this.m_normals[0].Y * delta));
-        this.m_destPoly.push(pt1);
-        pt1 = new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X + this.m_normals[0].X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y + this.m_normals[0].Y * delta));
-        this.m_destPoly.push(pt1);
+
+    /**
+     * Removes `key` and its value from the list cache.
+     *
+     * @private
+     * @name delete
+     * @memberOf ListCache
+     * @param {string} key The key of the value to remove.
+     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     */
+    function listCacheDelete(key) {
+      var data = this.__data__,
+          index = assocIndexOf(data, key);
+
+      if (index < 0) {
+        return false;
       }
-      else
-      {
-        k = 1;
-        this.m_sinA = 0;
-        if (node.m_endtype == ClipperLib.EndType.etOpenSquare)
-          this.DoSquare(0, 1);
-        else
-          this.DoRound(0, 1);
+      var lastIndex = data.length - 1;
+      if (index == lastIndex) {
+        data.pop();
+      } else {
+        splice.call(data, index, 1);
       }
-      this.m_destPolys.push(this.m_destPoly);
+      --this.size;
+      return true;
     }
-  }
-};
-ClipperLib.ClipperOffset.prototype.Execute = function ()
-{
-  var a = arguments,
-    ispolytree = a[0] instanceof ClipperLib.PolyTree;
-  if (!ispolytree) // function (solution, delta)
-  {
-    var solution = a[0],
-      delta = a[1];
-    ClipperLib.Clear(solution);
-    this.FixOrientations();
-    this.DoOffset(delta);
-    //now clean up 'corners' ...
-    var clpr = new ClipperLib.Clipper(0);
-    clpr.AddPaths(this.m_destPolys, ClipperLib.PolyType.ptSubject, true);
-    if (delta > 0)
-    {
-      clpr.Execute(ClipperLib.ClipType.ctUnion, solution, ClipperLib.PolyFillType.pftPositive, ClipperLib.PolyFillType.pftPositive);
+
+    /**
+     * Gets the list cache value for `key`.
+     *
+     * @private
+     * @name get
+     * @memberOf ListCache
+     * @param {string} key The key of the value to get.
+     * @returns {*} Returns the entry value.
+     */
+    function listCacheGet(key) {
+      var data = this.__data__,
+          index = assocIndexOf(data, key);
+
+      return index < 0 ? undefined : data[index][1];
     }
-    else
-    {
-      var r = ClipperLib.Clipper.GetBounds(this.m_destPolys);
-      var outer = new ClipperLib.Path();
-      outer.push(new ClipperLib.IntPoint(r.left - 10, r.bottom + 10));
-      outer.push(new ClipperLib.IntPoint(r.right + 10, r.bottom + 10));
-      outer.push(new ClipperLib.IntPoint(r.right + 10, r.top - 10));
-      outer.push(new ClipperLib.IntPoint(r.left - 10, r.top - 10));
-      clpr.AddPath(outer, ClipperLib.PolyType.ptSubject, true);
-      clpr.ReverseSolution = true;
-      clpr.Execute(ClipperLib.ClipType.ctUnion, solution, ClipperLib.PolyFillType.pftNegative, ClipperLib.PolyFillType.pftNegative);
-      if (solution.length > 0)
-        solution.splice(0, 1);
-    }
-    //console.log(JSON.stringify(solution));
-  }
-  else // function (polytree, delta)
-  {
-    var solution = a[0],
-      delta = a[1];
-    solution.Clear();
-    this.FixOrientations();
-    this.DoOffset(delta);
-    //now clean up 'corners' ...
-    var clpr = new ClipperLib.Clipper(0);
-    clpr.AddPaths(this.m_destPolys, ClipperLib.PolyType.ptSubject, true);
-    if (delta > 0)
-    {
-      clpr.Execute(ClipperLib.ClipType.ctUnion, solution, ClipperLib.PolyFillType.pftPositive, ClipperLib.PolyFillType.pftPositive);
+
+    /**
+     * Checks if a list cache value for `key` exists.
+     *
+     * @private
+     * @name has
+     * @memberOf ListCache
+     * @param {string} key The key of the entry to check.
+     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     */
+    function listCacheHas(key) {
+      return assocIndexOf(this.__data__, key) > -1;
     }
-    else
-    {
-      var r = ClipperLib.Clipper.GetBounds(this.m_destPolys);
-      var outer = new ClipperLib.Path();
-      outer.push(new ClipperLib.IntPoint(r.left - 10, r.bottom + 10));
-      outer.push(new ClipperLib.IntPoint(r.right + 10, r.bottom + 10));
-      outer.push(new ClipperLib.IntPoint(r.right + 10, r.top - 10));
-      outer.push(new ClipperLib.IntPoint(r.left - 10, r.top - 10));
-      clpr.AddPath(outer, ClipperLib.PolyType.ptSubject, true);
-      clpr.ReverseSolution = true;
-      clpr.Execute(ClipperLib.ClipType.ctUnion, solution, ClipperLib.PolyFillType.pftNegative, ClipperLib.PolyFillType.pftNegative);
-      //remove the outer PolyNode rectangle ...
-      if (solution.ChildCount() == 1 && solution.Childs()[0].ChildCount() > 0)
-      {
-        var outerNode = solution.Childs()[0];
-        //solution.Childs.set_Capacity(outerNode.ChildCount);
-        solution.Childs()[0] = outerNode.Childs()[0];
-        for (var i = 1; i < outerNode.ChildCount(); i++)
-          solution.AddChild(outerNode.Childs()[i]);
+
+    /**
+     * Sets the list cache `key` to `value`.
+     *
+     * @private
+     * @name set
+     * @memberOf ListCache
+     * @param {string} key The key of the value to set.
+     * @param {*} value The value to set.
+     * @returns {Object} Returns the list cache instance.
+     */
+    function listCacheSet(key, value) {
+      var data = this.__data__,
+          index = assocIndexOf(data, key);
+
+      if (index < 0) {
+        ++this.size;
+        data.push([key, value]);
+      } else {
+        data[index][1] = value;
       }
-      else
-        solution.Clear();
+      return this;
     }
-  }
-};
-ClipperLib.ClipperOffset.prototype.OffsetPoint = function (j, k, jointype)
-{
-  this.m_sinA = (this.m_normals[k].X * this.m_normals[j].Y - this.m_normals[j].X * this.m_normals[k].Y);
-  if (this.m_sinA < 0.00005 && this.m_sinA > -0.00005)
-    return k;
-  else if (this.m_sinA > 1)
-    this.m_sinA = 1.0;
-  else if (this.m_sinA < -1)
-    this.m_sinA = -1.0;
-  if (this.m_sinA * this.m_delta < 0)
-  {
-    this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_normals[k].X * this.m_delta),
-      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_normals[k].Y * this.m_delta)));
-    this.m_destPoly.push(new ClipperLib.IntPoint(this.m_srcPoly[j]));
-    this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_normals[j].X * this.m_delta),
-      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_normals[j].Y * this.m_delta)));
-  }
-  else
-    switch (jointype)
-    {
-    case ClipperLib.JoinType.jtMiter:
-      {
-        var r = 1 + (this.m_normals[j].X * this.m_normals[k].X + this.m_normals[j].Y * this.m_normals[k].Y);
-        if (r >= this.m_miterLim)
-          this.DoMiter(j, k, r);
-        else
-          this.DoSquare(j, k);
-        break;
+
+    // Add methods to `ListCache`.
+    ListCache.prototype.clear = listCacheClear;
+    ListCache.prototype['delete'] = listCacheDelete;
+    ListCache.prototype.get = listCacheGet;
+    ListCache.prototype.has = listCacheHas;
+    ListCache.prototype.set = listCacheSet;
+
+    /*------------------------------------------------------------------------*/
+
+    /**
+     * Creates a map cache object to store key-value pairs.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [entries] The key-value pairs to cache.
+     */
+    function MapCache(entries) {
+      var index = -1,
+          length = entries == null ? 0 : entries.length;
+
+      this.clear();
+      while (++index < length) {
+        var entry = entries[index];
+        this.set(entry[0], entry[1]);
       }
-    case ClipperLib.JoinType.jtSquare:
-      this.DoSquare(j, k);
-      break;
-    case ClipperLib.JoinType.jtRound:
-      this.DoRound(j, k);
-      break;
     }
-  k = j;
-  return k;
-};
-ClipperLib.ClipperOffset.prototype.DoSquare = function (j, k)
-{
-  var dx = Math.tan(Math.atan2(this.m_sinA,
-    this.m_normals[k].X * this.m_normals[j].X + this.m_normals[k].Y * this.m_normals[j].Y) / 4);
-  this.m_destPoly.push(new ClipperLib.IntPoint(
-    ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_delta * (this.m_normals[k].X - this.m_normals[k].Y * dx)),
-    ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_delta * (this.m_normals[k].Y + this.m_normals[k].X * dx))));
-  this.m_destPoly.push(new ClipperLib.IntPoint(
-    ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_delta * (this.m_normals[j].X + this.m_normals[j].Y * dx)),
-    ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_delta * (this.m_normals[j].Y - this.m_normals[j].X * dx))));
-};
-ClipperLib.ClipperOffset.prototype.DoMiter = function (j, k, r)
-{
-  var q = this.m_delta / r;
-  this.m_destPoly.push(new ClipperLib.IntPoint(
-    ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + (this.m_normals[k].X + this.m_normals[j].X) * q),
-    ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + (this.m_normals[k].Y + this.m_normals[j].Y) * q)));
-};
-ClipperLib.ClipperOffset.prototype.DoRound = function (j, k)
-{
-  var a = Math.atan2(this.m_sinA,
-    this.m_normals[k].X * this.m_normals[j].X + this.m_normals[k].Y * this.m_normals[j].Y);
-  var steps = ClipperLib.Cast_Int32(ClipperLib.ClipperOffset.Round(this.m_StepsPerRad * Math.abs(a)));
-  var X = this.m_normals[k].X,
-    Y = this.m_normals[k].Y,
-    X2;
-  for (var i = 0; i < steps; ++i)
-  {
-    this.m_destPoly.push(new ClipperLib.IntPoint(
-      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + X * this.m_delta),
-      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + Y * this.m_delta)));
-    X2 = X;
-    X = X * this.m_cos - this.m_sin * Y;
-    Y = X2 * this.m_sin + Y * this.m_cos;
-  }
-  this.m_destPoly.push(new ClipperLib.IntPoint(
-    ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_normals[j].X * this.m_delta),
-    ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_normals[j].Y * this.m_delta)));
-};
-ClipperLib.Error = function (message)
-{
-  try
-  {
-    throw new Error(message);
-  }
-  catch (err)
-  {
-    alert(err.message);
-  }
-};
-// ---------------------------------
-// JS extension by Timo 2013
-ClipperLib.JS = {};
-ClipperLib.JS.AreaOfPolygon = function (poly, scale)
-{
-  if (!scale) scale = 1;
-  return ClipperLib.Clipper.Area(poly) / (scale * scale);
-};
-ClipperLib.JS.AreaOfPolygons = function (poly, scale)
-{
-  if (!scale) scale = 1;
-  var area = 0;
-  for (var i = 0; i < poly.length; i++)
-  {
-    area += ClipperLib.Clipper.Area(poly[i]);
-  }
-  return area / (scale * scale);
-};
-ClipperLib.JS.BoundsOfPath = function (path, scale)
-{
-  return ClipperLib.JS.BoundsOfPaths([path], scale);
-};
-ClipperLib.JS.BoundsOfPaths = function (paths, scale)
-{
-  if (!scale) scale = 1;
-  var bounds = ClipperLib.Clipper.GetBounds(paths);
-  bounds.left /= scale;
-  bounds.bottom /= scale;
-  bounds.right /= scale;
-  bounds.top /= scale;
-  return bounds;
-};
-// Clean() joins vertices that are too near each other
-// and causes distortion to offsetted polygons without cleaning
-ClipperLib.JS.Clean = function (polygon, delta)
-{
-  if (!(polygon instanceof Array)) return [];
-  var isPolygons = polygon[0] instanceof Array;
-  var polygon = ClipperLib.JS.Clone(polygon);
-  if (typeof delta != "number" || delta === null)
-  {
-    ClipperLib.Error("Delta is not a number in Clean().");
-    return polygon;
-  }
-  if (polygon.length === 0 || (polygon.length == 1 && polygon[0].length === 0) || delta < 0) return polygon;
-  if (!isPolygons) polygon = [polygon];
-  var k_length = polygon.length;
-  var len, poly, result, d, p, j, i;
-  var results = [];
-  for (var k = 0; k < k_length; k++)
-  {
-    poly = polygon[k];
-    len = poly.length;
-    if (len === 0) continue;
-    else if (len < 3)
-    {
-      result = poly;
-      results.push(result);
-      continue;
-    }
-    result = poly;
-    d = delta * delta;
-    //d = Math.floor(c_delta * c_delta);
-    p = poly[0];
-    j = 1;
-    for (i = 1; i < len; i++)
-    {
-      if ((poly[i].X - p.X) * (poly[i].X - p.X) +
-        (poly[i].Y - p.Y) * (poly[i].Y - p.Y) <= d)
-        continue;
-      result[j] = poly[i];
-      p = poly[i];
-      j++;
-    }
-    p = poly[j - 1];
-    if ((poly[0].X - p.X) * (poly[0].X - p.X) +
-      (poly[0].Y - p.Y) * (poly[0].Y - p.Y) <= d)
-      j--;
-    if (j < len)
-      result.splice(j, len - j);
-    if (result.length) results.push(result);
-  }
-  if (!isPolygons && results.length) results = results[0];
-  else if (!isPolygons && results.length === 0) results = [];
-  else if (isPolygons && results.length === 0) results = [
-    []
-  ];
-  return results;
-}
-// Make deep copy of Polygons or Polygon
-// so that also IntPoint objects are cloned and not only referenced
-// This should be the fastest way
-ClipperLib.JS.Clone = function (polygon)
-{
-  if (!(polygon instanceof Array)) return [];
-  if (polygon.length === 0) return [];
-  else if (polygon.length == 1 && polygon[0].length === 0) return [[]];
-  var isPolygons = polygon[0] instanceof Array;
-  if (!isPolygons) polygon = [polygon];
-  var len = polygon.length,
-    plen, i, j, result;
-  var results = new Array(len);
-  for (i = 0; i < len; i++)
-  {
-    plen = polygon[i].length;
-    result = new Array(plen);
-    for (j = 0; j < plen; j++)
-    {
-      result[j] = {
-        X: polygon[i][j].X,
-        Y: polygon[i][j].Y
+
+    /**
+     * Removes all key-value entries from the map.
+     *
+     * @private
+     * @name clear
+     * @memberOf MapCache
+     */
+    function mapCacheClear() {
+      this.size = 0;
+      this.__data__ = {
+        'hash': new Hash,
+        'map': new (Map || ListCache),
+        'string': new Hash
       };
     }
-    results[i] = result;
-  }
-  if (!isPolygons) results = results[0];
-  return results;
-};
-// Removes points that doesn't affect much to the visual appearance.
-// If middle point is at or under certain distance (tolerance) of the line segment between 
-// start and end point, the middle point is removed.
-ClipperLib.JS.Lighten = function (polygon, tolerance)
-{
-  if (!(polygon instanceof Array)) return [];
-  if (typeof tolerance != "number" || tolerance === null)
-  {
-    ClipperLib.Error("Tolerance is not a number in Lighten().")
-    return ClipperLib.JS.Clone(polygon);
-  }
-  if (polygon.length === 0 || (polygon.length == 1 && polygon[0].length === 0) || tolerance < 0)
-  {
-    return ClipperLib.JS.Clone(polygon);
-  }
-  if (!(polygon[0] instanceof Array)) polygon = [polygon];
-  var i, j, poly, k, poly2, plen, A, B, P, d, rem, addlast;
-  var bxax, byay, l, ax, ay;
-  var len = polygon.length;
-  var toleranceSq = tolerance * tolerance;
-  var results = [];
-  for (i = 0; i < len; i++)
-  {
-    poly = polygon[i];
-    plen = poly.length;
-    if (plen == 0) continue;
-    for (k = 0; k < 1000000; k++) // could be forever loop, but wiser to restrict max repeat count
-    {
-      poly2 = [];
-      plen = poly.length;
-      // the first have to added to the end, if first and last are not the same
-      // this way we ensure that also the actual last point can be removed if needed
-      if (poly[plen - 1].X != poly[0].X || poly[plen - 1].Y != poly[0].Y)
-      {
-        addlast = 1;
-        poly.push(
-        {
-          X: poly[0].X,
-          Y: poly[0].Y
-        });
-        plen = poly.length;
-      }
-      else addlast = 0;
-      rem = []; // Indexes of removed points
-      for (j = 0; j < plen - 2; j++)
-      {
-        A = poly[j]; // Start point of line segment
-        P = poly[j + 1]; // Middle point. This is the one to be removed.
-        B = poly[j + 2]; // End point of line segment
-        ax = A.X;
-        ay = A.Y;
-        bxax = B.X - ax;
-        byay = B.Y - ay;
-        if (bxax !== 0 || byay !== 0) // To avoid Nan, when A==P && P==B. And to avoid peaks (A==B && A!=P), which have lenght, but not area.
-        {
-          l = ((P.X - ax) * bxax + (P.Y - ay) * byay) / (bxax * bxax + byay * byay);
-          if (l > 1)
-          {
-            ax = B.X;
-            ay = B.Y;
-          }
-          else if (l > 0)
-          {
-            ax += bxax * l;
-            ay += byay * l;
-          }
-        }
-        bxax = P.X - ax;
-        byay = P.Y - ay;
-        d = bxax * bxax + byay * byay;
-        if (d <= toleranceSq)
-        {
-          rem[j + 1] = 1;
-          j++; // when removed, transfer the pointer to the next one
-        }
-      }
-      // add all unremoved points to poly2
-      poly2.push(
-      {
-        X: poly[0].X,
-        Y: poly[0].Y
-      });
-      for (j = 1; j < plen - 1; j++)
-        if (!rem[j]) poly2.push(
-        {
-          X: poly[j].X,
-          Y: poly[j].Y
-        });
-      poly2.push(
-      {
-        X: poly[plen - 1].X,
-        Y: poly[plen - 1].Y
-      });
-      // if the first point was added to the end, remove it
-      if (addlast) poly.pop();
-      // break, if there was not anymore removed points
-      if (!rem.length) break;
-      // else continue looping using poly2, to check if there are points to remove
-      else poly = poly2;
-    }
-    plen = poly2.length;
-    // remove duplicate from end, if needed
-    if (poly2[plen - 1].X == poly2[0].X && poly2[plen - 1].Y == poly2[0].Y)
-    {
-      poly2.pop();
-    }
-    if (poly2.length > 2) // to avoid two-point-polygons
-      results.push(poly2);
-  }
-  if (!polygon[0] instanceof Array) results = results[0];
-  if (typeof (results) == "undefined") results = [
-    []
-  ];
-  return results;
-}
-ClipperLib.JS.PerimeterOfPath = function (path, closed, scale)
-{
-  if (typeof (path) == "undefined") return 0;
-  var sqrt = Math.sqrt;
-  var perimeter = 0.0;
-  var p1, p2, p1x = 0.0,
-    p1y = 0.0,
-    p2x = 0.0,
-    p2y = 0.0;
-  var j = path.length;
-  if (j < 2) return 0;
-  if (closed)
-  {
-    path[j] = path[0];
-    j++;
-  }
-  while (--j)
-  {
-    p1 = path[j];
-    p1x = p1.X;
-    p1y = p1.Y;
-    p2 = path[j - 1];
-    p2x = p2.X;
-    p2y = p2.Y;
-    perimeter += sqrt((p1x - p2x) * (p1x - p2x) + (p1y - p2y) * (p1y - p2y));
-  }
-  if (closed) path.pop();
-  return perimeter / scale;
-};
-ClipperLib.JS.PerimeterOfPaths = function (paths, closed, scale)
-{
-  if (!scale) scale = 1;
-  var perimeter = 0;
-  for (var i = 0; i < paths.length; i++)
-  {
-    perimeter += ClipperLib.JS.PerimeterOfPath(paths[i], closed, scale);
-  }
-  return perimeter;
-};
-ClipperLib.JS.ScaleDownPath = function (path, scale)
-{
-  var i, p;
-  if (!scale) scale = 1;
-  i = path.length;
-  while (i--)
-  {
-    p = path[i];
-    p.X = p.X / scale;
-    p.Y = p.Y / scale;
-  }
-};
-ClipperLib.JS.ScaleDownPaths = function (paths, scale)
-{
-  var i, j, p, round = Math.round;
-  if (!scale) scale = 1;
-  i = paths.length;
-  while (i--)
-  {
-    j = paths[i].length;
-    while (j--)
-    {
-      p = paths[i][j];
-      p.X = p.X / scale;
-      p.Y = p.Y / scale;
-    }
-  }
-};
-ClipperLib.JS.ScaleUpPath = function (path, scale)
-{
-  var i, p, round = Math.round;
-  if (!scale) scale = 1;
-  i = path.length;
-  while (i--)
-  {
-    p = path[i];
-    p.X = round(p.X * scale);
-    p.Y = round(p.Y * scale);
-  }
-};
-ClipperLib.JS.ScaleUpPaths = function (paths, scale)
-{
-  var i, j, p, round = Math.round;
-  if (!scale) scale = 1;
-  i = paths.length;
-  while (i--)
-  {
-    j = paths[i].length;
-    while (j--)
-    {
-      p = paths[i][j];
-      p.X = round(p.X * scale);
-      p.Y = round(p.Y * scale);
+
+    /**
+     * Removes `key` and its value from the map.
+     *
+     * @private
+     * @name delete
+     * @memberOf MapCache
+     * @param {string} key The key of the value to remove.
+     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     */
+    function mapCacheDelete(key) {
+      var result = getMapData(this, key)['delete'](key);
+      this.size -= result ? 1 : 0;
+      return result;
     }
-  }
-};
-ClipperLib.ExPolygons = function ()
-{
-  return [];
-}
-ClipperLib.ExPolygon = function ()
-{
-  this.outer = null;
-  this.holes = null;
-};
-ClipperLib.JS.AddOuterPolyNodeToExPolygons = function (polynode, expolygons)
-{
-  var ep = new ClipperLib.ExPolygon();
-  ep.outer = polynode.Contour();
-  var childs = polynode.Childs();
-  var ilen = childs.length;
-  ep.holes = new Array(ilen);
-  var node, n, i, j, childs2, jlen;
-  for (i = 0; i < ilen; i++)
-  {
-    node = childs[i];
-    ep.holes[i] = node.Contour();
-    //Add outer polygons contained by (nested within) holes ...
-    for (j = 0, childs2 = node.Childs(), jlen = childs2.length; j < jlen; j++)
-    {
-      n = childs2[j];
-      ClipperLib.JS.AddOuterPolyNodeToExPolygons(n, expolygons);
+
+    /**
+     * Gets the map value for `key`.
+     *
+     * @private
+     * @name get
+     * @memberOf MapCache
+     * @param {string} key The key of the value to get.
+     * @returns {*} Returns the entry value.
+     */
+    function mapCacheGet(key) {
+      return getMapData(this, key).get(key);
     }
-  }
-  expolygons.push(ep);
-};
-ClipperLib.JS.ExPolygonsToPaths = function (expolygons)
-{
-  var a, i, alen, ilen;
-  var paths = new ClipperLib.Paths();
-  for (a = 0, alen = expolygons.length; a < alen; a++)
-  {
-    paths.push(expolygons[a].outer);
-    for (i = 0, ilen = expolygons[a].holes.length; i < ilen; i++)
-    {
-      paths.push(expolygons[a].holes[i]);
+
+    /**
+     * Checks if a map value for `key` exists.
+     *
+     * @private
+     * @name has
+     * @memberOf MapCache
+     * @param {string} key The key of the entry to check.
+     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     */
+    function mapCacheHas(key) {
+      return getMapData(this, key).has(key);
     }
-  }
-  return paths;
-}
-ClipperLib.JS.PolyTreeToExPolygons = function (polytree)
-{
-  var expolygons = new ClipperLib.ExPolygons();
-  var node, i, childs, ilen;
-  for (i = 0, childs = polytree.Childs(), ilen = childs.length; i < ilen; i++)
-  {
-    node = childs[i];
-    ClipperLib.JS.AddOuterPolyNodeToExPolygons(node, expolygons);
-  }
-  return expolygons;
-};
 
+    /**
+     * Sets the map `key` to `value`.
+     *
+     * @private
+     * @name set
+     * @memberOf MapCache
+     * @param {string} key The key of the value to set.
+     * @param {*} value The value to set.
+     * @returns {Object} Returns the map cache instance.
+     */
+    function mapCacheSet(key, value) {
+      var data = getMapData(this, key),
+          size = data.size;
 
-module.exports = ClipperLib;
-},{}],3:[function(require,module,exports){
-(function (global){
-/**
- * @license
- * lodash 3.10.1 (Custom Build) <https://lodash.com/>
- * Build: `lodash modern -d -o ./index.js`
- * Copyright 2012-2015 The Dojo Foundation <http://dojofoundation.org/>
- * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
- * Copyright 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
- * Available under MIT license <https://lodash.com/license>
- */
-;(function() {
+      data.set(key, value);
+      this.size += data.size == size ? 0 : 1;
+      return this;
+    }
 
-  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
-  var undefined;
+    // Add methods to `MapCache`.
+    MapCache.prototype.clear = mapCacheClear;
+    MapCache.prototype['delete'] = mapCacheDelete;
+    MapCache.prototype.get = mapCacheGet;
+    MapCache.prototype.has = mapCacheHas;
+    MapCache.prototype.set = mapCacheSet;
 
-  /** Used as the semantic version number. */
-  var VERSION = '3.10.1';
-
-  /** Used to compose bitmasks for wrapper metadata. */
-  var BIND_FLAG = 1,
-      BIND_KEY_FLAG = 2,
-      CURRY_BOUND_FLAG = 4,
-      CURRY_FLAG = 8,
-      CURRY_RIGHT_FLAG = 16,
-      PARTIAL_FLAG = 32,
-      PARTIAL_RIGHT_FLAG = 64,
-      ARY_FLAG = 128,
-      REARG_FLAG = 256;
-
-  /** Used as default options for `_.trunc`. */
-  var DEFAULT_TRUNC_LENGTH = 30,
-      DEFAULT_TRUNC_OMISSION = '...';
+    /*------------------------------------------------------------------------*/
 
-  /** Used to detect when a function becomes hot. */
-  var HOT_COUNT = 150,
-      HOT_SPAN = 16;
+    /**
+     *
+     * Creates an array cache object to store unique values.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [values] The values to cache.
+     */
+    function SetCache(values) {
+      var index = -1,
+          length = values == null ? 0 : values.length;
 
-  /** Used as the size to enable large array optimizations. */
-  var LARGE_ARRAY_SIZE = 200;
+      this.__data__ = new MapCache;
+      while (++index < length) {
+        this.add(values[index]);
+      }
+    }
 
-  /** Used to indicate the type of lazy iteratees. */
-  var LAZY_FILTER_FLAG = 1,
-      LAZY_MAP_FLAG = 2;
+    /**
+     * Adds `value` to the array cache.
+     *
+     * @private
+     * @name add
+     * @memberOf SetCache
+     * @alias push
+     * @param {*} value The value to cache.
+     * @returns {Object} Returns the cache instance.
+     */
+    function setCacheAdd(value) {
+      this.__data__.set(value, HASH_UNDEFINED);
+      return this;
+    }
 
-  /** Used as the `TypeError` message for "Functions" methods. */
-  var FUNC_ERROR_TEXT = 'Expected a function';
+    /**
+     * Checks if `value` is in the array cache.
+     *
+     * @private
+     * @name has
+     * @memberOf SetCache
+     * @param {*} value The value to search for.
+     * @returns {number} Returns `true` if `value` is found, else `false`.
+     */
+    function setCacheHas(value) {
+      return this.__data__.has(value);
+    }
 
-  /** Used as the internal argument placeholder. */
-  var PLACEHOLDER = '__lodash_placeholder__';
+    // Add methods to `SetCache`.
+    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
+    SetCache.prototype.has = setCacheHas;
 
-  /** `Object#toString` result references. */
-  var argsTag = '[object Arguments]',
-      arrayTag = '[object Array]',
-      boolTag = '[object Boolean]',
-      dateTag = '[object Date]',
-      errorTag = '[object Error]',
-      funcTag = '[object Function]',
-      mapTag = '[object Map]',
-      numberTag = '[object Number]',
-      objectTag = '[object Object]',
-      regexpTag = '[object RegExp]',
-      setTag = '[object Set]',
-      stringTag = '[object String]',
-      weakMapTag = '[object WeakMap]';
+    /*------------------------------------------------------------------------*/
 
-  var arrayBufferTag = '[object ArrayBuffer]',
-      float32Tag = '[object Float32Array]',
-      float64Tag = '[object Float64Array]',
-      int8Tag = '[object Int8Array]',
-      int16Tag = '[object Int16Array]',
-      int32Tag = '[object Int32Array]',
-      uint8Tag = '[object Uint8Array]',
-      uint8ClampedTag = '[object Uint8ClampedArray]',
-      uint16Tag = '[object Uint16Array]',
-      uint32Tag = '[object Uint32Array]';
+    /**
+     * Creates a stack cache object to store key-value pairs.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [entries] The key-value pairs to cache.
+     */
+    function Stack(entries) {
+      var data = this.__data__ = new ListCache(entries);
+      this.size = data.size;
+    }
 
-  /** Used to match empty string literals in compiled template source. */
-  var reEmptyStringLeading = /\b__p \+= '';/g,
-      reEmptyStringMiddle = /\b(__p \+=) '' \+/g,
-      reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g;
+    /**
+     * Removes all key-value entries from the stack.
+     *
+     * @private
+     * @name clear
+     * @memberOf Stack
+     */
+    function stackClear() {
+      this.__data__ = new ListCache;
+      this.size = 0;
+    }
 
-  /** Used to match HTML entities and HTML characters. */
-  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39|#96);/g,
-      reUnescapedHtml = /[&<>"'`]/g,
-      reHasEscapedHtml = RegExp(reEscapedHtml.source),
-      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);
+    /**
+     * Removes `key` and its value from the stack.
+     *
+     * @private
+     * @name delete
+     * @memberOf Stack
+     * @param {string} key The key of the value to remove.
+     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     */
+    function stackDelete(key) {
+      var data = this.__data__,
+          result = data['delete'](key);
 
-  /** Used to match template delimiters. */
-  var reEscape = /<%-([\s\S]+?)%>/g,
-      reEvaluate = /<%([\s\S]+?)%>/g,
-      reInterpolate = /<%=([\s\S]+?)%>/g;
+      this.size = data.size;
+      return result;
+    }
 
-  /** Used to match property names within property paths. */
-  var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\n\\]|\\.)*?\1)\]/,
-      reIsPlainProp = /^\w*$/,
-      rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\n\\]|\\.)*?)\2)\]/g;
-
-  /**
-   * Used to match `RegExp` [syntax characters](http://ecma-international.org/ecma-262/6.0/#sec-patterns)
-   * and those outlined by [`EscapeRegExpPattern`](http://ecma-international.org/ecma-262/6.0/#sec-escaperegexppattern).
-   */
-  var reRegExpChars = /^[:!,]|[\\^$.*+?()[\]{}|\/]|(^[0-9a-fA-Fnrtuvx])|([\n\r\u2028\u2029])/g,
-      reHasRegExpChars = RegExp(reRegExpChars.source);
+    /**
+     * Gets the stack value for `key`.
+     *
+     * @private
+     * @name get
+     * @memberOf Stack
+     * @param {string} key The key of the value to get.
+     * @returns {*} Returns the entry value.
+     */
+    function stackGet(key) {
+      return this.__data__.get(key);
+    }
 
-  /** Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks). */
-  var reComboMark = /[\u0300-\u036f\ufe20-\ufe23]/g;
+    /**
+     * Checks if a stack value for `key` exists.
+     *
+     * @private
+     * @name has
+     * @memberOf Stack
+     * @param {string} key The key of the entry to check.
+     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     */
+    function stackHas(key) {
+      return this.__data__.has(key);
+    }
 
-  /** Used to match backslashes in property paths. */
-  var reEscapeChar = /\\(\\)?/g;
+    /**
+     * Sets the stack `key` to `value`.
+     *
+     * @private
+     * @name set
+     * @memberOf Stack
+     * @param {string} key The key of the value to set.
+     * @param {*} value The value to set.
+     * @returns {Object} Returns the stack cache instance.
+     */
+    function stackSet(key, value) {
+      var data = this.__data__;
+      if (data instanceof ListCache) {
+        var pairs = data.__data__;
+        if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {
+          pairs.push([key, value]);
+          this.size = ++data.size;
+          return this;
+        }
+        data = this.__data__ = new MapCache(pairs);
+      }
+      data.set(key, value);
+      this.size = data.size;
+      return this;
+    }
 
-  /** Used to match [ES template delimiters](http://ecma-international.org/ecma-262/6.0/#sec-template-literal-lexical-components). */
-  var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g;
+    // Add methods to `Stack`.
+    Stack.prototype.clear = stackClear;
+    Stack.prototype['delete'] = stackDelete;
+    Stack.prototype.get = stackGet;
+    Stack.prototype.has = stackHas;
+    Stack.prototype.set = stackSet;
 
-  /** Used to match `RegExp` flags from their coerced string values. */
-  var reFlags = /\w*$/;
+    /*------------------------------------------------------------------------*/
 
-  /** Used to detect hexadecimal string values. */
-  var reHasHexPrefix = /^0[xX]/;
+    /**
+     * Creates an array of the enumerable property names of the array-like `value`.
+     *
+     * @private
+     * @param {*} value The value to query.
+     * @param {boolean} inherited Specify returning inherited property names.
+     * @returns {Array} Returns the array of property names.
+     */
+    function arrayLikeKeys(value, inherited) {
+      var isArr = isArray(value),
+          isArg = !isArr && isArguments(value),
+          isBuff = !isArr && !isArg && isBuffer(value),
+          isType = !isArr && !isArg && !isBuff && isTypedArray(value),
+          skipIndexes = isArr || isArg || isBuff || isType,
+          result = skipIndexes ? baseTimes(value.length, String) : [],
+          length = result.length;
 
-  /** Used to detect host constructors (Safari > 5). */
-  var reIsHostCtor = /^\[object .+?Constructor\]$/;
+      for (var key in value) {
+        if ((inherited || hasOwnProperty.call(value, key)) &&
+            !(skipIndexes && (
+               // Safari 9 has enumerable `arguments.length` in strict mode.
+               key == 'length' ||
+               // Node.js 0.10 has enumerable non-index properties on buffers.
+               (isBuff && (key == 'offset' || key == 'parent')) ||
+               // PhantomJS 2 has enumerable non-index properties on typed arrays.
+               (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||
+               // Skip index properties.
+               isIndex(key, length)
+            ))) {
+          result.push(key);
+        }
+      }
+      return result;
+    }
 
-  /** Used to detect unsigned integer values. */
-  var reIsUint = /^\d+$/;
+    /**
+     * A specialized version of `_.sample` for arrays.
+     *
+     * @private
+     * @param {Array} array The array to sample.
+     * @returns {*} Returns the random element.
+     */
+    function arraySample(array) {
+      var length = array.length;
+      return length ? array[baseRandom(0, length - 1)] : undefined;
+    }
 
-  /** Used to match latin-1 supplementary letters (excluding mathematical operators). */
-  var reLatin1 = /[\xc0-\xd6\xd8-\xde\xdf-\xf6\xf8-\xff]/g;
+    /**
+     * A specialized version of `_.sampleSize` for arrays.
+     *
+     * @private
+     * @param {Array} array The array to sample.
+     * @param {number} n The number of elements to sample.
+     * @returns {Array} Returns the random elements.
+     */
+    function arraySampleSize(array, n) {
+      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));
+    }
 
-  /** Used to ensure capturing order of template delimiters. */
-  var reNoMatch = /($^)/;
+    /**
+     * A specialized version of `_.shuffle` for arrays.
+     *
+     * @private
+     * @param {Array} array The array to shuffle.
+     * @returns {Array} Returns the new shuffled array.
+     */
+    function arrayShuffle(array) {
+      return shuffleSelf(copyArray(array));
+    }
 
-  /** Used to match unescaped characters in compiled string literals. */
-  var reUnescapedString = /['\n\r\u2028\u2029\\]/g;
+    /**
+     * This function is like `assignValue` except that it doesn't assign
+     * `undefined` values.
+     *
+     * @private
+     * @param {Object} object The object to modify.
+     * @param {string} key The key of the property to assign.
+     * @param {*} value The value to assign.
+     */
+    function assignMergeValue(object, key, value) {
+      if ((value !== undefined && !eq(object[key], value)) ||
+          (value === undefined && !(key in object))) {
+        baseAssignValue(object, key, value);
+      }
+    }
 
-  /** Used to match words to create compound words. */
-  var reWords = (function() {
-    var upper = '[A-Z\\xc0-\\xd6\\xd8-\\xde]',
-        lower = '[a-z\\xdf-\\xf6\\xf8-\\xff]+';
+    /**
+     * Assigns `value` to `key` of `object` if the existing value is not equivalent
+     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons.
+     *
+     * @private
+     * @param {Object} object The object to modify.
+     * @param {string} key The key of the property to assign.
+     * @param {*} value The value to assign.
+     */
+    function assignValue(object, key, value) {
+      var objValue = object[key];
+      if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||
+          (value === undefined && !(key in object))) {
+        baseAssignValue(object, key, value);
+      }
+    }
 
-    return RegExp(upper + '+(?=' + upper + lower + ')|' + upper + '?' + lower + '|' + upper + '+|[0-9]+', 'g');
-  }());
+    /**
+     * Gets the index at which the `key` is found in `array` of key-value pairs.
+     *
+     * @private
+     * @param {Array} array The array to inspect.
+     * @param {*} key The key to search for.
+     * @returns {number} Returns the index of the matched value, else `-1`.
+     */
+    function assocIndexOf(array, key) {
+      var length = array.length;
+      while (length--) {
+        if (eq(array[length][0], key)) {
+          return length;
+        }
+      }
+      return -1;
+    }
 
-  /** Used to assign default `context` object properties. */
-  var contextProps = [
-    'Array', 'ArrayBuffer', 'Date', 'Error', 'Float32Array', 'Float64Array',
-    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Math', 'Number',
-    'Object', 'RegExp', 'Set', 'String', '_', 'clearTimeout', 'isFinite',
-    'parseFloat', 'parseInt', 'setTimeout', 'TypeError', 'Uint8Array',
-    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap'
-  ];
+    /**
+     * Aggregates elements of `collection` on `accumulator` with keys transformed
+     * by `iteratee` and values set by `setter`.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} setter The function to set `accumulator` values.
+     * @param {Function} iteratee The iteratee to transform keys.
+     * @param {Object} accumulator The initial aggregated object.
+     * @returns {Function} Returns `accumulator`.
+     */
+    function baseAggregator(collection, setter, iteratee, accumulator) {
+      baseEach(collection, function(value, key, collection) {
+        setter(accumulator, value, iteratee(value), collection);
+      });
+      return accumulator;
+    }
 
-  /** Used to make template sourceURLs easier to identify. */
-  var templateCounter = -1;
+    /**
+     * The base implementation of `_.assign` without support for multiple sources
+     * or `customizer` functions.
+     *
+     * @private
+     * @param {Object} object The destination object.
+     * @param {Object} source The source object.
+     * @returns {Object} Returns `object`.
+     */
+    function baseAssign(object, source) {
+      return object && copyObject(source, keys(source), object);
+    }
 
-  /** Used to identify `toStringTag` values of typed arrays. */
-  var typedArrayTags = {};
-  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
-  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
-  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
-  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
-  typedArrayTags[uint32Tag] = true;
-  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =
-  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
-  typedArrayTags[dateTag] = typedArrayTags[errorTag] =
-  typedArrayTags[funcTag] = typedArrayTags[mapTag] =
-  typedArrayTags[numberTag] = typedArrayTags[objectTag] =
-  typedArrayTags[regexpTag] = typedArrayTags[setTag] =
-  typedArrayTags[stringTag] = typedArrayTags[weakMapTag] = false;
+    /**
+     * The base implementation of `_.assignIn` without support for multiple sources
+     * or `customizer` functions.
+     *
+     * @private
+     * @param {Object} object The destination object.
+     * @param {Object} source The source object.
+     * @returns {Object} Returns `object`.
+     */
+    function baseAssignIn(object, source) {
+      return object && copyObject(source, keysIn(source), object);
+    }
 
-  /** Used to identify `toStringTag` values supported by `_.clone`. */
-  var cloneableTags = {};
-  cloneableTags[argsTag] = cloneableTags[arrayTag] =
-  cloneableTags[arrayBufferTag] = cloneableTags[boolTag] =
-  cloneableTags[dateTag] = cloneableTags[float32Tag] =
-  cloneableTags[float64Tag] = cloneableTags[int8Tag] =
-  cloneableTags[int16Tag] = cloneableTags[int32Tag] =
-  cloneableTags[numberTag] = cloneableTags[objectTag] =
-  cloneableTags[regexpTag] = cloneableTags[stringTag] =
-  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
-  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
-  cloneableTags[errorTag] = cloneableTags[funcTag] =
-  cloneableTags[mapTag] = cloneableTags[setTag] =
-  cloneableTags[weakMapTag] = false;
+    /**
+     * The base implementation of `assignValue` and `assignMergeValue` without
+     * value checks.
+     *
+     * @private
+     * @param {Object} object The object to modify.
+     * @param {string} key The key of the property to assign.
+     * @param {*} value The value to assign.
+     */
+    function baseAssignValue(object, key, value) {
+      if (key == '__proto__' && defineProperty) {
+        defineProperty(object, key, {
+          'configurable': true,
+          'enumerable': true,
+          'value': value,
+          'writable': true
+        });
+      } else {
+        object[key] = value;
+      }
+    }
 
-  /** Used to map latin-1 supplementary letters to basic latin letters. */
-  var deburredLetters = {
-    '\xc0': 'A',  '\xc1': 'A', '\xc2': 'A', '\xc3': 'A', '\xc4': 'A', '\xc5': 'A',
-    '\xe0': 'a',  '\xe1': 'a', '\xe2': 'a', '\xe3': 'a', '\xe4': 'a', '\xe5': 'a',
-    '\xc7': 'C',  '\xe7': 'c',
-    '\xd0': 'D',  '\xf0': 'd',
-    '\xc8': 'E',  '\xc9': 'E', '\xca': 'E', '\xcb': 'E',
-    '\xe8': 'e',  '\xe9': 'e', '\xea': 'e', '\xeb': 'e',
-    '\xcC': 'I',  '\xcd': 'I', '\xce': 'I', '\xcf': 'I',
-    '\xeC': 'i',  '\xed': 'i', '\xee': 'i', '\xef': 'i',
-    '\xd1': 'N',  '\xf1': 'n',
-    '\xd2': 'O',  '\xd3': 'O', '\xd4': 'O', '\xd5': 'O', '\xd6': 'O', '\xd8': 'O',
-    '\xf2': 'o',  '\xf3': 'o', '\xf4': 'o', '\xf5': 'o', '\xf6': 'o', '\xf8': 'o',
-    '\xd9': 'U',  '\xda': 'U', '\xdb': 'U', '\xdc': 'U',
-    '\xf9': 'u',  '\xfa': 'u', '\xfb': 'u', '\xfc': 'u',
-    '\xdd': 'Y',  '\xfd': 'y', '\xff': 'y',
-    '\xc6': 'Ae', '\xe6': 'ae',
-    '\xde': 'Th', '\xfe': 'th',
-    '\xdf': 'ss'
-  };
+    /**
+     * The base implementation of `_.at` without support for individual paths.
+     *
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {string[]} paths The property paths to pick.
+     * @returns {Array} Returns the picked elements.
+     */
+    function baseAt(object, paths) {
+      var index = -1,
+          length = paths.length,
+          result = Array(length),
+          skip = object == null;
 
-  /** Used to map characters to HTML entities. */
-  var htmlEscapes = {
-    '&': '&amp;',
-    '<': '&lt;',
-    '>': '&gt;',
-    '"': '&quot;',
-    "'": '&#39;',
-    '`': '&#96;'
-  };
+      while (++index < length) {
+        result[index] = skip ? undefined : get(object, paths[index]);
+      }
+      return result;
+    }
 
-  /** Used to map HTML entities to characters. */
-  var htmlUnescapes = {
-    '&amp;': '&',
-    '&lt;': '<',
-    '&gt;': '>',
-    '&quot;': '"',
-    '&#39;': "'",
-    '&#96;': '`'
-  };
+    /**
+     * The base implementation of `_.clamp` which doesn't coerce arguments.
+     *
+     * @private
+     * @param {number} number The number to clamp.
+     * @param {number} [lower] The lower bound.
+     * @param {number} upper The upper bound.
+     * @returns {number} Returns the clamped number.
+     */
+    function baseClamp(number, lower, upper) {
+      if (number === number) {
+        if (upper !== undefined) {
+          number = number <= upper ? number : upper;
+        }
+        if (lower !== undefined) {
+          number = number >= lower ? number : lower;
+        }
+      }
+      return number;
+    }
 
-  /** Used to determine if values are of the language type `Object`. */
-  var objectTypes = {
-    'function': true,
-    'object': true
-  };
+    /**
+     * The base implementation of `_.clone` and `_.cloneDeep` which tracks
+     * traversed objects.
+     *
+     * @private
+     * @param {*} value The value to clone.
+     * @param {boolean} bitmask The bitmask flags.
+     *  1 - Deep clone
+     *  2 - Flatten inherited properties
+     *  4 - Clone symbols
+     * @param {Function} [customizer] The function to customize cloning.
+     * @param {string} [key] The key of `value`.
+     * @param {Object} [object] The parent object of `value`.
+     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.
+     * @returns {*} Returns the cloned value.
+     */
+    function baseClone(value, bitmask, customizer, key, object, stack) {
+      var result,
+          isDeep = bitmask & CLONE_DEEP_FLAG,
+          isFlat = bitmask & CLONE_FLAT_FLAG,
+          isFull = bitmask & CLONE_SYMBOLS_FLAG;
 
-  /** Used to escape characters for inclusion in compiled regexes. */
-  var regexpEscapes = {
-    '0': 'x30', '1': 'x31', '2': 'x32', '3': 'x33', '4': 'x34',
-    '5': 'x35', '6': 'x36', '7': 'x37', '8': 'x38', '9': 'x39',
-    'A': 'x41', 'B': 'x42', 'C': 'x43', 'D': 'x44', 'E': 'x45', 'F': 'x46',
-    'a': 'x61', 'b': 'x62', 'c': 'x63', 'd': 'x64', 'e': 'x65', 'f': 'x66',
-    'n': 'x6e', 'r': 'x72', 't': 'x74', 'u': 'x75', 'v': 'x76', 'x': 'x78'
-  };
+      if (customizer) {
+        result = object ? customizer(value, key, object, stack) : customizer(value);
+      }
+      if (result !== undefined) {
+        return result;
+      }
+      if (!isObject(value)) {
+        return value;
+      }
+      var isArr = isArray(value);
+      if (isArr) {
+        result = initCloneArray(value);
+        if (!isDeep) {
+          return copyArray(value, result);
+        }
+      } else {
+        var tag = getTag(value),
+            isFunc = tag == funcTag || tag == genTag;
 
-  /** Used to escape characters for inclusion in compiled string literals. */
-  var stringEscapes = {
-    '\\': '\\',
-    "'": "'",
-    '\n': 'n',
-    '\r': 'r',
-    '\u2028': 'u2028',
-    '\u2029': 'u2029'
-  };
+        if (isBuffer(value)) {
+          return cloneBuffer(value, isDeep);
+        }
+        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
+          result = (isFlat || isFunc) ? {} : initCloneObject(value);
+          if (!isDeep) {
+            return isFlat
+              ? copySymbolsIn(value, baseAssignIn(result, value))
+              : copySymbols(value, baseAssign(result, value));
+          }
+        } else {
+          if (!cloneableTags[tag]) {
+            return object ? value : {};
+          }
+          result = initCloneByTag(value, tag, baseClone, isDeep);
+        }
+      }
+      // Check for circular references and return its corresponding clone.
+      stack || (stack = new Stack);
+      var stacked = stack.get(value);
+      if (stacked) {
+        return stacked;
+      }
+      stack.set(value, result);
 
-  /** Detect free variable `exports`. */
-  var freeExports = objectTypes[typeof exports] && exports && !exports.nodeType && exports;
+      var keysFunc = isFull
+        ? (isFlat ? getAllKeysIn : getAllKeys)
+        : (isFlat ? keysIn : keys);
 
-  /** Detect free variable `module`. */
-  var freeModule = objectTypes[typeof module] && module && !module.nodeType && module;
+      var props = isArr ? undefined : keysFunc(value);
+      arrayEach(props || value, function(subValue, key) {
+        if (props) {
+          key = subValue;
+          subValue = value[key];
+        }
+        // Recursively populate clone (susceptible to call stack limits).
+        assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));
+      });
+      return result;
+    }
 
-  /** Detect free variable `global` from Node.js. */
-  var freeGlobal = freeExports && freeModule && typeof global == 'object' && global && global.Object && global;
+    /**
+     * The base implementation of `_.conforms` which doesn't clone `source`.
+     *
+     * @private
+     * @param {Object} source The object of property predicates to conform to.
+     * @returns {Function} Returns the new spec function.
+     */
+    function baseConforms(source) {
+      var props = keys(source);
+      return function(object) {
+        return baseConformsTo(object, source, props);
+      };
+    }
 
-  /** Detect free variable `self`. */
-  var freeSelf = objectTypes[typeof self] && self && self.Object && self;
-
-  /** Detect free variable `window`. */
-  var freeWindow = objectTypes[typeof window] && window && window.Object && window;
+    /**
+     * The base implementation of `_.conformsTo` which accepts `props` to check.
+     *
+     * @private
+     * @param {Object} object The object to inspect.
+     * @param {Object} source The object of property predicates to conform to.
+     * @returns {boolean} Returns `true` if `object` conforms, else `false`.
+     */
+    function baseConformsTo(object, source, props) {
+      var length = props.length;
+      if (object == null) {
+        return !length;
+      }
+      object = Object(object);
+      while (length--) {
+        var key = props[length],
+            predicate = source[key],
+            value = object[key];
 
-  /** Detect the popular CommonJS extension `module.exports`. */
-  var moduleExports = freeModule && freeModule.exports === freeExports && freeExports;
+        if ((value === undefined && !(key in object)) || !predicate(value)) {
+          return false;
+        }
+      }
+      return true;
+    }
 
-  /**
-   * Used as a reference to the global object.
-   *
-   * The `this` value is used if it's the global object to avoid Greasemonkey's
-   * restricted `window` object, otherwise the `window` object is used.
-   */
-  var root = freeGlobal || ((freeWindow !== (this && this.window)) && freeWindow) || freeSelf || this;
+    /**
+     * The base implementation of `_.delay` and `_.defer` which accepts `args`
+     * to provide to `func`.
+     *
+     * @private
+     * @param {Function} func The function to delay.
+     * @param {number} wait The number of milliseconds to delay invocation.
+     * @param {Array} args The arguments to provide to `func`.
+     * @returns {number|Object} Returns the timer id or timeout object.
+     */
+    function baseDelay(func, wait, args) {
+      if (typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
+      }
+      return setTimeout(function() { func.apply(undefined, args); }, wait);
+    }
 
-  /*--------------------------------------------------------------------------*/
+    /**
+     * The base implementation of methods like `_.difference` without support
+     * for excluding multiple arrays or iteratee shorthands.
+     *
+     * @private
+     * @param {Array} array The array to inspect.
+     * @param {Array} values The values to exclude.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     */
+    function baseDifference(array, values, iteratee, comparator) {
+      var index = -1,
+          includes = arrayIncludes,
+          isCommon = true,
+          length = array.length,
+          result = [],
+          valuesLength = values.length;
 
-  /**
-   * The base implementation of `compareAscending` which compares values and
-   * sorts them in ascending order without guaranteeing a stable sort.
-   *
-   * @private
-   * @param {*} value The value to compare.
-   * @param {*} other The other value to compare.
-   * @returns {number} Returns the sort order indicator for `value`.
-   */
-  function baseCompareAscending(value, other) {
-    if (value !== other) {
-      var valIsNull = value === null,
-          valIsUndef = value === undefined,
-          valIsReflexive = value === value;
-
-      var othIsNull = other === null,
-          othIsUndef = other === undefined,
-          othIsReflexive = other === other;
-
-      if ((value > other && !othIsNull) || !valIsReflexive ||
-          (valIsNull && !othIsUndef && othIsReflexive) ||
-          (valIsUndef && othIsReflexive)) {
-        return 1;
+      if (!length) {
+        return result;
       }
-      if ((value < other && !valIsNull) || !othIsReflexive ||
-          (othIsNull && !valIsUndef && valIsReflexive) ||
-          (othIsUndef && valIsReflexive)) {
-        return -1;
+      if (iteratee) {
+        values = arrayMap(values, baseUnary(iteratee));
       }
-    }
-    return 0;
-  }
-
-  /**
-   * The base implementation of `_.findIndex` and `_.findLastIndex` without
-   * support for callback shorthands and `this` binding.
-   *
-   * @private
-   * @param {Array} array The array to search.
-   * @param {Function} predicate The function invoked per iteration.
-   * @param {boolean} [fromRight] Specify iterating from right to left.
-   * @returns {number} Returns the index of the matched value, else `-1`.
-   */
-  function baseFindIndex(array, predicate, fromRight) {
-    var length = array.length,
-        index = fromRight ? length : -1;
+      if (comparator) {
+        includes = arrayIncludesWith;
+        isCommon = false;
+      }
+      else if (values.length >= LARGE_ARRAY_SIZE) {
+        includes = cacheHas;
+        isCommon = false;
+        values = new SetCache(values);
+      }
+      outer:
+      while (++index < length) {
+        var value = array[index],
+            computed = iteratee == null ? value : iteratee(value);
 
-    while ((fromRight ? index-- : ++index < length)) {
-      if (predicate(array[index], index, array)) {
-        return index;
+        value = (comparator || value !== 0) ? value : 0;
+        if (isCommon && computed === computed) {
+          var valuesIndex = valuesLength;
+          while (valuesIndex--) {
+            if (values[valuesIndex] === computed) {
+              continue outer;
+            }
+          }
+          result.push(value);
+        }
+        else if (!includes(values, computed, comparator)) {
+          result.push(value);
+        }
       }
+      return result;
     }
-    return -1;
-  }
 
-  /**
-   * The base implementation of `_.indexOf` without support for binary searches.
-   *
-   * @private
-   * @param {Array} array The array to search.
-   * @param {*} value The value to search for.
-   * @param {number} fromIndex The index to search from.
-   * @returns {number} Returns the index of the matched value, else `-1`.
-   */
-  function baseIndexOf(array, value, fromIndex) {
-    if (value !== value) {
-      return indexOfNaN(array, fromIndex);
-    }
-    var index = fromIndex - 1,
-        length = array.length;
+    /**
+     * The base implementation of `_.forEach` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Array|Object} Returns `collection`.
+     */
+    var baseEach = createBaseEach(baseForOwn);
 
-    while (++index < length) {
-      if (array[index] === value) {
-        return index;
-      }
+    /**
+     * The base implementation of `_.forEachRight` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Array|Object} Returns `collection`.
+     */
+    var baseEachRight = createBaseEach(baseForOwnRight, true);
+
+    /**
+     * The base implementation of `_.every` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} predicate The function invoked per iteration.
+     * @returns {boolean} Returns `true` if all elements pass the predicate check,
+     *  else `false`
+     */
+    function baseEvery(collection, predicate) {
+      var result = true;
+      baseEach(collection, function(value, index, collection) {
+        result = !!predicate(value, index, collection);
+        return result;
+      });
+      return result;
     }
-    return -1;
-  }
 
-  /**
-   * The base implementation of `_.isFunction` without support for environments
-   * with incorrect `typeof` results.
-   *
-   * @private
-   * @param {*} value The value to check.
-   * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
-   */
-  function baseIsFunction(value) {
-    // Avoid a Chakra JIT bug in compatibility modes of IE 11.
-    // See https://github.com/jashkenas/underscore/issues/1621 for more details.
-    return typeof value == 'function' || false;
-  }
+    /**
+     * The base implementation of methods like `_.max` and `_.min` which accepts a
+     * `comparator` to determine the extremum value.
+     *
+     * @private
+     * @param {Array} array The array to iterate over.
+     * @param {Function} iteratee The iteratee invoked per iteration.
+     * @param {Function} comparator The comparator used to compare values.
+     * @returns {*} Returns the extremum value.
+     */
+    function baseExtremum(array, iteratee, comparator) {
+      var index = -1,
+          length = array.length;
 
-  /**
-   * Converts `value` to a string if it's not one. An empty string is returned
-   * for `null` or `undefined` values.
-   *
-   * @private
-   * @param {*} value The value to process.
-   * @returns {string} Returns the string.
-   */
-  function baseToString(value) {
-    return value == null ? '' : (value + '');
-  }
+      while (++index < length) {
+        var value = array[index],
+            current = iteratee(value);
 
-  /**
-   * Used by `_.trim` and `_.trimLeft` to get the index of the first character
-   * of `string` that is not found in `chars`.
-   *
-   * @private
-   * @param {string} string The string to inspect.
-   * @param {string} chars The characters to find.
-   * @returns {number} Returns the index of the first character not found in `chars`.
-   */
-  function charsLeftIndex(string, chars) {
-    var index = -1,
-        length = string.length;
+        if (current != null && (computed === undefined
+              ? (current === current && !isSymbol(current))
+              : comparator(current, computed)
+            )) {
+          var computed = current,
+              result = value;
+        }
+      }
+      return result;
+    }
 
-    while (++index < length && chars.indexOf(string.charAt(index)) > -1) {}
-    return index;
-  }
+    /**
+     * The base implementation of `_.fill` without an iteratee call guard.
+     *
+     * @private
+     * @param {Array} array The array to fill.
+     * @param {*} value The value to fill `array` with.
+     * @param {number} [start=0] The start position.
+     * @param {number} [end=array.length] The end position.
+     * @returns {Array} Returns `array`.
+     */
+    function baseFill(array, value, start, end) {
+      var length = array.length;
 
-  /**
-   * Used by `_.trim` and `_.trimRight` to get the index of the last character
-   * of `string` that is not found in `chars`.
-   *
-   * @private
-   * @param {string} string The string to inspect.
-   * @param {string} chars The characters to find.
-   * @returns {number} Returns the index of the last character not found in `chars`.
-   */
-  function charsRightIndex(string, chars) {
-    var index = string.length;
+      start = toInteger(start);
+      if (start < 0) {
+        start = -start > length ? 0 : (length + start);
+      }
+      end = (end === undefined || end > length) ? length : toInteger(end);
+      if (end < 0) {
+        end += length;
+      }
+      end = start > end ? 0 : toLength(end);
+      while (start < end) {
+        array[start++] = value;
+      }
+      return array;
+    }
 
-    while (index-- && chars.indexOf(string.charAt(index)) > -1) {}
-    return index;
-  }
+    /**
+     * The base implementation of `_.filter` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} predicate The function invoked per iteration.
+     * @returns {Array} Returns the new filtered array.
+     */
+    function baseFilter(collection, predicate) {
+      var result = [];
+      baseEach(collection, function(value, index, collection) {
+        if (predicate(value, index, collection)) {
+          result.push(value);
+        }
+      });
+      return result;
+    }
 
-  /**
-   * Used by `_.sortBy` to compare transformed elements of a collection and stable
-   * sort them in ascending order.
-   *
-   * @private
-   * @param {Object} object The object to compare.
-   * @param {Object} other The other object to compare.
-   * @returns {number} Returns the sort order indicator for `object`.
-   */
-  function compareAscending(object, other) {
-    return baseCompareAscending(object.criteria, other.criteria) || (object.index - other.index);
-  }
+    /**
+     * The base implementation of `_.flatten` with support for restricting flattening.
+     *
+     * @private
+     * @param {Array} array The array to flatten.
+     * @param {number} depth The maximum recursion depth.
+     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
+     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
+     * @param {Array} [result=[]] The initial result value.
+     * @returns {Array} Returns the new flattened array.
+     */
+    function baseFlatten(array, depth, predicate, isStrict, result) {
+      var index = -1,
+          length = array.length;
 
-  /**
-   * Used by `_.sortByOrder` to compare multiple properties of a value to another
-   * and stable sort them.
-   *
-   * If `orders` is unspecified, all valuess are sorted in ascending order. Otherwise,
-   * a value is sorted in ascending order if its corresponding order is "asc", and
-   * descending if "desc".
-   *
-   * @private
-   * @param {Object} object The object to compare.
-   * @param {Object} other The other object to compare.
-   * @param {boolean[]} orders The order to sort by for each property.
-   * @returns {number} Returns the sort order indicator for `object`.
-   */
-  function compareMultiple(object, other, orders) {
-    var index = -1,
-        objCriteria = object.criteria,
-        othCriteria = other.criteria,
-        length = objCriteria.length,
-        ordersLength = orders.length;
+      predicate || (predicate = isFlattenable);
+      result || (result = []);
 
-    while (++index < length) {
-      var result = baseCompareAscending(objCriteria[index], othCriteria[index]);
-      if (result) {
-        if (index >= ordersLength) {
-          return result;
+      while (++index < length) {
+        var value = array[index];
+        if (depth > 0 && predicate(value)) {
+          if (depth > 1) {
+            // Recursively flatten arrays (susceptible to call stack limits).
+            baseFlatten(value, depth - 1, predicate, isStrict, result);
+          } else {
+            arrayPush(result, value);
+          }
+        } else if (!isStrict) {
+          result[result.length] = value;
         }
-        var order = orders[index];
-        return result * ((order === 'asc' || order === true) ? 1 : -1);
       }
+      return result;
     }
-    // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
-    // that causes it, under certain circumstances, to provide the same value for
-    // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247
-    // for more details.
-    //
-    // This also ensures a stable sort in V8 and other engines.
-    // See https://code.google.com/p/v8/issues/detail?id=90 for more details.
-    return object.index - other.index;
-  }
-
-  /**
-   * Used by `_.deburr` to convert latin-1 supplementary letters to basic latin letters.
-   *
-   * @private
-   * @param {string} letter The matched letter to deburr.
-   * @returns {string} Returns the deburred letter.
-   */
-  function deburrLetter(letter) {
-    return deburredLetters[letter];
-  }
 
-  /**
-   * Used by `_.escape` to convert characters to HTML entities.
-   *
-   * @private
-   * @param {string} chr The matched character to escape.
-   * @returns {string} Returns the escaped character.
-   */
-  function escapeHtmlChar(chr) {
-    return htmlEscapes[chr];
-  }
-
-  /**
-   * Used by `_.escapeRegExp` to escape characters for inclusion in compiled regexes.
-   *
-   * @private
-   * @param {string} chr The matched character to escape.
-   * @param {string} leadingChar The capture group for a leading character.
-   * @param {string} whitespaceChar The capture group for a whitespace character.
-   * @returns {string} Returns the escaped character.
-   */
-  function escapeRegExpChar(chr, leadingChar, whitespaceChar) {
-    if (leadingChar) {
-      chr = regexpEscapes[chr];
-    } else if (whitespaceChar) {
-      chr = stringEscapes[chr];
-    }
-    return '\\' + chr;
-  }
+    /**
+     * The base implementation of `baseForOwn` which iterates over `object`
+     * properties returned by `keysFunc` and invokes `iteratee` for each property.
+     * Iteratee functions may exit iteration early by explicitly returning `false`.
+     *
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @param {Function} keysFunc The function to get the keys of `object`.
+     * @returns {Object} Returns `object`.
+     */
+    var baseFor = createBaseFor();
 
-  /**
-   * Used by `_.template` to escape characters for inclusion in compiled string literals.
-   *
-   * @private
-   * @param {string} chr The matched character to escape.
-   * @returns {string} Returns the escaped character.
-   */
-  function escapeStringChar(chr) {
-    return '\\' + stringEscapes[chr];
-  }
+    /**
+     * This function is like `baseFor` except that it iterates over properties
+     * in the opposite order.
+     *
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @param {Function} keysFunc The function to get the keys of `object`.
+     * @returns {Object} Returns `object`.
+     */
+    var baseForRight = createBaseFor(true);
 
-  /**
-   * Gets the index at which the first occurrence of `NaN` is found in `array`.
-   *
-   * @private
-   * @param {Array} array The array to search.
-   * @param {number} fromIndex The index to search from.
-   * @param {boolean} [fromRight] Specify iterating from right to left.
-   * @returns {number} Returns the index of the matched `NaN`, else `-1`.
-   */
-  function indexOfNaN(array, fromIndex, fromRight) {
-    var length = array.length,
-        index = fromIndex + (fromRight ? 0 : -1);
+    /**
+     * The base implementation of `_.forOwn` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Object} Returns `object`.
+     */
+    function baseForOwn(object, iteratee) {
+      return object && baseFor(object, iteratee, keys);
+    }
 
-    while ((fromRight ? index-- : ++index < length)) {
-      var other = array[index];
-      if (other !== other) {
-        return index;
-      }
+    /**
+     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Object} Returns `object`.
+     */
+    function baseForOwnRight(object, iteratee) {
+      return object && baseForRight(object, iteratee, keys);
     }
-    return -1;
-  }
 
-  /**
-   * Checks if `value` is object-like.
-   *
-   * @private
-   * @param {*} value The value to check.
-   * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
-   */
-  function isObjectLike(value) {
-    return !!value && typeof value == 'object';
-  }
+    /**
+     * The base implementation of `_.functions` which creates an array of
+     * `object` function property names filtered from `props`.
+     *
+     * @private
+     * @param {Object} object The object to inspect.
+     * @param {Array} props The property names to filter.
+     * @returns {Array} Returns the function names.
+     */
+    function baseFunctions(object, props) {
+      return arrayFilter(props, function(key) {
+        return isFunction(object[key]);
+      });
+    }
 
-  /**
-   * Used by `trimmedLeftIndex` and `trimmedRightIndex` to determine if a
-   * character code is whitespace.
-   *
-   * @private
-   * @param {number} charCode The character code to inspect.
-   * @returns {boolean} Returns `true` if `charCode` is whitespace, else `false`.
-   */
-  function isSpace(charCode) {
-    return ((charCode <= 160 && (charCode >= 9 && charCode <= 13) || charCode == 32 || charCode == 160) || charCode == 5760 || charCode == 6158 ||
-      (charCode >= 8192 && (charCode <= 8202 || charCode == 8232 || charCode == 8233 || charCode == 8239 || charCode == 8287 || charCode == 12288 || charCode == 65279)));
-  }
+    /**
+     * The base implementation of `_.get` without support for default values.
+     *
+     * @private
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path of the property to get.
+     * @returns {*} Returns the resolved value.
+     */
+    function baseGet(object, path) {
+      path = castPath(path, object);
 
-  /**
-   * Replaces all `placeholder` elements in `array` with an internal placeholder
-   * and returns an array of their indexes.
-   *
-   * @private
-   * @param {Array} array The array to modify.
-   * @param {*} placeholder The placeholder to replace.
-   * @returns {Array} Returns the new array of placeholder indexes.
-   */
-  function replaceHolders(array, placeholder) {
-    var index = -1,
-        length = array.length,
-        resIndex = -1,
-        result = [];
+      var index = 0,
+          length = path.length;
 
-    while (++index < length) {
-      if (array[index] === placeholder) {
-        array[index] = PLACEHOLDER;
-        result[++resIndex] = index;
+      while (object != null && index < length) {
+        object = object[toKey(path[index++])];
       }
+      return (index && index == length) ? object : undefined;
     }
-    return result;
-  }
-
-  /**
-   * An implementation of `_.uniq` optimized for sorted arrays without support
-   * for callback shorthands and `this` binding.
-   *
-   * @private
-   * @param {Array} array The array to inspect.
-   * @param {Function} [iteratee] The function invoked per iteration.
-   * @returns {Array} Returns the new duplicate-value-free array.
-   */
-  function sortedUniq(array, iteratee) {
-    var seen,
-        index = -1,
-        length = array.length,
-        resIndex = -1,
-        result = [];
 
-    while (++index < length) {
-      var value = array[index],
-          computed = iteratee ? iteratee(value, index, array) : value;
+    /**
+     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses
+     * `keysFunc` and `symbolsFunc` to get the enumerable property names and
+     * symbols of `object`.
+     *
+     * @private
+     * @param {Object} object The object to query.
+     * @param {Function} keysFunc The function to get the keys of `object`.
+     * @param {Function} symbolsFunc The function to get the symbols of `object`.
+     * @returns {Array} Returns the array of property names and symbols.
+     */
+    function baseGetAllKeys(object, keysFunc, symbolsFunc) {
+      var result = keysFunc(object);
+      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));
+    }
 
-      if (!index || seen !== computed) {
-        seen = computed;
-        result[++resIndex] = value;
+    /**
+     * The base implementation of `getTag` without fallbacks for buggy environments.
+     *
+     * @private
+     * @param {*} value The value to query.
+     * @returns {string} Returns the `toStringTag`.
+     */
+    function baseGetTag(value) {
+      if (value == null) {
+        return value === undefined ? undefinedTag : nullTag;
       }
+      return (symToStringTag && symToStringTag in Object(value))
+        ? getRawTag(value)
+        : objectToString(value);
     }
-    return result;
-  }
-
-  /**
-   * Used by `_.trim` and `_.trimLeft` to get the index of the first non-whitespace
-   * character of `string`.
-   *
-   * @private
-   * @param {string} string The string to inspect.
-   * @returns {number} Returns the index of the first non-whitespace character.
-   */
-  function trimmedLeftIndex(string) {
-    var index = -1,
-        length = string.length;
-
-    while (++index < length && isSpace(string.charCodeAt(index))) {}
-    return index;
-  }
-
-  /**
-   * Used by `_.trim` and `_.trimRight` to get the index of the last non-whitespace
-   * character of `string`.
-   *
-   * @private
-   * @param {string} string The string to inspect.
-   * @returns {number} Returns the index of the last non-whitespace character.
-   */
-  function trimmedRightIndex(string) {
-    var index = string.length;
-
-    while (index-- && isSpace(string.charCodeAt(index))) {}
-    return index;
-  }
-
-  /**
-   * Used by `_.unescape` to convert HTML entities to characters.
-   *
-   * @private
-   * @param {string} chr The matched character to unescape.
-   * @returns {string} Returns the unescaped character.
-   */
-  function unescapeHtmlChar(chr) {
-    return htmlUnescapes[chr];
-  }
-
-  /*--------------------------------------------------------------------------*/
-
-  /**
-   * Create a new pristine `lodash` function using the given `context` object.
-   *
-   * @static
-   * @memberOf _
-   * @category Utility
-   * @param {Object} [context=root] The context object.
-   * @returns {Function} Returns a new `lodash` function.
-   * @example
-   *
-   * _.mixin({ 'foo': _.constant('foo') });
-   *
-   * var lodash = _.runInContext();
-   * lodash.mixin({ 'bar': lodash.constant('bar') });
-   *
-   * _.isFunction(_.foo);
-   * // => true
-   * _.isFunction(_.bar);
-   * // => false
-   *
-   * lodash.isFunction(lodash.foo);
-   * // => false
-   * lodash.isFunction(lodash.bar);
-   * // => true
-   *
-   * // using `context` to mock `Date#getTime` use in `_.now`
-   * var mock = _.runInContext({
-   *   'Date': function() {
-   *     return { 'getTime': getTimeMock };
-   *   }
-   * });
-   *
-   * // or creating a suped-up `defer` in Node.js
-   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;
-   */
-  function runInContext(context) {
-    // Avoid issues with some ES3 environments that attempt to use values, named
-    // after built-in constructors like `Object`, for the creation of literals.
-    // ES5 clears this up by stating that literals must use built-in constructors.
-    // See https://es5.github.io/#x11.1.5 for more details.
-    context = context ? _.defaults(root.Object(), context, _.pick(root, contextProps)) : root;
-
-    /** Native constructor references. */
-    var Array = context.Array,
-        Date = context.Date,
-        Error = context.Error,
-        Function = context.Function,
-        Math = context.Math,
-        Number = context.Number,
-        Object = context.Object,
-        RegExp = context.RegExp,
-        String = context.String,
-        TypeError = context.TypeError;
 
-    /** Used for native method references. */
-    var arrayProto = Array.prototype,
-        objectProto = Object.prototype,
-        stringProto = String.prototype;
+    /**
+     * The base implementation of `_.gt` which doesn't coerce arguments.
+     *
+     * @private
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if `value` is greater than `other`,
+     *  else `false`.
+     */
+    function baseGt(value, other) {
+      return value > other;
+    }
 
-    /** Used to resolve the decompiled source of functions. */
-    var fnToString = Function.prototype.toString;
+    /**
+     * The base implementation of `_.has` without support for deep paths.
+     *
+     * @private
+     * @param {Object} [object] The object to query.
+     * @param {Array|string} key The key to check.
+     * @returns {boolean} Returns `true` if `key` exists, else `false`.
+     */
+    function baseHas(object, key) {
+      return object != null && hasOwnProperty.call(object, key);
+    }
 
-    /** Used to check objects for own properties. */
-    var hasOwnProperty = objectProto.hasOwnProperty;
+    /**
+     * The base implementation of `_.hasIn` without support for deep paths.
+     *
+     * @private
+     * @param {Object} [object] The object to query.
+     * @param {Array|string} key The key to check.
+     * @returns {boolean} Returns `true` if `key` exists, else `false`.
+     */
+    function baseHasIn(object, key) {
+      return object != null && key in Object(object);
+    }
 
-    /** Used to generate unique IDs. */
-    var idCounter = 0;
+    /**
+     * The base implementation of `_.inRange` which doesn't coerce arguments.
+     *
+     * @private
+     * @param {number} number The number to check.
+     * @param {number} start The start of the range.
+     * @param {number} end The end of the range.
+     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.
+     */
+    function baseInRange(number, start, end) {
+      return number >= nativeMin(start, end) && number < nativeMax(start, end);
+    }
 
     /**
-     * Used to resolve the [`toStringTag`](http://ecma-international.org/ecma-262/6.0/#sec-object.prototype.tostring)
-     * of values.
+     * The base implementation of methods like `_.intersection`, without support
+     * for iteratee shorthands, that accepts an array of arrays to inspect.
+     *
+     * @private
+     * @param {Array} arrays The arrays to inspect.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of shared values.
      */
-    var objToString = objectProto.toString;
+    function baseIntersection(arrays, iteratee, comparator) {
+      var includes = comparator ? arrayIncludesWith : arrayIncludes,
+          length = arrays[0].length,
+          othLength = arrays.length,
+          othIndex = othLength,
+          caches = Array(othLength),
+          maxLength = Infinity,
+          result = [];
 
-    /** Used to restore the original `_` reference in `_.noConflict`. */
-    var oldDash = root._;
+      while (othIndex--) {
+        var array = arrays[othIndex];
+        if (othIndex && iteratee) {
+          array = arrayMap(array, baseUnary(iteratee));
+        }
+        maxLength = nativeMin(array.length, maxLength);
+        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))
+          ? new SetCache(othIndex && array)
+          : undefined;
+      }
+      array = arrays[0];
 
-    /** Used to detect if a method is native. */
-    var reIsNative = RegExp('^' +
-      fnToString.call(hasOwnProperty).replace(/[\\^$.*+?()[\]{}|]/g, '\\$&')
-      .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
-    );
-
-    /** Native method references. */
-    var ArrayBuffer = context.ArrayBuffer,
-        clearTimeout = context.clearTimeout,
-        parseFloat = context.parseFloat,
-        pow = Math.pow,
-        propertyIsEnumerable = objectProto.propertyIsEnumerable,
-        Set = getNative(context, 'Set'),
-        setTimeout = context.setTimeout,
-        splice = arrayProto.splice,
-        Uint8Array = context.Uint8Array,
-        WeakMap = getNative(context, 'WeakMap');
-
-    /* Native method references for those with the same name as other `lodash` methods. */
-    var nativeCeil = Math.ceil,
-        nativeCreate = getNative(Object, 'create'),
-        nativeFloor = Math.floor,
-        nativeIsArray = getNative(Array, 'isArray'),
-        nativeIsFinite = context.isFinite,
-        nativeKeys = getNative(Object, 'keys'),
-        nativeMax = Math.max,
-        nativeMin = Math.min,
-        nativeNow = getNative(Date, 'now'),
-        nativeParseInt = context.parseInt,
-        nativeRandom = Math.random;
+      var index = -1,
+          seen = caches[0];
 
-    /** Used as references for `-Infinity` and `Infinity`. */
-    var NEGATIVE_INFINITY = Number.NEGATIVE_INFINITY,
-        POSITIVE_INFINITY = Number.POSITIVE_INFINITY;
+      outer:
+      while (++index < length && result.length < maxLength) {
+        var value = array[index],
+            computed = iteratee ? iteratee(value) : value;
+
+        value = (comparator || value !== 0) ? value : 0;
+        if (!(seen
+              ? cacheHas(seen, computed)
+              : includes(result, computed, comparator)
+            )) {
+          othIndex = othLength;
+          while (--othIndex) {
+            var cache = caches[othIndex];
+            if (!(cache
+                  ? cacheHas(cache, computed)
+                  : includes(arrays[othIndex], computed, comparator))
+                ) {
+              continue outer;
+            }
+          }
+          if (seen) {
+            seen.push(computed);
+          }
+          result.push(value);
+        }
+      }
+      return result;
+    }
 
-    /** Used as references for the maximum length and index of an array. */
-    var MAX_ARRAY_LENGTH = 4294967295,
-        MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,
-        HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
+    /**
+     * The base implementation of `_.invert` and `_.invertBy` which inverts
+     * `object` with values transformed by `iteratee` and set by `setter`.
+     *
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} setter The function to set `accumulator` values.
+     * @param {Function} iteratee The iteratee to transform values.
+     * @param {Object} accumulator The initial inverted object.
+     * @returns {Function} Returns `accumulator`.
+     */
+    function baseInverter(object, setter, iteratee, accumulator) {
+      baseForOwn(object, function(value, key, object) {
+        setter(accumulator, iteratee(value), key, object);
+      });
+      return accumulator;
+    }
 
     /**
-     * Used as the [maximum length](http://ecma-international.org/ecma-262/6.0/#sec-number.max_safe_integer)
-     * of an array-like value.
+     * The base implementation of `_.invoke` without support for individual
+     * method arguments.
+     *
+     * @private
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path of the method to invoke.
+     * @param {Array} args The arguments to invoke the method with.
+     * @returns {*} Returns the result of the invoked method.
      */
-    var MAX_SAFE_INTEGER = 9007199254740991;
-
-    /** Used to store function metadata. */
-    var metaMap = WeakMap && new WeakMap;
-
-    /** Used to lookup unminified function names. */
-    var realNames = {};
-
-    /*------------------------------------------------------------------------*/
+    function baseInvoke(object, path, args) {
+      path = castPath(path, object);
+      object = parent(object, path);
+      var func = object == null ? object : object[toKey(last(path))];
+      return func == null ? undefined : apply(func, object, args);
+    }
 
     /**
-     * Creates a `lodash` object which wraps `value` to enable implicit chaining.
-     * Methods that operate on and return arrays, collections, and functions can
-     * be chained together. Methods that retrieve a single value or may return a
-     * primitive value will automatically end the chain returning the unwrapped
-     * value. Explicit chaining may be enabled using `_.chain`. The execution of
-     * chained methods is lazy, that is, execution is deferred until `_#value`
-     * is implicitly or explicitly called.
-     *
-     * Lazy evaluation allows several methods to support shortcut fusion. Shortcut
-     * fusion is an optimization strategy which merge iteratee calls; this can help
-     * to avoid the creation of intermediate data structures and greatly reduce the
-     * number of iteratee executions.
-     *
-     * Chaining is supported in custom builds as long as the `_#value` method is
-     * directly or indirectly included in the build.
-     *
-     * In addition to lodash methods, wrappers have `Array` and `String` methods.
-     *
-     * The wrapper `Array` methods are:
-     * `concat`, `join`, `pop`, `push`, `reverse`, `shift`, `slice`, `sort`,
-     * `splice`, and `unshift`
-     *
-     * The wrapper `String` methods are:
-     * `replace` and `split`
+     * The base implementation of `_.isArguments`.
      *
-     * The wrapper methods that support shortcut fusion are:
-     * `compact`, `drop`, `dropRight`, `dropRightWhile`, `dropWhile`, `filter`,
-     * `first`, `initial`, `last`, `map`, `pluck`, `reject`, `rest`, `reverse`,
-     * `slice`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, `toArray`,
-     * and `where`
-     *
-     * The chainable wrapper methods are:
-     * `after`, `ary`, `assign`, `at`, `before`, `bind`, `bindAll`, `bindKey`,
-     * `callback`, `chain`, `chunk`, `commit`, `compact`, `concat`, `constant`,
-     * `countBy`, `create`, `curry`, `debounce`, `defaults`, `defaultsDeep`,
-     * `defer`, `delay`, `difference`, `drop`, `dropRight`, `dropRightWhile`,
-     * `dropWhile`, `fill`, `filter`, `flatten`, `flattenDeep`, `flow`, `flowRight`,
-     * `forEach`, `forEachRight`, `forIn`, `forInRight`, `forOwn`, `forOwnRight`,
-     * `functions`, `groupBy`, `indexBy`, `initial`, `intersection`, `invert`,
-     * `invoke`, `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`,
-     * `matchesProperty`, `memoize`, `merge`, `method`, `methodOf`, `mixin`,
-     * `modArgs`, `negate`, `omit`, `once`, `pairs`, `partial`, `partialRight`,
-     * `partition`, `pick`, `plant`, `pluck`, `property`, `propertyOf`, `pull`,
-     * `pullAt`, `push`, `range`, `rearg`, `reject`, `remove`, `rest`, `restParam`,
-     * `reverse`, `set`, `shuffle`, `slice`, `sort`, `sortBy`, `sortByAll`,
-     * `sortByOrder`, `splice`, `spread`, `take`, `takeRight`, `takeRightWhile`,
-     * `takeWhile`, `tap`, `throttle`, `thru`, `times`, `toArray`, `toPlainObject`,
-     * `transform`, `union`, `uniq`, `unshift`, `unzip`, `unzipWith`, `values`,
-     * `valuesIn`, `where`, `without`, `wrap`, `xor`, `zip`, `zipObject`, `zipWith`
-     *
-     * The wrapper methods that are **not** chainable by default are:
-     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clone`, `cloneDeep`,
-     * `deburr`, `endsWith`, `escape`, `escapeRegExp`, `every`, `find`, `findIndex`,
-     * `findKey`, `findLast`, `findLastIndex`, `findLastKey`, `findWhere`, `first`,
-     * `floor`, `get`, `gt`, `gte`, `has`, `identity`, `includes`, `indexOf`,
-     * `inRange`, `isArguments`, `isArray`, `isBoolean`, `isDate`, `isElement`,
-     * `isEmpty`, `isEqual`, `isError`, `isFinite` `isFunction`, `isMatch`,
-     * `isNative`, `isNaN`, `isNull`, `isNumber`, `isObject`, `isPlainObject`,
-     * `isRegExp`, `isString`, `isUndefined`, `isTypedArray`, `join`, `kebabCase`,
-     * `last`, `lastIndexOf`, `lt`, `lte`, `max`, `min`, `noConflict`, `noop`,
-     * `now`, `pad`, `padLeft`, `padRight`, `parseInt`, `pop`, `random`, `reduce`,
-     * `reduceRight`, `repeat`, `result`, `round`, `runInContext`, `shift`, `size`,
-     * `snakeCase`, `some`, `sortedIndex`, `sortedLastIndex`, `startCase`,
-     * `startsWith`, `sum`, `template`, `trim`, `trimLeft`, `trimRight`, `trunc`,
-     * `unescape`, `uniqueId`, `value`, and `words`
-     *
-     * The wrapper method `sample` will return a wrapped value when `n` is provided,
-     * otherwise an unwrapped value is returned.
-     *
-     * @name _
-     * @constructor
-     * @category Chain
-     * @param {*} value The value to wrap in a `lodash` instance.
-     * @returns {Object} Returns the new `lodash` wrapper instance.
-     * @example
-     *
-     * var wrapped = _([1, 2, 3]);
-     *
-     * // returns an unwrapped value
-     * wrapped.reduce(function(total, n) {
-     *   return total + n;
-     * });
-     * // => 6
-     *
-     * // returns a wrapped value
-     * var squares = wrapped.map(function(n) {
-     *   return n * n;
-     * });
-     *
-     * _.isArray(squares);
-     * // => false
-     *
-     * _.isArray(squares.value());
-     * // => true
+     * @private
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an `arguments` object,
      */
-    function lodash(value) {
-      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {
-        if (value instanceof LodashWrapper) {
-          return value;
-        }
-        if (hasOwnProperty.call(value, '__chain__') && hasOwnProperty.call(value, '__wrapped__')) {
-          return wrapperClone(value);
-        }
-      }
-      return new LodashWrapper(value);
+    function baseIsArguments(value) {
+      return isObjectLike(value) && baseGetTag(value) == argsTag;
     }
 
     /**
-     * The function whose prototype all chaining wrappers inherit from.
+     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.
      *
      * @private
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.
      */
-    function baseLodash() {
-      // No operation performed.
+    function baseIsArrayBuffer(value) {
+      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;
     }
 
     /**
-     * The base constructor for creating `lodash` wrapper objects.
+     * The base implementation of `_.isDate` without Node.js optimizations.
      *
      * @private
-     * @param {*} value The value to wrap.
-     * @param {boolean} [chainAll] Enable chaining for all wrapper methods.
-     * @param {Array} [actions=[]] Actions to peform to resolve the unwrapped value.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.
      */
-    function LodashWrapper(value, chainAll, actions) {
-      this.__wrapped__ = value;
-      this.__actions__ = actions || [];
-      this.__chain__ = !!chainAll;
+    function baseIsDate(value) {
+      return isObjectLike(value) && baseGetTag(value) == dateTag;
     }
 
     /**
-     * An object environment feature flags.
+     * The base implementation of `_.isEqual` which supports partial comparisons
+     * and tracks traversed objects.
      *
-     * @static
-     * @memberOf _
-     * @type Object
+     * @private
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @param {boolean} bitmask The bitmask flags.
+     *  1 - Unordered comparison
+     *  2 - Partial comparison
+     * @param {Function} [customizer] The function to customize comparisons.
+     * @param {Object} [stack] Tracks traversed `value` and `other` objects.
+     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
      */
-    var support = lodash.support = {};
+    function baseIsEqual(value, other, bitmask, customizer, stack) {
+      if (value === other) {
+        return true;
+      }
+      if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {
+        return value !== value && other !== other;
+      }
+      return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
+    }
 
     /**
-     * By default, the template delimiters used by lodash are like those in
-     * embedded Ruby (ERB). Change the following template settings to use
-     * alternative delimiters.
+     * A specialized version of `baseIsEqual` for arrays and objects which performs
+     * deep comparisons and tracks traversed objects enabling objects with circular
+     * references to be compared.
      *
-     * @static
-     * @memberOf _
-     * @type Object
+     * @private
+     * @param {Object} object The object to compare.
+     * @param {Object} other The other object to compare.
+     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+     * @param {Function} customizer The function to customize comparisons.
+     * @param {Function} equalFunc The function to determine equivalents of values.
+     * @param {Object} [stack] Tracks traversed `object` and `other` objects.
+     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
      */
-    lodash.templateSettings = {
-
-      /**
-       * Used to detect `data` property values to be HTML-escaped.
-       *
-       * @memberOf _.templateSettings
-       * @type RegExp
-       */
-      'escape': reEscape,
+    function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
+      var objIsArr = isArray(object),
+          othIsArr = isArray(other),
+          objTag = objIsArr ? arrayTag : getTag(object),
+          othTag = othIsArr ? arrayTag : getTag(other);
 
-      /**
-       * Used to detect code to be evaluated.
-       *
-       * @memberOf _.templateSettings
-       * @type RegExp
-       */
-      'evaluate': reEvaluate,
+      objTag = objTag == argsTag ? objectTag : objTag;
+      othTag = othTag == argsTag ? objectTag : othTag;
 
-      /**
-       * Used to detect `data` property values to inject.
-       *
-       * @memberOf _.templateSettings
-       * @type RegExp
-       */
-      'interpolate': reInterpolate,
+      var objIsObj = objTag == objectTag,
+          othIsObj = othTag == objectTag,
+          isSameTag = objTag == othTag;
 
-      /**
-       * Used to reference the data object in the template text.
-       *
-       * @memberOf _.templateSettings
-       * @type string
-       */
-      'variable': '',
+      if (isSameTag && isBuffer(object)) {
+        if (!isBuffer(other)) {
+          return false;
+        }
+        objIsArr = true;
+        objIsObj = false;
+      }
+      if (isSameTag && !objIsObj) {
+        stack || (stack = new Stack);
+        return (objIsArr || isTypedArray(object))
+          ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)
+          : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
+      }
+      if (!(bitmask & COMPARE_PARTIAL_FLAG)) {
+        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
+            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
 
-      /**
-       * Used to import variables into the compiled template.
-       *
-       * @memberOf _.templateSettings
-       * @type Object
-       */
-      'imports': {
+        if (objIsWrapped || othIsWrapped) {
+          var objUnwrapped = objIsWrapped ? object.value() : object,
+              othUnwrapped = othIsWrapped ? other.value() : other;
 
-        /**
-         * A reference to the `lodash` function.
-         *
-         * @memberOf _.templateSettings.imports
-         * @type Function
-         */
-        '_': lodash
+          stack || (stack = new Stack);
+          return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);
+        }
       }
-    };
-
-    /*------------------------------------------------------------------------*/
+      if (!isSameTag) {
+        return false;
+      }
+      stack || (stack = new Stack);
+      return equalObjects(object, other, bitmask, customizer, equalFunc, stack);
+    }
 
     /**
-     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.
+     * The base implementation of `_.isMap` without Node.js optimizations.
      *
      * @private
-     * @param {*} value The value to wrap.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a map, else `false`.
      */
-    function LazyWrapper(value) {
-      this.__wrapped__ = value;
-      this.__actions__ = [];
-      this.__dir__ = 1;
-      this.__filtered__ = false;
-      this.__iteratees__ = [];
-      this.__takeCount__ = POSITIVE_INFINITY;
-      this.__views__ = [];
+    function baseIsMap(value) {
+      return isObjectLike(value) && getTag(value) == mapTag;
     }
 
     /**
-     * Creates a clone of the lazy wrapper object.
+     * The base implementation of `_.isMatch` without support for iteratee shorthands.
      *
      * @private
-     * @name clone
-     * @memberOf LazyWrapper
-     * @returns {Object} Returns the cloned `LazyWrapper` object.
+     * @param {Object} object The object to inspect.
+     * @param {Object} source The object of property values to match.
+     * @param {Array} matchData The property names, values, and compare flags to match.
+     * @param {Function} [customizer] The function to customize comparisons.
+     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
      */
-    function lazyClone() {
-      var result = new LazyWrapper(this.__wrapped__);
-      result.__actions__ = arrayCopy(this.__actions__);
-      result.__dir__ = this.__dir__;
-      result.__filtered__ = this.__filtered__;
-      result.__iteratees__ = arrayCopy(this.__iteratees__);
-      result.__takeCount__ = this.__takeCount__;
-      result.__views__ = arrayCopy(this.__views__);
-      return result;
+    function baseIsMatch(object, source, matchData, customizer) {
+      var index = matchData.length,
+          length = index,
+          noCustomizer = !customizer;
+
+      if (object == null) {
+        return !length;
+      }
+      object = Object(object);
+      while (index--) {
+        var data = matchData[index];
+        if ((noCustomizer && data[2])
+              ? data[1] !== object[data[0]]
+              : !(data[0] in object)
+            ) {
+          return false;
+        }
+      }
+      while (++index < length) {
+        data = matchData[index];
+        var key = data[0],
+            objValue = object[key],
+            srcValue = data[1];
+
+        if (noCustomizer && data[2]) {
+          if (objValue === undefined && !(key in object)) {
+            return false;
+          }
+        } else {
+          var stack = new Stack;
+          if (customizer) {
+            var result = customizer(objValue, srcValue, key, object, source, stack);
+          }
+          if (!(result === undefined
+                ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)
+                : result
+              )) {
+            return false;
+          }
+        }
+      }
+      return true;
     }
 
     /**
-     * Reverses the direction of lazy iteration.
+     * The base implementation of `_.isNative` without bad shim checks.
      *
      * @private
-     * @name reverse
-     * @memberOf LazyWrapper
-     * @returns {Object} Returns the new reversed `LazyWrapper` object.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a native function,
+     *  else `false`.
      */
-    function lazyReverse() {
-      if (this.__filtered__) {
-        var result = new LazyWrapper(this);
-        result.__dir__ = -1;
-        result.__filtered__ = true;
-      } else {
-        result = this.clone();
-        result.__dir__ *= -1;
+    function baseIsNative(value) {
+      if (!isObject(value) || isMasked(value)) {
+        return false;
       }
-      return result;
+      var pattern = isFunction(value) ? reIsNative : reIsHostCtor;
+      return pattern.test(toSource(value));
     }
 
     /**
-     * Extracts the unwrapped value from its lazy wrapper.
+     * The base implementation of `_.isRegExp` without Node.js optimizations.
      *
      * @private
-     * @name value
-     * @memberOf LazyWrapper
-     * @returns {*} Returns the unwrapped value.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.
      */
-    function lazyValue() {
-      var array = this.__wrapped__.value(),
-          dir = this.__dir__,
-          isArr = isArray(array),
-          isRight = dir < 0,
-          arrLength = isArr ? array.length : 0,
-          view = getView(0, arrLength, this.__views__),
-          start = view.start,
-          end = view.end,
-          length = end - start,
-          index = isRight ? end : (start - 1),
-          iteratees = this.__iteratees__,
-          iterLength = iteratees.length,
-          resIndex = 0,
-          takeCount = nativeMin(length, this.__takeCount__);
-
-      if (!isArr || arrLength < LARGE_ARRAY_SIZE || (arrLength == length && takeCount == length)) {
-        return baseWrapperValue((isRight && isArr) ? array.reverse() : array, this.__actions__);
-      }
-      var result = [];
-
-      outer:
-      while (length-- && resIndex < takeCount) {
-        index += dir;
-
-        var iterIndex = -1,
-            value = array[index];
-
-        while (++iterIndex < iterLength) {
-          var data = iteratees[iterIndex],
-              iteratee = data.iteratee,
-              type = data.type,
-              computed = iteratee(value);
-
-          if (type == LAZY_MAP_FLAG) {
-            value = computed;
-          } else if (!computed) {
-            if (type == LAZY_FILTER_FLAG) {
-              continue outer;
-            } else {
-              break outer;
-            }
-          }
-        }
-        result[resIndex++] = value;
-      }
-      return result;
+    function baseIsRegExp(value) {
+      return isObjectLike(value) && baseGetTag(value) == regexpTag;
     }
 
-    /*------------------------------------------------------------------------*/
-
     /**
-     * Creates a cache object to store key/value pairs.
+     * The base implementation of `_.isSet` without Node.js optimizations.
      *
      * @private
-     * @static
-     * @name Cache
-     * @memberOf _.memoize
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a set, else `false`.
      */
-    function MapCache() {
-      this.__data__ = {};
+    function baseIsSet(value) {
+      return isObjectLike(value) && getTag(value) == setTag;
     }
 
     /**
-     * Removes `key` and its value from the cache.
+     * The base implementation of `_.isTypedArray` without Node.js optimizations.
      *
      * @private
-     * @name delete
-     * @memberOf _.memoize.Cache
-     * @param {string} key The key of the value to remove.
-     * @returns {boolean} Returns `true` if the entry was removed successfully, else `false`.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
      */
-    function mapDelete(key) {
-      return this.has(key) && delete this.__data__[key];
+    function baseIsTypedArray(value) {
+      return isObjectLike(value) &&
+        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];
     }
 
     /**
-     * Gets the cached value for `key`.
+     * The base implementation of `_.iteratee`.
      *
      * @private
-     * @name get
-     * @memberOf _.memoize.Cache
-     * @param {string} key The key of the value to get.
-     * @returns {*} Returns the cached value.
+     * @param {*} [value=_.identity] The value to convert to an iteratee.
+     * @returns {Function} Returns the iteratee.
      */
-    function mapGet(key) {
-      return key == '__proto__' ? undefined : this.__data__[key];
+    function baseIteratee(value) {
+      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
+      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
+      if (typeof value == 'function') {
+        return value;
+      }
+      if (value == null) {
+        return identity;
+      }
+      if (typeof value == 'object') {
+        return isArray(value)
+          ? baseMatchesProperty(value[0], value[1])
+          : baseMatches(value);
+      }
+      return property(value);
     }
 
     /**
-     * Checks if a cached value for `key` exists.
+     * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.
      *
      * @private
-     * @name has
-     * @memberOf _.memoize.Cache
-     * @param {string} key The key of the entry to check.
-     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names.
      */
-    function mapHas(key) {
-      return key != '__proto__' && hasOwnProperty.call(this.__data__, key);
+    function baseKeys(object) {
+      if (!isPrototype(object)) {
+        return nativeKeys(object);
+      }
+      var result = [];
+      for (var key in Object(object)) {
+        if (hasOwnProperty.call(object, key) && key != 'constructor') {
+          result.push(key);
+        }
+      }
+      return result;
     }
 
     /**
-     * Sets `value` to `key` of the cache.
+     * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.
      *
      * @private
-     * @name set
-     * @memberOf _.memoize.Cache
-     * @param {string} key The key of the value to cache.
-     * @param {*} value The value to cache.
-     * @returns {Object} Returns the cache object.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names.
      */
-    function mapSet(key, value) {
-      if (key != '__proto__') {
-        this.__data__[key] = value;
+    function baseKeysIn(object) {
+      if (!isObject(object)) {
+        return nativeKeysIn(object);
       }
-      return this;
-    }
+      var isProto = isPrototype(object),
+          result = [];
 
-    /*------------------------------------------------------------------------*/
+      for (var key in object) {
+        if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {
+          result.push(key);
+        }
+      }
+      return result;
+    }
 
     /**
-     *
-     * Creates a cache object to store unique values.
+     * The base implementation of `_.lt` which doesn't coerce arguments.
      *
      * @private
-     * @param {Array} [values] The values to cache.
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if `value` is less than `other`,
+     *  else `false`.
      */
-    function SetCache(values) {
-      var length = values ? values.length : 0;
-
-      this.data = { 'hash': nativeCreate(null), 'set': new Set };
-      while (length--) {
-        this.push(values[length]);
-      }
+    function baseLt(value, other) {
+      return value < other;
     }
 
     /**
-     * Checks if `value` is in `cache` mimicking the return signature of
-     * `_.indexOf` by returning `0` if the value is found, else `-1`.
+     * The base implementation of `_.map` without support for iteratee shorthands.
      *
      * @private
-     * @param {Object} cache The cache to search.
-     * @param {*} value The value to search for.
-     * @returns {number} Returns `0` if `value` is found, else `-1`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Array} Returns the new mapped array.
      */
-    function cacheIndexOf(cache, value) {
-      var data = cache.data,
-          result = (typeof value == 'string' || isObject(value)) ? data.set.has(value) : data.hash[value];
+    function baseMap(collection, iteratee) {
+      var index = -1,
+          result = isArrayLike(collection) ? Array(collection.length) : [];
 
-      return result ? 0 : -1;
+      baseEach(collection, function(value, key, collection) {
+        result[++index] = iteratee(value, key, collection);
+      });
+      return result;
     }
 
     /**
-     * Adds `value` to the cache.
+     * The base implementation of `_.matches` which doesn't clone `source`.
      *
      * @private
-     * @name push
-     * @memberOf SetCache
-     * @param {*} value The value to cache.
+     * @param {Object} source The object of property values to match.
+     * @returns {Function} Returns the new spec function.
      */
-    function cachePush(value) {
-      var data = this.data;
-      if (typeof value == 'string' || isObject(value)) {
-        data.set.add(value);
-      } else {
-        data.hash[value] = true;
+    function baseMatches(source) {
+      var matchData = getMatchData(source);
+      if (matchData.length == 1 && matchData[0][2]) {
+        return matchesStrictComparable(matchData[0][0], matchData[0][1]);
       }
+      return function(object) {
+        return object === source || baseIsMatch(object, source, matchData);
+      };
     }
 
-    /*------------------------------------------------------------------------*/
-
     /**
-     * Creates a new array joining `array` with `other`.
+     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.
      *
      * @private
-     * @param {Array} array The array to join.
-     * @param {Array} other The other array to join.
-     * @returns {Array} Returns the new concatenated array.
+     * @param {string} path The path of the property to get.
+     * @param {*} srcValue The value to match.
+     * @returns {Function} Returns the new spec function.
      */
-    function arrayConcat(array, other) {
-      var index = -1,
-          length = array.length,
-          othIndex = -1,
-          othLength = other.length,
-          result = Array(length + othLength);
-
-      while (++index < length) {
-        result[index] = array[index];
-      }
-      while (++othIndex < othLength) {
-        result[index++] = other[othIndex];
+    function baseMatchesProperty(path, srcValue) {
+      if (isKey(path) && isStrictComparable(srcValue)) {
+        return matchesStrictComparable(toKey(path), srcValue);
       }
-      return result;
+      return function(object) {
+        var objValue = get(object, path);
+        return (objValue === undefined && objValue === srcValue)
+          ? hasIn(object, path)
+          : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);
+      };
     }
 
     /**
-     * Copies the values of `source` to `array`.
+     * The base implementation of `_.merge` without support for multiple sources.
      *
      * @private
-     * @param {Array} source The array to copy values from.
-     * @param {Array} [array=[]] The array to copy values to.
-     * @returns {Array} Returns `array`.
+     * @param {Object} object The destination object.
+     * @param {Object} source The source object.
+     * @param {number} srcIndex The index of `source`.
+     * @param {Function} [customizer] The function to customize merged values.
+     * @param {Object} [stack] Tracks traversed source values and their merged
+     *  counterparts.
      */
-    function arrayCopy(source, array) {
-      var index = -1,
-          length = source.length;
-
-      array || (array = Array(length));
-      while (++index < length) {
-        array[index] = source[index];
+    function baseMerge(object, source, srcIndex, customizer, stack) {
+      if (object === source) {
+        return;
       }
-      return array;
+      baseFor(source, function(srcValue, key) {
+        if (isObject(srcValue)) {
+          stack || (stack = new Stack);
+          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
+        }
+        else {
+          var newValue = customizer
+            ? customizer(object[key], srcValue, (key + ''), object, source, stack)
+            : undefined;
+
+          if (newValue === undefined) {
+            newValue = srcValue;
+          }
+          assignMergeValue(object, key, newValue);
+        }
+      }, keysIn);
     }
 
     /**
-     * A specialized version of `_.forEach` for arrays without support for callback
-     * shorthands and `this` binding.
+     * A specialized version of `baseMerge` for arrays and objects which performs
+     * deep merges and tracks traversed objects enabling objects with circular
+     * references to be merged.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Array} Returns `array`.
+     * @param {Object} object The destination object.
+     * @param {Object} source The source object.
+     * @param {string} key The key of the value to merge.
+     * @param {number} srcIndex The index of `source`.
+     * @param {Function} mergeFunc The function to merge values.
+     * @param {Function} [customizer] The function to customize assigned values.
+     * @param {Object} [stack] Tracks traversed source values and their merged
+     *  counterparts.
      */
-    function arrayEach(array, iteratee) {
-      var index = -1,
-          length = array.length;
+    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {
+      var objValue = object[key],
+          srcValue = source[key],
+          stacked = stack.get(srcValue);
 
-      while (++index < length) {
-        if (iteratee(array[index], index, array) === false) {
-          break;
+      if (stacked) {
+        assignMergeValue(object, key, stacked);
+        return;
+      }
+      var newValue = customizer
+        ? customizer(objValue, srcValue, (key + ''), object, source, stack)
+        : undefined;
+
+      var isCommon = newValue === undefined;
+
+      if (isCommon) {
+        var isArr = isArray(srcValue),
+            isBuff = !isArr && isBuffer(srcValue),
+            isTyped = !isArr && !isBuff && isTypedArray(srcValue);
+
+        newValue = srcValue;
+        if (isArr || isBuff || isTyped) {
+          if (isArray(objValue)) {
+            newValue = objValue;
+          }
+          else if (isArrayLikeObject(objValue)) {
+            newValue = copyArray(objValue);
+          }
+          else if (isBuff) {
+            isCommon = false;
+            newValue = cloneBuffer(srcValue, true);
+          }
+          else if (isTyped) {
+            isCommon = false;
+            newValue = cloneTypedArray(srcValue, true);
+          }
+          else {
+            newValue = [];
+          }
+        }
+        else if (isPlainObject(srcValue) || isArguments(srcValue)) {
+          newValue = objValue;
+          if (isArguments(objValue)) {
+            newValue = toPlainObject(objValue);
+          }
+          else if (!isObject(objValue) || (srcIndex && isFunction(objValue))) {
+            newValue = initCloneObject(srcValue);
+          }
+        }
+        else {
+          isCommon = false;
         }
       }
-      return array;
+      if (isCommon) {
+        // Recursively merge objects and arrays (susceptible to call stack limits).
+        stack.set(srcValue, newValue);
+        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);
+        stack['delete'](srcValue);
+      }
+      assignMergeValue(object, key, newValue);
     }
 
     /**
-     * A specialized version of `_.forEachRight` for arrays without support for
-     * callback shorthands and `this` binding.
+     * The base implementation of `_.nth` which doesn't coerce arguments.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Array} Returns `array`.
+     * @param {Array} array The array to query.
+     * @param {number} n The index of the element to return.
+     * @returns {*} Returns the nth element of `array`.
      */
-    function arrayEachRight(array, iteratee) {
+    function baseNth(array, n) {
       var length = array.length;
-
-      while (length--) {
-        if (iteratee(array[length], length, array) === false) {
-          break;
-        }
+      if (!length) {
+        return;
       }
-      return array;
+      n += n < 0 ? length : 0;
+      return isIndex(n, length) ? array[n] : undefined;
     }
 
     /**
-     * A specialized version of `_.every` for arrays without support for callback
-     * shorthands and `this` binding.
+     * The base implementation of `_.orderBy` without param guards.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} predicate The function invoked per iteration.
-     * @returns {boolean} Returns `true` if all elements pass the predicate check,
-     *  else `false`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
+     * @param {string[]} orders The sort orders of `iteratees`.
+     * @returns {Array} Returns the new sorted array.
      */
-    function arrayEvery(array, predicate) {
-      var index = -1,
-          length = array.length;
+    function baseOrderBy(collection, iteratees, orders) {
+      var index = -1;
+      iteratees = arrayMap(iteratees.length ? iteratees : [identity], baseUnary(getIteratee()));
 
-      while (++index < length) {
-        if (!predicate(array[index], index, array)) {
-          return false;
-        }
-      }
-      return true;
+      var result = baseMap(collection, function(value, key, collection) {
+        var criteria = arrayMap(iteratees, function(iteratee) {
+          return iteratee(value);
+        });
+        return { 'criteria': criteria, 'index': ++index, 'value': value };
+      });
+
+      return baseSortBy(result, function(object, other) {
+        return compareMultiple(object, other, orders);
+      });
     }
 
     /**
-     * A specialized version of `baseExtremum` for arrays which invokes `iteratee`
-     * with one argument: (value).
+     * The base implementation of `_.pick` without support for individual
+     * property identifiers.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {Function} comparator The function used to compare values.
-     * @param {*} exValue The initial extremum value.
-     * @returns {*} Returns the extremum value.
+     * @param {Object} object The source object.
+     * @param {string[]} paths The property paths to pick.
+     * @returns {Object} Returns the new object.
+     */
+    function basePick(object, paths) {
+      return basePickBy(object, paths, function(value, path) {
+        return hasIn(object, path);
+      });
+    }
+
+    /**
+     * The base implementation of  `_.pickBy` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Object} object The source object.
+     * @param {string[]} paths The property paths to pick.
+     * @param {Function} predicate The function invoked per property.
+     * @returns {Object} Returns the new object.
      */
-    function arrayExtremum(array, iteratee, comparator, exValue) {
+    function basePickBy(object, paths, predicate) {
       var index = -1,
-          length = array.length,
-          computed = exValue,
-          result = computed;
+          length = paths.length,
+          result = {};
 
       while (++index < length) {
-        var value = array[index],
-            current = +iteratee(value);
+        var path = paths[index],
+            value = baseGet(object, path);
 
-        if (comparator(current, computed)) {
-          computed = current;
-          result = value;
+        if (predicate(value, path)) {
+          baseSet(result, castPath(path, object), value);
         }
       }
       return result;
     }
 
     /**
-     * A specialized version of `_.filter` for arrays without support for callback
-     * shorthands and `this` binding.
+     * A specialized version of `baseProperty` which supports deep paths.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} predicate The function invoked per iteration.
-     * @returns {Array} Returns the new filtered array.
+     * @param {Array|string} path The path of the property to get.
+     * @returns {Function} Returns the new accessor function.
      */
-    function arrayFilter(array, predicate) {
-      var index = -1,
-          length = array.length,
-          resIndex = -1,
-          result = [];
-
-      while (++index < length) {
-        var value = array[index];
-        if (predicate(value, index, array)) {
-          result[++resIndex] = value;
-        }
-      }
-      return result;
+    function basePropertyDeep(path) {
+      return function(object) {
+        return baseGet(object, path);
+      };
     }
 
     /**
-     * A specialized version of `_.map` for arrays without support for callback
-     * shorthands and `this` binding.
+     * The base implementation of `_.pullAllBy` without support for iteratee
+     * shorthands.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Array} Returns the new mapped array.
+     * @param {Array} array The array to modify.
+     * @param {Array} values The values to remove.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns `array`.
      */
-    function arrayMap(array, iteratee) {
-      var index = -1,
-          length = array.length,
-          result = Array(length);
+    function basePullAll(array, values, iteratee, comparator) {
+      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,
+          index = -1,
+          length = values.length,
+          seen = array;
 
+      if (array === values) {
+        values = copyArray(values);
+      }
+      if (iteratee) {
+        seen = arrayMap(array, baseUnary(iteratee));
+      }
       while (++index < length) {
-        result[index] = iteratee(array[index], index, array);
+        var fromIndex = 0,
+            value = values[index],
+            computed = iteratee ? iteratee(value) : value;
+
+        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {
+          if (seen !== array) {
+            splice.call(seen, fromIndex, 1);
+          }
+          splice.call(array, fromIndex, 1);
+        }
       }
-      return result;
+      return array;
     }
 
     /**
-     * Appends the elements of `values` to `array`.
+     * The base implementation of `_.pullAt` without support for individual
+     * indexes or capturing the removed elements.
      *
      * @private
      * @param {Array} array The array to modify.
-     * @param {Array} values The values to append.
+     * @param {number[]} indexes The indexes of elements to remove.
      * @returns {Array} Returns `array`.
      */
-    function arrayPush(array, values) {
-      var index = -1,
-          length = values.length,
-          offset = array.length;
+    function basePullAt(array, indexes) {
+      var length = array ? indexes.length : 0,
+          lastIndex = length - 1;
 
-      while (++index < length) {
-        array[offset + index] = values[index];
+      while (length--) {
+        var index = indexes[length];
+        if (length == lastIndex || index !== previous) {
+          var previous = index;
+          if (isIndex(index)) {
+            splice.call(array, index, 1);
+          } else {
+            baseUnset(array, index);
+          }
+        }
       }
       return array;
     }
 
     /**
-     * A specialized version of `_.reduce` for arrays without support for callback
-     * shorthands and `this` binding.
+     * The base implementation of `_.random` without support for returning
+     * floating-point numbers.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {*} [accumulator] The initial value.
-     * @param {boolean} [initFromArray] Specify using the first element of `array`
-     *  as the initial value.
-     * @returns {*} Returns the accumulated value.
+     * @param {number} lower The lower bound.
+     * @param {number} upper The upper bound.
+     * @returns {number} Returns the random number.
      */
-    function arrayReduce(array, iteratee, accumulator, initFromArray) {
-      var index = -1,
-          length = array.length;
-
-      if (initFromArray && length) {
-        accumulator = array[++index];
-      }
-      while (++index < length) {
-        accumulator = iteratee(accumulator, array[index], index, array);
-      }
-      return accumulator;
+    function baseRandom(lower, upper) {
+      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));
     }
 
     /**
-     * A specialized version of `_.reduceRight` for arrays without support for
-     * callback shorthands and `this` binding.
+     * The base implementation of `_.range` and `_.rangeRight` which doesn't
+     * coerce arguments.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {*} [accumulator] The initial value.
-     * @param {boolean} [initFromArray] Specify using the last element of `array`
-     *  as the initial value.
-     * @returns {*} Returns the accumulated value.
+     * @param {number} start The start of the range.
+     * @param {number} end The end of the range.
+     * @param {number} step The value to increment or decrement by.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Array} Returns the range of numbers.
      */
-    function arrayReduceRight(array, iteratee, accumulator, initFromArray) {
-      var length = array.length;
-      if (initFromArray && length) {
-        accumulator = array[--length];
-      }
+    function baseRange(start, end, step, fromRight) {
+      var index = -1,
+          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),
+          result = Array(length);
+
       while (length--) {
-        accumulator = iteratee(accumulator, array[length], length, array);
+        result[fromRight ? length : ++index] = start;
+        start += step;
       }
-      return accumulator;
+      return result;
     }
 
     /**
-     * A specialized version of `_.some` for arrays without support for callback
-     * shorthands and `this` binding.
+     * The base implementation of `_.repeat` which doesn't coerce arguments.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} predicate The function invoked per iteration.
-     * @returns {boolean} Returns `true` if any element passes the predicate check,
-     *  else `false`.
+     * @param {string} string The string to repeat.
+     * @param {number} n The number of times to repeat the string.
+     * @returns {string} Returns the repeated string.
      */
-    function arraySome(array, predicate) {
-      var index = -1,
-          length = array.length;
-
-      while (++index < length) {
-        if (predicate(array[index], index, array)) {
-          return true;
-        }
+    function baseRepeat(string, n) {
+      var result = '';
+      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {
+        return result;
       }
-      return false;
+      // Leverage the exponentiation by squaring algorithm for a faster repeat.
+      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.
+      do {
+        if (n % 2) {
+          result += string;
+        }
+        n = nativeFloor(n / 2);
+        if (n) {
+          string += string;
+        }
+      } while (n);
+
+      return result;
     }
 
     /**
-     * A specialized version of `_.sum` for arrays without support for callback
-     * shorthands and `this` binding..
+     * The base implementation of `_.rest` which doesn't validate or coerce arguments.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {number} Returns the sum.
+     * @param {Function} func The function to apply a rest parameter to.
+     * @param {number} [start=func.length-1] The start position of the rest parameter.
+     * @returns {Function} Returns the new function.
      */
-    function arraySum(array, iteratee) {
-      var length = array.length,
-          result = 0;
-
-      while (length--) {
-        result += +iteratee(array[length]) || 0;
-      }
-      return result;
+    function baseRest(func, start) {
+      return setToString(overRest(func, start, identity), func + '');
     }
 
     /**
-     * Used by `_.defaults` to customize its `_.assign` use.
+     * The base implementation of `_.sample`.
      *
      * @private
-     * @param {*} objectValue The destination object property value.
-     * @param {*} sourceValue The source object property value.
-     * @returns {*} Returns the value to assign to the destination object.
+     * @param {Array|Object} collection The collection to sample.
+     * @returns {*} Returns the random element.
      */
-    function assignDefaults(objectValue, sourceValue) {
-      return objectValue === undefined ? sourceValue : objectValue;
+    function baseSample(collection) {
+      return arraySample(values(collection));
     }
 
     /**
-     * Used by `_.template` to customize its `_.assign` use.
-     *
-     * **Note:** This function is like `assignDefaults` except that it ignores
-     * inherited property values when checking if a property is `undefined`.
+     * The base implementation of `_.sampleSize` without param guards.
      *
      * @private
-     * @param {*} objectValue The destination object property value.
-     * @param {*} sourceValue The source object property value.
-     * @param {string} key The key associated with the object and source values.
-     * @param {Object} object The destination object.
-     * @returns {*} Returns the value to assign to the destination object.
+     * @param {Array|Object} collection The collection to sample.
+     * @param {number} n The number of elements to sample.
+     * @returns {Array} Returns the random elements.
      */
-    function assignOwnDefaults(objectValue, sourceValue, key, object) {
-      return (objectValue === undefined || !hasOwnProperty.call(object, key))
-        ? sourceValue
-        : objectValue;
+    function baseSampleSize(collection, n) {
+      var array = values(collection);
+      return shuffleSelf(array, baseClamp(n, 0, array.length));
     }
 
     /**
-     * A specialized version of `_.assign` for customizing assigned values without
-     * support for argument juggling, multiple sources, and `this` binding `customizer`
-     * functions.
+     * The base implementation of `_.set`.
      *
      * @private
-     * @param {Object} object The destination object.
-     * @param {Object} source The source object.
-     * @param {Function} customizer The function to customize assigned values.
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to set.
+     * @param {*} value The value to set.
+     * @param {Function} [customizer] The function to customize path creation.
      * @returns {Object} Returns `object`.
      */
-    function assignWith(object, source, customizer) {
-      var index = -1,
-          props = keys(source),
-          length = props.length;
+    function baseSet(object, path, value, customizer) {
+      if (!isObject(object)) {
+        return object;
+      }
+      path = castPath(path, object);
 
-      while (++index < length) {
-        var key = props[index],
-            value = object[key],
-            result = customizer(value, source[key], key, object, source);
+      var index = -1,
+          length = path.length,
+          lastIndex = length - 1,
+          nested = object;
 
-        if ((result === result ? (result !== value) : (value === value)) ||
-            (value === undefined && !(key in object))) {
-          object[key] = result;
+      while (nested != null && ++index < length) {
+        var key = toKey(path[index]),
+            newValue = value;
+
+        if (index != lastIndex) {
+          var objValue = nested[key];
+          newValue = customizer ? customizer(objValue, key, nested) : undefined;
+          if (newValue === undefined) {
+            newValue = isObject(objValue)
+              ? objValue
+              : (isIndex(path[index + 1]) ? [] : {});
+          }
         }
+        assignValue(nested, key, newValue);
+        nested = nested[key];
       }
       return object;
     }
 
     /**
-     * The base implementation of `_.assign` without support for argument juggling,
-     * multiple sources, and `customizer` functions.
+     * The base implementation of `setData` without support for hot loop shorting.
      *
      * @private
-     * @param {Object} object The destination object.
-     * @param {Object} source The source object.
-     * @returns {Object} Returns `object`.
+     * @param {Function} func The function to associate metadata with.
+     * @param {*} data The metadata.
+     * @returns {Function} Returns `func`.
      */
-    function baseAssign(object, source) {
-      return source == null
-        ? object
-        : baseCopy(source, keys(source), object);
-    }
+    var baseSetData = !metaMap ? identity : function(func, data) {
+      metaMap.set(func, data);
+      return func;
+    };
 
     /**
-     * The base implementation of `_.at` without support for string collections
-     * and individual key arguments.
+     * The base implementation of `setToString` without support for hot loop shorting.
      *
      * @private
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {number[]|string[]} props The property names or indexes of elements to pick.
-     * @returns {Array} Returns the new array of picked elements.
+     * @param {Function} func The function to modify.
+     * @param {Function} string The `toString` result.
+     * @returns {Function} Returns `func`.
      */
-    function baseAt(collection, props) {
-      var index = -1,
-          isNil = collection == null,
-          isArr = !isNil && isArrayLike(collection),
-          length = isArr ? collection.length : 0,
-          propsLength = props.length,
-          result = Array(propsLength);
+    var baseSetToString = !defineProperty ? identity : function(func, string) {
+      return defineProperty(func, 'toString', {
+        'configurable': true,
+        'enumerable': false,
+        'value': constant(string),
+        'writable': true
+      });
+    };
 
-      while(++index < propsLength) {
-        var key = props[index];
-        if (isArr) {
-          result[index] = isIndex(key, length) ? collection[key] : undefined;
-        } else {
-          result[index] = isNil ? undefined : collection[key];
-        }
-      }
-      return result;
+    /**
+     * The base implementation of `_.shuffle`.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to shuffle.
+     * @returns {Array} Returns the new shuffled array.
+     */
+    function baseShuffle(collection) {
+      return shuffleSelf(values(collection));
     }
 
     /**
-     * Copies properties of `source` to `object`.
+     * The base implementation of `_.slice` without an iteratee call guard.
      *
      * @private
-     * @param {Object} source The object to copy properties from.
-     * @param {Array} props The property names to copy.
-     * @param {Object} [object={}] The object to copy properties to.
-     * @returns {Object} Returns `object`.
+     * @param {Array} array The array to slice.
+     * @param {number} [start=0] The start position.
+     * @param {number} [end=array.length] The end position.
+     * @returns {Array} Returns the slice of `array`.
      */
-    function baseCopy(source, props, object) {
-      object || (object = {});
-
+    function baseSlice(array, start, end) {
       var index = -1,
-          length = props.length;
+          length = array.length;
+
+      if (start < 0) {
+        start = -start > length ? 0 : (length + start);
+      }
+      end = end > length ? length : end;
+      if (end < 0) {
+        end += length;
+      }
+      length = start > end ? 0 : ((end - start) >>> 0);
+      start >>>= 0;
 
+      var result = Array(length);
       while (++index < length) {
-        var key = props[index];
-        object[key] = source[key];
+        result[index] = array[index + start];
       }
-      return object;
+      return result;
     }
 
     /**
-     * The base implementation of `_.callback` which supports specifying the
-     * number of arguments to provide to `func`.
+     * The base implementation of `_.some` without support for iteratee shorthands.
      *
      * @private
-     * @param {*} [func=_.identity] The value to convert to a callback.
-     * @param {*} [thisArg] The `this` binding of `func`.
-     * @param {number} [argCount] The number of arguments to provide to `func`.
-     * @returns {Function} Returns the callback.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} predicate The function invoked per iteration.
+     * @returns {boolean} Returns `true` if any element passes the predicate check,
+     *  else `false`.
      */
-    function baseCallback(func, thisArg, argCount) {
-      var type = typeof func;
-      if (type == 'function') {
-        return thisArg === undefined
-          ? func
-          : bindCallback(func, thisArg, argCount);
-      }
-      if (func == null) {
-        return identity;
-      }
-      if (type == 'object') {
-        return baseMatches(func);
-      }
-      return thisArg === undefined
-        ? property(func)
-        : baseMatchesProperty(func, thisArg);
+    function baseSome(collection, predicate) {
+      var result;
+
+      baseEach(collection, function(value, index, collection) {
+        result = predicate(value, index, collection);
+        return !result;
+      });
+      return !!result;
     }
 
     /**
-     * The base implementation of `_.clone` without support for argument juggling
-     * and `this` binding `customizer` functions.
+     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which
+     * performs a binary search of `array` to determine the index at which `value`
+     * should be inserted into `array` in order to maintain its sort order.
      *
      * @private
-     * @param {*} value The value to clone.
-     * @param {boolean} [isDeep] Specify a deep clone.
-     * @param {Function} [customizer] The function to customize cloning values.
-     * @param {string} [key] The key of `value`.
-     * @param {Object} [object] The object `value` belongs to.
-     * @param {Array} [stackA=[]] Tracks traversed source objects.
-     * @param {Array} [stackB=[]] Associates clones with source counterparts.
-     * @returns {*} Returns the cloned value.
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @param {boolean} [retHighest] Specify returning the highest qualified index.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
      */
-    function baseClone(value, isDeep, customizer, key, object, stackA, stackB) {
-      var result;
-      if (customizer) {
-        result = object ? customizer(value, key, object) : customizer(value);
-      }
-      if (result !== undefined) {
-        return result;
-      }
-      if (!isObject(value)) {
-        return value;
-      }
-      var isArr = isArray(value);
-      if (isArr) {
-        result = initCloneArray(value);
-        if (!isDeep) {
-          return arrayCopy(value, result);
-        }
-      } else {
-        var tag = objToString.call(value),
-            isFunc = tag == funcTag;
+    function baseSortedIndex(array, value, retHighest) {
+      var low = 0,
+          high = array == null ? low : array.length;
 
-        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
-          result = initCloneObject(isFunc ? {} : value);
-          if (!isDeep) {
-            return baseAssign(result, value);
-          }
-        } else {
-          return cloneableTags[tag]
-            ? initCloneByTag(value, tag, isDeep)
-            : (object ? value : {});
-        }
-      }
-      // Check for circular references and return its corresponding clone.
-      stackA || (stackA = []);
-      stackB || (stackB = []);
+      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
+        while (low < high) {
+          var mid = (low + high) >>> 1,
+              computed = array[mid];
 
-      var length = stackA.length;
-      while (length--) {
-        if (stackA[length] == value) {
-          return stackB[length];
+          if (computed !== null && !isSymbol(computed) &&
+              (retHighest ? (computed <= value) : (computed < value))) {
+            low = mid + 1;
+          } else {
+            high = mid;
+          }
         }
+        return high;
       }
-      // Add the source value to the stack of traversed objects and associate it with its clone.
-      stackA.push(value);
-      stackB.push(result);
-
-      // Recursively populate clone (susceptible to call stack limits).
-      (isArr ? arrayEach : baseForOwn)(value, function(subValue, key) {
-        result[key] = baseClone(subValue, isDeep, customizer, key, value, stackA, stackB);
-      });
-      return result;
+      return baseSortedIndexBy(array, value, identity, retHighest);
     }
 
     /**
-     * The base implementation of `_.create` without support for assigning
-     * properties to the created object.
+     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`
+     * which invokes `iteratee` for `value` and each element of `array` to compute
+     * their sort ranking. The iteratee is invoked with one argument; (value).
      *
      * @private
-     * @param {Object} prototype The object to inherit from.
-     * @returns {Object} Returns the new object.
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @param {Function} iteratee The iteratee invoked per element.
+     * @param {boolean} [retHighest] Specify returning the highest qualified index.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
      */
-    var baseCreate = (function() {
-      function object() {}
-      return function(prototype) {
-        if (isObject(prototype)) {
-          object.prototype = prototype;
-          var result = new object;
-          object.prototype = undefined;
+    function baseSortedIndexBy(array, value, iteratee, retHighest) {
+      value = iteratee(value);
+
+      var low = 0,
+          high = array == null ? 0 : array.length,
+          valIsNaN = value !== value,
+          valIsNull = value === null,
+          valIsSymbol = isSymbol(value),
+          valIsUndefined = value === undefined;
+
+      while (low < high) {
+        var mid = nativeFloor((low + high) / 2),
+            computed = iteratee(array[mid]),
+            othIsDefined = computed !== undefined,
+            othIsNull = computed === null,
+            othIsReflexive = computed === computed,
+            othIsSymbol = isSymbol(computed);
+
+        if (valIsNaN) {
+          var setLow = retHighest || othIsReflexive;
+        } else if (valIsUndefined) {
+          setLow = othIsReflexive && (retHighest || othIsDefined);
+        } else if (valIsNull) {
+          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);
+        } else if (valIsSymbol) {
+          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);
+        } else if (othIsNull || othIsSymbol) {
+          setLow = false;
+        } else {
+          setLow = retHighest ? (computed <= value) : (computed < value);
         }
-        return result || {};
-      };
-    }());
+        if (setLow) {
+          low = mid + 1;
+        } else {
+          high = mid;
+        }
+      }
+      return nativeMin(high, MAX_ARRAY_INDEX);
+    }
 
     /**
-     * The base implementation of `_.delay` and `_.defer` which accepts an index
-     * of where to slice the arguments to provide to `func`.
+     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without
+     * support for iteratee shorthands.
      *
      * @private
-     * @param {Function} func The function to delay.
-     * @param {number} wait The number of milliseconds to delay invocation.
-     * @param {Object} args The arguments provide to `func`.
-     * @returns {number} Returns the timer id.
+     * @param {Array} array The array to inspect.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @returns {Array} Returns the new duplicate free array.
      */
-    function baseDelay(func, wait, args) {
-      if (typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
+    function baseSortedUniq(array, iteratee) {
+      var index = -1,
+          length = array.length,
+          resIndex = 0,
+          result = [];
+
+      while (++index < length) {
+        var value = array[index],
+            computed = iteratee ? iteratee(value) : value;
+
+        if (!index || !eq(computed, seen)) {
+          var seen = computed;
+          result[resIndex++] = value === 0 ? 0 : value;
+        }
       }
-      return setTimeout(function() { func.apply(undefined, args); }, wait);
+      return result;
     }
 
     /**
-     * The base implementation of `_.difference` which accepts a single array
-     * of values to exclude.
+     * The base implementation of `_.toNumber` which doesn't ensure correct
+     * conversions of binary, hexadecimal, or octal string values.
      *
      * @private
-     * @param {Array} array The array to inspect.
-     * @param {Array} values The values to exclude.
-     * @returns {Array} Returns the new array of filtered values.
+     * @param {*} value The value to process.
+     * @returns {number} Returns the number.
      */
-    function baseDifference(array, values) {
-      var length = array ? array.length : 0,
-          result = [];
+    function baseToNumber(value) {
+      if (typeof value == 'number') {
+        return value;
+      }
+      if (isSymbol(value)) {
+        return NAN;
+      }
+      return +value;
+    }
 
-      if (!length) {
-        return result;
+    /**
+     * The base implementation of `_.toString` which doesn't convert nullish
+     * values to empty strings.
+     *
+     * @private
+     * @param {*} value The value to process.
+     * @returns {string} Returns the string.
+     */
+    function baseToString(value) {
+      // Exit early for strings to avoid a performance hit in some environments.
+      if (typeof value == 'string') {
+        return value;
+      }
+      if (isArray(value)) {
+        // Recursively convert values (susceptible to call stack limits).
+        return arrayMap(value, baseToString) + '';
       }
+      if (isSymbol(value)) {
+        return symbolToString ? symbolToString.call(value) : '';
+      }
+      var result = (value + '');
+      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
+    }
+
+    /**
+     * The base implementation of `_.uniqBy` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Array} array The array to inspect.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new duplicate free array.
+     */
+    function baseUniq(array, iteratee, comparator) {
       var index = -1,
-          indexOf = getIndexOf(),
-          isCommon = indexOf == baseIndexOf,
-          cache = (isCommon && values.length >= LARGE_ARRAY_SIZE) ? createCache(values) : null,
-          valuesLength = values.length;
+          includes = arrayIncludes,
+          length = array.length,
+          isCommon = true,
+          result = [],
+          seen = result;
 
-      if (cache) {
-        indexOf = cacheIndexOf;
+      if (comparator) {
+        isCommon = false;
+        includes = arrayIncludesWith;
+      }
+      else if (length >= LARGE_ARRAY_SIZE) {
+        var set = iteratee ? null : createSet(array);
+        if (set) {
+          return setToArray(set);
+        }
         isCommon = false;
-        values = cache;
+        includes = cacheHas;
+        seen = new SetCache;
+      }
+      else {
+        seen = iteratee ? [] : result;
       }
       outer:
       while (++index < length) {
-        var value = array[index];
+        var value = array[index],
+            computed = iteratee ? iteratee(value) : value;
 
-        if (isCommon && value === value) {
-          var valuesIndex = valuesLength;
-          while (valuesIndex--) {
-            if (values[valuesIndex] === value) {
+        value = (comparator || value !== 0) ? value : 0;
+        if (isCommon && computed === computed) {
+          var seenIndex = seen.length;
+          while (seenIndex--) {
+            if (seen[seenIndex] === computed) {
               continue outer;
             }
           }
+          if (iteratee) {
+            seen.push(computed);
+          }
           result.push(value);
         }
-        else if (indexOf(values, value, 0) < 0) {
+        else if (!includes(seen, computed, comparator)) {
+          if (seen !== result) {
+            seen.push(computed);
+          }
           result.push(value);
         }
       }
@@ -9772,2172 +9605,1888 @@ module.exports = ClipperLib;
     }
 
     /**
-     * The base implementation of `_.forEach` without support for callback
-     * shorthands and `this` binding.
+     * The base implementation of `_.unset`.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Array|Object|string} Returns `collection`.
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The property path to unset.
+     * @returns {boolean} Returns `true` if the property is deleted, else `false`.
      */
-    var baseEach = createBaseEach(baseForOwn);
+    function baseUnset(object, path) {
+      path = castPath(path, object);
+      object = parent(object, path);
+      return object == null || delete object[toKey(last(path))];
+    }
 
     /**
-     * The base implementation of `_.forEachRight` without support for callback
-     * shorthands and `this` binding.
+     * The base implementation of `_.update`.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Array|Object|string} Returns `collection`.
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to update.
+     * @param {Function} updater The function to produce the updated value.
+     * @param {Function} [customizer] The function to customize path creation.
+     * @returns {Object} Returns `object`.
      */
-    var baseEachRight = createBaseEach(baseForOwnRight, true);
+    function baseUpdate(object, path, updater, customizer) {
+      return baseSet(object, path, updater(baseGet(object, path)), customizer);
+    }
 
     /**
-     * The base implementation of `_.every` without support for callback
-     * shorthands and `this` binding.
+     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`
+     * without support for iteratee shorthands.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
+     * @param {Array} array The array to query.
      * @param {Function} predicate The function invoked per iteration.
-     * @returns {boolean} Returns `true` if all elements pass the predicate check,
-     *  else `false`
+     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Array} Returns the slice of `array`.
      */
-    function baseEvery(collection, predicate) {
-      var result = true;
-      baseEach(collection, function(value, index, collection) {
-        result = !!predicate(value, index, collection);
-        return result;
-      });
-      return result;
+    function baseWhile(array, predicate, isDrop, fromRight) {
+      var length = array.length,
+          index = fromRight ? length : -1;
+
+      while ((fromRight ? index-- : ++index < length) &&
+        predicate(array[index], index, array)) {}
+
+      return isDrop
+        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))
+        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));
     }
 
     /**
-     * Gets the extremum value of `collection` invoking `iteratee` for each value
-     * in `collection` to generate the criterion by which the value is ranked.
-     * The `iteratee` is invoked with three arguments: (value, index|key, collection).
+     * The base implementation of `wrapperValue` which returns the result of
+     * performing a sequence of actions on the unwrapped `value`, where each
+     * successive action is supplied the return value of the previous.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {Function} comparator The function used to compare values.
-     * @param {*} exValue The initial extremum value.
-     * @returns {*} Returns the extremum value.
+     * @param {*} value The unwrapped value.
+     * @param {Array} actions Actions to perform to resolve the unwrapped value.
+     * @returns {*} Returns the resolved value.
      */
-    function baseExtremum(collection, iteratee, comparator, exValue) {
-      var computed = exValue,
-          result = computed;
-
-      baseEach(collection, function(value, index, collection) {
-        var current = +iteratee(value, index, collection);
-        if (comparator(current, computed) || (current === exValue && current === result)) {
-          computed = current;
-          result = value;
-        }
-      });
-      return result;
+    function baseWrapperValue(value, actions) {
+      var result = value;
+      if (result instanceof LazyWrapper) {
+        result = result.value();
+      }
+      return arrayReduce(actions, function(result, action) {
+        return action.func.apply(action.thisArg, arrayPush([result], action.args));
+      }, result);
     }
 
     /**
-     * The base implementation of `_.fill` without an iteratee call guard.
+     * The base implementation of methods like `_.xor`, without support for
+     * iteratee shorthands, that accepts an array of arrays to inspect.
      *
      * @private
-     * @param {Array} array The array to fill.
-     * @param {*} value The value to fill `array` with.
-     * @param {number} [start=0] The start position.
-     * @param {number} [end=array.length] The end position.
-     * @returns {Array} Returns `array`.
+     * @param {Array} arrays The arrays to inspect.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of values.
      */
-    function baseFill(array, value, start, end) {
-      var length = array.length;
-
-      start = start == null ? 0 : (+start || 0);
-      if (start < 0) {
-        start = -start > length ? 0 : (length + start);
-      }
-      end = (end === undefined || end > length) ? length : (+end || 0);
-      if (end < 0) {
-        end += length;
+    function baseXor(arrays, iteratee, comparator) {
+      var length = arrays.length;
+      if (length < 2) {
+        return length ? baseUniq(arrays[0]) : [];
       }
-      length = start > end ? 0 : (end >>> 0);
-      start >>>= 0;
+      var index = -1,
+          result = Array(length);
 
-      while (start < length) {
-        array[start++] = value;
+      while (++index < length) {
+        var array = arrays[index],
+            othIndex = -1;
+
+        while (++othIndex < length) {
+          if (othIndex != index) {
+            result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);
+          }
+        }
       }
-      return array;
+      return baseUniq(baseFlatten(result, 1), iteratee, comparator);
     }
 
     /**
-     * The base implementation of `_.filter` without support for callback
-     * shorthands and `this` binding.
+     * This base implementation of `_.zipObject` which assigns values using `assignFunc`.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function} predicate The function invoked per iteration.
-     * @returns {Array} Returns the new filtered array.
+     * @param {Array} props The property identifiers.
+     * @param {Array} values The property values.
+     * @param {Function} assignFunc The function to assign values.
+     * @returns {Object} Returns the new object.
      */
-    function baseFilter(collection, predicate) {
-      var result = [];
-      baseEach(collection, function(value, index, collection) {
-        if (predicate(value, index, collection)) {
-          result.push(value);
-        }
-      });
+    function baseZipObject(props, values, assignFunc) {
+      var index = -1,
+          length = props.length,
+          valsLength = values.length,
+          result = {};
+
+      while (++index < length) {
+        var value = index < valsLength ? values[index] : undefined;
+        assignFunc(result, props[index], value);
+      }
       return result;
     }
 
     /**
-     * The base implementation of `_.find`, `_.findLast`, `_.findKey`, and `_.findLastKey`,
-     * without support for callback shorthands and `this` binding, which iterates
-     * over `collection` using the provided `eachFunc`.
+     * Casts `value` to an empty array if it's not an array like object.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to search.
-     * @param {Function} predicate The function invoked per iteration.
-     * @param {Function} eachFunc The function to iterate over `collection`.
-     * @param {boolean} [retKey] Specify returning the key of the found element
-     *  instead of the element itself.
-     * @returns {*} Returns the found element or its key, else `undefined`.
+     * @param {*} value The value to inspect.
+     * @returns {Array|Object} Returns the cast array-like object.
      */
-    function baseFind(collection, predicate, eachFunc, retKey) {
-      var result;
-      eachFunc(collection, function(value, key, collection) {
-        if (predicate(value, key, collection)) {
-          result = retKey ? key : value;
-          return false;
-        }
-      });
-      return result;
+    function castArrayLikeObject(value) {
+      return isArrayLikeObject(value) ? value : [];
     }
 
     /**
-     * The base implementation of `_.flatten` with added support for restricting
-     * flattening and specifying the start index.
+     * Casts `value` to `identity` if it's not a function.
      *
      * @private
-     * @param {Array} array The array to flatten.
-     * @param {boolean} [isDeep] Specify a deep flatten.
-     * @param {boolean} [isStrict] Restrict flattening to arrays-like objects.
-     * @param {Array} [result=[]] The initial result value.
-     * @returns {Array} Returns the new flattened array.
+     * @param {*} value The value to inspect.
+     * @returns {Function} Returns cast function.
      */
-    function baseFlatten(array, isDeep, isStrict, result) {
-      result || (result = []);
-
-      var index = -1,
-          length = array.length;
-
-      while (++index < length) {
-        var value = array[index];
-        if (isObjectLike(value) && isArrayLike(value) &&
-            (isStrict || isArray(value) || isArguments(value))) {
-          if (isDeep) {
-            // Recursively flatten arrays (susceptible to call stack limits).
-            baseFlatten(value, isDeep, isStrict, result);
-          } else {
-            arrayPush(result, value);
-          }
-        } else if (!isStrict) {
-          result[result.length] = value;
-        }
-      }
-      return result;
+    function castFunction(value) {
+      return typeof value == 'function' ? value : identity;
     }
 
     /**
-     * The base implementation of `baseForIn` and `baseForOwn` which iterates
-     * over `object` properties returned by `keysFunc` invoking `iteratee` for
-     * each property. Iteratee functions may exit iteration early by explicitly
-     * returning `false`.
+     * Casts `value` to a path array if it's not one.
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {Function} keysFunc The function to get the keys of `object`.
-     * @returns {Object} Returns `object`.
+     * @param {*} value The value to inspect.
+     * @param {Object} [object] The object to query keys on.
+     * @returns {Array} Returns the cast property path array.
      */
-    var baseFor = createBaseFor();
+    function castPath(value, object) {
+      if (isArray(value)) {
+        return value;
+      }
+      return isKey(value, object) ? [value] : stringToPath(toString(value));
+    }
 
     /**
-     * This function is like `baseFor` except that it iterates over properties
-     * in the opposite order.
+     * A `baseRest` alias which can be replaced with `identity` by module
+     * replacement plugins.
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {Function} keysFunc The function to get the keys of `object`.
-     * @returns {Object} Returns `object`.
+     * @type {Function}
+     * @param {Function} func The function to apply a rest parameter to.
+     * @returns {Function} Returns the new function.
      */
-    var baseForRight = createBaseFor(true);
+    var castRest = baseRest;
 
     /**
-     * The base implementation of `_.forIn` without support for callback
-     * shorthands and `this` binding.
+     * Casts `array` to a slice if it's needed.
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Object} Returns `object`.
+     * @param {Array} array The array to inspect.
+     * @param {number} start The start position.
+     * @param {number} [end=array.length] The end position.
+     * @returns {Array} Returns the cast slice.
      */
-    function baseForIn(object, iteratee) {
-      return baseFor(object, iteratee, keysIn);
+    function castSlice(array, start, end) {
+      var length = array.length;
+      end = end === undefined ? length : end;
+      return (!start && end >= length) ? array : baseSlice(array, start, end);
     }
 
     /**
-     * The base implementation of `_.forOwn` without support for callback
-     * shorthands and `this` binding.
+     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Object} Returns `object`.
+     * @param {number|Object} id The timer id or timeout object of the timer to clear.
      */
-    function baseForOwn(object, iteratee) {
-      return baseFor(object, iteratee, keys);
-    }
+    var clearTimeout = ctxClearTimeout || function(id) {
+      return root.clearTimeout(id);
+    };
 
     /**
-     * The base implementation of `_.forOwnRight` without support for callback
-     * shorthands and `this` binding.
+     * Creates a clone of  `buffer`.
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Object} Returns `object`.
+     * @param {Buffer} buffer The buffer to clone.
+     * @param {boolean} [isDeep] Specify a deep clone.
+     * @returns {Buffer} Returns the cloned buffer.
      */
-    function baseForOwnRight(object, iteratee) {
-      return baseForRight(object, iteratee, keys);
+    function cloneBuffer(buffer, isDeep) {
+      if (isDeep) {
+        return buffer.slice();
+      }
+      var length = buffer.length,
+          result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);
+
+      buffer.copy(result);
+      return result;
     }
 
     /**
-     * The base implementation of `_.functions` which creates an array of
-     * `object` function property names filtered from those provided.
+     * Creates a clone of `arrayBuffer`.
      *
      * @private
-     * @param {Object} object The object to inspect.
-     * @param {Array} props The property names to filter.
-     * @returns {Array} Returns the new array of filtered property names.
+     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.
+     * @returns {ArrayBuffer} Returns the cloned array buffer.
      */
-    function baseFunctions(object, props) {
-      var index = -1,
-          length = props.length,
-          resIndex = -1,
-          result = [];
-
-      while (++index < length) {
-        var key = props[index];
-        if (isFunction(object[key])) {
-          result[++resIndex] = key;
-        }
-      }
+    function cloneArrayBuffer(arrayBuffer) {
+      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);
+      new Uint8Array(result).set(new Uint8Array(arrayBuffer));
       return result;
     }
 
     /**
-     * The base implementation of `get` without support for string paths
-     * and default values.
+     * Creates a clone of `dataView`.
      *
      * @private
-     * @param {Object} object The object to query.
-     * @param {Array} path The path of the property to get.
-     * @param {string} [pathKey] The key representation of path.
-     * @returns {*} Returns the resolved value.
+     * @param {Object} dataView The data view to clone.
+     * @param {boolean} [isDeep] Specify a deep clone.
+     * @returns {Object} Returns the cloned data view.
      */
-    function baseGet(object, path, pathKey) {
-      if (object == null) {
-        return;
-      }
-      if (pathKey !== undefined && pathKey in toObject(object)) {
-        path = [pathKey];
-      }
-      var index = 0,
-          length = path.length;
-
-      while (object != null && index < length) {
-        object = object[path[index++]];
-      }
-      return (index && index == length) ? object : undefined;
+    function cloneDataView(dataView, isDeep) {
+      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;
+      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);
     }
 
     /**
-     * The base implementation of `_.isEqual` without support for `this` binding
-     * `customizer` functions.
+     * Creates a clone of `map`.
      *
      * @private
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @param {Function} [customizer] The function to customize comparing values.
-     * @param {boolean} [isLoose] Specify performing partial comparisons.
-     * @param {Array} [stackA] Tracks traversed `value` objects.
-     * @param {Array} [stackB] Tracks traversed `other` objects.
-     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+     * @param {Object} map The map to clone.
+     * @param {Function} cloneFunc The function to clone values.
+     * @param {boolean} [isDeep] Specify a deep clone.
+     * @returns {Object} Returns the cloned map.
      */
-    function baseIsEqual(value, other, customizer, isLoose, stackA, stackB) {
-      if (value === other) {
-        return true;
-      }
-      if (value == null || other == null || (!isObject(value) && !isObjectLike(other))) {
-        return value !== value && other !== other;
-      }
-      return baseIsEqualDeep(value, other, baseIsEqual, customizer, isLoose, stackA, stackB);
+    function cloneMap(map, isDeep, cloneFunc) {
+      var array = isDeep ? cloneFunc(mapToArray(map), CLONE_DEEP_FLAG) : mapToArray(map);
+      return arrayReduce(array, addMapEntry, new map.constructor);
     }
 
     /**
-     * A specialized version of `baseIsEqual` for arrays and objects which performs
-     * deep comparisons and tracks traversed objects enabling objects with circular
-     * references to be compared.
+     * Creates a clone of `regexp`.
      *
      * @private
-     * @param {Object} object The object to compare.
-     * @param {Object} other The other object to compare.
-     * @param {Function} equalFunc The function to determine equivalents of values.
-     * @param {Function} [customizer] The function to customize comparing objects.
-     * @param {boolean} [isLoose] Specify performing partial comparisons.
-     * @param {Array} [stackA=[]] Tracks traversed `value` objects.
-     * @param {Array} [stackB=[]] Tracks traversed `other` objects.
-     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+     * @param {Object} regexp The regexp to clone.
+     * @returns {Object} Returns the cloned regexp.
      */
-    function baseIsEqualDeep(object, other, equalFunc, customizer, isLoose, stackA, stackB) {
-      var objIsArr = isArray(object),
-          othIsArr = isArray(other),
-          objTag = arrayTag,
-          othTag = arrayTag;
-
-      if (!objIsArr) {
-        objTag = objToString.call(object);
-        if (objTag == argsTag) {
-          objTag = objectTag;
-        } else if (objTag != objectTag) {
-          objIsArr = isTypedArray(object);
-        }
-      }
-      if (!othIsArr) {
-        othTag = objToString.call(other);
-        if (othTag == argsTag) {
-          othTag = objectTag;
-        } else if (othTag != objectTag) {
-          othIsArr = isTypedArray(other);
-        }
-      }
-      var objIsObj = objTag == objectTag,
-          othIsObj = othTag == objectTag,
-          isSameTag = objTag == othTag;
-
-      if (isSameTag && !(objIsArr || objIsObj)) {
-        return equalByTag(object, other, objTag);
-      }
-      if (!isLoose) {
-        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
-            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
-
-        if (objIsWrapped || othIsWrapped) {
-          return equalFunc(objIsWrapped ? object.value() : object, othIsWrapped ? other.value() : other, customizer, isLoose, stackA, stackB);
-        }
-      }
-      if (!isSameTag) {
-        return false;
-      }
-      // Assume cyclic values are equal.
-      // For more information on detecting circular references see https://es5.github.io/#JO.
-      stackA || (stackA = []);
-      stackB || (stackB = []);
-
-      var length = stackA.length;
-      while (length--) {
-        if (stackA[length] == object) {
-          return stackB[length] == other;
-        }
-      }
-      // Add `object` and `other` to the stack of traversed objects.
-      stackA.push(object);
-      stackB.push(other);
-
-      var result = (objIsArr ? equalArrays : equalObjects)(object, other, equalFunc, customizer, isLoose, stackA, stackB);
-
-      stackA.pop();
-      stackB.pop();
-
+    function cloneRegExp(regexp) {
+      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));
+      result.lastIndex = regexp.lastIndex;
       return result;
     }
 
     /**
-     * The base implementation of `_.isMatch` without support for callback
-     * shorthands and `this` binding.
+     * Creates a clone of `set`.
      *
      * @private
-     * @param {Object} object The object to inspect.
-     * @param {Array} matchData The propery names, values, and compare flags to match.
-     * @param {Function} [customizer] The function to customize comparing objects.
-     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
+     * @param {Object} set The set to clone.
+     * @param {Function} cloneFunc The function to clone values.
+     * @param {boolean} [isDeep] Specify a deep clone.
+     * @returns {Object} Returns the cloned set.
      */
-    function baseIsMatch(object, matchData, customizer) {
-      var index = matchData.length,
-          length = index,
-          noCustomizer = !customizer;
-
-      if (object == null) {
-        return !length;
-      }
-      object = toObject(object);
-      while (index--) {
-        var data = matchData[index];
-        if ((noCustomizer && data[2])
-              ? data[1] !== object[data[0]]
-              : !(data[0] in object)
-            ) {
-          return false;
-        }
-      }
-      while (++index < length) {
-        data = matchData[index];
-        var key = data[0],
-            objValue = object[key],
-            srcValue = data[1];
-
-        if (noCustomizer && data[2]) {
-          if (objValue === undefined && !(key in object)) {
-            return false;
-          }
-        } else {
-          var result = customizer ? customizer(objValue, srcValue, key) : undefined;
-          if (!(result === undefined ? baseIsEqual(srcValue, objValue, customizer, true) : result)) {
-            return false;
-          }
-        }
-      }
-      return true;
+    function cloneSet(set, isDeep, cloneFunc) {
+      var array = isDeep ? cloneFunc(setToArray(set), CLONE_DEEP_FLAG) : setToArray(set);
+      return arrayReduce(array, addSetEntry, new set.constructor);
     }
 
     /**
-     * The base implementation of `_.map` without support for callback shorthands
-     * and `this` binding.
+     * Creates a clone of the `symbol` object.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Array} Returns the new mapped array.
+     * @param {Object} symbol The symbol object to clone.
+     * @returns {Object} Returns the cloned symbol object.
      */
-    function baseMap(collection, iteratee) {
-      var index = -1,
-          result = isArrayLike(collection) ? Array(collection.length) : [];
-
-      baseEach(collection, function(value, key, collection) {
-        result[++index] = iteratee(value, key, collection);
-      });
-      return result;
+    function cloneSymbol(symbol) {
+      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};
     }
 
     /**
-     * The base implementation of `_.matches` which does not clone `source`.
+     * Creates a clone of `typedArray`.
      *
      * @private
-     * @param {Object} source The object of property values to match.
-     * @returns {Function} Returns the new function.
+     * @param {Object} typedArray The typed array to clone.
+     * @param {boolean} [isDeep] Specify a deep clone.
+     * @returns {Object} Returns the cloned typed array.
      */
-    function baseMatches(source) {
-      var matchData = getMatchData(source);
-      if (matchData.length == 1 && matchData[0][2]) {
-        var key = matchData[0][0],
-            value = matchData[0][1];
-
-        return function(object) {
-          if (object == null) {
-            return false;
-          }
-          return object[key] === value && (value !== undefined || (key in toObject(object)));
-        };
-      }
-      return function(object) {
-        return baseIsMatch(object, matchData);
-      };
+    function cloneTypedArray(typedArray, isDeep) {
+      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;
+      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);
     }
 
     /**
-     * The base implementation of `_.matchesProperty` which does not clone `srcValue`.
+     * Compares values to sort them in ascending order.
      *
      * @private
-     * @param {string} path The path of the property to get.
-     * @param {*} srcValue The value to compare.
-     * @returns {Function} Returns the new function.
-     */
-    function baseMatchesProperty(path, srcValue) {
-      var isArr = isArray(path),
-          isCommon = isKey(path) && isStrictComparable(srcValue),
-          pathKey = (path + '');
-
-      path = toPath(path);
-      return function(object) {
-        if (object == null) {
-          return false;
-        }
-        var key = pathKey;
-        object = toObject(object);
-        if ((isArr || !isCommon) && !(key in object)) {
-          object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
-          if (object == null) {
-            return false;
-          }
-          key = last(path);
-          object = toObject(object);
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {number} Returns the sort order indicator for `value`.
+     */
+    function compareAscending(value, other) {
+      if (value !== other) {
+        var valIsDefined = value !== undefined,
+            valIsNull = value === null,
+            valIsReflexive = value === value,
+            valIsSymbol = isSymbol(value);
+
+        var othIsDefined = other !== undefined,
+            othIsNull = other === null,
+            othIsReflexive = other === other,
+            othIsSymbol = isSymbol(other);
+
+        if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||
+            (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||
+            (valIsNull && othIsDefined && othIsReflexive) ||
+            (!valIsDefined && othIsReflexive) ||
+            !valIsReflexive) {
+          return 1;
+        }
+        if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||
+            (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||
+            (othIsNull && valIsDefined && valIsReflexive) ||
+            (!othIsDefined && valIsReflexive) ||
+            !othIsReflexive) {
+          return -1;
         }
-        return object[key] === srcValue
-          ? (srcValue !== undefined || (key in object))
-          : baseIsEqual(srcValue, object[key], undefined, true);
-      };
+      }
+      return 0;
     }
 
     /**
-     * The base implementation of `_.merge` without support for argument juggling,
-     * multiple sources, and `this` binding `customizer` functions.
+     * Used by `_.orderBy` to compare multiple properties of a value to another
+     * and stable sort them.
+     *
+     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,
+     * specify an order of "desc" for descending or "asc" for ascending sort order
+     * of corresponding values.
      *
      * @private
-     * @param {Object} object The destination object.
-     * @param {Object} source The source object.
-     * @param {Function} [customizer] The function to customize merged values.
-     * @param {Array} [stackA=[]] Tracks traversed source objects.
-     * @param {Array} [stackB=[]] Associates values with source counterparts.
-     * @returns {Object} Returns `object`.
+     * @param {Object} object The object to compare.
+     * @param {Object} other The other object to compare.
+     * @param {boolean[]|string[]} orders The order to sort by for each property.
+     * @returns {number} Returns the sort order indicator for `object`.
      */
-    function baseMerge(object, source, customizer, stackA, stackB) {
-      if (!isObject(object)) {
-        return object;
-      }
-      var isSrcArr = isArrayLike(source) && (isArray(source) || isTypedArray(source)),
-          props = isSrcArr ? undefined : keys(source);
-
-      arrayEach(props || source, function(srcValue, key) {
-        if (props) {
-          key = srcValue;
-          srcValue = source[key];
-        }
-        if (isObjectLike(srcValue)) {
-          stackA || (stackA = []);
-          stackB || (stackB = []);
-          baseMergeDeep(object, source, key, baseMerge, customizer, stackA, stackB);
-        }
-        else {
-          var value = object[key],
-              result = customizer ? customizer(value, srcValue, key, object, source) : undefined,
-              isCommon = result === undefined;
+    function compareMultiple(object, other, orders) {
+      var index = -1,
+          objCriteria = object.criteria,
+          othCriteria = other.criteria,
+          length = objCriteria.length,
+          ordersLength = orders.length;
 
-          if (isCommon) {
-            result = srcValue;
-          }
-          if ((result !== undefined || (isSrcArr && !(key in object))) &&
-              (isCommon || (result === result ? (result !== value) : (value === value)))) {
-            object[key] = result;
+      while (++index < length) {
+        var result = compareAscending(objCriteria[index], othCriteria[index]);
+        if (result) {
+          if (index >= ordersLength) {
+            return result;
           }
+          var order = orders[index];
+          return result * (order == 'desc' ? -1 : 1);
         }
-      });
-      return object;
+      }
+      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
+      // that causes it, under certain circumstances, to provide the same value for
+      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247
+      // for more details.
+      //
+      // This also ensures a stable sort in V8 and other engines.
+      // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.
+      return object.index - other.index;
     }
 
     /**
-     * A specialized version of `baseMerge` for arrays and objects which performs
-     * deep merges and tracks traversed objects enabling objects with circular
-     * references to be merged.
+     * Creates an array that is the composition of partially applied arguments,
+     * placeholders, and provided arguments into a single array of arguments.
      *
      * @private
-     * @param {Object} object The destination object.
-     * @param {Object} source The source object.
-     * @param {string} key The key of the value to merge.
-     * @param {Function} mergeFunc The function to merge values.
-     * @param {Function} [customizer] The function to customize merged values.
-     * @param {Array} [stackA=[]] Tracks traversed source objects.
-     * @param {Array} [stackB=[]] Associates values with source counterparts.
-     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+     * @param {Array} args The provided arguments.
+     * @param {Array} partials The arguments to prepend to those provided.
+     * @param {Array} holders The `partials` placeholder indexes.
+     * @params {boolean} [isCurried] Specify composing for a curried function.
+     * @returns {Array} Returns the new array of composed arguments.
      */
-    function baseMergeDeep(object, source, key, mergeFunc, customizer, stackA, stackB) {
-      var length = stackA.length,
-          srcValue = source[key];
+    function composeArgs(args, partials, holders, isCurried) {
+      var argsIndex = -1,
+          argsLength = args.length,
+          holdersLength = holders.length,
+          leftIndex = -1,
+          leftLength = partials.length,
+          rangeLength = nativeMax(argsLength - holdersLength, 0),
+          result = Array(leftLength + rangeLength),
+          isUncurried = !isCurried;
 
-      while (length--) {
-        if (stackA[length] == srcValue) {
-          object[key] = stackB[length];
-          return;
-        }
+      while (++leftIndex < leftLength) {
+        result[leftIndex] = partials[leftIndex];
       }
-      var value = object[key],
-          result = customizer ? customizer(value, srcValue, key, object, source) : undefined,
-          isCommon = result === undefined;
-
-      if (isCommon) {
-        result = srcValue;
-        if (isArrayLike(srcValue) && (isArray(srcValue) || isTypedArray(srcValue))) {
-          result = isArray(value)
-            ? value
-            : (isArrayLike(value) ? arrayCopy(value) : []);
-        }
-        else if (isPlainObject(srcValue) || isArguments(srcValue)) {
-          result = isArguments(value)
-            ? toPlainObject(value)
-            : (isPlainObject(value) ? value : {});
-        }
-        else {
-          isCommon = false;
+      while (++argsIndex < holdersLength) {
+        if (isUncurried || argsIndex < argsLength) {
+          result[holders[argsIndex]] = args[argsIndex];
         }
       }
-      // Add the source value to the stack of traversed objects and associate
-      // it with its merged value.
-      stackA.push(srcValue);
-      stackB.push(result);
-
-      if (isCommon) {
-        // Recursively merge objects and arrays (susceptible to call stack limits).
-        object[key] = mergeFunc(result, srcValue, customizer, stackA, stackB);
-      } else if (result === result ? (result !== value) : (value === value)) {
-        object[key] = result;
+      while (rangeLength--) {
+        result[leftIndex++] = args[argsIndex++];
       }
+      return result;
     }
 
     /**
-     * The base implementation of `_.property` without support for deep paths.
+     * This function is like `composeArgs` except that the arguments composition
+     * is tailored for `_.partialRight`.
      *
      * @private
-     * @param {string} key The key of the property to get.
-     * @returns {Function} Returns the new function.
+     * @param {Array} args The provided arguments.
+     * @param {Array} partials The arguments to append to those provided.
+     * @param {Array} holders The `partials` placeholder indexes.
+     * @params {boolean} [isCurried] Specify composing for a curried function.
+     * @returns {Array} Returns the new array of composed arguments.
      */
-    function baseProperty(key) {
-      return function(object) {
-        return object == null ? undefined : object[key];
-      };
+    function composeArgsRight(args, partials, holders, isCurried) {
+      var argsIndex = -1,
+          argsLength = args.length,
+          holdersIndex = -1,
+          holdersLength = holders.length,
+          rightIndex = -1,
+          rightLength = partials.length,
+          rangeLength = nativeMax(argsLength - holdersLength, 0),
+          result = Array(rangeLength + rightLength),
+          isUncurried = !isCurried;
+
+      while (++argsIndex < rangeLength) {
+        result[argsIndex] = args[argsIndex];
+      }
+      var offset = argsIndex;
+      while (++rightIndex < rightLength) {
+        result[offset + rightIndex] = partials[rightIndex];
+      }
+      while (++holdersIndex < holdersLength) {
+        if (isUncurried || argsIndex < argsLength) {
+          result[offset + holders[holdersIndex]] = args[argsIndex++];
+        }
+      }
+      return result;
     }
 
     /**
-     * A specialized version of `baseProperty` which supports deep paths.
+     * Copies the values of `source` to `array`.
      *
      * @private
-     * @param {Array|string} path The path of the property to get.
-     * @returns {Function} Returns the new function.
+     * @param {Array} source The array to copy values from.
+     * @param {Array} [array=[]] The array to copy values to.
+     * @returns {Array} Returns `array`.
      */
-    function basePropertyDeep(path) {
-      var pathKey = (path + '');
-      path = toPath(path);
-      return function(object) {
-        return baseGet(object, path, pathKey);
-      };
+    function copyArray(source, array) {
+      var index = -1,
+          length = source.length;
+
+      array || (array = Array(length));
+      while (++index < length) {
+        array[index] = source[index];
+      }
+      return array;
     }
 
     /**
-     * The base implementation of `_.pullAt` without support for individual
-     * index arguments and capturing the removed elements.
+     * Copies properties of `source` to `object`.
      *
      * @private
-     * @param {Array} array The array to modify.
-     * @param {number[]} indexes The indexes of elements to remove.
-     * @returns {Array} Returns `array`.
+     * @param {Object} source The object to copy properties from.
+     * @param {Array} props The property identifiers to copy.
+     * @param {Object} [object={}] The object to copy properties to.
+     * @param {Function} [customizer] The function to customize copied values.
+     * @returns {Object} Returns `object`.
      */
-    function basePullAt(array, indexes) {
-      var length = array ? indexes.length : 0;
-      while (length--) {
-        var index = indexes[length];
-        if (index != previous && isIndex(index)) {
-          var previous = index;
-          splice.call(array, index, 1);
+    function copyObject(source, props, object, customizer) {
+      var isNew = !object;
+      object || (object = {});
+
+      var index = -1,
+          length = props.length;
+
+      while (++index < length) {
+        var key = props[index];
+
+        var newValue = customizer
+          ? customizer(object[key], source[key], key, object, source)
+          : undefined;
+
+        if (newValue === undefined) {
+          newValue = source[key];
+        }
+        if (isNew) {
+          baseAssignValue(object, key, newValue);
+        } else {
+          assignValue(object, key, newValue);
         }
       }
-      return array;
+      return object;
     }
 
     /**
-     * The base implementation of `_.random` without support for argument juggling
-     * and returning floating-point numbers.
+     * Copies own symbols of `source` to `object`.
      *
      * @private
-     * @param {number} min The minimum possible value.
-     * @param {number} max The maximum possible value.
-     * @returns {number} Returns the random number.
+     * @param {Object} source The object to copy symbols from.
+     * @param {Object} [object={}] The object to copy symbols to.
+     * @returns {Object} Returns `object`.
      */
-    function baseRandom(min, max) {
-      return min + nativeFloor(nativeRandom() * (max - min + 1));
+    function copySymbols(source, object) {
+      return copyObject(source, getSymbols(source), object);
     }
 
     /**
-     * The base implementation of `_.reduce` and `_.reduceRight` without support
-     * for callback shorthands and `this` binding, which iterates over `collection`
-     * using the provided `eachFunc`.
+     * Copies own and inherited symbols of `source` to `object`.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {*} accumulator The initial value.
-     * @param {boolean} initFromCollection Specify using the first or last element
-     *  of `collection` as the initial value.
-     * @param {Function} eachFunc The function to iterate over `collection`.
-     * @returns {*} Returns the accumulated value.
+     * @param {Object} source The object to copy symbols from.
+     * @param {Object} [object={}] The object to copy symbols to.
+     * @returns {Object} Returns `object`.
      */
-    function baseReduce(collection, iteratee, accumulator, initFromCollection, eachFunc) {
-      eachFunc(collection, function(value, index, collection) {
-        accumulator = initFromCollection
-          ? (initFromCollection = false, value)
-          : iteratee(accumulator, value, index, collection);
-      });
-      return accumulator;
+    function copySymbolsIn(source, object) {
+      return copyObject(source, getSymbolsIn(source), object);
     }
 
     /**
-     * The base implementation of `setData` without support for hot loop detection.
-     *
-     * @private
-     * @param {Function} func The function to associate metadata with.
-     * @param {*} data The metadata.
-     * @returns {Function} Returns `func`.
-     */
-    var baseSetData = !metaMap ? identity : function(func, data) {
-      metaMap.set(func, data);
-      return func;
-    };
-
-    /**
-     * The base implementation of `_.slice` without an iteratee call guard.
+     * Creates a function like `_.groupBy`.
      *
      * @private
-     * @param {Array} array The array to slice.
-     * @param {number} [start=0] The start position.
-     * @param {number} [end=array.length] The end position.
-     * @returns {Array} Returns the slice of `array`.
+     * @param {Function} setter The function to set accumulator values.
+     * @param {Function} [initializer] The accumulator object initializer.
+     * @returns {Function} Returns the new aggregator function.
      */
-    function baseSlice(array, start, end) {
-      var index = -1,
-          length = array.length;
-
-      start = start == null ? 0 : (+start || 0);
-      if (start < 0) {
-        start = -start > length ? 0 : (length + start);
-      }
-      end = (end === undefined || end > length) ? length : (+end || 0);
-      if (end < 0) {
-        end += length;
-      }
-      length = start > end ? 0 : ((end - start) >>> 0);
-      start >>>= 0;
+    function createAggregator(setter, initializer) {
+      return function(collection, iteratee) {
+        var func = isArray(collection) ? arrayAggregator : baseAggregator,
+            accumulator = initializer ? initializer() : {};
 
-      var result = Array(length);
-      while (++index < length) {
-        result[index] = array[index + start];
-      }
-      return result;
+        return func(collection, setter, getIteratee(iteratee, 2), accumulator);
+      };
     }
 
     /**
-     * The base implementation of `_.some` without support for callback shorthands
-     * and `this` binding.
+     * Creates a function like `_.assign`.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function} predicate The function invoked per iteration.
-     * @returns {boolean} Returns `true` if any element passes the predicate check,
-     *  else `false`.
+     * @param {Function} assigner The function to assign values.
+     * @returns {Function} Returns the new assigner function.
      */
-    function baseSome(collection, predicate) {
-      var result;
+    function createAssigner(assigner) {
+      return baseRest(function(object, sources) {
+        var index = -1,
+            length = sources.length,
+            customizer = length > 1 ? sources[length - 1] : undefined,
+            guard = length > 2 ? sources[2] : undefined;
 
-      baseEach(collection, function(value, index, collection) {
-        result = predicate(value, index, collection);
-        return !result;
+        customizer = (assigner.length > 3 && typeof customizer == 'function')
+          ? (length--, customizer)
+          : undefined;
+
+        if (guard && isIterateeCall(sources[0], sources[1], guard)) {
+          customizer = length < 3 ? undefined : customizer;
+          length = 1;
+        }
+        object = Object(object);
+        while (++index < length) {
+          var source = sources[index];
+          if (source) {
+            assigner(object, source, index, customizer);
+          }
+        }
+        return object;
       });
-      return !!result;
     }
 
     /**
-     * The base implementation of `_.sortBy` which uses `comparer` to define
-     * the sort order of `array` and replaces criteria objects with their
-     * corresponding values.
+     * Creates a `baseEach` or `baseEachRight` function.
      *
      * @private
-     * @param {Array} array The array to sort.
-     * @param {Function} comparer The function to define sort order.
-     * @returns {Array} Returns `array`.
+     * @param {Function} eachFunc The function to iterate over a collection.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Function} Returns the new base function.
      */
-    function baseSortBy(array, comparer) {
-      var length = array.length;
+    function createBaseEach(eachFunc, fromRight) {
+      return function(collection, iteratee) {
+        if (collection == null) {
+          return collection;
+        }
+        if (!isArrayLike(collection)) {
+          return eachFunc(collection, iteratee);
+        }
+        var length = collection.length,
+            index = fromRight ? length : -1,
+            iterable = Object(collection);
 
-      array.sort(comparer);
-      while (length--) {
-        array[length] = array[length].value;
-      }
-      return array;
+        while ((fromRight ? index-- : ++index < length)) {
+          if (iteratee(iterable[index], index, iterable) === false) {
+            break;
+          }
+        }
+        return collection;
+      };
     }
 
     /**
-     * The base implementation of `_.sortByOrder` without param guards.
+     * Creates a base function for methods like `_.forIn` and `_.forOwn`.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
-     * @param {boolean[]} orders The sort orders of `iteratees`.
-     * @returns {Array} Returns the new sorted array.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Function} Returns the new base function.
      */
-    function baseSortByOrder(collection, iteratees, orders) {
-      var callback = getCallback(),
-          index = -1;
-
-      iteratees = arrayMap(iteratees, function(iteratee) { return callback(iteratee); });
-
-      var result = baseMap(collection, function(value) {
-        var criteria = arrayMap(iteratees, function(iteratee) { return iteratee(value); });
-        return { 'criteria': criteria, 'index': ++index, 'value': value };
-      });
+    function createBaseFor(fromRight) {
+      return function(object, iteratee, keysFunc) {
+        var index = -1,
+            iterable = Object(object),
+            props = keysFunc(object),
+            length = props.length;
 
-      return baseSortBy(result, function(object, other) {
-        return compareMultiple(object, other, orders);
-      });
+        while (length--) {
+          var key = props[fromRight ? length : ++index];
+          if (iteratee(iterable[key], key, iterable) === false) {
+            break;
+          }
+        }
+        return object;
+      };
     }
 
     /**
-     * The base implementation of `_.sum` without support for callback shorthands
-     * and `this` binding.
+     * Creates a function that wraps `func` to invoke it with the optional `this`
+     * binding of `thisArg`.
      *
      * @private
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {number} Returns the sum.
+     * @param {Function} func The function to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {*} [thisArg] The `this` binding of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function baseSum(collection, iteratee) {
-      var result = 0;
-      baseEach(collection, function(value, index, collection) {
-        result += +iteratee(value, index, collection) || 0;
-      });
-      return result;
+    function createBind(func, bitmask, thisArg) {
+      var isBind = bitmask & WRAP_BIND_FLAG,
+          Ctor = createCtor(func);
+
+      function wrapper() {
+        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
+        return fn.apply(isBind ? thisArg : this, arguments);
+      }
+      return wrapper;
     }
 
     /**
-     * The base implementation of `_.uniq` without support for callback shorthands
-     * and `this` binding.
+     * Creates a function like `_.lowerFirst`.
      *
      * @private
-     * @param {Array} array The array to inspect.
-     * @param {Function} [iteratee] The function invoked per iteration.
-     * @returns {Array} Returns the new duplicate-value-free array.
+     * @param {string} methodName The name of the `String` case method to use.
+     * @returns {Function} Returns the new case function.
      */
-    function baseUniq(array, iteratee) {
-      var index = -1,
-          indexOf = getIndexOf(),
-          length = array.length,
-          isCommon = indexOf == baseIndexOf,
-          isLarge = isCommon && length >= LARGE_ARRAY_SIZE,
-          seen = isLarge ? createCache() : null,
-          result = [];
+    function createCaseFirst(methodName) {
+      return function(string) {
+        string = toString(string);
 
-      if (seen) {
-        indexOf = cacheIndexOf;
-        isCommon = false;
-      } else {
-        isLarge = false;
-        seen = iteratee ? [] : result;
-      }
-      outer:
-      while (++index < length) {
-        var value = array[index],
-            computed = iteratee ? iteratee(value, index, array) : value;
+        var strSymbols = hasUnicode(string)
+          ? stringToArray(string)
+          : undefined;
 
-        if (isCommon && value === value) {
-          var seenIndex = seen.length;
-          while (seenIndex--) {
-            if (seen[seenIndex] === computed) {
-              continue outer;
-            }
-          }
-          if (iteratee) {
-            seen.push(computed);
-          }
-          result.push(value);
-        }
-        else if (indexOf(seen, computed, 0) < 0) {
-          if (iteratee || isLarge) {
-            seen.push(computed);
-          }
-          result.push(value);
-        }
-      }
-      return result;
+        var chr = strSymbols
+          ? strSymbols[0]
+          : string.charAt(0);
+
+        var trailing = strSymbols
+          ? castSlice(strSymbols, 1).join('')
+          : string.slice(1);
+
+        return chr[methodName]() + trailing;
+      };
     }
 
     /**
-     * The base implementation of `_.values` and `_.valuesIn` which creates an
-     * array of `object` property values corresponding to the property names
-     * of `props`.
+     * Creates a function like `_.camelCase`.
      *
      * @private
-     * @param {Object} object The object to query.
-     * @param {Array} props The property names to get values for.
-     * @returns {Object} Returns the array of property values.
+     * @param {Function} callback The function to combine each word.
+     * @returns {Function} Returns the new compounder function.
      */
-    function baseValues(object, props) {
-      var index = -1,
-          length = props.length,
-          result = Array(length);
-
-      while (++index < length) {
-        result[index] = object[props[index]];
-      }
-      return result;
+    function createCompounder(callback) {
+      return function(string) {
+        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');
+      };
     }
 
     /**
-     * The base implementation of `_.dropRightWhile`, `_.dropWhile`, `_.takeRightWhile`,
-     * and `_.takeWhile` without support for callback shorthands and `this` binding.
+     * Creates a function that produces an instance of `Ctor` regardless of
+     * whether it was invoked as part of a `new` expression or by `call` or `apply`.
      *
      * @private
-     * @param {Array} array The array to query.
-     * @param {Function} predicate The function invoked per iteration.
-     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Array} Returns the slice of `array`.
+     * @param {Function} Ctor The constructor to wrap.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function baseWhile(array, predicate, isDrop, fromRight) {
-      var length = array.length,
-          index = fromRight ? length : -1;
+    function createCtor(Ctor) {
+      return function() {
+        // Use a `switch` statement to work with class constructors. See
+        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist
+        // for more details.
+        var args = arguments;
+        switch (args.length) {
+          case 0: return new Ctor;
+          case 1: return new Ctor(args[0]);
+          case 2: return new Ctor(args[0], args[1]);
+          case 3: return new Ctor(args[0], args[1], args[2]);
+          case 4: return new Ctor(args[0], args[1], args[2], args[3]);
+          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);
+          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);
+          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);
+        }
+        var thisBinding = baseCreate(Ctor.prototype),
+            result = Ctor.apply(thisBinding, args);
 
-      while ((fromRight ? index-- : ++index < length) && predicate(array[index], index, array)) {}
-      return isDrop
-        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))
-        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));
+        // Mimic the constructor's `return` behavior.
+        // See https://es5.github.io/#x13.2.2 for more details.
+        return isObject(result) ? result : thisBinding;
+      };
     }
 
     /**
-     * The base implementation of `wrapperValue` which returns the result of
-     * performing a sequence of actions on the unwrapped `value`, where each
-     * successive action is supplied the return value of the previous.
+     * Creates a function that wraps `func` to enable currying.
      *
      * @private
-     * @param {*} value The unwrapped value.
-     * @param {Array} actions Actions to peform to resolve the unwrapped value.
-     * @returns {*} Returns the resolved value.
+     * @param {Function} func The function to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {number} arity The arity of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function baseWrapperValue(value, actions) {
-      var result = value;
-      if (result instanceof LazyWrapper) {
-        result = result.value();
-      }
-      var index = -1,
-          length = actions.length;
+    function createCurry(func, bitmask, arity) {
+      var Ctor = createCtor(func);
 
-      while (++index < length) {
-        var action = actions[index];
-        result = action.func.apply(action.thisArg, arrayPush([result], action.args));
+      function wrapper() {
+        var length = arguments.length,
+            args = Array(length),
+            index = length,
+            placeholder = getHolder(wrapper);
+
+        while (index--) {
+          args[index] = arguments[index];
+        }
+        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)
+          ? []
+          : replaceHolders(args, placeholder);
+
+        length -= holders.length;
+        if (length < arity) {
+          return createRecurry(
+            func, bitmask, createHybrid, wrapper.placeholder, undefined,
+            args, holders, undefined, undefined, arity - length);
+        }
+        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
+        return apply(fn, this, args);
       }
-      return result;
+      return wrapper;
     }
 
     /**
-     * Performs a binary search of `array` to determine the index at which `value`
-     * should be inserted into `array` in order to maintain its sort order.
+     * Creates a `_.find` or `_.findLast` function.
      *
      * @private
-     * @param {Array} array The sorted array to inspect.
-     * @param {*} value The value to evaluate.
-     * @param {boolean} [retHighest] Specify returning the highest qualified index.
-     * @returns {number} Returns the index at which `value` should be inserted
-     *  into `array`.
+     * @param {Function} findIndexFunc The function to find the collection index.
+     * @returns {Function} Returns the new find function.
      */
-    function binaryIndex(array, value, retHighest) {
-      var low = 0,
-          high = array ? array.length : low;
-
-      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
-        while (low < high) {
-          var mid = (low + high) >>> 1,
-              computed = array[mid];
-
-          if ((retHighest ? (computed <= value) : (computed < value)) && computed !== null) {
-            low = mid + 1;
-          } else {
-            high = mid;
-          }
+    function createFind(findIndexFunc) {
+      return function(collection, predicate, fromIndex) {
+        var iterable = Object(collection);
+        if (!isArrayLike(collection)) {
+          var iteratee = getIteratee(predicate, 3);
+          collection = keys(collection);
+          predicate = function(key) { return iteratee(iterable[key], key, iterable); };
         }
-        return high;
-      }
-      return binaryIndexBy(array, value, identity, retHighest);
+        var index = findIndexFunc(collection, predicate, fromIndex);
+        return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;
+      };
     }
 
     /**
-     * This function is like `binaryIndex` except that it invokes `iteratee` for
-     * `value` and each element of `array` to compute their sort ranking. The
-     * iteratee is invoked with one argument; (value).
+     * Creates a `_.flow` or `_.flowRight` function.
      *
      * @private
-     * @param {Array} array The sorted array to inspect.
-     * @param {*} value The value to evaluate.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {boolean} [retHighest] Specify returning the highest qualified index.
-     * @returns {number} Returns the index at which `value` should be inserted
-     *  into `array`.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Function} Returns the new flow function.
      */
-    function binaryIndexBy(array, value, iteratee, retHighest) {
-      value = iteratee(value);
+    function createFlow(fromRight) {
+      return flatRest(function(funcs) {
+        var length = funcs.length,
+            index = length,
+            prereq = LodashWrapper.prototype.thru;
 
-      var low = 0,
-          high = array ? array.length : 0,
-          valIsNaN = value !== value,
-          valIsNull = value === null,
-          valIsUndef = value === undefined;
+        if (fromRight) {
+          funcs.reverse();
+        }
+        while (index--) {
+          var func = funcs[index];
+          if (typeof func != 'function') {
+            throw new TypeError(FUNC_ERROR_TEXT);
+          }
+          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {
+            var wrapper = new LodashWrapper([], true);
+          }
+        }
+        index = wrapper ? index : length;
+        while (++index < length) {
+          func = funcs[index];
 
-      while (low < high) {
-        var mid = nativeFloor((low + high) / 2),
-            computed = iteratee(array[mid]),
-            isDef = computed !== undefined,
-            isReflexive = computed === computed;
+          var funcName = getFuncName(func),
+              data = funcName == 'wrapper' ? getData(func) : undefined;
 
-        if (valIsNaN) {
-          var setLow = isReflexive || retHighest;
-        } else if (valIsNull) {
-          setLow = isReflexive && isDef && (retHighest || computed != null);
-        } else if (valIsUndef) {
-          setLow = isReflexive && (retHighest || isDef);
-        } else if (computed == null) {
-          setLow = false;
-        } else {
-          setLow = retHighest ? (computed <= value) : (computed < value);
-        }
-        if (setLow) {
-          low = mid + 1;
-        } else {
-          high = mid;
+          if (data && isLaziable(data[0]) &&
+                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&
+                !data[4].length && data[9] == 1
+              ) {
+            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
+          } else {
+            wrapper = (func.length == 1 && isLaziable(func))
+              ? wrapper[funcName]()
+              : wrapper.thru(func);
+          }
         }
-      }
-      return nativeMin(high, MAX_ARRAY_INDEX);
+        return function() {
+          var args = arguments,
+              value = args[0];
+
+          if (wrapper && args.length == 1 && isArray(value)) {
+            return wrapper.plant(value).value();
+          }
+          var index = 0,
+              result = length ? funcs[index].apply(this, args) : value;
+
+          while (++index < length) {
+            result = funcs[index].call(this, result);
+          }
+          return result;
+        };
+      });
     }
 
     /**
-     * A specialized version of `baseCallback` which only supports `this` binding
-     * and specifying the number of arguments to provide to `func`.
+     * Creates a function that wraps `func` to invoke it with optional `this`
+     * binding of `thisArg`, partial application, and currying.
      *
      * @private
-     * @param {Function} func The function to bind.
-     * @param {*} thisArg The `this` binding of `func`.
-     * @param {number} [argCount] The number of arguments to provide to `func`.
-     * @returns {Function} Returns the callback.
+     * @param {Function|string} func The function or method name to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {*} [thisArg] The `this` binding of `func`.
+     * @param {Array} [partials] The arguments to prepend to those provided to
+     *  the new function.
+     * @param {Array} [holders] The `partials` placeholder indexes.
+     * @param {Array} [partialsRight] The arguments to append to those provided
+     *  to the new function.
+     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.
+     * @param {Array} [argPos] The argument positions of the new function.
+     * @param {number} [ary] The arity cap of `func`.
+     * @param {number} [arity] The arity of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function bindCallback(func, thisArg, argCount) {
-      if (typeof func != 'function') {
-        return identity;
-      }
-      if (thisArg === undefined) {
-        return func;
-      }
-      switch (argCount) {
-        case 1: return function(value) {
-          return func.call(thisArg, value);
-        };
-        case 3: return function(value, index, collection) {
-          return func.call(thisArg, value, index, collection);
-        };
-        case 4: return function(accumulator, value, index, collection) {
-          return func.call(thisArg, accumulator, value, index, collection);
-        };
-        case 5: return function(value, other, key, object, source) {
-          return func.call(thisArg, value, other, key, object, source);
-        };
+    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {
+      var isAry = bitmask & WRAP_ARY_FLAG,
+          isBind = bitmask & WRAP_BIND_FLAG,
+          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,
+          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),
+          isFlip = bitmask & WRAP_FLIP_FLAG,
+          Ctor = isBindKey ? undefined : createCtor(func);
+
+      function wrapper() {
+        var length = arguments.length,
+            args = Array(length),
+            index = length;
+
+        while (index--) {
+          args[index] = arguments[index];
+        }
+        if (isCurried) {
+          var placeholder = getHolder(wrapper),
+              holdersCount = countHolders(args, placeholder);
+        }
+        if (partials) {
+          args = composeArgs(args, partials, holders, isCurried);
+        }
+        if (partialsRight) {
+          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);
+        }
+        length -= holdersCount;
+        if (isCurried && length < arity) {
+          var newHolders = replaceHolders(args, placeholder);
+          return createRecurry(
+            func, bitmask, createHybrid, wrapper.placeholder, thisArg,
+            args, newHolders, argPos, ary, arity - length
+          );
+        }
+        var thisBinding = isBind ? thisArg : this,
+            fn = isBindKey ? thisBinding[func] : func;
+
+        length = args.length;
+        if (argPos) {
+          args = reorder(args, argPos);
+        } else if (isFlip && length > 1) {
+          args.reverse();
+        }
+        if (isAry && ary < length) {
+          args.length = ary;
+        }
+        if (this && this !== root && this instanceof wrapper) {
+          fn = Ctor || createCtor(fn);
+        }
+        return fn.apply(thisBinding, args);
       }
-      return function() {
-        return func.apply(thisArg, arguments);
-      };
+      return wrapper;
     }
 
     /**
-     * Creates a clone of the given array buffer.
+     * Creates a function like `_.invertBy`.
      *
      * @private
-     * @param {ArrayBuffer} buffer The array buffer to clone.
-     * @returns {ArrayBuffer} Returns the cloned array buffer.
+     * @param {Function} setter The function to set accumulator values.
+     * @param {Function} toIteratee The function to resolve iteratees.
+     * @returns {Function} Returns the new inverter function.
      */
-    function bufferClone(buffer) {
-      var result = new ArrayBuffer(buffer.byteLength),
-          view = new Uint8Array(result);
-
-      view.set(new Uint8Array(buffer));
-      return result;
+    function createInverter(setter, toIteratee) {
+      return function(object, iteratee) {
+        return baseInverter(object, setter, toIteratee(iteratee), {});
+      };
     }
 
     /**
-     * Creates an array that is the composition of partially applied arguments,
-     * placeholders, and provided arguments into a single array of arguments.
+     * Creates a function that performs a mathematical operation on two values.
      *
      * @private
-     * @param {Array|Object} args The provided arguments.
-     * @param {Array} partials The arguments to prepend to those provided.
-     * @param {Array} holders The `partials` placeholder indexes.
-     * @returns {Array} Returns the new array of composed arguments.
+     * @param {Function} operator The function to perform the operation.
+     * @param {number} [defaultValue] The value used for `undefined` arguments.
+     * @returns {Function} Returns the new mathematical operation function.
      */
-    function composeArgs(args, partials, holders) {
-      var holdersLength = holders.length,
-          argsIndex = -1,
-          argsLength = nativeMax(args.length - holdersLength, 0),
-          leftIndex = -1,
-          leftLength = partials.length,
-          result = Array(leftLength + argsLength);
-
-      while (++leftIndex < leftLength) {
-        result[leftIndex] = partials[leftIndex];
-      }
-      while (++argsIndex < holdersLength) {
-        result[holders[argsIndex]] = args[argsIndex];
-      }
-      while (argsLength--) {
-        result[leftIndex++] = args[argsIndex++];
-      }
-      return result;
+    function createMathOperation(operator, defaultValue) {
+      return function(value, other) {
+        var result;
+        if (value === undefined && other === undefined) {
+          return defaultValue;
+        }
+        if (value !== undefined) {
+          result = value;
+        }
+        if (other !== undefined) {
+          if (result === undefined) {
+            return other;
+          }
+          if (typeof value == 'string' || typeof other == 'string') {
+            value = baseToString(value);
+            other = baseToString(other);
+          } else {
+            value = baseToNumber(value);
+            other = baseToNumber(other);
+          }
+          result = operator(value, other);
+        }
+        return result;
+      };
     }
 
     /**
-     * This function is like `composeArgs` except that the arguments composition
-     * is tailored for `_.partialRight`.
+     * Creates a function like `_.over`.
      *
      * @private
-     * @param {Array|Object} args The provided arguments.
-     * @param {Array} partials The arguments to append to those provided.
-     * @param {Array} holders The `partials` placeholder indexes.
-     * @returns {Array} Returns the new array of composed arguments.
-     */
-    function composeArgsRight(args, partials, holders) {
-      var holdersIndex = -1,
-          holdersLength = holders.length,
-          argsIndex = -1,
-          argsLength = nativeMax(args.length - holdersLength, 0),
-          rightIndex = -1,
-          rightLength = partials.length,
-          result = Array(argsLength + rightLength);
-
-      while (++argsIndex < argsLength) {
-        result[argsIndex] = args[argsIndex];
-      }
-      var offset = argsIndex;
-      while (++rightIndex < rightLength) {
-        result[offset + rightIndex] = partials[rightIndex];
-      }
-      while (++holdersIndex < holdersLength) {
-        result[offset + holders[holdersIndex]] = args[argsIndex++];
-      }
-      return result;
+     * @param {Function} arrayFunc The function to iterate over iteratees.
+     * @returns {Function} Returns the new over function.
+     */
+    function createOver(arrayFunc) {
+      return flatRest(function(iteratees) {
+        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));
+        return baseRest(function(args) {
+          var thisArg = this;
+          return arrayFunc(iteratees, function(iteratee) {
+            return apply(iteratee, thisArg, args);
+          });
+        });
+      });
     }
 
     /**
-     * Creates a `_.countBy`, `_.groupBy`, `_.indexBy`, or `_.partition` function.
+     * Creates the padding for `string` based on `length`. The `chars` string
+     * is truncated if the number of characters exceeds `length`.
      *
      * @private
-     * @param {Function} setter The function to set keys and values of the accumulator object.
-     * @param {Function} [initializer] The function to initialize the accumulator object.
-     * @returns {Function} Returns the new aggregator function.
+     * @param {number} length The padding length.
+     * @param {string} [chars=' '] The string used as padding.
+     * @returns {string} Returns the padding for `string`.
      */
-    function createAggregator(setter, initializer) {
-      return function(collection, iteratee, thisArg) {
-        var result = initializer ? initializer() : {};
-        iteratee = getCallback(iteratee, thisArg, 3);
-
-        if (isArray(collection)) {
-          var index = -1,
-              length = collection.length;
+    function createPadding(length, chars) {
+      chars = chars === undefined ? ' ' : baseToString(chars);
 
-          while (++index < length) {
-            var value = collection[index];
-            setter(result, value, iteratee(value, index, collection), collection);
-          }
-        } else {
-          baseEach(collection, function(value, key, collection) {
-            setter(result, value, iteratee(value, key, collection), collection);
-          });
-        }
-        return result;
-      };
+      var charsLength = chars.length;
+      if (charsLength < 2) {
+        return charsLength ? baseRepeat(chars, length) : chars;
+      }
+      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));
+      return hasUnicode(chars)
+        ? castSlice(stringToArray(result), 0, length).join('')
+        : result.slice(0, length);
     }
 
     /**
-     * Creates a `_.assign`, `_.defaults`, or `_.merge` function.
+     * Creates a function that wraps `func` to invoke it with the `this` binding
+     * of `thisArg` and `partials` prepended to the arguments it receives.
      *
      * @private
-     * @param {Function} assigner The function to assign values.
-     * @returns {Function} Returns the new assigner function.
+     * @param {Function} func The function to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {*} thisArg The `this` binding of `func`.
+     * @param {Array} partials The arguments to prepend to those provided to
+     *  the new function.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function createAssigner(assigner) {
-      return restParam(function(object, sources) {
-        var index = -1,
-            length = object == null ? 0 : sources.length,
-            customizer = length > 2 ? sources[length - 2] : undefined,
-            guard = length > 2 ? sources[2] : undefined,
-            thisArg = length > 1 ? sources[length - 1] : undefined;
-
-        if (typeof customizer == 'function') {
-          customizer = bindCallback(customizer, thisArg, 5);
-          length -= 2;
-        } else {
-          customizer = typeof thisArg == 'function' ? thisArg : undefined;
-          length -= (customizer ? 1 : 0);
-        }
-        if (guard && isIterateeCall(sources[0], sources[1], guard)) {
-          customizer = length < 3 ? undefined : customizer;
-          length = 1;
+    function createPartial(func, bitmask, thisArg, partials) {
+      var isBind = bitmask & WRAP_BIND_FLAG,
+          Ctor = createCtor(func);
+
+      function wrapper() {
+        var argsIndex = -1,
+            argsLength = arguments.length,
+            leftIndex = -1,
+            leftLength = partials.length,
+            args = Array(leftLength + argsLength),
+            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
+
+        while (++leftIndex < leftLength) {
+          args[leftIndex] = partials[leftIndex];
         }
-        while (++index < length) {
-          var source = sources[index];
-          if (source) {
-            assigner(object, source, customizer);
-          }
+        while (argsLength--) {
+          args[leftIndex++] = arguments[++argsIndex];
         }
-        return object;
-      });
+        return apply(fn, isBind ? thisArg : this, args);
+      }
+      return wrapper;
     }
 
     /**
-     * Creates a `baseEach` or `baseEachRight` function.
+     * Creates a `_.range` or `_.rangeRight` function.
      *
      * @private
-     * @param {Function} eachFunc The function to iterate over a collection.
      * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Function} Returns the new base function.
-     */
-    function createBaseEach(eachFunc, fromRight) {
-      return function(collection, iteratee) {
-        var length = collection ? getLength(collection) : 0;
-        if (!isLength(length)) {
-          return eachFunc(collection, iteratee);
-        }
-        var index = fromRight ? length : -1,
-            iterable = toObject(collection);
-
-        while ((fromRight ? index-- : ++index < length)) {
-          if (iteratee(iterable[index], index, iterable) === false) {
-            break;
-          }
+     * @returns {Function} Returns the new range function.
+     */
+    function createRange(fromRight) {
+      return function(start, end, step) {
+        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {
+          end = step = undefined;
+        }
+        // Ensure the sign of `-0` is preserved.
+        start = toFinite(start);
+        if (end === undefined) {
+          end = start;
+          start = 0;
+        } else {
+          end = toFinite(end);
         }
-        return collection;
+        step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);
+        return baseRange(start, end, step, fromRight);
       };
     }
 
     /**
-     * Creates a base function for `_.forIn` or `_.forInRight`.
+     * Creates a function that performs a relational operation on two values.
      *
      * @private
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Function} Returns the new base function.
+     * @param {Function} operator The function to perform the operation.
+     * @returns {Function} Returns the new relational operation function.
      */
-    function createBaseFor(fromRight) {
-      return function(object, iteratee, keysFunc) {
-        var iterable = toObject(object),
-            props = keysFunc(object),
-            length = props.length,
-            index = fromRight ? length : -1;
-
-        while ((fromRight ? index-- : ++index < length)) {
-          var key = props[index];
-          if (iteratee(iterable[key], key, iterable) === false) {
-            break;
-          }
+    function createRelationalOperation(operator) {
+      return function(value, other) {
+        if (!(typeof value == 'string' && typeof other == 'string')) {
+          value = toNumber(value);
+          other = toNumber(other);
         }
-        return object;
+        return operator(value, other);
       };
     }
 
     /**
-     * Creates a function that wraps `func` and invokes it with the `this`
-     * binding of `thisArg`.
+     * Creates a function that wraps `func` to continue currying.
      *
      * @private
-     * @param {Function} func The function to bind.
+     * @param {Function} func The function to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {Function} wrapFunc The function to create the `func` wrapper.
+     * @param {*} placeholder The placeholder value.
      * @param {*} [thisArg] The `this` binding of `func`.
-     * @returns {Function} Returns the new bound function.
+     * @param {Array} [partials] The arguments to prepend to those provided to
+     *  the new function.
+     * @param {Array} [holders] The `partials` placeholder indexes.
+     * @param {Array} [argPos] The argument positions of the new function.
+     * @param {number} [ary] The arity cap of `func`.
+     * @param {number} [arity] The arity of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function createBindWrapper(func, thisArg) {
-      var Ctor = createCtorWrapper(func);
+    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {
+      var isCurry = bitmask & WRAP_CURRY_FLAG,
+          newHolders = isCurry ? holders : undefined,
+          newHoldersRight = isCurry ? undefined : holders,
+          newPartials = isCurry ? partials : undefined,
+          newPartialsRight = isCurry ? undefined : partials;
 
-      function wrapper() {
-        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
-        return fn.apply(thisArg, arguments);
+      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);
+      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);
+
+      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {
+        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);
       }
-      return wrapper;
-    }
+      var newData = [
+        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,
+        newHoldersRight, argPos, ary, arity
+      ];
 
-    /**
-     * Creates a `Set` cache object to optimize linear searches of large arrays.
-     *
-     * @private
-     * @param {Array} [values] The values to cache.
-     * @returns {null|Object} Returns the new cache object if `Set` is supported, else `null`.
-     */
-    function createCache(values) {
-      return (nativeCreate && Set) ? new SetCache(values) : null;
+      var result = wrapFunc.apply(undefined, newData);
+      if (isLaziable(func)) {
+        setData(result, newData);
+      }
+      result.placeholder = placeholder;
+      return setWrapToString(result, func, bitmask);
     }
 
     /**
-     * Creates a function that produces compound words out of the words in a
-     * given string.
+     * Creates a function like `_.round`.
      *
      * @private
-     * @param {Function} callback The function to combine each word.
-     * @returns {Function} Returns the new compounder function.
+     * @param {string} methodName The name of the `Math` method to use when rounding.
+     * @returns {Function} Returns the new round function.
      */
-    function createCompounder(callback) {
-      return function(string) {
-        var index = -1,
-            array = words(deburr(string)),
-            length = array.length,
-            result = '';
+    function createRound(methodName) {
+      var func = Math[methodName];
+      return function(number, precision) {
+        number = toNumber(number);
+        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);
+        if (precision) {
+          // Shift with exponential notation to avoid floating-point issues.
+          // See [MDN](https://mdn.io/round#Examples) for more details.
+          var pair = (toString(number) + 'e').split('e'),
+              value = func(pair[0] + 'e' + (+pair[1] + precision));
 
-        while (++index < length) {
-          result = callback(result, array[index], index);
+          pair = (toString(value) + 'e').split('e');
+          return +(pair[0] + 'e' + (+pair[1] - precision));
         }
-        return result;
+        return func(number);
       };
     }
 
     /**
-     * Creates a function that produces an instance of `Ctor` regardless of
-     * whether it was invoked as part of a `new` expression or by `call` or `apply`.
+     * Creates a set object of `values`.
      *
      * @private
-     * @param {Function} Ctor The constructor to wrap.
-     * @returns {Function} Returns the new wrapped function.
+     * @param {Array} values The values to add to the set.
+     * @returns {Object} Returns the new set.
      */
-    function createCtorWrapper(Ctor) {
-      return function() {
-        // Use a `switch` statement to work with class constructors.
-        // See http://ecma-international.org/ecma-262/6.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist
-        // for more details.
-        var args = arguments;
-        switch (args.length) {
-          case 0: return new Ctor;
-          case 1: return new Ctor(args[0]);
-          case 2: return new Ctor(args[0], args[1]);
-          case 3: return new Ctor(args[0], args[1], args[2]);
-          case 4: return new Ctor(args[0], args[1], args[2], args[3]);
-          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);
-          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);
-          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);
-        }
-        var thisBinding = baseCreate(Ctor.prototype),
-            result = Ctor.apply(thisBinding, args);
-
-        // Mimic the constructor's `return` behavior.
-        // See https://es5.github.io/#x13.2.2 for more details.
-        return isObject(result) ? result : thisBinding;
-      };
-    }
+    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {
+      return new Set(values);
+    };
 
     /**
-     * Creates a `_.curry` or `_.curryRight` function.
+     * Creates a `_.toPairs` or `_.toPairsIn` function.
      *
      * @private
-     * @param {boolean} flag The curry bit flag.
-     * @returns {Function} Returns the new curry function.
+     * @param {Function} keysFunc The function to get the keys of a given object.
+     * @returns {Function} Returns the new pairs function.
      */
-    function createCurry(flag) {
-      function curryFunc(func, arity, guard) {
-        if (guard && isIterateeCall(func, arity, guard)) {
-          arity = undefined;
+    function createToPairs(keysFunc) {
+      return function(object) {
+        var tag = getTag(object);
+        if (tag == mapTag) {
+          return mapToArray(object);
         }
-        var result = createWrapper(func, flag, undefined, undefined, undefined, undefined, undefined, arity);
-        result.placeholder = curryFunc.placeholder;
-        return result;
-      }
-      return curryFunc;
+        if (tag == setTag) {
+          return setToPairs(object);
+        }
+        return baseToPairs(object, keysFunc(object));
+      };
     }
 
     /**
-     * Creates a `_.defaults` or `_.defaultsDeep` function.
+     * Creates a function that either curries or invokes `func` with optional
+     * `this` binding and partially applied arguments.
      *
      * @private
-     * @param {Function} assigner The function to assign values.
-     * @param {Function} customizer The function to customize assigned values.
-     * @returns {Function} Returns the new defaults function.
+     * @param {Function|string} func The function or method name to wrap.
+     * @param {number} bitmask The bitmask flags.
+     *    1 - `_.bind`
+     *    2 - `_.bindKey`
+     *    4 - `_.curry` or `_.curryRight` of a bound function
+     *    8 - `_.curry`
+     *   16 - `_.curryRight`
+     *   32 - `_.partial`
+     *   64 - `_.partialRight`
+     *  128 - `_.rearg`
+     *  256 - `_.ary`
+     *  512 - `_.flip`
+     * @param {*} [thisArg] The `this` binding of `func`.
+     * @param {Array} [partials] The arguments to be partially applied.
+     * @param {Array} [holders] The `partials` placeholder indexes.
+     * @param {Array} [argPos] The argument positions of the new function.
+     * @param {number} [ary] The arity cap of `func`.
+     * @param {number} [arity] The arity of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function createDefaults(assigner, customizer) {
-      return restParam(function(args) {
-        var object = args[0];
-        if (object == null) {
-          return object;
-        }
-        args.push(customizer);
-        return assigner.apply(undefined, args);
-      });
+    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {
+      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;
+      if (!isBindKey && typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
+      }
+      var length = partials ? partials.length : 0;
+      if (!length) {
+        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);
+        partials = holders = undefined;
+      }
+      ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);
+      arity = arity === undefined ? arity : toInteger(arity);
+      length -= holders ? holders.length : 0;
+
+      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {
+        var partialsRight = partials,
+            holdersRight = holders;
+
+        partials = holders = undefined;
+      }
+      var data = isBindKey ? undefined : getData(func);
+
+      var newData = [
+        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,
+        argPos, ary, arity
+      ];
+
+      if (data) {
+        mergeData(newData, data);
+      }
+      func = newData[0];
+      bitmask = newData[1];
+      thisArg = newData[2];
+      partials = newData[3];
+      holders = newData[4];
+      arity = newData[9] = newData[9] === undefined
+        ? (isBindKey ? 0 : func.length)
+        : nativeMax(newData[9] - length, 0);
+
+      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {
+        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);
+      }
+      if (!bitmask || bitmask == WRAP_BIND_FLAG) {
+        var result = createBind(func, bitmask, thisArg);
+      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {
+        result = createCurry(func, bitmask, arity);
+      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {
+        result = createPartial(func, bitmask, thisArg, partials);
+      } else {
+        result = createHybrid.apply(undefined, newData);
+      }
+      var setter = data ? baseSetData : setData;
+      return setWrapToString(setter(result, newData), func, bitmask);
     }
 
     /**
-     * Creates a `_.max` or `_.min` function.
+     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties
+     * of source objects to the destination object for all destination properties
+     * that resolve to `undefined`.
      *
      * @private
-     * @param {Function} comparator The function used to compare values.
-     * @param {*} exValue The initial extremum value.
-     * @returns {Function} Returns the new extremum function.
-     */
-    function createExtremum(comparator, exValue) {
-      return function(collection, iteratee, thisArg) {
-        if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
-          iteratee = undefined;
-        }
-        iteratee = getCallback(iteratee, thisArg, 3);
-        if (iteratee.length == 1) {
-          collection = isArray(collection) ? collection : toIterable(collection);
-          var result = arrayExtremum(collection, iteratee, comparator, exValue);
-          if (!(collection.length && result === exValue)) {
-            return result;
-          }
-        }
-        return baseExtremum(collection, iteratee, comparator, exValue);
-      };
+     * @param {*} objValue The destination value.
+     * @param {*} srcValue The source value.
+     * @param {string} key The key of the property to assign.
+     * @param {Object} object The parent object of `objValue`.
+     * @returns {*} Returns the value to assign.
+     */
+    function customDefaultsAssignIn(objValue, srcValue, key, object) {
+      if (objValue === undefined ||
+          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {
+        return srcValue;
+      }
+      return objValue;
     }
 
     /**
-     * Creates a `_.find` or `_.findLast` function.
+     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source
+     * objects into destination objects that are passed thru.
      *
      * @private
-     * @param {Function} eachFunc The function to iterate over a collection.
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Function} Returns the new find function.
-     */
-    function createFind(eachFunc, fromRight) {
-      return function(collection, predicate, thisArg) {
-        predicate = getCallback(predicate, thisArg, 3);
-        if (isArray(collection)) {
-          var index = baseFindIndex(collection, predicate, fromRight);
-          return index > -1 ? collection[index] : undefined;
-        }
-        return baseFind(collection, predicate, eachFunc);
-      };
+     * @param {*} objValue The destination value.
+     * @param {*} srcValue The source value.
+     * @param {string} key The key of the property to merge.
+     * @param {Object} object The parent object of `objValue`.
+     * @param {Object} source The parent object of `srcValue`.
+     * @param {Object} [stack] Tracks traversed source values and their merged
+     *  counterparts.
+     * @returns {*} Returns the value to assign.
+     */
+    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {
+      if (isObject(objValue) && isObject(srcValue)) {
+        // Recursively merge objects and arrays (susceptible to call stack limits).
+        stack.set(srcValue, objValue);
+        baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);
+        stack['delete'](srcValue);
+      }
+      return objValue;
     }
 
     /**
-     * Creates a `_.findIndex` or `_.findLastIndex` function.
+     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain
+     * objects.
      *
      * @private
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Function} Returns the new find function.
+     * @param {*} value The value to inspect.
+     * @param {string} key The key of the property to inspect.
+     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.
      */
-    function createFindIndex(fromRight) {
-      return function(array, predicate, thisArg) {
-        if (!(array && array.length)) {
-          return -1;
-        }
-        predicate = getCallback(predicate, thisArg, 3);
-        return baseFindIndex(array, predicate, fromRight);
-      };
+    function customOmitClone(value) {
+      return isPlainObject(value) ? undefined : value;
     }
 
     /**
-     * Creates a `_.findKey` or `_.findLastKey` function.
+     * A specialized version of `baseIsEqualDeep` for arrays with support for
+     * partial deep comparisons.
      *
      * @private
-     * @param {Function} objectFunc The function to iterate over an object.
-     * @returns {Function} Returns the new find function.
+     * @param {Array} array The array to compare.
+     * @param {Array} other The other array to compare.
+     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+     * @param {Function} customizer The function to customize comparisons.
+     * @param {Function} equalFunc The function to determine equivalents of values.
+     * @param {Object} stack Tracks traversed `array` and `other` objects.
+     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
      */
-    function createFindKey(objectFunc) {
-      return function(object, predicate, thisArg) {
-        predicate = getCallback(predicate, thisArg, 3);
-        return baseFind(object, predicate, objectFunc, true);
-      };
+    function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
+      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
+          arrLength = array.length,
+          othLength = other.length;
+
+      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
+        return false;
+      }
+      // Assume cyclic values are equal.
+      var stacked = stack.get(array);
+      if (stacked && stack.get(other)) {
+        return stacked == other;
+      }
+      var index = -1,
+          result = true,
+          seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;
+
+      stack.set(array, other);
+      stack.set(other, array);
+
+      // Ignore non-index properties.
+      while (++index < arrLength) {
+        var arrValue = array[index],
+            othValue = other[index];
+
+        if (customizer) {
+          var compared = isPartial
+            ? customizer(othValue, arrValue, index, other, array, stack)
+            : customizer(arrValue, othValue, index, array, other, stack);
+        }
+        if (compared !== undefined) {
+          if (compared) {
+            continue;
+          }
+          result = false;
+          break;
+        }
+        // Recursively compare arrays (susceptible to call stack limits).
+        if (seen) {
+          if (!arraySome(other, function(othValue, othIndex) {
+                if (!cacheHas(seen, othIndex) &&
+                    (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
+                  return seen.push(othIndex);
+                }
+              })) {
+            result = false;
+            break;
+          }
+        } else if (!(
+              arrValue === othValue ||
+                equalFunc(arrValue, othValue, bitmask, customizer, stack)
+            )) {
+          result = false;
+          break;
+        }
+      }
+      stack['delete'](array);
+      stack['delete'](other);
+      return result;
     }
 
     /**
-     * Creates a `_.flow` or `_.flowRight` function.
+     * A specialized version of `baseIsEqualDeep` for comparing objects of
+     * the same `toStringTag`.
+     *
+     * **Note:** This function only supports comparing values with tags of
+     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
      *
      * @private
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Function} Returns the new flow function.
+     * @param {Object} object The object to compare.
+     * @param {Object} other The other object to compare.
+     * @param {string} tag The `toStringTag` of the objects to compare.
+     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+     * @param {Function} customizer The function to customize comparisons.
+     * @param {Function} equalFunc The function to determine equivalents of values.
+     * @param {Object} stack Tracks traversed `object` and `other` objects.
+     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
      */
-    function createFlow(fromRight) {
-      return function() {
-        var wrapper,
-            length = arguments.length,
-            index = fromRight ? length : -1,
-            leftIndex = 0,
-            funcs = Array(length);
-
-        while ((fromRight ? index-- : ++index < length)) {
-          var func = funcs[leftIndex++] = arguments[index];
-          if (typeof func != 'function') {
-            throw new TypeError(FUNC_ERROR_TEXT);
+    function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
+      switch (tag) {
+        case dataViewTag:
+          if ((object.byteLength != other.byteLength) ||
+              (object.byteOffset != other.byteOffset)) {
+            return false;
           }
-          if (!wrapper && LodashWrapper.prototype.thru && getFuncName(func) == 'wrapper') {
-            wrapper = new LodashWrapper([], true);
+          object = object.buffer;
+          other = other.buffer;
+
+        case arrayBufferTag:
+          if ((object.byteLength != other.byteLength) ||
+              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
+            return false;
           }
-        }
-        index = wrapper ? -1 : length;
-        while (++index < length) {
-          func = funcs[index];
+          return true;
 
-          var funcName = getFuncName(func),
-              data = funcName == 'wrapper' ? getData(func) : undefined;
+        case boolTag:
+        case dateTag:
+        case numberTag:
+          // Coerce booleans to `1` or `0` and dates to milliseconds.
+          // Invalid dates are coerced to `NaN`.
+          return eq(+object, +other);
 
-          if (data && isLaziable(data[0]) && data[1] == (ARY_FLAG | CURRY_FLAG | PARTIAL_FLAG | REARG_FLAG) && !data[4].length && data[9] == 1) {
-            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
-          } else {
-            wrapper = (func.length == 1 && isLaziable(func)) ? wrapper[funcName]() : wrapper.thru(func);
-          }
-        }
-        return function() {
-          var args = arguments,
-              value = args[0];
+        case errorTag:
+          return object.name == other.name && object.message == other.message;
 
-          if (wrapper && args.length == 1 && isArray(value) && value.length >= LARGE_ARRAY_SIZE) {
-            return wrapper.plant(value).value();
-          }
-          var index = 0,
-              result = length ? funcs[index].apply(this, args) : value;
+        case regexpTag:
+        case stringTag:
+          // Coerce regexes to strings and treat strings, primitives and objects,
+          // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring
+          // for more details.
+          return object == (other + '');
 
-          while (++index < length) {
-            result = funcs[index].call(this, result);
+        case mapTag:
+          var convert = mapToArray;
+
+        case setTag:
+          var isPartial = bitmask & COMPARE_PARTIAL_FLAG;
+          convert || (convert = setToArray);
+
+          if (object.size != other.size && !isPartial) {
+            return false;
+          }
+          // Assume cyclic values are equal.
+          var stacked = stack.get(object);
+          if (stacked) {
+            return stacked == other;
           }
+          bitmask |= COMPARE_UNORDERED_FLAG;
+
+          // Recursively compare objects (susceptible to call stack limits).
+          stack.set(object, other);
+          var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);
+          stack['delete'](object);
           return result;
-        };
-      };
-    }
 
-    /**
-     * Creates a function for `_.forEach` or `_.forEachRight`.
-     *
-     * @private
-     * @param {Function} arrayFunc The function to iterate over an array.
-     * @param {Function} eachFunc The function to iterate over a collection.
-     * @returns {Function} Returns the new each function.
-     */
-    function createForEach(arrayFunc, eachFunc) {
-      return function(collection, iteratee, thisArg) {
-        return (typeof iteratee == 'function' && thisArg === undefined && isArray(collection))
-          ? arrayFunc(collection, iteratee)
-          : eachFunc(collection, bindCallback(iteratee, thisArg, 3));
-      };
+        case symbolTag:
+          if (symbolValueOf) {
+            return symbolValueOf.call(object) == symbolValueOf.call(other);
+          }
+      }
+      return false;
     }
 
     /**
-     * Creates a function for `_.forIn` or `_.forInRight`.
+     * A specialized version of `baseIsEqualDeep` for objects with support for
+     * partial deep comparisons.
      *
      * @private
-     * @param {Function} objectFunc The function to iterate over an object.
-     * @returns {Function} Returns the new each function.
+     * @param {Object} object The object to compare.
+     * @param {Object} other The other object to compare.
+     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+     * @param {Function} customizer The function to customize comparisons.
+     * @param {Function} equalFunc The function to determine equivalents of values.
+     * @param {Object} stack Tracks traversed `object` and `other` objects.
+     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
      */
-    function createForIn(objectFunc) {
-      return function(object, iteratee, thisArg) {
-        if (typeof iteratee != 'function' || thisArg !== undefined) {
-          iteratee = bindCallback(iteratee, thisArg, 3);
+    function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
+      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
+          objProps = getAllKeys(object),
+          objLength = objProps.length,
+          othProps = getAllKeys(other),
+          othLength = othProps.length;
+
+      if (objLength != othLength && !isPartial) {
+        return false;
+      }
+      var index = objLength;
+      while (index--) {
+        var key = objProps[index];
+        if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {
+          return false;
         }
-        return objectFunc(object, iteratee, keysIn);
-      };
+      }
+      // Assume cyclic values are equal.
+      var stacked = stack.get(object);
+      if (stacked && stack.get(other)) {
+        return stacked == other;
+      }
+      var result = true;
+      stack.set(object, other);
+      stack.set(other, object);
+
+      var skipCtor = isPartial;
+      while (++index < objLength) {
+        key = objProps[index];
+        var objValue = object[key],
+            othValue = other[key];
+
+        if (customizer) {
+          var compared = isPartial
+            ? customizer(othValue, objValue, key, other, object, stack)
+            : customizer(objValue, othValue, key, object, other, stack);
+        }
+        // Recursively compare objects (susceptible to call stack limits).
+        if (!(compared === undefined
+              ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))
+              : compared
+            )) {
+          result = false;
+          break;
+        }
+        skipCtor || (skipCtor = key == 'constructor');
+      }
+      if (result && !skipCtor) {
+        var objCtor = object.constructor,
+            othCtor = other.constructor;
+
+        // Non `Object` object instances with different constructors are not equal.
+        if (objCtor != othCtor &&
+            ('constructor' in object && 'constructor' in other) &&
+            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
+              typeof othCtor == 'function' && othCtor instanceof othCtor)) {
+          result = false;
+        }
+      }
+      stack['delete'](object);
+      stack['delete'](other);
+      return result;
     }
 
     /**
-     * Creates a function for `_.forOwn` or `_.forOwnRight`.
+     * A specialized version of `baseRest` which flattens the rest array.
      *
      * @private
-     * @param {Function} objectFunc The function to iterate over an object.
-     * @returns {Function} Returns the new each function.
+     * @param {Function} func The function to apply a rest parameter to.
+     * @returns {Function} Returns the new function.
      */
-    function createForOwn(objectFunc) {
-      return function(object, iteratee, thisArg) {
-        if (typeof iteratee != 'function' || thisArg !== undefined) {
-          iteratee = bindCallback(iteratee, thisArg, 3);
-        }
-        return objectFunc(object, iteratee);
-      };
+    function flatRest(func) {
+      return setToString(overRest(func, undefined, flatten), func + '');
     }
 
     /**
-     * Creates a function for `_.mapKeys` or `_.mapValues`.
+     * Creates an array of own enumerable property names and symbols of `object`.
      *
      * @private
-     * @param {boolean} [isMapKeys] Specify mapping keys instead of values.
-     * @returns {Function} Returns the new map function.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names and symbols.
      */
-    function createObjectMapper(isMapKeys) {
-      return function(object, iteratee, thisArg) {
-        var result = {};
-        iteratee = getCallback(iteratee, thisArg, 3);
-
-        baseForOwn(object, function(value, key, object) {
-          var mapped = iteratee(value, key, object);
-          key = isMapKeys ? mapped : key;
-          value = isMapKeys ? value : mapped;
-          result[key] = value;
-        });
-        return result;
-      };
+    function getAllKeys(object) {
+      return baseGetAllKeys(object, keys, getSymbols);
     }
 
     /**
-     * Creates a function for `_.padLeft` or `_.padRight`.
+     * Creates an array of own and inherited enumerable property names and
+     * symbols of `object`.
      *
      * @private
-     * @param {boolean} [fromRight] Specify padding from the right.
-     * @returns {Function} Returns the new pad function.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names and symbols.
      */
-    function createPadDir(fromRight) {
-      return function(string, length, chars) {
-        string = baseToString(string);
-        return (fromRight ? string : '') + createPadding(string, length, chars) + (fromRight ? '' : string);
-      };
+    function getAllKeysIn(object) {
+      return baseGetAllKeys(object, keysIn, getSymbolsIn);
     }
 
     /**
-     * Creates a `_.partial` or `_.partialRight` function.
+     * Gets metadata for `func`.
      *
      * @private
-     * @param {boolean} flag The partial bit flag.
-     * @returns {Function} Returns the new partial function.
+     * @param {Function} func The function to query.
+     * @returns {*} Returns the metadata for `func`.
      */
-    function createPartial(flag) {
-      var partialFunc = restParam(function(func, partials) {
-        var holders = replaceHolders(partials, partialFunc.placeholder);
-        return createWrapper(func, flag, undefined, partials, holders);
-      });
-      return partialFunc;
-    }
+    var getData = !metaMap ? noop : function(func) {
+      return metaMap.get(func);
+    };
 
     /**
-     * Creates a function for `_.reduce` or `_.reduceRight`.
+     * Gets the name of `func`.
      *
      * @private
-     * @param {Function} arrayFunc The function to iterate over an array.
-     * @param {Function} eachFunc The function to iterate over a collection.
-     * @returns {Function} Returns the new each function.
-     */
-    function createReduce(arrayFunc, eachFunc) {
-      return function(collection, iteratee, accumulator, thisArg) {
-        var initFromArray = arguments.length < 3;
-        return (typeof iteratee == 'function' && thisArg === undefined && isArray(collection))
-          ? arrayFunc(collection, iteratee, accumulator, initFromArray)
-          : baseReduce(collection, getCallback(iteratee, thisArg, 4), accumulator, initFromArray, eachFunc);
-      };
+     * @param {Function} func The function to query.
+     * @returns {string} Returns the function name.
+     */
+    function getFuncName(func) {
+      var result = (func.name + ''),
+          array = realNames[result],
+          length = hasOwnProperty.call(realNames, result) ? array.length : 0;
+
+      while (length--) {
+        var data = array[length],
+            otherFunc = data.func;
+        if (otherFunc == null || otherFunc == func) {
+          return data.name;
+        }
+      }
+      return result;
     }
 
     /**
-     * Creates a function that wraps `func` and invokes it with optional `this`
-     * binding of, partial application, and currying.
+     * Gets the argument placeholder value for `func`.
      *
      * @private
-     * @param {Function|string} func The function or method name to reference.
-     * @param {number} bitmask The bitmask of flags. See `createWrapper` for more details.
-     * @param {*} [thisArg] The `this` binding of `func`.
-     * @param {Array} [partials] The arguments to prepend to those provided to the new function.
-     * @param {Array} [holders] The `partials` placeholder indexes.
-     * @param {Array} [partialsRight] The arguments to append to those provided to the new function.
-     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.
-     * @param {Array} [argPos] The argument positions of the new function.
-     * @param {number} [ary] The arity cap of `func`.
-     * @param {number} [arity] The arity of `func`.
-     * @returns {Function} Returns the new wrapped function.
+     * @param {Function} func The function to inspect.
+     * @returns {*} Returns the placeholder value.
      */
-    function createHybridWrapper(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {
-      var isAry = bitmask & ARY_FLAG,
-          isBind = bitmask & BIND_FLAG,
-          isBindKey = bitmask & BIND_KEY_FLAG,
-          isCurry = bitmask & CURRY_FLAG,
-          isCurryBound = bitmask & CURRY_BOUND_FLAG,
-          isCurryRight = bitmask & CURRY_RIGHT_FLAG,
-          Ctor = isBindKey ? undefined : createCtorWrapper(func);
-
-      function wrapper() {
-        // Avoid `arguments` object use disqualifying optimizations by
-        // converting it to an array before providing it to other functions.
-        var length = arguments.length,
-            index = length,
-            args = Array(length);
-
-        while (index--) {
-          args[index] = arguments[index];
-        }
-        if (partials) {
-          args = composeArgs(args, partials, holders);
-        }
-        if (partialsRight) {
-          args = composeArgsRight(args, partialsRight, holdersRight);
-        }
-        if (isCurry || isCurryRight) {
-          var placeholder = wrapper.placeholder,
-              argsHolders = replaceHolders(args, placeholder);
-
-          length -= argsHolders.length;
-          if (length < arity) {
-            var newArgPos = argPos ? arrayCopy(argPos) : undefined,
-                newArity = nativeMax(arity - length, 0),
-                newsHolders = isCurry ? argsHolders : undefined,
-                newHoldersRight = isCurry ? undefined : argsHolders,
-                newPartials = isCurry ? args : undefined,
-                newPartialsRight = isCurry ? undefined : args;
-
-            bitmask |= (isCurry ? PARTIAL_FLAG : PARTIAL_RIGHT_FLAG);
-            bitmask &= ~(isCurry ? PARTIAL_RIGHT_FLAG : PARTIAL_FLAG);
-
-            if (!isCurryBound) {
-              bitmask &= ~(BIND_FLAG | BIND_KEY_FLAG);
-            }
-            var newData = [func, bitmask, thisArg, newPartials, newsHolders, newPartialsRight, newHoldersRight, newArgPos, ary, newArity],
-                result = createHybridWrapper.apply(undefined, newData);
-
-            if (isLaziable(func)) {
-              setData(result, newData);
-            }
-            result.placeholder = placeholder;
-            return result;
-          }
-        }
-        var thisBinding = isBind ? thisArg : this,
-            fn = isBindKey ? thisBinding[func] : func;
-
-        if (argPos) {
-          args = reorder(args, argPos);
-        }
-        if (isAry && ary < args.length) {
-          args.length = ary;
-        }
-        if (this && this !== root && this instanceof wrapper) {
-          fn = Ctor || createCtorWrapper(func);
-        }
-        return fn.apply(thisBinding, args);
-      }
-      return wrapper;
+    function getHolder(func) {
+      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;
+      return object.placeholder;
     }
 
     /**
-     * Creates the padding required for `string` based on the given `length`.
-     * The `chars` string is truncated if the number of characters exceeds `length`.
+     * Gets the appropriate "iteratee" function. If `_.iteratee` is customized,
+     * this function returns the custom method, otherwise it returns `baseIteratee`.
+     * If arguments are provided, the chosen function is invoked with them and
+     * its result is returned.
      *
      * @private
-     * @param {string} string The string to create padding for.
-     * @param {number} [length=0] The padding length.
-     * @param {string} [chars=' '] The string used as padding.
-     * @returns {string} Returns the pad for `string`.
+     * @param {*} [value] The value to convert to an iteratee.
+     * @param {number} [arity] The arity of the created iteratee.
+     * @returns {Function} Returns the chosen function or its result.
      */
-    function createPadding(string, length, chars) {
-      var strLength = string.length;
-      length = +length;
+    function getIteratee() {
+      var result = lodash.iteratee || iteratee;
+      result = result === iteratee ? baseIteratee : result;
+      return arguments.length ? result(arguments[0], arguments[1]) : result;
+    }
 
-      if (strLength >= length || !nativeIsFinite(length)) {
-        return '';
-      }
-      var padLength = length - strLength;
-      chars = chars == null ? ' ' : (chars + '');
-      return repeat(chars, nativeCeil(padLength / chars.length)).slice(0, padLength);
+    /**
+     * Gets the data for `map`.
+     *
+     * @private
+     * @param {Object} map The map to query.
+     * @param {string} key The reference key.
+     * @returns {*} Returns the map data.
+     */
+    function getMapData(map, key) {
+      var data = map.__data__;
+      return isKeyable(key)
+        ? data[typeof key == 'string' ? 'string' : 'hash']
+        : data.map;
     }
 
     /**
-     * Creates a function that wraps `func` and invokes it with the optional `this`
-     * binding of `thisArg` and the `partials` prepended to those provided to
-     * the wrapper.
+     * Gets the property names, values, and compare flags of `object`.
      *
      * @private
-     * @param {Function} func The function to partially apply arguments to.
-     * @param {number} bitmask The bitmask of flags. See `createWrapper` for more details.
-     * @param {*} thisArg The `this` binding of `func`.
-     * @param {Array} partials The arguments to prepend to those provided to the new function.
-     * @returns {Function} Returns the new bound function.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the match data of `object`.
      */
-    function createPartialWrapper(func, bitmask, thisArg, partials) {
-      var isBind = bitmask & BIND_FLAG,
-          Ctor = createCtorWrapper(func);
+    function getMatchData(object) {
+      var result = keys(object),
+          length = result.length;
 
-      function wrapper() {
-        // Avoid `arguments` object use disqualifying optimizations by
-        // converting it to an array before providing it `func`.
-        var argsIndex = -1,
-            argsLength = arguments.length,
-            leftIndex = -1,
-            leftLength = partials.length,
-            args = Array(leftLength + argsLength);
+      while (length--) {
+        var key = result[length],
+            value = object[key];
 
-        while (++leftIndex < leftLength) {
-          args[leftIndex] = partials[leftIndex];
-        }
-        while (argsLength--) {
-          args[leftIndex++] = arguments[++argsIndex];
-        }
-        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
-        return fn.apply(isBind ? thisArg : this, args);
+        result[length] = [key, value, isStrictComparable(value)];
       }
-      return wrapper;
+      return result;
     }
 
     /**
-     * Creates a `_.ceil`, `_.floor`, or `_.round` function.
+     * Gets the native function at `key` of `object`.
      *
      * @private
-     * @param {string} methodName The name of the `Math` method to use when rounding.
-     * @returns {Function} Returns the new round function.
+     * @param {Object} object The object to query.
+     * @param {string} key The key of the method to get.
+     * @returns {*} Returns the function if it's native, else `undefined`.
      */
-    function createRound(methodName) {
-      var func = Math[methodName];
-      return function(number, precision) {
-        precision = precision === undefined ? 0 : (+precision || 0);
-        if (precision) {
-          precision = pow(10, precision);
-          return func(number * precision) / precision;
-        }
-        return func(number);
-      };
+    function getNative(object, key) {
+      var value = getValue(object, key);
+      return baseIsNative(value) ? value : undefined;
     }
 
     /**
-     * Creates a `_.sortedIndex` or `_.sortedLastIndex` function.
+     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.
      *
      * @private
-     * @param {boolean} [retHighest] Specify returning the highest qualified index.
-     * @returns {Function} Returns the new index function.
-     */
-    function createSortedIndex(retHighest) {
-      return function(array, value, iteratee, thisArg) {
-        var callback = getCallback(iteratee);
-        return (iteratee == null && callback === baseCallback)
-          ? binaryIndex(array, value, retHighest)
-          : binaryIndexBy(array, value, callback(iteratee, thisArg, 1), retHighest);
-      };
+     * @param {*} value The value to query.
+     * @returns {string} Returns the raw `toStringTag`.
+     */
+    function getRawTag(value) {
+      var isOwn = hasOwnProperty.call(value, symToStringTag),
+          tag = value[symToStringTag];
+
+      try {
+        value[symToStringTag] = undefined;
+        var unmasked = true;
+      } catch (e) {}
+
+      var result = nativeObjectToString.call(value);
+      if (unmasked) {
+        if (isOwn) {
+          value[symToStringTag] = tag;
+        } else {
+          delete value[symToStringTag];
+        }
+      }
+      return result;
     }
 
     /**
-     * Creates a function that either curries or invokes `func` with optional
-     * `this` binding and partially applied arguments.
+     * Creates an array of the own enumerable symbols of `object`.
      *
      * @private
-     * @param {Function|string} func The function or method name to reference.
-     * @param {number} bitmask The bitmask of flags.
-     *  The bitmask may be composed of the following flags:
-     *     1 - `_.bind`
-     *     2 - `_.bindKey`
-     *     4 - `_.curry` or `_.curryRight` of a bound function
-     *     8 - `_.curry`
-     *    16 - `_.curryRight`
-     *    32 - `_.partial`
-     *    64 - `_.partialRight`
-     *   128 - `_.rearg`
-     *   256 - `_.ary`
-     * @param {*} [thisArg] The `this` binding of `func`.
-     * @param {Array} [partials] The arguments to be partially applied.
-     * @param {Array} [holders] The `partials` placeholder indexes.
-     * @param {Array} [argPos] The argument positions of the new function.
-     * @param {number} [ary] The arity cap of `func`.
-     * @param {number} [arity] The arity of `func`.
-     * @returns {Function} Returns the new wrapped function.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of symbols.
      */
-    function createWrapper(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {
-      var isBindKey = bitmask & BIND_KEY_FLAG;
-      if (!isBindKey && typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      var length = partials ? partials.length : 0;
-      if (!length) {
-        bitmask &= ~(PARTIAL_FLAG | PARTIAL_RIGHT_FLAG);
-        partials = holders = undefined;
-      }
-      length -= (holders ? holders.length : 0);
-      if (bitmask & PARTIAL_RIGHT_FLAG) {
-        var partialsRight = partials,
-            holdersRight = holders;
-
-        partials = holders = undefined;
+    var getSymbols = !nativeGetSymbols ? stubArray : function(object) {
+      if (object == null) {
+        return [];
       }
-      var data = isBindKey ? undefined : getData(func),
-          newData = [func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity];
+      object = Object(object);
+      return arrayFilter(nativeGetSymbols(object), function(symbol) {
+        return propertyIsEnumerable.call(object, symbol);
+      });
+    };
 
-      if (data) {
-        mergeData(newData, data);
-        bitmask = newData[1];
-        arity = newData[9];
+    /**
+     * Creates an array of the own and inherited enumerable symbols of `object`.
+     *
+     * @private
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of symbols.
+     */
+    var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {
+      var result = [];
+      while (object) {
+        arrayPush(result, getSymbols(object));
+        object = getPrototype(object);
       }
-      newData[9] = arity == null
-        ? (isBindKey ? 0 : func.length)
-        : (nativeMax(arity - length, 0) || 0);
+      return result;
+    };
 
-      if (bitmask == BIND_FLAG) {
-        var result = createBindWrapper(newData[0], newData[2]);
-      } else if ((bitmask == PARTIAL_FLAG || bitmask == (BIND_FLAG | PARTIAL_FLAG)) && !newData[4].length) {
-        result = createPartialWrapper.apply(undefined, newData);
-      } else {
-        result = createHybridWrapper.apply(undefined, newData);
-      }
-      var setter = data ? baseSetData : setData;
-      return setter(result, newData);
+    /**
+     * Gets the `toStringTag` of `value`.
+     *
+     * @private
+     * @param {*} value The value to query.
+     * @returns {string} Returns the `toStringTag`.
+     */
+    var getTag = baseGetTag;
+
+    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.
+    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||
+        (Map && getTag(new Map) != mapTag) ||
+        (Promise && getTag(Promise.resolve()) != promiseTag) ||
+        (Set && getTag(new Set) != setTag) ||
+        (WeakMap && getTag(new WeakMap) != weakMapTag)) {
+      getTag = function(value) {
+        var result = baseGetTag(value),
+            Ctor = result == objectTag ? value.constructor : undefined,
+            ctorString = Ctor ? toSource(Ctor) : '';
+
+        if (ctorString) {
+          switch (ctorString) {
+            case dataViewCtorString: return dataViewTag;
+            case mapCtorString: return mapTag;
+            case promiseCtorString: return promiseTag;
+            case setCtorString: return setTag;
+            case weakMapCtorString: return weakMapTag;
+          }
+        }
+        return result;
+      };
     }
 
     /**
-     * A specialized version of `baseIsEqualDeep` for arrays with support for
-     * partial deep comparisons.
+     * Gets the view, applying any `transforms` to the `start` and `end` positions.
      *
      * @private
-     * @param {Array} array The array to compare.
-     * @param {Array} other The other array to compare.
-     * @param {Function} equalFunc The function to determine equivalents of values.
-     * @param {Function} [customizer] The function to customize comparing arrays.
-     * @param {boolean} [isLoose] Specify performing partial comparisons.
-     * @param {Array} [stackA] Tracks traversed `value` objects.
-     * @param {Array} [stackB] Tracks traversed `other` objects.
-     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
+     * @param {number} start The start of the view.
+     * @param {number} end The end of the view.
+     * @param {Array} transforms The transformations to apply to the view.
+     * @returns {Object} Returns an object containing the `start` and `end`
+     *  positions of the view.
      */
-    function equalArrays(array, other, equalFunc, customizer, isLoose, stackA, stackB) {
+    function getView(start, end, transforms) {
       var index = -1,
-          arrLength = array.length,
-          othLength = other.length;
+          length = transforms.length;
 
-      if (arrLength != othLength && !(isLoose && othLength > arrLength)) {
-        return false;
-      }
-      // Ignore non-index properties.
-      while (++index < arrLength) {
-        var arrValue = array[index],
-            othValue = other[index],
-            result = customizer ? customizer(isLoose ? othValue : arrValue, isLoose ? arrValue : othValue, index) : undefined;
+      while (++index < length) {
+        var data = transforms[index],
+            size = data.size;
 
-        if (result !== undefined) {
-          if (result) {
-            continue;
-          }
-          return false;
-        }
-        // Recursively compare arrays (susceptible to call stack limits).
-        if (isLoose) {
-          if (!arraySome(other, function(othValue) {
-                return arrValue === othValue || equalFunc(arrValue, othValue, customizer, isLoose, stackA, stackB);
-              })) {
-            return false;
-          }
-        } else if (!(arrValue === othValue || equalFunc(arrValue, othValue, customizer, isLoose, stackA, stackB))) {
-          return false;
+        switch (data.type) {
+          case 'drop':      start += size; break;
+          case 'dropRight': end -= size; break;
+          case 'take':      end = nativeMin(end, start + size); break;
+          case 'takeRight': start = nativeMax(start, end - size); break;
         }
       }
-      return true;
+      return { 'start': start, 'end': end };
     }
 
     /**
-     * A specialized version of `baseIsEqualDeep` for comparing objects of
-     * the same `toStringTag`.
-     *
-     * **Note:** This function only supports comparing values with tags of
-     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
+     * Extracts wrapper details from the `source` body comment.
      *
      * @private
-     * @param {Object} object The object to compare.
-     * @param {Object} other The other object to compare.
-     * @param {string} tag The `toStringTag` of the objects to compare.
-     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+     * @param {string} source The source to inspect.
+     * @returns {Array} Returns the wrapper details.
      */
-    function equalByTag(object, other, tag) {
-      switch (tag) {
-        case boolTag:
-        case dateTag:
-          // Coerce dates and booleans to numbers, dates to milliseconds and booleans
-          // to `1` or `0` treating invalid dates coerced to `NaN` as not equal.
-          return +object == +other;
+    function getWrapDetails(source) {
+      var match = source.match(reWrapDetails);
+      return match ? match[1].split(reSplitDetails) : [];
+    }
 
-        case errorTag:
-          return object.name == other.name && object.message == other.message;
+    /**
+     * Checks if `path` exists on `object`.
+     *
+     * @private
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path to check.
+     * @param {Function} hasFunc The function to check properties.
+     * @returns {boolean} Returns `true` if `path` exists, else `false`.
+     */
+    function hasPath(object, path, hasFunc) {
+      path = castPath(path, object);
 
-        case numberTag:
-          // Treat `NaN` vs. `NaN` as equal.
-          return (object != +object)
-            ? other != +other
-            : object == +other;
+      var index = -1,
+          length = path.length,
+          result = false;
 
-        case regexpTag:
-        case stringTag:
-          // Coerce regexes to strings and treat strings primitives and string
-          // objects as equal. See https://es5.github.io/#x15.10.6.4 for more details.
-          return object == (other + '');
+      while (++index < length) {
+        var key = toKey(path[index]);
+        if (!(result = object != null && hasFunc(object, key))) {
+          break;
+        }
+        object = object[key];
       }
-      return false;
+      if (result || ++index != length) {
+        return result;
+      }
+      length = object == null ? 0 : object.length;
+      return !!length && isLength(length) && isIndex(key, length) &&
+        (isArray(object) || isArguments(object));
     }
 
     /**
-     * A specialized version of `baseIsEqualDeep` for objects with support for
-     * partial deep comparisons.
+     * Initializes an array clone.
      *
      * @private
-     * @param {Object} object The object to compare.
-     * @param {Object} other The other object to compare.
-     * @param {Function} equalFunc The function to determine equivalents of values.
-     * @param {Function} [customizer] The function to customize comparing values.
-     * @param {boolean} [isLoose] Specify performing partial comparisons.
-     * @param {Array} [stackA] Tracks traversed `value` objects.
-     * @param {Array} [stackB] Tracks traversed `other` objects.
-     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+     * @param {Array} array The array to clone.
+     * @returns {Array} Returns the initialized clone.
      */
-    function equalObjects(object, other, equalFunc, customizer, isLoose, stackA, stackB) {
-      var objProps = keys(object),
-          objLength = objProps.length,
-          othProps = keys(other),
-          othLength = othProps.length;
+    function initCloneArray(array) {
+      var length = array.length,
+          result = array.constructor(length);
 
-      if (objLength != othLength && !isLoose) {
-        return false;
-      }
-      var index = objLength;
-      while (index--) {
-        var key = objProps[index];
-        if (!(isLoose ? key in other : hasOwnProperty.call(other, key))) {
-          return false;
-        }
-      }
-      var skipCtor = isLoose;
-      while (++index < objLength) {
-        key = objProps[index];
-        var objValue = object[key],
-            othValue = other[key],
-            result = customizer ? customizer(isLoose ? othValue : objValue, isLoose? objValue : othValue, key) : undefined;
-
-        // Recursively compare objects (susceptible to call stack limits).
-        if (!(result === undefined ? equalFunc(objValue, othValue, customizer, isLoose, stackA, stackB) : result)) {
-          return false;
-        }
-        skipCtor || (skipCtor = key == 'constructor');
-      }
-      if (!skipCtor) {
-        var objCtor = object.constructor,
-            othCtor = other.constructor;
-
-        // Non `Object` object instances with different constructors are not equal.
-        if (objCtor != othCtor &&
-            ('constructor' in object && 'constructor' in other) &&
-            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
-              typeof othCtor == 'function' && othCtor instanceof othCtor)) {
-          return false;
-        }
-      }
-      return true;
-    }
-
-    /**
-     * Gets the appropriate "callback" function. If the `_.callback` method is
-     * customized this function returns the custom method, otherwise it returns
-     * the `baseCallback` function. If arguments are provided the chosen function
-     * is invoked with them and its result is returned.
-     *
-     * @private
-     * @returns {Function} Returns the chosen function or its result.
-     */
-    function getCallback(func, thisArg, argCount) {
-      var result = lodash.callback || callback;
-      result = result === callback ? baseCallback : result;
-      return argCount ? result(func, thisArg, argCount) : result;
-    }
-
-    /**
-     * Gets metadata for `func`.
-     *
-     * @private
-     * @param {Function} func The function to query.
-     * @returns {*} Returns the metadata for `func`.
-     */
-    var getData = !metaMap ? noop : function(func) {
-      return metaMap.get(func);
-    };
-
-    /**
-     * Gets the name of `func`.
-     *
-     * @private
-     * @param {Function} func The function to query.
-     * @returns {string} Returns the function name.
-     */
-    function getFuncName(func) {
-      var result = func.name,
-          array = realNames[result],
-          length = array ? array.length : 0;
-
-      while (length--) {
-        var data = array[length],
-            otherFunc = data.func;
-        if (otherFunc == null || otherFunc == func) {
-          return data.name;
-        }
-      }
-      return result;
-    }
-
-    /**
-     * Gets the appropriate "indexOf" function. If the `_.indexOf` method is
-     * customized this function returns the custom method, otherwise it returns
-     * the `baseIndexOf` function. If arguments are provided the chosen function
-     * is invoked with them and its result is returned.
-     *
-     * @private
-     * @returns {Function|number} Returns the chosen function or its result.
-     */
-    function getIndexOf(collection, target, fromIndex) {
-      var result = lodash.indexOf || indexOf;
-      result = result === indexOf ? baseIndexOf : result;
-      return collection ? result(collection, target, fromIndex) : result;
-    }
-
-    /**
-     * Gets the "length" property value of `object`.
-     *
-     * **Note:** This function is used to avoid a [JIT bug](https://bugs.webkit.org/show_bug.cgi?id=142792)
-     * that affects Safari on at least iOS 8.1-8.3 ARM64.
-     *
-     * @private
-     * @param {Object} object The object to query.
-     * @returns {*} Returns the "length" value.
-     */
-    var getLength = baseProperty('length');
-
-    /**
-     * Gets the propery names, values, and compare flags of `object`.
-     *
-     * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the match data of `object`.
-     */
-    function getMatchData(object) {
-      var result = pairs(object),
-          length = result.length;
-
-      while (length--) {
-        result[length][2] = isStrictComparable(result[length][1]);
-      }
-      return result;
-    }
-
-    /**
-     * Gets the native function at `key` of `object`.
-     *
-     * @private
-     * @param {Object} object The object to query.
-     * @param {string} key The key of the method to get.
-     * @returns {*} Returns the function if it's native, else `undefined`.
-     */
-    function getNative(object, key) {
-      var value = object == null ? undefined : object[key];
-      return isNative(value) ? value : undefined;
-    }
-
-    /**
-     * Gets the view, applying any `transforms` to the `start` and `end` positions.
-     *
-     * @private
-     * @param {number} start The start of the view.
-     * @param {number} end The end of the view.
-     * @param {Array} transforms The transformations to apply to the view.
-     * @returns {Object} Returns an object containing the `start` and `end`
-     *  positions of the view.
-     */
-    function getView(start, end, transforms) {
-      var index = -1,
-          length = transforms.length;
-
-      while (++index < length) {
-        var data = transforms[index],
-            size = data.size;
-
-        switch (data.type) {
-          case 'drop':      start += size; break;
-          case 'dropRight': end -= size; break;
-          case 'take':      end = nativeMin(end, start + size); break;
-          case 'takeRight': start = nativeMax(start, end - size); break;
-        }
-      }
-      return { 'start': start, 'end': end };
-    }
-
-    /**
-     * Initializes an array clone.
-     *
-     * @private
-     * @param {Array} array The array to clone.
-     * @returns {Array} Returns the initialized clone.
-     */
-    function initCloneArray(array) {
-      var length = array.length,
-          result = new array.constructor(length);
-
-      // Add array properties assigned by `RegExp#exec`.
-      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {
-        result.index = array.index;
-        result.input = array.input;
+      // Add properties assigned by `RegExp#exec`.
+      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {
+        result.index = array.index;
+        result.input = array.input;
       }
       return result;
     }
@@ -11950,11 +11499,9 @@ module.exports = ClipperLib;
      * @returns {Object} Returns the initialized clone.
      */
     function initCloneObject(object) {
-      var Ctor = object.constructor;
-      if (!(typeof Ctor == 'function' && Ctor instanceof Ctor)) {
-        Ctor = Object;
-      }
-      return new Ctor;
+      return (typeof object.constructor == 'function' && !isPrototype(object))
+        ? baseCreate(getPrototype(object))
+        : {};
     }
 
     /**
@@ -11966,64 +11513,75 @@ module.exports = ClipperLib;
      * @private
      * @param {Object} object The object to clone.
      * @param {string} tag The `toStringTag` of the object to clone.
+     * @param {Function} cloneFunc The function to clone values.
      * @param {boolean} [isDeep] Specify a deep clone.
      * @returns {Object} Returns the initialized clone.
      */
-    function initCloneByTag(object, tag, isDeep) {
+    function initCloneByTag(object, tag, cloneFunc, isDeep) {
       var Ctor = object.constructor;
       switch (tag) {
         case arrayBufferTag:
-          return bufferClone(object);
+          return cloneArrayBuffer(object);
 
         case boolTag:
         case dateTag:
           return new Ctor(+object);
 
+        case dataViewTag:
+          return cloneDataView(object, isDeep);
+
         case float32Tag: case float64Tag:
         case int8Tag: case int16Tag: case int32Tag:
         case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:
-          var buffer = object.buffer;
-          return new Ctor(isDeep ? bufferClone(buffer) : buffer, object.byteOffset, object.length);
+          return cloneTypedArray(object, isDeep);
+
+        case mapTag:
+          return cloneMap(object, isDeep, cloneFunc);
 
         case numberTag:
         case stringTag:
           return new Ctor(object);
 
         case regexpTag:
-          var result = new Ctor(object.source, reFlags.exec(object));
-          result.lastIndex = object.lastIndex;
+          return cloneRegExp(object);
+
+        case setTag:
+          return cloneSet(object, isDeep, cloneFunc);
+
+        case symbolTag:
+          return cloneSymbol(object);
       }
-      return result;
     }
 
     /**
-     * Invokes the method at `path` on `object`.
+     * Inserts wrapper `details` in a comment at the top of the `source` body.
      *
      * @private
-     * @param {Object} object The object to query.
-     * @param {Array|string} path The path of the method to invoke.
-     * @param {Array} args The arguments to invoke the method with.
-     * @returns {*} Returns the result of the invoked method.
+     * @param {string} source The source to modify.
+     * @returns {Array} details The details to insert.
+     * @returns {string} Returns the modified source.
      */
-    function invokePath(object, path, args) {
-      if (object != null && !isKey(path, object)) {
-        path = toPath(path);
-        object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
-        path = last(path);
+    function insertWrapDetails(source, details) {
+      var length = details.length;
+      if (!length) {
+        return source;
       }
-      var func = object == null ? object : object[path];
-      return func == null ? undefined : func.apply(object, args);
+      var lastIndex = length - 1;
+      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];
+      details = details.join(length > 2 ? ', ' : ' ');
+      return source.replace(reWrapComment, '{\n/* [wrapped with ' + details + '] */\n');
     }
 
     /**
-     * Checks if `value` is array-like.
+     * Checks if `value` is a flattenable `arguments` object or array.
      *
      * @private
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
+     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
      */
-    function isArrayLike(value) {
-      return value != null && isLength(getLength(value));
+    function isFlattenable(value) {
+      return isArray(value) || isArguments(value) ||
+        !!(spreadableSymbol && value && value[spreadableSymbol]);
     }
 
     /**
@@ -12035,19 +11593,21 @@ module.exports = ClipperLib;
      * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
      */
     function isIndex(value, length) {
-      value = (typeof value == 'number' || reIsUint.test(value)) ? +value : -1;
       length = length == null ? MAX_SAFE_INTEGER : length;
-      return value > -1 && value % 1 == 0 && value < length;
+      return !!length &&
+        (typeof value == 'number' || reIsUint.test(value)) &&
+        (value > -1 && value % 1 == 0 && value < length);
     }
 
     /**
-     * Checks if the provided arguments are from an iteratee call.
+     * Checks if the given arguments are from an iteratee call.
      *
      * @private
      * @param {*} value The potential iteratee value argument.
      * @param {*} index The potential iteratee index or key argument.
      * @param {*} object The potential iteratee object argument.
-     * @returns {boolean} Returns `true` if the arguments are from an iteratee call, else `false`.
+     * @returns {boolean} Returns `true` if the arguments are from an iteratee call,
+     *  else `false`.
      */
     function isIterateeCall(value, index, object) {
       if (!isObject(object)) {
@@ -12055,10 +11615,10 @@ module.exports = ClipperLib;
       }
       var type = typeof index;
       if (type == 'number'
-          ? (isArrayLike(object) && isIndex(index, object.length))
-          : (type == 'string' && index in object)) {
-        var other = object[index];
-        return value === value ? (value === other) : (other !== other);
+            ? (isArrayLike(object) && isIndex(index, object.length))
+            : (type == 'string' && index in object)
+          ) {
+        return eq(object[index], value);
       }
       return false;
     }
@@ -12072,15 +11632,30 @@ module.exports = ClipperLib;
      * @returns {boolean} Returns `true` if `value` is a property name, else `false`.
      */
     function isKey(value, object) {
-      var type = typeof value;
-      if ((type == 'string' && reIsPlainProp.test(value)) || type == 'number') {
-        return true;
-      }
       if (isArray(value)) {
         return false;
       }
-      var result = !reIsDeepProp.test(value);
-      return result || (object != null && value in toObject(object));
+      var type = typeof value;
+      if (type == 'number' || type == 'symbol' || type == 'boolean' ||
+          value == null || isSymbol(value)) {
+        return true;
+      }
+      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
+        (object != null && value in Object(object));
+    }
+
+    /**
+     * Checks if `value` is suitable for use as unique object key.
+     *
+     * @private
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
+     */
+    function isKeyable(value) {
+      var type = typeof value;
+      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
+        ? (value !== '__proto__')
+        : (value === null);
     }
 
     /**
@@ -12088,14 +11663,16 @@ module.exports = ClipperLib;
      *
      * @private
      * @param {Function} func The function to check.
-     * @returns {boolean} Returns `true` if `func` has a lazy counterpart, else `false`.
+     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,
+     *  else `false`.
      */
     function isLaziable(func) {
-      var funcName = getFuncName(func);
-      if (!(funcName in LazyWrapper.prototype)) {
+      var funcName = getFuncName(func),
+          other = lodash[funcName];
+
+      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {
         return false;
       }
-      var other = lodash[funcName];
       if (func === other) {
         return true;
       }
@@ -12104,16 +11681,37 @@ module.exports = ClipperLib;
     }
 
     /**
-     * Checks if `value` is a valid array-like length.
+     * Checks if `func` has its source masked.
      *
-     * **Note:** This function is based on [`ToLength`](http://ecma-international.org/ecma-262/6.0/#sec-tolength).
+     * @private
+     * @param {Function} func The function to check.
+     * @returns {boolean} Returns `true` if `func` is masked, else `false`.
+     */
+    function isMasked(func) {
+      return !!maskSrcKey && (maskSrcKey in func);
+    }
+
+    /**
+     * Checks if `func` is capable of being masked.
      *
      * @private
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.
+     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.
      */
-    function isLength(value) {
-      return typeof value == 'number' && value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
+    var isMaskable = coreJsData ? isFunction : stubFalse;
+
+    /**
+     * Checks if `value` is likely a prototype object.
+     *
+     * @private
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
+     */
+    function isPrototype(value) {
+      var Ctor = value && value.constructor,
+          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;
+
+      return value === proto;
     }
 
     /**
@@ -12128,15 +11726,55 @@ module.exports = ClipperLib;
       return value === value && !isObject(value);
     }
 
+    /**
+     * A specialized version of `matchesProperty` for source values suitable
+     * for strict equality comparisons, i.e. `===`.
+     *
+     * @private
+     * @param {string} key The key of the property to get.
+     * @param {*} srcValue The value to match.
+     * @returns {Function} Returns the new spec function.
+     */
+    function matchesStrictComparable(key, srcValue) {
+      return function(object) {
+        if (object == null) {
+          return false;
+        }
+        return object[key] === srcValue &&
+          (srcValue !== undefined || (key in Object(object)));
+      };
+    }
+
+    /**
+     * A specialized version of `_.memoize` which clears the memoized function's
+     * cache when it exceeds `MAX_MEMOIZE_SIZE`.
+     *
+     * @private
+     * @param {Function} func The function to have its output memoized.
+     * @returns {Function} Returns the new memoized function.
+     */
+    function memoizeCapped(func) {
+      var result = memoize(func, function(key) {
+        if (cache.size === MAX_MEMOIZE_SIZE) {
+          cache.clear();
+        }
+        return key;
+      });
+
+      var cache = result.cache;
+      return result;
+    }
+
     /**
      * Merges the function metadata of `source` into `data`.
      *
-     * Merging metadata reduces the number of wrappers required to invoke a function.
+     * Merging metadata reduces the number of wrappers used to invoke a function.
      * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`
-     * may be applied regardless of execution order. Methods like `_.ary` and `_.rearg`
-     * augment function arguments, making the order in which they are executed important,
-     * preventing the merging of metadata. However, we make an exception for a safe
-     * common case where curried functions have `_.ary` and or `_.rearg` applied.
+     * may be applied regardless of execution order. Methods like `_.ary` and
+     * `_.rearg` modify function arguments, making the order in which they are
+     * executed important, preventing the merging of metadata. However, we make
+     * an exception for a safe combined case where curried functions have `_.ary`
+     * and or `_.rearg` applied.
      *
      * @private
      * @param {Array} data The destination metadata.
@@ -12147,44 +11785,44 @@ module.exports = ClipperLib;
       var bitmask = data[1],
           srcBitmask = source[1],
           newBitmask = bitmask | srcBitmask,
-          isCommon = newBitmask < ARY_FLAG;
+          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);
 
       var isCombo =
-        (srcBitmask == ARY_FLAG && bitmask == CURRY_FLAG) ||
-        (srcBitmask == ARY_FLAG && bitmask == REARG_FLAG && data[7].length <= source[8]) ||
-        (srcBitmask == (ARY_FLAG | REARG_FLAG) && bitmask == CURRY_FLAG);
+        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||
+        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||
+        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));
 
       // Exit early if metadata can't be merged.
       if (!(isCommon || isCombo)) {
         return data;
       }
       // Use source `thisArg` if available.
-      if (srcBitmask & BIND_FLAG) {
+      if (srcBitmask & WRAP_BIND_FLAG) {
         data[2] = source[2];
         // Set when currying a bound function.
-        newBitmask |= (bitmask & BIND_FLAG) ? 0 : CURRY_BOUND_FLAG;
+        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;
       }
       // Compose partial arguments.
       var value = source[3];
       if (value) {
         var partials = data[3];
-        data[3] = partials ? composeArgs(partials, value, source[4]) : arrayCopy(value);
-        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : arrayCopy(source[4]);
+        data[3] = partials ? composeArgs(partials, value, source[4]) : value;
+        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];
       }
       // Compose partial right arguments.
       value = source[5];
       if (value) {
         partials = data[5];
-        data[5] = partials ? composeArgsRight(partials, value, source[6]) : arrayCopy(value);
-        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : arrayCopy(source[6]);
+        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;
+        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];
       }
       // Use source `argPos` if available.
       value = source[7];
       if (value) {
-        data[7] = arrayCopy(value);
+        data[7] = value;
       }
       // Use source `ary` if it's smaller.
-      if (srcBitmask & ARY_FLAG) {
+      if (srcBitmask & WRAP_ARY_FLAG) {
         data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);
       }
       // Use source `arity` if one is not provided.
@@ -12199,59 +11837,75 @@ module.exports = ClipperLib;
     }
 
     /**
-     * Used by `_.defaultsDeep` to customize its `_.merge` use.
+     * This function is like
+     * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
+     * except that it includes inherited enumerable properties.
      *
      * @private
-     * @param {*} objectValue The destination object property value.
-     * @param {*} sourceValue The source object property value.
-     * @returns {*} Returns the value to assign to the destination object.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names.
      */
-    function mergeDefaults(objectValue, sourceValue) {
-      return objectValue === undefined ? sourceValue : merge(objectValue, sourceValue, mergeDefaults);
+    function nativeKeysIn(object) {
+      var result = [];
+      if (object != null) {
+        for (var key in Object(object)) {
+          result.push(key);
+        }
+      }
+      return result;
     }
 
     /**
-     * A specialized version of `_.pick` which picks `object` properties specified
-     * by `props`.
+     * Converts `value` to a string using `Object.prototype.toString`.
      *
      * @private
-     * @param {Object} object The source object.
-     * @param {string[]} props The property names to pick.
-     * @returns {Object} Returns the new object.
+     * @param {*} value The value to convert.
+     * @returns {string} Returns the converted string.
      */
-    function pickByArray(object, props) {
-      object = toObject(object);
+    function objectToString(value) {
+      return nativeObjectToString.call(value);
+    }
 
-      var index = -1,
-          length = props.length,
-          result = {};
+    /**
+     * A specialized version of `baseRest` which transforms the rest array.
+     *
+     * @private
+     * @param {Function} func The function to apply a rest parameter to.
+     * @param {number} [start=func.length-1] The start position of the rest parameter.
+     * @param {Function} transform The rest array transform.
+     * @returns {Function} Returns the new function.
+     */
+    function overRest(func, start, transform) {
+      start = nativeMax(start === undefined ? (func.length - 1) : start, 0);
+      return function() {
+        var args = arguments,
+            index = -1,
+            length = nativeMax(args.length - start, 0),
+            array = Array(length);
 
-      while (++index < length) {
-        var key = props[index];
-        if (key in object) {
-          result[key] = object[key];
+        while (++index < length) {
+          array[index] = args[start + index];
         }
-      }
-      return result;
+        index = -1;
+        var otherArgs = Array(start + 1);
+        while (++index < start) {
+          otherArgs[index] = args[index];
+        }
+        otherArgs[start] = transform(array);
+        return apply(func, this, otherArgs);
+      };
     }
 
     /**
-     * A specialized version of `_.pick` which picks `object` properties `predicate`
-     * returns truthy for.
+     * Gets the parent value at `path` of `object`.
      *
      * @private
-     * @param {Object} object The source object.
-     * @param {Function} predicate The function invoked per iteration.
-     * @returns {Object} Returns the new object.
+     * @param {Object} object The object to query.
+     * @param {Array} path The path to get the parent value of.
+     * @returns {*} Returns the parent value.
      */
-    function pickByCallback(object, predicate) {
-      var result = {};
-      baseForIn(object, function(value, key, object) {
-        if (predicate(value, key, object)) {
-          result[key] = value;
-        }
-      });
-      return result;
+    function parent(object, path) {
+      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));
     }
 
     /**
@@ -12267,7 +11921,7 @@ module.exports = ClipperLib;
     function reorder(array, indexes) {
       var arrLength = array.length,
           length = nativeMin(indexes.length, arrLength),
-          oldArray = arrayCopy(array);
+          oldArray = copyArray(array);
 
       while (length--) {
         var index = indexes[length];
@@ -12280,8 +11934,9 @@ module.exports = ClipperLib;
      * Sets metadata for `func`.
      *
      * **Note:** If this function becomes hot, i.e. is invoked a lot in a short
-     * period of time, it will trip its breaker and transition to an identity function
-     * to avoid garbage collection pauses in V8. See [V8 issue 2070](https://code.google.com/p/v8/issues/detail?id=2070)
+     * period of time, it will trip its breaker and transition to an identity
+     * function to avoid garbage collection pauses in V8. See
+     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)
      * for more details.
      *
      * @private
@@ -12289,98 +11944,167 @@ module.exports = ClipperLib;
      * @param {*} data The metadata.
      * @returns {Function} Returns `func`.
      */
-    var setData = (function() {
-      var count = 0,
-          lastCalled = 0;
-
-      return function(key, value) {
-        var stamp = now(),
-            remaining = HOT_SPAN - (stamp - lastCalled);
+    var setData = shortOut(baseSetData);
+
+    /**
+     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).
+     *
+     * @private
+     * @param {Function} func The function to delay.
+     * @param {number} wait The number of milliseconds to delay invocation.
+     * @returns {number|Object} Returns the timer id or timeout object.
+     */
+    var setTimeout = ctxSetTimeout || function(func, wait) {
+      return root.setTimeout(func, wait);
+    };
+
+    /**
+     * Sets the `toString` method of `func` to return `string`.
+     *
+     * @private
+     * @param {Function} func The function to modify.
+     * @param {Function} string The `toString` result.
+     * @returns {Function} Returns `func`.
+     */
+    var setToString = shortOut(baseSetToString);
+
+    /**
+     * Sets the `toString` method of `wrapper` to mimic the source of `reference`
+     * with wrapper details in a comment at the top of the source body.
+     *
+     * @private
+     * @param {Function} wrapper The function to modify.
+     * @param {Function} reference The reference function.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @returns {Function} Returns `wrapper`.
+     */
+    function setWrapToString(wrapper, reference, bitmask) {
+      var source = (reference + '');
+      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));
+    }
+
+    /**
+     * Creates a function that'll short out and invoke `identity` instead
+     * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`
+     * milliseconds.
+     *
+     * @private
+     * @param {Function} func The function to restrict.
+     * @returns {Function} Returns the new shortable function.
+     */
+    function shortOut(func) {
+      var count = 0,
+          lastCalled = 0;
+
+      return function() {
+        var stamp = nativeNow(),
+            remaining = HOT_SPAN - (stamp - lastCalled);
 
         lastCalled = stamp;
         if (remaining > 0) {
           if (++count >= HOT_COUNT) {
-            return key;
+            return arguments[0];
           }
         } else {
           count = 0;
         }
-        return baseSetData(key, value);
+        return func.apply(undefined, arguments);
       };
-    }());
+    }
 
     /**
-     * A fallback implementation of `Object.keys` which creates an array of the
-     * own enumerable property names of `object`.
+     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.
      *
      * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property names.
+     * @param {Array} array The array to shuffle.
+     * @param {number} [size=array.length] The size of `array`.
+     * @returns {Array} Returns `array`.
      */
-    function shimKeys(object) {
-      var props = keysIn(object),
-          propsLength = props.length,
-          length = propsLength && object.length;
-
-      var allowIndexes = !!length && isLength(length) &&
-        (isArray(object) || isArguments(object));
-
+    function shuffleSelf(array, size) {
       var index = -1,
-          result = [];
+          length = array.length,
+          lastIndex = length - 1;
 
-      while (++index < propsLength) {
-        var key = props[index];
-        if ((allowIndexes && isIndex(key, length)) || hasOwnProperty.call(object, key)) {
-          result.push(key);
-        }
+      size = size === undefined ? length : size;
+      while (++index < size) {
+        var rand = baseRandom(index, lastIndex),
+            value = array[rand];
+
+        array[rand] = array[index];
+        array[index] = value;
       }
-      return result;
+      array.length = size;
+      return array;
     }
 
     /**
-     * Converts `value` to an array-like object if it's not one.
+     * Converts `string` to a property path array.
      *
      * @private
-     * @param {*} value The value to process.
-     * @returns {Array|Object} Returns the array-like object.
+     * @param {string} string The string to convert.
+     * @returns {Array} Returns the property path array.
      */
-    function toIterable(value) {
-      if (value == null) {
-        return [];
+    var stringToPath = memoizeCapped(function(string) {
+      var result = [];
+      if (reLeadingDot.test(string)) {
+        result.push('');
       }
-      if (!isArrayLike(value)) {
-        return values(value);
+      string.replace(rePropName, function(match, number, quote, string) {
+        result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match));
+      });
+      return result;
+    });
+
+    /**
+     * Converts `value` to a string key if it's not a string or symbol.
+     *
+     * @private
+     * @param {*} value The value to inspect.
+     * @returns {string|symbol} Returns the key.
+     */
+    function toKey(value) {
+      if (typeof value == 'string' || isSymbol(value)) {
+        return value;
       }
-      return isObject(value) ? value : Object(value);
+      var result = (value + '');
+      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
     }
 
     /**
-     * Converts `value` to an object if it's not one.
+     * Converts `func` to its source code.
      *
      * @private
-     * @param {*} value The value to process.
-     * @returns {Object} Returns the object.
+     * @param {Function} func The function to convert.
+     * @returns {string} Returns the source code.
      */
-    function toObject(value) {
-      return isObject(value) ? value : Object(value);
+    function toSource(func) {
+      if (func != null) {
+        try {
+          return funcToString.call(func);
+        } catch (e) {}
+        try {
+          return (func + '');
+        } catch (e) {}
+      }
+      return '';
     }
 
     /**
-     * Converts `value` to property path array if it's not one.
+     * Updates wrapper `details` based on `bitmask` flags.
      *
      * @private
-     * @param {*} value The value to process.
-     * @returns {Array} Returns the property path array.
+     * @returns {Array} details The details to modify.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @returns {Array} Returns `details`.
      */
-    function toPath(value) {
-      if (isArray(value)) {
-        return value;
-      }
-      var result = [];
-      baseToString(value).replace(rePropName, function(match, number, quote, string) {
-        result.push(quote ? string.replace(reEscapeChar, '$1') : (number || match));
+    function updateWrapDetails(details, bitmask) {
+      arrayEach(wrapFlags, function(pair) {
+        var value = '_.' + pair[0];
+        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {
+          details.push(value);
+        }
       });
-      return result;
+      return details.sort();
     }
 
     /**
@@ -12391,25 +12115,31 @@ module.exports = ClipperLib;
      * @returns {Object} Returns the cloned wrapper.
      */
     function wrapperClone(wrapper) {
-      return wrapper instanceof LazyWrapper
-        ? wrapper.clone()
-        : new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__, arrayCopy(wrapper.__actions__));
+      if (wrapper instanceof LazyWrapper) {
+        return wrapper.clone();
+      }
+      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);
+      result.__actions__ = copyArray(wrapper.__actions__);
+      result.__index__  = wrapper.__index__;
+      result.__values__ = wrapper.__values__;
+      return result;
     }
 
     /*------------------------------------------------------------------------*/
 
     /**
      * Creates an array of elements split into groups the length of `size`.
-     * If `collection` can't be split evenly, the final chunk will be the remaining
+     * If `array` can't be split evenly, the final chunk will be the remaining
      * elements.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Array
      * @param {Array} array The array to process.
-     * @param {number} [size=1] The length of each chunk.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
-     * @returns {Array} Returns the new array containing chunks.
+     * @param {number} [size=1] The length of each chunk
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the new array of chunks.
      * @example
      *
      * _.chunk(['a', 'b', 'c', 'd'], 2);
@@ -12419,18 +12149,21 @@ module.exports = ClipperLib;
      * // => [['a', 'b', 'c'], ['d']]
      */
     function chunk(array, size, guard) {
-      if (guard ? isIterateeCall(array, size, guard) : size == null) {
+      if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {
         size = 1;
       } else {
-        size = nativeMax(nativeFloor(size) || 1, 1);
+        size = nativeMax(toInteger(size), 0);
+      }
+      var length = array == null ? 0 : array.length;
+      if (!length || size < 1) {
+        return [];
       }
       var index = 0,
-          length = array ? array.length : 0,
-          resIndex = -1,
+          resIndex = 0,
           result = Array(nativeCeil(length / size));
 
       while (index < length) {
-        result[++resIndex] = baseSlice(array, index, (index += size));
+        result[resIndex++] = baseSlice(array, index, (index += size));
       }
       return result;
     }
@@ -12441,6 +12174,7 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
      * @param {Array} array The array to compact.
      * @returns {Array} Returns the new array of filtered values.
@@ -12451,38 +12185,149 @@ module.exports = ClipperLib;
      */
     function compact(array) {
       var index = -1,
-          length = array ? array.length : 0,
-          resIndex = -1,
+          length = array == null ? 0 : array.length,
+          resIndex = 0,
           result = [];
 
       while (++index < length) {
         var value = array[index];
         if (value) {
-          result[++resIndex] = value;
+          result[resIndex++] = value;
         }
       }
       return result;
     }
 
     /**
-     * Creates an array of unique `array` values not included in the other
-     * provided arrays using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
-     * for equality comparisons.
+     * Creates a new array concatenating `array` with any additional arrays
+     * and/or values.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to concatenate.
+     * @param {...*} [values] The values to concatenate.
+     * @returns {Array} Returns the new concatenated array.
+     * @example
+     *
+     * var array = [1];
+     * var other = _.concat(array, 2, [3], [[4]]);
+     *
+     * console.log(other);
+     * // => [1, 2, 3, [4]]
+     *
+     * console.log(array);
+     * // => [1]
+     */
+    function concat() {
+      var length = arguments.length;
+      if (!length) {
+        return [];
+      }
+      var args = Array(length - 1),
+          array = arguments[0],
+          index = length;
+
+      while (index--) {
+        args[index - 1] = arguments[index];
+      }
+      return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));
+    }
+
+    /**
+     * Creates an array of `array` values not included in the other given arrays
+     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons. The order and references of result values are
+     * determined by the first array.
+     *
+     * **Note:** Unlike `_.pullAll`, this method returns a new array.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
      * @param {Array} array The array to inspect.
-     * @param {...Array} [values] The arrays of values to exclude.
+     * @param {...Array} [values] The values to exclude.
      * @returns {Array} Returns the new array of filtered values.
+     * @see _.without, _.xor
      * @example
      *
-     * _.difference([1, 2, 3], [4, 2]);
-     * // => [1, 3]
+     * _.difference([2, 1], [2, 3]);
+     * // => [1]
+     */
+    var difference = baseRest(function(array, values) {
+      return isArrayLikeObject(array)
+        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))
+        : [];
+    });
+
+    /**
+     * This method is like `_.difference` except that it accepts `iteratee` which
+     * is invoked for each element of `array` and `values` to generate the criterion
+     * by which they're compared. The order and references of result values are
+     * determined by the first array. The iteratee is invoked with one argument:
+     * (value).
+     *
+     * **Note:** Unlike `_.pullAllBy`, this method returns a new array.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {...Array} [values] The values to exclude.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     * @example
+     *
+     * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);
+     * // => [1.2]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');
+     * // => [{ 'x': 2 }]
+     */
+    var differenceBy = baseRest(function(array, values) {
+      var iteratee = last(values);
+      if (isArrayLikeObject(iteratee)) {
+        iteratee = undefined;
+      }
+      return isArrayLikeObject(array)
+        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))
+        : [];
+    });
+
+    /**
+     * This method is like `_.difference` except that it accepts `comparator`
+     * which is invoked to compare elements of `array` to `values`. The order and
+     * references of result values are determined by the first array. The comparator
+     * is invoked with two arguments: (arrVal, othVal).
+     *
+     * **Note:** Unlike `_.pullAllWith`, this method returns a new array.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {...Array} [values] The values to exclude.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     * @example
+     *
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+     *
+     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);
+     * // => [{ 'x': 2, 'y': 1 }]
      */
-    var difference = restParam(function(array, values) {
-      return (isObjectLike(array) && isArrayLike(array))
-        ? baseDifference(array, baseFlatten(values, false, true))
+    var differenceWith = baseRest(function(array, values) {
+      var comparator = last(values);
+      if (isArrayLikeObject(comparator)) {
+        comparator = undefined;
+      }
+      return isArrayLikeObject(array)
+        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)
         : [];
     });
 
@@ -12491,10 +12336,11 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.5.0
      * @category Array
      * @param {Array} array The array to query.
      * @param {number} [n=1] The number of elements to drop.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {Array} Returns the slice of `array`.
      * @example
      *
@@ -12511,14 +12357,12 @@ module.exports = ClipperLib;
      * // => [1, 2, 3]
      */
     function drop(array, n, guard) {
-      var length = array ? array.length : 0;
+      var length = array == null ? 0 : array.length;
       if (!length) {
         return [];
       }
-      if (guard ? isIterateeCall(array, n, guard) : n == null) {
-        n = 1;
-      }
-      return baseSlice(array, n < 0 ? 0 : n);
+      n = (guard || n === undefined) ? 1 : toInteger(n);
+      return baseSlice(array, n < 0 ? 0 : n, length);
     }
 
     /**
@@ -12526,10 +12370,11 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Array
      * @param {Array} array The array to query.
      * @param {number} [n=1] The number of elements to drop.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {Array} Returns the slice of `array`.
      * @example
      *
@@ -12546,124 +12391,94 @@ module.exports = ClipperLib;
      * // => [1, 2, 3]
      */
     function dropRight(array, n, guard) {
-      var length = array ? array.length : 0;
+      var length = array == null ? 0 : array.length;
       if (!length) {
         return [];
       }
-      if (guard ? isIterateeCall(array, n, guard) : n == null) {
-        n = 1;
-      }
-      n = length - (+n || 0);
+      n = (guard || n === undefined) ? 1 : toInteger(n);
+      n = length - n;
       return baseSlice(array, 0, n < 0 ? 0 : n);
     }
 
     /**
      * Creates a slice of `array` excluding elements dropped from the end.
      * Elements are dropped until `predicate` returns falsey. The predicate is
-     * bound to `thisArg` and invoked with three arguments: (value, index, array).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that match the properties of the given
-     * object, else `false`.
+     * invoked with three arguments: (value, index, array).
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Array
      * @param {Array} array The array to query.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
      * @returns {Array} Returns the slice of `array`.
      * @example
      *
-     * _.dropRightWhile([1, 2, 3], function(n) {
-     *   return n > 1;
-     * });
-     * // => [1]
-     *
      * var users = [
      *   { 'user': 'barney',  'active': true },
      *   { 'user': 'fred',    'active': false },
      *   { 'user': 'pebbles', 'active': false }
      * ];
      *
-     * // using the `_.matches` callback shorthand
-     * _.pluck(_.dropRightWhile(users, { 'user': 'pebbles', 'active': false }), 'user');
-     * // => ['barney', 'fred']
+     * _.dropRightWhile(users, function(o) { return !o.active; });
+     * // => objects for ['barney']
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.pluck(_.dropRightWhile(users, 'active', false), 'user');
-     * // => ['barney']
+     * // The `_.matches` iteratee shorthand.
+     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });
+     * // => objects for ['barney', 'fred']
      *
-     * // using the `_.property` callback shorthand
-     * _.pluck(_.dropRightWhile(users, 'active'), 'user');
-     * // => ['barney', 'fred', 'pebbles']
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.dropRightWhile(users, ['active', false]);
+     * // => objects for ['barney']
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.dropRightWhile(users, 'active');
+     * // => objects for ['barney', 'fred', 'pebbles']
      */
-    function dropRightWhile(array, predicate, thisArg) {
+    function dropRightWhile(array, predicate) {
       return (array && array.length)
-        ? baseWhile(array, getCallback(predicate, thisArg, 3), true, true)
+        ? baseWhile(array, getIteratee(predicate, 3), true, true)
         : [];
     }
 
     /**
      * Creates a slice of `array` excluding elements dropped from the beginning.
      * Elements are dropped until `predicate` returns falsey. The predicate is
-     * bound to `thisArg` and invoked with three arguments: (value, index, array).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * invoked with three arguments: (value, index, array).
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Array
      * @param {Array} array The array to query.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
      * @returns {Array} Returns the slice of `array`.
      * @example
      *
-     * _.dropWhile([1, 2, 3], function(n) {
-     *   return n < 3;
-     * });
-     * // => [3]
-     *
      * var users = [
      *   { 'user': 'barney',  'active': false },
      *   { 'user': 'fred',    'active': false },
      *   { 'user': 'pebbles', 'active': true }
      * ];
      *
-     * // using the `_.matches` callback shorthand
-     * _.pluck(_.dropWhile(users, { 'user': 'barney', 'active': false }), 'user');
-     * // => ['fred', 'pebbles']
+     * _.dropWhile(users, function(o) { return !o.active; });
+     * // => objects for ['pebbles']
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.dropWhile(users, { 'user': 'barney', 'active': false });
+     * // => objects for ['fred', 'pebbles']
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.pluck(_.dropWhile(users, 'active', false), 'user');
-     * // => ['pebbles']
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.dropWhile(users, ['active', false]);
+     * // => objects for ['pebbles']
      *
-     * // using the `_.property` callback shorthand
-     * _.pluck(_.dropWhile(users, 'active'), 'user');
-     * // => ['barney', 'fred', 'pebbles']
+     * // The `_.property` iteratee shorthand.
+     * _.dropWhile(users, 'active');
+     * // => objects for ['barney', 'fred', 'pebbles']
      */
-    function dropWhile(array, predicate, thisArg) {
+    function dropWhile(array, predicate) {
       return (array && array.length)
-        ? baseWhile(array, getCallback(predicate, thisArg, 3), true)
+        ? baseWhile(array, getIteratee(predicate, 3), true)
         : [];
     }
 
@@ -12675,6 +12490,7 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.2.0
      * @category Array
      * @param {Array} array The array to fill.
      * @param {*} value The value to fill `array` with.
@@ -12692,11 +12508,11 @@ module.exports = ClipperLib;
      * _.fill(Array(3), 2);
      * // => [2, 2, 2]
      *
-     * _.fill([4, 6, 8], '*', 1, 2);
-     * // => [4, '*', 8]
+     * _.fill([4, 6, 8, 10], '*', 1, 3);
+     * // => [4, '*', '*', 10]
      */
     function fill(array, value, start, end) {
-      var length = array ? array.length : 0;
+      var length = array == null ? 0 : array.length;
       if (!length) {
         return [];
       }
@@ -12711,24 +12527,13 @@ module.exports = ClipperLib;
      * This method is like `_.find` except that it returns the index of the first
      * element `predicate` returns truthy for instead of the element itself.
      *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
-     *
      * @static
      * @memberOf _
+     * @since 1.1.0
      * @category Array
-     * @param {Array} array The array to search.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Array} array The array to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param {number} [fromIndex=0] The index to search from.
      * @returns {number} Returns the index of the found element, else `-1`.
      * @example
      *
@@ -12738,47 +12543,44 @@ module.exports = ClipperLib;
      *   { 'user': 'pebbles', 'active': true }
      * ];
      *
-     * _.findIndex(users, function(chr) {
-     *   return chr.user == 'barney';
-     * });
+     * _.findIndex(users, function(o) { return o.user == 'barney'; });
      * // => 0
      *
-     * // using the `_.matches` callback shorthand
+     * // The `_.matches` iteratee shorthand.
      * _.findIndex(users, { 'user': 'fred', 'active': false });
      * // => 1
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.findIndex(users, 'active', false);
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.findIndex(users, ['active', false]);
      * // => 0
      *
-     * // using the `_.property` callback shorthand
+     * // The `_.property` iteratee shorthand.
      * _.findIndex(users, 'active');
      * // => 2
      */
-    var findIndex = createFindIndex();
+    function findIndex(array, predicate, fromIndex) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return -1;
+      }
+      var index = fromIndex == null ? 0 : toInteger(fromIndex);
+      if (index < 0) {
+        index = nativeMax(length + index, 0);
+      }
+      return baseFindIndex(array, getIteratee(predicate, 3), index);
+    }
 
     /**
      * This method is like `_.findIndex` except that it iterates over elements
      * of `collection` from right to left.
      *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
-     *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @category Array
-     * @param {Array} array The array to search.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Array} array The array to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param {number} [fromIndex=array.length-1] The index to search from.
      * @returns {number} Returns the index of the found element, else `-1`.
      * @example
      *
@@ -12788,136 +12590,185 @@ module.exports = ClipperLib;
      *   { 'user': 'pebbles', 'active': false }
      * ];
      *
-     * _.findLastIndex(users, function(chr) {
-     *   return chr.user == 'pebbles';
-     * });
+     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });
      * // => 2
      *
-     * // using the `_.matches` callback shorthand
+     * // The `_.matches` iteratee shorthand.
      * _.findLastIndex(users, { 'user': 'barney', 'active': true });
      * // => 0
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.findLastIndex(users, 'active', false);
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.findLastIndex(users, ['active', false]);
      * // => 2
      *
-     * // using the `_.property` callback shorthand
+     * // The `_.property` iteratee shorthand.
      * _.findLastIndex(users, 'active');
      * // => 0
      */
-    var findLastIndex = createFindIndex(true);
+    function findLastIndex(array, predicate, fromIndex) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return -1;
+      }
+      var index = length - 1;
+      if (fromIndex !== undefined) {
+        index = toInteger(fromIndex);
+        index = fromIndex < 0
+          ? nativeMax(length + index, 0)
+          : nativeMin(index, length - 1);
+      }
+      return baseFindIndex(array, getIteratee(predicate, 3), index, true);
+    }
 
     /**
-     * Gets the first element of `array`.
+     * Flattens `array` a single level deep.
      *
      * @static
      * @memberOf _
-     * @alias head
+     * @since 0.1.0
      * @category Array
-     * @param {Array} array The array to query.
-     * @returns {*} Returns the first element of `array`.
+     * @param {Array} array The array to flatten.
+     * @returns {Array} Returns the new flattened array.
      * @example
      *
-     * _.first([1, 2, 3]);
-     * // => 1
+     * _.flatten([1, [2, [3, [4]], 5]]);
+     * // => [1, 2, [3, [4]], 5]
+     */
+    function flatten(array) {
+      var length = array == null ? 0 : array.length;
+      return length ? baseFlatten(array, 1) : [];
+    }
+
+    /**
+     * Recursively flattens `array`.
      *
-     * _.first([]);
-     * // => undefined
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to flatten.
+     * @returns {Array} Returns the new flattened array.
+     * @example
+     *
+     * _.flattenDeep([1, [2, [3, [4]], 5]]);
+     * // => [1, 2, 3, 4, 5]
      */
-    function first(array) {
-      return array ? array[0] : undefined;
+    function flattenDeep(array) {
+      var length = array == null ? 0 : array.length;
+      return length ? baseFlatten(array, INFINITY) : [];
     }
 
     /**
-     * Flattens a nested array. If `isDeep` is `true` the array is recursively
-     * flattened, otherwise it is only flattened a single level.
+     * Recursively flatten `array` up to `depth` times.
      *
      * @static
      * @memberOf _
+     * @since 4.4.0
      * @category Array
      * @param {Array} array The array to flatten.
-     * @param {boolean} [isDeep] Specify a deep flatten.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param {number} [depth=1] The maximum recursion depth.
      * @returns {Array} Returns the new flattened array.
      * @example
      *
-     * _.flatten([1, [2, 3, [4]]]);
-     * // => [1, 2, 3, [4]]
+     * var array = [1, [2, [3, [4]], 5]];
      *
-     * // using `isDeep`
-     * _.flatten([1, [2, 3, [4]]], true);
-     * // => [1, 2, 3, 4]
+     * _.flattenDepth(array, 1);
+     * // => [1, 2, [3, [4]], 5]
+     *
+     * _.flattenDepth(array, 2);
+     * // => [1, 2, 3, [4], 5]
      */
-    function flatten(array, isDeep, guard) {
-      var length = array ? array.length : 0;
-      if (guard && isIterateeCall(array, isDeep, guard)) {
-        isDeep = false;
+    function flattenDepth(array, depth) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return [];
       }
-      return length ? baseFlatten(array, isDeep) : [];
+      depth = depth === undefined ? 1 : toInteger(depth);
+      return baseFlatten(array, depth);
     }
 
     /**
-     * Recursively flattens a nested array.
+     * The inverse of `_.toPairs`; this method returns an object composed
+     * from key-value `pairs`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Array
-     * @param {Array} array The array to recursively flatten.
-     * @returns {Array} Returns the new flattened array.
+     * @param {Array} pairs The key-value pairs.
+     * @returns {Object} Returns the new object.
      * @example
      *
-     * _.flattenDeep([1, [2, 3, [4]]]);
-     * // => [1, 2, 3, 4]
+     * _.fromPairs([['a', 1], ['b', 2]]);
+     * // => { 'a': 1, 'b': 2 }
      */
-    function flattenDeep(array) {
-      var length = array ? array.length : 0;
-      return length ? baseFlatten(array, true) : [];
+    function fromPairs(pairs) {
+      var index = -1,
+          length = pairs == null ? 0 : pairs.length,
+          result = {};
+
+      while (++index < length) {
+        var pair = pairs[index];
+        result[pair[0]] = pair[1];
+      }
+      return result;
+    }
+
+    /**
+     * Gets the first element of `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @alias first
+     * @category Array
+     * @param {Array} array The array to query.
+     * @returns {*} Returns the first element of `array`.
+     * @example
+     *
+     * _.head([1, 2, 3]);
+     * // => 1
+     *
+     * _.head([]);
+     * // => undefined
+     */
+    function head(array) {
+      return (array && array.length) ? array[0] : undefined;
     }
 
     /**
      * Gets the index at which the first occurrence of `value` is found in `array`
-     * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
-     * for equality comparisons. If `fromIndex` is negative, it is used as the offset
-     * from the end of `array`. If `array` is sorted providing `true` for `fromIndex`
-     * performs a faster binary search.
+     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons. If `fromIndex` is negative, it's used as the
+     * offset from the end of `array`.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
-     * @param {Array} array The array to search.
+     * @param {Array} array The array to inspect.
      * @param {*} value The value to search for.
-     * @param {boolean|number} [fromIndex=0] The index to search from or `true`
-     *  to perform a binary search on a sorted array.
+     * @param {number} [fromIndex=0] The index to search from.
      * @returns {number} Returns the index of the matched value, else `-1`.
      * @example
      *
      * _.indexOf([1, 2, 1, 2], 2);
      * // => 1
      *
-     * // using `fromIndex`
+     * // Search from the `fromIndex`.
      * _.indexOf([1, 2, 1, 2], 2, 2);
      * // => 3
-     *
-     * // performing a binary search
-     * _.indexOf([1, 1, 2, 2], 2, true);
-     * // => 2
      */
     function indexOf(array, value, fromIndex) {
-      var length = array ? array.length : 0;
+      var length = array == null ? 0 : array.length;
       if (!length) {
         return -1;
       }
-      if (typeof fromIndex == 'number') {
-        fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : fromIndex;
-      } else if (fromIndex) {
-        var index = binaryIndex(array, value);
-        if (index < length &&
-            (value === value ? (value === array[index]) : (array[index] !== array[index]))) {
-          return index;
-        }
-        return -1;
+      var index = fromIndex == null ? 0 : toInteger(fromIndex);
+      if (index < 0) {
+        index = nativeMax(length + index, 0);
       }
-      return baseIndexOf(array, value, fromIndex || 0);
+      return baseIndexOf(array, value, index);
     }
 
     /**
@@ -12925,6 +12776,7 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
      * @param {Array} array The array to query.
      * @returns {Array} Returns the slice of `array`.
@@ -12934,65 +12786,130 @@ module.exports = ClipperLib;
      * // => [1, 2]
      */
     function initial(array) {
-      return dropRight(array, 1);
+      var length = array == null ? 0 : array.length;
+      return length ? baseSlice(array, 0, -1) : [];
     }
 
     /**
-     * Creates an array of unique values that are included in all of the provided
-     * arrays using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
-     * for equality comparisons.
+     * Creates an array of unique values that are included in all given arrays
+     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons. The order and references of result values are
+     * determined by the first array.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
      * @param {...Array} [arrays] The arrays to inspect.
-     * @returns {Array} Returns the new array of shared values.
+     * @returns {Array} Returns the new array of intersecting values.
      * @example
-     * _.intersection([1, 2], [4, 2], [2, 1]);
+     *
+     * _.intersection([2, 1], [2, 3]);
      * // => [2]
      */
-    var intersection = restParam(function(arrays) {
-      var othLength = arrays.length,
-          othIndex = othLength,
-          caches = Array(length),
-          indexOf = getIndexOf(),
-          isCommon = indexOf == baseIndexOf,
-          result = [];
+    var intersection = baseRest(function(arrays) {
+      var mapped = arrayMap(arrays, castArrayLikeObject);
+      return (mapped.length && mapped[0] === arrays[0])
+        ? baseIntersection(mapped)
+        : [];
+    });
 
-      while (othIndex--) {
-        var value = arrays[othIndex] = isArrayLike(value = arrays[othIndex]) ? value : [];
-        caches[othIndex] = (isCommon && value.length >= 120) ? createCache(othIndex && value) : null;
-      }
-      var array = arrays[0],
-          index = -1,
-          length = array ? array.length : 0,
-          seen = caches[0];
+    /**
+     * This method is like `_.intersection` except that it accepts `iteratee`
+     * which is invoked for each element of each `arrays` to generate the criterion
+     * by which they're compared. The order and references of result values are
+     * determined by the first array. The iteratee is invoked with one argument:
+     * (value).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new array of intersecting values.
+     * @example
+     *
+     * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);
+     * // => [2.1]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
+     * // => [{ 'x': 1 }]
+     */
+    var intersectionBy = baseRest(function(arrays) {
+      var iteratee = last(arrays),
+          mapped = arrayMap(arrays, castArrayLikeObject);
 
-      outer:
-      while (++index < length) {
-        value = array[index];
-        if ((seen ? cacheIndexOf(seen, value) : indexOf(result, value, 0)) < 0) {
-          var othIndex = othLength;
-          while (--othIndex) {
-            var cache = caches[othIndex];
-            if ((cache ? cacheIndexOf(cache, value) : indexOf(arrays[othIndex], value, 0)) < 0) {
-              continue outer;
-            }
-          }
-          if (seen) {
-            seen.push(value);
-          }
-          result.push(value);
-        }
+      if (iteratee === last(mapped)) {
+        iteratee = undefined;
+      } else {
+        mapped.pop();
       }
-      return result;
+      return (mapped.length && mapped[0] === arrays[0])
+        ? baseIntersection(mapped, getIteratee(iteratee, 2))
+        : [];
+    });
+
+    /**
+     * This method is like `_.intersection` except that it accepts `comparator`
+     * which is invoked to compare elements of `arrays`. The order and references
+     * of result values are determined by the first array. The comparator is
+     * invoked with two arguments: (arrVal, othVal).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of intersecting values.
+     * @example
+     *
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     *
+     * _.intersectionWith(objects, others, _.isEqual);
+     * // => [{ 'x': 1, 'y': 2 }]
+     */
+    var intersectionWith = baseRest(function(arrays) {
+      var comparator = last(arrays),
+          mapped = arrayMap(arrays, castArrayLikeObject);
+
+      comparator = typeof comparator == 'function' ? comparator : undefined;
+      if (comparator) {
+        mapped.pop();
+      }
+      return (mapped.length && mapped[0] === arrays[0])
+        ? baseIntersection(mapped, undefined, comparator)
+        : [];
     });
 
+    /**
+     * Converts all elements in `array` into a string separated by `separator`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to convert.
+     * @param {string} [separator=','] The element separator.
+     * @returns {string} Returns the joined string.
+     * @example
+     *
+     * _.join(['a', 'b', 'c'], '~');
+     * // => 'a~b~c'
+     */
+    function join(array, separator) {
+      return array == null ? '' : nativeJoin.call(array, separator);
+    }
+
     /**
      * Gets the last element of `array`.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
      * @param {Array} array The array to query.
      * @returns {*} Returns the last element of `array`.
@@ -13002,7 +12919,7 @@ module.exports = ClipperLib;
      * // => 3
      */
     function last(array) {
-      var length = array ? array.length : 0;
+      var length = array == null ? 0 : array.length;
       return length ? array[length - 1] : undefined;
     }
 
@@ -13012,153 +12929,219 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
-     * @param {Array} array The array to search.
+     * @param {Array} array The array to inspect.
      * @param {*} value The value to search for.
-     * @param {boolean|number} [fromIndex=array.length-1] The index to search from
-     *  or `true` to perform a binary search on a sorted array.
+     * @param {number} [fromIndex=array.length-1] The index to search from.
      * @returns {number} Returns the index of the matched value, else `-1`.
      * @example
      *
      * _.lastIndexOf([1, 2, 1, 2], 2);
      * // => 3
      *
-     * // using `fromIndex`
+     * // Search from the `fromIndex`.
      * _.lastIndexOf([1, 2, 1, 2], 2, 2);
      * // => 1
-     *
-     * // performing a binary search
-     * _.lastIndexOf([1, 1, 2, 2], 2, true);
-     * // => 3
      */
     function lastIndexOf(array, value, fromIndex) {
-      var length = array ? array.length : 0;
+      var length = array == null ? 0 : array.length;
       if (!length) {
         return -1;
       }
       var index = length;
-      if (typeof fromIndex == 'number') {
-        index = (fromIndex < 0 ? nativeMax(length + fromIndex, 0) : nativeMin(fromIndex || 0, length - 1)) + 1;
-      } else if (fromIndex) {
-        index = binaryIndex(array, value, true) - 1;
-        var other = array[index];
-        if (value === value ? (value === other) : (other !== other)) {
-          return index;
-        }
-        return -1;
-      }
-      if (value !== value) {
-        return indexOfNaN(array, index, true);
-      }
-      while (index--) {
-        if (array[index] === value) {
-          return index;
-        }
+      if (fromIndex !== undefined) {
+        index = toInteger(fromIndex);
+        index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);
       }
-      return -1;
+      return value === value
+        ? strictLastIndexOf(array, value, index)
+        : baseFindIndex(array, baseIsNaN, index, true);
+    }
+
+    /**
+     * Gets the element at index `n` of `array`. If `n` is negative, the nth
+     * element from the end is returned.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.11.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {number} [n=0] The index of the element to return.
+     * @returns {*} Returns the nth element of `array`.
+     * @example
+     *
+     * var array = ['a', 'b', 'c', 'd'];
+     *
+     * _.nth(array, 1);
+     * // => 'b'
+     *
+     * _.nth(array, -2);
+     * // => 'c';
+     */
+    function nth(array, n) {
+      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;
     }
 
     /**
-     * Removes all provided values from `array` using
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
+     * Removes all given values from `array` using
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
      * for equality comparisons.
      *
-     * **Note:** Unlike `_.without`, this method mutates `array`.
+     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`
+     * to remove elements from an array by predicate.
      *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @category Array
      * @param {Array} array The array to modify.
      * @param {...*} [values] The values to remove.
      * @returns {Array} Returns `array`.
      * @example
      *
-     * var array = [1, 2, 3, 1, 2, 3];
+     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];
      *
-     * _.pull(array, 2, 3);
+     * _.pull(array, 'a', 'c');
      * console.log(array);
-     * // => [1, 1]
+     * // => ['b', 'b']
      */
-    function pull() {
-      var args = arguments,
-          array = args[0];
+    var pull = baseRest(pullAll);
 
-      if (!(array && array.length)) {
-        return array;
-      }
-      var index = 0,
-          indexOf = getIndexOf(),
-          length = args.length;
+    /**
+     * This method is like `_.pull` except that it accepts an array of values to remove.
+     *
+     * **Note:** Unlike `_.difference`, this method mutates `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @param {Array} values The values to remove.
+     * @returns {Array} Returns `array`.
+     * @example
+     *
+     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];
+     *
+     * _.pullAll(array, ['a', 'c']);
+     * console.log(array);
+     * // => ['b', 'b']
+     */
+    function pullAll(array, values) {
+      return (array && array.length && values && values.length)
+        ? basePullAll(array, values)
+        : array;
+    }
 
-      while (++index < length) {
-        var fromIndex = 0,
-            value = args[index];
+    /**
+     * This method is like `_.pullAll` except that it accepts `iteratee` which is
+     * invoked for each element of `array` and `values` to generate the criterion
+     * by which they're compared. The iteratee is invoked with one argument: (value).
+     *
+     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @param {Array} values The values to remove.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns `array`.
+     * @example
+     *
+     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];
+     *
+     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');
+     * console.log(array);
+     * // => [{ 'x': 2 }]
+     */
+    function pullAllBy(array, values, iteratee) {
+      return (array && array.length && values && values.length)
+        ? basePullAll(array, values, getIteratee(iteratee, 2))
+        : array;
+    }
 
-        while ((fromIndex = indexOf(array, value, fromIndex)) > -1) {
-          splice.call(array, fromIndex, 1);
-        }
-      }
-      return array;
+    /**
+     * This method is like `_.pullAll` except that it accepts `comparator` which
+     * is invoked to compare elements of `array` to `values`. The comparator is
+     * invoked with two arguments: (arrVal, othVal).
+     *
+     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.6.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @param {Array} values The values to remove.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns `array`.
+     * @example
+     *
+     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];
+     *
+     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);
+     * console.log(array);
+     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]
+     */
+    function pullAllWith(array, values, comparator) {
+      return (array && array.length && values && values.length)
+        ? basePullAll(array, values, undefined, comparator)
+        : array;
     }
 
     /**
-     * Removes elements from `array` corresponding to the given indexes and returns
-     * an array of the removed elements. Indexes may be specified as an array of
-     * indexes or as individual arguments.
+     * Removes elements from `array` corresponding to `indexes` and returns an
+     * array of removed elements.
      *
      * **Note:** Unlike `_.at`, this method mutates `array`.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Array
      * @param {Array} array The array to modify.
-     * @param {...(number|number[])} [indexes] The indexes of elements to remove,
-     *  specified as individual indexes or arrays of indexes.
+     * @param {...(number|number[])} [indexes] The indexes of elements to remove.
      * @returns {Array} Returns the new array of removed elements.
      * @example
      *
-     * var array = [5, 10, 15, 20];
-     * var evens = _.pullAt(array, 1, 3);
+     * var array = ['a', 'b', 'c', 'd'];
+     * var pulled = _.pullAt(array, [1, 3]);
      *
      * console.log(array);
-     * // => [5, 15]
+     * // => ['a', 'c']
      *
-     * console.log(evens);
-     * // => [10, 20]
+     * console.log(pulled);
+     * // => ['b', 'd']
      */
-    var pullAt = restParam(function(array, indexes) {
-      indexes = baseFlatten(indexes);
+    var pullAt = flatRest(function(array, indexes) {
+      var length = array == null ? 0 : array.length,
+          result = baseAt(array, indexes);
+
+      basePullAt(array, arrayMap(indexes, function(index) {
+        return isIndex(index, length) ? +index : index;
+      }).sort(compareAscending));
 
-      var result = baseAt(array, indexes);
-      basePullAt(array, indexes.sort(baseCompareAscending));
       return result;
     });
 
     /**
      * Removes all elements from `array` that `predicate` returns truthy for
-     * and returns an array of the removed elements. The predicate is bound to
-     * `thisArg` and invoked with three arguments: (value, index, array).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
+     * and returns an array of the removed elements. The predicate is invoked
+     * with three arguments: (value, index, array).
      *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
-     *
-     * **Note:** Unlike `_.filter`, this method mutates `array`.
+     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`
+     * to pull elements from an array by value.
      *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @category Array
      * @param {Array} array The array to modify.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
      * @returns {Array} Returns the new array of removed elements.
      * @example
      *
@@ -13173,7 +13156,7 @@ module.exports = ClipperLib;
      * console.log(evens);
      * // => [2, 4]
      */
-    function remove(array, predicate, thisArg) {
+    function remove(array, predicate) {
       var result = [];
       if (!(array && array.length)) {
         return result;
@@ -13182,7 +13165,7 @@ module.exports = ClipperLib;
           indexes = [],
           length = array.length;
 
-      predicate = getCallback(predicate, thisArg, 3);
+      predicate = getIteratee(predicate, 3);
       while (++index < length) {
         var value = array[index];
         if (predicate(value, index, array)) {
@@ -13195,31 +13178,42 @@ module.exports = ClipperLib;
     }
 
     /**
-     * Gets all but the first element of `array`.
+     * Reverses `array` so that the first element becomes the last, the second
+     * element becomes the second to last, and so on.
+     *
+     * **Note:** This method mutates `array` and is based on
+     * [`Array#reverse`](https://mdn.io/Array/reverse).
      *
      * @static
      * @memberOf _
-     * @alias tail
+     * @since 4.0.0
      * @category Array
-     * @param {Array} array The array to query.
-     * @returns {Array} Returns the slice of `array`.
+     * @param {Array} array The array to modify.
+     * @returns {Array} Returns `array`.
      * @example
      *
-     * _.rest([1, 2, 3]);
-     * // => [2, 3]
+     * var array = [1, 2, 3];
+     *
+     * _.reverse(array);
+     * // => [3, 2, 1]
+     *
+     * console.log(array);
+     * // => [3, 2, 1]
      */
-    function rest(array) {
-      return drop(array, 1);
+    function reverse(array) {
+      return array == null ? array : nativeReverse.call(array);
     }
 
     /**
      * Creates a slice of `array` from `start` up to, but not including, `end`.
      *
-     * **Note:** This method is used instead of `Array#slice` to support node
-     * lists in IE < 9 and to ensure dense arrays are returned.
+     * **Note:** This method is used instead of
+     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are
+     * returned.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Array
      * @param {Array} array The array to slice.
      * @param {number} [start=0] The start position.
@@ -13227,7 +13221,7 @@ module.exports = ClipperLib;
      * @returns {Array} Returns the slice of `array`.
      */
     function slice(array, start, end) {
-      var length = array ? array.length : 0;
+      var length = array == null ? 0 : array.length;
       if (!length) {
         return [];
       }
@@ -13235,58 +13229,89 @@ module.exports = ClipperLib;
         start = 0;
         end = length;
       }
+      else {
+        start = start == null ? 0 : toInteger(start);
+        end = end === undefined ? length : toInteger(end);
+      }
       return baseSlice(array, start, end);
     }
 
     /**
-     * Uses a binary search to determine the lowest index at which `value` should
-     * be inserted into `array` in order to maintain its sort order. If an iteratee
-     * function is provided it is invoked for `value` and each element of `array`
-     * to compute their sort ranking. The iteratee is bound to `thisArg` and
-     * invoked with one argument; (value).
-     *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * Uses a binary search to determine the lowest index at which `value`
+     * should be inserted into `array` in order to maintain its sort order.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
      * @param {Array} array The sorted array to inspect.
      * @param {*} value The value to evaluate.
-     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
      * @returns {number} Returns the index at which `value` should be inserted
      *  into `array`.
      * @example
      *
      * _.sortedIndex([30, 50], 40);
      * // => 1
+     */
+    function sortedIndex(array, value) {
+      return baseSortedIndex(array, value);
+    }
+
+    /**
+     * This method is like `_.sortedIndex` except that it accepts `iteratee`
+     * which is invoked for `value` and each element of `array` to compute their
+     * sort ranking. The iteratee is invoked with one argument: (value).
      *
-     * _.sortedIndex([4, 4, 5, 5], 5);
-     * // => 2
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
+     * @example
      *
-     * var dict = { 'data': { 'thirty': 30, 'forty': 40, 'fifty': 50 } };
+     * var objects = [{ 'x': 4 }, { 'x': 5 }];
      *
-     * // using an iteratee function
-     * _.sortedIndex(['thirty', 'fifty'], 'forty', function(word) {
-     *   return this.data[word];
-     * }, dict);
-     * // => 1
+     * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });
+     * // => 0
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.sortedIndexBy(objects, { 'x': 4 }, 'x');
+     * // => 0
+     */
+    function sortedIndexBy(array, value, iteratee) {
+      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));
+    }
+
+    /**
+     * This method is like `_.indexOf` except that it performs a binary
+     * search on a sorted `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {*} value The value to search for.
+     * @returns {number} Returns the index of the matched value, else `-1`.
+     * @example
      *
-     * // using the `_.property` callback shorthand
-     * _.sortedIndex([{ 'x': 30 }, { 'x': 50 }], { 'x': 40 }, 'x');
+     * _.sortedIndexOf([4, 5, 5, 5, 6], 5);
      * // => 1
      */
-    var sortedIndex = createSortedIndex();
+    function sortedIndexOf(array, value) {
+      var length = array == null ? 0 : array.length;
+      if (length) {
+        var index = baseSortedIndex(array, value);
+        if (index < length && eq(array[index], value)) {
+          return index;
+        }
+      }
+      return -1;
+    }
 
     /**
      * This method is like `_.sortedIndex` except that it returns the highest
@@ -13295,122 +13320,220 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Array
      * @param {Array} array The sorted array to inspect.
      * @param {*} value The value to evaluate.
-     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
      * @returns {number} Returns the index at which `value` should be inserted
      *  into `array`.
      * @example
      *
-     * _.sortedLastIndex([4, 4, 5, 5], 5);
+     * _.sortedLastIndex([4, 5, 5, 5, 6], 5);
      * // => 4
      */
-    var sortedLastIndex = createSortedIndex(true);
+    function sortedLastIndex(array, value) {
+      return baseSortedIndex(array, value, true);
+    }
 
     /**
-     * Creates a slice of `array` with `n` elements taken from the beginning.
+     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`
+     * which is invoked for `value` and each element of `array` to compute their
+     * sort ranking. The iteratee is invoked with one argument: (value).
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Array
-     * @param {Array} array The array to query.
-     * @param {number} [n=1] The number of elements to take.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
-     * @returns {Array} Returns the slice of `array`.
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
      * @example
      *
-     * _.take([1, 2, 3]);
-     * // => [1]
-     *
-     * _.take([1, 2, 3], 2);
-     * // => [1, 2]
+     * var objects = [{ 'x': 4 }, { 'x': 5 }];
      *
-     * _.take([1, 2, 3], 5);
-     * // => [1, 2, 3]
+     * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });
+     * // => 1
      *
-     * _.take([1, 2, 3], 0);
-     * // => []
+     * // The `_.property` iteratee shorthand.
+     * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');
+     * // => 1
      */
-    function take(array, n, guard) {
-      var length = array ? array.length : 0;
-      if (!length) {
-        return [];
-      }
-      if (guard ? isIterateeCall(array, n, guard) : n == null) {
-        n = 1;
-      }
-      return baseSlice(array, 0, n < 0 ? 0 : n);
+    function sortedLastIndexBy(array, value, iteratee) {
+      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);
     }
 
     /**
-     * Creates a slice of `array` with `n` elements taken from the end.
+     * This method is like `_.lastIndexOf` except that it performs a binary
+     * search on a sorted `array`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Array
-     * @param {Array} array The array to query.
-     * @param {number} [n=1] The number of elements to take.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
-     * @returns {Array} Returns the slice of `array`.
+     * @param {Array} array The array to inspect.
+     * @param {*} value The value to search for.
+     * @returns {number} Returns the index of the matched value, else `-1`.
      * @example
      *
-     * _.takeRight([1, 2, 3]);
-     * // => [3]
-     *
-     * _.takeRight([1, 2, 3], 2);
-     * // => [2, 3]
-     *
-     * _.takeRight([1, 2, 3], 5);
-     * // => [1, 2, 3]
-     *
-     * _.takeRight([1, 2, 3], 0);
-     * // => []
+     * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);
+     * // => 3
      */
-    function takeRight(array, n, guard) {
-      var length = array ? array.length : 0;
-      if (!length) {
-        return [];
-      }
-      if (guard ? isIterateeCall(array, n, guard) : n == null) {
-        n = 1;
+    function sortedLastIndexOf(array, value) {
+      var length = array == null ? 0 : array.length;
+      if (length) {
+        var index = baseSortedIndex(array, value, true) - 1;
+        if (eq(array[index], value)) {
+          return index;
+        }
       }
-      n = length - (+n || 0);
-      return baseSlice(array, n < 0 ? 0 : n);
+      return -1;
     }
 
     /**
-     * Creates a slice of `array` with elements taken from the end. Elements are
-     * taken until `predicate` returns falsey. The predicate is bound to `thisArg`
-     * and invoked with three arguments: (value, index, array).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * This method is like `_.uniq` except that it's designed and optimized
+     * for sorted arrays.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Array
-     * @param {Array} array The array to query.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
-     * @returns {Array} Returns the slice of `array`.
+     * @param {Array} array The array to inspect.
+     * @returns {Array} Returns the new duplicate free array.
      * @example
      *
-     * _.takeRightWhile([1, 2, 3], function(n) {
-     *   return n > 1;
-     * });
-     * // => [2, 3]
+     * _.sortedUniq([1, 1, 2]);
+     * // => [1, 2]
+     */
+    function sortedUniq(array) {
+      return (array && array.length)
+        ? baseSortedUniq(array)
+        : [];
+    }
+
+    /**
+     * This method is like `_.uniqBy` except that it's designed and optimized
+     * for sorted arrays.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @returns {Array} Returns the new duplicate free array.
+     * @example
+     *
+     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);
+     * // => [1.1, 2.3]
+     */
+    function sortedUniqBy(array, iteratee) {
+      return (array && array.length)
+        ? baseSortedUniq(array, getIteratee(iteratee, 2))
+        : [];
+    }
+
+    /**
+     * Gets all but the first element of `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * _.tail([1, 2, 3]);
+     * // => [2, 3]
+     */
+    function tail(array) {
+      var length = array == null ? 0 : array.length;
+      return length ? baseSlice(array, 1, length) : [];
+    }
+
+    /**
+     * Creates a slice of `array` with `n` elements taken from the beginning.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {number} [n=1] The number of elements to take.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * _.take([1, 2, 3]);
+     * // => [1]
+     *
+     * _.take([1, 2, 3], 2);
+     * // => [1, 2]
+     *
+     * _.take([1, 2, 3], 5);
+     * // => [1, 2, 3]
+     *
+     * _.take([1, 2, 3], 0);
+     * // => []
+     */
+    function take(array, n, guard) {
+      if (!(array && array.length)) {
+        return [];
+      }
+      n = (guard || n === undefined) ? 1 : toInteger(n);
+      return baseSlice(array, 0, n < 0 ? 0 : n);
+    }
+
+    /**
+     * Creates a slice of `array` with `n` elements taken from the end.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {number} [n=1] The number of elements to take.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * _.takeRight([1, 2, 3]);
+     * // => [3]
+     *
+     * _.takeRight([1, 2, 3], 2);
+     * // => [2, 3]
+     *
+     * _.takeRight([1, 2, 3], 5);
+     * // => [1, 2, 3]
+     *
+     * _.takeRight([1, 2, 3], 0);
+     * // => []
+     */
+    function takeRight(array, n, guard) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return [];
+      }
+      n = (guard || n === undefined) ? 1 : toInteger(n);
+      n = length - n;
+      return baseSlice(array, n < 0 ? 0 : n, length);
+    }
+
+    /**
+     * Creates a slice of `array` with elements taken from the end. Elements are
+     * taken until `predicate` returns falsey. The predicate is invoked with
+     * three arguments: (value, index, array).
+     *
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
      *
      * var users = [
      *   { 'user': 'barney',  'active': true },
@@ -13418,164 +13541,218 @@ module.exports = ClipperLib;
      *   { 'user': 'pebbles', 'active': false }
      * ];
      *
-     * // using the `_.matches` callback shorthand
-     * _.pluck(_.takeRightWhile(users, { 'user': 'pebbles', 'active': false }), 'user');
-     * // => ['pebbles']
+     * _.takeRightWhile(users, function(o) { return !o.active; });
+     * // => objects for ['fred', 'pebbles']
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.pluck(_.takeRightWhile(users, 'active', false), 'user');
-     * // => ['fred', 'pebbles']
+     * // The `_.matches` iteratee shorthand.
+     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });
+     * // => objects for ['pebbles']
      *
-     * // using the `_.property` callback shorthand
-     * _.pluck(_.takeRightWhile(users, 'active'), 'user');
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.takeRightWhile(users, ['active', false]);
+     * // => objects for ['fred', 'pebbles']
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.takeRightWhile(users, 'active');
      * // => []
      */
-    function takeRightWhile(array, predicate, thisArg) {
+    function takeRightWhile(array, predicate) {
       return (array && array.length)
-        ? baseWhile(array, getCallback(predicate, thisArg, 3), false, true)
+        ? baseWhile(array, getIteratee(predicate, 3), false, true)
         : [];
     }
 
     /**
      * Creates a slice of `array` with elements taken from the beginning. Elements
-     * are taken until `predicate` returns falsey. The predicate is bound to
-     * `thisArg` and invoked with three arguments: (value, index, array).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * are taken until `predicate` returns falsey. The predicate is invoked with
+     * three arguments: (value, index, array).
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Array
      * @param {Array} array The array to query.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
      * @returns {Array} Returns the slice of `array`.
      * @example
      *
-     * _.takeWhile([1, 2, 3], function(n) {
-     *   return n < 3;
-     * });
-     * // => [1, 2]
-     *
      * var users = [
      *   { 'user': 'barney',  'active': false },
-     *   { 'user': 'fred',    'active': false},
+     *   { 'user': 'fred',    'active': false },
      *   { 'user': 'pebbles', 'active': true }
      * ];
      *
-     * // using the `_.matches` callback shorthand
-     * _.pluck(_.takeWhile(users, { 'user': 'barney', 'active': false }), 'user');
-     * // => ['barney']
+     * _.takeWhile(users, function(o) { return !o.active; });
+     * // => objects for ['barney', 'fred']
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.pluck(_.takeWhile(users, 'active', false), 'user');
-     * // => ['barney', 'fred']
+     * // The `_.matches` iteratee shorthand.
+     * _.takeWhile(users, { 'user': 'barney', 'active': false });
+     * // => objects for ['barney']
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.takeWhile(users, ['active', false]);
+     * // => objects for ['barney', 'fred']
      *
-     * // using the `_.property` callback shorthand
-     * _.pluck(_.takeWhile(users, 'active'), 'user');
+     * // The `_.property` iteratee shorthand.
+     * _.takeWhile(users, 'active');
      * // => []
      */
-    function takeWhile(array, predicate, thisArg) {
+    function takeWhile(array, predicate) {
       return (array && array.length)
-        ? baseWhile(array, getCallback(predicate, thisArg, 3))
+        ? baseWhile(array, getIteratee(predicate, 3))
         : [];
     }
 
     /**
-     * Creates an array of unique values, in order, from all of the provided arrays
-     * using [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
+     * Creates an array of unique values, in order, from all given arrays using
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
      * for equality comparisons.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
      * @param {...Array} [arrays] The arrays to inspect.
      * @returns {Array} Returns the new array of combined values.
      * @example
      *
-     * _.union([1, 2], [4, 2], [2, 1]);
-     * // => [1, 2, 4]
+     * _.union([2], [1, 2]);
+     * // => [2, 1]
      */
-    var union = restParam(function(arrays) {
-      return baseUniq(baseFlatten(arrays, false, true));
+    var union = baseRest(function(arrays) {
+      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));
     });
 
     /**
-     * Creates a duplicate-free version of an array, using
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
-     * for equality comparisons, in which only the first occurence of each element
-     * is kept. Providing `true` for `isSorted` performs a faster search algorithm
-     * for sorted arrays. If an iteratee function is provided it is invoked for
-     * each element in the array to generate the criterion by which uniqueness
-     * is computed. The `iteratee` is bound to `thisArg` and invoked with three
-     * arguments: (value, index, array).
+     * This method is like `_.union` except that it accepts `iteratee` which is
+     * invoked for each element of each `arrays` to generate the criterion by
+     * which uniqueness is computed. Result values are chosen from the first
+     * array in which the value occurs. The iteratee is invoked with one argument:
+     * (value).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new array of combined values.
+     * @example
+     *
+     * _.unionBy([2.1], [1.2, 2.3], Math.floor);
+     * // => [2.1, 1.2]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
+     * // => [{ 'x': 1 }, { 'x': 2 }]
+     */
+    var unionBy = baseRest(function(arrays) {
+      var iteratee = last(arrays);
+      if (isArrayLikeObject(iteratee)) {
+        iteratee = undefined;
+      }
+      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));
+    });
+
+    /**
+     * This method is like `_.union` except that it accepts `comparator` which
+     * is invoked to compare elements of `arrays`. Result values are chosen from
+     * the first array in which the value occurs. The comparator is invoked
+     * with two arguments: (arrVal, othVal).
      *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of combined values.
+     * @example
      *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
      *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * _.unionWith(objects, others, _.isEqual);
+     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
+     */
+    var unionWith = baseRest(function(arrays) {
+      var comparator = last(arrays);
+      comparator = typeof comparator == 'function' ? comparator : undefined;
+      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);
+    });
+
+    /**
+     * Creates a duplicate-free version of an array, using
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons, in which only the first occurrence of each element
+     * is kept. The order of result values is determined by the order they occur
+     * in the array.
      *
      * @static
      * @memberOf _
-     * @alias unique
+     * @since 0.1.0
      * @category Array
      * @param {Array} array The array to inspect.
-     * @param {boolean} [isSorted] Specify the array is sorted.
-     * @param {Function|Object|string} [iteratee] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
-     * @returns {Array} Returns the new duplicate-value-free array.
+     * @returns {Array} Returns the new duplicate free array.
      * @example
      *
      * _.uniq([2, 1, 2]);
      * // => [2, 1]
+     */
+    function uniq(array) {
+      return (array && array.length) ? baseUniq(array) : [];
+    }
+
+    /**
+     * This method is like `_.uniq` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the criterion by which
+     * uniqueness is computed. The order of result values is determined by the
+     * order they occur in the array. The iteratee is invoked with one argument:
+     * (value).
      *
-     * // using `isSorted`
-     * _.uniq([1, 1, 2], true);
-     * // => [1, 2]
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new duplicate free array.
+     * @example
      *
-     * // using an iteratee function
-     * _.uniq([1, 2.5, 1.5, 2], function(n) {
-     *   return this.floor(n);
-     * }, Math);
-     * // => [1, 2.5]
+     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);
+     * // => [2.1, 1.2]
      *
-     * // using the `_.property` callback shorthand
-     * _.uniq([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
+     * // The `_.property` iteratee shorthand.
+     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
      * // => [{ 'x': 1 }, { 'x': 2 }]
      */
-    function uniq(array, isSorted, iteratee, thisArg) {
-      var length = array ? array.length : 0;
-      if (!length) {
-        return [];
-      }
-      if (isSorted != null && typeof isSorted != 'boolean') {
-        thisArg = iteratee;
-        iteratee = isIterateeCall(array, isSorted, thisArg) ? undefined : isSorted;
-        isSorted = false;
-      }
-      var callback = getCallback();
-      if (!(iteratee == null && callback === baseCallback)) {
-        iteratee = callback(iteratee, thisArg, 3);
-      }
-      return (isSorted && getIndexOf() == baseIndexOf)
-        ? sortedUniq(array, iteratee)
-        : baseUniq(array, iteratee);
+    function uniqBy(array, iteratee) {
+      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];
+    }
+
+    /**
+     * This method is like `_.uniq` except that it accepts `comparator` which
+     * is invoked to compare elements of `array`. The order of result values is
+     * determined by the order they occur in the array.The comparator is invoked
+     * with two arguments: (arrVal, othVal).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new duplicate free array.
+     * @example
+     *
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     *
+     * _.uniqWith(objects, _.isEqual);
+     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]
+     */
+    function uniqWith(array, comparator) {
+      comparator = typeof comparator == 'function' ? comparator : undefined;
+      return (array && array.length) ? baseUniq(array, undefined, comparator) : [];
     }
 
     /**
@@ -13585,48 +13762,46 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 1.2.0
      * @category Array
      * @param {Array} array The array of grouped elements to process.
      * @returns {Array} Returns the new array of regrouped elements.
      * @example
      *
-     * var zipped = _.zip(['fred', 'barney'], [30, 40], [true, false]);
-     * // => [['fred', 30, true], ['barney', 40, false]]
+     * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);
+     * // => [['a', 1, true], ['b', 2, false]]
      *
      * _.unzip(zipped);
-     * // => [['fred', 'barney'], [30, 40], [true, false]]
+     * // => [['a', 'b'], [1, 2], [true, false]]
      */
     function unzip(array) {
       if (!(array && array.length)) {
         return [];
       }
-      var index = -1,
-          length = 0;
-
+      var length = 0;
       array = arrayFilter(array, function(group) {
-        if (isArrayLike(group)) {
+        if (isArrayLikeObject(group)) {
           length = nativeMax(group.length, length);
           return true;
         }
       });
-      var result = Array(length);
-      while (++index < length) {
-        result[index] = arrayMap(array, baseProperty(index));
-      }
-      return result;
+      return baseTimes(length, function(index) {
+        return arrayMap(array, baseProperty(index));
+      });
     }
 
     /**
-     * This method is like `_.unzip` except that it accepts an iteratee to specify
-     * how regrouped values should be combined. The `iteratee` is bound to `thisArg`
-     * and invoked with four arguments: (accumulator, value, index, group).
+     * This method is like `_.unzip` except that it accepts `iteratee` to specify
+     * how regrouped values should be combined. The iteratee is invoked with the
+     * elements of each group: (...group).
      *
      * @static
      * @memberOf _
+     * @since 3.8.0
      * @category Array
      * @param {Array} array The array of grouped elements to process.
-     * @param {Function} [iteratee] The function to combine regrouped values.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Function} [iteratee=_.identity] The function to combine
+     *  regrouped values.
      * @returns {Array} Returns the new array of regrouped elements.
      * @example
      *
@@ -13636,170 +13811,221 @@ module.exports = ClipperLib;
      * _.unzipWith(zipped, _.add);
      * // => [3, 30, 300]
      */
-    function unzipWith(array, iteratee, thisArg) {
-      var length = array ? array.length : 0;
-      if (!length) {
+    function unzipWith(array, iteratee) {
+      if (!(array && array.length)) {
         return [];
       }
       var result = unzip(array);
       if (iteratee == null) {
         return result;
       }
-      iteratee = bindCallback(iteratee, thisArg, 4);
       return arrayMap(result, function(group) {
-        return arrayReduce(group, iteratee, undefined, true);
+        return apply(iteratee, undefined, group);
       });
     }
 
     /**
-     * Creates an array excluding all provided values using
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
+     * Creates an array excluding all given values using
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
      * for equality comparisons.
      *
+     * **Note:** Unlike `_.pull`, this method returns a new array.
+     *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
-     * @param {Array} array The array to filter.
+     * @param {Array} array The array to inspect.
      * @param {...*} [values] The values to exclude.
      * @returns {Array} Returns the new array of filtered values.
+     * @see _.difference, _.xor
      * @example
      *
-     * _.without([1, 2, 1, 3], 1, 2);
+     * _.without([2, 1, 2, 3], 1, 2);
      * // => [3]
      */
-    var without = restParam(function(array, values) {
-      return isArrayLike(array)
+    var without = baseRest(function(array, values) {
+      return isArrayLikeObject(array)
         ? baseDifference(array, values)
         : [];
     });
 
     /**
-     * Creates an array of unique values that is the [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)
-     * of the provided arrays.
+     * Creates an array of unique values that is the
+     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)
+     * of the given arrays. The order of result values is determined by the order
+     * they occur in the arrays.
      *
      * @static
      * @memberOf _
+     * @since 2.4.0
      * @category Array
      * @param {...Array} [arrays] The arrays to inspect.
-     * @returns {Array} Returns the new array of values.
+     * @returns {Array} Returns the new array of filtered values.
+     * @see _.difference, _.without
      * @example
      *
-     * _.xor([1, 2], [4, 2]);
-     * // => [1, 4]
+     * _.xor([2, 1], [2, 3]);
+     * // => [1, 3]
      */
-    function xor() {
-      var index = -1,
-          length = arguments.length;
+    var xor = baseRest(function(arrays) {
+      return baseXor(arrayFilter(arrays, isArrayLikeObject));
+    });
 
-      while (++index < length) {
-        var array = arguments[index];
-        if (isArrayLike(array)) {
-          var result = result
-            ? arrayPush(baseDifference(result, array), baseDifference(array, result))
-            : array;
-        }
+    /**
+     * This method is like `_.xor` except that it accepts `iteratee` which is
+     * invoked for each element of each `arrays` to generate the criterion by
+     * which by which they're compared. The order of result values is determined
+     * by the order they occur in the arrays. The iteratee is invoked with one
+     * argument: (value).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     * @example
+     *
+     * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);
+     * // => [1.2, 3.4]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
+     * // => [{ 'x': 2 }]
+     */
+    var xorBy = baseRest(function(arrays) {
+      var iteratee = last(arrays);
+      if (isArrayLikeObject(iteratee)) {
+        iteratee = undefined;
       }
-      return result ? baseUniq(result) : [];
-    }
+      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));
+    });
+
+    /**
+     * This method is like `_.xor` except that it accepts `comparator` which is
+     * invoked to compare elements of `arrays`. The order of result values is
+     * determined by the order they occur in the arrays. The comparator is invoked
+     * with two arguments: (arrVal, othVal).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     * @example
+     *
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     *
+     * _.xorWith(objects, others, _.isEqual);
+     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
+     */
+    var xorWith = baseRest(function(arrays) {
+      var comparator = last(arrays);
+      comparator = typeof comparator == 'function' ? comparator : undefined;
+      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);
+    });
 
     /**
-     * Creates an array of grouped elements, the first of which contains the first
-     * elements of the given arrays, the second of which contains the second elements
-     * of the given arrays, and so on.
+     * Creates an array of grouped elements, the first of which contains the
+     * first elements of the given arrays, the second of which contains the
+     * second elements of the given arrays, and so on.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Array
      * @param {...Array} [arrays] The arrays to process.
      * @returns {Array} Returns the new array of grouped elements.
      * @example
      *
-     * _.zip(['fred', 'barney'], [30, 40], [true, false]);
-     * // => [['fred', 30, true], ['barney', 40, false]]
+     * _.zip(['a', 'b'], [1, 2], [true, false]);
+     * // => [['a', 1, true], ['b', 2, false]]
      */
-    var zip = restParam(unzip);
+    var zip = baseRest(unzip);
 
     /**
-     * The inverse of `_.pairs`; this method returns an object composed from arrays
-     * of property names and values. Provide either a single two dimensional array,
-     * e.g. `[[key1, value1], [key2, value2]]` or two arrays, one of property names
-     * and one of corresponding values.
+     * This method is like `_.fromPairs` except that it accepts two arrays,
+     * one of property identifiers and one of corresponding values.
      *
      * @static
      * @memberOf _
-     * @alias object
+     * @since 0.4.0
      * @category Array
-     * @param {Array} props The property names.
+     * @param {Array} [props=[]] The property identifiers.
      * @param {Array} [values=[]] The property values.
      * @returns {Object} Returns the new object.
      * @example
      *
-     * _.zipObject([['fred', 30], ['barney', 40]]);
-     * // => { 'fred': 30, 'barney': 40 }
-     *
-     * _.zipObject(['fred', 'barney'], [30, 40]);
-     * // => { 'fred': 30, 'barney': 40 }
+     * _.zipObject(['a', 'b'], [1, 2]);
+     * // => { 'a': 1, 'b': 2 }
      */
     function zipObject(props, values) {
-      var index = -1,
-          length = props ? props.length : 0,
-          result = {};
+      return baseZipObject(props || [], values || [], assignValue);
+    }
 
-      if (length && !values && !isArray(props[0])) {
-        values = [];
-      }
-      while (++index < length) {
-        var key = props[index];
-        if (values) {
-          result[key] = values[index];
-        } else if (key) {
-          result[key[0]] = key[1];
-        }
-      }
-      return result;
+    /**
+     * This method is like `_.zipObject` except that it supports property paths.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.1.0
+     * @category Array
+     * @param {Array} [props=[]] The property identifiers.
+     * @param {Array} [values=[]] The property values.
+     * @returns {Object} Returns the new object.
+     * @example
+     *
+     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);
+     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }
+     */
+    function zipObjectDeep(props, values) {
+      return baseZipObject(props || [], values || [], baseSet);
     }
 
     /**
-     * This method is like `_.zip` except that it accepts an iteratee to specify
-     * how grouped values should be combined. The `iteratee` is bound to `thisArg`
-     * and invoked with four arguments: (accumulator, value, index, group).
+     * This method is like `_.zip` except that it accepts `iteratee` to specify
+     * how grouped values should be combined. The iteratee is invoked with the
+     * elements of each group: (...group).
      *
      * @static
      * @memberOf _
+     * @since 3.8.0
      * @category Array
      * @param {...Array} [arrays] The arrays to process.
-     * @param {Function} [iteratee] The function to combine grouped values.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Function} [iteratee=_.identity] The function to combine
+     *  grouped values.
      * @returns {Array} Returns the new array of grouped elements.
      * @example
      *
-     * _.zipWith([1, 2], [10, 20], [100, 200], _.add);
+     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {
+     *   return a + b + c;
+     * });
      * // => [111, 222]
      */
-    var zipWith = restParam(function(arrays) {
+    var zipWith = baseRest(function(arrays) {
       var length = arrays.length,
-          iteratee = length > 2 ? arrays[length - 2] : undefined,
-          thisArg = length > 1 ? arrays[length - 1] : undefined;
+          iteratee = length > 1 ? arrays[length - 1] : undefined;
 
-      if (length > 2 && typeof iteratee == 'function') {
-        length -= 2;
-      } else {
-        iteratee = (length > 1 && typeof thisArg == 'function') ? (--length, thisArg) : undefined;
-        thisArg = undefined;
-      }
-      arrays.length = length;
-      return unzipWith(arrays, iteratee, thisArg);
+      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;
+      return unzipWith(arrays, iteratee);
     });
 
     /*------------------------------------------------------------------------*/
 
     /**
-     * Creates a `lodash` object that wraps `value` with explicit method
-     * chaining enabled.
+     * Creates a `lodash` wrapper instance that wraps `value` with explicit method
+     * chain sequences enabled. The result of such sequences must be unwrapped
+     * with `_#value`.
      *
      * @static
      * @memberOf _
-     * @category Chain
+     * @since 1.3.0
+     * @category Seq
      * @param {*} value The value to wrap.
      * @returns {Object} Returns the new `lodash` wrapper instance.
      * @example
@@ -13810,12 +14036,13 @@ module.exports = ClipperLib;
      *   { 'user': 'pebbles', 'age': 1 }
      * ];
      *
-     * var youngest = _.chain(users)
+     * var youngest = _
+     *   .chain(users)
      *   .sortBy('age')
-     *   .map(function(chr) {
-     *     return chr.user + ' is ' + chr.age;
+     *   .map(function(o) {
+     *     return o.user + ' is ' + o.age;
      *   })
-     *   .first()
+     *   .head()
      *   .value();
      * // => 'pebbles is 1'
      */
@@ -13826,42 +14053,44 @@ module.exports = ClipperLib;
     }
 
     /**
-     * This method invokes `interceptor` and returns `value`. The interceptor is
-     * bound to `thisArg` and invoked with one argument; (value). The purpose of
-     * this method is to "tap into" a method chain in order to perform operations
-     * on intermediate results within the chain.
+     * This method invokes `interceptor` and returns `value`. The interceptor
+     * is invoked with one argument; (value). The purpose of this method is to
+     * "tap into" a method chain sequence in order to modify intermediate results.
      *
      * @static
      * @memberOf _
-     * @category Chain
+     * @since 0.1.0
+     * @category Seq
      * @param {*} value The value to provide to `interceptor`.
      * @param {Function} interceptor The function to invoke.
-     * @param {*} [thisArg] The `this` binding of `interceptor`.
      * @returns {*} Returns `value`.
      * @example
      *
      * _([1, 2, 3])
      *  .tap(function(array) {
+     *    // Mutate input array.
      *    array.pop();
      *  })
      *  .reverse()
      *  .value();
      * // => [2, 1]
      */
-    function tap(value, interceptor, thisArg) {
-      interceptor.call(thisArg, value);
+    function tap(value, interceptor) {
+      interceptor(value);
       return value;
     }
 
     /**
      * This method is like `_.tap` except that it returns the result of `interceptor`.
+     * The purpose of this method is to "pass thru" values replacing intermediate
+     * results in a method chain sequence.
      *
      * @static
      * @memberOf _
-     * @category Chain
+     * @since 3.0.0
+     * @category Seq
      * @param {*} value The value to provide to `interceptor`.
      * @param {Function} interceptor The function to invoke.
-     * @param {*} [thisArg] The `this` binding of `interceptor`.
      * @returns {*} Returns the result of `interceptor`.
      * @example
      *
@@ -13874,16 +14103,57 @@ module.exports = ClipperLib;
      *  .value();
      * // => ['abc']
      */
-    function thru(value, interceptor, thisArg) {
-      return interceptor.call(thisArg, value);
+    function thru(value, interceptor) {
+      return interceptor(value);
     }
 
     /**
-     * Enables explicit method chaining on the wrapper object.
+     * This method is the wrapper version of `_.at`.
+     *
+     * @name at
+     * @memberOf _
+     * @since 1.0.0
+     * @category Seq
+     * @param {...(string|string[])} [paths] The property paths to pick.
+     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @example
+     *
+     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };
+     *
+     * _(object).at(['a[0].b.c', 'a[1]']).value();
+     * // => [3, 4]
+     */
+    var wrapperAt = flatRest(function(paths) {
+      var length = paths.length,
+          start = length ? paths[0] : 0,
+          value = this.__wrapped__,
+          interceptor = function(object) { return baseAt(object, paths); };
+
+      if (length > 1 || this.__actions__.length ||
+          !(value instanceof LazyWrapper) || !isIndex(start)) {
+        return this.thru(interceptor);
+      }
+      value = value.slice(start, +start + (length ? 1 : 0));
+      value.__actions__.push({
+        'func': thru,
+        'args': [interceptor],
+        'thisArg': undefined
+      });
+      return new LodashWrapper(value, this.__chain__).thru(function(array) {
+        if (length && !array.length) {
+          array.push(undefined);
+        }
+        return array;
+      });
+    });
+
+    /**
+     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.
      *
      * @name chain
      * @memberOf _
-     * @category Chain
+     * @since 0.1.0
+     * @category Seq
      * @returns {Object} Returns the new `lodash` wrapper instance.
      * @example
      *
@@ -13892,13 +14162,14 @@ module.exports = ClipperLib;
      *   { 'user': 'fred',   'age': 40 }
      * ];
      *
-     * // without explicit chaining
-     * _(users).first();
+     * // A sequence without explicit chaining.
+     * _(users).head();
      * // => { 'user': 'barney', 'age': 36 }
      *
-     * // with explicit chaining
-     * _(users).chain()
-     *   .first()
+     * // A sequence with explicit chaining.
+     * _(users)
+     *   .chain()
+     *   .head()
      *   .pick('user')
      *   .value();
      * // => { 'user': 'barney' }
@@ -13908,11 +14179,12 @@ module.exports = ClipperLib;
     }
 
     /**
-     * Executes the chained sequence and returns the wrapped result.
+     * Executes the chain sequence and returns the wrapped result.
      *
      * @name commit
      * @memberOf _
-     * @category Chain
+     * @since 3.2.0
+     * @category Seq
      * @returns {Object} Returns the new `lodash` wrapper instance.
      * @example
      *
@@ -13937,50 +14209,78 @@ module.exports = ClipperLib;
     }
 
     /**
-     * Creates a new array joining a wrapped array with any additional arrays
-     * and/or values.
+     * Gets the next value on a wrapped object following the
+     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).
      *
-     * @name concat
+     * @name next
      * @memberOf _
-     * @category Chain
-     * @param {...*} [values] The values to concatenate.
-     * @returns {Array} Returns the new concatenated array.
+     * @since 4.0.0
+     * @category Seq
+     * @returns {Object} Returns the next iterator value.
      * @example
      *
-     * var array = [1];
-     * var wrapped = _(array).concat(2, [3], [[4]]);
+     * var wrapped = _([1, 2]);
      *
-     * console.log(wrapped.value());
-     * // => [1, 2, 3, [4]]
+     * wrapped.next();
+     * // => { 'done': false, 'value': 1 }
      *
-     * console.log(array);
-     * // => [1]
+     * wrapped.next();
+     * // => { 'done': false, 'value': 2 }
+     *
+     * wrapped.next();
+     * // => { 'done': true, 'value': undefined }
      */
-    var wrapperConcat = restParam(function(values) {
-      values = baseFlatten(values);
-      return this.thru(function(array) {
-        return arrayConcat(isArray(array) ? array : [toObject(array)], values);
-      });
-    });
+    function wrapperNext() {
+      if (this.__values__ === undefined) {
+        this.__values__ = toArray(this.value());
+      }
+      var done = this.__index__ >= this.__values__.length,
+          value = done ? undefined : this.__values__[this.__index__++];
+
+      return { 'done': done, 'value': value };
+    }
+
+    /**
+     * Enables the wrapper to be iterable.
+     *
+     * @name Symbol.iterator
+     * @memberOf _
+     * @since 4.0.0
+     * @category Seq
+     * @returns {Object} Returns the wrapper object.
+     * @example
+     *
+     * var wrapped = _([1, 2]);
+     *
+     * wrapped[Symbol.iterator]() === wrapped;
+     * // => true
+     *
+     * Array.from(wrapped);
+     * // => [1, 2]
+     */
+    function wrapperToIterator() {
+      return this;
+    }
 
     /**
-     * Creates a clone of the chained sequence planting `value` as the wrapped value.
+     * Creates a clone of the chain sequence planting `value` as the wrapped value.
      *
      * @name plant
      * @memberOf _
-     * @category Chain
+     * @since 3.2.0
+     * @category Seq
+     * @param {*} value The value to plant.
      * @returns {Object} Returns the new `lodash` wrapper instance.
      * @example
      *
-     * var array = [1, 2];
-     * var wrapped = _(array).map(function(value) {
-     *   return Math.pow(value, 2);
-     * });
+     * function square(n) {
+     *   return n * n;
+     * }
      *
-     * var other = [3, 4];
-     * var otherWrapped = wrapped.plant(other);
+     * var wrapped = _([1, 2]).map(square);
+     * var other = wrapped.plant([3, 4]);
      *
-     * otherWrapped.value();
+     * other.value();
      * // => [9, 16]
      *
      * wrapped.value();
@@ -13992,6 +14292,8 @@ module.exports = ClipperLib;
 
       while (parent instanceof baseLodash) {
         var clone = wrapperClone(parent);
+        clone.__index__ = 0;
+        clone.__values__ = undefined;
         if (result) {
           previous.__wrapped__ = clone;
         } else {
@@ -14005,15 +14307,15 @@ module.exports = ClipperLib;
     }
 
     /**
-     * Reverses the wrapped array so the first element becomes the last, the
-     * second element becomes the second to last, and so on.
+     * This method is the wrapper version of `_.reverse`.
      *
      * **Note:** This method mutates the wrapped array.
      *
      * @name reverse
      * @memberOf _
-     * @category Chain
-     * @returns {Object} Returns the new reversed `lodash` wrapper instance.
+     * @since 0.1.0
+     * @category Seq
+     * @returns {Object} Returns the new `lodash` wrapper instance.
      * @example
      *
      * var array = [1, 2, 3];
@@ -14026,45 +14328,30 @@ module.exports = ClipperLib;
      */
     function wrapperReverse() {
       var value = this.__wrapped__;
-
-      var interceptor = function(value) {
-        return (wrapped && wrapped.__dir__ < 0) ? value : value.reverse();
-      };
       if (value instanceof LazyWrapper) {
         var wrapped = value;
         if (this.__actions__.length) {
           wrapped = new LazyWrapper(this);
         }
         wrapped = wrapped.reverse();
-        wrapped.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });
+        wrapped.__actions__.push({
+          'func': thru,
+          'args': [reverse],
+          'thisArg': undefined
+        });
         return new LodashWrapper(wrapped, this.__chain__);
       }
-      return this.thru(interceptor);
-    }
-
-    /**
-     * Produces the result of coercing the unwrapped value to a string.
-     *
-     * @name toString
-     * @memberOf _
-     * @category Chain
-     * @returns {string} Returns the coerced string value.
-     * @example
-     *
-     * _([1, 2, 3]).toString();
-     * // => '1,2,3'
-     */
-    function wrapperToString() {
-      return (this.value() + '');
+      return this.thru(reverse);
     }
 
     /**
-     * Executes the chained sequence to extract the unwrapped value.
+     * Executes the chain sequence to resolve the unwrapped value.
      *
      * @name value
      * @memberOf _
-     * @alias run, toJSON, valueOf
-     * @category Chain
+     * @since 0.1.0
+     * @alias toJSON, valueOf
+     * @category Seq
      * @returns {*} Returns the resolved unwrapped value.
      * @example
      *
@@ -14077,99 +14364,53 @@ module.exports = ClipperLib;
 
     /*------------------------------------------------------------------------*/
 
-    /**
-     * Creates an array of elements corresponding to the given keys, or indexes,
-     * of `collection`. Keys may be specified as individual arguments or as arrays
-     * of keys.
-     *
-     * @static
-     * @memberOf _
-     * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {...(number|number[]|string|string[])} [props] The property names
-     *  or indexes of elements to pick, specified individually or in arrays.
-     * @returns {Array} Returns the new array of picked elements.
-     * @example
-     *
-     * _.at(['a', 'b', 'c'], [0, 2]);
-     * // => ['a', 'c']
-     *
-     * _.at(['barney', 'fred', 'pebbles'], 0, 2);
-     * // => ['barney', 'pebbles']
-     */
-    var at = restParam(function(collection, props) {
-      return baseAt(collection, baseFlatten(props));
-    });
-
     /**
      * Creates an object composed of keys generated from the results of running
-     * each element of `collection` through `iteratee`. The corresponding value
-     * of each key is the number of times the key was returned by `iteratee`.
-     * The `iteratee` is bound to `thisArg` and invoked with three arguments:
-     * (value, index|key, collection).
-     *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * each element of `collection` thru `iteratee`. The corresponding value of
+     * each key is the number of times the key was returned by `iteratee`. The
+     * iteratee is invoked with one argument: (value).
      *
      * @static
      * @memberOf _
+     * @since 0.5.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
      * @returns {Object} Returns the composed aggregate object.
      * @example
      *
-     * _.countBy([4.3, 6.1, 6.4], function(n) {
-     *   return Math.floor(n);
-     * });
-     * // => { '4': 1, '6': 2 }
-     *
-     * _.countBy([4.3, 6.1, 6.4], function(n) {
-     *   return this.floor(n);
-     * }, Math);
+     * _.countBy([6.1, 4.2, 6.3], Math.floor);
      * // => { '4': 1, '6': 2 }
      *
+     * // The `_.property` iteratee shorthand.
      * _.countBy(['one', 'two', 'three'], 'length');
      * // => { '3': 2, '5': 1 }
      */
     var countBy = createAggregator(function(result, value, key) {
-      hasOwnProperty.call(result, key) ? ++result[key] : (result[key] = 1);
+      if (hasOwnProperty.call(result, key)) {
+        ++result[key];
+      } else {
+        baseAssignValue(result, key, 1);
+      }
     });
 
     /**
      * Checks if `predicate` returns truthy for **all** elements of `collection`.
-     * The predicate is bound to `thisArg` and invoked with three arguments:
-     * (value, index|key, collection).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
+     * Iteration is stopped once `predicate` returns falsey. The predicate is
+     * invoked with three arguments: (value, index|key, collection).
      *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * **Note:** This method returns `true` for
+     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because
+     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of
+     * elements of empty collections.
      *
      * @static
      * @memberOf _
-     * @alias all
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {boolean} Returns `true` if all elements pass the predicate check,
      *  else `false`.
      * @example
@@ -14178,112 +14419,84 @@ module.exports = ClipperLib;
      * // => false
      *
      * var users = [
-     *   { 'user': 'barney', 'active': false },
-     *   { 'user': 'fred',   'active': false }
+     *   { 'user': 'barney', 'age': 36, 'active': false },
+     *   { 'user': 'fred',   'age': 40, 'active': false }
      * ];
      *
-     * // using the `_.matches` callback shorthand
+     * // The `_.matches` iteratee shorthand.
      * _.every(users, { 'user': 'barney', 'active': false });
      * // => false
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.every(users, 'active', false);
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.every(users, ['active', false]);
      * // => true
      *
-     * // using the `_.property` callback shorthand
+     * // The `_.property` iteratee shorthand.
      * _.every(users, 'active');
      * // => false
      */
-    function every(collection, predicate, thisArg) {
+    function every(collection, predicate, guard) {
       var func = isArray(collection) ? arrayEvery : baseEvery;
-      if (thisArg && isIterateeCall(collection, predicate, thisArg)) {
+      if (guard && isIterateeCall(collection, predicate, guard)) {
         predicate = undefined;
       }
-      if (typeof predicate != 'function' || thisArg !== undefined) {
-        predicate = getCallback(predicate, thisArg, 3);
-      }
-      return func(collection, predicate);
+      return func(collection, getIteratee(predicate, 3));
     }
 
     /**
      * Iterates over elements of `collection`, returning an array of all elements
-     * `predicate` returns truthy for. The predicate is bound to `thisArg` and
-     * invoked with three arguments: (value, index|key, collection).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
+     * `predicate` returns truthy for. The predicate is invoked with three
+     * arguments: (value, index|key, collection).
      *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * **Note:** Unlike `_.remove`, this method returns a new array.
      *
      * @static
      * @memberOf _
-     * @alias select
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
      * @returns {Array} Returns the new filtered array.
+     * @see _.reject
      * @example
      *
-     * _.filter([4, 5, 6], function(n) {
-     *   return n % 2 == 0;
-     * });
-     * // => [4, 6]
-     *
      * var users = [
      *   { 'user': 'barney', 'age': 36, 'active': true },
      *   { 'user': 'fred',   'age': 40, 'active': false }
      * ];
      *
-     * // using the `_.matches` callback shorthand
-     * _.pluck(_.filter(users, { 'age': 36, 'active': true }), 'user');
-     * // => ['barney']
+     * _.filter(users, function(o) { return !o.active; });
+     * // => objects for ['fred']
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.pluck(_.filter(users, 'active', false), 'user');
-     * // => ['fred']
+     * // The `_.matches` iteratee shorthand.
+     * _.filter(users, { 'age': 36, 'active': true });
+     * // => objects for ['barney']
      *
-     * // using the `_.property` callback shorthand
-     * _.pluck(_.filter(users, 'active'), 'user');
-     * // => ['barney']
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.filter(users, ['active', false]);
+     * // => objects for ['fred']
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.filter(users, 'active');
+     * // => objects for ['barney']
      */
-    function filter(collection, predicate, thisArg) {
+    function filter(collection, predicate) {
       var func = isArray(collection) ? arrayFilter : baseFilter;
-      predicate = getCallback(predicate, thisArg, 3);
-      return func(collection, predicate);
+      return func(collection, getIteratee(predicate, 3));
     }
 
     /**
      * Iterates over elements of `collection`, returning the first element
-     * `predicate` returns truthy for. The predicate is bound to `thisArg` and
-     * invoked with three arguments: (value, index|key, collection).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * `predicate` returns truthy for. The predicate is invoked with three
+     * arguments: (value, index|key, collection).
      *
      * @static
      * @memberOf _
-     * @alias detect
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to search.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Array|Object} collection The collection to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param {number} [fromIndex=0] The index to search from.
      * @returns {*} Returns the matched element, else `undefined`.
      * @example
      *
@@ -14293,24 +14506,22 @@ module.exports = ClipperLib;
      *   { 'user': 'pebbles', 'age': 1,  'active': true }
      * ];
      *
-     * _.result(_.find(users, function(chr) {
-     *   return chr.age < 40;
-     * }), 'user');
-     * // => 'barney'
+     * _.find(users, function(o) { return o.age < 40; });
+     * // => object for 'barney'
      *
-     * // using the `_.matches` callback shorthand
-     * _.result(_.find(users, { 'age': 1, 'active': true }), 'user');
-     * // => 'pebbles'
+     * // The `_.matches` iteratee shorthand.
+     * _.find(users, { 'age': 1, 'active': true });
+     * // => object for 'pebbles'
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.result(_.find(users, 'active', false), 'user');
-     * // => 'fred'
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.find(users, ['active', false]);
+     * // => object for 'fred'
      *
-     * // using the `_.property` callback shorthand
-     * _.result(_.find(users, 'active'), 'user');
-     * // => 'barney'
+     * // The `_.property` iteratee shorthand.
+     * _.find(users, 'active');
+     * // => object for 'barney'
      */
-    var find = createFind(baseEach);
+    var find = createFind(findIndex);
 
     /**
      * This method is like `_.find` except that it iterates over elements of
@@ -14318,11 +14529,11 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to search.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Array|Object} collection The collection to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param {number} [fromIndex=collection.length-1] The index to search from.
      * @returns {*} Returns the matched element, else `undefined`.
      * @example
      *
@@ -14331,72 +14542,117 @@ module.exports = ClipperLib;
      * });
      * // => 3
      */
-    var findLast = createFind(baseEachRight, true);
+    var findLast = createFind(findLastIndex);
 
     /**
-     * Performs a deep comparison between each element in `collection` and the
-     * source object, returning the first element that has equivalent property
-     * values.
+     * Creates a flattened array of values by running each element in `collection`
+     * thru `iteratee` and flattening the mapped results. The iteratee is invoked
+     * with three arguments: (value, index|key, collection).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the new flattened array.
+     * @example
      *
-     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
-     * numbers, `Object` objects, regexes, and strings. Objects are compared by
-     * their own, not inherited, enumerable properties. For comparing a single
-     * own or inherited property value see `_.matchesProperty`.
+     * function duplicate(n) {
+     *   return [n, n];
+     * }
+     *
+     * _.flatMap([1, 2], duplicate);
+     * // => [1, 1, 2, 2]
+     */
+    function flatMap(collection, iteratee) {
+      return baseFlatten(map(collection, iteratee), 1);
+    }
+
+    /**
+     * This method is like `_.flatMap` except that it recursively flattens the
+     * mapped results.
      *
      * @static
      * @memberOf _
+     * @since 4.7.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to search.
-     * @param {Object} source The object of property values to match.
-     * @returns {*} Returns the matched element, else `undefined`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the new flattened array.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36, 'active': true },
-     *   { 'user': 'fred',   'age': 40, 'active': false }
-     * ];
+     * function duplicate(n) {
+     *   return [[[n, n]]];
+     * }
      *
-     * _.result(_.findWhere(users, { 'age': 36, 'active': true }), 'user');
-     * // => 'barney'
+     * _.flatMapDeep([1, 2], duplicate);
+     * // => [1, 1, 2, 2]
+     */
+    function flatMapDeep(collection, iteratee) {
+      return baseFlatten(map(collection, iteratee), INFINITY);
+    }
+
+    /**
+     * This method is like `_.flatMap` except that it recursively flattens the
+     * mapped results up to `depth` times.
      *
-     * _.result(_.findWhere(users, { 'age': 40, 'active': false }), 'user');
-     * // => 'fred'
+     * @static
+     * @memberOf _
+     * @since 4.7.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @param {number} [depth=1] The maximum recursion depth.
+     * @returns {Array} Returns the new flattened array.
+     * @example
+     *
+     * function duplicate(n) {
+     *   return [[[n, n]]];
+     * }
+     *
+     * _.flatMapDepth([1, 2], duplicate, 2);
+     * // => [[1, 1], [2, 2]]
      */
-    function findWhere(collection, source) {
-      return find(collection, baseMatches(source));
+    function flatMapDepth(collection, iteratee, depth) {
+      depth = depth === undefined ? 1 : toInteger(depth);
+      return baseFlatten(map(collection, iteratee), depth);
     }
 
     /**
-     * Iterates over elements of `collection` invoking `iteratee` for each element.
-     * The `iteratee` is bound to `thisArg` and invoked with three arguments:
-     * (value, index|key, collection). Iteratee functions may exit iteration early
-     * by explicitly returning `false`.
+     * Iterates over elements of `collection` and invokes `iteratee` for each element.
+     * The iteratee is invoked with three arguments: (value, index|key, collection).
+     * Iteratee functions may exit iteration early by explicitly returning `false`.
      *
-     * **Note:** As with other "Collections" methods, objects with a "length" property
-     * are iterated like arrays. To avoid this behavior `_.forIn` or `_.forOwn`
-     * may be used for object iteration.
+     * **Note:** As with other "Collections" methods, objects with a "length"
+     * property are iterated like arrays. To avoid this behavior use `_.forIn`
+     * or `_.forOwn` for object iteration.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @alias each
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
+     * @param {Array|Object} collection The collection to iterate over.
      * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
-     * @returns {Array|Object|string} Returns `collection`.
+     * @returns {Array|Object} Returns `collection`.
+     * @see _.forEachRight
      * @example
      *
-     * _([1, 2]).forEach(function(n) {
-     *   console.log(n);
-     * }).value();
-     * // => logs each value from left to right and returns the array
+     * _.forEach([1, 2], function(value) {
+     *   console.log(value);
+     * });
+     * // => Logs `1` then `2`.
      *
-     * _.forEach({ 'a': 1, 'b': 2 }, function(n, key) {
-     *   console.log(n, key);
+     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {
+     *   console.log(key);
      * });
-     * // => logs each value-key pair and returns the object (iteration order is not guaranteed)
+     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
      */
-    var forEach = createForEach(arrayEach, baseEach);
+    function forEach(collection, iteratee) {
+      var func = isArray(collection) ? arrayEach : baseEach;
+      return func(collection, getIteratee(iteratee, 3));
+    }
 
     /**
      * This method is like `_.forEach` except that it iterates over elements of
@@ -14404,60 +14660,45 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @alias eachRight
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
+     * @param {Array|Object} collection The collection to iterate over.
      * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
-     * @returns {Array|Object|string} Returns `collection`.
+     * @returns {Array|Object} Returns `collection`.
+     * @see _.forEach
      * @example
      *
-     * _([1, 2]).forEachRight(function(n) {
-     *   console.log(n);
-     * }).value();
-     * // => logs each value from right to left and returns the array
+     * _.forEachRight([1, 2], function(value) {
+     *   console.log(value);
+     * });
+     * // => Logs `2` then `1`.
      */
-    var forEachRight = createForEach(arrayEachRight, baseEachRight);
+    function forEachRight(collection, iteratee) {
+      var func = isArray(collection) ? arrayEachRight : baseEachRight;
+      return func(collection, getIteratee(iteratee, 3));
+    }
 
     /**
      * Creates an object composed of keys generated from the results of running
-     * each element of `collection` through `iteratee`. The corresponding value
-     * of each key is an array of the elements responsible for generating the key.
-     * The `iteratee` is bound to `thisArg` and invoked with three arguments:
-     * (value, index|key, collection).
-     *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * each element of `collection` thru `iteratee`. The order of grouped values
+     * is determined by the order they occur in `collection`. The corresponding
+     * value of each key is an array of elements responsible for generating the
+     * key. The iteratee is invoked with one argument: (value).
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
      * @returns {Object} Returns the composed aggregate object.
      * @example
      *
-     * _.groupBy([4.2, 6.1, 6.4], function(n) {
-     *   return Math.floor(n);
-     * });
-     * // => { '4': [4.2], '6': [6.1, 6.4] }
-     *
-     * _.groupBy([4.2, 6.1, 6.4], function(n) {
-     *   return this.floor(n);
-     * }, Math);
-     * // => { '4': [4.2], '6': [6.1, 6.4] }
+     * _.groupBy([6.1, 4.2, 6.3], Math.floor);
+     * // => { '4': [4.2], '6': [6.1, 6.3] }
      *
-     * // using the `_.property` callback shorthand
+     * // The `_.property` iteratee shorthand.
      * _.groupBy(['one', 'two', 'three'], 'length');
      * // => { '3': ['one', 'two'], '5': ['three'] }
      */
@@ -14465,25 +14706,26 @@ module.exports = ClipperLib;
       if (hasOwnProperty.call(result, key)) {
         result[key].push(value);
       } else {
-        result[key] = [value];
+        baseAssignValue(result, key, [value]);
       }
     });
 
     /**
-     * Checks if `value` is in `collection` using
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/6.0/#sec-samevaluezero)
-     * for equality comparisons. If `fromIndex` is negative, it is used as the offset
-     * from the end of `collection`.
+     * Checks if `value` is in `collection`. If `collection` is a string, it's
+     * checked for a substring of `value`, otherwise
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * is used for equality comparisons. If `fromIndex` is negative, it's used as
+     * the offset from the end of `collection`.
      *
      * @static
      * @memberOf _
-     * @alias contains, include
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to search.
-     * @param {*} target The value to search for.
+     * @param {Array|Object|string} collection The collection to inspect.
+     * @param {*} value The value to search for.
      * @param {number} [fromIndex=0] The index to search from.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.reduce`.
-     * @returns {boolean} Returns `true` if a matching element is found, else `false`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.
+     * @returns {boolean} Returns `true` if `value` is found, else `false`.
      * @example
      *
      * _.includes([1, 2, 3], 1);
@@ -14492,303 +14734,264 @@ module.exports = ClipperLib;
      * _.includes([1, 2, 3], 1, 2);
      * // => false
      *
-     * _.includes({ 'user': 'fred', 'age': 40 }, 'fred');
+     * _.includes({ 'a': 1, 'b': 2 }, 1);
      * // => true
      *
-     * _.includes('pebbles', 'eb');
+     * _.includes('abcd', 'bc');
      * // => true
      */
-    function includes(collection, target, fromIndex, guard) {
-      var length = collection ? getLength(collection) : 0;
-      if (!isLength(length)) {
-        collection = values(collection);
-        length = collection.length;
-      }
-      if (typeof fromIndex != 'number' || (guard && isIterateeCall(target, fromIndex, guard))) {
-        fromIndex = 0;
-      } else {
-        fromIndex = fromIndex < 0 ? nativeMax(length + fromIndex, 0) : (fromIndex || 0);
+    function includes(collection, value, fromIndex, guard) {
+      collection = isArrayLike(collection) ? collection : values(collection);
+      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;
+
+      var length = collection.length;
+      if (fromIndex < 0) {
+        fromIndex = nativeMax(length + fromIndex, 0);
       }
-      return (typeof collection == 'string' || !isArray(collection) && isString(collection))
-        ? (fromIndex <= length && collection.indexOf(target, fromIndex) > -1)
-        : (!!length && getIndexOf(collection, target, fromIndex) > -1);
+      return isString(collection)
+        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)
+        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);
     }
 
-    /**
-     * Creates an object composed of keys generated from the results of running
-     * each element of `collection` through `iteratee`. The corresponding value
-     * of each key is the last element responsible for generating the key. The
-     * iteratee function is bound to `thisArg` and invoked with three arguments:
-     * (value, index|key, collection).
-     *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
-     *
-     * @static
-     * @memberOf _
-     * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
-     * @returns {Object} Returns the composed aggregate object.
-     * @example
-     *
-     * var keyData = [
-     *   { 'dir': 'left', 'code': 97 },
-     *   { 'dir': 'right', 'code': 100 }
-     * ];
-     *
-     * _.indexBy(keyData, 'dir');
-     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
-     *
-     * _.indexBy(keyData, function(object) {
-     *   return String.fromCharCode(object.code);
-     * });
-     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
-     *
-     * _.indexBy(keyData, function(object) {
-     *   return this.fromCharCode(object.code);
-     * }, String);
-     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
-     */
-    var indexBy = createAggregator(function(result, value, key) {
-      result[key] = value;
-    });
-
     /**
      * Invokes the method at `path` of each element in `collection`, returning
      * an array of the results of each invoked method. Any additional arguments
-     * are provided to each invoked method. If `methodName` is a function it is
-     * invoked for, and `this` bound to, each element in `collection`.
+     * are provided to each invoked method. If `path` is a function, it's invoked
+     * for, and `this` bound to, each element in `collection`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
+     * @param {Array|Object} collection The collection to iterate over.
      * @param {Array|Function|string} path The path of the method to invoke or
      *  the function invoked per iteration.
-     * @param {...*} [args] The arguments to invoke the method with.
+     * @param {...*} [args] The arguments to invoke each method with.
      * @returns {Array} Returns the array of results.
      * @example
      *
-     * _.invoke([[5, 1, 7], [3, 2, 1]], 'sort');
+     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');
      * // => [[1, 5, 7], [1, 2, 3]]
      *
-     * _.invoke([123, 456], String.prototype.split, '');
+     * _.invokeMap([123, 456], String.prototype.split, '');
      * // => [['1', '2', '3'], ['4', '5', '6']]
      */
-    var invoke = restParam(function(collection, path, args) {
+    var invokeMap = baseRest(function(collection, path, args) {
       var index = -1,
           isFunc = typeof path == 'function',
-          isProp = isKey(path),
           result = isArrayLike(collection) ? Array(collection.length) : [];
 
       baseEach(collection, function(value) {
-        var func = isFunc ? path : ((isProp && value != null) ? value[path] : undefined);
-        result[++index] = func ? func.apply(value, args) : invokePath(value, path, args);
+        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);
       });
       return result;
     });
 
     /**
-     * Creates an array of values by running each element in `collection` through
-     * `iteratee`. The `iteratee` is bound to `thisArg` and invoked with three
-     * arguments: (value, index|key, collection).
+     * Creates an object composed of keys generated from the results of running
+     * each element of `collection` thru `iteratee`. The corresponding value of
+     * each key is the last element responsible for generating the key. The
+     * iteratee is invoked with one argument: (value).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
+     * @returns {Object} Returns the composed aggregate object.
+     * @example
      *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
+     * var array = [
+     *   { 'dir': 'left', 'code': 97 },
+     *   { 'dir': 'right', 'code': 100 }
+     * ];
      *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
+     * _.keyBy(array, function(o) {
+     *   return String.fromCharCode(o.code);
+     * });
+     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
      *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * _.keyBy(array, 'dir');
+     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
+     */
+    var keyBy = createAggregator(function(result, value, key) {
+      baseAssignValue(result, key, value);
+    });
+
+    /**
+     * Creates an array of values by running each element in `collection` thru
+     * `iteratee`. The iteratee is invoked with three arguments:
+     * (value, index|key, collection).
      *
      * Many lodash methods are guarded to work as iteratees for methods like
      * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.
      *
      * The guarded methods are:
-     * `ary`, `callback`, `chunk`, `clone`, `create`, `curry`, `curryRight`,
-     * `drop`, `dropRight`, `every`, `fill`, `flatten`, `invert`, `max`, `min`,
-     * `parseInt`, `slice`, `sortBy`, `take`, `takeRight`, `template`, `trim`,
-     * `trimLeft`, `trimRight`, `trunc`, `random`, `range`, `sample`, `some`,
-     * `sum`, `uniq`, and `words`
+     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,
+     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,
+     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,
+     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`
      *
      * @static
      * @memberOf _
-     * @alias collect
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
      * @returns {Array} Returns the new mapped array.
      * @example
      *
-     * function timesThree(n) {
-     *   return n * 3;
+     * function square(n) {
+     *   return n * n;
      * }
      *
-     * _.map([1, 2], timesThree);
-     * // => [3, 6]
+     * _.map([4, 8], square);
+     * // => [16, 64]
      *
-     * _.map({ 'a': 1, 'b': 2 }, timesThree);
-     * // => [3, 6] (iteration order is not guaranteed)
+     * _.map({ 'a': 4, 'b': 8 }, square);
+     * // => [16, 64] (iteration order is not guaranteed)
      *
      * var users = [
      *   { 'user': 'barney' },
      *   { 'user': 'fred' }
      * ];
      *
-     * // using the `_.property` callback shorthand
+     * // The `_.property` iteratee shorthand.
      * _.map(users, 'user');
      * // => ['barney', 'fred']
      */
-    function map(collection, iteratee, thisArg) {
+    function map(collection, iteratee) {
       var func = isArray(collection) ? arrayMap : baseMap;
-      iteratee = getCallback(iteratee, thisArg, 3);
-      return func(collection, iteratee);
+      return func(collection, getIteratee(iteratee, 3));
     }
 
     /**
-     * Creates an array of elements split into two groups, the first of which
-     * contains elements `predicate` returns truthy for, while the second of which
-     * contains elements `predicate` returns falsey for. The predicate is bound
-     * to `thisArg` and invoked with three arguments: (value, index|key, collection).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * This method is like `_.sortBy` except that it allows specifying the sort
+     * orders of the iteratees to sort by. If `orders` is unspecified, all values
+     * are sorted in ascending order. Otherwise, specify an order of "desc" for
+     * descending or "asc" for ascending sort order of corresponding values.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
-     * @returns {Array} Returns the array of grouped elements.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]
+     *  The iteratees to sort by.
+     * @param {string[]} [orders] The sort orders of `iteratees`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.
+     * @returns {Array} Returns the new sorted array.
      * @example
      *
-     * _.partition([1, 2, 3], function(n) {
-     *   return n % 2;
-     * });
-     * // => [[1, 3], [2]]
-     *
-     * _.partition([1.2, 2.3, 3.4], function(n) {
-     *   return this.floor(n) % 2;
-     * }, Math);
-     * // => [[1.2, 3.4], [2.3]]
-     *
      * var users = [
-     *   { 'user': 'barney',  'age': 36, 'active': false },
-     *   { 'user': 'fred',    'age': 40, 'active': true },
-     *   { 'user': 'pebbles', 'age': 1,  'active': false }
+     *   { 'user': 'fred',   'age': 48 },
+     *   { 'user': 'barney', 'age': 34 },
+     *   { 'user': 'fred',   'age': 40 },
+     *   { 'user': 'barney', 'age': 36 }
      * ];
      *
-     * var mapper = function(array) {
-     *   return _.pluck(array, 'user');
-     * };
-     *
-     * // using the `_.matches` callback shorthand
-     * _.map(_.partition(users, { 'age': 1, 'active': false }), mapper);
-     * // => [['pebbles'], ['barney', 'fred']]
-     *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.map(_.partition(users, 'active', false), mapper);
-     * // => [['barney', 'pebbles'], ['fred']]
-     *
-     * // using the `_.property` callback shorthand
-     * _.map(_.partition(users, 'active'), mapper);
-     * // => [['fred'], ['barney', 'pebbles']]
+     * // Sort by `user` in ascending order and by `age` in descending order.
+     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);
+     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]
      */
-    var partition = createAggregator(function(result, value, key) {
-      result[key ? 0 : 1].push(value);
-    }, function() { return [[], []]; });
+    function orderBy(collection, iteratees, orders, guard) {
+      if (collection == null) {
+        return [];
+      }
+      if (!isArray(iteratees)) {
+        iteratees = iteratees == null ? [] : [iteratees];
+      }
+      orders = guard ? undefined : orders;
+      if (!isArray(orders)) {
+        orders = orders == null ? [] : [orders];
+      }
+      return baseOrderBy(collection, iteratees, orders);
+    }
 
     /**
-     * Gets the property value of `path` from all elements in `collection`.
+     * Creates an array of elements split into two groups, the first of which
+     * contains elements `predicate` returns truthy for, the second of which
+     * contains elements `predicate` returns falsey for. The predicate is
+     * invoked with one argument: (value).
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Array|string} path The path of the property to pluck.
-     * @returns {Array} Returns the property values.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the array of grouped elements.
      * @example
      *
      * var users = [
-     *   { 'user': 'barney', 'age': 36 },
-     *   { 'user': 'fred',   'age': 40 }
+     *   { 'user': 'barney',  'age': 36, 'active': false },
+     *   { 'user': 'fred',    'age': 40, 'active': true },
+     *   { 'user': 'pebbles', 'age': 1,  'active': false }
      * ];
      *
-     * _.pluck(users, 'user');
-     * // => ['barney', 'fred']
+     * _.partition(users, function(o) { return o.active; });
+     * // => objects for [['fred'], ['barney', 'pebbles']]
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.partition(users, { 'age': 1, 'active': false });
+     * // => objects for [['pebbles'], ['barney', 'fred']]
      *
-     * var userIndex = _.indexBy(users, 'user');
-     * _.pluck(userIndex, 'age');
-     * // => [36, 40] (iteration order is not guaranteed)
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.partition(users, ['active', false]);
+     * // => objects for [['barney', 'pebbles'], ['fred']]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.partition(users, 'active');
+     * // => objects for [['fred'], ['barney', 'pebbles']]
      */
-    function pluck(collection, path) {
-      return map(collection, property(path));
-    }
+    var partition = createAggregator(function(result, value, key) {
+      result[key ? 0 : 1].push(value);
+    }, function() { return [[], []]; });
 
     /**
      * Reduces `collection` to a value which is the accumulated result of running
-     * each element in `collection` through `iteratee`, where each successive
+     * each element in `collection` thru `iteratee`, where each successive
      * invocation is supplied the return value of the previous. If `accumulator`
-     * is not provided the first element of `collection` is used as the initial
-     * value. The `iteratee` is bound to `thisArg` and invoked with four arguments:
+     * is not given, the first element of `collection` is used as the initial
+     * value. The iteratee is invoked with four arguments:
      * (accumulator, value, index|key, collection).
      *
      * Many lodash methods are guarded to work as iteratees for methods like
      * `_.reduce`, `_.reduceRight`, and `_.transform`.
      *
      * The guarded methods are:
-     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `sortByAll`,
-     * and `sortByOrder`
+     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,
+     * and `sortBy`
      *
      * @static
      * @memberOf _
-     * @alias foldl, inject
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
+     * @param {Array|Object} collection The collection to iterate over.
      * @param {Function} [iteratee=_.identity] The function invoked per iteration.
      * @param {*} [accumulator] The initial value.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
      * @returns {*} Returns the accumulated value.
+     * @see _.reduceRight
      * @example
      *
-     * _.reduce([1, 2], function(total, n) {
-     *   return total + n;
-     * });
+     * _.reduce([1, 2], function(sum, n) {
+     *   return sum + n;
+     * }, 0);
      * // => 3
      *
-     * _.reduce({ 'a': 1, 'b': 2 }, function(result, n, key) {
-     *   result[key] = n * 3;
+     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
+     *   (result[value] || (result[value] = [])).push(key);
      *   return result;
      * }, {});
-     * // => { 'a': 3, 'b': 6 } (iteration order is not guaranteed)
+     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)
      */
-    var reduce = createReduce(arrayReduce, baseEach);
+    function reduce(collection, iteratee, accumulator) {
+      var func = isArray(collection) ? arrayReduce : baseReduce,
+          initAccum = arguments.length < 3;
+
+      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);
+    }
 
     /**
      * This method is like `_.reduce` except that it iterates over elements of
@@ -14796,13 +14999,13 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
-     * @alias foldr
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
+     * @param {Array|Object} collection The collection to iterate over.
      * @param {Function} [iteratee=_.identity] The function invoked per iteration.
      * @param {*} [accumulator] The initial value.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
      * @returns {*} Returns the accumulated value.
+     * @see _.reduce
      * @example
      *
      * var array = [[0, 1], [2, 3], [4, 5]];
@@ -14812,7 +15015,12 @@ module.exports = ClipperLib;
      * }, []);
      * // => [4, 5, 2, 3, 0, 1]
      */
-    var reduceRight = createReduce(arrayReduceRight, baseEachRight);
+    function reduceRight(collection, iteratee, accumulator) {
+      var func = isArray(collection) ? arrayReduceRight : baseReduce,
+          initAccum = arguments.length < 3;
+
+      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);
+    }
 
     /**
      * The opposite of `_.filter`; this method returns the elements of `collection`
@@ -14820,83 +15028,86 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
      * @returns {Array} Returns the new filtered array.
+     * @see _.filter
      * @example
      *
-     * _.reject([1, 2, 3, 4], function(n) {
-     *   return n % 2 == 0;
-     * });
-     * // => [1, 3]
-     *
      * var users = [
      *   { 'user': 'barney', 'age': 36, 'active': false },
      *   { 'user': 'fred',   'age': 40, 'active': true }
      * ];
      *
-     * // using the `_.matches` callback shorthand
-     * _.pluck(_.reject(users, { 'age': 40, 'active': true }), 'user');
-     * // => ['barney']
+     * _.reject(users, function(o) { return !o.active; });
+     * // => objects for ['fred']
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.reject(users, { 'age': 40, 'active': true });
+     * // => objects for ['barney']
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.pluck(_.reject(users, 'active', false), 'user');
-     * // => ['fred']
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.reject(users, ['active', false]);
+     * // => objects for ['fred']
      *
-     * // using the `_.property` callback shorthand
-     * _.pluck(_.reject(users, 'active'), 'user');
-     * // => ['barney']
+     * // The `_.property` iteratee shorthand.
+     * _.reject(users, 'active');
+     * // => objects for ['barney']
      */
-    function reject(collection, predicate, thisArg) {
+    function reject(collection, predicate) {
       var func = isArray(collection) ? arrayFilter : baseFilter;
-      predicate = getCallback(predicate, thisArg, 3);
-      return func(collection, function(value, index, collection) {
-        return !predicate(value, index, collection);
-      });
+      return func(collection, negate(getIteratee(predicate, 3)));
     }
 
     /**
-     * Gets a random element or `n` random elements from a collection.
+     * Gets a random element from `collection`.
      *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to sample.
-     * @param {number} [n] The number of elements to sample.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
-     * @returns {*} Returns the random sample(s).
+     * @param {Array|Object} collection The collection to sample.
+     * @returns {*} Returns the random element.
      * @example
      *
      * _.sample([1, 2, 3, 4]);
      * // => 2
+     */
+    function sample(collection) {
+      var func = isArray(collection) ? arraySample : baseSample;
+      return func(collection);
+    }
+
+    /**
+     * Gets `n` random elements at unique keys from `collection` up to the
+     * size of `collection`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to sample.
+     * @param {number} [n=1] The number of elements to sample.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the random elements.
+     * @example
      *
-     * _.sample([1, 2, 3, 4], 2);
+     * _.sampleSize([1, 2, 3], 2);
      * // => [3, 1]
+     *
+     * _.sampleSize([1, 2, 3], 4);
+     * // => [2, 3, 1]
      */
-    function sample(collection, n, guard) {
-      if (guard ? isIterateeCall(collection, n, guard) : n == null) {
-        collection = toIterable(collection);
-        var length = collection.length;
-        return length > 0 ? collection[baseRandom(0, length - 1)] : undefined;
-      }
-      var index = -1,
-          result = toArray(collection),
-          length = result.length,
-          lastIndex = length - 1;
-
-      n = nativeMin(n < 0 ? 0 : (+n || 0), length);
-      while (++index < n) {
-        var rand = baseRandom(index, lastIndex),
-            value = result[rand];
-
-        result[rand] = result[index];
-        result[index] = value;
+    function sampleSize(collection, n, guard) {
+      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {
+        n = 1;
+      } else {
+        n = toInteger(n);
       }
-      result.length = n;
-      return result;
+      var func = isArray(collection) ? arraySampleSize : baseSampleSize;
+      return func(collection, n);
     }
 
     /**
@@ -14905,8 +15116,9 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to shuffle.
+     * @param {Array|Object} collection The collection to shuffle.
      * @returns {Array} Returns the new shuffled array.
      * @example
      *
@@ -14914,18 +15126,20 @@ module.exports = ClipperLib;
      * // => [4, 1, 3, 2]
      */
     function shuffle(collection) {
-      return sample(collection, POSITIVE_INFINITY);
+      var func = isArray(collection) ? arrayShuffle : baseShuffle;
+      return func(collection);
     }
 
     /**
      * Gets the size of `collection` by returning its length for array-like
-     * values or the number of own enumerable properties for objects.
+     * values or the number of own enumerable string keyed properties for objects.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Collection
      * @param {Array|Object|string} collection The collection to inspect.
-     * @returns {number} Returns the size of `collection`.
+     * @returns {number} Returns the collection size.
      * @example
      *
      * _.size([1, 2, 3]);
@@ -14938,35 +15152,31 @@ module.exports = ClipperLib;
      * // => 7
      */
     function size(collection) {
-      var length = collection ? getLength(collection) : 0;
-      return isLength(length) ? length : keys(collection).length;
+      if (collection == null) {
+        return 0;
+      }
+      if (isArrayLike(collection)) {
+        return isString(collection) ? stringSize(collection) : collection.length;
+      }
+      var tag = getTag(collection);
+      if (tag == mapTag || tag == setTag) {
+        return collection.size;
+      }
+      return baseKeys(collection).length;
     }
 
     /**
      * Checks if `predicate` returns truthy for **any** element of `collection`.
-     * The function returns as soon as it finds a passing value and does not iterate
-     * over the entire collection. The predicate is bound to `thisArg` and invoked
-     * with three arguments: (value, index|key, collection).
-     *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * Iteration is stopped once `predicate` returns truthy. The predicate is
+     * invoked with three arguments: (value, index|key, collection).
      *
      * @static
      * @memberOf _
-     * @alias any
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {boolean} Returns `true` if any element passes the predicate check,
      *  else `false`.
      * @example
@@ -14979,250 +15189,99 @@ module.exports = ClipperLib;
      *   { 'user': 'fred',   'active': false }
      * ];
      *
-     * // using the `_.matches` callback shorthand
+     * // The `_.matches` iteratee shorthand.
      * _.some(users, { 'user': 'barney', 'active': false });
      * // => false
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.some(users, 'active', false);
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.some(users, ['active', false]);
      * // => true
      *
-     * // using the `_.property` callback shorthand
+     * // The `_.property` iteratee shorthand.
      * _.some(users, 'active');
      * // => true
      */
-    function some(collection, predicate, thisArg) {
+    function some(collection, predicate, guard) {
       var func = isArray(collection) ? arraySome : baseSome;
-      if (thisArg && isIterateeCall(collection, predicate, thisArg)) {
+      if (guard && isIterateeCall(collection, predicate, guard)) {
         predicate = undefined;
       }
-      if (typeof predicate != 'function' || thisArg !== undefined) {
-        predicate = getCallback(predicate, thisArg, 3);
-      }
-      return func(collection, predicate);
+      return func(collection, getIteratee(predicate, 3));
     }
 
     /**
      * Creates an array of elements, sorted in ascending order by the results of
-     * running each element in a collection through `iteratee`. This method performs
-     * a stable sort, that is, it preserves the original sort order of equal elements.
-     * The `iteratee` is bound to `thisArg` and invoked with three arguments:
-     * (value, index|key, collection).
-     *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
-     *
-     * @static
-     * @memberOf _
-     * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
-     * @returns {Array} Returns the new sorted array.
-     * @example
-     *
-     * _.sortBy([1, 2, 3], function(n) {
-     *   return Math.sin(n);
-     * });
-     * // => [3, 1, 2]
-     *
-     * _.sortBy([1, 2, 3], function(n) {
-     *   return this.sin(n);
-     * }, Math);
-     * // => [3, 1, 2]
-     *
-     * var users = [
-     *   { 'user': 'fred' },
-     *   { 'user': 'pebbles' },
-     *   { 'user': 'barney' }
-     * ];
-     *
-     * // using the `_.property` callback shorthand
-     * _.pluck(_.sortBy(users, 'user'), 'user');
-     * // => ['barney', 'fred', 'pebbles']
-     */
-    function sortBy(collection, iteratee, thisArg) {
-      if (collection == null) {
-        return [];
-      }
-      if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
-        iteratee = undefined;
-      }
-      var index = -1;
-      iteratee = getCallback(iteratee, thisArg, 3);
-
-      var result = baseMap(collection, function(value, key, collection) {
-        return { 'criteria': iteratee(value, key, collection), 'index': ++index, 'value': value };
-      });
-      return baseSortBy(result, compareAscending);
-    }
-
-    /**
-     * This method is like `_.sortBy` except that it can sort by multiple iteratees
-     * or property names.
-     *
-     * If a property name is provided for an iteratee the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If an object is provided for an iteratee the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * running each element in a collection thru each iteratee. This method
+     * performs a stable sort, that is, it preserves the original sort order of
+     * equal elements. The iteratees are invoked with one argument: (value).
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {...(Function|Function[]|Object|Object[]|string|string[])} iteratees
-     *  The iteratees to sort by, specified as individual values or arrays of values.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {...(Function|Function[])} [iteratees=[_.identity]]
+     *  The iteratees to sort by.
      * @returns {Array} Returns the new sorted array.
      * @example
      *
      * var users = [
      *   { 'user': 'fred',   'age': 48 },
      *   { 'user': 'barney', 'age': 36 },
-     *   { 'user': 'fred',   'age': 42 },
+     *   { 'user': 'fred',   'age': 40 },
      *   { 'user': 'barney', 'age': 34 }
      * ];
      *
-     * _.map(_.sortByAll(users, ['user', 'age']), _.values);
-     * // => [['barney', 34], ['barney', 36], ['fred', 42], ['fred', 48]]
+     * _.sortBy(users, [function(o) { return o.user; }]);
+     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]
      *
-     * _.map(_.sortByAll(users, 'user', function(chr) {
-     *   return Math.floor(chr.age / 10);
-     * }), _.values);
-     * // => [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 42]]
+     * _.sortBy(users, ['user', 'age']);
+     * // => objects for [['barney', 34], ['barney', 36], ['fred', 40], ['fred', 48]]
      */
-    var sortByAll = restParam(function(collection, iteratees) {
+    var sortBy = baseRest(function(collection, iteratees) {
       if (collection == null) {
         return [];
       }
-      var guard = iteratees[2];
-      if (guard && isIterateeCall(iteratees[0], iteratees[1], guard)) {
-        iteratees.length = 1;
+      var length = iteratees.length;
+      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {
+        iteratees = [];
+      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {
+        iteratees = [iteratees[0]];
       }
-      return baseSortByOrder(collection, baseFlatten(iteratees), []);
+      return baseOrderBy(collection, baseFlatten(iteratees, 1), []);
     });
 
-    /**
-     * This method is like `_.sortByAll` except that it allows specifying the
-     * sort orders of the iteratees to sort by. If `orders` is unspecified, all
-     * values are sorted in ascending order. Otherwise, a value is sorted in
-     * ascending order if its corresponding order is "asc", and descending if "desc".
-     *
-     * If a property name is provided for an iteratee the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If an object is provided for an iteratee the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
-     *
-     * @static
-     * @memberOf _
-     * @category Collection
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
-     * @param {boolean[]} [orders] The sort orders of `iteratees`.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.reduce`.
-     * @returns {Array} Returns the new sorted array.
-     * @example
-     *
-     * var users = [
-     *   { 'user': 'fred',   'age': 48 },
-     *   { 'user': 'barney', 'age': 34 },
-     *   { 'user': 'fred',   'age': 42 },
-     *   { 'user': 'barney', 'age': 36 }
-     * ];
-     *
-     * // sort by `user` in ascending order and by `age` in descending order
-     * _.map(_.sortByOrder(users, ['user', 'age'], ['asc', 'desc']), _.values);
-     * // => [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 42]]
-     */
-    function sortByOrder(collection, iteratees, orders, guard) {
-      if (collection == null) {
-        return [];
-      }
-      if (guard && isIterateeCall(iteratees, orders, guard)) {
-        orders = undefined;
-      }
-      if (!isArray(iteratees)) {
-        iteratees = iteratees == null ? [] : [iteratees];
-      }
-      if (!isArray(orders)) {
-        orders = orders == null ? [] : [orders];
-      }
-      return baseSortByOrder(collection, iteratees, orders);
-    }
-
-    /**
-     * Performs a deep comparison between each element in `collection` and the
-     * source object, returning an array of all elements that have equivalent
-     * property values.
-     *
-     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
-     * numbers, `Object` objects, regexes, and strings. Objects are compared by
-     * their own, not inherited, enumerable properties. For comparing a single
-     * own or inherited property value see `_.matchesProperty`.
-     *
-     * @static
-     * @memberOf _
-     * @category Collection
-     * @param {Array|Object|string} collection The collection to search.
-     * @param {Object} source The object of property values to match.
-     * @returns {Array} Returns the new filtered array.
-     * @example
-     *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36, 'active': false, 'pets': ['hoppy'] },
-     *   { 'user': 'fred',   'age': 40, 'active': true, 'pets': ['baby puss', 'dino'] }
-     * ];
-     *
-     * _.pluck(_.where(users, { 'age': 36, 'active': false }), 'user');
-     * // => ['barney']
-     *
-     * _.pluck(_.where(users, { 'pets': ['dino'] }), 'user');
-     * // => ['fred']
-     */
-    function where(collection, source) {
-      return filter(collection, baseMatches(source));
-    }
-
     /*------------------------------------------------------------------------*/
 
     /**
-     * Gets the number of milliseconds that have elapsed since the Unix epoch
-     * (1 January 1970 00:00:00 UTC).
+     * Gets the timestamp of the number of milliseconds that have elapsed since
+     * the Unix epoch (1 January 1970 00:00:00 UTC).
      *
      * @static
      * @memberOf _
+     * @since 2.4.0
      * @category Date
+     * @returns {number} Returns the timestamp.
      * @example
      *
      * _.defer(function(stamp) {
      *   console.log(_.now() - stamp);
      * }, _.now());
-     * // => logs the number of milliseconds it took for the deferred function to be invoked
+     * // => Logs the number of milliseconds it took for the deferred invocation.
      */
-    var now = nativeNow || function() {
-      return new Date().getTime();
+    var now = ctxNow || function() {
+      return root.Date.now();
     };
 
     /*------------------------------------------------------------------------*/
 
     /**
      * The opposite of `_.before`; this method creates a function that invokes
-     * `func` once it is called `n` or more times.
+     * `func` once it's called `n` or more times.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Function
      * @param {number} n The number of calls before `func` is invoked.
      * @param {Function} func The function to restrict.
@@ -15238,19 +15297,13 @@ module.exports = ClipperLib;
      * _.forEach(saves, function(type) {
      *   asyncSave({ 'type': type, 'complete': done });
      * });
-     * // => logs 'done saving!' after the two async saves have completed
+     * // => Logs 'done saving!' after the two async saves have completed.
      */
     function after(n, func) {
       if (typeof func != 'function') {
-        if (typeof n == 'function') {
-          var temp = n;
-          n = func;
-          func = temp;
-        } else {
-          throw new TypeError(FUNC_ERROR_TEXT);
-        }
+        throw new TypeError(FUNC_ERROR_TEXT);
       }
-      n = nativeIsFinite(n = +n) ? n : 0;
+      n = toInteger(n);
       return function() {
         if (--n < 1) {
           return func.apply(this, arguments);
@@ -15259,56 +15312,51 @@ module.exports = ClipperLib;
     }
 
     /**
-     * Creates a function that accepts up to `n` arguments ignoring any
-     * additional arguments.
+     * Creates a function that invokes `func`, with up to `n` arguments,
+     * ignoring any additional arguments.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Function
      * @param {Function} func The function to cap arguments for.
      * @param {number} [n=func.length] The arity cap.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
-     * @returns {Function} Returns the new function.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Function} Returns the new capped function.
      * @example
      *
      * _.map(['6', '8', '10'], _.ary(parseInt, 1));
      * // => [6, 8, 10]
      */
     function ary(func, n, guard) {
-      if (guard && isIterateeCall(func, n, guard)) {
-        n = undefined;
-      }
-      n = (func && n == null) ? func.length : nativeMax(+n || 0, 0);
-      return createWrapper(func, ARY_FLAG, undefined, undefined, undefined, undefined, n);
+      n = guard ? undefined : n;
+      n = (func && n == null) ? func.length : n;
+      return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);
     }
 
     /**
      * Creates a function that invokes `func`, with the `this` binding and arguments
-     * of the created function, while it is called less than `n` times. Subsequent
+     * of the created function, while it's called less than `n` times. Subsequent
      * calls to the created function return the result of the last `func` invocation.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Function
      * @param {number} n The number of calls at which `func` is no longer invoked.
      * @param {Function} func The function to restrict.
      * @returns {Function} Returns the new restricted function.
      * @example
      *
-     * jQuery('#add').on('click', _.before(5, addContactToList));
-     * // => allows adding up to 4 contacts to the list
+     * jQuery(element).on('click', _.before(5, addContactToList));
+     * // => Allows adding up to 4 contacts to the list.
      */
     function before(n, func) {
       var result;
       if (typeof func != 'function') {
-        if (typeof n == 'function') {
-          var temp = n;
-          n = func;
-          func = temp;
-        } else {
-          throw new TypeError(FUNC_ERROR_TEXT);
-        }
+        throw new TypeError(FUNC_ERROR_TEXT);
       }
+      n = toInteger(n);
       return function() {
         if (--n > 0) {
           result = func.apply(this, arguments);
@@ -15322,17 +15370,17 @@ module.exports = ClipperLib;
 
     /**
      * Creates a function that invokes `func` with the `this` binding of `thisArg`
-     * and prepends any additional `_.bind` arguments to those provided to the
-     * bound function.
+     * and `partials` prepended to the arguments it receives.
      *
      * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,
      * may be used as a placeholder for partially applied arguments.
      *
-     * **Note:** Unlike native `Function#bind` this method does not set the "length"
+     * **Note:** Unlike native `Function#bind`, this method doesn't set the "length"
      * property of bound functions.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Function
      * @param {Function} func The function to bind.
      * @param {*} thisArg The `this` binding of `func`.
@@ -15340,9 +15388,9 @@ module.exports = ClipperLib;
      * @returns {Function} Returns the new bound function.
      * @example
      *
-     * var greet = function(greeting, punctuation) {
+     * function greet(greeting, punctuation) {
      *   return greeting + ' ' + this.user + punctuation;
-     * };
+     * }
      *
      * var object = { 'user': 'fred' };
      *
@@ -15350,68 +15398,27 @@ module.exports = ClipperLib;
      * bound('!');
      * // => 'hi fred!'
      *
-     * // using placeholders
+     * // Bound with placeholders.
      * var bound = _.bind(greet, object, _, '!');
      * bound('hi');
      * // => 'hi fred!'
      */
-    var bind = restParam(function(func, thisArg, partials) {
-      var bitmask = BIND_FLAG;
+    var bind = baseRest(function(func, thisArg, partials) {
+      var bitmask = WRAP_BIND_FLAG;
       if (partials.length) {
-        var holders = replaceHolders(partials, bind.placeholder);
-        bitmask |= PARTIAL_FLAG;
-      }
-      return createWrapper(func, bitmask, thisArg, partials, holders);
-    });
-
-    /**
-     * Binds methods of an object to the object itself, overwriting the existing
-     * method. Method names may be specified as individual arguments or as arrays
-     * of method names. If no method names are provided all enumerable function
-     * properties, own and inherited, of `object` are bound.
-     *
-     * **Note:** This method does not set the "length" property of bound functions.
-     *
-     * @static
-     * @memberOf _
-     * @category Function
-     * @param {Object} object The object to bind and assign the bound methods to.
-     * @param {...(string|string[])} [methodNames] The object method names to bind,
-     *  specified as individual method names or arrays of method names.
-     * @returns {Object} Returns `object`.
-     * @example
-     *
-     * var view = {
-     *   'label': 'docs',
-     *   'onClick': function() {
-     *     console.log('clicked ' + this.label);
-     *   }
-     * };
-     *
-     * _.bindAll(view);
-     * jQuery('#docs').on('click', view.onClick);
-     * // => logs 'clicked docs' when the element is clicked
-     */
-    var bindAll = restParam(function(object, methodNames) {
-      methodNames = methodNames.length ? baseFlatten(methodNames) : functions(object);
-
-      var index = -1,
-          length = methodNames.length;
-
-      while (++index < length) {
-        var key = methodNames[index];
-        object[key] = createWrapper(object[key], BIND_FLAG, object);
+        var holders = replaceHolders(partials, getHolder(bind));
+        bitmask |= WRAP_PARTIAL_FLAG;
       }
-      return object;
+      return createWrap(func, bitmask, thisArg, partials, holders);
     });
 
     /**
-     * Creates a function that invokes the method at `object[key]` and prepends
-     * any additional `_.bindKey` arguments to those provided to the bound function.
+     * Creates a function that invokes the method at `object[key]` with `partials`
+     * prepended to the arguments it receives.
      *
      * This method differs from `_.bind` by allowing bound functions to reference
-     * methods that may be redefined or don't yet exist.
-     * See [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)
+     * methods that may be redefined or don't yet exist. See
+     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)
      * for more details.
      *
      * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic
@@ -15419,8 +15426,9 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.10.0
      * @category Function
-     * @param {Object} object The object the method belongs to.
+     * @param {Object} object The object to invoke the method on.
      * @param {string} key The key of the method.
      * @param {...*} [partials] The arguments to be partially applied.
      * @returns {Function} Returns the new bound function.
@@ -15444,38 +15452,39 @@ module.exports = ClipperLib;
      * bound('!');
      * // => 'hiya fred!'
      *
-     * // using placeholders
+     * // Bound with placeholders.
      * var bound = _.bindKey(object, 'greet', _, '!');
      * bound('hi');
      * // => 'hiya fred!'
      */
-    var bindKey = restParam(function(object, key, partials) {
-      var bitmask = BIND_FLAG | BIND_KEY_FLAG;
+    var bindKey = baseRest(function(object, key, partials) {
+      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;
       if (partials.length) {
-        var holders = replaceHolders(partials, bindKey.placeholder);
-        bitmask |= PARTIAL_FLAG;
+        var holders = replaceHolders(partials, getHolder(bindKey));
+        bitmask |= WRAP_PARTIAL_FLAG;
       }
-      return createWrapper(key, bitmask, object, partials, holders);
+      return createWrap(key, bitmask, object, partials, holders);
     });
 
     /**
-     * Creates a function that accepts one or more arguments of `func` that when
-     * called either invokes `func` returning its result, if all `func` arguments
-     * have been provided, or returns a function that accepts one or more of the
-     * remaining `func` arguments, and so on. The arity of `func` may be specified
-     * if `func.length` is not sufficient.
+     * Creates a function that accepts arguments of `func` and either invokes
+     * `func` returning its result, if at least `arity` number of arguments have
+     * been provided, or returns a function that accepts the remaining `func`
+     * arguments, and so on. The arity of `func` may be specified if `func.length`
+     * is not sufficient.
      *
      * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,
      * may be used as a placeholder for provided arguments.
      *
-     * **Note:** This method does not set the "length" property of curried functions.
+     * **Note:** This method doesn't set the "length" property of curried functions.
      *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @category Function
      * @param {Function} func The function to curry.
      * @param {number} [arity=func.length] The arity of `func`.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {Function} Returns the new curried function.
      * @example
      *
@@ -15494,11 +15503,16 @@ module.exports = ClipperLib;
      * curried(1, 2, 3);
      * // => [1, 2, 3]
      *
-     * // using placeholders
+     * // Curried with placeholders.
      * curried(1)(_, 3)(2);
      * // => [1, 2, 3]
      */
-    var curry = createCurry(CURRY_FLAG);
+    function curry(func, arity, guard) {
+      arity = guard ? undefined : arity;
+      var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);
+      result.placeholder = curry.placeholder;
+      return result;
+    }
 
     /**
      * This method is like `_.curry` except that arguments are applied to `func`
@@ -15507,14 +15521,15 @@ module.exports = ClipperLib;
      * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic
      * builds, may be used as a placeholder for provided arguments.
      *
-     * **Note:** This method does not set the "length" property of curried functions.
+     * **Note:** This method doesn't set the "length" property of curried functions.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Function
      * @param {Function} func The function to curry.
      * @param {number} [arity=func.length] The arity of `func`.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {Function} Returns the new curried function.
      * @example
      *
@@ -15533,323 +15548,306 @@ module.exports = ClipperLib;
      * curried(1, 2, 3);
      * // => [1, 2, 3]
      *
-     * // using placeholders
+     * // Curried with placeholders.
      * curried(3)(1, _)(2);
      * // => [1, 2, 3]
      */
-    var curryRight = createCurry(CURRY_RIGHT_FLAG);
+    function curryRight(func, arity, guard) {
+      arity = guard ? undefined : arity;
+      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);
+      result.placeholder = curryRight.placeholder;
+      return result;
+    }
 
     /**
      * Creates a debounced function that delays invoking `func` until after `wait`
      * milliseconds have elapsed since the last time the debounced function was
      * invoked. The debounced function comes with a `cancel` method to cancel
-     * delayed invocations. Provide an options object to indicate that `func`
-     * should be invoked on the leading and/or trailing edge of the `wait` timeout.
-     * Subsequent calls to the debounced function return the result of the last
-     * `func` invocation.
+     * delayed `func` invocations and a `flush` method to immediately invoke them.
+     * Provide `options` to indicate whether `func` should be invoked on the
+     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked
+     * with the last arguments provided to the debounced function. Subsequent
+     * calls to the debounced function return the result of the last `func`
+     * invocation.
      *
-     * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked
-     * on the trailing edge of the timeout only if the the debounced function is
-     * invoked more than once during the `wait` timeout.
+     * **Note:** If `leading` and `trailing` options are `true`, `func` is
+     * invoked on the trailing edge of the timeout only if the debounced function
+     * is invoked more than once during the `wait` timeout.
      *
-     * See [David Corbacho's article](http://drupalmotion.com/article/debounce-and-throttle-visual-explanation)
+     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
+     * until to the next tick, similar to `setTimeout` with a timeout of `0`.
+     *
+     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
      * for details over the differences between `_.debounce` and `_.throttle`.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Function
      * @param {Function} func The function to debounce.
      * @param {number} [wait=0] The number of milliseconds to delay.
-     * @param {Object} [options] The options object.
-     * @param {boolean} [options.leading=false] Specify invoking on the leading
-     *  edge of the timeout.
-     * @param {number} [options.maxWait] The maximum time `func` is allowed to be
-     *  delayed before it is invoked.
-     * @param {boolean} [options.trailing=true] Specify invoking on the trailing
-     *  edge of the timeout.
+     * @param {Object} [options={}] The options object.
+     * @param {boolean} [options.leading=false]
+     *  Specify invoking on the leading edge of the timeout.
+     * @param {number} [options.maxWait]
+     *  The maximum time `func` is allowed to be delayed before it's invoked.
+     * @param {boolean} [options.trailing=true]
+     *  Specify invoking on the trailing edge of the timeout.
      * @returns {Function} Returns the new debounced function.
      * @example
      *
-     * // avoid costly calculations while the window size is in flux
+     * // Avoid costly calculations while the window size is in flux.
      * jQuery(window).on('resize', _.debounce(calculateLayout, 150));
      *
-     * // invoke `sendMail` when the click event is fired, debouncing subsequent calls
-     * jQuery('#postbox').on('click', _.debounce(sendMail, 300, {
+     * // Invoke `sendMail` when clicked, debouncing subsequent calls.
+     * jQuery(element).on('click', _.debounce(sendMail, 300, {
      *   'leading': true,
      *   'trailing': false
      * }));
      *
-     * // ensure `batchLog` is invoked once after 1 second of debounced calls
+     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.
+     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });
      * var source = new EventSource('/stream');
-     * jQuery(source).on('message', _.debounce(batchLog, 250, {
-     *   'maxWait': 1000
-     * }));
-     *
-     * // cancel a debounced call
-     * var todoChanges = _.debounce(batchLog, 1000);
-     * Object.observe(models.todo, todoChanges);
-     *
-     * Object.observe(models, function(changes) {
-     *   if (_.find(changes, { 'user': 'todo', 'type': 'delete'})) {
-     *     todoChanges.cancel();
-     *   }
-     * }, ['delete']);
-     *
-     * // ...at some point `models.todo` is changed
-     * models.todo.completed = true;
+     * jQuery(source).on('message', debounced);
      *
-     * // ...before 1 second has passed `models.todo` is deleted
-     * // which cancels the debounced `todoChanges` call
-     * delete models.todo;
+     * // Cancel the trailing debounced invocation.
+     * jQuery(window).on('popstate', debounced.cancel);
      */
     function debounce(func, wait, options) {
-      var args,
-          maxTimeoutId,
+      var lastArgs,
+          lastThis,
+          maxWait,
           result,
-          stamp,
-          thisArg,
-          timeoutId,
-          trailingCall,
-          lastCalled = 0,
-          maxWait = false,
+          timerId,
+          lastCallTime,
+          lastInvokeTime = 0,
+          leading = false,
+          maxing = false,
           trailing = true;
 
       if (typeof func != 'function') {
         throw new TypeError(FUNC_ERROR_TEXT);
       }
-      wait = wait < 0 ? 0 : (+wait || 0);
-      if (options === true) {
-        var leading = true;
-        trailing = false;
-      } else if (isObject(options)) {
+      wait = toNumber(wait) || 0;
+      if (isObject(options)) {
         leading = !!options.leading;
-        maxWait = 'maxWait' in options && nativeMax(+options.maxWait || 0, wait);
+        maxing = 'maxWait' in options;
+        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;
         trailing = 'trailing' in options ? !!options.trailing : trailing;
       }
 
-      function cancel() {
-        if (timeoutId) {
-          clearTimeout(timeoutId);
-        }
-        if (maxTimeoutId) {
-          clearTimeout(maxTimeoutId);
-        }
-        lastCalled = 0;
-        maxTimeoutId = timeoutId = trailingCall = undefined;
+      function invokeFunc(time) {
+        var args = lastArgs,
+            thisArg = lastThis;
+
+        lastArgs = lastThis = undefined;
+        lastInvokeTime = time;
+        result = func.apply(thisArg, args);
+        return result;
+      }
+
+      function leadingEdge(time) {
+        // Reset any `maxWait` timer.
+        lastInvokeTime = time;
+        // Start the timer for the trailing edge.
+        timerId = setTimeout(timerExpired, wait);
+        // Invoke the leading edge.
+        return leading ? invokeFunc(time) : result;
+      }
+
+      function remainingWait(time) {
+        var timeSinceLastCall = time - lastCallTime,
+            timeSinceLastInvoke = time - lastInvokeTime,
+            result = wait - timeSinceLastCall;
+
+        return maxing ? nativeMin(result, maxWait - timeSinceLastInvoke) : result;
       }
 
-      function complete(isCalled, id) {
-        if (id) {
-          clearTimeout(id);
+      function shouldInvoke(time) {
+        var timeSinceLastCall = time - lastCallTime,
+            timeSinceLastInvoke = time - lastInvokeTime;
+
+        // Either this is the first call, activity has stopped and we're at the
+        // trailing edge, the system time has gone backwards and we're treating
+        // it as the trailing edge, or we've hit the `maxWait` limit.
+        return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||
+          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));
+      }
+
+      function timerExpired() {
+        var time = now();
+        if (shouldInvoke(time)) {
+          return trailingEdge(time);
         }
-        maxTimeoutId = timeoutId = trailingCall = undefined;
-        if (isCalled) {
-          lastCalled = now();
-          result = func.apply(thisArg, args);
-          if (!timeoutId && !maxTimeoutId) {
-            args = thisArg = undefined;
-          }
+        // Restart the timer.
+        timerId = setTimeout(timerExpired, remainingWait(time));
+      }
+
+      function trailingEdge(time) {
+        timerId = undefined;
+
+        // Only invoke if we have `lastArgs` which means `func` has been
+        // debounced at least once.
+        if (trailing && lastArgs) {
+          return invokeFunc(time);
         }
+        lastArgs = lastThis = undefined;
+        return result;
       }
 
-      function delayed() {
-        var remaining = wait - (now() - stamp);
-        if (remaining <= 0 || remaining > wait) {
-          complete(trailingCall, maxTimeoutId);
-        } else {
-          timeoutId = setTimeout(delayed, remaining);
+      function cancel() {
+        if (timerId !== undefined) {
+          clearTimeout(timerId);
         }
+        lastInvokeTime = 0;
+        lastArgs = lastCallTime = lastThis = timerId = undefined;
       }
 
-      function maxDelayed() {
-        complete(trailing, timeoutId);
+      function flush() {
+        return timerId === undefined ? result : trailingEdge(now());
       }
 
       function debounced() {
-        args = arguments;
-        stamp = now();
-        thisArg = this;
-        trailingCall = trailing && (timeoutId || !leading);
+        var time = now(),
+            isInvoking = shouldInvoke(time);
 
-        if (maxWait === false) {
-          var leadingCall = leading && !timeoutId;
-        } else {
-          if (!maxTimeoutId && !leading) {
-            lastCalled = stamp;
-          }
-          var remaining = maxWait - (stamp - lastCalled),
-              isCalled = remaining <= 0 || remaining > maxWait;
+        lastArgs = arguments;
+        lastThis = this;
+        lastCallTime = time;
 
-          if (isCalled) {
-            if (maxTimeoutId) {
-              maxTimeoutId = clearTimeout(maxTimeoutId);
-            }
-            lastCalled = stamp;
-            result = func.apply(thisArg, args);
+        if (isInvoking) {
+          if (timerId === undefined) {
+            return leadingEdge(lastCallTime);
           }
-          else if (!maxTimeoutId) {
-            maxTimeoutId = setTimeout(maxDelayed, remaining);
+          if (maxing) {
+            // Handle invocations in a tight loop.
+            timerId = setTimeout(timerExpired, wait);
+            return invokeFunc(lastCallTime);
           }
         }
-        if (isCalled && timeoutId) {
-          timeoutId = clearTimeout(timeoutId);
-        }
-        else if (!timeoutId && wait !== maxWait) {
-          timeoutId = setTimeout(delayed, wait);
-        }
-        if (leadingCall) {
-          isCalled = true;
-          result = func.apply(thisArg, args);
-        }
-        if (isCalled && !timeoutId && !maxTimeoutId) {
-          args = thisArg = undefined;
+        if (timerId === undefined) {
+          timerId = setTimeout(timerExpired, wait);
         }
         return result;
       }
       debounced.cancel = cancel;
+      debounced.flush = flush;
       return debounced;
     }
 
     /**
      * Defers invoking the `func` until the current call stack has cleared. Any
-     * additional arguments are provided to `func` when it is invoked.
+     * additional arguments are provided to `func` when it's invoked.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Function
      * @param {Function} func The function to defer.
-     * @param {...*} [args] The arguments to invoke the function with.
+     * @param {...*} [args] The arguments to invoke `func` with.
      * @returns {number} Returns the timer id.
      * @example
      *
      * _.defer(function(text) {
      *   console.log(text);
      * }, 'deferred');
-     * // logs 'deferred' after one or more milliseconds
+     * // => Logs 'deferred' after one millisecond.
      */
-    var defer = restParam(function(func, args) {
+    var defer = baseRest(function(func, args) {
       return baseDelay(func, 1, args);
     });
 
     /**
      * Invokes `func` after `wait` milliseconds. Any additional arguments are
-     * provided to `func` when it is invoked.
+     * provided to `func` when it's invoked.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Function
      * @param {Function} func The function to delay.
      * @param {number} wait The number of milliseconds to delay invocation.
-     * @param {...*} [args] The arguments to invoke the function with.
+     * @param {...*} [args] The arguments to invoke `func` with.
      * @returns {number} Returns the timer id.
      * @example
      *
      * _.delay(function(text) {
      *   console.log(text);
      * }, 1000, 'later');
-     * // => logs 'later' after one second
+     * // => Logs 'later' after one second.
      */
-    var delay = restParam(function(func, wait, args) {
-      return baseDelay(func, wait, args);
+    var delay = baseRest(function(func, wait, args) {
+      return baseDelay(func, toNumber(wait) || 0, args);
     });
 
     /**
-     * Creates a function that returns the result of invoking the provided
-     * functions with the `this` binding of the created function, where each
-     * successive invocation is supplied the return value of the previous.
+     * Creates a function that invokes `func` with arguments reversed.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Function
-     * @param {...Function} [funcs] Functions to invoke.
-     * @returns {Function} Returns the new function.
-     * @example
-     *
-     * function square(n) {
-     *   return n * n;
-     * }
-     *
-     * var addSquare = _.flow(_.add, square);
-     * addSquare(1, 2);
-     * // => 9
-     */
-    var flow = createFlow();
-
-    /**
-     * This method is like `_.flow` except that it creates a function that
-     * invokes the provided functions from right to left.
-     *
-     * @static
-     * @memberOf _
-     * @alias backflow, compose
-     * @category Function
-     * @param {...Function} [funcs] Functions to invoke.
-     * @returns {Function} Returns the new function.
+     * @param {Function} func The function to flip arguments for.
+     * @returns {Function} Returns the new flipped function.
      * @example
      *
-     * function square(n) {
-     *   return n * n;
-     * }
+     * var flipped = _.flip(function() {
+     *   return _.toArray(arguments);
+     * });
      *
-     * var addSquare = _.flowRight(square, _.add);
-     * addSquare(1, 2);
-     * // => 9
+     * flipped('a', 'b', 'c', 'd');
+     * // => ['d', 'c', 'b', 'a']
      */
-    var flowRight = createFlow(true);
+    function flip(func) {
+      return createWrap(func, WRAP_FLIP_FLAG);
+    }
 
     /**
      * Creates a function that memoizes the result of `func`. If `resolver` is
-     * provided it determines the cache key for storing the result based on the
+     * provided, it determines the cache key for storing the result based on the
      * arguments provided to the memoized function. By default, the first argument
-     * provided to the memoized function is coerced to a string and used as the
-     * cache key. The `func` is invoked with the `this` binding of the memoized
-     * function.
+     * provided to the memoized function is used as the map cache key. The `func`
+     * is invoked with the `this` binding of the memoized function.
      *
      * **Note:** The cache is exposed as the `cache` property on the memoized
      * function. Its creation may be customized by replacing the `_.memoize.Cache`
-     * constructor with one whose instances implement the [`Map`](http://ecma-international.org/ecma-262/6.0/#sec-properties-of-the-map-prototype-object)
-     * method interface of `get`, `has`, and `set`.
+     * constructor with one whose instances implement the
+     * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)
+     * method interface of `clear`, `delete`, `get`, `has`, and `set`.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Function
      * @param {Function} func The function to have its output memoized.
      * @param {Function} [resolver] The function to resolve the cache key.
-     * @returns {Function} Returns the new memoizing function.
+     * @returns {Function} Returns the new memoized function.
      * @example
      *
-     * var upperCase = _.memoize(function(string) {
-     *   return string.toUpperCase();
-     * });
+     * var object = { 'a': 1, 'b': 2 };
+     * var other = { 'c': 3, 'd': 4 };
      *
-     * upperCase('fred');
-     * // => 'FRED'
+     * var values = _.memoize(_.values);
+     * values(object);
+     * // => [1, 2]
      *
-     * // modifying the result cache
-     * upperCase.cache.set('fred', 'BARNEY');
-     * upperCase('fred');
-     * // => 'BARNEY'
+     * values(other);
+     * // => [3, 4]
      *
-     * // replacing `_.memoize.Cache`
-     * var object = { 'user': 'fred' };
-     * var other = { 'user': 'barney' };
-     * var identity = _.memoize(_.identity);
+     * object.a = 2;
+     * values(object);
+     * // => [1, 2]
      *
-     * identity(object);
-     * // => { 'user': 'fred' }
-     * identity(other);
-     * // => { 'user': 'fred' }
+     * // Modify the result cache.
+     * values.cache.set(object, ['a', 'b']);
+     * values(object);
+     * // => ['a', 'b']
      *
+     * // Replace `_.memoize.Cache`.
      * _.memoize.Cache = WeakMap;
-     * var identity = _.memoize(_.identity);
-     *
-     * identity(object);
-     * // => { 'user': 'fred' }
-     * identity(other);
-     * // => { 'user': 'barney' }
      */
     function memoize(func, resolver) {
-      if (typeof func != 'function' || (resolver && typeof resolver != 'function')) {
+      if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {
         throw new TypeError(FUNC_ERROR_TEXT);
       }
       var memoized = function() {
@@ -15861,94 +15859,60 @@ module.exports = ClipperLib;
           return cache.get(key);
         }
         var result = func.apply(this, args);
-        memoized.cache = cache.set(key, result);
+        memoized.cache = cache.set(key, result) || cache;
         return result;
       };
-      memoized.cache = new memoize.Cache;
+      memoized.cache = new (memoize.Cache || MapCache);
       return memoized;
     }
 
+    // Expose `MapCache`.
+    memoize.Cache = MapCache;
+
     /**
-     * Creates a function that runs each argument through a corresponding
-     * transform function.
+     * Creates a function that negates the result of the predicate `func`. The
+     * `func` predicate is invoked with the `this` binding and arguments of the
+     * created function.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Function
-     * @param {Function} func The function to wrap.
-     * @param {...(Function|Function[])} [transforms] The functions to transform
-     * arguments, specified as individual functions or arrays of functions.
-     * @returns {Function} Returns the new function.
+     * @param {Function} predicate The predicate to negate.
+     * @returns {Function} Returns the new negated function.
      * @example
      *
-     * function doubled(n) {
-     *   return n * 2;
-     * }
-     *
-     * function square(n) {
-     *   return n * n;
+     * function isEven(n) {
+     *   return n % 2 == 0;
      * }
      *
-     * var modded = _.modArgs(function(x, y) {
-     *   return [x, y];
-     * }, square, doubled);
-     *
-     * modded(1, 2);
-     * // => [1, 4]
-     *
-     * modded(5, 10);
-     * // => [25, 20]
+     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));
+     * // => [1, 3, 5]
      */
-    var modArgs = restParam(function(func, transforms) {
-      transforms = baseFlatten(transforms);
-      if (typeof func != 'function' || !arrayEvery(transforms, baseIsFunction)) {
+    function negate(predicate) {
+      if (typeof predicate != 'function') {
         throw new TypeError(FUNC_ERROR_TEXT);
       }
-      var length = transforms.length;
-      return restParam(function(args) {
-        var index = nativeMin(args.length, length);
-        while (index--) {
-          args[index] = transforms[index](args[index]);
+      return function() {
+        var args = arguments;
+        switch (args.length) {
+          case 0: return !predicate.call(this);
+          case 1: return !predicate.call(this, args[0]);
+          case 2: return !predicate.call(this, args[0], args[1]);
+          case 3: return !predicate.call(this, args[0], args[1], args[2]);
         }
-        return func.apply(this, args);
-      });
-    });
-
-    /**
-     * Creates a function that negates the result of the predicate `func`. The
-     * `func` predicate is invoked with the `this` binding and arguments of the
-     * created function.
-     *
-     * @static
-     * @memberOf _
-     * @category Function
-     * @param {Function} predicate The predicate to negate.
-     * @returns {Function} Returns the new function.
-     * @example
-     *
-     * function isEven(n) {
-     *   return n % 2 == 0;
-     * }
-     *
-     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));
-     * // => [1, 3, 5]
-     */
-    function negate(predicate) {
-      if (typeof predicate != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      return function() {
-        return !predicate.apply(this, arguments);
+        return !predicate.apply(this, args);
       };
     }
 
     /**
      * Creates a function that is restricted to invoking `func` once. Repeat calls
-     * to the function return the value of the first call. The `func` is invoked
-     * with the `this` binding and arguments of the created function.
+     * to the function return the value of the first invocation. The `func` is
+     * invoked with the `this` binding and arguments of the created function.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Function
      * @param {Function} func The function to restrict.
      * @returns {Function} Returns the new restricted function.
@@ -15957,126 +15921,179 @@ module.exports = ClipperLib;
      * var initialize = _.once(createApplication);
      * initialize();
      * initialize();
-     * // `initialize` invokes `createApplication` once
+     * // => `createApplication` is invoked once
      */
     function once(func) {
       return before(2, func);
     }
 
     /**
-     * Creates a function that invokes `func` with `partial` arguments prepended
-     * to those provided to the new function. This method is like `_.bind` except
-     * it does **not** alter the `this` binding.
+     * Creates a function that invokes `func` with its arguments transformed.
+     *
+     * @static
+     * @since 4.0.0
+     * @memberOf _
+     * @category Function
+     * @param {Function} func The function to wrap.
+     * @param {...(Function|Function[])} [transforms=[_.identity]]
+     *  The argument transforms.
+     * @returns {Function} Returns the new function.
+     * @example
+     *
+     * function doubled(n) {
+     *   return n * 2;
+     * }
+     *
+     * function square(n) {
+     *   return n * n;
+     * }
+     *
+     * var func = _.overArgs(function(x, y) {
+     *   return [x, y];
+     * }, [square, doubled]);
+     *
+     * func(9, 3);
+     * // => [81, 6]
+     *
+     * func(10, 5);
+     * // => [100, 10]
+     */
+    var overArgs = castRest(function(func, transforms) {
+      transforms = (transforms.length == 1 && isArray(transforms[0]))
+        ? arrayMap(transforms[0], baseUnary(getIteratee()))
+        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));
+
+      var funcsLength = transforms.length;
+      return baseRest(function(args) {
+        var index = -1,
+            length = nativeMin(args.length, funcsLength);
+
+        while (++index < length) {
+          args[index] = transforms[index].call(this, args[index]);
+        }
+        return apply(func, this, args);
+      });
+    });
+
+    /**
+     * Creates a function that invokes `func` with `partials` prepended to the
+     * arguments it receives. This method is like `_.bind` except it does **not**
+     * alter the `this` binding.
      *
      * The `_.partial.placeholder` value, which defaults to `_` in monolithic
      * builds, may be used as a placeholder for partially applied arguments.
      *
-     * **Note:** This method does not set the "length" property of partially
+     * **Note:** This method doesn't set the "length" property of partially
      * applied functions.
      *
      * @static
      * @memberOf _
+     * @since 0.2.0
      * @category Function
      * @param {Function} func The function to partially apply arguments to.
      * @param {...*} [partials] The arguments to be partially applied.
      * @returns {Function} Returns the new partially applied function.
      * @example
      *
-     * var greet = function(greeting, name) {
+     * function greet(greeting, name) {
      *   return greeting + ' ' + name;
-     * };
+     * }
      *
      * var sayHelloTo = _.partial(greet, 'hello');
      * sayHelloTo('fred');
      * // => 'hello fred'
      *
-     * // using placeholders
+     * // Partially applied with placeholders.
      * var greetFred = _.partial(greet, _, 'fred');
      * greetFred('hi');
      * // => 'hi fred'
      */
-    var partial = createPartial(PARTIAL_FLAG);
+    var partial = baseRest(function(func, partials) {
+      var holders = replaceHolders(partials, getHolder(partial));
+      return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);
+    });
 
     /**
      * This method is like `_.partial` except that partially applied arguments
-     * are appended to those provided to the new function.
+     * are appended to the arguments it receives.
      *
      * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic
      * builds, may be used as a placeholder for partially applied arguments.
      *
-     * **Note:** This method does not set the "length" property of partially
+     * **Note:** This method doesn't set the "length" property of partially
      * applied functions.
      *
      * @static
      * @memberOf _
+     * @since 1.0.0
      * @category Function
      * @param {Function} func The function to partially apply arguments to.
      * @param {...*} [partials] The arguments to be partially applied.
      * @returns {Function} Returns the new partially applied function.
      * @example
      *
-     * var greet = function(greeting, name) {
+     * function greet(greeting, name) {
      *   return greeting + ' ' + name;
-     * };
+     * }
      *
      * var greetFred = _.partialRight(greet, 'fred');
      * greetFred('hi');
      * // => 'hi fred'
      *
-     * // using placeholders
+     * // Partially applied with placeholders.
      * var sayHelloTo = _.partialRight(greet, 'hello', _);
      * sayHelloTo('fred');
      * // => 'hello fred'
      */
-    var partialRight = createPartial(PARTIAL_RIGHT_FLAG);
+    var partialRight = baseRest(function(func, partials) {
+      var holders = replaceHolders(partials, getHolder(partialRight));
+      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);
+    });
 
     /**
      * Creates a function that invokes `func` with arguments arranged according
-     * to the specified indexes where the argument value at the first index is
+     * to the specified `indexes` where the argument value at the first index is
      * provided as the first argument, the argument value at the second index is
      * provided as the second argument, and so on.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Function
      * @param {Function} func The function to rearrange arguments for.
-     * @param {...(number|number[])} indexes The arranged argument indexes,
-     *  specified as individual indexes or arrays of indexes.
+     * @param {...(number|number[])} indexes The arranged argument indexes.
      * @returns {Function} Returns the new function.
      * @example
      *
      * var rearged = _.rearg(function(a, b, c) {
      *   return [a, b, c];
-     * }, 2, 0, 1);
+     * }, [2, 0, 1]);
      *
      * rearged('b', 'c', 'a')
      * // => ['a', 'b', 'c']
-     *
-     * var map = _.rearg(_.map, [1, 0]);
-     * map(function(n) {
-     *   return n * 3;
-     * }, [1, 2, 3]);
-     * // => [3, 6, 9]
      */
-    var rearg = restParam(function(func, indexes) {
-      return createWrapper(func, REARG_FLAG, undefined, undefined, undefined, baseFlatten(indexes));
+    var rearg = flatRest(function(func, indexes) {
+      return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);
     });
 
     /**
      * Creates a function that invokes `func` with the `this` binding of the
-     * created function and arguments from `start` and beyond provided as an array.
+     * created function and arguments from `start` and beyond provided as
+     * an array.
      *
-     * **Note:** This method is based on the [rest parameter](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/rest_parameters).
+     * **Note:** This method is based on the
+     * [rest parameter](https://mdn.io/rest_parameters).
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Function
      * @param {Function} func The function to apply a rest parameter to.
      * @param {number} [start=func.length-1] The start position of the rest parameter.
      * @returns {Function} Returns the new function.
      * @example
      *
-     * var say = _.restParam(function(what, names) {
+     * var say = _.rest(function(what, names) {
      *   return what + ' ' + _.initial(names).join(', ') +
      *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);
      * });
@@ -16084,45 +16101,28 @@ module.exports = ClipperLib;
      * say('hello', 'fred', 'barney', 'pebbles');
      * // => 'hello fred, barney, & pebbles'
      */
-    function restParam(func, start) {
+    function rest(func, start) {
       if (typeof func != 'function') {
         throw new TypeError(FUNC_ERROR_TEXT);
       }
-      start = nativeMax(start === undefined ? (func.length - 1) : (+start || 0), 0);
-      return function() {
-        var args = arguments,
-            index = -1,
-            length = nativeMax(args.length - start, 0),
-            rest = Array(length);
-
-        while (++index < length) {
-          rest[index] = args[start + index];
-        }
-        switch (start) {
-          case 0: return func.call(this, rest);
-          case 1: return func.call(this, args[0], rest);
-          case 2: return func.call(this, args[0], args[1], rest);
-        }
-        var otherArgs = Array(start + 1);
-        index = -1;
-        while (++index < start) {
-          otherArgs[index] = args[index];
-        }
-        otherArgs[start] = rest;
-        return func.apply(this, otherArgs);
-      };
+      start = start === undefined ? start : toInteger(start);
+      return baseRest(func, start);
     }
 
     /**
-     * Creates a function that invokes `func` with the `this` binding of the created
-     * function and an array of arguments much like [`Function#apply`](https://es5.github.io/#x15.3.4.3).
+     * Creates a function that invokes `func` with the `this` binding of the
+     * create function and an array of arguments much like
+     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).
      *
-     * **Note:** This method is based on the [spread operator](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Spread_operator).
+     * **Note:** This method is based on the
+     * [spread operator](https://mdn.io/spread_operator).
      *
      * @static
      * @memberOf _
+     * @since 3.2.0
      * @category Function
      * @param {Function} func The function to spread arguments over.
+     * @param {number} [start=0] The start position of the spread.
      * @returns {Function} Returns the new function.
      * @example
      *
@@ -16133,7 +16133,6 @@ module.exports = ClipperLib;
      * say(['fred', 'hello']);
      * // => 'fred says hello'
      *
-     * // with a Promise
      * var numbers = Promise.all([
      *   Promise.resolve(40),
      *   Promise.resolve(36)
@@ -16144,52 +16143,64 @@ module.exports = ClipperLib;
      * }));
      * // => a Promise of 76
      */
-    function spread(func) {
+    function spread(func, start) {
       if (typeof func != 'function') {
         throw new TypeError(FUNC_ERROR_TEXT);
       }
-      return function(array) {
-        return func.apply(this, array);
-      };
+      start = start == null ? 0 : nativeMax(toInteger(start), 0);
+      return baseRest(function(args) {
+        var array = args[start],
+            otherArgs = castSlice(args, 0, start);
+
+        if (array) {
+          arrayPush(otherArgs, array);
+        }
+        return apply(func, this, otherArgs);
+      });
     }
 
     /**
      * Creates a throttled function that only invokes `func` at most once per
      * every `wait` milliseconds. The throttled function comes with a `cancel`
-     * method to cancel delayed invocations. Provide an options object to indicate
-     * that `func` should be invoked on the leading and/or trailing edge of the
-     * `wait` timeout. Subsequent calls to the throttled function return the
-     * result of the last `func` call.
+     * method to cancel delayed `func` invocations and a `flush` method to
+     * immediately invoke them. Provide `options` to indicate whether `func`
+     * should be invoked on the leading and/or trailing edge of the `wait`
+     * timeout. The `func` is invoked with the last arguments provided to the
+     * throttled function. Subsequent calls to the throttled function return the
+     * result of the last `func` invocation.
+     *
+     * **Note:** If `leading` and `trailing` options are `true`, `func` is
+     * invoked on the trailing edge of the timeout only if the throttled function
+     * is invoked more than once during the `wait` timeout.
      *
-     * **Note:** If `leading` and `trailing` options are `true`, `func` is invoked
-     * on the trailing edge of the timeout only if the the throttled function is
-     * invoked more than once during the `wait` timeout.
+     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
+     * until to the next tick, similar to `setTimeout` with a timeout of `0`.
      *
-     * See [David Corbacho's article](http://drupalmotion.com/article/debounce-and-throttle-visual-explanation)
+     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
      * for details over the differences between `_.throttle` and `_.debounce`.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Function
      * @param {Function} func The function to throttle.
      * @param {number} [wait=0] The number of milliseconds to throttle invocations to.
-     * @param {Object} [options] The options object.
-     * @param {boolean} [options.leading=true] Specify invoking on the leading
-     *  edge of the timeout.
-     * @param {boolean} [options.trailing=true] Specify invoking on the trailing
-     *  edge of the timeout.
+     * @param {Object} [options={}] The options object.
+     * @param {boolean} [options.leading=true]
+     *  Specify invoking on the leading edge of the timeout.
+     * @param {boolean} [options.trailing=true]
+     *  Specify invoking on the trailing edge of the timeout.
      * @returns {Function} Returns the new throttled function.
      * @example
      *
-     * // avoid excessively updating the position while scrolling
+     * // Avoid excessively updating the position while scrolling.
      * jQuery(window).on('scroll', _.throttle(updatePosition, 100));
      *
-     * // invoke `renewToken` when the click event is fired, but not more than once every 5 minutes
-     * jQuery('.interactive').on('click', _.throttle(renewToken, 300000, {
-     *   'trailing': false
-     * }));
+     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.
+     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });
+     * jQuery(element).on('click', throttled);
      *
-     * // cancel a trailing throttled call
+     * // Cancel the trailing throttled invocation.
      * jQuery(window).on('popstate', throttled.cancel);
      */
     function throttle(func, wait, options) {
@@ -16199,26 +16210,48 @@ module.exports = ClipperLib;
       if (typeof func != 'function') {
         throw new TypeError(FUNC_ERROR_TEXT);
       }
-      if (options === false) {
-        leading = false;
-      } else if (isObject(options)) {
+      if (isObject(options)) {
         leading = 'leading' in options ? !!options.leading : leading;
         trailing = 'trailing' in options ? !!options.trailing : trailing;
       }
-      return debounce(func, wait, { 'leading': leading, 'maxWait': +wait, 'trailing': trailing });
+      return debounce(func, wait, {
+        'leading': leading,
+        'maxWait': wait,
+        'trailing': trailing
+      });
+    }
+
+    /**
+     * Creates a function that accepts up to one argument, ignoring any
+     * additional arguments.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Function
+     * @param {Function} func The function to cap arguments for.
+     * @returns {Function} Returns the new capped function.
+     * @example
+     *
+     * _.map(['6', '8', '10'], _.unary(parseInt));
+     * // => [6, 8, 10]
+     */
+    function unary(func) {
+      return ary(func, 1);
     }
 
     /**
-     * Creates a function that provides `value` to the wrapper function as its
-     * first argument. Any additional arguments provided to the function are
-     * appended to those provided to the wrapper function. The wrapper is invoked
-     * with the `this` binding of the created function.
+     * Creates a function that provides `value` to `wrapper` as its first
+     * argument. Any additional arguments provided to the function are appended
+     * to those provided to the `wrapper`. The wrapper is invoked with the `this`
+     * binding of the created function.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Function
      * @param {*} value The value to wrap.
-     * @param {Function} wrapper The wrapper function.
+     * @param {Function} [wrapper=identity] The wrapper function.
      * @returns {Function} Returns the new function.
      * @example
      *
@@ -16230,126 +16263,235 @@ module.exports = ClipperLib;
      * // => '<p>fred, barney, &amp; pebbles</p>'
      */
     function wrap(value, wrapper) {
-      wrapper = wrapper == null ? identity : wrapper;
-      return createWrapper(wrapper, PARTIAL_FLAG, undefined, [value], []);
+      return partial(castFunction(wrapper), value);
     }
 
     /*------------------------------------------------------------------------*/
 
     /**
-     * Creates a clone of `value`. If `isDeep` is `true` nested objects are cloned,
-     * otherwise they are assigned by reference. If `customizer` is provided it is
-     * invoked to produce the cloned values. If `customizer` returns `undefined`
-     * cloning is handled by the method instead. The `customizer` is bound to
-     * `thisArg` and invoked with two argument; (value [, index|key, object]).
+     * Casts `value` as an array if it's not one.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.4.0
+     * @category Lang
+     * @param {*} value The value to inspect.
+     * @returns {Array} Returns the cast array.
+     * @example
+     *
+     * _.castArray(1);
+     * // => [1]
+     *
+     * _.castArray({ 'a': 1 });
+     * // => [{ 'a': 1 }]
+     *
+     * _.castArray('abc');
+     * // => ['abc']
+     *
+     * _.castArray(null);
+     * // => [null]
+     *
+     * _.castArray(undefined);
+     * // => [undefined]
+     *
+     * _.castArray();
+     * // => []
+     *
+     * var array = [1, 2, 3];
+     * console.log(_.castArray(array) === array);
+     * // => true
+     */
+    function castArray() {
+      if (!arguments.length) {
+        return [];
+      }
+      var value = arguments[0];
+      return isArray(value) ? value : [value];
+    }
+
+    /**
+     * Creates a shallow clone of `value`.
      *
      * **Note:** This method is loosely based on the
-     * [structured clone algorithm](http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm).
-     * The enumerable properties of `arguments` objects and objects created by
-     * constructors other than `Object` are cloned to plain `Object` objects. An
-     * empty object is returned for uncloneable values such as functions, DOM nodes,
-     * Maps, Sets, and WeakMaps.
+     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)
+     * and supports cloning arrays, array buffers, booleans, date objects, maps,
+     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed
+     * arrays. The own enumerable properties of `arguments` objects are cloned
+     * as plain objects. An empty object is returned for uncloneable values such
+     * as error objects, functions, DOM nodes, and WeakMaps.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to clone.
-     * @param {boolean} [isDeep] Specify a deep clone.
-     * @param {Function} [customizer] The function to customize cloning values.
-     * @param {*} [thisArg] The `this` binding of `customizer`.
      * @returns {*} Returns the cloned value.
+     * @see _.cloneDeep
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney' },
-     *   { 'user': 'fred' }
-     * ];
+     * var objects = [{ 'a': 1 }, { 'b': 2 }];
      *
-     * var shallow = _.clone(users);
-     * shallow[0] === users[0];
+     * var shallow = _.clone(objects);
+     * console.log(shallow[0] === objects[0]);
      * // => true
+     */
+    function clone(value) {
+      return baseClone(value, CLONE_SYMBOLS_FLAG);
+    }
+
+    /**
+     * This method is like `_.clone` except that it accepts `customizer` which
+     * is invoked to produce the cloned value. If `customizer` returns `undefined`,
+     * cloning is handled by the method instead. The `customizer` is invoked with
+     * up to four arguments; (value [, index|key, object, stack]).
      *
-     * var deep = _.clone(users, true);
-     * deep[0] === users[0];
-     * // => false
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to clone.
+     * @param {Function} [customizer] The function to customize cloning.
+     * @returns {*} Returns the cloned value.
+     * @see _.cloneDeepWith
+     * @example
      *
-     * // using a customizer callback
-     * var el = _.clone(document.body, function(value) {
+     * function customizer(value) {
      *   if (_.isElement(value)) {
      *     return value.cloneNode(false);
      *   }
-     * });
+     * }
+     *
+     * var el = _.cloneWith(document.body, customizer);
      *
-     * el === document.body
+     * console.log(el === document.body);
      * // => false
-     * el.nodeName
-     * // => BODY
-     * el.childNodes.length;
+     * console.log(el.nodeName);
+     * // => 'BODY'
+     * console.log(el.childNodes.length);
      * // => 0
      */
-    function clone(value, isDeep, customizer, thisArg) {
-      if (isDeep && typeof isDeep != 'boolean' && isIterateeCall(value, isDeep, customizer)) {
-        isDeep = false;
-      }
-      else if (typeof isDeep == 'function') {
-        thisArg = customizer;
-        customizer = isDeep;
-        isDeep = false;
-      }
-      return typeof customizer == 'function'
-        ? baseClone(value, isDeep, bindCallback(customizer, thisArg, 1))
-        : baseClone(value, isDeep);
+    function cloneWith(value, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined;
+      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);
     }
 
     /**
-     * Creates a deep clone of `value`. If `customizer` is provided it is invoked
-     * to produce the cloned values. If `customizer` returns `undefined` cloning
-     * is handled by the method instead. The `customizer` is bound to `thisArg`
-     * and invoked with two argument; (value [, index|key, object]).
-     *
-     * **Note:** This method is loosely based on the
-     * [structured clone algorithm](http://www.w3.org/TR/html5/infrastructure.html#internal-structured-cloning-algorithm).
-     * The enumerable properties of `arguments` objects and objects created by
-     * constructors other than `Object` are cloned to plain `Object` objects. An
-     * empty object is returned for uncloneable values such as functions, DOM nodes,
-     * Maps, Sets, and WeakMaps.
+     * This method is like `_.clone` except that it recursively clones `value`.
      *
      * @static
      * @memberOf _
+     * @since 1.0.0
      * @category Lang
-     * @param {*} value The value to deep clone.
-     * @param {Function} [customizer] The function to customize cloning values.
-     * @param {*} [thisArg] The `this` binding of `customizer`.
+     * @param {*} value The value to recursively clone.
      * @returns {*} Returns the deep cloned value.
+     * @see _.clone
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney' },
-     *   { 'user': 'fred' }
-     * ];
+     * var objects = [{ 'a': 1 }, { 'b': 2 }];
      *
-     * var deep = _.cloneDeep(users);
-     * deep[0] === users[0];
+     * var deep = _.cloneDeep(objects);
+     * console.log(deep[0] === objects[0]);
      * // => false
+     */
+    function cloneDeep(value) {
+      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);
+    }
+
+    /**
+     * This method is like `_.cloneWith` except that it recursively clones `value`.
      *
-     * // using a customizer callback
-     * var el = _.cloneDeep(document.body, function(value) {
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to recursively clone.
+     * @param {Function} [customizer] The function to customize cloning.
+     * @returns {*} Returns the deep cloned value.
+     * @see _.cloneWith
+     * @example
+     *
+     * function customizer(value) {
      *   if (_.isElement(value)) {
      *     return value.cloneNode(true);
      *   }
-     * });
+     * }
      *
-     * el === document.body
+     * var el = _.cloneDeepWith(document.body, customizer);
+     *
+     * console.log(el === document.body);
      * // => false
-     * el.nodeName
-     * // => BODY
-     * el.childNodes.length;
+     * console.log(el.nodeName);
+     * // => 'BODY'
+     * console.log(el.childNodes.length);
      * // => 20
      */
-    function cloneDeep(value, customizer, thisArg) {
-      return typeof customizer == 'function'
-        ? baseClone(value, true, bindCallback(customizer, thisArg, 1))
-        : baseClone(value, true);
+    function cloneDeepWith(value, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined;
+      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);
+    }
+
+    /**
+     * Checks if `object` conforms to `source` by invoking the predicate
+     * properties of `source` with the corresponding property values of `object`.
+     *
+     * **Note:** This method is equivalent to `_.conforms` when `source` is
+     * partially applied.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.14.0
+     * @category Lang
+     * @param {Object} object The object to inspect.
+     * @param {Object} source The object of property predicates to conform to.
+     * @returns {boolean} Returns `true` if `object` conforms, else `false`.
+     * @example
+     *
+     * var object = { 'a': 1, 'b': 2 };
+     *
+     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });
+     * // => true
+     *
+     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });
+     * // => false
+     */
+    function conformsTo(object, source) {
+      return source == null || baseConformsTo(object, source, keys(source));
+    }
+
+    /**
+     * Performs a
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * comparison between two values to determine if they are equivalent.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+     * @example
+     *
+     * var object = { 'a': 1 };
+     * var other = { 'a': 1 };
+     *
+     * _.eq(object, object);
+     * // => true
+     *
+     * _.eq(object, other);
+     * // => false
+     *
+     * _.eq('a', 'a');
+     * // => true
+     *
+     * _.eq('a', Object('a'));
+     * // => false
+     *
+     * _.eq(NaN, NaN);
+     * // => true
+     */
+    function eq(value, other) {
+      return value === other || (value !== value && other !== other);
     }
 
     /**
@@ -16357,10 +16499,13 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.9.0
      * @category Lang
      * @param {*} value The value to compare.
      * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is greater than `other`, else `false`.
+     * @returns {boolean} Returns `true` if `value` is greater than `other`,
+     *  else `false`.
+     * @see _.lt
      * @example
      *
      * _.gt(3, 1);
@@ -16372,19 +16517,20 @@ module.exports = ClipperLib;
      * _.gt(1, 3);
      * // => false
      */
-    function gt(value, other) {
-      return value > other;
-    }
+    var gt = createRelationalOperation(baseGt);
 
     /**
      * Checks if `value` is greater than or equal to `other`.
      *
      * @static
      * @memberOf _
+     * @since 3.9.0
      * @category Lang
      * @param {*} value The value to compare.
      * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is greater than or equal to `other`, else `false`.
+     * @returns {boolean} Returns `true` if `value` is greater than or equal to
+     *  `other`, else `false`.
+     * @see _.lte
      * @example
      *
      * _.gte(3, 1);
@@ -16396,18 +16542,20 @@ module.exports = ClipperLib;
      * _.gte(1, 3);
      * // => false
      */
-    function gte(value, other) {
+    var gte = createRelationalOperation(function(value, other) {
       return value >= other;
-    }
+    });
 
     /**
-     * Checks if `value` is classified as an `arguments` object.
+     * Checks if `value` is likely an `arguments` object.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+     * @returns {boolean} Returns `true` if `value` is an `arguments` object,
+     *  else `false`.
      * @example
      *
      * _.isArguments(function() { return arguments; }());
@@ -16416,177 +16564,319 @@ module.exports = ClipperLib;
      * _.isArguments([1, 2, 3]);
      * // => false
      */
-    function isArguments(value) {
-      return isObjectLike(value) && isArrayLike(value) &&
-        hasOwnProperty.call(value, 'callee') && !propertyIsEnumerable.call(value, 'callee');
-    }
+    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {
+      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&
+        !propertyIsEnumerable.call(value, 'callee');
+    };
 
     /**
      * Checks if `value` is classified as an `Array` object.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+     * @returns {boolean} Returns `true` if `value` is an array, else `false`.
      * @example
      *
      * _.isArray([1, 2, 3]);
      * // => true
      *
-     * _.isArray(function() { return arguments; }());
+     * _.isArray(document.body.children);
+     * // => false
+     *
+     * _.isArray('abc');
+     * // => false
+     *
+     * _.isArray(_.noop);
      * // => false
      */
-    var isArray = nativeIsArray || function(value) {
-      return isObjectLike(value) && isLength(value.length) && objToString.call(value) == arrayTag;
-    };
+    var isArray = Array.isArray;
 
     /**
-     * Checks if `value` is classified as a boolean primitive or object.
+     * Checks if `value` is classified as an `ArrayBuffer` object.
      *
      * @static
      * @memberOf _
+     * @since 4.3.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.
      * @example
      *
-     * _.isBoolean(false);
+     * _.isArrayBuffer(new ArrayBuffer(2));
      * // => true
      *
-     * _.isBoolean(null);
+     * _.isArrayBuffer(new Array(2));
      * // => false
      */
-    function isBoolean(value) {
-      return value === true || value === false || (isObjectLike(value) && objToString.call(value) == boolTag);
-    }
+    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;
 
     /**
-     * Checks if `value` is classified as a `Date` object.
+     * Checks if `value` is array-like. A value is considered array-like if it's
+     * not a function and has a `value.length` that's an integer greater than or
+     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
      * @example
      *
-     * _.isDate(new Date);
+     * _.isArrayLike([1, 2, 3]);
      * // => true
      *
-     * _.isDate('Mon April 23 2012');
+     * _.isArrayLike(document.body.children);
+     * // => true
+     *
+     * _.isArrayLike('abc');
+     * // => true
+     *
+     * _.isArrayLike(_.noop);
      * // => false
      */
-    function isDate(value) {
-      return isObjectLike(value) && objToString.call(value) == dateTag;
+    function isArrayLike(value) {
+      return value != null && isLength(value.length) && !isFunction(value);
     }
 
     /**
-     * Checks if `value` is a DOM element.
+     * This method is like `_.isArrayLike` except that it also checks if `value`
+     * is an object.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.
+     * @returns {boolean} Returns `true` if `value` is an array-like object,
+     *  else `false`.
      * @example
      *
-     * _.isElement(document.body);
+     * _.isArrayLikeObject([1, 2, 3]);
      * // => true
      *
-     * _.isElement('<body>');
+     * _.isArrayLikeObject(document.body.children);
+     * // => true
+     *
+     * _.isArrayLikeObject('abc');
+     * // => false
+     *
+     * _.isArrayLikeObject(_.noop);
      * // => false
      */
-    function isElement(value) {
-      return !!value && value.nodeType === 1 && isObjectLike(value) && !isPlainObject(value);
+    function isArrayLikeObject(value) {
+      return isObjectLike(value) && isArrayLike(value);
     }
 
     /**
-     * Checks if `value` is empty. A value is considered empty unless it is an
-     * `arguments` object, array, string, or jQuery-like collection with a length
-     * greater than `0` or an object with own enumerable properties.
+     * Checks if `value` is classified as a boolean primitive or object.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
-     * @param {Array|Object|string} value The value to inspect.
-     * @returns {boolean} Returns `true` if `value` is empty, else `false`.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.
      * @example
      *
-     * _.isEmpty(null);
-     * // => true
-     *
-     * _.isEmpty(true);
-     * // => true
-     *
-     * _.isEmpty(1);
+     * _.isBoolean(false);
      * // => true
      *
-     * _.isEmpty([1, 2, 3]);
-     * // => false
-     *
-     * _.isEmpty({ 'a': 1 });
+     * _.isBoolean(null);
      * // => false
      */
-    function isEmpty(value) {
-      if (value == null) {
-        return true;
-      }
-      if (isArrayLike(value) && (isArray(value) || isString(value) || isArguments(value) ||
-          (isObjectLike(value) && isFunction(value.splice)))) {
+    function isBoolean(value) {
+      return value === true || value === false ||
+        (isObjectLike(value) && baseGetTag(value) == boolTag);
+    }
+
+    /**
+     * Checks if `value` is a buffer.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.
+     * @example
+     *
+     * _.isBuffer(new Buffer(2));
+     * // => true
+     *
+     * _.isBuffer(new Uint8Array(2));
+     * // => false
+     */
+    var isBuffer = nativeIsBuffer || stubFalse;
+
+    /**
+     * Checks if `value` is classified as a `Date` object.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.
+     * @example
+     *
+     * _.isDate(new Date);
+     * // => true
+     *
+     * _.isDate('Mon April 23 2012');
+     * // => false
+     */
+    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;
+
+    /**
+     * Checks if `value` is likely a DOM element.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.
+     * @example
+     *
+     * _.isElement(document.body);
+     * // => true
+     *
+     * _.isElement('<body>');
+     * // => false
+     */
+    function isElement(value) {
+      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);
+    }
+
+    /**
+     * Checks if `value` is an empty object, collection, map, or set.
+     *
+     * Objects are considered empty if they have no own enumerable string keyed
+     * properties.
+     *
+     * Array-like values such as `arguments` objects, arrays, buffers, strings, or
+     * jQuery-like collections are considered empty if they have a `length` of `0`.
+     * Similarly, maps and sets are considered empty if they have a `size` of `0`.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is empty, else `false`.
+     * @example
+     *
+     * _.isEmpty(null);
+     * // => true
+     *
+     * _.isEmpty(true);
+     * // => true
+     *
+     * _.isEmpty(1);
+     * // => true
+     *
+     * _.isEmpty([1, 2, 3]);
+     * // => false
+     *
+     * _.isEmpty({ 'a': 1 });
+     * // => false
+     */
+    function isEmpty(value) {
+      if (value == null) {
+        return true;
+      }
+      if (isArrayLike(value) &&
+          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||
+            isBuffer(value) || isTypedArray(value) || isArguments(value))) {
         return !value.length;
       }
-      return !keys(value).length;
+      var tag = getTag(value);
+      if (tag == mapTag || tag == setTag) {
+        return !value.size;
+      }
+      if (isPrototype(value)) {
+        return !baseKeys(value).length;
+      }
+      for (var key in value) {
+        if (hasOwnProperty.call(value, key)) {
+          return false;
+        }
+      }
+      return true;
     }
 
     /**
      * Performs a deep comparison between two values to determine if they are
-     * equivalent. If `customizer` is provided it is invoked to compare values.
-     * If `customizer` returns `undefined` comparisons are handled by the method
-     * instead. The `customizer` is bound to `thisArg` and invoked with three
-     * arguments: (value, other [, index|key]).
+     * equivalent.
      *
-     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
-     * numbers, `Object` objects, regexes, and strings. Objects are compared by
-     * their own, not inherited, enumerable properties. Functions and DOM nodes
-     * are **not** supported. Provide a customizer function to extend support
-     * for comparing other values.
+     * **Note:** This method supports comparing arrays, array buffers, booleans,
+     * date objects, error objects, maps, numbers, `Object` objects, regexes,
+     * sets, strings, symbols, and typed arrays. `Object` objects are compared
+     * by their own, not inherited, enumerable properties. Functions and DOM
+     * nodes are compared by strict equality, i.e. `===`.
      *
      * @static
      * @memberOf _
-     * @alias eq
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to compare.
      * @param {*} other The other value to compare.
-     * @param {Function} [customizer] The function to customize value comparisons.
-     * @param {*} [thisArg] The `this` binding of `customizer`.
      * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
      * @example
      *
-     * var object = { 'user': 'fred' };
-     * var other = { 'user': 'fred' };
-     *
-     * object == other;
-     * // => false
+     * var object = { 'a': 1 };
+     * var other = { 'a': 1 };
      *
      * _.isEqual(object, other);
      * // => true
      *
-     * // using a customizer callback
-     * var array = ['hello', 'goodbye'];
-     * var other = ['hi', 'goodbye'];
+     * object === other;
+     * // => false
+     */
+    function isEqual(value, other) {
+      return baseIsEqual(value, other);
+    }
+
+    /**
+     * This method is like `_.isEqual` except that it accepts `customizer` which
+     * is invoked to compare values. If `customizer` returns `undefined`, comparisons
+     * are handled by the method instead. The `customizer` is invoked with up to
+     * six arguments: (objValue, othValue [, index|key, object, other, stack]).
      *
-     * _.isEqual(array, other, function(value, other) {
-     *   if (_.every([value, other], RegExp.prototype.test, /^h(?:i|ello)$/)) {
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @param {Function} [customizer] The function to customize comparisons.
+     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+     * @example
+     *
+     * function isGreeting(value) {
+     *   return /^h(?:i|ello)$/.test(value);
+     * }
+     *
+     * function customizer(objValue, othValue) {
+     *   if (isGreeting(objValue) && isGreeting(othValue)) {
      *     return true;
      *   }
-     * });
+     * }
+     *
+     * var array = ['hello', 'goodbye'];
+     * var other = ['hi', 'goodbye'];
+     *
+     * _.isEqualWith(array, other, customizer);
      * // => true
      */
-    function isEqual(value, other, customizer, thisArg) {
-      customizer = typeof customizer == 'function' ? bindCallback(customizer, thisArg, 3) : undefined;
+    function isEqualWith(value, other, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined;
       var result = customizer ? customizer(value, other) : undefined;
-      return  result === undefined ? baseIsEqual(value, other, customizer) : !!result;
+      return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;
     }
 
     /**
@@ -16595,6 +16885,7 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Lang
      * @param {*} value The value to check.
      * @returns {boolean} Returns `true` if `value` is an error object, else `false`.
@@ -16607,34 +16898,38 @@ module.exports = ClipperLib;
      * // => false
      */
     function isError(value) {
-      return isObjectLike(value) && typeof value.message == 'string' && objToString.call(value) == errorTag;
+      if (!isObjectLike(value)) {
+        return false;
+      }
+      var tag = baseGetTag(value);
+      return tag == errorTag || tag == domExcTag ||
+        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));
     }
 
     /**
      * Checks if `value` is a finite primitive number.
      *
-     * **Note:** This method is based on [`Number.isFinite`](http://ecma-international.org/ecma-262/6.0/#sec-number.isfinite).
+     * **Note:** This method is based on
+     * [`Number.isFinite`](https://mdn.io/Number/isFinite).
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to check.
      * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.
      * @example
      *
-     * _.isFinite(10);
+     * _.isFinite(3);
      * // => true
      *
-     * _.isFinite('10');
-     * // => false
-     *
-     * _.isFinite(true);
-     * // => false
+     * _.isFinite(Number.MIN_VALUE);
+     * // => true
      *
-     * _.isFinite(Object(10));
+     * _.isFinite(Infinity);
      * // => false
      *
-     * _.isFinite(Infinity);
+     * _.isFinite('3');
      * // => false
      */
     function isFinite(value) {
@@ -16646,9 +16941,10 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+     * @returns {boolean} Returns `true` if `value` is a function, else `false`.
      * @example
      *
      * _.isFunction(_);
@@ -16658,18 +16954,84 @@ module.exports = ClipperLib;
      * // => false
      */
     function isFunction(value) {
+      if (!isObject(value)) {
+        return false;
+      }
       // The use of `Object#toString` avoids issues with the `typeof` operator
-      // in older versions of Chrome and Safari which return 'function' for regexes
-      // and Safari 8 equivalents which return 'object' for typed array constructors.
-      return isObject(value) && objToString.call(value) == funcTag;
+      // in Safari 9 which returns 'object' for typed arrays and other constructors.
+      var tag = baseGetTag(value);
+      return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;
+    }
+
+    /**
+     * Checks if `value` is an integer.
+     *
+     * **Note:** This method is based on
+     * [`Number.isInteger`](https://mdn.io/Number/isInteger).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an integer, else `false`.
+     * @example
+     *
+     * _.isInteger(3);
+     * // => true
+     *
+     * _.isInteger(Number.MIN_VALUE);
+     * // => false
+     *
+     * _.isInteger(Infinity);
+     * // => false
+     *
+     * _.isInteger('3');
+     * // => false
+     */
+    function isInteger(value) {
+      return typeof value == 'number' && value == toInteger(value);
+    }
+
+    /**
+     * Checks if `value` is a valid array-like length.
+     *
+     * **Note:** This method is loosely based on
+     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.
+     * @example
+     *
+     * _.isLength(3);
+     * // => true
+     *
+     * _.isLength(Number.MIN_VALUE);
+     * // => false
+     *
+     * _.isLength(Infinity);
+     * // => false
+     *
+     * _.isLength('3');
+     * // => false
+     */
+    function isLength(value) {
+      return typeof value == 'number' &&
+        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
     }
 
     /**
-     * Checks if `value` is the [language type](https://es5.github.io/#x8) of `Object`.
-     * (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
+     * Checks if `value` is the
+     * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)
+     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to check.
      * @returns {boolean} Returns `true` if `value` is an object, else `false`.
@@ -16681,68 +17043,144 @@ module.exports = ClipperLib;
      * _.isObject([1, 2, 3]);
      * // => true
      *
-     * _.isObject(1);
+     * _.isObject(_.noop);
+     * // => true
+     *
+     * _.isObject(null);
      * // => false
      */
     function isObject(value) {
-      // Avoid a V8 JIT bug in Chrome 19-20.
-      // See https://code.google.com/p/v8/issues/detail?id=2291 for more details.
       var type = typeof value;
-      return !!value && (type == 'object' || type == 'function');
+      return value != null && (type == 'object' || type == 'function');
+    }
+
+    /**
+     * Checks if `value` is object-like. A value is object-like if it's not `null`
+     * and has a `typeof` result of "object".
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
+     * @example
+     *
+     * _.isObjectLike({});
+     * // => true
+     *
+     * _.isObjectLike([1, 2, 3]);
+     * // => true
+     *
+     * _.isObjectLike(_.noop);
+     * // => false
+     *
+     * _.isObjectLike(null);
+     * // => false
+     */
+    function isObjectLike(value) {
+      return value != null && typeof value == 'object';
     }
 
     /**
-     * Performs a deep comparison between `object` and `source` to determine if
-     * `object` contains equivalent property values. If `customizer` is provided
-     * it is invoked to compare values. If `customizer` returns `undefined`
-     * comparisons are handled by the method instead. The `customizer` is bound
-     * to `thisArg` and invoked with three arguments: (value, other, index|key).
+     * Checks if `value` is classified as a `Map` object.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a map, else `false`.
+     * @example
+     *
+     * _.isMap(new Map);
+     * // => true
+     *
+     * _.isMap(new WeakMap);
+     * // => false
+     */
+    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;
+
+    /**
+     * Performs a partial deep comparison between `object` and `source` to
+     * determine if `object` contains equivalent property values.
+     *
+     * **Note:** This method is equivalent to `_.matches` when `source` is
+     * partially applied.
      *
-     * **Note:** This method supports comparing properties of arrays, booleans,
-     * `Date` objects, numbers, `Object` objects, regexes, and strings. Functions
-     * and DOM nodes are **not** supported. Provide a customizer function to extend
-     * support for comparing other values.
+     * Partial comparisons will match empty array and empty object `source`
+     * values against any array or object value, respectively. See `_.isEqual`
+     * for a list of supported value comparisons.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Lang
      * @param {Object} object The object to inspect.
      * @param {Object} source The object of property values to match.
-     * @param {Function} [customizer] The function to customize value comparisons.
-     * @param {*} [thisArg] The `this` binding of `customizer`.
      * @returns {boolean} Returns `true` if `object` is a match, else `false`.
      * @example
      *
-     * var object = { 'user': 'fred', 'age': 40 };
+     * var object = { 'a': 1, 'b': 2 };
      *
-     * _.isMatch(object, { 'age': 40 });
+     * _.isMatch(object, { 'b': 2 });
      * // => true
      *
-     * _.isMatch(object, { 'age': 36 });
+     * _.isMatch(object, { 'b': 1 });
      * // => false
+     */
+    function isMatch(object, source) {
+      return object === source || baseIsMatch(object, source, getMatchData(source));
+    }
+
+    /**
+     * This method is like `_.isMatch` except that it accepts `customizer` which
+     * is invoked to compare values. If `customizer` returns `undefined`, comparisons
+     * are handled by the method instead. The `customizer` is invoked with five
+     * arguments: (objValue, srcValue, index|key, object, source).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {Object} object The object to inspect.
+     * @param {Object} source The object of property values to match.
+     * @param {Function} [customizer] The function to customize comparisons.
+     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
+     * @example
+     *
+     * function isGreeting(value) {
+     *   return /^h(?:i|ello)$/.test(value);
+     * }
+     *
+     * function customizer(objValue, srcValue) {
+     *   if (isGreeting(objValue) && isGreeting(srcValue)) {
+     *     return true;
+     *   }
+     * }
      *
-     * // using a customizer callback
      * var object = { 'greeting': 'hello' };
      * var source = { 'greeting': 'hi' };
      *
-     * _.isMatch(object, source, function(value, other) {
-     *   return _.every([value, other], RegExp.prototype.test, /^h(?:i|ello)$/) || undefined;
-     * });
+     * _.isMatchWith(object, source, customizer);
      * // => true
      */
-    function isMatch(object, source, customizer, thisArg) {
-      customizer = typeof customizer == 'function' ? bindCallback(customizer, thisArg, 3) : undefined;
-      return baseIsMatch(object, getMatchData(source), customizer);
+    function isMatchWith(object, source, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined;
+      return baseIsMatch(object, source, getMatchData(source), customizer);
     }
 
     /**
      * Checks if `value` is `NaN`.
      *
-     * **Note:** This method is not the same as [`isNaN`](https://es5.github.io/#x15.1.2.4)
-     * which returns `true` for `undefined` and other non-numeric values.
+     * **Note:** This method is based on
+     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as
+     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for
+     * `undefined` and other non-number values.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to check.
      * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
@@ -16762,18 +17200,29 @@ module.exports = ClipperLib;
      */
     function isNaN(value) {
       // An `NaN` primitive is the only value that is not equal to itself.
-      // Perform the `toStringTag` check first to avoid errors with some host objects in IE.
+      // Perform the `toStringTag` check first to avoid errors with some
+      // ActiveX objects in IE.
       return isNumber(value) && value != +value;
     }
 
     /**
-     * Checks if `value` is a native function.
+     * Checks if `value` is a pristine native function.
+     *
+     * **Note:** This method can't reliably detect native functions in the presence
+     * of the core-js package because core-js circumvents this kind of detection.
+     * Despite multiple requests, the core-js maintainer has made it clear: any
+     * attempt to fix the detection will be obstructed. As a result, we're left
+     * with little choice but to throw an error. Unfortunately, this also affects
+     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),
+     * which rely on core-js.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a native function, else `false`.
+     * @returns {boolean} Returns `true` if `value` is a native function,
+     *  else `false`.
      * @example
      *
      * _.isNative(Array.prototype.push);
@@ -16783,13 +17232,10 @@ module.exports = ClipperLib;
      * // => false
      */
     function isNative(value) {
-      if (value == null) {
-        return false;
-      }
-      if (isFunction(value)) {
-        return reIsNative.test(fnToString.call(value));
+      if (isMaskable(value)) {
+        throw new Error(CORE_ERROR_TEXT);
       }
-      return isObjectLike(value) && reIsHostCtor.test(value);
+      return baseIsNative(value);
     }
 
     /**
@@ -16797,6 +17243,7 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to check.
      * @returns {boolean} Returns `true` if `value` is `null`, else `false`.
@@ -16812,41 +17259,68 @@ module.exports = ClipperLib;
       return value === null;
     }
 
+    /**
+     * Checks if `value` is `null` or `undefined`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is nullish, else `false`.
+     * @example
+     *
+     * _.isNil(null);
+     * // => true
+     *
+     * _.isNil(void 0);
+     * // => true
+     *
+     * _.isNil(NaN);
+     * // => false
+     */
+    function isNil(value) {
+      return value == null;
+    }
+
     /**
      * Checks if `value` is classified as a `Number` primitive or object.
      *
-     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are classified
-     * as numbers, use the `_.isFinite` method.
+     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are
+     * classified as numbers, use the `_.isFinite` method.
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+     * @returns {boolean} Returns `true` if `value` is a number, else `false`.
      * @example
      *
-     * _.isNumber(8.4);
+     * _.isNumber(3);
+     * // => true
+     *
+     * _.isNumber(Number.MIN_VALUE);
      * // => true
      *
-     * _.isNumber(NaN);
+     * _.isNumber(Infinity);
      * // => true
      *
-     * _.isNumber('8.4');
+     * _.isNumber('3');
      * // => false
      */
     function isNumber(value) {
-      return typeof value == 'number' || (isObjectLike(value) && objToString.call(value) == numberTag);
+      return typeof value == 'number' ||
+        (isObjectLike(value) && baseGetTag(value) == numberTag);
     }
 
     /**
      * Checks if `value` is a plain object, that is, an object created by the
      * `Object` constructor or one with a `[[Prototype]]` of `null`.
      *
-     * **Note:** This method assumes objects created by the `Object` constructor
-     * have no inherited enumerable properties.
-     *
      * @static
      * @memberOf _
+     * @since 0.8.0
      * @category Lang
      * @param {*} value The value to check.
      * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
@@ -16869,24 +17343,16 @@ module.exports = ClipperLib;
      * // => true
      */
     function isPlainObject(value) {
-      var Ctor;
-
-      // Exit early for non `Object` objects.
-      if (!(isObjectLike(value) && objToString.call(value) == objectTag && !isArguments(value)) ||
-          (!hasOwnProperty.call(value, 'constructor') && (Ctor = value.constructor, typeof Ctor == 'function' && !(Ctor instanceof Ctor)))) {
+      if (!isObjectLike(value) || baseGetTag(value) != objectTag) {
         return false;
       }
-      // IE < 9 iterates inherited properties before own properties. If the first
-      // iterated property is an object's own property then there are no inherited
-      // enumerable properties.
-      var result;
-      // In most environments an object's own properties are iterated before
-      // its inherited properties. If the last iterated property is an object's
-      // own property then there are no inherited enumerable properties.
-      baseForIn(value, function(subValue, key) {
-        result = key;
-      });
-      return result === undefined || hasOwnProperty.call(value, result);
+      var proto = getPrototype(value);
+      if (proto === null) {
+        return true;
+      }
+      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;
+      return typeof Ctor == 'function' && Ctor instanceof Ctor &&
+        funcToString.call(Ctor) == objectCtorString;
     }
 
     /**
@@ -16894,9 +17360,10 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 0.1.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.
      * @example
      *
      * _.isRegExp(/abc/);
@@ -16905,28 +17372,100 @@ module.exports = ClipperLib;
      * _.isRegExp('/abc/');
      * // => false
      */
-    function isRegExp(value) {
-      return isObject(value) && objToString.call(value) == regexpTag;
-    }
+    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;
 
     /**
-     * Checks if `value` is classified as a `String` primitive or object.
+     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754
+     * double precision number which isn't the result of a rounded unsafe integer.
+     *
+     * **Note:** This method is based on
+     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+     * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.
      * @example
      *
-     * _.isString('abc');
+     * _.isSafeInteger(3);
      * // => true
      *
-     * _.isString(1);
+     * _.isSafeInteger(Number.MIN_VALUE);
+     * // => false
+     *
+     * _.isSafeInteger(Infinity);
+     * // => false
+     *
+     * _.isSafeInteger('3');
+     * // => false
+     */
+    function isSafeInteger(value) {
+      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;
+    }
+
+    /**
+     * Checks if `value` is classified as a `Set` object.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a set, else `false`.
+     * @example
+     *
+     * _.isSet(new Set);
+     * // => true
+     *
+     * _.isSet(new WeakSet);
+     * // => false
+     */
+    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;
+
+    /**
+     * Checks if `value` is classified as a `String` primitive or object.
+     *
+     * @static
+     * @since 0.1.0
+     * @memberOf _
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a string, else `false`.
+     * @example
+     *
+     * _.isString('abc');
+     * // => true
+     *
+     * _.isString(1);
      * // => false
      */
     function isString(value) {
-      return typeof value == 'string' || (isObjectLike(value) && objToString.call(value) == stringTag);
+      return typeof value == 'string' ||
+        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);
+    }
+
+    /**
+     * Checks if `value` is classified as a `Symbol` primitive or object.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.
+     * @example
+     *
+     * _.isSymbol(Symbol.iterator);
+     * // => true
+     *
+     * _.isSymbol('abc');
+     * // => false
+     */
+    function isSymbol(value) {
+      return typeof value == 'symbol' ||
+        (isObjectLike(value) && baseGetTag(value) == symbolTag);
     }
 
     /**
@@ -16934,9 +17473,10 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Lang
      * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is correctly classified, else `false`.
+     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
      * @example
      *
      * _.isTypedArray(new Uint8Array);
@@ -16945,14 +17485,13 @@ module.exports = ClipperLib;
      * _.isTypedArray([]);
      * // => false
      */
-    function isTypedArray(value) {
-      return isObjectLike(value) && isLength(value.length) && !!typedArrayTags[objToString.call(value)];
-    }
+    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;
 
     /**
      * Checks if `value` is `undefined`.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category Lang
      * @param {*} value The value to check.
@@ -16969,15 +17508,60 @@ module.exports = ClipperLib;
       return value === undefined;
     }
 
+    /**
+     * Checks if `value` is classified as a `WeakMap` object.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.
+     * @example
+     *
+     * _.isWeakMap(new WeakMap);
+     * // => true
+     *
+     * _.isWeakMap(new Map);
+     * // => false
+     */
+    function isWeakMap(value) {
+      return isObjectLike(value) && getTag(value) == weakMapTag;
+    }
+
+    /**
+     * Checks if `value` is classified as a `WeakSet` object.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.
+     * @example
+     *
+     * _.isWeakSet(new WeakSet);
+     * // => true
+     *
+     * _.isWeakSet(new Set);
+     * // => false
+     */
+    function isWeakSet(value) {
+      return isObjectLike(value) && baseGetTag(value) == weakSetTag;
+    }
+
     /**
      * Checks if `value` is less than `other`.
      *
      * @static
      * @memberOf _
+     * @since 3.9.0
      * @category Lang
      * @param {*} value The value to compare.
      * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is less than `other`, else `false`.
+     * @returns {boolean} Returns `true` if `value` is less than `other`,
+     *  else `false`.
+     * @see _.gt
      * @example
      *
      * _.lt(1, 3);
@@ -16989,19 +17573,20 @@ module.exports = ClipperLib;
      * _.lt(3, 1);
      * // => false
      */
-    function lt(value, other) {
-      return value < other;
-    }
+    var lt = createRelationalOperation(baseLt);
 
     /**
      * Checks if `value` is less than or equal to `other`.
      *
      * @static
      * @memberOf _
+     * @since 3.9.0
      * @category Lang
      * @param {*} value The value to compare.
      * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is less than or equal to `other`, else `false`.
+     * @returns {boolean} Returns `true` if `value` is less than or equal to
+     *  `other`, else `false`.
+     * @see _.gte
      * @example
      *
      * _.lte(1, 3);
@@ -17013,42 +17598,199 @@ module.exports = ClipperLib;
      * _.lte(3, 1);
      * // => false
      */
-    function lte(value, other) {
+    var lte = createRelationalOperation(function(value, other) {
       return value <= other;
-    }
+    });
 
     /**
      * Converts `value` to an array.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category Lang
      * @param {*} value The value to convert.
      * @returns {Array} Returns the converted array.
      * @example
      *
-     * (function() {
-     *   return _.toArray(arguments).slice(1);
-     * }(1, 2, 3));
-     * // => [2, 3]
+     * _.toArray({ 'a': 1, 'b': 2 });
+     * // => [1, 2]
+     *
+     * _.toArray('abc');
+     * // => ['a', 'b', 'c']
+     *
+     * _.toArray(1);
+     * // => []
+     *
+     * _.toArray(null);
+     * // => []
      */
     function toArray(value) {
-      var length = value ? getLength(value) : 0;
-      if (!isLength(length)) {
-        return values(value);
-      }
-      if (!length) {
+      if (!value) {
         return [];
       }
-      return arrayCopy(value);
+      if (isArrayLike(value)) {
+        return isString(value) ? stringToArray(value) : copyArray(value);
+      }
+      if (symIterator && value[symIterator]) {
+        return iteratorToArray(value[symIterator]());
+      }
+      var tag = getTag(value),
+          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);
+
+      return func(value);
+    }
+
+    /**
+     * Converts `value` to a finite number.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.12.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {number} Returns the converted number.
+     * @example
+     *
+     * _.toFinite(3.2);
+     * // => 3.2
+     *
+     * _.toFinite(Number.MIN_VALUE);
+     * // => 5e-324
+     *
+     * _.toFinite(Infinity);
+     * // => 1.7976931348623157e+308
+     *
+     * _.toFinite('3.2');
+     * // => 3.2
+     */
+    function toFinite(value) {
+      if (!value) {
+        return value === 0 ? value : 0;
+      }
+      value = toNumber(value);
+      if (value === INFINITY || value === -INFINITY) {
+        var sign = (value < 0 ? -1 : 1);
+        return sign * MAX_INTEGER;
+      }
+      return value === value ? value : 0;
+    }
+
+    /**
+     * Converts `value` to an integer.
+     *
+     * **Note:** This method is loosely based on
+     * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {number} Returns the converted integer.
+     * @example
+     *
+     * _.toInteger(3.2);
+     * // => 3
+     *
+     * _.toInteger(Number.MIN_VALUE);
+     * // => 0
+     *
+     * _.toInteger(Infinity);
+     * // => 1.7976931348623157e+308
+     *
+     * _.toInteger('3.2');
+     * // => 3
+     */
+    function toInteger(value) {
+      var result = toFinite(value),
+          remainder = result % 1;
+
+      return result === result ? (remainder ? result - remainder : result) : 0;
+    }
+
+    /**
+     * Converts `value` to an integer suitable for use as the length of an
+     * array-like object.
+     *
+     * **Note:** This method is based on
+     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {number} Returns the converted integer.
+     * @example
+     *
+     * _.toLength(3.2);
+     * // => 3
+     *
+     * _.toLength(Number.MIN_VALUE);
+     * // => 0
+     *
+     * _.toLength(Infinity);
+     * // => 4294967295
+     *
+     * _.toLength('3.2');
+     * // => 3
+     */
+    function toLength(value) {
+      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;
+    }
+
+    /**
+     * Converts `value` to a number.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to process.
+     * @returns {number} Returns the number.
+     * @example
+     *
+     * _.toNumber(3.2);
+     * // => 3.2
+     *
+     * _.toNumber(Number.MIN_VALUE);
+     * // => 5e-324
+     *
+     * _.toNumber(Infinity);
+     * // => Infinity
+     *
+     * _.toNumber('3.2');
+     * // => 3.2
+     */
+    function toNumber(value) {
+      if (typeof value == 'number') {
+        return value;
+      }
+      if (isSymbol(value)) {
+        return NAN;
+      }
+      if (isObject(value)) {
+        var other = typeof value.valueOf == 'function' ? value.valueOf() : value;
+        value = isObject(other) ? (other + '') : other;
+      }
+      if (typeof value != 'string') {
+        return value === 0 ? value : +value;
+      }
+      value = value.replace(reTrim, '');
+      var isBinary = reIsBinary.test(value);
+      return (isBinary || reIsOctal.test(value))
+        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)
+        : (reIsBadHex.test(value) ? NAN : +value);
     }
 
     /**
-     * Converts `value` to a plain object flattening inherited enumerable
-     * properties of `value` to own properties of the plain object.
+     * Converts `value` to a plain object flattening inherited enumerable string
+     * keyed properties of `value` to own properties of the plain object.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Lang
      * @param {*} value The value to convert.
      * @returns {Object} Returns the converted plain object.
@@ -17067,204 +17809,330 @@ module.exports = ClipperLib;
      * // => { 'a': 1, 'b': 2, 'c': 3 }
      */
     function toPlainObject(value) {
-      return baseCopy(value, keysIn(value));
+      return copyObject(value, keysIn(value));
     }
 
-    /*------------------------------------------------------------------------*/
-
     /**
-     * Recursively merges own enumerable properties of the source object(s), that
-     * don't resolve to `undefined` into the destination object. Subsequent sources
-     * overwrite property assignments of previous sources. If `customizer` is
-     * provided it is invoked to produce the merged values of the destination and
-     * source properties. If `customizer` returns `undefined` merging is handled
-     * by the method instead. The `customizer` is bound to `thisArg` and invoked
-     * with five arguments: (objectValue, sourceValue, key, object, source).
+     * Converts `value` to a safe integer. A safe integer can be compared and
+     * represented correctly.
      *
      * @static
      * @memberOf _
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} [sources] The source objects.
-     * @param {Function} [customizer] The function to customize assigned values.
-     * @param {*} [thisArg] The `this` binding of `customizer`.
-     * @returns {Object} Returns `object`.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {number} Returns the converted integer.
      * @example
      *
-     * var users = {
-     *   'data': [{ 'user': 'barney' }, { 'user': 'fred' }]
-     * };
-     *
-     * var ages = {
-     *   'data': [{ 'age': 36 }, { 'age': 40 }]
-     * };
-     *
-     * _.merge(users, ages);
-     * // => { 'data': [{ 'user': 'barney', 'age': 36 }, { 'user': 'fred', 'age': 40 }] }
+     * _.toSafeInteger(3.2);
+     * // => 3
      *
-     * // using a customizer callback
-     * var object = {
-     *   'fruits': ['apple'],
-     *   'vegetables': ['beet']
-     * };
+     * _.toSafeInteger(Number.MIN_VALUE);
+     * // => 0
      *
-     * var other = {
-     *   'fruits': ['banana'],
-     *   'vegetables': ['carrot']
-     * };
+     * _.toSafeInteger(Infinity);
+     * // => 9007199254740991
      *
-     * _.merge(object, other, function(a, b) {
-     *   if (_.isArray(a)) {
-     *     return a.concat(b);
-     *   }
-     * });
-     * // => { 'fruits': ['apple', 'banana'], 'vegetables': ['beet', 'carrot'] }
+     * _.toSafeInteger('3.2');
+     * // => 3
      */
-    var merge = createAssigner(baseMerge);
+    function toSafeInteger(value) {
+      return value
+        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)
+        : (value === 0 ? value : 0);
+    }
 
     /**
-     * Assigns own enumerable properties of source object(s) to the destination
-     * object. Subsequent sources overwrite property assignments of previous sources.
-     * If `customizer` is provided it is invoked to produce the assigned values.
-     * The `customizer` is bound to `thisArg` and invoked with five arguments:
-     * (objectValue, sourceValue, key, object, source).
-     *
-     * **Note:** This method mutates `object` and is based on
-     * [`Object.assign`](http://ecma-international.org/ecma-262/6.0/#sec-object.assign).
+     * Converts `value` to a string. An empty string is returned for `null`
+     * and `undefined` values. The sign of `-0` is preserved.
      *
      * @static
      * @memberOf _
-     * @alias extend
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} [sources] The source objects.
-     * @param {Function} [customizer] The function to customize assigned values.
-     * @param {*} [thisArg] The `this` binding of `customizer`.
-     * @returns {Object} Returns `object`.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {string} Returns the converted string.
      * @example
      *
-     * _.assign({ 'user': 'barney' }, { 'age': 40 }, { 'user': 'fred' });
-     * // => { 'user': 'fred', 'age': 40 }
+     * _.toString(null);
+     * // => ''
      *
-     * // using a customizer callback
-     * var defaults = _.partialRight(_.assign, function(value, other) {
-     *   return _.isUndefined(value) ? other : value;
-     * });
+     * _.toString(-0);
+     * // => '-0'
      *
-     * defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' });
-     * // => { 'user': 'barney', 'age': 36 }
+     * _.toString([1, 2, 3]);
+     * // => '1,2,3'
      */
-    var assign = createAssigner(function(object, source, customizer) {
-      return customizer
-        ? assignWith(object, source, customizer)
-        : baseAssign(object, source);
-    });
+    function toString(value) {
+      return value == null ? '' : baseToString(value);
+    }
+
+    /*------------------------------------------------------------------------*/
 
     /**
-     * Creates an object that inherits from the given `prototype` object. If a
-     * `properties` object is provided its own enumerable properties are assigned
-     * to the created object.
+     * Assigns own enumerable string keyed properties of source objects to the
+     * destination object. Source objects are applied from left to right.
+     * Subsequent sources overwrite property assignments of previous sources.
+     *
+     * **Note:** This method mutates `object` and is loosely based on
+     * [`Object.assign`](https://mdn.io/Object/assign).
      *
      * @static
      * @memberOf _
+     * @since 0.10.0
      * @category Object
-     * @param {Object} prototype The object to inherit from.
-     * @param {Object} [properties] The properties to assign to the object.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
-     * @returns {Object} Returns the new object.
+     * @param {Object} object The destination object.
+     * @param {...Object} [sources] The source objects.
+     * @returns {Object} Returns `object`.
+     * @see _.assignIn
      * @example
      *
-     * function Shape() {
-     *   this.x = 0;
-     *   this.y = 0;
+     * function Foo() {
+     *   this.a = 1;
      * }
      *
-     * function Circle() {
-     *   Shape.call(this);
+     * function Bar() {
+     *   this.c = 3;
      * }
      *
-     * Circle.prototype = _.create(Shape.prototype, {
-     *   'constructor': Circle
-     * });
-     *
-     * var circle = new Circle;
-     * circle instanceof Circle;
-     * // => true
+     * Foo.prototype.b = 2;
+     * Bar.prototype.d = 4;
      *
-     * circle instanceof Shape;
-     * // => true
+     * _.assign({ 'a': 0 }, new Foo, new Bar);
+     * // => { 'a': 1, 'c': 3 }
      */
-    function create(prototype, properties, guard) {
-      var result = baseCreate(prototype);
-      if (guard && isIterateeCall(prototype, properties, guard)) {
-        properties = undefined;
+    var assign = createAssigner(function(object, source) {
+      if (isPrototype(source) || isArrayLike(source)) {
+        copyObject(source, keys(source), object);
+        return;
       }
-      return properties ? baseAssign(result, properties) : result;
-    }
+      for (var key in source) {
+        if (hasOwnProperty.call(source, key)) {
+          assignValue(object, key, source[key]);
+        }
+      }
+    });
 
     /**
-     * Assigns own enumerable properties of source object(s) to the destination
-     * object for all destination properties that resolve to `undefined`. Once a
-     * property is set, additional values of the same property are ignored.
+     * This method is like `_.assign` except that it iterates over own and
+     * inherited source properties.
      *
      * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
+     * @alias extend
      * @category Object
      * @param {Object} object The destination object.
      * @param {...Object} [sources] The source objects.
      * @returns {Object} Returns `object`.
+     * @see _.assign
      * @example
      *
-     * _.defaults({ 'user': 'barney' }, { 'age': 36 }, { 'user': 'fred' });
-     * // => { 'user': 'barney', 'age': 36 }
+     * function Foo() {
+     *   this.a = 1;
+     * }
+     *
+     * function Bar() {
+     *   this.c = 3;
+     * }
+     *
+     * Foo.prototype.b = 2;
+     * Bar.prototype.d = 4;
+     *
+     * _.assignIn({ 'a': 0 }, new Foo, new Bar);
+     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }
      */
-    var defaults = createDefaults(assign, assignDefaults);
+    var assignIn = createAssigner(function(object, source) {
+      copyObject(source, keysIn(source), object);
+    });
 
     /**
-     * This method is like `_.defaults` except that it recursively assigns
-     * default properties.
+     * This method is like `_.assignIn` except that it accepts `customizer`
+     * which is invoked to produce the assigned values. If `customizer` returns
+     * `undefined`, assignment is handled by the method instead. The `customizer`
+     * is invoked with five arguments: (objValue, srcValue, key, object, source).
      *
      * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
+     * @alias extendWith
      * @category Object
      * @param {Object} object The destination object.
-     * @param {...Object} [sources] The source objects.
+     * @param {...Object} sources The source objects.
+     * @param {Function} [customizer] The function to customize assigned values.
      * @returns {Object} Returns `object`.
+     * @see _.assignWith
      * @example
      *
-     * _.defaultsDeep({ 'user': { 'name': 'barney' } }, { 'user': { 'name': 'fred', 'age': 36 } });
-     * // => { 'user': { 'name': 'barney', 'age': 36 } }
+     * function customizer(objValue, srcValue) {
+     *   return _.isUndefined(objValue) ? srcValue : objValue;
+     * }
+     *
+     * var defaults = _.partialRight(_.assignInWith, customizer);
      *
+     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
+     * // => { 'a': 1, 'b': 2 }
      */
-    var defaultsDeep = createDefaults(merge, mergeDefaults);
+    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {
+      copyObject(source, keysIn(source), object, customizer);
+    });
 
     /**
-     * This method is like `_.find` except that it returns the key of the first
-     * element `predicate` returns truthy for instead of the element itself.
+     * This method is like `_.assign` except that it accepts `customizer`
+     * which is invoked to produce the assigned values. If `customizer` returns
+     * `undefined`, assignment is handled by the method instead. The `customizer`
+     * is invoked with five arguments: (objValue, srcValue, key, object, source).
+     *
+     * **Note:** This method mutates `object`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} sources The source objects.
+     * @param {Function} [customizer] The function to customize assigned values.
+     * @returns {Object} Returns `object`.
+     * @see _.assignInWith
+     * @example
+     *
+     * function customizer(objValue, srcValue) {
+     *   return _.isUndefined(objValue) ? srcValue : objValue;
+     * }
+     *
+     * var defaults = _.partialRight(_.assignWith, customizer);
+     *
+     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
+     * // => { 'a': 1, 'b': 2 }
+     */
+    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {
+      copyObject(source, keys(source), object, customizer);
+    });
+
+    /**
+     * Creates an array of values corresponding to `paths` of `object`.
+     *
+     * @static
+     * @memberOf _
+     * @since 1.0.0
+     * @category Object
+     * @param {Object} object The object to iterate over.
+     * @param {...(string|string[])} [paths] The property paths to pick.
+     * @returns {Array} Returns the picked values.
+     * @example
+     *
+     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };
+     *
+     * _.at(object, ['a[0].b.c', 'a[1]']);
+     * // => [3, 4]
+     */
+    var at = flatRest(baseAt);
+
+    /**
+     * Creates an object that inherits from the `prototype` object. If a
+     * `properties` object is given, its own enumerable string keyed properties
+     * are assigned to the created object.
+     *
+     * @static
+     * @memberOf _
+     * @since 2.3.0
+     * @category Object
+     * @param {Object} prototype The object to inherit from.
+     * @param {Object} [properties] The properties to assign to the object.
+     * @returns {Object} Returns the new object.
+     * @example
+     *
+     * function Shape() {
+     *   this.x = 0;
+     *   this.y = 0;
+     * }
+     *
+     * function Circle() {
+     *   Shape.call(this);
+     * }
+     *
+     * Circle.prototype = _.create(Shape.prototype, {
+     *   'constructor': Circle
+     * });
+     *
+     * var circle = new Circle;
+     * circle instanceof Circle;
+     * // => true
+     *
+     * circle instanceof Shape;
+     * // => true
+     */
+    function create(prototype, properties) {
+      var result = baseCreate(prototype);
+      return properties == null ? result : baseAssign(result, properties);
+    }
+
+    /**
+     * Assigns own and inherited enumerable string keyed properties of source
+     * objects to the destination object for all destination properties that
+     * resolve to `undefined`. Source objects are applied from left to right.
+     * Once a property is set, additional values of the same property are ignored.
      *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
+     * **Note:** This method mutates `object`.
+     *
+     * @static
+     * @since 0.1.0
+     * @memberOf _
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} [sources] The source objects.
+     * @returns {Object} Returns `object`.
+     * @see _.defaultsDeep
+     * @example
+     *
+     * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
+     * // => { 'a': 1, 'b': 2 }
+     */
+    var defaults = baseRest(function(args) {
+      args.push(undefined, customDefaultsAssignIn);
+      return apply(assignInWith, undefined, args);
+    });
+
+    /**
+     * This method is like `_.defaults` except that it recursively assigns
+     * default properties.
+     *
+     * **Note:** This method mutates `object`.
      *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
+     * @static
+     * @memberOf _
+     * @since 3.10.0
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} [sources] The source objects.
+     * @returns {Object} Returns `object`.
+     * @see _.defaults
+     * @example
      *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });
+     * // => { 'a': { 'b': 2, 'c': 3 } }
+     */
+    var defaultsDeep = baseRest(function(args) {
+      args.push(undefined, customDefaultsMerge);
+      return apply(mergeWith, undefined, args);
+    });
+
+    /**
+     * This method is like `_.find` except that it returns the key of the first
+     * element `predicate` returns truthy for instead of the element itself.
      *
      * @static
      * @memberOf _
+     * @since 1.1.0
      * @category Object
-     * @param {Object} object The object to search.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
-     * @returns {string|undefined} Returns the key of the matched element, else `undefined`.
+     * @param {Object} object The object to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {string|undefined} Returns the key of the matched element,
+     *  else `undefined`.
      * @example
      *
      * var users = {
@@ -17273,48 +18141,37 @@ module.exports = ClipperLib;
      *   'pebbles': { 'age': 1,  'active': true }
      * };
      *
-     * _.findKey(users, function(chr) {
-     *   return chr.age < 40;
-     * });
+     * _.findKey(users, function(o) { return o.age < 40; });
      * // => 'barney' (iteration order is not guaranteed)
      *
-     * // using the `_.matches` callback shorthand
+     * // The `_.matches` iteratee shorthand.
      * _.findKey(users, { 'age': 1, 'active': true });
      * // => 'pebbles'
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.findKey(users, 'active', false);
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.findKey(users, ['active', false]);
      * // => 'fred'
      *
-     * // using the `_.property` callback shorthand
+     * // The `_.property` iteratee shorthand.
      * _.findKey(users, 'active');
      * // => 'barney'
      */
-    var findKey = createFindKey(baseForOwn);
+    function findKey(object, predicate) {
+      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);
+    }
 
     /**
      * This method is like `_.findKey` except that it iterates over elements of
      * a collection in the opposite order.
      *
-     * If a property name is provided for `predicate` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `predicate` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
-     *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @category Object
-     * @param {Object} object The object to search.
-     * @param {Function|Object|string} [predicate=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
-     * @returns {string|undefined} Returns the key of the matched element, else `undefined`.
+     * @param {Object} object The object to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {string|undefined} Returns the key of the matched element,
+     *  else `undefined`.
      * @example
      *
      * var users = {
@@ -17323,38 +18180,39 @@ module.exports = ClipperLib;
      *   'pebbles': { 'age': 1,  'active': true }
      * };
      *
-     * _.findLastKey(users, function(chr) {
-     *   return chr.age < 40;
-     * });
-     * // => returns `pebbles` assuming `_.findKey` returns `barney`
+     * _.findLastKey(users, function(o) { return o.age < 40; });
+     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'
      *
-     * // using the `_.matches` callback shorthand
+     * // The `_.matches` iteratee shorthand.
      * _.findLastKey(users, { 'age': 36, 'active': true });
      * // => 'barney'
      *
-     * // using the `_.matchesProperty` callback shorthand
-     * _.findLastKey(users, 'active', false);
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.findLastKey(users, ['active', false]);
      * // => 'fred'
      *
-     * // using the `_.property` callback shorthand
+     * // The `_.property` iteratee shorthand.
      * _.findLastKey(users, 'active');
      * // => 'pebbles'
      */
-    var findLastKey = createFindKey(baseForOwnRight);
+    function findLastKey(object, predicate) {
+      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);
+    }
 
     /**
-     * Iterates over own and inherited enumerable properties of an object invoking
-     * `iteratee` for each property. The `iteratee` is bound to `thisArg` and invoked
+     * Iterates over own and inherited enumerable string keyed properties of an
+     * object and invokes `iteratee` for each property. The iteratee is invoked
      * with three arguments: (value, key, object). Iteratee functions may exit
      * iteration early by explicitly returning `false`.
      *
      * @static
      * @memberOf _
+     * @since 0.3.0
      * @category Object
      * @param {Object} object The object to iterate over.
      * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
      * @returns {Object} Returns `object`.
+     * @see _.forInRight
      * @example
      *
      * function Foo() {
@@ -17367,9 +18225,13 @@ module.exports = ClipperLib;
      * _.forIn(new Foo, function(value, key) {
      *   console.log(key);
      * });
-     * // => logs 'a', 'b', and 'c' (iteration order is not guaranteed)
+     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).
      */
-    var forIn = createForIn(baseFor);
+    function forIn(object, iteratee) {
+      return object == null
+        ? object
+        : baseFor(object, getIteratee(iteratee, 3), keysIn);
+    }
 
     /**
      * This method is like `_.forIn` except that it iterates over properties of
@@ -17377,11 +18239,12 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @category Object
      * @param {Object} object The object to iterate over.
      * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
      * @returns {Object} Returns `object`.
+     * @see _.forIn
      * @example
      *
      * function Foo() {
@@ -17394,23 +18257,28 @@ module.exports = ClipperLib;
      * _.forInRight(new Foo, function(value, key) {
      *   console.log(key);
      * });
-     * // => logs 'c', 'b', and 'a' assuming `_.forIn ` logs 'a', 'b', and 'c'
+     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.
      */
-    var forInRight = createForIn(baseForRight);
+    function forInRight(object, iteratee) {
+      return object == null
+        ? object
+        : baseForRight(object, getIteratee(iteratee, 3), keysIn);
+    }
 
     /**
-     * Iterates over own enumerable properties of an object invoking `iteratee`
-     * for each property. The `iteratee` is bound to `thisArg` and invoked with
-     * three arguments: (value, key, object). Iteratee functions may exit iteration
+     * Iterates over own enumerable string keyed properties of an object and
+     * invokes `iteratee` for each property. The iteratee is invoked with three
+     * arguments: (value, key, object). Iteratee functions may exit iteration
      * early by explicitly returning `false`.
      *
      * @static
      * @memberOf _
+     * @since 0.3.0
      * @category Object
      * @param {Object} object The object to iterate over.
      * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
      * @returns {Object} Returns `object`.
+     * @see _.forOwnRight
      * @example
      *
      * function Foo() {
@@ -17423,9 +18291,11 @@ module.exports = ClipperLib;
      * _.forOwn(new Foo, function(value, key) {
      *   console.log(key);
      * });
-     * // => logs 'a' and 'b' (iteration order is not guaranteed)
+     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
      */
-    var forOwn = createForOwn(baseForOwn);
+    function forOwn(object, iteratee) {
+      return object && baseForOwn(object, getIteratee(iteratee, 3));
+    }
 
     /**
      * This method is like `_.forOwn` except that it iterates over properties of
@@ -17433,11 +18303,12 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 2.0.0
      * @category Object
      * @param {Object} object The object to iterate over.
      * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
      * @returns {Object} Returns `object`.
+     * @see _.forOwn
      * @example
      *
      * function Foo() {
@@ -17450,39 +18321,77 @@ module.exports = ClipperLib;
      * _.forOwnRight(new Foo, function(value, key) {
      *   console.log(key);
      * });
-     * // => logs 'b' and 'a' assuming `_.forOwn` logs 'a' and 'b'
+     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.
      */
-    var forOwnRight = createForOwn(baseForOwnRight);
+    function forOwnRight(object, iteratee) {
+      return object && baseForOwnRight(object, getIteratee(iteratee, 3));
+    }
 
     /**
-     * Creates an array of function property names from all enumerable properties,
-     * own and inherited, of `object`.
+     * Creates an array of function property names from own enumerable properties
+     * of `object`.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @alias methods
      * @category Object
      * @param {Object} object The object to inspect.
-     * @returns {Array} Returns the new array of property names.
+     * @returns {Array} Returns the function names.
+     * @see _.functionsIn
      * @example
      *
-     * _.functions(_);
-     * // => ['after', 'ary', 'assign', ...]
+     * function Foo() {
+     *   this.a = _.constant('a');
+     *   this.b = _.constant('b');
+     * }
+     *
+     * Foo.prototype.c = _.constant('c');
+     *
+     * _.functions(new Foo);
+     * // => ['a', 'b']
      */
     function functions(object) {
-      return baseFunctions(object, keysIn(object));
+      return object == null ? [] : baseFunctions(object, keys(object));
+    }
+
+    /**
+     * Creates an array of function property names from own and inherited
+     * enumerable properties of `object`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The object to inspect.
+     * @returns {Array} Returns the function names.
+     * @see _.functions
+     * @example
+     *
+     * function Foo() {
+     *   this.a = _.constant('a');
+     *   this.b = _.constant('b');
+     * }
+     *
+     * Foo.prototype.c = _.constant('c');
+     *
+     * _.functionsIn(new Foo);
+     * // => ['a', 'b', 'c']
+     */
+    function functionsIn(object) {
+      return object == null ? [] : baseFunctions(object, keysIn(object));
     }
 
     /**
-     * Gets the property value at `path` of `object`. If the resolved value is
-     * `undefined` the `defaultValue` is used in its place.
+     * Gets the value at `path` of `object`. If the resolved value is
+     * `undefined`, the `defaultValue` is returned in its place.
      *
      * @static
      * @memberOf _
+     * @since 3.7.0
      * @category Object
      * @param {Object} object The object to query.
      * @param {Array|string} path The path of the property to get.
-     * @param {*} [defaultValue] The value returned if the resolved value is `undefined`.
+     * @param {*} [defaultValue] The value returned for `undefined` resolved values.
      * @returns {*} Returns the resolved value.
      * @example
      *
@@ -17498,61 +18407,81 @@ module.exports = ClipperLib;
      * // => 'default'
      */
     function get(object, path, defaultValue) {
-      var result = object == null ? undefined : baseGet(object, toPath(path), path + '');
+      var result = object == null ? undefined : baseGet(object, path);
       return result === undefined ? defaultValue : result;
     }
 
     /**
-     * Checks if `path` is a direct property.
+     * Checks if `path` is a direct property of `object`.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category Object
      * @param {Object} object The object to query.
      * @param {Array|string} path The path to check.
-     * @returns {boolean} Returns `true` if `path` is a direct property, else `false`.
+     * @returns {boolean} Returns `true` if `path` exists, else `false`.
      * @example
      *
-     * var object = { 'a': { 'b': { 'c': 3 } } };
+     * var object = { 'a': { 'b': 2 } };
+     * var other = _.create({ 'a': _.create({ 'b': 2 }) });
      *
      * _.has(object, 'a');
      * // => true
      *
-     * _.has(object, 'a.b.c');
+     * _.has(object, 'a.b');
      * // => true
      *
-     * _.has(object, ['a', 'b', 'c']);
+     * _.has(object, ['a', 'b']);
      * // => true
+     *
+     * _.has(other, 'a');
+     * // => false
      */
     function has(object, path) {
-      if (object == null) {
-        return false;
-      }
-      var result = hasOwnProperty.call(object, path);
-      if (!result && !isKey(path)) {
-        path = toPath(path);
-        object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
-        if (object == null) {
-          return false;
-        }
-        path = last(path);
-        result = hasOwnProperty.call(object, path);
-      }
-      return result || (isLength(object.length) && isIndex(path, object.length) &&
-        (isArray(object) || isArguments(object)));
+      return object != null && hasPath(object, path, baseHas);
+    }
+
+    /**
+     * Checks if `path` is a direct or inherited property of `object`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path to check.
+     * @returns {boolean} Returns `true` if `path` exists, else `false`.
+     * @example
+     *
+     * var object = _.create({ 'a': _.create({ 'b': 2 }) });
+     *
+     * _.hasIn(object, 'a');
+     * // => true
+     *
+     * _.hasIn(object, 'a.b');
+     * // => true
+     *
+     * _.hasIn(object, ['a', 'b']);
+     * // => true
+     *
+     * _.hasIn(object, 'b');
+     * // => false
+     */
+    function hasIn(object, path) {
+      return object != null && hasPath(object, path, baseHasIn);
     }
 
     /**
      * Creates an object composed of the inverted keys and values of `object`.
-     * If `object` contains duplicate values, subsequent values overwrite property
-     * assignments of previous values unless `multiValue` is `true`.
+     * If `object` contains duplicate values, subsequent values overwrite
+     * property assignments of previous values.
      *
      * @static
      * @memberOf _
+     * @since 0.7.0
      * @category Object
      * @param {Object} object The object to invert.
-     * @param {boolean} [multiValue] Allow multiple values per key.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
      * @returns {Object} Returns the new inverted object.
      * @example
      *
@@ -17560,46 +18489,74 @@ module.exports = ClipperLib;
      *
      * _.invert(object);
      * // => { '1': 'c', '2': 'b' }
+     */
+    var invert = createInverter(function(result, value, key) {
+      result[value] = key;
+    }, constant(identity));
+
+    /**
+     * This method is like `_.invert` except that the inverted object is generated
+     * from the results of running each element of `object` thru `iteratee`. The
+     * corresponding inverted value of each inverted key is an array of keys
+     * responsible for generating the inverted value. The iteratee is invoked
+     * with one argument: (value).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.1.0
+     * @category Object
+     * @param {Object} object The object to invert.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Object} Returns the new inverted object.
+     * @example
      *
-     * // with `multiValue`
-     * _.invert(object, true);
+     * var object = { 'a': 1, 'b': 2, 'c': 1 };
+     *
+     * _.invertBy(object);
      * // => { '1': ['a', 'c'], '2': ['b'] }
+     *
+     * _.invertBy(object, function(value) {
+     *   return 'group' + value;
+     * });
+     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }
      */
-    function invert(object, multiValue, guard) {
-      if (guard && isIterateeCall(object, multiValue, guard)) {
-        multiValue = undefined;
+    var invertBy = createInverter(function(result, value, key) {
+      if (hasOwnProperty.call(result, value)) {
+        result[value].push(key);
+      } else {
+        result[value] = [key];
       }
-      var index = -1,
-          props = keys(object),
-          length = props.length,
-          result = {};
+    }, getIteratee);
 
-      while (++index < length) {
-        var key = props[index],
-            value = object[key];
-
-        if (multiValue) {
-          if (hasOwnProperty.call(result, value)) {
-            result[value].push(key);
-          } else {
-            result[value] = [key];
-          }
-        }
-        else {
-          result[value] = key;
-        }
-      }
-      return result;
-    }
+    /**
+     * Invokes the method at `path` of `object`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path of the method to invoke.
+     * @param {...*} [args] The arguments to invoke the method with.
+     * @returns {*} Returns the result of the invoked method.
+     * @example
+     *
+     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };
+     *
+     * _.invoke(object, 'a[0].b.c.slice', 1, 3);
+     * // => [2, 3]
+     */
+    var invoke = baseRest(baseInvoke);
 
     /**
      * Creates an array of the own enumerable property names of `object`.
      *
      * **Note:** Non-object values are coerced to objects. See the
-     * [ES spec](http://ecma-international.org/ecma-262/6.0/#sec-object.keys)
+     * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
      * for more details.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category Object
      * @param {Object} object The object to query.
@@ -17619,14 +18576,9 @@ module.exports = ClipperLib;
      * _.keys('hi');
      * // => ['0', '1']
      */
-    var keys = !nativeKeys ? shimKeys : function(object) {
-      var Ctor = object == null ? undefined : object.constructor;
-      if ((typeof Ctor == 'function' && Ctor.prototype === object) ||
-          (typeof object != 'function' && isArrayLike(object))) {
-        return shimKeys(object);
-      }
-      return isObject(object) ? nativeKeys(object) : [];
-    };
+    function keys(object) {
+      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);
+    }
 
     /**
      * Creates an array of the own and inherited enumerable property names of `object`.
@@ -17635,6 +18587,7 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Object
      * @param {Object} object The object to query.
      * @returns {Array} Returns the array of property names.
@@ -17651,47 +18604,23 @@ module.exports = ClipperLib;
      * // => ['a', 'b', 'c'] (iteration order is not guaranteed)
      */
     function keysIn(object) {
-      if (object == null) {
-        return [];
-      }
-      if (!isObject(object)) {
-        object = Object(object);
-      }
-      var length = object.length;
-      length = (length && isLength(length) &&
-        (isArray(object) || isArguments(object)) && length) || 0;
-
-      var Ctor = object.constructor,
-          index = -1,
-          isProto = typeof Ctor == 'function' && Ctor.prototype === object,
-          result = Array(length),
-          skipIndexes = length > 0;
-
-      while (++index < length) {
-        result[index] = (index + '');
-      }
-      for (var key in object) {
-        if (!(skipIndexes && isIndex(key, length)) &&
-            !(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {
-          result.push(key);
-        }
-      }
-      return result;
+      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);
     }
 
     /**
      * The opposite of `_.mapValues`; this method creates an object with the
      * same values as `object` and keys generated by running each own enumerable
-     * property of `object` through `iteratee`.
+     * string keyed property of `object` thru `iteratee`. The iteratee is invoked
+     * with three arguments: (value, key, object).
      *
      * @static
      * @memberOf _
+     * @since 3.8.0
      * @category Object
      * @param {Object} object The object to iterate over.
-     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
      * @returns {Object} Returns the new mapped object.
+     * @see _.mapValues
      * @example
      *
      * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {
@@ -17699,163 +18628,254 @@ module.exports = ClipperLib;
      * });
      * // => { 'a1': 1, 'b2': 2 }
      */
-    var mapKeys = createObjectMapper(true);
+    function mapKeys(object, iteratee) {
+      var result = {};
+      iteratee = getIteratee(iteratee, 3);
+
+      baseForOwn(object, function(value, key, object) {
+        baseAssignValue(result, iteratee(value, key, object), value);
+      });
+      return result;
+    }
 
     /**
-     * Creates an object with the same keys as `object` and values generated by
-     * running each own enumerable property of `object` through `iteratee`. The
-     * iteratee function is bound to `thisArg` and invoked with three arguments:
+     * Creates an object with the same keys as `object` and values generated
+     * by running each own enumerable string keyed property of `object` thru
+     * `iteratee`. The iteratee is invoked with three arguments:
      * (value, key, object).
      *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
-     *
      * @static
      * @memberOf _
+     * @since 2.4.0
      * @category Object
      * @param {Object} object The object to iterate over.
-     * @param {Function|Object|string} [iteratee=_.identity] The function invoked
-     *  per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
      * @returns {Object} Returns the new mapped object.
+     * @see _.mapKeys
      * @example
      *
-     * _.mapValues({ 'a': 1, 'b': 2 }, function(n) {
-     *   return n * 3;
-     * });
-     * // => { 'a': 3, 'b': 6 }
-     *
      * var users = {
      *   'fred':    { 'user': 'fred',    'age': 40 },
      *   'pebbles': { 'user': 'pebbles', 'age': 1 }
      * };
      *
-     * // using the `_.property` callback shorthand
+     * _.mapValues(users, function(o) { return o.age; });
+     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
+     *
+     * // The `_.property` iteratee shorthand.
      * _.mapValues(users, 'age');
      * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
      */
-    var mapValues = createObjectMapper();
+    function mapValues(object, iteratee) {
+      var result = {};
+      iteratee = getIteratee(iteratee, 3);
+
+      baseForOwn(object, function(value, key, object) {
+        baseAssignValue(result, key, iteratee(value, key, object));
+      });
+      return result;
+    }
 
     /**
-     * The opposite of `_.pick`; this method creates an object composed of the
-     * own and inherited enumerable properties of `object` that are not omitted.
+     * This method is like `_.assign` except that it recursively merges own and
+     * inherited enumerable string keyed properties of source objects into the
+     * destination object. Source properties that resolve to `undefined` are
+     * skipped if a destination value exists. Array and plain object properties
+     * are merged recursively. Other objects and value types are overridden by
+     * assignment. Source objects are applied from left to right. Subsequent
+     * sources overwrite property assignments of previous sources.
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
+     * @since 0.5.0
      * @category Object
-     * @param {Object} object The source object.
-     * @param {Function|...(string|string[])} [predicate] The function invoked per
-     *  iteration or property names to omit, specified as individual property
-     *  names or arrays of property names.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
-     * @returns {Object} Returns the new object.
+     * @param {Object} object The destination object.
+     * @param {...Object} [sources] The source objects.
+     * @returns {Object} Returns `object`.
      * @example
      *
-     * var object = { 'user': 'fred', 'age': 40 };
+     * var object = {
+     *   'a': [{ 'b': 2 }, { 'd': 4 }]
+     * };
      *
-     * _.omit(object, 'age');
-     * // => { 'user': 'fred' }
+     * var other = {
+     *   'a': [{ 'c': 3 }, { 'e': 5 }]
+     * };
      *
-     * _.omit(object, _.isNumber);
-     * // => { 'user': 'fred' }
+     * _.merge(object, other);
+     * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }
      */
-    var omit = restParam(function(object, props) {
-      if (object == null) {
-        return {};
-      }
-      if (typeof props[0] != 'function') {
-        var props = arrayMap(baseFlatten(props), String);
-        return pickByArray(object, baseDifference(keysIn(object), props));
-      }
-      var predicate = bindCallback(props[0], props[1], 3);
-      return pickByCallback(object, function(value, key, object) {
-        return !predicate(value, key, object);
-      });
+    var merge = createAssigner(function(object, source, srcIndex) {
+      baseMerge(object, source, srcIndex);
     });
 
     /**
-     * Creates a two dimensional array of the key-value pairs for `object`,
-     * e.g. `[[key1, value1], [key2, value2]]`.
+     * This method is like `_.merge` except that it accepts `customizer` which
+     * is invoked to produce the merged values of the destination and source
+     * properties. If `customizer` returns `undefined`, merging is handled by the
+     * method instead. The `customizer` is invoked with six arguments:
+     * (objValue, srcValue, key, object, source, stack).
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category Object
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the new array of key-value pairs.
+     * @param {Object} object The destination object.
+     * @param {...Object} sources The source objects.
+     * @param {Function} customizer The function to customize assigned values.
+     * @returns {Object} Returns `object`.
      * @example
      *
-     * _.pairs({ 'barney': 36, 'fred': 40 });
-     * // => [['barney', 36], ['fred', 40]] (iteration order is not guaranteed)
+     * function customizer(objValue, srcValue) {
+     *   if (_.isArray(objValue)) {
+     *     return objValue.concat(srcValue);
+     *   }
+     * }
+     *
+     * var object = { 'a': [1], 'b': [2] };
+     * var other = { 'a': [3], 'b': [4] };
+     *
+     * _.mergeWith(object, other, customizer);
+     * // => { 'a': [1, 3], 'b': [2, 4] }
      */
-    function pairs(object) {
-      object = toObject(object);
-
-      var index = -1,
-          props = keys(object),
-          length = props.length,
-          result = Array(length);
+    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {
+      baseMerge(object, source, srcIndex, customizer);
+    });
 
-      while (++index < length) {
-        var key = props[index];
-        result[index] = [key, object[key]];
+    /**
+     * The opposite of `_.pick`; this method creates an object composed of the
+     * own and inherited enumerable property paths of `object` that are not omitted.
+     *
+     * **Note:** This method is considerably slower than `_.pick`.
+     *
+     * @static
+     * @since 0.1.0
+     * @memberOf _
+     * @category Object
+     * @param {Object} object The source object.
+     * @param {...(string|string[])} [paths] The property paths to omit.
+     * @returns {Object} Returns the new object.
+     * @example
+     *
+     * var object = { 'a': 1, 'b': '2', 'c': 3 };
+     *
+     * _.omit(object, ['a', 'c']);
+     * // => { 'b': '2' }
+     */
+    var omit = flatRest(function(object, paths) {
+      var result = {};
+      if (object == null) {
+        return result;
+      }
+      var isDeep = false;
+      paths = arrayMap(paths, function(path) {
+        path = castPath(path, object);
+        isDeep || (isDeep = path.length > 1);
+        return path;
+      });
+      copyObject(object, getAllKeysIn(object), result);
+      if (isDeep) {
+        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);
+      }
+      var length = paths.length;
+      while (length--) {
+        baseUnset(result, paths[length]);
       }
       return result;
+    });
+
+    /**
+     * The opposite of `_.pickBy`; this method creates an object composed of
+     * the own and inherited enumerable string keyed properties of `object` that
+     * `predicate` doesn't return truthy for. The predicate is invoked with two
+     * arguments: (value, key).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The source object.
+     * @param {Function} [predicate=_.identity] The function invoked per property.
+     * @returns {Object} Returns the new object.
+     * @example
+     *
+     * var object = { 'a': 1, 'b': '2', 'c': 3 };
+     *
+     * _.omitBy(object, _.isNumber);
+     * // => { 'b': '2' }
+     */
+    function omitBy(object, predicate) {
+      return pickBy(object, negate(getIteratee(predicate)));
     }
 
     /**
-     * Creates an object composed of the picked `object` properties. Property
-     * names may be specified as individual arguments or as arrays of property
-     * names. If `predicate` is provided it is invoked for each property of `object`
-     * picking the properties `predicate` returns truthy for. The predicate is
-     * bound to `thisArg` and invoked with three arguments: (value, key, object).
+     * Creates an object composed of the picked `object` properties.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category Object
      * @param {Object} object The source object.
-     * @param {Function|...(string|string[])} [predicate] The function invoked per
-     *  iteration or property names to pick, specified as individual property
-     *  names or arrays of property names.
-     * @param {*} [thisArg] The `this` binding of `predicate`.
+     * @param {...(string|string[])} [paths] The property paths to pick.
      * @returns {Object} Returns the new object.
      * @example
      *
-     * var object = { 'user': 'fred', 'age': 40 };
+     * var object = { 'a': 1, 'b': '2', 'c': 3 };
+     *
+     * _.pick(object, ['a', 'c']);
+     * // => { 'a': 1, 'c': 3 }
+     */
+    var pick = flatRest(function(object, paths) {
+      return object == null ? {} : basePick(object, paths);
+    });
+
+    /**
+     * Creates an object composed of the `object` properties `predicate` returns
+     * truthy for. The predicate is invoked with two arguments: (value, key).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The source object.
+     * @param {Function} [predicate=_.identity] The function invoked per property.
+     * @returns {Object} Returns the new object.
+     * @example
      *
-     * _.pick(object, 'user');
-     * // => { 'user': 'fred' }
+     * var object = { 'a': 1, 'b': '2', 'c': 3 };
      *
-     * _.pick(object, _.isString);
-     * // => { 'user': 'fred' }
+     * _.pickBy(object, _.isNumber);
+     * // => { 'a': 1, 'c': 3 }
      */
-    var pick = restParam(function(object, props) {
+    function pickBy(object, predicate) {
       if (object == null) {
         return {};
       }
-      return typeof props[0] == 'function'
-        ? pickByCallback(object, bindCallback(props[0], props[1], 3))
-        : pickByArray(object, baseFlatten(props));
-    });
+      var props = arrayMap(getAllKeysIn(object), function(prop) {
+        return [prop];
+      });
+      predicate = getIteratee(predicate);
+      return basePickBy(object, props, function(value, path) {
+        return predicate(value, path[0]);
+      });
+    }
 
     /**
-     * This method is like `_.get` except that if the resolved value is a function
-     * it is invoked with the `this` binding of its parent object and its result
-     * is returned.
+     * This method is like `_.get` except that if the resolved value is a
+     * function it's invoked with the `this` binding of its parent object and
+     * its result is returned.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category Object
      * @param {Object} object The object to query.
      * @param {Array|string} path The path of the property to resolve.
-     * @param {*} [defaultValue] The value returned if the resolved value is `undefined`.
+     * @param {*} [defaultValue] The value returned for `undefined` resolved values.
      * @returns {*} Returns the resolved value.
      * @example
      *
@@ -17867,33 +18887,47 @@ module.exports = ClipperLib;
      * _.result(object, 'a[0].b.c2');
      * // => 4
      *
-     * _.result(object, 'a.b.c', 'default');
+     * _.result(object, 'a[0].b.c3', 'default');
      * // => 'default'
      *
-     * _.result(object, 'a.b.c', _.constant('default'));
+     * _.result(object, 'a[0].b.c3', _.constant('default'));
      * // => 'default'
      */
     function result(object, path, defaultValue) {
-      var result = object == null ? undefined : object[path];
-      if (result === undefined) {
-        if (object != null && !isKey(path, object)) {
-          path = toPath(path);
-          object = path.length == 1 ? object : baseGet(object, baseSlice(path, 0, -1));
-          result = object == null ? undefined : object[last(path)];
+      path = castPath(path, object);
+
+      var index = -1,
+          length = path.length;
+
+      // Ensure the loop is entered when path is empty.
+      if (!length) {
+        length = 1;
+        object = undefined;
+      }
+      while (++index < length) {
+        var value = object == null ? undefined : object[toKey(path[index])];
+        if (value === undefined) {
+          index = length;
+          value = defaultValue;
         }
-        result = result === undefined ? defaultValue : result;
+        object = isFunction(value) ? value.call(object) : value;
       }
-      return isFunction(result) ? result.call(object) : result;
+      return object;
     }
 
     /**
-     * Sets the property value of `path` on `object`. If a portion of `path`
-     * does not exist it is created.
+     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,
+     * it's created. Arrays are created for missing index properties while objects
+     * are created for all other missing properties. Use `_.setWith` to customize
+     * `path` creation.
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
+     * @since 3.7.0
      * @category Object
-     * @param {Object} object The object to augment.
+     * @param {Object} object The object to modify.
      * @param {Array|string} path The path of the property to set.
      * @param {*} value The value to set.
      * @returns {Object} Returns `object`.
@@ -17905,93 +18939,246 @@ module.exports = ClipperLib;
      * console.log(object.a[0].b.c);
      * // => 4
      *
-     * _.set(object, 'x[0].y.z', 5);
+     * _.set(object, ['x', '0', 'y', 'z'], 5);
      * console.log(object.x[0].y.z);
      * // => 5
      */
     function set(object, path, value) {
-      if (object == null) {
-        return object;
-      }
-      var pathKey = (path + '');
-      path = (object[pathKey] != null || isKey(path, object)) ? [pathKey] : toPath(path);
-
-      var index = -1,
-          length = path.length,
-          lastIndex = length - 1,
-          nested = object;
+      return object == null ? object : baseSet(object, path, value);
+    }
 
-      while (nested != null && ++index < length) {
-        var key = path[index];
-        if (isObject(nested)) {
-          if (index == lastIndex) {
-            nested[key] = value;
-          } else if (nested[key] == null) {
-            nested[key] = isIndex(path[index + 1]) ? [] : {};
-          }
-        }
-        nested = nested[key];
-      }
-      return object;
+    /**
+     * This method is like `_.set` except that it accepts `customizer` which is
+     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`
+     * path creation is handled by the method instead. The `customizer` is invoked
+     * with three arguments: (nsValue, key, nsObject).
+     *
+     * **Note:** This method mutates `object`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to set.
+     * @param {*} value The value to set.
+     * @param {Function} [customizer] The function to customize assigned values.
+     * @returns {Object} Returns `object`.
+     * @example
+     *
+     * var object = {};
+     *
+     * _.setWith(object, '[0][1]', 'a', Object);
+     * // => { '0': { '1': 'a' } }
+     */
+    function setWith(object, path, value, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined;
+      return object == null ? object : baseSet(object, path, value, customizer);
     }
 
+    /**
+     * Creates an array of own enumerable string keyed-value pairs for `object`
+     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its
+     * entries are returned.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @alias entries
+     * @category Object
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the key-value pairs.
+     * @example
+     *
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
+     *
+     * Foo.prototype.c = 3;
+     *
+     * _.toPairs(new Foo);
+     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)
+     */
+    var toPairs = createToPairs(keys);
+
+    /**
+     * Creates an array of own and inherited enumerable string keyed-value pairs
+     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map
+     * or set, its entries are returned.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @alias entriesIn
+     * @category Object
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the key-value pairs.
+     * @example
+     *
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
+     *
+     * Foo.prototype.c = 3;
+     *
+     * _.toPairsIn(new Foo);
+     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)
+     */
+    var toPairsIn = createToPairs(keysIn);
+
     /**
      * An alternative to `_.reduce`; this method transforms `object` to a new
-     * `accumulator` object which is the result of running each of its own enumerable
-     * properties through `iteratee`, with each invocation potentially mutating
-     * the `accumulator` object. The `iteratee` is bound to `thisArg` and invoked
-     * with four arguments: (accumulator, value, key, object). Iteratee functions
-     * may exit iteration early by explicitly returning `false`.
+     * `accumulator` object which is the result of running each of its own
+     * enumerable string keyed properties thru `iteratee`, with each invocation
+     * potentially mutating the `accumulator` object. If `accumulator` is not
+     * provided, a new object with the same `[[Prototype]]` will be used. The
+     * iteratee is invoked with four arguments: (accumulator, value, key, object).
+     * Iteratee functions may exit iteration early by explicitly returning `false`.
      *
      * @static
      * @memberOf _
+     * @since 1.3.0
      * @category Object
-     * @param {Array|Object} object The object to iterate over.
+     * @param {Object} object The object to iterate over.
      * @param {Function} [iteratee=_.identity] The function invoked per iteration.
      * @param {*} [accumulator] The custom accumulator value.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
      * @returns {*} Returns the accumulated value.
      * @example
      *
      * _.transform([2, 3, 4], function(result, n) {
      *   result.push(n *= n);
      *   return n % 2 == 0;
-     * });
+     * }, []);
      * // => [4, 9]
      *
-     * _.transform({ 'a': 1, 'b': 2 }, function(result, n, key) {
-     *   result[key] = n * 3;
-     * });
-     * // => { 'a': 3, 'b': 6 }
+     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
+     *   (result[value] || (result[value] = [])).push(key);
+     * }, {});
+     * // => { '1': ['a', 'c'], '2': ['b'] }
      */
-    function transform(object, iteratee, accumulator, thisArg) {
-      var isArr = isArray(object) || isTypedArray(object);
-      iteratee = getCallback(iteratee, thisArg, 4);
+    function transform(object, iteratee, accumulator) {
+      var isArr = isArray(object),
+          isArrLike = isArr || isBuffer(object) || isTypedArray(object);
 
+      iteratee = getIteratee(iteratee, 4);
       if (accumulator == null) {
-        if (isArr || isObject(object)) {
-          var Ctor = object.constructor;
-          if (isArr) {
-            accumulator = isArray(object) ? new Ctor : [];
-          } else {
-            accumulator = baseCreate(isFunction(Ctor) ? Ctor.prototype : undefined);
-          }
-        } else {
+        var Ctor = object && object.constructor;
+        if (isArrLike) {
+          accumulator = isArr ? new Ctor : [];
+        }
+        else if (isObject(object)) {
+          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};
+        }
+        else {
           accumulator = {};
         }
       }
-      (isArr ? arrayEach : baseForOwn)(object, function(value, index, object) {
+      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {
         return iteratee(accumulator, value, index, object);
       });
       return accumulator;
     }
 
     /**
-     * Creates an array of the own enumerable property values of `object`.
+     * Removes the property at `path` of `object`.
+     *
+     * **Note:** This method mutates `object`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to unset.
+     * @returns {boolean} Returns `true` if the property is deleted, else `false`.
+     * @example
+     *
+     * var object = { 'a': [{ 'b': { 'c': 7 } }] };
+     * _.unset(object, 'a[0].b.c');
+     * // => true
+     *
+     * console.log(object);
+     * // => { 'a': [{ 'b': {} }] };
+     *
+     * _.unset(object, ['a', '0', 'b', 'c']);
+     * // => true
+     *
+     * console.log(object);
+     * // => { 'a': [{ 'b': {} }] };
+     */
+    function unset(object, path) {
+      return object == null ? true : baseUnset(object, path);
+    }
+
+    /**
+     * This method is like `_.set` except that accepts `updater` to produce the
+     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`
+     * is invoked with one argument: (value).
+     *
+     * **Note:** This method mutates `object`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.6.0
+     * @category Object
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to set.
+     * @param {Function} updater The function to produce the updated value.
+     * @returns {Object} Returns `object`.
+     * @example
+     *
+     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
+     *
+     * _.update(object, 'a[0].b.c', function(n) { return n * n; });
+     * console.log(object.a[0].b.c);
+     * // => 9
+     *
+     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });
+     * console.log(object.x[0].y.z);
+     * // => 0
+     */
+    function update(object, path, updater) {
+      return object == null ? object : baseUpdate(object, path, castFunction(updater));
+    }
+
+    /**
+     * This method is like `_.update` except that it accepts `customizer` which is
+     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`
+     * path creation is handled by the method instead. The `customizer` is invoked
+     * with three arguments: (nsValue, key, nsObject).
+     *
+     * **Note:** This method mutates `object`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.6.0
+     * @category Object
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to set.
+     * @param {Function} updater The function to produce the updated value.
+     * @param {Function} [customizer] The function to customize assigned values.
+     * @returns {Object} Returns `object`.
+     * @example
+     *
+     * var object = {};
+     *
+     * _.updateWith(object, '[0][1]', _.constant('a'), Object);
+     * // => { '0': { '1': 'a' } }
+     */
+    function updateWith(object, path, updater, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined;
+      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);
+    }
+
+    /**
+     * Creates an array of the own enumerable string keyed property values of `object`.
      *
      * **Note:** Non-object values are coerced to objects.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category Object
      * @param {Object} object The object to query.
@@ -18012,17 +19199,18 @@ module.exports = ClipperLib;
      * // => ['h', 'i']
      */
     function values(object) {
-      return baseValues(object, keys(object));
+      return object == null ? [] : baseValues(object, keys(object));
     }
 
     /**
-     * Creates an array of the own and inherited enumerable property values
-     * of `object`.
+     * Creates an array of the own and inherited enumerable string keyed property
+     * values of `object`.
      *
      * **Note:** Non-object values are coerced to objects.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category Object
      * @param {Object} object The object to query.
      * @returns {Array} Returns the array of property values.
@@ -18039,22 +19227,61 @@ module.exports = ClipperLib;
      * // => [1, 2, 3] (iteration order is not guaranteed)
      */
     function valuesIn(object) {
-      return baseValues(object, keysIn(object));
+      return object == null ? [] : baseValues(object, keysIn(object));
     }
 
     /*------------------------------------------------------------------------*/
 
     /**
-     * Checks if `n` is between `start` and up to but not including, `end`. If
-     * `end` is not specified it is set to `start` with `start` then set to `0`.
+     * Clamps `number` within the inclusive `lower` and `upper` bounds.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Number
+     * @param {number} number The number to clamp.
+     * @param {number} [lower] The lower bound.
+     * @param {number} upper The upper bound.
+     * @returns {number} Returns the clamped number.
+     * @example
+     *
+     * _.clamp(-10, -5, 5);
+     * // => -5
+     *
+     * _.clamp(10, -5, 5);
+     * // => 5
+     */
+    function clamp(number, lower, upper) {
+      if (upper === undefined) {
+        upper = lower;
+        lower = undefined;
+      }
+      if (upper !== undefined) {
+        upper = toNumber(upper);
+        upper = upper === upper ? upper : 0;
+      }
+      if (lower !== undefined) {
+        lower = toNumber(lower);
+        lower = lower === lower ? lower : 0;
+      }
+      return baseClamp(toNumber(number), lower, upper);
+    }
+
+    /**
+     * Checks if `n` is between `start` and up to, but not including, `end`. If
+     * `end` is not specified, it's set to `start` with `start` then set to `0`.
+     * If `start` is greater than `end` the params are swapped to support
+     * negative ranges.
      *
      * @static
      * @memberOf _
+     * @since 3.3.0
      * @category Number
-     * @param {number} n The number to check.
+     * @param {number} number The number to check.
      * @param {number} [start=0] The start of the range.
      * @param {number} end The end of the range.
-     * @returns {boolean} Returns `true` if `n` is in the range, else `false`.
+     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.
+     * @see _.range, _.rangeRight
      * @example
      *
      * _.inRange(3, 2, 4);
@@ -18074,29 +19301,37 @@ module.exports = ClipperLib;
      *
      * _.inRange(5.2, 4);
      * // => false
+     *
+     * _.inRange(-3, -2, -6);
+     * // => true
      */
-    function inRange(value, start, end) {
-      start = +start || 0;
+    function inRange(number, start, end) {
+      start = toFinite(start);
       if (end === undefined) {
         end = start;
         start = 0;
       } else {
-        end = +end || 0;
+        end = toFinite(end);
       }
-      return value >= nativeMin(start, end) && value < nativeMax(start, end);
+      number = toNumber(number);
+      return baseInRange(number, start, end);
     }
 
     /**
-     * Produces a random number between `min` and `max` (inclusive). If only one
-     * argument is provided a number between `0` and the given number is returned.
-     * If `floating` is `true`, or either `min` or `max` are floats, a floating-point
-     * number is returned instead of an integer.
+     * Produces a random number between the inclusive `lower` and `upper` bounds.
+     * If only one argument is provided a number between `0` and the given number
+     * is returned. If `floating` is `true`, or either `lower` or `upper` are
+     * floats, a floating-point number is returned instead of an integer.
+     *
+     * **Note:** JavaScript follows the IEEE-754 standard for resolving
+     * floating-point values which can produce unexpected results.
      *
      * @static
      * @memberOf _
+     * @since 0.7.0
      * @category Number
-     * @param {number} [min=0] The minimum possible value.
-     * @param {number} [max=1] The maximum possible value.
+     * @param {number} [lower=0] The lower bound.
+     * @param {number} [upper=1] The upper bound.
      * @param {boolean} [floating] Specify returning a floating-point number.
      * @returns {number} Returns the random number.
      * @example
@@ -18113,39 +19348,43 @@ module.exports = ClipperLib;
      * _.random(1.2, 5.2);
      * // => a floating-point number between 1.2 and 5.2
      */
-    function random(min, max, floating) {
-      if (floating && isIterateeCall(min, max, floating)) {
-        max = floating = undefined;
+    function random(lower, upper, floating) {
+      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {
+        upper = floating = undefined;
       }
-      var noMin = min == null,
-          noMax = max == null;
-
-      if (floating == null) {
-        if (noMax && typeof min == 'boolean') {
-          floating = min;
-          min = 1;
+      if (floating === undefined) {
+        if (typeof upper == 'boolean') {
+          floating = upper;
+          upper = undefined;
         }
-        else if (typeof max == 'boolean') {
-          floating = max;
-          noMax = true;
+        else if (typeof lower == 'boolean') {
+          floating = lower;
+          lower = undefined;
         }
       }
-      if (noMin && noMax) {
-        max = 1;
-        noMax = false;
+      if (lower === undefined && upper === undefined) {
+        lower = 0;
+        upper = 1;
       }
-      min = +min || 0;
-      if (noMax) {
-        max = min;
-        min = 0;
-      } else {
-        max = +max || 0;
+      else {
+        lower = toFinite(lower);
+        if (upper === undefined) {
+          upper = lower;
+          lower = 0;
+        } else {
+          upper = toFinite(upper);
+        }
+      }
+      if (lower > upper) {
+        var temp = lower;
+        lower = upper;
+        upper = temp;
       }
-      if (floating || min % 1 || max % 1) {
+      if (floating || lower % 1 || upper % 1) {
         var rand = nativeRandom();
-        return nativeMin(min + (rand * (max - min + parseFloat('1e-' + ((rand + '').length - 1)))), max);
+        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);
       }
-      return baseRandom(min, max);
+      return baseRandom(lower, upper);
     }
 
     /*------------------------------------------------------------------------*/
@@ -18155,6 +19394,7 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
      * @param {string} [string=''] The string to convert.
      * @returns {string} Returns the camel cased string.
@@ -18163,41 +19403,46 @@ module.exports = ClipperLib;
      * _.camelCase('Foo Bar');
      * // => 'fooBar'
      *
-     * _.camelCase('--foo-bar');
+     * _.camelCase('--foo-bar--');
      * // => 'fooBar'
      *
-     * _.camelCase('__foo_bar__');
+     * _.camelCase('__FOO_BAR__');
      * // => 'fooBar'
      */
     var camelCase = createCompounder(function(result, word, index) {
       word = word.toLowerCase();
-      return result + (index ? (word.charAt(0).toUpperCase() + word.slice(1)) : word);
+      return result + (index ? capitalize(word) : word);
     });
 
     /**
-     * Capitalizes the first character of `string`.
+     * Converts the first character of `string` to upper case and the remaining
+     * to lower case.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
      * @param {string} [string=''] The string to capitalize.
      * @returns {string} Returns the capitalized string.
      * @example
      *
-     * _.capitalize('fred');
+     * _.capitalize('FRED');
      * // => 'Fred'
      */
     function capitalize(string) {
-      string = baseToString(string);
-      return string && (string.charAt(0).toUpperCase() + string.slice(1));
+      return upperFirst(toString(string).toLowerCase());
     }
 
     /**
-     * Deburrs `string` by converting [latin-1 supplementary letters](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)
-     * to basic latin letters and removing [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).
+     * Deburrs `string` by converting
+     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)
+     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)
+     * letters to basic Latin letters and removing
+     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
      * @param {string} [string=''] The string to deburr.
      * @returns {string} Returns the deburred string.
@@ -18207,8 +19452,8 @@ module.exports = ClipperLib;
      * // => 'deja vu'
      */
     function deburr(string) {
-      string = baseToString(string);
-      return string && string.replace(reLatin1, deburrLetter).replace(reComboMark, '');
+      string = toString(string);
+      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');
     }
 
     /**
@@ -18216,11 +19461,13 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
-     * @param {string} [string=''] The string to search.
+     * @param {string} [string=''] The string to inspect.
      * @param {string} [target] The string to search for.
-     * @param {number} [position=string.length] The position to search from.
-     * @returns {boolean} Returns `true` if `string` ends with `target`, else `false`.
+     * @param {number} [position=string.length] The position to search up to.
+     * @returns {boolean} Returns `true` if `string` ends with `target`,
+     *  else `false`.
      * @example
      *
      * _.endsWith('abc', 'c');
@@ -18233,41 +19480,38 @@ module.exports = ClipperLib;
      * // => true
      */
     function endsWith(string, target, position) {
-      string = baseToString(string);
-      target = (target + '');
+      string = toString(string);
+      target = baseToString(target);
 
       var length = string.length;
       position = position === undefined
         ? length
-        : nativeMin(position < 0 ? 0 : (+position || 0), length);
+        : baseClamp(toInteger(position), 0, length);
 
+      var end = position;
       position -= target.length;
-      return position >= 0 && string.indexOf(target, position) == position;
+      return position >= 0 && string.slice(position, end) == target;
     }
 
     /**
-     * Converts the characters "&", "<", ">", '"', "'", and "\`", in `string` to
-     * their corresponding HTML entities.
+     * Converts the characters "&", "<", ">", '"', and "'" in `string` to their
+     * corresponding HTML entities.
      *
-     * **Note:** No other characters are escaped. To escape additional characters
-     * use a third-party library like [_he_](https://mths.be/he).
+     * **Note:** No other characters are escaped. To escape additional
+     * characters use a third-party library like [_he_](https://mths.be/he).
      *
      * Though the ">" character is escaped for symmetry, characters like
      * ">" and "/" don't need escaping in HTML and have no special meaning
-     * unless they're part of a tag or unquoted attribute value.
-     * See [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)
+     * unless they're part of a tag or unquoted attribute value. See
+     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)
      * (under "semi-related fun fact") for more details.
      *
-     * Backticks are escaped because in Internet Explorer < 9, they can break out
-     * of attribute values or HTML comments. See [#59](https://html5sec.org/#59),
-     * [#102](https://html5sec.org/#102), [#108](https://html5sec.org/#108), and
-     * [#133](https://html5sec.org/#133) of the [HTML5 Security Cheatsheet](https://html5sec.org/)
-     * for more details.
-     *
-     * When working with HTML you should always [quote attribute values](http://wonko.com/post/html-escaping)
-     * to reduce XSS vectors.
+     * When working with HTML you should always
+     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce
+     * XSS vectors.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category String
      * @param {string} [string=''] The string to escape.
@@ -18278,39 +19522,41 @@ module.exports = ClipperLib;
      * // => 'fred, barney, &amp; pebbles'
      */
     function escape(string) {
-      // Reset `lastIndex` because in IE < 9 `String#replace` does not.
-      string = baseToString(string);
+      string = toString(string);
       return (string && reHasUnescapedHtml.test(string))
         ? string.replace(reUnescapedHtml, escapeHtmlChar)
         : string;
     }
 
     /**
-     * Escapes the `RegExp` special characters "\", "/", "^", "$", ".", "|", "?",
-     * "*", "+", "(", ")", "[", "]", "{" and "}" in `string`.
+     * Escapes the `RegExp` special characters "^", "$", "\", ".", "*", "+",
+     * "?", "(", ")", "[", "]", "{", "}", and "|" in `string`.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
      * @param {string} [string=''] The string to escape.
      * @returns {string} Returns the escaped string.
      * @example
      *
      * _.escapeRegExp('[lodash](https://lodash.com/)');
-     * // => '\[lodash\]\(https:\/\/lodash\.com\/\)'
+     * // => '\[lodash\]\(https://lodash\.com/\)'
      */
     function escapeRegExp(string) {
-      string = baseToString(string);
-      return (string && reHasRegExpChars.test(string))
-        ? string.replace(reRegExpChars, escapeRegExpChar)
-        : (string || '(?:)');
+      string = toString(string);
+      return (string && reHasRegExpChar.test(string))
+        ? string.replace(reRegExpChar, '\\$&')
+        : string;
     }
 
     /**
-     * Converts `string` to [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).
+     * Converts `string` to
+     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
      * @param {string} [string=''] The string to convert.
      * @returns {string} Returns the kebab cased string.
@@ -18322,7 +19568,7 @@ module.exports = ClipperLib;
      * _.kebabCase('fooBar');
      * // => 'foo-bar'
      *
-     * _.kebabCase('__foo_bar__');
+     * _.kebabCase('__FOO_BAR__');
      * // => 'foo-bar'
      */
     var kebabCase = createCompounder(function(result, word, index) {
@@ -18330,49 +19576,94 @@ module.exports = ClipperLib;
     });
 
     /**
-     * Pads `string` on the left and right sides if it's shorter than `length`.
-     * Padding characters are truncated if they can't be evenly divided by `length`.
+     * Converts `string`, as space separated words, to lower case.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category String
-     * @param {string} [string=''] The string to pad.
-     * @param {number} [length=0] The padding length.
-     * @param {string} [chars=' '] The string used as padding.
-     * @returns {string} Returns the padded string.
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the lower cased string.
      * @example
      *
-     * _.pad('abc', 8);
-     * // => '  abc   '
+     * _.lowerCase('--Foo-Bar--');
+     * // => 'foo bar'
      *
-     * _.pad('abc', 8, '_-');
-     * // => '_-abc_-_'
+     * _.lowerCase('fooBar');
+     * // => 'foo bar'
      *
-     * _.pad('abc', 3);
-     * // => 'abc'
+     * _.lowerCase('__FOO_BAR__');
+     * // => 'foo bar'
+     */
+    var lowerCase = createCompounder(function(result, word, index) {
+      return result + (index ? ' ' : '') + word.toLowerCase();
+    });
+
+    /**
+     * Converts the first character of `string` to lower case.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the converted string.
+     * @example
+     *
+     * _.lowerFirst('Fred');
+     * // => 'fred'
+     *
+     * _.lowerFirst('FRED');
+     * // => 'fRED'
+     */
+    var lowerFirst = createCaseFirst('toLowerCase');
+
+    /**
+     * Pads `string` on the left and right sides if it's shorter than `length`.
+     * Padding characters are truncated if they can't be evenly divided by `length`.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to pad.
+     * @param {number} [length=0] The padding length.
+     * @param {string} [chars=' '] The string used as padding.
+     * @returns {string} Returns the padded string.
+     * @example
+     *
+     * _.pad('abc', 8);
+     * // => '  abc   '
+     *
+     * _.pad('abc', 8, '_-');
+     * // => '_-abc_-_'
+     *
+     * _.pad('abc', 3);
+     * // => 'abc'
      */
     function pad(string, length, chars) {
-      string = baseToString(string);
-      length = +length;
+      string = toString(string);
+      length = toInteger(length);
 
-      var strLength = string.length;
-      if (strLength >= length || !nativeIsFinite(length)) {
+      var strLength = length ? stringSize(string) : 0;
+      if (!length || strLength >= length) {
         return string;
       }
-      var mid = (length - strLength) / 2,
-          leftLength = nativeFloor(mid),
-          rightLength = nativeCeil(mid);
-
-      chars = createPadding('', rightLength, chars);
-      return chars.slice(0, leftLength) + string + chars;
+      var mid = (length - strLength) / 2;
+      return (
+        createPadding(nativeFloor(mid), chars) +
+        string +
+        createPadding(nativeCeil(mid), chars)
+      );
     }
 
     /**
-     * Pads `string` on the left side if it's shorter than `length`. Padding
+     * Pads `string` on the right side if it's shorter than `length`. Padding
      * characters are truncated if they exceed `length`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category String
      * @param {string} [string=''] The string to pad.
      * @param {number} [length=0] The padding length.
@@ -18380,23 +19671,32 @@ module.exports = ClipperLib;
      * @returns {string} Returns the padded string.
      * @example
      *
-     * _.padLeft('abc', 6);
-     * // => '   abc'
+     * _.padEnd('abc', 6);
+     * // => 'abc   '
      *
-     * _.padLeft('abc', 6, '_-');
-     * // => '_-_abc'
+     * _.padEnd('abc', 6, '_-');
+     * // => 'abc_-_'
      *
-     * _.padLeft('abc', 3);
+     * _.padEnd('abc', 3);
      * // => 'abc'
      */
-    var padLeft = createPadDir();
+    function padEnd(string, length, chars) {
+      string = toString(string);
+      length = toInteger(length);
+
+      var strLength = length ? stringSize(string) : 0;
+      return (length && strLength < length)
+        ? (string + createPadding(length - strLength, chars))
+        : string;
+    }
 
     /**
-     * Pads `string` on the right side if it's shorter than `length`. Padding
+     * Pads `string` on the left side if it's shorter than `length`. Padding
      * characters are truncated if they exceed `length`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category String
      * @param {string} [string=''] The string to pad.
      * @param {number} [length=0] The padding length.
@@ -18404,31 +19704,40 @@ module.exports = ClipperLib;
      * @returns {string} Returns the padded string.
      * @example
      *
-     * _.padRight('abc', 6);
-     * // => 'abc   '
+     * _.padStart('abc', 6);
+     * // => '   abc'
      *
-     * _.padRight('abc', 6, '_-');
-     * // => 'abc_-_'
+     * _.padStart('abc', 6, '_-');
+     * // => '_-_abc'
      *
-     * _.padRight('abc', 3);
+     * _.padStart('abc', 3);
      * // => 'abc'
      */
-    var padRight = createPadDir(true);
+    function padStart(string, length, chars) {
+      string = toString(string);
+      length = toInteger(length);
+
+      var strLength = length ? stringSize(string) : 0;
+      return (length && strLength < length)
+        ? (createPadding(length - strLength, chars) + string)
+        : string;
+    }
 
     /**
      * Converts `string` to an integer of the specified radix. If `radix` is
-     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a hexadecimal,
-     * in which case a `radix` of `16` is used.
+     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a
+     * hexadecimal, in which case a `radix` of `16` is used.
      *
-     * **Note:** This method aligns with the [ES5 implementation](https://es5.github.io/#E)
-     * of `parseInt`.
+     * **Note:** This method aligns with the
+     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.
      *
      * @static
      * @memberOf _
+     * @since 1.1.0
      * @category String
      * @param {string} string The string to convert.
-     * @param {number} [radix] The radix to interpret `value` by.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param {number} [radix=10] The radix to interpret `value` by.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {number} Returns the converted integer.
      * @example
      *
@@ -18439,16 +19748,12 @@ module.exports = ClipperLib;
      * // => [6, 8, 10]
      */
     function parseInt(string, radix, guard) {
-      // Firefox < 21 and Opera < 15 follow ES3 for `parseInt`.
-      // Chrome fails to trim leading <BOM> whitespace characters.
-      // See https://code.google.com/p/v8/issues/detail?id=3109 for more details.
-      if (guard ? isIterateeCall(string, radix, guard) : radix == null) {
+      if (guard || radix == null) {
         radix = 0;
       } else if (radix) {
         radix = +radix;
       }
-      string = trim(string);
-      return nativeParseInt(string, radix || (reHasHexPrefix.test(string) ? 16 : 10));
+      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);
     }
 
     /**
@@ -18456,9 +19761,11 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
      * @param {string} [string=''] The string to repeat.
-     * @param {number} [n=0] The number of times to repeat the string.
+     * @param {number} [n=1] The number of times to repeat the string.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {string} Returns the repeated string.
      * @example
      *
@@ -18471,31 +19778,48 @@ module.exports = ClipperLib;
      * _.repeat('abc', 0);
      * // => ''
      */
-    function repeat(string, n) {
-      var result = '';
-      string = baseToString(string);
-      n = +n;
-      if (n < 1 || !string || !nativeIsFinite(n)) {
-        return result;
+    function repeat(string, n, guard) {
+      if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {
+        n = 1;
+      } else {
+        n = toInteger(n);
       }
-      // Leverage the exponentiation by squaring algorithm for a faster repeat.
-      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.
-      do {
-        if (n % 2) {
-          result += string;
-        }
-        n = nativeFloor(n / 2);
-        string += string;
-      } while (n);
+      return baseRepeat(toString(string), n);
+    }
 
-      return result;
+    /**
+     * Replaces matches for `pattern` in `string` with `replacement`.
+     *
+     * **Note:** This method is based on
+     * [`String#replace`](https://mdn.io/String/replace).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to modify.
+     * @param {RegExp|string} pattern The pattern to replace.
+     * @param {Function|string} replacement The match replacement.
+     * @returns {string} Returns the modified string.
+     * @example
+     *
+     * _.replace('Hi Fred', 'Fred', 'Barney');
+     * // => 'Hi Barney'
+     */
+    function replace() {
+      var args = arguments,
+          string = toString(args[0]);
+
+      return args.length < 3 ? string : string.replace(args[1], args[2]);
     }
 
     /**
-     * Converts `string` to [snake case](https://en.wikipedia.org/wiki/Snake_case).
+     * Converts `string` to
+     * [snake case](https://en.wikipedia.org/wiki/Snake_case).
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
      * @param {string} [string=''] The string to convert.
      * @returns {string} Returns the snake cased string.
@@ -18507,7 +19831,7 @@ module.exports = ClipperLib;
      * _.snakeCase('fooBar');
      * // => 'foo_bar'
      *
-     * _.snakeCase('--foo-bar');
+     * _.snakeCase('--FOO-BAR--');
      * // => 'foo_bar'
      */
     var snakeCase = createCompounder(function(result, word, index) {
@@ -18515,26 +19839,68 @@ module.exports = ClipperLib;
     });
 
     /**
-     * Converts `string` to [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).
+     * Splits `string` by `separator`.
+     *
+     * **Note:** This method is based on
+     * [`String#split`](https://mdn.io/String/split).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to split.
+     * @param {RegExp|string} separator The separator pattern to split by.
+     * @param {number} [limit] The length to truncate results to.
+     * @returns {Array} Returns the string segments.
+     * @example
+     *
+     * _.split('a-b-c', '-', 2);
+     * // => ['a', 'b']
+     */
+    function split(string, separator, limit) {
+      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {
+        separator = limit = undefined;
+      }
+      limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;
+      if (!limit) {
+        return [];
+      }
+      string = toString(string);
+      if (string && (
+            typeof separator == 'string' ||
+            (separator != null && !isRegExp(separator))
+          )) {
+        separator = baseToString(separator);
+        if (!separator && hasUnicode(string)) {
+          return castSlice(stringToArray(string), 0, limit);
+        }
+      }
+      return string.split(separator, limit);
+    }
+
+    /**
+     * Converts `string` to
+     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).
      *
      * @static
      * @memberOf _
+     * @since 3.1.0
      * @category String
      * @param {string} [string=''] The string to convert.
      * @returns {string} Returns the start cased string.
      * @example
      *
-     * _.startCase('--foo-bar');
+     * _.startCase('--foo-bar--');
      * // => 'Foo Bar'
      *
      * _.startCase('fooBar');
      * // => 'Foo Bar'
      *
-     * _.startCase('__foo_bar__');
-     * // => 'Foo Bar'
+     * _.startCase('__FOO_BAR__');
+     * // => 'FOO BAR'
      */
     var startCase = createCompounder(function(result, word, index) {
-      return result + (index ? ' ' : '') + (word.charAt(0).toUpperCase() + word.slice(1));
+      return result + (index ? ' ' : '') + upperFirst(word);
     });
 
     /**
@@ -18542,11 +19908,13 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
-     * @param {string} [string=''] The string to search.
+     * @param {string} [string=''] The string to inspect.
      * @param {string} [target] The string to search for.
      * @param {number} [position=0] The position to search from.
-     * @returns {boolean} Returns `true` if `string` starts with `target`, else `false`.
+     * @returns {boolean} Returns `true` if `string` starts with `target`,
+     *  else `false`.
      * @example
      *
      * _.startsWith('abc', 'a');
@@ -18559,12 +19927,13 @@ module.exports = ClipperLib;
      * // => true
      */
     function startsWith(string, target, position) {
-      string = baseToString(string);
+      string = toString(string);
       position = position == null
         ? 0
-        : nativeMin(position < 0 ? 0 : (+position || 0), string.length);
+        : baseClamp(toInteger(position), 0, string.length);
 
-      return string.lastIndexOf(target, position) == position;
+      target = baseToString(target);
+      return string.slice(position, position + target.length) == target;
     }
 
     /**
@@ -18572,7 +19941,7 @@ module.exports = ClipperLib;
      * in "interpolate" delimiters, HTML-escape interpolated data properties in
      * "escape" delimiters, and execute JavaScript in "evaluate" delimiters. Data
      * properties may be accessed as free variables in the template. If a setting
-     * object is provided it takes precedence over `_.templateSettings` values.
+     * object is given, it takes precedence over `_.templateSettings` values.
      *
      * **Note:** In the development build `_.template` utilizes
      * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)
@@ -18585,68 +19954,70 @@ module.exports = ClipperLib;
      * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category String
      * @param {string} [string=''] The template string.
-     * @param {Object} [options] The options object.
-     * @param {RegExp} [options.escape] The HTML "escape" delimiter.
-     * @param {RegExp} [options.evaluate] The "evaluate" delimiter.
-     * @param {Object} [options.imports] An object to import into the template as free variables.
-     * @param {RegExp} [options.interpolate] The "interpolate" delimiter.
-     * @param {string} [options.sourceURL] The sourceURL of the template's compiled source.
-     * @param {string} [options.variable] The data object variable name.
-     * @param- {Object} [otherOptions] Enables the legacy `options` param signature.
+     * @param {Object} [options={}] The options object.
+     * @param {RegExp} [options.escape=_.templateSettings.escape]
+     *  The HTML "escape" delimiter.
+     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]
+     *  The "evaluate" delimiter.
+     * @param {Object} [options.imports=_.templateSettings.imports]
+     *  An object to import into the template as free variables.
+     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]
+     *  The "interpolate" delimiter.
+     * @param {string} [options.sourceURL='lodash.templateSources[n]']
+     *  The sourceURL of the compiled template.
+     * @param {string} [options.variable='obj']
+     *  The data object variable name.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {Function} Returns the compiled template function.
      * @example
      *
-     * // using the "interpolate" delimiter to create a compiled template
+     * // Use the "interpolate" delimiter to create a compiled template.
      * var compiled = _.template('hello <%= user %>!');
      * compiled({ 'user': 'fred' });
      * // => 'hello fred!'
      *
-     * // using the HTML "escape" delimiter to escape data property values
+     * // Use the HTML "escape" delimiter to escape data property values.
      * var compiled = _.template('<b><%- value %></b>');
      * compiled({ 'value': '<script>' });
      * // => '<b>&lt;script&gt;</b>'
      *
-     * // using the "evaluate" delimiter to execute JavaScript and generate HTML
+     * // Use the "evaluate" delimiter to execute JavaScript and generate HTML.
      * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');
      * compiled({ 'users': ['fred', 'barney'] });
      * // => '<li>fred</li><li>barney</li>'
      *
-     * // using the internal `print` function in "evaluate" delimiters
+     * // Use the internal `print` function in "evaluate" delimiters.
      * var compiled = _.template('<% print("hello " + user); %>!');
      * compiled({ 'user': 'barney' });
      * // => 'hello barney!'
      *
-     * // using the ES delimiter as an alternative to the default "interpolate" delimiter
+     * // Use the ES template literal delimiter as an "interpolate" delimiter.
+     * // Disable support by replacing the "interpolate" delimiter.
      * var compiled = _.template('hello ${ user }!');
      * compiled({ 'user': 'pebbles' });
      * // => 'hello pebbles!'
      *
-     * // using custom template delimiters
-     * _.templateSettings.interpolate = /{{([\s\S]+?)}}/g;
-     * var compiled = _.template('hello {{ user }}!');
-     * compiled({ 'user': 'mustache' });
-     * // => 'hello mustache!'
-     *
-     * // using backslashes to treat delimiters as plain text
+     * // Use backslashes to treat delimiters as plain text.
      * var compiled = _.template('<%= "\\<%- value %\\>" %>');
      * compiled({ 'value': 'ignored' });
      * // => '<%- value %>'
      *
-     * // using the `imports` option to import `jQuery` as `jq`
+     * // Use the `imports` option to import `jQuery` as `jq`.
      * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';
      * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });
      * compiled({ 'users': ['fred', 'barney'] });
      * // => '<li>fred</li><li>barney</li>'
      *
-     * // using the `sourceURL` option to specify a custom sourceURL for the template
+     * // Use the `sourceURL` option to specify a custom sourceURL for the template.
      * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });
      * compiled(data);
-     * // => find the source of "greeting.jst" under the Sources tab or Resources panel of the web inspector
+     * // => Find the source of "greeting.jst" under the Sources tab or Resources panel of the web inspector.
      *
-     * // using the `variable` option to ensure a with-statement isn't used in the compiled template
+     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.
      * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });
      * compiled.source;
      * // => function(data) {
@@ -18655,26 +20026,33 @@ module.exports = ClipperLib;
      * //   return __p;
      * // }
      *
-     * // using the `source` property to inline compiled templates for meaningful
-     * // line numbers in error messages and a stack trace
-     * fs.writeFileSync(path.join(cwd, 'jst.js'), '\
+     * // Use custom template delimiters.
+     * _.templateSettings.interpolate = /{{([\s\S]+?)}}/g;
+     * var compiled = _.template('hello {{ user }}!');
+     * compiled({ 'user': 'mustache' });
+     * // => 'hello mustache!'
+     *
+     * // Use the `source` property to inline compiled templates for meaningful
+     * // line numbers in error messages and stack traces.
+     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\
      *   var JST = {\
      *     "main": ' + _.template(mainText).source + '\
      *   };\
      * ');
      */
-    function template(string, options, otherOptions) {
-      // Based on John Resig's `tmpl` implementation (http://ejohn.org/blog/javascript-micro-templating/)
+    function template(string, options, guard) {
+      // Based on John Resig's `tmpl` implementation
+      // (http://ejohn.org/blog/javascript-micro-templating/)
       // and Laura Doktorova's doT.js (https://github.com/olado/doT).
       var settings = lodash.templateSettings;
 
-      if (otherOptions && isIterateeCall(string, options, otherOptions)) {
-        options = otherOptions = undefined;
+      if (guard && isIterateeCall(string, options, guard)) {
+        options = undefined;
       }
-      string = baseToString(string);
-      options = assignWith(baseAssign({}, otherOptions || options), settings, assignOwnDefaults);
+      string = toString(string);
+      options = assignInWith({}, options, settings, customDefaultsAssignIn);
 
-      var imports = assignWith(baseAssign({}, options.imports), settings.imports, assignOwnDefaults),
+      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),
           importsKeys = keys(imports),
           importsValues = baseValues(imports, importsKeys);
 
@@ -18719,8 +20097,8 @@ module.exports = ClipperLib;
         }
         index = offset + match.length;
 
-        // The JS engine embedded in Adobe products requires returning the `match`
-        // string in order to produce the correct `offset` value.
+        // The JS engine embedded in Adobe products needs `match` returned in
+        // order to produce the correct `offset` value.
         return match;
       });
 
@@ -18757,7 +20135,8 @@ module.exports = ClipperLib;
         'return __p\n}';
 
       var result = attempt(function() {
-        return Function(importsKeys, sourceURL + 'return ' + source).apply(undefined, importsValues);
+        return Function(importsKeys, sourceURL + 'return ' + source)
+          .apply(undefined, importsValues);
       });
 
       // Provide the compiled function's source by its `toString` method or
@@ -18769,15 +20148,66 @@ module.exports = ClipperLib;
       return result;
     }
 
+    /**
+     * Converts `string`, as a whole, to lower case just like
+     * [String#toLowerCase](https://mdn.io/toLowerCase).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the lower cased string.
+     * @example
+     *
+     * _.toLower('--Foo-Bar--');
+     * // => '--foo-bar--'
+     *
+     * _.toLower('fooBar');
+     * // => 'foobar'
+     *
+     * _.toLower('__FOO_BAR__');
+     * // => '__foo_bar__'
+     */
+    function toLower(value) {
+      return toString(value).toLowerCase();
+    }
+
+    /**
+     * Converts `string`, as a whole, to upper case just like
+     * [String#toUpperCase](https://mdn.io/toUpperCase).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the upper cased string.
+     * @example
+     *
+     * _.toUpper('--foo-bar--');
+     * // => '--FOO-BAR--'
+     *
+     * _.toUpper('fooBar');
+     * // => 'FOOBAR'
+     *
+     * _.toUpper('__foo_bar__');
+     * // => '__FOO_BAR__'
+     */
+    function toUpper(value) {
+      return toString(value).toUpperCase();
+    }
+
     /**
      * Removes leading and trailing whitespace or specified characters from `string`.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
      * @param {string} [string=''] The string to trim.
      * @param {string} [chars=whitespace] The characters to trim.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {string} Returns the trimmed string.
      * @example
      *
@@ -18791,76 +20221,85 @@ module.exports = ClipperLib;
      * // => ['foo', 'bar']
      */
     function trim(string, chars, guard) {
-      var value = string;
-      string = baseToString(string);
-      if (!string) {
-        return string;
+      string = toString(string);
+      if (string && (guard || chars === undefined)) {
+        return string.replace(reTrim, '');
       }
-      if (guard ? isIterateeCall(value, chars, guard) : chars == null) {
-        return string.slice(trimmedLeftIndex(string), trimmedRightIndex(string) + 1);
+      if (!string || !(chars = baseToString(chars))) {
+        return string;
       }
-      chars = (chars + '');
-      return string.slice(charsLeftIndex(string, chars), charsRightIndex(string, chars) + 1);
+      var strSymbols = stringToArray(string),
+          chrSymbols = stringToArray(chars),
+          start = charsStartIndex(strSymbols, chrSymbols),
+          end = charsEndIndex(strSymbols, chrSymbols) + 1;
+
+      return castSlice(strSymbols, start, end).join('');
     }
 
     /**
-     * Removes leading whitespace or specified characters from `string`.
+     * Removes trailing whitespace or specified characters from `string`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category String
      * @param {string} [string=''] The string to trim.
      * @param {string} [chars=whitespace] The characters to trim.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {string} Returns the trimmed string.
      * @example
      *
-     * _.trimLeft('  abc  ');
-     * // => 'abc  '
+     * _.trimEnd('  abc  ');
+     * // => '  abc'
      *
-     * _.trimLeft('-_-abc-_-', '_-');
-     * // => 'abc-_-'
+     * _.trimEnd('-_-abc-_-', '_-');
+     * // => '-_-abc'
      */
-    function trimLeft(string, chars, guard) {
-      var value = string;
-      string = baseToString(string);
-      if (!string) {
-        return string;
+    function trimEnd(string, chars, guard) {
+      string = toString(string);
+      if (string && (guard || chars === undefined)) {
+        return string.replace(reTrimEnd, '');
       }
-      if (guard ? isIterateeCall(value, chars, guard) : chars == null) {
-        return string.slice(trimmedLeftIndex(string));
+      if (!string || !(chars = baseToString(chars))) {
+        return string;
       }
-      return string.slice(charsLeftIndex(string, (chars + '')));
+      var strSymbols = stringToArray(string),
+          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;
+
+      return castSlice(strSymbols, 0, end).join('');
     }
 
     /**
-     * Removes trailing whitespace or specified characters from `string`.
+     * Removes leading whitespace or specified characters from `string`.
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category String
      * @param {string} [string=''] The string to trim.
      * @param {string} [chars=whitespace] The characters to trim.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {string} Returns the trimmed string.
      * @example
      *
-     * _.trimRight('  abc  ');
-     * // => '  abc'
+     * _.trimStart('  abc  ');
+     * // => 'abc  '
      *
-     * _.trimRight('-_-abc-_-', '_-');
-     * // => '-_-abc'
+     * _.trimStart('-_-abc-_-', '_-');
+     * // => 'abc-_-'
      */
-    function trimRight(string, chars, guard) {
-      var value = string;
-      string = baseToString(string);
-      if (!string) {
-        return string;
+    function trimStart(string, chars, guard) {
+      string = toString(string);
+      if (string && (guard || chars === undefined)) {
+        return string.replace(reTrimStart, '');
       }
-      if (guard ? isIterateeCall(value, chars, guard) : chars == null) {
-        return string.slice(0, trimmedRightIndex(string) + 1);
+      if (!string || !(chars = baseToString(chars))) {
+        return string;
       }
-      return string.slice(0, charsRightIndex(string, (chars + '')) + 1);
+      var strSymbols = stringToArray(string),
+          start = charsStartIndex(strSymbols, stringToArray(chars));
+
+      return castSlice(strSymbols, start).join('');
     }
 
     /**
@@ -18870,83 +20309,84 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
+     * @since 4.0.0
      * @category String
      * @param {string} [string=''] The string to truncate.
-     * @param {Object|number} [options] The options object or maximum string length.
+     * @param {Object} [options={}] The options object.
      * @param {number} [options.length=30] The maximum string length.
      * @param {string} [options.omission='...'] The string to indicate text is omitted.
      * @param {RegExp|string} [options.separator] The separator pattern to truncate to.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
      * @returns {string} Returns the truncated string.
      * @example
      *
-     * _.trunc('hi-diddly-ho there, neighborino');
+     * _.truncate('hi-diddly-ho there, neighborino');
      * // => 'hi-diddly-ho there, neighbo...'
      *
-     * _.trunc('hi-diddly-ho there, neighborino', 24);
-     * // => 'hi-diddly-ho there, n...'
-     *
-     * _.trunc('hi-diddly-ho there, neighborino', {
+     * _.truncate('hi-diddly-ho there, neighborino', {
      *   'length': 24,
      *   'separator': ' '
      * });
      * // => 'hi-diddly-ho there,...'
      *
-     * _.trunc('hi-diddly-ho there, neighborino', {
+     * _.truncate('hi-diddly-ho there, neighborino', {
      *   'length': 24,
      *   'separator': /,? +/
      * });
      * // => 'hi-diddly-ho there...'
      *
-     * _.trunc('hi-diddly-ho there, neighborino', {
+     * _.truncate('hi-diddly-ho there, neighborino', {
      *   'omission': ' [...]'
      * });
      * // => 'hi-diddly-ho there, neig [...]'
      */
-    function trunc(string, options, guard) {
-      if (guard && isIterateeCall(string, options, guard)) {
-        options = undefined;
-      }
+    function truncate(string, options) {
       var length = DEFAULT_TRUNC_LENGTH,
           omission = DEFAULT_TRUNC_OMISSION;
 
-      if (options != null) {
-        if (isObject(options)) {
-          var separator = 'separator' in options ? options.separator : separator;
-          length = 'length' in options ? (+options.length || 0) : length;
-          omission = 'omission' in options ? baseToString(options.omission) : omission;
-        } else {
-          length = +options || 0;
-        }
+      if (isObject(options)) {
+        var separator = 'separator' in options ? options.separator : separator;
+        length = 'length' in options ? toInteger(options.length) : length;
+        omission = 'omission' in options ? baseToString(options.omission) : omission;
+      }
+      string = toString(string);
+
+      var strLength = string.length;
+      if (hasUnicode(string)) {
+        var strSymbols = stringToArray(string);
+        strLength = strSymbols.length;
       }
-      string = baseToString(string);
-      if (length >= string.length) {
+      if (length >= strLength) {
         return string;
       }
-      var end = length - omission.length;
+      var end = length - stringSize(omission);
       if (end < 1) {
         return omission;
       }
-      var result = string.slice(0, end);
-      if (separator == null) {
+      var result = strSymbols
+        ? castSlice(strSymbols, 0, end).join('')
+        : string.slice(0, end);
+
+      if (separator === undefined) {
         return result + omission;
       }
+      if (strSymbols) {
+        end += (result.length - end);
+      }
       if (isRegExp(separator)) {
         if (string.slice(end).search(separator)) {
           var match,
-              newEnd,
-              substring = string.slice(0, end);
+              substring = result;
 
           if (!separator.global) {
-            separator = RegExp(separator.source, (reFlags.exec(separator) || '') + 'g');
+            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');
           }
           separator.lastIndex = 0;
           while ((match = separator.exec(substring))) {
-            newEnd = match.index;
+            var newEnd = match.index;
           }
-          result = result.slice(0, newEnd == null ? end : newEnd);
+          result = result.slice(0, newEnd === undefined ? end : newEnd);
         }
-      } else if (string.indexOf(separator, end) != end) {
+      } else if (string.indexOf(baseToString(separator), end) != end) {
         var index = result.lastIndexOf(separator);
         if (index > -1) {
           result = result.slice(0, index);
@@ -18957,14 +20397,15 @@ module.exports = ClipperLib;
 
     /**
      * The inverse of `_.escape`; this method converts the HTML entities
-     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, `&#39;`, and `&#96;` in `string` to their
-     * corresponding characters.
+     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to
+     * their corresponding characters.
      *
-     * **Note:** No other HTML entities are unescaped. To unescape additional HTML
-     * entities use a third-party library like [_he_](https://mths.be/he).
+     * **Note:** No other HTML entities are unescaped. To unescape additional
+     * HTML entities use a third-party library like [_he_](https://mths.be/he).
      *
      * @static
      * @memberOf _
+     * @since 0.6.0
      * @category String
      * @param {string} [string=''] The string to unescape.
      * @returns {string} Returns the unescaped string.
@@ -18974,21 +20415,65 @@ module.exports = ClipperLib;
      * // => 'fred, barney, & pebbles'
      */
     function unescape(string) {
-      string = baseToString(string);
+      string = toString(string);
       return (string && reHasEscapedHtml.test(string))
         ? string.replace(reEscapedHtml, unescapeHtmlChar)
         : string;
     }
 
+    /**
+     * Converts `string`, as space separated words, to upper case.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the upper cased string.
+     * @example
+     *
+     * _.upperCase('--foo-bar');
+     * // => 'FOO BAR'
+     *
+     * _.upperCase('fooBar');
+     * // => 'FOO BAR'
+     *
+     * _.upperCase('__foo_bar__');
+     * // => 'FOO BAR'
+     */
+    var upperCase = createCompounder(function(result, word, index) {
+      return result + (index ? ' ' : '') + word.toUpperCase();
+    });
+
+    /**
+     * Converts the first character of `string` to upper case.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the converted string.
+     * @example
+     *
+     * _.upperFirst('fred');
+     * // => 'Fred'
+     *
+     * _.upperFirst('FRED');
+     * // => 'FRED'
+     */
+    var upperFirst = createCaseFirst('toUpperCase');
+
     /**
      * Splits `string` into an array of its words.
      *
      * @static
      * @memberOf _
+     * @since 3.0.0
      * @category String
      * @param {string} [string=''] The string to inspect.
      * @param {RegExp|string} [pattern] The pattern to match words.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
      * @returns {Array} Returns the words of `string`.
      * @example
      *
@@ -18999,27 +20484,31 @@ module.exports = ClipperLib;
      * // => ['fred', 'barney', '&', 'pebbles']
      */
     function words(string, pattern, guard) {
-      if (guard && isIterateeCall(string, pattern, guard)) {
-        pattern = undefined;
+      string = toString(string);
+      pattern = guard ? undefined : pattern;
+
+      if (pattern === undefined) {
+        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);
       }
-      string = baseToString(string);
-      return string.match(pattern || reWords) || [];
+      return string.match(pattern) || [];
     }
 
     /*------------------------------------------------------------------------*/
 
     /**
      * Attempts to invoke `func`, returning either the result or the caught error
-     * object. Any additional arguments are provided to `func` when it is invoked.
+     * object. Any additional arguments are provided to `func` when it's invoked.
      *
      * @static
      * @memberOf _
-     * @category Utility
+     * @since 3.0.0
+     * @category Util
      * @param {Function} func The function to attempt.
+     * @param {...*} [args] The arguments to invoke `func` with.
      * @returns {*} Returns the `func` result or error object.
      * @example
      *
-     * // avoid throwing errors for invalid selectors
+     * // Avoid throwing errors for invalid selectors.
      * var elements = _.attempt(function(selector) {
      *   return document.querySelectorAll(selector);
      * }, '>_>');
@@ -19028,117 +20517,256 @@ module.exports = ClipperLib;
      *   elements = [];
      * }
      */
-    var attempt = restParam(function(func, args) {
+    var attempt = baseRest(function(func, args) {
       try {
-        return func.apply(undefined, args);
-      } catch(e) {
+        return apply(func, undefined, args);
+      } catch (e) {
         return isError(e) ? e : new Error(e);
       }
     });
 
     /**
-     * Creates a function that invokes `func` with the `this` binding of `thisArg`
-     * and arguments of the created function. If `func` is a property name the
-     * created callback returns the property value for a given element. If `func`
-     * is an object the created callback returns `true` for elements that contain
-     * the equivalent object properties, otherwise it returns `false`.
+     * Binds methods of an object to the object itself, overwriting the existing
+     * method.
+     *
+     * **Note:** This method doesn't set the "length" property of bound functions.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @alias iteratee
-     * @category Utility
-     * @param {*} [func=_.identity] The value to convert to a callback.
-     * @param {*} [thisArg] The `this` binding of `func`.
-     * @param- {Object} [guard] Enables use as a callback for functions like `_.map`.
-     * @returns {Function} Returns the callback.
+     * @category Util
+     * @param {Object} object The object to bind and assign the bound methods to.
+     * @param {...(string|string[])} methodNames The object method names to bind.
+     * @returns {Object} Returns `object`.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36 },
-     *   { 'user': 'fred',   'age': 40 }
-     * ];
-     *
-     * // wrap to create custom callback shorthands
-     * _.callback = _.wrap(_.callback, function(callback, func, thisArg) {
-     *   var match = /^(.+?)__([gl]t)(.+)$/.exec(func);
-     *   if (!match) {
-     *     return callback(func, thisArg);
+     * var view = {
+     *   'label': 'docs',
+     *   'click': function() {
+     *     console.log('clicked ' + this.label);
      *   }
-     *   return function(object) {
-     *     return match[2] == 'gt'
-     *       ? object[match[1]] > match[3]
-     *       : object[match[1]] < match[3];
-     *   };
-     * });
+     * };
      *
-     * _.filter(users, 'age__gt36');
-     * // => [{ 'user': 'fred', 'age': 40 }]
+     * _.bindAll(view, ['click']);
+     * jQuery(element).on('click', view.click);
+     * // => Logs 'clicked docs' when clicked.
      */
-    function callback(func, thisArg, guard) {
-      if (guard && isIterateeCall(func, thisArg, guard)) {
-        thisArg = undefined;
-      }
-      return isObjectLike(func)
-        ? matches(func)
-        : baseCallback(func, thisArg);
-    }
+    var bindAll = flatRest(function(object, methodNames) {
+      arrayEach(methodNames, function(key) {
+        key = toKey(key);
+        baseAssignValue(object, key, bind(object[key], object));
+      });
+      return object;
+    });
 
     /**
-     * Creates a function that returns `value`.
+     * Creates a function that iterates over `pairs` and invokes the corresponding
+     * function of the first predicate to return truthy. The predicate-function
+     * pairs are invoked with the `this` binding and arguments of the created
+     * function.
      *
      * @static
      * @memberOf _
-     * @category Utility
-     * @param {*} value The value to return from the new function.
-     * @returns {Function} Returns the new function.
+     * @since 4.0.0
+     * @category Util
+     * @param {Array} pairs The predicate-function pairs.
+     * @returns {Function} Returns the new composite function.
      * @example
      *
-     * var object = { 'user': 'fred' };
-     * var getter = _.constant(object);
+     * var func = _.cond([
+     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],
+     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],
+     *   [_.stubTrue,                      _.constant('no match')]
+     * ]);
      *
-     * getter() === object;
-     * // => true
+     * func({ 'a': 1, 'b': 2 });
+     * // => 'matches A'
+     *
+     * func({ 'a': 0, 'b': 1 });
+     * // => 'matches B'
+     *
+     * func({ 'a': '1', 'b': '2' });
+     * // => 'no match'
      */
-    function constant(value) {
-      return function() {
-        return value;
-      };
+    function cond(pairs) {
+      var length = pairs == null ? 0 : pairs.length,
+          toIteratee = getIteratee();
+
+      pairs = !length ? [] : arrayMap(pairs, function(pair) {
+        if (typeof pair[1] != 'function') {
+          throw new TypeError(FUNC_ERROR_TEXT);
+        }
+        return [toIteratee(pair[0]), pair[1]];
+      });
+
+      return baseRest(function(args) {
+        var index = -1;
+        while (++index < length) {
+          var pair = pairs[index];
+          if (apply(pair[0], this, args)) {
+            return apply(pair[1], this, args);
+          }
+        }
+      });
     }
 
     /**
-     * This method returns the first argument provided to it.
+     * Creates a function that invokes the predicate properties of `source` with
+     * the corresponding property values of a given object, returning `true` if
+     * all predicates return truthy, else `false`.
+     *
+     * **Note:** The created function is equivalent to `_.conformsTo` with
+     * `source` partially applied.
      *
      * @static
      * @memberOf _
-     * @category Utility
-     * @param {*} value Any value.
-     * @returns {*} Returns `value`.
+     * @since 4.0.0
+     * @category Util
+     * @param {Object} source The object of property predicates to conform to.
+     * @returns {Function} Returns the new spec function.
      * @example
      *
-     * var object = { 'user': 'fred' };
+     * var objects = [
+     *   { 'a': 2, 'b': 1 },
+     *   { 'a': 1, 'b': 2 }
+     * ];
      *
-     * _.identity(object) === object;
-     * // => true
+     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));
+     * // => [{ 'a': 1, 'b': 2 }]
      */
-    function identity(value) {
-      return value;
+    function conforms(source) {
+      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));
     }
 
     /**
-     * Creates a function that performs a deep comparison between a given object
-     * and `source`, returning `true` if the given object has equivalent property
-     * values, else `false`.
-     *
-     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
-     * numbers, `Object` objects, regexes, and strings. Objects are compared by
-     * their own, not inherited, enumerable properties. For comparing a single
-     * own or inherited property value see `_.matchesProperty`.
+     * Creates a function that returns `value`.
      *
      * @static
      * @memberOf _
-     * @category Utility
-     * @param {Object} source The object of property values to match.
-     * @returns {Function} Returns the new function.
+     * @since 2.4.0
+     * @category Util
+     * @param {*} value The value to return from the new function.
+     * @returns {Function} Returns the new constant function.
+     * @example
+     *
+     * var objects = _.times(2, _.constant({ 'a': 1 }));
+     *
+     * console.log(objects);
+     * // => [{ 'a': 1 }, { 'a': 1 }]
+     *
+     * console.log(objects[0] === objects[1]);
+     * // => true
+     */
+    function constant(value) {
+      return function() {
+        return value;
+      };
+    }
+
+    /**
+     * Checks `value` to determine whether a default value should be returned in
+     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,
+     * or `undefined`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.14.0
+     * @category Util
+     * @param {*} value The value to check.
+     * @param {*} defaultValue The default value.
+     * @returns {*} Returns the resolved value.
+     * @example
+     *
+     * _.defaultTo(1, 10);
+     * // => 1
+     *
+     * _.defaultTo(undefined, 10);
+     * // => 10
+     */
+    function defaultTo(value, defaultValue) {
+      return (value == null || value !== value) ? defaultValue : value;
+    }
+
+    /**
+     * Creates a function that returns the result of invoking the given functions
+     * with the `this` binding of the created function, where each successive
+     * invocation is supplied the return value of the previous.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Util
+     * @param {...(Function|Function[])} [funcs] The functions to invoke.
+     * @returns {Function} Returns the new composite function.
+     * @see _.flowRight
+     * @example
+     *
+     * function square(n) {
+     *   return n * n;
+     * }
+     *
+     * var addSquare = _.flow([_.add, square]);
+     * addSquare(1, 2);
+     * // => 9
+     */
+    var flow = createFlow();
+
+    /**
+     * This method is like `_.flow` except that it creates a function that
+     * invokes the given functions from right to left.
+     *
+     * @static
+     * @since 3.0.0
+     * @memberOf _
+     * @category Util
+     * @param {...(Function|Function[])} [funcs] The functions to invoke.
+     * @returns {Function} Returns the new composite function.
+     * @see _.flow
+     * @example
+     *
+     * function square(n) {
+     *   return n * n;
+     * }
+     *
+     * var addSquare = _.flowRight([square, _.add]);
+     * addSquare(1, 2);
+     * // => 9
+     */
+    var flowRight = createFlow(true);
+
+    /**
+     * This method returns the first argument it receives.
+     *
+     * @static
+     * @since 0.1.0
+     * @memberOf _
+     * @category Util
+     * @param {*} value Any value.
+     * @returns {*} Returns `value`.
+     * @example
+     *
+     * var object = { 'a': 1 };
+     *
+     * console.log(_.identity(object) === object);
+     * // => true
+     */
+    function identity(value) {
+      return value;
+    }
+
+    /**
+     * Creates a function that invokes `func` with the arguments of the created
+     * function. If `func` is a property name, the created function returns the
+     * property value for a given element. If `func` is an array or object, the
+     * created function returns `true` for elements that contain the equivalent
+     * source properties, otherwise it returns `false`.
+     *
+     * @static
+     * @since 4.0.0
+     * @memberOf _
+     * @category Util
+     * @param {*} [func=_.identity] The value to convert to a callback.
+     * @returns {Function} Returns the callback.
      * @example
      *
      * var users = [
@@ -19146,81 +20774,136 @@ module.exports = ClipperLib;
      *   { 'user': 'fred',   'age': 40, 'active': false }
      * ];
      *
-     * _.filter(users, _.matches({ 'age': 40, 'active': false }));
-     * // => [{ 'user': 'fred', 'age': 40, 'active': false }]
+     * // The `_.matches` iteratee shorthand.
+     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));
+     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.filter(users, _.iteratee(['user', 'fred']));
+     * // => [{ 'user': 'fred', 'age': 40 }]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.map(users, _.iteratee('user'));
+     * // => ['barney', 'fred']
+     *
+     * // Create custom iteratee shorthands.
+     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {
+     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {
+     *     return func.test(string);
+     *   };
+     * });
+     *
+     * _.filter(['abc', 'def'], /ef/);
+     * // => ['def']
+     */
+    function iteratee(func) {
+      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));
+    }
+
+    /**
+     * Creates a function that performs a partial deep comparison between a given
+     * object and `source`, returning `true` if the given object has equivalent
+     * property values, else `false`.
+     *
+     * **Note:** The created function is equivalent to `_.isMatch` with `source`
+     * partially applied.
+     *
+     * Partial comparisons will match empty array and empty object `source`
+     * values against any array or object value, respectively. See `_.isEqual`
+     * for a list of supported value comparisons.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Util
+     * @param {Object} source The object of property values to match.
+     * @returns {Function} Returns the new spec function.
+     * @example
+     *
+     * var objects = [
+     *   { 'a': 1, 'b': 2, 'c': 3 },
+     *   { 'a': 4, 'b': 5, 'c': 6 }
+     * ];
+     *
+     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));
+     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]
      */
     function matches(source) {
-      return baseMatches(baseClone(source, true));
+      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));
     }
 
     /**
-     * Creates a function that compares the property value of `path` on a given
-     * object to `value`.
+     * Creates a function that performs a partial deep comparison between the
+     * value at `path` of a given object to `srcValue`, returning `true` if the
+     * object value is equivalent, else `false`.
      *
-     * **Note:** This method supports comparing arrays, booleans, `Date` objects,
-     * numbers, `Object` objects, regexes, and strings. Objects are compared by
-     * their own, not inherited, enumerable properties.
+     * **Note:** Partial comparisons will match empty array and empty object
+     * `srcValue` values against any array or object value, respectively. See
+     * `_.isEqual` for a list of supported value comparisons.
      *
      * @static
      * @memberOf _
-     * @category Utility
+     * @since 3.2.0
+     * @category Util
      * @param {Array|string} path The path of the property to get.
      * @param {*} srcValue The value to match.
-     * @returns {Function} Returns the new function.
+     * @returns {Function} Returns the new spec function.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney' },
-     *   { 'user': 'fred' }
+     * var objects = [
+     *   { 'a': 1, 'b': 2, 'c': 3 },
+     *   { 'a': 4, 'b': 5, 'c': 6 }
      * ];
      *
-     * _.find(users, _.matchesProperty('user', 'fred'));
-     * // => { 'user': 'fred' }
+     * _.find(objects, _.matchesProperty('a', 4));
+     * // => { 'a': 4, 'b': 5, 'c': 6 }
      */
     function matchesProperty(path, srcValue) {
-      return baseMatchesProperty(path, baseClone(srcValue, true));
+      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));
     }
 
     /**
-     * Creates a function that invokes the method at `path` on a given object.
+     * Creates a function that invokes the method at `path` of a given object.
      * Any additional arguments are provided to the invoked method.
      *
      * @static
      * @memberOf _
-     * @category Utility
+     * @since 3.7.0
+     * @category Util
      * @param {Array|string} path The path of the method to invoke.
      * @param {...*} [args] The arguments to invoke the method with.
-     * @returns {Function} Returns the new function.
+     * @returns {Function} Returns the new invoker function.
      * @example
      *
      * var objects = [
-     *   { 'a': { 'b': { 'c': _.constant(2) } } },
-     *   { 'a': { 'b': { 'c': _.constant(1) } } }
+     *   { 'a': { 'b': _.constant(2) } },
+     *   { 'a': { 'b': _.constant(1) } }
      * ];
      *
-     * _.map(objects, _.method('a.b.c'));
+     * _.map(objects, _.method('a.b'));
      * // => [2, 1]
      *
-     * _.invoke(_.sortBy(objects, _.method(['a', 'b', 'c'])), 'a.b.c');
-     * // => [1, 2]
+     * _.map(objects, _.method(['a', 'b']));
+     * // => [2, 1]
      */
-    var method = restParam(function(path, args) {
+    var method = baseRest(function(path, args) {
       return function(object) {
-        return invokePath(object, path, args);
+        return baseInvoke(object, path, args);
       };
     });
 
     /**
      * The opposite of `_.method`; this method creates a function that invokes
-     * the method at a given path on `object`. Any additional arguments are
+     * the method at a given path of `object`. Any additional arguments are
      * provided to the invoked method.
      *
      * @static
      * @memberOf _
-     * @category Utility
+     * @since 3.7.0
+     * @category Util
      * @param {Object} object The object to query.
      * @param {...*} [args] The arguments to invoke the method with.
-     * @returns {Function} Returns the new function.
+     * @returns {Function} Returns the new invoker function.
      * @example
      *
      * var array = _.times(3, _.constant),
@@ -19232,28 +20915,28 @@ module.exports = ClipperLib;
      * _.map([['a', '2'], ['c', '0']], _.methodOf(object));
      * // => [2, 0]
      */
-    var methodOf = restParam(function(object, args) {
+    var methodOf = baseRest(function(object, args) {
       return function(path) {
-        return invokePath(object, path, args);
+        return baseInvoke(object, path, args);
       };
     });
 
     /**
-     * Adds all own enumerable function properties of a source object to the
-     * destination object. If `object` is a function then methods are added to
-     * its prototype as well.
+     * Adds all own enumerable string keyed function properties of a source
+     * object to the destination object. If `object` is a function, then methods
+     * are added to its prototype as well.
      *
      * **Note:** Use `_.runInContext` to create a pristine `lodash` function to
      * avoid conflicts caused by modifying the original.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @category Utility
+     * @category Util
      * @param {Function|Object} [object=lodash] The destination object.
      * @param {Object} source The object of functions to add.
-     * @param {Object} [options] The options object.
-     * @param {boolean} [options.chain=true] Specify whether the functions added
-     *  are chainable.
+     * @param {Object} [options={}] The options object.
+     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.
      * @returns {Function|Object} Returns `object`.
      * @example
      *
@@ -19275,53 +20958,38 @@ module.exports = ClipperLib;
      * // => ['e']
      */
     function mixin(object, source, options) {
-      if (options == null) {
-        var isObj = isObject(source),
-            props = isObj ? keys(source) : undefined,
-            methodNames = (props && props.length) ? baseFunctions(source, props) : undefined;
-
-        if (!(methodNames ? methodNames.length : isObj)) {
-          methodNames = false;
-          options = source;
-          source = object;
-          object = this;
-        }
-      }
-      if (!methodNames) {
+      var props = keys(source),
+          methodNames = baseFunctions(source, props);
+
+      if (options == null &&
+          !(isObject(source) && (methodNames.length || !props.length))) {
+        options = source;
+        source = object;
+        object = this;
         methodNames = baseFunctions(source, keys(source));
       }
-      var chain = true,
-          index = -1,
-          isFunc = isFunction(object),
-          length = methodNames.length;
-
-      if (options === false) {
-        chain = false;
-      } else if (isObject(options) && 'chain' in options) {
-        chain = options.chain;
-      }
-      while (++index < length) {
-        var methodName = methodNames[index],
-            func = source[methodName];
+      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,
+          isFunc = isFunction(object);
 
+      arrayEach(methodNames, function(methodName) {
+        var func = source[methodName];
         object[methodName] = func;
         if (isFunc) {
-          object.prototype[methodName] = (function(func) {
-            return function() {
-              var chainAll = this.__chain__;
-              if (chain || chainAll) {
-                var result = object(this.__wrapped__),
-                    actions = result.__actions__ = arrayCopy(this.__actions__);
-
-                actions.push({ 'func': func, 'args': arguments, 'thisArg': object });
-                result.__chain__ = chainAll;
-                return result;
-              }
-              return func.apply(object, arrayPush([this.value()], arguments));
-            };
-          }(func));
+          object.prototype[methodName] = function() {
+            var chainAll = this.__chain__;
+            if (chain || chainAll) {
+              var result = object(this.__wrapped__),
+                  actions = result.__actions__ = copyArray(this.__actions__);
+
+              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });
+              result.__chain__ = chainAll;
+              return result;
+            }
+            return func.apply(object, arrayPush([this.value()], arguments));
+          };
         }
-      }
+      });
+
       return object;
     }
 
@@ -19330,71 +20998,172 @@ module.exports = ClipperLib;
      * the `lodash` function.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @category Utility
+     * @category Util
      * @returns {Function} Returns the `lodash` function.
      * @example
      *
      * var lodash = _.noConflict();
      */
     function noConflict() {
-      root._ = oldDash;
+      if (root._ === this) {
+        root._ = oldDash;
+      }
       return this;
     }
 
     /**
-     * A no-operation function that returns `undefined` regardless of the
-     * arguments it receives.
+     * This method returns `undefined`.
      *
      * @static
      * @memberOf _
-     * @category Utility
+     * @since 2.3.0
+     * @category Util
      * @example
      *
-     * var object = { 'user': 'fred' };
-     *
-     * _.noop(object) === undefined;
-     * // => true
+     * _.times(2, _.noop);
+     * // => [undefined, undefined]
      */
     function noop() {
       // No operation performed.
     }
 
     /**
-     * Creates a function that returns the property value at `path` on a
-     * given object.
+     * Creates a function that gets the argument at index `n`. If `n` is negative,
+     * the nth argument from the end is returned.
      *
      * @static
      * @memberOf _
-     * @category Utility
-     * @param {Array|string} path The path of the property to get.
+     * @since 4.0.0
+     * @category Util
+     * @param {number} [n=0] The index of the argument to return.
+     * @returns {Function} Returns the new pass-thru function.
+     * @example
+     *
+     * var func = _.nthArg(1);
+     * func('a', 'b', 'c', 'd');
+     * // => 'b'
+     *
+     * var func = _.nthArg(-2);
+     * func('a', 'b', 'c', 'd');
+     * // => 'c'
+     */
+    function nthArg(n) {
+      n = toInteger(n);
+      return baseRest(function(args) {
+        return baseNth(args, n);
+      });
+    }
+
+    /**
+     * Creates a function that invokes `iteratees` with the arguments it receives
+     * and returns their results.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Util
+     * @param {...(Function|Function[])} [iteratees=[_.identity]]
+     *  The iteratees to invoke.
+     * @returns {Function} Returns the new function.
+     * @example
+     *
+     * var func = _.over([Math.max, Math.min]);
+     *
+     * func(1, 2, 3, 4);
+     * // => [4, 1]
+     */
+    var over = createOver(arrayMap);
+
+    /**
+     * Creates a function that checks if **all** of the `predicates` return
+     * truthy when invoked with the arguments it receives.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Util
+     * @param {...(Function|Function[])} [predicates=[_.identity]]
+     *  The predicates to check.
+     * @returns {Function} Returns the new function.
+     * @example
+     *
+     * var func = _.overEvery([Boolean, isFinite]);
+     *
+     * func('1');
+     * // => true
+     *
+     * func(null);
+     * // => false
+     *
+     * func(NaN);
+     * // => false
+     */
+    var overEvery = createOver(arrayEvery);
+
+    /**
+     * Creates a function that checks if **any** of the `predicates` return
+     * truthy when invoked with the arguments it receives.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Util
+     * @param {...(Function|Function[])} [predicates=[_.identity]]
+     *  The predicates to check.
      * @returns {Function} Returns the new function.
      * @example
      *
+     * var func = _.overSome([Boolean, isFinite]);
+     *
+     * func('1');
+     * // => true
+     *
+     * func(null);
+     * // => true
+     *
+     * func(NaN);
+     * // => false
+     */
+    var overSome = createOver(arraySome);
+
+    /**
+     * Creates a function that returns the value at `path` of a given object.
+     *
+     * @static
+     * @memberOf _
+     * @since 2.4.0
+     * @category Util
+     * @param {Array|string} path The path of the property to get.
+     * @returns {Function} Returns the new accessor function.
+     * @example
+     *
      * var objects = [
-     *   { 'a': { 'b': { 'c': 2 } } },
-     *   { 'a': { 'b': { 'c': 1 } } }
+     *   { 'a': { 'b': 2 } },
+     *   { 'a': { 'b': 1 } }
      * ];
      *
-     * _.map(objects, _.property('a.b.c'));
+     * _.map(objects, _.property('a.b'));
      * // => [2, 1]
      *
-     * _.pluck(_.sortBy(objects, _.property(['a', 'b', 'c'])), 'a.b.c');
+     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');
      * // => [1, 2]
      */
     function property(path) {
-      return isKey(path) ? baseProperty(path) : basePropertyDeep(path);
+      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);
     }
 
     /**
      * The opposite of `_.property`; this method creates a function that returns
-     * the property value at a given path on `object`.
+     * the value at a given path of `object`.
      *
      * @static
      * @memberOf _
-     * @category Utility
+     * @since 3.0.0
+     * @category Util
      * @param {Object} object The object to query.
-     * @returns {Function} Returns the new function.
+     * @returns {Function} Returns the new accessor function.
      * @example
      *
      * var array = [0, 1, 2],
@@ -19408,28 +21177,36 @@ module.exports = ClipperLib;
      */
     function propertyOf(object) {
       return function(path) {
-        return baseGet(object, toPath(path), path + '');
+        return object == null ? undefined : baseGet(object, path);
       };
     }
 
     /**
      * Creates an array of numbers (positive and/or negative) progressing from
-     * `start` up to, but not including, `end`. If `end` is not specified it is
-     * set to `start` with `start` then set to `0`. If `end` is less than `start`
-     * a zero-length range is created unless a negative `step` is specified.
+     * `start` up to, but not including, `end`. A step of `-1` is used if a negative
+     * `start` is specified without an `end` or `step`. If `end` is not specified,
+     * it's set to `start` with `start` then set to `0`.
+     *
+     * **Note:** JavaScript follows the IEEE-754 standard for resolving
+     * floating-point values which can produce unexpected results.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @category Utility
+     * @category Util
      * @param {number} [start=0] The start of the range.
      * @param {number} end The end of the range.
      * @param {number} [step=1] The value to increment or decrement by.
-     * @returns {Array} Returns the new array of numbers.
+     * @returns {Array} Returns the range of numbers.
+     * @see _.inRange, _.rangeRight
      * @example
      *
      * _.range(4);
      * // => [0, 1, 2, 3]
      *
+     * _.range(-4);
+     * // => [0, -1, -2, -3]
+     *
      * _.range(1, 5);
      * // => [1, 2, 3, 4]
      *
@@ -19445,156 +21222,300 @@ module.exports = ClipperLib;
      * _.range(0);
      * // => []
      */
-    function range(start, end, step) {
-      if (step && isIterateeCall(start, end, step)) {
-        end = step = undefined;
-      }
-      start = +start || 0;
-      step = step == null ? 1 : (+step || 0);
-
-      if (end == null) {
-        end = start;
-        start = 0;
-      } else {
-        end = +end || 0;
-      }
-      // Use `Array(length)` so engines like Chakra and V8 avoid slower modes.
-      // See https://youtu.be/XAqIpGU8ZZk#t=17m25s for more details.
-      var index = -1,
-          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),
-          result = Array(length);
-
-      while (++index < length) {
-        result[index] = start;
-        start += step;
-      }
-      return result;
-    }
+    var range = createRange();
 
     /**
-     * Invokes the iteratee function `n` times, returning an array of the results
-     * of each invocation. The `iteratee` is bound to `thisArg` and invoked with
-     * one argument; (index).
+     * This method is like `_.range` except that it populates values in
+     * descending order.
      *
      * @static
      * @memberOf _
-     * @category Utility
-     * @param {number} n The number of times to invoke `iteratee`.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
-     * @returns {Array} Returns the array of results.
+     * @since 4.0.0
+     * @category Util
+     * @param {number} [start=0] The start of the range.
+     * @param {number} end The end of the range.
+     * @param {number} [step=1] The value to increment or decrement by.
+     * @returns {Array} Returns the range of numbers.
+     * @see _.inRange, _.range
      * @example
      *
-     * var diceRolls = _.times(3, _.partial(_.random, 1, 6, false));
-     * // => [3, 6, 4]
+     * _.rangeRight(4);
+     * // => [3, 2, 1, 0]
      *
-     * _.times(3, function(n) {
-     *   mage.castSpell(n);
-     * });
-     * // => invokes `mage.castSpell(n)` three times with `n` of `0`, `1`, and `2`
+     * _.rangeRight(-4);
+     * // => [-3, -2, -1, 0]
+     *
+     * _.rangeRight(1, 5);
+     * // => [4, 3, 2, 1]
+     *
+     * _.rangeRight(0, 20, 5);
+     * // => [15, 10, 5, 0]
      *
-     * _.times(3, function(n) {
-     *   this.cast(n);
-     * }, mage);
-     * // => also invokes `mage.castSpell(n)` three times
+     * _.rangeRight(0, -4, -1);
+     * // => [-3, -2, -1, 0]
+     *
+     * _.rangeRight(1, 4, 0);
+     * // => [1, 1, 1]
+     *
+     * _.rangeRight(0);
+     * // => []
      */
-    function times(n, iteratee, thisArg) {
-      n = nativeFloor(n);
-
-      // Exit early to avoid a JSC JIT bug in Safari 8
-      // where `Array(0)` is treated as `Array(1)`.
-      if (n < 1 || !nativeIsFinite(n)) {
-        return [];
-      }
-      var index = -1,
-          result = Array(nativeMin(n, MAX_ARRAY_LENGTH));
-
-      iteratee = bindCallback(iteratee, thisArg, 1);
-      while (++index < n) {
-        if (index < MAX_ARRAY_LENGTH) {
-          result[index] = iteratee(index);
-        } else {
-          iteratee(index);
-        }
-      }
-      return result;
-    }
+    var rangeRight = createRange(true);
 
     /**
-     * Generates a unique ID. If `prefix` is provided the ID is appended to it.
+     * This method returns a new empty array.
      *
      * @static
      * @memberOf _
-     * @category Utility
-     * @param {string} [prefix] The value to prefix the ID with.
-     * @returns {string} Returns the unique ID.
+     * @since 4.13.0
+     * @category Util
+     * @returns {Array} Returns the new empty array.
      * @example
      *
-     * _.uniqueId('contact_');
-     * // => 'contact_104'
+     * var arrays = _.times(2, _.stubArray);
      *
-     * _.uniqueId();
-     * // => '105'
+     * console.log(arrays);
+     * // => [[], []]
+     *
+     * console.log(arrays[0] === arrays[1]);
+     * // => false
      */
-    function uniqueId(prefix) {
-      var id = ++idCounter;
-      return baseToString(prefix) + id;
+    function stubArray() {
+      return [];
     }
 
-    /*------------------------------------------------------------------------*/
-
     /**
-     * Adds two numbers.
+     * This method returns `false`.
      *
      * @static
      * @memberOf _
-     * @category Math
-     * @param {number} augend The first number to add.
-     * @param {number} addend The second number to add.
-     * @returns {number} Returns the sum.
+     * @since 4.13.0
+     * @category Util
+     * @returns {boolean} Returns `false`.
      * @example
      *
-     * _.add(6, 4);
-     * // => 10
+     * _.times(2, _.stubFalse);
+     * // => [false, false]
      */
-    function add(augend, addend) {
-      return (+augend || 0) + (+addend || 0);
+    function stubFalse() {
+      return false;
     }
 
     /**
-     * Calculates `n` rounded up to `precision`.
+     * This method returns a new empty object.
      *
      * @static
      * @memberOf _
-     * @category Math
-     * @param {number} n The number to round up.
-     * @param {number} [precision=0] The precision to round up to.
-     * @returns {number} Returns the rounded up number.
+     * @since 4.13.0
+     * @category Util
+     * @returns {Object} Returns the new empty object.
      * @example
      *
-     * _.ceil(4.006);
-     * // => 5
+     * var objects = _.times(2, _.stubObject);
      *
-     * _.ceil(6.004, 2);
-     * // => 6.01
+     * console.log(objects);
+     * // => [{}, {}]
      *
-     * _.ceil(6040, -2);
-     * // => 6100
+     * console.log(objects[0] === objects[1]);
+     * // => false
      */
-    var ceil = createRound('ceil');
+    function stubObject() {
+      return {};
+    }
 
     /**
-     * Calculates `n` rounded down to `precision`.
+     * This method returns an empty string.
      *
      * @static
      * @memberOf _
-     * @category Math
-     * @param {number} n The number to round down.
-     * @param {number} [precision=0] The precision to round down to.
-     * @returns {number} Returns the rounded down number.
+     * @since 4.13.0
+     * @category Util
+     * @returns {string} Returns the empty string.
      * @example
      *
-     * _.floor(4.006);
+     * _.times(2, _.stubString);
+     * // => ['', '']
+     */
+    function stubString() {
+      return '';
+    }
+
+    /**
+     * This method returns `true`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.13.0
+     * @category Util
+     * @returns {boolean} Returns `true`.
+     * @example
+     *
+     * _.times(2, _.stubTrue);
+     * // => [true, true]
+     */
+    function stubTrue() {
+      return true;
+    }
+
+    /**
+     * Invokes the iteratee `n` times, returning an array of the results of
+     * each invocation. The iteratee is invoked with one argument; (index).
+     *
+     * @static
+     * @since 0.1.0
+     * @memberOf _
+     * @category Util
+     * @param {number} n The number of times to invoke `iteratee`.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the array of results.
+     * @example
+     *
+     * _.times(3, String);
+     * // => ['0', '1', '2']
+     *
+     *  _.times(4, _.constant(0));
+     * // => [0, 0, 0, 0]
+     */
+    function times(n, iteratee) {
+      n = toInteger(n);
+      if (n < 1 || n > MAX_SAFE_INTEGER) {
+        return [];
+      }
+      var index = MAX_ARRAY_LENGTH,
+          length = nativeMin(n, MAX_ARRAY_LENGTH);
+
+      iteratee = getIteratee(iteratee);
+      n -= MAX_ARRAY_LENGTH;
+
+      var result = baseTimes(length, iteratee);
+      while (++index < n) {
+        iteratee(index);
+      }
+      return result;
+    }
+
+    /**
+     * Converts `value` to a property path array.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Util
+     * @param {*} value The value to convert.
+     * @returns {Array} Returns the new property path array.
+     * @example
+     *
+     * _.toPath('a.b.c');
+     * // => ['a', 'b', 'c']
+     *
+     * _.toPath('a[0].b.c');
+     * // => ['a', '0', 'b', 'c']
+     */
+    function toPath(value) {
+      if (isArray(value)) {
+        return arrayMap(value, toKey);
+      }
+      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));
+    }
+
+    /**
+     * Generates a unique ID. If `prefix` is given, the ID is appended to it.
+     *
+     * @static
+     * @since 0.1.0
+     * @memberOf _
+     * @category Util
+     * @param {string} [prefix=''] The value to prefix the ID with.
+     * @returns {string} Returns the unique ID.
+     * @example
+     *
+     * _.uniqueId('contact_');
+     * // => 'contact_104'
+     *
+     * _.uniqueId();
+     * // => '105'
+     */
+    function uniqueId(prefix) {
+      var id = ++idCounter;
+      return toString(prefix) + id;
+    }
+
+    /*------------------------------------------------------------------------*/
+
+    /**
+     * Adds two numbers.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.4.0
+     * @category Math
+     * @param {number} augend The first number in an addition.
+     * @param {number} addend The second number in an addition.
+     * @returns {number} Returns the total.
+     * @example
+     *
+     * _.add(6, 4);
+     * // => 10
+     */
+    var add = createMathOperation(function(augend, addend) {
+      return augend + addend;
+    }, 0);
+
+    /**
+     * Computes `number` rounded up to `precision`.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.10.0
+     * @category Math
+     * @param {number} number The number to round up.
+     * @param {number} [precision=0] The precision to round up to.
+     * @returns {number} Returns the rounded up number.
+     * @example
+     *
+     * _.ceil(4.006);
+     * // => 5
+     *
+     * _.ceil(6.004, 2);
+     * // => 6.01
+     *
+     * _.ceil(6040, -2);
+     * // => 6100
+     */
+    var ceil = createRound('ceil');
+
+    /**
+     * Divide two numbers.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.7.0
+     * @category Math
+     * @param {number} dividend The first number in a division.
+     * @param {number} divisor The second number in a division.
+     * @returns {number} Returns the quotient.
+     * @example
+     *
+     * _.divide(6, 4);
+     * // => 1.5
+     */
+    var divide = createMathOperation(function(dividend, divisor) {
+      return dividend / divisor;
+    }, 1);
+
+    /**
+     * Computes `number` rounded down to `precision`.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.10.0
+     * @category Math
+     * @param {number} number The number to round down.
+     * @param {number} [precision=0] The precision to round down to.
+     * @returns {number} Returns the rounded down number.
+     * @example
+     *
+     * _.floor(4.006);
      * // => 4
      *
      * _.floor(0.046, 2);
@@ -19606,29 +21527,14 @@ module.exports = ClipperLib;
     var floor = createRound('floor');
 
     /**
-     * Gets the maximum value of `collection`. If `collection` is empty or falsey
-     * `-Infinity` is returned. If an iteratee function is provided it is invoked
-     * for each value in `collection` to generate the criterion by which the value
-     * is ranked. The `iteratee` is bound to `thisArg` and invoked with three
-     * arguments: (value, index, collection).
-     *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
-     *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
-     *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * Computes the maximum value of `array`. If `array` is empty or falsey,
+     * `undefined` is returned.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category Math
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [iteratee] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Array} array The array to iterate over.
      * @returns {*} Returns the maximum value.
      * @example
      *
@@ -19636,48 +21542,97 @@ module.exports = ClipperLib;
      * // => 8
      *
      * _.max([]);
-     * // => -Infinity
+     * // => undefined
+     */
+    function max(array) {
+      return (array && array.length)
+        ? baseExtremum(array, identity, baseGt)
+        : undefined;
+    }
+
+    /**
+     * This method is like `_.max` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the criterion by which
+     * the value is ranked. The iteratee is invoked with one argument: (value).
      *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36 },
-     *   { 'user': 'fred',   'age': 40 }
-     * ];
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {*} Returns the maximum value.
+     * @example
      *
-     * _.max(users, function(chr) {
-     *   return chr.age;
-     * });
-     * // => { 'user': 'fred', 'age': 40 }
+     * var objects = [{ 'n': 1 }, { 'n': 2 }];
+     *
+     * _.maxBy(objects, function(o) { return o.n; });
+     * // => { 'n': 2 }
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.maxBy(objects, 'n');
+     * // => { 'n': 2 }
+     */
+    function maxBy(array, iteratee) {
+      return (array && array.length)
+        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)
+        : undefined;
+    }
+
+    /**
+     * Computes the mean of the values in `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @returns {number} Returns the mean.
+     * @example
      *
-     * // using the `_.property` callback shorthand
-     * _.max(users, 'age');
-     * // => { 'user': 'fred', 'age': 40 }
+     * _.mean([4, 2, 8, 6]);
+     * // => 5
      */
-    var max = createExtremum(gt, NEGATIVE_INFINITY);
+    function mean(array) {
+      return baseMean(array, identity);
+    }
 
     /**
-     * Gets the minimum value of `collection`. If `collection` is empty or falsey
-     * `Infinity` is returned. If an iteratee function is provided it is invoked
-     * for each value in `collection` to generate the criterion by which the value
-     * is ranked. The `iteratee` is bound to `thisArg` and invoked with three
-     * arguments: (value, index, collection).
+     * This method is like `_.mean` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the value to be averaged.
+     * The iteratee is invoked with one argument: (value).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.7.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {number} Returns the mean.
+     * @example
      *
-     * If a property name is provided for `iteratee` the created `_.property`
-     * style callback returns the property value of the given element.
+     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];
      *
-     * If a value is also provided for `thisArg` the created `_.matchesProperty`
-     * style callback returns `true` for elements that have a matching property
-     * value, else `false`.
+     * _.meanBy(objects, function(o) { return o.n; });
+     * // => 5
      *
-     * If an object is provided for `iteratee` the created `_.matches` style
-     * callback returns `true` for elements that have the properties of the given
-     * object, else `false`.
+     * // The `_.property` iteratee shorthand.
+     * _.meanBy(objects, 'n');
+     * // => 5
+     */
+    function meanBy(array, iteratee) {
+      return baseMean(array, getIteratee(iteratee, 2));
+    }
+
+    /**
+     * Computes the minimum value of `array`. If `array` is empty or falsey,
+     * `undefined` is returned.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
      * @category Math
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [iteratee] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Array} array The array to iterate over.
      * @returns {*} Returns the minimum value.
      * @example
      *
@@ -19685,31 +21640,70 @@ module.exports = ClipperLib;
      * // => 2
      *
      * _.min([]);
-     * // => Infinity
+     * // => undefined
+     */
+    function min(array) {
+      return (array && array.length)
+        ? baseExtremum(array, identity, baseLt)
+        : undefined;
+    }
+
+    /**
+     * This method is like `_.min` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the criterion by which
+     * the value is ranked. The iteratee is invoked with one argument: (value).
      *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36 },
-     *   { 'user': 'fred',   'age': 40 }
-     * ];
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {*} Returns the minimum value.
+     * @example
      *
-     * _.min(users, function(chr) {
-     *   return chr.age;
-     * });
-     * // => { 'user': 'barney', 'age': 36 }
+     * var objects = [{ 'n': 1 }, { 'n': 2 }];
      *
-     * // using the `_.property` callback shorthand
-     * _.min(users, 'age');
-     * // => { 'user': 'barney', 'age': 36 }
+     * _.minBy(objects, function(o) { return o.n; });
+     * // => { 'n': 1 }
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.minBy(objects, 'n');
+     * // => { 'n': 1 }
+     */
+    function minBy(array, iteratee) {
+      return (array && array.length)
+        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)
+        : undefined;
+    }
+
+    /**
+     * Multiply two numbers.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.7.0
+     * @category Math
+     * @param {number} multiplier The first number in a multiplication.
+     * @param {number} multiplicand The second number in a multiplication.
+     * @returns {number} Returns the product.
+     * @example
+     *
+     * _.multiply(6, 4);
+     * // => 24
      */
-    var min = createExtremum(lt, POSITIVE_INFINITY);
+    var multiply = createMathOperation(function(multiplier, multiplicand) {
+      return multiplier * multiplicand;
+    }, 1);
 
     /**
-     * Calculates `n` rounded to `precision`.
+     * Computes `number` rounded to `precision`.
      *
      * @static
      * @memberOf _
+     * @since 3.10.0
      * @category Math
-     * @param {number} n The number to round.
+     * @param {number} number The number to round.
      * @param {number} [precision=0] The precision to round to.
      * @returns {number} Returns the rounded number.
      * @example
@@ -19726,83 +21720,94 @@ module.exports = ClipperLib;
     var round = createRound('round');
 
     /**
-     * Gets the sum of the values in `collection`.
+     * Subtract two numbers.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Math
+     * @param {number} minuend The first number in a subtraction.
+     * @param {number} subtrahend The second number in a subtraction.
+     * @returns {number} Returns the difference.
+     * @example
+     *
+     * _.subtract(6, 4);
+     * // => 2
+     */
+    var subtract = createMathOperation(function(minuend, subtrahend) {
+      return minuend - subtrahend;
+    }, 0);
+
+    /**
+     * Computes the sum of the values in `array`.
      *
      * @static
      * @memberOf _
+     * @since 3.4.0
      * @category Math
-     * @param {Array|Object|string} collection The collection to iterate over.
-     * @param {Function|Object|string} [iteratee] The function invoked per iteration.
-     * @param {*} [thisArg] The `this` binding of `iteratee`.
+     * @param {Array} array The array to iterate over.
      * @returns {number} Returns the sum.
      * @example
      *
-     * _.sum([4, 6]);
-     * // => 10
+     * _.sum([4, 2, 8, 6]);
+     * // => 20
+     */
+    function sum(array) {
+      return (array && array.length)
+        ? baseSum(array, identity)
+        : 0;
+    }
+
+    /**
+     * This method is like `_.sum` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the value to be summed.
+     * The iteratee is invoked with one argument: (value).
      *
-     * _.sum({ 'a': 4, 'b': 6 });
-     * // => 10
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {number} Returns the sum.
+     * @example
      *
-     * var objects = [
-     *   { 'n': 4 },
-     *   { 'n': 6 }
-     * ];
+     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];
      *
-     * _.sum(objects, function(object) {
-     *   return object.n;
-     * });
-     * // => 10
+     * _.sumBy(objects, function(o) { return o.n; });
+     * // => 20
      *
-     * // using the `_.property` callback shorthand
-     * _.sum(objects, 'n');
-     * // => 10
+     * // The `_.property` iteratee shorthand.
+     * _.sumBy(objects, 'n');
+     * // => 20
      */
-    function sum(collection, iteratee, thisArg) {
-      if (thisArg && isIterateeCall(collection, iteratee, thisArg)) {
-        iteratee = undefined;
-      }
-      iteratee = getCallback(iteratee, thisArg, 3);
-      return iteratee.length == 1
-        ? arraySum(isArray(collection) ? collection : toIterable(collection), iteratee)
-        : baseSum(collection, iteratee);
+    function sumBy(array, iteratee) {
+      return (array && array.length)
+        ? baseSum(array, getIteratee(iteratee, 2))
+        : 0;
     }
 
     /*------------------------------------------------------------------------*/
 
-    // Ensure wrappers are instances of `baseLodash`.
-    lodash.prototype = baseLodash.prototype;
-
-    LodashWrapper.prototype = baseCreate(baseLodash.prototype);
-    LodashWrapper.prototype.constructor = LodashWrapper;
-
-    LazyWrapper.prototype = baseCreate(baseLodash.prototype);
-    LazyWrapper.prototype.constructor = LazyWrapper;
-
-    // Add functions to the `Map` cache.
-    MapCache.prototype['delete'] = mapDelete;
-    MapCache.prototype.get = mapGet;
-    MapCache.prototype.has = mapHas;
-    MapCache.prototype.set = mapSet;
-
-    // Add functions to the `Set` cache.
-    SetCache.prototype.push = cachePush;
-
-    // Assign cache to `_.memoize`.
-    memoize.Cache = MapCache;
-
-    // Add functions that return wrapped values when chaining.
+    // Add methods that return wrapped values in chain sequences.
     lodash.after = after;
     lodash.ary = ary;
     lodash.assign = assign;
+    lodash.assignIn = assignIn;
+    lodash.assignInWith = assignInWith;
+    lodash.assignWith = assignWith;
     lodash.at = at;
     lodash.before = before;
     lodash.bind = bind;
     lodash.bindAll = bindAll;
     lodash.bindKey = bindKey;
-    lodash.callback = callback;
+    lodash.castArray = castArray;
     lodash.chain = chain;
     lodash.chunk = chunk;
     lodash.compact = compact;
+    lodash.concat = concat;
+    lodash.cond = cond;
+    lodash.conforms = conforms;
     lodash.constant = constant;
     lodash.countBy = countBy;
     lodash.create = create;
@@ -19814,29 +21819,36 @@ module.exports = ClipperLib;
     lodash.defer = defer;
     lodash.delay = delay;
     lodash.difference = difference;
+    lodash.differenceBy = differenceBy;
+    lodash.differenceWith = differenceWith;
     lodash.drop = drop;
     lodash.dropRight = dropRight;
     lodash.dropRightWhile = dropRightWhile;
     lodash.dropWhile = dropWhile;
     lodash.fill = fill;
     lodash.filter = filter;
+    lodash.flatMap = flatMap;
+    lodash.flatMapDeep = flatMapDeep;
+    lodash.flatMapDepth = flatMapDepth;
     lodash.flatten = flatten;
     lodash.flattenDeep = flattenDeep;
+    lodash.flattenDepth = flattenDepth;
+    lodash.flip = flip;
     lodash.flow = flow;
     lodash.flowRight = flowRight;
-    lodash.forEach = forEach;
-    lodash.forEachRight = forEachRight;
-    lodash.forIn = forIn;
-    lodash.forInRight = forInRight;
-    lodash.forOwn = forOwn;
-    lodash.forOwnRight = forOwnRight;
+    lodash.fromPairs = fromPairs;
     lodash.functions = functions;
+    lodash.functionsIn = functionsIn;
     lodash.groupBy = groupBy;
-    lodash.indexBy = indexBy;
     lodash.initial = initial;
     lodash.intersection = intersection;
+    lodash.intersectionBy = intersectionBy;
+    lodash.intersectionWith = intersectionWith;
     lodash.invert = invert;
-    lodash.invoke = invoke;
+    lodash.invertBy = invertBy;
+    lodash.invokeMap = invokeMap;
+    lodash.iteratee = iteratee;
+    lodash.keyBy = keyBy;
     lodash.keys = keys;
     lodash.keysIn = keysIn;
     lodash.map = map;
@@ -19846,36 +21858,50 @@ module.exports = ClipperLib;
     lodash.matchesProperty = matchesProperty;
     lodash.memoize = memoize;
     lodash.merge = merge;
+    lodash.mergeWith = mergeWith;
     lodash.method = method;
     lodash.methodOf = methodOf;
     lodash.mixin = mixin;
-    lodash.modArgs = modArgs;
     lodash.negate = negate;
+    lodash.nthArg = nthArg;
     lodash.omit = omit;
+    lodash.omitBy = omitBy;
     lodash.once = once;
-    lodash.pairs = pairs;
+    lodash.orderBy = orderBy;
+    lodash.over = over;
+    lodash.overArgs = overArgs;
+    lodash.overEvery = overEvery;
+    lodash.overSome = overSome;
     lodash.partial = partial;
     lodash.partialRight = partialRight;
     lodash.partition = partition;
     lodash.pick = pick;
-    lodash.pluck = pluck;
+    lodash.pickBy = pickBy;
     lodash.property = property;
     lodash.propertyOf = propertyOf;
     lodash.pull = pull;
+    lodash.pullAll = pullAll;
+    lodash.pullAllBy = pullAllBy;
+    lodash.pullAllWith = pullAllWith;
     lodash.pullAt = pullAt;
     lodash.range = range;
+    lodash.rangeRight = rangeRight;
     lodash.rearg = rearg;
     lodash.reject = reject;
     lodash.remove = remove;
     lodash.rest = rest;
-    lodash.restParam = restParam;
+    lodash.reverse = reverse;
+    lodash.sampleSize = sampleSize;
     lodash.set = set;
+    lodash.setWith = setWith;
     lodash.shuffle = shuffle;
     lodash.slice = slice;
     lodash.sortBy = sortBy;
-    lodash.sortByAll = sortByAll;
-    lodash.sortByOrder = sortByOrder;
+    lodash.sortedUniq = sortedUniq;
+    lodash.sortedUniqBy = sortedUniqBy;
+    lodash.split = split;
     lodash.spread = spread;
+    lodash.tail = tail;
     lodash.take = take;
     lodash.takeRight = takeRight;
     lodash.takeRightWhile = takeRightWhile;
@@ -19883,53 +21909,65 @@ module.exports = ClipperLib;
     lodash.tap = tap;
     lodash.throttle = throttle;
     lodash.thru = thru;
-    lodash.times = times;
     lodash.toArray = toArray;
+    lodash.toPairs = toPairs;
+    lodash.toPairsIn = toPairsIn;
+    lodash.toPath = toPath;
     lodash.toPlainObject = toPlainObject;
     lodash.transform = transform;
+    lodash.unary = unary;
     lodash.union = union;
+    lodash.unionBy = unionBy;
+    lodash.unionWith = unionWith;
     lodash.uniq = uniq;
+    lodash.uniqBy = uniqBy;
+    lodash.uniqWith = uniqWith;
+    lodash.unset = unset;
     lodash.unzip = unzip;
     lodash.unzipWith = unzipWith;
+    lodash.update = update;
+    lodash.updateWith = updateWith;
     lodash.values = values;
     lodash.valuesIn = valuesIn;
-    lodash.where = where;
     lodash.without = without;
+    lodash.words = words;
     lodash.wrap = wrap;
     lodash.xor = xor;
+    lodash.xorBy = xorBy;
+    lodash.xorWith = xorWith;
     lodash.zip = zip;
     lodash.zipObject = zipObject;
+    lodash.zipObjectDeep = zipObjectDeep;
     lodash.zipWith = zipWith;
 
     // Add aliases.
-    lodash.backflow = flowRight;
-    lodash.collect = map;
-    lodash.compose = flowRight;
-    lodash.each = forEach;
-    lodash.eachRight = forEachRight;
-    lodash.extend = assign;
-    lodash.iteratee = callback;
-    lodash.methods = functions;
-    lodash.object = zipObject;
-    lodash.select = filter;
-    lodash.tail = rest;
-    lodash.unique = uniq;
-
-    // Add functions to `lodash.prototype`.
+    lodash.entries = toPairs;
+    lodash.entriesIn = toPairsIn;
+    lodash.extend = assignIn;
+    lodash.extendWith = assignInWith;
+
+    // Add methods to `lodash.prototype`.
     mixin(lodash, lodash);
 
     /*------------------------------------------------------------------------*/
 
-    // Add functions that return unwrapped values when chaining.
+    // Add methods that return unwrapped values in chain sequences.
     lodash.add = add;
     lodash.attempt = attempt;
     lodash.camelCase = camelCase;
     lodash.capitalize = capitalize;
     lodash.ceil = ceil;
+    lodash.clamp = clamp;
     lodash.clone = clone;
     lodash.cloneDeep = cloneDeep;
+    lodash.cloneDeepWith = cloneDeepWith;
+    lodash.cloneWith = cloneWith;
+    lodash.conformsTo = conformsTo;
     lodash.deburr = deburr;
+    lodash.defaultTo = defaultTo;
+    lodash.divide = divide;
     lodash.endsWith = endsWith;
+    lodash.eq = eq;
     lodash.escape = escape;
     lodash.escapeRegExp = escapeRegExp;
     lodash.every = every;
@@ -19939,111 +21977,145 @@ module.exports = ClipperLib;
     lodash.findLast = findLast;
     lodash.findLastIndex = findLastIndex;
     lodash.findLastKey = findLastKey;
-    lodash.findWhere = findWhere;
-    lodash.first = first;
     lodash.floor = floor;
+    lodash.forEach = forEach;
+    lodash.forEachRight = forEachRight;
+    lodash.forIn = forIn;
+    lodash.forInRight = forInRight;
+    lodash.forOwn = forOwn;
+    lodash.forOwnRight = forOwnRight;
     lodash.get = get;
     lodash.gt = gt;
     lodash.gte = gte;
     lodash.has = has;
+    lodash.hasIn = hasIn;
+    lodash.head = head;
     lodash.identity = identity;
     lodash.includes = includes;
     lodash.indexOf = indexOf;
     lodash.inRange = inRange;
+    lodash.invoke = invoke;
     lodash.isArguments = isArguments;
     lodash.isArray = isArray;
+    lodash.isArrayBuffer = isArrayBuffer;
+    lodash.isArrayLike = isArrayLike;
+    lodash.isArrayLikeObject = isArrayLikeObject;
     lodash.isBoolean = isBoolean;
+    lodash.isBuffer = isBuffer;
     lodash.isDate = isDate;
     lodash.isElement = isElement;
     lodash.isEmpty = isEmpty;
     lodash.isEqual = isEqual;
+    lodash.isEqualWith = isEqualWith;
     lodash.isError = isError;
     lodash.isFinite = isFinite;
     lodash.isFunction = isFunction;
+    lodash.isInteger = isInteger;
+    lodash.isLength = isLength;
+    lodash.isMap = isMap;
     lodash.isMatch = isMatch;
+    lodash.isMatchWith = isMatchWith;
     lodash.isNaN = isNaN;
     lodash.isNative = isNative;
+    lodash.isNil = isNil;
     lodash.isNull = isNull;
     lodash.isNumber = isNumber;
     lodash.isObject = isObject;
+    lodash.isObjectLike = isObjectLike;
     lodash.isPlainObject = isPlainObject;
     lodash.isRegExp = isRegExp;
+    lodash.isSafeInteger = isSafeInteger;
+    lodash.isSet = isSet;
     lodash.isString = isString;
+    lodash.isSymbol = isSymbol;
     lodash.isTypedArray = isTypedArray;
     lodash.isUndefined = isUndefined;
+    lodash.isWeakMap = isWeakMap;
+    lodash.isWeakSet = isWeakSet;
+    lodash.join = join;
     lodash.kebabCase = kebabCase;
     lodash.last = last;
     lodash.lastIndexOf = lastIndexOf;
+    lodash.lowerCase = lowerCase;
+    lodash.lowerFirst = lowerFirst;
     lodash.lt = lt;
     lodash.lte = lte;
     lodash.max = max;
+    lodash.maxBy = maxBy;
+    lodash.mean = mean;
+    lodash.meanBy = meanBy;
     lodash.min = min;
+    lodash.minBy = minBy;
+    lodash.stubArray = stubArray;
+    lodash.stubFalse = stubFalse;
+    lodash.stubObject = stubObject;
+    lodash.stubString = stubString;
+    lodash.stubTrue = stubTrue;
+    lodash.multiply = multiply;
+    lodash.nth = nth;
     lodash.noConflict = noConflict;
     lodash.noop = noop;
     lodash.now = now;
     lodash.pad = pad;
-    lodash.padLeft = padLeft;
-    lodash.padRight = padRight;
+    lodash.padEnd = padEnd;
+    lodash.padStart = padStart;
     lodash.parseInt = parseInt;
     lodash.random = random;
     lodash.reduce = reduce;
     lodash.reduceRight = reduceRight;
     lodash.repeat = repeat;
+    lodash.replace = replace;
     lodash.result = result;
     lodash.round = round;
     lodash.runInContext = runInContext;
+    lodash.sample = sample;
     lodash.size = size;
     lodash.snakeCase = snakeCase;
     lodash.some = some;
     lodash.sortedIndex = sortedIndex;
+    lodash.sortedIndexBy = sortedIndexBy;
+    lodash.sortedIndexOf = sortedIndexOf;
     lodash.sortedLastIndex = sortedLastIndex;
+    lodash.sortedLastIndexBy = sortedLastIndexBy;
+    lodash.sortedLastIndexOf = sortedLastIndexOf;
     lodash.startCase = startCase;
     lodash.startsWith = startsWith;
+    lodash.subtract = subtract;
     lodash.sum = sum;
+    lodash.sumBy = sumBy;
     lodash.template = template;
+    lodash.times = times;
+    lodash.toFinite = toFinite;
+    lodash.toInteger = toInteger;
+    lodash.toLength = toLength;
+    lodash.toLower = toLower;
+    lodash.toNumber = toNumber;
+    lodash.toSafeInteger = toSafeInteger;
+    lodash.toString = toString;
+    lodash.toUpper = toUpper;
     lodash.trim = trim;
-    lodash.trimLeft = trimLeft;
-    lodash.trimRight = trimRight;
-    lodash.trunc = trunc;
+    lodash.trimEnd = trimEnd;
+    lodash.trimStart = trimStart;
+    lodash.truncate = truncate;
     lodash.unescape = unescape;
     lodash.uniqueId = uniqueId;
-    lodash.words = words;
+    lodash.upperCase = upperCase;
+    lodash.upperFirst = upperFirst;
 
     // Add aliases.
-    lodash.all = every;
-    lodash.any = some;
-    lodash.contains = includes;
-    lodash.eq = isEqual;
-    lodash.detect = find;
-    lodash.foldl = reduce;
-    lodash.foldr = reduceRight;
-    lodash.head = first;
-    lodash.include = includes;
-    lodash.inject = reduce;
+    lodash.each = forEach;
+    lodash.eachRight = forEachRight;
+    lodash.first = head;
 
     mixin(lodash, (function() {
       var source = {};
       baseForOwn(lodash, function(func, methodName) {
-        if (!lodash.prototype[methodName]) {
+        if (!hasOwnProperty.call(lodash.prototype, methodName)) {
           source[methodName] = func;
         }
       });
       return source;
-    }()), false);
-
-    /*------------------------------------------------------------------------*/
-
-    // Add functions capable of returning wrapped and unwrapped values when chaining.
-    lodash.sample = sample;
-
-    lodash.prototype.sample = function(n) {
-      if (!this.__chain__ && n == null) {
-        return sample(this.value());
-      }
-      return this.thru(function(value) {
-        return sample(value, n);
-      });
-    };
+    }()), { 'chain': false });
 
     /*------------------------------------------------------------------------*/
 
@@ -20052,7 +22124,7 @@ module.exports = ClipperLib;
      *
      * @static
      * @memberOf _
-     * @type string
+     * @type {string}
      */
     lodash.VERSION = VERSION;
 
@@ -20064,17 +22136,19 @@ module.exports = ClipperLib;
     // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.
     arrayEach(['drop', 'take'], function(methodName, index) {
       LazyWrapper.prototype[methodName] = function(n) {
-        var filtered = this.__filtered__;
-        if (filtered && !index) {
-          return new LazyWrapper(this);
-        }
-        n = n == null ? 1 : nativeMax(nativeFloor(n) || 0, 0);
+        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);
 
-        var result = this.clone();
-        if (filtered) {
-          result.__takeCount__ = nativeMin(result.__takeCount__, n);
+        var result = (this.__filtered__ && !index)
+          ? new LazyWrapper(this)
+          : this.clone();
+
+        if (result.__filtered__) {
+          result.__takeCount__ = nativeMin(n, result.__takeCount__);
         } else {
-          result.__views__.push({ 'size': n, 'type': methodName + (result.__dir__ < 0 ? 'Right' : '') });
+          result.__views__.push({
+            'size': nativeMin(n, MAX_ARRAY_LENGTH),
+            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')
+          });
         }
         return result;
       };
@@ -20087,18 +22161,21 @@ module.exports = ClipperLib;
     // Add `LazyWrapper` methods that accept an `iteratee` value.
     arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {
       var type = index + 1,
-          isFilter = type != LAZY_MAP_FLAG;
+          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;
 
-      LazyWrapper.prototype[methodName] = function(iteratee, thisArg) {
+      LazyWrapper.prototype[methodName] = function(iteratee) {
         var result = this.clone();
-        result.__iteratees__.push({ 'iteratee': getCallback(iteratee, thisArg, 1), 'type': type });
+        result.__iteratees__.push({
+          'iteratee': getIteratee(iteratee, 3),
+          'type': type
+        });
         result.__filtered__ = result.__filtered__ || isFilter;
         return result;
       };
     });
 
-    // Add `LazyWrapper` methods for `_.first` and `_.last`.
-    arrayEach(['first', 'last'], function(methodName, index) {
+    // Add `LazyWrapper` methods for `_.head` and `_.last`.
+    arrayEach(['head', 'last'], function(methodName, index) {
       var takeName = 'take' + (index ? 'Right' : '');
 
       LazyWrapper.prototype[methodName] = function() {
@@ -20106,8 +22183,8 @@ module.exports = ClipperLib;
       };
     });
 
-    // Add `LazyWrapper` methods for `_.initial` and `_.rest`.
-    arrayEach(['initial', 'rest'], function(methodName, index) {
+    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.
+    arrayEach(['initial', 'tail'], function(methodName, index) {
       var dropName = 'drop' + (index ? '' : 'Right');
 
       LazyWrapper.prototype[methodName] = function() {
@@ -20115,29 +22192,33 @@ module.exports = ClipperLib;
       };
     });
 
-    // Add `LazyWrapper` methods for `_.pluck` and `_.where`.
-    arrayEach(['pluck', 'where'], function(methodName, index) {
-      var operationName = index ? 'filter' : 'map',
-          createCallback = index ? baseMatches : property;
-
-      LazyWrapper.prototype[methodName] = function(value) {
-        return this[operationName](createCallback(value));
-      };
-    });
-
     LazyWrapper.prototype.compact = function() {
       return this.filter(identity);
     };
 
-    LazyWrapper.prototype.reject = function(predicate, thisArg) {
-      predicate = getCallback(predicate, thisArg, 1);
-      return this.filter(function(value) {
-        return !predicate(value);
+    LazyWrapper.prototype.find = function(predicate) {
+      return this.filter(predicate).head();
+    };
+
+    LazyWrapper.prototype.findLast = function(predicate) {
+      return this.reverse().find(predicate);
+    };
+
+    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {
+      if (typeof path == 'function') {
+        return new LazyWrapper(this);
+      }
+      return this.map(function(value) {
+        return baseInvoke(value, path, args);
       });
+    });
+
+    LazyWrapper.prototype.reject = function(predicate) {
+      return this.filter(negate(getIteratee(predicate)));
     };
 
     LazyWrapper.prototype.slice = function(start, end) {
-      start = start == null ? 0 : (+start || 0);
+      start = toInteger(start);
 
       var result = this;
       if (result.__filtered__ && (start > 0 || end < 0)) {
@@ -20149,133 +22230,133 @@ module.exports = ClipperLib;
         result = result.drop(start);
       }
       if (end !== undefined) {
-        end = (+end || 0);
+        end = toInteger(end);
         result = end < 0 ? result.dropRight(-end) : result.take(end - start);
       }
       return result;
     };
 
-    LazyWrapper.prototype.takeRightWhile = function(predicate, thisArg) {
-      return this.reverse().takeWhile(predicate, thisArg).reverse();
+    LazyWrapper.prototype.takeRightWhile = function(predicate) {
+      return this.reverse().takeWhile(predicate).reverse();
     };
 
     LazyWrapper.prototype.toArray = function() {
-      return this.take(POSITIVE_INFINITY);
+      return this.take(MAX_ARRAY_LENGTH);
     };
 
     // Add `LazyWrapper` methods to `lodash.prototype`.
     baseForOwn(LazyWrapper.prototype, function(func, methodName) {
-      var checkIteratee = /^(?:filter|map|reject)|While$/.test(methodName),
-          retUnwrapped = /^(?:first|last)$/.test(methodName),
-          lodashFunc = lodash[retUnwrapped ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName];
+      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),
+          isTaker = /^(?:head|last)$/.test(methodName),
+          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],
+          retUnwrapped = isTaker || /^find/.test(methodName);
 
       if (!lodashFunc) {
         return;
       }
       lodash.prototype[methodName] = function() {
-        var args = retUnwrapped ? [1] : arguments,
-            chainAll = this.__chain__,
-            value = this.__wrapped__,
-            isHybrid = !!this.__actions__.length,
+        var value = this.__wrapped__,
+            args = isTaker ? [1] : arguments,
             isLazy = value instanceof LazyWrapper,
             iteratee = args[0],
             useLazy = isLazy || isArray(value);
 
+        var interceptor = function(value) {
+          var result = lodashFunc.apply(lodash, arrayPush([value], args));
+          return (isTaker && chainAll) ? result[0] : result;
+        };
+
         if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {
           // Avoid lazy use if the iteratee has a "length" value other than `1`.
           isLazy = useLazy = false;
         }
-        var interceptor = function(value) {
-          return (retUnwrapped && chainAll)
-            ? lodashFunc(value, 1)[0]
-            : lodashFunc.apply(undefined, arrayPush([value], args));
-        };
-
-        var action = { 'func': thru, 'args': [interceptor], 'thisArg': undefined },
+        var chainAll = this.__chain__,
+            isHybrid = !!this.__actions__.length,
+            isUnwrapped = retUnwrapped && !chainAll,
             onlyLazy = isLazy && !isHybrid;
 
-        if (retUnwrapped && !chainAll) {
-          if (onlyLazy) {
-            value = value.clone();
-            value.__actions__.push(action);
-            return func.call(value);
-          }
-          return lodashFunc.call(undefined, this.value())[0];
-        }
         if (!retUnwrapped && useLazy) {
           value = onlyLazy ? value : new LazyWrapper(this);
           var result = func.apply(value, args);
-          result.__actions__.push(action);
+          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });
           return new LodashWrapper(result, chainAll);
         }
-        return this.thru(interceptor);
+        if (isUnwrapped && onlyLazy) {
+          return func.apply(this, args);
+        }
+        result = this.thru(interceptor);
+        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;
       };
     });
 
-    // Add `Array` and `String` methods to `lodash.prototype`.
-    arrayEach(['join', 'pop', 'push', 'replace', 'shift', 'sort', 'splice', 'split', 'unshift'], function(methodName) {
-      var func = (/^(?:replace|split)$/.test(methodName) ? stringProto : arrayProto)[methodName],
+    // Add `Array` methods to `lodash.prototype`.
+    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {
+      var func = arrayProto[methodName],
           chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',
-          retUnwrapped = /^(?:join|pop|replace|shift)$/.test(methodName);
+          retUnwrapped = /^(?:pop|shift)$/.test(methodName);
 
       lodash.prototype[methodName] = function() {
         var args = arguments;
         if (retUnwrapped && !this.__chain__) {
-          return func.apply(this.value(), args);
+          var value = this.value();
+          return func.apply(isArray(value) ? value : [], args);
         }
         return this[chainName](function(value) {
-          return func.apply(value, args);
+          return func.apply(isArray(value) ? value : [], args);
         });
       };
     });
 
-    // Map minified function names to their real names.
+    // Map minified method names to their real names.
     baseForOwn(LazyWrapper.prototype, function(func, methodName) {
       var lodashFunc = lodash[methodName];
       if (lodashFunc) {
-        var key = lodashFunc.name,
+        var key = (lodashFunc.name + ''),
             names = realNames[key] || (realNames[key] = []);
 
         names.push({ 'name': methodName, 'func': lodashFunc });
       }
     });
 
-    realNames[createHybridWrapper(undefined, BIND_KEY_FLAG).name] = [{ 'name': 'wrapper', 'func': undefined }];
+    realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{
+      'name': 'wrapper',
+      'func': undefined
+    }];
 
-    // Add functions to the lazy wrapper.
+    // Add methods to `LazyWrapper`.
     LazyWrapper.prototype.clone = lazyClone;
     LazyWrapper.prototype.reverse = lazyReverse;
     LazyWrapper.prototype.value = lazyValue;
 
-    // Add chaining functions to the `lodash` wrapper.
+    // Add chain sequence methods to the `lodash` wrapper.
+    lodash.prototype.at = wrapperAt;
     lodash.prototype.chain = wrapperChain;
     lodash.prototype.commit = wrapperCommit;
-    lodash.prototype.concat = wrapperConcat;
+    lodash.prototype.next = wrapperNext;
     lodash.prototype.plant = wrapperPlant;
     lodash.prototype.reverse = wrapperReverse;
-    lodash.prototype.toString = wrapperToString;
-    lodash.prototype.run = lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;
+    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;
 
-    // Add function aliases to the `lodash` wrapper.
-    lodash.prototype.collect = lodash.prototype.map;
-    lodash.prototype.head = lodash.prototype.first;
-    lodash.prototype.select = lodash.prototype.filter;
-    lodash.prototype.tail = lodash.prototype.rest;
+    // Add lazy aliases.
+    lodash.prototype.first = lodash.prototype.head;
 
+    if (symIterator) {
+      lodash.prototype[symIterator] = wrapperToIterator;
+    }
     return lodash;
-  }
+  });
 
   /*--------------------------------------------------------------------------*/
 
   // Export lodash.
   var _ = runInContext();
 
-  // Some AMD build optimizers like r.js check for condition patterns like the following:
+  // Some AMD build optimizers, like r.js, check for condition patterns like:
   if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {
-    // Expose lodash to the global object when an AMD loader is present to avoid
-    // errors in cases where lodash is loaded by a script tag and not intended
-    // as an AMD module. See http://requirejs.org/docs/errors.html#mismatch for
-    // more details.
+    // Expose Lodash on the global object to prevent errors when Lodash is
+    // loaded by a script tag in the presence of an AMD loader.
+    // See http://requirejs.org/docs/errors.html#mismatch for more details.
+    // Use `_.noConflict` to remove Lodash from the global object.
     root._ = _;
 
     // Define as an anonymous module so, through path mapping, it can be
@@ -20284,56 +22365,175 @@ module.exports = ClipperLib;
       return _;
     });
   }
-  // Check for `exports` after `define` in case a build optimizer adds an `exports` object.
-  else if (freeExports && freeModule) {
-    // Export for Node.js or RingoJS.
-    if (moduleExports) {
-      (freeModule.exports = _)._ = _;
-    }
-    // Export for Rhino with CommonJS support.
-    else {
-      freeExports._ = _;
-    }
+  // Check for `exports` after `define` in case a build optimizer adds it.
+  else if (freeModule) {
+    // Export for Node.js.
+    (freeModule.exports = _)._ = _;
+    // Export for CommonJS support.
+    freeExports._ = _;
   }
   else {
-    // Export for a browser or Rhino.
+    // Export to the global object.
     root._ = _;
   }
 }.call(this));
 
 }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
-},{}],4:[function(require,module,exports){
+},{}],3:[function(require,module,exports){
 // shim for using process in browser
-
 var process = module.exports = {};
+
+// cached from whatever global is present so that test runners that stub it
+// don't break things.  But we need to wrap it in a try catch in case it is
+// wrapped in strict mode code which doesn't define any globals.  It's inside a
+// function because try/catches deoptimize in certain engines.
+
+var cachedSetTimeout;
+var cachedClearTimeout;
+
+function defaultSetTimout() {
+    throw new Error('setTimeout has not been defined');
+}
+function defaultClearTimeout () {
+    throw new Error('clearTimeout has not been defined');
+}
+(function () {
+    try {
+        if (typeof setTimeout === 'function') {
+            cachedSetTimeout = setTimeout;
+        } else {
+            cachedSetTimeout = defaultSetTimout;
+        }
+    } catch (e) {
+        cachedSetTimeout = defaultSetTimout;
+    }
+    try {
+        if (typeof clearTimeout === 'function') {
+            cachedClearTimeout = clearTimeout;
+        } else {
+            cachedClearTimeout = defaultClearTimeout;
+        }
+    } catch (e) {
+        cachedClearTimeout = defaultClearTimeout;
+    }
+} ())
+function runTimeout(fun) {
+    if (cachedSetTimeout === setTimeout) {
+        //normal enviroments in sane situations
+        return setTimeout(fun, 0);
+    }
+    // if setTimeout wasn't available but was latter defined
+    if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) {
+        cachedSetTimeout = setTimeout;
+        return setTimeout(fun, 0);
+    }
+    try {
+        // when when somebody has screwed with setTimeout but no I.E. maddness
+        return cachedSetTimeout(fun, 0);
+    } catch(e){
+        try {
+            // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally
+            return cachedSetTimeout.call(null, fun, 0);
+        } catch(e){
+            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error
+            return cachedSetTimeout.call(this, fun, 0);
+        }
+    }
+
+
+}
+function runClearTimeout(marker) {
+    if (cachedClearTimeout === clearTimeout) {
+        //normal enviroments in sane situations
+        return clearTimeout(marker);
+    }
+    // if clearTimeout wasn't available but was latter defined
+    if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) {
+        cachedClearTimeout = clearTimeout;
+        return clearTimeout(marker);
+    }
+    try {
+        // when when somebody has screwed with setTimeout but no I.E. maddness
+        return cachedClearTimeout(marker);
+    } catch (e){
+        try {
+            // When we are in I.E. but the script has been evaled so I.E. doesn't  trust the global object when called normally
+            return cachedClearTimeout.call(null, marker);
+        } catch (e){
+            // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error.
+            // Some versions of I.E. have different rules for clearTimeout vs setTimeout
+            return cachedClearTimeout.call(this, marker);
+        }
+    }
+
+
+
+}
 var queue = [];
 var draining = false;
+var currentQueue;
+var queueIndex = -1;
+
+function cleanUpNextTick() {
+    if (!draining || !currentQueue) {
+        return;
+    }
+    draining = false;
+    if (currentQueue.length) {
+        queue = currentQueue.concat(queue);
+    } else {
+        queueIndex = -1;
+    }
+    if (queue.length) {
+        drainQueue();
+    }
+}
 
 function drainQueue() {
     if (draining) {
         return;
     }
+    var timeout = runTimeout(cleanUpNextTick);
     draining = true;
-    var currentQueue;
+
     var len = queue.length;
     while(len) {
         currentQueue = queue;
         queue = [];
-        var i = -1;
-        while (++i < len) {
-            currentQueue[i]();
+        while (++queueIndex < len) {
+            if (currentQueue) {
+                currentQueue[queueIndex].run();
+            }
         }
+        queueIndex = -1;
         len = queue.length;
     }
+    currentQueue = null;
     draining = false;
+    runClearTimeout(timeout);
 }
+
 process.nextTick = function (fun) {
-    queue.push(fun);
-    if (!draining) {
-        setTimeout(drainQueue, 0);
+    var args = new Array(arguments.length - 1);
+    if (arguments.length > 1) {
+        for (var i = 1; i < arguments.length; i++) {
+            args[i - 1] = arguments[i];
+        }
+    }
+    queue.push(new Item(fun, args));
+    if (queue.length === 1 && !draining) {
+        runTimeout(drainQueue);
     }
 };
 
+// v8 likes predictible objects
+function Item(fun, array) {
+    this.fun = fun;
+    this.array = array;
+}
+Item.prototype.run = function () {
+    this.fun.apply(null, this.array);
+};
 process.title = 'browser';
 process.browser = true;
 process.env = {};
@@ -20355,14 +22555,13 @@ process.binding = function (name) {
     throw new Error('process.binding is not supported');
 };
 
-// TODO(shtylman)
 process.cwd = function () { return '/' };
 process.chdir = function (dir) {
     throw new Error('process.chdir is not supported');
 };
 process.umask = function() { return 0; };
 
-},{}],5:[function(require,module,exports){
+},{}],4:[function(require,module,exports){
 /*
 
 StackBlur - a fast almost Gaussian Blur For Canvas
@@ -20686,7 +22885,7 @@ function BlurStack()
 }
 
 module.exports = blur;
-},{}],6:[function(require,module,exports){
+},{}],5:[function(require,module,exports){
 function DOMParser(options){
 	this.options = options ||{locator:{}};
 	
@@ -20939,7 +23138,7 @@ function appendElement (hander,node) {
 	exports.DOMParser = DOMParser;
 //}
 
-},{"./dom":7,"./sax":8}],7:[function(require,module,exports){
+},{"./dom":6,"./sax":7}],6:[function(require,module,exports){
 /*
  * DOM Level 2
  * Object DOMException
@@ -22185,7 +24384,7 @@ try{
 	exports.XMLSerializer = XMLSerializer;
 //}
 
-},{}],8:[function(require,module,exports){
+},{}],7:[function(require,module,exports){
 //[4]   	NameStartChar	   ::=   	":" | [A-Z] | "_" | [a-z] | [#xC0-#xD6] | [#xD8-#xF6] | [#xF8-#x2FF] | [#x370-#x37D] | [#x37F-#x1FFF] | [#x200C-#x200D] | [#x2070-#x218F] | [#x2C00-#x2FEF] | [#x3001-#xD7FF] | [#xF900-#xFDCF] | [#xFDF0-#xFFFD] | [#x10000-#xEFFFF]
 //[4a]   	NameChar	   ::=   	NameStartChar | "-" | "." | [0-9] | #xB7 | [#x0300-#x036F] | [#x203F-#x2040]
 //[5]   	Name	   ::=   	NameStartChar (NameChar)*
@@ -22820,1469 +25019,2619 @@ function split(source,start){
 exports.XMLReader = XMLReader;
 
 
-},{}],9:[function(require,module,exports){
+},{}],8:[function(require,module,exports){
+'use strict';
+
+var _ = require('lodash');
+var vg = require('./libraries/vg/vg');
+var img = require('./libraries/img/img');
+
+var g = {};
+
+// Commands
+function importCommands(module) {
+    for (var k in module) {
+        g[k] = module[k];
+    }
+}
+
+for (var k in vg) {
+    g[k] = vg[k];
+}
+delete g['delete'];
+
+for (var k in img) {
+    g[k] = img[k];
+}
+
+importCommands(require('./libraries/math'));
+importCommands(require('./libraries/string'));
+importCommands(require('./libraries/list'));
+importCommands(require('./libraries/data'));
+importCommands(require('./libraries/image'));
+importCommands(require('./libraries/graphics'));
+importCommands(require('./libraries/easing'));
+
+g.importSVG = function (svgString) {
+    return g.svg.parseString(svgString);
+};
+
+g.importImage = function (image) {
+    var layer = g.Layer.fromImage(image);
+    return new g.Img(layer.toCanvas());
+};
+
+g.importText = function (string) {
+    return string ? String(string) : '';
+};
+
+g.importCSV = function (csvString, delimiter) {
+    // Split the row, taking quotes into account.
+    function splitRow(s, delimiter) {
+        var row = [], c, col = '', i, inString = false;
+        s = s.trim();
+        for (i = 0; i < s.length; i += 1) {
+            c = s[i];
+            if (c === '"') {
+                if (s[i+1] === '"') {
+                    col += '"';
+                    i += 1;
+                } else {
+                    inString = !inString;
+                }
+            } else if (c === delimiter) {
+                if (!inString) {
+                    row.push(col);
+                    col = '';
+                } else {
+                    col += c;
+                }
+            } else {
+                col += c;
+            }
+        }
+        row.push(col);
+        return row;
+    }
+
+    var rows, header;
+    delimiter = delimiter || ',';
+
+    if (!csvString) return null;
+    rows = csvString.split(/\r\n|\r|\n/g);
+    header = splitRow(rows[0], delimiter);
+    rows = rows.slice(1);
+
+    rows = _.reject(rows, _.isEmpty);
+
+    rows = _.map(rows, function (row) {
+        var cols, m = {};
+        cols = _.map(splitRow(row, delimiter), function (col) {
+            return isNaN(col) ? col : parseFloat(col);
+        });
+        _.each(cols, function (col, index) {
+            m[header[index]] = col;
+        });
+        return m;
+    });
+    return rows;
+};
+
+g.merge = function () {
+    var objects = _.flatten(arguments, true);
+    if (Array.isArray(objects)) {
+        objects = _.reject(objects, _.isEmpty);
+        if (objects.length > 0) {
+            var o = objects[0];
+            if (o && (o.commands || o.shapes || o.fontFamily)) {
+                return vg.merge(objects);
+            } else if (o instanceof img.Img) {
+                return img.merge(objects);
+            }
+        }
+    }
+    return null;
+};
+
+g.mix = function (a, b, t) {
+    t = t !== undefined ? t : 0.5;
+    if (typeof a === 'number') {
+        return (a * (1 - t)) + (b * t);
+    } else if (typeof a === 'object') {
+        var result = {};
+        var keys = Object.keys(a);
+        for (var i = 0, n = keys.length; i < n; i += 1) {
+            var k = keys[i];
+            var va = a[k];
+            var vb = b[k];
+            if (va !== undefined && vb !== undefined) {
+                result[k] = g.mix(va, vb, t);
+            }
+        }
+        return result;
+    } else {
+        return 0;
+    }
+};
+
+module.exports = g;
+
+},{"./libraries/data":9,"./libraries/easing":11,"./libraries/graphics":12,"./libraries/image":13,"./libraries/img/img":17,"./libraries/list":20,"./libraries/math":21,"./libraries/string":22,"./libraries/vg/vg":44,"lodash":2}],9:[function(require,module,exports){
 'use strict';
 
-var _ = require('lodash');
-var vg = require('./libraries/vg/vg');
-var img = require('./libraries/img/img');
+var _ = require('lodash');
+var list = require('./list');
+
+var g = {};
+
+// Convert values from one range to another
+g.convert = function (v, inMin, inMax, outMin, outMax) {
+    var argLength = arguments.length;
+    if (argLength === 2) {
+        var d = arguments[1];
+        inMin = d.inMin;
+        inMax = d.inMax;
+        outMin = d.outMin;
+        outMax = d.outMax;
+    } else if (argLength === 3) {
+        inMin = arguments[1][0];
+        inMax = arguments[1][1];
+        outMin = arguments[2][0];
+        outMax = arguments[2][1];
+    }
+    try {
+        v = (v - inMin) / (inMax - inMin);
+    } catch (e) {
+        v = inMin;
+    }
+    // Convert value to target range.
+    return outMin + v * (outMax - outMin);
+};
+
+g.filterData = function (data, key, op, value) {
+    var i, l, row, obj;
+    if (value === null || value === undefined) {
+        return data;
+    }
+    var results = [];
+    if (op === '==') {
+        for (i = 0, l = data.length; i < l; i++) {
+            row = data[i];
+            obj = row[key];
+            if (obj == value) { // jshint ignore:line
+                results.push(row);
+            }
+        }
+    } else if (op === '!=') {
+        for (i = 0, l = data.length; i < l; i++) {
+            row = data[i];
+            obj = row[key];
+            if (obj != value) { // jshint ignore:line
+                results.push(row);
+            }
+        }
+    } else if (op === '>') {
+        for (i = 0, l = data.length; i < l; i++) {
+            row = data[i];
+            obj = row[key];
+            if (obj > value) {
+                results.push(row);
+            }
+        }
+    } else if (op === '>=') {
+        for (i = 0, l = data.length; i < l; i++) {
+            row = data[i];
+            obj = row[key];
+            if (obj >= value) {
+                results.push(row);
+            }
+        }
+    } else if (op === '<') {
+        for (i = 0, l = data.length; i < l; i++) {
+            row = data[i];
+            obj = row[key];
+            if (obj < value) {
+                results.push(row);
+            }
+        }
+    } else if (op === '<=') {
+        for (i = 0, l = data.length; i < l; i++) {
+            row = data[i];
+            obj = row[key];
+            if (obj <= value) {
+                results.push(row);
+            }
+        }
+    } else {
+        throw new Error('Invalid op ' + op);
+    }
+    return results;
+};
+
+g.groupBy = function (data, key) {
+    return _.values(_.groupBy(data, key));
+};
+
+/* // Draw a legend. ==> rename to axis?
+g.legend = function (scale, position, direction, nTicks) {
+    var ticks = g.ticks(scale, nTicks),
+        group = new vg.Group(),
+        p = new vg.Path(),
+        textOptions = {fontSize: 9, align: 'center'},
+        t,
+        i,
+        v;
+    p.moveTo(scale.outMax, position.y);
+    p.lineTo(scale.outMin, position.y);
+    p.stroke = 'black';
+    group.add(p);
+    for (i = 0; i < ticks.length; i += 1) {
+        v = g.convert(scale, ticks[i]);
+        p.moveTo(v, position.y);
+        p.lineTo(v, position.y + 5);
+        t = new g.Text('' + ticks[i], v, position.y + 15, textOptions);
+        group.add(t);
+    }
+    return group;
+}; */
+
+g.keys = function (data) {
+    var allKeys = [];
+    for (var i = 0; i < data.length; i++) {
+        allKeys = allKeys.concat(_.keys(data[i]));
+    }
+    return list.distinct(allKeys);
+};
+
+g.lookup = function (table, key) {
+    var obj, v;
+    obj = table;
+    // First try to lookup the key as-is.
+    v = obj[key];
+    if (v !== undefined) {
+        if (typeof v === 'function') {
+            v = v.call(obj);
+        }
+        return v;
+    }
+    _.each(key.split('.'), function (token) {
+        if (!obj) return null;
+        if (typeof obj[token] === 'function') {
+            v = obj[token];
+            obj = v.call(obj);
+        } else {
+            obj = obj[token];
+        }
+    });
+    return obj;
+};
+
+// Create a scale that maps values from the input domain to the output range.
+g.dataScale = function (domain, outMin, outMax) {
+    return {domain: domain, outMin: outMin, outMax: outMax};
+};
+
+
+// Generate about n values for the given scale.
+g.ticks = function (min, max, n) {
+    n = n !== undefined ? n : 10;
+
+    var span = max - min,
+        step = Math.pow(10, Math.floor(Math.log(span / n) / Math.LN10)),
+        err = n / span * step,
+        ticks = [],
+        i;
+
+    if (err <= 0.15) {
+        step *= 10;
+    } else if (err <= 0.35) {
+        step *= 5;
+    } else if (err <= 0.75) {
+        step *= 2;
+    }
+
+    min = Math.ceil(min / step) * step;
+    max = Math.floor(max / step) * step + (step * 0.5);
+
+    for (i = min; i < max; i += step) {
+        ticks.push(i);
+    }
+
+    return ticks;
+};
+
+module.exports = g;
+
+},{"./list":20,"lodash":2}],10:[function(require,module,exports){
+/* jshint eqeqeq:false */
+
+'use strict';
+
+// Equality functionality taken from node.js' (http://nodejs.org) assert module:
+// https://github.com/joyent/node/blob/master/lib/assert.js
+
+function isBuffer() {
+    return false;
+}
+
+function isObject(arg) {
+    return typeof arg === 'object' && arg !== null;
+}
+
+function objectToString(o) {
+    return Object.prototype.toString.call(o);
+}
+
+function isRegExp(re) {
+    return isObject(re) && objectToString(re) === '[object RegExp]';
+}
+
+function isDate(d) {
+    return isObject(d) && objectToString(d) === '[object Date]';
+}
+
+function isNullOrUndefined(arg) {
+    return (arg === null || arg === undefined);
+}
+
+var util = {
+    isObject: isObject,
+    isRegExp: isRegExp,
+    isDate: isDate,
+    isNullOrUndefined: isNullOrUndefined,
+    isBuffer: isBuffer
+};
+
+var pSlice = Array.prototype.slice;
+var deepEqual = {};
+
+var isArguments, _deepEqual, objEquiv;
+
+_deepEqual = function (actual, expected) {
+    // 7.1. All identical values are equivalent, as determined by ===.
+    if (actual === expected) {
+        return true;
+    } else if (util.isBuffer(actual) && util.isBuffer(expected)) {
+        if (actual.length !== expected.length) return false;
+
+        for (var i = 0; i < actual.length; i++) {
+            if (actual[i] !== expected[i]) return false;
+        }
+
+        return true;
+
+    // 7.2. If the expected value is a Date object, the actual value is
+    // equivalent if it is also a Date object that refers to the same time.
+    } else if (util.isDate(actual) && util.isDate(expected)) {
+        return actual.getTime() === expected.getTime();
+
+    // 7.3 If the expected value is a RegExp object, the actual value is
+    // equivalent if it is also a RegExp object with the same source and
+    // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).
+    } else if (util.isRegExp(actual) && util.isRegExp(expected)) {
+        return actual.source === expected.source &&
+            actual.global === expected.global &&
+            actual.multiline === expected.multiline &&
+            actual.lastIndex === expected.lastIndex &&
+            actual.ignoreCase === expected.ignoreCase;
+
+    // 7.4. Other pairs that do not both pass typeof value == 'object',
+    // equivalence is determined by ==.
+    } else if (!util.isObject(actual) && !util.isObject(expected)) {
+        return actual == expected;
+
+    // 7.5 For all other Object pairs, including Array objects, equivalence is
+    // determined by having the same number of owned properties (as verified
+    // with Object.prototype.hasOwnProperty.call), the same set of keys
+    // (although not necessarily the same order), equivalent values for every
+    // corresponding key, and an identical 'prototype' property. Note: this
+    // accounts for both named and indexed properties on Arrays.
+    } else {
+        return objEquiv(actual, expected);
+    }
+};
+
+deepEqual.deepEqual = _deepEqual;
+
+isArguments = function (object) {
+    return Object.prototype.toString.call(object) === '[object Arguments]';
+};
+
+objEquiv = function (a, b) {
+    if (util.isNullOrUndefined(a) || util.isNullOrUndefined(b))
+        return false;
+    // an identical 'prototype' property.
+    if (a.prototype !== b.prototype) return false;
+    //~~~I've managed to break Object.keys through screwy arguments passing.
+    //   Converting to array solves the problem.
+    var aIsArgs = isArguments(a),
+        bIsArgs = isArguments(b);
+    if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))
+        return false;
+    if (aIsArgs) {
+        a = pSlice.call(a);
+        b = pSlice.call(b);
+        return _deepEqual(a, b);
+    }
+    var ka, kb, key, i;
+    try {
+        ka = Object.keys(a);
+        kb = Object.keys(b);
+    } catch (e) {//happens when one is a string literal and the other isn't
+        return false;
+    }
+    // having the same number of owned properties (keys incorporates
+    // hasOwnProperty)
+    if (ka.length !== kb.length)
+        return false;
+    //the same set of keys (although not necessarily the same order),
+    ka.sort();
+    kb.sort();
+    //~~~cheap key test
+    for (i = ka.length - 1; i >= 0; i--) {
+        if (ka[i] != kb[i])
+            return false;
+    }
+    //equivalent values for every corresponding key, and
+    //~~~possibly expensive deep test
+    for (i = ka.length - 1; i >= 0; i--) {
+        key = ka[i];
+        if (!_deepEqual(a[key], b[key])) return false;
+    }
+    return true;
+};
+
+module.exports = deepEqual;
+},{}],11:[function(require,module,exports){
+'use strict';
+
+// Easing functions in javascript ported from jQuery Easing Plugin:
+// https://github.com/gdsmith/jquery.easing
+// t: current time, b: beginning value, c: change in value, d: duration
+
+var g = {};
+
+g.easeInQuad = function (t, b, c, d) {
+    return c * (t /= d) * t + b;
+};
+
+g.easeOutQuad = function (t, b, c, d) {
+    return -c * (t /= d) * (t - 2) + b;
+};
+
+g.easeInOutQuad = function (t, b, c, d) {
+    if ((t /= d / 2) < 1) { return c / 2 * t * t + b; }
+    return -c / 2 * ((--t) * (t - 2) - 1) + b;
+};
+
+g.easeInCubic = function (t, b, c, d) {
+    return c * (t /= d) * t * t + b;
+};
+
+g.easeOutCubic = function (t, b, c, d) {
+    return c * ((t = t / d - 1) * t * t + 1) + b;
+};
+
+g.easeInOutCubic = function (t, b, c, d) {
+    if ((t /= d / 2) < 1) { return c / 2 * t * t * t + b; }
+    return c / 2 * ((t -= 2) * t * t + 2) + b;
+};
+
+g.easeInQuart = function (t, b, c, d) {
+    return c * (t /= d) * t * t * t + b;
+};
+
+g.easeOutQuart = function (t, b, c, d) {
+    return -c * ((t = t / d - 1) * t * t * t - 1) + b;
+};
+
+g.easeInOutQuart = function (t, b, c, d) {
+    if ((t /= d / 2) < 1) { return c / 2 * t * t * t * t + b; }
+    return -c / 2 * ((t -= 2) * t * t * t - 2) + b;
+};
+
+g.easeInQuint = function (t, b, c, d) {
+    return c * (t /= d) * t * t * t * t + b;
+};
+
+g.easeOutQuint = function (t, b, c, d) {
+    return c * ((t = t / d - 1) * t * t * t * t + 1) + b;
+};
+
+g.easeInOutQuint = function (t, b, c, d) {
+    if ((t /= d / 2) < 1) { return c / 2 * t * t * t * t * t + b; }
+    return c / 2 * ((t -= 2) * t * t * t * t + 2) + b;
+};
+
+g.easeInSine = function (t, b, c, d) {
+    return -c * Math.cos(t / d * (Math.PI / 2)) + c + b;
+};
+
+g.easeOutSine = function (t, b, c, d) {
+    return c * Math.sin(t / d * (Math.PI / 2)) + b;
+};
+
+g.easeInOutSine = function (t, b, c, d) {
+    return -c / 2 * (Math.cos(Math.PI * t / d) - 1) + b;
+};
+
+g.easeInExpo = function (t, b, c, d) {
+    return (t === 0) ? b : c * Math.pow(2, 10 * (t / d - 1)) + b;
+};
+
+g.easeOutExpo = function (t, b, c, d) {
+    return (t === d) ? b + c : c * (-Math.pow(2, -10 * t / d) + 1) + b;
+};
+
+g.easeInOutExpo = function (t, b, c, d) {
+    if (t === 0) { return b; }
+    if (t === d) { return b + c; }
+    if ((t /= d / 2) < 1) { return c / 2 * Math.pow(2, 10 * (t - 1)) + b; }
+    return c / 2 * (-Math.pow(2, -10 * --t) + 2) + b;
+};
+
+g.easeInCirc = function (t, b, c, d) {
+    return -c * (Math.sqrt(1 - (t /= d) * t) - 1) + b;
+};
+
+g.easeOutCirc = function (t, b, c, d) {
+    return c * Math.sqrt(1 - (t = t / d - 1) * t) + b;
+};
+
+g.easeInOutCirc = function (t, b, c, d) {
+    if ((t /= d / 2) < 1) { return -c / 2 * (Math.sqrt(1 - t * t) - 1) + b; }
+    return c / 2 * (Math.sqrt(1 - (t -= 2) * t) + 1) + b;
+};
+
+g.easeInElastic = function (t, b, c, d) {
+    var s = 1.70158;
+    var p = 0;
+    var a = c;
+    if (t === 0) { return b; }
+    if ((t /= d) === 1) { return b + c; }
+    if (!p) p = d * 0.3;
+    if (a < Math.abs(c)) {
+        a = c;
+        s = p / 4;
+    }
+    else {
+        s = p / (2 * Math.PI) * Math.asin(c / a);
+    }
+    return -(a * Math.pow(2, 10 * (t -= 1)) * Math.sin((t * d - s) * (2 * Math.PI) / p)) + b;
+};
+
+g.easeOutElastic = function (t, b, c, d) {
+    var s = 1.70158;
+    var p = 0;
+    var a = c;
+    if (t === 0) { return b; }
+    if ((t /= d) === 1) { return b + c; }
+    if (!p) p = d * 0.3;
+    if (a < Math.abs(c)) {
+        a = c;
+        s = p / 4;
+    }
+    else {
+        s = p / (2 * Math.PI) * Math.asin(c / a);
+    }
+    return a * Math.pow(2, -10 * t) * Math.sin((t * d - s) * (2 * Math.PI) / p) + c + b;
+};
+
+g.easeInOutElastic = function (t, b, c, d) {
+    var s = 1.70158;
+    var p = 0;
+    var a = c;
+    if (t === 0) { return b; }
+    if ((t /= d / 2) === 2) { return b + c; }
+    if (!p) p = d * (0.3 * 1.5);
+    if (a < Math.abs(c)) {
+        a = c;
+        s = p / 4;
+    }
+    else {
+        s = p / (2 * Math.PI) * Math.asin(c / a);
+    }
+    if (t < 1) { return -0.5 * (a * Math.pow(2, 10 * (t -= 1)) * Math.sin((t * d - s) * (2 * Math.PI) / p)) + b; }
+    return a * Math.pow(2, -10 * (t -= 1)) * Math.sin((t * d - s) * (2 * Math.PI) / p) * 0.5 + c + b;
+};
+
+g.easeInBack = function (t, b, c, d, s) {
+    if (s === undefined) {
+        s = 1.70158;
+    }
+    return c * (t /= d) * t * ((s + 1) * t - s) + b;
+};
+
+g.easeOutBack = function (t, b, c, d, s) {
+    if (s === undefined) {
+        s = 1.70158;
+    }
+    return c * ((t = t / d - 1) * t * ((s + 1) * t + s) + 1) + b;
+};
+
+g.easeInOutBack = function (t, b, c, d, s) {
+    if (s === undefined) {
+        s = 1.70158;
+    }
+    if ((t /= d / 2) < 1) { return c / 2 * (t * t * (((s *= (1.525)) + 1) * t - s)) + b; }
+    return c / 2 * ((t -= 2) * t * (((s *= (1.525)) + 1) * t + s) + 2) + b;
+};
+
+g.easeInBounce = function (t, b, c, d) {
+    return c - g.easeOutBounce(d - t, 0, c, d) + b;
+};
+
+g.easeOutBounce = function (t, b, c, d) {
+    if ((t /= d) < (1 / 2.75)) {
+        return c * (7.5625 * t * t) + b;
+    } else if (t < (2 / 2.75)) {
+        return c * (7.5625 * (t -= (1.5 / 2.75)) * t + 0.75) + b;
+    } else if (t < (2.5 / 2.75)) {
+        return c * (7.5625 * (t -= (2.25 / 2.75)) * t + 0.9375) + b;
+    } else {
+        return c * (7.5625 * (t -= (2.625 / 2.75)) * t + 0.984375) + b;
+    }
+};
+
+g.easeInOutBounce = function (t, b, c, d) {
+    if (t < d / 2) { return g.easeInBounce(t * 2, 0, c, d) * 0.5 + b; }
+    return g.easeOutBounce(t * 2 - d, 0, c, d) * 0.5 + c * 0.5 + b;
+};
+
+g.easing = function (f) {
+    var fn = g[f];
+    var args = Array.prototype.slice.call(arguments, 1);
+    return fn.apply(null, args);
+};
+
+module.exports = g;
+
+},{}],12:[function(require,module,exports){
+'use strict';
+
+var _ = require('lodash');
+var vg = require('./vg/vg');
+var img = require('./img/img');
+var math = require('./math');
+
+var g = {};
+
+g.HORIZONTAL = 'horizontal';
+g.VERTICAL = 'vertical';
+g.BOTH = 'both';
+
+g.LEFT = 'left';
+g.RIGHT = 'right';
+g.CENTER = 'center';
+g.TOP = 'top';
+g.BOTTOM = 'bottom';
+g.MIDDLE = 'middle';
+
+function clamp(val, min, max) {
+    return Math.min(max, Math.max(min, val));
+}
+
+function transformShape(shape, t) {
+    return t.transformShape(shape);
+}
+
+function transformImage(image, t) {
+    return image._transform(t.m);
+}
+
+function transform(shape, t) {
+    if (shape instanceof vg.Path || shape instanceof vg.Group || shape instanceof vg.Text || ((shape.x !== undefined && shape.y !== undefined))) {
+        return transformShape(shape, t);
+    } else if (Array.isArray(shape)) {
+        var l = [];
+        for (var i = 0; i < shape.length; i += 1) {
+            l.push(transform(shape[i], t));
+        }
+        return l;
+    } else if (shape instanceof img.Img) {
+        return transformImage(shape, t);
+    }
+}
+
+g.align = function (shape, position, hAlign, vAlign) {
+    if (!shape) {
+        return;
+    }
+    var dx, dy, t,
+        x = position.x,
+        y = position.y,
+        bounds = vg.bounds(shape);
+    if (hAlign === g.LEFT) {
+        dx = x - bounds.x;
+    } else if (hAlign === g.RIGHT) {
+        dx = x - bounds.x - bounds.width;
+    } else if (hAlign === g.CENTER) {
+        dx = x - bounds.x - bounds.width / 2;
+    } else {
+        dx = 0;
+    }
+    if (vAlign === g.TOP) {
+        dy = y - bounds.y;
+    } else if (vAlign === g.BOTTOM) {
+        dy = y - bounds.y - bounds.height;
+    } else if (vAlign === g.MIDDLE) {
+        dy = y - bounds.y - bounds.height / 2;
+    } else {
+        dy = 0;
+    }
+
+    t = new vg.Transform().translate(dx, dy);
+    return transform(shape, t);
+};
+
+g.colorize = function (shape, options) {
+    var args = arguments;
+    if (typeof options !== 'object' || options instanceof vg.Color) {
+        options = {};
+        if (args[1] !== undefined) { options.fill = args[1]; }
+        if (args[2] !== undefined) { options.stroke = args[2]; }
+        if (args[3] !== undefined) { options.strokeWidth = args[3]; }
+    }
+    if (shape instanceof vg.Path || shape instanceof vg.Group) {
+        return shape.colorize(options);
+    } else if (shape instanceof img.Img || shape instanceof vg.Text) {
+        if (options.fill || options.fill === 0) {
+            return shape.colorize(options.fill);
+        } else {
+            throw new Error('No color given');
+        }
+    }
+};
+
+g.copy = function (shape, copies, order, translate, rotate, scale) {
+    var i, t, j, op, fn,
+        shapes = [],
+        tx = 0,
+        ty = 0,
+        r = 0,
+        sx = 1.0,
+        sy = 1.0,
+        isListOfPoints = false;
+
+    if (shape instanceof vg.Path || shape instanceof vg.Group || shape instanceof vg.Text) {
+        fn = transformShape;
+    } else if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
+        isListOfPoints = true;
+        fn = transformShape;
+    } else if (shape instanceof img.Img) {
+        fn = transformImage;
+    }
+
+    for (i = 0; i < copies; i += 1) {
+        t = new vg.Transform();
+        for (j = 0; j < order.length; j += 1) {
+            op = order[j];
+            if (op === 't') {
+                t = t.translate(tx, ty);
+            } else if (op === 'r') {
+                t = t.rotate(r);
+            } else if (op === 's') {
+                t = t.scale(sx, sy);
+            }
+        }
+        if (isListOfPoints) {
+            shapes = shapes.concat(fn(shape, t));
+        } else {
+            shapes.push(fn(shape, t));
+        }
+
+        tx += translate.x;
+        ty += translate.y;
+        r += rotate;
+        sx += scale.x;
+        sy += scale.y;
+    }
+    return shapes;
+};
+
+g.flip = function (shape, axis) {
+    if (axis === 'none') { return shape; }
+    if (shape instanceof vg.Path || shape instanceof vg.Group || shape instanceof vg.Text || (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined)) {
+        var x = axis === g.HORIZONTAL || axis === g.BOTH ? -1 : 1;
+        var y = axis === g.VERTICAL || axis === g.BOTH ? -1 : 1;
+        return vg.scale(shape, new vg.Point(x, y), vg.centerPoint(shape));
+    } else if (shape instanceof img.Img) {
+        var image = shape;
+        var layer = image.toLayer(false);
+        if (axis === g.HORIZONTAL || axis === g.BOTH) {
+            layer.flipHorizontal();
+        }
+        if (axis === g.VERTICAL || axis === g.BOTH) {
+            layer.flipVertical();
+        }
+        return image.withCanvas(layer.toCanvas());
+    }
+};
+
+g.fit = function (shape, position, width, height, stretch) {
+    if (!shape) {
+        return;
+    }
+    stretch = stretch !== undefined ? stretch : false;
+    var t, sx, sy,
+        bounds = vg.bounds(shape),
+        bx = bounds.x,
+        by = bounds.y,
+        bw = bounds.width,
+        bh = bounds.height;
+
+    // Make sure bw and bh aren't infinitely small numbers.
+    // This will lead to incorrect transformations with for examples lines.
+    bw = (bw > 0.000000000001) ? bw : 0;
+    bh = (bh > 0.000000000001) ? bh : 0;
+
+    t = new vg.Transform();
+    t = t.translate(position.x, position.y);
+
+    if (!stretch) {
+        // don't scale widths or heights that are equal to zero.
+        sx = (bw > 0) ? (width / bw) : Number.MAX_VALUE;
+        sy = (bh > 0) ? (height / bh) : Number.MAX_VALUE;
+        sx = sy = Math.min(sx, sy);
+    } else {
+        sx = (bw > 0) ? (width / bw) : 1;
+        sy = (bh > 0) ? (height / bh) : 1;
+    }
+
+    t = t.scale(sx, sy);
+    t = t.translate(-bw / 2 - bx, -bh / 2 - by);
+    return transform(shape, t);
+};
+
+g.fitTo = function (shape, bounding, stretch) {
+    if (!shape) {
+        return;
+    }
+    if (!bounding) {
+        return shape;
+    }
+
+    var bounds = vg.bounds(bounding),
+        bx = bounds.x,
+        by = bounds.y,
+        bw = bounds.width,
+        bh = bounds.height;
+
+    return g.fit(shape, {x: bx + bw / 2, y: by + bh / 2}, bw, bh, stretch);
+};
+
+g.hslAdjust = function (v, hue, saturation, lightness, alpha) {
+    if (!alpha) { alpha = 0; }
+
+    // First, handle the image case.
+    if (v instanceof img.Img) {
+        var image = v;
+        var layer = image.toLayer(false);
+        layer.addFilter('hslAdjust', {h: hue, s: saturation, l: lightness, a: alpha});
+        return image.withCanvas(layer.toCanvas());
+    }
+
+    hue = clamp(hue, -1, 1);
+    saturation = clamp(saturation, -1, 1);
+    lightness = clamp(lightness, -1, 1);
+    alpha = clamp(alpha, -1, 1);
+    var satMul = 1 + saturation * (saturation < 0 ? 1 : 2);
+    var lightMul = lightness < 0 ? 1 + lightness : 1 - lightness;
+    var lightAdd = lightness < 0 ? 0 : lightness;
+    var r, g, b, vs, ms, vm, h, s, l, m, vmh, sextant;
+    hue = (hue * 6) % 6;
+
+    function hslAdjust(v1) {
+        if (v1 instanceof vg.Group) {
+            var newShapes = [];
+            for (var i = 0; i < v1.shapes.length; i += 1) {
+                newShapes.push(hslAdjust(v1.shapes[i]));
+            }
+            return new vg.Group(newShapes);
+        } else if (v1 instanceof vg.Path) {
+            var p = v1.clone();
+            p.fill = hslAdjust(p.fill);
+            p.stroke = hslAdjust(p.stroke);
+            return p;
+        }
+        var c = v1;
+        if (!(c instanceof vg.Color)) {
+            c = vg.Color.parse(c);
+        }
+
+        r = c.r;
+        g = c.g;
+        b = c.b;
+
+        if (hue !== 0 || saturation !== 0) {
+            // ok, here comes rgb to hsl + adjust + hsl to rgb, all in one jumbled mess.
+            // It's not so pretty, but it's been optimized to get somewhat decent performance.
+            // The transforms were originally adapted from the ones found in Graphics Gems, but have been heavily modified.
+            vs = r;
+            if (g > vs) {
+                vs = g;
+            }
+            if (b > vs) {
+                vs = b;
+            }
+            ms = r;
+            if (g < ms) {
+                ms = g;
+            }
+            if (b < ms) {
+                ms = b;
+            }
+            vm = vs - ms;
+            l = (ms + vs) / 2;
+
+            if (l > 0 && vm > 0) {
+                if (l <= 0.5) {
+                    s = vm / (vs + ms) * satMul;
+                    if (s > 1) {
+                        s = 1;
+                    }
+                    v = (l * (1 + s));
+                } else {
+                    s = vm / (2 - vs - ms) * satMul;
+                    if (s > 1) {
+                        s = 1;
+                    }
+                    v = (l + s - l * s);
+                }
+                if (r === vs) {
+                    if (g === ms) {
+                        h = 5 + ((vs - b) / vm) + hue;
+                    } else {
+                        h = 1 - ((vs - g) / vm) + hue;
+                    }
+                } else if (g === vs) {
+                    if (b === ms) {
+                        h = 1 + ((vs - r) / vm) + hue;
+                    } else {
+                        h = 3 - ((vs - b) / vm) + hue;
+                    }
+                } else {
+                    if (r === ms) {
+                        h = 3 + ((vs - g) / vm) + hue;
+                    } else {
+                        h = 5 - ((vs - r) / vm) + hue;
+                    }
+                }
+                if (h < 0) {
+                    h += 6;
+                }
+                if (h >= 6) {
+                    h -= 6;
+                }
+                m = (l + l - v);
+                sextant = h >> 0;
+                vmh = (v - m) * (h - sextant);
+                if (sextant === 0) {
+                    r = v;
+                    g = m + vmh;
+                    b = m;
+                } else if (sextant === 1) {
+                    r = v - vmh;
+                    g = v;
+                    b = m;
+                } else if (sextant === 2) {
+                    r = m;
+                    g = v;
+                    b = m + vmh;
+                } else if (sextant === 3) {
+                    r = m;
+                    g = v - vmh;
+                    b = v;
+                } else if (sextant === 4) {
+                    r = m + vmh;
+                    g = m;
+                    b = v;
+                } else if (sextant === 5) {
+                    r = v;
+                    g = m;
+                    b = v - vmh;
+                }
+            }
+        }
+
+        r = r * lightMul + lightAdd;
+        g = g * lightMul + lightAdd;
+        b = b * lightMul + lightAdd;
 
-var g = {};
+        if (r < 0) { r = 0; }
+        if (g < 0) { g = 0; }
+        if (b < 0) { b = 0; }
+        if (r > 1) { r = 1; }
+        if (g > 1) { g = 1; }
+        if (b > 1) { b = 1; }
 
-// Commands
-function importCommands(module) {
-    for (var k in module) {
-        g[k] = module[k];
+        return new vg.Color(r, g, b, c.a + alpha);
     }
-}
+    return hslAdjust(v);
+};
 
-for (var k in vg) {
-    g[k] = vg[k];
-}
-delete g['delete'];
+g.rgbAdjust = function (v, red, green, blue, alpha) {
+    if (!alpha) { alpha = 0; }
+    red = clamp(red, -1, 1);
+    green = clamp(green, -1, 1);
+    blue = clamp(blue, -1, 1);
+    alpha = clamp(alpha, -1, 1);
 
-for (var k in img) {
-    g[k] = img[k];
-}
+    function rgbAdjust(v) {
+        if (v instanceof img.Img) {
+            var image = v;
+            var layer = image.toLayer(false);
+            layer.addFilter('rgbAdjust', {r: red, g: green, b: blue, a: alpha});
+            return image.withCanvas(layer.toCanvas());
+        } else if (v instanceof vg.Group) {
+            var newShapes = [];
+            for (var i = 0; i < v.shapes.length; i += 1) {
+                newShapes.push(rgbAdjust(v.shapes[i]));
+            }
+            return new vg.Group(newShapes);
+        } else if (v instanceof vg.Path) {
+            var p = v.clone();
+            p.fill = rgbAdjust(p.fill);
+            p.stroke = rgbAdjust(p.stroke);
+            return p;
+        }
+        var c = v;
+        if (!(c instanceof vg.Color)) {
+            c = vg.Color.parse(c);
+        }
+        return new vg.Color(c.r + red, c.g + green, c.b + blue, c.a + alpha);
+    }
+    return rgbAdjust(v);
+};
 
-importCommands(require('./libraries/math'));
-importCommands(require('./libraries/string'));
-importCommands(require('./libraries/list'));
-importCommands(require('./libraries/data'));
-importCommands(require('./libraries/image'));
-importCommands(require('./libraries/graphics'));
-importCommands(require('./libraries/easing'));
+g.stack = function (shapes, direction, margin) {
+    if (!shapes) {
+        return [];
+    }
+    if (shapes.length <= 1) {
+        return shapes;
+    }
 
-g.importSVG = function (svgString) {
-    return g.svg.parseString(svgString);
+    var tx, ty, t, bounds,
+        firstBounds = shapes[0].bounds(),
+        newShapes = [];
+
+    if (direction === 'e') {
+        tx = firstBounds.x;
+        _.each(shapes, function (shape) {
+            bounds = shape.bounds();
+            t = new vg.Transform().translate(tx - bounds.x, 0);
+            newShapes.push(transform(shape, t));
+            tx += bounds.width + margin;
+        });
+    } else if (direction === 'w') {
+        tx = firstBounds.x + firstBounds.width;
+        _.each(shapes, function (shape) {
+            bounds = shape.bounds();
+            t = new vg.Transform().translate(tx - (bounds.x + bounds.width), 0);
+            newShapes.push(transform(shape, t));
+            tx -= bounds.width + margin;
+        });
+    } else if (direction === 'n') {
+        ty = firstBounds.y + firstBounds.height;
+        _.each(shapes, function (shape) {
+            bounds = shape.bounds();
+            t = new vg.Transform().translate(0, ty - (bounds.y + bounds.height));
+            newShapes.push(transform(shape, t));
+            ty -= bounds.height + margin;
+        });
+    } else if (direction === 's') {
+        ty = firstBounds.y;
+        _.each(shapes, function (shape) {
+            bounds = shape.bounds();
+            t = new vg.Transform().translate(0, ty - bounds.y);
+            newShapes.push(transform(shape, t));
+            ty += bounds.height + margin;
+        });
+    }
+    return newShapes;
 };
 
-g.importImage = function (image) {
-    var layer = g.Layer.fromImage(image);
-    return new g.Img(layer.toCanvas());
+g.angle = function (point1, point2) {
+    var args = arguments;
+    if (args.length === 4) {
+        point1 = vg.Point.read(args[0], args[1]);
+        point2 = vg.Point.read(args[2], args[3]);
+    } else {
+        point1 = vg.Point.read(point1);
+        point2 = vg.Point.read(point2);
+    }
+    return math.degrees(Math.atan2(point2.y - point1.y, point2.x - point1.x));
 };
 
-g.importText = function (string) {
-    return string ? String(string) : '';
+g.coordinates = function (point, angle, distance) {
+    var args = arguments;
+    if (args.length === 4) {
+        point = vg.Point.read(args[0], args[1]);
+        angle = args[2];
+        distance = args[3];
+    } else {
+        point = vg.Point.read(point);
+    }
+    return vg.geo.coordinates(point.x, point.y, angle, distance);
 };
 
-g.importCSV = function (csvString, delimiter) {
-    // Split the row, taking quotes into account.
-    function splitRow(s, delimiter) {
-        var row = [], c, col = '', i, inString = false;
-        s = s.trim();
-        for (i = 0; i < s.length; i += 1) {
-            c = s[i];
-            if (c === '"') {
-                if (s[i+1] === '"') {
-                    col += '"';
-                    i += 1;
-                } else {
-                    inString = !inString;
-                }
-            } else if (c === delimiter) {
-                if (!inString) {
-                    row.push(col);
-                    col = '';
-                } else {
-                    col += c;
-                }
-            } else {
-                col += c;
-            }
-        }
-        row.push(col);
-        return row;
+g.distance = function (point1, point2) {
+    var args = arguments;
+    if (args.length === 4) {
+        point1 = vg.Point.read(args[0], args[1]);
+        point2 = vg.Point.read(args[2], args[3]);
+    } else {
+        point1 = vg.Point.read(point1);
+        point2 = vg.Point.read(point2);
     }
+    return Math.sqrt(Math.pow(point2.x - point1.x, 2) + Math.pow(point2.y - point1.y, 2));
+};
 
-    var rows, header;
-    delimiter = delimiter || ',';
+g.grayColor = function (gray, alpha) {
+    if (!alpha && alpha !== 0) { alpha = 1; }
+    return vg.Color.gray(gray, alpha, 1.0);
+};
 
-    if (!csvString) return null;
-    rows = csvString.split(/\r\n|\r|\n/g);
-    header = splitRow(rows[0], delimiter);
-    rows = rows.slice(1);
+g.hexColor = function (s) {
+    function isNumeric(n) {
+        return !isNaN(parseFloat(n)) && isFinite(n);
+    }
+    if (isNumeric(s)) {
+        s = s.toString(16);
+    } else {
+        s = String(s);
+    }
+    if (s[0] !== '#') {
+        s = '#' + s;
+    }
+    return vg.Color.parse(s);
+};
 
-    rows = _.reject(rows, _.isEmpty);
+g.hslColor = function (hue, saturation, lightness, alpha) {
+    if (!alpha && alpha !== 0) { alpha = 1; }
+    return vg.Color.hsl(hue, saturation, lightness, alpha, 1.0);
+};
 
-    rows = _.map(rows, function (row) {
-        var cols, m = {};
-        cols = _.map(splitRow(row, delimiter), function (col) {
-            return isNaN(col) ? col : parseFloat(col);
-        });
-        _.each(cols, function (col, index) {
-            m[header[index]] = col;
-        });
-        return m;
-    });
-    return rows;
+g.rgbColor = function (red, green, blue, alpha) {
+    if (!alpha && alpha !== 0) { alpha = 1; }
+    return vg.Color.rgb(red, green, blue, alpha, 1.0);
 };
 
-g.merge = function () {
-    var objects = _.flatten(arguments, true);
-    if (Array.isArray(objects)) {
-        objects = _.reject(objects, _.isEmpty);
-        if (objects.length > 0) {
-            var o = objects[0];
-            if (o && (o.commands || o.shapes || o.fontFamily)) {
-                return vg.merge(objects);
-            } else if (o instanceof img.Img) {
-                return img.merge(objects);
-            }
-        }
-    }
-    return null;
+g.desaturate = function (shape, method) {
+    if (!shape) { return null; }
+    return shape.desaturate({method: method});
 };
 
-g.mix = function (a, b, t) {
-    t = t !== undefined ? t : 0.5;
-    if (typeof a === 'number') {
-        return (a * (1 - t)) + (b * t);
-    } else if (typeof a === 'object') {
-        var result = {};
-        var keys = Object.keys(a);
-        for (var i = 0, n = keys.length; i < n; i += 1) {
-            var k = keys[i];
-            var va = a[k];
-            var vb = b[k];
-            if (va !== undefined && vb !== undefined) {
-                result[k] = g.mix(va, vb, t);
-            }
-        }
-        return result;
-    } else {
-        return 0;
+g.invert = function (shape) {
+    if (!shape) { return null; }
+    if (shape instanceof img.Img) {
+        var image = shape;
+        var layer = image.toLayer(false);
+        layer.addFilter('invert');
+        return image.withCanvas(layer.toCanvas());
     }
+    return shape.invert();
 };
 
 module.exports = g;
 
-},{"./libraries/data":10,"./libraries/easing":12,"./libraries/graphics":13,"./libraries/image":14,"./libraries/img/img":18,"./libraries/list":21,"./libraries/math":22,"./libraries/string":23,"./libraries/vg/vg":45,"lodash":3}],10:[function(require,module,exports){
+},{"./img/img":17,"./math":21,"./vg/vg":44,"lodash":2}],13:[function(require,module,exports){
 'use strict';
 
-var _ = require('lodash');
-var list = require('./list');
+var vg = require('./vg/vg');
+var img = require('./img/img');
 
+var Img = img.Img;
+var Layer = img.Layer;
+var ImageCanvas = img.ImageCanvas;
 var g = {};
 
-// Convert values from one range to another
-g.convert = function (v, inMin, inMax, outMin, outMax) {
-    var argLength = arguments.length;
-    if (argLength === 2) {
-        var d = arguments[1];
-        inMin = d.inMin;
-        inMax = d.inMax;
-        outMin = d.outMin;
-        outMax = d.outMax;
-    } else if (argLength === 3) {
-        inMin = arguments[1][0];
-        inMax = arguments[1][1];
-        outMin = arguments[2][0];
-        outMax = arguments[2][1];
-    }
-    try {
-        v = (v - inMin) / (inMax - inMin);
-    } catch (e) {
-        v = inMin;
-    }
-    // Convert value to target range.
-    return outMin + v * (outMax - outMin);
+g.blend = function (image1, image2, mode) {
+    var b1 = image1.bounds();
+    var b2 = image2.bounds();
+
+    var b = new vg.Rect(b1.x, b1.y, b1.width, b1.height).unite(b2);
+    var width = Math.ceil(b.width);
+    var height = Math.ceil(b.height);
+    var dx = width / 2 + b.x;
+    var dy = height / 2 + b.y;
+
+    var canvas = new ImageCanvas(width, height);
+    var l1 = canvas.addLayer(image1.toLayer());
+    l1.translate(-dx, -dy);
+    var l2 = canvas.addLayer(image2.toLayer());
+    l2.translate(-dx, -dy);
+    l2.blendmode = mode;
+    return new Img(canvas.render(), dx, dy);
 };
 
-g.filterData = function (data, key, op, value) {
-    var i, l, row, obj;
-    if (value === null || value === undefined) {
-        return data;
-    }
-    var results = [];
-    if (op === '==') {
-        for (i = 0, l = data.length; i < l; i++) {
-            row = data[i];
-            obj = row[key];
-            if (obj == value) { // jshint ignore:line
-                results.push(row);
-            }
-        }
-    } else if (op === '!=') {
-        for (i = 0, l = data.length; i < l; i++) {
-            row = data[i];
-            obj = row[key];
-            if (obj != value) { // jshint ignore:line
-                results.push(row);
-            }
-        }
-    } else if (op === '>') {
-        for (i = 0, l = data.length; i < l; i++) {
-            row = data[i];
-            obj = row[key];
-            if (obj > value) {
-                results.push(row);
-            }
-        }
-    } else if (op === '>=') {
-        for (i = 0, l = data.length; i < l; i++) {
-            row = data[i];
-            obj = row[key];
-            if (obj >= value) {
-                results.push(row);
-            }
-        }
-    } else if (op === '<') {
-        for (i = 0, l = data.length; i < l; i++) {
-            row = data[i];
-            obj = row[key];
-            if (obj < value) {
-                results.push(row);
-            }
-        }
-    } else if (op === '<=') {
-        for (i = 0, l = data.length; i < l; i++) {
-            row = data[i];
-            obj = row[key];
-            if (obj <= value) {
-                results.push(row);
-            }
-        }
-    } else {
-        throw new Error('Invalid op ' + op);
-    }
-    return results;
+g.blur = function (image, radius) {
+    var layer = image.toLayer(false);
+    layer.addFilter('blur', {radius: radius});
+    return image.withCanvas(layer.toCanvas());
 };
 
-g.groupBy = function (data, key) {
-    return _.values(_.groupBy(data, key));
+g.brighten = function (image, brightness, contrast) {
+    var layer = image.toLayer(false);
+    layer.addFilter('brightness', {brightness: brightness / 100, contrast: contrast / 100});
+    return image.withCanvas(layer.toCanvas());
 };
 
-/* // Draw a legend. ==> rename to axis?
-g.legend = function (scale, position, direction, nTicks) {
-    var ticks = g.ticks(scale, nTicks),
-        group = new vg.Group(),
-        p = new vg.Path(),
-        textOptions = {fontSize: 9, align: 'center'},
-        t,
-        i,
-        v;
-    p.moveTo(scale.outMax, position.y);
-    p.lineTo(scale.outMin, position.y);
-    p.stroke = 'black';
-    group.add(p);
-    for (i = 0; i < ticks.length; i += 1) {
-        v = g.convert(scale, ticks[i]);
-        p.moveTo(v, position.y);
-        p.lineTo(v, position.y + 5);
-        t = new g.Text('' + ticks[i], v, position.y + 15, textOptions);
-        group.add(t);
-    }
-    return group;
-}; */
+g.bump = function (image, position, radius, zoom) {
+    var layer = image.toLayer(false);
+    layer.addFilter('bump', {dx: position.x, dy: position.y, radius: radius, zoom: zoom / 100});
+    return image.withCanvas(layer.toCanvas());
+};
 
-g.keys = function (data) {
-    var allKeys = [];
-    for (var i = 0; i < data.length; i++) {
-        allKeys = allKeys.concat(_.keys(data[i]));
-    }
-    return list.distinct(allKeys);
+g.colorImage = function (width, height, color) {
+    var layer = Layer.fromColor(color);
+    layer.width = width;
+    layer.height = height;
+    return new Img(layer.toCanvas());
 };
 
-g.lookup = function (table, key) {
-    var obj, v;
-    obj = table;
-    // First try to lookup the key as-is.
-    v = obj[key];
-    if (v !== undefined) {
-        if (typeof v === 'function') {
-            v = v.call(obj);
-        }
-        return v;
-    }
-    _.each(key.split('.'), function (token) {
-        if (!obj) return null;
-        if (typeof obj[token] === 'function') {
-            v = obj[token];
-            obj = v.call(obj);
-        } else {
-            obj = obj[token];
-        }
-    });
-    return obj;
+g.crop = function (image, bounding) {
+    return image.crop(bounding);
+};
+
+g.crossEdges = function (image, strength) {
+    var layer = image.toLayer(false);
+    layer.addFilter('crossedges', {strength: strength / 100});
+    return image.withCanvas(layer.toCanvas());
+};
+
+g.dent = function (image, position, radius, zoom) {
+    var layer = image.toLayer(false);
+    layer.addFilter('dent', {dx: position.x, dy: position.y, radius: radius, zoom: zoom / 100});
+    return image.withCanvas(layer.toCanvas());
+};
+
+g.emboss = function (image, amount, angle) {
+    var layer = image.toLayer(false);
+    layer.addFilter('emboss', {amount: amount / 100, angle: angle});
+    return image.withCanvas(layer.toCanvas());
 };
 
-// Create a scale that maps values from the input domain to the output range.
-g.dataScale = function (domain, outMin, outMax) {
-    return {domain: domain, outMin: outMin, outMax: outMax};
+g.equalize = function (image) {
+    var layer = image.toLayer(false);
+    layer.addFilter('equalize');
+    return image.withCanvas(layer.toCanvas());
 };
 
+g.findEdges = function (image) {
+    var layer = image.toLayer(false);
+    layer.addFilter('findedges');
+    return image.withCanvas(layer.toCanvas());
+};
 
-// Generate about n values for the given scale.
-g.ticks = function (min, max, n) {
-    n = n !== undefined ? n : 10;
+g.glow = function (image, amount, kernelSize) {
+    var layer = image.toLayer(false);
+    layer.addFilter('glow', {amount: amount / 100, kernelSize: kernelSize});
+    return image.withCanvas(layer.toCanvas());
+};
 
-    var span = max - min,
-        step = Math.pow(10, Math.floor(Math.log(span / n) / Math.LN10)),
-        err = n / span * step,
-        ticks = [],
-        i;
+g.gradientImage = function (width, height, startColor, endColor, type, angle, spread) {
+    var layer = Layer.fromGradient(startColor, endColor, type, angle, spread / 100);
+    layer.width = width;
+    layer.height = height;
+    return new Img(layer.toCanvas());
+};
 
-    if (err <= 0.15) {
-        step *= 10;
-    } else if (err <= 0.35) {
-        step *= 5;
-    } else if (err <= 0.75) {
-        step *= 2;
+g.histogram = function (image, channel, relative) {
+    var pixels = image.getPixels();
+    var vals = new Array(256);
+    var i, c, pixel, comp;
+    for (i = 0; i < vals.length; i += 1) { vals[i] = 0; }
+    if (channel === 'lum') {
+        for (i = 0; i < pixels.width * pixels.height; i += 1) {
+            pixel = pixels.get(i);
+            comp = pixel[0] * 0.2125 + pixel[1] * 0.7154 + pixel[2] * 0.0721;
+            vals[Math.round(comp)] += 1;
+        }
+    } else {
+        if (channel === 'red') { c = 0; }
+        if (channel === 'green') { c = 1; }
+        if (channel === 'blue') { c = 2; }
+        if (channel === 'alpha') { c = 3; }
+        for (i = 0; i < pixels.width * pixels.height; i += 1) {
+            pixel = pixels.get(i);
+            comp = pixel[c];
+            vals[comp] += 1;
+        }
     }
-
-    min = Math.ceil(min / step) * step;
-    max = Math.floor(max / step) * step + (step * 0.5);
-
-    for (i = min; i < max; i += step) {
-        ticks.push(i);
+    if (relative) {
+        for (i = 0; i < vals.length; i += 1) {
+            vals[i] /= (pixels.width * pixels.height);
+        }
     }
-
-    return ticks;
+    return vals;
 };
 
-module.exports = g;
+g.lightTunnel = function (image, position, radius) {
+    var layer = image.toLayer(false);
+    layer.addFilter('splash', {dx: position.x, dy: position.y, radius: radius});
+    return image.withCanvas(layer.toCanvas());
+};
 
-},{"./list":21,"lodash":3}],11:[function(require,module,exports){
-/* jshint eqeqeq:false */
+g.luminanceBW = function (image) {
+    var layer = image.toLayer(false);
+    layer.addFilter('luminancebw');
+    return image.withCanvas(layer.toCanvas());
+};
 
-'use strict';
+g.mask = function (image, mask) {
+    image = image.transformed();
+    mask = mask.transformed();
 
-// Equality functionality taken from node.js' (http://nodejs.org) assert module:
-// https://github.com/joyent/node/blob/master/lib/assert.js
+    var layer = image.toLayer(false);
+    var maskLayer = mask.toLayer();
 
-function isBuffer() {
-    return false;
-}
+    var b1 = image.bounds();
+    var b2 = mask.bounds();
 
-function isObject(arg) {
-    return typeof arg === 'object' && arg !== null;
-}
+    var b = new vg.Rect(b1.x, b1.y, b1.width, b1.height).unite(b2);
+    var width = Math.ceil(b.width);
+    var height = Math.ceil(b.height);
+    var dx = width / 2 + b.x;
+    var dy = height / 2 + b.y;
+    maskLayer.translate(-dx, -dy);
 
-function objectToString(o) {
-    return Object.prototype.toString.call(o);
-}
+    var l = layer.mask.addLayer('white');
+    l.width = layer.width;
+    l.height = layer.height;
+    layer.mask.addLayer(maskLayer);
+    return image.withCanvas(layer.toCanvas());
+};
 
-function isRegExp(re) {
-    return isObject(re) && objectToString(re) === '[object RegExp]';
-}
+g.mosaic = function (image, blockSize) {
+    var layer = image.toLayer(false);
+    layer.addFilter('mosaic', {blockSize: blockSize});
+    return image.withCanvas(layer.toCanvas());
+};
 
-function isDate(d) {
-    return isObject(d) && objectToString(d) === '[object Date]';
-}
+g.pinch = function (image, position, zoom) {
+    var layer = image.toLayer(false);
+    layer.addFilter('pinch', {dx: position.x, dy: position.y, zoom: zoom / 100});
+    return image.withCanvas(layer.toCanvas());
+};
 
-function isNullOrUndefined(arg) {
-    return (arg === null || arg === undefined);
-}
+g.posterize = function (image, levels) {
+    var layer = image.toLayer(false);
+    layer.addFilter('posterize', {levels: levels});
+    return image.withCanvas(layer.toCanvas());
+};
 
-var util = {
-    isObject: isObject,
-    isRegExp: isRegExp,
-    isDate: isDate,
-    isNullOrUndefined: isNullOrUndefined,
-    isBuffer: isBuffer
+g.removeNoise = function (image) {
+    var layer = image.toLayer(false);
+    layer.addFilter('removenoise');
+    return image.withCanvas(layer.toCanvas());
 };
 
-var pSlice = Array.prototype.slice;
-var deepEqual = {};
+g.solarize = function (image) {
+    var layer = image.toLayer(false);
+    layer.addFilter('solarize');
+    return image.withCanvas(layer.toCanvas());
+};
 
-var isArguments, _deepEqual, objEquiv;
+g.toBitmap = function (shape, bounding) {
+    var canvas = document.createElement('canvas');
+    var bounds;
+    if (bounding) {
+        bounds = bounding.bounds();
+    } else {
+        bounds = shape.bounds();
+    }
+    var x = bounds.x;
+    var y = bounds.y;
+    var width = canvas.width = Math.ceil(bounds.width);
+    var height = canvas.height = Math.ceil(bounds.height);
+    var ctx = canvas.getContext('2d');
+    ctx.translate(-x, -y);
+    shape.draw(ctx);
+    return new Img(canvas, width / 2 + x, height / 2 + y);
+};
 
-_deepEqual = function (actual, expected) {
-    // 7.1. All identical values are equivalent, as determined by ===.
-    if (actual === expected) {
-        return true;
-    } else if (util.isBuffer(actual) && util.isBuffer(expected)) {
-        if (actual.length !== expected.length) return false;
+g.toPixels = function (image, step) {
+    step = step > 1 ? step : 1;
+    var canvas = image.canvas;
+    var imgWidth = canvas.width;
+    var imgHeight = canvas.height;
+    var ctx = canvas.getContext('2d');
+    var data = ctx.getImageData(0, 0, canvas.width, canvas.height);
+    var pixels = data.data;
+    var stride = canvas.width * 4;
 
-        for (var i = 0; i < actual.length; i++) {
-            if (actual[i] !== expected[i]) return false;
+    var outPixels = [];
+    for (var y = 0; y < imgHeight; y += step) {
+        for (var x = 0; x < imgWidth; x += step) {
+            var offset = y * stride + x * 4;
+            var pr = pixels[offset];
+            var pg = pixels[offset + 1];
+            var pb = pixels[offset + 2];
+            var pa = pixels[offset + 3];
+            outPixels.push({
+                x: x - imgWidth / 2,
+                y: y - imgHeight / 2,
+                r: pr,
+                g: pg,
+                b: pb,
+                a: pa,
+                color: new vg.Color(pr / 255, pg / 255, pb / 255, pa / 255)
+            });
         }
+    }
+    return outPixels;
+};
 
-        return true;
+g.twirl = function (image, position, radius, angle) {
+    var layer = image.toLayer(false);
+    layer.addFilter('twirl', {dx: position.x, dy: position.y, radius: radius, angle: angle});
+    return image.withCanvas(layer.toCanvas());
+};
 
-    // 7.2. If the expected value is a Date object, the actual value is
-    // equivalent if it is also a Date object that refers to the same time.
-    } else if (util.isDate(actual) && util.isDate(expected)) {
-        return actual.getTime() === expected.getTime();
+module.exports = g;
 
-    // 7.3 If the expected value is a RegExp object, the actual value is
-    // equivalent if it is also a RegExp object with the same source and
-    // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`).
-    } else if (util.isRegExp(actual) && util.isRegExp(expected)) {
-        return actual.source === expected.source &&
-            actual.global === expected.global &&
-            actual.multiline === expected.multiline &&
-            actual.lastIndex === expected.lastIndex &&
-            actual.ignoreCase === expected.ignoreCase;
+},{"./img/img":17,"./vg/vg":44}],14:[function(require,module,exports){
+'use strict';
 
-    // 7.4. Other pairs that do not both pass typeof value == 'object',
-    // equivalence is determined by ==.
-    } else if (!util.isObject(actual) && !util.isObject(expected)) {
-        return actual == expected;
+var async = require('async');
+var process = require('./process');
+var CanvasRenderer = require('./canvasrenderer');
 
-    // 7.5 For all other Object pairs, including Array objects, equivalence is
-    // determined by having the same number of owned properties (as verified
-    // with Object.prototype.hasOwnProperty.call), the same set of keys
-    // (although not necessarily the same order), equivalent values for every
-    // corresponding key, and an identical 'prototype' property. Note: this
-    // accounts for both named and indexed properties on Arrays.
-    } else {
-        return objEquiv(actual, expected);
-    }
-};
+// Utility function that passes its input (normally a html canvas) to the next function.
+function passThrough(canvas, callback) {
+    callback(null, canvas);
+}
+
+// RENDERING.
+
+// The Layer and ImageCanvas objects don't do any actual pixel operations themselves,
+// they only contain information about the operations. The actual rendering is done
+// by a Renderer object. Currently there is only one kind available, the CanvasRenderer,
+// which uses the HTML Canvas object (containing the pixel data) and a 2D context that
+// acts on this canvas object. In the future, a webgl renderer might be added as well.
 
-deepEqual.deepEqual = _deepEqual;
+var AsyncRenderer = {};
 
-isArguments = function (object) {
-    return Object.prototype.toString.call(object) === '[object Arguments]';
+// Renders a html canvas as an html Image. Currently unused.
+AsyncRenderer.toImage = function () {
+    return function (canvas, callback) {
+        callback(null, CanvasRenderer.toImage(canvas));
+    };
 };
 
-objEquiv = function (a, b) {
-    if (util.isNullOrUndefined(a) || util.isNullOrUndefined(b))
-        return false;
-    // an identical 'prototype' property.
-    if (a.prototype !== b.prototype) return false;
-    //~~~I've managed to break Object.keys through screwy arguments passing.
-    //   Converting to array solves the problem.
-    var aIsArgs = isArguments(a),
-        bIsArgs = isArguments(b);
-    if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs))
-        return false;
-    if (aIsArgs) {
-        a = pSlice.call(a);
-        b = pSlice.call(b);
-        return _deepEqual(a, b);
-    }
-    var ka, kb, key, i;
-    try {
-        ka = Object.keys(a);
-        kb = Object.keys(b);
-    } catch (e) {//happens when one is a string literal and the other isn't
-        return false;
-    }
-    // having the same number of owned properties (keys incorporates
-    // hasOwnProperty)
-    if (ka.length !== kb.length)
-        return false;
-    //the same set of keys (although not necessarily the same order),
-    ka.sort();
-    kb.sort();
-    //~~~cheap key test
-    for (i = ka.length - 1; i >= 0; i--) {
-        if (ka[i] != kb[i])
-            return false;
-    }
-    //equivalent values for every corresponding key, and
-    //~~~possibly expensive deep test
-    for (i = ka.length - 1; i >= 0; i--) {
-        key = ka[i];
-        if (!_deepEqual(a[key], b[key])) return false;
+
+// 'LOADING' OF LAYERS.
+
+// Returns a html canvas dependent on the type of the layer provided.
+AsyncRenderer.load = function (iCanvas, layer) {
+    if (layer.isPath()) {
+        return AsyncRenderer.loadFile(layer.data);
+    } else if (layer.isFill()) {
+        return AsyncRenderer.generateColor(iCanvas, layer);
+    } else if (layer.isGradient()) {
+        return AsyncRenderer.generateGradient(iCanvas, layer);
+    } else if (layer.isHtmlCanvas()) {
+        return AsyncRenderer.loadHtmlCanvas(layer.data);
+    } else if (layer.isImage()) {
+        return AsyncRenderer.loadImage(layer.data);
+    } else if (layer.isImageCanvas()) {
+        return AsyncRenderer.loadImageCanvas(layer.data);
     }
-    return true;
 };
 
-module.exports = deepEqual;
-},{}],12:[function(require,module,exports){
-'use strict';
+// Returns a html canvas from an image file location.
+AsyncRenderer.loadFile = function (src) {
+    return function (_, callback) {
+        var canvas = document.createElement('canvas');
+        var ctx = canvas.getContext('2d');
 
-// Easing functions in javascript ported from jQuery Easing Plugin:
-// https://github.com/gdsmith/jquery.easing
-// t: current time, b: beginning value, c: change in value, d: duration
+        var source = new Image();
+        source.onload = function () {
+            canvas.width = source.width;
+            canvas.height = source.height;
+            ctx.drawImage(source, 0, 0, canvas.width, canvas.height);
+            callback(null, canvas);
+        };
+        source.src = src;
+    };
+};
 
-var g = {};
+// Passes a html canvas.
+AsyncRenderer.loadHtmlCanvas = function (canvas) {
+    return function (_, callback) {
+        callback(null, canvas);
+    };
+};
 
-g.easeInQuad = function (t, b, c, d) {
-    return c * (t /= d) * t + b;
+// Returns a html canvas from rendering an ImageCanvas.
+AsyncRenderer.loadImageCanvas = function (iCanvas) {
+    return function (_, callback) {
+        iCanvas.render(function (canvas) {
+            callback(null, canvas);
+        });
+    };
 };
 
-g.easeOutQuad = function (t, b, c, d) {
-    return -c * (t /= d) * (t - 2) + b;
+// Returns a html canvas from rendering a stored Image file.
+AsyncRenderer.loadImage = function (img) {
+    return function (_, callback) {
+        var canvas = CanvasRenderer.loadImage(img);
+        callback(null, canvas);
+    };
 };
 
-g.easeInOutQuad = function (t, b, c, d) {
-    if ((t /= d / 2) < 1) { return c / 2 * t * t + b; }
-    return -c / 2 * ((--t) * (t - 2) - 1) + b;
+// Returns a html canvas with a solid fill color.
+AsyncRenderer.generateColor = function (iCanvas, layer) {
+    return function (_, callback) {
+        var canvas = CanvasRenderer.generateColor(iCanvas, layer);
+        callback(null, canvas);
+    };
 };
 
-g.easeInCubic = function (t, b, c, d) {
-    return c * (t /= d) * t * t + b;
+// Returns a html canvas with a gradient.
+AsyncRenderer.generateGradient = function (iCanvas, layer) {
+    return function (_, callback) {
+        var canvas = CanvasRenderer.generateGradient(iCanvas, layer);
+        callback(null, canvas);
+    };
 };
 
-g.easeOutCubic = function (t, b, c, d) {
-    return c * ((t = t / d - 1) * t * t + 1) + b;
+
+// PROCESSING OF LAYERS.
+
+// Performs a number of filtering operations on an html image.
+// This method executes on the main thread if web workers aren't available on the current system.
+AsyncRenderer.processImage = function (filters) {
+    if (filters.length === 0) {
+        return passThrough;
+    }
+
+    return function (canvas, callback) {
+        CanvasRenderer.processImage(canvas, filters);
+        callback(null, canvas);
+    };
 };
 
-g.easeInOutCubic = function (t, b, c, d) {
-    if ((t /= d / 2) < 1) { return c / 2 * t * t * t + b; }
-    return c / 2 * ((t -= 2) * t * t + 2) + b;
+// Renders the layer mask and applies it to the layer that it is supposed to mask.
+AsyncRenderer.processMask = function (mask) {
+    if (mask.layers.length === 0) {
+        return passThrough;
+    }
+    return function (canvas, callback) {
+        mask.width = canvas.width;
+        mask.height = canvas.height;
+
+        // First, make a black and white version of the masking canvas and pass
+        // the result to the masking operation.
+        AsyncRenderer.renderBW(mask, function (c) {
+            var data = c.getContext('2d').getImageData(0, 0, c.width, c.height).data;
+            var maskFilter = {name: 'mask', options: {data: data, x: 0, y: 0, width: c.width, height: c.height} };
+            var fn = AsyncRenderer.processImage([maskFilter]);
+            fn(canvas, callback);
+        });
+    };
 };
 
-g.easeInQuart = function (t, b, c, d) {
-    return c * (t /= d) * t * t * t + b;
+// Processes a single layer. First the layer image is loaded, then a mask (if applicable) is applied to it,
+// and finally the filters (if any) are applied to it.
+function processLayers(iCanvas) {
+    return function (layer, callback) {
+        async.compose(
+            AsyncRenderer.processImage(layer.filters),
+            AsyncRenderer.processMask(layer.mask),
+            AsyncRenderer.load(iCanvas, layer)
+        )(null, callback);
+    };
+}
+
+
+// LAYER BLENDING.
+
+// Blends the subsequent layer images with the base layer and returns a single image.
+// This method is used when web workers aren't available for use on this system.
+AsyncRenderer.mergeManualBlend = function (iCanvas, layerData) {
+    return function (canvas, callback) {
+        CanvasRenderer.mergeManualBlend(iCanvas, layerData)(canvas);
+        callback(null, canvas);
+    };
 };
 
-g.easeOutQuart = function (t, b, c, d) {
-    return -c * ((t = t / d - 1) * t * t * t - 1) + b;
+// Blends the subsequent layer images with the base layer and returns the resulting image.
+// This method is used when the system supports the requested blending mode(s).
+AsyncRenderer.mergeNativeBlend = function (iCanvas, layerData) {
+    return function (canvas, callback) {
+        CanvasRenderer.mergeNativeBlend(iCanvas, layerData)(canvas);
+        callback(null, canvas);
+    };
 };
 
-g.easeInOutQuart = function (t, b, c, d) {
-    if ((t /= d / 2) < 1) { return c / 2 * t * t * t * t + b; }
-    return -c / 2 * ((t -= 2) * t * t * t - 2) + b;
+// Merges the different canvas layers together in a single image and returns this as a html canvas.
+AsyncRenderer.merge = function (iCanvas, layerData, callback) {
+    var renderPipe = CanvasRenderer.createRenderPipe(AsyncRenderer, iCanvas, layerData);
+    renderPipe.reverse();
+
+    var canvas = CanvasRenderer.singleLayerWithOpacity(iCanvas, layerData[0]);
+    renderPipe.push(function (_, cb) {
+        cb(null, canvas);
+    });
+
+    async.compose.apply(null, renderPipe)(null, function () {
+        callback(canvas);
+    });
 };
 
-g.easeInQuint = function (t, b, c, d) {
-    return c * (t /= d) * t * t * t * t + b;
+AsyncRenderer.composite = function (iCanvas, layerData, callback) {
+    if (!layerData || layerData.length === 0) {
+        callback(null);
+        return;
+    }
+    if (layerData.length === 1) {
+        callback(CanvasRenderer.singleLayerWithOpacity(iCanvas, layerData[0]));
+        return;
+    }
+
+    AsyncRenderer.merge(iCanvas, layerData, callback);
 };
 
-g.easeOutQuint = function (t, b, c, d) {
-    return c * ((t = t / d - 1) * t * t * t * t + 1) + b;
+// Renders the image canvas. Top level.
+AsyncRenderer.render = function (iCanvas, callback) {
+    async.map(iCanvas.layers,
+        processLayers(iCanvas), function (err, layerImages) {
+            if (callback) {
+                AsyncRenderer.composite(iCanvas, CanvasRenderer.getLayerData(iCanvas, layerImages), callback);
+            }
+        });
 };
 
-g.easeInOutQuint = function (t, b, c, d) {
-    if ((t /= d / 2) < 1) { return c / 2 * t * t * t * t * t + b; }
-    return c / 2 * ((t -= 2) * t * t * t * t + 2) + b;
+// Renders the image canvas and turns it into a black and white image. Useful for rendering a layer mask.
+AsyncRenderer.renderBW = function (iCanvas, callback) {
+    AsyncRenderer.render(iCanvas, function (canvas) {
+        var data = canvas.getContext('2d').getImageData(0, 0, canvas.width, canvas.height).data;
+        var bwFilter = {name: 'desaturate', options: {method: 'ITU-R BT.709'}};
+        var fn = AsyncRenderer.processImage([bwFilter]);
+        fn(canvas, function (err, c) {
+            callback(c);
+        });
+    });
 };
 
-g.easeInSine = function (t, b, c, d) {
-    return -c * Math.cos(t / d * (Math.PI / 2)) + c + b;
-};
+module.exports = AsyncRenderer;
 
-g.easeOutSine = function (t, b, c, d) {
-    return c * Math.sin(t / d * (Math.PI / 2)) + b;
-};
+},{"./canvasrenderer":16,"./process":18,"async":1}],15:[function(require,module,exports){
+'use strict';
 
-g.easeInOutSine = function (t, b, c, d) {
-    return -c / 2 * (Math.cos(Math.PI * t / d) - 1) + b;
-};
+var blend, process;
 
-g.easeInExpo = function (t, b, c, d) {
-    return (t === 0) ? b : c * Math.pow(2, 10 * (t / d - 1)) + b;
+var aliases = {
+    normal: 'source-over',
+    'linear-dodge': 'add'
 };
 
-g.easeOutExpo = function (t, b, c, d) {
-    return (t === d) ? b + c : c * (-Math.pow(2, -10 * t / d) + 1) + b;
-};
+function addAliases(d) {
+    var i, mode, alias;
+    var modes = Object.keys(aliases);
+    for (i = 0; i < modes.length; i += 1) {
+        mode = modes[i];
+        alias = aliases[mode];
+        d[mode] = d[alias];
+    }
+}
 
-g.easeInOutExpo = function (t, b, c, d) {
-    if (t === 0) { return b; }
-    if (t === d) { return b + c; }
-    if ((t /= d / 2) < 1) { return c / 2 * Math.pow(2, 10 * (t - 1)) + b; }
-    return c / 2 * (-Math.pow(2, -10 * --t) + 2) + b;
-};
+function realBlendMode(mode) {
+    if (aliases[mode] !== undefined) { return aliases[mode]; }
+    return mode;
+}
 
-g.easeInCirc = function (t, b, c, d) {
-    return -c * (Math.sqrt(1 - (t /= d) * t) - 1) + b;
-};
+// Tests which blending modes are supported on the current system and returns a dictionary with the results.
+// For example d['source-over'] always results in true.
+function getNativeModes() {
+    if (typeof document === 'undefined') {
+        return {};
+    }
+    var i, mode, darken, ok;
+    var nativeModes = {};
+    var dCanvas = document.createElement('canvas');
+    var ctx = dCanvas.getContext('2d');
 
-g.easeOutCirc = function (t, b, c, d) {
-    return c * Math.sqrt(1 - (t = t / d - 1) * t) + b;
-};
+    if (!ctx) { return {}; }
 
-g.easeInOutCirc = function (t, b, c, d) {
-    if ((t /= d / 2) < 1) { return -c / 2 * (Math.sqrt(1 - t * t) - 1) + b; }
-    return c / 2 * (Math.sqrt(1 - (t -= 2) * t) + 1) + b;
-};
+    var native = ['source-over', 'source-in', 'source-out', 'source-atop',
+            'destination-over', 'destination-in', 'destination-out',
+            'destination-atop', 'lighter', 'darker', 'copy', 'xor'];
 
-g.easeInElastic = function (t, b, c, d) {
-    var s = 1.70158;
-    var p = 0;
-    var a = c;
-    if (t === 0) { return b; }
-    if ((t /= d) === 1) { return b + c; }
-    if (!p) p = d * 0.3;
-    if (a < Math.abs(c)) {
-        a = c;
-        s = p / 4;
-    }
-    else {
-        s = p / (2 * Math.PI) * Math.asin(c / a);
-    }
-    return -(a * Math.pow(2, 10 * (t -= 1)) * Math.sin((t * d - s) * (2 * Math.PI) / p)) + b;
-};
+    var maybeNative = ['multiply', 'screen', 'overlay', 'soft-light', 'hard-light',
+            'color-dodge', 'color-burn', 'darken', 'lighten', 'difference',
+            'exclusion', 'hue', 'saturation', 'luminosity', 'color',
+            'add', 'subtract', 'average', 'negation'];
 
-g.easeOutElastic = function (t, b, c, d) {
-    var s = 1.70158;
-    var p = 0;
-    var a = c;
-    if (t === 0) { return b; }
-    if ((t /= d) === 1) { return b + c; }
-    if (!p) p = d * 0.3;
-    if (a < Math.abs(c)) {
-        a = c;
-        s = p / 4;
-    }
-    else {
-        s = p / (2 * Math.PI) * Math.asin(c / a);
-    }
-    return a * Math.pow(2, -10 * t) * Math.sin((t * d - s) * (2 * Math.PI) / p) + c + b;
-};
+    var nonNative = ['divide', 'darker-color', 'lighter-color', 'linear-burn', 'linear-light',
+            'vivid-light', 'pin-light', 'hard-mix'];
 
-g.easeInOutElastic = function (t, b, c, d) {
-    var s = 1.70158;
-    var p = 0;
-    var a = c;
-    if (t === 0) { return b; }
-    if ((t /= d / 2) === 2) { return b + c; }
-    if (!p) p = d * (0.3 * 1.5);
-    if (a < Math.abs(c)) {
-        a = c;
-        s = p / 4;
+    for (i = 0; i < native.length; i += 1) {
+        nativeModes[native[i]] = true;
     }
-    else {
-        s = p / (2 * Math.PI) * Math.asin(c / a);
+    for (i = 0; i < nonNative.length; i += 1) {
+        nativeModes[nonNative[i]] = false;
     }
-    if (t < 1) { return -0.5 * (a * Math.pow(2, 10 * (t -= 1)) * Math.sin((t * d - s) * (2 * Math.PI) / p)) + b; }
-    return a * Math.pow(2, -10 * (t -= 1)) * Math.sin((t * d - s) * (2 * Math.PI) / p) * 0.5 + c + b;
-};
-
-g.easeInBack = function (t, b, c, d, s) {
-    if (s === undefined) {
-        s = 1.70158;
+    dCanvas.width = 1;
+    dCanvas.height = 1;
+    for (i = 0; i < maybeNative.length; i += 1) {
+        mode = maybeNative[i];
+        darken = mode === 'darken';
+        ok = false;
+        ctx.save();
+        try {
+            ctx.fillStyle = darken ? '#300' : '#a00';
+            ctx.fillRect(0, 0, 1, 1);
+            ctx.globalCompositeOperation = mode;
+            if (ctx.globalCompositeOperation === mode) {
+                ctx.fillStyle = darken ? '#a00' : '#300';
+                ctx.fillRect(0, 0, 1, 1);
+                ok = ctx.getImageData(0, 0, 1, 1).data[0] !== (darken ? 170 : 51);
+            }
+        } catch (e) {
+        }
+        ctx.restore();
+        nativeModes[mode] = ok;
     }
-    return c * (t /= d) * t * ((s + 1) * t - s) + b;
-};
 
-g.easeOutBack = function (t, b, c, d, s) {
-    if (s === undefined) {
-        s = 1.70158;
-    }
-    return c * ((t = t / d - 1) * t * ((s + 1) * t + s) + 1) + b;
-};
+    addAliases(nativeModes);
 
-g.easeInOutBack = function (t, b, c, d, s) {
-    if (s === undefined) {
-        s = 1.70158;
-    }
-    if ((t /= d / 2) < 1) { return c / 2 * (t * t * (((s *= (1.525)) + 1) * t - s)) + b; }
-    return c / 2 * ((t -= 2) * t * (((s *= (1.525)) + 1) * t + s) + 2) + b;
-};
+    return nativeModes;
+}
 
-g.easeInBounce = function (t, b, c, d) {
-    return c - g.easeOutBounce(d - t, 0, c, d) + b;
-};
+process = function (inData, outData, width, height, options) {
 
-g.easeOutBounce = function (t, b, c, d) {
-    if ((t /= d) < (1 / 2.75)) {
-        return c * (7.5625 * t * t) + b;
-    } else if (t < (2 / 2.75)) {
-        return c * (7.5625 * (t -= (1.5 / 2.75)) * t + 0.75) + b;
-    } else if (t < (2.5 / 2.75)) {
-        return c * (7.5625 * (t -= (2.25 / 2.75)) * t + 0.9375) + b;
-    } else {
-        return c * (7.5625 * (t -= (2.625 / 2.75)) * t + 0.984375) + b;
-    }
-};
+    var blend_fn,
+        sr, sg, sb, sa,
+        dr, dg, db, da,
+        or, og, ob, oa;
+    var max = Math.max;
+    var min = Math.min;
+    var div_2_255 = 2 / 255;
 
-g.easeInOutBounce = function (t, b, c, d) {
-    if (t < d / 2) { return g.easeInBounce(t * 2, 0, c, d) * 0.5 + b; }
-    return g.easeOutBounce(t * 2 - d, 0, c, d) * 0.5 + c * 0.5 + b;
-};
+    /*R = 0.299;
+     G = 0.587;
+     B = 0.114;*/
 
-g.easing = function (f) {
-    var fn = g[f];
-    var args = Array.prototype.slice.call(arguments, 1);
-    return fn.apply(null, args);
-};
+    var R = 0.2126;
+    var G = 0.7152;
+    var B = 0.0722;
 
-module.exports = g;
+    /** This is the formula used by Photoshop to convert a color from
+     * RGB (Red, Green, Blue) to HSY (Hue, Saturation, Luminosity).
+     * The hue is calculated using the exacone approximation of the saturation
+     * cone.
+     * @param rgb The input color RGB normalized components.
+     * @param hsy The output color HSY normalized components.
+     */
+    function rgbToHsy(r, g, b) {
+        r /= 255;
+        g /= 255;
+        b /= 255;
+        var h, s, y;
+
+        // For saturation equals to 0 any value of hue are valid.
+        // In this case we choose 0 as a default value.
+
+        if (r === g && g === b) {            // Limit case.
+            s = 0;
+            h = 0;
+        } else if ((r >= g) && (g >= b)) { // Sector 0: 0° - 60°
+            s = r - b;
+            h = 60 * (g - b) / s;
+        } else if ((g > r) && (r >= b)) {  // Sector 1: 60° - 120°
+            s = g - b;
+            h = 60 * (g - r) / s + 60;
+        } else if ((g >= b) && (b > r)) {  // Sector 2: 120° - 180°
+            s = g - r;
+            h = 60 * (b - r) / s + 120;
+        } else if ((b > g) && (g > r)) {   // Sector 3: 180° - 240°
+            s = b - r;
+            h = 60 * (b - g) / s + 180;
+        } else if ((b > r) && (r >= g)) {  // Sector 4: 240° - 300°
+            s = b - g;
+            h = 60 * (r - g) / s + 240;
+        } else {                           // Sector 5: 300° - 360°
+            s = r - g;
+            h = 60 * (r - b) / s + 300;
+        }
+
+        y = R * r + G * g + B * b;
+
+        // Approximations erros can cause values to exceed bounds.
+
+        return [h % 360,
+            min(max(s, 0), 1),
+            min(max(y, 0), 1)];
+    }
+
+    /**
+     * This is the formula used by Photoshop to convert a color from
+     * HSY (Hue, Saturation, Luminosity) to RGB (Red, Green, Blue).
+     * The hue is calculated using the exacone approximation of the saturation
+     * cone.
+     * @param hsy The input color HSY normalized components.
+     * @param rgb The output color RGB normalized components.
+     */
+    function hsyToRgb(h, s, y) {
 
-},{}],13:[function(require,module,exports){
-'use strict';
+        h = h % 360;
+        var r, g, b, k; // Intermediate variable.
 
-var _ = require('lodash');
-var vg = require('./vg/vg');
-var img = require('./img/img');
-var math = require('./math');
+        if (h >= 0 && h < 60) {           // Sector 0: 0° - 60°
+            k = s * h / 60;
+            b = y - R * s - G * k;
+            r = b + s;
+            g = b + k;
+        } else if (h >= 60 && h < 120) {  // Sector 1: 60° - 120°
+            k = s * (h - 60) / 60;
+            g = y + B * s + R * k;
+            b = g - s;
+            r = g - k;
+        } else if (h >= 120 && h < 180) { // Sector 2: 120° - 180°
+            k = s * (h - 120) / 60;
+            r = y - G * s - B * k;
+            g = r + s;
+            b = r + k;
+        } else if (h >= 180 && h < 240) { // Sector 3: 180° - 240°
+            k = s * (h - 180) / 60;
+            b = y + R * s + G * k;
+            r = b - s;
+            g = b - k;
+        } else if (h >= 240 && h < 300) { // Sector 4: 240° - 300°
+            k = s * (h - 240) / 60;
+            g = y - B * s - R * k;
+            b = g + s;
+            r = g + k;
+        } else {                          // Sector 5: 300° - 360°
+            k = s * (h - 300) / 60;
+            r = y + G * s + B * k;
+            g = r - s;
+            b = r - k;
+        }
 
-var g = {};
+        // Approximations erros can cause values to exceed bounds.
 
-g.HORIZONTAL = 'horizontal';
-g.VERTICAL = 'vertical';
-g.BOTH = 'both';
+        r = min(max(r, 0), 1) * 255;
+        g = min(max(g, 0), 1) * 255;
+        b = min(max(b, 0), 1) * 255;
+        return [r, g, b];
+    }
 
-g.LEFT = 'left';
-g.RIGHT = 'right';
-g.CENTER = 'center';
-g.TOP = 'top';
-g.BOTTOM = 'bottom';
-g.MIDDLE = 'middle';
+    function _sourceover() {
+        or = sr;
+        og = sg;
+        ob = sb;
+    }
 
-function clamp(val, min, max) {
-    return Math.min(max, Math.max(min, val));
-}
+    function _svg_sourceover() {
+        or = sr + dr - dr * sa;
+        og = sg + dg - dg * sa;
+        ob = sb + db - db * sa;
+    }
 
-function transformShape(shape, t) {
-    return t.transformShape(shape);
-}
+    function _multiply() {
+        or = dr * sr / 255;
+        og = dg * sg / 255;
+        ob = db * sb / 255;
+    }
 
-function transformImage(image, t) {
-    return image._transform(t.m);
-}
+    function _svg_multiply() {
+        or = sr * dr + sr * (1 - da) + dr * (1 - sa);
+        og = sg * dg + sg * (1 - da) + dg * (1 - sa);
+        ob = sb * db + sb * (1 - da) + db * (1 - sa);
+    }
 
-function transform(shape, t) {
-    if (shape instanceof vg.Path || shape instanceof vg.Group || shape instanceof vg.Text || ((shape.x !== undefined && shape.y !== undefined))) {
-        return transformShape(shape, t);
-    } else if (Array.isArray(shape)) {
-        var l = [];
-        for (var i = 0; i < shape.length; i += 1) {
-            l.push(transform(shape[i], t));
-        }
-        return l;
-    } else if (shape instanceof img.Img) {
-        return transformImage(shape, t);
+    function _subtract() {
+        or = max(dr - sr, 0);
+        og = max(dg - sg, 0);
+        ob = max(db - sb, 0);
     }
-}
 
-g.align = function (shape, position, hAlign, vAlign) {
-    if (!shape) {
-        return;
+    function _svg_subtract() {
+        or = max(dr * sa - sr * da, 0) + sr * (1 - da) + dr * (1 - sa);
+        og = max(dg * sa - sg * da, 0) + sg * (1 - da) + dg * (1 - sa);
+        ob = max(db * sa - sb * da, 0) + sb * (1 - da) + db * (1 - sa);
     }
-    var dx, dy, t,
-        x = position.x,
-        y = position.y,
-        bounds = vg.bounds(shape);
-    if (hAlign === g.LEFT) {
-        dx = x - bounds.x;
-    } else if (hAlign === g.RIGHT) {
-        dx = x - bounds.x - bounds.width;
-    } else if (hAlign === g.CENTER) {
-        dx = x - bounds.x - bounds.width / 2;
-    } else {
-        dx = 0;
+
+    function _divide() {
+        or = sr === 0 ? 0 : dr / sr * 255;
+        og = sg === 0 ? 0 : dg / sg * 255;
+        ob = sb === 0 ? 0 : db / sb * 255;
     }
-    if (vAlign === g.TOP) {
-        dy = y - bounds.y;
-    } else if (vAlign === g.BOTTOM) {
-        dy = y - bounds.y - bounds.height;
-    } else if (vAlign === g.MIDDLE) {
-        dy = y - bounds.y - bounds.height / 2;
-    } else {
-        dy = 0;
+
+    function _screen() {
+        or = (255 - (((255 - dr) * (255 - sr)) >> 8));
+        og = (255 - (((255 - dg) * (255 - sg)) >> 8));
+        ob = (255 - (((255 - db) * (255 - sb)) >> 8));
     }
 
-    t = new vg.Transform().translate(dx, dy);
-    return transform(shape, t);
-};
+    function _svg_screen() {
+        or = sr + dr - sr * dr;
+        og = sg + dg - sg * dg;
+        ob = sb + db - sb * db;
+    }
 
-g.colorize = function (shape, options) {
-    var args = arguments;
-    if (typeof options !== 'object' || options instanceof vg.Color) {
-        options = {};
-        if (args[1] !== undefined) { options.fill = args[1]; }
-        if (args[2] !== undefined) { options.stroke = args[2]; }
-        if (args[3] !== undefined) { options.strokeWidth = args[3]; }
+    function _lighten() {
+        or = dr > sr ? dr : sr;
+        og = dg > sg ? dg : sg;
+        ob = db > sb ? db : sb;
     }
-    if (shape instanceof vg.Path || shape instanceof vg.Group) {
-        return shape.colorize(options);
-    } else if (shape instanceof img.Img || shape instanceof vg.Text) {
-        if (options.fill || options.fill === 0) {
-            return shape.colorize(options.fill);
-        } else {
-            throw new Error('No color given');
-        }
+
+    function _svg_lighten() {
+        or = max(sr * da, dr * sa) + sr * (1 - da) + dr * (1 - sa);
+        og = max(sg * da, dg * sa) + sg * (1 - da) + dg * (1 - sa);
+        ob = max(sb * da, db * sa) + sb * (1 - da) + db * (1 - sa);
     }
-};
 
-g.copy = function (shape, copies, order, translate, rotate, scale) {
-    var i, t, j, op, fn,
-        shapes = [],
-        tx = 0,
-        ty = 0,
-        r = 0,
-        sx = 1.0,
-        sy = 1.0,
-        isListOfPoints = false;
+    function _darken() {
+        or = dr < sr ? dr : sr;
+        og = dg < sg ? dg : sg;
+        ob = db < sb ? db : sb;
+    }
 
-    if (shape instanceof vg.Path || shape instanceof vg.Group || shape instanceof vg.Text) {
-        fn = transformShape;
-    } else if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
-        isListOfPoints = true;
-        fn = transformShape;
-    } else if (shape instanceof img.Img) {
-        fn = transformImage;
+    function _svg_darken() {
+        or = min(sr * da, dr * sa) + sr * (1 - da) + dr * (1 - sa);
+        og = min(sg * da, dg * sa) + sg * (1 - da) + dg * (1 - sa);
+        ob = min(sb * da, db * sa) + sb * (1 - da) + db * (1 - sa);
     }
 
-    for (i = 0; i < copies; i += 1) {
-        t = new vg.Transform();
-        for (j = 0; j < order.length; j += 1) {
-            op = order[j];
-            if (op === 't') {
-                t = t.translate(tx, ty);
-            } else if (op === 'r') {
-                t = t.rotate(r);
-            } else if (op === 's') {
-                t = t.scale(sx, sy);
-            }
-        }
-        if (isListOfPoints) {
-            shapes = shapes.concat(fn(shape, t));
+    function _darkercolor() {
+        if (dr * 0.3 + dg * 0.59 + db * 0.11 <= sr * 0.3 + sg * 0.59 + sb * 0.11) {
+            or = dr;
+            og = dg;
+            ob = db;
         } else {
-            shapes.push(fn(shape, t));
+            or = sr;
+            og = sg;
+            ob = sb;
         }
-
-        tx += translate.x;
-        ty += translate.y;
-        r += rotate;
-        sx += scale.x;
-        sy += scale.y;
     }
-    return shapes;
-};
 
-g.flip = function (shape, axis) {
-    if (axis === 'none') { return shape; }
-    if (shape instanceof vg.Path || shape instanceof vg.Group || shape instanceof vg.Text || (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined)) {
-        var x = axis === g.HORIZONTAL || axis === g.BOTH ? -1 : 1;
-        var y = axis === g.VERTICAL || axis === g.BOTH ? -1 : 1;
-        return vg.scale(shape, new vg.Point(x, y), vg.centerPoint(shape));
-    } else if (shape instanceof img.Img) {
-        var image = shape;
-        var layer = image.toLayer(false);
-        if (axis === g.HORIZONTAL || axis === g.BOTH) {
-            layer.flipHorizontal();
+    function _svg_darkercolor() {
+        if (dr * sa * 0.3 + dg * sa * 0.59 + db * sa * 0.11 <= sr * da * 0.3 + sg * da * 0.59 + sb * da * 0.11) {
+            or = dr * sa;
+            og = dg * sa;
+            ob = db * sa;
+        } else {
+            or = sr * da;
+            og = sg * da;
+            ob = sb * da;
         }
-        if (axis === g.VERTICAL || axis === g.BOTH) {
-            layer.flipVertical();
+        or += sr * (1 - da) + dr * (1 - sa);
+        og += sg * (1 - da) + dg * (1 - sa);
+        ob += sb * (1 - da) + db * (1 - sa);
+    }
+
+    function _lightercolor() {
+        if (dr * 0.3 + dg * 0.59 + db * 0.11 > sr * 0.3 + sg * 0.59 + sb * 0.11) {
+            or = dr;
+            og = dg;
+            ob = db;
+        } else {
+            or = sr;
+            og = sg;
+            ob = sb;
         }
-        return image.withCanvas(layer.toCanvas());
     }
-};
 
-g.fit = function (shape, position, width, height, stretch) {
-    if (!shape) {
-        return;
+    function _svg_lightercolor() {
+        if (dr * sa * 0.3 + dg * sa * 0.59 + db * sa * 0.11 > sr * da * 0.3 + sg * da * 0.59 + sb * da * 0.11) {
+            or = dr * sa;
+            og = dg * sa;
+            ob = db * sa;
+        } else {
+            or = sr * da;
+            og = sg * da;
+            ob = sb * da;
+        }
+        or += sr * (1 - da) + dr * (1 - sa);
+        og += sg * (1 - da) + dg * (1 - sa);
+        ob += sb * (1 - da) + db * (1 - sa);
     }
-    stretch = stretch !== undefined ? stretch : false;
-    var t, sx, sy,
-        bounds = vg.bounds(shape),
-        bx = bounds.x,
-        by = bounds.y,
-        bw = bounds.width,
-        bh = bounds.height;
-
-    // Make sure bw and bh aren't infinitely small numbers.
-    // This will lead to incorrect transformations with for examples lines.
-    bw = (bw > 0.000000000001) ? bw : 0;
-    bh = (bh > 0.000000000001) ? bh : 0;
 
-    t = new vg.Transform();
-    t = t.translate(position.x, position.y);
-
-    if (!stretch) {
-        // don't scale widths or heights that are equal to zero.
-        sx = (bw > 0) ? (width / bw) : Number.MAX_VALUE;
-        sy = (bh > 0) ? (height / bh) : Number.MAX_VALUE;
-        sx = sy = Math.min(sx, sy);
-    } else {
-        sx = (bw > 0) ? (width / bw) : 1;
-        sy = (bh > 0) ? (height / bh) : 1;
+    function _add() { // also known as linear dodge
+        or = min(dr + sr, 255);
+        og = min(dg + sg, 255);
+        ob = min(db + sb, 255);
     }
 
-    t = t.scale(sx, sy);
-    t = t.translate(-bw / 2 - bx, -bh / 2 - by);
-    return transform(shape, t);
-};
+    function _linearburn() {
+        or = dr + sr;
+        og = dg + sg;
+        ob = db + sb;
 
-g.fitTo = function (shape, bounding, stretch) {
-    if (!shape) {
-        return;
-    }
-    if (!bounding) {
-        return shape;
+        or = or < 255 ? 0 : (or - 255);
+        og = og < 255 ? 0 : (og - 255);
+        ob = ob < 255 ? 0 : (ob - 255);
     }
 
-    var bounds = vg.bounds(bounding),
-        bx = bounds.x,
-        by = bounds.y,
-        bw = bounds.width,
-        bh = bounds.height;
+    function _difference() {
+        or = dr - sr;
+        og = dg - sg;
+        ob = db - sb;
 
-    return g.fit(shape, {x: bx + bw / 2, y: by + bh / 2}, bw, bh, stretch);
-};
+        or = or < 0 ? -or : or;
+        og = og < 0 ? -og : og;
+        ob = ob < 0 ? -ob : ob;
+    }
 
-g.hslAdjust = function (v, hue, saturation, lightness, alpha) {
-    if (!alpha) { alpha = 0; }
+    function _svg_difference() {
+        or = sr + dr - 2 * min(sr * da, dr * sa);
+        og = sg + dg - 2 * min(sg * da, dg * sa);
+        ob = sb + db - 2 * min(sb * da, db * sa);
+    }
 
-    // First, handle the image case.
-    if (v instanceof img.Img) {
-        var image = v;
-        var layer = image.toLayer(false);
-        layer.addFilter('hslAdjust', {h: hue, s: saturation, l: lightness, a: alpha});
-        return image.withCanvas(layer.toCanvas());
+    function _exclusion() {
+        or = dr - (dr * div_2_255 - 1) * sr;
+        og = dg - (dg * div_2_255 - 1) * sg;
+        ob = db - (db * div_2_255 - 1) * sb;
     }
 
-    hue = clamp(hue, -1, 1);
-    saturation = clamp(saturation, -1, 1);
-    lightness = clamp(lightness, -1, 1);
-    alpha = clamp(alpha, -1, 1);
-    var satMul = 1 + saturation * (saturation < 0 ? 1 : 2);
-    var lightMul = lightness < 0 ? 1 + lightness : 1 - lightness;
-    var lightAdd = lightness < 0 ? 0 : lightness;
-    var r, g, b, vs, ms, vm, h, s, l, m, vmh, sextant;
-    hue = (hue * 6) % 6;
+    function _svg_exclusion() {
+        or = sr * da + dr * sa - 2 * sr * dr + sr * (1 - da) + dr * (1 - sa);
+        og = sg * da + dg * sa - 2 * sg * dg + sg * (1 - da) + dg * (1 - sa);
+        ob = sb * da + db * sa - 2 * sb * db + sb * (1 - da) + db * (1 - sa);
+    }
 
-    function hslAdjust(v1) {
-        if (v1 instanceof vg.Group) {
-            var newShapes = [];
-            for (var i = 0; i < v1.shapes.length; i += 1) {
-                newShapes.push(hslAdjust(v1.shapes[i]));
-            }
-            return new vg.Group(newShapes);
-        } else if (v1 instanceof vg.Path) {
-            var p = v1.clone();
-            p.fill = hslAdjust(p.fill);
-            p.stroke = hslAdjust(p.stroke);
-            return p;
+    function _overlay() {
+        if (dr < 128) {
+            or = sr * dr * div_2_255;
+        } else {
+            or = 255 - (255 - sr) * (255 - dr) * div_2_255;
         }
-        var c = v1;
-        if (!(c instanceof vg.Color)) {
-            c = vg.Color.parse(c);
+
+        if (dg < 128) {
+            og = sg * dg * div_2_255;
+        } else {
+            og = 255 - (255 - sg) * (255 - dg) * div_2_255;
         }
 
-        r = c.r;
-        g = c.g;
-        b = c.b;
+        if (db < 128) {
+            ob = sb * db * div_2_255;
+        } else {
+            ob = 255 - (255 - sb) * (255 - db) * div_2_255;
+        }
+    }
 
-        if (hue !== 0 || saturation !== 0) {
-            // ok, here comes rgb to hsl + adjust + hsl to rgb, all in one jumbled mess.
-            // It's not so pretty, but it's been optimized to get somewhat decent performance.
-            // The transforms were originally adapted from the ones found in Graphics Gems, but have been heavily modified.
-            vs = r;
-            if (g > vs) {
-                vs = g;
-            }
-            if (b > vs) {
-                vs = b;
-            }
-            ms = r;
-            if (g < ms) {
-                ms = g;
-            }
-            if (b < ms) {
-                ms = b;
-            }
-            vm = vs - ms;
-            l = (ms + vs) / 2;
+    function _svg_overlay() {
+        if (2 * dr <= da) {
+            or = 2 * sr * dr + sr * (1 - da) + dr * (1 - sa);
+        } else {
+            or = sr * (1 + da) + dr * (1 + sa) - 2 * dr * sr - da * sa;
+        }
+        if (2 * dg <= da) {
+            og = 2 * sg * dg + sg * (1 - da) + dg * (1 - sa);
+        } else {
+            og = sg * (1 + da) + dg * (1 + sa) - 2 * dg * sg - da * sa;
+        }
+        if (2 * db <= da) {
+            ob = 2 * sb * db + sb * (1 - da) + db * (1 - sa);
+        } else {
+            ob = sb * (1 + da) + db * (1 + sa) - 2 * db * sb - da * sa;
+        }
+    }
 
-            if (l > 0 && vm > 0) {
-                if (l <= 0.5) {
-                    s = vm / (vs + ms) * satMul;
-                    if (s > 1) {
-                        s = 1;
-                    }
-                    v = (l * (1 + s));
-                } else {
-                    s = vm / (2 - vs - ms) * satMul;
-                    if (s > 1) {
-                        s = 1;
-                    }
-                    v = (l + s - l * s);
-                }
-                if (r === vs) {
-                    if (g === ms) {
-                        h = 5 + ((vs - b) / vm) + hue;
-                    } else {
-                        h = 1 - ((vs - g) / vm) + hue;
-                    }
-                } else if (g === vs) {
-                    if (b === ms) {
-                        h = 1 + ((vs - r) / vm) + hue;
-                    } else {
-                        h = 3 - ((vs - b) / vm) + hue;
-                    }
-                } else {
-                    if (r === ms) {
-                        h = 3 + ((vs - g) / vm) + hue;
-                    } else {
-                        h = 5 - ((vs - r) / vm) + hue;
-                    }
-                }
-                if (h < 0) {
-                    h += 6;
-                }
-                if (h >= 6) {
-                    h -= 6;
-                }
-                m = (l + l - v);
-                sextant = h >> 0;
-                vmh = (v - m) * (h - sextant);
-                if (sextant === 0) {
-                    r = v;
-                    g = m + vmh;
-                    b = m;
-                } else if (sextant === 1) {
-                    r = v - vmh;
-                    g = v;
-                    b = m;
-                } else if (sextant === 2) {
-                    r = m;
-                    g = v;
-                    b = m + vmh;
-                } else if (sextant === 3) {
-                    r = m;
-                    g = v - vmh;
-                    b = v;
-                } else if (sextant === 4) {
-                    r = m + vmh;
-                    g = m;
-                    b = v;
-                } else if (sextant === 5) {
-                    r = v;
-                    g = m;
-                    b = v - vmh;
-                }
-            }
+    function _softlight() {
+        if (dr < 128) {
+            or = ((sr >> 1) + 64) * dr * div_2_255;
+        } else {
+            or = 255 - (191 - (sr >> 1)) * (255 - dr) * div_2_255;
         }
 
-        r = r * lightMul + lightAdd;
-        g = g * lightMul + lightAdd;
-        b = b * lightMul + lightAdd;
-
-        if (r < 0) { r = 0; }
-        if (g < 0) { g = 0; }
-        if (b < 0) { b = 0; }
-        if (r > 1) { r = 1; }
-        if (g > 1) { g = 1; }
-        if (b > 1) { b = 1; }
+        if (dg < 128) {
+            og = ((sg >> 1) + 64) * dg * div_2_255;
+        } else {
+            og = 255 - (191 - (sg >> 1)) * (255 - dg) * div_2_255;
+        }
 
-        return new vg.Color(r, g, b, c.a + alpha);
+        if (db < 128) {
+            ob = ((sb >> 1) + 64) * db * div_2_255;
+        } else {
+            ob = 255 - (191 - (sb >> 1)) * (255 - db) * div_2_255;
+        }
     }
-    return hslAdjust(v);
-};
 
-g.rgbAdjust = function (v, red, green, blue, alpha) {
-    if (!alpha) { alpha = 0; }
-    red = clamp(red, -1, 1);
-    green = clamp(green, -1, 1);
-    blue = clamp(blue, -1, 1);
-    alpha = clamp(alpha, -1, 1);
+    function _svg_softlight() {
+        var m;
+        var pow = Math.pow;
 
-    function rgbAdjust(v) {
-        if (v instanceof img.Img) {
-            var image = v;
-            var layer = image.toLayer(false);
-            layer.addFilter('rgbAdjust', {r: red, g: green, b: blue, a: alpha});
-            return image.withCanvas(layer.toCanvas());
-        } else if (v instanceof vg.Group) {
-            var newShapes = [];
-            for (var i = 0; i < v.shapes.length; i += 1) {
-                newShapes.push(rgbAdjust(v.shapes[i]));
-            }
-            return new vg.Group(newShapes);
-        } else if (v instanceof vg.Path) {
-            var p = v.clone();
-            p.fill = rgbAdjust(p.fill);
-            p.stroke = rgbAdjust(p.stroke);
-            return p;
+        if (0.0 === da) {
+            or = sr;
+            og = sg;
+            ob = sb;
+            return;
         }
-        var c = v;
-        if (!(c instanceof vg.Color)) {
-            c = vg.Color.parse(c);
+
+        m = dr / da;
+        if (2 * sr <= sa) {
+            or = dr * (sa + (2 * sr - sa) * (1 - m)) + sr * (1 - da) + dr * (1 - sa);
+        } else if (2 * sr > sa && 4 * dr <= da) {
+            or = da * (2 * sr - sa) * (16 * pow(m, 3) - 12 * pow(m, 2) - 3 * m) + sr - sr * da + dr;
+        } else if (2 * sr > sa && 4 * dr > da) {
+            or = da * (2 * sr - sa) * (pow(m, 0.5) - m) + sr - sr * da + dr;
         }
-        return new vg.Color(c.r + red, c.g + green, c.b + blue, c.a + alpha);
-    }
-    return rgbAdjust(v);
-};
 
-g.stack = function (shapes, direction, margin) {
-    if (!shapes) {
-        return [];
-    }
-    if (shapes.length <= 1) {
-        return shapes;
+        m = dg / da;
+        if (2 * sg <= sa) {
+            og = dg * (sa + (2 * sg - sa) * (1 - m)) + sg * (1 - da) + dg * (1 - sa);
+        } else if (2 * sg > sa && 4 * dg <= da) {
+            og = da * (2 * sg - sa) * (16 * pow(m, 3) - 12 * pow(m, 2) - 3 * m) + sg - sg * da + dg;
+        } else if (2 * sg > sa && 4 * dg > da) {
+            og = da * (2 * sg - sa) * (pow(m, 0.5) - m) + sg - sg * da + dg;
+        }
+
+        m = db / da;
+        if (2 * sb <= sa) {
+            ob = db * (sa + (2 * sb - sa) * (1 - m)) + sb * (1 - da) + db * (1 - sa);
+        } else if (2 * sb > sa && 4 * db <= da) {
+            ob = da * (2 * sb - sa) * (16 * pow(m, 3) - 12 * pow(m, 2) - 3 * m) + sb - sb * da + db;
+        } else if (2 * sb > sa && 4 * db > da) {
+            ob = da * (2 * sb - sa) * (pow(m, 0.5) - m) + sb - sb * da + db;
+        }
     }
 
-    var tx, ty, t, bounds,
-        firstBounds = shapes[0].bounds(),
-        newShapes = [];
+    function _hardlight() {
+        if (sr < 128) {
+            or = dr * sr * div_2_255;
+        } else {
+            or = 255 - (255 - dr) * (255 - sr) * div_2_255;
+        }
 
-    if (direction === 'e') {
-        tx = firstBounds.x;
-        _.each(shapes, function (shape) {
-            bounds = shape.bounds();
-            t = new vg.Transform().translate(tx - bounds.x, 0);
-            newShapes.push(transform(shape, t));
-            tx += bounds.width + margin;
-        });
-    } else if (direction === 'w') {
-        tx = firstBounds.x + firstBounds.width;
-        _.each(shapes, function (shape) {
-            bounds = shape.bounds();
-            t = new vg.Transform().translate(tx - (bounds.x + bounds.width), 0);
-            newShapes.push(transform(shape, t));
-            tx -= bounds.width + margin;
-        });
-    } else if (direction === 'n') {
-        ty = firstBounds.y + firstBounds.height;
-        _.each(shapes, function (shape) {
-            bounds = shape.bounds();
-            t = new vg.Transform().translate(0, ty - (bounds.y + bounds.height));
-            newShapes.push(transform(shape, t));
-            ty -= bounds.height + margin;
-        });
-    } else if (direction === 's') {
-        ty = firstBounds.y;
-        _.each(shapes, function (shape) {
-            bounds = shape.bounds();
-            t = new vg.Transform().translate(0, ty - bounds.y);
-            newShapes.push(transform(shape, t));
-            ty += bounds.height + margin;
-        });
-    }
-    return newShapes;
-};
+        if (sg < 128) {
+            og = dg * sg * div_2_255;
+        } else {
+            og = 255 - (255 - dg) * (255 - sg) * div_2_255;
+        }
 
-g.angle = function (point1, point2) {
-    var args = arguments;
-    if (args.length === 4) {
-        point1 = vg.Point.read(args[0], args[1]);
-        point2 = vg.Point.read(args[2], args[3]);
-    } else {
-        point1 = vg.Point.read(point1);
-        point2 = vg.Point.read(point2);
+        if (sb < 128) {
+            ob = db * sb * div_2_255;
+        } else {
+            ob = 255 - (255 - db) * (255 - sb) * div_2_255;
+        }
     }
-    return math.degrees(Math.atan2(point2.y - point1.y, point2.x - point1.x));
-};
 
-g.coordinates = function (point, angle, distance) {
-    var args = arguments;
-    if (args.length === 4) {
-        point = vg.Point.read(args[0], args[1]);
-        angle = args[2];
-        distance = args[3];
-    } else {
-        point = vg.Point.read(point);
-    }
-    return vg.geo.coordinates(point.x, point.y, angle, distance);
-};
+    function _svg_hardlight() {
+        if (2 * sr <= sa) {
+            or = 2 * sr * dr + sr * (1 - da) + dr * (1 - sa);
+        } else {
+            or = sr * (1 + da) + dr * (1 + sa) - sa * da - 2 * sr * dr;
+        }
 
-g.distance = function (point1, point2) {
-    var args = arguments;
-    if (args.length === 4) {
-        point1 = vg.Point.read(args[0], args[1]);
-        point2 = vg.Point.read(args[2], args[3]);
-    } else {
-        point1 = vg.Point.read(point1);
-        point2 = vg.Point.read(point2);
+        if (2 * sg <= sa) {
+            og = 2 * sg * dg + sg * (1 - da) + dg * (1 - sa);
+        } else {
+            og = sg * (1 + da) + dg * (1 + sa) - sa * da - 2 * sg * dg;
+        }
+
+        if (2 * sb <= sa) {
+            ob = 2 * sb * db + sb * (1 - da) + db * (1 - sa);
+        } else {
+            ob = sb * (1 + da) + db * (1 + sa) - sa * da - 2 * sb * db;
+        }
     }
-    return Math.sqrt(Math.pow(point2.x - point1.x, 2) + Math.pow(point2.y - point1.y, 2));
-};
 
-g.grayColor = function (gray, alpha) {
-    if (!alpha && alpha !== 0) { alpha = 1; }
-    return vg.Color.gray(gray, alpha, 1.0);
-};
+    function _colordodge() {
+        var dr1 = (dr << 8) / (255 - sr);
+        var dg1 = (dg << 8) / (255 - sg);
+        var db1 = (db << 8) / (255 - sb);
 
-g.hexColor = function (s) {
-    function isNumeric(n) {
-        return !isNaN(parseFloat(n)) && isFinite(n);
+        or = (dr1 > 255 || sr === 255) ? 255 : dr1;
+        og = (dg1 > 255 || sg === 255) ? 255 : dg1;
+        ob = (db1 > 255 || sb === 255) ? 255 : db1;
     }
-    if (isNumeric(s)) {
-        s = s.toString(16);
-    } else {
-        s = String(s);
+
+    function _svg_colordodge() {
+        if (da === 0) {
+            or = sr;
+            og = sg;
+            ob = sb;
+            return;
+        }
+
+        if (sr === sa && dr === 0) {
+            or = sr * (1 - da);
+        } else if (sr === sa) {
+            or = sa * da + sr * (1 - da) + dr * (1 - sa);
+        } else if (sr < sa) {
+            or = sa * da * min(1, dr / da * sa / (sa - sr)) + sr * (1 - da) + dr * (1 - sa);
+        }
+
+        if (sg === sa && dg === 0) {
+            og = sg * (1 - da);
+        } else if (sr === sa) {
+            og = sa * da + sg * (1 - da) + dg * (1 - sa);
+        } else if (sr < sa) {
+            og = sa * da * min(1, dg / da * sa / (sa - sg)) + sg * (1 - da) + dg * (1 - sa);
+        }
+
+        if (sb === sa && db === 0) {
+            ob = sb * (1 - da);
+        } else if (sr === sa) {
+            ob = sa * da + sb * (1 - da) + db * (1 - sa);
+        } else if (sr < sa) {
+            ob = sa * da * min(1, db / da * sa / (sa - sb)) + sb * (1 - da) + db * (1 - sa);
+        }
     }
-    if (s[0] !== '#') {
-        s = '#' + s;
+
+    function _colorburn() {
+        var dr1 = 255 - ((255 - dr) << 8) / sr;
+        var dg1 = 255 - ((255 - dg) << 8) / sg;
+        var db1 = 255 - ((255 - db) << 8) / sb;
+
+        or = (dr1 < 0 || sr === 0) ? 0 : dr1;
+        og = (dg1 < 0 || sg === 0) ? 0 : dg1;
+        ob = (db1 < 0 || sb === 0) ? 0 : db1;
     }
-    return vg.Color.parse(s);
-};
 
-g.hslColor = function (hue, saturation, lightness, alpha) {
-    if (!alpha && alpha !== 0) { alpha = 1; }
-    return vg.Color.hsl(hue, saturation, lightness, alpha, 1.0);
-};
+    function _svg_colorburn() {
+        if (da === 0) {
+            or = sr;
+            og = sg;
+            ob = sb;
+            return;
+        }
 
-g.rgbColor = function (red, green, blue, alpha) {
-    if (!alpha && alpha !== 0) { alpha = 1; }
-    return vg.Color.rgb(red, green, blue, alpha, 1.0);
-};
+        if (sr === 0 && dr === da) {
+            or = sa * da + dr * (1 - sa);
+        } else if (sr === 0) {
+            or = dr * (1 - sa);
+        } else if (sr > 0) {
+            or = sa * da * (1 - min(1, (1 - dr / da) * sa / sr)) + sr * (1 - da) + dr * (1 - sa);
+        }
 
-g.desaturate = function (shape, method) {
-    if (!shape) { return null; }
-    return shape.desaturate({method: method});
-};
+        if (sg === 0 && dg === da) {
+            og = sa * da + dg * (1 - sa);
+        } else if (sg === 0) {
+            og = dg * (1 - sa);
+        } else if (sg > 0) {
+            og = sa * da * (1 - min(1, (1 - dg / da) * sa / sg)) + sg * (1 - da) + dg * (1 - sa);
+        }
 
-g.invert = function (shape) {
-    if (!shape) { return null; }
-    if (shape instanceof img.Img) {
-        var image = shape;
-        var layer = image.toLayer(false);
-        layer.addFilter('invert');
-        return image.withCanvas(layer.toCanvas());
+        if (sb === 0 && db === da) {
+            ob = sa * da + db * (1 - sa);
+        } else if (sb === 0) {
+            ob = db * (1 - sa);
+        } else if (sb > 0) {
+            ob = sa * da * (1 - min(1, (1 - db / da) * sa / sb)) + sb * (1 - da) + db * (1 - sa);
+        }
     }
-    return shape.invert();
-};
 
-module.exports = g;
+    function _linearlight() {
+        var dr1 = 2 * sr + dr - 256;
+        var dg1 = 2 * sg + dg - 256;
+        var db1 = 2 * sb + db - 256;
 
-},{"./img/img":18,"./math":22,"./vg/vg":45,"lodash":3}],14:[function(require,module,exports){
-'use strict';
+        or = (dr1 < 0 || (sr < 128 && dr1 < 0)) ? 0 : (dr1 > 255 ? 255 : dr1);
+        og = (dg1 < 0 || (sg < 128 && dg1 < 0)) ? 0 : (dg1 > 255 ? 255 : dg1);
+        ob = (db1 < 0 || (sb < 128 && db1 < 0)) ? 0 : (db1 > 255 ? 255 : db1);
+    }
 
-var vg = require('./vg/vg');
-var img = require('./img/img');
+    function _vividlight() {
+        var a;
 
-var Img = img.Img;
-var Layer = img.Layer;
-var ImageCanvas = img.ImageCanvas;
-var g = {};
+        if (sr < 128) {
+            if (sr) {
+                a = 255 - ((255 - dr) << 8) / (2 * sr);
+                or = a < 0 ? 0 : a;
+            } else {
+                or = 0;
+            }
+        } else {
+            a = 2 * sr - 256;
+            if (a < 255) {
+                a = (dr << 8) / (255 - a);
+                or = a > 255 ? 255 : a;
+            } else {
+                or = a < 0 ? 0 : a;
+            }
+        }
 
-g.blend = function (image1, image2, mode) {
-    var b1 = image1.bounds();
-    var b2 = image2.bounds();
+        if (sg < 128) {
+            if (sg) {
+                a = 255 - ((255 - dg) << 8) / (2 * sg);
+                og = a < 0 ? 0 : a;
+            } else {
+                og = 0;
+            }
+        } else {
+            a = 2 * sg - 256;
+            if (a < 255) {
+                a = (dg << 8) / (255 - a);
+                og = a > 255 ? 255 : a;
+            } else {
+                og = a < 0 ? 0 : a;
+            }
+        }
 
-    var b = new vg.Rect(b1.x, b1.y, b1.width, b1.height).unite(b2);
-    var width = Math.ceil(b.width);
-    var height = Math.ceil(b.height);
-    var dx = width / 2 + b.x;
-    var dy = height / 2 + b.y;
+        if (sb < 128) {
+            if (sb) {
+                a = 255 - ((255 - db) << 8) / (2 * sb);
+                ob = a < 0 ? 0 : a;
+            } else {
+                ob = 0;
+            }
+        } else {
+            a = 2 * sb - 256;
+            if (a < 255) {
+                a = (db << 8) / (255 - a);
+                ob = a > 255 ? 255 : a;
+            } else {
+                ob = a < 0 ? 0 : a;
+            }
+        }
+    }
 
-    var canvas = new ImageCanvas(width, height);
-    var l1 = canvas.addLayer(image1.toLayer());
-    l1.translate(-dx, -dy);
-    var l2 = canvas.addLayer(image2.toLayer());
-    l2.translate(-dx, -dy);
-    l2.blendmode = mode;
-    return new Img(canvas.render(), dx, dy);
-};
+    function _pinlight() {
+        var a;
 
-g.blur = function (image, radius) {
-    var layer = image.toLayer(false);
-    layer.addFilter('blur', {radius: radius});
-    return image.withCanvas(layer.toCanvas());
-};
+        if (sr < 128) {
+            a = 2 * sr;
+            or = dr < a ? dr : a;
+        } else {
+            a = 2 * sr - 256;
+            or = dr > a ? dr : a;
+        }
 
-g.brighten = function (image, brightness, contrast) {
-    var layer = image.toLayer(false);
-    layer.addFilter('brightness', {brightness: brightness / 100, contrast: contrast / 100});
-    return image.withCanvas(layer.toCanvas());
-};
+        if (sg < 128) {
+            a = 2 * sg;
+            og = dg < a ? dg : a;
+        } else {
+            a = 2 * sg - 256;
+            og = dg > a ? dg : a;
+        }
 
-g.bump = function (image, position, radius, zoom) {
-    var layer = image.toLayer(false);
-    layer.addFilter('bump', {dx: position.x, dy: position.y, radius: radius, zoom: zoom / 100});
-    return image.withCanvas(layer.toCanvas());
-};
+        if (sb < 128) {
+            a = 2 * sb;
+            ob = db < a ? db : a;
+        } else {
+            a = 2 * sb - 256;
+            ob = db > a ? db : a;
+        }
+    }
 
-g.colorImage = function (width, height, color) {
-    var layer = Layer.fromColor(color);
-    layer.width = width;
-    layer.height = height;
-    return new Img(layer.toCanvas());
-};
+    function _hardmix() {
+        var a;
 
-g.crop = function (image, bounding) {
-    return image.crop(bounding);
-};
+        if (sr < 128) {
+            or = (255 - ((255 - dr) << 8) / (2 * sr) < 128 || sr === 0) ? 0 : 255;
+        } else {
+            a = 2 * sr - 256;
+            or = (a < 255 && (dr << 8) / (255 - a) < 128) ? 0 : 255;
+        }
 
-g.crossEdges = function (image, strength) {
-    var layer = image.toLayer(false);
-    layer.addFilter('crossedges', {strength: strength / 100});
-    return image.withCanvas(layer.toCanvas());
-};
+        if (sg < 128) {
+            og = (255 - ((255 - dg) << 8) / (2 * sg) < 128 || sg === 0) ? 0 : 255;
+        } else {
+            a = 2 * sg - 256;
+            og = (a < 255 && (dg << 8) / (255 - a) < 128) ? 0 : 255;
+        }
 
-g.dent = function (image, position, radius, zoom) {
-    var layer = image.toLayer(false);
-    layer.addFilter('dent', {dx: position.x, dy: position.y, radius: radius, zoom: zoom / 100});
-    return image.withCanvas(layer.toCanvas());
-};
+        if (sb < 128) {
+            ob = (255 - ((255 - db) << 8) / (2 * sb) < 128 || sb === 0) ? 0 : 255;
+        } else {
+            a = 2 * sb - 256;
+            ob = (a < 255 && (db << 8) / (255 - a) < 128) ? 0 : 255;
+        }
+    }
 
-g.emboss = function (image, amount, angle) {
-    var layer = image.toLayer(false);
-    layer.addFilter('emboss', {amount: amount / 100, angle: angle});
-    return image.withCanvas(layer.toCanvas());
-};
+    function _hue() {
+        var hcl1 = rgbToHsy(dr, dg, db);
+        var hcl2 = rgbToHsy(sr, sg, sb);
+        var rgb = hsyToRgb(hcl2[0], hcl1[1], hcl1[2]);
+        or = rgb[0];
+        og = rgb[1];
+        ob = rgb[2];
+    }
 
-g.equalize = function (image) {
-    var layer = image.toLayer(false);
-    layer.addFilter('equalize');
-    return image.withCanvas(layer.toCanvas());
-};
+    function _saturation() {
+        var hcl1 = rgbToHsy(dr, dg, db);
+        var hcl2 = rgbToHsy(sr, sg, sb);
+        var rgb = hsyToRgb(hcl1[0], hcl2[1], hcl1[2]);
+        or = rgb[0];
+        og = rgb[1];
+        ob = rgb[2];
+    }
 
-g.findEdges = function (image) {
-    var layer = image.toLayer(false);
-    layer.addFilter('findedges');
-    return image.withCanvas(layer.toCanvas());
-};
+    function _luminosity() {
+        var hcl1 = rgbToHsy(dr, dg, db);
+        var hcl2 = rgbToHsy(sr, sg, sb);
+        var rgb = hsyToRgb(hcl1[0], hcl1[1], hcl2[2]);
+        or = rgb[0];
+        og = rgb[1];
+        ob = rgb[2];
+    }
+
+    function _color() {
+        var hcl1 = rgbToHsy(dr, dg, db);
+        var hcl2 = rgbToHsy(sr, sg, sb);
+        var rgb = hsyToRgb(hcl2[0], hcl2[1], hcl1[2]);
+        or = rgb[0];
+        og = rgb[1];
+        ob = rgb[2];
+    }
 
-g.glow = function (image, amount, kernelSize) {
-    var layer = image.toLayer(false);
-    layer.addFilter('glow', {amount: amount / 100, kernelSize: kernelSize});
-    return image.withCanvas(layer.toCanvas());
-};
+    blend_fn = {
+        'source-over': _svg_sourceover,
+        'multiply': _svg_multiply,
+        'subtract': _svg_subtract,
+        'divide': _divide,
+        'screen': _svg_screen,
+        'lighten': _svg_lighten,
+        'darken': _svg_darken,
+        'darker-color': _svg_darkercolor,
+        'lighter-color': _svg_lightercolor,
+        'add': _add,
+        'linear-burn': _linearburn,
+        'difference': _svg_difference,
+        'exclusion': _svg_exclusion,
+        'overlay': _svg_overlay,
+        'soft-light': _svg_softlight,
+        'hard-light': _svg_hardlight,
+        'color-dodge': _svg_colordodge,
+        'color-burn': _svg_colorburn,
+        'linear-light': _linearlight,
+        'vivid-light': _vividlight,
+        'pin-light': _pinlight,
+        'hard-mix': _hardmix,
+        'hue': _hue,
+        'saturation': _saturation,
+        'luminosity': _luminosity,
+        'color': _color
+    };
 
-g.gradientImage = function (width, height, startColor, endColor, type, angle, spread) {
-    var layer = Layer.fromGradient(startColor, endColor, type, angle, spread / 100);
-    layer.width = width;
-    layer.height = height;
-    return new Img(layer.toCanvas());
-};
+    function rectIntersect(r1, r2) {
+        var right1 = r1.x + r1.width;
+        var bottom1 = r1.y + r1.height;
+        var right2 = r2.x + r2.width;
+        var bottom2 = r2.y + r2.height;
 
-g.histogram = function (image, channel, relative) {
-    var pixels = image.getPixels();
-    var vals = new Array(256);
-    var i, c, pixel, comp;
-    for (i = 0; i < vals.length; i += 1) { vals[i] = 0; }
-    if (channel === 'lum') {
-        for (i = 0; i < pixels.width * pixels.height; i += 1) {
-            pixel = pixels.get(i);
-            comp = pixel[0] * 0.2125 + pixel[1] * 0.7154 + pixel[2] * 0.0721;
-            vals[Math.round(comp)] += 1;
-        }
-    } else {
-        if (channel === 'red') { c = 0; }
-        if (channel === 'green') { c = 1; }
-        if (channel === 'blue') { c = 2; }
-        if (channel === 'alpha') { c = 3; }
-        for (i = 0; i < pixels.width * pixels.height; i += 1) {
-            pixel = pixels.get(i);
-            comp = pixel[c];
-            vals[comp] += 1;
-        }
-    }
-    if (relative) {
-        for (i = 0; i < vals.length; i += 1) {
-            vals[i] /= (pixels.width * pixels.height);
-        }
+        var x = max(r1.x, r2.x);
+        var y = max(r1.y, r2.y);
+        var w = max(min(right1, right2) - x, 0);
+        var h = max(min(bottom1, bottom2) - y, 0);
+        return [x, y, w, h];
     }
-    return vals;
-};
 
-g.lightTunnel = function (image, position, radius) {
-    var layer = image.toLayer(false);
-    layer.addFilter('splash', {dx: position.x, dy: position.y, radius: radius});
-    return image.withCanvas(layer.toCanvas());
-};
+    (function () {
+        var pix, pixIn, x, y, a, a2, da2, demultiply, fBlend;
+        var data2 = options.data;
+        var opacity = options.opacity === 0 ? 0 : options.opacity || 1;
+        var fn = blend_fn[options.type || '_svg_normal'];
+        var dx = options.dx || 0;
+        var dy = options.dy || 0;
+        var ri = rectIntersect({x: 0, y: 0, width: width, height: height},
+             {x: dx, y: dy, width: options.width, height: options.height});
+        var xi = ri[0];
+        var yi = ri[1];
+        var wi = ri[2];
+        var hi = ri[3];
 
-g.luminanceBW = function (image) {
-    var layer = image.toLayer(false);
-    layer.addFilter('luminancebw');
-    return image.withCanvas(layer.toCanvas());
-};
+        function pBlend() {
+            sa = data2[pixIn + 3] / 255 * opacity;
+            da = inData[pix + 3] / 255;
+            da2 = (sa + da - sa * da);
+            demultiply = 255 / da2;
 
-g.mask = function (image, mask) {
-    image = image.transformed();
-    mask = mask.transformed();
+            sr = data2[pixIn] / 255 * sa;
+            sg = data2[pixIn + 1] / 255 * sa;
+            sb = data2[pixIn + 2] / 255 * sa;
 
-    var layer = image.toLayer(false);
-    var maskLayer = mask.toLayer();
+            dr = inData[pix] / 255 * da;
+            dg = inData[pix + 1] / 255 * da;
+            db = inData[pix + 2] / 255 * da;
 
-    var b1 = image.bounds();
-    var b2 = mask.bounds();
+            fn();
 
-    var b = new vg.Rect(b1.x, b1.y, b1.width, b1.height).unite(b2);
-    var width = Math.ceil(b.width);
-    var height = Math.ceil(b.height);
-    var dx = width / 2 + b.x;
-    var dy = height / 2 + b.y;
-    maskLayer.translate(-dx, -dy);
+            outData[pix] = or * demultiply;
+            outData[pix + 1] = og * demultiply;
+            outData[pix + 2] = ob * demultiply;
+            outData[pix + 3] = da2 * 255;
+        }
 
-    var l = layer.mask.addLayer('white');
-    l.width = layer.width;
-    l.height = layer.height;
-    layer.mask.addLayer(maskLayer);
-    return image.withCanvas(layer.toCanvas());
-};
+        function sBlend() {
+            dr = inData[pix];
+            dg = inData[pix + 1];
+            db = inData[pix + 2];
 
-g.mosaic = function (image, blockSize) {
-    var layer = image.toLayer(false);
-    layer.addFilter('mosaic', {blockSize: blockSize});
-    return image.withCanvas(layer.toCanvas());
-};
+            sr = data2[pixIn];
+            sg = data2[pixIn + 1];
+            sb = data2[pixIn + 2];
 
-g.pinch = function (image, position, zoom) {
-    var layer = image.toLayer(false);
-    layer.addFilter('pinch', {dx: position.x, dy: position.y, zoom: zoom / 100});
-    return image.withCanvas(layer.toCanvas());
-};
+            fn();
 
-g.posterize = function (image, levels) {
-    var layer = image.toLayer(false);
-    layer.addFilter('posterize', {levels: levels});
-    return image.withCanvas(layer.toCanvas());
-};
+            outData[pix] = or;
+            outData[pix + 1] = og;
+            outData[pix + 2] = ob;
+            outData[pix + 3] = inData[pix + 3];
 
-g.removeNoise = function (image) {
-    var layer = image.toLayer(false);
-    layer.addFilter('removenoise');
-    return image.withCanvas(layer.toCanvas());
-};
+            a = opacity * data2[pixIn + 3] / 255;
+            if (a < 1) {
+                a2 = 1 - a;
+                outData[pix] = (inData[pix] * a2 + outData[pix] * a);
+                outData[pix + 1] = (inData[pix + 1] * a2 + outData[pix + 1] * a);
+                outData[pix + 2] = (inData[pix + 2] * a2 + outData[pix + 2] * a);
+            }
+        }
 
-g.solarize = function (image) {
-    var layer = image.toLayer(false);
-    layer.addFilter('solarize');
-    return image.withCanvas(layer.toCanvas());
-};
+        fBlend = fn.name.indexOf('_svg_') === 0 ? pBlend : sBlend;
 
-g.toBitmap = function (shape, bounding) {
-    var canvas = document.createElement('canvas');
-    var bounds;
-    if (bounding) {
-        bounds = bounding.bounds();
-    } else {
-        bounds = shape.bounds();
-    }
-    var x = bounds.x;
-    var y = bounds.y;
-    var width = canvas.width = Math.ceil(bounds.width);
-    var height = canvas.height = Math.ceil(bounds.height);
-    var ctx = canvas.getContext('2d');
-    ctx.translate(-x, -y);
-    shape.draw(ctx);
-    return new Img(canvas, width / 2 + x, height / 2 + y);
+        for (y = 0; y < height; y += 1) {
+            for (x = 0; x < width; x += 1) {
+                pix = (y * width + x) * 4;
+                if (y >= yi && x >= xi && x < xi + wi && y < yi + hi) {
+                    pixIn = ((y - dy) * options.width + x - dx) * 4;
+                    fBlend();
+                } else {
+                    outData[pix] = inData[pix];
+                    outData[pix + 1] = inData[pix + 1];
+                    outData[pix + 2] = inData[pix + 2];
+                    outData[pix + 3] = inData[pix + 3];
+                }
+            }
+        }
+    }());
 };
 
-g.toPixels = function (image, step) {
-    step = step > 1 ? step : 1;
-    var canvas = image.canvas;
-    var imgWidth = canvas.width;
-    var imgHeight = canvas.height;
-    var ctx = canvas.getContext('2d');
-    var data = ctx.getImageData(0, 0, canvas.width, canvas.height);
-    var pixels = data.data;
-    var stride = canvas.width * 4;
+function _blend(inData, outData, width, height, options) {
+    process(inData, outData, width, height, options);
+}
 
-    var outPixels = [];
-    for (var y = 0; y < imgHeight; y += step) {
-        for (var x = 0; x < imgWidth; x += step) {
-            var offset = y * stride + x * 4;
-            var pr = pixels[offset];
-            var pg = pixels[offset + 1];
-            var pb = pixels[offset + 2];
-            var pa = pixels[offset + 3];
-            outPixels.push({
-                x: x - imgWidth / 2,
-                y: y - imgHeight / 2,
-                r: pr,
-                g: pg,
-                b: pb,
-                a: pa,
-                color: new vg.Color(pr / 255, pg / 255, pb / 255, pa / 255)
-            });
-        }
+function _wrap(type) {
+    return function (inData, outData, width, height, options) {
+        options.type = type;
+        _blend(inData, outData, width, height, options);
+    };
+}
+
+blend = (function () {
+    var mode;
+    var d = { blend: _blend };
+    var modes = ['source-over', 'add', 'multiply', 'subtract', 'divide', 'screen',
+            'lighten', 'darken', 'darker-color', 'lighter-color', 'linear-burn',
+            'difference', 'exclusion', 'overlay', 'soft-light', 'hard-light',
+            'color-dodge', 'color-burn', 'linear-light', 'vivid-light', 'pin-light',
+            'hard-mix', 'hue', 'saturation', 'luminosity', 'color'];
+    for (var i = 0; i < modes.length; i += 1) {
+        mode = modes[i];
+        d[mode] = _wrap(mode);
     }
-    return outPixels;
-};
+    modes = Object.keys(modes);
+    for (i = 0; i < modes.length; i += 1) {
 
-g.twirl = function (image, position, radius, angle) {
-    var layer = image.toLayer(false);
-    layer.addFilter('twirl', {dx: position.x, dy: position.y, radius: radius, angle: angle});
-    return image.withCanvas(layer.toCanvas());
-};
+    }
+    // Aliases for the blending modes
+    addAliases(d);
 
-module.exports = g;
+    d.getNativeModes = getNativeModes;
+    d.realBlendMode = realBlendMode;
+
+    return d;
+}());
+
+// MODULE SUPPORT ///////////////////////////////////////////////////////
+
+module.exports = blend;
 
-},{"./img/img":18,"./vg/vg":45}],15:[function(require,module,exports){
+},{}],16:[function(require,module,exports){
 'use strict';
 
-var async = require('async');
+var blend = require('./blend');
 var process = require('./process');
-var CanvasRenderer = require('./canvasrenderer');
+var util = require('./util');
 
-// Utility function that passes its input (normally a html canvas) to the next function.
-function passThrough(canvas, callback) {
-    callback(null, canvas);
+// Dictionary of blend modes that the client browser does or does not support.
+var nativeBlendModes = blend.getNativeModes();
+
+function createImageData(ctx, width, height) {
+    if (ctx.createImageData) {
+        return ctx.createImageData(width, height);
+    } else {
+        return ctx.getImageData(0, 0, width, height);
+    }
 }
 
 // RENDERING.
@@ -24293,5081 +27642,5838 @@ function passThrough(canvas, callback) {
 // which uses the HTML Canvas object (containing the pixel data) and a 2D context that
 // acts on this canvas object. In the future, a webgl renderer might be added as well.
 
-var AsyncRenderer = {};
+var CanvasRenderer = {};
 
 // Renders a html canvas as an html Image. Currently unused.
-AsyncRenderer.toImage = function () {
-    return function (canvas, callback) {
-        callback(null, CanvasRenderer.toImage(canvas));
-    };
+CanvasRenderer.toImage = function (canvas) {
+    var img = new Image();
+    img.width = canvas.width;
+    img.height = canvas.height;
+    img.src = canvas.toDataURL();
+    return img;
 };
 
-
 // 'LOADING' OF LAYERS.
 
 // Returns a html canvas dependent on the type of the layer provided.
-AsyncRenderer.load = function (iCanvas, layer) {
-    if (layer.isPath()) {
-        return AsyncRenderer.loadFile(layer.data);
-    } else if (layer.isFill()) {
-        return AsyncRenderer.generateColor(iCanvas, layer);
+CanvasRenderer.load = function (iCanvas, layer) {
+    if (layer.isFill()) {
+        return CanvasRenderer.generateColor(iCanvas, layer);
     } else if (layer.isGradient()) {
-        return AsyncRenderer.generateGradient(iCanvas, layer);
+        return CanvasRenderer.generateGradient(iCanvas, layer);
     } else if (layer.isHtmlCanvas()) {
-        return AsyncRenderer.loadHtmlCanvas(layer.data);
+        return CanvasRenderer.loadHtmlCanvas(layer.data);
     } else if (layer.isImage()) {
-        return AsyncRenderer.loadImage(layer.data);
+        return CanvasRenderer.loadImage(layer.data);
     } else if (layer.isImageCanvas()) {
-        return AsyncRenderer.loadImageCanvas(layer.data);
+        return CanvasRenderer.loadImageCanvas(layer.data);
     }
 };
 
-// Returns a html canvas from an image file location.
-AsyncRenderer.loadFile = function (src) {
-    return function (_, callback) {
-        var canvas = document.createElement('canvas');
-        var ctx = canvas.getContext('2d');
-
-        var source = new Image();
-        source.onload = function () {
-            canvas.width = source.width;
-            canvas.height = source.height;
-            ctx.drawImage(source, 0, 0, canvas.width, canvas.height);
-            callback(null, canvas);
-        };
-        source.src = src;
-    };
-};
-
 // Passes a html canvas.
-AsyncRenderer.loadHtmlCanvas = function (canvas) {
-    return function (_, callback) {
-        callback(null, canvas);
-    };
+CanvasRenderer.loadHtmlCanvas = function (canvas) {
+    return canvas;
 };
 
 // Returns a html canvas from rendering an ImageCanvas.
-AsyncRenderer.loadImageCanvas = function (iCanvas) {
-    return function (_, callback) {
-        iCanvas.render(function (canvas) {
-            callback(null, canvas);
-        });
-    };
+CanvasRenderer.loadImageCanvas = function (iCanvas) {
+    return iCanvas.render();
 };
 
 // Returns a html canvas from rendering a stored Image file.
-AsyncRenderer.loadImage = function (img) {
-    return function (_, callback) {
-        var canvas = CanvasRenderer.loadImage(img);
-        callback(null, canvas);
-    };
+CanvasRenderer.loadImage = function (img) {
+    var canvas = document.createElement('canvas');
+    var ctx = canvas.getContext('2d');
+    canvas.width = img.width;
+    canvas.height = img.height;
+    ctx.drawImage(img, 0, 0, canvas.width, canvas.height);
+    return canvas;
 };
 
 // Returns a html canvas with a solid fill color.
-AsyncRenderer.generateColor = function (iCanvas, layer) {
-    return function (_, callback) {
-        var canvas = CanvasRenderer.generateColor(iCanvas, layer);
-        callback(null, canvas);
-    };
-};
-
-// Returns a html canvas with a gradient.
-AsyncRenderer.generateGradient = function (iCanvas, layer) {
-    return function (_, callback) {
-        var canvas = CanvasRenderer.generateGradient(iCanvas, layer);
-        callback(null, canvas);
-    };
-};
-
-
-// PROCESSING OF LAYERS.
-
-// Performs a number of filtering operations on an html image.
-// This method executes on the main thread if web workers aren't available on the current system.
-AsyncRenderer.processImage = function (filters) {
-    if (filters.length === 0) {
-        return passThrough;
-    }
-
-    return function (canvas, callback) {
-        CanvasRenderer.processImage(canvas, filters);
-        callback(null, canvas);
-    };
-};
-
-// Renders the layer mask and applies it to the layer that it is supposed to mask.
-AsyncRenderer.processMask = function (mask) {
-    if (mask.layers.length === 0) {
-        return passThrough;
-    }
-    return function (canvas, callback) {
-        mask.width = canvas.width;
-        mask.height = canvas.height;
-
-        // First, make a black and white version of the masking canvas and pass
-        // the result to the masking operation.
-        AsyncRenderer.renderBW(mask, function (c) {
-            var data = c.getContext('2d').getImageData(0, 0, c.width, c.height).data;
-            var maskFilter = {name: 'mask', options: {data: data, x: 0, y: 0, width: c.width, height: c.height} };
-            var fn = AsyncRenderer.processImage([maskFilter]);
-            fn(canvas, callback);
-        });
-    };
-};
-
-// Processes a single layer. First the layer image is loaded, then a mask (if applicable) is applied to it,
-// and finally the filters (if any) are applied to it.
-function processLayers(iCanvas) {
-    return function (layer, callback) {
-        async.compose(
-            AsyncRenderer.processImage(layer.filters),
-            AsyncRenderer.processMask(layer.mask),
-            AsyncRenderer.load(iCanvas, layer)
-        )(null, callback);
-    };
-}
-
-
-// LAYER BLENDING.
-
-// Blends the subsequent layer images with the base layer and returns a single image.
-// This method is used when web workers aren't available for use on this system.
-AsyncRenderer.mergeManualBlend = function (iCanvas, layerData) {
-    return function (canvas, callback) {
-        CanvasRenderer.mergeManualBlend(iCanvas, layerData)(canvas);
-        callback(null, canvas);
-    };
-};
+CanvasRenderer.generateColor = function (iCanvas, layer) {
+    var width = layer.width !== undefined ? layer.width : iCanvas.width;
+    var height = layer.height !== undefined ? layer.height : iCanvas.height;
+    var canvas = document.createElement('canvas');
+    var ctx = canvas.getContext('2d');
 
-// Blends the subsequent layer images with the base layer and returns the resulting image.
-// This method is used when the system supports the requested blending mode(s).
-AsyncRenderer.mergeNativeBlend = function (iCanvas, layerData) {
-    return function (canvas, callback) {
-        CanvasRenderer.mergeNativeBlend(iCanvas, layerData)(canvas);
-        callback(null, canvas);
-    };
+    canvas.width = width;
+    canvas.height = height;
+    ctx.fillStyle = layer.data;
+    ctx.fillRect(0, 0, width, height);
+    return canvas;
 };
 
-// Merges the different canvas layers together in a single image and returns this as a html canvas.
-AsyncRenderer.merge = function (iCanvas, layerData, callback) {
-    var renderPipe = CanvasRenderer.createRenderPipe(AsyncRenderer, iCanvas, layerData);
-    renderPipe.reverse();
+// Returns a html canvas with a gradient.
+CanvasRenderer.generateGradient = function (iCanvas, layer) {
+    var grd, x1, y1, x2, y2;
+    var width = layer.width !== undefined ? layer.width : iCanvas.width;
+    var height = layer.height !== undefined ? layer.height : iCanvas.height;
+    var cx = width / 2;
+    var cy = height / 2;
+    var canvas = document.createElement('canvas');
+    var ctx = canvas.getContext('2d');
+    var data = layer.data;
+    var type = data.type || 'linear';
+    var rotateDegrees = data.rotation || 0;
 
-    var canvas = CanvasRenderer.singleLayerWithOpacity(iCanvas, layerData[0]);
-    renderPipe.push(function (_, cb) {
-        cb(null, canvas);
-    });
+    if (type === 'radial') {
+        grd = ctx.createRadialGradient(cx, cy, 0, cx, cy, Math.min(width, height) / 2);
+    } else {
+        // Rotation code taken from html5-canvas-gradient-creator:
+        // Website: http://victorblog.com/html5-canvas-gradient-creator/
+        // Code: https://github.com/evictor/html5-canvas-gradient-creator/blob/master/js/src/directive/previewCanvas.coffee
+        if (rotateDegrees < 0) {
+            rotateDegrees += 360;
+        }
+        if ((0 <= rotateDegrees && rotateDegrees < 45)) {
+            x1 = 0;
+            y1 = height / 2 * (45 - rotateDegrees) / 45;
+            x2 = width;
+            y2 = height - y1;
+        } else if ((45 <= rotateDegrees && rotateDegrees < 135)) {
+            x1 = width * (rotateDegrees - 45) / (135 - 45);
+            y1 = 0;
+            x2 = width - x1;
+            y2 = height;
+        } else if ((135 <= rotateDegrees && rotateDegrees < 225)) {
+            x1 = width;
+            y1 = height * (rotateDegrees - 135) / (225 - 135);
+            x2 = 0;
+            y2 = height - y1;
+        } else if ((225 <= rotateDegrees && rotateDegrees < 315)) {
+            x1 = width * (1 - (rotateDegrees - 225) / (315 - 225));
+            y1 = height;
+            x2 = width - x1;
+            y2 = 0;
+        } else if (315 <= rotateDegrees) {
+            x1 = 0;
+            y1 = height - height / 2 * (rotateDegrees - 315) / (360 - 315);
+            x2 = width;
+            y2 = height - y1;
+        }
+        grd = ctx.createLinearGradient(x1, y1, x2, y2);
+    }
+    grd.addColorStop(data.spread || 0, data.startColor);
+    grd.addColorStop(1, data.endColor);
 
-    async.compose.apply(null, renderPipe)(null, function () {
-        callback(canvas);
-    });
+    canvas.width = width;
+    canvas.height = height;
+    ctx.fillStyle = grd;
+    ctx.fillRect(0, 0, width, height);
+    return canvas;
 };
 
-AsyncRenderer.composite = function (iCanvas, layerData, callback) {
-    if (!layerData || layerData.length === 0) {
-        callback(null);
-        return;
+// PROCESSING OF LAYERS.
+
+// Performs a number of filtering operations on an html image.
+CanvasRenderer.processImage = function (canvas, filters) {
+    if (filters.length === 0) {
+        return canvas;
     }
-    if (layerData.length === 1) {
-        callback(CanvasRenderer.singleLayerWithOpacity(iCanvas, layerData[0]));
-        return;
+    var filter, tmpData;
+    var ctx = canvas.getContext('2d');
+    var width = canvas.width;
+    var height = canvas.height;
+    var inData = ctx.getImageData(0, 0, width, height);
+    var outData = createImageData(ctx, width, height);
+
+    for (var i = 0; i < filters.length; i += 1) {
+        if (i > 0) {
+            tmpData = inData;
+            inData = outData;
+            outData = tmpData;
+        }
+        filter = filters[i];
+        process[filter.name](inData.data, outData.data, width, height, filter.options);
     }
 
-    AsyncRenderer.merge(iCanvas, layerData, callback);
+    ctx.putImageData(outData, 0, 0);
+    return canvas;
 };
 
-// Renders the image canvas. Top level.
-AsyncRenderer.render = function (iCanvas, callback) {
-    async.map(iCanvas.layers,
-        processLayers(iCanvas), function (err, layerImages) {
-            if (callback) {
-                AsyncRenderer.composite(iCanvas, CanvasRenderer.getLayerData(iCanvas, layerImages), callback);
-            }
-        });
+// Renders the layer mask and applies it to the layer that it is supposed to mask.
+CanvasRenderer.processMask = function (canvas, mask) {
+    if (mask.layers.length === 0) {
+        return canvas;
+    }
+    mask.width = canvas.width;
+    mask.height = canvas.height;
+    // First, make a black and white version of the masking canvas and pass
+    // the result to the masking operation.
+    var c = CanvasRenderer.renderBW(mask);
+    var data = c.getContext('2d').getImageData(0, 0, c.width, c.height).data;
+    var maskFilter = {name: 'mask', options: {data: data, x: 0, y: 0, width: c.width, height: c.height} };
+    return CanvasRenderer.processImage(canvas, [maskFilter]);
 };
 
-// Renders the image canvas and turns it into a black and white image. Useful for rendering a layer mask.
-AsyncRenderer.renderBW = function (iCanvas, callback) {
-    AsyncRenderer.render(iCanvas, function (canvas) {
-        var data = canvas.getContext('2d').getImageData(0, 0, canvas.width, canvas.height).data;
-        var bwFilter = {name: 'desaturate', options: {method: 'ITU-R BT.709'}};
-        var fn = AsyncRenderer.processImage([bwFilter]);
-        fn(canvas, function (err, c) {
-            callback(c);
-        });
-    });
+// Processes a single layer. First the layer image is loaded, then a mask (if applicable) is applied to it,
+// and finally the filters (if any) are applied to it.
+CanvasRenderer.processLayer = function (iCanvas, layer) {
+    var layerImage = CanvasRenderer.load(iCanvas, layer);
+    var maskedImage = CanvasRenderer.processMask(layerImage, layer.mask);
+    return CanvasRenderer.processImage(maskedImage, layer.filters);
 };
 
-module.exports = AsyncRenderer;
 
-},{"./canvasrenderer":17,"./process":19,"async":1}],16:[function(require,module,exports){
-'use strict';
+// LAYER TRANFORMATIONS.
 
-var blend, process;
 
-var aliases = {
-    normal: 'source-over',
-    'linear-dodge': 'add'
-};
+// Transforms the 2d context that acts upon this layer's image. Utility function. -> Rename this?
+function transformLayer(ctx, iCanvas, layer) {
+    var m = layer.transform.matrix();
 
-function addAliases(d) {
-    var i, mode, alias;
-    var modes = Object.keys(aliases);
-    for (i = 0; i < modes.length; i += 1) {
-        mode = modes[i];
-        alias = aliases[mode];
-        d[mode] = d[alias];
+    ctx.translate(iCanvas.width / 2, iCanvas.height / 2);
+    ctx.transform(m[0], m[1], m[3], m[4], m[6], m[7]);
+    if (layer.flip_h || layer.flip_v) {
+        ctx.scale(layer.flip_h ? -1 : 1, layer.flip_v ? -1 : 1);
     }
+    ctx.translate(-layer.img.width / 2, -layer.img.height / 2);
 }
 
-function realBlendMode(mode) {
-    if (aliases[mode] !== undefined) { return aliases[mode]; }
-    return mode;
-}
-
-// Tests which blending modes are supported on the current system and returns a dictionary with the results.
-// For example d['source-over'] always results in true.
-function getNativeModes() {
-    if (typeof document === 'undefined') {
-        return {};
-    }
-    var i, mode, darken, ok;
-    var nativeModes = {};
-    var dCanvas = document.createElement('canvas');
-    var ctx = dCanvas.getContext('2d');
-
-    if (!ctx) { return {}; }
-
-    var native = ['source-over', 'source-in', 'source-out', 'source-atop',
-            'destination-over', 'destination-in', 'destination-out',
-            'destination-atop', 'lighter', 'darker', 'copy', 'xor'];
-
-    var maybeNative = ['multiply', 'screen', 'overlay', 'soft-light', 'hard-light',
-            'color-dodge', 'color-burn', 'darken', 'lighten', 'difference',
-            'exclusion', 'hue', 'saturation', 'luminosity', 'color',
-            'add', 'subtract', 'average', 'negation'];
+// Transforms the bounds of a layer (the bounding rectangle) and returns the bounding rectangle
+// that encloses this transformed rectangle.
+function transformRect(iCanvas, layer) {
+    var pt, minx, miny, maxx, maxy;
+    var width = layer.img.width;
+    var height = layer.img.height;
+    var p1 = {x: 0, y: 0};
+    var p2 = {x: width, y: 0};
+    var p3 = {x: 0, y: height};
+    var p4 = {x: width, y: height};
+    var points = [p1, p2, p3, p4];
 
-    var nonNative = ['divide', 'darker-color', 'lighter-color', 'linear-burn', 'linear-light',
-            'vivid-light', 'pin-light', 'hard-mix'];
+    var t = util.transform();
+    t = t.translate(iCanvas.width / 2, iCanvas.height / 2);
+    t = t.append(layer.transform);
+    t = t.translate(-layer.img.width / 2, -layer.img.height / 2);
 
-    for (i = 0; i < native.length; i += 1) {
-        nativeModes[native[i]] = true;
-    }
-    for (i = 0; i < nonNative.length; i += 1) {
-        nativeModes[nonNative[i]] = false;
-    }
-    dCanvas.width = 1;
-    dCanvas.height = 1;
-    for (i = 0; i < maybeNative.length; i += 1) {
-        mode = maybeNative[i];
-        darken = mode === 'darken';
-        ok = false;
-        ctx.save();
-        try {
-            ctx.fillStyle = darken ? '#300' : '#a00';
-            ctx.fillRect(0, 0, 1, 1);
-            ctx.globalCompositeOperation = mode;
-            if (ctx.globalCompositeOperation === mode) {
-                ctx.fillStyle = darken ? '#a00' : '#300';
-                ctx.fillRect(0, 0, 1, 1);
-                ok = ctx.getImageData(0, 0, 1, 1).data[0] !== (darken ? 170 : 51);
+    for (var i = 0; i < 4; i += 1) {
+        pt = t.transformPoint(points[i]);
+        if (i === 0) {
+            minx = maxx = pt.x;
+            miny = maxy = pt.y;
+        } else {
+            if (pt.x < minx) {
+                minx = pt.x;
+            }
+            if (pt.x > maxx) {
+                maxx = pt.x;
+            }
+            if (pt.y < miny) {
+                miny = pt.y;
+            }
+            if (pt.y > maxy) {
+                maxy = pt.y;
             }
-        } catch (e) {
         }
-        ctx.restore();
-        nativeModes[mode] = ok;
     }
-
-    addAliases(nativeModes);
-
-    return nativeModes;
+    return {x: minx, y: miny, width: maxx - minx, height: maxy - miny};
 }
 
-process = function (inData, outData, width, height, options) {
-
-    var blend_fn,
-        sr, sg, sb, sa,
-        dr, dg, db, da,
-        or, og, ob, oa;
-    var max = Math.max;
-    var min = Math.min;
-    var div_2_255 = 2 / 255;
+// Calculates the intersecting rectangle of two input rectangles.
+function rectIntersect(r1, r2) {
+    var right1 = r1.x + r1.width;
+    var bottom1 = r1.y + r1.height;
+    var right2 = r2.x + r2.width;
+    var bottom2 = r2.y + r2.height;
 
-    /*R = 0.299;
-     G = 0.587;
-     B = 0.114;*/
+    var x = Math.max(r1.x, r2.x);
+    var y = Math.max(r1.y, r2.y);
+    var w = Math.max(Math.min(right1, right2) - x, 0);
+    var h = Math.max(Math.min(bottom1, bottom2) - y, 0);
+    return {x: x, y: y, width: w, height: h};
+}
 
-    var R = 0.2126;
-    var G = 0.7152;
-    var B = 0.0722;
+// Calculates the mimimal area that a transformed layer needs so that it
+// can still be drawn on the canvas. Returns a rectangle.
+function calcLayerRect(iCanvas, layer) {
+    var rect = transformRect(iCanvas, layer);
+    rect = rectIntersect(rect, {x: 0, y: 0, width: iCanvas.width, height: iCanvas.height});
+    return { x: Math.round(rect.x),
+        y: Math.round(rect.y),
+        width: Math.ceil(rect.width),
+        height: Math.ceil(rect.height)};
+}
 
-    /** This is the formula used by Photoshop to convert a color from
-     * RGB (Red, Green, Blue) to HSY (Hue, Saturation, Luminosity).
-     * The hue is calculated using the exacone approximation of the saturation
-     * cone.
-     * @param rgb The input color RGB normalized components.
-     * @param hsy The output color HSY normalized components.
-     */
-    function rgbToHsy(r, g, b) {
-        r /= 255;
-        g /= 255;
-        b /= 255;
-        var h, s, y;
+// Transforms a layer and returns the resulting pixel data.
+function getTransformedLayerData(iCanvas, layer, rect) {
+    var canvas = document.createElement('canvas');
+    var ctx = canvas.getContext('2d');
+    canvas.width = rect.width;
+    canvas.height = rect.height;
+    ctx.translate(-rect.x, -rect.y);
+    transformLayer(ctx, iCanvas, layer);
+    ctx.drawImage(layer.img, 0, 0);
+    return ctx.getImageData(0, 0, rect.width, rect.height);
+}
 
-        // For saturation equals to 0 any value of hue are valid.
-        // In this case we choose 0 as a default value.
 
-        if (r === g && g === b) {            // Limit case.
-            s = 0;
-            h = 0;
-        } else if ((r >= g) && (g >= b)) { // Sector 0: 0° - 60°
-            s = r - b;
-            h = 60 * (g - b) / s;
-        } else if ((g > r) && (r >= b)) {  // Sector 1: 60° - 120°
-            s = g - b;
-            h = 60 * (g - r) / s + 60;
-        } else if ((g >= b) && (b > r)) {  // Sector 2: 120° - 180°
-            s = g - r;
-            h = 60 * (b - r) / s + 120;
-        } else if ((b > g) && (g > r)) {   // Sector 3: 180° - 240°
-            s = b - r;
-            h = 60 * (b - g) / s + 180;
-        } else if ((b > r) && (r >= g)) {  // Sector 4: 240° - 300°
-            s = b - g;
-            h = 60 * (r - g) / s + 240;
-        } else {                           // Sector 5: 300° - 360°
-            s = r - g;
-            h = 60 * (r - b) / s + 300;
+// LAYER BLENDING.
+
+// Blends the subsequent layer images with the base layer and returns a single image.
+// This method is used when web workers aren't available for use on this system.
+CanvasRenderer.mergeManualBlend = function (iCanvas, layerData) {
+    return function (canvas) {
+        var layer, blendMode, blendData, tmpData, layerOptions, rect;
+        var ctx = canvas.getContext('2d');
+        var width = iCanvas.width;
+        var height = iCanvas.height;
+        var baseData = ctx.getImageData(0, 0, width, height);
+        var outData = createImageData(ctx, width, height);
+        for (var i = 0; i < layerData.length; i += 1) {
+            layer = layerData[i];
+            rect = calcLayerRect(iCanvas, layer);
+            if (rect.width > 0 && rect.height > 0) {
+                if (i > 0) {
+                    tmpData = baseData;
+                    baseData = outData;
+                    outData = tmpData;
+                }
+                blendData = getTransformedLayerData(iCanvas, layer, rect);
+                layerOptions = {data: blendData.data, width: rect.width, height: rect.height, opacity: layer.opacity, dx: rect.x, dy: rect.y};
+                if (blend[layer.blendmode] === undefined) {
+                    throw new Error('No blend mode named \'' + layer.blendmode + '\'');
+                }
+                blendMode = blend.realBlendMode(layer.blendmode);
+                blend[blendMode](baseData.data, outData.data, width, height, layerOptions);
+            }
         }
+        ctx.putImageData(outData, 0, 0);
+        return canvas;
+    };
+};
 
-        y = R * r + G * g + B * b;
+// Renders a single layer. This is useful when there's only one layer available (and no blending is needed)
+// or to render the base layer on which subsequent layers are blended.
+CanvasRenderer.singleLayerWithOpacity = function (iCanvas, layer) {
+    var canvas = document.createElement('canvas');
+    var ctx = canvas.getContext('2d');
 
-        // Approximations erros can cause values to exceed bounds.
+    canvas.width = iCanvas.width;
+    canvas.height = iCanvas.height;
 
-        return [h % 360,
-            min(max(s, 0), 1),
-            min(max(y, 0), 1)];
+    ctx.save();
+    transformLayer(ctx, iCanvas, layer);
+    if (layer.opacity !== 1) {
+        ctx.globalAlpha = layer.opacity;
     }
+    ctx.drawImage(layer.img, 0, 0);
+    ctx.restore();
+    return canvas;
+};
 
-    /**
-     * This is the formula used by Photoshop to convert a color from
-     * HSY (Hue, Saturation, Luminosity) to RGB (Red, Green, Blue).
-     * The hue is calculated using the exacone approximation of the saturation
-     * cone.
-     * @param hsy The input color HSY normalized components.
-     * @param rgb The output color RGB normalized components.
-     */
-    function hsyToRgb(h, s, y) {
-
-        h = h % 360;
-        var r, g, b, k; // Intermediate variable.
-
-        if (h >= 0 && h < 60) {           // Sector 0: 0° - 60°
-            k = s * h / 60;
-            b = y - R * s - G * k;
-            r = b + s;
-            g = b + k;
-        } else if (h >= 60 && h < 120) {  // Sector 1: 60° - 120°
-            k = s * (h - 60) / 60;
-            g = y + B * s + R * k;
-            b = g - s;
-            r = g - k;
-        } else if (h >= 120 && h < 180) { // Sector 2: 120° - 180°
-            k = s * (h - 120) / 60;
-            r = y - G * s - B * k;
-            g = r + s;
-            b = r + k;
-        } else if (h >= 180 && h < 240) { // Sector 3: 180° - 240°
-            k = s * (h - 180) / 60;
-            b = y + R * s + G * k;
-            r = b - s;
-            g = b - k;
-        } else if (h >= 240 && h < 300) { // Sector 4: 240° - 300°
-            k = s * (h - 240) / 60;
-            g = y - B * s - R * k;
-            b = g + s;
-            r = g + k;
-        } else {                          // Sector 5: 300° - 360°
-            k = s * (h - 300) / 60;
-            r = y + G * s + B * k;
-            g = r - s;
-            b = r - k;
+// Blends the subsequent layer images with the base layer and returns the resulting image.
+// This method is used when the system supports the requested blending mode(s).
+CanvasRenderer.mergeNativeBlend = function (iCanvas, layerData) {
+    return function (canvas) {
+        var ctx = canvas.getContext('2d');
+        var layer;
+        for (var i = 0; i < layerData.length; i += 1) {
+            layer = layerData[i];
+            ctx.save();
+            transformLayer(ctx, iCanvas, layer);
+            if (layer.opacity !== 1) {
+                ctx.globalAlpha = layer.opacity;
+            }
+            if (layer.blendmode !== 'source-over') {
+                ctx.globalCompositeOperation = blend.realBlendMode(layer.blendmode);
+            }
+            ctx.drawImage(layer.img, 0, 0);
+            ctx.restore();
         }
+        return canvas;
+    };
+};
 
-        // Approximations erros can cause values to exceed bounds.
+CanvasRenderer.createRenderPipe = function (Renderer, iCanvas, layerData) {
+    var mode, useNative, currentList, layer;
+    var renderPipe = [];
 
-        r = min(max(r, 0), 1) * 255;
-        g = min(max(g, 0), 1) * 255;
-        b = min(max(b, 0), 1) * 255;
-        return [r, g, b];
+    function pushList() {
+        if (useNative !== undefined) {
+            var fn = useNative ? Renderer.mergeNativeBlend : Renderer.mergeManualBlend;
+            renderPipe.push(fn(iCanvas, currentList));
+        }
     }
 
-    function _sourceover() {
-        or = sr;
-        og = sg;
-        ob = sb;
+    for (var i = 1; i < layerData.length; i += 1) {
+        layer = layerData[i];
+        mode = layer.blendmode;
+        // todo: handle blendmode aliases.
+        if (useNative === undefined || useNative !== nativeBlendModes[mode]) {
+            pushList();
+            currentList = [];
+        }
+        currentList.push(layer);
+        useNative = nativeBlendModes[mode];
+        if (i === layerData.length - 1) {
+            pushList();
+        }
     }
+    return renderPipe;
+};
 
-    function _svg_sourceover() {
-        or = sr + dr - dr * sa;
-        og = sg + dg - dg * sa;
-        ob = sb + db - db * sa;
+// Merges the different canvas layers together in a single image and returns this as a html canvas.
+CanvasRenderer.merge = function (iCanvas, layerData) {
+    var renderPipe = CanvasRenderer.createRenderPipe(CanvasRenderer, iCanvas, layerData);
+    var canvas = CanvasRenderer.singleLayerWithOpacity(iCanvas, layerData[0]);
+    for (var i = 0; i < renderPipe.length; i += 1) {
+        canvas = renderPipe[i](canvas);
     }
+    return canvas;
+};
 
-    function _multiply() {
-        or = dr * sr / 255;
-        og = dg * sg / 255;
-        ob = db * sb / 255;
+CanvasRenderer.composite = function (iCanvas, layerData) {
+    if (!layerData || layerData.length === 0) {
+        return null;
     }
-
-    function _svg_multiply() {
-        or = sr * dr + sr * (1 - da) + dr * (1 - sa);
-        og = sg * dg + sg * (1 - da) + dg * (1 - sa);
-        ob = sb * db + sb * (1 - da) + db * (1 - sa);
+    if (layerData.length === 1) {
+        return CanvasRenderer.singleLayerWithOpacity(iCanvas, layerData[0]);
     }
 
-    function _subtract() {
-        or = max(dr - sr, 0);
-        og = max(dg - sg, 0);
-        ob = max(db - sb, 0);
+    return CanvasRenderer.merge(iCanvas, layerData);
+};
+
+// Returns an object with additional layer information as well as the input images
+// to be passed to the different processing functions.
+CanvasRenderer.getLayerData = function (iCanvas, layerImages) {
+    var d, layer, layerImg;
+    var layerData = [];
+    for (var i = 0; i < layerImages.length; i += 1) {
+        layer = iCanvas.layers[i];
+        layerImg = layerImages[i];
+        d = { img: layerImg,
+            opacity: layer.opacity,
+            blendmode: layer.blendmode,
+            transform: layer.transform,
+            flip_h: layer.flip_h, flip_v: layer.flip_v
+        };
+        layerData.push(d);
     }
+    return layerData;
+};
 
-    function _svg_subtract() {
-        or = max(dr * sa - sr * da, 0) + sr * (1 - da) + dr * (1 - sa);
-        og = max(dg * sa - sg * da, 0) + sg * (1 - da) + dg * (1 - sa);
-        ob = max(db * sa - sb * da, 0) + sb * (1 - da) + db * (1 - sa);
+// Renders the image canvas. Top level.
+CanvasRenderer.render = function (iCanvas) {
+    var layerImages = [];
+    for (var i = 0; i < iCanvas.layers.length; i += 1) {
+        layerImages.push(CanvasRenderer.processLayer(iCanvas, iCanvas.layers[i]));
     }
+    return CanvasRenderer.composite(iCanvas, CanvasRenderer.getLayerData(iCanvas, layerImages));
+};
+
+// Renders the image canvas and turns it into a black and white image. Useful for rendering a layer mask.
+CanvasRenderer.renderBW = function (iCanvas) {
+    var canvas = CanvasRenderer.render(iCanvas);
+    var data = canvas.getContext('2d').getImageData(0, 0, canvas.width, canvas.height).data;
+    var bwFilter = {name: 'desaturate', options: {method: 'ITU-R BT.709'}};
+    return CanvasRenderer.processImage(canvas, [bwFilter]);
+};
+
+module.exports = CanvasRenderer;
+
+},{"./blend":15,"./process":18,"./util":19}],17:[function(require,module,exports){
+'use strict';
+
+var util = require('./util');
+var CanvasRenderer = require('./canvasrenderer');
+var AsyncRenderer = require('./asyncrenderer');
 
-    function _divide() {
-        or = sr === 0 ? 0 : dr / sr * 255;
-        og = sg === 0 ? 0 : dg / sg * 255;
-        ob = sb === 0 ? 0 : db / sb * 255;
-    }
+var img, ImageCanvas, Layer, Img;
 
-    function _screen() {
-        or = (255 - (((255 - dr) * (255 - sr)) >> 8));
-        og = (255 - (((255 - dg) * (255 - sg)) >> 8));
-        ob = (255 - (((255 - db) * (255 - sb)) >> 8));
-    }
+var DEFAULT_WIDTH = 800;
+var DEFAULT_HEIGHT = 800;
 
-    function _svg_screen() {
-        or = sr + dr - sr * dr;
-        og = sg + dg - sg * dg;
-        ob = sb + db - sb * db;
-    }
+// Different layer types.
+var TYPE_PATH = 'path';
+var TYPE_IMAGE = 'image';
+var TYPE_HTML_CANVAS = 'htmlCanvas';
+var TYPE_IMAGE_CANVAS = 'iCanvas';
+var TYPE_FILL = 'fill';
+var TYPE_GRADIENT = 'gradient';
 
-    function _lighten() {
-        or = dr > sr ? dr : sr;
-        og = dg > sg ? dg : sg;
-        ob = db > sb ? db : sb;
-    }
+var IDENTITY_TRANSFORM = util.transform();
+var Transform = IDENTITY_TRANSFORM;
 
-    function _svg_lighten() {
-        or = max(sr * da, dr * sa) + sr * (1 - da) + dr * (1 - sa);
-        og = max(sg * da, dg * sa) + sg * (1 - da) + dg * (1 - sa);
-        ob = max(sb * da, db * sa) + sb * (1 - da) + db * (1 - sa);
-    }
+var clamp = util.clamp;
 
-    function _darken() {
-        or = dr < sr ? dr : sr;
-        og = dg < sg ? dg : sg;
-        ob = db < sb ? db : sb;
-    }
+// Named colors supported by all browsers.
+// See: http://www.w3schools.com/html/html_colornames.asp
+var colors = ['aliceblue', 'antiquewhite', 'aqua', 'aquamarine', 'azure', 'beige', 'bisque', 'black', 'blanchedalmond', 'blue', 'blueviolet', 'brown', 'burlywood', 'cadetblue', 'chartreuse', 'chocolate', 'coral', 'cornflowerblue', 'cornsilk', 'crimson', 'cyan', 'darkblue', 'darkcyan', 'darkgoldenrod', 'darkgray', 'darkgreen', 'darkkhaki', 'darkmagenta', 'darkolivegreen', 'darkorange', 'darkorchid', 'darkred', 'darksalmon', 'darkseagreen', 'darkslateblue', 'darkslategray', 'darkturquoise', 'darkviolet', 'deeppink', 'deepskyblue', 'dimgray', 'dimgrey', 'dodgerblue', 'firebrick', 'floralwhite', 'forestgreen', 'fuchsia', 'gainsboro', 'ghostwhite', 'gold', 'goldenrod', 'gray', 'green', 'greenyellow', 'grey', 'honeydew', 'hotpink', 'indianred', 'indigo', 'ivory', 'khaki', 'lavender', 'lavenderblush', 'lawngreen', 'lemonchiffon', 'lightblue', 'lightcoral', 'lightcyan', 'lightgoldenrodyellow', 'lightgreen', 'lightgrey', 'lightpink', 'lightsalmon', 'lightseagreen', 'lightskyblue', 'lightslategray', 'lightsteelblue', 'lightyellow', 'lime', 'limegreen', 'linen', 'maroon', 'mediumaquamarine', 'mediumblue', 'mediumorchid', 'mediumpurple', 'mediumseagreen', 'mediumslateblue', 'mediumspringgreen', 'mediumturquoise', 'mediumvioletred', 'midnightblue', 'mintcream', 'mistyrose', 'moccasin', 'navajowhite', 'navy', 'oldlace', 'olive', 'olivedrab', 'orange', 'orangered', 'orchid', 'palegoldenrod', 'palegreen', 'paleturquoise', 'palevioletred', 'papayawhip', 'peachpuff', 'peru', 'pink', 'plum', 'powderblue', 'purple', 'red', 'rosybrown', 'royalblue', 'saddlebrown', 'salmon', 'sandybrown', 'seagreen', 'seashell', 'sienna', 'silver', 'skyblue', 'slateblue', 'slategray', 'snow', 'springgreen', 'steelblue', 'tan', 'teal', 'thistle', 'tomato', 'transparent', 'turquoise', 'violet', 'wheat', 'white', 'whitesmoke', 'yellow', 'yellowgreen'];
 
-    function _svg_darken() {
-        or = min(sr * da, dr * sa) + sr * (1 - da) + dr * (1 - sa);
-        og = min(sg * da, dg * sa) + sg * (1 - da) + dg * (1 - sa);
-        ob = min(sb * da, db * sa) + sb * (1 - da) + db * (1 - sa);
-    }
 
-    function _darkercolor() {
-        if (dr * 0.3 + dg * 0.59 + db * 0.11 <= sr * 0.3 + sg * 0.59 + sb * 0.11) {
-            or = dr;
-            og = dg;
-            ob = db;
-        } else {
-            or = sr;
-            og = sg;
-            ob = sb;
+// Converts a number of arguments to a type of color argument that the html canvas context can understand:
+// a named color, a hex color or a string in the form of rgba(r, g, b, a)
+function toColor(v1, v2, v3, v4, v5) {
+    var _r, _g, _b, _a, R, G, B, rgb, options;
+    if (v1 === undefined) {
+        _r = _g = _b = 0;
+        _a = 1;
+    } else if (Array.isArray(v1)) {
+        options = v2 || {};
+        _r = v1[0] !== undefined ? v1[0] : 0;
+        _g = v1[1] !== undefined ? v1[1] : 0;
+        _b = v1[2] !== undefined ? v1[2] : 0;
+        _a = v1[3] !== undefined ? v1[3] : options.base || 1;
+    } else if (v1.r !== undefined) {
+        options = v2 || {};
+        _r = v1.r;
+        _g = v1.g;
+        _b = v1.b;
+        _a = v1.a !== undefined ? v1.a : options.base || 1;
+    } else if (typeof v1 === 'string') {
+        if (v1.indexOf('#') === 0) {
+            return v1;
         }
-    }
-
-    function _svg_darkercolor() {
-        if (dr * sa * 0.3 + dg * sa * 0.59 + db * sa * 0.11 <= sr * da * 0.3 + sg * da * 0.59 + sb * da * 0.11) {
-            or = dr * sa;
-            og = dg * sa;
-            ob = db * sa;
-        } else {
-            or = sr * da;
-            og = sg * da;
-            ob = sb * da;
+        if (v1.indexOf('rgb') === 0) {
+            return v1;
         }
-        or += sr * (1 - da) + dr * (1 - sa);
-        og += sg * (1 - da) + dg * (1 - sa);
-        ob += sb * (1 - da) + db * (1 - sa);
-    }
-
-    function _lightercolor() {
-        if (dr * 0.3 + dg * 0.59 + db * 0.11 > sr * 0.3 + sg * 0.59 + sb * 0.11) {
-            or = dr;
-            og = dg;
-            ob = db;
-        } else {
-            or = sr;
-            og = sg;
-            ob = sb;
+        if (colors.indexOf(v1) !== -1) {
+            return v1;
         }
-    }
-
-    function _svg_lightercolor() {
-        if (dr * sa * 0.3 + dg * sa * 0.59 + db * sa * 0.11 > sr * da * 0.3 + sg * da * 0.59 + sb * da * 0.11) {
-            or = dr * sa;
-            og = dg * sa;
-            ob = db * sa;
-        } else {
-            or = sr * da;
-            og = sg * da;
-            ob = sb * da;
+    } else if (typeof v1 === 'number') {
+        if (arguments.length === 1) { // Grayscale value
+            _r = _g = _b = v1;
+            _a = 1;
+        } else if (arguments.length === 2) { // Gray and alpha or options
+            _r = _g = _b = v1;
+            if (typeof v2 === 'number') {
+                _a = v2;
+            } else {
+                options = v2;
+                _a = options.base || 1;
+            }
+        } else if (arguments.length === 3) { // RGB or gray, alpha and options
+            if (typeof v3 === 'number') {
+                _r = v1;
+                _g = v2;
+                _b = v3;
+                _a = 1;
+            } else {
+                _r = _g = _b = v1;
+                _a = v2;
+                options = v3;
+            }
+        } else if (arguments.length === 4) { // RGB and alpha or options
+            _r = v1;
+            _g = v2;
+            _b = v3;
+            if (typeof v4 === 'number') {
+                _a = v4;
+            } else {
+                options = v4 || {};
+                _a = options.base || 1;
+            }
+        } else { // RGBA + options
+            _r = v1;
+            _g = v2;
+            _b = v3;
+            _a = v4;
+            options = v5;
         }
-        or += sr * (1 - da) + dr * (1 - sa);
-        og += sg * (1 - da) + dg * (1 - sa);
-        ob += sb * (1 - da) + db * (1 - sa);
     }
 
-    function _add() { // also known as linear dodge
-        or = min(dr + sr, 255);
-        og = min(dg + sg, 255);
-        ob = min(db + sb, 255);
+    if (!(typeof _r === 'number' &&
+        typeof _g === 'number' &&
+        typeof _b === 'number' &&
+        typeof _a === 'number')) {
+        throw new Error('Invalid color arguments');
     }
 
-    function _linearburn() {
-        or = dr + sr;
-        og = dg + sg;
-        ob = db + sb;
+    options = options || {};
 
-        or = or < 255 ? 0 : (or - 255);
-        og = og < 255 ? 0 : (og - 255);
-        ob = ob < 255 ? 0 : (ob - 255);
+    // The base option allows you to specify values in a different range.
+    if (options.base !== undefined) {
+        _r /= options.base;
+        _g /= options.base;
+        _b /= options.base;
+        _a /= options.base;
     }
+    R = Math.round(_r * 255);
+    G = Math.round(_g * 255);
+    B = Math.round(_b * 255);
+    return 'rgba(' + R + ', ' + G + ', ' + B + ', ' + _a + ')';
+}
 
-    function _difference() {
-        or = dr - sr;
-        og = dg - sg;
-        ob = db - sb;
+// Converts a number of arguments into a dictionary of gradient information that is understood by the renderer.
+function toGradientData(v1, v2, v3, v4, v5) {
+    var startColor, endColor, type, rotation, spread, d;
+    var data = {};
 
-        or = or < 0 ? -or : or;
-        og = og < 0 ? -og : og;
-        ob = ob < 0 ? -ob : ob;
+    if (arguments.length === 1) { // The argument is a dictionary or undefined.
+        d = v1 || {};
+        startColor = d.startColor;
+        endColor = d.endColor;
+        type = d.type;
+        rotation = d.rotation;
+        spread = d.spread;
+    } else if (arguments.length >= 2) { // The first two arguments are a start color and an end color.
+        startColor = v1;
+        endColor = v2;
+        type = 'linear';
+        rotation = 0;
+        spread = 0;
+        if (arguments.length === 3) {
+            if (typeof v3 === 'string') { // The type can be either linear or radial.
+                type = v3;
+            } else if (typeof v3 === 'number') { // The type is implicitly linear and the third argument is the rotation angle.
+                rotation = v3;
+            }
+        } else if (arguments.length === 4) {
+            if (typeof v3 === 'number') { // The type is implicitly linear and the third/forth arguments are the rotation angle and gradient spread.
+                rotation = v3;
+                spread = v4;
+            } else if (v3 === 'linear') { // The type is explicitly linear and the forth argument is the rotation angle.
+                rotation = v4;
+            } else if (v3 === 'radial') { // The type is explicitly radial and the forth argument is the gradient spread.
+                type = v3;
+                spread = v4;
+            } else {
+                throw new Error('Wrong argument provided: ' + v3);
+            }
+        } else if (arguments.length === 5) { // Type, rotation (unused in case of radial type gradient), and gradient spread.
+            type = v3;
+            rotation = v4;
+            spread = v5;
+        }
     }
 
-    function _svg_difference() {
-        or = sr + dr - 2 * min(sr * da, dr * sa);
-        og = sg + dg - 2 * min(sg * da, dg * sa);
-        ob = sb + db - 2 * min(sb * da, db * sa);
+    if (!startColor && startColor !== 0) {
+        throw new Error('No startColor was given.');
+    }
+    if (!endColor && endColor !== 0) {
+        throw new Error('No endColor was given.');
     }
 
-    function _exclusion() {
-        or = dr - (dr * div_2_255 - 1) * sr;
-        og = dg - (dg * div_2_255 - 1) * sg;
-        ob = db - (db * div_2_255 - 1) * sb;
+    try {
+        data.startColor = toColor(startColor);
+    } catch (e1) {
+        throw new Error('startColor is not a valid color: ' + startColor);
     }
 
-    function _svg_exclusion() {
-        or = sr * da + dr * sa - 2 * sr * dr + sr * (1 - da) + dr * (1 - sa);
-        og = sg * da + dg * sa - 2 * sg * dg + sg * (1 - da) + dg * (1 - sa);
-        ob = sb * da + db * sa - 2 * sb * db + sb * (1 - da) + db * (1 - sa);
+    try {
+        data.endColor = toColor(endColor);
+    } catch (e2) {
+        throw new Error('endColor is not a valid color: ' + endColor);
     }
 
-    function _overlay() {
-        if (dr < 128) {
-            or = sr * dr * div_2_255;
-        } else {
-            or = 255 - (255 - sr) * (255 - dr) * div_2_255;
-        }
+    if (type === undefined) {
+        type = 'linear';
+    }
+    if (type !== 'linear' && type !== 'radial') {
+        throw new Error('Unknown gradient type: ' + type);
+    }
 
-        if (dg < 128) {
-            og = sg * dg * div_2_255;
-        } else {
-            og = 255 - (255 - sg) * (255 - dg) * div_2_255;
-        }
+    data.type = type;
 
-        if (db < 128) {
-            ob = sb * db * div_2_255;
-        } else {
-            ob = 255 - (255 - sb) * (255 - db) * div_2_255;
-        }
+    if (spread === undefined) {
+        spread = 0;
     }
-
-    function _svg_overlay() {
-        if (2 * dr <= da) {
-            or = 2 * sr * dr + sr * (1 - da) + dr * (1 - sa);
-        } else {
-            or = sr * (1 + da) + dr * (1 + sa) - 2 * dr * sr - da * sa;
-        }
-        if (2 * dg <= da) {
-            og = 2 * sg * dg + sg * (1 - da) + dg * (1 - sa);
-        } else {
-            og = sg * (1 + da) + dg * (1 + sa) - 2 * dg * sg - da * sa;
-        }
-        if (2 * db <= da) {
-            ob = 2 * sb * db + sb * (1 - da) + db * (1 - sa);
-        } else {
-            ob = sb * (1 + da) + db * (1 + sa) - 2 * db * sb - da * sa;
-        }
+    if (typeof spread !== 'number') {
+        throw new Error('Spread value is not a number: ' + spread);
     }
 
-    function _softlight() {
-        if (dr < 128) {
-            or = ((sr >> 1) + 64) * dr * div_2_255;
-        } else {
-            or = 255 - (191 - (sr >> 1)) * (255 - dr) * div_2_255;
-        }
-
-        if (dg < 128) {
-            og = ((sg >> 1) + 64) * dg * div_2_255;
-        } else {
-            og = 255 - (191 - (sg >> 1)) * (255 - dg) * div_2_255;
+    if (type === 'linear') {
+        if (rotation === undefined) {
+            rotation = 0;
         }
-
-        if (db < 128) {
-            ob = ((sb >> 1) + 64) * db * div_2_255;
-        } else {
-            ob = 255 - (191 - (sb >> 1)) * (255 - db) * div_2_255;
+        if (typeof rotation !== 'number') {
+            throw new Error('Rotation value is not a number: ' + rotation);
         }
+        data.rotation = rotation;
     }
 
-    function _svg_softlight() {
-        var m;
-        var pow = Math.pow;
-
-        if (0.0 === da) {
-            or = sr;
-            og = sg;
-            ob = sb;
-            return;
-        }
-
-        m = dr / da;
-        if (2 * sr <= sa) {
-            or = dr * (sa + (2 * sr - sa) * (1 - m)) + sr * (1 - da) + dr * (1 - sa);
-        } else if (2 * sr > sa && 4 * dr <= da) {
-            or = da * (2 * sr - sa) * (16 * pow(m, 3) - 12 * pow(m, 2) - 3 * m) + sr - sr * da + dr;
-        } else if (2 * sr > sa && 4 * dr > da) {
-            or = da * (2 * sr - sa) * (pow(m, 0.5) - m) + sr - sr * da + dr;
-        }
+    data.spread = clamp(spread, 0, 0.99);
 
-        m = dg / da;
-        if (2 * sg <= sa) {
-            og = dg * (sa + (2 * sg - sa) * (1 - m)) + sg * (1 - da) + dg * (1 - sa);
-        } else if (2 * sg > sa && 4 * dg <= da) {
-            og = da * (2 * sg - sa) * (16 * pow(m, 3) - 12 * pow(m, 2) - 3 * m) + sg - sg * da + dg;
-        } else if (2 * sg > sa && 4 * dg > da) {
-            og = da * (2 * sg - sa) * (pow(m, 0.5) - m) + sg - sg * da + dg;
-        }
+    return data;
+}
 
-        m = db / da;
-        if (2 * sb <= sa) {
-            ob = db * (sa + (2 * sb - sa) * (1 - m)) + sb * (1 - da) + db * (1 - sa);
-        } else if (2 * sb > sa && 4 * db <= da) {
-            ob = da * (2 * sb - sa) * (16 * pow(m, 3) - 12 * pow(m, 2) - 3 * m) + sb - sb * da + db;
-        } else if (2 * sb > sa && 4 * db > da) {
-            ob = da * (2 * sb - sa) * (pow(m, 0.5) - m) + sb - sb * da + db;
-        }
+function findType(data) {
+    if (typeof data === 'string') {
+        return TYPE_PATH;
+    } else if (data instanceof Image) {
+        return TYPE_IMAGE;
+    } else if (data instanceof HTMLCanvasElement) {
+        return TYPE_HTML_CANVAS;
+    } else if (data instanceof ImageCanvas) {
+        return TYPE_IMAGE_CANVAS;
+    } else if (data.r !== undefined && data.g !== undefined && data.b !== undefined && data.a !== undefined) {
+        return TYPE_FILL;
+    } else if (data.startColor !== undefined && data.endColor !== undefined) {
+        return TYPE_GRADIENT;
     }
+    throw new Error('Cannot establish type for data ', data);
+}
 
-    function _hardlight() {
-        if (sr < 128) {
-            or = dr * sr * div_2_255;
-        } else {
-            or = 255 - (255 - dr) * (255 - sr) * div_2_255;
-        }
 
-        if (sg < 128) {
-            og = dg * sg * div_2_255;
-        } else {
-            og = 255 - (255 - dg) * (255 - sg) * div_2_255;
-        }
+// IMAGE LAYER.
 
-        if (sb < 128) {
-            ob = db * sb * div_2_255;
-        } else {
-            ob = 255 - (255 - db) * (255 - sb) * div_2_255;
-        }
+Layer = function (data, type) {
+    if (!type) {
+        type = findType(data);
     }
+    this.data = data;
+    this.type = type;
 
-    function _svg_hardlight() {
-        if (2 * sr <= sa) {
-            or = 2 * sr * dr + sr * (1 - da) + dr * (1 - sa);
-        } else {
-            or = sr * (1 + da) + dr * (1 + sa) - sa * da - 2 * sr * dr;
-        }
+    if (type === TYPE_HTML_CANVAS || type === TYPE_IMAGE_CANVAS || type === TYPE_IMAGE) {
+        this.width = data.width;
+        this.height = data.height;
+    }
 
-        if (2 * sg <= sa) {
-            og = 2 * sg * dg + sg * (1 - da) + dg * (1 - sa);
-        } else {
-            og = sg * (1 + da) + dg * (1 + sa) - sa * da - 2 * sg * dg;
-        }
+    // Compositing.
+    this.opacity = 1.0;
+    this.blendmode = 'source-over';
 
-        if (2 * sb <= sa) {
-            ob = 2 * sb * db + sb * (1 - da) + db * (1 - sa);
-        } else {
-            ob = sb * (1 + da) + db * (1 + sa) - sa * da - 2 * sb * db;
-        }
-    }
+    // Transformations.
+    this.transform = IDENTITY_TRANSFORM;
+    this.flip_h = false;
+    this.flip_v = false;
 
-    function _colordodge() {
-        var dr1 = (dr << 8) / (255 - sr);
-        var dg1 = (dg << 8) / (255 - sg);
-        var db1 = (db << 8) / (255 - sb);
+    // An alpha mask hides parts of the masked layer where the mask is darker.
+    this.mask = new ImageCanvas();
 
-        or = (dr1 > 255 || sr === 255) ? 255 : dr1;
-        og = (dg1 > 255 || sg === 255) ? 255 : dg1;
-        ob = (db1 > 255 || sb === 255) ? 255 : db1;
-    }
+    this.filters = [];
+};
 
-    function _svg_colordodge() {
-        if (da === 0) {
-            or = sr;
-            og = sg;
-            ob = sb;
-            return;
-        }
+Layer.Transform = Layer.IDENTITY_TRANSFORM = IDENTITY_TRANSFORM;
 
-        if (sr === sa && dr === 0) {
-            or = sr * (1 - da);
-        } else if (sr === sa) {
-            or = sa * da + sr * (1 - da) + dr * (1 - sa);
-        } else if (sr < sa) {
-            or = sa * da * min(1, dr / da * sa / (sa - sr)) + sr * (1 - da) + dr * (1 - sa);
+// Copies the layer object.
+Layer.prototype.clone = function () {
+    function cloneFilter(filter) {
+        var key, value;
+        var f = {};
+        f.name = filter.name;
+        if (filter.options !== undefined) {
+            f.options = {};
+            var optionsKeys = Object.keys(filter.options);
+            for (var i = 0; i < optionsKeys.length; i += 1) {
+                key = optionsKeys[i];
+                value = filter.options[key];
+                if (Array.isArray(value)) {
+                    f.options[key] = value.slice(0);
+                } else {
+                    f.options[key] = value;
+                }
+            }
         }
+        return f;
+    }
 
-        if (sg === sa && dg === 0) {
-            og = sg * (1 - da);
-        } else if (sr === sa) {
-            og = sa * da + sg * (1 - da) + dg * (1 - sa);
-        } else if (sr < sa) {
-            og = sa * da * min(1, dg / da * sa / (sa - sg)) + sg * (1 - da) + dg * (1 - sa);
-        }
+    var d = Object.create(Layer.prototype);
+    d.data = this.data;
+    d.type = this.type;
+    d.width = this.width;
+    d.height = this.height;
+    d.opacity = this.opacity;
+    d.blendmode = this.blendmode;
+    d.transform = this.transform;
+    d.flip_h = this.flip_h;
+    d.flip_v = this.flip_v;
+    d.mask = this.mask.clone();
+    d.filters = [];
 
-        if (sb === sa && db === 0) {
-            ob = sb * (1 - da);
-        } else if (sr === sa) {
-            ob = sa * da + sb * (1 - da) + db * (1 - sa);
-        } else if (sr < sa) {
-            ob = sa * da * min(1, db / da * sa / (sa - sb)) + sb * (1 - da) + db * (1 - sa);
-        }
+    if (this.type === TYPE_IMAGE_CANVAS) {
+        d.data = this.data.clone();
+    } else if (this.type === TYPE_GRADIENT) {
+        d.data = {
+            startColor: this.data.startColor,
+            endColor: this.data.endColor,
+            type: this.data.type,
+            rotation: this.data.rotation,
+            spread: this.data.spread
+        };
     }
 
-    function _colorburn() {
-        var dr1 = 255 - ((255 - dr) << 8) / sr;
-        var dg1 = 255 - ((255 - dg) << 8) / sg;
-        var db1 = 255 - ((255 - db) << 8) / sb;
-
-        or = (dr1 < 0 || sr === 0) ? 0 : dr1;
-        og = (dg1 < 0 || sg === 0) ? 0 : dg1;
-        ob = (db1 < 0 || sb === 0) ? 0 : db1;
+    for (var i = 0; i < this.filters.length; i += 1) {
+        d.filters.push(cloneFilter(this.filters[i]));
     }
 
-    function _svg_colorburn() {
-        if (da === 0) {
-            or = sr;
-            og = sg;
-            ob = sb;
-            return;
-        }
+    return d;
+};
 
-        if (sr === 0 && dr === da) {
-            or = sa * da + dr * (1 - sa);
-        } else if (sr === 0) {
-            or = dr * (1 - sa);
-        } else if (sr > 0) {
-            or = sa * da * (1 - min(1, (1 - dr / da) * sa / sr)) + sr * (1 - da) + dr * (1 - sa);
-        }
+// Sets the opacity of the layer (requires a number in the range 0.0-1.0).
+Layer.prototype.setOpacity = function (opacity) {
+    this.opacity = clamp(opacity, 0, 1);
+};
 
-        if (sg === 0 && dg === da) {
-            og = sa * da + dg * (1 - sa);
-        } else if (sg === 0) {
-            og = dg * (1 - sa);
-        } else if (sg > 0) {
-            og = sa * da * (1 - min(1, (1 - dg / da) * sa / sg)) + sg * (1 - da) + dg * (1 - sa);
-        }
+// Within an image canvas, a layer is by default positioned in the center.
+// Translating moves the layer away from this center.
+// Each successive call to the translate function performs an additional translation on top of the current transformation matrix.
+Layer.prototype.translate = function (tx, ty) {
+    ty = ty === undefined ? 0 : ty;
+    var t = Transform.translate(tx, ty);
+    this.transform = this.transform.prepend(t);
+};
 
-        if (sb === 0 && db === da) {
-            ob = sa * da + db * (1 - sa);
-        } else if (sb === 0) {
-            ob = db * (1 - sa);
-        } else if (sb > 0) {
-            ob = sa * da * (1 - min(1, (1 - db / da) * sa / sb)) + sb * (1 - da) + db * (1 - sa);
-        }
-    }
+// Scaling happens relatively in a 0.0-1.0 based range where 1.0 stands for 100%.
+// Each successive call to the scale function performs an additional scaling operation on top of the current transformation matrix.
+// If only one parameter is supplied, the layer is scaled proportionally.
+Layer.prototype.scale = function (sx, sy) {
+    sy = sy === undefined ? sx : sy;
+    var t = Transform.scale(sx, sy);
+    this.transform = this.transform.prepend(t);
+};
 
-    function _linearlight() {
-        var dr1 = 2 * sr + dr - 256;
-        var dg1 = 2 * sg + dg - 256;
-        var db1 = 2 * sb + db - 256;
+// The supplied parameter should be in degrees (not radians).
+// Each successive call to the rotation function performs an additional rotation on top of the current transformation matrix.
+Layer.prototype.rotate = function (rot) {
+    var t = Transform.rotate(rot);
+    this.transform = this.transform.prepend(t);
+};
 
-        or = (dr1 < 0 || (sr < 128 && dr1 < 0)) ? 0 : (dr1 > 255 ? 255 : dr1);
-        og = (dg1 < 0 || (sg < 128 && dg1 < 0)) ? 0 : (dg1 > 255 ? 255 : dg1);
-        ob = (db1 < 0 || (sb < 128 && db1 < 0)) ? 0 : (db1 > 255 ? 255 : db1);
-    }
+// Each successive call to the skew function performs an additional skewing operation on top of the current transformation matrix.
+Layer.prototype.skew = function (kx, ky) {
+    ky = ky === undefined ? kx : ky;
+    var t = Transform.skew(kx, ky);
+    this.transform = this.transform.prepend(t);
+};
 
-    function _vividlight() {
-        var a;
+// Flips the layer horizontally.
+Layer.prototype.flipHorizontal = function (arg) {
+    if (arg !== undefined) {
+        this.flip_h = arg;
+    } else {
+        this.flip_h = !this.flip_h;
+    }
+};
 
-        if (sr < 128) {
-            if (sr) {
-                a = 255 - ((255 - dr) << 8) / (2 * sr);
-                or = a < 0 ? 0 : a;
-            } else {
-                or = 0;
-            }
-        } else {
-            a = 2 * sr - 256;
-            if (a < 255) {
-                a = (dr << 8) / (255 - a);
-                or = a > 255 ? 255 : a;
-            } else {
-                or = a < 0 ? 0 : a;
-            }
-        }
+// Flips the layer vertically.
+Layer.prototype.flipVertical = function (arg) {
+    if (arg !== undefined) {
+        this.flip_v = arg;
+    } else {
+        this.flip_v = !this.flip_v;
+    }
+};
 
-        if (sg < 128) {
-            if (sg) {
-                a = 255 - ((255 - dg) << 8) / (2 * sg);
-                og = a < 0 ? 0 : a;
-            } else {
-                og = 0;
-            }
-        } else {
-            a = 2 * sg - 256;
-            if (a < 255) {
-                a = (dg << 8) / (255 - a);
-                og = a > 255 ? 255 : a;
-            } else {
-                og = a < 0 ? 0 : a;
-            }
-        }
+Layer.prototype.addFilter = function (filter, options) {
+    this.filters.push({
+        name: filter,
+        options: options
+    });
+};
 
-        if (sb < 128) {
-            if (sb) {
-                a = 255 - ((255 - db) << 8) / (2 * sb);
-                ob = a < 0 ? 0 : a;
-            } else {
-                ob = 0;
-            }
-        } else {
-            a = 2 * sb - 256;
-            if (a < 255) {
-                a = (db << 8) / (255 - a);
-                ob = a > 255 ? 255 : a;
-            } else {
-                ob = a < 0 ? 0 : a;
-            }
-        }
-    }
+// Renders the layer to a new canvas.
+Layer.prototype.draw = function (ctx) {
+    var width = this.width === undefined ? DEFAULT_WIDTH : this.width;
+    var height = this.height === undefined ? DEFAULT_HEIGHT : this.height;
+    var canvas = new ImageCanvas(width, height);
+    canvas.addLayer(this);
+    canvas.draw(ctx);
+};
 
-    function _pinlight() {
-        var a;
+Layer.prototype.toCanvas = function () {
+    var canvas = document.createElement('canvas');
+    canvas.width = this.width;
+    canvas.height = this.height;
+    var ctx = canvas.getContext('2d');
+    this.draw(ctx);
+    return canvas;
+};
 
-        if (sr < 128) {
-            a = 2 * sr;
-            or = dr < a ? dr : a;
-        } else {
-            a = 2 * sr - 256;
-            or = dr > a ? dr : a;
-        }
+Layer.fromFile = function (filename) {
+    return new Layer(filename, TYPE_PATH);
+};
 
-        if (sg < 128) {
-            a = 2 * sg;
-            og = dg < a ? dg : a;
-        } else {
-            a = 2 * sg - 256;
-            og = dg > a ? dg : a;
-        }
+Layer.fromImage = function (image) {
+    return new Layer(image, TYPE_IMAGE);
+};
 
-        if (sb < 128) {
-            a = 2 * sb;
-            ob = db < a ? db : a;
-        } else {
-            a = 2 * sb - 256;
-            ob = db > a ? db : a;
-        }
+Layer.fromCanvas = function (canvas) {
+    if (canvas instanceof HTMLCanvasElement) {
+        return Layer.fromHtmlCanvas(canvas);
     }
+    return Layer.fromImageCanvas(canvas);
+};
 
-    function _hardmix() {
-        var a;
+Layer.fromHtmlCanvas = function (canvas) {
+    return new Layer(canvas, TYPE_HTML_CANVAS);
+};
 
-        if (sr < 128) {
-            or = (255 - ((255 - dr) << 8) / (2 * sr) < 128 || sr === 0) ? 0 : 255;
-        } else {
-            a = 2 * sr - 256;
-            or = (a < 255 && (dr << 8) / (255 - a) < 128) ? 0 : 255;
-        }
+Layer.fromImageCanvas = function (iCanvas) {
+    return new Layer(iCanvas, TYPE_IMAGE_CANVAS);
+};
 
-        if (sg < 128) {
-            og = (255 - ((255 - dg) << 8) / (2 * sg) < 128 || sg === 0) ? 0 : 255;
-        } else {
-            a = 2 * sg - 256;
-            og = (a < 255 && (dg << 8) / (255 - a) < 128) ? 0 : 255;
-        }
+Layer.fromColor = function (color) {
+    return new Layer(toColor(color), TYPE_FILL);
+};
 
-        if (sb < 128) {
-            ob = (255 - ((255 - db) << 8) / (2 * sb) < 128 || sb === 0) ? 0 : 255;
-        } else {
-            a = 2 * sb - 256;
-            ob = (a < 255 && (db << 8) / (255 - a) < 128) ? 0 : 255;
-        }
-    }
+Layer.fromGradient = function () {
+    return new Layer(toGradientData.apply(null, arguments), TYPE_GRADIENT);
+};
 
-    function _hue() {
-        var hcl1 = rgbToHsy(dr, dg, db);
-        var hcl2 = rgbToHsy(sr, sg, sb);
-        var rgb = hsyToRgb(hcl2[0], hcl1[1], hcl1[2]);
-        or = rgb[0];
-        og = rgb[1];
-        ob = rgb[2];
-    }
+Layer.prototype.isPath = function () {
+    return this.type === TYPE_PATH;
+};
+
+Layer.prototype.isFill = function () {
+    return this.type === TYPE_FILL;
+};
+
+Layer.prototype.isGradient = function () {
+    return this.type === TYPE_GRADIENT;
+};
 
-    function _saturation() {
-        var hcl1 = rgbToHsy(dr, dg, db);
-        var hcl2 = rgbToHsy(sr, sg, sb);
-        var rgb = hsyToRgb(hcl1[0], hcl2[1], hcl1[2]);
-        or = rgb[0];
-        og = rgb[1];
-        ob = rgb[2];
-    }
+Layer.prototype.isHtmlCanvas = function () {
+    return this.type === TYPE_HTML_CANVAS;
+};
 
-    function _luminosity() {
-        var hcl1 = rgbToHsy(dr, dg, db);
-        var hcl2 = rgbToHsy(sr, sg, sb);
-        var rgb = hsyToRgb(hcl1[0], hcl1[1], hcl2[2]);
-        or = rgb[0];
-        og = rgb[1];
-        ob = rgb[2];
-    }
+Layer.prototype.isImage = function () {
+    return this.type === TYPE_IMAGE;
+};
 
-    function _color() {
-        var hcl1 = rgbToHsy(dr, dg, db);
-        var hcl2 = rgbToHsy(sr, sg, sb);
-        var rgb = hsyToRgb(hcl2[0], hcl2[1], hcl1[2]);
-        or = rgb[0];
-        og = rgb[1];
-        ob = rgb[2];
-    }
+Layer.prototype.isImageCanvas = function () {
+    return this.type === TYPE_IMAGE_CANVAS;
+};
 
-    blend_fn = {
-        'source-over': _svg_sourceover,
-        'multiply': _svg_multiply,
-        'subtract': _svg_subtract,
-        'divide': _divide,
-        'screen': _svg_screen,
-        'lighten': _svg_lighten,
-        'darken': _svg_darken,
-        'darker-color': _svg_darkercolor,
-        'lighter-color': _svg_lightercolor,
-        'add': _add,
-        'linear-burn': _linearburn,
-        'difference': _svg_difference,
-        'exclusion': _svg_exclusion,
-        'overlay': _svg_overlay,
-        'soft-light': _svg_softlight,
-        'hard-light': _svg_hardlight,
-        'color-dodge': _svg_colordodge,
-        'color-burn': _svg_colorburn,
-        'linear-light': _linearlight,
-        'vivid-light': _vividlight,
-        'pin-light': _pinlight,
-        'hard-mix': _hardmix,
-        'hue': _hue,
-        'saturation': _saturation,
-        'luminosity': _luminosity,
-        'color': _color
-    };
 
-    function rectIntersect(r1, r2) {
-        var right1 = r1.x + r1.width;
-        var bottom1 = r1.y + r1.height;
-        var right2 = r2.x + r2.width;
-        var bottom2 = r2.y + r2.height;
+// IMAGE PIXELS.
 
-        var x = max(r1.x, r2.x);
-        var y = max(r1.y, r2.y);
-        var w = max(min(right1, right2) - x, 0);
-        var h = max(min(bottom1, bottom2) - y, 0);
-        return [x, y, w, h];
-    }
+var Pixels = function (canvas) {
+    this.width = canvas.width;
+    this.height = canvas.height;
+    var ctx = canvas.getContext('2d');
+    this._data = ctx.getImageData(0, 0, this.width, this.height);
+    this.array = this._data.data;
+};
 
-    (function () {
-        var pix, pixIn, x, y, a, a2, da2, demultiply, fBlend;
-        var data2 = options.data;
-        var opacity = options.opacity === 0 ? 0 : options.opacity || 1;
-        var fn = blend_fn[options.type || '_svg_normal'];
-        var dx = options.dx || 0;
-        var dy = options.dy || 0;
-        var ri = rectIntersect({x: 0, y: 0, width: width, height: height},
-             {x: dx, y: dy, width: options.width, height: options.height});
-        var xi = ri[0];
-        var yi = ri[1];
-        var wi = ri[2];
-        var hi = ri[3];
+Pixels.prototype.get = function (i) {
+    i *= 4;
+    var v = this.array;
+    return [v[i + 0], v[i + 1], v[i + 2], v[i + 3]];
+};
 
-        function pBlend() {
-            sa = data2[pixIn + 3] / 255 * opacity;
-            da = inData[pix + 3] / 255;
-            da2 = (sa + da - sa * da);
-            demultiply = 255 / da2;
+Pixels.prototype.set = function (i, rgba) {
+    i *= 4;
+    var v = this.array;
+    v[i + 0] = rgba[0];
+    v[i + 1] = rgba[1];
+    v[i + 2] = rgba[2];
+    v[i + 3] = rgba[3];
+};
 
-            sr = data2[pixIn] / 255 * sa;
-            sg = data2[pixIn + 1] / 255 * sa;
-            sb = data2[pixIn + 2] / 255 * sa;
+Pixels.prototype.toCanvas = function () {
+    var canvas = document.createElement('canvas');
+    canvas.width = this.width;
+    canvas.height = this.height;
+    var ctx = canvas.getContext('2d');
+    ctx.putImageData(this._data, 0, 0);
+    return canvas;
+};
 
-            dr = inData[pix] / 255 * da;
-            dg = inData[pix + 1] / 255 * da;
-            db = inData[pix + 2] / 255 * da;
 
-            fn();
+// IMAGE CANVAS.
 
-            outData[pix] = or * demultiply;
-            outData[pix + 1] = og * demultiply;
-            outData[pix + 2] = ob * demultiply;
-            outData[pix + 3] = da2 * 255;
-        }
+ImageCanvas = function (width, height) {
+    if (!width) {
+        width = DEFAULT_WIDTH;
+    }
+    if (!height) {
+        height = DEFAULT_HEIGHT;
+    }
 
-        function sBlend() {
-            dr = inData[pix];
-            dg = inData[pix + 1];
-            db = inData[pix + 2];
+    this.width = width;
+    this.height = height;
+    this.layers = [];
+};
 
-            sr = data2[pixIn];
-            sg = data2[pixIn + 1];
-            sb = data2[pixIn + 2];
+// Copies the ImageCanvas.
+ImageCanvas.prototype.clone = function () {
+    var c = new ImageCanvas(this.width, this.height);
+    for (var i = 0; i < this.layers.length; i += 1) {
+        c.layers.push(this.layers[i].clone());
+    }
+    return c;
+};
 
-            fn();
+// Creates a new layer from figuring out the given argument(s) and adds it to the canvas.
+ImageCanvas.prototype.addLayer = function (arg0) {
+    var layer;
 
-            outData[pix] = or;
-            outData[pix + 1] = og;
-            outData[pix + 2] = ob;
-            outData[pix + 3] = inData[pix + 3];
+    try {
+        return this.addGradientLayer.apply(this, arguments);
+    } catch (e1) {
+    }
 
-            a = opacity * data2[pixIn + 3] / 255;
-            if (a < 1) {
-                a2 = 1 - a;
-                outData[pix] = (inData[pix] * a2 + outData[pix] * a);
-                outData[pix + 1] = (inData[pix + 1] * a2 + outData[pix + 1] * a);
-                outData[pix + 2] = (inData[pix + 2] * a2 + outData[pix + 2] * a);
-            }
+    try {
+        return this.addColorLayer.apply(this, arguments);
+    } catch (e2) {
+    }
+
+    if (arguments.length === 1) {
+        if (typeof arg0 === 'string') {
+            layer = new Layer(arg0, TYPE_PATH);
+        } else if (arg0 instanceof Layer) {
+            layer = arg0;
+        } else if (arg0 instanceof HTMLCanvasElement) {
+            layer = new Layer(arg0, TYPE_HTML_CANVAS);
+        } else if (arg0 instanceof Image) {
+            layer = new Layer(arg0, TYPE_IMAGE);
+        } else if (arg0 instanceof ImageCanvas) {
+            layer = new Layer(arg0, TYPE_IMAGE_CANVAS);
         }
+    }
 
-        fBlend = fn.name.indexOf('_svg_') === 0 ? pBlend : sBlend;
+    if (!layer) {
+        throw new Error('Error creating layer.');
+    }
 
-        for (y = 0; y < height; y += 1) {
-            for (x = 0; x < width; x += 1) {
-                pix = (y * width + x) * 4;
-                if (y >= yi && x >= xi && x < xi + wi && y < yi + hi) {
-                    pixIn = ((y - dy) * options.width + x - dx) * 4;
-                    fBlend();
-                } else {
-                    outData[pix] = inData[pix];
-                    outData[pix + 1] = inData[pix + 1];
-                    outData[pix + 2] = inData[pix + 2];
-                    outData[pix + 3] = inData[pix + 3];
-                }
-            }
-        }
-    }());
+    this.layers.push(layer);
+    return layer;
 };
 
-function _blend(inData, outData, width, height, options) {
-    process(inData, outData, width, height, options);
-}
-
-function _wrap(type) {
-    return function (inData, outData, width, height, options) {
-        options.type = type;
-        _blend(inData, outData, width, height, options);
-    };
-}
+// Adds a new color layer to the canvas.
+ImageCanvas.prototype.addColorLayer = function () {
+    var c = toColor.apply(null, arguments);
+    var layer = new Layer(c, TYPE_FILL);
+    this.layers.push(layer);
+    return layer;
+};
 
-blend = (function () {
-    var mode;
-    var d = { blend: _blend };
-    var modes = ['source-over', 'add', 'multiply', 'subtract', 'divide', 'screen',
-            'lighten', 'darken', 'darker-color', 'lighter-color', 'linear-burn',
-            'difference', 'exclusion', 'overlay', 'soft-light', 'hard-light',
-            'color-dodge', 'color-burn', 'linear-light', 'vivid-light', 'pin-light',
-            'hard-mix', 'hue', 'saturation', 'luminosity', 'color'];
-    for (var i = 0; i < modes.length; i += 1) {
-        mode = modes[i];
-        d[mode] = _wrap(mode);
-    }
-    modes = Object.keys(modes);
-    for (i = 0; i < modes.length; i += 1) {
+// Adds a new gradient layer to the canvas.
+ImageCanvas.prototype.addGradientLayer = function () {
+    var c = toGradientData.apply(null, arguments);
+    var layer = new Layer(c, TYPE_GRADIENT);
+    this.layers.push(layer);
+    return layer;
+};
 
-    }
-    // Aliases for the blending modes
-    addAliases(d);
+// Renders the canvas and passes the result (a html canvas) to the given callback function.
+ImageCanvas.prototype.render = function (callback) {
+    var renderer = callback ? AsyncRenderer : CanvasRenderer;
+    return renderer.render(this, callback);
+};
 
-    d.getNativeModes = getNativeModes;
-    d.realBlendMode = realBlendMode;
+// Renders the canvas on another canvas.
+ImageCanvas.prototype.draw = function (ctx, callback) {
+    if (callback) {
+        this.render(function (canvas) {
+            ctx.drawImage(canvas, 0, 0, canvas.width, canvas.height);
+        });
+    } else {
+        var canvas = this.render();
+        ctx.drawImage(canvas, 0, 0, canvas.width, canvas.height);
+    }
+};
 
-    return d;
-}());
 
-// MODULE SUPPORT ///////////////////////////////////////////////////////
+// Img
 
-module.exports = blend;
+function isPoint(arg) {
+    if (!arg) { return false; }
+    return arg.x !== undefined && arg.y !== undefined;
+}
 
-},{}],17:[function(require,module,exports){
-'use strict';
+function pointFromArray(arg) {
+    var x = arg[0];
+    var y = arg.length > 1 ? arg[1] : x;
+    return {x: x, y: y};
+}
 
-var blend = require('./blend');
-var process = require('./process');
-var util = require('./util');
+function pointFromNumber(arg) {
+    return {x: arg, y: arg};
+}
 
-// Dictionary of blend modes that the client browser does or does not support.
-var nativeBlendModes = blend.getNativeModes();
+function isValidArg(arg) {
+    return arg !== undefined && arg !== null;
+}
 
-function createImageData(ctx, width, height) {
-    if (ctx.createImageData) {
-        return ctx.createImageData(width, height);
-    } else {
-        return ctx.getImageData(0, 0, width, height);
+function convertArg(arg) {
+    if (Array.isArray(arg)) {
+        return pointFromArray(arg);
+    } else if (typeof arg === 'number') {
+        return pointFromNumber(arg);
+    } else if (isPoint(arg)) {
+        return arg;
     }
 }
 
-// RENDERING.
-
-// The Layer and ImageCanvas objects don't do any actual pixel operations themselves,
-// they only contain information about the operations. The actual rendering is done
-// by a Renderer object. Currently there is only one kind available, the CanvasRenderer,
-// which uses the HTML Canvas object (containing the pixel data) and a 2D context that
-// acts on this canvas object. In the future, a webgl renderer might be added as well.
+Img = function (canvas, x, y) {
+    this.canvas = canvas;
+    this.originalWidth = canvas ? canvas.width : 0;
+    this.originalHeight = canvas ? canvas.height: 0;
+    this.transform = x || y ? Transform.translate(x, y) : Layer.IDENTITY_TRANSFORM;
+};
 
-var CanvasRenderer = {};
+Img.prototype.clone = function () {
+    var n = new Img();
+    n.canvas = this.canvas;
+    n.originalWidth = this.originalWidth;
+    n.originalHeight = this.originalHeight;
+    n.transform = this.transform;
+    return n;
+};
 
-// Renders a html canvas as an html Image. Currently unused.
-CanvasRenderer.toImage = function (canvas) {
-    var img = new Image();
-    img.width = canvas.width;
-    img.height = canvas.height;
-    img.src = canvas.toDataURL();
-    return img;
+Img.prototype.withCanvas = function (canvas) {
+    var n = this.clone();
+    n.canvas = canvas;
+    return n;
 };
 
-// 'LOADING' OF LAYERS.
+Img.prototype._transform = function (t) {
+    var n = this.clone();
+    n.transform = n.transform.prepend(t);
+    return n;
+};
 
-// Returns a html canvas dependent on the type of the layer provided.
-CanvasRenderer.load = function (iCanvas, layer) {
-    if (layer.isFill()) {
-        return CanvasRenderer.generateColor(iCanvas, layer);
-    } else if (layer.isGradient()) {
-        return CanvasRenderer.generateGradient(iCanvas, layer);
-    } else if (layer.isHtmlCanvas()) {
-        return CanvasRenderer.loadHtmlCanvas(layer.data);
-    } else if (layer.isImage()) {
-        return CanvasRenderer.loadImage(layer.data);
-    } else if (layer.isImageCanvas()) {
-        return CanvasRenderer.loadImageCanvas(layer.data);
+Img.prototype.translate = function (position) {
+    var t = pointFromNumber(0);
+    var args = arguments;
+    if (args.length === 1 && isValidArg(position)) {
+        t = convertArg(position);
+    } else if (args.length === 2) {
+        t = {x: args[0], y: args[1]};
     }
+    if (t.x === 0 && t.y === 0) { return this; }
+    return this._transform(Transform.translate(t.x, t.y));
 };
 
-// Passes a html canvas.
-CanvasRenderer.loadHtmlCanvas = function (canvas) {
-    return canvas;
+Img.prototype.rotate = function (angle) {
+    if (!angle) { return this; }
+    var o = pointFromNumber(0);
+    var args = arguments;
+    if (args.length === 2) {
+        o = convertArg(args[1]);
+    } else if (args.length === 3) {
+        o = {x: args[1], y: args[2]};
+    }
+    return this._transform(Transform.translate(o.x, o.y).rotate(angle).translate(-o.x, -o.y));
 };
 
-// Returns a html canvas from rendering an ImageCanvas.
-CanvasRenderer.loadImageCanvas = function (iCanvas) {
-    return iCanvas.render();
+Img.prototype.scale = function (scale) {
+    var s = pointFromNumber(1);
+    var o = pointFromNumber(0);
+    var args = arguments;
+    if (args.length === 1 && isValidArg(scale)) {
+        s = convertArg(scale);
+    } else if (args.length === 2) {
+        if (typeof scale === 'number' && typeof args[1] === 'number') {
+            s = {x: args[0], y: args[1]};
+        } else {
+            s = convertArg(scale);
+            o = convertArg(args[1]);
+        }
+    } else if (args.length === 4) {
+        s = {x: args[0], y: args[1]};
+        o = {x: args[2], y: args[3]};
+    }
+    if (s.x === 1 && s.y === 1) { return this; }
+    return this._transform(Transform.translate(o.x, o.y).scale(s.x, s.y).translate(-o.x, -o.y));
 };
 
-// Returns a html canvas from rendering a stored Image file.
-CanvasRenderer.loadImage = function (img) {
-    var canvas = document.createElement('canvas');
-    var ctx = canvas.getContext('2d');
-    canvas.width = img.width;
-    canvas.height = img.height;
-    ctx.drawImage(img, 0, 0, canvas.width, canvas.height);
-    return canvas;
+Img.prototype.skew = function (skew) {
+    var k = pointFromNumber(0);
+    var o = pointFromNumber(0);
+    var args = arguments;
+    if (args.length === 1 && isValidArg(skew)) {
+        k = convertArg(skew);
+    } else if (args.length === 2) {
+        if (typeof skew === 'number' && typeof args[1] === 'number') {
+            k = {x: args[0], y: args[1]};
+        } else {
+            k = convertArg(skew);
+            o = convertArg(args[1]);
+        }
+    } else if (args.length === 4) {
+        k = {x: args[0], y: args[1]};
+        o = {x: args[2], y: args[3]};
+    }
+    if (k.x === 0 && k.y === 0) { return this; }
+    return this._transform(Transform.translate(o.x, o.y).skew(k.x, k.y).translate(-o.x, -o.y));
 };
 
-// Returns a html canvas with a solid fill color.
-CanvasRenderer.generateColor = function (iCanvas, layer) {
-    var width = layer.width !== undefined ? layer.width : iCanvas.width;
-    var height = layer.height !== undefined ? layer.height : iCanvas.height;
-    var canvas = document.createElement('canvas');
-    var ctx = canvas.getContext('2d');
-
-    canvas.width = width;
-    canvas.height = height;
-    ctx.fillStyle = layer.data;
-    ctx.fillRect(0, 0, width, height);
-    return canvas;
+Img.prototype.transformed = function () {
+    return img.merge([this]);
 };
 
-// Returns a html canvas with a gradient.
-CanvasRenderer.generateGradient = function (iCanvas, layer) {
-    var grd, x1, y1, x2, y2;
-    var width = layer.width !== undefined ? layer.width : iCanvas.width;
-    var height = layer.height !== undefined ? layer.height : iCanvas.height;
-    var cx = width / 2;
-    var cy = height / 2;
-    var canvas = document.createElement('canvas');
-    var ctx = canvas.getContext('2d');
-    var data = layer.data;
-    var type = data.type || 'linear';
-    var rotateDegrees = data.rotation || 0;
+Img.prototype.bounds = function () {
+    var t = this.transform;
+    var x = this.originalWidth / 2;
+    var y = this.originalHeight / 2;
 
-    if (type === 'radial') {
-        grd = ctx.createRadialGradient(cx, cy, 0, cx, cy, Math.min(width, height) / 2);
-    } else {
-        // Rotation code taken from html5-canvas-gradient-creator:
-        // Website: http://victorblog.com/html5-canvas-gradient-creator/
-        // Code: https://github.com/evictor/html5-canvas-gradient-creator/blob/master/js/src/directive/previewCanvas.coffee
-        if (rotateDegrees < 0) {
-            rotateDegrees += 360;
-        }
-        if ((0 <= rotateDegrees && rotateDegrees < 45)) {
-            x1 = 0;
-            y1 = height / 2 * (45 - rotateDegrees) / 45;
-            x2 = width;
-            y2 = height - y1;
-        } else if ((45 <= rotateDegrees && rotateDegrees < 135)) {
-            x1 = width * (rotateDegrees - 45) / (135 - 45);
-            y1 = 0;
-            x2 = width - x1;
-            y2 = height;
-        } else if ((135 <= rotateDegrees && rotateDegrees < 225)) {
-            x1 = width;
-            y1 = height * (rotateDegrees - 135) / (225 - 135);
-            x2 = 0;
-            y2 = height - y1;
-        } else if ((225 <= rotateDegrees && rotateDegrees < 315)) {
-            x1 = width * (1 - (rotateDegrees - 225) / (315 - 225));
-            y1 = height;
-            x2 = width - x1;
-            y2 = 0;
-        } else if (315 <= rotateDegrees) {
-            x1 = 0;
-            y1 = height - height / 2 * (rotateDegrees - 315) / (360 - 315);
-            x2 = width;
-            y2 = height - y1;
+    var p1 = {x: -x, y: -y};
+    var p2 = {x: x, y: -y};
+    var p3 = {x: -x, y: y};
+    var p4 = {x: x, y: y};
+    var points = [p1, p2, p3, p4];
+    var pt, minx, miny, maxx, maxy;
+
+    for (var i = 0; i < 4; i += 1) {
+        pt = t.transformPoint(points[i]);
+        if (i === 0) {
+            minx = maxx = pt.x;
+            miny = maxy = pt.y;
+        } else {
+            if (pt.x < minx) {
+                minx = pt.x;
+            }
+            if (pt.x > maxx) {
+                maxx = pt.x;
+            }
+            if (pt.y < miny) {
+                miny = pt.y;
+            }
+            if (pt.y > maxy) {
+                maxy = pt.y;
+            }
         }
-        grd = ctx.createLinearGradient(x1, y1, x2, y2);
     }
-    grd.addColorStop(data.spread || 0, data.startColor);
-    grd.addColorStop(1, data.endColor);
+    return {x: minx, y: miny, width: maxx - minx, height: maxy - miny};
+};
 
-    canvas.width = width;
-    canvas.height = height;
-    ctx.fillStyle = grd;
-    ctx.fillRect(0, 0, width, height);
-    return canvas;
+Img.prototype.colorize = function (color) {
+    var colorLayer = Layer.fromColor(color);
+    colorLayer.width = this.originalWidth;
+    colorLayer.height = this.originalHeight;
+    var i = new Img(colorLayer.toCanvas());
+    i = i._transform(this.transform.matrix());
+    return img.merge([this, i]);
 };
 
-// PROCESSING OF LAYERS.
+Img.prototype.desaturate = function (options) {
+    var layer = this.toLayer(false);
+    layer.addFilter('desaturate', options);
+    return this.withCanvas(layer.toCanvas());
+};
 
-// Performs a number of filtering operations on an html image.
-CanvasRenderer.processImage = function (canvas, filters) {
-    if (filters.length === 0) {
-        return canvas;
+Img.prototype.crop = function (bounding) {
+    // Calculates the intersecting rectangle of two input rectangles.
+    function rectIntersect(r1, r2) {
+        var right1 = r1.x + r1.width,
+            bottom1 = r1.y + r1.height,
+            right2 = r2.x + r2.width,
+            bottom2 = r2.y + r2.height,
+
+            x = Math.max(r1.x, r2.x),
+            y = Math.max(r1.y, r2.y),
+            w = Math.max(Math.min(right1, right2) - x, 0),
+            h = Math.max(Math.min(bottom1, bottom2) - y, 0);
+        return {x: x, y: y, width: w, height: h};
     }
-    var filter, tmpData;
-    var ctx = canvas.getContext('2d');
-    var width = canvas.width;
-    var height = canvas.height;
-    var inData = ctx.getImageData(0, 0, width, height);
-    var outData = createImageData(ctx, width, height);
 
-    for (var i = 0; i < filters.length; i += 1) {
-        if (i > 0) {
-            tmpData = inData;
-            inData = outData;
-            outData = tmpData;
-        }
-        filter = filters[i];
-        process[filter.name](inData.data, outData.data, width, height, filter.options);
+    var iBounds = this.bounds();
+    var bounds = bounding.bounds();
+    var ri = rectIntersect(iBounds, bounds);
+    var width = Math.ceil(ri.width);
+    var height = Math.ceil(ri.height);
+
+    if (ri.width === 0 || ri.height === 0) {
+        throw new Error('Resulting image has no dimensions');
     }
 
-    ctx.putImageData(outData, 0, 0);
-    return canvas;
+    var canvas = new img.ImageCanvas(width, height);
+    var l1 = canvas.addLayer(this.toLayer());
+    l1.translate(width / 2 - bounds.width - bounds.x,
+        height / 2 - bounds.height - bounds.y);
+    if (width < bounds.width && ri.x > iBounds.x) {
+        l1.translate(bounds.width - width, 0);
+    }
+    if (height < bounds.height && ri.y > iBounds.y) {
+        l1.translate(0, bounds.height - height);
+    }
+
+    return new Img(canvas.render(), ri.x + width / 2, ri.y + height / 2);
 };
 
-// Renders the layer mask and applies it to the layer that it is supposed to mask.
-CanvasRenderer.processMask = function (canvas, mask) {
-    if (mask.layers.length === 0) {
-        return canvas;
+Img.prototype.draw = function (ctx) {
+    ctx.save();
+    var m = this.transform.matrix();
+    ctx.transform(m[0], m[1], m[3], m[4], m[6], m[7]);
+    ctx.translate(-this.originalWidth / 2, -this.originalHeight / 2);
+    ctx.drawImage(this.canvas, 0, 0);
+    ctx.restore();
+};
+
+Img.prototype.toLayer = function (copyTransformations) {
+    var canvas = document.createElement('canvas');
+    canvas.width = this.canvas.width;
+    canvas.height = this.canvas.height;
+    var ctx = canvas.getContext('2d');
+    ctx.drawImage(this.canvas, 0, 0);
+    var layer = img.Layer.fromHtmlCanvas(canvas);
+    if (copyTransformations === undefined) {
+        copyTransformations = true;
     }
-    mask.width = canvas.width;
-    mask.height = canvas.height;
-    // First, make a black and white version of the masking canvas and pass
-    // the result to the masking operation.
-    var c = CanvasRenderer.renderBW(mask);
-    var data = c.getContext('2d').getImageData(0, 0, c.width, c.height).data;
-    var maskFilter = {name: 'mask', options: {data: data, x: 0, y: 0, width: c.width, height: c.height} };
-    return CanvasRenderer.processImage(canvas, [maskFilter]);
+    if (copyTransformations) {
+        layer.transform = this.transform;
+    }
+    return layer;
 };
 
-// Processes a single layer. First the layer image is loaded, then a mask (if applicable) is applied to it,
-// and finally the filters (if any) are applied to it.
-CanvasRenderer.processLayer = function (iCanvas, layer) {
-    var layerImage = CanvasRenderer.load(iCanvas, layer);
-    var maskedImage = CanvasRenderer.processMask(layerImage, layer.mask);
-    return CanvasRenderer.processImage(maskedImage, layer.filters);
+Img.prototype.getPixels = function () {
+    return new Pixels(this.canvas);
 };
 
+Img.prototype.toImage = function () {
+    var b = this.bounds();
+    var cropped = this.crop({bounds: function() { return b; }});
+    var i = new Image();
+    i.width = cropped.canvas.width;
+    i.height = cropped.canvas.height;
+    i.src = cropped.canvas.toDataURL();
+    return i;
+};
 
-// LAYER TRANFORMATIONS.
+img = {};
+img.Layer = Layer;
+img.ImageCanvas = ImageCanvas;
+img.Img = Img;
+img.Pixels = Pixels;
 
+// MODULE SUPPORT ///////////////////////////////////////////////////////
 
-// Transforms the 2d context that acts upon this layer's image. Utility function. -> Rename this?
-function transformLayer(ctx, iCanvas, layer) {
-    var m = layer.transform.matrix();
+var async = require('async');
 
-    ctx.translate(iCanvas.width / 2, iCanvas.height / 2);
-    ctx.transform(m[0], m[1], m[3], m[4], m[6], m[7]);
-    if (layer.flip_h || layer.flip_v) {
-        ctx.scale(layer.flip_h ? -1 : 1, layer.flip_v ? -1 : 1);
-    }
-    ctx.translate(-layer.img.width / 2, -layer.img.height / 2);
+function loadImage(image, callback) {
+    var img = new Image();
+    img.onload = function () {
+        callback(null, [image, this]);
+    };
+    img.src = image;
 }
 
-// Transforms the bounds of a layer (the bounding rectangle) and returns the bounding rectangle
-// that encloses this transformed rectangle.
-function transformRect(iCanvas, layer) {
-    var pt, minx, miny, maxx, maxy;
-    var width = layer.img.width;
-    var height = layer.img.height;
-    var p1 = {x: 0, y: 0};
-    var p2 = {x: width, y: 0};
-    var p3 = {x: 0, y: height};
-    var p4 = {x: width, y: height};
-    var points = [p1, p2, p3, p4];
+function loadImages(images, callback) {
+    async.map(images,
+        loadImage, function (err, loadedImages) {
+            if (callback) {
+                var name, image;
+                var d = {};
+                for (var i = 0; i < loadedImages.length; i += 1) {
+                    name = loadedImages[i][0];
+                    image = loadedImages[i][1];
+                    d[name] = image;
+                }
+                callback(d);
+            }
+        });
+}
 
-    var t = util.transform();
-    t = t.translate(iCanvas.width / 2, iCanvas.height / 2);
-    t = t.append(layer.transform);
-    t = t.translate(-layer.img.width / 2, -layer.img.height / 2);
+function rectUnite(r1, r2) {
+    var x = Math.min(r1.x, r2.x),
+        y = Math.min(r1.y, r2.y),
+        width = Math.max(r1.x + r1.width, r2.x + r2.width) - x,
+        height = Math.max(r1.y + r1.height, r2.y + r2.height) - y;
+    return {x: x, y: y, width: width, height: height};
+}
 
-    for (var i = 0; i < 4; i += 1) {
-        pt = t.transformPoint(points[i]);
+function merge(images) {
+    var i, image, b, l;
+    for (i = 0; i < images.length; i += 1) {
+        image = images[i];
         if (i === 0) {
-            minx = maxx = pt.x;
-            miny = maxy = pt.y;
+            b = image.bounds();
         } else {
-            if (pt.x < minx) {
-                minx = pt.x;
-            }
-            if (pt.x > maxx) {
-                maxx = pt.x;
-            }
-            if (pt.y < miny) {
-                miny = pt.y;
-            }
-            if (pt.y > maxy) {
-                maxy = pt.y;
+            b = rectUnite(b, image.bounds());
+        }
+    }
+    var dx = b.width / 2 + b.x;
+    var dy = b.height / 2 + b.y;
+
+    var canvas = new ImageCanvas(b.width, b.height);
+    for (i = 0; i < images.length; i += 1) {
+        l = canvas.addLayer(images[i].toLayer());
+        l.translate(-dx, -dy);
+    }
+    return new Img(canvas.render(), dx, dy);
+}
+
+img.loadImages = loadImages;
+img.merge = merge;
+
+module.exports = img;
+
+},{"./asyncrenderer":14,"./canvasrenderer":16,"./util":19,"async":1}],18:[function(require,module,exports){
+/*!
+ * Image processing based on Pixastic library:
+ *
+ * Pixastic - JavaScript Image Processing
+ * http://pixastic.com/
+ * Copyright 2012, Jacob Seidelin
+ *
+ * Dual licensed under the MPL 1.1 or GPLv3 licenses.
+ * http://pixastic.com/license-mpl.txt
+ * http://pixastic.com/license-gpl-3.0.txt
+ *
+ */
+
+'use strict';
+
+var stackblur = require('stackblur');
+var util = require('./util');
+
+var clamp = util.clamp;
+
+var LUMINOSITY_ITU_R_BT601 = 'ITU-R BT.601';
+var LUMINOSITY_ITU_R_BT709 = 'ITU-R BT.709';
+
+function defaultOptions(options, defaults) {
+    if (!options) {
+        return defaults;
+    }
+    var opt, o = {};
+    for (opt in defaults) {
+        if (defaults.hasOwnProperty(opt)) {
+            if (typeof options[opt] === 'undefined') {
+                o[opt] = defaults[opt];
+            } else {
+                o[opt] = options[opt];
             }
         }
     }
-    return {x: minx, y: miny, width: maxx - minx, height: maxy - miny};
+    return o;
 }
 
-// Calculates the intersecting rectangle of two input rectangles.
-function rectIntersect(r1, r2) {
-    var right1 = r1.x + r1.width;
-    var bottom1 = r1.y + r1.height;
-    var right2 = r2.x + r2.width;
-    var bottom2 = r2.y + r2.height;
-
-    var x = Math.max(r1.x, r2.x);
-    var y = Math.max(r1.y, r2.y);
-    var w = Math.max(Math.min(right1, right2) - x, 0);
-    var h = Math.max(Math.min(bottom1, bottom2) - y, 0);
-    return {x: x, y: y, width: w, height: h};
+function smoothstep(a, b, x) {
+    /* Returns a smooth transition between 0.0 and 1.0 using Hermite interpolation (cubic spline),
+     * where x is a number between a and b. The return value will ease (slow down) as x nears a or b.
+     * For x smaller than a, returns 0.0. For x bigger than b, returns 1.0.
+     */
+    if (x < a) { return 0.0; }
+    if (x >=b) { return 1.0; }
+    x = (x - a) / ( b - a);
+    return x * x * (3 - 2 * x);
 }
 
-// Calculates the mimimal area that a transformed layer needs so that it
-// can still be drawn on the canvas. Returns a rectangle.
-function calcLayerRect(iCanvas, layer) {
-    var rect = transformRect(iCanvas, layer);
-    rect = rectIntersect(rect, {x: 0, y: 0, width: iCanvas.width, height: iCanvas.height});
-    return { x: Math.round(rect.x),
-        y: Math.round(rect.y),
-        width: Math.ceil(rect.width),
-        height: Math.ceil(rect.height)};
+function noise() {
+    return Math.random() * 0.5 + 0.5;
 }
 
-// Transforms a layer and returns the resulting pixel data.
-function getTransformedLayerData(iCanvas, layer, rect) {
-    var canvas = document.createElement('canvas');
-    var ctx = canvas.getContext('2d');
-    canvas.width = rect.width;
-    canvas.height = rect.height;
-    ctx.translate(-rect.x, -rect.y);
-    transformLayer(ctx, iCanvas, layer);
-    ctx.drawImage(layer.img, 0, 0);
-    return ctx.getImageData(0, 0, rect.width, rect.height);
+function colorDistance(scale, dest, src) {
+    return clamp(scale * dest + (1 - scale) * src, 0, 255);
 }
 
+function convolve3x3(inData, outData, width, height, kernel, alpha, invert, mono) {
+    var x, y, n = width * height * 4,
+        idx, r, g, b, a,
+        pyc, pyp, pyn,
+        pxc, pxp, pxn,
 
-// LAYER BLENDING.
-
-// Blends the subsequent layer images with the base layer and returns a single image.
-// This method is used when web workers aren't available for use on this system.
-CanvasRenderer.mergeManualBlend = function (iCanvas, layerData) {
-    return function (canvas) {
-        var layer, blendMode, blendData, tmpData, layerOptions, rect;
-        var ctx = canvas.getContext('2d');
-        var width = iCanvas.width;
-        var height = iCanvas.height;
-        var baseData = ctx.getImageData(0, 0, width, height);
-        var outData = createImageData(ctx, width, height);
-        for (var i = 0; i < layerData.length; i += 1) {
-            layer = layerData[i];
-            rect = calcLayerRect(iCanvas, layer);
-            if (rect.width > 0 && rect.height > 0) {
-                if (i > 0) {
-                    tmpData = baseData;
-                    baseData = outData;
-                    outData = tmpData;
-                }
-                blendData = getTransformedLayerData(iCanvas, layer, rect);
-                layerOptions = {data: blendData.data, width: rect.width, height: rect.height, opacity: layer.opacity, dx: rect.x, dy: rect.y};
-                if (blend[layer.blendmode] === undefined) {
-                    throw new Error('No blend mode named \'' + layer.blendmode + '\'');
-                }
-                blendMode = blend.realBlendMode(layer.blendmode);
-                blend[blendMode](baseData.data, outData.data, width, height, layerOptions);
-            }
-        }
-        ctx.putImageData(outData, 0, 0);
-        return canvas;
-    };
-};
-
-// Renders a single layer. This is useful when there's only one layer available (and no blending is needed)
-// or to render the base layer on which subsequent layers are blended.
-CanvasRenderer.singleLayerWithOpacity = function (iCanvas, layer) {
-    var canvas = document.createElement('canvas');
-    var ctx = canvas.getContext('2d');
-
-    canvas.width = iCanvas.width;
-    canvas.height = iCanvas.height;
-
-    ctx.save();
-    transformLayer(ctx, iCanvas, layer);
-    if (layer.opacity !== 1) {
-        ctx.globalAlpha = layer.opacity;
-    }
-    ctx.drawImage(layer.img, 0, 0);
-    ctx.restore();
-    return canvas;
-};
-
-// Blends the subsequent layer images with the base layer and returns the resulting image.
-// This method is used when the system supports the requested blending mode(s).
-CanvasRenderer.mergeNativeBlend = function (iCanvas, layerData) {
-    return function (canvas) {
-        var ctx = canvas.getContext('2d');
-        var layer;
-        for (var i = 0; i < layerData.length; i += 1) {
-            layer = layerData[i];
-            ctx.save();
-            transformLayer(ctx, iCanvas, layer);
-            if (layer.opacity !== 1) {
-                ctx.globalAlpha = layer.opacity;
-            }
-            if (layer.blendmode !== 'source-over') {
-                ctx.globalCompositeOperation = blend.realBlendMode(layer.blendmode);
-            }
-            ctx.drawImage(layer.img, 0, 0);
-            ctx.restore();
-        }
-        return canvas;
-    };
-};
+        k00 = kernel[0][0], k01 = kernel[0][1], k02 = kernel[0][2],
+        k10 = kernel[1][0], k11 = kernel[1][1], k12 = kernel[1][2],
+        k20 = kernel[2][0], k21 = kernel[2][1], k22 = kernel[2][2],
 
-CanvasRenderer.createRenderPipe = function (Renderer, iCanvas, layerData) {
-    var mode, useNative, currentList, layer;
-    var renderPipe = [];
+        p00, p01, p02,
+        p10, p11, p12,
+        p20, p21, p22;
 
-    function pushList() {
-        if (useNative !== undefined) {
-            var fn = useNative ? Renderer.mergeNativeBlend : Renderer.mergeManualBlend;
-            renderPipe.push(fn(iCanvas, currentList));
-        }
-    }
+    for (y = 0; y < height; y += 1) {
+        pyc = y * width * 4;
+        pyp = pyc - width * 4;
+        pyn = pyc + width * 4;
 
-    for (var i = 1; i < layerData.length; i += 1) {
-        layer = layerData[i];
-        mode = layer.blendmode;
-        // todo: handle blendmode aliases.
-        if (useNative === undefined || useNative !== nativeBlendModes[mode]) {
-            pushList();
-            currentList = [];
+        if (y < 1) {
+            pyp = pyc;
         }
-        currentList.push(layer);
-        useNative = nativeBlendModes[mode];
-        if (i === layerData.length - 1) {
-            pushList();
+        if (y >= width - 1) {
+            pyn = pyc;
         }
-    }
-    return renderPipe;
-};
-
-// Merges the different canvas layers together in a single image and returns this as a html canvas.
-CanvasRenderer.merge = function (iCanvas, layerData) {
-    var renderPipe = CanvasRenderer.createRenderPipe(CanvasRenderer, iCanvas, layerData);
-    var canvas = CanvasRenderer.singleLayerWithOpacity(iCanvas, layerData[0]);
-    for (var i = 0; i < renderPipe.length; i += 1) {
-        canvas = renderPipe[i](canvas);
-    }
-    return canvas;
-};
 
-CanvasRenderer.composite = function (iCanvas, layerData) {
-    if (!layerData || layerData.length === 0) {
-        return null;
-    }
-    if (layerData.length === 1) {
-        return CanvasRenderer.singleLayerWithOpacity(iCanvas, layerData[0]);
-    }
-
-    return CanvasRenderer.merge(iCanvas, layerData);
-};
+        for (x = 0; x < width; x += 1) {
+            idx = (y * width + x) * 4;
 
-// Returns an object with additional layer information as well as the input images
-// to be passed to the different processing functions.
-CanvasRenderer.getLayerData = function (iCanvas, layerImages) {
-    var d, layer, layerImg;
-    var layerData = [];
-    for (var i = 0; i < layerImages.length; i += 1) {
-        layer = iCanvas.layers[i];
-        layerImg = layerImages[i];
-        d = { img: layerImg,
-            opacity: layer.opacity,
-            blendmode: layer.blendmode,
-            transform: layer.transform,
-            flip_h: layer.flip_h, flip_v: layer.flip_v
-        };
-        layerData.push(d);
-    }
-    return layerData;
-};
+            pxc = x * 4;
+            pxp = pxc - 4;
+            pxn = pxc + 4;
 
-// Renders the image canvas. Top level.
-CanvasRenderer.render = function (iCanvas) {
-    var layerImages = [];
-    for (var i = 0; i < iCanvas.layers.length; i += 1) {
-        layerImages.push(CanvasRenderer.processLayer(iCanvas, iCanvas.layers[i]));
-    }
-    return CanvasRenderer.composite(iCanvas, CanvasRenderer.getLayerData(iCanvas, layerImages));
-};
+            if (x < 1) {
+                pxp = pxc;
+            }
+            if (x >= width - 1) {
+                pxn = pxc;
+            }
 
-// Renders the image canvas and turns it into a black and white image. Useful for rendering a layer mask.
-CanvasRenderer.renderBW = function (iCanvas) {
-    var canvas = CanvasRenderer.render(iCanvas);
-    var data = canvas.getContext('2d').getImageData(0, 0, canvas.width, canvas.height).data;
-    var bwFilter = {name: 'desaturate', options: {method: 'ITU-R BT.709'}};
-    return CanvasRenderer.processImage(canvas, [bwFilter]);
-};
+            p00 = pyp + pxp;
+            p01 = pyp + pxc;
+            p02 = pyp + pxn;
+            p10 = pyc + pxp;
+            p11 = pyc + pxc;
+            p12 = pyc + pxn;
+            p20 = pyn + pxp;
+            p21 = pyn + pxc;
+            p22 = pyn + pxn;
 
-module.exports = CanvasRenderer;
+            r = inData[p00] * k00 + inData[p01] * k01 + inData[p02] * k02 +
+                inData[p10] * k10 + inData[p11] * k11 + inData[p12] * k12 +
+                inData[p20] * k20 + inData[p21] * k21 + inData[p22] * k22;
 
-},{"./blend":16,"./process":19,"./util":20}],18:[function(require,module,exports){
-'use strict';
+            g = inData[p00 + 1] * k00 + inData[p01 + 1] * k01 + inData[p02 + 1] * k02 +
+                inData[p10 + 1] * k10 + inData[p11 + 1] * k11 + inData[p12 + 1] * k12 +
+                inData[p20 + 1] * k20 + inData[p21 + 1] * k21 + inData[p22 + 1] * k22;
 
-var util = require('./util');
-var CanvasRenderer = require('./canvasrenderer');
-var AsyncRenderer = require('./asyncrenderer');
+            b = inData[p00 + 2] * k00 + inData[p01 + 2] * k01 + inData[p02 + 2] * k02 +
+                inData[p10 + 2] * k10 + inData[p11 + 2] * k11 + inData[p12 + 2] * k12 +
+                inData[p20 + 2] * k20 + inData[p21 + 2] * k21 + inData[p22 + 2] * k22;
 
-var img, ImageCanvas, Layer, Img;
+            if (alpha) {
+                a = inData[p00 + 3] * k00 + inData[p01 + 3] * k01 + inData[p02 + 3] * k02 +
+                    inData[p10 + 3] * k10 + inData[p11 + 3] * k11 + inData[p12 + 3] * k12 +
+                    inData[p20 + 3] * k20 + inData[p21 + 3] * k21 + inData[p22 + 3] * k22;
+            } else {
+                a = inData[idx + 3];
+            }
 
-var DEFAULT_WIDTH = 800;
-var DEFAULT_HEIGHT = 800;
+            if (mono) {
+                r = g = b = (r + g + b) / 3;
+            }
+            if (invert) {
+                r = 255 - r;
+                g = 255 - g;
+                b = 255 - b;
+            }
 
-// Different layer types.
-var TYPE_PATH = 'path';
-var TYPE_IMAGE = 'image';
-var TYPE_HTML_CANVAS = 'htmlCanvas';
-var TYPE_IMAGE_CANVAS = 'iCanvas';
-var TYPE_FILL = 'fill';
-var TYPE_GRADIENT = 'gradient';
+            outData[idx] = r;
+            outData[idx + 1] = g;
+            outData[idx + 2] = b;
+            outData[idx + 3] = a;
+        }
+    }
+}
 
-var IDENTITY_TRANSFORM = util.transform();
-var Transform = IDENTITY_TRANSFORM;
+function convolve5x5(inData, outData, width, height, kernel, alpha, invert, mono) {
+    var x, y, n = width * height * 4,
+        idx, r, g, b, a,
+        pyc, pyp, pyn, pypp, pynn,
+        pxc, pxp, pxn, pxpp, pxnn,
 
-var clamp = util.clamp;
+        k00 = kernel[0][0], k01 = kernel[0][1], k02 = kernel[0][2], k03 = kernel[0][3], k04 = kernel[0][4],
+        k10 = kernel[1][0], k11 = kernel[1][1], k12 = kernel[1][2], k13 = kernel[1][3], k14 = kernel[1][4],
+        k20 = kernel[2][0], k21 = kernel[2][1], k22 = kernel[2][2], k23 = kernel[2][3], k24 = kernel[2][4],
+        k30 = kernel[3][0], k31 = kernel[3][1], k32 = kernel[3][2], k33 = kernel[3][3], k34 = kernel[3][4],
+        k40 = kernel[4][0], k41 = kernel[4][1], k42 = kernel[4][2], k43 = kernel[4][3], k44 = kernel[4][4],
 
-// Named colors supported by all browsers.
-// See: http://www.w3schools.com/html/html_colornames.asp
-var colors = ['aliceblue', 'antiquewhite', 'aqua', 'aquamarine', 'azure', 'beige', 'bisque', 'black', 'blanchedalmond', 'blue', 'blueviolet', 'brown', 'burlywood', 'cadetblue', 'chartreuse', 'chocolate', 'coral', 'cornflowerblue', 'cornsilk', 'crimson', 'cyan', 'darkblue', 'darkcyan', 'darkgoldenrod', 'darkgray', 'darkgreen', 'darkkhaki', 'darkmagenta', 'darkolivegreen', 'darkorange', 'darkorchid', 'darkred', 'darksalmon', 'darkseagreen', 'darkslateblue', 'darkslategray', 'darkturquoise', 'darkviolet', 'deeppink', 'deepskyblue', 'dimgray', 'dimgrey', 'dodgerblue', 'firebrick', 'floralwhite', 'forestgreen', 'fuchsia', 'gainsboro', 'ghostwhite', 'gold', 'goldenrod', 'gray', 'green', 'greenyellow', 'grey', 'honeydew', 'hotpink', 'indianred', 'indigo', 'ivory', 'khaki', 'lavender', 'lavenderblush', 'lawngreen', 'lemonchiffon', 'lightblue', 'lightcoral', 'lightcyan', 'lightgoldenrodyellow', 'lightgreen', 'lightgrey', 'lightpink', 'lightsalmon', 'lightseagreen', 'lightskyblue', 'lightslategray', 'lightsteelblue', 'lightyellow', 'lime', 'limegreen', 'linen', 'maroon', 'mediumaquamarine', 'mediumblue', 'mediumorchid', 'mediumpurple', 'mediumseagreen', 'mediumslateblue', 'mediumspringgreen', 'mediumturquoise', 'mediumvioletred', 'midnightblue', 'mintcream', 'mistyrose', 'moccasin', 'navajowhite', 'navy', 'oldlace', 'olive', 'olivedrab', 'orange', 'orangered', 'orchid', 'palegoldenrod', 'palegreen', 'paleturquoise', 'palevioletred', 'papayawhip', 'peachpuff', 'peru', 'pink', 'plum', 'powderblue', 'purple', 'red', 'rosybrown', 'royalblue', 'saddlebrown', 'salmon', 'sandybrown', 'seagreen', 'seashell', 'sienna', 'silver', 'skyblue', 'slateblue', 'slategray', 'snow', 'springgreen', 'steelblue', 'tan', 'teal', 'thistle', 'tomato', 'transparent', 'turquoise', 'violet', 'wheat', 'white', 'whitesmoke', 'yellow', 'yellowgreen'];
+        p00, p01, p02, p03, p04,
+        p10, p11, p12, p13, p14,
+        p20, p21, p22, p23, p24,
+        p30, p31, p32, p33, p34,
+        p40, p41, p42, p43, p44;
 
+    for (y = 0; y < height; y += 1) {
+        pyc = y * width * 4;
+        pyp = pyc - width * 4;
+        pypp = pyc - width * 4 * 2;
+        pyn = pyc + width * 4;
+        pynn = pyc + width * 4 * 2;
 
-// Converts a number of arguments to a type of color argument that the html canvas context can understand:
-// a named color, a hex color or a string in the form of rgba(r, g, b, a)
-function toColor(v1, v2, v3, v4, v5) {
-    var _r, _g, _b, _a, R, G, B, rgb, options;
-    if (v1 === undefined) {
-        _r = _g = _b = 0;
-        _a = 1;
-    } else if (Array.isArray(v1)) {
-        options = v2 || {};
-        _r = v1[0] !== undefined ? v1[0] : 0;
-        _g = v1[1] !== undefined ? v1[1] : 0;
-        _b = v1[2] !== undefined ? v1[2] : 0;
-        _a = v1[3] !== undefined ? v1[3] : options.base || 1;
-    } else if (v1.r !== undefined) {
-        options = v2 || {};
-        _r = v1.r;
-        _g = v1.g;
-        _b = v1.b;
-        _a = v1.a !== undefined ? v1.a : options.base || 1;
-    } else if (typeof v1 === 'string') {
-        if (v1.indexOf('#') === 0) {
-            return v1;
+        if (y < 1) {
+            pyp = pyc;
         }
-        if (v1.indexOf('rgb') === 0) {
-            return v1;
+        if (y >= width - 1) {
+            pyn = pyc;
         }
-        if (colors.indexOf(v1) !== -1) {
-            return v1;
+        if (y < 2) {
+            pypp = pyp;
         }
-    } else if (typeof v1 === 'number') {
-        if (arguments.length === 1) { // Grayscale value
-            _r = _g = _b = v1;
-            _a = 1;
-        } else if (arguments.length === 2) { // Gray and alpha or options
-            _r = _g = _b = v1;
-            if (typeof v2 === 'number') {
-                _a = v2;
-            } else {
-                options = v2;
-                _a = options.base || 1;
+        if (y >= width - 2) {
+            pynn = pyn;
+        }
+
+        for (x = 0; x < width; x += 1) {
+            idx = (y * width + x) * 4;
+
+            pxc = x * 4;
+            pxp = pxc - 4;
+            pxn = pxc + 4;
+            pxpp = pxc - 8;
+            pxnn = pxc + 8;
+
+            if (x < 1) {
+                pxp = pxc;
             }
-        } else if (arguments.length === 3) { // RGB or gray, alpha and options
-            if (typeof v3 === 'number') {
-                _r = v1;
-                _g = v2;
-                _b = v3;
-                _a = 1;
-            } else {
-                _r = _g = _b = v1;
-                _a = v2;
-                options = v3;
+            if (x >= width - 1) {
+                pxn = pxc;
             }
-        } else if (arguments.length === 4) { // RGB and alpha or options
-            _r = v1;
-            _g = v2;
-            _b = v3;
-            if (typeof v4 === 'number') {
-                _a = v4;
-            } else {
-                options = v4 || {};
-                _a = options.base || 1;
+            if (x < 2) {
+                pxpp = pxp;
+            }
+            if (x >= width - 2) {
+                pxnn = pxn;
             }
-        } else { // RGBA + options
-            _r = v1;
-            _g = v2;
-            _b = v3;
-            _a = v4;
-            options = v5;
-        }
-    }
-
-    if (!(typeof _r === 'number' &&
-        typeof _g === 'number' &&
-        typeof _b === 'number' &&
-        typeof _a === 'number')) {
-        throw new Error('Invalid color arguments');
-    }
 
-    options = options || {};
+            p00 = pypp + pxpp;
+            p01 = pypp + pxp;
+            p02 = pypp + pxc;
+            p03 = pypp + pxn;
+            p04 = pypp + pxnn;
+            p10 = pyp + pxpp;
+            p11 = pyp + pxp;
+            p12 = pyp + pxc;
+            p13 = pyp + pxn;
+            p14 = pyp + pxnn;
+            p20 = pyc + pxpp;
+            p21 = pyc + pxp;
+            p22 = pyc + pxc;
+            p23 = pyc + pxn;
+            p24 = pyc + pxnn;
+            p30 = pyn + pxpp;
+            p31 = pyn + pxp;
+            p32 = pyn + pxc;
+            p33 = pyn + pxn;
+            p34 = pyn + pxnn;
+            p40 = pynn + pxpp;
+            p41 = pynn + pxp;
+            p42 = pynn + pxc;
+            p43 = pynn + pxn;
+            p44 = pynn + pxnn;
 
-    // The base option allows you to specify values in a different range.
-    if (options.base !== undefined) {
-        _r /= options.base;
-        _g /= options.base;
-        _b /= options.base;
-        _a /= options.base;
-    }
-    R = Math.round(_r * 255);
-    G = Math.round(_g * 255);
-    B = Math.round(_b * 255);
-    return 'rgba(' + R + ', ' + G + ', ' + B + ', ' + _a + ')';
-}
+            r = inData[p00] * k00 + inData[p01] * k01 + inData[p02] * k02 + inData[p03] * k04 + inData[p02] * k04 +
+                inData[p10] * k10 + inData[p11] * k11 + inData[p12] * k12 + inData[p13] * k14 + inData[p12] * k14 +
+                inData[p20] * k20 + inData[p21] * k21 + inData[p22] * k22 + inData[p23] * k24 + inData[p22] * k24 +
+                inData[p30] * k30 + inData[p31] * k31 + inData[p32] * k32 + inData[p33] * k34 + inData[p32] * k34 +
+                inData[p40] * k40 + inData[p41] * k41 + inData[p42] * k42 + inData[p43] * k44 + inData[p42] * k44;
 
-// Converts a number of arguments into a dictionary of gradient information that is understood by the renderer.
-function toGradientData(v1, v2, v3, v4, v5) {
-    var startColor, endColor, type, rotation, spread, d;
-    var data = {};
+            g = inData[p00 + 1] * k00 + inData[p01 + 1] * k01 + inData[p02 + 1] * k02 + inData[p03 + 1] * k04 + inData[p02 + 1] * k04 +
+                inData[p10 + 1] * k10 + inData[p11 + 1] * k11 + inData[p12 + 1] * k12 + inData[p13 + 1] * k14 + inData[p12 + 1] * k14 +
+                inData[p20 + 1] * k20 + inData[p21 + 1] * k21 + inData[p22 + 1] * k22 + inData[p23 + 1] * k24 + inData[p22 + 1] * k24 +
+                inData[p30 + 1] * k30 + inData[p31 + 1] * k31 + inData[p32 + 1] * k32 + inData[p33 + 1] * k34 + inData[p32 + 1] * k34 +
+                inData[p40 + 1] * k40 + inData[p41 + 1] * k41 + inData[p42 + 1] * k42 + inData[p43 + 1] * k44 + inData[p42 + 1] * k44;
 
-    if (arguments.length === 1) { // The argument is a dictionary or undefined.
-        d = v1 || {};
-        startColor = d.startColor;
-        endColor = d.endColor;
-        type = d.type;
-        rotation = d.rotation;
-        spread = d.spread;
-    } else if (arguments.length >= 2) { // The first two arguments are a start color and an end color.
-        startColor = v1;
-        endColor = v2;
-        type = 'linear';
-        rotation = 0;
-        spread = 0;
-        if (arguments.length === 3) {
-            if (typeof v3 === 'string') { // The type can be either linear or radial.
-                type = v3;
-            } else if (typeof v3 === 'number') { // The type is implicitly linear and the third argument is the rotation angle.
-                rotation = v3;
-            }
-        } else if (arguments.length === 4) {
-            if (typeof v3 === 'number') { // The type is implicitly linear and the third/forth arguments are the rotation angle and gradient spread.
-                rotation = v3;
-                spread = v4;
-            } else if (v3 === 'linear') { // The type is explicitly linear and the forth argument is the rotation angle.
-                rotation = v4;
-            } else if (v3 === 'radial') { // The type is explicitly radial and the forth argument is the gradient spread.
-                type = v3;
-                spread = v4;
+            b = inData[p00 + 2] * k00 + inData[p01 + 2] * k01 + inData[p02 + 2] * k02 + inData[p03 + 2] * k04 + inData[p02 + 2] * k04 +
+                inData[p10 + 2] * k10 + inData[p11 + 2] * k11 + inData[p12 + 2] * k12 + inData[p13 + 2] * k14 + inData[p12 + 2] * k14 +
+                inData[p20 + 2] * k20 + inData[p21 + 2] * k21 + inData[p22 + 2] * k22 + inData[p23 + 2] * k24 + inData[p22 + 2] * k24 +
+                inData[p30 + 2] * k30 + inData[p31 + 2] * k31 + inData[p32 + 2] * k32 + inData[p33 + 2] * k34 + inData[p32 + 2] * k34 +
+                inData[p40 + 2] * k40 + inData[p41 + 2] * k41 + inData[p42 + 2] * k42 + inData[p43 + 2] * k44 + inData[p42 + 2] * k44;
+
+            if (alpha) {
+                a = inData[p00 + 3] * k00 + inData[p01 + 3] * k01 + inData[p02 + 3] * k02 + inData[p03 + 3] * k04 + inData[p02 + 3] * k04 +
+                    inData[p10 + 3] * k10 + inData[p11 + 3] * k11 + inData[p12 + 3] * k12 + inData[p13 + 3] * k14 + inData[p12 + 3] * k14 +
+                    inData[p20 + 3] * k20 + inData[p21 + 3] * k21 + inData[p22 + 3] * k22 + inData[p23 + 3] * k24 + inData[p22 + 3] * k24 +
+                    inData[p30 + 3] * k30 + inData[p31 + 3] * k31 + inData[p32 + 3] * k32 + inData[p33 + 3] * k34 + inData[p32 + 3] * k34 +
+                    inData[p40 + 3] * k40 + inData[p41 + 3] * k41 + inData[p42 + 3] * k42 + inData[p43 + 3] * k44 + inData[p42 + 3] * k44;
             } else {
-                throw new Error('Wrong argument provided: ' + v3);
+                a = inData[idx + 3];
             }
-        } else if (arguments.length === 5) { // Type, rotation (unused in case of radial type gradient), and gradient spread.
-            type = v3;
-            rotation = v4;
-            spread = v5;
+
+            if (mono) {
+                r = g = b = (r + g + b) / 3;
+            }
+
+            if (invert) {
+                r = 255 - r;
+                g = 255 - g;
+                b = 255 - b;
+            }
+
+            outData[idx] = r;
+            outData[idx + 1] = g;
+            outData[idx + 2] = b;
+            outData[idx + 3] = a;
         }
     }
+}
 
-    if (!startColor && startColor !== 0) {
-        throw new Error('No startColor was given.');
-    }
-    if (!endColor && endColor !== 0) {
-        throw new Error('No endColor was given.');
-    }
+function gaussian(inData, outData, width, height, kernelSize) {
+    var x, y, i, j, n = width * height * 4,
+        r, g, b, a, idx,
+        inx, iny, w,
+        tmpData = [],
+        maxKernelSize = 13,
+        k1, k2, weights,
+        kernels = [
+            [1]
+        ];
 
-    try {
-        data.startColor = toColor(startColor);
-    } catch (e1) {
-        throw new Error('startColor is not a valid color: ' + startColor);
-    }
+    kernelSize = clamp(kernelSize, 3, maxKernelSize);
+    k1 = -kernelSize / 2 + (kernelSize % 2 ? 0.5 : 0);
+    k2 = kernelSize + k1;
 
-    try {
-        data.endColor = toColor(endColor);
-    } catch (e2) {
-        throw new Error('endColor is not a valid color: ' + endColor);
+    for (i = 1; i < maxKernelSize; i += 1) {
+        kernels[0][i] = 0;
     }
 
-    if (type === undefined) {
-        type = 'linear';
-    }
-    if (type !== 'linear' && type !== 'radial') {
-        throw new Error('Unknown gradient type: ' + type);
+    for (i = 1; i < maxKernelSize; i += 1) {
+        kernels[i] = [1];
+        for (j = 1; j < maxKernelSize; j += 1) {
+            kernels[i][j] = kernels[i - 1][j] + kernels[i - 1][j - 1];
+        }
     }
 
-    data.type = type;
+    weights = kernels[kernelSize - 1];
 
-    if (spread === undefined) {
-        spread = 0;
+    for (i = 0, w = 0; i < kernelSize; i += 1) {
+        w += weights[i];
     }
-    if (typeof spread !== 'number') {
-        throw new Error('Spread value is not a number: ' + spread);
+    for (i = 0; i < kernelSize; i += 1) {
+        weights[i] /= w;
     }
 
-    if (type === 'linear') {
-        if (rotation === undefined) {
-            rotation = 0;
+    // pass 1
+    for (y = 0; y < height; y += 1) {
+        for (x = 0; x < width; x += 1) {
+            r = g = b = a = 0;
+
+            for (i = k1; i < k2; i += 1) {
+                inx = x + i;
+                iny = y;
+                w = weights[i - k1];
+
+                if (inx < 0) {
+                    inx = 0;
+                }
+                if (inx >= width) {
+                    inx = width - 1;
+                }
+
+                idx = (iny * width + inx) * 4;
+
+                r += inData[idx] * w;
+                g += inData[idx + 1] * w;
+                b += inData[idx + 2] * w;
+                a += inData[idx + 3] * w;
+
+            }
+
+            idx = (y * width + x) * 4;
+
+            tmpData[idx] = r;
+            tmpData[idx + 1] = g;
+            tmpData[idx + 2] = b;
+            tmpData[idx + 3] = a;
         }
-        if (typeof rotation !== 'number') {
-            throw new Error('Rotation value is not a number: ' + rotation);
+    }
+
+    // pass 2
+    for (y = 0; y < height; y += 1) {
+        for (x = 0; x < width; x += 1) {
+            r = g = b = a = 0;
+
+            for (i = k1; i < k2; i += 1) {
+                inx = x;
+                iny = y + i;
+                w = weights[i - k1];
+
+                if (iny < 0) {
+                    iny = 0;
+                }
+                if (iny >= height) {
+                    iny = height - 1;
+                }
+
+                idx = (iny * width + inx) * 4;
+
+                r += tmpData[idx] * w;
+                g += tmpData[idx + 1] * w;
+                b += tmpData[idx + 2] * w;
+                a += tmpData[idx + 3] * w;
+            }
+
+            idx = (y * width + x) * 4;
+
+            outData[idx] = r;
+            outData[idx + 1] = g;
+            outData[idx + 2] = b;
+            outData[idx + 3] = a;
         }
-        data.rotation = rotation;
     }
+}
 
-    data.spread = clamp(spread, 0, 0.99);
+function getPixel(v, i) {
+    i *= 4;
+    return [v[i + 0], v[i + 1], v[i + 2], v[i + 3]];
+}
 
-    return data;
+function setPixel(v, i, rgba) {
+    i *= 4;
+    v[i + 0] = rgba[0];
+    v[i + 1] = rgba[1];
+    v[i + 2] = rgba[2];
+    v[i + 3] = rgba[3];
 }
 
-function findType(data) {
-    if (typeof data === 'string') {
-        return TYPE_PATH;
-    } else if (data instanceof Image) {
-        return TYPE_IMAGE;
-    } else if (data instanceof HTMLCanvasElement) {
-        return TYPE_HTML_CANVAS;
-    } else if (data instanceof ImageCanvas) {
-        return TYPE_IMAGE_CANVAS;
-    } else if (data.r !== undefined && data.g !== undefined && data.b !== undefined && data.a !== undefined) {
-        return TYPE_FILL;
-    } else if (data.startColor !== undefined && data.endColor !== undefined) {
-        return TYPE_GRADIENT;
+// Polar filters (distortion filters) are from canvas.js: https://github.com/clips/pattern/blob/master/pattern/canvas.js (BSD)
+// De Smedt T. & Daelemans W. (2012). Pattern for Python. Journal of Machine Learning Research.
+// Based on: L. Spagnolini, 2007
+
+function polar(inData, outData, x0, y0, width, height, callback) {
+    /* Sets image data based on a polar coordinates filter.
+     * The given callback is a function(distance, angle) that returns new [distance, angle].
+     */
+    x0 = width / 2 + (x0 || 0);
+    y0 = height / 2 + (y0 || 0);
+    var y1, x1, x, y, d, a, v;
+    for (y1 = 0; y1 < height; y1 += 1) {
+        for (x1 = 0; x1 < width; x1 += 1) {
+            x = x1 - x0;
+            y = y1 - y0;
+            d = Math.sqrt(Math.pow(x, 2) + Math.pow(y, 2));
+            a = Math.atan2(y, x);
+            v = callback(d, a);
+            d = v[0];
+            a = v[1];
+            setPixel(outData, x1 + y1 * width, getPixel(inData,
+                Math.round(x0 + Math.cos(a) * d) +
+                Math.round(y0 + Math.sin(a) * d) * width
+            ));
+        }
     }
-    throw new Error('Cannot establish type for data ', data);
 }
 
+var process = {
+
+    invert: function (inData, outData, width, height) {
+        var i, n = width * height * 4;
+
+        for (i = 0; i < n; i += 4) {
+            outData[i] = 255 - inData[i];
+            outData[i + 1] = 255 - inData[i + 1];
+            outData[i + 2] = 255 - inData[i + 2];
+            outData[i + 3] = inData[i + 3];
+        }
+    },
+
+    sepia: function (inData, outData, width, height) {
+        var i, n = width * height * 4,
+            r, g, b;
+
+        for (i = 0; i < n; i += 4) {
+            r = inData[i];
+            g = inData[i + 1];
+            b = inData[i + 2];
+            outData[i] = (r * 0.393 + g * 0.769 + b * 0.189);
+            outData[i + 1] = (r * 0.349 + g * 0.686 + b * 0.168);
+            outData[i + 2] = (r * 0.272 + g * 0.534 + b * 0.131);
+            outData[i + 3] = inData[i + 3];
+        }
+    },
+
+    solarize: function (inData, outData, width, height) {
+        var i, n = width * height * 4,
+            r, g, b;
+
+        for (i = 0; i < n; i += 4) {
+            r = inData[i];
+            g = inData[i + 1];
+            b = inData[i + 2];
+
+            outData[i] = r > 127 ? 255 - r : r;
+            outData[i + 1] = g > 127 ? 255 - g : g;
+            outData[i + 2] = b > 127 ? 255 - b : b;
+            outData[i + 3] = inData[i + 3];
+        }
+    },
+
+    brightness: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {
+            brightness: 1,
+            contrast: 0
+        });
+
+        var i, n = width * height * 4,
+            r, g, b,
+            contrast = clamp(options.contrast, -1, 1) / 2,
+            brightness = 1 + clamp(options.brightness, -1, 1),
+            brightMul = brightness < 0 ? -brightness : brightness,
+            brightAdd = brightness < 0 ? 0 : brightness,
+            contrastAdd;
+
+        contrast = 0.5 * Math.tan((contrast + 1) * Math.PI / 4);
+        contrastAdd = -(contrast - 0.5) * 255;
 
-// IMAGE LAYER.
+        for (i = 0; i < n; i += 4) {
+            r = inData[i];
+            g = inData[i + 1];
+            b = inData[i + 2];
 
-Layer = function (data, type) {
-    if (!type) {
-        type = findType(data);
-    }
-    this.data = data;
-    this.type = type;
+            r = (r + r * brightMul + brightAdd) * contrast + contrastAdd;
+            g = (g + g * brightMul + brightAdd) * contrast + contrastAdd;
+            b = (b + b * brightMul + brightAdd) * contrast + contrastAdd;
 
-    if (type === TYPE_HTML_CANVAS || type === TYPE_IMAGE_CANVAS || type === TYPE_IMAGE) {
-        this.width = data.width;
-        this.height = data.height;
-    }
+            outData[i] = r;
+            outData[i + 1] = g;
+            outData[i + 2] = b;
+            outData[i + 3] = inData[i + 3];
+        }
+    },
 
-    // Compositing.
-    this.opacity = 1.0;
-    this.blendmode = 'source-over';
+    desaturate: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {method: LUMINOSITY_ITU_R_BT601});
+        var i, n = width * height * 4,
+            level, rCoeff, gCoeff, bCoeff;
 
-    // Transformations.
-    this.transform = IDENTITY_TRANSFORM;
-    this.flip_h = false;
-    this.flip_v = false;
+        if (options.method === LUMINOSITY_ITU_R_BT601) {
+            rCoeff = 0.3; gCoeff = 0.59; bCoeff = 0.11;
+        } else if (options.method === LUMINOSITY_ITU_R_BT709) {
+            rCoeff = 0.2125; gCoeff = 0.7154; bCoeff = 0.0721;
+        }
 
-    // An alpha mask hides parts of the masked layer where the mask is darker.
-    this.mask = new ImageCanvas();
+        for (i = 0; i < n; i += 4) {
+            level = inData[i] * rCoeff + inData[i + 1] * gCoeff + inData[i + 2] * bCoeff;
+            outData[i] = level;
+            outData[i + 1] = level;
+            outData[i + 2] = level;
+            outData[i + 3] = inData[i + 3];
+        }
+    },
 
-    this.filters = [];
-};
+    lighten: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {amount: 0.25});
+        var i, n = width * height * 4,
+            mul = 1 + clamp(options.amount, 0, 1);
 
-Layer.Transform = Layer.IDENTITY_TRANSFORM = IDENTITY_TRANSFORM;
+        for (i = 0; i < n; i += 4) {
+            outData[i] = inData[i] * mul;
+            outData[i + 1] = inData[i + 1] * mul;
+            outData[i + 2] = inData[i + 2] * mul;
+            outData[i + 3] = inData[i + 3];
+        }
+    },
 
-// Copies the layer object.
-Layer.prototype.clone = function () {
-    function cloneFilter(filter) {
-        var key, value;
-        var f = {};
-        f.name = filter.name;
-        if (filter.options !== undefined) {
-            f.options = {};
-            var optionsKeys = Object.keys(filter.options);
-            for (var i = 0; i < optionsKeys.length; i += 1) {
-                key = optionsKeys[i];
-                value = filter.options[key];
-                if (Array.isArray(value)) {
-                    f.options[key] = value.slice(0);
+    noise: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {amount: 0.5, strength: 0.5, mono: false});
+        var i, n = width * height * 4,
+            rnd, r, g, b,
+            amount = clamp(options.amount, 0, 1),
+            strength = clamp(options.strength, 0, 1),
+            mono = !!options.mono,
+            random = Math.random;
+
+        for (i = 0; i < n; i += 4) {
+            r = inData[i];
+            g = inData[i + 1];
+            b = inData[i + 2];
+
+            rnd = random();
+
+            if (rnd < amount) {
+                if (mono) {
+                    rnd = strength * ((rnd / amount) * 2 - 1) * 255;
+                    r += rnd;
+                    g += rnd;
+                    b += rnd;
                 } else {
-                    f.options[key] = value;
+                    r += strength * random() * 255;
+                    g += strength * random() * 255;
+                    b += strength * random() * 255;
                 }
             }
+
+            outData[i] = r;
+            outData[i + 1] = g;
+            outData[i + 2] = b;
+            outData[i + 3] = inData[i + 3];
         }
-        return f;
-    }
+    },
 
-    var d = Object.create(Layer.prototype);
-    d.data = this.data;
-    d.type = this.type;
-    d.width = this.width;
-    d.height = this.height;
-    d.opacity = this.opacity;
-    d.blendmode = this.blendmode;
-    d.transform = this.transform;
-    d.flip_h = this.flip_h;
-    d.flip_v = this.flip_v;
-    d.mask = this.mask.clone();
-    d.filters = [];
+    flipv: function (inData, outData, width, height) {
+        var x, y, n = width * height * 4,
+            inPix, outPix;
 
-    if (this.type === TYPE_IMAGE_CANVAS) {
-        d.data = this.data.clone();
-    } else if (this.type === TYPE_GRADIENT) {
-        d.data = {
-            startColor: this.data.startColor,
-            endColor: this.data.endColor,
-            type: this.data.type,
-            rotation: this.data.rotation,
-            spread: this.data.spread
-        };
-    }
+        for (y = 0; y < height; y += 1) {
+            for (x = 0; x < width; x += 1) {
+                inPix = (y * width + x) * 4;
+                outPix = (y * width + (width - x - 1)) * 4;
 
-    for (var i = 0; i < this.filters.length; i += 1) {
-        d.filters.push(cloneFilter(this.filters[i]));
-    }
+                outData[outPix] = inData[inPix];
+                outData[outPix + 1] = inData[inPix + 1];
+                outData[outPix + 2] = inData[inPix + 2];
+                outData[outPix + 3] = inData[inPix + 3];
+            }
+        }
+    },
 
-    return d;
-};
+    fliph: function (inData, outData, width, height) {
+        var x, y, n = width * height * 4,
+            inPix, outPix;
 
-// Sets the opacity of the layer (requires a number in the range 0.0-1.0).
-Layer.prototype.setOpacity = function (opacity) {
-    this.opacity = clamp(opacity, 0, 1);
-};
+        for (y = 0; y < height; y += 1) {
+            for (x = 0; x < width; x += 1) {
+                inPix = (y * width + x) * 4;
+                outPix = ((height - y - 1) * width + x) * 4;
 
-// Within an image canvas, a layer is by default positioned in the center.
-// Translating moves the layer away from this center.
-// Each successive call to the translate function performs an additional translation on top of the current transformation matrix.
-Layer.prototype.translate = function (tx, ty) {
-    ty = ty === undefined ? 0 : ty;
-    var t = Transform.translate(tx, ty);
-    this.transform = this.transform.prepend(t);
-};
+                outData[outPix] = inData[inPix];
+                outData[outPix + 1] = inData[inPix + 1];
+                outData[outPix + 2] = inData[inPix + 2];
+                outData[outPix + 3] = inData[inPix + 3];
+            }
+        }
+    },
 
-// Scaling happens relatively in a 0.0-1.0 based range where 1.0 stands for 100%.
-// Each successive call to the scale function performs an additional scaling operation on top of the current transformation matrix.
-// If only one parameter is supplied, the layer is scaled proportionally.
-Layer.prototype.scale = function (sx, sy) {
-    sy = sy === undefined ? sx : sy;
-    var t = Transform.scale(sx, sy);
-    this.transform = this.transform.prepend(t);
-};
+    // Uses fast stackblur algorithm from http://www.quasimondo.com/StackBlurForCanvas
+    blur: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {radius: 10});
+        for (var i = 0; i < inData.length; i += 1) {
+            outData[i] = inData[i];
+        }
+        stackblur(outData, width, height, options.radius);
+    },
 
-// The supplied parameter should be in degrees (not radians).
-// Each successive call to the rotation function performs an additional rotation on top of the current transformation matrix.
-Layer.prototype.rotate = function (rot) {
-    var t = Transform.rotate(rot);
-    this.transform = this.transform.prepend(t);
-};
+    glow: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {amount: 0.75, kernelSize: 5});
+        var i, n = width * height * 4,
+            r, g, b,
+            amount = options.amount,
+            tmpData = [];
 
-// Each successive call to the skew function performs an additional skewing operation on top of the current transformation matrix.
-Layer.prototype.skew = function (kx, ky) {
-    ky = ky === undefined ? kx : ky;
-    var t = Transform.skew(kx, ky);
-    this.transform = this.transform.prepend(t);
-};
+        gaussian(inData, tmpData, width, height, options.kernelSize);
 
-// Flips the layer horizontally.
-Layer.prototype.flipHorizontal = function (arg) {
-    if (arg !== undefined) {
-        this.flip_h = arg;
-    } else {
-        this.flip_h = !this.flip_h;
-    }
-};
+        for (i = 0; i < n; i += 4) {
+            r = inData[i] + tmpData[i] * amount;
+            g = inData[i + 1] + tmpData[i + 1] * amount;
+            b = inData[i + 2] + tmpData[i + 2] * amount;
+            if (r > 255) {
+                r = 255;
+            }
+            if (g > 255) {
+                g = 255;
+            }
+            if (b > 255) {
+                b = 255;
+            }
+            outData[i] = r;
+            outData[i + 1] = g;
+            outData[i + 2] = b;
+            outData[i + 3] = inData[i + 3];
+        }
+    },
 
-// Flips the layer vertically.
-Layer.prototype.flipVertical = function (arg) {
-    if (arg !== undefined) {
-        this.flip_v = arg;
-    } else {
-        this.flip_v = !this.flip_v;
-    }
-};
+    convolve3x3: function (inData, outData, width, height, options) {
+        convolve3x3(inData, outData, width, height, options.kernel);
+    },
 
-Layer.prototype.addFilter = function (filter, options) {
-    this.filters.push({
-        name: filter,
-        options: options
-    });
-};
+    convolve5x5: function (inData, outData, width, height, options) {
+        convolve5x5(inData, outData, width, height, options.kernel);
+    },
 
-// Renders the layer to a new canvas.
-Layer.prototype.draw = function (ctx) {
-    var width = this.width === undefined ? DEFAULT_WIDTH : this.width;
-    var height = this.height === undefined ? DEFAULT_HEIGHT : this.height;
-    var canvas = new ImageCanvas(width, height);
-    canvas.addLayer(this);
-    canvas.draw(ctx);
-};
+    // A 3x3 high-pass filter
+    sharpen3x3: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {strength: 1});
+        var a = -clamp(options.strength, 0, 1);
+        convolve3x3(inData, outData, width, height,
+            [
+                [a, a, a],
+                [a, 1 - a * 8, a],
+                [a, a, a]
+            ]);
+    },
 
-Layer.prototype.toCanvas = function () {
-    var canvas = document.createElement('canvas');
-    canvas.width = this.width;
-    canvas.height = this.height;
-    var ctx = canvas.getContext('2d');
-    this.draw(ctx);
-    return canvas;
-};
+    // A 5x5 high-pass filter
+    sharpen5x5: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {strength: 1});
+        var a = -clamp(options.strength, 0, 1);
+        convolve5x5(inData, outData, width, height,
+            [
+                [a, a, a, a, a],
+                [a, a, a, a, a],
+                [a, a, 1 - a * 24, a, a],
+                [a, a, a, a, a],
+                [a, a, a, a, a]
+            ]);
+    },
 
-Layer.fromFile = function (filename) {
-    return new Layer(filename, TYPE_PATH);
-};
+    // A 3x3 low-pass mean filter
+    soften3x3: function (inData, outData, width, height) {
+        var c = 1 / 9;
+        convolve3x3(inData, outData, width, height,
+            [
+                [c, c, c],
+                [c, c, c],
+                [c, c, c]
+            ]);
+    },
 
-Layer.fromImage = function (image) {
-    return new Layer(image, TYPE_IMAGE);
-};
+    // A 5x5 low-pass mean filter
+    soften5x5: function (inData, outData, width, height) {
+        var c = 1 / 25;
+        convolve5x5(inData, outData, width, height,
+            [
+                [c, c, c, c, c],
+                [c, c, c, c, c],
+                [c, c, c, c, c],
+                [c, c, c, c, c],
+                [c, c, c, c, c]
+            ]);
+    },
 
-Layer.fromCanvas = function (canvas) {
-    if (canvas instanceof HTMLCanvasElement) {
-        return Layer.fromHtmlCanvas(canvas);
-    }
-    return Layer.fromImageCanvas(canvas);
-};
+    // A 3x3 Cross edge-detect
+    crossedges: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {strength: 1});
+        var a = clamp(options.strength, 0, 1) * 5;
+        convolve3x3(inData, outData, width, height,
+            [
+                [ 0, -a, 0],
+                [-a, 0, a],
+                [ 0, a, 0]
+            ],
+            false, true);
+    },
 
-Layer.fromHtmlCanvas = function (canvas) {
-    return new Layer(canvas, TYPE_HTML_CANVAS);
-};
+    // 3x3 directional emboss
+    emboss: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {amount: 1, angle: 0});
+        var i, n = width * height * 4,
+            amount = options.amount,
+            angle = options.angle,
+            x = Math.cos(-angle) * amount,
+            y = Math.sin(-angle) * amount,
 
-Layer.fromImageCanvas = function (iCanvas) {
-    return new Layer(iCanvas, TYPE_IMAGE_CANVAS);
-};
+            a00 = -x - y,
+            a10 = -x,
+            a20 = y - x,
+            a01 = -y,
+            a21 = y,
+            a02 = -y + x,
+            a12 = x,
+            a22 = y + x,
 
-Layer.fromColor = function (color) {
-    return new Layer(toColor(color), TYPE_FILL);
-};
+            tmpData = [];
 
-Layer.fromGradient = function () {
-    return new Layer(toGradientData.apply(null, arguments), TYPE_GRADIENT);
-};
+        convolve3x3(inData, tmpData, width, height,
+            [
+                [a00, a01, a02],
+                [a10, 0, a12],
+                [a20, a21, a22]
+            ]);
 
-Layer.prototype.isPath = function () {
-    return this.type === TYPE_PATH;
-};
+        for (i = 0; i < n; i += 4) {
+            outData[i] = 128 + tmpData[i];
+            outData[i + 1] = 128 + tmpData[i + 1];
+            outData[i + 2] = 128 + tmpData[i + 2];
+            outData[i + 3] = inData[i + 3];
+        }
+    },
 
-Layer.prototype.isFill = function () {
-    return this.type === TYPE_FILL;
-};
 
-Layer.prototype.isGradient = function () {
-    return this.type === TYPE_GRADIENT;
-};
+    // A 3x3 Sobel edge detect (similar to Photoshop's)
+    findedges: function (inData, outData, width, height) {
+        var i, n = width * height * 4,
+            gr1, gr2, gg1, gg2, gb1, gb2,
+            data1 = [],
+            data2 = [];
 
-Layer.prototype.isHtmlCanvas = function () {
-    return this.type === TYPE_HTML_CANVAS;
-};
+        convolve3x3(inData, data1, width, height,
+            [
+                [-1, 0, 1],
+                [-2, 0, 2],
+                [-1, 0, 1]
+            ]);
 
-Layer.prototype.isImage = function () {
-    return this.type === TYPE_IMAGE;
-};
+        convolve3x3(inData, data2, width, height,
+            [
+                [-1, -2, -1],
+                [ 0, 0, 0],
+                [ 1, 2, 1]
+            ]);
 
-Layer.prototype.isImageCanvas = function () {
-    return this.type === TYPE_IMAGE_CANVAS;
-};
+        for (i = 0; i < n; i += 4) {
+            gr1 = data1[i];
+            gr2 = data2[i];
+            gg1 = data1[i + 1];
+            gg2 = data2[i + 1];
+            gb1 = data1[i + 2];
+            gb2 = data2[i + 2];
 
+            if (gr1 < 0) {
+                gr1 = -gr1;
+            }
+            if (gr2 < 0) {
+                gr2 = -gr2;
+            }
+            if (gg1 < 0) {
+                gg1 = -gg1;
+            }
+            if (gg2 < 0) {
+                gg2 = -gg2;
+            }
+            if (gb1 < 0) {
+                gb1 = -gb1;
+            }
+            if (gb2 < 0) {
+                gb2 = -gb2;
+            }
 
-// IMAGE PIXELS.
+            outData[i] = 255 - (gr1 + gr2) * 0.8;
+            outData[i + 1] = 255 - (gg1 + gg2) * 0.8;
+            outData[i + 2] = 255 - (gb1 + gb2) * 0.8;
+            outData[i + 3] = inData[i + 3];
+        }
+    },
 
-var Pixels = function (canvas) {
-    this.width = canvas.width;
-    this.height = canvas.height;
-    var ctx = canvas.getContext('2d');
-    this._data = ctx.getImageData(0, 0, this.width, this.height);
-    this.array = this._data.data;
-};
+    // A 3x3 edge enhance
+    edgeenhance3x3: function (inData, outData, width, height) {
+        var c = -1 / 9;
+        convolve3x3(inData, outData, width, height,
+            [
+                [c, c, c],
+                [c, 17 / 9, c],
+                [c, c, c]
+            ]);
+    },
 
-Pixels.prototype.get = function (i) {
-    i *= 4;
-    var v = this.array;
-    return [v[i + 0], v[i + 1], v[i + 2], v[i + 3]];
-};
+    // A 5x5 edge enhance
+    edgeenhance5x5: function (inData, outData, width, height) {
+        var c = -1 / 25;
+        convolve5x5(inData, outData, width, height,
+            [
+                [c, c, c, c, c],
+                [c, c, c, c, c],
+                [c, c, 49 / 25, c, c],
+                [c, c, c, c, c],
+                [c, c, c, c, c]
+            ]);
+    },
 
-Pixels.prototype.set = function (i, rgba) {
-    i *= 4;
-    var v = this.array;
-    v[i + 0] = rgba[0];
-    v[i + 1] = rgba[1];
-    v[i + 2] = rgba[2];
-    v[i + 3] = rgba[3];
-};
+    // A 3x3 Laplacian edge-detect
+    laplace3x3: function (inData, outData, width, height) {
+        convolve3x3(inData, outData, width, height,
+            [
+                [-1, -1, -1],
+                [-1, 8, -1],
+                [-1, -1, -1]
+            ],
+            false, true, true);
+    },
 
-Pixels.prototype.toCanvas = function () {
-    var canvas = document.createElement('canvas');
-    canvas.width = this.width;
-    canvas.height = this.height;
-    var ctx = canvas.getContext('2d');
-    ctx.putImageData(this._data, 0, 0);
-    return canvas;
-};
+    // A 5x5 Laplacian edge-detect
+    laplace5x5: function (inData, outData, width, height) {
+        convolve5x5(inData, outData, width, height,
+            [
+                [-1, -1, -1, -1, -1],
+                [-1, -1, -1, -1, -1],
+                [-1, -1, 24, -1, -1],
+                [-1, -1, -1, -1, -1],
+                [-1, -1, -1, -1, -1]
+            ],
+            false, true, true);
+    },
 
+    rgbAdjust: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {r: 0, g: 0, b: 0, a: 0});
+        var i, n = width * height * 4,
+            r, g, b, a,
+            ar = clamp(options.r, -1, 1) * 255,
+            ag = clamp(options.g, -1, 1) * 255,
+            ab = clamp(options.b, -1, 1) * 255,
+            aa = clamp(options.a, -1, 1) * 255;
 
-// IMAGE CANVAS.
+        for (i = 0; i < n; i += 4) {
+            r = inData[i] + ar;
+            g = inData[i + 1] + ag;
+            b = inData[i + 2] + ab;
+            a = inData[i + 3] + aa;
+            if (r < 0) {
+                r = 0;
+            }
+            if (g < 0) {
+                g = 0;
+            }
+            if (b < 0) {
+                b = 0;
+            }
+            if (a < 0) {
+                a = 0;
+            }
+            if (r > 255) {
+                r = 255;
+            }
+            if (g > 255) {
+                g = 255;
+            }
+            if (b > 255) {
+                b = 255;
+            }
+            if (a > 255) {
+                a = 255;
+            }
+            outData[i] = r;
+            outData[i + 1] = g;
+            outData[i + 2] = b;
+            outData[i + 3] = a;
+        }
+    },
 
-ImageCanvas = function (width, height) {
-    if (!width) {
-        width = DEFAULT_WIDTH;
-    }
-    if (!height) {
-        height = DEFAULT_HEIGHT;
-    }
+    colorfilter: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {luminosity: false, r: 1, g: 0.5, b: 0});
+        var i, n = width * height * 4,
+            r, g, b,
+            luminosity = !!options.luminosity,
+            min, max, h, l, h1, chroma, tmp, m,
+            ar = clamp(options.r, 0, 1),
+            ag = clamp(options.g, 0, 1),
+            ab = clamp(options.b, 0, 1);
 
-    this.width = width;
-    this.height = height;
-    this.layers = [];
-};
+        for (i = 0; i < n; i += 4) {
+            r = inData[i] / 255;
+            g = inData[i + 1] / 255;
+            b = inData[i + 2] / 255;
 
-// Copies the ImageCanvas.
-ImageCanvas.prototype.clone = function () {
-    var c = new ImageCanvas(this.width, this.height);
-    for (var i = 0; i < this.layers.length; i += 1) {
-        c.layers.push(this.layers[i].clone());
-    }
-    return c;
-};
+            l = r * 0.3 + g * 0.59 + b * 0.11;
 
-// Creates a new layer from figuring out the given argument(s) and adds it to the canvas.
-ImageCanvas.prototype.addLayer = function (arg0) {
-    var layer;
+            r = (r + r * ar) / 2;
+            g = (g + g * ag) / 2;
+            b = (b + b * ab) / 2;
 
-    try {
-        return this.addGradientLayer.apply(this, arguments);
-    } catch (e1) {
-    }
+            if (luminosity) {
+                min = max = r;
+                if (g > max) {
+                    max = g;
+                }
+                if (b > max) {
+                    max = b;
+                }
+                if (g < min) {
+                    min = g;
+                }
+                if (b < min) {
+                    min = b;
+                }
+                chroma = (max - min);
 
-    try {
-        return this.addColorLayer.apply(this, arguments);
-    } catch (e2) {
-    }
+                if (r === max) {
+                    h = ((g - b) / chroma) % 6;
+                } else if (g === max) {
+                    h = ((b - r) / chroma) + 2;
+                } else {
+                    h = ((r - g) / chroma) + 4;
+                }
 
-    if (arguments.length === 1) {
-        if (typeof arg0 === 'string') {
-            layer = new Layer(arg0, TYPE_PATH);
-        } else if (arg0 instanceof Layer) {
-            layer = arg0;
-        } else if (arg0 instanceof HTMLCanvasElement) {
-            layer = new Layer(arg0, TYPE_HTML_CANVAS);
-        } else if (arg0 instanceof Image) {
-            layer = new Layer(arg0, TYPE_IMAGE);
-        } else if (arg0 instanceof ImageCanvas) {
-            layer = new Layer(arg0, TYPE_IMAGE_CANVAS);
-        }
-    }
+                h1 = h >> 0;
+                tmp = chroma * (h - h1);
+                r = g = b = l - (r * 0.3 + g * 0.59 + b * 0.11);
 
-    if (!layer) {
-        throw new Error('Error creating layer.');
-    }
+                if (h1 === 0) {
+                    r += chroma;
+                    g += tmp;
+                } else if (h1 === 1) {
+                    r += chroma - tmp;
+                    g += chroma;
+                } else if (h1 === 2) {
+                    g += chroma;
+                    b += tmp;
+                } else if (h1 === 3) {
+                    g += chroma - tmp;
+                    b += chroma;
+                } else if (h1 === 4) {
+                    r += tmp;
+                    b += chroma;
+                } else if (h1 === 5) {
+                    r += chroma;
+                    b += chroma - tmp;
+                }
+            }
 
-    this.layers.push(layer);
-    return layer;
-};
+            outData[i] = r * 255;
+            outData[i + 1] = g * 255;
+            outData[i + 2] = b * 255;
+            outData[i + 3] = inData[i + 3];
+        }
+    },
 
-// Adds a new color layer to the canvas.
-ImageCanvas.prototype.addColorLayer = function () {
-    var c = toColor.apply(null, arguments);
-    var layer = new Layer(c, TYPE_FILL);
-    this.layers.push(layer);
-    return layer;
-};
+    hslAdjust: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {h: 0.5, s: 0.3, l: 0.1, a: 0});
+        var i, n = width * height * 4,
+            r, g, b, a,
+            hue = clamp(options.h, -1, 1),
+            saturation = clamp(options.s, -1, 1),
+            lightness = clamp(options.l, -1, 1),
+            aa = clamp(options.a, -1, 1) * 255,
+            satMul = 1 + saturation * (saturation < 0 ? 1 : 2),
+            lightMul = lightness < 0 ? 1 + lightness : 1 - lightness,
+            lightAdd = lightness < 0 ? 0 : lightness * 255,
+            vs, ms, vm, h, s, l, v, m, vmh, sextant;
 
-// Adds a new gradient layer to the canvas.
-ImageCanvas.prototype.addGradientLayer = function () {
-    var c = toGradientData.apply(null, arguments);
-    var layer = new Layer(c, TYPE_GRADIENT);
-    this.layers.push(layer);
-    return layer;
-};
+        hue = (hue * 6) % 6;
 
-// Renders the canvas and passes the result (a html canvas) to the given callback function.
-ImageCanvas.prototype.render = function (callback) {
-    var renderer = callback ? AsyncRenderer : CanvasRenderer;
-    return renderer.render(this, callback);
-};
+        for (i = 0; i < n; i += 4) {
 
-// Renders the canvas on another canvas.
-ImageCanvas.prototype.draw = function (ctx, callback) {
-    if (callback) {
-        this.render(function (canvas) {
-            ctx.drawImage(canvas, 0, 0, canvas.width, canvas.height);
-        });
-    } else {
-        var canvas = this.render();
-        ctx.drawImage(canvas, 0, 0, canvas.width, canvas.height);
-    }
-};
+            r = inData[i];
+            g = inData[i + 1];
+            b = inData[i + 2];
+            a = inData[i + 3] + aa;
 
+            if (hue !== 0 || saturation !== 0) {
+                // ok, here comes rgb to hsl + adjust + hsl to rgb, all in one jumbled mess.
+                // It's not so pretty, but it's been optimized to get somewhat decent performance.
+                // The transforms were originally adapted from the ones found in Graphics Gems, but have been heavily modified.
+                vs = r;
+                if (g > vs) {
+                    vs = g;
+                }
+                if (b > vs) {
+                    vs = b;
+                }
+                ms = r;
+                if (g < ms) {
+                    ms = g;
+                }
+                if (b < ms) {
+                    ms = b;
+                }
+                vm = vs - ms;
+                l = (ms + vs) / 510;
 
-// Img
+                if (l > 0 && vm > 0) {
+                    if (l <= 0.5) {
+                        s = vm / (vs + ms) * satMul;
+                        if (s > 1) {
+                            s = 1;
+                        }
+                        v = (l * (1 + s));
+                    } else {
+                        s = vm / (510 - vs - ms) * satMul;
+                        if (s > 1) {
+                            s = 1;
+                        }
+                        v = (l + s - l * s);
+                    }
+                    if (r === vs) {
+                        if (g === ms) {
+                            h = 5 + ((vs - b) / vm) + hue;
+                        } else {
+                            h = 1 - ((vs - g) / vm) + hue;
+                        }
+                    } else if (g === vs) {
+                        if (b === ms) {
+                            h = 1 + ((vs - r) / vm) + hue;
+                        } else {
+                            h = 3 - ((vs - b) / vm) + hue;
+                        }
+                    } else {
+                        if (r === ms) {
+                            h = 3 + ((vs - g) / vm) + hue;
+                        } else {
+                            h = 5 - ((vs - r) / vm) + hue;
+                        }
+                    }
+                    if (h < 0) {
+                        h += 6;
+                    }
+                    if (h >= 6) {
+                        h -= 6;
+                    }
+                    m = (l + l - v);
+                    sextant = h >> 0;
+                    vmh = (v - m) * (h - sextant);
+                    if (sextant === 0) {
+                        r = v;
+                        g = m + vmh;
+                        b = m;
+                    } else if (sextant === 1) {
+                        r = v - vmh;
+                        g = v;
+                        b = m;
+                    } else if (sextant === 2) {
+                        r = m;
+                        g = v;
+                        b = m + vmh;
+                    } else if (sextant === 3) {
+                        r = m;
+                        g = v - vmh;
+                        b = v;
+                    } else if (sextant === 4) {
+                        r = m + vmh;
+                        g = m;
+                        b = v;
+                    } else if (sextant === 5) {
+                        r = v;
+                        g = m;
+                        b = v - vmh;
+                    }
 
-function isPoint(arg) {
-    if (!arg) { return false; }
-    return arg.x !== undefined && arg.y !== undefined;
-}
+                    r *= 255;
+                    g *= 255;
+                    b *= 255;
+                }
+            }
 
-function pointFromArray(arg) {
-    var x = arg[0];
-    var y = arg.length > 1 ? arg[1] : x;
-    return {x: x, y: y};
-}
+            r = r * lightMul + lightAdd;
+            g = g * lightMul + lightAdd;
+            b = b * lightMul + lightAdd;
 
-function pointFromNumber(arg) {
-    return {x: arg, y: arg};
-}
+            if (r < 0) { r = 0; }
+            if (g < 0) { g = 0; }
+            if (b < 0) { b = 0; }
+            if (a < 0) { a = 0; }
+            if (r > 255) { r = 255; }
+            if (g > 255) { g = 255; }
+            if (b > 255) { b = 255; }
+            if (a > 255) { a = 255; }
 
-function isValidArg(arg) {
-    return arg !== undefined && arg !== null;
-}
+            outData[i] = r;
+            outData[i + 1] = g;
+            outData[i + 2] = b;
+            outData[i + 3] = a;
+        }
+    },
 
-function convertArg(arg) {
-    if (Array.isArray(arg)) {
-        return pointFromArray(arg);
-    } else if (typeof arg === 'number') {
-        return pointFromNumber(arg);
-    } else if (isPoint(arg)) {
-        return arg;
-    }
-}
+    posterize: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {levels: 5});
+        var i, n = width * height * 4,
+            r, g, b,
+            numLevels = clamp(options.levels, 2, 256),
+            numAreas = 256 / numLevels,
+            numValues = 256 / (numLevels - 1);
 
-Img = function (canvas, x, y) {
-    this.canvas = canvas;
-    this.originalWidth = canvas ? canvas.width : 0;
-    this.originalHeight = canvas ? canvas.height: 0;
-    this.transform = x || y ? Transform.translate(x, y) : Layer.IDENTITY_TRANSFORM;
-};
+        for (i = 0; i < n; i += 4) {
+            outData[i] = numValues * ((inData[i] / numAreas) >> 0);
+            outData[i + 1] = numValues * ((inData[i + 1] / numAreas) >> 0);
+            outData[i + 2] = numValues * ((inData[i + 2] / numAreas) >> 0);
+            outData[i + 3] = inData[i + 3];
+        }
+    },
 
-Img.prototype.clone = function () {
-    var n = new Img();
-    n.canvas = this.canvas;
-    n.originalWidth = this.originalWidth;
-    n.originalHeight = this.originalHeight;
-    n.transform = this.transform;
-    return n;
-};
+    removenoise: function (inData, outData, width, height) {
+        var x, y, n = width * height * 4,
+            r, g, b, c, idx,
+            pyc, pyp, pyn,
+            pxc, pxp, pxn,
+            minR, minG, minB, maxR, maxG, maxB;
 
-Img.prototype.withCanvas = function (canvas) {
-    var n = this.clone();
-    n.canvas = canvas;
-    return n;
-};
+        for (y = 0; y < height; y += 1) {
+            pyc = y * width * 4;
+            pyp = pyc - width * 4;
+            pyn = pyc + width * 4;
 
-Img.prototype._transform = function (t) {
-    var n = this.clone();
-    n.transform = n.transform.prepend(t);
-    return n;
-};
+            if (y < 1) {
+                pyp = pyc;
+            }
+            if (y >= width - 1) {
+                pyn = pyc;
+            }
 
-Img.prototype.translate = function (position) {
-    var t = pointFromNumber(0);
-    var args = arguments;
-    if (args.length === 1 && isValidArg(position)) {
-        t = convertArg(position);
-    } else if (args.length === 2) {
-        t = {x: args[0], y: args[1]};
-    }
-    if (t.x === 0 && t.y === 0) { return this; }
-    return this._transform(Transform.translate(t.x, t.y));
-};
+            for (x = 0; x < width; x += 1) {
+                idx = (y * width + x) * 4;
 
-Img.prototype.rotate = function (angle) {
-    if (!angle) { return this; }
-    var o = pointFromNumber(0);
-    var args = arguments;
-    if (args.length === 2) {
-        o = convertArg(args[1]);
-    } else if (args.length === 3) {
-        o = {x: args[1], y: args[2]};
-    }
-    return this._transform(Transform.translate(o.x, o.y).rotate(angle).translate(-o.x, -o.y));
-};
+                pxc = x * 4;
+                pxp = pxc - 4;
+                pxn = pxc + 4;
 
-Img.prototype.scale = function (scale) {
-    var s = pointFromNumber(1);
-    var o = pointFromNumber(0);
-    var args = arguments;
-    if (args.length === 1 && isValidArg(scale)) {
-        s = convertArg(scale);
-    } else if (args.length === 2) {
-        if (typeof scale === 'number' && typeof args[1] === 'number') {
-            s = {x: args[0], y: args[1]};
-        } else {
-            s = convertArg(scale);
-            o = convertArg(args[1]);
-        }
-    } else if (args.length === 4) {
-        s = {x: args[0], y: args[1]};
-        o = {x: args[2], y: args[3]};
-    }
-    if (s.x === 1 && s.y === 1) { return this; }
-    return this._transform(Transform.translate(o.x, o.y).scale(s.x, s.y).translate(-o.x, -o.y));
-};
+                if (x < 1) {
+                    pxp = pxc;
+                }
+                if (x >= width - 1) {
+                    pxn = pxc;
+                }
 
-Img.prototype.skew = function (skew) {
-    var k = pointFromNumber(0);
-    var o = pointFromNumber(0);
-    var args = arguments;
-    if (args.length === 1 && isValidArg(skew)) {
-        k = convertArg(skew);
-    } else if (args.length === 2) {
-        if (typeof skew === 'number' && typeof args[1] === 'number') {
-            k = {x: args[0], y: args[1]};
-        } else {
-            k = convertArg(skew);
-            o = convertArg(args[1]);
-        }
-    } else if (args.length === 4) {
-        k = {x: args[0], y: args[1]};
-        o = {x: args[2], y: args[3]};
-    }
-    if (k.x === 0 && k.y === 0) { return this; }
-    return this._transform(Transform.translate(o.x, o.y).skew(k.x, k.y).translate(-o.x, -o.y));
-};
+                minR = maxR = inData[pyc + pxp];
+                c = inData[pyc + pxn];
+                if (c < minR) {
+                    minR = c;
+                }
+                if (c > maxR) {
+                    maxR = c;
+                }
+                c = inData[pyp + pxc];
+                if (c < minR) {
+                    minR = c;
+                }
+                if (c > maxR) {
+                    maxR = c;
+                }
+                c = inData[pyn + pxc];
+                if (c < minR) {
+                    minR = c;
+                }
+                if (c > maxR) {
+                    maxR = c;
+                }
 
-Img.prototype.transformed = function () {
-    return img.merge([this]);
-};
+                minG = inData[pyc + pxp + 1];
+                c = inData[pyc + pxn + 1];
+                if (c < minG) {
+                    minG = c;
+                }
+                c = inData[pyp + pxc + 1];
+                if (c < minG) {
+                    minG = c;
+                }
+                c = inData[pyn + pxc + 1];
+                if (c < minG) {
+                    minG = c;
+                }
 
-Img.prototype.bounds = function () {
-    var t = this.transform;
-    var x = this.originalWidth / 2;
-    var y = this.originalHeight / 2;
+                minB = inData[pyc + pxp + 2];
+                c = inData[pyc + pxn + 2];
+                if (c < minB) {
+                    minB = c;
+                }
+                c = inData[pyp + pxc + 2];
+                if (c < minB) {
+                    minB = c;
+                }
+                c = inData[pyn + pxc + 2];
+                if (c < minB) {
+                    minB = c;
+                }
 
-    var p1 = {x: -x, y: -y};
-    var p2 = {x: x, y: -y};
-    var p3 = {x: -x, y: y};
-    var p4 = {x: x, y: y};
-    var points = [p1, p2, p3, p4];
-    var pt, minx, miny, maxx, maxy;
+                r = inData[idx];
+                g = inData[idx + 1];
+                b = inData[idx + 2];
 
-    for (var i = 0; i < 4; i += 1) {
-        pt = t.transformPoint(points[i]);
-        if (i === 0) {
-            minx = maxx = pt.x;
-            miny = maxy = pt.y;
-        } else {
-            if (pt.x < minx) {
-                minx = pt.x;
-            }
-            if (pt.x > maxx) {
-                maxx = pt.x;
-            }
-            if (pt.y < miny) {
-                miny = pt.y;
-            }
-            if (pt.y > maxy) {
-                maxy = pt.y;
+                if (r < minR) {
+                    r = minR;
+                }
+                if (r > maxR) {
+                    r = maxR;
+                }
+                if (g < minG) {
+                    g = minG;
+                }
+                if (g > maxG) {
+                    g = maxG;
+                }
+                if (b < minB) {
+                    b = minB;
+                }
+                if (b > maxB) {
+                    b = maxB;
+                }
+
+                outData[idx] = r;
+                outData[idx + 1] = g;
+                outData[idx + 2] = b;
+                outData[idx + 3] = inData[idx + 3];
             }
         }
-    }
-    return {x: minx, y: miny, width: maxx - minx, height: maxy - miny};
-};
-
-Img.prototype.colorize = function (color) {
-    var colorLayer = Layer.fromColor(color);
-    colorLayer.width = this.originalWidth;
-    colorLayer.height = this.originalHeight;
-    var i = new Img(colorLayer.toCanvas());
-    i = i._transform(this.transform.matrix());
-    return img.merge([this, i]);
-};
-
-Img.prototype.desaturate = function (options) {
-    var layer = this.toLayer(false);
-    layer.addFilter('desaturate', options);
-    return this.withCanvas(layer.toCanvas());
-};
+    },
 
-Img.prototype.crop = function (bounding) {
-    // Calculates the intersecting rectangle of two input rectangles.
-    function rectIntersect(r1, r2) {
-        var right1 = r1.x + r1.width,
-            bottom1 = r1.y + r1.height,
-            right2 = r2.x + r2.width,
-            bottom2 = r2.y + r2.height,
+    mosaic: function (inData, outData, width, height, options) {
+        options = defaultOptions(options, {blockSize: 8});
+        var blockSize = clamp(options.blockSize, 1, Math.max(width, height)),
+            yBlocks = Math.ceil(height / blockSize),
+            xBlocks = Math.ceil(width / blockSize),
+            y0, y1, x0, x1, idx, pidx,
+            i, j, bidx, r, g, b, bi, bj,
+            n = yBlocks * xBlocks,
+            prog, lastProg = 0;
 
-            x = Math.max(r1.x, r2.x),
-            y = Math.max(r1.y, r2.y),
-            w = Math.max(Math.min(right1, right2) - x, 0),
-            h = Math.max(Math.min(bottom1, bottom2) - y, 0);
-        return {x: x, y: y, width: w, height: h};
-    }
+        y0 = 0;
+        bidx = 0;
+        for (i = 0; i < yBlocks; i += 1) {
+            y1 = clamp(y0 + blockSize, 0, height);
+            x0 = 0;
+            for(j = 0; j < xBlocks; j += 1) {
+                x1 = clamp(x0 + blockSize, 0, width);
 
-    var iBounds = this.bounds();
-    var bounds = bounding.bounds();
-    var ri = rectIntersect(iBounds, bounds);
-    var width = Math.ceil(ri.width);
-    var height = Math.ceil(ri.height);
+                idx = (y0 * width + x0) << 2;
+                r = inData[idx];
+                g = inData[idx + 1];
+                b = inData[idx + 2];
 
-    if (ri.width === 0 || ri.height === 0) {
-        throw new Error('Resulting image has no dimensions');
-    }
+                for(bi = y0; bi < y1; bi += 1) {
+                   for(bj = x0; bj < x1; bj += 1) {
+                       pidx = (bi * width + bj) << 2;
+                       outData[pidx] = r;
+                       outData[pidx + 1] = g;
+                       outData[pidx + 2] = b;
+                       outData[pidx + 3] = inData[pidx + 3];
+                   }
+                }
+                x0 = x1;
+                bidx += 1;
+            }
+            y0 = y1;
+        }
+    },
 
-    var canvas = new img.ImageCanvas(width, height);
-    var l1 = canvas.addLayer(this.toLayer());
-    l1.translate(width / 2 - bounds.width - bounds.x,
-        height / 2 - bounds.height - bounds.y);
-    if (width < bounds.width && ri.x > iBounds.x) {
-        l1.translate(bounds.width - width, 0);
-    }
-    if (height < bounds.height && ri.y > iBounds.y) {
-        l1.translate(0, bounds.height - height);
-    }
+    equalize : function(inData, outData, width, height, options) {
+        var n = width * height, p, i, level, ratio,
+            prog, lastProg;
+        var round = Math.round;
+        // build histogram
+        var pdf = new Array(256);
+        for (i = 0; i < 256; i += 1) {
+            pdf[i] = 0;
+        }
 
-    return new Img(canvas.render(), ri.x + width / 2, ri.y + height / 2);
-};
+        for (i = 0; i < n; i += 1) {
+            p = i * 4;
+            level = clamp(round(inData[p] * 0.3 + inData[p + 1] * 0.59 + inData[p + 2] * 0.11), 0, 255);
+            outData[p + 3] = level;
+            pdf[level] += 1;
+        }
 
-Img.prototype.draw = function (ctx) {
-    ctx.save();
-    var m = this.transform.matrix();
-    ctx.transform(m[0], m[1], m[3], m[4], m[6], m[7]);
-    ctx.translate(-this.originalWidth / 2, -this.originalHeight / 2);
-    ctx.drawImage(this.canvas, 0, 0);
-    ctx.restore();
-};
+        // build cdf
+        var cdf = new Array(256);
+        cdf[0] = pdf[0];
+        for(i = 1; i < 256; i += 1) {
+            cdf[i] = cdf[i - 1] + pdf[i];
+        }
 
-Img.prototype.toLayer = function (copyTransformations) {
-    var canvas = document.createElement('canvas');
-    canvas.width = this.canvas.width;
-    canvas.height = this.canvas.height;
-    var ctx = canvas.getContext('2d');
-    ctx.drawImage(this.canvas, 0, 0);
-    var layer = img.Layer.fromHtmlCanvas(canvas);
-    if (copyTransformations === undefined) {
-        copyTransformations = true;
-    }
-    if (copyTransformations) {
-        layer.transform = this.transform;
-    }
-    return layer;
-};
+        // normalize cdf
+        for(i = 0; i < 256; i += 1) {
+            cdf[i] = cdf[i] / n * 255.0;
+        }
 
-Img.prototype.getPixels = function () {
-    return new Pixels(this.canvas);
-};
+        // map the pixel values
+        for (i = 0; i < n; i += 1) {
+            p = i * 4;
+            level = outData[p + 3];
+            ratio = cdf[level] / (level || 1);
+            outData[p] = clamp(round(inData[p] * ratio), 0, 255);
+            outData[p + 1] = clamp(round(inData[p + 1] * ratio), 0, 255);
+            outData[p + 2] = clamp(round(inData[p + 2] * ratio), 0, 255);
+            outData[p + 3] = inData[p + 3];
+        }
+    },
 
-Img.prototype.toImage = function () {
-    var b = this.bounds();
-    var cropped = this.crop({bounds: function() { return b; }});
-    var i = new Image();
-    i.width = cropped.canvas.width;
-    i.height = cropped.canvas.height;
-    i.src = cropped.canvas.toDataURL();
-    return i;
-};
+    mask: function (inData, outData, width, height, options) {
+        var i, n = width * height * 4,
+            data = options.data;
 
-img = {};
-img.Layer = Layer;
-img.ImageCanvas = ImageCanvas;
-img.Img = Img;
-img.Pixels = Pixels;
+        // todo: consider the masking image's dimensions and position.
 
-// MODULE SUPPORT ///////////////////////////////////////////////////////
+        for (i = 0; i < n; i += 4) {
+            outData[i] = inData[i];
+            outData[i + 1] = inData[i + 1];
+            outData[i + 2] = inData[i + 2];
+            outData[i + 3] = inData[i + 3] * data[i] / 255 * data[i + 3] / 255;
+        }
+    },
 
-var async = require('async');
+    // Distortion filters
 
-function loadImage(image, callback) {
-    var img = new Image();
-    img.onload = function () {
-        callback(null, [image, this]);
-    };
-    img.src = image;
-}
+    bump: function (inData, outData, width, height, options) {
+        /* options:
+         *  - dx: horizontal offset (in pixels) of the effect.
+         *  - dy: vertical offset (in pixels) of the effect.
+         *  - radius: the radius of the effect in pixels.
+         *  - zoom: the amount of bulge (0.0-1.0).
+         */
+        options = defaultOptions(options, {dx: 0, dy: 0, radius: 0, zoom: 0});
+        var m1 = options.radius;
+        var m2 = clamp(options.zoom, 0, 1);
+        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
+            return [d * smoothstep(0, m2, d / m1), a];
+        });
+    },
 
-function loadImages(images, callback) {
-    async.map(images,
-        loadImage, function (err, loadedImages) {
-            if (callback) {
-                var name, image;
-                var d = {};
-                for (var i = 0; i < loadedImages.length; i += 1) {
-                    name = loadedImages[i][0];
-                    image = loadedImages[i][1];
-                    d[name] = image;
-                }
-                callback(d);
-            }
+    dent: function (inData, outData, width, height, options) {
+        /* options:
+         *  - dx: horizontal offset (in pixels) of the effect.
+         *  - dy: vertical offset (in pixels) of the effect.
+         *  - radius: the radius of the effect in pixels.
+         *  - zoom: the amount of pinch (0.0-1.0).
+         */
+        options = defaultOptions(options, {dx: 0, dy: 0, radius: 0, zoom: 0});
+        var m1 = options.radius;
+        var m2 = clamp(options.zoom, 0, 1);
+        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
+            return [2 * d - d * smoothstep(0, m2, d / m1), a];
         });
-}
+    },
 
-function rectUnite(r1, r2) {
-    var x = Math.min(r1.x, r2.x),
-        y = Math.min(r1.y, r2.y),
-        width = Math.max(r1.x + r1.width, r2.x + r2.width) - x,
-        height = Math.max(r1.y + r1.height, r2.y + r2.height) - y;
-    return {x: x, y: y, width: width, height: height};
-}
+    pinch: function (inData, outData, width, height, options) {
+        /* options:
+         *  - dx: horizontal offset (in pixels) of the effect.
+         *  - dy: vertical offset (in pixels) of the effect.
+         *  - zoom: the amount of bulge or pinch (-1.0-1.0):
+         */
+        options = defaultOptions(options, {dx: 0, dy: 0, zoom: 0});
+        var m1 = util.distance(0, 0, width, height);
+        var m2 = clamp(options.zoom * 0.75, -0.75, 0.75);
+        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
+            return [d * Math.pow(m1 / d, m2) * (1 - m2), a];
+        });
+    },
 
-function merge(images) {
-    var i, image, b, l;
-    for (i = 0; i < images.length; i += 1) {
-        image = images[i];
-        if (i === 0) {
-            b = image.bounds();
-        } else {
-            b = rectUnite(b, image.bounds());
-        }
-    }
-    var dx = b.width / 2 + b.x;
-    var dy = b.height / 2 + b.y;
+    splash: function (inData, outData, width, height, options) {
+        /* options:
+         *  - dx: horizontal offset (in pixels) of the effect.
+         *  - dy: vertical offset (in pixels) of the effect.
+         *  - radius: the radius of the unaffected area in pixels.
+         */
+        options = defaultOptions(options, {dx: 0, dy: 0, radius: 0});
+        var m = options.radius;
+        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
+            return [(d > m)? m : d, a];
+        });
+    },
 
-    var canvas = new ImageCanvas(b.width, b.height);
-    for (i = 0; i < images.length; i += 1) {
-        l = canvas.addLayer(images[i].toLayer());
-        l.translate(-dx, -dy);
+    twirl: function (inData, outData, width, height, options) {
+        /* options:
+         *  - dx: horizontal offset (in pixels) of the effect.
+         *  - dy: vertical offset (in pixels) of the effect.
+         *  - radius: the radius of the effect in pixels.
+         *  - angle: the amount of rotation in degrees.
+         */
+        options = defaultOptions(options, {dx: 0, dy: 0, radius: 0, angle: 0});
+        var m1 = util.radians(options.angle);
+        var m2 = options.radius;
+        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
+            return [d, a + (1 - smoothstep(-m2, m2, d)) * m1];
+        });
     }
-    return new Img(canvas.render(), dx, dy);
-}
+};
 
-img.loadImages = loadImages;
-img.merge = merge;
 
-module.exports = img;
+// MODULE SUPPORT ///////////////////////////////////////////////////////
 
-},{"./asyncrenderer":15,"./canvasrenderer":17,"./util":20,"async":1}],19:[function(require,module,exports){
-/*!
- * Image processing based on Pixastic library:
- *
- * Pixastic - JavaScript Image Processing
- * http://pixastic.com/
- * Copyright 2012, Jacob Seidelin
- *
- * Dual licensed under the MPL 1.1 or GPLv3 licenses.
- * http://pixastic.com/license-mpl.txt
- * http://pixastic.com/license-gpl-3.0.txt
- *
- */
+module.exports = process;
 
+},{"./util":19,"stackblur":4}],19:[function(require,module,exports){
 'use strict';
 
-var stackblur = require('stackblur');
-var util = require('./util');
-
-var clamp = util.clamp;
-
-var LUMINOSITY_ITU_R_BT601 = 'ITU-R BT.601';
-var LUMINOSITY_ITU_R_BT709 = 'ITU-R BT.709';
+// UTILITIES.
 
-function defaultOptions(options, defaults) {
-    if (!options) {
-        return defaults;
-    }
-    var opt, o = {};
-    for (opt in defaults) {
-        if (defaults.hasOwnProperty(opt)) {
-            if (typeof options[opt] === 'undefined') {
-                o[opt] = defaults[opt];
-            } else {
-                o[opt] = options[opt];
-            }
-        }
-    }
-    return o;
+function degrees(radians) {
+    return radians * 180 / Math.PI;
 }
 
-function smoothstep(a, b, x) {
-    /* Returns a smooth transition between 0.0 and 1.0 using Hermite interpolation (cubic spline),
-     * where x is a number between a and b. The return value will ease (slow down) as x nears a or b.
-     * For x smaller than a, returns 0.0. For x bigger than b, returns 1.0.
-     */
-    if (x < a) { return 0.0; }
-    if (x >=b) { return 1.0; }
-    x = (x - a) / ( b - a);
-    return x * x * (3 - 2 * x);
+function radians(degrees) {
+    return degrees / 180 * Math.PI;
 }
 
-function noise() {
-    return Math.random() * 0.5 + 0.5;
+function distance(x0, y0, x1, y1) {
+    return Math.sqrt(Math.pow(x1 - x0, 2) + Math.pow(y1 - y0, 2));
 }
 
-function colorDistance(scale, dest, src) {
-    return clamp(scale * dest + (1 - scale) * src, 0, 255);
+function clamp(val, min, max) {
+    return Math.min(max, Math.max(min, val));
 }
 
-function convolve3x3(inData, outData, width, height, kernel, alpha, invert, mono) {
-    var x, y, n = width * height * 4,
-        idx, r, g, b, a,
-        pyc, pyp, pyn,
-        pxc, pxp, pxn,
-
-        k00 = kernel[0][0], k01 = kernel[0][1], k02 = kernel[0][2],
-        k10 = kernel[1][0], k11 = kernel[1][1], k12 = kernel[1][2],
-        k20 = kernel[2][0], k21 = kernel[2][1], k22 = kernel[2][2],
-
-        p00, p01, p02,
-        p10, p11, p12,
-        p20, p21, p22;
-
-    for (y = 0; y < height; y += 1) {
-        pyc = y * width * 4;
-        pyp = pyc - width * 4;
-        pyn = pyc + width * 4;
-
-        if (y < 1) {
-            pyp = pyc;
-        }
-        if (y >= width - 1) {
-            pyn = pyc;
-        }
-
-        for (x = 0; x < width; x += 1) {
-            idx = (y * width + x) * 4;
+// Basic affine transform functionality.
+function transform(m) {
+    // Identity matrix.
+    if (m === undefined) {
+        m = [1, 0, 0, 0, 1, 0, 0, 0, 1];
+    } else {
+        m = m.slice();
+    }
 
-            pxc = x * 4;
-            pxp = pxc - 4;
-            pxn = pxc + 4;
+    // Performs the 3x3 matrix multiplication of the current matrix with the input matrix a.
+    function _mmult(a, m) {
+        m = m.slice();
 
-            if (x < 1) {
-                pxp = pxc;
-            }
-            if (x >= width - 1) {
-                pxn = pxc;
-            }
+        var m0 = m[0];
+        var m1 = m[1];
+        var m2 = m[2];
+        var m3 = m[3];
+        var m4 = m[4];
+        var m5 = m[5];
+        var m6 = m[6];
+        var m7 = m[7];
+        var m8 = m[8];
 
-            p00 = pyp + pxp;
-            p01 = pyp + pxc;
-            p02 = pyp + pxn;
-            p10 = pyc + pxp;
-            p11 = pyc + pxc;
-            p12 = pyc + pxn;
-            p20 = pyn + pxp;
-            p21 = pyn + pxc;
-            p22 = pyn + pxn;
+        m[0] = a[0] * m0 + a[1] * m3;
+        m[1] = a[0] * m1 + a[1] * m4;
+        m[3] = a[3] * m0 + a[4] * m3;
+        m[4] = a[3] * m1 + a[4] * m4;
+        m[6] = a[6] * m0 + a[7] * m3 + m6;
+        m[7] = a[6] * m1 + a[7] * m4 + m7;
 
-            r = inData[p00] * k00 + inData[p01] * k01 + inData[p02] * k02 +
-                inData[p10] * k10 + inData[p11] * k11 + inData[p12] * k12 +
-                inData[p20] * k20 + inData[p21] * k21 + inData[p22] * k22;
+        return transform(m);
+    }
 
-            g = inData[p00 + 1] * k00 + inData[p01 + 1] * k01 + inData[p02 + 1] * k02 +
-                inData[p10 + 1] * k10 + inData[p11 + 1] * k11 + inData[p12 + 1] * k12 +
-                inData[p20 + 1] * k20 + inData[p21 + 1] * k21 + inData[p22 + 1] * k22;
+    return {
+        matrix: function () {
+            return m.slice();
+        },
 
-            b = inData[p00 + 2] * k00 + inData[p01 + 2] * k01 + inData[p02 + 2] * k02 +
-                inData[p10 + 2] * k10 + inData[p11 + 2] * k11 + inData[p12 + 2] * k12 +
-                inData[p20 + 2] * k20 + inData[p21 + 2] * k21 + inData[p22 + 2] * k22;
+        clone: function () {
+            return transform(m);
+        },
 
-            if (alpha) {
-                a = inData[p00 + 3] * k00 + inData[p01 + 3] * k01 + inData[p02 + 3] * k02 +
-                    inData[p10 + 3] * k10 + inData[p11 + 3] * k11 + inData[p12 + 3] * k12 +
-                    inData[p20 + 3] * k20 + inData[p21 + 3] * k21 + inData[p22 + 3] * k22;
-            } else {
-                a = inData[idx + 3];
+        prepend: function (t) {
+            if (t.matrix) {
+                t = t.matrix();
             }
+            return _mmult(m, t);
+        },
 
-            if (mono) {
-                r = g = b = (r + g + b) / 3;
-            }
-            if (invert) {
-                r = 255 - r;
-                g = 255 - g;
-                b = 255 - b;
+        append: function (t) {
+            if (t.matrix) {
+                t = t.matrix();
             }
+            return _mmult(t, m);
+        },
 
-            outData[idx] = r;
-            outData[idx + 1] = g;
-            outData[idx + 2] = b;
-            outData[idx + 3] = a;
-        }
-    }
-}
-
-function convolve5x5(inData, outData, width, height, kernel, alpha, invert, mono) {
-    var x, y, n = width * height * 4,
-        idx, r, g, b, a,
-        pyc, pyp, pyn, pypp, pynn,
-        pxc, pxp, pxn, pxpp, pxnn,
+        translate: function (x, y) {
+            return _mmult([1, 0, 0, 0, 1, 0, x, y, 1], m);
+        },
 
-        k00 = kernel[0][0], k01 = kernel[0][1], k02 = kernel[0][2], k03 = kernel[0][3], k04 = kernel[0][4],
-        k10 = kernel[1][0], k11 = kernel[1][1], k12 = kernel[1][2], k13 = kernel[1][3], k14 = kernel[1][4],
-        k20 = kernel[2][0], k21 = kernel[2][1], k22 = kernel[2][2], k23 = kernel[2][3], k24 = kernel[2][4],
-        k30 = kernel[3][0], k31 = kernel[3][1], k32 = kernel[3][2], k33 = kernel[3][3], k34 = kernel[3][4],
-        k40 = kernel[4][0], k41 = kernel[4][1], k42 = kernel[4][2], k43 = kernel[4][3], k44 = kernel[4][4],
+        scale: function (x, y) {
+            if (y === undefined) {
+                y = x;
+            }
+            return _mmult([x, 0, 0, 0, y, 0, 0, 0, 1], m);
+        },
 
-        p00, p01, p02, p03, p04,
-        p10, p11, p12, p13, p14,
-        p20, p21, p22, p23, p24,
-        p30, p31, p32, p33, p34,
-        p40, p41, p42, p43, p44;
+        skew: function (x, y) {
+            if (y === undefined) {
+                y = x;
+            }
+            var kx = Math.PI * x / 180.0;
+            var ky = Math.PI * y / 180.0;
+            return _mmult([1, Math.tan(ky), 0, -Math.tan(kx), 1, 0, 0, 0, 1], m);
+        },
 
-    for (y = 0; y < height; y += 1) {
-        pyc = y * width * 4;
-        pyp = pyc - width * 4;
-        pypp = pyc - width * 4 * 2;
-        pyn = pyc + width * 4;
-        pynn = pyc + width * 4 * 2;
+        rotate: function (angle) {
+            var c = Math.cos(radians(angle));
+            var s = Math.sin(radians(angle));
+            return _mmult([c, s, 0, -s, c, 0, 0, 0, 1], m);
+        },
 
-        if (y < 1) {
-            pyp = pyc;
-        }
-        if (y >= width - 1) {
-            pyn = pyc;
-        }
-        if (y < 2) {
-            pypp = pyp;
-        }
-        if (y >= width - 2) {
-            pynn = pyn;
+        transformPoint: function (point) {
+            var x = point.x;
+            var y = point.y;
+            return {x: x * m[0] + y * m[3] + m[6],
+                y: x * m[1] + y * m[4] + m[7]};
         }
+    };
+}
 
-        for (x = 0; x < width; x += 1) {
-            idx = (y * width + x) * 4;
-
-            pxc = x * 4;
-            pxp = pxc - 4;
-            pxn = pxc + 4;
-            pxpp = pxc - 8;
-            pxnn = pxc + 8;
+module.exports = {
+    degrees: degrees,
+    radians: radians,
+    distance: distance,
+    clamp: clamp,
+    transform: transform
+};
 
-            if (x < 1) {
-                pxp = pxc;
-            }
-            if (x >= width - 1) {
-                pxn = pxc;
-            }
-            if (x < 2) {
-                pxpp = pxp;
-            }
-            if (x >= width - 2) {
-                pxnn = pxn;
-            }
+},{}],20:[function(require,module,exports){
+'use strict';
 
-            p00 = pypp + pxpp;
-            p01 = pypp + pxp;
-            p02 = pypp + pxc;
-            p03 = pypp + pxn;
-            p04 = pypp + pxnn;
-            p10 = pyp + pxpp;
-            p11 = pyp + pxp;
-            p12 = pyp + pxc;
-            p13 = pyp + pxn;
-            p14 = pyp + pxnn;
-            p20 = pyc + pxpp;
-            p21 = pyc + pxp;
-            p22 = pyc + pxc;
-            p23 = pyc + pxn;
-            p24 = pyc + pxnn;
-            p30 = pyn + pxpp;
-            p31 = pyn + pxp;
-            p32 = pyn + pxc;
-            p33 = pyn + pxn;
-            p34 = pyn + pxnn;
-            p40 = pynn + pxpp;
-            p41 = pynn + pxp;
-            p42 = pynn + pxc;
-            p43 = pynn + pxn;
-            p44 = pynn + pxnn;
+var deepEqual = require('./deepequal');
+var util = require('./util');
+var g = {};
 
-            r = inData[p00] * k00 + inData[p01] * k01 + inData[p02] * k02 + inData[p03] * k04 + inData[p02] * k04 +
-                inData[p10] * k10 + inData[p11] * k11 + inData[p12] * k12 + inData[p13] * k14 + inData[p12] * k14 +
-                inData[p20] * k20 + inData[p21] * k21 + inData[p22] * k22 + inData[p23] * k24 + inData[p22] * k24 +
-                inData[p30] * k30 + inData[p31] * k31 + inData[p32] * k32 + inData[p33] * k34 + inData[p32] * k34 +
-                inData[p40] * k40 + inData[p41] * k41 + inData[p42] * k42 + inData[p43] * k44 + inData[p42] * k44;
+g.combine = function () {
+    var i, l, result = [];
+    for (i = 0; i < arguments.length; i++) {
+        l = arguments[i];
+        if (l) {
+            result = result.concat(l);
+        }
+    }
+    return result;
+};
 
-            g = inData[p00 + 1] * k00 + inData[p01 + 1] * k01 + inData[p02 + 1] * k02 + inData[p03 + 1] * k04 + inData[p02 + 1] * k04 +
-                inData[p10 + 1] * k10 + inData[p11 + 1] * k11 + inData[p12 + 1] * k12 + inData[p13 + 1] * k14 + inData[p12 + 1] * k14 +
-                inData[p20 + 1] * k20 + inData[p21 + 1] * k21 + inData[p22 + 1] * k22 + inData[p23 + 1] * k24 + inData[p22 + 1] * k24 +
-                inData[p30 + 1] * k30 + inData[p31 + 1] * k31 + inData[p32 + 1] * k32 + inData[p33 + 1] * k34 + inData[p32 + 1] * k34 +
-                inData[p40 + 1] * k40 + inData[p41 + 1] * k41 + inData[p42 + 1] * k42 + inData[p43 + 1] * k44 + inData[p42 + 1] * k44;
+g.contains = function (l, value) {
+    for (var i = 0; i < l.length; i += 1) {
+        if (deepEqual.deepEqual(l[i], value)) {
+            return true;
+        }
+    }
+    return false;
+};
 
-            b = inData[p00 + 2] * k00 + inData[p01 + 2] * k01 + inData[p02 + 2] * k02 + inData[p03 + 2] * k04 + inData[p02 + 2] * k04 +
-                inData[p10 + 2] * k10 + inData[p11 + 2] * k11 + inData[p12 + 2] * k12 + inData[p13 + 2] * k14 + inData[p12 + 2] * k14 +
-                inData[p20 + 2] * k20 + inData[p21 + 2] * k21 + inData[p22 + 2] * k22 + inData[p23 + 2] * k24 + inData[p22 + 2] * k24 +
-                inData[p30 + 2] * k30 + inData[p31 + 2] * k31 + inData[p32 + 2] * k32 + inData[p33 + 2] * k34 + inData[p32 + 2] * k34 +
-                inData[p40 + 2] * k40 + inData[p41 + 2] * k41 + inData[p42 + 2] * k42 + inData[p43 + 2] * k44 + inData[p42 + 2] * k44;
+g.cycle = function (l, length) {
+    if (!l || length <= 0) { return []; }
+    var newList = [];
+    var ll = l.length;
+    for (var i = 0; i < length; i += 1) {
+        newList.push(l[i % ll]);
+    }
+    return newList;
+};
 
-            if (alpha) {
-                a = inData[p00 + 3] * k00 + inData[p01 + 3] * k01 + inData[p02 + 3] * k02 + inData[p03 + 3] * k04 + inData[p02 + 3] * k04 +
-                    inData[p10 + 3] * k10 + inData[p11 + 3] * k11 + inData[p12 + 3] * k12 + inData[p13 + 3] * k14 + inData[p12 + 3] * k14 +
-                    inData[p20 + 3] * k20 + inData[p21 + 3] * k21 + inData[p22 + 3] * k22 + inData[p23 + 3] * k24 + inData[p22 + 3] * k24 +
-                    inData[p30 + 3] * k30 + inData[p31 + 3] * k31 + inData[p32 + 3] * k32 + inData[p33 + 3] * k34 + inData[p32 + 3] * k34 +
-                    inData[p40 + 3] * k40 + inData[p41 + 3] * k41 + inData[p42 + 3] * k42 + inData[p43 + 3] * k44 + inData[p42 + 3] * k44;
-            } else {
-                a = inData[idx + 3];
-            }
+g.equals = function (o1, o2) {
+    return deepEqual.deepEqual(o1, o2);
+};
 
-            if (mono) {
-                r = g = b = (r + g + b) / 3;
-            }
+g.count = function (l) {
+    if (l && l.length) {
+        return l.length;
+    } else {
+        return 0;
+    }
+};
 
-            if (invert) {
-                r = 255 - r;
-                g = 255 - g;
-                b = 255 - b;
-            }
+g.cull = function (l, booleans) {
+    if (!l) { return []; }
+    if (!booleans) { return l; }
+    var i, keep, results = [];
+    for (i = 0; i < l.length; i++) {
+        // Cycle through the list of boolean values.
+        keep = booleans[i % booleans.length];
+        if (keep) {
+            results.push(l[i]);
+        }
+    }
+    return results;
+};
 
-            outData[idx] = r;
-            outData[idx + 1] = g;
-            outData[idx + 2] = b;
-            outData[idx + 3] = a;
+g.distinct = function(l) {
+    if (!l) { return []; }
+    var i, length, value,
+        result = [],
+        seen = [];
+    for (i = 0, length = l.length; i < length; i += 1) {
+        value = l[i];
+        if (!g.contains(seen, value)) {
+            seen.push(value);
+            result.push(l[i]);
         }
     }
-}
+    return result;
+};
 
-function gaussian(inData, outData, width, height, kernelSize) {
-    var x, y, i, j, n = width * height * 4,
-        r, g, b, a, idx,
-        inx, iny, w,
-        tmpData = [],
-        maxKernelSize = 13,
-        k1, k2, weights,
-        kernels = [
-            [1]
-        ];
+g.first = function (l) {
+    if (!l || l.length === 0) { return null; }
+    return l[0];
+};
 
-    kernelSize = clamp(kernelSize, 3, maxKernelSize);
-    k1 = -kernelSize / 2 + (kernelSize % 2 ? 0.5 : 0);
-    k2 = kernelSize + k1;
+g.get = function (l, i) {
+    if (!l || l.length === 0) { return null; }
+    return l[i];
+};
 
-    for (i = 1; i < maxKernelSize; i += 1) {
-        kernels[0][i] = 0;
+g.interleave = function () {
+    if (arguments.length === 0) return [];
+    var results = [];
+    var elIndex = 0;
+    while (true) {
+        for (var i = 0; i < arguments.length; i++) {
+            var arg = arguments[i];
+            if (arg.length > elIndex) {
+                results.push(arg[elIndex]);
+            } else {
+                return results;
+            }
+        }
+        elIndex += 1;
     }
+};
 
-    for (i = 1; i < maxKernelSize; i += 1) {
-        kernels[i] = [1];
-        for (j = 1; j < maxKernelSize; j += 1) {
-            kernels[i][j] = kernels[i - 1][j] + kernels[i - 1][j - 1];
-        }
+g.last = function (l) {
+    if (!l || l.length === 0) { return null; }
+    return l[l.length - 1];
+};
+
+g.pick = function (l, amount, seed) {
+    if (!l || l.length === 0 || amount <= 0) {
+        return [];
+    }
+    if (!seed && seed !== 0) {
+        seed = Math.random();
+    }
+    var rand = util.randomGenerator(seed || 0);
+    var results = [];
+    for (var i = 0; i < amount; i += 1) {
+        results.push(l[Math.floor(rand(0, l.length))]);
     }
+    return results;
+};
 
-    weights = kernels[kernelSize - 1];
+g.randomSample = function (l, amount, seed) {
+    if (!l || l.length === 0 || amount <= 0) {
+        return [];
+    }
+    if (!seed && seed !== 0) {
+        seed = Math.random();
+    }
+    var shuffledlist = g.shuffle(l, seed);
+    if (!amount) { return shuffledlist; }
+    return g.slice(shuffledlist, 0, amount);
+};
 
-    for (i = 0, w = 0; i < kernelSize; i += 1) {
-        w += weights[i];
+g.repeat = function (l, amount, perItem) {
+    if (!l) { return []; }
+    if (!Array.isArray(l)) {
+        l = [l];
     }
-    for (i = 0; i < kernelSize; i += 1) {
-        weights[i] /= w;
+    if (amount <= 0) { return []; }
+    var i, j, v,
+        newList = [];
+    if (!perItem) {
+        for (i = 0; i < amount; i += 1) {
+            newList.push.apply(newList, l);
+        }
+    } else {
+        for (i = 0; i < l.length; i += 1) {
+            v = l[i];
+            for (j = 0; j < amount; j += 1) {
+                newList.push(v);
+            }
+        }
     }
+    return newList;
+};
 
-    // pass 1
-    for (y = 0; y < height; y += 1) {
-        for (x = 0; x < width; x += 1) {
-            r = g = b = a = 0;
+g.rest = function (l) {
+    if (!l) { return []; }
+    return l.slice(1);
+};
 
-            for (i = k1; i < k2; i += 1) {
-                inx = x + i;
-                iny = y;
-                w = weights[i - k1];
+g.reverse = function (l) {
+    return l.slice().reverse();
 
-                if (inx < 0) {
-                    inx = 0;
-                }
-                if (inx >= width) {
-                    inx = width - 1;
-                }
+};
 
-                idx = (iny * width + inx) * 4;
+g.second = function (l) {
+    if (!l || l.length < 2) { return null; }
+    return l[1];
+};
 
-                r += inData[idx] * w;
-                g += inData[idx + 1] * w;
-                b += inData[idx + 2] * w;
-                a += inData[idx + 3] * w;
+g.shift = function (l, amount) {
+    // If the amount is bigger than the number of items, wrap around.
+    if (!l) { return []; }
+    amount = amount % l.length;
+    var head = l.slice(0, amount),
+        result = l.slice(amount);
+    result.push.apply(result, head);
+    return result;
+};
 
-            }
+g.shuffle = function (l, seed) {
+    var i, j, tmp, r;
+    if (!seed && seed !== 0) {
+        seed = Math.random();
+    }
+    r = util.randomGenerator(seed || 0);
+    l = l.slice();
+    for (i = l.length - 1; i > 0; i--) {
+        j = Math.floor(r(0, i + 1));
+        tmp = l[i];
+        l[i] = l[j];
+        l[j] = tmp;
+    }
+    return l;
+};
 
-            idx = (y * width + x) * 4;
+g.slice = function (l, start, size, invert) {
+    if (!l) { return []; }
+    var firstList, secondList;
+    if (!invert) {
+        return l.slice(start, start + size);
+    } else {
+        firstList = l.slice(0, start);
+        secondList = l.slice(start + size);
+        firstList.push.apply(firstList, secondList);
+        return firstList;
+    }
+};
 
-            tmpData[idx] = r;
-            tmpData[idx + 1] = g;
-            tmpData[idx + 2] = b;
-            tmpData[idx + 3] = a;
+g.sort = function (l, key) {
+    if (key) {
+        if (typeof key === 'string') {
+            return l.slice().sort(function (a, b) {
+                if (a[key] > b[key]) { return 1; }
+                else if (a[key] === b[key]) { return 0; }
+                else { return -1; }
+            });
+        } else if (typeof key === 'function') {
+            return l.slice().sort(key);
         }
     }
+    if (l && l[0] !== undefined && l[0] !== null && typeof l[0] === 'number') {
+        return l.slice().sort(function (a, b) { return a - b; });
+    }
+    return l.slice().sort();
+};
 
-    // pass 2
-    for (y = 0; y < height; y += 1) {
-        for (x = 0; x < width; x += 1) {
-            r = g = b = a = 0;
+g.switch = function (index) {
+    var nLists = (arguments.length - 1);
+    index = index % nLists;
+    if (index < 0) {
+        index += nLists;
+    }
+    return arguments[index + 1];
+};
 
-            for (i = k1; i < k2; i += 1) {
-                inx = x;
-                iny = y + i;
-                w = weights[i - k1];
+g.takeEvery = function (l, n, offset) {
+    var i, results = [];
+    offset = offset || 0;
+    for (i = 0; i < l.length; i += 1) {
+        if (i % n === offset) {
+            results.push(l[i]);
+        }
+    }
+    return results;
+};
 
-                if (iny < 0) {
-                    iny = 0;
-                }
-                if (iny >= height) {
-                    iny = height - 1;
-                }
+g.zipMap = function (keys, vals) {
+    var i, k, v,
+        m = {},
+        minLength = Math.min(keys.length, vals.length);
+    for (i = 0; i < minLength; i += 1) {
+        k = keys[i];
+        v = vals[i];
+        m[k] = v;
+    }
+    return m;
+};
 
-                idx = (iny * width + inx) * 4;
+module.exports = g;
 
-                r += tmpData[idx] * w;
-                g += tmpData[idx + 1] * w;
-                b += tmpData[idx + 2] * w;
-                a += tmpData[idx + 3] * w;
-            }
+},{"./deepequal":10,"./util":23}],21:[function(require,module,exports){
+'use strict';
 
-            idx = (y * width + x) * 4;
+var _ = require('lodash');
 
-            outData[idx] = r;
-            outData[idx + 1] = g;
-            outData[idx + 2] = b;
-            outData[idx + 3] = a;
-        }
-    }
-}
+var util = require('./util');
+var vg = require('./vg/vg');
 
-function getPixel(v, i) {
-    i *= 4;
-    return [v[i + 0], v[i + 1], v[i + 2], v[i + 3]];
-}
+var g = {};
 
-function setPixel(v, i, rgba) {
-    i *= 4;
-    v[i + 0] = rgba[0];
-    v[i + 1] = rgba[1];
-    v[i + 2] = rgba[2];
-    v[i + 3] = rgba[3];
-}
+var TWO_PI = Math.PI * 2;
 
-// Polar filters (distortion filters) are from canvas.js: https://github.com/clips/pattern/blob/master/pattern/canvas.js (BSD)
-// De Smedt T. & Daelemans W. (2012). Pattern for Python. Journal of Machine Learning Research.
-// Based on: L. Spagnolini, 2007
+g.abs = Math.abs;
 
-function polar(inData, outData, x0, y0, width, height, callback) {
-    /* Sets image data based on a polar coordinates filter.
-     * The given callback is a function(distance, angle) that returns new [distance, angle].
-     */
-    x0 = width / 2 + (x0 || 0);
-    y0 = height / 2 + (y0 || 0);
-    var y1, x1, x, y, d, a, v;
-    for (y1 = 0; y1 < height; y1 += 1) {
-        for (x1 = 0; x1 < width; x1 += 1) {
-            x = x1 - x0;
-            y = y1 - y0;
-            d = Math.sqrt(Math.pow(x, 2) + Math.pow(y, 2));
-            a = Math.atan2(y, x);
-            v = callback(d, a);
-            d = v[0];
-            a = v[1];
-            setPixel(outData, x1 + y1 * width, getPixel(inData,
-                Math.round(x0 + Math.cos(a) * d) +
-                Math.round(y0 + Math.sin(a) * d) * width
-            ));
-        }
+g.accumulate = function (values) {
+    if (arguments.length > 1) {
+        values = arguments;
+    } else if (arguments.length === 1 && !Array.isArray(values)) {
+        values = [values];
     }
-}
+    if (!values || values.length === 0) { return [0.0]; }
+    var i, b = [],
+        currentTotal = 0;
+    for (i = 0; i < values.length; i++) {
+        b.push(currentTotal);
+        currentTotal += values[i];
+    }
+    return b;
+};
 
-var process = {
+g.add = function (a, b) {
+    if (arguments.length === 2) { return a + b; }
+    return _.reduce(arguments, function(total, n) {
+        return total + n;
+    }, 0);
+};
 
-    invert: function (inData, outData, width, height) {
-        var i, n = width * height * 4;
+g.and = function (bool1, bool2) {
+    var argLength = arguments.length;
+    if (argLength === 2) {
+        return bool1 && bool2;
+    } else if (argLength === 1) {
+        return !!bool1;
+    } else if (argLength === 0) {
+        throw new Error('Wrong number of arguments');
+    }
+    return _.reduce(arguments, function(b1, b2) {
+        return b1 && b2;
+    }, true);
+};
 
-        for (i = 0; i < n; i += 4) {
-            outData[i] = 255 - inData[i];
-            outData[i + 1] = 255 - inData[i + 1];
-            outData[i + 2] = 255 - inData[i + 2];
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+g.average = function (values) {
+    if (arguments.length > 1) {
+        values = arguments;
+    } else if (arguments.length === 1 && !Array.isArray(values)) {
+        values = [values];
+    }
+    if (!values || values.length === 0) { return 0; }
+    var i, sum = 0;
+    for (i = 0; i < values.length; i += 1) {
+        sum += values[i];
+    }
+    return sum / values.length;
+};
 
-    sepia: function (inData, outData, width, height) {
-        var i, n = width * height * 4,
-            r, g, b;
+g.boolean = function (v) {
+    return !!v;
+};
 
-        for (i = 0; i < n; i += 4) {
-            r = inData[i];
-            g = inData[i + 1];
-            b = inData[i + 2];
-            outData[i] = (r * 0.393 + g * 0.769 + b * 0.189);
-            outData[i + 1] = (r * 0.349 + g * 0.686 + b * 0.168);
-            outData[i + 2] = (r * 0.272 + g * 0.534 + b * 0.131);
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+g.ceil = Math.ceil;
 
-    solarize: function (inData, outData, width, height) {
-        var i, n = width * height * 4,
-            r, g, b;
+g.clamp = function (v, min, max) {
+    min = typeof min === 'number' ? min : 0;
+    max = typeof max === 'number' ? max : 1;
+    return v < min ? min : (v > max ? max : v);
+};
 
-        for (i = 0; i < n; i += 4) {
-            r = inData[i];
-            g = inData[i + 1];
-            b = inData[i + 2];
+g.compare = function (v1, v2, comparator) {
+    if (comparator === '<') {
+        return v1 < v2;
+    } else if (comparator === '>') {
+        return v1 > v2;
+    } else if (comparator === '<=') {
+        return v1 <= v2;
+    } else if (comparator === '>=') {
+        return v1 >= v2;
+    } else if (comparator === '==') {
+        return v1 === v2;
+    } else if (comparator === '!=') {
+        return v1 !== v2;
+    }
+    throw new Error('Unknown comparison operation ' + comparator);
+};
 
-            outData[i] = r > 127 ? 255 - r : r;
-            outData[i + 1] = g > 127 ? 255 - g : g;
-            outData[i + 2] = b > 127 ? 255 - b : b;
-            outData[i + 3] = inData[i + 3];
+g.cos = Math.cos;
+
+g.degrees = function (radians) {
+    return radians * 180 / Math.PI;
+};
+
+g.divide = function (a, b) {
+    var argLength = arguments.length;
+    function checkIfZero(arg) {
+        if (arg === 0) {
+            throw new Error('Divide by zero');
         }
-    },
+    }
+    if (argLength === 2) {
+        checkIfZero(b);
+        return a / b;
+    } else if (argLength === 1) {
+        checkIfZero(a);
+        return 1 / a;
+    } else if (argLength === 0) {
+        throw new Error('Wrong number of arguments');
+    }
+    return _.reduce([].slice.call(arguments, 1), function(total, n) {
+        checkIfZero(n);
+        return total / n;
+    }, arguments[0]);
+};
 
-    brightness: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {
-            brightness: 1,
-            contrast: 0
-        });
+g.e = function () {
+    return Math.E;
+};
 
-        var i, n = width * height * 4,
-            r, g, b,
-            contrast = clamp(options.contrast, -1, 1) / 2,
-            brightness = 1 + clamp(options.brightness, -1, 1),
-            brightMul = brightness < 0 ? -brightness : brightness,
-            brightAdd = brightness < 0 ? 0 : brightness,
-            contrastAdd;
+g.even = function (v) {
+    return v % 2 === 0;
+};
 
-        contrast = 0.5 * Math.tan((contrast + 1) * Math.PI / 4);
-        contrastAdd = -(contrast - 0.5) * 255;
+g.floor = Math.floor;
 
-        for (i = 0; i < n; i += 4) {
-            r = inData[i];
-            g = inData[i + 1];
-            b = inData[i + 2];
+g.integer = function (v) {
+    return v | 0;
+};
 
-            r = (r + r * brightMul + brightAdd) * contrast + contrastAdd;
-            g = (g + g * brightMul + brightAdd) * contrast + contrastAdd;
-            b = (b + b * brightMul + brightAdd) * contrast + contrastAdd;
+g.log = function (v) {
+    return v > 0 ? Math.log(v) : -Math.log(-v);
+};
 
-            outData[i] = r;
-            outData[i + 1] = g;
-            outData[i + 2] = b;
-            outData[i + 3] = inData[i + 3];
+g.makeNumbers = function (s, separator) {
+    if (!s) { return []; }
+    if (!separator) { separator = ''; }
+    var i, num, numbers = [],
+        strings = s.split(separator);
+    for (i = 0; i < strings.length; i += 1) {
+        num = parseFloat(strings[i]);
+        if (num === 0 || num) {
+            numbers.push(num);
         }
-    },
+    }
+    return numbers;
+};
 
-    desaturate: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {method: LUMINOSITY_ITU_R_BT601});
-        var i, n = width * height * 4,
-            level, rCoeff, gCoeff, bCoeff;
+g.max = function () {
+    var values = arguments;
+    if (arguments.length === 1 && Array.isArray(arguments[0])) {
+        values = arguments[0];
+    }
+    if (values.length === 0) {
+        throw new Error('Wrong number of arguments');
+    }
+    return Math.max.apply(null, values);
+};
 
-        if (options.method === LUMINOSITY_ITU_R_BT601) {
-            rCoeff = 0.3; gCoeff = 0.59; bCoeff = 0.11;
-        } else if (options.method === LUMINOSITY_ITU_R_BT709) {
-            rCoeff = 0.2125; gCoeff = 0.7154; bCoeff = 0.0721;
-        }
+g.min = function () {
+    var values = arguments;
+    if (arguments.length === 1 && Array.isArray(arguments[0])) {
+        values = arguments[0];
+    }
+    if (values.length === 0) {
+        throw new Error('Wrong number of arguments');
+    }
+    return Math.min.apply(null, values);
+};
 
-        for (i = 0; i < n; i += 4) {
-            level = inData[i] * rCoeff + inData[i + 1] * gCoeff + inData[i + 2] * bCoeff;
-            outData[i] = level;
-            outData[i + 1] = level;
-            outData[i + 2] = level;
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+g.mod = function (a, b) {
+    return a % b;
+};
+
+g.multiply = function (a, b) {
+    var argLength = arguments.length;
+    if (argLength === 2) { return a * b; }
+    else if (argLength === 1) { return a; }
+    return _.reduce(arguments, function(total, n) {
+        return total * n;
+    }, 1);
+};
 
-    lighten: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {amount: 0.25});
-        var i, n = width * height * 4,
-            mul = 1 + clamp(options.amount, 0, 1);
+g.negate = function (v) {
+    return -v;
+};
 
-        for (i = 0; i < n; i += 4) {
-            outData[i] = inData[i] * mul;
-            outData[i + 1] = inData[i + 1] * mul;
-            outData[i + 2] = inData[i + 2] * mul;
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+g.not = function (bool) {
+    return !bool;
+};
 
-    noise: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {amount: 0.5, strength: 0.5, mono: false});
-        var i, n = width * height * 4,
-            rnd, r, g, b,
-            amount = clamp(options.amount, 0, 1),
-            strength = clamp(options.strength, 0, 1),
-            mono = !!options.mono,
-            random = Math.random;
+g.number = function (v) {
+    return v;
+};
 
-        for (i = 0; i < n; i += 4) {
-            r = inData[i];
-            g = inData[i + 1];
-            b = inData[i + 2];
+g.odd = function (v) {
+    return v % 2 !== 0;
+};
 
-            rnd = random();
+g.or = function (bool1, bool2) {
+    var argLength = arguments.length;
+    if (argLength === 2) {
+        return bool1 || bool2;
+    } else if (argLength === 1) {
+        return !!bool1;
+    } else if (argLength === 0) {
+        throw new Error('Wrong number of arguments');
+    }
+    return _.reduce(arguments, function(b1, b2) {
+        return b1 || b2;
+    }, false);
+};
 
-            if (rnd < amount) {
-                if (mono) {
-                    rnd = strength * ((rnd / amount) * 2 - 1) * 255;
-                    r += rnd;
-                    g += rnd;
-                    b += rnd;
-                } else {
-                    r += strength * random() * 255;
-                    g += strength * random() * 255;
-                    b += strength * random() * 255;
-                }
-            }
+// Compute Perlin noise
+g.perlinNoise = function (x, y, z) {
+    // Call optimized internal noise function.
+    return vg.math.noise(x, y, z);
+};
 
-            outData[i] = r;
-            outData[i + 1] = g;
-            outData[i + 2] = b;
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+g.pi = function () {
+    return Math.PI;
+};
 
-    flipv: function (inData, outData, width, height) {
-        var x, y, n = width * height * 4,
-            inPix, outPix;
+g.pow = Math.pow;
 
-        for (y = 0; y < height; y += 1) {
-            for (x = 0; x < width; x += 1) {
-                inPix = (y * width + x) * 4;
-                outPix = (y * width + (width - x - 1)) * 4;
+g.radians = function (degrees) {
+    return degrees * Math.PI / 180;
+};
 
-                outData[outPix] = inData[inPix];
-                outData[outPix + 1] = inData[inPix + 1];
-                outData[outPix + 2] = inData[inPix + 2];
-                outData[outPix + 3] = inData[inPix + 3];
+g.randomNumbers = function (amount, min, max, seed) {
+    var argLength = arguments.length;
+    if (argLength < 4 || (!seed && seed !== 0)) {
+        seed = Math.random();
+    }
+    if (argLength === 3 || argLength === 4) {
+        min = min || 0;
+        max = max || (max === 0 ? 0 : 1);
+    } else if (argLength === 2) {
+        max = min || (min === 0 ? 0 : 1);
+        min = 0;
+    } else if (argLength === 1) {
+        min = 0;
+        max = 1;
+    }
+    if (max < min) {
+        var tmp = max;
+        max = min;
+        min = tmp;
+    }
+    var v;
+    var delta = max - min;
+    var numbers = [];
+    var rand = util.randomGenerator(seed || 0);
+    for (var i = 0; i < amount; i += 1) {
+        v = min + (rand(0, 1) * delta);
+        numbers.push(v);
+    }
+    return numbers;
+};
+
+g.range = function (min, max, step, includeMax) {
+    if (min === max) { return []; }
+    if (step !== 0) {
+        step = step || (min < max ? 1 : -1);
+    }
+    if (step > 0 && min > max) return [];
+    if (step < 0 && min < max) return [];
+    if (step === 0) return [];
+    var values = [];
+    var i;
+    if (min < max) {
+        if (!!includeMax) {
+            for (i = min; i <= max; i += step) {
+                values.push(i);
+            }
+        } else {
+            for (i = min; i < max; i += step) {
+                values.push(i);
             }
         }
-    },
+    } else {
+        if (!!includeMax) {
+            for (i = min; i >= max; i += step) {
+                values.push(i);
+            }
+        } else {
+            for (i = min; i > max; i += step) {
+                values.push(i);
+            }
+        }
+    }
+    return values;
+};
 
-    fliph: function (inData, outData, width, height) {
-        var x, y, n = width * height * 4,
-            inPix, outPix;
+g.round = function (v, a) {
+    a = a | 0;
+    if (!a) {
+        return Math.round(v);
+    }
+    return Math.round(v / a) * a;
+};
 
-        for (y = 0; y < height; y += 1) {
-            for (x = 0; x < width; x += 1) {
-                inPix = (y * width + x) * 4;
-                outPix = ((height - y - 1) * width + x) * 4;
+g.sample = function (amount, min, max, circular) {
+    var d,
+        values = [],
+        i;
+    values.length = amount;
+    if (circular) {
+        d = (max - min) / amount;
+    } else {
+        d = (max - min) / (amount - 1);
+    }
+    for (i = 0; i < amount; i += 1) {
+        values[i] = min + i * d;
+    }
+    return values;
+};
 
-                outData[outPix] = inData[inPix];
-                outData[outPix + 1] = inData[inPix + 1];
-                outData[outPix + 2] = inData[inPix + 2];
-                outData[outPix + 3] = inData[inPix + 3];
-            }
-        }
-    },
+g.sineWave = function (v, min, max, period, offset) {
+    if (min === undefined) min = -1;
+    if (max === undefined) max = 1;
+    if (period === undefined) period = 1;
+    if (offset === undefined) offset = 0;
+    var amplitude = (max - min) / 2;
+    return (min + amplitude) + Math.sin((offset + v) * TWO_PI / period) * amplitude;
+};
 
-    // Uses fast stackblur algorithm from http://www.quasimondo.com/StackBlurForCanvas
-    blur: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {radius: 10});
-        for (var i = 0; i < inData.length; i += 1) {
-            outData[i] = inData[i];
-        }
-        stackblur(outData, width, height, options.radius);
-    },
+g.squareWave = function (v, min, max, period, offset) {
+    if (min === undefined) min = -1;
+    if (max === undefined) max = 1;
+    if (period === undefined) period = 1;
+    if (offset === undefined) offset = 0;
+    var halfPeriod = period / 2;
+    var d = (v + offset) % period;
+    if (d < halfPeriod) {
+        return max;
+    } else {
+        return min;
+    }
+};
+
+g.triangleWave = function (v, min, max, period, offset) {
+    if (min === undefined) min = -1;
+    if (max === undefined) max = 1;
+    if (period === undefined) period = 1;
+    if (offset === undefined) offset = 0;
+    var amplitude = (max - min) / 2,
+        frequency = TWO_PI / period,
+        phase = 0,
+        time = v + offset + period / 4;
+    if (time % period !== 0) {
+        phase = (time * frequency) % TWO_PI;
+    }
+    if (phase < 0) { phase += TWO_PI; }
+    return 2 * amplitude * (1 + -Math.abs((phase / TWO_PI) * 2 - 1)) + min;
+};
+
+g.sawtoothWave = function (v, min, max, period, offset) {
+    if (min === undefined) min = -1;
+    if (max === undefined) max = 1;
+    if (period === undefined) period = 1;
+    if (offset === undefined) offset = 0;
+    var amplitude = (max - min) / 2,
+        frequency = TWO_PI / period,
+        phase = 0,
+        time = v + offset;
+    if (time % period !== 0) {
+        phase = (time * frequency) % TWO_PI;
+    }
+    if (phase < 0) { phase += TWO_PI; }
+    return 2 * (phase / TWO_PI) * amplitude + min;
+};
 
-    glow: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {amount: 0.75, kernelSize: 5});
-        var i, n = width * height * 4,
-            r, g, b,
-            amount = options.amount,
-            tmpData = [];
+g.sign = function (v) {
+    if (v > 0) {
+        return 1;
+    } else if (v === 0) {
+        return 0;
+    } else {
+        return -1;
+    }
+};
 
-        gaussian(inData, tmpData, width, height, options.kernelSize);
+g.sin = Math.sin;
 
-        for (i = 0; i < n; i += 4) {
-            r = inData[i] + tmpData[i] * amount;
-            g = inData[i + 1] + tmpData[i + 1] * amount;
-            b = inData[i + 2] + tmpData[i + 2] * amount;
-            if (r > 255) {
-                r = 255;
-            }
-            if (g > 255) {
-                g = 255;
-            }
-            if (b > 255) {
-                b = 255;
-            }
-            outData[i] = r;
-            outData[i + 1] = g;
-            outData[i + 2] = b;
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+g.sqrt = Math.sqrt;
 
-    convolve3x3: function (inData, outData, width, height, options) {
-        convolve3x3(inData, outData, width, height, options.kernel);
-    },
+g.subtract = function (a, b) {
+    var argLength = arguments.length;
+    if (argLength === 2) { return a - b; }
+    else if (argLength === 1) { return -a; }
+    else if (argLength === 0) { throw new Error('Wrong number of arguments'); }
+    return _.reduce([].slice.call(arguments, 1), function(total, n) {
+        return total - n;
+    }, arguments[0]);
+};
 
-    convolve5x5: function (inData, outData, width, height, options) {
-        convolve5x5(inData, outData, width, height, options.kernel);
-    },
+g.tan = Math.tan;
 
-    // A 3x3 high-pass filter
-    sharpen3x3: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {strength: 1});
-        var a = -clamp(options.strength, 0, 1);
-        convolve3x3(inData, outData, width, height,
-            [
-                [a, a, a],
-                [a, 1 - a * 8, a],
-                [a, a, a]
-            ]);
-    },
+g.total = function (values) {
+    if (arguments.length > 1) {
+        values = arguments;
+    } else if (arguments.length === 1 && !Array.isArray(values)) {
+        values = [values];
+    } else if (arguments.length === 0) {
+        values = [];
+    }
+    if (values.length === 0) { return 0; }
+    var i, total = 0;
+    for (i = 0; i < values.length; i += 1) {
+        total += values[i];
+    }
+    return total;
+};
 
-    // A 5x5 high-pass filter
-    sharpen5x5: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {strength: 1});
-        var a = -clamp(options.strength, 0, 1);
-        convolve5x5(inData, outData, width, height,
-            [
-                [a, a, a, a, a],
-                [a, a, a, a, a],
-                [a, a, 1 - a * 24, a, a],
-                [a, a, a, a, a],
-                [a, a, a, a, a]
-            ]);
-    },
+g.xor = function (bool1, bool2) {
+    var argLength = arguments.length;
+    if (argLength === 2) {
+        return !!(bool1 ^ bool2);
+    } else {
+        throw new Error('Wrong number of arguments');
+    }
+};
 
-    // A 3x3 low-pass mean filter
-    soften3x3: function (inData, outData, width, height) {
-        var c = 1 / 9;
-        convolve3x3(inData, outData, width, height,
-            [
-                [c, c, c],
-                [c, c, c],
-                [c, c, c]
-            ]);
-    },
+module.exports = g;
 
-    // A 5x5 low-pass mean filter
-    soften5x5: function (inData, outData, width, height) {
-        var c = 1 / 25;
-        convolve5x5(inData, outData, width, height,
-            [
-                [c, c, c, c, c],
-                [c, c, c, c, c],
-                [c, c, c, c, c],
-                [c, c, c, c, c],
-                [c, c, c, c, c]
-            ]);
-    },
+},{"./util":23,"./vg/vg":44,"lodash":2}],22:[function(require,module,exports){
+'use strict';
 
-    // A 3x3 Cross edge-detect
-    crossedges: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {strength: 1});
-        var a = clamp(options.strength, 0, 1) * 5;
-        convolve3x3(inData, outData, width, height,
-            [
-                [ 0, -a, 0],
-                [-a, 0, a],
-                [ 0, a, 0]
-            ],
-            false, true);
-    },
+var g = {};
 
-    // 3x3 directional emboss
-    emboss: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {amount: 1, angle: 0});
-        var i, n = width * height * 4,
-            amount = options.amount,
-            angle = options.angle,
-            x = Math.cos(-angle) * amount,
-            y = Math.sin(-angle) * amount,
+g.characterAt = function (s, index) {
+    if (!s || s.length === 0) { return ''; }
+    s = String(s);
+    if (index < 0) {
+        index = s.length + index;
+    }
+    return s.charAt(index);
+};
 
-            a00 = -x - y,
-            a10 = -x,
-            a20 = y - x,
-            a01 = -y,
-            a21 = y,
-            a02 = -y + x,
-            a12 = x,
-            a22 = y + x,
+g.concatenate = function () {
+    var result = '';
+    for (var i = 0; i < arguments.length; i++) {
+        var s = arguments[i];
+        s = s !== undefined ? String(s) : '';
+        result += s;
+    }
+    return result;
+};
 
-            tmpData = [];
+g.endsWith = function (s, value) {
+    if (!s || !value) { return false; }
+    s = String(s);
+    return s.indexOf(value, s.length - value.length) !== -1;
+};
 
-        convolve3x3(inData, tmpData, width, height,
-            [
-                [a00, a01, a02],
-                [a10, 0, a12],
-                [a20, a21, a22]
-            ]);
+g.reverse = function (l) {
+    return l.slice().reverse();
+};
 
-        for (i = 0; i < n; i += 4) {
-            outData[i] = 128 + tmpData[i];
-            outData[i + 1] = 128 + tmpData[i + 1];
-            outData[i + 2] = 128 + tmpData[i + 2];
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+g.startsWith = function (s, value) {
+    if (!s || !value) { return false; }
+    s = String(s);
+    return s.indexOf(value) === 0;
+};
 
+g.string = String;
 
-    // A 3x3 Sobel edge detect (similar to Photoshop's)
-    findedges: function (inData, outData, width, height) {
-        var i, n = width * height * 4,
-            gr1, gr2, gg1, gg2, gb1, gb2,
-            data1 = [],
-            data2 = [];
+g.stringContains = function (s, sub) {
+    if (!s || !sub) { return false; }
+    s = String(s);
+    return s.indexOf(sub) !== -1;
+};
 
-        convolve3x3(inData, data1, width, height,
-            [
-                [-1, 0, 1],
-                [-2, 0, 2],
-                [-1, 0, 1]
-            ]);
+g.stringEquals = function (string1, string2, ignoreCase) {
+    string1 = String(string1);
+    string2 = String(string2);
+    if (!string1 || !string2) {
+        return false;
+    }
+    if (ignoreCase) {
+        return string1.toLowerCase() === string2.toLowerCase();
+    } else {
+        return string1 === string2;
+    }
+};
 
-        convolve3x3(inData, data2, width, height,
-            [
-                [-1, -2, -1],
-                [ 0, 0, 0],
-                [ 1, 2, 1]
-            ]);
+g.stringLength = function (s) {
+    if (!s) { return 0; }
+    s = String(s);
+    return s.length;
+};
 
-        for (i = 0; i < n; i += 4) {
-            gr1 = data1[i];
-            gr2 = data2[i];
-            gg1 = data1[i + 1];
-            gg2 = data2[i + 1];
-            gb1 = data1[i + 2];
-            gb2 = data2[i + 2];
+g.stringReplace = function (s, old, new_) {
+    s = String(s);
+    return s.replace(new RegExp(old, 'g'), new_);
+};
+
+g.stringSplit = function (s, separator) {
+    if (!s) { return []; }
+    if (!separator || separator.length === 0) {
+        separator = '';
+    }
+    s = String(s);
+    return s.split(separator);
+};
 
-            if (gr1 < 0) {
-                gr1 = -gr1;
-            }
-            if (gr2 < 0) {
-                gr2 = -gr2;
-            }
-            if (gg1 < 0) {
-                gg1 = -gg1;
-            }
-            if (gg2 < 0) {
-                gg2 = -gg2;
-            }
-            if (gb1 < 0) {
-                gb1 = -gb1;
-            }
-            if (gb2 < 0) {
-                gb2 = -gb2;
-            }
+g.stringTrim = function (s) {
+    if (!s) { return null; }
+    s = String(s);
+    return s.trim();
+};
 
-            outData[i] = 255 - (gr1 + gr2) * 0.8;
-            outData[i + 1] = 255 - (gg1 + gg2) * 0.8;
-            outData[i + 2] = 255 - (gb1 + gb2) * 0.8;
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+g.substring = function (s, start, end, endOffset) {
+    if (!s) { return ''; }
+    if (end < start) { return ''; }
+    s = String(s);
 
-    // A 3x3 edge enhance
-    edgeenhance3x3: function (inData, outData, width, height) {
-        var c = -1 / 9;
-        convolve3x3(inData, outData, width, height,
-            [
-                [c, c, c],
-                [c, 17 / 9, c],
-                [c, c, c]
-            ]);
-    },
+    if (start < 0 && end < 0) {
+        start = s.length + start;
+        end = s.length + end;
+    }
 
-    // A 5x5 edge enhance
-    edgeenhance5x5: function (inData, outData, width, height) {
-        var c = -1 / 25;
-        convolve5x5(inData, outData, width, height,
-            [
-                [c, c, c, c, c],
-                [c, c, c, c, c],
-                [c, c, 49 / 25, c, c],
-                [c, c, c, c, c],
-                [c, c, c, c, c]
-            ]);
-    },
+    if (end !== undefined) {
+        if (endOffset) {
+            end += 1;
+        }
+    }
+    return s.substring(start, end);
+};
 
-    // A 3x3 Laplacian edge-detect
-    laplace3x3: function (inData, outData, width, height) {
-        convolve3x3(inData, outData, width, height,
-            [
-                [-1, -1, -1],
-                [-1, 8, -1],
-                [-1, -1, -1]
-            ],
-            false, true, true);
-    },
+g.toCharacterCodes = function(s) {
+    if (!s) return [];
+    var codes = [];
+    codes.length = s.length;
+    for (var i = 0; i < s.length; i += 1) {
+        codes[i] = s.charCodeAt(i);
+    }
+    return codes;
+};
 
-    // A 5x5 Laplacian edge-detect
-    laplace5x5: function (inData, outData, width, height) {
-        convolve5x5(inData, outData, width, height,
-            [
-                [-1, -1, -1, -1, -1],
-                [-1, -1, -1, -1, -1],
-                [-1, -1, 24, -1, -1],
-                [-1, -1, -1, -1, -1],
-                [-1, -1, -1, -1, -1]
-            ],
-            false, true, true);
-    },
+g.toCharacters = function (s) {
+    if (!s) { return []; }
+    s = String(s);
+    return s.split('');
+};
 
-    rgbAdjust: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {r: 0, g: 0, b: 0, a: 0});
-        var i, n = width * height * 4,
-            r, g, b, a,
-            ar = clamp(options.r, -1, 1) * 255,
-            ag = clamp(options.g, -1, 1) * 255,
-            ab = clamp(options.b, -1, 1) * 255,
-            aa = clamp(options.a, -1, 1) * 255;
+g.toLowerCase = function (s) {
+    s = String(s);
+    return s.toLowerCase();
+};
 
-        for (i = 0; i < n; i += 4) {
-            r = inData[i] + ar;
-            g = inData[i + 1] + ag;
-            b = inData[i + 2] + ab;
-            a = inData[i + 3] + aa;
-            if (r < 0) {
-                r = 0;
-            }
-            if (g < 0) {
-                g = 0;
-            }
-            if (b < 0) {
-                b = 0;
-            }
-            if (a < 0) {
-                a = 0;
-            }
-            if (r > 255) {
-                r = 255;
-            }
-            if (g > 255) {
-                g = 255;
-            }
-            if (b > 255) {
-                b = 255;
-            }
-            if (a > 255) {
-                a = 255;
-            }
-            outData[i] = r;
-            outData[i + 1] = g;
-            outData[i + 2] = b;
-            outData[i + 3] = a;
+g.toTitleCase = function (s) {
+    var c, result = '';
+    s = String(s);
+    for (var i = 0; i < s.length; i += 1) {
+        c = s[i];
+        if (result.length === 0 || result[result.length - 1] === ' ') {
+            result += c.toUpperCase();
+        } else {
+            result += c;
         }
-    },
+    }
+    return result;
+};
 
-    colorfilter: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {luminosity: false, r: 1, g: 0.5, b: 0});
-        var i, n = width * height * 4,
-            r, g, b,
-            luminosity = !!options.luminosity,
-            min, max, h, l, h1, chroma, tmp, m,
-            ar = clamp(options.r, 0, 1),
-            ag = clamp(options.g, 0, 1),
-            ab = clamp(options.b, 0, 1);
+g.toUpperCase = function (s) {
+    s = String(s);
+    return s.toUpperCase();
+};
 
-        for (i = 0; i < n; i += 4) {
-            r = inData[i] / 255;
-            g = inData[i + 1] / 255;
-            b = inData[i + 2] / 255;
+g.wordCount = function (s) {
+    if (!s) { return 0; }
+    s = String(s);
+    var split = s.split(new RegExp('\\w+'));
+    return split.length - 1;
+};
 
-            l = r * 0.3 + g * 0.59 + b * 0.11;
+g.toWords = function (s) {
+    var l = s.split(/\W+/);
+    if (l[l.length - 1] === '') {
+        l.pop();
+    }
+    return l;
+};
 
-            r = (r + r * ar) / 2;
-            g = (g + g * ag) / 2;
-            b = (b + b * ab) / 2;
 
-            if (luminosity) {
-                min = max = r;
-                if (g > max) {
-                    max = g;
-                }
-                if (b > max) {
-                    max = b;
-                }
-                if (g < min) {
-                    min = g;
-                }
-                if (b < min) {
-                    min = b;
-                }
-                chroma = (max - min);
+module.exports = g;
 
-                if (r === max) {
-                    h = ((g - b) / chroma) % 6;
-                } else if (g === max) {
-                    h = ((b - r) / chroma) + 2;
-                } else {
-                    h = ((r - g) / chroma) + 4;
-                }
+},{}],23:[function(require,module,exports){
+'use strict';
 
-                h1 = h >> 0;
-                tmp = chroma * (h - h1);
-                r = g = b = l - (r * 0.3 + g * 0.59 + b * 0.11);
+var randomGenerator = function (seed) {
+    // Note: the generator didn't work with negative seed values, so here we
+    // transform our original seed into a new (positive) seed value with which we
+    // create a new generator.
+    if (seed < 0) {
+        var gen = randomGenerator(Math.abs(seed));
+        for (var i = 0; i < 23; i += 1) {
+            gen();
+        }
+        return randomGenerator(gen(0, 10000));
+    }
 
-                if (h1 === 0) {
-                    r += chroma;
-                    g += tmp;
-                } else if (h1 === 1) {
-                    r += chroma - tmp;
-                    g += chroma;
-                } else if (h1 === 2) {
-                    g += chroma;
-                    b += tmp;
-                } else if (h1 === 3) {
-                    g += chroma - tmp;
-                    b += chroma;
-                } else if (h1 === 4) {
-                    r += tmp;
-                    b += chroma;
-                } else if (h1 === 5) {
-                    r += chroma;
-                    b += chroma - tmp;
-                }
-            }
+    // Based on random number generator from
+    // http://indiegamr.com/generate-repeatable-random-numbers-in-js/
+    return function (min, max) {
+        min = min || 0;
+        max = max || 1;
+        seed = (seed * 9301 + 49297) % 233280;
+        var v = seed / 233280;
+        return min + v * (max - min);
+    };
+};
 
-            outData[i] = r * 255;
-            outData[i + 1] = g * 255;
-            outData[i + 2] = b * 255;
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+exports.randomGenerator = randomGenerator;
+},{}],24:[function(require,module,exports){
+// Draw objects to the canvas
 
-    hslAdjust: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {h: 0.5, s: 0.3, l: 0.1, a: 0});
-        var i, n = width * height * 4,
-            r, g, b, a,
-            hue = clamp(options.h, -1, 1),
-            saturation = clamp(options.s, -1, 1),
-            lightness = clamp(options.l, -1, 1),
-            aa = clamp(options.a, -1, 1) * 255,
-            satMul = 1 + saturation * (saturation < 0 ? 1 : 2),
-            lightMul = lightness < 0 ? 1 + lightness : 1 - lightness,
-            lightAdd = lightness < 0 ? 0 : lightness * 255,
-            vs, ms, vm, h, s, l, v, m, vmh, sextant;
+'use strict';
 
-        hue = (hue * 6) % 6;
+var Color = require('../objects/color');
 
-        for (i = 0; i < n; i += 4) {
+var vg = {};
 
-            r = inData[i];
-            g = inData[i + 1];
-            b = inData[i + 2];
-            a = inData[i + 3] + aa;
+// Return true if an object can be drawn using the `g.draw` function.
+vg.isDrawable = function (o) {
+    if (Array.isArray(o)) {
+        o = o[0];
+    }
+    if (!o) {
+        return false;
+    } else if (typeof o.draw === 'function') {
+        return true;
+    } else if (o.x !== undefined && o.y !== undefined) {
+        return true;
+    } else if (o.r !== undefined && o.g !== undefined && o.b !== undefined) {
+        return true;
+    } else {
+        return false;
+    }
+};
 
-            if (hue !== 0 || saturation !== 0) {
-                // ok, here comes rgb to hsl + adjust + hsl to rgb, all in one jumbled mess.
-                // It's not so pretty, but it's been optimized to get somewhat decent performance.
-                // The transforms were originally adapted from the ones found in Graphics Gems, but have been heavily modified.
-                vs = r;
-                if (g > vs) {
-                    vs = g;
-                }
-                if (b > vs) {
-                    vs = b;
-                }
-                ms = r;
-                if (g < ms) {
-                    ms = g;
-                }
-                if (b < ms) {
-                    ms = b;
-                }
-                vm = vs - ms;
-                l = (ms + vs) / 510;
+vg.drawPoints = function (ctx, points) {
+    var pt, i;
+    ctx.fillStyle = 'blue';
+    ctx.beginPath();
+    for (i = 0; i < points.length; i += 1) {
+        pt = points[i];
+        ctx.moveTo(pt.x, pt.y);
+        ctx.arc(pt.x, pt.y, 2, 0, Math.PI * 2, false);
+    }
+    ctx.fill();
+};
 
-                if (l > 0 && vm > 0) {
-                    if (l <= 0.5) {
-                        s = vm / (vs + ms) * satMul;
-                        if (s > 1) {
-                            s = 1;
-                        }
-                        v = (l * (1 + s));
-                    } else {
-                        s = vm / (510 - vs - ms) * satMul;
-                        if (s > 1) {
-                            s = 1;
-                        }
-                        v = (l + s - l * s);
-                    }
-                    if (r === vs) {
-                        if (g === ms) {
-                            h = 5 + ((vs - b) / vm) + hue;
-                        } else {
-                            h = 1 - ((vs - g) / vm) + hue;
-                        }
-                    } else if (g === vs) {
-                        if (b === ms) {
-                            h = 1 + ((vs - r) / vm) + hue;
-                        } else {
-                            h = 3 - ((vs - b) / vm) + hue;
-                        }
-                    } else {
-                        if (r === ms) {
-                            h = 3 + ((vs - g) / vm) + hue;
-                        } else {
-                            h = 5 - ((vs - r) / vm) + hue;
-                        }
-                    }
-                    if (h < 0) {
-                        h += 6;
-                    }
-                    if (h >= 6) {
-                        h -= 6;
-                    }
-                    m = (l + l - v);
-                    sextant = h >> 0;
-                    vmh = (v - m) * (h - sextant);
-                    if (sextant === 0) {
-                        r = v;
-                        g = m + vmh;
-                        b = m;
-                    } else if (sextant === 1) {
-                        r = v - vmh;
-                        g = v;
-                        b = m;
-                    } else if (sextant === 2) {
-                        r = m;
-                        g = v;
-                        b = m + vmh;
-                    } else if (sextant === 3) {
-                        r = m;
-                        g = v - vmh;
-                        b = v;
-                    } else if (sextant === 4) {
-                        r = m + vmh;
-                        g = m;
-                        b = v;
-                    } else if (sextant === 5) {
-                        r = v;
-                        g = m;
-                        b = v - vmh;
-                    }
+vg.drawColoredPoints = function (ctx, points) {
+    for (var i = 0, n = points.length; i < n; i += 1) {
+        var pt = points[i];
+        ctx.fillStyle = Color.toCSS(pt);
+        ctx.fillRect(pt.x - 2, pt.y - 2, 4, 4);
+    }
+};
 
-                    r *= 255;
-                    g *= 255;
-                    b *= 255;
+vg.drawRectangles = function (ctx, rectangles) {
+    var i, r;
+    ctx.save();
+    for (i = 0; i < rectangles.length; i += 1) {
+        r = rectangles[i];
+        ctx.strokeStyle = 'black';
+        ctx.strokeWidth = 1;
+        ctx.rect(r.x, r.y, r.width, r.height);
+        ctx.stroke();
+    }
+    ctx.restore();
+};
+
+vg.drawColors = function (ctx, colors) {
+    var i, c;
+    ctx.save();
+    for (i = 0; i < colors.length; i += 1) {
+        c = colors[i];
+        ctx.fillStyle = Color.toCSS(c);
+        ctx.fillRect(0, 0, 30, 30);
+        ctx.translate(30, 0);
+    }
+    ctx.restore();
+};
+
+vg.draw = function (ctx, o) {
+    var k = o;
+    var isArray = false;
+    if (Array.isArray(o)) {
+        k = o[0];
+        isArray = true;
+    }
+
+    if (k) {
+        if (typeof k.draw === 'function') {
+            if (isArray) {
+                for (var i = 0, n = o.length; i < n; i += 1) {
+                    vg.draw(ctx, o[i]);
                 }
+            } else {
+                o.draw(ctx);
+            }
+        } else if (k.x !== undefined && k.y !== undefined) {
+            if (k.r !== undefined && k.g !== undefined && k.b !== undefined) {
+                vg.drawColoredPoints(ctx, isArray ? o : [o]);
+            } else if (k.width !== undefined && k.height !== undefined) {
+                vg.drawRectangles(ctx, isArray ? o : [o]);
+            } else {
+                vg.drawPoints(ctx, isArray ? o : [o]);
             }
+        } else if (k.r !== undefined && k.g !== undefined && k.b !== undefined) {
+            vg.drawColors(ctx, isArray ? o : [o]);
+        }
+    }
+};
 
-            r = r * lightMul + lightAdd;
-            g = g * lightMul + lightAdd;
-            b = b * lightMul + lightAdd;
+vg.toSVG = function (o, options) {
+    options = options || {};
+    var includeHeader = options.header === true;
+    var x = options.x !== undefined ? options.x : 0;
+    var y = options.y !== undefined ? options.y : 0;
+    var width = options.width !== undefined ? options.width : 500;
+    var height = options.height !== undefined ? options.height : 500;
+    var svg = '';
+    if (o) {
+        if (typeof o.toSVG === 'function') {
+            svg = o.toSVG();
+        } else if (Array.isArray(o)) {
+            svg = '<g>\n';
+            for (var i = 0, n = o.length; i < n; i += 1) {
+                svg += vg.toSVG(o[i]) + '\n';
+            }
+            svg += '</g>\n';
+        }
+    }
+    if (includeHeader) {
+        svg = '<?xml version="1.0" encoding="utf-8"?>' +
+            '<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" ' +
+            'x="' + x + '" y="' + y + '" width="' + width + 'px" height="' + height + 'px"' +
+            ' viewBox="' + x + ' ' + y + ' ' + width + ' ' + height + '">\n' +
+            svg +
+            '</svg>\n';
+    }
+    return svg;
+};
 
-            if (r < 0) { r = 0; }
-            if (g < 0) { g = 0; }
-            if (b < 0) { b = 0; }
-            if (a < 0) { a = 0; }
-            if (r > 255) { r = 255; }
-            if (g > 255) { g = 255; }
-            if (b > 255) { b = 255; }
-            if (a > 255) { a = 255; }
+module.exports = vg;
 
-            outData[i] = r;
-            outData[i + 1] = g;
-            outData[i + 2] = b;
-            outData[i + 3] = a;
-        }
-    },
+},{"../objects/color":27}],25:[function(require,module,exports){
+// Object creation / manipulation commands
 
-    posterize: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {levels: 5});
-        var i, n = width * height * 4,
-            r, g, b,
-            numLevels = clamp(options.levels, 2, 256),
-            numAreas = 256 / numLevels,
-            numValues = 256 / (numLevels - 1);
+'use strict';
 
-        for (i = 0; i < n; i += 4) {
-            outData[i] = numValues * ((inData[i] / numAreas) >> 0);
-            outData[i + 1] = numValues * ((inData[i + 1] / numAreas) >> 0);
-            outData[i + 2] = numValues * ((inData[i + 2] / numAreas) >> 0);
-            outData[i + 3] = inData[i + 3];
-        }
-    },
+var _ = require('lodash');
+var ClipperLib = require('../../../../third_party/clipper');
+var bezier = require('../util/bezier');
+var geo = require('../util/geo');
+var math = require('../util/math');
+var random = require('../util/random');
 
-    removenoise: function (inData, outData, width, height) {
-        var x, y, n = width * height * 4,
-            r, g, b, c, idx,
-            pyc, pyp, pyn,
-            pxc, pxp, pxn,
-            minR, minG, minB, maxR, maxG, maxB;
+var Color = require('../objects/color');
+var Group = require('../objects/group');
+var Path = require('../objects/path');
+var Point = require('../objects/point');
+var Rect = require('../objects/rect');
+var Transform = require('../objects/transform');
+var Transformable = require('../objects/transformable');
 
-        for (y = 0; y < height; y += 1) {
-            pyc = y * width * 4;
-            pyp = pyc - width * 4;
-            pyn = pyc + width * 4;
+function _cloneCommand(cmd) {
+    var newCmd = {type: cmd.type};
+    if (newCmd.type !== bezier.CLOSE) {
+        newCmd.x = cmd.x;
+        newCmd.y = cmd.y;
+    }
+    if (newCmd.type === bezier.QUADTO) {
+        newCmd.x1 = cmd.x1;
+        newCmd.y1 = cmd.y1;
+    } else if (newCmd.type === bezier.CURVETO) {
+        newCmd.x1 = cmd.x1;
+        newCmd.y1 = cmd.y1;
+        newCmd.x2 = cmd.x2;
+        newCmd.y2 = cmd.y2;
+    }
+    return newCmd;
+}
 
-            if (y < 1) {
-                pyp = pyc;
-            }
-            if (y >= width - 1) {
-                pyn = pyc;
+var vg = {};
+
+vg.HORIZONTAL = 'horizontal';
+vg.VERTICAL = 'vertical';
+
+vg.EAST = 'e';
+vg.WEST = 'w';
+vg.NORTH = 'n';
+vg.SOUTH = 's';
+
+vg.bounds = function (o) {
+    var r, i, n;
+    if (!o) {
+        return new Rect();
+    } else if (typeof o.bounds === 'function') {
+        return o.bounds();
+    } else if (o.x !== undefined && o.y !== undefined) {
+        if (o.width !== undefined && o.height !== undefined) {
+            return new Rect(o.x, o.y, o.width, o.height);
+        } else {
+            return new Rect(o.x, o.y, 0, 0);
+        }
+    } else if (o.r !== undefined && o.g !== undefined && o.b !== undefined) {
+        return new vg.Rect(0, 0, 30, 30);
+    } else if (Array.isArray(o)) {
+        r = null;
+        n = o.length;
+        // A color array is special since the colors have no inherent position.
+        if (n > 0 && o[0].r !== undefined && o[0].g !== undefined && o[0].b !== undefined) {
+            return new Rect(0, 0, o.length * 30, 30);
+        }
+        for (i = 0; i < n; i += 1) {
+            if (!r) {
+                r = vg.bounds(o[i]);
+            } else {
+                r = r.unite(vg.bounds(o[i]));
             }
+        }
+        return r || new Rect();
+    } else {
+        return new Rect();
+    }
+};
 
-            for (x = 0; x < width; x += 1) {
-                idx = (y * width + x) * 4;
+vg.makeCenteredRect = function (cx, cy, width, height) {
+    var x = cx - width / 2,
+        y = cy - height / 2;
+    return new Rect(x, y, width, height);
+};
 
-                pxc = x * 4;
-                pxp = pxc - 4;
-                pxn = pxc + 4;
+vg.makePoint = function (x, y) {
+    return new Point(x, y);
+};
 
-                if (x < 1) {
-                    pxp = pxc;
-                }
-                if (x >= width - 1) {
-                    pxn = pxc;
-                }
+vg.makeRect = function (x, y, width, height) {
+    return new Rect(x, y, width, height);
+};
 
-                minR = maxR = inData[pyc + pxp];
-                c = inData[pyc + pxn];
-                if (c < minR) {
-                    minR = c;
-                }
-                if (c > maxR) {
-                    maxR = c;
-                }
-                c = inData[pyp + pxc];
-                if (c < minR) {
-                    minR = c;
-                }
-                if (c > maxR) {
-                    maxR = c;
-                }
-                c = inData[pyn + pxc];
-                if (c < minR) {
-                    minR = c;
-                }
-                if (c > maxR) {
-                    maxR = c;
-                }
+// Combine all given shape arguments into a new group.
+// This function works like makeGroup, except that this can take any number
+// of arguments.
+vg.merge = function () {
+    return new Group(_.reject(_.flatten(arguments, true), _.isEmpty));
+};
 
-                minG = inData[pyc + pxp + 1];
-                c = inData[pyc + pxn + 1];
-                if (c < minG) {
-                    minG = c;
-                }
-                c = inData[pyp + pxc + 1];
-                if (c < minG) {
-                    minG = c;
-                }
-                c = inData[pyn + pxc + 1];
-                if (c < minG) {
-                    minG = c;
-                }
+vg.combinePaths = function (shape) {
+    return Path.combine(shape);
+};
 
-                minB = inData[pyc + pxp + 2];
-                c = inData[pyc + pxn + 2];
-                if (c < minB) {
-                    minB = c;
-                }
-                c = inData[pyp + pxc + 2];
-                if (c < minB) {
-                    minB = c;
-                }
-                c = inData[pyn + pxc + 2];
-                if (c < minB) {
-                    minB = c;
-                }
+vg.shapePoints = vg.toPoints = function (shape) {
+    if (!shape) {
+        return [];
+    }
+    if (shape.commands) {
+        return _.map(_.filter(shape.commands, function (cmd) { if (cmd.x !== undefined) { return true; } return false; }), function (cmd) { return new Point(cmd.x, cmd.y); });
+    }
+    var i, points = [];
+    for (i = 0; i < shape.shapes.length; i += 1) {
+        points = points.concat(vg.shapePoints(shape.shapes[i]));
+    }
+    return points;
+};
 
-                r = inData[idx];
-                g = inData[idx + 1];
-                b = inData[idx + 2];
+// FILTERS //////////////////////////////////////////////////////////////
 
-                if (r < minR) {
-                    r = minR;
-                }
-                if (r > maxR) {
-                    r = maxR;
-                }
-                if (g < minG) {
-                    g = minG;
-                }
-                if (g > maxG) {
-                    g = maxG;
-                }
-                if (b < minB) {
-                    b = minB;
-                }
-                if (b > maxB) {
-                    b = maxB;
-                }
+vg.colorize = function (shape, fill, stroke, strokeWidth) {
+    if (!shape) {
+        return;
+    }
+    return shape.colorize(fill, stroke, strokeWidth);
+};
 
-                outData[idx] = r;
-                outData[idx + 1] = g;
-                outData[idx + 2] = b;
-                outData[idx + 3] = inData[idx + 3];
-            }
-        }
-    },
+vg.translate = function (shape, position) {
+    if (shape.translate) {
+        return shape.translate(position);
+    }
+    return Transformable.translate.apply(shape, [position]);
+};
 
-    mosaic: function (inData, outData, width, height, options) {
-        options = defaultOptions(options, {blockSize: 8});
-        var blockSize = clamp(options.blockSize, 1, Math.max(width, height)),
-            yBlocks = Math.ceil(height / blockSize),
-            xBlocks = Math.ceil(width / blockSize),
-            y0, y1, x0, x1, idx, pidx,
-            i, j, bidx, r, g, b, bi, bj,
-            n = yBlocks * xBlocks,
-            prog, lastProg = 0;
+vg.scale = function (shape, scale, origin) {
+    if (shape.scale) {
+        return shape.scale(scale, origin);
+    }
+    return Transformable.scale.apply(shape, [scale, origin]);
+};
 
-        y0 = 0;
-        bidx = 0;
-        for (i = 0; i < yBlocks; i += 1) {
-            y1 = clamp(y0 + blockSize, 0, height);
-            x0 = 0;
-            for(j = 0; j < xBlocks; j += 1) {
-                x1 = clamp(x0 + blockSize, 0, width);
+vg.rotate = function (shape, angle, origin) {
+    if (shape.rotate) {
+        return shape.rotate(angle, origin);
+    }
+    return Transformable.rotate.apply(shape, [angle, origin]);
+};
 
-                idx = (y0 * width + x0) << 2;
-                r = inData[idx];
-                g = inData[idx + 1];
-                b = inData[idx + 2];
+vg.skew = function (shape, skew, origin) {
+    if (shape.skew) {
+        return shape.skew(skew, origin);
+    }
+    return Transformable.skew.apply(shape, [skew, origin]);
+};
 
-                for(bi = y0; bi < y1; bi += 1) {
-                   for(bj = x0; bj < x1; bj += 1) {
-                       pidx = (bi * width + bj) << 2;
-                       outData[pidx] = r;
-                       outData[pidx + 1] = g;
-                       outData[pidx + 2] = b;
-                       outData[pidx + 3] = inData[pidx + 3];
-                   }
-                }
-                x0 = x1;
-                bidx += 1;
+vg.copy = function (shape, copies, order, translate, rotate, scale) {
+    var i, t, j, op,
+        shapes = [],
+        tx = 0,
+        ty = 0,
+        r = 0,
+        sx = 1.0,
+        sy = 1.0;
+    for (i = 0; i < copies; i += 1) {
+        t = new Transform();
+        for (j = 0; j < order.length; j += 1) {
+            op = order[j];
+            if (op === 't') {
+                t = t.translate(tx, ty);
+            } else if (op === 'r') {
+                t = t.rotate(r);
+            } else if (op === 's') {
+                t = t.scale(sx, sy);
             }
-            y0 = y1;
         }
-    },
-
-    equalize : function(inData, outData, width, height, options) {
-        var n = width * height, p, i, level, ratio,
-            prog, lastProg;
-        var round = Math.round;
-        // build histogram
-        var pdf = new Array(256);
-        for (i = 0; i < 256; i += 1) {
-            pdf[i] = 0;
+        if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
+            shapes = shapes.concat(t.transformShape(shape));
+        } else {
+            shapes.push(t.transformShape(shape));
         }
 
-        for (i = 0; i < n; i += 1) {
-            p = i * 4;
-            level = clamp(round(inData[p] * 0.3 + inData[p + 1] * 0.59 + inData[p + 2] * 0.11), 0, 255);
-            outData[p + 3] = level;
-            pdf[level] += 1;
-        }
+        tx += translate.x;
+        ty += translate.y;
+        r += rotate;
+        sx += scale.x;
+        sy += scale.y;
+    }
+    return shapes;
+};
 
-        // build cdf
-        var cdf = new Array(256);
-        cdf[0] = pdf[0];
-        for(i = 1; i < 256; i += 1) {
-            cdf[i] = cdf[i - 1] + pdf[i];
-        }
+vg.fit = function (shape, position, width, height, stretch) {
+    if (!shape) {
+        return;
+    }
+    stretch = stretch !== undefined ? stretch : false;
+    var t, sx, sy,
+        bounds = vg.bounds(shape),
+        bx = bounds.x,
+        by = bounds.y,
+        bw = bounds.width,
+        bh = bounds.height;
 
-        // normalize cdf
-        for(i = 0; i < 256; i += 1) {
-            cdf[i] = cdf[i] / n * 255.0;
-        }
+    // Make sure bw and bh aren't infinitely small numbers.
+    // This will lead to incorrect transformations with for examples lines.
+    bw = (bw > 0.000000000001) ? bw : 0;
+    bh = (bh > 0.000000000001) ? bh : 0;
 
-        // map the pixel values
-        for (i = 0; i < n; i += 1) {
-            p = i * 4;
-            level = outData[p + 3];
-            ratio = cdf[level] / (level || 1);
-            outData[p] = clamp(round(inData[p] * ratio), 0, 255);
-            outData[p + 1] = clamp(round(inData[p + 1] * ratio), 0, 255);
-            outData[p + 2] = clamp(round(inData[p + 2] * ratio), 0, 255);
-            outData[p + 3] = inData[p + 3];
-        }
-    },
+    t = new Transform();
+    t = t.translate(position.x, position.y);
 
-    mask: function (inData, outData, width, height, options) {
-        var i, n = width * height * 4,
-            data = options.data;
+    if (!stretch) {
+        // don't scale widths or heights that are equal to zero.
+        sx = (bw > 0) ? (width / bw) : Number.MAX_VALUE;
+        sy = (bh > 0) ? (height / bh) : Number.MAX_VALUE;
+        sx = sy = Math.min(sx, sy);
+    } else {
+        sx = (bw > 0) ? (width / bw) : 1;
+        sy = (bh > 0) ? (height / bh) : 1;
+    }
 
-        // todo: consider the masking image's dimensions and position.
+    t = t.scale(sx, sy);
+    t = t.translate(-bw / 2 - bx, -bh / 2 - by);
 
-        for (i = 0; i < n; i += 4) {
-            outData[i] = inData[i];
-            outData[i + 1] = inData[i + 1];
-            outData[i + 2] = inData[i + 2];
-            outData[i + 3] = inData[i + 3] * data[i] / 255 * data[i + 3] / 255;
-        }
-    },
+    return t.transformShape(shape);
+};
 
-    // Distortion filters
+// Fit the given shape to the bounding shape.
+// If stretch = true, proportions will be distorted.
+vg.fitTo = function (shape, bounding, stretch) {
+    if (!shape) {
+        return;
+    }
+    if (!bounding) {
+        return;
+    }
 
-    bump: function (inData, outData, width, height, options) {
-        /* options:
-         *  - dx: horizontal offset (in pixels) of the effect.
-         *  - dy: vertical offset (in pixels) of the effect.
-         *  - radius: the radius of the effect in pixels.
-         *  - zoom: the amount of bulge (0.0-1.0).
-         */
-        options = defaultOptions(options, {dx: 0, dy: 0, radius: 0, zoom: 0});
-        var m1 = options.radius;
-        var m2 = clamp(options.zoom, 0, 1);
-        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
-            return [d * smoothstep(0, m2, d / m1), a];
-        });
-    },
+    var bounds = vg.bounds(bounding),
+        bx = bounds.x,
+        by = bounds.y,
+        bw = bounds.width,
+        bh = bounds.height;
 
-    dent: function (inData, outData, width, height, options) {
-        /* options:
-         *  - dx: horizontal offset (in pixels) of the effect.
-         *  - dy: vertical offset (in pixels) of the effect.
-         *  - radius: the radius of the effect in pixels.
-         *  - zoom: the amount of pinch (0.0-1.0).
-         */
-        options = defaultOptions(options, {dx: 0, dy: 0, radius: 0, zoom: 0});
-        var m1 = options.radius;
-        var m2 = clamp(options.zoom, 0, 1);
-        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
-            return [2 * d - d * smoothstep(0, m2, d / m1), a];
-        });
-    },
+    return vg.fit(shape, {x: bx + bw / 2, y: by + bh / 2}, bw, bh, stretch);
+};
 
-    pinch: function (inData, outData, width, height, options) {
-        /* options:
-         *  - dx: horizontal offset (in pixels) of the effect.
-         *  - dy: vertical offset (in pixels) of the effect.
-         *  - zoom: the amount of bulge or pinch (-1.0-1.0):
-         */
-        options = defaultOptions(options, {dx: 0, dy: 0, zoom: 0});
-        var m1 = util.distance(0, 0, width, height);
-        var m2 = clamp(options.zoom * 0.75, -0.75, 0.75);
-        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
-            return [d * Math.pow(m1 / d, m2) * (1 - m2), a];
-        });
-    },
+vg.mirror = function (shape, angle, origin, keepOriginal) {
+    if (!shape) {
+        return;
+    }
+    origin = origin || new Point();
+    if (angle !== 0) {
+        angle = angle || 90;
+    }
 
-    splash: function (inData, outData, width, height, options) {
-        /* options:
-         *  - dx: horizontal offset (in pixels) of the effect.
-         *  - dy: vertical offset (in pixels) of the effect.
-         *  - radius: the radius of the unaffected area in pixels.
-         */
-        options = defaultOptions(options, {dx: 0, dy: 0, radius: 0});
-        var m = options.radius;
-        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
-            return [(d > m)? m : d, a];
+    var f = function (x, y) {
+        var d = geo.distance(x, y, origin.x, origin.y),
+            a = geo.angle(x, y, origin.x, origin.y),
+            pt = geo.coordinates(origin.x, origin.y, 180 + angle, d * Math.cos(math.radians(a - angle)));
+        d = geo.distance(x, y, pt.x, pt.y);
+        a = geo.angle(x, y, pt.x, pt.y);
+        pt = geo.coordinates(x, y, a, d * 2);
+        return new Point(pt.x, pt.y);
+    };
+
+    var mirrorPath, mirrorPoints, mirrorGroup, mirror;
+
+    mirrorPath = function (path) {
+        var pt, ctrl1, ctrl2;
+        var p = new Path([], path.fill, path.stroke, path.strokeWidth);
+        for (var i = 0; i < path.commands.length; i += 1) {
+            var cmd = path.commands[i];
+            if (cmd.type === bezier.MOVETO) {
+                pt = f(cmd.x, cmd.y);
+                p.moveTo(pt.x, pt.y);
+            } else if (cmd.type === bezier.LINETO) {
+                pt = f(cmd.x, cmd.y);
+                p.lineTo(pt.x, pt.y);
+            } else if (cmd.type === bezier.CURVETO) {
+                pt = f(cmd.x, cmd.y);
+                ctrl1 = f(cmd.x1, cmd.y1);
+                ctrl2 = f(cmd.x2, cmd.y2);
+                p.curveTo(ctrl1.x, ctrl1.y, ctrl2.x, ctrl2.y, pt.x, pt.y);
+            } else if (cmd.type === bezier.CLOSE) {
+                p.close();
+            } else {
+                throw new Error('Unknown command ' + cmd);
+            }
+        }
+        return p;
+    };
+
+    mirrorPoints = function (points) {
+        return _.map(points, function (point) {
+            return f(point.x, point.y);
         });
-    },
+    };
 
-    twirl: function (inData, outData, width, height, options) {
-        /* options:
-         *  - dx: horizontal offset (in pixels) of the effect.
-         *  - dy: vertical offset (in pixels) of the effect.
-         *  - radius: the radius of the effect in pixels.
-         *  - angle: the amount of rotation in degrees.
-         */
-        options = defaultOptions(options, {dx: 0, dy: 0, radius: 0, angle: 0});
-        var m1 = util.radians(options.angle);
-        var m2 = options.radius;
-        return polar(inData, outData, options.dx, options.dy, width, height, function (d, a) {
-            return [d, a + (1 - smoothstep(-m2, m2, d)) * m1];
+    mirrorGroup = function (group) {
+        var shapes = _.map(group.shapes, function (shape) {
+            return mirror(shape);
         });
+        return new Group(shapes);
+    };
+
+    mirror = function (shape) {
+        if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
+            return mirrorPoints(shape);
+        }
+        var fn = (shape.shapes) ? mirrorGroup : mirrorPath;
+        return fn(shape);
+    };
+
+    var newShape = mirror(shape);
+
+    if (keepOriginal) {
+        if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
+            return shape.concat(newShape);
+        }
+        return new Group([shape, newShape]);
+    } else {
+        return newShape;
     }
 };
 
+vg.pathLength = function (shape, options) {
+    var precision = 20;
+    if (options && options.precision) {
+        precision = options.precision;
+    }
+    return shape.length(precision);
+};
 
-// MODULE SUPPORT ///////////////////////////////////////////////////////
+vg.resampleByLength = function (shape, maxLength) {
+    if (!shape) { return; }
+    return shape.resampleByLength(maxLength);
+};
 
-module.exports = process;
+vg.resampleByAmount = function (shape, amount, perContour) {
+    if (!shape) { return; }
+    return shape.resampleByAmount(amount, perContour);
+};
 
-},{"./util":20,"stackblur":5}],20:[function(require,module,exports){
-'use strict';
+vg.wigglePoints = function (shape, offset, seed) {
+    seed = seed !== undefined ? seed : Math.random();
+    var rand = random.generator(seed);
+    if (offset === undefined) {
+        offset = {x: 10, y: 10};
+    } else if (typeof offset === 'number') {
+        offset = {x: offset, y: offset};
+    }
+    var wigglePoints = function (shape) {
+        var i, dx, dy;
+        if (shape.commands) {
+            var p = new Path([], shape.fill, shape.stroke, shape.strokeWidth);
+            for (i = 0; i < shape.commands.length; i += 1) {
+                dx = (rand(0, 1) - 0.5) * offset.x * 2;
+                dy = (rand(0, 1) - 0.5) * offset.y * 2;
+                var cmd = shape.commands[i];
+                if (cmd.type === bezier.MOVETO) {
+                    p.moveTo(cmd.x + dx, cmd.y + dy);
+                } else if (cmd.type === bezier.LINETO) {
+                    p.lineTo(cmd.x + dx, cmd.y + dy);
+                } else if (cmd.type === bezier.CURVETO) {
+                    p.curveTo(cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x + dx, cmd.y + dy);
+                } else if (cmd.type === bezier.CLOSE) {
+                    p.close();
+                }
+            }
+            return p;
+        } else if (shape.shapes) {
+            return new Group(_.map(shape.shapes, wigglePoints));
+        } else if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined){
+            var points = [];
+            for (i = 0; i < shape.length; i += 1) {
+                dx = (rand(0, 1) - 0.5) * offset.x * 2;
+                dy = (rand(0, 1) - 0.5) * offset.y * 2;
+                points.push(new Point(shape[i].x + dx, shape[i].y + dy));
+            }
+            return points;
+        } else {
+            return _.map(shape, wigglePoints);
+        }
+    };
+    return wigglePoints(shape);
+};
 
-// UTILITIES.
+vg.wiggleContours = function (shape, offset, seed) {
+    seed = seed !== undefined ? seed : Math.random();
+    var rand = random.generator(seed);
+    if (offset === undefined) {
+        offset = {x: 10, y: 10};
+    } else if (typeof offset === 'number') {
+        offset = {x: offset, y: offset};
+    }
+    var wiggleContours = function (shape) {
+        if (shape.commands) {
+            var i, dx, dy, t,
+                subPaths = shape.contours(),
+                commands = [];
+            for (i = 0; i < subPaths.length; i += 1) {
+                dx = (rand(0, 1) - 0.5) * offset.x * 2;
+                dy = (rand(0, 1) - 0.5) * offset.y * 2;
+                t = new Transform().translate(dx, dy);
+                commands = commands.concat(t.transformShape(new Path(subPaths[i])).commands);
+            }
+            return new Path(commands, shape.fill, shape.stroke, shape.strokeWidth);
+        } else if (shape.shapes) {
+            return new Group(_.map(shape.shapes, wiggleContours));
+        } else {
+            return _.map(shape, wiggleContours);
+        }
+    };
+    return wiggleContours(shape);
+};
 
-function degrees(radians) {
-    return radians * 180 / Math.PI;
-}
+vg.wigglePaths = function (shape, offset, seed) {
+    seed = seed !== undefined ? seed : Math.random();
+    var rand = random.generator(seed);
+    if (offset === undefined) {
+        offset = {x: 10, y: 10};
+    } else if (typeof offset === 'number') {
+        offset = {x: offset, y: offset};
+    }
 
-function radians(degrees) {
-    return degrees / 180 * Math.PI;
-}
+    var wigglePaths = function (shape) {
+        if (shape.commands) {
+            return shape;
+        } else if (shape.shapes) {
+            return new Group(wigglePaths(shape.shapes));
+        } else if (Array.isArray(shape)) {
+            var subShape, dx, dy, t, newShapes = [];
+            for (var i = 0; i < shape.length; i += 1) {
+                subShape = shape[i];
+                if (subShape.commands) {
+                    dx = (rand(0, 1) - 0.5) * offset.x * 2;
+                    dy = (rand(0, 1) - 0.5) * offset.y * 2;
+                    t = new Transform().translate(dx, dy);
+                    newShapes.push(t.transformShape(subShape));
+                } else if (subShape.shapes) {
+                    newShapes.push(wigglePaths(subShape));
+                }
+            }
+            return newShapes;
+        }
+    };
 
-function distance(x0, y0, x1, y1) {
-    return Math.sqrt(Math.pow(x1 - x0, 2) + Math.pow(y1 - y0, 2));
-}
+    return wigglePaths(shape);
+};
 
-function clamp(val, min, max) {
-    return Math.min(max, Math.max(min, val));
-}
+vg.scatterPoints = function (shape, amount, seed) {
+    // Generate points within the boundaries of a shape.
+    if (!shape) {
+        return;
+    }
+    seed = seed !== undefined ? seed : Math.random();
+    var i, j, tries, x, y,
+        rand = random.generator(seed),
+        bounds = shape.bounds(),
+        bx = bounds.x,
+        by = bounds.y,
+        bw = bounds.width,
+        bh = bounds.height,
+        contours = shape.contours(),
+        paths = [],
+        points = [];
 
-// Basic affine transform functionality.
-function transform(m) {
-    // Identity matrix.
-    if (m === undefined) {
-        m = [1, 0, 0, 0, 1, 0, 0, 0, 1];
+    for (i = 0; i < contours.length; i++) {
+        var contourPath = new Path(contours[i]);
+        var nrKeypoints = contourPath.commands.length;
+        var POINTS_PER_SEGMENT = 5;
+        paths.push(contourPath.points(nrKeypoints * POINTS_PER_SEGMENT, {closed: true } ));
+    }
+
+    for (i = 0; i < amount; i += 1) {
+        tries = 100;
+        while (tries > 0) {
+            var inContourCount = 0;
+            x = bx + rand(0, 1) * bw;
+            y = by + rand(0, 1) * bh;
+            for (j = 0; j < paths.length; j++) {
+                if (geo.pointInPolygon(paths[j], x, y)) {
+                    inContourCount += 1;
+                }
+            }
+            if (inContourCount % 2) {
+                points.push(new Point(x, y));
+                break;
+            }
+            tries -= 1;
+        }
+    }
+    return points;
+};
+
+vg.connectPoints = function (points, closed) {
+    if (!points) {
+        return;
+    }
+    var p = new Path();
+    for (var i = 0; i < points.length; i += 1) {
+        var pt = points[i];
+        if (i === 0) {
+            p.moveTo(pt.x, pt.y);
+        } else {
+            p.lineTo(pt.x, pt.y);
+        }
+    }
+    if (closed) {
+        p.close();
+    }
+    p.fill = null;
+    p.stroke = Color.BLACK;
+    return p;
+};
+
+vg.align = function (shape, position, hAlign, vAlign) {
+    if (!shape) {
+        return;
+    }
+    var dx, dy, t,
+        x = position.x,
+        y = position.y,
+        bounds = vg.bounds(shape);
+    if (hAlign === 'left') {
+        dx = x - bounds.x;
+    } else if (hAlign === 'right') {
+        dx = x - bounds.x - bounds.width;
+    } else if (hAlign === 'center') {
+        dx = x - bounds.x - bounds.width / 2;
     } else {
-        m = m.slice();
+        dx = 0;
     }
-
-    // Performs the 3x3 matrix multiplication of the current matrix with the input matrix a.
-    function _mmult(a, m) {
-        m = m.slice();
-
-        var m0 = m[0];
-        var m1 = m[1];
-        var m2 = m[2];
-        var m3 = m[3];
-        var m4 = m[4];
-        var m5 = m[5];
-        var m6 = m[6];
-        var m7 = m[7];
-        var m8 = m[8];
-
-        m[0] = a[0] * m0 + a[1] * m3;
-        m[1] = a[0] * m1 + a[1] * m4;
-        m[3] = a[3] * m0 + a[4] * m3;
-        m[4] = a[3] * m1 + a[4] * m4;
-        m[6] = a[6] * m0 + a[7] * m3 + m6;
-        m[7] = a[6] * m1 + a[7] * m4 + m7;
-
-        return transform(m);
+    if (vAlign === 'top') {
+        dy = y - bounds.y;
+    } else if (vAlign === 'bottom') {
+        dy = y - bounds.y - bounds.height;
+    } else if (vAlign === 'middle') {
+        dy = y - bounds.y - bounds.height / 2;
+    } else {
+        dy = 0;
     }
 
-    return {
-        matrix: function () {
-            return m.slice();
-        },
-
-        clone: function () {
-            return transform(m);
-        },
+    t = new Transform().translate(dx, dy);
+    return t.transformShape(shape);
+};
 
-        prepend: function (t) {
-            if (t.matrix) {
-                t = t.matrix();
-            }
-            return _mmult(m, t);
-        },
+// Snap geometry to a grid.
+vg.snap = function (shape, distance, strength, center) {
+    if (!shape) {
+        return;
+    }
+    strength = strength !== undefined ? strength : 1;
+    center = center || Point.ZERO;
 
-        append: function (t) {
-            if (t.matrix) {
-                t = t.matrix();
+    var snapShape = function (shape) {
+        if (shape.commands) {
+            var p = new Path([], shape.fill, shape.stroke, shape.strokeWidth);
+            for (var i = 0; i < shape.commands.length; i += 1) {
+                var cmd = shape.commands[i];
+                if (cmd.type === bezier.MOVETO || cmd.type === bezier.LINETO || cmd.type === bezier.CURVETO) {
+                    var x = math.snap(cmd.x + center.x, distance, strength) - center.x;
+                    var y = math.snap(cmd.y + center.y, distance, strength) - center.y;
+                    if (cmd.type === bezier.MOVETO) {
+                        p.moveTo(x, y);
+                    } else if (cmd.type === bezier.LINETO) {
+                        p.lineTo(x, y);
+                    } else if (cmd.type === bezier.CURVETO) {
+                        var x1 = math.snap(cmd.x1 + center.x, distance, strength) - center.x;
+                        var y1 = math.snap(cmd.y1 + center.y, distance, strength) - center.y;
+                        var x2 = math.snap(cmd.x2 + center.x, distance, strength) - center.x;
+                        var y2 = math.snap(cmd.y2 + center.y, distance, strength) - center.y;
+                        p.curveTo(x1, y1, x2, y2, x, y);
+                    }
+                } else if (cmd.type === bezier.CLOSE) {
+                    p.close();
+                } else {
+                    throw new Error('Invalid path command ' + cmd);
+                }
             }
-            return _mmult(t, m);
-        },
+            return p;
+        } else if (shape.shapes) {
+            return new Group(_.map(shape.shapes, snapShape));
+        } else if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
+            return _.map(shape, function (point) {
+                var x = math.snap(point.x + center.x, distance, strength) - center.x;
+                var y = math.snap(point.y + center.y, distance, strength) - center.y;
+                return new Point(x, y);
+            });
+        } else {
+            return _.map(shape, snapShape);
+        }
+    };
 
-        translate: function (x, y) {
-            return _mmult([1, 0, 0, 0, 1, 0, x, y, 1], m);
-        },
+    return snapShape(shape);
+};
 
-        scale: function (x, y) {
-            if (y === undefined) {
-                y = x;
+vg.deletePoints = function (shape, bounding, invert) {
+    var deletePoints = function (shape) {
+        var i, cmd, commands = [];
+        var pt, points = [];
+        if (shape.commands) {
+            var newCurve = true;
+            for (i = 0; i < shape.commands.length; i += 1) {
+                cmd = _cloneCommand(shape.commands[i]);
+                if (cmd.x === undefined ||
+                        (invert && bounding.contains(cmd.x, cmd.y)) ||
+                        (!invert && !bounding.contains(cmd.x, cmd.y))) {
+                    if (newCurve && cmd.type !== bezier.MOVETO) {
+                        cmd.type = bezier.MOVETO;
+                    }
+                    commands.push(cmd);
+                    if (cmd.type === bezier.MOVETO) {
+                        newCurve = false;
+                    } else if (cmd.type === bezier.CLOSE) {
+                        newCurve = true;
+                    }
+                }
             }
-            return _mmult([x, 0, 0, 0, y, 0, 0, 0, 1], m);
-        },
-
-        skew: function (x, y) {
-            if (y === undefined) {
-                y = x;
+            return new Path(commands, shape.fill, shape.stroke, shape.strokeWidth);
+        } else if (shape.shapes) {
+            return new Group(_.map(shape.shapes, deletePoints));
+        } else if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined){
+            for (i = 0; i < shape.length; i += 1) {
+                pt = shape[i];
+                if ((invert && bounding.contains(pt.x, pt.y)) ||
+                   (!invert && !bounding.contains(pt.x, pt.y))) {
+                    points.push(_cloneCommand(pt));
+                }
             }
-            var kx = Math.PI * x / 180.0;
-            var ky = Math.PI * y / 180.0;
-            return _mmult([1, Math.tan(ky), 0, -Math.tan(kx), 1, 0, 0, 0, 1], m);
-        },
+            return points;
+        } else {
+            return _.map(shape, deletePoints);
+        }
+    };
 
-        rotate: function (angle) {
-            var c = Math.cos(radians(angle));
-            var s = Math.sin(radians(angle));
-            return _mmult([c, s, 0, -s, c, 0, 0, 0, 1], m);
-        },
+    return deletePoints(shape);
+};
 
-        transformPoint: function (point) {
-            var x = point.x;
-            var y = point.y;
-            return {x: x * m[0] + y * m[3] + m[6],
-                y: x * m[1] + y * m[4] + m[7]};
+vg.deletePaths = function (shape, bounding, invert) {
+    var deletePaths = function (shape) {
+        if (shape.commands) {
+            return null;
+        } else if (shape.shapes) {
+            return new Group(deletePaths(shape.shapes));
+        } else if (Array.isArray(shape)) {
+            var j, s, selected, cmd, subShapes, newShapes = [];
+            var shapes = shape;
+            for (var i = 0; i < shapes.length; i += 1) {
+                s = shapes[i];
+                if (s.commands) {
+                    selected = false;
+                    for (j = 0; j < s.commands.length; j += 1) {
+                        cmd = s.commands[j];
+                        if (cmd.x !== undefined && bounding.contains(cmd.x, cmd.y)) {
+                            selected = true;
+                            break;
+                        }
+                    }
+                    if (!((invert && !selected) || (selected && !invert))) {
+                        newShapes.push(s);
+                    }
+                } else if (s.shapes) {
+                    subShapes = deletePaths(s);
+                    if (subShapes.length !== 0) {
+                        newShapes.push(subShapes);
+                    }
+                }
+            }
+            return newShapes;
         }
     };
-}
 
-module.exports = {
-    degrees: degrees,
-    radians: radians,
-    distance: distance,
-    clamp: clamp,
-    transform: transform
+    return deletePaths(shape);
 };
 
-},{}],21:[function(require,module,exports){
-'use strict';
+vg['delete'] = function (shape, bounding, scope, invert) {
+    if (shape === null || bounding === null) { return null; }
+    if (scope === 'points') { return vg.deletePoints(shape, bounding, invert); }
+    if (scope === 'paths') { return vg.deletePaths(shape, bounding, invert); }
+    throw new Error('Invalid scope.');
+};
 
-var deepEqual = require('./deepequal');
-var util = require('./util');
-var g = {};
+vg.pointOnPath = function (shape, t) {
+    if (!shape) {
+        return;
+    }
+    if (shape.shapes) {
+        shape = new Path(vg.combinePaths(shape));
+    }
+    t = t % 1;
+    if (t < 0) {
+        t = 1 + t;
+    }
+    var pt = shape.point(t);
+    return new Point(pt.x, pt.y);
+};
 
-g.combine = function () {
-    var i, l, result = [];
-    for (i = 0; i < arguments.length; i++) {
-        l = arguments[i];
-        if (l) {
-            result = result.concat(l);
+/*vg.shapeOnPath = function (shapes, path, amount, alignment, spacing, margin, baselineOffset) {
+    if (!shapes) { return []; }
+    if (path === null) { return []; }
+
+    if (alignment === 'trailing') {
+        shapes = shapes.slice();
+        shapes.reverse();
+    }
+
+    var i, pos, p1, p2, a, t,
+        length = path.length() - margin,
+        m = margin / path.length(),
+        c = 0,
+        newShapes = [];
+
+    function putOnPath(shape) {
+        if (alignment === 'distributed') {
+            var p = length / ((amount * shapes.length) - 1);
+            pos = c * p / length;
+            pos = m + (pos * (1 - 2 * m));
+        } else {
+            pos = ((c * spacing) % length) / length;
+            pos = m + (pos * (1 - m));
+
+            if (alignment === 'trailing') {
+                pos = 1 - pos;
+            }
         }
-    }
-    return result;
-};
 
-g.contains = function (l, value) {
-    for (var i = 0; i < l.length; i += 1) {
-        if (deepEqual.deepEqual(l[i], value)) {
-            return true;
+        p1 = path.point(pos);
+        p2 = path.point(pos + 0.0000001);
+        a = geo.angle(p1.x, p1.y, p2.x, p2.y);
+        if (baselineOffset) {
+            p1 = geo.coordinates(p1.x, p1.y, a - 90, baselineOffset);
         }
+        t = new Transform();
+        t = t.translate(p1.x, p1.y);
+        t = t.rotate(a);
+        newShapes.push(t.transformShape(shape));
+        c += 1;
     }
-    return false;
-};
 
-g.cycle = function (l, length) {
-    if (!l || length <= 0) { return []; }
-    var newList = [];
-    var ll = l.length;
-    for (var i = 0; i < length; i += 1) {
-        newList.push(l[i % ll]);
+    for (i = 0; i < amount; i += 1) {
+        _.each(shapes, putOnPath);
     }
-    return newList;
-};
+    return newShapes;
+};*/
 
-g.equals = function (o1, o2) {
-    return deepEqual.deepEqual(o1, o2);
+vg._x = function (shape) {
+    if (shape.x !== undefined) {
+        return shape.x;
+    } else {
+        return shape.bounds().x;
+    }
 };
 
-g.count = function (l) {
-    if (l && l.length) {
-        return l.length;
+vg._y = function (shape) {
+    if (shape.y !== undefined) {
+        return shape.y;
     } else {
-        return 0;
+        return shape.bounds().y;
     }
 };
 
-g.cull = function (l, booleans) {
-    if (!l) { return []; }
-    if (!booleans) { return l; }
-    var i, keep, results = [];
-    for (i = 0; i < l.length; i++) {
-        // Cycle through the list of boolean values.
-        keep = booleans[i % booleans.length];
-        if (keep) {
-            results.push(l[i]);
+vg._angleToPoint = function (point) {
+    return function (shape) {
+        if (shape.x !== undefined && shape.y !== undefined) {
+            return geo.angle(shape.x, shape.y, point.x, point.y);
+        } else {
+            var centerPoint = shape.bounds().centerPoint();
+            return geo.angle(centerPoint.x, centerPoint.y, point.x, point.y);
         }
-    }
-    return results;
+    };
 };
 
-g.distinct = function(l) {
-    if (!l) { return []; }
-    var i, length, value,
-        result = [],
-        seen = [];
-    for (i = 0, length = l.length; i < length; i += 1) {
-        value = l[i];
-        if (!g.contains(seen, value)) {
-            seen.push(value);
-            result.push(l[i]);
+vg._distanceToPoint = function (point) {
+    return function (shape) {
+        if (shape.x !== undefined && shape.y !== undefined) {
+            return geo.distance(shape.x, shape.y, point.x, point.y);
+        } else {
+            var centerPoint = shape.bounds().centerPoint();
+            return geo.distance(centerPoint.x, centerPoint.y, point.x, point.y);
         }
-    }
-    return result;
+    };
 };
 
-g.first = function (l) {
-    if (!l || l.length === 0) { return null; }
-    return l[0];
+vg.shapeSort = function (shapes, method, origin) {
+    if (!shapes) {
+        return;
+    }
+    origin = origin || Point.ZERO;
+
+    var methods = {
+        x: vg._x,
+        y: vg._y,
+        angle: vg._angleToPoint(origin),
+        distance: vg._distanceToPoint(origin)
+    };
+    method = methods[method];
+    if (method === undefined) { return shapes; }
+    var newShapes = shapes.slice(0);
+    newShapes.sort(function (a, b) {
+        var _a = method(a),
+            _b = method(b);
+        if (_a < _b) { return -1; }
+        if (_a > _b) { return 1; }
+        return 0;
+    });
+    return newShapes;
 };
 
-g.get = function (l, i) {
-    if (!l || l.length === 0) { return null; }
-    return l[i];
+vg.group = function () {
+    return new Group(_.flatten(arguments));
 };
 
-g.interleave = function () {
-    if (arguments.length === 0) return [];
-    var results = [];
-    var elIndex = 0;
-    while (true) {
-        for (var i = 0; i < arguments.length; i++) {
-            var arg = arguments[i];
-            if (arg.length > elIndex) {
-                results.push(arg[elIndex]);
-            } else {
-                return results;
+vg.ungroup = function (shape) {
+    if (!shape) {
+        return [];
+    } else if (shape.shapes) {
+        var i, s, shapes = [];
+        for (i = 0; i < shape.shapes.length; i += 1) {
+            s = shape.shapes[i];
+            if (s.commands) {
+                shapes.push(s);
+            } else if (s.shapes) {
+                shapes = shapes.concat(vg.ungroup(s));
             }
         }
-        elIndex += 1;
+        return shapes;
+    } else if (shape.commands) {
+        return [shape];
+    } else {
+        return [];
     }
 };
 
-g.last = function (l) {
-    if (!l || l.length === 0) { return null; }
-    return l[l.length - 1];
-};
-
-g.pick = function (l, amount, seed) {
-    if (!l || l.length === 0 || amount <= 0) {
-        return [];
-    }
-    if (!seed && seed !== 0) {
-        seed = Math.random();
-    }
-    var rand = util.randomGenerator(seed || 0);
-    var results = [];
-    for (var i = 0; i < amount; i += 1) {
-        results.push(l[Math.floor(rand(0, l.length))]);
+vg.centerPoint = function (shape) {
+    if (!shape) {
+        return Point.ZERO;
     }
-    return results;
+    var r = vg.bounds(shape);
+    return new Point(r.x + r.width / 2, r.y + r.height / 2);
 };
 
-g.randomSample = function (l, amount, seed) {
-    if (!l || l.length === 0 || amount <= 0) {
-        return [];
+vg.link = function (shape1, shape2, orientation) {
+    if (!shape1 || !shape2) {
+        return;
     }
-    if (!seed && seed !== 0) {
-        seed = Math.random();
+
+    var p = new Path();
+    var a = shape1.bounds();
+    var b = shape2.bounds();
+    if (orientation === vg.HORIZONTAL) {
+        var hw = (b.x - (a.x + a.width)) / 2;
+        p.moveTo(a.x + a.width, a.y);
+        p.curveTo(a.x + a.width + hw, a.y, b.x - hw, b.y, b.x, b.y);
+        p.lineTo(b.x, b.y + b.height);
+        p.curveTo(b.x - hw, b.y + b.height, a.x + a.width + hw, a.y + a.height, a.x + a.width, a.y + a.height);
+        p.close();
+    } else {
+        var hh = (b.y - (a.y + a.height)) / 2;
+        p.moveTo(a.x, a.y + a.height);
+        p.curveTo(a.x, a.y + a.height + hh, b.x, b.y - hh, b.x, b.y);
+        p.lineTo(b.x + b.width, b.y);
+        p.curveTo(b.x + b.width, b.y - hh, a.x + a.width, a.y + a.height + hh, a.x + a.width, a.y + a.height);
+        p.close();
     }
-    var shuffledlist = g.shuffle(l, seed);
-    if (!amount) { return shuffledlist; }
-    return g.slice(shuffledlist, 0, amount);
+    return p;
 };
 
-g.repeat = function (l, amount, perItem) {
-    if (!l) { return []; }
-    if (!Array.isArray(l)) {
-        l = [l];
-    }
-    if (amount <= 0) { return []; }
-    var i, j, v,
-        newList = [];
-    if (!perItem) {
-        for (i = 0; i < amount; i += 1) {
-            newList.push.apply(newList, l);
+vg.compound = function (shape1, shape2, method) {
+    var methods = {
+        'union': ClipperLib.ClipType.ctUnion,
+        'difference': ClipperLib.ClipType.ctDifference,
+        'intersection': ClipperLib.ClipType.ctIntersection,
+        'xor': ClipperLib.ClipType.ctXor
+    };
+
+    function toPoints(shape) {
+        var l1 = [];
+        var i, l, s, j, pt;
+        for (i = 0; i < shape.length; i += 1) {
+            l = [];
+            s = shape[i];
+            for (j = 0; j < s.length; j += 1) {
+                pt = s[j];
+                if (pt.type !== bezier.CLOSE) {
+                    l.push({X: pt.x, Y: pt.y});
+                }
+            }
+            l1.push(l);
         }
-    } else {
-        for (i = 0; i < l.length; i += 1) {
-            v = l[i];
-            for (j = 0; j < amount; j += 1) {
-                newList.push(v);
+        return l1;
+    }
+
+    if (!shape1.commands) { shape1 = Path.combine(shape1); }
+    if (!shape2.commands) { shape2 = Path.combine(shape2); }
+    var contours1 = shape1.resampleByLength(1).contours();
+    var contours2 = shape2.resampleByLength(1).contours();
+
+    var subjPaths = toPoints(contours1);
+    var clipPaths = toPoints(contours2);
+    var scale = 100;
+    ClipperLib.JS.ScaleUpPaths(subjPaths, scale);
+    ClipperLib.JS.ScaleUpPaths(clipPaths, scale);
+
+    var cpr = new ClipperLib.Clipper();
+    cpr.AddPaths(subjPaths, ClipperLib.PolyType.ptSubject, shape1.isClosed());
+    cpr.AddPaths(clipPaths, ClipperLib.PolyType.ptClip, shape2.isClosed());
+
+    var solutionPaths = new ClipperLib.Paths();
+    cpr.Execute(methods[method], solutionPaths, ClipperLib.PolyFillType.pftNonZero, ClipperLib.PolyFillType.pftNonZero);
+    solutionPaths = ClipperLib.JS.Clean(solutionPaths, 0.1 * scale);
+    ClipperLib.JS.ScaleDownPaths(solutionPaths, scale);
+    var path = new Path();
+    var i, j, s;
+    for (i = 0; i < solutionPaths.length; i += 1) {
+        s = solutionPaths[i];
+        for (j = 0; j < s.length ; j += 1) {
+            if (j === 0) {
+                path.moveTo(s[j].X, s[j].Y);
+            } else {
+                path.lineTo(s[j].X, s[j].Y);
             }
         }
+        if (s[0].X !== s[s.length-1].X || s[0].Y !== s[s.length-1].Y) {
+            path.closePath();
+        }
     }
-    return newList;
+    return path;
 };
 
-g.rest = function (l) {
-    if (!l) { return []; }
-    return l.slice(1);
-};
+module.exports = vg;
 
-g.reverse = function (l) {
-    return l.slice().reverse();
+},{"../../../../third_party/clipper":45,"../objects/color":27,"../objects/group":28,"../objects/path":30,"../objects/point":31,"../objects/rect":32,"../objects/transform":34,"../objects/transformable":35,"../util/bezier":37,"../util/geo":39,"../util/math":41,"../util/random":42,"lodash":2}],26:[function(require,module,exports){
+// Basic shapes
 
-};
+'use strict';
 
-g.second = function (l) {
-    if (!l || l.length < 2) { return null; }
-    return l[1];
+var _ = require('lodash');
+
+var geo = require('../util/geo');
+
+var Color = require('../objects/color');
+var Path = require('../objects/path');
+var Point = require('../objects/point');
+var gText = require('../objects/text');
+
+var vg = {};
+
+vg.roundedRect = function (cx, cy, width, height, rx, ry) {
+    var p = new Path();
+    p.addRoundedRect(cx, cy, width, height, rx, ry);
+    return p;
 };
 
-g.shift = function (l, amount) {
-    // If the amount is bigger than the number of items, wrap around.
-    if (!l) { return []; }
-    amount = amount % l.length;
-    var head = l.slice(0, amount),
-        result = l.slice(amount);
-    result.push.apply(result, head);
-    return result;
+vg.quad = function (pt1, pt2, pt3, pt4) {
+    var args = arguments;
+    var p = new Path();
+    if (args.length === 8) {
+        Path.prototype.addQuad.apply(p, args);
+    } else {
+        pt1 = Point.read(pt1);
+        pt2 = Point.read(pt2);
+        pt3 = Point.read(pt3);
+        pt4 = Point.read(pt4);
+        p.addQuad(pt1.x, pt1.y, pt2.x, pt2.y, pt3.x, pt3.y, pt4.x, pt4.y);
+    }
+    return p;
 };
 
-g.shuffle = function (l, seed) {
-    var i, j, tmp, r;
-    if (!seed && seed !== 0) {
-        seed = Math.random();
+vg.rect = function (position, width, height, roundness) {
+    var args = arguments;
+    if (args.length === 3) {
+        position = Point.read(position);
+    } else if (args.length === 4) {
+        if (typeof args[0] === 'number' && typeof args[1] === 'number') {
+            position = Point.read(args[0], args[1]);
+            width = args[2];
+            height = args[3];
+            roundness = null;
+        } else {
+            position = Point.read(position);
+            roundness = Point.read(roundness);
+        }
+    } else if (args.length === 5 || args.length === 6) {
+        position = Point.read(args[0], args[1]);
+        width = args[2];
+        height = args[3];
+        if (args.length === 5 && typeof args[4] === 'number') {
+            roundness = Point.read(args[4], args[4]);
+        } else {
+            roundness = Point.read(args[4], args[5]);
+        }
     }
-    r = util.randomGenerator(seed || 0);
-    l = l.slice();
-    for (i = l.length - 1; i > 0; i--) {
-        j = Math.floor(r(0, i + 1));
-        tmp = l[i];
-        l[i] = l[j];
-        l[j] = tmp;
+
+    if (!roundness || (roundness.x === 0 && roundness.y === 0)) {
+        var p = new Path();
+        p.addRect(position.x - width / 2, position.y - height / 2, width, height);
+        return p;
+    } else {
+        return vg.roundedRect(position.x - width / 2, position.y - height / 2, width, height, roundness.x, roundness.y);
     }
-    return l;
 };
 
-g.slice = function (l, start, size, invert) {
-    if (!l) { return []; }
-    var firstList, secondList;
-    if (!invert) {
-        return l.slice(start, start + size);
+vg.ellipse = function (position, width, height) {
+    var args = arguments;
+    if (args.length === 4) {
+        position = Point.read(args[0], args[1]);
+        width = args[2];
+        height = args[3];
     } else {
-        firstList = l.slice(0, start);
-        secondList = l.slice(start + size);
-        firstList.push.apply(firstList, secondList);
-        return firstList;
+        position = Point.read(position);
     }
+    var p = new Path();
+    p.addEllipse(position.x - width / 2, position.y - height / 2, width, height);
+    return p;
 };
 
-g.sort = function (l, key) {
-    if (key) {
-        if (typeof key === 'string') {
-            return l.slice().sort(function (a, b) {
-                if (a[key] > b[key]) { return 1; }
-                else if (a[key] === b[key]) { return 0; }
-                else { return -1; }
-            });
-        } else if (typeof key === 'function') {
-            return l.slice().sort(key);
-        }
+vg.line = function (point1, point2) {
+    var args = arguments;
+    if (args.length === 4) {
+        point1 = Point.read(args[0], args[1]);
+        point2 = Point.read(args[2], args[3]);
+    } else {
+        point1 = Point.read(point1);
+        point2 = Point.read(point2);
     }
-    if (l && l[0] !== undefined && l[0] !== null && typeof l[0] === 'number') {
-        return l.slice().sort(function (a, b) { return a - b; });
+    var line = new Path();
+    line.addLine(point1.x, point1.y, point2.x, point2.y);
+    line.fill = null;
+    line.stroke = 'black';
+    return line;
+};
+
+vg.lineAngle = function (point, angle, distance) {
+    var args = arguments;
+    if (args.length === 4) {
+        point = Point.read(args[0], args[1]);
+        distance = args[2];
+        angle = args[3];
+    } else {
+        point = Point.read(point);
     }
-    return l.slice().sort();
+    var point2 = geo.coordinates(point.x, point.y, angle, distance);
+    return vg.line(point, point2);
 };
 
-g.switch = function (index) {
-    var nLists = (arguments.length - 1);
-    index = index % nLists;
-    if (index < 0) {
-        index += nLists;
+vg.arc = function (position, width, height, startAngle, degrees, arcType) {
+    var args = arguments;
+    if (args.length === 7) {
+        position = Point.read(args[0], args[1]);
+        width = args[2];
+        height = args[3];
+        startAngle = args[4];
+        degrees = args[5];
+        arcType = args[6];
+    } else {
+        position = Point.read(position);
     }
-    return arguments[index + 1];
+    var p = new Path();
+    p.addArc(position.x, position.y, width, height, startAngle, degrees, arcType);
+    return p;
 };
 
-g.takeEvery = function (l, n, offset) {
-    var i, results = [];
-    offset = offset || 0;
-    for (i = 0; i < l.length; i += 1) {
-        if (i % n === offset) {
-            results.push(l[i]);
+vg.curve = function (pt1, pt2, t, distance) {
+    var args = arguments;
+    if (args.length === 6) {
+        pt1 = Point.read(args[0], args[1]);
+        pt2 = Point.read(args[2], args[3]);
+        t = args[4];
+        distance = args[5];
+    } else {
+        pt1 = Point.read(pt1);
+        pt2 = Point.read(pt2);
+    }
+
+    var cx = pt1.x + t * (pt2.x - pt1.x),
+        cy = pt1.y + t * (pt2.y - pt1.y),
+        a = geo.angle(pt1.x, pt1.y, pt2.x, pt2.y) + 90,
+        q = geo.coordinates(cx, cy, a, distance),
+        qx = q.x,
+        qy = q.y,
+
+        c1x = pt1.x + 2 / 3.0 * (qx - pt1.x),
+        c1y = pt1.y + 2 / 3.0 * (qy - pt1.y),
+        c2x = pt2.x + 2 / 3.0 * (qx - pt2.x),
+        c2y = pt2.y + 2 / 3.0 * (qy - pt2.y);
+
+    var p = new Path();
+    p.moveTo(pt1.x, pt1.y);
+    p.curveTo(c1x, c1y, c2x, c2y, pt2.x, pt2.y);
+    p.fill = null;
+    p.stroke = Color.BLACK;
+    return p;
+};
+
+vg.polygon = function (position, radius, sides, align) {
+    var args = arguments;
+    if (args.length === 5 || (args.length === 4 && typeof args[0] === 'number' && typeof args[1] === 'number')) {
+        position = Point.read(args[0], args[1]);
+        radius = args[2];
+        sides = args[3];
+        align = args.length === 5 ? args[4] : true;
+    } else {
+        position = Point.read(position);
+        if (args.length === 3) {
+            align = true;
+        }
+    }
+    sides = Math.max(sides, 3);
+    var c0, c1, i, c,
+        x = position.x,
+        y = position.y,
+        r = radius,
+        a = 360.0 / sides,
+        da = 0;
+    if (align === true) {
+        c0 = geo.coordinates(x, y, 0, r);
+        c1 = geo.coordinates(x, y, a, r);
+        da = -geo.angle(c1.x, c1.y, c0.x, c0.y);
+    }
+    var p = new Path();
+    for (i = 0; i < sides; i += 1) {
+        c = geo.coordinates(x, y, (a * i) + da, r);
+        if (i === 0) {
+            p.moveTo(c.x, c.y);
+        } else {
+            p.lineTo(c.x, c.y);
         }
     }
-    return results;
+    p.close();
+    return p;
 };
 
-g.zipMap = function (keys, vals) {
-    var i, k, v,
-        m = {},
-        minLength = Math.min(keys.length, vals.length);
-    for (i = 0; i < minLength; i += 1) {
-        k = keys[i];
-        v = vals[i];
-        m[k] = v;
+vg.star = function (position, points, outer, inner) {
+    var args = arguments;
+    if (args.length === 5 || (args.length === 4 && typeof args[0] === 'number' && typeof args[1] === 'number')) {
+        position = Point.read(args[0], args[1]);
+        points = args[2];
+        outer = args[3];
+        inner = args[4];
+    } else {
+        position = Point.read(position);
     }
-    return m;
+    if (!inner) { inner = outer; }
+    var i, angle, radius, x, y;
+    var p = new Path();
+    p.moveTo(position.x, position.y + outer / 2);
+    // Calculate the points of the star.
+    for (i = 1; i < points * 2; i += 1) {
+        angle = i * Math.PI / points;
+        radius = (i % 2 === 1) ? inner / 2 : outer / 2;
+        x = position.x + radius * Math.sin(angle);
+        y = position.y + radius * Math.cos(angle);
+        p.lineTo(x, y);
+    }
+    p.close();
+    return p;
 };
 
-module.exports = g;
-
-},{"./deepequal":11,"./util":24}],22:[function(require,module,exports){
-'use strict';
-
-var _ = require('lodash');
-
-var util = require('./util');
-var vg = require('./vg/vg');
-
-var g = {};
-
-var TWO_PI = Math.PI * 2;
+vg.freehand = function (pathString) {
+    var i, j, values,
+        nonEmpty = function (s) { return s !== ''; },
+        contours = _.filter(pathString.split('M'), nonEmpty);
 
-g.abs = Math.abs;
+    contours = _.map(contours, function (c) { return c.replace(/,/g, ' '); });
+    var p = new Path();
+    for (j = 0; j < contours.length; j += 1) {
+        values = _.filter(contours[j].split(' '), nonEmpty);
+        for (i = 0; i < values.length; i += 2) {
+            if (values[i + 1] !== undefined) {
+                var x = parseFloat(values[i]);
+                var y = parseFloat(values[i + 1]);
+                if (i === 0) {
+                    p.moveTo(x, y);
+                } else {
+                    p.lineTo(x, y);
+                }
+            }
+        }
+    }
+    p.fill = null;
+    p.stroke = Color.BLACK;
+    return p;
+};
 
-g.accumulate = function (values) {
-    if (arguments.length > 1) {
-        values = arguments;
-    } else if (arguments.length === 1 && !Array.isArray(values)) {
-        values = [values];
+// Create a grid of points.
+vg.grid = function (columns, rows, columnWidth, rowHeight, position) {
+    var gridWidth, left, gridHeight, top, rowIndex, colIndex, x, y, i,
+        points = [];
+    points.length = columns * rows;
+    position = position !== undefined ? position : Point.ZERO;
+    if (columns > 1) {
+        gridWidth = columnWidth * (columns - 1);
+        left = position.x - gridWidth / 2;
+    } else {
+        left = position.x;
     }
-    if (!values || values.length === 0) { return [0.0]; }
-    var i, b = [],
-        currentTotal = 0;
-    for (i = 0; i < values.length; i++) {
-        b.push(currentTotal);
-        currentTotal += values[i];
+    if (rows > 1) {
+        gridHeight = rowHeight * (rows - 1);
+        top = position.y - gridHeight / 2;
+    } else {
+        top = position.y;
     }
-    return b;
-};
 
-g.add = function (a, b) {
-    if (arguments.length === 2) { return a + b; }
-    return _.reduce(arguments, function(total, n) {
-        return total + n;
-    }, 0);
+    i = 0;
+    for (rowIndex = 0; rowIndex < rows; rowIndex += 1) {
+        for (colIndex = 0; colIndex < columns; colIndex += 1) {
+            x = left + colIndex * columnWidth;
+            y = top + rowIndex * rowHeight;
+            points[i] = new Point(x, y);
+            i += 1;
+        }
+    }
+    return points;
 };
 
-g.and = function (bool1, bool2) {
-    var argLength = arguments.length;
-    if (argLength === 2) {
-        return bool1 && bool2;
-    } else if (argLength === 1) {
-        return !!bool1;
-    } else if (argLength === 0) {
-        throw new Error('Wrong number of arguments');
-    }
-    return _.reduce(arguments, function(b1, b2) {
-        return b1 && b2;
-    }, true);
+// Generates a Text object.
+// The function can take many possible argument forms, either by listing them in order
+// (text, x, y, fontFamily, fontSize, align, fill), or by using an options object.
+// The position can be specified as x, y; using a point {x: 10, y: 20} or using an array [10, 20].
+// Here are a couple of ways to generate 'Hello' at position 0, 0 in 12pt Helvetica, centered.
+//
+//     vg.text('Hello', {x: 0, y: 0}, 'Helvetica', 12, 'center');
+//     vg.text('Hello', [0, 0], {fontFamily: 'Helvetica', fontSize: 12, align: 'center'});
+//     vg.text('Hello', 0, 0, {fontFamily: 'Helvetica', fontSize: 12});  // align: center is the default.
+//     vg.text('Hello', {fontFamily: 'Helvetica', fontSize: 12}); // the position defaults to 0,0.
+vg.text = function () {
+    var t = Object.create(gText.prototype);
+    t.constructor = gText.prototype;
+    gText.apply(t, arguments);
+    return t;
 };
 
-g.average = function (values) {
-    if (arguments.length > 1) {
-        values = arguments;
-    } else if (arguments.length === 1 && !Array.isArray(values)) {
-        values = [values];
-    }
-    if (!values || values.length === 0) { return 0; }
-    var i, sum = 0;
-    for (i = 0; i < values.length; i += 1) {
-        sum += values[i];
-    }
-    return sum / values.length;
+vg.demoRect = function () {
+    return new vg.rect({x: 0, y: 0}, 100, 100, {x: 0, y: 0});
 };
 
-g.boolean = function (v) {
-    return !!v;
+vg.demoEllipse = function () {
+    return new vg.ellipse({x: 0, y: 0}, 100, 100);
 };
 
-g.ceil = Math.ceil;
+module.exports = vg;
 
-g.compare = function (v1, v2, comparator) {
-    if (comparator === '<') {
-        return v1 < v2;
-    } else if (comparator === '>') {
-        return v1 > v2;
-    } else if (comparator === '<=') {
-        return v1 <= v2;
-    } else if (comparator === '>=') {
-        return v1 >= v2;
-    } else if (comparator === '==') {
-        return v1 === v2;
-    } else if (comparator === '!=') {
-        return v1 !== v2;
-    }
-    throw new Error('Unknown comparison operation ' + comparator);
-};
+},{"../objects/color":27,"../objects/path":30,"../objects/point":31,"../objects/text":33,"../util/geo":39,"lodash":2}],27:[function(require,module,exports){
+// Color object
 
-g.cos = Math.cos;
+'use strict';
 
-g.degrees = function (radians) {
-    return radians * 180 / Math.PI;
-};
+var math = require('../util/math');
+var color = require('../util/color');
+var js = require('../util/js');
 
-g.divide = function (a, b) {
-    var argLength = arguments.length;
-    function checkIfZero(arg) {
-        if (arg === 0) {
-            throw new Error('Divide by zero');
+// var RGB = 'RGB';
+var HSB = 'HSB';
+var HSL = 'HSL';
+var HEX = 'HEX';
+
+var Color = function (v1, v2, v3, v4, v5) {
+    var _r, _g, _b, _a, rgb, options;
+    if (v1 === undefined) {
+        _r = _g = _b = 0;
+        _a = 1;
+    } else if (Array.isArray(v1)) {
+        options = v2 || {};
+        _r = v1[0] !== undefined ? v1[0] : 0;
+        _g = v1[1] !== undefined ? v1[1] : 0;
+        _b = v1[2] !== undefined ? v1[2] : 0;
+        _a = v1[3] !== undefined ? v1[3] : options.range || 1;
+    } else if (v1.r !== undefined) {
+        options = v2 || {};
+        _r = v1.r;
+        _g = v1.g;
+        _b = v1.b;
+        _a = v1.a !== undefined ? v1.a : options.range || 1;
+    } else if (typeof v1 === 'string') {
+        rgb = color.hex2rgb(v1);
+        _r = rgb[0];
+        _g = rgb[1];
+        _b = rgb[2];
+        _a = 1;
+    } else if (typeof v1 === 'number') {
+        if (arguments.length === 1) { // Grayscale value
+            _r = _g = _b = v1;
+            _a = 1;
+        } else if (arguments.length === 2) { // Gray and alpha or options
+            _r = _g = _b = v1;
+            if (typeof v2 === 'number') {
+                _a = v2;
+            } else {
+                options = v2;
+                _a = options.range || 1;
+            }
+        } else if (arguments.length === 3) { // RGB or gray, alpha and options
+            if (typeof v3 === 'number') {
+                _r = v1;
+                _g = v2;
+                _b = v3;
+                _a = 1;
+            } else {
+                _r = _g = _b = v1;
+                _a = v2;
+                options = v3;
+            }
+        } else if (arguments.length === 4) { // RGB and alpha or options
+            _r = v1;
+            _g = v2;
+            _b = v3;
+            if (typeof v4 === 'number') {
+                _a = v4;
+            } else {
+                options = v4;
+                _a = options.range || 1;
+            }
+        } else { // RGBA + options
+            _r = v1;
+            _g = v2;
+            _b = v3;
+            _a = v4;
+            options = v5;
         }
     }
-    if (argLength === 2) {
-        checkIfZero(b);
-        return a / b;
-    } else if (argLength === 1) {
-        checkIfZero(a);
-        return 1 / a;
-    } else if (argLength === 0) {
-        throw new Error('Wrong number of arguments');
-    }
-    return _.reduce([].slice.call(arguments, 1), function(total, n) {
-        checkIfZero(n);
-        return total / n;
-    }, arguments[0]);
-};
-
-g.e = function () {
-    return Math.E;
-};
-
-g.even = function (v) {
-    return v % 2 === 0;
-};
-
-g.floor = Math.floor;
-
-g.integer = function (v) {
-    return v | 0;
-};
-
-g.log = function (v) {
-    return v > 0 ? Math.log(v) : -Math.log(-v);
-};
+    options = options || {};
 
-g.makeNumbers = function (s, separator) {
-    if (!s) { return []; }
-    if (!separator) { separator = ''; }
-    var i, num, numbers = [],
-        strings = s.split(separator);
-    for (i = 0; i < strings.length; i += 1) {
-        num = parseFloat(strings[i]);
-        if (num === 0 || num) {
-            numbers.push(num);
+    // The range option allows you to specify values in a different range.
+    if (options.range !== undefined) {
+        _r /= options.range;
+        _g /= options.range;
+        _b /= options.range;
+        _a /= options.range;
+        if (options.mode === HSB) {
+            v1 /= options.range;
+            v2 /= options.range;
+            v3 /= options.range;
         }
     }
-    return numbers;
-};
-
-g.max = function () {
-    var values = arguments;
-    if (arguments.length === 1 && Array.isArray(arguments[0])) {
-        values = arguments[0];
-    }
-    if (values.length === 0) {
-        throw new Error('Wrong number of arguments');
+    // Convert HSB colors to RGB
+    if (options.mode === HSB) {
+        v1 = math.clamp(v1, 0, 1);
+        v2 = math.clamp(v2, 0, 1);
+        v3 = math.clamp(v3, 0, 1);
+        rgb = color.hsb2rgb(v1, v2, v3);
+        _r = rgb[0];
+        _g = rgb[1];
+        _b = rgb[2];
+    // Convert HSL colors to RGB
+    } else if (options.mode === HSL) {
+        v1 = math.clamp(v1, 0, 1);
+        v2 = math.clamp(v2, 0, 1);
+        v3 = math.clamp(v3, 0, 1);
+        rgb = color.hsl2rgb(v1, v2, v3);
+        _r = rgb[0];
+        _g = rgb[1];
+        _b = rgb[2];
+    } else if (options.mode === HEX) {
+        rgb = color.hex2rgb(v1);
+        _r = rgb[0];
+        _g = rgb[1];
+        _b = rgb[2];
+        _a = 1;
     }
-    return Math.max.apply(null, values);
-};
 
-g.min = function () {
-    var values = arguments;
-    if (arguments.length === 1 && Array.isArray(arguments[0])) {
-        values = arguments[0];
-    }
-    if (values.length === 0) {
-        throw new Error('Wrong number of arguments');
-    }
-    return Math.min.apply(null, values);
+    this.r = math.clamp(_r, 0, 1);
+    this.g = math.clamp(_g, 0, 1);
+    this.b = math.clamp(_b, 0, 1);
+    this.a = math.clamp(_a, 0, 1);
 };
 
-g.mod = function (a, b) {
-    return a % b;
-};
+Color.BLACK = new Color(0);
+Color.WHITE = new Color(1);
 
-g.multiply = function (a, b) {
-    var argLength = arguments.length;
-    if (argLength === 2) { return a * b; }
-    else if (argLength === 1) { return a; }
-    return _.reduce(arguments, function(total, n) {
-        return total * n;
-    }, 1);
-};
+js.defineAlias(Color, 'r', 'red');
+js.defineAlias(Color, 'g', 'green');
+js.defineAlias(Color, 'b', 'blue');
+js.defineAlias(Color, 'a', 'alpha');
 
-g.negate = function (v) {
-    return -v;
-};
+// The hue of the color, in HSL color mode. (Although hue is the same in HSL and HSB).
+js.defineGetter(Color, 'h', function () {
+    return color.rgb2hsl(this.r, this.g, this.b)[0];
+});
 
-g.not = function (bool) {
-    return !bool;
-};
+// The saturation of the color, in HSL color mode. (Saturation is different in HSL and HSB).
+js.defineGetter(Color, 's', function () {
+    return color.rgb2hsl(this.r, this.g, this.b)[1];
+});
 
-g.number = function (v) {
-    return v;
-};
+// The lightness of the color, in HSL color mode. (Lightness in HSL is different from brightness in HSB).
+js.defineGetter(Color, 'l', function () {
+    return color.rgb2hsl(this.r, this.g, this.b)[2];
+});
 
-g.odd = function (v) {
-    return v % 2 !== 0;
-};
+js.defineAlias(Color, 'h', 'hue');
+js.defineAlias(Color, 's', 'saturation');
+js.defineAlias(Color, 'l', 'lightness');
 
-g.or = function (bool1, bool2) {
-    var argLength = arguments.length;
-    if (argLength === 2) {
-        return bool1 || bool2;
-    } else if (argLength === 1) {
-        return !!bool1;
-    } else if (argLength === 0) {
-        throw new Error('Wrong number of arguments');
-    }
-    return _.reduce(arguments, function(b1, b2) {
-        return b1 || b2;
-    }, false);
-};
 
-// Compute Perlin noise
-g.perlinNoise = function (x, y, z) {
-    // Call optimized internal noise function.
-    return vg.math.noise(x, y, z);
-};
+js.defineGetter(Color, 'rgb', function () {
+    return [this.r, this.g, this.b];
+});
 
-g.pi = function () {
-    return Math.PI;
-};
+js.defineGetter(Color, 'rgba', function () {
+    return [this.r, this.g, this.b, this.a];
+});
 
-g.pow = Math.pow;
+js.defineGetter(Color, 'hsb', function () {
+    return color.rgb2hsb(this.r, this.g, this.b);
+});
 
-g.radians = function (degrees) {
-    return degrees * Math.PI / 180;
-};
+js.defineGetter(Color, 'hsba', function () {
+    return color.rgb2hsb(this.r, this.g, this.b).concat([this.a]);
+});
 
-g.randomNumbers = function (amount, min, max, seed) {
-    var argLength = arguments.length;
-    if (argLength < 4 || (!seed && seed !== 0)) {
-        seed = Math.random();
-    }
-    if (argLength === 3 || argLength === 4) {
-        min = min || 0;
-        max = max || (max === 0 ? 0 : 1);
-    } else if (argLength === 2) {
-        max = min || (min === 0 ? 0 : 1);
-        min = 0;
-    } else if (argLength === 1) {
-        min = 0;
-        max = 1;
-    }
-    if (max < min) {
-        var tmp = max;
-        max = min;
-        min = tmp;
-    }
-    var v;
-    var delta = max - min;
-    var numbers = [];
-    var rand = util.randomGenerator(seed || 0);
-    for (var i = 0; i < amount; i += 1) {
-        v = min + (rand(0, 1) * delta);
-        numbers.push(v);
-    }
-    return numbers;
-};
+js.defineGetter(Color, 'hsl', function () {
+    return color.rgb2hsl(this.r, this.g, this.b);
+});
 
-g.range = function (min, max, step, includeMax) {
-    if (min === max) { return []; }
-    if (step !== 0) {
-        step = step || (min < max ? 1 : -1);
-    }
-    if (step > 0 && min > max) return [];
-    if (step < 0 && min < max) return [];
-    if (step === 0) return [];
-    var values = [];
-    var i;
-    if (min < max) {
-        if (!!includeMax) {
-            for (i = min; i <= max; i += step) {
-                values.push(i);
-            }
-        } else {
-            for (i = min; i < max; i += step) {
-                values.push(i);
-            }
-        }
-    } else {
-        if (!!includeMax) {
-            for (i = min; i >= max; i += step) {
-                values.push(i);
-            }
-        } else {
-            for (i = min; i > max; i += step) {
-                values.push(i);
-            }
-        }
-    }
-    return values;
-};
+js.defineGetter(Color, 'hsla', function () {
+    return color.rgb2hsl(this.r, this.g, this.b).concat([this.a]);
+});
 
-g.round = function (v, a) {
-    a = a | 0;
-    if (!a) {
-        return Math.round(v);
-    }
-    return Math.round(v / a) * a;
+Color.prototype.toCSS = function () {
+    return Color.toCSS(this);
 };
 
-g.sample = function (amount, min, max, circular) {
-    var d,
-        values = [],
-        i;
-    values.length = amount;
-    if (circular) {
-        d = (max - min) / amount;
+Color.prototype.toHex = function () {
+    if (this.a >= 1) {
+        return color.rgb2hex(this.r, this.g, this.b);
     } else {
-        d = (max - min) / (amount - 1);
-    }
-    for (i = 0; i < amount; i += 1) {
-        values[i] = min + i * d;
+        return color.rgba2hex(this.r, this.g, this.b, this.a);
     }
-    return values;
-};
-
-g.sineWave = function (v, min, max, period, offset) {
-    if (min === undefined) min = -1;
-    if (max === undefined) max = 1;
-    if (period === undefined) period = 1;
-    if (offset === undefined) offset = 0;
-    var amplitude = (max - min) / 2;
-    return (min + amplitude) + Math.sin((offset + v) * TWO_PI / period) * amplitude;
 };
 
-g.squareWave = function (v, min, max, period, offset) {
-    if (min === undefined) min = -1;
-    if (max === undefined) max = 1;
-    if (period === undefined) period = 1;
-    if (offset === undefined) offset = 0;
-    var halfPeriod = period / 2;
-    var d = (v + offset) % period;
-    if (d < halfPeriod) {
-        return max;
-    } else {
-        return min;
+Color.prototype.desaturate = function (options) {
+    if (this.r === this.g && this.g === this.b) { return this; }
+    var rCoeff, gCoeff, bCoeff;
+    if (options === undefined || !options.method || options.method === 'ITU-R BT.601') {
+        rCoeff = 0.3; gCoeff = 0.59; bCoeff = 0.11;
+    } else if (options.method === 'ITU-R BT.709') {
+        rCoeff = 0.2125; gCoeff = 0.7154; bCoeff = 0.0721;
     }
+    var gray = this.r * rCoeff + this.g * gCoeff + this.b * bCoeff;
+    return new Color(gray, gray, gray, this.a);
 };
 
-g.triangleWave = function (v, min, max, period, offset) {
-    if (min === undefined) min = -1;
-    if (max === undefined) max = 1;
-    if (period === undefined) period = 1;
-    if (offset === undefined) offset = 0;
-    var amplitude = (max - min) / 2,
-        frequency = TWO_PI / period,
-        phase = 0,
-        time = v + offset + period / 4;
-    if (time % period !== 0) {
-        phase = (time * frequency) % TWO_PI;
-    }
-    if (phase < 0) { phase += TWO_PI; }
-    return 2 * amplitude * (1 + -Math.abs((phase / TWO_PI) * 2 - 1)) + min;
+Color.prototype.invert = function () {
+    return new Color(1 - this.r, 1 - this.g, 1 - this.b, this.a);
 };
 
-g.sawtoothWave = function (v, min, max, period, offset) {
-    if (min === undefined) min = -1;
-    if (max === undefined) max = 1;
-    if (period === undefined) period = 1;
-    if (offset === undefined) offset = 0;
-    var amplitude = (max - min) / 2,
-        frequency = TWO_PI / period,
-        phase = 0,
-        time = v + offset;
-    if (time % period !== 0) {
-        phase = (time * frequency) % TWO_PI;
+Color.clone = function (c) {
+    if (c === null || c === undefined) {
+        return null;
+    } else if (typeof c === 'string') {
+        return c;
+    } else {
+        return new Color(c.r, c.g, c.b, c.a);
     }
-    if (phase < 0) { phase += TWO_PI; }
-    return 2 * (phase / TWO_PI) * amplitude + min;
 };
 
-g.sign = function (v) {
-    if (v > 0) {
-        return 1;
-    } else if (v === 0) {
-        return 0;
+Color.toCSS = function (c) {
+    if (c === null) {
+        return 'none';
+    } else if (c === undefined) {
+        return 'black';
+    } else if (typeof c === 'string') {
+        return c;
+    } else if (c instanceof Color) {
+        var r255 = Math.round(c.r * 255),
+            g255 = Math.round(c.g * 255),
+            b255 = Math.round(c.b * 255);
+        return 'rgba(' + r255 + ', ' + g255 + ', ' + b255 + ', ' + c.a + ')';
+    } else if (c.r !== undefined && c.g !== undefined && c.b !== undefined) {
+        if (c.a === undefined) {
+            return 'rgb(' + c.r + ', ' + c.g + ', ' + c.b + ')';
+        } else {
+            return 'rgba(' + c.r + ', ' + c.g + ', ' + c.b + ', ' + c.a + ')';
+        }
     } else {
-        return -1;
+        throw new Error('Don\'t know how to convert ' + c + ' to CSS.');
     }
 };
 
-g.sin = Math.sin;
-
-g.sqrt = Math.sqrt;
-
-g.subtract = function (a, b) {
-    var argLength = arguments.length;
-    if (argLength === 2) { return a - b; }
-    else if (argLength === 1) { return -a; }
-    else if (argLength === 0) { throw new Error('Wrong number of arguments'); }
-    return _.reduce([].slice.call(arguments, 1), function(total, n) {
-        return total - n;
-    }, arguments[0]);
+Color.toHex = function (c) {
+    return Color.parse(c).toHex();
 };
 
-g.tan = Math.tan;
+Color.make = function () {
+    var c = Object.create(Color.prototype);
+    c.constructor = Color.prototype;
+    Color.apply(c, arguments);
+    return c;
+};
 
-g.total = function (values) {
-    if (arguments.length > 1) {
-        values = arguments;
-    } else if (arguments.length === 1 && !Array.isArray(values)) {
-        values = [values];
-    } else if (arguments.length === 0) {
-        values = [];
-    }
-    if (values.length === 0) { return 0; }
-    var i, total = 0;
-    for (i = 0; i < values.length; i += 1) {
-        total += values[i];
+Color.parse = function (s) {
+    function startsWith (s, value) {
+        if (!s || !value) { return false; }
+        s = String(s);
+        return s.indexOf(value) === 0;
     }
-    return total;
-};
 
-g.xor = function (bool1, bool2) {
-    var argLength = arguments.length;
-    if (argLength === 2) {
-        return !!(bool1 ^ bool2);
+    var m;
+    if (s === undefined || s === null) {
+        return new Color(0, 0, 0, 0);
+    } else if (s instanceof Color) {
+        return s;
+    } else if (color.namedColors[s]) {
+        return Color.make.apply(null, color.namedColors[s]);
+    } else if (s[0] === '#') {
+        return new Color(s, 0, 0, 0, { mode: HEX });
+    } else if (startsWith(s, 'rgba')) {
+        m = s.match(/^rgba\s*\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+|\d+.\d+)\s*\)$/i);
+        if (m) {
+            return new Color(parseInt(m[1]) / 255, parseInt(m[2]) / 255, parseInt(m[3]) / 255, parseFloat(m[4]));
+        } else {
+            m = s.match(/^rgba\s*\(\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)\s*\)$/i);
+            if (m) {
+                return new Color(parseFloat(m[1]) / 100, parseFloat(m[2]) / 100, parseFloat(m[3]) / 100, parseFloat(m[4]));
+            }
+        }
+        return new Color(0, 0, 0, 0);
+    } else if (startsWith(s, 'rgb')) {
+        m = s.match(/^rgb\s*\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)\s*\)$/i);
+        if (m) {
+            return new Color(parseInt(m[1]) / 255, parseInt(m[2]) / 255, parseInt(m[3]) / 255);
+        } else {
+            m = s.match(/^rgb\s*\(\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*\)$/i);
+            if (m) {
+                return new Color(parseFloat(m[1]) / 100, parseFloat(m[2]) / 100, parseFloat(m[3]) / 100);
+            }
+        }
+        return new Color(0, 0, 0, 0);
+    } else if (startsWith(s, 'hsla')) {
+        m = s.match(/^hsla\s*\(\s*(\d+|\d+.\d+)\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)\s*\)$/i);
+        if (m) {
+            return new Color(parseFloat(m[1]) / 360, parseFloat(m[2]) / 100, parseFloat(m[3]) / 100, parseFloat(m[4]));
+        }
+        return new Color(0, 0, 0, 0);
+    } else if (startsWith(s, 'hsl')) {
+        m = s.match(/^hsl\s*\(\s*(\d+|\d+.\d+)\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*\)$/i);
+        if (m) {
+            return new Color(parseFloat(m[1]) / 360, parseFloat(m[2]) / 100, parseFloat(m[3]) / 100);
+        }
+        return new Color(0, 0, 0, 0);
+    } else if (s === 'none' || s === 'null' || startsWith(s, 'url(')) {
+        return new Color(0, 0, 0, 0);
     } else {
-        throw new Error('Wrong number of arguments');
+        throw new Error('Color ' + s + 'can not be parsed');
     }
 };
 
-module.exports = g;
-
-},{"./util":24,"./vg/vg":45,"lodash":3}],23:[function(require,module,exports){
-'use strict';
-
-var g = {};
-
-g.characterAt = function (s, index) {
-    if (!s || s.length === 0) { return ''; }
-    s = String(s);
-    if (index < 0) {
-        index = s.length + index;
-    }
-    return s.charAt(index);
+Color.gray = function (gray, alpha, range) {
+    range = Math.max(range, 1);
+    return new Color(gray / range, gray / range, gray / range, alpha / range);
 };
 
-g.concatenate = function () {
-    var result = '';
-    for (var i = 0; i < arguments.length; i++) {
-        var s = arguments[i];
-        s = s !== undefined ? String(s) : '';
-        result += s;
-    }
-    return result;
+Color.rgb = function (red, green, blue, alpha, range) {
+    range = Math.max(range, 1);
+    return new Color(red / range, green / range, blue / range, alpha / range);
 };
 
-g.endsWith = function (s, value) {
-    if (!s || !value) { return false; }
-    s = String(s);
-    return s.indexOf(value, s.length - value.length) !== -1;
+Color.hsb = function (hue, saturation, brightness, alpha, range) {
+    range = Math.max(range, 1);
+    return new Color(hue / range, saturation / range, brightness / range, alpha / range, { mode: HSB });
 };
 
-g.reverse = function (l) {
-    return l.slice().reverse();
+Color.hsl = function (hue, saturation, lightness, alpha, range) {
+    range = Math.max(range, 1);
+    return new Color(hue / range, saturation / range, lightness / range, alpha / range, { mode: HSL });
 };
 
-g.startsWith = function (s, value) {
-    if (!s || !value) { return false; }
-    s = String(s);
-    return s.indexOf(value) === 0;
-};
+module.exports = Color;
+
+},{"../util/color":38,"../util/js":40,"../util/math":41}],28:[function(require,module,exports){
+// Shape group object
+
+'use strict';
 
-g.string = String;
+var _ = require('lodash');
 
-g.stringContains = function (s, sub) {
-    if (!s || !sub) { return false; }
-    s = String(s);
-    return s.indexOf(sub) !== -1;
-};
+var Path = require('../objects/path');
+var Rect = require('../objects/rect');
+var Color = require('../objects/color');
 
-g.stringEquals = function (string1, string2, ignoreCase) {
-    string1 = String(string1);
-    string2 = String(string2);
-    if (!string1 || !string2) {
-        return false;
-    }
-    if (ignoreCase) {
-        return string1.toLowerCase() === string2.toLowerCase();
-    } else {
-        return string1 === string2;
+var Group = function (shapes) {
+    if (!shapes) {
+        this.shapes = [];
+    } else if (shapes.shapes || shapes.commands) {
+        this.shapes = [shapes];
+    } else if (shapes) {
+        this.shapes = shapes;
     }
 };
 
-g.stringLength = function (s) {
-    if (!s) { return 0; }
-    s = String(s);
-    return s.length;
+Group.prototype.add = function (shape) {
+    this.shapes.push(shape);
 };
 
-g.stringReplace = function (s, old, new_) {
-    s = String(s);
-    return s.replace(new RegExp(old, 'g'), new_);
+Group.prototype.clone = function () {
+    var newShapes = [],
+        n = this.shapes.length,
+        i;
+    newShapes.length = n;
+    for (i = 0; i < n; i += 1) {
+        newShapes[i] = this.shapes[i].clone();
+    }
+    return new Group(newShapes);
 };
 
-g.stringSplit = function (s, separator) {
-    if (!s) { return []; }
-    if (!separator || separator.length === 0) {
-        separator = '';
+Group.prototype.colorize = function (options) {
+    var args = arguments;
+    if (typeof options !== 'object' || options instanceof Color) {
+        options = {};
+        if (args[0] !== undefined) { options.fill = args[0]; }
+        if (args[1] !== undefined) { options.stroke = args[1]; }
+        if (args[2] !== undefined) { options.strokeWidth = args[2]; }
     }
-    s = String(s);
-    return s.split(separator);
+    var shapes = _.map(this.shapes, function (shape) {
+        return shape.colorize(options);
+    });
+    return new Group(shapes);
 };
 
-g.stringTrim = function (s) {
-    if (!s) { return null; }
-    s = String(s);
-    return s.trim();
+Group.prototype.desaturate = function (options) {
+    var shapes = _.map(this.shapes, function (shape) {
+        return shape.desaturate(options);
+    });
+    return new Group(shapes);
 };
 
-g.substring = function (s, start, end, endOffset) {
-    if (!s) { return ''; }
-    if (end < start) { return ''; }
-    s = String(s);
-
-    if (start < 0 && end < 0) {
-        start = s.length + start;
-        end = s.length + end;
-    }
+Group.prototype.invert = function () {
+    var shapes = _.map(this.shapes, function (shape) {
+        return shape.invert();
+    });
+    return new Group(shapes);
+};
 
-    if (end !== undefined) {
-        if (endOffset) {
-            end += 1;
+Group.prototype.bounds = function () {
+    if (this.shapes.length === 0) { return new Rect(0, 0, 0, 0); }
+    var i, r, shape,
+        shapes = this.shapes;
+    for (i = 0; i < shapes.length; i += 1) {
+        shape = shapes[i];
+        if (r === undefined) {
+            r = shape.bounds();
+        }
+        if ((shape.shapes && shape.shapes.length !== 0) ||
+            (shape.commands && shape.commands.length !== 0)) {
+            r = r.unite(shape.bounds());
         }
     }
-    return s.substring(start, end);
+    return (r !== undefined) ? r : new Rect(0, 0, 0, 0);
 };
 
-g.toCharacterCodes = function(s) {
-    if (!s) return [];
-    var codes = [];
-    codes.length = s.length;
-    for (var i = 0; i < s.length; i += 1) {
-        codes[i] = s.charCodeAt(i);
+// Returns true when point (x,y) falls within the contours of the group.
+Group.prototype.contains = function (x, y, precision) {
+    if (precision === undefined) { precision = 100; }
+    var i, shapes = this.shapes;
+    for (i = 0; i < shapes.length; i += 1) {
+        if (shapes[i].contains(x, y, precision)) {
+            return true;
+        }
     }
-    return codes;
-};
-
-g.toCharacters = function (s) {
-    if (!s) { return []; }
-    s = String(s);
-    return s.split('');
+    return false;
 };
 
-g.toLowerCase = function (s) {
-    s = String(s);
-    return s.toLowerCase();
+Group.prototype.length = function (precision) {
+    if (precision === undefined) { precision = 10; }
+    var sum = 0;
+    var shapes = this.shapes;
+    for (var i = 0; i < shapes.length; i += 1) {
+        sum += shapes[i].length(precision);
+    }
+    return sum;
 };
 
-g.toTitleCase = function (s) {
-    var c, result = '';
-    s = String(s);
-    for (var i = 0; i < s.length; i += 1) {
-        c = s[i];
-        if (result.length === 0 || result[result.length - 1] === ' ') {
-            result += c.toUpperCase();
-        } else {
-            result += c;
-        }
+Group.prototype.resampleByAmount = function (points, perContour) {
+    var path, shapes;
+    if (!perContour) {
+        path = new Path.combine(this);
+        return path.resampleByAmount(points, perContour);
     }
-    return result;
+
+    shapes = _.map(this.shapes, function (shape) {
+        return shape.resampleByAmount(points, perContour);
+    });
+    return new Group(shapes);
 };
 
-g.toUpperCase = function (s) {
-    s = String(s);
-    return s.toUpperCase();
+Group.prototype.resampleByLength = function (length) {
+    var shapes = _.map(this.shapes, function (shape) {
+        return shape.resampleByLength(length);
+    });
+    return new Group(shapes);
 };
 
-g.wordCount = function (s) {
-    if (!s) { return 0; }
-    s = String(s);
-    var split = s.split(new RegExp('\\w+'));
-    return split.length - 1;
+Group.prototype.toSVG = function () {
+    var l;
+    l = _.map(this.shapes, function (shape) {
+        return shape.toSVG();
+    });
+    return '<g>' + l.join('') + '</g>';
 };
 
-g.toWords = function (s) {
-    var l = s.split(/\W+/);
-    if (l[l.length - 1] === '') {
-        l.pop();
+// Draw the group to a 2D context.
+Group.prototype.draw = function (ctx) {
+    var i, shapes = this.shapes, nShapes = shapes.length;
+    for (i = 0; i < nShapes; i += 1) {
+        shapes[i].draw(ctx);
     }
-    return l;
 };
 
+module.exports = Group;
 
-module.exports = g;
+},{"../objects/color":27,"../objects/path":30,"../objects/rect":32,"lodash":2}],29:[function(require,module,exports){
+// 3-dimensional matrix
 
-},{}],24:[function(require,module,exports){
 'use strict';
 
-var randomGenerator = function (seed) {
-    // Note: the generator didn't work with negative seed values, so here we
-    // transform our original seed into a new (positive) seed value with which we
-    // create a new generator.
-    if (seed < 0) {
-        var gen = randomGenerator(Math.abs(seed));
-        for (var i = 0; i < 23; i += 1) {
-            gen();
-        }
-        return randomGenerator(gen(0, 10000));
-    }
+var Vec3 = require('../objects/vec3');
 
-    // Based on random number generator from
-    // http://indiegamr.com/generate-repeatable-random-numbers-in-js/
-    return function (min, max) {
-        min = min || 0;
-        max = max || 1;
-        seed = (seed * 9301 + 49297) % 233280;
-        var v = seed / 233280;
-        return min + v * (max - min);
-    };
+// Construct a 4x4 matrix.
+var Matrix4 = function (m) {
+    if (m !== undefined) {
+       // TODO Check for type and length
+        this.m = m;
+    } else {
+        m = new Float32Array(16);
+        m[0] = 1.0;
+        m[1] = 0.0;
+        m[2] = 0.0;
+        m[3] = 0.0;
+        m[4] = 0.0;
+        m[5] = 1.0;
+        m[6] = 0.0;
+        m[7] = 0.0;
+        m[8] = 0.0;
+        m[9] = 0.0;
+        m[10] = 1.0;
+        m[11] = 0.0;
+        m[12] = 0.0;
+        m[13] = 0.0;
+        m[14] = 0.0;
+        m[15] = 1.0;
+        this.m = m;
+    }
 };
 
-exports.randomGenerator = randomGenerator;
-},{}],25:[function(require,module,exports){
-// Draw objects to the canvas
+Matrix4.IDENTITY = new Matrix4();
+
+// Create a perspective matrix transformation.
+Matrix4.perspective = function (fov, aspect, zNear, zFar) {
+    var m = new Float32Array(Matrix4.IDENTITY.m),
+        tan = 1.0 / (Math.tan(fov * 0.5));
+
+    m[0] = tan / aspect;
+    m[1] = m[2] = m[3] = 0.0;
+    m[5] = tan;
+    m[4] = m[6] = m[7] = 0.0;
+    m[8] = m[9] = 0.0;
+    m[10] = -zFar / (zNear - zFar);
+    m[11] = 1.0;
+    m[12] = m[13] = m[15] = 0.0;
+    m[14] = (zNear * zFar) / (zNear - zFar);
+
+    return new Matrix4(m);
+};
 
-'use strict';
+Matrix4.lookAt = function (eye, target, up) {
+    var m, zAxis, xAxis, yAxis, ex, ey, ez;
+    m = new Float32Array(16);
+    zAxis = target.subtract(eye).normalize();
+    xAxis = Vec3.cross(up, zAxis).normalize();
+    yAxis = Vec3.cross(zAxis, xAxis).normalize();
 
-var Color = require('../objects/color');
+    ex = -Vec3.dot(xAxis, eye);
+    ey = -Vec3.dot(yAxis, eye);
+    ez = -Vec3.dot(zAxis, eye);
 
-var vg = {};
+    m[0] = xAxis.x;
+    m[1] = yAxis.x;
+    m[2] = zAxis.x;
+    m[3] = 0;
+    m[4] = xAxis.y;
+    m[5] = yAxis.y;
+    m[6] = zAxis.y;
+    m[7] = 0;
+    m[8] = xAxis.z;
+    m[9] = yAxis.z;
+    m[10] = zAxis.z;
+    m[11] = 0;
+    m[12] = ex;
+    m[13] = ey;
+    m[14] = ez;
+    m[15] = 1;
 
-// Return true if an object can be drawn using the `g.draw` function.
-vg.isDrawable = function (o) {
-    if (Array.isArray(o)) {
-        o = o[0];
-    }
-    if (!o) {
-        return false;
-    } else if (typeof o.draw === 'function') {
-        return true;
-    } else if (o.x !== undefined && o.y !== undefined) {
-        return true;
-    } else if (o.r !== undefined && o.g !== undefined && o.b !== undefined) {
-        return true;
-    } else {
-        return false;
-    }
+    return new Matrix4(m);
 };
 
-vg.drawPoints = function (ctx, points) {
-    var pt, i;
-    ctx.fillStyle = 'blue';
-    ctx.beginPath();
-    for (i = 0; i < points.length; i += 1) {
-        pt = points[i];
-        ctx.moveTo(pt.x, pt.y);
-        ctx.arc(pt.x, pt.y, 2, 0, Math.PI * 2, false);
-    }
-    ctx.fill();
-};
+// Return a new matrix with the inversion of this matrix.
+Matrix4.prototype.invert = function () {
+    var l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, l11, l12, l13, l14, l15, l16, l17, l18, l19, l20, l21, l22, l23, l24, l25, l26, l27, l28,
+        l29, l30, l31, l32, l33, l34, l35, l36, l37, l38, l39, m;
+    l1 = this.m[0];
+    l2 = this.m[1];
+    l3 = this.m[2];
+    l4 = this.m[3];
+    l5 = this.m[4];
+    l6 = this.m[5];
+    l7 = this.m[6];
+    l8 = this.m[7];
+    l9 = this.m[8];
+    l10 = this.m[9];
+    l11 = this.m[10];
+    l12 = this.m[11];
+    l13 = this.m[12];
+    l14 = this.m[13];
+    l15 = this.m[14];
+    l16 = this.m[15];
+    l17 = (l11 * l16) - (l12 * l15);
+    l18 = (l10 * l16) - (l12 * l14);
+    l19 = (l10 * l15) - (l11 * l14);
+    l20 = (l9 * l16) - (l12 * l13);
+    l21 = (l9 * l15) - (l11 * l13);
+    l22 = (l9 * l14) - (l10 * l13);
+    l23 = ((l6 * l17) - (l7 * l18)) + (l8 * l19);
+    l24 = -(((l5 * l17) - (l7 * l20)) + (l8 * l21));
+    l25 = ((l5 * l18) - (l6 * l20)) + (l8 * l22);
+    l26 = -(((l5 * l19) - (l6 * l21)) + (l7 * l22));
+    l27 = 1.0 / ((((l1 * l23) + (l2 * l24)) + (l3 * l25)) + (l4 * l26));
+    l28 = (l7 * l16) - (l8 * l15);
+    l29 = (l6 * l16) - (l8 * l14);
+    l30 = (l6 * l15) - (l7 * l14);
+    l31 = (l5 * l16) - (l8 * l13);
+    l32 = (l5 * l15) - (l7 * l13);
+    l33 = (l5 * l14) - (l6 * l13);
+    l34 = (l7 * l12) - (l8 * l11);
+    l35 = (l6 * l12) - (l8 * l10);
+    l36 = (l6 * l11) - (l7 * l10);
+    l37 = (l5 * l12) - (l8 * l9);
+    l38 = (l5 * l11) - (l7 * l9);
+    l39 = (l5 * l10) - (l6 * l9);
 
-vg.drawColoredPoints = function (ctx, points) {
-    for (var i = 0, n = points.length; i < n; i += 1) {
-        var pt = points[i];
-        ctx.fillStyle = Color.toCSS(pt);
-        ctx.fillRect(pt.x - 2, pt.y - 2, 4, 4);
-    }
+    m = new Float32Array(16);
+    m[0] = l23 * l27;
+    m[4] = l24 * l27;
+    m[8] = l25 * l27;
+    m[12] = l26 * l27;
+    m[1] = -(((l2 * l17) - (l3 * l18)) + (l4 * l19)) * l27;
+    m[5] = (((l1 * l17) - (l3 * l20)) + (l4 * l21)) * l27;
+    m[9] = -(((l1 * l18) - (l2 * l20)) + (l4 * l22)) * l27;
+    m[13] = (((l1 * l19) - (l2 * l21)) + (l3 * l22)) * l27;
+    m[2] = (((l2 * l28) - (l3 * l29)) + (l4 * l30)) * l27;
+    m[6] = -(((l1 * l28) - (l3 * l31)) + (l4 * l32)) * l27;
+    m[10] = (((l1 * l29) - (l2 * l31)) + (l4 * l33)) * l27;
+    m[14] = -(((l1 * l30) - (l2 * l32)) + (l3 * l33)) * l27;
+    m[3] = -(((l2 * l34) - (l3 * l35)) + (l4 * l36)) * l27;
+    m[7] = (((l1 * l34) - (l3 * l37)) + (l4 * l38)) * l27;
+    m[11] = -(((l1 * l35) - (l2 * l37)) + (l4 * l39)) * l27;
+    m[15] = (((l1 * l36) - (l2 * l38)) + (l3 * l39)) * l27;
+    return new Matrix4(m);
 };
 
-vg.drawRectangles = function (ctx, rectangles) {
-    var i, r;
-    ctx.save();
-    for (i = 0; i < rectangles.length; i += 1) {
-        r = rectangles[i];
-        ctx.strokeStyle = 'black';
-        ctx.strokeWidth = 1;
-        ctx.rect(r.x, r.y, r.width, r.height);
-        ctx.stroke();
-    }
-    ctx.restore();
-};
+Matrix4.prototype.multiply = function (other) {
+    var m = new Float32Array(16);
 
-vg.drawColors = function (ctx, colors) {
-    var i, c;
-    ctx.save();
-    for (i = 0; i < colors.length; i += 1) {
-        c = colors[i];
-        ctx.fillStyle = Color.toCSS(c);
-        ctx.fillRect(0, 0, 30, 30);
-        ctx.translate(30, 0);
-    }
-    ctx.restore();
-};
+    m[0] = this.m[0] * other.m[0] + this.m[1] * other.m[4] + this.m[2] * other.m[8] + this.m[3] * other.m[12];
+    m[1] = this.m[0] * other.m[1] + this.m[1] * other.m[5] + this.m[2] * other.m[9] + this.m[3] * other.m[13];
+    m[2] = this.m[0] * other.m[2] + this.m[1] * other.m[6] + this.m[2] * other.m[10] + this.m[3] * other.m[14];
+    m[3] = this.m[0] * other.m[3] + this.m[1] * other.m[7] + this.m[2] * other.m[11] + this.m[3] * other.m[15];
 
-vg.draw = function (ctx, o) {
-    var k = o;
-    var isArray = false;
-    if (Array.isArray(o)) {
-        k = o[0];
-        isArray = true;
-    }
+    m[4] = this.m[4] * other.m[0] + this.m[5] * other.m[4] + this.m[6] * other.m[8] + this.m[7] * other.m[12];
+    m[5] = this.m[4] * other.m[1] + this.m[5] * other.m[5] + this.m[6] * other.m[9] + this.m[7] * other.m[13];
+    m[6] = this.m[4] * other.m[2] + this.m[5] * other.m[6] + this.m[6] * other.m[10] + this.m[7] * other.m[14];
+    m[7] = this.m[4] * other.m[3] + this.m[5] * other.m[7] + this.m[6] * other.m[11] + this.m[7] * other.m[15];
 
-    if (k) {
-        if (typeof k.draw === 'function') {
-            if (isArray) {
-                for (var i = 0, n = o.length; i < n; i += 1) {
-                    vg.draw(ctx, o[i]);
-                }
-            } else {
-                o.draw(ctx);
-            }
-        } else if (k.x !== undefined && k.y !== undefined) {
-            if (k.r !== undefined && k.g !== undefined && k.b !== undefined) {
-                vg.drawColoredPoints(ctx, isArray ? o : [o]);
-            } else if (k.width !== undefined && k.height !== undefined) {
-                vg.drawRectangles(ctx, isArray ? o : [o]);
-            } else {
-                vg.drawPoints(ctx, isArray ? o : [o]);
-            }
-        } else if (k.r !== undefined && k.g !== undefined && k.b !== undefined) {
-            vg.drawColors(ctx, isArray ? o : [o]);
-        }
-    }
-};
+    m[8] = this.m[8] * other.m[0] + this.m[9] * other.m[4] + this.m[10] * other.m[8] + this.m[11] * other.m[12];
+    m[9] = this.m[8] * other.m[1] + this.m[9] * other.m[5] + this.m[10] * other.m[9] + this.m[11] * other.m[13];
+    m[10] = this.m[8] * other.m[2] + this.m[9] * other.m[6] + this.m[10] * other.m[10] + this.m[11] * other.m[14];
+    m[11] = this.m[8] * other.m[3] + this.m[9] * other.m[7] + this.m[10] * other.m[11] + this.m[11] * other.m[15];
 
-vg.toSVG = function (o, options) {
-    options = options || {};
-    var includeHeader = options.header === true;
-    var x = options.x !== undefined ? options.x : 0;
-    var y = options.y !== undefined ? options.y : 0;
-    var width = options.width !== undefined ? options.width : 500;
-    var height = options.height !== undefined ? options.height : 500;
-    var svg = '';
-    if (o) {
-        if (typeof o.toSVG === 'function') {
-            svg = o.toSVG();
-        } else if (Array.isArray(o)) {
-            svg = '<g>\n';
-            for (var i = 0, n = o.length; i < n; i += 1) {
-                svg += vg.toSVG(o[i]) + '\n';
-            }
-            svg += '</g>\n';
-        }
-    }
-    if (includeHeader) {
-        svg = '<?xml version="1.0" encoding="utf-8"?>' +
-            '<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" ' +
-            'x="' + x + '" y="' + y + '" width="' + width + 'px" height="' + height + 'px"' +
-            ' viewBox="' + x + ' ' + y + ' ' + width + ' ' + height + '">\n' +
-            svg +
-            '</svg>\n';
-    }
-    return svg;
+    m[12] = this.m[12] * other.m[0] + this.m[13] * other.m[4] + this.m[14] * other.m[8] + this.m[15] * other.m[12];
+    m[13] = this.m[12] * other.m[1] + this.m[13] * other.m[5] + this.m[14] * other.m[9] + this.m[15] * other.m[13];
+    m[14] = this.m[12] * other.m[2] + this.m[13] * other.m[6] + this.m[14] * other.m[10] + this.m[15] * other.m[14];
+    m[15] = this.m[12] * other.m[3] + this.m[13] * other.m[7] + this.m[14] * other.m[11] + this.m[15] * other.m[15];
+
+    return new Matrix4(m);
 };
 
-module.exports = vg;
+Matrix4.prototype.translate = function (tx, ty, tz) {
+    var m = new Float32Array(this.m);
+    m[12] += tx;
+    m[13] += ty;
+    m[14] += tz;
+    return new Matrix4(m);
+};
 
-},{"../objects/color":28}],26:[function(require,module,exports){
-// Object creation / manipulation commands
+module.exports = Matrix4;
+},{"../objects/vec3":36}],30:[function(require,module,exports){
+// Bézier path object
 
 'use strict';
 
 var _ = require('lodash');
-var ClipperLib = require('js-clipper');
+
 var bezier = require('../util/bezier');
 var geo = require('../util/geo');
 var math = require('../util/math');
-var random = require('../util/random');
 
 var Color = require('../objects/color');
-var Group = require('../objects/group');
-var Path = require('../objects/path');
-var Point = require('../objects/point');
 var Rect = require('../objects/rect');
-var Transform = require('../objects/transform');
-var Transformable = require('../objects/transformable');
+
+var MOVETO  = bezier.MOVETO;
+var LINETO  = bezier.LINETO;
+var QUADTO  = bezier.QUADTO;
+var CURVETO = bezier.CURVETO;
+var CLOSE   = bezier.CLOSE;
+
+var CLOSE_COMMAND = Object.freeze({ type: CLOSE });
+
+var KAPPA = 0.5522847498307936; // (-1 + Math.sqrt(2)) / 3 * 4
 
 function _cloneCommand(cmd) {
     var newCmd = {type: cmd.type};
-    if (newCmd.type !== bezier.CLOSE) {
+    if (newCmd.type !== CLOSE) {
         newCmd.x = cmd.x;
         newCmd.y = cmd.y;
     }
-    if (newCmd.type === bezier.QUADTO) {
+    if (newCmd.type === QUADTO) {
         newCmd.x1 = cmd.x1;
         newCmd.y1 = cmd.y1;
-    } else if (newCmd.type === bezier.CURVETO) {
+    } else if (newCmd.type === CURVETO) {
         newCmd.x1 = cmd.x1;
         newCmd.y1 = cmd.y1;
         newCmd.x2 = cmd.x2;
@@ -29376,4858 +33482,9882 @@ function _cloneCommand(cmd) {
     return newCmd;
 }
 
-var vg = {};
+var Path = function (commands, fill, stroke, strokeWidth) {
+    this.commands = commands !== undefined ? commands : [];
+    this.fill = fill !== undefined ? fill : 'black';
+    this.stroke = stroke !== undefined ? stroke : null;
+    this.strokeWidth = strokeWidth !== undefined ? strokeWidth : 1;
+};
 
-vg.HORIZONTAL = 'horizontal';
-vg.VERTICAL = 'vertical';
+Path.prototype.clone = function () {
+    var p = new Path(),
+        n = this.commands.length,
+        i;
+    p.commands.length = this.commands.length;
+    for (i = 0; i < n; i += 1) {
+        p.commands[i] = _cloneCommand(this.commands[i]);
+    }
+    p.fill = Color.clone(this.fill);
+    p.stroke =  Color.clone(this.stroke);
+    p.strokeWidth = this.strokeWidth;
+    return p;
+};
 
-vg.EAST = 'e';
-vg.WEST = 'w';
-vg.NORTH = 'n';
-vg.SOUTH = 's';
+Path.prototype.extend = function (commandsOrPath) {
+    var commands = commandsOrPath.commands || commandsOrPath;
+    Array.prototype.push.apply(this.commands, commands);
+};
 
-vg.bounds = function (o) {
-    var r, i, n;
-    if (!o) {
-        return new Rect();
-    } else if (typeof o.bounds === 'function') {
-        return o.bounds();
-    } else if (o.x !== undefined && o.y !== undefined) {
-        if (o.width !== undefined && o.height !== undefined) {
-            return new Rect(o.x, o.y, o.width, o.height);
-        } else {
-            return new Rect(o.x, o.y, 0, 0);
-        }
-    } else if (o.r !== undefined && o.g !== undefined && o.b !== undefined) {
-        return new vg.Rect(0, 0, 30, 30);
-    } else if (Array.isArray(o)) {
-        r = null;
-        n = o.length;
-        // A color array is special since the colors have no inherent position.
-        if (n > 0 && o[0].r !== undefined && o[0].g !== undefined && o[0].b !== undefined) {
-            return new Rect(0, 0, o.length * 30, 30);
-        }
-        for (i = 0; i < n; i += 1) {
-            if (!r) {
-                r = vg.bounds(o[i]);
-            } else {
-                r = r.unite(vg.bounds(o[i]));
-            }
-        }
-        return r || new Rect();
-    } else {
-        return new Rect();
-    }
+Path.prototype.moveTo = function (x, y) {
+    this.commands.push({type: MOVETO, x: x, y: y});
 };
 
-vg.makeCenteredRect = function (cx, cy, width, height) {
-    var x = cx - width / 2,
-        y = cy - height / 2;
-    return new Rect(x, y, width, height);
+Path.prototype.lineTo = function (x, y) {
+    this.commands.push({type: LINETO, x: x, y: y});
 };
 
-vg.makePoint = function (x, y) {
-    return new Point(x, y);
+Path.prototype.curveTo = function (x1, y1, x2, y2, x, y) {
+    this.commands.push({type: CURVETO, x1: x1, y1: y1, x2: x2, y2: y2, x: x, y: y});
 };
 
-vg.makeRect = function (x, y, width, height) {
-    return new Rect(x, y, width, height);
+Path.prototype.quadTo = function (x1, y1, x, y) {
+    var prevX = this.commands[this.commands.length - 1].x,
+        prevY = this.commands[this.commands.length - 1].y,
+        cp1x = prevX + 2 / 3 * (x1 - prevX),
+        cp1y = prevY + 2 / 3 * (y1 - prevY),
+        cp2x = cp1x + 1 / 3 * (x - prevX),
+        cp2y = cp1y + 1 / 3 * (y - prevY);
+    this.curveTo(cp1x, cp1y, cp2x, cp2y, x, y);
 };
 
-// Combine all given shape arguments into a new group.
-// This function works like makeGroup, except that this can take any number
-// of arguments.
-vg.merge = function () {
-    return new Group(_.reject(_.flatten(arguments, true), _.isEmpty));
+Path.prototype.closePath = Path.prototype.close = function () {
+    this.commands.push(CLOSE_COMMAND);
 };
 
-vg.combinePaths = function (shape) {
-    return Path.combine(shape);
+Path.prototype.isClosed = function () {
+    if (this.commands.length === 0) { return false; }
+    return this.commands[this.commands.length - 1].type === CLOSE;
 };
 
-vg.shapePoints = vg.toPoints = function (shape) {
-    if (!shape) {
-        return [];
+Path.prototype.addRect = function (x, y, width, height) {
+    this.moveTo(x, y);
+    this.lineTo(x + width, y);
+    this.lineTo(x + width, y + height);
+    this.lineTo(x, y + height);
+    this.close();
+};
+
+Path.prototype.addRoundedRect = function (cx, cy, width, height, rx, ry) {
+    var ONE_MINUS_QUARTER = 1.0 - 0.552,
+
+        dx = rx,
+        dy = ry,
+
+        left = cx,
+        right = cx + width,
+        top = cy,
+        bottom = cy + height;
+
+    // rx/ry cannot be greater than half of the width of the rectangle
+    // (required by SVG spec)
+    dx = Math.min(dx, width * 0.5);
+    dy = Math.min(dy, height * 0.5);
+    this.moveTo(left + dx, top);
+    if (dx < width * 0.5) {
+        this.lineTo(right - rx, top);
     }
-    if (shape.commands) {
-        return _.map(_.filter(shape.commands, function (cmd) { if (cmd.x !== undefined) { return true; } return false; }), function (cmd) { return new Point(cmd.x, cmd.y); });
+    this.curveTo(right - dx * ONE_MINUS_QUARTER, top, right, top + dy * ONE_MINUS_QUARTER, right, top + dy);
+    if (dy < height * 0.5) {
+        this.lineTo(right, bottom - dy);
     }
-    var i, points = [];
-    for (i = 0; i < shape.shapes.length; i += 1) {
-        points = points.concat(vg.shapePoints(shape.shapes[i]));
+    this.curveTo(right, bottom - dy * ONE_MINUS_QUARTER, right - dx * ONE_MINUS_QUARTER, bottom, right - dx, bottom);
+    if (dx < width * 0.5) {
+        this.lineTo(left + dx, bottom);
     }
-    return points;
+    this.curveTo(left + dx * ONE_MINUS_QUARTER, bottom, left, bottom - dy * ONE_MINUS_QUARTER, left, bottom - dy);
+    if (dy < height * 0.5) {
+        this.lineTo(left, top + dy);
+    }
+    this.curveTo(left, top + dy * ONE_MINUS_QUARTER, left + dx * ONE_MINUS_QUARTER, top, left + dx, top);
+    this.close();
 };
 
-// FILTERS //////////////////////////////////////////////////////////////
+Path.prototype.addEllipse = function (x, y, width, height) {
+    var dx = KAPPA * 0.5 * width;
+    var dy = KAPPA * 0.5 * height;
+    var x0 = x + 0.5 * width;
+    var y0 = y + 0.5 * height;
+    var x1 = x + width;
+    var y1 = y + height;
 
-vg.colorize = function (shape, fill, stroke, strokeWidth) {
-    if (!shape) {
-        return;
-    }
-    return shape.colorize(fill, stroke, strokeWidth);
+    this.moveTo(x, y0);
+    this.curveTo(x, y0 - dy, x0 - dx, y, x0, y);
+    this.curveTo(x0 + dx, y, x1, y0 - dy, x1, y0);
+    this.curveTo(x1, y0 + dy, x0 + dx, y1, x0, y1);
+    this.curveTo(x0 - dx, y1, x, y0 + dy, x, y0);
+    this.close();
 };
 
-vg.translate = function (shape, position) {
-    if (shape.translate) {
-        return shape.translate(position);
-    }
-    return Transformable.translate.apply(shape, [position]);
+Path.prototype.addLine = function (x1, y1, x2, y2) {
+    this.moveTo(x1, y1);
+    this.lineTo(x2, y2);
 };
 
-vg.scale = function (shape, scale, origin) {
-    if (shape.scale) {
-        return shape.scale(scale, origin);
-    }
-    return Transformable.scale.apply(shape, [scale, origin]);
+Path.prototype.addQuad = function (x1, y1, x2, y2, x3, y3, x4, y4) {
+    this.moveTo(x1, y1);
+    this.lineTo(x2, y2);
+    this.lineTo(x3, y3);
+    this.lineTo(x4, y4);
+    this.close();
 };
 
-vg.rotate = function (shape, angle, origin) {
-    if (shape.rotate) {
-        return shape.rotate(angle, origin);
+Path.prototype.addArc = function (x, y, width, height, startAngle, degrees, arcType) {
+    arcType = arcType || 'pie';
+    var w, h, angStRad, ext, arcSegs, increment, cv, lineSegs,
+        index, angle, relX, relY, coords;
+    w = width / 2;
+    h = height / 2;
+    angStRad = math.radians(startAngle);
+    ext = degrees;
+
+    if (ext >= 360.0 || ext <= -360) {
+        arcSegs = 4;
+        increment = Math.PI / 2;
+        cv = 0.5522847498307933;
+        if (ext < 0) {
+            increment = -increment;
+            cv = -cv;
+        }
+    } else {
+        arcSegs = Math.ceil(Math.abs(ext) / 90.0);
+        increment = math.radians(ext / arcSegs);
+        cv = 4.0 / 3.0 * Math.sin(increment / 2.0) / (1.0 + Math.cos(increment / 2.0));
+        if (cv === 0) {
+            arcSegs = 0;
+        }
     }
-    return Transformable.rotate.apply(shape, [angle, origin]);
-};
 
-vg.skew = function (shape, skew, origin) {
-    if (shape.skew) {
-        return shape.skew(skew, origin);
+    if (arcType === 'open') {
+        lineSegs = 0;
+    } else if (arcType === 'chord') {
+        lineSegs = 1;
+    } else if (arcType === 'pie') {
+        lineSegs = 2;
     }
-    return Transformable.skew.apply(shape, [skew, origin]);
-};
 
-vg.copy = function (shape, copies, order, translate, rotate, scale) {
-    var i, t, j, op,
-        shapes = [],
-        tx = 0,
-        ty = 0,
-        r = 0,
-        sx = 1.0,
-        sy = 1.0;
-    for (i = 0; i < copies; i += 1) {
-        t = new Transform();
-        for (j = 0; j < order.length; j += 1) {
-            op = order[j];
-            if (op === 't') {
-                t = t.translate(tx, ty);
-            } else if (op === 'r') {
-                t = t.rotate(r);
-            } else if (op === 's') {
-                t = t.scale(sx, sy);
+    if (w < 0 || h < 0) {
+        arcSegs = lineSegs = -1;
+    }
+
+    index = 0;
+    while (index <= arcSegs + lineSegs) {
+        angle = angStRad;
+        if (index === 0) {
+            this.moveTo(x + Math.cos(angle) * w, y + Math.sin(angle) * h);
+        } else if (index > arcSegs) {
+            if (index === arcSegs + lineSegs) {
+                this.close();
+            } else {
+                this.lineTo(x, y);
             }
-        }
-        if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
-            shapes = shapes.concat(t.transformShape(shape));
         } else {
-            shapes.push(t.transformShape(shape));
+            angle += increment * (index - 1);
+            relX = Math.cos(angle);
+            relY = Math.sin(angle);
+            coords = [];
+            coords.push(x + (relX - cv * relY) * w);
+            coords.push(y + (relY + cv * relX) * h);
+            angle += increment;
+            relX = Math.cos(angle);
+            relY = Math.sin(angle);
+            coords.push(x + (relX + cv * relY) * w);
+            coords.push(y + (relY - cv * relX) * h);
+            coords.push(x + relX * w);
+            coords.push(y + relY * h);
+            Path.prototype.curveTo.apply(this, coords);
         }
-
-        tx += translate.x;
-        ty += translate.y;
-        r += rotate;
-        sx += scale.x;
-        sy += scale.y;
+        index += 1;
     }
-    return shapes;
 };
 
-vg.fit = function (shape, position, width, height, stretch) {
-    if (!shape) {
-        return;
+Path.prototype.colorize = function (options) {
+    var args = arguments;
+    if (typeof options !== 'object' || options instanceof Color) {
+        options = {};
+        if (args[0] !== undefined) { options.fill = args[0]; }
+        if (args[1] !== undefined) { options.stroke = args[1]; }
+        if (args[2] !== undefined) { options.strokeWidth = args[2]; }
     }
-    stretch = stretch !== undefined ? stretch : false;
-    var t, sx, sy,
-        bounds = vg.bounds(shape),
-        bx = bounds.x,
-        by = bounds.y,
-        bw = bounds.width,
-        bh = bounds.height;
-
-    // Make sure bw and bh aren't infinitely small numbers.
-    // This will lead to incorrect transformations with for examples lines.
-    bw = (bw > 0.000000000001) ? bw : 0;
-    bh = (bh > 0.000000000001) ? bh : 0;
-
-    t = new Transform();
-    t = t.translate(position.x, position.y);
-
-    if (!stretch) {
-        // don't scale widths or heights that are equal to zero.
-        sx = (bw > 0) ? (width / bw) : Number.MAX_VALUE;
-        sy = (bh > 0) ? (height / bh) : Number.MAX_VALUE;
-        sx = sy = Math.min(sx, sy);
-    } else {
-        sx = (bw > 0) ? (width / bw) : 1;
-        sy = (bh > 0) ? (height / bh) : 1;
+    var p = this.clone();
+    if (options.fill) {
+        p.fill = Color.clone(options.fill);
     }
-
-    t = t.scale(sx, sy);
-    t = t.translate(-bw / 2 - bx, -bh / 2 - by);
-
-    return t.transformShape(shape);
+    if (options.stroke) {
+        p.stroke = Color.clone(options.stroke);
+    }
+    if (options.strokeWidth || options.strokeWidth === 0) {
+        p.strokeWidth = options.strokeWidth;
+    }
+    return p;
 };
 
-// Fit the given shape to the bounding shape.
-// If stretch = true, proportions will be distorted.
-vg.fitTo = function (shape, bounding, stretch) {
-    if (!shape) {
-        return;
+Path.prototype.desaturate = function (options) {
+    var p = this.clone();
+    var fill = p.fill;
+    var stroke = p.stroke;
+    if (!(fill instanceof Color)) {
+        fill = Color.parse(fill);
     }
-    if (!bounding) {
-        return;
+    if (!(stroke instanceof Color)) {
+        stroke = Color.parse(stroke);
     }
-
-    var bounds = vg.bounds(bounding),
-        bx = bounds.x,
-        by = bounds.y,
-        bw = bounds.width,
-        bh = bounds.height;
-
-    return vg.fit(shape, {x: bx + bw / 2, y: by + bh / 2}, bw, bh, stretch);
+    p.fill = fill.desaturate(options);
+    p.stroke = stroke.desaturate(options);
+    return p;
 };
 
-vg.mirror = function (shape, angle, origin, keepOriginal) {
-    if (!shape) {
-        return;
+Path.prototype.invert = function () {
+    var p = this.clone();
+    var fill = p.fill;
+    var stroke = p.stroke;
+    if (!(fill instanceof Color)) {
+        fill = Color.parse(fill);
     }
-    origin = origin || new Point();
-    if (angle !== 0) {
-        angle = angle || 90;
+    if (!(stroke instanceof Color)) {
+        stroke = Color.parse(stroke);
     }
+    p.fill = fill.invert();
+    p.stroke = stroke.invert();
+    return p;
+};
 
-    var f = function (x, y) {
-        var d = geo.distance(x, y, origin.x, origin.y),
-            a = geo.angle(x, y, origin.x, origin.y),
-            pt = geo.coordinates(origin.x, origin.y, 180 + angle, d * Math.cos(math.radians(a - angle)));
-        d = geo.distance(x, y, pt.x, pt.y);
-        a = geo.angle(x, y, pt.x, pt.y);
-        pt = geo.coordinates(x, y, a, d * 2);
-        return new Point(pt.x, pt.y);
-    };
-
-    var mirrorPath, mirrorPoints, mirrorGroup, mirror;
-
-    mirrorPath = function (path) {
-        var pt, ctrl1, ctrl2;
-        var p = new Path([], path.fill, path.stroke, path.strokeWidth);
-        for (var i = 0; i < path.commands.length; i += 1) {
-            var cmd = path.commands[i];
-            if (cmd.type === bezier.MOVETO) {
-                pt = f(cmd.x, cmd.y);
-                p.moveTo(pt.x, pt.y);
-            } else if (cmd.type === bezier.LINETO) {
-                pt = f(cmd.x, cmd.y);
-                p.lineTo(pt.x, pt.y);
-            } else if (cmd.type === bezier.CURVETO) {
-                pt = f(cmd.x, cmd.y);
-                ctrl1 = f(cmd.x1, cmd.y1);
-                ctrl2 = f(cmd.x2, cmd.y2);
-                p.curveTo(ctrl1.x, ctrl1.y, ctrl2.x, ctrl2.y, pt.x, pt.y);
-            } else if (cmd.type === bezier.CLOSE) {
-                p.close();
-            } else {
-                throw new Error('Unknown command ' + cmd);
+Path.prototype.contours = function () {
+    var contours = [],
+        currentContour = [];
+    _.each(this.commands, function (cmd) {
+        if (cmd.type === MOVETO) {
+            if (currentContour.length !== 0) {
+                contours.push(currentContour);
             }
+            currentContour = [cmd];
+        } else {
+            currentContour.push(cmd);
         }
-        return p;
-    };
+    });
 
-    mirrorPoints = function (points) {
-        return _.map(points, function (point) {
-            return f(point.x, point.y);
-        });
-    };
+    if (currentContour.length !== 0) {
+        contours.push(currentContour);
+    }
 
-    mirrorGroup = function (group) {
-        var shapes = _.map(group.shapes, function (shape) {
-            return mirror(shape);
-        });
-        return new Group(shapes);
-    };
+    return contours;
+};
 
-    mirror = function (shape) {
-        if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
-            return mirrorPoints(shape);
-        }
-        var fn = (shape.shapes) ? mirrorGroup : mirrorPath;
-        return fn(shape);
-    };
+Path.prototype.bounds = function () {
+    if (this._bounds) { return this._bounds; }
+    if (this.commands.length === 0) { return new Rect(0, 0, 0, 0); }
 
-    var newShape = mirror(shape);
+    var px, py, prev, right, bottom,
+        minX = Number.MAX_VALUE,
+        minY = Number.MAX_VALUE,
+        maxX = -(Number.MAX_VALUE),
+        maxY = -(Number.MAX_VALUE);
 
-    if (keepOriginal) {
-        if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
-            return shape.concat(newShape);
+    _.each(this.commands, function (cmd) {
+        if (cmd.type === MOVETO || cmd.type === LINETO) {
+            px = cmd.x;
+            py = cmd.y;
+            if (px < minX) { minX = px; }
+            if (py < minY) { minY = py; }
+            if (px > maxX) { maxX = px; }
+            if (py > maxY) { maxY = py; }
+            prev = cmd;
+        } else if (cmd.type === CURVETO) {
+            var r = bezier.extrema(prev.x, prev.y, cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x, cmd.y);
+            right = r.x + r.width;
+            bottom = r.y + r.height;
+            if (r.x < minX) { minX = r.x; }
+            if (right > maxX) { maxX = right; }
+            if (r.y < minY) { minY = r.y; }
+            if (bottom > maxY) { maxY = bottom; }
+            prev = cmd;
         }
-        return new Group([shape, newShape]);
-    } else {
-        return newShape;
+    });
+
+    return new Rect(minX, minY, maxX - minX, maxY - minY);
+};
+
+// Returns the DynamicPathElement at time t (0.0-1.0) on the path.
+Path.prototype.point = function (t, segmentLengths) {
+    if (segmentLengths === undefined) {
+        // Cache the segment lengths for performance.
+        segmentLengths = bezier.segmentLengths(this.commands, true, 10);
     }
+    return bezier.point(this, t, segmentLengths);
 };
 
-vg.pathLength = function (shape, options) {
-    var precision = 20;
-    if (options && options.precision) {
-        precision = options.precision;
+// Returns an array of DynamicPathElements along the path.
+// To omit the last point on closed paths: {end: 1-1.0/amount}
+Path.prototype.points = function (amount, options) {
+    var start = (options && options.start !== undefined) ? options.start : 0.0;
+    var end = (options && options.end !== undefined) ? options.end : 1.0;
+    if (this.commands.length === 0) {
+        // Otherwise bezier.point() will raise an error for empty paths.
+        return [];
+    }
+    amount = Math.round(amount);
+    // "d" is the delta value for each point.
+    // For closed paths (e.g. a circle), we don't want the last point, because it will equal the first point.
+    // For open paths (e.g. a line) we do want the last point, so we use amount - 1.
+    // E.g. If amount=4, and path is open, we want the point at t 0.0, 0.33, 0.66 and 1.0.
+    // E.g. If amount=2, and path is open, we want the point at t 0.0 and 1.0.
+    var d;
+    if (options && options.closed) {
+        d = (amount > 1) ? (end - start) / amount : (end - start);
+    } else {
+        d = (amount > 1) ? (end - start) / (amount - 1) : (end - start);
+    }
+    var pts = [];
+    var segmentLengths = bezier.segmentLengths(this.commands, true, 10);
+    for (var i = 0; i < amount; i += 1) {
+        pts.push(this.point(start + d * i, segmentLengths));
     }
-    return shape.length(precision);
+    return pts;
 };
 
-vg.resampleByLength = function (shape, maxLength) {
-    if (!shape) { return; }
-    return shape.resampleByLength(maxLength);
+// Returns an approximation of the total length of the path.
+Path.prototype.length = function (precision) {
+    if (precision === undefined) { precision = 20; }
+    return bezier.length(this, precision);
 };
 
-vg.resampleByAmount = function (shape, amount, perContour) {
-    if (!shape) { return; }
-    return shape.resampleByAmount(amount, perContour);
+// Returns true when point (x,y) falls within the contours of the path.
+Path.prototype.contains = function (x, y, precision) {
+    var points = this.points(precision !== undefined ? precision : 100);
+    return geo.pointInPolygon(points, x, y);
 };
 
-vg.wigglePoints = function (shape, offset, seed) {
-    seed = seed !== undefined ? seed : Math.random();
-    var rand = random.generator(seed);
-    if (offset === undefined) {
-        offset = {x: 10, y: 10};
-    } else if (typeof offset === 'number') {
-        offset = {x: offset, y: offset};
-    }
-    var wigglePoints = function (shape) {
-        var i, dx, dy;
-        if (shape.commands) {
-            var p = new Path([], shape.fill, shape.stroke, shape.strokeWidth);
-            for (i = 0; i < shape.commands.length; i += 1) {
-                dx = (rand(0, 1) - 0.5) * offset.x * 2;
-                dy = (rand(0, 1) - 0.5) * offset.y * 2;
-                var cmd = shape.commands[i];
-                if (cmd.type === bezier.MOVETO) {
-                    p.moveTo(cmd.x + dx, cmd.y + dy);
-                } else if (cmd.type === bezier.LINETO) {
-                    p.lineTo(cmd.x + dx, cmd.y + dy);
-                } else if (cmd.type === bezier.CURVETO) {
-                    p.curveTo(cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x + dx, cmd.y + dy);
-                } else if (cmd.type === bezier.CLOSE) {
-                    p.close();
-                }
-            }
-            return p;
-        } else if (shape.shapes) {
-            return new Group(_.map(shape.shapes, wigglePoints));
-        } else if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined){
-            var points = [];
-            for (i = 0; i < shape.length; i += 1) {
-                dx = (rand(0, 1) - 0.5) * offset.x * 2;
-                dy = (rand(0, 1) - 0.5) * offset.y * 2;
-                points.push(new Point(shape[i].x + dx, shape[i].y + dy));
+Path.prototype.resampleByAmount = function (points, perContour) {
+    var subPaths = perContour ? this.contours() : [this.commands];
+    var p = new Path([], this.fill, this.stroke, this.strokeWidth);
+    for (var j = 0; j < subPaths.length; j += 1) {
+        var subPath = new Path(subPaths[j]);
+        var options = {};
+        if (subPath.isClosed()) {
+            options.closed = true;
+        }
+        var pts = subPath.points(points, options);
+        for (var i = 0; i < pts.length; i += 1) {
+            if (i === 0) {
+                p.moveTo(pts[i].x, pts[i].y);
+            } else {
+                p.lineTo(pts[i].x, pts[i].y);
             }
-            return points;
-        } else {
-            return _.map(shape, wigglePoints);
         }
-    };
-    return wigglePoints(shape);
+        if (subPath.isClosed()) {
+            p.close();
+        }
+    }
+    return p;
 };
 
-vg.wiggleContours = function (shape, offset, seed) {
-    seed = seed !== undefined ? seed : Math.random();
-    var rand = random.generator(seed);
-    if (offset === undefined) {
-        offset = {x: 10, y: 10};
-    } else if (typeof offset === 'number') {
-        offset = {x: offset, y: offset};
+Path.prototype.resampleByLength = function (segmentLength, options) {
+    options = options || {};
+    var force = options.force || false;
+    var subPaths = this.contours();
+    var commands = [];
+    if (!force) {
+        segmentLength = Math.max(segmentLength, 1);
     }
-    var wiggleContours = function (shape) {
-        if (shape.commands) {
-            var i, dx, dy, t,
-                subPaths = shape.contours(),
-                commands = [];
-            for (i = 0; i < subPaths.length; i += 1) {
-                dx = (rand(0, 1) - 0.5) * offset.x * 2;
-                dy = (rand(0, 1) - 0.5) * offset.y * 2;
-                t = new Transform().translate(dx, dy);
-                commands = commands.concat(t.transformShape(new Path(subPaths[i])).commands);
+    for (var i = 0; i < subPaths.length; i += 1) {
+        var subPath = new Path(subPaths[i]);
+        var contourLength = subPath.length();
+        var amount = Math.ceil(contourLength / segmentLength);
+        commands = commands.concat(subPath.resampleByAmount(amount).commands);
+    }
+    return new Path(commands, this.fill, this.stroke, this.strokeWidth);
+};
+
+Path.prototype.toPathData = function () {
+    var i, d, cmd, x, y, x1, y1, x2, y2;
+    d = '';
+    for (i = 0; i < this.commands.length; i += 1) {
+        cmd = this.commands[i];
+        if (cmd.x !== undefined) {
+            x = math.clamp(cmd.x, -9999, 9999);
+            y = math.clamp(cmd.y, -9999, 9999);
+        }
+        if (cmd.x1 !== undefined) {
+            x1 = math.clamp(cmd.x1, -9999, 9999);
+            y1 = math.clamp(cmd.y1, -9999, 9999);
+        }
+        if (cmd.x2 !== undefined) {
+            x2 = math.clamp(cmd.x2, -9999, 9999);
+            y2 = math.clamp(cmd.y2, -9999, 9999);
+        }
+        if (cmd.type === MOVETO) {
+            if (!isNaN(x) && !isNaN(y)) {
+                d += 'M' + x + ' ' + y;
             }
-            return new Path(commands, shape.fill, shape.stroke, shape.strokeWidth);
-        } else if (shape.shapes) {
-            return new Group(_.map(shape.shapes, wiggleContours));
-        } else {
-            return _.map(shape, wiggleContours);
+        } else if (cmd.type === LINETO) {
+            if (!isNaN(x) && !isNaN(y)) {
+                d += 'L' + x + ' ' + y;
+            }
+        } else if (cmd.type === QUADTO) {
+            if (!isNaN(x) && !isNaN(y) && !isNaN(x1) && !isNaN(y1)) {
+                d += 'Q' + x1 + ' ' + y1 + ' ' + x + ' ' + y;
+            }
+        } else if (cmd.type === CURVETO) {
+            if (!isNaN(x) && !isNaN(y) && !isNaN(x1) && !isNaN(y1) && !isNaN(x2) && !isNaN(y2)) {
+                d += 'C' + x1 + ' ' + y1 + ' ' + x2 + ' ' + y2 + ' ' + x + ' ' + y;
+            }
+        } else if (cmd.type === CLOSE) {
+            d += 'Z';
         }
-    };
-    return wiggleContours(shape);
+    }
+    return d;
 };
 
-vg.wigglePaths = function (shape, offset, seed) {
-    seed = seed !== undefined ? seed : Math.random();
-    var rand = random.generator(seed);
-    if (offset === undefined) {
-        offset = {x: 10, y: 10};
-    } else if (typeof offset === 'number') {
-        offset = {x: offset, y: offset};
-    }
+// Output the path as an SVG string.
+Path.prototype.toSVG = function () {
+    var svg = '<path d="';
+    svg += this.toPathData();
+    svg += '"';
 
-    var wigglePaths = function (shape) {
-        if (shape.commands) {
-            return shape;
-        } else if (shape.shapes) {
-            return new Group(wigglePaths(shape.shapes));
-        } else if (Array.isArray(shape)) {
-            var subShape, dx, dy, t, newShapes = [];
-            for (var i = 0; i < shape.length; i += 1) {
-                subShape = shape[i];
-                if (subShape.commands) {
-                    dx = (rand(0, 1) - 0.5) * offset.x * 2;
-                    dy = (rand(0, 1) - 0.5) * offset.y * 2;
-                    t = new Transform().translate(dx, dy);
-                    newShapes.push(t.transformShape(subShape));
-                } else if (subShape.shapes) {
-                    newShapes.push(wigglePaths(subShape));
-                }
-            }
-            return newShapes;
-        }
-    };
+    var style = '';
 
-    return wigglePaths(shape);
-};
+    var fill;
+    var fillOpacity;
+    if (this.fill) {
+        fill = Color.parse(this.fill);
+        if (fill.a < 1) {
+            fillOpacity = fill.a;
+        }
+        fill = Color.toHex(fill).substring(0, 7);
+    }
 
-vg.scatterPoints = function (shape, amount, seed) {
-    // Generate points within the boundaries of a shape.
-    if (!shape) {
-        return;
+    if (fill !== 'black' && fill !== '#000000') {
+        if (fill === null || fill === undefined) {
+            style += 'fill:none;';
+        } else {
+            style += 'fill:' + fill + ';';
+        }
     }
-    seed = seed !== undefined ? seed : Math.random();
-    var i, j, tries, x, y,
-        rand = random.generator(seed),
-        bounds = shape.bounds(),
-        bx = bounds.x,
-        by = bounds.y,
-        bw = bounds.width,
-        bh = bounds.height,
-        contours = shape.contours(),
-        paths = [],
-        points = [];
 
-    for (i = 0; i < contours.length; i++) {
-        var contourPath = new Path(contours[i]);
-        var nrKeypoints = contourPath.commands.length;
-        var POINTS_PER_SEGMENT = 5;
-        paths.push(contourPath.points(nrKeypoints * POINTS_PER_SEGMENT, {closed: true } ));
+    if (fillOpacity !== undefined) {
+        style += 'fill-opacity:' + fillOpacity + ';';
     }
 
-    for (i = 0; i < amount; i += 1) {
-        tries = 100;
-        while (tries > 0) {
-            var inContourCount = 0;
-            x = bx + rand(0, 1) * bw;
-            y = by + rand(0, 1) * bh;
-            for (j = 0; j < paths.length; j++) {
-                if (geo.pointInPolygon(paths[j], x, y)) {
-                    inContourCount += 1;
-                }
-            }
-            if (inContourCount % 2) {
-                points.push(new Point(x, y));
-                break;
-            }
-            tries -= 1;
+    var stroke;
+    var strokeOpacity;
+
+    if (this.stroke) {
+        stroke = Color.parse(this.stroke);
+        if (stroke.a < 1) {
+            strokeOpacity = stroke.a;
         }
+        stroke = Color.toHex(stroke).substring(0, 7);
+    }
+    if (stroke) {
+        style += 'stroke:' + stroke + ';';
+        style += 'stroke-width:' + this.strokeWidth + ';';
     }
-    return points;
+    if (strokeOpacity !== undefined) {
+        style += 'stroke-opacity:' + strokeOpacity + ';';
+    }
+    if (style) {
+        svg += ' style="' + style + '"';
+    }
+    svg += '/>';
+    return svg;
 };
 
-vg.connectPoints = function (points, closed) {
-    if (!points) {
-        return;
-    }
-    var p = new Path();
-    for (var i = 0; i < points.length; i += 1) {
-        var pt = points[i];
-        if (i === 0) {
-            p.moveTo(pt.x, pt.y);
-        } else {
-            p.lineTo(pt.x, pt.y);
+// Draw the path to a 2D context.
+Path.prototype.draw = function (ctx) {
+    var nCommands, i, cmd;
+    ctx.beginPath();
+    nCommands = this.commands.length;
+    for (i = 0; i < nCommands; i += 1) {
+        cmd = this.commands[i];
+        if (cmd.type === MOVETO) {
+            ctx.moveTo(cmd.x, cmd.y);
+        } else if (cmd.type === LINETO) {
+            ctx.lineTo(cmd.x, cmd.y);
+        } else if (cmd.type === QUADTO) {
+            ctx.quadraticCurveTo(cmd.x1, cmd.y1, cmd.x, cmd.y);
+        } else if (cmd.type === CURVETO) {
+            ctx.bezierCurveTo(cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x, cmd.y);
+        } else if (cmd.type === CLOSE) {
+            ctx.closePath();
         }
     }
-    if (closed) {
-        p.close();
+    if (this.fill !== null && this.fill !== undefined) {
+        ctx.fillStyle = Color.toCSS(this.fill);
+        ctx.fill();
+    }
+    if (this.stroke !== null && this.stroke !== undefined && this.strokeWidth !== null && this.strokeWidth > 0) {
+        ctx.strokeStyle = Color.toCSS(this.stroke);
+        ctx.lineWidth = this.strokeWidth;
+        ctx.stroke();
     }
-    p.fill = null;
-    p.stroke = Color.BLACK;
-    return p;
 };
 
-vg.align = function (shape, position, hAlign, vAlign) {
-    if (!shape) {
-        return;
-    }
-    var dx, dy, t,
-        x = position.x,
-        y = position.y,
-        bounds = vg.bounds(shape);
-    if (hAlign === 'left') {
-        dx = x - bounds.x;
-    } else if (hAlign === 'right') {
-        dx = x - bounds.x - bounds.width;
-    } else if (hAlign === 'center') {
-        dx = x - bounds.x - bounds.width / 2;
-    } else {
-        dx = 0;
+Path.combine = function () {
+    var shapes = _.flatten(arguments);
+    var commands = [];
+    for (var i = 0; i < shapes.length; i += 1) {
+        var shape = shapes[i];
+        if (shape.commands) {
+            commands = commands.concat(shape.commands);
+        } else if (shape.shapes) {
+            commands = commands.concat(Path.combine(shape.shapes).commands);
+        }
     }
-    if (vAlign === 'top') {
-        dy = y - bounds.y;
-    } else if (vAlign === 'bottom') {
-        dy = y - bounds.y - bounds.height;
-    } else if (vAlign === 'middle') {
-        dy = y - bounds.y - bounds.height / 2;
+    return new Path(commands);
+};
+
+module.exports = Path;
+
+},{"../objects/color":27,"../objects/rect":32,"../util/bezier":37,"../util/geo":39,"../util/math":41,"lodash":2}],31:[function(require,module,exports){
+// 2-dimensional point object.
+
+'use strict';
+
+var Point = function (x, y) {
+    this.x = x !== undefined ? x : 0;
+    this.y = y !== undefined ? y : 0;
+};
+
+Object.defineProperty(Point.prototype, 'xy', {
+    get: function () { return [this.x, this.y]; }
+});
+
+Point.ZERO = new Point(0, 0);
+
+Point.read = function (x, y) {
+    if (arguments.length === 2) { return new Point(x, y); }
+    var arg = x;
+    if (arg instanceof Point) {
+        return arg;
+    } else if (typeof arg === 'number') {
+        return new Point(arg, arg);
+    } else if (Array.isArray(arg)) {
+        if (arg.length === 0) { return Point.ZERO; }
+        x = arg[0];
+        y = arg.length > 1 ? arg[1] : x;
+        return new Point(x, y);
+    } else if (arg.x !== undefined && arg.y !== undefined) {
+        return new Point(arg.x, arg.y);
     } else {
-        dy = 0;
+        return Point.ZERO;
     }
+};
 
-    t = new Transform().translate(dx, dy);
-    return t.transformShape(shape);
+Point.prototype.clone = function () {
+    return new Point(this.x, this.y);
 };
 
-// Snap geometry to a grid.
-vg.snap = function (shape, distance, strength, center) {
-    if (!shape) {
-        return;
-    }
-    strength = strength !== undefined ? strength : 1;
-    center = center || Point.ZERO;
+Point.prototype.add = function (v) {
+    return new Point(this.x + v.x, this.y + v.y);
+};
 
-    var snapShape = function (shape) {
-        if (shape.commands) {
-            var p = new Path([], shape.fill, shape.stroke, shape.strokeWidth);
-            for (var i = 0; i < shape.commands.length; i += 1) {
-                var cmd = shape.commands[i];
-                if (cmd.type === bezier.MOVETO || cmd.type === bezier.LINETO || cmd.type === bezier.CURVETO) {
-                    var x = math.snap(cmd.x + center.x, distance, strength) - center.x;
-                    var y = math.snap(cmd.y + center.y, distance, strength) - center.y;
-                    if (cmd.type === bezier.MOVETO) {
-                        p.moveTo(x, y);
-                    } else if (cmd.type === bezier.LINETO) {
-                        p.lineTo(x, y);
-                    } else if (cmd.type === bezier.CURVETO) {
-                        var x1 = math.snap(cmd.x1 + center.x, distance, strength) - center.x;
-                        var y1 = math.snap(cmd.y1 + center.y, distance, strength) - center.y;
-                        var x2 = math.snap(cmd.x2 + center.x, distance, strength) - center.x;
-                        var y2 = math.snap(cmd.y2 + center.y, distance, strength) - center.y;
-                        p.curveTo(x1, y1, x2, y2, x, y);
-                    }
-                } else if (cmd.type === bezier.CLOSE) {
-                    p.close();
-                } else {
-                    throw new Error('Invalid path command ' + cmd);
-                }
-            }
-            return p;
-        } else if (shape.shapes) {
-            return new Group(_.map(shape.shapes, snapShape));
-        } else if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined) {
-            return _.map(shape, function (point) {
-                var x = math.snap(point.x + center.x, distance, strength) - center.x;
-                var y = math.snap(point.y + center.y, distance, strength) - center.y;
-                return new Point(x, y);
-            });
-        } else {
-            return _.map(shape, snapShape);
-        }
-    };
+Point.prototype.subtract = Point.prototype.sub = function (v) {
+    return new Point(this.x - v.x, this.y - v.y);
+};
 
-    return snapShape(shape);
+Point.prototype.divide = function (n) {
+    return new Point(this.x / n, this.y / n);
 };
 
-vg.deletePoints = function (shape, bounding, invert) {
-    var deletePoints = function (shape) {
-        var i, cmd, commands = [];
-        var pt, points = [];
-        if (shape.commands) {
-            var newCurve = true;
-            for (i = 0; i < shape.commands.length; i += 1) {
-                cmd = _cloneCommand(shape.commands[i]);
-                if (cmd.x === undefined ||
-                        (invert && bounding.contains(cmd.x, cmd.y)) ||
-                        (!invert && !bounding.contains(cmd.x, cmd.y))) {
-                    if (newCurve && cmd.type !== bezier.MOVETO) {
-                        cmd.type = bezier.MOVETO;
-                    }
-                    commands.push(cmd);
-                    if (cmd.type === bezier.MOVETO) {
-                        newCurve = false;
-                    } else if (cmd.type === bezier.CLOSE) {
-                        newCurve = true;
-                    }
-                }
-            }
-            return new Path(commands, shape.fill, shape.stroke, shape.strokeWidth);
-        } else if (shape.shapes) {
-            return new Group(_.map(shape.shapes, deletePoints));
-        } else if (Array.isArray(shape) && shape.length > 0 && shape[0].x !== undefined && shape[0].y !== undefined){
-            for (i = 0; i < shape.length; i += 1) {
-                pt = shape[i];
-                if ((invert && bounding.contains(pt.x, pt.y)) ||
-                   (!invert && !bounding.contains(pt.x, pt.y))) {
-                    points.push(_cloneCommand(pt));
-                }
-            }
-            return points;
-        } else {
-            return _.map(shape, deletePoints);
-        }
-    };
+Point.prototype.multiply = function (n) {
+    return new Point(this.x * n, this.y * n);
+};
 
-    return deletePoints(shape);
+Point.prototype.magnitude = function () {
+    return Math.sqrt(this.x * this.x + this.y * this.y);
 };
 
-vg.deletePaths = function (shape, bounding, invert) {
-    var deletePaths = function (shape) {
-        if (shape.commands) {
-            return null;
-        } else if (shape.shapes) {
-            return new Group(deletePaths(shape.shapes));
-        } else if (Array.isArray(shape)) {
-            var j, s, selected, cmd, subShapes, newShapes = [];
-            var shapes = shape;
-            for (var i = 0; i < shapes.length; i += 1) {
-                s = shapes[i];
-                if (s.commands) {
-                    selected = false;
-                    for (j = 0; j < s.commands.length; j += 1) {
-                        cmd = s.commands[j];
-                        if (cmd.x !== undefined && bounding.contains(cmd.x, cmd.y)) {
-                            selected = true;
-                            break;
-                        }
-                    }
-                    if (!((invert && !selected) || (selected && !invert))) {
-                        newShapes.push(s);
-                    }
-                } else if (s.shapes) {
-                    subShapes = deletePaths(s);
-                    if (subShapes.length !== 0) {
-                        newShapes.push(subShapes);
-                    }
-                }
-            }
-            return newShapes;
-        }
-    };
+Point.prototype.magnitudeSquared = function () {
+    return this.x * this.x + this.y * this.y;
+};
 
-    return deletePaths(shape);
+Point.prototype.heading = function () {
+    return Math.atan2(this.y, this.x);
 };
 
-vg['delete'] = function (shape, bounding, scope, invert) {
-    if (shape === null || bounding === null) { return null; }
-    if (scope === 'points') { return vg.deletePoints(shape, bounding, invert); }
-    if (scope === 'paths') { return vg.deletePaths(shape, bounding, invert); }
-    throw new Error('Invalid scope.');
+Point.prototype.distanceTo = function (v) {
+    var dx = this.x - v.x,
+        dy = this.y - v.y;
+    return Math.sqrt(dx * dx + dy * dy);
 };
 
-vg.pointOnPath = function (shape, t) {
-    if (!shape) {
-        return;
-    }
-    if (shape.shapes) {
-        shape = new Path(vg.combinePaths(shape));
+Point.prototype.normalize = function () {
+    var m = this.magnitude();
+    if (m !== 0) {
+        return this.divide(m);
+    } else {
+        return Point.ZERO;
     }
-    t = t % 1;
-    if (t < 0) {
-        t = 1 + t;
+};
+
+Point.prototype.limit = function (speed) {
+    if (this.magnitudeSquared() > speed * speed) {
+        return this.normalize().multiply(speed);
     }
-    var pt = shape.point(t);
-    return new Point(pt.x, pt.y);
+    return this;
 };
 
-/*vg.shapeOnPath = function (shapes, path, amount, alignment, spacing, margin, baselineOffset) {
-    if (!shapes) { return []; }
-    if (path === null) { return []; }
+Point.prototype.translate = function (tx, ty) {
+    return new Point(this.x + tx, this.y + ty);
+};
 
-    if (alignment === 'trailing') {
-        shapes = shapes.slice();
-        shapes.reverse();
-    }
+Point.prototype.scale = function (sx, sy) {
+    sy = sy !== undefined ? sy : sx;
+    return new Point(this.x * sx, this.y * sy);
+};
 
-    var i, pos, p1, p2, a, t,
-        length = path.length() - margin,
-        m = margin / path.length(),
-        c = 0,
-        newShapes = [];
+Point.prototype.toString = function () {
+    return '[' + this.x + ', ' + this.y + ']';
+};
 
-    function putOnPath(shape) {
-        if (alignment === 'distributed') {
-            var p = length / ((amount * shapes.length) - 1);
-            pos = c * p / length;
-            pos = m + (pos * (1 - 2 * m));
-        } else {
-            pos = ((c * spacing) % length) / length;
-            pos = m + (pos * (1 - m));
+module.exports = Point;
+},{}],32:[function(require,module,exports){
+// Rectangle object
 
-            if (alignment === 'trailing') {
-                pos = 1 - pos;
-            }
-        }
+'use strict';
 
-        p1 = path.point(pos);
-        p2 = path.point(pos + 0.0000001);
-        a = geo.angle(p1.x, p1.y, p2.x, p2.y);
-        if (baselineOffset) {
-            p1 = geo.coordinates(p1.x, p1.y, a - 90, baselineOffset);
-        }
-        t = new Transform();
-        t = t.translate(p1.x, p1.y);
-        t = t.rotate(a);
-        newShapes.push(t.transformShape(shape));
-        c += 1;
-    }
+var Point = require('../objects/point');
 
-    for (i = 0; i < amount; i += 1) {
-        _.each(shapes, putOnPath);
+var Rect = function (x, y, width, height) {
+    this.x = x !== undefined ? x : 0;
+    this.y = y !== undefined ? y : 0;
+    this.width = width !== undefined ? width : 0;
+    this.height = height !== undefined ? height : 0;
+};
+
+Object.defineProperty(Rect.prototype, 'xywh', {
+    get: function () { return [this.x, this.y, this.width, this.height]; }
+});
+
+// Returns a new rectangle where width and height are guaranteed to be positive values.
+Rect.prototype.normalize = function () {
+    var x = this.x,
+        y = this.y,
+        width = this.width,
+        height = this.height;
+
+    if (width < 0) {
+        x += width;
+        width = -width;
     }
-    return newShapes;
-};*/
 
-vg._x = function (shape) {
-    if (shape.x !== undefined) {
-        return shape.x;
-    } else {
-        return shape.bounds().x;
+    if (height < 0) {
+        y += height;
+        height = -height;
     }
+    return new Rect(x, y, width, height);
 };
 
-vg._y = function (shape) {
-    if (shape.y !== undefined) {
-        return shape.y;
-    } else {
-        return shape.bounds().y;
+Rect.prototype.containsPoint = function (x, y) {
+    if (arguments.length === 1) {
+        y = x.y;
+        x = x.x;
     }
+    return (x >= this.x && x <= this.x + this.width && y >= this.y && y <= this.y + this.height);
 };
 
-vg._angleToPoint = function (point) {
-    return function (shape) {
-        if (shape.x !== undefined && shape.y !== undefined) {
-            return geo.angle(shape.x, shape.y, point.x, point.y);
-        } else {
-            var centerPoint = shape.bounds().centerPoint();
-            return geo.angle(centerPoint.x, centerPoint.y, point.x, point.y);
-        }
-    };
+Rect.prototype.containsRect = function (r) {
+    return r.x >= this.x && r.x + r.width <= this.x + this.width &&
+        r.y >= this.y && r.y + r.height <= this.y + this.height;
 };
 
-vg._distanceToPoint = function (point) {
-    return function (shape) {
-        if (shape.x !== undefined && shape.y !== undefined) {
-            return geo.distance(shape.x, shape.y, point.x, point.y);
-        } else {
-            var centerPoint = shape.bounds().centerPoint();
-            return geo.distance(centerPoint.x, centerPoint.y, point.x, point.y);
-        }
-    };
+Rect.prototype.grow = function (dx, dy) {
+    var x = this.x - dx,
+        y = this.y - dy,
+        width = this.width + dx * 2,
+        height = this.height + dy * 2;
+    return new Rect(x, y, width, height);
 };
 
-vg.shapeSort = function (shapes, method, origin) {
-    if (!shapes) {
-        return;
-    }
-    origin = origin || Point.ZERO;
+Rect.prototype.unite = function (r) {
+    var x = Math.min(this.x, r.x),
+        y = Math.min(this.y, r.y),
+        width = Math.max(this.x + this.width, r.x + r.width) - x,
+        height = Math.max(this.y + this.height, r.y + r.height) - y;
+    return new Rect(x, y, width, height);
+};
 
-    var methods = {
-        x: vg._x,
-        y: vg._y,
-        angle: vg._angleToPoint(origin),
-        distance: vg._distanceToPoint(origin)
-    };
-    method = methods[method];
-    if (method === undefined) { return shapes; }
-    var newShapes = shapes.slice(0);
-    newShapes.sort(function (a, b) {
-        var _a = method(a),
-            _b = method(b);
-        if (_a < _b) { return -1; }
-        if (_a > _b) { return 1; }
-        return 0;
-    });
-    return newShapes;
+Rect.prototype.addPoint = function (x, y) {
+    var dx, dy,
+        _x = this.x,
+        _y = this.y,
+        width = this.width,
+        height = this.height;
+
+    if (x < this.x) {
+        dx = this.x - x;
+        _x = x;
+        width += dx;
+    } else if (x > this.x + this.width) {
+        dx = x - (this.x + this.width);
+        width += dx;
+    }
+    if (y < this.y) {
+        dy = this.y - y;
+        _y = y;
+        height += dy;
+    } else if (y > this.y + this.height) {
+        dy = y - (this.y + this.height);
+        height += dy;
+    }
+    return new Rect(_x, _y, width, height);
 };
 
-vg.group = function () {
-    return new Group(_.flatten(arguments));
+Rect.prototype.centerPoint = function () {
+    return new Point(this.x + this.width / 2, this.y + this.height / 2);
 };
 
-vg.ungroup = function (shape) {
-    if (!shape) {
-        return [];
-    } else if (shape.shapes) {
-        var i, s, shapes = [];
-        for (i = 0; i < shape.shapes.length; i += 1) {
-            s = shape.shapes[i];
-            if (s.commands) {
-                shapes.push(s);
-            } else if (s.shapes) {
-                shapes = shapes.concat(vg.ungroup(s));
-            }
+module.exports = Rect;
+},{"../objects/point":31}],33:[function(require,module,exports){
+// Text object
+
+// Internally the object is called "GText" to avoid conflicts with the DOM Text object.
+// Externally it is exposed as g.Text.
+
+'use strict';
+
+var Color = require('../objects/color');
+var Rect = require('../objects/rect');
+var Transform = require('../objects/transform');
+
+var _dummyContext = null;
+
+// Generates a Text object.
+// The function can take many possible argument forms, either by listing them in order
+// (text, x, y, fontFamily, fontSize, align, fill), or by using an options object.
+// The position can be specified as x, y; using a point {x: 10, y: 20} or using an array [10, 20].
+// Here are a couple of ways to generate 'Hello' at position 0, 0 in 12pt Helvetica, centered.
+//
+//     new g.Text('Hello', {x: 0, y: 0}, 'Helvetica', 12, 'center');
+//     new g.Text('Hello', [0, 0], {fontFamily: 'Helvetica', fontSize: 12, textAlign: 'center'});
+//     new g.Text('Hello', 0, 0, {fontFamily: 'Helvetica', fontSize: 12});  // align: center is the default.
+//     new g.Text('Hello', {fontFamily: 'Helvetica', fontSize: 12}); // the position defaults to 0,0.
+var GText = function (text) {
+    var args = Array.prototype.slice.call(arguments, 1),
+        secondArg = arguments[1],
+        thirdArg = arguments[2],
+        lastArg = arguments[arguments.length - 1],
+        options;
+
+    // The text is required and always the first argument.
+    this.text = String(text);
+
+    // Second argument is position (as object or array) or x (as number).
+    if (typeof secondArg === 'number') {
+        this.x = secondArg;
+        this.y = thirdArg;
+        args = args.slice(2);
+    } else if (Array.isArray(secondArg)) {
+        this.x = secondArg[0];
+        this.y = secondArg[1];
+        args = args.slice(1);
+    } else if (typeof secondArg === 'object') {
+        this.x = secondArg.x !== undefined ? secondArg.x : 0;
+        this.y = secondArg.y !== undefined ? secondArg.y : 0;
+        args = args.slice(1);
+    } else {
+        this.x = 0;
+        this.y = 0;
+    }
+
+    // The options object, if provided, is always the last argument.
+    if (typeof lastArg === 'object') {
+        options = lastArg;
+        if (secondArg !== lastArg) {
+            args = args.slice(0, args.length - 1);
         }
-        return shapes;
-    } else if (shape.commands) {
-        return [shape];
     } else {
-        return [];
+        options = {};
     }
-};
 
-vg.centerPoint = function (shape) {
-    if (!shape) {
-        return Point.ZERO;
+    if (args.length) {
+        this.fontFamily = args.shift();
+    } else {
+        this.fontFamily = options.fontFamily || options.fontName || options.font || 'sans-serif';
     }
-    var r = vg.bounds(shape);
-    return new Point(r.x + r.width / 2, r.y + r.height / 2);
-};
 
-vg.link = function (shape1, shape2, orientation) {
-    if (!shape1 || !shape2) {
-        return;
+    if (args.length) {
+        this.fontSize = args.shift();
+    } else {
+        this.fontSize = options.fontSize || 24;
     }
 
-    var p = new Path();
-    var a = shape1.bounds();
-    var b = shape2.bounds();
-    if (orientation === vg.HORIZONTAL) {
-        var hw = (b.x - (a.x + a.width)) / 2;
-        p.moveTo(a.x + a.width, a.y);
-        p.curveTo(a.x + a.width + hw, a.y, b.x - hw, b.y, b.x, b.y);
-        p.lineTo(b.x, b.y + b.height);
-        p.curveTo(b.x - hw, b.y + b.height, a.x + a.width + hw, a.y + a.height, a.x + a.width, a.y + a.height);
-        p.close();
+    if (args.length) {
+        this.textAlign = args.shift();
     } else {
-        var hh = (b.y - (a.y + a.height)) / 2;
-        p.moveTo(a.x, a.y + a.height);
-        p.curveTo(a.x, a.y + a.height + hh, b.x, b.y - hh, b.x, b.y);
-        p.lineTo(b.x + b.width, b.y);
-        p.curveTo(b.x + b.width, b.y - hh, a.x + a.width, a.y + a.height + hh, a.x + a.width, a.y + a.height);
-        p.close();
+        this.textAlign = options.align || options.textAlign || 'left';
     }
-    return p;
-};
-
-vg.compound = function (shape1, shape2, method) {
-    var methods = {
-        'union': ClipperLib.ClipType.ctUnion,
-        'difference': ClipperLib.ClipType.ctDifference,
-        'intersection': ClipperLib.ClipType.ctIntersection,
-        'xor': ClipperLib.ClipType.ctXor
-    };
 
-    function toPoints(shape) {
-        var l1 = [];
-        var i, l, s, j, pt;
-        for (i = 0; i < shape.length; i += 1) {
-            l = [];
-            s = shape[i];
-            for (j = 0; j < s.length; j += 1) {
-                pt = s[j];
-                if (pt.type !== bezier.CLOSE) {
-                    l.push({X: pt.x, Y: pt.y});
-                }
-            }
-            l1.push(l);
-        }
-        return l1;
+    if (args.length) {
+        this.fill = args.shift();
+    } else {
+        this.fill = options.fill || 'black';
     }
 
-    if (!shape1.commands) { shape1 = Path.combine(shape1); }
-    if (!shape2.commands) { shape2 = Path.combine(shape2); }
-    var contours1 = shape1.resampleByLength(1).contours();
-    var contours2 = shape2.resampleByLength(1).contours();
-
-    var subjPaths = toPoints(contours1);
-    var clipPaths = toPoints(contours2);
-    var scale = 100;
-    ClipperLib.JS.ScaleUpPaths(subjPaths, scale);
-    ClipperLib.JS.ScaleUpPaths(clipPaths, scale);
+    this.transform = new Transform();
+};
 
-    var cpr = new ClipperLib.Clipper();
-    cpr.AddPaths(subjPaths, ClipperLib.PolyType.ptSubject, shape1.isClosed());
-    cpr.AddPaths(clipPaths, ClipperLib.PolyType.ptClip, shape2.isClosed());
+GText.prototype.clone = function () {
+    var t = new GText();
+    t.text = this.text;
+    t.x = this.x;
+    t.y = this.y;
+    t.fontFamily = this.fontFamily;
+    t.fontSize = this.fontSize;
+    t.textAlign = this.textAlign;
+    t.fill = Color.clone(this.fill);
+    t.transform = this.transform;
+    return t;
+};
 
-    var solutionPaths = new ClipperLib.Paths();
-    cpr.Execute(methods[method], solutionPaths, ClipperLib.PolyFillType.pftNonZero, ClipperLib.PolyFillType.pftNonZero);
-    solutionPaths = ClipperLib.JS.Clean(solutionPaths, 0.1 * scale);
-    ClipperLib.JS.ScaleDownPaths(solutionPaths, scale);
-    var path = new Path();
-    var i, j, s;
-    for (i = 0; i < solutionPaths.length; i += 1) {
-        s = solutionPaths[i];
-        for (j = 0; j < s.length ; j += 1) {
-            if (j === 0) {
-                path.moveTo(s[j].X, s[j].Y);
-            } else {
-                path.lineTo(s[j].X, s[j].Y);
-            }
-        }
-        if (s[0].X !== s[s.length-1].X || s[0].Y !== s[s.length-1].Y) {
-            path.closePath();
+// The `measureWidth` function requires a canvas, so we set up a dummy one
+// that we re-use for the duration of the page.
+GText._getDummyContext = function () {
+    if (!_dummyContext) {
+        if (typeof document !== 'undefined') {
+            _dummyContext = document.createElement('canvas').getContext('2d');
+        } else {
+            // For node.js, use a fake context that estimates the width.
+            _dummyContext = {
+                font: '10px sans-serif',
+                measureText: function (text) {
+                    var fontSize = parseFloat(this.font);
+                    // The 0.6 is the average width / fontSize ratio across all characters and font sizes.
+                    return {width: text.length * fontSize * 0.6};
+                }
+            };
         }
     }
-    return path;
+    return _dummyContext;
 };
 
-module.exports = vg;
-
-},{"../objects/color":28,"../objects/group":29,"../objects/path":31,"../objects/point":32,"../objects/rect":33,"../objects/transform":35,"../objects/transformable":36,"../util/bezier":38,"../util/geo":40,"../util/math":42,"../util/random":43,"js-clipper":2,"lodash":3}],27:[function(require,module,exports){
-// Basic shapes
-
-'use strict';
-
-var _ = require('lodash');
-
-var geo = require('../util/geo');
-
-var Color = require('../objects/color');
-var Path = require('../objects/path');
-var Point = require('../objects/point');
-var gText = require('../objects/text');
+GText.prototype._getFont = function () {
+    return this.fontSize + 'px ' + this.fontFamily;
+};
 
-var vg = {};
+GText.prototype.colorize = function (fill) {
+    var t = this.clone();
+    t.fill = Color.clone(fill);
+    return t;
+};
 
-vg.roundedRect = function (cx, cy, width, height, rx, ry) {
-    var p = new Path();
-    p.addRoundedRect(cx, cy, width, height, rx, ry);
-    return p;
+GText.prototype.draw = function (ctx) {
+    ctx.save();
+    ctx.font = this._getFont();
+    ctx.textAlign = this.textAlign;
+    var m = this.transform.m;
+    ctx.transform(m[0], m[1], m[3], m[4], m[6], m[7]);
+    ctx.fillStyle = Color.toCSS(this.fill);
+    ctx.fillText(this.text, this.x, this.y);
+    ctx.restore();
 };
 
-vg.quad = function (pt1, pt2, pt3, pt4) {
-    var args = arguments;
-    var p = new Path();
-    if (args.length === 8) {
-        Path.prototype.addQuad.apply(p, args);
-    } else {
-        pt1 = Point.read(pt1);
-        pt2 = Point.read(pt2);
-        pt3 = Point.read(pt3);
-        pt4 = Point.read(pt4);
-        p.addQuad(pt1.x, pt1.y, pt2.x, pt2.y, pt3.x, pt3.y, pt4.x, pt4.y);
+GText.prototype.bounds = function () {
+    var ctx = GText._getDummyContext(),
+        metrics,
+        x = this.x;
+    ctx.font = this._getFont();
+    // FIXME: measureText returns a TextMetrics object that only contains width.
+    metrics = ctx.measureText(this.text);
+    if (this.textAlign === 'center') {
+        x = this.x - (metrics.width / 2);
+    } else if (this.textAlign === 'right') {
+        x = this.x - metrics.width;
     }
-    return p;
+    return new Rect(x, this.y - this.fontSize, metrics.width, this.fontSize * 1.2);
 };
 
-vg.rect = function (position, width, height, roundness) {
-    var args = arguments;
-    if (args.length === 3) {
-        position = Point.read(position);
-    } else if (args.length === 4) {
-        if (typeof args[0] === 'number' && typeof args[1] === 'number') {
-            position = Point.read(args[0], args[1]);
-            width = args[2];
-            height = args[3];
-            roundness = null;
-        } else {
-            position = Point.read(position);
-            roundness = Point.read(roundness);
-        }
-    } else if (args.length === 5 || args.length === 6) {
-        position = Point.read(args[0], args[1]);
-        width = args[2];
-        height = args[3];
-        if (args.length === 5 && typeof args[4] === 'number') {
-            roundness = Point.read(args[4], args[4]);
-        } else {
-            roundness = Point.read(args[4], args[5]);
-        }
+GText.prototype.toSVG = function () {
+    var svg = '<text';
+    svg += ' x="' + this.x + '"';
+    svg += ' y="' + this.y + '"';
+    svg += ' font-family="' + this.fontFamily + '"';
+    svg += ' font-size="' + this.fontSize + '"';
+    var textAnchor;
+    if (this.textAlign === 'left') {
+        textAnchor = 'start';
+    } else if (this.textAlign === 'center') {
+        textAnchor = 'middle';
+    } else if (this.textAlign === 'right') {
+        textAnchor = 'end';
     }
-
-    if (!roundness || (roundness.x === 0 && roundness.y === 0)) {
-        var p = new Path();
-        p.addRect(position.x - width / 2, position.y - height / 2, width, height);
-        return p;
-    } else {
-        return vg.roundedRect(position.x - width / 2, position.y - height / 2, width, height, roundness.x, roundness.y);
+    svg += ' text-anchor="' + textAnchor + '"';
+    if (this.fill !== 'black') {
+        svg += ' fill="' + Color.toCSS(this.fill) + '"';
     }
+    svg += '>';
+    svg += this.text;
+    svg += '</text>';
+    return svg;
 };
 
-vg.ellipse = function (position, width, height) {
-    var args = arguments;
-    if (args.length === 4) {
-        position = Point.read(args[0], args[1]);
-        width = args[2];
-        height = args[3];
-    } else {
-        position = Point.read(position);
-    }
-    var p = new Path();
-    p.addEllipse(position.x - width / 2, position.y - height / 2, width, height);
-    return p;
-};
+module.exports = GText;
+},{"../objects/color":27,"../objects/rect":32,"../objects/transform":34}],34:[function(require,module,exports){
+// 2-dimensional transformation matrix
 
-vg.line = function (point1, point2) {
-    var args = arguments;
-    if (args.length === 4) {
-        point1 = Point.read(args[0], args[1]);
-        point2 = Point.read(args[2], args[3]);
+'use strict';
+
+var _ = require('lodash');
+
+var bezier = require('../util/bezier');
+var math = require('../util/math');
+
+var Group = require('../objects/group');
+var Path = require('../objects/path');
+var Point = require('../objects/point');
+
+var MOVETO  = bezier.MOVETO;
+var LINETO  = bezier.LINETO;
+var QUADTO  = bezier.QUADTO;
+var CURVETO = bezier.CURVETO;
+var CLOSE   = bezier.CLOSE;
+
+// A geometric transformation in Euclidean space (i.e. 2D)
+// that preserves collinearity and ratio of distance between points.
+// Linear transformations include rotation, translation, scaling, shear.
+var Transform = function (m) {
+    if (m !== undefined) {
+        this.m = m;
     } else {
-        point1 = Point.read(point1);
-        point2 = Point.read(point2);
+        this.m = [1, 0, 0, 0, 1, 0, 0, 0, 1]; // Identity matrix.
     }
-    var line = new Path();
-    line.addLine(point1.x, point1.y, point2.x, point2.y);
-    line.fill = null;
-    line.stroke = 'black';
-    return line;
 };
 
-vg.lineAngle = function (point, angle, distance) {
-    var args = arguments;
-    if (args.length === 4) {
-        point = Point.read(args[0], args[1]);
-        distance = args[2];
-        angle = args[3];
-    } else {
-        point = Point.read(point);
-    }
-    var point2 = geo.coordinates(point.x, point.y, angle, distance);
-    return vg.line(point, point2);
+Transform.IDENTITY = new Transform();
+
+Transform.identity = function () {
+    return new Transform();
 };
 
-vg.arc = function (position, width, height, startAngle, degrees, arcType) {
-    var args = arguments;
-    if (args.length === 7) {
-        position = Point.read(args[0], args[1]);
-        width = args[2];
-        height = args[3];
-        startAngle = args[4];
-        degrees = args[5];
-        arcType = args[6];
-    } else {
-        position = Point.read(position);
-    }
-    var p = new Path();
-    p.addArc(position.x, position.y, width, height, startAngle, degrees, arcType);
-    return p;
+// Returns the 3x3 matrix multiplication of A and B.
+// Note that scale(), translate(), rotate() work with premultiplication,
+// e.g. the matrix A followed by B = BA and not AB.
+Transform._mmult = function (a, b) {
+    if (a.m !== undefined) { a = a.m; }
+    if (b.m !== undefined) { b = b.m; }
+
+    return new Transform([
+        a[0] * b[0] + a[1] * b[3],
+        a[0] * b[1] + a[1] * b[4], 0,
+        a[3] * b[0] + a[4] * b[3],
+        a[3] * b[1] + a[4] * b[4], 0,
+        a[6] * b[0] + a[7] * b[3] + b[6],
+        a[6] * b[1] + a[7] * b[4] + b[7], 1
+    ]);
 };
 
-vg.curve = function (pt1, pt2, t, distance) {
-    var args = arguments;
-    if (args.length === 6) {
-        pt1 = Point.read(args[0], args[1]);
-        pt2 = Point.read(args[2], args[3]);
-        t = args[4];
-        distance = args[5];
-    } else {
-        pt1 = Point.read(pt1);
-        pt2 = Point.read(pt2);
-    }
+Transform.prototype.isIdentity = function () {
+    var m = this.m;
+    return (m[0] === 1 && m[1] === 0 && m[2] === 0 && m[3] === 0 && m[4] === 1 && m[5] === 0 && m[6] === 0 && m[7] === 0 && m[8] === 1);
+};
 
-    var cx = pt1.x + t * (pt2.x - pt1.x),
-        cy = pt1.y + t * (pt2.y - pt1.y),
-        a = geo.angle(pt1.x, pt1.y, pt2.x, pt2.y) + 90,
-        q = geo.coordinates(cx, cy, a, distance),
-        qx = q.x,
-        qy = q.y,
+Transform.prototype.prepend = function (matrix) {
+    return Transform._mmult(this.m, matrix.m);
+};
 
-        c1x = pt1.x + 2 / 3.0 * (qx - pt1.x),
-        c1y = pt1.y + 2 / 3.0 * (qy - pt1.y),
-        c2x = pt2.x + 2 / 3.0 * (qx - pt2.x),
-        c2y = pt2.y + 2 / 3.0 * (qy - pt2.y);
+Transform.prototype.append = function (matrix) {
+    return Transform._mmult(matrix.m, this.m);
+};
 
-    var p = new Path();
-    p.moveTo(pt1.x, pt1.y);
-    p.curveTo(c1x, c1y, c2x, c2y, pt2.x, pt2.y);
-    p.fill = null;
-    p.stroke = Color.BLACK;
-    return p;
+Transform.prototype.inverse = function () {
+    var m = this.m,
+        d = m[0] * m[4] - m[1] * m[3];
+    return new Transform([
+        m[4] / d,
+        -m[1] / d, 0,
+        -m[3] / d,
+        m[0] / d, 0,
+        (m[3] * m[7] - m[4] * m[6]) / d,
+        -(m[0] * m[7] - m[1] * m[6]) / d, 1
+    ]);
 };
 
-vg.polygon = function (position, radius, sides, align) {
-    var args = arguments;
-    if (args.length === 5 || (args.length === 4 && typeof args[0] === 'number' && typeof args[1] === 'number')) {
-        position = Point.read(args[0], args[1]);
-        radius = args[2];
-        sides = args[3];
-        align = args.length === 5 ? args[4] : true;
-    } else {
-        position = Point.read(position);
-        if (args.length === 3) {
-            align = true;
-        }
-    }
-    sides = Math.max(sides, 3);
-    var c0, c1, i, c,
-        x = position.x,
-        y = position.y,
-        r = radius,
-        a = 360.0 / sides,
-        da = 0;
-    if (align === true) {
-        c0 = geo.coordinates(x, y, 0, r);
-        c1 = geo.coordinates(x, y, a, r);
-        da = -geo.angle(c1.x, c1.y, c0.x, c0.y);
-    }
-    var p = new Path();
-    for (i = 0; i < sides; i += 1) {
-        c = geo.coordinates(x, y, (a * i) + da, r);
-        if (i === 0) {
-            p.moveTo(c.x, c.y);
-        } else {
-            p.lineTo(c.x, c.y);
-        }
-    }
-    p.close();
-    return p;
+Transform.prototype.scale = function (x, y) {
+    if (y === undefined) { y = x; }
+    return Transform._mmult([x, 0, 0, 0, y, 0, 0, 0, 1], this.m);
 };
 
-vg.star = function (position, points, outer, inner) {
-    var args = arguments;
-    if (args.length === 5 || (args.length === 4 && typeof args[0] === 'number' && typeof args[1] === 'number')) {
-        position = Point.read(args[0], args[1]);
-        points = args[2];
-        outer = args[3];
-        inner = args[4];
-    } else {
-        position = Point.read(position);
-    }
-    if (!inner) { inner = outer; }
-    var i, angle, radius, x, y;
-    var p = new Path();
-    p.moveTo(position.x, position.y + outer / 2);
-    // Calculate the points of the star.
-    for (i = 1; i < points * 2; i += 1) {
-        angle = i * Math.PI / points;
-        radius = (i % 2 === 1) ? inner / 2 : outer / 2;
-        x = position.x + radius * Math.sin(angle);
-        y = position.y + radius * Math.cos(angle);
-        p.lineTo(x, y);
-    }
-    p.close();
-    return p;
+Transform.prototype.translate = function (x, y) {
+    return Transform._mmult([1, 0, 0, 0, 1, 0, x, y, 1], this.m);
 };
 
-vg.freehand = function (pathString) {
-    var i, j, values,
-        nonEmpty = function (s) { return s !== ''; },
-        contours = _.filter(pathString.split('M'), nonEmpty);
+Transform.prototype.rotate = function (angle) {
+    var c = Math.cos(math.radians(angle)),
+        s = Math.sin(math.radians(angle));
+    return Transform._mmult([c, s, 0, -s, c, 0, 0, 0, 1], this.m);
+};
 
-    contours = _.map(contours, function (c) { return c.replace(/,/g, ' '); });
-    var p = new Path();
-    for (j = 0; j < contours.length; j += 1) {
-        values = _.filter(contours[j].split(' '), nonEmpty);
-        for (i = 0; i < values.length; i += 2) {
-            if (values[i + 1] !== undefined) {
-                var x = parseFloat(values[i]);
-                var y = parseFloat(values[i + 1]);
-                if (i === 0) {
-                    p.moveTo(x, y);
-                } else {
-                    p.lineTo(x, y);
-                }
-            }
-        }
-    }
-    p.fill = null;
-    p.stroke = Color.BLACK;
-    return p;
+Transform.prototype.skew = function (x, y) {
+    var kx = Math.PI * x / 180.0,
+        ky = Math.PI * y / 180.0;
+    return Transform._mmult([1, Math.tan(ky), 0, -Math.tan(kx), 1, 0, 0, 0, 1], this.m);
 };
 
-// Create a grid of points.
-vg.grid = function (columns, rows, columnWidth, rowHeight, position) {
-    var gridWidth, left, gridHeight, top, rowIndex, colIndex, x, y, i,
-        points = [];
-    points.length = columns * rows;
-    position = position !== undefined ? position : Point.ZERO;
-    if (columns > 1) {
-        gridWidth = columnWidth * (columns - 1);
-        left = position.x - gridWidth / 2;
-    } else {
-        left = position.x;
-    }
-    if (rows > 1) {
-        gridHeight = rowHeight * (rows - 1);
-        top = position.y - gridHeight / 2;
-    } else {
-        top = position.y;
-    }
+// Returns the new coordinates of the given point (x,y) after transformation.
+Transform.prototype.transformPoint = function (point) {
+    var x = point.x,
+        y = point.y,
+        m = this.m;
+    return new Point(
+        x * m[0] + y * m[3] + m[6],
+        x * m[1] + y * m[4] + m[7]
+    );
+};
 
-    i = 0;
-    for (rowIndex = 0; rowIndex < rows; rowIndex += 1) {
-        for (colIndex = 0; colIndex < columns; colIndex += 1) {
-            x = left + colIndex * columnWidth;
-            y = top + rowIndex * rowHeight;
-            points[i] = new Point(x, y);
-            i += 1;
+Transform.prototype.transformPoints = function (points) {
+    var _this = this;
+    return _.map(points, function (pt) {
+        return _this.transformPoint(pt);
+    });
+};
+
+Transform.prototype.transformPath = function (path) {
+    var m = this.m;
+    var commands = [];
+    commands.length = path.commands.length;
+    for (var i = 0, l = path.commands.length; i < l; i++) {
+        var cmd = path.commands[i];
+        switch(cmd.type) {
+            case MOVETO:
+            case LINETO:
+                commands[i] = {
+                    type: cmd.type,
+                    x: cmd.x * m[0] + cmd.y * m[3] + m[6],
+                    y: cmd.x * m[1] + cmd.y * m[4] + m[7]
+                };
+                break;
+            case QUADTO:
+                commands[i] = {
+                    type: QUADTO,
+                    x: cmd.x * m[0] + cmd.y * m[3] + m[6],
+                    y: cmd.x * m[1] + cmd.y * m[4] + m[7],
+                    x1: cmd.x1 * m[0] + cmd.y1 * m[3] + m[6],
+                    y1: cmd.x1 * m[1] + cmd.y1 * m[4] + m[7]
+                };
+                break;
+            case CURVETO:
+                commands[i] = {
+                    type: CURVETO,
+                    x: cmd.x * m[0] + cmd.y * m[3] + m[6],
+                    y: cmd.x * m[1] + cmd.y * m[4] + m[7],
+                    x1: cmd.x1 * m[0] + cmd.y1 * m[3] + m[6],
+                    y1: cmd.x1 * m[1] + cmd.y1 * m[4] + m[7],
+                    x2: cmd.x2 * m[0] + cmd.y2 * m[3] + m[6],
+                    y2: cmd.x2 * m[1] + cmd.y2 * m[4] + m[7]
+                };
+                break;
+            case CLOSE:
+                commands[i] = { type: CLOSE };
+                break;
+            default:
+                throw new Error('Unknown command type ' + cmd);
         }
     }
-    return points;
+    return new Path(commands, path.fill, path.stroke, path.strokeWidth);
 };
 
-// Generates a Text object.
-// The function can take many possible argument forms, either by listing them in order
-// (text, x, y, fontFamily, fontSize, align, fill), or by using an options object.
-// The position can be specified as x, y; using a point {x: 10, y: 20} or using an array [10, 20].
-// Here are a couple of ways to generate 'Hello' at position 0, 0 in 12pt Helvetica, centered.
-//
-//     vg.text('Hello', {x: 0, y: 0}, 'Helvetica', 12, 'center');
-//     vg.text('Hello', [0, 0], {fontFamily: 'Helvetica', fontSize: 12, align: 'center'});
-//     vg.text('Hello', 0, 0, {fontFamily: 'Helvetica', fontSize: 12});  // align: center is the default.
-//     vg.text('Hello', {fontFamily: 'Helvetica', fontSize: 12}); // the position defaults to 0,0.
-vg.text = function () {
-    var t = Object.create(gText.prototype);
-    t.constructor = gText.prototype;
-    gText.apply(t, arguments);
+Transform.prototype.transformText = function (text) {
+    var t = text.clone();
+    t.transform = this.append(t.transform);
     return t;
 };
 
-vg.demoRect = function () {
-    return new vg.rect({x: 0, y: 0}, 100, 100, {x: 0, y: 0});
+Transform.prototype.transformGroup = function (group) {
+    var _this = this,
+        shapes = _.map(group.shapes, function (shape) {
+            return _this.transformShape(shape);
+        });
+    return new Group(shapes);
 };
 
-vg.demoEllipse = function () {
-    return new vg.ellipse({x: 0, y: 0}, 100, 100);
+Transform.prototype.transformShape = function (shape) {
+    var fn;
+    if (shape.shapes) {
+        fn = this.transformGroup;
+    } else if (shape.commands) {
+        fn = this.transformPath;
+    } else if (shape.text) {
+        fn = this.transformText;
+    } else if (shape.x !== undefined && shape.y !== undefined) {
+        fn = this.transformPoint;
+    } else if (shape._transform !== undefined) {
+        return shape._transform(this.m);
+    } else if (Array.isArray(shape) && shape.length > 0) {
+        if (shape[0].x !== undefined && shape[0].y !== undefined) {
+            fn = this.transformPoints;
+        } else {
+            var l = [];
+            for (var i = 0; i < shape.length; i += 1) {
+                l.push(this.transformShape(shape[i]));
+            }
+            return l;
+        }
+    } else {
+        throw new Error('Don\'t know how to transform ' + shape);
+    }
+    return fn.call(this, shape);
 };
 
-module.exports = vg;
+module.exports = Transform;
 
-},{"../objects/color":28,"../objects/path":31,"../objects/point":32,"../objects/text":34,"../util/geo":40,"lodash":3}],28:[function(require,module,exports){
-// Color object
+},{"../objects/group":28,"../objects/path":30,"../objects/point":31,"../util/bezier":37,"../util/math":41,"lodash":2}],35:[function(require,module,exports){
+// Mixin for Path and Group
 
 'use strict';
 
-var math = require('../util/math');
-var color = require('../util/color');
-var js = require('../util/js');
-
-// var RGB = 'RGB';
-var HSB = 'HSB';
-var HSL = 'HSL';
-var HEX = 'HEX';
-
-var Color = function (v1, v2, v3, v4, v5) {
-    var _r, _g, _b, _a, rgb, options;
-    if (v1 === undefined) {
-        _r = _g = _b = 0;
-        _a = 1;
-    } else if (Array.isArray(v1)) {
-        options = v2 || {};
-        _r = v1[0] !== undefined ? v1[0] : 0;
-        _g = v1[1] !== undefined ? v1[1] : 0;
-        _b = v1[2] !== undefined ? v1[2] : 0;
-        _a = v1[3] !== undefined ? v1[3] : options.range || 1;
-    } else if (v1.r !== undefined) {
-        options = v2 || {};
-        _r = v1.r;
-        _g = v1.g;
-        _b = v1.b;
-        _a = v1.a !== undefined ? v1.a : options.range || 1;
-    } else if (typeof v1 === 'string') {
-        rgb = color.hex2rgb(v1);
-        _r = rgb[0];
-        _g = rgb[1];
-        _b = rgb[2];
-        _a = 1;
-    } else if (typeof v1 === 'number') {
-        if (arguments.length === 1) { // Grayscale value
-            _r = _g = _b = v1;
-            _a = 1;
-        } else if (arguments.length === 2) { // Gray and alpha or options
-            _r = _g = _b = v1;
-            if (typeof v2 === 'number') {
-                _a = v2;
-            } else {
-                options = v2;
-                _a = options.range || 1;
-            }
-        } else if (arguments.length === 3) { // RGB or gray, alpha and options
-            if (typeof v3 === 'number') {
-                _r = v1;
-                _g = v2;
-                _b = v3;
-                _a = 1;
-            } else {
-                _r = _g = _b = v1;
-                _a = v2;
-                options = v3;
-            }
-        } else if (arguments.length === 4) { // RGB and alpha or options
-            _r = v1;
-            _g = v2;
-            _b = v3;
-            if (typeof v4 === 'number') {
-                _a = v4;
-            } else {
-                options = v4;
-                _a = options.range || 1;
-            }
-        } else { // RGBA + options
-            _r = v1;
-            _g = v2;
-            _b = v3;
-            _a = v4;
-            options = v5;
-        }
-    }
-    options = options || {};
+var Point = require('../objects/point');
+var Transform = require('../objects/transform');
 
-    // The range option allows you to specify values in a different range.
-    if (options.range !== undefined) {
-        _r /= options.range;
-        _g /= options.range;
-        _b /= options.range;
-        _a /= options.range;
-        if (options.mode === HSB) {
-            v1 /= options.range;
-            v2 /= options.range;
-            v3 /= options.range;
-        }
-    }
-    // Convert HSB colors to RGB
-    if (options.mode === HSB) {
-        v1 = math.clamp(v1, 0, 1);
-        v2 = math.clamp(v2, 0, 1);
-        v3 = math.clamp(v3, 0, 1);
-        rgb = color.hsb2rgb(v1, v2, v3);
-        _r = rgb[0];
-        _g = rgb[1];
-        _b = rgb[2];
-    // Convert HSL colors to RGB
-    } else if (options.mode === HSL) {
-        v1 = math.clamp(v1, 0, 1);
-        v2 = math.clamp(v2, 0, 1);
-        v3 = math.clamp(v3, 0, 1);
-        rgb = color.hsl2rgb(v1, v2, v3);
-        _r = rgb[0];
-        _g = rgb[1];
-        _b = rgb[2];
-    } else if (options.mode === HEX) {
-        rgb = color.hex2rgb(v1);
-        _r = rgb[0];
-        _g = rgb[1];
-        _b = rgb[2];
-        _a = 1;
-    }
+var Transformable = {
+    translate: function (position) {
+        if (!position) { position = Point.ZERO; }
+        var t = new Transform().translate(position.x, position.y);
+        return t.transformShape(this);
+    },
 
-    this.r = math.clamp(_r, 0, 1);
-    this.g = math.clamp(_g, 0, 1);
-    this.b = math.clamp(_b, 0, 1);
-    this.a = math.clamp(_a, 0, 1);
+    scale: function (scale, origin) {
+        if (!origin) { origin = Point.ZERO; }
+        var sx, sy;
+        if (typeof scale === 'number') {
+            sx = scale;
+            sy = scale;
+        } else {
+            sx = scale.x;
+            sy = scale.y;
+        }
+        var t = new Transform();
+        t = t.translate(origin.x, origin.y);
+        t = t.scale(sx, sy);
+        t = t.translate(-origin.x, -origin.y);
+        return t.transformShape(this);
+    },
+
+    rotate: function (angle, origin) {
+        if (!origin) { origin = Point.ZERO; }
+        var t = new Transform();
+        t = t.translate(origin.x, origin.y);
+        t = t.rotate(angle);
+        t = t.translate(-origin.x, -origin.y);
+        return t.transformShape(this);
+    },
+
+    skew: function (skew, origin) {
+        if (!origin) { origin = Point.ZERO; }
+        var t = new Transform();
+        t = t.translate(origin.x, origin.y);
+        t = t.skew(skew.x, skew.y);
+        t = t.translate(-origin.x, -origin.y);
+        return t.transformShape(this);
+    }
 };
 
-Color.BLACK = new Color(0);
-Color.WHITE = new Color(1);
+module.exports = Transformable;
 
-js.defineAlias(Color, 'r', 'red');
-js.defineAlias(Color, 'g', 'green');
-js.defineAlias(Color, 'b', 'blue');
-js.defineAlias(Color, 'a', 'alpha');
+},{"../objects/point":31,"../objects/transform":34}],36:[function(require,module,exports){
+//// VECTORS AND MATRICES ///////////////////////////////////////////////
 
-// The hue of the color, in HSL color mode. (Although hue is the same in HSL and HSB).
-js.defineGetter(Color, 'h', function () {
-    return color.rgb2hsl(this.r, this.g, this.b)[0];
-});
+'use strict';
 
-// The saturation of the color, in HSL color mode. (Saturation is different in HSL and HSB).
-js.defineGetter(Color, 's', function () {
-    return color.rgb2hsl(this.r, this.g, this.b)[1];
-});
+var Vec3 = function (x, y, z) {
+    this.x = x === undefined ? 0 : x;
+    this.y = y === undefined ? 0 : y;
+    this.z = z === undefined ? 0 : z;
+};
 
-// The lightness of the color, in HSL color mode. (Lightness in HSL is different from brightness in HSB).
-js.defineGetter(Color, 'l', function () {
-    return color.rgb2hsl(this.r, this.g, this.b)[2];
-});
+// Generate the zero vector.
+Vec3.ZERO = new Vec3(0, 0, 0);
 
-js.defineAlias(Color, 'h', 'hue');
-js.defineAlias(Color, 's', 'saturation');
-js.defineAlias(Color, 'l', 'lightness');
+Vec3.up = function () {
+    return new Vec3(0, 1.0, 0);
+};
 
+// Generate the dot product of two vectors.
+Vec3.dot = function (a, b) {
+    return (a.x * b.x + a.y * b.y + a.z * b.z);
+};
 
-js.defineGetter(Color, 'rgb', function () {
-    return [this.r, this.g, this.b];
-});
+// Generate the cross product of two vectors.
+Vec3.cross = function (a, b) {
+    return new Vec3(
+        a.y * b.z - a.z * b.y,
+        a.z * b.x - a.x * b.z,
+        a.x * b.y - a.y * b.x
+    );
+};
 
-js.defineGetter(Color, 'rgba', function () {
-    return [this.r, this.g, this.b, this.a];
-});
+// Convert this vector to a string representation.
+Vec3.prototype.toString = function () {
+    return '[' + this.x + ', ' + this.y + ', ' + this.z + ']';
+};
 
-js.defineGetter(Color, 'hsb', function () {
-    return color.rgb2hsb(this.r, this.g, this.b);
-});
+// Convert this vector to an array.
+Vec3.prototype.toArray = function () {
+    var array = [];
+    array.push(this.x);
+    array.push(this.y);
+    array.push(this.z);
+    return array;
+};
 
-js.defineGetter(Color, 'hsba', function () {
-    return color.rgb2hsb(this.r, this.g, this.b).concat([this.a]);
-});
+// Calculate the length of this vector.
+Vec3.prototype.getLength = function () {
+    return Math.sqrt(this.x * this.x + this.y * this.y + this.z * this.z);
+};
 
-js.defineGetter(Color, 'hsl', function () {
-    return color.rgb2hsl(this.r, this.g, this.b);
-});
+// Create a new vector that is this vector, normalized.
+Vec3.prototype.normalize = function () {
+    var len, c;
+    len = this.getLength();
+    if (len === 0) {
+        return this;
+    }
+    c = 1.0 / len;
+    return new Vec3(this.x * c, this.y * c, this.z * c);
+};
 
-js.defineGetter(Color, 'hsla', function () {
-    return color.rgb2hsl(this.r, this.g, this.b).concat([this.a]);
-});
+// Create a new vector that is the addition of this vector and the given vector.
+Vec3.prototype.add = function (o) {
+    return new Vec3(this.x + o.x, this.y + o.y, this.z + o.z);
+};
 
-Color.prototype.toCSS = function () {
-    return Color.toCSS(this);
+// Create a new vector that is the subtraction of this vector and the given vector.
+Vec3.prototype.subtract = function (o) {
+    return new Vec3(this.x - o.x, this.y - o.y, this.z - o.z);
 };
 
-Color.prototype.toHex = function () {
-    if (this.a >= 1) {
-        return color.rgb2hex(this.r, this.g, this.b);
-    } else {
-        return color.rgba2hex(this.r, this.g, this.b, this.a);
-    }
+// Transform the vector according to the matrix and return the result.
+// A new vector is created, nothing is modified.
+Vec3.prototype.transform = function (matrix4) {
+    var x, y, z, w, matrix;
+
+    matrix = matrix4;
+    x = (this.x * matrix.m[0]) + (this.y * matrix.m[4]) + (this.z * matrix.m[8]) + matrix.m[12];
+    y = (this.x * matrix.m[1]) + (this.y * matrix.m[5]) + (this.z * matrix.m[9]) + matrix.m[13];
+    z = (this.x * matrix.m[2]) + (this.y * matrix.m[6]) + (this.z * matrix.m[10]) + matrix.m[14];
+    w = (this.x * matrix.m[3]) + (this.y * matrix.m[7]) + (this.z * matrix.m[11]) + matrix.m[15];
+
+    return new Vec3(x / w, y / w, z / w);
 };
 
-Color.prototype.desaturate = function (options) {
-    if (this.r === this.g && this.g === this.b) { return this; }
-    var rCoeff, gCoeff, bCoeff;
-    if (options === undefined || !options.method || options.method === 'ITU-R BT.601') {
-        rCoeff = 0.3; gCoeff = 0.59; bCoeff = 0.11;
-    } else if (options.method === 'ITU-R BT.709') {
-        rCoeff = 0.2125; gCoeff = 0.7154; bCoeff = 0.0721;
-    }
-    var gray = this.r * rCoeff + this.g * gCoeff + this.b * bCoeff;
-    return new Color(gray, gray, gray, this.a);
+module.exports = Vec3;
+},{}],37:[function(require,module,exports){
+// Bézier Math
+// Thanks to Prof. F. De Smedt at the Vrije Universiteit Brussel, 2006.
+
+'use strict';
+
+var _ = require('lodash');
+
+var math = require('../util/math');
+
+var Point = require('../objects/point');
+var Rect = require('../objects/rect');
+
+var bezier = {};
+
+var MOVETO = bezier.MOVETO = 'M';
+var LINETO = bezier.LINETO = 'L';
+bezier.QUADTO = 'Q';
+var CURVETO = bezier.CURVETO = 'C';
+var CLOSE = bezier.CLOSE = 'Z';
+
+// BEZIER MATH:
+
+// Returns coordinates for the point at t (0.0-1.0) on the line.
+bezier.linePoint = function (t, x0, y0, x1, y1) {
+    var x = x0 + t * (x1 - x0),
+        y = y0 + t * (y1 - y0);
+    return { type: LINETO, x: x, y: y };
 };
 
-Color.prototype.invert = function () {
-    return new Color(1 - this.r, 1 - this.g, 1 - this.b, this.a);
+// Returns the length of the line.
+bezier.lineLength = function (x0, y0, x1, y1) {
+    var a = Math.pow(Math.abs(x0 - x1), 2),
+        b = Math.pow(Math.abs(y0 - y1), 2);
+    return Math.sqrt(a + b);
 };
 
-Color.clone = function (c) {
-    if (c === null || c === undefined) {
-        return null;
-    } else if (typeof c === 'string') {
-        return c;
-    } else {
-        return new Color(c.r, c.g, c.b, c.a);
-    }
+// Returns coordinates for the point at t (0.0-1.0) on the curve
+// (de Casteljau interpolation algorithm).
+bezier.curvePoint = function (t, x0, y0, x1, y1, x2, y2, x3, y3) {
+    var dt = 1 - t,
+        x01 = x0 * dt + x1 * t,
+        y01 = y0 * dt + y1 * t,
+        x12 = x1 * dt + x2 * t,
+        y12 = y1 * dt + y2 * t,
+        x23 = x2 * dt + x3 * t,
+        y23 = y2 * dt + y3 * t,
+
+        h1x = x01 * dt + x12 * t,
+        h1y = y01 * dt + y12 * t,
+        h2x = x12 * dt + x23 * t,
+        h2y = y12 * dt + y23 * t,
+        x = h1x * dt + h2x * t,
+        y = h1y * dt + h2y * t;
+    return { type: CURVETO, x1: h1x, y1: h1y, x2: h2x, y2: h2y, x: x, y: y };
 };
 
-Color.toCSS = function (c) {
-    if (c === null) {
-        return 'none';
-    } else if (c === undefined) {
-        return 'black';
-    } else if (typeof c === 'string') {
-        return c;
-    } else if (c instanceof Color) {
-        var r255 = Math.round(c.r * 255),
-            g255 = Math.round(c.g * 255),
-            b255 = Math.round(c.b * 255);
-        return 'rgba(' + r255 + ', ' + g255 + ', ' + b255 + ', ' + c.a + ')';
-    } else if (c.r !== undefined && c.g !== undefined && c.b !== undefined) {
-        if (c.a === undefined) {
-            return 'rgb(' + c.r + ', ' + c.g + ', ' + c.b + ')';
-        } else {
-            return 'rgba(' + c.r + ', ' + c.g + ', ' + c.b + ', ' + c.a + ')';
-        }
-    } else {
-        throw new Error('Don\'t know how to convert ' + c + ' to CSS.');
+// Returns the length of the curve.
+// Integrates the estimated length of the cubic bezier spline defined by x0, y0, ... x3, y3,
+// by adding up the length of n linear lines along the curve.
+bezier.curveLength = function (x0, y0, x1, y1, x2, y2, x3, y3, n) {
+    if (n === undefined) { n = 20; }
+    var i, t, cmd,
+        length = 0,
+        xi = x0,
+        yi = y0;
+    for (i = 0; i < n; i += 1) {
+        t = (i + 1) / n;
+        cmd = bezier.curvePoint(t, x0, y0, x1, y1, x2, y2, x3, y3);
+        length += Math.sqrt(
+            Math.pow(Math.abs(xi - cmd.x), 2) +
+                Math.pow(Math.abs(yi - cmd.y), 2)
+        );
+        xi = cmd.x;
+        yi = cmd.y;
     }
+    return length;
 };
 
-Color.toHex = function (c) {
-    return Color.parse(c).toHex();
-};
-
-Color.make = function () {
-    var c = Object.create(Color.prototype);
-    c.constructor = Color.prototype;
-    Color.apply(c, arguments);
-    return c;
-};
+// BEZIER PATH LENGTH:
 
-Color.parse = function (s) {
-    function startsWith (s, value) {
-        if (!s || !value) { return false; }
-        s = String(s);
-        return s.indexOf(value) === 0;
-    }
+// Returns an array with the length of each command in the path.
+// With relative=true, the total length of all commands is 1.0.
+bezier.segmentLengths = function (commands, relative, n) {
+    relative = relative !== undefined ? relative : false;
+    if (n === undefined) { n = 20; }
+    var i, cmd, type, closeX, closeY, x0, y0, s, lengths;
+    lengths = [];
+    for (i = 0; i < commands.length; i += 1) {
+        cmd = commands[i];
+        type = cmd.type;
 
-    var m;
-    if (s === undefined || s === null) {
-        return new Color(0, 0, 0, 0);
-    } else if (s instanceof Color) {
-        return s;
-    } else if (color.namedColors[s]) {
-        return Color.make.apply(null, color.namedColors[s]);
-    } else if (s[0] === '#') {
-        return new Color(s, 0, 0, 0, { mode: HEX });
-    } else if (startsWith(s, 'rgba')) {
-        m = s.match(/^rgba\s*\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+|\d+.\d+)\s*\)$/i);
-        if (m) {
-            return new Color(parseInt(m[1]) / 255, parseInt(m[2]) / 255, parseInt(m[3]) / 255, parseFloat(m[4]));
-        } else {
-            m = s.match(/^rgba\s*\(\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)\s*\)$/i);
-            if (m) {
-                return new Color(parseFloat(m[1]) / 100, parseFloat(m[2]) / 100, parseFloat(m[3]) / 100, parseFloat(m[4]));
-            }
-        }
-        return new Color(0, 0, 0, 0);
-    } else if (startsWith(s, 'rgb')) {
-        m = s.match(/^rgb\s*\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)\s*\)$/i);
-        if (m) {
-            return new Color(parseInt(m[1]) / 255, parseInt(m[2]) / 255, parseInt(m[3]) / 255);
-        } else {
-            m = s.match(/^rgb\s*\(\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*\)$/i);
-            if (m) {
-                return new Color(parseFloat(m[1]) / 100, parseFloat(m[2]) / 100, parseFloat(m[3]) / 100);
-            }
-        }
-        return new Color(0, 0, 0, 0);
-    } else if (startsWith(s, 'hsla')) {
-        m = s.match(/^hsla\s*\(\s*(\d+|\d+.\d+)\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)\s*\)$/i);
-        if (m) {
-            return new Color(parseFloat(m[1]) / 360, parseFloat(m[2]) / 100, parseFloat(m[3]) / 100, parseFloat(m[4]));
+        if (i === 0) {
+            closeX = cmd.x;
+            closeY = cmd.y;
+        } else if (type === MOVETO) {
+            closeX = cmd.x;
+            closeY = cmd.y;
+            lengths.push(0.0);
+        } else if (type === CLOSE) {
+            lengths.push(bezier.lineLength(x0, y0, closeX, closeY));
+        } else if (type === LINETO) {
+            lengths.push(bezier.lineLength(x0, y0, cmd.x, cmd.y));
+        } else if (type === CURVETO) {
+            lengths.push(bezier.curveLength(x0, y0, cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x, cmd.y, n));
         }
-        return new Color(0, 0, 0, 0);
-    } else if (startsWith(s, 'hsl')) {
-        m = s.match(/^hsl\s*\(\s*(\d+|\d+.\d+)\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*\)$/i);
-        if (m) {
-            return new Color(parseFloat(m[1]) / 360, parseFloat(m[2]) / 100, parseFloat(m[3]) / 100);
+        if (type !== CLOSE) {
+            x0 = cmd.x;
+            y0 = cmd.y;
         }
-        return new Color(0, 0, 0, 0);
-    } else if (s === 'none' || s === 'null' || startsWith(s, 'url(')) {
-        return new Color(0, 0, 0, 0);
-    } else {
-        throw new Error('Color ' + s + 'can not be parsed');
     }
+    if (relative === true) {
+        s = math.sum(lengths);
+        return (s > 0) ?
+                _.map(lengths, function (v) { return v / s; }) :
+                _.map(lengths, function () { return 0.0; });
+    }
+    return lengths;
 };
 
-Color.gray = function (gray, alpha, range) {
-    range = Math.max(range, 1);
-    return new Color(gray / range, gray / range, gray / range, alpha / range);
+// Returns the approximate length of the path.
+// Calculates the length of each curve in the path using n linear samples.
+bezier.length = function (path, n) {
+    n = n || 20;
+    return math.sum(bezier.segmentLengths(path.commands, false, n));
 };
 
-Color.rgb = function (red, green, blue, alpha, range) {
-    range = Math.max(range, 1);
-    return new Color(red / range, green / range, blue / range, alpha / range);
-};
+// BEZIER PATH POINT:
 
-Color.hsb = function (hue, saturation, brightness, alpha, range) {
-    range = Math.max(range, 1);
-    return new Color(hue / range, saturation / range, brightness / range, alpha / range, { mode: HSB });
+// For a given relative t on the path (0.0-1.0), returns an array [index, t, PathElement],
+// with the index of the PathElement before t, the absolute position on this segment,
+// the last MOVETO or any subsequent CLOSE commands after i.
+// Note: during iteration, supplying segment lengths yourself is 30x faster.
+bezier._locate = function (path, t, segmentLengths) {
+    var i, cmd, closeTo;
+    if (segmentLengths === undefined) {
+        segmentLengths = bezier.segmentLengths(path.commands, true);
+    }
+    for (i = 0; i < path.commands.length; i += 1) {
+        cmd = path.commands[i];
+        if (i === 0 || cmd.type === MOVETO) {
+            closeTo =  new Point(cmd.x, cmd.y);
+        }
+        if (t <= segmentLengths[i] || i === segmentLengths.length - 1) {
+            break;
+        }
+        t -= segmentLengths[i];
+    }
+    if (segmentLengths[i] !== 0) { t /= segmentLengths[i]; }
+    if (i === segmentLengths.length - 1 && segmentLengths[i] === 0) { i -= 1; }
+    return [i, t, closeTo];
 };
 
-Color.hsl = function (hue, saturation, lightness, alpha, range) {
-    range = Math.max(range, 1);
-    return new Color(hue / range, saturation / range, lightness / range, alpha / range, { mode: HSL });
+// Returns the DynamicPathElement at time t on the path.
+// Note: in PathElement, ctrl1 is how the curve started, and ctrl2 how it arrives in this point.
+// Here, ctrl1 is how the curve arrives, and ctrl2 how it continues to the next point.
+bezier.point = function (path, t, segmentLengths) {
+    var loc, i, closeTo, x0, y0, cmd;
+    loc = bezier._locate(path, t, segmentLengths);
+    i = loc[0];
+    t = loc[1];
+    closeTo = loc[2];
+    x0 = path.commands[i].x;
+    y0 = path.commands[i].y;
+    cmd = path.commands[i + 1];
+    if (cmd.type === LINETO || cmd.type === CLOSE) {
+        cmd = (cmd.type === CLOSE) ?
+                 bezier.linePoint(t, x0, y0, closeTo.x, closeTo.y) :
+                 bezier.linePoint(t, x0, y0, cmd.x, cmd.y);
+    } else if (cmd.type === CURVETO) {
+        cmd = bezier.curvePoint(t, x0, y0, cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x, cmd.y);
+    }
+    return cmd;
 };
 
-module.exports = Color;
-
-},{"../util/color":39,"../util/js":41,"../util/math":42}],29:[function(require,module,exports){
-// Shape group object
-
-'use strict';
+bezier.extrema = function (x1, y1, x2, y2, x3, y3, x4, y4) {
+    var minX, maxX, minY, maxY,
+        ax, bx, cx, ay, by, cy,
+        temp, rcp, tx, ty;
 
-var _ = require('lodash');
 
-var Path = require('../objects/path');
-var Rect = require('../objects/rect');
-var Color = require('../objects/color');
+    function fuzzyCompare(p1, p2) {
+        return Math.abs(p1 - p2) <= (0.000000000001 * Math.min(Math.abs(p1), Math.abs(p2)));
+    }
 
-var Group = function (shapes) {
-    if (!shapes) {
-        this.shapes = [];
-    } else if (shapes.shapes || shapes.commands) {
-        this.shapes = [shapes];
-    } else if (shapes) {
-        this.shapes = shapes;
+    function coefficients(t) {
+        var mT, a, b, c, d;
+        mT = 1 - t;
+        b = mT * mT;
+        c = t * t;
+        d = c * t;
+        a = b * mT;
+        b *= (3.0 * t);
+        c *= (3.0 * mT);
+        return [a, b, c, d];
     }
-};
 
-Group.prototype.add = function (shape) {
-    this.shapes.push(shape);
-};
+    function pointAt(t) {
+        var a, b, c, d, coeff;
+        coeff = coefficients(t);
+        a = coeff[0];
+        b = coeff[1];
+        c = coeff[2];
+        d = coeff[3];
+        return {x: a * x1 + b * x2 + c * x3 + d * x4,
+                y: a * y1 + b * y2 + c * y3 + d * y4};
+    }
 
-Group.prototype.clone = function () {
-    var newShapes = [],
-        n = this.shapes.length,
-        i;
-    newShapes.length = n;
-    for (i = 0; i < n; i += 1) {
-        newShapes[i] = this.shapes[i].clone();
+    function bezierCheck(t) {
+        if (t >= 0 && t <= 1) {
+            var p = pointAt(t);
+            if (p.x < minX) {
+                minX = p.x;
+            } else if (p.x > maxX) {
+                maxX = p.x;
+            }
+            if (p.y < minY) {
+                minY = p.y;
+            } else if (p.y > maxY) {
+                maxY = p.y;
+            }
+        }
     }
-    return new Group(newShapes);
-};
 
-Group.prototype.colorize = function (options) {
-    var args = arguments;
-    if (typeof options !== 'object' || options instanceof Color) {
-        options = {};
-        if (args[0] !== undefined) { options.fill = args[0]; }
-        if (args[1] !== undefined) { options.stroke = args[1]; }
-        if (args[2] !== undefined) { options.strokeWidth = args[2]; }
+    if (x1 < x4) {
+        minX = x1;
+        maxX = x4;
+    } else {
+        minX = x4;
+        maxX = x1;
+    }
+    if (y1 < y4) {
+        minY = y1;
+        maxY = y4;
+    } else {
+        minY = y4;
+        maxY = y1;
     }
-    var shapes = _.map(this.shapes, function (shape) {
-        return shape.colorize(options);
-    });
-    return new Group(shapes);
-};
-
-Group.prototype.desaturate = function (options) {
-    var shapes = _.map(this.shapes, function (shape) {
-        return shape.desaturate(options);
-    });
-    return new Group(shapes);
-};
 
-Group.prototype.invert = function () {
-    var shapes = _.map(this.shapes, function (shape) {
-        return shape.invert();
-    });
-    return new Group(shapes);
-};
+    ax = 3 * (-x1 + 3 * x2 - 3 * x3 + x4);
+    bx = 6 * (x1 - 2 * x2 + x3);
+    cx = 3 * (-x1 + x2);
 
-Group.prototype.bounds = function () {
-    if (this.shapes.length === 0) { return new Rect(0, 0, 0, 0); }
-    var i, r, shape,
-        shapes = this.shapes;
-    for (i = 0; i < shapes.length; i += 1) {
-        shape = shapes[i];
-        if (r === undefined) {
-            r = shape.bounds();
+    if (fuzzyCompare(ax + 1, 1)) {
+        if (!fuzzyCompare(bx + 1, 1)) {
+            bezierCheck(-cx / bx);
         }
-        if ((shape.shapes && shape.shapes.length !== 0) ||
-            (shape.commands && shape.commands.length !== 0)) {
-            r = r.unite(shape.bounds());
+    } else {
+        tx = bx * bx - 4 * ax * cx;
+        if (tx >= 0) {
+            temp = Math.sqrt(tx);
+            rcp = 1 / (2 * ax);
+            bezierCheck((-bx + temp) * rcp);
+            bezierCheck((-bx - temp) * rcp);
         }
     }
-    return (r !== undefined) ? r : new Rect(0, 0, 0, 0);
-};
 
-// Returns true when point (x,y) falls within the contours of the group.
-Group.prototype.contains = function (x, y, precision) {
-    if (precision === undefined) { precision = 100; }
-    var i, shapes = this.shapes;
-    for (i = 0; i < shapes.length; i += 1) {
-        if (shapes[i].contains(x, y, precision)) {
-            return true;
+    ay = 3 * (-y1 + 3 * y2 - 3 * y3 + y4);
+    by = 6 * (y1 - 2 * y2 + y3);
+    cy = 3 * (-y1 + y2);
+
+    if (fuzzyCompare(ay + 1, 1)) {
+        if (!fuzzyCompare(by + 1, 1)) {
+            bezierCheck(-cy / by);
+        }
+    } else {
+        ty = by * by - 4 * ay * cy;
+        if (ty > 0) {
+            temp = Math.sqrt(ty);
+            rcp = 1 / (2 * ay);
+            bezierCheck((-by + temp) * rcp);
+            bezierCheck((-by - temp) * rcp);
         }
     }
-    return false;
-};
 
-Group.prototype.length = function (precision) {
-    if (precision === undefined) { precision = 10; }
-    var sum = 0;
-    var shapes = this.shapes;
-    for (var i = 0; i < shapes.length; i += 1) {
-        sum += shapes[i].length(precision);
-    }
-    return sum;
+    return new Rect(minX, minY, maxX - minX, maxY - minY);
 };
 
-Group.prototype.resampleByAmount = function (points, perContour) {
-    var path, shapes;
-    if (!perContour) {
-        path = new Path.combine(this);
-        return path.resampleByAmount(points, perContour);
-    }
+module.exports = bezier;
 
-    shapes = _.map(this.shapes, function (shape) {
-        return shape.resampleByAmount(points, perContour);
-    });
-    return new Group(shapes);
+},{"../objects/point":31,"../objects/rect":32,"../util/math":41,"lodash":2}],38:[function(require,module,exports){
+// Color conversion functions
+
+'use strict';
+
+var color = {};
+
+color.namedColors = {
+    'lightpink'            : [1.00, 0.71, 0.76],
+    'pink'                 : [1.00, 0.75, 0.80],
+    'crimson'              : [0.86, 0.08, 0.24],
+    'lavenderblush'        : [1.00, 0.94, 0.96],
+    'palevioletred'        : [0.86, 0.44, 0.58],
+    'hotpink'              : [1.00, 0.41, 0.71],
+    'deeppink'             : [1.00, 0.08, 0.58],
+    'mediumvioletred'      : [0.78, 0.08, 0.52],
+    'orchid'               : [0.85, 0.44, 0.84],
+    'thistle'              : [0.85, 0.75, 0.85],
+    'plum'                 : [0.87, 0.63, 0.87],
+    'violet'               : [0.93, 0.51, 0.93],
+    'fuchsia'              : [1.00, 0.00, 1.00],
+    'darkmagenta'          : [0.55, 0.00, 0.55],
+    'purple'               : [0.50, 0.00, 0.50],
+    'mediumorchid'         : [0.73, 0.33, 0.83],
+    'darkviolet'           : [0.58, 0.00, 0.83],
+    'darkorchid'           : [0.60, 0.20, 0.80],
+    'indigo'               : [0.29, 0.00, 0.51],
+    'blueviolet'           : [0.54, 0.17, 0.89],
+    'mediumpurple'         : [0.58, 0.44, 0.86],
+    'mediumslateblue'      : [0.48, 0.41, 0.93],
+    'slateblue'            : [0.42, 0.35, 0.80],
+    'darkslateblue'        : [0.28, 0.24, 0.55],
+    'ghostwhite'           : [0.97, 0.97, 1.00],
+    'lavender'             : [0.90, 0.90, 0.98],
+    'blue'                 : [0.00, 0.00, 1.00],
+    'mediumblue'           : [0.00, 0.00, 0.80],
+    'darkblue'             : [0.00, 0.00, 0.55],
+    'navy'                 : [0.00, 0.00, 0.50],
+    'midnightblue'         : [0.10, 0.10, 0.44],
+    'royalblue'            : [0.25, 0.41, 0.88],
+    'cornflowerblue'       : [0.39, 0.58, 0.93],
+    'lightsteelblue'       : [0.69, 0.77, 0.87],
+    'lightslategray'       : [0.47, 0.53, 0.60],
+    'slategray'            : [0.44, 0.50, 0.56],
+    'dodgerblue'           : [0.12, 0.56, 1.00],
+    'aliceblue'            : [0.94, 0.97, 1.00],
+    'steelblue'            : [0.27, 0.51, 0.71],
+    'lightskyblue'         : [0.53, 0.81, 0.98],
+    'skyblue'              : [0.53, 0.81, 0.92],
+    'deepskyblue'          : [0.00, 0.75, 1.00],
+    'lightblue'            : [0.68, 0.85, 0.90],
+    'powderblue'           : [0.69, 0.88, 0.90],
+    'cadetblue'            : [0.37, 0.62, 0.63],
+    'darkturquoise'        : [0.00, 0.81, 0.82],
+    'azure'                : [0.94, 1.00, 1.00],
+    'lightcyan'            : [0.88, 1.00, 1.00],
+    'paleturquoise'        : [0.69, 0.93, 0.93],
+    'aqua'                 : [0.00, 1.00, 1.00],
+    'darkcyan'             : [0.00, 0.55, 0.55],
+    'teal'                 : [0.00, 0.50, 0.50],
+    'darkslategray'        : [0.18, 0.31, 0.31],
+    'mediumturquoise'      : [0.28, 0.82, 0.80],
+    'lightseagreen'        : [0.13, 0.70, 0.67],
+    'turquoise'            : [0.25, 0.88, 0.82],
+    'aquamarine'           : [0.50, 1.00, 0.83],
+    'mediumaquamarine'     : [0.40, 0.80, 0.67],
+    'mediumspringgreen'    : [0.00, 0.98, 0.60],
+    'mintcream'            : [0.96, 1.00, 0.98],
+    'springgreen'          : [0.00, 1.00, 0.50],
+    'mediumseagreen'       : [0.24, 0.70, 0.44],
+    'seagreen'             : [0.18, 0.55, 0.34],
+    'honeydew'             : [0.94, 1.00, 0.94],
+    'darkseagreen'         : [0.56, 0.74, 0.56],
+    'palegreen'            : [0.60, 0.98, 0.60],
+    'lightgreen'           : [0.56, 0.93, 0.56],
+    'limegreen'            : [0.20, 0.80, 0.20],
+    'lime'                 : [0.00, 1.00, 0.00],
+    'forestgreen'          : [0.13, 0.55, 0.13],
+    'green'                : [0.00, 0.50, 0.00],
+    'darkgreen'            : [0.00, 0.39, 0.00],
+    'lawngreen'            : [0.49, 0.99, 0.00],
+    'chartreuse'           : [0.50, 1.00, 0.00],
+    'greenyellow'          : [0.68, 1.00, 0.18],
+    'darkolivegreen'       : [0.33, 0.42, 0.18],
+    'yellowgreen'          : [0.60, 0.80, 0.20],
+    'olivedrab'            : [0.42, 0.56, 0.14],
+    'ivory'                : [1.00, 1.00, 0.94],
+    'beige'                : [0.96, 0.96, 0.86],
+    'lightyellow'          : [1.00, 1.00, 0.88],
+    'lightgoldenrodyellow' : [0.98, 0.98, 0.82],
+    'yellow'               : [1.00, 1.00, 0.00],
+    'olive'                : [0.50, 0.50, 0.00],
+    'darkkhaki'            : [0.74, 0.72, 0.42],
+    'palegoldenrod'        : [0.93, 0.91, 0.67],
+    'lemonchiffon'         : [1.00, 0.98, 0.80],
+    'khaki'                : [0.94, 0.90, 0.55],
+    'gold'                 : [1.00, 0.84, 0.00],
+    'cornsilk'             : [1.00, 0.97, 0.86],
+    'goldenrod'            : [0.85, 0.65, 0.13],
+    'darkgoldenrod'        : [0.72, 0.53, 0.04],
+    'floralwhite'          : [1.00, 0.98, 0.94],
+    'oldlace'              : [0.99, 0.96, 0.90],
+    'wheat'                : [0.96, 0.87, 0.07],
+    'orange'               : [1.00, 0.65, 0.00],
+    'moccasin'             : [1.00, 0.89, 0.71],
+    'papayawhip'           : [1.00, 0.94, 0.84],
+    'blanchedalmond'       : [1.00, 0.92, 0.80],
+    'navajowhite'          : [1.00, 0.87, 0.68],
+    'antiquewhite'         : [0.98, 0.92, 0.84],
+    'tan'                  : [0.82, 0.71, 0.55],
+    'burlywood'            : [0.87, 0.72, 0.53],
+    'darkorange'           : [1.00, 0.55, 0.00],
+    'bisque'               : [1.00, 0.89, 0.77],
+    'linen'                : [0.98, 0.94, 0.90],
+    'peru'                 : [0.80, 0.52, 0.25],
+    'peachpuff'            : [1.00, 0.85, 0.73],
+    'sandybrown'           : [0.96, 0.64, 0.38],
+    'chocolate'            : [0.82, 0.41, 0.12],
+    'saddlebrown'          : [0.55, 0.27, 0.07],
+    'seashell'             : [1.00, 0.96, 0.93],
+    'sienna'               : [0.63, 0.32, 0.18],
+    'lightsalmon'          : [1.00, 0.63, 0.48],
+    'coral'                : [1.00, 0.50, 0.31],
+    'orangered'            : [1.00, 0.27, 0.00],
+    'darksalmon'           : [0.91, 0.59, 0.48],
+    'tomato'               : [1.00, 0.39, 0.28],
+    'salmon'               : [0.98, 0.50, 0.45],
+    'mistyrose'            : [1.00, 0.89, 0.88],
+    'lightcoral'           : [0.94, 0.50, 0.50],
+    'snow'                 : [1.00, 0.98, 0.98],
+    'rosybrown'            : [0.74, 0.56, 0.56],
+    'indianred'            : [0.80, 0.36, 0.36],
+    'red'                  : [1.00, 0.00, 0.00],
+    'brown'                : [0.65, 0.16, 0.16],
+    'firebrick'            : [0.70, 0.13, 0.13],
+    'darkred'              : [0.55, 0.00, 0.00],
+    'maroon'               : [0.50, 0.00, 0.00],
+    'white'                : [1.00, 1.00, 1.00],
+    'whitesmoke'           : [0.96, 0.96, 0.96],
+    'gainsboro'            : [0.86, 0.86, 0.86],
+    'lightgrey'            : [0.83, 0.83, 0.83],
+    'silver'               : [0.75, 0.75, 0.75],
+    'darkgray'             : [0.66, 0.66, 0.66],
+    'gray'                 : [0.50, 0.50, 0.50],
+    'grey'                 : [0.50, 0.50, 0.50],
+    'dimgray'              : [0.41, 0.41, 0.41],
+    'dimgrey'              : [0.41, 0.41, 0.41],
+    'black'                : [0.00, 0.00, 0.00],
+    'cyan'                 : [0.00, 0.68, 0.94],
+
+    'transparent'          : [0.00, 0.00, 0.00, 0.00],
+    'bark'                 : [0.25, 0.19, 0.13]
 };
 
-Group.prototype.resampleByLength = function (length) {
-    var shapes = _.map(this.shapes, function (shape) {
-        return shape.resampleByLength(length);
-    });
-    return new Group(shapes);
+function toHex(i) {
+    var s;
+    if (i === 0) {
+        return '00';
+    } else {
+        s = i.toString(16).toUpperCase();
+        if (s.length < 2) {
+            s = '0' + s;
+        }
+        return s;
+    }
+}
+
+// Converts the given R,G,B values to a hexadecimal color string.
+color.rgb2hex = function (r, g, b) {
+    return '#' +
+        toHex(Math.round(r * 255)) +
+        toHex(Math.round(g * 255)) +
+        toHex(Math.round(b * 255));
 };
 
-Group.prototype.toSVG = function () {
-    var l;
-    l = _.map(this.shapes, function (shape) {
-        return shape.toSVG();
-    });
-    return '<g>' + l.join('') + '</g>';
+// Converts the given R,G,B,A values to a hexadecimal color string.
+color.rgba2hex = function (r, g, b, a) {
+    return '#' +
+        toHex(Math.round(r * 255)) +
+        toHex(Math.round(g * 255)) +
+        toHex(Math.round(b * 255)) +
+        toHex(Math.round(a * 255));
 };
 
-// Draw the group to a 2D context.
-Group.prototype.draw = function (ctx) {
-    var i, shapes = this.shapes, nShapes = shapes.length;
-    for (i = 0; i < nShapes; i += 1) {
-        shapes[i].draw(ctx);
+// Converts the given hexadecimal color string to R,G,B (between 0.0-1.0).
+color.hex2rgb = function (hex) {
+    var r, g, b;
+    hex = hex.replace(/^#/, '');
+    if ((hex.length !== 3 && hex.length !== 6) || !(/^[0-9a-fA-F]*$/.test(hex))) {
+        throw new Error('Invalid hex value: #' + hex);
+    }
+    if (hex.length === 3) {
+        hex = hex[0] + hex[0] + hex[1] + hex[1] + hex[2] + hex[2];
     }
+    r = parseInt(hex.substr(0, 2), 16) / 255;
+    g = parseInt(hex.substr(2, 2), 16) / 255;
+    b = parseInt(hex.substr(4, 2), 16) / 255;
+    return [r, g, b];
 };
 
-module.exports = Group;
-
-},{"../objects/color":28,"../objects/path":31,"../objects/rect":33,"lodash":3}],30:[function(require,module,exports){
-// 3-dimensional matrix
-
-'use strict';
-
-var Vec3 = require('../objects/vec3');
-
-// Construct a 4x4 matrix.
-var Matrix4 = function (m) {
-    if (m !== undefined) {
-       // TODO Check for type and length
-        this.m = m;
-    } else {
-        m = new Float32Array(16);
-        m[0] = 1.0;
-        m[1] = 0.0;
-        m[2] = 0.0;
-        m[3] = 0.0;
-        m[4] = 0.0;
-        m[5] = 1.0;
-        m[6] = 0.0;
-        m[7] = 0.0;
-        m[8] = 0.0;
-        m[9] = 0.0;
-        m[10] = 1.0;
-        m[11] = 0.0;
-        m[12] = 0.0;
-        m[13] = 0.0;
-        m[14] = 0.0;
-        m[15] = 1.0;
-        this.m = m;
+// Converts the given R,G,B values to H,S,B (between 0.0-1.0).
+color.rgb2hsb = function (r, g, b) {
+    var h = 0,
+        s = 0,
+        v = Math.max(r, g, b),
+        d = v - Math.min(r, g, b);
+    if (v !== 0) {
+        s = d / v;
+    }
+    if (s !== 0) {
+        if (r === v) {
+            h = 0 + (g - b) / d;
+        } else if (g === v) {
+            h = 2 + (b - r) / d;
+        } else {
+            h = 4 + (r - g) / d;
+        }
+    }
+    h = h * (60 / 360);
+    if (h < 0) {
+        h += 1.0;
     }
+    return [h, s, v];
 };
 
-Matrix4.IDENTITY = new Matrix4();
+// Converts the given H,S,B color values to R,G,B (between 0.0-1.0).
+color.hsb2rgb = function (h, s, v) {
+    if (s === 0) {
+        return [v, v, v];
+    }
+    h = h % 1 * 6.0;
+    var i = Math.floor(h),
+        f = h - i,
+        x = v * (1 - s),
+        y = v * (1 - s * f),
+        z = v * (1 - s * (1 - f));
+    if (i > 4) {
+        return [v, x, y];
+    }
+    return [[v, z, x], [y, v, x], [x, v, z], [x, y, v], [z, x, v]][parseInt(i, 10)];
+};
 
-// Create a perspective matrix transformation.
-Matrix4.perspective = function (fov, aspect, zNear, zFar) {
-    var m = new Float32Array(Matrix4.IDENTITY.m),
-        tan = 1.0 / (Math.tan(fov * 0.5));
+// Converts the given R,G,B values to H,S,L (between 0.0-1.0).
+// Code adapted from http://github.com/mattdesl/float-rgb2hsl
+color.rgb2hsl = function (r, g, b) {
+    var min = Math.min(r, g, b),
+        max = Math.max(r, g, b),
+        delta = max - min,
+        h, s, l;
 
-    m[0] = tan / aspect;
-    m[1] = m[2] = m[3] = 0.0;
-    m[5] = tan;
-    m[4] = m[6] = m[7] = 0.0;
-    m[8] = m[9] = 0.0;
-    m[10] = -zFar / (zNear - zFar);
-    m[11] = 1.0;
-    m[12] = m[13] = m[15] = 0.0;
-    m[14] = (zNear * zFar) / (zNear - zFar);
+    if (max === min) {
+        h = 0;
+    } else if (r === max) {
+        h = (g - b) / delta;
+    } else if (g === max) {
+        h = 2 + (b - r) / delta;
+    } else if (b === max) {
+        h = 4 + (r - g) / delta;
+    }
 
-    return new Matrix4(m);
-};
+    h = Math.min(h * 60, 360);
 
-Matrix4.lookAt = function (eye, target, up) {
-    var m, zAxis, xAxis, yAxis, ex, ey, ez;
-    m = new Float32Array(16);
-    zAxis = target.subtract(eye).normalize();
-    xAxis = Vec3.cross(up, zAxis).normalize();
-    yAxis = Vec3.cross(zAxis, xAxis).normalize();
+    if (h < 0) {
+        h += 360;
+    }
 
-    ex = -Vec3.dot(xAxis, eye);
-    ey = -Vec3.dot(yAxis, eye);
-    ez = -Vec3.dot(zAxis, eye);
+    l = (min + max) / 2;
 
-    m[0] = xAxis.x;
-    m[1] = yAxis.x;
-    m[2] = zAxis.x;
-    m[3] = 0;
-    m[4] = xAxis.y;
-    m[5] = yAxis.y;
-    m[6] = zAxis.y;
-    m[7] = 0;
-    m[8] = xAxis.z;
-    m[9] = yAxis.z;
-    m[10] = zAxis.z;
-    m[11] = 0;
-    m[12] = ex;
-    m[13] = ey;
-    m[14] = ez;
-    m[15] = 1;
+    if (max === min) {
+        s = 0;
+    } else if (l <= 0.5) {
+        s = delta / (max + min);
+    } else {
+        s = delta / (2 - max - min);
+    }
 
-    return new Matrix4(m);
+    return [h / 360, s, l];
 };
 
-// Return a new matrix with the inversion of this matrix.
-Matrix4.prototype.invert = function () {
-    var l1, l2, l3, l4, l5, l6, l7, l8, l9, l10, l11, l12, l13, l14, l15, l16, l17, l18, l19, l20, l21, l22, l23, l24, l25, l26, l27, l28,
-        l29, l30, l31, l32, l33, l34, l35, l36, l37, l38, l39, m;
-    l1 = this.m[0];
-    l2 = this.m[1];
-    l3 = this.m[2];
-    l4 = this.m[3];
-    l5 = this.m[4];
-    l6 = this.m[5];
-    l7 = this.m[6];
-    l8 = this.m[7];
-    l9 = this.m[8];
-    l10 = this.m[9];
-    l11 = this.m[10];
-    l12 = this.m[11];
-    l13 = this.m[12];
-    l14 = this.m[13];
-    l15 = this.m[14];
-    l16 = this.m[15];
-    l17 = (l11 * l16) - (l12 * l15);
-    l18 = (l10 * l16) - (l12 * l14);
-    l19 = (l10 * l15) - (l11 * l14);
-    l20 = (l9 * l16) - (l12 * l13);
-    l21 = (l9 * l15) - (l11 * l13);
-    l22 = (l9 * l14) - (l10 * l13);
-    l23 = ((l6 * l17) - (l7 * l18)) + (l8 * l19);
-    l24 = -(((l5 * l17) - (l7 * l20)) + (l8 * l21));
-    l25 = ((l5 * l18) - (l6 * l20)) + (l8 * l22);
-    l26 = -(((l5 * l19) - (l6 * l21)) + (l7 * l22));
-    l27 = 1.0 / ((((l1 * l23) + (l2 * l24)) + (l3 * l25)) + (l4 * l26));
-    l28 = (l7 * l16) - (l8 * l15);
-    l29 = (l6 * l16) - (l8 * l14);
-    l30 = (l6 * l15) - (l7 * l14);
-    l31 = (l5 * l16) - (l8 * l13);
-    l32 = (l5 * l15) - (l7 * l13);
-    l33 = (l5 * l14) - (l6 * l13);
-    l34 = (l7 * l12) - (l8 * l11);
-    l35 = (l6 * l12) - (l8 * l10);
-    l36 = (l6 * l11) - (l7 * l10);
-    l37 = (l5 * l12) - (l8 * l9);
-    l38 = (l5 * l11) - (l7 * l9);
-    l39 = (l5 * l10) - (l6 * l9);
-
-    m = new Float32Array(16);
-    m[0] = l23 * l27;
-    m[4] = l24 * l27;
-    m[8] = l25 * l27;
-    m[12] = l26 * l27;
-    m[1] = -(((l2 * l17) - (l3 * l18)) + (l4 * l19)) * l27;
-    m[5] = (((l1 * l17) - (l3 * l20)) + (l4 * l21)) * l27;
-    m[9] = -(((l1 * l18) - (l2 * l20)) + (l4 * l22)) * l27;
-    m[13] = (((l1 * l19) - (l2 * l21)) + (l3 * l22)) * l27;
-    m[2] = (((l2 * l28) - (l3 * l29)) + (l4 * l30)) * l27;
-    m[6] = -(((l1 * l28) - (l3 * l31)) + (l4 * l32)) * l27;
-    m[10] = (((l1 * l29) - (l2 * l31)) + (l4 * l33)) * l27;
-    m[14] = -(((l1 * l30) - (l2 * l32)) + (l3 * l33)) * l27;
-    m[3] = -(((l2 * l34) - (l3 * l35)) + (l4 * l36)) * l27;
-    m[7] = (((l1 * l34) - (l3 * l37)) + (l4 * l38)) * l27;
-    m[11] = -(((l1 * l35) - (l2 * l37)) + (l4 * l39)) * l27;
-    m[15] = (((l1 * l36) - (l2 * l38)) + (l3 * l39)) * l27;
-    return new Matrix4(m);
-};
+// Converts the given H,S,L color values to R,G,B (between 0.0-1.0).
+// Code adapted from http://github.com/mattdesl/float-hsl2rgb
+color.hsl2rgb = function (h, s, l) {
+    var t1, t2, t3, rgb, val;
 
-Matrix4.prototype.multiply = function (other) {
-    var m = new Float32Array(16);
+    if (s === 0) {
+        val = l;
+        return [val, val, val];
+    }
 
-    m[0] = this.m[0] * other.m[0] + this.m[1] * other.m[4] + this.m[2] * other.m[8] + this.m[3] * other.m[12];
-    m[1] = this.m[0] * other.m[1] + this.m[1] * other.m[5] + this.m[2] * other.m[9] + this.m[3] * other.m[13];
-    m[2] = this.m[0] * other.m[2] + this.m[1] * other.m[6] + this.m[2] * other.m[10] + this.m[3] * other.m[14];
-    m[3] = this.m[0] * other.m[3] + this.m[1] * other.m[7] + this.m[2] * other.m[11] + this.m[3] * other.m[15];
+    if (l < 0.5) {
+        t2 = l * (1 + s);
+    } else {
+        t2 = l + s - l * s;
+    }
+    t1 = 2 * l - t2;
 
-    m[4] = this.m[4] * other.m[0] + this.m[5] * other.m[4] + this.m[6] * other.m[8] + this.m[7] * other.m[12];
-    m[5] = this.m[4] * other.m[1] + this.m[5] * other.m[5] + this.m[6] * other.m[9] + this.m[7] * other.m[13];
-    m[6] = this.m[4] * other.m[2] + this.m[5] * other.m[6] + this.m[6] * other.m[10] + this.m[7] * other.m[14];
-    m[7] = this.m[4] * other.m[3] + this.m[5] * other.m[7] + this.m[6] * other.m[11] + this.m[7] * other.m[15];
+    rgb = [0, 0, 0];
+    for (var i = 0; i < 3; i++) {
+        t3 = h + 1 / 3 * -(i - 1);
+        if (t3 < 0) {
+            t3 += 1;
+        }
+        if (t3 > 1) {
+            t3 -= 1;
+        }
 
-    m[8] = this.m[8] * other.m[0] + this.m[9] * other.m[4] + this.m[10] * other.m[8] + this.m[11] * other.m[12];
-    m[9] = this.m[8] * other.m[1] + this.m[9] * other.m[5] + this.m[10] * other.m[9] + this.m[11] * other.m[13];
-    m[10] = this.m[8] * other.m[2] + this.m[9] * other.m[6] + this.m[10] * other.m[10] + this.m[11] * other.m[14];
-    m[11] = this.m[8] * other.m[3] + this.m[9] * other.m[7] + this.m[10] * other.m[11] + this.m[11] * other.m[15];
+        if (6 * t3 < 1) {
+            val = t1 + (t2 - t1) * 6 * t3;
+        } else if (2 * t3 < 1) {
+            val = t2;
+        } else if (3 * t3 < 2) {
+            val = t1 + (t2 - t1) * (2 / 3 - t3) * 6;
+        } else {
+            val = t1;
+        }
 
-    m[12] = this.m[12] * other.m[0] + this.m[13] * other.m[4] + this.m[14] * other.m[8] + this.m[15] * other.m[12];
-    m[13] = this.m[12] * other.m[1] + this.m[13] * other.m[5] + this.m[14] * other.m[9] + this.m[15] * other.m[13];
-    m[14] = this.m[12] * other.m[2] + this.m[13] * other.m[6] + this.m[14] * other.m[10] + this.m[15] * other.m[14];
-    m[15] = this.m[12] * other.m[3] + this.m[13] * other.m[7] + this.m[14] * other.m[11] + this.m[15] * other.m[15];
+        rgb[i] = val;
+    }
 
-    return new Matrix4(m);
+    return rgb;
 };
 
-Matrix4.prototype.translate = function (tx, ty, tz) {
-    var m = new Float32Array(this.m);
-    m[12] += tx;
-    m[13] += ty;
-    m[14] += tz;
-    return new Matrix4(m);
-};
+module.exports = color;
 
-module.exports = Matrix4;
-},{"../objects/vec3":37}],31:[function(require,module,exports){
-// Bézier path object
+},{}],39:[function(require,module,exports){
+// Geometry
 
 'use strict';
 
-var _ = require('lodash');
-
-var bezier = require('../util/bezier');
-var geo = require('../util/geo');
 var math = require('../util/math');
 
-var Color = require('../objects/color');
-var Rect = require('../objects/rect');
-
-var MOVETO  = bezier.MOVETO;
-var LINETO  = bezier.LINETO;
-var QUADTO  = bezier.QUADTO;
-var CURVETO = bezier.CURVETO;
-var CLOSE   = bezier.CLOSE;
-
-var CLOSE_COMMAND = Object.freeze({ type: CLOSE });
-
-var KAPPA = 0.5522847498307936; // (-1 + Math.sqrt(2)) / 3 * 4
+var Point = require('../objects/point');
 
-function _cloneCommand(cmd) {
-    var newCmd = {type: cmd.type};
-    if (newCmd.type !== CLOSE) {
-        newCmd.x = cmd.x;
-        newCmd.y = cmd.y;
-    }
-    if (newCmd.type === QUADTO) {
-        newCmd.x1 = cmd.x1;
-        newCmd.y1 = cmd.y1;
-    } else if (newCmd.type === CURVETO) {
-        newCmd.x1 = cmd.x1;
-        newCmd.y1 = cmd.y1;
-        newCmd.x2 = cmd.x2;
-        newCmd.y2 = cmd.y2;
-    }
-    return newCmd;
-}
+var geo = {};
 
-var Path = function (commands, fill, stroke, strokeWidth) {
-    this.commands = commands !== undefined ? commands : [];
-    this.fill = fill !== undefined ? fill : 'black';
-    this.stroke = stroke !== undefined ? stroke : null;
-    this.strokeWidth = strokeWidth !== undefined ? strokeWidth : 1;
+// Returns the angle between two points.
+geo.angle = function (x0, y0, x1, y1) {
+    return math.degrees(Math.atan2(y1 - y0, x1 - x0));
 };
 
-Path.prototype.clone = function () {
-    var p = new Path(),
-        n = this.commands.length,
-        i;
-    p.commands.length = this.commands.length;
-    for (i = 0; i < n; i += 1) {
-        p.commands[i] = _cloneCommand(this.commands[i]);
-    }
-    p.fill = Color.clone(this.fill);
-    p.stroke =  Color.clone(this.stroke);
-    p.strokeWidth = this.strokeWidth;
-    return p;
+// Returns the distance between two points.
+geo.distance = function (x0, y0, x1, y1) {
+    return Math.sqrt(Math.pow(x1 - x0, 2) + Math.pow(y1 - y0, 2));
 };
 
-Path.prototype.extend = function (commandsOrPath) {
-    var commands = commandsOrPath.commands || commandsOrPath;
-    Array.prototype.push.apply(this.commands, commands);
+// Returns the location of a point by rotating around origin (x0,y0).
+geo.coordinates = function (x0, y0, angle, distance) {
+    var x = x0 + Math.cos(math.radians(angle)) * distance,
+        y = y0 + Math.sin(math.radians(angle)) * distance;
+    return new Point(x, y);
 };
 
-Path.prototype.moveTo = function (x, y) {
-    this.commands.push({type: MOVETO, x: x, y: y});
-};
 
-Path.prototype.lineTo = function (x, y) {
-    this.commands.push({type: LINETO, x: x, y: y});
-};
+// Determines if the given point is within the polygon, given as a list of points.
 
-Path.prototype.curveTo = function (x1, y1, x2, y2, x, y) {
-    this.commands.push({type: CURVETO, x1: x1, y1: y1, x2: x2, y2: y2, x: x, y: y});
-};
+// This function uses a ray casting algorithm to determine how many times
+// a horizontal ray starting from the point intersects with the sides of the polygon.
+// If it is an even number of times, the point is outside, if odd, inside.
+// The algorithm does not always report correctly when the point is very close to the boundary.
+// The polygon is passed as an array of Points.
+//
+// Based on: W. Randolph Franklin, 1970, http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html
+geo.pointInPolygon = function (points, x, y) {
+    var i, j, x0, y0, x1, y1,
+        odd = false,
+        n = points.length;
 
-Path.prototype.quadTo = function (x1, y1, x, y) {
-    var prevX = this.commands[this.commands.length - 1].x,
-        prevY = this.commands[this.commands.length - 1].y,
-        cp1x = prevX + 2 / 3 * (x1 - prevX),
-        cp1y = prevY + 2 / 3 * (y1 - prevY),
-        cp2x = cp1x + 1 / 3 * (x - prevX),
-        cp2y = cp1y + 1 / 3 * (y - prevY);
-    this.curveTo(cp1x, cp1y, cp2x, cp2y, x, y);
+    for (i = 0; i < n; i += 1) {
+        j = (i < n - 1) ? i + 1 : 0;
+        x0 = points[i].x;
+        y0 = points[i].y;
+        x1 = points[j].x;
+        y1 = points[j].y;
+        if ((y0 < y && y1 >= y) || (y1 < y && y0 >= y)) {
+            if (x0 + (y - y0) / (y1 - y0) * (x1 - x0) < x) {
+                odd = !odd;
+            }
+        }
+    }
+    return odd;
 };
 
-Path.prototype.closePath = Path.prototype.close = function () {
-    this.commands.push(CLOSE_COMMAND);
-};
+module.exports = geo;
 
-Path.prototype.isClosed = function () {
-    if (this.commands.length === 0) { return false; }
-    return this.commands[this.commands.length - 1].type === CLOSE;
+},{"../objects/point":31,"../util/math":41}],40:[function(require,module,exports){
+// Generic JavaScript utility methods
+
+'use strict';
+
+// Define a property that serves as an alias for another property.
+exports.defineAlias = function (cls, origProperty, newProperty) {
+    Object.defineProperty(cls.prototype, newProperty, {
+        get: function () {
+            return this[origProperty];
+        },
+
+        set: function (v) {
+            this[origProperty] = v;
+        }
+    });
 };
 
-Path.prototype.addRect = function (x, y, width, height) {
-    this.moveTo(x, y);
-    this.lineTo(x + width, y);
-    this.lineTo(x + width, y + height);
-    this.lineTo(x, y + height);
-    this.close();
+// Define a property on the class prototype that has a single getter function.
+exports.defineGetter = function (cls, property, getterFn) {
+    Object.defineProperty(cls.prototype, property, {
+        get: getterFn
+    });
 };
 
-Path.prototype.addRoundedRect = function (cx, cy, width, height, rx, ry) {
-    var ONE_MINUS_QUARTER = 1.0 - 0.552,
+},{}],41:[function(require,module,exports){
+// Math Utility functions
 
-        dx = rx,
-        dy = ry,
+'use strict';
 
-        left = cx,
-        right = cx + width,
-        top = cy,
-        bottom = cy + height;
+var math = {};
 
-    // rx/ry cannot be greater than half of the width of the rectangle
-    // (required by SVG spec)
-    dx = Math.min(dx, width * 0.5);
-    dy = Math.min(dy, height * 0.5);
-    this.moveTo(left + dx, top);
-    if (dx < width * 0.5) {
-        this.lineTo(right - rx, top);
-    }
-    this.curveTo(right - dx * ONE_MINUS_QUARTER, top, right, top + dy * ONE_MINUS_QUARTER, right, top + dy);
-    if (dy < height * 0.5) {
-        this.lineTo(right, bottom - dy);
-    }
-    this.curveTo(right, bottom - dy * ONE_MINUS_QUARTER, right - dx * ONE_MINUS_QUARTER, bottom, right - dx, bottom);
-    if (dx < width * 0.5) {
-        this.lineTo(left + dx, bottom);
-    }
-    this.curveTo(left + dx * ONE_MINUS_QUARTER, bottom, left, bottom - dy * ONE_MINUS_QUARTER, left, bottom - dy);
-    if (dy < height * 0.5) {
-        this.lineTo(left, top + dy);
+math.sum = function (values) {
+    var i,
+        n = values.length,
+        total = 0;
+    for (i = 0; i < n; i += 1) {
+        total += values[i];
     }
-    this.curveTo(left, top + dy * ONE_MINUS_QUARTER, left + dx * ONE_MINUS_QUARTER, top, left + dx, top);
-    this.close();
+    return total;
 };
 
-Path.prototype.addEllipse = function (x, y, width, height) {
-    var dx = KAPPA * 0.5 * width;
-    var dy = KAPPA * 0.5 * height;
-    var x0 = x + 0.5 * width;
-    var y0 = y + 0.5 * height;
-    var x1 = x + width;
-    var y1 = y + height;
+math.round = function (x, decimals) {
+    return (!decimals) ?
+            Math.round(x) :
+            Math.round(x * Math.pow(10, decimals)) / Math.pow(10, decimals);
+};
 
-    this.moveTo(x, y0);
-    this.curveTo(x, y0 - dy, x0 - dx, y, x0, y);
-    this.curveTo(x0 + dx, y, x1, y0 - dy, x1, y0);
-    this.curveTo(x1, y0 + dy, x0 + dx, y1, x0, y1);
-    this.curveTo(x0 - dx, y1, x, y0 + dy, x, y0);
-    this.close();
+math.sign = function (x) {
+    if (x < 0) { return -1; }
+    if (x > 0) { return +1; }
+    return 0;
 };
 
-Path.prototype.addLine = function (x1, y1, x2, y2) {
-    this.moveTo(x1, y1);
-    this.lineTo(x2, y2);
+math.degrees = function (radians) {
+    return radians * 180 / Math.PI;
 };
 
-Path.prototype.addQuad = function (x1, y1, x2, y2, x3, y3, x4, y4) {
-    this.moveTo(x1, y1);
-    this.lineTo(x2, y2);
-    this.lineTo(x3, y3);
-    this.lineTo(x4, y4);
-    this.close();
+math.radians = function (degrees) {
+    return degrees / 180 * Math.PI;
 };
 
-Path.prototype.addArc = function (x, y, width, height, startAngle, degrees, arcType) {
-    arcType = arcType || 'pie';
-    var w, h, angStRad, ext, arcSegs, increment, cv, lineSegs,
-        index, angle, relX, relY, coords;
-    w = width / 2;
-    h = height / 2;
-    angStRad = math.radians(startAngle);
-    ext = degrees;
-
-    if (ext >= 360.0 || ext <= -360) {
-        arcSegs = 4;
-        increment = Math.PI / 2;
-        cv = 0.5522847498307933;
-        if (ext < 0) {
-            increment = -increment;
-            cv = -cv;
-        }
+math.clamp = function (v, min, max) {
+    if (min < max) {
+        return v < min ? min : v > max ? max : v;
     } else {
-        arcSegs = Math.ceil(Math.abs(ext) / 90.0);
-        increment = math.radians(ext / arcSegs);
-        cv = 4.0 / 3.0 * Math.sin(increment / 2.0) / (1.0 + Math.cos(increment / 2.0));
-        if (cv === 0) {
-            arcSegs = 0;
-        }
-    }
-
-    if (arcType === 'open') {
-        lineSegs = 0;
-    } else if (arcType === 'chord') {
-        lineSegs = 1;
-    } else if (arcType === 'pie') {
-        lineSegs = 2;
+        return v < max ? max : v > min ? min : v;
     }
+};
 
-    if (w < 0 || h < 0) {
-        arcSegs = lineSegs = -1;
-    }
+// Snaps a value to a virtual grid. Distance defines the spacing between grid lines.
+// Strength defines how strongly the values move to the grid. If 1, the values will always
+// be on the grid lines, if 0, the value is unchanged.
+math.snap = function (v, distance, strength) {
+    strength = strength !== undefined ? strength : 1;
+    return (v * (1.0 - strength)) + (strength * Math.round(v / distance) * distance);
+};
 
-    index = 0;
-    while (index <= arcSegs + lineSegs) {
-        angle = angStRad;
-        if (index === 0) {
-            this.moveTo(x + Math.cos(angle) * w, y + Math.sin(angle) * h);
-        } else if (index > arcSegs) {
-            if (index === arcSegs + lineSegs) {
-                this.close();
-            } else {
-                this.lineTo(x, y);
-            }
-        } else {
-            angle += increment * (index - 1);
-            relX = Math.cos(angle);
-            relY = Math.sin(angle);
-            coords = [];
-            coords.push(x + (relX - cv * relY) * w);
-            coords.push(y + (relY + cv * relX) * h);
-            angle += increment;
-            relX = Math.cos(angle);
-            relY = Math.sin(angle);
-            coords.push(x + (relX + cv * relY) * w);
-            coords.push(y + (relY - cv * relX) * h);
-            coords.push(x + relX * w);
-            coords.push(y + relY * h);
-            Path.prototype.curveTo.apply(this, coords);
-        }
-        index += 1;
+math.dot = function (a, b) {
+    var m = Math.min(a.length, b.length),
+        n = 0,
+        i;
+    for (i = 0; i < m; i += 1) {
+        n += a[i] * b[i];
     }
+    return n;
 };
 
-Path.prototype.colorize = function (options) {
-    var args = arguments;
-    if (typeof options !== 'object' || options instanceof Color) {
-        options = {};
-        if (args[0] !== undefined) { options.fill = args[0]; }
-        if (args[1] !== undefined) { options.stroke = args[1]; }
-        if (args[2] !== undefined) { options.strokeWidth = args[2]; }
-    }
-    var p = this.clone();
-    if (options.fill) {
-        p.fill = Color.clone(options.fill);
-    }
-    if (options.stroke) {
-        p.stroke = Color.clone(options.stroke);
-    }
-    if (options.strokeWidth || options.strokeWidth === 0) {
-        p.strokeWidth = options.strokeWidth;
+// Linearly interpolate between from and to for t=0-1.
+// If clamp=true, values outside of 0-1 will be clamped.
+var _lerp = math.mix = math.lerp = function (from, to, t, clamp) {
+    if (clamp) {
+        if (t < 0) { return from; }
+        if (t > 1) { return to; }
     }
-    return p;
+    return from + (to - from) * t;
 };
 
-Path.prototype.desaturate = function (options) {
-    var p = this.clone();
-    var fill = p.fill;
-    var stroke = p.stroke;
-    if (!(fill instanceof Color)) {
-        fill = Color.parse(fill);
-    }
-    if (!(stroke instanceof Color)) {
-        stroke = Color.parse(stroke);
+// Compute fade curve for point t.
+function _fade(t) {
+    return t * t * t * (t * (t * 6 - 15) + 10);
+}
+
+// Convert low 4 bits of hash code into 12 gradient directions.
+function _grad(hash, x, y, z) {
+    var h, u, v;
+    h = hash & 15;
+    u = h < 8 ? x : y;
+    v = h < 4 ? y : h === 12 || h === 14 ? x : z;
+    return ((h & 1) === 0 ? u : -u) + ((h & 2) === 0 ? v : -v);
+}
+
+function _scale(n) {
+    return (1 + n) / 2;
+}
+
+var _permutation = (function () {
+    var permutation, p, i;
+    permutation = [ 151, 160, 137, 91, 90, 15,
+        131, 13, 201, 95, 96, 53, 194, 233, 7, 225, 140, 36, 103, 30, 69, 142, 8, 99, 37, 240, 21, 10, 23,
+        190, 6, 148, 247, 120, 234, 75, 0, 26, 197, 62, 94, 252, 219, 203, 117, 35, 11, 32, 57, 177, 33,
+        88, 237, 149, 56, 87, 174, 20, 125, 136, 171, 168, 68, 175, 74, 165, 71, 134, 139, 48, 27, 166,
+        77, 146, 158, 231, 83, 111, 229, 122, 60, 211, 133, 230, 220, 105, 92, 41, 55, 46, 245, 40, 244,
+        102, 143, 54, 65, 25, 63, 161, 1, 216, 80, 73, 209, 76, 132, 187, 208, 89, 18, 169, 200, 196,
+        135, 130, 116, 188, 159, 86, 164, 100, 109, 198, 173, 186, 3, 64, 52, 217, 226, 250, 124, 123,
+        5, 202, 38, 147, 118, 126, 255, 82, 85, 212, 207, 206, 59, 227, 47, 16, 58, 17, 182, 189, 28, 42,
+        223, 183, 170, 213, 119, 248, 152, 2, 44, 154, 163, 70, 221, 153, 101, 155, 167, 43, 172, 9,
+        129, 22, 39, 253, 19, 98, 108, 110, 79, 113, 224, 232, 178, 185, 112, 104, 218, 246, 97, 228,
+        251, 34, 242, 193, 238, 210, 144, 12, 191, 179, 162, 241, 81, 51, 145, 235, 249, 14, 239, 107,
+        49, 192, 214, 31, 181, 199, 106, 157, 184, 84, 204, 176, 115, 121, 50, 45, 127, 4, 150, 254,
+        138, 236, 205, 93, 222, 114, 67, 29, 24, 72, 243, 141, 128, 195, 78, 66, 215, 61, 156, 180];
+
+    p = new Uint8Array(512);
+    for (i = 0; i < 256; i += 1) {
+        p[256 + i] = p[i] = permutation[i];
     }
-    p.fill = fill.desaturate(options);
-    p.stroke = stroke.desaturate(options);
     return p;
+}());
+
+// Calculate Perlin noise
+math.noise = function (x, y, z) {
+    var p = _permutation;
+
+    // Find unit cube that contains the point.
+    var X = Math.floor(x) & 255;
+    var Y = Math.floor(y) & 255;
+    var Z = Math.floor(z) & 255;
+    // Find relative x, y, z point in the cube.
+    x -= Math.floor(x);
+    y -= Math.floor(y);
+    z -= Math.floor(z);
+    // Compute fade curves for each x, y, z.
+    var u = _fade(x);
+    var v = _fade(y);
+    var w = _fade(z);
+
+    // Hash coordinates of the 8 cube corners.
+    var A = p[X] + Y;
+    var AA = p[A] + Z;
+    var AB = p[A + 1] + Z;
+    var B = p[X + 1] + Y;
+    var BA = p[B] + Z;
+    var BB = p[B + 1] + Z;
+
+    // Add blended results from 8 corners of the cube.
+    return _scale(_lerp(_lerp(_lerp(_grad(p[AA], x, y, z),
+        _grad(p[BA], x - 1, y, z), u),
+        _lerp(_grad(p[AB], x, y - 1, z),
+             _grad(p[BB], x - 1, y - 1, z), u), v),
+        _lerp(_lerp(_grad(p[AA + 1], x, y, z - 1),
+            _grad(p[BA + 1], x - 1, y, z - 1), u),
+            _lerp(_grad(p[AB + 1], x, y - 1, z - 1),
+                _grad(p[BB + 1], x - 1, y - 1, z - 1), u), v), w));
 };
 
-Path.prototype.invert = function () {
-    var p = this.clone();
-    var fill = p.fill;
-    var stroke = p.stroke;
-    if (!(fill instanceof Color)) {
-        fill = Color.parse(fill);
-    }
-    if (!(stroke instanceof Color)) {
-        stroke = Color.parse(stroke);
+module.exports = math;
+
+},{}],42:[function(require,module,exports){
+// Pseudo-random generator
+
+'use strict';
+
+// Generate a random function that is seeded with the given value.
+function generator(seed) {
+    // Note: the generator didn't work with negative seed values, so here we
+    // transform our original seed into a new (positive) seed value with which we
+    // create a new generator.
+    if (seed < 0) {
+        var gen = generator(Math.abs(seed));
+        for (var i = 0; i < 23; i += 1) {
+            gen();
+        }
+        return generator(gen(0, 10000));
     }
-    p.fill = fill.invert();
-    p.stroke = stroke.invert();
-    return p;
-};
 
-Path.prototype.contours = function () {
-    var contours = [],
-        currentContour = [];
-    _.each(this.commands, function (cmd) {
-        if (cmd.type === MOVETO) {
-            if (currentContour.length !== 0) {
-                contours.push(currentContour);
-            }
-            currentContour = [cmd];
-        } else {
-            currentContour.push(cmd);
-        }
-    });
+    // Based on random number generator from
+    // http://indiegamr.com/generate-repeatable-random-numbers-in-js/
+    return function (min, max) {
+        min = min || 0;
+        max = max || 1;
+        seed = (seed * 9301 + 49297) % 233280;
+        var v = seed / 233280;
+        return min + v * (max - min);
+    };
+}
+
+exports.generator = generator;
+
+},{}],43:[function(require,module,exports){
+// SVG Parser
+
+// The SVG engine uses code from the following libraries:
+// - for parsing the main svg tree: two.js - http://jonobr1.github.io/two.js/
+// - for constructing individual paths: canvg - https://code.google.com/p/canvg/
+// - for constructing arcs: fabric.js - http://fabricjs.com
+
+'use strict';
 
-    if (currentContour.length !== 0) {
-        contours.push(currentContour);
-    }
+var _ = require('lodash');
+var xmldom = require('xmldom');
 
-    return contours;
-};
+var Color = require('../objects/color');
+var Group = require('../objects/group');
+var Path = require('../objects/path');
+var Point = require('../objects/point');
+var Transform = require('../objects/transform');
 
-Path.prototype.bounds = function () {
-    if (this._bounds) { return this._bounds; }
-    if (this.commands.length === 0) { return new Rect(0, 0, 0, 0); }
+// var getReflection = function (a, b, relative) {
+//     var theta,
+//         d = geo.distance(a.x, a.y, b.x, b.y);
 
-    var px, py, prev, right, bottom,
-        minX = Number.MAX_VALUE,
-        minY = Number.MAX_VALUE,
-        maxX = -(Number.MAX_VALUE),
-        maxY = -(Number.MAX_VALUE);
+//     if (d <= 0.0001) {
+//         return relative ? Point.ZERO : a;
+//     }
+//     theta = geo.angle(a.x, a.y, b.x, b.y);
+//     return new Point(
+//         d * Math.cos(theta) + (relative ? 0 : a.x),
+//         d * Math.sin(theta) + (relative ? 0 : a.y)
+//     );
+// };
 
-    _.each(this.commands, function (cmd) {
-        if (cmd.type === MOVETO || cmd.type === LINETO) {
-            px = cmd.x;
-            py = cmd.y;
-            if (px < minX) { minX = px; }
-            if (py < minY) { minY = py; }
-            if (px > maxX) { maxX = px; }
-            if (py > maxY) { maxY = py; }
-            prev = cmd;
-        } else if (cmd.type === CURVETO) {
-            var r = bezier.extrema(prev.x, prev.y, cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x, cmd.y);
-            right = r.x + r.width;
-            bottom = r.y + r.height;
-            if (r.x < minX) { minX = r.x; }
-            if (right > maxX) { maxX = right; }
-            if (r.y < minY) { minY = r.y; }
-            if (bottom > maxY) { maxY = bottom; }
-            prev = cmd;
-        }
-    });
+var trim = function (s) {
+    return s.replace(/^\s+|\s+$/g, '');
+};
 
-    return new Rect(minX, minY, maxX - minX, maxY - minY);
+var compressSpaces = function (s) {
+    return s.replace(/[\s\r\t\n]+/gm, ' ');
 };
 
-// Returns the DynamicPathElement at time t (0.0-1.0) on the path.
-Path.prototype.point = function (t, segmentLengths) {
-    if (segmentLengths === undefined) {
-        // Cache the segment lengths for performance.
-        segmentLengths = bezier.segmentLengths(this.commands, true, 10);
+var toNumberArray = function (s) {
+    var i,
+        a = trim(compressSpaces((s || '').replace(/,/g, ' '))).split(' ');
+    for (i = 0; i < a.length; i += 1) {
+        a[i] = parseFloat(a[i]);
     }
-    return bezier.point(this, t, segmentLengths);
+    return a;
 };
 
-// Returns an array of DynamicPathElements along the path.
-// To omit the last point on closed paths: {end: 1-1.0/amount}
-Path.prototype.points = function (amount, options) {
-    var start = (options && options.start !== undefined) ? options.start : 0.0;
-    var end = (options && options.end !== undefined) ? options.end : 1.0;
-    if (this.commands.length === 0) {
-        // Otherwise bezier.point() will raise an error for empty paths.
-        return [];
-    }
-    amount = Math.round(amount);
-    // "d" is the delta value for each point.
-    // For closed paths (e.g. a circle), we don't want the last point, because it will equal the first point.
-    // For open paths (e.g. a line) we do want the last point, so we use amount - 1.
-    // E.g. If amount=4, and path is open, we want the point at t 0.0, 0.33, 0.66 and 1.0.
-    // E.g. If amount=2, and path is open, we want the point at t 0.0 and 1.0.
-    var d;
-    if (options && options.closed) {
-        d = (amount > 1) ? (end - start) / amount : (end - start);
+var readSvgAttributes = function (node, parentAttributes) {
+    var fill, fillOpacity, stroke, strokeOpacity, strokeWidth, opacity, color, transforms, types, transform, i, attributes;
+
+    if (parentAttributes) {
+        attributes = Object.create(parentAttributes);
     } else {
-        d = (amount > 1) ? (end - start) / (amount - 1) : (end - start);
-    }
-    var pts = [];
-    var segmentLengths = bezier.segmentLengths(this.commands, true, 10);
-    for (var i = 0; i < amount; i += 1) {
-        pts.push(this.point(start + d * i, segmentLengths));
+        attributes = {};
     }
-    return pts;
-};
 
-// Returns an approximation of the total length of the path.
-Path.prototype.length = function (precision) {
-    if (precision === undefined) { precision = 20; }
-    return bezier.length(this, precision);
-};
+    transforms = [];
+    types = {};
 
-// Returns true when point (x,y) falls within the contours of the path.
-Path.prototype.contains = function (x, y, precision) {
-    var points = this.points(precision !== undefined ? precision : 100);
-    return geo.pointInPolygon(points, x, y);
-};
+    types.translate = function (s) {
+        var a = toNumberArray(s),
+            tx = a[0],
+            ty = a[1] || 0;
+        return new Transform().translate(tx, ty);
+    };
 
-Path.prototype.resampleByAmount = function (points, perContour) {
-    var subPaths = perContour ? this.contours() : [this.commands];
-    var p = new Path([], this.fill, this.stroke, this.strokeWidth);
-    for (var j = 0; j < subPaths.length; j += 1) {
-        var subPath = new Path(subPaths[j]);
-        var options = {};
-        if (subPath.isClosed()) {
-            options.closed = true;
-        }
-        var pts = subPath.points(points, options);
-        for (var i = 0; i < pts.length; i += 1) {
-            if (i === 0) {
-                p.moveTo(pts[i].x, pts[i].y);
-            } else {
-                p.lineTo(pts[i].x, pts[i].y);
-            }
-        }
-        if (subPath.isClosed()) {
-            p.close();
-        }
-    }
-    return p;
-};
+    types.scale = function (s) {
+        var a = toNumberArray(s),
+            sx = a[0],
+            sy = a[1] || sx;
+        return new Transform().scale(sx, sy);
+    };
 
-Path.prototype.resampleByLength = function (segmentLength, options) {
-    options = options || {};
-    var force = options.force || false;
-    var subPaths = this.contours();
-    var commands = [];
-    if (!force) {
-        segmentLength = Math.max(segmentLength, 1);
-    }
-    for (var i = 0; i < subPaths.length; i += 1) {
-        var subPath = new Path(subPaths[i]);
-        var contourLength = subPath.length();
-        var amount = Math.ceil(contourLength / segmentLength);
-        commands = commands.concat(subPath.resampleByAmount(amount).commands);
-    }
-    return new Path(commands, this.fill, this.stroke, this.strokeWidth);
-};
+    types.rotate = function (s) {
+        var t,
+            a = toNumberArray(s),
+            r = a[0],
+            tx = a[1] || 0,
+            ty = a[2] || 0;
+        t = new Transform();
+        t = t.translate(tx, ty);
+        t = t.rotate(r);
+        t = t.translate(-tx, -ty);
+        return t;
+    };
 
-Path.prototype.toPathData = function () {
-    var i, d, cmd, x, y, x1, y1, x2, y2;
-    d = '';
-    for (i = 0; i < this.commands.length; i += 1) {
-        cmd = this.commands[i];
-        if (cmd.x !== undefined) {
-            x = math.clamp(cmd.x, -9999, 9999);
-            y = math.clamp(cmd.y, -9999, 9999);
-        }
-        if (cmd.x1 !== undefined) {
-            x1 = math.clamp(cmd.x1, -9999, 9999);
-            y1 = math.clamp(cmd.y1, -9999, 9999);
-        }
-        if (cmd.x2 !== undefined) {
-            x2 = math.clamp(cmd.x2, -9999, 9999);
-            y2 = math.clamp(cmd.y2, -9999, 9999);
-        }
-        if (cmd.type === MOVETO) {
-            if (!isNaN(x) && !isNaN(y)) {
-                d += 'M' + x + ' ' + y;
+    types.matrix = function (s) {
+        var m = toNumberArray(s);
+        return new Transform([m[0], m[1], 0, m[2], m[3], 0, m[4], m[5], 1]);
+    };
+
+    _.each(node.attributes, function (v) {
+        var property, data, type, s, d;
+        property = v.nodeName;
+
+        switch (property) {
+        case 'transform':
+            data = trim(compressSpaces(v.nodeValue)).replace(/\)(\s?,\s?)/g, ') ').split(/\s(?=[a-z])/);
+            for (i = 0; i < data.length; i += 1) {
+                type = trim(data[i].split('(')[0]);
+                s = data[i].split('(')[1].replace(')', '');
+                transform = types[type](s);
+                transforms.push(transform);
+            }
+            break;
+        case 'visibility':
+//          elem.visible = !!v.nodeValue;
+            break;
+        case 'stroke-linecap':
+//          elem.cap = v.nodeValue;
+            break;
+        case 'stroke-linejoin':
+//          elem.join = v.nodeValue;
+            break;
+        case 'stroke-miterlimit':
+//          elem.miter = v.nodeValue;
+            break;
+        case 'stroke-width':
+            strokeWidth = parseFloat(v.nodeValue);
+            break;
+        case 'stroke-opacity':
+            strokeOpacity = parseFloat(v.nodeValue);
+            break;
+        case 'fill-opacity':
+            fillOpacity = parseFloat(v.nodeValue);
+            break;
+        case 'fill':
+            fill = v.nodeValue;
+            break;
+        case 'stroke':
+            stroke = v.nodeValue;
+            break;
+        case 'opacity':
+            opacity = parseFloat(v.nodeValue);
+            break;
+        case 'color':
+            color = v.nodeValue;
+            break;
+        case 'style':
+            d = {};
+            _.each(v.nodeValue.split(';'), function (s) {
+                var el = s.split(':');
+                d[el[0].trim()] = el[1];
+            });
+            if (d.fill) {
+                fill = d.fill;
             }
-        } else if (cmd.type === LINETO) {
-            if (!isNaN(x) && !isNaN(y)) {
-                d += 'L' + x + ' ' + y;
+            if (d.stroke) {
+                stroke = d.stroke;
             }
-        } else if (cmd.type === QUADTO) {
-            if (!isNaN(x) && !isNaN(y) && !isNaN(x1) && !isNaN(y1)) {
-                d += 'Q' + x1 + ' ' + y1 + ' ' + x + ' ' + y;
+            if (d['stroke-width'] !== undefined) {
+                strokeWidth = parseFloat(d['stroke-width']);
             }
-        } else if (cmd.type === CURVETO) {
-            if (!isNaN(x) && !isNaN(y) && !isNaN(x1) && !isNaN(y1) && !isNaN(x2) && !isNaN(y2)) {
-                d += 'C' + x1 + ' ' + y1 + ' ' + x2 + ' ' + y2 + ' ' + x + ' ' + y;
+            if (d['stroke-opacity'] !== undefined) {
+                strokeOpacity = parseFloat(d['stroke-opacity']);
             }
-        } else if (cmd.type === CLOSE) {
-            d += 'Z';
+            if (d['fill-opacity'] !== undefined) {
+                fillOpacity = parseFloat(d['fill-opacity']);
+            }
+            if (d.opacity !== undefined) {
+                opacity = parseFloat(d.opacity);
+            }
+            if (d.color) {
+                color = d.color;
+            }
+            break;
         }
-    }
-    return d;
-};
-
-// Output the path as an SVG string.
-Path.prototype.toSVG = function () {
-    var svg = '<path d="';
-    svg += this.toPathData();
-    svg += '"';
-
-    var style = '';
+    });
 
-    var fill;
-    var fillOpacity;
-    if (this.fill) {
-        fill = Color.parse(this.fill);
-        if (fill.a < 1) {
-            fillOpacity = fill.a;
-        }
-        fill = Color.toHex(fill).substring(0, 7);
+    if (fill !== undefined) {
+        attributes.fill = fill;
     }
-
-    if (fill !== 'black' && fill !== '#000000') {
-        if (fill === null || fill === undefined) {
-            style += 'fill:none;';
-        } else {
-            style += 'fill:' + fill + ';';
-        }
+    if (stroke !== undefined) {
+        attributes.stroke = stroke;
     }
-
     if (fillOpacity !== undefined) {
-        style += 'fill-opacity:' + fillOpacity + ';';
-    }
-
-    var stroke;
-    var strokeOpacity;
-
-    if (this.stroke) {
-        stroke = Color.parse(this.stroke);
-        if (stroke.a < 1) {
-            strokeOpacity = stroke.a;
-        }
-        stroke = Color.toHex(stroke).substring(0, 7);
-    }
-    if (stroke) {
-        style += 'stroke:' + stroke + ';';
-        style += 'stroke-width:' + this.strokeWidth + ';';
+        attributes.fillOpacity = fillOpacity;
     }
     if (strokeOpacity !== undefined) {
-        style += 'stroke-opacity:' + strokeOpacity + ';';
-    }
-    if (style) {
-        svg += ' style="' + style + '"';
+        attributes.strokeOpacity = strokeOpacity;
     }
-    svg += '/>';
-    return svg;
-};
-
-// Draw the path to a 2D context.
-Path.prototype.draw = function (ctx) {
-    var nCommands, i, cmd;
-    ctx.beginPath();
-    nCommands = this.commands.length;
-    for (i = 0; i < nCommands; i += 1) {
-        cmd = this.commands[i];
-        if (cmd.type === MOVETO) {
-            ctx.moveTo(cmd.x, cmd.y);
-        } else if (cmd.type === LINETO) {
-            ctx.lineTo(cmd.x, cmd.y);
-        } else if (cmd.type === QUADTO) {
-            ctx.quadraticCurveTo(cmd.x1, cmd.y1, cmd.x, cmd.y);
-        } else if (cmd.type === CURVETO) {
-            ctx.bezierCurveTo(cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x, cmd.y);
-        } else if (cmd.type === CLOSE) {
-            ctx.closePath();
-        }
+    if (strokeWidth !== undefined) {
+        attributes.strokeWidth = strokeWidth;
     }
-    if (this.fill !== null && this.fill !== undefined) {
-        ctx.fillStyle = Color.toCSS(this.fill);
-        ctx.fill();
+    if (opacity !== undefined) {
+        attributes.opacity = opacity;
     }
-    if (this.stroke !== null && this.stroke !== undefined && this.strokeWidth !== null && this.strokeWidth > 0) {
-        ctx.strokeStyle = Color.toCSS(this.stroke);
-        ctx.lineWidth = this.strokeWidth;
-        ctx.stroke();
+    if (color !== undefined && color !== 'currentColor') {
+        attributes.color = color;
     }
-};
-
-Path.combine = function () {
-    var shapes = _.flatten(arguments);
-    var commands = [];
-    for (var i = 0; i < shapes.length; i += 1) {
-        var shape = shapes[i];
-        if (shape.commands) {
-            commands = commands.concat(shape.commands);
-        } else if (shape.shapes) {
-            commands = commands.concat(Path.combine(shape.shapes).commands);
+    if (transforms.length > 0) {
+        transform = new Transform();
+        for (i = 0; i < transforms.length; i += 1) {
+            transform = transform.append(transforms[i]);
+        }
+        if (!transform.isIdentity()) {
+            if (attributes.transform) {
+                attributes.transform = attributes.transform.append(transform);
+            } else {
+                attributes.transform = transform;
+            }
         }
     }
-    return new Path(commands);
-};
-
-module.exports = Path;
-
-},{"../objects/color":28,"../objects/rect":33,"../util/bezier":38,"../util/geo":40,"../util/math":42,"lodash":3}],32:[function(require,module,exports){
-// 2-dimensional point object.
-
-'use strict';
-
-var Point = function (x, y) {
-    this.x = x !== undefined ? x : 0;
-    this.y = y !== undefined ? y : 0;
+    return attributes;
 };
 
-Object.defineProperty(Point.prototype, 'xy', {
-    get: function () { return [this.x, this.y]; }
-});
-
-Point.ZERO = new Point(0, 0);
-
-Point.read = function (x, y) {
-    if (arguments.length === 2) { return new Point(x, y); }
-    var arg = x;
-    if (arg instanceof Point) {
-        return arg;
-    } else if (typeof arg === 'number') {
-        return new Point(arg, arg);
-    } else if (Array.isArray(arg)) {
-        if (arg.length === 0) { return Point.ZERO; }
-        x = arg[0];
-        y = arg.length > 1 ? arg[1] : x;
-        return new Point(x, y);
-    } else if (arg.x !== undefined && arg.y !== undefined) {
-        return new Point(arg.x, arg.y);
-    } else {
-        return Point.ZERO;
+var applySvgAttributes = function (shape, attributes) {
+    var fill = attributes.fill;
+    if (shape.commands && shape.commands.length > 0 && fill === undefined) {
+        fill = 'black';
     }
-};
-
-Point.prototype.clone = function () {
-    return new Point(this.x, this.y);
-};
-
-Point.prototype.add = function (v) {
-    return new Point(this.x + v.x, this.y + v.y);
-};
-
-Point.prototype.subtract = Point.prototype.sub = function (v) {
-    return new Point(this.x - v.x, this.y - v.y);
-};
-
-Point.prototype.divide = function (n) {
-    return new Point(this.x / n, this.y / n);
-};
-
-Point.prototype.multiply = function (n) {
-    return new Point(this.x * n, this.y * n);
-};
-
-Point.prototype.magnitude = function () {
-    return Math.sqrt(this.x * this.x + this.y * this.y);
-};
-
-Point.prototype.magnitudeSquared = function () {
-    return this.x * this.x + this.y * this.y;
-};
+    var fillOpacity = attributes.fillOpacity;
+    var stroke = attributes.stroke;
+    var strokeOpacity = attributes.strokeOpacity;
+    var opacity = attributes.opacity;
+    var strokeWidth = attributes.strokeWidth;
+    var transform = attributes.transform;
+    var color = attributes.color;
 
-Point.prototype.heading = function () {
-    return Math.atan2(this.y, this.x);
-};
+    if (fill === 'currentColor') {
+        fill = color === undefined ? 'black' : color;
+    }
+    if (fill !== undefined) {
+        fill = Color.parse(fill);
+        if (fillOpacity !== undefined) {
+            fill.a *= fillOpacity;
+        }
+        if (opacity !== undefined) {
+            fill.a *= opacity;
+        }
+    }
 
-Point.prototype.distanceTo = function (v) {
-    var dx = this.x - v.x,
-        dy = this.y - v.y;
-    return Math.sqrt(dx * dx + dy * dy);
-};
+    if (stroke === 'currentColor') {
+        stroke = color === undefined ? 'black' : color;
+    }
+    if (stroke !== undefined) {
+        stroke = Color.parse(stroke);
+        if (strokeOpacity !== undefined) {
+            stroke.a *= strokeOpacity;
+        }
+        if (opacity !== undefined) {
+            stroke.a *= opacity;
+        }
+    }
 
-Point.prototype.normalize = function () {
-    var m = this.magnitude();
-    if (m !== 0) {
-        return this.divide(m);
+    var commands;
+    if (transform) {
+        commands = transform.transformShape(shape).commands;
     } else {
-        return Point.ZERO;
+        commands = shape.commands;
     }
-};
-
-Point.prototype.limit = function (speed) {
-    if (this.magnitudeSquared() > speed * speed) {
-        return this.normalize().multiply(speed);
+    var f = (fill === undefined) ? shape.fill : fill,
+        s = (stroke === undefined) ? shape.stroke : stroke,
+        sw = (strokeWidth === undefined) ? shape.strokeWidth : strokeWidth;
+    if (sw !== undefined && transform !== undefined) {
+        sw *= transform.m[0];
     }
-    return this;
-};
-
-Point.prototype.translate = function (tx, ty) {
-    return new Point(this.x + tx, this.y + ty);
-};
-
-Point.prototype.scale = function (sx, sy) {
-    sy = sy !== undefined ? sy : sx;
-    return new Point(this.x * sx, this.y * sy);
-};
-
-Point.prototype.toString = function () {
-    return '[' + this.x + ', ' + this.y + ']';
+    return new Path(commands, f, s, sw);
 };
 
-module.exports = Point;
-},{}],33:[function(require,module,exports){
-// Rectangle object
-
-'use strict';
+var arcToSegments = function (x, y, rx, ry, large, sweep, rotateX, ox, oy) {
+/*    argsString = _join.call(arguments);
+    if (arcToSegmentsCache[argsString]) {
+      return arcToSegmentsCache[argsString];
+    } */
+    var th, sinTh, cosTh, px, py, pl,
+        a00, a01, a10, a11, x0, y0, x1, y1,
+        d, sFactorSq, sFactor, xc, yc,
+        th0, th1, thArc,
+        segments, result, th2, th3, i;
 
-var Point = require('../objects/point');
+    th = rotateX * (Math.PI / 180);
+    sinTh = Math.sin(th);
+    cosTh = Math.cos(th);
+    rx = Math.abs(rx);
+    ry = Math.abs(ry);
+    px = cosTh * (ox - x) * 0.5 + sinTh * (oy - y) * 0.5;
+    py = cosTh * (oy - y) * 0.5 - sinTh * (ox - x) * 0.5;
+    pl = (px * px) / (rx * rx) + (py * py) / (ry * ry);
+    if (pl > 1) {
+        pl = Math.sqrt(pl);
+        rx *= pl;
+        ry *= pl;
+    }
 
-var Rect = function (x, y, width, height) {
-    this.x = x !== undefined ? x : 0;
-    this.y = y !== undefined ? y : 0;
-    this.width = width !== undefined ? width : 0;
-    this.height = height !== undefined ? height : 0;
-};
+    a00 = cosTh / rx;
+    a01 = sinTh / rx;
+    a10 = (-sinTh) / ry;
+    a11 = cosTh / ry;
+    x0 = a00 * ox + a01 * oy;
+    y0 = a10 * ox + a11 * oy;
+    x1 = a00 * x + a01 * y;
+    y1 = a10 * x + a11 * y;
 
-Object.defineProperty(Rect.prototype, 'xywh', {
-    get: function () { return [this.x, this.y, this.width, this.height]; }
-});
+    d = (x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0);
+    sFactorSq = 1 / d - 0.25;
+    if (sFactorSq < 0) { sFactorSq = 0; }
+    sFactor = Math.sqrt(sFactorSq);
+    if (sweep === large) { sFactor = -sFactor; }
+    xc = 0.5 * (x0 + x1) - sFactor * (y1 - y0);
+    yc = 0.5 * (y0 + y1) + sFactor * (x1 - x0);
 
-// Returns a new rectangle where width and height are guaranteed to be positive values.
-Rect.prototype.normalize = function () {
-    var x = this.x,
-        y = this.y,
-        width = this.width,
-        height = this.height;
+    th0 = Math.atan2(y0 - yc, x0 - xc);
+    th1 = Math.atan2(y1 - yc, x1 - xc);
 
-    if (width < 0) {
-        x += width;
-        width = -width;
+    thArc = th1 - th0;
+    if (thArc < 0 && sweep === 1) {
+        thArc += 2 * Math.PI;
+    } else if (thArc > 0 && sweep === 0) {
+        thArc -= 2 * Math.PI;
     }
 
-    if (height < 0) {
-        y += height;
-        height = -height;
+    segments = Math.ceil(Math.abs(thArc / (Math.PI * 0.5 + 0.001)));
+    result = [];
+    for (i = 0; i < segments; i += 1) {
+        th2 = th0 + i * thArc / segments;
+        th3 = th0 + (i + 1) * thArc / segments;
+        result[i] = [xc, yc, th2, th3, rx, ry, sinTh, cosTh];
     }
-    return new Rect(x, y, width, height);
-};
 
-Rect.prototype.containsPoint = function (x, y) {
-    if (arguments.length === 1) {
-        y = x.y;
-        x = x.x;
-    }
-    return (x >= this.x && x <= this.x + this.width && y >= this.y && y <= this.y + this.height);
+//    arcToSegmentsCache[argsString] = result;
+    return result;
 };
 
-Rect.prototype.containsRect = function (r) {
-    return r.x >= this.x && r.x + r.width <= this.x + this.width &&
-        r.y >= this.y && r.y + r.height <= this.y + this.height;
-};
+var segmentToBezier = function (cx, cy, th0, th1, rx, ry, sinTh, cosTh) {
+//    argsString = _join.call(arguments);
+//    if (segmentToBezierCache[argsString]) {
+//      return segmentToBezierCache[argsString];
+//    }
 
-Rect.prototype.grow = function (dx, dy) {
-    var x = this.x - dx,
-        y = this.y - dy,
-        width = this.width + dx * 2,
-        height = this.height + dy * 2;
-    return new Rect(x, y, width, height);
-};
+    var a00 = cosTh * rx,
+        a01 = -sinTh * ry,
+        a10 = sinTh * rx,
+        a11 = cosTh * ry,
 
-Rect.prototype.unite = function (r) {
-    var x = Math.min(this.x, r.x),
-        y = Math.min(this.y, r.y),
-        width = Math.max(this.x + this.width, r.x + r.width) - x,
-        height = Math.max(this.y + this.height, r.y + r.height) - y;
-    return new Rect(x, y, width, height);
-};
+        thHalf = 0.5 * (th1 - th0),
+        t = (8 / 3) * Math.sin(thHalf * 0.5) * Math.sin(thHalf * 0.5) / Math.sin(thHalf),
+        x1 = cx + Math.cos(th0) - t * Math.sin(th0),
+        y1 = cy + Math.sin(th0) + t * Math.cos(th0),
+        x3 = cx + Math.cos(th1),
+        y3 = cy + Math.sin(th1),
+        x2 = x3 + t * Math.sin(th1),
+        y2 = y3 - t * Math.cos(th1);
 
-Rect.prototype.addPoint = function (x, y) {
-    var dx, dy,
-        _x = this.x,
-        _y = this.y,
-        width = this.width,
-        height = this.height;
+//    segmentToBezierCache[argsString] = [
+    return [
+        a00 * x1 + a01 * y1, a10 * x1 + a11 * y1,
+        a00 * x2 + a01 * y2,      a10 * x2 + a11 * y2,
+        a00 * x3 + a01 * y3,      a10 * x3 + a11 * y3
+    ];
 
-    if (x < this.x) {
-        dx = this.x - x;
-        _x = x;
-        width += dx;
-    } else if (x > this.x + this.width) {
-        dx = x - (this.x + this.width);
-        width += dx;
-    }
-    if (y < this.y) {
-        dy = this.y - y;
-        _y = y;
-        height += dy;
-    } else if (y > this.y + this.height) {
-        dy = y - (this.y + this.height);
-        height += dy;
-    }
-    return new Rect(_x, _y, width, height);
+//    return segmentToBezierCache[argsString];
 };
 
-Rect.prototype.centerPoint = function () {
-    return new Point(this.x + this.width / 2, this.y + this.height / 2);
-};
+var read = {
 
-module.exports = Rect;
-},{"../objects/point":32}],34:[function(require,module,exports){
-// Text object
+    svg: function () {
+        return read.g.apply(this, arguments);
+    },
 
-// Internally the object is called "GText" to avoid conflicts with the DOM Text object.
-// Externally it is exposed as g.Text.
+    g: function (node, parentAttributes) {
+        var shapes = [];
+        var attributes = readSvgAttributes(node, parentAttributes);
 
-'use strict';
+        _.each(node.childNodes, function (n) {
 
-var Color = require('../objects/color');
-var Rect = require('../objects/rect');
-var Transform = require('../objects/transform');
+            var tag, tagName, o;
+            tag = n.nodeName;
+            if (!tag) { return; }
+            tagName = tag.replace(/svg\:/ig, '').toLowerCase();
+            if (read[tagName] !== undefined) {
+                o = read[tagName].call(this, n, attributes);
+                shapes.push(o);
+            }
+        });
 
-var _dummyContext = null;
+        return new Group(shapes);
+    },
 
-// Generates a Text object.
-// The function can take many possible argument forms, either by listing them in order
-// (text, x, y, fontFamily, fontSize, align, fill), or by using an options object.
-// The position can be specified as x, y; using a point {x: 10, y: 20} or using an array [10, 20].
-// Here are a couple of ways to generate 'Hello' at position 0, 0 in 12pt Helvetica, centered.
-//
-//     new g.Text('Hello', {x: 0, y: 0}, 'Helvetica', 12, 'center');
-//     new g.Text('Hello', [0, 0], {fontFamily: 'Helvetica', fontSize: 12, textAlign: 'center'});
-//     new g.Text('Hello', 0, 0, {fontFamily: 'Helvetica', fontSize: 12});  // align: center is the default.
-//     new g.Text('Hello', {fontFamily: 'Helvetica', fontSize: 12}); // the position defaults to 0,0.
-var GText = function (text) {
-    var args = Array.prototype.slice.call(arguments, 1),
-        secondArg = arguments[1],
-        thirdArg = arguments[2],
-        lastArg = arguments[arguments.length - 1],
-        options;
+    _polyline: function (node) {
+        var points = node.getAttribute('points');
+        var p = new Path();
+        points.replace(/([\d\.?]+),([\d\.?]+)/g, function (match, p1, p2) {
+            var x = parseFloat(p1);
+            var y = parseFloat(p2);
+            if (p.commands.length === 0) {
+                p.moveTo(x, y);
+            } else {
+                p.lineTo(x, y);
+            }
+        });
+        return p;
+    },
+
+    polygon: function (node, parentAttributes) {
+        var attributes = readSvgAttributes(node, parentAttributes);
+        var p = read._polyline(node);
+        p.close();
+        return applySvgAttributes(p, attributes);
+    },
 
-    // The text is required and always the first argument.
-    this.text = String(text);
+    polyline: function (node, parentAttributes) {
+        var attributes = readSvgAttributes(node, parentAttributes);
+        var p = read._polyline(node);
+        return applySvgAttributes(p, attributes);
+    },
 
-    // Second argument is position (as object or array) or x (as number).
-    if (typeof secondArg === 'number') {
-        this.x = secondArg;
-        this.y = thirdArg;
-        args = args.slice(2);
-    } else if (Array.isArray(secondArg)) {
-        this.x = secondArg[0];
-        this.y = secondArg[1];
-        args = args.slice(1);
-    } else if (typeof secondArg === 'object') {
-        this.x = secondArg.x !== undefined ? secondArg.x : 0;
-        this.y = secondArg.y !== undefined ? secondArg.y : 0;
-        args = args.slice(1);
-    } else {
-        this.x = 0;
-        this.y = 0;
-    }
+    rect: function (node, parentAttributes) {
+        var attributes = readSvgAttributes(node, parentAttributes);
+        var x = parseFloat(node.getAttribute('x'));
+        var y = parseFloat(node.getAttribute('y'));
+        if (!x) { x = 0; }
+        if (!y) { y = 0; }
+        var width = parseFloat(node.getAttribute('width'));
+        var height = parseFloat(node.getAttribute('height'));
+        if (!width) { width = 0; }
+        if (!height) { height = 0; }
+        if (width < 0) {
+            console.error('Error: invalid negative value for <rect> attribute width="' + width + '"');
+            width = 0;
+        }
+        if (height < 0) {
+            console.error('Error: invalid negative value for <rect> attribute height="' + height + '"');
+            height = 0;
+        }
+        var rx = parseFloat(node.getAttribute('rx'));
+        var ry = parseFloat(node.getAttribute('ry'));
+        if (!rx) { rx = 0; }
+        if (!ry) { ry = 0; }
+        if (rx < 0) {
+            console.error('Error: invalid negative value for <rect> attribute rx="' + rx + '"');
+            rx = 0;
+        }
+        if (ry < 0) {
+            console.error('Error: invalid negative value for <rect> attribute ry="' + ry + '"');
+            ry = 0;
+        }
+        if (!rx || !ry) {
+            rx = ry = Math.max(rx, ry);
+        }
+        if (rx > width / 2) { rx = width / 2; }
+        if (ry > height / 2) { ry = height / 2; }
+        var p = new Path();
+        if (rx && ry) {
+            p.addRoundedRect(x, y, width, height, rx, ry);
+        } else {
+            p.addRect(x, y, width, height);
+        }
+        return applySvgAttributes(p, attributes);
+    },
 
-    // The options object, if provided, is always the last argument.
-    if (typeof lastArg === 'object') {
-        options = lastArg;
-        if (secondArg !== lastArg) {
-            args = args.slice(0, args.length - 1);
+    ellipse: function (node, parentAttributes) {
+        var attributes = readSvgAttributes(node, parentAttributes);
+        var cx = parseFloat(node.getAttribute('cx'));
+        var cy = parseFloat(node.getAttribute('cy'));
+        if (!cx) { cx = 0; }
+        if (!cy) { cy = 0; }
+        var rx = parseFloat(node.getAttribute('rx'));
+        var ry = parseFloat(node.getAttribute('ry'));
+        if (!rx) { rx = 0; }
+        if (!ry) { ry = 0; }
+        if (rx < 0) {
+            console.error('Error: invalid negative value for <ellipse> attribute rx="' + rx + '"');
+            rx = 0;
         }
-    } else {
-        options = {};
-    }
+        if (ry < 0) {
+            console.error('Error: invalid negative value for <ellipse> attribute ry="' + ry + '"');
+            ry = 0;
+        }
+        var p = new Path();
+        p.addEllipse(cx - rx, cy - ry, rx * 2, ry * 2);
+        return applySvgAttributes(p, attributes);
+    },
 
-    if (args.length) {
-        this.fontFamily = args.shift();
-    } else {
-        this.fontFamily = options.fontFamily || options.fontName || options.font || 'sans-serif';
-    }
+    circle: function (node, parentAttributes) {
+        var attributes = readSvgAttributes(node, parentAttributes);
+        var cx = parseFloat(node.getAttribute('cx'));
+        var cy = parseFloat(node.getAttribute('cy'));
+        if (!cx) { cx = 0; }
+        if (!cy) { cy = 0; }
+        var r = parseFloat(node.getAttribute('r'));
+        if (!r) { r = 0; }
+        if (r < 0) {
+            console.error('Error: invalid negative value for <circle> attribute r="' + r + '"');
+            r = 0;
+        }
+        var p = new Path();
+        p.addEllipse(cx - r, cy - r, r * 2, r * 2);
+        return applySvgAttributes(p, attributes);
+    },
 
-    if (args.length) {
-        this.fontSize = args.shift();
-    } else {
-        this.fontSize = options.fontSize || 24;
-    }
+    line: function (node, parentAttributes) {
+        var attributes = readSvgAttributes(node, parentAttributes);
+        var x1 = parseFloat(node.getAttribute('x1'));
+        var y1 = parseFloat(node.getAttribute('y1'));
+        var x2 = parseFloat(node.getAttribute('x2'));
+        var y2 = parseFloat(node.getAttribute('y2'));
+        if (!x1) { x1 = 0; }
+        if (!y1) { y1 = 0; }
+        if (!x2) { x2 = 0; }
+        if (!y2) { y2 = 0; }
+        var p = new Path();
+        p.addLine(x1, y1, x2, y2);
+        return applySvgAttributes(p, attributes);
+    },
 
-    if (args.length) {
-        this.textAlign = args.shift();
-    } else {
-        this.textAlign = options.align || options.textAlign || 'left';
-    }
+    path: function (node, parentAttributes) {
+        var attributes = readSvgAttributes(node, parentAttributes);
+        var d, PathParser, pp,
+            pt, newP, curr, p1, cntrl, cp, cp1x, cp1y, cp2x, cp2y,
+            rx, ry, rot, large, sweep, ex, ey, segs, i, bez;
+        // TODO: convert to real lexer based on http://www.w3.org/TR/SVG11/paths.html#PathDataBNF
+        d = node.getAttribute('d');
+        d = d.replace(/,/gm, ' '); // get rid of all commas
+        d = d.replace(/([MmZzLlHhVvCcSsQqTtAa])([MmZzLlHhVvCcSsQqTtAa])/gm, '$1 $2'); // separate commands from commands
+        d = d.replace(/([MmZzLlHhVvCcSsQqTtAa])([MmZzLlHhVvCcSsQqTtAa])/gm, '$1 $2'); // separate commands from commands
+        d = d.replace(/([MmZzLlHhVvCcSsQqTtAa])([^\s])/gm, '$1 $2'); // separate commands from points
+        d = d.replace(/([^\s])([MmZzLlHhVvCcSsQqTtAa])/gm, '$1 $2'); // separate commands from points
+        d = d.replace(/([0-9])([+\-])/gm, '$1 $2'); // separate digits when no comma
+        d = d.replace(/(\.[0-9]*)(\.)/gm, '$1 $2'); // separate digits when no comma
+        d = d.replace(/([Aa](\s+[0-9]+){3})\s+([01])\s*([01])/gm, '$1 $3 $4 '); // shorthand elliptical arc path syntax
+        d = compressSpaces(d); // compress multiple spaces
+        d = trim(d);
 
-    if (args.length) {
-        this.fill = args.shift();
-    } else {
-        this.fill = options.fill || 'black';
-    }
+        PathParser = function (d) {
+            this.tokens = d.split(' ');
 
-    this.transform = new Transform();
-};
+            this.reset = function () {
+                this.i = -1;
+                this.command = '';
+                this.previousCommand = '';
+                this.start = new Point(0, 0);
+                this.control = new Point(0, 0);
+                this.current = new Point(0, 0);
+                this.points = [];
+                this.angles = [];
+            };
 
-GText.prototype.clone = function () {
-    var t = new GText();
-    t.text = this.text;
-    t.x = this.x;
-    t.y = this.y;
-    t.fontFamily = this.fontFamily;
-    t.fontSize = this.fontSize;
-    t.textAlign = this.textAlign;
-    t.fill = Color.clone(this.fill);
-    t.transform = this.transform;
-    return t;
-};
+            this.isEnd = function () {
+                return this.i >= this.tokens.length - 1;
+            };
 
-// The `measureWidth` function requires a canvas, so we set up a dummy one
-// that we re-use for the duration of the page.
-GText._getDummyContext = function () {
-    if (!_dummyContext) {
-        if (typeof document !== 'undefined') {
-            _dummyContext = document.createElement('canvas').getContext('2d');
-        } else {
-            // For node.js, use a fake context that estimates the width.
-            _dummyContext = {
-                font: '10px sans-serif',
-                measureText: function (text) {
-                    var fontSize = parseFloat(this.font);
-                    // The 0.6 is the average width / fontSize ratio across all characters and font sizes.
-                    return {width: text.length * fontSize * 0.6};
-                }
+            this.isCommandOrEnd = function () {
+                if (this.isEnd()) { return true; }
+                return this.tokens[this.i + 1].match(/^[A-Za-z]$/) !== null;
             };
-        }
-    }
-    return _dummyContext;
-};
 
-GText.prototype._getFont = function () {
-    return this.fontSize + 'px ' + this.fontFamily;
-};
+            this.isRelativeCommand = function () {
+                switch (this.command) {
+                case 'm':
+                case 'l':
+                case 'h':
+                case 'v':
+                case 'c':
+                case 's':
+                case 'q':
+                case 't':
+                case 'a':
+                case 'z':
+                    return true;
+                }
+                return false;
+            };
 
-GText.prototype.colorize = function (fill) {
-    var t = this.clone();
-    t.fill = Color.clone(fill);
-    return t;
-};
+            this.getToken = function () {
+                this.i += 1;
+                return this.tokens[this.i];
+            };
 
-GText.prototype.draw = function (ctx) {
-    ctx.save();
-    ctx.font = this._getFont();
-    ctx.textAlign = this.textAlign;
-    var m = this.transform.m;
-    ctx.transform(m[0], m[1], m[3], m[4], m[6], m[7]);
-    ctx.fillStyle = Color.toCSS(this.fill);
-    ctx.fillText(this.text, this.x, this.y);
-    ctx.restore();
-};
+            this.getScalar = function () {
+                return parseFloat(this.getToken());
+            };
 
-GText.prototype.bounds = function () {
-    var ctx = GText._getDummyContext(),
-        metrics,
-        x = this.x;
-    ctx.font = this._getFont();
-    // FIXME: measureText returns a TextMetrics object that only contains width.
-    metrics = ctx.measureText(this.text);
-    if (this.textAlign === 'center') {
-        x = this.x - (metrics.width / 2);
-    } else if (this.textAlign === 'right') {
-        x = this.x - metrics.width;
-    }
-    return new Rect(x, this.y - this.fontSize, metrics.width, this.fontSize * 1.2);
-};
+            this.nextCommand = function () {
+                this.previousCommand = this.command;
+                this.command = this.getToken();
+            };
 
-GText.prototype.toSVG = function () {
-    var svg = '<text';
-    svg += ' x="' + this.x + '"';
-    svg += ' y="' + this.y + '"';
-    svg += ' font-family="' + this.fontFamily + '"';
-    svg += ' font-size="' + this.fontSize + '"';
-    var textAnchor;
-    if (this.textAlign === 'left') {
-        textAnchor = 'start';
-    } else if (this.textAlign === 'center') {
-        textAnchor = 'middle';
-    } else if (this.textAlign === 'right') {
-        textAnchor = 'end';
-    }
-    svg += ' text-anchor="' + textAnchor + '"';
-    if (this.fill !== 'black') {
-        svg += ' fill="' + Color.toCSS(this.fill) + '"';
-    }
-    svg += '>';
-    svg += this.text;
-    svg += '</text>';
-    return svg;
-};
+            this.getPoint = function () {
+                var pt = new Point(this.getScalar(), this.getScalar());
+                return this.makeAbsolute(pt);
+            };
 
-module.exports = GText;
-},{"../objects/color":28,"../objects/rect":33,"../objects/transform":35}],35:[function(require,module,exports){
-// 2-dimensional transformation matrix
+            this.getAsControlPoint = function () {
+                var pt = this.getPoint();
+                this.control = pt;
+                return pt;
+            };
 
-'use strict';
+            this.getAsCurrentPoint = function () {
+                var pt = this.getPoint();
+                this.current = pt;
+                return pt;
+            };
 
-var _ = require('lodash');
+            this.getReflectedControlPoint = function () {
+                if (this.previousCommand.toLowerCase() !== 'c' &&
+                        this.previousCommand.toLowerCase() !== 's' &&
+                        this.previousCommand.toLowerCase() !== 'q' &&
+                        this.previousCommand.toLowerCase() !== 't') {
+                    return this.current;
+                }
 
-var bezier = require('../util/bezier');
-var math = require('../util/math');
+                // reflect point
+                var pt = new Point(2 * this.current.x - this.control.x, 2 * this.current.y - this.control.y);
+                return pt;
+            };
 
-var Group = require('../objects/group');
-var Path = require('../objects/path');
-var Point = require('../objects/point');
+            this.makeAbsolute = function (pt) {
+                if (this.isRelativeCommand()) {
+                    return new Point(pt.x + this.current.x, pt.y + this.current.y);
+                }
+                return pt;
+            };
+        };
 
-var MOVETO  = bezier.MOVETO;
-var LINETO  = bezier.LINETO;
-var QUADTO  = bezier.QUADTO;
-var CURVETO = bezier.CURVETO;
-var CLOSE   = bezier.CLOSE;
+        var p = new Path();
 
-// A geometric transformation in Euclidean space (i.e. 2D)
-// that preserves collinearity and ratio of distance between points.
-// Linear transformations include rotation, translation, scaling, shear.
-var Transform = function (m) {
-    if (m !== undefined) {
-        this.m = m;
-    } else {
-        this.m = [1, 0, 0, 0, 1, 0, 0, 0, 1]; // Identity matrix.
+        pp = new PathParser(d);
+        pp.reset();
+
+        while (!pp.isEnd()) {
+            pp.nextCommand();
+            switch (pp.command) {
+            case 'M':
+            case 'm':
+                pt = pp.getAsCurrentPoint();
+                p.moveTo(pt.x, pt.y);
+                pp.start = pp.current;
+                while (!pp.isCommandOrEnd()) {
+                    pt = pp.getAsCurrentPoint();
+                    p.lineTo(pt.x, pt.y);
+                }
+                break;
+            case 'L':
+            case 'l':
+                while (!pp.isCommandOrEnd()) {
+                    pt = pp.getAsCurrentPoint();
+                    p.lineTo(pt.x, pt.y);
+                }
+                break;
+            case 'H':
+            case 'h':
+                while (!pp.isCommandOrEnd()) {
+                    newP = new Point((pp.isRelativeCommand() ? pp.current.x : 0) + pp.getScalar(), pp.current.y);
+                    pp.current = newP;
+                    p.lineTo(pp.current.x, pp.current.y);
+                }
+                break;
+            case 'V':
+            case 'v':
+                while (!pp.isCommandOrEnd()) {
+                    newP = new Point(pp.current.x, (pp.isRelativeCommand() ? pp.current.y : 0) + pp.getScalar());
+                    pp.current = newP;
+                    p.lineTo(pp.current.x, pp.current.y);
+                }
+                break;
+            case 'C':
+            case 'c':
+                while (!pp.isCommandOrEnd()) {
+                    curr = pp.current;
+                    p1 = pp.getPoint();
+                    cntrl = pp.getAsControlPoint();
+                    cp = pp.getAsCurrentPoint();
+                    p.curveTo(p1.x, p1.y, cntrl.x, cntrl.y, cp.x, cp.y);
+                }
+                break;
+            case 'S':
+            case 's':
+                while (!pp.isCommandOrEnd()) {
+                    curr = pp.current;
+                    p1 = pp.getReflectedControlPoint();
+                    cntrl = pp.getAsControlPoint();
+                    cp = pp.getAsCurrentPoint();
+                    p.curveTo(p1.x, p1.y, cntrl.x, cntrl.y, cp.x, cp.y);
+                }
+                break;
+            case 'Q':
+            case 'q':
+                while (!pp.isCommandOrEnd()) {
+                    curr = pp.current;
+                    cntrl = pp.getAsControlPoint();
+                    cp = pp.getAsCurrentPoint();
+                    cp1x = curr.x + 2 / 3 * (cntrl.x - curr.x); // CP1 = QP0 + 2 / 3 *(QP1-QP0)
+                    cp1y = curr.y + 2 / 3 * (cntrl.y - curr.y); // CP1 = QP0 + 2 / 3 *(QP1-QP0)
+                    cp2x = cp1x + 1 / 3 * (cp.x - curr.x); // CP2 = CP1 + 1 / 3 *(QP2-QP0)
+                    cp2y = cp1y + 1 / 3 * (cp.y - curr.y); // CP2 = CP1 + 1 / 3 *(QP2-QP0)
+                    p.curveTo(cp1x, cp1y, cp2x, cp2y, cp.x, cp.y);
+                }
+                break;
+            case 'T':
+            case 't':
+                while (!pp.isCommandOrEnd()) {
+                    curr = pp.current;
+                    cntrl = pp.getReflectedControlPoint();
+                    pp.control = cntrl;
+                    cp = pp.getAsCurrentPoint();
+                    cp1x = curr.x + 2 / 3 * (cntrl.x - curr.x); // CP1 = QP0 + 2 / 3 *(QP1-QP0)
+                    cp1y = curr.y + 2 / 3 * (cntrl.y - curr.y); // CP1 = QP0 + 2 / 3 *(QP1-QP0)
+                    cp2x = cp1x + 1 / 3 * (cp.x - curr.x); // CP2 = CP1 + 1 / 3 *(QP2-QP0)
+                    cp2y = cp1y + 1 / 3 * (cp.y - curr.y); // CP2 = CP1 + 1 / 3 *(QP2-QP0)
+                    p.curveTo(cp1x, cp1y, cp2x, cp2y, cp.x, cp.y);
+                }
+                break;
+            case 'A':
+            case 'a':
+                while (!pp.isCommandOrEnd()) {
+                    curr = pp.current;
+                    rx = pp.getScalar();
+                    ry = pp.getScalar();
+                    rot = pp.getScalar();// * (Math.PI / 180.0);
+                    large = pp.getScalar();
+                    sweep = pp.getScalar();
+                    cp = pp.getAsCurrentPoint();
+                    ex = cp.x;
+                    ey = cp.y;
+                    segs = arcToSegments(ex, ey, rx, ry, large, sweep, rot, curr.x, curr.y);
+                    for (i = 0; i < segs.length; i += 1) {
+                        bez = segmentToBezier.apply(this, segs[i]);
+                        p.curveTo.apply(p, bez);
+                    }
+                }
+                break;
+            case 'Z':
+            case 'z':
+                p.close();
+                pp.current = pp.start;
+                break;
+            }
+        }
+        return applySvgAttributes(p, attributes);
     }
 };
 
-Transform.IDENTITY = new Transform();
+exports.interpret = function (svgNode) {
+    var node,
+        tag = svgNode.tagName.toLowerCase();
+    if (read[tag] === undefined) {
+        return null;
+    }
 
-Transform.identity = function () {
-    return new Transform();
+    node = read[tag].call(this, svgNode);
+    return node;
 };
 
-// Returns the 3x3 matrix multiplication of A and B.
-// Note that scale(), translate(), rotate() work with premultiplication,
-// e.g. the matrix A followed by B = BA and not AB.
-Transform._mmult = function (a, b) {
-    if (a.m !== undefined) { a = a.m; }
-    if (b.m !== undefined) { b = b.m; }
-
-    return new Transform([
-        a[0] * b[0] + a[1] * b[3],
-        a[0] * b[1] + a[1] * b[4], 0,
-        a[3] * b[0] + a[4] * b[3],
-        a[3] * b[1] + a[4] * b[4], 0,
-        a[6] * b[0] + a[7] * b[3] + b[6],
-        a[6] * b[1] + a[7] * b[4] + b[7], 1
-    ]);
+exports.parseString = function (s) {
+    var doc = new xmldom.DOMParser({errorHandler:
+        function (key, msg) {
+            throw new Error('Could not parse string \"' + String(s) + '\": ' + msg);
+        }
+    }).parseFromString(s);
+    if (doc) {
+        return exports.interpret(doc.documentElement);
+    } else {
+        return null;
+    }
 };
 
-Transform.prototype.isIdentity = function () {
-    var m = this.m;
-    return (m[0] === 1 && m[1] === 0 && m[2] === 0 && m[3] === 0 && m[4] === 1 && m[5] === 0 && m[6] === 0 && m[7] === 0 && m[8] === 1);
-};
+},{"../objects/color":27,"../objects/group":28,"../objects/path":30,"../objects/point":31,"../objects/transform":34,"lodash":2,"xmldom":5}],44:[function(require,module,exports){
+// vg.js
+// JavaScript library for vector graphics
+// https://github.com/nodebox/vg.js
+// (c) 2014 EMRG
+// vg.js may be freely distributed under the MIT license.
+// Based on: canvas.js, https://github.com/clips/pattern/blob/master/pattern/canvas.js (BSD)
+// De Smedt T. & Daelemans W. (2012). Pattern for Python. Journal of Machine Learning Research.
 
-Transform.prototype.prepend = function (matrix) {
-    return Transform._mmult(this.m, matrix.m);
-};
+'use strict';
 
-Transform.prototype.append = function (matrix) {
-    return Transform._mmult(matrix.m, this.m);
-};
+var _ = require('lodash');
 
-Transform.prototype.inverse = function () {
-    var m = this.m,
-        d = m[0] * m[4] - m[1] * m[3];
-    return new Transform([
-        m[4] / d,
-        -m[1] / d, 0,
-        -m[3] / d,
-        m[0] / d, 0,
-        (m[3] * m[7] - m[4] * m[6]) / d,
-        -(m[0] * m[7] - m[1] * m[6]) / d, 1
-    ]);
-};
+var vg = {};
 
-Transform.prototype.scale = function (x, y) {
-    if (y === undefined) { y = x; }
-    return Transform._mmult([x, 0, 0, 0, y, 0, 0, 0, 1], this.m);
-};
+// Utility functions
+vg.bezier = require('./util/bezier');
+vg.color = require('./util/color');
+vg.geo = require('./util/geo');
+vg.math = require('./util/math');
+vg.random = require('./util/random');
+vg.svg = require('./util/svg');
 
-Transform.prototype.translate = function (x, y) {
-    return Transform._mmult([1, 0, 0, 0, 1, 0, x, y, 1], this.m);
-};
+// Objects
+vg.Color = require('./objects/color');
+vg.Group = require('./objects/group');
+vg.Matrix4 = require('./objects/matrix4');
+vg.Path = require('./objects/path');
+vg.Point = vg.Vec2 = require('./objects/point');
+vg.Rect = require('./objects/rect');
+vg.Text = require('./objects/text');
+vg.Transform = vg.Matrix3 = require('./objects/transform');
+vg.Vec3 = require('./objects/vec3');
 
-Transform.prototype.rotate = function (angle) {
-    var c = Math.cos(math.radians(angle)),
-        s = Math.sin(math.radians(angle));
-    return Transform._mmult([c, s, 0, -s, c, 0, 0, 0, 1], this.m);
-};
+// Commands
+function importCommands(module) {
+    for (var k in module) {
+        vg[k] = module[k];
+    }
+}
 
-Transform.prototype.skew = function (x, y) {
-    var kx = Math.PI * x / 180.0,
-        ky = Math.PI * y / 180.0;
-    return Transform._mmult([1, Math.tan(ky), 0, -Math.tan(kx), 1, 0, 0, 0, 1], this.m);
-};
+var Transformable = require('./objects/transformable');
+_.extend(vg.Point.prototype, Transformable);
+_.extend(vg.Path.prototype, Transformable);
+_.extend(vg.Group.prototype, Transformable);
+_.extend(vg.Text.prototype, Transformable);
 
-// Returns the new coordinates of the given point (x,y) after transformation.
-Transform.prototype.transformPoint = function (point) {
-    var x = point.x,
-        y = point.y,
-        m = this.m;
-    return new Point(
-        x * m[0] + y * m[3] + m[6],
-        x * m[1] + y * m[4] + m[7]
-    );
-};
+importCommands(require('./commands/draw'));
+importCommands(require('./commands/filters'));
+importCommands(require('./commands/shapes'));
 
-Transform.prototype.transformPoints = function (points) {
-    var _this = this;
-    return _.map(points, function (pt) {
-        return _this.transformPoint(pt);
-    });
-};
+module.exports = vg;
+},{"./commands/draw":24,"./commands/filters":25,"./commands/shapes":26,"./objects/color":27,"./objects/group":28,"./objects/matrix4":29,"./objects/path":30,"./objects/point":31,"./objects/rect":32,"./objects/text":33,"./objects/transform":34,"./objects/transformable":35,"./objects/vec3":36,"./util/bezier":37,"./util/color":38,"./util/geo":39,"./util/math":41,"./util/random":42,"./util/svg":43,"lodash":2}],45:[function(require,module,exports){
+// rev 482
+/********************************************************************************
+ *                                                                              *
+ * Author    :  Angus Johnson                                                   *
+ * Version   :  6.2.1                                                          *
+ * Date      :  31 October 2014                                                 *
+ * Website   :  http://www.angusj.com                                           *
+ * Copyright :  Angus Johnson 2010-2014                                         *
+ *                                                                              *
+ * License:                                                                     *
+ * Use, modification & distribution is subject to Boost Software License Ver 1. *
+ * http://www.boost.org/LICENSE_1_0.txt                                         *
+ *                                                                              *
+ * Attributions:                                                                *
+ * The code in this library is an extension of Bala Vatti's clipping algorithm: *
+ * "A generic solution to polygon clipping"                                     *
+ * Communications of the ACM, Vol 35, Issue 7 (July 1992) pp 56-63.             *
+ * http://portal.acm.org/citation.cfm?id=129906                                 *
+ *                                                                              *
+ * Computer graphics and geometric modeling: implementation and algorithms      *
+ * By Max K. Agoston                                                            *
+ * Springer; 1 edition (January 4, 2005)                                        *
+ * http://books.google.com/books?q=vatti+clipping+agoston                       *
+ *                                                                              *
+ * See also:                                                                    *
+ * "Polygon Offsetting by Computing Winding Numbers"                            *
+ * Paper no. DETC2005-85513 pp. 565-575                                         *
+ * ASME 2005 International Design Engineering Technical Conferences             *
+ * and Computers and Information in Engineering Conference (IDETC/CIE2005)      *
+ * September 24-28, 2005 , Long Beach, California, USA                          *
+ * http://www.me.berkeley.edu/~mcmains/pubs/DAC05OffsetPolygon.pdf              *
+ *                                                                              *
+ *******************************************************************************/
+/*******************************************************************************
+ *                                                                              *
+ * Author    :  Timo                                                            *
+ * Version   :  6.2.1.2                                                         *
+ * Date      :  27 November 2016                                                 *
+ *                                                                              *
+ * This is a translation of the C# Clipper library to Javascript.               *
+ * Int128 struct of C# is implemented using JSBN of Tom Wu.                     *
+ * Because Javascript lacks support for 64-bit integers, the space              *
+ * is a little more restricted than in C# version.                              *
+ *                                                                              *
+ * C# version has support for coordinate space:                                 *
+ * +-4611686018427387903 ( sqrt(2^127 -1)/2 )                                   *
+ * while Javascript version has support for space:                              *
+ * +-4503599627370495 ( sqrt(2^106 -1)/2 )                                      *
+ *                                                                              *
+ * Tom Wu's JSBN proved to be the fastest big integer library:                  *
+ * http://jsperf.com/big-integer-library-test                                   *
+ *                                                                              *
+ * This class can be made simpler when (if ever) 64-bit integer support comes.  *
+ *                                                                              *
+ *******************************************************************************/
+/*******************************************************************************
+ *                                                                              *
+ * Basic JavaScript BN library - subset useful for RSA encryption.              *
+ * http://www-cs-students.stanford.edu/~tjw/jsbn/                               *
+ * Copyright (c) 2005  Tom Wu                                                   *
+ * All Rights Reserved.                                                         *
+ * See "LICENSE" for details:                                                   *
+ * http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE                        *
+ *                                                                              *
+ *******************************************************************************/
+(function ()
+{
+  "use strict";
+  var ClipperLib = {};
+
+  //UseLines: Enables open path clipping. Adds a very minor cost to performance.
+  ClipperLib.use_lines = true;
+
+  //ClipperLib.use_xyz: adds a Z member to IntPoint. Adds a minor cost to performance.
+  ClipperLib.use_xyz = false;
+
+  var isNode = false;
+  if (typeof module !== 'undefined' && module.exports)
+  {
+    module.exports = ClipperLib;
+    isNode = true;
+  }
+  else
+  {
+    if (typeof (document) !== "undefined") window.ClipperLib = ClipperLib;
+    else self['ClipperLib'] = ClipperLib;
+  }
+  var navigator_appName;
+  if (!isNode)
+  {
+    var nav = navigator.userAgent.toString().toLowerCase();
+    navigator_appName = navigator.appName;
+  }
+  else
+  {
+    var nav = "chrome"; // Node.js uses Chrome's V8 engine
+    navigator_appName = "Netscape"; // Firefox, Chrome and Safari returns "Netscape", so Node.js should also
+  }
+  // Browser test to speedup performance critical functions
+  var browser = {};
+  if (nav.indexOf("chrome") != -1 && nav.indexOf("chromium") == -1) browser.chrome = 1;
+  else browser.chrome = 0;
+  if (nav.indexOf("chromium") != -1) browser.chromium = 1;
+  else browser.chromium = 0;
+  if (nav.indexOf("safari") != -1 && nav.indexOf("chrome") == -1 && nav.indexOf("chromium") == -1) browser.safari = 1;
+  else browser.safari = 0;
+  if (nav.indexOf("firefox") != -1) browser.firefox = 1;
+  else browser.firefox = 0;
+  if (nav.indexOf("firefox/17") != -1) browser.firefox17 = 1;
+  else browser.firefox17 = 0;
+  if (nav.indexOf("firefox/15") != -1) browser.firefox15 = 1;
+  else browser.firefox15 = 0;
+  if (nav.indexOf("firefox/3") != -1) browser.firefox3 = 1;
+  else browser.firefox3 = 0;
+  if (nav.indexOf("opera") != -1) browser.opera = 1;
+  else browser.opera = 0;
+  if (nav.indexOf("msie 10") != -1) browser.msie10 = 1;
+  else browser.msie10 = 0;
+  if (nav.indexOf("msie 9") != -1) browser.msie9 = 1;
+  else browser.msie9 = 0;
+  if (nav.indexOf("msie 8") != -1) browser.msie8 = 1;
+  else browser.msie8 = 0;
+  if (nav.indexOf("msie 7") != -1) browser.msie7 = 1;
+  else browser.msie7 = 0;
+  if (nav.indexOf("msie ") != -1) browser.msie = 1;
+  else browser.msie = 0;
+  ClipperLib.biginteger_used = null;
+
+  // Copyright (c) 2005  Tom Wu
+  // All Rights Reserved.
+  // See "LICENSE" for details.
+  // Basic JavaScript BN library - subset useful for RSA encryption.
+  // Bits per digit
+  var dbits;
+  // JavaScript engine analysis
+  var canary = 0xdeadbeefcafe;
+  var j_lm = ((canary & 0xffffff) == 0xefcafe);
+  // (public) Constructor
+  function BigInteger(a, b, c)
+  {
+    // This test variable can be removed,
+    // but at least for performance tests it is useful piece of knowledge
+    // This is the only ClipperLib related variable in BigInteger library
+    ClipperLib.biginteger_used = 1;
+    if (a != null)
+      if ("number" == typeof a && "undefined" == typeof (b)) this.fromInt(a); // faster conversion
+      else if ("number" == typeof a) this.fromNumber(a, b, c);
+    else if (b == null && "string" != typeof a) this.fromString(a, 256);
+    else this.fromString(a, b);
+  }
+  // return new, unset BigInteger
+  function nbi()
+  {
+    return new BigInteger(null,undefined,undefined);
+  }
+  // am: Compute w_j += (x*this_i), propagate carries,
+  // c is initial carry, returns final carry.
+  // c < 3*dvalue, x < 2*dvalue, this_i < dvalue
+  // We need to select the fastest one that works in this environment.
+  // am1: use a single mult and divide to get the high bits,
+  // max digit bits should be 26 because
+  // max internal value = 2*dvalue^2-2*dvalue (< 2^53)
+  function am1(i, x, w, j, c, n)
+  {
+    while (--n >= 0)
+    {
+      var v = x * this[i++] + w[j] + c;
+      c = Math.floor(v / 0x4000000);
+      w[j++] = v & 0x3ffffff;
+    }
+    return c;
+  }
+  // am2 avoids a big mult-and-extract completely.
+  // Max digit bits should be <= 30 because we do bitwise ops
+  // on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
+  function am2(i, x, w, j, c, n)
+  {
+    var xl = x & 0x7fff,
+      xh = x >> 15;
+    while (--n >= 0)
+    {
+      var l = this[i] & 0x7fff;
+      var h = this[i++] >> 15;
+      var m = xh * l + h * xl;
+      l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);
+      c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);
+      w[j++] = l & 0x3fffffff;
+    }
+    return c;
+  }
+  // Alternately, set max digit bits to 28 since some
+  // browsers slow down when dealing with 32-bit numbers.
+  function am3(i, x, w, j, c, n)
+  {
+    var xl = x & 0x3fff,
+      xh = x >> 14;
+    while (--n >= 0)
+    {
+      var l = this[i] & 0x3fff;
+      var h = this[i++] >> 14;
+      var m = xh * l + h * xl;
+      l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;
+      c = (l >> 28) + (m >> 14) + xh * h;
+      w[j++] = l & 0xfffffff;
+    }
+    return c;
+  }
+  if (j_lm && (navigator_appName == "Microsoft Internet Explorer"))
+  {
+    BigInteger.prototype.am = am2;
+    dbits = 30;
+  }
+  else if (j_lm && (navigator_appName != "Netscape"))
+  {
+    BigInteger.prototype.am = am1;
+    dbits = 26;
+  }
+  else
+  { // Mozilla/Netscape seems to prefer am3
+    BigInteger.prototype.am = am3;
+    dbits = 28;
+  }
+  BigInteger.prototype.DB = dbits;
+  BigInteger.prototype.DM = ((1 << dbits) - 1);
+  BigInteger.prototype.DV = (1 << dbits);
+  var BI_FP = 52;
+  BigInteger.prototype.FV = Math.pow(2, BI_FP);
+  BigInteger.prototype.F1 = BI_FP - dbits;
+  BigInteger.prototype.F2 = 2 * dbits - BI_FP;
+  // Digit conversions
+  var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
+  var BI_RC = new Array();
+  var rr, vv;
+  rr = "0".charCodeAt(0);
+  for (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
+  rr = "a".charCodeAt(0);
+  for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
+  rr = "A".charCodeAt(0);
+  for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
+
+  function int2char(n)
+  {
+    return BI_RM.charAt(n);
+  }
 
-Transform.prototype.transformPath = function (path) {
-    var m = this.m;
-    var commands = [];
-    commands.length = path.commands.length;
-    for (var i = 0, l = path.commands.length; i < l; i++) {
-        var cmd = path.commands[i];
-        switch(cmd.type) {
-            case MOVETO:
-            case LINETO:
-                commands[i] = {
-                    type: cmd.type,
-                    x: cmd.x * m[0] + cmd.y * m[3] + m[6],
-                    y: cmd.x * m[1] + cmd.y * m[4] + m[7]
-                };
-                break;
-            case QUADTO:
-                commands[i] = {
-                    type: QUADTO,
-                    x: cmd.x * m[0] + cmd.y * m[3] + m[6],
-                    y: cmd.x * m[1] + cmd.y * m[4] + m[7],
-                    x1: cmd.x1 * m[0] + cmd.y1 * m[3] + m[6],
-                    y1: cmd.x1 * m[1] + cmd.y1 * m[4] + m[7]
-                };
-                break;
-            case CURVETO:
-                commands[i] = {
-                    type: CURVETO,
-                    x: cmd.x * m[0] + cmd.y * m[3] + m[6],
-                    y: cmd.x * m[1] + cmd.y * m[4] + m[7],
-                    x1: cmd.x1 * m[0] + cmd.y1 * m[3] + m[6],
-                    y1: cmd.x1 * m[1] + cmd.y1 * m[4] + m[7],
-                    x2: cmd.x2 * m[0] + cmd.y2 * m[3] + m[6],
-                    y2: cmd.x2 * m[1] + cmd.y2 * m[4] + m[7]
-                };
-                break;
-            case CLOSE:
-                commands[i] = { type: CLOSE };
-                break;
-            default:
-                throw new Error('Unknown command type ' + cmd);
+  function intAt(s, i)
+  {
+    var c = BI_RC[s.charCodeAt(i)];
+    return (c == null) ? -1 : c;
+  }
+  // (protected) copy this to r
+  function bnpCopyTo(r)
+  {
+    for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];
+    r.t = this.t;
+    r.s = this.s;
+  }
+  // (protected) set from integer value x, -DV <= x < DV
+  function bnpFromInt(x)
+  {
+    this.t = 1;
+    this.s = (x < 0) ? -1 : 0;
+    if (x > 0) this[0] = x;
+    else if (x < -1) this[0] = x + this.DV;
+    else this.t = 0;
+  }
+  // return bigint initialized to value
+  function nbv(i)
+  {
+    var r = nbi();
+    r.fromInt(i);
+    return r;
+  }
+  // (protected) set from string and radix
+  function bnpFromString(s, b)
+  {
+    var k;
+    if (b == 16) k = 4;
+    else if (b == 8) k = 3;
+    else if (b == 256) k = 8; // byte array
+    else if (b == 2) k = 1;
+    else if (b == 32) k = 5;
+    else if (b == 4) k = 2;
+    else
+    {
+      this.fromRadix(s, b);
+      return;
+    }
+    this.t = 0;
+    this.s = 0;
+    var i = s.length,
+      mi = false,
+      sh = 0;
+    while (--i >= 0)
+    {
+      var x = (k == 8) ? s[i] & 0xff : intAt(s, i);
+      if (x < 0)
+      {
+        if (s.charAt(i) == "-") mi = true;
+        continue;
+      }
+      mi = false;
+      if (sh == 0)
+        this[this.t++] = x;
+      else if (sh + k > this.DB)
+      {
+        this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;
+        this[this.t++] = (x >> (this.DB - sh));
+      }
+      else
+        this[this.t - 1] |= x << sh;
+      sh += k;
+      if (sh >= this.DB) sh -= this.DB;
+    }
+    if (k == 8 && (s[0] & 0x80) != 0)
+    {
+      this.s = -1;
+      if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;
+    }
+    this.clamp();
+    if (mi) BigInteger.ZERO.subTo(this, this);
+  }
+  // (protected) clamp off excess high words
+  function bnpClamp()
+  {
+    var c = this.s & this.DM;
+    while (this.t > 0 && this[this.t - 1] == c)--this.t;
+  }
+  // (public) return string representation in given radix
+  function bnToString(b)
+  {
+    if (this.s < 0) return "-" + this.negate().toString(b);
+    var k;
+    if (b == 16) k = 4;
+    else if (b == 8) k = 3;
+    else if (b == 2) k = 1;
+    else if (b == 32) k = 5;
+    else if (b == 4) k = 2;
+    else return this.toRadix(b);
+    var km = (1 << k) - 1,
+      d, m = false,
+      r = "",
+      i = this.t;
+    var p = this.DB - (i * this.DB) % k;
+    if (i-- > 0)
+    {
+      if (p < this.DB && (d = this[i] >> p) > 0)
+      {
+        m = true;
+        r = int2char(d);
+      }
+      while (i >= 0)
+      {
+        if (p < k)
+        {
+          d = (this[i] & ((1 << p) - 1)) << (k - p);
+          d |= this[--i] >> (p += this.DB - k);
+        }
+        else
+        {
+          d = (this[i] >> (p -= k)) & km;
+          if (p <= 0)
+          {
+            p += this.DB;
+            --i;
+          }
         }
+        if (d > 0) m = true;
+        if (m) r += int2char(d);
+      }
+    }
+    return m ? r : "0";
+  }
+  // (public) -this
+  function bnNegate()
+  {
+    var r = nbi();
+    BigInteger.ZERO.subTo(this, r);
+    return r;
+  }
+  // (public) |this|
+  function bnAbs()
+  {
+    return (this.s < 0) ? this.negate() : this;
+  }
+  // (public) return + if this > a, - if this < a, 0 if equal
+  function bnCompareTo(a)
+  {
+    var r = this.s - a.s;
+    if (r != 0) return r;
+    var i = this.t;
+    r = i - a.t;
+    if (r != 0) return (this.s < 0) ? -r : r;
+    while (--i >= 0)
+      if ((r = this[i] - a[i]) != 0) return r;
+    return 0;
+  }
+  // returns bit length of the integer x
+  function nbits(x)
+  {
+    var r = 1,
+      t;
+    if ((t = x >>> 16) != 0)
+    {
+      x = t;
+      r += 16;
+    }
+    if ((t = x >> 8) != 0)
+    {
+      x = t;
+      r += 8;
+    }
+    if ((t = x >> 4) != 0)
+    {
+      x = t;
+      r += 4;
+    }
+    if ((t = x >> 2) != 0)
+    {
+      x = t;
+      r += 2;
+    }
+    if ((t = x >> 1) != 0)
+    {
+      x = t;
+      r += 1;
+    }
+    return r;
+  }
+  // (public) return the number of bits in "this"
+  function bnBitLength()
+  {
+    if (this.t <= 0) return 0;
+    return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));
+  }
+  // (protected) r = this << n*DB
+  function bnpDLShiftTo(n, r)
+  {
+    var i;
+    for (i = this.t - 1; i >= 0; --i) r[i + n] = this[i];
+    for (i = n - 1; i >= 0; --i) r[i] = 0;
+    r.t = this.t + n;
+    r.s = this.s;
+  }
+  // (protected) r = this >> n*DB
+  function bnpDRShiftTo(n, r)
+  {
+    for (var i = n; i < this.t; ++i) r[i - n] = this[i];
+    r.t = Math.max(this.t - n, 0);
+    r.s = this.s;
+  }
+  // (protected) r = this << n
+  function bnpLShiftTo(n, r)
+  {
+    var bs = n % this.DB;
+    var cbs = this.DB - bs;
+    var bm = (1 << cbs) - 1;
+    var ds = Math.floor(n / this.DB),
+      c = (this.s << bs) & this.DM,
+      i;
+    for (i = this.t - 1; i >= 0; --i)
+    {
+      r[i + ds + 1] = (this[i] >> cbs) | c;
+      c = (this[i] & bm) << bs;
+    }
+    for (i = ds - 1; i >= 0; --i) r[i] = 0;
+    r[ds] = c;
+    r.t = this.t + ds + 1;
+    r.s = this.s;
+    r.clamp();
+  }
+  // (protected) r = this >> n
+  function bnpRShiftTo(n, r)
+  {
+    r.s = this.s;
+    var ds = Math.floor(n / this.DB);
+    if (ds >= this.t)
+    {
+      r.t = 0;
+      return;
+    }
+    var bs = n % this.DB;
+    var cbs = this.DB - bs;
+    var bm = (1 << bs) - 1;
+    r[0] = this[ds] >> bs;
+    for (var i = ds + 1; i < this.t; ++i)
+    {
+      r[i - ds - 1] |= (this[i] & bm) << cbs;
+      r[i - ds] = this[i] >> bs;
+    }
+    if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;
+    r.t = this.t - ds;
+    r.clamp();
+  }
+  // (protected) r = this - a
+  function bnpSubTo(a, r)
+  {
+    var i = 0,
+      c = 0,
+      m = Math.min(a.t, this.t);
+    while (i < m)
+    {
+      c += this[i] - a[i];
+      r[i++] = c & this.DM;
+      c >>= this.DB;
+    }
+    if (a.t < this.t)
+    {
+      c -= a.s;
+      while (i < this.t)
+      {
+        c += this[i];
+        r[i++] = c & this.DM;
+        c >>= this.DB;
+      }
+      c += this.s;
+    }
+    else
+    {
+      c += this.s;
+      while (i < a.t)
+      {
+        c -= a[i];
+        r[i++] = c & this.DM;
+        c >>= this.DB;
+      }
+      c -= a.s;
     }
-    return new Path(commands, path.fill, path.stroke, path.strokeWidth);
-};
-
-Transform.prototype.transformText = function (text) {
-    var t = text.clone();
-    t.transform = this.append(t.transform);
-    return t;
-};
-
-Transform.prototype.transformGroup = function (group) {
-    var _this = this,
-        shapes = _.map(group.shapes, function (shape) {
-            return _this.transformShape(shape);
-        });
-    return new Group(shapes);
-};
-
-Transform.prototype.transformShape = function (shape) {
-    var fn;
-    if (shape.shapes) {
-        fn = this.transformGroup;
-    } else if (shape.commands) {
-        fn = this.transformPath;
-    } else if (shape.text) {
-        fn = this.transformText;
-    } else if (shape.x !== undefined && shape.y !== undefined) {
-        fn = this.transformPoint;
-    } else if (shape._transform !== undefined) {
-        return shape._transform(this.m);
-    } else if (Array.isArray(shape) && shape.length > 0) {
-        if (shape[0].x !== undefined && shape[0].y !== undefined) {
-            fn = this.transformPoints;
-        } else {
-            var l = [];
-            for (var i = 0; i < shape.length; i += 1) {
-                l.push(this.transformShape(shape[i]));
-            }
-            return l;
-        }
-    } else {
-        throw new Error('Don\'t know how to transform ' + shape);
+    r.s = (c < 0) ? -1 : 0;
+    if (c < -1) r[i++] = this.DV + c;
+    else if (c > 0) r[i++] = c;
+    r.t = i;
+    r.clamp();
+  }
+  // (protected) r = this * a, r != this,a (HAC 14.12)
+  // "this" should be the larger one if appropriate.
+  function bnpMultiplyTo(a, r)
+  {
+    var x = this.abs(),
+      y = a.abs();
+    var i = x.t;
+    r.t = i + y.t;
+    while (--i >= 0) r[i] = 0;
+    for (i = 0; i < y.t; ++i) r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
+    r.s = 0;
+    r.clamp();
+    if (this.s != a.s) BigInteger.ZERO.subTo(r, r);
+  }
+  // (protected) r = this^2, r != this (HAC 14.16)
+  function bnpSquareTo(r)
+  {
+    var x = this.abs();
+    var i = r.t = 2 * x.t;
+    while (--i >= 0) r[i] = 0;
+    for (i = 0; i < x.t - 1; ++i)
+    {
+      var c = x.am(i, x[i], r, 2 * i, 0, 1);
+      if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV)
+      {
+        r[i + x.t] -= x.DV;
+        r[i + x.t + 1] = 1;
+      }
     }
-    return fn.call(this, shape);
-};
-
-module.exports = Transform;
-
-},{"../objects/group":29,"../objects/path":31,"../objects/point":32,"../util/bezier":38,"../util/math":42,"lodash":3}],36:[function(require,module,exports){
-// Mixin for Path and Group
-
-'use strict';
-
-var Point = require('../objects/point');
-var Transform = require('../objects/transform');
-
-var Transformable = {
-    translate: function (position) {
-        if (!position) { position = Point.ZERO; }
-        var t = new Transform().translate(position.x, position.y);
-        return t.transformShape(this);
-    },
-
-    scale: function (scale, origin) {
-        if (!origin) { origin = Point.ZERO; }
-        var sx, sy;
-        if (typeof scale === 'number') {
-            sx = scale;
-            sy = scale;
-        } else {
-            sx = scale.x;
-            sy = scale.y;
-        }
-        var t = new Transform();
-        t = t.translate(origin.x, origin.y);
-        t = t.scale(sx, sy);
-        t = t.translate(-origin.x, -origin.y);
-        return t.transformShape(this);
-    },
-
-    rotate: function (angle, origin) {
-        if (!origin) { origin = Point.ZERO; }
-        var t = new Transform();
-        t = t.translate(origin.x, origin.y);
-        t = t.rotate(angle);
-        t = t.translate(-origin.x, -origin.y);
-        return t.transformShape(this);
-    },
-
-    skew: function (skew, origin) {
-        if (!origin) { origin = Point.ZERO; }
-        var t = new Transform();
-        t = t.translate(origin.x, origin.y);
-        t = t.skew(skew.x, skew.y);
-        t = t.translate(-origin.x, -origin.y);
-        return t.transformShape(this);
+    if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
+    r.s = 0;
+    r.clamp();
+  }
+  // (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
+  // r != q, this != m.  q or r may be null.
+  function bnpDivRemTo(m, q, r)
+  {
+    var pm = m.abs();
+    if (pm.t <= 0) return;
+    var pt = this.abs();
+    if (pt.t < pm.t)
+    {
+      if (q != null) q.fromInt(0);
+      if (r != null) this.copyTo(r);
+      return;
     }
-};
-
-module.exports = Transformable;
-
-},{"../objects/point":32,"../objects/transform":35}],37:[function(require,module,exports){
-//// VECTORS AND MATRICES ///////////////////////////////////////////////
-
-'use strict';
-
-var Vec3 = function (x, y, z) {
-    this.x = x === undefined ? 0 : x;
-    this.y = y === undefined ? 0 : y;
-    this.z = z === undefined ? 0 : z;
-};
-
-// Generate the zero vector.
-Vec3.ZERO = new Vec3(0, 0, 0);
-
-Vec3.up = function () {
-    return new Vec3(0, 1.0, 0);
-};
-
-// Generate the dot product of two vectors.
-Vec3.dot = function (a, b) {
-    return (a.x * b.x + a.y * b.y + a.z * b.z);
-};
+    if (r == null) r = nbi();
+    var y = nbi(),
+      ts = this.s,
+      ms = m.s;
+    var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus
+    if (nsh > 0)
+    {
+      pm.lShiftTo(nsh, y);
+      pt.lShiftTo(nsh, r);
+    }
+    else
+    {
+      pm.copyTo(y);
+      pt.copyTo(r);
+    }
+    var ys = y.t;
+    var y0 = y[ys - 1];
+    if (y0 == 0) return;
+    var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);
+    var d1 = this.FV / yt,
+      d2 = (1 << this.F1) / yt,
+      e = 1 << this.F2;
+    var i = r.t,
+      j = i - ys,
+      t = (q == null) ? nbi() : q;
+    y.dlShiftTo(j, t);
+    if (r.compareTo(t) >= 0)
+    {
+      r[r.t++] = 1;
+      r.subTo(t, r);
+    }
+    BigInteger.ONE.dlShiftTo(ys, t);
+    t.subTo(y, y); // "negative" y so we can replace sub with am later
+    while (y.t < ys) y[y.t++] = 0;
+    while (--j >= 0)
+    {
+      // Estimate quotient digit
+      var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
+      if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd)
+      { // Try it out
+        y.dlShiftTo(j, t);
+        r.subTo(t, r);
+        while (r[i] < --qd) r.subTo(t, r);
+      }
+    }
+    if (q != null)
+    {
+      r.drShiftTo(ys, q);
+      if (ts != ms) BigInteger.ZERO.subTo(q, q);
+    }
+    r.t = ys;
+    r.clamp();
+    if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder
+    if (ts < 0) BigInteger.ZERO.subTo(r, r);
+  }
+  // (public) this mod a
+  function bnMod(a)
+  {
+    var r = nbi();
+    this.abs().divRemTo(a, null, r);
+    if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r);
+    return r;
+  }
+  // Modular reduction using "classic" algorithm
+  function Classic(m)
+  {
+    this.m = m;
+  }
 
-// Generate the cross product of two vectors.
-Vec3.cross = function (a, b) {
-    return new Vec3(
-        a.y * b.z - a.z * b.y,
-        a.z * b.x - a.x * b.z,
-        a.x * b.y - a.y * b.x
-    );
-};
+  function cConvert(x)
+  {
+    if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
+    else return x;
+  }
 
-// Convert this vector to a string representation.
-Vec3.prototype.toString = function () {
-    return '[' + this.x + ', ' + this.y + ', ' + this.z + ']';
-};
+  function cRevert(x)
+  {
+    return x;
+  }
 
-// Convert this vector to an array.
-Vec3.prototype.toArray = function () {
-    var array = [];
-    array.push(this.x);
-    array.push(this.y);
-    array.push(this.z);
-    return array;
-};
+  function cReduce(x)
+  {
+    x.divRemTo(this.m, null, x);
+  }
 
-// Calculate the length of this vector.
-Vec3.prototype.getLength = function () {
-    return Math.sqrt(this.x * this.x + this.y * this.y + this.z * this.z);
-};
+  function cMulTo(x, y, r)
+  {
+    x.multiplyTo(y, r);
+    this.reduce(r);
+  }
 
-// Create a new vector that is this vector, normalized.
-Vec3.prototype.normalize = function () {
-    var len, c;
-    len = this.getLength();
-    if (len === 0) {
-        return this;
+  function cSqrTo(x, r)
+  {
+    x.squareTo(r);
+    this.reduce(r);
+  }
+  Classic.prototype.convert = cConvert;
+  Classic.prototype.revert = cRevert;
+  Classic.prototype.reduce = cReduce;
+  Classic.prototype.mulTo = cMulTo;
+  Classic.prototype.sqrTo = cSqrTo;
+  // (protected) return "-1/this % 2^DB"; useful for Mont. reduction
+  // justification:
+  //         xy == 1 (mod m)
+  //         xy =  1+km
+  //   xy(2-xy) = (1+km)(1-km)
+  // x[y(2-xy)] = 1-k^2m^2
+  // x[y(2-xy)] == 1 (mod m^2)
+  // if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
+  // should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
+  // JS multiply "overflows" differently from C/C++, so care is needed here.
+  function bnpInvDigit()
+  {
+    if (this.t < 1) return 0;
+    var x = this[0];
+    if ((x & 1) == 0) return 0;
+    var y = x & 3; // y == 1/x mod 2^2
+    y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4
+    y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8
+    y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16
+    // last step - calculate inverse mod DV directly;
+    // assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
+    y = (y * (2 - x * y % this.DV)) % this.DV; // y == 1/x mod 2^dbits
+    // we really want the negative inverse, and -DV < y < DV
+    return (y > 0) ? this.DV - y : -y;
+  }
+  // Montgomery reduction
+  function Montgomery(m)
+  {
+    this.m = m;
+    this.mp = m.invDigit();
+    this.mpl = this.mp & 0x7fff;
+    this.mph = this.mp >> 15;
+    this.um = (1 << (m.DB - 15)) - 1;
+    this.mt2 = 2 * m.t;
+  }
+  // xR mod m
+  function montConvert(x)
+  {
+    var r = nbi();
+    x.abs().dlShiftTo(this.m.t, r);
+    r.divRemTo(this.m, null, r);
+    if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r);
+    return r;
+  }
+  // x/R mod m
+  function montRevert(x)
+  {
+    var r = nbi();
+    x.copyTo(r);
+    this.reduce(r);
+    return r;
+  }
+  // x = x/R mod m (HAC 14.32)
+  function montReduce(x)
+  {
+    while (x.t <= this.mt2) // pad x so am has enough room later
+      x[x.t++] = 0;
+    for (var i = 0; i < this.m.t; ++i)
+    {
+      // faster way of calculating u0 = x[i]*mp mod DV
+      var j = x[i] & 0x7fff;
+      var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;
+      // use am to combine the multiply-shift-add into one call
+      j = i + this.m.t;
+      x[j] += this.m.am(0, u0, x, i, 0, this.m.t);
+      // propagate carry
+      while (x[j] >= x.DV)
+      {
+        x[j] -= x.DV;
+        x[++j]++;
+      }
+    }
+    x.clamp();
+    x.drShiftTo(this.m.t, x);
+    if (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
+  }
+  // r = "x^2/R mod m"; x != r
+  function montSqrTo(x, r)
+  {
+    x.squareTo(r);
+    this.reduce(r);
+  }
+  // r = "xy/R mod m"; x,y != r
+  function montMulTo(x, y, r)
+  {
+    x.multiplyTo(y, r);
+    this.reduce(r);
+  }
+  Montgomery.prototype.convert = montConvert;
+  Montgomery.prototype.revert = montRevert;
+  Montgomery.prototype.reduce = montReduce;
+  Montgomery.prototype.mulTo = montMulTo;
+  Montgomery.prototype.sqrTo = montSqrTo;
+  // (protected) true iff this is even
+  function bnpIsEven()
+  {
+    return ((this.t > 0) ? (this[0] & 1) : this.s) == 0;
+  }
+  // (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
+  function bnpExp(e, z)
+  {
+    if (e > 0xffffffff || e < 1) return BigInteger.ONE;
+    var r = nbi(),
+      r2 = nbi(),
+      g = z.convert(this),
+      i = nbits(e) - 1;
+    g.copyTo(r);
+    while (--i >= 0)
+    {
+      z.sqrTo(r, r2);
+      if ((e & (1 << i)) > 0) z.mulTo(r2, g, r);
+      else
+      {
+        var t = r;
+        r = r2;
+        r2 = t;
+      }
+    }
+    return z.revert(r);
+  }
+  // (public) this^e % m, 0 <= e < 2^32
+  function bnModPowInt(e, m)
+  {
+    var z;
+    if (e < 256 || m.isEven()) z = new Classic(m);
+    else z = new Montgomery(m);
+    return this.exp(e, z);
+  }
+  // protected
+  BigInteger.prototype.copyTo = bnpCopyTo;
+  BigInteger.prototype.fromInt = bnpFromInt;
+  BigInteger.prototype.fromString = bnpFromString;
+  BigInteger.prototype.clamp = bnpClamp;
+  BigInteger.prototype.dlShiftTo = bnpDLShiftTo;
+  BigInteger.prototype.drShiftTo = bnpDRShiftTo;
+  BigInteger.prototype.lShiftTo = bnpLShiftTo;
+  BigInteger.prototype.rShiftTo = bnpRShiftTo;
+  BigInteger.prototype.subTo = bnpSubTo;
+  BigInteger.prototype.multiplyTo = bnpMultiplyTo;
+  BigInteger.prototype.squareTo = bnpSquareTo;
+  BigInteger.prototype.divRemTo = bnpDivRemTo;
+  BigInteger.prototype.invDigit = bnpInvDigit;
+  BigInteger.prototype.isEven = bnpIsEven;
+  BigInteger.prototype.exp = bnpExp;
+  // public
+  BigInteger.prototype.toString = bnToString;
+  BigInteger.prototype.negate = bnNegate;
+  BigInteger.prototype.abs = bnAbs;
+  BigInteger.prototype.compareTo = bnCompareTo;
+  BigInteger.prototype.bitLength = bnBitLength;
+  BigInteger.prototype.mod = bnMod;
+  BigInteger.prototype.modPowInt = bnModPowInt;
+  // "constants"
+  BigInteger.ZERO = nbv(0);
+  BigInteger.ONE = nbv(1);
+  // Copyright (c) 2005-2009  Tom Wu
+  // All Rights Reserved.
+  // See "LICENSE" for details.
+  // Extended JavaScript BN functions, required for RSA private ops.
+  // Version 1.1: new BigInteger("0", 10) returns "proper" zero
+  // Version 1.2: square() API, isProbablePrime fix
+  // (public)
+  function bnClone()
+  {
+    var r = nbi();
+    this.copyTo(r);
+    return r;
+  }
+  // (public) return value as integer
+  function bnIntValue()
+  {
+    if (this.s < 0)
+    {
+      if (this.t == 1) return this[0] - this.DV;
+      else if (this.t == 0) return -1;
+    }
+    else if (this.t == 1) return this[0];
+    else if (this.t == 0) return 0;
+    // assumes 16 < DB < 32
+    return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];
+  }
+  // (public) return value as byte
+  function bnByteValue()
+  {
+    return (this.t == 0) ? this.s : (this[0] << 24) >> 24;
+  }
+  // (public) return value as short (assumes DB>=16)
+  function bnShortValue()
+  {
+    return (this.t == 0) ? this.s : (this[0] << 16) >> 16;
+  }
+  // (protected) return x s.t. r^x < DV
+  function bnpChunkSize(r)
+  {
+    return Math.floor(Math.LN2 * this.DB / Math.log(r));
+  }
+  // (public) 0 if this == 0, 1 if this > 0
+  function bnSigNum()
+  {
+    if (this.s < 0) return -1;
+    else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
+    else return 1;
+  }
+  // (protected) convert to radix string
+  function bnpToRadix(b)
+  {
+    if (b == null) b = 10;
+    if (this.signum() == 0 || b < 2 || b > 36) return "0";
+    var cs = this.chunkSize(b);
+    var a = Math.pow(b, cs);
+    var d = nbv(a),
+      y = nbi(),
+      z = nbi(),
+      r = "";
+    this.divRemTo(d, y, z);
+    while (y.signum() > 0)
+    {
+      r = (a + z.intValue()).toString(b).substr(1) + r;
+      y.divRemTo(d, y, z);
+    }
+    return z.intValue().toString(b) + r;
+  }
+  // (protected) convert from radix string
+  function bnpFromRadix(s, b)
+  {
+    this.fromInt(0);
+    if (b == null) b = 10;
+    var cs = this.chunkSize(b);
+    var d = Math.pow(b, cs),
+      mi = false,
+      j = 0,
+      w = 0;
+    for (var i = 0; i < s.length; ++i)
+    {
+      var x = intAt(s, i);
+      if (x < 0)
+      {
+        if (s.charAt(i) == "-" && this.signum() == 0) mi = true;
+        continue;
+      }
+      w = b * w + x;
+      if (++j >= cs)
+      {
+        this.dMultiply(d);
+        this.dAddOffset(w, 0);
+        j = 0;
+        w = 0;
+      }
     }
-    c = 1.0 / len;
-    return new Vec3(this.x * c, this.y * c, this.z * c);
-};
-
-// Create a new vector that is the addition of this vector and the given vector.
-Vec3.prototype.add = function (o) {
-    return new Vec3(this.x + o.x, this.y + o.y, this.z + o.z);
-};
-
-// Create a new vector that is the subtraction of this vector and the given vector.
-Vec3.prototype.subtract = function (o) {
-    return new Vec3(this.x - o.x, this.y - o.y, this.z - o.z);
-};
-
-// Transform the vector according to the matrix and return the result.
-// A new vector is created, nothing is modified.
-Vec3.prototype.transform = function (matrix4) {
-    var x, y, z, w, matrix;
-
-    matrix = matrix4;
-    x = (this.x * matrix.m[0]) + (this.y * matrix.m[4]) + (this.z * matrix.m[8]) + matrix.m[12];
-    y = (this.x * matrix.m[1]) + (this.y * matrix.m[5]) + (this.z * matrix.m[9]) + matrix.m[13];
-    z = (this.x * matrix.m[2]) + (this.y * matrix.m[6]) + (this.z * matrix.m[10]) + matrix.m[14];
-    w = (this.x * matrix.m[3]) + (this.y * matrix.m[7]) + (this.z * matrix.m[11]) + matrix.m[15];
-
-    return new Vec3(x / w, y / w, z / w);
-};
-
-module.exports = Vec3;
-},{}],38:[function(require,module,exports){
-// Bézier Math
-// Thanks to Prof. F. De Smedt at the Vrije Universiteit Brussel, 2006.
-
-'use strict';
-
-var _ = require('lodash');
-
-var math = require('../util/math');
-
-var Point = require('../objects/point');
-var Rect = require('../objects/rect');
-
-var bezier = {};
+    if (j > 0)
+    {
+      this.dMultiply(Math.pow(b, j));
+      this.dAddOffset(w, 0);
+    }
+    if (mi) BigInteger.ZERO.subTo(this, this);
+  }
+  // (protected) alternate constructor
+  function bnpFromNumber(a, b, c)
+  {
+    if ("number" == typeof b)
+    {
+      // new BigInteger(int,int,RNG)
+      if (a < 2) this.fromInt(1);
+      else
+      {
+        this.fromNumber(a, c);
+        if (!this.testBit(a - 1)) // force MSB set
+          this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
+        if (this.isEven()) this.dAddOffset(1, 0); // force odd
+        while (!this.isProbablePrime(b))
+        {
+          this.dAddOffset(2, 0);
+          if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
+        }
+      }
+    }
+    else
+    {
+      // new BigInteger(int,RNG)
+      var x = new Array(),
+        t = a & 7;
+      x.length = (a >> 3) + 1;
+      b.nextBytes(x);
+      if (t > 0) x[0] &= ((1 << t) - 1);
+      else x[0] = 0;
+      this.fromString(x, 256);
+    }
+  }
+  // (public) convert to bigendian byte array
+  function bnToByteArray()
+  {
+    var i = this.t,
+      r = new Array();
+    r[0] = this.s;
+    var p = this.DB - (i * this.DB) % 8,
+      d, k = 0;
+    if (i-- > 0)
+    {
+      if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p)
+        r[k++] = d | (this.s << (this.DB - p));
+      while (i >= 0)
+      {
+        if (p < 8)
+        {
+          d = (this[i] & ((1 << p) - 1)) << (8 - p);
+          d |= this[--i] >> (p += this.DB - 8);
+        }
+        else
+        {
+          d = (this[i] >> (p -= 8)) & 0xff;
+          if (p <= 0)
+          {
+            p += this.DB;
+            --i;
+          }
+        }
+        if ((d & 0x80) != 0) d |= -256;
+        if (k == 0 && (this.s & 0x80) != (d & 0x80))++k;
+        if (k > 0 || d != this.s) r[k++] = d;
+      }
+    }
+    return r;
+  }
 
-var MOVETO = bezier.MOVETO = 'M';
-var LINETO = bezier.LINETO = 'L';
-bezier.QUADTO = 'Q';
-var CURVETO = bezier.CURVETO = 'C';
-var CLOSE = bezier.CLOSE = 'Z';
+  function bnEquals(a)
+  {
+    return (this.compareTo(a) == 0);
+  }
 
-// BEZIER MATH:
+  function bnMin(a)
+  {
+    return (this.compareTo(a) < 0) ? this : a;
+  }
 
-// Returns coordinates for the point at t (0.0-1.0) on the line.
-bezier.linePoint = function (t, x0, y0, x1, y1) {
-    var x = x0 + t * (x1 - x0),
-        y = y0 + t * (y1 - y0);
-    return { type: LINETO, x: x, y: y };
-};
+  function bnMax(a)
+  {
+    return (this.compareTo(a) > 0) ? this : a;
+  }
+  // (protected) r = this op a (bitwise)
+  function bnpBitwiseTo(a, op, r)
+  {
+    var i, f, m = Math.min(a.t, this.t);
+    for (i = 0; i < m; ++i) r[i] = op(this[i], a[i]);
+    if (a.t < this.t)
+    {
+      f = a.s & this.DM;
+      for (i = m; i < this.t; ++i) r[i] = op(this[i], f);
+      r.t = this.t;
+    }
+    else
+    {
+      f = this.s & this.DM;
+      for (i = m; i < a.t; ++i) r[i] = op(f, a[i]);
+      r.t = a.t;
+    }
+    r.s = op(this.s, a.s);
+    r.clamp();
+  }
+  // (public) this & a
+  function op_and(x, y)
+  {
+    return x & y;
+  }
 
-// Returns the length of the line.
-bezier.lineLength = function (x0, y0, x1, y1) {
-    var a = Math.pow(Math.abs(x0 - x1), 2),
-        b = Math.pow(Math.abs(y0 - y1), 2);
-    return Math.sqrt(a + b);
-};
+  function bnAnd(a)
+  {
+    var r = nbi();
+    this.bitwiseTo(a, op_and, r);
+    return r;
+  }
+  // (public) this | a
+  function op_or(x, y)
+  {
+    return x | y;
+  }
 
-// Returns coordinates for the point at t (0.0-1.0) on the curve
-// (de Casteljau interpolation algorithm).
-bezier.curvePoint = function (t, x0, y0, x1, y1, x2, y2, x3, y3) {
-    var dt = 1 - t,
-        x01 = x0 * dt + x1 * t,
-        y01 = y0 * dt + y1 * t,
-        x12 = x1 * dt + x2 * t,
-        y12 = y1 * dt + y2 * t,
-        x23 = x2 * dt + x3 * t,
-        y23 = y2 * dt + y3 * t,
+  function bnOr(a)
+  {
+    var r = nbi();
+    this.bitwiseTo(a, op_or, r);
+    return r;
+  }
+  // (public) this ^ a
+  function op_xor(x, y)
+  {
+    return x ^ y;
+  }
 
-        h1x = x01 * dt + x12 * t,
-        h1y = y01 * dt + y12 * t,
-        h2x = x12 * dt + x23 * t,
-        h2y = y12 * dt + y23 * t,
-        x = h1x * dt + h2x * t,
-        y = h1y * dt + h2y * t;
-    return { type: CURVETO, x1: h1x, y1: h1y, x2: h2x, y2: h2y, x: x, y: y };
-};
+  function bnXor(a)
+  {
+    var r = nbi();
+    this.bitwiseTo(a, op_xor, r);
+    return r;
+  }
+  // (public) this & ~a
+  function op_andnot(x, y)
+  {
+    return x & ~y;
+  }
 
-// Returns the length of the curve.
-// Integrates the estimated length of the cubic bezier spline defined by x0, y0, ... x3, y3,
-// by adding up the length of n linear lines along the curve.
-bezier.curveLength = function (x0, y0, x1, y1, x2, y2, x3, y3, n) {
-    if (n === undefined) { n = 20; }
-    var i, t, cmd,
-        length = 0,
-        xi = x0,
-        yi = y0;
-    for (i = 0; i < n; i += 1) {
-        t = (i + 1) / n;
-        cmd = bezier.curvePoint(t, x0, y0, x1, y1, x2, y2, x3, y3);
-        length += Math.sqrt(
-            Math.pow(Math.abs(xi - cmd.x), 2) +
-                Math.pow(Math.abs(yi - cmd.y), 2)
-        );
-        xi = cmd.x;
-        yi = cmd.y;
+  function bnAndNot(a)
+  {
+    var r = nbi();
+    this.bitwiseTo(a, op_andnot, r);
+    return r;
+  }
+  // (public) ~this
+  function bnNot()
+  {
+    var r = nbi();
+    for (var i = 0; i < this.t; ++i) r[i] = this.DM & ~this[i];
+    r.t = this.t;
+    r.s = ~this.s;
+    return r;
+  }
+  // (public) this << n
+  function bnShiftLeft(n)
+  {
+    var r = nbi();
+    if (n < 0) this.rShiftTo(-n, r);
+    else this.lShiftTo(n, r);
+    return r;
+  }
+  // (public) this >> n
+  function bnShiftRight(n)
+  {
+    var r = nbi();
+    if (n < 0) this.lShiftTo(-n, r);
+    else this.rShiftTo(n, r);
+    return r;
+  }
+  // return index of lowest 1-bit in x, x < 2^31
+  function lbit(x)
+  {
+    if (x == 0) return -1;
+    var r = 0;
+    if ((x & 0xffff) == 0)
+    {
+      x >>= 16;
+      r += 16;
     }
-    return length;
-};
+    if ((x & 0xff) == 0)
+    {
+      x >>= 8;
+      r += 8;
+    }
+    if ((x & 0xf) == 0)
+    {
+      x >>= 4;
+      r += 4;
+    }
+    if ((x & 3) == 0)
+    {
+      x >>= 2;
+      r += 2;
+    }
+    if ((x & 1) == 0)++r;
+    return r;
+  }
+  // (public) returns index of lowest 1-bit (or -1 if none)
+  function bnGetLowestSetBit()
+  {
+    for (var i = 0; i < this.t; ++i)
+      if (this[i] != 0) return i * this.DB + lbit(this[i]);
+    if (this.s < 0) return this.t * this.DB;
+    return -1;
+  }
+  // return number of 1 bits in x
+  function cbit(x)
+  {
+    var r = 0;
+    while (x != 0)
+    {
+      x &= x - 1;
+      ++r;
+    }
+    return r;
+  }
+  // (public) return number of set bits
+  function bnBitCount()
+  {
+    var r = 0,
+      x = this.s & this.DM;
+    for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);
+    return r;
+  }
+  // (public) true iff nth bit is set
+  function bnTestBit(n)
+  {
+    var j = Math.floor(n / this.DB);
+    if (j >= this.t) return (this.s != 0);
+    return ((this[j] & (1 << (n % this.DB))) != 0);
+  }
+  // (protected) this op (1<<n)
+  function bnpChangeBit(n, op)
+  {
+    var r = BigInteger.ONE.shiftLeft(n);
+    this.bitwiseTo(r, op, r);
+    return r;
+  }
+  // (public) this | (1<<n)
+  function bnSetBit(n)
+  {
+    return this.changeBit(n, op_or);
+  }
+  // (public) this & ~(1<<n)
+  function bnClearBit(n)
+  {
+    return this.changeBit(n, op_andnot);
+  }
+  // (public) this ^ (1<<n)
+  function bnFlipBit(n)
+  {
+    return this.changeBit(n, op_xor);
+  }
+  // (protected) r = this + a
+  function bnpAddTo(a, r)
+  {
+    var i = 0,
+      c = 0,
+      m = Math.min(a.t, this.t);
+    while (i < m)
+    {
+      c += this[i] + a[i];
+      r[i++] = c & this.DM;
+      c >>= this.DB;
+    }
+    if (a.t < this.t)
+    {
+      c += a.s;
+      while (i < this.t)
+      {
+        c += this[i];
+        r[i++] = c & this.DM;
+        c >>= this.DB;
+      }
+      c += this.s;
+    }
+    else
+    {
+      c += this.s;
+      while (i < a.t)
+      {
+        c += a[i];
+        r[i++] = c & this.DM;
+        c >>= this.DB;
+      }
+      c += a.s;
+    }
+    r.s = (c < 0) ? -1 : 0;
+    if (c > 0) r[i++] = c;
+    else if (c < -1) r[i++] = this.DV + c;
+    r.t = i;
+    r.clamp();
+  }
+  // (public) this + a
+  function bnAdd(a)
+  {
+    var r = nbi();
+    this.addTo(a, r);
+    return r;
+  }
+  // (public) this - a
+  function bnSubtract(a)
+  {
+    var r = nbi();
+    this.subTo(a, r);
+    return r;
+  }
+  // (public) this * a
+  function bnMultiply(a)
+  {
+    var r = nbi();
+    this.multiplyTo(a, r);
+    return r;
+  }
+  // (public) this^2
+  function bnSquare()
+  {
+    var r = nbi();
+    this.squareTo(r);
+    return r;
+  }
+  // (public) this / a
+  function bnDivide(a)
+  {
+    var r = nbi();
+    this.divRemTo(a, r, null);
+    return r;
+  }
+  // (public) this % a
+  function bnRemainder(a)
+  {
+    var r = nbi();
+    this.divRemTo(a, null, r);
+    return r;
+  }
+  // (public) [this/a,this%a]
+  function bnDivideAndRemainder(a)
+  {
+    var q = nbi(),
+      r = nbi();
+    this.divRemTo(a, q, r);
+    return new Array(q, r);
+  }
+  // (protected) this *= n, this >= 0, 1 < n < DV
+  function bnpDMultiply(n)
+  {
+    this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);
+    ++this.t;
+    this.clamp();
+  }
+  // (protected) this += n << w words, this >= 0
+  function bnpDAddOffset(n, w)
+  {
+    if (n == 0) return;
+    while (this.t <= w) this[this.t++] = 0;
+    this[w] += n;
+    while (this[w] >= this.DV)
+    {
+      this[w] -= this.DV;
+      if (++w >= this.t) this[this.t++] = 0;
+      ++this[w];
+    }
+  }
+  // A "null" reducer
+  function NullExp()
+  {}
 
-// BEZIER PATH LENGTH:
+  function nNop(x)
+  {
+    return x;
+  }
 
-// Returns an array with the length of each command in the path.
-// With relative=true, the total length of all commands is 1.0.
-bezier.segmentLengths = function (commands, relative, n) {
-    relative = relative !== undefined ? relative : false;
-    if (n === undefined) { n = 20; }
-    var i, cmd, type, closeX, closeY, x0, y0, s, lengths;
-    lengths = [];
-    for (i = 0; i < commands.length; i += 1) {
-        cmd = commands[i];
-        type = cmd.type;
+  function nMulTo(x, y, r)
+  {
+    x.multiplyTo(y, r);
+  }
 
-        if (i === 0) {
-            closeX = cmd.x;
-            closeY = cmd.y;
-        } else if (type === MOVETO) {
-            closeX = cmd.x;
-            closeY = cmd.y;
-            lengths.push(0.0);
-        } else if (type === CLOSE) {
-            lengths.push(bezier.lineLength(x0, y0, closeX, closeY));
-        } else if (type === LINETO) {
-            lengths.push(bezier.lineLength(x0, y0, cmd.x, cmd.y));
-        } else if (type === CURVETO) {
-            lengths.push(bezier.curveLength(x0, y0, cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x, cmd.y, n));
+  function nSqrTo(x, r)
+  {
+    x.squareTo(r);
+  }
+  NullExp.prototype.convert = nNop;
+  NullExp.prototype.revert = nNop;
+  NullExp.prototype.mulTo = nMulTo;
+  NullExp.prototype.sqrTo = nSqrTo;
+  // (public) this^e
+  function bnPow(e)
+  {
+    return this.exp(e, new NullExp());
+  }
+  // (protected) r = lower n words of "this * a", a.t <= n
+  // "this" should be the larger one if appropriate.
+  function bnpMultiplyLowerTo(a, n, r)
+  {
+    var i = Math.min(this.t + a.t, n);
+    r.s = 0; // assumes a,this >= 0
+    r.t = i;
+    while (i > 0) r[--i] = 0;
+    var j;
+    for (j = r.t - this.t; i < j; ++i) r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
+    for (j = Math.min(a.t, n); i < j; ++i) this.am(0, a[i], r, i, 0, n - i);
+    r.clamp();
+  }
+  // (protected) r = "this * a" without lower n words, n > 0
+  // "this" should be the larger one if appropriate.
+  function bnpMultiplyUpperTo(a, n, r)
+  {
+    --n;
+    var i = r.t = this.t + a.t - n;
+    r.s = 0; // assumes a,this >= 0
+    while (--i >= 0) r[i] = 0;
+    for (i = Math.max(n - this.t, 0); i < a.t; ++i)
+      r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);
+    r.clamp();
+    r.drShiftTo(1, r);
+  }
+  // Barrett modular reduction
+  function Barrett(m)
+  {
+    // setup Barrett
+    this.r2 = nbi();
+    this.q3 = nbi();
+    BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);
+    this.mu = this.r2.divide(m);
+    this.m = m;
+  }
+
+  function barrettConvert(x)
+  {
+    if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);
+    else if (x.compareTo(this.m) < 0) return x;
+    else
+    {
+      var r = nbi();
+      x.copyTo(r);
+      this.reduce(r);
+      return r;
+    }
+  }
+
+  function barrettRevert(x)
+  {
+    return x;
+  }
+  // x = x mod m (HAC 14.42)
+  function barrettReduce(x)
+  {
+    x.drShiftTo(this.m.t - 1, this.r2);
+    if (x.t > this.m.t + 1)
+    {
+      x.t = this.m.t + 1;
+      x.clamp();
+    }
+    this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);
+    this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);
+    while (x.compareTo(this.r2) < 0) x.dAddOffset(1, this.m.t + 1);
+    x.subTo(this.r2, x);
+    while (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
+  }
+  // r = x^2 mod m; x != r
+  function barrettSqrTo(x, r)
+  {
+    x.squareTo(r);
+    this.reduce(r);
+  }
+  // r = x*y mod m; x,y != r
+  function barrettMulTo(x, y, r)
+  {
+    x.multiplyTo(y, r);
+    this.reduce(r);
+  }
+  Barrett.prototype.convert = barrettConvert;
+  Barrett.prototype.revert = barrettRevert;
+  Barrett.prototype.reduce = barrettReduce;
+  Barrett.prototype.mulTo = barrettMulTo;
+  Barrett.prototype.sqrTo = barrettSqrTo;
+  // (public) this^e % m (HAC 14.85)
+  function bnModPow(e, m)
+  {
+    var i = e.bitLength(),
+      k, r = nbv(1),
+      z;
+    if (i <= 0) return r;
+    else if (i < 18) k = 1;
+    else if (i < 48) k = 3;
+    else if (i < 144) k = 4;
+    else if (i < 768) k = 5;
+    else k = 6;
+    if (i < 8)
+      z = new Classic(m);
+    else if (m.isEven())
+      z = new Barrett(m);
+    else
+      z = new Montgomery(m);
+    // precomputation
+    var g = new Array(),
+      n = 3,
+      k1 = k - 1,
+      km = (1 << k) - 1;
+    g[1] = z.convert(this);
+    if (k > 1)
+    {
+      var g2 = nbi();
+      z.sqrTo(g[1], g2);
+      while (n <= km)
+      {
+        g[n] = nbi();
+        z.mulTo(g2, g[n - 2], g[n]);
+        n += 2;
+      }
+    }
+    var j = e.t - 1,
+      w, is1 = true,
+      r2 = nbi(),
+      t;
+    i = nbits(e[j]) - 1;
+    while (j >= 0)
+    {
+      if (i >= k1) w = (e[j] >> (i - k1)) & km;
+      else
+      {
+        w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);
+        if (j > 0) w |= e[j - 1] >> (this.DB + i - k1);
+      }
+      n = k;
+      while ((w & 1) == 0)
+      {
+        w >>= 1;
+        --n;
+      }
+      if ((i -= n) < 0)
+      {
+        i += this.DB;
+        --j;
+      }
+      if (is1)
+      { // ret == 1, don't bother squaring or multiplying it
+        g[w].copyTo(r);
+        is1 = false;
+      }
+      else
+      {
+        while (n > 1)
+        {
+          z.sqrTo(r, r2);
+          z.sqrTo(r2, r);
+          n -= 2;
+        }
+        if (n > 0) z.sqrTo(r, r2);
+        else
+        {
+          t = r;
+          r = r2;
+          r2 = t;
+        }
+        z.mulTo(r2, g[w], r);
+      }
+      while (j >= 0 && (e[j] & (1 << i)) == 0)
+      {
+        z.sqrTo(r, r2);
+        t = r;
+        r = r2;
+        r2 = t;
+        if (--i < 0)
+        {
+          i = this.DB - 1;
+          --j;
+        }
+      }
+    }
+    return z.revert(r);
+  }
+  // (public) gcd(this,a) (HAC 14.54)
+  function bnGCD(a)
+  {
+    var x = (this.s < 0) ? this.negate() : this.clone();
+    var y = (a.s < 0) ? a.negate() : a.clone();
+    if (x.compareTo(y) < 0)
+    {
+      var t = x;
+      x = y;
+      y = t;
+    }
+    var i = x.getLowestSetBit(),
+      g = y.getLowestSetBit();
+    if (g < 0) return x;
+    if (i < g) g = i;
+    if (g > 0)
+    {
+      x.rShiftTo(g, x);
+      y.rShiftTo(g, y);
+    }
+    while (x.signum() > 0)
+    {
+      if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x);
+      if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y);
+      if (x.compareTo(y) >= 0)
+      {
+        x.subTo(y, x);
+        x.rShiftTo(1, x);
+      }
+      else
+      {
+        y.subTo(x, y);
+        y.rShiftTo(1, y);
+      }
+    }
+    if (g > 0) y.lShiftTo(g, y);
+    return y;
+  }
+  // (protected) this % n, n < 2^26
+  function bnpModInt(n)
+  {
+    if (n <= 0) return 0;
+    var d = this.DV % n,
+      r = (this.s < 0) ? n - 1 : 0;
+    if (this.t > 0)
+      if (d == 0) r = this[0] % n;
+      else
+        for (var i = this.t - 1; i >= 0; --i) r = (d * r + this[i]) % n;
+    return r;
+  }
+  // (public) 1/this % m (HAC 14.61)
+  function bnModInverse(m)
+  {
+    var ac = m.isEven();
+    if ((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;
+    var u = m.clone(),
+      v = this.clone();
+    var a = nbv(1),
+      b = nbv(0),
+      c = nbv(0),
+      d = nbv(1);
+    while (u.signum() != 0)
+    {
+      while (u.isEven())
+      {
+        u.rShiftTo(1, u);
+        if (ac)
+        {
+          if (!a.isEven() || !b.isEven())
+          {
+            a.addTo(this, a);
+            b.subTo(m, b);
+          }
+          a.rShiftTo(1, a);
+        }
+        else if (!b.isEven()) b.subTo(m, b);
+        b.rShiftTo(1, b);
+      }
+      while (v.isEven())
+      {
+        v.rShiftTo(1, v);
+        if (ac)
+        {
+          if (!c.isEven() || !d.isEven())
+          {
+            c.addTo(this, c);
+            d.subTo(m, d);
+          }
+          c.rShiftTo(1, c);
+        }
+        else if (!d.isEven()) d.subTo(m, d);
+        d.rShiftTo(1, d);
+      }
+      if (u.compareTo(v) >= 0)
+      {
+        u.subTo(v, u);
+        if (ac) a.subTo(c, a);
+        b.subTo(d, b);
+      }
+      else
+      {
+        v.subTo(u, v);
+        if (ac) c.subTo(a, c);
+        d.subTo(b, d);
+      }
+    }
+    if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
+    if (d.compareTo(m) >= 0) return d.subtract(m);
+    if (d.signum() < 0) d.addTo(m, d);
+    else return d;
+    if (d.signum() < 0) return d.add(m);
+    else return d;
+  }
+  var lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];
+  var lplim = (1 << 26) / lowprimes[lowprimes.length - 1];
+  // (public) test primality with certainty >= 1-.5^t
+  function bnIsProbablePrime(t)
+  {
+    var i, x = this.abs();
+    if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1])
+    {
+      for (i = 0; i < lowprimes.length; ++i)
+        if (x[0] == lowprimes[i]) return true;
+      return false;
+    }
+    if (x.isEven()) return false;
+    i = 1;
+    while (i < lowprimes.length)
+    {
+      var m = lowprimes[i],
+        j = i + 1;
+      while (j < lowprimes.length && m < lplim) m *= lowprimes[j++];
+      m = x.modInt(m);
+      while (i < j)
+        if (m % lowprimes[i++] == 0) return false;
+    }
+    return x.millerRabin(t);
+  }
+  // (protected) true if probably prime (HAC 4.24, Miller-Rabin)
+  function bnpMillerRabin(t)
+  {
+    var n1 = this.subtract(BigInteger.ONE);
+    var k = n1.getLowestSetBit();
+    if (k <= 0) return false;
+    var r = n1.shiftRight(k);
+    t = (t + 1) >> 1;
+    if (t > lowprimes.length) t = lowprimes.length;
+    var a = nbi();
+    for (var i = 0; i < t; ++i)
+    {
+      //Pick bases at random, instead of starting at 2
+      a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);
+      var y = a.modPow(r, this);
+      if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0)
+      {
+        var j = 1;
+        while (j++ < k && y.compareTo(n1) != 0)
+        {
+          y = y.modPowInt(2, this);
+          if (y.compareTo(BigInteger.ONE) == 0) return false;
+        }
+        if (y.compareTo(n1) != 0) return false;
+      }
+    }
+    return true;
+  }
+  // protected
+  BigInteger.prototype.chunkSize = bnpChunkSize;
+  BigInteger.prototype.toRadix = bnpToRadix;
+  BigInteger.prototype.fromRadix = bnpFromRadix;
+  BigInteger.prototype.fromNumber = bnpFromNumber;
+  BigInteger.prototype.bitwiseTo = bnpBitwiseTo;
+  BigInteger.prototype.changeBit = bnpChangeBit;
+  BigInteger.prototype.addTo = bnpAddTo;
+  BigInteger.prototype.dMultiply = bnpDMultiply;
+  BigInteger.prototype.dAddOffset = bnpDAddOffset;
+  BigInteger.prototype.multiplyLowerTo = bnpMultiplyLowerTo;
+  BigInteger.prototype.multiplyUpperTo = bnpMultiplyUpperTo;
+  BigInteger.prototype.modInt = bnpModInt;
+  BigInteger.prototype.millerRabin = bnpMillerRabin;
+  // public
+  BigInteger.prototype.clone = bnClone;
+  BigInteger.prototype.intValue = bnIntValue;
+  BigInteger.prototype.byteValue = bnByteValue;
+  BigInteger.prototype.shortValue = bnShortValue;
+  BigInteger.prototype.signum = bnSigNum;
+  BigInteger.prototype.toByteArray = bnToByteArray;
+  BigInteger.prototype.equals = bnEquals;
+  BigInteger.prototype.min = bnMin;
+  BigInteger.prototype.max = bnMax;
+  BigInteger.prototype.and = bnAnd;
+  BigInteger.prototype.or = bnOr;
+  BigInteger.prototype.xor = bnXor;
+  BigInteger.prototype.andNot = bnAndNot;
+  BigInteger.prototype.not = bnNot;
+  BigInteger.prototype.shiftLeft = bnShiftLeft;
+  BigInteger.prototype.shiftRight = bnShiftRight;
+  BigInteger.prototype.getLowestSetBit = bnGetLowestSetBit;
+  BigInteger.prototype.bitCount = bnBitCount;
+  BigInteger.prototype.testBit = bnTestBit;
+  BigInteger.prototype.setBit = bnSetBit;
+  BigInteger.prototype.clearBit = bnClearBit;
+  BigInteger.prototype.flipBit = bnFlipBit;
+  BigInteger.prototype.add = bnAdd;
+  BigInteger.prototype.subtract = bnSubtract;
+  BigInteger.prototype.multiply = bnMultiply;
+  BigInteger.prototype.divide = bnDivide;
+  BigInteger.prototype.remainder = bnRemainder;
+  BigInteger.prototype.divideAndRemainder = bnDivideAndRemainder;
+  BigInteger.prototype.modPow = bnModPow;
+  BigInteger.prototype.modInverse = bnModInverse;
+  BigInteger.prototype.pow = bnPow;
+  BigInteger.prototype.gcd = bnGCD;
+  BigInteger.prototype.isProbablePrime = bnIsProbablePrime;
+  // JSBN-specific extension
+  BigInteger.prototype.square = bnSquare;
+  var Int128 = BigInteger;
+  // BigInteger interfaces not implemented in jsbn:
+  // BigInteger(int signum, byte[] magnitude)
+  // double doubleValue()
+  // float floatValue()
+  // int hashCode()
+  // long longValue()
+  // static BigInteger valueOf(long val)
+  // Helper functions to make BigInteger functions callable with two parameters
+  // as in original C# Clipper
+  Int128.prototype.IsNegative = function ()
+  {
+    if (this.compareTo(Int128.ZERO) == -1) return true;
+    else return false;
+  };
+  Int128.op_Equality = function (val1, val2)
+  {
+    if (val1.compareTo(val2) == 0) return true;
+    else return false;
+  };
+  Int128.op_Inequality = function (val1, val2)
+  {
+    if (val1.compareTo(val2) != 0) return true;
+    else return false;
+  };
+  Int128.op_GreaterThan = function (val1, val2)
+  {
+    if (val1.compareTo(val2) > 0) return true;
+    else return false;
+  };
+  Int128.op_LessThan = function (val1, val2)
+  {
+    if (val1.compareTo(val2) < 0) return true;
+    else return false;
+  };
+  Int128.op_Addition = function (lhs, rhs)
+  {
+    return new Int128(lhs).add(new Int128(rhs));
+  };
+  Int128.op_Subtraction = function (lhs, rhs)
+  {
+    return new Int128(lhs).subtract(new Int128(rhs));
+  };
+  Int128.Int128Mul = function (lhs, rhs)
+  {
+    return new Int128(lhs).multiply(new Int128(rhs));
+  };
+  Int128.op_Division = function (lhs, rhs)
+  {
+    return lhs.divide(rhs);
+  };
+  Int128.prototype.ToDouble = function ()
+  {
+    return parseFloat(this.toString()); // This could be something faster
+  };
+  // end of Int128 section
+  /*
+  // Uncomment the following two lines if you want to use Int128 outside ClipperLib
+  if (typeof(document) !== "undefined") window.Int128 = Int128;
+  else self.Int128 = Int128;
+  */
+
+
+  // ---------------------------------------------
+  // Here starts the actual Clipper library:
+  // Helper function to support Inheritance in Javascript
+	var Inherit = function (ce, ce2)
+	{
+		var p;
+		if (typeof (Object.getOwnPropertyNames) == 'undefined')
+		{
+			for (p in ce2.prototype)
+				if (typeof (ce.prototype[p]) == 'undefined' || ce.prototype[p] == Object.prototype[p]) ce.prototype[p] = ce2.prototype[p];
+			for (p in ce2)
+				if (typeof (ce[p]) == 'undefined') ce[p] = ce2[p];
+			ce.$baseCtor = ce2;
+		}
+		else
+		{
+			var props = Object.getOwnPropertyNames(ce2.prototype);
+			for (var i = 0; i < props.length; i++)
+				if (typeof (Object.getOwnPropertyDescriptor(ce.prototype, props[i])) == 'undefined') Object.defineProperty(ce.prototype, props[i], Object.getOwnPropertyDescriptor(ce2.prototype, props[i]));
+			for (p in ce2)
+				if (typeof (ce[p]) == 'undefined') ce[p] = ce2[p];
+			ce.$baseCtor = ce2;
+		}
+	};
+  ClipperLib.Path = function ()
+  {
+    return [];
+  };
+  ClipperLib.Paths = function ()
+  {
+    return []; // Was previously [[]], but caused problems when pushed
+  };
+  // Preserves the calling way of original C# Clipper
+  // Is essential due to compatibility, because DoublePoint is public class in original C# version
+  ClipperLib.DoublePoint = function ()
+  {
+    var a = arguments;
+    this.X = 0;
+    this.Y = 0;
+    // public DoublePoint(DoublePoint dp)
+    // public DoublePoint(IntPoint ip)
+    if (a.length == 1)
+    {
+      this.X = a[0].X;
+      this.Y = a[0].Y;
+    }
+    else if (a.length == 2)
+    {
+      this.X = a[0];
+      this.Y = a[1];
+    }
+  }; // This is internal faster function when called without arguments
+  ClipperLib.DoublePoint0 = function ()
+  {
+    this.X = 0;
+    this.Y = 0;
+  };
+  // This is internal faster function when called with 1 argument (dp or ip)
+  ClipperLib.DoublePoint1 = function (dp)
+  {
+    this.X = dp.X;
+    this.Y = dp.Y;
+  };
+  // This is internal faster function when called with 2 arguments (x and y)
+  ClipperLib.DoublePoint2 = function (x, y)
+  {
+    this.X = x;
+    this.Y = y;
+  };
+  // PolyTree & PolyNode start
+  // -------------------------------
+  ClipperLib.PolyNode = function ()
+  {
+    this.m_Parent = null;
+    this.m_polygon = new ClipperLib.Path();
+    this.m_Index = 0;
+    this.m_jointype = 0;
+    this.m_endtype = 0;
+    this.m_Childs = [];
+    this.IsOpen = false;
+  };
+  ClipperLib.PolyNode.prototype.IsHoleNode = function ()
+  {
+    var result = true;
+    var node = this.m_Parent;
+    while (node !== null)
+    {
+      result = !result;
+      node = node.m_Parent;
+    }
+    return result;
+  };
+  ClipperLib.PolyNode.prototype.ChildCount = function ()
+  {
+    return this.m_Childs.length;
+  };
+  ClipperLib.PolyNode.prototype.Contour = function ()
+  {
+    return this.m_polygon;
+  };
+  ClipperLib.PolyNode.prototype.AddChild = function (Child)
+  {
+    var cnt = this.m_Childs.length;
+    this.m_Childs.push(Child);
+    Child.m_Parent = this;
+    Child.m_Index = cnt;
+  };
+  ClipperLib.PolyNode.prototype.GetNext = function ()
+  {
+    if (this.m_Childs.length > 0)
+      return this.m_Childs[0];
+    else
+      return this.GetNextSiblingUp();
+  };
+  ClipperLib.PolyNode.prototype.GetNextSiblingUp = function ()
+  {
+    if (this.m_Parent === null)
+      return null;
+    else if (this.m_Index == this.m_Parent.m_Childs.length - 1)
+      return this.m_Parent.GetNextSiblingUp();
+    else
+      return this.m_Parent.m_Childs[this.m_Index + 1];
+  };
+  ClipperLib.PolyNode.prototype.Childs = function ()
+  {
+    return this.m_Childs;
+  };
+  ClipperLib.PolyNode.prototype.Parent = function ()
+  {
+    return this.m_Parent;
+  };
+  ClipperLib.PolyNode.prototype.IsHole = function ()
+  {
+    return this.IsHoleNode();
+  };
+  // PolyTree : PolyNode
+  ClipperLib.PolyTree = function ()
+  {
+    this.m_AllPolys = [];
+    ClipperLib.PolyNode.call(this);
+  };
+  ClipperLib.PolyTree.prototype.Clear = function ()
+  {
+    for (var i = 0, ilen = this.m_AllPolys.length; i < ilen; i++)
+      this.m_AllPolys[i] = null;
+    this.m_AllPolys.length = 0;
+    this.m_Childs.length = 0;
+  };
+  ClipperLib.PolyTree.prototype.GetFirst = function ()
+  {
+    if (this.m_Childs.length > 0)
+      return this.m_Childs[0];
+    else
+      return null;
+  };
+  ClipperLib.PolyTree.prototype.Total = function ()
+  {
+		var result = this.m_AllPolys.length;
+		//with negative offsets, ignore the hidden outer polygon ...
+		if (result > 0 && this.m_Childs[0] != this.m_AllPolys[0]) result--;
+		return result;
+  };
+  Inherit(ClipperLib.PolyTree, ClipperLib.PolyNode);
+  // -------------------------------
+  // PolyTree & PolyNode end
+  ClipperLib.Math_Abs_Int64 = ClipperLib.Math_Abs_Int32 = ClipperLib.Math_Abs_Double = function (a)
+  {
+    return Math.abs(a);
+  };
+  ClipperLib.Math_Max_Int32_Int32 = function (a, b)
+  {
+    return Math.max(a, b);
+  };
+  /*
+  -----------------------------------
+  cast_32 speedtest: http://jsperf.com/truncate-float-to-integer/2
+  -----------------------------------
+  */
+  if (browser.msie || browser.opera || browser.safari) ClipperLib.Cast_Int32 = function (a)
+  {
+    return a | 0;
+  };
+  else ClipperLib.Cast_Int32 = function (a)
+  { // eg. browser.chrome || browser.chromium || browser.firefox
+    return~~ a;
+  };
+  /*
+  --------------------------
+  cast_64 speedtests: http://jsperf.com/truncate-float-to-integer
+  Chrome: bitwise_not_floor
+  Firefox17: toInteger (typeof test)
+  IE9: bitwise_or_floor
+  IE7 and IE8: to_parseint
+  Chromium: to_floor_or_ceil
+  Firefox3: to_floor_or_ceil
+  Firefox15: to_floor_or_ceil
+  Opera: to_floor_or_ceil
+  Safari: to_floor_or_ceil
+  --------------------------
+  */
+  if (browser.chrome) ClipperLib.Cast_Int64 = function (a)
+  {
+    if (a < -2147483648 || a > 2147483647)
+      return a < 0 ? Math.ceil(a) : Math.floor(a);
+    else return~~ a;
+  };
+  else if (browser.firefox && typeof (Number.toInteger) == "function") ClipperLib.Cast_Int64 = function (a)
+  {
+    return Number.toInteger(a);
+  };
+  else if (browser.msie7 || browser.msie8) ClipperLib.Cast_Int64 = function (a)
+  {
+    return parseInt(a, 10);
+  };
+  else if (browser.msie) ClipperLib.Cast_Int64 = function (a)
+  {
+    if (a < -2147483648 || a > 2147483647)
+      return a < 0 ? Math.ceil(a) : Math.floor(a);
+    return a | 0;
+  };
+  // eg. browser.chromium || browser.firefox || browser.opera || browser.safari
+  else ClipperLib.Cast_Int64 = function (a)
+  {
+    return a < 0 ? Math.ceil(a) : Math.floor(a);
+  };
+  ClipperLib.Clear = function (a)
+  {
+    a.length = 0;
+  };
+  //ClipperLib.MaxSteps = 64; // How many steps at maximum in arc in BuildArc() function
+  ClipperLib.PI = 3.141592653589793;
+  ClipperLib.PI2 = 2 * 3.141592653589793;
+  ClipperLib.IntPoint = function ()
+  {
+    var a = arguments,
+      alen = a.length;
+    this.X = 0;
+    this.Y = 0;
+    if (ClipperLib.use_xyz)
+    {
+      this.Z = 0;
+      if (alen == 3) // public IntPoint(cInt x, cInt y, cInt z = 0)
+      {
+        this.X = a[0];
+        this.Y = a[1];
+        this.Z = a[2];
+      }
+      else if (alen == 2) // public IntPoint(cInt x, cInt y)
+      {
+        this.X = a[0];
+        this.Y = a[1];
+        this.Z = 0;
+      }
+      else if (alen == 1)
+      {
+        if (a[0] instanceof ClipperLib.DoublePoint) // public IntPoint(DoublePoint dp)
+        {
+          var dp = a[0];
+          this.X = ClipperLib.Clipper.Round(dp.X);
+          this.Y = ClipperLib.Clipper.Round(dp.Y);
+          this.Z = 0;
+        }
+        else // public IntPoint(IntPoint pt)
+        {
+          var pt = a[0];
+          if (typeof (pt.Z) == "undefined") pt.Z = 0;
+          this.X = pt.X;
+          this.Y = pt.Y;
+          this.Z = pt.Z;
+        }
+      }
+      else // public IntPoint()
+      {
+        this.X = 0;
+        this.Y = 0;
+        this.Z = 0;
+      }
+    }
+    else // if (!ClipperLib.use_xyz)
+    {
+      if (alen == 2) // public IntPoint(cInt X, cInt Y)
+      {
+        this.X = a[0];
+        this.Y = a[1];
+      }
+      else if (alen == 1)
+      {
+        if (a[0] instanceof ClipperLib.DoublePoint) // public IntPoint(DoublePoint dp)
+        {
+          var dp = a[0];
+          this.X = ClipperLib.Clipper.Round(dp.X);
+          this.Y = ClipperLib.Clipper.Round(dp.Y);
         }
-        if (type !== CLOSE) {
-            x0 = cmd.x;
-            y0 = cmd.y;
+        else // public IntPoint(IntPoint pt)
+        {
+          var pt = a[0];
+          this.X = pt.X;
+          this.Y = pt.Y;
         }
+      }
+      else // public IntPoint(IntPoint pt)
+      {
+        this.X = 0;
+        this.Y = 0;
+      }
     }
-    if (relative === true) {
-        s = math.sum(lengths);
-        return (s > 0) ?
-                _.map(lengths, function (v) { return v / s; }) :
-                _.map(lengths, function () { return 0.0; });
+  };
+  ClipperLib.IntPoint.op_Equality = function (a, b)
+  {
+    //return a == b;
+    return a.X == b.X && a.Y == b.Y;
+  };
+  ClipperLib.IntPoint.op_Inequality = function (a, b)
+  {
+    //return a != b;
+    return a.X != b.X || a.Y != b.Y;
+  };
+  /*
+  ClipperLib.IntPoint.prototype.Equals = function (obj)
+  {
+    if (obj === null)
+        return false;
+    if (obj instanceof ClipperLib.IntPoint)
+    {
+        var a = Cast(obj, ClipperLib.IntPoint);
+        return (this.X == a.X) && (this.Y == a.Y);
     }
-    return lengths;
-};
-
-// Returns the approximate length of the path.
-// Calculates the length of each curve in the path using n linear samples.
-bezier.length = function (path, n) {
-    n = n || 20;
-    return math.sum(bezier.segmentLengths(path.commands, false, n));
-};
-
-// BEZIER PATH POINT:
-
-// For a given relative t on the path (0.0-1.0), returns an array [index, t, PathElement],
-// with the index of the PathElement before t, the absolute position on this segment,
-// the last MOVETO or any subsequent CLOSE commands after i.
-// Note: during iteration, supplying segment lengths yourself is 30x faster.
-bezier._locate = function (path, t, segmentLengths) {
-    var i, cmd, closeTo;
-    if (segmentLengths === undefined) {
-        segmentLengths = bezier.segmentLengths(path.commands, true);
+    else
+        return false;
+  };
+*/
+  if (ClipperLib.use_xyz)
+  {
+    ClipperLib.IntPoint0 = function ()
+    {
+      this.X = 0;
+      this.Y = 0;
+      this.Z = 0;
+    };
+    ClipperLib.IntPoint1 = function (pt)
+    {
+      this.X = pt.X;
+      this.Y = pt.Y;
+      this.Z = pt.Z;
+    };
+    ClipperLib.IntPoint1dp = function (dp)
+    {
+      this.X = ClipperLib.Clipper.Round(dp.X);
+      this.Y = ClipperLib.Clipper.Round(dp.Y);
+      this.Z = 0;
+    };
+    ClipperLib.IntPoint2 = function (x, y)
+    {
+      this.X = x;
+      this.Y = y;
+      this.Z = 0;
+    };
+    ClipperLib.IntPoint3 = function (x, y, z)
+    {
+      this.X = x;
+      this.Y = y;
+      this.Z = z;
+    };
+  }
+  else // if (!ClipperLib.use_xyz)
+  {
+    ClipperLib.IntPoint0 = function ()
+    {
+      this.X = 0;
+      this.Y = 0;
+    };
+    ClipperLib.IntPoint1 = function (pt)
+    {
+      this.X = pt.X;
+      this.Y = pt.Y;
+    };
+    ClipperLib.IntPoint1dp = function (dp)
+    {
+      this.X = ClipperLib.Clipper.Round(dp.X);
+      this.Y = ClipperLib.Clipper.Round(dp.Y);
+    };
+    ClipperLib.IntPoint2 = function (x, y)
+    {
+      this.X = x;
+      this.Y = y;
+    };
+  }
+  ClipperLib.IntRect = function ()
+  {
+    var a = arguments,
+      alen = a.length;
+    if (alen == 4) // function (l, t, r, b)
+    {
+      this.left = a[0];
+      this.top = a[1];
+      this.right = a[2];
+      this.bottom = a[3];
     }
-    for (i = 0; i < path.commands.length; i += 1) {
-        cmd = path.commands[i];
-        if (i === 0 || cmd.type === MOVETO) {
-            closeTo =  new Point(cmd.x, cmd.y);
-        }
-        if (t <= segmentLengths[i] || i === segmentLengths.length - 1) {
-            break;
-        }
-        t -= segmentLengths[i];
+    else if (alen == 1) // function (ir)
+    {
+      this.left = ir.left;
+      this.top = ir.top;
+      this.right = ir.right;
+      this.bottom = ir.bottom;
     }
-    if (segmentLengths[i] !== 0) { t /= segmentLengths[i]; }
-    if (i === segmentLengths.length - 1 && segmentLengths[i] === 0) { i -= 1; }
-    return [i, t, closeTo];
-};
-
-// Returns the DynamicPathElement at time t on the path.
-// Note: in PathElement, ctrl1 is how the curve started, and ctrl2 how it arrives in this point.
-// Here, ctrl1 is how the curve arrives, and ctrl2 how it continues to the next point.
-bezier.point = function (path, t, segmentLengths) {
-    var loc, i, closeTo, x0, y0, cmd;
-    loc = bezier._locate(path, t, segmentLengths);
-    i = loc[0];
-    t = loc[1];
-    closeTo = loc[2];
-    x0 = path.commands[i].x;
-    y0 = path.commands[i].y;
-    cmd = path.commands[i + 1];
-    if (cmd.type === LINETO || cmd.type === CLOSE) {
-        cmd = (cmd.type === CLOSE) ?
-                 bezier.linePoint(t, x0, y0, closeTo.x, closeTo.y) :
-                 bezier.linePoint(t, x0, y0, cmd.x, cmd.y);
-    } else if (cmd.type === CURVETO) {
-        cmd = bezier.curvePoint(t, x0, y0, cmd.x1, cmd.y1, cmd.x2, cmd.y2, cmd.x, cmd.y);
+    else // function ()
+    {
+      this.left = 0;
+      this.top = 0;
+      this.right = 0;
+      this.bottom = 0;
     }
-    return cmd;
-};
-
-bezier.extrema = function (x1, y1, x2, y2, x3, y3, x4, y4) {
-    var minX, maxX, minY, maxY,
-        ax, bx, cx, ay, by, cy,
-        temp, rcp, tx, ty;
-
+  };
+  ClipperLib.IntRect0 = function ()
+  {
+    this.left = 0;
+    this.top = 0;
+    this.right = 0;
+    this.bottom = 0;
+  };
+  ClipperLib.IntRect1 = function (ir)
+  {
+    this.left = ir.left;
+    this.top = ir.top;
+    this.right = ir.right;
+    this.bottom = ir.bottom;
+  };
+  ClipperLib.IntRect4 = function (l, t, r, b)
+  {
+    this.left = l;
+    this.top = t;
+    this.right = r;
+    this.bottom = b;
+  };
+  ClipperLib.ClipType = {
+    ctIntersection: 0,
+    ctUnion: 1,
+    ctDifference: 2,
+    ctXor: 3
+  };
+  ClipperLib.PolyType = {
+    ptSubject: 0,
+    ptClip: 1
+  };
+  ClipperLib.PolyFillType = {
+    pftEvenOdd: 0,
+    pftNonZero: 1,
+    pftPositive: 2,
+    pftNegative: 3
+  };
+  ClipperLib.JoinType = {
+    jtSquare: 0,
+    jtRound: 1,
+    jtMiter: 2
+  };
+  ClipperLib.EndType = {
+    etOpenSquare: 0,
+    etOpenRound: 1,
+    etOpenButt: 2,
+    etClosedLine: 3,
+    etClosedPolygon: 4
+  };
+  ClipperLib.EdgeSide = {
+    esLeft: 0,
+    esRight: 1
+  };
+  ClipperLib.Direction = {
+    dRightToLeft: 0,
+    dLeftToRight: 1
+  };
+  ClipperLib.TEdge = function ()
+  {
+    this.Bot = new ClipperLib.IntPoint();
+    this.Curr = new ClipperLib.IntPoint();
+    this.Top = new ClipperLib.IntPoint();
+    this.Delta = new ClipperLib.IntPoint();
+    this.Dx = 0;
+    this.PolyTyp = ClipperLib.PolyType.ptSubject;
+    this.Side = ClipperLib.EdgeSide.esLeft;
+    this.WindDelta = 0;
+    this.WindCnt = 0;
+    this.WindCnt2 = 0;
+    this.OutIdx = 0;
+    this.Next = null;
+    this.Prev = null;
+    this.NextInLML = null;
+    this.NextInAEL = null;
+    this.PrevInAEL = null;
+    this.NextInSEL = null;
+    this.PrevInSEL = null;
+  };
+  ClipperLib.IntersectNode = function ()
+  {
+    this.Edge1 = null;
+    this.Edge2 = null;
+    this.Pt = new ClipperLib.IntPoint();
+  };
+  ClipperLib.MyIntersectNodeSort = function () {};
+  ClipperLib.MyIntersectNodeSort.Compare = function (node1, node2)
+  {
+    var i = node2.Pt.Y - node1.Pt.Y;
+    if (i > 0) return 1;
+    else if (i < 0) return -1;
+    else return 0;
+  };
 
-    function fuzzyCompare(p1, p2) {
-        return Math.abs(p1 - p2) <= (0.000000000001 * Math.min(Math.abs(p1), Math.abs(p2)));
+  ClipperLib.LocalMinima = function ()
+  {
+    this.Y = 0;
+    this.LeftBound = null;
+    this.RightBound = null;
+    this.Next = null;
+  };
+  ClipperLib.Scanbeam = function ()
+  {
+    this.Y = 0;
+    this.Next = null;
+  };
+  ClipperLib.OutRec = function ()
+  {
+    this.Idx = 0;
+    this.IsHole = false;
+    this.IsOpen = false;
+    this.FirstLeft = null;
+    this.Pts = null;
+    this.BottomPt = null;
+    this.PolyNode = null;
+  };
+  ClipperLib.OutPt = function ()
+  {
+    this.Idx = 0;
+    this.Pt = new ClipperLib.IntPoint();
+    this.Next = null;
+    this.Prev = null;
+  };
+  ClipperLib.Join = function ()
+  {
+    this.OutPt1 = null;
+    this.OutPt2 = null;
+    this.OffPt = new ClipperLib.IntPoint();
+  };
+  ClipperLib.ClipperBase = function ()
+  {
+    this.m_MinimaList = null;
+    this.m_CurrentLM = null;
+    this.m_edges = new Array();
+    this.m_UseFullRange = false;
+    this.m_HasOpenPaths = false;
+    this.PreserveCollinear = false;
+    this.m_MinimaList = null;
+    this.m_CurrentLM = null;
+    this.m_UseFullRange = false;
+    this.m_HasOpenPaths = false;
+  };
+  // Ranges are in original C# too high for Javascript (in current state 2013 september):
+  // protected const double horizontal = -3.4E+38;
+  // internal const cInt loRange = 0x3FFFFFFF; // = 1073741823 = sqrt(2^63 -1)/2
+  // internal const cInt hiRange = 0x3FFFFFFFFFFFFFFFL; // = 4611686018427387903 = sqrt(2^127 -1)/2
+  // So had to adjust them to more suitable for Javascript.
+  // If JS some day supports truly 64-bit integers, then these ranges can be as in C#
+  // and biginteger library can be more simpler (as then 128bit can be represented as two 64bit numbers)
+  ClipperLib.ClipperBase.horizontal = -9007199254740992; //-2^53
+  ClipperLib.ClipperBase.Skip = -2;
+  ClipperLib.ClipperBase.Unassigned = -1;
+  ClipperLib.ClipperBase.tolerance = 1E-20;
+	ClipperLib.ClipperBase.loRange = 47453132; // sqrt(2^53 -1)/2
+	ClipperLib.ClipperBase.hiRange = 4503599627370495; // sqrt(2^106 -1)/2
+
+  ClipperLib.ClipperBase.near_zero = function (val)
+  {
+    return (val > -ClipperLib.ClipperBase.tolerance) && (val < ClipperLib.ClipperBase.tolerance);
+  };
+  ClipperLib.ClipperBase.IsHorizontal = function (e)
+  {
+    return e.Delta.Y === 0;
+  };
+  ClipperLib.ClipperBase.prototype.PointIsVertex = function (pt, pp)
+  {
+    var pp2 = pp;
+    do {
+      if (ClipperLib.IntPoint.op_Equality(pp2.Pt, pt))
+        return true;
+      pp2 = pp2.Next;
     }
-
-    function coefficients(t) {
-        var mT, a, b, c, d;
-        mT = 1 - t;
-        b = mT * mT;
-        c = t * t;
-        d = c * t;
-        a = b * mT;
-        b *= (3.0 * t);
-        c *= (3.0 * mT);
-        return [a, b, c, d];
+    while (pp2 != pp)
+    return false;
+  };
+  ClipperLib.ClipperBase.prototype.PointOnLineSegment = function (pt, linePt1, linePt2, UseFullRange)
+  {
+    if (UseFullRange)
+      return ((pt.X == linePt1.X) && (pt.Y == linePt1.Y)) ||
+        ((pt.X == linePt2.X) && (pt.Y == linePt2.Y)) ||
+        (((pt.X > linePt1.X) == (pt.X < linePt2.X)) &&
+        ((pt.Y > linePt1.Y) == (pt.Y < linePt2.Y)) &&
+        (Int128.op_Equality(Int128.Int128Mul((pt.X - linePt1.X), (linePt2.Y - linePt1.Y)),
+          Int128.Int128Mul((linePt2.X - linePt1.X), (pt.Y - linePt1.Y)))));
+    else
+      return ((pt.X == linePt1.X) && (pt.Y == linePt1.Y)) || ((pt.X == linePt2.X) && (pt.Y == linePt2.Y)) || (((pt.X > linePt1.X) == (pt.X < linePt2.X)) && ((pt.Y > linePt1.Y) == (pt.Y < linePt2.Y)) && ((pt.X - linePt1.X) * (linePt2.Y - linePt1.Y) == (linePt2.X - linePt1.X) * (pt.Y - linePt1.Y)));
+  };
+  ClipperLib.ClipperBase.prototype.PointOnPolygon = function (pt, pp, UseFullRange)
+  {
+    var pp2 = pp;
+    while (true)
+    {
+      if (this.PointOnLineSegment(pt, pp2.Pt, pp2.Next.Pt, UseFullRange))
+        return true;
+      pp2 = pp2.Next;
+      if (pp2 == pp)
+        break;
     }
-
-    function pointAt(t) {
-        var a, b, c, d, coeff;
-        coeff = coefficients(t);
-        a = coeff[0];
-        b = coeff[1];
-        c = coeff[2];
-        d = coeff[3];
-        return {x: a * x1 + b * x2 + c * x3 + d * x4,
-                y: a * y1 + b * y2 + c * y3 + d * y4};
+    return false;
+  };
+  ClipperLib.ClipperBase.prototype.SlopesEqual = ClipperLib.ClipperBase.SlopesEqual = function ()
+  {
+    var a = arguments,
+      alen = a.length;
+    var e1, e2, pt1, pt2, pt3, pt4, UseFullRange;
+    if (alen == 3) // function (e1, e2, UseFullRange)
+    {
+      e1 = a[0];
+      e2 = a[1];
+      UseFullRange = a[2];
+      if (UseFullRange)
+        return Int128.op_Equality(Int128.Int128Mul(e1.Delta.Y, e2.Delta.X), Int128.Int128Mul(e1.Delta.X, e2.Delta.Y));
+      else
+        return ClipperLib.Cast_Int64((e1.Delta.Y) * (e2.Delta.X)) == ClipperLib.Cast_Int64((e1.Delta.X) * (e2.Delta.Y));
     }
-
-    function bezierCheck(t) {
-        if (t >= 0 && t <= 1) {
-            var p = pointAt(t);
-            if (p.x < minX) {
-                minX = p.x;
-            } else if (p.x > maxX) {
-                maxX = p.x;
-            }
-            if (p.y < minY) {
-                minY = p.y;
-            } else if (p.y > maxY) {
-                maxY = p.y;
-            }
-        }
+    else if (alen == 4) // function (pt1, pt2, pt3, UseFullRange)
+    {
+      pt1 = a[0];
+      pt2 = a[1];
+      pt3 = a[2];
+      UseFullRange = a[3];
+      if (UseFullRange)
+        return Int128.op_Equality(Int128.Int128Mul(pt1.Y - pt2.Y, pt2.X - pt3.X), Int128.Int128Mul(pt1.X - pt2.X, pt2.Y - pt3.Y));
+      else
+        return ClipperLib.Cast_Int64((pt1.Y - pt2.Y) * (pt2.X - pt3.X)) - ClipperLib.Cast_Int64((pt1.X - pt2.X) * (pt2.Y - pt3.Y)) === 0;
+    }
+    else // function (pt1, pt2, pt3, pt4, UseFullRange)
+    {
+      pt1 = a[0];
+      pt2 = a[1];
+      pt3 = a[2];
+      pt4 = a[3];
+      UseFullRange = a[4];
+      if (UseFullRange)
+        return Int128.op_Equality(Int128.Int128Mul(pt1.Y - pt2.Y, pt3.X - pt4.X), Int128.Int128Mul(pt1.X - pt2.X, pt3.Y - pt4.Y));
+      else
+        return ClipperLib.Cast_Int64((pt1.Y - pt2.Y) * (pt3.X - pt4.X)) - ClipperLib.Cast_Int64((pt1.X - pt2.X) * (pt3.Y - pt4.Y)) === 0;
+    }
+  };
+  ClipperLib.ClipperBase.SlopesEqual3 = function (e1, e2, UseFullRange)
+  {
+    if (UseFullRange)
+      return Int128.op_Equality(Int128.Int128Mul(e1.Delta.Y, e2.Delta.X), Int128.Int128Mul(e1.Delta.X, e2.Delta.Y));
+    else
+      return ClipperLib.Cast_Int64((e1.Delta.Y) * (e2.Delta.X)) == ClipperLib.Cast_Int64((e1.Delta.X) * (e2.Delta.Y));
+  };
+  ClipperLib.ClipperBase.SlopesEqual4 = function (pt1, pt2, pt3, UseFullRange)
+  {
+    if (UseFullRange)
+      return Int128.op_Equality(Int128.Int128Mul(pt1.Y - pt2.Y, pt2.X - pt3.X), Int128.Int128Mul(pt1.X - pt2.X, pt2.Y - pt3.Y));
+    else
+      return ClipperLib.Cast_Int64((pt1.Y - pt2.Y) * (pt2.X - pt3.X)) - ClipperLib.Cast_Int64((pt1.X - pt2.X) * (pt2.Y - pt3.Y)) === 0;
+  };
+  ClipperLib.ClipperBase.SlopesEqual5 = function (pt1, pt2, pt3, pt4, UseFullRange)
+  {
+    if (UseFullRange)
+      return Int128.op_Equality(Int128.Int128Mul(pt1.Y - pt2.Y, pt3.X - pt4.X), Int128.Int128Mul(pt1.X - pt2.X, pt3.Y - pt4.Y));
+    else
+      return ClipperLib.Cast_Int64((pt1.Y - pt2.Y) * (pt3.X - pt4.X)) - ClipperLib.Cast_Int64((pt1.X - pt2.X) * (pt3.Y - pt4.Y)) === 0;
+  };
+  ClipperLib.ClipperBase.prototype.Clear = function ()
+  {
+    this.DisposeLocalMinimaList();
+    for (var i = 0, ilen = this.m_edges.length; i < ilen; ++i)
+    {
+      for (var j = 0, jlen = this.m_edges[i].length; j < jlen; ++j)
+        this.m_edges[i][j] = null;
+      ClipperLib.Clear(this.m_edges[i]);
     }
-
-    if (x1 < x4) {
-        minX = x1;
-        maxX = x4;
-    } else {
-        minX = x4;
-        maxX = x1;
+    ClipperLib.Clear(this.m_edges);
+    this.m_UseFullRange = false;
+    this.m_HasOpenPaths = false;
+  };
+  ClipperLib.ClipperBase.prototype.DisposeLocalMinimaList = function ()
+  {
+    while (this.m_MinimaList !== null)
+    {
+      var tmpLm = this.m_MinimaList.Next;
+      this.m_MinimaList = null;
+      this.m_MinimaList = tmpLm;
     }
-    if (y1 < y4) {
-        minY = y1;
-        maxY = y4;
-    } else {
-        minY = y4;
-        maxY = y1;
+    this.m_CurrentLM = null;
+  };
+  ClipperLib.ClipperBase.prototype.RangeTest = function (Pt, useFullRange)
+  {
+    if (useFullRange.Value)
+    {
+      if (Pt.X > ClipperLib.ClipperBase.hiRange || Pt.Y > ClipperLib.ClipperBase.hiRange || -Pt.X > ClipperLib.ClipperBase.hiRange || -Pt.Y > ClipperLib.ClipperBase.hiRange)
+        ClipperLib.Error("Coordinate outside allowed range in RangeTest().");
     }
+    else if (Pt.X > ClipperLib.ClipperBase.loRange || Pt.Y > ClipperLib.ClipperBase.loRange || -Pt.X > ClipperLib.ClipperBase.loRange || -Pt.Y > ClipperLib.ClipperBase.loRange)
+    {
+      useFullRange.Value = true;
+      this.RangeTest(Pt, useFullRange);
+    }
+  };
+  ClipperLib.ClipperBase.prototype.InitEdge = function (e, eNext, ePrev, pt)
+  {
+    e.Next = eNext;
+    e.Prev = ePrev;
+    //e.Curr = pt;
+    e.Curr.X = pt.X;
+    e.Curr.Y = pt.Y;
+    if(ClipperLib.use_xyz) e.Curr.Z = pt.Z;
+    e.OutIdx = -1;
+  };
+  ClipperLib.ClipperBase.prototype.InitEdge2 = function (e, polyType)
+  {
+    if (e.Curr.Y >= e.Next.Curr.Y)
+    {
+      //e.Bot = e.Curr;
+      e.Bot.X = e.Curr.X;
+      e.Bot.Y = e.Curr.Y;
+    	if(ClipperLib.use_xyz) e.Bot.Z = e.Curr.Z;
+      //e.Top = e.Next.Curr;
+      e.Top.X = e.Next.Curr.X;
+      e.Top.Y = e.Next.Curr.Y;
+      if(ClipperLib.use_xyz) e.Top.Z = e.Next.Curr.Z;
+    }
+    else
+    {
+      //e.Top = e.Curr;
+      e.Top.X = e.Curr.X;
+      e.Top.Y = e.Curr.Y;
+    	if(ClipperLib.use_xyz) e.Top.Z = e.Curr.Z;
+      //e.Bot = e.Next.Curr;
+      e.Bot.X = e.Next.Curr.X;
+      e.Bot.Y = e.Next.Curr.Y;
+    	if(ClipperLib.use_xyz) e.Bot.Z = e.Next.Curr.Z;
+    }
+    this.SetDx(e);
+    e.PolyTyp = polyType;
+  };
+  ClipperLib.ClipperBase.prototype.FindNextLocMin = function (E)
+  {
+    var E2;
+    for (;;)
+    {
+      while (ClipperLib.IntPoint.op_Inequality(E.Bot, E.Prev.Bot) || ClipperLib.IntPoint.op_Equality(E.Curr, E.Top))
+        E = E.Next;
+      if (E.Dx != ClipperLib.ClipperBase.horizontal && E.Prev.Dx != ClipperLib.ClipperBase.horizontal)
+        break;
+      while (E.Prev.Dx == ClipperLib.ClipperBase.horizontal)
+        E = E.Prev;
+      E2 = E;
+      while (E.Dx == ClipperLib.ClipperBase.horizontal)
+        E = E.Next;
+      if (E.Top.Y == E.Prev.Bot.Y)
+        continue;
+      //ie just an intermediate horz.
+      if (E2.Prev.Bot.X < E.Bot.X)
+        E = E2;
+      break;
+    }
+    return E;
+  };
+  ClipperLib.ClipperBase.prototype.ProcessBound = function (E, LeftBoundIsForward)
+  {
+    var EStart;
+    var Result = E;
+    var Horz;
 
-    ax = 3 * (-x1 + 3 * x2 - 3 * x3 + x4);
-    bx = 6 * (x1 - 2 * x2 + x3);
-    cx = 3 * (-x1 + x2);
-
-    if (fuzzyCompare(ax + 1, 1)) {
-        if (!fuzzyCompare(bx + 1, 1)) {
-            bezierCheck(-cx / bx);
+      if (Result.OutIdx == ClipperLib.ClipperBase.Skip)
+      {
+        //check if there are edges beyond the skip edge in the bound and if so
+        //create another LocMin and calling ProcessBound once more ...
+        E = Result;
+        if (LeftBoundIsForward)
+        {
+          while (E.Top.Y == E.Next.Bot.Y) E = E.Next;
+          while (E != Result && E.Dx == ClipperLib.ClipperBase.horizontal) E = E.Prev;
         }
-    } else {
-        tx = bx * bx - 4 * ax * cx;
-        if (tx >= 0) {
-            temp = Math.sqrt(tx);
-            rcp = 1 / (2 * ax);
-            bezierCheck((-bx + temp) * rcp);
-            bezierCheck((-bx - temp) * rcp);
+        else
+        {
+          while (E.Top.Y == E.Prev.Bot.Y) E = E.Prev;
+          while (E != Result && E.Dx == ClipperLib.ClipperBase.horizontal) E = E.Next;
         }
-    }
-
-    ay = 3 * (-y1 + 3 * y2 - 3 * y3 + y4);
-    by = 6 * (y1 - 2 * y2 + y3);
-    cy = 3 * (-y1 + y2);
-
-    if (fuzzyCompare(ay + 1, 1)) {
-        if (!fuzzyCompare(by + 1, 1)) {
-            bezierCheck(-cy / by);
+        if (E == Result)
+        {
+          if (LeftBoundIsForward) Result = E.Next;
+          else Result = E.Prev;
         }
-    } else {
-        ty = by * by - 4 * ay * cy;
-        if (ty > 0) {
-            temp = Math.sqrt(ty);
-            rcp = 1 / (2 * ay);
-            bezierCheck((-by + temp) * rcp);
-            bezierCheck((-by - temp) * rcp);
+        else
+        {
+          //there are more edges in the bound beyond result starting with E
+          if (LeftBoundIsForward)
+            E = Result.Next;
+          else
+            E = Result.Prev;
+          var locMin = new ClipperLib.LocalMinima();
+          locMin.Next = null;
+          locMin.Y = E.Bot.Y;
+          locMin.LeftBound = null;
+          locMin.RightBound = E;
+          E.WindDelta = 0;
+          Result = this.ProcessBound(E, LeftBoundIsForward);
+          this.InsertLocalMinima(locMin);
         }
-    }
-
-    return new Rect(minX, minY, maxX - minX, maxY - minY);
-};
-
-module.exports = bezier;
-
-},{"../objects/point":32,"../objects/rect":33,"../util/math":42,"lodash":3}],39:[function(require,module,exports){
-// Color conversion functions
-
-'use strict';
+        return Result;
+      }
 
-var color = {};
+      if (E.Dx == ClipperLib.ClipperBase.horizontal)
+      {
+        //We need to be careful with open paths because this may not be a
+        //true local minima (ie E may be following a skip edge).
+        //Also, consecutive horz. edges may start heading left before going right.
+        if (LeftBoundIsForward) EStart = E.Prev;
+        else EStart = E.Next;
+        if (EStart.OutIdx != ClipperLib.ClipperBase.Skip)
+        {
+          if (EStart.Dx == ClipperLib.ClipperBase.horizontal) //ie an adjoining horizontal skip edge
+          {
+            if (EStart.Bot.X != E.Bot.X && EStart.Top.X != E.Bot.X)
+              this.ReverseHorizontal(E);
+          }
+          else if (EStart.Bot.X != E.Bot.X)
+            this.ReverseHorizontal(E);
+        }
+      }
 
-color.namedColors = {
-    'lightpink'            : [1.00, 0.71, 0.76],
-    'pink'                 : [1.00, 0.75, 0.80],
-    'crimson'              : [0.86, 0.08, 0.24],
-    'lavenderblush'        : [1.00, 0.94, 0.96],
-    'palevioletred'        : [0.86, 0.44, 0.58],
-    'hotpink'              : [1.00, 0.41, 0.71],
-    'deeppink'             : [1.00, 0.08, 0.58],
-    'mediumvioletred'      : [0.78, 0.08, 0.52],
-    'orchid'               : [0.85, 0.44, 0.84],
-    'thistle'              : [0.85, 0.75, 0.85],
-    'plum'                 : [0.87, 0.63, 0.87],
-    'violet'               : [0.93, 0.51, 0.93],
-    'fuchsia'              : [1.00, 0.00, 1.00],
-    'darkmagenta'          : [0.55, 0.00, 0.55],
-    'purple'               : [0.50, 0.00, 0.50],
-    'mediumorchid'         : [0.73, 0.33, 0.83],
-    'darkviolet'           : [0.58, 0.00, 0.83],
-    'darkorchid'           : [0.60, 0.20, 0.80],
-    'indigo'               : [0.29, 0.00, 0.51],
-    'blueviolet'           : [0.54, 0.17, 0.89],
-    'mediumpurple'         : [0.58, 0.44, 0.86],
-    'mediumslateblue'      : [0.48, 0.41, 0.93],
-    'slateblue'            : [0.42, 0.35, 0.80],
-    'darkslateblue'        : [0.28, 0.24, 0.55],
-    'ghostwhite'           : [0.97, 0.97, 1.00],
-    'lavender'             : [0.90, 0.90, 0.98],
-    'blue'                 : [0.00, 0.00, 1.00],
-    'mediumblue'           : [0.00, 0.00, 0.80],
-    'darkblue'             : [0.00, 0.00, 0.55],
-    'navy'                 : [0.00, 0.00, 0.50],
-    'midnightblue'         : [0.10, 0.10, 0.44],
-    'royalblue'            : [0.25, 0.41, 0.88],
-    'cornflowerblue'       : [0.39, 0.58, 0.93],
-    'lightsteelblue'       : [0.69, 0.77, 0.87],
-    'lightslategray'       : [0.47, 0.53, 0.60],
-    'slategray'            : [0.44, 0.50, 0.56],
-    'dodgerblue'           : [0.12, 0.56, 1.00],
-    'aliceblue'            : [0.94, 0.97, 1.00],
-    'steelblue'            : [0.27, 0.51, 0.71],
-    'lightskyblue'         : [0.53, 0.81, 0.98],
-    'skyblue'              : [0.53, 0.81, 0.92],
-    'deepskyblue'          : [0.00, 0.75, 1.00],
-    'lightblue'            : [0.68, 0.85, 0.90],
-    'powderblue'           : [0.69, 0.88, 0.90],
-    'cadetblue'            : [0.37, 0.62, 0.63],
-    'darkturquoise'        : [0.00, 0.81, 0.82],
-    'azure'                : [0.94, 1.00, 1.00],
-    'lightcyan'            : [0.88, 1.00, 1.00],
-    'paleturquoise'        : [0.69, 0.93, 0.93],
-    'aqua'                 : [0.00, 1.00, 1.00],
-    'darkcyan'             : [0.00, 0.55, 0.55],
-    'teal'                 : [0.00, 0.50, 0.50],
-    'darkslategray'        : [0.18, 0.31, 0.31],
-    'mediumturquoise'      : [0.28, 0.82, 0.80],
-    'lightseagreen'        : [0.13, 0.70, 0.67],
-    'turquoise'            : [0.25, 0.88, 0.82],
-    'aquamarine'           : [0.50, 1.00, 0.83],
-    'mediumaquamarine'     : [0.40, 0.80, 0.67],
-    'mediumspringgreen'    : [0.00, 0.98, 0.60],
-    'mintcream'            : [0.96, 1.00, 0.98],
-    'springgreen'          : [0.00, 1.00, 0.50],
-    'mediumseagreen'       : [0.24, 0.70, 0.44],
-    'seagreen'             : [0.18, 0.55, 0.34],
-    'honeydew'             : [0.94, 1.00, 0.94],
-    'darkseagreen'         : [0.56, 0.74, 0.56],
-    'palegreen'            : [0.60, 0.98, 0.60],
-    'lightgreen'           : [0.56, 0.93, 0.56],
-    'limegreen'            : [0.20, 0.80, 0.20],
-    'lime'                 : [0.00, 1.00, 0.00],
-    'forestgreen'          : [0.13, 0.55, 0.13],
-    'green'                : [0.00, 0.50, 0.00],
-    'darkgreen'            : [0.00, 0.39, 0.00],
-    'lawngreen'            : [0.49, 0.99, 0.00],
-    'chartreuse'           : [0.50, 1.00, 0.00],
-    'greenyellow'          : [0.68, 1.00, 0.18],
-    'darkolivegreen'       : [0.33, 0.42, 0.18],
-    'yellowgreen'          : [0.60, 0.80, 0.20],
-    'olivedrab'            : [0.42, 0.56, 0.14],
-    'ivory'                : [1.00, 1.00, 0.94],
-    'beige'                : [0.96, 0.96, 0.86],
-    'lightyellow'          : [1.00, 1.00, 0.88],
-    'lightgoldenrodyellow' : [0.98, 0.98, 0.82],
-    'yellow'               : [1.00, 1.00, 0.00],
-    'olive'                : [0.50, 0.50, 0.00],
-    'darkkhaki'            : [0.74, 0.72, 0.42],
-    'palegoldenrod'        : [0.93, 0.91, 0.67],
-    'lemonchiffon'         : [1.00, 0.98, 0.80],
-    'khaki'                : [0.94, 0.90, 0.55],
-    'gold'                 : [1.00, 0.84, 0.00],
-    'cornsilk'             : [1.00, 0.97, 0.86],
-    'goldenrod'            : [0.85, 0.65, 0.13],
-    'darkgoldenrod'        : [0.72, 0.53, 0.04],
-    'floralwhite'          : [1.00, 0.98, 0.94],
-    'oldlace'              : [0.99, 0.96, 0.90],
-    'wheat'                : [0.96, 0.87, 0.07],
-    'orange'               : [1.00, 0.65, 0.00],
-    'moccasin'             : [1.00, 0.89, 0.71],
-    'papayawhip'           : [1.00, 0.94, 0.84],
-    'blanchedalmond'       : [1.00, 0.92, 0.80],
-    'navajowhite'          : [1.00, 0.87, 0.68],
-    'antiquewhite'         : [0.98, 0.92, 0.84],
-    'tan'                  : [0.82, 0.71, 0.55],
-    'burlywood'            : [0.87, 0.72, 0.53],
-    'darkorange'           : [1.00, 0.55, 0.00],
-    'bisque'               : [1.00, 0.89, 0.77],
-    'linen'                : [0.98, 0.94, 0.90],
-    'peru'                 : [0.80, 0.52, 0.25],
-    'peachpuff'            : [1.00, 0.85, 0.73],
-    'sandybrown'           : [0.96, 0.64, 0.38],
-    'chocolate'            : [0.82, 0.41, 0.12],
-    'saddlebrown'          : [0.55, 0.27, 0.07],
-    'seashell'             : [1.00, 0.96, 0.93],
-    'sienna'               : [0.63, 0.32, 0.18],
-    'lightsalmon'          : [1.00, 0.63, 0.48],
-    'coral'                : [1.00, 0.50, 0.31],
-    'orangered'            : [1.00, 0.27, 0.00],
-    'darksalmon'           : [0.91, 0.59, 0.48],
-    'tomato'               : [1.00, 0.39, 0.28],
-    'salmon'               : [0.98, 0.50, 0.45],
-    'mistyrose'            : [1.00, 0.89, 0.88],
-    'lightcoral'           : [0.94, 0.50, 0.50],
-    'snow'                 : [1.00, 0.98, 0.98],
-    'rosybrown'            : [0.74, 0.56, 0.56],
-    'indianred'            : [0.80, 0.36, 0.36],
-    'red'                  : [1.00, 0.00, 0.00],
-    'brown'                : [0.65, 0.16, 0.16],
-    'firebrick'            : [0.70, 0.13, 0.13],
-    'darkred'              : [0.55, 0.00, 0.00],
-    'maroon'               : [0.50, 0.00, 0.00],
-    'white'                : [1.00, 1.00, 1.00],
-    'whitesmoke'           : [0.96, 0.96, 0.96],
-    'gainsboro'            : [0.86, 0.86, 0.86],
-    'lightgrey'            : [0.83, 0.83, 0.83],
-    'silver'               : [0.75, 0.75, 0.75],
-    'darkgray'             : [0.66, 0.66, 0.66],
-    'gray'                 : [0.50, 0.50, 0.50],
-    'grey'                 : [0.50, 0.50, 0.50],
-    'dimgray'              : [0.41, 0.41, 0.41],
-    'dimgrey'              : [0.41, 0.41, 0.41],
-    'black'                : [0.00, 0.00, 0.00],
-    'cyan'                 : [0.00, 0.68, 0.94],
+      EStart = E;
+      if (LeftBoundIsForward)
+      {
+        while (Result.Top.Y == Result.Next.Bot.Y && Result.Next.OutIdx != ClipperLib.ClipperBase.Skip)
+          Result = Result.Next;
+        if (Result.Dx == ClipperLib.ClipperBase.horizontal && Result.Next.OutIdx != ClipperLib.ClipperBase.Skip)
+        {
+          //nb: at the top of a bound, horizontals are added to the bound
+          //only when the preceding edge attaches to the horizontal's left vertex
+          //unless a Skip edge is encountered when that becomes the top divide
+          Horz = Result;
+          while (Horz.Prev.Dx == ClipperLib.ClipperBase.horizontal)
+            Horz = Horz.Prev;
+          if (Horz.Prev.Top.X == Result.Next.Top.X)
+          {
+            if (!LeftBoundIsForward)
+              Result = Horz.Prev;
+          }
+          else if (Horz.Prev.Top.X > Result.Next.Top.X)
+            Result = Horz.Prev;
+        }
+        while (E != Result)
+        {
+          E.NextInLML = E.Next;
+          if (E.Dx == ClipperLib.ClipperBase.horizontal && E != EStart && E.Bot.X != E.Prev.Top.X)
+            this.ReverseHorizontal(E);
+          E = E.Next;
+        }
+        if (E.Dx == ClipperLib.ClipperBase.horizontal && E != EStart && E.Bot.X != E.Prev.Top.X)
+          this.ReverseHorizontal(E);
+        Result = Result.Next;
+        //move to the edge just beyond current bound
+      }
+      else
+      {
+        while (Result.Top.Y == Result.Prev.Bot.Y && Result.Prev.OutIdx != ClipperLib.ClipperBase.Skip)
+          Result = Result.Prev;
+        if (Result.Dx == ClipperLib.ClipperBase.horizontal && Result.Prev.OutIdx != ClipperLib.ClipperBase.Skip)
+        {
+          Horz = Result;
+          while (Horz.Next.Dx == ClipperLib.ClipperBase.horizontal)
+            Horz = Horz.Next;
+          if (Horz.Next.Top.X == Result.Prev.Top.X)
+          {
+            if (!LeftBoundIsForward)
+              Result = Horz.Next;
+          }
+          else if (Horz.Next.Top.X > Result.Prev.Top.X)
+            Result = Horz.Next;
+        }
+        while (E != Result)
+        {
+          E.NextInLML = E.Prev;
+          if (E.Dx == ClipperLib.ClipperBase.horizontal && E != EStart && E.Bot.X != E.Next.Top.X)
+            this.ReverseHorizontal(E);
+          E = E.Prev;
+        }
+        if (E.Dx == ClipperLib.ClipperBase.horizontal && E != EStart && E.Bot.X != E.Next.Top.X)
+          this.ReverseHorizontal(E);
+        Result = Result.Prev;
+        //move to the edge just beyond current bound
+      }
 
-    'transparent'          : [0.00, 0.00, 0.00, 0.00],
-    'bark'                 : [0.25, 0.19, 0.13]
-};
+    return Result;
+  };
 
-function toHex(i) {
-    var s;
-    if (i === 0) {
-        return '00';
-    } else {
-        s = i.toString(16).toUpperCase();
-        if (s.length < 2) {
-            s = '0' + s;
-        }
-        return s;
+  ClipperLib.ClipperBase.prototype.AddPath = function (pg, polyType, Closed)
+  {
+    if (ClipperLib.use_lines)
+    {
+      if (!Closed && polyType == ClipperLib.PolyType.ptClip)
+        ClipperLib.Error("AddPath: Open paths must be subject.");
     }
-}
+    else
+    {
+      if (!Closed)
+        ClipperLib.Error("AddPath: Open paths have been disabled.");
+    }
+    var highI = pg.length - 1;
+    if (Closed)
+      while (highI > 0 && (ClipperLib.IntPoint.op_Equality(pg[highI], pg[0])))
+    --highI;
+    while (highI > 0 && (ClipperLib.IntPoint.op_Equality(pg[highI], pg[highI - 1])))
+    --highI;
+    if ((Closed && highI < 2) || (!Closed && highI < 1))
+      return false;
+    //create a new edge array ...
+    var edges = new Array();
+    for (var i = 0; i <= highI; i++)
+      edges.push(new ClipperLib.TEdge());
+    var IsFlat = true;
+    //1. Basic (first) edge initialization ...
+
+    //edges[1].Curr = pg[1];
+    edges[1].Curr.X = pg[1].X;
+    edges[1].Curr.Y = pg[1].Y;
+    if(ClipperLib.use_xyz) edges[1].Curr.Z = pg[1].Z;
+
+    var $1 = {Value: this.m_UseFullRange};
+    this.RangeTest(pg[0], $1);
+    this.m_UseFullRange = $1.Value;
 
-// Converts the given R,G,B values to a hexadecimal color string.
-color.rgb2hex = function (r, g, b) {
-    return '#' +
-        toHex(Math.round(r * 255)) +
-        toHex(Math.round(g * 255)) +
-        toHex(Math.round(b * 255));
-};
+    $1.Value = this.m_UseFullRange;
+    this.RangeTest(pg[highI], $1);
+    this.m_UseFullRange = $1.Value;
 
-// Converts the given R,G,B,A values to a hexadecimal color string.
-color.rgba2hex = function (r, g, b, a) {
-    return '#' +
-        toHex(Math.round(r * 255)) +
-        toHex(Math.round(g * 255)) +
-        toHex(Math.round(b * 255)) +
-        toHex(Math.round(a * 255));
-};
+    this.InitEdge(edges[0], edges[1], edges[highI], pg[0]);
+    this.InitEdge(edges[highI], edges[0], edges[highI - 1], pg[highI]);
+    for (var i = highI - 1; i >= 1; --i)
+    {
+      $1.Value = this.m_UseFullRange;
+      this.RangeTest(pg[i], $1);
+      this.m_UseFullRange = $1.Value;
 
-// Converts the given hexadecimal color string to R,G,B (between 0.0-1.0).
-color.hex2rgb = function (hex) {
-    var r, g, b;
-    hex = hex.replace(/^#/, '');
-    if ((hex.length !== 3 && hex.length !== 6) || !(/^[0-9a-fA-F]*$/.test(hex))) {
-        throw new Error('Invalid hex value: #' + hex);
-    }
-    if (hex.length === 3) {
-        hex = hex[0] + hex[0] + hex[1] + hex[1] + hex[2] + hex[2];
+      this.InitEdge(edges[i], edges[i + 1], edges[i - 1], pg[i]);
     }
-    r = parseInt(hex.substr(0, 2), 16) / 255;
-    g = parseInt(hex.substr(2, 2), 16) / 255;
-    b = parseInt(hex.substr(4, 2), 16) / 255;
-    return [r, g, b];
-};
 
-// Converts the given R,G,B values to H,S,B (between 0.0-1.0).
-color.rgb2hsb = function (r, g, b) {
-    var h = 0,
-        s = 0,
-        v = Math.max(r, g, b),
-        d = v - Math.min(r, g, b);
-    if (v !== 0) {
-        s = d / v;
+    var eStart = edges[0];
+    //2. Remove duplicate vertices, and (when closed) collinear edges ...
+    var E = eStart,
+      eLoopStop = eStart;
+    for (;;)
+    {
+    //console.log(E.Next, eStart);
+    	//nb: allows matching start and end points when not Closed ...
+      if (E.Curr == E.Next.Curr && (Closed || E.Next != eStart))
+      {
+        if (E == E.Next)
+          break;
+        if (E == eStart)
+          eStart = E.Next;
+        E = this.RemoveEdge(E);
+        eLoopStop = E;
+        continue;
+      }
+      if (E.Prev == E.Next)
+        break;
+      else if (Closed && ClipperLib.ClipperBase.SlopesEqual(E.Prev.Curr, E.Curr, E.Next.Curr, this.m_UseFullRange) && (!this.PreserveCollinear || !this.Pt2IsBetweenPt1AndPt3(E.Prev.Curr, E.Curr, E.Next.Curr)))
+      {
+        //Collinear edges are allowed for open paths but in closed paths
+        //the default is to merge adjacent collinear edges into a single edge.
+        //However, if the PreserveCollinear property is enabled, only overlapping
+        //collinear edges (ie spikes) will be removed from closed paths.
+        if (E == eStart)
+          eStart = E.Next;
+        E = this.RemoveEdge(E);
+        E = E.Prev;
+        eLoopStop = E;
+        continue;
+      }
+      E = E.Next;
+      if ((E == eLoopStop) || (!Closed && E.Next == eStart)) break;
     }
-    if (s !== 0) {
-        if (r === v) {
-            h = 0 + (g - b) / d;
-        } else if (g === v) {
-            h = 2 + (b - r) / d;
-        } else {
-            h = 4 + (r - g) / d;
-        }
+    if ((!Closed && (E == E.Next)) || (Closed && (E.Prev == E.Next)))
+      return false;
+    if (!Closed)
+    {
+      this.m_HasOpenPaths = true;
+      eStart.Prev.OutIdx = ClipperLib.ClipperBase.Skip;
     }
-    h = h * (60 / 360);
-    if (h < 0) {
-        h += 1.0;
+    //3. Do second stage of edge initialization ...
+    E = eStart;
+    do {
+      this.InitEdge2(E, polyType);
+      E = E.Next;
+      if (IsFlat && E.Curr.Y != eStart.Curr.Y)
+        IsFlat = false;
+    }
+    while (E != eStart)
+    //4. Finally, add edge bounds to LocalMinima list ...
+    //Totally flat paths must be handled differently when adding them
+    //to LocalMinima list to avoid endless loops etc ...
+    if (IsFlat)
+    {
+      if (Closed)
+        return false;
+      E.Prev.OutIdx = ClipperLib.ClipperBase.Skip;
+      if (E.Prev.Bot.X < E.Prev.Top.X)
+        this.ReverseHorizontal(E.Prev);
+      var locMin = new ClipperLib.LocalMinima();
+      locMin.Next = null;
+      locMin.Y = E.Bot.Y;
+      locMin.LeftBound = null;
+      locMin.RightBound = E;
+      locMin.RightBound.Side = ClipperLib.EdgeSide.esRight;
+      locMin.RightBound.WindDelta = 0;
+      while (E.Next.OutIdx != ClipperLib.ClipperBase.Skip)
+      {
+        E.NextInLML = E.Next;
+        if (E.Bot.X != E.Prev.Top.X)
+          this.ReverseHorizontal(E);
+        E = E.Next;
+      }
+      this.InsertLocalMinima(locMin);
+      this.m_edges.push(edges);
+      return true;
     }
-    return [h, s, v];
-};
+    this.m_edges.push(edges);
+    var leftBoundIsForward;
+    var EMin = null;
 
-// Converts the given H,S,B color values to R,G,B (between 0.0-1.0).
-color.hsb2rgb = function (h, s, v) {
-    if (s === 0) {
-        return [v, v, v];
+		//workaround to avoid an endless loop in the while loop below when
+    //open paths have matching start and end points ...
+    if(ClipperLib.IntPoint.op_Equality(E.Prev.Bot, E.Prev.Top))
+    	E = E.Next;
+
+    for (;;)
+    {
+      E = this.FindNextLocMin(E);
+      if (E == EMin)
+        break;
+      else if (EMin == null)
+        EMin = E;
+      //E and E.Prev now share a local minima (left aligned if horizontal).
+      //Compare their slopes to find which starts which bound ...
+      var locMin = new ClipperLib.LocalMinima();
+      locMin.Next = null;
+      locMin.Y = E.Bot.Y;
+      if (E.Dx < E.Prev.Dx)
+      {
+        locMin.LeftBound = E.Prev;
+        locMin.RightBound = E;
+        leftBoundIsForward = false;
+        //Q.nextInLML = Q.prev
+      }
+      else
+      {
+        locMin.LeftBound = E;
+        locMin.RightBound = E.Prev;
+        leftBoundIsForward = true;
+        //Q.nextInLML = Q.next
+      }
+      locMin.LeftBound.Side = ClipperLib.EdgeSide.esLeft;
+      locMin.RightBound.Side = ClipperLib.EdgeSide.esRight;
+      if (!Closed)
+        locMin.LeftBound.WindDelta = 0;
+      else if (locMin.LeftBound.Next == locMin.RightBound)
+        locMin.LeftBound.WindDelta = -1;
+      else
+        locMin.LeftBound.WindDelta = 1;
+      locMin.RightBound.WindDelta = -locMin.LeftBound.WindDelta;
+      E = this.ProcessBound(locMin.LeftBound, leftBoundIsForward);
+      if (E.OutIdx == ClipperLib.ClipperBase.Skip)
+      	E = this.ProcessBound(E, leftBoundIsForward);
+      var E2 = this.ProcessBound(locMin.RightBound, !leftBoundIsForward);
+      if (E2.OutIdx == ClipperLib.ClipperBase.Skip) E2 = this.ProcessBound(E2, !leftBoundIsForward);
+      if (locMin.LeftBound.OutIdx == ClipperLib.ClipperBase.Skip)
+        locMin.LeftBound = null;
+      else if (locMin.RightBound.OutIdx == ClipperLib.ClipperBase.Skip)
+        locMin.RightBound = null;
+      this.InsertLocalMinima(locMin);
+      if (!leftBoundIsForward)
+        E = E2;
     }
-    h = h % 1 * 6.0;
-    var i = Math.floor(h),
-        f = h - i,
-        x = v * (1 - s),
-        y = v * (1 - s * f),
-        z = v * (1 - s * (1 - f));
-    if (i > 4) {
-        return [v, x, y];
+    return true;
+  };
+  ClipperLib.ClipperBase.prototype.AddPaths = function (ppg, polyType, closed)
+  {
+    //  console.log("-------------------------------------------");
+    //  console.log(JSON.stringify(ppg));
+    var result = false;
+    for (var i = 0, ilen = ppg.length; i < ilen; ++i)
+      if (this.AddPath(ppg[i], polyType, closed))
+        result = true;
+    return result;
+  };
+  //------------------------------------------------------------------------------
+  ClipperLib.ClipperBase.prototype.Pt2IsBetweenPt1AndPt3 = function (pt1, pt2, pt3)
+  {
+    if ((ClipperLib.IntPoint.op_Equality(pt1, pt3)) || (ClipperLib.IntPoint.op_Equality(pt1, pt2)) ||       (ClipperLib.IntPoint.op_Equality(pt3, pt2)))
+
+   //if ((pt1 == pt3) || (pt1 == pt2) || (pt3 == pt2))
+   return false;
+
+    else if (pt1.X != pt3.X)
+      return (pt2.X > pt1.X) == (pt2.X < pt3.X);
+    else
+      return (pt2.Y > pt1.Y) == (pt2.Y < pt3.Y);
+  };
+  ClipperLib.ClipperBase.prototype.RemoveEdge = function (e)
+  {
+    //removes e from double_linked_list (but without removing from memory)
+    e.Prev.Next = e.Next;
+    e.Next.Prev = e.Prev;
+    var result = e.Next;
+    e.Prev = null; //flag as removed (see ClipperBase.Clear)
+    return result;
+  };
+  ClipperLib.ClipperBase.prototype.SetDx = function (e)
+  {
+    e.Delta.X = (e.Top.X - e.Bot.X);
+    e.Delta.Y = (e.Top.Y - e.Bot.Y);
+    if (e.Delta.Y === 0) e.Dx = ClipperLib.ClipperBase.horizontal;
+    else e.Dx = (e.Delta.X) / (e.Delta.Y);
+  };
+  ClipperLib.ClipperBase.prototype.InsertLocalMinima = function (newLm)
+  {
+    if (this.m_MinimaList === null)
+    {
+      this.m_MinimaList = newLm;
     }
-    return [[v, z, x], [y, v, x], [x, v, z], [x, y, v], [z, x, v]][parseInt(i, 10)];
-};
+    else if (newLm.Y >= this.m_MinimaList.Y)
+    {
+      newLm.Next = this.m_MinimaList;
+      this.m_MinimaList = newLm;
+    }
+    else
+    {
+      var tmpLm = this.m_MinimaList;
+      while (tmpLm.Next !== null && (newLm.Y < tmpLm.Next.Y))
+        tmpLm = tmpLm.Next;
+      newLm.Next = tmpLm.Next;
+      tmpLm.Next = newLm;
+    }
+  };
+  ClipperLib.ClipperBase.prototype.PopLocalMinima = function ()
+  {
+    if (this.m_CurrentLM === null)
+      return;
+    this.m_CurrentLM = this.m_CurrentLM.Next;
+  };
+  ClipperLib.ClipperBase.prototype.ReverseHorizontal = function (e)
+  {
+    //swap horizontal edges' top and bottom x's so they follow the natural
+    //progression of the bounds - ie so their xbots will align with the
+    //adjoining lower edge. [Helpful in the ProcessHorizontal() method.]
+    var tmp = e.Top.X;
+    e.Top.X = e.Bot.X;
+    e.Bot.X = tmp;
+    if (ClipperLib.use_xyz)
+    {
+      tmp = e.Top.Z;
+      e.Top.Z = e.Bot.Z;
+      e.Bot.Z = tmp;
+    }
+  };
+  ClipperLib.ClipperBase.prototype.Reset = function ()
+  {
+    this.m_CurrentLM = this.m_MinimaList;
+    if (this.m_CurrentLM == null)
+      return;
+    //ie nothing to process
+    //reset all edges ...
+    var lm = this.m_MinimaList;
+    while (lm != null)
+    {
+      var e = lm.LeftBound;
+      if (e != null)
+      {
+        //e.Curr = e.Bot;
+        e.Curr.X = e.Bot.X;
+        e.Curr.Y = e.Bot.Y;
+        if(ClipperLib.use_xyz) e.Curr.Z = e.Bot.Z;
+        e.Side = ClipperLib.EdgeSide.esLeft;
+        e.OutIdx = ClipperLib.ClipperBase.Unassigned;
+      }
+      e = lm.RightBound;
+      if (e != null)
+      {
+        //e.Curr = e.Bot;
+        e.Curr.X = e.Bot.X;
+        e.Curr.Y = e.Bot.Y;
+        if(ClipperLib.use_xyz) e.Curr.Z = e.Bot.Z;
+        e.Side = ClipperLib.EdgeSide.esRight;
+        e.OutIdx = ClipperLib.ClipperBase.Unassigned;
+      }
+      lm = lm.Next;
+    }
+  };
+  ClipperLib.Clipper = function (InitOptions) // public Clipper(int InitOptions = 0)
+  {
+    if (typeof (InitOptions) == "undefined") InitOptions = 0;
+    this.m_PolyOuts = null;
+    this.m_ClipType = ClipperLib.ClipType.ctIntersection;
+    this.m_Scanbeam = null;
+    this.m_ActiveEdges = null;
+    this.m_SortedEdges = null;
+    this.m_IntersectList = null;
+    this.m_IntersectNodeComparer = null;
+    this.m_ExecuteLocked = false;
+    this.m_ClipFillType = ClipperLib.PolyFillType.pftEvenOdd;
+    this.m_SubjFillType = ClipperLib.PolyFillType.pftEvenOdd;
+    this.m_Joins = null;
+    this.m_GhostJoins = null;
+    this.m_UsingPolyTree = false;
+    this.ReverseSolution = false;
+    this.StrictlySimple = false;
+    ClipperLib.ClipperBase.call(this);
+    this.m_Scanbeam = null;
+    this.m_ActiveEdges = null;
+    this.m_SortedEdges = null;
+    this.m_IntersectList = new Array();
+    this.m_IntersectNodeComparer = ClipperLib.MyIntersectNodeSort.Compare;
+    this.m_ExecuteLocked = false;
+    this.m_UsingPolyTree = false;
+    this.m_PolyOuts = new Array();
+    this.m_Joins = new Array();
+    this.m_GhostJoins = new Array();
+    this.ReverseSolution = (1 & InitOptions) !== 0;
+    this.StrictlySimple = (2 & InitOptions) !== 0;
+    this.PreserveCollinear = (4 & InitOptions) !== 0;
+    if (ClipperLib.use_xyz)
+    {
+      this.ZFillFunction = null; // function (IntPoint vert1, IntPoint vert2, ref IntPoint intersectPt);
+    }
+  };
+  ClipperLib.Clipper.ioReverseSolution = 1;
+  ClipperLib.Clipper.ioStrictlySimple = 2;
+  ClipperLib.Clipper.ioPreserveCollinear = 4;
 
-// Converts the given R,G,B values to H,S,L (between 0.0-1.0).
-// Code adapted from http://github.com/mattdesl/float-rgb2hsl
-color.rgb2hsl = function (r, g, b) {
-    var min = Math.min(r, g, b),
-        max = Math.max(r, g, b),
-        delta = max - min,
-        h, s, l;
+  ClipperLib.Clipper.prototype.Clear = function ()
+  {
+    if (this.m_edges.length === 0)
+      return;
+    //avoids problems with ClipperBase destructor
+    this.DisposeAllPolyPts();
+    ClipperLib.ClipperBase.prototype.Clear.call(this);
+  };
 
-    if (max === min) {
-        h = 0;
-    } else if (r === max) {
-        h = (g - b) / delta;
-    } else if (g === max) {
-        h = 2 + (b - r) / delta;
-    } else if (b === max) {
-        h = 4 + (r - g) / delta;
+  ClipperLib.Clipper.prototype.DisposeScanbeamList = function ()
+  {
+    while (this.m_Scanbeam !== null)
+    {
+      var sb2 = this.m_Scanbeam.Next;
+      this.m_Scanbeam = null;
+      this.m_Scanbeam = sb2;
     }
+  };
+  ClipperLib.Clipper.prototype.Reset = function ()
+  {
+    ClipperLib.ClipperBase.prototype.Reset.call(this);
+    this.m_Scanbeam = null;
+    this.m_ActiveEdges = null;
+    this.m_SortedEdges = null;
 
-    h = Math.min(h * 60, 360);
+    var lm = this.m_MinimaList;
+    while (lm !== null)
+    {
+      this.InsertScanbeam(lm.Y);
+      lm = lm.Next;
+    }
+  };
+  ClipperLib.Clipper.prototype.InsertScanbeam = function (Y)
+  {
+    if (this.m_Scanbeam === null)
+    {
+      this.m_Scanbeam = new ClipperLib.Scanbeam();
+      this.m_Scanbeam.Next = null;
+      this.m_Scanbeam.Y = Y;
+    }
+    else if (Y > this.m_Scanbeam.Y)
+    {
+      var newSb = new ClipperLib.Scanbeam();
+      newSb.Y = Y;
+      newSb.Next = this.m_Scanbeam;
+      this.m_Scanbeam = newSb;
+    }
+    else
+    {
+      var sb2 = this.m_Scanbeam;
+      while (sb2.Next !== null && (Y <= sb2.Next.Y))
+        sb2 = sb2.Next;
+      if (Y == sb2.Y)
+        return;
+      //ie ignores duplicates
+      var newSb = new ClipperLib.Scanbeam();
+      newSb.Y = Y;
+      newSb.Next = sb2.Next;
+      sb2.Next = newSb;
+    }
+  };
+  // ************************************
+  ClipperLib.Clipper.prototype.Execute = function ()
+  {
+    var a = arguments,
+      alen = a.length,
+      ispolytree = a[1] instanceof ClipperLib.PolyTree;
+    if (alen == 4 && !ispolytree) // function (clipType, solution, subjFillType, clipFillType)
+    {
+      var clipType = a[0],
+        solution = a[1],
+        subjFillType = a[2],
+        clipFillType = a[3];
+      if (this.m_ExecuteLocked)
+        return false;
+      if (this.m_HasOpenPaths)
+        ClipperLib.Error("Error: PolyTree struct is need for open path clipping.");
+      this.m_ExecuteLocked = true;
+      ClipperLib.Clear(solution);
+      this.m_SubjFillType = subjFillType;
+      this.m_ClipFillType = clipFillType;
+      this.m_ClipType = clipType;
+      this.m_UsingPolyTree = false;
+      try
+      {
+        var succeeded = this.ExecuteInternal();
+        //build the return polygons ...
+        if (succeeded) this.BuildResult(solution);
+      }
+      finally
+      {
+        this.DisposeAllPolyPts();
+        this.m_ExecuteLocked = false;
+      }
+      return succeeded;
+    }
+    else if (alen == 4 && ispolytree) // function (clipType, polytree, subjFillType, clipFillType)
+    {
+      var clipType = a[0],
+        polytree = a[1],
+        subjFillType = a[2],
+        clipFillType = a[3];
+      if (this.m_ExecuteLocked)
+        return false;
+      this.m_ExecuteLocked = true;
+      this.m_SubjFillType = subjFillType;
+      this.m_ClipFillType = clipFillType;
+      this.m_ClipType = clipType;
+      this.m_UsingPolyTree = true;
+      try
+      {
+        var succeeded = this.ExecuteInternal();
+        //build the return polygons ...
+        if (succeeded) this.BuildResult2(polytree);
+      }
+      finally
+      {
+        this.DisposeAllPolyPts();
+        this.m_ExecuteLocked = false;
+      }
+      return succeeded;
+    }
+    else if (alen == 2 && !ispolytree) // function (clipType, solution)
+    {
+      var clipType = a[0],
+        solution = a[1];
+      return this.Execute(clipType, solution, ClipperLib.PolyFillType.pftEvenOdd, ClipperLib.PolyFillType.pftEvenOdd);
+    }
+    else if (alen == 2 && ispolytree) // function (clipType, polytree)
+    {
+      var clipType = a[0],
+        polytree = a[1];
+      return this.Execute(clipType, polytree, ClipperLib.PolyFillType.pftEvenOdd, ClipperLib.PolyFillType.pftEvenOdd);
+    }
+  };
+  ClipperLib.Clipper.prototype.FixHoleLinkage = function (outRec)
+  {
+    //skip if an outermost polygon or
+    //already already points to the correct FirstLeft ...
+    if (outRec.FirstLeft === null || (outRec.IsHole != outRec.FirstLeft.IsHole && outRec.FirstLeft.Pts !== null))
+      return;
+    var orfl = outRec.FirstLeft;
+    while (orfl !== null && ((orfl.IsHole == outRec.IsHole) || orfl.Pts === null))
+      orfl = orfl.FirstLeft;
+    outRec.FirstLeft = orfl;
+  };
+  ClipperLib.Clipper.prototype.ExecuteInternal = function ()
+  {
+    try
+    {
+      this.Reset();
+      if (this.m_CurrentLM === null)
+        return false;
+      var botY = this.PopScanbeam();
+      do {
+        this.InsertLocalMinimaIntoAEL(botY);
+        ClipperLib.Clear(this.m_GhostJoins);
+        this.ProcessHorizontals(false);
+        if (this.m_Scanbeam === null)
+          break;
+        var topY = this.PopScanbeam();
+        if (!this.ProcessIntersections(topY)) return false;
 
-    if (h < 0) {
-        h += 360;
+        this.ProcessEdgesAtTopOfScanbeam(topY);
+        botY = topY;
+      }
+      while (this.m_Scanbeam !== null || this.m_CurrentLM !== null)
+      //fix orientations ...
+      for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
+      {
+        var outRec = this.m_PolyOuts[i];
+        if (outRec.Pts === null || outRec.IsOpen)
+          continue;
+        if ((outRec.IsHole ^ this.ReverseSolution) == (this.Area(outRec) > 0))
+          this.ReversePolyPtLinks(outRec.Pts);
+      }
+      this.JoinCommonEdges();
+      for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
+      {
+        var outRec = this.m_PolyOuts[i];
+        if (outRec.Pts !== null && !outRec.IsOpen)
+          this.FixupOutPolygon(outRec);
+      }
+      if (this.StrictlySimple)
+        this.DoSimplePolygons();
+      return true;
     }
-
-    l = (min + max) / 2;
-
-    if (max === min) {
-        s = 0;
-    } else if (l <= 0.5) {
-        s = delta / (max + min);
-    } else {
-        s = delta / (2 - max - min);
+    finally
+    {
+      ClipperLib.Clear(this.m_Joins);
+      ClipperLib.Clear(this.m_GhostJoins);
     }
+  };
+  ClipperLib.Clipper.prototype.PopScanbeam = function ()
+  {
+    var Y = this.m_Scanbeam.Y;
+    this.m_Scanbeam = this.m_Scanbeam.Next;
+    return Y;
+  };
 
-    return [h / 360, s, l];
-};
+  ClipperLib.Clipper.prototype.DisposeAllPolyPts = function ()
+  {
+    for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; ++i)
+      this.DisposeOutRec(i);
+    ClipperLib.Clear(this.m_PolyOuts);
+  };
+  ClipperLib.Clipper.prototype.DisposeOutRec = function (index)
+  {
+    var outRec = this.m_PolyOuts[index];
+    outRec.Pts = null;
+    outRec = null;
+    this.m_PolyOuts[index] = null;
+  };
 
-// Converts the given H,S,L color values to R,G,B (between 0.0-1.0).
-// Code adapted from http://github.com/mattdesl/float-hsl2rgb
-color.hsl2rgb = function (h, s, l) {
-    var t1, t2, t3, rgb, val;
+  ClipperLib.Clipper.prototype.AddJoin = function (Op1, Op2, OffPt)
+  {
+    var j = new ClipperLib.Join();
+    j.OutPt1 = Op1;
+    j.OutPt2 = Op2;
+    //j.OffPt = OffPt;
+    j.OffPt.X = OffPt.X;
+    j.OffPt.Y = OffPt.Y;
+		if(ClipperLib.use_xyz) j.OffPt.Z = OffPt.Z;
+    this.m_Joins.push(j);
+  };
+  ClipperLib.Clipper.prototype.AddGhostJoin = function (Op, OffPt)
+  {
+    var j = new ClipperLib.Join();
+    j.OutPt1 = Op;
+    //j.OffPt = OffPt;
+    j.OffPt.X = OffPt.X;
+    j.OffPt.Y = OffPt.Y;
+		if(ClipperLib.use_xyz) j.OffPt.Z = OffPt.Z;
+    this.m_GhostJoins.push(j);
+  };
+  //if (ClipperLib.use_xyz)
+  //{
+    ClipperLib.Clipper.prototype.SetZ = function (pt, e1, e2)
+    {
+      if (this.ZFillFunction !== null)
+      {
+        if (pt.Z != 0 || this.ZFillFunction === null) return;
+        else if (ClipperLib.IntPoint.op_Equality(pt, e1.Bot)) pt.Z = e1.Bot.Z;
+        else if (ClipperLib.IntPoint.op_Equality(pt, e1.Top)) pt.Z = e1.Top.Z;
+        else if (ClipperLib.IntPoint.op_Equality(pt, e2.Bot)) pt.Z = e2.Bot.Z;
+        else if (ClipperLib.IntPoint.op_Equality(pt, e2.Top)) pt.Z = e2.Top.Z;
+        else this.ZFillFunction(e1.Bot, e1.Top, e2.Bot, e2.Top, pt);
+      }
+    };
 
-    if (s === 0) {
-        val = l;
-        return [val, val, val];
-    }
+    //------------------------------------------------------------------------------
+  //}
 
-    if (l < 0.5) {
-        t2 = l * (1 + s);
-    } else {
-        t2 = l + s - l * s;
-    }
-    t1 = 2 * l - t2;
+  ClipperLib.Clipper.prototype.InsertLocalMinimaIntoAEL = function (botY)
+  {
+    while (this.m_CurrentLM !== null && (this.m_CurrentLM.Y == botY))
+    {
+      var lb = this.m_CurrentLM.LeftBound;
+      var rb = this.m_CurrentLM.RightBound;
+      this.PopLocalMinima();
+      var Op1 = null;
+      if (lb === null)
+      {
+        this.InsertEdgeIntoAEL(rb, null);
+        this.SetWindingCount(rb);
+        if (this.IsContributing(rb))
+          Op1 = this.AddOutPt(rb, rb.Bot);
+      }
+      else if (rb == null)
+      {
+        this.InsertEdgeIntoAEL(lb, null);
+        this.SetWindingCount(lb);
+        if (this.IsContributing(lb))
+          Op1 = this.AddOutPt(lb, lb.Bot);
+        this.InsertScanbeam(lb.Top.Y);
+      }
+      else
+      {
+        this.InsertEdgeIntoAEL(lb, null);
+        this.InsertEdgeIntoAEL(rb, lb);
+        this.SetWindingCount(lb);
+        rb.WindCnt = lb.WindCnt;
+        rb.WindCnt2 = lb.WindCnt2;
+        if (this.IsContributing(lb))
+          Op1 = this.AddLocalMinPoly(lb, rb, lb.Bot);
+        this.InsertScanbeam(lb.Top.Y);
+      }
+      if (rb != null)
+      {
+        if (ClipperLib.ClipperBase.IsHorizontal(rb))
+          this.AddEdgeToSEL(rb);
+        else
+          this.InsertScanbeam(rb.Top.Y);
+      }
+      if (lb == null || rb == null) continue;
+      //if output polygons share an Edge with a horizontal rb, they'll need joining later ...
+      if (Op1 !== null && ClipperLib.ClipperBase.IsHorizontal(rb) && this.m_GhostJoins.length > 0 && rb.WindDelta !== 0)
+      {
+        for (var i = 0, ilen = this.m_GhostJoins.length; i < ilen; i++)
+        {
+          //if the horizontal Rb and a 'ghost' horizontal overlap, then convert
+          //the 'ghost' join to a real join ready for later ...
+          var j = this.m_GhostJoins[i];
 
-    rgb = [0, 0, 0];
-    for (var i = 0; i < 3; i++) {
-        t3 = h + 1 / 3 * -(i - 1);
-        if (t3 < 0) {
-            t3 += 1;
+					if (this.HorzSegmentsOverlap(j.OutPt1.Pt.X, j.OffPt.X, rb.Bot.X, rb.Top.X))
+            this.AddJoin(j.OutPt1, Op1, j.OffPt);
         }
-        if (t3 > 1) {
-            t3 -= 1;
-        }
-
-        if (6 * t3 < 1) {
-            val = t1 + (t2 - t1) * 6 * t3;
-        } else if (2 * t3 < 1) {
-            val = t2;
-        } else if (3 * t3 < 2) {
-            val = t1 + (t2 - t1) * (2 / 3 - t3) * 6;
-        } else {
-            val = t1;
+      }
+      if (lb.OutIdx >= 0 && lb.PrevInAEL !== null &&
+        lb.PrevInAEL.Curr.X == lb.Bot.X &&
+        lb.PrevInAEL.OutIdx >= 0 &&
+        ClipperLib.ClipperBase.SlopesEqual(lb.PrevInAEL, lb, this.m_UseFullRange) &&
+        lb.WindDelta !== 0 && lb.PrevInAEL.WindDelta !== 0)
+      {
+        var Op2 = this.AddOutPt(lb.PrevInAEL, lb.Bot);
+        this.AddJoin(Op1, Op2, lb.Top);
+      }
+      if (lb.NextInAEL != rb)
+      {
+        if (rb.OutIdx >= 0 && rb.PrevInAEL.OutIdx >= 0 &&
+          ClipperLib.ClipperBase.SlopesEqual(rb.PrevInAEL, rb, this.m_UseFullRange) &&
+          rb.WindDelta !== 0 && rb.PrevInAEL.WindDelta !== 0)
+        {
+          var Op2 = this.AddOutPt(rb.PrevInAEL, rb.Bot);
+          this.AddJoin(Op1, Op2, rb.Top);
         }
-
-        rgb[i] = val;
+        var e = lb.NextInAEL;
+        if (e !== null)
+          while (e != rb)
+          {
+            //nb: For calculating winding counts etc, IntersectEdges() assumes
+            //that param1 will be to the right of param2 ABOVE the intersection ...
+            this.IntersectEdges(rb, e, lb.Curr, false);
+            //order important here
+            e = e.NextInAEL;
+          }
+      }
     }
-
-    return rgb;
-};
-
-module.exports = color;
-
-},{}],40:[function(require,module,exports){
-// Geometry
-
-'use strict';
-
-var math = require('../util/math');
-
-var Point = require('../objects/point');
-
-var geo = {};
-
-// Returns the angle between two points.
-geo.angle = function (x0, y0, x1, y1) {
-    return math.degrees(Math.atan2(y1 - y0, x1 - x0));
-};
-
-// Returns the distance between two points.
-geo.distance = function (x0, y0, x1, y1) {
-    return Math.sqrt(Math.pow(x1 - x0, 2) + Math.pow(y1 - y0, 2));
-};
-
-// Returns the location of a point by rotating around origin (x0,y0).
-geo.coordinates = function (x0, y0, angle, distance) {
-    var x = x0 + Math.cos(math.radians(angle)) * distance,
-        y = y0 + Math.sin(math.radians(angle)) * distance;
-    return new Point(x, y);
-};
-
-
-// Determines if the given point is within the polygon, given as a list of points.
-
-// This function uses a ray casting algorithm to determine how many times
-// a horizontal ray starting from the point intersects with the sides of the polygon.
-// If it is an even number of times, the point is outside, if odd, inside.
-// The algorithm does not always report correctly when the point is very close to the boundary.
-// The polygon is passed as an array of Points.
-//
-// Based on: W. Randolph Franklin, 1970, http://www.ecse.rpi.edu/Homepages/wrf/Research/Short_Notes/pnpoly.html
-geo.pointInPolygon = function (points, x, y) {
-    var i, j, x0, y0, x1, y1,
-        odd = false,
-        n = points.length;
-
-    for (i = 0; i < n; i += 1) {
-        j = (i < n - 1) ? i + 1 : 0;
-        x0 = points[i].x;
-        y0 = points[i].y;
-        x1 = points[j].x;
-        y1 = points[j].y;
-        if ((y0 < y && y1 >= y) || (y1 < y && y0 >= y)) {
-            if (x0 + (y - y0) / (y1 - y0) * (x1 - x0) < x) {
-                odd = !odd;
-            }
+  };
+  ClipperLib.Clipper.prototype.InsertEdgeIntoAEL = function (edge, startEdge)
+  {
+    if (this.m_ActiveEdges === null)
+    {
+      edge.PrevInAEL = null;
+      edge.NextInAEL = null;
+      this.m_ActiveEdges = edge;
+    }
+    else if (startEdge === null && this.E2InsertsBeforeE1(this.m_ActiveEdges, edge))
+    {
+      edge.PrevInAEL = null;
+      edge.NextInAEL = this.m_ActiveEdges;
+      this.m_ActiveEdges.PrevInAEL = edge;
+      this.m_ActiveEdges = edge;
+    }
+    else
+    {
+      if (startEdge === null)
+        startEdge = this.m_ActiveEdges;
+      while (startEdge.NextInAEL !== null && !this.E2InsertsBeforeE1(startEdge.NextInAEL, edge))
+        startEdge = startEdge.NextInAEL;
+      edge.NextInAEL = startEdge.NextInAEL;
+      if (startEdge.NextInAEL !== null)
+        startEdge.NextInAEL.PrevInAEL = edge;
+      edge.PrevInAEL = startEdge;
+      startEdge.NextInAEL = edge;
+    }
+  };
+  ClipperLib.Clipper.prototype.E2InsertsBeforeE1 = function (e1, e2)
+  {
+    if (e2.Curr.X == e1.Curr.X)
+    {
+      if (e2.Top.Y > e1.Top.Y)
+        return e2.Top.X < ClipperLib.Clipper.TopX(e1, e2.Top.Y);
+      else
+        return e1.Top.X > ClipperLib.Clipper.TopX(e2, e1.Top.Y);
+    }
+    else
+      return e2.Curr.X < e1.Curr.X;
+  };
+  ClipperLib.Clipper.prototype.IsEvenOddFillType = function (edge)
+  {
+    if (edge.PolyTyp == ClipperLib.PolyType.ptSubject)
+      return this.m_SubjFillType == ClipperLib.PolyFillType.pftEvenOdd;
+    else
+      return this.m_ClipFillType == ClipperLib.PolyFillType.pftEvenOdd;
+  };
+  ClipperLib.Clipper.prototype.IsEvenOddAltFillType = function (edge)
+  {
+    if (edge.PolyTyp == ClipperLib.PolyType.ptSubject)
+      return this.m_ClipFillType == ClipperLib.PolyFillType.pftEvenOdd;
+    else
+      return this.m_SubjFillType == ClipperLib.PolyFillType.pftEvenOdd;
+  };
+  ClipperLib.Clipper.prototype.IsContributing = function (edge)
+  {
+    var pft, pft2;
+    if (edge.PolyTyp == ClipperLib.PolyType.ptSubject)
+    {
+      pft = this.m_SubjFillType;
+      pft2 = this.m_ClipFillType;
+    }
+    else
+    {
+      pft = this.m_ClipFillType;
+      pft2 = this.m_SubjFillType;
+    }
+    switch (pft)
+    {
+    case ClipperLib.PolyFillType.pftEvenOdd:
+      if (edge.WindDelta === 0 && edge.WindCnt != 1)
+        return false;
+      break;
+    case ClipperLib.PolyFillType.pftNonZero:
+      if (Math.abs(edge.WindCnt) != 1)
+        return false;
+      break;
+    case ClipperLib.PolyFillType.pftPositive:
+      if (edge.WindCnt != 1)
+        return false;
+      break;
+    default:
+      if (edge.WindCnt != -1)
+        return false;
+      break;
+    }
+    switch (this.m_ClipType)
+    {
+    case ClipperLib.ClipType.ctIntersection:
+      switch (pft2)
+      {
+      case ClipperLib.PolyFillType.pftEvenOdd:
+      case ClipperLib.PolyFillType.pftNonZero:
+        return (edge.WindCnt2 !== 0);
+      case ClipperLib.PolyFillType.pftPositive:
+        return (edge.WindCnt2 > 0);
+      default:
+        return (edge.WindCnt2 < 0);
+      }
+    case ClipperLib.ClipType.ctUnion:
+      switch (pft2)
+      {
+      case ClipperLib.PolyFillType.pftEvenOdd:
+      case ClipperLib.PolyFillType.pftNonZero:
+        return (edge.WindCnt2 === 0);
+      case ClipperLib.PolyFillType.pftPositive:
+        return (edge.WindCnt2 <= 0);
+      default:
+        return (edge.WindCnt2 >= 0);
+      }
+    case ClipperLib.ClipType.ctDifference:
+      if (edge.PolyTyp == ClipperLib.PolyType.ptSubject)
+        switch (pft2)
+        {
+        case ClipperLib.PolyFillType.pftEvenOdd:
+        case ClipperLib.PolyFillType.pftNonZero:
+          return (edge.WindCnt2 === 0);
+        case ClipperLib.PolyFillType.pftPositive:
+          return (edge.WindCnt2 <= 0);
+        default:
+          return (edge.WindCnt2 >= 0);
+        }
+      else
+        switch (pft2)
+        {
+        case ClipperLib.PolyFillType.pftEvenOdd:
+        case ClipperLib.PolyFillType.pftNonZero:
+          return (edge.WindCnt2 !== 0);
+        case ClipperLib.PolyFillType.pftPositive:
+          return (edge.WindCnt2 > 0);
+        default:
+          return (edge.WindCnt2 < 0);
+        }
+    case ClipperLib.ClipType.ctXor:
+      if (edge.WindDelta === 0)
+        switch (pft2)
+        {
+        case ClipperLib.PolyFillType.pftEvenOdd:
+        case ClipperLib.PolyFillType.pftNonZero:
+          return (edge.WindCnt2 === 0);
+        case ClipperLib.PolyFillType.pftPositive:
+          return (edge.WindCnt2 <= 0);
+        default:
+          return (edge.WindCnt2 >= 0);
         }
+      else
+        return true;
     }
-    return odd;
-};
-
-module.exports = geo;
-
-},{"../objects/point":32,"../util/math":42}],41:[function(require,module,exports){
-// Generic JavaScript utility methods
-
-'use strict';
-
-// Define a property that serves as an alias for another property.
-exports.defineAlias = function (cls, origProperty, newProperty) {
-    Object.defineProperty(cls.prototype, newProperty, {
-        get: function () {
-            return this[origProperty];
-        },
-
-        set: function (v) {
-            this[origProperty] = v;
+    return true;
+  };
+  ClipperLib.Clipper.prototype.SetWindingCount = function (edge)
+  {
+    var e = edge.PrevInAEL;
+    //find the edge of the same polytype that immediately preceeds 'edge' in AEL
+    while (e !== null && ((e.PolyTyp != edge.PolyTyp) || (e.WindDelta === 0)))
+      e = e.PrevInAEL;
+    if (e === null)
+    {
+      edge.WindCnt = (edge.WindDelta === 0 ? 1 : edge.WindDelta);
+      edge.WindCnt2 = 0;
+      e = this.m_ActiveEdges;
+      //ie get ready to calc WindCnt2
+    }
+    else if (edge.WindDelta === 0 && this.m_ClipType != ClipperLib.ClipType.ctUnion)
+    {
+      edge.WindCnt = 1;
+      edge.WindCnt2 = e.WindCnt2;
+      e = e.NextInAEL;
+      //ie get ready to calc WindCnt2
+    }
+    else if (this.IsEvenOddFillType(edge))
+    {
+      //EvenOdd filling ...
+      if (edge.WindDelta === 0)
+      {
+        //are we inside a subj polygon ...
+        var Inside = true;
+        var e2 = e.PrevInAEL;
+        while (e2 !== null)
+        {
+          if (e2.PolyTyp == e.PolyTyp && e2.WindDelta !== 0)
+            Inside = !Inside;
+          e2 = e2.PrevInAEL;
         }
-    });
-};
-
-// Define a property on the class prototype that has a single getter function.
-exports.defineGetter = function (cls, property, getterFn) {
-    Object.defineProperty(cls.prototype, property, {
-        get: getterFn
-    });
-};
-
-},{}],42:[function(require,module,exports){
-// Math Utility functions
-
-'use strict';
-
-var math = {};
-
-math.sum = function (values) {
-    var i,
-        n = values.length,
-        total = 0;
-    for (i = 0; i < n; i += 1) {
-        total += values[i];
+        edge.WindCnt = (Inside ? 0 : 1);
+      }
+      else
+      {
+        edge.WindCnt = edge.WindDelta;
+      }
+      edge.WindCnt2 = e.WindCnt2;
+      e = e.NextInAEL;
+      //ie get ready to calc WindCnt2
     }
-    return total;
-};
-
-math.round = function (x, decimals) {
-    return (!decimals) ?
-            Math.round(x) :
-            Math.round(x * Math.pow(10, decimals)) / Math.pow(10, decimals);
-};
-
-math.sign = function (x) {
-    if (x < 0) { return -1; }
-    if (x > 0) { return +1; }
-    return 0;
-};
-
-math.degrees = function (radians) {
-    return radians * 180 / Math.PI;
-};
-
-math.radians = function (degrees) {
-    return degrees / 180 * Math.PI;
-};
-
-math.clamp = function (v, min, max) {
-    if (min < max) {
-        return v < min ? min : v > max ? max : v;
-    } else {
-        return v < max ? max : v > min ? min : v;
+    else
+    {
+      //nonZero, Positive or Negative filling ...
+      if (e.WindCnt * e.WindDelta < 0)
+      {
+        //prev edge is 'decreasing' WindCount (WC) toward zero
+        //so we're outside the previous polygon ...
+        if (Math.abs(e.WindCnt) > 1)
+        {
+          //outside prev poly but still inside another.
+          //when reversing direction of prev poly use the same WC
+          if (e.WindDelta * edge.WindDelta < 0)
+            edge.WindCnt = e.WindCnt;
+          else
+            edge.WindCnt = e.WindCnt + edge.WindDelta;
+        }
+        else
+          edge.WindCnt = (edge.WindDelta === 0 ? 1 : edge.WindDelta);
+      }
+      else
+      {
+        //prev edge is 'increasing' WindCount (WC) away from zero
+        //so we're inside the previous polygon ...
+        if (edge.WindDelta === 0)
+          edge.WindCnt = (e.WindCnt < 0 ? e.WindCnt - 1 : e.WindCnt + 1);
+        else if (e.WindDelta * edge.WindDelta < 0)
+          edge.WindCnt = e.WindCnt;
+        else
+          edge.WindCnt = e.WindCnt + edge.WindDelta;
+      }
+      edge.WindCnt2 = e.WindCnt2;
+      e = e.NextInAEL;
+      //ie get ready to calc WindCnt2
     }
-};
-
-// Snaps a value to a virtual grid. Distance defines the spacing between grid lines.
-// Strength defines how strongly the values move to the grid. If 1, the values will always
-// be on the grid lines, if 0, the value is unchanged.
-math.snap = function (v, distance, strength) {
-    strength = strength !== undefined ? strength : 1;
-    return (v * (1.0 - strength)) + (strength * Math.round(v / distance) * distance);
-};
-
-math.dot = function (a, b) {
-    var m = Math.min(a.length, b.length),
-        n = 0,
-        i;
-    for (i = 0; i < m; i += 1) {
-        n += a[i] * b[i];
+    //update WindCnt2 ...
+    if (this.IsEvenOddAltFillType(edge))
+    {
+      //EvenOdd filling ...
+      while (e != edge)
+      {
+        if (e.WindDelta !== 0)
+          edge.WindCnt2 = (edge.WindCnt2 === 0 ? 1 : 0);
+        e = e.NextInAEL;
+      }
     }
-    return n;
-};
-
-// Linearly interpolate between from and to for t=0-1.
-// If clamp=true, values outside of 0-1 will be clamped.
-var _lerp = math.mix = math.lerp = function (from, to, t, clamp) {
-    if (clamp) {
-        if (t < 0) { return from; }
-        if (t > 1) { return to; }
+    else
+    {
+      //nonZero, Positive or Negative filling ...
+      while (e != edge)
+      {
+        edge.WindCnt2 += e.WindDelta;
+        e = e.NextInAEL;
+      }
     }
-    return from + (to - from) * t;
-};
-
-// Compute fade curve for point t.
-function _fade(t) {
-    return t * t * t * (t * (t * 6 - 15) + 10);
-}
-
-// Convert low 4 bits of hash code into 12 gradient directions.
-function _grad(hash, x, y, z) {
-    var h, u, v;
-    h = hash & 15;
-    u = h < 8 ? x : y;
-    v = h < 4 ? y : h === 12 || h === 14 ? x : z;
-    return ((h & 1) === 0 ? u : -u) + ((h & 2) === 0 ? v : -v);
-}
-
-function _scale(n) {
-    return (1 + n) / 2;
-}
-
-var _permutation = (function () {
-    var permutation, p, i;
-    permutation = [ 151, 160, 137, 91, 90, 15,
-        131, 13, 201, 95, 96, 53, 194, 233, 7, 225, 140, 36, 103, 30, 69, 142, 8, 99, 37, 240, 21, 10, 23,
-        190, 6, 148, 247, 120, 234, 75, 0, 26, 197, 62, 94, 252, 219, 203, 117, 35, 11, 32, 57, 177, 33,
-        88, 237, 149, 56, 87, 174, 20, 125, 136, 171, 168, 68, 175, 74, 165, 71, 134, 139, 48, 27, 166,
-        77, 146, 158, 231, 83, 111, 229, 122, 60, 211, 133, 230, 220, 105, 92, 41, 55, 46, 245, 40, 244,
-        102, 143, 54, 65, 25, 63, 161, 1, 216, 80, 73, 209, 76, 132, 187, 208, 89, 18, 169, 200, 196,
-        135, 130, 116, 188, 159, 86, 164, 100, 109, 198, 173, 186, 3, 64, 52, 217, 226, 250, 124, 123,
-        5, 202, 38, 147, 118, 126, 255, 82, 85, 212, 207, 206, 59, 227, 47, 16, 58, 17, 182, 189, 28, 42,
-        223, 183, 170, 213, 119, 248, 152, 2, 44, 154, 163, 70, 221, 153, 101, 155, 167, 43, 172, 9,
-        129, 22, 39, 253, 19, 98, 108, 110, 79, 113, 224, 232, 178, 185, 112, 104, 218, 246, 97, 228,
-        251, 34, 242, 193, 238, 210, 144, 12, 191, 179, 162, 241, 81, 51, 145, 235, 249, 14, 239, 107,
-        49, 192, 214, 31, 181, 199, 106, 157, 184, 84, 204, 176, 115, 121, 50, 45, 127, 4, 150, 254,
-        138, 236, 205, 93, 222, 114, 67, 29, 24, 72, 243, 141, 128, 195, 78, 66, 215, 61, 156, 180];
-
-    p = new Uint8Array(512);
-    for (i = 0; i < 256; i += 1) {
-        p[256 + i] = p[i] = permutation[i];
+  };
+  ClipperLib.Clipper.prototype.AddEdgeToSEL = function (edge)
+  {
+    //SEL pointers in PEdge are reused to build a list of horizontal edges.
+    //However, we don't need to worry about order with horizontal edge processing.
+    if (this.m_SortedEdges === null)
+    {
+      this.m_SortedEdges = edge;
+      edge.PrevInSEL = null;
+      edge.NextInSEL = null;
     }
-    return p;
-}());
-
-// Calculate Perlin noise
-math.noise = function (x, y, z) {
-    var p = _permutation;
-
-    // Find unit cube that contains the point.
-    var X = Math.floor(x) & 255;
-    var Y = Math.floor(y) & 255;
-    var Z = Math.floor(z) & 255;
-    // Find relative x, y, z point in the cube.
-    x -= Math.floor(x);
-    y -= Math.floor(y);
-    z -= Math.floor(z);
-    // Compute fade curves for each x, y, z.
-    var u = _fade(x);
-    var v = _fade(y);
-    var w = _fade(z);
-
-    // Hash coordinates of the 8 cube corners.
-    var A = p[X] + Y;
-    var AA = p[A] + Z;
-    var AB = p[A + 1] + Z;
-    var B = p[X + 1] + Y;
-    var BA = p[B] + Z;
-    var BB = p[B + 1] + Z;
-
-    // Add blended results from 8 corners of the cube.
-    return _scale(_lerp(_lerp(_lerp(_grad(p[AA], x, y, z),
-        _grad(p[BA], x - 1, y, z), u),
-        _lerp(_grad(p[AB], x, y - 1, z),
-             _grad(p[BB], x - 1, y - 1, z), u), v),
-        _lerp(_lerp(_grad(p[AA + 1], x, y, z - 1),
-            _grad(p[BA + 1], x - 1, y, z - 1), u),
-            _lerp(_grad(p[AB + 1], x, y - 1, z - 1),
-                _grad(p[BB + 1], x - 1, y - 1, z - 1), u), v), w));
-};
-
-module.exports = math;
-
-},{}],43:[function(require,module,exports){
-// Pseudo-random generator
-
-'use strict';
+    else
+    {
+      edge.NextInSEL = this.m_SortedEdges;
+      edge.PrevInSEL = null;
+      this.m_SortedEdges.PrevInSEL = edge;
+      this.m_SortedEdges = edge;
+    }
+  };
+  ClipperLib.Clipper.prototype.CopyAELToSEL = function ()
+  {
+    var e = this.m_ActiveEdges;
+    this.m_SortedEdges = e;
+    while (e !== null)
+    {
+      e.PrevInSEL = e.PrevInAEL;
+      e.NextInSEL = e.NextInAEL;
+      e = e.NextInAEL;
+    }
+  };
+  ClipperLib.Clipper.prototype.SwapPositionsInAEL = function (edge1, edge2)
+  {
+    //check that one or other edge hasn't already been removed from AEL ...
+    if (edge1.NextInAEL == edge1.PrevInAEL || edge2.NextInAEL == edge2.PrevInAEL)
+      return;
+    if (edge1.NextInAEL == edge2)
+    {
+      var next = edge2.NextInAEL;
+      if (next !== null)
+        next.PrevInAEL = edge1;
+      var prev = edge1.PrevInAEL;
+      if (prev !== null)
+        prev.NextInAEL = edge2;
+      edge2.PrevInAEL = prev;
+      edge2.NextInAEL = edge1;
+      edge1.PrevInAEL = edge2;
+      edge1.NextInAEL = next;
+    }
+    else if (edge2.NextInAEL == edge1)
+    {
+      var next = edge1.NextInAEL;
+      if (next !== null)
+        next.PrevInAEL = edge2;
+      var prev = edge2.PrevInAEL;
+      if (prev !== null)
+        prev.NextInAEL = edge1;
+      edge1.PrevInAEL = prev;
+      edge1.NextInAEL = edge2;
+      edge2.PrevInAEL = edge1;
+      edge2.NextInAEL = next;
+    }
+    else
+    {
+      var next = edge1.NextInAEL;
+      var prev = edge1.PrevInAEL;
+      edge1.NextInAEL = edge2.NextInAEL;
+      if (edge1.NextInAEL !== null)
+        edge1.NextInAEL.PrevInAEL = edge1;
+      edge1.PrevInAEL = edge2.PrevInAEL;
+      if (edge1.PrevInAEL !== null)
+        edge1.PrevInAEL.NextInAEL = edge1;
+      edge2.NextInAEL = next;
+      if (edge2.NextInAEL !== null)
+        edge2.NextInAEL.PrevInAEL = edge2;
+      edge2.PrevInAEL = prev;
+      if (edge2.PrevInAEL !== null)
+        edge2.PrevInAEL.NextInAEL = edge2;
+    }
+    if (edge1.PrevInAEL === null)
+      this.m_ActiveEdges = edge1;
+    else if (edge2.PrevInAEL === null)
+      this.m_ActiveEdges = edge2;
+  };
+  ClipperLib.Clipper.prototype.SwapPositionsInSEL = function (edge1, edge2)
+  {
+    if (edge1.NextInSEL === null && edge1.PrevInSEL === null)
+      return;
+    if (edge2.NextInSEL === null && edge2.PrevInSEL === null)
+      return;
+    if (edge1.NextInSEL == edge2)
+    {
+      var next = edge2.NextInSEL;
+      if (next !== null)
+        next.PrevInSEL = edge1;
+      var prev = edge1.PrevInSEL;
+      if (prev !== null)
+        prev.NextInSEL = edge2;
+      edge2.PrevInSEL = prev;
+      edge2.NextInSEL = edge1;
+      edge1.PrevInSEL = edge2;
+      edge1.NextInSEL = next;
+    }
+    else if (edge2.NextInSEL == edge1)
+    {
+      var next = edge1.NextInSEL;
+      if (next !== null)
+        next.PrevInSEL = edge2;
+      var prev = edge2.PrevInSEL;
+      if (prev !== null)
+        prev.NextInSEL = edge1;
+      edge1.PrevInSEL = prev;
+      edge1.NextInSEL = edge2;
+      edge2.PrevInSEL = edge1;
+      edge2.NextInSEL = next;
+    }
+    else
+    {
+      var next = edge1.NextInSEL;
+      var prev = edge1.PrevInSEL;
+      edge1.NextInSEL = edge2.NextInSEL;
+      if (edge1.NextInSEL !== null)
+        edge1.NextInSEL.PrevInSEL = edge1;
+      edge1.PrevInSEL = edge2.PrevInSEL;
+      if (edge1.PrevInSEL !== null)
+        edge1.PrevInSEL.NextInSEL = edge1;
+      edge2.NextInSEL = next;
+      if (edge2.NextInSEL !== null)
+        edge2.NextInSEL.PrevInSEL = edge2;
+      edge2.PrevInSEL = prev;
+      if (edge2.PrevInSEL !== null)
+        edge2.PrevInSEL.NextInSEL = edge2;
+    }
+    if (edge1.PrevInSEL === null)
+      this.m_SortedEdges = edge1;
+    else if (edge2.PrevInSEL === null)
+      this.m_SortedEdges = edge2;
+  };
+  ClipperLib.Clipper.prototype.AddLocalMaxPoly = function (e1, e2, pt)
+  {
+    this.AddOutPt(e1, pt);
+    if (e2.WindDelta == 0) this.AddOutPt(e2, pt);
+    if (e1.OutIdx == e2.OutIdx)
+    {
+      e1.OutIdx = -1;
+      e2.OutIdx = -1;
+    }
+    else if (e1.OutIdx < e2.OutIdx)
+      this.AppendPolygon(e1, e2);
+    else
+      this.AppendPolygon(e2, e1);
+  };
+  ClipperLib.Clipper.prototype.AddLocalMinPoly = function (e1, e2, pt)
+  {
+    var result;
+    var e, prevE;
+    if (ClipperLib.ClipperBase.IsHorizontal(e2) || (e1.Dx > e2.Dx))
+    {
+      result = this.AddOutPt(e1, pt);
+      e2.OutIdx = e1.OutIdx;
+      e1.Side = ClipperLib.EdgeSide.esLeft;
+      e2.Side = ClipperLib.EdgeSide.esRight;
+      e = e1;
+      if (e.PrevInAEL == e2)
+        prevE = e2.PrevInAEL;
+      else
+        prevE = e.PrevInAEL;
+    }
+    else
+    {
+      result = this.AddOutPt(e2, pt);
+      e1.OutIdx = e2.OutIdx;
+      e1.Side = ClipperLib.EdgeSide.esRight;
+      e2.Side = ClipperLib.EdgeSide.esLeft;
+      e = e2;
+      if (e.PrevInAEL == e1)
+        prevE = e1.PrevInAEL;
+      else
+        prevE = e.PrevInAEL;
+    }
+    if (prevE !== null && prevE.OutIdx >= 0 && (ClipperLib.Clipper.TopX(prevE, pt.Y) == ClipperLib.Clipper.TopX(e, pt.Y)) && ClipperLib.ClipperBase.SlopesEqual(e, prevE, this.m_UseFullRange) && (e.WindDelta !== 0) && (prevE.WindDelta !== 0))
+    {
+      var outPt = this.AddOutPt(prevE, pt);
+      this.AddJoin(result, outPt, e.Top);
+    }
+    return result;
+  };
+  ClipperLib.Clipper.prototype.CreateOutRec = function ()
+  {
+    var result = new ClipperLib.OutRec();
+    result.Idx = -1;
+    result.IsHole = false;
+    result.IsOpen = false;
+    result.FirstLeft = null;
+    result.Pts = null;
+    result.BottomPt = null;
+    result.PolyNode = null;
+    this.m_PolyOuts.push(result);
+    result.Idx = this.m_PolyOuts.length - 1;
+    return result;
+  };
+  ClipperLib.Clipper.prototype.AddOutPt = function (e, pt)
+  {
+    var ToFront = (e.Side == ClipperLib.EdgeSide.esLeft);
+    if (e.OutIdx < 0)
+    {
+      var outRec = this.CreateOutRec();
+      outRec.IsOpen = (e.WindDelta === 0);
+      var newOp = new ClipperLib.OutPt();
+      outRec.Pts = newOp;
+      newOp.Idx = outRec.Idx;
+      //newOp.Pt = pt;
+      newOp.Pt.X = pt.X;
+      newOp.Pt.Y = pt.Y;
+			if(ClipperLib.use_xyz) newOp.Pt.Z = pt.Z;
+      newOp.Next = newOp;
+      newOp.Prev = newOp;
+      if (!outRec.IsOpen)
+        this.SetHoleState(e, outRec);
+      e.OutIdx = outRec.Idx;
+      //nb: do this after SetZ !
+      return newOp;
+    }
+    else
+    {
+      var outRec = this.m_PolyOuts[e.OutIdx];
+      //OutRec.Pts is the 'Left-most' point & OutRec.Pts.Prev is the 'Right-most'
+      var op = outRec.Pts;
+      if (ToFront && ClipperLib.IntPoint.op_Equality(pt, op.Pt))
+        return op;
+      else if (!ToFront && ClipperLib.IntPoint.op_Equality(pt, op.Prev.Pt))
+        return op.Prev;
+      var newOp = new ClipperLib.OutPt();
+      newOp.Idx = outRec.Idx;
+      //newOp.Pt = pt;
+      newOp.Pt.X = pt.X;
+      newOp.Pt.Y = pt.Y;
+      if(ClipperLib.use_xyz) newOp.Pt.Z = pt.Z;
+      newOp.Next = op;
+      newOp.Prev = op.Prev;
+      newOp.Prev.Next = newOp;
+      op.Prev = newOp;
+      if (ToFront)
+        outRec.Pts = newOp;
+      return newOp;
+    }
+  };
+  ClipperLib.Clipper.prototype.SwapPoints = function (pt1, pt2)
+  {
+    var tmp = new ClipperLib.IntPoint(pt1.Value);
+    //pt1.Value = pt2.Value;
+    pt1.Value.X = pt2.Value.X;
+    pt1.Value.Y = pt2.Value.Y;
+    if(ClipperLib.use_xyz) pt1.Value.Z = pt2.Value.Z;
+    //pt2.Value = tmp;
+    pt2.Value.X = tmp.X;
+    pt2.Value.Y = tmp.Y;
+		if(ClipperLib.use_xyz) pt2.Value.Z = tmp.Z;
+  };
+  ClipperLib.Clipper.prototype.HorzSegmentsOverlap = function (seg1a, seg1b, seg2a, seg2b)
+	{
+		var tmp;
+		if (seg1a > seg1b)
+		{
+			tmp = seg1a;
+			seg1a = seg1b;
+			seg1b = tmp;
+		}
+		if (seg2a > seg2b)
+		{
+			tmp = seg2a;
+			seg2a = seg2b;
+			seg2b = tmp;
+		}
+		return (seg1a < seg2b) && (seg2a < seg1b);
+	}
 
-// Generate a random function that is seeded with the given value.
-function generator(seed) {
-    // Note: the generator didn't work with negative seed values, so here we
-    // transform our original seed into a new (positive) seed value with which we
-    // create a new generator.
-    if (seed < 0) {
-        var gen = generator(Math.abs(seed));
-        for (var i = 0; i < 23; i += 1) {
-            gen();
+  ClipperLib.Clipper.prototype.SetHoleState = function (e, outRec)
+  {
+    var isHole = false;
+    var e2 = e.PrevInAEL;
+    while (e2 !== null)
+    {
+      if (e2.OutIdx >= 0 && e2.WindDelta != 0)
+      {
+        isHole = !isHole;
+        if (outRec.FirstLeft === null)
+          outRec.FirstLeft = this.m_PolyOuts[e2.OutIdx];
+      }
+      e2 = e2.PrevInAEL;
+    }
+    if (isHole)
+      outRec.IsHole = true;
+  };
+  ClipperLib.Clipper.prototype.GetDx = function (pt1, pt2)
+  {
+    if (pt1.Y == pt2.Y)
+      return ClipperLib.ClipperBase.horizontal;
+    else
+      return (pt2.X - pt1.X) / (pt2.Y - pt1.Y);
+  };
+  ClipperLib.Clipper.prototype.FirstIsBottomPt = function (btmPt1, btmPt2)
+  {
+    var p = btmPt1.Prev;
+    while ((ClipperLib.IntPoint.op_Equality(p.Pt, btmPt1.Pt)) && (p != btmPt1))
+      p = p.Prev;
+    var dx1p = Math.abs(this.GetDx(btmPt1.Pt, p.Pt));
+    p = btmPt1.Next;
+    while ((ClipperLib.IntPoint.op_Equality(p.Pt, btmPt1.Pt)) && (p != btmPt1))
+      p = p.Next;
+    var dx1n = Math.abs(this.GetDx(btmPt1.Pt, p.Pt));
+    p = btmPt2.Prev;
+    while ((ClipperLib.IntPoint.op_Equality(p.Pt, btmPt2.Pt)) && (p != btmPt2))
+      p = p.Prev;
+    var dx2p = Math.abs(this.GetDx(btmPt2.Pt, p.Pt));
+    p = btmPt2.Next;
+    while ((ClipperLib.IntPoint.op_Equality(p.Pt, btmPt2.Pt)) && (p != btmPt2))
+      p = p.Next;
+    var dx2n = Math.abs(this.GetDx(btmPt2.Pt, p.Pt));
+    return (dx1p >= dx2p && dx1p >= dx2n) || (dx1n >= dx2p && dx1n >= dx2n);
+  };
+  ClipperLib.Clipper.prototype.GetBottomPt = function (pp)
+  {
+    var dups = null;
+    var p = pp.Next;
+    while (p != pp)
+    {
+      if (p.Pt.Y > pp.Pt.Y)
+      {
+        pp = p;
+        dups = null;
+      }
+      else if (p.Pt.Y == pp.Pt.Y && p.Pt.X <= pp.Pt.X)
+      {
+        if (p.Pt.X < pp.Pt.X)
+        {
+          dups = null;
+          pp = p;
         }
-        return generator(gen(0, 10000));
+        else
+        {
+          if (p.Next != pp && p.Prev != pp)
+            dups = p;
+        }
+      }
+      p = p.Next;
     }
-
-    // Based on random number generator from
-    // http://indiegamr.com/generate-repeatable-random-numbers-in-js/
-    return function (min, max) {
-        min = min || 0;
-        max = max || 1;
-        seed = (seed * 9301 + 49297) % 233280;
-        var v = seed / 233280;
-        return min + v * (max - min);
-    };
-}
-
-exports.generator = generator;
-
-},{}],44:[function(require,module,exports){
-// SVG Parser
-
-// The SVG engine uses code from the following libraries:
-// - for parsing the main svg tree: two.js - http://jonobr1.github.io/two.js/
-// - for constructing individual paths: canvg - https://code.google.com/p/canvg/
-// - for constructing arcs: fabric.js - http://fabricjs.com
-
-'use strict';
-
-var _ = require('lodash');
-var xmldom = require('xmldom');
-
-var Color = require('../objects/color');
-var Group = require('../objects/group');
-var Path = require('../objects/path');
-var Point = require('../objects/point');
-var Transform = require('../objects/transform');
-
-// var getReflection = function (a, b, relative) {
-//     var theta,
-//         d = geo.distance(a.x, a.y, b.x, b.y);
-
-//     if (d <= 0.0001) {
-//         return relative ? Point.ZERO : a;
-//     }
-//     theta = geo.angle(a.x, a.y, b.x, b.y);
-//     return new Point(
-//         d * Math.cos(theta) + (relative ? 0 : a.x),
-//         d * Math.sin(theta) + (relative ? 0 : a.y)
-//     );
-// };
-
-var trim = function (s) {
-    return s.replace(/^\s+|\s+$/g, '');
-};
-
-var compressSpaces = function (s) {
-    return s.replace(/[\s\r\t\n]+/gm, ' ');
-};
-
-var toNumberArray = function (s) {
-    var i,
-        a = trim(compressSpaces((s || '').replace(/,/g, ' '))).split(' ');
-    for (i = 0; i < a.length; i += 1) {
-        a[i] = parseFloat(a[i]);
+    if (dups !== null)
+    {
+      //there appears to be at least 2 vertices at bottomPt so ...
+      while (dups != p)
+      {
+        if (!this.FirstIsBottomPt(p, dups))
+          pp = dups;
+        dups = dups.Next;
+        while (ClipperLib.IntPoint.op_Inequality(dups.Pt, pp.Pt))
+          dups = dups.Next;
+      }
     }
-    return a;
-};
-
-var readSvgAttributes = function (node, parentAttributes) {
-    var fill, fillOpacity, stroke, strokeOpacity, strokeWidth, opacity, color, transforms, types, transform, i, attributes;
-
-    if (parentAttributes) {
-        attributes = Object.create(parentAttributes);
-    } else {
-        attributes = {};
+    return pp;
+  };
+  ClipperLib.Clipper.prototype.GetLowermostRec = function (outRec1, outRec2)
+  {
+    //work out which polygon fragment has the correct hole state ...
+    if (outRec1.BottomPt === null)
+      outRec1.BottomPt = this.GetBottomPt(outRec1.Pts);
+    if (outRec2.BottomPt === null)
+      outRec2.BottomPt = this.GetBottomPt(outRec2.Pts);
+    var bPt1 = outRec1.BottomPt;
+    var bPt2 = outRec2.BottomPt;
+    if (bPt1.Pt.Y > bPt2.Pt.Y)
+      return outRec1;
+    else if (bPt1.Pt.Y < bPt2.Pt.Y)
+      return outRec2;
+    else if (bPt1.Pt.X < bPt2.Pt.X)
+      return outRec1;
+    else if (bPt1.Pt.X > bPt2.Pt.X)
+      return outRec2;
+    else if (bPt1.Next == bPt1)
+      return outRec2;
+    else if (bPt2.Next == bPt2)
+      return outRec1;
+    else if (this.FirstIsBottomPt(bPt1, bPt2))
+      return outRec1;
+    else
+      return outRec2;
+  };
+  ClipperLib.Clipper.prototype.Param1RightOfParam2 = function (outRec1, outRec2)
+  {
+    do {
+      outRec1 = outRec1.FirstLeft;
+      if (outRec1 == outRec2)
+        return true;
     }
-
-    transforms = [];
-    types = {};
-
-    types.translate = function (s) {
-        var a = toNumberArray(s),
-            tx = a[0],
-            ty = a[1] || 0;
-        return new Transform().translate(tx, ty);
-    };
-
-    types.scale = function (s) {
-        var a = toNumberArray(s),
-            sx = a[0],
-            sy = a[1] || sx;
-        return new Transform().scale(sx, sy);
-    };
-
-    types.rotate = function (s) {
-        var t,
-            a = toNumberArray(s),
-            r = a[0],
-            tx = a[1] || 0,
-            ty = a[2] || 0;
-        t = new Transform();
-        t = t.translate(tx, ty);
-        t = t.rotate(r);
-        t = t.translate(-tx, -ty);
-        return t;
-    };
-
-    types.matrix = function (s) {
-        var m = toNumberArray(s);
-        return new Transform([m[0], m[1], 0, m[2], m[3], 0, m[4], m[5], 1]);
-    };
-
-    _.each(node.attributes, function (v) {
-        var property, data, type, s, d;
-        property = v.nodeName;
-
-        switch (property) {
-        case 'transform':
-            data = trim(compressSpaces(v.nodeValue)).replace(/\)(\s?,\s?)/g, ') ').split(/\s(?=[a-z])/);
-            for (i = 0; i < data.length; i += 1) {
-                type = trim(data[i].split('(')[0]);
-                s = data[i].split('(')[1].replace(')', '');
-                transform = types[type](s);
-                transforms.push(transform);
-            }
-            break;
-        case 'visibility':
-//          elem.visible = !!v.nodeValue;
-            break;
-        case 'stroke-linecap':
-//          elem.cap = v.nodeValue;
-            break;
-        case 'stroke-linejoin':
-//          elem.join = v.nodeValue;
-            break;
-        case 'stroke-miterlimit':
-//          elem.miter = v.nodeValue;
-            break;
-        case 'stroke-width':
-            strokeWidth = parseFloat(v.nodeValue);
-            break;
-        case 'stroke-opacity':
-            strokeOpacity = parseFloat(v.nodeValue);
-            break;
-        case 'fill-opacity':
-            fillOpacity = parseFloat(v.nodeValue);
-            break;
-        case 'fill':
-            fill = v.nodeValue;
-            break;
-        case 'stroke':
-            stroke = v.nodeValue;
-            break;
-        case 'opacity':
-            opacity = parseFloat(v.nodeValue);
-            break;
-        case 'color':
-            color = v.nodeValue;
-            break;
-        case 'style':
-            d = {};
-            _.each(v.nodeValue.split(';'), function (s) {
-                var el = s.split(':');
-                d[el[0].trim()] = el[1];
-            });
-            if (d.fill) {
-                fill = d.fill;
-            }
-            if (d.stroke) {
-                stroke = d.stroke;
-            }
-            if (d['stroke-width'] !== undefined) {
-                strokeWidth = parseFloat(d['stroke-width']);
-            }
-            if (d['stroke-opacity'] !== undefined) {
-                strokeOpacity = parseFloat(d['stroke-opacity']);
-            }
-            if (d['fill-opacity'] !== undefined) {
-                fillOpacity = parseFloat(d['fill-opacity']);
-            }
-            if (d.opacity !== undefined) {
-                opacity = parseFloat(d.opacity);
+    while (outRec1 !== null)
+    return false;
+  };
+  ClipperLib.Clipper.prototype.GetOutRec = function (idx)
+  {
+    var outrec = this.m_PolyOuts[idx];
+    while (outrec != this.m_PolyOuts[outrec.Idx])
+      outrec = this.m_PolyOuts[outrec.Idx];
+    return outrec;
+  };
+  ClipperLib.Clipper.prototype.AppendPolygon = function (e1, e2)
+  {
+    //get the start and ends of both output polygons ...
+    var outRec1 = this.m_PolyOuts[e1.OutIdx];
+    var outRec2 = this.m_PolyOuts[e2.OutIdx];
+    var holeStateRec;
+    if (this.Param1RightOfParam2(outRec1, outRec2))
+      holeStateRec = outRec2;
+    else if (this.Param1RightOfParam2(outRec2, outRec1))
+      holeStateRec = outRec1;
+    else
+      holeStateRec = this.GetLowermostRec(outRec1, outRec2);
+    var p1_lft = outRec1.Pts;
+    var p1_rt = p1_lft.Prev;
+    var p2_lft = outRec2.Pts;
+    var p2_rt = p2_lft.Prev;
+    var side;
+    //join e2 poly onto e1 poly and delete pointers to e2 ...
+    if (e1.Side == ClipperLib.EdgeSide.esLeft)
+    {
+      if (e2.Side == ClipperLib.EdgeSide.esLeft)
+      {
+        //z y x a b c
+        this.ReversePolyPtLinks(p2_lft);
+        p2_lft.Next = p1_lft;
+        p1_lft.Prev = p2_lft;
+        p1_rt.Next = p2_rt;
+        p2_rt.Prev = p1_rt;
+        outRec1.Pts = p2_rt;
+      }
+      else
+      {
+        //x y z a b c
+        p2_rt.Next = p1_lft;
+        p1_lft.Prev = p2_rt;
+        p2_lft.Prev = p1_rt;
+        p1_rt.Next = p2_lft;
+        outRec1.Pts = p2_lft;
+      }
+      side = ClipperLib.EdgeSide.esLeft;
+    }
+    else
+    {
+      if (e2.Side == ClipperLib.EdgeSide.esRight)
+      {
+        //a b c z y x
+        this.ReversePolyPtLinks(p2_lft);
+        p1_rt.Next = p2_rt;
+        p2_rt.Prev = p1_rt;
+        p2_lft.Next = p1_lft;
+        p1_lft.Prev = p2_lft;
+      }
+      else
+      {
+        //a b c x y z
+        p1_rt.Next = p2_lft;
+        p2_lft.Prev = p1_rt;
+        p1_lft.Prev = p2_rt;
+        p2_rt.Next = p1_lft;
+      }
+      side = ClipperLib.EdgeSide.esRight;
+    }
+    outRec1.BottomPt = null;
+    if (holeStateRec == outRec2)
+    {
+      if (outRec2.FirstLeft != outRec1)
+        outRec1.FirstLeft = outRec2.FirstLeft;
+      outRec1.IsHole = outRec2.IsHole;
+    }
+    outRec2.Pts = null;
+    outRec2.BottomPt = null;
+    outRec2.FirstLeft = outRec1;
+    var OKIdx = e1.OutIdx;
+    var ObsoleteIdx = e2.OutIdx;
+    e1.OutIdx = -1;
+    //nb: safe because we only get here via AddLocalMaxPoly
+    e2.OutIdx = -1;
+    var e = this.m_ActiveEdges;
+    while (e !== null)
+    {
+      if (e.OutIdx == ObsoleteIdx)
+      {
+        e.OutIdx = OKIdx;
+        e.Side = side;
+        break;
+      }
+      e = e.NextInAEL;
+    }
+    outRec2.Idx = outRec1.Idx;
+  };
+  ClipperLib.Clipper.prototype.ReversePolyPtLinks = function (pp)
+  {
+    if (pp === null)
+      return;
+    var pp1;
+    var pp2;
+    pp1 = pp;
+    do {
+      pp2 = pp1.Next;
+      pp1.Next = pp1.Prev;
+      pp1.Prev = pp2;
+      pp1 = pp2;
+    }
+    while (pp1 != pp)
+  };
+  ClipperLib.Clipper.SwapSides = function (edge1, edge2)
+  {
+    var side = edge1.Side;
+    edge1.Side = edge2.Side;
+    edge2.Side = side;
+  };
+  ClipperLib.Clipper.SwapPolyIndexes = function (edge1, edge2)
+  {
+    var outIdx = edge1.OutIdx;
+    edge1.OutIdx = edge2.OutIdx;
+    edge2.OutIdx = outIdx;
+  };
+  ClipperLib.Clipper.prototype.IntersectEdges = function (e1, e2, pt)
+  {
+    //e1 will be to the left of e2 BELOW the intersection. Therefore e1 is before
+    //e2 in AEL except when e1 is being inserted at the intersection point ...
+    var e1Contributing = (e1.OutIdx >= 0);
+    var e2Contributing = (e2.OutIdx >= 0);
+
+    if (ClipperLib.use_xyz)
+    	this.SetZ(pt, e1, e2);
+
+    if (ClipperLib.use_lines)
+    {
+      //if either edge is on an OPEN path ...
+      if (e1.WindDelta === 0 || e2.WindDelta === 0)
+      {
+        //ignore subject-subject open path intersections UNLESS they
+        //are both open paths, AND they are both 'contributing maximas' ...
+				if (e1.WindDelta == 0 && e2.WindDelta == 0) return;
+        //if intersecting a subj line with a subj poly ...
+        else if (e1.PolyTyp == e2.PolyTyp &&
+          e1.WindDelta != e2.WindDelta && this.m_ClipType == ClipperLib.ClipType.ctUnion)
+        {
+          if (e1.WindDelta === 0)
+          {
+            if (e2Contributing)
+            {
+              this.AddOutPt(e1, pt);
+              if (e1Contributing)
+                e1.OutIdx = -1;
             }
-            if (d.color) {
-                color = d.color;
+          }
+          else
+          {
+            if (e1Contributing)
+            {
+              this.AddOutPt(e2, pt);
+              if (e2Contributing)
+                e2.OutIdx = -1;
             }
-            break;
+          }
         }
-    });
-
-    if (fill !== undefined) {
-        attributes.fill = fill;
+        else if (e1.PolyTyp != e2.PolyTyp)
+        {
+          if ((e1.WindDelta === 0) && Math.abs(e2.WindCnt) == 1 &&
+            (this.m_ClipType != ClipperLib.ClipType.ctUnion || e2.WindCnt2 === 0))
+          {
+            this.AddOutPt(e1, pt);
+            if (e1Contributing)
+              e1.OutIdx = -1;
+          }
+          else if ((e2.WindDelta === 0) && (Math.abs(e1.WindCnt) == 1) &&
+            (this.m_ClipType != ClipperLib.ClipType.ctUnion || e1.WindCnt2 === 0))
+          {
+            this.AddOutPt(e2, pt);
+            if (e2Contributing)
+              e2.OutIdx = -1;
+          }
+        }
+        return;
+      }
     }
-    if (stroke !== undefined) {
-        attributes.stroke = stroke;
+    //update winding counts...
+    //assumes that e1 will be to the Right of e2 ABOVE the intersection
+    if (e1.PolyTyp == e2.PolyTyp)
+    {
+      if (this.IsEvenOddFillType(e1))
+      {
+        var oldE1WindCnt = e1.WindCnt;
+        e1.WindCnt = e2.WindCnt;
+        e2.WindCnt = oldE1WindCnt;
+      }
+      else
+      {
+        if (e1.WindCnt + e2.WindDelta === 0)
+          e1.WindCnt = -e1.WindCnt;
+        else
+          e1.WindCnt += e2.WindDelta;
+        if (e2.WindCnt - e1.WindDelta === 0)
+          e2.WindCnt = -e2.WindCnt;
+        else
+          e2.WindCnt -= e1.WindDelta;
+      }
     }
-    if (fillOpacity !== undefined) {
-        attributes.fillOpacity = fillOpacity;
+    else
+    {
+      if (!this.IsEvenOddFillType(e2))
+        e1.WindCnt2 += e2.WindDelta;
+      else
+        e1.WindCnt2 = (e1.WindCnt2 === 0) ? 1 : 0;
+      if (!this.IsEvenOddFillType(e1))
+        e2.WindCnt2 -= e1.WindDelta;
+      else
+        e2.WindCnt2 = (e2.WindCnt2 === 0) ? 1 : 0;
     }
-    if (strokeOpacity !== undefined) {
-        attributes.strokeOpacity = strokeOpacity;
+    var e1FillType, e2FillType, e1FillType2, e2FillType2;
+    if (e1.PolyTyp == ClipperLib.PolyType.ptSubject)
+    {
+      e1FillType = this.m_SubjFillType;
+      e1FillType2 = this.m_ClipFillType;
     }
-    if (strokeWidth !== undefined) {
-        attributes.strokeWidth = strokeWidth;
+    else
+    {
+      e1FillType = this.m_ClipFillType;
+      e1FillType2 = this.m_SubjFillType;
     }
-    if (opacity !== undefined) {
-        attributes.opacity = opacity;
+    if (e2.PolyTyp == ClipperLib.PolyType.ptSubject)
+    {
+      e2FillType = this.m_SubjFillType;
+      e2FillType2 = this.m_ClipFillType;
     }
-    if (color !== undefined && color !== 'currentColor') {
-        attributes.color = color;
+    else
+    {
+      e2FillType = this.m_ClipFillType;
+      e2FillType2 = this.m_SubjFillType;
     }
-    if (transforms.length > 0) {
-        transform = new Transform();
-        for (i = 0; i < transforms.length; i += 1) {
-            transform = transform.append(transforms[i]);
-        }
-        if (!transform.isIdentity()) {
-            if (attributes.transform) {
-                attributes.transform = attributes.transform.append(transform);
-            } else {
-                attributes.transform = transform;
-            }
+    var e1Wc, e2Wc;
+    switch (e1FillType)
+    {
+    case ClipperLib.PolyFillType.pftPositive:
+      e1Wc = e1.WindCnt;
+      break;
+    case ClipperLib.PolyFillType.pftNegative:
+      e1Wc = -e1.WindCnt;
+      break;
+    default:
+      e1Wc = Math.abs(e1.WindCnt);
+      break;
+    }
+    switch (e2FillType)
+    {
+    case ClipperLib.PolyFillType.pftPositive:
+      e2Wc = e2.WindCnt;
+      break;
+    case ClipperLib.PolyFillType.pftNegative:
+      e2Wc = -e2.WindCnt;
+      break;
+    default:
+      e2Wc = Math.abs(e2.WindCnt);
+      break;
+    }
+    if (e1Contributing && e2Contributing)
+    {
+			if ((e1Wc != 0 && e1Wc != 1) || (e2Wc != 0 && e2Wc != 1) ||
+			(e1.PolyTyp != e2.PolyTyp && this.m_ClipType != ClipperLib.ClipType.ctXor))
+			{
+				this.AddLocalMaxPoly(e1, e2, pt);
+			}
+      else
+      {
+        this.AddOutPt(e1, pt);
+        this.AddOutPt(e2, pt);
+        ClipperLib.Clipper.SwapSides(e1, e2);
+        ClipperLib.Clipper.SwapPolyIndexes(e1, e2);
+      }
+    }
+    else if (e1Contributing)
+    {
+      if (e2Wc === 0 || e2Wc == 1)
+      {
+        this.AddOutPt(e1, pt);
+        ClipperLib.Clipper.SwapSides(e1, e2);
+        ClipperLib.Clipper.SwapPolyIndexes(e1, e2);
+      }
+    }
+    else if (e2Contributing)
+    {
+      if (e1Wc === 0 || e1Wc == 1)
+      {
+        this.AddOutPt(e2, pt);
+        ClipperLib.Clipper.SwapSides(e1, e2);
+        ClipperLib.Clipper.SwapPolyIndexes(e1, e2);
+      }
+    }
+		else if ( (e1Wc == 0 || e1Wc == 1) && (e2Wc == 0 || e2Wc == 1))
+    {
+      //neither edge is currently contributing ...
+      var e1Wc2, e2Wc2;
+      switch (e1FillType2)
+      {
+      case ClipperLib.PolyFillType.pftPositive:
+        e1Wc2 = e1.WindCnt2;
+        break;
+      case ClipperLib.PolyFillType.pftNegative:
+        e1Wc2 = -e1.WindCnt2;
+        break;
+      default:
+        e1Wc2 = Math.abs(e1.WindCnt2);
+        break;
+      }
+      switch (e2FillType2)
+      {
+      case ClipperLib.PolyFillType.pftPositive:
+        e2Wc2 = e2.WindCnt2;
+        break;
+      case ClipperLib.PolyFillType.pftNegative:
+        e2Wc2 = -e2.WindCnt2;
+        break;
+      default:
+        e2Wc2 = Math.abs(e2.WindCnt2);
+        break;
+      }
+      if (e1.PolyTyp != e2.PolyTyp)
+      {
+        this.AddLocalMinPoly(e1, e2, pt);
+      }
+      else if (e1Wc == 1 && e2Wc == 1)
+        switch (this.m_ClipType)
+        {
+        case ClipperLib.ClipType.ctIntersection:
+          if (e1Wc2 > 0 && e2Wc2 > 0)
+            this.AddLocalMinPoly(e1, e2, pt);
+          break;
+        case ClipperLib.ClipType.ctUnion:
+          if (e1Wc2 <= 0 && e2Wc2 <= 0)
+            this.AddLocalMinPoly(e1, e2, pt);
+          break;
+        case ClipperLib.ClipType.ctDifference:
+          if (((e1.PolyTyp == ClipperLib.PolyType.ptClip) && (e1Wc2 > 0) && (e2Wc2 > 0)) ||
+            ((e1.PolyTyp == ClipperLib.PolyType.ptSubject) && (e1Wc2 <= 0) && (e2Wc2 <= 0)))
+            this.AddLocalMinPoly(e1, e2, pt);
+          break;
+        case ClipperLib.ClipType.ctXor:
+          this.AddLocalMinPoly(e1, e2, pt);
+          break;
         }
+      else
+        ClipperLib.Clipper.SwapSides(e1, e2);
     }
-    return attributes;
-};
-
-var applySvgAttributes = function (shape, attributes) {
-    var fill = attributes.fill;
-    if (shape.commands && shape.commands.length > 0 && fill === undefined) {
-        fill = 'black';
+  };
+  ClipperLib.Clipper.prototype.DeleteFromAEL = function (e)
+  {
+    var AelPrev = e.PrevInAEL;
+    var AelNext = e.NextInAEL;
+    if (AelPrev === null && AelNext === null && (e != this.m_ActiveEdges))
+      return;
+    //already deleted
+    if (AelPrev !== null)
+      AelPrev.NextInAEL = AelNext;
+    else
+      this.m_ActiveEdges = AelNext;
+    if (AelNext !== null)
+      AelNext.PrevInAEL = AelPrev;
+    e.NextInAEL = null;
+    e.PrevInAEL = null;
+  };
+  ClipperLib.Clipper.prototype.DeleteFromSEL = function (e)
+  {
+    var SelPrev = e.PrevInSEL;
+    var SelNext = e.NextInSEL;
+    if (SelPrev === null && SelNext === null && (e != this.m_SortedEdges))
+      return;
+    //already deleted
+    if (SelPrev !== null)
+      SelPrev.NextInSEL = SelNext;
+    else
+      this.m_SortedEdges = SelNext;
+    if (SelNext !== null)
+      SelNext.PrevInSEL = SelPrev;
+    e.NextInSEL = null;
+    e.PrevInSEL = null;
+  };
+  ClipperLib.Clipper.prototype.UpdateEdgeIntoAEL = function (e)
+  {
+    if (e.NextInLML === null)
+      ClipperLib.Error("UpdateEdgeIntoAEL: invalid call");
+    var AelPrev = e.PrevInAEL;
+    var AelNext = e.NextInAEL;
+    e.NextInLML.OutIdx = e.OutIdx;
+    if (AelPrev !== null)
+      AelPrev.NextInAEL = e.NextInLML;
+    else
+      this.m_ActiveEdges = e.NextInLML;
+    if (AelNext !== null)
+      AelNext.PrevInAEL = e.NextInLML;
+    e.NextInLML.Side = e.Side;
+    e.NextInLML.WindDelta = e.WindDelta;
+    e.NextInLML.WindCnt = e.WindCnt;
+    e.NextInLML.WindCnt2 = e.WindCnt2;
+    e = e.NextInLML;
+    //    e.Curr = e.Bot;
+    e.Curr.X = e.Bot.X;
+    e.Curr.Y = e.Bot.Y;
+		if(ClipperLib.use_xyz) e.Curr.Z = e.Bot.Z;
+    e.PrevInAEL = AelPrev;
+    e.NextInAEL = AelNext;
+    if (!ClipperLib.ClipperBase.IsHorizontal(e))
+      this.InsertScanbeam(e.Top.Y);
+    return e;
+  };
+  ClipperLib.Clipper.prototype.ProcessHorizontals = function (isTopOfScanbeam)
+  {
+    var horzEdge = this.m_SortedEdges;
+    while (horzEdge !== null)
+    {
+      this.DeleteFromSEL(horzEdge);
+      this.ProcessHorizontal(horzEdge, isTopOfScanbeam);
+      horzEdge = this.m_SortedEdges;
     }
-    var fillOpacity = attributes.fillOpacity;
-    var stroke = attributes.stroke;
-    var strokeOpacity = attributes.strokeOpacity;
-    var opacity = attributes.opacity;
-    var strokeWidth = attributes.strokeWidth;
-    var transform = attributes.transform;
-    var color = attributes.color;
+  };
+  ClipperLib.Clipper.prototype.GetHorzDirection = function (HorzEdge, $var)
+  {
+    if (HorzEdge.Bot.X < HorzEdge.Top.X)
+    {
+        $var.Left = HorzEdge.Bot.X;
+        $var.Right = HorzEdge.Top.X;
+        $var.Dir = ClipperLib.Direction.dLeftToRight;
+    }
+    else
+    {
+        $var.Left = HorzEdge.Top.X;
+        $var.Right = HorzEdge.Bot.X;
+        $var.Dir = ClipperLib.Direction.dRightToLeft;
+    }
+  };
+  ClipperLib.Clipper.prototype.ProcessHorizontal = function (horzEdge, isTopOfScanbeam)
+  {
+    var $var = {Dir: null, Left: null, Right: null};
+    this.GetHorzDirection(horzEdge, $var);
+    var dir = $var.Dir;
+    var horzLeft = $var.Left;
+    var horzRight = $var.Right;
+
+    var eLastHorz = horzEdge,
+      eMaxPair = null;
+    while (eLastHorz.NextInLML !== null && ClipperLib.ClipperBase.IsHorizontal(eLastHorz.NextInLML))
+      eLastHorz = eLastHorz.NextInLML;
+    if (eLastHorz.NextInLML === null)
+      eMaxPair = this.GetMaximaPair(eLastHorz);
+    for (;;)
+    {
+      var IsLastHorz = (horzEdge == eLastHorz);
+      var e = this.GetNextInAEL(horzEdge, dir);
+      while (e !== null)
+      {
+        //Break if we've got to the end of an intermediate horizontal edge ...
+        //nb: Smaller Dx's are to the right of larger Dx's ABOVE the horizontal.
+        if (e.Curr.X == horzEdge.Top.X && horzEdge.NextInLML !== null && e.Dx < horzEdge.NextInLML.Dx)
+          break;
+        var eNext = this.GetNextInAEL(e, dir);
+        //saves eNext for later
+        if ((dir == ClipperLib.Direction.dLeftToRight && e.Curr.X <= horzRight) || (dir == ClipperLib.Direction.dRightToLeft && e.Curr.X >= horzLeft))
+        {
+          //so far we're still in range of the horizontal Edge  but make sure
+          //we're at the last of consec. horizontals when matching with eMaxPair
+          if (e == eMaxPair && IsLastHorz)
+          {
+						if (horzEdge.OutIdx >= 0)
+						{
+							var op1 = this.AddOutPt(horzEdge, horzEdge.Top);
+							var eNextHorz = this.m_SortedEdges;
+							while (eNextHorz !== null)
+							{
+								if (eNextHorz.OutIdx >= 0 &&
+									this.HorzSegmentsOverlap(horzEdge.Bot.X,
+									horzEdge.Top.X, eNextHorz.Bot.X, eNextHorz.Top.X))
+								{
+									var op2 = this.AddOutPt(eNextHorz, eNextHorz.Bot);
+									this.AddJoin(op2, op1, eNextHorz.Top);
+								}
+								eNextHorz = eNextHorz.NextInSEL;
+							}
+							this.AddGhostJoin(op1, horzEdge.Bot);
+							this.AddLocalMaxPoly(horzEdge, eMaxPair, horzEdge.Top);
+						}
+						this.DeleteFromAEL(horzEdge);
+						this.DeleteFromAEL(eMaxPair);
+            return;
+          }
+          else if (dir == ClipperLib.Direction.dLeftToRight)
+          {
+            var Pt = new ClipperLib.IntPoint(e.Curr.X, horzEdge.Curr.Y);
+            this.IntersectEdges(horzEdge, e, Pt);
+          }
+          else
+          {
+            var Pt = new ClipperLib.IntPoint(e.Curr.X, horzEdge.Curr.Y);
+            this.IntersectEdges(e, horzEdge, Pt);
+          }
+          this.SwapPositionsInAEL(horzEdge, e);
+        }
+        else if ((dir == ClipperLib.Direction.dLeftToRight && e.Curr.X >= horzRight) || (dir == ClipperLib.Direction.dRightToLeft && e.Curr.X <= horzLeft))
+          break;
+        e = eNext;
+      }
+      //end while
+      if (horzEdge.NextInLML !== null && ClipperLib.ClipperBase.IsHorizontal(horzEdge.NextInLML))
+      {
+        horzEdge = this.UpdateEdgeIntoAEL(horzEdge);
+        if (horzEdge.OutIdx >= 0)
+          this.AddOutPt(horzEdge, horzEdge.Bot);
 
-    if (fill === 'currentColor') {
-        fill = color === undefined ? 'black' : color;
+          var $var = {Dir: dir, Left: horzLeft, Right: horzRight};
+          this.GetHorzDirection(horzEdge, $var);
+          dir = $var.Dir;
+          horzLeft = $var.Left;
+          horzRight = $var.Right;
+      }
+      else
+        break;
     }
-    if (fill !== undefined) {
-        fill = Color.parse(fill);
-        if (fillOpacity !== undefined) {
-            fill.a *= fillOpacity;
+    //end for (;;)
+    if (horzEdge.NextInLML !== null)
+    {
+      if (horzEdge.OutIdx >= 0)
+      {
+        var op1 = this.AddOutPt(horzEdge, horzEdge.Top);
+				if (isTopOfScanbeam) this.AddGhostJoin(op1, horzEdge.Bot);
+        horzEdge = this.UpdateEdgeIntoAEL(horzEdge);
+        if (horzEdge.WindDelta === 0)
+          return;
+        //nb: HorzEdge is no longer horizontal here
+        var ePrev = horzEdge.PrevInAEL;
+        var eNext = horzEdge.NextInAEL;
+        if (ePrev !== null && ePrev.Curr.X == horzEdge.Bot.X &&
+          ePrev.Curr.Y == horzEdge.Bot.Y && ePrev.WindDelta !== 0 &&
+          (ePrev.OutIdx >= 0 && ePrev.Curr.Y > ePrev.Top.Y &&
+            ClipperLib.ClipperBase.SlopesEqual(horzEdge, ePrev, this.m_UseFullRange)))
+        {
+          var op2 = this.AddOutPt(ePrev, horzEdge.Bot);
+          this.AddJoin(op1, op2, horzEdge.Top);
         }
-        if (opacity !== undefined) {
-            fill.a *= opacity;
+        else if (eNext !== null && eNext.Curr.X == horzEdge.Bot.X &&
+          eNext.Curr.Y == horzEdge.Bot.Y && eNext.WindDelta !== 0 &&
+          eNext.OutIdx >= 0 && eNext.Curr.Y > eNext.Top.Y &&
+          ClipperLib.ClipperBase.SlopesEqual(horzEdge, eNext, this.m_UseFullRange))
+        {
+          var op2 = this.AddOutPt(eNext, horzEdge.Bot);
+          this.AddJoin(op1, op2, horzEdge.Top);
+        }
+      }
+      else horzEdge = this.UpdateEdgeIntoAEL(horzEdge);
+    }
+  	else
+    {
+      if (horzEdge.OutIdx >= 0)
+        this.AddOutPt(horzEdge, horzEdge.Top);
+      this.DeleteFromAEL(horzEdge);
+    }
+  };
+  ClipperLib.Clipper.prototype.GetNextInAEL = function (e, Direction)
+  {
+    return Direction == ClipperLib.Direction.dLeftToRight ? e.NextInAEL : e.PrevInAEL;
+  };
+  ClipperLib.Clipper.prototype.IsMinima = function (e)
+  {
+    return e !== null && (e.Prev.NextInLML != e) && (e.Next.NextInLML != e);
+  };
+  ClipperLib.Clipper.prototype.IsMaxima = function (e, Y)
+  {
+    return (e !== null && e.Top.Y == Y && e.NextInLML === null);
+  };
+  ClipperLib.Clipper.prototype.IsIntermediate = function (e, Y)
+  {
+    return (e.Top.Y == Y && e.NextInLML !== null);
+  };
+  ClipperLib.Clipper.prototype.GetMaximaPair = function (e)
+  {
+    var result = null;
+    if ((ClipperLib.IntPoint.op_Equality(e.Next.Top, e.Top)) && e.Next.NextInLML === null)
+      result = e.Next;
+    else if ((ClipperLib.IntPoint.op_Equality(e.Prev.Top, e.Top)) && e.Prev.NextInLML === null)
+      result = e.Prev;
+    if (result !== null && (result.OutIdx == -2 || (result.NextInAEL == result.PrevInAEL && !ClipperLib.ClipperBase.IsHorizontal(result))))
+      return null;
+    return result;
+  };
+
+  ClipperLib.Clipper.prototype.ProcessIntersections = function (topY)
+  {
+    if (this.m_ActiveEdges == null)
+      return true;
+    try
+    {
+      this.BuildIntersectList(topY);
+      if (this.m_IntersectList.length == 0)
+        return true;
+      if (this.m_IntersectList.length == 1 || this.FixupIntersectionOrder())
+        this.ProcessIntersectList();
+      else
+        return false;
+    }
+    catch ($$e2)
+    {
+      this.m_SortedEdges = null;
+      this.m_IntersectList.length = 0;
+      ClipperLib.Error("ProcessIntersections error");
+    }
+    this.m_SortedEdges = null;
+    return true;
+  };
+  ClipperLib.Clipper.prototype.BuildIntersectList = function (topY)
+  {
+    if (this.m_ActiveEdges === null)
+      return;
+    //prepare for sorting ...
+    var e = this.m_ActiveEdges;
+    //console.log(JSON.stringify(JSON.decycle( e )));
+    this.m_SortedEdges = e;
+    while (e !== null)
+    {
+      e.PrevInSEL = e.PrevInAEL;
+      e.NextInSEL = e.NextInAEL;
+      e.Curr.X = ClipperLib.Clipper.TopX(e, topY);
+      e = e.NextInAEL;
+    }
+    //bubblesort ...
+    var isModified = true;
+    while (isModified && this.m_SortedEdges !== null)
+    {
+      isModified = false;
+      e = this.m_SortedEdges;
+      while (e.NextInSEL !== null)
+      {
+        var eNext = e.NextInSEL;
+        var pt = new ClipperLib.IntPoint();
+        //console.log("e.Curr.X: " + e.Curr.X + " eNext.Curr.X" + eNext.Curr.X);
+        if (e.Curr.X > eNext.Curr.X)
+        {
+					this.IntersectPoint(e, eNext, pt);
+          var newNode = new ClipperLib.IntersectNode();
+          newNode.Edge1 = e;
+          newNode.Edge2 = eNext;
+          //newNode.Pt = pt;
+          newNode.Pt.X = pt.X;
+          newNode.Pt.Y = pt.Y;
+          if(ClipperLib.use_xyz) newNode.Pt.Z = pt.Z;
+          this.m_IntersectList.push(newNode);
+          this.SwapPositionsInSEL(e, eNext);
+          isModified = true;
         }
+        else
+          e = eNext;
+      }
+      if (e.PrevInSEL !== null)
+        e.PrevInSEL.NextInSEL = null;
+      else
+        break;
     }
-
-    if (stroke === 'currentColor') {
-        stroke = color === undefined ? 'black' : color;
+    this.m_SortedEdges = null;
+  };
+  ClipperLib.Clipper.prototype.EdgesAdjacent = function (inode)
+  {
+    return (inode.Edge1.NextInSEL == inode.Edge2) || (inode.Edge1.PrevInSEL == inode.Edge2);
+  };
+  ClipperLib.Clipper.IntersectNodeSort = function (node1, node2)
+  {
+    //the following typecast is safe because the differences in Pt.Y will
+    //be limited to the height of the scanbeam.
+    return (node2.Pt.Y - node1.Pt.Y);
+  };
+  ClipperLib.Clipper.prototype.FixupIntersectionOrder = function ()
+  {
+    //pre-condition: intersections are sorted bottom-most first.
+    //Now it's crucial that intersections are made only between adjacent edges,
+    //so to ensure this the order of intersections may need adjusting ...
+    this.m_IntersectList.sort(this.m_IntersectNodeComparer);
+    this.CopyAELToSEL();
+    var cnt = this.m_IntersectList.length;
+    for (var i = 0; i < cnt; i++)
+    {
+      if (!this.EdgesAdjacent(this.m_IntersectList[i]))
+      {
+        var j = i + 1;
+        while (j < cnt && !this.EdgesAdjacent(this.m_IntersectList[j]))
+          j++;
+        if (j == cnt)
+          return false;
+        var tmp = this.m_IntersectList[i];
+        this.m_IntersectList[i] = this.m_IntersectList[j];
+        this.m_IntersectList[j] = tmp;
+      }
+      this.SwapPositionsInSEL(this.m_IntersectList[i].Edge1, this.m_IntersectList[i].Edge2);
     }
-    if (stroke !== undefined) {
-        stroke = Color.parse(stroke);
-        if (strokeOpacity !== undefined) {
-            stroke.a *= strokeOpacity;
-        }
-        if (opacity !== undefined) {
-            stroke.a *= opacity;
-        }
+    return true;
+  };
+  ClipperLib.Clipper.prototype.ProcessIntersectList = function ()
+  {
+    for (var i = 0, ilen = this.m_IntersectList.length; i < ilen; i++)
+    {
+      var iNode = this.m_IntersectList[i];
+      this.IntersectEdges(iNode.Edge1, iNode.Edge2, iNode.Pt);
+      this.SwapPositionsInAEL(iNode.Edge1, iNode.Edge2);
     }
-
-    var commands;
-    if (transform) {
-        commands = transform.transformShape(shape).commands;
-    } else {
-        commands = shape.commands;
+    this.m_IntersectList.length = 0;
+  };
+  /*
+  --------------------------------
+  Round speedtest: http://jsperf.com/fastest-round
+  --------------------------------
+  */
+  var R1 = function (a)
+  {
+    return a < 0 ? Math.ceil(a - 0.5) : Math.round(a)
+  };
+  var R2 = function (a)
+  {
+    return a < 0 ? Math.ceil(a - 0.5) : Math.floor(a + 0.5)
+  };
+  var R3 = function (a)
+  {
+    return a < 0 ? -Math.round(Math.abs(a)) : Math.round(a)
+  };
+  var R4 = function (a)
+  {
+    if (a < 0)
+    {
+      a -= 0.5;
+      return a < -2147483648 ? Math.ceil(a) : a | 0;
     }
-    var f = (fill === undefined) ? shape.fill : fill,
-        s = (stroke === undefined) ? shape.stroke : stroke,
-        sw = (strokeWidth === undefined) ? shape.strokeWidth : strokeWidth;
-    if (sw !== undefined && transform !== undefined) {
-        sw *= transform.m[0];
+    else
+    {
+      a += 0.5;
+      return a > 2147483647 ? Math.floor(a) : a | 0;
     }
-    return new Path(commands, f, s, sw);
-};
-
-var arcToSegments = function (x, y, rx, ry, large, sweep, rotateX, ox, oy) {
-/*    argsString = _join.call(arguments);
-    if (arcToSegmentsCache[argsString]) {
-      return arcToSegmentsCache[argsString];
-    } */
-    var th, sinTh, cosTh, px, py, pl,
-        a00, a01, a10, a11, x0, y0, x1, y1,
-        d, sFactorSq, sFactor, xc, yc,
-        th0, th1, thArc,
-        segments, result, th2, th3, i;
-
-    th = rotateX * (Math.PI / 180);
-    sinTh = Math.sin(th);
-    cosTh = Math.cos(th);
-    rx = Math.abs(rx);
-    ry = Math.abs(ry);
-    px = cosTh * (ox - x) * 0.5 + sinTh * (oy - y) * 0.5;
-    py = cosTh * (oy - y) * 0.5 - sinTh * (ox - x) * 0.5;
-    pl = (px * px) / (rx * rx) + (py * py) / (ry * ry);
-    if (pl > 1) {
-        pl = Math.sqrt(pl);
-        rx *= pl;
-        ry *= pl;
+  };
+  if (browser.msie) ClipperLib.Clipper.Round = R1;
+  else if (browser.chromium) ClipperLib.Clipper.Round = R3;
+  else if (browser.safari) ClipperLib.Clipper.Round = R4;
+  else ClipperLib.Clipper.Round = R2; // eg. browser.chrome || browser.firefox || browser.opera
+  ClipperLib.Clipper.TopX = function (edge, currentY)
+  {
+    //if (edge.Bot == edge.Curr) alert ("edge.Bot = edge.Curr");
+    //if (edge.Bot == edge.Top) alert ("edge.Bot = edge.Top");
+    if (currentY == edge.Top.Y)
+      return edge.Top.X;
+    return edge.Bot.X + ClipperLib.Clipper.Round(edge.Dx * (currentY - edge.Bot.Y));
+  };
+  ClipperLib.Clipper.prototype.IntersectPoint = function (edge1, edge2, ip)
+  {
+    ip.X = 0;
+    ip.Y = 0;
+    var b1, b2;
+    //nb: with very large coordinate values, it's possible for SlopesEqual() to
+    //return false but for the edge.Dx value be equal due to double precision rounding.
+    if (edge1.Dx == edge2.Dx)
+		{
+			ip.Y = edge1.Curr.Y;
+			ip.X = ClipperLib.Clipper.TopX(edge1, ip.Y);
+			return;
     }
-
-    a00 = cosTh / rx;
-    a01 = sinTh / rx;
-    a10 = (-sinTh) / ry;
-    a11 = cosTh / ry;
-    x0 = a00 * ox + a01 * oy;
-    y0 = a10 * ox + a11 * oy;
-    x1 = a00 * x + a01 * y;
-    y1 = a10 * x + a11 * y;
-
-    d = (x1 - x0) * (x1 - x0) + (y1 - y0) * (y1 - y0);
-    sFactorSq = 1 / d - 0.25;
-    if (sFactorSq < 0) { sFactorSq = 0; }
-    sFactor = Math.sqrt(sFactorSq);
-    if (sweep === large) { sFactor = -sFactor; }
-    xc = 0.5 * (x0 + x1) - sFactor * (y1 - y0);
-    yc = 0.5 * (y0 + y1) + sFactor * (x1 - x0);
-
-    th0 = Math.atan2(y0 - yc, x0 - xc);
-    th1 = Math.atan2(y1 - yc, x1 - xc);
-
-    thArc = th1 - th0;
-    if (thArc < 0 && sweep === 1) {
-        thArc += 2 * Math.PI;
-    } else if (thArc > 0 && sweep === 0) {
-        thArc -= 2 * Math.PI;
+    if (edge1.Delta.X === 0)
+    {
+      ip.X = edge1.Bot.X;
+      if (ClipperLib.ClipperBase.IsHorizontal(edge2))
+      {
+        ip.Y = edge2.Bot.Y;
+      }
+      else
+      {
+        b2 = edge2.Bot.Y - (edge2.Bot.X / edge2.Dx);
+        ip.Y = ClipperLib.Clipper.Round(ip.X / edge2.Dx + b2);
+      }
     }
-
-    segments = Math.ceil(Math.abs(thArc / (Math.PI * 0.5 + 0.001)));
-    result = [];
-    for (i = 0; i < segments; i += 1) {
-        th2 = th0 + i * thArc / segments;
-        th3 = th0 + (i + 1) * thArc / segments;
-        result[i] = [xc, yc, th2, th3, rx, ry, sinTh, cosTh];
+    else if (edge2.Delta.X === 0)
+    {
+      ip.X = edge2.Bot.X;
+      if (ClipperLib.ClipperBase.IsHorizontal(edge1))
+      {
+        ip.Y = edge1.Bot.Y;
+      }
+      else
+      {
+        b1 = edge1.Bot.Y - (edge1.Bot.X / edge1.Dx);
+        ip.Y = ClipperLib.Clipper.Round(ip.X / edge1.Dx + b1);
+      }
     }
-
-//    arcToSegmentsCache[argsString] = result;
-    return result;
-};
-
-var segmentToBezier = function (cx, cy, th0, th1, rx, ry, sinTh, cosTh) {
-//    argsString = _join.call(arguments);
-//    if (segmentToBezierCache[argsString]) {
-//      return segmentToBezierCache[argsString];
-//    }
-
-    var a00 = cosTh * rx,
-        a01 = -sinTh * ry,
-        a10 = sinTh * rx,
-        a11 = cosTh * ry,
-
-        thHalf = 0.5 * (th1 - th0),
-        t = (8 / 3) * Math.sin(thHalf * 0.5) * Math.sin(thHalf * 0.5) / Math.sin(thHalf),
-        x1 = cx + Math.cos(th0) - t * Math.sin(th0),
-        y1 = cy + Math.sin(th0) + t * Math.cos(th0),
-        x3 = cx + Math.cos(th1),
-        y3 = cy + Math.sin(th1),
-        x2 = x3 + t * Math.sin(th1),
-        y2 = y3 - t * Math.cos(th1);
-
-//    segmentToBezierCache[argsString] = [
-    return [
-        a00 * x1 + a01 * y1, a10 * x1 + a11 * y1,
-        a00 * x2 + a01 * y2,      a10 * x2 + a11 * y2,
-        a00 * x3 + a01 * y3,      a10 * x3 + a11 * y3
-    ];
-
-//    return segmentToBezierCache[argsString];
-};
-
-var read = {
-
-    svg: function () {
-        return read.g.apply(this, arguments);
-    },
-
-    g: function (node, parentAttributes) {
-        var shapes = [];
-        var attributes = readSvgAttributes(node, parentAttributes);
-
-        _.each(node.childNodes, function (n) {
-
-            var tag, tagName, o;
-            tag = n.nodeName;
-            if (!tag) { return; }
-            tagName = tag.replace(/svg\:/ig, '').toLowerCase();
-            if (read[tagName] !== undefined) {
-                o = read[tagName].call(this, n, attributes);
-                shapes.push(o);
-            }
-        });
-
-        return new Group(shapes);
-    },
-
-    _polyline: function (node) {
-        var points = node.getAttribute('points');
-        var p = new Path();
-        points.replace(/([\d\.?]+),([\d\.?]+)/g, function (match, p1, p2) {
-            var x = parseFloat(p1);
-            var y = parseFloat(p2);
-            if (p.commands.length === 0) {
-                p.moveTo(x, y);
-            } else {
-                p.lineTo(x, y);
-            }
-        });
-        return p;
-    },
-
-    polygon: function (node, parentAttributes) {
-        var attributes = readSvgAttributes(node, parentAttributes);
-        var p = read._polyline(node);
-        p.close();
-        return applySvgAttributes(p, attributes);
-    },
-
-    polyline: function (node, parentAttributes) {
-        var attributes = readSvgAttributes(node, parentAttributes);
-        var p = read._polyline(node);
-        return applySvgAttributes(p, attributes);
-    },
-
-    rect: function (node, parentAttributes) {
-        var attributes = readSvgAttributes(node, parentAttributes);
-        var x = parseFloat(node.getAttribute('x'));
-        var y = parseFloat(node.getAttribute('y'));
-        if (!x) { x = 0; }
-        if (!y) { y = 0; }
-        var width = parseFloat(node.getAttribute('width'));
-        var height = parseFloat(node.getAttribute('height'));
-        if (!width) { width = 0; }
-        if (!height) { height = 0; }
-        if (width < 0) {
-            console.error('Error: invalid negative value for <rect> attribute width="' + width + '"');
-            width = 0;
-        }
-        if (height < 0) {
-            console.error('Error: invalid negative value for <rect> attribute height="' + height + '"');
-            height = 0;
-        }
-        var rx = parseFloat(node.getAttribute('rx'));
-        var ry = parseFloat(node.getAttribute('ry'));
-        if (!rx) { rx = 0; }
-        if (!ry) { ry = 0; }
-        if (rx < 0) {
-            console.error('Error: invalid negative value for <rect> attribute rx="' + rx + '"');
-            rx = 0;
+    else
+    {
+      b1 = edge1.Bot.X - edge1.Bot.Y * edge1.Dx;
+      b2 = edge2.Bot.X - edge2.Bot.Y * edge2.Dx;
+      var q = (b2 - b1) / (edge1.Dx - edge2.Dx);
+      ip.Y = ClipperLib.Clipper.Round(q);
+      if (Math.abs(edge1.Dx) < Math.abs(edge2.Dx))
+        ip.X = ClipperLib.Clipper.Round(edge1.Dx * q + b1);
+      else
+        ip.X = ClipperLib.Clipper.Round(edge2.Dx * q + b2);
+    }
+    if (ip.Y < edge1.Top.Y || ip.Y < edge2.Top.Y)
+    {
+      if (edge1.Top.Y > edge2.Top.Y)
+      {
+        ip.Y = edge1.Top.Y;
+        ip.X = ClipperLib.Clipper.TopX(edge2, edge1.Top.Y);
+        return ip.X < edge1.Top.X;
+      }
+      else
+        ip.Y = edge2.Top.Y;
+      if (Math.abs(edge1.Dx) < Math.abs(edge2.Dx))
+        ip.X = ClipperLib.Clipper.TopX(edge1, ip.Y);
+      else
+        ip.X = ClipperLib.Clipper.TopX(edge2, ip.Y);
+    }
+		//finally, don't allow 'ip' to be BELOW curr.Y (ie bottom of scanbeam) ...
+		if (ip.Y > edge1.Curr.Y)
+		{
+			ip.Y = edge1.Curr.Y;
+			//better to use the more vertical edge to derive X ...
+			if (Math.abs(edge1.Dx) > Math.abs(edge2.Dx))
+				ip.X = ClipperLib.Clipper.TopX(edge2, ip.Y);
+			else
+				ip.X = ClipperLib.Clipper.TopX(edge1, ip.Y);
+		}
+  };
+
+  ClipperLib.Clipper.prototype.ProcessEdgesAtTopOfScanbeam = function (topY)
+  {
+    var e = this.m_ActiveEdges;
+    while (e !== null)
+    {
+      //1. process maxima, treating them as if they're 'bent' horizontal edges,
+      //   but exclude maxima with horizontal edges. nb: e can't be a horizontal.
+      var IsMaximaEdge = this.IsMaxima(e, topY);
+      if (IsMaximaEdge)
+      {
+        var eMaxPair = this.GetMaximaPair(e);
+        IsMaximaEdge = (eMaxPair === null || !ClipperLib.ClipperBase.IsHorizontal(eMaxPair));
+      }
+      if (IsMaximaEdge)
+      {
+        var ePrev = e.PrevInAEL;
+        this.DoMaxima(e);
+        if (ePrev === null)
+          e = this.m_ActiveEdges;
+        else
+          e = ePrev.NextInAEL;
+      }
+      else
+      {
+        //2. promote horizontal edges, otherwise update Curr.X and Curr.Y ...
+        if (this.IsIntermediate(e, topY) && ClipperLib.ClipperBase.IsHorizontal(e.NextInLML))
+        {
+          e = this.UpdateEdgeIntoAEL(e);
+          if (e.OutIdx >= 0)
+            this.AddOutPt(e, e.Bot);
+          this.AddEdgeToSEL(e);
         }
-        if (ry < 0) {
-            console.error('Error: invalid negative value for <rect> attribute ry="' + ry + '"');
-            ry = 0;
+        else
+        {
+          e.Curr.X = ClipperLib.Clipper.TopX(e, topY);
+          e.Curr.Y = topY;
         }
-        if (!rx || !ry) {
-            rx = ry = Math.max(rx, ry);
+        if (this.StrictlySimple)
+        {
+          var ePrev = e.PrevInAEL;
+          if ((e.OutIdx >= 0) && (e.WindDelta !== 0) && ePrev !== null &&
+            (ePrev.OutIdx >= 0) && (ePrev.Curr.X == e.Curr.X) &&
+            (ePrev.WindDelta !== 0))
+          {
+           	var ip = new ClipperLib.IntPoint(e.Curr);
+
+						if(ClipperLib.use_xyz)
+						{
+							this.SetZ(ip, ePrev, e);
+						}
+
+            var op = this.AddOutPt(ePrev, ip);
+            var op2 = this.AddOutPt(e, ip);
+            this.AddJoin(op, op2, ip);
+            //StrictlySimple (type-3) join
+          }
         }
-        if (rx > width / 2) { rx = width / 2; }
-        if (ry > height / 2) { ry = height / 2; }
-        var p = new Path();
-        if (rx && ry) {
-            p.addRoundedRect(x, y, width, height, rx, ry);
-        } else {
-            p.addRect(x, y, width, height);
+        e = e.NextInAEL;
+      }
+    }
+    //3. Process horizontals at the Top of the scanbeam ...
+    this.ProcessHorizontals(true);
+    //4. Promote intermediate vertices ...
+    e = this.m_ActiveEdges;
+    while (e !== null)
+    {
+      if (this.IsIntermediate(e, topY))
+      {
+        var op = null;
+        if (e.OutIdx >= 0)
+          op = this.AddOutPt(e, e.Top);
+        e = this.UpdateEdgeIntoAEL(e);
+        //if output polygons share an edge, they'll need joining later ...
+        var ePrev = e.PrevInAEL;
+        var eNext = e.NextInAEL;
+        if (ePrev !== null && ePrev.Curr.X == e.Bot.X &&
+          ePrev.Curr.Y == e.Bot.Y && op !== null &&
+          ePrev.OutIdx >= 0 && ePrev.Curr.Y > ePrev.Top.Y &&
+          ClipperLib.ClipperBase.SlopesEqual(e, ePrev, this.m_UseFullRange) &&
+          (e.WindDelta !== 0) && (ePrev.WindDelta !== 0))
+        {
+          var op2 = this.AddOutPt(ePrev, e.Bot);
+          this.AddJoin(op, op2, e.Top);
+        }
+        else if (eNext !== null && eNext.Curr.X == e.Bot.X &&
+          eNext.Curr.Y == e.Bot.Y && op !== null &&
+          eNext.OutIdx >= 0 && eNext.Curr.Y > eNext.Top.Y &&
+          ClipperLib.ClipperBase.SlopesEqual(e, eNext, this.m_UseFullRange) &&
+          (e.WindDelta !== 0) && (eNext.WindDelta !== 0))
+        {
+          var op2 = this.AddOutPt(eNext, e.Bot);
+          this.AddJoin(op, op2, e.Top);
         }
-        return applySvgAttributes(p, attributes);
-    },
+      }
+      e = e.NextInAEL;
+    }
+  };
+  ClipperLib.Clipper.prototype.DoMaxima = function (e)
+  {
+    var eMaxPair = this.GetMaximaPair(e);
+    if (eMaxPair === null)
+    {
+      if (e.OutIdx >= 0)
+        this.AddOutPt(e, e.Top);
+      this.DeleteFromAEL(e);
+      return;
+    }
+    var eNext = e.NextInAEL;
+    while (eNext !== null && eNext != eMaxPair)
+    {
+      this.IntersectEdges(e, eNext, e.Top);
+      this.SwapPositionsInAEL(e, eNext);
+      eNext = e.NextInAEL;
+    }
+    if (e.OutIdx == -1 && eMaxPair.OutIdx == -1)
+    {
+      this.DeleteFromAEL(e);
+      this.DeleteFromAEL(eMaxPair);
+    }
+    else if (e.OutIdx >= 0 && eMaxPair.OutIdx >= 0)
+    {
+    	if (e.OutIdx >= 0) this.AddLocalMaxPoly(e, eMaxPair, e.Top);
+      this.DeleteFromAEL(e);
+      this.DeleteFromAEL(eMaxPair);
+    }
+    else if (ClipperLib.use_lines && e.WindDelta === 0)
+    {
+      if (e.OutIdx >= 0)
+      {
+        this.AddOutPt(e, e.Top);
+        e.OutIdx = -1;
+      }
+      this.DeleteFromAEL(e);
+      if (eMaxPair.OutIdx >= 0)
+      {
+        this.AddOutPt(eMaxPair, e.Top);
+        eMaxPair.OutIdx = -1;
+      }
+      this.DeleteFromAEL(eMaxPair);
+    }
+    else
+      ClipperLib.Error("DoMaxima error");
+  };
+  ClipperLib.Clipper.ReversePaths = function (polys)
+  {
+    for (var i = 0, len = polys.length; i < len; i++)
+      polys[i].reverse();
+  };
+  ClipperLib.Clipper.Orientation = function (poly)
+  {
+    return ClipperLib.Clipper.Area(poly) >= 0;
+  };
+  ClipperLib.Clipper.prototype.PointCount = function (pts)
+  {
+    if (pts === null)
+      return 0;
+    var result = 0;
+    var p = pts;
+    do {
+      result++;
+      p = p.Next;
+    }
+    while (p != pts)
+    return result;
+  };
+  ClipperLib.Clipper.prototype.BuildResult = function (polyg)
+  {
+    ClipperLib.Clear(polyg);
+    for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
+    {
+      var outRec = this.m_PolyOuts[i];
+      if (outRec.Pts === null)
+        continue;
+      var p = outRec.Pts.Prev;
+      var cnt = this.PointCount(p);
+      if (cnt < 2)
+        continue;
+      var pg = new Array(cnt);
+      for (var j = 0; j < cnt; j++)
+      {
+        pg[j] = p.Pt;
+        p = p.Prev;
+      }
+      polyg.push(pg);
+    }
+  };
+  ClipperLib.Clipper.prototype.BuildResult2 = function (polytree)
+  {
+    polytree.Clear();
+    //add each output polygon/contour to polytree ...
+    //polytree.m_AllPolys.set_Capacity(this.m_PolyOuts.length);
+    for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
+    {
+      var outRec = this.m_PolyOuts[i];
+      var cnt = this.PointCount(outRec.Pts);
+      if ((outRec.IsOpen && cnt < 2) || (!outRec.IsOpen && cnt < 3))
+        continue;
+      this.FixHoleLinkage(outRec);
+      var pn = new ClipperLib.PolyNode();
+      polytree.m_AllPolys.push(pn);
+      outRec.PolyNode = pn;
+      pn.m_polygon.length = cnt;
+      var op = outRec.Pts.Prev;
+      for (var j = 0; j < cnt; j++)
+      {
+        pn.m_polygon[j] = op.Pt;
+        op = op.Prev;
+      }
+    }
+    //fixup PolyNode links etc ...
+    //polytree.m_Childs.set_Capacity(this.m_PolyOuts.length);
+    for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
+    {
+      var outRec = this.m_PolyOuts[i];
+      if (outRec.PolyNode === null)
+        continue;
+      else if (outRec.IsOpen)
+      {
+        outRec.PolyNode.IsOpen = true;
+        polytree.AddChild(outRec.PolyNode);
+      }
+      else if (outRec.FirstLeft !== null && outRec.FirstLeft.PolyNode != null)
+        outRec.FirstLeft.PolyNode.AddChild(outRec.PolyNode);
+      else
+        polytree.AddChild(outRec.PolyNode);
+    }
+  };
+  ClipperLib.Clipper.prototype.FixupOutPolygon = function (outRec)
+  {
+    //FixupOutPolygon() - removes duplicate points and simplifies consecutive
+    //parallel edges by removing the middle vertex.
+    var lastOK = null;
+    outRec.BottomPt = null;
+    var pp = outRec.Pts;
+    for (;;)
+    {
+      if (pp.Prev == pp || pp.Prev == pp.Next)
+      {
+        outRec.Pts = null;
+        return;
+      }
+      //test for duplicate points and collinear edges ...
+      if ((ClipperLib.IntPoint.op_Equality(pp.Pt, pp.Next.Pt)) || (ClipperLib.IntPoint.op_Equality(pp.Pt, pp.Prev.Pt)) ||
+        (ClipperLib.ClipperBase.SlopesEqual(pp.Prev.Pt, pp.Pt, pp.Next.Pt, this.m_UseFullRange) &&
+          (!this.PreserveCollinear || !this.Pt2IsBetweenPt1AndPt3(pp.Prev.Pt, pp.Pt, pp.Next.Pt))))
+      {
+        lastOK = null;
+        pp.Prev.Next = pp.Next;
+        pp.Next.Prev = pp.Prev;
+        pp = pp.Prev;
+      }
+      else if (pp == lastOK)
+        break;
+      else
+      {
+        if (lastOK === null)
+          lastOK = pp;
+        pp = pp.Next;
+      }
+    }
+    outRec.Pts = pp;
+  };
+  ClipperLib.Clipper.prototype.DupOutPt = function (outPt, InsertAfter)
+  {
+    var result = new ClipperLib.OutPt();
+    //result.Pt = outPt.Pt;
+    result.Pt.X = outPt.Pt.X;
+    result.Pt.Y = outPt.Pt.Y;
+		if(ClipperLib.use_xyz) result.Pt.Z = outPt.Pt.Z;
+    result.Idx = outPt.Idx;
+    if (InsertAfter)
+    {
+      result.Next = outPt.Next;
+      result.Prev = outPt;
+      outPt.Next.Prev = result;
+      outPt.Next = result;
+    }
+    else
+    {
+      result.Prev = outPt.Prev;
+      result.Next = outPt;
+      outPt.Prev.Next = result;
+      outPt.Prev = result;
+    }
+    return result;
+  };
+  ClipperLib.Clipper.prototype.GetOverlap = function (a1, a2, b1, b2, $val)
+  {
+    if (a1 < a2)
+    {
+      if (b1 < b2)
+      {
+        $val.Left = Math.max(a1, b1);
+        $val.Right = Math.min(a2, b2);
+      }
+      else
+      {
+        $val.Left = Math.max(a1, b2);
+        $val.Right = Math.min(a2, b1);
+      }
+    }
+    else
+    {
+      if (b1 < b2)
+      {
+        $val.Left = Math.max(a2, b1);
+        $val.Right = Math.min(a1, b2);
+      }
+      else
+      {
+        $val.Left = Math.max(a2, b2);
+        $val.Right = Math.min(a1, b1);
+      }
+    }
+    return $val.Left < $val.Right;
+  };
+  ClipperLib.Clipper.prototype.JoinHorz = function (op1, op1b, op2, op2b, Pt, DiscardLeft)
+  {
+    var Dir1 = (op1.Pt.X > op1b.Pt.X ? ClipperLib.Direction.dRightToLeft : ClipperLib.Direction.dLeftToRight);
+    var Dir2 = (op2.Pt.X > op2b.Pt.X ? ClipperLib.Direction.dRightToLeft : ClipperLib.Direction.dLeftToRight);
+    if (Dir1 == Dir2)
+      return false;
+    //When DiscardLeft, we want Op1b to be on the Left of Op1, otherwise we
+    //want Op1b to be on the Right. (And likewise with Op2 and Op2b.)
+    //So, to facilitate this while inserting Op1b and Op2b ...
+    //when DiscardLeft, make sure we're AT or RIGHT of Pt before adding Op1b,
+    //otherwise make sure we're AT or LEFT of Pt. (Likewise with Op2b.)
+    if (Dir1 == ClipperLib.Direction.dLeftToRight)
+    {
+      while (op1.Next.Pt.X <= Pt.X &&
+        op1.Next.Pt.X >= op1.Pt.X && op1.Next.Pt.Y == Pt.Y)
+        op1 = op1.Next;
+      if (DiscardLeft && (op1.Pt.X != Pt.X))
+        op1 = op1.Next;
+      op1b = this.DupOutPt(op1, !DiscardLeft);
+      if (ClipperLib.IntPoint.op_Inequality(op1b.Pt, Pt))
+      {
+        op1 = op1b;
+        //op1.Pt = Pt;
+        op1.Pt.X = Pt.X;
+        op1.Pt.Y = Pt.Y;
+        if(ClipperLib.use_xyz) op1.Pt.Z = Pt.Z;
+        op1b = this.DupOutPt(op1, !DiscardLeft);
+      }
+    }
+    else
+    {
+      while (op1.Next.Pt.X >= Pt.X &&
+        op1.Next.Pt.X <= op1.Pt.X && op1.Next.Pt.Y == Pt.Y)
+        op1 = op1.Next;
+      if (!DiscardLeft && (op1.Pt.X != Pt.X))
+        op1 = op1.Next;
+      op1b = this.DupOutPt(op1, DiscardLeft);
+      if (ClipperLib.IntPoint.op_Inequality(op1b.Pt, Pt))
+      {
+        op1 = op1b;
+        //op1.Pt = Pt;
+        op1.Pt.X = Pt.X;
+        op1.Pt.Y = Pt.Y;
+				if(ClipperLib.use_xyz) op1.Pt.Z = Pt.Z;
+        op1b = this.DupOutPt(op1, DiscardLeft);
+      }
+    }
+    if (Dir2 == ClipperLib.Direction.dLeftToRight)
+    {
+      while (op2.Next.Pt.X <= Pt.X &&
+        op2.Next.Pt.X >= op2.Pt.X && op2.Next.Pt.Y == Pt.Y)
+        op2 = op2.Next;
+      if (DiscardLeft && (op2.Pt.X != Pt.X))
+        op2 = op2.Next;
+      op2b = this.DupOutPt(op2, !DiscardLeft);
+      if (ClipperLib.IntPoint.op_Inequality(op2b.Pt, Pt))
+      {
+        op2 = op2b;
+        //op2.Pt = Pt;
+        op2.Pt.X = Pt.X;
+        op2.Pt.Y = Pt.Y;
+				if(ClipperLib.use_xyz) op2.Pt.Z = Pt.Z;
+        op2b = this.DupOutPt(op2, !DiscardLeft);
+      }
+    }
+    else
+    {
+      while (op2.Next.Pt.X >= Pt.X &&
+        op2.Next.Pt.X <= op2.Pt.X && op2.Next.Pt.Y == Pt.Y)
+        op2 = op2.Next;
+      if (!DiscardLeft && (op2.Pt.X != Pt.X))
+        op2 = op2.Next;
+      op2b = this.DupOutPt(op2, DiscardLeft);
+      if (ClipperLib.IntPoint.op_Inequality(op2b.Pt, Pt))
+      {
+        op2 = op2b;
+        //op2.Pt = Pt;
+        op2.Pt.X = Pt.X;
+        op2.Pt.Y = Pt.Y;
+				if(ClipperLib.use_xyz) op2.Pt.Z = Pt.Z;
+        op2b = this.DupOutPt(op2, DiscardLeft);
+      }
+    }
+    if ((Dir1 == ClipperLib.Direction.dLeftToRight) == DiscardLeft)
+    {
+      op1.Prev = op2;
+      op2.Next = op1;
+      op1b.Next = op2b;
+      op2b.Prev = op1b;
+    }
+    else
+    {
+      op1.Next = op2;
+      op2.Prev = op1;
+      op1b.Prev = op2b;
+      op2b.Next = op1b;
+    }
+    return true;
+  };
+  ClipperLib.Clipper.prototype.JoinPoints = function (j, outRec1, outRec2)
+  {
+    var op1 = j.OutPt1,
+      op1b = new ClipperLib.OutPt();
+    var op2 = j.OutPt2,
+      op2b = new ClipperLib.OutPt();
+    //There are 3 kinds of joins for output polygons ...
+    //1. Horizontal joins where Join.OutPt1 & Join.OutPt2 are a vertices anywhere
+    //along (horizontal) collinear edges (& Join.OffPt is on the same horizontal).
+    //2. Non-horizontal joins where Join.OutPt1 & Join.OutPt2 are at the same
+    //location at the Bottom of the overlapping segment (& Join.OffPt is above).
+    //3. StrictlySimple joins where edges touch but are not collinear and where
+    //Join.OutPt1, Join.OutPt2 & Join.OffPt all share the same point.
+    var isHorizontal = (j.OutPt1.Pt.Y == j.OffPt.Y);
+    if (isHorizontal && (ClipperLib.IntPoint.op_Equality(j.OffPt, j.OutPt1.Pt)) && (ClipperLib.IntPoint.op_Equality(j.OffPt, j.OutPt2.Pt)))
+    {
+      //Strictly Simple join ...
+			if (outRec1 != outRec2) return false;
+
+      op1b = j.OutPt1.Next;
+      while (op1b != op1 && (ClipperLib.IntPoint.op_Equality(op1b.Pt, j.OffPt)))
+        op1b = op1b.Next;
+      var reverse1 = (op1b.Pt.Y > j.OffPt.Y);
+      op2b = j.OutPt2.Next;
+      while (op2b != op2 && (ClipperLib.IntPoint.op_Equality(op2b.Pt, j.OffPt)))
+        op2b = op2b.Next;
+      var reverse2 = (op2b.Pt.Y > j.OffPt.Y);
+      if (reverse1 == reverse2)
+        return false;
+      if (reverse1)
+      {
+        op1b = this.DupOutPt(op1, false);
+        op2b = this.DupOutPt(op2, true);
+        op1.Prev = op2;
+        op2.Next = op1;
+        op1b.Next = op2b;
+        op2b.Prev = op1b;
+        j.OutPt1 = op1;
+        j.OutPt2 = op1b;
+        return true;
+      }
+      else
+      {
+        op1b = this.DupOutPt(op1, true);
+        op2b = this.DupOutPt(op2, false);
+        op1.Next = op2;
+        op2.Prev = op1;
+        op1b.Prev = op2b;
+        op2b.Next = op1b;
+        j.OutPt1 = op1;
+        j.OutPt2 = op1b;
+        return true;
+      }
+    }
+    else if (isHorizontal)
+    {
+      //treat horizontal joins differently to non-horizontal joins since with
+      //them we're not yet sure where the overlapping is. OutPt1.Pt & OutPt2.Pt
+      //may be anywhere along the horizontal edge.
+      op1b = op1;
+      while (op1.Prev.Pt.Y == op1.Pt.Y && op1.Prev != op1b && op1.Prev != op2)
+        op1 = op1.Prev;
+      while (op1b.Next.Pt.Y == op1b.Pt.Y && op1b.Next != op1 && op1b.Next != op2)
+        op1b = op1b.Next;
+      if (op1b.Next == op1 || op1b.Next == op2)
+        return false;
+      //a flat 'polygon'
+      op2b = op2;
+      while (op2.Prev.Pt.Y == op2.Pt.Y && op2.Prev != op2b && op2.Prev != op1b)
+        op2 = op2.Prev;
+      while (op2b.Next.Pt.Y == op2b.Pt.Y && op2b.Next != op2 && op2b.Next != op1)
+        op2b = op2b.Next;
+      if (op2b.Next == op2 || op2b.Next == op1)
+        return false;
+      //a flat 'polygon'
+      //Op1 -. Op1b & Op2 -. Op2b are the extremites of the horizontal edges
 
-    ellipse: function (node, parentAttributes) {
-        var attributes = readSvgAttributes(node, parentAttributes);
-        var cx = parseFloat(node.getAttribute('cx'));
-        var cy = parseFloat(node.getAttribute('cy'));
-        if (!cx) { cx = 0; }
-        if (!cy) { cy = 0; }
-        var rx = parseFloat(node.getAttribute('rx'));
-        var ry = parseFloat(node.getAttribute('ry'));
-        if (!rx) { rx = 0; }
-        if (!ry) { ry = 0; }
-        if (rx < 0) {
-            console.error('Error: invalid negative value for <ellipse> attribute rx="' + rx + '"');
-            rx = 0;
+      var $val = {Left: null, Right: null};
+      if (!this.GetOverlap(op1.Pt.X, op1b.Pt.X, op2.Pt.X, op2b.Pt.X, $val))
+        return false;
+      var Left = $val.Left;
+      var Right = $val.Right;
+
+      //DiscardLeftSide: when overlapping edges are joined, a spike will created
+      //which needs to be cleaned up. However, we don't want Op1 or Op2 caught up
+      //on the discard Side as either may still be needed for other joins ...
+      var Pt = new ClipperLib.IntPoint();
+      var DiscardLeftSide;
+      if (op1.Pt.X >= Left && op1.Pt.X <= Right)
+      {
+        //Pt = op1.Pt;
+        Pt.X = op1.Pt.X;
+        Pt.Y = op1.Pt.Y;
+        if(ClipperLib.use_xyz) Pt.Z = op1.Pt.Z;
+        DiscardLeftSide = (op1.Pt.X > op1b.Pt.X);
+      }
+      else if (op2.Pt.X >= Left && op2.Pt.X <= Right)
+      {
+        //Pt = op2.Pt;
+        Pt.X = op2.Pt.X;
+        Pt.Y = op2.Pt.Y;
+				if(ClipperLib.use_xyz) Pt.Z = op2.Pt.Z;
+        DiscardLeftSide = (op2.Pt.X > op2b.Pt.X);
+      }
+      else if (op1b.Pt.X >= Left && op1b.Pt.X <= Right)
+      {
+        //Pt = op1b.Pt;
+        Pt.X = op1b.Pt.X;
+        Pt.Y = op1b.Pt.Y;
+        if(ClipperLib.use_xyz) Pt.Z = op1b.Pt.Z;
+        DiscardLeftSide = op1b.Pt.X > op1.Pt.X;
+      }
+      else
+      {
+        //Pt = op2b.Pt;
+        Pt.X = op2b.Pt.X;
+        Pt.Y = op2b.Pt.Y;
+				if(ClipperLib.use_xyz) Pt.Z = op2b.Pt.Z;
+        DiscardLeftSide = (op2b.Pt.X > op2.Pt.X);
+      }
+      j.OutPt1 = op1;
+      j.OutPt2 = op2;
+      return this.JoinHorz(op1, op1b, op2, op2b, Pt, DiscardLeftSide);
+    }
+    else
+    {
+      //nb: For non-horizontal joins ...
+      //    1. Jr.OutPt1.Pt.Y == Jr.OutPt2.Pt.Y
+      //    2. Jr.OutPt1.Pt > Jr.OffPt.Y
+      //make sure the polygons are correctly oriented ...
+      op1b = op1.Next;
+      while ((ClipperLib.IntPoint.op_Equality(op1b.Pt, op1.Pt)) && (op1b != op1))
+        op1b = op1b.Next;
+      var Reverse1 = ((op1b.Pt.Y > op1.Pt.Y) || !ClipperLib.ClipperBase.SlopesEqual(op1.Pt, op1b.Pt, j.OffPt, this.m_UseFullRange));
+      if (Reverse1)
+      {
+        op1b = op1.Prev;
+        while ((ClipperLib.IntPoint.op_Equality(op1b.Pt, op1.Pt)) && (op1b != op1))
+          op1b = op1b.Prev;
+        if ((op1b.Pt.Y > op1.Pt.Y) || !ClipperLib.ClipperBase.SlopesEqual(op1.Pt, op1b.Pt, j.OffPt, this.m_UseFullRange))
+          return false;
+      }
+      op2b = op2.Next;
+      while ((ClipperLib.IntPoint.op_Equality(op2b.Pt, op2.Pt)) && (op2b != op2))
+        op2b = op2b.Next;
+      var Reverse2 = ((op2b.Pt.Y > op2.Pt.Y) || !ClipperLib.ClipperBase.SlopesEqual(op2.Pt, op2b.Pt, j.OffPt, this.m_UseFullRange));
+      if (Reverse2)
+      {
+        op2b = op2.Prev;
+        while ((ClipperLib.IntPoint.op_Equality(op2b.Pt, op2.Pt)) && (op2b != op2))
+          op2b = op2b.Prev;
+        if ((op2b.Pt.Y > op2.Pt.Y) || !ClipperLib.ClipperBase.SlopesEqual(op2.Pt, op2b.Pt, j.OffPt, this.m_UseFullRange))
+          return false;
+      }
+      if ((op1b == op1) || (op2b == op2) || (op1b == op2b) ||
+        ((outRec1 == outRec2) && (Reverse1 == Reverse2)))
+        return false;
+      if (Reverse1)
+      {
+        op1b = this.DupOutPt(op1, false);
+        op2b = this.DupOutPt(op2, true);
+        op1.Prev = op2;
+        op2.Next = op1;
+        op1b.Next = op2b;
+        op2b.Prev = op1b;
+        j.OutPt1 = op1;
+        j.OutPt2 = op1b;
+        return true;
+      }
+      else
+      {
+        op1b = this.DupOutPt(op1, true);
+        op2b = this.DupOutPt(op2, false);
+        op1.Next = op2;
+        op2.Prev = op1;
+        op1b.Prev = op2b;
+        op2b.Next = op1b;
+        j.OutPt1 = op1;
+        j.OutPt2 = op1b;
+        return true;
+      }
+    }
+  };
+  ClipperLib.Clipper.GetBounds = function (paths)
+  {
+    var i = 0,
+      cnt = paths.length;
+    while (i < cnt && paths[i].length == 0) i++;
+    if (i == cnt) return new ClipperLib.IntRect(0, 0, 0, 0);
+    var result = new ClipperLib.IntRect();
+    result.left = paths[i][0].X;
+    result.right = result.left;
+    result.top = paths[i][0].Y;
+    result.bottom = result.top;
+    for (; i < cnt; i++)
+      for (var j = 0, jlen = paths[i].length; j < jlen; j++)
+      {
+        if (paths[i][j].X < result.left) result.left = paths[i][j].X;
+        else if (paths[i][j].X > result.right) result.right = paths[i][j].X;
+        if (paths[i][j].Y < result.top) result.top = paths[i][j].Y;
+        else if (paths[i][j].Y > result.bottom) result.bottom = paths[i][j].Y;
+      }
+    return result;
+  }
+  ClipperLib.Clipper.prototype.GetBounds2 = function (ops)
+  {
+    var opStart = ops;
+    var result = new ClipperLib.IntRect();
+    result.left = ops.Pt.X;
+    result.right = ops.Pt.X;
+    result.top = ops.Pt.Y;
+    result.bottom = ops.Pt.Y;
+    ops = ops.Next;
+    while (ops != opStart)
+    {
+      if (ops.Pt.X < result.left)
+        result.left = ops.Pt.X;
+      if (ops.Pt.X > result.right)
+        result.right = ops.Pt.X;
+      if (ops.Pt.Y < result.top)
+        result.top = ops.Pt.Y;
+      if (ops.Pt.Y > result.bottom)
+        result.bottom = ops.Pt.Y;
+      ops = ops.Next;
+    }
+    return result;
+  };
+
+  ClipperLib.Clipper.PointInPolygon = function (pt, path)
+  {
+    //returns 0 if false, +1 if true, -1 if pt ON polygon boundary
+		//See "The Point in Polygon Problem for Arbitrary Polygons" by Hormann & Agathos
+    //http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.88.5498&rep=rep1&type=pdf
+    var result = 0,
+      cnt = path.length;
+    if (cnt < 3)
+      return 0;
+    var ip = path[0];
+    for (var i = 1; i <= cnt; ++i)
+    {
+      var ipNext = (i == cnt ? path[0] : path[i]);
+      if (ipNext.Y == pt.Y)
+      {
+        if ((ipNext.X == pt.X) || (ip.Y == pt.Y && ((ipNext.X > pt.X) == (ip.X < pt.X))))
+          return -1;
+      }
+      if ((ip.Y < pt.Y) != (ipNext.Y < pt.Y))
+      {
+        if (ip.X >= pt.X)
+        {
+          if (ipNext.X > pt.X)
+            result = 1 - result;
+          else
+          {
+            var d = (ip.X - pt.X) * (ipNext.Y - pt.Y) - (ipNext.X - pt.X) * (ip.Y - pt.Y);
+            if (d == 0)
+              return -1;
+            else if ((d > 0) == (ipNext.Y > ip.Y))
+              result = 1 - result;
+          }
         }
-        if (ry < 0) {
-            console.error('Error: invalid negative value for <ellipse> attribute ry="' + ry + '"');
-            ry = 0;
+        else
+        {
+          if (ipNext.X > pt.X)
+          {
+            var d = (ip.X - pt.X) * (ipNext.Y - pt.Y) - (ipNext.X - pt.X) * (ip.Y - pt.Y);
+            if (d == 0)
+              return -1;
+            else if ((d > 0) == (ipNext.Y > ip.Y))
+              result = 1 - result;
+          }
         }
-        var p = new Path();
-        p.addEllipse(cx - rx, cy - ry, rx * 2, ry * 2);
-        return applySvgAttributes(p, attributes);
-    },
+      }
+      ip = ipNext;
+    }
+    return result;
+  };
 
-    circle: function (node, parentAttributes) {
-        var attributes = readSvgAttributes(node, parentAttributes);
-        var cx = parseFloat(node.getAttribute('cx'));
-        var cy = parseFloat(node.getAttribute('cy'));
-        if (!cx) { cx = 0; }
-        if (!cy) { cy = 0; }
-        var r = parseFloat(node.getAttribute('r'));
-        if (!r) { r = 0; }
-        if (r < 0) {
-            console.error('Error: invalid negative value for <circle> attribute r="' + r + '"');
-            r = 0;
+  ClipperLib.Clipper.prototype.PointInPolygon = function (pt, op)
+  {
+    //returns 0 if false, +1 if true, -1 if pt ON polygon boundary
+		//See "The Point in Polygon Problem for Arbitrary Polygons" by Hormann & Agathos
+    //http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.88.5498&rep=rep1&type=pdf
+    var result = 0;
+    var startOp = op;
+		var ptx = pt.X, pty = pt.Y;
+    var poly0x = op.Pt.X, poly0y = op.Pt.Y;
+    do
+    {
+			op = op.Next;
+			var poly1x = op.Pt.X, poly1y = op.Pt.Y;
+      if (poly1y == pty)
+      {
+        if ((poly1x == ptx) || (poly0y == pty && ((poly1x > ptx) == (poly0x < ptx))))
+          return -1;
+      }
+      if ((poly0y < pty) != (poly1y < pty))
+      {
+        if (poly0x >= ptx)
+        {
+          if (poly1x > ptx)
+            result = 1 - result;
+          else
+          {
+            var d = (poly0x - ptx) * (poly1y - pty) - (poly1x - ptx) * (poly0y - pty);
+            if (d == 0)
+              return -1;
+            if ((d > 0) == (poly1y > poly0y))
+              result = 1 - result;
+          }
         }
-        var p = new Path();
-        p.addEllipse(cx - r, cy - r, r * 2, r * 2);
-        return applySvgAttributes(p, attributes);
-    },
-
-    line: function (node, parentAttributes) {
-        var attributes = readSvgAttributes(node, parentAttributes);
-        var x1 = parseFloat(node.getAttribute('x1'));
-        var y1 = parseFloat(node.getAttribute('y1'));
-        var x2 = parseFloat(node.getAttribute('x2'));
-        var y2 = parseFloat(node.getAttribute('y2'));
-        if (!x1) { x1 = 0; }
-        if (!y1) { y1 = 0; }
-        if (!x2) { x2 = 0; }
-        if (!y2) { y2 = 0; }
-        var p = new Path();
-        p.addLine(x1, y1, x2, y2);
-        return applySvgAttributes(p, attributes);
-    },
-
-    path: function (node, parentAttributes) {
-        var attributes = readSvgAttributes(node, parentAttributes);
-        var d, PathParser, pp,
-            pt, newP, curr, p1, cntrl, cp, cp1x, cp1y, cp2x, cp2y,
-            rx, ry, rot, large, sweep, ex, ey, segs, i, bez;
-        // TODO: convert to real lexer based on http://www.w3.org/TR/SVG11/paths.html#PathDataBNF
-        d = node.getAttribute('d');
-        d = d.replace(/,/gm, ' '); // get rid of all commas
-        d = d.replace(/([MmZzLlHhVvCcSsQqTtAa])([MmZzLlHhVvCcSsQqTtAa])/gm, '$1 $2'); // separate commands from commands
-        d = d.replace(/([MmZzLlHhVvCcSsQqTtAa])([MmZzLlHhVvCcSsQqTtAa])/gm, '$1 $2'); // separate commands from commands
-        d = d.replace(/([MmZzLlHhVvCcSsQqTtAa])([^\s])/gm, '$1 $2'); // separate commands from points
-        d = d.replace(/([^\s])([MmZzLlHhVvCcSsQqTtAa])/gm, '$1 $2'); // separate commands from points
-        d = d.replace(/([0-9])([+\-])/gm, '$1 $2'); // separate digits when no comma
-        d = d.replace(/(\.[0-9]*)(\.)/gm, '$1 $2'); // separate digits when no comma
-        d = d.replace(/([Aa](\s+[0-9]+){3})\s+([01])\s*([01])/gm, '$1 $3 $4 '); // shorthand elliptical arc path syntax
-        d = compressSpaces(d); // compress multiple spaces
-        d = trim(d);
-
-        PathParser = function (d) {
-            this.tokens = d.split(' ');
-
-            this.reset = function () {
-                this.i = -1;
-                this.command = '';
-                this.previousCommand = '';
-                this.start = new Point(0, 0);
-                this.control = new Point(0, 0);
-                this.current = new Point(0, 0);
-                this.points = [];
-                this.angles = [];
-            };
-
-            this.isEnd = function () {
-                return this.i >= this.tokens.length - 1;
-            };
-
-            this.isCommandOrEnd = function () {
-                if (this.isEnd()) { return true; }
-                return this.tokens[this.i + 1].match(/^[A-Za-z]$/) !== null;
-            };
-
-            this.isRelativeCommand = function () {
-                switch (this.command) {
-                case 'm':
-                case 'l':
-                case 'h':
-                case 'v':
-                case 'c':
-                case 's':
-                case 'q':
-                case 't':
-                case 'a':
-                case 'z':
-                    return true;
-                }
-                return false;
-            };
+        else
+        {
+          if (poly1x > ptx)
+          {
+            var d = (poly0x - ptx) * (poly1y - pty) - (poly1x - ptx) * (poly0y - pty);
+            if (d == 0)
+              return -1;
+            if ((d > 0) == (poly1y > poly0y))
+              result = 1 - result;
+          }
+        }
+      }
+      poly0x = poly1x;
+      poly0y = poly1y;
+    } while (startOp != op);
 
-            this.getToken = function () {
-                this.i += 1;
-                return this.tokens[this.i];
-            };
+    return result;
+  };
 
-            this.getScalar = function () {
-                return parseFloat(this.getToken());
-            };
+  ClipperLib.Clipper.prototype.Poly2ContainsPoly1 = function (outPt1, outPt2)
+  {
+    var op = outPt1;
+    do
+    {
+			//nb: PointInPolygon returns 0 if false, +1 if true, -1 if pt on polygon
+      var res = this.PointInPolygon(op.Pt, outPt2);
+      if (res >= 0)
+        return res > 0;
+      op = op.Next;
+    }
+    while (op != outPt1)
+    return true;
+  };
+  ClipperLib.Clipper.prototype.FixupFirstLefts1 = function (OldOutRec, NewOutRec)
+  {
+    for (var i = 0, ilen = this.m_PolyOuts.length; i < ilen; i++)
+    {
+			var outRec = this.m_PolyOuts[i];
+			if (outRec.Pts == null || outRec.FirstLeft == null)
+				continue;
+			var firstLeft = this.ParseFirstLeft(outRec.FirstLeft);
+			if (firstLeft == OldOutRec)
+			{
+        if (this.Poly2ContainsPoly1(outRec.Pts, NewOutRec.Pts))
+          outRec.FirstLeft = NewOutRec;
+      }
+    }
+  };
+  ClipperLib.Clipper.prototype.FixupFirstLefts2 = function (OldOutRec, NewOutRec)
+  {
+    for (var $i2 = 0, $t2 = this.m_PolyOuts, $l2 = $t2.length, outRec = $t2[$i2]; $i2 < $l2; $i2++, outRec = $t2[$i2])
+      if (outRec.FirstLeft == OldOutRec)
+        outRec.FirstLeft = NewOutRec;
+  };
+  ClipperLib.Clipper.ParseFirstLeft = function (FirstLeft)
+  {
+    while (FirstLeft != null && FirstLeft.Pts == null)
+      FirstLeft = FirstLeft.FirstLeft;
+    return FirstLeft;
+  };
+  ClipperLib.Clipper.prototype.JoinCommonEdges = function ()
+  {
+    for (var i = 0, ilen = this.m_Joins.length; i < ilen; i++)
+    {
+      var join = this.m_Joins[i];
+      var outRec1 = this.GetOutRec(join.OutPt1.Idx);
+      var outRec2 = this.GetOutRec(join.OutPt2.Idx);
+      if (outRec1.Pts == null || outRec2.Pts == null)
+        continue;
+      //get the polygon fragment with the correct hole state (FirstLeft)
+      //before calling JoinPoints() ...
+      var holeStateRec;
+      if (outRec1 == outRec2)
+        holeStateRec = outRec1;
+      else if (this.Param1RightOfParam2(outRec1, outRec2))
+        holeStateRec = outRec2;
+      else if (this.Param1RightOfParam2(outRec2, outRec1))
+        holeStateRec = outRec1;
+      else
+        holeStateRec = this.GetLowermostRec(outRec1, outRec2);
 
-            this.nextCommand = function () {
-                this.previousCommand = this.command;
-                this.command = this.getToken();
-            };
+      if (!this.JoinPoints(join, outRec1, outRec2)) continue;
 
-            this.getPoint = function () {
-                var pt = new Point(this.getScalar(), this.getScalar());
-                return this.makeAbsolute(pt);
-            };
+      if (outRec1 == outRec2)
+      {
+        //instead of joining two polygons, we've just created a new one by
+        //splitting one polygon into two.
+        outRec1.Pts = join.OutPt1;
+        outRec1.BottomPt = null;
+        outRec2 = this.CreateOutRec();
+        outRec2.Pts = join.OutPt2;
+        //update all OutRec2.Pts Idx's ...
+        this.UpdateOutPtIdxs(outRec2);
+        //We now need to check every OutRec.FirstLeft pointer. If it points
+        //to OutRec1 it may need to point to OutRec2 instead ...
+        if (this.m_UsingPolyTree)
+          for (var j = 0, jlen = this.m_PolyOuts.length; j < jlen - 1; j++)
+          {
+            var oRec = this.m_PolyOuts[j];
+            if (oRec.Pts == null || ClipperLib.Clipper.ParseFirstLeft(oRec.FirstLeft) != outRec1 || oRec.IsHole == outRec1.IsHole)
+              continue;
+            if (this.Poly2ContainsPoly1(oRec.Pts, join.OutPt2))
+              oRec.FirstLeft = outRec2;
+          }
+        if (this.Poly2ContainsPoly1(outRec2.Pts, outRec1.Pts))
+        {
+          //outRec2 is contained by outRec1 ...
+          outRec2.IsHole = !outRec1.IsHole;
+          outRec2.FirstLeft = outRec1;
+          //fixup FirstLeft pointers that may need reassigning to OutRec1
+          if (this.m_UsingPolyTree)
+            this.FixupFirstLefts2(outRec2, outRec1);
+          if ((outRec2.IsHole ^ this.ReverseSolution) == (this.Area(outRec2) > 0))
+            this.ReversePolyPtLinks(outRec2.Pts);
+        }
+        else if (this.Poly2ContainsPoly1(outRec1.Pts, outRec2.Pts))
+        {
+          //outRec1 is contained by outRec2 ...
+          outRec2.IsHole = outRec1.IsHole;
+          outRec1.IsHole = !outRec2.IsHole;
+          outRec2.FirstLeft = outRec1.FirstLeft;
+          outRec1.FirstLeft = outRec2;
+          //fixup FirstLeft pointers that may need reassigning to OutRec1
+          if (this.m_UsingPolyTree)
+            this.FixupFirstLefts2(outRec1, outRec2);
+          if ((outRec1.IsHole ^ this.ReverseSolution) == (this.Area(outRec1) > 0))
+            this.ReversePolyPtLinks(outRec1.Pts);
+        }
+        else
+        {
+          //the 2 polygons are completely separate ...
+          outRec2.IsHole = outRec1.IsHole;
+          outRec2.FirstLeft = outRec1.FirstLeft;
+          //fixup FirstLeft pointers that may need reassigning to OutRec2
+          if (this.m_UsingPolyTree)
+            this.FixupFirstLefts1(outRec1, outRec2);
+        }
+      }
+      else
+      {
+        //joined 2 polygons together ...
+        outRec2.Pts = null;
+        outRec2.BottomPt = null;
+        outRec2.Idx = outRec1.Idx;
+        outRec1.IsHole = holeStateRec.IsHole;
+        if (holeStateRec == outRec2)
+          outRec1.FirstLeft = outRec2.FirstLeft;
+        outRec2.FirstLeft = outRec1;
+        //fixup FirstLeft pointers that may need reassigning to OutRec1
+        if (this.m_UsingPolyTree)
+          this.FixupFirstLefts2(outRec2, outRec1);
+      }
+    }
+  };
+  ClipperLib.Clipper.prototype.UpdateOutPtIdxs = function (outrec)
+  {
+    var op = outrec.Pts;
+    do {
+      op.Idx = outrec.Idx;
+      op = op.Prev;
+    }
+    while (op != outrec.Pts)
+  };
+  ClipperLib.Clipper.prototype.DoSimplePolygons = function ()
+  {
+    var i = 0;
+    while (i < this.m_PolyOuts.length)
+    {
+      var outrec = this.m_PolyOuts[i++];
+      var op = outrec.Pts;
+			if (op == null || outrec.IsOpen)
+				continue;
+      do //for each Pt in Polygon until duplicate found do ...
+      {
+        var op2 = op.Next;
+        while (op2 != outrec.Pts)
+        {
+          if ((ClipperLib.IntPoint.op_Equality(op.Pt, op2.Pt)) && op2.Next != op && op2.Prev != op)
+          {
+            //split the polygon into two ...
+            var op3 = op.Prev;
+            var op4 = op2.Prev;
+            op.Prev = op4;
+            op4.Next = op;
+            op2.Prev = op3;
+            op3.Next = op2;
+            outrec.Pts = op;
+            var outrec2 = this.CreateOutRec();
+            outrec2.Pts = op2;
+            this.UpdateOutPtIdxs(outrec2);
+            if (this.Poly2ContainsPoly1(outrec2.Pts, outrec.Pts))
+            {
+              //OutRec2 is contained by OutRec1 ...
+              outrec2.IsHole = !outrec.IsHole;
+              outrec2.FirstLeft = outrec;
+							if (this.m_UsingPolyTree) this.FixupFirstLefts2(outrec2, outrec);
 
-            this.getAsControlPoint = function () {
-                var pt = this.getPoint();
-                this.control = pt;
-                return pt;
-            };
+            }
+            else if (this.Poly2ContainsPoly1(outrec.Pts, outrec2.Pts))
+            {
+              //OutRec1 is contained by OutRec2 ...
+              outrec2.IsHole = outrec.IsHole;
+              outrec.IsHole = !outrec2.IsHole;
+              outrec2.FirstLeft = outrec.FirstLeft;
+              outrec.FirstLeft = outrec2;
+              if (this.m_UsingPolyTree) this.FixupFirstLefts2(outrec, outrec2);
+            }
+            else
+            {
+              //the 2 polygons are separate ...
+              outrec2.IsHole = outrec.IsHole;
+              outrec2.FirstLeft = outrec.FirstLeft;
+							if (this.m_UsingPolyTree) this.FixupFirstLefts1(outrec, outrec2);
+            }
+            op2 = op;
+            //ie get ready for the next iteration
+          }
+          op2 = op2.Next;
+        }
+        op = op.Next;
+      }
+      while (op != outrec.Pts)
+    }
+  };
+  ClipperLib.Clipper.Area = function (poly)
+  {
+    var cnt = poly.length;
+    if (cnt < 3)
+      return 0;
+    var a = 0;
+    for (var i = 0, j = cnt - 1; i < cnt; ++i)
+    {
+      a += (poly[j].X + poly[i].X) * (poly[j].Y - poly[i].Y);
+      j = i;
+    }
+    return -a * 0.5;
+  };
+  ClipperLib.Clipper.prototype.Area = function (outRec)
+  {
+    var op = outRec.Pts;
+    if (op == null)
+      return 0;
+    var a = 0;
+    do {
+      a = a + (op.Prev.Pt.X + op.Pt.X) * (op.Prev.Pt.Y - op.Pt.Y);
+      op = op.Next;
+    }
+    while (op != outRec.Pts)
+    return a * 0.5;
+  };
+  ClipperLib.Clipper.SimplifyPolygon = function (poly, fillType)
+  {
+    var result = new Array();
+    var c = new ClipperLib.Clipper(0);
+    c.StrictlySimple = true;
+    c.AddPath(poly, ClipperLib.PolyType.ptSubject, true);
+    c.Execute(ClipperLib.ClipType.ctUnion, result, fillType, fillType);
+    return result;
+  };
+  ClipperLib.Clipper.SimplifyPolygons = function (polys, fillType)
+  {
+    if (typeof (fillType) == "undefined") fillType = ClipperLib.PolyFillType.pftEvenOdd;
+    var result = new Array();
+    var c = new ClipperLib.Clipper(0);
+    c.StrictlySimple = true;
+    c.AddPaths(polys, ClipperLib.PolyType.ptSubject, true);
+    c.Execute(ClipperLib.ClipType.ctUnion, result, fillType, fillType);
+    return result;
+  };
+  ClipperLib.Clipper.DistanceSqrd = function (pt1, pt2)
+  {
+    var dx = (pt1.X - pt2.X);
+    var dy = (pt1.Y - pt2.Y);
+    return (dx * dx + dy * dy);
+  };
+  ClipperLib.Clipper.DistanceFromLineSqrd = function (pt, ln1, ln2)
+  {
+    //The equation of a line in general form (Ax + By + C = 0)
+    //given 2 points (x¹,y¹) & (x²,y²) is ...
+    //(y¹ - y²)x + (x² - x¹)y + (y² - y¹)x¹ - (x² - x¹)y¹ = 0
+    //A = (y¹ - y²); B = (x² - x¹); C = (y² - y¹)x¹ - (x² - x¹)y¹
+    //perpendicular distance of point (x³,y³) = (Ax³ + By³ + C)/Sqrt(A² + B²)
+    //see http://en.wikipedia.org/wiki/Perpendicular_distance
+    var A = ln1.Y - ln2.Y;
+    var B = ln2.X - ln1.X;
+    var C = A * ln1.X + B * ln1.Y;
+    C = A * pt.X + B * pt.Y - C;
+    return (C * C) / (A * A + B * B);
+  };
 
-            this.getAsCurrentPoint = function () {
-                var pt = this.getPoint();
-                this.current = pt;
-                return pt;
-            };
+	ClipperLib.Clipper.SlopesNearCollinear = function(pt1, pt2, pt3, distSqrd)
+	{
+		//this function is more accurate when the point that's GEOMETRICALLY
+		//between the other 2 points is the one that's tested for distance.
+		//nb: with 'spikes', either pt1 or pt3 is geometrically between the other pts
+		if (Math.abs(pt1.X - pt2.X) > Math.abs(pt1.Y - pt2.Y))
+		{
+		if ((pt1.X > pt2.X) == (pt1.X < pt3.X))
+			return ClipperLib.Clipper.DistanceFromLineSqrd(pt1, pt2, pt3) < distSqrd;
+		else if ((pt2.X > pt1.X) == (pt2.X < pt3.X))
+			return ClipperLib.Clipper.DistanceFromLineSqrd(pt2, pt1, pt3) < distSqrd;
+				else
+				return ClipperLib.Clipper.DistanceFromLineSqrd(pt3, pt1, pt2) < distSqrd;
+		}
+		else
+		{
+		if ((pt1.Y > pt2.Y) == (pt1.Y < pt3.Y))
+			return ClipperLib.Clipper.DistanceFromLineSqrd(pt1, pt2, pt3) < distSqrd;
+		else if ((pt2.Y > pt1.Y) == (pt2.Y < pt3.Y))
+			return ClipperLib.Clipper.DistanceFromLineSqrd(pt2, pt1, pt3) < distSqrd;
+				else
+			return ClipperLib.Clipper.DistanceFromLineSqrd(pt3, pt1, pt2) < distSqrd;
+		}
+	}
 
-            this.getReflectedControlPoint = function () {
-                if (this.previousCommand.toLowerCase() !== 'c' &&
-                        this.previousCommand.toLowerCase() !== 's' &&
-                        this.previousCommand.toLowerCase() !== 'q' &&
-                        this.previousCommand.toLowerCase() !== 't') {
-                    return this.current;
-                }
+  ClipperLib.Clipper.PointsAreClose = function (pt1, pt2, distSqrd)
+  {
+    var dx = pt1.X - pt2.X;
+    var dy = pt1.Y - pt2.Y;
+    return ((dx * dx) + (dy * dy) <= distSqrd);
+  };
+  //------------------------------------------------------------------------------
+  ClipperLib.Clipper.ExcludeOp = function (op)
+  {
+    var result = op.Prev;
+    result.Next = op.Next;
+    op.Next.Prev = result;
+    result.Idx = 0;
+    return result;
+  };
+  ClipperLib.Clipper.CleanPolygon = function (path, distance)
+  {
+    if (typeof (distance) == "undefined") distance = 1.415;
+    //distance = proximity in units/pixels below which vertices will be stripped.
+    //Default ~= sqrt(2) so when adjacent vertices or semi-adjacent vertices have
+    //both x & y coords within 1 unit, then the second vertex will be stripped.
+    var cnt = path.length;
+    if (cnt == 0)
+      return new Array();
+    var outPts = new Array(cnt);
+    for (var i = 0; i < cnt; ++i)
+      outPts[i] = new ClipperLib.OutPt();
+    for (var i = 0; i < cnt; ++i)
+    {
+      outPts[i].Pt = path[i];
+      outPts[i].Next = outPts[(i + 1) % cnt];
+      outPts[i].Next.Prev = outPts[i];
+      outPts[i].Idx = 0;
+    }
+    var distSqrd = distance * distance;
+    var op = outPts[0];
+    while (op.Idx == 0 && op.Next != op.Prev)
+    {
+      if (ClipperLib.Clipper.PointsAreClose(op.Pt, op.Prev.Pt, distSqrd))
+      {
+        op = ClipperLib.Clipper.ExcludeOp(op);
+        cnt--;
+      }
+      else if (ClipperLib.Clipper.PointsAreClose(op.Prev.Pt, op.Next.Pt, distSqrd))
+      {
+        ClipperLib.Clipper.ExcludeOp(op.Next);
+        op = ClipperLib.Clipper.ExcludeOp(op);
+        cnt -= 2;
+      }
+      else if (ClipperLib.Clipper.SlopesNearCollinear(op.Prev.Pt, op.Pt, op.Next.Pt, distSqrd))
+      {
+        op = ClipperLib.Clipper.ExcludeOp(op);
+        cnt--;
+      }
+      else
+      {
+        op.Idx = 1;
+        op = op.Next;
+      }
+    }
+    if (cnt < 3)
+      cnt = 0;
+    var result = new Array(cnt);
+    for (var i = 0; i < cnt; ++i)
+    {
+      result[i] = new ClipperLib.IntPoint(op.Pt);
+      op = op.Next;
+    }
+    outPts = null;
+    return result;
+  };
+  ClipperLib.Clipper.CleanPolygons = function (polys, distance)
+  {
+    var result = new Array(polys.length);
+    for (var i = 0, ilen = polys.length; i < ilen; i++)
+      result[i] = ClipperLib.Clipper.CleanPolygon(polys[i], distance);
+    return result;
+  };
+  ClipperLib.Clipper.Minkowski = function (pattern, path, IsSum, IsClosed)
+  {
+    var delta = (IsClosed ? 1 : 0);
+    var polyCnt = pattern.length;
+    var pathCnt = path.length;
+    var result = new Array();
+    if (IsSum)
+      for (var i = 0; i < pathCnt; i++)
+      {
+        var p = new Array(polyCnt);
+        for (var j = 0, jlen = pattern.length, ip = pattern[j]; j < jlen; j++, ip = pattern[j])
+          p[j] = new ClipperLib.IntPoint(path[i].X + ip.X, path[i].Y + ip.Y);
+        result.push(p);
+      }
+    else
+      for (var i = 0; i < pathCnt; i++)
+      {
+        var p = new Array(polyCnt);
+        for (var j = 0, jlen = pattern.length, ip = pattern[j]; j < jlen; j++, ip = pattern[j])
+          p[j] = new ClipperLib.IntPoint(path[i].X - ip.X, path[i].Y - ip.Y);
+        result.push(p);
+      }
+    var quads = new Array();
+    for (var i = 0; i < pathCnt - 1 + delta; i++)
+      for (var j = 0; j < polyCnt; j++)
+      {
+        var quad = new Array();
+        quad.push(result[i % pathCnt][j % polyCnt]);
+        quad.push(result[(i + 1) % pathCnt][j % polyCnt]);
+        quad.push(result[(i + 1) % pathCnt][(j + 1) % polyCnt]);
+        quad.push(result[i % pathCnt][(j + 1) % polyCnt]);
+        if (!ClipperLib.Clipper.Orientation(quad))
+          quad.reverse();
+        quads.push(quad);
+      }
+			return quads;
+  };
 
-                // reflect point
-                var pt = new Point(2 * this.current.x - this.control.x, 2 * this.current.y - this.control.y);
-                return pt;
-            };
+	ClipperLib.Clipper.MinkowskiSum = function(pattern, path_or_paths, pathIsClosed)
+	{
+		if(!(path_or_paths[0] instanceof Array))
+		{
+			var path = path_or_paths;
+			var paths = ClipperLib.Clipper.Minkowski(pattern, path, true, pathIsClosed);
+			var c = new ClipperLib.Clipper();
+			c.AddPaths(paths, ClipperLib.PolyType.ptSubject, true);
+			c.Execute(ClipperLib.ClipType.ctUnion, paths, ClipperLib.PolyFillType.pftNonZero, ClipperLib.PolyFillType.pftNonZero);
+			return paths;
+		}
+		else
+		{
+ 			var paths = path_or_paths;
+			var solution = new ClipperLib.Paths();
+			var c = new ClipperLib.Clipper();
+			for (var i = 0; i < paths.length; ++i)
+			{
+				var tmp = ClipperLib.Clipper.Minkowski(pattern, paths[i], true, pathIsClosed);
+				c.AddPaths(tmp, ClipperLib.PolyType.ptSubject, true);
+				if (pathIsClosed)
+				{
+					var path = ClipperLib.Clipper.TranslatePath(paths[i], pattern[0]);
+					c.AddPath(path, ClipperLib.PolyType.ptClip, true);
+				}
+			}
+			c.Execute(ClipperLib.ClipType.ctUnion, solution,
+				ClipperLib.PolyFillType.pftNonZero, ClipperLib.PolyFillType.pftNonZero);
+			return solution;
+		}
+	}
+	//------------------------------------------------------------------------------
 
-            this.makeAbsolute = function (pt) {
-                if (this.isRelativeCommand()) {
-                    return new Point(pt.x + this.current.x, pt.y + this.current.y);
-                }
-                return pt;
-            };
-        };
+	ClipperLib.Clipper.TranslatePath = function (path, delta)
+	{
+		var outPath = new ClipperLib.Path();
+		for (var i = 0; i < path.length; i++)
+			outPath.push(new ClipperLib.IntPoint(path[i].X + delta.X, path[i].Y + delta.Y));
+		return outPath;
+	}
+	//------------------------------------------------------------------------------
 
-        var p = new Path();
+	ClipperLib.Clipper.MinkowskiDiff = function (poly1, poly2)
+	{
+		var paths = ClipperLib.Clipper.Minkowski(poly1, poly2, false, true);
+		var c = new ClipperLib.Clipper();
+		c.AddPaths(paths, ClipperLib.PolyType.ptSubject, true);
+		c.Execute(ClipperLib.ClipType.ctUnion, paths, ClipperLib.PolyFillType.pftNonZero, ClipperLib.PolyFillType.pftNonZero);
+		return paths;
+	}
 
-        pp = new PathParser(d);
-        pp.reset();
+  ClipperLib.Clipper.PolyTreeToPaths = function (polytree)
+  {
+    var result = new Array();
+    //result.set_Capacity(polytree.get_Total());
+    ClipperLib.Clipper.AddPolyNodeToPaths(polytree, ClipperLib.Clipper.NodeType.ntAny, result);
+    return result;
+  };
+  ClipperLib.Clipper.AddPolyNodeToPaths = function (polynode, nt, paths)
+  {
+    var match = true;
+    switch (nt)
+    {
+    case ClipperLib.Clipper.NodeType.ntOpen:
+      return;
+    case ClipperLib.Clipper.NodeType.ntClosed:
+      match = !polynode.IsOpen;
+      break;
+    default:
+      break;
+    }
+    if (polynode.m_polygon.length > 0 && match)
+      paths.push(polynode.m_polygon);
+    for (var $i3 = 0, $t3 = polynode.Childs(), $l3 = $t3.length, pn = $t3[$i3]; $i3 < $l3; $i3++, pn = $t3[$i3])
+      ClipperLib.Clipper.AddPolyNodeToPaths(pn, nt, paths);
+  };
+  ClipperLib.Clipper.OpenPathsFromPolyTree = function (polytree)
+  {
+    var result = new ClipperLib.Paths();
+    //result.set_Capacity(polytree.ChildCount());
+    for (var i = 0, ilen = polytree.ChildCount(); i < ilen; i++)
+      if (polytree.Childs()[i].IsOpen)
+        result.push(polytree.Childs()[i].m_polygon);
+    return result;
+  };
+  ClipperLib.Clipper.ClosedPathsFromPolyTree = function (polytree)
+  {
+    var result = new ClipperLib.Paths();
+    //result.set_Capacity(polytree.Total());
+    ClipperLib.Clipper.AddPolyNodeToPaths(polytree, ClipperLib.Clipper.NodeType.ntClosed, result);
+    return result;
+  };
+  Inherit(ClipperLib.Clipper, ClipperLib.ClipperBase);
+  ClipperLib.Clipper.NodeType = {
+    ntAny: 0,
+    ntOpen: 1,
+    ntClosed: 2
+  };
+  ClipperLib.ClipperOffset = function (miterLimit, arcTolerance)
+  {
+    if (typeof (miterLimit) == "undefined") miterLimit = 2;
+    if (typeof (arcTolerance) == "undefined") arcTolerance = ClipperLib.ClipperOffset.def_arc_tolerance;
+    this.m_destPolys = new ClipperLib.Paths();
+    this.m_srcPoly = new ClipperLib.Path();
+    this.m_destPoly = new ClipperLib.Path();
+    this.m_normals = new Array();
+    this.m_delta = 0;
+    this.m_sinA = 0;
+    this.m_sin = 0;
+    this.m_cos = 0;
+    this.m_miterLim = 0;
+    this.m_StepsPerRad = 0;
+    this.m_lowest = new ClipperLib.IntPoint();
+    this.m_polyNodes = new ClipperLib.PolyNode();
+    this.MiterLimit = miterLimit;
+    this.ArcTolerance = arcTolerance;
+    this.m_lowest.X = -1;
+  };
+  ClipperLib.ClipperOffset.two_pi = 6.28318530717959;
+  ClipperLib.ClipperOffset.def_arc_tolerance = 0.25;
+  ClipperLib.ClipperOffset.prototype.Clear = function ()
+  {
+    ClipperLib.Clear(this.m_polyNodes.Childs());
+    this.m_lowest.X = -1;
+  };
+  ClipperLib.ClipperOffset.Round = ClipperLib.Clipper.Round;
+  ClipperLib.ClipperOffset.prototype.AddPath = function (path, joinType, endType)
+  {
+    var highI = path.length - 1;
+    if (highI < 0)
+      return;
+    var newNode = new ClipperLib.PolyNode();
+    newNode.m_jointype = joinType;
+    newNode.m_endtype = endType;
+    //strip duplicate points from path and also get index to the lowest point ...
+    if (endType == ClipperLib.EndType.etClosedLine || endType == ClipperLib.EndType.etClosedPolygon)
+      while (highI > 0 && ClipperLib.IntPoint.op_Equality(path[0], path[highI]))
+        highI--;
+    //newNode.m_polygon.set_Capacity(highI + 1);
+    newNode.m_polygon.push(path[0]);
+    var j = 0,
+      k = 0;
+    for (var i = 1; i <= highI; i++)
+      if (ClipperLib.IntPoint.op_Inequality(newNode.m_polygon[j], path[i]))
+      {
+        j++;
+        newNode.m_polygon.push(path[i]);
+        if (path[i].Y > newNode.m_polygon[k].Y || (path[i].Y == newNode.m_polygon[k].Y && path[i].X < newNode.m_polygon[k].X))
+          k = j;
+      }
+    if (endType == ClipperLib.EndType.etClosedPolygon && j < 2) return;
 
-        while (!pp.isEnd()) {
-            pp.nextCommand();
-            switch (pp.command) {
-            case 'M':
-            case 'm':
-                pt = pp.getAsCurrentPoint();
-                p.moveTo(pt.x, pt.y);
-                pp.start = pp.current;
-                while (!pp.isCommandOrEnd()) {
-                    pt = pp.getAsCurrentPoint();
-                    p.lineTo(pt.x, pt.y);
-                }
-                break;
-            case 'L':
-            case 'l':
-                while (!pp.isCommandOrEnd()) {
-                    pt = pp.getAsCurrentPoint();
-                    p.lineTo(pt.x, pt.y);
-                }
-                break;
-            case 'H':
-            case 'h':
-                while (!pp.isCommandOrEnd()) {
-                    newP = new Point((pp.isRelativeCommand() ? pp.current.x : 0) + pp.getScalar(), pp.current.y);
-                    pp.current = newP;
-                    p.lineTo(pp.current.x, pp.current.y);
-                }
-                break;
-            case 'V':
-            case 'v':
-                while (!pp.isCommandOrEnd()) {
-                    newP = new Point(pp.current.x, (pp.isRelativeCommand() ? pp.current.y : 0) + pp.getScalar());
-                    pp.current = newP;
-                    p.lineTo(pp.current.x, pp.current.y);
-                }
-                break;
-            case 'C':
-            case 'c':
-                while (!pp.isCommandOrEnd()) {
-                    curr = pp.current;
-                    p1 = pp.getPoint();
-                    cntrl = pp.getAsControlPoint();
-                    cp = pp.getAsCurrentPoint();
-                    p.curveTo(p1.x, p1.y, cntrl.x, cntrl.y, cp.x, cp.y);
-                }
-                break;
-            case 'S':
-            case 's':
-                while (!pp.isCommandOrEnd()) {
-                    curr = pp.current;
-                    p1 = pp.getReflectedControlPoint();
-                    cntrl = pp.getAsControlPoint();
-                    cp = pp.getAsCurrentPoint();
-                    p.curveTo(p1.x, p1.y, cntrl.x, cntrl.y, cp.x, cp.y);
-                }
-                break;
-            case 'Q':
-            case 'q':
-                while (!pp.isCommandOrEnd()) {
-                    curr = pp.current;
-                    cntrl = pp.getAsControlPoint();
-                    cp = pp.getAsCurrentPoint();
-                    cp1x = curr.x + 2 / 3 * (cntrl.x - curr.x); // CP1 = QP0 + 2 / 3 *(QP1-QP0)
-                    cp1y = curr.y + 2 / 3 * (cntrl.y - curr.y); // CP1 = QP0 + 2 / 3 *(QP1-QP0)
-                    cp2x = cp1x + 1 / 3 * (cp.x - curr.x); // CP2 = CP1 + 1 / 3 *(QP2-QP0)
-                    cp2y = cp1y + 1 / 3 * (cp.y - curr.y); // CP2 = CP1 + 1 / 3 *(QP2-QP0)
-                    p.curveTo(cp1x, cp1y, cp2x, cp2y, cp.x, cp.y);
-                }
-                break;
-            case 'T':
-            case 't':
-                while (!pp.isCommandOrEnd()) {
-                    curr = pp.current;
-                    cntrl = pp.getReflectedControlPoint();
-                    pp.control = cntrl;
-                    cp = pp.getAsCurrentPoint();
-                    cp1x = curr.x + 2 / 3 * (cntrl.x - curr.x); // CP1 = QP0 + 2 / 3 *(QP1-QP0)
-                    cp1y = curr.y + 2 / 3 * (cntrl.y - curr.y); // CP1 = QP0 + 2 / 3 *(QP1-QP0)
-                    cp2x = cp1x + 1 / 3 * (cp.x - curr.x); // CP2 = CP1 + 1 / 3 *(QP2-QP0)
-                    cp2y = cp1y + 1 / 3 * (cp.y - curr.y); // CP2 = CP1 + 1 / 3 *(QP2-QP0)
-                    p.curveTo(cp1x, cp1y, cp2x, cp2y, cp.x, cp.y);
-                }
-                break;
-            case 'A':
-            case 'a':
-                while (!pp.isCommandOrEnd()) {
-                    curr = pp.current;
-                    rx = pp.getScalar();
-                    ry = pp.getScalar();
-                    rot = pp.getScalar();// * (Math.PI / 180.0);
-                    large = pp.getScalar();
-                    sweep = pp.getScalar();
-                    cp = pp.getAsCurrentPoint();
-                    ex = cp.x;
-                    ey = cp.y;
-                    segs = arcToSegments(ex, ey, rx, ry, large, sweep, rot, curr.x, curr.y);
-                    for (i = 0; i < segs.length; i += 1) {
-                        bez = segmentToBezier.apply(this, segs[i]);
-                        p.curveTo.apply(p, bez);
-                    }
-                }
-                break;
-            case 'Z':
-            case 'z':
-                p.close();
-                pp.current = pp.start;
-                break;
-            }
+    this.m_polyNodes.AddChild(newNode);
+    //if this path's lowest pt is lower than all the others then update m_lowest
+    if (endType != ClipperLib.EndType.etClosedPolygon)
+      return;
+    if (this.m_lowest.X < 0)
+      this.m_lowest = new ClipperLib.IntPoint(this.m_polyNodes.ChildCount() - 1, k);
+    else
+    {
+      var ip = this.m_polyNodes.Childs()[this.m_lowest.X].m_polygon[this.m_lowest.Y];
+      if (newNode.m_polygon[k].Y > ip.Y || (newNode.m_polygon[k].Y == ip.Y && newNode.m_polygon[k].X < ip.X))
+        this.m_lowest = new ClipperLib.IntPoint(this.m_polyNodes.ChildCount() - 1, k);
+    }
+  };
+  ClipperLib.ClipperOffset.prototype.AddPaths = function (paths, joinType, endType)
+  {
+    for (var i = 0, ilen = paths.length; i < ilen; i++)
+      this.AddPath(paths[i], joinType, endType);
+  };
+  ClipperLib.ClipperOffset.prototype.FixOrientations = function ()
+  {
+    //fixup orientations of all closed paths if the orientation of the
+    //closed path with the lowermost vertex is wrong ...
+    if (this.m_lowest.X >= 0 && !ClipperLib.Clipper.Orientation(this.m_polyNodes.Childs()[this.m_lowest.X].m_polygon))
+    {
+      for (var i = 0; i < this.m_polyNodes.ChildCount(); i++)
+      {
+        var node = this.m_polyNodes.Childs()[i];
+        if (node.m_endtype == ClipperLib.EndType.etClosedPolygon || (node.m_endtype == ClipperLib.EndType.etClosedLine && ClipperLib.Clipper.Orientation(node.m_polygon)))
+          node.m_polygon.reverse();
+      }
+    }
+    else
+    {
+      for (var i = 0; i < this.m_polyNodes.ChildCount(); i++)
+      {
+        var node = this.m_polyNodes.Childs()[i];
+        if (node.m_endtype == ClipperLib.EndType.etClosedLine && !ClipperLib.Clipper.Orientation(node.m_polygon))
+          node.m_polygon.reverse();
+      }
+    }
+  };
+  ClipperLib.ClipperOffset.GetUnitNormal = function (pt1, pt2)
+  {
+    var dx = (pt2.X - pt1.X);
+    var dy = (pt2.Y - pt1.Y);
+    if ((dx == 0) && (dy == 0))
+      return new ClipperLib.DoublePoint(0, 0);
+    var f = 1 / Math.sqrt(dx * dx + dy * dy);
+    dx *= f;
+    dy *= f;
+    return new ClipperLib.DoublePoint(dy, -dx);
+  };
+  ClipperLib.ClipperOffset.prototype.DoOffset = function (delta)
+  {
+    this.m_destPolys = new Array();
+    this.m_delta = delta;
+    //if Zero offset, just copy any CLOSED polygons to m_p and return ...
+    if (ClipperLib.ClipperBase.near_zero(delta))
+    {
+      //this.m_destPolys.set_Capacity(this.m_polyNodes.ChildCount);
+      for (var i = 0; i < this.m_polyNodes.ChildCount(); i++)
+      {
+        var node = this.m_polyNodes.Childs()[i];
+        if (node.m_endtype == ClipperLib.EndType.etClosedPolygon)
+          this.m_destPolys.push(node.m_polygon);
+      }
+      return;
+    }
+    //see offset_triginometry3.svg in the documentation folder ...
+    if (this.MiterLimit > 2)
+      this.m_miterLim = 2 / (this.MiterLimit * this.MiterLimit);
+    else
+      this.m_miterLim = 0.5;
+    var y;
+    if (this.ArcTolerance <= 0)
+      y = ClipperLib.ClipperOffset.def_arc_tolerance;
+    else if (this.ArcTolerance > Math.abs(delta) * ClipperLib.ClipperOffset.def_arc_tolerance)
+      y = Math.abs(delta) * ClipperLib.ClipperOffset.def_arc_tolerance;
+    else
+      y = this.ArcTolerance;
+    //see offset_triginometry2.svg in the documentation folder ...
+    var steps = 3.14159265358979 / Math.acos(1 - y / Math.abs(delta));
+    this.m_sin = Math.sin(ClipperLib.ClipperOffset.two_pi / steps);
+    this.m_cos = Math.cos(ClipperLib.ClipperOffset.two_pi / steps);
+    this.m_StepsPerRad = steps / ClipperLib.ClipperOffset.two_pi;
+    if (delta < 0)
+      this.m_sin = -this.m_sin;
+    //this.m_destPolys.set_Capacity(this.m_polyNodes.ChildCount * 2);
+    for (var i = 0; i < this.m_polyNodes.ChildCount(); i++)
+    {
+      var node = this.m_polyNodes.Childs()[i];
+      this.m_srcPoly = node.m_polygon;
+      var len = this.m_srcPoly.length;
+      if (len == 0 || (delta <= 0 && (len < 3 || node.m_endtype != ClipperLib.EndType.etClosedPolygon)))
+        continue;
+      this.m_destPoly = new Array();
+      if (len == 1)
+      {
+        if (node.m_jointype == ClipperLib.JoinType.jtRound)
+        {
+          var X = 1,
+            Y = 0;
+          for (var j = 1; j <= steps; j++)
+          {
+            this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X + X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y + Y * delta)));
+            var X2 = X;
+            X = X * this.m_cos - this.m_sin * Y;
+            Y = X2 * this.m_sin + Y * this.m_cos;
+          }
+        }
+        else
+        {
+          var X = -1,
+            Y = -1;
+          for (var j = 0; j < 4; ++j)
+          {
+            this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X + X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y + Y * delta)));
+            if (X < 0)
+              X = 1;
+            else if (Y < 0)
+              Y = 1;
+            else
+              X = -1;
+          }
+        }
+        this.m_destPolys.push(this.m_destPoly);
+        continue;
+      }
+      //build m_normals ...
+      this.m_normals.length = 0;
+      //this.m_normals.set_Capacity(len);
+      for (var j = 0; j < len - 1; j++)
+        this.m_normals.push(ClipperLib.ClipperOffset.GetUnitNormal(this.m_srcPoly[j], this.m_srcPoly[j + 1]));
+      if (node.m_endtype == ClipperLib.EndType.etClosedLine || node.m_endtype == ClipperLib.EndType.etClosedPolygon)
+        this.m_normals.push(ClipperLib.ClipperOffset.GetUnitNormal(this.m_srcPoly[len - 1], this.m_srcPoly[0]));
+      else
+        this.m_normals.push(new ClipperLib.DoublePoint(this.m_normals[len - 2]));
+      if (node.m_endtype == ClipperLib.EndType.etClosedPolygon)
+      {
+        var k = len - 1;
+        for (var j = 0; j < len; j++)
+          k = this.OffsetPoint(j, k, node.m_jointype);
+        this.m_destPolys.push(this.m_destPoly);
+      }
+      else if (node.m_endtype == ClipperLib.EndType.etClosedLine)
+      {
+        var k = len - 1;
+        for (var j = 0; j < len; j++)
+          k = this.OffsetPoint(j, k, node.m_jointype);
+        this.m_destPolys.push(this.m_destPoly);
+        this.m_destPoly = new Array();
+        //re-build m_normals ...
+        var n = this.m_normals[len - 1];
+        for (var j = len - 1; j > 0; j--)
+          this.m_normals[j] = new ClipperLib.DoublePoint(-this.m_normals[j - 1].X, -this.m_normals[j - 1].Y);
+        this.m_normals[0] = new ClipperLib.DoublePoint(-n.X, -n.Y);
+        k = 0;
+        for (var j = len - 1; j >= 0; j--)
+          k = this.OffsetPoint(j, k, node.m_jointype);
+        this.m_destPolys.push(this.m_destPoly);
+      }
+      else
+      {
+        var k = 0;
+        for (var j = 1; j < len - 1; ++j)
+          k = this.OffsetPoint(j, k, node.m_jointype);
+        var pt1;
+        if (node.m_endtype == ClipperLib.EndType.etOpenButt)
+        {
+          var j = len - 1;
+          pt1 = new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_normals[j].X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_normals[j].Y * delta));
+          this.m_destPoly.push(pt1);
+          pt1 = new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X - this.m_normals[j].X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y - this.m_normals[j].Y * delta));
+          this.m_destPoly.push(pt1);
         }
-        return applySvgAttributes(p, attributes);
+        else
+        {
+          var j = len - 1;
+          k = len - 2;
+          this.m_sinA = 0;
+          this.m_normals[j] = new ClipperLib.DoublePoint(-this.m_normals[j].X, -this.m_normals[j].Y);
+          if (node.m_endtype == ClipperLib.EndType.etOpenSquare)
+            this.DoSquare(j, k);
+          else
+            this.DoRound(j, k);
+        }
+        //re-build m_normals ...
+        for (var j = len - 1; j > 0; j--)
+          this.m_normals[j] = new ClipperLib.DoublePoint(-this.m_normals[j - 1].X, -this.m_normals[j - 1].Y);
+        this.m_normals[0] = new ClipperLib.DoublePoint(-this.m_normals[1].X, -this.m_normals[1].Y);
+        k = len - 1;
+        for (var j = k - 1; j > 0; --j)
+          k = this.OffsetPoint(j, k, node.m_jointype);
+        if (node.m_endtype == ClipperLib.EndType.etOpenButt)
+        {
+          pt1 = new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X - this.m_normals[0].X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y - this.m_normals[0].Y * delta));
+          this.m_destPoly.push(pt1);
+          pt1 = new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X + this.m_normals[0].X * delta), ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y + this.m_normals[0].Y * delta));
+          this.m_destPoly.push(pt1);
+        }
+        else
+        {
+          k = 1;
+          this.m_sinA = 0;
+          if (node.m_endtype == ClipperLib.EndType.etOpenSquare)
+            this.DoSquare(0, 1);
+          else
+            this.DoRound(0, 1);
+        }
+        this.m_destPolys.push(this.m_destPoly);
+      }
     }
-};
+  };
+  ClipperLib.ClipperOffset.prototype.Execute = function ()
+  {
+    var a = arguments,
+      ispolytree = a[0] instanceof ClipperLib.PolyTree;
+    if (!ispolytree) // function (solution, delta)
+    {
+      var solution = a[0],
+        delta = a[1];
+      ClipperLib.Clear(solution);
+      this.FixOrientations();
+      this.DoOffset(delta);
+      //now clean up 'corners' ...
+      var clpr = new ClipperLib.Clipper(0);
+      clpr.AddPaths(this.m_destPolys, ClipperLib.PolyType.ptSubject, true);
+      if (delta > 0)
+      {
+        clpr.Execute(ClipperLib.ClipType.ctUnion, solution, ClipperLib.PolyFillType.pftPositive, ClipperLib.PolyFillType.pftPositive);
+      }
+      else
+      {
+        var r = ClipperLib.Clipper.GetBounds(this.m_destPolys);
+        var outer = new ClipperLib.Path();
+        outer.push(new ClipperLib.IntPoint(r.left - 10, r.bottom + 10));
+        outer.push(new ClipperLib.IntPoint(r.right + 10, r.bottom + 10));
+        outer.push(new ClipperLib.IntPoint(r.right + 10, r.top - 10));
+        outer.push(new ClipperLib.IntPoint(r.left - 10, r.top - 10));
+        clpr.AddPath(outer, ClipperLib.PolyType.ptSubject, true);
+        clpr.ReverseSolution = true;
+        clpr.Execute(ClipperLib.ClipType.ctUnion, solution, ClipperLib.PolyFillType.pftNegative, ClipperLib.PolyFillType.pftNegative);
+        if (solution.length > 0)
+          solution.splice(0, 1);
+      }
+      //console.log(JSON.stringify(solution));
+    }
+    else // function (polytree, delta)
+    {
+      var solution = a[0],
+        delta = a[1];
+      solution.Clear();
+      this.FixOrientations();
+      this.DoOffset(delta);
+      //now clean up 'corners' ...
+      var clpr = new ClipperLib.Clipper(0);
+      clpr.AddPaths(this.m_destPolys, ClipperLib.PolyType.ptSubject, true);
+      if (delta > 0)
+      {
+        clpr.Execute(ClipperLib.ClipType.ctUnion, solution, ClipperLib.PolyFillType.pftPositive, ClipperLib.PolyFillType.pftPositive);
+      }
+      else
+      {
+        var r = ClipperLib.Clipper.GetBounds(this.m_destPolys);
+        var outer = new ClipperLib.Path();
+        outer.push(new ClipperLib.IntPoint(r.left - 10, r.bottom + 10));
+        outer.push(new ClipperLib.IntPoint(r.right + 10, r.bottom + 10));
+        outer.push(new ClipperLib.IntPoint(r.right + 10, r.top - 10));
+        outer.push(new ClipperLib.IntPoint(r.left - 10, r.top - 10));
+        clpr.AddPath(outer, ClipperLib.PolyType.ptSubject, true);
+        clpr.ReverseSolution = true;
+        clpr.Execute(ClipperLib.ClipType.ctUnion, solution, ClipperLib.PolyFillType.pftNegative, ClipperLib.PolyFillType.pftNegative);
+        //remove the outer PolyNode rectangle ...
+        if (solution.ChildCount() == 1 && solution.Childs()[0].ChildCount() > 0)
+        {
+          var outerNode = solution.Childs()[0];
+          //solution.Childs.set_Capacity(outerNode.ChildCount);
+          solution.Childs()[0] = outerNode.Childs()[0];
+          solution.Childs()[0].m_Parent = solution;
+          for (var i = 1; i < outerNode.ChildCount(); i++)
+            solution.AddChild(outerNode.Childs()[i]);
+        }
+        else
+          solution.Clear();
+      }
+    }
+  };
+  ClipperLib.ClipperOffset.prototype.OffsetPoint = function (j, k, jointype)
+  {
+		//cross product ...
+		this.m_sinA = (this.m_normals[k].X * this.m_normals[j].Y - this.m_normals[j].X * this.m_normals[k].Y);
 
-exports.interpret = function (svgNode) {
-    var node,
-        tag = svgNode.tagName.toLowerCase();
-    if (read[tag] === undefined) {
-        return null;
+		if (Math.abs(this.m_sinA * this.m_delta) < 1.0)
+		{
+			//dot product ...
+			var cosA = (this.m_normals[k].X * this.m_normals[j].X + this.m_normals[j].Y * this.m_normals[k].Y);
+			if (cosA > 0) // angle ==> 0 degrees
+			{
+				this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_normals[k].X * this.m_delta),
+					ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_normals[k].Y * this.m_delta)));
+				return k;
+			}
+			//else angle ==> 180 degrees
+		}
+    else if (this.m_sinA > 1)
+      this.m_sinA = 1.0;
+    else if (this.m_sinA < -1)
+      this.m_sinA = -1.0;
+    if (this.m_sinA * this.m_delta < 0)
+    {
+      this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_normals[k].X * this.m_delta),
+        ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_normals[k].Y * this.m_delta)));
+      this.m_destPoly.push(new ClipperLib.IntPoint(this.m_srcPoly[j]));
+      this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_normals[j].X * this.m_delta),
+        ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_normals[j].Y * this.m_delta)));
     }
+    else
+      switch (jointype)
+      {
+      case ClipperLib.JoinType.jtMiter:
+        {
+          var r = 1 + (this.m_normals[j].X * this.m_normals[k].X + this.m_normals[j].Y * this.m_normals[k].Y);
+          if (r >= this.m_miterLim)
+            this.DoMiter(j, k, r);
+          else
+            this.DoSquare(j, k);
+          break;
+        }
+      case ClipperLib.JoinType.jtSquare:
+        this.DoSquare(j, k);
+        break;
+      case ClipperLib.JoinType.jtRound:
+        this.DoRound(j, k);
+        break;
+      }
+    k = j;
+    return k;
+  };
+  ClipperLib.ClipperOffset.prototype.DoSquare = function (j, k)
+  {
+    var dx = Math.tan(Math.atan2(this.m_sinA,
+      this.m_normals[k].X * this.m_normals[j].X + this.m_normals[k].Y * this.m_normals[j].Y) / 4);
+    this.m_destPoly.push(new ClipperLib.IntPoint(
+      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_delta * (this.m_normals[k].X - this.m_normals[k].Y * dx)),
+      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_delta * (this.m_normals[k].Y + this.m_normals[k].X * dx))));
+    this.m_destPoly.push(new ClipperLib.IntPoint(
+      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_delta * (this.m_normals[j].X + this.m_normals[j].Y * dx)),
+      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_delta * (this.m_normals[j].Y - this.m_normals[j].X * dx))));
+  };
+  ClipperLib.ClipperOffset.prototype.DoMiter = function (j, k, r)
+  {
+    var q = this.m_delta / r;
+    this.m_destPoly.push(new ClipperLib.IntPoint(
+      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + (this.m_normals[k].X + this.m_normals[j].X) * q),
+      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + (this.m_normals[k].Y + this.m_normals[j].Y) * q)));
+  };
+  ClipperLib.ClipperOffset.prototype.DoRound = function (j, k)
+  {
+    var a = Math.atan2(this.m_sinA,
+      this.m_normals[k].X * this.m_normals[j].X + this.m_normals[k].Y * this.m_normals[j].Y);
 
-    node = read[tag].call(this, svgNode);
-    return node;
-};
+    	var steps = Math.max(ClipperLib.Cast_Int32(ClipperLib.ClipperOffset.Round(this.m_StepsPerRad * Math.abs(a))), 1);
 
-exports.parseString = function (s) {
-    var doc = new xmldom.DOMParser({errorHandler:
-        function (key, msg) {
-            throw new Error('Could not parse string \"' + String(s) + '\": ' + msg);
+    var X = this.m_normals[k].X,
+      Y = this.m_normals[k].Y,
+      X2;
+    for (var i = 0; i < steps; ++i)
+    {
+      this.m_destPoly.push(new ClipperLib.IntPoint(
+        ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + X * this.m_delta),
+        ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + Y * this.m_delta)));
+      X2 = X;
+      X = X * this.m_cos - this.m_sin * Y;
+      Y = X2 * this.m_sin + Y * this.m_cos;
+    }
+    this.m_destPoly.push(new ClipperLib.IntPoint(
+      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].X + this.m_normals[j].X * this.m_delta),
+      ClipperLib.ClipperOffset.Round(this.m_srcPoly[j].Y + this.m_normals[j].Y * this.m_delta)));
+  };
+  ClipperLib.Error = function (message)
+  {
+    throw new Error(message);
+  };
+  // ---------------------------------
+  // JS extension by Timo 2013
+  ClipperLib.JS = {};
+  ClipperLib.JS.AreaOfPolygon = function (poly, scale)
+  {
+    if (!scale) scale = 1;
+    return ClipperLib.Clipper.Area(poly) / (scale * scale);
+  };
+  ClipperLib.JS.AreaOfPolygons = function (poly, scale)
+  {
+    if (!scale) scale = 1;
+    var area = 0;
+    for (var i = 0; i < poly.length; i++)
+    {
+      area += ClipperLib.Clipper.Area(poly[i]);
+    }
+    return area / (scale * scale);
+  };
+  ClipperLib.JS.BoundsOfPath = function (path, scale)
+  {
+    return ClipperLib.JS.BoundsOfPaths([path], scale);
+  };
+  ClipperLib.JS.BoundsOfPaths = function (paths, scale)
+  {
+    if (!scale) scale = 1;
+    var bounds = ClipperLib.Clipper.GetBounds(paths);
+    bounds.left /= scale;
+    bounds.bottom /= scale;
+    bounds.right /= scale;
+    bounds.top /= scale;
+    return bounds;
+  };
+  // Clean() joins vertices that are too near each other
+  // and causes distortion to offsetted polygons without cleaning
+  ClipperLib.JS.Clean = function (polygon, delta)
+  {
+    if (!(polygon instanceof Array)) return [];
+    var isPolygons = polygon[0] instanceof Array;
+    var polygon = ClipperLib.JS.Clone(polygon);
+    if (typeof delta != "number" || delta === null)
+    {
+      ClipperLib.Error("Delta is not a number in Clean().");
+      return polygon;
+    }
+    if (polygon.length === 0 || (polygon.length == 1 && polygon[0].length === 0) || delta < 0) return polygon;
+    if (!isPolygons) polygon = [polygon];
+    var k_length = polygon.length;
+    var len, poly, result, d, p, j, i;
+    var results = [];
+    for (var k = 0; k < k_length; k++)
+    {
+      poly = polygon[k];
+      len = poly.length;
+      if (len === 0) continue;
+      else if (len < 3)
+      {
+        result = poly;
+        results.push(result);
+        continue;
+      }
+      result = poly;
+      d = delta * delta;
+      //d = Math.floor(c_delta * c_delta);
+      p = poly[0];
+      j = 1;
+      for (i = 1; i < len; i++)
+      {
+        if ((poly[i].X - p.X) * (poly[i].X - p.X) +
+          (poly[i].Y - p.Y) * (poly[i].Y - p.Y) <= d)
+          continue;
+        result[j] = poly[i];
+        p = poly[i];
+        j++;
+      }
+      p = poly[j - 1];
+      if ((poly[0].X - p.X) * (poly[0].X - p.X) +
+        (poly[0].Y - p.Y) * (poly[0].Y - p.Y) <= d)
+        j--;
+      if (j < len)
+        result.splice(j, len - j);
+      if (result.length) results.push(result);
+    }
+    if (!isPolygons && results.length) results = results[0];
+    else if (!isPolygons && results.length === 0) results = [];
+    else if (isPolygons && results.length === 0) results = [
+      []
+    ];
+    return results;
+  }
+  // Make deep copy of Polygons or Polygon
+  // so that also IntPoint objects are cloned and not only referenced
+  // This should be the fastest way
+  ClipperLib.JS.Clone = function (polygon)
+  {
+    if (!(polygon instanceof Array)) return [];
+    if (polygon.length === 0) return [];
+    else if (polygon.length == 1 && polygon[0].length === 0) return [[]];
+    var isPolygons = polygon[0] instanceof Array;
+    if (!isPolygons) polygon = [polygon];
+    var len = polygon.length,
+      plen, i, j, result;
+    var results = new Array(len);
+    for (i = 0; i < len; i++)
+    {
+      plen = polygon[i].length;
+      result = new Array(plen);
+      for (j = 0; j < plen; j++)
+      {
+        result[j] = {
+          X: polygon[i][j].X,
+          Y: polygon[i][j].Y
+        };
+      }
+      results[i] = result;
+    }
+    if (!isPolygons) results = results[0];
+    return results;
+  };
+  // Removes points that doesn't affect much to the visual appearance.
+  // If middle point is at or under certain distance (tolerance) of the line segment between
+  // start and end point, the middle point is removed.
+  ClipperLib.JS.Lighten = function (polygon, tolerance)
+  {
+    if (!(polygon instanceof Array)) return [];
+    if (typeof tolerance != "number" || tolerance === null)
+    {
+      ClipperLib.Error("Tolerance is not a number in Lighten().")
+      return ClipperLib.JS.Clone(polygon);
+    }
+    if (polygon.length === 0 || (polygon.length == 1 && polygon[0].length === 0) || tolerance < 0)
+    {
+      return ClipperLib.JS.Clone(polygon);
+    }
+    if (!(polygon[0] instanceof Array)) polygon = [polygon];
+    var i, j, poly, k, poly2, plen, A, B, P, d, rem, addlast;
+    var bxax, byay, l, ax, ay;
+    var len = polygon.length;
+    var toleranceSq = tolerance * tolerance;
+    var results = [];
+    for (i = 0; i < len; i++)
+    {
+      poly = polygon[i];
+      plen = poly.length;
+      if (plen == 0) continue;
+      for (k = 0; k < 1000000; k++) // could be forever loop, but wiser to restrict max repeat count
+      {
+        poly2 = [];
+        plen = poly.length;
+        // the first have to added to the end, if first and last are not the same
+        // this way we ensure that also the actual last point can be removed if needed
+        if (poly[plen - 1].X != poly[0].X || poly[plen - 1].Y != poly[0].Y)
+        {
+          addlast = 1;
+          poly.push(
+          {
+            X: poly[0].X,
+            Y: poly[0].Y
+          });
+          plen = poly.length;
         }
-    }).parseFromString(s);
-    if (doc) {
-        return exports.interpret(doc.documentElement);
-    } else {
-        return null;
+        else addlast = 0;
+        rem = []; // Indexes of removed points
+        for (j = 0; j < plen - 2; j++)
+        {
+          A = poly[j]; // Start point of line segment
+          P = poly[j + 1]; // Middle point. This is the one to be removed.
+          B = poly[j + 2]; // End point of line segment
+          ax = A.X;
+          ay = A.Y;
+          bxax = B.X - ax;
+          byay = B.Y - ay;
+          if (bxax !== 0 || byay !== 0) // To avoid Nan, when A==P && P==B. And to avoid peaks (A==B && A!=P), which have lenght, but not area.
+          {
+            l = ((P.X - ax) * bxax + (P.Y - ay) * byay) / (bxax * bxax + byay * byay);
+            if (l > 1)
+            {
+              ax = B.X;
+              ay = B.Y;
+            }
+            else if (l > 0)
+            {
+              ax += bxax * l;
+              ay += byay * l;
+            }
+          }
+          bxax = P.X - ax;
+          byay = P.Y - ay;
+          d = bxax * bxax + byay * byay;
+          if (d <= toleranceSq)
+          {
+            rem[j + 1] = 1;
+            j++; // when removed, transfer the pointer to the next one
+          }
+        }
+        // add all unremoved points to poly2
+        poly2.push(
+        {
+          X: poly[0].X,
+          Y: poly[0].Y
+        });
+        for (j = 1; j < plen - 1; j++)
+          if (!rem[j]) poly2.push(
+          {
+            X: poly[j].X,
+            Y: poly[j].Y
+          });
+        poly2.push(
+        {
+          X: poly[plen - 1].X,
+          Y: poly[plen - 1].Y
+        });
+        // if the first point was added to the end, remove it
+        if (addlast) poly.pop();
+        // break, if there was not anymore removed points
+        if (!rem.length) break;
+        // else continue looping using poly2, to check if there are points to remove
+        else poly = poly2;
+      }
+      plen = poly2.length;
+      // remove duplicate from end, if needed
+      if (poly2[plen - 1].X == poly2[0].X && poly2[plen - 1].Y == poly2[0].Y)
+      {
+        poly2.pop();
+      }
+      if (poly2.length > 2) // to avoid two-point-polygons
+        results.push(poly2);
     }
-};
-
-},{"../objects/color":28,"../objects/group":29,"../objects/path":31,"../objects/point":32,"../objects/transform":35,"lodash":3,"xmldom":6}],45:[function(require,module,exports){
-// vg.js
-// JavaScript library for vector graphics
-// https://github.com/nodebox/vg.js
-// (c) 2014 EMRG
-// vg.js may be freely distributed under the MIT license.
-// Based on: canvas.js, https://github.com/clips/pattern/blob/master/pattern/canvas.js (BSD)
-// De Smedt T. & Daelemans W. (2012). Pattern for Python. Journal of Machine Learning Research.
-
-'use strict';
-
-var _ = require('lodash');
-
-var vg = {};
-
-// Utility functions
-vg.bezier = require('./util/bezier');
-vg.color = require('./util/color');
-vg.geo = require('./util/geo');
-vg.math = require('./util/math');
-vg.random = require('./util/random');
-vg.svg = require('./util/svg');
-
-// Objects
-vg.Color = require('./objects/color');
-vg.Group = require('./objects/group');
-vg.Matrix4 = require('./objects/matrix4');
-vg.Path = require('./objects/path');
-vg.Point = vg.Vec2 = require('./objects/point');
-vg.Rect = require('./objects/rect');
-vg.Text = require('./objects/text');
-vg.Transform = vg.Matrix3 = require('./objects/transform');
-vg.Vec3 = require('./objects/vec3');
-
-// Commands
-function importCommands(module) {
-    for (var k in module) {
-        vg[k] = module[k];
+    if (!(polygon[0] instanceof Array)) results = results[0];
+    if (typeof (results) == "undefined") results = [
+      []
+    ];
+    return results;
+  }
+  ClipperLib.JS.PerimeterOfPath = function (path, closed, scale)
+  {
+    if (typeof (path) == "undefined") return 0;
+    var sqrt = Math.sqrt;
+    var perimeter = 0.0;
+    var p1, p2, p1x = 0.0,
+      p1y = 0.0,
+      p2x = 0.0,
+      p2y = 0.0;
+    var j = path.length;
+    if (j < 2) return 0;
+    if (closed)
+    {
+      path[j] = path[0];
+      j++;
     }
-}
-
-var Transformable = require('./objects/transformable');
-_.extend(vg.Point.prototype, Transformable);
-_.extend(vg.Path.prototype, Transformable);
-_.extend(vg.Group.prototype, Transformable);
-_.extend(vg.Text.prototype, Transformable);
-
-importCommands(require('./commands/draw'));
-importCommands(require('./commands/filters'));
-importCommands(require('./commands/shapes'));
+    while (--j)
+    {
+      p1 = path[j];
+      p1x = p1.X;
+      p1y = p1.Y;
+      p2 = path[j - 1];
+      p2x = p2.X;
+      p2y = p2.Y;
+      perimeter += sqrt((p1x - p2x) * (p1x - p2x) + (p1y - p2y) * (p1y - p2y));
+    }
+    if (closed) path.pop();
+    return perimeter / scale;
+  };
+  ClipperLib.JS.PerimeterOfPaths = function (paths, closed, scale)
+  {
+    if (!scale) scale = 1;
+    var perimeter = 0;
+    for (var i = 0; i < paths.length; i++)
+    {
+      perimeter += ClipperLib.JS.PerimeterOfPath(paths[i], closed, scale);
+    }
+    return perimeter;
+  };
+  ClipperLib.JS.ScaleDownPath = function (path, scale)
+  {
+    var i, p;
+    if (!scale) scale = 1;
+    i = path.length;
+    while (i--)
+    {
+      p = path[i];
+      p.X = p.X / scale;
+      p.Y = p.Y / scale;
+    }
+  };
+  ClipperLib.JS.ScaleDownPaths = function (paths, scale)
+  {
+    var i, j, p;
+    if (!scale) scale = 1;
+    i = paths.length;
+    while (i--)
+    {
+      j = paths[i].length;
+      while (j--)
+      {
+        p = paths[i][j];
+        p.X = p.X / scale;
+        p.Y = p.Y / scale;
+      }
+    }
+  };
+  ClipperLib.JS.ScaleUpPath = function (path, scale)
+  {
+    var i, p, round = Math.round;
+    if (!scale) scale = 1;
+    i = path.length;
+    while (i--)
+    {
+      p = path[i];
+      p.X = round(p.X * scale);
+      p.Y = round(p.Y * scale);
+    }
+  };
+  ClipperLib.JS.ScaleUpPaths = function (paths, scale)
+  {
+    var i, j, p, round = Math.round;
+    if (!scale) scale = 1;
+    i = paths.length;
+    while (i--)
+    {
+      j = paths[i].length;
+      while (j--)
+      {
+        p = paths[i][j];
+        p.X = round(p.X * scale);
+        p.Y = round(p.Y * scale);
+      }
+    }
+  };
+  ClipperLib.ExPolygons = function ()
+  {
+    return [];
+  }
+  ClipperLib.ExPolygon = function ()
+  {
+    this.outer = null;
+    this.holes = null;
+  };
+  ClipperLib.JS.AddOuterPolyNodeToExPolygons = function (polynode, expolygons)
+  {
+    var ep = new ClipperLib.ExPolygon();
+    ep.outer = polynode.Contour();
+    var childs = polynode.Childs();
+    var ilen = childs.length;
+    ep.holes = new Array(ilen);
+    var node, n, i, j, childs2, jlen;
+    for (i = 0; i < ilen; i++)
+    {
+      node = childs[i];
+      ep.holes[i] = node.Contour();
+      //Add outer polygons contained by (nested within) holes ...
+      for (j = 0, childs2 = node.Childs(), jlen = childs2.length; j < jlen; j++)
+      {
+        n = childs2[j];
+        ClipperLib.JS.AddOuterPolyNodeToExPolygons(n, expolygons);
+      }
+    }
+    expolygons.push(ep);
+  };
+  ClipperLib.JS.ExPolygonsToPaths = function (expolygons)
+  {
+    var a, i, alen, ilen;
+    var paths = new ClipperLib.Paths();
+    for (a = 0, alen = expolygons.length; a < alen; a++)
+    {
+      paths.push(expolygons[a].outer);
+      for (i = 0, ilen = expolygons[a].holes.length; i < ilen; i++)
+      {
+        paths.push(expolygons[a].holes[i]);
+      }
+    }
+    return paths;
+  }
+  ClipperLib.JS.PolyTreeToExPolygons = function (polytree)
+  {
+    var expolygons = new ClipperLib.ExPolygons();
+    var node, i, childs, ilen;
+    for (i = 0, childs = polytree.Childs(), ilen = childs.length; i < ilen; i++)
+    {
+      node = childs[i];
+      ClipperLib.JS.AddOuterPolyNodeToExPolygons(node, expolygons);
+    }
+    return expolygons;
+  };
+})();
 
-module.exports = vg;
-},{"./commands/draw":25,"./commands/filters":26,"./commands/shapes":27,"./objects/color":28,"./objects/group":29,"./objects/matrix4":30,"./objects/path":31,"./objects/point":32,"./objects/rect":33,"./objects/text":34,"./objects/transform":35,"./objects/transformable":36,"./objects/vec3":37,"./util/bezier":38,"./util/color":39,"./util/geo":40,"./util/math":42,"./util/random":43,"./util/svg":44,"lodash":3}]},{},[9])(9)
+},{}]},{},[8])(8)
 });
\ No newline at end of file
diff --git a/dist/g.min.js b/dist/g.min.js
index 52a8a65..2305b1c 100644
--- a/dist/g.min.js
+++ b/dist/g.min.js
@@ -1,188 +1,137 @@
 (function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.g = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
-(function (process){
-!function(){function n(n){var e=!1;return function(){if(e)throw new Error("Callback was already called.");e=!0,n.apply(t,arguments)}}var t,e,r={};t=this,null!=t&&(e=t.async),r.noConflict=function(){return t.async=e,r};var u=function(n,t){if(n.forEach)return n.forEach(t);for(var e=0;e<n.length;e+=1)t(n[e],e,n)},i=function(n,t){if(n.map)return n.map(t);var e=[];return u(n,function(n,r,u){e.push(t(n,r,u))}),e},c=function(n,t,e){return n.reduce?n.reduce(t,e):(u(n,function(n,r,u){e=t(e,n,r,u)}),e)},o=function(n){if(Object.keys)return Object.keys(n);var t=[];for(var e in n)n.hasOwnProperty(e)&&t.push(e);return t};"undefined"!=typeof process&&process.nextTick?(r.nextTick=process.nextTick,"undefined"!=typeof setImmediate?r.setImmediate=function(n){setImmediate(n)}:r.setImmediate=r.nextTick):"function"==typeof setImmediate?(r.nextTick=function(n){setImmediate(n)},r.setImmediate=r.nextTick):(r.nextTick=function(n){setTimeout(n,0)},r.setImmediate=r.nextTick),r.each=function(t,e,r){if(r=r||function(){},!t.length)return r();var i=0;u(t,function(u){e(u,n(function(n){n?(r(n),r=function(){}):(i+=1,i>=t.length&&r(null))}))})},r.forEach=r.each,r.eachSeries=function(n,t,e){if(e=e||function(){},!n.length)return e();var r=0,u=function(){t(n[r],function(t){t?(e(t),e=function(){}):(r+=1,r>=n.length?e(null):u())})};u()},r.forEachSeries=r.eachSeries,r.eachLimit=function(n,t,e,r){var u=a(t);u.apply(null,[n,e,r])},r.forEachLimit=r.eachLimit;var a=function(n){return function(t,e,r){if(r=r||function(){},!t.length||n<=0)return r();var u=0,i=0,c=0;!function o(){if(u>=t.length)return r();for(;c<n&&i<t.length;)i+=1,c+=1,e(t[i-1],function(n){n?(r(n),r=function(){}):(u+=1,c-=1,u>=t.length?r():o())})}()}},l=function(n){return function(){var t=Array.prototype.slice.call(arguments);return n.apply(null,[r.each].concat(t))}},f=function(n,t){return function(){var e=Array.prototype.slice.call(arguments);return t.apply(null,[a(n)].concat(e))}},s=function(n){return function(){var t=Array.prototype.slice.call(arguments);return n.apply(null,[r.eachSeries].concat(t))}},p=function(n,t,e,r){var u=[];t=i(t,function(n,t){return{index:t,value:n}}),n(t,function(n,t){e(n.value,function(e,r){u[n.index]=r,t(e)})},function(n){r(n,u)})};r.map=l(p),r.mapSeries=s(p),r.mapLimit=function(n,t,e,r){return y(t)(n,e,r)};var y=function(n){return f(n,p)};r.reduce=function(n,t,e,u){r.eachSeries(n,function(n,r){e(t,n,function(n,e){t=e,r(n)})},function(n){u(n,t)})},r.inject=r.reduce,r.foldl=r.reduce,r.reduceRight=function(n,t,e,u){var c=i(n,function(n){return n}).reverse();r.reduce(c,t,e,u)},r.foldr=r.reduceRight;var v=function(n,t,e,r){var u=[];t=i(t,function(n,t){return{index:t,value:n}}),n(t,function(n,t){e(n.value,function(e){e&&u.push(n),t()})},function(n){r(i(u.sort(function(n,t){return n.index-t.index}),function(n){return n.value}))})};r.filter=l(v),r.filterSeries=s(v),r.select=r.filter,r.selectSeries=r.filterSeries;var h=function(n,t,e,r){var u=[];t=i(t,function(n,t){return{index:t,value:n}}),n(t,function(n,t){e(n.value,function(e){e||u.push(n),t()})},function(n){r(i(u.sort(function(n,t){return n.index-t.index}),function(n){return n.value}))})};r.reject=l(h),r.rejectSeries=s(h);var d=function(n,t,e,r){n(t,function(n,t){e(n,function(e){e?(r(n),r=function(){}):t()})},function(n){r()})};r.detect=l(d),r.detectSeries=s(d),r.some=function(n,t,e){r.each(n,function(n,r){t(n,function(n){n&&(e(!0),e=function(){}),r()})},function(n){e(!1)})},r.any=r.some,r.every=function(n,t,e){r.each(n,function(n,r){t(n,function(n){n||(e(!1),e=function(){}),r()})},function(n){e(!0)})},r.all=r.every,r.sortBy=function(n,t,e){r.map(n,function(n,e){t(n,function(t,r){t?e(t):e(null,{value:n,criteria:r})})},function(n,t){if(n)return e(n);var r=function(n,t){var e=n.criteria,r=t.criteria;return e<r?-1:e>r?1:0};e(null,i(t.sort(r),function(n){return n.value}))})},r.auto=function(n,t){t=t||function(){};var e=o(n);if(!e.length)return t(null);var i={},a=[],l=function(n){a.unshift(n)},f=function(n){for(var t=0;t<a.length;t+=1)if(a[t]===n)return void a.splice(t,1)},s=function(){u(a.slice(0),function(n){n()})};l(function(){o(i).length===e.length&&(t(null,i),t=function(){})}),u(e,function(e){var a=n[e]instanceof Function?[n[e]]:n[e],p=function(n){var c=Array.prototype.slice.call(arguments,1);if(c.length<=1&&(c=c[0]),n){var a={};u(o(i),function(n){a[n]=i[n]}),a[e]=c,t(n,a),t=function(){}}else i[e]=c,r.setImmediate(s)},y=a.slice(0,Math.abs(a.length-1))||[],v=function(){return c(y,function(n,t){return n&&i.hasOwnProperty(t)},!0)&&!i.hasOwnProperty(e)};if(v())a[a.length-1](p,i);else{var h=function(){v()&&(f(h),a[a.length-1](p,i))};l(h)}})},r.waterfall=function(n,t){if(t=t||function(){},n.constructor!==Array){var e=new Error("First argument to waterfall must be an array of functions");return t(e)}if(!n.length)return t();var u=function(n){return function(e){if(e)t.apply(null,arguments),t=function(){};else{var i=Array.prototype.slice.call(arguments,1),c=n.next();c?i.push(u(c)):i.push(t),r.setImmediate(function(){n.apply(null,i)})}}};u(r.iterator(n))()};var m=function(n,t,e){if(e=e||function(){},t.constructor===Array)n.map(t,function(n,t){n&&n(function(n){var e=Array.prototype.slice.call(arguments,1);e.length<=1&&(e=e[0]),t.call(null,n,e)})},e);else{var r={};n.each(o(t),function(n,e){t[n](function(t){var u=Array.prototype.slice.call(arguments,1);u.length<=1&&(u=u[0]),r[n]=u,e(t)})},function(n){e(n,r)})}};r.parallel=function(n,t){m({map:r.map,each:r.each},n,t)},r.parallelLimit=function(n,t,e){m({map:y(t),each:a(t)},n,e)},r.series=function(n,t){if(t=t||function(){},n.constructor===Array)r.mapSeries(n,function(n,t){n&&n(function(n){var e=Array.prototype.slice.call(arguments,1);e.length<=1&&(e=e[0]),t.call(null,n,e)})},t);else{var e={};r.eachSeries(o(n),function(t,r){n[t](function(n){var u=Array.prototype.slice.call(arguments,1);u.length<=1&&(u=u[0]),e[t]=u,r(n)})},function(n){t(n,e)})}},r.iterator=function(n){var t=function(e){var r=function(){return n.length&&n[e].apply(null,arguments),r.next()};return r.next=function(){return e<n.length-1?t(e+1):null},r};return t(0)},r.apply=function(n){var t=Array.prototype.slice.call(arguments,1);return function(){return n.apply(null,t.concat(Array.prototype.slice.call(arguments)))}};var g=function(n,t,e,r){var u=[];n(t,function(n,t){e(n,function(n,e){u=u.concat(e||[]),t(n)})},function(n){r(n,u)})};r.concat=l(g),r.concatSeries=s(g),r.whilst=function(n,t,e){n()?t(function(u){return u?e(u):void r.whilst(n,t,e)}):e()},r.doWhilst=function(n,t,e){n(function(u){return u?e(u):void(t()?r.doWhilst(n,t,e):e())})},r.until=function(n,t,e){n()?e():t(function(u){return u?e(u):void r.until(n,t,e)})},r.doUntil=function(n,t,e){n(function(u){return u?e(u):void(t()?e():r.doUntil(n,t,e))})},r.queue=function(t,e){function i(n,t,i,c){t.constructor!==Array&&(t=[t]),u(t,function(t){var u={data:t,callback:"function"==typeof c?c:null};i?n.tasks.unshift(u):n.tasks.push(u),n.saturated&&n.tasks.length===e&&n.saturated(),r.setImmediate(n.process)})}void 0===e&&(e=1);var c=0,o={tasks:[],concurrency:e,saturated:null,empty:null,drain:null,push:function(n,t){i(o,n,!1,t)},unshift:function(n,t){i(o,n,!0,t)},process:function(){if(c<o.concurrency&&o.tasks.length){var e=o.tasks.shift();o.empty&&0===o.tasks.length&&o.empty(),c+=1;var r=function(){c-=1,e.callback&&e.callback.apply(e,arguments),o.drain&&o.tasks.length+c===0&&o.drain(),o.process()},u=n(r);t(e.data,u)}},length:function(){return o.tasks.length},running:function(){return c}};return o},r.cargo=function(n,t){var e=!1,c=[],o={tasks:c,payload:t,saturated:null,empty:null,drain:null,push:function(n,e){n.constructor!==Array&&(n=[n]),u(n,function(n){c.push({data:n,callback:"function"==typeof e?e:null}),o.saturated&&c.length===t&&o.saturated()}),r.setImmediate(o.process)},process:function r(){if(!e){if(0===c.length)return void(o.drain&&o.drain());var a="number"==typeof t?c.splice(0,t):c.splice(0),l=i(a,function(n){return n.data});o.empty&&o.empty(),e=!0,n(l,function(){e=!1;var n=arguments;u(a,function(t){t.callback&&t.callback.apply(null,n)}),r()})}},length:function(){return c.length},running:function(){return e}};return o};var k=function(n){return function(t){var e=Array.prototype.slice.call(arguments,1);t.apply(null,e.concat([function(t){var e=Array.prototype.slice.call(arguments,1);"undefined"!=typeof console&&(t?console.error&&console.error(t):console[n]&&u(e,function(t){console[n](t)}))}]))}};r.log=k("log"),r.dir=k("dir"),r.memoize=function(n,t){var e={},r={};t=t||function(n){return n};var u=function(){var u=Array.prototype.slice.call(arguments),i=u.pop(),c=t.apply(null,u);c in e?i.apply(null,e[c]):c in r?r[c].push(i):(r[c]=[i],n.apply(null,u.concat([function(){e[c]=arguments;var n=r[c];delete r[c];for(var t=0,u=n.length;t<u;t++)n[t].apply(null,arguments)}])))};return u.memo=e,u.unmemoized=n,u},r.unmemoize=function(n){return function(){return(n.unmemoized||n).apply(null,arguments)}},r.times=function(n,t,e){for(var u=[],i=0;i<n;i++)u.push(i);return r.map(u,t,e)},r.timesSeries=function(n,t,e){for(var u=[],i=0;i<n;i++)u.push(i);return r.mapSeries(u,t,e)},r.compose=function(){var n=Array.prototype.reverse.call(arguments);return function(){var t=this,e=Array.prototype.slice.call(arguments),u=e.pop();r.reduce(n,e,function(n,e,r){e.apply(t,n.concat([function(){var n=arguments[0],t=Array.prototype.slice.call(arguments,1);r(n,t)}]))},function(n,e){u.apply(t,[n].concat(e))})}};var A=function(n,t){var e=function(){var e=this,r=Array.prototype.slice.call(arguments),u=r.pop();return n(t,function(n,t){n.apply(e,r.concat([t]))},u)};if(arguments.length>2){var r=Array.prototype.slice.call(arguments,2);return e.apply(this,r)}return e};r.applyEach=l(A),r.applyEachSeries=s(A),r.forever=function(n,t){function e(r){if(r){if(t)return t(r);throw r}n(e)}e()},"undefined"!=typeof define&&define.amd?define([],function(){return r}):"undefined"!=typeof module&&module.exports?module.exports=r:t.async=r}();
-
-
-}).call(this,require('_process'))
-},{"_process":4}],2:[function(require,module,exports){
-"use strict";function BigInteger(t,e,i){ClipperLib.biginteger_used=1,null!=t&&("number"==typeof t&&"undefined"==typeof e?this.fromInt(t):"number"==typeof t?this.fromNumber(t,e,i):null==e&&"string"!=typeof t?this.fromString(t,256):this.fromString(t,e))}function nbi(){return new BigInteger(null)}function am1(t,e,i,r,n,p){for(;--p>=0;){var o=e*this[t++]+i[r]+n;n=Math.floor(o/67108864),i[r++]=67108863&o}return n}function am2(t,e,i,r,n,p){for(var o=32767&e,l=e>>15;--p>=0;){var s=32767&this[t],h=this[t++]>>15,u=l*s+h*o;s=o*s+((32767&u)<<15)+i[r]+(1073741823&n),n=(s>>>30)+(u>>>15)+l*h+(n>>>30),i[r++]=1073741823&s}return n}function am3(t,e,i,r,n,p){for(var o=16383&e,l=e>>14;--p>=0;){var s=16383&this[t],h=this[t++]>>14,u=l*s+h*o;s=o*s+((16383&u)<<14)+i[r]+n,n=(s>>28)+(u>>14)+l*h,i[r++]=268435455&s}return n}function int2char(t){return BI_RM.charAt(t)}function intAt(t,e){var i=BI_RC[t.charCodeAt(e)];return null==i?-1:i}function bnpCopyTo(t){for(var e=this.t-1;e>=0;--e)t[e]=this[e];t.t=this.t,t.s=this.s}function bnpFromInt(t){this.t=1,this.s=t<0?-1:0,t>0?this[0]=t:t<-1?this[0]=t+this.DV:this.t=0}function nbv(t){var e=nbi();return e.fromInt(t),e}function bnpFromString(t,e){var i;if(16==e)i=4;else if(8==e)i=3;else if(256==e)i=8;else if(2==e)i=1;else if(32==e)i=5;else{if(4!=e)return void this.fromRadix(t,e);i=2}this.t=0,this.s=0;for(var r=t.length,n=!1,p=0;--r>=0;){var o=8==i?255&t[r]:intAt(t,r);o<0?"-"==t.charAt(r)&&(n=!0):(n=!1,0==p?this[this.t++]=o:p+i>this.DB?(this[this.t-1]|=(o&(1<<this.DB-p)-1)<<p,this[this.t++]=o>>this.DB-p):this[this.t-1]|=o<<p,p+=i,p>=this.DB&&(p-=this.DB))}8==i&&0!=(128&t[0])&&(this.s=-1,p>0&&(this[this.t-1]|=(1<<this.DB-p)-1<<p)),this.clamp(),n&&BigInteger.ZERO.subTo(this,this)}function bnpClamp(){for(var t=this.s&this.DM;this.t>0&&this[this.t-1]==t;)--this.t}function bnToString(t){if(this.s<0)return"-"+this.negate().toString(t);var e;if(16==t)e=4;else if(8==t)e=3;else if(2==t)e=1;else if(32==t)e=5;else{if(4!=t)return this.toRadix(t);e=2}var i,r=(1<<e)-1,n=!1,p="",o=this.t,l=this.DB-o*this.DB%e;if(o-- >0)for(l<this.DB&&(i=this[o]>>l)>0&&(n=!0,p=int2char(i));o>=0;)l<e?(i=(this[o]&(1<<l)-1)<<e-l,i|=this[--o]>>(l+=this.DB-e)):(i=this[o]>>(l-=e)&r,l<=0&&(l+=this.DB,--o)),i>0&&(n=!0),n&&(p+=int2char(i));return n?p:"0"}function bnNegate(){var t=nbi();return BigInteger.ZERO.subTo(this,t),t}function bnAbs(){return this.s<0?this.negate():this}function bnCompareTo(t){var e=this.s-t.s;if(0!=e)return e;var i=this.t;if(e=i-t.t,0!=e)return this.s<0?-e:e;for(;--i>=0;)if(0!=(e=this[i]-t[i]))return e;return 0}function nbits(t){var e,i=1;return 0!=(e=t>>>16)&&(t=e,i+=16),0!=(e=t>>8)&&(t=e,i+=8),0!=(e=t>>4)&&(t=e,i+=4),0!=(e=t>>2)&&(t=e,i+=2),0!=(e=t>>1)&&(t=e,i+=1),i}function bnBitLength(){return this.t<=0?0:this.DB*(this.t-1)+nbits(this[this.t-1]^this.s&this.DM)}function bnpDLShiftTo(t,e){var i;for(i=this.t-1;i>=0;--i)e[i+t]=this[i];for(i=t-1;i>=0;--i)e[i]=0;e.t=this.t+t,e.s=this.s}function bnpDRShiftTo(t,e){for(var i=t;i<this.t;++i)e[i-t]=this[i];e.t=Math.max(this.t-t,0),e.s=this.s}function bnpLShiftTo(t,e){var i,r=t%this.DB,n=this.DB-r,p=(1<<n)-1,o=Math.floor(t/this.DB),l=this.s<<r&this.DM;for(i=this.t-1;i>=0;--i)e[i+o+1]=this[i]>>n|l,l=(this[i]&p)<<r;for(i=o-1;i>=0;--i)e[i]=0;e[o]=l,e.t=this.t+o+1,e.s=this.s,e.clamp()}function bnpRShiftTo(t,e){e.s=this.s;var i=Math.floor(t/this.DB);if(i>=this.t)return void(e.t=0);var r=t%this.DB,n=this.DB-r,p=(1<<r)-1;e[0]=this[i]>>r;for(var o=i+1;o<this.t;++o)e[o-i-1]|=(this[o]&p)<<n,e[o-i]=this[o]>>r;r>0&&(e[this.t-i-1]|=(this.s&p)<<n),e.t=this.t-i,e.clamp()}function bnpSubTo(t,e){for(var i=0,r=0,n=Math.min(t.t,this.t);i<n;)r+=this[i]-t[i],e[i++]=r&this.DM,r>>=this.DB;if(t.t<this.t){for(r-=t.s;i<this.t;)r+=this[i],e[i++]=r&this.DM,r>>=this.DB;r+=this.s}else{for(r+=this.s;i<t.t;)r-=t[i],e[i++]=r&this.DM,r>>=this.DB;r-=t.s}e.s=r<0?-1:0,r<-1?e[i++]=this.DV+r:r>0&&(e[i++]=r),e.t=i,e.clamp()}function bnpMultiplyTo(t,e){var i=this.abs(),r=t.abs(),n=i.t;for(e.t=n+r.t;--n>=0;)e[n]=0;for(n=0;n<r.t;++n)e[n+i.t]=i.am(0,r[n],e,n,0,i.t);e.s=0,e.clamp(),this.s!=t.s&&BigInteger.ZERO.subTo(e,e)}function bnpSquareTo(t){for(var e=this.abs(),i=t.t=2*e.t;--i>=0;)t[i]=0;for(i=0;i<e.t-1;++i){var r=e.am(i,e[i],t,2*i,0,1);(t[i+e.t]+=e.am(i+1,2*e[i],t,2*i+1,r,e.t-i-1))>=e.DV&&(t[i+e.t]-=e.DV,t[i+e.t+1]=1)}t.t>0&&(t[t.t-1]+=e.am(i,e[i],t,2*i,0,1)),t.s=0,t.clamp()}function bnpDivRemTo(t,e,i){var r=t.abs();if(!(r.t<=0)){var n=this.abs();if(n.t<r.t)return null!=e&&e.fromInt(0),void(null!=i&&this.copyTo(i));null==i&&(i=nbi());var p=nbi(),o=this.s,l=t.s,s=this.DB-nbits(r[r.t-1]);s>0?(r.lShiftTo(s,p),n.lShiftTo(s,i)):(r.copyTo(p),n.copyTo(i));var h=p.t,u=p[h-1];if(0!=u){var a=u*(1<<this.F1)+(h>1?p[h-2]>>this.F2:0),C=this.FV/a,f=(1<<this.F1)/a,d=1<<this.F2,L=i.t,P=L-h,b=null==e?nbi():e;for(p.dlShiftTo(P,b),i.compareTo(b)>=0&&(i[i.t++]=1,i.subTo(b,i)),BigInteger.ONE.dlShiftTo(h,b),b.subTo(p,p);p.t<h;)p[p.t++]=0;for(;--P>=0;){var m=i[--L]==u?this.DM:Math.floor(i[L]*C+(i[L-1]+d)*f);if((i[L]+=p.am(0,m,i,P,0,h))<m)for(p.dlShiftTo(P,b),i.subTo(b,i);i[L]<--m;)i.subTo(b,i)}null!=e&&(i.drShiftTo(h,e),o!=l&&BigInteger.ZERO.subTo(e,e)),i.t=h,i.clamp(),s>0&&i.rShiftTo(s,i),o<0&&BigInteger.ZERO.subTo(i,i)}}}function bnMod(t){var e=nbi();return this.abs().divRemTo(t,null,e),this.s<0&&e.compareTo(BigInteger.ZERO)>0&&t.subTo(e,e),e}function Classic(t){this.m=t}function cConvert(t){return t.s<0||t.compareTo(this.m)>=0?t.mod(this.m):t}function cRevert(t){return t}function cReduce(t){t.divRemTo(this.m,null,t)}function cMulTo(t,e,i){t.multiplyTo(e,i),this.reduce(i)}function cSqrTo(t,e){t.squareTo(e),this.reduce(e)}function bnpInvDigit(){if(this.t<1)return 0;var t=this[0];if(0==(1&t))return 0;var e=3&t;return e=e*(2-(15&t)*e)&15,e=e*(2-(255&t)*e)&255,e=e*(2-((65535&t)*e&65535))&65535,e=e*(2-t*e%this.DV)%this.DV,e>0?this.DV-e:-e}function Montgomery(t){this.m=t,this.mp=t.invDigit(),this.mpl=32767&this.mp,this.mph=this.mp>>15,this.um=(1<<t.DB-15)-1,this.mt2=2*t.t}function montConvert(t){var e=nbi();return t.abs().dlShiftTo(this.m.t,e),e.divRemTo(this.m,null,e),t.s<0&&e.compareTo(BigInteger.ZERO)>0&&this.m.subTo(e,e),e}function montRevert(t){var e=nbi();return t.copyTo(e),this.reduce(e),e}function montReduce(t){for(;t.t<=this.mt2;)t[t.t++]=0;for(var e=0;e<this.m.t;++e){var i=32767&t[e],r=i*this.mpl+((i*this.mph+(t[e]>>15)*this.mpl&this.um)<<15)&t.DM;for(i=e+this.m.t,t[i]+=this.m.am(0,r,t,e,0,this.m.t);t[i]>=t.DV;)t[i]-=t.DV,t[++i]++}t.clamp(),t.drShiftTo(this.m.t,t),t.compareTo(this.m)>=0&&t.subTo(this.m,t)}function montSqrTo(t,e){t.squareTo(e),this.reduce(e)}function montMulTo(t,e,i){t.multiplyTo(e,i),this.reduce(i)}function bnpIsEven(){return 0==(this.t>0?1&this[0]:this.s)}function bnpExp(t,e){if(t>4294967295||t<1)return BigInteger.ONE;var i=nbi(),r=nbi(),n=e.convert(this),p=nbits(t)-1;for(n.copyTo(i);--p>=0;)if(e.sqrTo(i,r),(t&1<<p)>0)e.mulTo(r,n,i);else{var o=i;i=r,r=o}return e.revert(i)}function bnModPowInt(t,e){var i;return i=t<256||e.isEven()?new Classic(e):new Montgomery(e),this.exp(t,i)}function bnClone(){var t=nbi();return this.copyTo(t),t}function bnIntValue(){if(this.s<0){if(1==this.t)return this[0]-this.DV;if(0==this.t)return-1}else{if(1==this.t)return this[0];if(0==this.t)return 0}return(this[1]&(1<<32-this.DB)-1)<<this.DB|this[0]}function bnByteValue(){return 0==this.t?this.s:this[0]<<24>>24}function bnShortValue(){return 0==this.t?this.s:this[0]<<16>>16}function bnpChunkSize(t){return Math.floor(Math.LN2*this.DB/Math.log(t))}function bnSigNum(){return this.s<0?-1:this.t<=0||1==this.t&&this[0]<=0?0:1}function bnpToRadix(t){if(null==t&&(t=10),0==this.signum()||t<2||t>36)return"0";var e=this.chunkSize(t),i=Math.pow(t,e),r=nbv(i),n=nbi(),p=nbi(),o="";for(this.divRemTo(r,n,p);n.signum()>0;)o=(i+p.intValue()).toString(t).substr(1)+o,n.divRemTo(r,n,p);return p.intValue().toString(t)+o}function bnpFromRadix(t,e){this.fromInt(0),null==e&&(e=10);for(var i=this.chunkSize(e),r=Math.pow(e,i),n=!1,p=0,o=0,l=0;l<t.length;++l){var s=intAt(t,l);s<0?"-"==t.charAt(l)&&0==this.signum()&&(n=!0):(o=e*o+s,++p>=i&&(this.dMultiply(r),this.dAddOffset(o,0),p=0,o=0))}p>0&&(this.dMultiply(Math.pow(e,p)),this.dAddOffset(o,0)),n&&BigInteger.ZERO.subTo(this,this)}function bnpFromNumber(t,e,i){if("number"==typeof e)if(t<2)this.fromInt(1);else for(this.fromNumber(t,i),this.testBit(t-1)||this.bitwiseTo(BigInteger.ONE.shiftLeft(t-1),op_or,this),this.isEven()&&this.dAddOffset(1,0);!this.isProbablePrime(e);)this.dAddOffset(2,0),this.bitLength()>t&&this.subTo(BigInteger.ONE.shiftLeft(t-1),this);else{var r=new Array,n=7&t;r.length=(t>>3)+1,e.nextBytes(r),n>0?r[0]&=(1<<n)-1:r[0]=0,this.fromString(r,256)}}function bnToByteArray(){var t=this.t,e=new Array;e[0]=this.s;var i,r=this.DB-t*this.DB%8,n=0;if(t-- >0)for(r<this.DB&&(i=this[t]>>r)!=(this.s&this.DM)>>r&&(e[n++]=i|this.s<<this.DB-r);t>=0;)r<8?(i=(this[t]&(1<<r)-1)<<8-r,i|=this[--t]>>(r+=this.DB-8)):(i=this[t]>>(r-=8)&255,r<=0&&(r+=this.DB,--t)),0!=(128&i)&&(i|=-256),0==n&&(128&this.s)!=(128&i)&&++n,(n>0||i!=this.s)&&(e[n++]=i);return e}function bnEquals(t){return 0==this.compareTo(t)}function bnMin(t){return this.compareTo(t)<0?this:t}function bnMax(t){return this.compareTo(t)>0?this:t}function bnpBitwiseTo(t,e,i){var r,n,p=Math.min(t.t,this.t);for(r=0;r<p;++r)i[r]=e(this[r],t[r]);if(t.t<this.t){for(n=t.s&this.DM,r=p;r<this.t;++r)i[r]=e(this[r],n);i.t=this.t}else{for(n=this.s&this.DM,r=p;r<t.t;++r)i[r]=e(n,t[r]);i.t=t.t}i.s=e(this.s,t.s),i.clamp()}function op_and(t,e){return t&e}function bnAnd(t){var e=nbi();return this.bitwiseTo(t,op_and,e),e}function op_or(t,e){return t|e}function bnOr(t){var e=nbi();return this.bitwiseTo(t,op_or,e),e}function op_xor(t,e){return t^e}function bnXor(t){var e=nbi();return this.bitwiseTo(t,op_xor,e),e}function op_andnot(t,e){return t&~e}function bnAndNot(t){var e=nbi();return this.bitwiseTo(t,op_andnot,e),e}function bnNot(){for(var t=nbi(),e=0;e<this.t;++e)t[e]=this.DM&~this[e];return t.t=this.t,t.s=~this.s,t}function bnShiftLeft(t){var e=nbi();return t<0?this.rShiftTo(-t,e):this.lShiftTo(t,e),e}function bnShiftRight(t){var e=nbi();return t<0?this.lShiftTo(-t,e):this.rShiftTo(t,e),e}function lbit(t){if(0==t)return-1;var e=0;return 0==(65535&t)&&(t>>=16,e+=16),0==(255&t)&&(t>>=8,e+=8),0==(15&t)&&(t>>=4,e+=4),0==(3&t)&&(t>>=2,e+=2),0==(1&t)&&++e,e}function bnGetLowestSetBit(){for(var t=0;t<this.t;++t)if(0!=this[t])return t*this.DB+lbit(this[t]);return this.s<0?this.t*this.DB:-1}function cbit(t){for(var e=0;0!=t;)t&=t-1,++e;return e}function bnBitCount(){for(var t=0,e=this.s&this.DM,i=0;i<this.t;++i)t+=cbit(this[i]^e);return t}function bnTestBit(t){var e=Math.floor(t/this.DB);return e>=this.t?0!=this.s:0!=(this[e]&1<<t%this.DB)}function bnpChangeBit(t,e){var i=BigInteger.ONE.shiftLeft(t);return this.bitwiseTo(i,e,i),i}function bnSetBit(t){return this.changeBit(t,op_or)}function bnClearBit(t){return this.changeBit(t,op_andnot)}function bnFlipBit(t){return this.changeBit(t,op_xor)}function bnpAddTo(t,e){for(var i=0,r=0,n=Math.min(t.t,this.t);i<n;)r+=this[i]+t[i],e[i++]=r&this.DM,r>>=this.DB;if(t.t<this.t){for(r+=t.s;i<this.t;)r+=this[i],e[i++]=r&this.DM,r>>=this.DB;r+=this.s}else{for(r+=this.s;i<t.t;)r+=t[i],e[i++]=r&this.DM,r>>=this.DB;r+=t.s}e.s=r<0?-1:0,r>0?e[i++]=r:r<-1&&(e[i++]=this.DV+r),e.t=i,e.clamp()}function bnAdd(t){var e=nbi();return this.addTo(t,e),e}function bnSubtract(t){var e=nbi();return this.subTo(t,e),e}function bnMultiply(t){var e=nbi();return this.multiplyTo(t,e),e}function bnSquare(){var t=nbi();return this.squareTo(t),t}function bnDivide(t){var e=nbi();return this.divRemTo(t,e,null),e}function bnRemainder(t){var e=nbi();return this.divRemTo(t,null,e),e}function bnDivideAndRemainder(t){var e=nbi(),i=nbi();return this.divRemTo(t,e,i),new Array(e,i)}function bnpDMultiply(t){this[this.t]=this.am(0,t-1,this,0,0,this.t),++this.t,this.clamp()}function bnpDAddOffset(t,e){if(0!=t){for(;this.t<=e;)this[this.t++]=0;for(this[e]+=t;this[e]>=this.DV;)this[e]-=this.DV,++e>=this.t&&(this[this.t++]=0),++this[e]}}function NullExp(){}function nNop(t){return t}function nMulTo(t,e,i){t.multiplyTo(e,i)}function nSqrTo(t,e){t.squareTo(e)}function bnPow(t){return this.exp(t,new NullExp)}function bnpMultiplyLowerTo(t,e,i){var r=Math.min(this.t+t.t,e);for(i.s=0,i.t=r;r>0;)i[--r]=0;var n;for(n=i.t-this.t;r<n;++r)i[r+this.t]=this.am(0,t[r],i,r,0,this.t);for(n=Math.min(t.t,e);r<n;++r)this.am(0,t[r],i,r,0,e-r);i.clamp()}function bnpMultiplyUpperTo(t,e,i){--e;var r=i.t=this.t+t.t-e;for(i.s=0;--r>=0;)i[r]=0;for(r=Math.max(e-this.t,0);r<t.t;++r)i[this.t+r-e]=this.am(e-r,t[r],i,0,0,this.t+r-e);i.clamp(),i.drShiftTo(1,i)}function Barrett(t){this.r2=nbi(),this.q3=nbi(),BigInteger.ONE.dlShiftTo(2*t.t,this.r2),this.mu=this.r2.divide(t),this.m=t}function barrettConvert(t){if(t.s<0||t.t>2*this.m.t)return t.mod(this.m);if(t.compareTo(this.m)<0)return t;var e=nbi();return t.copyTo(e),this.reduce(e),e}function barrettRevert(t){return t}function barrettReduce(t){for(t.drShiftTo(this.m.t-1,this.r2),t.t>this.m.t+1&&(t.t=this.m.t+1,t.clamp()),this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3),this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);t.compareTo(this.r2)<0;)t.dAddOffset(1,this.m.t+1);for(t.subTo(this.r2,t);t.compareTo(this.m)>=0;)t.subTo(this.m,t)}function barrettSqrTo(t,e){t.squareTo(e),this.reduce(e)}function barrettMulTo(t,e,i){t.multiplyTo(e,i),this.reduce(i)}function bnModPow(t,e){var i,r,n=t.bitLength(),p=nbv(1);if(n<=0)return p;i=n<18?1:n<48?3:n<144?4:n<768?5:6,r=n<8?new Classic(e):e.isEven()?new Barrett(e):new Montgomery(e);var o=new Array,l=3,s=i-1,h=(1<<i)-1;if(o[1]=r.convert(this),i>1){var u=nbi();for(r.sqrTo(o[1],u);l<=h;)o[l]=nbi(),r.mulTo(u,o[l-2],o[l]),l+=2}var a,C,f=t.t-1,d=!0,L=nbi();for(n=nbits(t[f])-1;f>=0;){for(n>=s?a=t[f]>>n-s&h:(a=(t[f]&(1<<n+1)-1)<<s-n,f>0&&(a|=t[f-1]>>this.DB+n-s)),l=i;0==(1&a);)a>>=1,--l;if((n-=l)<0&&(n+=this.DB,--f),d)o[a].copyTo(p),d=!1;else{for(;l>1;)r.sqrTo(p,L),r.sqrTo(L,p),l-=2;l>0?r.sqrTo(p,L):(C=p,p=L,L=C),r.mulTo(L,o[a],p)}for(;f>=0&&0==(t[f]&1<<n);)r.sqrTo(p,L),C=p,p=L,L=C,--n<0&&(n=this.DB-1,--f)}return r.revert(p)}function bnGCD(t){var e=this.s<0?this.negate():this.clone(),i=t.s<0?t.negate():t.clone();if(e.compareTo(i)<0){var r=e;e=i,i=r}var n=e.getLowestSetBit(),p=i.getLowestSetBit();if(p<0)return e;for(n<p&&(p=n),p>0&&(e.rShiftTo(p,e),i.rShiftTo(p,i));e.signum()>0;)(n=e.getLowestSetBit())>0&&e.rShiftTo(n,e),(n=i.getLowestSetBit())>0&&i.rShiftTo(n,i),e.compareTo(i)>=0?(e.subTo(i,e),e.rShiftTo(1,e)):(i.subTo(e,i),i.rShiftTo(1,i));return p>0&&i.lShiftTo(p,i),i}function bnpModInt(t){if(t<=0)return 0;var e=this.DV%t,i=this.s<0?t-1:0;if(this.t>0)if(0==e)i=this[0]%t;else for(var r=this.t-1;r>=0;--r)i=(e*i+this[r])%t;return i}function bnModInverse(t){var e=t.isEven();if(this.isEven()&&e||0==t.signum())return BigInteger.ZERO;for(var i=t.clone(),r=this.clone(),n=nbv(1),p=nbv(0),o=nbv(0),l=nbv(1);0!=i.signum();){for(;i.isEven();)i.rShiftTo(1,i),e?(n.isEven()&&p.isEven()||(n.addTo(this,n),p.subTo(t,p)),n.rShiftTo(1,n)):p.isEven()||p.subTo(t,p),p.rShiftTo(1,p);for(;r.isEven();)r.rShiftTo(1,r),e?(o.isEven()&&l.isEven()||(o.addTo(this,o),l.subTo(t,l)),o.rShiftTo(1,o)):l.isEven()||l.subTo(t,l),l.rShiftTo(1,l);i.compareTo(r)>=0?(i.subTo(r,i),e&&n.subTo(o,n),p.subTo(l,p)):(r.subTo(i,r),e&&o.subTo(n,o),l.subTo(p,l))}return 0!=r.compareTo(BigInteger.ONE)?BigInteger.ZERO:l.compareTo(t)>=0?l.subtract(t):l.signum()<0?(l.addTo(t,l),l.signum()<0?l.add(t):l):l}function bnIsProbablePrime(t){var e,i=this.abs();if(1==i.t&&i[0]<=lowprimes[lowprimes.length-1]){for(e=0;e<lowprimes.length;++e)if(i[0]==lowprimes[e])return!0;return!1}if(i.isEven())return!1;for(e=1;e<lowprimes.length;){for(var r=lowprimes[e],n=e+1;n<lowprimes.length&&r<lplim;)r*=lowprimes[n++];for(r=i.modInt(r);e<n;)if(r%lowprimes[e++]==0)return!1}return i.millerRabin(t)}function bnpMillerRabin(t){var e=this.subtract(BigInteger.ONE),i=e.getLowestSetBit();if(i<=0)return!1;var r=e.shiftRight(i);t=t+1>>1,t>lowprimes.length&&(t=lowprimes.length);for(var n=nbi(),p=0;p<t;++p){n.fromInt(lowprimes[Math.floor(Math.random()*lowprimes.length)]);var o=n.modPow(r,this);if(0!=o.compareTo(BigInteger.ONE)&&0!=o.compareTo(e)){for(var l=1;l++<i&&0!=o.compareTo(e);)if(o=o.modPowInt(2,this),0==o.compareTo(BigInteger.ONE))return!1;if(0!=o.compareTo(e))return!1}}return!0}var use_int32=!1,use_xyz=!1,use_lines=!0,use_deprecated=!1,ClipperLib={},isNode=!1;"undefined"!=typeof module&&module.exports?(module.exports=ClipperLib,isNode=!0):"undefined"!=typeof document?window.ClipperLib=ClipperLib:self.ClipperLib=ClipperLib;var navigator_appName;if(isNode){var nav="chrome";navigator_appName="Netscape"}else{var nav=navigator.userAgent.toString().toLowerCase();navigator_appName=navigator.appName}var browser={};nav.indexOf("chrome")!=-1&&nav.indexOf("chromium")==-1?browser.chrome=1:browser.chrome=0,nav.indexOf("chromium")!=-1?browser.chromium=1:browser.chromium=0,nav.indexOf("safari")!=-1&&nav.indexOf("chrome")==-1&&nav.indexOf("chromium")==-1?browser.safari=1:browser.safari=0,nav.indexOf("firefox")!=-1?browser.firefox=1:browser.firefox=0,nav.indexOf("firefox/17")!=-1?browser.firefox17=1:browser.firefox17=0,nav.indexOf("firefox/15")!=-1?browser.firefox15=1:browser.firefox15=0,nav.indexOf("firefox/3")!=-1?browser.firefox3=1:browser.firefox3=0,nav.indexOf("opera")!=-1?browser.opera=1:browser.opera=0,nav.indexOf("msie 10")!=-1?browser.msie10=1:browser.msie10=0,nav.indexOf("msie 9")!=-1?browser.msie9=1:browser.msie9=0,nav.indexOf("msie 8")!=-1?browser.msie8=1:browser.msie8=0,nav.indexOf("msie 7")!=-1?browser.msie7=1:browser.msie7=0,nav.indexOf("msie ")!=-1?browser.msie=1:browser.msie=0,ClipperLib.biginteger_used=null;var dbits,canary=0xdeadbeefcafe,j_lm=15715070==(16777215&canary);j_lm&&"Microsoft Internet Explorer"==navigator_appName?(BigInteger.prototype.am=am2,dbits=30):j_lm&&"Netscape"!=navigator_appName?(BigInteger.prototype.am=am1,dbits=26):(BigInteger.prototype.am=am3,dbits=28),BigInteger.prototype.DB=dbits,BigInteger.prototype.DM=(1<<dbits)-1,BigInteger.prototype.DV=1<<dbits;var BI_FP=52;BigInteger.prototype.FV=Math.pow(2,BI_FP),BigInteger.prototype.F1=BI_FP-dbits,BigInteger.prototype.F2=2*dbits-BI_FP;var BI_RM="0123456789abcdefghijklmnopqrstuvwxyz",BI_RC=new Array,rr,vv;for(rr="0".charCodeAt(0),vv=0;vv<=9;++vv)BI_RC[rr++]=vv;for(rr="a".charCodeAt(0),vv=10;vv<36;++vv)BI_RC[rr++]=vv;for(rr="A".charCodeAt(0),vv=10;vv<36;++vv)BI_RC[rr++]=vv;Classic.prototype.convert=cConvert,Classic.prototype.revert=cRevert,Classic.prototype.reduce=cReduce,Classic.prototype.mulTo=cMulTo,Classic.prototype.sqrTo=cSqrTo,Montgomery.prototype.convert=montConvert,Montgomery.prototype.revert=montRevert,Montgomery.prototype.reduce=montReduce,Montgomery.prototype.mulTo=montMulTo,Montgomery.prototype.sqrTo=montSqrTo,BigInteger.prototype.copyTo=bnpCopyTo,BigInteger.prototype.fromInt=bnpFromInt,BigInteger.prototype.fromString=bnpFromString,BigInteger.prototype.clamp=bnpClamp,BigInteger.prototype.dlShiftTo=bnpDLShiftTo,BigInteger.prototype.drShiftTo=bnpDRShiftTo,BigInteger.prototype.lShiftTo=bnpLShiftTo,BigInteger.prototype.rShiftTo=bnpRShiftTo,BigInteger.prototype.subTo=bnpSubTo,BigInteger.prototype.multiplyTo=bnpMultiplyTo,BigInteger.prototype.squareTo=bnpSquareTo,BigInteger.prototype.divRemTo=bnpDivRemTo,BigInteger.prototype.invDigit=bnpInvDigit,BigInteger.prototype.isEven=bnpIsEven,BigInteger.prototype.exp=bnpExp,BigInteger.prototype.toString=bnToString,BigInteger.prototype.negate=bnNegate,BigInteger.prototype.abs=bnAbs,BigInteger.prototype.compareTo=bnCompareTo,BigInteger.prototype.bitLength=bnBitLength,BigInteger.prototype.mod=bnMod,BigInteger.prototype.modPowInt=bnModPowInt,BigInteger.ZERO=nbv(0),BigInteger.ONE=nbv(1),NullExp.prototype.convert=nNop,NullExp.prototype.revert=nNop,NullExp.prototype.mulTo=nMulTo,NullExp.prototype.sqrTo=nSqrTo,Barrett.prototype.convert=barrettConvert,Barrett.prototype.revert=barrettRevert,Barrett.prototype.reduce=barrettReduce,Barrett.prototype.mulTo=barrettMulTo,Barrett.prototype.sqrTo=barrettSqrTo;var lowprimes=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997],lplim=(1<<26)/lowprimes[lowprimes.length-1];BigInteger.prototype.chunkSize=bnpChunkSize,BigInteger.prototype.toRadix=bnpToRadix,BigInteger.prototype.fromRadix=bnpFromRadix,BigInteger.prototype.fromNumber=bnpFromNumber,BigInteger.prototype.bitwiseTo=bnpBitwiseTo,BigInteger.prototype.changeBit=bnpChangeBit,BigInteger.prototype.addTo=bnpAddTo,BigInteger.prototype.dMultiply=bnpDMultiply,BigInteger.prototype.dAddOffset=bnpDAddOffset,BigInteger.prototype.multiplyLowerTo=bnpMultiplyLowerTo,BigInteger.prototype.multiplyUpperTo=bnpMultiplyUpperTo,BigInteger.prototype.modInt=bnpModInt,BigInteger.prototype.millerRabin=bnpMillerRabin,BigInteger.prototype.clone=bnClone,BigInteger.prototype.intValue=bnIntValue,BigInteger.prototype.byteValue=bnByteValue,BigInteger.prototype.shortValue=bnShortValue,BigInteger.prototype.signum=bnSigNum,BigInteger.prototype.toByteArray=bnToByteArray,BigInteger.prototype.equals=bnEquals,BigInteger.prototype.min=bnMin,BigInteger.prototype.max=bnMax,BigInteger.prototype.and=bnAnd,BigInteger.prototype.or=bnOr,BigInteger.prototype.xor=bnXor,BigInteger.prototype.andNot=bnAndNot,BigInteger.prototype.not=bnNot,BigInteger.prototype.shiftLeft=bnShiftLeft,BigInteger.prototype.shiftRight=bnShiftRight,BigInteger.prototype.getLowestSetBit=bnGetLowestSetBit,BigInteger.prototype.bitCount=bnBitCount,BigInteger.prototype.testBit=bnTestBit,BigInteger.prototype.setBit=bnSetBit,BigInteger.prototype.clearBit=bnClearBit,BigInteger.prototype.flipBit=bnFlipBit,BigInteger.prototype.add=bnAdd,BigInteger.prototype.subtract=bnSubtract,BigInteger.prototype.multiply=bnMultiply,BigInteger.prototype.divide=bnDivide,BigInteger.prototype.remainder=bnRemainder,BigInteger.prototype.divideAndRemainder=bnDivideAndRemainder,BigInteger.prototype.modPow=bnModPow,BigInteger.prototype.modInverse=bnModInverse,BigInteger.prototype.pow=bnPow,BigInteger.prototype.gcd=bnGCD,BigInteger.prototype.isProbablePrime=bnIsProbablePrime,BigInteger.prototype.square=bnSquare;var Int128=BigInteger;if(Int128.prototype.IsNegative=function(){return this.compareTo(Int128.ZERO)==-1},Int128.op_Equality=function(t,e){return 0==t.compareTo(e)},Int128.op_Inequality=function(t,e){return 0!=t.compareTo(e)},Int128.op_GreaterThan=function(t,e){return t.compareTo(e)>0},Int128.op_LessThan=function(t,e){return t.compareTo(e)<0},Int128.op_Addition=function(t,e){return new Int128(t).add(new Int128(e))},Int128.op_Subtraction=function(t,e){return new Int128(t).subtract(new Int128(e))},Int128.Int128Mul=function(t,e){return new Int128(t).multiply(new Int128(e))},Int128.op_Division=function(t,e){return t.divide(e)},Int128.prototype.ToDouble=function(){return parseFloat(this.toString())},"undefined"==typeof Inherit)var Inherit=function(t,e){var i;if("undefined"==typeof Object.getOwnPropertyNames){for(i in e.prototype)"undefined"!=typeof t.prototype[i]&&t.prototype[i]!=Object.prototype[i]||(t.prototype[i]=e.prototype[i]);for(i in e)"undefined"==typeof t[i]&&(t[i]=e[i]);t.$baseCtor=e}else{for(var r=Object.getOwnPropertyNames(e.prototype),n=0;n<r.length;n++)"undefined"==typeof Object.getOwnPropertyDescriptor(t.prototype,r[n])&&Object.defineProperty(t.prototype,r[n],Object.getOwnPropertyDescriptor(e.prototype,r[n]));for(i in e)"undefined"==typeof t[i]&&(t[i]=e[i]);t.$baseCtor=e}};ClipperLib.Path=function(){return[]},ClipperLib.Paths=function(){return[]},ClipperLib.DoublePoint=function(){var t=arguments;this.X=0,this.Y=0,1==t.length?(this.X=t[0].X,this.Y=t[0].Y):2==t.length&&(this.X=t[0],this.Y=t[1])},ClipperLib.DoublePoint0=function(){this.X=0,this.Y=0},ClipperLib.DoublePoint1=function(t){this.X=t.X,this.Y=t.Y},ClipperLib.DoublePoint2=function(t,e){this.X=t,this.Y=e},ClipperLib.PolyNode=function(){this.m_Parent=null,this.m_polygon=new ClipperLib.Path,this.m_Index=0,this.m_jointype=0,this.m_endtype=0,this.m_Childs=[],this.IsOpen=!1},ClipperLib.PolyNode.prototype.IsHoleNode=function(){for(var t=!0,e=this.m_Parent;null!==e;)t=!t,e=e.m_Parent;return t},ClipperLib.PolyNode.prototype.ChildCount=function(){return this.m_Childs.length},ClipperLib.PolyNode.prototype.Contour=function(){return this.m_polygon},ClipperLib.PolyNode.prototype.AddChild=function(t){var e=this.m_Childs.length;this.m_Childs.push(t),t.m_Parent=this,t.m_Index=e},ClipperLib.PolyNode.prototype.GetNext=function(){return this.m_Childs.length>0?this.m_Childs[0]:this.GetNextSiblingUp()},ClipperLib.PolyNode.prototype.GetNextSiblingUp=function(){return null===this.m_Parent?null:this.m_Index==this.m_Parent.m_Childs.length-1?this.m_Parent.GetNextSiblingUp():this.m_Parent.m_Childs[this.m_Index+1]},ClipperLib.PolyNode.prototype.Childs=function(){return this.m_Childs},ClipperLib.PolyNode.prototype.Parent=function(){return this.m_Parent},ClipperLib.PolyNode.prototype.IsHole=function(){return this.IsHoleNode()},ClipperLib.PolyTree=function(){this.m_AllPolys=[],ClipperLib.PolyNode.call(this)},ClipperLib.PolyTree.prototype.Clear=function(){for(var t=0,e=this.m_AllPolys.length;t<e;t++)this.m_AllPolys[t]=null;this.m_AllPolys.length=0,this.m_Childs.length=0},ClipperLib.PolyTree.prototype.GetFirst=function(){return this.m_Childs.length>0?this.m_Childs[0]:null},ClipperLib.PolyTree.prototype.Total=function(){return this.m_AllPolys.length},Inherit(ClipperLib.PolyTree,ClipperLib.PolyNode),ClipperLib.Math_Abs_Int64=ClipperLib.Math_Abs_Int32=ClipperLib.Math_Abs_Double=function(t){return Math.abs(t)},ClipperLib.Math_Max_Int32_Int32=function(t,e){return Math.max(t,e)},browser.msie||browser.opera||browser.safari?ClipperLib.Cast_Int32=function(t){return 0|t}:ClipperLib.Cast_Int32=function(t){return~~t},browser.chrome?ClipperLib.Cast_Int64=function(t){return t<-2147483648||t>2147483647?t<0?Math.ceil(t):Math.floor(t):~~t}:browser.firefox&&"function"==typeof Number.toInteger?ClipperLib.Cast_Int64=function(t){return Number.toInteger(t)}:browser.msie7||browser.msie8?ClipperLib.Cast_Int64=function(t){return parseInt(t,10)}:browser.msie?ClipperLib.Cast_Int64=function(t){return t<-2147483648||t>2147483647?t<0?Math.ceil(t):Math.floor(t):0|t}:ClipperLib.Cast_Int64=function(t){return t<0?Math.ceil(t):Math.floor(t)},ClipperLib.Clear=function(t){t.length=0},ClipperLib.PI=3.141592653589793,ClipperLib.PI2=6.283185307179586,ClipperLib.IntPoint=function(){var t=arguments,e=t.length;if(this.X=0,this.Y=0,use_xyz)if(this.Z=0,3==e)this.X=t[0],this.Y=t[1],this.Z=t[2];else if(2==e)this.X=t[0],this.Y=t[1],this.Z=0;else if(1==e)if(t[0]instanceof ClipperLib.DoublePoint){var i=t[0];this.X=ClipperLib.Clipper.Round(i.X),this.Y=ClipperLib.Clipper.Round(i.Y),this.Z=0}else{var r=t[0];"undefined"==typeof r.Z&&(r.Z=0),this.X=r.X,this.Y=r.Y,this.Z=r.Z}else this.X=0,this.Y=0,this.Z=0;else if(2==e)this.X=t[0],this.Y=t[1];else if(1==e)if(t[0]instanceof ClipperLib.DoublePoint){var i=t[0];this.X=ClipperLib.Clipper.Round(i.X),this.Y=ClipperLib.Clipper.Round(i.Y)}else{var r=t[0];this.X=r.X,this.Y=r.Y}else this.X=0,this.Y=0},ClipperLib.IntPoint.op_Equality=function(t,e){return t.X==e.X&&t.Y==e.Y},ClipperLib.IntPoint.op_Inequality=function(t,e){return t.X!=e.X||t.Y!=e.Y},use_xyz?(ClipperLib.IntPoint0=function(){this.X=0,this.Y=0,this.Z=0},ClipperLib.IntPoint1=function(t){this.X=t.X,this.Y=t.Y,this.Z=t.Z},ClipperLib.IntPoint1dp=function(t){this.X=ClipperLib.Clipper.Round(t.X),this.Y=ClipperLib.Clipper.Round(t.Y),this.Z=0},ClipperLib.IntPoint2=function(t,e){this.X=t,this.Y=e,this.Z=0},ClipperLib.IntPoint3=function(t,e,i){this.X=t,this.Y=e,this.Z=i}):(ClipperLib.IntPoint0=function(){this.X=0,this.Y=0},ClipperLib.IntPoint1=function(t){this.X=t.X,this.Y=t.Y},ClipperLib.IntPoint1dp=function(t){this.X=ClipperLib.Clipper.Round(t.X),this.Y=ClipperLib.Clipper.Round(t.Y)},ClipperLib.IntPoint2=function(t,e){this.X=t,this.Y=e}),ClipperLib.IntRect=function(){var t=arguments,e=t.length;4==e?(this.left=t[0],this.top=t[1],this.right=t[2],this.bottom=t[3]):1==e?(this.left=ir.left,this.top=ir.top,this.right=ir.right,this.bottom=ir.bottom):(this.left=0,this.top=0,this.right=0,this.bottom=0)},ClipperLib.IntRect0=function(){this.left=0,this.top=0,this.right=0,this.bottom=0},ClipperLib.IntRect1=function(t){this.left=t.left,this.top=t.top,this.right=t.right,this.bottom=t.bottom},ClipperLib.IntRect4=function(t,e,i,r){this.left=t,this.top=e,this.right=i,this.bottom=r},ClipperLib.ClipType={ctIntersection:0,ctUnion:1,ctDifference:2,ctXor:3},ClipperLib.PolyType={ptSubject:0,ptClip:1},ClipperLib.PolyFillType={pftEvenOdd:0,pftNonZero:1,pftPositive:2,pftNegative:3},ClipperLib.JoinType={jtSquare:0,jtRound:1,jtMiter:2},ClipperLib.EndType={etOpenSquare:0,etOpenRound:1,etOpenButt:2,etClosedLine:3,etClosedPolygon:4},use_deprecated&&(ClipperLib.EndType_={etSquare:0,etRound:1,etButt:2,etClosed:3}),ClipperLib.EdgeSide={esLeft:0,esRight:1},ClipperLib.Direction={dRightToLeft:0,dLeftToRight:1},ClipperLib.TEdge=function(){this.Bot=new ClipperLib.IntPoint,this.Curr=new ClipperLib.IntPoint,this.Top=new ClipperLib.IntPoint,this.Delta=new ClipperLib.IntPoint,this.Dx=0,this.PolyTyp=ClipperLib.PolyType.ptSubject,this.Side=ClipperLib.EdgeSide.esLeft,this.WindDelta=0,this.WindCnt=0,this.WindCnt2=0,this.OutIdx=0,this.Next=null,this.Prev=null,this.NextInLML=null,this.NextInAEL=null,this.PrevInAEL=null,this.NextInSEL=null,this.PrevInSEL=null},ClipperLib.IntersectNode=function(){this.Edge1=null,this.Edge2=null,this.Pt=new ClipperLib.IntPoint},ClipperLib.MyIntersectNodeSort=function(){},ClipperLib.MyIntersectNodeSort.Compare=function(t,e){return e.Pt.Y-t.Pt.Y},ClipperLib.LocalMinima=function(){this.Y=0,this.LeftBound=null,this.RightBound=null,this.Next=null},ClipperLib.Scanbeam=function(){this.Y=0,this.Next=null},ClipperLib.OutRec=function(){this.Idx=0,this.IsHole=!1,this.IsOpen=!1,this.FirstLeft=null,this.Pts=null,this.BottomPt=null,this.PolyNode=null},ClipperLib.OutPt=function(){this.Idx=0,this.Pt=new ClipperLib.IntPoint,this.Next=null,this.Prev=null},ClipperLib.Join=function(){this.OutPt1=null,this.OutPt2=null,this.OffPt=new ClipperLib.IntPoint},ClipperLib.ClipperBase=function(){this.m_MinimaList=null,this.m_CurrentLM=null,this.m_edges=new Array,this.m_UseFullRange=!1,this.m_HasOpenPaths=!1,this.PreserveCollinear=!1,this.m_MinimaList=null,this.m_CurrentLM=null,this.m_UseFullRange=!1,this.m_HasOpenPaths=!1},ClipperLib.ClipperBase.horizontal=-9007199254740992,ClipperLib.ClipperBase.Skip=-2,ClipperLib.ClipperBase.Unassigned=-1,ClipperLib.ClipperBase.tolerance=1e-20,use_int32?(ClipperLib.ClipperBase.loRange=46340,ClipperLib.ClipperBase.hiRange=46340):(ClipperLib.ClipperBase.loRange=47453132,ClipperLib.ClipperBase.hiRange=0xfffffffffffff),ClipperLib.ClipperBase.near_zero=function(t){return t>-ClipperLib.ClipperBase.tolerance&&t<ClipperLib.ClipperBase.tolerance},ClipperLib.ClipperBase.IsHorizontal=function(t){return 0===t.Delta.Y},ClipperLib.ClipperBase.prototype.PointIsVertex=function(t,e){var i=e;do{if(ClipperLib.IntPoint.op_Equality(i.Pt,t))return!0;i=i.Next}while(i!=e);return!1},ClipperLib.ClipperBase.prototype.PointOnLineSegment=function(t,e,i,r){return r?t.X==e.X&&t.Y==e.Y||t.X==i.X&&t.Y==i.Y||t.X>e.X==t.X<i.X&&t.Y>e.Y==t.Y<i.Y&&Int128.op_Equality(Int128.Int128Mul(t.X-e.X,i.Y-e.Y),Int128.Int128Mul(i.X-e.X,t.Y-e.Y)):t.X==e.X&&t.Y==e.Y||t.X==i.X&&t.Y==i.Y||t.X>e.X==t.X<i.X&&t.Y>e.Y==t.Y<i.Y&&(t.X-e.X)*(i.Y-e.Y)==(i.X-e.X)*(t.Y-e.Y)},ClipperLib.ClipperBase.prototype.PointOnPolygon=function(t,e,i){for(var r=e;;){if(this.PointOnLineSegment(t,r.Pt,r.Next.Pt,i))return!0;if(r=r.Next,r==e)break}return!1;
-},ClipperLib.ClipperBase.prototype.SlopesEqual=ClipperLib.ClipperBase.SlopesEqual=function(){var t,e,i,r,n,p,o,l=arguments,s=l.length;return 3==s?(t=l[0],e=l[1],o=l[2],o?Int128.op_Equality(Int128.Int128Mul(t.Delta.Y,e.Delta.X),Int128.Int128Mul(t.Delta.X,e.Delta.Y)):ClipperLib.Cast_Int64(t.Delta.Y*e.Delta.X)==ClipperLib.Cast_Int64(t.Delta.X*e.Delta.Y)):4==s?(i=l[0],r=l[1],n=l[2],o=l[3],o?Int128.op_Equality(Int128.Int128Mul(i.Y-r.Y,r.X-n.X),Int128.Int128Mul(i.X-r.X,r.Y-n.Y)):ClipperLib.Cast_Int64((i.Y-r.Y)*(r.X-n.X))-ClipperLib.Cast_Int64((i.X-r.X)*(r.Y-n.Y))===0):(i=l[0],r=l[1],n=l[2],p=l[3],o=l[4],o?Int128.op_Equality(Int128.Int128Mul(i.Y-r.Y,n.X-p.X),Int128.Int128Mul(i.X-r.X,n.Y-p.Y)):ClipperLib.Cast_Int64((i.Y-r.Y)*(n.X-p.X))-ClipperLib.Cast_Int64((i.X-r.X)*(n.Y-p.Y))===0)},ClipperLib.ClipperBase.SlopesEqual3=function(t,e,i){return i?Int128.op_Equality(Int128.Int128Mul(t.Delta.Y,e.Delta.X),Int128.Int128Mul(t.Delta.X,e.Delta.Y)):ClipperLib.Cast_Int64(t.Delta.Y*e.Delta.X)==ClipperLib.Cast_Int64(t.Delta.X*e.Delta.Y)},ClipperLib.ClipperBase.SlopesEqual4=function(t,e,i,r){return r?Int128.op_Equality(Int128.Int128Mul(t.Y-e.Y,e.X-i.X),Int128.Int128Mul(t.X-e.X,e.Y-i.Y)):ClipperLib.Cast_Int64((t.Y-e.Y)*(e.X-i.X))-ClipperLib.Cast_Int64((t.X-e.X)*(e.Y-i.Y))===0},ClipperLib.ClipperBase.SlopesEqual5=function(t,e,i,r,n){return n?Int128.op_Equality(Int128.Int128Mul(t.Y-e.Y,i.X-r.X),Int128.Int128Mul(t.X-e.X,i.Y-r.Y)):ClipperLib.Cast_Int64((t.Y-e.Y)*(i.X-r.X))-ClipperLib.Cast_Int64((t.X-e.X)*(i.Y-r.Y))===0},ClipperLib.ClipperBase.prototype.Clear=function(){this.DisposeLocalMinimaList();for(var t=0,e=this.m_edges.length;t<e;++t){for(var i=0,r=this.m_edges[t].length;i<r;++i)this.m_edges[t][i]=null;ClipperLib.Clear(this.m_edges[t])}ClipperLib.Clear(this.m_edges),this.m_UseFullRange=!1,this.m_HasOpenPaths=!1},ClipperLib.ClipperBase.prototype.DisposeLocalMinimaList=function(){for(;null!==this.m_MinimaList;){var t=this.m_MinimaList.Next;this.m_MinimaList=null,this.m_MinimaList=t}this.m_CurrentLM=null},ClipperLib.ClipperBase.prototype.RangeTest=function(t,e){e.Value?(t.X>ClipperLib.ClipperBase.hiRange||t.Y>ClipperLib.ClipperBase.hiRange||-t.X>ClipperLib.ClipperBase.hiRange||-t.Y>ClipperLib.ClipperBase.hiRange)&&ClipperLib.Error("Coordinate outside allowed range in RangeTest()."):(t.X>ClipperLib.ClipperBase.loRange||t.Y>ClipperLib.ClipperBase.loRange||-t.X>ClipperLib.ClipperBase.loRange||-t.Y>ClipperLib.ClipperBase.loRange)&&(e.Value=!0,this.RangeTest(t,e))},ClipperLib.ClipperBase.prototype.InitEdge=function(t,e,i,r){t.Next=e,t.Prev=i,t.Curr.X=r.X,t.Curr.Y=r.Y,t.OutIdx=-1},ClipperLib.ClipperBase.prototype.InitEdge2=function(t,e){t.Curr.Y>=t.Next.Curr.Y?(t.Bot.X=t.Curr.X,t.Bot.Y=t.Curr.Y,t.Top.X=t.Next.Curr.X,t.Top.Y=t.Next.Curr.Y):(t.Top.X=t.Curr.X,t.Top.Y=t.Curr.Y,t.Bot.X=t.Next.Curr.X,t.Bot.Y=t.Next.Curr.Y),this.SetDx(t),t.PolyTyp=e},ClipperLib.ClipperBase.prototype.FindNextLocMin=function(t){for(var e;;){for(;ClipperLib.IntPoint.op_Inequality(t.Bot,t.Prev.Bot)||ClipperLib.IntPoint.op_Equality(t.Curr,t.Top);)t=t.Next;if(t.Dx!=ClipperLib.ClipperBase.horizontal&&t.Prev.Dx!=ClipperLib.ClipperBase.horizontal)break;for(;t.Prev.Dx==ClipperLib.ClipperBase.horizontal;)t=t.Prev;for(e=t;t.Dx==ClipperLib.ClipperBase.horizontal;)t=t.Next;if(t.Top.Y!=t.Prev.Bot.Y){e.Prev.Bot.X<t.Bot.X&&(t=e);break}}return t},ClipperLib.ClipperBase.prototype.ProcessBound=function(t,e){var i,r,n=t,p=t;if(t.Dx==ClipperLib.ClipperBase.horizontal&&(r=e?t.Prev.Bot.X:t.Next.Bot.X,t.Bot.X!=r&&this.ReverseHorizontal(t)),p.OutIdx!=ClipperLib.ClipperBase.Skip)if(e){for(;p.Top.Y==p.Next.Bot.Y&&p.Next.OutIdx!=ClipperLib.ClipperBase.Skip;)p=p.Next;if(p.Dx==ClipperLib.ClipperBase.horizontal&&p.Next.OutIdx!=ClipperLib.ClipperBase.Skip){for(i=p;i.Prev.Dx==ClipperLib.ClipperBase.horizontal;)i=i.Prev;i.Prev.Top.X==p.Next.Top.X?e||(p=i.Prev):i.Prev.Top.X>p.Next.Top.X&&(p=i.Prev)}for(;t!=p;)t.NextInLML=t.Next,t.Dx==ClipperLib.ClipperBase.horizontal&&t!=n&&t.Bot.X!=t.Prev.Top.X&&this.ReverseHorizontal(t),t=t.Next;t.Dx==ClipperLib.ClipperBase.horizontal&&t!=n&&t.Bot.X!=t.Prev.Top.X&&this.ReverseHorizontal(t),p=p.Next}else{for(;p.Top.Y==p.Prev.Bot.Y&&p.Prev.OutIdx!=ClipperLib.ClipperBase.Skip;)p=p.Prev;if(p.Dx==ClipperLib.ClipperBase.horizontal&&p.Prev.OutIdx!=ClipperLib.ClipperBase.Skip){for(i=p;i.Next.Dx==ClipperLib.ClipperBase.horizontal;)i=i.Next;i.Next.Top.X==p.Prev.Top.X?e||(p=i.Next):i.Next.Top.X>p.Prev.Top.X&&(p=i.Next)}for(;t!=p;)t.NextInLML=t.Prev,t.Dx==ClipperLib.ClipperBase.horizontal&&t!=n&&t.Bot.X!=t.Next.Top.X&&this.ReverseHorizontal(t),t=t.Prev;t.Dx==ClipperLib.ClipperBase.horizontal&&t!=n&&t.Bot.X!=t.Next.Top.X&&this.ReverseHorizontal(t),p=p.Prev}if(p.OutIdx==ClipperLib.ClipperBase.Skip){if(t=p,e){for(;t.Top.Y==t.Next.Bot.Y;)t=t.Next;for(;t!=p&&t.Dx==ClipperLib.ClipperBase.horizontal;)t=t.Prev}else{for(;t.Top.Y==t.Prev.Bot.Y;)t=t.Prev;for(;t!=p&&t.Dx==ClipperLib.ClipperBase.horizontal;)t=t.Next}if(t==p)p=e?t.Next:t.Prev;else{t=e?p.Next:p.Prev;var o=new ClipperLib.LocalMinima;o.Next=null,o.Y=t.Bot.Y,o.LeftBound=null,o.RightBound=t,o.RightBound.WindDelta=0,p=this.ProcessBound(o.RightBound,e),this.InsertLocalMinima(o)}}return p},ClipperLib.ClipperBase.prototype.AddPath=function(t,e,i){use_lines?i||e!=ClipperLib.PolyType.ptClip||ClipperLib.Error("AddPath: Open paths must be subject."):i||ClipperLib.Error("AddPath: Open paths have been disabled.");var r=t.length-1;if(i)for(;r>0&&ClipperLib.IntPoint.op_Equality(t[r],t[0]);)--r;for(;r>0&&ClipperLib.IntPoint.op_Equality(t[r],t[r-1]);)--r;if(i&&r<2||!i&&r<1)return!1;for(var n=new Array,p=0;p<=r;p++)n.push(new ClipperLib.TEdge);var o=!0;n[1].Curr.X=t[1].X,n[1].Curr.Y=t[1].Y;var l={Value:this.m_UseFullRange};this.RangeTest(t[0],l),this.m_UseFullRange=l.Value,l.Value=this.m_UseFullRange,this.RangeTest(t[r],l),this.m_UseFullRange=l.Value,this.InitEdge(n[0],n[1],n[r],t[0]),this.InitEdge(n[r],n[0],n[r-1],t[r]);for(var p=r-1;p>=1;--p)l.Value=this.m_UseFullRange,this.RangeTest(t[p],l),this.m_UseFullRange=l.Value,this.InitEdge(n[p],n[p+1],n[p-1],t[p]);for(var s=n[0],h=s,u=s;;)if(ClipperLib.IntPoint.op_Equality(h.Curr,h.Next.Curr)){if(h==h.Next)break;h==s&&(s=h.Next),h=this.RemoveEdge(h),u=h}else{if(h.Prev==h.Next)break;if(!i||!ClipperLib.ClipperBase.SlopesEqual(h.Prev.Curr,h.Curr,h.Next.Curr,this.m_UseFullRange)||this.PreserveCollinear&&this.Pt2IsBetweenPt1AndPt3(h.Prev.Curr,h.Curr,h.Next.Curr)){if(h=h.Next,h==u)break}else h==s&&(s=h.Next),h=this.RemoveEdge(h),h=h.Prev,u=h}if(!i&&h==h.Next||i&&h.Prev==h.Next)return!1;i||(this.m_HasOpenPaths=!0,s.Prev.OutIdx=ClipperLib.ClipperBase.Skip);h=s;do this.InitEdge2(h,e),h=h.Next,o&&h.Curr.Y!=s.Curr.Y&&(o=!1);while(h!=s);if(o){if(i)return!1;h.Prev.OutIdx=ClipperLib.ClipperBase.Skip,h.Prev.Bot.X<h.Prev.Top.X&&this.ReverseHorizontal(h.Prev);var a=new ClipperLib.LocalMinima;for(a.Next=null,a.Y=h.Bot.Y,a.LeftBound=null,a.RightBound=h,a.RightBound.Side=ClipperLib.EdgeSide.esRight,a.RightBound.WindDelta=0;h.Next.OutIdx!=ClipperLib.ClipperBase.Skip;)h.NextInLML=h.Next,h.Bot.X!=h.Prev.Top.X&&this.ReverseHorizontal(h),h=h.Next;return this.InsertLocalMinima(a),this.m_edges.push(n),!0}this.m_edges.push(n);for(var C,f=null;h=this.FindNextLocMin(h),h!=f;){null==f&&(f=h);var a=new ClipperLib.LocalMinima;a.Next=null,a.Y=h.Bot.Y,h.Dx<h.Prev.Dx?(a.LeftBound=h.Prev,a.RightBound=h,C=!1):(a.LeftBound=h,a.RightBound=h.Prev,C=!0),a.LeftBound.Side=ClipperLib.EdgeSide.esLeft,a.RightBound.Side=ClipperLib.EdgeSide.esRight,i?a.LeftBound.Next==a.RightBound?a.LeftBound.WindDelta=-1:a.LeftBound.WindDelta=1:a.LeftBound.WindDelta=0,a.RightBound.WindDelta=-a.LeftBound.WindDelta,h=this.ProcessBound(a.LeftBound,C);var d=this.ProcessBound(a.RightBound,!C);a.LeftBound.OutIdx==ClipperLib.ClipperBase.Skip?a.LeftBound=null:a.RightBound.OutIdx==ClipperLib.ClipperBase.Skip&&(a.RightBound=null),this.InsertLocalMinima(a),C||(h=d)}return!0},ClipperLib.ClipperBase.prototype.AddPaths=function(t,e,i){for(var r=!1,n=0,p=t.length;n<p;++n)this.AddPath(t[n],e,i)&&(r=!0);return r},ClipperLib.ClipperBase.prototype.Pt2IsBetweenPt1AndPt3=function(t,e,i){return!(ClipperLib.IntPoint.op_Equality(t,i)||ClipperLib.IntPoint.op_Equality(t,e)||ClipperLib.IntPoint.op_Equality(i,e))&&(t.X!=i.X?e.X>t.X==e.X<i.X:e.Y>t.Y==e.Y<i.Y)},ClipperLib.ClipperBase.prototype.RemoveEdge=function(t){t.Prev.Next=t.Next,t.Next.Prev=t.Prev;var e=t.Next;return t.Prev=null,e},ClipperLib.ClipperBase.prototype.SetDx=function(t){t.Delta.X=t.Top.X-t.Bot.X,t.Delta.Y=t.Top.Y-t.Bot.Y,0===t.Delta.Y?t.Dx=ClipperLib.ClipperBase.horizontal:t.Dx=t.Delta.X/t.Delta.Y},ClipperLib.ClipperBase.prototype.InsertLocalMinima=function(t){if(null===this.m_MinimaList)this.m_MinimaList=t;else if(t.Y>=this.m_MinimaList.Y)t.Next=this.m_MinimaList,this.m_MinimaList=t;else{for(var e=this.m_MinimaList;null!==e.Next&&t.Y<e.Next.Y;)e=e.Next;t.Next=e.Next,e.Next=t}},ClipperLib.ClipperBase.prototype.PopLocalMinima=function(){null!==this.m_CurrentLM&&(this.m_CurrentLM=this.m_CurrentLM.Next)},ClipperLib.ClipperBase.prototype.ReverseHorizontal=function(t){var e=t.Top.X;t.Top.X=t.Bot.X,t.Bot.X=e,use_xyz&&(e=t.Top.Z,t.Top.Z=t.Bot.Z,t.Bot.Z=e)},ClipperLib.ClipperBase.prototype.Reset=function(){if(this.m_CurrentLM=this.m_MinimaList,null!=this.m_CurrentLM)for(var t=this.m_MinimaList;null!=t;){var e=t.LeftBound;null!=e&&(e.Curr.X=e.Bot.X,e.Curr.Y=e.Bot.Y,e.Side=ClipperLib.EdgeSide.esLeft,e.OutIdx=ClipperLib.ClipperBase.Unassigned),e=t.RightBound,null!=e&&(e.Curr.X=e.Bot.X,e.Curr.Y=e.Bot.Y,e.Side=ClipperLib.EdgeSide.esRight,e.OutIdx=ClipperLib.ClipperBase.Unassigned),t=t.Next}},ClipperLib.Clipper=function(t){"undefined"==typeof t&&(t=0),this.m_PolyOuts=null,this.m_ClipType=ClipperLib.ClipType.ctIntersection,this.m_Scanbeam=null,this.m_ActiveEdges=null,this.m_SortedEdges=null,this.m_IntersectList=null,this.m_IntersectNodeComparer=null,this.m_ExecuteLocked=!1,this.m_ClipFillType=ClipperLib.PolyFillType.pftEvenOdd,this.m_SubjFillType=ClipperLib.PolyFillType.pftEvenOdd,this.m_Joins=null,this.m_GhostJoins=null,this.m_UsingPolyTree=!1,this.ReverseSolution=!1,this.StrictlySimple=!1,ClipperLib.ClipperBase.call(this),this.m_Scanbeam=null,this.m_ActiveEdges=null,this.m_SortedEdges=null,this.m_IntersectList=new Array,this.m_IntersectNodeComparer=ClipperLib.MyIntersectNodeSort.Compare,this.m_ExecuteLocked=!1,this.m_UsingPolyTree=!1,this.m_PolyOuts=new Array,this.m_Joins=new Array,this.m_GhostJoins=new Array,this.ReverseSolution=0!==(1&t),this.StrictlySimple=0!==(2&t),this.PreserveCollinear=0!==(4&t),use_xyz&&(this.ZFillFunction=null)},ClipperLib.Clipper.ioReverseSolution=1,ClipperLib.Clipper.ioStrictlySimple=2,ClipperLib.Clipper.ioPreserveCollinear=4,ClipperLib.Clipper.prototype.Clear=function(){0!==this.m_edges.length&&(this.DisposeAllPolyPts(),ClipperLib.ClipperBase.prototype.Clear.call(this))},ClipperLib.Clipper.prototype.DisposeScanbeamList=function(){for(;null!==this.m_Scanbeam;){var t=this.m_Scanbeam.Next;this.m_Scanbeam=null,this.m_Scanbeam=t}},ClipperLib.Clipper.prototype.Reset=function(){ClipperLib.ClipperBase.prototype.Reset.call(this),this.m_Scanbeam=null,this.m_ActiveEdges=null,this.m_SortedEdges=null;for(var t=this.m_MinimaList;null!==t;)this.InsertScanbeam(t.Y),t=t.Next},ClipperLib.Clipper.prototype.InsertScanbeam=function(t){if(null===this.m_Scanbeam)this.m_Scanbeam=new ClipperLib.Scanbeam,this.m_Scanbeam.Next=null,this.m_Scanbeam.Y=t;else if(t>this.m_Scanbeam.Y){var e=new ClipperLib.Scanbeam;e.Y=t,e.Next=this.m_Scanbeam,this.m_Scanbeam=e}else{for(var i=this.m_Scanbeam;null!==i.Next&&t<=i.Next.Y;)i=i.Next;if(t==i.Y)return;var e=new ClipperLib.Scanbeam;e.Y=t,e.Next=i.Next,i.Next=e}},ClipperLib.Clipper.prototype.Execute=function(){var t=arguments,e=t.length,i=t[1]instanceof ClipperLib.PolyTree;if(4==e&&!i){var r=t[0],n=t[1],p=t[2],o=t[3];if(this.m_ExecuteLocked)return!1;this.m_HasOpenPaths&&ClipperLib.Error("Error: PolyTree struct is need for open path clipping."),this.m_ExecuteLocked=!0,ClipperLib.Clear(n),this.m_SubjFillType=p,this.m_ClipFillType=o,this.m_ClipType=r,this.m_UsingPolyTree=!1;try{var l=this.ExecuteInternal();l&&this.BuildResult(n)}finally{this.DisposeAllPolyPts(),this.m_ExecuteLocked=!1}return l}if(4==e&&i){var r=t[0],s=t[1],p=t[2],o=t[3];if(this.m_ExecuteLocked)return!1;this.m_ExecuteLocked=!0,this.m_SubjFillType=p,this.m_ClipFillType=o,this.m_ClipType=r,this.m_UsingPolyTree=!0;try{var l=this.ExecuteInternal();l&&this.BuildResult2(s)}finally{this.DisposeAllPolyPts(),this.m_ExecuteLocked=!1}return l}if(2==e&&!i){var r=t[0],n=t[1];return this.Execute(r,n,ClipperLib.PolyFillType.pftEvenOdd,ClipperLib.PolyFillType.pftEvenOdd)}if(2==e&&i){var r=t[0],s=t[1];return this.Execute(r,s,ClipperLib.PolyFillType.pftEvenOdd,ClipperLib.PolyFillType.pftEvenOdd)}},ClipperLib.Clipper.prototype.FixHoleLinkage=function(t){if(null!==t.FirstLeft&&(t.IsHole==t.FirstLeft.IsHole||null===t.FirstLeft.Pts)){for(var e=t.FirstLeft;null!==e&&(e.IsHole==t.IsHole||null===e.Pts);)e=e.FirstLeft;t.FirstLeft=e}},ClipperLib.Clipper.prototype.ExecuteInternal=function(){try{if(this.Reset(),null===this.m_CurrentLM)return!1;var t=this.PopScanbeam();do{if(this.InsertLocalMinimaIntoAEL(t),ClipperLib.Clear(this.m_GhostJoins),this.ProcessHorizontals(!1),null===this.m_Scanbeam)break;var e=this.PopScanbeam();if(!this.ProcessIntersections(t,e))return!1;this.ProcessEdgesAtTopOfScanbeam(e),t=e}while(null!==this.m_Scanbeam||null!==this.m_CurrentLM);for(var i=0,r=this.m_PolyOuts.length;i<r;i++){var n=this.m_PolyOuts[i];null===n.Pts||n.IsOpen||(n.IsHole^this.ReverseSolution)==this.Area(n)>0&&this.ReversePolyPtLinks(n.Pts)}this.JoinCommonEdges();for(var i=0,r=this.m_PolyOuts.length;i<r;i++){var n=this.m_PolyOuts[i];null===n.Pts||n.IsOpen||this.FixupOutPolygon(n)}return this.StrictlySimple&&this.DoSimplePolygons(),!0}finally{ClipperLib.Clear(this.m_Joins),ClipperLib.Clear(this.m_GhostJoins)}},ClipperLib.Clipper.prototype.PopScanbeam=function(){var t=this.m_Scanbeam.Y,e=this.m_Scanbeam;return this.m_Scanbeam=this.m_Scanbeam.Next,e=null,t},ClipperLib.Clipper.prototype.DisposeAllPolyPts=function(){for(var t=0,e=this.m_PolyOuts.length;t<e;++t)this.DisposeOutRec(t);ClipperLib.Clear(this.m_PolyOuts)},ClipperLib.Clipper.prototype.DisposeOutRec=function(t){var e=this.m_PolyOuts[t];null!==e.Pts&&this.DisposeOutPts(e.Pts),e=null,this.m_PolyOuts[t]=null},ClipperLib.Clipper.prototype.DisposeOutPts=function(t){if(null!==t){var e=null;for(t.Prev.Next=null;null!==t;)e=t,t=t.Next,e=null}},ClipperLib.Clipper.prototype.AddJoin=function(t,e,i){var r=new ClipperLib.Join;r.OutPt1=t,r.OutPt2=e,r.OffPt.X=i.X,r.OffPt.Y=i.Y,this.m_Joins.push(r)},ClipperLib.Clipper.prototype.AddGhostJoin=function(t,e){var i=new ClipperLib.Join;i.OutPt1=t,i.OffPt.X=e.X,i.OffPt.Y=e.Y,this.m_GhostJoins.push(i)},use_xyz&&(ClipperLib.Clipper.prototype.SetZ=function(t,e){t.Z=0,null!==this.ZFillFunction&&(e.OutIdx<0?this.ZFillFunction(e.Bot,e.Top,t):this.ZFillFunction(e.Top,e.Bot,t))}),ClipperLib.Clipper.prototype.InsertLocalMinimaIntoAEL=function(t){for(;null!==this.m_CurrentLM&&this.m_CurrentLM.Y==t;){var e=this.m_CurrentLM.LeftBound,i=this.m_CurrentLM.RightBound;this.PopLocalMinima();var r=null;if(null===e?(this.InsertEdgeIntoAEL(i,null),this.SetWindingCount(i),this.IsContributing(i)&&(r=this.AddOutPt(i,i.Bot))):null==i?(this.InsertEdgeIntoAEL(e,null),this.SetWindingCount(e),this.IsContributing(e)&&(r=this.AddOutPt(e,e.Bot)),this.InsertScanbeam(e.Top.Y)):(this.InsertEdgeIntoAEL(e,null),this.InsertEdgeIntoAEL(i,e),this.SetWindingCount(e),i.WindCnt=e.WindCnt,i.WindCnt2=e.WindCnt2,this.IsContributing(e)&&(r=this.AddLocalMinPoly(e,i,e.Bot)),this.InsertScanbeam(e.Top.Y)),null!=i&&(ClipperLib.ClipperBase.IsHorizontal(i)?this.AddEdgeToSEL(i):this.InsertScanbeam(i.Top.Y)),null!=e&&null!=i){if(null!==r&&ClipperLib.ClipperBase.IsHorizontal(i)&&this.m_GhostJoins.length>0&&0!==i.WindDelta)for(var n=0,p=this.m_GhostJoins.length;n<p;n++){var o=this.m_GhostJoins[n];this.HorzSegmentsOverlap(o.OutPt1.Pt,o.OffPt,i.Bot,i.Top)&&this.AddJoin(o.OutPt1,r,o.OffPt)}if(e.OutIdx>=0&&null!==e.PrevInAEL&&e.PrevInAEL.Curr.X==e.Bot.X&&e.PrevInAEL.OutIdx>=0&&ClipperLib.ClipperBase.SlopesEqual(e.PrevInAEL,e,this.m_UseFullRange)&&0!==e.WindDelta&&0!==e.PrevInAEL.WindDelta){var l=this.AddOutPt(e.PrevInAEL,e.Bot);this.AddJoin(r,l,e.Top)}if(e.NextInAEL!=i){if(i.OutIdx>=0&&i.PrevInAEL.OutIdx>=0&&ClipperLib.ClipperBase.SlopesEqual(i.PrevInAEL,i,this.m_UseFullRange)&&0!==i.WindDelta&&0!==i.PrevInAEL.WindDelta){var l=this.AddOutPt(i.PrevInAEL,i.Bot);this.AddJoin(r,l,i.Top)}var s=e.NextInAEL;if(null!==s)for(;s!=i;)this.IntersectEdges(i,s,e.Curr,!1),s=s.NextInAEL}}}},ClipperLib.Clipper.prototype.InsertEdgeIntoAEL=function(t,e){if(null===this.m_ActiveEdges)t.PrevInAEL=null,t.NextInAEL=null,this.m_ActiveEdges=t;else if(null===e&&this.E2InsertsBeforeE1(this.m_ActiveEdges,t))t.PrevInAEL=null,t.NextInAEL=this.m_ActiveEdges,this.m_ActiveEdges.PrevInAEL=t,this.m_ActiveEdges=t;else{for(null===e&&(e=this.m_ActiveEdges);null!==e.NextInAEL&&!this.E2InsertsBeforeE1(e.NextInAEL,t);)e=e.NextInAEL;t.NextInAEL=e.NextInAEL,null!==e.NextInAEL&&(e.NextInAEL.PrevInAEL=t),t.PrevInAEL=e,e.NextInAEL=t}},ClipperLib.Clipper.prototype.E2InsertsBeforeE1=function(t,e){return e.Curr.X==t.Curr.X?e.Top.Y>t.Top.Y?e.Top.X<ClipperLib.Clipper.TopX(t,e.Top.Y):t.Top.X>ClipperLib.Clipper.TopX(e,t.Top.Y):e.Curr.X<t.Curr.X},ClipperLib.Clipper.prototype.IsEvenOddFillType=function(t){return t.PolyTyp==ClipperLib.PolyType.ptSubject?this.m_SubjFillType==ClipperLib.PolyFillType.pftEvenOdd:this.m_ClipFillType==ClipperLib.PolyFillType.pftEvenOdd},ClipperLib.Clipper.prototype.IsEvenOddAltFillType=function(t){return t.PolyTyp==ClipperLib.PolyType.ptSubject?this.m_ClipFillType==ClipperLib.PolyFillType.pftEvenOdd:this.m_SubjFillType==ClipperLib.PolyFillType.pftEvenOdd},ClipperLib.Clipper.prototype.IsContributing=function(t){var e,i;switch(t.PolyTyp==ClipperLib.PolyType.ptSubject?(e=this.m_SubjFillType,i=this.m_ClipFillType):(e=this.m_ClipFillType,i=this.m_SubjFillType),e){case ClipperLib.PolyFillType.pftEvenOdd:if(0===t.WindDelta&&1!=t.WindCnt)return!1;break;case ClipperLib.PolyFillType.pftNonZero:if(1!=Math.abs(t.WindCnt))return!1;break;case ClipperLib.PolyFillType.pftPositive:if(1!=t.WindCnt)return!1;break;default:if(t.WindCnt!=-1)return!1}switch(this.m_ClipType){case ClipperLib.ClipType.ctIntersection:switch(i){case ClipperLib.PolyFillType.pftEvenOdd:case ClipperLib.PolyFillType.pftNonZero:return 0!==t.WindCnt2;case ClipperLib.PolyFillType.pftPositive:return t.WindCnt2>0;default:return t.WindCnt2<0}case ClipperLib.ClipType.ctUnion:switch(i){case ClipperLib.PolyFillType.pftEvenOdd:case ClipperLib.PolyFillType.pftNonZero:return 0===t.WindCnt2;case ClipperLib.PolyFillType.pftPositive:return t.WindCnt2<=0;default:return t.WindCnt2>=0}case ClipperLib.ClipType.ctDifference:if(t.PolyTyp==ClipperLib.PolyType.ptSubject)switch(i){case ClipperLib.PolyFillType.pftEvenOdd:case ClipperLib.PolyFillType.pftNonZero:return 0===t.WindCnt2;case ClipperLib.PolyFillType.pftPositive:return t.WindCnt2<=0;default:return t.WindCnt2>=0}else switch(i){case ClipperLib.PolyFillType.pftEvenOdd:case ClipperLib.PolyFillType.pftNonZero:return 0!==t.WindCnt2;case ClipperLib.PolyFillType.pftPositive:return t.WindCnt2>0;default:return t.WindCnt2<0}case ClipperLib.ClipType.ctXor:if(0!==t.WindDelta)return!0;switch(i){case ClipperLib.PolyFillType.pftEvenOdd:case ClipperLib.PolyFillType.pftNonZero:return 0===t.WindCnt2;case ClipperLib.PolyFillType.pftPositive:return t.WindCnt2<=0;default:return t.WindCnt2>=0}}return!0},ClipperLib.Clipper.prototype.SetWindingCount=function(t){for(var e=t.PrevInAEL;null!==e&&(e.PolyTyp!=t.PolyTyp||0===e.WindDelta);)e=e.PrevInAEL;if(null===e)t.WindCnt=0===t.WindDelta?1:t.WindDelta,t.WindCnt2=0,e=this.m_ActiveEdges;else if(0===t.WindDelta&&this.m_ClipType!=ClipperLib.ClipType.ctUnion)t.WindCnt=1,t.WindCnt2=e.WindCnt2,e=e.NextInAEL;else if(this.IsEvenOddFillType(t)){if(0===t.WindDelta){for(var i=!0,r=e.PrevInAEL;null!==r;)r.PolyTyp==e.PolyTyp&&0!==r.WindDelta&&(i=!i),r=r.PrevInAEL;t.WindCnt=i?0:1}else t.WindCnt=t.WindDelta;t.WindCnt2=e.WindCnt2,e=e.NextInAEL}else e.WindCnt*e.WindDelta<0?Math.abs(e.WindCnt)>1?e.WindDelta*t.WindDelta<0?t.WindCnt=e.WindCnt:t.WindCnt=e.WindCnt+t.WindDelta:t.WindCnt=0===t.WindDelta?1:t.WindDelta:0===t.WindDelta?t.WindCnt=e.WindCnt<0?e.WindCnt-1:e.WindCnt+1:e.WindDelta*t.WindDelta<0?t.WindCnt=e.WindCnt:t.WindCnt=e.WindCnt+t.WindDelta,t.WindCnt2=e.WindCnt2,e=e.NextInAEL;if(this.IsEvenOddAltFillType(t))for(;e!=t;)0!==e.WindDelta&&(t.WindCnt2=0===t.WindCnt2?1:0),e=e.NextInAEL;else for(;e!=t;)t.WindCnt2+=e.WindDelta,e=e.NextInAEL},ClipperLib.Clipper.prototype.AddEdgeToSEL=function(t){null===this.m_SortedEdges?(this.m_SortedEdges=t,t.PrevInSEL=null,t.NextInSEL=null):(t.NextInSEL=this.m_SortedEdges,t.PrevInSEL=null,this.m_SortedEdges.PrevInSEL=t,this.m_SortedEdges=t)},ClipperLib.Clipper.prototype.CopyAELToSEL=function(){var t=this.m_ActiveEdges;for(this.m_SortedEdges=t;null!==t;)t.PrevInSEL=t.PrevInAEL,t.NextInSEL=t.NextInAEL,t=t.NextInAEL},ClipperLib.Clipper.prototype.SwapPositionsInAEL=function(t,e){if(t.NextInAEL!=t.PrevInAEL&&e.NextInAEL!=e.PrevInAEL){if(t.NextInAEL==e){var i=e.NextInAEL;null!==i&&(i.PrevInAEL=t);var r=t.PrevInAEL;null!==r&&(r.NextInAEL=e),e.PrevInAEL=r,e.NextInAEL=t,t.PrevInAEL=e,t.NextInAEL=i}else if(e.NextInAEL==t){var i=t.NextInAEL;null!==i&&(i.PrevInAEL=e);var r=e.PrevInAEL;null!==r&&(r.NextInAEL=t),t.PrevInAEL=r,t.NextInAEL=e,e.PrevInAEL=t,e.NextInAEL=i}else{var i=t.NextInAEL,r=t.PrevInAEL;t.NextInAEL=e.NextInAEL,null!==t.NextInAEL&&(t.NextInAEL.PrevInAEL=t),t.PrevInAEL=e.PrevInAEL,null!==t.PrevInAEL&&(t.PrevInAEL.NextInAEL=t),e.NextInAEL=i,null!==e.NextInAEL&&(e.NextInAEL.PrevInAEL=e),e.PrevInAEL=r,null!==e.PrevInAEL&&(e.PrevInAEL.NextInAEL=e)}null===t.PrevInAEL?this.m_ActiveEdges=t:null===e.PrevInAEL&&(this.m_ActiveEdges=e)}},ClipperLib.Clipper.prototype.SwapPositionsInSEL=function(t,e){if(!(null===t.NextInSEL&&null===t.PrevInSEL||null===e.NextInSEL&&null===e.PrevInSEL)){if(t.NextInSEL==e){var i=e.NextInSEL;null!==i&&(i.PrevInSEL=t);var r=t.PrevInSEL;null!==r&&(r.NextInSEL=e),e.PrevInSEL=r,e.NextInSEL=t,t.PrevInSEL=e,t.NextInSEL=i}else if(e.NextInSEL==t){var i=t.NextInSEL;null!==i&&(i.PrevInSEL=e);var r=e.PrevInSEL;null!==r&&(r.NextInSEL=t),t.PrevInSEL=r,t.NextInSEL=e,e.PrevInSEL=t,e.NextInSEL=i}else{var i=t.NextInSEL,r=t.PrevInSEL;t.NextInSEL=e.NextInSEL,null!==t.NextInSEL&&(t.NextInSEL.PrevInSEL=t),t.PrevInSEL=e.PrevInSEL,null!==t.PrevInSEL&&(t.PrevInSEL.NextInSEL=t),e.NextInSEL=i,null!==e.NextInSEL&&(e.NextInSEL.PrevInSEL=e),e.PrevInSEL=r,null!==e.PrevInSEL&&(e.PrevInSEL.NextInSEL=e)}null===t.PrevInSEL?this.m_SortedEdges=t:null===e.PrevInSEL&&(this.m_SortedEdges=e)}},ClipperLib.Clipper.prototype.AddLocalMaxPoly=function(t,e,i){this.AddOutPt(t,i),0==e.WindDelta&&this.AddOutPt(e,i),t.OutIdx==e.OutIdx?(t.OutIdx=-1,e.OutIdx=-1):t.OutIdx<e.OutIdx?this.AppendPolygon(t,e):this.AppendPolygon(e,t)},ClipperLib.Clipper.prototype.AddLocalMinPoly=function(t,e,i){var r,n,p;if(ClipperLib.ClipperBase.IsHorizontal(e)||t.Dx>e.Dx?(r=this.AddOutPt(t,i),e.OutIdx=t.OutIdx,t.Side=ClipperLib.EdgeSide.esLeft,e.Side=ClipperLib.EdgeSide.esRight,n=t,p=n.PrevInAEL==e?e.PrevInAEL:n.PrevInAEL):(r=this.AddOutPt(e,i),t.OutIdx=e.OutIdx,t.Side=ClipperLib.EdgeSide.esRight,e.Side=ClipperLib.EdgeSide.esLeft,n=e,p=n.PrevInAEL==t?t.PrevInAEL:n.PrevInAEL),null!==p&&p.OutIdx>=0&&ClipperLib.Clipper.TopX(p,i.Y)==ClipperLib.Clipper.TopX(n,i.Y)&&ClipperLib.ClipperBase.SlopesEqual(n,p,this.m_UseFullRange)&&0!==n.WindDelta&&0!==p.WindDelta){var o=this.AddOutPt(p,i);this.AddJoin(r,o,n.Top)}return r},ClipperLib.Clipper.prototype.CreateOutRec=function(){var t=new ClipperLib.OutRec;return t.Idx=-1,t.IsHole=!1,t.IsOpen=!1,t.FirstLeft=null,t.Pts=null,t.BottomPt=null,t.PolyNode=null,this.m_PolyOuts.push(t),t.Idx=this.m_PolyOuts.length-1,t},ClipperLib.Clipper.prototype.AddOutPt=function(t,e){var i=t.Side==ClipperLib.EdgeSide.esLeft;if(t.OutIdx<0){var r=this.CreateOutRec();r.IsOpen=0===t.WindDelta;var n=new ClipperLib.OutPt;return r.Pts=n,n.Idx=r.Idx,n.Pt.X=e.X,n.Pt.Y=e.Y,n.Next=n,n.Prev=n,r.IsOpen||this.SetHoleState(t,r),use_xyz&&(ClipperLib.IntPoint.op_Equality(e,t.Bot)?(n.Pt.X=t.Bot.X,n.Pt.Y=t.Bot.Y,n.Pt.Z=t.Bot.Z):ClipperLib.IntPoint.op_Equality(e,t.Top)?(n.Pt.X=t.Top.X,n.Pt.Y=t.Top.Y,n.Pt.Z=t.Top.Z):this.SetZ(n.Pt,t)),t.OutIdx=r.Idx,n}var r=this.m_PolyOuts[t.OutIdx],p=r.Pts;if(i&&ClipperLib.IntPoint.op_Equality(e,p.Pt))return p;if(!i&&ClipperLib.IntPoint.op_Equality(e,p.Prev.Pt))return p.Prev;var n=new ClipperLib.OutPt;return n.Idx=r.Idx,n.Pt.X=e.X,n.Pt.Y=e.Y,n.Next=p,n.Prev=p.Prev,n.Prev.Next=n,p.Prev=n,i&&(r.Pts=n),use_xyz&&(ClipperLib.IntPoint.op_Equality(e,t.Bot)?(n.Pt.X=t.Bot.X,n.Pt.Y=t.Bot.Y,n.Pt.Z=t.Bot.Z):ClipperLib.IntPoint.op_Equality(e,t.Top)?(n.Pt.X=t.Top.X,n.Pt.Y=t.Top.Y,n.Pt.Z=t.Top.Z):this.SetZ(n.Pt,t)),n},ClipperLib.Clipper.prototype.SwapPoints=function(t,e){var i=new ClipperLib.IntPoint(t.Value);t.Value.X=e.Value.X,t.Value.Y=e.Value.Y,e.Value.X=i.X,e.Value.Y=i.Y},ClipperLib.Clipper.prototype.HorzSegmentsOverlap=function(t,e,i,r){return t.X>i.X==t.X<r.X||(e.X>i.X==e.X<r.X||(i.X>t.X==i.X<e.X||(r.X>t.X==r.X<e.X||(t.X==i.X&&e.X==r.X||t.X==r.X&&e.X==i.X))))},ClipperLib.Clipper.prototype.InsertPolyPtBetween=function(t,e,i){var r=new ClipperLib.OutPt;return r.Pt.X=i.X,r.Pt.Y=i.Y,e==t.Next?(t.Next=r,e.Prev=r,r.Next=e,r.Prev=t):(e.Next=r,t.Prev=r,r.Next=t,r.Prev=e),r},ClipperLib.Clipper.prototype.SetHoleState=function(t,e){for(var i=!1,r=t.PrevInAEL;null!==r;)r.OutIdx>=0&&0!=r.WindDelta&&(i=!i,null===e.FirstLeft&&(e.FirstLeft=this.m_PolyOuts[r.OutIdx])),r=r.PrevInAEL;i&&(e.IsHole=!0)},ClipperLib.Clipper.prototype.GetDx=function(t,e){return t.Y==e.Y?ClipperLib.ClipperBase.horizontal:(e.X-t.X)/(e.Y-t.Y)},ClipperLib.Clipper.prototype.FirstIsBottomPt=function(t,e){for(var i=t.Prev;ClipperLib.IntPoint.op_Equality(i.Pt,t.Pt)&&i!=t;)i=i.Prev;var r=Math.abs(this.GetDx(t.Pt,i.Pt));for(i=t.Next;ClipperLib.IntPoint.op_Equality(i.Pt,t.Pt)&&i!=t;)i=i.Next;var n=Math.abs(this.GetDx(t.Pt,i.Pt));for(i=e.Prev;ClipperLib.IntPoint.op_Equality(i.Pt,e.Pt)&&i!=e;)i=i.Prev;var p=Math.abs(this.GetDx(e.Pt,i.Pt));for(i=e.Next;ClipperLib.IntPoint.op_Equality(i.Pt,e.Pt)&&i!=e;)i=i.Next;var o=Math.abs(this.GetDx(e.Pt,i.Pt));return r>=p&&r>=o||n>=p&&n>=o},ClipperLib.Clipper.prototype.GetBottomPt=function(t){for(var e=null,i=t.Next;i!=t;)i.Pt.Y>t.Pt.Y?(t=i,e=null):i.Pt.Y==t.Pt.Y&&i.Pt.X<=t.Pt.X&&(i.Pt.X<t.Pt.X?(e=null,t=i):i.Next!=t&&i.Prev!=t&&(e=i)),i=i.Next;if(null!==e)for(;e!=i;)for(this.FirstIsBottomPt(i,e)||(t=e),e=e.Next;ClipperLib.IntPoint.op_Inequality(e.Pt,t.Pt);)e=e.Next;return t},ClipperLib.Clipper.prototype.GetLowermostRec=function(t,e){null===t.BottomPt&&(t.BottomPt=this.GetBottomPt(t.Pts)),null===e.BottomPt&&(e.BottomPt=this.GetBottomPt(e.Pts));var i=t.BottomPt,r=e.BottomPt;return i.Pt.Y>r.Pt.Y?t:i.Pt.Y<r.Pt.Y?e:i.Pt.X<r.Pt.X?t:i.Pt.X>r.Pt.X?e:i.Next==i?e:r.Next==r?t:this.FirstIsBottomPt(i,r)?t:e},ClipperLib.Clipper.prototype.Param1RightOfParam2=function(t,e){do if(t=t.FirstLeft,t==e)return!0;while(null!==t);return!1},ClipperLib.Clipper.prototype.GetOutRec=function(t){for(var e=this.m_PolyOuts[t];e!=this.m_PolyOuts[e.Idx];)e=this.m_PolyOuts[e.Idx];return e},ClipperLib.Clipper.prototype.AppendPolygon=function(t,e){var i,r=this.m_PolyOuts[t.OutIdx],n=this.m_PolyOuts[e.OutIdx];i=this.Param1RightOfParam2(r,n)?n:this.Param1RightOfParam2(n,r)?r:this.GetLowermostRec(r,n);var p,o=r.Pts,l=o.Prev,s=n.Pts,h=s.Prev;t.Side==ClipperLib.EdgeSide.esLeft?(e.Side==ClipperLib.EdgeSide.esLeft?(this.ReversePolyPtLinks(s),s.Next=o,o.Prev=s,l.Next=h,h.Prev=l,r.Pts=h):(h.Next=o,o.Prev=h,s.Prev=l,l.Next=s,r.Pts=s),p=ClipperLib.EdgeSide.esLeft):(e.Side==ClipperLib.EdgeSide.esRight?(this.ReversePolyPtLinks(s),l.Next=h,h.Prev=l,s.Next=o,o.Prev=s):(l.Next=s,s.Prev=l,o.Prev=h,h.Next=o),p=ClipperLib.EdgeSide.esRight),r.BottomPt=null,i==n&&(n.FirstLeft!=r&&(r.FirstLeft=n.FirstLeft),r.IsHole=n.IsHole),n.Pts=null,n.BottomPt=null,n.FirstLeft=r;var u=t.OutIdx,a=e.OutIdx;t.OutIdx=-1,e.OutIdx=-1;for(var C=this.m_ActiveEdges;null!==C;){if(C.OutIdx==a){C.OutIdx=u,C.Side=p;break}C=C.NextInAEL}n.Idx=r.Idx},ClipperLib.Clipper.prototype.ReversePolyPtLinks=function(t){if(null!==t){var e,i;e=t;do i=e.Next,e.Next=e.Prev,e.Prev=i,e=i;while(e!=t)}},ClipperLib.Clipper.SwapSides=function(t,e){var i=t.Side;t.Side=e.Side,e.Side=i},ClipperLib.Clipper.SwapPolyIndexes=function(t,e){var i=t.OutIdx;t.OutIdx=e.OutIdx,e.OutIdx=i},ClipperLib.Clipper.prototype.IntersectEdges=function(t,e,i,r){var n=!r&&null===t.NextInLML&&t.Top.X==i.X&&t.Top.Y==i.Y,p=!r&&null===e.NextInLML&&e.Top.X==i.X&&e.Top.Y==i.Y,o=t.OutIdx>=0,l=e.OutIdx>=0;if(use_lines&&(0===t.WindDelta||0===e.WindDelta))return 0===t.WindDelta&&0===e.WindDelta?(n||p)&&o&&l&&this.AddLocalMaxPoly(t,e,i):t.PolyTyp==e.PolyTyp&&t.WindDelta!=e.WindDelta&&this.m_ClipType==ClipperLib.ClipType.ctUnion?0===t.WindDelta?l&&(this.AddOutPt(t,i),o&&(t.OutIdx=-1)):o&&(this.AddOutPt(e,i),l&&(e.OutIdx=-1)):t.PolyTyp!=e.PolyTyp&&(0!==t.WindDelta||1!=Math.abs(e.WindCnt)||this.m_ClipType==ClipperLib.ClipType.ctUnion&&0!==e.WindCnt2?0!==e.WindDelta||1!=Math.abs(t.WindCnt)||this.m_ClipType==ClipperLib.ClipType.ctUnion&&0!==t.WindCnt2||(this.AddOutPt(e,i),l&&(e.OutIdx=-1)):(this.AddOutPt(t,i),o&&(t.OutIdx=-1))),n&&(t.OutIdx<0?this.DeleteFromAEL(t):ClipperLib.Error("Error intersecting polylines")),void(p&&(e.OutIdx<0?this.DeleteFromAEL(e):ClipperLib.Error("Error intersecting polylines")));if(t.PolyTyp==e.PolyTyp)if(this.IsEvenOddFillType(t)){var s=t.WindCnt;t.WindCnt=e.WindCnt,e.WindCnt=s}else t.WindCnt+e.WindDelta===0?t.WindCnt=-t.WindCnt:t.WindCnt+=e.WindDelta,e.WindCnt-t.WindDelta===0?e.WindCnt=-e.WindCnt:e.WindCnt-=t.WindDelta;else this.IsEvenOddFillType(e)?t.WindCnt2=0===t.WindCnt2?1:0:t.WindCnt2+=e.WindDelta,this.IsEvenOddFillType(t)?e.WindCnt2=0===e.WindCnt2?1:0:e.WindCnt2-=t.WindDelta;var h,u,a,C;t.PolyTyp==ClipperLib.PolyType.ptSubject?(h=this.m_SubjFillType,a=this.m_ClipFillType):(h=this.m_ClipFillType,a=this.m_SubjFillType),e.PolyTyp==ClipperLib.PolyType.ptSubject?(u=this.m_SubjFillType,C=this.m_ClipFillType):(u=this.m_ClipFillType,C=this.m_SubjFillType);var f,d;switch(h){case ClipperLib.PolyFillType.pftPositive:f=t.WindCnt;break;case ClipperLib.PolyFillType.pftNegative:f=-t.WindCnt;break;default:f=Math.abs(t.WindCnt)}switch(u){case ClipperLib.PolyFillType.pftPositive:d=e.WindCnt;break;case ClipperLib.PolyFillType.pftNegative:d=-e.WindCnt;break;default:d=Math.abs(e.WindCnt)}if(o&&l)n||p||0!==f&&1!=f||0!==d&&1!=d||t.PolyTyp!=e.PolyTyp&&this.m_ClipType!=ClipperLib.ClipType.ctXor?this.AddLocalMaxPoly(t,e,i):(this.AddOutPt(t,i),this.AddOutPt(e,i),ClipperLib.Clipper.SwapSides(t,e),ClipperLib.Clipper.SwapPolyIndexes(t,e));else if(o)0!==d&&1!=d||(this.AddOutPt(t,i),ClipperLib.Clipper.SwapSides(t,e),ClipperLib.Clipper.SwapPolyIndexes(t,e));else if(l)0!==f&&1!=f||(this.AddOutPt(e,i),ClipperLib.Clipper.SwapSides(t,e),ClipperLib.Clipper.SwapPolyIndexes(t,e));else if(!(0!==f&&1!=f||0!==d&&1!=d||n||p)){var L,P;switch(a){case ClipperLib.PolyFillType.pftPositive:L=t.WindCnt2;break;case ClipperLib.PolyFillType.pftNegative:L=-t.WindCnt2;break;default:L=Math.abs(t.WindCnt2)}switch(C){case ClipperLib.PolyFillType.pftPositive:P=e.WindCnt2;break;case ClipperLib.PolyFillType.pftNegative:P=-e.WindCnt2;break;default:P=Math.abs(e.WindCnt2)}if(t.PolyTyp!=e.PolyTyp)this.AddLocalMinPoly(t,e,i);else if(1==f&&1==d)switch(this.m_ClipType){case ClipperLib.ClipType.ctIntersection:L>0&&P>0&&this.AddLocalMinPoly(t,e,i);break;case ClipperLib.ClipType.ctUnion:L<=0&&P<=0&&this.AddLocalMinPoly(t,e,i);break;case ClipperLib.ClipType.ctDifference:(t.PolyTyp==ClipperLib.PolyType.ptClip&&L>0&&P>0||t.PolyTyp==ClipperLib.PolyType.ptSubject&&L<=0&&P<=0)&&this.AddLocalMinPoly(t,e,i);break;case ClipperLib.ClipType.ctXor:this.AddLocalMinPoly(t,e,i)}else ClipperLib.Clipper.SwapSides(t,e)}n!=p&&(n&&t.OutIdx>=0||p&&e.OutIdx>=0)&&(ClipperLib.Clipper.SwapSides(t,e),ClipperLib.Clipper.SwapPolyIndexes(t,e)),n&&this.DeleteFromAEL(t),p&&this.DeleteFromAEL(e)},
-ClipperLib.Clipper.prototype.DeleteFromAEL=function(t){var e=t.PrevInAEL,i=t.NextInAEL;null===e&&null===i&&t!=this.m_ActiveEdges||(null!==e?e.NextInAEL=i:this.m_ActiveEdges=i,null!==i&&(i.PrevInAEL=e),t.NextInAEL=null,t.PrevInAEL=null)},ClipperLib.Clipper.prototype.DeleteFromSEL=function(t){var e=t.PrevInSEL,i=t.NextInSEL;null===e&&null===i&&t!=this.m_SortedEdges||(null!==e?e.NextInSEL=i:this.m_SortedEdges=i,null!==i&&(i.PrevInSEL=e),t.NextInSEL=null,t.PrevInSEL=null)},ClipperLib.Clipper.prototype.UpdateEdgeIntoAEL=function(t){null===t.NextInLML&&ClipperLib.Error("UpdateEdgeIntoAEL: invalid call");var e=t.PrevInAEL,i=t.NextInAEL;return t.NextInLML.OutIdx=t.OutIdx,null!==e?e.NextInAEL=t.NextInLML:this.m_ActiveEdges=t.NextInLML,null!==i&&(i.PrevInAEL=t.NextInLML),t.NextInLML.Side=t.Side,t.NextInLML.WindDelta=t.WindDelta,t.NextInLML.WindCnt=t.WindCnt,t.NextInLML.WindCnt2=t.WindCnt2,t=t.NextInLML,t.Curr.X=t.Bot.X,t.Curr.Y=t.Bot.Y,t.PrevInAEL=e,t.NextInAEL=i,ClipperLib.ClipperBase.IsHorizontal(t)||this.InsertScanbeam(t.Top.Y),t},ClipperLib.Clipper.prototype.ProcessHorizontals=function(t){for(var e=this.m_SortedEdges;null!==e;)this.DeleteFromSEL(e),this.ProcessHorizontal(e,t),e=this.m_SortedEdges},ClipperLib.Clipper.prototype.GetHorzDirection=function(t,e){t.Bot.X<t.Top.X?(e.Left=t.Bot.X,e.Right=t.Top.X,e.Dir=ClipperLib.Direction.dLeftToRight):(e.Left=t.Top.X,e.Right=t.Bot.X,e.Dir=ClipperLib.Direction.dRightToLeft)},ClipperLib.Clipper.prototype.PrepareHorzJoins=function(t,e){var i=this.m_PolyOuts[t.OutIdx].Pts;t.Side!=ClipperLib.EdgeSide.esLeft&&(i=i.Prev),e&&(ClipperLib.IntPoint.op_Equality(i.Pt,t.Top)?this.AddGhostJoin(i,t.Bot):this.AddGhostJoin(i,t.Top))},ClipperLib.Clipper.prototype.ProcessHorizontal=function(t,e){var i={Dir:null,Left:null,Right:null};this.GetHorzDirection(t,i);for(var r=i.Dir,n=i.Left,p=i.Right,o=t,l=null;null!==o.NextInLML&&ClipperLib.ClipperBase.IsHorizontal(o.NextInLML);)o=o.NextInLML;for(null===o.NextInLML&&(l=this.GetMaximaPair(o));;){for(var s=t==o,h=this.GetNextInAEL(t,r);null!==h&&!(h.Curr.X==t.Top.X&&null!==t.NextInLML&&h.Dx<t.NextInLML.Dx);){var u=this.GetNextInAEL(h,r);if(r==ClipperLib.Direction.dLeftToRight&&h.Curr.X<=p||r==ClipperLib.Direction.dRightToLeft&&h.Curr.X>=n){if(t.OutIdx>=0&&0!=t.WindDelta&&this.PrepareHorzJoins(t,e),h==l&&s)return r==ClipperLib.Direction.dLeftToRight?this.IntersectEdges(t,h,h.Top,!1):this.IntersectEdges(h,t,h.Top,!1),void(l.OutIdx>=0&&ClipperLib.Error("ProcessHorizontal error"));if(r==ClipperLib.Direction.dLeftToRight){var a=new ClipperLib.IntPoint(h.Curr.X,t.Curr.Y);this.IntersectEdges(t,h,a,!0)}else{var a=new ClipperLib.IntPoint(h.Curr.X,t.Curr.Y);this.IntersectEdges(h,t,a,!0)}this.SwapPositionsInAEL(t,h)}else if(r==ClipperLib.Direction.dLeftToRight&&h.Curr.X>=p||r==ClipperLib.Direction.dRightToLeft&&h.Curr.X<=n)break;h=u}if(t.OutIdx>=0&&0!==t.WindDelta&&this.PrepareHorzJoins(t,e),null===t.NextInLML||!ClipperLib.ClipperBase.IsHorizontal(t.NextInLML))break;t=this.UpdateEdgeIntoAEL(t),t.OutIdx>=0&&this.AddOutPt(t,t.Bot);var i={Dir:r,Left:n,Right:p};this.GetHorzDirection(t,i),r=i.Dir,n=i.Left,p=i.Right}if(null!==t.NextInLML)if(t.OutIdx>=0){var C=this.AddOutPt(t,t.Top);if(t=this.UpdateEdgeIntoAEL(t),0===t.WindDelta)return;var f=t.PrevInAEL,u=t.NextInAEL;if(null!==f&&f.Curr.X==t.Bot.X&&f.Curr.Y==t.Bot.Y&&0!==f.WindDelta&&f.OutIdx>=0&&f.Curr.Y>f.Top.Y&&ClipperLib.ClipperBase.SlopesEqual(t,f,this.m_UseFullRange)){var d=this.AddOutPt(f,t.Bot);this.AddJoin(C,d,t.Top)}else if(null!==u&&u.Curr.X==t.Bot.X&&u.Curr.Y==t.Bot.Y&&0!==u.WindDelta&&u.OutIdx>=0&&u.Curr.Y>u.Top.Y&&ClipperLib.ClipperBase.SlopesEqual(t,u,this.m_UseFullRange)){var d=this.AddOutPt(u,t.Bot);this.AddJoin(C,d,t.Top)}}else t=this.UpdateEdgeIntoAEL(t);else null!==l?l.OutIdx>=0?(r==ClipperLib.Direction.dLeftToRight?this.IntersectEdges(t,l,t.Top,!1):this.IntersectEdges(l,t,t.Top,!1),l.OutIdx>=0&&ClipperLib.Error("ProcessHorizontal error")):(this.DeleteFromAEL(t),this.DeleteFromAEL(l)):(t.OutIdx>=0&&this.AddOutPt(t,t.Top),this.DeleteFromAEL(t))},ClipperLib.Clipper.prototype.GetNextInAEL=function(t,e){return e==ClipperLib.Direction.dLeftToRight?t.NextInAEL:t.PrevInAEL},ClipperLib.Clipper.prototype.IsMinima=function(t){return null!==t&&t.Prev.NextInLML!=t&&t.Next.NextInLML!=t},ClipperLib.Clipper.prototype.IsMaxima=function(t,e){return null!==t&&t.Top.Y==e&&null===t.NextInLML},ClipperLib.Clipper.prototype.IsIntermediate=function(t,e){return t.Top.Y==e&&null!==t.NextInLML},ClipperLib.Clipper.prototype.GetMaximaPair=function(t){var e=null;return ClipperLib.IntPoint.op_Equality(t.Next.Top,t.Top)&&null===t.Next.NextInLML?e=t.Next:ClipperLib.IntPoint.op_Equality(t.Prev.Top,t.Top)&&null===t.Prev.NextInLML&&(e=t.Prev),null===e||e.OutIdx!=-2&&(e.NextInAEL!=e.PrevInAEL||ClipperLib.ClipperBase.IsHorizontal(e))?e:null},ClipperLib.Clipper.prototype.ProcessIntersections=function(t,e){if(null==this.m_ActiveEdges)return!0;try{if(this.BuildIntersectList(t,e),0==this.m_IntersectList.length)return!0;if(1!=this.m_IntersectList.length&&!this.FixupIntersectionOrder())return!1;this.ProcessIntersectList()}catch(t){this.m_SortedEdges=null,this.m_IntersectList.length=0,ClipperLib.Error("ProcessIntersections error")}return this.m_SortedEdges=null,!0},ClipperLib.Clipper.prototype.BuildIntersectList=function(t,e){if(null!==this.m_ActiveEdges){var i=this.m_ActiveEdges;for(this.m_SortedEdges=i;null!==i;)i.PrevInSEL=i.PrevInAEL,i.NextInSEL=i.NextInAEL,i.Curr.X=ClipperLib.Clipper.TopX(i,e),i=i.NextInAEL;for(var r=!0;r&&null!==this.m_SortedEdges;){for(r=!1,i=this.m_SortedEdges;null!==i.NextInSEL;){var n=i.NextInSEL,p=new ClipperLib.IntPoint;if(i.Curr.X>n.Curr.X){!this.IntersectPoint(i,n,p)&&i.Curr.X>n.Curr.X+1&&ClipperLib.Error("Intersection error"),p.Y>t&&(p.Y=t,Math.abs(i.Dx)>Math.abs(n.Dx)?p.X=ClipperLib.Clipper.TopX(n,t):p.X=ClipperLib.Clipper.TopX(i,t));var o=new ClipperLib.IntersectNode;o.Edge1=i,o.Edge2=n,o.Pt.X=p.X,o.Pt.Y=p.Y,this.m_IntersectList.push(o),this.SwapPositionsInSEL(i,n),r=!0}else i=n}if(null===i.PrevInSEL)break;i.PrevInSEL.NextInSEL=null}this.m_SortedEdges=null}},ClipperLib.Clipper.prototype.EdgesAdjacent=function(t){return t.Edge1.NextInSEL==t.Edge2||t.Edge1.PrevInSEL==t.Edge2},ClipperLib.Clipper.IntersectNodeSort=function(t,e){return e.Pt.Y-t.Pt.Y},ClipperLib.Clipper.prototype.FixupIntersectionOrder=function(){this.m_IntersectList.sort(this.m_IntersectNodeComparer),this.CopyAELToSEL();for(var t=this.m_IntersectList.length,e=0;e<t;e++){if(!this.EdgesAdjacent(this.m_IntersectList[e])){for(var i=e+1;i<t&&!this.EdgesAdjacent(this.m_IntersectList[i]);)i++;if(i==t)return!1;var r=this.m_IntersectList[e];this.m_IntersectList[e]=this.m_IntersectList[i],this.m_IntersectList[i]=r}this.SwapPositionsInSEL(this.m_IntersectList[e].Edge1,this.m_IntersectList[e].Edge2)}return!0},ClipperLib.Clipper.prototype.ProcessIntersectList=function(){for(var t=0,e=this.m_IntersectList.length;t<e;t++){var i=this.m_IntersectList[t];this.IntersectEdges(i.Edge1,i.Edge2,i.Pt,!0),this.SwapPositionsInAEL(i.Edge1,i.Edge2)}this.m_IntersectList.length=0};var R1=function(t){return t<0?Math.ceil(t-.5):Math.round(t)},R2=function(t){return t<0?Math.ceil(t-.5):Math.floor(t+.5)},R3=function(t){return t<0?-Math.round(Math.abs(t)):Math.round(t)},R4=function(t){return t<0?(t-=.5,t<-2147483648?Math.ceil(t):0|t):(t+=.5,t>2147483647?Math.floor(t):0|t)};browser.msie?ClipperLib.Clipper.Round=R1:browser.chromium?ClipperLib.Clipper.Round=R3:browser.safari?ClipperLib.Clipper.Round=R4:ClipperLib.Clipper.Round=R2,ClipperLib.Clipper.TopX=function(t,e){return e==t.Top.Y?t.Top.X:t.Bot.X+ClipperLib.Clipper.Round(t.Dx*(e-t.Bot.Y))},ClipperLib.Clipper.prototype.IntersectPoint=function(t,e,i){i.X=0,i.Y=0;var r,n;if(ClipperLib.ClipperBase.SlopesEqual(t,e,this.m_UseFullRange)||t.Dx==e.Dx)return e.Bot.Y>t.Bot.Y?(i.X=e.Bot.X,i.Y=e.Bot.Y):(i.X=t.Bot.X,i.Y=t.Bot.Y),!1;if(0===t.Delta.X)i.X=t.Bot.X,ClipperLib.ClipperBase.IsHorizontal(e)?i.Y=e.Bot.Y:(n=e.Bot.Y-e.Bot.X/e.Dx,i.Y=ClipperLib.Clipper.Round(i.X/e.Dx+n));else if(0===e.Delta.X)i.X=e.Bot.X,ClipperLib.ClipperBase.IsHorizontal(t)?i.Y=t.Bot.Y:(r=t.Bot.Y-t.Bot.X/t.Dx,i.Y=ClipperLib.Clipper.Round(i.X/t.Dx+r));else{r=t.Bot.X-t.Bot.Y*t.Dx,n=e.Bot.X-e.Bot.Y*e.Dx;var p=(n-r)/(t.Dx-e.Dx);i.Y=ClipperLib.Clipper.Round(p),Math.abs(t.Dx)<Math.abs(e.Dx)?i.X=ClipperLib.Clipper.Round(t.Dx*p+r):i.X=ClipperLib.Clipper.Round(e.Dx*p+n)}if(i.Y<t.Top.Y||i.Y<e.Top.Y){if(t.Top.Y>e.Top.Y)return i.Y=t.Top.Y,i.X=ClipperLib.Clipper.TopX(e,t.Top.Y),i.X<t.Top.X;i.Y=e.Top.Y,Math.abs(t.Dx)<Math.abs(e.Dx)?i.X=ClipperLib.Clipper.TopX(t,i.Y):i.X=ClipperLib.Clipper.TopX(e,i.Y)}return!0},ClipperLib.Clipper.prototype.ProcessEdgesAtTopOfScanbeam=function(t){for(var e=this.m_ActiveEdges;null!==e;){var i=this.IsMaxima(e,t);if(i){var r=this.GetMaximaPair(e);i=null===r||!ClipperLib.ClipperBase.IsHorizontal(r)}if(i){var n=e.PrevInAEL;this.DoMaxima(e),e=null===n?this.m_ActiveEdges:n.NextInAEL}else{if(this.IsIntermediate(e,t)&&ClipperLib.ClipperBase.IsHorizontal(e.NextInLML)?(e=this.UpdateEdgeIntoAEL(e),e.OutIdx>=0&&this.AddOutPt(e,e.Bot),this.AddEdgeToSEL(e)):(e.Curr.X=ClipperLib.Clipper.TopX(e,t),e.Curr.Y=t),this.StrictlySimple){var n=e.PrevInAEL;if(e.OutIdx>=0&&0!==e.WindDelta&&null!==n&&n.OutIdx>=0&&n.Curr.X==e.Curr.X&&0!==n.WindDelta){var p=this.AddOutPt(n,e.Curr),o=this.AddOutPt(e,e.Curr);this.AddJoin(p,o,e.Curr)}}e=e.NextInAEL}}for(this.ProcessHorizontals(!0),e=this.m_ActiveEdges;null!==e;){if(this.IsIntermediate(e,t)){var p=null;e.OutIdx>=0&&(p=this.AddOutPt(e,e.Top)),e=this.UpdateEdgeIntoAEL(e);var n=e.PrevInAEL,l=e.NextInAEL;if(null!==n&&n.Curr.X==e.Bot.X&&n.Curr.Y==e.Bot.Y&&null!==p&&n.OutIdx>=0&&n.Curr.Y>n.Top.Y&&ClipperLib.ClipperBase.SlopesEqual(e,n,this.m_UseFullRange)&&0!==e.WindDelta&&0!==n.WindDelta){var o=this.AddOutPt(n,e.Bot);this.AddJoin(p,o,e.Top)}else if(null!==l&&l.Curr.X==e.Bot.X&&l.Curr.Y==e.Bot.Y&&null!==p&&l.OutIdx>=0&&l.Curr.Y>l.Top.Y&&ClipperLib.ClipperBase.SlopesEqual(e,l,this.m_UseFullRange)&&0!==e.WindDelta&&0!==l.WindDelta){var o=this.AddOutPt(l,e.Bot);this.AddJoin(p,o,e.Top)}}e=e.NextInAEL}},ClipperLib.Clipper.prototype.DoMaxima=function(t){var e=this.GetMaximaPair(t);if(null===e)return t.OutIdx>=0&&this.AddOutPt(t,t.Top),void this.DeleteFromAEL(t);for(var i=t.NextInAEL,r=!0;null!==i&&i!=e;)this.IntersectEdges(t,i,t.Top,!0),this.SwapPositionsInAEL(t,i),i=t.NextInAEL;t.OutIdx==-1&&e.OutIdx==-1?(this.DeleteFromAEL(t),this.DeleteFromAEL(e)):t.OutIdx>=0&&e.OutIdx>=0?this.IntersectEdges(t,e,t.Top,!1):r&&0===t.WindDelta?(t.OutIdx>=0&&(this.AddOutPt(t,t.Top),t.OutIdx=-1),this.DeleteFromAEL(t),e.OutIdx>=0&&(this.AddOutPt(e,t.Top),e.OutIdx=-1),this.DeleteFromAEL(e)):ClipperLib.Error("DoMaxima error")},ClipperLib.Clipper.ReversePaths=function(t){for(var e=0,i=t.length;e<i;e++)t[e].reverse()},ClipperLib.Clipper.Orientation=function(t){return ClipperLib.Clipper.Area(t)>=0},ClipperLib.Clipper.prototype.PointCount=function(t){if(null===t)return 0;var e=0,i=t;do e++,i=i.Next;while(i!=t);return e},ClipperLib.Clipper.prototype.BuildResult=function(t){ClipperLib.Clear(t);for(var e=0,i=this.m_PolyOuts.length;e<i;e++){var r=this.m_PolyOuts[e];if(null!==r.Pts){var n=r.Pts.Prev,p=this.PointCount(n);if(!(p<2)){for(var o=new Array(p),l=0;l<p;l++)o[l]=n.Pt,n=n.Prev;t.push(o)}}}},ClipperLib.Clipper.prototype.BuildResult2=function(t){t.Clear();for(var e=0,i=this.m_PolyOuts.length;e<i;e++){var r=this.m_PolyOuts[e],n=this.PointCount(r.Pts);if(!(r.IsOpen&&n<2||!r.IsOpen&&n<3)){this.FixHoleLinkage(r);var p=new ClipperLib.PolyNode;t.m_AllPolys.push(p),r.PolyNode=p,p.m_polygon.length=n;for(var o=r.Pts.Prev,l=0;l<n;l++)p.m_polygon[l]=o.Pt,o=o.Prev}}for(var e=0,i=this.m_PolyOuts.length;e<i;e++){var r=this.m_PolyOuts[e];null!==r.PolyNode&&(r.IsOpen?(r.PolyNode.IsOpen=!0,t.AddChild(r.PolyNode)):null!==r.FirstLeft&&null!=r.FirstLeft.PolyNode?r.FirstLeft.PolyNode.AddChild(r.PolyNode):t.AddChild(r.PolyNode))}},ClipperLib.Clipper.prototype.FixupOutPolygon=function(t){var e=null;t.BottomPt=null;for(var i=t.Pts;;){if(i.Prev==i||i.Prev==i.Next)return this.DisposeOutPts(i),void(t.Pts=null);if(ClipperLib.IntPoint.op_Equality(i.Pt,i.Next.Pt)||ClipperLib.IntPoint.op_Equality(i.Pt,i.Prev.Pt)||ClipperLib.ClipperBase.SlopesEqual(i.Prev.Pt,i.Pt,i.Next.Pt,this.m_UseFullRange)&&(!this.PreserveCollinear||!this.Pt2IsBetweenPt1AndPt3(i.Prev.Pt,i.Pt,i.Next.Pt))){e=null;var r=i;i.Prev.Next=i.Next,i.Next.Prev=i.Prev,i=i.Prev,r=null}else{if(i==e)break;null===e&&(e=i),i=i.Next}}t.Pts=i},ClipperLib.Clipper.prototype.DupOutPt=function(t,e){var i=new ClipperLib.OutPt;return i.Pt.X=t.Pt.X,i.Pt.Y=t.Pt.Y,i.Idx=t.Idx,e?(i.Next=t.Next,i.Prev=t,t.Next.Prev=i,t.Next=i):(i.Prev=t.Prev,i.Next=t,t.Prev.Next=i,t.Prev=i),i},ClipperLib.Clipper.prototype.GetOverlap=function(t,e,i,r,n){return t<e?i<r?(n.Left=Math.max(t,i),n.Right=Math.min(e,r)):(n.Left=Math.max(t,r),n.Right=Math.min(e,i)):i<r?(n.Left=Math.max(e,i),n.Right=Math.min(t,r)):(n.Left=Math.max(e,r),n.Right=Math.min(t,i)),n.Left<n.Right},ClipperLib.Clipper.prototype.JoinHorz=function(t,e,i,r,n,p){var o=t.Pt.X>e.Pt.X?ClipperLib.Direction.dRightToLeft:ClipperLib.Direction.dLeftToRight,l=i.Pt.X>r.Pt.X?ClipperLib.Direction.dRightToLeft:ClipperLib.Direction.dLeftToRight;if(o==l)return!1;if(o==ClipperLib.Direction.dLeftToRight){for(;t.Next.Pt.X<=n.X&&t.Next.Pt.X>=t.Pt.X&&t.Next.Pt.Y==n.Y;)t=t.Next;p&&t.Pt.X!=n.X&&(t=t.Next),e=this.DupOutPt(t,!p),ClipperLib.IntPoint.op_Inequality(e.Pt,n)&&(t=e,t.Pt.X=n.X,t.Pt.Y=n.Y,e=this.DupOutPt(t,!p))}else{for(;t.Next.Pt.X>=n.X&&t.Next.Pt.X<=t.Pt.X&&t.Next.Pt.Y==n.Y;)t=t.Next;p||t.Pt.X==n.X||(t=t.Next),e=this.DupOutPt(t,p),ClipperLib.IntPoint.op_Inequality(e.Pt,n)&&(t=e,t.Pt.X=n.X,t.Pt.Y=n.Y,e=this.DupOutPt(t,p))}if(l==ClipperLib.Direction.dLeftToRight){for(;i.Next.Pt.X<=n.X&&i.Next.Pt.X>=i.Pt.X&&i.Next.Pt.Y==n.Y;)i=i.Next;p&&i.Pt.X!=n.X&&(i=i.Next),r=this.DupOutPt(i,!p),ClipperLib.IntPoint.op_Inequality(r.Pt,n)&&(i=r,i.Pt.X=n.X,i.Pt.Y=n.Y,r=this.DupOutPt(i,!p))}else{for(;i.Next.Pt.X>=n.X&&i.Next.Pt.X<=i.Pt.X&&i.Next.Pt.Y==n.Y;)i=i.Next;p||i.Pt.X==n.X||(i=i.Next),r=this.DupOutPt(i,p),ClipperLib.IntPoint.op_Inequality(r.Pt,n)&&(i=r,i.Pt.X=n.X,i.Pt.Y=n.Y,r=this.DupOutPt(i,p))}return o==ClipperLib.Direction.dLeftToRight==p?(t.Prev=i,i.Next=t,e.Next=r,r.Prev=e):(t.Next=i,i.Prev=t,e.Prev=r,r.Next=e),!0},ClipperLib.Clipper.prototype.JoinPoints=function(t,e,i){var r=t.OutPt1,n=new ClipperLib.OutPt,p=t.OutPt2,o=new ClipperLib.OutPt,l=t.OutPt1.Pt.Y==t.OffPt.Y;if(l&&ClipperLib.IntPoint.op_Equality(t.OffPt,t.OutPt1.Pt)&&ClipperLib.IntPoint.op_Equality(t.OffPt,t.OutPt2.Pt)){for(n=t.OutPt1.Next;n!=r&&ClipperLib.IntPoint.op_Equality(n.Pt,t.OffPt);)n=n.Next;var s=n.Pt.Y>t.OffPt.Y;for(o=t.OutPt2.Next;o!=p&&ClipperLib.IntPoint.op_Equality(o.Pt,t.OffPt);)o=o.Next;var h=o.Pt.Y>t.OffPt.Y;return s!=h&&(s?(n=this.DupOutPt(r,!1),o=this.DupOutPt(p,!0),r.Prev=p,p.Next=r,n.Next=o,o.Prev=n,t.OutPt1=r,t.OutPt2=n,!0):(n=this.DupOutPt(r,!0),o=this.DupOutPt(p,!1),r.Next=p,p.Prev=r,n.Prev=o,o.Next=n,t.OutPt1=r,t.OutPt2=n,!0))}if(l){for(n=r;r.Prev.Pt.Y==r.Pt.Y&&r.Prev!=n&&r.Prev!=p;)r=r.Prev;for(;n.Next.Pt.Y==n.Pt.Y&&n.Next!=r&&n.Next!=p;)n=n.Next;if(n.Next==r||n.Next==p)return!1;for(o=p;p.Prev.Pt.Y==p.Pt.Y&&p.Prev!=o&&p.Prev!=n;)p=p.Prev;for(;o.Next.Pt.Y==o.Pt.Y&&o.Next!=p&&o.Next!=r;)o=o.Next;if(o.Next==p||o.Next==r)return!1;var u={Left:null,Right:null};if(!this.GetOverlap(r.Pt.X,n.Pt.X,p.Pt.X,o.Pt.X,u))return!1;var a,C=u.Left,f=u.Right,d=new ClipperLib.IntPoint;return r.Pt.X>=C&&r.Pt.X<=f?(d.X=r.Pt.X,d.Y=r.Pt.Y,a=r.Pt.X>n.Pt.X):p.Pt.X>=C&&p.Pt.X<=f?(d.X=p.Pt.X,d.Y=p.Pt.Y,a=p.Pt.X>o.Pt.X):n.Pt.X>=C&&n.Pt.X<=f?(d.X=n.Pt.X,d.Y=n.Pt.Y,a=n.Pt.X>r.Pt.X):(d.X=o.Pt.X,d.Y=o.Pt.Y,a=o.Pt.X>p.Pt.X),t.OutPt1=r,t.OutPt2=p,this.JoinHorz(r,n,p,o,d,a)}for(n=r.Next;ClipperLib.IntPoint.op_Equality(n.Pt,r.Pt)&&n!=r;)n=n.Next;var L=n.Pt.Y>r.Pt.Y||!ClipperLib.ClipperBase.SlopesEqual(r.Pt,n.Pt,t.OffPt,this.m_UseFullRange);if(L){for(n=r.Prev;ClipperLib.IntPoint.op_Equality(n.Pt,r.Pt)&&n!=r;)n=n.Prev;if(n.Pt.Y>r.Pt.Y||!ClipperLib.ClipperBase.SlopesEqual(r.Pt,n.Pt,t.OffPt,this.m_UseFullRange))return!1}for(o=p.Next;ClipperLib.IntPoint.op_Equality(o.Pt,p.Pt)&&o!=p;)o=o.Next;var P=o.Pt.Y>p.Pt.Y||!ClipperLib.ClipperBase.SlopesEqual(p.Pt,o.Pt,t.OffPt,this.m_UseFullRange);if(P){for(o=p.Prev;ClipperLib.IntPoint.op_Equality(o.Pt,p.Pt)&&o!=p;)o=o.Prev;if(o.Pt.Y>p.Pt.Y||!ClipperLib.ClipperBase.SlopesEqual(p.Pt,o.Pt,t.OffPt,this.m_UseFullRange))return!1}return n!=r&&o!=p&&n!=o&&(e!=i||L!=P)&&(L?(n=this.DupOutPt(r,!1),o=this.DupOutPt(p,!0),r.Prev=p,p.Next=r,n.Next=o,o.Prev=n,t.OutPt1=r,t.OutPt2=n,!0):(n=this.DupOutPt(r,!0),o=this.DupOutPt(p,!1),r.Next=p,p.Prev=r,n.Prev=o,o.Next=n,t.OutPt1=r,t.OutPt2=n,!0))},ClipperLib.Clipper.GetBounds=function(t){for(var e=0,i=t.length;e<i&&0==t[e].length;)e++;if(e==i)return new ClipperLib.IntRect(0,0,0,0);var r=new ClipperLib.IntRect;for(r.left=t[e][0].X,r.right=r.left,r.top=t[e][0].Y,r.bottom=r.top;e<i;e++)for(var n=0,p=t[e].length;n<p;n++)t[e][n].X<r.left?r.left=t[e][n].X:t[e][n].X>r.right&&(r.right=t[e][n].X),t[e][n].Y<r.top?r.top=t[e][n].Y:t[e][n].Y>r.bottom&&(r.bottom=t[e][n].Y);return r},ClipperLib.Clipper.prototype.GetBounds2=function(t){var e=t,i=new ClipperLib.IntRect;for(i.left=t.Pt.X,i.right=t.Pt.X,i.top=t.Pt.Y,i.bottom=t.Pt.Y,t=t.Next;t!=e;)t.Pt.X<i.left&&(i.left=t.Pt.X),t.Pt.X>i.right&&(i.right=t.Pt.X),t.Pt.Y<i.top&&(i.top=t.Pt.Y),t.Pt.Y>i.bottom&&(i.bottom=t.Pt.Y),t=t.Next;return i},ClipperLib.Clipper.PointInPolygon=function(t,e){var i=0,r=e.length;if(r<3)return 0;for(var n=e[0],p=1;p<=r;++p){var o=p==r?e[0]:e[p];if(o.Y==t.Y&&(o.X==t.X||n.Y==t.Y&&o.X>t.X==n.X<t.X))return-1;if(n.Y<t.Y!=o.Y<t.Y)if(n.X>=t.X)if(o.X>t.X)i=1-i;else{var l=(n.X-t.X)*(o.Y-t.Y)-(o.X-t.X)*(n.Y-t.Y);if(0==l)return-1;l>0==o.Y>n.Y&&(i=1-i)}else if(o.X>t.X){var l=(n.X-t.X)*(o.Y-t.Y)-(o.X-t.X)*(n.Y-t.Y);if(0==l)return-1;l>0==o.Y>n.Y&&(i=1-i)}n=o}return i},ClipperLib.Clipper.prototype.PointInPolygon=function(t,e){for(var i=0,r=e;;){var n=e.Pt.X,p=e.Pt.Y,o=e.Next.Pt.X,l=e.Next.Pt.Y;if(l==t.Y&&(o==t.X||p==t.Y&&o>t.X==n<t.X))return-1;if(p<t.Y!=l<t.Y)if(n>=t.X)if(o>t.X)i=1-i;else{var s=(n-t.X)*(l-t.Y)-(o-t.X)*(p-t.Y);if(0==s)return-1;s>0==l>p&&(i=1-i)}else if(o>t.X){var s=(n-t.X)*(l-t.Y)-(o-t.X)*(p-t.Y);if(0==s)return-1;s>0==l>p&&(i=1-i)}if(e=e.Next,r==e)break}return i},ClipperLib.Clipper.prototype.Poly2ContainsPoly1=function(t,e){var i=t;do{var r=this.PointInPolygon(i.Pt,e);if(r>=0)return 0!=r;i=i.Next}while(i!=t);return!0},ClipperLib.Clipper.prototype.FixupFirstLefts1=function(t,e){for(var i=0,r=this.m_PolyOuts.length;i<r;i++){var n=this.m_PolyOuts[i];null!==n.Pts&&n.FirstLeft==t&&this.Poly2ContainsPoly1(n.Pts,e.Pts)&&(n.FirstLeft=e)}},ClipperLib.Clipper.prototype.FixupFirstLefts2=function(t,e){for(var i=0,r=this.m_PolyOuts,n=r.length,p=r[i];i<n;i++,p=r[i])p.FirstLeft==t&&(p.FirstLeft=e)},ClipperLib.Clipper.ParseFirstLeft=function(t){for(;null!=t&&null==t.Pts;)t=t.FirstLeft;return t},ClipperLib.Clipper.prototype.JoinCommonEdges=function(){for(var t=0,e=this.m_Joins.length;t<e;t++){var i=this.m_Joins[t],r=this.GetOutRec(i.OutPt1.Idx),n=this.GetOutRec(i.OutPt2.Idx);if(null!=r.Pts&&null!=n.Pts){var p;if(p=r==n?r:this.Param1RightOfParam2(r,n)?n:this.Param1RightOfParam2(n,r)?r:this.GetLowermostRec(r,n),this.JoinPoints(i,r,n))if(r==n){if(r.Pts=i.OutPt1,r.BottomPt=null,n=this.CreateOutRec(),n.Pts=i.OutPt2,this.UpdateOutPtIdxs(n),this.m_UsingPolyTree)for(var o=0,l=this.m_PolyOuts.length;o<l-1;o++){var s=this.m_PolyOuts[o];null!=s.Pts&&ClipperLib.Clipper.ParseFirstLeft(s.FirstLeft)==r&&s.IsHole!=r.IsHole&&this.Poly2ContainsPoly1(s.Pts,i.OutPt2)&&(s.FirstLeft=n)}this.Poly2ContainsPoly1(n.Pts,r.Pts)?(n.IsHole=!r.IsHole,n.FirstLeft=r,this.m_UsingPolyTree&&this.FixupFirstLefts2(n,r),(n.IsHole^this.ReverseSolution)==this.Area(n)>0&&this.ReversePolyPtLinks(n.Pts)):this.Poly2ContainsPoly1(r.Pts,n.Pts)?(n.IsHole=r.IsHole,r.IsHole=!n.IsHole,n.FirstLeft=r.FirstLeft,r.FirstLeft=n,this.m_UsingPolyTree&&this.FixupFirstLefts2(r,n),(r.IsHole^this.ReverseSolution)==this.Area(r)>0&&this.ReversePolyPtLinks(r.Pts)):(n.IsHole=r.IsHole,n.FirstLeft=r.FirstLeft,this.m_UsingPolyTree&&this.FixupFirstLefts1(r,n))}else n.Pts=null,n.BottomPt=null,n.Idx=r.Idx,r.IsHole=p.IsHole,p==n&&(r.FirstLeft=n.FirstLeft),n.FirstLeft=r,this.m_UsingPolyTree&&this.FixupFirstLefts2(n,r)}}},ClipperLib.Clipper.prototype.UpdateOutPtIdxs=function(t){var e=t.Pts;do e.Idx=t.Idx,e=e.Prev;while(e!=t.Pts)},ClipperLib.Clipper.prototype.DoSimplePolygons=function(){for(var t=0;t<this.m_PolyOuts.length;){var e=this.m_PolyOuts[t++],i=e.Pts;if(null!==i)do{for(var r=i.Next;r!=e.Pts;){if(ClipperLib.IntPoint.op_Equality(i.Pt,r.Pt)&&r.Next!=i&&r.Prev!=i){var n=i.Prev,p=r.Prev;i.Prev=p,p.Next=i,r.Prev=n,n.Next=r,e.Pts=i;var o=this.CreateOutRec();o.Pts=r,this.UpdateOutPtIdxs(o),this.Poly2ContainsPoly1(o.Pts,e.Pts)?(o.IsHole=!e.IsHole,o.FirstLeft=e):this.Poly2ContainsPoly1(e.Pts,o.Pts)?(o.IsHole=e.IsHole,e.IsHole=!o.IsHole,o.FirstLeft=e.FirstLeft,e.FirstLeft=o):(o.IsHole=e.IsHole,o.FirstLeft=e.FirstLeft),r=i}r=r.Next}i=i.Next}while(i!=e.Pts)}},ClipperLib.Clipper.Area=function(t){var e=t.length;if(e<3)return 0;for(var i=0,r=0,n=e-1;r<e;++r)i+=(t[n].X+t[r].X)*(t[n].Y-t[r].Y),n=r;return.5*-i},ClipperLib.Clipper.prototype.Area=function(t){var e=t.Pts;if(null==e)return 0;var i=0;do i+=(e.Prev.Pt.X+e.Pt.X)*(e.Prev.Pt.Y-e.Pt.Y),e=e.Next;while(e!=t.Pts);return.5*i},use_deprecated&&(ClipperLib.Clipper.OffsetPaths=function(t,e,i,r,n){var p=new ClipperLib.Paths,o=new ClipperLib.ClipperOffset(n,n);return o.AddPaths(t,i,r),o.Execute(p,e),p}),ClipperLib.Clipper.SimplifyPolygon=function(t,e){var i=new Array,r=new ClipperLib.Clipper(0);return r.StrictlySimple=!0,r.AddPath(t,ClipperLib.PolyType.ptSubject,!0),r.Execute(ClipperLib.ClipType.ctUnion,i,e,e),i},ClipperLib.Clipper.SimplifyPolygons=function(t,e){"undefined"==typeof e&&(e=ClipperLib.PolyFillType.pftEvenOdd);var i=new Array,r=new ClipperLib.Clipper(0);return r.StrictlySimple=!0,r.AddPaths(t,ClipperLib.PolyType.ptSubject,!0),r.Execute(ClipperLib.ClipType.ctUnion,i,e,e),i},ClipperLib.Clipper.DistanceSqrd=function(t,e){var i=t.X-e.X,r=t.Y-e.Y;return i*i+r*r},ClipperLib.Clipper.DistanceFromLineSqrd=function(t,e,i){var r=e.Y-i.Y,n=i.X-e.X,p=r*e.X+n*e.Y;return p=r*t.X+n*t.Y-p,p*p/(r*r+n*n)},ClipperLib.Clipper.SlopesNearCollinear=function(t,e,i,r){return ClipperLib.Clipper.DistanceFromLineSqrd(e,t,i)<r},ClipperLib.Clipper.PointsAreClose=function(t,e,i){var r=t.X-e.X,n=t.Y-e.Y;return r*r+n*n<=i},ClipperLib.Clipper.ExcludeOp=function(t){var e=t.Prev;return e.Next=t.Next,t.Next.Prev=e,e.Idx=0,e},ClipperLib.Clipper.CleanPolygon=function(t,e){"undefined"==typeof e&&(e=1.415);var i=t.length;if(0==i)return new Array;for(var r=new Array(i),n=0;n<i;++n)r[n]=new ClipperLib.OutPt;for(var n=0;n<i;++n)r[n].Pt=t[n],r[n].Next=r[(n+1)%i],r[n].Next.Prev=r[n],r[n].Idx=0;for(var p=e*e,o=r[0];0==o.Idx&&o.Next!=o.Prev;)ClipperLib.Clipper.PointsAreClose(o.Pt,o.Prev.Pt,p)?(o=ClipperLib.Clipper.ExcludeOp(o),i--):ClipperLib.Clipper.PointsAreClose(o.Prev.Pt,o.Next.Pt,p)?(ClipperLib.Clipper.ExcludeOp(o.Next),o=ClipperLib.Clipper.ExcludeOp(o),i-=2):ClipperLib.Clipper.SlopesNearCollinear(o.Prev.Pt,o.Pt,o.Next.Pt,p)?(o=ClipperLib.Clipper.ExcludeOp(o),i--):(o.Idx=1,o=o.Next);i<3&&(i=0);for(var l=new Array(i),n=0;n<i;++n)l[n]=new ClipperLib.IntPoint(o.Pt),o=o.Next;return r=null,l},ClipperLib.Clipper.CleanPolygons=function(t,e){for(var i=new Array(t.length),r=0,n=t.length;r<n;r++)i[r]=ClipperLib.Clipper.CleanPolygon(t[r],e);return i},ClipperLib.Clipper.Minkowski=function(t,e,i,r){var n=r?1:0,p=t.length,o=e.length,l=new Array;if(i)for(var s=0;s<o;s++){for(var h=new Array(p),u=0,a=t.length,C=t[u];u<a;u++,C=t[u])h[u]=new ClipperLib.IntPoint(e[s].X+C.X,e[s].Y+C.Y);l.push(h)}else for(var s=0;s<o;s++){for(var h=new Array(p),u=0,a=t.length,C=t[u];u<a;u++,C=t[u])h[u]=new ClipperLib.IntPoint(e[s].X-C.X,e[s].Y-C.Y);l.push(h)}for(var f=new Array,s=0;s<o-1+n;s++)for(var u=0;u<p;u++){var d=new Array;d.push(l[s%o][u%p]),d.push(l[(s+1)%o][u%p]),d.push(l[(s+1)%o][(u+1)%p]),d.push(l[s%o][(u+1)%p]),ClipperLib.Clipper.Orientation(d)||d.reverse(),f.push(d)}var L=new ClipperLib.Clipper(0);return L.AddPaths(f,ClipperLib.PolyType.ptSubject,!0),L.Execute(ClipperLib.ClipType.ctUnion,l,ClipperLib.PolyFillType.pftNonZero,ClipperLib.PolyFillType.pftNonZero),l},ClipperLib.Clipper.MinkowskiSum=function(){var t=arguments,e=t.length;if(3==e){var i=t[0],r=t[1],n=t[2];return ClipperLib.Clipper.Minkowski(i,r,!0,n)}if(4==e){for(var p,i=t[0],o=t[1],l=t[2],n=t[3],s=new ClipperLib.Clipper,h=0,u=o.length;h<u;++h){var p=ClipperLib.Clipper.Minkowski(i,o[h],!0,n);s.AddPaths(p,ClipperLib.PolyType.ptSubject,!0)}n&&s.AddPaths(o,ClipperLib.PolyType.ptClip,!0);var a=new ClipperLib.Paths;return s.Execute(ClipperLib.ClipType.ctUnion,a,l,l),a}},ClipperLib.Clipper.MinkowskiDiff=function(t,e,i){return ClipperLib.Clipper.Minkowski(t,e,!1,i)},ClipperLib.Clipper.PolyTreeToPaths=function(t){var e=new Array;return ClipperLib.Clipper.AddPolyNodeToPaths(t,ClipperLib.Clipper.NodeType.ntAny,e),e},ClipperLib.Clipper.AddPolyNodeToPaths=function(t,e,i){var r=!0;switch(e){case ClipperLib.Clipper.NodeType.ntOpen:return;case ClipperLib.Clipper.NodeType.ntClosed:r=!t.IsOpen}t.m_polygon.length>0&&r&&i.push(t.m_polygon);for(var n=0,p=t.Childs(),o=p.length,l=p[n];n<o;n++,l=p[n])ClipperLib.Clipper.AddPolyNodeToPaths(l,e,i)},ClipperLib.Clipper.OpenPathsFromPolyTree=function(t){for(var e=new ClipperLib.Paths,i=0,r=t.ChildCount();i<r;i++)t.Childs()[i].IsOpen&&e.push(t.Childs()[i].m_polygon);return e},ClipperLib.Clipper.ClosedPathsFromPolyTree=function(t){var e=new ClipperLib.Paths;return ClipperLib.Clipper.AddPolyNodeToPaths(t,ClipperLib.Clipper.NodeType.ntClosed,e),e},Inherit(ClipperLib.Clipper,ClipperLib.ClipperBase),ClipperLib.Clipper.NodeType={ntAny:0,ntOpen:1,ntClosed:2},ClipperLib.ClipperOffset=function(t,e){"undefined"==typeof t&&(t=2),"undefined"==typeof e&&(e=ClipperLib.ClipperOffset.def_arc_tolerance),this.m_destPolys=new ClipperLib.Paths,this.m_srcPoly=new ClipperLib.Path,this.m_destPoly=new ClipperLib.Path,this.m_normals=new Array,this.m_delta=0,this.m_sinA=0,this.m_sin=0,this.m_cos=0,this.m_miterLim=0,this.m_StepsPerRad=0,this.m_lowest=new ClipperLib.IntPoint,this.m_polyNodes=new ClipperLib.PolyNode,this.MiterLimit=t,this.ArcTolerance=e,this.m_lowest.X=-1},ClipperLib.ClipperOffset.two_pi=6.28318530717959,ClipperLib.ClipperOffset.def_arc_tolerance=.25,ClipperLib.ClipperOffset.prototype.Clear=function(){ClipperLib.Clear(this.m_polyNodes.Childs()),this.m_lowest.X=-1},ClipperLib.ClipperOffset.Round=ClipperLib.Clipper.Round,ClipperLib.ClipperOffset.prototype.AddPath=function(t,e,i){var r=t.length-1;if(!(r<0)){var n=new ClipperLib.PolyNode;if(n.m_jointype=e,n.m_endtype=i,i==ClipperLib.EndType.etClosedLine||i==ClipperLib.EndType.etClosedPolygon)for(;r>0&&ClipperLib.IntPoint.op_Equality(t[0],t[r]);)r--;n.m_polygon.push(t[0]);for(var p=0,o=0,l=1;l<=r;l++)ClipperLib.IntPoint.op_Inequality(n.m_polygon[p],t[l])&&(p++,n.m_polygon.push(t[l]),(t[l].Y>n.m_polygon[o].Y||t[l].Y==n.m_polygon[o].Y&&t[l].X<n.m_polygon[o].X)&&(o=p));if(!(i==ClipperLib.EndType.etClosedPolygon&&p<2||i!=ClipperLib.EndType.etClosedPolygon&&p<0)&&(this.m_polyNodes.AddChild(n),i==ClipperLib.EndType.etClosedPolygon))if(this.m_lowest.X<0)this.m_lowest=new ClipperLib.IntPoint(0,o);else{var s=this.m_polyNodes.Childs()[this.m_lowest.X].m_polygon[this.m_lowest.Y];(n.m_polygon[o].Y>s.Y||n.m_polygon[o].Y==s.Y&&n.m_polygon[o].X<s.X)&&(this.m_lowest=new ClipperLib.IntPoint(this.m_polyNodes.ChildCount()-1,o))}}},ClipperLib.ClipperOffset.prototype.AddPaths=function(t,e,i){for(var r=0,n=t.length;r<n;r++)this.AddPath(t[r],e,i)},ClipperLib.ClipperOffset.prototype.FixOrientations=function(){if(this.m_lowest.X>=0&&!ClipperLib.Clipper.Orientation(this.m_polyNodes.Childs()[this.m_lowest.X].m_polygon))for(var t=0;t<this.m_polyNodes.ChildCount();t++){var e=this.m_polyNodes.Childs()[t];(e.m_endtype==ClipperLib.EndType.etClosedPolygon||e.m_endtype==ClipperLib.EndType.etClosedLine&&ClipperLib.Clipper.Orientation(e.m_polygon))&&e.m_polygon.reverse()}else for(var t=0;t<this.m_polyNodes.ChildCount();t++){var e=this.m_polyNodes.Childs()[t];e.m_endtype!=ClipperLib.EndType.etClosedLine||ClipperLib.Clipper.Orientation(e.m_polygon)||e.m_polygon.reverse()}},ClipperLib.ClipperOffset.GetUnitNormal=function(t,e){var i=e.X-t.X,r=e.Y-t.Y;if(0==i&&0==r)return new ClipperLib.DoublePoint(0,0);var n=1/Math.sqrt(i*i+r*r);return i*=n,r*=n,new ClipperLib.DoublePoint(r,-i)},ClipperLib.ClipperOffset.prototype.DoOffset=function(t){if(this.m_destPolys=new Array,this.m_delta=t,ClipperLib.ClipperBase.near_zero(t))for(var e=0;e<this.m_polyNodes.ChildCount();e++){var i=this.m_polyNodes.Childs()[e];i.m_endtype==ClipperLib.EndType.etClosedPolygon&&this.m_destPolys.push(i.m_polygon)}else{this.MiterLimit>2?this.m_miterLim=2/(this.MiterLimit*this.MiterLimit):this.m_miterLim=.5;var r;r=this.ArcTolerance<=0?ClipperLib.ClipperOffset.def_arc_tolerance:this.ArcTolerance>Math.abs(t)*ClipperLib.ClipperOffset.def_arc_tolerance?Math.abs(t)*ClipperLib.ClipperOffset.def_arc_tolerance:this.ArcTolerance;var n=3.14159265358979/Math.acos(1-r/Math.abs(t));this.m_sin=Math.sin(ClipperLib.ClipperOffset.two_pi/n),this.m_cos=Math.cos(ClipperLib.ClipperOffset.two_pi/n),this.m_StepsPerRad=n/ClipperLib.ClipperOffset.two_pi,t<0&&(this.m_sin=-this.m_sin);for(var e=0;e<this.m_polyNodes.ChildCount();e++){var i=this.m_polyNodes.Childs()[e];this.m_srcPoly=i.m_polygon;var p=this.m_srcPoly.length;if(!(0==p||t<=0&&(p<3||i.m_endtype!=ClipperLib.EndType.etClosedPolygon)))if(this.m_destPoly=new Array,1!=p){this.m_normals.length=0;for(var o=0;o<p-1;o++)this.m_normals.push(ClipperLib.ClipperOffset.GetUnitNormal(this.m_srcPoly[o],this.m_srcPoly[o+1]));if(i.m_endtype==ClipperLib.EndType.etClosedLine||i.m_endtype==ClipperLib.EndType.etClosedPolygon?this.m_normals.push(ClipperLib.ClipperOffset.GetUnitNormal(this.m_srcPoly[p-1],this.m_srcPoly[0])):this.m_normals.push(new ClipperLib.DoublePoint(this.m_normals[p-2])),i.m_endtype==ClipperLib.EndType.etClosedPolygon){for(var l=p-1,o=0;o<p;o++)l=this.OffsetPoint(o,l,i.m_jointype);this.m_destPolys.push(this.m_destPoly)}else if(i.m_endtype==ClipperLib.EndType.etClosedLine){for(var l=p-1,o=0;o<p;o++)l=this.OffsetPoint(o,l,i.m_jointype);this.m_destPolys.push(this.m_destPoly),this.m_destPoly=new Array;for(var s=this.m_normals[p-1],o=p-1;o>0;o--)this.m_normals[o]=new ClipperLib.DoublePoint(-this.m_normals[o-1].X,-this.m_normals[o-1].Y);this.m_normals[0]=new ClipperLib.DoublePoint(-s.X,-s.Y),l=0;for(var o=p-1;o>=0;o--)l=this.OffsetPoint(o,l,i.m_jointype);this.m_destPolys.push(this.m_destPoly)}else{for(var l=0,o=1;o<p-1;++o)l=this.OffsetPoint(o,l,i.m_jointype);var h;if(i.m_endtype==ClipperLib.EndType.etOpenButt){var o=p-1;h=new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[o].X+this.m_normals[o].X*t),ClipperLib.ClipperOffset.Round(this.m_srcPoly[o].Y+this.m_normals[o].Y*t)),this.m_destPoly.push(h),h=new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[o].X-this.m_normals[o].X*t),ClipperLib.ClipperOffset.Round(this.m_srcPoly[o].Y-this.m_normals[o].Y*t)),this.m_destPoly.push(h)}else{var o=p-1;l=p-2,this.m_sinA=0,this.m_normals[o]=new ClipperLib.DoublePoint(-this.m_normals[o].X,-this.m_normals[o].Y),i.m_endtype==ClipperLib.EndType.etOpenSquare?this.DoSquare(o,l):this.DoRound(o,l)}for(var o=p-1;o>0;o--)this.m_normals[o]=new ClipperLib.DoublePoint(-this.m_normals[o-1].X,-this.m_normals[o-1].Y);this.m_normals[0]=new ClipperLib.DoublePoint(-this.m_normals[1].X,-this.m_normals[1].Y),l=p-1;for(var o=l-1;o>0;--o)l=this.OffsetPoint(o,l,i.m_jointype);i.m_endtype==ClipperLib.EndType.etOpenButt?(h=new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X-this.m_normals[0].X*t),ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y-this.m_normals[0].Y*t)),this.m_destPoly.push(h),h=new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X+this.m_normals[0].X*t),ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y+this.m_normals[0].Y*t)),this.m_destPoly.push(h)):(l=1,
-this.m_sinA=0,i.m_endtype==ClipperLib.EndType.etOpenSquare?this.DoSquare(0,1):this.DoRound(0,1)),this.m_destPolys.push(this.m_destPoly)}}else{if(i.m_jointype==ClipperLib.JoinType.jtRound)for(var u=1,a=0,o=1;o<=n;o++){this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X+u*t),ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y+a*t)));var C=u;u=u*this.m_cos-this.m_sin*a,a=C*this.m_sin+a*this.m_cos}else for(var u=-1,a=-1,o=0;o<4;++o)this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].X+u*t),ClipperLib.ClipperOffset.Round(this.m_srcPoly[0].Y+a*t))),u<0?u=1:a<0?a=1:u=-1;this.m_destPolys.push(this.m_destPoly)}}}},ClipperLib.ClipperOffset.prototype.Execute=function(){var t=arguments,e=t[0]instanceof ClipperLib.PolyTree;if(e){var i=t[0],r=t[1];i.Clear(),this.FixOrientations(),this.DoOffset(r);var n=new ClipperLib.Clipper(0);if(n.AddPaths(this.m_destPolys,ClipperLib.PolyType.ptSubject,!0),r>0)n.Execute(ClipperLib.ClipType.ctUnion,i,ClipperLib.PolyFillType.pftPositive,ClipperLib.PolyFillType.pftPositive);else{var p=ClipperLib.Clipper.GetBounds(this.m_destPolys),o=new ClipperLib.Path;if(o.push(new ClipperLib.IntPoint(p.left-10,p.bottom+10)),o.push(new ClipperLib.IntPoint(p.right+10,p.bottom+10)),o.push(new ClipperLib.IntPoint(p.right+10,p.top-10)),o.push(new ClipperLib.IntPoint(p.left-10,p.top-10)),n.AddPath(o,ClipperLib.PolyType.ptSubject,!0),n.ReverseSolution=!0,n.Execute(ClipperLib.ClipType.ctUnion,i,ClipperLib.PolyFillType.pftNegative,ClipperLib.PolyFillType.pftNegative),1==i.ChildCount()&&i.Childs()[0].ChildCount()>0){var l=i.Childs()[0];i.Childs()[0]=l.Childs()[0];for(var s=1;s<l.ChildCount();s++)i.AddChild(l.Childs()[s])}else i.Clear()}}else{var i=t[0],r=t[1];ClipperLib.Clear(i),this.FixOrientations(),this.DoOffset(r);var n=new ClipperLib.Clipper(0);if(n.AddPaths(this.m_destPolys,ClipperLib.PolyType.ptSubject,!0),r>0)n.Execute(ClipperLib.ClipType.ctUnion,i,ClipperLib.PolyFillType.pftPositive,ClipperLib.PolyFillType.pftPositive);else{var p=ClipperLib.Clipper.GetBounds(this.m_destPolys),o=new ClipperLib.Path;o.push(new ClipperLib.IntPoint(p.left-10,p.bottom+10)),o.push(new ClipperLib.IntPoint(p.right+10,p.bottom+10)),o.push(new ClipperLib.IntPoint(p.right+10,p.top-10)),o.push(new ClipperLib.IntPoint(p.left-10,p.top-10)),n.AddPath(o,ClipperLib.PolyType.ptSubject,!0),n.ReverseSolution=!0,n.Execute(ClipperLib.ClipType.ctUnion,i,ClipperLib.PolyFillType.pftNegative,ClipperLib.PolyFillType.pftNegative),i.length>0&&i.splice(0,1)}}},ClipperLib.ClipperOffset.prototype.OffsetPoint=function(t,e,i){if(this.m_sinA=this.m_normals[e].X*this.m_normals[t].Y-this.m_normals[t].X*this.m_normals[e].Y,this.m_sinA<5e-5&&this.m_sinA>-5e-5)return e;if(this.m_sinA>1?this.m_sinA=1:this.m_sinA<-1&&(this.m_sinA=-1),this.m_sinA*this.m_delta<0)this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_normals[e].X*this.m_delta),ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_normals[e].Y*this.m_delta))),this.m_destPoly.push(new ClipperLib.IntPoint(this.m_srcPoly[t])),this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_normals[t].X*this.m_delta),ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_normals[t].Y*this.m_delta)));else switch(i){case ClipperLib.JoinType.jtMiter:var r=1+(this.m_normals[t].X*this.m_normals[e].X+this.m_normals[t].Y*this.m_normals[e].Y);r>=this.m_miterLim?this.DoMiter(t,e,r):this.DoSquare(t,e);break;case ClipperLib.JoinType.jtSquare:this.DoSquare(t,e);break;case ClipperLib.JoinType.jtRound:this.DoRound(t,e)}return e=t},ClipperLib.ClipperOffset.prototype.DoSquare=function(t,e){var i=Math.tan(Math.atan2(this.m_sinA,this.m_normals[e].X*this.m_normals[t].X+this.m_normals[e].Y*this.m_normals[t].Y)/4);this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_delta*(this.m_normals[e].X-this.m_normals[e].Y*i)),ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_delta*(this.m_normals[e].Y+this.m_normals[e].X*i)))),this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_delta*(this.m_normals[t].X+this.m_normals[t].Y*i)),ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_delta*(this.m_normals[t].Y-this.m_normals[t].X*i))))},ClipperLib.ClipperOffset.prototype.DoMiter=function(t,e,i){var r=this.m_delta/i;this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].X+(this.m_normals[e].X+this.m_normals[t].X)*r),ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].Y+(this.m_normals[e].Y+this.m_normals[t].Y)*r)))},ClipperLib.ClipperOffset.prototype.DoRound=function(t,e){for(var i,r=Math.atan2(this.m_sinA,this.m_normals[e].X*this.m_normals[t].X+this.m_normals[e].Y*this.m_normals[t].Y),n=ClipperLib.Cast_Int32(ClipperLib.ClipperOffset.Round(this.m_StepsPerRad*Math.abs(r))),p=this.m_normals[e].X,o=this.m_normals[e].Y,l=0;l<n;++l)this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].X+p*this.m_delta),ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].Y+o*this.m_delta))),i=p,p=p*this.m_cos-this.m_sin*o,o=i*this.m_sin+o*this.m_cos;this.m_destPoly.push(new ClipperLib.IntPoint(ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_normals[t].X*this.m_delta),ClipperLib.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_normals[t].Y*this.m_delta)))},ClipperLib.Error=function(t){try{throw new Error(t)}catch(t){alert(t.message)}},ClipperLib.JS={},ClipperLib.JS.AreaOfPolygon=function(t,e){return e||(e=1),ClipperLib.Clipper.Area(t)/(e*e)},ClipperLib.JS.AreaOfPolygons=function(t,e){e||(e=1);for(var i=0,r=0;r<t.length;r++)i+=ClipperLib.Clipper.Area(t[r]);return i/(e*e)},ClipperLib.JS.BoundsOfPath=function(t,e){return ClipperLib.JS.BoundsOfPaths([t],e)},ClipperLib.JS.BoundsOfPaths=function(t,e){e||(e=1);var i=ClipperLib.Clipper.GetBounds(t);return i.left/=e,i.bottom/=e,i.right/=e,i.top/=e,i},ClipperLib.JS.Clean=function(t,e){if(!(t instanceof Array))return[];var i=t[0]instanceof Array,t=ClipperLib.JS.Clone(t);if("number"!=typeof e||null===e)return ClipperLib.Error("Delta is not a number in Clean()."),t;if(0===t.length||1==t.length&&0===t[0].length||e<0)return t;i||(t=[t]);for(var r,n,p,o,l,s,h,u=t.length,a=[],C=0;C<u;C++)if(n=t[C],r=n.length,0!==r)if(r<3)p=n,a.push(p);else{for(p=n,o=e*e,l=n[0],s=1,h=1;h<r;h++)(n[h].X-l.X)*(n[h].X-l.X)+(n[h].Y-l.Y)*(n[h].Y-l.Y)<=o||(p[s]=n[h],l=n[h],s++);l=n[s-1],(n[0].X-l.X)*(n[0].X-l.X)+(n[0].Y-l.Y)*(n[0].Y-l.Y)<=o&&s--,s<r&&p.splice(s,r-s),p.length&&a.push(p)}return!i&&a.length?a=a[0]:i||0!==a.length?i&&0===a.length&&(a=[[]]):a=[],a},ClipperLib.JS.Clone=function(t){if(!(t instanceof Array))return[];if(0===t.length)return[];if(1==t.length&&0===t[0].length)return[[]];var e=t[0]instanceof Array;e||(t=[t]);var i,r,n,p,o=t.length,l=new Array(o);for(r=0;r<o;r++){for(i=t[r].length,p=new Array(i),n=0;n<i;n++)p[n]={X:t[r][n].X,Y:t[r][n].Y};l[r]=p}return e||(l=l[0]),l},ClipperLib.JS.Lighten=function(t,e){if(!(t instanceof Array))return[];if("number"!=typeof e||null===e)return ClipperLib.Error("Tolerance is not a number in Lighten()."),ClipperLib.JS.Clone(t);if(0===t.length||1==t.length&&0===t[0].length||e<0)return ClipperLib.JS.Clone(t);t[0]instanceof Array||(t=[t]);var i,r,n,p,o,l,s,h,u,a,C,f,d,L,P,b,m,y=t.length,c=e*e,v=[];for(i=0;i<y;i++)if(n=t[i],l=n.length,0!=l){for(p=0;p<1e6;p++){for(o=[],l=n.length,n[l-1].X!=n[0].X||n[l-1].Y!=n[0].Y?(f=1,n.push({X:n[0].X,Y:n[0].Y}),l=n.length):f=0,C=[],r=0;r<l-2;r++)s=n[r],u=n[r+1],h=n[r+2],b=s.X,m=s.Y,d=h.X-b,L=h.Y-m,0===d&&0===L||(P=((u.X-b)*d+(u.Y-m)*L)/(d*d+L*L),P>1?(b=h.X,m=h.Y):P>0&&(b+=d*P,m+=L*P)),d=u.X-b,L=u.Y-m,a=d*d+L*L,a<=c&&(C[r+1]=1,r++);for(o.push({X:n[0].X,Y:n[0].Y}),r=1;r<l-1;r++)C[r]||o.push({X:n[r].X,Y:n[r].Y});if(o.push({X:n[l-1].X,Y:n[l-1].Y}),f&&n.pop(),!C.length)break;n=o}l=o.length,o[l-1].X==o[0].X&&o[l-1].Y==o[0].Y&&o.pop(),o.length>2&&v.push(o)}return!t[0]instanceof Array&&(v=v[0]),"undefined"==typeof v&&(v=[[]]),v},ClipperLib.JS.PerimeterOfPath=function(t,e,i){if("undefined"==typeof t)return 0;var r,n,p=Math.sqrt,o=0,l=0,s=0,h=0,u=0,a=t.length;if(a<2)return 0;for(e&&(t[a]=t[0],a++);--a;)r=t[a],l=r.X,s=r.Y,n=t[a-1],h=n.X,u=n.Y,o+=p((l-h)*(l-h)+(s-u)*(s-u));return e&&t.pop(),o/i},ClipperLib.JS.PerimeterOfPaths=function(t,e,i){i||(i=1);for(var r=0,n=0;n<t.length;n++)r+=ClipperLib.JS.PerimeterOfPath(t[n],e,i);return r},ClipperLib.JS.ScaleDownPath=function(t,e){var i,r;for(e||(e=1),i=t.length;i--;)r=t[i],r.X=r.X/e,r.Y=r.Y/e},ClipperLib.JS.ScaleDownPaths=function(t,e){var i,r,n;Math.round;for(e||(e=1),i=t.length;i--;)for(r=t[i].length;r--;)n=t[i][r],n.X=n.X/e,n.Y=n.Y/e},ClipperLib.JS.ScaleUpPath=function(t,e){var i,r,n=Math.round;for(e||(e=1),i=t.length;i--;)r=t[i],r.X=n(r.X*e),r.Y=n(r.Y*e)},ClipperLib.JS.ScaleUpPaths=function(t,e){var i,r,n,p=Math.round;for(e||(e=1),i=t.length;i--;)for(r=t[i].length;r--;)n=t[i][r],n.X=p(n.X*e),n.Y=p(n.Y*e)},ClipperLib.ExPolygons=function(){return[]},ClipperLib.ExPolygon=function(){this.outer=null,this.holes=null},ClipperLib.JS.AddOuterPolyNodeToExPolygons=function(t,e){var i=new ClipperLib.ExPolygon;i.outer=t.Contour();var r=t.Childs(),n=r.length;i.holes=new Array(n);var p,o,l,s,h,u;for(l=0;l<n;l++)for(p=r[l],i.holes[l]=p.Contour(),s=0,h=p.Childs(),u=h.length;s<u;s++)o=h[s],ClipperLib.JS.AddOuterPolyNodeToExPolygons(o,e);e.push(i)},ClipperLib.JS.ExPolygonsToPaths=function(t){var e,i,r,n,p=new ClipperLib.Paths;for(e=0,r=t.length;e<r;e++)for(p.push(t[e].outer),i=0,n=t[e].holes.length;i<n;i++)p.push(t[e].holes[i]);return p},ClipperLib.JS.PolyTreeToExPolygons=function(t){var e,i,r,n,p=new ClipperLib.ExPolygons;for(i=0,r=t.Childs(),n=r.length;i<n;i++)e=r[i],ClipperLib.JS.AddOuterPolyNodeToExPolygons(e,p);return p},module.exports=ClipperLib;
-
-
-},{}],3:[function(require,module,exports){
+(function (process,global){
+!function(n,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t(n.async=n.async||{})}(this,function(n){"use strict";function t(n,t,e){switch(e.length){case 0:return n.call(t);case 1:return n.call(t,e[0]);case 2:return n.call(t,e[0],e[1]);case 3:return n.call(t,e[0],e[1],e[2])}return n.apply(t,e)}function e(n,e,r){return e=rt(void 0===e?n.length-1:e,0),function(){for(var u=arguments,o=-1,i=rt(u.length-e,0),c=Array(i);++o<i;)c[o]=u[e+o];o=-1;for(var f=Array(e+1);++o<e;)f[o]=u[o];return f[e]=r(c),t(n,this,f)}}function r(n){return n}function u(n,t){return e(n,t,r)}function o(n){return u(function(t,e){var r=ut(function(e,r){var u=this;return n(t,function(n,t){n.apply(u,e.concat([t]))},r)});return e.length?r.apply(this,e):r})}function i(n){var t=lt.call(n,pt),e=n[pt];try{n[pt]=void 0;var r=!0}catch(n){}var u=st.call(n);return r&&(t?n[pt]=e:delete n[pt]),u}function c(n){return yt.call(n)}function f(n){return null==n?void 0===n?dt:vt:(n=Object(n),mt&&mt in n?i(n):c(n))}function a(n){var t=typeof n;return null!=n&&("object"==t||"function"==t)}function l(n){if(!a(n))return!1;var t=f(n);return t==bt||t==jt||t==gt||t==St}function s(n){return"number"==typeof n&&n>-1&&n%1==0&&n<=kt}function p(n){return null!=n&&s(n.length)&&!l(n)}function h(){}function y(n){return function(){if(null!==n){var t=n;n=null,t.apply(this,arguments)}}}function v(n,t){for(var e=-1,r=Array(n);++e<n;)r[e]=t(e);return r}function d(n){return null!=n&&"object"==typeof n}function m(n){return d(n)&&f(n)==Ot}function g(){return!1}function b(n,t){return t=null==t?Vt:t,!!t&&("number"==typeof n||Pt.test(n))&&n>-1&&n%1==0&&n<t}function j(n){return d(n)&&s(n.length)&&!!ae[f(n)]}function S(n){return function(t){return n(t)}}function k(n,t){var e=Ft(n),r=!e&&Tt(n),u=!e&&!r&&zt(n),o=!e&&!r&&!u&&me(n),i=e||r||u||o,c=i?v(n.length,String):[],f=c.length;for(var a in n)!t&&!be.call(n,a)||i&&("length"==a||u&&("offset"==a||"parent"==a)||o&&("buffer"==a||"byteLength"==a||"byteOffset"==a)||b(a,f))||c.push(a);return c}function w(n){var t=n&&n.constructor,e="function"==typeof t&&t.prototype||je;return n===e}function x(n,t){return function(e){return n(t(e))}}function O(n){if(!w(n))return Se(n);var t=[];for(var e in Object(n))we.call(n,e)&&"constructor"!=e&&t.push(e);return t}function E(n){return p(n)?k(n):O(n)}function L(n){var t=-1,e=n.length;return function(){return++t<e?{value:n[t],key:t}:null}}function A(n){var t=-1;return function(){var e=n.next();return e.done?null:(t++,{value:e.value,key:t})}}function T(n){var t=E(n),e=-1,r=t.length;return function(){var u=t[++e];return e<r?{value:n[u],key:u}:null}}function F(n){if(p(n))return L(n);var t=xt(n);return t?A(t):T(n)}function I(n){return function(){if(null===n)throw new Error("Callback was already called.");var t=n;n=null,t.apply(this,arguments)}}function _(n){return function(t,e,r){function u(n,t){if(f-=1,n)c=!0,r(n);else{if(t===xe||c&&f<=0)return c=!0,r(null);o()}}function o(){for(;f<n&&!c;){var t=i();if(null===t)return c=!0,void(f<=0&&r(null));f+=1,e(t.value,t.key,I(u))}}if(r=y(r||h),n<=0||!t)return r(null);var i=F(t),c=!1,f=0;o()}}function B(n,t,e,r){_(t)(n,e,r)}function M(n,t){return function(e,r,u){return n(e,t,r,u)}}function U(n,t,e){function r(n){n?e(n):++o===i&&e(null)}e=y(e||h);var u=0,o=0,i=n.length;for(0===i&&e(null);u<i;u++)t(n[u],u,I(r))}function z(n){return function(t,e,r){return n(Ee,t,e,r)}}function V(n,t,e,r){r=r||h,t=t||[];var u=[],o=0;n(t,function(n,t,r){var i=o++;e(n,function(n,t){u[i]=t,r(n)})},function(n){r(n,u)})}function P(n){return function(t,e,r,u){return n(_(e),t,r,u)}}function q(n){return ut(function(t,e){var r;try{r=n.apply(this,t)}catch(n){return e(n)}a(r)&&"function"==typeof r.then?r.then(function(n){e(null,n)},function(n){e(n.message?n:new Error(n))}):e(null,r)})}function D(n,t){for(var e=-1,r=null==n?0:n.length;++e<r&&t(n[e],e,n)!==!1;);return n}function R(n){return function(t,e,r){for(var u=-1,o=Object(t),i=r(t),c=i.length;c--;){var f=i[n?c:++u];if(e(o[f],f,o)===!1)break}return t}}function C(n,t){return n&&Be(n,t,E)}function $(n,t,e,r){for(var u=n.length,o=e+(r?1:-1);r?o--:++o<u;)if(t(n[o],o,n))return o;return-1}function W(n){return n!==n}function N(n,t,e){for(var r=e-1,u=n.length;++r<u;)if(n[r]===t)return r;return-1}function Q(n,t,e){return t===t?N(n,t,e):$(n,W,e)}function G(n,t){for(var e=-1,r=null==n?0:n.length,u=Array(r);++e<r;)u[e]=t(n[e],e,n);return u}function H(n){return"symbol"==typeof n||d(n)&&f(n)==Ue}function J(n){if("string"==typeof n)return n;if(Ft(n))return G(n,J)+"";if(H(n))return Pe?Pe.call(n):"";var t=n+"";return"0"==t&&1/n==-ze?"-0":t}function K(n,t,e){var r=-1,u=n.length;t<0&&(t=-t>u?0:u+t),e=e>u?u:e,e<0&&(e+=u),u=t>e?0:e-t>>>0,t>>>=0;for(var o=Array(u);++r<u;)o[r]=n[r+t];return o}function X(n,t,e){var r=n.length;return e=void 0===e?r:e,!t&&e>=r?n:K(n,t,e)}function Y(n,t){for(var e=n.length;e--&&Q(t,n[e],0)>-1;);return e}function Z(n,t){for(var e=-1,r=n.length;++e<r&&Q(t,n[e],0)>-1;);return e}function nn(n){return n.split("")}function tn(n){return We.test(n)}function en(n){return n.match(fr)||[]}function rn(n){return tn(n)?en(n):nn(n)}function un(n){return null==n?"":J(n)}function on(n,t,e){if(n=un(n),n&&(e||void 0===t))return n.replace(ar,"");if(!n||!(t=J(t)))return n;var r=rn(n),u=rn(t),o=Z(r,u),i=Y(r,u)+1;return X(r,o,i).join("")}function cn(n){return n=n.toString().replace(hr,""),n=n.match(lr)[2].replace(" ",""),n=n?n.split(sr):[],n=n.map(function(n){return on(n.replace(pr,""))})}function fn(n,t){var e={};C(n,function(n,t){function r(t,e){var r=G(u,function(n){return t[n]});r.push(e),n.apply(null,r)}var u;if(Ft(n))u=n.slice(0,-1),n=n[n.length-1],e[t]=u.concat(u.length>0?r:n);else if(1===n.length)e[t]=n;else{if(u=cn(n),0===n.length&&0===u.length)throw new Error("autoInject task functions require explicit parameters.");u.pop(),e[t]=u.concat(r)}}),Me(e,t)}function an(n){setTimeout(n,0)}function ln(n){return u(function(t,e){n(function(){t.apply(null,e)})})}function sn(){this.head=this.tail=null,this.length=0}function pn(n,t){n.length=1,n.head=n.tail=t}function hn(n,t,e){function r(n,t,e){if(null!=e&&"function"!=typeof e)throw new Error("task callback must be a function");if(f.started=!0,Ft(n)||(n=[n]),0===n.length&&f.idle())return dr(function(){f.drain()});for(var r=0,u=n.length;r<u;r++){var o={data:n[r],callback:e||h};t?f._tasks.unshift(o):f._tasks.push(o)}dr(f.process)}function o(n){return u(function(t){i-=1;for(var e=0,r=n.length;e<r;e++){var u=n[e],o=Q(c,u,0);o>=0&&c.splice(o),u.callback.apply(u,t),null!=t[0]&&f.error(t[0],u.data)}i<=f.concurrency-f.buffer&&f.unsaturated(),f.idle()&&f.drain(),f.process()})}if(null==t)t=1;else if(0===t)throw new Error("Concurrency must not be zero");var i=0,c=[],f={_tasks:new sn,concurrency:t,payload:e,saturated:h,unsaturated:h,buffer:t/4,empty:h,drain:h,error:h,started:!1,paused:!1,push:function(n,t){r(n,!1,t)},kill:function(){f.drain=h,f._tasks.empty()},unshift:function(n,t){r(n,!0,t)},process:function(){for(;!f.paused&&i<f.concurrency&&f._tasks.length;){var t=[],e=[],r=f._tasks.length;f.payload&&(r=Math.min(r,f.payload));for(var u=0;u<r;u++){var a=f._tasks.shift();t.push(a),e.push(a.data)}0===f._tasks.length&&f.empty(),i+=1,c.push(t[0]),i===f.concurrency&&f.saturated();var l=I(o(t));n(e,l)}},length:function(){return f._tasks.length},running:function(){return i},workersList:function(){return c},idle:function(){return f._tasks.length+i===0},pause:function(){f.paused=!0},resume:function(){if(f.paused!==!1){f.paused=!1;for(var n=Math.min(f.concurrency,f._tasks.length),t=1;t<=n;t++)dr(f.process)}}};return f}function yn(n,t){return hn(n,1,t)}function vn(n,t,e,r){r=y(r||h),gr(n,function(n,r,u){e(t,n,function(n,e){t=e,u(n)})},function(n){r(n,t)})}function dn(n,t,e,r){var u=[];n(t,function(n,t,r){e(n,function(n,t){u=u.concat(t||[]),r(n)})},function(n){r(n,u)})}function mn(n){return function(t,e,r){return n(gr,t,e,r)}}function gn(n,t,e){return function(r,u,o,i){function c(){i&&i(null,e(!1))}function f(n,r,u){return i?void o(n,function(r,c){i&&(r||t(c))?(r?i(r):i(r,e(!0,n)),i=o=!1,u(r,xe)):u()}):u()}arguments.length>3?(i=i||h,n(r,u,f,c)):(i=o,i=i||h,o=u,n(r,f,c))}}function bn(n,t){return t}function jn(n){return u(function(t,e){t.apply(null,e.concat([u(function(t,e){"object"==typeof console&&(t?console.error&&console.error(t):console[n]&&D(e,function(t){console[n](t)}))})]))})}function Sn(n,t,e){function r(t,r){return t?e(t):r?void n(o):e(null)}e=I(e||h);var o=u(function(n,u){return n?e(n):(u.push(r),void t.apply(this,u))});r(null,!0)}function kn(n,t,e){e=I(e||h);var r=u(function(u,o){return u?e(u):t.apply(this,o)?n(r):void e.apply(null,[null].concat(o))});n(r)}function wn(n,t,e){kn(n,function(){return!t.apply(this,arguments)},e)}function xn(n,t,e){function r(t){return t?e(t):void n(u)}function u(n,u){return n?e(n):u?void t(r):e(null)}e=I(e||h),n(u)}function On(n){return function(t,e,r){return n(t,r)}}function En(n,t,e){Ee(n,On(t),e)}function Ln(n,t,e,r){_(t)(n,On(e),r)}function An(n){return ut(function(t,e){var r=!0;t.push(function(){var n=arguments;r?dr(function(){e.apply(null,n)}):e.apply(null,n)}),n.apply(this,t),r=!1})}function Tn(n){return!n}function Fn(n){return function(t){return null==t?void 0:t[n]}}function In(n,t,e,r){var u=new Array(t.length);n(t,function(n,t,r){e(n,function(n,e){u[t]=!!e,r(n)})},function(n){if(n)return r(n);for(var e=[],o=0;o<t.length;o++)u[o]&&e.push(t[o]);r(null,e)})}function _n(n,t,e,r){var u=[];n(t,function(n,t,r){e(n,function(e,o){e?r(e):(o&&u.push({index:t,value:n}),r())})},function(n){n?r(n):r(null,G(u.sort(function(n,t){return n.index-t.index}),Fn("value")))})}function Bn(n,t,e,r){var u=p(t)?In:_n;u(n,t,e,r||h)}function Mn(n,t){function e(n){return n?r(n):void u(e)}var r=I(t||h),u=An(n);e()}function Un(n,t,e,r){r=y(r||h);var u={};B(n,t,function(n,t,r){e(n,t,function(n,e){return n?r(n):(u[t]=e,void r())})},function(n){r(n,u)})}function zn(n,t){return t in n}function Vn(n,t){var e=Object.create(null),o=Object.create(null);t=t||r;var i=ut(function(r,i){var c=t.apply(null,r);zn(e,c)?dr(function(){i.apply(null,e[c])}):zn(o,c)?o[c].push(i):(o[c]=[i],n.apply(null,r.concat([u(function(n){e[c]=n;var t=o[c];delete o[c];for(var r=0,u=t.length;r<u;r++)t[r].apply(null,n)})])))});return i.memo=e,i.unmemoized=n,i}function Pn(n,t,e){e=e||h;var r=p(t)?[]:{};n(t,function(n,t,e){n(u(function(n,u){u.length<=1&&(u=u[0]),r[t]=u,e(n)}))},function(n){e(n,r)})}function qn(n,t){Pn(Ee,n,t)}function Dn(n,t,e){Pn(_(t),n,e)}function Rn(n,t){if(t=y(t||h),!Ft(n))return t(new TypeError("First argument to race must be an array of functions"));if(!n.length)return t();for(var e=0,r=n.length;e<r;e++)n[e](t)}function Cn(n,t,e,r){var u=Rr.call(n).reverse();vn(u,t,e,r)}function $n(n){return ut(function(t,e){return t.push(u(function(n,t){if(n)e(null,{error:n});else{var r=null;1===t.length?r=t[0]:t.length>1&&(r=t),e(null,{value:r})}})),n.apply(this,t)})}function Wn(n,t,e,r){Bn(n,t,function(n,t){e(n,function(n,e){t(n,!e)})},r)}function Nn(n){var t;return Ft(n)?t=G(n,$n):(t={},C(n,function(n,e){t[e]=$n.call(this,n)})),t}function Qn(n){return function(){return n}}function Gn(n,t,e){function r(n,t){if("object"==typeof t)n.times=+t.times||o,n.intervalFunc="function"==typeof t.interval?t.interval:Qn(+t.interval||i),n.errorFilter=t.errorFilter;else{if("number"!=typeof t&&"string"!=typeof t)throw new Error("Invalid arguments for async.retry");n.times=+t||o}}function u(){t(function(n){n&&f++<c.times&&("function"!=typeof c.errorFilter||c.errorFilter(n))?setTimeout(u,c.intervalFunc(f)):e.apply(null,arguments)})}var o=5,i=0,c={times:o,intervalFunc:Qn(i)};if(arguments.length<3&&"function"==typeof n?(e=t||h,t=n):(r(c,n),e=e||h),"function"!=typeof t)throw new Error("Invalid arguments for async.retry");var f=1;u()}function Hn(n,t){Pn(gr,n,t)}function Jn(n,t,e){function r(n,t){var e=n.criteria,r=t.criteria;return e<r?-1:e>r?1:0}Le(n,function(n,e){t(n,function(t,r){return t?e(t):void e(null,{value:n,criteria:r})})},function(n,t){return n?e(n):void e(null,G(t.sort(r),Fn("value")))})}function Kn(n,t,e){function r(){c||(o.apply(null,arguments),clearTimeout(i))}function u(){var t=n.name||"anonymous",r=new Error('Callback function "'+t+'" timed out.');r.code="ETIMEDOUT",e&&(r.info=e),c=!0,o(r)}var o,i,c=!1;return ut(function(e,c){o=c,i=setTimeout(u,t),n.apply(null,e.concat(r))})}function Xn(n,t,e,r){for(var u=-1,o=Kr(Jr((t-n)/(e||1)),0),i=Array(o);o--;)i[r?o:++u]=n,n+=e;return i}function Yn(n,t,e,r){Te(Xn(0,n,1),t,e,r)}function Zn(n,t,e,r){3===arguments.length&&(r=e,e=t,t=Ft(n)?[]:{}),r=y(r||h),Ee(n,function(n,r,u){e(t,n,r,u)},function(n){r(n,t)})}function nt(n){return function(){return(n.unmemoized||n).apply(null,arguments)}}function tt(n,t,e){if(e=I(e||h),!n())return e(null);var r=u(function(u,o){return u?e(u):n()?t(r):void e.apply(null,[null].concat(o))});t(r)}function et(n,t,e){tt(function(){return!n.apply(this,arguments)},t,e)}var rt=Math.max,ut=function(n){return u(function(t){var e=t.pop();n.call(this,t,e)})},ot="object"==typeof global&&global&&global.Object===Object&&global,it="object"==typeof self&&self&&self.Object===Object&&self,ct=ot||it||Function("return this")(),ft=ct.Symbol,at=Object.prototype,lt=at.hasOwnProperty,st=at.toString,pt=ft?ft.toStringTag:void 0,ht=Object.prototype,yt=ht.toString,vt="[object Null]",dt="[object Undefined]",mt=ft?ft.toStringTag:void 0,gt="[object AsyncFunction]",bt="[object Function]",jt="[object GeneratorFunction]",St="[object Proxy]",kt=9007199254740991,wt="function"==typeof Symbol&&Symbol.iterator,xt=function(n){return wt&&n[wt]&&n[wt]()},Ot="[object Arguments]",Et=Object.prototype,Lt=Et.hasOwnProperty,At=Et.propertyIsEnumerable,Tt=m(function(){return arguments}())?m:function(n){return d(n)&&Lt.call(n,"callee")&&!At.call(n,"callee")},Ft=Array.isArray,It="object"==typeof n&&n&&!n.nodeType&&n,_t=It&&"object"==typeof module&&module&&!module.nodeType&&module,Bt=_t&&_t.exports===It,Mt=Bt?ct.Buffer:void 0,Ut=Mt?Mt.isBuffer:void 0,zt=Ut||g,Vt=9007199254740991,Pt=/^(?:0|[1-9]\d*)$/,qt="[object Arguments]",Dt="[object Array]",Rt="[object Boolean]",Ct="[object Date]",$t="[object Error]",Wt="[object Function]",Nt="[object Map]",Qt="[object Number]",Gt="[object Object]",Ht="[object RegExp]",Jt="[object Set]",Kt="[object String]",Xt="[object WeakMap]",Yt="[object ArrayBuffer]",Zt="[object DataView]",ne="[object Float32Array]",te="[object Float64Array]",ee="[object Int8Array]",re="[object Int16Array]",ue="[object Int32Array]",oe="[object Uint8Array]",ie="[object Uint8ClampedArray]",ce="[object Uint16Array]",fe="[object Uint32Array]",ae={};ae[ne]=ae[te]=ae[ee]=ae[re]=ae[ue]=ae[oe]=ae[ie]=ae[ce]=ae[fe]=!0,ae[qt]=ae[Dt]=ae[Yt]=ae[Rt]=ae[Zt]=ae[Ct]=ae[$t]=ae[Wt]=ae[Nt]=ae[Qt]=ae[Gt]=ae[Ht]=ae[Jt]=ae[Kt]=ae[Xt]=!1;var le,se="object"==typeof n&&n&&!n.nodeType&&n,pe=se&&"object"==typeof module&&module&&!module.nodeType&&module,he=pe&&pe.exports===se,ye=he&&ot.process,ve=function(){try{return ye&&ye.binding("util")}catch(n){}}(),de=ve&&ve.isTypedArray,me=de?S(de):j,ge=Object.prototype,be=ge.hasOwnProperty,je=Object.prototype,Se=x(Object.keys,Object),ke=Object.prototype,we=ke.hasOwnProperty,xe={},Oe=M(B,1/0),Ee=function(n,t,e){var r=p(n)?U:Oe;r(n,t,e)},Le=z(V),Ae=o(Le),Te=P(V),Fe=M(Te,1),Ie=o(Fe),_e=u(function(n,t){return u(function(e){return n.apply(null,t.concat(e))})}),Be=R(),Me=function(n,t,e){function r(n,t){b.push(function(){f(n,t)})}function o(){if(0===b.length&&0===d)return e(null,v);for(;b.length&&d<t;){var n=b.shift();n()}}function i(n,t){var e=g[n];e||(e=g[n]=[]),e.push(t)}function c(n){var t=g[n]||[];D(t,function(n){n()}),o()}function f(n,t){if(!m){var r=I(u(function(t,r){if(d--,r.length<=1&&(r=r[0]),t){var u={};C(v,function(n,t){u[t]=n}),u[n]=r,m=!0,g=[],e(t,u)}else v[n]=r,c(n)}));d++;var o=t[t.length-1];t.length>1?o(v,r):o(r)}}function a(){for(var n,t=0;j.length;)n=j.pop(),t++,D(l(n),function(n){0===--S[n]&&j.push(n)});if(t!==p)throw new Error("async.auto cannot execute tasks due to a recursive dependency")}function l(t){var e=[];return C(n,function(n,r){Ft(n)&&Q(n,t,0)>=0&&e.push(r)}),e}"function"==typeof t&&(e=t,t=null),e=y(e||h);var s=E(n),p=s.length;if(!p)return e(null);t||(t=p);var v={},d=0,m=!1,g={},b=[],j=[],S={};C(n,function(t,e){if(!Ft(t))return r(e,[t]),void j.push(e);var u=t.slice(0,t.length-1),o=u.length;return 0===o?(r(e,t),void j.push(e)):(S[e]=o,void D(u,function(c){if(!n[c])throw new Error("async.auto task `"+e+"` has a non-existent dependency in "+u.join(", "));i(c,function(){o--,0===o&&r(e,t)})}))}),a(),o()},Ue="[object Symbol]",ze=1/0,Ve=ft?ft.prototype:void 0,Pe=Ve?Ve.toString:void 0,qe="\\ud800-\\udfff",De="\\u0300-\\u036f\\ufe20-\\ufe23",Re="\\u20d0-\\u20f0",Ce="\\ufe0e\\ufe0f",$e="\\u200d",We=RegExp("["+$e+qe+De+Re+Ce+"]"),Ne="\\ud800-\\udfff",Qe="\\u0300-\\u036f\\ufe20-\\ufe23",Ge="\\u20d0-\\u20f0",He="\\ufe0e\\ufe0f",Je="["+Ne+"]",Ke="["+Qe+Ge+"]",Xe="\\ud83c[\\udffb-\\udfff]",Ye="(?:"+Ke+"|"+Xe+")",Ze="[^"+Ne+"]",nr="(?:\\ud83c[\\udde6-\\uddff]){2}",tr="[\\ud800-\\udbff][\\udc00-\\udfff]",er="\\u200d",rr=Ye+"?",ur="["+He+"]?",or="(?:"+er+"(?:"+[Ze,nr,tr].join("|")+")"+ur+rr+")*",ir=ur+rr+or,cr="(?:"+[Ze+Ke+"?",Ke,nr,tr,Je].join("|")+")",fr=RegExp(Xe+"(?="+Xe+")|"+cr+ir,"g"),ar=/^\s+|\s+$/g,lr=/^(function)?\s*[^\(]*\(\s*([^\)]*)\)/m,sr=/,/,pr=/(=.+)?(\s*)$/,hr=/((\/\/.*$)|(\/\*[\s\S]*?\*\/))/gm,yr="function"==typeof setImmediate&&setImmediate,vr="object"==typeof process&&"function"==typeof process.nextTick;le=yr?setImmediate:vr?process.nextTick:an;var dr=ln(le);sn.prototype.removeLink=function(n){return n.prev?n.prev.next=n.next:this.head=n.next,n.next?n.next.prev=n.prev:this.tail=n.prev,n.prev=n.next=null,this.length-=1,n},sn.prototype.empty=sn,sn.prototype.insertAfter=function(n,t){t.prev=n,t.next=n.next,n.next?n.next.prev=t:this.tail=t,n.next=t,this.length+=1},sn.prototype.insertBefore=function(n,t){t.prev=n.prev,t.next=n,n.prev?n.prev.next=t:this.head=t,n.prev=t,this.length+=1},sn.prototype.unshift=function(n){this.head?this.insertBefore(this.head,n):pn(this,n)},sn.prototype.push=function(n){this.tail?this.insertAfter(this.tail,n):pn(this,n)},sn.prototype.shift=function(){return this.head&&this.removeLink(this.head)},sn.prototype.pop=function(){return this.tail&&this.removeLink(this.tail)};var mr,gr=M(B,1),br=u(function(n){return u(function(t){var e=this,r=t[t.length-1];"function"==typeof r?t.pop():r=h,vn(n,t,function(n,t,r){t.apply(e,n.concat([u(function(n,t){r(n,t)})]))},function(n,t){r.apply(e,[n].concat(t))})})}),jr=u(function(n){return br.apply(null,n.reverse())}),Sr=z(dn),kr=mn(dn),wr=u(function(n){var t=[null].concat(n);return ut(function(n,e){return e.apply(this,t)})}),xr=gn(Ee,r,bn),Or=gn(B,r,bn),Er=gn(gr,r,bn),Lr=jn("dir"),Ar=M(Ln,1),Tr=gn(Ee,Tn,Tn),Fr=gn(B,Tn,Tn),Ir=M(Fr,1),_r=z(Bn),Br=P(Bn),Mr=M(Br,1),Ur=jn("log"),zr=M(Un,1/0),Vr=M(Un,1);mr=vr?process.nextTick:yr?setImmediate:an;var Pr=ln(mr),qr=function(n,t){return hn(function(t,e){n(t[0],e)},t,1)},Dr=function(n,t){var e=qr(n,t);return e.push=function(n,t,r){if(null==r&&(r=h),"function"!=typeof r)throw new Error("task callback must be a function");if(e.started=!0,Ft(n)||(n=[n]),0===n.length)return dr(function(){e.drain()});t=t||0;for(var u=e._tasks.head;u&&t>=u.priority;)u=u.next;for(var o=0,i=n.length;o<i;o++){var c={data:n[o],priority:t,callback:r};u?e._tasks.insertBefore(u,c):e._tasks.push(c)}dr(e.process)},delete e.unshift,e},Rr=Array.prototype.slice,Cr=z(Wn),$r=P(Wn),Wr=M($r,1),Nr=function(n,t){return t||(t=n,n=null),ut(function(e,r){function u(n){t.apply(null,e.concat([n]))}n?Gn(n,u,r):Gn(u,r)})},Qr=gn(Ee,Boolean,r),Gr=gn(B,Boolean,r),Hr=M(Gr,1),Jr=Math.ceil,Kr=Math.max,Xr=M(Yn,1/0),Yr=M(Yn,1),Zr=function(n,t){function e(o){if(r===n.length)return t.apply(null,[null].concat(o));var i=I(u(function(n,r){return n?t.apply(null,[n].concat(r)):void e(r)}));o.push(i);var c=n[r++];c.apply(null,o)}if(t=y(t||h),!Ft(n))return t(new Error("First argument to waterfall must be an array of functions"));if(!n.length)return t();var r=0;e([])},nu={applyEach:Ae,applyEachSeries:Ie,apply:_e,asyncify:q,auto:Me,autoInject:fn,cargo:yn,compose:jr,concat:Sr,concatSeries:kr,constant:wr,detect:xr,detectLimit:Or,detectSeries:Er,dir:Lr,doDuring:Sn,doUntil:wn,doWhilst:kn,during:xn,each:En,eachLimit:Ln,eachOf:Ee,eachOfLimit:B,eachOfSeries:gr,eachSeries:Ar,ensureAsync:An,every:Tr,everyLimit:Fr,everySeries:Ir,filter:_r,filterLimit:Br,filterSeries:Mr,forever:Mn,log:Ur,map:Le,mapLimit:Te,mapSeries:Fe,mapValues:zr,mapValuesLimit:Un,mapValuesSeries:Vr,memoize:Vn,nextTick:Pr,parallel:qn,parallelLimit:Dn,priorityQueue:Dr,queue:qr,race:Rn,reduce:vn,reduceRight:Cn,reflect:$n,reflectAll:Nn,reject:Cr,rejectLimit:$r,rejectSeries:Wr,retry:Gn,retryable:Nr,seq:br,series:Hn,setImmediate:dr,some:Qr,someLimit:Gr,someSeries:Hr,sortBy:Jn,timeout:Kn,times:Xr,timesLimit:Yn,timesSeries:Yr,transform:Zn,unmemoize:nt,until:et,waterfall:Zr,whilst:tt,all:Tr,any:Qr,forEach:En,forEachSeries:Ar,forEachLimit:Ln,forEachOf:Ee,forEachOfSeries:gr,forEachOfLimit:B,inject:vn,foldl:vn,foldr:Cn,select:_r,selectLimit:Br,selectSeries:Mr,wrapSync:q};n.default=nu,n.applyEach=Ae,n.applyEachSeries=Ie,n.apply=_e,n.asyncify=q,n.auto=Me,n.autoInject=fn,n.cargo=yn,n.compose=jr,n.concat=Sr,n.concatSeries=kr,n.constant=wr,n.detect=xr,n.detectLimit=Or,n.detectSeries=Er,n.dir=Lr,n.doDuring=Sn,n.doUntil=wn,n.doWhilst=kn,n.during=xn,n.each=En,n.eachLimit=Ln,n.eachOf=Ee,n.eachOfLimit=B,n.eachOfSeries=gr,n.eachSeries=Ar,n.ensureAsync=An,n.every=Tr,n.everyLimit=Fr,n.everySeries=Ir,n.filter=_r,n.filterLimit=Br,n.filterSeries=Mr,n.forever=Mn,n.log=Ur,n.map=Le,n.mapLimit=Te,n.mapSeries=Fe,n.mapValues=zr,n.mapValuesLimit=Un,n.mapValuesSeries=Vr,n.memoize=Vn,n.nextTick=Pr,n.parallel=qn,n.parallelLimit=Dn,n.priorityQueue=Dr,n.queue=qr,n.race=Rn,n.reduce=vn,n.reduceRight=Cn,n.reflect=$n,n.reflectAll=Nn,n.reject=Cr,n.rejectLimit=$r,n.rejectSeries=Wr,n.retry=Gn,n.retryable=Nr,n.seq=br,n.series=Hn,n.setImmediate=dr,n.some=Qr,n.someLimit=Gr,n.someSeries=Hr,n.sortBy=Jn,n.timeout=Kn,n.times=Xr,n.timesLimit=Yn,n.timesSeries=Yr,n.transform=Zn,n.unmemoize=nt,n.until=et,n.waterfall=Zr,n.whilst=tt,n.all=Tr,n.allLimit=Fr,n.allSeries=Ir,n.any=Qr,n.anyLimit=Gr,n.anySeries=Hr,n.find=xr,n.findLimit=Or,n.findSeries=Er,n.forEach=En,n.forEachSeries=Ar,n.forEachLimit=Ln,n.forEachOf=Ee,n.forEachOfSeries=gr,n.forEachOfLimit=B,n.inject=vn,n.foldl=vn,n.foldr=Cn,n.select=_r,n.selectLimit=Br,n.selectSeries=Mr,n.wrapSync=q,Object.defineProperty(n,"__esModule",{value:!0})});
+}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
+},{"_process":3}],2:[function(require,module,exports){
 (function (global){
-(function(){function n(n,t){if(n!==t){var r=null===n,e=n===b,u=n===n,i=null===t,o=t===b,f=t===t;if(n>t&&!i||!u||r&&!o&&f||e&&f)return 1;if(n<t&&!r||!f||i&&!e&&u||o&&u)return-1}return 0}function t(n,t,r){for(var e=n.length,u=r?e:-1;r?u--:++u<e;)if(t(n[u],u,n))return u;return-1}function r(n,t,r){if(t!==t)return h(n,r);for(var e=r-1,u=n.length;++e<u;)if(n[e]===t)return e;return-1}function e(n){return"function"==typeof n||!1}function u(n){return null==n?"":n+""}function i(n,t){for(var r=-1,e=n.length;++r<e&&t.indexOf(n.charAt(r))>-1;);return r}function o(n,t){for(var r=n.length;r--&&t.indexOf(n.charAt(r))>-1;);return r}function f(t,r){return n(t.criteria,r.criteria)||t.index-r.index}function a(t,r,e){for(var u=-1,i=t.criteria,o=r.criteria,f=i.length,a=e.length;++u<f;){var c=n(i[u],o[u]);if(c){if(u>=a)return c;var l=e[u];return c*("asc"===l||l===!0?1:-1)}}return t.index-r.index}function c(n){return qn[n]}function l(n){return Mn[n]}function s(n,t,r){return t?n=Vn[n]:r&&(n=Yn[n]),"\\"+n}function p(n){return"\\"+Yn[n]}function h(n,t,r){for(var e=n.length,u=t+(r?0:-1);r?u--:++u<e;){var i=n[u];if(i!==i)return u}return-1}function v(n){return!!n&&"object"==typeof n}function _(n){return n<=160&&n>=9&&n<=13||32==n||160==n||5760==n||6158==n||n>=8192&&(n<=8202||8232==n||8233==n||8239==n||8287==n||12288==n||65279==n)}function g(n,t){for(var r=-1,e=n.length,u=-1,i=[];++r<e;)n[r]===t&&(n[r]=D,i[++u]=r);return i}function y(n,t){for(var r,e=-1,u=n.length,i=-1,o=[];++e<u;){var f=n[e],a=t?t(f,e,n):f;e&&r===a||(r=a,o[++i]=f)}return o}function d(n){for(var t=-1,r=n.length;++t<r&&_(n.charCodeAt(t)););return t}function w(n){for(var t=n.length;t--&&_(n.charCodeAt(t)););return t}function m(n){return Pn[n]}function x(_){function G(n){if(v(n)&&!Cf(n)&&!(n instanceof qn)){if(n instanceof nn)return n;if(no.call(n,"__chain__")&&no.call(n,"__wrapped__"))return he(n)}return new nn(n)}function H(){}function nn(n,t,r){this.__wrapped__=n,this.__actions__=r||[],this.__chain__=!!t}function qn(n){this.__wrapped__=n,this.__actions__=[],this.__dir__=1,this.__filtered__=!1,this.__iteratees__=[],this.__takeCount__=Oo,this.__views__=[]}function Mn(){var n=new qn(this.__wrapped__);return n.__actions__=et(this.__actions__),n.__dir__=this.__dir__,n.__filtered__=this.__filtered__,n.__iteratees__=et(this.__iteratees__),n.__takeCount__=this.__takeCount__,n.__views__=et(this.__views__),n}function Pn(){if(this.__filtered__){var n=new qn(this);n.__dir__=-1,n.__filtered__=!0}else n=this.clone(),n.__dir__*=-1;return n}function Kn(){var n=this.__wrapped__.value(),t=this.__dir__,r=Cf(n),e=t<0,u=r?n.length:0,i=Vr(0,u,this.__views__),o=i.start,f=i.end,a=f-o,c=e?f:o-1,l=this.__iteratees__,s=l.length,p=0,h=Ao(a,this.__takeCount__);if(!r||u<T||u==a&&h==a)return er(e&&r?n.reverse():n,this.__actions__);var v=[];n:for(;a--&&p<h;){c+=t;for(var _=-1,g=n[c];++_<s;){var y=l[_],d=y.iteratee,w=y.type,m=d(g);if(w==B)g=m;else if(!m){if(w==L)continue n;break n}}v[p++]=g}return v}function Vn(){this.__data__={}}function Yn(n){return this.has(n)&&delete this.__data__[n]}function Gn(n){return"__proto__"==n?b:this.__data__[n]}function Jn(n){return"__proto__"!=n&&no.call(this.__data__,n)}function Xn(n,t){return"__proto__"!=n&&(this.__data__[n]=t),this}function Zn(n){var t=n?n.length:0;for(this.data={hash:go(null),set:new lo};t--;)this.push(n[t])}function Hn(n,t){var r=n.data,e="string"==typeof t||Wu(t)?r.set.has(t):r.hash[t];return e?0:-1}function Qn(n){var t=this.data;"string"==typeof n||Wu(n)?t.set.add(n):t.hash[n]=!0}function rt(n,t){for(var r=-1,e=n.length,u=-1,i=t.length,o=zi(e+i);++r<e;)o[r]=n[r];for(;++u<i;)o[r++]=t[u];return o}function et(n,t){var r=-1,e=n.length;for(t||(t=zi(e));++r<e;)t[r]=n[r];return t}function ut(n,t){for(var r=-1,e=n.length;++r<e&&t(n[r],r,n)!==!1;);return n}function it(n,t){for(var r=n.length;r--&&t(n[r],r,n)!==!1;);return n}function ot(n,t){for(var r=-1,e=n.length;++r<e;)if(!t(n[r],r,n))return!1;return!0}function ft(n,t,r,e){for(var u=-1,i=n.length,o=e,f=o;++u<i;){var a=n[u],c=+t(a);r(c,o)&&(o=c,f=a)}return f}function at(n,t){for(var r=-1,e=n.length,u=-1,i=[];++r<e;){var o=n[r];t(o,r,n)&&(i[++u]=o)}return i}function ct(n,t){for(var r=-1,e=n.length,u=zi(e);++r<e;)u[r]=t(n[r],r,n);return u}function lt(n,t){for(var r=-1,e=t.length,u=n.length;++r<e;)n[u+r]=t[r];return n}function st(n,t,r,e){var u=-1,i=n.length;for(e&&i&&(r=n[++u]);++u<i;)r=t(r,n[u],u,n);return r}function pt(n,t,r,e){var u=n.length;for(e&&u&&(r=n[--u]);u--;)r=t(r,n[u],u,n);return r}function ht(n,t){for(var r=-1,e=n.length;++r<e;)if(t(n[r],r,n))return!0;return!1}function vt(n,t){for(var r=n.length,e=0;r--;)e+=+t(n[r])||0;return e}function _t(n,t){return n===b?t:n}function gt(n,t,r,e){return n!==b&&no.call(e,r)?n:t}function yt(n,t,r){for(var e=-1,u=Df(t),i=u.length;++e<i;){var o=u[e],f=n[o],a=r(f,t[o],o,n,t);(a===a?a===f:f!==f)&&(f!==b||o in n)||(n[o]=a)}return n}function dt(n,t){return null==t?n:mt(t,Df(t),n)}function wt(n,t){for(var r=-1,e=null==n,u=!e&&Zr(n),i=u?n.length:0,o=t.length,f=zi(o);++r<o;){var a=t[r];u?f[r]=Hr(a,i)?n[a]:b:f[r]=e?b:n[a]}return f}function mt(n,t,r){r||(r={});for(var e=-1,u=t.length;++e<u;){var i=t[e];r[i]=n[i]}return r}function xt(n,t,r){var e=typeof n;return"function"==e?t===b?n:or(n,t,r):null==n?Ri:"object"==e?zt(n):t===b?Si(n):Dt(n,t)}function bt(n,t,r,e,u,i,o){var f;if(r&&(f=u?r(n,e,u):r(n)),f!==b)return f;if(!Wu(n))return n;var a=Cf(n);if(a){if(f=Yr(n),!t)return et(n,f)}else{var c=ro.call(n),l=c==Y;if(c!=X&&c!=q&&(!l||u))return Dn[c]?Jr(n,c,t):u?n:{};if(f=Gr(l?{}:n),!t)return dt(f,n)}i||(i=[]),o||(o=[]);for(var s=i.length;s--;)if(i[s]==n)return o[s];return i.push(n),o.push(f),(a?ut:$t)(n,function(e,u){f[u]=bt(e,t,r,u,n,i,o)}),f}function At(n,t,r){if("function"!=typeof n)throw new Ji(z);return so(function(){n.apply(b,r)},t)}function jt(n,t){var e=n?n.length:0,u=[];if(!e)return u;var i=-1,o=Mr(),f=o==r,a=f&&t.length>=T?_r(t):null,c=t.length;a&&(o=Hn,f=!1,t=a);n:for(;++i<e;){var l=n[i];if(f&&l===l){for(var s=c;s--;)if(t[s]===l)continue n;u.push(l)}else o(t,l,0)<0&&u.push(l)}return u}function kt(n,t){var r=!0;return No(n,function(n,e,u){return r=!!t(n,e,u)}),r}function It(n,t,r,e){var u=e,i=u;return No(n,function(n,o,f){var a=+t(n,o,f);(r(a,u)||a===e&&a===i)&&(u=a,i=n)}),i}function Rt(n,t,r,e){var u=n.length;for(r=null==r?0:+r||0,r<0&&(r=-r>u?0:u+r),e=e===b||e>u?u:+e||0,e<0&&(e+=u),u=r>e?0:e>>>0,r>>>=0;r<u;)n[r++]=t;return n}function Ot(n,t){var r=[];return No(n,function(n,e,u){t(n,e,u)&&r.push(n)}),r}function Et(n,t,r,e){var u;return r(n,function(n,r,i){if(t(n,r,i))return u=e?r:n,!1}),u}function Ct(n,t,r,e){e||(e=[]);for(var u=-1,i=n.length;++u<i;){var o=n[u];v(o)&&Zr(o)&&(r||Cf(o)||ku(o))?t?Ct(o,t,r,e):lt(e,o):r||(e[e.length]=o)}return e}function Ut(n,t){return Lo(n,t,ni)}function $t(n,t){return Lo(n,t,Df)}function St(n,t){return Bo(n,t,Df)}function Wt(n,t){for(var r=-1,e=t.length,u=-1,i=[];++r<e;){var o=t[r];Su(n[o])&&(i[++u]=o)}return i}function Ft(n,t,r){if(null!=n){r!==b&&r in se(n)&&(t=[r]);for(var e=0,u=t.length;null!=n&&e<u;)n=n[t[e++]];return e&&e==u?n:b}}function Nt(n,t,r,e,u,i){return n===t||(null==n||null==t||!Wu(n)&&!v(t)?n!==n&&t!==t:Tt(n,t,Nt,r,e,u,i))}function Tt(n,t,r,e,u,i,o){var f=Cf(n),a=Cf(t),c=M,l=M;f||(c=ro.call(n),c==q?c=X:c!=X&&(f=Mu(n))),a||(l=ro.call(t),l==q?l=X:l!=X&&(a=Mu(t)));var s=c==X,p=l==X,h=c==l;if(h&&!f&&!s)return Br(n,t,c);if(!u){var v=s&&no.call(n,"__wrapped__"),_=p&&no.call(t,"__wrapped__");if(v||_)return r(v?n.value():n,_?t.value():t,e,u,i,o)}if(!h)return!1;i||(i=[]),o||(o=[]);for(var g=i.length;g--;)if(i[g]==n)return o[g]==t;i.push(n),o.push(t);var y=(f?Lr:zr)(n,t,r,e,u,i,o);return i.pop(),o.pop(),y}function Lt(n,t,r){var e=t.length,u=e,i=!r;if(null==n)return!u;for(n=se(n);e--;){var o=t[e];if(i&&o[2]?o[1]!==n[o[0]]:!(o[0]in n))return!1}for(;++e<u;){o=t[e];var f=o[0],a=n[f],c=o[1];if(i&&o[2]){if(a===b&&!(f in n))return!1}else{var l=r?r(a,c,f):b;if(!(l===b?Nt(c,a,r,!0):l))return!1}}return!0}function Bt(n,t){var r=-1,e=Zr(n)?zi(n.length):[];return No(n,function(n,u,i){e[++r]=t(n,u,i)}),e}function zt(n){var t=Pr(n);if(1==t.length&&t[0][2]){var r=t[0][0],e=t[0][1];return function(n){return null!=n&&(n[r]===e&&(e!==b||r in se(n)))}}return function(n){return Lt(n,t)}}function Dt(n,t){var r=Cf(n),e=ne(n)&&ee(t),u=n+"";return n=pe(n),function(i){if(null==i)return!1;var o=u;if(i=se(i),(r||!e)&&!(o in i)){if(i=1==n.length?i:Ft(i,Jt(n,0,-1)),null==i)return!1;o=Ie(n),i=se(i)}return i[o]===t?t!==b||o in i:Nt(t,i[o],b,!0)}}function qt(n,t,r,e,u){if(!Wu(n))return n;var i=Zr(t)&&(Cf(t)||Mu(t)),o=i?b:Df(t);return ut(o||t,function(f,a){if(o&&(a=f,f=t[a]),v(f))e||(e=[]),u||(u=[]),Mt(n,t,a,qt,r,e,u);else{var c=n[a],l=r?r(c,f,a,n,t):b,s=l===b;s&&(l=f),l===b&&(!i||a in n)||!s&&(l===l?l===c:c!==c)||(n[a]=l)}}),n}function Mt(n,t,r,e,u,i,o){for(var f=i.length,a=t[r];f--;)if(i[f]==a)return void(n[r]=o[f]);var c=n[r],l=u?u(c,a,r,n,t):b,s=l===b;s&&(l=a,Zr(a)&&(Cf(a)||Mu(a))?l=Cf(c)?c:Zr(c)?et(c):[]:zu(a)||ku(a)?l=ku(c)?Gu(c):zu(c)?c:{}:s=!1),i.push(a),o.push(l),s?n[r]=e(l,a,u,i,o):(l===l?l!==c:c===c)&&(n[r]=l)}function Pt(n){return function(t){return null==t?b:t[n]}}function Kt(n){var t=n+"";return n=pe(n),function(r){return Ft(r,n,t)}}function Vt(n,t){for(var r=n?t.length:0;r--;){var e=t[r];if(e!=u&&Hr(e)){var u=e;po.call(n,e,1)}}return n}function Yt(n,t){return n+yo(Io()*(t-n+1))}function Gt(n,t,r,e,u){return u(n,function(n,u,i){r=e?(e=!1,n):t(r,n,u,i)}),r}function Jt(n,t,r){var e=-1,u=n.length;t=null==t?0:+t||0,t<0&&(t=-t>u?0:u+t),r=r===b||r>u?u:+r||0,r<0&&(r+=u),u=t>r?0:r-t>>>0,t>>>=0;for(var i=zi(u);++e<u;)i[e]=n[e+t];return i}function Xt(n,t){var r;return No(n,function(n,e,u){return r=t(n,e,u),!r}),!!r}function Zt(n,t){var r=n.length;for(n.sort(t);r--;)n[r]=n[r].value;return n}function Ht(n,t,r){var e=Dr(),u=-1;t=ct(t,function(n){return e(n)});var i=Bt(n,function(n){var r=ct(t,function(t){return t(n)});return{criteria:r,index:++u,value:n}});return Zt(i,function(n,t){return a(n,t,r)})}function Qt(n,t){var r=0;return No(n,function(n,e,u){r+=+t(n,e,u)||0}),r}function nr(n,t){var e=-1,u=Mr(),i=n.length,o=u==r,f=o&&i>=T,a=f?_r():null,c=[];a?(u=Hn,o=!1):(f=!1,a=t?[]:c);n:for(;++e<i;){var l=n[e],s=t?t(l,e,n):l;if(o&&l===l){for(var p=a.length;p--;)if(a[p]===s)continue n;t&&a.push(s),c.push(l)}else u(a,s,0)<0&&((t||f)&&a.push(s),c.push(l))}return c}function tr(n,t){for(var r=-1,e=t.length,u=zi(e);++r<e;)u[r]=n[t[r]];return u}function rr(n,t,r,e){for(var u=n.length,i=e?u:-1;(e?i--:++i<u)&&t(n[i],i,n););return r?Jt(n,e?0:i,e?i+1:u):Jt(n,e?i+1:0,e?u:i)}function er(n,t){var r=n;r instanceof qn&&(r=r.value());for(var e=-1,u=t.length;++e<u;){var i=t[e];r=i.func.apply(i.thisArg,lt([r],i.args))}return r}function ur(n,t,r){var e=0,u=n?n.length:e;if("number"==typeof t&&t===t&&u<=Uo){for(;e<u;){var i=e+u>>>1,o=n[i];(r?o<=t:o<t)&&null!==o?e=i+1:u=i}return u}return ir(n,t,Ri,r)}function ir(n,t,r,e){t=r(t);for(var u=0,i=n?n.length:0,o=t!==t,f=null===t,a=t===b;u<i;){var c=yo((u+i)/2),l=r(n[c]),s=l!==b,p=l===l;if(o)var h=p||e;else h=f?p&&s&&(e||null!=l):a?p&&(e||s):null!=l&&(e?l<=t:l<t);h?u=c+1:i=c}return Ao(i,Co)}function or(n,t,r){if("function"!=typeof n)return Ri;if(t===b)return n;switch(r){case 1:return function(r){return n.call(t,r)};case 3:return function(r,e,u){return n.call(t,r,e,u)};case 4:return function(r,e,u,i){return n.call(t,r,e,u,i)};case 5:return function(r,e,u,i,o){return n.call(t,r,e,u,i,o)}}return function(){return n.apply(t,arguments)}}function fr(n){var t=new io(n.byteLength),r=new ho(t);return r.set(new ho(n)),t}function ar(n,t,r){for(var e=r.length,u=-1,i=bo(n.length-e,0),o=-1,f=t.length,a=zi(f+i);++o<f;)a[o]=t[o];for(;++u<e;)a[r[u]]=n[u];for(;i--;)a[o++]=n[u++];return a}function cr(n,t,r){for(var e=-1,u=r.length,i=-1,o=bo(n.length-u,0),f=-1,a=t.length,c=zi(o+a);++i<o;)c[i]=n[i];for(var l=i;++f<a;)c[l+f]=t[f];for(;++e<u;)c[l+r[e]]=n[i++];return c}function lr(n,t){return function(r,e,u){var i=t?t():{};if(e=Dr(e,u,3),Cf(r))for(var o=-1,f=r.length;++o<f;){var a=r[o];n(i,a,e(a,o,r),r)}else No(r,function(t,r,u){n(i,t,e(t,r,u),u)});return i}}function sr(n){return yu(function(t,r){var e=-1,u=null==t?0:r.length,i=u>2?r[u-2]:b,o=u>2?r[2]:b,f=u>1?r[u-1]:b;for("function"==typeof i?(i=or(i,f,5),u-=2):(i="function"==typeof f?f:b,u-=i?1:0),o&&Qr(r[0],r[1],o)&&(i=u<3?b:i,u=1);++e<u;){var a=r[e];a&&n(t,a,i)}return t})}function pr(n,t){return function(r,e){var u=r?qo(r):0;if(!re(u))return n(r,e);for(var i=t?u:-1,o=se(r);(t?i--:++i<u)&&e(o[i],i,o)!==!1;);return r}}function hr(n){return function(t,r,e){for(var u=se(t),i=e(t),o=i.length,f=n?o:-1;n?f--:++f<o;){var a=i[f];if(r(u[a],a,u)===!1)break}return t}}function vr(n,t){function r(){var u=this&&this!==nt&&this instanceof r?e:n;return u.apply(t,arguments)}var e=yr(n);return r}function _r(n){return go&&lo?new Zn(n):null}function gr(n){return function(t){for(var r=-1,e=ji(li(t)),u=e.length,i="";++r<u;)i=n(i,e[r],r);return i}}function yr(n){return function(){var t=arguments;switch(t.length){case 0:return new n;case 1:return new n(t[0]);case 2:return new n(t[0],t[1]);case 3:return new n(t[0],t[1],t[2]);case 4:return new n(t[0],t[1],t[2],t[3]);case 5:return new n(t[0],t[1],t[2],t[3],t[4]);case 6:return new n(t[0],t[1],t[2],t[3],t[4],t[5]);case 7:return new n(t[0],t[1],t[2],t[3],t[4],t[5],t[6])}var r=Fo(n.prototype),e=n.apply(r,t);return Wu(e)?e:r}}function dr(n){function t(r,e,u){u&&Qr(r,e,u)&&(e=b);var i=Tr(r,n,b,b,b,b,b,e);return i.placeholder=t.placeholder,i}return t}function wr(n,t){return yu(function(r){var e=r[0];return null==e?e:(r.push(t),n.apply(b,r))})}function mr(n,t){return function(r,e,u){if(u&&Qr(r,e,u)&&(e=b),e=Dr(e,u,3),1==e.length){r=Cf(r)?r:le(r);var i=ft(r,e,n,t);if(!r.length||i!==t)return i}return It(r,e,n,t)}}function xr(n,r){return function(e,u,i){if(u=Dr(u,i,3),Cf(e)){var o=t(e,u,r);return o>-1?e[o]:b}return Et(e,u,n)}}function br(n){return function(r,e,u){return r&&r.length?(e=Dr(e,u,3),t(r,e,n)):-1}}function Ar(n){return function(t,r,e){return r=Dr(r,e,3),Et(t,r,n,!0)}}function jr(n){return function(){for(var t,r=arguments.length,e=n?r:-1,u=0,i=zi(r);n?e--:++e<r;){var o=i[u++]=arguments[e];if("function"!=typeof o)throw new Ji(z);!t&&nn.prototype.thru&&"wrapper"==qr(o)&&(t=new nn([],!0))}for(e=t?-1:r;++e<r;){o=i[e];var f=qr(o),a="wrapper"==f?Do(o):b;t=a&&te(a[0])&&a[1]==(U|R|E|$)&&!a[4].length&&1==a[9]?t[qr(a[0])].apply(t,a[3]):1==o.length&&te(o)?t[f]():t.thru(o)}return function(){var n=arguments,e=n[0];if(t&&1==n.length&&Cf(e)&&e.length>=T)return t.plant(e).value();for(var u=0,o=r?i[u].apply(this,n):e;++u<r;)o=i[u].call(this,o);return o}}}function kr(n,t){return function(r,e,u){return"function"==typeof e&&u===b&&Cf(r)?n(r,e):t(r,or(e,u,3))}}function Ir(n){return function(t,r,e){return"function"==typeof r&&e===b||(r=or(r,e,3)),n(t,r,ni)}}function Rr(n){return function(t,r,e){return"function"==typeof r&&e===b||(r=or(r,e,3)),n(t,r)}}function Or(n){return function(t,r,e){var u={};return r=Dr(r,e,3),$t(t,function(t,e,i){var o=r(t,e,i);e=n?o:e,t=n?t:o,u[e]=t}),u}}function Er(n){return function(t,r,e){return t=u(t),(n?t:"")+Sr(t,r,e)+(n?"":t)}}function Cr(n){var t=yu(function(r,e){var u=g(e,t.placeholder);return Tr(r,n,b,e,u)});return t}function Ur(n,t){return function(r,e,u,i){var o=arguments.length<3;return"function"==typeof e&&i===b&&Cf(r)?n(r,e,u,o):Gt(r,Dr(e,i,4),u,o,t)}}function $r(n,t,r,e,u,i,o,f,a,c){function l(){for(var w=arguments.length,m=w,x=zi(w);m--;)x[m]=arguments[m];if(e&&(x=ar(x,e,u)),i&&(x=cr(x,i,o)),v||y){var A=l.placeholder,I=g(x,A);if(w-=I.length,w<c){var R=f?et(f):b,O=bo(c-w,0),U=v?I:b,$=v?b:I,S=v?x:b,W=v?b:x;t|=v?E:C,t&=~(v?C:E),_||(t&=~(j|k));var F=[n,t,r,S,U,W,$,R,a,O],N=$r.apply(b,F);return te(n)&&Mo(N,F),N.placeholder=A,N}}var T=p?r:this,L=h?T[n]:n;return f&&(x=ae(x,f)),s&&a<x.length&&(x.length=a),this&&this!==nt&&this instanceof l&&(L=d||yr(n)),L.apply(T,x)}var s=t&U,p=t&j,h=t&k,v=t&R,_=t&I,y=t&O,d=h?b:yr(n);return l}function Sr(n,t,r){var e=n.length;if(t=+t,e>=t||!mo(t))return"";var u=t-e;return r=null==r?" ":r+"",gi(r,_o(u/r.length)).slice(0,u)}function Wr(n,t,r,e){function u(){for(var t=-1,f=arguments.length,a=-1,c=e.length,l=zi(c+f);++a<c;)l[a]=e[a];for(;f--;)l[a++]=arguments[++t];var s=this&&this!==nt&&this instanceof u?o:n;return s.apply(i?r:this,l)}var i=t&j,o=yr(n);return u}function Fr(n){var t=Pi[n];return function(n,r){return r=r===b?0:+r||0,r?(r=ao(10,r),t(n*r)/r):t(n)}}function Nr(n){return function(t,r,e,u){var i=Dr(e);return null==e&&i===xt?ur(t,r,n):ir(t,r,i(e,u,1),n)}}function Tr(n,t,r,e,u,i,o,f){var a=t&k;if(!a&&"function"!=typeof n)throw new Ji(z);var c=e?e.length:0;if(c||(t&=~(E|C),e=u=b),c-=u?u.length:0,t&C){var l=e,s=u;e=u=b}var p=a?b:Do(n),h=[n,t,r,e,u,l,s,i,o,f];if(p&&(ue(h,p),t=h[1],f=h[9]),h[9]=null==f?a?0:n.length:bo(f-c,0)||0,t==j)var v=vr(h[0],h[2]);else v=t!=E&&t!=(j|E)||h[4].length?$r.apply(b,h):Wr.apply(b,h);var _=p?zo:Mo;return _(v,h)}function Lr(n,t,r,e,u,i,o){var f=-1,a=n.length,c=t.length;if(a!=c&&!(u&&c>a))return!1;for(;++f<a;){var l=n[f],s=t[f],p=e?e(u?s:l,u?l:s,f):b;if(p!==b){if(p)continue;return!1}if(u){if(!ht(t,function(n){return l===n||r(l,n,e,u,i,o)}))return!1}else if(l!==s&&!r(l,s,e,u,i,o))return!1}return!0}function Br(n,t,r){switch(r){case P:case K:return+n==+t;case V:return n.name==t.name&&n.message==t.message;case J:return n!=+n?t!=+t:n==+t;case Z:case Q:return n==t+""}return!1}function zr(n,t,r,e,u,i,o){var f=Df(n),a=f.length,c=Df(t),l=c.length;if(a!=l&&!u)return!1;for(var s=a;s--;){var p=f[s];if(!(u?p in t:no.call(t,p)))return!1}for(var h=u;++s<a;){p=f[s];var v=n[p],_=t[p],g=e?e(u?_:v,u?v:_,p):b;if(!(g===b?r(v,_,e,u,i,o):g))return!1;h||(h="constructor"==p)}if(!h){var y=n.constructor,d=t.constructor;if(y!=d&&"constructor"in n&&"constructor"in t&&!("function"==typeof y&&y instanceof y&&"function"==typeof d&&d instanceof d))return!1}return!0}function Dr(n,t,r){var e=G.callback||ki;return e=e===ki?xt:e,r?e(n,t,r):e}function qr(n){for(var t=n.name,r=Wo[t],e=r?r.length:0;e--;){var u=r[e],i=u.func;if(null==i||i==n)return u.name}return t}function Mr(n,t,e){var u=G.indexOf||je;return u=u===je?r:u,n?u(n,t,e):u}function Pr(n){for(var t=ti(n),r=t.length;r--;)t[r][2]=ee(t[r][1]);return t}function Kr(n,t){var r=null==n?b:n[t];return Tu(r)?r:b}function Vr(n,t,r){for(var e=-1,u=r.length;++e<u;){var i=r[e],o=i.size;switch(i.type){case"drop":n+=o;break;case"dropRight":t-=o;break;case"take":t=Ao(t,n+o);break;case"takeRight":n=bo(n,t-o)}}return{start:n,end:t}}function Yr(n){var t=n.length,r=new n.constructor(t);return t&&"string"==typeof n[0]&&no.call(n,"index")&&(r.index=n.index,r.input=n.input),r}function Gr(n){var t=n.constructor;return"function"==typeof t&&t instanceof t||(t=Vi),new t}function Jr(n,t,r){var e=n.constructor;switch(t){case tn:return fr(n);case P:case K:return new e(+n);case rn:case en:case un:case on:case fn:case an:case cn:case ln:case sn:var u=n.buffer;return new e(r?fr(u):u,n.byteOffset,n.length);case J:case Q:return new e(n);case Z:var i=new e(n.source,Cn.exec(n));i.lastIndex=n.lastIndex}return i}function Xr(n,t,r){null==n||ne(t,n)||(t=pe(t),n=1==t.length?n:Ft(n,Jt(t,0,-1)),t=Ie(t));var e=null==n?n:n[t];return null==e?b:e.apply(n,r)}function Zr(n){return null!=n&&re(qo(n))}function Hr(n,t){return n="number"==typeof n||Sn.test(n)?+n:-1,t=null==t?$o:t,n>-1&&n%1==0&&n<t}function Qr(n,t,r){if(!Wu(r))return!1;var e=typeof t;if("number"==e?Zr(r)&&Hr(t,r.length):"string"==e&&t in r){var u=r[t];return n===n?n===u:u!==u}return!1}function ne(n,t){var r=typeof n;if("string"==r&&An.test(n)||"number"==r)return!0;if(Cf(n))return!1;var e=!bn.test(n);return e||null!=t&&n in se(t)}function te(n){var t=qr(n);if(!(t in qn.prototype))return!1;var r=G[t];if(n===r)return!0;var e=Do(r);return!!e&&n===e[0]}function re(n){return"number"==typeof n&&n>-1&&n%1==0&&n<=$o}function ee(n){return n===n&&!Wu(n)}function ue(n,t){var r=n[1],e=t[1],u=r|e,i=u<U,o=e==U&&r==R||e==U&&r==$&&n[7].length<=t[8]||e==(U|$)&&r==R;if(!i&&!o)return n;e&j&&(n[2]=t[2],u|=r&j?0:I);var f=t[3];if(f){var a=n[3];n[3]=a?ar(a,f,t[4]):et(f),n[4]=a?g(n[3],D):et(t[4])}return f=t[5],f&&(a=n[5],n[5]=a?cr(a,f,t[6]):et(f),n[6]=a?g(n[5],D):et(t[6])),f=t[7],f&&(n[7]=et(f)),e&U&&(n[8]=null==n[8]?t[8]:Ao(n[8],t[8])),null==n[9]&&(n[9]=t[9]),n[0]=t[0],n[1]=u,n}function ie(n,t){return n===b?t:Uf(n,t,ie)}function oe(n,t){n=se(n);for(var r=-1,e=t.length,u={};++r<e;){var i=t[r];i in n&&(u[i]=n[i])}return u}function fe(n,t){var r={};return Ut(n,function(n,e,u){t(n,e,u)&&(r[e]=n)}),r}function ae(n,t){for(var r=n.length,e=Ao(t.length,r),u=et(n);e--;){var i=t[e];n[e]=Hr(i,r)?u[i]:b}return n}function ce(n){for(var t=ni(n),r=t.length,e=r&&n.length,u=!!e&&re(e)&&(Cf(n)||ku(n)),i=-1,o=[];++i<r;){var f=t[i];(u&&Hr(f,e)||no.call(n,f))&&o.push(f)}return o}function le(n){return null==n?[]:Zr(n)?Wu(n)?n:Vi(n):ii(n)}function se(n){return Wu(n)?n:Vi(n)}function pe(n){if(Cf(n))return n;var t=[];return u(n).replace(jn,function(n,r,e,u){t.push(e?u.replace(On,"$1"):r||n)}),t}function he(n){return n instanceof qn?n.clone():new nn(n.__wrapped__,n.__chain__,et(n.__actions__))}function ve(n,t,r){t=(r?Qr(n,t,r):null==t)?1:bo(yo(t)||1,1);for(var e=0,u=n?n.length:0,i=-1,o=zi(_o(u/t));e<u;)o[++i]=Jt(n,e,e+=t);return o}function _e(n){for(var t=-1,r=n?n.length:0,e=-1,u=[];++t<r;){var i=n[t];i&&(u[++e]=i)}return u}function ge(n,t,r){var e=n?n.length:0;return e?((r?Qr(n,t,r):null==t)&&(t=1),Jt(n,t<0?0:t)):[]}function ye(n,t,r){var e=n?n.length:0;return e?((r?Qr(n,t,r):null==t)&&(t=1),t=e-(+t||0),Jt(n,0,t<0?0:t)):[]}function de(n,t,r){return n&&n.length?rr(n,Dr(t,r,3),!0,!0):[]}function we(n,t,r){return n&&n.length?rr(n,Dr(t,r,3),!0):[]}function me(n,t,r,e){var u=n?n.length:0;return u?(r&&"number"!=typeof r&&Qr(n,t,r)&&(r=0,e=u),Rt(n,t,r,e)):[]}function xe(n){return n?n[0]:b}function be(n,t,r){var e=n?n.length:0;return r&&Qr(n,t,r)&&(t=!1),e?Ct(n,t):[]}function Ae(n){var t=n?n.length:0;return t?Ct(n,!0):[]}function je(n,t,e){var u=n?n.length:0;if(!u)return-1;if("number"==typeof e)e=e<0?bo(u+e,0):e;else if(e){var i=ur(n,t);return i<u&&(t===t?t===n[i]:n[i]!==n[i])?i:-1}return r(n,t,e||0)}function ke(n){return ye(n,1)}function Ie(n){var t=n?n.length:0;return t?n[t-1]:b}function Re(n,t,r){var e=n?n.length:0;if(!e)return-1;var u=e;if("number"==typeof r)u=(r<0?bo(e+r,0):Ao(r||0,e-1))+1;else if(r){u=ur(n,t,!0)-1;var i=n[u];return(t===t?t===i:i!==i)?u:-1}if(t!==t)return h(n,u,!0);for(;u--;)if(n[u]===t)return u;return-1}function Oe(){var n=arguments,t=n[0];if(!t||!t.length)return t;for(var r=0,e=Mr(),u=n.length;++r<u;)for(var i=0,o=n[r];(i=e(t,o,i))>-1;)po.call(t,i,1);return t}function Ee(n,t,r){var e=[];if(!n||!n.length)return e;var u=-1,i=[],o=n.length;for(t=Dr(t,r,3);++u<o;){var f=n[u];t(f,u,n)&&(e.push(f),i.push(u))}return Vt(n,i),e}function Ce(n){return ge(n,1)}function Ue(n,t,r){var e=n?n.length:0;return e?(r&&"number"!=typeof r&&Qr(n,t,r)&&(t=0,r=e),Jt(n,t,r)):[]}function $e(n,t,r){var e=n?n.length:0;return e?((r?Qr(n,t,r):null==t)&&(t=1),Jt(n,0,t<0?0:t)):[]}function Se(n,t,r){var e=n?n.length:0;return e?((r?Qr(n,t,r):null==t)&&(t=1),t=e-(+t||0),Jt(n,t<0?0:t)):[]}function We(n,t,r){return n&&n.length?rr(n,Dr(t,r,3),!1,!0):[]}function Fe(n,t,r){return n&&n.length?rr(n,Dr(t,r,3)):[]}function Ne(n,t,e,u){var i=n?n.length:0;if(!i)return[];null!=t&&"boolean"!=typeof t&&(u=e,e=Qr(n,t,u)?b:t,t=!1);var o=Dr();return null==e&&o===xt||(e=o(e,u,3)),t&&Mr()==r?y(n,e):nr(n,e)}function Te(n){if(!n||!n.length)return[];var t=-1,r=0;n=at(n,function(n){if(Zr(n))return r=bo(n.length,r),!0});for(var e=zi(r);++t<r;)e[t]=ct(n,Pt(t));return e}function Le(n,t,r){var e=n?n.length:0;if(!e)return[];var u=Te(n);return null==t?u:(t=or(t,r,4),ct(u,function(n){return st(n,t,b,!0)}))}function Be(){for(var n=-1,t=arguments.length;++n<t;){var r=arguments[n];if(Zr(r))var e=e?lt(jt(e,r),jt(r,e)):r}return e?nr(e):[]}function ze(n,t){var r=-1,e=n?n.length:0,u={};for(!e||t||Cf(n[0])||(t=[]);++r<e;){var i=n[r];t?u[i]=t[r]:i&&(u[i[0]]=i[1])}return u}function De(n){var t=G(n);return t.__chain__=!0,t}function qe(n,t,r){return t.call(r,n),n}function Me(n,t,r){return t.call(r,n)}function Pe(){return De(this)}function Ke(){return new nn(this.value(),this.__chain__)}function Ve(n){for(var t,r=this;r instanceof H;){var e=he(r);t?u.__wrapped__=e:t=e;var u=e;r=r.__wrapped__}return u.__wrapped__=n,t}function Ye(){var n=this.__wrapped__,t=function(n){return r&&r.__dir__<0?n:n.reverse()};if(n instanceof qn){var r=n;return this.__actions__.length&&(r=new qn(this)),r=r.reverse(),r.__actions__.push({func:Me,args:[t],thisArg:b}),new nn(r,this.__chain__)}return this.thru(t)}function Ge(){return this.value()+""}function Je(){return er(this.__wrapped__,this.__actions__)}function Xe(n,t,r){var e=Cf(n)?ot:kt;return r&&Qr(n,t,r)&&(t=b),"function"==typeof t&&r===b||(t=Dr(t,r,3)),e(n,t)}function Ze(n,t,r){var e=Cf(n)?at:Ot;return t=Dr(t,r,3),e(n,t)}function He(n,t){return uf(n,zt(t))}function Qe(n,t,r,e){var u=n?qo(n):0;return re(u)||(n=ii(n),u=n.length),r="number"!=typeof r||e&&Qr(t,r,e)?0:r<0?bo(u+r,0):r||0,"string"==typeof n||!Cf(n)&&qu(n)?r<=u&&n.indexOf(t,r)>-1:!!u&&Mr(n,t,r)>-1}function nu(n,t,r){var e=Cf(n)?ct:Bt;return t=Dr(t,r,3),e(n,t)}function tu(n,t){return nu(n,Si(t))}function ru(n,t,r){var e=Cf(n)?at:Ot;return t=Dr(t,r,3),e(n,function(n,r,e){return!t(n,r,e)})}function eu(n,t,r){if(r?Qr(n,t,r):null==t){n=le(n);var e=n.length;return e>0?n[Yt(0,e-1)]:b}var u=-1,i=Yu(n),e=i.length,o=e-1;for(t=Ao(t<0?0:+t||0,e);++u<t;){var f=Yt(u,o),a=i[f];i[f]=i[u],i[u]=a}return i.length=t,i}function uu(n){return eu(n,Oo)}function iu(n){var t=n?qo(n):0;return re(t)?t:Df(n).length}function ou(n,t,r){var e=Cf(n)?ht:Xt;return r&&Qr(n,t,r)&&(t=b),"function"==typeof t&&r===b||(t=Dr(t,r,3)),e(n,t)}function fu(n,t,r){if(null==n)return[];r&&Qr(n,t,r)&&(t=b);var e=-1;t=Dr(t,r,3);var u=Bt(n,function(n,r,u){return{criteria:t(n,r,u),index:++e,value:n}});return Zt(u,f)}function au(n,t,r,e){return null==n?[]:(e&&Qr(t,r,e)&&(r=b),Cf(t)||(t=null==t?[]:[t]),Cf(r)||(r=null==r?[]:[r]),Ht(n,t,r))}function cu(n,t){return Ze(n,zt(t))}function lu(n,t){if("function"!=typeof t){if("function"!=typeof n)throw new Ji(z);var r=n;n=t,t=r}return n=mo(n=+n)?n:0,function(){if(--n<1)return t.apply(this,arguments)}}function su(n,t,r){return r&&Qr(n,t,r)&&(t=b),t=n&&null==t?n.length:bo(+t||0,0),Tr(n,U,b,b,b,b,t)}function pu(n,t){var r;if("function"!=typeof t){if("function"!=typeof n)throw new Ji(z);var e=n;n=t,t=e}return function(){return--n>0&&(r=t.apply(this,arguments)),n<=1&&(t=b),r}}function hu(n,t,r){function e(){h&&oo(h),c&&oo(c),_=0,c=h=v=b}function u(t,r){r&&oo(r),c=h=v=b,t&&(_=gf(),l=n.apply(p,a),h||c||(a=p=b))}function i(){var n=t-(gf()-s);n<=0||n>t?u(v,c):h=so(i,n)}function o(){u(y,h)}function f(){if(a=arguments,s=gf(),p=this,v=y&&(h||!d),g===!1)var r=d&&!h;else{c||d||(_=s);var e=g-(s-_),u=e<=0||e>g;u?(c&&(c=oo(c)),_=s,l=n.apply(p,a)):c||(c=so(o,e))}return u&&h?h=oo(h):h||t===g||(h=so(i,t)),r&&(u=!0,l=n.apply(p,a)),!u||h||c||(a=p=b),l}var a,c,l,s,p,h,v,_=0,g=!1,y=!0;if("function"!=typeof n)throw new Ji(z);if(t=t<0?0:+t||0,r===!0){var d=!0;y=!1}else Wu(r)&&(d=!!r.leading,g="maxWait"in r&&bo(+r.maxWait||0,t),y="trailing"in r?!!r.trailing:y);return f.cancel=e,f}function vu(n,t){if("function"!=typeof n||t&&"function"!=typeof t)throw new Ji(z);var r=function(){var e=arguments,u=t?t.apply(this,e):e[0],i=r.cache;if(i.has(u))return i.get(u);var o=n.apply(this,e);return r.cache=i.set(u,o),o};return r.cache=new vu.Cache,r}function _u(n){if("function"!=typeof n)throw new Ji(z);return function(){return!n.apply(this,arguments)}}function gu(n){return pu(2,n)}function yu(n,t){if("function"!=typeof n)throw new Ji(z);return t=bo(t===b?n.length-1:+t||0,0),function(){for(var r=arguments,e=-1,u=bo(r.length-t,0),i=zi(u);++e<u;)i[e]=r[t+e];switch(t){case 0:return n.call(this,i);case 1:return n.call(this,r[0],i);case 2:return n.call(this,r[0],r[1],i)}var o=zi(t+1);for(e=-1;++e<t;)o[e]=r[e];return o[t]=i,n.apply(this,o)}}function du(n){if("function"!=typeof n)throw new Ji(z);return function(t){return n.apply(this,t)}}function wu(n,t,r){var e=!0,u=!0;if("function"!=typeof n)throw new Ji(z);return r===!1?e=!1:Wu(r)&&(e="leading"in r?!!r.leading:e,u="trailing"in r?!!r.trailing:u),hu(n,t,{leading:e,maxWait:+t,trailing:u})}function mu(n,t){return t=null==t?Ri:t,Tr(t,E,b,[n],[])}function xu(n,t,r,e){return t&&"boolean"!=typeof t&&Qr(n,t,r)?t=!1:"function"==typeof t&&(e=r,r=t,t=!1),"function"==typeof r?bt(n,t,or(r,e,1)):bt(n,t)}function bu(n,t,r){return"function"==typeof t?bt(n,!0,or(t,r,1)):bt(n,!0)}function Au(n,t){return n>t}function ju(n,t){return n>=t}function ku(n){return v(n)&&Zr(n)&&no.call(n,"callee")&&!co.call(n,"callee")}function Iu(n){return n===!0||n===!1||v(n)&&ro.call(n)==P}function Ru(n){return v(n)&&ro.call(n)==K}function Ou(n){return!!n&&1===n.nodeType&&v(n)&&!zu(n)}function Eu(n){return null==n||(Zr(n)&&(Cf(n)||qu(n)||ku(n)||v(n)&&Su(n.splice))?!n.length:!Df(n).length)}function Cu(n,t,r,e){r="function"==typeof r?or(r,e,3):b;var u=r?r(n,t):b;return u===b?Nt(n,t,r):!!u}function Uu(n){return v(n)&&"string"==typeof n.message&&ro.call(n)==V}function $u(n){return"number"==typeof n&&mo(n)}function Su(n){return Wu(n)&&ro.call(n)==Y}function Wu(n){var t=typeof n;return!!n&&("object"==t||"function"==t)}function Fu(n,t,r,e){return r="function"==typeof r?or(r,e,3):b,Lt(n,Pr(t),r)}function Nu(n){return Bu(n)&&n!=+n}function Tu(n){return null!=n&&(Su(n)?uo.test(Qi.call(n)):v(n)&&$n.test(n))}function Lu(n){return null===n}function Bu(n){return"number"==typeof n||v(n)&&ro.call(n)==J}function zu(n){var t;if(!v(n)||ro.call(n)!=X||ku(n)||!no.call(n,"constructor")&&(t=n.constructor,"function"==typeof t&&!(t instanceof t)))return!1;var r;return Ut(n,function(n,t){r=t}),r===b||no.call(n,r)}function Du(n){return Wu(n)&&ro.call(n)==Z}function qu(n){return"string"==typeof n||v(n)&&ro.call(n)==Q}function Mu(n){return v(n)&&re(n.length)&&!!zn[ro.call(n)]}function Pu(n){return n===b}function Ku(n,t){return n<t}function Vu(n,t){return n<=t}function Yu(n){var t=n?qo(n):0;return re(t)?t?et(n):[]:ii(n)}function Gu(n){return mt(n,ni(n))}function Ju(n,t,r){var e=Fo(n);return r&&Qr(n,t,r)&&(t=b),t?dt(e,t):e}function Xu(n){return Wt(n,ni(n))}function Zu(n,t,r){var e=null==n?b:Ft(n,pe(t),t+"");return e===b?r:e}function Hu(n,t){if(null==n)return!1;var r=no.call(n,t);if(!r&&!ne(t)){if(t=pe(t),n=1==t.length?n:Ft(n,Jt(t,0,-1)),null==n)return!1;t=Ie(t),r=no.call(n,t)}return r||re(n.length)&&Hr(t,n.length)&&(Cf(n)||ku(n))}function Qu(n,t,r){r&&Qr(n,t,r)&&(t=b);for(var e=-1,u=Df(n),i=u.length,o={};++e<i;){var f=u[e],a=n[f];t?no.call(o,a)?o[a].push(f):o[a]=[f]:o[a]=f}return o}function ni(n){if(null==n)return[];Wu(n)||(n=Vi(n));var t=n.length;t=t&&re(t)&&(Cf(n)||ku(n))&&t||0;for(var r=n.constructor,e=-1,u="function"==typeof r&&r.prototype===n,i=zi(t),o=t>0;++e<t;)i[e]=e+"";for(var f in n)o&&Hr(f,t)||"constructor"==f&&(u||!no.call(n,f))||i.push(f);return i}function ti(n){n=se(n);for(var t=-1,r=Df(n),e=r.length,u=zi(e);++t<e;){var i=r[t];u[t]=[i,n[i]]}return u}function ri(n,t,r){var e=null==n?b:n[t];return e===b&&(null==n||ne(t,n)||(t=pe(t),n=1==t.length?n:Ft(n,Jt(t,0,-1)),e=null==n?b:n[Ie(t)]),e=e===b?r:e),Su(e)?e.call(n):e}function ei(n,t,r){if(null==n)return n;var e=t+"";t=null!=n[e]||ne(t,n)?[e]:pe(t);for(var u=-1,i=t.length,o=i-1,f=n;null!=f&&++u<i;){var a=t[u];Wu(f)&&(u==o?f[a]=r:null==f[a]&&(f[a]=Hr(t[u+1])?[]:{})),f=f[a]}return n}function ui(n,t,r,e){var u=Cf(n)||Mu(n);if(t=Dr(t,e,4),null==r)if(u||Wu(n)){var i=n.constructor;r=u?Cf(n)?new i:[]:Fo(Su(i)?i.prototype:b)}else r={};return(u?ut:$t)(n,function(n,e,u){return t(r,n,e,u)}),r}function ii(n){return tr(n,Df(n))}function oi(n){return tr(n,ni(n))}function fi(n,t,r){return t=+t||0,r===b?(r=t,t=0):r=+r||0,n>=Ao(t,r)&&n<bo(t,r)}function ai(n,t,r){r&&Qr(n,t,r)&&(t=r=b);var e=null==n,u=null==t;if(null==r&&(u&&"boolean"==typeof n?(r=n,n=1):"boolean"==typeof t&&(r=t,u=!0)),e&&u&&(t=1,u=!1),n=+n||0,u?(t=n,n=0):t=+t||0,r||n%1||t%1){var i=Io();return Ao(n+i*(t-n+fo("1e-"+((i+"").length-1))),t)}return Yt(n,t)}function ci(n){return n=u(n),n&&n.charAt(0).toUpperCase()+n.slice(1)}function li(n){return n=u(n),n&&n.replace(Wn,c).replace(Rn,"");
-}function si(n,t,r){n=u(n),t+="";var e=n.length;return r=r===b?e:Ao(r<0?0:+r||0,e),r-=t.length,r>=0&&n.indexOf(t,r)==r}function pi(n){return n=u(n),n&&dn.test(n)?n.replace(gn,l):n}function hi(n){return n=u(n),n&&In.test(n)?n.replace(kn,s):n||"(?:)"}function vi(n,t,r){n=u(n),t=+t;var e=n.length;if(e>=t||!mo(t))return n;var i=(t-e)/2,o=yo(i),f=_o(i);return r=Sr("",f,r),r.slice(0,o)+n+r}function _i(n,t,r){return(r?Qr(n,t,r):null==t)?t=0:t&&(t=+t),n=wi(n),ko(n,t||(Un.test(n)?16:10))}function gi(n,t){var r="";if(n=u(n),t=+t,t<1||!n||!mo(t))return r;do t%2&&(r+=n),t=yo(t/2),n+=n;while(t);return r}function yi(n,t,r){return n=u(n),r=null==r?0:Ao(r<0?0:+r||0,n.length),n.lastIndexOf(t,r)==r}function di(n,t,r){var e=G.templateSettings;r&&Qr(n,t,r)&&(t=r=b),n=u(n),t=yt(dt({},r||t),e,gt);var i,o,f=yt(dt({},t.imports),e.imports,gt),a=Df(f),c=tr(f,a),l=0,s=t.interpolate||Fn,h="__p += '",v=Yi((t.escape||Fn).source+"|"+s.source+"|"+(s===xn?En:Fn).source+"|"+(t.evaluate||Fn).source+"|$","g"),_="//# sourceURL="+("sourceURL"in t?t.sourceURL:"lodash.templateSources["+ ++Bn+"]")+"\n";n.replace(v,function(t,r,e,u,f,a){return e||(e=u),h+=n.slice(l,a).replace(Nn,p),r&&(i=!0,h+="' +\n__e("+r+") +\n'"),f&&(o=!0,h+="';\n"+f+";\n__p += '"),e&&(h+="' +\n((__t = ("+e+")) == null ? '' : __t) +\n'"),l=a+t.length,t}),h+="';\n";var g=t.variable;g||(h="with (obj) {\n"+h+"\n}\n"),h=(o?h.replace(pn,""):h).replace(hn,"$1").replace(vn,"$1;"),h="function("+(g||"obj")+") {\n"+(g?"":"obj || (obj = {});\n")+"var __t, __p = ''"+(i?", __e = _.escape":"")+(o?", __j = Array.prototype.join;\nfunction print() { __p += __j.call(arguments, '') }\n":";\n")+h+"return __p\n}";var y=Hf(function(){return Mi(a,_+"return "+h).apply(b,c)});if(y.source=h,Uu(y))throw y;return y}function wi(n,t,r){var e=n;return(n=u(n))?(r?Qr(e,t,r):null==t)?n.slice(d(n),w(n)+1):(t+="",n.slice(i(n,t),o(n,t)+1)):n}function mi(n,t,r){var e=n;return n=u(n),n?(r?Qr(e,t,r):null==t)?n.slice(d(n)):n.slice(i(n,t+"")):n}function xi(n,t,r){var e=n;return n=u(n),n?(r?Qr(e,t,r):null==t)?n.slice(0,w(n)+1):n.slice(0,o(n,t+"")+1):n}function bi(n,t,r){r&&Qr(n,t,r)&&(t=b);var e=S,i=W;if(null!=t)if(Wu(t)){var o="separator"in t?t.separator:o;e="length"in t?+t.length||0:e,i="omission"in t?u(t.omission):i}else e=+t||0;if(n=u(n),e>=n.length)return n;var f=e-i.length;if(f<1)return i;var a=n.slice(0,f);if(null==o)return a+i;if(Du(o)){if(n.slice(f).search(o)){var c,l,s=n.slice(0,f);for(o.global||(o=Yi(o.source,(Cn.exec(o)||"")+"g")),o.lastIndex=0;c=o.exec(s);)l=c.index;a=a.slice(0,null==l?f:l)}}else if(n.indexOf(o,f)!=f){var p=a.lastIndexOf(o);p>-1&&(a=a.slice(0,p))}return a+i}function Ai(n){return n=u(n),n&&yn.test(n)?n.replace(_n,m):n}function ji(n,t,r){return r&&Qr(n,t,r)&&(t=b),n=u(n),n.match(t||Tn)||[]}function ki(n,t,r){return r&&Qr(n,t,r)&&(t=b),v(n)?Oi(n):xt(n,t)}function Ii(n){return function(){return n}}function Ri(n){return n}function Oi(n){return zt(bt(n,!0))}function Ei(n,t){return Dt(n,bt(t,!0))}function Ci(n,t,r){if(null==r){var e=Wu(t),u=e?Df(t):b,i=u&&u.length?Wt(t,u):b;(i?i.length:e)||(i=!1,r=t,t=n,n=this)}i||(i=Wt(t,Df(t)));var o=!0,f=-1,a=Su(n),c=i.length;r===!1?o=!1:Wu(r)&&"chain"in r&&(o=r.chain);for(;++f<c;){var l=i[f],s=t[l];n[l]=s,a&&(n.prototype[l]=function(t){return function(){var r=this.__chain__;if(o||r){var e=n(this.__wrapped__),u=e.__actions__=et(this.__actions__);return u.push({func:t,args:arguments,thisArg:n}),e.__chain__=r,e}return t.apply(n,lt([this.value()],arguments))}}(s))}return n}function Ui(){return nt._=eo,this}function $i(){}function Si(n){return ne(n)?Pt(n):Kt(n)}function Wi(n){return function(t){return Ft(n,pe(t),t+"")}}function Fi(n,t,r){r&&Qr(n,t,r)&&(t=r=b),n=+n||0,r=null==r?1:+r||0,null==t?(t=n,n=0):t=+t||0;for(var e=-1,u=bo(_o((t-n)/(r||1)),0),i=zi(u);++e<u;)i[e]=n,n+=r;return i}function Ni(n,t,r){if(n=yo(n),n<1||!mo(n))return[];var e=-1,u=zi(Ao(n,Eo));for(t=or(t,r,1);++e<n;)e<Eo?u[e]=t(e):t(e);return u}function Ti(n){var t=++to;return u(n)+t}function Li(n,t){return(+n||0)+(+t||0)}function Bi(n,t,r){return r&&Qr(n,t,r)&&(t=b),t=Dr(t,r,3),1==t.length?vt(Cf(n)?n:le(n),t):Qt(n,t)}_=_?tt.defaults(nt.Object(),_,tt.pick(nt,Ln)):nt;var zi=_.Array,Di=_.Date,qi=_.Error,Mi=_.Function,Pi=_.Math,Ki=_.Number,Vi=_.Object,Yi=_.RegExp,Gi=_.String,Ji=_.TypeError,Xi=zi.prototype,Zi=Vi.prototype,Hi=Gi.prototype,Qi=Mi.prototype.toString,no=Zi.hasOwnProperty,to=0,ro=Zi.toString,eo=nt._,uo=Yi("^"+Qi.call(no).replace(/[\\^$.*+?()[\]{}|]/g,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$"),io=_.ArrayBuffer,oo=_.clearTimeout,fo=_.parseFloat,ao=Pi.pow,co=Zi.propertyIsEnumerable,lo=Kr(_,"Set"),so=_.setTimeout,po=Xi.splice,ho=_.Uint8Array,vo=Kr(_,"WeakMap"),_o=Pi.ceil,go=Kr(Vi,"create"),yo=Pi.floor,wo=Kr(zi,"isArray"),mo=_.isFinite,xo=Kr(Vi,"keys"),bo=Pi.max,Ao=Pi.min,jo=Kr(Di,"now"),ko=_.parseInt,Io=Pi.random,Ro=Ki.NEGATIVE_INFINITY,Oo=Ki.POSITIVE_INFINITY,Eo=4294967295,Co=Eo-1,Uo=Eo>>>1,$o=9007199254740991,So=vo&&new vo,Wo={};G.support={};G.templateSettings={escape:wn,evaluate:mn,interpolate:xn,variable:"",imports:{_:G}};var Fo=function(){function n(){}return function(t){if(Wu(t)){n.prototype=t;var r=new n;n.prototype=b}return r||{}}}(),No=pr($t),To=pr(St,!0),Lo=hr(),Bo=hr(!0),zo=So?function(n,t){return So.set(n,t),n}:Ri,Do=So?function(n){return So.get(n)}:$i,qo=Pt("length"),Mo=function(){var n=0,t=0;return function(r,e){var u=gf(),i=N-(u-t);if(t=u,i>0){if(++n>=F)return r}else n=0;return zo(r,e)}}(),Po=yu(function(n,t){return v(n)&&Zr(n)?jt(n,Ct(t,!1,!0)):[]}),Ko=br(),Vo=br(!0),Yo=yu(function(n){for(var t=n.length,e=t,u=zi(s),i=Mr(),o=i==r,f=[];e--;){var a=n[e]=Zr(a=n[e])?a:[];u[e]=o&&a.length>=120?_r(e&&a):null}var c=n[0],l=-1,s=c?c.length:0,p=u[0];n:for(;++l<s;)if(a=c[l],(p?Hn(p,a):i(f,a,0))<0){for(var e=t;--e;){var h=u[e];if((h?Hn(h,a):i(n[e],a,0))<0)continue n}p&&p.push(a),f.push(a)}return f}),Go=yu(function(t,r){r=Ct(r);var e=wt(t,r);return Vt(t,r.sort(n)),e}),Jo=Nr(),Xo=Nr(!0),Zo=yu(function(n){return nr(Ct(n,!1,!0))}),Ho=yu(function(n,t){return Zr(n)?jt(n,t):[]}),Qo=yu(Te),nf=yu(function(n){var t=n.length,r=t>2?n[t-2]:b,e=t>1?n[t-1]:b;return t>2&&"function"==typeof r?t-=2:(r=t>1&&"function"==typeof e?(--t,e):b,e=b),n.length=t,Le(n,r,e)}),tf=yu(function(n){return n=Ct(n),this.thru(function(t){return rt(Cf(t)?t:[se(t)],n)})}),rf=yu(function(n,t){return wt(n,Ct(t))}),ef=lr(function(n,t,r){no.call(n,r)?++n[r]:n[r]=1}),uf=xr(No),of=xr(To,!0),ff=kr(ut,No),af=kr(it,To),cf=lr(function(n,t,r){no.call(n,r)?n[r].push(t):n[r]=[t]}),lf=lr(function(n,t,r){n[r]=t}),sf=yu(function(n,t,r){var e=-1,u="function"==typeof t,i=ne(t),o=Zr(n)?zi(n.length):[];return No(n,function(n){var f=u?t:i&&null!=n?n[t]:b;o[++e]=f?f.apply(n,r):Xr(n,t,r)}),o}),pf=lr(function(n,t,r){n[r?0:1].push(t)},function(){return[[],[]]}),hf=Ur(st,No),vf=Ur(pt,To),_f=yu(function(n,t){if(null==n)return[];var r=t[2];return r&&Qr(t[0],t[1],r)&&(t.length=1),Ht(n,Ct(t),[])}),gf=jo||function(){return(new Di).getTime()},yf=yu(function(n,t,r){var e=j;if(r.length){var u=g(r,yf.placeholder);e|=E}return Tr(n,e,t,r,u)}),df=yu(function(n,t){t=t.length?Ct(t):Xu(n);for(var r=-1,e=t.length;++r<e;){var u=t[r];n[u]=Tr(n[u],j,n)}return n}),wf=yu(function(n,t,r){var e=j|k;if(r.length){var u=g(r,wf.placeholder);e|=E}return Tr(t,e,n,r,u)}),mf=dr(R),xf=dr(O),bf=yu(function(n,t){return At(n,1,t)}),Af=yu(function(n,t,r){return At(n,t,r)}),jf=jr(),kf=jr(!0),If=yu(function(n,t){if(t=Ct(t),"function"!=typeof n||!ot(t,e))throw new Ji(z);var r=t.length;return yu(function(e){for(var u=Ao(e.length,r);u--;)e[u]=t[u](e[u]);return n.apply(this,e)})}),Rf=Cr(E),Of=Cr(C),Ef=yu(function(n,t){return Tr(n,$,b,b,b,Ct(t))}),Cf=wo||function(n){return v(n)&&re(n.length)&&ro.call(n)==M},Uf=sr(qt),$f=sr(function(n,t,r){return r?yt(n,t,r):dt(n,t)}),Sf=wr($f,_t),Wf=wr(Uf,ie),Ff=Ar($t),Nf=Ar(St),Tf=Ir(Lo),Lf=Ir(Bo),Bf=Rr($t),zf=Rr(St),Df=xo?function(n){var t=null==n?b:n.constructor;return"function"==typeof t&&t.prototype===n||"function"!=typeof n&&Zr(n)?ce(n):Wu(n)?xo(n):[]}:ce,qf=Or(!0),Mf=Or(),Pf=yu(function(n,t){if(null==n)return{};if("function"!=typeof t[0]){var t=ct(Ct(t),Gi);return oe(n,jt(ni(n),t))}var r=or(t[0],t[1],3);return fe(n,function(n,t,e){return!r(n,t,e)})}),Kf=yu(function(n,t){return null==n?{}:"function"==typeof t[0]?fe(n,or(t[0],t[1],3)):oe(n,Ct(t))}),Vf=gr(function(n,t,r){return t=t.toLowerCase(),n+(r?t.charAt(0).toUpperCase()+t.slice(1):t)}),Yf=gr(function(n,t,r){return n+(r?"-":"")+t.toLowerCase()}),Gf=Er(),Jf=Er(!0),Xf=gr(function(n,t,r){return n+(r?"_":"")+t.toLowerCase()}),Zf=gr(function(n,t,r){return n+(r?" ":"")+(t.charAt(0).toUpperCase()+t.slice(1))}),Hf=yu(function(n,t){try{return n.apply(b,t)}catch(n){return Uu(n)?n:new qi(n)}}),Qf=yu(function(n,t){return function(r){return Xr(r,n,t)}}),na=yu(function(n,t){return function(r){return Xr(n,r,t)}}),ta=Fr("ceil"),ra=Fr("floor"),ea=mr(Au,Ro),ua=mr(Ku,Oo),ia=Fr("round");return G.prototype=H.prototype,nn.prototype=Fo(H.prototype),nn.prototype.constructor=nn,qn.prototype=Fo(H.prototype),qn.prototype.constructor=qn,Vn.prototype.delete=Yn,Vn.prototype.get=Gn,Vn.prototype.has=Jn,Vn.prototype.set=Xn,Zn.prototype.push=Qn,vu.Cache=Vn,G.after=lu,G.ary=su,G.assign=$f,G.at=rf,G.before=pu,G.bind=yf,G.bindAll=df,G.bindKey=wf,G.callback=ki,G.chain=De,G.chunk=ve,G.compact=_e,G.constant=Ii,G.countBy=ef,G.create=Ju,G.curry=mf,G.curryRight=xf,G.debounce=hu,G.defaults=Sf,G.defaultsDeep=Wf,G.defer=bf,G.delay=Af,G.difference=Po,G.drop=ge,G.dropRight=ye,G.dropRightWhile=de,G.dropWhile=we,G.fill=me,G.filter=Ze,G.flatten=be,G.flattenDeep=Ae,G.flow=jf,G.flowRight=kf,G.forEach=ff,G.forEachRight=af,G.forIn=Tf,G.forInRight=Lf,G.forOwn=Bf,G.forOwnRight=zf,G.functions=Xu,G.groupBy=cf,G.indexBy=lf,G.initial=ke,G.intersection=Yo,G.invert=Qu,G.invoke=sf,G.keys=Df,G.keysIn=ni,G.map=nu,G.mapKeys=qf,G.mapValues=Mf,G.matches=Oi,G.matchesProperty=Ei,G.memoize=vu,G.merge=Uf,G.method=Qf,G.methodOf=na,G.mixin=Ci,G.modArgs=If,G.negate=_u,G.omit=Pf,G.once=gu,G.pairs=ti,G.partial=Rf,G.partialRight=Of,G.partition=pf,G.pick=Kf,G.pluck=tu,G.property=Si,G.propertyOf=Wi,G.pull=Oe,G.pullAt=Go,G.range=Fi,G.rearg=Ef,G.reject=ru,G.remove=Ee,G.rest=Ce,G.restParam=yu,G.set=ei,G.shuffle=uu,G.slice=Ue,G.sortBy=fu,G.sortByAll=_f,G.sortByOrder=au,G.spread=du,G.take=$e,G.takeRight=Se,G.takeRightWhile=We,G.takeWhile=Fe,G.tap=qe,G.throttle=wu,G.thru=Me,G.times=Ni,G.toArray=Yu,G.toPlainObject=Gu,G.transform=ui,G.union=Zo,G.uniq=Ne,G.unzip=Te,G.unzipWith=Le,G.values=ii,G.valuesIn=oi,G.where=cu,G.without=Ho,G.wrap=mu,G.xor=Be,G.zip=Qo,G.zipObject=ze,G.zipWith=nf,G.backflow=kf,G.collect=nu,G.compose=kf,G.each=ff,G.eachRight=af,G.extend=$f,G.iteratee=ki,G.methods=Xu,G.object=ze,G.select=Ze,G.tail=Ce,G.unique=Ne,Ci(G,G),G.add=Li,G.attempt=Hf,G.camelCase=Vf,G.capitalize=ci,G.ceil=ta,G.clone=xu,G.cloneDeep=bu,G.deburr=li,G.endsWith=si,G.escape=pi,G.escapeRegExp=hi,G.every=Xe,G.find=uf,G.findIndex=Ko,G.findKey=Ff,G.findLast=of,G.findLastIndex=Vo,G.findLastKey=Nf,G.findWhere=He,G.first=xe,G.floor=ra,G.get=Zu,G.gt=Au,G.gte=ju,G.has=Hu,G.identity=Ri,G.includes=Qe,G.indexOf=je,G.inRange=fi,G.isArguments=ku,G.isArray=Cf,G.isBoolean=Iu,G.isDate=Ru,G.isElement=Ou,G.isEmpty=Eu,G.isEqual=Cu,G.isError=Uu,G.isFinite=$u,G.isFunction=Su,G.isMatch=Fu,G.isNaN=Nu,G.isNative=Tu,G.isNull=Lu,G.isNumber=Bu,G.isObject=Wu,G.isPlainObject=zu,G.isRegExp=Du,G.isString=qu,G.isTypedArray=Mu,G.isUndefined=Pu,G.kebabCase=Yf,G.last=Ie,G.lastIndexOf=Re,G.lt=Ku,G.lte=Vu,G.max=ea,G.min=ua,G.noConflict=Ui,G.noop=$i,G.now=gf,G.pad=vi,G.padLeft=Gf,G.padRight=Jf,G.parseInt=_i,G.random=ai,G.reduce=hf,G.reduceRight=vf,G.repeat=gi,G.result=ri,G.round=ia,G.runInContext=x,G.size=iu,G.snakeCase=Xf,G.some=ou,G.sortedIndex=Jo,G.sortedLastIndex=Xo,G.startCase=Zf,G.startsWith=yi,G.sum=Bi,G.template=di,G.trim=wi,G.trimLeft=mi,G.trimRight=xi,G.trunc=bi,G.unescape=Ai,G.uniqueId=Ti,G.words=ji,G.all=Xe,G.any=ou,G.contains=Qe,G.eq=Cu,G.detect=uf,G.foldl=hf,G.foldr=vf,G.head=xe,G.include=Qe,G.inject=hf,Ci(G,function(){var n={};return $t(G,function(t,r){G.prototype[r]||(n[r]=t)}),n}(),!1),G.sample=eu,G.prototype.sample=function(n){return this.__chain__||null!=n?this.thru(function(t){return eu(t,n)}):eu(this.value())},G.VERSION=A,ut(["bind","bindKey","curry","curryRight","partial","partialRight"],function(n){G[n].placeholder=G}),ut(["drop","take"],function(n,t){qn.prototype[n]=function(r){var e=this.__filtered__;if(e&&!t)return new qn(this);r=null==r?1:bo(yo(r)||0,0);var u=this.clone();return e?u.__takeCount__=Ao(u.__takeCount__,r):u.__views__.push({size:r,type:n+(u.__dir__<0?"Right":"")}),u},qn.prototype[n+"Right"]=function(t){return this.reverse()[n](t).reverse()}}),ut(["filter","map","takeWhile"],function(n,t){var r=t+1,e=r!=B;qn.prototype[n]=function(n,t){var u=this.clone();return u.__iteratees__.push({iteratee:Dr(n,t,1),type:r}),u.__filtered__=u.__filtered__||e,u}}),ut(["first","last"],function(n,t){var r="take"+(t?"Right":"");qn.prototype[n]=function(){return this[r](1).value()[0]}}),ut(["initial","rest"],function(n,t){var r="drop"+(t?"":"Right");qn.prototype[n]=function(){return this.__filtered__?new qn(this):this[r](1)}}),ut(["pluck","where"],function(n,t){var r=t?"filter":"map",e=t?zt:Si;qn.prototype[n]=function(n){return this[r](e(n))}}),qn.prototype.compact=function(){return this.filter(Ri)},qn.prototype.reject=function(n,t){return n=Dr(n,t,1),this.filter(function(t){return!n(t)})},qn.prototype.slice=function(n,t){n=null==n?0:+n||0;var r=this;return r.__filtered__&&(n>0||t<0)?new qn(r):(n<0?r=r.takeRight(-n):n&&(r=r.drop(n)),t!==b&&(t=+t||0,r=t<0?r.dropRight(-t):r.take(t-n)),r)},qn.prototype.takeRightWhile=function(n,t){return this.reverse().takeWhile(n,t).reverse()},qn.prototype.toArray=function(){return this.take(Oo)},$t(qn.prototype,function(n,t){var r=/^(?:filter|map|reject)|While$/.test(t),e=/^(?:first|last)$/.test(t),u=G[e?"take"+("last"==t?"Right":""):t];u&&(G.prototype[t]=function(){var t=e?[1]:arguments,i=this.__chain__,o=this.__wrapped__,f=!!this.__actions__.length,a=o instanceof qn,c=t[0],l=a||Cf(o);l&&r&&"function"==typeof c&&1!=c.length&&(a=l=!1);var s=function(n){return e&&i?u(n,1)[0]:u.apply(b,lt([n],t))},p={func:Me,args:[s],thisArg:b},h=a&&!f;if(e&&!i)return h?(o=o.clone(),o.__actions__.push(p),n.call(o)):u.call(b,this.value())[0];if(!e&&l){o=h?o:new qn(this);var v=n.apply(o,t);return v.__actions__.push(p),new nn(v,i)}return this.thru(s)})}),ut(["join","pop","push","replace","shift","sort","splice","split","unshift"],function(n){var t=(/^(?:replace|split)$/.test(n)?Hi:Xi)[n],r=/^(?:push|sort|unshift)$/.test(n)?"tap":"thru",e=/^(?:join|pop|replace|shift)$/.test(n);G.prototype[n]=function(){var n=arguments;return e&&!this.__chain__?t.apply(this.value(),n):this[r](function(r){return t.apply(r,n)})}}),$t(qn.prototype,function(n,t){var r=G[t];if(r){var e=r.name,u=Wo[e]||(Wo[e]=[]);u.push({name:t,func:r})}}),Wo[$r(b,k).name]=[{name:"wrapper",func:b}],qn.prototype.clone=Mn,qn.prototype.reverse=Pn,qn.prototype.value=Kn,G.prototype.chain=Pe,G.prototype.commit=Ke,G.prototype.concat=tf,G.prototype.plant=Ve,G.prototype.reverse=Ye,G.prototype.toString=Ge,G.prototype.run=G.prototype.toJSON=G.prototype.valueOf=G.prototype.value=Je,G.prototype.collect=G.prototype.map,G.prototype.head=G.prototype.first,G.prototype.select=G.prototype.filter,G.prototype.tail=G.prototype.rest,G}var b,A="3.10.1",j=1,k=2,I=4,R=8,O=16,E=32,C=64,U=128,$=256,S=30,W="...",F=150,N=16,T=200,L=1,B=2,z="Expected a function",D="__lodash_placeholder__",q="[object Arguments]",M="[object Array]",P="[object Boolean]",K="[object Date]",V="[object Error]",Y="[object Function]",G="[object Map]",J="[object Number]",X="[object Object]",Z="[object RegExp]",H="[object Set]",Q="[object String]",nn="[object WeakMap]",tn="[object ArrayBuffer]",rn="[object Float32Array]",en="[object Float64Array]",un="[object Int8Array]",on="[object Int16Array]",fn="[object Int32Array]",an="[object Uint8Array]",cn="[object Uint8ClampedArray]",ln="[object Uint16Array]",sn="[object Uint32Array]",pn=/\b__p \+= '';/g,hn=/\b(__p \+=) '' \+/g,vn=/(__e\(.*?\)|\b__t\)) \+\n'';/g,_n=/&(?:amp|lt|gt|quot|#39|#96);/g,gn=/[&<>"'`]/g,yn=RegExp(_n.source),dn=RegExp(gn.source),wn=/<%-([\s\S]+?)%>/g,mn=/<%([\s\S]+?)%>/g,xn=/<%=([\s\S]+?)%>/g,bn=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\n\\]|\\.)*?\1)\]/,An=/^\w*$/,jn=/[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\n\\]|\\.)*?)\2)\]/g,kn=/^[:!,]|[\\^$.*+?()[\]{}|\/]|(^[0-9a-fA-Fnrtuvx])|([\n\r\u2028\u2029])/g,In=RegExp(kn.source),Rn=/[\u0300-\u036f\ufe20-\ufe23]/g,On=/\\(\\)?/g,En=/\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g,Cn=/\w*$/,Un=/^0[xX]/,$n=/^\[object .+?Constructor\]$/,Sn=/^\d+$/,Wn=/[\xc0-\xd6\xd8-\xde\xdf-\xf6\xf8-\xff]/g,Fn=/($^)/,Nn=/['\n\r\u2028\u2029\\]/g,Tn=function(){var n="[A-Z\\xc0-\\xd6\\xd8-\\xde]",t="[a-z\\xdf-\\xf6\\xf8-\\xff]+";return RegExp(n+"+(?="+n+t+")|"+n+"?"+t+"|"+n+"+|[0-9]+","g")}(),Ln=["Array","ArrayBuffer","Date","Error","Float32Array","Float64Array","Function","Int8Array","Int16Array","Int32Array","Math","Number","Object","RegExp","Set","String","_","clearTimeout","isFinite","parseFloat","parseInt","setTimeout","TypeError","Uint8Array","Uint8ClampedArray","Uint16Array","Uint32Array","WeakMap"],Bn=-1,zn={};zn[rn]=zn[en]=zn[un]=zn[on]=zn[fn]=zn[an]=zn[cn]=zn[ln]=zn[sn]=!0,zn[q]=zn[M]=zn[tn]=zn[P]=zn[K]=zn[V]=zn[Y]=zn[G]=zn[J]=zn[X]=zn[Z]=zn[H]=zn[Q]=zn[nn]=!1;var Dn={};Dn[q]=Dn[M]=Dn[tn]=Dn[P]=Dn[K]=Dn[rn]=Dn[en]=Dn[un]=Dn[on]=Dn[fn]=Dn[J]=Dn[X]=Dn[Z]=Dn[Q]=Dn[an]=Dn[cn]=Dn[ln]=Dn[sn]=!0,Dn[V]=Dn[Y]=Dn[G]=Dn[H]=Dn[nn]=!1;var qn={"À":"A","Á":"A","Â":"A","Ã":"A","Ä":"A","Å":"A","à":"a","á":"a","â":"a","ã":"a","ä":"a","å":"a","Ç":"C","ç":"c","Ð":"D","ð":"d","È":"E","É":"E","Ê":"E","Ë":"E","è":"e","é":"e","ê":"e","ë":"e","Ì":"I","Í":"I","Î":"I","Ï":"I","ì":"i","í":"i","î":"i","ï":"i","Ñ":"N","ñ":"n","Ò":"O","Ó":"O","Ô":"O","Õ":"O","Ö":"O","Ø":"O","ò":"o","ó":"o","ô":"o","õ":"o","ö":"o","ø":"o","Ù":"U","Ú":"U","Û":"U","Ü":"U","ù":"u","ú":"u","û":"u","ü":"u","Ý":"Y","ý":"y","ÿ":"y","Æ":"Ae","æ":"ae","Þ":"Th","þ":"th","ß":"ss"},Mn={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&#39;","`":"&#96;"},Pn={"&amp;":"&","&lt;":"<","&gt;":">","&quot;":'"',"&#39;":"'","&#96;":"`"},Kn={function:!0,object:!0},Vn={0:"x30",1:"x31",2:"x32",3:"x33",4:"x34",5:"x35",6:"x36",7:"x37",8:"x38",9:"x39",A:"x41",B:"x42",C:"x43",D:"x44",E:"x45",F:"x46",a:"x61",b:"x62",c:"x63",d:"x64",e:"x65",f:"x66",n:"x6e",r:"x72",t:"x74",u:"x75",v:"x76",x:"x78"},Yn={"\\":"\\","'":"'","\n":"n","\r":"r","\u2028":"u2028","\u2029":"u2029"},Gn=Kn[typeof exports]&&exports&&!exports.nodeType&&exports,Jn=Kn[typeof module]&&module&&!module.nodeType&&module,Xn=Gn&&Jn&&"object"==typeof global&&global&&global.Object&&global,Zn=Kn[typeof self]&&self&&self.Object&&self,Hn=Kn[typeof window]&&window&&window.Object&&window,Qn=Jn&&Jn.exports===Gn&&Gn,nt=Xn||Hn!==(this&&this.window)&&Hn||Zn||this,tt=x();"function"==typeof define&&"object"==typeof define.amd&&define.amd?(nt._=tt,define(function(){return tt})):Gn&&Jn?Qn?(Jn.exports=tt)._=tt:Gn._=tt:nt._=tt}).call(this);
-
-
+(function(){function n(n,t){return n.set(t[0],t[1]),n}function t(n,t){return n.add(t),n}function r(n,t,r){switch(r.length){case 0:return n.call(t);case 1:return n.call(t,r[0]);case 2:return n.call(t,r[0],r[1]);case 3:return n.call(t,r[0],r[1],r[2])}return n.apply(t,r)}function e(n,t,r,e){for(var u=-1,i=null==n?0:n.length;++u<i;){var o=n[u];t(e,o,r(o),n)}return e}function u(n,t){for(var r=-1,e=null==n?0:n.length;++r<e&&t(n[r],r,n)!==!1;);return n}function i(n,t){for(var r=null==n?0:n.length;r--&&t(n[r],r,n)!==!1;);return n}function o(n,t){for(var r=-1,e=null==n?0:n.length;++r<e;)if(!t(n[r],r,n))return!1;return!0}function f(n,t){for(var r=-1,e=null==n?0:n.length,u=0,i=[];++r<e;){var o=n[r];t(o,r,n)&&(i[u++]=o)}return i}function a(n,t){var r=null==n?0:n.length;return!!r&&b(n,t,0)>-1}function c(n,t,r){for(var e=-1,u=null==n?0:n.length;++e<u;)if(r(t,n[e]))return!0;return!1}function l(n,t){for(var r=-1,e=null==n?0:n.length,u=Array(e);++r<e;)u[r]=t(n[r],r,n);return u}function s(n,t){for(var r=-1,e=t.length,u=n.length;++r<e;)n[u+r]=t[r];return n}function h(n,t,r,e){var u=-1,i=null==n?0:n.length;for(e&&i&&(r=n[++u]);++u<i;)r=t(r,n[u],u,n);return r}function p(n,t,r,e){var u=null==n?0:n.length;for(e&&u&&(r=n[--u]);u--;)r=t(r,n[u],u,n);return r}function v(n,t){for(var r=-1,e=null==n?0:n.length;++r<e;)if(t(n[r],r,n))return!0;return!1}function _(n){return n.split("")}function g(n){return n.match(Dt)||[]}function y(n,t,r){var e;return r(n,function(n,r,u){if(t(n,r,u))return e=r,!1}),e}function d(n,t,r,e){for(var u=n.length,i=r+(e?1:-1);e?i--:++i<u;)if(t(n[i],i,n))return i;return-1}function b(n,t,r){return t===t?K(n,t,r):d(n,m,r)}function w(n,t,r,e){for(var u=r-1,i=n.length;++u<i;)if(e(n[u],t))return u;return-1}function m(n){return n!==n}function x(n,t){var r=null==n?0:n.length;return r?I(n,t)/r:Ln}function j(n){return function(t){return null==t?X:t[n]}}function A(n){return function(t){return null==n?X:n[t]}}function k(n,t,r,e,u){return u(n,function(n,u,i){r=e?(e=!1,n):t(r,n,u,i)}),r}function O(n,t){var r=n.length;for(n.sort(t);r--;)n[r]=n[r].value;return n}function I(n,t){for(var r,e=-1,u=n.length;++e<u;){var i=t(n[e]);i!==X&&(r=r===X?i:r+i)}return r}function R(n,t){for(var r=-1,e=Array(n);++r<n;)e[r]=t(r);return e}function z(n,t){return l(t,function(t){return[t,n[t]]})}function E(n){return function(t){return n(t)}}function S(n,t){return l(t,function(t){return n[t]})}function W(n,t){return n.has(t)}function L(n,t){for(var r=-1,e=n.length;++r<e&&b(t,n[r],0)>-1;);return r}function C(n,t){for(var r=n.length;r--&&b(t,n[r],0)>-1;);return r}function U(n,t){for(var r=n.length,e=0;r--;)n[r]===t&&++e;return e}function B(n){return"\\"+Yr[n]}function T(n,t){return null==n?X:n[t]}function $(n){return Nr.test(n)}function D(n){return Pr.test(n)}function M(n){for(var t,r=[];!(t=n.next()).done;)r.push(t.value);return r}function F(n){var t=-1,r=Array(n.size);return n.forEach(function(n,e){r[++t]=[e,n]}),r}function N(n,t){return function(r){return n(t(r))}}function P(n,t){for(var r=-1,e=n.length,u=0,i=[];++r<e;){var o=n[r];o!==t&&o!==fn||(n[r]=fn,i[u++]=r)}return i}function q(n){var t=-1,r=Array(n.size);return n.forEach(function(n){r[++t]=n}),r}function Z(n){var t=-1,r=Array(n.size);return n.forEach(function(n){r[++t]=[n,n]}),r}function K(n,t,r){for(var e=r-1,u=n.length;++e<u;)if(n[e]===t)return e;return-1}function V(n,t,r){for(var e=r+1;e--;)if(n[e]===t)return e;return e}function G(n){return $(n)?J(n):ve(n)}function H(n){return $(n)?Y(n):_(n)}function J(n){for(var t=Mr.lastIndex=0;Mr.test(n);)++t;return t}function Y(n){return n.match(Mr)||[]}function Q(n){return n.match(Fr)||[]}var X,nn="4.17.4",tn=200,rn="Unsupported core-js use. Try https://npms.io/search?q=ponyfill.",en="Expected a function",un="__lodash_hash_undefined__",on=500,fn="__lodash_placeholder__",an=1,cn=2,ln=4,sn=1,hn=2,pn=1,vn=2,_n=4,gn=8,yn=16,dn=32,bn=64,wn=128,mn=256,xn=512,jn=30,An="...",kn=800,On=16,In=1,Rn=2,zn=3,En=1/0,Sn=9007199254740991,Wn=1.7976931348623157e308,Ln=NaN,Cn=4294967295,Un=Cn-1,Bn=Cn>>>1,Tn=[["ary",wn],["bind",pn],["bindKey",vn],["curry",gn],["curryRight",yn],["flip",xn],["partial",dn],["partialRight",bn],["rearg",mn]],$n="[object Arguments]",Dn="[object Array]",Mn="[object AsyncFunction]",Fn="[object Boolean]",Nn="[object Date]",Pn="[object DOMException]",qn="[object Error]",Zn="[object Function]",Kn="[object GeneratorFunction]",Vn="[object Map]",Gn="[object Number]",Hn="[object Null]",Jn="[object Object]",Yn="[object Promise]",Qn="[object Proxy]",Xn="[object RegExp]",nt="[object Set]",tt="[object String]",rt="[object Symbol]",et="[object Undefined]",ut="[object WeakMap]",it="[object WeakSet]",ot="[object ArrayBuffer]",ft="[object DataView]",at="[object Float32Array]",ct="[object Float64Array]",lt="[object Int8Array]",st="[object Int16Array]",ht="[object Int32Array]",pt="[object Uint8Array]",vt="[object Uint8ClampedArray]",_t="[object Uint16Array]",gt="[object Uint32Array]",yt=/\b__p \+= '';/g,dt=/\b(__p \+=) '' \+/g,bt=/(__e\(.*?\)|\b__t\)) \+\n'';/g,wt=/&(?:amp|lt|gt|quot|#39);/g,mt=/[&<>"']/g,xt=RegExp(wt.source),jt=RegExp(mt.source),At=/<%-([\s\S]+?)%>/g,kt=/<%([\s\S]+?)%>/g,Ot=/<%=([\s\S]+?)%>/g,It=/\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,Rt=/^\w*$/,zt=/^\./,Et=/[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g,St=/[\\^$.*+?()[\]{}|]/g,Wt=RegExp(St.source),Lt=/^\s+|\s+$/g,Ct=/^\s+/,Ut=/\s+$/,Bt=/\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/,Tt=/\{\n\/\* \[wrapped with (.+)\] \*/,$t=/,? & /,Dt=/[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g,Mt=/\\(\\)?/g,Ft=/\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g,Nt=/\w*$/,Pt=/^[-+]0x[0-9a-f]+$/i,qt=/^0b[01]+$/i,Zt=/^\[object .+?Constructor\]$/,Kt=/^0o[0-7]+$/i,Vt=/^(?:0|[1-9]\d*)$/,Gt=/[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/g,Ht=/($^)/,Jt=/['\n\r\u2028\u2029\\]/g,Yt="\\ud800-\\udfff",Qt="\\u0300-\\u036f",Xt="\\ufe20-\\ufe2f",nr="\\u20d0-\\u20ff",tr=Qt+Xt+nr,rr="\\u2700-\\u27bf",er="a-z\\xdf-\\xf6\\xf8-\\xff",ur="\\xac\\xb1\\xd7\\xf7",ir="\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf",or="\\u2000-\\u206f",fr=" \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000",ar="A-Z\\xc0-\\xd6\\xd8-\\xde",cr="\\ufe0e\\ufe0f",lr=ur+ir+or+fr,sr="['’]",hr="["+Yt+"]",pr="["+lr+"]",vr="["+tr+"]",_r="\\d+",gr="["+rr+"]",yr="["+er+"]",dr="[^"+Yt+lr+_r+rr+er+ar+"]",br="\\ud83c[\\udffb-\\udfff]",wr="(?:"+vr+"|"+br+")",mr="[^"+Yt+"]",xr="(?:\\ud83c[\\udde6-\\uddff]){2}",jr="[\\ud800-\\udbff][\\udc00-\\udfff]",Ar="["+ar+"]",kr="\\u200d",Or="(?:"+yr+"|"+dr+")",Ir="(?:"+Ar+"|"+dr+")",Rr="(?:"+sr+"(?:d|ll|m|re|s|t|ve))?",zr="(?:"+sr+"(?:D|LL|M|RE|S|T|VE))?",Er=wr+"?",Sr="["+cr+"]?",Wr="(?:"+kr+"(?:"+[mr,xr,jr].join("|")+")"+Sr+Er+")*",Lr="\\d*(?:(?:1st|2nd|3rd|(?![123])\\dth)\\b)",Cr="\\d*(?:(?:1ST|2ND|3RD|(?![123])\\dTH)\\b)",Ur=Sr+Er+Wr,Br="(?:"+[gr,xr,jr].join("|")+")"+Ur,Tr="(?:"+[mr+vr+"?",vr,xr,jr,hr].join("|")+")",$r=RegExp(sr,"g"),Dr=RegExp(vr,"g"),Mr=RegExp(br+"(?="+br+")|"+Tr+Ur,"g"),Fr=RegExp([Ar+"?"+yr+"+"+Rr+"(?="+[pr,Ar,"$"].join("|")+")",Ir+"+"+zr+"(?="+[pr,Ar+Or,"$"].join("|")+")",Ar+"?"+Or+"+"+Rr,Ar+"+"+zr,Cr,Lr,_r,Br].join("|"),"g"),Nr=RegExp("["+kr+Yt+tr+cr+"]"),Pr=/[a-z][A-Z]|[A-Z]{2,}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/,qr=["Array","Buffer","DataView","Date","Error","Float32Array","Float64Array","Function","Int8Array","Int16Array","Int32Array","Map","Math","Object","Promise","RegExp","Set","String","Symbol","TypeError","Uint8Array","Uint8ClampedArray","Uint16Array","Uint32Array","WeakMap","_","clearTimeout","isFinite","parseInt","setTimeout"],Zr=-1,Kr={};Kr[at]=Kr[ct]=Kr[lt]=Kr[st]=Kr[ht]=Kr[pt]=Kr[vt]=Kr[_t]=Kr[gt]=!0,Kr[$n]=Kr[Dn]=Kr[ot]=Kr[Fn]=Kr[ft]=Kr[Nn]=Kr[qn]=Kr[Zn]=Kr[Vn]=Kr[Gn]=Kr[Jn]=Kr[Xn]=Kr[nt]=Kr[tt]=Kr[ut]=!1;var Vr={};Vr[$n]=Vr[Dn]=Vr[ot]=Vr[ft]=Vr[Fn]=Vr[Nn]=Vr[at]=Vr[ct]=Vr[lt]=Vr[st]=Vr[ht]=Vr[Vn]=Vr[Gn]=Vr[Jn]=Vr[Xn]=Vr[nt]=Vr[tt]=Vr[rt]=Vr[pt]=Vr[vt]=Vr[_t]=Vr[gt]=!0,Vr[qn]=Vr[Zn]=Vr[ut]=!1;var Gr={"À":"A","Á":"A","Â":"A","Ã":"A","Ä":"A","Å":"A","à":"a","á":"a","â":"a","ã":"a","ä":"a","å":"a","Ç":"C","ç":"c","Ð":"D","ð":"d","È":"E","É":"E","Ê":"E","Ë":"E","è":"e","é":"e","ê":"e","ë":"e","Ì":"I","Í":"I","Î":"I","Ï":"I","ì":"i","í":"i","î":"i","ï":"i","Ñ":"N","ñ":"n","Ò":"O","Ó":"O","Ô":"O","Õ":"O","Ö":"O","Ø":"O","ò":"o","ó":"o","ô":"o","õ":"o","ö":"o","ø":"o","Ù":"U","Ú":"U","Û":"U","Ü":"U","ù":"u","ú":"u","û":"u","ü":"u","Ý":"Y","ý":"y","ÿ":"y","Æ":"Ae","æ":"ae","Þ":"Th","þ":"th","ß":"ss","Ā":"A","Ă":"A","Ą":"A","ā":"a","ă":"a","ą":"a","Ć":"C","Ĉ":"C","Ċ":"C","Č":"C","ć":"c","ĉ":"c","ċ":"c","č":"c","Ď":"D","Đ":"D","ď":"d","đ":"d","Ē":"E","Ĕ":"E","Ė":"E","Ę":"E","Ě":"E","ē":"e","ĕ":"e","ė":"e","ę":"e","ě":"e","Ĝ":"G","Ğ":"G","Ġ":"G","Ģ":"G","ĝ":"g","ğ":"g","ġ":"g","ģ":"g","Ĥ":"H","Ħ":"H","ĥ":"h","ħ":"h","Ĩ":"I","Ī":"I","Ĭ":"I","Į":"I","İ":"I","ĩ":"i","ī":"i","ĭ":"i","į":"i","ı":"i","Ĵ":"J","ĵ":"j","Ķ":"K","ķ":"k","ĸ":"k","Ĺ":"L","Ļ":"L","Ľ":"L","Ŀ":"L","Ł":"L","ĺ":"l","ļ":"l","ľ":"l","ŀ":"l","ł":"l","Ń":"N","Ņ":"N","Ň":"N","Ŋ":"N","ń":"n","ņ":"n","ň":"n","ŋ":"n","Ō":"O","Ŏ":"O","Ő":"O","ō":"o","ŏ":"o","ő":"o","Ŕ":"R","Ŗ":"R","Ř":"R","ŕ":"r","ŗ":"r","ř":"r","Ś":"S","Ŝ":"S","Ş":"S","Š":"S","ś":"s","ŝ":"s","ş":"s","š":"s","Ţ":"T","Ť":"T","Ŧ":"T","ţ":"t","ť":"t","ŧ":"t","Ũ":"U","Ū":"U","Ŭ":"U","Ů":"U","Ű":"U","Ų":"U","ũ":"u","ū":"u","ŭ":"u","ů":"u","ű":"u","ų":"u","Ŵ":"W","ŵ":"w","Ŷ":"Y","ŷ":"y","Ÿ":"Y","Ź":"Z","Ż":"Z","Ž":"Z","ź":"z","ż":"z","ž":"z","IJ":"IJ","ij":"ij","Œ":"Oe","œ":"oe","ʼn":"'n","ſ":"s"},Hr={"&":"&amp;","<":"&lt;",">":"&gt;",'"':"&quot;","'":"&#39;"},Jr={"&amp;":"&","&lt;":"<","&gt;":">","&quot;":'"',"&#39;":"'"},Yr={"\\":"\\","'":"'","\n":"n","\r":"r","\u2028":"u2028","\u2029":"u2029"},Qr=parseFloat,Xr=parseInt,ne="object"==typeof global&&global&&global.Object===Object&&global,te="object"==typeof self&&self&&self.Object===Object&&self,re=ne||te||Function("return this")(),ee="object"==typeof exports&&exports&&!exports.nodeType&&exports,ue=ee&&"object"==typeof module&&module&&!module.nodeType&&module,ie=ue&&ue.exports===ee,oe=ie&&ne.process,fe=function(){try{return oe&&oe.binding&&oe.binding("util")}catch(n){}}(),ae=fe&&fe.isArrayBuffer,ce=fe&&fe.isDate,le=fe&&fe.isMap,se=fe&&fe.isRegExp,he=fe&&fe.isSet,pe=fe&&fe.isTypedArray,ve=j("length"),_e=A(Gr),ge=A(Hr),ye=A(Jr),de=function _(A){function K(n){if(la(n)&&!mh(n)&&!(n instanceof Dt)){if(n instanceof Y)return n;if(ml.call(n,"__wrapped__"))return io(n)}return new Y(n)}function J(){}function Y(n,t){this.__wrapped__=n,this.__actions__=[],this.__chain__=!!t,this.__index__=0,this.__values__=X}function Dt(n){this.__wrapped__=n,this.__actions__=[],this.__dir__=1,this.__filtered__=!1,this.__iteratees__=[],this.__takeCount__=Cn,this.__views__=[]}function Yt(){var n=new Dt(this.__wrapped__);return n.__actions__=Mu(this.__actions__),n.__dir__=this.__dir__,n.__filtered__=this.__filtered__,n.__iteratees__=Mu(this.__iteratees__),n.__takeCount__=this.__takeCount__,n.__views__=Mu(this.__views__),n}function Qt(){if(this.__filtered__){var n=new Dt(this);n.__dir__=-1,n.__filtered__=!0}else n=this.clone(),n.__dir__*=-1;return n}function Xt(){var n=this.__wrapped__.value(),t=this.__dir__,r=mh(n),e=t<0,u=r?n.length:0,i=zi(0,u,this.__views__),o=i.start,f=i.end,a=f-o,c=e?f:o-1,l=this.__iteratees__,s=l.length,h=0,p=Yl(a,this.__takeCount__);if(!r||!e&&u==a&&p==a)return mu(n,this.__actions__);var v=[];n:for(;a--&&h<p;){c+=t;for(var _=-1,g=n[c];++_<s;){var y=l[_],d=y.iteratee,b=y.type,w=d(g);if(b==Rn)g=w;else if(!w){if(b==In)continue n;break n}}v[h++]=g}return v}function nr(n){var t=-1,r=null==n?0:n.length;for(this.clear();++t<r;){var e=n[t];this.set(e[0],e[1])}}function tr(){this.__data__=fs?fs(null):{},this.size=0}function rr(n){var t=this.has(n)&&delete this.__data__[n];return this.size-=t?1:0,t}function er(n){var t=this.__data__;if(fs){var r=t[n];return r===un?X:r}return ml.call(t,n)?t[n]:X}function ur(n){var t=this.__data__;return fs?t[n]!==X:ml.call(t,n)}function ir(n,t){var r=this.__data__;return this.size+=this.has(n)?0:1,r[n]=fs&&t===X?un:t,this}function or(n){var t=-1,r=null==n?0:n.length;for(this.clear();++t<r;){var e=n[t];this.set(e[0],e[1])}}function fr(){this.__data__=[],this.size=0}function ar(n){var t=this.__data__,r=Lr(t,n);if(r<0)return!1;var e=t.length-1;return r==e?t.pop():Ul.call(t,r,1),--this.size,!0}function cr(n){var t=this.__data__,r=Lr(t,n);return r<0?X:t[r][1]}function lr(n){return Lr(this.__data__,n)>-1}function sr(n,t){var r=this.__data__,e=Lr(r,n);return e<0?(++this.size,r.push([n,t])):r[e][1]=t,this}function hr(n){var t=-1,r=null==n?0:n.length;for(this.clear();++t<r;){var e=n[t];this.set(e[0],e[1])}}function pr(){this.size=0,this.__data__={hash:new nr,map:new(es||or),string:new nr}}function vr(n){var t=ki(this,n).delete(n);return this.size-=t?1:0,t}function _r(n){return ki(this,n).get(n)}function gr(n){return ki(this,n).has(n)}function yr(n,t){var r=ki(this,n),e=r.size;return r.set(n,t),this.size+=r.size==e?0:1,this}function dr(n){var t=-1,r=null==n?0:n.length;for(this.__data__=new hr;++t<r;)this.add(n[t])}function br(n){return this.__data__.set(n,un),this}function wr(n){return this.__data__.has(n)}function mr(n){var t=this.__data__=new or(n);this.size=t.size}function xr(){this.__data__=new or,this.size=0}function jr(n){var t=this.__data__,r=t.delete(n);return this.size=t.size,r}function Ar(n){return this.__data__.get(n)}function kr(n){return this.__data__.has(n)}function Or(n,t){var r=this.__data__;if(r instanceof or){var e=r.__data__;if(!es||e.length<tn-1)return e.push([n,t]),this.size=++r.size,this;r=this.__data__=new hr(e)}return r.set(n,t),this.size=r.size,this}function Ir(n,t){var r=mh(n),e=!r&&wh(n),u=!r&&!e&&jh(n),i=!r&&!e&&!u&&Rh(n),o=r||e||u||i,f=o?R(n.length,vl):[],a=f.length;for(var c in n)!t&&!ml.call(n,c)||o&&("length"==c||u&&("offset"==c||"parent"==c)||i&&("buffer"==c||"byteLength"==c||"byteOffset"==c)||Ti(c,a))||f.push(c);return f}function Rr(n){var t=n.length;return t?n[ru(0,t-1)]:X}function zr(n,t){return to(Mu(n),Fr(t,0,n.length))}function Er(n){return to(Mu(n))}function Sr(n,t,r){(r===X||Jf(n[t],r))&&(r!==X||t in n)||Tr(n,t,r)}function Wr(n,t,r){var e=n[t];ml.call(n,t)&&Jf(e,r)&&(r!==X||t in n)||Tr(n,t,r)}function Lr(n,t){for(var r=n.length;r--;)if(Jf(n[r][0],t))return r;return-1}function Cr(n,t,r,e){return bs(n,function(n,u,i){t(e,n,r(n),i)}),e}function Ur(n,t){return n&&Fu(t,Za(t),n)}function Br(n,t){return n&&Fu(t,Ka(t),n)}function Tr(n,t,r){"__proto__"==t&&Dl?Dl(n,t,{configurable:!0,enumerable:!0,value:r,writable:!0}):n[t]=r}function Mr(n,t){for(var r=-1,e=t.length,u=fl(e),i=null==n;++r<e;)u[r]=i?X:Na(n,t[r]);return u}function Fr(n,t,r){return n===n&&(r!==X&&(n=n<=r?n:r),t!==X&&(n=n>=t?n:t)),n}function Nr(n,t,r,e,i,o){var f,a=t&an,c=t&cn,l=t&ln;if(r&&(f=i?r(n,e,i,o):r(n)),f!==X)return f;if(!ca(n))return n;var s=mh(n);if(s){if(f=Wi(n),!a)return Mu(n,f)}else{var h=Ss(n),p=h==Zn||h==Kn;if(jh(n))return Ru(n,a);if(h==Jn||h==$n||p&&!i){if(f=c||p?{}:Li(n),!a)return c?Pu(n,Br(f,n)):Nu(n,Ur(f,n))}else{if(!Vr[h])return i?n:{};f=Ci(n,h,Nr,a)}}o||(o=new mr);var v=o.get(n);if(v)return v;o.set(n,f);var _=l?c?mi:wi:c?Ka:Za,g=s?X:_(n);return u(g||n,function(e,u){g&&(u=e,e=n[u]),Wr(f,u,Nr(e,t,r,u,n,o))}),f}function Pr(n){var t=Za(n);return function(r){return Gr(r,n,t)}}function Gr(n,t,r){var e=r.length;if(null==n)return!e;for(n=hl(n);e--;){var u=r[e],i=t[u],o=n[u];if(o===X&&!(u in n)||!i(o))return!1}return!0}function Hr(n,t,r){if("function"!=typeof n)throw new _l(en);return Cs(function(){n.apply(X,r)},t)}function Jr(n,t,r,e){var u=-1,i=a,o=!0,f=n.length,s=[],h=t.length;if(!f)return s;r&&(t=l(t,E(r))),e?(i=c,o=!1):t.length>=tn&&(i=W,o=!1,t=new dr(t));n:for(;++u<f;){var p=n[u],v=null==r?p:r(p);if(p=e||0!==p?p:0,o&&v===v){for(var _=h;_--;)if(t[_]===v)continue n;s.push(p)}else i(t,v,e)||s.push(p)}return s}function Yr(n,t){var r=!0;return bs(n,function(n,e,u){return r=!!t(n,e,u)}),r}function ne(n,t,r){for(var e=-1,u=n.length;++e<u;){var i=n[e],o=t(i);if(null!=o&&(f===X?o===o&&!ma(o):r(o,f)))var f=o,a=i}return a}function te(n,t,r,e){var u=n.length;for(r=Ia(r),r<0&&(r=-r>u?0:u+r),e=e===X||e>u?u:Ia(e),e<0&&(e+=u),e=r>e?0:Ra(e);r<e;)n[r++]=t;return n}function ee(n,t){var r=[];return bs(n,function(n,e,u){t(n,e,u)&&r.push(n)}),r}function ue(n,t,r,e,u){var i=-1,o=n.length;for(r||(r=Bi),u||(u=[]);++i<o;){var f=n[i];t>0&&r(f)?t>1?ue(f,t-1,r,e,u):s(u,f):e||(u[u.length]=f)}return u}function oe(n,t){return n&&ms(n,t,Za)}function fe(n,t){return n&&xs(n,t,Za)}function ve(n,t){return f(t,function(t){return oa(n[t])})}function de(n,t){t=Ou(t,n);for(var r=0,e=t.length;null!=n&&r<e;)n=n[ro(t[r++])];return r&&r==e?n:X}function we(n,t,r){var e=t(n);return mh(n)?e:s(e,r(n))}function me(n){return null==n?n===X?et:Hn:$l&&$l in hl(n)?Ri(n):Hi(n)}function xe(n,t){return n>t}function je(n,t){return null!=n&&ml.call(n,t)}function Ae(n,t){return null!=n&&t in hl(n)}function ke(n,t,r){return n>=Yl(t,r)&&n<Jl(t,r)}function Oe(n,t,r){for(var e=r?c:a,u=n[0].length,i=n.length,o=i,f=fl(i),s=1/0,h=[];o--;){var p=n[o];o&&t&&(p=l(p,E(t))),s=Yl(p.length,s),f[o]=!r&&(t||u>=120&&p.length>=120)?new dr(o&&p):X}p=n[0];var v=-1,_=f[0];n:for(;++v<u&&h.length<s;){var g=p[v],y=t?t(g):g;if(g=r||0!==g?g:0,!(_?W(_,y):e(h,y,r))){for(o=i;--o;){var d=f[o];if(!(d?W(d,y):e(n[o],y,r)))continue n}_&&_.push(y),h.push(g)}}return h}function Ie(n,t,r,e){return oe(n,function(n,u,i){t(e,r(n),u,i)}),e}function Re(n,t,e){t=Ou(t,n),n=Yi(n,t);var u=null==n?n:n[ro(ko(t))];return null==u?X:r(u,n,e)}function ze(n){return la(n)&&me(n)==$n}function Ee(n){return la(n)&&me(n)==ot}function Se(n){return la(n)&&me(n)==Nn}function We(n,t,r,e,u){return n===t||(null==n||null==t||!la(n)&&!la(t)?n!==n&&t!==t:Le(n,t,r,e,We,u))}function Le(n,t,r,e,u,i){var o=mh(n),f=mh(t),a=o?Dn:Ss(n),c=f?Dn:Ss(t);a=a==$n?Jn:a,c=c==$n?Jn:c;var l=a==Jn,s=c==Jn,h=a==c;if(h&&jh(n)){if(!jh(t))return!1;o=!0,l=!1}if(h&&!l)return i||(i=new mr),o||Rh(n)?gi(n,t,r,e,u,i):yi(n,t,a,r,e,u,i);if(!(r&sn)){var p=l&&ml.call(n,"__wrapped__"),v=s&&ml.call(t,"__wrapped__");if(p||v){var _=p?n.value():n,g=v?t.value():t;return i||(i=new mr),u(_,g,r,e,i)}}return!!h&&(i||(i=new mr),di(n,t,r,e,u,i))}function Ce(n){return la(n)&&Ss(n)==Vn}function Ue(n,t,r,e){var u=r.length,i=u,o=!e;if(null==n)return!i;for(n=hl(n);u--;){var f=r[u];if(o&&f[2]?f[1]!==n[f[0]]:!(f[0]in n))return!1}for(;++u<i;){f=r[u];var a=f[0],c=n[a],l=f[1];if(o&&f[2]){if(c===X&&!(a in n))return!1}else{var s=new mr;if(e)var h=e(c,l,a,n,t,s);if(!(h===X?We(l,c,sn|hn,e,s):h))return!1}}return!0}function Be(n){if(!ca(n)||Ni(n))return!1;var t=oa(n)?Il:Zt;return t.test(eo(n))}function Te(n){return la(n)&&me(n)==Xn}function $e(n){return la(n)&&Ss(n)==nt}function De(n){return la(n)&&aa(n.length)&&!!Kr[me(n)]}function Me(n){return"function"==typeof n?n:null==n?Uc:"object"==typeof n?mh(n)?Ke(n[0],n[1]):Ze(n):Pc(n)}function Fe(n){if(!Pi(n))return Hl(n);var t=[];for(var r in hl(n))ml.call(n,r)&&"constructor"!=r&&t.push(r);return t}function Ne(n){if(!ca(n))return Gi(n);var t=Pi(n),r=[];for(var e in n)("constructor"!=e||!t&&ml.call(n,e))&&r.push(e);return r}function Pe(n,t){return n<t}function qe(n,t){var r=-1,e=Yf(n)?fl(n.length):[];return bs(n,function(n,u,i){e[++r]=t(n,u,i)}),e}function Ze(n){var t=Oi(n);return 1==t.length&&t[0][2]?Zi(t[0][0],t[0][1]):function(r){return r===n||Ue(r,n,t)}}function Ke(n,t){return Di(n)&&qi(t)?Zi(ro(n),t):function(r){var e=Na(r,n);return e===X&&e===t?qa(r,n):We(t,e,sn|hn)}}function Ve(n,t,r,e,u){n!==t&&ms(t,function(i,o){if(ca(i))u||(u=new mr),Ge(n,t,o,r,Ve,e,u);else{var f=e?e(n[o],i,o+"",n,t,u):X;f===X&&(f=i),Sr(n,o,f)}},Ka)}function Ge(n,t,r,e,u,i,o){var f=n[r],a=t[r],c=o.get(a);if(c)return void Sr(n,r,c);var l=i?i(f,a,r+"",n,t,o):X,s=l===X;if(s){var h=mh(a),p=!h&&jh(a),v=!h&&!p&&Rh(a);l=a,h||p||v?mh(f)?l=f:Qf(f)?l=Mu(f):p?(s=!1,l=Ru(a,!0)):v?(s=!1,l=Uu(a,!0)):l=[]:da(a)||wh(a)?(l=f,wh(f)?l=Ea(f):(!ca(f)||e&&oa(f))&&(l=Li(a))):s=!1}s&&(o.set(a,l),u(l,a,e,i,o),o.delete(a)),Sr(n,r,l)}function He(n,t){var r=n.length;if(r)return t+=t<0?r:0,Ti(t,r)?n[t]:X}function Je(n,t,r){var e=-1;t=l(t.length?t:[Uc],E(Ai()));var u=qe(n,function(n,r,u){var i=l(t,function(t){return t(n)});return{criteria:i,index:++e,value:n}});return O(u,function(n,t){return Tu(n,t,r)})}function Ye(n,t){return Qe(n,t,function(t,r){return qa(n,r)})}function Qe(n,t,r){for(var e=-1,u=t.length,i={};++e<u;){var o=t[e],f=de(n,o);r(f,o)&&au(i,Ou(o,n),f)}return i}function Xe(n){return function(t){return de(t,n)}}function nu(n,t,r,e){var u=e?w:b,i=-1,o=t.length,f=n;for(n===t&&(t=Mu(t)),r&&(f=l(n,E(r)));++i<o;)for(var a=0,c=t[i],s=r?r(c):c;(a=u(f,s,a,e))>-1;)f!==n&&Ul.call(f,a,1),Ul.call(n,a,1);return n}function tu(n,t){for(var r=n?t.length:0,e=r-1;r--;){var u=t[r];if(r==e||u!==i){var i=u;Ti(u)?Ul.call(n,u,1):du(n,u)}}return n}function ru(n,t){return n+ql(ns()*(t-n+1))}function eu(n,t,r,e){for(var u=-1,i=Jl(Pl((t-n)/(r||1)),0),o=fl(i);i--;)o[e?i:++u]=n,n+=r;return o}function uu(n,t){var r="";if(!n||t<1||t>Sn)return r;do t%2&&(r+=n),t=ql(t/2),t&&(n+=n);while(t);return r}function iu(n,t){return Us(Ji(n,t,Uc),n+"")}function ou(n){return Rr(uc(n))}function fu(n,t){var r=uc(n);return to(r,Fr(t,0,r.length))}function au(n,t,r,e){if(!ca(n))return n;t=Ou(t,n);for(var u=-1,i=t.length,o=i-1,f=n;null!=f&&++u<i;){var a=ro(t[u]),c=r;if(u!=o){var l=f[a];c=e?e(l,a,f):X,c===X&&(c=ca(l)?l:Ti(t[u+1])?[]:{})}Wr(f,a,c),f=f[a]}return n}function cu(n){return to(uc(n))}function lu(n,t,r){var e=-1,u=n.length;t<0&&(t=-t>u?0:u+t),r=r>u?u:r,r<0&&(r+=u),u=t>r?0:r-t>>>0,t>>>=0;for(var i=fl(u);++e<u;)i[e]=n[e+t];return i}function su(n,t){var r;return bs(n,function(n,e,u){return r=t(n,e,u),!r}),!!r}function hu(n,t,r){var e=0,u=null==n?e:n.length;if("number"==typeof t&&t===t&&u<=Bn){for(;e<u;){var i=e+u>>>1,o=n[i];null!==o&&!ma(o)&&(r?o<=t:o<t)?e=i+1:u=i}return u}return pu(n,t,Uc,r)}function pu(n,t,r,e){t=r(t);for(var u=0,i=null==n?0:n.length,o=t!==t,f=null===t,a=ma(t),c=t===X;u<i;){var l=ql((u+i)/2),s=r(n[l]),h=s!==X,p=null===s,v=s===s,_=ma(s);if(o)var g=e||v;else g=c?v&&(e||h):f?v&&h&&(e||!p):a?v&&h&&!p&&(e||!_):!p&&!_&&(e?s<=t:s<t);g?u=l+1:i=l}return Yl(i,Un)}function vu(n,t){for(var r=-1,e=n.length,u=0,i=[];++r<e;){var o=n[r],f=t?t(o):o;if(!r||!Jf(f,a)){var a=f;i[u++]=0===o?0:o}}return i}function _u(n){return"number"==typeof n?n:ma(n)?Ln:+n}function gu(n){if("string"==typeof n)return n;if(mh(n))return l(n,gu)+"";if(ma(n))return ys?ys.call(n):"";var t=n+"";return"0"==t&&1/n==-En?"-0":t}function yu(n,t,r){var e=-1,u=a,i=n.length,o=!0,f=[],l=f;if(r)o=!1,u=c;else if(i>=tn){var s=t?null:Is(n);if(s)return q(s);o=!1,u=W,l=new dr}else l=t?[]:f;n:for(;++e<i;){var h=n[e],p=t?t(h):h;if(h=r||0!==h?h:0,o&&p===p){for(var v=l.length;v--;)if(l[v]===p)continue n;t&&l.push(p),f.push(h)}else u(l,p,r)||(l!==f&&l.push(p),f.push(h))}return f}function du(n,t){return t=Ou(t,n),n=Yi(n,t),null==n||delete n[ro(ko(t))]}function bu(n,t,r,e){return au(n,t,r(de(n,t)),e)}function wu(n,t,r,e){for(var u=n.length,i=e?u:-1;(e?i--:++i<u)&&t(n[i],i,n););return r?lu(n,e?0:i,e?i+1:u):lu(n,e?i+1:0,e?u:i)}function mu(n,t){var r=n;return r instanceof Dt&&(r=r.value()),h(t,function(n,t){return t.func.apply(t.thisArg,s([n],t.args))},r)}function xu(n,t,r){var e=n.length;if(e<2)return e?yu(n[0]):[];for(var u=-1,i=fl(e);++u<e;)for(var o=n[u],f=-1;++f<e;)f!=u&&(i[u]=Jr(i[u]||o,n[f],t,r));return yu(ue(i,1),t,r)}function ju(n,t,r){for(var e=-1,u=n.length,i=t.length,o={};++e<u;){var f=e<i?t[e]:X;r(o,n[e],f)}return o}function Au(n){return Qf(n)?n:[]}function ku(n){return"function"==typeof n?n:Uc}function Ou(n,t){return mh(n)?n:Di(n,t)?[n]:Bs(Wa(n))}function Iu(n,t,r){var e=n.length;return r=r===X?e:r,!t&&r>=e?n:lu(n,t,r)}function Ru(n,t){if(t)return n.slice();var r=n.length,e=Sl?Sl(r):new n.constructor(r);return n.copy(e),e}function zu(n){var t=new n.constructor(n.byteLength);return new El(t).set(new El(n)),t}function Eu(n,t){var r=t?zu(n.buffer):n.buffer;return new n.constructor(r,n.byteOffset,n.byteLength)}function Su(t,r,e){var u=r?e(F(t),an):F(t);return h(u,n,new t.constructor)}function Wu(n){var t=new n.constructor(n.source,Nt.exec(n));return t.lastIndex=n.lastIndex,t}function Lu(n,r,e){var u=r?e(q(n),an):q(n);return h(u,t,new n.constructor)}function Cu(n){return gs?hl(gs.call(n)):{}}function Uu(n,t){var r=t?zu(n.buffer):n.buffer;return new n.constructor(r,n.byteOffset,n.length)}function Bu(n,t){if(n!==t){var r=n!==X,e=null===n,u=n===n,i=ma(n),o=t!==X,f=null===t,a=t===t,c=ma(t);if(!f&&!c&&!i&&n>t||i&&o&&a&&!f&&!c||e&&o&&a||!r&&a||!u)return 1;if(!e&&!i&&!c&&n<t||c&&r&&u&&!e&&!i||f&&r&&u||!o&&u||!a)return-1}return 0}function Tu(n,t,r){for(var e=-1,u=n.criteria,i=t.criteria,o=u.length,f=r.length;++e<o;){var a=Bu(u[e],i[e]);if(a){if(e>=f)return a;var c=r[e];return a*("desc"==c?-1:1)}}return n.index-t.index}function $u(n,t,r,e){for(var u=-1,i=n.length,o=r.length,f=-1,a=t.length,c=Jl(i-o,0),l=fl(a+c),s=!e;++f<a;)l[f]=t[f];for(;++u<o;)(s||u<i)&&(l[r[u]]=n[u]);for(;c--;)l[f++]=n[u++];return l}function Du(n,t,r,e){for(var u=-1,i=n.length,o=-1,f=r.length,a=-1,c=t.length,l=Jl(i-f,0),s=fl(l+c),h=!e;++u<l;)s[u]=n[u];for(var p=u;++a<c;)s[p+a]=t[a];for(;++o<f;)(h||u<i)&&(s[p+r[o]]=n[u++]);return s}function Mu(n,t){var r=-1,e=n.length;for(t||(t=fl(e));++r<e;)t[r]=n[r];return t}function Fu(n,t,r,e){var u=!r;r||(r={});for(var i=-1,o=t.length;++i<o;){var f=t[i],a=e?e(r[f],n[f],f,r,n):X;a===X&&(a=n[f]),u?Tr(r,f,a):Wr(r,f,a)}return r}function Nu(n,t){return Fu(n,zs(n),t)}function Pu(n,t){return Fu(n,Es(n),t)}function qu(n,t){return function(r,u){var i=mh(r)?e:Cr,o=t?t():{};return i(r,n,Ai(u,2),o)}}function Zu(n){return iu(function(t,r){var e=-1,u=r.length,i=u>1?r[u-1]:X,o=u>2?r[2]:X;for(i=n.length>3&&"function"==typeof i?(u--,i):X,o&&$i(r[0],r[1],o)&&(i=u<3?X:i,u=1),t=hl(t);++e<u;){var f=r[e];f&&n(t,f,e,i)}return t})}function Ku(n,t){return function(r,e){if(null==r)return r;if(!Yf(r))return n(r,e);for(var u=r.length,i=t?u:-1,o=hl(r);(t?i--:++i<u)&&e(o[i],i,o)!==!1;);return r}}function Vu(n){return function(t,r,e){for(var u=-1,i=hl(t),o=e(t),f=o.length;f--;){var a=o[n?f:++u];if(r(i[a],a,i)===!1)break}return t}}function Gu(n,t,r){function e(){var t=this&&this!==re&&this instanceof e?i:n;return t.apply(u?r:this,arguments)}var u=t&pn,i=Yu(n);return e}function Hu(n){return function(t){t=Wa(t);var r=$(t)?H(t):X,e=r?r[0]:t.charAt(0),u=r?Iu(r,1).join(""):t.slice(1);return e[n]()+u}}function Ju(n){return function(t){return h(Ec(lc(t).replace($r,"")),n,"")}}function Yu(n){return function(){var t=arguments;switch(t.length){case 0:return new n;case 1:return new n(t[0]);case 2:return new n(t[0],t[1]);case 3:return new n(t[0],t[1],t[2]);case 4:return new n(t[0],t[1],t[2],t[3]);case 5:return new n(t[0],t[1],t[2],t[3],t[4]);case 6:return new n(t[0],t[1],t[2],t[3],t[4],t[5]);case 7:return new n(t[0],t[1],t[2],t[3],t[4],t[5],t[6])}var r=ds(n.prototype),e=n.apply(r,t);return ca(e)?e:r}}function Qu(n,t,e){function u(){for(var o=arguments.length,f=fl(o),a=o,c=ji(u);a--;)f[a]=arguments[a];var l=o<3&&f[0]!==c&&f[o-1]!==c?[]:P(f,c);if(o-=l.length,o<e)return ci(n,t,ti,u.placeholder,X,f,l,X,X,e-o);var s=this&&this!==re&&this instanceof u?i:n;return r(s,this,f)}var i=Yu(n);return u}function Xu(n){return function(t,r,e){var u=hl(t);if(!Yf(t)){var i=Ai(r,3);t=Za(t),r=function(n){return i(u[n],n,u)}}var o=n(t,r,e);return o>-1?u[i?t[o]:o]:X}}function ni(n){return bi(function(t){var r=t.length,e=r,u=Y.prototype.thru;for(n&&t.reverse();e--;){var i=t[e];if("function"!=typeof i)throw new _l(en);if(u&&!o&&"wrapper"==xi(i))var o=new Y([],!0)}for(e=o?e:r;++e<r;){i=t[e];var f=xi(i),a="wrapper"==f?Rs(i):X;o=a&&Fi(a[0])&&a[1]==(wn|gn|dn|mn)&&!a[4].length&&1==a[9]?o[xi(a[0])].apply(o,a[3]):1==i.length&&Fi(i)?o[f]():o.thru(i)}return function(){var n=arguments,e=n[0];if(o&&1==n.length&&mh(e))return o.plant(e).value();for(var u=0,i=r?t[u].apply(this,n):e;++u<r;)i=t[u].call(this,i);return i}})}function ti(n,t,r,e,u,i,o,f,a,c){function l(){for(var y=arguments.length,d=fl(y),b=y;b--;)d[b]=arguments[b];if(v)var w=ji(l),m=U(d,w);if(e&&(d=$u(d,e,u,v)),i&&(d=Du(d,i,o,v)),y-=m,v&&y<c){var x=P(d,w);return ci(n,t,ti,l.placeholder,r,d,x,f,a,c-y)}var j=h?r:this,A=p?j[n]:n;return y=d.length,f?d=Qi(d,f):_&&y>1&&d.reverse(),s&&a<y&&(d.length=a),this&&this!==re&&this instanceof l&&(A=g||Yu(A)),A.apply(j,d)}var s=t&wn,h=t&pn,p=t&vn,v=t&(gn|yn),_=t&xn,g=p?X:Yu(n);return l}function ri(n,t){return function(r,e){return Ie(r,n,t(e),{})}}function ei(n,t){return function(r,e){var u;if(r===X&&e===X)return t;if(r!==X&&(u=r),e!==X){if(u===X)return e;"string"==typeof r||"string"==typeof e?(r=gu(r),e=gu(e)):(r=_u(r),e=_u(e)),u=n(r,e)}return u}}function ui(n){return bi(function(t){return t=l(t,E(Ai())),iu(function(e){var u=this;return n(t,function(n){return r(n,u,e)})})})}function ii(n,t){t=t===X?" ":gu(t);var r=t.length;if(r<2)return r?uu(t,n):t;var e=uu(t,Pl(n/G(t)));return $(t)?Iu(H(e),0,n).join(""):e.slice(0,n)}function oi(n,t,e,u){function i(){for(var t=-1,a=arguments.length,c=-1,l=u.length,s=fl(l+a),h=this&&this!==re&&this instanceof i?f:n;++c<l;)s[c]=u[c];for(;a--;)s[c++]=arguments[++t];return r(h,o?e:this,s)}var o=t&pn,f=Yu(n);return i}function fi(n){return function(t,r,e){return e&&"number"!=typeof e&&$i(t,r,e)&&(r=e=X),t=Oa(t),r===X?(r=t,t=0):r=Oa(r),e=e===X?t<r?1:-1:Oa(e),eu(t,r,e,n)}}function ai(n){return function(t,r){return"string"==typeof t&&"string"==typeof r||(t=za(t),r=za(r)),n(t,r)}}function ci(n,t,r,e,u,i,o,f,a,c){var l=t&gn,s=l?o:X,h=l?X:o,p=l?i:X,v=l?X:i;t|=l?dn:bn,t&=~(l?bn:dn),t&_n||(t&=~(pn|vn));var _=[n,t,u,p,s,v,h,f,a,c],g=r.apply(X,_);return Fi(n)&&Ls(g,_),g.placeholder=e,Xi(g,n,t)}function li(n){var t=sl[n];return function(n,r){if(n=za(n),r=null==r?0:Yl(Ia(r),292)){var e=(Wa(n)+"e").split("e"),u=t(e[0]+"e"+(+e[1]+r));return e=(Wa(u)+"e").split("e"),+(e[0]+"e"+(+e[1]-r))}return t(n)}}function si(n){return function(t){var r=Ss(t);return r==Vn?F(t):r==nt?Z(t):z(t,n(t))}}function hi(n,t,r,e,u,i,o,f){var a=t&vn;if(!a&&"function"!=typeof n)throw new _l(en);var c=e?e.length:0;if(c||(t&=~(dn|bn),e=u=X),o=o===X?o:Jl(Ia(o),0),f=f===X?f:Ia(f),c-=u?u.length:0,t&bn){var l=e,s=u;e=u=X}var h=a?X:Rs(n),p=[n,t,r,e,u,l,s,i,o,f];if(h&&Vi(p,h),n=p[0],t=p[1],r=p[2],e=p[3],u=p[4],f=p[9]=p[9]===X?a?0:n.length:Jl(p[9]-c,0),!f&&t&(gn|yn)&&(t&=~(gn|yn)),t&&t!=pn)v=t==gn||t==yn?Qu(n,t,f):t!=dn&&t!=(pn|dn)||u.length?ti.apply(X,p):oi(n,t,r,e);else var v=Gu(n,t,r);var _=h?js:Ls;return Xi(_(v,p),n,t)}function pi(n,t,r,e){return n===X||Jf(n,dl[r])&&!ml.call(e,r)?t:n}function vi(n,t,r,e,u,i){return ca(n)&&ca(t)&&(i.set(t,n),Ve(n,t,X,vi,i),i.delete(t)),n}function _i(n){return da(n)?X:n}function gi(n,t,r,e,u,i){var o=r&sn,f=n.length,a=t.length;if(f!=a&&!(o&&a>f))return!1;var c=i.get(n);if(c&&i.get(t))return c==t;var l=-1,s=!0,h=r&hn?new dr:X;for(i.set(n,t),i.set(t,n);++l<f;){var p=n[l],_=t[l];if(e)var g=o?e(_,p,l,t,n,i):e(p,_,l,n,t,i);if(g!==X){if(g)continue;s=!1;break}if(h){if(!v(t,function(n,t){if(!W(h,t)&&(p===n||u(p,n,r,e,i)))return h.push(t)})){s=!1;break}}else if(p!==_&&!u(p,_,r,e,i)){s=!1;break}}return i.delete(n),i.delete(t),s}function yi(n,t,r,e,u,i,o){switch(r){case ft:if(n.byteLength!=t.byteLength||n.byteOffset!=t.byteOffset)return!1;n=n.buffer,t=t.buffer;case ot:return!(n.byteLength!=t.byteLength||!i(new El(n),new El(t)));case Fn:case Nn:case Gn:return Jf(+n,+t);case qn:return n.name==t.name&&n.message==t.message;case Xn:case tt:return n==t+"";case Vn:var f=F;case nt:var a=e&sn;if(f||(f=q),n.size!=t.size&&!a)return!1;var c=o.get(n);if(c)return c==t;e|=hn,o.set(n,t);var l=gi(f(n),f(t),e,u,i,o);return o.delete(n),l;case rt:if(gs)return gs.call(n)==gs.call(t)}return!1}function di(n,t,r,e,u,i){var o=r&sn,f=wi(n),a=f.length,c=wi(t),l=c.length;if(a!=l&&!o)return!1;for(var s=a;s--;){var h=f[s];if(!(o?h in t:ml.call(t,h)))return!1}var p=i.get(n);if(p&&i.get(t))return p==t;var v=!0;i.set(n,t),i.set(t,n);for(var _=o;++s<a;){h=f[s];var g=n[h],y=t[h];if(e)var d=o?e(y,g,h,t,n,i):e(g,y,h,n,t,i);if(!(d===X?g===y||u(g,y,r,e,i):d)){v=!1;break}_||(_="constructor"==h)}if(v&&!_){var b=n.constructor,w=t.constructor;b!=w&&"constructor"in n&&"constructor"in t&&!("function"==typeof b&&b instanceof b&&"function"==typeof w&&w instanceof w)&&(v=!1);
+}return i.delete(n),i.delete(t),v}function bi(n){return Us(Ji(n,X,go),n+"")}function wi(n){return we(n,Za,zs)}function mi(n){return we(n,Ka,Es)}function xi(n){for(var t=n.name+"",r=cs[t],e=ml.call(cs,t)?r.length:0;e--;){var u=r[e],i=u.func;if(null==i||i==n)return u.name}return t}function ji(n){var t=ml.call(K,"placeholder")?K:n;return t.placeholder}function Ai(){var n=K.iteratee||Bc;return n=n===Bc?Me:n,arguments.length?n(arguments[0],arguments[1]):n}function ki(n,t){var r=n.__data__;return Mi(t)?r["string"==typeof t?"string":"hash"]:r.map}function Oi(n){for(var t=Za(n),r=t.length;r--;){var e=t[r],u=n[e];t[r]=[e,u,qi(u)]}return t}function Ii(n,t){var r=T(n,t);return Be(r)?r:X}function Ri(n){var t=ml.call(n,$l),r=n[$l];try{n[$l]=X;var e=!0}catch(n){}var u=Al.call(n);return e&&(t?n[$l]=r:delete n[$l]),u}function zi(n,t,r){for(var e=-1,u=r.length;++e<u;){var i=r[e],o=i.size;switch(i.type){case"drop":n+=o;break;case"dropRight":t-=o;break;case"take":t=Yl(t,n+o);break;case"takeRight":n=Jl(n,t-o)}}return{start:n,end:t}}function Ei(n){var t=n.match(Tt);return t?t[1].split($t):[]}function Si(n,t,r){t=Ou(t,n);for(var e=-1,u=t.length,i=!1;++e<u;){var o=ro(t[e]);if(!(i=null!=n&&r(n,o)))break;n=n[o]}return i||++e!=u?i:(u=null==n?0:n.length,!!u&&aa(u)&&Ti(o,u)&&(mh(n)||wh(n)))}function Wi(n){var t=n.length,r=n.constructor(t);return t&&"string"==typeof n[0]&&ml.call(n,"index")&&(r.index=n.index,r.input=n.input),r}function Li(n){return"function"!=typeof n.constructor||Pi(n)?{}:ds(Wl(n))}function Ci(n,t,r,e){var u=n.constructor;switch(t){case ot:return zu(n);case Fn:case Nn:return new u(+n);case ft:return Eu(n,e);case at:case ct:case lt:case st:case ht:case pt:case vt:case _t:case gt:return Uu(n,e);case Vn:return Su(n,e,r);case Gn:case tt:return new u(n);case Xn:return Wu(n);case nt:return Lu(n,e,r);case rt:return Cu(n)}}function Ui(n,t){var r=t.length;if(!r)return n;var e=r-1;return t[e]=(r>1?"& ":"")+t[e],t=t.join(r>2?", ":" "),n.replace(Bt,"{\n/* [wrapped with "+t+"] */\n")}function Bi(n){return mh(n)||wh(n)||!!(Bl&&n&&n[Bl])}function Ti(n,t){return t=null==t?Sn:t,!!t&&("number"==typeof n||Vt.test(n))&&n>-1&&n%1==0&&n<t}function $i(n,t,r){if(!ca(r))return!1;var e=typeof t;return!!("number"==e?Yf(r)&&Ti(t,r.length):"string"==e&&t in r)&&Jf(r[t],n)}function Di(n,t){if(mh(n))return!1;var r=typeof n;return!("number"!=r&&"symbol"!=r&&"boolean"!=r&&null!=n&&!ma(n))||(Rt.test(n)||!It.test(n)||null!=t&&n in hl(t))}function Mi(n){var t=typeof n;return"string"==t||"number"==t||"symbol"==t||"boolean"==t?"__proto__"!==n:null===n}function Fi(n){var t=xi(n),r=K[t];if("function"!=typeof r||!(t in Dt.prototype))return!1;if(n===r)return!0;var e=Rs(r);return!!e&&n===e[0]}function Ni(n){return!!jl&&jl in n}function Pi(n){var t=n&&n.constructor,r="function"==typeof t&&t.prototype||dl;return n===r}function qi(n){return n===n&&!ca(n)}function Zi(n,t){return function(r){return null!=r&&(r[n]===t&&(t!==X||n in hl(r)))}}function Ki(n){var t=Bf(n,function(n){return r.size===on&&r.clear(),n}),r=t.cache;return t}function Vi(n,t){var r=n[1],e=t[1],u=r|e,i=u<(pn|vn|wn),o=e==wn&&r==gn||e==wn&&r==mn&&n[7].length<=t[8]||e==(wn|mn)&&t[7].length<=t[8]&&r==gn;if(!i&&!o)return n;e&pn&&(n[2]=t[2],u|=r&pn?0:_n);var f=t[3];if(f){var a=n[3];n[3]=a?$u(a,f,t[4]):f,n[4]=a?P(n[3],fn):t[4]}return f=t[5],f&&(a=n[5],n[5]=a?Du(a,f,t[6]):f,n[6]=a?P(n[5],fn):t[6]),f=t[7],f&&(n[7]=f),e&wn&&(n[8]=null==n[8]?t[8]:Yl(n[8],t[8])),null==n[9]&&(n[9]=t[9]),n[0]=t[0],n[1]=u,n}function Gi(n){var t=[];if(null!=n)for(var r in hl(n))t.push(r);return t}function Hi(n){return Al.call(n)}function Ji(n,t,e){return t=Jl(t===X?n.length-1:t,0),function(){for(var u=arguments,i=-1,o=Jl(u.length-t,0),f=fl(o);++i<o;)f[i]=u[t+i];i=-1;for(var a=fl(t+1);++i<t;)a[i]=u[i];return a[t]=e(f),r(n,this,a)}}function Yi(n,t){return t.length<2?n:de(n,lu(t,0,-1))}function Qi(n,t){for(var r=n.length,e=Yl(t.length,r),u=Mu(n);e--;){var i=t[e];n[e]=Ti(i,r)?u[i]:X}return n}function Xi(n,t,r){var e=t+"";return Us(n,Ui(e,uo(Ei(e),r)))}function no(n){var t=0,r=0;return function(){var e=Ql(),u=On-(e-r);if(r=e,u>0){if(++t>=kn)return arguments[0]}else t=0;return n.apply(X,arguments)}}function to(n,t){var r=-1,e=n.length,u=e-1;for(t=t===X?e:t;++r<t;){var i=ru(r,u),o=n[i];n[i]=n[r],n[r]=o}return n.length=t,n}function ro(n){if("string"==typeof n||ma(n))return n;var t=n+"";return"0"==t&&1/n==-En?"-0":t}function eo(n){if(null!=n){try{return wl.call(n)}catch(n){}try{return n+""}catch(n){}}return""}function uo(n,t){return u(Tn,function(r){var e="_."+r[0];t&r[1]&&!a(n,e)&&n.push(e)}),n.sort()}function io(n){if(n instanceof Dt)return n.clone();var t=new Y(n.__wrapped__,n.__chain__);return t.__actions__=Mu(n.__actions__),t.__index__=n.__index__,t.__values__=n.__values__,t}function oo(n,t,r){t=(r?$i(n,t,r):t===X)?1:Jl(Ia(t),0);var e=null==n?0:n.length;if(!e||t<1)return[];for(var u=0,i=0,o=fl(Pl(e/t));u<e;)o[i++]=lu(n,u,u+=t);return o}function fo(n){for(var t=-1,r=null==n?0:n.length,e=0,u=[];++t<r;){var i=n[t];i&&(u[e++]=i)}return u}function ao(){var n=arguments.length;if(!n)return[];for(var t=fl(n-1),r=arguments[0],e=n;e--;)t[e-1]=arguments[e];return s(mh(r)?Mu(r):[r],ue(t,1))}function co(n,t,r){var e=null==n?0:n.length;return e?(t=r||t===X?1:Ia(t),lu(n,t<0?0:t,e)):[]}function lo(n,t,r){var e=null==n?0:n.length;return e?(t=r||t===X?1:Ia(t),t=e-t,lu(n,0,t<0?0:t)):[]}function so(n,t){return n&&n.length?wu(n,Ai(t,3),!0,!0):[]}function ho(n,t){return n&&n.length?wu(n,Ai(t,3),!0):[]}function po(n,t,r,e){var u=null==n?0:n.length;return u?(r&&"number"!=typeof r&&$i(n,t,r)&&(r=0,e=u),te(n,t,r,e)):[]}function vo(n,t,r){var e=null==n?0:n.length;if(!e)return-1;var u=null==r?0:Ia(r);return u<0&&(u=Jl(e+u,0)),d(n,Ai(t,3),u)}function _o(n,t,r){var e=null==n?0:n.length;if(!e)return-1;var u=e-1;return r!==X&&(u=Ia(r),u=r<0?Jl(e+u,0):Yl(u,e-1)),d(n,Ai(t,3),u,!0)}function go(n){var t=null==n?0:n.length;return t?ue(n,1):[]}function yo(n){var t=null==n?0:n.length;return t?ue(n,En):[]}function bo(n,t){var r=null==n?0:n.length;return r?(t=t===X?1:Ia(t),ue(n,t)):[]}function wo(n){for(var t=-1,r=null==n?0:n.length,e={};++t<r;){var u=n[t];e[u[0]]=u[1]}return e}function mo(n){return n&&n.length?n[0]:X}function xo(n,t,r){var e=null==n?0:n.length;if(!e)return-1;var u=null==r?0:Ia(r);return u<0&&(u=Jl(e+u,0)),b(n,t,u)}function jo(n){var t=null==n?0:n.length;return t?lu(n,0,-1):[]}function Ao(n,t){return null==n?"":Gl.call(n,t)}function ko(n){var t=null==n?0:n.length;return t?n[t-1]:X}function Oo(n,t,r){var e=null==n?0:n.length;if(!e)return-1;var u=e;return r!==X&&(u=Ia(r),u=u<0?Jl(e+u,0):Yl(u,e-1)),t===t?V(n,t,u):d(n,m,u,!0)}function Io(n,t){return n&&n.length?He(n,Ia(t)):X}function Ro(n,t){return n&&n.length&&t&&t.length?nu(n,t):n}function zo(n,t,r){return n&&n.length&&t&&t.length?nu(n,t,Ai(r,2)):n}function Eo(n,t,r){return n&&n.length&&t&&t.length?nu(n,t,X,r):n}function So(n,t){var r=[];if(!n||!n.length)return r;var e=-1,u=[],i=n.length;for(t=Ai(t,3);++e<i;){var o=n[e];t(o,e,n)&&(r.push(o),u.push(e))}return tu(n,u),r}function Wo(n){return null==n?n:ts.call(n)}function Lo(n,t,r){var e=null==n?0:n.length;return e?(r&&"number"!=typeof r&&$i(n,t,r)?(t=0,r=e):(t=null==t?0:Ia(t),r=r===X?e:Ia(r)),lu(n,t,r)):[]}function Co(n,t){return hu(n,t)}function Uo(n,t,r){return pu(n,t,Ai(r,2))}function Bo(n,t){var r=null==n?0:n.length;if(r){var e=hu(n,t);if(e<r&&Jf(n[e],t))return e}return-1}function To(n,t){return hu(n,t,!0)}function $o(n,t,r){return pu(n,t,Ai(r,2),!0)}function Do(n,t){var r=null==n?0:n.length;if(r){var e=hu(n,t,!0)-1;if(Jf(n[e],t))return e}return-1}function Mo(n){return n&&n.length?vu(n):[]}function Fo(n,t){return n&&n.length?vu(n,Ai(t,2)):[]}function No(n){var t=null==n?0:n.length;return t?lu(n,1,t):[]}function Po(n,t,r){return n&&n.length?(t=r||t===X?1:Ia(t),lu(n,0,t<0?0:t)):[]}function qo(n,t,r){var e=null==n?0:n.length;return e?(t=r||t===X?1:Ia(t),t=e-t,lu(n,t<0?0:t,e)):[]}function Zo(n,t){return n&&n.length?wu(n,Ai(t,3),!1,!0):[]}function Ko(n,t){return n&&n.length?wu(n,Ai(t,3)):[]}function Vo(n){return n&&n.length?yu(n):[]}function Go(n,t){return n&&n.length?yu(n,Ai(t,2)):[]}function Ho(n,t){return t="function"==typeof t?t:X,n&&n.length?yu(n,X,t):[]}function Jo(n){if(!n||!n.length)return[];var t=0;return n=f(n,function(n){if(Qf(n))return t=Jl(n.length,t),!0}),R(t,function(t){return l(n,j(t))})}function Yo(n,t){if(!n||!n.length)return[];var e=Jo(n);return null==t?e:l(e,function(n){return r(t,X,n)})}function Qo(n,t){return ju(n||[],t||[],Wr)}function Xo(n,t){return ju(n||[],t||[],au)}function nf(n){var t=K(n);return t.__chain__=!0,t}function tf(n,t){return t(n),n}function rf(n,t){return t(n)}function ef(){return nf(this)}function uf(){return new Y(this.value(),this.__chain__)}function of(){this.__values__===X&&(this.__values__=ka(this.value()));var n=this.__index__>=this.__values__.length,t=n?X:this.__values__[this.__index__++];return{done:n,value:t}}function ff(){return this}function af(n){for(var t,r=this;r instanceof J;){var e=io(r);e.__index__=0,e.__values__=X,t?u.__wrapped__=e:t=e;var u=e;r=r.__wrapped__}return u.__wrapped__=n,t}function cf(){var n=this.__wrapped__;if(n instanceof Dt){var t=n;return this.__actions__.length&&(t=new Dt(this)),t=t.reverse(),t.__actions__.push({func:rf,args:[Wo],thisArg:X}),new Y(t,this.__chain__)}return this.thru(Wo)}function lf(){return mu(this.__wrapped__,this.__actions__)}function sf(n,t,r){var e=mh(n)?o:Yr;return r&&$i(n,t,r)&&(t=X),e(n,Ai(t,3))}function hf(n,t){var r=mh(n)?f:ee;return r(n,Ai(t,3))}function pf(n,t){return ue(bf(n,t),1)}function vf(n,t){return ue(bf(n,t),En)}function _f(n,t,r){return r=r===X?1:Ia(r),ue(bf(n,t),r)}function gf(n,t){var r=mh(n)?u:bs;return r(n,Ai(t,3))}function yf(n,t){var r=mh(n)?i:ws;return r(n,Ai(t,3))}function df(n,t,r,e){n=Yf(n)?n:uc(n),r=r&&!e?Ia(r):0;var u=n.length;return r<0&&(r=Jl(u+r,0)),wa(n)?r<=u&&n.indexOf(t,r)>-1:!!u&&b(n,t,r)>-1}function bf(n,t){var r=mh(n)?l:qe;return r(n,Ai(t,3))}function wf(n,t,r,e){return null==n?[]:(mh(t)||(t=null==t?[]:[t]),r=e?X:r,mh(r)||(r=null==r?[]:[r]),Je(n,t,r))}function mf(n,t,r){var e=mh(n)?h:k,u=arguments.length<3;return e(n,Ai(t,4),r,u,bs)}function xf(n,t,r){var e=mh(n)?p:k,u=arguments.length<3;return e(n,Ai(t,4),r,u,ws)}function jf(n,t){var r=mh(n)?f:ee;return r(n,Tf(Ai(t,3)))}function Af(n){var t=mh(n)?Rr:ou;return t(n)}function kf(n,t,r){t=(r?$i(n,t,r):t===X)?1:Ia(t);var e=mh(n)?zr:fu;return e(n,t)}function Of(n){var t=mh(n)?Er:cu;return t(n)}function If(n){if(null==n)return 0;if(Yf(n))return wa(n)?G(n):n.length;var t=Ss(n);return t==Vn||t==nt?n.size:Fe(n).length}function Rf(n,t,r){var e=mh(n)?v:su;return r&&$i(n,t,r)&&(t=X),e(n,Ai(t,3))}function zf(n,t){if("function"!=typeof t)throw new _l(en);return n=Ia(n),function(){if(--n<1)return t.apply(this,arguments)}}function Ef(n,t,r){return t=r?X:t,t=n&&null==t?n.length:t,hi(n,wn,X,X,X,X,t)}function Sf(n,t){var r;if("function"!=typeof t)throw new _l(en);return n=Ia(n),function(){return--n>0&&(r=t.apply(this,arguments)),n<=1&&(t=X),r}}function Wf(n,t,r){t=r?X:t;var e=hi(n,gn,X,X,X,X,X,t);return e.placeholder=Wf.placeholder,e}function Lf(n,t,r){t=r?X:t;var e=hi(n,yn,X,X,X,X,X,t);return e.placeholder=Lf.placeholder,e}function Cf(n,t,r){function e(t){var r=h,e=p;return h=p=X,d=t,_=n.apply(e,r)}function u(n){return d=n,g=Cs(f,t),b?e(n):_}function i(n){var r=n-y,e=n-d,u=t-r;return w?Yl(u,v-e):u}function o(n){var r=n-y,e=n-d;return y===X||r>=t||r<0||w&&e>=v}function f(){var n=ch();return o(n)?a(n):void(g=Cs(f,i(n)))}function a(n){return g=X,m&&h?e(n):(h=p=X,_)}function c(){g!==X&&Os(g),d=0,h=y=p=g=X}function l(){return g===X?_:a(ch())}function s(){var n=ch(),r=o(n);if(h=arguments,p=this,y=n,r){if(g===X)return u(y);if(w)return g=Cs(f,t),e(y)}return g===X&&(g=Cs(f,t)),_}var h,p,v,_,g,y,d=0,b=!1,w=!1,m=!0;if("function"!=typeof n)throw new _l(en);return t=za(t)||0,ca(r)&&(b=!!r.leading,w="maxWait"in r,v=w?Jl(za(r.maxWait)||0,t):v,m="trailing"in r?!!r.trailing:m),s.cancel=c,s.flush=l,s}function Uf(n){return hi(n,xn)}function Bf(n,t){if("function"!=typeof n||null!=t&&"function"!=typeof t)throw new _l(en);var r=function(){var e=arguments,u=t?t.apply(this,e):e[0],i=r.cache;if(i.has(u))return i.get(u);var o=n.apply(this,e);return r.cache=i.set(u,o)||i,o};return r.cache=new(Bf.Cache||hr),r}function Tf(n){if("function"!=typeof n)throw new _l(en);return function(){var t=arguments;switch(t.length){case 0:return!n.call(this);case 1:return!n.call(this,t[0]);case 2:return!n.call(this,t[0],t[1]);case 3:return!n.call(this,t[0],t[1],t[2])}return!n.apply(this,t)}}function $f(n){return Sf(2,n)}function Df(n,t){if("function"!=typeof n)throw new _l(en);return t=t===X?t:Ia(t),iu(n,t)}function Mf(n,t){if("function"!=typeof n)throw new _l(en);return t=null==t?0:Jl(Ia(t),0),iu(function(e){var u=e[t],i=Iu(e,0,t);return u&&s(i,u),r(n,this,i)})}function Ff(n,t,r){var e=!0,u=!0;if("function"!=typeof n)throw new _l(en);return ca(r)&&(e="leading"in r?!!r.leading:e,u="trailing"in r?!!r.trailing:u),Cf(n,t,{leading:e,maxWait:t,trailing:u})}function Nf(n){return Ef(n,1)}function Pf(n,t){return _h(ku(t),n)}function qf(){if(!arguments.length)return[];var n=arguments[0];return mh(n)?n:[n]}function Zf(n){return Nr(n,ln)}function Kf(n,t){return t="function"==typeof t?t:X,Nr(n,ln,t)}function Vf(n){return Nr(n,an|ln)}function Gf(n,t){return t="function"==typeof t?t:X,Nr(n,an|ln,t)}function Hf(n,t){return null==t||Gr(n,t,Za(t))}function Jf(n,t){return n===t||n!==n&&t!==t}function Yf(n){return null!=n&&aa(n.length)&&!oa(n)}function Qf(n){return la(n)&&Yf(n)}function Xf(n){return n===!0||n===!1||la(n)&&me(n)==Fn}function na(n){return la(n)&&1===n.nodeType&&!da(n)}function ta(n){if(null==n)return!0;if(Yf(n)&&(mh(n)||"string"==typeof n||"function"==typeof n.splice||jh(n)||Rh(n)||wh(n)))return!n.length;var t=Ss(n);if(t==Vn||t==nt)return!n.size;if(Pi(n))return!Fe(n).length;for(var r in n)if(ml.call(n,r))return!1;return!0}function ra(n,t){return We(n,t)}function ea(n,t,r){r="function"==typeof r?r:X;var e=r?r(n,t):X;return e===X?We(n,t,X,r):!!e}function ua(n){if(!la(n))return!1;var t=me(n);return t==qn||t==Pn||"string"==typeof n.message&&"string"==typeof n.name&&!da(n)}function ia(n){return"number"==typeof n&&Vl(n)}function oa(n){if(!ca(n))return!1;var t=me(n);return t==Zn||t==Kn||t==Mn||t==Qn}function fa(n){return"number"==typeof n&&n==Ia(n)}function aa(n){return"number"==typeof n&&n>-1&&n%1==0&&n<=Sn}function ca(n){var t=typeof n;return null!=n&&("object"==t||"function"==t)}function la(n){return null!=n&&"object"==typeof n}function sa(n,t){return n===t||Ue(n,t,Oi(t))}function ha(n,t,r){return r="function"==typeof r?r:X,Ue(n,t,Oi(t),r)}function pa(n){return ya(n)&&n!=+n}function va(n){if(Ws(n))throw new cl(rn);return Be(n)}function _a(n){return null===n}function ga(n){return null==n}function ya(n){return"number"==typeof n||la(n)&&me(n)==Gn}function da(n){if(!la(n)||me(n)!=Jn)return!1;var t=Wl(n);if(null===t)return!0;var r=ml.call(t,"constructor")&&t.constructor;return"function"==typeof r&&r instanceof r&&wl.call(r)==kl}function ba(n){return fa(n)&&n>=-Sn&&n<=Sn}function wa(n){return"string"==typeof n||!mh(n)&&la(n)&&me(n)==tt}function ma(n){return"symbol"==typeof n||la(n)&&me(n)==rt}function xa(n){return n===X}function ja(n){return la(n)&&Ss(n)==ut}function Aa(n){return la(n)&&me(n)==it}function ka(n){if(!n)return[];if(Yf(n))return wa(n)?H(n):Mu(n);if(Tl&&n[Tl])return M(n[Tl]());var t=Ss(n),r=t==Vn?F:t==nt?q:uc;return r(n)}function Oa(n){if(!n)return 0===n?n:0;if(n=za(n),n===En||n===-En){var t=n<0?-1:1;return t*Wn}return n===n?n:0}function Ia(n){var t=Oa(n),r=t%1;return t===t?r?t-r:t:0}function Ra(n){return n?Fr(Ia(n),0,Cn):0}function za(n){if("number"==typeof n)return n;if(ma(n))return Ln;if(ca(n)){var t="function"==typeof n.valueOf?n.valueOf():n;n=ca(t)?t+"":t}if("string"!=typeof n)return 0===n?n:+n;n=n.replace(Lt,"");var r=qt.test(n);return r||Kt.test(n)?Xr(n.slice(2),r?2:8):Pt.test(n)?Ln:+n}function Ea(n){return Fu(n,Ka(n))}function Sa(n){return n?Fr(Ia(n),-Sn,Sn):0===n?n:0}function Wa(n){return null==n?"":gu(n)}function La(n,t){var r=ds(n);return null==t?r:Ur(r,t)}function Ca(n,t){return y(n,Ai(t,3),oe)}function Ua(n,t){return y(n,Ai(t,3),fe)}function Ba(n,t){return null==n?n:ms(n,Ai(t,3),Ka)}function Ta(n,t){return null==n?n:xs(n,Ai(t,3),Ka)}function $a(n,t){return n&&oe(n,Ai(t,3))}function Da(n,t){return n&&fe(n,Ai(t,3))}function Ma(n){return null==n?[]:ve(n,Za(n))}function Fa(n){return null==n?[]:ve(n,Ka(n))}function Na(n,t,r){var e=null==n?X:de(n,t);return e===X?r:e}function Pa(n,t){return null!=n&&Si(n,t,je)}function qa(n,t){return null!=n&&Si(n,t,Ae)}function Za(n){return Yf(n)?Ir(n):Fe(n)}function Ka(n){return Yf(n)?Ir(n,!0):Ne(n)}function Va(n,t){var r={};return t=Ai(t,3),oe(n,function(n,e,u){Tr(r,t(n,e,u),n)}),r}function Ga(n,t){var r={};return t=Ai(t,3),oe(n,function(n,e,u){Tr(r,e,t(n,e,u))}),r}function Ha(n,t){return Ja(n,Tf(Ai(t)))}function Ja(n,t){if(null==n)return{};var r=l(mi(n),function(n){return[n]});return t=Ai(t),Qe(n,r,function(n,r){return t(n,r[0])})}function Ya(n,t,r){t=Ou(t,n);var e=-1,u=t.length;for(u||(u=1,n=X);++e<u;){var i=null==n?X:n[ro(t[e])];i===X&&(e=u,i=r),n=oa(i)?i.call(n):i}return n}function Qa(n,t,r){return null==n?n:au(n,t,r)}function Xa(n,t,r,e){return e="function"==typeof e?e:X,null==n?n:au(n,t,r,e)}function nc(n,t,r){var e=mh(n),i=e||jh(n)||Rh(n);if(t=Ai(t,4),null==r){var o=n&&n.constructor;r=i?e?new o:[]:ca(n)&&oa(o)?ds(Wl(n)):{}}return(i?u:oe)(n,function(n,e,u){return t(r,n,e,u)}),r}function tc(n,t){return null==n||du(n,t)}function rc(n,t,r){return null==n?n:bu(n,t,ku(r))}function ec(n,t,r,e){return e="function"==typeof e?e:X,null==n?n:bu(n,t,ku(r),e)}function uc(n){return null==n?[]:S(n,Za(n))}function ic(n){return null==n?[]:S(n,Ka(n))}function oc(n,t,r){return r===X&&(r=t,t=X),r!==X&&(r=za(r),r=r===r?r:0),t!==X&&(t=za(t),t=t===t?t:0),Fr(za(n),t,r)}function fc(n,t,r){return t=Oa(t),r===X?(r=t,t=0):r=Oa(r),n=za(n),ke(n,t,r)}function ac(n,t,r){if(r&&"boolean"!=typeof r&&$i(n,t,r)&&(t=r=X),r===X&&("boolean"==typeof t?(r=t,t=X):"boolean"==typeof n&&(r=n,n=X)),n===X&&t===X?(n=0,t=1):(n=Oa(n),t===X?(t=n,n=0):t=Oa(t)),n>t){var e=n;n=t,t=e}if(r||n%1||t%1){var u=ns();return Yl(n+u*(t-n+Qr("1e-"+((u+"").length-1))),t)}return ru(n,t)}function cc(n){return np(Wa(n).toLowerCase())}function lc(n){return n=Wa(n),n&&n.replace(Gt,_e).replace(Dr,"")}function sc(n,t,r){n=Wa(n),t=gu(t);var e=n.length;r=r===X?e:Fr(Ia(r),0,e);var u=r;return r-=t.length,r>=0&&n.slice(r,u)==t}function hc(n){return n=Wa(n),n&&jt.test(n)?n.replace(mt,ge):n}function pc(n){return n=Wa(n),n&&Wt.test(n)?n.replace(St,"\\$&"):n}function vc(n,t,r){n=Wa(n),t=Ia(t);var e=t?G(n):0;if(!t||e>=t)return n;var u=(t-e)/2;return ii(ql(u),r)+n+ii(Pl(u),r)}function _c(n,t,r){n=Wa(n),t=Ia(t);var e=t?G(n):0;return t&&e<t?n+ii(t-e,r):n}function gc(n,t,r){n=Wa(n),t=Ia(t);var e=t?G(n):0;return t&&e<t?ii(t-e,r)+n:n}function yc(n,t,r){return r||null==t?t=0:t&&(t=+t),Xl(Wa(n).replace(Ct,""),t||0)}function dc(n,t,r){return t=(r?$i(n,t,r):t===X)?1:Ia(t),uu(Wa(n),t)}function bc(){var n=arguments,t=Wa(n[0]);return n.length<3?t:t.replace(n[1],n[2])}function wc(n,t,r){return r&&"number"!=typeof r&&$i(n,t,r)&&(t=r=X),(r=r===X?Cn:r>>>0)?(n=Wa(n),n&&("string"==typeof t||null!=t&&!Oh(t))&&(t=gu(t),!t&&$(n))?Iu(H(n),0,r):n.split(t,r)):[]}function mc(n,t,r){return n=Wa(n),r=null==r?0:Fr(Ia(r),0,n.length),t=gu(t),n.slice(r,r+t.length)==t}function xc(n,t,r){var e=K.templateSettings;r&&$i(n,t,r)&&(t=X),n=Wa(n),t=Lh({},t,e,pi);var u,i,o=Lh({},t.imports,e.imports,pi),f=Za(o),a=S(o,f),c=0,l=t.interpolate||Ht,s="__p += '",h=pl((t.escape||Ht).source+"|"+l.source+"|"+(l===Ot?Ft:Ht).source+"|"+(t.evaluate||Ht).source+"|$","g"),p="//# sourceURL="+("sourceURL"in t?t.sourceURL:"lodash.templateSources["+ ++Zr+"]")+"\n";n.replace(h,function(t,r,e,o,f,a){return e||(e=o),s+=n.slice(c,a).replace(Jt,B),r&&(u=!0,s+="' +\n__e("+r+") +\n'"),f&&(i=!0,s+="';\n"+f+";\n__p += '"),e&&(s+="' +\n((__t = ("+e+")) == null ? '' : __t) +\n'"),c=a+t.length,t}),s+="';\n";var v=t.variable;v||(s="with (obj) {\n"+s+"\n}\n"),s=(i?s.replace(yt,""):s).replace(dt,"$1").replace(bt,"$1;"),s="function("+(v||"obj")+") {\n"+(v?"":"obj || (obj = {});\n")+"var __t, __p = ''"+(u?", __e = _.escape":"")+(i?", __j = Array.prototype.join;\nfunction print() { __p += __j.call(arguments, '') }\n":";\n")+s+"return __p\n}";var _=tp(function(){return ll(f,p+"return "+s).apply(X,a)});if(_.source=s,ua(_))throw _;return _}function jc(n){return Wa(n).toLowerCase()}function Ac(n){return Wa(n).toUpperCase()}function kc(n,t,r){if(n=Wa(n),n&&(r||t===X))return n.replace(Lt,"");if(!n||!(t=gu(t)))return n;var e=H(n),u=H(t),i=L(e,u),o=C(e,u)+1;return Iu(e,i,o).join("")}function Oc(n,t,r){if(n=Wa(n),n&&(r||t===X))return n.replace(Ut,"");if(!n||!(t=gu(t)))return n;var e=H(n),u=C(e,H(t))+1;return Iu(e,0,u).join("")}function Ic(n,t,r){if(n=Wa(n),n&&(r||t===X))return n.replace(Ct,"");if(!n||!(t=gu(t)))return n;var e=H(n),u=L(e,H(t));return Iu(e,u).join("")}function Rc(n,t){var r=jn,e=An;if(ca(t)){var u="separator"in t?t.separator:u;r="length"in t?Ia(t.length):r,e="omission"in t?gu(t.omission):e}n=Wa(n);var i=n.length;if($(n)){var o=H(n);i=o.length}if(r>=i)return n;var f=r-G(e);if(f<1)return e;var a=o?Iu(o,0,f).join(""):n.slice(0,f);if(u===X)return a+e;if(o&&(f+=a.length-f),Oh(u)){if(n.slice(f).search(u)){var c,l=a;for(u.global||(u=pl(u.source,Wa(Nt.exec(u))+"g")),u.lastIndex=0;c=u.exec(l);)var s=c.index;a=a.slice(0,s===X?f:s)}}else if(n.indexOf(gu(u),f)!=f){var h=a.lastIndexOf(u);h>-1&&(a=a.slice(0,h))}return a+e}function zc(n){return n=Wa(n),n&&xt.test(n)?n.replace(wt,ye):n}function Ec(n,t,r){return n=Wa(n),t=r?X:t,t===X?D(n)?Q(n):g(n):n.match(t)||[]}function Sc(n){var t=null==n?0:n.length,e=Ai();return n=t?l(n,function(n){if("function"!=typeof n[1])throw new _l(en);return[e(n[0]),n[1]]}):[],iu(function(e){for(var u=-1;++u<t;){var i=n[u];if(r(i[0],this,e))return r(i[1],this,e)}})}function Wc(n){return Pr(Nr(n,an))}function Lc(n){return function(){return n}}function Cc(n,t){return null==n||n!==n?t:n}function Uc(n){return n}function Bc(n){return Me("function"==typeof n?n:Nr(n,an))}function Tc(n){return Ze(Nr(n,an))}function $c(n,t){return Ke(n,Nr(t,an))}function Dc(n,t,r){var e=Za(t),i=ve(t,e);null!=r||ca(t)&&(i.length||!e.length)||(r=t,t=n,n=this,i=ve(t,Za(t)));var o=!(ca(r)&&"chain"in r&&!r.chain),f=oa(n);return u(i,function(r){var e=t[r];n[r]=e,f&&(n.prototype[r]=function(){var t=this.__chain__;if(o||t){var r=n(this.__wrapped__),u=r.__actions__=Mu(this.__actions__);return u.push({func:e,args:arguments,thisArg:n}),r.__chain__=t,r}return e.apply(n,s([this.value()],arguments))})}),n}function Mc(){return re._===this&&(re._=Ol),this}function Fc(){}function Nc(n){return n=Ia(n),iu(function(t){return He(t,n)})}function Pc(n){return Di(n)?j(ro(n)):Xe(n)}function qc(n){return function(t){return null==n?X:de(n,t)}}function Zc(){return[]}function Kc(){return!1}function Vc(){return{}}function Gc(){return""}function Hc(){return!0}function Jc(n,t){if(n=Ia(n),n<1||n>Sn)return[];var r=Cn,e=Yl(n,Cn);t=Ai(t),n-=Cn;for(var u=R(e,t);++r<n;)t(r);return u}function Yc(n){return mh(n)?l(n,ro):ma(n)?[n]:Mu(Bs(Wa(n)))}function Qc(n){var t=++xl;return Wa(n)+t}function Xc(n){return n&&n.length?ne(n,Uc,xe):X}function nl(n,t){return n&&n.length?ne(n,Ai(t,2),xe):X}function tl(n){return x(n,Uc)}function rl(n,t){return x(n,Ai(t,2))}function el(n){return n&&n.length?ne(n,Uc,Pe):X}function ul(n,t){return n&&n.length?ne(n,Ai(t,2),Pe):X}function il(n){return n&&n.length?I(n,Uc):0}function ol(n,t){return n&&n.length?I(n,Ai(t,2)):0}A=null==A?re:be.defaults(re.Object(),A,be.pick(re,qr));var fl=A.Array,al=A.Date,cl=A.Error,ll=A.Function,sl=A.Math,hl=A.Object,pl=A.RegExp,vl=A.String,_l=A.TypeError,gl=fl.prototype,yl=ll.prototype,dl=hl.prototype,bl=A["__core-js_shared__"],wl=yl.toString,ml=dl.hasOwnProperty,xl=0,jl=function(){var n=/[^.]+$/.exec(bl&&bl.keys&&bl.keys.IE_PROTO||"");return n?"Symbol(src)_1."+n:""}(),Al=dl.toString,kl=wl.call(hl),Ol=re._,Il=pl("^"+wl.call(ml).replace(St,"\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g,"$1.*?")+"$"),Rl=ie?A.Buffer:X,zl=A.Symbol,El=A.Uint8Array,Sl=Rl?Rl.allocUnsafe:X,Wl=N(hl.getPrototypeOf,hl),Ll=hl.create,Cl=dl.propertyIsEnumerable,Ul=gl.splice,Bl=zl?zl.isConcatSpreadable:X,Tl=zl?zl.iterator:X,$l=zl?zl.toStringTag:X,Dl=function(){try{var n=Ii(hl,"defineProperty");return n({},"",{}),n}catch(n){}}(),Ml=A.clearTimeout!==re.clearTimeout&&A.clearTimeout,Fl=al&&al.now!==re.Date.now&&al.now,Nl=A.setTimeout!==re.setTimeout&&A.setTimeout,Pl=sl.ceil,ql=sl.floor,Zl=hl.getOwnPropertySymbols,Kl=Rl?Rl.isBuffer:X,Vl=A.isFinite,Gl=gl.join,Hl=N(hl.keys,hl),Jl=sl.max,Yl=sl.min,Ql=al.now,Xl=A.parseInt,ns=sl.random,ts=gl.reverse,rs=Ii(A,"DataView"),es=Ii(A,"Map"),us=Ii(A,"Promise"),is=Ii(A,"Set"),os=Ii(A,"WeakMap"),fs=Ii(hl,"create"),as=os&&new os,cs={},ls=eo(rs),ss=eo(es),hs=eo(us),ps=eo(is),vs=eo(os),_s=zl?zl.prototype:X,gs=_s?_s.valueOf:X,ys=_s?_s.toString:X,ds=function(){function n(){}return function(t){if(!ca(t))return{};if(Ll)return Ll(t);n.prototype=t;var r=new n;return n.prototype=X,r}}();K.templateSettings={escape:At,evaluate:kt,interpolate:Ot,variable:"",imports:{_:K}},K.prototype=J.prototype,K.prototype.constructor=K,Y.prototype=ds(J.prototype),Y.prototype.constructor=Y,Dt.prototype=ds(J.prototype),Dt.prototype.constructor=Dt,nr.prototype.clear=tr,nr.prototype.delete=rr,nr.prototype.get=er,nr.prototype.has=ur,nr.prototype.set=ir,or.prototype.clear=fr,or.prototype.delete=ar,or.prototype.get=cr,or.prototype.has=lr,or.prototype.set=sr,hr.prototype.clear=pr,hr.prototype.delete=vr,hr.prototype.get=_r,hr.prototype.has=gr,hr.prototype.set=yr,dr.prototype.add=dr.prototype.push=br,dr.prototype.has=wr,mr.prototype.clear=xr,mr.prototype.delete=jr,mr.prototype.get=Ar,mr.prototype.has=kr,mr.prototype.set=Or;var bs=Ku(oe),ws=Ku(fe,!0),ms=Vu(),xs=Vu(!0),js=as?function(n,t){return as.set(n,t),n}:Uc,As=Dl?function(n,t){return Dl(n,"toString",{configurable:!0,enumerable:!1,value:Lc(t),writable:!0})}:Uc,ks=iu,Os=Ml||function(n){return re.clearTimeout(n)},Is=is&&1/q(new is([,-0]))[1]==En?function(n){return new is(n)}:Fc,Rs=as?function(n){return as.get(n)}:Fc,zs=Zl?function(n){return null==n?[]:(n=hl(n),f(Zl(n),function(t){return Cl.call(n,t)}))}:Zc,Es=Zl?function(n){for(var t=[];n;)s(t,zs(n)),n=Wl(n);return t}:Zc,Ss=me;(rs&&Ss(new rs(new ArrayBuffer(1)))!=ft||es&&Ss(new es)!=Vn||us&&Ss(us.resolve())!=Yn||is&&Ss(new is)!=nt||os&&Ss(new os)!=ut)&&(Ss=function(n){var t=me(n),r=t==Jn?n.constructor:X,e=r?eo(r):"";if(e)switch(e){case ls:return ft;case ss:return Vn;case hs:return Yn;case ps:return nt;case vs:return ut}return t});var Ws=bl?oa:Kc,Ls=no(js),Cs=Nl||function(n,t){return re.setTimeout(n,t)},Us=no(As),Bs=Ki(function(n){var t=[];return zt.test(n)&&t.push(""),n.replace(Et,function(n,r,e,u){t.push(e?u.replace(Mt,"$1"):r||n)}),t}),Ts=iu(function(n,t){return Qf(n)?Jr(n,ue(t,1,Qf,!0)):[]}),$s=iu(function(n,t){var r=ko(t);return Qf(r)&&(r=X),Qf(n)?Jr(n,ue(t,1,Qf,!0),Ai(r,2)):[]}),Ds=iu(function(n,t){var r=ko(t);return Qf(r)&&(r=X),Qf(n)?Jr(n,ue(t,1,Qf,!0),X,r):[]}),Ms=iu(function(n){var t=l(n,Au);return t.length&&t[0]===n[0]?Oe(t):[]}),Fs=iu(function(n){var t=ko(n),r=l(n,Au);return t===ko(r)?t=X:r.pop(),r.length&&r[0]===n[0]?Oe(r,Ai(t,2)):[]}),Ns=iu(function(n){var t=ko(n),r=l(n,Au);return t="function"==typeof t?t:X,t&&r.pop(),r.length&&r[0]===n[0]?Oe(r,X,t):[]}),Ps=iu(Ro),qs=bi(function(n,t){var r=null==n?0:n.length,e=Mr(n,t);return tu(n,l(t,function(n){return Ti(n,r)?+n:n}).sort(Bu)),e}),Zs=iu(function(n){return yu(ue(n,1,Qf,!0))}),Ks=iu(function(n){var t=ko(n);return Qf(t)&&(t=X),yu(ue(n,1,Qf,!0),Ai(t,2))}),Vs=iu(function(n){var t=ko(n);return t="function"==typeof t?t:X,yu(ue(n,1,Qf,!0),X,t)}),Gs=iu(function(n,t){return Qf(n)?Jr(n,t):[]}),Hs=iu(function(n){return xu(f(n,Qf))}),Js=iu(function(n){var t=ko(n);return Qf(t)&&(t=X),xu(f(n,Qf),Ai(t,2))}),Ys=iu(function(n){var t=ko(n);return t="function"==typeof t?t:X,xu(f(n,Qf),X,t)}),Qs=iu(Jo),Xs=iu(function(n){var t=n.length,r=t>1?n[t-1]:X;return r="function"==typeof r?(n.pop(),r):X,Yo(n,r)}),nh=bi(function(n){var t=n.length,r=t?n[0]:0,e=this.__wrapped__,u=function(t){return Mr(t,n)};return!(t>1||this.__actions__.length)&&e instanceof Dt&&Ti(r)?(e=e.slice(r,+r+(t?1:0)),e.__actions__.push({func:rf,args:[u],thisArg:X}),new Y(e,this.__chain__).thru(function(n){return t&&!n.length&&n.push(X),n})):this.thru(u)}),th=qu(function(n,t,r){ml.call(n,r)?++n[r]:Tr(n,r,1)}),rh=Xu(vo),eh=Xu(_o),uh=qu(function(n,t,r){ml.call(n,r)?n[r].push(t):Tr(n,r,[t])}),ih=iu(function(n,t,e){var u=-1,i="function"==typeof t,o=Yf(n)?fl(n.length):[];return bs(n,function(n){o[++u]=i?r(t,n,e):Re(n,t,e)}),o}),oh=qu(function(n,t,r){Tr(n,r,t)}),fh=qu(function(n,t,r){n[r?0:1].push(t)},function(){return[[],[]]}),ah=iu(function(n,t){if(null==n)return[];var r=t.length;return r>1&&$i(n,t[0],t[1])?t=[]:r>2&&$i(t[0],t[1],t[2])&&(t=[t[0]]),Je(n,ue(t,1),[])}),ch=Fl||function(){return re.Date.now()},lh=iu(function(n,t,r){var e=pn;if(r.length){var u=P(r,ji(lh));e|=dn}return hi(n,e,t,r,u)}),sh=iu(function(n,t,r){var e=pn|vn;if(r.length){var u=P(r,ji(sh));e|=dn}return hi(t,e,n,r,u)}),hh=iu(function(n,t){return Hr(n,1,t)}),ph=iu(function(n,t,r){return Hr(n,za(t)||0,r)});Bf.Cache=hr;var vh=ks(function(n,t){t=1==t.length&&mh(t[0])?l(t[0],E(Ai())):l(ue(t,1),E(Ai()));var e=t.length;return iu(function(u){for(var i=-1,o=Yl(u.length,e);++i<o;)u[i]=t[i].call(this,u[i]);return r(n,this,u)})}),_h=iu(function(n,t){var r=P(t,ji(_h));return hi(n,dn,X,t,r)}),gh=iu(function(n,t){var r=P(t,ji(gh));return hi(n,bn,X,t,r)}),yh=bi(function(n,t){return hi(n,mn,X,X,X,t)}),dh=ai(xe),bh=ai(function(n,t){return n>=t}),wh=ze(function(){return arguments}())?ze:function(n){return la(n)&&ml.call(n,"callee")&&!Cl.call(n,"callee")},mh=fl.isArray,xh=ae?E(ae):Ee,jh=Kl||Kc,Ah=ce?E(ce):Se,kh=le?E(le):Ce,Oh=se?E(se):Te,Ih=he?E(he):$e,Rh=pe?E(pe):De,zh=ai(Pe),Eh=ai(function(n,t){return n<=t}),Sh=Zu(function(n,t){if(Pi(t)||Yf(t))return void Fu(t,Za(t),n);for(var r in t)ml.call(t,r)&&Wr(n,r,t[r])}),Wh=Zu(function(n,t){Fu(t,Ka(t),n)}),Lh=Zu(function(n,t,r,e){Fu(t,Ka(t),n,e)}),Ch=Zu(function(n,t,r,e){Fu(t,Za(t),n,e)}),Uh=bi(Mr),Bh=iu(function(n){return n.push(X,pi),r(Lh,X,n)}),Th=iu(function(n){return n.push(X,vi),r(Nh,X,n)}),$h=ri(function(n,t,r){n[t]=r},Lc(Uc)),Dh=ri(function(n,t,r){ml.call(n,t)?n[t].push(r):n[t]=[r]},Ai),Mh=iu(Re),Fh=Zu(function(n,t,r){Ve(n,t,r)}),Nh=Zu(function(n,t,r,e){Ve(n,t,r,e)}),Ph=bi(function(n,t){var r={};if(null==n)return r;var e=!1;t=l(t,function(t){return t=Ou(t,n),e||(e=t.length>1),t}),Fu(n,mi(n),r),e&&(r=Nr(r,an|cn|ln,_i));for(var u=t.length;u--;)du(r,t[u]);return r}),qh=bi(function(n,t){return null==n?{}:Ye(n,t)}),Zh=si(Za),Kh=si(Ka),Vh=Ju(function(n,t,r){return t=t.toLowerCase(),n+(r?cc(t):t)}),Gh=Ju(function(n,t,r){return n+(r?"-":"")+t.toLowerCase()}),Hh=Ju(function(n,t,r){return n+(r?" ":"")+t.toLowerCase()}),Jh=Hu("toLowerCase"),Yh=Ju(function(n,t,r){return n+(r?"_":"")+t.toLowerCase()}),Qh=Ju(function(n,t,r){return n+(r?" ":"")+np(t)}),Xh=Ju(function(n,t,r){return n+(r?" ":"")+t.toUpperCase()}),np=Hu("toUpperCase"),tp=iu(function(n,t){try{return r(n,X,t)}catch(n){return ua(n)?n:new cl(n)}}),rp=bi(function(n,t){return u(t,function(t){t=ro(t),Tr(n,t,lh(n[t],n))}),n}),ep=ni(),up=ni(!0),ip=iu(function(n,t){return function(r){return Re(r,n,t)}}),op=iu(function(n,t){return function(r){return Re(n,r,t)}}),fp=ui(l),ap=ui(o),cp=ui(v),lp=fi(),sp=fi(!0),hp=ei(function(n,t){return n+t},0),pp=li("ceil"),vp=ei(function(n,t){return n/t},1),_p=li("floor"),gp=ei(function(n,t){return n*t},1),yp=li("round"),dp=ei(function(n,t){return n-t},0);return K.after=zf,K.ary=Ef,K.assign=Sh,K.assignIn=Wh,K.assignInWith=Lh,K.assignWith=Ch,K.at=Uh,K.before=Sf,K.bind=lh,K.bindAll=rp,K.bindKey=sh,K.castArray=qf,K.chain=nf,K.chunk=oo,K.compact=fo,K.concat=ao,K.cond=Sc,K.conforms=Wc,K.constant=Lc,K.countBy=th,K.create=La,K.curry=Wf,K.curryRight=Lf,K.debounce=Cf,K.defaults=Bh,K.defaultsDeep=Th,K.defer=hh,K.delay=ph,K.difference=Ts,K.differenceBy=$s,K.differenceWith=Ds,K.drop=co,
+K.dropRight=lo,K.dropRightWhile=so,K.dropWhile=ho,K.fill=po,K.filter=hf,K.flatMap=pf,K.flatMapDeep=vf,K.flatMapDepth=_f,K.flatten=go,K.flattenDeep=yo,K.flattenDepth=bo,K.flip=Uf,K.flow=ep,K.flowRight=up,K.fromPairs=wo,K.functions=Ma,K.functionsIn=Fa,K.groupBy=uh,K.initial=jo,K.intersection=Ms,K.intersectionBy=Fs,K.intersectionWith=Ns,K.invert=$h,K.invertBy=Dh,K.invokeMap=ih,K.iteratee=Bc,K.keyBy=oh,K.keys=Za,K.keysIn=Ka,K.map=bf,K.mapKeys=Va,K.mapValues=Ga,K.matches=Tc,K.matchesProperty=$c,K.memoize=Bf,K.merge=Fh,K.mergeWith=Nh,K.method=ip,K.methodOf=op,K.mixin=Dc,K.negate=Tf,K.nthArg=Nc,K.omit=Ph,K.omitBy=Ha,K.once=$f,K.orderBy=wf,K.over=fp,K.overArgs=vh,K.overEvery=ap,K.overSome=cp,K.partial=_h,K.partialRight=gh,K.partition=fh,K.pick=qh,K.pickBy=Ja,K.property=Pc,K.propertyOf=qc,K.pull=Ps,K.pullAll=Ro,K.pullAllBy=zo,K.pullAllWith=Eo,K.pullAt=qs,K.range=lp,K.rangeRight=sp,K.rearg=yh,K.reject=jf,K.remove=So,K.rest=Df,K.reverse=Wo,K.sampleSize=kf,K.set=Qa,K.setWith=Xa,K.shuffle=Of,K.slice=Lo,K.sortBy=ah,K.sortedUniq=Mo,K.sortedUniqBy=Fo,K.split=wc,K.spread=Mf,K.tail=No,K.take=Po,K.takeRight=qo,K.takeRightWhile=Zo,K.takeWhile=Ko,K.tap=tf,K.throttle=Ff,K.thru=rf,K.toArray=ka,K.toPairs=Zh,K.toPairsIn=Kh,K.toPath=Yc,K.toPlainObject=Ea,K.transform=nc,K.unary=Nf,K.union=Zs,K.unionBy=Ks,K.unionWith=Vs,K.uniq=Vo,K.uniqBy=Go,K.uniqWith=Ho,K.unset=tc,K.unzip=Jo,K.unzipWith=Yo,K.update=rc,K.updateWith=ec,K.values=uc,K.valuesIn=ic,K.without=Gs,K.words=Ec,K.wrap=Pf,K.xor=Hs,K.xorBy=Js,K.xorWith=Ys,K.zip=Qs,K.zipObject=Qo,K.zipObjectDeep=Xo,K.zipWith=Xs,K.entries=Zh,K.entriesIn=Kh,K.extend=Wh,K.extendWith=Lh,Dc(K,K),K.add=hp,K.attempt=tp,K.camelCase=Vh,K.capitalize=cc,K.ceil=pp,K.clamp=oc,K.clone=Zf,K.cloneDeep=Vf,K.cloneDeepWith=Gf,K.cloneWith=Kf,K.conformsTo=Hf,K.deburr=lc,K.defaultTo=Cc,K.divide=vp,K.endsWith=sc,K.eq=Jf,K.escape=hc,K.escapeRegExp=pc,K.every=sf,K.find=rh,K.findIndex=vo,K.findKey=Ca,K.findLast=eh,K.findLastIndex=_o,K.findLastKey=Ua,K.floor=_p,K.forEach=gf,K.forEachRight=yf,K.forIn=Ba,K.forInRight=Ta,K.forOwn=$a,K.forOwnRight=Da,K.get=Na,K.gt=dh,K.gte=bh,K.has=Pa,K.hasIn=qa,K.head=mo,K.identity=Uc,K.includes=df,K.indexOf=xo,K.inRange=fc,K.invoke=Mh,K.isArguments=wh,K.isArray=mh,K.isArrayBuffer=xh,K.isArrayLike=Yf,K.isArrayLikeObject=Qf,K.isBoolean=Xf,K.isBuffer=jh,K.isDate=Ah,K.isElement=na,K.isEmpty=ta,K.isEqual=ra,K.isEqualWith=ea,K.isError=ua,K.isFinite=ia,K.isFunction=oa,K.isInteger=fa,K.isLength=aa,K.isMap=kh,K.isMatch=sa,K.isMatchWith=ha,K.isNaN=pa,K.isNative=va,K.isNil=ga,K.isNull=_a,K.isNumber=ya,K.isObject=ca,K.isObjectLike=la,K.isPlainObject=da,K.isRegExp=Oh,K.isSafeInteger=ba,K.isSet=Ih,K.isString=wa,K.isSymbol=ma,K.isTypedArray=Rh,K.isUndefined=xa,K.isWeakMap=ja,K.isWeakSet=Aa,K.join=Ao,K.kebabCase=Gh,K.last=ko,K.lastIndexOf=Oo,K.lowerCase=Hh,K.lowerFirst=Jh,K.lt=zh,K.lte=Eh,K.max=Xc,K.maxBy=nl,K.mean=tl,K.meanBy=rl,K.min=el,K.minBy=ul,K.stubArray=Zc,K.stubFalse=Kc,K.stubObject=Vc,K.stubString=Gc,K.stubTrue=Hc,K.multiply=gp,K.nth=Io,K.noConflict=Mc,K.noop=Fc,K.now=ch,K.pad=vc,K.padEnd=_c,K.padStart=gc,K.parseInt=yc,K.random=ac,K.reduce=mf,K.reduceRight=xf,K.repeat=dc,K.replace=bc,K.result=Ya,K.round=yp,K.runInContext=_,K.sample=Af,K.size=If,K.snakeCase=Yh,K.some=Rf,K.sortedIndex=Co,K.sortedIndexBy=Uo,K.sortedIndexOf=Bo,K.sortedLastIndex=To,K.sortedLastIndexBy=$o,K.sortedLastIndexOf=Do,K.startCase=Qh,K.startsWith=mc,K.subtract=dp,K.sum=il,K.sumBy=ol,K.template=xc,K.times=Jc,K.toFinite=Oa,K.toInteger=Ia,K.toLength=Ra,K.toLower=jc,K.toNumber=za,K.toSafeInteger=Sa,K.toString=Wa,K.toUpper=Ac,K.trim=kc,K.trimEnd=Oc,K.trimStart=Ic,K.truncate=Rc,K.unescape=zc,K.uniqueId=Qc,K.upperCase=Xh,K.upperFirst=np,K.each=gf,K.eachRight=yf,K.first=mo,Dc(K,function(){var n={};return oe(K,function(t,r){ml.call(K.prototype,r)||(n[r]=t)}),n}(),{chain:!1}),K.VERSION=nn,u(["bind","bindKey","curry","curryRight","partial","partialRight"],function(n){K[n].placeholder=K}),u(["drop","take"],function(n,t){Dt.prototype[n]=function(r){r=r===X?1:Jl(Ia(r),0);var e=this.__filtered__&&!t?new Dt(this):this.clone();return e.__filtered__?e.__takeCount__=Yl(r,e.__takeCount__):e.__views__.push({size:Yl(r,Cn),type:n+(e.__dir__<0?"Right":"")}),e},Dt.prototype[n+"Right"]=function(t){return this.reverse()[n](t).reverse()}}),u(["filter","map","takeWhile"],function(n,t){var r=t+1,e=r==In||r==zn;Dt.prototype[n]=function(n){var t=this.clone();return t.__iteratees__.push({iteratee:Ai(n,3),type:r}),t.__filtered__=t.__filtered__||e,t}}),u(["head","last"],function(n,t){var r="take"+(t?"Right":"");Dt.prototype[n]=function(){return this[r](1).value()[0]}}),u(["initial","tail"],function(n,t){var r="drop"+(t?"":"Right");Dt.prototype[n]=function(){return this.__filtered__?new Dt(this):this[r](1)}}),Dt.prototype.compact=function(){return this.filter(Uc)},Dt.prototype.find=function(n){return this.filter(n).head()},Dt.prototype.findLast=function(n){return this.reverse().find(n)},Dt.prototype.invokeMap=iu(function(n,t){return"function"==typeof n?new Dt(this):this.map(function(r){return Re(r,n,t)})}),Dt.prototype.reject=function(n){return this.filter(Tf(Ai(n)))},Dt.prototype.slice=function(n,t){n=Ia(n);var r=this;return r.__filtered__&&(n>0||t<0)?new Dt(r):(n<0?r=r.takeRight(-n):n&&(r=r.drop(n)),t!==X&&(t=Ia(t),r=t<0?r.dropRight(-t):r.take(t-n)),r)},Dt.prototype.takeRightWhile=function(n){return this.reverse().takeWhile(n).reverse()},Dt.prototype.toArray=function(){return this.take(Cn)},oe(Dt.prototype,function(n,t){var r=/^(?:filter|find|map|reject)|While$/.test(t),e=/^(?:head|last)$/.test(t),u=K[e?"take"+("last"==t?"Right":""):t],i=e||/^find/.test(t);u&&(K.prototype[t]=function(){var t=this.__wrapped__,o=e?[1]:arguments,f=t instanceof Dt,a=o[0],c=f||mh(t),l=function(n){var t=u.apply(K,s([n],o));return e&&h?t[0]:t};c&&r&&"function"==typeof a&&1!=a.length&&(f=c=!1);var h=this.__chain__,p=!!this.__actions__.length,v=i&&!h,_=f&&!p;if(!i&&c){t=_?t:new Dt(this);var g=n.apply(t,o);return g.__actions__.push({func:rf,args:[l],thisArg:X}),new Y(g,h)}return v&&_?n.apply(this,o):(g=this.thru(l),v?e?g.value()[0]:g.value():g)})}),u(["pop","push","shift","sort","splice","unshift"],function(n){var t=gl[n],r=/^(?:push|sort|unshift)$/.test(n)?"tap":"thru",e=/^(?:pop|shift)$/.test(n);K.prototype[n]=function(){var n=arguments;if(e&&!this.__chain__){var u=this.value();return t.apply(mh(u)?u:[],n)}return this[r](function(r){return t.apply(mh(r)?r:[],n)})}}),oe(Dt.prototype,function(n,t){var r=K[t];if(r){var e=r.name+"",u=cs[e]||(cs[e]=[]);u.push({name:t,func:r})}}),cs[ti(X,vn).name]=[{name:"wrapper",func:X}],Dt.prototype.clone=Yt,Dt.prototype.reverse=Qt,Dt.prototype.value=Xt,K.prototype.at=nh,K.prototype.chain=ef,K.prototype.commit=uf,K.prototype.next=of,K.prototype.plant=af,K.prototype.reverse=cf,K.prototype.toJSON=K.prototype.valueOf=K.prototype.value=lf,K.prototype.first=K.prototype.head,Tl&&(K.prototype[Tl]=ff),K},be=de();"function"==typeof define&&"object"==typeof define.amd&&define.amd?(re._=be,define(function(){return be})):ue?((ue.exports=be)._=be,ee._=be):re._=be}).call(this);
 }).call(this,typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {})
+},{}],3:[function(require,module,exports){
+function defaultSetTimout(){throw new Error("setTimeout has not been defined")}function defaultClearTimeout(){throw new Error("clearTimeout has not been defined")}function runTimeout(e){if(cachedSetTimeout===setTimeout)return setTimeout(e,0);if((cachedSetTimeout===defaultSetTimout||!cachedSetTimeout)&&setTimeout)return cachedSetTimeout=setTimeout,setTimeout(e,0);try{return cachedSetTimeout(e,0)}catch(t){try{return cachedSetTimeout.call(null,e,0)}catch(t){return cachedSetTimeout.call(this,e,0)}}}function runClearTimeout(e){if(cachedClearTimeout===clearTimeout)return clearTimeout(e);if((cachedClearTimeout===defaultClearTimeout||!cachedClearTimeout)&&clearTimeout)return cachedClearTimeout=clearTimeout,clearTimeout(e);try{return cachedClearTimeout(e)}catch(t){try{return cachedClearTimeout.call(null,e)}catch(t){return cachedClearTimeout.call(this,e)}}}function cleanUpNextTick(){draining&&currentQueue&&(draining=!1,currentQueue.length?queue=currentQueue.concat(queue):queueIndex=-1,queue.length&&drainQueue())}function drainQueue(){if(!draining){var e=runTimeout(cleanUpNextTick);draining=!0;for(var t=queue.length;t;){for(currentQueue=queue,queue=[];++queueIndex<t;)currentQueue&&currentQueue[queueIndex].run();queueIndex=-1,t=queue.length}currentQueue=null,draining=!1,runClearTimeout(e)}}function Item(e,t){this.fun=e,this.array=t}function noop(){}var process=module.exports={},cachedSetTimeout,cachedClearTimeout;!function(){try{cachedSetTimeout="function"==typeof setTimeout?setTimeout:defaultSetTimout}catch(e){cachedSetTimeout=defaultSetTimout}try{cachedClearTimeout="function"==typeof clearTimeout?clearTimeout:defaultClearTimeout}catch(e){cachedClearTimeout=defaultClearTimeout}}();var queue=[],draining=!1,currentQueue,queueIndex=-1;process.nextTick=function(e){var t=new Array(arguments.length-1);if(arguments.length>1)for(var u=1;u<arguments.length;u++)t[u-1]=arguments[u];queue.push(new Item(e,t)),1!==queue.length||draining||runTimeout(drainQueue)},Item.prototype.run=function(){this.fun.apply(null,this.array)},process.title="browser",process.browser=!0,process.env={},process.argv=[],process.version="",process.versions={},process.on=noop,process.addListener=noop,process.once=noop,process.off=noop,process.removeListener=noop,process.removeAllListeners=noop,process.emit=noop,process.binding=function(e){throw new Error("process.binding is not supported")},process.cwd=function(){return"/"},process.chdir=function(e){throw new Error("process.chdir is not supported")},process.umask=function(){return 0};
 },{}],4:[function(require,module,exports){
-function drainQueue(){if(!draining){draining=!0;for(var e,o=queue.length;o;){e=queue,queue=[];for(var r=-1;++r<o;)e[r]();o=queue.length}draining=!1}}function noop(){}var process=module.exports={},queue=[],draining=!1;process.nextTick=function(e){queue.push(e),draining||setTimeout(drainQueue,0)},process.title="browser",process.browser=!0,process.env={},process.argv=[],process.version="",process.versions={},process.on=noop,process.addListener=noop,process.once=noop,process.off=noop,process.removeListener=noop,process.removeAllListeners=noop,process.emit=noop,process.binding=function(e){throw new Error("process.binding is not supported")},process.cwd=function(){return"/"},process.chdir=function(e){throw new Error("process.chdir is not supported")},process.umask=function(){return 0};
-
-
-},{}],5:[function(require,module,exports){
 function blur(r,t,a,n){if(!(isNaN(n)||n<1)){n|=0;var e,l,b,f,g,o,u,x,i,s,h,c,v,_,k,m,B,S,w,N,d,p,j,q,y=n+n+1,z=t-1,A=a-1,C=n+1,D=C*(C+1)/2,E=new BlurStack,F=E;for(b=1;b<y;b++)if(F=F.next=new BlurStack,b==C)var G=F;F.next=E;var H=null,I=null;u=o=0;var J=mul_table[n],K=shg_table[n];for(l=0;l<a;l++){for(m=B=S=w=x=i=s=h=0,c=C*(N=r[o]),v=C*(d=r[o+1]),_=C*(p=r[o+2]),k=C*(j=r[o+3]),x+=D*N,i+=D*d,s+=D*p,h+=D*j,F=E,b=0;b<C;b++)F.r=N,F.g=d,F.b=p,F.a=j,F=F.next;for(b=1;b<C;b++)f=o+((z<b?z:b)<<2),x+=(F.r=N=r[f])*(q=C-b),i+=(F.g=d=r[f+1])*q,s+=(F.b=p=r[f+2])*q,h+=(F.a=j=r[f+3])*q,m+=N,B+=d,S+=p,w+=j,F=F.next;for(H=E,I=G,e=0;e<t;e++)r[o+3]=j=h*J>>K,0!=j?(j=255/j,r[o]=(x*J>>K)*j,r[o+1]=(i*J>>K)*j,r[o+2]=(s*J>>K)*j):r[o]=r[o+1]=r[o+2]=0,x-=c,i-=v,s-=_,h-=k,c-=H.r,v-=H.g,_-=H.b,k-=H.a,f=u+((f=e+n+1)<z?f:z)<<2,m+=H.r=r[f],B+=H.g=r[f+1],S+=H.b=r[f+2],w+=H.a=r[f+3],x+=m,i+=B,s+=S,h+=w,H=H.next,c+=N=I.r,v+=d=I.g,_+=p=I.b,k+=j=I.a,m-=N,B-=d,S-=p,w-=j,I=I.next,o+=4;u+=t}for(e=0;e<t;e++){for(B=S=w=m=i=s=h=x=0,o=e<<2,c=C*(N=r[o]),v=C*(d=r[o+1]),_=C*(p=r[o+2]),k=C*(j=r[o+3]),x+=D*N,i+=D*d,s+=D*p,h+=D*j,F=E,b=0;b<C;b++)F.r=N,F.g=d,F.b=p,F.a=j,F=F.next;for(g=t,b=1;b<=n;b++)o=g+e<<2,x+=(F.r=N=r[o])*(q=C-b),i+=(F.g=d=r[o+1])*q,s+=(F.b=p=r[o+2])*q,h+=(F.a=j=r[o+3])*q,m+=N,B+=d,S+=p,w+=j,F=F.next,b<A&&(g+=t);for(o=e,H=E,I=G,l=0;l<a;l++)f=o<<2,r[f+3]=j=h*J>>K,j>0?(j=255/j,r[f]=(x*J>>K)*j,r[f+1]=(i*J>>K)*j,r[f+2]=(s*J>>K)*j):r[f]=r[f+1]=r[f+2]=0,x-=c,i-=v,s-=_,h-=k,c-=H.r,v-=H.g,_-=H.b,k-=H.a,f=e+((f=l+C)<A?f:A)*t<<2,x+=m+=H.r=r[f],i+=B+=H.g=r[f+1],s+=S+=H.b=r[f+2],h+=w+=H.a=r[f+3],H=H.next,c+=N=I.r,v+=d=I.g,_+=p=I.b,k+=j=I.a,m-=N,B-=d,S-=p,w-=j,I=I.next,o+=t}}}function BlurStack(){this.r=0,this.g=0,this.b=0,this.a=0,this.next=null}var mul_table=[512,512,456,512,328,456,335,512,405,328,271,456,388,335,292,512,454,405,364,328,298,271,496,456,420,388,360,335,312,292,273,512,482,454,428,405,383,364,345,328,312,298,284,271,259,496,475,456,437,420,404,388,374,360,347,335,323,312,302,292,282,273,265,512,497,482,468,454,441,428,417,405,394,383,373,364,354,345,337,328,320,312,305,298,291,284,278,271,265,259,507,496,485,475,465,456,446,437,428,420,412,404,396,388,381,374,367,360,354,347,341,335,329,323,318,312,307,302,297,292,287,282,278,273,269,265,261,512,505,497,489,482,475,468,461,454,447,441,435,428,422,417,411,405,399,394,389,383,378,373,368,364,359,354,350,345,341,337,332,328,324,320,316,312,309,305,301,298,294,291,287,284,281,278,274,271,268,265,262,259,257,507,501,496,491,485,480,475,470,465,460,456,451,446,442,437,433,428,424,420,416,412,408,404,400,396,392,388,385,381,377,374,370,367,363,360,357,354,350,347,344,341,338,335,332,329,326,323,320,318,315,312,310,307,304,302,299,297,294,292,289,287,285,282,280,278,275,273,271,269,267,265,263,261,259],shg_table=[9,11,12,13,13,14,14,15,15,15,15,16,16,16,16,17,17,17,17,17,17,17,18,18,18,18,18,18,18,18,18,19,19,19,19,19,19,19,19,19,19,19,19,19,19,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24,24];module.exports=blur;
-
-
-},{}],6:[function(require,module,exports){
+},{}],5:[function(require,module,exports){
 function DOMParser(t){this.options=t||{locator:{}}}function buildErrorHandler(t,e,n){function r(e){var r=t[e];!r&&i&&(r=2==t.length?function(n){t(e,n)}:t),o[e]=r&&function(t){r("[xmldom "+e+"]\t"+t+_locator(n))}||function(){}}if(!t){if(e instanceof DOMHandler)return e;t=e}var o={},i=t instanceof Function;return n=n||{},r("warning"),r("error"),r("fatalError"),o}function DOMHandler(){this.cdata=!1}function position(t,e){e.lineNumber=t.lineNumber,e.columnNumber=t.columnNumber}function _locator(t){if(t)return"\n@"+(t.systemId||"")+"#[line:"+t.lineNumber+",col:"+t.columnNumber+"]"}function _toString(t,e,n){return"string"==typeof t?t.substr(e,n):t.length>=e+n||e?new java.lang.String(t,e,n)+"":t}function appendElement(t,e){t.currentElement?t.currentElement.appendChild(e):t.doc.appendChild(e)}DOMParser.prototype.parseFromString=function(t,e){var n=this.options,r=new XMLReader,o=n.domBuilder||new DOMHandler,i=n.errorHandler,a=n.locator,c=n.xmlns||{},l={lt:"<",gt:">",amp:"&",quot:'"',apos:"'"};return a&&o.setDocumentLocator(a),r.errorHandler=buildErrorHandler(i,o,a),r.domBuilder=n.domBuilder||o,/\/x?html?$/.test(e)&&(l.nbsp=" ",l.copy="©",c[""]="http://www.w3.org/1999/xhtml"),c.xml=c.xml||"http://www.w3.org/XML/1998/namespace",t?r.parse(t,c,l):r.errorHandler.error("invalid doc source"),o.doc},DOMHandler.prototype={startDocument:function(){this.doc=(new DOMImplementation).createDocument(null,null,null),this.locator&&(this.doc.documentURI=this.locator.systemId)},startElement:function(t,e,n,r){var o=this.doc,i=o.createElementNS(t,n||e),a=r.length;appendElement(this,i),this.currentElement=i,this.locator&&position(this.locator,i);for(var c=0;c<a;c++){var t=r.getURI(c),l=r.getValue(c),n=r.getQName(c),s=o.createAttributeNS(t,n);this.locator&&position(r.getLocator(c),s),s.value=s.nodeValue=l,i.setAttributeNode(s)}},endElement:function(t,e,n){var r=this.currentElement;r.tagName;this.currentElement=r.parentNode},startPrefixMapping:function(t,e){},endPrefixMapping:function(t){},processingInstruction:function(t,e){var n=this.doc.createProcessingInstruction(t,e);this.locator&&position(this.locator,n),appendElement(this,n)},ignorableWhitespace:function(t,e,n){},characters:function(t,e,n){if(t=_toString.apply(this,arguments)){if(this.cdata)var r=this.doc.createCDATASection(t);else var r=this.doc.createTextNode(t);this.currentElement?this.currentElement.appendChild(r):/^\s*$/.test(t)&&this.doc.appendChild(r),this.locator&&position(this.locator,r)}},skippedEntity:function(t){},endDocument:function(){this.doc.normalize()},setDocumentLocator:function(t){(this.locator=t)&&(t.lineNumber=0)},comment:function(t,e,n){t=_toString.apply(this,arguments);var r=this.doc.createComment(t);this.locator&&position(this.locator,r),appendElement(this,r)},startCDATA:function(){this.cdata=!0},endCDATA:function(){this.cdata=!1},startDTD:function(t,e,n){var r=this.doc.implementation;if(r&&r.createDocumentType){var o=r.createDocumentType(t,e,n);this.locator&&position(this.locator,o),appendElement(this,o)}},warning:function(t){console.warn("[xmldom warning]\t"+t,_locator(this.locator))},error:function(t){console.error("[xmldom error]\t"+t,_locator(this.locator))},fatalError:function(t){throw console.error("[xmldom fatalError]\t"+t,_locator(this.locator)),t}},"endDTD,startEntity,endEntity,attributeDecl,elementDecl,externalEntityDecl,internalEntityDecl,resolveEntity,getExternalSubset,notationDecl,unparsedEntityDecl".replace(/\w+/g,function(t){DOMHandler.prototype[t]=function(){return null}});var XMLReader=require("./sax").XMLReader,DOMImplementation=exports.DOMImplementation=require("./dom").DOMImplementation;exports.XMLSerializer=require("./dom").XMLSerializer,exports.DOMParser=DOMParser;
-
-
-},{"./dom":7,"./sax":8}],7:[function(require,module,exports){
+},{"./dom":6,"./sax":7}],6:[function(require,module,exports){
 function copy(e,t){for(var n in e)t[n]=e[n]}function _extends(e,t){function n(){}var o=e.prototype;if(Object.create){var i=Object.create(t.prototype);o.__proto__=i}o instanceof t||(n.prototype=t.prototype,n=new n,copy(o,n),e.prototype=o=n),o.constructor!=e&&("function"!=typeof e&&console.error("unknow Class:"+e),o.constructor=e)}function DOMException(e,t){if(t instanceof Error)var n=t;else n=this,Error.call(this,ExceptionMessage[e]),this.message=ExceptionMessage[e],Error.captureStackTrace&&Error.captureStackTrace(this,DOMException);return n.code=e,t&&(this.message=this.message+": "+t),n}function NodeList(){}function LiveNodeList(e,t){this._node=e,this._refresh=t,_updateLiveList(this)}function _updateLiveList(e){var t=e._node._inc||e._node.ownerDocument._inc;if(e._inc!=t){var n=e._refresh(e._node);__set__(e,"length",n.length),copy(n,e),e._inc=t}}function NamedNodeMap(){}function _findNodeIndex(e,t){for(var n=e.length;n--;)if(e[n]===t)return n}function _addNamedNode(e,t,n,o){if(o?t[_findNodeIndex(t,o)]=n:t[t.length++]=n,e){n.ownerElement=e;var i=e.ownerDocument;i&&(o&&_onRemoveAttribute(i,e,o),_onAddAttribute(i,e,n))}}function _removeNamedNode(e,t,n){var o=_findNodeIndex(t,n);if(!(o>=0))throw DOMException(NOT_FOUND_ERR,new Error(e.tagName+"@"+n));for(var i=t.length-1;o<i;)t[o]=t[++o];if(t.length=i,e){var r=e.ownerDocument;r&&(_onRemoveAttribute(r,e,n),n.ownerElement=null)}}function DOMImplementation(e){if(this._features={},e)for(var t in e)this._features=e[t]}function Node(){}function _xmlEncoder(e){return"<"==e&&"&lt;"||">"==e&&"&gt;"||"&"==e&&"&amp;"||'"'==e&&"&quot;"||"&#"+e.charCodeAt()+";"}function _visitNode(e,t){if(t(e))return!0;if(e=e.firstChild)do if(_visitNode(e,t))return!0;while(e=e.nextSibling)}function Document(){}function _onAddAttribute(e,t,n){e&&e._inc++;var o=n.namespaceURI;"http://www.w3.org/2000/xmlns/"==o&&(t._nsMap[n.prefix?n.localName:""]=n.value)}function _onRemoveAttribute(e,t,n,o){e&&e._inc++;var i=n.namespaceURI;"http://www.w3.org/2000/xmlns/"==i&&delete t._nsMap[n.prefix?n.localName:""]}function _onUpdateChild(e,t,n){if(e&&e._inc){e._inc++;var o=t.childNodes;if(n)o[o.length++]=n;else{for(var i=t.firstChild,r=0;i;)o[r++]=i,i=i.nextSibling;o.length=r}}}function _removeChild(e,t){var n=t.previousSibling,o=t.nextSibling;return n?n.nextSibling=o:e.firstChild=o,o?o.previousSibling=n:e.lastChild=n,_onUpdateChild(e.ownerDocument,e),t}function _insertBefore(e,t,n){var o=t.parentNode;if(o&&o.removeChild(t),t.nodeType===DOCUMENT_FRAGMENT_NODE){var i=t.firstChild;if(null==i)return t;var r=t.lastChild}else i=r=t;var a=n?n.previousSibling:e.lastChild;i.previousSibling=a,r.nextSibling=n,a?a.nextSibling=i:e.firstChild=i,null==n?e.lastChild=r:n.previousSibling=r;do i.parentNode=e;while(i!==r&&(i=i.nextSibling));return _onUpdateChild(e.ownerDocument||e,e),t.nodeType==DOCUMENT_FRAGMENT_NODE&&(t.firstChild=t.lastChild=null),t}function _appendSingleChild(e,t){var n=t.parentNode;if(n){var o=e.lastChild;n.removeChild(t);var o=e.lastChild}var o=e.lastChild;return t.parentNode=e,t.previousSibling=o,t.nextSibling=null,o?o.nextSibling=t:e.firstChild=t,e.lastChild=t,_onUpdateChild(e.ownerDocument,e,t),t}function Element(){this._nsMap={}}function Attr(){}function CharacterData(){}function Text(){}function Comment(){}function CDATASection(){}function DocumentType(){}function Notation(){}function Entity(){}function EntityReference(){}function DocumentFragment(){}function ProcessingInstruction(){}function XMLSerializer(){}function nodeSerializeToString(e,t){var n=[],o=9==this.nodeType?this.documentElement:this,i=o.prefix,r=o.namespaceURI;if(r&&null==i){var i=o.lookupPrefix(r);if(null==i)var a=[{namespace:r,prefix:null}]}return serializeToString(this,n,e,t,a),n.join("")}function needNamespaceDefine(e,t,n){var o=e.prefix||"",i=e.namespaceURI;if(!o&&!i)return!1;if("xml"===o&&"http://www.w3.org/XML/1998/namespace"===i||"http://www.w3.org/2000/xmlns/"==i)return!1;for(var r=n.length;r--;){var a=n[r];if(a.prefix==o)return a.namespace!=i}return!0}function serializeToString(e,t,n,o,i){if(o){if(e=o(e),!e)return;if("string"==typeof e)return void t.push(e)}switch(e.nodeType){case ELEMENT_NODE:i||(i=[]);var r=(i.length,e.attributes),a=r.length,s=e.firstChild,u=e.tagName;n=htmlns===e.namespaceURI||n,t.push("<",u);for(var d=0;d<a;d++){var c=r.item(d);"xmlns"==c.prefix?i.push({prefix:c.localName,namespace:c.value}):"xmlns"==c.nodeName&&i.push({prefix:"",namespace:c.value})}for(var d=0;d<a;d++){var c=r.item(d);if(needNamespaceDefine(c,n,i)){var N=c.prefix||"",l=c.namespaceURI,p=N?" xmlns:"+N:" xmlns";t.push(p,'="',l,'"'),i.push({prefix:N,namespace:l})}serializeToString(c,t,n,o,i)}if(needNamespaceDefine(e,n,i)){var N=e.prefix||"",l=e.namespaceURI,p=N?" xmlns:"+N:" xmlns";t.push(p,'="',l,'"'),i.push({prefix:N,namespace:l})}if(s||n&&!/^(?:meta|link|img|br|hr|input)$/i.test(u)){if(t.push(">"),n&&/^script$/i.test(u))for(;s;)s.data?t.push(s.data):serializeToString(s,t,n,o,i),s=s.nextSibling;else for(;s;)serializeToString(s,t,n,o,i),s=s.nextSibling;t.push("</",u,">")}else t.push("/>");return;case DOCUMENT_NODE:case DOCUMENT_FRAGMENT_NODE:for(var s=e.firstChild;s;)serializeToString(s,t,n,o,i),s=s.nextSibling;return;case ATTRIBUTE_NODE:return t.push(" ",e.name,'="',e.value.replace(/[<&"]/g,_xmlEncoder),'"');case TEXT_NODE:return t.push(e.data.replace(/[<&]/g,_xmlEncoder));case CDATA_SECTION_NODE:return t.push("<![CDATA[",e.data,"]]>");case COMMENT_NODE:return t.push("<!--",e.data,"-->");case DOCUMENT_TYPE_NODE:var E=e.publicId,m=e.systemId;if(t.push("<!DOCTYPE ",e.name),E)t.push(' PUBLIC "',E),m&&"."!=m&&t.push('" "',m),t.push('">');else if(m&&"."!=m)t.push(' SYSTEM "',m,'">');else{var h=e.internalSubset;h&&t.push(" [",h,"]"),t.push(">")}return;case PROCESSING_INSTRUCTION_NODE:return t.push("<?",e.target," ",e.data,"?>");case ENTITY_REFERENCE_NODE:return t.push("&",e.nodeName,";");default:t.push("??",e.nodeName)}}function importNode(e,t,n){var o;switch(t.nodeType){case ELEMENT_NODE:o=t.cloneNode(!1),o.ownerDocument=e;case DOCUMENT_FRAGMENT_NODE:break;case ATTRIBUTE_NODE:n=!0}if(o||(o=t.cloneNode(!1)),o.ownerDocument=e,o.parentNode=null,n)for(var i=t.firstChild;i;)o.appendChild(importNode(e,i,n)),i=i.nextSibling;return o}function cloneNode(e,t,n){var o=new t.constructor;for(var i in t){var r=t[i];"object"!=typeof r&&r!=o[i]&&(o[i]=r)}switch(t.childNodes&&(o.childNodes=new NodeList),o.ownerDocument=e,o.nodeType){case ELEMENT_NODE:var a=t.attributes,s=o.attributes=new NamedNodeMap,u=a.length;s._ownerElement=o;for(var d=0;d<u;d++)o.setAttributeNode(cloneNode(e,a.item(d),!0));break;case ATTRIBUTE_NODE:n=!0}if(n)for(var c=t.firstChild;c;)o.appendChild(cloneNode(e,c,n)),c=c.nextSibling;return o}function __set__(e,t,n){e[t]=n}function getTextContent(e){switch(e.nodeType){case ELEMENT_NODE:case DOCUMENT_FRAGMENT_NODE:var t=[];for(e=e.firstChild;e;)7!==e.nodeType&&8!==e.nodeType&&t.push(getTextContent(e)),e=e.nextSibling;return t.join("");default:return e.nodeValue}}var htmlns="http://www.w3.org/1999/xhtml",NodeType={},ELEMENT_NODE=NodeType.ELEMENT_NODE=1,ATTRIBUTE_NODE=NodeType.ATTRIBUTE_NODE=2,TEXT_NODE=NodeType.TEXT_NODE=3,CDATA_SECTION_NODE=NodeType.CDATA_SECTION_NODE=4,ENTITY_REFERENCE_NODE=NodeType.ENTITY_REFERENCE_NODE=5,ENTITY_NODE=NodeType.ENTITY_NODE=6,PROCESSING_INSTRUCTION_NODE=NodeType.PROCESSING_INSTRUCTION_NODE=7,COMMENT_NODE=NodeType.COMMENT_NODE=8,DOCUMENT_NODE=NodeType.DOCUMENT_NODE=9,DOCUMENT_TYPE_NODE=NodeType.DOCUMENT_TYPE_NODE=10,DOCUMENT_FRAGMENT_NODE=NodeType.DOCUMENT_FRAGMENT_NODE=11,NOTATION_NODE=NodeType.NOTATION_NODE=12,ExceptionCode={},ExceptionMessage={},INDEX_SIZE_ERR=ExceptionCode.INDEX_SIZE_ERR=(ExceptionMessage[1]="Index size error",1),DOMSTRING_SIZE_ERR=ExceptionCode.DOMSTRING_SIZE_ERR=(ExceptionMessage[2]="DOMString size error",2),HIERARCHY_REQUEST_ERR=ExceptionCode.HIERARCHY_REQUEST_ERR=(ExceptionMessage[3]="Hierarchy request error",3),WRONG_DOCUMENT_ERR=ExceptionCode.WRONG_DOCUMENT_ERR=(ExceptionMessage[4]="Wrong document",4),INVALID_CHARACTER_ERR=ExceptionCode.INVALID_CHARACTER_ERR=(ExceptionMessage[5]="Invalid character",5),NO_DATA_ALLOWED_ERR=ExceptionCode.NO_DATA_ALLOWED_ERR=(ExceptionMessage[6]="No data allowed",6),NO_MODIFICATION_ALLOWED_ERR=ExceptionCode.NO_MODIFICATION_ALLOWED_ERR=(ExceptionMessage[7]="No modification allowed",7),NOT_FOUND_ERR=ExceptionCode.NOT_FOUND_ERR=(ExceptionMessage[8]="Not found",8),NOT_SUPPORTED_ERR=ExceptionCode.NOT_SUPPORTED_ERR=(ExceptionMessage[9]="Not supported",9),INUSE_ATTRIBUTE_ERR=ExceptionCode.INUSE_ATTRIBUTE_ERR=(ExceptionMessage[10]="Attribute in use",10),INVALID_STATE_ERR=ExceptionCode.INVALID_STATE_ERR=(ExceptionMessage[11]="Invalid state",11),SYNTAX_ERR=ExceptionCode.SYNTAX_ERR=(ExceptionMessage[12]="Syntax error",12),INVALID_MODIFICATION_ERR=ExceptionCode.INVALID_MODIFICATION_ERR=(ExceptionMessage[13]="Invalid modification",13),NAMESPACE_ERR=ExceptionCode.NAMESPACE_ERR=(ExceptionMessage[14]="Invalid namespace",14),INVALID_ACCESS_ERR=ExceptionCode.INVALID_ACCESS_ERR=(ExceptionMessage[15]="Invalid access",15);DOMException.prototype=Error.prototype,copy(ExceptionCode,DOMException),NodeList.prototype={length:0,item:function(e){return this[e]||null},toString:function(e,t){for(var n=[],o=0;o<this.length;o++)serializeToString(this[o],n,e,t);return n.join("")}},LiveNodeList.prototype.item=function(e){return _updateLiveList(this),this[e]},_extends(LiveNodeList,NodeList),NamedNodeMap.prototype={length:0,item:NodeList.prototype.item,getNamedItem:function(e){for(var t=this.length;t--;){var n=this[t];if(n.nodeName==e)return n}},setNamedItem:function(e){var t=e.ownerElement;if(t&&t!=this._ownerElement)throw new DOMException(INUSE_ATTRIBUTE_ERR);var n=this.getNamedItem(e.nodeName);return _addNamedNode(this._ownerElement,this,e,n),n},setNamedItemNS:function(e){var t,n=e.ownerElement;if(n&&n!=this._ownerElement)throw new DOMException(INUSE_ATTRIBUTE_ERR);return t=this.getNamedItemNS(e.namespaceURI,e.localName),_addNamedNode(this._ownerElement,this,e,t),t},removeNamedItem:function(e){var t=this.getNamedItem(e);return _removeNamedNode(this._ownerElement,this,t),t},removeNamedItemNS:function(e,t){var n=this.getNamedItemNS(e,t);return _removeNamedNode(this._ownerElement,this,n),n},getNamedItemNS:function(e,t){for(var n=this.length;n--;){var o=this[n];if(o.localName==t&&o.namespaceURI==e)return o}return null}},DOMImplementation.prototype={hasFeature:function(e,t){var n=this._features[e.toLowerCase()];return!(!n||t&&!(t in n))},createDocument:function(e,t,n){var o=new Document;if(o.implementation=this,o.childNodes=new NodeList,o.doctype=n,n&&o.appendChild(n),t){var i=o.createElementNS(e,t);o.appendChild(i)}return o},createDocumentType:function(e,t,n){var o=new DocumentType;return o.name=e,o.nodeName=e,o.publicId=t,o.systemId=n,o}},Node.prototype={firstChild:null,lastChild:null,previousSibling:null,nextSibling:null,attributes:null,parentNode:null,childNodes:null,ownerDocument:null,nodeValue:null,namespaceURI:null,prefix:null,localName:null,insertBefore:function(e,t){return _insertBefore(this,e,t)},replaceChild:function(e,t){this.insertBefore(e,t),t&&this.removeChild(t)},removeChild:function(e){return _removeChild(this,e)},appendChild:function(e){return this.insertBefore(e,null)},hasChildNodes:function(){return null!=this.firstChild},cloneNode:function(e){return cloneNode(this.ownerDocument||this,this,e)},normalize:function(){for(var e=this.firstChild;e;){var t=e.nextSibling;t&&t.nodeType==TEXT_NODE&&e.nodeType==TEXT_NODE?(this.removeChild(t),e.appendData(t.data)):(e.normalize(),e=t)}},isSupported:function(e,t){return this.ownerDocument.implementation.hasFeature(e,t)},hasAttributes:function(){return this.attributes.length>0},lookupPrefix:function(e){for(var t=this;t;){var n=t._nsMap;if(n)for(var o in n)if(n[o]==e)return o;t=t.nodeType==ATTRIBUTE_NODE?t.ownerDocument:t.parentNode}return null},lookupNamespaceURI:function(e){for(var t=this;t;){var n=t._nsMap;if(n&&e in n)return n[e];t=t.nodeType==ATTRIBUTE_NODE?t.ownerDocument:t.parentNode}return null},isDefaultNamespace:function(e){var t=this.lookupPrefix(e);return null==t}},copy(NodeType,Node),copy(NodeType,Node.prototype),Document.prototype={nodeName:"#document",nodeType:DOCUMENT_NODE,doctype:null,documentElement:null,_inc:1,insertBefore:function(e,t){if(e.nodeType==DOCUMENT_FRAGMENT_NODE){for(var n=e.firstChild;n;){var o=n.nextSibling;this.insertBefore(n,t),n=o}return e}return null==this.documentElement&&e.nodeType==ELEMENT_NODE&&(this.documentElement=e),_insertBefore(this,e,t),e.ownerDocument=this,e},removeChild:function(e){return this.documentElement==e&&(this.documentElement=null),_removeChild(this,e)},importNode:function(e,t){return importNode(this,e,t)},getElementById:function(e){var t=null;return _visitNode(this.documentElement,function(n){if(n.nodeType==ELEMENT_NODE&&n.getAttribute("id")==e)return t=n,!0}),t},createElement:function(e){var t=new Element;t.ownerDocument=this,t.nodeName=e,t.tagName=e,t.childNodes=new NodeList;var n=t.attributes=new NamedNodeMap;return n._ownerElement=t,t},createDocumentFragment:function(){var e=new DocumentFragment;return e.ownerDocument=this,e.childNodes=new NodeList,e},createTextNode:function(e){var t=new Text;return t.ownerDocument=this,t.appendData(e),t},createComment:function(e){var t=new Comment;return t.ownerDocument=this,t.appendData(e),t},createCDATASection:function(e){var t=new CDATASection;return t.ownerDocument=this,t.appendData(e),t},createProcessingInstruction:function(e,t){var n=new ProcessingInstruction;return n.ownerDocument=this,n.tagName=n.target=e,n.nodeValue=n.data=t,n},createAttribute:function(e){var t=new Attr;return t.ownerDocument=this,t.name=e,t.nodeName=e,t.localName=e,t.specified=!0,t},createEntityReference:function(e){var t=new EntityReference;return t.ownerDocument=this,t.nodeName=e,t},createElementNS:function(e,t){var n=new Element,o=t.split(":"),i=n.attributes=new NamedNodeMap;return n.childNodes=new NodeList,n.ownerDocument=this,n.nodeName=t,n.tagName=t,n.namespaceURI=e,2==o.length?(n.prefix=o[0],n.localName=o[1]):n.localName=t,i._ownerElement=n,n},createAttributeNS:function(e,t){var n=new Attr,o=t.split(":");return n.ownerDocument=this,n.nodeName=t,n.name=t,n.namespaceURI=e,n.specified=!0,2==o.length?(n.prefix=o[0],n.localName=o[1]):n.localName=t,n}},_extends(Document,Node),Element.prototype={nodeType:ELEMENT_NODE,hasAttribute:function(e){return null!=this.getAttributeNode(e)},getAttribute:function(e){var t=this.getAttributeNode(e);return t&&t.value||""},getAttributeNode:function(e){return this.attributes.getNamedItem(e)},setAttribute:function(e,t){var n=this.ownerDocument.createAttribute(e);n.value=n.nodeValue=""+t,this.setAttributeNode(n)},removeAttribute:function(e){var t=this.getAttributeNode(e);t&&this.removeAttributeNode(t)},appendChild:function(e){return e.nodeType===DOCUMENT_FRAGMENT_NODE?this.insertBefore(e,null):_appendSingleChild(this,e)},setAttributeNode:function(e){return this.attributes.setNamedItem(e)},setAttributeNodeNS:function(e){return this.attributes.setNamedItemNS(e)},removeAttributeNode:function(e){return this.attributes.removeNamedItem(e.nodeName)},removeAttributeNS:function(e,t){var n=this.getAttributeNodeNS(e,t);n&&this.removeAttributeNode(n)},hasAttributeNS:function(e,t){return null!=this.getAttributeNodeNS(e,t)},getAttributeNS:function(e,t){var n=this.getAttributeNodeNS(e,t);return n&&n.value||""},setAttributeNS:function(e,t,n){var o=this.ownerDocument.createAttributeNS(e,t);o.value=o.nodeValue=""+n,this.setAttributeNode(o)},getAttributeNodeNS:function(e,t){return this.attributes.getNamedItemNS(e,t)},getElementsByTagName:function(e){return new LiveNodeList(this,function(t){var n=[];return _visitNode(t,function(o){o===t||o.nodeType!=ELEMENT_NODE||"*"!==e&&o.tagName!=e||n.push(o)}),n})},getElementsByTagNameNS:function(e,t){return new LiveNodeList(this,function(n){var o=[];return _visitNode(n,function(i){i===n||i.nodeType!==ELEMENT_NODE||"*"!==e&&i.namespaceURI!==e||"*"!==t&&i.localName!=t||o.push(i)}),o})}},Document.prototype.getElementsByTagName=Element.prototype.getElementsByTagName,Document.prototype.getElementsByTagNameNS=Element.prototype.getElementsByTagNameNS,_extends(Element,Node),Attr.prototype.nodeType=ATTRIBUTE_NODE,_extends(Attr,Node),CharacterData.prototype={data:"",substringData:function(e,t){return this.data.substring(e,e+t)},appendData:function(e){e=this.data+e,this.nodeValue=this.data=e,this.length=e.length},insertData:function(e,t){this.replaceData(e,0,t)},appendChild:function(e){throw new Error(ExceptionMessage[HIERARCHY_REQUEST_ERR])},deleteData:function(e,t){this.replaceData(e,t,"")},replaceData:function(e,t,n){var o=this.data.substring(0,e),i=this.data.substring(e+t);n=o+n+i,this.nodeValue=this.data=n,this.length=n.length}},_extends(CharacterData,Node),Text.prototype={nodeName:"#text",nodeType:TEXT_NODE,splitText:function(e){var t=this.data,n=t.substring(e);t=t.substring(0,e),this.data=this.nodeValue=t,this.length=t.length;var o=this.ownerDocument.createTextNode(n);return this.parentNode&&this.parentNode.insertBefore(o,this.nextSibling),o}},_extends(Text,CharacterData),Comment.prototype={nodeName:"#comment",nodeType:COMMENT_NODE},_extends(Comment,CharacterData),CDATASection.prototype={nodeName:"#cdata-section",nodeType:CDATA_SECTION_NODE},_extends(CDATASection,CharacterData),DocumentType.prototype.nodeType=DOCUMENT_TYPE_NODE,_extends(DocumentType,Node),Notation.prototype.nodeType=NOTATION_NODE,_extends(Notation,Node),Entity.prototype.nodeType=ENTITY_NODE,_extends(Entity,Node),EntityReference.prototype.nodeType=ENTITY_REFERENCE_NODE,_extends(EntityReference,Node),DocumentFragment.prototype.nodeName="#document-fragment",DocumentFragment.prototype.nodeType=DOCUMENT_FRAGMENT_NODE,_extends(DocumentFragment,Node),ProcessingInstruction.prototype.nodeType=PROCESSING_INSTRUCTION_NODE,_extends(ProcessingInstruction,Node),XMLSerializer.prototype.serializeToString=function(e,t,n){return nodeSerializeToString.call(e,t,n)},Node.prototype.toString=nodeSerializeToString;try{Object.defineProperty&&(Object.defineProperty(LiveNodeList.prototype,"length",{get:function(){return _updateLiveList(this),this.$$length}}),Object.defineProperty(Node.prototype,"textContent",{get:function(){return getTextContent(this)},set:function(e){switch(this.nodeType){case ELEMENT_NODE:case DOCUMENT_FRAGMENT_NODE:for(;this.firstChild;)this.removeChild(this.firstChild);(e||String(e))&&this.appendChild(this.ownerDocument.createTextNode(e));break;default:this.data=e,this.value=e,this.nodeValue=e}}}),__set__=function(e,t,n){e["$$"+t]=n})}catch(e){}exports.DOMImplementation=DOMImplementation,exports.XMLSerializer=XMLSerializer;
 
-
-},{}],8:[function(require,module,exports){
+},{}],7:[function(require,module,exports){
 function XMLReader(){}function parse(e,t,r,a,n){function s(e){if(e>65535){e-=65536;var t=55296+(e>>10),r=56320+(1023&e);return String.fromCharCode(t,r)}return String.fromCharCode(e)}function c(e){var t=e.slice(1,-1);return t in r?r[t]:"#"===t.charAt(0)?s(parseInt(t.substr(1).replace("x","0x"))):(n.error("entity not found:"+e),e)}function i(t){if(t>p){var r=e.substring(p,t).replace(/&#?\w+;/g,c);m&&o(p),a.characters(r,0,t-p),p=t}}function o(t,r){for(;t>=l&&(r=_.exec(e));)u=r.index,l=u+r[0].length,m.lineNumber++;m.columnNumber=t-u+1}for(var u=0,l=0,_=/.*(?:\r\n?|\n)|.*$/g,m=a.locator,f=[{currentNSMap:t}],d={},p=0;;){try{var T=e.indexOf("<",p);if(T<0){if(!e.substr(p).match(/^\s*$/)){var S=a.doc,h=S.createTextNode(e.substr(p));S.appendChild(h),a.currentElement=h}return}switch(T>p&&i(T),e.charAt(T+1)){case"/":var A=e.indexOf(">",T+3),g=e.substring(T+2,A),w=f.pop();A<0?(g=e.substring(T+2).replace(/[\s<].*/,""),n.error("end tag name: "+g+" is not complete:"+w.tagName),A=T+1+g.length):g.match(/\s</)&&(g=g.replace(/[\s<].*/,""),n.error("end tag name: "+g+" maybe not complete"),A=T+1+g.length);var E=w.localNSMap,N=w.tagName==g,b=N||w.tagName&&w.tagName.toLowerCase()==g.toLowerCase();if(b){if(a.endElement(w.uri,w.localName,g),E)for(var v in E)a.endPrefixMapping(v);N||n.fatalError("end tag name: "+g+" is not match the current start tagName:"+w.tagName)}else f.push(w);A++;break;case"?":m&&o(T),A=parseInstruction(e,T,a);break;case"!":m&&o(T),A=parseDCC(e,T,a,n);break;default:m&&o(T);var x=new ElementAttributes,C=f[f.length-1].currentNSMap,A=parseElementStartPart(e,T,x,C,c,n),R=x.length;if(!x.closed&&fixSelfClosed(e,A,x.tagName,d)&&(x.closed=!0,r.nbsp||n.warning("unclosed xml attribute")),m&&R){for(var O=copyLocator(m,{}),D=0;D<R;D++){var L=x[D];o(L.offset),L.locator=copyLocator(m,{})}a.locator=O,appendElement(x,a,C)&&f.push(x),a.locator=m}else appendElement(x,a,C)&&f.push(x);"http://www.w3.org/1999/xhtml"!==x.uri||x.closed?A++:A=parseHtmlSpecialContent(e,A,x.tagName,c,a)}}catch(e){n.error("element parse error: "+e),A=-1}A>p?p=A:i(Math.max(T,p)+1)}}function copyLocator(e,t){return t.lineNumber=e.lineNumber,t.columnNumber=e.columnNumber,t}function parseElementStartPart(e,t,r,a,n,s){for(var c,i,o=++t,u=S_TAG;;){var l=e.charAt(o);switch(l){case"=":if(u===S_ATTR)c=e.slice(t,o),u=S_EQ;else{if(u!==S_ATTR_SPACE)throw new Error("attribute equal must after attrName");u=S_EQ}break;case"'":case'"':if(u===S_EQ||u===S_ATTR){if(u===S_ATTR&&(s.warning('attribute value must after "="'),c=e.slice(t,o)),t=o+1,o=e.indexOf(l,t),!(o>0))throw new Error("attribute value no end '"+l+"' match");i=e.slice(t,o).replace(/&#?\w+;/g,n),r.add(c,i,t-1),u=S_ATTR_END}else{if(u!=S_ATTR_NOQUOT_VALUE)throw new Error('attribute value must after "="');i=e.slice(t,o).replace(/&#?\w+;/g,n),r.add(c,i,t),s.warning('attribute "'+c+'" missed start quot('+l+")!!"),t=o+1,u=S_ATTR_END}break;case"/":switch(u){case S_TAG:r.setTagName(e.slice(t,o));case S_ATTR_END:case S_TAG_SPACE:case S_TAG_CLOSE:u=S_TAG_CLOSE,r.closed=!0;case S_ATTR_NOQUOT_VALUE:case S_ATTR:case S_ATTR_SPACE:break;default:throw new Error("attribute invalid close char('/')")}break;case"":return s.error("unexpected end of input"),u==S_TAG&&r.setTagName(e.slice(t,o)),o;case">":switch(u){case S_TAG:r.setTagName(e.slice(t,o));case S_ATTR_END:case S_TAG_SPACE:case S_TAG_CLOSE:break;case S_ATTR_NOQUOT_VALUE:case S_ATTR:i=e.slice(t,o),"/"===i.slice(-1)&&(r.closed=!0,i=i.slice(0,-1));case S_ATTR_SPACE:u===S_ATTR_SPACE&&(i=c),u==S_ATTR_NOQUOT_VALUE?(s.warning('attribute "'+i+'" missed quot(")!!'),r.add(c,i.replace(/&#?\w+;/g,n),t)):("http://www.w3.org/1999/xhtml"===a[""]&&i.match(/^(?:disabled|checked|selected)$/i)||s.warning('attribute "'+i+'" missed value!! "'+i+'" instead!!'),r.add(i,i,t));break;case S_EQ:throw new Error("attribute value missed!!")}return o;case"€":l=" ";default:if(l<=" ")switch(u){case S_TAG:r.setTagName(e.slice(t,o)),u=S_TAG_SPACE;break;case S_ATTR:c=e.slice(t,o),u=S_ATTR_SPACE;break;case S_ATTR_NOQUOT_VALUE:var i=e.slice(t,o).replace(/&#?\w+;/g,n);s.warning('attribute "'+i+'" missed quot(")!!'),r.add(c,i,t);case S_ATTR_END:u=S_TAG_SPACE}else switch(u){case S_ATTR_SPACE:r.tagName;"http://www.w3.org/1999/xhtml"===a[""]&&c.match(/^(?:disabled|checked|selected)$/i)||s.warning('attribute "'+c+'" missed value!! "'+c+'" instead2!!'),r.add(c,c,t),t=o,u=S_ATTR;break;case S_ATTR_END:s.warning('attribute space is required"'+c+'"!!');case S_TAG_SPACE:u=S_ATTR,t=o;break;case S_EQ:u=S_ATTR_NOQUOT_VALUE,t=o;break;case S_TAG_CLOSE:throw new Error("elements closed character '/' and '>' must be connected to")}}o++}}function appendElement(e,t,r){for(var a=e.tagName,n=null,s=e.length;s--;){var c=e[s],i=c.qName,o=c.value,u=i.indexOf(":");if(u>0)var l=c.prefix=i.slice(0,u),_=i.slice(u+1),m="xmlns"===l&&_;else _=i,l=null,m="xmlns"===i&&"";c.localName=_,m!==!1&&(null==n&&(n={},_copy(r,r={})),r[m]=n[m]=o,c.uri="http://www.w3.org/2000/xmlns/",t.startPrefixMapping(m,o))}for(var s=e.length;s--;){c=e[s];var l=c.prefix;l&&("xml"===l&&(c.uri="http://www.w3.org/XML/1998/namespace"),"xmlns"!==l&&(c.uri=r[l||""]))}var u=a.indexOf(":");u>0?(l=e.prefix=a.slice(0,u),_=e.localName=a.slice(u+1)):(l=null,_=e.localName=a);var f=e.uri=r[l||""];if(t.startElement(f,_,a,e),!e.closed)return e.currentNSMap=r,e.localNSMap=n,!0;if(t.endElement(f,_,a),n)for(l in n)t.endPrefixMapping(l)}function parseHtmlSpecialContent(e,t,r,a,n){if(/^(?:script|textarea)$/i.test(r)){var s=e.indexOf("</"+r+">",t),c=e.substring(t+1,s);if(/[&<]/.test(c))return/^script$/i.test(r)?(n.characters(c,0,c.length),s):(c=c.replace(/&#?\w+;/g,a),n.characters(c,0,c.length),s)}return t+1}function fixSelfClosed(e,t,r,a){var n=a[r];return null==n&&(n=e.lastIndexOf("</"+r+">"),n<t&&(n=e.lastIndexOf("</"+r)),a[r]=n),n<t}function _copy(e,t){for(var r in e)t[r]=e[r]}function parseDCC(e,t,r,a){var n=e.charAt(t+2);switch(n){case"-":if("-"===e.charAt(t+3)){var s=e.indexOf("-->",t+4);return s>t?(r.comment(e,t+4,s-t-4),s+3):(a.error("Unclosed comment"),-1)}return-1;default:if("CDATA["==e.substr(t+3,6)){var s=e.indexOf("]]>",t+9);return r.startCDATA(),r.characters(e,t+9,s-t-9),r.endCDATA(),s+3}var c=split(e,t),i=c.length;if(i>1&&/!doctype/i.test(c[0][0])){var o=c[1][0],u=i>3&&/^public$/i.test(c[2][0])&&c[3][0],l=i>4&&c[4][0],_=c[i-1];return r.startDTD(o,u&&u.replace(/^(['"])(.*?)\1$/,"$2"),l&&l.replace(/^(['"])(.*?)\1$/,"$2")),r.endDTD(),_.index+_[0].length}}return-1}function parseInstruction(e,t,r){var a=e.indexOf("?>",t);if(a){var n=e.substring(t,a).match(/^<\?(\S*)\s*([\s\S]*?)\s*$/);if(n){n[0].length;return r.processingInstruction(n[1],n[2]),a+2}return-1}return-1}function ElementAttributes(e){}function _set_proto_(e,t){return e.__proto__=t,e}function split(e,t){var r,a=[],n=/'[^']+'|"[^"]+"|[^\s<>\/=]+=?|(\/?\s*>|<)/g;for(n.lastIndex=t,n.exec(e);r=n.exec(e);)if(a.push(r),r[1])return a}var nameStartChar=/[A-Z_a-z\xC0-\xD6\xD8-\xF6\u00F8-\u02FF\u0370-\u037D\u037F-\u1FFF\u200C-\u200D\u2070-\u218F\u2C00-\u2FEF\u3001-\uD7FF\uF900-\uFDCF\uFDF0-\uFFFD]/,nameChar=new RegExp("[\\-\\.0-9"+nameStartChar.source.slice(1,-1)+"\\u00B7\\u0300-\\u036F\\u203F-\\u2040]"),tagNamePattern=new RegExp("^"+nameStartChar.source+nameChar.source+"*(?::"+nameStartChar.source+nameChar.source+"*)?$"),S_TAG=0,S_ATTR=1,S_ATTR_SPACE=2,S_EQ=3,S_ATTR_NOQUOT_VALUE=4,S_ATTR_END=5,S_TAG_SPACE=6,S_TAG_CLOSE=7;XMLReader.prototype={parse:function(e,t,r){var a=this.domBuilder;a.startDocument(),_copy(t,t={}),parse(e,t,r,a,this.errorHandler),a.endDocument()}},ElementAttributes.prototype={setTagName:function(e){if(!tagNamePattern.test(e))throw new Error("invalid tagName:"+e);this.tagName=e},add:function(e,t,r){if(!tagNamePattern.test(e))throw new Error("invalid attribute:"+e);this[this.length++]={qName:e,value:t,offset:r}},length:0,getLocalName:function(e){return this[e].localName},getLocator:function(e){return this[e].locator},getQName:function(e){return this[e].qName},getURI:function(e){return this[e].uri},getValue:function(e){return this[e].value}},_set_proto_({},_set_proto_.prototype)instanceof _set_proto_||(_set_proto_=function(e,t){function r(){}r.prototype=t,r=new r;for(t in e)r[t]=e[t];return r}),exports.XMLReader=XMLReader;
 
-
-},{}],9:[function(require,module,exports){
+},{}],8:[function(require,module,exports){
 "use strict";function importCommands(r){for(var i in r)g[i]=r[i]}var _=require("lodash"),vg=require("./libraries/vg/vg"),img=require("./libraries/img/img"),g={};for(var k in vg)g[k]=vg[k];delete g.delete;for(var k in img)g[k]=img[k];importCommands(require("./libraries/math")),importCommands(require("./libraries/string")),importCommands(require("./libraries/list")),importCommands(require("./libraries/data")),importCommands(require("./libraries/image")),importCommands(require("./libraries/graphics")),importCommands(require("./libraries/easing")),g.importSVG=function(r){return g.svg.parseString(r)},g.importImage=function(r){var i=g.Layer.fromImage(r);return new g.Img(i.toCanvas())},g.importText=function(r){return r?String(r):""},g.importCSV=function(r,i){function e(r,i){var e,t,n=[],m="",a=!1;for(r=r.trim(),t=0;t<r.length;t+=1)e=r[t],'"'===e?'"'===r[t+1]?(m+='"',t+=1):a=!a:e===i?a?m+=e:(n.push(m),m=""):m+=e;return n.push(m),n}var t,n;return i=i||",",r?(t=r.split(/\r\n|\r|\n/g),n=e(t[0],i),t=t.slice(1),t=_.reject(t,_.isEmpty),t=_.map(t,function(r){var t,m={};return t=_.map(e(r,i),function(r){return isNaN(r)?r:parseFloat(r)}),_.each(t,function(r,i){m[n[i]]=r}),m})):null},g.merge=function(){var r=_.flatten(arguments,!0);if(Array.isArray(r)&&(r=_.reject(r,_.isEmpty),r.length>0)){var i=r[0];if(i&&(i.commands||i.shapes||i.fontFamily))return vg.merge(r);if(i instanceof img.Img)return img.merge(r)}return null},g.mix=function(r,i,e){if(e=void 0!==e?e:.5,"number"==typeof r)return r*(1-e)+i*e;if("object"==typeof r){for(var t={},n=Object.keys(r),m=0,a=n.length;m<a;m+=1){var o=n[m],s=r[o],u=i[o];void 0!==s&&void 0!==u&&(t[o]=g.mix(s,u,e))}return t}return 0},module.exports=g;
-},{"./libraries/data":10,"./libraries/easing":12,"./libraries/graphics":13,"./libraries/image":14,"./libraries/img/img":18,"./libraries/list":21,"./libraries/math":22,"./libraries/string":23,"./libraries/vg/vg":45,"lodash":3}],10:[function(require,module,exports){
+},{"./libraries/data":9,"./libraries/easing":11,"./libraries/graphics":12,"./libraries/image":13,"./libraries/img/img":17,"./libraries/list":20,"./libraries/math":21,"./libraries/string":22,"./libraries/vg/vg":44,"lodash":2}],9:[function(require,module,exports){
 "use strict";var _=require("lodash"),list=require("./list"),g={};g.convert=function(t,r,n,e,o){var i=arguments.length;if(2===i){var u=arguments[1];r=u.inMin,n=u.inMax,e=u.outMin,o=u.outMax}else 3===i&&(r=arguments[1][0],n=arguments[1][1],e=arguments[2][0],o=arguments[2][1]);try{t=(t-r)/(n-r)}catch(n){t=r}return e+t*(o-e)},g.filterData=function(t,r,n,e){var o,i,u,l;if(null===e||void 0===e)return t;var a=[];if("=="===n)for(o=0,i=t.length;o<i;o++)u=t[o],l=u[r],l==e&&a.push(u);else if("!="===n)for(o=0,i=t.length;o<i;o++)u=t[o],l=u[r],l!=e&&a.push(u);else if(">"===n)for(o=0,i=t.length;o<i;o++)u=t[o],l=u[r],l>e&&a.push(u);else if(">="===n)for(o=0,i=t.length;o<i;o++)u=t[o],l=u[r],l>=e&&a.push(u);else if("<"===n)for(o=0,i=t.length;o<i;o++)u=t[o],l=u[r],l<e&&a.push(u);else{if("<="!==n)throw new Error("Invalid op "+n);for(o=0,i=t.length;o<i;o++)u=t[o],l=u[r],l<=e&&a.push(u)}return a},g.groupBy=function(t,r){return _.values(_.groupBy(t,r))},g.keys=function(t){for(var r=[],n=0;n<t.length;n++)r=r.concat(_.keys(t[n]));return list.distinct(r)},g.lookup=function(t,r){var n,e;return n=t,e=n[r],void 0!==e?("function"==typeof e&&(e=e.call(n)),e):(_.each(r.split("."),function(t){return n?void("function"==typeof n[t]?(e=n[t],n=e.call(n)):n=n[t]):null}),n)},g.dataScale=function(t,r,n){return{domain:t,outMin:r,outMax:n}},g.ticks=function(t,r,n){n=void 0!==n?n:10;var e,o=r-t,i=Math.pow(10,Math.floor(Math.log(o/n)/Math.LN10)),u=n/o*i,l=[];for(u<=.15?i*=10:u<=.35?i*=5:u<=.75&&(i*=2),t=Math.ceil(t/i)*i,r=Math.floor(r/i)*i+.5*i,e=t;e<r;e+=i)l.push(e);return l},module.exports=g;
 
-
-},{"./list":21,"lodash":3}],11:[function(require,module,exports){
+},{"./list":20,"lodash":2}],10:[function(require,module,exports){
 "use strict";function isBuffer(){return!1}function isObject(e){return"object"==typeof e&&null!==e}function objectToString(e){return Object.prototype.toString.call(e)}function isRegExp(e){return isObject(e)&&"[object RegExp]"===objectToString(e)}function isDate(e){return isObject(e)&&"[object Date]"===objectToString(e)}function isNullOrUndefined(e){return null===e||void 0===e}var util={isObject:isObject,isRegExp:isRegExp,isDate:isDate,isNullOrUndefined:isNullOrUndefined,isBuffer:isBuffer},pSlice=Array.prototype.slice,deepEqual={},isArguments,_deepEqual,objEquiv;_deepEqual=function(e,t){if(e===t)return!0;if(util.isBuffer(e)&&util.isBuffer(t)){if(e.length!==t.length)return!1;for(var i=0;i<e.length;i++)if(e[i]!==t[i])return!1;return!0}return util.isDate(e)&&util.isDate(t)?e.getTime()===t.getTime():util.isRegExp(e)&&util.isRegExp(t)?e.source===t.source&&e.global===t.global&&e.multiline===t.multiline&&e.lastIndex===t.lastIndex&&e.ignoreCase===t.ignoreCase:util.isObject(e)||util.isObject(t)?objEquiv(e,t):e==t},deepEqual.deepEqual=_deepEqual,isArguments=function(e){return"[object Arguments]"===Object.prototype.toString.call(e)},objEquiv=function(e,t){if(util.isNullOrUndefined(e)||util.isNullOrUndefined(t))return!1;if(e.prototype!==t.prototype)return!1;var i=isArguments(e),r=isArguments(t);if(i&&!r||!i&&r)return!1;if(i)return e=pSlice.call(e),t=pSlice.call(t),_deepEqual(e,t);var u,n,l,s;try{u=Object.keys(e),n=Object.keys(t)}catch(e){return!1}if(u.length!==n.length)return!1;for(u.sort(),n.sort(),s=u.length-1;s>=0;s--)if(u[s]!=n[s])return!1;for(s=u.length-1;s>=0;s--)if(l=u[s],!_deepEqual(e[l],t[l]))return!1;return!0},module.exports=deepEqual;
 
-
-},{}],12:[function(require,module,exports){
+},{}],11:[function(require,module,exports){
 "use strict";var g={};g.easeInQuad=function(t,n,e,u){return e*(t/=u)*t+n},g.easeOutQuad=function(t,n,e,u){return-e*(t/=u)*(t-2)+n},g.easeInOutQuad=function(t,n,e,u){return(t/=u/2)<1?e/2*t*t+n:-e/2*(--t*(t-2)-1)+n},g.easeInCubic=function(t,n,e,u){return e*(t/=u)*t*t+n},g.easeOutCubic=function(t,n,e,u){return e*((t=t/u-1)*t*t+1)+n},g.easeInOutCubic=function(t,n,e,u){return(t/=u/2)<1?e/2*t*t*t+n:e/2*((t-=2)*t*t+2)+n},g.easeInQuart=function(t,n,e,u){return e*(t/=u)*t*t*t+n},g.easeOutQuart=function(t,n,e,u){return-e*((t=t/u-1)*t*t*t-1)+n},g.easeInOutQuart=function(t,n,e,u){return(t/=u/2)<1?e/2*t*t*t*t+n:-e/2*((t-=2)*t*t*t-2)+n},g.easeInQuint=function(t,n,e,u){return e*(t/=u)*t*t*t*t+n},g.easeOutQuint=function(t,n,e,u){return e*((t=t/u-1)*t*t*t*t+1)+n},g.easeInOutQuint=function(t,n,e,u){return(t/=u/2)<1?e/2*t*t*t*t*t+n:e/2*((t-=2)*t*t*t*t+2)+n},g.easeInSine=function(t,n,e,u){return-e*Math.cos(t/u*(Math.PI/2))+e+n},g.easeOutSine=function(t,n,e,u){return e*Math.sin(t/u*(Math.PI/2))+n},g.easeInOutSine=function(t,n,e,u){return-e/2*(Math.cos(Math.PI*t/u)-1)+n},g.easeInExpo=function(t,n,e,u){return 0===t?n:e*Math.pow(2,10*(t/u-1))+n},g.easeOutExpo=function(t,n,e,u){return t===u?n+e:e*(-Math.pow(2,-10*t/u)+1)+n},g.easeInOutExpo=function(t,n,e,u){return 0===t?n:t===u?n+e:(t/=u/2)<1?e/2*Math.pow(2,10*(t-1))+n:e/2*(-Math.pow(2,-10*--t)+2)+n},g.easeInCirc=function(t,n,e,u){return-e*(Math.sqrt(1-(t/=u)*t)-1)+n},g.easeOutCirc=function(t,n,e,u){return e*Math.sqrt(1-(t=t/u-1)*t)+n},g.easeInOutCirc=function(t,n,e,u){return(t/=u/2)<1?-e/2*(Math.sqrt(1-t*t)-1)+n:e/2*(Math.sqrt(1-(t-=2)*t)+1)+n},g.easeInElastic=function(t,n,e,u){var a=1.70158,r=0,i=e;return 0===t?n:1===(t/=u)?n+e:(r||(r=.3*u),i<Math.abs(e)?(i=e,a=r/4):a=r/(2*Math.PI)*Math.asin(e/i),-(i*Math.pow(2,10*(t-=1))*Math.sin((t*u-a)*(2*Math.PI)/r))+n)},g.easeOutElastic=function(t,n,e,u){var a=1.70158,r=0,i=e;return 0===t?n:1===(t/=u)?n+e:(r||(r=.3*u),i<Math.abs(e)?(i=e,a=r/4):a=r/(2*Math.PI)*Math.asin(e/i),i*Math.pow(2,-10*t)*Math.sin((t*u-a)*(2*Math.PI)/r)+e+n)},g.easeInOutElastic=function(t,n,e,u){var a=1.70158,r=0,i=e;return 0===t?n:2===(t/=u/2)?n+e:(r||(r=u*(.3*1.5)),i<Math.abs(e)?(i=e,a=r/4):a=r/(2*Math.PI)*Math.asin(e/i),t<1?-.5*(i*Math.pow(2,10*(t-=1))*Math.sin((t*u-a)*(2*Math.PI)/r))+n:i*Math.pow(2,-10*(t-=1))*Math.sin((t*u-a)*(2*Math.PI)/r)*.5+e+n)},g.easeInBack=function(t,n,e,u,a){return void 0===a&&(a=1.70158),e*(t/=u)*t*((a+1)*t-a)+n},g.easeOutBack=function(t,n,e,u,a){return void 0===a&&(a=1.70158),e*((t=t/u-1)*t*((a+1)*t+a)+1)+n},g.easeInOutBack=function(t,n,e,u,a){return void 0===a&&(a=1.70158),(t/=u/2)<1?e/2*(t*t*(((a*=1.525)+1)*t-a))+n:e/2*((t-=2)*t*(((a*=1.525)+1)*t+a)+2)+n},g.easeInBounce=function(t,n,e,u){return e-g.easeOutBounce(u-t,0,e,u)+n},g.easeOutBounce=function(t,n,e,u){return(t/=u)<1/2.75?e*(7.5625*t*t)+n:t<2/2.75?e*(7.5625*(t-=1.5/2.75)*t+.75)+n:t<2.5/2.75?e*(7.5625*(t-=2.25/2.75)*t+.9375)+n:e*(7.5625*(t-=2.625/2.75)*t+.984375)+n},g.easeInOutBounce=function(t,n,e,u){return t<u/2?.5*g.easeInBounce(2*t,0,e,u)+n:.5*g.easeOutBounce(2*t-u,0,e,u)+.5*e+n},g.easing=function(t){var n=g[t],e=Array.prototype.slice.call(arguments,1);return n.apply(null,e)},module.exports=g;
 
-
-},{}],13:[function(require,module,exports){
+},{}],12:[function(require,module,exports){
 "use strict";function clamp(r,n,t){return Math.min(t,Math.max(n,r))}function transformShape(r,n){return n.transformShape(r)}function transformImage(r,n){return r._transform(n.m)}function transform(r,n){if(r instanceof vg.Path||r instanceof vg.Group||r instanceof vg.Text||void 0!==r.x&&void 0!==r.y)return transformShape(r,n);if(Array.isArray(r)){for(var t=[],e=0;e<r.length;e+=1)t.push(transform(r[e],n));return t}return r instanceof img.Img?transformImage(r,n):void 0}var _=require("lodash"),vg=require("./vg/vg"),img=require("./img/img"),math=require("./math"),g={};g.HORIZONTAL="horizontal",g.VERTICAL="vertical",g.BOTH="both",g.LEFT="left",g.RIGHT="right",g.CENTER="center",g.TOP="top",g.BOTTOM="bottom",g.MIDDLE="middle",g.align=function(r,n,t,e){if(r){var o,a,i,s=n.x,f=n.y,u=vg.bounds(r);return o=t===g.LEFT?s-u.x:t===g.RIGHT?s-u.x-u.width:t===g.CENTER?s-u.x-u.width/2:0,a=e===g.TOP?f-u.y:e===g.BOTTOM?f-u.y-u.height:e===g.MIDDLE?f-u.y-u.height/2:0,i=(new vg.Transform).translate(o,a),transform(r,i)}},g.colorize=function(r,n){var t=arguments;if(("object"!=typeof n||n instanceof vg.Color)&&(n={},void 0!==t[1]&&(n.fill=t[1]),void 0!==t[2]&&(n.stroke=t[2]),void 0!==t[3]&&(n.strokeWidth=t[3])),r instanceof vg.Path||r instanceof vg.Group)return r.colorize(n);if(r instanceof img.Img||r instanceof vg.Text){if(n.fill||0===n.fill)return r.colorize(n.fill);throw new Error("No color given")}},g.copy=function(r,n,t,e,o,a){var i,g,s,f,u,v=[],l=0,c=0,h=0,m=1,d=1,p=!1;for(r instanceof vg.Path||r instanceof vg.Group||r instanceof vg.Text?u=transformShape:Array.isArray(r)&&r.length>0&&void 0!==r[0].x&&void 0!==r[0].y?(p=!0,u=transformShape):r instanceof img.Img&&(u=transformImage),i=0;i<n;i+=1){for(g=new vg.Transform,s=0;s<t.length;s+=1)f=t[s],"t"===f?g=g.translate(l,c):"r"===f?g=g.rotate(h):"s"===f&&(g=g.scale(m,d));p?v=v.concat(u(r,g)):v.push(u(r,g)),l+=e.x,c+=e.y,h+=o,m+=a.x,d+=a.y}return v},g.flip=function(r,n){if("none"===n)return r;if(r instanceof vg.Path||r instanceof vg.Group||r instanceof vg.Text||Array.isArray(r)&&r.length>0&&void 0!==r[0].x&&void 0!==r[0].y){var t=n===g.HORIZONTAL||n===g.BOTH?-1:1,e=n===g.VERTICAL||n===g.BOTH?-1:1;return vg.scale(r,new vg.Point(t,e),vg.centerPoint(r))}if(r instanceof img.Img){var o=r,a=o.toLayer(!1);return n!==g.HORIZONTAL&&n!==g.BOTH||a.flipHorizontal(),n!==g.VERTICAL&&n!==g.BOTH||a.flipVertical(),o.withCanvas(a.toCanvas())}},g.fit=function(r,n,t,e,o){if(r){o=void 0!==o&&o;var a,i,g,s=vg.bounds(r),f=s.x,u=s.y,v=s.width,l=s.height;return v=v>1e-12?v:0,l=l>1e-12?l:0,a=new vg.Transform,a=a.translate(n.x,n.y),o?(i=v>0?t/v:1,g=l>0?e/l:1):(i=v>0?t/v:Number.MAX_VALUE,g=l>0?e/l:Number.MAX_VALUE,i=g=Math.min(i,g)),a=a.scale(i,g),a=a.translate(-v/2-f,-l/2-u),transform(r,a)}},g.fitTo=function(r,n,t){if(r){if(!n)return r;var e=vg.bounds(n),o=e.x,a=e.y,i=e.width,s=e.height;return g.fit(r,{x:o+i/2,y:a+s/2},i,s,t)}},g.hslAdjust=function(r,n,t,e,o){function a(e){if(e instanceof vg.Group){for(var i=[],g=0;g<e.shapes.length;g+=1)i.push(a(e.shapes[g]));return new vg.Group(i)}if(e instanceof vg.Path){var b=e.clone();return b.fill=a(b.fill),b.stroke=a(b.stroke),b}var A=e;return A instanceof vg.Color||(A=vg.Color.parse(A)),s=A.r,f=A.g,u=A.b,0===n&&0===t||(v=s,f>v&&(v=f),u>v&&(v=u),l=s,f<l&&(l=f),u<l&&(l=u),c=v-l,d=(l+v)/2,d>0&&c>0&&(d<=.5?(m=c/(v+l)*w,m>1&&(m=1),r=d*(1+m)):(m=c/(2-v-l)*w,m>1&&(m=1),r=d+m-d*m),h=s===v?f===l?5+(v-u)/c+n:1-(v-f)/c+n:f===v?u===l?1+(v-s)/c+n:3-(v-u)/c+n:s===l?3+(v-f)/c+n:5-(v-s)/c+n,h<0&&(h+=6),h>=6&&(h-=6),p=d+d-r,T=h>>0,y=(r-p)*(h-T),0===T?(s=r,f=p+y,u=p):1===T?(s=r-y,f=r,u=p):2===T?(s=p,f=r,u=p+y):3===T?(s=p,f=r-y,u=r):4===T?(s=p+y,f=p,u=r):5===T&&(s=r,f=p,u=r-y))),s=s*x+C,f=f*x+C,u=u*x+C,s<0&&(s=0),f<0&&(f=0),u<0&&(u=0),s>1&&(s=1),f>1&&(f=1),u>1&&(u=1),new vg.Color(s,f,u,A.a+o)}if(o||(o=0),r instanceof img.Img){var i=r,g=i.toLayer(!1);return g.addFilter("hslAdjust",{h:n,s:t,l:e,a:o}),i.withCanvas(g.toCanvas())}n=clamp(n,-1,1),t=clamp(t,-1,1),e=clamp(e,-1,1),o=clamp(o,-1,1);var s,f,u,v,l,c,h,m,d,p,y,T,w=1+t*(t<0?1:2),x=e<0?1+e:1-e,C=e<0?0:e;return n=6*n%6,a(r)},g.rgbAdjust=function(r,n,t,e,o){function a(r){if(r instanceof img.Img){var i=r,g=i.toLayer(!1);return g.addFilter("rgbAdjust",{r:n,g:t,b:e,a:o}),i.withCanvas(g.toCanvas())}if(r instanceof vg.Group){for(var s=[],f=0;f<r.shapes.length;f+=1)s.push(a(r.shapes[f]));return new vg.Group(s)}if(r instanceof vg.Path){var u=r.clone();return u.fill=a(u.fill),u.stroke=a(u.stroke),u}var v=r;return v instanceof vg.Color||(v=vg.Color.parse(v)),new vg.Color(v.r+n,v.g+t,v.b+e,v.a+o)}return o||(o=0),n=clamp(n,-1,1),t=clamp(t,-1,1),e=clamp(e,-1,1),o=clamp(o,-1,1),a(r)},g.stack=function(r,n,t){if(!r)return[];if(r.length<=1)return r;var e,o,a,i,g=r[0].bounds(),s=[];return"e"===n?(e=g.x,_.each(r,function(r){i=r.bounds(),a=(new vg.Transform).translate(e-i.x,0),s.push(transform(r,a)),e+=i.width+t})):"w"===n?(e=g.x+g.width,_.each(r,function(r){i=r.bounds(),a=(new vg.Transform).translate(e-(i.x+i.width),0),s.push(transform(r,a)),e-=i.width+t})):"n"===n?(o=g.y+g.height,_.each(r,function(r){i=r.bounds(),a=(new vg.Transform).translate(0,o-(i.y+i.height)),s.push(transform(r,a)),o-=i.height+t})):"s"===n&&(o=g.y,_.each(r,function(r){i=r.bounds(),a=(new vg.Transform).translate(0,o-i.y),s.push(transform(r,a)),o+=i.height+t})),s},g.angle=function(r,n){var t=arguments;return 4===t.length?(r=vg.Point.read(t[0],t[1]),n=vg.Point.read(t[2],t[3])):(r=vg.Point.read(r),n=vg.Point.read(n)),math.degrees(Math.atan2(n.y-r.y,n.x-r.x))},g.coordinates=function(r,n,t){var e=arguments;return 4===e.length?(r=vg.Point.read(e[0],e[1]),n=e[2],t=e[3]):r=vg.Point.read(r),vg.geo.coordinates(r.x,r.y,n,t)},g.distance=function(r,n){var t=arguments;return 4===t.length?(r=vg.Point.read(t[0],t[1]),n=vg.Point.read(t[2],t[3])):(r=vg.Point.read(r),n=vg.Point.read(n)),Math.sqrt(Math.pow(n.x-r.x,2)+Math.pow(n.y-r.y,2))},g.grayColor=function(r,n){return n||0===n||(n=1),vg.Color.gray(r,n,1)},g.hexColor=function(r){function n(r){return!isNaN(parseFloat(r))&&isFinite(r)}return r=n(r)?r.toString(16):String(r),"#"!==r[0]&&(r="#"+r),vg.Color.parse(r)},g.hslColor=function(r,n,t,e){return e||0===e||(e=1),vg.Color.hsl(r,n,t,e,1)},g.rgbColor=function(r,n,t,e){return e||0===e||(e=1),vg.Color.rgb(r,n,t,e,1)},g.desaturate=function(r,n){return r?r.desaturate({method:n}):null},g.invert=function(r){if(!r)return null;if(r instanceof img.Img){var n=r,t=n.toLayer(!1);return t.addFilter("invert"),n.withCanvas(t.toCanvas())}return r.invert()},module.exports=g;
 
-
-},{"./img/img":18,"./math":22,"./vg/vg":45,"lodash":3}],14:[function(require,module,exports){
+},{"./img/img":17,"./math":21,"./vg/vg":44,"lodash":2}],13:[function(require,module,exports){
 "use strict";var vg=require("./vg/vg"),img=require("./img/img"),Img=img.Img,Layer=img.Layer,ImageCanvas=img.ImageCanvas,g={};g.blend=function(a,t,e){var r=a.bounds(),n=t.bounds(),i=new vg.Rect(r.x,r.y,r.width,r.height).unite(n),o=Math.ceil(i.width),d=Math.ceil(i.height),s=o/2+i.x,g=d/2+i.y,h=new ImageCanvas(o,d),u=h.addLayer(a.toLayer());u.translate(-s,-g);var v=h.addLayer(t.toLayer());return v.translate(-s,-g),v.blendmode=e,new Img(h.render(),s,g)},g.blur=function(a,t){var e=a.toLayer(!1);return e.addFilter("blur",{radius:t}),a.withCanvas(e.toCanvas())},g.brighten=function(a,t,e){var r=a.toLayer(!1);return r.addFilter("brightness",{brightness:t/100,contrast:e/100}),a.withCanvas(r.toCanvas())},g.bump=function(a,t,e,r){var n=a.toLayer(!1);return n.addFilter("bump",{dx:t.x,dy:t.y,radius:e,zoom:r/100}),a.withCanvas(n.toCanvas())},g.colorImage=function(a,t,e){var r=Layer.fromColor(e);return r.width=a,r.height=t,new Img(r.toCanvas())},g.crop=function(a,t){return a.crop(t)},g.crossEdges=function(a,t){var e=a.toLayer(!1);return e.addFilter("crossedges",{strength:t/100}),a.withCanvas(e.toCanvas())},g.dent=function(a,t,e,r){var n=a.toLayer(!1);return n.addFilter("dent",{dx:t.x,dy:t.y,radius:e,zoom:r/100}),a.withCanvas(n.toCanvas())},g.emboss=function(a,t,e){var r=a.toLayer(!1);return r.addFilter("emboss",{amount:t/100,angle:e}),a.withCanvas(r.toCanvas())},g.equalize=function(a){var t=a.toLayer(!1);return t.addFilter("equalize"),a.withCanvas(t.toCanvas())},g.findEdges=function(a){var t=a.toLayer(!1);return t.addFilter("findedges"),a.withCanvas(t.toCanvas())},g.glow=function(a,t,e){var r=a.toLayer(!1);return r.addFilter("glow",{amount:t/100,kernelSize:e}),a.withCanvas(r.toCanvas())},g.gradientImage=function(a,t,e,r,n,i,o){var d=Layer.fromGradient(e,r,n,i,o/100);return d.width=a,d.height=t,new Img(d.toCanvas())},g.histogram=function(a,t,e){var r,n,i,o,d=a.getPixels(),s=new Array(256);for(r=0;r<s.length;r+=1)s[r]=0;if("lum"===t)for(r=0;r<d.width*d.height;r+=1)i=d.get(r),o=.2125*i[0]+.7154*i[1]+.0721*i[2],s[Math.round(o)]+=1;else for("red"===t&&(n=0),"green"===t&&(n=1),"blue"===t&&(n=2),"alpha"===t&&(n=3),r=0;r<d.width*d.height;r+=1)i=d.get(r),o=i[n],s[o]+=1;if(e)for(r=0;r<s.length;r+=1)s[r]/=d.width*d.height;return s},g.lightTunnel=function(a,t,e){var r=a.toLayer(!1);return r.addFilter("splash",{dx:t.x,dy:t.y,radius:e}),a.withCanvas(r.toCanvas())},g.luminanceBW=function(a){var t=a.toLayer(!1);return t.addFilter("luminancebw"),a.withCanvas(t.toCanvas())},g.mask=function(a,t){a=a.transformed(),t=t.transformed();var e=a.toLayer(!1),r=t.toLayer(),n=a.bounds(),i=t.bounds(),o=new vg.Rect(n.x,n.y,n.width,n.height).unite(i),d=Math.ceil(o.width),s=Math.ceil(o.height),g=d/2+o.x,h=s/2+o.y;r.translate(-g,-h);var u=e.mask.addLayer("white");return u.width=e.width,u.height=e.height,e.mask.addLayer(r),a.withCanvas(e.toCanvas())},g.mosaic=function(a,t){var e=a.toLayer(!1);return e.addFilter("mosaic",{blockSize:t}),a.withCanvas(e.toCanvas())},g.pinch=function(a,t,e){var r=a.toLayer(!1);return r.addFilter("pinch",{dx:t.x,dy:t.y,zoom:e/100}),a.withCanvas(r.toCanvas())},g.posterize=function(a,t){var e=a.toLayer(!1);return e.addFilter("posterize",{levels:t}),a.withCanvas(e.toCanvas())},g.removeNoise=function(a){var t=a.toLayer(!1);return t.addFilter("removenoise"),a.withCanvas(t.toCanvas())},g.solarize=function(a){var t=a.toLayer(!1);return t.addFilter("solarize"),a.withCanvas(t.toCanvas())},g.toBitmap=function(a,t){var e,r=document.createElement("canvas");e=t?t.bounds():a.bounds();var n=e.x,i=e.y,o=r.width=Math.ceil(e.width),d=r.height=Math.ceil(e.height),s=r.getContext("2d");return s.translate(-n,-i),a.draw(s),new Img(r,o/2+n,d/2+i)},g.toPixels=function(a,t){t=t>1?t:1;for(var e=a.canvas,r=e.width,n=e.height,i=e.getContext("2d"),o=i.getImageData(0,0,e.width,e.height),d=o.data,s=4*e.width,g=[],h=0;h<n;h+=t)for(var u=0;u<r;u+=t){var v=h*s+4*u,l=d[v],c=d[v+1],w=d[v+2],m=d[v+3];g.push({x:u-r/2,y:h-n/2,r:l,g:c,b:w,a:m,color:new vg.Color(l/255,c/255,w/255,m/255)})}return g},g.twirl=function(a,t,e,r){var n=a.toLayer(!1);return n.addFilter("twirl",{dx:t.x,dy:t.y,radius:e,angle:r}),a.withCanvas(n.toCanvas())},module.exports=g;
 
-
-},{"./img/img":18,"./vg/vg":45}],15:[function(require,module,exports){
+},{"./img/img":17,"./vg/vg":44}],14:[function(require,module,exports){
 "use strict";function passThrough(e,n){n(null,e)}function processLayers(e){return function(n,r){async.compose(AsyncRenderer.processImage(n.filters),AsyncRenderer.processMask(n.mask),AsyncRenderer.load(e,n))(null,r)}}var async=require("async"),process=require("./process"),CanvasRenderer=require("./canvasrenderer"),AsyncRenderer={};AsyncRenderer.toImage=function(){return function(e,n){n(null,CanvasRenderer.toImage(e))}},AsyncRenderer.load=function(e,n){return n.isPath()?AsyncRenderer.loadFile(n.data):n.isFill()?AsyncRenderer.generateColor(e,n):n.isGradient()?AsyncRenderer.generateGradient(e,n):n.isHtmlCanvas()?AsyncRenderer.loadHtmlCanvas(n.data):n.isImage()?AsyncRenderer.loadImage(n.data):n.isImageCanvas()?AsyncRenderer.loadImageCanvas(n.data):void 0},AsyncRenderer.loadFile=function(e){return function(n,r){var a=document.createElement("canvas"),t=a.getContext("2d"),s=new Image;s.onload=function(){a.width=s.width,a.height=s.height,t.drawImage(s,0,0,a.width,a.height),r(null,a)},s.src=e}},AsyncRenderer.loadHtmlCanvas=function(e){return function(n,r){r(null,e)}},AsyncRenderer.loadImageCanvas=function(e){return function(n,r){e.render(function(e){r(null,e)})}},AsyncRenderer.loadImage=function(e){return function(n,r){var a=CanvasRenderer.loadImage(e);r(null,a)}},AsyncRenderer.generateColor=function(e,n){return function(r,a){var t=CanvasRenderer.generateColor(e,n);a(null,t)}},AsyncRenderer.generateGradient=function(e,n){return function(r,a){var t=CanvasRenderer.generateGradient(e,n);a(null,t)}},AsyncRenderer.processImage=function(e){return 0===e.length?passThrough:function(n,r){CanvasRenderer.processImage(n,e),r(null,n)}},AsyncRenderer.processMask=function(e){return 0===e.layers.length?passThrough:function(n,r){e.width=n.width,e.height=n.height,AsyncRenderer.renderBW(e,function(e){var a=e.getContext("2d").getImageData(0,0,e.width,e.height).data,t={name:"mask",options:{data:a,x:0,y:0,width:e.width,height:e.height}},s=AsyncRenderer.processImage([t]);s(n,r)})}},AsyncRenderer.mergeManualBlend=function(e,n){return function(r,a){CanvasRenderer.mergeManualBlend(e,n)(r),a(null,r)}},AsyncRenderer.mergeNativeBlend=function(e,n){return function(r,a){CanvasRenderer.mergeNativeBlend(e,n)(r),a(null,r)}},AsyncRenderer.merge=function(e,n,r){var a=CanvasRenderer.createRenderPipe(AsyncRenderer,e,n);a.reverse();var t=CanvasRenderer.singleLayerWithOpacity(e,n[0]);a.push(function(e,n){n(null,t)}),async.compose.apply(null,a)(null,function(){r(t)})},AsyncRenderer.composite=function(e,n,r){return n&&0!==n.length?1===n.length?void r(CanvasRenderer.singleLayerWithOpacity(e,n[0])):void AsyncRenderer.merge(e,n,r):void r(null)},AsyncRenderer.render=function(e,n){async.map(e.layers,processLayers(e),function(r,a){n&&AsyncRenderer.composite(e,CanvasRenderer.getLayerData(e,a),n)})},AsyncRenderer.renderBW=function(e,n){AsyncRenderer.render(e,function(e){var r=(e.getContext("2d").getImageData(0,0,e.width,e.height).data,{name:"desaturate",options:{method:"ITU-R BT.709"}}),a=AsyncRenderer.processImage([r]);a(e,function(e,r){n(r)})})},module.exports=AsyncRenderer;
 
-
-},{"./canvasrenderer":17,"./process":19,"async":1}],16:[function(require,module,exports){
+},{"./canvasrenderer":16,"./process":18,"async":1}],15:[function(require,module,exports){
 "use strict";function addAliases(n){var t,e,i,o=Object.keys(aliases);for(t=0;t<o.length;t+=1)e=o[t],i=aliases[e],n[e]=n[i]}function realBlendMode(n){return void 0!==aliases[n]?aliases[n]:n}function getNativeModes(){if("undefined"==typeof document)return{};var n,t,e,i,o={},r=document.createElement("canvas"),a=r.getContext("2d");if(!a)return{};var l=["source-over","source-in","source-out","source-atop","destination-over","destination-in","destination-out","destination-atop","lighter","darker","copy","xor"],d=["multiply","screen","overlay","soft-light","hard-light","color-dodge","color-burn","darken","lighten","difference","exclusion","hue","saturation","luminosity","color","add","subtract","average","negation"],c=["divide","darker-color","lighter-color","linear-burn","linear-light","vivid-light","pin-light","hard-mix"];for(n=0;n<l.length;n+=1)o[l[n]]=!0;for(n=0;n<c.length;n+=1)o[c[n]]=!1;for(r.width=1,r.height=1,n=0;n<d.length;n+=1){t=d[n],e="darken"===t,i=!1,a.save();try{a.fillStyle=e?"#300":"#a00",a.fillRect(0,0,1,1),a.globalCompositeOperation=t,a.globalCompositeOperation===t&&(a.fillStyle=e?"#a00":"#300",a.fillRect(0,0,1,1),i=a.getImageData(0,0,1,1).data[0]!==(e?170:51))}catch(n){}a.restore(),o[t]=i}return addAliases(o),o}function _blend(n,t,e,i,o){process(n,t,e,i,o)}function _wrap(n){return function(t,e,i,o,r){r.type=n,_blend(t,e,i,o,r)}}var blend,process,aliases={normal:"source-over","linear-dodge":"add"};process=function(n,t,e,i,o){function r(n,t,e){n/=255,t/=255,e/=255;var i,o,r;return n===t&&t===e?(o=0,i=0):n>=t&&t>=e?(o=n-e,i=60*(t-e)/o):t>n&&n>=e?(o=t-e,i=60*(t-n)/o+60):t>=e&&e>n?(o=t-n,i=60*(e-n)/o+120):e>t&&t>n?(o=e-n,i=60*(e-t)/o+180):e>n&&n>=t?(o=e-t,i=60*(n-t)/o+240):(o=n-t,i=60*(n-e)/o+300),r=V*n+W*t+X*e,[i%360,U(T(o,0),1),U(T(r,0),1)]}function a(n,t,e){n%=360;var i,o,r,a;return n>=0&&n<60?(a=t*n/60,r=e-V*t-W*a,i=r+t,o=r+a):n>=60&&n<120?(a=t*(n-60)/60,o=e+X*t+V*a,r=o-t,i=o-a):n>=120&&n<180?(a=t*(n-120)/60,i=e-W*t-X*a,o=i+t,r=i+a):n>=180&&n<240?(a=t*(n-180)/60,r=e+V*t+W*a,i=r-t,o=r-a):n>=240&&n<300?(a=t*(n-240)/60,o=e-X*t-V*a,r=o+t,i=o+a):(a=t*(n-300)/60,i=e+W*t+X*a,o=i-t,r=i-a),i=255*U(T(i,0),1),o=255*U(T(o,0),1),r=255*U(T(r,0),1),[i,o,r]}function l(){L=I+G-G*F,P=q+H-H*F,Q=z+J-J*F}function d(){L=I*G+I*(1-K)+G*(1-F),P=q*H+q*(1-K)+H*(1-F),Q=z*J+z*(1-K)+J*(1-F)}function c(){L=T(G*F-I*K,0)+I*(1-K)+G*(1-F),P=T(H*F-q*K,0)+q*(1-K)+H*(1-F),Q=T(J*F-z*K,0)+z*(1-K)+J*(1-F)}function u(){L=0===I?0:G/I*255,P=0===q?0:H/q*255,Q=0===z?0:J/z*255}function f(){L=I+G-I*G,P=q+H-q*H,Q=z+J-z*J}function s(){L=T(I*K,G*F)+I*(1-K)+G*(1-F),P=T(q*K,H*F)+q*(1-K)+H*(1-F),Q=T(z*K,J*F)+z*(1-K)+J*(1-F)}function h(){L=U(I*K,G*F)+I*(1-K)+G*(1-F),P=U(q*K,H*F)+q*(1-K)+H*(1-F),Q=U(z*K,J*F)+z*(1-K)+J*(1-F)}function v(){G*F*.3+H*F*.59+J*F*.11<=I*K*.3+q*K*.59+z*K*.11?(L=G*F,P=H*F,Q=J*F):(L=I*K,P=q*K,Q=z*K),L+=I*(1-K)+G*(1-F),P+=q*(1-K)+H*(1-F),Q+=z*(1-K)+J*(1-F)}function g(){G*F*.3+H*F*.59+J*F*.11>I*K*.3+q*K*.59+z*K*.11?(L=G*F,P=H*F,Q=J*F):(L=I*K,P=q*K,Q=z*K),L+=I*(1-K)+G*(1-F),P+=q*(1-K)+H*(1-F),Q+=z*(1-K)+J*(1-F)}function y(){L=U(G+I,255),P=U(H+q,255),Q=U(J+z,255)}function p(){L=G+I,P=H+q,Q=J+z,L=L<255?0:L-255,P=P<255?0:P-255,Q=Q<255?0:Q-255}function m(){L=I+G-2*U(I*K,G*F),P=q+H-2*U(q*K,H*F),Q=z+J-2*U(z*K,J*F)}function b(){L=I*K+G*F-2*I*G+I*(1-K)+G*(1-F),P=q*K+H*F-2*q*H+q*(1-K)+H*(1-F),Q=z*K+J*F-2*z*J+z*(1-K)+J*(1-F)}function x(){L=2*G<=K?2*I*G+I*(1-K)+G*(1-F):I*(1+K)+G*(1+F)-2*G*I-K*F,P=2*H<=K?2*q*H+q*(1-K)+H*(1-F):q*(1+K)+H*(1+F)-2*H*q-K*F,Q=2*J<=K?2*z*J+z*(1-K)+J*(1-F):z*(1+K)+J*(1+F)-2*J*z-K*F}function k(){var n,t=Math.pow;return 0===K?(L=I,P=q,void(Q=z)):(n=G/K,2*I<=F?L=G*(F+(2*I-F)*(1-n))+I*(1-K)+G*(1-F):2*I>F&&4*G<=K?L=K*(2*I-F)*(16*t(n,3)-12*t(n,2)-3*n)+I-I*K+G:2*I>F&&4*G>K&&(L=K*(2*I-F)*(t(n,.5)-n)+I-I*K+G),n=H/K,2*q<=F?P=H*(F+(2*q-F)*(1-n))+q*(1-K)+H*(1-F):2*q>F&&4*H<=K?P=K*(2*q-F)*(16*t(n,3)-12*t(n,2)-3*n)+q-q*K+H:2*q>F&&4*H>K&&(P=K*(2*q-F)*(t(n,.5)-n)+q-q*K+H),n=J/K,void(2*z<=F?Q=J*(F+(2*z-F)*(1-n))+z*(1-K)+J*(1-F):2*z>F&&4*J<=K?Q=K*(2*z-F)*(16*t(n,3)-12*t(n,2)-3*n)+z-z*K+J:2*z>F&&4*J>K&&(Q=K*(2*z-F)*(t(n,.5)-n)+z-z*K+J)))}function w(){L=2*I<=F?2*I*G+I*(1-K)+G*(1-F):I*(1+K)+G*(1+F)-F*K-2*I*G,P=2*q<=F?2*q*H+q*(1-K)+H*(1-F):q*(1+K)+H*(1+F)-F*K-2*q*H,Q=2*z<=F?2*z*J+z*(1-K)+J*(1-F):z*(1+K)+J*(1+F)-F*K-2*z*J}function M(){return 0===K?(L=I,P=q,void(Q=z)):(I===F&&0===G?L=I*(1-K):I===F?L=F*K+I*(1-K)+G*(1-F):I<F&&(L=F*K*U(1,G/K*F/(F-I))+I*(1-K)+G*(1-F)),q===F&&0===H?P=q*(1-K):I===F?P=F*K+q*(1-K)+H*(1-F):I<F&&(P=F*K*U(1,H/K*F/(F-q))+q*(1-K)+H*(1-F)),void(z===F&&0===J?Q=z*(1-K):I===F?Q=F*K+z*(1-K)+J*(1-F):I<F&&(Q=F*K*U(1,J/K*F/(F-z))+z*(1-K)+J*(1-F))))}function _(){return 0===K?(L=I,P=q,void(Q=z)):(0===I&&G===K?L=F*K+G*(1-F):0===I?L=G*(1-F):I>0&&(L=F*K*(1-U(1,(1-G/K)*F/I))+I*(1-K)+G*(1-F)),0===q&&H===K?P=F*K+H*(1-F):0===q?P=H*(1-F):q>0&&(P=F*K*(1-U(1,(1-H/K)*F/q))+q*(1-K)+H*(1-F)),void(0===z&&J===K?Q=F*K+J*(1-F):0===z?Q=J*(1-F):z>0&&(Q=F*K*(1-U(1,(1-J/K)*F/z))+z*(1-K)+J*(1-F))))}function O(){var n=2*I+G-256,t=2*q+H-256,e=2*z+J-256;L=n<0||I<128&&n<0?0:n>255?255:n,P=t<0||q<128&&t<0?0:t>255?255:t,Q=e<0||z<128&&e<0?0:e>255?255:e}function A(){var n;I<128?I?(n=255-(255-G<<8)/(2*I),L=n<0?0:n):L=0:(n=2*I-256,n<255?(n=(G<<8)/(255-n),L=n>255?255:n):L=n<0?0:n),q<128?q?(n=255-(255-H<<8)/(2*q),P=n<0?0:n):P=0:(n=2*q-256,n<255?(n=(H<<8)/(255-n),P=n>255?255:n):P=n<0?0:n),z<128?z?(n=255-(255-J<<8)/(2*z),Q=n<0?0:n):Q=0:(n=2*z-256,n<255?(n=(J<<8)/(255-n),Q=n>255?255:n):Q=n<0?0:n)}function B(){var n;I<128?(n=2*I,L=G<n?G:n):(n=2*I-256,L=G>n?G:n),q<128?(n=2*q,P=H<n?H:n):(n=2*q-256,P=H>n?H:n),z<128?(n=2*z,Q=J<n?J:n):(n=2*z-256,Q=J>n?J:n)}function C(){var n;I<128?L=255-(255-G<<8)/(2*I)<128||0===I?0:255:(n=2*I-256,L=n<255&&(G<<8)/(255-n)<128?0:255),q<128?P=255-(255-H<<8)/(2*q)<128||0===q?0:255:(n=2*q-256,P=n<255&&(H<<8)/(255-n)<128?0:255),z<128?Q=255-(255-J<<8)/(2*z)<128||0===z?0:255:(n=2*z-256,Q=n<255&&(J<<8)/(255-n)<128?0:255)}function N(){var n=r(G,H,J),t=r(I,q,z),e=a(t[0],n[1],n[2]);L=e[0],P=e[1],Q=e[2]}function j(){var n=r(G,H,J),t=r(I,q,z),e=a(n[0],t[1],n[2]);L=e[0],P=e[1],Q=e[2]}function R(){var n=r(G,H,J),t=r(I,q,z),e=a(n[0],n[1],t[2]);L=e[0],P=e[1],Q=e[2]}function S(){var n=r(G,H,J),t=r(I,q,z),e=a(t[0],t[1],n[2]);L=e[0],P=e[1],Q=e[2]}function D(n,t){var e=n.x+n.width,i=n.y+n.height,o=t.x+t.width,r=t.y+t.height,a=T(n.x,t.x),l=T(n.y,t.y),d=T(U(e,o)-a,0),c=T(U(i,r)-l,0);return[a,l,d,c]}var E,I,q,z,F,G,H,J,K,L,P,Q,T=Math.max,U=Math.min,V=.2126,W=.7152,X=.0722;E={"source-over":l,multiply:d,subtract:c,divide:u,screen:f,lighten:s,darken:h,"darker-color":v,"lighter-color":g,add:y,"linear-burn":p,difference:m,exclusion:b,overlay:x,"soft-light":k,"hard-light":w,"color-dodge":M,"color-burn":_,"linear-light":O,"vivid-light":A,"pin-light":B,"hard-mix":C,hue:N,saturation:j,luminosity:R,color:S},function(){function r(){F=y[d+3]/255*p,K=n[l+3]/255,h=F+K-F*K,v=255/h,I=y[d]/255*F,q=y[d+1]/255*F,z=y[d+2]/255*F,G=n[l]/255*K,H=n[l+1]/255*K,J=n[l+2]/255*K,m(),t[l]=L*v,t[l+1]=P*v,t[l+2]=Q*v,t[l+3]=255*h}function a(){G=n[l],H=n[l+1],J=n[l+2],I=y[d],q=y[d+1],z=y[d+2],m(),t[l]=L,t[l+1]=P,t[l+2]=Q,t[l+3]=n[l+3],f=p*y[d+3]/255,f<1&&(s=1-f,t[l]=n[l]*s+t[l]*f,t[l+1]=n[l+1]*s+t[l+1]*f,t[l+2]=n[l+2]*s+t[l+2]*f)}var l,d,c,u,f,s,h,v,g,y=o.data,p=0===o.opacity?0:o.opacity||1,m=E[o.type||"_svg_normal"],b=o.dx||0,x=o.dy||0,k=D({x:0,y:0,width:e,height:i},{x:b,y:x,width:o.width,height:o.height}),w=k[0],M=k[1],_=k[2],O=k[3];for(g=0===m.name.indexOf("_svg_")?r:a,u=0;u<i;u+=1)for(c=0;c<e;c+=1)l=4*(u*e+c),u>=M&&c>=w&&c<w+_&&u<M+O?(d=4*((u-x)*o.width+c-b),g()):(t[l]=n[l],t[l+1]=n[l+1],t[l+2]=n[l+2],t[l+3]=n[l+3])}()},blend=function(){for(var n,t={blend:_blend},e=["source-over","add","multiply","subtract","divide","screen","lighten","darken","darker-color","lighter-color","linear-burn","difference","exclusion","overlay","soft-light","hard-light","color-dodge","color-burn","linear-light","vivid-light","pin-light","hard-mix","hue","saturation","luminosity","color"],i=0;i<e.length;i+=1)n=e[i],t[n]=_wrap(n);for(e=Object.keys(e),i=0;i<e.length;i+=1);return addAliases(t),t.getNativeModes=getNativeModes,t.realBlendMode=realBlendMode,t}(),module.exports=blend;
 
-
-},{}],17:[function(require,module,exports){
+},{}],16:[function(require,module,exports){
 "use strict";function createImageData(e,a,t){return e.createImageData?e.createImageData(a,t):e.getImageData(0,0,a,t)}function transformLayer(e,a,t){var r=t.transform.matrix();e.translate(a.width/2,a.height/2),e.transform(r[0],r[1],r[3],r[4],r[6],r[7]),(t.flip_h||t.flip_v)&&e.scale(t.flip_h?-1:1,t.flip_v?-1:1),e.translate(-t.img.width/2,-t.img.height/2)}function transformRect(e,a){var t,r,n,i,d,h=a.img.width,o=a.img.height,s={x:0,y:0},g={x:h,y:0},l={x:0,y:o},m={x:h,y:o},c=[s,g,l,m],v=util.transform();v=v.translate(e.width/2,e.height/2),v=v.append(a.transform),v=v.translate(-a.img.width/2,-a.img.height/2);for(var u=0;u<4;u+=1)t=v.transformPoint(c[u]),0===u?(r=i=t.x,n=d=t.y):(t.x<r&&(r=t.x),t.x>i&&(i=t.x),t.y<n&&(n=t.y),t.y>d&&(d=t.y));return{x:r,y:n,width:i-r,height:d-n}}function rectIntersect(e,a){var t=e.x+e.width,r=e.y+e.height,n=a.x+a.width,i=a.y+a.height,d=Math.max(e.x,a.x),h=Math.max(e.y,a.y),o=Math.max(Math.min(t,n)-d,0),s=Math.max(Math.min(r,i)-h,0);return{x:d,y:h,width:o,height:s}}function calcLayerRect(e,a){var t=transformRect(e,a);return t=rectIntersect(t,{x:0,y:0,width:e.width,height:e.height}),{x:Math.round(t.x),y:Math.round(t.y),width:Math.ceil(t.width),height:Math.ceil(t.height)}}function getTransformedLayerData(e,a,t){var r=document.createElement("canvas"),n=r.getContext("2d");return r.width=t.width,r.height=t.height,n.translate(-t.x,-t.y),transformLayer(n,e,a),n.drawImage(a.img,0,0),n.getImageData(0,0,t.width,t.height)}var blend=require("./blend"),process=require("./process"),util=require("./util"),nativeBlendModes=blend.getNativeModes(),CanvasRenderer={};CanvasRenderer.toImage=function(e){var a=new Image;return a.width=e.width,a.height=e.height,a.src=e.toDataURL(),a},CanvasRenderer.load=function(e,a){return a.isFill()?CanvasRenderer.generateColor(e,a):a.isGradient()?CanvasRenderer.generateGradient(e,a):a.isHtmlCanvas()?CanvasRenderer.loadHtmlCanvas(a.data):a.isImage()?CanvasRenderer.loadImage(a.data):a.isImageCanvas()?CanvasRenderer.loadImageCanvas(a.data):void 0},CanvasRenderer.loadHtmlCanvas=function(e){return e},CanvasRenderer.loadImageCanvas=function(e){return e.render()},CanvasRenderer.loadImage=function(e){var a=document.createElement("canvas"),t=a.getContext("2d");return a.width=e.width,a.height=e.height,t.drawImage(e,0,0,a.width,a.height),a},CanvasRenderer.generateColor=function(e,a){var t=void 0!==a.width?a.width:e.width,r=void 0!==a.height?a.height:e.height,n=document.createElement("canvas"),i=n.getContext("2d");return n.width=t,n.height=r,i.fillStyle=a.data,i.fillRect(0,0,t,r),n},CanvasRenderer.generateGradient=function(e,a){var t,r,n,i,d,h=void 0!==a.width?a.width:e.width,o=void 0!==a.height?a.height:e.height,s=h/2,g=o/2,l=document.createElement("canvas"),m=l.getContext("2d"),c=a.data,v=c.type||"linear",u=c.rotation||0;return"radial"===v?t=m.createRadialGradient(s,g,0,s,g,Math.min(h,o)/2):(u<0&&(u+=360),0<=u&&u<45?(r=0,n=o/2*(45-u)/45,i=h,d=o-n):45<=u&&u<135?(r=h*(u-45)/90,n=0,i=h-r,d=o):135<=u&&u<225?(r=h,n=o*(u-135)/90,i=0,d=o-n):225<=u&&u<315?(r=h*(1-(u-225)/90),n=o,i=h-r,d=0):315<=u&&(r=0,n=o-o/2*(u-315)/45,i=h,d=o-n),t=m.createLinearGradient(r,n,i,d)),t.addColorStop(c.spread||0,c.startColor),t.addColorStop(1,c.endColor),l.width=h,l.height=o,m.fillStyle=t,m.fillRect(0,0,h,o),l},CanvasRenderer.processImage=function(e,a){if(0===a.length)return e;for(var t,r,n=e.getContext("2d"),i=e.width,d=e.height,h=n.getImageData(0,0,i,d),o=createImageData(n,i,d),s=0;s<a.length;s+=1)s>0&&(r=h,h=o,o=r),t=a[s],process[t.name](h.data,o.data,i,d,t.options);return n.putImageData(o,0,0),e},CanvasRenderer.processMask=function(e,a){if(0===a.layers.length)return e;a.width=e.width,a.height=e.height;var t=CanvasRenderer.renderBW(a),r=t.getContext("2d").getImageData(0,0,t.width,t.height).data,n={name:"mask",options:{data:r,x:0,y:0,width:t.width,height:t.height}};return CanvasRenderer.processImage(e,[n])},CanvasRenderer.processLayer=function(e,a){var t=CanvasRenderer.load(e,a),r=CanvasRenderer.processMask(t,a.mask);return CanvasRenderer.processImage(r,a.filters)},CanvasRenderer.mergeManualBlend=function(e,a){return function(t){for(var r,n,i,d,h,o,s=t.getContext("2d"),g=e.width,l=e.height,m=s.getImageData(0,0,g,l),c=createImageData(s,g,l),v=0;v<a.length;v+=1)if(r=a[v],o=calcLayerRect(e,r),o.width>0&&o.height>0){if(v>0&&(d=m,m=c,c=d),i=getTransformedLayerData(e,r,o),h={data:i.data,width:o.width,height:o.height,opacity:r.opacity,dx:o.x,dy:o.y},void 0===blend[r.blendmode])throw new Error("No blend mode named '"+r.blendmode+"'");n=blend.realBlendMode(r.blendmode),blend[n](m.data,c.data,g,l,h)}return s.putImageData(c,0,0),t}},CanvasRenderer.singleLayerWithOpacity=function(e,a){var t=document.createElement("canvas"),r=t.getContext("2d");return t.width=e.width,t.height=e.height,r.save(),transformLayer(r,e,a),1!==a.opacity&&(r.globalAlpha=a.opacity),r.drawImage(a.img,0,0),r.restore(),t},CanvasRenderer.mergeNativeBlend=function(e,a){return function(t){for(var r,n=t.getContext("2d"),i=0;i<a.length;i+=1)r=a[i],n.save(),transformLayer(n,e,r),1!==r.opacity&&(n.globalAlpha=r.opacity),"source-over"!==r.blendmode&&(n.globalCompositeOperation=blend.realBlendMode(r.blendmode)),n.drawImage(r.img,0,0),n.restore();return t}},CanvasRenderer.createRenderPipe=function(e,a,t){function r(){if(void 0!==i){var t=i?e.mergeNativeBlend:e.mergeManualBlend;o.push(t(a,d))}}for(var n,i,d,h,o=[],s=1;s<t.length;s+=1)h=t[s],n=h.blendmode,void 0!==i&&i===nativeBlendModes[n]||(r(),d=[]),d.push(h),i=nativeBlendModes[n],s===t.length-1&&r();return o},CanvasRenderer.merge=function(e,a){for(var t=CanvasRenderer.createRenderPipe(CanvasRenderer,e,a),r=CanvasRenderer.singleLayerWithOpacity(e,a[0]),n=0;n<t.length;n+=1)r=t[n](r);return r},CanvasRenderer.composite=function(e,a){return a&&0!==a.length?1===a.length?CanvasRenderer.singleLayerWithOpacity(e,a[0]):CanvasRenderer.merge(e,a):null},CanvasRenderer.getLayerData=function(e,a){for(var t,r,n,i=[],d=0;d<a.length;d+=1)r=e.layers[d],n=a[d],t={img:n,opacity:r.opacity,blendmode:r.blendmode,transform:r.transform,flip_h:r.flip_h,flip_v:r.flip_v},i.push(t);return i},CanvasRenderer.render=function(e){for(var a=[],t=0;t<e.layers.length;t+=1)a.push(CanvasRenderer.processLayer(e,e.layers[t]));return CanvasRenderer.composite(e,CanvasRenderer.getLayerData(e,a))},CanvasRenderer.renderBW=function(e){var a=CanvasRenderer.render(e),t=(a.getContext("2d").getImageData(0,0,a.width,a.height).data,{name:"desaturate",options:{method:"ITU-R BT.709"}});return CanvasRenderer.processImage(a,[t])},module.exports=CanvasRenderer;
 
-
-},{"./blend":16,"./process":19,"./util":20}],18:[function(require,module,exports){
+},{"./blend":15,"./process":18,"./util":19}],17:[function(require,module,exports){
 "use strict";function toColor(t,e,r,a,n){var i,o,s,h,l,d,y,g;if(void 0===t)i=o=s=0,h=1;else if(Array.isArray(t))g=e||{},i=void 0!==t[0]?t[0]:0,o=void 0!==t[1]?t[1]:0,s=void 0!==t[2]?t[2]:0,h=void 0!==t[3]?t[3]:g.base||1;else if(void 0!==t.r)g=e||{},i=t.r,o=t.g,s=t.b,h=void 0!==t.a?t.a:g.base||1;else if("string"==typeof t){if(0===t.indexOf("#"))return t;if(0===t.indexOf("rgb"))return t;if(colors.indexOf(t)!==-1)return t}else"number"==typeof t&&(1===arguments.length?(i=o=s=t,h=1):2===arguments.length?(i=o=s=t,"number"==typeof e?h=e:(g=e,h=g.base||1)):3===arguments.length?"number"==typeof r?(i=t,o=e,s=r,h=1):(i=o=s=t,h=e,g=r):4===arguments.length?(i=t,o=e,s=r,"number"==typeof a?h=a:(g=a||{},h=g.base||1)):(i=t,o=e,s=r,h=a,g=n));if("number"!=typeof i||"number"!=typeof o||"number"!=typeof s||"number"!=typeof h)throw new Error("Invalid color arguments");return g=g||{},void 0!==g.base&&(i/=g.base,o/=g.base,s/=g.base,h/=g.base),l=Math.round(255*i),d=Math.round(255*o),y=Math.round(255*s),"rgba("+l+", "+d+", "+y+", "+h+")"}function toGradientData(t,e,r,a,n){var i,o,s,h,l,d,y={};if(1===arguments.length)d=t||{},i=d.startColor,o=d.endColor,s=d.type,h=d.rotation,l=d.spread;else if(arguments.length>=2)if(i=t,o=e,s="linear",h=0,l=0,3===arguments.length)"string"==typeof r?s=r:"number"==typeof r&&(h=r);else if(4===arguments.length)if("number"==typeof r)h=r,l=a;else if("linear"===r)h=a;else{if("radial"!==r)throw new Error("Wrong argument provided: "+r);s=r,l=a}else 5===arguments.length&&(s=r,h=a,l=n);if(!i&&0!==i)throw new Error("No startColor was given.");if(!o&&0!==o)throw new Error("No endColor was given.");try{y.startColor=toColor(i)}catch(t){throw new Error("startColor is not a valid color: "+i)}try{y.endColor=toColor(o)}catch(t){throw new Error("endColor is not a valid color: "+o)}if(void 0===s&&(s="linear"),"linear"!==s&&"radial"!==s)throw new Error("Unknown gradient type: "+s);if(y.type=s,void 0===l&&(l=0),"number"!=typeof l)throw new Error("Spread value is not a number: "+l);if("linear"===s){if(void 0===h&&(h=0),"number"!=typeof h)throw new Error("Rotation value is not a number: "+h);y.rotation=h}return y.spread=clamp(l,0,.99),y}function findType(t){if("string"==typeof t)return TYPE_PATH;if(t instanceof Image)return TYPE_IMAGE;if(t instanceof HTMLCanvasElement)return TYPE_HTML_CANVAS;if(t instanceof ImageCanvas)return TYPE_IMAGE_CANVAS;if(void 0!==t.r&&void 0!==t.g&&void 0!==t.b&&void 0!==t.a)return TYPE_FILL;if(void 0!==t.startColor&&void 0!==t.endColor)return TYPE_GRADIENT;throw new Error("Cannot establish type for data ",t)}function isPoint(t){return!!t&&(void 0!==t.x&&void 0!==t.y)}function pointFromArray(t){var e=t[0],r=t.length>1?t[1]:e;return{x:e,y:r}}function pointFromNumber(t){return{x:t,y:t}}function isValidArg(t){return void 0!==t&&null!==t}function convertArg(t){return Array.isArray(t)?pointFromArray(t):"number"==typeof t?pointFromNumber(t):isPoint(t)?t:void 0}function loadImage(t,e){var r=new Image;r.onload=function(){e(null,[t,this])},r.src=t}function loadImages(t,e){async.map(t,loadImage,function(t,r){if(e){for(var a,n,i={},o=0;o<r.length;o+=1)a=r[o][0],n=r[o][1],i[a]=n;e(i)}})}function rectUnite(t,e){var r=Math.min(t.x,e.x),a=Math.min(t.y,e.y),n=Math.max(t.x+t.width,e.x+e.width)-r,i=Math.max(t.y+t.height,e.y+e.height)-a;return{x:r,y:a,width:n,height:i}}function merge(t){var e,r,a,n;for(e=0;e<t.length;e+=1)r=t[e],a=0===e?r.bounds():rectUnite(a,r.bounds());var i=a.width/2+a.x,o=a.height/2+a.y,s=new ImageCanvas(a.width,a.height);for(e=0;e<t.length;e+=1)n=s.addLayer(t[e].toLayer()),n.translate(-i,-o);return new Img(s.render(),i,o)}var util=require("./util"),CanvasRenderer=require("./canvasrenderer"),AsyncRenderer=require("./asyncrenderer"),img,ImageCanvas,Layer,Img,DEFAULT_WIDTH=800,DEFAULT_HEIGHT=800,TYPE_PATH="path",TYPE_IMAGE="image",TYPE_HTML_CANVAS="htmlCanvas",TYPE_IMAGE_CANVAS="iCanvas",TYPE_FILL="fill",TYPE_GRADIENT="gradient",IDENTITY_TRANSFORM=util.transform(),Transform=IDENTITY_TRANSFORM,clamp=util.clamp,colors=["aliceblue","antiquewhite","aqua","aquamarine","azure","beige","bisque","black","blanchedalmond","blue","blueviolet","brown","burlywood","cadetblue","chartreuse","chocolate","coral","cornflowerblue","cornsilk","crimson","cyan","darkblue","darkcyan","darkgoldenrod","darkgray","darkgreen","darkkhaki","darkmagenta","darkolivegreen","darkorange","darkorchid","darkred","darksalmon","darkseagreen","darkslateblue","darkslategray","darkturquoise","darkviolet","deeppink","deepskyblue","dimgray","dimgrey","dodgerblue","firebrick","floralwhite","forestgreen","fuchsia","gainsboro","ghostwhite","gold","goldenrod","gray","green","greenyellow","grey","honeydew","hotpink","indianred","indigo","ivory","khaki","lavender","lavenderblush","lawngreen","lemonchiffon","lightblue","lightcoral","lightcyan","lightgoldenrodyellow","lightgreen","lightgrey","lightpink","lightsalmon","lightseagreen","lightskyblue","lightslategray","lightsteelblue","lightyellow","lime","limegreen","linen","maroon","mediumaquamarine","mediumblue","mediumorchid","mediumpurple","mediumseagreen","mediumslateblue","mediumspringgreen","mediumturquoise","mediumvioletred","midnightblue","mintcream","mistyrose","moccasin","navajowhite","navy","oldlace","olive","olivedrab","orange","orangered","orchid","palegoldenrod","palegreen","paleturquoise","palevioletred","papayawhip","peachpuff","peru","pink","plum","powderblue","purple","red","rosybrown","royalblue","saddlebrown","salmon","sandybrown","seagreen","seashell","sienna","silver","skyblue","slateblue","slategray","snow","springgreen","steelblue","tan","teal","thistle","tomato","transparent","turquoise","violet","wheat","white","whitesmoke","yellow","yellowgreen"];Layer=function(t,e){e||(e=findType(t)),this.data=t,this.type=e,e!==TYPE_HTML_CANVAS&&e!==TYPE_IMAGE_CANVAS&&e!==TYPE_IMAGE||(this.width=t.width,this.height=t.height),this.opacity=1,this.blendmode="source-over",this.transform=IDENTITY_TRANSFORM,this.flip_h=!1,this.flip_v=!1,this.mask=new ImageCanvas,this.filters=[]},Layer.Transform=Layer.IDENTITY_TRANSFORM=IDENTITY_TRANSFORM,Layer.prototype.clone=function(){function t(t){var e,r,a={};if(a.name=t.name,void 0!==t.options){a.options={};for(var n=Object.keys(t.options),i=0;i<n.length;i+=1)e=n[i],r=t.options[e],Array.isArray(r)?a.options[e]=r.slice(0):a.options[e]=r}return a}var e=Object.create(Layer.prototype);e.data=this.data,e.type=this.type,e.width=this.width,e.height=this.height,e.opacity=this.opacity,e.blendmode=this.blendmode,e.transform=this.transform,e.flip_h=this.flip_h,e.flip_v=this.flip_v,e.mask=this.mask.clone(),e.filters=[],this.type===TYPE_IMAGE_CANVAS?e.data=this.data.clone():this.type===TYPE_GRADIENT&&(e.data={startColor:this.data.startColor,endColor:this.data.endColor,type:this.data.type,rotation:this.data.rotation,spread:this.data.spread});for(var r=0;r<this.filters.length;r+=1)e.filters.push(t(this.filters[r]));return e},Layer.prototype.setOpacity=function(t){this.opacity=clamp(t,0,1)},Layer.prototype.translate=function(t,e){e=void 0===e?0:e;var r=Transform.translate(t,e);this.transform=this.transform.prepend(r)},Layer.prototype.scale=function(t,e){e=void 0===e?t:e;var r=Transform.scale(t,e);this.transform=this.transform.prepend(r)},Layer.prototype.rotate=function(t){var e=Transform.rotate(t);this.transform=this.transform.prepend(e)},Layer.prototype.skew=function(t,e){e=void 0===e?t:e;var r=Transform.skew(t,e);this.transform=this.transform.prepend(r)},Layer.prototype.flipHorizontal=function(t){void 0!==t?this.flip_h=t:this.flip_h=!this.flip_h},Layer.prototype.flipVertical=function(t){void 0!==t?this.flip_v=t:this.flip_v=!this.flip_v},Layer.prototype.addFilter=function(t,e){this.filters.push({name:t,options:e})},Layer.prototype.draw=function(t){var e=void 0===this.width?DEFAULT_WIDTH:this.width,r=void 0===this.height?DEFAULT_HEIGHT:this.height,a=new ImageCanvas(e,r);a.addLayer(this),a.draw(t)},Layer.prototype.toCanvas=function(){var t=document.createElement("canvas");t.width=this.width,t.height=this.height;var e=t.getContext("2d");return this.draw(e),t},Layer.fromFile=function(t){return new Layer(t,TYPE_PATH)},Layer.fromImage=function(t){return new Layer(t,TYPE_IMAGE)},Layer.fromCanvas=function(t){return t instanceof HTMLCanvasElement?Layer.fromHtmlCanvas(t):Layer.fromImageCanvas(t)},Layer.fromHtmlCanvas=function(t){return new Layer(t,TYPE_HTML_CANVAS)},Layer.fromImageCanvas=function(t){return new Layer(t,TYPE_IMAGE_CANVAS)},Layer.fromColor=function(t){return new Layer(toColor(t),TYPE_FILL)},Layer.fromGradient=function(){return new Layer(toGradientData.apply(null,arguments),TYPE_GRADIENT)},Layer.prototype.isPath=function(){return this.type===TYPE_PATH},Layer.prototype.isFill=function(){return this.type===TYPE_FILL},Layer.prototype.isGradient=function(){return this.type===TYPE_GRADIENT},Layer.prototype.isHtmlCanvas=function(){return this.type===TYPE_HTML_CANVAS},Layer.prototype.isImage=function(){return this.type===TYPE_IMAGE},Layer.prototype.isImageCanvas=function(){return this.type===TYPE_IMAGE_CANVAS};var Pixels=function(t){this.width=t.width,this.height=t.height;var e=t.getContext("2d");this._data=e.getImageData(0,0,this.width,this.height),this.array=this._data.data};Pixels.prototype.get=function(t){t*=4;var e=this.array;return[e[t+0],e[t+1],e[t+2],e[t+3]]},Pixels.prototype.set=function(t,e){t*=4;var r=this.array;r[t+0]=e[0],r[t+1]=e[1],r[t+2]=e[2],r[t+3]=e[3]},Pixels.prototype.toCanvas=function(){var t=document.createElement("canvas");t.width=this.width,t.height=this.height;var e=t.getContext("2d");return e.putImageData(this._data,0,0),t},ImageCanvas=function(t,e){t||(t=DEFAULT_WIDTH),e||(e=DEFAULT_HEIGHT),this.width=t,this.height=e,this.layers=[]},ImageCanvas.prototype.clone=function(){for(var t=new ImageCanvas(this.width,this.height),e=0;e<this.layers.length;e+=1)t.layers.push(this.layers[e].clone());return t},ImageCanvas.prototype.addLayer=function(t){var e;try{return this.addGradientLayer.apply(this,arguments)}catch(t){}try{return this.addColorLayer.apply(this,arguments)}catch(t){}if(1===arguments.length&&("string"==typeof t?e=new Layer(t,TYPE_PATH):t instanceof Layer?e=t:t instanceof HTMLCanvasElement?e=new Layer(t,TYPE_HTML_CANVAS):t instanceof Image?e=new Layer(t,TYPE_IMAGE):t instanceof ImageCanvas&&(e=new Layer(t,TYPE_IMAGE_CANVAS))),!e)throw new Error("Error creating layer.");return this.layers.push(e),e},ImageCanvas.prototype.addColorLayer=function(){var t=toColor.apply(null,arguments),e=new Layer(t,TYPE_FILL);return this.layers.push(e),e},ImageCanvas.prototype.addGradientLayer=function(){var t=toGradientData.apply(null,arguments),e=new Layer(t,TYPE_GRADIENT);return this.layers.push(e),e},ImageCanvas.prototype.render=function(t){var e=t?AsyncRenderer:CanvasRenderer;return e.render(this,t)},ImageCanvas.prototype.draw=function(t,e){if(e)this.render(function(e){t.drawImage(e,0,0,e.width,e.height)});else{var r=this.render();t.drawImage(r,0,0,r.width,r.height)}},Img=function(t,e,r){this.canvas=t,this.originalWidth=t?t.width:0,this.originalHeight=t?t.height:0,this.transform=e||r?Transform.translate(e,r):Layer.IDENTITY_TRANSFORM},Img.prototype.clone=function(){var t=new Img;return t.canvas=this.canvas,t.originalWidth=this.originalWidth,t.originalHeight=this.originalHeight,t.transform=this.transform,t},Img.prototype.withCanvas=function(t){var e=this.clone();return e.canvas=t,e},Img.prototype._transform=function(t){var e=this.clone();return e.transform=e.transform.prepend(t),e},Img.prototype.translate=function(t){var e=pointFromNumber(0),r=arguments;return 1===r.length&&isValidArg(t)?e=convertArg(t):2===r.length&&(e={x:r[0],y:r[1]}),0===e.x&&0===e.y?this:this._transform(Transform.translate(e.x,e.y))},Img.prototype.rotate=function(t){if(!t)return this;var e=pointFromNumber(0),r=arguments;return 2===r.length?e=convertArg(r[1]):3===r.length&&(e={x:r[1],y:r[2]}),this._transform(Transform.translate(e.x,e.y).rotate(t).translate(-e.x,-e.y))},Img.prototype.scale=function(t){var e=pointFromNumber(1),r=pointFromNumber(0),a=arguments;return 1===a.length&&isValidArg(t)?e=convertArg(t):2===a.length?"number"==typeof t&&"number"==typeof a[1]?e={x:a[0],y:a[1]}:(e=convertArg(t),r=convertArg(a[1])):4===a.length&&(e={x:a[0],y:a[1]},r={x:a[2],y:a[3]}),1===e.x&&1===e.y?this:this._transform(Transform.translate(r.x,r.y).scale(e.x,e.y).translate(-r.x,-r.y))},Img.prototype.skew=function(t){var e=pointFromNumber(0),r=pointFromNumber(0),a=arguments;return 1===a.length&&isValidArg(t)?e=convertArg(t):2===a.length?"number"==typeof t&&"number"==typeof a[1]?e={x:a[0],y:a[1]}:(e=convertArg(t),r=convertArg(a[1])):4===a.length&&(e={x:a[0],y:a[1]},r={x:a[2],y:a[3]}),0===e.x&&0===e.y?this:this._transform(Transform.translate(r.x,r.y).skew(e.x,e.y).translate(-r.x,-r.y))},Img.prototype.transformed=function(){return img.merge([this])},Img.prototype.bounds=function(){for(var t,e,r,a,n,i=this.transform,o=this.originalWidth/2,s=this.originalHeight/2,h={x:-o,y:-s},l={x:o,y:-s},d={x:-o,y:s},y={x:o,y:s},g=[h,l,d,y],m=0;m<4;m+=1)t=i.transformPoint(g[m]),0===m?(e=a=t.x,r=n=t.y):(t.x<e&&(e=t.x),t.x>a&&(a=t.x),t.y<r&&(r=t.y),t.y>n&&(n=t.y));return{x:e,y:r,width:a-e,height:n-r}},Img.prototype.colorize=function(t){var e=Layer.fromColor(t);e.width=this.originalWidth,e.height=this.originalHeight;var r=new Img(e.toCanvas());return r=r._transform(this.transform.matrix()),img.merge([this,r])},Img.prototype.desaturate=function(t){var e=this.toLayer(!1);return e.addFilter("desaturate",t),this.withCanvas(e.toCanvas())},Img.prototype.crop=function(t){function e(t,e){var r=t.x+t.width,a=t.y+t.height,n=e.x+e.width,i=e.y+e.height,o=Math.max(t.x,e.x),s=Math.max(t.y,e.y),h=Math.max(Math.min(r,n)-o,0),l=Math.max(Math.min(a,i)-s,0);return{x:o,y:s,width:h,height:l}}var r=this.bounds(),a=t.bounds(),n=e(r,a),i=Math.ceil(n.width),o=Math.ceil(n.height);if(0===n.width||0===n.height)throw new Error("Resulting image has no dimensions");var s=new img.ImageCanvas(i,o),h=s.addLayer(this.toLayer());return h.translate(i/2-a.width-a.x,o/2-a.height-a.y),i<a.width&&n.x>r.x&&h.translate(a.width-i,0),o<a.height&&n.y>r.y&&h.translate(0,a.height-o),new Img(s.render(),n.x+i/2,n.y+o/2)},Img.prototype.draw=function(t){t.save();var e=this.transform.matrix();t.transform(e[0],e[1],e[3],e[4],e[6],e[7]),t.translate(-this.originalWidth/2,-this.originalHeight/2),t.drawImage(this.canvas,0,0),t.restore()},Img.prototype.toLayer=function(t){var e=document.createElement("canvas");e.width=this.canvas.width,e.height=this.canvas.height;var r=e.getContext("2d");r.drawImage(this.canvas,0,0);var a=img.Layer.fromHtmlCanvas(e);return void 0===t&&(t=!0),t&&(a.transform=this.transform),a},Img.prototype.getPixels=function(){return new Pixels(this.canvas)},Img.prototype.toImage=function(){var t=this.bounds(),e=this.crop({bounds:function(){return t}}),r=new Image;return r.width=e.canvas.width,r.height=e.canvas.height,r.src=e.canvas.toDataURL(),r},img={},img.Layer=Layer,img.ImageCanvas=ImageCanvas,img.Img=Img,img.Pixels=Pixels;var async=require("async");img.loadImages=loadImages,img.merge=merge,module.exports=img;
 
-
-},{"./asyncrenderer":15,"./canvasrenderer":17,"./util":20,"async":1}],19:[function(require,module,exports){
+},{"./asyncrenderer":14,"./canvasrenderer":16,"./util":19,"async":1}],18:[function(require,module,exports){
 "use strict";function defaultOptions(o,n){if(!o)return n;var t,r={};for(t in n)n.hasOwnProperty(t)&&("undefined"==typeof o[t]?r[t]=n[t]:r[t]=o[t]);return r}function smoothstep(o,n,t){return t<o?0:t>=n?1:(t=(t-o)/(n-o),t*t*(3-2*t))}function noise(){return.5*Math.random()+.5}function colorDistance(o,n,t){return clamp(o*n+(1-o)*t,0,255)}function convolve3x3(o,n,t,r,a,e,i,u){var f,l,c,s,p,v,d,m,h,x,g,O,M,T,I,b,y,_,z,U,k,S,w=a[0][0],B=a[0][1],R=a[0][2],P=a[1][0],L=a[1][1],N=a[1][2],Y=a[2][0],q=a[2][1],A=a[2][2];for(l=0;l<r;l+=1)for(m=l*t*4,h=m-4*t,x=m+4*t,l<1&&(h=m),l>=t-1&&(x=m),f=0;f<t;f+=1)c=4*(l*t+f),g=4*f,O=g-4,M=g+4,f<1&&(O=g),f>=t-1&&(M=g),T=h+O,I=h+g,b=h+M,y=m+O,_=m+g,z=m+M,U=x+O,k=x+g,S=x+M,s=o[T]*w+o[I]*B+o[b]*R+o[y]*P+o[_]*L+o[z]*N+o[U]*Y+o[k]*q+o[S]*A,p=o[T+1]*w+o[I+1]*B+o[b+1]*R+o[y+1]*P+o[_+1]*L+o[z+1]*N+o[U+1]*Y+o[k+1]*q+o[S+1]*A,v=o[T+2]*w+o[I+2]*B+o[b+2]*R+o[y+2]*P+o[_+2]*L+o[z+2]*N+o[U+2]*Y+o[k+2]*q+o[S+2]*A,d=e?o[T+3]*w+o[I+3]*B+o[b+3]*R+o[y+3]*P+o[_+3]*L+o[z+3]*N+o[U+3]*Y+o[k+3]*q+o[S+3]*A:o[c+3],u&&(s=p=v=(s+p+v)/3),i&&(s=255-s,p=255-p,v=255-v),n[c]=s,n[c+1]=p,n[c+2]=v,n[c+3]=d}function convolve5x5(o,n,t,r,a,e,i,u){var f,l,c,s,p,v,d,m,h,x,g,O,M,T,I,b,y,_,z,U,k,S,w,B,R,P,L,N,Y,q,A,j,D,C,E,F,G,H,J,K,Q,V,W=a[0][0],X=a[0][1],Z=a[0][2],$=(a[0][3],a[0][4]),oo=a[1][0],no=a[1][1],to=a[1][2],ro=(a[1][3],a[1][4]),ao=a[2][0],eo=a[2][1],io=a[2][2],uo=(a[2][3],a[2][4]),fo=a[3][0],lo=a[3][1],co=a[3][2],so=(a[3][3],a[3][4]),po=a[4][0],vo=a[4][1],mo=a[4][2],ho=(a[4][3],a[4][4]);for(l=0;l<r;l+=1)for(m=l*t*4,h=m-4*t,g=m-4*t*2,x=m+4*t,O=m+4*t*2,l<1&&(h=m),l>=t-1&&(x=m),l<2&&(g=h),l>=t-2&&(O=x),f=0;f<t;f+=1)c=4*(l*t+f),M=4*f,T=M-4,I=M+4,b=M-8,y=M+8,f<1&&(T=M),f>=t-1&&(I=M),f<2&&(b=T),f>=t-2&&(y=I),_=g+b,z=g+T,U=g+M,k=g+I,S=g+y,w=h+b,B=h+T,R=h+M,P=h+I,L=h+y,N=m+b,Y=m+T,q=m+M,A=m+I,j=m+y,D=x+b,C=x+T,E=x+M,F=x+I,G=x+y,H=O+b,J=O+T,K=O+M,Q=O+I,V=O+y,s=o[_]*W+o[z]*X+o[U]*Z+o[k]*$+o[U]*$+o[w]*oo+o[B]*no+o[R]*to+o[P]*ro+o[R]*ro+o[N]*ao+o[Y]*eo+o[q]*io+o[A]*uo+o[q]*uo+o[D]*fo+o[C]*lo+o[E]*co+o[F]*so+o[E]*so+o[H]*po+o[J]*vo+o[K]*mo+o[Q]*ho+o[K]*ho,p=o[_+1]*W+o[z+1]*X+o[U+1]*Z+o[k+1]*$+o[U+1]*$+o[w+1]*oo+o[B+1]*no+o[R+1]*to+o[P+1]*ro+o[R+1]*ro+o[N+1]*ao+o[Y+1]*eo+o[q+1]*io+o[A+1]*uo+o[q+1]*uo+o[D+1]*fo+o[C+1]*lo+o[E+1]*co+o[F+1]*so+o[E+1]*so+o[H+1]*po+o[J+1]*vo+o[K+1]*mo+o[Q+1]*ho+o[K+1]*ho,v=o[_+2]*W+o[z+2]*X+o[U+2]*Z+o[k+2]*$+o[U+2]*$+o[w+2]*oo+o[B+2]*no+o[R+2]*to+o[P+2]*ro+o[R+2]*ro+o[N+2]*ao+o[Y+2]*eo+o[q+2]*io+o[A+2]*uo+o[q+2]*uo+o[D+2]*fo+o[C+2]*lo+o[E+2]*co+o[F+2]*so+o[E+2]*so+o[H+2]*po+o[J+2]*vo+o[K+2]*mo+o[Q+2]*ho+o[K+2]*ho,d=e?o[_+3]*W+o[z+3]*X+o[U+3]*Z+o[k+3]*$+o[U+3]*$+o[w+3]*oo+o[B+3]*no+o[R+3]*to+o[P+3]*ro+o[R+3]*ro+o[N+3]*ao+o[Y+3]*eo+o[q+3]*io+o[A+3]*uo+o[q+3]*uo+o[D+3]*fo+o[C+3]*lo+o[E+3]*co+o[F+3]*so+o[E+3]*so+o[H+3]*po+o[J+3]*vo+o[K+3]*mo+o[Q+3]*ho+o[K+3]*ho:o[c+3],u&&(s=p=v=(s+p+v)/3),i&&(s=255-s,p=255-p,v=255-v),n[c]=s,n[c+1]=p,n[c+2]=v,n[c+3]=d}function gaussian(o,n,t,r,a){var e,i,u,f,l,c,s,p,v,d,m,h,x,g,O,M=[],T=13,I=[[1]];for(a=clamp(a,3,T),x=-a/2+(a%2?.5:0),g=a+x,u=1;u<T;u+=1)I[0][u]=0;for(u=1;u<T;u+=1)for(I[u]=[1],f=1;f<T;f+=1)I[u][f]=I[u-1][f]+I[u-1][f-1];for(O=I[a-1],u=0,h=0;u<a;u+=1)h+=O[u];for(u=0;u<a;u+=1)O[u]/=h;for(i=0;i<r;i+=1)for(e=0;e<t;e+=1){for(l=c=s=p=0,u=x;u<g;u+=1)d=e+u,m=i,h=O[u-x],d<0&&(d=0),d>=t&&(d=t-1),v=4*(m*t+d),l+=o[v]*h,c+=o[v+1]*h,s+=o[v+2]*h,p+=o[v+3]*h;v=4*(i*t+e),M[v]=l,M[v+1]=c,M[v+2]=s,M[v+3]=p}for(i=0;i<r;i+=1)for(e=0;e<t;e+=1){for(l=c=s=p=0,u=x;u<g;u+=1)d=e,m=i+u,h=O[u-x],m<0&&(m=0),m>=r&&(m=r-1),v=4*(m*t+d),l+=M[v]*h,c+=M[v+1]*h,s+=M[v+2]*h,p+=M[v+3]*h;v=4*(i*t+e),n[v]=l,n[v+1]=c,n[v+2]=s,n[v+3]=p}}function getPixel(o,n){return n*=4,[o[n+0],o[n+1],o[n+2],o[n+3]]}function setPixel(o,n,t){n*=4,o[n+0]=t[0],o[n+1]=t[1],o[n+2]=t[2],o[n+3]=t[3]}function polar(o,n,t,r,a,e,i){t=a/2+(t||0),r=e/2+(r||0);var u,f,l,c,s,p,v;for(u=0;u<e;u+=1)for(f=0;f<a;f+=1)l=f-t,c=u-r,s=Math.sqrt(Math.pow(l,2)+Math.pow(c,2)),p=Math.atan2(c,l),v=i(s,p),s=v[0],p=v[1],setPixel(n,f+u*a,getPixel(o,Math.round(t+Math.cos(p)*s)+Math.round(r+Math.sin(p)*s)*a))}var stackblur=require("stackblur"),util=require("./util"),clamp=util.clamp,LUMINOSITY_ITU_R_BT601="ITU-R BT.601",LUMINOSITY_ITU_R_BT709="ITU-R BT.709",process={invert:function(o,n,t,r){var a,e=t*r*4;for(a=0;a<e;a+=4)n[a]=255-o[a],n[a+1]=255-o[a+1],n[a+2]=255-o[a+2],n[a+3]=o[a+3]},sepia:function(o,n,t,r){var a,e,i,u,f=t*r*4;for(a=0;a<f;a+=4)e=o[a],i=o[a+1],u=o[a+2],n[a]=.393*e+.769*i+.189*u,n[a+1]=.349*e+.686*i+.168*u,n[a+2]=.272*e+.534*i+.131*u,n[a+3]=o[a+3]},solarize:function(o,n,t,r){var a,e,i,u,f=t*r*4;for(a=0;a<f;a+=4)e=o[a],i=o[a+1],u=o[a+2],n[a]=e>127?255-e:e,n[a+1]=i>127?255-i:i,n[a+2]=u>127?255-u:u,n[a+3]=o[a+3]},brightness:function(o,n,t,r,a){a=defaultOptions(a,{brightness:1,contrast:0});var e,i,u,f,l,c=t*r*4,s=clamp(a.contrast,-1,1)/2,p=1+clamp(a.brightness,-1,1),v=p<0?-p:p,d=p<0?0:p;for(s=.5*Math.tan((s+1)*Math.PI/4),l=255*-(s-.5),e=0;e<c;e+=4)i=o[e],u=o[e+1],f=o[e+2],i=(i+i*v+d)*s+l,u=(u+u*v+d)*s+l,f=(f+f*v+d)*s+l,n[e]=i,n[e+1]=u,n[e+2]=f,n[e+3]=o[e+3]},desaturate:function(o,n,t,r,a){a=defaultOptions(a,{method:LUMINOSITY_ITU_R_BT601});var e,i,u,f,l,c=t*r*4;for(a.method===LUMINOSITY_ITU_R_BT601?(u=.3,f=.59,l=.11):a.method===LUMINOSITY_ITU_R_BT709&&(u=.2125,f=.7154,l=.0721),e=0;e<c;e+=4)i=o[e]*u+o[e+1]*f+o[e+2]*l,n[e]=i,n[e+1]=i,n[e+2]=i,n[e+3]=o[e+3]},lighten:function(o,n,t,r,a){a=defaultOptions(a,{amount:.25});var e,i=t*r*4,u=1+clamp(a.amount,0,1);for(e=0;e<i;e+=4)n[e]=o[e]*u,n[e+1]=o[e+1]*u,n[e+2]=o[e+2]*u,n[e+3]=o[e+3]},noise:function(o,n,t,r,a){a=defaultOptions(a,{amount:.5,strength:.5,mono:!1});var e,i,u,f,l,c=t*r*4,s=clamp(a.amount,0,1),p=clamp(a.strength,0,1),v=!!a.mono,d=Math.random;for(e=0;e<c;e+=4)u=o[e],f=o[e+1],l=o[e+2],i=d(),i<s&&(v?(i=p*(i/s*2-1)*255,u+=i,f+=i,l+=i):(u+=p*d()*255,f+=p*d()*255,l+=p*d()*255)),n[e]=u,n[e+1]=f,n[e+2]=l,n[e+3]=o[e+3]},flipv:function(o,n,t,r){var a,e,i,u;for(e=0;e<r;e+=1)for(a=0;a<t;a+=1)i=4*(e*t+a),u=4*(e*t+(t-a-1)),n[u]=o[i],n[u+1]=o[i+1],n[u+2]=o[i+2],n[u+3]=o[i+3]},fliph:function(o,n,t,r){var a,e,i,u;for(e=0;e<r;e+=1)for(a=0;a<t;a+=1)i=4*(e*t+a),u=4*((r-e-1)*t+a),n[u]=o[i],n[u+1]=o[i+1],n[u+2]=o[i+2],n[u+3]=o[i+3]},blur:function(o,n,t,r,a){a=defaultOptions(a,{radius:10});for(var e=0;e<o.length;e+=1)n[e]=o[e];stackblur(n,t,r,a.radius)},glow:function(o,n,t,r,a){a=defaultOptions(a,{amount:.75,kernelSize:5});var e,i,u,f,l=t*r*4,c=a.amount,s=[];for(gaussian(o,s,t,r,a.kernelSize),e=0;e<l;e+=4)i=o[e]+s[e]*c,u=o[e+1]+s[e+1]*c,f=o[e+2]+s[e+2]*c,i>255&&(i=255),u>255&&(u=255),f>255&&(f=255),n[e]=i,n[e+1]=u,n[e+2]=f,n[e+3]=o[e+3]},convolve3x3:function(o,n,t,r,a){convolve3x3(o,n,t,r,a.kernel)},convolve5x5:function(o,n,t,r,a){convolve5x5(o,n,t,r,a.kernel)},sharpen3x3:function(o,n,t,r,a){a=defaultOptions(a,{strength:1});var e=-clamp(a.strength,0,1);convolve3x3(o,n,t,r,[[e,e,e],[e,1-8*e,e],[e,e,e]])},sharpen5x5:function(o,n,t,r,a){a=defaultOptions(a,{strength:1});var e=-clamp(a.strength,0,1);convolve5x5(o,n,t,r,[[e,e,e,e,e],[e,e,e,e,e],[e,e,1-24*e,e,e],[e,e,e,e,e],[e,e,e,e,e]])},soften3x3:function(o,n,t,r){var a=1/9;convolve3x3(o,n,t,r,[[a,a,a],[a,a,a],[a,a,a]])},soften5x5:function(o,n,t,r){var a=.04;convolve5x5(o,n,t,r,[[a,a,a,a,a],[a,a,a,a,a],[a,a,a,a,a],[a,a,a,a,a],[a,a,a,a,a]])},crossedges:function(o,n,t,r,a){a=defaultOptions(a,{strength:1});var e=5*clamp(a.strength,0,1);convolve3x3(o,n,t,r,[[0,-e,0],[-e,0,e],[0,e,0]],!1,!0)},emboss:function(o,n,t,r,a){a=defaultOptions(a,{amount:1,angle:0});var e,i=t*r*4,u=a.amount,f=a.angle,l=Math.cos(-f)*u,c=Math.sin(-f)*u,s=-l-c,p=-l,v=c-l,d=-c,m=c,h=-c+l,x=l,g=c+l,O=[];for(convolve3x3(o,O,t,r,[[s,d,h],[p,0,x],[v,m,g]]),e=0;e<i;e+=4)n[e]=128+O[e],n[e+1]=128+O[e+1],n[e+2]=128+O[e+2],n[e+3]=o[e+3]},findedges:function(o,n,t,r){var a,e,i,u,f,l,c,s=t*r*4,p=[],v=[];for(convolve3x3(o,p,t,r,[[-1,0,1],[-2,0,2],[-1,0,1]]),convolve3x3(o,v,t,r,[[-1,-2,-1],[0,0,0],[1,2,1]]),a=0;a<s;a+=4)e=p[a],i=v[a],u=p[a+1],f=v[a+1],l=p[a+2],c=v[a+2],e<0&&(e=-e),i<0&&(i=-i),u<0&&(u=-u),f<0&&(f=-f),l<0&&(l=-l),c<0&&(c=-c),n[a]=255-.8*(e+i),n[a+1]=255-.8*(u+f),n[a+2]=255-.8*(l+c),n[a+3]=o[a+3]},edgeenhance3x3:function(o,n,t,r){var a=-1/9;convolve3x3(o,n,t,r,[[a,a,a],[a,17/9,a],[a,a,a]])},edgeenhance5x5:function(o,n,t,r){var a=-.04;convolve5x5(o,n,t,r,[[a,a,a,a,a],[a,a,a,a,a],[a,a,1.96,a,a],[a,a,a,a,a],[a,a,a,a,a]])},laplace3x3:function(o,n,t,r){convolve3x3(o,n,t,r,[[-1,-1,-1],[-1,8,-1],[-1,-1,-1]],!1,!0,!0)},laplace5x5:function(o,n,t,r){convolve5x5(o,n,t,r,[[-1,-1,-1,-1,-1],[-1,-1,-1,-1,-1],[-1,-1,24,-1,-1],[-1,-1,-1,-1,-1],[-1,-1,-1,-1,-1]],!1,!0,!0)},rgbAdjust:function(o,n,t,r,a){a=defaultOptions(a,{r:0,g:0,b:0,a:0});var e,i,u,f,l,c=t*r*4,s=255*clamp(a.r,-1,1),p=255*clamp(a.g,-1,1),v=255*clamp(a.b,-1,1),d=255*clamp(a.a,-1,1);for(e=0;e<c;e+=4)i=o[e]+s,u=o[e+1]+p,f=o[e+2]+v,l=o[e+3]+d,i<0&&(i=0),u<0&&(u=0),f<0&&(f=0),l<0&&(l=0),i>255&&(i=255),u>255&&(u=255),f>255&&(f=255),l>255&&(l=255),n[e]=i,n[e+1]=u,n[e+2]=f,n[e+3]=l},colorfilter:function(o,n,t,r,a){a=defaultOptions(a,{luminosity:!1,r:1,g:.5,b:0});var e,i,u,f,l,c,s,p,v,d,m,h=t*r*4,x=!!a.luminosity,g=clamp(a.r,0,1),O=clamp(a.g,0,1),M=clamp(a.b,0,1);for(e=0;e<h;e+=4)i=o[e]/255,u=o[e+1]/255,f=o[e+2]/255,p=.3*i+.59*u+.11*f,i=(i+i*g)/2,u=(u+u*O)/2,f=(f+f*M)/2,x&&(l=c=i,u>c&&(c=u),f>c&&(c=f),u<l&&(l=u),f<l&&(l=f),d=c-l,s=i===c?(u-f)/d%6:u===c?(f-i)/d+2:(i-u)/d+4,v=s>>0,m=d*(s-v),i=u=f=p-(.3*i+.59*u+.11*f),0===v?(i+=d,u+=m):1===v?(i+=d-m,u+=d):2===v?(u+=d,f+=m):3===v?(u+=d-m,f+=d):4===v?(i+=m,f+=d):5===v&&(i+=d,f+=d-m)),n[e]=255*i,n[e+1]=255*u,n[e+2]=255*f,n[e+3]=o[e+3]},hslAdjust:function(o,n,t,r,a){a=defaultOptions(a,{h:.5,s:.3,l:.1,a:0});var e,i,u,f,l,c,s,p,v,d,m,h,x,g,O,M=t*r*4,T=clamp(a.h,-1,1),I=clamp(a.s,-1,1),b=clamp(a.l,-1,1),y=255*clamp(a.a,-1,1),_=1+I*(I<0?1:2),z=b<0?1+b:1-b,U=b<0?0:255*b;for(T=6*T%6,e=0;e<M;e+=4)i=o[e],u=o[e+1],f=o[e+2],l=o[e+3]+y,0===T&&0===I||(c=i,u>c&&(c=u),f>c&&(c=f),s=i,u<s&&(s=u),f<s&&(s=f),p=c-s,m=(s+c)/510,m>0&&p>0&&(m<=.5?(d=p/(c+s)*_,d>1&&(d=1),h=m*(1+d)):(d=p/(510-c-s)*_,d>1&&(d=1),h=m+d-m*d),v=i===c?u===s?5+(c-f)/p+T:1-(c-u)/p+T:u===c?f===s?1+(c-i)/p+T:3-(c-f)/p+T:i===s?3+(c-u)/p+T:5-(c-i)/p+T,v<0&&(v+=6),v>=6&&(v-=6),x=m+m-h,O=v>>0,g=(h-x)*(v-O),0===O?(i=h,u=x+g,f=x):1===O?(i=h-g,u=h,f=x):2===O?(i=x,u=h,f=x+g):3===O?(i=x,u=h-g,f=h):4===O?(i=x+g,u=x,f=h):5===O&&(i=h,u=x,f=h-g),i*=255,u*=255,f*=255)),i=i*z+U,u=u*z+U,f=f*z+U,i<0&&(i=0),u<0&&(u=0),f<0&&(f=0),l<0&&(l=0),i>255&&(i=255),u>255&&(u=255),f>255&&(f=255),l>255&&(l=255),n[e]=i,n[e+1]=u,n[e+2]=f,n[e+3]=l},posterize:function(o,n,t,r,a){a=defaultOptions(a,{levels:5});var e,i=t*r*4,u=clamp(a.levels,2,256),f=256/u,l=256/(u-1);for(e=0;e<i;e+=4)n[e]=l*(o[e]/f>>0),n[e+1]=l*(o[e+1]/f>>0),n[e+2]=l*(o[e+2]/f>>0),n[e+3]=o[e+3]},removenoise:function(o,n,t,r){var a,e,i,u,f,l,c,s,p,v,d,m,h,x,g,O,M,T,I;for(e=0;e<r;e+=1)for(s=e*t*4,p=s-4*t,v=s+4*t,e<1&&(p=s),e>=t-1&&(v=s),a=0;a<t;a+=1)c=4*(e*t+a),d=4*a,m=d-4,h=d+4,a<1&&(m=d),a>=t-1&&(h=d),x=M=o[s+m],l=o[s+h],l<x&&(x=l),l>M&&(M=l),l=o[p+d],l<x&&(x=l),l>M&&(M=l),l=o[v+d],l<x&&(x=l),l>M&&(M=l),g=o[s+m+1],l=o[s+h+1],l<g&&(g=l),l=o[p+d+1],l<g&&(g=l),l=o[v+d+1],l<g&&(g=l),O=o[s+m+2],l=o[s+h+2],l<O&&(O=l),l=o[p+d+2],l<O&&(O=l),l=o[v+d+2],l<O&&(O=l),i=o[c],u=o[c+1],f=o[c+2],i<x&&(i=x),i>M&&(i=M),u<g&&(u=g),u>T&&(u=T),f<O&&(f=O),f>I&&(f=I),n[c]=i,n[c+1]=u,n[c+2]=f,n[c+3]=o[c+3]},mosaic:function(o,n,t,r,a){a=defaultOptions(a,{blockSize:8});var e,i,u,f,l,c,s,p,v,d,m,h,x,g,O=clamp(a.blockSize,1,Math.max(t,r)),M=Math.ceil(r/O),T=Math.ceil(t/O);for(e=0,v=0,s=0;s<M;s+=1){for(i=clamp(e+O,0,r),u=0,p=0;p<T;p+=1){for(f=clamp(u+O,0,t),l=e*t+u<<2,d=o[l],m=o[l+1],h=o[l+2],x=e;x<i;x+=1)for(g=u;g<f;g+=1)c=x*t+g<<2,n[c]=d,n[c+1]=m,n[c+2]=h,n[c+3]=o[c+3];u=f,v+=1}e=i}},equalize:function(o,n,t,r,a){var e,i,u,f,l=t*r,c=Math.round,s=new Array(256);for(i=0;i<256;i+=1)s[i]=0;for(i=0;i<l;i+=1)e=4*i,u=clamp(c(.3*o[e]+.59*o[e+1]+.11*o[e+2]),0,255),n[e+3]=u,s[u]+=1;var p=new Array(256);for(p[0]=s[0],i=1;i<256;i+=1)p[i]=p[i-1]+s[i];for(i=0;i<256;i+=1)p[i]=p[i]/l*255;for(i=0;i<l;i+=1)e=4*i,u=n[e+3],f=p[u]/(u||1),n[e]=clamp(c(o[e]*f),0,255),n[e+1]=clamp(c(o[e+1]*f),0,255),n[e+2]=clamp(c(o[e+2]*f),0,255),n[e+3]=o[e+3]},mask:function(o,n,t,r,a){var e,i=t*r*4,u=a.data;for(e=0;e<i;e+=4)n[e]=o[e],n[e+1]=o[e+1],n[e+2]=o[e+2],n[e+3]=o[e+3]*u[e]/255*u[e+3]/255},bump:function(o,n,t,r,a){a=defaultOptions(a,{dx:0,dy:0,radius:0,zoom:0});var e=a.radius,i=clamp(a.zoom,0,1);return polar(o,n,a.dx,a.dy,t,r,function(o,n){return[o*smoothstep(0,i,o/e),n]})},dent:function(o,n,t,r,a){a=defaultOptions(a,{dx:0,dy:0,radius:0,zoom:0});var e=a.radius,i=clamp(a.zoom,0,1);return polar(o,n,a.dx,a.dy,t,r,function(o,n){return[2*o-o*smoothstep(0,i,o/e),n]})},pinch:function(o,n,t,r,a){a=defaultOptions(a,{dx:0,dy:0,zoom:0});var e=util.distance(0,0,t,r),i=clamp(.75*a.zoom,-.75,.75);return polar(o,n,a.dx,a.dy,t,r,function(o,n){return[o*Math.pow(e/o,i)*(1-i),n]})},splash:function(o,n,t,r,a){a=defaultOptions(a,{dx:0,dy:0,radius:0});var e=a.radius;return polar(o,n,a.dx,a.dy,t,r,function(o,n){return[o>e?e:o,n]})},twirl:function(o,n,t,r,a){a=defaultOptions(a,{dx:0,dy:0,radius:0,angle:0});var e=util.radians(a.angle),i=a.radius;return polar(o,n,a.dx,a.dy,t,r,function(o,n){return[o,n+(1-smoothstep(-i,i,o))*e]})}};module.exports=process;
 
-
-},{"./util":20,"stackblur":5}],20:[function(require,module,exports){
+},{"./util":19,"stackblur":4}],19:[function(require,module,exports){
 "use strict";function degrees(n){return 180*n/Math.PI}function radians(n){return n/180*Math.PI}function distance(n,t,r,a){return Math.sqrt(Math.pow(r-n,2)+Math.pow(a-t,2))}function clamp(n,t,r){return Math.min(r,Math.max(t,n))}function transform(n){function t(n,t){t=t.slice();var r=t[0],a=t[1],e=(t[2],t[3]),i=t[4],o=(t[5],t[6]),u=t[7];t[8];return t[0]=n[0]*r+n[1]*e,t[1]=n[0]*a+n[1]*i,t[3]=n[3]*r+n[4]*e,t[4]=n[3]*a+n[4]*i,t[6]=n[6]*r+n[7]*e+o,t[7]=n[6]*a+n[7]*i+u,transform(t)}return n=void 0===n?[1,0,0,0,1,0,0,0,1]:n.slice(),{matrix:function(){return n.slice()},clone:function(){return transform(n)},prepend:function(r){return r.matrix&&(r=r.matrix()),t(n,r)},append:function(r){return r.matrix&&(r=r.matrix()),t(r,n)},translate:function(r,a){return t([1,0,0,0,1,0,r,a,1],n)},scale:function(r,a){return void 0===a&&(a=r),t([r,0,0,0,a,0,0,0,1],n)},skew:function(r,a){void 0===a&&(a=r);var e=Math.PI*r/180,i=Math.PI*a/180;return t([1,Math.tan(i),0,-Math.tan(e),1,0,0,0,1],n)},rotate:function(r){var a=Math.cos(radians(r)),e=Math.sin(radians(r));return t([a,e,0,-e,a,0,0,0,1],n)},transformPoint:function(t){var r=t.x,a=t.y;return{x:r*n[0]+a*n[3]+n[6],y:r*n[1]+a*n[4]+n[7]}}}}module.exports={degrees:degrees,radians:radians,distance:distance,clamp:clamp,transform:transform};
 
-
-},{}],21:[function(require,module,exports){
+},{}],20:[function(require,module,exports){
 "use strict";var deepEqual=require("./deepequal"),util=require("./util"),g={};g.combine=function(){var r,n,e=[];for(r=0;r<arguments.length;r++)n=arguments[r],n&&(e=e.concat(n));return e},g.contains=function(r,n){for(var e=0;e<r.length;e+=1)if(deepEqual.deepEqual(r[e],n))return!0;return!1},g.cycle=function(r,n){if(!r||n<=0)return[];for(var e=[],t=r.length,u=0;u<n;u+=1)e.push(r[u%t]);return e},g.equals=function(r,n){return deepEqual.deepEqual(r,n)},g.count=function(r){return r&&r.length?r.length:0},g.cull=function(r,n){if(!r)return[];if(!n)return r;var e,t,u=[];for(e=0;e<r.length;e++)t=n[e%n.length],t&&u.push(r[e]);return u},g.distinct=function(r){if(!r)return[];var n,e,t,u=[],i=[];for(n=0,e=r.length;n<e;n+=1)t=r[n],g.contains(i,t)||(i.push(t),u.push(r[n]));return u},g.first=function(r){return r&&0!==r.length?r[0]:null},g.get=function(r,n){return r&&0!==r.length?r[n]:null},g.interleave=function(){if(0===arguments.length)return[];for(var r=[],n=0;;){for(var e=0;e<arguments.length;e++){var t=arguments[e];if(!(t.length>n))return r;r.push(t[n])}n+=1}},g.last=function(r){return r&&0!==r.length?r[r.length-1]:null},g.pick=function(r,n,e){if(!r||0===r.length||n<=0)return[];e||0===e||(e=Math.random());for(var t=util.randomGenerator(e||0),u=[],i=0;i<n;i+=1)u.push(r[Math.floor(t(0,r.length))]);return u},g.randomSample=function(r,n,e){if(!r||0===r.length||n<=0)return[];e||0===e||(e=Math.random());var t=g.shuffle(r,e);return n?g.slice(t,0,n):t},g.repeat=function(r,n,e){if(!r)return[];if(Array.isArray(r)||(r=[r]),n<=0)return[];var t,u,i,l=[];if(e)for(t=0;t<r.length;t+=1)for(i=r[t],u=0;u<n;u+=1)l.push(i);else for(t=0;t<n;t+=1)l.push.apply(l,r);return l},g.rest=function(r){return r?r.slice(1):[]},g.reverse=function(r){return r.slice().reverse()},g.second=function(r){return!r||r.length<2?null:r[1]},g.shift=function(r,n){if(!r)return[];n%=r.length;var e=r.slice(0,n),t=r.slice(n);return t.push.apply(t,e),t},g.shuffle=function(r,n){var e,t,u,i;for(n||0===n||(n=Math.random()),i=util.randomGenerator(n||0),r=r.slice(),e=r.length-1;e>0;e--)t=Math.floor(i(0,e+1)),u=r[e],r[e]=r[t],r[t]=u;return r},g.slice=function(r,n,e,t){if(!r)return[];var u,i;return t?(u=r.slice(0,n),i=r.slice(n+e),u.push.apply(u,i),u):r.slice(n,n+e)},g.sort=function(r,n){if(n){if("string"==typeof n)return r.slice().sort(function(r,e){return r[n]>e[n]?1:r[n]===e[n]?0:-1});if("function"==typeof n)return r.slice().sort(n)}return r&&void 0!==r[0]&&null!==r[0]&&"number"==typeof r[0]?r.slice().sort(function(r,n){return r-n}):r.slice().sort()},g.switch=function(r){var n=arguments.length-1;return r%=n,r<0&&(r+=n),arguments[r+1]},g.takeEvery=function(r,n,e){var t,u=[];for(e=e||0,t=0;t<r.length;t+=1)t%n===e&&u.push(r[t]);return u},g.zipMap=function(r,n){var e,t,u,i={},l=Math.min(r.length,n.length);for(e=0;e<l;e+=1)t=r[e],u=n[e],i[t]=u;return i},module.exports=g;
 
-
-},{"./deepequal":11,"./util":24}],22:[function(require,module,exports){
-"use strict";var _=require("lodash"),util=require("./util"),vg=require("./vg/vg"),g={},TWO_PI=2*Math.PI;g.abs=Math.abs,g.accumulate=function(r){if(arguments.length>1?r=arguments:1!==arguments.length||Array.isArray(r)||(r=[r]),!r||0===r.length)return[0];var n,t=[],e=0;for(n=0;n<r.length;n++)t.push(e),e+=r[n];return t},g.add=function(r,n){return 2===arguments.length?r+n:_.reduce(arguments,function(r,n){return r+n},0)},g.and=function(r,n){var t=arguments.length;if(2===t)return r&&n;if(1===t)return!!r;if(0===t)throw new Error("Wrong number of arguments");return _.reduce(arguments,function(r,n){return r&&n},!0)},g.average=function(r){if(arguments.length>1?r=arguments:1!==arguments.length||Array.isArray(r)||(r=[r]),!r||0===r.length)return 0;var n,t=0;for(n=0;n<r.length;n+=1)t+=r[n];return t/r.length},g.boolean=function(r){return!!r},g.ceil=Math.ceil,g.compare=function(r,n,t){if("<"===t)return r<n;if(">"===t)return r>n;if("<="===t)return r<=n;if(">="===t)return r>=n;if("=="===t)return r===n;if("!="===t)return r!==n;throw new Error("Unknown comparison operation "+t)},g.cos=Math.cos,g.degrees=function(r){return 180*r/Math.PI},g.divide=function(r,n){function t(r){if(0===r)throw new Error("Divide by zero")}var e=arguments.length;if(2===e)return t(n),r/n;if(1===e)return t(r),1/r;if(0===e)throw new Error("Wrong number of arguments");return _.reduce([].slice.call(arguments,1),function(r,n){return t(n),r/n},arguments[0])},g.e=function(){return Math.E},g.even=function(r){return r%2===0},g.floor=Math.floor,g.integer=function(r){return 0|r},g.log=function(r){return r>0?Math.log(r):-Math.log(-r)},g.makeNumbers=function(r,n){if(!r)return[];n||(n="");var t,e,u=[],o=r.split(n);for(t=0;t<o.length;t+=1)e=parseFloat(o[t]),(0===e||e)&&u.push(e);return u},g.max=function(){var r=arguments;if(1===arguments.length&&Array.isArray(arguments[0])&&(r=arguments[0]),0===r.length)throw new Error("Wrong number of arguments");return Math.max.apply(null,r)},g.min=function(){var r=arguments;if(1===arguments.length&&Array.isArray(arguments[0])&&(r=arguments[0]),0===r.length)throw new Error("Wrong number of arguments");return Math.min.apply(null,r)},g.mod=function(r,n){return r%n},g.multiply=function(r,n){var t=arguments.length;return 2===t?r*n:1===t?r:_.reduce(arguments,function(r,n){return r*n},1)},g.negate=function(r){return-r},g.not=function(r){return!r},g.number=function(r){return r},g.odd=function(r){return r%2!==0},g.or=function(r,n){var t=arguments.length;if(2===t)return r||n;if(1===t)return!!r;if(0===t)throw new Error("Wrong number of arguments");return _.reduce(arguments,function(r,n){return r||n},!1)},g.perlinNoise=function(r,n,t){return vg.math.noise(r,n,t)},g.pi=function(){return Math.PI},g.pow=Math.pow,g.radians=function(r){return r*Math.PI/180},g.randomNumbers=function(r,n,t,e){var u=arguments.length;if((u<4||!e&&0!==e)&&(e=Math.random()),3===u||4===u?(n=n||0,t=t||(0===t?0:1)):2===u?(t=n||(0===n?0:1),n=0):1===u&&(n=0,t=1),t<n){var o=t;t=n,n=o}for(var i,a=t-n,g=[],f=util.randomGenerator(e||0),h=0;h<r;h+=1)i=n+f(0,1)*a,g.push(i);return g},g.range=function(r,n,t,e){if(r===n)return[];if(0!==t&&(t=t||(r<n?1:-1)),t>0&&r>n)return[];if(t<0&&r<n)return[];if(0===t)return[];var u,o=[];if(r<n)if(e)for(u=r;u<=n;u+=t)o.push(u);else for(u=r;u<n;u+=t)o.push(u);else if(e)for(u=r;u>=n;u+=t)o.push(u);else for(u=r;u>n;u+=t)o.push(u);return o},g.round=function(r,n){return n|=0,n?Math.round(r/n)*n:Math.round(r)},g.sample=function(r,n,t,e){var u,o,i=[];for(i.length=r,u=e?(t-n)/r:(t-n)/(r-1),o=0;o<r;o+=1)i[o]=n+o*u;return i},g.sineWave=function(r,n,t,e,u){void 0===n&&(n=-1),void 0===t&&(t=1),void 0===e&&(e=1),void 0===u&&(u=0);var o=(t-n)/2;return n+o+Math.sin((u+r)*TWO_PI/e)*o},g.squareWave=function(r,n,t,e,u){void 0===n&&(n=-1),void 0===t&&(t=1),void 0===e&&(e=1),void 0===u&&(u=0);var o=e/2,i=(r+u)%e;return i<o?t:n},g.triangleWave=function(r,n,t,e,u){void 0===n&&(n=-1),void 0===t&&(t=1),void 0===e&&(e=1),void 0===u&&(u=0);var o=(t-n)/2,i=TWO_PI/e,a=0,g=r+u+e/4;return g%e!==0&&(a=g*i%TWO_PI),a<0&&(a+=TWO_PI),2*o*(1+-Math.abs(a/TWO_PI*2-1))+n},g.sawtoothWave=function(r,n,t,e,u){void 0===n&&(n=-1),void 0===t&&(t=1),void 0===e&&(e=1),void 0===u&&(u=0);var o=(t-n)/2,i=TWO_PI/e,a=0,g=r+u;return g%e!==0&&(a=g*i%TWO_PI),a<0&&(a+=TWO_PI),2*(a/TWO_PI)*o+n},g.sign=function(r){return r>0?1:0===r?0:-1},g.sin=Math.sin,g.sqrt=Math.sqrt,g.subtract=function(r,n){var t=arguments.length;if(2===t)return r-n;if(1===t)return-r;if(0===t)throw new Error("Wrong number of arguments");return _.reduce([].slice.call(arguments,1),function(r,n){return r-n},arguments[0])},g.tan=Math.tan,g.total=function(r){if(arguments.length>1?r=arguments:1!==arguments.length||Array.isArray(r)?0===arguments.length&&(r=[]):r=[r],0===r.length)return 0;var n,t=0;for(n=0;n<r.length;n+=1)t+=r[n];return t},g.xor=function(r,n){var t=arguments.length;if(2===t)return!!(r^n);throw new Error("Wrong number of arguments")},module.exports=g;
-
-
-},{"./util":24,"./vg/vg":45,"lodash":3}],23:[function(require,module,exports){
+},{"./deepequal":10,"./util":23}],21:[function(require,module,exports){
+"use strict";var _=require("lodash"),util=require("./util"),vg=require("./vg/vg"),g={},TWO_PI=2*Math.PI;g.abs=Math.abs,g.accumulate=function(r){if(arguments.length>1?r=arguments:1!==arguments.length||Array.isArray(r)||(r=[r]),!r||0===r.length)return[0];var n,t=[],e=0;for(n=0;n<r.length;n++)t.push(e),e+=r[n];return t},g.add=function(r,n){return 2===arguments.length?r+n:_.reduce(arguments,function(r,n){return r+n},0)},g.and=function(r,n){var t=arguments.length;if(2===t)return r&&n;if(1===t)return!!r;if(0===t)throw new Error("Wrong number of arguments");return _.reduce(arguments,function(r,n){return r&&n},!0)},g.average=function(r){if(arguments.length>1?r=arguments:1!==arguments.length||Array.isArray(r)||(r=[r]),!r||0===r.length)return 0;var n,t=0;for(n=0;n<r.length;n+=1)t+=r[n];return t/r.length},g.boolean=function(r){return!!r},g.ceil=Math.ceil,g.clamp=function(r,n,t){return n="number"==typeof n?n:0,t="number"==typeof t?t:1,r<n?n:r>t?t:r},g.compare=function(r,n,t){if("<"===t)return r<n;if(">"===t)return r>n;if("<="===t)return r<=n;if(">="===t)return r>=n;if("=="===t)return r===n;if("!="===t)return r!==n;throw new Error("Unknown comparison operation "+t)},g.cos=Math.cos,g.degrees=function(r){return 180*r/Math.PI},g.divide=function(r,n){function t(r){if(0===r)throw new Error("Divide by zero")}var e=arguments.length;if(2===e)return t(n),r/n;if(1===e)return t(r),1/r;if(0===e)throw new Error("Wrong number of arguments");return _.reduce([].slice.call(arguments,1),function(r,n){return t(n),r/n},arguments[0])},g.e=function(){return Math.E},g.even=function(r){return r%2===0},g.floor=Math.floor,g.integer=function(r){return 0|r},g.log=function(r){return r>0?Math.log(r):-Math.log(-r)},g.makeNumbers=function(r,n){if(!r)return[];n||(n="");var t,e,u=[],o=r.split(n);for(t=0;t<o.length;t+=1)e=parseFloat(o[t]),(0===e||e)&&u.push(e);return u},g.max=function(){var r=arguments;if(1===arguments.length&&Array.isArray(arguments[0])&&(r=arguments[0]),0===r.length)throw new Error("Wrong number of arguments");return Math.max.apply(null,r)},g.min=function(){var r=arguments;if(1===arguments.length&&Array.isArray(arguments[0])&&(r=arguments[0]),0===r.length)throw new Error("Wrong number of arguments");return Math.min.apply(null,r)},g.mod=function(r,n){return r%n},g.multiply=function(r,n){var t=arguments.length;return 2===t?r*n:1===t?r:_.reduce(arguments,function(r,n){return r*n},1)},g.negate=function(r){return-r},g.not=function(r){return!r},g.number=function(r){return r},g.odd=function(r){return r%2!==0},g.or=function(r,n){var t=arguments.length;if(2===t)return r||n;if(1===t)return!!r;if(0===t)throw new Error("Wrong number of arguments");return _.reduce(arguments,function(r,n){return r||n},!1)},g.perlinNoise=function(r,n,t){return vg.math.noise(r,n,t)},g.pi=function(){return Math.PI},g.pow=Math.pow,g.radians=function(r){return r*Math.PI/180},g.randomNumbers=function(r,n,t,e){var u=arguments.length;if((u<4||!e&&0!==e)&&(e=Math.random()),3===u||4===u?(n=n||0,t=t||(0===t?0:1)):2===u?(t=n||(0===n?0:1),n=0):1===u&&(n=0,t=1),t<n){var o=t;t=n,n=o}for(var i,a=t-n,g=[],f=util.randomGenerator(e||0),h=0;h<r;h+=1)i=n+f(0,1)*a,g.push(i);return g},g.range=function(r,n,t,e){if(r===n)return[];if(0!==t&&(t=t||(r<n?1:-1)),t>0&&r>n)return[];if(t<0&&r<n)return[];if(0===t)return[];var u,o=[];if(r<n)if(e)for(u=r;u<=n;u+=t)o.push(u);else for(u=r;u<n;u+=t)o.push(u);else if(e)for(u=r;u>=n;u+=t)o.push(u);else for(u=r;u>n;u+=t)o.push(u);return o},g.round=function(r,n){return n|=0,n?Math.round(r/n)*n:Math.round(r)},g.sample=function(r,n,t,e){var u,o,i=[];for(i.length=r,u=e?(t-n)/r:(t-n)/(r-1),o=0;o<r;o+=1)i[o]=n+o*u;return i},g.sineWave=function(r,n,t,e,u){void 0===n&&(n=-1),void 0===t&&(t=1),void 0===e&&(e=1),void 0===u&&(u=0);var o=(t-n)/2;return n+o+Math.sin((u+r)*TWO_PI/e)*o},g.squareWave=function(r,n,t,e,u){void 0===n&&(n=-1),void 0===t&&(t=1),void 0===e&&(e=1),void 0===u&&(u=0);var o=e/2,i=(r+u)%e;return i<o?t:n},g.triangleWave=function(r,n,t,e,u){void 0===n&&(n=-1),void 0===t&&(t=1),void 0===e&&(e=1),void 0===u&&(u=0);var o=(t-n)/2,i=TWO_PI/e,a=0,g=r+u+e/4;return g%e!==0&&(a=g*i%TWO_PI),a<0&&(a+=TWO_PI),2*o*(1+-Math.abs(a/TWO_PI*2-1))+n},g.sawtoothWave=function(r,n,t,e,u){void 0===n&&(n=-1),void 0===t&&(t=1),void 0===e&&(e=1),void 0===u&&(u=0);var o=(t-n)/2,i=TWO_PI/e,a=0,g=r+u;return g%e!==0&&(a=g*i%TWO_PI),a<0&&(a+=TWO_PI),2*(a/TWO_PI)*o+n},g.sign=function(r){return r>0?1:0===r?0:-1},g.sin=Math.sin,g.sqrt=Math.sqrt,g.subtract=function(r,n){var t=arguments.length;if(2===t)return r-n;if(1===t)return-r;if(0===t)throw new Error("Wrong number of arguments");return _.reduce([].slice.call(arguments,1),function(r,n){return r-n},arguments[0])},g.tan=Math.tan,g.total=function(r){if(arguments.length>1?r=arguments:1!==arguments.length||Array.isArray(r)?0===arguments.length&&(r=[]):r=[r],0===r.length)return 0;var n,t=0;for(n=0;n<r.length;n+=1)t+=r[n];return t},g.xor=function(r,n){var t=arguments.length;if(2===t)return!!(r^n);throw new Error("Wrong number of arguments")},module.exports=g;
+},{"./util":23,"./vg/vg":44,"lodash":2}],22:[function(require,module,exports){
 "use strict";var g={};g.characterAt=function(t,n){return t&&0!==t.length?(t=String(t),n<0&&(n=t.length+n),t.charAt(n)):""},g.concatenate=function(){for(var t="",n=0;n<arguments.length;n++){var r=arguments[n];r=void 0!==r?String(r):"",t+=r}return t},g.endsWith=function(t,n){return!(!t||!n)&&(t=String(t),t.indexOf(n,t.length-n.length)!==-1)},g.reverse=function(t){return t.slice().reverse()},g.startsWith=function(t,n){return!(!t||!n)&&(t=String(t),0===t.indexOf(n))},g.string=String,g.stringContains=function(t,n){return!(!t||!n)&&(t=String(t),t.indexOf(n)!==-1)},g.stringEquals=function(t,n,r){return t=String(t),n=String(n),!(!t||!n)&&(r?t.toLowerCase()===n.toLowerCase():t===n)},g.stringLength=function(t){return t?(t=String(t),t.length):0},g.stringReplace=function(t,n,r){return t=String(t),t.replace(new RegExp(n,"g"),r)},g.stringSplit=function(t,n){return t?(n&&0!==n.length||(n=""),t=String(t),t.split(n)):[]},g.stringTrim=function(t){return t?(t=String(t),t.trim()):null},g.substring=function(t,n,r,e){return t?r<n?"":(t=String(t),n<0&&r<0&&(n=t.length+n,r=t.length+r),void 0!==r&&e&&(r+=1),t.substring(n,r)):""},g.toCharacterCodes=function(t){if(!t)return[];var n=[];n.length=t.length;for(var r=0;r<t.length;r+=1)n[r]=t.charCodeAt(r);return n},g.toCharacters=function(t){return t?(t=String(t),t.split("")):[]},g.toLowerCase=function(t){return t=String(t),t.toLowerCase()},g.toTitleCase=function(t){var n,r="";t=String(t);for(var e=0;e<t.length;e+=1)n=t[e],r+=0===r.length||" "===r[r.length-1]?n.toUpperCase():n;return r},g.toUpperCase=function(t){return t=String(t),t.toUpperCase()},g.wordCount=function(t){if(!t)return 0;t=String(t);var n=t.split(new RegExp("\\w+"));return n.length-1},g.toWords=function(t){var n=t.split(/\W+/);return""===n[n.length-1]&&n.pop(),n},module.exports=g;
 
-
-},{}],24:[function(require,module,exports){
+},{}],23:[function(require,module,exports){
 "use strict";var randomGenerator=function(r){if(r<0){for(var n=randomGenerator(Math.abs(r)),e=0;e<23;e+=1)n();return randomGenerator(n(0,1e4))}return function(n,e){n=n||0,e=e||1,r=(9301*r+49297)%233280;var a=r/233280;return n+a*(e-n)}};exports.randomGenerator=randomGenerator;
-
-
-},{}],25:[function(require,module,exports){
+},{}],24:[function(require,module,exports){
 "use strict";var Color=require("../objects/color"),vg={};vg.isDrawable=function(o){return Array.isArray(o)&&(o=o[0]),!!o&&("function"==typeof o.draw||(void 0!==o.x&&void 0!==o.y||void 0!==o.r&&void 0!==o.g&&void 0!==o.b))},vg.drawPoints=function(o,r){var t,i;for(o.fillStyle="blue",o.beginPath(),i=0;i<r.length;i+=1)t=r[i],o.moveTo(t.x,t.y),o.arc(t.x,t.y,2,0,2*Math.PI,!1);o.fill()},vg.drawColoredPoints=function(o,r){for(var t=0,i=r.length;t<i;t+=1){var e=r[t];o.fillStyle=Color.toCSS(e),o.fillRect(e.x-2,e.y-2,4,4)}},vg.drawRectangles=function(o,r){var t,i;for(o.save(),t=0;t<r.length;t+=1)i=r[t],o.strokeStyle="black",o.strokeWidth=1,o.rect(i.x,i.y,i.width,i.height),o.stroke();o.restore()},vg.drawColors=function(o,r){var t,i;for(o.save(),t=0;t<r.length;t+=1)i=r[t],o.fillStyle=Color.toCSS(i),o.fillRect(0,0,30,30),o.translate(30,0);o.restore()},vg.draw=function(o,r){var t=r,i=!1;if(Array.isArray(r)&&(t=r[0],i=!0),t)if("function"==typeof t.draw)if(i)for(var e=0,v=r.length;e<v;e+=1)vg.draw(o,r[e]);else r.draw(o);else void 0!==t.x&&void 0!==t.y?void 0!==t.r&&void 0!==t.g&&void 0!==t.b?vg.drawColoredPoints(o,i?r:[r]):void 0!==t.width&&void 0!==t.height?vg.drawRectangles(o,i?r:[r]):vg.drawPoints(o,i?r:[r]):void 0!==t.r&&void 0!==t.g&&void 0!==t.b&&vg.drawColors(o,i?r:[r])},vg.toSVG=function(o,r){r=r||{};var t=r.header===!0,i=void 0!==r.x?r.x:0,e=void 0!==r.y?r.y:0,v=void 0!==r.width?r.width:500,n=void 0!==r.height?r.height:500,l="";if(o)if("function"==typeof o.toSVG)l=o.toSVG();else if(Array.isArray(o)){l="<g>\n";for(var d=0,a=o.length;d<a;d+=1)l+=vg.toSVG(o[d])+"\n";l+="</g>\n"}return t&&(l='<?xml version="1.0" encoding="utf-8"?><svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" x="'+i+'" y="'+e+'" width="'+v+'px" height="'+n+'px" viewBox="'+i+" "+e+" "+v+" "+n+'">\n'+l+"</svg>\n"),l},module.exports=vg;
 
+},{"../objects/color":27}],25:[function(require,module,exports){
+"use strict";function _cloneCommand(e){var r={type:e.type};return r.type!==bezier.CLOSE&&(r.x=e.x,r.y=e.y),r.type===bezier.QUADTO?(r.x1=e.x1,r.y1=e.y1):r.type===bezier.CURVETO&&(r.x1=e.x1,r.y1=e.y1,r.x2=e.x2,r.y2=e.y2),r}var _=require("lodash"),ClipperLib=require("../../../../third_party/clipper"),bezier=require("../util/bezier"),geo=require("../util/geo"),math=require("../util/math"),random=require("../util/random"),Color=require("../objects/color"),Group=require("../objects/group"),Path=require("../objects/path"),Point=require("../objects/point"),Rect=require("../objects/rect"),Transform=require("../objects/transform"),Transformable=require("../objects/transformable"),vg={};vg.HORIZONTAL="horizontal",vg.VERTICAL="vertical",vg.EAST="e",vg.WEST="w",vg.NORTH="n",vg.SOUTH="s",vg.bounds=function(e){var r,n,t;if(e){if("function"==typeof e.bounds)return e.bounds();if(void 0!==e.x&&void 0!==e.y)return void 0!==e.width&&void 0!==e.height?new Rect(e.x,e.y,e.width,e.height):new Rect(e.x,e.y,0,0);if(void 0!==e.r&&void 0!==e.g&&void 0!==e.b)return new vg.Rect(0,0,30,30);if(Array.isArray(e)){if(r=null,t=e.length,t>0&&void 0!==e[0].r&&void 0!==e[0].g&&void 0!==e[0].b)return new Rect(0,0,30*e.length,30);for(n=0;n<t;n+=1)r=r?r.unite(vg.bounds(e[n])):vg.bounds(e[n]);return r||new Rect}return new Rect}return new Rect},vg.makeCenteredRect=function(e,r,n,t){var o=e-n/2,i=r-t/2;return new Rect(o,i,n,t)},vg.makePoint=function(e,r){return new Point(e,r)},vg.makeRect=function(e,r,n,t){return new Rect(e,r,n,t)},vg.merge=function(){return new Group(_.reject(_.flatten(arguments,!0),_.isEmpty))},vg.combinePaths=function(e){return Path.combine(e)},vg.shapePoints=vg.toPoints=function(e){if(!e)return[];if(e.commands)return _.map(_.filter(e.commands,function(e){return void 0!==e.x}),function(e){return new Point(e.x,e.y)});var r,n=[];for(r=0;r<e.shapes.length;r+=1)n=n.concat(vg.shapePoints(e.shapes[r]));return n},vg.colorize=function(e,r,n,t){if(e)return e.colorize(r,n,t)},vg.translate=function(e,r){return e.translate?e.translate(r):Transformable.translate.apply(e,[r])},vg.scale=function(e,r,n){return e.scale?e.scale(r,n):Transformable.scale.apply(e,[r,n])},vg.rotate=function(e,r,n){return e.rotate?e.rotate(r,n):Transformable.rotate.apply(e,[r,n])},vg.skew=function(e,r,n){return e.skew?e.skew(r,n):Transformable.skew.apply(e,[r,n])},vg.copy=function(e,r,n,t,o,i){var a,s,u,c,p=[],h=0,y=0,l=0,v=1,f=1;for(a=0;a<r;a+=1){for(s=new Transform,u=0;u<n.length;u+=1)c=n[u],"t"===c?s=s.translate(h,y):"r"===c?s=s.rotate(l):"s"===c&&(s=s.scale(v,f));Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y?p=p.concat(s.transformShape(e)):p.push(s.transformShape(e)),h+=t.x,y+=t.y,l+=o,v+=i.x,f+=i.y}return p},vg.fit=function(e,r,n,t,o){if(e){o=void 0!==o&&o;var i,a,s,u=vg.bounds(e),c=u.x,p=u.y,h=u.width,y=u.height;return h=h>1e-12?h:0,y=y>1e-12?y:0,i=new Transform,i=i.translate(r.x,r.y),o?(a=h>0?n/h:1,s=y>0?t/y:1):(a=h>0?n/h:Number.MAX_VALUE,s=y>0?t/y:Number.MAX_VALUE,a=s=Math.min(a,s)),i=i.scale(a,s),i=i.translate(-h/2-c,-y/2-p),i.transformShape(e)}},vg.fitTo=function(e,r,n){if(e&&r){var t=vg.bounds(r),o=t.x,i=t.y,a=t.width,s=t.height;return vg.fit(e,{x:o+a/2,y:i+s/2},a,s,n)}},vg.mirror=function(e,r,n,t){if(e){n=n||new Point,0!==r&&(r=r||90);var o,i,a,s,u=function(e,t){var o=geo.distance(e,t,n.x,n.y),i=geo.angle(e,t,n.x,n.y),a=geo.coordinates(n.x,n.y,180+r,o*Math.cos(math.radians(i-r)));return o=geo.distance(e,t,a.x,a.y),i=geo.angle(e,t,a.x,a.y),a=geo.coordinates(e,t,i,2*o),new Point(a.x,a.y)};o=function(e){for(var r,n,t,o=new Path([],e.fill,e.stroke,e.strokeWidth),i=0;i<e.commands.length;i+=1){var a=e.commands[i];if(a.type===bezier.MOVETO)r=u(a.x,a.y),o.moveTo(r.x,r.y);else if(a.type===bezier.LINETO)r=u(a.x,a.y),o.lineTo(r.x,r.y);else if(a.type===bezier.CURVETO)r=u(a.x,a.y),n=u(a.x1,a.y1),t=u(a.x2,a.y2),o.curveTo(n.x,n.y,t.x,t.y,r.x,r.y);else{if(a.type!==bezier.CLOSE)throw new Error("Unknown command "+a);o.close()}}return o},i=function(e){return _.map(e,function(e){return u(e.x,e.y)})},a=function(e){var r=_.map(e.shapes,function(e){return s(e)});return new Group(r)},s=function(e){if(Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y)return i(e);var r=e.shapes?a:o;return r(e)};var c=s(e);return t?Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y?e.concat(c):new Group([e,c]):c}},vg.pathLength=function(e,r){var n=20;return r&&r.precision&&(n=r.precision),e.length(n)},vg.resampleByLength=function(e,r){if(e)return e.resampleByLength(r)},vg.resampleByAmount=function(e,r,n){if(e)return e.resampleByAmount(r,n)},vg.wigglePoints=function(e,r,n){n=void 0!==n?n:Math.random();var t=random.generator(n);void 0===r?r={x:10,y:10}:"number"==typeof r&&(r={x:r,y:r});var o=function(e){var n,i,a;if(e.commands){var s=new Path([],e.fill,e.stroke,e.strokeWidth);for(n=0;n<e.commands.length;n+=1){i=(t(0,1)-.5)*r.x*2,a=(t(0,1)-.5)*r.y*2;var u=e.commands[n];u.type===bezier.MOVETO?s.moveTo(u.x+i,u.y+a):u.type===bezier.LINETO?s.lineTo(u.x+i,u.y+a):u.type===bezier.CURVETO?s.curveTo(u.x1,u.y1,u.x2,u.y2,u.x+i,u.y+a):u.type===bezier.CLOSE&&s.close()}return s}if(e.shapes)return new Group(_.map(e.shapes,o));if(Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y){var c=[];for(n=0;n<e.length;n+=1)i=(t(0,1)-.5)*r.x*2,a=(t(0,1)-.5)*r.y*2,c.push(new Point(e[n].x+i,e[n].y+a));return c}return _.map(e,o)};return o(e)},vg.wiggleContours=function(e,r,n){n=void 0!==n?n:Math.random();var t=random.generator(n);void 0===r?r={x:10,y:10}:"number"==typeof r&&(r={x:r,y:r});var o=function(e){if(e.commands){var n,i,a,s,u=e.contours(),c=[];for(n=0;n<u.length;n+=1)i=(t(0,1)-.5)*r.x*2,a=(t(0,1)-.5)*r.y*2,s=(new Transform).translate(i,a),c=c.concat(s.transformShape(new Path(u[n])).commands);return new Path(c,e.fill,e.stroke,e.strokeWidth)}return e.shapes?new Group(_.map(e.shapes,o)):_.map(e,o)};return o(e)},vg.wigglePaths=function(e,r,n){n=void 0!==n?n:Math.random();var t=random.generator(n);void 0===r?r={x:10,y:10}:"number"==typeof r&&(r={x:r,y:r});var o=function(e){if(e.commands)return e;if(e.shapes)return new Group(o(e.shapes));if(Array.isArray(e)){for(var n,i,a,s,u=[],c=0;c<e.length;c+=1)n=e[c],n.commands?(i=(t(0,1)-.5)*r.x*2,a=(t(0,1)-.5)*r.y*2,s=(new Transform).translate(i,a),u.push(s.transformShape(n))):n.shapes&&u.push(o(n));return u}};return o(e)},vg.scatterPoints=function(e,r,n){if(e){n=void 0!==n?n:Math.random();var t,o,i,a,s,u=random.generator(n),c=e.bounds(),p=c.x,h=c.y,y=c.width,l=c.height,v=e.contours(),f=[],g=[];for(t=0;t<v.length;t++){var d=new Path(v[t]),m=d.commands.length,x=5;f.push(d.points(m*x,{closed:!0}))}for(t=0;t<r;t+=1)for(i=100;i>0;){var b=0;for(a=p+u(0,1)*y,s=h+u(0,1)*l,o=0;o<f.length;o++)geo.pointInPolygon(f[o],a,s)&&(b+=1);if(b%2){g.push(new Point(a,s));break}i-=1}return g}},vg.connectPoints=function(e,r){if(e){for(var n=new Path,t=0;t<e.length;t+=1){var o=e[t];0===t?n.moveTo(o.x,o.y):n.lineTo(o.x,o.y)}return r&&n.close(),n.fill=null,n.stroke=Color.BLACK,n}},vg.align=function(e,r,n,t){if(e){var o,i,a,s=r.x,u=r.y,c=vg.bounds(e);return o="left"===n?s-c.x:"right"===n?s-c.x-c.width:"center"===n?s-c.x-c.width/2:0,i="top"===t?u-c.y:"bottom"===t?u-c.y-c.height:"middle"===t?u-c.y-c.height/2:0,a=(new Transform).translate(o,i),a.transformShape(e)}},vg.snap=function(e,r,n,t){if(e){n=void 0!==n?n:1,t=t||Point.ZERO;var o=function(e){if(e.commands){for(var i=new Path([],e.fill,e.stroke,e.strokeWidth),a=0;a<e.commands.length;a+=1){var s=e.commands[a];if(s.type===bezier.MOVETO||s.type===bezier.LINETO||s.type===bezier.CURVETO){var u=math.snap(s.x+t.x,r,n)-t.x,c=math.snap(s.y+t.y,r,n)-t.y;if(s.type===bezier.MOVETO)i.moveTo(u,c);else if(s.type===bezier.LINETO)i.lineTo(u,c);else if(s.type===bezier.CURVETO){var p=math.snap(s.x1+t.x,r,n)-t.x,h=math.snap(s.y1+t.y,r,n)-t.y,y=math.snap(s.x2+t.x,r,n)-t.x,l=math.snap(s.y2+t.y,r,n)-t.y;i.curveTo(p,h,y,l,u,c)}}else{if(s.type!==bezier.CLOSE)throw new Error("Invalid path command "+s);i.close()}}return i}return e.shapes?new Group(_.map(e.shapes,o)):Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y?_.map(e,function(e){var o=math.snap(e.x+t.x,r,n)-t.x,i=math.snap(e.y+t.y,r,n)-t.y;return new Point(o,i)}):_.map(e,o)};return o(e)}},vg.deletePoints=function(e,r,n){var t=function(e){var o,i,a,s=[],u=[];if(e.commands){var c=!0;for(o=0;o<e.commands.length;o+=1)i=_cloneCommand(e.commands[o]),(void 0===i.x||n&&r.contains(i.x,i.y)||!n&&!r.contains(i.x,i.y))&&(c&&i.type!==bezier.MOVETO&&(i.type=bezier.MOVETO),s.push(i),i.type===bezier.MOVETO?c=!1:i.type===bezier.CLOSE&&(c=!0));return new Path(s,e.fill,e.stroke,e.strokeWidth)}if(e.shapes)return new Group(_.map(e.shapes,t));if(Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y){for(o=0;o<e.length;o+=1)a=e[o],(n&&r.contains(a.x,a.y)||!n&&!r.contains(a.x,a.y))&&u.push(_cloneCommand(a));return u}return _.map(e,t)};return t(e)},vg.deletePaths=function(e,r,n){var t=function(e){if(e.commands)return null;if(e.shapes)return new Group(t(e.shapes));if(Array.isArray(e)){for(var o,i,a,s,u,c=[],p=e,h=0;h<p.length;h+=1)if(i=p[h],i.commands){for(a=!1,o=0;o<i.commands.length;o+=1)if(s=i.commands[o],void 0!==s.x&&r.contains(s.x,s.y)){a=!0;break}n&&!a||a&&!n||c.push(i)}else i.shapes&&(u=t(i),0!==u.length&&c.push(u));return c}};return t(e)},vg.delete=function(e,r,n,t){if(null===e||null===r)return null;if("points"===n)return vg.deletePoints(e,r,t);if("paths"===n)return vg.deletePaths(e,r,t);throw new Error("Invalid scope.")},vg.pointOnPath=function(e,r){if(e){e.shapes&&(e=new Path(vg.combinePaths(e))),r%=1,r<0&&(r=1+r);var n=e.point(r);return new Point(n.x,n.y)}},vg._x=function(e){return void 0!==e.x?e.x:e.bounds().x},vg._y=function(e){return void 0!==e.y?e.y:e.bounds().y},vg._angleToPoint=function(e){return function(r){if(void 0!==r.x&&void 0!==r.y)return geo.angle(r.x,r.y,e.x,e.y);var n=r.bounds().centerPoint();return geo.angle(n.x,n.y,e.x,e.y)}},vg._distanceToPoint=function(e){return function(r){if(void 0!==r.x&&void 0!==r.y)return geo.distance(r.x,r.y,e.x,e.y);var n=r.bounds().centerPoint();return geo.distance(n.x,n.y,e.x,e.y)}},vg.shapeSort=function(e,r,n){if(e){n=n||Point.ZERO;var t={x:vg._x,y:vg._y,angle:vg._angleToPoint(n),distance:vg._distanceToPoint(n)};if(r=t[r],void 0===r)return e;var o=e.slice(0);return o.sort(function(e,n){var t=r(e),o=r(n);return t<o?-1:t>o?1:0}),o}},vg.group=function(){return new Group(_.flatten(arguments))},vg.ungroup=function(e){if(e){if(e.shapes){var r,n,t=[];for(r=0;r<e.shapes.length;r+=1)n=e.shapes[r],n.commands?t.push(n):n.shapes&&(t=t.concat(vg.ungroup(n)));return t}return e.commands?[e]:[]}return[]},vg.centerPoint=function(e){if(!e)return Point.ZERO;var r=vg.bounds(e);return new Point(r.x+r.width/2,r.y+r.height/2)},vg.link=function(e,r,n){if(e&&r){var t=new Path,o=e.bounds(),i=r.bounds();if(n===vg.HORIZONTAL){var a=(i.x-(o.x+o.width))/2;t.moveTo(o.x+o.width,o.y),t.curveTo(o.x+o.width+a,o.y,i.x-a,i.y,i.x,i.y),t.lineTo(i.x,i.y+i.height),t.curveTo(i.x-a,i.y+i.height,o.x+o.width+a,o.y+o.height,o.x+o.width,o.y+o.height),t.close()}else{var s=(i.y-(o.y+o.height))/2;t.moveTo(o.x,o.y+o.height),t.curveTo(o.x,o.y+o.height+s,i.x,i.y-s,i.x,i.y),t.lineTo(i.x+i.width,i.y),t.curveTo(i.x+i.width,i.y-s,o.x+o.width,o.y+o.height+s,o.x+o.width,o.y+o.height),t.close()}return t}},vg.compound=function(e,r,n){function t(e){var r,n,t,o,i,a=[];for(r=0;r<e.length;r+=1){for(n=[],t=e[r],o=0;o<t.length;o+=1)i=t[o],i.type!==bezier.CLOSE&&n.push({X:i.x,Y:i.y});a.push(n)}return a}var o={union:ClipperLib.ClipType.ctUnion,difference:ClipperLib.ClipType.ctDifference,intersection:ClipperLib.ClipType.ctIntersection,xor:ClipperLib.ClipType.ctXor};e.commands||(e=Path.combine(e)),r.commands||(r=Path.combine(r));var i=e.resampleByLength(1).contours(),a=r.resampleByLength(1).contours(),s=t(i),u=t(a),c=100;ClipperLib.JS.ScaleUpPaths(s,c),ClipperLib.JS.ScaleUpPaths(u,c);var p=new ClipperLib.Clipper;p.AddPaths(s,ClipperLib.PolyType.ptSubject,e.isClosed()),p.AddPaths(u,ClipperLib.PolyType.ptClip,r.isClosed());var h=new ClipperLib.Paths;p.Execute(o[n],h,ClipperLib.PolyFillType.pftNonZero,ClipperLib.PolyFillType.pftNonZero),h=ClipperLib.JS.Clean(h,.1*c),ClipperLib.JS.ScaleDownPaths(h,c);var y,l,v,f=new Path;for(y=0;y<h.length;y+=1){for(v=h[y],l=0;l<v.length;l+=1)0===l?f.moveTo(v[l].X,v[l].Y):f.lineTo(v[l].X,v[l].Y);v[0].X===v[v.length-1].X&&v[0].Y===v[v.length-1].Y||f.closePath()}return f},module.exports=vg;
 
-},{"../objects/color":28}],26:[function(require,module,exports){
-"use strict";function _cloneCommand(e){var r={type:e.type};return r.type!==bezier.CLOSE&&(r.x=e.x,r.y=e.y),r.type===bezier.QUADTO?(r.x1=e.x1,r.y1=e.y1):r.type===bezier.CURVETO&&(r.x1=e.x1,r.y1=e.y1,r.x2=e.x2,r.y2=e.y2),r}var _=require("lodash"),ClipperLib=require("js-clipper"),bezier=require("../util/bezier"),geo=require("../util/geo"),math=require("../util/math"),random=require("../util/random"),Color=require("../objects/color"),Group=require("../objects/group"),Path=require("../objects/path"),Point=require("../objects/point"),Rect=require("../objects/rect"),Transform=require("../objects/transform"),Transformable=require("../objects/transformable"),vg={};vg.HORIZONTAL="horizontal",vg.VERTICAL="vertical",vg.EAST="e",vg.WEST="w",vg.NORTH="n",vg.SOUTH="s",vg.bounds=function(e){var r,n,t;if(e){if("function"==typeof e.bounds)return e.bounds();if(void 0!==e.x&&void 0!==e.y)return void 0!==e.width&&void 0!==e.height?new Rect(e.x,e.y,e.width,e.height):new Rect(e.x,e.y,0,0);if(void 0!==e.r&&void 0!==e.g&&void 0!==e.b)return new vg.Rect(0,0,30,30);if(Array.isArray(e)){if(r=null,t=e.length,t>0&&void 0!==e[0].r&&void 0!==e[0].g&&void 0!==e[0].b)return new Rect(0,0,30*e.length,30);for(n=0;n<t;n+=1)r=r?r.unite(vg.bounds(e[n])):vg.bounds(e[n]);return r||new Rect}return new Rect}return new Rect},vg.makeCenteredRect=function(e,r,n,t){var o=e-n/2,i=r-t/2;return new Rect(o,i,n,t)},vg.makePoint=function(e,r){return new Point(e,r)},vg.makeRect=function(e,r,n,t){return new Rect(e,r,n,t)},vg.merge=function(){return new Group(_.reject(_.flatten(arguments,!0),_.isEmpty))},vg.combinePaths=function(e){return Path.combine(e)},vg.shapePoints=vg.toPoints=function(e){if(!e)return[];if(e.commands)return _.map(_.filter(e.commands,function(e){return void 0!==e.x}),function(e){return new Point(e.x,e.y)});var r,n=[];for(r=0;r<e.shapes.length;r+=1)n=n.concat(vg.shapePoints(e.shapes[r]));return n},vg.colorize=function(e,r,n,t){if(e)return e.colorize(r,n,t)},vg.translate=function(e,r){return e.translate?e.translate(r):Transformable.translate.apply(e,[r])},vg.scale=function(e,r,n){return e.scale?e.scale(r,n):Transformable.scale.apply(e,[r,n])},vg.rotate=function(e,r,n){return e.rotate?e.rotate(r,n):Transformable.rotate.apply(e,[r,n])},vg.skew=function(e,r,n){return e.skew?e.skew(r,n):Transformable.skew.apply(e,[r,n])},vg.copy=function(e,r,n,t,o,i){var a,s,u,c,p=[],h=0,l=0,y=0,v=1,f=1;for(a=0;a<r;a+=1){for(s=new Transform,u=0;u<n.length;u+=1)c=n[u],"t"===c?s=s.translate(h,l):"r"===c?s=s.rotate(y):"s"===c&&(s=s.scale(v,f));Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y?p=p.concat(s.transformShape(e)):p.push(s.transformShape(e)),h+=t.x,l+=t.y,y+=o,v+=i.x,f+=i.y}return p},vg.fit=function(e,r,n,t,o){if(e){o=void 0!==o&&o;var i,a,s,u=vg.bounds(e),c=u.x,p=u.y,h=u.width,l=u.height;return h=h>1e-12?h:0,l=l>1e-12?l:0,i=new Transform,i=i.translate(r.x,r.y),o?(a=h>0?n/h:1,s=l>0?t/l:1):(a=h>0?n/h:Number.MAX_VALUE,s=l>0?t/l:Number.MAX_VALUE,a=s=Math.min(a,s)),i=i.scale(a,s),i=i.translate(-h/2-c,-l/2-p),i.transformShape(e)}},vg.fitTo=function(e,r,n){if(e&&r){var t=vg.bounds(r),o=t.x,i=t.y,a=t.width,s=t.height;return vg.fit(e,{x:o+a/2,y:i+s/2},a,s,n)}},vg.mirror=function(e,r,n,t){if(e){n=n||new Point,0!==r&&(r=r||90);var o,i,a,s,u=function(e,t){var o=geo.distance(e,t,n.x,n.y),i=geo.angle(e,t,n.x,n.y),a=geo.coordinates(n.x,n.y,180+r,o*Math.cos(math.radians(i-r)));return o=geo.distance(e,t,a.x,a.y),i=geo.angle(e,t,a.x,a.y),a=geo.coordinates(e,t,i,2*o),new Point(a.x,a.y)};o=function(e){for(var r,n,t,o=new Path([],e.fill,e.stroke,e.strokeWidth),i=0;i<e.commands.length;i+=1){var a=e.commands[i];if(a.type===bezier.MOVETO)r=u(a.x,a.y),o.moveTo(r.x,r.y);else if(a.type===bezier.LINETO)r=u(a.x,a.y),o.lineTo(r.x,r.y);else if(a.type===bezier.CURVETO)r=u(a.x,a.y),n=u(a.x1,a.y1),t=u(a.x2,a.y2),o.curveTo(n.x,n.y,t.x,t.y,r.x,r.y);else{if(a.type!==bezier.CLOSE)throw new Error("Unknown command "+a);o.close()}}return o},i=function(e){return _.map(e,function(e){return u(e.x,e.y)})},a=function(e){var r=_.map(e.shapes,function(e){return s(e)});return new Group(r)},s=function(e){if(Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y)return i(e);var r=e.shapes?a:o;return r(e)};var c=s(e);return t?Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y?e.concat(c):new Group([e,c]):c}},vg.pathLength=function(e,r){var n=20;return r&&r.precision&&(n=r.precision),e.length(n)},vg.resampleByLength=function(e,r){if(e)return e.resampleByLength(r)},vg.resampleByAmount=function(e,r,n){if(e)return e.resampleByAmount(r,n)},vg.wigglePoints=function(e,r,n){n=void 0!==n?n:Math.random();var t=random.generator(n);void 0===r?r={x:10,y:10}:"number"==typeof r&&(r={x:r,y:r});var o=function(e){var n,i,a;if(e.commands){var s=new Path([],e.fill,e.stroke,e.strokeWidth);for(n=0;n<e.commands.length;n+=1){i=(t(0,1)-.5)*r.x*2,a=(t(0,1)-.5)*r.y*2;var u=e.commands[n];u.type===bezier.MOVETO?s.moveTo(u.x+i,u.y+a):u.type===bezier.LINETO?s.lineTo(u.x+i,u.y+a):u.type===bezier.CURVETO?s.curveTo(u.x1,u.y1,u.x2,u.y2,u.x+i,u.y+a):u.type===bezier.CLOSE&&s.close()}return s}if(e.shapes)return new Group(_.map(e.shapes,o));if(Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y){var c=[];for(n=0;n<e.length;n+=1)i=(t(0,1)-.5)*r.x*2,a=(t(0,1)-.5)*r.y*2,c.push(new Point(e[n].x+i,e[n].y+a));return c}return _.map(e,o)};return o(e)},vg.wiggleContours=function(e,r,n){n=void 0!==n?n:Math.random();var t=random.generator(n);void 0===r?r={x:10,y:10}:"number"==typeof r&&(r={x:r,y:r});var o=function(e){if(e.commands){var n,i,a,s,u=e.contours(),c=[];for(n=0;n<u.length;n+=1)i=(t(0,1)-.5)*r.x*2,a=(t(0,1)-.5)*r.y*2,s=(new Transform).translate(i,a),c=c.concat(s.transformShape(new Path(u[n])).commands);return new Path(c,e.fill,e.stroke,e.strokeWidth)}return e.shapes?new Group(_.map(e.shapes,o)):_.map(e,o)};return o(e)},vg.wigglePaths=function(e,r,n){n=void 0!==n?n:Math.random();var t=random.generator(n);void 0===r?r={x:10,y:10}:"number"==typeof r&&(r={x:r,y:r});var o=function(e){if(e.commands)return e;if(e.shapes)return new Group(o(e.shapes));if(Array.isArray(e)){for(var n,i,a,s,u=[],c=0;c<e.length;c+=1)n=e[c],n.commands?(i=(t(0,1)-.5)*r.x*2,a=(t(0,1)-.5)*r.y*2,s=(new Transform).translate(i,a),u.push(s.transformShape(n))):n.shapes&&u.push(o(n));return u}};return o(e)},vg.scatterPoints=function(e,r,n){if(e){n=void 0!==n?n:Math.random();var t,o,i,a,s,u=random.generator(n),c=e.bounds(),p=c.x,h=c.y,l=c.width,y=c.height,v=e.contours(),f=[],g=[];for(t=0;t<v.length;t++){var d=new Path(v[t]),m=d.commands.length,x=5;f.push(d.points(m*x,{closed:!0}))}for(t=0;t<r;t+=1)for(i=100;i>0;){var b=0;for(a=p+u(0,1)*l,s=h+u(0,1)*y,o=0;o<f.length;o++)geo.pointInPolygon(f[o],a,s)&&(b+=1);if(b%2){g.push(new Point(a,s));break}i-=1}return g}},vg.connectPoints=function(e,r){if(e){for(var n=new Path,t=0;t<e.length;t+=1){var o=e[t];0===t?n.moveTo(o.x,o.y):n.lineTo(o.x,o.y)}return r&&n.close(),n.fill=null,n.stroke=Color.BLACK,n}},vg.align=function(e,r,n,t){if(e){var o,i,a,s=r.x,u=r.y,c=vg.bounds(e);return o="left"===n?s-c.x:"right"===n?s-c.x-c.width:"center"===n?s-c.x-c.width/2:0,i="top"===t?u-c.y:"bottom"===t?u-c.y-c.height:"middle"===t?u-c.y-c.height/2:0,a=(new Transform).translate(o,i),a.transformShape(e)}},vg.snap=function(e,r,n,t){if(e){n=void 0!==n?n:1,t=t||Point.ZERO;var o=function(e){if(e.commands){for(var i=new Path([],e.fill,e.stroke,e.strokeWidth),a=0;a<e.commands.length;a+=1){var s=e.commands[a];if(s.type===bezier.MOVETO||s.type===bezier.LINETO||s.type===bezier.CURVETO){var u=math.snap(s.x+t.x,r,n)-t.x,c=math.snap(s.y+t.y,r,n)-t.y;if(s.type===bezier.MOVETO)i.moveTo(u,c);else if(s.type===bezier.LINETO)i.lineTo(u,c);else if(s.type===bezier.CURVETO){var p=math.snap(s.x1+t.x,r,n)-t.x,h=math.snap(s.y1+t.y,r,n)-t.y,l=math.snap(s.x2+t.x,r,n)-t.x,y=math.snap(s.y2+t.y,r,n)-t.y;i.curveTo(p,h,l,y,u,c)}}else{if(s.type!==bezier.CLOSE)throw new Error("Invalid path command "+s);i.close()}}return i}return e.shapes?new Group(_.map(e.shapes,o)):Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y?_.map(e,function(e){var o=math.snap(e.x+t.x,r,n)-t.x,i=math.snap(e.y+t.y,r,n)-t.y;return new Point(o,i)}):_.map(e,o)};return o(e)}},vg.deletePoints=function(e,r,n){var t=function(e){var o,i,a,s=[],u=[];if(e.commands){var c=!0;for(o=0;o<e.commands.length;o+=1)i=_cloneCommand(e.commands[o]),(void 0===i.x||n&&r.contains(i.x,i.y)||!n&&!r.contains(i.x,i.y))&&(c&&i.type!==bezier.MOVETO&&(i.type=bezier.MOVETO),s.push(i),i.type===bezier.MOVETO?c=!1:i.type===bezier.CLOSE&&(c=!0));return new Path(s,e.fill,e.stroke,e.strokeWidth)}if(e.shapes)return new Group(_.map(e.shapes,t));if(Array.isArray(e)&&e.length>0&&void 0!==e[0].x&&void 0!==e[0].y){for(o=0;o<e.length;o+=1)a=e[o],(n&&r.contains(a.x,a.y)||!n&&!r.contains(a.x,a.y))&&u.push(_cloneCommand(a));return u}return _.map(e,t)};return t(e)},vg.deletePaths=function(e,r,n){var t=function(e){if(e.commands)return null;if(e.shapes)return new Group(t(e.shapes));if(Array.isArray(e)){for(var o,i,a,s,u,c=[],p=e,h=0;h<p.length;h+=1)if(i=p[h],i.commands){for(a=!1,o=0;o<i.commands.length;o+=1)if(s=i.commands[o],void 0!==s.x&&r.contains(s.x,s.y)){a=!0;break}n&&!a||a&&!n||c.push(i)}else i.shapes&&(u=t(i),0!==u.length&&c.push(u));return c}};return t(e)},vg.delete=function(e,r,n,t){if(null===e||null===r)return null;if("points"===n)return vg.deletePoints(e,r,t);if("paths"===n)return vg.deletePaths(e,r,t);throw new Error("Invalid scope.")},vg.pointOnPath=function(e,r){if(e){e.shapes&&(e=new Path(vg.combinePaths(e))),r%=1,r<0&&(r=1+r);var n=e.point(r);return new Point(n.x,n.y)}},vg._x=function(e){return void 0!==e.x?e.x:e.bounds().x},vg._y=function(e){return void 0!==e.y?e.y:e.bounds().y},vg._angleToPoint=function(e){return function(r){if(void 0!==r.x&&void 0!==r.y)return geo.angle(r.x,r.y,e.x,e.y);var n=r.bounds().centerPoint();return geo.angle(n.x,n.y,e.x,e.y)}},vg._distanceToPoint=function(e){return function(r){if(void 0!==r.x&&void 0!==r.y)return geo.distance(r.x,r.y,e.x,e.y);var n=r.bounds().centerPoint();return geo.distance(n.x,n.y,e.x,e.y)}},vg.shapeSort=function(e,r,n){if(e){n=n||Point.ZERO;var t={x:vg._x,y:vg._y,angle:vg._angleToPoint(n),distance:vg._distanceToPoint(n)};if(r=t[r],void 0===r)return e;var o=e.slice(0);return o.sort(function(e,n){var t=r(e),o=r(n);return t<o?-1:t>o?1:0}),o}},vg.group=function(){return new Group(_.flatten(arguments))},vg.ungroup=function(e){if(e){if(e.shapes){var r,n,t=[];for(r=0;r<e.shapes.length;r+=1)n=e.shapes[r],n.commands?t.push(n):n.shapes&&(t=t.concat(vg.ungroup(n)));return t}return e.commands?[e]:[]}return[]},vg.centerPoint=function(e){if(!e)return Point.ZERO;var r=vg.bounds(e);return new Point(r.x+r.width/2,r.y+r.height/2)},vg.link=function(e,r,n){if(e&&r){var t=new Path,o=e.bounds(),i=r.bounds();if(n===vg.HORIZONTAL){var a=(i.x-(o.x+o.width))/2;t.moveTo(o.x+o.width,o.y),t.curveTo(o.x+o.width+a,o.y,i.x-a,i.y,i.x,i.y),t.lineTo(i.x,i.y+i.height),t.curveTo(i.x-a,i.y+i.height,o.x+o.width+a,o.y+o.height,o.x+o.width,o.y+o.height),t.close()}else{var s=(i.y-(o.y+o.height))/2;t.moveTo(o.x,o.y+o.height),t.curveTo(o.x,o.y+o.height+s,i.x,i.y-s,i.x,i.y),t.lineTo(i.x+i.width,i.y),t.curveTo(i.x+i.width,i.y-s,o.x+o.width,o.y+o.height+s,o.x+o.width,o.y+o.height),t.close()}return t}},vg.compound=function(e,r,n){function t(e){var r,n,t,o,i,a=[];for(r=0;r<e.length;r+=1){for(n=[],t=e[r],o=0;o<t.length;o+=1)i=t[o],i.type!==bezier.CLOSE&&n.push({X:i.x,Y:i.y});a.push(n)}return a}var o={union:ClipperLib.ClipType.ctUnion,difference:ClipperLib.ClipType.ctDifference,intersection:ClipperLib.ClipType.ctIntersection,xor:ClipperLib.ClipType.ctXor};e.commands||(e=Path.combine(e)),r.commands||(r=Path.combine(r));var i=e.resampleByLength(1).contours(),a=r.resampleByLength(1).contours(),s=t(i),u=t(a),c=100;ClipperLib.JS.ScaleUpPaths(s,c),ClipperLib.JS.ScaleUpPaths(u,c);var p=new ClipperLib.Clipper;p.AddPaths(s,ClipperLib.PolyType.ptSubject,e.isClosed()),p.AddPaths(u,ClipperLib.PolyType.ptClip,r.isClosed());var h=new ClipperLib.Paths;p.Execute(o[n],h,ClipperLib.PolyFillType.pftNonZero,ClipperLib.PolyFillType.pftNonZero),h=ClipperLib.JS.Clean(h,.1*c),ClipperLib.JS.ScaleDownPaths(h,c);var l,y,v,f=new Path;for(l=0;l<h.length;l+=1){for(v=h[l],y=0;y<v.length;y+=1)0===y?f.moveTo(v[y].X,v[y].Y):f.lineTo(v[y].X,v[y].Y);v[0].X===v[v.length-1].X&&v[0].Y===v[v.length-1].Y||f.closePath()}return f},module.exports=vg;
-
-
-},{"../objects/color":28,"../objects/group":29,"../objects/path":31,"../objects/point":32,"../objects/rect":33,"../objects/transform":35,"../objects/transformable":36,"../util/bezier":38,"../util/geo":40,"../util/math":42,"../util/random":43,"js-clipper":2,"lodash":3}],27:[function(require,module,exports){
+},{"../../../../third_party/clipper":45,"../objects/color":27,"../objects/group":28,"../objects/path":30,"../objects/point":31,"../objects/rect":32,"../objects/transform":34,"../objects/transformable":35,"../util/bezier":37,"../util/geo":39,"../util/math":41,"../util/random":42,"lodash":2}],26:[function(require,module,exports){
 "use strict";var _=require("lodash"),geo=require("../util/geo"),Color=require("../objects/color"),Path=require("../objects/path"),Point=require("../objects/point"),gText=require("../objects/text"),vg={};vg.roundedRect=function(e,t,n,r,o,a){var i=new Path;return i.addRoundedRect(e,t,n,r,o,a),i},vg.quad=function(e,t,n,r){var o=arguments,a=new Path;return 8===o.length?Path.prototype.addQuad.apply(a,o):(e=Point.read(e),t=Point.read(t),n=Point.read(n),r=Point.read(r),a.addQuad(e.x,e.y,t.x,t.y,n.x,n.y,r.x,r.y)),a},vg.rect=function(e,t,n,r){var o=arguments;if(3===o.length?e=Point.read(e):4===o.length?"number"==typeof o[0]&&"number"==typeof o[1]?(e=Point.read(o[0],o[1]),t=o[2],n=o[3],r=null):(e=Point.read(e),r=Point.read(r)):5!==o.length&&6!==o.length||(e=Point.read(o[0],o[1]),t=o[2],n=o[3],r=5===o.length&&"number"==typeof o[4]?Point.read(o[4],o[4]):Point.read(o[4],o[5])),!r||0===r.x&&0===r.y){var a=new Path;return a.addRect(e.x-t/2,e.y-n/2,t,n),a}return vg.roundedRect(e.x-t/2,e.y-n/2,t,n,r.x,r.y)},vg.ellipse=function(e,t,n){var r=arguments;4===r.length?(e=Point.read(r[0],r[1]),t=r[2],n=r[3]):e=Point.read(e);var o=new Path;return o.addEllipse(e.x-t/2,e.y-n/2,t,n),o},vg.line=function(e,t){var n=arguments;4===n.length?(e=Point.read(n[0],n[1]),t=Point.read(n[2],n[3])):(e=Point.read(e),t=Point.read(t));var r=new Path;return r.addLine(e.x,e.y,t.x,t.y),r.fill=null,r.stroke="black",r},vg.lineAngle=function(e,t,n){var r=arguments;4===r.length?(e=Point.read(r[0],r[1]),n=r[2],t=r[3]):e=Point.read(e);var o=geo.coordinates(e.x,e.y,t,n);return vg.line(e,o)},vg.arc=function(e,t,n,r,o,a){var i=arguments;7===i.length?(e=Point.read(i[0],i[1]),t=i[2],n=i[3],r=i[4],o=i[5],a=i[6]):e=Point.read(e);var l=new Path;return l.addArc(e.x,e.y,t,n,r,o,a),l},vg.curve=function(e,t,n,r){var o=arguments;6===o.length?(e=Point.read(o[0],o[1]),t=Point.read(o[2],o[3]),n=o[4],r=o[5]):(e=Point.read(e),t=Point.read(t));var a=e.x+n*(t.x-e.x),i=e.y+n*(t.y-e.y),l=geo.angle(e.x,e.y,t.x,t.y)+90,d=geo.coordinates(a,i,l,r),u=d.x,g=d.y,v=e.x+2/3*(u-e.x),y=e.y+2/3*(g-e.y),c=t.x+2/3*(u-t.x),x=t.y+2/3*(g-t.y),P=new Path;return P.moveTo(e.x,e.y),P.curveTo(v,y,c,x,t.x,t.y),P.fill=null,P.stroke=Color.BLACK,P},vg.polygon=function(e,t,n,r){var o=arguments;5===o.length||4===o.length&&"number"==typeof o[0]&&"number"==typeof o[1]?(e=Point.read(o[0],o[1]),t=o[2],n=o[3],r=5!==o.length||o[4]):(e=Point.read(e),3===o.length&&(r=!0)),n=Math.max(n,3);var a,i,l,d,u=e.x,g=e.y,v=t,y=360/n,c=0;r===!0&&(a=geo.coordinates(u,g,0,v),i=geo.coordinates(u,g,y,v),c=-geo.angle(i.x,i.y,a.x,a.y));var x=new Path;for(l=0;l<n;l+=1)d=geo.coordinates(u,g,y*l+c,v),0===l?x.moveTo(d.x,d.y):x.lineTo(d.x,d.y);return x.close(),x},vg.star=function(e,t,n,r){var o=arguments;5===o.length||4===o.length&&"number"==typeof o[0]&&"number"==typeof o[1]?(e=Point.read(o[0],o[1]),t=o[2],n=o[3],r=o[4]):e=Point.read(e),r||(r=n);var a,i,l,d,u,g=new Path;for(g.moveTo(e.x,e.y+n/2),a=1;a<2*t;a+=1)i=a*Math.PI/t,l=a%2===1?r/2:n/2,d=e.x+l*Math.sin(i),u=e.y+l*Math.cos(i),g.lineTo(d,u);return g.close(),g},vg.freehand=function(e){var t,n,r,o=function(e){return""!==e},a=_.filter(e.split("M"),o);a=_.map(a,function(e){return e.replace(/,/g," ")});var i=new Path;for(n=0;n<a.length;n+=1)for(r=_.filter(a[n].split(" "),o),t=0;t<r.length;t+=2)if(void 0!==r[t+1]){var l=parseFloat(r[t]),d=parseFloat(r[t+1]);0===t?i.moveTo(l,d):i.lineTo(l,d)}return i.fill=null,i.stroke=Color.BLACK,i},vg.grid=function(e,t,n,r,o){var a,i,l,d,u,g,v,y,c,x=[];for(x.length=e*t,o=void 0!==o?o:Point.ZERO,e>1?(a=n*(e-1),i=o.x-a/2):i=o.x,t>1?(l=r*(t-1),d=o.y-l/2):d=o.y,c=0,u=0;u<t;u+=1)for(g=0;g<e;g+=1)v=i+g*n,y=d+u*r,x[c]=new Point(v,y),c+=1;return x},vg.text=function(){var e=Object.create(gText.prototype);return e.constructor=gText.prototype,gText.apply(e,arguments),e},vg.demoRect=function(){return new vg.rect({x:0,y:0},100,100,{x:0,y:0})},vg.demoEllipse=function(){return new vg.ellipse({x:0,y:0},100,100)},module.exports=vg;
 
-
-},{"../objects/color":28,"../objects/path":31,"../objects/point":32,"../objects/text":34,"../util/geo":40,"lodash":3}],28:[function(require,module,exports){
+},{"../objects/color":27,"../objects/path":30,"../objects/point":31,"../objects/text":33,"../util/geo":39,"lodash":2}],27:[function(require,module,exports){
 "use strict";var math=require("../util/math"),color=require("../util/color"),js=require("../util/js"),HSB="HSB",HSL="HSL",HEX="HEX",Color=function(r,o,t,e,s){var n,i,l,a,h,d;void 0===r?(n=i=l=0,a=1):Array.isArray(r)?(d=o||{},n=void 0!==r[0]?r[0]:0,i=void 0!==r[1]?r[1]:0,l=void 0!==r[2]?r[2]:0,a=void 0!==r[3]?r[3]:d.range||1):void 0!==r.r?(d=o||{},n=r.r,i=r.g,l=r.b,a=void 0!==r.a?r.a:d.range||1):"string"==typeof r?(h=color.hex2rgb(r),n=h[0],i=h[1],l=h[2],a=1):"number"==typeof r&&(1===arguments.length?(n=i=l=r,a=1):2===arguments.length?(n=i=l=r,"number"==typeof o?a=o:(d=o,a=d.range||1)):3===arguments.length?"number"==typeof t?(n=r,i=o,l=t,a=1):(n=i=l=r,a=o,d=t):4===arguments.length?(n=r,i=o,l=t,"number"==typeof e?a=e:(d=e,a=d.range||1)):(n=r,i=o,l=t,a=e,d=s)),d=d||{},void 0!==d.range&&(n/=d.range,i/=d.range,l/=d.range,a/=d.range,d.mode===HSB&&(r/=d.range,o/=d.range,t/=d.range)),d.mode===HSB?(r=math.clamp(r,0,1),o=math.clamp(o,0,1),t=math.clamp(t,0,1),h=color.hsb2rgb(r,o,t),n=h[0],i=h[1],l=h[2]):d.mode===HSL?(r=math.clamp(r,0,1),o=math.clamp(o,0,1),t=math.clamp(t,0,1),h=color.hsl2rgb(r,o,t),n=h[0],i=h[1],l=h[2]):d.mode===HEX&&(h=color.hex2rgb(r),n=h[0],i=h[1],l=h[2],a=1),this.r=math.clamp(n,0,1),this.g=math.clamp(i,0,1),this.b=math.clamp(l,0,1),this.a=math.clamp(a,0,1)};Color.BLACK=new Color(0),Color.WHITE=new Color(1),js.defineAlias(Color,"r","red"),js.defineAlias(Color,"g","green"),js.defineAlias(Color,"b","blue"),js.defineAlias(Color,"a","alpha"),js.defineGetter(Color,"h",function(){return color.rgb2hsl(this.r,this.g,this.b)[0]}),js.defineGetter(Color,"s",function(){return color.rgb2hsl(this.r,this.g,this.b)[1]}),js.defineGetter(Color,"l",function(){return color.rgb2hsl(this.r,this.g,this.b)[2]}),js.defineAlias(Color,"h","hue"),js.defineAlias(Color,"s","saturation"),js.defineAlias(Color,"l","lightness"),js.defineGetter(Color,"rgb",function(){return[this.r,this.g,this.b]}),js.defineGetter(Color,"rgba",function(){return[this.r,this.g,this.b,this.a]}),js.defineGetter(Color,"hsb",function(){return color.rgb2hsb(this.r,this.g,this.b)}),js.defineGetter(Color,"hsba",function(){return color.rgb2hsb(this.r,this.g,this.b).concat([this.a])}),js.defineGetter(Color,"hsl",function(){return color.rgb2hsl(this.r,this.g,this.b)}),js.defineGetter(Color,"hsla",function(){return color.rgb2hsl(this.r,this.g,this.b).concat([this.a])}),Color.prototype.toCSS=function(){return Color.toCSS(this)},Color.prototype.toHex=function(){return this.a>=1?color.rgb2hex(this.r,this.g,this.b):color.rgba2hex(this.r,this.g,this.b,this.a)},Color.prototype.desaturate=function(r){if(this.r===this.g&&this.g===this.b)return this;var o,t,e;void 0!==r&&r.method&&"ITU-R BT.601"!==r.method?"ITU-R BT.709"===r.method&&(o=.2125,t=.7154,e=.0721):(o=.3,t=.59,e=.11);var s=this.r*o+this.g*t+this.b*e;return new Color(s,s,s,this.a)},Color.prototype.invert=function(){return new Color(1-this.r,1-this.g,1-this.b,this.a)},Color.clone=function(r){return null===r||void 0===r?null:"string"==typeof r?r:new Color(r.r,r.g,r.b,r.a)},Color.toCSS=function(r){if(null===r)return"none";if(void 0===r)return"black";if("string"==typeof r)return r;if(r instanceof Color){var o=Math.round(255*r.r),t=Math.round(255*r.g),e=Math.round(255*r.b);return"rgba("+o+", "+t+", "+e+", "+r.a+")"}if(void 0!==r.r&&void 0!==r.g&&void 0!==r.b)return void 0===r.a?"rgb("+r.r+", "+r.g+", "+r.b+")":"rgba("+r.r+", "+r.g+", "+r.b+", "+r.a+")";throw new Error("Don't know how to convert "+r+" to CSS.")},Color.toHex=function(r){return Color.parse(r).toHex()},Color.make=function(){var r=Object.create(Color.prototype);return r.constructor=Color.prototype,Color.apply(r,arguments),r},Color.parse=function(r){function o(r,o){return!(!r||!o)&&(r=String(r),0===r.indexOf(o))}var t;if(void 0===r||null===r)return new Color(0,0,0,0);if(r instanceof Color)return r;if(color.namedColors[r])return Color.make.apply(null,color.namedColors[r]);if("#"===r[0])return new Color(r,0,0,0,{mode:HEX});if(o(r,"rgba"))return t=r.match(/^rgba\s*\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+|\d+.\d+)\s*\)$/i),t?new Color(parseInt(t[1])/255,parseInt(t[2])/255,parseInt(t[3])/255,parseFloat(t[4])):(t=r.match(/^rgba\s*\(\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)\s*\)$/i))?new Color(parseFloat(t[1])/100,parseFloat(t[2])/100,parseFloat(t[3])/100,parseFloat(t[4])):new Color(0,0,0,0);if(o(r,"rgb"))return t=r.match(/^rgb\s*\(\s*(\d+)\s*,\s*(\d+)\s*,\s*(\d+)\s*\)$/i),t?new Color(parseInt(t[1])/255,parseInt(t[2])/255,parseInt(t[3])/255):(t=r.match(/^rgb\s*\(\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*\)$/i))?new Color(parseFloat(t[1])/100,parseFloat(t[2])/100,parseFloat(t[3])/100):new Color(0,0,0,0);if(o(r,"hsla"))return t=r.match(/^hsla\s*\(\s*(\d+|\d+.\d+)\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)\s*\)$/i),t?new Color(parseFloat(t[1])/360,parseFloat(t[2])/100,parseFloat(t[3])/100,parseFloat(t[4])):new Color(0,0,0,0);if(o(r,"hsl"))return t=r.match(/^hsl\s*\(\s*(\d+|\d+.\d+)\s*,\s*(\d+|\d+.\d+)%\s*,\s*(\d+|\d+.\d+)%\s*\)$/i),t?new Color(parseFloat(t[1])/360,parseFloat(t[2])/100,parseFloat(t[3])/100):new Color(0,0,0,0);if("none"===r||"null"===r||o(r,"url("))return new Color(0,0,0,0);throw new Error("Color "+r+"can not be parsed")},Color.gray=function(r,o,t){return t=Math.max(t,1),new Color(r/t,r/t,r/t,o/t)},Color.rgb=function(r,o,t,e,s){return s=Math.max(s,1),new Color(r/s,o/s,t/s,e/s)},Color.hsb=function(r,o,t,e,s){return s=Math.max(s,1),new Color(r/s,o/s,t/s,e/s,{mode:HSB})},Color.hsl=function(r,o,t,e,s){return s=Math.max(s,1),new Color(r/s,o/s,t/s,e/s,{mode:HSL})},module.exports=Color;
 
-
-},{"../util/color":39,"../util/js":41,"../util/math":42}],29:[function(require,module,exports){
+},{"../util/color":38,"../util/js":40,"../util/math":41}],28:[function(require,module,exports){
 "use strict";var _=require("lodash"),Path=require("../objects/path"),Rect=require("../objects/rect"),Color=require("../objects/color"),Group=function(t){t?t.shapes||t.commands?this.shapes=[t]:t&&(this.shapes=t):this.shapes=[]};Group.prototype.add=function(t){this.shapes.push(t)},Group.prototype.clone=function(){var t,e=[],r=this.shapes.length;for(e.length=r,t=0;t<r;t+=1)e[t]=this.shapes[t].clone();return new Group(e)},Group.prototype.colorize=function(t){var e=arguments;("object"!=typeof t||t instanceof Color)&&(t={},void 0!==e[0]&&(t.fill=e[0]),void 0!==e[1]&&(t.stroke=e[1]),void 0!==e[2]&&(t.strokeWidth=e[2]));var r=_.map(this.shapes,function(e){return e.colorize(t)});return new Group(r)},Group.prototype.desaturate=function(t){var e=_.map(this.shapes,function(e){return e.desaturate(t)});return new Group(e)},Group.prototype.invert=function(){var t=_.map(this.shapes,function(t){return t.invert()});return new Group(t)},Group.prototype.bounds=function(){if(0===this.shapes.length)return new Rect(0,0,0,0);var t,e,r,o=this.shapes;for(t=0;t<o.length;t+=1)r=o[t],void 0===e&&(e=r.bounds()),(r.shapes&&0!==r.shapes.length||r.commands&&0!==r.commands.length)&&(e=e.unite(r.bounds()));return void 0!==e?e:new Rect(0,0,0,0)},Group.prototype.contains=function(t,e,r){void 0===r&&(r=100);var o,n=this.shapes;for(o=0;o<n.length;o+=1)if(n[o].contains(t,e,r))return!0;return!1},Group.prototype.length=function(t){void 0===t&&(t=10);for(var e=0,r=this.shapes,o=0;o<r.length;o+=1)e+=r[o].length(t);return e},Group.prototype.resampleByAmount=function(t,e){var r,o;return e?(o=_.map(this.shapes,function(r){return r.resampleByAmount(t,e)}),new Group(o)):(r=new Path.combine(this),r.resampleByAmount(t,e))},Group.prototype.resampleByLength=function(t){var e=_.map(this.shapes,function(e){return e.resampleByLength(t)});return new Group(e)},Group.prototype.toSVG=function(){var t;return t=_.map(this.shapes,function(t){return t.toSVG()}),"<g>"+t.join("")+"</g>"},Group.prototype.draw=function(t){var e,r=this.shapes,o=r.length;for(e=0;e<o;e+=1)r[e].draw(t)},module.exports=Group;
 
-
-},{"../objects/color":28,"../objects/path":31,"../objects/rect":33,"lodash":3}],30:[function(require,module,exports){
+},{"../objects/color":27,"../objects/path":30,"../objects/rect":32,"lodash":2}],29:[function(require,module,exports){
 "use strict";var Vec3=require("../objects/vec3"),Matrix4=function(m){void 0!==m?this.m=m:(m=new Float32Array(16),m[0]=1,m[1]=0,m[2]=0,m[3]=0,m[4]=0,m[5]=1,m[6]=0,m[7]=0,m[8]=0,m[9]=0,m[10]=1,m[11]=0,m[12]=0,m[13]=0,m[14]=0,m[15]=1,this.m=m)};Matrix4.IDENTITY=new Matrix4,Matrix4.perspective=function(m,t,i,s){var h=new Float32Array(Matrix4.IDENTITY.m),r=1/Math.tan(.5*m);return h[0]=r/t,h[1]=h[2]=h[3]=0,h[5]=r,h[4]=h[6]=h[7]=0,h[8]=h[9]=0,h[10]=-s/(i-s),h[11]=1,h[12]=h[13]=h[15]=0,h[14]=i*s/(i-s),new Matrix4(h)},Matrix4.lookAt=function(m,t,i){var s,h,r,a,e,n,o;return s=new Float32Array(16),h=t.subtract(m).normalize(),r=Vec3.cross(i,h).normalize(),a=Vec3.cross(h,r).normalize(),e=-Vec3.dot(r,m),n=-Vec3.dot(a,m),o=-Vec3.dot(h,m),s[0]=r.x,s[1]=a.x,s[2]=h.x,s[3]=0,s[4]=r.y,s[5]=a.y,s[6]=h.y,s[7]=0,s[8]=r.z,s[9]=a.z,s[10]=h.z,s[11]=0,s[12]=e,s[13]=n,s[14]=o,s[15]=1,new Matrix4(s)},Matrix4.prototype.invert=function(){var m,t,i,s,h,r,a,e,n,o,c,x,u,M,l,y,w,p,v,A,f,z,F,V,d,I,T,b,D,E,N,Y,j,k,q,g,B,C,G,H;return m=this.m[0],t=this.m[1],i=this.m[2],s=this.m[3],h=this.m[4],r=this.m[5],a=this.m[6],e=this.m[7],n=this.m[8],o=this.m[9],c=this.m[10],x=this.m[11],u=this.m[12],M=this.m[13],l=this.m[14],y=this.m[15],w=c*y-x*l,p=o*y-x*M,v=o*l-c*M,A=n*y-x*u,f=n*l-c*u,z=n*M-o*u,F=r*w-a*p+e*v,V=-(h*w-a*A+e*f),d=h*p-r*A+e*z,I=-(h*v-r*f+a*z),T=1/(m*F+t*V+i*d+s*I),b=a*y-e*l,D=r*y-e*M,E=r*l-a*M,N=h*y-e*u,Y=h*l-a*u,j=h*M-r*u,k=a*x-e*c,q=r*x-e*o,g=r*c-a*o,B=h*x-e*n,C=h*c-a*n,G=h*o-r*n,H=new Float32Array(16),H[0]=F*T,H[4]=V*T,H[8]=d*T,H[12]=I*T,H[1]=-(t*w-i*p+s*v)*T,H[5]=(m*w-i*A+s*f)*T,H[9]=-(m*p-t*A+s*z)*T,H[13]=(m*v-t*f+i*z)*T,H[2]=(t*b-i*D+s*E)*T,H[6]=-(m*b-i*N+s*Y)*T,H[10]=(m*D-t*N+s*j)*T,H[14]=-(m*E-t*Y+i*j)*T,H[3]=-(t*k-i*q+s*g)*T,H[7]=(m*k-i*B+s*C)*T,H[11]=-(m*q-t*B+s*G)*T,H[15]=(m*g-t*C+i*G)*T,new Matrix4(H)},Matrix4.prototype.multiply=function(m){var t=new Float32Array(16);return t[0]=this.m[0]*m.m[0]+this.m[1]*m.m[4]+this.m[2]*m.m[8]+this.m[3]*m.m[12],t[1]=this.m[0]*m.m[1]+this.m[1]*m.m[5]+this.m[2]*m.m[9]+this.m[3]*m.m[13],t[2]=this.m[0]*m.m[2]+this.m[1]*m.m[6]+this.m[2]*m.m[10]+this.m[3]*m.m[14],t[3]=this.m[0]*m.m[3]+this.m[1]*m.m[7]+this.m[2]*m.m[11]+this.m[3]*m.m[15],t[4]=this.m[4]*m.m[0]+this.m[5]*m.m[4]+this.m[6]*m.m[8]+this.m[7]*m.m[12],t[5]=this.m[4]*m.m[1]+this.m[5]*m.m[5]+this.m[6]*m.m[9]+this.m[7]*m.m[13],t[6]=this.m[4]*m.m[2]+this.m[5]*m.m[6]+this.m[6]*m.m[10]+this.m[7]*m.m[14],t[7]=this.m[4]*m.m[3]+this.m[5]*m.m[7]+this.m[6]*m.m[11]+this.m[7]*m.m[15],t[8]=this.m[8]*m.m[0]+this.m[9]*m.m[4]+this.m[10]*m.m[8]+this.m[11]*m.m[12],t[9]=this.m[8]*m.m[1]+this.m[9]*m.m[5]+this.m[10]*m.m[9]+this.m[11]*m.m[13],t[10]=this.m[8]*m.m[2]+this.m[9]*m.m[6]+this.m[10]*m.m[10]+this.m[11]*m.m[14],t[11]=this.m[8]*m.m[3]+this.m[9]*m.m[7]+this.m[10]*m.m[11]+this.m[11]*m.m[15],t[12]=this.m[12]*m.m[0]+this.m[13]*m.m[4]+this.m[14]*m.m[8]+this.m[15]*m.m[12],t[13]=this.m[12]*m.m[1]+this.m[13]*m.m[5]+this.m[14]*m.m[9]+this.m[15]*m.m[13],t[14]=this.m[12]*m.m[2]+this.m[13]*m.m[6]+this.m[14]*m.m[10]+this.m[15]*m.m[14],t[15]=this.m[12]*m.m[3]+this.m[13]*m.m[7]+this.m[14]*m.m[11]+this.m[15]*m.m[15],new Matrix4(t)},Matrix4.prototype.translate=function(m,t,i){var s=new Float32Array(this.m);return s[12]+=m,s[13]+=t,s[14]+=i,new Matrix4(s)},module.exports=Matrix4;
 
-
-},{"../objects/vec3":37}],31:[function(require,module,exports){
+},{"../objects/vec3":36}],30:[function(require,module,exports){
 "use strict";function _cloneCommand(t){var o={type:t.type};return o.type!==CLOSE&&(o.x=t.x,o.y=t.y),o.type===QUADTO?(o.x1=t.x1,o.y1=t.y1):o.type===CURVETO&&(o.x1=t.x1,o.y1=t.y1,o.x2=t.x2,o.y2=t.y2),o}var _=require("lodash"),bezier=require("../util/bezier"),geo=require("../util/geo"),math=require("../util/math"),Color=require("../objects/color"),Rect=require("../objects/rect"),MOVETO=bezier.MOVETO,LINETO=bezier.LINETO,QUADTO=bezier.QUADTO,CURVETO=bezier.CURVETO,CLOSE=bezier.CLOSE,CLOSE_COMMAND=Object.freeze({type:CLOSE}),KAPPA=.5522847498307936,Path=function(t,o,e,i){this.commands=void 0!==t?t:[],this.fill=void 0!==o?o:"black",this.stroke=void 0!==e?e:null,this.strokeWidth=void 0!==i?i:1};Path.prototype.clone=function(){var t,o=new Path,e=this.commands.length;for(o.commands.length=this.commands.length,t=0;t<e;t+=1)o.commands[t]=_cloneCommand(this.commands[t]);return o.fill=Color.clone(this.fill),o.stroke=Color.clone(this.stroke),o.strokeWidth=this.strokeWidth,o},Path.prototype.extend=function(t){var o=t.commands||t;Array.prototype.push.apply(this.commands,o)},Path.prototype.moveTo=function(t,o){this.commands.push({type:MOVETO,x:t,y:o})},Path.prototype.lineTo=function(t,o){this.commands.push({type:LINETO,x:t,y:o})},Path.prototype.curveTo=function(t,o,e,i,s,r){this.commands.push({type:CURVETO,x1:t,y1:o,x2:e,y2:i,x:s,y:r})},Path.prototype.quadTo=function(t,o,e,i){var s=this.commands[this.commands.length-1].x,r=this.commands[this.commands.length-1].y,n=s+2/3*(t-s),h=r+2/3*(o-r),a=n+1/3*(e-s),l=h+1/3*(i-r);this.curveTo(n,h,a,l,e,i)},Path.prototype.closePath=Path.prototype.close=function(){this.commands.push(CLOSE_COMMAND)},Path.prototype.isClosed=function(){return 0!==this.commands.length&&this.commands[this.commands.length-1].type===CLOSE},Path.prototype.addRect=function(t,o,e,i){this.moveTo(t,o),this.lineTo(t+e,o),this.lineTo(t+e,o+i),this.lineTo(t,o+i),this.close()},Path.prototype.addRoundedRect=function(t,o,e,i,s,r){var n=1-.552,h=s,a=r,l=t,c=t+e,p=o,u=o+i;h=Math.min(h,.5*e),a=Math.min(a,.5*i),this.moveTo(l+h,p),h<.5*e&&this.lineTo(c-s,p),this.curveTo(c-h*n,p,c,p+a*n,c,p+a),a<.5*i&&this.lineTo(c,u-a),this.curveTo(c,u-a*n,c-h*n,u,c-h,u),h<.5*e&&this.lineTo(l+h,u),this.curveTo(l+h*n,u,l,u-a*n,l,u-a),a<.5*i&&this.lineTo(l,p+a),this.curveTo(l,p+a*n,l+h*n,p,l+h,p),this.close()},Path.prototype.addEllipse=function(t,o,e,i){var s=.5*KAPPA*e,r=.5*KAPPA*i,n=t+.5*e,h=o+.5*i,a=t+e,l=o+i;this.moveTo(t,h),this.curveTo(t,h-r,n-s,o,n,o),this.curveTo(n+s,o,a,h-r,a,h),this.curveTo(a,h+r,n+s,l,n,l),this.curveTo(n-s,l,t,h+r,t,h),this.close()},Path.prototype.addLine=function(t,o,e,i){this.moveTo(t,o),this.lineTo(e,i)},Path.prototype.addQuad=function(t,o,e,i,s,r,n,h){this.moveTo(t,o),this.lineTo(e,i),this.lineTo(s,r),this.lineTo(n,h),this.close()},Path.prototype.addArc=function(t,o,e,i,s,r,n){n=n||"pie";var h,a,l,c,p,u,m,d,y,f,v,T,P;for(h=e/2,a=i/2,l=math.radians(s),c=r,c>=360||c<=-360?(p=4,u=Math.PI/2,m=.5522847498307933,c<0&&(u=-u,m=-m)):(p=Math.ceil(Math.abs(c)/90),u=math.radians(c/p),m=4/3*Math.sin(u/2)/(1+Math.cos(u/2)),0===m&&(p=0)),"open"===n?d=0:"chord"===n?d=1:"pie"===n&&(d=2),(h<0||a<0)&&(p=d=-1),y=0;y<=p+d;)f=l,0===y?this.moveTo(t+Math.cos(f)*h,o+Math.sin(f)*a):y>p?y===p+d?this.close():this.lineTo(t,o):(f+=u*(y-1),v=Math.cos(f),T=Math.sin(f),P=[],P.push(t+(v-m*T)*h),P.push(o+(T+m*v)*a),f+=u,v=Math.cos(f),T=Math.sin(f),P.push(t+(v+m*T)*h),P.push(o+(T-m*v)*a),P.push(t+v*h),P.push(o+T*a),Path.prototype.curveTo.apply(this,P)),y+=1},Path.prototype.colorize=function(t){var o=arguments;("object"!=typeof t||t instanceof Color)&&(t={},void 0!==o[0]&&(t.fill=o[0]),void 0!==o[1]&&(t.stroke=o[1]),void 0!==o[2]&&(t.strokeWidth=o[2]));var e=this.clone();return t.fill&&(e.fill=Color.clone(t.fill)),t.stroke&&(e.stroke=Color.clone(t.stroke)),(t.strokeWidth||0===t.strokeWidth)&&(e.strokeWidth=t.strokeWidth),e},Path.prototype.desaturate=function(t){var o=this.clone(),e=o.fill,i=o.stroke;return e instanceof Color||(e=Color.parse(e)),i instanceof Color||(i=Color.parse(i)),o.fill=e.desaturate(t),o.stroke=i.desaturate(t),o},Path.prototype.invert=function(){var t=this.clone(),o=t.fill,e=t.stroke;return o instanceof Color||(o=Color.parse(o)),e instanceof Color||(e=Color.parse(e)),t.fill=o.invert(),t.stroke=e.invert(),t},Path.prototype.contours=function(){var t=[],o=[];return _.each(this.commands,function(e){e.type===MOVETO?(0!==o.length&&t.push(o),o=[e]):o.push(e)}),0!==o.length&&t.push(o),t},Path.prototype.bounds=function(){if(this._bounds)return this._bounds;if(0===this.commands.length)return new Rect(0,0,0,0);var t,o,e,i,s,r=Number.MAX_VALUE,n=Number.MAX_VALUE,h=-Number.MAX_VALUE,a=-Number.MAX_VALUE;return _.each(this.commands,function(l){if(l.type===MOVETO||l.type===LINETO)t=l.x,o=l.y,t<r&&(r=t),o<n&&(n=o),t>h&&(h=t),o>a&&(a=o),e=l;else if(l.type===CURVETO){var c=bezier.extrema(e.x,e.y,l.x1,l.y1,l.x2,l.y2,l.x,l.y);i=c.x+c.width,s=c.y+c.height,c.x<r&&(r=c.x),i>h&&(h=i),c.y<n&&(n=c.y),s>a&&(a=s),e=l}}),new Rect(r,n,h-r,a-n)},Path.prototype.point=function(t,o){return void 0===o&&(o=bezier.segmentLengths(this.commands,!0,10)),bezier.point(this,t,o)},Path.prototype.points=function(t,o){var e=o&&void 0!==o.start?o.start:0,i=o&&void 0!==o.end?o.end:1;if(0===this.commands.length)return[];t=Math.round(t);var s;s=o&&o.closed?t>1?(i-e)/t:i-e:t>1?(i-e)/(t-1):i-e;for(var r=[],n=bezier.segmentLengths(this.commands,!0,10),h=0;h<t;h+=1)r.push(this.point(e+s*h,n));return r},Path.prototype.length=function(t){return void 0===t&&(t=20),bezier.length(this,t)},Path.prototype.contains=function(t,o,e){var i=this.points(void 0!==e?e:100);return geo.pointInPolygon(i,t,o)},Path.prototype.resampleByAmount=function(t,o){for(var e=o?this.contours():[this.commands],i=new Path([],this.fill,this.stroke,this.strokeWidth),s=0;s<e.length;s+=1){var r=new Path(e[s]),n={};r.isClosed()&&(n.closed=!0);for(var h=r.points(t,n),a=0;a<h.length;a+=1)0===a?i.moveTo(h[a].x,h[a].y):i.lineTo(h[a].x,h[a].y);r.isClosed()&&i.close()}return i},Path.prototype.resampleByLength=function(t,o){o=o||{};var e=o.force||!1,i=this.contours(),s=[];e||(t=Math.max(t,1));for(var r=0;r<i.length;r+=1){var n=new Path(i[r]),h=n.length(),a=Math.ceil(h/t);s=s.concat(n.resampleByAmount(a).commands)}return new Path(s,this.fill,this.stroke,this.strokeWidth)},Path.prototype.toPathData=function(){var t,o,e,i,s,r,n,h,a;for(o="",t=0;t<this.commands.length;t+=1)e=this.commands[t],void 0!==e.x&&(i=math.clamp(e.x,-9999,9999),s=math.clamp(e.y,-9999,9999)),void 0!==e.x1&&(r=math.clamp(e.x1,-9999,9999),n=math.clamp(e.y1,-9999,9999)),void 0!==e.x2&&(h=math.clamp(e.x2,-9999,9999),a=math.clamp(e.y2,-9999,9999)),e.type===MOVETO?isNaN(i)||isNaN(s)||(o+="M"+i+" "+s):e.type===LINETO?isNaN(i)||isNaN(s)||(o+="L"+i+" "+s):e.type===QUADTO?isNaN(i)||isNaN(s)||isNaN(r)||isNaN(n)||(o+="Q"+r+" "+n+" "+i+" "+s):e.type===CURVETO?isNaN(i)||isNaN(s)||isNaN(r)||isNaN(n)||isNaN(h)||isNaN(a)||(o+="C"+r+" "+n+" "+h+" "+a+" "+i+" "+s):e.type===CLOSE&&(o+="Z");return o},Path.prototype.toSVG=function(){var t='<path d="';t+=this.toPathData(),t+='"';var o,e,i="";this.fill&&(o=Color.parse(this.fill),o.a<1&&(e=o.a),o=Color.toHex(o).substring(0,7)),"black"!==o&&"#000000"!==o&&(i+=null===o||void 0===o?"fill:none;":"fill:"+o+";"),void 0!==e&&(i+="fill-opacity:"+e+";");var s,r;return this.stroke&&(s=Color.parse(this.stroke),s.a<1&&(r=s.a),s=Color.toHex(s).substring(0,7)),s&&(i+="stroke:"+s+";",i+="stroke-width:"+this.strokeWidth+";"),void 0!==r&&(i+="stroke-opacity:"+r+";"),i&&(t+=' style="'+i+'"'),t+="/>"},Path.prototype.draw=function(t){var o,e,i;for(t.beginPath(),o=this.commands.length,e=0;e<o;e+=1)i=this.commands[e],i.type===MOVETO?t.moveTo(i.x,i.y):i.type===LINETO?t.lineTo(i.x,i.y):i.type===QUADTO?t.quadraticCurveTo(i.x1,i.y1,i.x,i.y):i.type===CURVETO?t.bezierCurveTo(i.x1,i.y1,i.x2,i.y2,i.x,i.y):i.type===CLOSE&&t.closePath();null!==this.fill&&void 0!==this.fill&&(t.fillStyle=Color.toCSS(this.fill),t.fill()),null!==this.stroke&&void 0!==this.stroke&&null!==this.strokeWidth&&this.strokeWidth>0&&(t.strokeStyle=Color.toCSS(this.stroke),t.lineWidth=this.strokeWidth,t.stroke())},Path.combine=function(){for(var t=_.flatten(arguments),o=[],e=0;e<t.length;e+=1){var i=t[e];i.commands?o=o.concat(i.commands):i.shapes&&(o=o.concat(Path.combine(i.shapes).commands))}return new Path(o)},module.exports=Path;
 
-
-},{"../objects/color":28,"../objects/rect":33,"../util/bezier":38,"../util/geo":40,"../util/math":42,"lodash":3}],32:[function(require,module,exports){
+},{"../objects/color":27,"../objects/rect":32,"../util/bezier":37,"../util/geo":39,"../util/math":41,"lodash":2}],31:[function(require,module,exports){
 "use strict";var Point=function(t,n){this.x=void 0!==t?t:0,this.y=void 0!==n?n:0};Object.defineProperty(Point.prototype,"xy",{get:function(){return[this.x,this.y]}}),Point.ZERO=new Point(0,0),Point.read=function(t,n){if(2===arguments.length)return new Point(t,n);var i=t;return i instanceof Point?i:"number"==typeof i?new Point(i,i):Array.isArray(i)?0===i.length?Point.ZERO:(t=i[0],n=i.length>1?i[1]:t,new Point(t,n)):void 0!==i.x&&void 0!==i.y?new Point(i.x,i.y):Point.ZERO},Point.prototype.clone=function(){return new Point(this.x,this.y)},Point.prototype.add=function(t){return new Point(this.x+t.x,this.y+t.y)},Point.prototype.subtract=Point.prototype.sub=function(t){return new Point(this.x-t.x,this.y-t.y)},Point.prototype.divide=function(t){return new Point(this.x/t,this.y/t)},Point.prototype.multiply=function(t){return new Point(this.x*t,this.y*t)},Point.prototype.magnitude=function(){return Math.sqrt(this.x*this.x+this.y*this.y)},Point.prototype.magnitudeSquared=function(){return this.x*this.x+this.y*this.y},Point.prototype.heading=function(){return Math.atan2(this.y,this.x)},Point.prototype.distanceTo=function(t){var n=this.x-t.x,i=this.y-t.y;return Math.sqrt(n*n+i*i)},Point.prototype.normalize=function(){var t=this.magnitude();return 0!==t?this.divide(t):Point.ZERO},Point.prototype.limit=function(t){return this.magnitudeSquared()>t*t?this.normalize().multiply(t):this},Point.prototype.translate=function(t,n){return new Point(this.x+t,this.y+n)},Point.prototype.scale=function(t,n){return n=void 0!==n?n:t,new Point(this.x*t,this.y*n)},Point.prototype.toString=function(){return"["+this.x+", "+this.y+"]"},module.exports=Point;
 
-
-},{}],33:[function(require,module,exports){
+},{}],32:[function(require,module,exports){
 "use strict";var Point=require("../objects/point"),Rect=function(t,i,h,e){this.x=void 0!==t?t:0,this.y=void 0!==i?i:0,this.width=void 0!==h?h:0,this.height=void 0!==e?e:0};Object.defineProperty(Rect.prototype,"xywh",{get:function(){return[this.x,this.y,this.width,this.height]}}),Rect.prototype.normalize=function(){var t=this.x,i=this.y,h=this.width,e=this.height;return h<0&&(t+=h,h=-h),e<0&&(i+=e,e=-e),new Rect(t,i,h,e)},Rect.prototype.containsPoint=function(t,i){return 1===arguments.length&&(i=t.y,t=t.x),t>=this.x&&t<=this.x+this.width&&i>=this.y&&i<=this.y+this.height},Rect.prototype.containsRect=function(t){return t.x>=this.x&&t.x+t.width<=this.x+this.width&&t.y>=this.y&&t.y+t.height<=this.y+this.height},Rect.prototype.grow=function(t,i){var h=this.x-t,e=this.y-i,s=this.width+2*t,n=this.height+2*i;return new Rect(h,e,s,n)},Rect.prototype.unite=function(t){var i=Math.min(this.x,t.x),h=Math.min(this.y,t.y),e=Math.max(this.x+this.width,t.x+t.width)-i,s=Math.max(this.y+this.height,t.y+t.height)-h;return new Rect(i,h,e,s)},Rect.prototype.addPoint=function(t,i){var h,e,s=this.x,n=this.y,o=this.width,r=this.height;return t<this.x?(h=this.x-t,s=t,o+=h):t>this.x+this.width&&(h=t-(this.x+this.width),o+=h),i<this.y?(e=this.y-i,n=i,r+=e):i>this.y+this.height&&(e=i-(this.y+this.height),r+=e),new Rect(s,n,o,r)},Rect.prototype.centerPoint=function(){return new Point(this.x+this.width/2,this.y+this.height/2)},module.exports=Rect;
 
-
-},{"../objects/point":32}],34:[function(require,module,exports){
+},{"../objects/point":31}],33:[function(require,module,exports){
 "use strict";var Color=require("../objects/color"),Rect=require("../objects/rect"),Transform=require("../objects/transform"),_dummyContext=null,GText=function(t){var e,i=Array.prototype.slice.call(arguments,1),n=arguments[1],o=arguments[2],s=arguments[arguments.length-1];this.text=String(t),"number"==typeof n?(this.x=n,this.y=o,i=i.slice(2)):Array.isArray(n)?(this.x=n[0],this.y=n[1],i=i.slice(1)):"object"==typeof n?(this.x=void 0!==n.x?n.x:0,this.y=void 0!==n.y?n.y:0,i=i.slice(1)):(this.x=0,this.y=0),"object"==typeof s?(e=s,n!==s&&(i=i.slice(0,i.length-1))):e={},i.length?this.fontFamily=i.shift():this.fontFamily=e.fontFamily||e.fontName||e.font||"sans-serif",i.length?this.fontSize=i.shift():this.fontSize=e.fontSize||24,i.length?this.textAlign=i.shift():this.textAlign=e.align||e.textAlign||"left",i.length?this.fill=i.shift():this.fill=e.fill||"black",this.transform=new Transform};GText.prototype.clone=function(){var t=new GText;return t.text=this.text,t.x=this.x,t.y=this.y,t.fontFamily=this.fontFamily,t.fontSize=this.fontSize,t.textAlign=this.textAlign,t.fill=Color.clone(this.fill),t.transform=this.transform,t},GText._getDummyContext=function(){return _dummyContext||(_dummyContext="undefined"!=typeof document?document.createElement("canvas").getContext("2d"):{font:"10px sans-serif",measureText:function(t){var e=parseFloat(this.font);return{width:t.length*e*.6}}}),_dummyContext},GText.prototype._getFont=function(){return this.fontSize+"px "+this.fontFamily},GText.prototype.colorize=function(t){var e=this.clone();return e.fill=Color.clone(t),e},GText.prototype.draw=function(t){t.save(),t.font=this._getFont(),t.textAlign=this.textAlign;var e=this.transform.m;t.transform(e[0],e[1],e[3],e[4],e[6],e[7]),t.fillStyle=Color.toCSS(this.fill),t.fillText(this.text,this.x,this.y),t.restore()},GText.prototype.bounds=function(){var t,e=GText._getDummyContext(),i=this.x;return e.font=this._getFont(),t=e.measureText(this.text),"center"===this.textAlign?i=this.x-t.width/2:"right"===this.textAlign&&(i=this.x-t.width),new Rect(i,this.y-this.fontSize,t.width,1.2*this.fontSize)},GText.prototype.toSVG=function(){var t="<text";t+=' x="'+this.x+'"',t+=' y="'+this.y+'"',t+=' font-family="'+this.fontFamily+'"',t+=' font-size="'+this.fontSize+'"';var e;return"left"===this.textAlign?e="start":"center"===this.textAlign?e="middle":"right"===this.textAlign&&(e="end"),t+=' text-anchor="'+e+'"',"black"!==this.fill&&(t+=' fill="'+Color.toCSS(this.fill)+'"'),t+=">",t+=this.text,t+="</text>"},module.exports=GText;
 
-
-},{"../objects/color":28,"../objects/rect":33,"../objects/transform":35}],35:[function(require,module,exports){
+},{"../objects/color":27,"../objects/rect":32,"../objects/transform":34}],34:[function(require,module,exports){
 "use strict";var _=require("lodash"),bezier=require("../util/bezier"),math=require("../util/math"),Group=require("../objects/group"),Path=require("../objects/path"),Point=require("../objects/point"),MOVETO=bezier.MOVETO,LINETO=bezier.LINETO,QUADTO=bezier.QUADTO,CURVETO=bezier.CURVETO,CLOSE=bezier.CLOSE,Transform=function(r){void 0!==r?this.m=r:this.m=[1,0,0,0,1,0,0,0,1]};Transform.IDENTITY=new Transform,Transform.identity=function(){return new Transform},Transform._mmult=function(r,t){return void 0!==r.m&&(r=r.m),void 0!==t.m&&(t=t.m),new Transform([r[0]*t[0]+r[1]*t[3],r[0]*t[1]+r[1]*t[4],0,r[3]*t[0]+r[4]*t[3],r[3]*t[1]+r[4]*t[4],0,r[6]*t[0]+r[7]*t[3]+t[6],r[6]*t[1]+r[7]*t[4]+t[7],1])},Transform.prototype.isIdentity=function(){var r=this.m;return 1===r[0]&&0===r[1]&&0===r[2]&&0===r[3]&&1===r[4]&&0===r[5]&&0===r[6]&&0===r[7]&&1===r[8]},Transform.prototype.prepend=function(r){return Transform._mmult(this.m,r.m)},Transform.prototype.append=function(r){return Transform._mmult(r.m,this.m)},Transform.prototype.inverse=function(){var r=this.m,t=r[0]*r[4]-r[1]*r[3];return new Transform([r[4]/t,-r[1]/t,0,-r[3]/t,r[0]/t,0,(r[3]*r[7]-r[4]*r[6])/t,-(r[0]*r[7]-r[1]*r[6])/t,1])},Transform.prototype.scale=function(r,t){return void 0===t&&(t=r),Transform._mmult([r,0,0,0,t,0,0,0,1],this.m)},Transform.prototype.translate=function(r,t){return Transform._mmult([1,0,0,0,1,0,r,t,1],this.m)},Transform.prototype.rotate=function(r){var t=Math.cos(math.radians(r)),n=Math.sin(math.radians(r));return Transform._mmult([t,n,0,-n,t,0,0,0,1],this.m)},Transform.prototype.skew=function(r,t){var n=Math.PI*r/180,o=Math.PI*t/180;return Transform._mmult([1,Math.tan(o),0,-Math.tan(n),1,0,0,0,1],this.m)},Transform.prototype.transformPoint=function(r){var t=r.x,n=r.y,o=this.m;return new Point(t*o[0]+n*o[3]+o[6],t*o[1]+n*o[4]+o[7])},Transform.prototype.transformPoints=function(r){var t=this;return _.map(r,function(r){return t.transformPoint(r)})},Transform.prototype.transformPath=function(r){var t=this.m,n=[];n.length=r.commands.length;for(var o=0,e=r.commands.length;o<e;o++){var a=r.commands[o];switch(a.type){case MOVETO:case LINETO:n[o]={type:a.type,x:a.x*t[0]+a.y*t[3]+t[6],y:a.x*t[1]+a.y*t[4]+t[7]};break;case QUADTO:n[o]={type:QUADTO,x:a.x*t[0]+a.y*t[3]+t[6],y:a.x*t[1]+a.y*t[4]+t[7],x1:a.x1*t[0]+a.y1*t[3]+t[6],y1:a.x1*t[1]+a.y1*t[4]+t[7]};break;case CURVETO:n[o]={type:CURVETO,x:a.x*t[0]+a.y*t[3]+t[6],y:a.x*t[1]+a.y*t[4]+t[7],x1:a.x1*t[0]+a.y1*t[3]+t[6],y1:a.x1*t[1]+a.y1*t[4]+t[7],x2:a.x2*t[0]+a.y2*t[3]+t[6],y2:a.x2*t[1]+a.y2*t[4]+t[7]};break;case CLOSE:n[o]={type:CLOSE};break;default:throw new Error("Unknown command type "+a)}}return new Path(n,r.fill,r.stroke,r.strokeWidth)},Transform.prototype.transformText=function(r){var t=r.clone();return t.transform=this.append(t.transform),t},Transform.prototype.transformGroup=function(r){var t=this,n=_.map(r.shapes,function(r){return t.transformShape(r)});return new Group(n)},Transform.prototype.transformShape=function(r){var t;if(r.shapes)t=this.transformGroup;else if(r.commands)t=this.transformPath;else if(r.text)t=this.transformText;else if(void 0!==r.x&&void 0!==r.y)t=this.transformPoint;else{if(void 0!==r._transform)return r._transform(this.m);if(!(Array.isArray(r)&&r.length>0))throw new Error("Don't know how to transform "+r);if(void 0===r[0].x||void 0===r[0].y){for(var n=[],o=0;o<r.length;o+=1)n.push(this.transformShape(r[o]));return n}t=this.transformPoints}return t.call(this,r)},module.exports=Transform;
 
-
-},{"../objects/group":29,"../objects/path":31,"../objects/point":32,"../util/bezier":38,"../util/math":42,"lodash":3}],36:[function(require,module,exports){
+},{"../objects/group":28,"../objects/path":30,"../objects/point":31,"../util/bezier":37,"../util/math":41,"lodash":2}],35:[function(require,module,exports){
 "use strict";var Point=require("../objects/point"),Transform=require("../objects/transform"),Transformable={translate:function(r){r||(r=Point.ZERO);var t=(new Transform).translate(r.x,r.y);return t.transformShape(this)},scale:function(r,t){t||(t=Point.ZERO);var a,n;"number"==typeof r?(a=r,n=r):(a=r.x,n=r.y);var e=new Transform;return e=e.translate(t.x,t.y),e=e.scale(a,n),e=e.translate(-t.x,-t.y),e.transformShape(this)},rotate:function(r,t){t||(t=Point.ZERO);var a=new Transform;return a=a.translate(t.x,t.y),a=a.rotate(r),a=a.translate(-t.x,-t.y),a.transformShape(this)},skew:function(r,t){t||(t=Point.ZERO);var a=new Transform;return a=a.translate(t.x,t.y),a=a.skew(r.x,r.y),a=a.translate(-t.x,-t.y),a.transformShape(this)}};module.exports=Transformable;
 
-
-},{"../objects/point":32,"../objects/transform":35}],37:[function(require,module,exports){
+},{"../objects/point":31,"../objects/transform":34}],36:[function(require,module,exports){
 "use strict";var Vec3=function(t,i,e){this.x=void 0===t?0:t,this.y=void 0===i?0:i,this.z=void 0===e?0:e};Vec3.ZERO=new Vec3(0,0,0),Vec3.up=function(){return new Vec3(0,1,0)},Vec3.dot=function(t,i){return t.x*i.x+t.y*i.y+t.z*i.z},Vec3.cross=function(t,i){return new Vec3(t.y*i.z-t.z*i.y,t.z*i.x-t.x*i.z,t.x*i.y-t.y*i.x)},Vec3.prototype.toString=function(){return"["+this.x+", "+this.y+", "+this.z+"]"},Vec3.prototype.toArray=function(){var t=[];return t.push(this.x),t.push(this.y),t.push(this.z),t},Vec3.prototype.getLength=function(){return Math.sqrt(this.x*this.x+this.y*this.y+this.z*this.z)},Vec3.prototype.normalize=function(){var t,i;return t=this.getLength(),0===t?this:(i=1/t,new Vec3(this.x*i,this.y*i,this.z*i))},Vec3.prototype.add=function(t){return new Vec3(this.x+t.x,this.y+t.y,this.z+t.z)},Vec3.prototype.subtract=function(t){return new Vec3(this.x-t.x,this.y-t.y,this.z-t.z)},Vec3.prototype.transform=function(t){var i,e,s,h,n;return n=t,i=this.x*n.m[0]+this.y*n.m[4]+this.z*n.m[8]+n.m[12],e=this.x*n.m[1]+this.y*n.m[5]+this.z*n.m[9]+n.m[13],s=this.x*n.m[2]+this.y*n.m[6]+this.z*n.m[10]+n.m[14],h=this.x*n.m[3]+this.y*n.m[7]+this.z*n.m[11]+n.m[15],new Vec3(i/h,e/h,s/h)},module.exports=Vec3;
 
-
-},{}],38:[function(require,module,exports){
+},{}],37:[function(require,module,exports){
 "use strict";var _=require("lodash"),math=require("../util/math"),Point=require("../objects/point"),Rect=require("../objects/rect"),bezier={},MOVETO=bezier.MOVETO="M",LINETO=bezier.LINETO="L";bezier.QUADTO="Q";var CURVETO=bezier.CURVETO="C",CLOSE=bezier.CLOSE="Z";bezier.linePoint=function(e,t,r,n,i){var a=t+e*(n-t),o=r+e*(i-r);return{type:LINETO,x:a,y:o}},bezier.lineLength=function(e,t,r,n){var i=Math.pow(Math.abs(e-r),2),a=Math.pow(Math.abs(t-n),2);return Math.sqrt(i+a)},bezier.curvePoint=function(e,t,r,n,i,a,o,u,h){var s=1-e,b=t*s+n*e,c=r*s+i*e,y=n*s+a*e,m=i*s+o*e,x=a*s+u*e,z=o*s+h*e,O=b*s+y*e,v=c*s+m*e,p=y*s+x*e,M=m*s+z*e,E=O*s+p*e,L=v*s+M*e;return{type:CURVETO,x1:O,y1:v,x2:p,y2:M,x:E,y:L}},bezier.curveLength=function(e,t,r,n,i,a,o,u,h){void 0===h&&(h=20);var s,b,c,y=0,m=e,x=t;for(s=0;s<h;s+=1)b=(s+1)/h,c=bezier.curvePoint(b,e,t,r,n,i,a,o,u),y+=Math.sqrt(Math.pow(Math.abs(m-c.x),2)+Math.pow(Math.abs(x-c.y),2)),m=c.x,x=c.y;return y},bezier.segmentLengths=function(e,t,r){t=void 0!==t&&t,void 0===r&&(r=20);var n,i,a,o,u,h,s,b,c;for(c=[],n=0;n<e.length;n+=1)i=e[n],a=i.type,0===n?(o=i.x,u=i.y):a===MOVETO?(o=i.x,u=i.y,c.push(0)):a===CLOSE?c.push(bezier.lineLength(h,s,o,u)):a===LINETO?c.push(bezier.lineLength(h,s,i.x,i.y)):a===CURVETO&&c.push(bezier.curveLength(h,s,i.x1,i.y1,i.x2,i.y2,i.x,i.y,r)),a!==CLOSE&&(h=i.x,s=i.y);return t===!0?(b=math.sum(c),b>0?_.map(c,function(e){return e/b}):_.map(c,function(){return 0})):c},bezier.length=function(e,t){return t=t||20,math.sum(bezier.segmentLengths(e.commands,!1,t))},bezier._locate=function(e,t,r){var n,i,a;for(void 0===r&&(r=bezier.segmentLengths(e.commands,!0)),n=0;n<e.commands.length&&(i=e.commands[n],0!==n&&i.type!==MOVETO||(a=new Point(i.x,i.y)),!(t<=r[n]||n===r.length-1));n+=1)t-=r[n];return 0!==r[n]&&(t/=r[n]),n===r.length-1&&0===r[n]&&(n-=1),[n,t,a]},bezier.point=function(e,t,r){var n,i,a,o,u,h;return n=bezier._locate(e,t,r),i=n[0],t=n[1],a=n[2],o=e.commands[i].x,u=e.commands[i].y,h=e.commands[i+1],h.type===LINETO||h.type===CLOSE?h=h.type===CLOSE?bezier.linePoint(t,o,u,a.x,a.y):bezier.linePoint(t,o,u,h.x,h.y):h.type===CURVETO&&(h=bezier.curvePoint(t,o,u,h.x1,h.y1,h.x2,h.y2,h.x,h.y)),h},bezier.extrema=function(e,t,r,n,i,a,o,u){function h(e,t){return Math.abs(e-t)<=1e-12*Math.min(Math.abs(e),Math.abs(t))}function s(e){var t,r,n,i,a;return t=1-e,n=t*t,i=e*e,a=i*e,r=n*t,n*=3*e,i*=3*t,[r,n,i,a]}function b(h){var b,c,y,m,x;return x=s(h),b=x[0],c=x[1],y=x[2],m=x[3],{x:b*e+c*r+y*i+m*o,y:b*t+c*n+y*a+m*u}}function c(e){if(e>=0&&e<=1){var t=b(e);t.x<y?y=t.x:t.x>m&&(m=t.x),t.y<x?x=t.y:t.y>z&&(z=t.y)}}var y,m,x,z,O,v,p,M,E,L,f,g,l,T;return e<o?(y=e,m=o):(y=o,m=e),t<u?(x=t,z=u):(x=u,z=t),O=3*(-e+3*r-3*i+o),v=6*(e-2*r+i),p=3*(-e+r),h(O+1,1)?h(v+1,1)||c(-p/v):(l=v*v-4*O*p,l>=0&&(f=Math.sqrt(l),g=1/(2*O),c((-v+f)*g),c((-v-f)*g))),M=3*(-t+3*n-3*a+u),E=6*(t-2*n+a),L=3*(-t+n),h(M+1,1)?h(E+1,1)||c(-L/E):(T=E*E-4*M*L,T>0&&(f=Math.sqrt(T),g=1/(2*M),c((-E+f)*g),c((-E-f)*g))),new Rect(y,x,m-y,z-x)},module.exports=bezier;
 
-
-},{"../objects/point":32,"../objects/rect":33,"../util/math":42,"lodash":3}],39:[function(require,module,exports){
+},{"../objects/point":31,"../objects/rect":32,"../util/math":41,"lodash":2}],38:[function(require,module,exports){
 "use strict";function toHex(e){var r;return 0===e?"00":(r=e.toString(16).toUpperCase(),r.length<2&&(r="0"+r),r)}var color={};color.namedColors={lightpink:[1,.71,.76],pink:[1,.75,.8],crimson:[.86,.08,.24],lavenderblush:[1,.94,.96],palevioletred:[.86,.44,.58],hotpink:[1,.41,.71],deeppink:[1,.08,.58],mediumvioletred:[.78,.08,.52],orchid:[.85,.44,.84],thistle:[.85,.75,.85],plum:[.87,.63,.87],violet:[.93,.51,.93],fuchsia:[1,0,1],darkmagenta:[.55,0,.55],purple:[.5,0,.5],mediumorchid:[.73,.33,.83],darkviolet:[.58,0,.83],darkorchid:[.6,.2,.8],indigo:[.29,0,.51],blueviolet:[.54,.17,.89],mediumpurple:[.58,.44,.86],mediumslateblue:[.48,.41,.93],slateblue:[.42,.35,.8],darkslateblue:[.28,.24,.55],ghostwhite:[.97,.97,1],lavender:[.9,.9,.98],blue:[0,0,1],mediumblue:[0,0,.8],darkblue:[0,0,.55],navy:[0,0,.5],midnightblue:[.1,.1,.44],royalblue:[.25,.41,.88],cornflowerblue:[.39,.58,.93],lightsteelblue:[.69,.77,.87],lightslategray:[.47,.53,.6],slategray:[.44,.5,.56],dodgerblue:[.12,.56,1],aliceblue:[.94,.97,1],steelblue:[.27,.51,.71],lightskyblue:[.53,.81,.98],skyblue:[.53,.81,.92],deepskyblue:[0,.75,1],lightblue:[.68,.85,.9],powderblue:[.69,.88,.9],cadetblue:[.37,.62,.63],darkturquoise:[0,.81,.82],azure:[.94,1,1],lightcyan:[.88,1,1],paleturquoise:[.69,.93,.93],aqua:[0,1,1],darkcyan:[0,.55,.55],teal:[0,.5,.5],darkslategray:[.18,.31,.31],mediumturquoise:[.28,.82,.8],lightseagreen:[.13,.7,.67],turquoise:[.25,.88,.82],aquamarine:[.5,1,.83],mediumaquamarine:[.4,.8,.67],mediumspringgreen:[0,.98,.6],mintcream:[.96,1,.98],springgreen:[0,1,.5],mediumseagreen:[.24,.7,.44],seagreen:[.18,.55,.34],honeydew:[.94,1,.94],darkseagreen:[.56,.74,.56],palegreen:[.6,.98,.6],lightgreen:[.56,.93,.56],limegreen:[.2,.8,.2],lime:[0,1,0],forestgreen:[.13,.55,.13],green:[0,.5,0],darkgreen:[0,.39,0],lawngreen:[.49,.99,0],chartreuse:[.5,1,0],greenyellow:[.68,1,.18],darkolivegreen:[.33,.42,.18],yellowgreen:[.6,.8,.2],olivedrab:[.42,.56,.14],ivory:[1,1,.94],beige:[.96,.96,.86],lightyellow:[1,1,.88],lightgoldenrodyellow:[.98,.98,.82],yellow:[1,1,0],olive:[.5,.5,0],darkkhaki:[.74,.72,.42],palegoldenrod:[.93,.91,.67],lemonchiffon:[1,.98,.8],khaki:[.94,.9,.55],gold:[1,.84,0],cornsilk:[1,.97,.86],goldenrod:[.85,.65,.13],darkgoldenrod:[.72,.53,.04],floralwhite:[1,.98,.94],oldlace:[.99,.96,.9],wheat:[.96,.87,.07],orange:[1,.65,0],moccasin:[1,.89,.71],papayawhip:[1,.94,.84],blanchedalmond:[1,.92,.8],navajowhite:[1,.87,.68],antiquewhite:[.98,.92,.84],tan:[.82,.71,.55],burlywood:[.87,.72,.53],darkorange:[1,.55,0],bisque:[1,.89,.77],linen:[.98,.94,.9],peru:[.8,.52,.25],peachpuff:[1,.85,.73],sandybrown:[.96,.64,.38],chocolate:[.82,.41,.12],saddlebrown:[.55,.27,.07],seashell:[1,.96,.93],sienna:[.63,.32,.18],lightsalmon:[1,.63,.48],coral:[1,.5,.31],orangered:[1,.27,0],darksalmon:[.91,.59,.48],tomato:[1,.39,.28],salmon:[.98,.5,.45],mistyrose:[1,.89,.88],lightcoral:[.94,.5,.5],snow:[1,.98,.98],rosybrown:[.74,.56,.56],indianred:[.8,.36,.36],red:[1,0,0],brown:[.65,.16,.16],firebrick:[.7,.13,.13],darkred:[.55,0,0],maroon:[.5,0,0],white:[1,1,1],whitesmoke:[.96,.96,.96],gainsboro:[.86,.86,.86],lightgrey:[.83,.83,.83],silver:[.75,.75,.75],darkgray:[.66,.66,.66],gray:[.5,.5,.5],grey:[.5,.5,.5],dimgray:[.41,.41,.41],dimgrey:[.41,.41,.41],black:[0,0,0],cyan:[0,.68,.94],transparent:[0,0,0,0],bark:[.25,.19,.13]},color.rgb2hex=function(e,r,a){return"#"+toHex(Math.round(255*e))+toHex(Math.round(255*r))+toHex(Math.round(255*a))},color.rgba2hex=function(e,r,a,o){return"#"+toHex(Math.round(255*e))+toHex(Math.round(255*r))+toHex(Math.round(255*a))+toHex(Math.round(255*o))},color.hex2rgb=function(e){var r,a,o;if(e=e.replace(/^#/,""),3!==e.length&&6!==e.length||!/^[0-9a-fA-F]*$/.test(e))throw new Error("Invalid hex value: #"+e);return 3===e.length&&(e=e[0]+e[0]+e[1]+e[1]+e[2]+e[2]),r=parseInt(e.substr(0,2),16)/255,a=parseInt(e.substr(2,2),16)/255,o=parseInt(e.substr(4,2),16)/255,[r,a,o]},color.rgb2hsb=function(e,r,a){var o=0,l=0,n=Math.max(e,r,a),t=n-Math.min(e,r,a);return 0!==n&&(l=t/n),0!==l&&(o=e===n?0+(r-a)/t:r===n?2+(a-e)/t:4+(e-r)/t),o*=60/360,o<0&&(o+=1),[o,l,n]},color.hsb2rgb=function(e,r,a){if(0===r)return[a,a,a];e=e%1*6;var o=Math.floor(e),l=e-o,n=a*(1-r),t=a*(1-r*l),i=a*(1-r*(1-l));return o>4?[a,n,t]:[[a,i,n],[t,a,n],[n,a,i],[n,t,a],[i,n,a]][parseInt(o,10)]},color.rgb2hsl=function(e,r,a){var o,l,n,t=Math.min(e,r,a),i=Math.max(e,r,a),u=i-t;return i===t?o=0:e===i?o=(r-a)/u:r===i?o=2+(a-e)/u:a===i&&(o=4+(e-r)/u),o=Math.min(60*o,360),o<0&&(o+=360),n=(t+i)/2,l=i===t?0:n<=.5?u/(i+t):u/(2-i-t),[o/360,l,n]},color.hsl2rgb=function(e,r,a){var o,l,n,t,i;if(0===r)return i=a,[i,i,i];l=a<.5?a*(1+r):a+r-a*r,o=2*a-l,t=[0,0,0];for(var u=0;u<3;u++)n=e+1/3*-(u-1),n<0&&(n+=1),n>1&&(n-=1),i=6*n<1?o+6*(l-o)*n:2*n<1?l:3*n<2?o+(l-o)*(2/3-n)*6:o,t[u]=i;return t},module.exports=color;
 
-
-},{}],40:[function(require,module,exports){
+},{}],39:[function(require,module,exports){
 "use strict";var math=require("../util/math"),Point=require("../objects/point"),geo={};geo.angle=function(t,n,e,o){return math.degrees(Math.atan2(o-n,e-t))},geo.distance=function(t,n,e,o){return Math.sqrt(Math.pow(e-t,2)+Math.pow(o-n,2))},geo.coordinates=function(t,n,e,o){var a=t+Math.cos(math.radians(e))*o,r=n+Math.sin(math.radians(e))*o;return new Point(a,r)},geo.pointInPolygon=function(t,n,e){var o,a,r,i,u,h,s=!1,g=t.length;for(o=0;o<g;o+=1)a=o<g-1?o+1:0,r=t[o].x,i=t[o].y,u=t[a].x,h=t[a].y,(i<e&&h>=e||h<e&&i>=e)&&r+(e-i)/(h-i)*(u-r)<n&&(s=!s);return s},module.exports=geo;
 
-
-},{"../objects/point":32,"../util/math":42}],41:[function(require,module,exports){
+},{"../objects/point":31,"../util/math":41}],40:[function(require,module,exports){
 "use strict";exports.defineAlias=function(t,e,n){Object.defineProperty(t.prototype,n,{get:function(){return this[e]},set:function(t){this[e]=t}})},exports.defineGetter=function(t,e,n){Object.defineProperty(t.prototype,e,{get:n})};
 
-
-},{}],42:[function(require,module,exports){
+},{}],41:[function(require,module,exports){
 "use strict";function _fade(r){return r*r*r*(r*(6*r-15)+10)}function _grad(r,t,n,a){var e,o,u;return e=15&r,o=e<8?t:n,u=e<4?n:12===e||14===e?t:a,(0===(1&e)?o:-o)+(0===(2&e)?u:-u)}function _scale(r){return(1+r)/2}var math={};math.sum=function(r){var t,n=r.length,a=0;for(t=0;t<n;t+=1)a+=r[t];return a},math.round=function(r,t){return t?Math.round(r*Math.pow(10,t))/Math.pow(10,t):Math.round(r)},math.sign=function(r){return r<0?-1:r>0?1:0},math.degrees=function(r){return 180*r/Math.PI},math.radians=function(r){return r/180*Math.PI},math.clamp=function(r,t,n){return t<n?r<t?t:r>n?n:r:r<n?n:r>t?t:r},math.snap=function(r,t,n){return n=void 0!==n?n:1,r*(1-n)+n*Math.round(r/t)*t},math.dot=function(r,t){var n,a=Math.min(r.length,t.length),e=0;for(n=0;n<a;n+=1)e+=r[n]*t[n];return e};var _lerp=math.mix=math.lerp=function(r,t,n,a){if(a){if(n<0)return r;if(n>1)return t}return r+(t-r)*n},_permutation=function(){var r,t,n;for(r=[151,160,137,91,90,15,131,13,201,95,96,53,194,233,7,225,140,36,103,30,69,142,8,99,37,240,21,10,23,190,6,148,247,120,234,75,0,26,197,62,94,252,219,203,117,35,11,32,57,177,33,88,237,149,56,87,174,20,125,136,171,168,68,175,74,165,71,134,139,48,27,166,77,146,158,231,83,111,229,122,60,211,133,230,220,105,92,41,55,46,245,40,244,102,143,54,65,25,63,161,1,216,80,73,209,76,132,187,208,89,18,169,200,196,135,130,116,188,159,86,164,100,109,198,173,186,3,64,52,217,226,250,124,123,5,202,38,147,118,126,255,82,85,212,207,206,59,227,47,16,58,17,182,189,28,42,223,183,170,213,119,248,152,2,44,154,163,70,221,153,101,155,167,43,172,9,129,22,39,253,19,98,108,110,79,113,224,232,178,185,112,104,218,246,97,228,251,34,242,193,238,210,144,12,191,179,162,241,81,51,145,235,249,14,239,107,49,192,214,31,181,199,106,157,184,84,204,176,115,121,50,45,127,4,150,254,138,236,205,93,222,114,67,29,24,72,243,141,128,195,78,66,215,61,156,180],t=new Uint8Array(512),n=0;n<256;n+=1)t[256+n]=t[n]=r[n];return t}();math.noise=function(r,t,n){var a=_permutation,e=255&Math.floor(r),o=255&Math.floor(t),u=255&Math.floor(n);r-=Math.floor(r),t-=Math.floor(t),n-=Math.floor(n);var f=_fade(r),h=_fade(t),i=_fade(n),_=a[e]+o,d=a[_]+u,l=a[_+1]+u,m=a[e+1]+o,c=a[m]+u,p=a[m+1]+u;return _scale(_lerp(_lerp(_lerp(_grad(a[d],r,t,n),_grad(a[c],r-1,t,n),f),_lerp(_grad(a[l],r,t-1,n),_grad(a[p],r-1,t-1,n),f),h),_lerp(_lerp(_grad(a[d+1],r,t,n-1),_grad(a[c+1],r-1,t,n-1),f),_lerp(_grad(a[l+1],r,t-1,n-1),_grad(a[p+1],r-1,t-1,n-1),f),h),i))},module.exports=math;
 
-
-},{}],43:[function(require,module,exports){
+},{}],42:[function(require,module,exports){
 "use strict";function generator(r){if(r<0){for(var e=generator(Math.abs(r)),t=0;t<23;t+=1)e();return generator(e(0,1e4))}return function(e,t){e=e||0,t=t||1,r=(9301*r+49297)%233280;var n=r/233280;return e+n*(t-e)}}exports.generator=generator;
 
-
-},{}],44:[function(require,module,exports){
+},{}],43:[function(require,module,exports){
 "use strict";var _=require("lodash"),xmldom=require("xmldom"),Color=require("../objects/color"),Group=require("../objects/group"),Path=require("../objects/path"),Point=require("../objects/point"),Transform=require("../objects/transform"),trim=function(t){return t.replace(/^\s+|\s+$/g,"")},compressSpaces=function(t){return t.replace(/[\s\r\t\n]+/gm," ")},toNumberArray=function(t){var e,r=trim(compressSpaces((t||"").replace(/,/g," "))).split(" ");for(e=0;e<r.length;e+=1)r[e]=parseFloat(r[e]);return r},readSvgAttributes=function(t,e){var r,a,o,n,i,s,c,l,u,d,p,m;if(m=e?Object.create(e):{},l=[],u={},u.translate=function(t){var e=toNumberArray(t),r=e[0],a=e[1]||0;return(new Transform).translate(r,a)},u.scale=function(t){var e=toNumberArray(t),r=e[0],a=e[1]||r;return(new Transform).scale(r,a)},u.rotate=function(t){var e,r=toNumberArray(t),a=r[0],o=r[1]||0,n=r[2]||0;return e=new Transform,e=e.translate(o,n),e=e.rotate(a),e=e.translate(-o,-n)},u.matrix=function(t){var e=toNumberArray(t);return new Transform([e[0],e[1],0,e[2],e[3],0,e[4],e[5],1])},_.each(t.attributes,function(t){var e,m,h,v,g;switch(e=t.nodeName){case"transform":for(m=trim(compressSpaces(t.nodeValue)).replace(/\)(\s?,\s?)/g,") ").split(/\s(?=[a-z])/),p=0;p<m.length;p+=1)h=trim(m[p].split("(")[0]),v=m[p].split("(")[1].replace(")",""),d=u[h](v),l.push(d);break;case"visibility":break;case"stroke-linecap":break;case"stroke-linejoin":break;case"stroke-miterlimit":break;case"stroke-width":i=parseFloat(t.nodeValue);break;case"stroke-opacity":n=parseFloat(t.nodeValue);break;case"fill-opacity":a=parseFloat(t.nodeValue);break;case"fill":r=t.nodeValue;break;case"stroke":o=t.nodeValue;break;case"opacity":s=parseFloat(t.nodeValue);break;case"color":c=t.nodeValue;break;case"style":g={},_.each(t.nodeValue.split(";"),function(t){var e=t.split(":");g[e[0].trim()]=e[1]}),g.fill&&(r=g.fill),g.stroke&&(o=g.stroke),void 0!==g["stroke-width"]&&(i=parseFloat(g["stroke-width"])),void 0!==g["stroke-opacity"]&&(n=parseFloat(g["stroke-opacity"])),void 0!==g["fill-opacity"]&&(a=parseFloat(g["fill-opacity"])),void 0!==g.opacity&&(s=parseFloat(g.opacity)),g.color&&(c=g.color)}}),void 0!==r&&(m.fill=r),void 0!==o&&(m.stroke=o),void 0!==a&&(m.fillOpacity=a),void 0!==n&&(m.strokeOpacity=n),void 0!==i&&(m.strokeWidth=i),void 0!==s&&(m.opacity=s),void 0!==c&&"currentColor"!==c&&(m.color=c),l.length>0){for(d=new Transform,p=0;p<l.length;p+=1)d=d.append(l[p]);d.isIdentity()||(m.transform?m.transform=m.transform.append(d):m.transform=d)}return m},applySvgAttributes=function(t,e){var r=e.fill;t.commands&&t.commands.length>0&&void 0===r&&(r="black");var a=e.fillOpacity,o=e.stroke,n=e.strokeOpacity,i=e.opacity,s=e.strokeWidth,c=e.transform,l=e.color;"currentColor"===r&&(r=void 0===l?"black":l),void 0!==r&&(r=Color.parse(r),void 0!==a&&(r.a*=a),void 0!==i&&(r.a*=i)),"currentColor"===o&&(o=void 0===l?"black":l),void 0!==o&&(o=Color.parse(o),void 0!==n&&(o.a*=n),void 0!==i&&(o.a*=i));var u;u=c?c.transformShape(t).commands:t.commands;var d=void 0===r?t.fill:r,p=void 0===o?t.stroke:o,m=void 0===s?t.strokeWidth:s;return void 0!==m&&void 0!==c&&(m*=c.m[0]),new Path(u,d,p,m)},arcToSegments=function(t,e,r,a,o,n,i,s,c){var l,u,d,p,m,h,v,g,f,b,y,A,C,k,x,S,P,w,M,T,F,E,q,$,O,V,L;for(l=i*(Math.PI/180),u=Math.sin(l),d=Math.cos(l),r=Math.abs(r),a=Math.abs(a),p=d*(s-t)*.5+u*(c-e)*.5,m=d*(c-e)*.5-u*(s-t)*.5,h=p*p/(r*r)+m*m/(a*a),h>1&&(h=Math.sqrt(h),r*=h,a*=h),v=d/r,g=u/r,f=-u/a,b=d/a,y=v*s+g*c,A=f*s+b*c,C=v*t+g*e,k=f*t+b*e,x=(C-y)*(C-y)+(k-A)*(k-A),S=1/x-.25,S<0&&(S=0),P=Math.sqrt(S),n===o&&(P=-P),w=.5*(y+C)-P*(k-A),M=.5*(A+k)+P*(C-y),T=Math.atan2(A-M,y-w),F=Math.atan2(k-M,C-w),E=F-T,E<0&&1===n?E+=2*Math.PI:E>0&&0===n&&(E-=2*Math.PI),q=Math.ceil(Math.abs(E/(.5*Math.PI+.001))),$=[],L=0;L<q;L+=1)O=T+L*E/q,V=T+(L+1)*E/q,$[L]=[w,M,O,V,r,a,u,d];return $},segmentToBezier=function(t,e,r,a,o,n,i,s){var c=s*o,l=-i*n,u=i*o,d=s*n,p=.5*(a-r),m=8/3*Math.sin(.5*p)*Math.sin(.5*p)/Math.sin(p),h=t+Math.cos(r)-m*Math.sin(r),v=e+Math.sin(r)+m*Math.cos(r),g=t+Math.cos(a),f=e+Math.sin(a),b=g+m*Math.sin(a),y=f-m*Math.cos(a);return[c*h+l*v,u*h+d*v,c*b+l*y,u*b+d*y,c*g+l*f,u*g+d*f]},read={svg:function(){return read.g.apply(this,arguments)},g:function(t,e){var r=[],a=readSvgAttributes(t,e);return _.each(t.childNodes,function(t){var e,o,n;e=t.nodeName,e&&(o=e.replace(/svg\:/gi,"").toLowerCase(),void 0!==read[o]&&(n=read[o].call(this,t,a),r.push(n)))}),new Group(r)},_polyline:function(t){var e=t.getAttribute("points"),r=new Path;return e.replace(/([\d\.?]+),([\d\.?]+)/g,function(t,e,a){var o=parseFloat(e),n=parseFloat(a);0===r.commands.length?r.moveTo(o,n):r.lineTo(o,n)}),r},polygon:function(t,e){var r=readSvgAttributes(t,e),a=read._polyline(t);return a.close(),applySvgAttributes(a,r)},polyline:function(t,e){var r=readSvgAttributes(t,e),a=read._polyline(t);return applySvgAttributes(a,r)},rect:function(t,e){var r=readSvgAttributes(t,e),a=parseFloat(t.getAttribute("x")),o=parseFloat(t.getAttribute("y"));a||(a=0),o||(o=0);var n=parseFloat(t.getAttribute("width")),i=parseFloat(t.getAttribute("height"));n||(n=0),i||(i=0),n<0&&(console.error('Error: invalid negative value for <rect> attribute width="'+n+'"'),n=0),i<0&&(console.error('Error: invalid negative value for <rect> attribute height="'+i+'"'),i=0);var s=parseFloat(t.getAttribute("rx")),c=parseFloat(t.getAttribute("ry"));s||(s=0),c||(c=0),s<0&&(console.error('Error: invalid negative value for <rect> attribute rx="'+s+'"'),s=0),c<0&&(console.error('Error: invalid negative value for <rect> attribute ry="'+c+'"'),c=0),s&&c||(s=c=Math.max(s,c)),s>n/2&&(s=n/2),c>i/2&&(c=i/2);var l=new Path;return s&&c?l.addRoundedRect(a,o,n,i,s,c):l.addRect(a,o,n,i),applySvgAttributes(l,r)},ellipse:function(t,e){var r=readSvgAttributes(t,e),a=parseFloat(t.getAttribute("cx")),o=parseFloat(t.getAttribute("cy"));a||(a=0),o||(o=0);var n=parseFloat(t.getAttribute("rx")),i=parseFloat(t.getAttribute("ry"));n||(n=0),i||(i=0),n<0&&(console.error('Error: invalid negative value for <ellipse> attribute rx="'+n+'"'),n=0),i<0&&(console.error('Error: invalid negative value for <ellipse> attribute ry="'+i+'"'),i=0);var s=new Path;return s.addEllipse(a-n,o-i,2*n,2*i),applySvgAttributes(s,r)},circle:function(t,e){var r=readSvgAttributes(t,e),a=parseFloat(t.getAttribute("cx")),o=parseFloat(t.getAttribute("cy"));a||(a=0),o||(o=0);var n=parseFloat(t.getAttribute("r"));n||(n=0),n<0&&(console.error('Error: invalid negative value for <circle> attribute r="'+n+'"'),n=0);var i=new Path;return i.addEllipse(a-n,o-n,2*n,2*n),applySvgAttributes(i,r)},line:function(t,e){var r=readSvgAttributes(t,e),a=parseFloat(t.getAttribute("x1")),o=parseFloat(t.getAttribute("y1")),n=parseFloat(t.getAttribute("x2")),i=parseFloat(t.getAttribute("y2"));a||(a=0),o||(o=0),n||(n=0),i||(i=0);var s=new Path;return s.addLine(a,o,n,i),applySvgAttributes(s,r)},path:function(t,e){var r,a,o,n,i,s,c,l,u,d,p,m,h,v,g,f,b,y,A,C,k,x,S,P=readSvgAttributes(t,e);r=t.getAttribute("d"),r=r.replace(/,/gm," "),r=r.replace(/([MmZzLlHhVvCcSsQqTtAa])([MmZzLlHhVvCcSsQqTtAa])/gm,"$1 $2"),r=r.replace(/([MmZzLlHhVvCcSsQqTtAa])([MmZzLlHhVvCcSsQqTtAa])/gm,"$1 $2"),r=r.replace(/([MmZzLlHhVvCcSsQqTtAa])([^\s])/gm,"$1 $2"),r=r.replace(/([^\s])([MmZzLlHhVvCcSsQqTtAa])/gm,"$1 $2"),r=r.replace(/([0-9])([+\-])/gm,"$1 $2"),r=r.replace(/(\.[0-9]*)(\.)/gm,"$1 $2"),r=r.replace(/([Aa](\s+[0-9]+){3})\s+([01])\s*([01])/gm,"$1 $3 $4 "),r=compressSpaces(r),r=trim(r),a=function(t){this.tokens=t.split(" "),this.reset=function(){this.i=-1,this.command="",this.previousCommand="",this.start=new Point(0,0),this.control=new Point(0,0),this.current=new Point(0,0),this.points=[],this.angles=[]},this.isEnd=function(){return this.i>=this.tokens.length-1},this.isCommandOrEnd=function(){return!!this.isEnd()||null!==this.tokens[this.i+1].match(/^[A-Za-z]$/)},this.isRelativeCommand=function(){switch(this.command){case"m":case"l":case"h":case"v":case"c":case"s":case"q":case"t":case"a":case"z":return!0}return!1},this.getToken=function(){return this.i+=1,this.tokens[this.i]},this.getScalar=function(){return parseFloat(this.getToken())},this.nextCommand=function(){this.previousCommand=this.command,this.command=this.getToken()},this.getPoint=function(){var t=new Point(this.getScalar(),this.getScalar());return this.makeAbsolute(t)},this.getAsControlPoint=function(){var t=this.getPoint();return this.control=t,t},this.getAsCurrentPoint=function(){var t=this.getPoint();return this.current=t,t},this.getReflectedControlPoint=function(){if("c"!==this.previousCommand.toLowerCase()&&"s"!==this.previousCommand.toLowerCase()&&"q"!==this.previousCommand.toLowerCase()&&"t"!==this.previousCommand.toLowerCase())return this.current;var t=new Point(2*this.current.x-this.control.x,2*this.current.y-this.control.y);return t},this.makeAbsolute=function(t){return this.isRelativeCommand()?new Point(t.x+this.current.x,t.y+this.current.y):t}};var w=new Path;for(o=new a(r),o.reset();!o.isEnd();)switch(o.nextCommand(),o.command){case"M":case"m":for(n=o.getAsCurrentPoint(),w.moveTo(n.x,n.y),o.start=o.current;!o.isCommandOrEnd();)n=o.getAsCurrentPoint(),w.lineTo(n.x,n.y);break;case"L":case"l":for(;!o.isCommandOrEnd();)n=o.getAsCurrentPoint(),w.lineTo(n.x,n.y);break;case"H":case"h":for(;!o.isCommandOrEnd();)i=new Point((o.isRelativeCommand()?o.current.x:0)+o.getScalar(),o.current.y),o.current=i,w.lineTo(o.current.x,o.current.y);break;case"V":case"v":for(;!o.isCommandOrEnd();)i=new Point(o.current.x,(o.isRelativeCommand()?o.current.y:0)+o.getScalar()),o.current=i,w.lineTo(o.current.x,o.current.y);break;case"C":case"c":for(;!o.isCommandOrEnd();)s=o.current,c=o.getPoint(),l=o.getAsControlPoint(),u=o.getAsCurrentPoint(),w.curveTo(c.x,c.y,l.x,l.y,u.x,u.y);break;case"S":case"s":for(;!o.isCommandOrEnd();)s=o.current,c=o.getReflectedControlPoint(),l=o.getAsControlPoint(),u=o.getAsCurrentPoint(),w.curveTo(c.x,c.y,l.x,l.y,u.x,u.y);break;case"Q":case"q":for(;!o.isCommandOrEnd();)s=o.current,l=o.getAsControlPoint(),u=o.getAsCurrentPoint(),d=s.x+2/3*(l.x-s.x),p=s.y+2/3*(l.y-s.y),m=d+1/3*(u.x-s.x),h=p+1/3*(u.y-s.y),w.curveTo(d,p,m,h,u.x,u.y);break;case"T":case"t":for(;!o.isCommandOrEnd();)s=o.current,l=o.getReflectedControlPoint(),o.control=l,u=o.getAsCurrentPoint(),d=s.x+2/3*(l.x-s.x),p=s.y+2/3*(l.y-s.y),m=d+1/3*(u.x-s.x),h=p+1/3*(u.y-s.y),w.curveTo(d,p,m,h,u.x,u.y);break;case"A":case"a":for(;!o.isCommandOrEnd();)for(s=o.current,v=o.getScalar(),g=o.getScalar(),f=o.getScalar(),b=o.getScalar(),y=o.getScalar(),u=o.getAsCurrentPoint(),A=u.x,C=u.y,k=arcToSegments(A,C,v,g,b,y,f,s.x,s.y),x=0;x<k.length;x+=1)S=segmentToBezier.apply(this,k[x]),w.curveTo.apply(w,S);break;case"Z":case"z":w.close(),o.current=o.start}return applySvgAttributes(w,P)}};exports.interpret=function(t){var e,r=t.tagName.toLowerCase();return void 0===read[r]?null:e=read[r].call(this,t)},exports.parseString=function(t){var e=new xmldom.DOMParser({errorHandler:function(e,r){throw new Error('Could not parse string "'+String(t)+'": '+r)}}).parseFromString(t);return e?exports.interpret(e.documentElement):null};
 
-
-},{"../objects/color":28,"../objects/group":29,"../objects/path":31,"../objects/point":32,"../objects/transform":35,"lodash":3,"xmldom":6}],45:[function(require,module,exports){
+},{"../objects/color":27,"../objects/group":28,"../objects/path":30,"../objects/point":31,"../objects/transform":34,"lodash":2,"xmldom":5}],44:[function(require,module,exports){
 "use strict";function importCommands(e){for(var r in e)vg[r]=e[r]}var _=require("lodash"),vg={};vg.bezier=require("./util/bezier"),vg.color=require("./util/color"),vg.geo=require("./util/geo"),vg.math=require("./util/math"),vg.random=require("./util/random"),vg.svg=require("./util/svg"),vg.Color=require("./objects/color"),vg.Group=require("./objects/group"),vg.Matrix4=require("./objects/matrix4"),vg.Path=require("./objects/path"),vg.Point=vg.Vec2=require("./objects/point"),vg.Rect=require("./objects/rect"),vg.Text=require("./objects/text"),vg.Transform=vg.Matrix3=require("./objects/transform"),vg.Vec3=require("./objects/vec3");var Transformable=require("./objects/transformable");_.extend(vg.Point.prototype,Transformable),_.extend(vg.Path.prototype,Transformable),_.extend(vg.Group.prototype,Transformable),_.extend(vg.Text.prototype,Transformable),importCommands(require("./commands/draw")),importCommands(require("./commands/filters")),importCommands(require("./commands/shapes")),module.exports=vg;
 
-
-},{"./commands/draw":25,"./commands/filters":26,"./commands/shapes":27,"./objects/color":28,"./objects/group":29,"./objects/matrix4":30,"./objects/path":31,"./objects/point":32,"./objects/rect":33,"./objects/text":34,"./objects/transform":35,"./objects/transformable":36,"./objects/vec3":37,"./util/bezier":38,"./util/color":39,"./util/geo":40,"./util/math":42,"./util/random":43,"./util/svg":44,"lodash":3}]},{},[9])(9)
+},{"./commands/draw":24,"./commands/filters":25,"./commands/shapes":26,"./objects/color":27,"./objects/group":28,"./objects/matrix4":29,"./objects/path":30,"./objects/point":31,"./objects/rect":32,"./objects/text":33,"./objects/transform":34,"./objects/transformable":35,"./objects/vec3":36,"./util/bezier":37,"./util/color":38,"./util/geo":39,"./util/math":41,"./util/random":42,"./util/svg":43,"lodash":2}],45:[function(require,module,exports){
+!function(){"use strict";function t(t,e,i){Kt.biginteger_used=1,null!=t&&("number"==typeof t&&"undefined"==typeof e?this.fromInt(t):"number"==typeof t?this.fromNumber(t,e,i):null==e&&"string"!=typeof t?this.fromString(t,256):this.fromString(t,e))}function e(){return new t(null,void 0,void 0)}function i(t,e,i,n,r,o){for(;--o>=0;){var s=e*this[t++]+i[n]+r;r=Math.floor(s/67108864),i[n++]=67108863&s}return r}function n(t,e,i,n,r,o){for(var s=32767&e,l=e>>15;--o>=0;){var p=32767&this[t],h=this[t++]>>15,u=l*p+h*s;p=s*p+((32767&u)<<15)+i[n]+(1073741823&r),r=(p>>>30)+(u>>>15)+l*h+(r>>>30),i[n++]=1073741823&p}return r}function r(t,e,i,n,r,o){for(var s=16383&e,l=e>>14;--o>=0;){var p=16383&this[t],h=this[t++]>>14,u=l*p+h*s;p=s*p+((16383&u)<<14)+i[n]+r,r=(p>>28)+(u>>14)+l*h,i[n++]=268435455&p}return r}function o(t){return he.charAt(t)}function s(t,e){var i=ue[t.charCodeAt(e)];return null==i?-1:i}function l(t){for(var e=this.t-1;e>=0;--e)t[e]=this[e];t.t=this.t,t.s=this.s}function p(t){this.t=1,this.s=t<0?-1:0,t>0?this[0]=t:t<-1?this[0]=t+this.DV:this.t=0}function h(t){var i=e();return i.fromInt(t),i}function u(e,i){var n;if(16==i)n=4;else if(8==i)n=3;else if(256==i)n=8;else if(2==i)n=1;else if(32==i)n=5;else{if(4!=i)return void this.fromRadix(e,i);n=2}this.t=0,this.s=0;for(var r=e.length,o=!1,l=0;--r>=0;){var p=8==n?255&e[r]:s(e,r);p<0?"-"==e.charAt(r)&&(o=!0):(o=!1,0==l?this[this.t++]=p:l+n>this.DB?(this[this.t-1]|=(p&(1<<this.DB-l)-1)<<l,this[this.t++]=p>>this.DB-l):this[this.t-1]|=p<<l,l+=n,l>=this.DB&&(l-=this.DB))}8==n&&0!=(128&e[0])&&(this.s=-1,l>0&&(this[this.t-1]|=(1<<this.DB-l)-1<<l)),this.clamp(),o&&t.ZERO.subTo(this,this)}function a(){for(var t=this.s&this.DM;this.t>0&&this[this.t-1]==t;)--this.t}function f(t){if(this.s<0)return"-"+this.negate().toString(t);var e;if(16==t)e=4;else if(8==t)e=3;else if(2==t)e=1;else if(32==t)e=5;else{if(4!=t)return this.toRadix(t);e=2}var i,n=(1<<e)-1,r=!1,s="",l=this.t,p=this.DB-l*this.DB%e;if(l-- >0)for(p<this.DB&&(i=this[l]>>p)>0&&(r=!0,s=o(i));l>=0;)p<e?(i=(this[l]&(1<<p)-1)<<e-p,i|=this[--l]>>(p+=this.DB-e)):(i=this[l]>>(p-=e)&n,p<=0&&(p+=this.DB,--l)),i>0&&(r=!0),r&&(s+=o(i));return r?s:"0"}function d(){var i=e();return t.ZERO.subTo(this,i),i}function P(){return this.s<0?this.negate():this}function m(t){var e=this.s-t.s;if(0!=e)return e;var i=this.t;if(e=i-t.t,0!=e)return this.s<0?-e:e;for(;--i>=0;)if(0!=(e=this[i]-t[i]))return e;return 0}function y(t){var e,i=1;return 0!=(e=t>>>16)&&(t=e,i+=16),0!=(e=t>>8)&&(t=e,i+=8),0!=(e=t>>4)&&(t=e,i+=4),0!=(e=t>>2)&&(t=e,i+=2),0!=(e=t>>1)&&(t=e,i+=1),i}function c(){return this.t<=0?0:this.DB*(this.t-1)+y(this[this.t-1]^this.s&this.DM)}function v(t,e){var i;for(i=this.t-1;i>=0;--i)e[i+t]=this[i];for(i=t-1;i>=0;--i)e[i]=0;e.t=this.t+t,e.s=this.s}function C(t,e){for(var i=t;i<this.t;++i)e[i-t]=this[i];e.t=Math.max(this.t-t,0),e.s=this.s}function I(t,e){var i,n=t%this.DB,r=this.DB-n,o=(1<<r)-1,s=Math.floor(t/this.DB),l=this.s<<n&this.DM;for(i=this.t-1;i>=0;--i)e[i+s+1]=this[i]>>r|l,l=(this[i]&o)<<n;for(i=s-1;i>=0;--i)e[i]=0;e[s]=l,e.t=this.t+s+1,e.s=this.s,e.clamp()}function _(t,e){e.s=this.s;var i=Math.floor(t/this.DB);if(i>=this.t)return void(e.t=0);var n=t%this.DB,r=this.DB-n,o=(1<<n)-1;e[0]=this[i]>>n;for(var s=i+1;s<this.t;++s)e[s-i-1]|=(this[s]&o)<<r,e[s-i]=this[s]>>n;n>0&&(e[this.t-i-1]|=(this.s&o)<<r),e.t=this.t-i,e.clamp()}function x(t,e){for(var i=0,n=0,r=Math.min(t.t,this.t);i<r;)n+=this[i]-t[i],e[i++]=n&this.DM,n>>=this.DB;if(t.t<this.t){for(n-=t.s;i<this.t;)n+=this[i],e[i++]=n&this.DM,n>>=this.DB;n+=this.s}else{for(n+=this.s;i<t.t;)n-=t[i],e[i++]=n&this.DM,n>>=this.DB;n-=t.s}e.s=n<0?-1:0,n<-1?e[i++]=this.DV+n:n>0&&(e[i++]=n),e.t=i,e.clamp()}function L(e,i){var n=this.abs(),r=e.abs(),o=n.t;for(i.t=o+r.t;--o>=0;)i[o]=0;for(o=0;o<r.t;++o)i[o+n.t]=n.am(0,r[o],i,o,0,n.t);i.s=0,i.clamp(),this.s!=e.s&&t.ZERO.subTo(i,i)}function E(t){for(var e=this.abs(),i=t.t=2*e.t;--i>=0;)t[i]=0;for(i=0;i<e.t-1;++i){var n=e.am(i,e[i],t,2*i,0,1);(t[i+e.t]+=e.am(i+1,2*e[i],t,2*i+1,n,e.t-i-1))>=e.DV&&(t[i+e.t]-=e.DV,t[i+e.t+1]=1)}t.t>0&&(t[t.t-1]+=e.am(i,e[i],t,2*i,0,1)),t.s=0,t.clamp()}function T(i,n,r){var o=i.abs();if(!(o.t<=0)){var s=this.abs();if(s.t<o.t)return null!=n&&n.fromInt(0),void(null!=r&&this.copyTo(r));null==r&&(r=e());var l=e(),p=this.s,h=i.s,u=this.DB-y(o[o.t-1]);u>0?(o.lShiftTo(u,l),s.lShiftTo(u,r)):(o.copyTo(l),s.copyTo(r));var a=l.t,f=l[a-1];if(0!=f){var d=f*(1<<this.F1)+(a>1?l[a-2]>>this.F2:0),P=this.FV/d,m=(1<<this.F1)/d,c=1<<this.F2,v=r.t,C=v-a,I=null==n?e():n;for(l.dlShiftTo(C,I),r.compareTo(I)>=0&&(r[r.t++]=1,r.subTo(I,r)),t.ONE.dlShiftTo(a,I),I.subTo(l,l);l.t<a;)l[l.t++]=0;for(;--C>=0;){var _=r[--v]==f?this.DM:Math.floor(r[v]*P+(r[v-1]+c)*m);if((r[v]+=l.am(0,_,r,C,0,a))<_)for(l.dlShiftTo(C,I),r.subTo(I,r);r[v]<--_;)r.subTo(I,r)}null!=n&&(r.drShiftTo(a,n),p!=h&&t.ZERO.subTo(n,n)),r.t=a,r.clamp(),u>0&&r.rShiftTo(u,r),p<0&&t.ZERO.subTo(r,r)}}}function g(i){var n=e();return this.abs().divRemTo(i,null,n),this.s<0&&n.compareTo(t.ZERO)>0&&i.subTo(n,n),n}function X(t){this.m=t}function Y(t){return t.s<0||t.compareTo(this.m)>=0?t.mod(this.m):t}function N(t){return t}function O(t){t.divRemTo(this.m,null,t)}function S(t,e,i){t.multiplyTo(e,i),this.reduce(i)}function A(t,e){t.squareTo(e),this.reduce(e)}function B(){if(this.t<1)return 0;var t=this[0];if(0==(1&t))return 0;var e=3&t;return e=e*(2-(15&t)*e)&15,e=e*(2-(255&t)*e)&255,e=e*(2-((65535&t)*e&65535))&65535,e=e*(2-t*e%this.DV)%this.DV,e>0?this.DV-e:-e}function D(t){this.m=t,this.mp=t.invDigit(),this.mpl=32767&this.mp,this.mph=this.mp>>15,this.um=(1<<t.DB-15)-1,this.mt2=2*t.t}function b(i){var n=e();return i.abs().dlShiftTo(this.m.t,n),n.divRemTo(this.m,null,n),i.s<0&&n.compareTo(t.ZERO)>0&&this.m.subTo(n,n),n}function w(t){var i=e();return t.copyTo(i),this.reduce(i),i}function R(t){for(;t.t<=this.mt2;)t[t.t++]=0;for(var e=0;e<this.m.t;++e){var i=32767&t[e],n=i*this.mpl+((i*this.mph+(t[e]>>15)*this.mpl&this.um)<<15)&t.DM;for(i=e+this.m.t,t[i]+=this.m.am(0,n,t,e,0,this.m.t);t[i]>=t.DV;)t[i]-=t.DV,t[++i]++}t.clamp(),t.drShiftTo(this.m.t,t),t.compareTo(this.m)>=0&&t.subTo(this.m,t)}function M(t,e){t.squareTo(e),this.reduce(e)}function F(t,e,i){t.multiplyTo(e,i),this.reduce(i)}function W(){return 0==(this.t>0?1&this[0]:this.s)}function q(i,n){if(i>4294967295||i<1)return t.ONE;var r=e(),o=e(),s=n.convert(this),l=y(i)-1;for(s.copyTo(r);--l>=0;)if(n.sqrTo(r,o),(i&1<<l)>0)n.mulTo(o,s,r);else{var p=r;r=o,o=p}return n.revert(r)}function Z(t,e){var i;return i=t<256||e.isEven()?new X(e):new D(e),this.exp(t,i)}function z(){var t=e();return this.copyTo(t),t}function H(){if(this.s<0){if(1==this.t)return this[0]-this.DV;if(0==this.t)return-1}else{if(1==this.t)return this[0];if(0==this.t)return 0}return(this[1]&(1<<32-this.DB)-1)<<this.DB|this[0]}function k(){return 0==this.t?this.s:this[0]<<24>>24}function U(){return 0==this.t?this.s:this[0]<<16>>16}function J(t){return Math.floor(Math.LN2*this.DB/Math.log(t))}function j(){return this.s<0?-1:this.t<=0||1==this.t&&this[0]<=0?0:1}function G(t){if(null==t&&(t=10),0==this.signum()||t<2||t>36)return"0";var i=this.chunkSize(t),n=Math.pow(t,i),r=h(n),o=e(),s=e(),l="";for(this.divRemTo(r,o,s);o.signum()>0;)l=(n+s.intValue()).toString(t).substr(1)+l,o.divRemTo(r,o,s);return s.intValue().toString(t)+l}function V(e,i){this.fromInt(0),null==i&&(i=10);for(var n=this.chunkSize(i),r=Math.pow(i,n),o=!1,l=0,p=0,h=0;h<e.length;++h){var u=s(e,h);u<0?"-"==e.charAt(h)&&0==this.signum()&&(o=!0):(p=i*p+u,++l>=n&&(this.dMultiply(r),this.dAddOffset(p,0),l=0,p=0))}l>0&&(this.dMultiply(Math.pow(i,l)),this.dAddOffset(p,0)),o&&t.ZERO.subTo(this,this)}function $(e,i,n){if("number"==typeof i)if(e<2)this.fromInt(1);else for(this.fromNumber(e,n),this.testBit(e-1)||this.bitwiseTo(t.ONE.shiftLeft(e-1),ot,this),this.isEven()&&this.dAddOffset(1,0);!this.isProbablePrime(i);)this.dAddOffset(2,0),this.bitLength()>e&&this.subTo(t.ONE.shiftLeft(e-1),this);else{var r=new Array,o=7&e;r.length=(e>>3)+1,i.nextBytes(r),o>0?r[0]&=(1<<o)-1:r[0]=0,this.fromString(r,256)}}function K(){var t=this.t,e=new Array;e[0]=this.s;var i,n=this.DB-t*this.DB%8,r=0;if(t-- >0)for(n<this.DB&&(i=this[t]>>n)!=(this.s&this.DM)>>n&&(e[r++]=i|this.s<<this.DB-n);t>=0;)n<8?(i=(this[t]&(1<<n)-1)<<8-n,i|=this[--t]>>(n+=this.DB-8)):(i=this[t]>>(n-=8)&255,n<=0&&(n+=this.DB,--t)),0!=(128&i)&&(i|=-256),0==r&&(128&this.s)!=(128&i)&&++r,(r>0||i!=this.s)&&(e[r++]=i);return e}function Q(t){return 0==this.compareTo(t)}function tt(t){return this.compareTo(t)<0?this:t}function et(t){return this.compareTo(t)>0?this:t}function it(t,e,i){var n,r,o=Math.min(t.t,this.t);for(n=0;n<o;++n)i[n]=e(this[n],t[n]);if(t.t<this.t){for(r=t.s&this.DM,n=o;n<this.t;++n)i[n]=e(this[n],r);i.t=this.t}else{for(r=this.s&this.DM,n=o;n<t.t;++n)i[n]=e(r,t[n]);i.t=t.t}i.s=e(this.s,t.s),i.clamp()}function nt(t,e){return t&e}function rt(t){var i=e();return this.bitwiseTo(t,nt,i),i}function ot(t,e){return t|e}function st(t){var i=e();return this.bitwiseTo(t,ot,i),i}function lt(t,e){return t^e}function pt(t){var i=e();return this.bitwiseTo(t,lt,i),i}function ht(t,e){return t&~e}function ut(t){var i=e();return this.bitwiseTo(t,ht,i),i}function at(){for(var t=e(),i=0;i<this.t;++i)t[i]=this.DM&~this[i];return t.t=this.t,t.s=~this.s,t}function ft(t){var i=e();return t<0?this.rShiftTo(-t,i):this.lShiftTo(t,i),i}function dt(t){var i=e();return t<0?this.lShiftTo(-t,i):this.rShiftTo(t,i),i}function Pt(t){if(0==t)return-1;var e=0;return 0==(65535&t)&&(t>>=16,e+=16),0==(255&t)&&(t>>=8,e+=8),0==(15&t)&&(t>>=4,e+=4),0==(3&t)&&(t>>=2,e+=2),0==(1&t)&&++e,e}function mt(){for(var t=0;t<this.t;++t)if(0!=this[t])return t*this.DB+Pt(this[t]);return this.s<0?this.t*this.DB:-1}function yt(t){for(var e=0;0!=t;)t&=t-1,++e;return e}function ct(){for(var t=0,e=this.s&this.DM,i=0;i<this.t;++i)t+=yt(this[i]^e);return t}function vt(t){var e=Math.floor(t/this.DB);return e>=this.t?0!=this.s:0!=(this[e]&1<<t%this.DB)}function Ct(e,i){var n=t.ONE.shiftLeft(e);return this.bitwiseTo(n,i,n),n}function It(t){return this.changeBit(t,ot)}function _t(t){return this.changeBit(t,ht)}function xt(t){return this.changeBit(t,lt)}function Lt(t,e){for(var i=0,n=0,r=Math.min(t.t,this.t);i<r;)n+=this[i]+t[i],e[i++]=n&this.DM,n>>=this.DB;if(t.t<this.t){for(n+=t.s;i<this.t;)n+=this[i],e[i++]=n&this.DM,n>>=this.DB;n+=this.s}else{for(n+=this.s;i<t.t;)n+=t[i],e[i++]=n&this.DM,n>>=this.DB;n+=t.s}e.s=n<0?-1:0,n>0?e[i++]=n:n<-1&&(e[i++]=this.DV+n),e.t=i,e.clamp()}function Et(t){var i=e();return this.addTo(t,i),i}function Tt(t){var i=e();return this.subTo(t,i),i}function gt(t){var i=e();return this.multiplyTo(t,i),i}function Xt(){var t=e();return this.squareTo(t),t}function Yt(t){var i=e();return this.divRemTo(t,i,null),i}function Nt(t){var i=e();return this.divRemTo(t,null,i),i}function Ot(t){var i=e(),n=e();return this.divRemTo(t,i,n),new Array(i,n)}function St(t){this[this.t]=this.am(0,t-1,this,0,0,this.t),++this.t,this.clamp()}function At(t,e){if(0!=t){for(;this.t<=e;)this[this.t++]=0;for(this[e]+=t;this[e]>=this.DV;)this[e]-=this.DV,++e>=this.t&&(this[this.t++]=0),++this[e]}}function Bt(){}function Dt(t){return t}function bt(t,e,i){t.multiplyTo(e,i)}function wt(t,e){t.squareTo(e)}function Rt(t){return this.exp(t,new Bt)}function Mt(t,e,i){var n=Math.min(this.t+t.t,e);for(i.s=0,i.t=n;n>0;)i[--n]=0;var r;for(r=i.t-this.t;n<r;++n)i[n+this.t]=this.am(0,t[n],i,n,0,this.t);for(r=Math.min(t.t,e);n<r;++n)this.am(0,t[n],i,n,0,e-n);i.clamp()}function Ft(t,e,i){--e;var n=i.t=this.t+t.t-e;for(i.s=0;--n>=0;)i[n]=0;for(n=Math.max(e-this.t,0);n<t.t;++n)i[this.t+n-e]=this.am(e-n,t[n],i,0,0,this.t+n-e);i.clamp(),i.drShiftTo(1,i)}function Wt(i){this.r2=e(),this.q3=e(),t.ONE.dlShiftTo(2*i.t,this.r2),this.mu=this.r2.divide(i),this.m=i}function qt(t){if(t.s<0||t.t>2*this.m.t)return t.mod(this.m);if(t.compareTo(this.m)<0)return t;var i=e();return t.copyTo(i),this.reduce(i),i}function Zt(t){return t}function zt(t){for(t.drShiftTo(this.m.t-1,this.r2),t.t>this.m.t+1&&(t.t=this.m.t+1,t.clamp()),this.mu.multiplyUpperTo(this.r2,this.m.t+1,this.q3),this.m.multiplyLowerTo(this.q3,this.m.t+1,this.r2);t.compareTo(this.r2)<0;)t.dAddOffset(1,this.m.t+1);for(t.subTo(this.r2,t);t.compareTo(this.m)>=0;)t.subTo(this.m,t)}function Ht(t,e){t.squareTo(e),this.reduce(e)}function kt(t,e,i){t.multiplyTo(e,i),this.reduce(i)}function Ut(t,i){var n,r,o=t.bitLength(),s=h(1);if(o<=0)return s;n=o<18?1:o<48?3:o<144?4:o<768?5:6,r=o<8?new X(i):i.isEven()?new Wt(i):new D(i);var l=new Array,p=3,u=n-1,a=(1<<n)-1;if(l[1]=r.convert(this),n>1){var f=e();for(r.sqrTo(l[1],f);p<=a;)l[p]=e(),r.mulTo(f,l[p-2],l[p]),p+=2}var d,P,m=t.t-1,c=!0,v=e();for(o=y(t[m])-1;m>=0;){for(o>=u?d=t[m]>>o-u&a:(d=(t[m]&(1<<o+1)-1)<<u-o,m>0&&(d|=t[m-1]>>this.DB+o-u)),p=n;0==(1&d);)d>>=1,--p;if((o-=p)<0&&(o+=this.DB,--m),c)l[d].copyTo(s),c=!1;else{for(;p>1;)r.sqrTo(s,v),r.sqrTo(v,s),p-=2;p>0?r.sqrTo(s,v):(P=s,s=v,v=P),r.mulTo(v,l[d],s)}for(;m>=0&&0==(t[m]&1<<o);)r.sqrTo(s,v),P=s,s=v,v=P,--o<0&&(o=this.DB-1,--m)}return r.revert(s)}function Jt(t){var e=this.s<0?this.negate():this.clone(),i=t.s<0?t.negate():t.clone();if(e.compareTo(i)<0){var n=e;e=i,i=n}var r=e.getLowestSetBit(),o=i.getLowestSetBit();if(o<0)return e;for(r<o&&(o=r),o>0&&(e.rShiftTo(o,e),i.rShiftTo(o,i));e.signum()>0;)(r=e.getLowestSetBit())>0&&e.rShiftTo(r,e),(r=i.getLowestSetBit())>0&&i.rShiftTo(r,i),e.compareTo(i)>=0?(e.subTo(i,e),e.rShiftTo(1,e)):(i.subTo(e,i),i.rShiftTo(1,i));return o>0&&i.lShiftTo(o,i),i}function jt(t){if(t<=0)return 0;var e=this.DV%t,i=this.s<0?t-1:0;if(this.t>0)if(0==e)i=this[0]%t;else for(var n=this.t-1;n>=0;--n)i=(e*i+this[n])%t;return i}function Gt(e){var i=e.isEven();if(this.isEven()&&i||0==e.signum())return t.ZERO;for(var n=e.clone(),r=this.clone(),o=h(1),s=h(0),l=h(0),p=h(1);0!=n.signum();){for(;n.isEven();)n.rShiftTo(1,n),i?(o.isEven()&&s.isEven()||(o.addTo(this,o),s.subTo(e,s)),o.rShiftTo(1,o)):s.isEven()||s.subTo(e,s),s.rShiftTo(1,s);for(;r.isEven();)r.rShiftTo(1,r),i?(l.isEven()&&p.isEven()||(l.addTo(this,l),p.subTo(e,p)),l.rShiftTo(1,l)):p.isEven()||p.subTo(e,p),p.rShiftTo(1,p);n.compareTo(r)>=0?(n.subTo(r,n),i&&o.subTo(l,o),s.subTo(p,s)):(r.subTo(n,r),i&&l.subTo(o,l),p.subTo(s,p))}return 0!=r.compareTo(t.ONE)?t.ZERO:p.compareTo(e)>=0?p.subtract(e):p.signum()<0?(p.addTo(e,p),p.signum()<0?p.add(e):p):p}function Vt(t){var e,i=this.abs();if(1==i.t&&i[0]<=ae[ae.length-1]){for(e=0;e<ae.length;++e)if(i[0]==ae[e])return!0;return!1}if(i.isEven())return!1;for(e=1;e<ae.length;){for(var n=ae[e],r=e+1;r<ae.length&&n<fe;)n*=ae[r++];for(n=i.modInt(n);e<r;)if(n%ae[e++]==0)return!1}return i.millerRabin(t)}function $t(i){var n=this.subtract(t.ONE),r=n.getLowestSetBit();if(r<=0)return!1;var o=n.shiftRight(r);i=i+1>>1,i>ae.length&&(i=ae.length);for(var s=e(),l=0;l<i;++l){s.fromInt(ae[Math.floor(Math.random()*ae.length)]);var p=s.modPow(o,this);if(0!=p.compareTo(t.ONE)&&0!=p.compareTo(n)){for(var h=1;h++<r&&0!=p.compareTo(n);)if(p=p.modPowInt(2,this),0==p.compareTo(t.ONE))return!1;if(0!=p.compareTo(n))return!1}}return!0}var Kt={};Kt.use_lines=!0,Kt.use_xyz=!1;var Qt=!1;"undefined"!=typeof module&&module.exports?(module.exports=Kt,Qt=!0):"undefined"!=typeof document?window.ClipperLib=Kt:self.ClipperLib=Kt;var te;if(Qt){var ee="chrome";te="Netscape"}else{var ee=navigator.userAgent.toString().toLowerCase();te=navigator.appName}var ie={};ee.indexOf("chrome")!=-1&&ee.indexOf("chromium")==-1?ie.chrome=1:ie.chrome=0,ee.indexOf("chromium")!=-1?ie.chromium=1:ie.chromium=0,ee.indexOf("safari")!=-1&&ee.indexOf("chrome")==-1&&ee.indexOf("chromium")==-1?ie.safari=1:ie.safari=0,ee.indexOf("firefox")!=-1?ie.firefox=1:ie.firefox=0,ee.indexOf("firefox/17")!=-1?ie.firefox17=1:ie.firefox17=0,ee.indexOf("firefox/15")!=-1?ie.firefox15=1:ie.firefox15=0,ee.indexOf("firefox/3")!=-1?ie.firefox3=1:ie.firefox3=0,ee.indexOf("opera")!=-1?ie.opera=1:ie.opera=0,ee.indexOf("msie 10")!=-1?ie.msie10=1:ie.msie10=0,ee.indexOf("msie 9")!=-1?ie.msie9=1:ie.msie9=0,ee.indexOf("msie 8")!=-1?ie.msie8=1:ie.msie8=0,ee.indexOf("msie 7")!=-1?ie.msie7=1:ie.msie7=0,ee.indexOf("msie ")!=-1?ie.msie=1:ie.msie=0,Kt.biginteger_used=null;var ne,re=0xdeadbeefcafe,oe=15715070==(16777215&re);oe&&"Microsoft Internet Explorer"==te?(t.prototype.am=n,ne=30):oe&&"Netscape"!=te?(t.prototype.am=i,ne=26):(t.prototype.am=r,ne=28),t.prototype.DB=ne,t.prototype.DM=(1<<ne)-1,t.prototype.DV=1<<ne;var se=52;t.prototype.FV=Math.pow(2,se),t.prototype.F1=se-ne,t.prototype.F2=2*ne-se;var le,pe,he="0123456789abcdefghijklmnopqrstuvwxyz",ue=new Array;for(le="0".charCodeAt(0),pe=0;pe<=9;++pe)ue[le++]=pe;for(le="a".charCodeAt(0),pe=10;pe<36;++pe)ue[le++]=pe;for(le="A".charCodeAt(0),pe=10;pe<36;++pe)ue[le++]=pe;X.prototype.convert=Y,X.prototype.revert=N,X.prototype.reduce=O,X.prototype.mulTo=S,X.prototype.sqrTo=A,D.prototype.convert=b,D.prototype.revert=w,D.prototype.reduce=R,D.prototype.mulTo=F,D.prototype.sqrTo=M,t.prototype.copyTo=l,t.prototype.fromInt=p,t.prototype.fromString=u,t.prototype.clamp=a,t.prototype.dlShiftTo=v,t.prototype.drShiftTo=C,t.prototype.lShiftTo=I,t.prototype.rShiftTo=_,t.prototype.subTo=x,t.prototype.multiplyTo=L,t.prototype.squareTo=E,t.prototype.divRemTo=T,t.prototype.invDigit=B,t.prototype.isEven=W,t.prototype.exp=q,t.prototype.toString=f,t.prototype.negate=d,t.prototype.abs=P,t.prototype.compareTo=m,t.prototype.bitLength=c,t.prototype.mod=g,t.prototype.modPowInt=Z,t.ZERO=h(0),t.ONE=h(1),Bt.prototype.convert=Dt,Bt.prototype.revert=Dt,Bt.prototype.mulTo=bt,Bt.prototype.sqrTo=wt,Wt.prototype.convert=qt,Wt.prototype.revert=Zt,Wt.prototype.reduce=zt,Wt.prototype.mulTo=kt,Wt.prototype.sqrTo=Ht;var ae=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997],fe=(1<<26)/ae[ae.length-1];t.prototype.chunkSize=J,t.prototype.toRadix=G,t.prototype.fromRadix=V,t.prototype.fromNumber=$,t.prototype.bitwiseTo=it,t.prototype.changeBit=Ct,t.prototype.addTo=Lt,t.prototype.dMultiply=St,t.prototype.dAddOffset=At,t.prototype.multiplyLowerTo=Mt,t.prototype.multiplyUpperTo=Ft,t.prototype.modInt=jt,t.prototype.millerRabin=$t,t.prototype.clone=z,t.prototype.intValue=H,t.prototype.byteValue=k,t.prototype.shortValue=U,t.prototype.signum=j,t.prototype.toByteArray=K,t.prototype.equals=Q,t.prototype.min=tt,t.prototype.max=et,t.prototype.and=rt,t.prototype.or=st,t.prototype.xor=pt,t.prototype.andNot=ut,t.prototype.not=at,t.prototype.shiftLeft=ft,t.prototype.shiftRight=dt,t.prototype.getLowestSetBit=mt,t.prototype.bitCount=ct,t.prototype.testBit=vt,t.prototype.setBit=It,t.prototype.clearBit=_t,t.prototype.flipBit=xt,t.prototype.add=Et,t.prototype.subtract=Tt,t.prototype.multiply=gt,t.prototype.divide=Yt,t.prototype.remainder=Nt,t.prototype.divideAndRemainder=Ot,t.prototype.modPow=Ut,t.prototype.modInverse=Gt,t.prototype.pow=Rt,t.prototype.gcd=Jt,t.prototype.isProbablePrime=Vt,t.prototype.square=Xt;var de=t;de.prototype.IsNegative=function(){return this.compareTo(de.ZERO)==-1},de.op_Equality=function(t,e){return 0==t.compareTo(e)},de.op_Inequality=function(t,e){return 0!=t.compareTo(e)},de.op_GreaterThan=function(t,e){return t.compareTo(e)>0},de.op_LessThan=function(t,e){return t.compareTo(e)<0},de.op_Addition=function(t,e){return new de(t).add(new de(e))},de.op_Subtraction=function(t,e){return new de(t).subtract(new de(e))},de.Int128Mul=function(t,e){return new de(t).multiply(new de(e))},de.op_Division=function(t,e){return t.divide(e)},de.prototype.ToDouble=function(){return parseFloat(this.toString())};var Pe=function(t,e){var i;if("undefined"==typeof Object.getOwnPropertyNames){for(i in e.prototype)"undefined"!=typeof t.prototype[i]&&t.prototype[i]!=Object.prototype[i]||(t.prototype[i]=e.prototype[i]);for(i in e)"undefined"==typeof t[i]&&(t[i]=e[i]);t.$baseCtor=e}else{for(var n=Object.getOwnPropertyNames(e.prototype),r=0;r<n.length;r++)"undefined"==typeof Object.getOwnPropertyDescriptor(t.prototype,n[r])&&Object.defineProperty(t.prototype,n[r],Object.getOwnPropertyDescriptor(e.prototype,n[r]));for(i in e)"undefined"==typeof t[i]&&(t[i]=e[i]);t.$baseCtor=e}};Kt.Path=function(){return[]},Kt.Paths=function(){return[]},Kt.DoublePoint=function(){var t=arguments;this.X=0,this.Y=0,1==t.length?(this.X=t[0].X,this.Y=t[0].Y):2==t.length&&(this.X=t[0],this.Y=t[1])},Kt.DoublePoint0=function(){this.X=0,this.Y=0},Kt.DoublePoint1=function(t){this.X=t.X,this.Y=t.Y},Kt.DoublePoint2=function(t,e){this.X=t,this.Y=e},Kt.PolyNode=function(){this.m_Parent=null,this.m_polygon=new Kt.Path,this.m_Index=0,this.m_jointype=0,this.m_endtype=0,this.m_Childs=[],this.IsOpen=!1},Kt.PolyNode.prototype.IsHoleNode=function(){for(var t=!0,e=this.m_Parent;null!==e;)t=!t,e=e.m_Parent;return t},Kt.PolyNode.prototype.ChildCount=function(){return this.m_Childs.length},Kt.PolyNode.prototype.Contour=function(){return this.m_polygon},Kt.PolyNode.prototype.AddChild=function(t){var e=this.m_Childs.length;this.m_Childs.push(t),t.m_Parent=this,t.m_Index=e},Kt.PolyNode.prototype.GetNext=function(){return this.m_Childs.length>0?this.m_Childs[0]:this.GetNextSiblingUp()},Kt.PolyNode.prototype.GetNextSiblingUp=function(){return null===this.m_Parent?null:this.m_Index==this.m_Parent.m_Childs.length-1?this.m_Parent.GetNextSiblingUp():this.m_Parent.m_Childs[this.m_Index+1]},Kt.PolyNode.prototype.Childs=function(){return this.m_Childs},Kt.PolyNode.prototype.Parent=function(){return this.m_Parent},Kt.PolyNode.prototype.IsHole=function(){return this.IsHoleNode()},Kt.PolyTree=function(){this.m_AllPolys=[],Kt.PolyNode.call(this)},Kt.PolyTree.prototype.Clear=function(){for(var t=0,e=this.m_AllPolys.length;t<e;t++)this.m_AllPolys[t]=null;this.m_AllPolys.length=0,this.m_Childs.length=0},Kt.PolyTree.prototype.GetFirst=function(){return this.m_Childs.length>0?this.m_Childs[0]:null},Kt.PolyTree.prototype.Total=function(){var t=this.m_AllPolys.length;return t>0&&this.m_Childs[0]!=this.m_AllPolys[0]&&t--,t},Pe(Kt.PolyTree,Kt.PolyNode),Kt.Math_Abs_Int64=Kt.Math_Abs_Int32=Kt.Math_Abs_Double=function(t){return Math.abs(t)},Kt.Math_Max_Int32_Int32=function(t,e){return Math.max(t,e)},ie.msie||ie.opera||ie.safari?Kt.Cast_Int32=function(t){return 0|t}:Kt.Cast_Int32=function(t){return~~t},ie.chrome?Kt.Cast_Int64=function(t){return t<-2147483648||t>2147483647?t<0?Math.ceil(t):Math.floor(t):~~t}:ie.firefox&&"function"==typeof Number.toInteger?Kt.Cast_Int64=function(t){return Number.toInteger(t)}:ie.msie7||ie.msie8?Kt.Cast_Int64=function(t){return parseInt(t,10)}:ie.msie?Kt.Cast_Int64=function(t){return t<-2147483648||t>2147483647?t<0?Math.ceil(t):Math.floor(t):0|t}:Kt.Cast_Int64=function(t){return t<0?Math.ceil(t):Math.floor(t)},Kt.Clear=function(t){t.length=0},Kt.PI=3.141592653589793,Kt.PI2=6.283185307179586,Kt.IntPoint=function(){var t=arguments,e=t.length;if(this.X=0,this.Y=0,Kt.use_xyz)if(this.Z=0,3==e)this.X=t[0],this.Y=t[1],this.Z=t[2];else if(2==e)this.X=t[0],this.Y=t[1],this.Z=0;else if(1==e)if(t[0]instanceof Kt.DoublePoint){var i=t[0];this.X=Kt.Clipper.Round(i.X),this.Y=Kt.Clipper.Round(i.Y),this.Z=0}else{var n=t[0];"undefined"==typeof n.Z&&(n.Z=0),this.X=n.X,this.Y=n.Y,this.Z=n.Z}else this.X=0,this.Y=0,this.Z=0;else if(2==e)this.X=t[0],this.Y=t[1];else if(1==e)if(t[0]instanceof Kt.DoublePoint){var i=t[0];this.X=Kt.Clipper.Round(i.X),this.Y=Kt.Clipper.Round(i.Y)}else{var n=t[0];this.X=n.X,this.Y=n.Y}else this.X=0,this.Y=0},Kt.IntPoint.op_Equality=function(t,e){return t.X==e.X&&t.Y==e.Y},Kt.IntPoint.op_Inequality=function(t,e){return t.X!=e.X||t.Y!=e.Y},Kt.use_xyz?(Kt.IntPoint0=function(){this.X=0,this.Y=0,this.Z=0},Kt.IntPoint1=function(t){this.X=t.X,this.Y=t.Y,this.Z=t.Z},Kt.IntPoint1dp=function(t){this.X=Kt.Clipper.Round(t.X),this.Y=Kt.Clipper.Round(t.Y),this.Z=0},Kt.IntPoint2=function(t,e){this.X=t,this.Y=e,this.Z=0},Kt.IntPoint3=function(t,e,i){this.X=t,this.Y=e,this.Z=i}):(Kt.IntPoint0=function(){this.X=0,this.Y=0},Kt.IntPoint1=function(t){this.X=t.X,this.Y=t.Y},Kt.IntPoint1dp=function(t){this.X=Kt.Clipper.Round(t.X),this.Y=Kt.Clipper.Round(t.Y)},Kt.IntPoint2=function(t,e){this.X=t,this.Y=e}),Kt.IntRect=function(){var t=arguments,e=t.length;4==e?(this.left=t[0],this.top=t[1],this.right=t[2],this.bottom=t[3]):1==e?(this.left=ir.left,this.top=ir.top,this.right=ir.right,this.bottom=ir.bottom):(this.left=0,this.top=0,this.right=0,this.bottom=0)},Kt.IntRect0=function(){this.left=0,this.top=0,this.right=0,this.bottom=0},Kt.IntRect1=function(t){this.left=t.left,this.top=t.top,this.right=t.right,this.bottom=t.bottom},Kt.IntRect4=function(t,e,i,n){this.left=t,this.top=e,this.right=i,this.bottom=n},Kt.ClipType={ctIntersection:0,ctUnion:1,ctDifference:2,ctXor:3},Kt.PolyType={ptSubject:0,ptClip:1},Kt.PolyFillType={pftEvenOdd:0,pftNonZero:1,pftPositive:2,pftNegative:3},Kt.JoinType={jtSquare:0,jtRound:1,jtMiter:2},Kt.EndType={etOpenSquare:0,etOpenRound:1,etOpenButt:2,etClosedLine:3,etClosedPolygon:4},Kt.EdgeSide={esLeft:0,esRight:1},Kt.Direction={dRightToLeft:0,dLeftToRight:1},Kt.TEdge=function(){this.Bot=new Kt.IntPoint,this.Curr=new Kt.IntPoint,this.Top=new Kt.IntPoint,this.Delta=new Kt.IntPoint,this.Dx=0,this.PolyTyp=Kt.PolyType.ptSubject,this.Side=Kt.EdgeSide.esLeft,this.WindDelta=0,this.WindCnt=0,this.WindCnt2=0,this.OutIdx=0,this.Next=null,this.Prev=null,this.NextInLML=null,this.NextInAEL=null,this.PrevInAEL=null,this.NextInSEL=null,this.PrevInSEL=null},Kt.IntersectNode=function(){this.Edge1=null,this.Edge2=null,this.Pt=new Kt.IntPoint},Kt.MyIntersectNodeSort=function(){},Kt.MyIntersectNodeSort.Compare=function(t,e){var i=e.Pt.Y-t.Pt.Y;return i>0?1:i<0?-1:0},Kt.LocalMinima=function(){this.Y=0,this.LeftBound=null,this.RightBound=null,this.Next=null},Kt.Scanbeam=function(){this.Y=0,this.Next=null},Kt.OutRec=function(){this.Idx=0,this.IsHole=!1,this.IsOpen=!1,this.FirstLeft=null,this.Pts=null,this.BottomPt=null,this.PolyNode=null},Kt.OutPt=function(){this.Idx=0,this.Pt=new Kt.IntPoint,this.Next=null,this.Prev=null},Kt.Join=function(){this.OutPt1=null,this.OutPt2=null,this.OffPt=new Kt.IntPoint},Kt.ClipperBase=function(){this.m_MinimaList=null,this.m_CurrentLM=null,this.m_edges=new Array,this.m_UseFullRange=!1,this.m_HasOpenPaths=!1,this.PreserveCollinear=!1,this.m_MinimaList=null,this.m_CurrentLM=null,this.m_UseFullRange=!1,this.m_HasOpenPaths=!1},Kt.ClipperBase.horizontal=-9007199254740992,Kt.ClipperBase.Skip=-2,Kt.ClipperBase.Unassigned=-1,Kt.ClipperBase.tolerance=1e-20,Kt.ClipperBase.loRange=47453132,Kt.ClipperBase.hiRange=0xfffffffffffff,Kt.ClipperBase.near_zero=function(t){return t>-Kt.ClipperBase.tolerance&&t<Kt.ClipperBase.tolerance},Kt.ClipperBase.IsHorizontal=function(t){return 0===t.Delta.Y},Kt.ClipperBase.prototype.PointIsVertex=function(t,e){var i=e;do{if(Kt.IntPoint.op_Equality(i.Pt,t))return!0;i=i.Next}while(i!=e);return!1},Kt.ClipperBase.prototype.PointOnLineSegment=function(t,e,i,n){return n?t.X==e.X&&t.Y==e.Y||t.X==i.X&&t.Y==i.Y||t.X>e.X==t.X<i.X&&t.Y>e.Y==t.Y<i.Y&&de.op_Equality(de.Int128Mul(t.X-e.X,i.Y-e.Y),de.Int128Mul(i.X-e.X,t.Y-e.Y)):t.X==e.X&&t.Y==e.Y||t.X==i.X&&t.Y==i.Y||t.X>e.X==t.X<i.X&&t.Y>e.Y==t.Y<i.Y&&(t.X-e.X)*(i.Y-e.Y)==(i.X-e.X)*(t.Y-e.Y)},Kt.ClipperBase.prototype.PointOnPolygon=function(t,e,i){for(var n=e;;){if(this.PointOnLineSegment(t,n.Pt,n.Next.Pt,i))return!0;if(n=n.Next,n==e)break}return!1},Kt.ClipperBase.prototype.SlopesEqual=Kt.ClipperBase.SlopesEqual=function(){var t,e,i,n,r,o,s,l=arguments,p=l.length;return 3==p?(t=l[0],e=l[1],s=l[2],s?de.op_Equality(de.Int128Mul(t.Delta.Y,e.Delta.X),de.Int128Mul(t.Delta.X,e.Delta.Y)):Kt.Cast_Int64(t.Delta.Y*e.Delta.X)==Kt.Cast_Int64(t.Delta.X*e.Delta.Y)):4==p?(i=l[0],n=l[1],r=l[2],s=l[3],s?de.op_Equality(de.Int128Mul(i.Y-n.Y,n.X-r.X),de.Int128Mul(i.X-n.X,n.Y-r.Y)):Kt.Cast_Int64((i.Y-n.Y)*(n.X-r.X))-Kt.Cast_Int64((i.X-n.X)*(n.Y-r.Y))===0):(i=l[0],n=l[1],r=l[2],o=l[3],s=l[4],s?de.op_Equality(de.Int128Mul(i.Y-n.Y,r.X-o.X),de.Int128Mul(i.X-n.X,r.Y-o.Y)):Kt.Cast_Int64((i.Y-n.Y)*(r.X-o.X))-Kt.Cast_Int64((i.X-n.X)*(r.Y-o.Y))===0)},Kt.ClipperBase.SlopesEqual3=function(t,e,i){return i?de.op_Equality(de.Int128Mul(t.Delta.Y,e.Delta.X),de.Int128Mul(t.Delta.X,e.Delta.Y)):Kt.Cast_Int64(t.Delta.Y*e.Delta.X)==Kt.Cast_Int64(t.Delta.X*e.Delta.Y)},Kt.ClipperBase.SlopesEqual4=function(t,e,i,n){return n?de.op_Equality(de.Int128Mul(t.Y-e.Y,e.X-i.X),de.Int128Mul(t.X-e.X,e.Y-i.Y)):Kt.Cast_Int64((t.Y-e.Y)*(e.X-i.X))-Kt.Cast_Int64((t.X-e.X)*(e.Y-i.Y))===0},Kt.ClipperBase.SlopesEqual5=function(t,e,i,n,r){return r?de.op_Equality(de.Int128Mul(t.Y-e.Y,i.X-n.X),de.Int128Mul(t.X-e.X,i.Y-n.Y)):Kt.Cast_Int64((t.Y-e.Y)*(i.X-n.X))-Kt.Cast_Int64((t.X-e.X)*(i.Y-n.Y))===0},Kt.ClipperBase.prototype.Clear=function(){this.DisposeLocalMinimaList();for(var t=0,e=this.m_edges.length;t<e;++t){for(var i=0,n=this.m_edges[t].length;i<n;++i)this.m_edges[t][i]=null;Kt.Clear(this.m_edges[t])}Kt.Clear(this.m_edges),this.m_UseFullRange=!1,this.m_HasOpenPaths=!1},Kt.ClipperBase.prototype.DisposeLocalMinimaList=function(){for(;null!==this.m_MinimaList;){var t=this.m_MinimaList.Next;this.m_MinimaList=null,this.m_MinimaList=t}this.m_CurrentLM=null},Kt.ClipperBase.prototype.RangeTest=function(t,e){e.Value?(t.X>Kt.ClipperBase.hiRange||t.Y>Kt.ClipperBase.hiRange||-t.X>Kt.ClipperBase.hiRange||-t.Y>Kt.ClipperBase.hiRange)&&Kt.Error("Coordinate outside allowed range in RangeTest()."):(t.X>Kt.ClipperBase.loRange||t.Y>Kt.ClipperBase.loRange||-t.X>Kt.ClipperBase.loRange||-t.Y>Kt.ClipperBase.loRange)&&(e.Value=!0,this.RangeTest(t,e))},Kt.ClipperBase.prototype.InitEdge=function(t,e,i,n){t.Next=e,t.Prev=i,t.Curr.X=n.X,t.Curr.Y=n.Y,Kt.use_xyz&&(t.Curr.Z=n.Z),t.OutIdx=-1},Kt.ClipperBase.prototype.InitEdge2=function(t,e){t.Curr.Y>=t.Next.Curr.Y?(t.Bot.X=t.Curr.X,t.Bot.Y=t.Curr.Y,Kt.use_xyz&&(t.Bot.Z=t.Curr.Z),t.Top.X=t.Next.Curr.X,t.Top.Y=t.Next.Curr.Y,Kt.use_xyz&&(t.Top.Z=t.Next.Curr.Z)):(t.Top.X=t.Curr.X,t.Top.Y=t.Curr.Y,Kt.use_xyz&&(t.Top.Z=t.Curr.Z),t.Bot.X=t.Next.Curr.X,t.Bot.Y=t.Next.Curr.Y,Kt.use_xyz&&(t.Bot.Z=t.Next.Curr.Z)),this.SetDx(t),t.PolyTyp=e},Kt.ClipperBase.prototype.FindNextLocMin=function(t){for(var e;;){for(;Kt.IntPoint.op_Inequality(t.Bot,t.Prev.Bot)||Kt.IntPoint.op_Equality(t.Curr,t.Top);)t=t.Next;if(t.Dx!=Kt.ClipperBase.horizontal&&t.Prev.Dx!=Kt.ClipperBase.horizontal)break;for(;t.Prev.Dx==Kt.ClipperBase.horizontal;)t=t.Prev;for(e=t;t.Dx==Kt.ClipperBase.horizontal;)t=t.Next;if(t.Top.Y!=t.Prev.Bot.Y){e.Prev.Bot.X<t.Bot.X&&(t=e);break}}return t},Kt.ClipperBase.prototype.ProcessBound=function(t,e){var i,n,r=t;if(r.OutIdx==Kt.ClipperBase.Skip){if(t=r,e){for(;t.Top.Y==t.Next.Bot.Y;)t=t.Next;for(;t!=r&&t.Dx==Kt.ClipperBase.horizontal;)t=t.Prev}else{for(;t.Top.Y==t.Prev.Bot.Y;)t=t.Prev;for(;t!=r&&t.Dx==Kt.ClipperBase.horizontal;)t=t.Next}if(t==r)r=e?t.Next:t.Prev;else{t=e?r.Next:r.Prev;var o=new Kt.LocalMinima;o.Next=null,o.Y=t.Bot.Y,o.LeftBound=null,o.RightBound=t,t.WindDelta=0,r=this.ProcessBound(t,e),this.InsertLocalMinima(o)}return r}if(t.Dx==Kt.ClipperBase.horizontal&&(i=e?t.Prev:t.Next,i.OutIdx!=Kt.ClipperBase.Skip&&(i.Dx==Kt.ClipperBase.horizontal?i.Bot.X!=t.Bot.X&&i.Top.X!=t.Bot.X&&this.ReverseHorizontal(t):i.Bot.X!=t.Bot.X&&this.ReverseHorizontal(t))),i=t,e){for(;r.Top.Y==r.Next.Bot.Y&&r.Next.OutIdx!=Kt.ClipperBase.Skip;)r=r.Next;if(r.Dx==Kt.ClipperBase.horizontal&&r.Next.OutIdx!=Kt.ClipperBase.Skip){for(n=r;n.Prev.Dx==Kt.ClipperBase.horizontal;)n=n.Prev;n.Prev.Top.X==r.Next.Top.X?e||(r=n.Prev):n.Prev.Top.X>r.Next.Top.X&&(r=n.Prev)}for(;t!=r;)t.NextInLML=t.Next,t.Dx==Kt.ClipperBase.horizontal&&t!=i&&t.Bot.X!=t.Prev.Top.X&&this.ReverseHorizontal(t),t=t.Next;t.Dx==Kt.ClipperBase.horizontal&&t!=i&&t.Bot.X!=t.Prev.Top.X&&this.ReverseHorizontal(t),r=r.Next;
+}else{for(;r.Top.Y==r.Prev.Bot.Y&&r.Prev.OutIdx!=Kt.ClipperBase.Skip;)r=r.Prev;if(r.Dx==Kt.ClipperBase.horizontal&&r.Prev.OutIdx!=Kt.ClipperBase.Skip){for(n=r;n.Next.Dx==Kt.ClipperBase.horizontal;)n=n.Next;n.Next.Top.X==r.Prev.Top.X?e||(r=n.Next):n.Next.Top.X>r.Prev.Top.X&&(r=n.Next)}for(;t!=r;)t.NextInLML=t.Prev,t.Dx==Kt.ClipperBase.horizontal&&t!=i&&t.Bot.X!=t.Next.Top.X&&this.ReverseHorizontal(t),t=t.Prev;t.Dx==Kt.ClipperBase.horizontal&&t!=i&&t.Bot.X!=t.Next.Top.X&&this.ReverseHorizontal(t),r=r.Prev}return r},Kt.ClipperBase.prototype.AddPath=function(t,e,i){Kt.use_lines?i||e!=Kt.PolyType.ptClip||Kt.Error("AddPath: Open paths must be subject."):i||Kt.Error("AddPath: Open paths have been disabled.");var n=t.length-1;if(i)for(;n>0&&Kt.IntPoint.op_Equality(t[n],t[0]);)--n;for(;n>0&&Kt.IntPoint.op_Equality(t[n],t[n-1]);)--n;if(i&&n<2||!i&&n<1)return!1;for(var r=new Array,o=0;o<=n;o++)r.push(new Kt.TEdge);var s=!0;r[1].Curr.X=t[1].X,r[1].Curr.Y=t[1].Y,Kt.use_xyz&&(r[1].Curr.Z=t[1].Z);var l={Value:this.m_UseFullRange};this.RangeTest(t[0],l),this.m_UseFullRange=l.Value,l.Value=this.m_UseFullRange,this.RangeTest(t[n],l),this.m_UseFullRange=l.Value,this.InitEdge(r[0],r[1],r[n],t[0]),this.InitEdge(r[n],r[0],r[n-1],t[n]);for(var o=n-1;o>=1;--o)l.Value=this.m_UseFullRange,this.RangeTest(t[o],l),this.m_UseFullRange=l.Value,this.InitEdge(r[o],r[o+1],r[o-1],t[o]);for(var p=r[0],h=p,u=p;;)if(h.Curr!=h.Next.Curr||!i&&h.Next==p){if(h.Prev==h.Next)break;if(!i||!Kt.ClipperBase.SlopesEqual(h.Prev.Curr,h.Curr,h.Next.Curr,this.m_UseFullRange)||this.PreserveCollinear&&this.Pt2IsBetweenPt1AndPt3(h.Prev.Curr,h.Curr,h.Next.Curr)){if(h=h.Next,h==u||!i&&h.Next==p)break}else h==p&&(p=h.Next),h=this.RemoveEdge(h),h=h.Prev,u=h}else{if(h==h.Next)break;h==p&&(p=h.Next),h=this.RemoveEdge(h),u=h}if(!i&&h==h.Next||i&&h.Prev==h.Next)return!1;i||(this.m_HasOpenPaths=!0,p.Prev.OutIdx=Kt.ClipperBase.Skip),h=p;do this.InitEdge2(h,e),h=h.Next,s&&h.Curr.Y!=p.Curr.Y&&(s=!1);while(h!=p);if(s){if(i)return!1;h.Prev.OutIdx=Kt.ClipperBase.Skip,h.Prev.Bot.X<h.Prev.Top.X&&this.ReverseHorizontal(h.Prev);var a=new Kt.LocalMinima;for(a.Next=null,a.Y=h.Bot.Y,a.LeftBound=null,a.RightBound=h,a.RightBound.Side=Kt.EdgeSide.esRight,a.RightBound.WindDelta=0;h.Next.OutIdx!=Kt.ClipperBase.Skip;)h.NextInLML=h.Next,h.Bot.X!=h.Prev.Top.X&&this.ReverseHorizontal(h),h=h.Next;return this.InsertLocalMinima(a),this.m_edges.push(r),!0}this.m_edges.push(r);var f,d=null;for(Kt.IntPoint.op_Equality(h.Prev.Bot,h.Prev.Top)&&(h=h.Next);h=this.FindNextLocMin(h),h!=d;){null==d&&(d=h);var a=new Kt.LocalMinima;a.Next=null,a.Y=h.Bot.Y,h.Dx<h.Prev.Dx?(a.LeftBound=h.Prev,a.RightBound=h,f=!1):(a.LeftBound=h,a.RightBound=h.Prev,f=!0),a.LeftBound.Side=Kt.EdgeSide.esLeft,a.RightBound.Side=Kt.EdgeSide.esRight,i?a.LeftBound.Next==a.RightBound?a.LeftBound.WindDelta=-1:a.LeftBound.WindDelta=1:a.LeftBound.WindDelta=0,a.RightBound.WindDelta=-a.LeftBound.WindDelta,h=this.ProcessBound(a.LeftBound,f),h.OutIdx==Kt.ClipperBase.Skip&&(h=this.ProcessBound(h,f));var P=this.ProcessBound(a.RightBound,!f);P.OutIdx==Kt.ClipperBase.Skip&&(P=this.ProcessBound(P,!f)),a.LeftBound.OutIdx==Kt.ClipperBase.Skip?a.LeftBound=null:a.RightBound.OutIdx==Kt.ClipperBase.Skip&&(a.RightBound=null),this.InsertLocalMinima(a),f||(h=P)}return!0},Kt.ClipperBase.prototype.AddPaths=function(t,e,i){for(var n=!1,r=0,o=t.length;r<o;++r)this.AddPath(t[r],e,i)&&(n=!0);return n},Kt.ClipperBase.prototype.Pt2IsBetweenPt1AndPt3=function(t,e,i){return!(Kt.IntPoint.op_Equality(t,i)||Kt.IntPoint.op_Equality(t,e)||Kt.IntPoint.op_Equality(i,e))&&(t.X!=i.X?e.X>t.X==e.X<i.X:e.Y>t.Y==e.Y<i.Y)},Kt.ClipperBase.prototype.RemoveEdge=function(t){t.Prev.Next=t.Next,t.Next.Prev=t.Prev;var e=t.Next;return t.Prev=null,e},Kt.ClipperBase.prototype.SetDx=function(t){t.Delta.X=t.Top.X-t.Bot.X,t.Delta.Y=t.Top.Y-t.Bot.Y,0===t.Delta.Y?t.Dx=Kt.ClipperBase.horizontal:t.Dx=t.Delta.X/t.Delta.Y},Kt.ClipperBase.prototype.InsertLocalMinima=function(t){if(null===this.m_MinimaList)this.m_MinimaList=t;else if(t.Y>=this.m_MinimaList.Y)t.Next=this.m_MinimaList,this.m_MinimaList=t;else{for(var e=this.m_MinimaList;null!==e.Next&&t.Y<e.Next.Y;)e=e.Next;t.Next=e.Next,e.Next=t}},Kt.ClipperBase.prototype.PopLocalMinima=function(){null!==this.m_CurrentLM&&(this.m_CurrentLM=this.m_CurrentLM.Next)},Kt.ClipperBase.prototype.ReverseHorizontal=function(t){var e=t.Top.X;t.Top.X=t.Bot.X,t.Bot.X=e,Kt.use_xyz&&(e=t.Top.Z,t.Top.Z=t.Bot.Z,t.Bot.Z=e)},Kt.ClipperBase.prototype.Reset=function(){if(this.m_CurrentLM=this.m_MinimaList,null!=this.m_CurrentLM)for(var t=this.m_MinimaList;null!=t;){var e=t.LeftBound;null!=e&&(e.Curr.X=e.Bot.X,e.Curr.Y=e.Bot.Y,Kt.use_xyz&&(e.Curr.Z=e.Bot.Z),e.Side=Kt.EdgeSide.esLeft,e.OutIdx=Kt.ClipperBase.Unassigned),e=t.RightBound,null!=e&&(e.Curr.X=e.Bot.X,e.Curr.Y=e.Bot.Y,Kt.use_xyz&&(e.Curr.Z=e.Bot.Z),e.Side=Kt.EdgeSide.esRight,e.OutIdx=Kt.ClipperBase.Unassigned),t=t.Next}},Kt.Clipper=function(t){"undefined"==typeof t&&(t=0),this.m_PolyOuts=null,this.m_ClipType=Kt.ClipType.ctIntersection,this.m_Scanbeam=null,this.m_ActiveEdges=null,this.m_SortedEdges=null,this.m_IntersectList=null,this.m_IntersectNodeComparer=null,this.m_ExecuteLocked=!1,this.m_ClipFillType=Kt.PolyFillType.pftEvenOdd,this.m_SubjFillType=Kt.PolyFillType.pftEvenOdd,this.m_Joins=null,this.m_GhostJoins=null,this.m_UsingPolyTree=!1,this.ReverseSolution=!1,this.StrictlySimple=!1,Kt.ClipperBase.call(this),this.m_Scanbeam=null,this.m_ActiveEdges=null,this.m_SortedEdges=null,this.m_IntersectList=new Array,this.m_IntersectNodeComparer=Kt.MyIntersectNodeSort.Compare,this.m_ExecuteLocked=!1,this.m_UsingPolyTree=!1,this.m_PolyOuts=new Array,this.m_Joins=new Array,this.m_GhostJoins=new Array,this.ReverseSolution=0!==(1&t),this.StrictlySimple=0!==(2&t),this.PreserveCollinear=0!==(4&t),Kt.use_xyz&&(this.ZFillFunction=null)},Kt.Clipper.ioReverseSolution=1,Kt.Clipper.ioStrictlySimple=2,Kt.Clipper.ioPreserveCollinear=4,Kt.Clipper.prototype.Clear=function(){0!==this.m_edges.length&&(this.DisposeAllPolyPts(),Kt.ClipperBase.prototype.Clear.call(this))},Kt.Clipper.prototype.DisposeScanbeamList=function(){for(;null!==this.m_Scanbeam;){var t=this.m_Scanbeam.Next;this.m_Scanbeam=null,this.m_Scanbeam=t}},Kt.Clipper.prototype.Reset=function(){Kt.ClipperBase.prototype.Reset.call(this),this.m_Scanbeam=null,this.m_ActiveEdges=null,this.m_SortedEdges=null;for(var t=this.m_MinimaList;null!==t;)this.InsertScanbeam(t.Y),t=t.Next},Kt.Clipper.prototype.InsertScanbeam=function(t){if(null===this.m_Scanbeam)this.m_Scanbeam=new Kt.Scanbeam,this.m_Scanbeam.Next=null,this.m_Scanbeam.Y=t;else if(t>this.m_Scanbeam.Y){var e=new Kt.Scanbeam;e.Y=t,e.Next=this.m_Scanbeam,this.m_Scanbeam=e}else{for(var i=this.m_Scanbeam;null!==i.Next&&t<=i.Next.Y;)i=i.Next;if(t==i.Y)return;var e=new Kt.Scanbeam;e.Y=t,e.Next=i.Next,i.Next=e}},Kt.Clipper.prototype.Execute=function(){var t=arguments,e=t.length,i=t[1]instanceof Kt.PolyTree;if(4==e&&!i){var n=t[0],r=t[1],o=t[2],s=t[3];if(this.m_ExecuteLocked)return!1;this.m_HasOpenPaths&&Kt.Error("Error: PolyTree struct is need for open path clipping."),this.m_ExecuteLocked=!0,Kt.Clear(r),this.m_SubjFillType=o,this.m_ClipFillType=s,this.m_ClipType=n,this.m_UsingPolyTree=!1;try{var l=this.ExecuteInternal();l&&this.BuildResult(r)}finally{this.DisposeAllPolyPts(),this.m_ExecuteLocked=!1}return l}if(4==e&&i){var n=t[0],p=t[1],o=t[2],s=t[3];if(this.m_ExecuteLocked)return!1;this.m_ExecuteLocked=!0,this.m_SubjFillType=o,this.m_ClipFillType=s,this.m_ClipType=n,this.m_UsingPolyTree=!0;try{var l=this.ExecuteInternal();l&&this.BuildResult2(p)}finally{this.DisposeAllPolyPts(),this.m_ExecuteLocked=!1}return l}if(2==e&&!i){var n=t[0],r=t[1];return this.Execute(n,r,Kt.PolyFillType.pftEvenOdd,Kt.PolyFillType.pftEvenOdd)}if(2==e&&i){var n=t[0],p=t[1];return this.Execute(n,p,Kt.PolyFillType.pftEvenOdd,Kt.PolyFillType.pftEvenOdd)}},Kt.Clipper.prototype.FixHoleLinkage=function(t){if(null!==t.FirstLeft&&(t.IsHole==t.FirstLeft.IsHole||null===t.FirstLeft.Pts)){for(var e=t.FirstLeft;null!==e&&(e.IsHole==t.IsHole||null===e.Pts);)e=e.FirstLeft;t.FirstLeft=e}},Kt.Clipper.prototype.ExecuteInternal=function(){try{if(this.Reset(),null===this.m_CurrentLM)return!1;var t=this.PopScanbeam();do{if(this.InsertLocalMinimaIntoAEL(t),Kt.Clear(this.m_GhostJoins),this.ProcessHorizontals(!1),null===this.m_Scanbeam)break;var e=this.PopScanbeam();if(!this.ProcessIntersections(e))return!1;this.ProcessEdgesAtTopOfScanbeam(e),t=e}while(null!==this.m_Scanbeam||null!==this.m_CurrentLM);for(var i=0,n=this.m_PolyOuts.length;i<n;i++){var r=this.m_PolyOuts[i];null===r.Pts||r.IsOpen||(r.IsHole^this.ReverseSolution)==this.Area(r)>0&&this.ReversePolyPtLinks(r.Pts)}this.JoinCommonEdges();for(var i=0,n=this.m_PolyOuts.length;i<n;i++){var r=this.m_PolyOuts[i];null===r.Pts||r.IsOpen||this.FixupOutPolygon(r)}return this.StrictlySimple&&this.DoSimplePolygons(),!0}finally{Kt.Clear(this.m_Joins),Kt.Clear(this.m_GhostJoins)}},Kt.Clipper.prototype.PopScanbeam=function(){var t=this.m_Scanbeam.Y;return this.m_Scanbeam=this.m_Scanbeam.Next,t},Kt.Clipper.prototype.DisposeAllPolyPts=function(){for(var t=0,e=this.m_PolyOuts.length;t<e;++t)this.DisposeOutRec(t);Kt.Clear(this.m_PolyOuts)},Kt.Clipper.prototype.DisposeOutRec=function(t){var e=this.m_PolyOuts[t];e.Pts=null,e=null,this.m_PolyOuts[t]=null},Kt.Clipper.prototype.AddJoin=function(t,e,i){var n=new Kt.Join;n.OutPt1=t,n.OutPt2=e,n.OffPt.X=i.X,n.OffPt.Y=i.Y,Kt.use_xyz&&(n.OffPt.Z=i.Z),this.m_Joins.push(n)},Kt.Clipper.prototype.AddGhostJoin=function(t,e){var i=new Kt.Join;i.OutPt1=t,i.OffPt.X=e.X,i.OffPt.Y=e.Y,Kt.use_xyz&&(i.OffPt.Z=e.Z),this.m_GhostJoins.push(i)},Kt.Clipper.prototype.SetZ=function(t,e,i){if(null!==this.ZFillFunction){if(0!=t.Z||null===this.ZFillFunction)return;Kt.IntPoint.op_Equality(t,e.Bot)?t.Z=e.Bot.Z:Kt.IntPoint.op_Equality(t,e.Top)?t.Z=e.Top.Z:Kt.IntPoint.op_Equality(t,i.Bot)?t.Z=i.Bot.Z:Kt.IntPoint.op_Equality(t,i.Top)?t.Z=i.Top.Z:this.ZFillFunction(e.Bot,e.Top,i.Bot,i.Top,t)}},Kt.Clipper.prototype.InsertLocalMinimaIntoAEL=function(t){for(;null!==this.m_CurrentLM&&this.m_CurrentLM.Y==t;){var e=this.m_CurrentLM.LeftBound,i=this.m_CurrentLM.RightBound;this.PopLocalMinima();var n=null;if(null===e?(this.InsertEdgeIntoAEL(i,null),this.SetWindingCount(i),this.IsContributing(i)&&(n=this.AddOutPt(i,i.Bot))):null==i?(this.InsertEdgeIntoAEL(e,null),this.SetWindingCount(e),this.IsContributing(e)&&(n=this.AddOutPt(e,e.Bot)),this.InsertScanbeam(e.Top.Y)):(this.InsertEdgeIntoAEL(e,null),this.InsertEdgeIntoAEL(i,e),this.SetWindingCount(e),i.WindCnt=e.WindCnt,i.WindCnt2=e.WindCnt2,this.IsContributing(e)&&(n=this.AddLocalMinPoly(e,i,e.Bot)),this.InsertScanbeam(e.Top.Y)),null!=i&&(Kt.ClipperBase.IsHorizontal(i)?this.AddEdgeToSEL(i):this.InsertScanbeam(i.Top.Y)),null!=e&&null!=i){if(null!==n&&Kt.ClipperBase.IsHorizontal(i)&&this.m_GhostJoins.length>0&&0!==i.WindDelta)for(var r=0,o=this.m_GhostJoins.length;r<o;r++){var s=this.m_GhostJoins[r];this.HorzSegmentsOverlap(s.OutPt1.Pt.X,s.OffPt.X,i.Bot.X,i.Top.X)&&this.AddJoin(s.OutPt1,n,s.OffPt)}if(e.OutIdx>=0&&null!==e.PrevInAEL&&e.PrevInAEL.Curr.X==e.Bot.X&&e.PrevInAEL.OutIdx>=0&&Kt.ClipperBase.SlopesEqual(e.PrevInAEL,e,this.m_UseFullRange)&&0!==e.WindDelta&&0!==e.PrevInAEL.WindDelta){var l=this.AddOutPt(e.PrevInAEL,e.Bot);this.AddJoin(n,l,e.Top)}if(e.NextInAEL!=i){if(i.OutIdx>=0&&i.PrevInAEL.OutIdx>=0&&Kt.ClipperBase.SlopesEqual(i.PrevInAEL,i,this.m_UseFullRange)&&0!==i.WindDelta&&0!==i.PrevInAEL.WindDelta){var l=this.AddOutPt(i.PrevInAEL,i.Bot);this.AddJoin(n,l,i.Top)}var p=e.NextInAEL;if(null!==p)for(;p!=i;)this.IntersectEdges(i,p,e.Curr,!1),p=p.NextInAEL}}}},Kt.Clipper.prototype.InsertEdgeIntoAEL=function(t,e){if(null===this.m_ActiveEdges)t.PrevInAEL=null,t.NextInAEL=null,this.m_ActiveEdges=t;else if(null===e&&this.E2InsertsBeforeE1(this.m_ActiveEdges,t))t.PrevInAEL=null,t.NextInAEL=this.m_ActiveEdges,this.m_ActiveEdges.PrevInAEL=t,this.m_ActiveEdges=t;else{for(null===e&&(e=this.m_ActiveEdges);null!==e.NextInAEL&&!this.E2InsertsBeforeE1(e.NextInAEL,t);)e=e.NextInAEL;t.NextInAEL=e.NextInAEL,null!==e.NextInAEL&&(e.NextInAEL.PrevInAEL=t),t.PrevInAEL=e,e.NextInAEL=t}},Kt.Clipper.prototype.E2InsertsBeforeE1=function(t,e){return e.Curr.X==t.Curr.X?e.Top.Y>t.Top.Y?e.Top.X<Kt.Clipper.TopX(t,e.Top.Y):t.Top.X>Kt.Clipper.TopX(e,t.Top.Y):e.Curr.X<t.Curr.X},Kt.Clipper.prototype.IsEvenOddFillType=function(t){return t.PolyTyp==Kt.PolyType.ptSubject?this.m_SubjFillType==Kt.PolyFillType.pftEvenOdd:this.m_ClipFillType==Kt.PolyFillType.pftEvenOdd},Kt.Clipper.prototype.IsEvenOddAltFillType=function(t){return t.PolyTyp==Kt.PolyType.ptSubject?this.m_ClipFillType==Kt.PolyFillType.pftEvenOdd:this.m_SubjFillType==Kt.PolyFillType.pftEvenOdd},Kt.Clipper.prototype.IsContributing=function(t){var e,i;switch(t.PolyTyp==Kt.PolyType.ptSubject?(e=this.m_SubjFillType,i=this.m_ClipFillType):(e=this.m_ClipFillType,i=this.m_SubjFillType),e){case Kt.PolyFillType.pftEvenOdd:if(0===t.WindDelta&&1!=t.WindCnt)return!1;break;case Kt.PolyFillType.pftNonZero:if(1!=Math.abs(t.WindCnt))return!1;break;case Kt.PolyFillType.pftPositive:if(1!=t.WindCnt)return!1;break;default:if(t.WindCnt!=-1)return!1}switch(this.m_ClipType){case Kt.ClipType.ctIntersection:switch(i){case Kt.PolyFillType.pftEvenOdd:case Kt.PolyFillType.pftNonZero:return 0!==t.WindCnt2;case Kt.PolyFillType.pftPositive:return t.WindCnt2>0;default:return t.WindCnt2<0}case Kt.ClipType.ctUnion:switch(i){case Kt.PolyFillType.pftEvenOdd:case Kt.PolyFillType.pftNonZero:return 0===t.WindCnt2;case Kt.PolyFillType.pftPositive:return t.WindCnt2<=0;default:return t.WindCnt2>=0}case Kt.ClipType.ctDifference:if(t.PolyTyp==Kt.PolyType.ptSubject)switch(i){case Kt.PolyFillType.pftEvenOdd:case Kt.PolyFillType.pftNonZero:return 0===t.WindCnt2;case Kt.PolyFillType.pftPositive:return t.WindCnt2<=0;default:return t.WindCnt2>=0}else switch(i){case Kt.PolyFillType.pftEvenOdd:case Kt.PolyFillType.pftNonZero:return 0!==t.WindCnt2;case Kt.PolyFillType.pftPositive:return t.WindCnt2>0;default:return t.WindCnt2<0}case Kt.ClipType.ctXor:if(0!==t.WindDelta)return!0;switch(i){case Kt.PolyFillType.pftEvenOdd:case Kt.PolyFillType.pftNonZero:return 0===t.WindCnt2;case Kt.PolyFillType.pftPositive:return t.WindCnt2<=0;default:return t.WindCnt2>=0}}return!0},Kt.Clipper.prototype.SetWindingCount=function(t){for(var e=t.PrevInAEL;null!==e&&(e.PolyTyp!=t.PolyTyp||0===e.WindDelta);)e=e.PrevInAEL;if(null===e)t.WindCnt=0===t.WindDelta?1:t.WindDelta,t.WindCnt2=0,e=this.m_ActiveEdges;else if(0===t.WindDelta&&this.m_ClipType!=Kt.ClipType.ctUnion)t.WindCnt=1,t.WindCnt2=e.WindCnt2,e=e.NextInAEL;else if(this.IsEvenOddFillType(t)){if(0===t.WindDelta){for(var i=!0,n=e.PrevInAEL;null!==n;)n.PolyTyp==e.PolyTyp&&0!==n.WindDelta&&(i=!i),n=n.PrevInAEL;t.WindCnt=i?0:1}else t.WindCnt=t.WindDelta;t.WindCnt2=e.WindCnt2,e=e.NextInAEL}else e.WindCnt*e.WindDelta<0?Math.abs(e.WindCnt)>1?e.WindDelta*t.WindDelta<0?t.WindCnt=e.WindCnt:t.WindCnt=e.WindCnt+t.WindDelta:t.WindCnt=0===t.WindDelta?1:t.WindDelta:0===t.WindDelta?t.WindCnt=e.WindCnt<0?e.WindCnt-1:e.WindCnt+1:e.WindDelta*t.WindDelta<0?t.WindCnt=e.WindCnt:t.WindCnt=e.WindCnt+t.WindDelta,t.WindCnt2=e.WindCnt2,e=e.NextInAEL;if(this.IsEvenOddAltFillType(t))for(;e!=t;)0!==e.WindDelta&&(t.WindCnt2=0===t.WindCnt2?1:0),e=e.NextInAEL;else for(;e!=t;)t.WindCnt2+=e.WindDelta,e=e.NextInAEL},Kt.Clipper.prototype.AddEdgeToSEL=function(t){null===this.m_SortedEdges?(this.m_SortedEdges=t,t.PrevInSEL=null,t.NextInSEL=null):(t.NextInSEL=this.m_SortedEdges,t.PrevInSEL=null,this.m_SortedEdges.PrevInSEL=t,this.m_SortedEdges=t)},Kt.Clipper.prototype.CopyAELToSEL=function(){var t=this.m_ActiveEdges;for(this.m_SortedEdges=t;null!==t;)t.PrevInSEL=t.PrevInAEL,t.NextInSEL=t.NextInAEL,t=t.NextInAEL},Kt.Clipper.prototype.SwapPositionsInAEL=function(t,e){if(t.NextInAEL!=t.PrevInAEL&&e.NextInAEL!=e.PrevInAEL){if(t.NextInAEL==e){var i=e.NextInAEL;null!==i&&(i.PrevInAEL=t);var n=t.PrevInAEL;null!==n&&(n.NextInAEL=e),e.PrevInAEL=n,e.NextInAEL=t,t.PrevInAEL=e,t.NextInAEL=i}else if(e.NextInAEL==t){var i=t.NextInAEL;null!==i&&(i.PrevInAEL=e);var n=e.PrevInAEL;null!==n&&(n.NextInAEL=t),t.PrevInAEL=n,t.NextInAEL=e,e.PrevInAEL=t,e.NextInAEL=i}else{var i=t.NextInAEL,n=t.PrevInAEL;t.NextInAEL=e.NextInAEL,null!==t.NextInAEL&&(t.NextInAEL.PrevInAEL=t),t.PrevInAEL=e.PrevInAEL,null!==t.PrevInAEL&&(t.PrevInAEL.NextInAEL=t),e.NextInAEL=i,null!==e.NextInAEL&&(e.NextInAEL.PrevInAEL=e),e.PrevInAEL=n,null!==e.PrevInAEL&&(e.PrevInAEL.NextInAEL=e)}null===t.PrevInAEL?this.m_ActiveEdges=t:null===e.PrevInAEL&&(this.m_ActiveEdges=e)}},Kt.Clipper.prototype.SwapPositionsInSEL=function(t,e){if(!(null===t.NextInSEL&&null===t.PrevInSEL||null===e.NextInSEL&&null===e.PrevInSEL)){if(t.NextInSEL==e){var i=e.NextInSEL;null!==i&&(i.PrevInSEL=t);var n=t.PrevInSEL;null!==n&&(n.NextInSEL=e),e.PrevInSEL=n,e.NextInSEL=t,t.PrevInSEL=e,t.NextInSEL=i}else if(e.NextInSEL==t){var i=t.NextInSEL;null!==i&&(i.PrevInSEL=e);var n=e.PrevInSEL;null!==n&&(n.NextInSEL=t),t.PrevInSEL=n,t.NextInSEL=e,e.PrevInSEL=t,e.NextInSEL=i}else{var i=t.NextInSEL,n=t.PrevInSEL;t.NextInSEL=e.NextInSEL,null!==t.NextInSEL&&(t.NextInSEL.PrevInSEL=t),t.PrevInSEL=e.PrevInSEL,null!==t.PrevInSEL&&(t.PrevInSEL.NextInSEL=t),e.NextInSEL=i,null!==e.NextInSEL&&(e.NextInSEL.PrevInSEL=e),e.PrevInSEL=n,null!==e.PrevInSEL&&(e.PrevInSEL.NextInSEL=e)}null===t.PrevInSEL?this.m_SortedEdges=t:null===e.PrevInSEL&&(this.m_SortedEdges=e)}},Kt.Clipper.prototype.AddLocalMaxPoly=function(t,e,i){this.AddOutPt(t,i),0==e.WindDelta&&this.AddOutPt(e,i),t.OutIdx==e.OutIdx?(t.OutIdx=-1,e.OutIdx=-1):t.OutIdx<e.OutIdx?this.AppendPolygon(t,e):this.AppendPolygon(e,t)},Kt.Clipper.prototype.AddLocalMinPoly=function(t,e,i){var n,r,o;if(Kt.ClipperBase.IsHorizontal(e)||t.Dx>e.Dx?(n=this.AddOutPt(t,i),e.OutIdx=t.OutIdx,t.Side=Kt.EdgeSide.esLeft,e.Side=Kt.EdgeSide.esRight,r=t,o=r.PrevInAEL==e?e.PrevInAEL:r.PrevInAEL):(n=this.AddOutPt(e,i),t.OutIdx=e.OutIdx,t.Side=Kt.EdgeSide.esRight,e.Side=Kt.EdgeSide.esLeft,r=e,o=r.PrevInAEL==t?t.PrevInAEL:r.PrevInAEL),null!==o&&o.OutIdx>=0&&Kt.Clipper.TopX(o,i.Y)==Kt.Clipper.TopX(r,i.Y)&&Kt.ClipperBase.SlopesEqual(r,o,this.m_UseFullRange)&&0!==r.WindDelta&&0!==o.WindDelta){var s=this.AddOutPt(o,i);this.AddJoin(n,s,r.Top)}return n},Kt.Clipper.prototype.CreateOutRec=function(){var t=new Kt.OutRec;return t.Idx=-1,t.IsHole=!1,t.IsOpen=!1,t.FirstLeft=null,t.Pts=null,t.BottomPt=null,t.PolyNode=null,this.m_PolyOuts.push(t),t.Idx=this.m_PolyOuts.length-1,t},Kt.Clipper.prototype.AddOutPt=function(t,e){var i=t.Side==Kt.EdgeSide.esLeft;if(t.OutIdx<0){var n=this.CreateOutRec();n.IsOpen=0===t.WindDelta;var r=new Kt.OutPt;return n.Pts=r,r.Idx=n.Idx,r.Pt.X=e.X,r.Pt.Y=e.Y,Kt.use_xyz&&(r.Pt.Z=e.Z),r.Next=r,r.Prev=r,n.IsOpen||this.SetHoleState(t,n),t.OutIdx=n.Idx,r}var n=this.m_PolyOuts[t.OutIdx],o=n.Pts;if(i&&Kt.IntPoint.op_Equality(e,o.Pt))return o;if(!i&&Kt.IntPoint.op_Equality(e,o.Prev.Pt))return o.Prev;var r=new Kt.OutPt;return r.Idx=n.Idx,r.Pt.X=e.X,r.Pt.Y=e.Y,Kt.use_xyz&&(r.Pt.Z=e.Z),r.Next=o,r.Prev=o.Prev,r.Prev.Next=r,o.Prev=r,i&&(n.Pts=r),r},Kt.Clipper.prototype.SwapPoints=function(t,e){var i=new Kt.IntPoint(t.Value);t.Value.X=e.Value.X,t.Value.Y=e.Value.Y,Kt.use_xyz&&(t.Value.Z=e.Value.Z),e.Value.X=i.X,e.Value.Y=i.Y,Kt.use_xyz&&(e.Value.Z=i.Z)},Kt.Clipper.prototype.HorzSegmentsOverlap=function(t,e,i,n){var r;return t>e&&(r=t,t=e,e=r),i>n&&(r=i,i=n,n=r),t<n&&i<e},Kt.Clipper.prototype.SetHoleState=function(t,e){for(var i=!1,n=t.PrevInAEL;null!==n;)n.OutIdx>=0&&0!=n.WindDelta&&(i=!i,null===e.FirstLeft&&(e.FirstLeft=this.m_PolyOuts[n.OutIdx])),n=n.PrevInAEL;i&&(e.IsHole=!0)},Kt.Clipper.prototype.GetDx=function(t,e){return t.Y==e.Y?Kt.ClipperBase.horizontal:(e.X-t.X)/(e.Y-t.Y)},Kt.Clipper.prototype.FirstIsBottomPt=function(t,e){for(var i=t.Prev;Kt.IntPoint.op_Equality(i.Pt,t.Pt)&&i!=t;)i=i.Prev;var n=Math.abs(this.GetDx(t.Pt,i.Pt));for(i=t.Next;Kt.IntPoint.op_Equality(i.Pt,t.Pt)&&i!=t;)i=i.Next;var r=Math.abs(this.GetDx(t.Pt,i.Pt));for(i=e.Prev;Kt.IntPoint.op_Equality(i.Pt,e.Pt)&&i!=e;)i=i.Prev;var o=Math.abs(this.GetDx(e.Pt,i.Pt));for(i=e.Next;Kt.IntPoint.op_Equality(i.Pt,e.Pt)&&i!=e;)i=i.Next;var s=Math.abs(this.GetDx(e.Pt,i.Pt));return n>=o&&n>=s||r>=o&&r>=s},Kt.Clipper.prototype.GetBottomPt=function(t){for(var e=null,i=t.Next;i!=t;)i.Pt.Y>t.Pt.Y?(t=i,e=null):i.Pt.Y==t.Pt.Y&&i.Pt.X<=t.Pt.X&&(i.Pt.X<t.Pt.X?(e=null,t=i):i.Next!=t&&i.Prev!=t&&(e=i)),i=i.Next;if(null!==e)for(;e!=i;)for(this.FirstIsBottomPt(i,e)||(t=e),e=e.Next;Kt.IntPoint.op_Inequality(e.Pt,t.Pt);)e=e.Next;return t},Kt.Clipper.prototype.GetLowermostRec=function(t,e){null===t.BottomPt&&(t.BottomPt=this.GetBottomPt(t.Pts)),null===e.BottomPt&&(e.BottomPt=this.GetBottomPt(e.Pts));var i=t.BottomPt,n=e.BottomPt;return i.Pt.Y>n.Pt.Y?t:i.Pt.Y<n.Pt.Y?e:i.Pt.X<n.Pt.X?t:i.Pt.X>n.Pt.X?e:i.Next==i?e:n.Next==n?t:this.FirstIsBottomPt(i,n)?t:e},Kt.Clipper.prototype.Param1RightOfParam2=function(t,e){do if(t=t.FirstLeft,t==e)return!0;while(null!==t);return!1},Kt.Clipper.prototype.GetOutRec=function(t){for(var e=this.m_PolyOuts[t];e!=this.m_PolyOuts[e.Idx];)e=this.m_PolyOuts[e.Idx];return e},Kt.Clipper.prototype.AppendPolygon=function(t,e){var i,n=this.m_PolyOuts[t.OutIdx],r=this.m_PolyOuts[e.OutIdx];i=this.Param1RightOfParam2(n,r)?r:this.Param1RightOfParam2(r,n)?n:this.GetLowermostRec(n,r);var o,s=n.Pts,l=s.Prev,p=r.Pts,h=p.Prev;t.Side==Kt.EdgeSide.esLeft?(e.Side==Kt.EdgeSide.esLeft?(this.ReversePolyPtLinks(p),p.Next=s,s.Prev=p,l.Next=h,h.Prev=l,n.Pts=h):(h.Next=s,s.Prev=h,p.Prev=l,l.Next=p,n.Pts=p),o=Kt.EdgeSide.esLeft):(e.Side==Kt.EdgeSide.esRight?(this.ReversePolyPtLinks(p),l.Next=h,h.Prev=l,p.Next=s,s.Prev=p):(l.Next=p,p.Prev=l,s.Prev=h,h.Next=s),o=Kt.EdgeSide.esRight),n.BottomPt=null,i==r&&(r.FirstLeft!=n&&(n.FirstLeft=r.FirstLeft),n.IsHole=r.IsHole),r.Pts=null,r.BottomPt=null,r.FirstLeft=n;var u=t.OutIdx,a=e.OutIdx;t.OutIdx=-1,e.OutIdx=-1;for(var f=this.m_ActiveEdges;null!==f;){if(f.OutIdx==a){f.OutIdx=u,f.Side=o;break}f=f.NextInAEL}r.Idx=n.Idx},Kt.Clipper.prototype.ReversePolyPtLinks=function(t){if(null!==t){var e,i;e=t;do i=e.Next,e.Next=e.Prev,e.Prev=i,e=i;while(e!=t)}},Kt.Clipper.SwapSides=function(t,e){var i=t.Side;t.Side=e.Side,e.Side=i},Kt.Clipper.SwapPolyIndexes=function(t,e){var i=t.OutIdx;t.OutIdx=e.OutIdx,e.OutIdx=i},Kt.Clipper.prototype.IntersectEdges=function(t,e,i){var n=t.OutIdx>=0,r=e.OutIdx>=0;if(Kt.use_xyz&&this.SetZ(i,t,e),Kt.use_lines&&(0===t.WindDelta||0===e.WindDelta)){if(0==t.WindDelta&&0==e.WindDelta)return;return void(t.PolyTyp==e.PolyTyp&&t.WindDelta!=e.WindDelta&&this.m_ClipType==Kt.ClipType.ctUnion?0===t.WindDelta?r&&(this.AddOutPt(t,i),n&&(t.OutIdx=-1)):n&&(this.AddOutPt(e,i),r&&(e.OutIdx=-1)):t.PolyTyp!=e.PolyTyp&&(0!==t.WindDelta||1!=Math.abs(e.WindCnt)||this.m_ClipType==Kt.ClipType.ctUnion&&0!==e.WindCnt2?0!==e.WindDelta||1!=Math.abs(t.WindCnt)||this.m_ClipType==Kt.ClipType.ctUnion&&0!==t.WindCnt2||(this.AddOutPt(e,i),r&&(e.OutIdx=-1)):(this.AddOutPt(t,i),n&&(t.OutIdx=-1))))}if(t.PolyTyp==e.PolyTyp)if(this.IsEvenOddFillType(t)){var o=t.WindCnt;t.WindCnt=e.WindCnt,e.WindCnt=o}else t.WindCnt+e.WindDelta===0?t.WindCnt=-t.WindCnt:t.WindCnt+=e.WindDelta,e.WindCnt-t.WindDelta===0?e.WindCnt=-e.WindCnt:e.WindCnt-=t.WindDelta;else this.IsEvenOddFillType(e)?t.WindCnt2=0===t.WindCnt2?1:0:t.WindCnt2+=e.WindDelta,this.IsEvenOddFillType(t)?e.WindCnt2=0===e.WindCnt2?1:0:e.WindCnt2-=t.WindDelta;var s,l,p,h;t.PolyTyp==Kt.PolyType.ptSubject?(s=this.m_SubjFillType,p=this.m_ClipFillType):(s=this.m_ClipFillType,p=this.m_SubjFillType),e.PolyTyp==Kt.PolyType.ptSubject?(l=this.m_SubjFillType,h=this.m_ClipFillType):(l=this.m_ClipFillType,h=this.m_SubjFillType);var u,a;switch(s){case Kt.PolyFillType.pftPositive:u=t.WindCnt;break;case Kt.PolyFillType.pftNegative:u=-t.WindCnt;break;default:u=Math.abs(t.WindCnt)}switch(l){case Kt.PolyFillType.pftPositive:a=e.WindCnt;break;case Kt.PolyFillType.pftNegative:a=-e.WindCnt;break;default:a=Math.abs(e.WindCnt)}if(n&&r)0!=u&&1!=u||0!=a&&1!=a||t.PolyTyp!=e.PolyTyp&&this.m_ClipType!=Kt.ClipType.ctXor?this.AddLocalMaxPoly(t,e,i):(this.AddOutPt(t,i),this.AddOutPt(e,i),Kt.Clipper.SwapSides(t,e),Kt.Clipper.SwapPolyIndexes(t,e));else if(n)0!==a&&1!=a||(this.AddOutPt(t,i),Kt.Clipper.SwapSides(t,e),Kt.Clipper.SwapPolyIndexes(t,e));else if(r)0!==u&&1!=u||(this.AddOutPt(e,i),Kt.Clipper.SwapSides(t,e),Kt.Clipper.SwapPolyIndexes(t,e));else if(!(0!=u&&1!=u||0!=a&&1!=a)){var f,d;switch(p){case Kt.PolyFillType.pftPositive:f=t.WindCnt2;break;case Kt.PolyFillType.pftNegative:f=-t.WindCnt2;break;default:f=Math.abs(t.WindCnt2)}switch(h){case Kt.PolyFillType.pftPositive:d=e.WindCnt2;break;case Kt.PolyFillType.pftNegative:d=-e.WindCnt2;break;default:d=Math.abs(e.WindCnt2)}if(t.PolyTyp!=e.PolyTyp)this.AddLocalMinPoly(t,e,i);else if(1==u&&1==a)switch(this.m_ClipType){case Kt.ClipType.ctIntersection:f>0&&d>0&&this.AddLocalMinPoly(t,e,i);break;case Kt.ClipType.ctUnion:f<=0&&d<=0&&this.AddLocalMinPoly(t,e,i);break;case Kt.ClipType.ctDifference:(t.PolyTyp==Kt.PolyType.ptClip&&f>0&&d>0||t.PolyTyp==Kt.PolyType.ptSubject&&f<=0&&d<=0)&&this.AddLocalMinPoly(t,e,i);break;case Kt.ClipType.ctXor:this.AddLocalMinPoly(t,e,i)}else Kt.Clipper.SwapSides(t,e)}},Kt.Clipper.prototype.DeleteFromAEL=function(t){var e=t.PrevInAEL,i=t.NextInAEL;null===e&&null===i&&t!=this.m_ActiveEdges||(null!==e?e.NextInAEL=i:this.m_ActiveEdges=i,null!==i&&(i.PrevInAEL=e),t.NextInAEL=null,t.PrevInAEL=null)},Kt.Clipper.prototype.DeleteFromSEL=function(t){var e=t.PrevInSEL,i=t.NextInSEL;null===e&&null===i&&t!=this.m_SortedEdges||(null!==e?e.NextInSEL=i:this.m_SortedEdges=i,null!==i&&(i.PrevInSEL=e),t.NextInSEL=null,t.PrevInSEL=null)},Kt.Clipper.prototype.UpdateEdgeIntoAEL=function(t){null===t.NextInLML&&Kt.Error("UpdateEdgeIntoAEL: invalid call");var e=t.PrevInAEL,i=t.NextInAEL;return t.NextInLML.OutIdx=t.OutIdx,null!==e?e.NextInAEL=t.NextInLML:this.m_ActiveEdges=t.NextInLML,null!==i&&(i.PrevInAEL=t.NextInLML),t.NextInLML.Side=t.Side,t.NextInLML.WindDelta=t.WindDelta,t.NextInLML.WindCnt=t.WindCnt,t.NextInLML.WindCnt2=t.WindCnt2,t=t.NextInLML,t.Curr.X=t.Bot.X,t.Curr.Y=t.Bot.Y,Kt.use_xyz&&(t.Curr.Z=t.Bot.Z),t.PrevInAEL=e,t.NextInAEL=i,Kt.ClipperBase.IsHorizontal(t)||this.InsertScanbeam(t.Top.Y),t},Kt.Clipper.prototype.ProcessHorizontals=function(t){for(var e=this.m_SortedEdges;null!==e;)this.DeleteFromSEL(e),this.ProcessHorizontal(e,t),e=this.m_SortedEdges},Kt.Clipper.prototype.GetHorzDirection=function(t,e){t.Bot.X<t.Top.X?(e.Left=t.Bot.X,e.Right=t.Top.X,e.Dir=Kt.Direction.dLeftToRight):(e.Left=t.Top.X,e.Right=t.Bot.X,e.Dir=Kt.Direction.dRightToLeft)},Kt.Clipper.prototype.ProcessHorizontal=function(t,e){var i={Dir:null,Left:null,Right:null};this.GetHorzDirection(t,i);for(var n=i.Dir,r=i.Left,o=i.Right,s=t,l=null;null!==s.NextInLML&&Kt.ClipperBase.IsHorizontal(s.NextInLML);)s=s.NextInLML;for(null===s.NextInLML&&(l=this.GetMaximaPair(s));;){for(var p=t==s,h=this.GetNextInAEL(t,n);null!==h&&!(h.Curr.X==t.Top.X&&null!==t.NextInLML&&h.Dx<t.NextInLML.Dx);){var u=this.GetNextInAEL(h,n);if(n==Kt.Direction.dLeftToRight&&h.Curr.X<=o||n==Kt.Direction.dRightToLeft&&h.Curr.X>=r){if(h==l&&p){if(t.OutIdx>=0){for(var a=this.AddOutPt(t,t.Top),f=this.m_SortedEdges;null!==f;){if(f.OutIdx>=0&&this.HorzSegmentsOverlap(t.Bot.X,t.Top.X,f.Bot.X,f.Top.X)){var d=this.AddOutPt(f,f.Bot);this.AddJoin(d,a,f.Top)}f=f.NextInSEL}this.AddGhostJoin(a,t.Bot),this.AddLocalMaxPoly(t,l,t.Top)}return this.DeleteFromAEL(t),void this.DeleteFromAEL(l)}if(n==Kt.Direction.dLeftToRight){var P=new Kt.IntPoint(h.Curr.X,t.Curr.Y);this.IntersectEdges(t,h,P)}else{var P=new Kt.IntPoint(h.Curr.X,t.Curr.Y);this.IntersectEdges(h,t,P)}this.SwapPositionsInAEL(t,h)}else if(n==Kt.Direction.dLeftToRight&&h.Curr.X>=o||n==Kt.Direction.dRightToLeft&&h.Curr.X<=r)break;h=u}if(null===t.NextInLML||!Kt.ClipperBase.IsHorizontal(t.NextInLML))break;t=this.UpdateEdgeIntoAEL(t),t.OutIdx>=0&&this.AddOutPt(t,t.Bot);var i={Dir:n,Left:r,Right:o};this.GetHorzDirection(t,i),n=i.Dir,r=i.Left,o=i.Right}if(null!==t.NextInLML)if(t.OutIdx>=0){var a=this.AddOutPt(t,t.Top);if(e&&this.AddGhostJoin(a,t.Bot),t=this.UpdateEdgeIntoAEL(t),0===t.WindDelta)return;var m=t.PrevInAEL,u=t.NextInAEL;if(null!==m&&m.Curr.X==t.Bot.X&&m.Curr.Y==t.Bot.Y&&0!==m.WindDelta&&m.OutIdx>=0&&m.Curr.Y>m.Top.Y&&Kt.ClipperBase.SlopesEqual(t,m,this.m_UseFullRange)){var d=this.AddOutPt(m,t.Bot);this.AddJoin(a,d,t.Top)}else if(null!==u&&u.Curr.X==t.Bot.X&&u.Curr.Y==t.Bot.Y&&0!==u.WindDelta&&u.OutIdx>=0&&u.Curr.Y>u.Top.Y&&Kt.ClipperBase.SlopesEqual(t,u,this.m_UseFullRange)){var d=this.AddOutPt(u,t.Bot);this.AddJoin(a,d,t.Top)}}else t=this.UpdateEdgeIntoAEL(t);else t.OutIdx>=0&&this.AddOutPt(t,t.Top),this.DeleteFromAEL(t)},Kt.Clipper.prototype.GetNextInAEL=function(t,e){return e==Kt.Direction.dLeftToRight?t.NextInAEL:t.PrevInAEL},Kt.Clipper.prototype.IsMinima=function(t){return null!==t&&t.Prev.NextInLML!=t&&t.Next.NextInLML!=t},Kt.Clipper.prototype.IsMaxima=function(t,e){return null!==t&&t.Top.Y==e&&null===t.NextInLML},Kt.Clipper.prototype.IsIntermediate=function(t,e){return t.Top.Y==e&&null!==t.NextInLML},Kt.Clipper.prototype.GetMaximaPair=function(t){var e=null;return Kt.IntPoint.op_Equality(t.Next.Top,t.Top)&&null===t.Next.NextInLML?e=t.Next:Kt.IntPoint.op_Equality(t.Prev.Top,t.Top)&&null===t.Prev.NextInLML&&(e=t.Prev),null===e||e.OutIdx!=-2&&(e.NextInAEL!=e.PrevInAEL||Kt.ClipperBase.IsHorizontal(e))?e:null},Kt.Clipper.prototype.ProcessIntersections=function(t){if(null==this.m_ActiveEdges)return!0;try{if(this.BuildIntersectList(t),0==this.m_IntersectList.length)return!0;if(1!=this.m_IntersectList.length&&!this.FixupIntersectionOrder())return!1;this.ProcessIntersectList()}catch(t){this.m_SortedEdges=null,this.m_IntersectList.length=0,Kt.Error("ProcessIntersections error")}return this.m_SortedEdges=null,!0},Kt.Clipper.prototype.BuildIntersectList=function(t){if(null!==this.m_ActiveEdges){var e=this.m_ActiveEdges;for(this.m_SortedEdges=e;null!==e;)e.PrevInSEL=e.PrevInAEL,e.NextInSEL=e.NextInAEL,e.Curr.X=Kt.Clipper.TopX(e,t),e=e.NextInAEL;for(var i=!0;i&&null!==this.m_SortedEdges;){for(i=!1,e=this.m_SortedEdges;null!==e.NextInSEL;){var n=e.NextInSEL,r=new Kt.IntPoint;if(e.Curr.X>n.Curr.X){this.IntersectPoint(e,n,r);var o=new Kt.IntersectNode;o.Edge1=e,o.Edge2=n,o.Pt.X=r.X,o.Pt.Y=r.Y,Kt.use_xyz&&(o.Pt.Z=r.Z),this.m_IntersectList.push(o),this.SwapPositionsInSEL(e,n),i=!0}else e=n}if(null===e.PrevInSEL)break;e.PrevInSEL.NextInSEL=null}this.m_SortedEdges=null}},Kt.Clipper.prototype.EdgesAdjacent=function(t){return t.Edge1.NextInSEL==t.Edge2||t.Edge1.PrevInSEL==t.Edge2},Kt.Clipper.IntersectNodeSort=function(t,e){return e.Pt.Y-t.Pt.Y},Kt.Clipper.prototype.FixupIntersectionOrder=function(){this.m_IntersectList.sort(this.m_IntersectNodeComparer),this.CopyAELToSEL();for(var t=this.m_IntersectList.length,e=0;e<t;e++){if(!this.EdgesAdjacent(this.m_IntersectList[e])){for(var i=e+1;i<t&&!this.EdgesAdjacent(this.m_IntersectList[i]);)i++;if(i==t)return!1;var n=this.m_IntersectList[e];this.m_IntersectList[e]=this.m_IntersectList[i],this.m_IntersectList[i]=n}this.SwapPositionsInSEL(this.m_IntersectList[e].Edge1,this.m_IntersectList[e].Edge2)}return!0},Kt.Clipper.prototype.ProcessIntersectList=function(){for(var t=0,e=this.m_IntersectList.length;t<e;t++){var i=this.m_IntersectList[t];this.IntersectEdges(i.Edge1,i.Edge2,i.Pt),this.SwapPositionsInAEL(i.Edge1,i.Edge2)}this.m_IntersectList.length=0};var me=function(t){return t<0?Math.ceil(t-.5):Math.round(t)},ye=function(t){return t<0?Math.ceil(t-.5):Math.floor(t+.5)},ce=function(t){return t<0?-Math.round(Math.abs(t)):Math.round(t)},ve=function(t){return t<0?(t-=.5,t<-2147483648?Math.ceil(t):0|t):(t+=.5,t>2147483647?Math.floor(t):0|t)};ie.msie?Kt.Clipper.Round=me:ie.chromium?Kt.Clipper.Round=ce:ie.safari?Kt.Clipper.Round=ve:Kt.Clipper.Round=ye,Kt.Clipper.TopX=function(t,e){return e==t.Top.Y?t.Top.X:t.Bot.X+Kt.Clipper.Round(t.Dx*(e-t.Bot.Y))},Kt.Clipper.prototype.IntersectPoint=function(t,e,i){i.X=0,i.Y=0;var n,r;if(t.Dx==e.Dx)return i.Y=t.Curr.Y,void(i.X=Kt.Clipper.TopX(t,i.Y));if(0===t.Delta.X)i.X=t.Bot.X,Kt.ClipperBase.IsHorizontal(e)?i.Y=e.Bot.Y:(r=e.Bot.Y-e.Bot.X/e.Dx,
+i.Y=Kt.Clipper.Round(i.X/e.Dx+r));else if(0===e.Delta.X)i.X=e.Bot.X,Kt.ClipperBase.IsHorizontal(t)?i.Y=t.Bot.Y:(n=t.Bot.Y-t.Bot.X/t.Dx,i.Y=Kt.Clipper.Round(i.X/t.Dx+n));else{n=t.Bot.X-t.Bot.Y*t.Dx,r=e.Bot.X-e.Bot.Y*e.Dx;var o=(r-n)/(t.Dx-e.Dx);i.Y=Kt.Clipper.Round(o),Math.abs(t.Dx)<Math.abs(e.Dx)?i.X=Kt.Clipper.Round(t.Dx*o+n):i.X=Kt.Clipper.Round(e.Dx*o+r)}if(i.Y<t.Top.Y||i.Y<e.Top.Y){if(t.Top.Y>e.Top.Y)return i.Y=t.Top.Y,i.X=Kt.Clipper.TopX(e,t.Top.Y),i.X<t.Top.X;i.Y=e.Top.Y,Math.abs(t.Dx)<Math.abs(e.Dx)?i.X=Kt.Clipper.TopX(t,i.Y):i.X=Kt.Clipper.TopX(e,i.Y)}i.Y>t.Curr.Y&&(i.Y=t.Curr.Y,Math.abs(t.Dx)>Math.abs(e.Dx)?i.X=Kt.Clipper.TopX(e,i.Y):i.X=Kt.Clipper.TopX(t,i.Y))},Kt.Clipper.prototype.ProcessEdgesAtTopOfScanbeam=function(t){for(var e=this.m_ActiveEdges;null!==e;){var i=this.IsMaxima(e,t);if(i){var n=this.GetMaximaPair(e);i=null===n||!Kt.ClipperBase.IsHorizontal(n)}if(i){var r=e.PrevInAEL;this.DoMaxima(e),e=null===r?this.m_ActiveEdges:r.NextInAEL}else{if(this.IsIntermediate(e,t)&&Kt.ClipperBase.IsHorizontal(e.NextInLML)?(e=this.UpdateEdgeIntoAEL(e),e.OutIdx>=0&&this.AddOutPt(e,e.Bot),this.AddEdgeToSEL(e)):(e.Curr.X=Kt.Clipper.TopX(e,t),e.Curr.Y=t),this.StrictlySimple){var r=e.PrevInAEL;if(e.OutIdx>=0&&0!==e.WindDelta&&null!==r&&r.OutIdx>=0&&r.Curr.X==e.Curr.X&&0!==r.WindDelta){var o=new Kt.IntPoint(e.Curr);Kt.use_xyz&&this.SetZ(o,r,e);var s=this.AddOutPt(r,o),l=this.AddOutPt(e,o);this.AddJoin(s,l,o)}}e=e.NextInAEL}}for(this.ProcessHorizontals(!0),e=this.m_ActiveEdges;null!==e;){if(this.IsIntermediate(e,t)){var s=null;e.OutIdx>=0&&(s=this.AddOutPt(e,e.Top)),e=this.UpdateEdgeIntoAEL(e);var r=e.PrevInAEL,p=e.NextInAEL;if(null!==r&&r.Curr.X==e.Bot.X&&r.Curr.Y==e.Bot.Y&&null!==s&&r.OutIdx>=0&&r.Curr.Y>r.Top.Y&&Kt.ClipperBase.SlopesEqual(e,r,this.m_UseFullRange)&&0!==e.WindDelta&&0!==r.WindDelta){var l=this.AddOutPt(r,e.Bot);this.AddJoin(s,l,e.Top)}else if(null!==p&&p.Curr.X==e.Bot.X&&p.Curr.Y==e.Bot.Y&&null!==s&&p.OutIdx>=0&&p.Curr.Y>p.Top.Y&&Kt.ClipperBase.SlopesEqual(e,p,this.m_UseFullRange)&&0!==e.WindDelta&&0!==p.WindDelta){var l=this.AddOutPt(p,e.Bot);this.AddJoin(s,l,e.Top)}}e=e.NextInAEL}},Kt.Clipper.prototype.DoMaxima=function(t){var e=this.GetMaximaPair(t);if(null===e)return t.OutIdx>=0&&this.AddOutPt(t,t.Top),void this.DeleteFromAEL(t);for(var i=t.NextInAEL;null!==i&&i!=e;)this.IntersectEdges(t,i,t.Top),this.SwapPositionsInAEL(t,i),i=t.NextInAEL;t.OutIdx==-1&&e.OutIdx==-1?(this.DeleteFromAEL(t),this.DeleteFromAEL(e)):t.OutIdx>=0&&e.OutIdx>=0?(t.OutIdx>=0&&this.AddLocalMaxPoly(t,e,t.Top),this.DeleteFromAEL(t),this.DeleteFromAEL(e)):Kt.use_lines&&0===t.WindDelta?(t.OutIdx>=0&&(this.AddOutPt(t,t.Top),t.OutIdx=-1),this.DeleteFromAEL(t),e.OutIdx>=0&&(this.AddOutPt(e,t.Top),e.OutIdx=-1),this.DeleteFromAEL(e)):Kt.Error("DoMaxima error")},Kt.Clipper.ReversePaths=function(t){for(var e=0,i=t.length;e<i;e++)t[e].reverse()},Kt.Clipper.Orientation=function(t){return Kt.Clipper.Area(t)>=0},Kt.Clipper.prototype.PointCount=function(t){if(null===t)return 0;var e=0,i=t;do e++,i=i.Next;while(i!=t);return e},Kt.Clipper.prototype.BuildResult=function(t){Kt.Clear(t);for(var e=0,i=this.m_PolyOuts.length;e<i;e++){var n=this.m_PolyOuts[e];if(null!==n.Pts){var r=n.Pts.Prev,o=this.PointCount(r);if(!(o<2)){for(var s=new Array(o),l=0;l<o;l++)s[l]=r.Pt,r=r.Prev;t.push(s)}}}},Kt.Clipper.prototype.BuildResult2=function(t){t.Clear();for(var e=0,i=this.m_PolyOuts.length;e<i;e++){var n=this.m_PolyOuts[e],r=this.PointCount(n.Pts);if(!(n.IsOpen&&r<2||!n.IsOpen&&r<3)){this.FixHoleLinkage(n);var o=new Kt.PolyNode;t.m_AllPolys.push(o),n.PolyNode=o,o.m_polygon.length=r;for(var s=n.Pts.Prev,l=0;l<r;l++)o.m_polygon[l]=s.Pt,s=s.Prev}}for(var e=0,i=this.m_PolyOuts.length;e<i;e++){var n=this.m_PolyOuts[e];null!==n.PolyNode&&(n.IsOpen?(n.PolyNode.IsOpen=!0,t.AddChild(n.PolyNode)):null!==n.FirstLeft&&null!=n.FirstLeft.PolyNode?n.FirstLeft.PolyNode.AddChild(n.PolyNode):t.AddChild(n.PolyNode))}},Kt.Clipper.prototype.FixupOutPolygon=function(t){var e=null;t.BottomPt=null;for(var i=t.Pts;;){if(i.Prev==i||i.Prev==i.Next)return void(t.Pts=null);if(Kt.IntPoint.op_Equality(i.Pt,i.Next.Pt)||Kt.IntPoint.op_Equality(i.Pt,i.Prev.Pt)||Kt.ClipperBase.SlopesEqual(i.Prev.Pt,i.Pt,i.Next.Pt,this.m_UseFullRange)&&(!this.PreserveCollinear||!this.Pt2IsBetweenPt1AndPt3(i.Prev.Pt,i.Pt,i.Next.Pt)))e=null,i.Prev.Next=i.Next,i.Next.Prev=i.Prev,i=i.Prev;else{if(i==e)break;null===e&&(e=i),i=i.Next}}t.Pts=i},Kt.Clipper.prototype.DupOutPt=function(t,e){var i=new Kt.OutPt;return i.Pt.X=t.Pt.X,i.Pt.Y=t.Pt.Y,Kt.use_xyz&&(i.Pt.Z=t.Pt.Z),i.Idx=t.Idx,e?(i.Next=t.Next,i.Prev=t,t.Next.Prev=i,t.Next=i):(i.Prev=t.Prev,i.Next=t,t.Prev.Next=i,t.Prev=i),i},Kt.Clipper.prototype.GetOverlap=function(t,e,i,n,r){return t<e?i<n?(r.Left=Math.max(t,i),r.Right=Math.min(e,n)):(r.Left=Math.max(t,n),r.Right=Math.min(e,i)):i<n?(r.Left=Math.max(e,i),r.Right=Math.min(t,n)):(r.Left=Math.max(e,n),r.Right=Math.min(t,i)),r.Left<r.Right},Kt.Clipper.prototype.JoinHorz=function(t,e,i,n,r,o){var s=t.Pt.X>e.Pt.X?Kt.Direction.dRightToLeft:Kt.Direction.dLeftToRight,l=i.Pt.X>n.Pt.X?Kt.Direction.dRightToLeft:Kt.Direction.dLeftToRight;if(s==l)return!1;if(s==Kt.Direction.dLeftToRight){for(;t.Next.Pt.X<=r.X&&t.Next.Pt.X>=t.Pt.X&&t.Next.Pt.Y==r.Y;)t=t.Next;o&&t.Pt.X!=r.X&&(t=t.Next),e=this.DupOutPt(t,!o),Kt.IntPoint.op_Inequality(e.Pt,r)&&(t=e,t.Pt.X=r.X,t.Pt.Y=r.Y,Kt.use_xyz&&(t.Pt.Z=r.Z),e=this.DupOutPt(t,!o))}else{for(;t.Next.Pt.X>=r.X&&t.Next.Pt.X<=t.Pt.X&&t.Next.Pt.Y==r.Y;)t=t.Next;o||t.Pt.X==r.X||(t=t.Next),e=this.DupOutPt(t,o),Kt.IntPoint.op_Inequality(e.Pt,r)&&(t=e,t.Pt.X=r.X,t.Pt.Y=r.Y,Kt.use_xyz&&(t.Pt.Z=r.Z),e=this.DupOutPt(t,o))}if(l==Kt.Direction.dLeftToRight){for(;i.Next.Pt.X<=r.X&&i.Next.Pt.X>=i.Pt.X&&i.Next.Pt.Y==r.Y;)i=i.Next;o&&i.Pt.X!=r.X&&(i=i.Next),n=this.DupOutPt(i,!o),Kt.IntPoint.op_Inequality(n.Pt,r)&&(i=n,i.Pt.X=r.X,i.Pt.Y=r.Y,Kt.use_xyz&&(i.Pt.Z=r.Z),n=this.DupOutPt(i,!o))}else{for(;i.Next.Pt.X>=r.X&&i.Next.Pt.X<=i.Pt.X&&i.Next.Pt.Y==r.Y;)i=i.Next;o||i.Pt.X==r.X||(i=i.Next),n=this.DupOutPt(i,o),Kt.IntPoint.op_Inequality(n.Pt,r)&&(i=n,i.Pt.X=r.X,i.Pt.Y=r.Y,Kt.use_xyz&&(i.Pt.Z=r.Z),n=this.DupOutPt(i,o))}return s==Kt.Direction.dLeftToRight==o?(t.Prev=i,i.Next=t,e.Next=n,n.Prev=e):(t.Next=i,i.Prev=t,e.Prev=n,n.Next=e),!0},Kt.Clipper.prototype.JoinPoints=function(t,e,i){var n=t.OutPt1,r=new Kt.OutPt,o=t.OutPt2,s=new Kt.OutPt,l=t.OutPt1.Pt.Y==t.OffPt.Y;if(l&&Kt.IntPoint.op_Equality(t.OffPt,t.OutPt1.Pt)&&Kt.IntPoint.op_Equality(t.OffPt,t.OutPt2.Pt)){if(e!=i)return!1;for(r=t.OutPt1.Next;r!=n&&Kt.IntPoint.op_Equality(r.Pt,t.OffPt);)r=r.Next;var p=r.Pt.Y>t.OffPt.Y;for(s=t.OutPt2.Next;s!=o&&Kt.IntPoint.op_Equality(s.Pt,t.OffPt);)s=s.Next;var h=s.Pt.Y>t.OffPt.Y;return p!=h&&(p?(r=this.DupOutPt(n,!1),s=this.DupOutPt(o,!0),n.Prev=o,o.Next=n,r.Next=s,s.Prev=r,t.OutPt1=n,t.OutPt2=r,!0):(r=this.DupOutPt(n,!0),s=this.DupOutPt(o,!1),n.Next=o,o.Prev=n,r.Prev=s,s.Next=r,t.OutPt1=n,t.OutPt2=r,!0))}if(l){for(r=n;n.Prev.Pt.Y==n.Pt.Y&&n.Prev!=r&&n.Prev!=o;)n=n.Prev;for(;r.Next.Pt.Y==r.Pt.Y&&r.Next!=n&&r.Next!=o;)r=r.Next;if(r.Next==n||r.Next==o)return!1;for(s=o;o.Prev.Pt.Y==o.Pt.Y&&o.Prev!=s&&o.Prev!=r;)o=o.Prev;for(;s.Next.Pt.Y==s.Pt.Y&&s.Next!=o&&s.Next!=n;)s=s.Next;if(s.Next==o||s.Next==n)return!1;var u={Left:null,Right:null};if(!this.GetOverlap(n.Pt.X,r.Pt.X,o.Pt.X,s.Pt.X,u))return!1;var a,f=u.Left,d=u.Right,P=new Kt.IntPoint;return n.Pt.X>=f&&n.Pt.X<=d?(P.X=n.Pt.X,P.Y=n.Pt.Y,Kt.use_xyz&&(P.Z=n.Pt.Z),a=n.Pt.X>r.Pt.X):o.Pt.X>=f&&o.Pt.X<=d?(P.X=o.Pt.X,P.Y=o.Pt.Y,Kt.use_xyz&&(P.Z=o.Pt.Z),a=o.Pt.X>s.Pt.X):r.Pt.X>=f&&r.Pt.X<=d?(P.X=r.Pt.X,P.Y=r.Pt.Y,Kt.use_xyz&&(P.Z=r.Pt.Z),a=r.Pt.X>n.Pt.X):(P.X=s.Pt.X,P.Y=s.Pt.Y,Kt.use_xyz&&(P.Z=s.Pt.Z),a=s.Pt.X>o.Pt.X),t.OutPt1=n,t.OutPt2=o,this.JoinHorz(n,r,o,s,P,a)}for(r=n.Next;Kt.IntPoint.op_Equality(r.Pt,n.Pt)&&r!=n;)r=r.Next;var m=r.Pt.Y>n.Pt.Y||!Kt.ClipperBase.SlopesEqual(n.Pt,r.Pt,t.OffPt,this.m_UseFullRange);if(m){for(r=n.Prev;Kt.IntPoint.op_Equality(r.Pt,n.Pt)&&r!=n;)r=r.Prev;if(r.Pt.Y>n.Pt.Y||!Kt.ClipperBase.SlopesEqual(n.Pt,r.Pt,t.OffPt,this.m_UseFullRange))return!1}for(s=o.Next;Kt.IntPoint.op_Equality(s.Pt,o.Pt)&&s!=o;)s=s.Next;var y=s.Pt.Y>o.Pt.Y||!Kt.ClipperBase.SlopesEqual(o.Pt,s.Pt,t.OffPt,this.m_UseFullRange);if(y){for(s=o.Prev;Kt.IntPoint.op_Equality(s.Pt,o.Pt)&&s!=o;)s=s.Prev;if(s.Pt.Y>o.Pt.Y||!Kt.ClipperBase.SlopesEqual(o.Pt,s.Pt,t.OffPt,this.m_UseFullRange))return!1}return r!=n&&s!=o&&r!=s&&(e!=i||m!=y)&&(m?(r=this.DupOutPt(n,!1),s=this.DupOutPt(o,!0),n.Prev=o,o.Next=n,r.Next=s,s.Prev=r,t.OutPt1=n,t.OutPt2=r,!0):(r=this.DupOutPt(n,!0),s=this.DupOutPt(o,!1),n.Next=o,o.Prev=n,r.Prev=s,s.Next=r,t.OutPt1=n,t.OutPt2=r,!0))},Kt.Clipper.GetBounds=function(t){for(var e=0,i=t.length;e<i&&0==t[e].length;)e++;if(e==i)return new Kt.IntRect(0,0,0,0);var n=new Kt.IntRect;for(n.left=t[e][0].X,n.right=n.left,n.top=t[e][0].Y,n.bottom=n.top;e<i;e++)for(var r=0,o=t[e].length;r<o;r++)t[e][r].X<n.left?n.left=t[e][r].X:t[e][r].X>n.right&&(n.right=t[e][r].X),t[e][r].Y<n.top?n.top=t[e][r].Y:t[e][r].Y>n.bottom&&(n.bottom=t[e][r].Y);return n},Kt.Clipper.prototype.GetBounds2=function(t){var e=t,i=new Kt.IntRect;for(i.left=t.Pt.X,i.right=t.Pt.X,i.top=t.Pt.Y,i.bottom=t.Pt.Y,t=t.Next;t!=e;)t.Pt.X<i.left&&(i.left=t.Pt.X),t.Pt.X>i.right&&(i.right=t.Pt.X),t.Pt.Y<i.top&&(i.top=t.Pt.Y),t.Pt.Y>i.bottom&&(i.bottom=t.Pt.Y),t=t.Next;return i},Kt.Clipper.PointInPolygon=function(t,e){var i=0,n=e.length;if(n<3)return 0;for(var r=e[0],o=1;o<=n;++o){var s=o==n?e[0]:e[o];if(s.Y==t.Y&&(s.X==t.X||r.Y==t.Y&&s.X>t.X==r.X<t.X))return-1;if(r.Y<t.Y!=s.Y<t.Y)if(r.X>=t.X)if(s.X>t.X)i=1-i;else{var l=(r.X-t.X)*(s.Y-t.Y)-(s.X-t.X)*(r.Y-t.Y);if(0==l)return-1;l>0==s.Y>r.Y&&(i=1-i)}else if(s.X>t.X){var l=(r.X-t.X)*(s.Y-t.Y)-(s.X-t.X)*(r.Y-t.Y);if(0==l)return-1;l>0==s.Y>r.Y&&(i=1-i)}r=s}return i},Kt.Clipper.prototype.PointInPolygon=function(t,e){var i=0,n=e,r=t.X,o=t.Y,s=e.Pt.X,l=e.Pt.Y;do{e=e.Next;var p=e.Pt.X,h=e.Pt.Y;if(h==o&&(p==r||l==o&&p>r==s<r))return-1;if(l<o!=h<o)if(s>=r)if(p>r)i=1-i;else{var u=(s-r)*(h-o)-(p-r)*(l-o);if(0==u)return-1;u>0==h>l&&(i=1-i)}else if(p>r){var u=(s-r)*(h-o)-(p-r)*(l-o);if(0==u)return-1;u>0==h>l&&(i=1-i)}s=p,l=h}while(n!=e);return i},Kt.Clipper.prototype.Poly2ContainsPoly1=function(t,e){var i=t;do{var n=this.PointInPolygon(i.Pt,e);if(n>=0)return n>0;i=i.Next}while(i!=t);return!0},Kt.Clipper.prototype.FixupFirstLefts1=function(t,e){for(var i=0,n=this.m_PolyOuts.length;i<n;i++){var r=this.m_PolyOuts[i];if(null!=r.Pts&&null!=r.FirstLeft){var o=this.ParseFirstLeft(r.FirstLeft);o==t&&this.Poly2ContainsPoly1(r.Pts,e.Pts)&&(r.FirstLeft=e)}}},Kt.Clipper.prototype.FixupFirstLefts2=function(t,e){for(var i=0,n=this.m_PolyOuts,r=n.length,o=n[i];i<r;i++,o=n[i])o.FirstLeft==t&&(o.FirstLeft=e)},Kt.Clipper.ParseFirstLeft=function(t){for(;null!=t&&null==t.Pts;)t=t.FirstLeft;return t},Kt.Clipper.prototype.JoinCommonEdges=function(){for(var t=0,e=this.m_Joins.length;t<e;t++){var i=this.m_Joins[t],n=this.GetOutRec(i.OutPt1.Idx),r=this.GetOutRec(i.OutPt2.Idx);if(null!=n.Pts&&null!=r.Pts){var o;if(o=n==r?n:this.Param1RightOfParam2(n,r)?r:this.Param1RightOfParam2(r,n)?n:this.GetLowermostRec(n,r),this.JoinPoints(i,n,r))if(n==r){if(n.Pts=i.OutPt1,n.BottomPt=null,r=this.CreateOutRec(),r.Pts=i.OutPt2,this.UpdateOutPtIdxs(r),this.m_UsingPolyTree)for(var s=0,l=this.m_PolyOuts.length;s<l-1;s++){var p=this.m_PolyOuts[s];null!=p.Pts&&Kt.Clipper.ParseFirstLeft(p.FirstLeft)==n&&p.IsHole!=n.IsHole&&this.Poly2ContainsPoly1(p.Pts,i.OutPt2)&&(p.FirstLeft=r)}this.Poly2ContainsPoly1(r.Pts,n.Pts)?(r.IsHole=!n.IsHole,r.FirstLeft=n,this.m_UsingPolyTree&&this.FixupFirstLefts2(r,n),(r.IsHole^this.ReverseSolution)==this.Area(r)>0&&this.ReversePolyPtLinks(r.Pts)):this.Poly2ContainsPoly1(n.Pts,r.Pts)?(r.IsHole=n.IsHole,n.IsHole=!r.IsHole,r.FirstLeft=n.FirstLeft,n.FirstLeft=r,this.m_UsingPolyTree&&this.FixupFirstLefts2(n,r),(n.IsHole^this.ReverseSolution)==this.Area(n)>0&&this.ReversePolyPtLinks(n.Pts)):(r.IsHole=n.IsHole,r.FirstLeft=n.FirstLeft,this.m_UsingPolyTree&&this.FixupFirstLefts1(n,r))}else r.Pts=null,r.BottomPt=null,r.Idx=n.Idx,n.IsHole=o.IsHole,o==r&&(n.FirstLeft=r.FirstLeft),r.FirstLeft=n,this.m_UsingPolyTree&&this.FixupFirstLefts2(r,n)}}},Kt.Clipper.prototype.UpdateOutPtIdxs=function(t){var e=t.Pts;do e.Idx=t.Idx,e=e.Prev;while(e!=t.Pts)},Kt.Clipper.prototype.DoSimplePolygons=function(){for(var t=0;t<this.m_PolyOuts.length;){var e=this.m_PolyOuts[t++],i=e.Pts;if(null!=i&&!e.IsOpen)do{for(var n=i.Next;n!=e.Pts;){if(Kt.IntPoint.op_Equality(i.Pt,n.Pt)&&n.Next!=i&&n.Prev!=i){var r=i.Prev,o=n.Prev;i.Prev=o,o.Next=i,n.Prev=r,r.Next=n,e.Pts=i;var s=this.CreateOutRec();s.Pts=n,this.UpdateOutPtIdxs(s),this.Poly2ContainsPoly1(s.Pts,e.Pts)?(s.IsHole=!e.IsHole,s.FirstLeft=e,this.m_UsingPolyTree&&this.FixupFirstLefts2(s,e)):this.Poly2ContainsPoly1(e.Pts,s.Pts)?(s.IsHole=e.IsHole,e.IsHole=!s.IsHole,s.FirstLeft=e.FirstLeft,e.FirstLeft=s,this.m_UsingPolyTree&&this.FixupFirstLefts2(e,s)):(s.IsHole=e.IsHole,s.FirstLeft=e.FirstLeft,this.m_UsingPolyTree&&this.FixupFirstLefts1(e,s)),n=i}n=n.Next}i=i.Next}while(i!=e.Pts)}},Kt.Clipper.Area=function(t){var e=t.length;if(e<3)return 0;for(var i=0,n=0,r=e-1;n<e;++n)i+=(t[r].X+t[n].X)*(t[r].Y-t[n].Y),r=n;return.5*-i},Kt.Clipper.prototype.Area=function(t){var e=t.Pts;if(null==e)return 0;var i=0;do i+=(e.Prev.Pt.X+e.Pt.X)*(e.Prev.Pt.Y-e.Pt.Y),e=e.Next;while(e!=t.Pts);return.5*i},Kt.Clipper.SimplifyPolygon=function(t,e){var i=new Array,n=new Kt.Clipper(0);return n.StrictlySimple=!0,n.AddPath(t,Kt.PolyType.ptSubject,!0),n.Execute(Kt.ClipType.ctUnion,i,e,e),i},Kt.Clipper.SimplifyPolygons=function(t,e){"undefined"==typeof e&&(e=Kt.PolyFillType.pftEvenOdd);var i=new Array,n=new Kt.Clipper(0);return n.StrictlySimple=!0,n.AddPaths(t,Kt.PolyType.ptSubject,!0),n.Execute(Kt.ClipType.ctUnion,i,e,e),i},Kt.Clipper.DistanceSqrd=function(t,e){var i=t.X-e.X,n=t.Y-e.Y;return i*i+n*n},Kt.Clipper.DistanceFromLineSqrd=function(t,e,i){var n=e.Y-i.Y,r=i.X-e.X,o=n*e.X+r*e.Y;return o=n*t.X+r*t.Y-o,o*o/(n*n+r*r)},Kt.Clipper.SlopesNearCollinear=function(t,e,i,n){return Math.abs(t.X-e.X)>Math.abs(t.Y-e.Y)?t.X>e.X==t.X<i.X?Kt.Clipper.DistanceFromLineSqrd(t,e,i)<n:e.X>t.X==e.X<i.X?Kt.Clipper.DistanceFromLineSqrd(e,t,i)<n:Kt.Clipper.DistanceFromLineSqrd(i,t,e)<n:t.Y>e.Y==t.Y<i.Y?Kt.Clipper.DistanceFromLineSqrd(t,e,i)<n:e.Y>t.Y==e.Y<i.Y?Kt.Clipper.DistanceFromLineSqrd(e,t,i)<n:Kt.Clipper.DistanceFromLineSqrd(i,t,e)<n},Kt.Clipper.PointsAreClose=function(t,e,i){var n=t.X-e.X,r=t.Y-e.Y;return n*n+r*r<=i},Kt.Clipper.ExcludeOp=function(t){var e=t.Prev;return e.Next=t.Next,t.Next.Prev=e,e.Idx=0,e},Kt.Clipper.CleanPolygon=function(t,e){"undefined"==typeof e&&(e=1.415);var i=t.length;if(0==i)return new Array;for(var n=new Array(i),r=0;r<i;++r)n[r]=new Kt.OutPt;for(var r=0;r<i;++r)n[r].Pt=t[r],n[r].Next=n[(r+1)%i],n[r].Next.Prev=n[r],n[r].Idx=0;for(var o=e*e,s=n[0];0==s.Idx&&s.Next!=s.Prev;)Kt.Clipper.PointsAreClose(s.Pt,s.Prev.Pt,o)?(s=Kt.Clipper.ExcludeOp(s),i--):Kt.Clipper.PointsAreClose(s.Prev.Pt,s.Next.Pt,o)?(Kt.Clipper.ExcludeOp(s.Next),s=Kt.Clipper.ExcludeOp(s),i-=2):Kt.Clipper.SlopesNearCollinear(s.Prev.Pt,s.Pt,s.Next.Pt,o)?(s=Kt.Clipper.ExcludeOp(s),i--):(s.Idx=1,s=s.Next);i<3&&(i=0);for(var l=new Array(i),r=0;r<i;++r)l[r]=new Kt.IntPoint(s.Pt),s=s.Next;return n=null,l},Kt.Clipper.CleanPolygons=function(t,e){for(var i=new Array(t.length),n=0,r=t.length;n<r;n++)i[n]=Kt.Clipper.CleanPolygon(t[n],e);return i},Kt.Clipper.Minkowski=function(t,e,i,n){var r=n?1:0,o=t.length,s=e.length,l=new Array;if(i)for(var p=0;p<s;p++){for(var h=new Array(o),u=0,a=t.length,f=t[u];u<a;u++,f=t[u])h[u]=new Kt.IntPoint(e[p].X+f.X,e[p].Y+f.Y);l.push(h)}else for(var p=0;p<s;p++){for(var h=new Array(o),u=0,a=t.length,f=t[u];u<a;u++,f=t[u])h[u]=new Kt.IntPoint(e[p].X-f.X,e[p].Y-f.Y);l.push(h)}for(var d=new Array,p=0;p<s-1+r;p++)for(var u=0;u<o;u++){var P=new Array;P.push(l[p%s][u%o]),P.push(l[(p+1)%s][u%o]),P.push(l[(p+1)%s][(u+1)%o]),P.push(l[p%s][(u+1)%o]),Kt.Clipper.Orientation(P)||P.reverse(),d.push(P)}return d},Kt.Clipper.MinkowskiSum=function(t,e,i){if(e[0]instanceof Array){for(var n=e,r=new Kt.Paths,o=new Kt.Clipper,s=0;s<n.length;++s){var l=Kt.Clipper.Minkowski(t,n[s],!0,i);if(o.AddPaths(l,Kt.PolyType.ptSubject,!0),i){var p=Kt.Clipper.TranslatePath(n[s],t[0]);o.AddPath(p,Kt.PolyType.ptClip,!0)}}return o.Execute(Kt.ClipType.ctUnion,r,Kt.PolyFillType.pftNonZero,Kt.PolyFillType.pftNonZero),r}var p=e,n=Kt.Clipper.Minkowski(t,p,!0,i),o=new Kt.Clipper;return o.AddPaths(n,Kt.PolyType.ptSubject,!0),o.Execute(Kt.ClipType.ctUnion,n,Kt.PolyFillType.pftNonZero,Kt.PolyFillType.pftNonZero),n},Kt.Clipper.TranslatePath=function(t,e){for(var i=new Kt.Path,n=0;n<t.length;n++)i.push(new Kt.IntPoint(t[n].X+e.X,t[n].Y+e.Y));return i},Kt.Clipper.MinkowskiDiff=function(t,e){var i=Kt.Clipper.Minkowski(t,e,!1,!0),n=new Kt.Clipper;return n.AddPaths(i,Kt.PolyType.ptSubject,!0),n.Execute(Kt.ClipType.ctUnion,i,Kt.PolyFillType.pftNonZero,Kt.PolyFillType.pftNonZero),i},Kt.Clipper.PolyTreeToPaths=function(t){var e=new Array;return Kt.Clipper.AddPolyNodeToPaths(t,Kt.Clipper.NodeType.ntAny,e),e},Kt.Clipper.AddPolyNodeToPaths=function(t,e,i){var n=!0;switch(e){case Kt.Clipper.NodeType.ntOpen:return;case Kt.Clipper.NodeType.ntClosed:n=!t.IsOpen}t.m_polygon.length>0&&n&&i.push(t.m_polygon);for(var r=0,o=t.Childs(),s=o.length,l=o[r];r<s;r++,l=o[r])Kt.Clipper.AddPolyNodeToPaths(l,e,i)},Kt.Clipper.OpenPathsFromPolyTree=function(t){for(var e=new Kt.Paths,i=0,n=t.ChildCount();i<n;i++)t.Childs()[i].IsOpen&&e.push(t.Childs()[i].m_polygon);return e},Kt.Clipper.ClosedPathsFromPolyTree=function(t){var e=new Kt.Paths;return Kt.Clipper.AddPolyNodeToPaths(t,Kt.Clipper.NodeType.ntClosed,e),e},Pe(Kt.Clipper,Kt.ClipperBase),Kt.Clipper.NodeType={ntAny:0,ntOpen:1,ntClosed:2},Kt.ClipperOffset=function(t,e){"undefined"==typeof t&&(t=2),"undefined"==typeof e&&(e=Kt.ClipperOffset.def_arc_tolerance),this.m_destPolys=new Kt.Paths,this.m_srcPoly=new Kt.Path,this.m_destPoly=new Kt.Path,this.m_normals=new Array,this.m_delta=0,this.m_sinA=0,this.m_sin=0,this.m_cos=0,this.m_miterLim=0,this.m_StepsPerRad=0,this.m_lowest=new Kt.IntPoint,this.m_polyNodes=new Kt.PolyNode,this.MiterLimit=t,this.ArcTolerance=e,this.m_lowest.X=-1},Kt.ClipperOffset.two_pi=6.28318530717959,Kt.ClipperOffset.def_arc_tolerance=.25,Kt.ClipperOffset.prototype.Clear=function(){Kt.Clear(this.m_polyNodes.Childs()),this.m_lowest.X=-1},Kt.ClipperOffset.Round=Kt.Clipper.Round,Kt.ClipperOffset.prototype.AddPath=function(t,e,i){var n=t.length-1;if(!(n<0)){var r=new Kt.PolyNode;if(r.m_jointype=e,r.m_endtype=i,i==Kt.EndType.etClosedLine||i==Kt.EndType.etClosedPolygon)for(;n>0&&Kt.IntPoint.op_Equality(t[0],t[n]);)n--;r.m_polygon.push(t[0]);for(var o=0,s=0,l=1;l<=n;l++)Kt.IntPoint.op_Inequality(r.m_polygon[o],t[l])&&(o++,r.m_polygon.push(t[l]),(t[l].Y>r.m_polygon[s].Y||t[l].Y==r.m_polygon[s].Y&&t[l].X<r.m_polygon[s].X)&&(s=o));if(!(i==Kt.EndType.etClosedPolygon&&o<2)&&(this.m_polyNodes.AddChild(r),i==Kt.EndType.etClosedPolygon))if(this.m_lowest.X<0)this.m_lowest=new Kt.IntPoint(this.m_polyNodes.ChildCount()-1,s);else{var p=this.m_polyNodes.Childs()[this.m_lowest.X].m_polygon[this.m_lowest.Y];(r.m_polygon[s].Y>p.Y||r.m_polygon[s].Y==p.Y&&r.m_polygon[s].X<p.X)&&(this.m_lowest=new Kt.IntPoint(this.m_polyNodes.ChildCount()-1,s))}}},Kt.ClipperOffset.prototype.AddPaths=function(t,e,i){for(var n=0,r=t.length;n<r;n++)this.AddPath(t[n],e,i)},Kt.ClipperOffset.prototype.FixOrientations=function(){if(this.m_lowest.X>=0&&!Kt.Clipper.Orientation(this.m_polyNodes.Childs()[this.m_lowest.X].m_polygon))for(var t=0;t<this.m_polyNodes.ChildCount();t++){var e=this.m_polyNodes.Childs()[t];(e.m_endtype==Kt.EndType.etClosedPolygon||e.m_endtype==Kt.EndType.etClosedLine&&Kt.Clipper.Orientation(e.m_polygon))&&e.m_polygon.reverse()}else for(var t=0;t<this.m_polyNodes.ChildCount();t++){var e=this.m_polyNodes.Childs()[t];e.m_endtype!=Kt.EndType.etClosedLine||Kt.Clipper.Orientation(e.m_polygon)||e.m_polygon.reverse()}},Kt.ClipperOffset.GetUnitNormal=function(t,e){var i=e.X-t.X,n=e.Y-t.Y;if(0==i&&0==n)return new Kt.DoublePoint(0,0);var r=1/Math.sqrt(i*i+n*n);return i*=r,n*=r,new Kt.DoublePoint(n,-i)},Kt.ClipperOffset.prototype.DoOffset=function(t){if(this.m_destPolys=new Array,this.m_delta=t,Kt.ClipperBase.near_zero(t))for(var e=0;e<this.m_polyNodes.ChildCount();e++){var i=this.m_polyNodes.Childs()[e];i.m_endtype==Kt.EndType.etClosedPolygon&&this.m_destPolys.push(i.m_polygon)}else{this.MiterLimit>2?this.m_miterLim=2/(this.MiterLimit*this.MiterLimit):this.m_miterLim=.5;var n;n=this.ArcTolerance<=0?Kt.ClipperOffset.def_arc_tolerance:this.ArcTolerance>Math.abs(t)*Kt.ClipperOffset.def_arc_tolerance?Math.abs(t)*Kt.ClipperOffset.def_arc_tolerance:this.ArcTolerance;var r=3.14159265358979/Math.acos(1-n/Math.abs(t));this.m_sin=Math.sin(Kt.ClipperOffset.two_pi/r),this.m_cos=Math.cos(Kt.ClipperOffset.two_pi/r),this.m_StepsPerRad=r/Kt.ClipperOffset.two_pi,t<0&&(this.m_sin=-this.m_sin);for(var e=0;e<this.m_polyNodes.ChildCount();e++){var i=this.m_polyNodes.Childs()[e];this.m_srcPoly=i.m_polygon;var o=this.m_srcPoly.length;if(!(0==o||t<=0&&(o<3||i.m_endtype!=Kt.EndType.etClosedPolygon)))if(this.m_destPoly=new Array,1!=o){this.m_normals.length=0;for(var s=0;s<o-1;s++)this.m_normals.push(Kt.ClipperOffset.GetUnitNormal(this.m_srcPoly[s],this.m_srcPoly[s+1]));if(i.m_endtype==Kt.EndType.etClosedLine||i.m_endtype==Kt.EndType.etClosedPolygon?this.m_normals.push(Kt.ClipperOffset.GetUnitNormal(this.m_srcPoly[o-1],this.m_srcPoly[0])):this.m_normals.push(new Kt.DoublePoint(this.m_normals[o-2])),i.m_endtype==Kt.EndType.etClosedPolygon){for(var l=o-1,s=0;s<o;s++)l=this.OffsetPoint(s,l,i.m_jointype);this.m_destPolys.push(this.m_destPoly)}else if(i.m_endtype==Kt.EndType.etClosedLine){for(var l=o-1,s=0;s<o;s++)l=this.OffsetPoint(s,l,i.m_jointype);this.m_destPolys.push(this.m_destPoly),this.m_destPoly=new Array;for(var p=this.m_normals[o-1],s=o-1;s>0;s--)this.m_normals[s]=new Kt.DoublePoint(-this.m_normals[s-1].X,-this.m_normals[s-1].Y);this.m_normals[0]=new Kt.DoublePoint(-p.X,-p.Y),l=0;for(var s=o-1;s>=0;s--)l=this.OffsetPoint(s,l,i.m_jointype);this.m_destPolys.push(this.m_destPoly)}else{for(var l=0,s=1;s<o-1;++s)l=this.OffsetPoint(s,l,i.m_jointype);var h;if(i.m_endtype==Kt.EndType.etOpenButt){var s=o-1;h=new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[s].X+this.m_normals[s].X*t),Kt.ClipperOffset.Round(this.m_srcPoly[s].Y+this.m_normals[s].Y*t)),this.m_destPoly.push(h),h=new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[s].X-this.m_normals[s].X*t),Kt.ClipperOffset.Round(this.m_srcPoly[s].Y-this.m_normals[s].Y*t)),this.m_destPoly.push(h)}else{var s=o-1;l=o-2,this.m_sinA=0,this.m_normals[s]=new Kt.DoublePoint(-this.m_normals[s].X,-this.m_normals[s].Y),i.m_endtype==Kt.EndType.etOpenSquare?this.DoSquare(s,l):this.DoRound(s,l)}for(var s=o-1;s>0;s--)this.m_normals[s]=new Kt.DoublePoint(-this.m_normals[s-1].X,-this.m_normals[s-1].Y);this.m_normals[0]=new Kt.DoublePoint(-this.m_normals[1].X,-this.m_normals[1].Y),l=o-1;for(var s=l-1;s>0;--s)l=this.OffsetPoint(s,l,i.m_jointype);i.m_endtype==Kt.EndType.etOpenButt?(h=new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[0].X-this.m_normals[0].X*t),Kt.ClipperOffset.Round(this.m_srcPoly[0].Y-this.m_normals[0].Y*t)),this.m_destPoly.push(h),h=new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[0].X+this.m_normals[0].X*t),Kt.ClipperOffset.Round(this.m_srcPoly[0].Y+this.m_normals[0].Y*t)),this.m_destPoly.push(h)):(l=1,this.m_sinA=0,i.m_endtype==Kt.EndType.etOpenSquare?this.DoSquare(0,1):this.DoRound(0,1)),this.m_destPolys.push(this.m_destPoly)}}else{if(i.m_jointype==Kt.JoinType.jtRound)for(var u=1,a=0,s=1;s<=r;s++){this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[0].X+u*t),Kt.ClipperOffset.Round(this.m_srcPoly[0].Y+a*t)));var f=u;u=u*this.m_cos-this.m_sin*a,a=f*this.m_sin+a*this.m_cos}else for(var u=-1,a=-1,s=0;s<4;++s)this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[0].X+u*t),Kt.ClipperOffset.Round(this.m_srcPoly[0].Y+a*t))),u<0?u=1:a<0?a=1:u=-1;this.m_destPolys.push(this.m_destPoly)}}}},Kt.ClipperOffset.prototype.Execute=function(){var t=arguments,e=t[0]instanceof Kt.PolyTree;if(e){var i=t[0],n=t[1];i.Clear(),this.FixOrientations(),this.DoOffset(n);var r=new Kt.Clipper(0);if(r.AddPaths(this.m_destPolys,Kt.PolyType.ptSubject,!0),n>0)r.Execute(Kt.ClipType.ctUnion,i,Kt.PolyFillType.pftPositive,Kt.PolyFillType.pftPositive);else{var o=Kt.Clipper.GetBounds(this.m_destPolys),s=new Kt.Path;if(s.push(new Kt.IntPoint(o.left-10,o.bottom+10)),s.push(new Kt.IntPoint(o.right+10,o.bottom+10)),s.push(new Kt.IntPoint(o.right+10,o.top-10)),s.push(new Kt.IntPoint(o.left-10,o.top-10)),r.AddPath(s,Kt.PolyType.ptSubject,!0),r.ReverseSolution=!0,r.Execute(Kt.ClipType.ctUnion,i,Kt.PolyFillType.pftNegative,Kt.PolyFillType.pftNegative),1==i.ChildCount()&&i.Childs()[0].ChildCount()>0){var l=i.Childs()[0];i.Childs()[0]=l.Childs()[0],i.Childs()[0].m_Parent=i;for(var p=1;p<l.ChildCount();p++)i.AddChild(l.Childs()[p])}else i.Clear()}}else{var i=t[0],n=t[1];Kt.Clear(i),this.FixOrientations(),this.DoOffset(n);var r=new Kt.Clipper(0);if(r.AddPaths(this.m_destPolys,Kt.PolyType.ptSubject,!0),n>0)r.Execute(Kt.ClipType.ctUnion,i,Kt.PolyFillType.pftPositive,Kt.PolyFillType.pftPositive);else{var o=Kt.Clipper.GetBounds(this.m_destPolys),s=new Kt.Path;s.push(new Kt.IntPoint(o.left-10,o.bottom+10)),s.push(new Kt.IntPoint(o.right+10,o.bottom+10)),s.push(new Kt.IntPoint(o.right+10,o.top-10)),s.push(new Kt.IntPoint(o.left-10,o.top-10)),r.AddPath(s,Kt.PolyType.ptSubject,!0),r.ReverseSolution=!0,r.Execute(Kt.ClipType.ctUnion,i,Kt.PolyFillType.pftNegative,Kt.PolyFillType.pftNegative),i.length>0&&i.splice(0,1)}}},Kt.ClipperOffset.prototype.OffsetPoint=function(t,e,i){if(this.m_sinA=this.m_normals[e].X*this.m_normals[t].Y-this.m_normals[t].X*this.m_normals[e].Y,Math.abs(this.m_sinA*this.m_delta)<1){var n=this.m_normals[e].X*this.m_normals[t].X+this.m_normals[t].Y*this.m_normals[e].Y;if(n>0)return this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_normals[e].X*this.m_delta),Kt.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_normals[e].Y*this.m_delta))),e}else this.m_sinA>1?this.m_sinA=1:this.m_sinA<-1&&(this.m_sinA=-1);if(this.m_sinA*this.m_delta<0)this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_normals[e].X*this.m_delta),Kt.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_normals[e].Y*this.m_delta))),this.m_destPoly.push(new Kt.IntPoint(this.m_srcPoly[t])),this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_normals[t].X*this.m_delta),Kt.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_normals[t].Y*this.m_delta)));else switch(i){case Kt.JoinType.jtMiter:var r=1+(this.m_normals[t].X*this.m_normals[e].X+this.m_normals[t].Y*this.m_normals[e].Y);r>=this.m_miterLim?this.DoMiter(t,e,r):this.DoSquare(t,e);break;case Kt.JoinType.jtSquare:this.DoSquare(t,e);break;case Kt.JoinType.jtRound:this.DoRound(t,e)}return e=t},Kt.ClipperOffset.prototype.DoSquare=function(t,e){var i=Math.tan(Math.atan2(this.m_sinA,this.m_normals[e].X*this.m_normals[t].X+this.m_normals[e].Y*this.m_normals[t].Y)/4);this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_delta*(this.m_normals[e].X-this.m_normals[e].Y*i)),Kt.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_delta*(this.m_normals[e].Y+this.m_normals[e].X*i)))),this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_delta*(this.m_normals[t].X+this.m_normals[t].Y*i)),Kt.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_delta*(this.m_normals[t].Y-this.m_normals[t].X*i))))},Kt.ClipperOffset.prototype.DoMiter=function(t,e,i){var n=this.m_delta/i;this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[t].X+(this.m_normals[e].X+this.m_normals[t].X)*n),Kt.ClipperOffset.Round(this.m_srcPoly[t].Y+(this.m_normals[e].Y+this.m_normals[t].Y)*n)))},Kt.ClipperOffset.prototype.DoRound=function(t,e){for(var i,n=Math.atan2(this.m_sinA,this.m_normals[e].X*this.m_normals[t].X+this.m_normals[e].Y*this.m_normals[t].Y),r=Math.max(Kt.Cast_Int32(Kt.ClipperOffset.Round(this.m_StepsPerRad*Math.abs(n))),1),o=this.m_normals[e].X,s=this.m_normals[e].Y,l=0;l<r;++l)this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[t].X+o*this.m_delta),Kt.ClipperOffset.Round(this.m_srcPoly[t].Y+s*this.m_delta))),i=o,o=o*this.m_cos-this.m_sin*s,s=i*this.m_sin+s*this.m_cos;this.m_destPoly.push(new Kt.IntPoint(Kt.ClipperOffset.Round(this.m_srcPoly[t].X+this.m_normals[t].X*this.m_delta),Kt.ClipperOffset.Round(this.m_srcPoly[t].Y+this.m_normals[t].Y*this.m_delta)))},Kt.Error=function(t){throw new Error(t)},Kt.JS={},Kt.JS.AreaOfPolygon=function(t,e){return e||(e=1),Kt.Clipper.Area(t)/(e*e)},Kt.JS.AreaOfPolygons=function(t,e){e||(e=1);for(var i=0,n=0;n<t.length;n++)i+=Kt.Clipper.Area(t[n]);return i/(e*e)},Kt.JS.BoundsOfPath=function(t,e){return Kt.JS.BoundsOfPaths([t],e)},Kt.JS.BoundsOfPaths=function(t,e){e||(e=1);var i=Kt.Clipper.GetBounds(t);return i.left/=e,i.bottom/=e,i.right/=e,i.top/=e,i},Kt.JS.Clean=function(t,e){if(!(t instanceof Array))return[];var i=t[0]instanceof Array,t=Kt.JS.Clone(t);if("number"!=typeof e||null===e)return Kt.Error("Delta is not a number in Clean()."),t;if(0===t.length||1==t.length&&0===t[0].length||e<0)return t;i||(t=[t]);for(var n,r,o,s,l,p,h,u=t.length,a=[],f=0;f<u;f++)if(r=t[f],n=r.length,0!==n)if(n<3)o=r,a.push(o);else{for(o=r,s=e*e,l=r[0],p=1,h=1;h<n;h++)(r[h].X-l.X)*(r[h].X-l.X)+(r[h].Y-l.Y)*(r[h].Y-l.Y)<=s||(o[p]=r[h],l=r[h],p++);l=r[p-1],(r[0].X-l.X)*(r[0].X-l.X)+(r[0].Y-l.Y)*(r[0].Y-l.Y)<=s&&p--,p<n&&o.splice(p,n-p),o.length&&a.push(o)}return!i&&a.length?a=a[0]:i||0!==a.length?i&&0===a.length&&(a=[[]]):a=[],a},Kt.JS.Clone=function(t){if(!(t instanceof Array))return[];if(0===t.length)return[];if(1==t.length&&0===t[0].length)return[[]];var e=t[0]instanceof Array;e||(t=[t]);var i,n,r,o,s=t.length,l=new Array(s);for(n=0;n<s;n++){for(i=t[n].length,o=new Array(i),r=0;r<i;r++)o[r]={X:t[n][r].X,Y:t[n][r].Y};l[n]=o}return e||(l=l[0]),l},Kt.JS.Lighten=function(t,e){if(!(t instanceof Array))return[];if("number"!=typeof e||null===e)return Kt.Error("Tolerance is not a number in Lighten()."),Kt.JS.Clone(t);if(0===t.length||1==t.length&&0===t[0].length||e<0)return Kt.JS.Clone(t);t[0]instanceof Array||(t=[t]);var i,n,r,o,s,l,p,h,u,a,f,d,P,m,y,c,v,C=t.length,I=e*e,_=[];for(i=0;i<C;i++)if(r=t[i],l=r.length,0!=l){for(o=0;o<1e6;o++){for(s=[],l=r.length,r[l-1].X!=r[0].X||r[l-1].Y!=r[0].Y?(d=1,r.push({X:r[0].X,Y:r[0].Y}),l=r.length):d=0,f=[],n=0;n<l-2;n++)p=r[n],u=r[n+1],h=r[n+2],c=p.X,v=p.Y,P=h.X-c,m=h.Y-v,0===P&&0===m||(y=((u.X-c)*P+(u.Y-v)*m)/(P*P+m*m),y>1?(c=h.X,v=h.Y):y>0&&(c+=P*y,v+=m*y)),P=u.X-c,m=u.Y-v,a=P*P+m*m,a<=I&&(f[n+1]=1,n++);for(s.push({X:r[0].X,Y:r[0].Y}),n=1;n<l-1;n++)f[n]||s.push({X:r[n].X,Y:r[n].Y});if(s.push({X:r[l-1].X,Y:r[l-1].Y}),d&&r.pop(),!f.length)break;r=s}l=s.length,s[l-1].X==s[0].X&&s[l-1].Y==s[0].Y&&s.pop(),s.length>2&&_.push(s)}return t[0]instanceof Array||(_=_[0]),"undefined"==typeof _&&(_=[[]]),_},Kt.JS.PerimeterOfPath=function(t,e,i){if("undefined"==typeof t)return 0;var n,r,o=Math.sqrt,s=0,l=0,p=0,h=0,u=0,a=t.length;if(a<2)return 0;for(e&&(t[a]=t[0],a++);--a;)n=t[a],l=n.X,p=n.Y,r=t[a-1],h=r.X,u=r.Y,s+=o((l-h)*(l-h)+(p-u)*(p-u));return e&&t.pop(),s/i},Kt.JS.PerimeterOfPaths=function(t,e,i){i||(i=1);for(var n=0,r=0;r<t.length;r++)n+=Kt.JS.PerimeterOfPath(t[r],e,i);return n},Kt.JS.ScaleDownPath=function(t,e){var i,n;for(e||(e=1),i=t.length;i--;)n=t[i],n.X=n.X/e,n.Y=n.Y/e},Kt.JS.ScaleDownPaths=function(t,e){var i,n,r;for(e||(e=1),i=t.length;i--;)for(n=t[i].length;n--;)r=t[i][n],r.X=r.X/e,r.Y=r.Y/e},Kt.JS.ScaleUpPath=function(t,e){var i,n,r=Math.round;for(e||(e=1),i=t.length;i--;)n=t[i],n.X=r(n.X*e),n.Y=r(n.Y*e)},Kt.JS.ScaleUpPaths=function(t,e){var i,n,r,o=Math.round;for(e||(e=1),i=t.length;i--;)for(n=t[i].length;n--;)r=t[i][n],r.X=o(r.X*e),r.Y=o(r.Y*e)},Kt.ExPolygons=function(){return[]},Kt.ExPolygon=function(){this.outer=null,
+this.holes=null},Kt.JS.AddOuterPolyNodeToExPolygons=function(t,e){var i=new Kt.ExPolygon;i.outer=t.Contour();var n=t.Childs(),r=n.length;i.holes=new Array(r);var o,s,l,p,h,u;for(l=0;l<r;l++)for(o=n[l],i.holes[l]=o.Contour(),p=0,h=o.Childs(),u=h.length;p<u;p++)s=h[p],Kt.JS.AddOuterPolyNodeToExPolygons(s,e);e.push(i)},Kt.JS.ExPolygonsToPaths=function(t){var e,i,n,r,o=new Kt.Paths;for(e=0,n=t.length;e<n;e++)for(o.push(t[e].outer),i=0,r=t[e].holes.length;i<r;i++)o.push(t[e].holes[i]);return o},Kt.JS.PolyTreeToExPolygons=function(t){var e,i,n,r,o=new Kt.ExPolygons;for(i=0,n=t.Childs(),r=n.length;i<r;i++)e=n[i],Kt.JS.AddOuterPolyNodeToExPolygons(e,o);return o}}();
+},{}]},{},[8])(8)
 });
\ No newline at end of file
diff --git a/package.json b/package.json
index 2384327..fb1da05 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "g.js",
-  "version": "0.1.2",
+  "version": "0.1.3",
   "description": "Graphic Objects Library",
   "main": "src/g.js",
   "scripts": {