@servicetitan/anvil2 2.8.0 → 2.9.0

package/dist/Button-a_D7tUgM.js

@@ -1,4517 +0,0 @@
-import { jsxs, jsx } from 'react/jsx-runtime';
-import * as React from 'react';
-import { useContext, useState, useEffect, useMemo, memo, forwardRef, useCallback } from 'react';
-import { I as Icon } from './Icon-DuIlne4x.js';
-import { S as Spinner } from './Spinner-BqmcE2pb.js';
-import { w as warnOnce } from './warnOnce-Y9PRHcU4.js';
-import { g as getDefaultExportFromCjs, c as cx } from './index-De1g9FRV.js';
-import { u as usePrefersReducedMotion } from './usePrefersReducedMotion-DR9B_D6w.js';
-import { u as useTheme } from './useTheme-B4i6a3bM.js';
-import { d as isEasingArray, e as interpolate$1, u as useConstant, f as motionValue, M as MotionConfigContext, c as useIsomorphicLayoutEffect, g as frame, j as cancelFrame, k as collectMotionValues, r as resolveElements, l as mixNumber, n as removeItem, o as isMotionValue, q as defaultOffset, s as createGeneratorEasing, t as fillOffset, v as isGenerator, x as secondsToMilliseconds, y as invariant, z as progress, V as VisualElement, A as createBox, B as isSVGElement, C as isSVGSVGElement, S as SVGVisualElement, H as HTMLVisualElement, D as visualElementStore, E as animateSingleValue, F as animateTarget, G as spring, m as motion } from './proxy-DEehATlA.js';
-import { s as styles } from './Button.module-wCtFYGVD.js';
-import { u as useLayoutPropsUtil } from './useLayoutPropsUtil-DMDdfIah.js';
-import { c as childrenToString } from './childrenToString-Bz9MqbHb.js';
-import { useTrackingId } from './useTrackingId.js';
-
-const wrap = (min, max, v) => {
-    const rangeSize = max - min;
-    return ((((v - min) % rangeSize) + rangeSize) % rangeSize) + min;
-};
-
-function getEasingForSegment(easing, i) {
-    return isEasingArray(easing) ? easing[wrap(0, easing.length, i)] : easing;
-}
-
-class GroupAnimation {
-    constructor(animations) {
-        // Bound to accomadate common `return animation.stop` pattern
-        this.stop = () => this.runAll("stop");
-        this.animations = animations.filter(Boolean);
-    }
-    get finished() {
-        return Promise.all(this.animations.map((animation) => animation.finished));
-    }
-    /**
-     * TODO: Filter out cancelled or stopped animations before returning
-     */
-    getAll(propName) {
-        return this.animations[0][propName];
-    }
-    setAll(propName, newValue) {
-        for (let i = 0; i < this.animations.length; i++) {
-            this.animations[i][propName] = newValue;
-        }
-    }
-    attachTimeline(timeline) {
-        const subscriptions = this.animations.map((animation) => animation.attachTimeline(timeline));
-        return () => {
-            subscriptions.forEach((cancel, i) => {
-                cancel && cancel();
-                this.animations[i].stop();
-            });
-        };
-    }
-    get time() {
-        return this.getAll("time");
-    }
-    set time(time) {
-        this.setAll("time", time);
-    }
-    get speed() {
-        return this.getAll("speed");
-    }
-    set speed(speed) {
-        this.setAll("speed", speed);
-    }
-    get state() {
-        return this.getAll("state");
-    }
-    get startTime() {
-        return this.getAll("startTime");
-    }
-    get duration() {
-        let max = 0;
-        for (let i = 0; i < this.animations.length; i++) {
-            max = Math.max(max, this.animations[i].duration);
-        }
-        return max;
-    }
-    runAll(methodName) {
-        this.animations.forEach((controls) => controls[methodName]());
-    }
-    play() {
-        this.runAll("play");
-    }
-    pause() {
-        this.runAll("pause");
-    }
-    cancel() {
-        this.runAll("cancel");
-    }
-    complete() {
-        this.runAll("complete");
-    }
-}
-
-class GroupAnimationWithThen extends GroupAnimation {
-    then(onResolve, _onReject) {
-        return this.finished.finally(onResolve).then(() => { });
-    }
-}
-
-function transform(...args) {
-    const useImmediate = !Array.isArray(args[0]);
-    const argOffset = useImmediate ? 0 : -1;
-    const inputValue = args[0 + argOffset];
-    const inputRange = args[1 + argOffset];
-    const outputRange = args[2 + argOffset];
-    const options = args[3 + argOffset];
-    const interpolator = interpolate$1(inputRange, outputRange, options);
-    return useImmediate ? interpolator(inputValue) : interpolator;
-}
-
-/**
- * Creates a `MotionValue` to track the state and velocity of a value.
- *
- * Usually, these are created automatically. For advanced use-cases, like use with `useTransform`, you can create `MotionValue`s externally and pass them into the animated component via the `style` prop.
- *
- * ```jsx
- * export const MyComponent = () => {
- *   const scale = useMotionValue(1)
- *
- *   return <motion.div style={{ scale }} />
- * }
- * ```
- *
- * @param initial - The initial state.
- *
- * @public
- */
-function useMotionValue(initial) {
-    const value = useConstant(() => motionValue(initial));
-    /**
-     * If this motion value is being used in static mode, like on
-     * the Framer canvas, force components to rerender when the motion
-     * value is updated.
-     */
-    const { isStatic } = useContext(MotionConfigContext);
-    if (isStatic) {
-        const [, setLatest] = useState(initial);
-        useEffect(() => value.on("change", setLatest), []);
-    }
-    return value;
-}
-
-function useCombineMotionValues(values, combineValues) {
-    /**
-     * Initialise the returned motion value. This remains the same between renders.
-     */
-    const value = useMotionValue(combineValues());
-    /**
-     * Create a function that will update the template motion value with the latest values.
-     * This is pre-bound so whenever a motion value updates it can schedule its
-     * execution in Framesync. If it's already been scheduled it won't be fired twice
-     * in a single frame.
-     */
-    const updateValue = () => value.set(combineValues());
-    /**
-     * Synchronously update the motion value with the latest values during the render.
-     * This ensures that within a React render, the styles applied to the DOM are up-to-date.
-     */
-    updateValue();
-    /**
-     * Subscribe to all motion values found within the template. Whenever any of them change,
-     * schedule an update.
-     */
-    useIsomorphicLayoutEffect(() => {
-        const scheduleUpdate = () => frame.preRender(updateValue, false, true);
-        const subscriptions = values.map((v) => v.on("change", scheduleUpdate));
-        return () => {
-            subscriptions.forEach((unsubscribe) => unsubscribe());
-            cancelFrame(updateValue);
-        };
-    });
-    return value;
-}
-
-function useComputed(compute) {
-    /**
-     * Open session of collectMotionValues. Any MotionValue that calls get()
-     * will be saved into this array.
-     */
-    collectMotionValues.current = [];
-    compute();
-    const value = useCombineMotionValues(collectMotionValues.current, compute);
-    /**
-     * Synchronously close session of collectMotionValues.
-     */
-    collectMotionValues.current = undefined;
-    return value;
-}
-
-function useTransform(input, inputRangeOrTransformer, outputRange, options) {
-    if (typeof input === "function") {
-        return useComputed(input);
-    }
-    const transformer = typeof inputRangeOrTransformer === "function"
-        ? inputRangeOrTransformer
-        : transform(inputRangeOrTransformer, outputRange, options);
-    return Array.isArray(input)
-        ? useListTransform(input, transformer)
-        : useListTransform([input], ([latest]) => transformer(latest));
-}
-function useListTransform(values, transformer) {
-    const latest = useConstant(() => []);
-    return useCombineMotionValues(values, () => {
-        latest.length = 0;
-        const numValues = values.length;
-        for (let i = 0; i < numValues; i++) {
-            latest[i] = values[i].get();
-        }
-        return transformer(latest);
-    });
-}
-
-function isDOMKeyframes(keyframes) {
-    return typeof keyframes === "object" && !Array.isArray(keyframes);
-}
-
-function resolveSubjects(subject, keyframes, scope, selectorCache) {
-    if (typeof subject === "string" && isDOMKeyframes(keyframes)) {
-        return resolveElements(subject, scope, selectorCache);
-    }
-    else if (subject instanceof NodeList) {
-        return Array.from(subject);
-    }
-    else if (Array.isArray(subject)) {
-        return subject;
-    }
-    else {
-        return [subject];
-    }
-}
-
-function calculateRepeatDuration(duration, repeat, _repeatDelay) {
-    return duration * (repeat + 1);
-}
-
-/**
- * Given a absolute or relative time definition and current/prev time state of the sequence,
- * calculate an absolute time for the next keyframes.
- */
-function calcNextTime(current, next, prev, labels) {
-    if (typeof next === "number") {
-        return next;
-    }
-    else if (next.startsWith("-") || next.startsWith("+")) {
-        return Math.max(0, current + parseFloat(next));
-    }
-    else if (next === "<") {
-        return prev;
-    }
-    else if (next.startsWith("<")) {
-        return Math.max(0, prev + parseFloat(next.slice(1)));
-    }
-    else {
-        return labels.get(next) ?? current;
-    }
-}
-
-function eraseKeyframes(sequence, startTime, endTime) {
-    for (let i = 0; i < sequence.length; i++) {
-        const keyframe = sequence[i];
-        if (keyframe.at > startTime && keyframe.at < endTime) {
-            removeItem(sequence, keyframe);
-            // If we remove this item we have to push the pointer back one
-            i--;
-        }
-    }
-}
-function addKeyframes(sequence, keyframes, easing, offset, startTime, endTime) {
-    /**
-     * Erase every existing value between currentTime and targetTime,
-     * this will essentially splice this timeline into any currently
-     * defined ones.
-     */
-    eraseKeyframes(sequence, startTime, endTime);
-    for (let i = 0; i < keyframes.length; i++) {
-        sequence.push({
-            value: keyframes[i],
-            at: mixNumber(startTime, endTime, offset[i]),
-            easing: getEasingForSegment(easing, i),
-        });
-    }
-}
-
-/**
- * Take an array of times that represent repeated keyframes. For instance
- * if we have original times of [0, 0.5, 1] then our repeated times will
- * be [0, 0.5, 1, 1, 1.5, 2]. Loop over the times and scale them back
- * down to a 0-1 scale.
- */
-function normalizeTimes(times, repeat) {
-    for (let i = 0; i < times.length; i++) {
-        times[i] = times[i] / (repeat + 1);
-    }
-}
-
-function compareByTime(a, b) {
-    if (a.at === b.at) {
-        if (a.value === null)
-            return 1;
-        if (b.value === null)
-            return -1;
-        return 0;
-    }
-    else {
-        return a.at - b.at;
-    }
-}
-
-const defaultSegmentEasing = "easeInOut";
-const MAX_REPEAT = 20;
-function createAnimationsFromSequence(sequence, { defaultTransition = {}, ...sequenceTransition } = {}, scope, generators) {
-    const defaultDuration = defaultTransition.duration || 0.3;
-    const animationDefinitions = new Map();
-    const sequences = new Map();
-    const elementCache = {};
-    const timeLabels = new Map();
-    let prevTime = 0;
-    let currentTime = 0;
-    let totalDuration = 0;
-    /**
-     * Build the timeline by mapping over the sequence array and converting
-     * the definitions into keyframes and offsets with absolute time values.
-     * These will later get converted into relative offsets in a second pass.
-     */
-    for (let i = 0; i < sequence.length; i++) {
-        const segment = sequence[i];
-        /**
-         * If this is a timeline label, mark it and skip the rest of this iteration.
-         */
-        if (typeof segment === "string") {
-            timeLabels.set(segment, currentTime);
-            continue;
-        }
-        else if (!Array.isArray(segment)) {
-            timeLabels.set(segment.name, calcNextTime(currentTime, segment.at, prevTime, timeLabels));
-            continue;
-        }
-        let [subject, keyframes, transition = {}] = segment;
-        /**
-         * If a relative or absolute time value has been specified we need to resolve
-         * it in relation to the currentTime.
-         */
-        if (transition.at !== undefined) {
-            currentTime = calcNextTime(currentTime, transition.at, prevTime, timeLabels);
-        }
-        /**
-         * Keep track of the maximum duration in this definition. This will be
-         * applied to currentTime once the definition has been parsed.
-         */
-        let maxDuration = 0;
-        const resolveValueSequence = (valueKeyframes, valueTransition, valueSequence, elementIndex = 0, numSubjects = 0) => {
-            const valueKeyframesAsList = keyframesAsList(valueKeyframes);
-            const { delay = 0, times = defaultOffset(valueKeyframesAsList), type = "keyframes", repeat, repeatType, repeatDelay = 0, ...remainingTransition } = valueTransition;
-            let { ease = defaultTransition.ease || "easeOut", duration } = valueTransition;
-            /**
-             * Resolve stagger() if defined.
-             */
-            const calculatedDelay = typeof delay === "function"
-                ? delay(elementIndex, numSubjects)
-                : delay;
-            /**
-             * If this animation should and can use a spring, generate a spring easing function.
-             */
-            const numKeyframes = valueKeyframesAsList.length;
-            const createGenerator = isGenerator(type)
-                ? type
-                : generators?.[type || "keyframes"];
-            if (numKeyframes <= 2 && createGenerator) {
-                /**
-                 * As we're creating an easing function from a spring,
-                 * ideally we want to generate it using the real distance
-                 * between the two keyframes. However this isn't always
-                 * possible - in these situations we use 0-100.
-                 */
-                let absoluteDelta = 100;
-                if (numKeyframes === 2 &&
-                    isNumberKeyframesArray(valueKeyframesAsList)) {
-                    const delta = valueKeyframesAsList[1] - valueKeyframesAsList[0];
-                    absoluteDelta = Math.abs(delta);
-                }
-                const springTransition = { ...remainingTransition };
-                if (duration !== undefined) {
-                    springTransition.duration = secondsToMilliseconds(duration);
-                }
-                const springEasing = createGeneratorEasing(springTransition, absoluteDelta, createGenerator);
-                ease = springEasing.ease;
-                duration = springEasing.duration;
-            }
-            duration ?? (duration = defaultDuration);
-            const startTime = currentTime + calculatedDelay;
-            /**
-             * If there's only one time offset of 0, fill in a second with length 1
-             */
-            if (times.length === 1 && times[0] === 0) {
-                times[1] = 1;
-            }
-            /**
-             * Fill out if offset if fewer offsets than keyframes
-             */
-            const remainder = times.length - valueKeyframesAsList.length;
-            remainder > 0 && fillOffset(times, remainder);
-            /**
-             * If only one value has been set, ie [1], push a null to the start of
-             * the keyframe array. This will let us mark a keyframe at this point
-             * that will later be hydrated with the previous value.
-             */
-            valueKeyframesAsList.length === 1 &&
-                valueKeyframesAsList.unshift(null);
-            /**
-             * Handle repeat options
-             */
-            if (repeat) {
-                invariant(repeat < MAX_REPEAT, "Repeat count too high, must be less than 20", "repeat-count-high");
-                duration = calculateRepeatDuration(duration, repeat);
-                const originalKeyframes = [...valueKeyframesAsList];
-                const originalTimes = [...times];
-                ease = Array.isArray(ease) ? [...ease] : [ease];
-                const originalEase = [...ease];
-                for (let repeatIndex = 0; repeatIndex < repeat; repeatIndex++) {
-                    valueKeyframesAsList.push(...originalKeyframes);
-                    for (let keyframeIndex = 0; keyframeIndex < originalKeyframes.length; keyframeIndex++) {
-                        times.push(originalTimes[keyframeIndex] + (repeatIndex + 1));
-                        ease.push(keyframeIndex === 0
-                            ? "linear"
-                            : getEasingForSegment(originalEase, keyframeIndex - 1));
-                    }
-                }
-                normalizeTimes(times, repeat);
-            }
-            const targetTime = startTime + duration;
-            /**
-             * Add keyframes, mapping offsets to absolute time.
-             */
-            addKeyframes(valueSequence, valueKeyframesAsList, ease, times, startTime, targetTime);
-            maxDuration = Math.max(calculatedDelay + duration, maxDuration);
-            totalDuration = Math.max(targetTime, totalDuration);
-        };
-        if (isMotionValue(subject)) {
-            const subjectSequence = getSubjectSequence(subject, sequences);
-            resolveValueSequence(keyframes, transition, getValueSequence("default", subjectSequence));
-        }
-        else {
-            const subjects = resolveSubjects(subject, keyframes, scope, elementCache);
-            const numSubjects = subjects.length;
-            /**
-             * For every element in this segment, process the defined values.
-             */
-            for (let subjectIndex = 0; subjectIndex < numSubjects; subjectIndex++) {
-                /**
-                 * Cast necessary, but we know these are of this type
-                 */
-                keyframes = keyframes;
-                transition = transition;
-                const thisSubject = subjects[subjectIndex];
-                const subjectSequence = getSubjectSequence(thisSubject, sequences);
-                for (const key in keyframes) {
-                    resolveValueSequence(keyframes[key], getValueTransition(transition, key), getValueSequence(key, subjectSequence), subjectIndex, numSubjects);
-                }
-            }
-        }
-        prevTime = currentTime;
-        currentTime += maxDuration;
-    }
-    /**
-     * For every element and value combination create a new animation.
-     */
-    sequences.forEach((valueSequences, element) => {
-        for (const key in valueSequences) {
-            const valueSequence = valueSequences[key];
-            /**
-             * Arrange all the keyframes in ascending time order.
-             */
-            valueSequence.sort(compareByTime);
-            const keyframes = [];
-            const valueOffset = [];
-            const valueEasing = [];
-            /**
-             * For each keyframe, translate absolute times into
-             * relative offsets based on the total duration of the timeline.
-             */
-            for (let i = 0; i < valueSequence.length; i++) {
-                const { at, value, easing } = valueSequence[i];
-                keyframes.push(value);
-                valueOffset.push(progress(0, totalDuration, at));
-                valueEasing.push(easing || "easeOut");
-            }
-            /**
-             * If the first keyframe doesn't land on offset: 0
-             * provide one by duplicating the initial keyframe. This ensures
-             * it snaps to the first keyframe when the animation starts.
-             */
-            if (valueOffset[0] !== 0) {
-                valueOffset.unshift(0);
-                keyframes.unshift(keyframes[0]);
-                valueEasing.unshift(defaultSegmentEasing);
-            }
-            /**
-             * If the last keyframe doesn't land on offset: 1
-             * provide one with a null wildcard value. This will ensure it
-             * stays static until the end of the animation.
-             */
-            if (valueOffset[valueOffset.length - 1] !== 1) {
-                valueOffset.push(1);
-                keyframes.push(null);
-            }
-            if (!animationDefinitions.has(element)) {
-                animationDefinitions.set(element, {
-                    keyframes: {},
-                    transition: {},
-                });
-            }
-            const definition = animationDefinitions.get(element);
-            definition.keyframes[key] = keyframes;
-            definition.transition[key] = {
-                ...defaultTransition,
-                duration: totalDuration,
-                ease: valueEasing,
-                times: valueOffset,
-                ...sequenceTransition,
-            };
-        }
-    });
-    return animationDefinitions;
-}
-function getSubjectSequence(subject, sequences) {
-    !sequences.has(subject) && sequences.set(subject, {});
-    return sequences.get(subject);
-}
-function getValueSequence(name, sequences) {
-    if (!sequences[name])
-        sequences[name] = [];
-    return sequences[name];
-}
-function keyframesAsList(keyframes) {
-    return Array.isArray(keyframes) ? keyframes : [keyframes];
-}
-function getValueTransition(transition, key) {
-    return transition && transition[key]
-        ? {
-            ...transition,
-            ...transition[key],
-        }
-        : { ...transition };
-}
-const isNumber = (keyframe) => typeof keyframe === "number";
-const isNumberKeyframesArray = (keyframes) => keyframes.every(isNumber);
-
-function isObjectKey(key, object) {
-    return key in object;
-}
-class ObjectVisualElement extends VisualElement {
-    constructor() {
-        super(...arguments);
-        this.type = "object";
-    }
-    readValueFromInstance(instance, key) {
-        if (isObjectKey(key, instance)) {
-            const value = instance[key];
-            if (typeof value === "string" || typeof value === "number") {
-                return value;
-            }
-        }
-        return undefined;
-    }
-    getBaseTargetFromProps() {
-        return undefined;
-    }
-    removeValueFromRenderState(key, renderState) {
-        delete renderState.output[key];
-    }
-    measureInstanceViewportBox() {
-        return createBox();
-    }
-    build(renderState, latestValues) {
-        Object.assign(renderState.output, latestValues);
-    }
-    renderInstance(instance, { output }) {
-        Object.assign(instance, output);
-    }
-    sortInstanceNodePosition() {
-        return 0;
-    }
-}
-
-function createDOMVisualElement(element) {
-    const options = {
-        presenceContext: null,
-        props: {},
-        visualState: {
-            renderState: {
-                transform: {},
-                transformOrigin: {},
-                style: {},
-                vars: {},
-                attrs: {},
-            },
-            latestValues: {},
-        },
-    };
-    const node = isSVGElement(element) && !isSVGSVGElement(element)
-        ? new SVGVisualElement(options)
-        : new HTMLVisualElement(options);
-    node.mount(element);
-    visualElementStore.set(element, node);
-}
-function createObjectVisualElement(subject) {
-    const options = {
-        presenceContext: null,
-        props: {},
-        visualState: {
-            renderState: {
-                output: {},
-            },
-            latestValues: {},
-        },
-    };
-    const node = new ObjectVisualElement(options);
-    node.mount(subject);
-    visualElementStore.set(subject, node);
-}
-
-function isSingleValue(subject, keyframes) {
-    return (isMotionValue(subject) ||
-        typeof subject === "number" ||
-        (typeof subject === "string" && !isDOMKeyframes(keyframes)));
-}
-/**
- * Implementation
- */
-function animateSubject(subject, keyframes, options, scope) {
-    const animations = [];
-    if (isSingleValue(subject, keyframes)) {
-        animations.push(animateSingleValue(subject, isDOMKeyframes(keyframes)
-            ? keyframes.default || keyframes
-            : keyframes, options ? options.default || options : options));
-    }
-    else {
-        const subjects = resolveSubjects(subject, keyframes, scope);
-        const numSubjects = subjects.length;
-        invariant(Boolean(numSubjects), "No valid elements provided.", "no-valid-elements");
-        for (let i = 0; i < numSubjects; i++) {
-            const thisSubject = subjects[i];
-            invariant(thisSubject !== null, "You're trying to perform an animation on null. Ensure that selectors are correctly finding elements and refs are correctly hydrated.", "animate-null");
-            const createVisualElement = thisSubject instanceof Element
-                ? createDOMVisualElement
-                : createObjectVisualElement;
-            if (!visualElementStore.has(thisSubject)) {
-                createVisualElement(thisSubject);
-            }
-            const visualElement = visualElementStore.get(thisSubject);
-            const transition = { ...options };
-            /**
-             * Resolve stagger function if provided.
-             */
-            if ("delay" in transition &&
-                typeof transition.delay === "function") {
-                transition.delay = transition.delay(i, numSubjects);
-            }
-            animations.push(...animateTarget(visualElement, { ...keyframes, transition }, {}));
-        }
-    }
-    return animations;
-}
-
-function animateSequence(sequence, options, scope) {
-    const animations = [];
-    const animationDefinitions = createAnimationsFromSequence(sequence, options, scope, { spring });
-    animationDefinitions.forEach(({ keyframes, transition }, subject) => {
-        animations.push(...animateSubject(subject, keyframes, transition));
-    });
-    return animations;
-}
-
-function isSequence(value) {
-    return Array.isArray(value) && value.some(Array.isArray);
-}
-/**
- * Creates an animation function that is optionally scoped
- * to a specific element.
- */
-function createScopedAnimate(scope) {
-    /**
-     * Implementation
-     */
-    function scopedAnimate(subjectOrSequence, optionsOrKeyframes, options) {
-        let animations = [];
-        if (isSequence(subjectOrSequence)) {
-            animations = animateSequence(subjectOrSequence, optionsOrKeyframes, scope);
-        }
-        else {
-            animations = animateSubject(subjectOrSequence, optionsOrKeyframes, options, scope);
-        }
-        const animation = new GroupAnimationWithThen(animations);
-        return animation;
-    }
-    return scopedAnimate;
-}
-const animate = createScopedAnimate();
-
-function polygonArea(polygon) {
-  var i = -1,
-      n = polygon.length,
-      a,
-      b = polygon[n - 1],
-      area = 0;
-
-  while (++i < n) {
-    a = b;
-    b = polygon[i];
-    area += a[1] * b[0] - a[0] * b[1];
-  }
-
-  return area / 2;
-}
-
-function polygonLength(polygon) {
-  var i = -1,
-      n = polygon.length,
-      b = polygon[n - 1],
-      xa,
-      ya,
-      xb = b[0],
-      yb = b[1],
-      perimeter = 0;
-
-  while (++i < n) {
-    xa = xb;
-    ya = yb;
-    b = polygon[i];
-    xb = b[0];
-    yb = b[1];
-    xa -= xb;
-    ya -= yb;
-    perimeter += Math.sqrt(xa * xa + ya * ya);
-  }
-
-  return perimeter;
-}
-
-var path_parse;
-var hasRequiredPath_parse;
-
-function requirePath_parse () {
-	if (hasRequiredPath_parse) return path_parse;
-	hasRequiredPath_parse = 1;
-
-
-	var paramCounts = { a: 7, c: 6, h: 1, l: 2, m: 2, r: 4, q: 4, s: 4, t: 2, v: 1, z: 0 };
-
-	var SPECIAL_SPACES = [
-	  0x1680, 0x180E, 0x2000, 0x2001, 0x2002, 0x2003, 0x2004, 0x2005, 0x2006,
-	  0x2007, 0x2008, 0x2009, 0x200A, 0x202F, 0x205F, 0x3000, 0xFEFF
-	];
-
-	function isSpace(ch) {
-	  return (ch === 0x0A) || (ch === 0x0D) || (ch === 0x2028) || (ch === 0x2029) || // Line terminators
-	    // White spaces
-	    (ch === 0x20) || (ch === 0x09) || (ch === 0x0B) || (ch === 0x0C) || (ch === 0xA0) ||
-	    (ch >= 0x1680 && SPECIAL_SPACES.indexOf(ch) >= 0);
-	}
-
-	function isCommand(code) {
-	  /*eslint-disable no-bitwise*/
-	  switch (code | 0x20) {
-	    case 0x6D/* m */:
-	    case 0x7A/* z */:
-	    case 0x6C/* l */:
-	    case 0x68/* h */:
-	    case 0x76/* v */:
-	    case 0x63/* c */:
-	    case 0x73/* s */:
-	    case 0x71/* q */:
-	    case 0x74/* t */:
-	    case 0x61/* a */:
-	    case 0x72/* r */:
-	      return true;
-	  }
-	  return false;
-	}
-
-	function isArc(code) {
-	  return (code | 0x20) === 0x61;
-	}
-
-	function isDigit(code) {
-	  return (code >= 48 && code <= 57);   // 0..9
-	}
-
-	function isDigitStart(code) {
-	  return (code >= 48 && code <= 57) || /* 0..9 */
-	          code === 0x2B || /* + */
-	          code === 0x2D || /* - */
-	          code === 0x2E;   /* . */
-	}
-
-
-	function State(path) {
-	  this.index  = 0;
-	  this.path   = path;
-	  this.max    = path.length;
-	  this.result = [];
-	  this.param  = 0.0;
-	  this.err    = '';
-	  this.segmentStart = 0;
-	  this.data   = [];
-	}
-
-	function skipSpaces(state) {
-	  while (state.index < state.max && isSpace(state.path.charCodeAt(state.index))) {
-	    state.index++;
-	  }
-	}
-
-
-	function scanFlag(state) {
-	  var ch = state.path.charCodeAt(state.index);
-
-	  if (ch === 0x30/* 0 */) {
-	    state.param = 0;
-	    state.index++;
-	    return;
-	  }
-
-	  if (ch === 0x31/* 1 */) {
-	    state.param = 1;
-	    state.index++;
-	    return;
-	  }
-
-	  state.err = 'SvgPath: arc flag can be 0 or 1 only (at pos ' + state.index + ')';
-	}
-
-
-	function scanParam(state) {
-	  var start = state.index,
-	      index = start,
-	      max = state.max,
-	      zeroFirst = false,
-	      hasCeiling = false,
-	      hasDecimal = false,
-	      hasDot = false,
-	      ch;
-
-	  if (index >= max) {
-	    state.err = 'SvgPath: missed param (at pos ' + index + ')';
-	    return;
-	  }
-	  ch = state.path.charCodeAt(index);
-
-	  if (ch === 0x2B/* + */ || ch === 0x2D/* - */) {
-	    index++;
-	    ch = (index < max) ? state.path.charCodeAt(index) : 0;
-	  }
-
-	  // This logic is shamelessly borrowed from Esprima
-	  // https://github.com/ariya/esprimas
-	  //
-	  if (!isDigit(ch) && ch !== 0x2E/* . */) {
-	    state.err = 'SvgPath: param should start with 0..9 or `.` (at pos ' + index + ')';
-	    return;
-	  }
-
-	  if (ch !== 0x2E/* . */) {
-	    zeroFirst = (ch === 0x30/* 0 */);
-	    index++;
-
-	    ch = (index < max) ? state.path.charCodeAt(index) : 0;
-
-	    if (zeroFirst && index < max) {
-	      // decimal number starts with '0' such as '09' is illegal.
-	      if (ch && isDigit(ch)) {
-	        state.err = 'SvgPath: numbers started with `0` such as `09` are illegal (at pos ' + start + ')';
-	        return;
-	      }
-	    }
-
-	    while (index < max && isDigit(state.path.charCodeAt(index))) {
-	      index++;
-	      hasCeiling = true;
-	    }
-	    ch = (index < max) ? state.path.charCodeAt(index) : 0;
-	  }
-
-	  if (ch === 0x2E/* . */) {
-	    hasDot = true;
-	    index++;
-	    while (isDigit(state.path.charCodeAt(index))) {
-	      index++;
-	      hasDecimal = true;
-	    }
-	    ch = (index < max) ? state.path.charCodeAt(index) : 0;
-	  }
-
-	  if (ch === 0x65/* e */ || ch === 0x45/* E */) {
-	    if (hasDot && !hasCeiling && !hasDecimal) {
-	      state.err = 'SvgPath: invalid float exponent (at pos ' + index + ')';
-	      return;
-	    }
-
-	    index++;
-
-	    ch = (index < max) ? state.path.charCodeAt(index) : 0;
-	    if (ch === 0x2B/* + */ || ch === 0x2D/* - */) {
-	      index++;
-	    }
-	    if (index < max && isDigit(state.path.charCodeAt(index))) {
-	      while (index < max && isDigit(state.path.charCodeAt(index))) {
-	        index++;
-	      }
-	    } else {
-	      state.err = 'SvgPath: invalid float exponent (at pos ' + index + ')';
-	      return;
-	    }
-	  }
-
-	  state.index = index;
-	  state.param = parseFloat(state.path.slice(start, index)) + 0.0;
-	}
-
-
-	function finalizeSegment(state) {
-	  var cmd, cmdLC;
-
-	  // Process duplicated commands (without comand name)
-
-	  // This logic is shamelessly borrowed from Raphael
-	  // https://github.com/DmitryBaranovskiy/raphael/
-	  //
-	  cmd   = state.path[state.segmentStart];
-	  cmdLC = cmd.toLowerCase();
-
-	  var params = state.data;
-
-	  if (cmdLC === 'm' && params.length > 2) {
-	    state.result.push([ cmd, params[0], params[1] ]);
-	    params = params.slice(2);
-	    cmdLC = 'l';
-	    cmd = (cmd === 'm') ? 'l' : 'L';
-	  }
-
-	  if (cmdLC === 'r') {
-	    state.result.push([ cmd ].concat(params));
-	  } else {
-
-	    while (params.length >= paramCounts[cmdLC]) {
-	      state.result.push([ cmd ].concat(params.splice(0, paramCounts[cmdLC])));
-	      if (!paramCounts[cmdLC]) {
-	        break;
-	      }
-	    }
-	  }
-	}
-
-
-	function scanSegment(state) {
-	  var max = state.max,
-	      cmdCode, is_arc, comma_found, need_params, i;
-
-	  state.segmentStart = state.index;
-	  cmdCode = state.path.charCodeAt(state.index);
-	  is_arc = isArc(cmdCode);
-
-	  if (!isCommand(cmdCode)) {
-	    state.err = 'SvgPath: bad command ' + state.path[state.index] + ' (at pos ' + state.index + ')';
-	    return;
-	  }
-
-	  need_params = paramCounts[state.path[state.index].toLowerCase()];
-
-	  state.index++;
-	  skipSpaces(state);
-
-	  state.data = [];
-
-	  if (!need_params) {
-	    // Z
-	    finalizeSegment(state);
-	    return;
-	  }
-
-	  comma_found = false;
-
-	  for (;;) {
-	    for (i = need_params; i > 0; i--) {
-	      if (is_arc && (i === 3 || i === 4)) scanFlag(state);
-	      else scanParam(state);
-
-	      if (state.err.length) {
-	        finalizeSegment(state);
-	        return;
-	      }
-	      state.data.push(state.param);
-
-	      skipSpaces(state);
-	      comma_found = false;
-
-	      if (state.index < max && state.path.charCodeAt(state.index) === 0x2C/* , */) {
-	        state.index++;
-	        skipSpaces(state);
-	        comma_found = true;
-	      }
-	    }
-
-	    // after ',' param is mandatory
-	    if (comma_found) {
-	      continue;
-	    }
-
-	    if (state.index >= state.max) {
-	      break;
-	    }
-
-	    // Stop on next segment
-	    if (!isDigitStart(state.path.charCodeAt(state.index))) {
-	      break;
-	    }
-	  }
-
-	  finalizeSegment(state);
-	}
-
-
-	/* Returns array of segments:
-	 *
-	 * [
-	 *   [ command, coord1, coord2, ... ]
-	 * ]
-	 */
-	path_parse = function pathParse(svgPath) {
-	  var state = new State(svgPath);
-	  var max = state.max;
-
-	  skipSpaces(state);
-
-	  while (state.index < max && !state.err.length) {
-	    scanSegment(state);
-	  }
-
-	  if (state.result.length) {
-	    if ('mM'.indexOf(state.result[0][0]) < 0) {
-	      state.err = 'SvgPath: string should start with `M` or `m`';
-	      state.result = [];
-	    } else {
-	      state.result[0][0] = 'M';
-	    }
-	  }
-
-	  return {
-	    err: state.err,
-	    segments: state.result
-	  };
-	};
-	return path_parse;
-}
-
-var matrix;
-var hasRequiredMatrix;
-
-function requireMatrix () {
-	if (hasRequiredMatrix) return matrix;
-	hasRequiredMatrix = 1;
-
-	// combine 2 matrixes
-	// m1, m2 - [a, b, c, d, e, g]
-	//
-	function combine(m1, m2) {
-	  return [
-	    m1[0] * m2[0] + m1[2] * m2[1],
-	    m1[1] * m2[0] + m1[3] * m2[1],
-	    m1[0] * m2[2] + m1[2] * m2[3],
-	    m1[1] * m2[2] + m1[3] * m2[3],
-	    m1[0] * m2[4] + m1[2] * m2[5] + m1[4],
-	    m1[1] * m2[4] + m1[3] * m2[5] + m1[5]
-	  ];
-	}
-
-
-	function Matrix() {
-	  if (!(this instanceof Matrix)) { return new Matrix(); }
-	  this.queue = [];   // list of matrixes to apply
-	  this.cache = null; // combined matrix cache
-	}
-
-
-	Matrix.prototype.matrix = function (m) {
-	  if (m[0] === 1 && m[1] === 0 && m[2] === 0 && m[3] === 1 && m[4] === 0 && m[5] === 0) {
-	    return this;
-	  }
-	  this.cache = null;
-	  this.queue.push(m);
-	  return this;
-	};
-
-
-	Matrix.prototype.translate = function (tx, ty) {
-	  if (tx !== 0 || ty !== 0) {
-	    this.cache = null;
-	    this.queue.push([ 1, 0, 0, 1, tx, ty ]);
-	  }
-	  return this;
-	};
-
-
-	Matrix.prototype.scale = function (sx, sy) {
-	  if (sx !== 1 || sy !== 1) {
-	    this.cache = null;
-	    this.queue.push([ sx, 0, 0, sy, 0, 0 ]);
-	  }
-	  return this;
-	};
-
-
-	Matrix.prototype.rotate = function (angle, rx, ry) {
-	  var rad, cos, sin;
-
-	  if (angle !== 0) {
-	    this.translate(rx, ry);
-
-	    rad = angle * Math.PI / 180;
-	    cos = Math.cos(rad);
-	    sin = Math.sin(rad);
-
-	    this.queue.push([ cos, sin, -sin, cos, 0, 0 ]);
-	    this.cache = null;
-
-	    this.translate(-rx, -ry);
-	  }
-	  return this;
-	};
-
-
-	Matrix.prototype.skewX = function (angle) {
-	  if (angle !== 0) {
-	    this.cache = null;
-	    this.queue.push([ 1, 0, Math.tan(angle * Math.PI / 180), 1, 0, 0 ]);
-	  }
-	  return this;
-	};
-
-
-	Matrix.prototype.skewY = function (angle) {
-	  if (angle !== 0) {
-	    this.cache = null;
-	    this.queue.push([ 1, Math.tan(angle * Math.PI / 180), 0, 1, 0, 0 ]);
-	  }
-	  return this;
-	};
-
-
-	// Flatten queue
-	//
-	Matrix.prototype.toArray = function () {
-	  if (this.cache) {
-	    return this.cache;
-	  }
-
-	  if (!this.queue.length) {
-	    this.cache = [ 1, 0, 0, 1, 0, 0 ];
-	    return this.cache;
-	  }
-
-	  this.cache = this.queue[0];
-
-	  if (this.queue.length === 1) {
-	    return this.cache;
-	  }
-
-	  for (var i = 1; i < this.queue.length; i++) {
-	    this.cache = combine(this.cache, this.queue[i]);
-	  }
-
-	  return this.cache;
-	};
-
-
-	// Apply list of matrixes to (x,y) point.
-	// If `isRelative` set, `translate` component of matrix will be skipped
-	//
-	Matrix.prototype.calc = function (x, y, isRelative) {
-	  var m;
-
-	  // Don't change point on empty transforms queue
-	  if (!this.queue.length) { return [ x, y ]; }
-
-	  // Calculate final matrix, if not exists
-	  //
-	  // NB. if you deside to apply transforms to point one-by-one,
-	  // they should be taken in reverse order
-
-	  if (!this.cache) {
-	    this.cache = this.toArray();
-	  }
-
-	  m = this.cache;
-
-	  // Apply matrix to point
-	  return [
-	    x * m[0] + y * m[2] + (isRelative ? 0 : m[4]),
-	    x * m[1] + y * m[3] + (isRelative ? 0 : m[5])
-	  ];
-	};
-
-
-	matrix = Matrix;
-	return matrix;
-}
-
-var transform_parse;
-var hasRequiredTransform_parse;
-
-function requireTransform_parse () {
-	if (hasRequiredTransform_parse) return transform_parse;
-	hasRequiredTransform_parse = 1;
-
-
-	var Matrix = requireMatrix();
-
-	var operations = {
-	  matrix: true,
-	  scale: true,
-	  rotate: true,
-	  translate: true,
-	  skewX: true,
-	  skewY: true
-	};
-
-	var CMD_SPLIT_RE    = /\s*(matrix|translate|scale|rotate|skewX|skewY)\s*\(\s*(.+?)\s*\)[\s,]*/;
-	var PARAMS_SPLIT_RE = /[\s,]+/;
-
-
-	transform_parse = function transformParse(transformString) {
-	  var matrix = new Matrix();
-	  var cmd, params;
-
-	  // Split value into ['', 'translate', '10 50', '', 'scale', '2', '', 'rotate',  '-45', '']
-	  transformString.split(CMD_SPLIT_RE).forEach(function (item) {
-
-	    // Skip empty elements
-	    if (!item.length) { return; }
-
-	    // remember operation
-	    if (typeof operations[item] !== 'undefined') {
-	      cmd = item;
-	      return;
-	    }
-
-	    // extract params & att operation to matrix
-	    params = item.split(PARAMS_SPLIT_RE).map(function (i) {
-	      return +i || 0;
-	    });
-
-	    // If params count is not correct - ignore command
-	    switch (cmd) {
-	      case 'matrix':
-	        if (params.length === 6) {
-	          matrix.matrix(params);
-	        }
-	        return;
-
-	      case 'scale':
-	        if (params.length === 1) {
-	          matrix.scale(params[0], params[0]);
-	        } else if (params.length === 2) {
-	          matrix.scale(params[0], params[1]);
-	        }
-	        return;
-
-	      case 'rotate':
-	        if (params.length === 1) {
-	          matrix.rotate(params[0], 0, 0);
-	        } else if (params.length === 3) {
-	          matrix.rotate(params[0], params[1], params[2]);
-	        }
-	        return;
-
-	      case 'translate':
-	        if (params.length === 1) {
-	          matrix.translate(params[0], 0);
-	        } else if (params.length === 2) {
-	          matrix.translate(params[0], params[1]);
-	        }
-	        return;
-
-	      case 'skewX':
-	        if (params.length === 1) {
-	          matrix.skewX(params[0]);
-	        }
-	        return;
-
-	      case 'skewY':
-	        if (params.length === 1) {
-	          matrix.skewY(params[0]);
-	        }
-	        return;
-	    }
-	  });
-
-	  return matrix;
-	};
-	return transform_parse;
-}
-
-var a2c$1;
-var hasRequiredA2c;
-
-function requireA2c () {
-	if (hasRequiredA2c) return a2c$1;
-	hasRequiredA2c = 1;
-
-
-	var TAU = Math.PI * 2;
-
-
-	/* eslint-disable space-infix-ops */
-
-	// Calculate an angle between two unit vectors
-	//
-	// Since we measure angle between radii of circular arcs,
-	// we can use simplified math (without length normalization)
-	//
-	function unit_vector_angle(ux, uy, vx, vy) {
-	  var sign = (ux * vy - uy * vx < 0) ? -1 : 1;
-	  var dot  = ux * vx + uy * vy;
-
-	  // Add this to work with arbitrary vectors:
-	  // dot /= Math.sqrt(ux * ux + uy * uy) * Math.sqrt(vx * vx + vy * vy);
-
-	  // rounding errors, e.g. -1.0000000000000002 can screw up this
-	  if (dot >  1.0) { dot =  1.0; }
-	  if (dot < -1) { dot = -1; }
-
-	  return sign * Math.acos(dot);
-	}
-
-
-	// Convert from endpoint to center parameterization,
-	// see http://www.w3.org/TR/SVG11/implnote.html#ArcImplementationNotes
-	//
-	// Return [cx, cy, theta1, delta_theta]
-	//
-	function get_arc_center(x1, y1, x2, y2, fa, fs, rx, ry, sin_phi, cos_phi) {
-	  // Step 1.
-	  //
-	  // Moving an ellipse so origin will be the middlepoint between our two
-	  // points. After that, rotate it to line up ellipse axes with coordinate
-	  // axes.
-	  //
-	  var x1p =  cos_phi*(x1-x2)/2 + sin_phi*(y1-y2)/2;
-	  var y1p = -sin_phi*(x1-x2)/2 + cos_phi*(y1-y2)/2;
-
-	  var rx_sq  =  rx * rx;
-	  var ry_sq  =  ry * ry;
-	  var x1p_sq = x1p * x1p;
-	  var y1p_sq = y1p * y1p;
-
-	  // Step 2.
-	  //
-	  // Compute coordinates of the centre of this ellipse (cx', cy')
-	  // in the new coordinate system.
-	  //
-	  var radicant = (rx_sq * ry_sq) - (rx_sq * y1p_sq) - (ry_sq * x1p_sq);
-
-	  if (radicant < 0) {
-	    // due to rounding errors it might be e.g. -1.3877787807814457e-17
-	    radicant = 0;
-	  }
-
-	  radicant /=   (rx_sq * y1p_sq) + (ry_sq * x1p_sq);
-	  radicant = Math.sqrt(radicant) * (fa === fs ? -1 : 1);
-
-	  var cxp = radicant *  rx/ry * y1p;
-	  var cyp = radicant * -ry/rx * x1p;
-
-	  // Step 3.
-	  //
-	  // Transform back to get centre coordinates (cx, cy) in the original
-	  // coordinate system.
-	  //
-	  var cx = cos_phi*cxp - sin_phi*cyp + (x1+x2)/2;
-	  var cy = sin_phi*cxp + cos_phi*cyp + (y1+y2)/2;
-
-	  // Step 4.
-	  //
-	  // Compute angles (theta1, delta_theta).
-	  //
-	  var v1x =  (x1p - cxp) / rx;
-	  var v1y =  (y1p - cyp) / ry;
-	  var v2x = (-x1p - cxp) / rx;
-	  var v2y = (-y1p - cyp) / ry;
-
-	  var theta1 = unit_vector_angle(1, 0, v1x, v1y);
-	  var delta_theta = unit_vector_angle(v1x, v1y, v2x, v2y);
-
-	  if (fs === 0 && delta_theta > 0) {
-	    delta_theta -= TAU;
-	  }
-	  if (fs === 1 && delta_theta < 0) {
-	    delta_theta += TAU;
-	  }
-
-	  return [ cx, cy, theta1, delta_theta ];
-	}
-
-	//
-	// Approximate one unit arc segment with bézier curves,
-	// see http://math.stackexchange.com/questions/873224
-	//
-	function approximate_unit_arc(theta1, delta_theta) {
-	  var alpha = 4/3 * Math.tan(delta_theta/4);
-
-	  var x1 = Math.cos(theta1);
-	  var y1 = Math.sin(theta1);
-	  var x2 = Math.cos(theta1 + delta_theta);
-	  var y2 = Math.sin(theta1 + delta_theta);
-
-	  return [ x1, y1, x1 - y1*alpha, y1 + x1*alpha, x2 + y2*alpha, y2 - x2*alpha, x2, y2 ];
-	}
-
-	a2c$1 = function a2c(x1, y1, x2, y2, fa, fs, rx, ry, phi) {
-	  var sin_phi = Math.sin(phi * TAU / 360);
-	  var cos_phi = Math.cos(phi * TAU / 360);
-
-	  // Make sure radii are valid
-	  //
-	  var x1p =  cos_phi*(x1-x2)/2 + sin_phi*(y1-y2)/2;
-	  var y1p = -sin_phi*(x1-x2)/2 + cos_phi*(y1-y2)/2;
-
-	  if (x1p === 0 && y1p === 0) {
-	    // we're asked to draw line to itself
-	    return [];
-	  }
-
-	  if (rx === 0 || ry === 0) {
-	    // one of the radii is zero
-	    return [];
-	  }
-
-
-	  // Compensate out-of-range radii
-	  //
-	  rx = Math.abs(rx);
-	  ry = Math.abs(ry);
-
-	  var lambda = (x1p * x1p) / (rx * rx) + (y1p * y1p) / (ry * ry);
-	  if (lambda > 1) {
-	    rx *= Math.sqrt(lambda);
-	    ry *= Math.sqrt(lambda);
-	  }
-
-
-	  // Get center parameters (cx, cy, theta1, delta_theta)
-	  //
-	  var cc = get_arc_center(x1, y1, x2, y2, fa, fs, rx, ry, sin_phi, cos_phi);
-
-	  var result = [];
-	  var theta1 = cc[2];
-	  var delta_theta = cc[3];
-
-	  // Split an arc to multiple segments, so each segment
-	  // will be less than τ/4 (= 90°)
-	  //
-	  var segments = Math.max(Math.ceil(Math.abs(delta_theta) / (TAU / 4)), 1);
-	  delta_theta /= segments;
-
-	  for (var i = 0; i < segments; i++) {
-	    result.push(approximate_unit_arc(theta1, delta_theta));
-	    theta1 += delta_theta;
-	  }
-
-	  // We have a bezier approximation of a unit circle,
-	  // now need to transform back to the original ellipse
-	  //
-	  return result.map(function (curve) {
-	    for (var i = 0; i < curve.length; i += 2) {
-	      var x = curve[i + 0];
-	      var y = curve[i + 1];
-
-	      // scale
-	      x *= rx;
-	      y *= ry;
-
-	      // rotate
-	      var xp = cos_phi*x - sin_phi*y;
-	      var yp = sin_phi*x + cos_phi*y;
-
-	      // translate
-	      curve[i + 0] = xp + cc[0];
-	      curve[i + 1] = yp + cc[1];
-	    }
-
-	    return curve;
-	  });
-	};
-	return a2c$1;
-}
-
-var ellipse;
-var hasRequiredEllipse;
-
-function requireEllipse () {
-	if (hasRequiredEllipse) return ellipse;
-	hasRequiredEllipse = 1;
-
-	/* eslint-disable space-infix-ops */
-
-	// The precision used to consider an ellipse as a circle
-	//
-	var epsilon = 0.0000000001;
-
-	// To convert degree in radians
-	//
-	var torad = Math.PI / 180;
-
-	// Class constructor :
-	//  an ellipse centred at 0 with radii rx,ry and x - axis - angle ax.
-	//
-	function Ellipse(rx, ry, ax) {
-	  if (!(this instanceof Ellipse)) { return new Ellipse(rx, ry, ax); }
-	  this.rx = rx;
-	  this.ry = ry;
-	  this.ax = ax;
-	}
-
-	// Apply a linear transform m to the ellipse
-	// m is an array representing a matrix :
-	//    -         -
-	//   | m[0] m[2] |
-	//   | m[1] m[3] |
-	//    -         -
-	//
-	Ellipse.prototype.transform = function (m) {
-	  // We consider the current ellipse as image of the unit circle
-	  // by first scale(rx,ry) and then rotate(ax) ...
-	  // So we apply ma =  m x rotate(ax) x scale(rx,ry) to the unit circle.
-	  var c = Math.cos(this.ax * torad), s = Math.sin(this.ax * torad);
-	  var ma = [
-	    this.rx * (m[0]*c + m[2]*s),
-	    this.rx * (m[1]*c + m[3]*s),
-	    this.ry * (-m[0]*s + m[2]*c),
-	    this.ry * (-m[1]*s + m[3]*c)
-	  ];
-
-	  // ma * transpose(ma) = [ J L ]
-	  //                      [ L K ]
-	  // L is calculated later (if the image is not a circle)
-	  var J = ma[0]*ma[0] + ma[2]*ma[2],
-	      K = ma[1]*ma[1] + ma[3]*ma[3];
-
-	  // the discriminant of the characteristic polynomial of ma * transpose(ma)
-	  var D = ((ma[0]-ma[3])*(ma[0]-ma[3]) + (ma[2]+ma[1])*(ma[2]+ma[1])) *
-	          ((ma[0]+ma[3])*(ma[0]+ma[3]) + (ma[2]-ma[1])*(ma[2]-ma[1]));
-
-	  // the "mean eigenvalue"
-	  var JK = (J + K) / 2;
-
-	  // check if the image is (almost) a circle
-	  if (D < epsilon * JK) {
-	    // if it is
-	    this.rx = this.ry = Math.sqrt(JK);
-	    this.ax = 0;
-	    return this;
-	  }
-
-	  // if it is not a circle
-	  var L = ma[0]*ma[1] + ma[2]*ma[3];
-
-	  D = Math.sqrt(D);
-
-	  // {l1,l2} = the two eigen values of ma * transpose(ma)
-	  var l1 = JK + D/2,
-	      l2 = JK - D/2;
-	  // the x - axis - rotation angle is the argument of the l1 - eigenvector
-	  /*eslint-disable indent*/
-	  this.ax = (Math.abs(L) < epsilon && Math.abs(l1 - K) < epsilon) ?
-	    90
-	  :
-	    Math.atan(Math.abs(L) > Math.abs(l1 - K) ?
-	      (l1 - J) / L
-	    :
-	      L / (l1 - K)
-	    ) * 180 / Math.PI;
-	  /*eslint-enable indent*/
-
-	  // if ax > 0 => rx = sqrt(l1), ry = sqrt(l2), else exchange axes and ax += 90
-	  if (this.ax >= 0) {
-	    // if ax in [0,90]
-	    this.rx = Math.sqrt(l1);
-	    this.ry = Math.sqrt(l2);
-	  } else {
-	    // if ax in ]-90,0[ => exchange axes
-	    this.ax += 90;
-	    this.rx = Math.sqrt(l2);
-	    this.ry = Math.sqrt(l1);
-	  }
-
-	  return this;
-	};
-
-	// Check if the ellipse is (almost) degenerate, i.e. rx = 0 or ry = 0
-	//
-	Ellipse.prototype.isDegenerate = function () {
-	  return (this.rx < epsilon * this.ry || this.ry < epsilon * this.rx);
-	};
-
-	ellipse = Ellipse;
-	return ellipse;
-}
-
-var svgpath$1;
-var hasRequiredSvgpath$1;
-
-function requireSvgpath$1 () {
-	if (hasRequiredSvgpath$1) return svgpath$1;
-	hasRequiredSvgpath$1 = 1;
-
-
-	var pathParse      = requirePath_parse();
-	var transformParse = requireTransform_parse();
-	var matrix         = requireMatrix();
-	var a2c            = requireA2c();
-	var ellipse        = requireEllipse();
-
-
-	// Class constructor
-	//
-	function SvgPath(path) {
-	  if (!(this instanceof SvgPath)) { return new SvgPath(path); }
-
-	  var pstate = pathParse(path);
-
-	  // Array of path segments.
-	  // Each segment is array [command, param1, param2, ...]
-	  this.segments = pstate.segments;
-
-	  // Error message on parse error.
-	  this.err      = pstate.err;
-
-	  // Transforms stack for lazy evaluation
-	  this.__stack    = [];
-	}
-
-	SvgPath.from = function (src) {
-	  if (typeof src === 'string') return new SvgPath(src);
-
-	  if (src instanceof SvgPath) {
-	    // Create empty object
-	    var s = new SvgPath('');
-
-	    // Clone properies
-	    s.err = src.err;
-	    s.segments = src.segments.map(function (sgm) { return sgm.slice(); });
-	    s.__stack = src.__stack.map(function (m) {
-	      return matrix().matrix(m.toArray());
-	    });
-
-	    return s;
-	  }
-
-	  throw new Error('SvgPath.from: invalid param type ' + src);
-	};
-
-
-	SvgPath.prototype.__matrix = function (m) {
-	  var self = this, i;
-
-	  // Quick leave for empty matrix
-	  if (!m.queue.length) { return; }
-
-	  this.iterate(function (s, index, x, y) {
-	    var p, result, name, isRelative;
-
-	    switch (s[0]) {
-
-	      // Process 'assymetric' commands separately
-	      case 'v':
-	        p      = m.calc(0, s[1], true);
-	        result = (p[0] === 0) ? [ 'v', p[1] ] : [ 'l', p[0], p[1] ];
-	        break;
-
-	      case 'V':
-	        p      = m.calc(x, s[1], false);
-	        result = (p[0] === m.calc(x, y, false)[0]) ? [ 'V', p[1] ] : [ 'L', p[0], p[1] ];
-	        break;
-
-	      case 'h':
-	        p      = m.calc(s[1], 0, true);
-	        result = (p[1] === 0) ? [ 'h', p[0] ] : [ 'l', p[0], p[1] ];
-	        break;
-
-	      case 'H':
-	        p      = m.calc(s[1], y, false);
-	        result = (p[1] === m.calc(x, y, false)[1]) ? [ 'H', p[0] ] : [ 'L', p[0], p[1] ];
-	        break;
-
-	      case 'a':
-	      case 'A':
-	        // ARC is: ['A', rx, ry, x-axis-rotation, large-arc-flag, sweep-flag, x, y]
-
-	        // Drop segment if arc is empty (end point === start point)
-	        /*if ((s[0] === 'A' && s[6] === x && s[7] === y) ||
-	            (s[0] === 'a' && s[6] === 0 && s[7] === 0)) {
-	          return [];
-	        }*/
-
-	        // Transform rx, ry and the x-axis-rotation
-	        var ma = m.toArray();
-	        var e = ellipse(s[1], s[2], s[3]).transform(ma);
-
-	        // flip sweep-flag if matrix is not orientation-preserving
-	        if (ma[0] * ma[3] - ma[1] * ma[2] < 0) {
-	          s[5] = s[5] ? '0' : '1';
-	        }
-
-	        // Transform end point as usual (without translation for relative notation)
-	        p = m.calc(s[6], s[7], s[0] === 'a');
-
-	        // Empty arcs can be ignored by renderer, but should not be dropped
-	        // to avoid collisions with `S A S` and so on. Replace with empty line.
-	        if ((s[0] === 'A' && s[6] === x && s[7] === y) ||
-	            (s[0] === 'a' && s[6] === 0 && s[7] === 0)) {
-	          result = [ s[0] === 'a' ? 'l' : 'L', p[0], p[1] ];
-	          break;
-	        }
-
-	        // if the resulting ellipse is (almost) a segment ...
-	        if (e.isDegenerate()) {
-	          // replace the arc by a line
-	          result = [ s[0] === 'a' ? 'l' : 'L', p[0], p[1] ];
-	        } else {
-	          // if it is a real ellipse
-	          // s[0], s[4] and s[5] are not modified
-	          result = [ s[0], e.rx, e.ry, e.ax, s[4], s[5], p[0], p[1] ];
-	        }
-
-	        break;
-
-	      case 'm':
-	        // Edge case. The very first `m` should be processed as absolute, if happens.
-	        // Make sense for coord shift transforms.
-	        isRelative = index > 0;
-
-	        p = m.calc(s[1], s[2], isRelative);
-	        result = [ 'm', p[0], p[1] ];
-	        break;
-
-	      default:
-	        name       = s[0];
-	        result     = [ name ];
-	        isRelative = (name.toLowerCase() === name);
-
-	        // Apply transformations to the segment
-	        for (i = 1; i < s.length; i += 2) {
-	          p = m.calc(s[i], s[i + 1], isRelative);
-	          result.push(p[0], p[1]);
-	        }
-	    }
-
-	    self.segments[index] = result;
-	  }, true);
-	};
-
-
-	// Apply stacked commands
-	//
-	SvgPath.prototype.__evaluateStack = function () {
-	  var m, i;
-
-	  if (!this.__stack.length) { return; }
-
-	  if (this.__stack.length === 1) {
-	    this.__matrix(this.__stack[0]);
-	    this.__stack = [];
-	    return;
-	  }
-
-	  m = matrix();
-	  i = this.__stack.length;
-
-	  while (--i >= 0) {
-	    m.matrix(this.__stack[i].toArray());
-	  }
-
-	  this.__matrix(m);
-	  this.__stack = [];
-	};
-
-
-	// Convert processed SVG Path back to string
-	//
-	SvgPath.prototype.toString = function () {
-	  var result = '', prevCmd = '', cmdSkipped = false;
-
-	  this.__evaluateStack();
-
-	  for (var i = 0, len = this.segments.length; i < len; i++) {
-	    var segment = this.segments[i];
-	    var cmd = segment[0];
-
-	    // Command not repeating => store
-	    if (cmd !== prevCmd || cmd === 'm' || cmd === 'M') {
-	      // workaround for FontForge SVG importing bug, keep space between "z m".
-	      if (cmd === 'm' && prevCmd === 'z') result += ' ';
-	      result += cmd;
-
-	      cmdSkipped = false;
-	    } else {
-	      cmdSkipped = true;
-	    }
-
-	    // Store segment params
-	    for (var pos = 1; pos < segment.length; pos++) {
-	      var val = segment[pos];
-	      // Space can be skipped
-	      // 1. After command (always)
-	      // 2. For negative value (with '-' at start)
-	      if (pos === 1) {
-	        if (cmdSkipped && val >= 0) result += ' ';
-	      } else if (val >= 0) result += ' ';
-
-	      result += val;
-	    }
-
-	    prevCmd = cmd;
-	  }
-
-	  return result;
-	};
-
-
-	// Translate path to (x [, y])
-	//
-	SvgPath.prototype.translate = function (x, y) {
-	  this.__stack.push(matrix().translate(x, y || 0));
-	  return this;
-	};
-
-
-	// Scale path to (sx [, sy])
-	// sy = sx if not defined
-	//
-	SvgPath.prototype.scale = function (sx, sy) {
-	  this.__stack.push(matrix().scale(sx, (!sy && (sy !== 0)) ? sx : sy));
-	  return this;
-	};
-
-
-	// Rotate path around point (sx [, sy])
-	// sy = sx if not defined
-	//
-	SvgPath.prototype.rotate = function (angle, rx, ry) {
-	  this.__stack.push(matrix().rotate(angle, rx || 0, ry || 0));
-	  return this;
-	};
-
-
-	// Skew path along the X axis by `degrees` angle
-	//
-	SvgPath.prototype.skewX = function (degrees) {
-	  this.__stack.push(matrix().skewX(degrees));
-	  return this;
-	};
-
-
-	// Skew path along the Y axis by `degrees` angle
-	//
-	SvgPath.prototype.skewY = function (degrees) {
-	  this.__stack.push(matrix().skewY(degrees));
-	  return this;
-	};
-
-
-	// Apply matrix transform (array of 6 elements)
-	//
-	SvgPath.prototype.matrix = function (m) {
-	  this.__stack.push(matrix().matrix(m));
-	  return this;
-	};
-
-
-	// Transform path according to "transform" attr of SVG spec
-	//
-	SvgPath.prototype.transform = function (transformString) {
-	  if (!transformString.trim()) {
-	    return this;
-	  }
-	  this.__stack.push(transformParse(transformString));
-	  return this;
-	};
-
-
-	// Round coords with given decimal precition.
-	// 0 by default (to integers)
-	//
-	SvgPath.prototype.round = function (d) {
-	  var contourStartDeltaX = 0, contourStartDeltaY = 0, deltaX = 0, deltaY = 0, l;
-
-	  d = d || 0;
-
-	  this.__evaluateStack();
-
-	  this.segments.forEach(function (s) {
-	    var isRelative = (s[0].toLowerCase() === s[0]);
-
-	    switch (s[0]) {
-	      case 'H':
-	      case 'h':
-	        if (isRelative) { s[1] += deltaX; }
-	        deltaX = s[1] - s[1].toFixed(d);
-	        s[1] = +s[1].toFixed(d);
-	        return;
-
-	      case 'V':
-	      case 'v':
-	        if (isRelative) { s[1] += deltaY; }
-	        deltaY = s[1] - s[1].toFixed(d);
-	        s[1] = +s[1].toFixed(d);
-	        return;
-
-	      case 'Z':
-	      case 'z':
-	        deltaX = contourStartDeltaX;
-	        deltaY = contourStartDeltaY;
-	        return;
-
-	      case 'M':
-	      case 'm':
-	        if (isRelative) {
-	          s[1] += deltaX;
-	          s[2] += deltaY;
-	        }
-
-	        deltaX = s[1] - s[1].toFixed(d);
-	        deltaY = s[2] - s[2].toFixed(d);
-
-	        contourStartDeltaX = deltaX;
-	        contourStartDeltaY = deltaY;
-
-	        s[1] = +s[1].toFixed(d);
-	        s[2] = +s[2].toFixed(d);
-	        return;
-
-	      case 'A':
-	      case 'a':
-	        // [cmd, rx, ry, x-axis-rotation, large-arc-flag, sweep-flag, x, y]
-	        if (isRelative) {
-	          s[6] += deltaX;
-	          s[7] += deltaY;
-	        }
-
-	        deltaX = s[6] - s[6].toFixed(d);
-	        deltaY = s[7] - s[7].toFixed(d);
-
-	        s[1] = +s[1].toFixed(d);
-	        s[2] = +s[2].toFixed(d);
-	        s[3] = +s[3].toFixed(d + 2); // better precision for rotation
-	        s[6] = +s[6].toFixed(d);
-	        s[7] = +s[7].toFixed(d);
-	        return;
-
-	      default:
-	        // a c l q s t
-	        l = s.length;
-
-	        if (isRelative) {
-	          s[l - 2] += deltaX;
-	          s[l - 1] += deltaY;
-	        }
-
-	        deltaX = s[l - 2] - s[l - 2].toFixed(d);
-	        deltaY = s[l - 1] - s[l - 1].toFixed(d);
-
-	        s.forEach(function (val, i) {
-	          if (!i) { return; }
-	          s[i] = +s[i].toFixed(d);
-	        });
-	        return;
-	    }
-	  });
-
-	  return this;
-	};
-
-
-	// Apply iterator function to all segments. If function returns result,
-	// current segment will be replaced to array of returned segments.
-	// If empty array is returned, current regment will be deleted.
-	//
-	SvgPath.prototype.iterate = function (iterator, keepLazyStack) {
-	  var segments = this.segments,
-	      replacements = {},
-	      needReplace = false,
-	      lastX = 0,
-	      lastY = 0,
-	      countourStartX = 0,
-	      countourStartY = 0;
-	  var i, j, newSegments;
-
-	  if (!keepLazyStack) {
-	    this.__evaluateStack();
-	  }
-
-	  segments.forEach(function (s, index) {
-
-	    var res = iterator(s, index, lastX, lastY);
-
-	    if (Array.isArray(res)) {
-	      replacements[index] = res;
-	      needReplace = true;
-	    }
-
-	    var isRelative = (s[0] === s[0].toLowerCase());
-
-	    // calculate absolute X and Y
-	    switch (s[0]) {
-	      case 'm':
-	      case 'M':
-	        lastX = s[1] + (isRelative ? lastX : 0);
-	        lastY = s[2] + (isRelative ? lastY : 0);
-	        countourStartX = lastX;
-	        countourStartY = lastY;
-	        return;
-
-	      case 'h':
-	      case 'H':
-	        lastX = s[1] + (isRelative ? lastX : 0);
-	        return;
-
-	      case 'v':
-	      case 'V':
-	        lastY = s[1] + (isRelative ? lastY : 0);
-	        return;
-
-	      case 'z':
-	      case 'Z':
-	        // That make sence for multiple contours
-	        lastX = countourStartX;
-	        lastY = countourStartY;
-	        return;
-
-	      default:
-	        lastX = s[s.length - 2] + (isRelative ? lastX : 0);
-	        lastY = s[s.length - 1] + (isRelative ? lastY : 0);
-	    }
-	  });
-
-	  // Replace segments if iterator return results
-
-	  if (!needReplace) { return this; }
-
-	  newSegments = [];
-
-	  for (i = 0; i < segments.length; i++) {
-	    if (typeof replacements[i] !== 'undefined') {
-	      for (j = 0; j < replacements[i].length; j++) {
-	        newSegments.push(replacements[i][j]);
-	      }
-	    } else {
-	      newSegments.push(segments[i]);
-	    }
-	  }
-
-	  this.segments = newSegments;
-
-	  return this;
-	};
-
-
-	// Converts segments from relative to absolute
-	//
-	SvgPath.prototype.abs = function () {
-
-	  this.iterate(function (s, index, x, y) {
-	    var name = s[0],
-	        nameUC = name.toUpperCase(),
-	        i;
-
-	    // Skip absolute commands
-	    if (name === nameUC) { return; }
-
-	    s[0] = nameUC;
-
-	    switch (name) {
-	      case 'v':
-	        // v has shifted coords parity
-	        s[1] += y;
-	        return;
-
-	      case 'a':
-	        // ARC is: ['A', rx, ry, x-axis-rotation, large-arc-flag, sweep-flag, x, y]
-	        // touch x, y only
-	        s[6] += x;
-	        s[7] += y;
-	        return;
-
-	      default:
-	        for (i = 1; i < s.length; i++) {
-	          s[i] += i % 2 ? x : y; // odd values are X, even - Y
-	        }
-	    }
-	  }, true);
-
-	  return this;
-	};
-
-
-	// Converts segments from absolute to relative
-	//
-	SvgPath.prototype.rel = function () {
-
-	  this.iterate(function (s, index, x, y) {
-	    var name = s[0],
-	        nameLC = name.toLowerCase(),
-	        i;
-
-	    // Skip relative commands
-	    if (name === nameLC) { return; }
-
-	    // Don't touch the first M to avoid potential confusions.
-	    if (index === 0 && name === 'M') { return; }
-
-	    s[0] = nameLC;
-
-	    switch (name) {
-	      case 'V':
-	        // V has shifted coords parity
-	        s[1] -= y;
-	        return;
-
-	      case 'A':
-	        // ARC is: ['A', rx, ry, x-axis-rotation, large-arc-flag, sweep-flag, x, y]
-	        // touch x, y only
-	        s[6] -= x;
-	        s[7] -= y;
-	        return;
-
-	      default:
-	        for (i = 1; i < s.length; i++) {
-	          s[i] -= i % 2 ? x : y; // odd values are X, even - Y
-	        }
-	    }
-	  }, true);
-
-	  return this;
-	};
-
-
-	// Converts arcs to cubic bézier curves
-	//
-	SvgPath.prototype.unarc = function () {
-	  this.iterate(function (s, index, x, y) {
-	    var new_segments, nextX, nextY, result = [], name = s[0];
-
-	    // Skip anything except arcs
-	    if (name !== 'A' && name !== 'a') { return null; }
-
-	    if (name === 'a') {
-	      // convert relative arc coordinates to absolute
-	      nextX = x + s[6];
-	      nextY = y + s[7];
-	    } else {
-	      nextX = s[6];
-	      nextY = s[7];
-	    }
-
-	    new_segments = a2c(x, y, nextX, nextY, s[4], s[5], s[1], s[2], s[3]);
-
-	    // Degenerated arcs can be ignored by renderer, but should not be dropped
-	    // to avoid collisions with `S A S` and so on. Replace with empty line.
-	    if (new_segments.length === 0) {
-	      return [ [ s[0] === 'a' ? 'l' : 'L', s[6], s[7] ] ];
-	    }
-
-	    new_segments.forEach(function (s) {
-	      result.push([ 'C', s[2], s[3], s[4], s[5], s[6], s[7] ]);
-	    });
-
-	    return result;
-	  });
-
-	  return this;
-	};
-
-
-	// Converts smooth curves (with missed control point) to generic curves
-	//
-	SvgPath.prototype.unshort = function () {
-	  var segments = this.segments;
-	  var prevControlX, prevControlY, prevSegment;
-	  var curControlX, curControlY;
-
-	  // TODO: add lazy evaluation flag when relative commands supported
-
-	  this.iterate(function (s, idx, x, y) {
-	    var name = s[0], nameUC = name.toUpperCase(), isRelative;
-
-	    // First command MUST be M|m, it's safe to skip.
-	    // Protect from access to [-1] for sure.
-	    if (!idx) { return; }
-
-	    if (nameUC === 'T') { // quadratic curve
-	      isRelative = (name === 't');
-
-	      prevSegment = segments[idx - 1];
-
-	      if (prevSegment[0] === 'Q') {
-	        prevControlX = prevSegment[1] - x;
-	        prevControlY = prevSegment[2] - y;
-	      } else if (prevSegment[0] === 'q') {
-	        prevControlX = prevSegment[1] - prevSegment[3];
-	        prevControlY = prevSegment[2] - prevSegment[4];
-	      } else {
-	        prevControlX = 0;
-	        prevControlY = 0;
-	      }
-
-	      curControlX = -prevControlX;
-	      curControlY = -prevControlY;
-
-	      if (!isRelative) {
-	        curControlX += x;
-	        curControlY += y;
-	      }
-
-	      segments[idx] = [
-	        isRelative ? 'q' : 'Q',
-	        curControlX, curControlY,
-	        s[1], s[2]
-	      ];
-
-	    } else if (nameUC === 'S') { // cubic curve
-	      isRelative = (name === 's');
-
-	      prevSegment = segments[idx - 1];
-
-	      if (prevSegment[0] === 'C') {
-	        prevControlX = prevSegment[3] - x;
-	        prevControlY = prevSegment[4] - y;
-	      } else if (prevSegment[0] === 'c') {
-	        prevControlX = prevSegment[3] - prevSegment[5];
-	        prevControlY = prevSegment[4] - prevSegment[6];
-	      } else {
-	        prevControlX = 0;
-	        prevControlY = 0;
-	      }
-
-	      curControlX = -prevControlX;
-	      curControlY = -prevControlY;
-
-	      if (!isRelative) {
-	        curControlX += x;
-	        curControlY += y;
-	      }
-
-	      segments[idx] = [
-	        isRelative ? 'c' : 'C',
-	        curControlX, curControlY,
-	        s[1], s[2], s[3], s[4]
-	      ];
-	    }
-	  });
-
-	  return this;
-	};
-
-
-	svgpath$1 = SvgPath;
-	return svgpath$1;
-}
-
-var svgpath;
-var hasRequiredSvgpath;
-
-function requireSvgpath () {
-	if (hasRequiredSvgpath) return svgpath;
-	hasRequiredSvgpath = 1;
-
-	svgpath = requireSvgpath$1();
-	return svgpath;
-}
-
-var svgpathExports = requireSvgpath();
-const Path = /*@__PURE__*/getDefaultExportFromCjs(svgpathExports);
-
-//Parses an SVG path into an object.
-//Taken from https://github.com/jkroso/parse-svg-path
-//Re-written so it can be used with rollup
-var length = {a: 7, c: 6, h: 1, l: 2, m: 2, q: 4, s: 4, t: 2, v: 1, z: 0};
-var segment = /([astvzqmhlc])([^astvzqmhlc]*)/ig;
-
-function parse$1(path) {
-  var data = [];
-	path.replace(segment, function(_, command, args){
-		var type = command.toLowerCase();
-		args = parseValues(args);
-
-		// overloaded moveTo
-		if (type === 'm' && args.length > 2) {
-			data.push([command].concat(args.splice(0, 2)));
-			type = 'l';
-			command = command === 'm' ? 'l' : 'L';
-		}
-
-		while (args.length >= 0) {
-			if (args.length === length[type]) {
-				args.unshift(command);
-				return data.push(args);
-			}
-			if (args.length < length[type]) {
-        throw new Error('malformed path data');
-      }
-			data.push([command].concat(args.splice(0, length[type])));
-		}
-	});
-  return data;
-}
-
-var number = /-?[0-9]*\.?[0-9]+(?:e[-+]?\d+)?/ig;
-
-function parseValues(args) {
-	var numbers = args.match(number);
-	return numbers ? numbers.map(Number) : [];
-}
-
-//Calculate Bezier curve length and positionAtLength
-//Algorithms taken from http://bl.ocks.org/hnakamur/e7efd0602bfc15f66fc5, https://gist.github.com/tunght13488/6744e77c242cc7a94859 and http://stackoverflow.com/questions/11854907/calculate-the-length-of-a-segment-of-a-quadratic-bezier
-
-function Bezier(ax, ay, bx, by, cx, cy, dx, dy) {
-  return new Bezier$1(ax, ay, bx, by, cx, cy, dx, dy);
-}
-
-function Bezier$1(ax, ay, bx, by, cx, cy, dx, dy) {
-  this.a = {x:ax, y:ay};
-  this.b = {x:bx, y:by};
-  this.c = {x:cx, y:cy};
-  this.d = {x:dx, y:dy};
-
-  if(dx !== null && dx !== undefined && dy !== null && dy !== undefined){
-    this.getArcLength = getCubicArcLength;
-    this.getPoint = cubicPoint;
-    this.getDerivative = cubicDerivative;
-  } else {
-    this.getArcLength = getQuadraticArcLength;
-    this.getPoint = quadraticPoint;
-    this.getDerivative = quadraticDerivative;
-  }
-
-  this.init();
-}
-
-Bezier$1.prototype = {
-  constructor: Bezier$1,
-  init: function() {
-
-    this.length = this.getArcLength([this.a.x, this.b.x, this.c.x, this.d.x],
-                                    [this.a.y, this.b.y, this.c.y, this.d.y]);
-  },
-
-  getTotalLength: function() {
-    return this.length;
-  },
-  getPointAtLength: function(length) {
-    var t = t2length(length, this.length, this.getArcLength,
-                    [this.a.x, this.b.x, this.c.x, this.d.x],
-                    [this.a.y, this.b.y, this.c.y, this.d.y]);
-
-    return this.getPoint([this.a.x, this.b.x, this.c.x, this.d.x],
-                                    [this.a.y, this.b.y, this.c.y, this.d.y],
-                                  t);
-  },
-  getTangentAtLength: function(length){
-    var t = t2length(length, this.length, this.getArcLength,
-                    [this.a.x, this.b.x, this.c.x, this.d.x],
-                    [this.a.y, this.b.y, this.c.y, this.d.y]);
-
-    var derivative = this.getDerivative([this.a.x, this.b.x, this.c.x, this.d.x],
-                    [this.a.y, this.b.y, this.c.y, this.d.y], t);
-    var mdl = Math.sqrt(derivative.x * derivative.x + derivative.y * derivative.y);
-    var tangent;
-    if (mdl > 0){
-      tangent = {x: derivative.x/mdl, y: derivative.y/mdl};
-    } else {
-      tangent = {x: 0, y: 0};
-    }
-    return tangent;
-  },
-  getPropertiesAtLength: function(length){
-    var t = t2length(length, this.length, this.getArcLength,
-                    [this.a.x, this.b.x, this.c.x, this.d.x],
-                    [this.a.y, this.b.y, this.c.y, this.d.y]);
-
-    var derivative = this.getDerivative([this.a.x, this.b.x, this.c.x, this.d.x],
-                    [this.a.y, this.b.y, this.c.y, this.d.y], t);
-    var mdl = Math.sqrt(derivative.x * derivative.x + derivative.y * derivative.y);
-    var tangent;
-    if (mdl > 0){
-      tangent = {x: derivative.x/mdl, y: derivative.y/mdl};
-    } else {
-      tangent = {x: 0, y: 0};
-    }
-    var point = this.getPoint([this.a.x, this.b.x, this.c.x, this.d.x],
-                                    [this.a.y, this.b.y, this.c.y, this.d.y],
-                                  t);
-    return {x: point.x, y: point.y, tangentX: tangent.x, tangentY: tangent.y};
-  }
-};
-
-function quadraticDerivative(xs, ys, t){
-  return {x: (1 - t) * 2*(xs[1] - xs[0]) +t * 2*(xs[2] - xs[1]),
-    y: (1 - t) * 2*(ys[1] - ys[0]) +t * 2*(ys[2] - ys[1])
-  };
-}
-
-function cubicDerivative(xs, ys, t){
-  var derivative = quadraticPoint(
-            [3*(xs[1] - xs[0]), 3*(xs[2] - xs[1]), 3*(xs[3] - xs[2])],
-            [3*(ys[1] - ys[0]), 3*(ys[2] - ys[1]), 3*(ys[3] - ys[2])],
-            t);
-  return derivative;
-}
-
-function t2length(length, total_length, func, xs, ys){
-  var error = 1;
-  var t = length/total_length;
-  var step = (length - func(xs, ys, t))/total_length;
-
-  while (error > 0.001){
-    var increasedTLength = func(xs, ys, t + step);
-    var decreasedTLength = func(xs, ys, t - step);
-    var increasedTError = Math.abs(length - increasedTLength)/total_length;
-    var decreasedTError = Math.abs(length - decreasedTLength)/total_length;
-    if (increasedTError < error) {
-      error = increasedTError;
-      t += step;
-    } else if (decreasedTError < error) {
-      error = decreasedTError;
-      t -= step;
-    } else {
-      step /= 2;
-    }
-  }
-
-  return t;
-}
-
-function quadraticPoint(xs, ys, t){
-  var x = (1 - t) * (1 - t) * xs[0] + 2 * (1 - t) * t * xs[1] + t * t * xs[2];
-  var y = (1 - t) * (1 - t) * ys[0] + 2 * (1 - t) * t * ys[1] + t * t * ys[2];
-  return {x: x, y: y};
-}
-
-function cubicPoint(xs, ys, t){
-  var x = (1 - t) * (1 - t) * (1 - t) * xs[0] + 3 * (1 - t) * (1 - t) * t * xs[1] +
-  3 * (1 - t) * t * t * xs[2] + t * t * t * xs[3];
-  var y = (1 - t) * (1 - t) * (1 - t) * ys[0] + 3 * (1 - t) * (1 - t) * t * ys[1] +
-  3 * (1 - t) * t * t * ys[2] + t * t * t * ys[3];
-
-  return {x: x, y: y};
-}
-
-function getQuadraticArcLength(xs, ys, t) {
-  if (t === undefined) {
-    t = 1;
-  }
-   var ax = xs[0] - 2 * xs[1] + xs[2];
-   var ay = ys[0] - 2 * ys[1] + ys[2];
-   var bx = 2 * xs[1] - 2 * xs[0];
-   var by = 2 * ys[1] - 2 * ys[0];
-
-   var A = 4 * (ax * ax + ay * ay);
-   var B = 4 * (ax * bx + ay * by);
-   var C = bx * bx + by * by;
-
-   if(A === 0){
-     return t * Math.sqrt(Math.pow(xs[2] - xs[0], 2) + Math.pow(ys[2] - ys[0], 2));
-   }
-   var b = B/(2*A);
-   var c = C/A;
-   var u = t + b;
-   var k = c - b*b;
-
-   return (Math.sqrt(A)/2)*(
-     u*Math.sqrt(u*u+k)-b*Math.sqrt(b*b+k)+
-     k*Math.log(Math.abs(
-       (u+Math.sqrt(u*u+k))/(b+Math.sqrt(b*b+k))
-     ))
-   );
-
-}
-
-// Legendre-Gauss abscissae (xi values, defined at i=n as the roots of the nth order Legendre polynomial Pn(x))
-var tValues = [
-  [],
-  [],
-  [-0.5773502691896257,0.5773502691896257645091487805019574556476],
-  [0,-0.7745966692414834,0.7745966692414833770358530799564799221665],
-  [-0.33998104358485626,0.3399810435848562648026657591032446872005,-0.8611363115940526,0.8611363115940525752239464888928095050957],
-  [0,-0.5384693101056831,0.5384693101056830910363144207002088049672,-0.906179845938664,0.9061798459386639927976268782993929651256],
-  [0.6612093864662645136613995950199053470064,-0.6612093864662645,-0.2386191860831969,0.2386191860831969086305017216807119354186,-0.932469514203152,0.9324695142031520278123015544939946091347],
-  [0, 0.4058451513773971669066064120769614633473,-0.4058451513773972,-0.7415311855993945,0.7415311855993944398638647732807884070741,-0.9491079123427585,0.9491079123427585245261896840478512624007],
-  [-0.1834346424956498,0.1834346424956498049394761423601839806667,-0.525532409916329,0.5255324099163289858177390491892463490419,-0.7966664774136267,0.7966664774136267395915539364758304368371,-0.9602898564975363,0.9602898564975362316835608685694729904282],
-  [0,-0.8360311073266358,0.8360311073266357942994297880697348765441,-0.9681602395076261,0.9681602395076260898355762029036728700494,-0.3242534234038089,0.3242534234038089290385380146433366085719,-0.6133714327005904,0.6133714327005903973087020393414741847857],
-  [-0.14887433898163122,0.1488743389816312108848260011297199846175,-0.4333953941292472,0.4333953941292471907992659431657841622000,-0.6794095682990244,0.6794095682990244062343273651148735757692,-0.8650633666889845,0.8650633666889845107320966884234930485275,-0.9739065285171717,0.9739065285171717200779640120844520534282],
-  [0,-0.26954315595234496,0.2695431559523449723315319854008615246796,-0.5190961292068118,0.5190961292068118159257256694586095544802,-0.7301520055740494,0.7301520055740493240934162520311534580496,-0.8870625997680953,0.8870625997680952990751577693039272666316,-0.978228658146057,0.9782286581460569928039380011228573907714],
-  [-0.1252334085114689,0.1252334085114689154724413694638531299833,-0.3678314989981802,0.3678314989981801937526915366437175612563,-0.5873179542866175,0.5873179542866174472967024189405342803690,-0.7699026741943047,0.7699026741943046870368938332128180759849,-0.9041172563704749,0.9041172563704748566784658661190961925375,-0.9815606342467192,0.9815606342467192506905490901492808229601],
-  [0,-0.2304583159551348,0.2304583159551347940655281210979888352115,-0.44849275103644687,0.4484927510364468528779128521276398678019,-0.6423493394403402,0.6423493394403402206439846069955156500716,-0.8015780907333099,0.8015780907333099127942064895828598903056,-0.9175983992229779,0.9175983992229779652065478365007195123904,-0.9841830547185881,0.9841830547185881494728294488071096110649],
-  [-0.10805494870734367,0.1080549487073436620662446502198347476119,-0.31911236892788974,0.3191123689278897604356718241684754668342,-0.5152486363581541,0.5152486363581540919652907185511886623088,-0.6872929048116855,0.6872929048116854701480198030193341375384,-0.827201315069765,0.8272013150697649931897947426503949610397,-0.9284348836635735,0.9284348836635735173363911393778742644770,-0.9862838086968123,0.9862838086968123388415972667040528016760],
-  [0,-0.20119409399743451,0.2011940939974345223006283033945962078128,-0.3941513470775634,0.3941513470775633698972073709810454683627,-0.5709721726085388,0.5709721726085388475372267372539106412383,-0.7244177313601701,0.7244177313601700474161860546139380096308,-0.8482065834104272,0.8482065834104272162006483207742168513662,-0.937273392400706,0.9372733924007059043077589477102094712439,-0.9879925180204854,0.9879925180204854284895657185866125811469],
-  [-0.09501250983763744,0.0950125098376374401853193354249580631303,-0.2816035507792589,0.2816035507792589132304605014604961064860,-0.45801677765722737,0.4580167776572273863424194429835775735400,-0.6178762444026438,0.6178762444026437484466717640487910189918,-0.755404408355003,0.7554044083550030338951011948474422683538,-0.8656312023878318,0.8656312023878317438804678977123931323873,-0.9445750230732326,0.9445750230732325760779884155346083450911,-0.9894009349916499,0.9894009349916499325961541734503326274262],
-  [0,-0.17848418149584785,0.1784841814958478558506774936540655574754,-0.3512317634538763,0.3512317634538763152971855170953460050405,-0.5126905370864769,0.5126905370864769678862465686295518745829,-0.6576711592166907,0.6576711592166907658503022166430023351478,-0.7815140038968014,0.7815140038968014069252300555204760502239,-0.8802391537269859,0.8802391537269859021229556944881556926234,-0.9506755217687678,0.9506755217687677612227169578958030214433,-0.9905754753144174,0.9905754753144173356754340199406652765077],
-  [-0.0847750130417353,0.0847750130417353012422618529357838117333,-0.2518862256915055,0.2518862256915055095889728548779112301628,-0.41175116146284263,0.4117511614628426460359317938330516370789,-0.5597708310739475,0.5597708310739475346078715485253291369276,-0.6916870430603532,0.6916870430603532078748910812888483894522,-0.8037049589725231,0.8037049589725231156824174550145907971032,-0.8926024664975557,0.8926024664975557392060605911271455154078,-0.9558239495713977,0.9558239495713977551811958929297763099728,-0.9915651684209309,0.9915651684209309467300160047061507702525],
-  [0,-0.16035864564022537,0.1603586456402253758680961157407435495048,-0.31656409996362983,0.3165640999636298319901173288498449178922,-0.46457074137596094,0.4645707413759609457172671481041023679762,-0.600545304661681,0.6005453046616810234696381649462392798683,-0.7209661773352294,0.7209661773352293786170958608237816296571,-0.8227146565371428,0.8227146565371428249789224867127139017745,-0.9031559036148179,0.9031559036148179016426609285323124878093,-0.96020815213483,0.9602081521348300308527788406876515266150,-0.9924068438435844,0.9924068438435844031890176702532604935893],
-  [-0.07652652113349734,0.0765265211334973337546404093988382110047,-0.22778585114164507,0.2277858511416450780804961953685746247430,-0.37370608871541955,0.3737060887154195606725481770249272373957,-0.5108670019508271,0.5108670019508270980043640509552509984254,-0.636053680726515,0.6360536807265150254528366962262859367433,-0.7463319064601508,0.7463319064601507926143050703556415903107,-0.8391169718222188,0.8391169718222188233945290617015206853296,-0.912234428251326,0.9122344282513259058677524412032981130491,-0.9639719272779138,0.9639719272779137912676661311972772219120,-0.9931285991850949,0.9931285991850949247861223884713202782226],
-  [0,-0.1455618541608951,0.1455618541608950909370309823386863301163,-0.2880213168024011,0.2880213168024010966007925160646003199090,-0.4243421202074388,0.4243421202074387835736688885437880520964,-0.5516188358872198,0.5516188358872198070590187967243132866220,-0.6671388041974123,0.6671388041974123193059666699903391625970,-0.7684399634756779,0.7684399634756779086158778513062280348209,-0.8533633645833173,0.8533633645833172836472506385875676702761,-0.9200993341504008,0.9200993341504008287901871337149688941591,-0.9672268385663063,0.9672268385663062943166222149076951614246,-0.9937521706203895,0.9937521706203895002602420359379409291933],
-  [-0.06973927331972223,0.0697392733197222212138417961186280818222,-0.20786042668822127,0.2078604266882212854788465339195457342156,-0.34193582089208424,0.3419358208920842251581474204273796195591,-0.469355837986757,0.4693558379867570264063307109664063460953,-0.5876404035069116,0.5876404035069115929588769276386473488776,-0.6944872631866827,0.6944872631866827800506898357622567712673,-0.7878168059792081,0.7878168059792081620042779554083515213881,-0.8658125777203002,0.8658125777203001365364256370193787290847,-0.926956772187174,0.9269567721871740005206929392590531966353,-0.9700604978354287,0.9700604978354287271239509867652687108059,-0.9942945854823992,0.9942945854823992920730314211612989803930],
-  [0,-0.1332568242984661,0.1332568242984661109317426822417661370104,-0.26413568097034495,0.2641356809703449305338695382833096029790,-0.3903010380302908,0.3903010380302908314214888728806054585780,-0.5095014778460075,0.5095014778460075496897930478668464305448,-0.6196098757636461,0.6196098757636461563850973116495956533871,-0.7186613631319502,0.7186613631319501944616244837486188483299,-0.8048884016188399,0.8048884016188398921511184069967785579414,-0.8767523582704416,0.8767523582704416673781568859341456716389,-0.9329710868260161,0.9329710868260161023491969890384229782357,-0.9725424712181152,0.9725424712181152319560240768207773751816,-0.9947693349975522,0.9947693349975521235239257154455743605736],
-  [-0.06405689286260563,0.0640568928626056260850430826247450385909,-0.1911188674736163,0.1911188674736163091586398207570696318404,-0.3150426796961634,0.3150426796961633743867932913198102407864,-0.4337935076260451,0.4337935076260451384870842319133497124524,-0.5454214713888396,0.5454214713888395356583756172183723700107,-0.6480936519369755,0.6480936519369755692524957869107476266696,-0.7401241915785544,0.7401241915785543642438281030999784255232,-0.820001985973903,0.8200019859739029219539498726697452080761,-0.8864155270044011,0.8864155270044010342131543419821967550873,-0.9382745520027328,0.9382745520027327585236490017087214496548,-0.9747285559713095,0.9747285559713094981983919930081690617411,-0.9951872199970213,0.9951872199970213601799974097007368118745]
-];
-
-// Legendre-Gauss weights (wi values, defined by a function linked to in the Bezier primer article)
-var cValues = [
-  [],[],
-  [1.0,1.0],
-  [0.8888888888888888888888888888888888888888,0.5555555555555555555555555555555555555555,0.5555555555555555555555555555555555555555],
-  [0.6521451548625461426269360507780005927646,0.6521451548625461426269360507780005927646,0.3478548451374538573730639492219994072353,0.3478548451374538573730639492219994072353],
-  [0.5688888888888888888888888888888888888888,0.4786286704993664680412915148356381929122,0.4786286704993664680412915148356381929122,0.2369268850561890875142640407199173626432,0.2369268850561890875142640407199173626432],
-  [0.3607615730481386075698335138377161116615,0.3607615730481386075698335138377161116615,0.4679139345726910473898703439895509948116,0.4679139345726910473898703439895509948116,0.1713244923791703450402961421727328935268,0.1713244923791703450402961421727328935268],
-  [0.4179591836734693877551020408163265306122,0.3818300505051189449503697754889751338783,0.3818300505051189449503697754889751338783,0.2797053914892766679014677714237795824869,0.2797053914892766679014677714237795824869,0.1294849661688696932706114326790820183285,0.1294849661688696932706114326790820183285],
-  [0.3626837833783619829651504492771956121941,0.3626837833783619829651504492771956121941,0.3137066458778872873379622019866013132603,0.3137066458778872873379622019866013132603,0.2223810344533744705443559944262408844301,0.2223810344533744705443559944262408844301,0.1012285362903762591525313543099621901153,0.1012285362903762591525313543099621901153],
-  [0.3302393550012597631645250692869740488788,0.1806481606948574040584720312429128095143,0.1806481606948574040584720312429128095143,0.0812743883615744119718921581105236506756,0.0812743883615744119718921581105236506756,0.3123470770400028400686304065844436655987,0.3123470770400028400686304065844436655987,0.2606106964029354623187428694186328497718,0.2606106964029354623187428694186328497718],
-  [0.2955242247147528701738929946513383294210,0.2955242247147528701738929946513383294210,0.2692667193099963550912269215694693528597,0.2692667193099963550912269215694693528597,0.2190863625159820439955349342281631924587,0.2190863625159820439955349342281631924587,0.1494513491505805931457763396576973324025,0.1494513491505805931457763396576973324025,0.0666713443086881375935688098933317928578,0.0666713443086881375935688098933317928578],
-  [0.2729250867779006307144835283363421891560,0.2628045445102466621806888698905091953727,0.2628045445102466621806888698905091953727,0.2331937645919904799185237048431751394317,0.2331937645919904799185237048431751394317,0.1862902109277342514260976414316558916912,0.1862902109277342514260976414316558916912,0.1255803694649046246346942992239401001976,0.1255803694649046246346942992239401001976,0.0556685671161736664827537204425485787285,0.0556685671161736664827537204425485787285],
-  [0.2491470458134027850005624360429512108304,0.2491470458134027850005624360429512108304,0.2334925365383548087608498989248780562594,0.2334925365383548087608498989248780562594,0.2031674267230659217490644558097983765065,0.2031674267230659217490644558097983765065,0.1600783285433462263346525295433590718720,0.1600783285433462263346525295433590718720,0.1069393259953184309602547181939962242145,0.1069393259953184309602547181939962242145,0.0471753363865118271946159614850170603170,0.0471753363865118271946159614850170603170],
-  [0.2325515532308739101945895152688359481566,0.2262831802628972384120901860397766184347,0.2262831802628972384120901860397766184347,0.2078160475368885023125232193060527633865,0.2078160475368885023125232193060527633865,0.1781459807619457382800466919960979955128,0.1781459807619457382800466919960979955128,0.1388735102197872384636017768688714676218,0.1388735102197872384636017768688714676218,0.0921214998377284479144217759537971209236,0.0921214998377284479144217759537971209236,0.0404840047653158795200215922009860600419,0.0404840047653158795200215922009860600419],
-  [0.2152638534631577901958764433162600352749,0.2152638534631577901958764433162600352749,0.2051984637212956039659240656612180557103,0.2051984637212956039659240656612180557103,0.1855383974779378137417165901251570362489,0.1855383974779378137417165901251570362489,0.1572031671581935345696019386238421566056,0.1572031671581935345696019386238421566056,0.1215185706879031846894148090724766259566,0.1215185706879031846894148090724766259566,0.0801580871597602098056332770628543095836,0.0801580871597602098056332770628543095836,0.0351194603317518630318328761381917806197,0.0351194603317518630318328761381917806197],
-  [0.2025782419255612728806201999675193148386,0.1984314853271115764561183264438393248186,0.1984314853271115764561183264438393248186,0.1861610000155622110268005618664228245062,0.1861610000155622110268005618664228245062,0.1662692058169939335532008604812088111309,0.1662692058169939335532008604812088111309,0.1395706779261543144478047945110283225208,0.1395706779261543144478047945110283225208,0.1071592204671719350118695466858693034155,0.1071592204671719350118695466858693034155,0.0703660474881081247092674164506673384667,0.0703660474881081247092674164506673384667,0.0307532419961172683546283935772044177217,0.0307532419961172683546283935772044177217],
-  [0.1894506104550684962853967232082831051469,0.1894506104550684962853967232082831051469,0.1826034150449235888667636679692199393835,0.1826034150449235888667636679692199393835,0.1691565193950025381893120790303599622116,0.1691565193950025381893120790303599622116,0.1495959888165767320815017305474785489704,0.1495959888165767320815017305474785489704,0.1246289712555338720524762821920164201448,0.1246289712555338720524762821920164201448,0.0951585116824927848099251076022462263552,0.0951585116824927848099251076022462263552,0.0622535239386478928628438369943776942749,0.0622535239386478928628438369943776942749,0.0271524594117540948517805724560181035122,0.0271524594117540948517805724560181035122],
-  [0.1794464703562065254582656442618856214487,0.1765627053669926463252709901131972391509,0.1765627053669926463252709901131972391509,0.1680041021564500445099706637883231550211,0.1680041021564500445099706637883231550211,0.1540457610768102880814315948019586119404,0.1540457610768102880814315948019586119404,0.1351363684685254732863199817023501973721,0.1351363684685254732863199817023501973721,0.1118838471934039710947883856263559267358,0.1118838471934039710947883856263559267358,0.0850361483171791808835353701910620738504,0.0850361483171791808835353701910620738504,0.0554595293739872011294401653582446605128,0.0554595293739872011294401653582446605128,0.0241483028685479319601100262875653246916,0.0241483028685479319601100262875653246916],
-  [0.1691423829631435918406564701349866103341,0.1691423829631435918406564701349866103341,0.1642764837458327229860537764659275904123,0.1642764837458327229860537764659275904123,0.1546846751262652449254180038363747721932,0.1546846751262652449254180038363747721932,0.1406429146706506512047313037519472280955,0.1406429146706506512047313037519472280955,0.1225552067114784601845191268002015552281,0.1225552067114784601845191268002015552281,0.1009420441062871655628139849248346070628,0.1009420441062871655628139849248346070628,0.0764257302548890565291296776166365256053,0.0764257302548890565291296776166365256053,0.0497145488949697964533349462026386416808,0.0497145488949697964533349462026386416808,0.0216160135264833103133427102664524693876,0.0216160135264833103133427102664524693876],
-  [0.1610544498487836959791636253209167350399,0.1589688433939543476499564394650472016787,0.1589688433939543476499564394650472016787,0.1527660420658596667788554008976629984610,0.1527660420658596667788554008976629984610,0.1426067021736066117757461094419029724756,0.1426067021736066117757461094419029724756,0.1287539625393362276755157848568771170558,0.1287539625393362276755157848568771170558,0.1115666455473339947160239016817659974813,0.1115666455473339947160239016817659974813,0.0914900216224499994644620941238396526609,0.0914900216224499994644620941238396526609,0.0690445427376412265807082580060130449618,0.0690445427376412265807082580060130449618,0.0448142267656996003328381574019942119517,0.0448142267656996003328381574019942119517,0.0194617882297264770363120414644384357529,0.0194617882297264770363120414644384357529],
-  [0.1527533871307258506980843319550975934919,0.1527533871307258506980843319550975934919,0.1491729864726037467878287370019694366926,0.1491729864726037467878287370019694366926,0.1420961093183820513292983250671649330345,0.1420961093183820513292983250671649330345,0.1316886384491766268984944997481631349161,0.1316886384491766268984944997481631349161,0.1181945319615184173123773777113822870050,0.1181945319615184173123773777113822870050,0.1019301198172404350367501354803498761666,0.1019301198172404350367501354803498761666,0.0832767415767047487247581432220462061001,0.0832767415767047487247581432220462061001,0.0626720483341090635695065351870416063516,0.0626720483341090635695065351870416063516,0.0406014298003869413310399522749321098790,0.0406014298003869413310399522749321098790,0.0176140071391521183118619623518528163621,0.0176140071391521183118619623518528163621],
-  [0.1460811336496904271919851476833711882448,0.1445244039899700590638271665537525436099,0.1445244039899700590638271665537525436099,0.1398873947910731547221334238675831108927,0.1398873947910731547221334238675831108927,0.1322689386333374617810525744967756043290,0.1322689386333374617810525744967756043290,0.1218314160537285341953671771257335983563,0.1218314160537285341953671771257335983563,0.1087972991671483776634745780701056420336,0.1087972991671483776634745780701056420336,0.0934444234560338615532897411139320884835,0.0934444234560338615532897411139320884835,0.0761001136283793020170516533001831792261,0.0761001136283793020170516533001831792261,0.0571344254268572082836358264724479574912,0.0571344254268572082836358264724479574912,0.0369537897708524937999506682993296661889,0.0369537897708524937999506682993296661889,0.0160172282577743333242246168584710152658,0.0160172282577743333242246168584710152658],
-  [0.1392518728556319933754102483418099578739,0.1392518728556319933754102483418099578739,0.1365414983460151713525738312315173965863,0.1365414983460151713525738312315173965863,0.1311735047870623707329649925303074458757,0.1311735047870623707329649925303074458757,0.1232523768105124242855609861548144719594,0.1232523768105124242855609861548144719594,0.1129322960805392183934006074217843191142,0.1129322960805392183934006074217843191142,0.1004141444428809649320788378305362823508,0.1004141444428809649320788378305362823508,0.0859416062170677274144436813727028661891,0.0859416062170677274144436813727028661891,0.0697964684245204880949614189302176573987,0.0697964684245204880949614189302176573987,0.0522933351526832859403120512732112561121,0.0522933351526832859403120512732112561121,0.0337749015848141547933022468659129013491,0.0337749015848141547933022468659129013491,0.0146279952982722006849910980471854451902,0.0146279952982722006849910980471854451902],
-  [0.1336545721861061753514571105458443385831,0.1324620394046966173716424647033169258050,0.1324620394046966173716424647033169258050,0.1289057221880821499785953393997936532597,0.1289057221880821499785953393997936532597,0.1230490843067295304675784006720096548158,0.1230490843067295304675784006720096548158,0.1149966402224113649416435129339613014914,0.1149966402224113649416435129339613014914,0.1048920914645414100740861850147438548584,0.1048920914645414100740861850147438548584,0.0929157660600351474770186173697646486034,0.0929157660600351474770186173697646486034,0.0792814117767189549228925247420432269137,0.0792814117767189549228925247420432269137,0.0642324214085258521271696151589109980391,0.0642324214085258521271696151589109980391,0.0480376717310846685716410716320339965612,0.0480376717310846685716410716320339965612,0.0309880058569794443106942196418845053837,0.0309880058569794443106942196418845053837,0.0134118594871417720813094934586150649766,0.0134118594871417720813094934586150649766],
-  [0.1279381953467521569740561652246953718517,0.1279381953467521569740561652246953718517,0.1258374563468282961213753825111836887264,0.1258374563468282961213753825111836887264,0.1216704729278033912044631534762624256070,0.1216704729278033912044631534762624256070,0.1155056680537256013533444839067835598622,0.1155056680537256013533444839067835598622,0.1074442701159656347825773424466062227946,0.1074442701159656347825773424466062227946,0.0976186521041138882698806644642471544279,0.0976186521041138882698806644642471544279,0.0861901615319532759171852029837426671850,0.0861901615319532759171852029837426671850,0.0733464814110803057340336152531165181193,0.0733464814110803057340336152531165181193,0.0592985849154367807463677585001085845412,0.0592985849154367807463677585001085845412,0.0442774388174198061686027482113382288593,0.0442774388174198061686027482113382288593,0.0285313886289336631813078159518782864491,0.0285313886289336631813078159518782864491,0.0123412297999871995468056670700372915759,0.0123412297999871995468056670700372915759]
-];
-
-// LUT for binomial coefficient arrays per curve order 'n'
-var binomialCoefficients = [[1], [1, 1], [1, 2, 1], [1, 3, 3, 1]];
-
-// Look up what the binomial coefficient is for pair {n,k}
-function binomials(n, k) {
-  return binomialCoefficients[n][k];
-}
-
-/**
- * Compute the curve derivative (hodograph) at t.
- */
-function getDerivative(derivative, t, vs) {
-  // the derivative of any 't'-less function is zero.
-  var n = vs.length - 1,
-      _vs,
-      value,
-      k;
-  if (n === 0) {
-    return 0;
-  }
-
-  // direct values? compute!
-  if (derivative === 0) {
-    value = 0;
-    for (k = 0; k <= n; k++) {
-      value += binomials(n, k) * Math.pow(1 - t, n - k) * Math.pow(t, k) * vs[k];
-    }
-    return value;
-  } else {
-    // Still some derivative? go down one order, then try
-    // for the lower order curve's.
-    _vs = new Array(n);
-    for (k = 0; k < n; k++) {
-      _vs[k] = n * (vs[k + 1] - vs[k]);
-    }
-    return getDerivative(derivative - 1, t, _vs);
-  }
-}
-
-function B(xs, ys, t) {
-  var xbase = getDerivative(1, t, xs);
-  var ybase = getDerivative(1, t, ys);
-  var combined = xbase * xbase + ybase * ybase;
-  return Math.sqrt(combined);
-}
-
-function getCubicArcLength(xs, ys, t) {
-  var z, sum, i, correctedT;
-
-  /*if (xs.length >= tValues.length) {
-    throw new Error('too high n bezier');
-  }*/
-
-  if (t === undefined) {
-    t = 1;
-  }
-  var n = 20;
-
-  z = t / 2;
-  sum = 0;
-  for (i = 0; i < n; i++) {
-    correctedT = z * tValues[n][i] + z;
-    sum += cValues[n][i] * B(xs, ys, correctedT);
-  }
-  return z * sum;
-}
-
-//This file is taken from the following project: https://github.com/fontello/svgpath
-// Convert an arc to a sequence of cubic bézier curves
-//
-
-
-var TAU = Math.PI * 2;
-
-
-/* eslint-disable space-infix-ops */
-
-// Calculate an angle between two unit vectors
-//
-// Since we measure angle between radii of circular arcs,
-// we can use simplified math (without length normalization)
-//
-function unit_vector_angle(ux, uy, vx, vy) {
-  var sign = (ux * vy - uy * vx < 0) ? -1 : 1;
-  var dot  = ux * vx + uy * vy;
-
-  // Add this to work with arbitrary vectors:
-  // dot /= Math.sqrt(ux * ux + uy * uy) * Math.sqrt(vx * vx + vy * vy);
-
-  // rounding errors, e.g. -1.0000000000000002 can screw up this
-  if (dot >  1.0) { dot =  1.0; }
-  if (dot < -1) { dot = -1; }
-
-  return sign * Math.acos(dot);
-}
-
-
-// Convert from endpoint to center parameterization,
-// see http://www.w3.org/TR/SVG11/implnote.html#ArcImplementationNotes
-//
-// Return [cx, cy, theta1, delta_theta]
-//
-function get_arc_center(x1, y1, x2, y2, fa, fs, rx, ry, sin_phi, cos_phi) {
-  // Step 1.
-  //
-  // Moving an ellipse so origin will be the middlepoint between our two
-  // points. After that, rotate it to line up ellipse axes with coordinate
-  // axes.
-  //
-  var x1p =  cos_phi*(x1-x2)/2 + sin_phi*(y1-y2)/2;
-  var y1p = -sin_phi*(x1-x2)/2 + cos_phi*(y1-y2)/2;
-
-  var rx_sq  =  rx * rx;
-  var ry_sq  =  ry * ry;
-  var x1p_sq = x1p * x1p;
-  var y1p_sq = y1p * y1p;
-
-  // Step 2.
-  //
-  // Compute coordinates of the centre of this ellipse (cx', cy')
-  // in the new coordinate system.
-  //
-  var radicant = (rx_sq * ry_sq) - (rx_sq * y1p_sq) - (ry_sq * x1p_sq);
-
-  if (radicant < 0) {
-    // due to rounding errors it might be e.g. -1.3877787807814457e-17
-    radicant = 0;
-  }
-
-  radicant /=   (rx_sq * y1p_sq) + (ry_sq * x1p_sq);
-  radicant = Math.sqrt(radicant) * (fa === fs ? -1 : 1);
-
-  var cxp = radicant *  rx/ry * y1p;
-  var cyp = radicant * -ry/rx * x1p;
-
-  // Step 3.
-  //
-  // Transform back to get centre coordinates (cx, cy) in the original
-  // coordinate system.
-  //
-  var cx = cos_phi*cxp - sin_phi*cyp + (x1+x2)/2;
-  var cy = sin_phi*cxp + cos_phi*cyp + (y1+y2)/2;
-
-  // Step 4.
-  //
-  // Compute angles (theta1, delta_theta).
-  //
-  var v1x =  (x1p - cxp) / rx;
-  var v1y =  (y1p - cyp) / ry;
-  var v2x = (-x1p - cxp) / rx;
-  var v2y = (-y1p - cyp) / ry;
-
-  var theta1 = unit_vector_angle(1, 0, v1x, v1y);
-  var delta_theta = unit_vector_angle(v1x, v1y, v2x, v2y);
-
-  if (fs === 0 && delta_theta > 0) {
-    delta_theta -= TAU;
-  }
-  if (fs === 1 && delta_theta < 0) {
-    delta_theta += TAU;
-  }
-
-  return [ cx, cy, theta1, delta_theta ];
-}
-
-//
-// Approximate one unit arc segment with bézier curves,
-// see http://math.stackexchange.com/questions/873224
-//
-function approximate_unit_arc(theta1, delta_theta) {
-  var alpha = 4/3 * Math.tan(delta_theta/4);
-
-  var x1 = Math.cos(theta1);
-  var y1 = Math.sin(theta1);
-  var x2 = Math.cos(theta1 + delta_theta);
-  var y2 = Math.sin(theta1 + delta_theta);
-
-  return [ x1, y1, x1 - y1*alpha, y1 + x1*alpha, x2 + y2*alpha, y2 - x2*alpha, x2, y2 ];
-}
-
-function a2c(x1, y1, rx, ry, phi, fa, fs, x2, y2) {
-  var sin_phi = Math.sin(phi * TAU / 360);
-  var cos_phi = Math.cos(phi * TAU / 360);
-
-  // Make sure radii are valid
-  //
-  var x1p =  cos_phi*(x1-x2)/2 + sin_phi*(y1-y2)/2;
-  var y1p = -sin_phi*(x1-x2)/2 + cos_phi*(y1-y2)/2;
-
-  if (x1p === 0 && y1p === 0) {
-    // we're asked to draw line to itself
-    return [];
-  }
-
-  if (rx === 0 || ry === 0) {
-    // one of the radii is zero
-    return [];
-  }
-
-
-  // Compensate out-of-range radii
-  //
-  rx = Math.abs(rx);
-  ry = Math.abs(ry);
-
-  var lambda = (x1p * x1p) / (rx * rx) + (y1p * y1p) / (ry * ry);
-  if (lambda > 1) {
-    rx *= Math.sqrt(lambda);
-    ry *= Math.sqrt(lambda);
-  }
-
-
-  // Get center parameters (cx, cy, theta1, delta_theta)
-  //
-  var cc = get_arc_center(x1, y1, x2, y2, fa, fs, rx, ry, sin_phi, cos_phi);
-
-  var result = [];
-  var theta1 = cc[2];
-  var delta_theta = cc[3];
-
-  // Split an arc to multiple segments, so each segment
-  // will be less than τ/4 (= 90°)
-  //
-  var segments = Math.max(Math.ceil(Math.abs(delta_theta) / (TAU / 4)), 1);
-  delta_theta /= segments;
-
-  for (var i = 0; i < segments; i++) {
-    result.push(approximate_unit_arc(theta1, delta_theta));
-    theta1 += delta_theta;
-  }
-
-  // We have a bezier approximation of a unit circle,
-  // now need to transform back to the original ellipse
-  //
-  return result.map(function (curve) {
-    for (var i = 0; i < curve.length; i += 2) {
-      var x = curve[i + 0];
-      var y = curve[i + 1];
-
-      // scale
-      x *= rx;
-      y *= ry;
-
-      // rotate
-      var xp = cos_phi*x - sin_phi*y;
-      var yp = sin_phi*x + cos_phi*y;
-
-      // translate
-      curve[i + 0] = xp + cc[0];
-      curve[i + 1] = yp + cc[1];
-    }
-
-    return curve;
-  });
-}
-
-//Calculate ans Arc curve length and positionAtLength
-//Definitions taken from https://developer.mozilla.org/en-US/docs/Web/SVG/Tutorial/Paths
-
-
-function Arc(x0, y0, rx,ry, xAxisRotate, LargeArcFlag,SweepFlag, x,y) {
-  return new Arc$1(x0, y0, rx,ry, xAxisRotate, LargeArcFlag,SweepFlag, x,y);
-}
-
-function Arc$1(x0, y0,rx,ry, xAxisRotate, LargeArcFlag,SweepFlag,x,y) {
-    var length = 0;
-    var partialLengths = [];
-    var curves = [];
-    var res = a2c(x0, y0,rx,ry, xAxisRotate, LargeArcFlag,SweepFlag,x,y);
-    res.forEach(function(d){
-        var curve = new Bezier(d[0], d[1], d[2], d[3], d[4], d[5], d[6], d[7]);
-        var curveLength = curve.getTotalLength();
-        length += curveLength;
-        partialLengths.push(curveLength);
-        curves.push(curve);
-    });
-    this.length = length;
-    this.partialLengths = partialLengths;
-    this.curves = curves;
-}
-
-Arc$1.prototype = {
-  constructor: Arc$1,
-  init: function() {
-
-    
-  },
-
-  getTotalLength: function() {
-    return this.length;
-  },
-  getPointAtLength: function(fractionLength) {
-    
-    if(fractionLength < 0){
-      fractionLength = 0;
-    } else if(fractionLength > this.length){
-      fractionLength = this.length;
-    }
-    var i = this.partialLengths.length - 1;
-
-    while(this.partialLengths[i] >= fractionLength && this.partialLengths[i] > 0){
-      i--;
-    }
-    if(i<this.partialLengths.length-1){
-        i++;
-    }
-
-    var lengthOffset = 0;
-    for(var j=0; j<i; j++){
-        lengthOffset += this.partialLengths[j];
-    }
-
-    return this.curves[i].getPointAtLength(fractionLength - lengthOffset);
-  },
-  getTangentAtLength: function(fractionLength) {
-    if(fractionLength < 0){
-        fractionLength = 0;
-        } else if(fractionLength > this.length){
-        fractionLength = this.length;
-        }
-        var i = this.partialLengths.length - 1;
-
-        while(this.partialLengths[i] >= fractionLength && this.partialLengths[i] > 0){
-        i--;
-        }
-        if(i<this.partialLengths.length-1){
-            i++;
-        }
-
-        var lengthOffset = 0;
-        for(var j=0; j<i; j++){
-            lengthOffset += this.partialLengths[j];
-        }
-
-    return this.curves[i].getTangentAtLength(fractionLength - lengthOffset);
-  },
-  getPropertiesAtLength: function(fractionLength){
-    var tangent = this.getTangentAtLength(fractionLength);
-    var point = this.getPointAtLength(fractionLength);
-    return {x: point.x, y: point.y, tangentX: tangent.x, tangentY: tangent.y};
-  }
-};
-
-function LinearPosition(x0, x1, y0, y1) {
-  return new LinearPosition$1(x0, x1, y0, y1);
-
-}
-
-function LinearPosition$1(x0, x1, y0, y1){
-  this.x0 = x0;
-  this.x1 = x1;
-  this.y0 = y0;
-  this.y1 = y1;
-}
-
-LinearPosition$1.prototype.getTotalLength = function(){
-  return Math.sqrt(Math.pow(this.x0 - this.x1, 2) +
-         Math.pow(this.y0 - this.y1, 2));
-};
-
-LinearPosition$1.prototype.getPointAtLength = function(pos){
-  var fraction = pos/ (Math.sqrt(Math.pow(this.x0 - this.x1, 2) +
-         Math.pow(this.y0 - this.y1, 2)));
-
-  var newDeltaX = (this.x1 - this.x0)*fraction;
-  var newDeltaY = (this.y1 - this.y0)*fraction;
-  return { x: this.x0 + newDeltaX, y: this.y0 + newDeltaY };
-};
-LinearPosition$1.prototype.getTangentAtLength = function(){
-  var module = Math.sqrt((this.x1 - this.x0) * (this.x1 - this.x0) +
-              (this.y1 - this.y0) * (this.y1 - this.y0));
-  return { x: (this.x1 - this.x0)/module, y: (this.y1 - this.y0)/module };
-};
-LinearPosition$1.prototype.getPropertiesAtLength = function(pos){
-  var point = this.getPointAtLength(pos);
-  var tangent = this.getTangentAtLength();
-  return {x: point.x, y: point.y, tangentX: tangent.x, tangentY: tangent.y};
-};
-
-function svgPathProperties(svgString) {
-  var length = 0;
-  var partial_lengths = [];
-  var functions = [];
-
-  function svgProperties(string){
-    if(!string){return null;}
-    var parsed = parse$1(string);
-    var cur = [0, 0];
-    var prev_point = [0, 0];
-    var curve;
-    var ringStart;
-    for (var i = 0; i < parsed.length; i++){
-      //moveTo
-      if(parsed[i][0] === "M"){
-        cur = [parsed[i][1], parsed[i][2]];
-        ringStart = [cur[0], cur[1]];
-        functions.push(null);
-      } else if(parsed[i][0] === "m"){
-        cur = [parsed[i][1] + cur[0], parsed[i][2] + cur[1]];
-        ringStart = [cur[0], cur[1]];
-        functions.push(null);
-      }
-      //lineTo
-      else if(parsed[i][0] === "L"){
-        length = length + Math.sqrt(Math.pow(cur[0] - parsed[i][1], 2) + Math.pow(cur[1] - parsed[i][2], 2));
-        functions.push(new LinearPosition(cur[0], parsed[i][1], cur[1], parsed[i][2]));
-        cur = [parsed[i][1], parsed[i][2]];
-      } else if(parsed[i][0] === "l"){
-        length = length + Math.sqrt(Math.pow(parsed[i][1], 2) + Math.pow(parsed[i][2], 2));
-        functions.push(new LinearPosition(cur[0], parsed[i][1] + cur[0], cur[1], parsed[i][2] + cur[1]));
-        cur = [parsed[i][1] + cur[0], parsed[i][2] + cur[1]];
-      } else if(parsed[i][0] === "H"){
-        length = length + Math.abs(cur[0] - parsed[i][1]);
-        functions.push(new LinearPosition(cur[0], parsed[i][1], cur[1], cur[1]));
-        cur[0] = parsed[i][1];
-      } else if(parsed[i][0] === "h"){
-        length = length + Math.abs(parsed[i][1]);
-        functions.push(new LinearPosition(cur[0], cur[0] + parsed[i][1], cur[1], cur[1]));
-        cur[0] = parsed[i][1] + cur[0];
-      } else if(parsed[i][0] === "V"){
-        length = length + Math.abs(cur[1] - parsed[i][1]);
-        functions.push(new LinearPosition(cur[0], cur[0], cur[1], parsed[i][1]));
-        cur[1] = parsed[i][1];
-      } else if(parsed[i][0] === "v"){
-        length = length + Math.abs(parsed[i][1]);
-        functions.push(new LinearPosition(cur[0], cur[0], cur[1], cur[1] + parsed[i][1]));
-        cur[1] = parsed[i][1] + cur[1];
-      //Close path
-      }  else if(parsed[i][0] === "z" || parsed[i][0] === "Z"){
-        length = length + Math.sqrt(Math.pow(ringStart[0] - cur[0], 2) + Math.pow(ringStart[1] - cur[1], 2));
-        functions.push(new LinearPosition(cur[0], ringStart[0], cur[1], ringStart[1]));
-        cur = [ringStart[0], ringStart[1]];
-      }
-      //Cubic Bezier curves
-      else if(parsed[i][0] === "C"){
-        curve = new Bezier(cur[0], cur[1] , parsed[i][1], parsed[i][2] , parsed[i][3], parsed[i][4] , parsed[i][5], parsed[i][6]);
-        length = length + curve.getTotalLength();
-        cur = [parsed[i][5], parsed[i][6]];
-        functions.push(curve);
-      } else if(parsed[i][0] === "c"){
-        curve = new Bezier(cur[0], cur[1] , cur[0] + parsed[i][1], cur[1] + parsed[i][2] , cur[0] + parsed[i][3], cur[1] + parsed[i][4] , cur[0] + parsed[i][5], cur[1] + parsed[i][6]);
-        length = length + curve.getTotalLength();
-        cur = [parsed[i][5] + cur[0], parsed[i][6] + cur[1]];
-        functions.push(curve);
-      } else if(parsed[i][0] === "S"){
-        if(i>0 && ["C","c","S","s"].indexOf(parsed[i-1][0]) > -1){
-          curve = new Bezier(cur[0], cur[1] , 2*cur[0] - parsed[i-1][parsed[i-1].length - 4], 2*cur[1] - parsed[i-1][parsed[i-1].length - 3], parsed[i][1], parsed[i][2] , parsed[i][3], parsed[i][4]);
-        } else {
-          curve = new Bezier(cur[0], cur[1] , cur[0], cur[1], parsed[i][1], parsed[i][2] , parsed[i][3], parsed[i][4]);
-        }
-        length = length + curve.getTotalLength();
-        cur = [parsed[i][3], parsed[i][4]];
-        functions.push(curve);
-      }  else if(parsed[i][0] === "s"){ //240 225
-        if(i>0 && ["C","c","S","s"].indexOf(parsed[i-1][0]) > -1){
-          curve = new Bezier(cur[0], cur[1] , cur[0] + curve.d.x - curve.c.x, cur[1] + curve.d.y - curve.c.y, cur[0] + parsed[i][1], cur[1] + parsed[i][2] , cur[0] + parsed[i][3], cur[1] + parsed[i][4]);
-        } else {
-          curve = new Bezier(cur[0], cur[1] , cur[0], cur[1], cur[0] + parsed[i][1], cur[1] + parsed[i][2] , cur[0] + parsed[i][3], cur[1] + parsed[i][4]);
-        }
-        length = length + curve.getTotalLength();
-        cur = [parsed[i][3] + cur[0], parsed[i][4] + cur[1]];
-        functions.push(curve);
-      }
-      //Quadratic Bezier curves
-      else if(parsed[i][0] === "Q"){
-        if(cur[0] != parsed[i][1] && cur[1] != parsed[i][2]){
-          curve = new Bezier(cur[0], cur[1] , parsed[i][1], parsed[i][2] , parsed[i][3], parsed[i][4]);
-        } else {
-          curve = new LinearPosition(parsed[i][1], parsed[i][3], parsed[i][2], parsed[i][4]);
-        }
-        length = length + curve.getTotalLength();
-        functions.push(curve);
-        cur = [parsed[i][3], parsed[i][4]];
-        prev_point = [parsed[i][1], parsed[i][2]];
-
-      }  else if(parsed[i][0] === "q"){
-        if(!(parsed[i][1] == 0 && parsed[i][2] == 0)){
-          curve = new Bezier(cur[0], cur[1] , cur[0] + parsed[i][1], cur[1] + parsed[i][2] , cur[0] + parsed[i][3], cur[1] + parsed[i][4]);
-        } else {
-          curve = new LinearPosition(cur[0] + parsed[i][1], cur[0] + parsed[i][3], cur[1] + parsed[i][2], cur[1] + parsed[i][4]);
-        }
-        length = length + curve.getTotalLength();
-        prev_point = [cur[0] + parsed[i][1], cur[1] + parsed[i][2]];
-        cur = [parsed[i][3] + cur[0], parsed[i][4] + cur[1]];
-        functions.push(curve);
-      } else if(parsed[i][0] === "T"){
-        if(i>0 && ["Q","q","T","t"].indexOf(parsed[i-1][0]) > -1){
-          curve = new Bezier(cur[0], cur[1] , 2 * cur[0] - prev_point[0] , 2 * cur[1] - prev_point[1] , parsed[i][1], parsed[i][2]);
-        } else {
-          curve = new LinearPosition(cur[0], parsed[i][1], cur[1], parsed[i][2]);
-        }
-        functions.push(curve);
-        length = length + curve.getTotalLength();
-        prev_point = [2 * cur[0] - prev_point[0] , 2 * cur[1] - prev_point[1]];
-        cur = [parsed[i][1], parsed[i][2]];
-
-      } else if(parsed[i][0] === "t"){
-        if(i>0 && ["Q","q","T","t"].indexOf(parsed[i-1][0]) > -1){
-          curve = new Bezier(cur[0], cur[1] , 2 * cur[0] - prev_point[0] , 2 * cur[1] - prev_point[1] , cur[0] + parsed[i][1], cur[1] + parsed[i][2]);
-        } else {
-          curve = new LinearPosition(cur[0], cur[0] + parsed[i][1], cur[1], cur[1] + parsed[i][2]);
-        }
-        length = length + curve.getTotalLength();
-        prev_point = [2 * cur[0] - prev_point[0] , 2 * cur[1] - prev_point[1]];
-        cur = [parsed[i][1] + cur[0], parsed[i][2] + cur[0]];
-        functions.push(curve);
-      } else if(parsed[i][0] === "A"){
-        curve = new Arc(cur[0], cur[1], parsed[i][1], parsed[i][2], parsed[i][3], parsed[i][4], parsed[i][5], parsed[i][6], parsed[i][7]);
-
-        length = length + curve.getTotalLength();
-        cur = [parsed[i][6], parsed[i][7]];
-        functions.push(curve);
-      } else if(parsed[i][0] === "a"){
-        curve = new Arc(cur[0], cur[1], parsed[i][1], parsed[i][2], parsed[i][3], parsed[i][4], parsed[i][5], cur[0] + parsed[i][6], cur[1] + parsed[i][7]);
-
-        length = length + curve.getTotalLength();
-        cur = [cur[0] + parsed[i][6], cur[1] + parsed[i][7]];
-        functions.push(curve);
-      }
-      partial_lengths.push(length);
-
-    }
-    return svgProperties;
-  }
-
- svgProperties.getTotalLength = function(){
-    return length;
-  };
-
-  svgProperties.getPointAtLength = function(fractionLength){
-    var fractionPart = getPartAtLength(fractionLength);
-    return functions[fractionPart.i].getPointAtLength(fractionPart.fraction);
-  };
-
-  svgProperties.getTangentAtLength = function(fractionLength){
-    var fractionPart = getPartAtLength(fractionLength);
-    return functions[fractionPart.i].getTangentAtLength(fractionPart.fraction);
-  };
-
-  svgProperties.getPropertiesAtLength = function(fractionLength){
-    var fractionPart = getPartAtLength(fractionLength);
-    return functions[fractionPart.i].getPropertiesAtLength(fractionPart.fraction);
-  };
-
-  var getPartAtLength = function(fractionLength){
-    if(fractionLength < 0){
-      fractionLength = 0;
-    } else if(fractionLength > length){
-      fractionLength = length;
-    }
-
-    var i = partial_lengths.length - 1;
-
-    while(partial_lengths[i] >= fractionLength && partial_lengths[i] > 0){
-      i--;
-    }
-    i++;
-    return {fraction: fractionLength-partial_lengths[i-1], i: i};
-  };
-
-  return svgProperties(svgString);
-}
-
-function distance(a, b) {
-  return Math.sqrt((a[0] - b[0]) * (a[0] - b[0]) + (a[1] - b[1]) * (a[1] - b[1]));
-}
-
-function pointAlong(a, b, pct) {
-  return [a[0] + (b[0] - a[0]) * pct, a[1] + (b[1] - a[1]) * pct];
-}
-
-function samePoint(a, b) {
-  return distance(a, b) < 1e-9;
-}
-
-function interpolatePoints(a, b, string) {
-  let interpolators = a.map((d, i) => interpolatePoint(d, b[i]));
-
-  return function(t) {
-    let values = interpolators.map(fn => fn(t));
-    return string ? toPathString(values) : values;
-  };
-}
-
-function interpolatePoint(a, b) {
-  return function(t) {
-    return a.map((d, i) => d + t * (b[i] - d));
-  };
-}
-
-function isFiniteNumber(number) {
-  return typeof number === "number" && isFinite(number);
-}
-
-const INVALID_INPUT = `All shapes must be supplied as arrays of [x, y] points or an SVG path string (https://developer.mozilla.org/en-US/docs/Web/SVG/Attribute/d).
-Example valid ways of supplying a shape would be:
-[[0, 0], [10, 0], [10, 10]]
-"M0,0 L10,0 L10,10Z"
-`;
-
-function parse(str) {
-  return new Path(str).abs();
-}
-
-function split(parsed) {
-  return parsed
-    .toString()
-    .split("M")
-    .map((d, i) => {
-      d = d.trim();
-      return i && d ? "M" + d : d;
-    })
-    .filter(d => d);
-}
-
-function toPathString(ring) {
-  return "M" + ring.join("L") + "Z";
-}
-
-function pathStringToRing(str, maxSegmentLength) {
-  let parsed = parse(str);
-
-  return exactRing(parsed) || approximateRing(parsed, maxSegmentLength);
-}
-
-function exactRing(parsed) {
-  let segments = parsed.segments || [],
-    ring = [];
-
-  if (!segments.length || segments[0][0] !== "M") {
-    return false;
-  }
-
-  for (let i = 0; i < segments.length; i++) {
-    let [command, x, y] = segments[i];
-    if ((command === "M" && i) || command === "Z") {
-      break;
-    } else if (command === "M" || command === "L") {
-      ring.push([x, y]);
-    } else if (command === "H") {
-      ring.push([x, ring[ring.length - 1][1]]);
-    } else if (command === "V") {
-      ring.push([ring[ring.length - 1][0], x]);
-    } else {
-      return false;
-    }
-  }
-
-  return ring.length ? { ring } : false;
-}
-
-function approximateRing(parsed, maxSegmentLength) {
-  let ringPath = split(parsed)[0],
-    ring = [],
-    len,
-    m,
-    numPoints = 3;
-
-  if (!ringPath) {
-    throw new TypeError(INVALID_INPUT);
-  }
-
-  m = measure(ringPath);
-  len = m.getTotalLength();
-
-  if (maxSegmentLength && isFiniteNumber(maxSegmentLength) && maxSegmentLength > 0) {
-    numPoints = Math.max(numPoints, Math.ceil(len / maxSegmentLength));
-  }
-
-  for (let i = 0; i < numPoints; i++) {
-    let p = m.getPointAtLength(len * i / numPoints);
-    ring.push([p.x, p.y]);
-  }
-
-  return {
-    ring,
-    skipBisect: true
-  };
-}
-
-function measure(d) {
-  // Use native browser measurement if running in browser
-  if (typeof window !== "undefined" && window && window.document) {
-    try {
-      let path = window.document.createElementNS("http://www.w3.org/2000/svg", "path");
-      path.setAttributeNS(null, "d", d);
-      return path;
-    } catch (e) {}
-  }
-  // Fall back to svg-path-properties
-  return svgPathProperties(d);
-}
-
-function addPoints(ring, numPoints) {
-  const desiredLength = ring.length + numPoints,
-    step = polygonLength(ring) / numPoints;
-
-  let i = 0,
-    cursor = 0,
-    insertAt = step / 2;
-
-  while (ring.length < desiredLength) {
-    let a = ring[i],
-      b = ring[(i + 1) % ring.length],
-      segment = distance(a, b);
-
-    if (insertAt <= cursor + segment) {
-      ring.splice(i + 1, 0, segment ? pointAlong(a, b, (insertAt - cursor) / segment) : a.slice(0));
-      insertAt += step;
-      continue;
-    }
-
-    cursor += segment;
-    i++;
-  }
-}
-
-function bisect(ring, maxSegmentLength = Infinity) {
-  for (let i = 0; i < ring.length; i++) {
-    let a = ring[i],
-      b = i === ring.length - 1 ? ring[0] : ring[i + 1];
-
-    // Could splice the whole set for a segment instead, but a bit messy
-    while (distance(a, b) > maxSegmentLength) {
-      b = pointAlong(a, b, 0.5);
-      ring.splice(i + 1, 0, b);
-    }
-  }
-}
-
-function normalizeRing(ring, maxSegmentLength) {
-  let points, area, skipBisect;
-
-  if (typeof ring === "string") {
-    let converted = pathStringToRing(ring, maxSegmentLength);
-    ring = converted.ring;
-    skipBisect = converted.skipBisect;
-  } else if (!Array.isArray(ring)) {
-    throw new TypeError(INVALID_INPUT);
-  }
-
-  points = ring.slice(0);
-
-  if (!validRing(points)) {
-    throw new TypeError(INVALID_INPUT);
-  }
-
-  // TODO skip this test to avoid scale issues?
-  // Chosen epsilon (1e-6) is problematic for small coordinate range
-  if (points.length > 1 && samePoint(points[0], points[points.length - 1])) {
-    points.pop();
-  }
-
-  area = polygonArea(points);
-
-  // Make all rings clockwise
-  if (area > 0) {
-    points.reverse();
-  }
-
-  if (
-    !skipBisect &&
-    maxSegmentLength &&
-    isFiniteNumber(maxSegmentLength) &&
-    maxSegmentLength > 0
-  ) {
-    bisect(points, maxSegmentLength);
-  }
-
-  return points;
-}
-
-function validRing(ring) {
-  return ring.every(function(point) {
-    return (
-      Array.isArray(point) &&
-      point.length >= 2 &&
-      isFiniteNumber(point[0]) &&
-      isFiniteNumber(point[1])
-    );
-  });
-}
-
-function rotate(ring, vs) {
-  let len = ring.length,
-      min = Infinity,
-      bestOffset,
-      sumOfSquares,
-      spliced;
-
-  for (let offset = 0; offset < len; offset++) {
-    sumOfSquares = 0;
-
-    vs.forEach(function(p, i){
-      let d = distance(ring[(offset + i) % len], p);
-      sumOfSquares += d * d;
-    });
-
-    if (sumOfSquares < min) {
-      min = sumOfSquares;
-      bestOffset = offset;
-    }
-  }
-
-  if (bestOffset) {
-    spliced = ring.splice(0, bestOffset);
-    ring.splice(ring.length, 0, ...spliced);
-  }
-}
-
-function interpolate(fromShape, toShape, { maxSegmentLength = 10, string = true } = {}) {
-  let fromRing = normalizeRing(fromShape, maxSegmentLength),
-    toRing = normalizeRing(toShape, maxSegmentLength),
-    interpolator = interpolateRing(fromRing, toRing, string);
-
-  // Extra optimization for near either end with path strings
-  if (!string || (typeof fromShape !== "string" && typeof toShape !== "string")) {
-    return interpolator;
-  }
-
-  return t => {
-    if (t < 1e-4 && typeof fromShape === "string") {
-      return fromShape;
-    }
-    if (1 - t < 1e-4 && typeof toShape === "string") {
-      return toShape;
-    }
-    return interpolator(t);
-  };
-}
-
-function interpolateRing(fromRing, toRing, string) {
-  let diff;
-
-  diff = fromRing.length - toRing.length;
-
-  // TODO bisect and add points in one step?
-  addPoints(fromRing, diff < 0 ? diff * -1 : 0);
-  addPoints(toRing, diff > 0 ? diff : 0);
-
-  rotate(fromRing, toRing);
-
-  return interpolatePoints(fromRing, toRing, string);
-}
-
-var earcut = {exports: {}};
-
-var hasRequiredEarcut;
-
-function requireEarcut () {
-	if (hasRequiredEarcut) return earcut.exports;
-	hasRequiredEarcut = 1;
-
-	earcut.exports = earcut$1;
-	earcut.exports.default = earcut$1;
-
-	function earcut$1(data, holeIndices, dim) {
-
-	    dim = dim || 2;
-
-	    var hasHoles = holeIndices && holeIndices.length,
-	        outerLen = hasHoles ? holeIndices[0] * dim : data.length,
-	        outerNode = linkedList(data, 0, outerLen, dim, true),
-	        triangles = [];
-
-	    if (!outerNode || outerNode.next === outerNode.prev) return triangles;
-
-	    var minX, minY, maxX, maxY, x, y, invSize;
-
-	    if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim);
-
-	    // if the shape is not too simple, we'll use z-order curve hash later; calculate polygon bbox
-	    if (data.length > 80 * dim) {
-	        minX = maxX = data[0];
-	        minY = maxY = data[1];
-
-	        for (var i = dim; i < outerLen; i += dim) {
-	            x = data[i];
-	            y = data[i + 1];
-	            if (x < minX) minX = x;
-	            if (y < minY) minY = y;
-	            if (x > maxX) maxX = x;
-	            if (y > maxY) maxY = y;
-	        }
-
-	        // minX, minY and invSize are later used to transform coords into integers for z-order calculation
-	        invSize = Math.max(maxX - minX, maxY - minY);
-	        invSize = invSize !== 0 ? 32767 / invSize : 0;
-	    }
-
-	    earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);
-
-	    return triangles;
-	}
-
-	// create a circular doubly linked list from polygon points in the specified winding order
-	function linkedList(data, start, end, dim, clockwise) {
-	    var i, last;
-
-	    if (clockwise === (signedArea(data, start, end, dim) > 0)) {
-	        for (i = start; i < end; i += dim) last = insertNode(i, data[i], data[i + 1], last);
-	    } else {
-	        for (i = end - dim; i >= start; i -= dim) last = insertNode(i, data[i], data[i + 1], last);
-	    }
-
-	    if (last && equals(last, last.next)) {
-	        removeNode(last);
-	        last = last.next;
-	    }
-
-	    return last;
-	}
-
-	// eliminate colinear or duplicate points
-	function filterPoints(start, end) {
-	    if (!start) return start;
-	    if (!end) end = start;
-
-	    var p = start,
-	        again;
-	    do {
-	        again = false;
-
-	        if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {
-	            removeNode(p);
-	            p = end = p.prev;
-	            if (p === p.next) break;
-	            again = true;
-
-	        } else {
-	            p = p.next;
-	        }
-	    } while (again || p !== end);
-
-	    return end;
-	}
-
-	// main ear slicing loop which triangulates a polygon (given as a linked list)
-	function earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {
-	    if (!ear) return;
-
-	    // interlink polygon nodes in z-order
-	    if (!pass && invSize) indexCurve(ear, minX, minY, invSize);
-
-	    var stop = ear,
-	        prev, next;
-
-	    // iterate through ears, slicing them one by one
-	    while (ear.prev !== ear.next) {
-	        prev = ear.prev;
-	        next = ear.next;
-
-	        if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {
-	            // cut off the triangle
-	            triangles.push(prev.i / dim | 0);
-	            triangles.push(ear.i / dim | 0);
-	            triangles.push(next.i / dim | 0);
-
-	            removeNode(ear);
-
-	            // skipping the next vertex leads to less sliver triangles
-	            ear = next.next;
-	            stop = next.next;
-
-	            continue;
-	        }
-
-	        ear = next;
-
-	        // if we looped through the whole remaining polygon and can't find any more ears
-	        if (ear === stop) {
-	            // try filtering points and slicing again
-	            if (!pass) {
-	                earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);
-
-	            // if this didn't work, try curing all small self-intersections locally
-	            } else if (pass === 1) {
-	                ear = cureLocalIntersections(filterPoints(ear), triangles, dim);
-	                earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);
-
-	            // as a last resort, try splitting the remaining polygon into two
-	            } else if (pass === 2) {
-	                splitEarcut(ear, triangles, dim, minX, minY, invSize);
-	            }
-
-	            break;
-	        }
-	    }
-	}
-
-	// check whether a polygon node forms a valid ear with adjacent nodes
-	function isEar(ear) {
-	    var a = ear.prev,
-	        b = ear,
-	        c = ear.next;
-
-	    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear
-
-	    // now make sure we don't have other points inside the potential ear
-	    var ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
-
-	    // triangle bbox; min & max are calculated like this for speed
-	    var x0 = ax < bx ? (ax < cx ? ax : cx) : (bx < cx ? bx : cx),
-	        y0 = ay < by ? (ay < cy ? ay : cy) : (by < cy ? by : cy),
-	        x1 = ax > bx ? (ax > cx ? ax : cx) : (bx > cx ? bx : cx),
-	        y1 = ay > by ? (ay > cy ? ay : cy) : (by > cy ? by : cy);
-
-	    var p = c.next;
-	    while (p !== a) {
-	        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 &&
-	            pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) &&
-	            area(p.prev, p, p.next) >= 0) return false;
-	        p = p.next;
-	    }
-
-	    return true;
-	}
-
-	function isEarHashed(ear, minX, minY, invSize) {
-	    var a = ear.prev,
-	        b = ear,
-	        c = ear.next;
-
-	    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear
-
-	    var ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;
-
-	    // triangle bbox; min & max are calculated like this for speed
-	    var x0 = ax < bx ? (ax < cx ? ax : cx) : (bx < cx ? bx : cx),
-	        y0 = ay < by ? (ay < cy ? ay : cy) : (by < cy ? by : cy),
-	        x1 = ax > bx ? (ax > cx ? ax : cx) : (bx > cx ? bx : cx),
-	        y1 = ay > by ? (ay > cy ? ay : cy) : (by > cy ? by : cy);
-
-	    // z-order range for the current triangle bbox;
-	    var minZ = zOrder(x0, y0, minX, minY, invSize),
-	        maxZ = zOrder(x1, y1, minX, minY, invSize);
-
-	    var p = ear.prevZ,
-	        n = ear.nextZ;
-
-	    // look for points inside the triangle in both directions
-	    while (p && p.z >= minZ && n && n.z <= maxZ) {
-	        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&
-	            pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
-	        p = p.prevZ;
-
-	        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&
-	            pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
-	        n = n.nextZ;
-	    }
-
-	    // look for remaining points in decreasing z-order
-	    while (p && p.z >= minZ) {
-	        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&
-	            pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;
-	        p = p.prevZ;
-	    }
-
-	    // look for remaining points in increasing z-order
-	    while (n && n.z <= maxZ) {
-	        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&
-	            pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;
-	        n = n.nextZ;
-	    }
-
-	    return true;
-	}
-
-	// go through all polygon nodes and cure small local self-intersections
-	function cureLocalIntersections(start, triangles, dim) {
-	    var p = start;
-	    do {
-	        var a = p.prev,
-	            b = p.next.next;
-
-	        if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {
-
-	            triangles.push(a.i / dim | 0);
-	            triangles.push(p.i / dim | 0);
-	            triangles.push(b.i / dim | 0);
-
-	            // remove two nodes involved
-	            removeNode(p);
-	            removeNode(p.next);
-
-	            p = start = b;
-	        }
-	        p = p.next;
-	    } while (p !== start);
-
-	    return filterPoints(p);
-	}
-
-	// try splitting polygon into two and triangulate them independently
-	function splitEarcut(start, triangles, dim, minX, minY, invSize) {
-	    // look for a valid diagonal that divides the polygon into two
-	    var a = start;
-	    do {
-	        var b = a.next.next;
-	        while (b !== a.prev) {
-	            if (a.i !== b.i && isValidDiagonal(a, b)) {
-	                // split the polygon in two by the diagonal
-	                var c = splitPolygon(a, b);
-
-	                // filter colinear points around the cuts
-	                a = filterPoints(a, a.next);
-	                c = filterPoints(c, c.next);
-
-	                // run earcut on each half
-	                earcutLinked(a, triangles, dim, minX, minY, invSize, 0);
-	                earcutLinked(c, triangles, dim, minX, minY, invSize, 0);
-	                return;
-	            }
-	            b = b.next;
-	        }
-	        a = a.next;
-	    } while (a !== start);
-	}
-
-	// link every hole into the outer loop, producing a single-ring polygon without holes
-	function eliminateHoles(data, holeIndices, outerNode, dim) {
-	    var queue = [],
-	        i, len, start, end, list;
-
-	    for (i = 0, len = holeIndices.length; i < len; i++) {
-	        start = holeIndices[i] * dim;
-	        end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
-	        list = linkedList(data, start, end, dim, false);
-	        if (list === list.next) list.steiner = true;
-	        queue.push(getLeftmost(list));
-	    }
-
-	    queue.sort(compareX);
-
-	    // process holes from left to right
-	    for (i = 0; i < queue.length; i++) {
-	        outerNode = eliminateHole(queue[i], outerNode);
-	    }
-
-	    return outerNode;
-	}
-
-	function compareX(a, b) {
-	    return a.x - b.x;
-	}
-
-	// find a bridge between vertices that connects hole with an outer ring and and link it
-	function eliminateHole(hole, outerNode) {
-	    var bridge = findHoleBridge(hole, outerNode);
-	    if (!bridge) {
-	        return outerNode;
-	    }
-
-	    var bridgeReverse = splitPolygon(bridge, hole);
-
-	    // filter collinear points around the cuts
-	    filterPoints(bridgeReverse, bridgeReverse.next);
-	    return filterPoints(bridge, bridge.next);
-	}
-
-	// David Eberly's algorithm for finding a bridge between hole and outer polygon
-	function findHoleBridge(hole, outerNode) {
-	    var p = outerNode,
-	        hx = hole.x,
-	        hy = hole.y,
-	        qx = -Infinity,
-	        m;
-
-	    // find a segment intersected by a ray from the hole's leftmost point to the left;
-	    // segment's endpoint with lesser x will be potential connection point
-	    do {
-	        if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {
-	            var x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);
-	            if (x <= hx && x > qx) {
-	                qx = x;
-	                m = p.x < p.next.x ? p : p.next;
-	                if (x === hx) return m; // hole touches outer segment; pick leftmost endpoint
-	            }
-	        }
-	        p = p.next;
-	    } while (p !== outerNode);
-
-	    if (!m) return null;
-
-	    // look for points inside the triangle of hole point, segment intersection and endpoint;
-	    // if there are no points found, we have a valid connection;
-	    // otherwise choose the point of the minimum angle with the ray as connection point
-
-	    var stop = m,
-	        mx = m.x,
-	        my = m.y,
-	        tanMin = Infinity,
-	        tan;
-
-	    p = m;
-
-	    do {
-	        if (hx >= p.x && p.x >= mx && hx !== p.x &&
-	                pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y)) {
-
-	            tan = Math.abs(hy - p.y) / (hx - p.x); // tangential
-
-	            if (locallyInside(p, hole) &&
-	                (tan < tanMin || (tan === tanMin && (p.x > m.x || (p.x === m.x && sectorContainsSector(m, p)))))) {
-	                m = p;
-	                tanMin = tan;
-	            }
-	        }
-
-	        p = p.next;
-	    } while (p !== stop);
-
-	    return m;
-	}
-
-	// whether sector in vertex m contains sector in vertex p in the same coordinates
-	function sectorContainsSector(m, p) {
-	    return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;
-	}
-
-	// interlink polygon nodes in z-order
-	function indexCurve(start, minX, minY, invSize) {
-	    var p = start;
-	    do {
-	        if (p.z === 0) p.z = zOrder(p.x, p.y, minX, minY, invSize);
-	        p.prevZ = p.prev;
-	        p.nextZ = p.next;
-	        p = p.next;
-	    } while (p !== start);
-
-	    p.prevZ.nextZ = null;
-	    p.prevZ = null;
-
-	    sortLinked(p);
-	}
-
-	// Simon Tatham's linked list merge sort algorithm
-	// http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html
-	function sortLinked(list) {
-	    var i, p, q, e, tail, numMerges, pSize, qSize,
-	        inSize = 1;
-
-	    do {
-	        p = list;
-	        list = null;
-	        tail = null;
-	        numMerges = 0;
-
-	        while (p) {
-	            numMerges++;
-	            q = p;
-	            pSize = 0;
-	            for (i = 0; i < inSize; i++) {
-	                pSize++;
-	                q = q.nextZ;
-	                if (!q) break;
-	            }
-	            qSize = inSize;
-
-	            while (pSize > 0 || (qSize > 0 && q)) {
-
-	                if (pSize !== 0 && (qSize === 0 || !q || p.z <= q.z)) {
-	                    e = p;
-	                    p = p.nextZ;
-	                    pSize--;
-	                } else {
-	                    e = q;
-	                    q = q.nextZ;
-	                    qSize--;
-	                }
-
-	                if (tail) tail.nextZ = e;
-	                else list = e;
-
-	                e.prevZ = tail;
-	                tail = e;
-	            }
-
-	            p = q;
-	        }
-
-	        tail.nextZ = null;
-	        inSize *= 2;
-
-	    } while (numMerges > 1);
-
-	    return list;
-	}
-
-	// z-order of a point given coords and inverse of the longer side of data bbox
-	function zOrder(x, y, minX, minY, invSize) {
-	    // coords are transformed into non-negative 15-bit integer range
-	    x = (x - minX) * invSize | 0;
-	    y = (y - minY) * invSize | 0;
-
-	    x = (x | (x << 8)) & 0x00FF00FF;
-	    x = (x | (x << 4)) & 0x0F0F0F0F;
-	    x = (x | (x << 2)) & 0x33333333;
-	    x = (x | (x << 1)) & 0x55555555;
-
-	    y = (y | (y << 8)) & 0x00FF00FF;
-	    y = (y | (y << 4)) & 0x0F0F0F0F;
-	    y = (y | (y << 2)) & 0x33333333;
-	    y = (y | (y << 1)) & 0x55555555;
-
-	    return x | (y << 1);
-	}
-
-	// find the leftmost node of a polygon ring
-	function getLeftmost(start) {
-	    var p = start,
-	        leftmost = start;
-	    do {
-	        if (p.x < leftmost.x || (p.x === leftmost.x && p.y < leftmost.y)) leftmost = p;
-	        p = p.next;
-	    } while (p !== start);
-
-	    return leftmost;
-	}
-
-	// check if a point lies within a convex triangle
-	function pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
-	    return (cx - px) * (ay - py) >= (ax - px) * (cy - py) &&
-	           (ax - px) * (by - py) >= (bx - px) * (ay - py) &&
-	           (bx - px) * (cy - py) >= (cx - px) * (by - py);
-	}
-
-	// check if a diagonal between two polygon nodes is valid (lies in polygon interior)
-	function isValidDiagonal(a, b) {
-	    return a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) && // dones't intersect other edges
-	           (locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) && // locally visible
-	            (area(a.prev, a, b.prev) || area(a, b.prev, b)) || // does not create opposite-facing sectors
-	            equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0); // special zero-length case
-	}
-
-	// signed area of a triangle
-	function area(p, q, r) {
-	    return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);
-	}
-
-	// check if two points are equal
-	function equals(p1, p2) {
-	    return p1.x === p2.x && p1.y === p2.y;
-	}
-
-	// check if two segments intersect
-	function intersects(p1, q1, p2, q2) {
-	    var o1 = sign(area(p1, q1, p2));
-	    var o2 = sign(area(p1, q1, q2));
-	    var o3 = sign(area(p2, q2, p1));
-	    var o4 = sign(area(p2, q2, q1));
-
-	    if (o1 !== o2 && o3 !== o4) return true; // general case
-
-	    if (o1 === 0 && onSegment(p1, p2, q1)) return true; // p1, q1 and p2 are collinear and p2 lies on p1q1
-	    if (o2 === 0 && onSegment(p1, q2, q1)) return true; // p1, q1 and q2 are collinear and q2 lies on p1q1
-	    if (o3 === 0 && onSegment(p2, p1, q2)) return true; // p2, q2 and p1 are collinear and p1 lies on p2q2
-	    if (o4 === 0 && onSegment(p2, q1, q2)) return true; // p2, q2 and q1 are collinear and q1 lies on p2q2
-
-	    return false;
-	}
-
-	// for collinear points p, q, r, check if point q lies on segment pr
-	function onSegment(p, q, r) {
-	    return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);
-	}
-
-	function sign(num) {
-	    return num > 0 ? 1 : num < 0 ? -1 : 0;
-	}
-
-	// check if a polygon diagonal intersects any polygon segments
-	function intersectsPolygon(a, b) {
-	    var p = a;
-	    do {
-	        if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&
-	                intersects(p, p.next, a, b)) return true;
-	        p = p.next;
-	    } while (p !== a);
-
-	    return false;
-	}
-
-	// check if a polygon diagonal is locally inside the polygon
-	function locallyInside(a, b) {
-	    return area(a.prev, a, a.next) < 0 ?
-	        area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0 :
-	        area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;
-	}
-
-	// check if the middle point of a polygon diagonal is inside the polygon
-	function middleInside(a, b) {
-	    var p = a,
-	        inside = false,
-	        px = (a.x + b.x) / 2,
-	        py = (a.y + b.y) / 2;
-	    do {
-	        if (((p.y > py) !== (p.next.y > py)) && p.next.y !== p.y &&
-	                (px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x))
-	            inside = !inside;
-	        p = p.next;
-	    } while (p !== a);
-
-	    return inside;
-	}
-
-	// link two polygon vertices with a bridge; if the vertices belong to the same ring, it splits polygon into two;
-	// if one belongs to the outer ring and another to a hole, it merges it into a single ring
-	function splitPolygon(a, b) {
-	    var a2 = new Node(a.i, a.x, a.y),
-	        b2 = new Node(b.i, b.x, b.y),
-	        an = a.next,
-	        bp = b.prev;
-
-	    a.next = b;
-	    b.prev = a;
-
-	    a2.next = an;
-	    an.prev = a2;
-
-	    b2.next = a2;
-	    a2.prev = b2;
-
-	    bp.next = b2;
-	    b2.prev = bp;
-
-	    return b2;
-	}
-
-	// create a node and optionally link it with previous one (in a circular doubly linked list)
-	function insertNode(i, x, y, last) {
-	    var p = new Node(i, x, y);
-
-	    if (!last) {
-	        p.prev = p;
-	        p.next = p;
-
-	    } else {
-	        p.next = last.next;
-	        p.prev = last;
-	        last.next.prev = p;
-	        last.next = p;
-	    }
-	    return p;
-	}
-
-	function removeNode(p) {
-	    p.next.prev = p.prev;
-	    p.prev.next = p.next;
-
-	    if (p.prevZ) p.prevZ.nextZ = p.nextZ;
-	    if (p.nextZ) p.nextZ.prevZ = p.prevZ;
-	}
-
-	function Node(i, x, y) {
-	    // vertex index in coordinates array
-	    this.i = i;
-
-	    // vertex coordinates
-	    this.x = x;
-	    this.y = y;
-
-	    // previous and next vertex nodes in a polygon ring
-	    this.prev = null;
-	    this.next = null;
-
-	    // z-order curve value
-	    this.z = 0;
-
-	    // previous and next nodes in z-order
-	    this.prevZ = null;
-	    this.nextZ = null;
-
-	    // indicates whether this is a steiner point
-	    this.steiner = false;
-	}
-
-	// return a percentage difference between the polygon area and its triangulation area;
-	// used to verify correctness of triangulation
-	earcut$1.deviation = function (data, holeIndices, dim, triangles) {
-	    var hasHoles = holeIndices && holeIndices.length;
-	    var outerLen = hasHoles ? holeIndices[0] * dim : data.length;
-
-	    var polygonArea = Math.abs(signedArea(data, 0, outerLen, dim));
-	    if (hasHoles) {
-	        for (var i = 0, len = holeIndices.length; i < len; i++) {
-	            var start = holeIndices[i] * dim;
-	            var end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;
-	            polygonArea -= Math.abs(signedArea(data, start, end, dim));
-	        }
-	    }
-
-	    var trianglesArea = 0;
-	    for (i = 0; i < triangles.length; i += 3) {
-	        var a = triangles[i] * dim;
-	        var b = triangles[i + 1] * dim;
-	        var c = triangles[i + 2] * dim;
-	        trianglesArea += Math.abs(
-	            (data[a] - data[c]) * (data[b + 1] - data[a + 1]) -
-	            (data[a] - data[b]) * (data[c + 1] - data[a + 1]));
-	    }
-
-	    return polygonArea === 0 && trianglesArea === 0 ? 0 :
-	        Math.abs((trianglesArea - polygonArea) / polygonArea);
-	};
-
-	function signedArea(data, start, end, dim) {
-	    var sum = 0;
-	    for (var i = start, j = end - dim; i < end; i += dim) {
-	        sum += (data[j] - data[i]) * (data[i + 1] + data[j + 1]);
-	        j = i;
-	    }
-	    return sum;
-	}
-
-	// turn a polygon in a multi-dimensional array form (e.g. as in GeoJSON) into a form Earcut accepts
-	earcut$1.flatten = function (data) {
-	    var dim = data[0][0].length,
-	        result = {vertices: [], holes: [], dimensions: dim},
-	        holeIndex = 0;
-
-	    for (var i = 0; i < data.length; i++) {
-	        for (var j = 0; j < data[i].length; j++) {
-	            for (var d = 0; d < dim; d++) result.vertices.push(data[i][j][d]);
-	        }
-	        if (i > 0) {
-	            holeIndex += data[i - 1].length;
-	            result.holes.push(holeIndex);
-	        }
-	    }
-	    return result;
-	};
-	return earcut.exports;
-}
-
-requireEarcut();
-
-function ascending(a, b) {
-  return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;
-}
-
-function bisector(compare) {
-  if (compare.length === 1) compare = ascendingComparator(compare);
-  return {
-    left: function(a, x, lo, hi) {
-      if (lo == null) lo = 0;
-      if (hi == null) hi = a.length;
-      while (lo < hi) {
-        var mid = lo + hi >>> 1;
-        if (compare(a[mid], x) < 0) lo = mid + 1;
-        else hi = mid;
-      }
-      return lo;
-    },
-    right: function(a, x, lo, hi) {
-      if (lo == null) lo = 0;
-      if (hi == null) hi = a.length;
-      while (lo < hi) {
-        var mid = lo + hi >>> 1;
-        if (compare(a[mid], x) > 0) hi = mid;
-        else lo = mid + 1;
-      }
-      return lo;
-    }
-  };
-}
-
-function ascendingComparator(f) {
-  return function(d, x) {
-    return ascending(f(d), x);
-  };
-}
-
-bisector(ascending);
-
-const SHARP_PATH = "m23 12-8.036-3.23L12.006 0 9.047 8.77 1 12l8.047 3.23L12.006 24l2.958-8.77z";
-const ROUND_PATH = "M17.425 13.854c1.665-.675 1.665-3.033 0-3.708l-2.73-1.106-.793-2.37c-.609-1.82-3.184-1.82-3.793 0l-.793 2.37-2.734 1.106c-1.666.674-1.666 3.034 0 3.708l2.734 1.106.793 2.37c.609 1.82 3.184 1.82 3.793 0l.793-2.37z";
-const SVG_STYLE = { width: "100%", height: "100%", display: "block" };
-const GRADIENT_ID = "ai-mark-gradient";
-function SVGMorph({ delay, paths, inheritColor = false }) {
-  const [pathIndex, setPathIndex] = useState(0);
-  const progress = useMotionValue(0);
-  const arrayOfIndex = useMemo(() => paths.map((_, i) => i), [paths]);
-  const path = useTransform(progress, arrayOfIndex, paths, {
-    mixer: (a, b) => interpolate(a, b, { maxSegmentLength: 1 })
-  });
-  useEffect(() => {
-    const animation = animate(progress, pathIndex, {
-      duration: 0.8,
-      ease: [0.5, 0, 0.65, 1],
-      delay,
-      onComplete: () => {
-        if (pathIndex === paths.length - 1) {
-          progress.set(0);
-          setPathIndex(1);
-        } else {
-          setPathIndex(pathIndex + 1);
-        }
-      }
-    });
-    return () => {
-      animation.stop();
-    };
-  }, [pathIndex, paths.length, progress, delay]);
-  return /* @__PURE__ */ jsx(
-    motion.path,
-    {
-      fill: inheritColor ? "currentColor" : `url(#${GRADIENT_ID})`,
-      d: path
-    }
-  );
-}
-const AiMarkIconAnimatedSegment = memo(
-  ({
-    animate: animate2 = false,
-    delay,
-    className,
-    inheritColor = false,
-    spin = false
-  }) => {
-    const fill = inheritColor ? "currentColor" : `url(#${GRADIENT_ID})`;
-    const { mode } = useTheme();
-    const gradientDef = !inheritColor && /* @__PURE__ */ jsx("defs", { children: /* @__PURE__ */ jsxs(
-      "linearGradient",
-      {
-        id: GRADIENT_ID,
-        x1: "0.4962",
-        y1: "0.2483",
-        x2: "-0.0543",
-        y2: "0.4319",
-        gradientUnits: "objectBoundingBox",
-        children: [
-          /* @__PURE__ */ jsx(
-            "stop",
-            {
-              stopColor: mode === "dark" ? "#77C5EA" : "#026EE4",
-              style: {
-                stopColor: mode === "dark" ? "#77C5EA" : "#026EE4",
-                stopOpacity: 1
-              }
-            }
-          ),
-          /* @__PURE__ */ jsx(
-            "stop",
-            {
-              offset: "1",
-              stopColor: mode === "dark" ? "#D0D8E1" : "#27AEEE",
-              style: {
-                stopColor: mode === "dark" ? "#D0D8E1" : "#27AEEE",
-                stopOpacity: 1
-              }
-            }
-          )
-        ]
-      }
-    ) });
-    if (!animate2) {
-      return /* @__PURE__ */ jsxs("svg", { className, style: SVG_STYLE, viewBox: "0 0 24 24", children: [
-        gradientDef,
-        /* @__PURE__ */ jsx("path", { fill, d: SHARP_PATH })
-      ] });
-    }
-    return /* @__PURE__ */ jsxs(
-      motion.svg,
-      {
-        className,
-        style: SVG_STYLE,
-        viewBox: "0 0 24 24",
-        animate: spin ? { rotate: 180 } : {},
-        transition: {
-          duration: 2,
-          type: "spring",
-          repeat: 0,
-          repeatType: "loop",
-          repeatDelay: 1.5,
-          delay
-        },
-        children: [
-          gradientDef,
-          /* @__PURE__ */ jsx(
-            SVGMorph,
-            {
-              paths: [SHARP_PATH, ROUND_PATH, SHARP_PATH],
-              delay,
-              inheritColor
-            }
-          )
-        ]
-      }
-    );
-  }
-);
-AiMarkIconAnimatedSegment.displayName = "AiMarkIconAnimatedSegment";
-const AiMarkIconAnimated = ({
-  animate: animate2 = false,
-  size = 16,
-  inheritColor = false,
-  spin = false
-}) => {
-  const { prefersReducedMotion } = usePrefersReducedMotion();
-  const shouldAnimate = animate2 && !prefersReducedMotion;
-  const largeSvgSize = size * 0.75;
-  const smallSvgSize = size * 6 / 16;
-  const containerStyle = useMemo(
-    () => ({ position: "relative", width: size, height: size }),
-    [size]
-  );
-  const largeIconStyle = useMemo(
-    () => ({
-      position: "absolute",
-      bottom: size / 16,
-      left: size / 16,
-      width: largeSvgSize,
-      height: largeSvgSize
-    }),
-    [largeSvgSize, size]
-  );
-  const smallIconStyle = useMemo(
-    () => ({
-      position: "absolute",
-      top: size / 16,
-      right: size / 16,
-      width: smallSvgSize,
-      height: smallSvgSize
-    }),
-    [smallSvgSize, size]
-  );
-  return /* @__PURE__ */ jsxs("div", { style: containerStyle, "data-anv": "ai-mark-icon-animated", children: [
-    /* @__PURE__ */ jsx("div", { style: largeIconStyle, children: /* @__PURE__ */ jsx(
-      AiMarkIconAnimatedSegment,
-      {
-        animate: shouldAnimate,
-        delay: 0.15,
-        inheritColor,
-        spin
-      }
-    ) }),
-    /* @__PURE__ */ jsx("div", { style: smallIconStyle, children: /* @__PURE__ */ jsx(
-      AiMarkIconAnimatedSegment,
-      {
-        animate: shouldAnimate,
-        inheritColor,
-        spin
-      }
-    ) })
-  ] });
-};
-
-const SvgAiChat = (props) => /* @__PURE__ */ React.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", width: 24, height: 24, viewBox: "0 0 24 24", ...props }, /* @__PURE__ */ React.createElement("path", { d: "M20.488 7.014A1.51 1.51 0 0 1 22 8.513v8.991a1.51 1.51 0 0 1-1.512 1.499H9.9L6.875 22v-9.975l.757-2.763 6.404-2.248zm-9.831 7.493a.756.756 0 0 0-.757.75c0 .412.34.749.757.749h7.562a.755.755 0 0 0 .756-.75.755.755 0 0 0-.756-.749zm0-2.248a.756.756 0 0 0-.757.75c0 .412.34.749.757.749h7.562a.755.755 0 0 0 .756-.75.755.755 0 0 0-.756-.749zm0-2.248a.756.756 0 0 0-.757.75c0 .412.34.749.757.749h7.562a.755.755 0 0 0 .756-.75.755.755 0 0 0-.756-.749z" }), /* @__PURE__ */ React.createElement("path", { d: "m6.56 5.49 3.811 1.36L6.56 8.213l-1.373 3.776L3.81 8.213 0 6.85l3.81-1.36 1.376-3.778zm3.639-3.607 1.9.685-1.9.687-.692 1.883-.692-1.883-1.901-.687 1.9-.685L9.508 0z" }));
-
-const SvgAiEdit = (props) => /* @__PURE__ */ React.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", width: 24, height: 24, viewBox: "0 0 24 24", ...props }, /* @__PURE__ */ React.createElement("path", { d: "M18.655 10.414 7.218 21.844A.5.5 0 0 1 6.85 22H3.666a.52.52 0 0 1-.524-.523V18.29q0-.22.157-.376l11.428-11.43zM6.814 5.756l3.96 1.427-3.96 1.43-1.427 3.958L3.96 8.612 0 7.183l3.959-1.427 1.428-3.96zM18.503 3.14a1.05 1.05 0 0 1 .74.307l2.45 2.45a1.05 1.05 0 0 1 .227 1.14q-.08.19-.227.338l-1.916 1.917-3.928-3.929 1.916-1.916a1.05 1.05 0 0 1 .738-.307m-7.908-1.165 1.975.718-1.975.72-.718 1.975-.72-1.975-1.975-.72 1.975-.718L9.877 0z" }));
-
-const SvgAiForm = (props) => /* @__PURE__ */ React.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", width: 24, height: 24, viewBox: "0 0 24 24", ...props }, /* @__PURE__ */ React.createElement("path", { fillRule: "evenodd", d: "M22 6c1.1 0 2 .9 2 2v14c0 1.1-.9 2-2 2H8c-1.1 0-2-.9-2-2v-9.17c0-.53.21-1.04.59-1.41l4.83-4.83c.37-.38.88-.59 1.41-.59zM11 18c-.55 0-1 .45-1 1s.45 1 1 1h8c.55 0 1-.45 1-1s-.45-1-1-1zm0-4c-.55 0-1 .45-1 1s.45 1 1 1h8c.55 0 1-.45 1-1s-.45-1-1-1zm3-4c-.55 0-1 .45-1 1s.45 1 1 1h5c.55 0 1-.45 1-1s-.45-1-1-1z", clipRule: "evenodd" }), /* @__PURE__ */ React.createElement("path", { d: "m6.505 5.495 3.781 1.363-3.78 1.363L5.142 12 3.78 8.22 0 6.859l3.78-1.363 1.363-3.78zm3.61-3.608L12 2.572l-1.885.686-.687 1.885-.686-1.885-1.885-.686 1.885-.685L9.428 0z" }));
-
-const SvgAiMic = (props) => /* @__PURE__ */ React.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", width: 24, height: 24, viewBox: "0 0 24 24", ...props }, /* @__PURE__ */ React.createElement("path", { d: "M21.513 13.737c.595 0 1.071.554.974 1.17a7.3 7.3 0 0 1-1.958 3.959 6.7 6.7 0 0 1-3.805 1.973v2.134c0 .565-.439 1.027-.975 1.027s-.974-.462-.974-1.027V20.84c-2.945-.441-5.287-2.854-5.765-5.933-.087-.615.381-1.169.976-1.169.232.002.456.09.631.25s.29.38.324.622c.4 2.412 2.4 4.26 4.808 4.26s4.408-1.848 4.808-4.26c.078-.503.479-.872.956-.872" }), /* @__PURE__ */ React.createElement("path", { d: "M15.749 4.5c1.619 0 2.925 1.375 2.925 3.08v6.157c0 1.704-1.306 3.08-2.925 3.08s-2.925-1.376-2.926-3.08V7.58c0-1.703 1.307-3.079 2.926-3.079m-7.743.994 3.78 1.362-3.78 1.364L6.643 12 5.28 8.22 1.5 6.858l3.78-1.362 1.363-3.781zm3.609-3.61 1.885.686-1.885.687-.685 1.885-.688-1.885-1.885-.687 1.885-.686L10.93 0z" }));
-
-const SvgAiSearch = (props) => /* @__PURE__ */ React.createElement("svg", { xmlns: "http://www.w3.org/2000/svg", width: 24, height: 24, viewBox: "0 0 24 24", ...props }, /* @__PURE__ */ React.createElement("path", { fillRule: "evenodd", d: "M11.757 7.838a6.3 6.3 0 0 1 2.828-.288c2.71.329 4.955 2.476 5.41 5.165a6.28 6.28 0 0 1-1.431 5.165l.27.26h.765l4.104 4.121a1.02 1.02 0 0 1 0 1.442 1.024 1.024 0 0 1-1.443 0l-4.112-4.11v-.765l-.262-.271a6.29 6.29 0 0 1-5.168 1.43c-2.69-.454-4.84-2.698-5.168-5.406a6.29 6.29 0 0 1 4.207-6.743m2.034 1.599a4.35 4.35 0 0 0-4.355 4.352 4.35 4.35 0 0 0 4.355 4.352 4.35 4.35 0 0 0 4.357-4.352 4.35 4.35 0 0 0-4.357-4.352", clipRule: "evenodd" }), /* @__PURE__ */ React.createElement("path", { d: "m6.505 5.495 3.781 1.362-3.78 1.364L5.142 12 3.779 8.22 0 6.858l3.78-1.362 1.363-3.781zm3.61-3.61L12 2.571l-1.885.687-.686 1.885-.687-1.885-1.885-.687 1.885-.686L9.43 0z" }));
-
-const AI_ICON_MAP = {
-  chat: SvgAiChat,
-  edit: SvgAiEdit,
-  form: SvgAiForm,
-  mic: SvgAiMic,
-  search: SvgAiSearch
-};
-const ICON_ONLY_AI_SIZE_PX = {
-  xsmall: 12,
-  small: 14,
-  medium: 24,
-  large: 24
-};
-function iconHasLeadingSlot(icon) {
-  if (!icon) {
-    return false;
-  }
-  if (typeof icon !== "object") {
-    return true;
-  }
-  return "before" in icon;
-}
-function aiMarkShowsAnimatedMark(aiMark) {
-  return aiMark === true || aiMark === "mark";
-}
-
-const Button = forwardRef(
-  (props, ref) => {
-    const { layoutStyles, componentProps } = useLayoutPropsUtil(props);
-    const {
-      aiMark,
-      children,
-      className,
-      appearance = "secondary",
-      size = "medium",
-      icon,
-      loading = false,
-      disabled,
-      style,
-      type = "button",
-      onMouseEnter,
-      onMouseLeave,
-      onFocus,
-      onBlur,
-      ...rest
-    } = componentProps;
-    const aiOn = !!aiMark;
-    const isIconOnly = !children;
-    if (aiOn && icon) {
-      if (isIconOnly) {
-        warnOnce(
-          "[Anvil2 Button] The `icon` prop is ignored when `aiMark` is set on an icon-only button. Only the AI icon is rendered."
-        );
-      } else if (iconHasLeadingSlot(icon)) {
-        warnOnce(
-          "[Anvil2 Button] The leading `icon` (plain Svg or `icon.before`) is ignored when `aiMark` is set with button text. Use `icon={{ after: Svg }}` for a trailing icon, or omit `icon`."
-        );
-      }
-    }
-    const data = {
-      children: childrenToString(props.children),
-      appearance,
-      icon,
-      size,
-      type,
-      aiMark
-    };
-    const trackingId = useTrackingId({
-      name: "Button",
-      data,
-      hasOverride: !!props["data-tracking-id"]
-    });
-    const [isHovered, setIsHovered] = useState(false);
-    const [isFocused, setIsFocused] = useState(false);
-    const isAnimated = isHovered || isFocused;
-    const inheritColorForMark = appearance !== "secondary" && appearance !== "ghost";
-    const renderStandardLeading = useCallback(() => {
-      if (typeof icon === "object" && icon !== null && "before" in icon) {
-        return /* @__PURE__ */ jsx(
-          Icon,
-          {
-            className: styles["icon"],
-            inherit: true,
-            "aria-hidden": true,
-            svg: icon.before
-          }
-        );
-      }
-      if (icon && typeof icon !== "object") {
-        return /* @__PURE__ */ jsx(
-          Icon,
-          {
-            className: styles["icon"],
-            inherit: true,
-            "aria-hidden": true,
-            svg: icon,
-            size: !children && !size.includes("small") ? "large" : "medium"
-          }
-        );
-      }
-      return null;
-    }, [icon, children, size]);
-    const renderAiLeading = useCallback(() => {
-      if (aiMarkShowsAnimatedMark(aiMark)) {
-        return /* @__PURE__ */ jsx(
-          AiMarkIconAnimated,
-          {
-            animate: isAnimated,
-            inheritColor: inheritColorForMark,
-            size: isIconOnly ? ICON_ONLY_AI_SIZE_PX[size] : void 0,
-            spin: true
-          }
-        );
-      }
-      const SvgIcon = AI_ICON_MAP[aiMark];
-      return /* @__PURE__ */ jsx(
-        Icon,
-        {
-          className: styles["icon"],
-          inherit: true,
-          "aria-hidden": true,
-          "data-anv": "ai-mark-icon",
-          svg: SvgIcon,
-          size: isIconOnly && !size.includes("small") ? "large" : "medium"
-        }
-      );
-    }, [aiMark, isAnimated, inheritColorForMark, isIconOnly, size]);
-    const leadingContent = useMemo(() => {
-      if (loading) {
-        return /* @__PURE__ */ jsx(Spinner, { inherit: true, size: "small", className: styles["loading-spinner"] });
-      }
-      if (aiOn) {
-        return renderAiLeading();
-      }
-      return renderStandardLeading();
-    }, [aiOn, loading, renderAiLeading, renderStandardLeading]);
-    const trailingAfter = !isIconOnly && typeof icon === "object" && "after" in icon ? /* @__PURE__ */ jsx(Icon, { className: styles["icon"], inherit: true, "aria-hidden": true, svg: icon.after }) : null;
-    const buttonClassNames = cx(className, styles["button"], {
-      [styles["appearance-primary"]]: appearance === "primary",
-      [styles["appearance-secondary"]]: appearance === "secondary",
-      [styles["appearance-ghost"]]: appearance === "ghost",
-      [styles["danger-secondary"]]: appearance === "danger-secondary",
-      [styles["danger-primary"]]: appearance === "danger",
-      [styles["size-xsmall"]]: size === "xsmall",
-      [styles["size-small"]]: size === "small",
-      [styles["size-medium"]]: size === "medium",
-      [styles["size-large"]]: size === "large",
-      [styles["type-icon"]]: isIconOnly,
-      [styles["loading"]]: loading
-    });
-    const styleCombined = {
-      ...style,
-      ...layoutStyles
-    };
-    const handleMouseEnter = useCallback(
-      (e) => {
-        setIsHovered(true);
-        onMouseEnter?.(e);
-      },
-      [onMouseEnter]
-    );
-    const handleMouseLeave = useCallback(
-      (e) => {
-        setIsHovered(false);
-        onMouseLeave?.(e);
-      },
-      [onMouseLeave]
-    );
-    const handleFocus = useCallback(
-      (e) => {
-        setIsFocused(true);
-        onFocus?.(e);
-      },
-      [onFocus]
-    );
-    const handleBlur = useCallback(
-      (e) => {
-        setIsFocused(false);
-        onBlur?.(e);
-      },
-      [onBlur]
-    );
-    return /* @__PURE__ */ jsxs(
-      "button",
-      {
-        "data-tracking-id": trackingId,
-        className: buttonClassNames,
-        type,
-        disabled: disabled || loading,
-        "aria-busy": loading ? true : void 0,
-        "data-anv": "button",
-        style: styleCombined,
-        ref,
-        onMouseEnter: handleMouseEnter,
-        onMouseLeave: handleMouseLeave,
-        onFocus: handleFocus,
-        onBlur: handleBlur,
-        ...rest,
-        children: [
-          leadingContent,
-          children,
-          trailingAfter
-        ]
-      }
-    );
-  }
-);
-Button.displayName = "Button";
-
-export { AiMarkIconAnimated as A, Button as B };
-//# sourceMappingURL=Button-a_D7tUgM.js.map