diff --git a/main.js b/main.js
index 6ec96777..c8f9318e 100644
--- a/main.js
+++ b/main.js
@@ -2945,2057 +2945,277 @@ class Debugger {
     }
 }
 
-function noop() { }
-function assign(tar, src) {
-    // @ts-ignore
-    for (const k in src)
-        tar[k] = src[k];
-    return tar;
-}
-function run(fn) {
-    return fn();
-}
-function blank_object() {
-    return Object.create(null);
-}
-function run_all(fns) {
-    fns.forEach(run);
-}
-function is_function(thing) {
-    return typeof thing === 'function';
-}
-function safe_not_equal(a, b) {
-    return a != a ? b == b : a !== b || ((a && typeof a === 'object') || typeof a === 'function');
-}
-function is_empty(obj) {
-    return Object.keys(obj).length === 0;
-}
-function create_slot(definition, ctx, $$scope, fn) {
-    if (definition) {
-        const slot_ctx = get_slot_context(definition, ctx, $$scope, fn);
-        return definition[0](slot_ctx);
-    }
-}
-function get_slot_context(definition, ctx, $$scope, fn) {
-    return definition[1] && fn
-        ? assign($$scope.ctx.slice(), definition[1](fn(ctx)))
-        : $$scope.ctx;
-}
-function get_slot_changes(definition, $$scope, dirty, fn) {
-    if (definition[2] && fn) {
-        const lets = definition[2](fn(dirty));
-        if ($$scope.dirty === undefined) {
-            return lets;
-        }
-        if (typeof lets === 'object') {
-            const merged = [];
-            const len = Math.max($$scope.dirty.length, lets.length);
-            for (let i = 0; i < len; i += 1) {
-                merged[i] = $$scope.dirty[i] | lets[i];
-            }
-            return merged;
-        }
-        return $$scope.dirty | lets;
-    }
-    return $$scope.dirty;
-}
-function update_slot(slot, slot_definition, ctx, $$scope, dirty, get_slot_changes_fn, get_slot_context_fn) {
-    const slot_changes = get_slot_changes(slot_definition, $$scope, dirty, get_slot_changes_fn);
-    if (slot_changes) {
-        const slot_context = get_slot_context(slot_definition, ctx, $$scope, get_slot_context_fn);
-        slot.p(slot_context, slot_changes);
-    }
-}
-function exclude_internal_props(props) {
-    const result = {};
-    for (const k in props)
-        if (k[0] !== '$')
-            result[k] = props[k];
-    return result;
-}
-function null_to_empty(value) {
-    return value == null ? '' : value;
-}
-
-function append(target, node) {
-    target.appendChild(node);
-}
-function insert(target, node, anchor) {
-    target.insertBefore(node, anchor || null);
-}
-function detach(node) {
-    node.parentNode.removeChild(node);
-}
-function destroy_each(iterations, detaching) {
-    for (let i = 0; i < iterations.length; i += 1) {
-        if (iterations[i])
-            iterations[i].d(detaching);
-    }
-}
-function element(name) {
-    return document.createElement(name);
-}
-function svg_element(name) {
-    return document.createElementNS('http://www.w3.org/2000/svg', name);
-}
-function text(data) {
-    return document.createTextNode(data);
-}
-function space() {
-    return text(' ');
-}
-function empty() {
-    return text('');
-}
-function listen(node, event, handler, options) {
-    node.addEventListener(event, handler, options);
-    return () => node.removeEventListener(event, handler, options);
-}
-function attr(node, attribute, value) {
-    if (value == null)
-        node.removeAttribute(attribute);
-    else if (node.getAttribute(attribute) !== value)
-        node.setAttribute(attribute, value);
-}
-function get_binding_group_value(group, __value, checked) {
-    const value = new Set();
-    for (let i = 0; i < group.length; i += 1) {
-        if (group[i].checked)
-            value.add(group[i].__value);
-    }
-    if (!checked) {
-        value.delete(__value);
-    }
-    return Array.from(value);
-}
-function children(element) {
-    return Array.from(element.childNodes);
-}
-function set_data(text, data) {
-    data = '' + data;
-    if (text.wholeText !== data)
-        text.data = data;
-}
-function set_input_value(input, value) {
-    input.value = value == null ? '' : value;
-}
-function set_style(node, key, value, important) {
-    node.style.setProperty(key, value, important ? 'important' : '');
-}
-function select_option(select, value) {
-    for (let i = 0; i < select.options.length; i += 1) {
-        const option = select.options[i];
-        if (option.__value === value) {
-            option.selected = true;
-            return;
-        }
-    }
-}
-function select_value(select) {
-    const selected_option = select.querySelector(':checked') || select.options[0];
-    return selected_option && selected_option.__value;
-}
-
-let current_component;
-function set_current_component(component) {
-    current_component = component;
-}
-function get_current_component() {
-    if (!current_component)
-        throw new Error('Function called outside component initialization');
-    return current_component;
-}
-function onMount(fn) {
-    get_current_component().$$.on_mount.push(fn);
-}
-
-const dirty_components = [];
-const binding_callbacks = [];
-const render_callbacks = [];
-const flush_callbacks = [];
-const resolved_promise = Promise.resolve();
-let update_scheduled = false;
-function schedule_update() {
-    if (!update_scheduled) {
-        update_scheduled = true;
-        resolved_promise.then(flush);
-    }
-}
-function add_render_callback(fn) {
-    render_callbacks.push(fn);
-}
-let flushing = false;
-const seen_callbacks = new Set();
-function flush() {
-    if (flushing)
-        return;
-    flushing = true;
-    do {
-        // first, call beforeUpdate functions
-        // and update components
-        for (let i = 0; i < dirty_components.length; i += 1) {
-            const component = dirty_components[i];
-            set_current_component(component);
-            update(component.$$);
-        }
-        set_current_component(null);
-        dirty_components.length = 0;
-        while (binding_callbacks.length)
-            binding_callbacks.pop()();
-        // then, once components are updated, call
-        // afterUpdate functions. This may cause
-        // subsequent updates...
-        for (let i = 0; i < render_callbacks.length; i += 1) {
-            const callback = render_callbacks[i];
-            if (!seen_callbacks.has(callback)) {
-                // ...so guard against infinite loops
-                seen_callbacks.add(callback);
-                callback();
-            }
-        }
-        render_callbacks.length = 0;
-    } while (dirty_components.length);
-    while (flush_callbacks.length) {
-        flush_callbacks.pop()();
-    }
-    update_scheduled = false;
-    flushing = false;
-    seen_callbacks.clear();
-}
-function update($$) {
-    if ($$.fragment !== null) {
-        $$.update();
-        run_all($$.before_update);
-        const dirty = $$.dirty;
-        $$.dirty = [-1];
-        $$.fragment && $$.fragment.p($$.ctx, dirty);
-        $$.after_update.forEach(add_render_callback);
-    }
-}
-const outroing = new Set();
-let outros;
-function group_outros() {
-    outros = {
-        r: 0,
-        c: [],
-        p: outros // parent group
-    };
-}
-function check_outros() {
-    if (!outros.r) {
-        run_all(outros.c);
-    }
-    outros = outros.p;
-}
-function transition_in(block, local) {
-    if (block && block.i) {
-        outroing.delete(block);
-        block.i(local);
-    }
-}
-function transition_out(block, local, detach, callback) {
-    if (block && block.o) {
-        if (outroing.has(block))
-            return;
-        outroing.add(block);
-        outros.c.push(() => {
-            outroing.delete(block);
-            if (callback) {
-                if (detach)
-                    block.d(1);
-                callback();
-            }
-        });
-        block.o(local);
-    }
-}
-
-function get_spread_update(levels, updates) {
-    const update = {};
-    const to_null_out = {};
-    const accounted_for = { $$scope: 1 };
-    let i = levels.length;
-    while (i--) {
-        const o = levels[i];
-        const n = updates[i];
-        if (n) {
-            for (const key in o) {
-                if (!(key in n))
-                    to_null_out[key] = 1;
-            }
-            for (const key in n) {
-                if (!accounted_for[key]) {
-                    update[key] = n[key];
-                    accounted_for[key] = 1;
-                }
-            }
-            levels[i] = n;
-        }
-        else {
-            for (const key in o) {
-                accounted_for[key] = 1;
-            }
-        }
-    }
-    for (const key in to_null_out) {
-        if (!(key in update))
-            update[key] = undefined;
-    }
-    return update;
-}
-function get_spread_object(spread_props) {
-    return typeof spread_props === 'object' && spread_props !== null ? spread_props : {};
-}
-function create_component(block) {
-    block && block.c();
-}
-function mount_component(component, target, anchor, customElement) {
-    const { fragment, on_mount, on_destroy, after_update } = component.$$;
-    fragment && fragment.m(target, anchor);
-    if (!customElement) {
-        // onMount happens before the initial afterUpdate
-        add_render_callback(() => {
-            const new_on_destroy = on_mount.map(run).filter(is_function);
-            if (on_destroy) {
-                on_destroy.push(...new_on_destroy);
-            }
-            else {
-                // Edge case - component was destroyed immediately,
-                // most likely as a result of a binding initialising
-                run_all(new_on_destroy);
-            }
-            component.$$.on_mount = [];
-        });
-    }
-    after_update.forEach(add_render_callback);
-}
-function destroy_component(component, detaching) {
-    const $$ = component.$$;
-    if ($$.fragment !== null) {
-        run_all($$.on_destroy);
-        $$.fragment && $$.fragment.d(detaching);
-        // TODO null out other refs, including component.$$ (but need to
-        // preserve final state?)
-        $$.on_destroy = $$.fragment = null;
-        $$.ctx = [];
-    }
-}
-function make_dirty(component, i) {
-    if (component.$$.dirty[0] === -1) {
-        dirty_components.push(component);
-        schedule_update();
-        component.$$.dirty.fill(0);
-    }
-    component.$$.dirty[(i / 31) | 0] |= (1 << (i % 31));
-}
-function init(component, options, instance, create_fragment, not_equal, props, dirty = [-1]) {
-    const parent_component = current_component;
-    set_current_component(component);
-    const $$ = component.$$ = {
-        fragment: null,
-        ctx: null,
-        // state
-        props,
-        update: noop,
-        not_equal,
-        bound: blank_object(),
-        // lifecycle
-        on_mount: [],
-        on_destroy: [],
-        on_disconnect: [],
-        before_update: [],
-        after_update: [],
-        context: new Map(parent_component ? parent_component.$$.context : []),
-        // everything else
-        callbacks: blank_object(),
-        dirty,
-        skip_bound: false
-    };
-    let ready = false;
-    $$.ctx = instance
-        ? instance(component, options.props || {}, (i, ret, ...rest) => {
-            const value = rest.length ? rest[0] : ret;
-            if ($$.ctx && not_equal($$.ctx[i], $$.ctx[i] = value)) {
-                if (!$$.skip_bound && $$.bound[i])
-                    $$.bound[i](value);
-                if (ready)
-                    make_dirty(component, i);
-            }
-            return ret;
-        })
-        : [];
-    $$.update();
-    ready = true;
-    run_all($$.before_update);
-    // `false` as a special case of no DOM component
-    $$.fragment = create_fragment ? create_fragment($$.ctx) : false;
-    if (options.target) {
-        if (options.hydrate) {
-            const nodes = children(options.target);
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            $$.fragment && $$.fragment.l(nodes);
-            nodes.forEach(detach);
-        }
-        else {
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
-            $$.fragment && $$.fragment.c();
-        }
-        if (options.intro)
-            transition_in(component.$$.fragment);
-        mount_component(component, options.target, options.anchor, options.customElement);
-        flush();
-    }
-    set_current_component(parent_component);
-}
-/**
- * Base class for Svelte components. Used when dev=false.
- */
-class SvelteComponent {
-    $destroy() {
-        destroy_component(this, 1);
-        this.$destroy = noop;
-    }
-    $on(type, callback) {
-        const callbacks = (this.$$.callbacks[type] || (this.$$.callbacks[type] = []));
-        callbacks.push(callback);
-        return () => {
-            const index = callbacks.indexOf(callback);
-            if (index !== -1)
-                callbacks.splice(index, 1);
-        };
-    }
-    $set($$props) {
-        if (this.$$set && !is_empty($$props)) {
-            this.$$.skip_bound = true;
-            this.$$set($$props);
-            this.$$.skip_bound = false;
-        }
-    }
-}
-
-const MATRIX_VIEW = "BC-matrix";
-const STATS_VIEW = "BC-stats";
-const DUCK_VIEW = "BC-ducks";
-const TREE_VIEW = "BC-tree";
-const TRAIL_ICON = "BC-trail-icon";
-const TRAIL_ICON_SVG = '<path fill="currentColor" stroke="currentColor" d="M48.8,4c-6,0-13.5,0.5-19.7,3.3S17.9,15.9,17.9,25c0,5,2.6,9.7,6.1,13.9s8.1,8.3,12.6,12.3s9,7.8,12.2,11.5 c3.2,3.7,5.1,7.1,5.1,10.2c0,14.4-13.4,19.3-13.4,19.3c-0.7,0.2-1.2,0.8-1.3,1.5s0.1,1.4,0.7,1.9c0.6,0.5,1.3,0.6,2,0.3 c0,0,16.1-6.1,16.1-23c0-4.6-2.6-8.8-6.1-12.8c-3.5-4-8.1-7.9-12.6-11.8c-4.5-3.9-8.9-7.9-12.2-11.8c-3.2-3.9-5.2-7.7-5.2-11.4 c0-7.8,3.6-11.6,8.8-14S43,8,48.8,8c4.6,0,9.3,0,11,0c0.7,0,1.4-0.4,1.7-1c0.3-0.6,0.3-1.4,0-2s-1-1-1.7-1C58.3,4,53.4,4,48.8,4 L48.8,4z M78.1,4c-0.6,0-1.2,0.2-1.6,0.7l-8.9,9.9c-0.5,0.6-0.7,1.4-0.3,2.2c0.3,0.7,1,1.2,1.8,1.2h0.1l-2.8,2.6 c-0.6,0.6-0.8,1.4-0.5,2.2c0.3,0.8,1,1.3,1.9,1.3h1.3l-4.5,4.6c-0.6,0.6-0.7,1.4-0.4,2.2c0.3,0.7,1,1.2,1.8,1.2h10v4 c0,0.7,0.4,1.4,1,1.8c0.6,0.4,1.4,0.4,2,0c0.6-0.4,1-1,1-1.8v-4h10c0.8,0,1.5-0.5,1.8-1.2c0.3-0.7,0.1-1.6-0.4-2.2L86.9,24h1.3 c0.8,0,1.6-0.5,1.9-1.3c0.3-0.8,0.1-1.6-0.5-2.2l-2.8-2.6h0.1c0.8,0,1.5-0.5,1.8-1.2c0.3-0.7,0.2-1.6-0.3-2.2l-8.9-9.9 C79.1,4.3,78.6,4,78.1,4L78.1,4z M78,9l4.4,4.9h-0.7c-0.8,0-1.6,0.5-1.9,1.3c-0.3,0.8-0.1,1.6,0.5,2.2l2.8,2.6h-1.1 c-0.8,0-1.5,0.5-1.8,1.2c-0.3,0.7-0.1,1.6,0.4,2.2l4.5,4.6H70.8l4.5-4.6c0.6-0.6,0.7-1.4,0.4-2.2c-0.3-0.7-1-1.2-1.8-1.2h-1.1 l2.8-2.6c0.6-0.6,0.8-1.4,0.5-2.2c-0.3-0.8-1-1.3-1.9-1.3h-0.7L78,9z M52.4,12c-4.1,0-7.1,0.5-9.4,1.5c-2.3,1-3.8,2.5-4.5,4.3 c-0.7,1.8-0.5,3.6,0.1,5.2c0.6,1.5,1.5,2.9,2.5,3.9c5.4,5.4,18.1,12.6,29.6,21c5.8,4.2,11.2,8.6,15.1,13c3.9,4.4,6.2,8.7,6.2,12.4 c0,14.5-12.9,18.7-12.9,18.7c-0.7,0.2-1.2,0.8-1.4,1.5s0.1,1.5,0.7,1.9c0.6,0.5,1.3,0.6,2,0.3c0,0,15.6-5.6,15.6-22.5 c0-5.3-2.9-10.3-7.2-15.1C84.6,53.6,79,49,73.1,44.7c-11.8-8.6-24.8-16.3-29.2-20.6c-0.6-0.6-1.2-1.5-1.6-2.4 c-0.3-0.9-0.4-1.7-0.1-2.4c0.3-0.7,0.8-1.4,2.3-2c1.5-0.7,4.1-1.2,7.8-1.2c4.9,0,9.4,0.1,9.4,0.1c0.7,0,1.4-0.3,1.8-1 c0.4-0.6,0.4-1.4,0-2.1c-0.4-0.6-1.1-1-1.8-1C61.9,12.1,57.3,12,52.4,12L52.4,12z M24,46c-0.5,0-1.1,0.2-1.4,0.6L9.2,60.5 c-0.6,0.6-0.7,1.4-0.4,2.2c0.3,0.7,1,1.2,1.8,1.2h3l-6.5,6.8c-0.6,0.6-0.7,1.4-0.4,2.2s1,1.2,1.8,1.2H13l-8.5,8.6 C4,83.2,3.8,84,4.2,84.8C4.5,85.5,5.2,86,6,86h16v5.4c0,0.7,0.4,1.4,1,1.8c0.6,0.4,1.4,0.4,2,0c0.6-0.4,1-1,1-1.8V86h16 c0.8,0,1.5-0.5,1.8-1.2c0.3-0.7,0.1-1.6-0.4-2.2L35,74h4.4c0.8,0,1.5-0.5,1.8-1.2s0.2-1.6-0.4-2.2l-6.5-6.8h3 c0.8,0,1.5-0.5,1.8-1.2c0.3-0.7,0.2-1.6-0.4-2.2L25.4,46.6C25.1,46.2,24.5,46,24,46L24,46z M24,50.9l8.7,9h-3 c-0.8,0-1.5,0.5-1.8,1.2s-0.2,1.6,0.4,2.2l6.5,6.8h-4.5c-0.8,0-1.5,0.5-1.8,1.2c-0.3,0.7-0.1,1.6,0.4,2.2l8.5,8.6H10.8l8.5-8.6 c0.6-0.6,0.7-1.4,0.4-2.2c-0.3-0.7-1-1.2-1.8-1.2h-4.5l6.5-6.8c0.6-0.6,0.7-1.4,0.4-2.2c-0.3-0.7-1-1.2-1.8-1.2h-3L24,50.9z"/>';
-const DUCK_ICON = "BC-duck-icon";
-const DUCK_ICON_SVG = '<path fill="currentColor" stroke="currentColor" d="M72,31c0-1.5-1.2-2.8-2.8-2.8c-1.5,0-2.8,1.2-2.8,2.8s1.2,2.8,2.8,2.8C70.8,33.8,72,32.6,72,31z M80.4,47.7c10.7,0,19.4-8.7,19.4-19.4H88.4c-0.1-0.6-0.1-1.1-0.2-1.7c-1.6-7.1-7.3-12.8-14.3-144c-1.6-0.4-3.1-0.5-4.6-0.5c-10.7,0-19.4,8.7-19.4,19.4v13.9h-9.4c-6.8,0-13.6-2.4-18.2-7.3c-0.7-0.7-1.6-1.1-2.4-11c-1.7,0-3.3,1.3-3.3,3.3c0,16.4,12.5,31,28.6,32.6c1.6,0.2,3.1-1.1,3.1-2.8v-2.8c0-1.4-1-2.6-2.4-2.7c-7.9-09-14.8-6.2-18.4-13.5c4.1,1.6,8.5,2.5,13.1,2.5l17.7,0.1V31c0-6.1,5-11.1,11.1-11.1c0.9,0,1.8,0.1,2.7,0.3c3.9,0.9,7.2,4.2,8.1,8.1C814,34.4,78,39.1,74,41l-4.7,2.3v12.4l2.1,2.4c1.5,1.8,3.4,4.7,3.5,8.8c0.1,3.4-1.3,6.7-3.9,9.4c-3,3-7,4.8-11.2,4.8H43.9c-1,0-2.1-01-3.2-0.2C25.2,79.5,12.3,68.1,8.7,53.2h5.1c-1.2-2.7-2-5.5-2.5-8.3H5.4c-3.3,0-6,3-5.5,6.3c2.9,20.3,19.4,36.1,40,38c1.3,0.1,2.6,02,4,0.2h15.8c12.5,0,23.7-10.2,23.4-22.7c-0.1-5.4-2.2-10.3-5.6-14.1v-4.9H80.4L80.4,47.7z"/>';
-const splitLinksRegex = new RegExp(/\[\[(.+?)\]\]/g);
-const dropHeaderOrAlias = new RegExp(/\[\[([^#|]+)\]\]/);
-/** A meta-regex that takes in a string of the form `/regex/flags`, and returns 2 groups, the inner `regex`, and the `flags`. */
-const regNFlags = new RegExp(/^.(.*?)\W(\w*)$/);
-const VISTYPES = [
-    "Force Directed Graph",
-    "Tidy Tree",
-    "Circle Packing",
-    "Edge Bundling",
-    "Arc Diagram",
-    "Sunburst",
-    "Tree Map",
-    "Icicle",
-    "Radial Tree",
-];
-const DIRECTIONS$1 = ["up", "same", "down", "next", "prev"];
-const ARROW_DIRECTIONS = {
-    up: "↑",
-    same: "↔",
-    down: "↓",
-    next: "→",
-    prev: "←",
-};
-const RELATIONS = ["Parent", "Sibling", "Child"];
-const REAlCLOSED = ["Real", "Closed"];
-const ALLUNLINKED = ["All", "No Unlinked"];
-const CODEBLOCK_TYPES = ["tree", "juggl"];
-const CODEBLOCK_FIELDS = [
-    "type",
-    "dir",
-    "fields",
-    "depth",
-    "title",
-    "flat",
-    "content",
-    "from",
-    "implied",
-];
-const JUGGL_CB_DEFAULTS = {
-    animateLayout: true,
-    autoAddNodes: false,
-    autoExpand: false,
-    autoZoom: false,
-    coreStore: "core",
-    expandInitial: false,
-    fdgdLayout: "d3-force",
-    filter: "",
-    height: "750px",
-    hoverEdges: false,
-    layout: "force-directed",
-    limit: 250,
-    mergeEdges: true,
-    metaKeyHover: true,
-    mode: "workspace",
-    navigator: true,
-    openWithShift: false,
-    readContent: true,
-    styleGroups: [],
-    toolbar: true,
-    width: "100%",
-    zoomSpeed: 1,
-};
-const JUGGL_TRAIL_DEFAULTS = Object.assign(JUGGL_CB_DEFAULTS, {
-    animateLayout: true,
-    autoZoom: false,
-    fdgdLayout: "d3-force",
-    height: "400px",
-    readContent: false,
-    toolbar: false,
-    navigator: false,
-});
-CODEBLOCK_FIELDS.push(...Object.keys(JUGGL_CB_DEFAULTS));
-const blankUserHier = () => {
-    return { up: [], same: [], down: [], next: [], prev: [] };
-};
-const blankRealNImplied = () => {
-    return {
-        up: { reals: [], implieds: [] },
-        down: { reals: [], implieds: [] },
-        same: { reals: [], implieds: [] },
-        next: { reals: [], implieds: [] },
-        prev: { reals: [], implieds: [] },
-    };
-};
-const [BC_I_AUNT, BC_I_COUSIN, BC_I_SIBLING_1, BC_I_SIBLING_2, BC_I_REFLEXIVE,] = ["BC-Aunt", "BC-Cousin", "BC-Sibling-1", "BC-Sibling-2", "BC-Reflexive"];
-const [BC_FOLDER_NOTE, BC_FOLDER_NOTE_RECURSIVE, BC_TAG_NOTE, BC_TAG_NOTE_FIELD, BC_TAG_NOTE_EXACT, BC_LINK_NOTE, BC_TRAVERSE_NOTE, BC_REGEX_NOTE, BC_REGEX_NOTE_FIELD, BC_IGNORE_DENDRON, BC_HIDE_TRAIL, BC_ORDER,] = [
-    "BC-folder-note",
-    "BC-folder-note-recursive",
-    "BC-tag-note",
-    "BC-tag-note-field",
-    "BC-tag-note-exact",
-    "BC-link-note",
-    "BC-traverse-note",
-    "BC-regex-note",
-    "BC-regex-note-field",
-    "BC-ignore-dendron",
-    "BC-hide-trail",
-    "BC-order",
-];
-const BC_FIELDS_INFO = [
-    {
-        field: BC_FOLDER_NOTE,
-        desc: "Set this note as a Breadcrumbs folder-note. All other notes in this folder will be added to the graph with the field name specified in this key's value",
-        after: ": ",
-        alt: true,
-    },
-    {
-        field: BC_FOLDER_NOTE_RECURSIVE,
-        desc: "Recursively add notes in subfolders to the foldernote of _that_ subfolder.",
-        after: ": true",
-        alt: false,
-    },
-    {
-        field: BC_TAG_NOTE,
-        desc: "Set this note as a Breadcrumbs tag-note. All other notes with this tag will be added to the graph using the default fieldName specified in `Settings > Alternative Hierarchies > Tag Notes > Default Field`, or using the fieldName you specify with `BC-tag-note-field: fieldName`",
-        after: ": '#",
-        alt: true,
-    },
-    {
-        field: BC_TAG_NOTE_FIELD,
-        desc: "Manually choose the field for this tag-note to use",
-        after: ": ",
-        alt: false,
-    },
-    {
-        field: BC_TAG_NOTE_EXACT,
-        desc: "Only look for notes with the exact tag. i.e. `#A` won't match `#A/B`",
-        after: ": true",
-        alt: false,
-    },
-    {
-        field: BC_LINK_NOTE,
-        desc: "Set this note as a Breadcrumbs link-note. All links leaving this note will be added to the graph with the field name specified in this key's value.",
-        after: ": ",
-        alt: true,
-    },
-    {
-        field: BC_TRAVERSE_NOTE,
-        desc: "Set this note as a Breadcrumbs traverse-note. Starting from this note, the Obsidian graph will be traversed in depth-first order, and all notes along the way will be added to the BC graph using the fieldName you specify",
-        after: ": ",
-        alt: true,
-    },
-    {
-        field: BC_REGEX_NOTE,
-        desc: "Set this note as a Breadcrumbs regex-note. The value of this field is a regular expression (of the form '/regex/flags'). All note names that match the regex will be added to the BC graph using the default fieldName specified in `Settings > Alternative Hierarchies > Regex Notes > Default Field`, or using the fieldName you specify in 'BC-regex-note-field'.",
-        after: ": '/",
-        alt: true,
-    },
-    {
-        field: BC_REGEX_NOTE_FIELD,
-        desc: "Manually choose the field for this regex-note to use",
-        after: ": ",
-        alt: false,
-    },
-    {
-        field: BC_IGNORE_DENDRON,
-        desc: "Tells Breadcrumbs to not treat this note as a dendron note (only useful if the note name has you dendron splitter in it, usually a period `.`).",
-        after: ": true",
-        alt: false,
-    },
-    {
-        field: BC_HIDE_TRAIL,
-        desc: "Don't show the trail in this note",
-        after: ": true",
-        alt: false,
-    },
-    {
-        field: BC_ORDER,
-        desc: "Set the order of this note in the List/Matrix view. A lower value places this note higher in the order.",
-        after: ": ",
-        alt: false,
-    },
-];
-const BC_ALTS = BC_FIELDS_INFO.filter((f) => f.alt).map((f) => f.field);
-const DEFAULT_SETTINGS = {
-    addDendronNotes: false,
-    aliasesInIndex: false,
-    alphaSortAsc: true,
-    altLinkFields: [],
-    CSVPaths: "",
-    dateFormat: "YYYY-MM-DD",
-    debugMode: "WARN",
-    defaultView: true,
-    dendronNoteDelimiter: ".",
-    dendronNoteField: "up",
-    downViewWrap: false,
-    dotsColour: "#000000",
-    dvWaitTime: 5000,
-    enableAlphaSort: true,
-    fieldSuggestor: true,
-    filterImpliedSiblingsOfDifferentTypes: false,
-    limitWriteBCCheckboxes: [],
-    CHECKBOX_STATES_OVERWRITTEN: false,
-    gridDots: false,
-    gridHeatmap: false,
-    heatmapColour: getComputedStyle(document.body).getPropertyValue("--text-accent"),
-    hierarchyNotes: [""],
-    HNUpField: "",
-    indexNotes: [""],
-    namingSystemField: "",
-    namingSystemRegex: "",
-    namingSystemSplit: ".",
-    namingSystemEndsWithDelimiter: false,
-    refreshOnNoteChange: false,
-    useAllMetadata: true,
-    openMatrixOnLoad: true,
-    openStatsOnLoad: true,
-    openDuckOnLoad: false,
-    openDownOnLoad: true,
-    parseJugglLinksWithoutJuggl: false,
-    showNameOrType: true,
-    showRelationType: true,
-    regexNoteField: "",
-    rlLeaf: true,
-    showAllPathsIfNoneToIndexNote: false,
-    showAllAliases: true,
-    showBCs: true,
-    showBCsInEditLPMode: false,
-    showRefreshNotice: true,
-    showImpliedRelations: true,
-    showTrail: true,
-    showGrid: true,
-    showJuggl: false,
-    showPrevNext: true,
-    sortByNameShowAlias: false,
-    squareDirectionsOrder: [0, 1, 2, 3, 4],
-    limitTrailCheckboxes: [],
-    limitJumpToFirstFields: [],
-    showAll: false,
-    noPathMessage: `This note has no real or implied parents`,
-    tagNoteField: "",
-    threadIntoNewPane: false,
-    threadingTemplate: "{{field}} of {{current}}",
-    threadingDirTemplates: { up: "", same: "", down: "", next: "", prev: "" },
-    trailSeperator: "→",
-    treatCurrNodeAsImpliedSibling: false,
-    trimDendronNotes: false,
-    respectReadableLineLength: true,
-    userHiers: [
-        {
-            up: ["up"],
-            same: ["same"],
-            down: ["down"],
-            next: ["next"],
-            prev: ["prev"],
-        },
-    ],
-    writeBCsInline: false,
-    showWriteAllBCsCmd: false,
-    visGraph: "Force Directed Graph",
-    visRelation: "Parent",
-    visClosed: "Real",
-    visAll: "All",
-    wikilinkIndex: true,
-    impliedRelations: {
-        siblingIdentity: false,
-        sameParentIsSibling: true,
-        siblingsSiblingIsSibling: false,
-        parentsSiblingsIsParents: false,
-        parentsParentsIsParent: false,
-        cousinsIsSibling: false,
-    },
-};
-
-var graphology_umd_min = createCommonjsModule(function (module, exports) {
-!function(t,e){module.exports=e();}(commonjsGlobal,(function(){function t(e){return t="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},t(e)}function e(t,e){t.prototype=Object.create(e.prototype),t.prototype.constructor=t,r(t,e);}function n(t){return n=Object.setPrototypeOf?Object.getPrototypeOf:function(t){return t.__proto__||Object.getPrototypeOf(t)},n(t)}function r(t,e){return r=Object.setPrototypeOf||function(t,e){return t.__proto__=e,t},r(t,e)}function i(){if("undefined"==typeof Reflect||!Reflect.construct)return !1;if(Reflect.construct.sham)return !1;if("function"==typeof Proxy)return !0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(t){return !1}}function o(t,e,n){return o=i()?Reflect.construct:function(t,e,n){var i=[null];i.push.apply(i,e);var o=new(Function.bind.apply(t,i));return n&&r(o,n.prototype),o},o.apply(null,arguments)}function a(t){var e="function"==typeof Map?new Map:void 0;return a=function(t){if(null===t||(i=t,-1===Function.toString.call(i).indexOf("[native code]")))return t;var i;if("function"!=typeof t)throw new TypeError("Super expression must either be null or a function");if(void 0!==e){if(e.has(t))return e.get(t);e.set(t,a);}function a(){return o(t,arguments,n(this).constructor)}return a.prototype=Object.create(t.prototype,{constructor:{value:a,enumerable:!1,writable:!0,configurable:!0}}),r(a,t)},a(t)}function u(t){if(void 0===t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return t}var c=function(){for(var t=arguments[0],e=1,n=arguments.length;e<n;e++)if(arguments[e])for(var r in arguments[e])t[r]=arguments[e][r];return t};function d(t,e,n,r){var i=t._nodes.get(e),o=null;return i?o="mixed"===r?i.out&&i.out[n]||i.undirected&&i.undirected[n]:"directed"===r?i.out&&i.out[n]:i.undirected&&i.undirected[n]:o}function s(e){return null!==e&&"object"===t(e)&&"function"==typeof e.addUndirectedEdgeWithKey&&"function"==typeof e.dropNode}function h(e){return "object"===t(e)&&null!==e&&e.constructor===Object}function f(t){var e;for(e in t)return !1;return !0}function p(t,e,n){Object.defineProperty(t,e,{enumerable:!1,configurable:!1,writable:!0,value:n});}function l(t,e,n){var r={enumerable:!0,configurable:!0};"function"==typeof n?r.get=n:(r.value=n,r.writable=!1),Object.defineProperty(t,e,r);}function g(t){return !!h(t)&&!(t.attributes&&!Array.isArray(t.attributes))}"function"==typeof Object.assign&&(c=Object.assign);var y,v={exports:{}},b="object"==typeof Reflect?Reflect:null,w=b&&"function"==typeof b.apply?b.apply:function(t,e,n){return Function.prototype.apply.call(t,e,n)};y=b&&"function"==typeof b.ownKeys?b.ownKeys:Object.getOwnPropertySymbols?function(t){return Object.getOwnPropertyNames(t).concat(Object.getOwnPropertySymbols(t))}:function(t){return Object.getOwnPropertyNames(t)};var m=Number.isNaN||function(t){return t!=t};function _(){_.init.call(this);}v.exports=_,v.exports.once=function(t,e){return new Promise((function(n,r){function i(n){t.removeListener(e,o),r(n);}function o(){"function"==typeof t.removeListener&&t.removeListener("error",i),n([].slice.call(arguments));}U(t,e,o,{once:!0}),"error"!==e&&function(t,e,n){"function"==typeof t.on&&U(t,"error",e,n);}(t,i,{once:!0});}))},_.EventEmitter=_,_.prototype._events=void 0,_.prototype._eventsCount=0,_.prototype._maxListeners=void 0;var k=10;function G(t){if("function"!=typeof t)throw new TypeError('The "listener" argument must be of type Function. Received type '+typeof t)}function x(t){return void 0===t._maxListeners?_.defaultMaxListeners:t._maxListeners}function E(t,e,n,r){var i,o,a,u;if(G(n),void 0===(o=t._events)?(o=t._events=Object.create(null),t._eventsCount=0):(void 0!==o.newListener&&(t.emit("newListener",e,n.listener?n.listener:n),o=t._events),a=o[e]),void 0===a)a=o[e]=n,++t._eventsCount;else if("function"==typeof a?a=o[e]=r?[n,a]:[a,n]:r?a.unshift(n):a.push(n),(i=x(t))>0&&a.length>i&&!a.warned){a.warned=!0;var c=new Error("Possible EventEmitter memory leak detected. "+a.length+" "+String(e)+" listeners added. Use emitter.setMaxListeners() to increase limit");c.name="MaxListenersExceededWarning",c.emitter=t,c.type=e,c.count=a.length,u=c,console&&console.warn&&console.warn(u);}return t}function S(){if(!this.fired)return this.target.removeListener(this.type,this.wrapFn),this.fired=!0,0===arguments.length?this.listener.call(this.target):this.listener.apply(this.target,arguments)}function A(t,e,n){var r={fired:!1,wrapFn:void 0,target:t,type:e,listener:n},i=S.bind(r);return i.listener=n,r.wrapFn=i,i}function L(t,e,n){var r=t._events;if(void 0===r)return [];var i=r[e];return void 0===i?[]:"function"==typeof i?n?[i.listener||i]:[i]:n?function(t){for(var e=new Array(t.length),n=0;n<e.length;++n)e[n]=t[n].listener||t[n];return e}(i):N(i,i.length)}function D(t){var e=this._events;if(void 0!==e){var n=e[t];if("function"==typeof n)return 1;if(void 0!==n)return n.length}return 0}function N(t,e){for(var n=new Array(e),r=0;r<e;++r)n[r]=t[r];return n}function U(t,e,n,r){if("function"==typeof t.on)r.once?t.once(e,n):t.on(e,n);else {if("function"!=typeof t.addEventListener)throw new TypeError('The "emitter" argument must be of type EventEmitter. Received type '+typeof t);t.addEventListener(e,(function i(o){r.once&&t.removeEventListener(e,i),n(o);}));}}function j(t){if("function"!=typeof t)throw new Error("obliterator/iterator: expecting a function!");this.next=t;}Object.defineProperty(_,"defaultMaxListeners",{enumerable:!0,get:function(){return k},set:function(t){if("number"!=typeof t||t<0||m(t))throw new RangeError('The value of "defaultMaxListeners" is out of range. It must be a non-negative number. Received '+t+".");k=t;}}),_.init=function(){void 0!==this._events&&this._events!==Object.getPrototypeOf(this)._events||(this._events=Object.create(null),this._eventsCount=0),this._maxListeners=this._maxListeners||void 0;},_.prototype.setMaxListeners=function(t){if("number"!=typeof t||t<0||m(t))throw new RangeError('The value of "n" is out of range. It must be a non-negative number. Received '+t+".");return this._maxListeners=t,this},_.prototype.getMaxListeners=function(){return x(this)},_.prototype.emit=function(t){for(var e=[],n=1;n<arguments.length;n++)e.push(arguments[n]);var r="error"===t,i=this._events;if(void 0!==i)r=r&&void 0===i.error;else if(!r)return !1;if(r){var o;if(e.length>0&&(o=e[0]),o instanceof Error)throw o;var a=new Error("Unhandled error."+(o?" ("+o.message+")":""));throw a.context=o,a}var u=i[t];if(void 0===u)return !1;if("function"==typeof u)w(u,this,e);else {var c=u.length,d=N(u,c);for(n=0;n<c;++n)w(d[n],this,e);}return !0},_.prototype.addListener=function(t,e){return E(this,t,e,!1)},_.prototype.on=_.prototype.addListener,_.prototype.prependListener=function(t,e){return E(this,t,e,!0)},_.prototype.once=function(t,e){return G(e),this.on(t,A(this,t,e)),this},_.prototype.prependOnceListener=function(t,e){return G(e),this.prependListener(t,A(this,t,e)),this},_.prototype.removeListener=function(t,e){var n,r,i,o,a;if(G(e),void 0===(r=this._events))return this;if(void 0===(n=r[t]))return this;if(n===e||n.listener===e)0==--this._eventsCount?this._events=Object.create(null):(delete r[t],r.removeListener&&this.emit("removeListener",t,n.listener||e));else if("function"!=typeof n){for(i=-1,o=n.length-1;o>=0;o--)if(n[o]===e||n[o].listener===e){a=n[o].listener,i=o;break}if(i<0)return this;0===i?n.shift():function(t,e){for(;e+1<t.length;e++)t[e]=t[e+1];t.pop();}(n,i),1===n.length&&(r[t]=n[0]),void 0!==r.removeListener&&this.emit("removeListener",t,a||e);}return this},_.prototype.off=_.prototype.removeListener,_.prototype.removeAllListeners=function(t){var e,n,r;if(void 0===(n=this._events))return this;if(void 0===n.removeListener)return 0===arguments.length?(this._events=Object.create(null),this._eventsCount=0):void 0!==n[t]&&(0==--this._eventsCount?this._events=Object.create(null):delete n[t]),this;if(0===arguments.length){var i,o=Object.keys(n);for(r=0;r<o.length;++r)"removeListener"!==(i=o[r])&&this.removeAllListeners(i);return this.removeAllListeners("removeListener"),this._events=Object.create(null),this._eventsCount=0,this}if("function"==typeof(e=n[t]))this.removeListener(t,e);else if(void 0!==e)for(r=e.length-1;r>=0;r--)this.removeListener(t,e[r]);return this},_.prototype.listeners=function(t){return L(this,t,!0)},_.prototype.rawListeners=function(t){return L(this,t,!1)},_.listenerCount=function(t,e){return "function"==typeof t.listenerCount?t.listenerCount(e):D.call(t,e)},_.prototype.listenerCount=D,_.prototype.eventNames=function(){return this._eventsCount>0?y(this._events):[]},"undefined"!=typeof Symbol&&(j.prototype[Symbol.iterator]=function(){return this}),j.of=function(){var t=arguments,e=t.length,n=0;return new j((function(){return n>=e?{done:!0}:{done:!1,value:t[n++]}}))},j.empty=function(){return new j((function(){return {done:!0}}))},j.fromSequence=function(t){var e=0,n=t.length;return new j((function(){return e>=n?{done:!0}:{done:!1,value:t[e++]}}))},j.is=function(t){return t instanceof j||"object"==typeof t&&null!==t&&"function"==typeof t.next};var O=j,C={};C.ARRAY_BUFFER_SUPPORT="undefined"!=typeof ArrayBuffer,C.SYMBOL_SUPPORT="undefined"!=typeof Symbol;var z=O,M=C,P=M.ARRAY_BUFFER_SUPPORT,T=M.SYMBOL_SUPPORT;var R=function(t){var e=function(t){return "string"==typeof t||Array.isArray(t)||P&&ArrayBuffer.isView(t)?z.fromSequence(t):"object"!=typeof t||null===t?null:T&&"function"==typeof t[Symbol.iterator]?t[Symbol.iterator]():"function"==typeof t.next?t:null}(t);if(!e)throw new Error("obliterator: target is not iterable nor a valid iterator.");return e},W=R,K=function(t,e){for(var n,r=arguments.length>1?e:1/0,i=r!==1/0?new Array(r):[],o=0,a=W(t);;){if(o===r)return i;if((n=a.next()).done)return o!==e&&(i.length=o),i;i[o++]=n.value;}},I=function(t){function n(e){var n;return (n=t.call(this)||this).name="GraphError",n.message=e,n}return e(n,t),n}(a(Error)),F=function(t){function n(e){var r;return (r=t.call(this,e)||this).name="InvalidArgumentsGraphError","function"==typeof Error.captureStackTrace&&Error.captureStackTrace(u(r),n.prototype.constructor),r}return e(n,t),n}(I),Y=function(t){function n(e){var r;return (r=t.call(this,e)||this).name="NotFoundGraphError","function"==typeof Error.captureStackTrace&&Error.captureStackTrace(u(r),n.prototype.constructor),r}return e(n,t),n}(I),B=function(t){function n(e){var r;return (r=t.call(this,e)||this).name="UsageGraphError","function"==typeof Error.captureStackTrace&&Error.captureStackTrace(u(r),n.prototype.constructor),r}return e(n,t),n}(I);function q(t,e){this.key=t,this.attributes=e,this.clear();}function J(t,e){this.key=t,this.attributes=e,this.clear();}function V(t,e){this.key=t,this.attributes=e,this.clear();}function H(t,e,n,r,i){this.key=e,this.attributes=i,this.undirected=t,this.source=n,this.target=r;}function Q(t,e,n,r,i,o,a){var u,c,d="out",s="in";if(e&&(d=s="undirected"),t.multi){if(void 0===(c=(u=o[d])[i])&&(c=new Set,u[i]=c),c.add(n),r===i&&e)return;void 0===(u=a[s])[r]&&(u[r]=c);}else {if(o[d][i]=n,r===i&&e)return;a[s][r]=n;}}function X(t,e,n){var r=t.multi,i=n.source,o=n.target,a=i.key,u=o.key,c=i[e?"undirected":"out"],d=e?"undirected":"in";if(u in c)if(r){var s=c[u];1===s.size?(delete c[u],delete o[d][a]):s.delete(n);}else delete c[u];r||delete o[d][a];}q.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.undirectedDegree=0,this.directedSelfLoops=0,this.undirectedSelfLoops=0,this.in={},this.out={},this.undirected={};},J.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.directedSelfLoops=0,this.in={},this.out={};},J.prototype.upgradeToMixed=function(){this.undirectedDegree=0,this.undirectedSelfLoops=0,this.undirected={};},V.prototype.clear=function(){this.undirectedDegree=0,this.undirectedSelfLoops=0,this.undirected={};},V.prototype.upgradeToMixed=function(){this.inDegree=0,this.outDegree=0,this.directedSelfLoops=0,this.in={},this.out={};};function Z(t,e,n,r,i,o,a){var u,c,d,s;if(r=""+r,0===n){if(!(u=t._nodes.get(r)))throw new Y("Graph.".concat(e,': could not find the "').concat(r,'" node in the graph.'));d=i,s=o;}else if(3===n){if(i=""+i,!(c=t._edges.get(i)))throw new Y("Graph.".concat(e,': could not find the "').concat(i,'" edge in the graph.'));var h=c.source.key,f=c.target.key;if(r===h)u=c.target;else {if(r!==f)throw new Y("Graph.".concat(e,': the "').concat(r,'" node is not attached to the "').concat(i,'" edge (').concat(h,", ").concat(f,")."));u=c.source;}d=o,s=a;}else {if(!(c=t._edges.get(r)))throw new Y("Graph.".concat(e,': could not find the "').concat(r,'" edge in the graph.'));u=1===n?c.source:c.target,d=i,s=o;}return [u,d,s]}var $=[{name:function(t){return "get".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];return a.attributes[u]};}},{name:function(t){return "get".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r){return Z(this,e,n,t,r)[0].attributes};}},{name:function(t){return "has".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];return a.attributes.hasOwnProperty(u)};}},{name:function(t){return "set".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i,o){var a=Z(this,e,n,t,r,i,o),u=a[0],c=a[1],d=a[2];return u.attributes[c]=d,this.emit("nodeAttributesUpdated",{key:u.key,type:"set",attributes:u.attributes,name:c}),this};}},{name:function(t){return "update".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i,o){var a=Z(this,e,n,t,r,i,o),u=a[0],c=a[1],d=a[2];if("function"!=typeof d)throw new F("Graph.".concat(e,": updater should be a function."));var s=u.attributes,h=d(s[c]);return s[c]=h,this.emit("nodeAttributesUpdated",{key:u.key,type:"set",attributes:u.attributes,name:c}),this};}},{name:function(t){return "remove".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];return delete a.attributes[u],this.emit("nodeAttributesUpdated",{key:a.key,type:"remove",attributes:a.attributes,name:u}),this};}},{name:function(t){return "replace".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];if(!h(u))throw new F("Graph.".concat(e,": provided attributes are not a plain object."));return a.attributes=u,this.emit("nodeAttributesUpdated",{key:a.key,type:"replace",attributes:a.attributes}),this};}},{name:function(t){return "merge".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];if(!h(u))throw new F("Graph.".concat(e,": provided attributes are not a plain object."));return c(a.attributes,u),this.emit("nodeAttributesUpdated",{key:a.key,type:"merge",attributes:a.attributes,data:u}),this};}},{name:function(t){return "update".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];if("function"!=typeof u)throw new F("Graph.".concat(e,": provided updater is not a function."));return a.attributes=u(a.attributes),this.emit("nodeAttributesUpdated",{key:a.key,type:"update",attributes:a.attributes}),this};}}];var tt=[{name:function(t){return "get".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return i.attributes[r]};}},{name:function(t){return "get".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t){var r;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>1){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var i=""+t,o=""+arguments[1];if(!(r=d(this,i,o,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(i,'" - "').concat(o,'").'))}else if(t=""+t,!(r=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&r.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return r.attributes};}},{name:function(t){return "has".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return i.attributes.hasOwnProperty(r)};}},{name:function(t){return "set".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>3){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var a=""+t,u=""+r;if(r=arguments[2],i=arguments[3],!(o=d(this,a,u,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(a,'" - "').concat(u,'").'))}else if(t=""+t,!(o=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&o.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return o.attributes[r]=i,this.emit("edgeAttributesUpdated",{key:o.key,type:"set",attributes:o.attributes,name:r}),this};}},{name:function(t){return "update".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>3){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var a=""+t,u=""+r;if(r=arguments[2],i=arguments[3],!(o=d(this,a,u,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(a,'" - "').concat(u,'").'))}else if(t=""+t,!(o=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("function"!=typeof i)throw new F("Graph.".concat(e,": updater should be a function."));if("mixed"!==n&&o.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return o.attributes[r]=i(o.attributes[r]),this.emit("edgeAttributesUpdated",{key:o.key,type:"set",attributes:o.attributes,name:r}),this};}},{name:function(t){return "remove".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return delete i.attributes[r],this.emit("edgeAttributesUpdated",{key:i.key,type:"remove",attributes:i.attributes,name:r}),this};}},{name:function(t){return "replace".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if(!h(r))throw new F("Graph.".concat(e,": provided attributes are not a plain object."));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return i.attributes=r,this.emit("edgeAttributesUpdated",{key:i.key,type:"replace",attributes:i.attributes}),this};}},{name:function(t){return "merge".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if(!h(r))throw new F("Graph.".concat(e,": provided attributes are not a plain object."));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return c(i.attributes,r),this.emit("edgeAttributesUpdated",{key:i.key,type:"merge",attributes:i.attributes,data:r}),this};}},{name:function(t){return "update".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("function"!=typeof r)throw new F("Graph.".concat(e,": provided updater is not a function."));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return i.attributes=r(i.attributes),this.emit("edgeAttributesUpdated",{key:i.key,type:"update",attributes:i.attributes}),this};}}];var et=O,nt=R,rt=function(){var t,e=arguments,n=-1;return new et((function r(){if(!t){if(++n>=e.length)return {done:!0};t=nt(e[n]);}var i=t.next();return i.done?(t=null,r()):i}))},it=[{name:"edges",type:"mixed"},{name:"inEdges",type:"directed",direction:"in"},{name:"outEdges",type:"directed",direction:"out"},{name:"inboundEdges",type:"mixed",direction:"in"},{name:"outboundEdges",type:"mixed",direction:"out"},{name:"directedEdges",type:"directed"},{name:"undirectedEdges",type:"undirected"}];function ot(t,e){for(var n in e)t.push(e[n].key);}function at(t,e){for(var n in e)e[n].forEach((function(e){return t.push(e.key)}));}function ut(t,e,n){for(var r in t)if(r!==n){var i=t[r];e(i.key,i.attributes,i.source.key,i.target.key,i.source.attributes,i.target.attributes,i.undirected);}}function ct(t,e,n){for(var r in t)r!==n&&t[r].forEach((function(t){return e(t.key,t.attributes,t.source.key,t.target.key,t.source.attributes,t.target.attributes,t.undirected)}));}function dt(t,e,n){for(var r in t)if(r!==n){var i=t[r];if(e(i.key,i.attributes,i.source.key,i.target.key,i.source.attributes,i.target.attributes,i.undirected))return i.key}}function st(t,e,n){var r,i,o,a,u;for(var c in t)if(c!==n)for(r=t[c].values();!0!==(i=r.next()).done;)if(a=(o=i.value).source,u=o.target,e(o.key,o.attributes,a.key,u.key,a.attributes,u.attributes,o.undirected))return o.key}function ht(t,e){var n=Object.keys(t),r=n.length,i=null,o=0;return new O((function a(){var u;if(i){var c=i.next();if(c.done)return i=null,o++,a();u=c.value;}else {if(o>=r)return {done:!0};var d=n[o];if(d===e)return o++,a();if((u=t[d])instanceof Set)return i=u.values(),a();o++;}return {done:!1,value:{edge:u.key,attributes:u.attributes,source:u.source.key,target:u.target.key,sourceAttributes:u.source.attributes,targetAttributes:u.target.attributes,undirected:u.undirected}}}))}function ft(t,e,n){var r=e[n];r&&t.push(r.key);}function pt(t,e,n){var r=e[n];r&&r.forEach((function(e){return t.push(e.key)}));}function lt(t,e,n){var r=t[e];if(r){var i=r.source,o=r.target;n(r.key,r.attributes,i.key,o.key,i.attributes,o.attributes,r.undirected);}}function gt(t,e,n){var r=t[e];r&&r.forEach((function(t){return n(t.key,t.attributes,t.source.key,t.target.key,t.source.attributes,t.target.attributes,t.undirected)}));}function yt(t,e,n){var r=t[e];if(r){var i=r.source,o=r.target;return n(r.key,r.attributes,i.key,o.key,i.attributes,o.attributes,r.undirected)?r.key:void 0}}function vt(t,e,n){var r=t[e];if(r)for(var i,o,a=r.values();!0!==(i=a.next()).done;)if(n((o=i.value).key,o.attributes,o.source.key,o.target.key,o.source.attributes,o.target.attributes,o.undirected))return o.key}function bt(t,e){var n=t[e];if(n instanceof Set){var r=n.values();return new O((function(){var t=r.next();if(t.done)return t;var e=t.value;return {done:!1,value:{edge:e.key,attributes:e.attributes,source:e.source.key,target:e.target.key,sourceAttributes:e.source.attributes,targetAttributes:e.target.attributes,undirected:e.undirected}}}))}return O.of([n.key,n.attributes,n.source.key,n.target.key,n.source.attributes,n.target.attributes])}function wt(t,e){if(0===t.size)return [];if("mixed"===e||e===t.type)return "function"==typeof Array.from?Array.from(t._edges.keys()):K(t._edges.keys(),t._edges.size);for(var n,r,i="undirected"===e?t.undirectedSize:t.directedSize,o=new Array(i),a="undirected"===e,u=t._edges.values(),c=0;!0!==(n=u.next()).done;)(r=n.value).undirected===a&&(o[c++]=r.key);return o}function mt(t,e,n){if(0!==t.size)for(var r,i,o="mixed"!==e&&e!==t.type,a="undirected"===e,u=t._edges.values();!0!==(r=u.next()).done;)if(i=r.value,!o||i.undirected===a){var c=i,d=c.key,s=c.attributes,h=c.source,f=c.target;n(d,s,h.key,f.key,h.attributes,f.attributes,i.undirected);}}function _t(t,e,n){if(0!==t.size)for(var r,i,o="mixed"!==e&&e!==t.type,a="undirected"===e,u=t._edges.values();!0!==(r=u.next()).done;)if(i=r.value,!o||i.undirected===a){var c=i,d=c.key,s=c.attributes,h=c.source,f=c.target;if(n(d,s,h.key,f.key,h.attributes,f.attributes,i.undirected))return d}}function kt(t,e){if(0===t.size)return O.empty();var n="mixed"!==e&&e!==t.type,r="undirected"===e,i=t._edges.values();return new O((function(){for(var t,e;;){if((t=i.next()).done)return t;if(e=t.value,!n||e.undirected===r)break}return {value:{edge:e.key,attributes:e.attributes,source:e.source.key,target:e.target.key,sourceAttributes:e.source.attributes,targetAttributes:e.target.attributes,undirected:e.undirected},done:!1}}))}function Gt(t,e,n,r){var i=[],o=t?at:ot;return "undirected"!==e&&("out"!==n&&o(i,r.in),"in"!==n&&o(i,r.out),!n&&r.directedSelfLoops>0&&i.splice(i.lastIndexOf(r.key),1)),"directed"!==e&&o(i,r.undirected),i}function xt(t,e,n,r,i){var o=t?ct:ut;"undirected"!==e&&("out"!==n&&o(r.in,i),"in"!==n&&o(r.out,i,n?null:r.key)),"directed"!==e&&o(r.undirected,i);}function Et(t,e,n,r,i){var o,a=t?st:dt;if("undirected"!==e){if("out"!==n&&(o=a(r.in,i)))return o;if("in"!==n&&(o=a(r.out,i,n?null:r.key)))return o}if("directed"!==e&&(o=a(r.undirected,i)))return o}function St(t,e,n){var r=O.empty();return "undirected"!==t&&("out"!==e&&void 0!==n.in&&(r=rt(r,ht(n.in))),"in"!==e&&void 0!==n.out&&(r=rt(r,ht(n.out,e?null:n.key)))),"directed"!==t&&void 0!==n.undirected&&(r=rt(r,ht(n.undirected))),r}function At(t,e,n,r,i){var o=e?pt:ft,a=[];return "undirected"!==t&&(void 0!==r.in&&"out"!==n&&o(a,r.in,i),void 0!==r.out&&"in"!==n&&o(a,r.out,i),!n&&r.directedSelfLoops>0&&a.splice(a.lastIndexOf(r.key),1)),"directed"!==t&&void 0!==r.undirected&&o(a,r.undirected,i),a}function Lt(t,e,n,r,i,o){var a=e?gt:lt;"undirected"!==t&&(void 0!==r.in&&"out"!==n&&a(r.in,i,o),r.key!==i&&void 0!==r.out&&"in"!==n&&a(r.out,i,o)),"directed"!==t&&void 0!==r.undirected&&a(r.undirected,i,o);}function Dt(t,e,n,r,i,o){var a,u=e?vt:yt;if("undirected"!==t){if(void 0!==r.in&&"out"!==n&&(a=u(r.in,i,o)))return a;if(r.key!==i&&void 0!==r.out&&"in"!==n&&(a=u(r.out,i,o,n?null:r.key)))return a}if("directed"!==t&&void 0!==r.undirected&&(a=u(r.undirected,i,o)))return a}function Nt(t,e,n,r){var i=O.empty();return "undirected"!==t&&(void 0!==n.in&&"out"!==e&&r in n.in&&(i=rt(i,bt(n.in,r))),void 0!==n.out&&"in"!==e&&r in n.out&&(i=rt(i,bt(n.out,r)))),"directed"!==t&&void 0!==n.undirected&&r in n.undirected&&(i=rt(i,bt(n.undirected,r))),i}var Ut=[{name:"neighbors",type:"mixed"},{name:"inNeighbors",type:"directed",direction:"in"},{name:"outNeighbors",type:"directed",direction:"out"},{name:"inboundNeighbors",type:"mixed",direction:"in"},{name:"outboundNeighbors",type:"mixed",direction:"out"},{name:"directedNeighbors",type:"directed"},{name:"undirectedNeighbors",type:"undirected"}];function jt(t,e){if(void 0!==e)for(var n in e)t.add(n);}function Ot(t,e,n){for(var r in e){var i=e[r];i instanceof Set&&(i=i.values().next().value);var o=i.source,a=i.target,u=o===t?a:o;n(u.key,u.attributes);}}function Ct(t,e,n,r){for(var i in n){var o=n[i];o instanceof Set&&(o=o.values().next().value);var a=o.source,u=o.target,c=a===e?u:a;t.has(c.key)||(t.add(c.key),r(c.key,c.attributes));}}function zt(t,e,n){for(var r in e){var i=e[r];i instanceof Set&&(i=i.values().next().value);var o=i.source,a=i.target,u=o===t?a:o;if(n(u.key,u.attributes))return u.key}}function Mt(t,e,n,r){for(var i in n){var o=n[i];o instanceof Set&&(o=o.values().next().value);var a=o.source,u=o.target,c=a===e?u:a;if(!t.has(c.key))if(t.add(c.key),r(c.key,c.attributes))return c.key}}function Pt(t,e){var n=Object.keys(e),r=n.length,i=0;return new O((function(){if(i>=r)return {done:!0};var o=e[n[i++]];o instanceof Set&&(o=o.values().next().value);var a=o.source,u=o.target,c=a===t?u:a;return {done:!1,value:{neighbor:c.key,attributes:c.attributes}}}))}function Tt(t,e,n){var r=Object.keys(n),i=r.length,o=0;return new O((function a(){if(o>=i)return {done:!0};var u=n[r[o++]];u instanceof Set&&(u=u.values().next().value);var c=u.source,d=u.target,s=c===e?d:c;return t.has(s.key)?a():(t.add(s.key),{done:!1,value:{neighbor:s.key,attributes:s.attributes}})}))}function Rt(t,e){var n=e.name,r=e.type,i=e.direction;t.prototype[n]=function(t){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return [];t=""+t;var e=this._nodes.get(t);if(void 0===e)throw new Y("Graph.".concat(n,': could not find the "').concat(t,'" node in the graph.'));return function(t,e,n){if("mixed"!==t){if("undirected"===t)return Object.keys(n.undirected);if("string"==typeof e)return Object.keys(n[e])}var r=new Set;return "undirected"!==t&&("out"!==e&&jt(r,n.in),"in"!==e&&jt(r,n.out)),"directed"!==t&&jt(r,n.undirected),K(r.values(),r.size)}("mixed"===r?this.type:r,i,e)};}function Wt(t,e){var n=e.name,r=e.type,i=e.direction,o="forEach"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[o]=function(t,e){if("mixed"===r||"mixed"===this.type||r===this.type){t=""+t;var n=this._nodes.get(t);if(void 0===n)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));!function(t,e,n,r){if("mixed"!==t){if("undirected"===t)return Ot(n,n.undirected,r);if("string"==typeof e)return Ot(n,n[e],r)}var i=new Set;"undirected"!==t&&("out"!==e&&Ct(i,n,n.in,r),"in"!==e&&Ct(i,n,n.out,r)),"directed"!==t&&Ct(i,n,n.undirected,r);}("mixed"===r?this.type:r,i,n,e);}};var a="map"+n[0].toUpperCase()+n.slice(1);t.prototype[a]=function(t,e){var n=[];return this[o](t,(function(t,r){n.push(e(t,r));})),n};var u="filter"+n[0].toUpperCase()+n.slice(1);t.prototype[u]=function(t,e){var n=[];return this[o](t,(function(t,r){e(t,r)&&n.push(t);})),n};var c="reduce"+n[0].toUpperCase()+n.slice(1);t.prototype[c]=function(t,e,n){if(arguments.length<3)throw new F("Graph.".concat(c,": missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array."));var r=n;return this[o](t,(function(t,n){r=e(r,t,n);})),r};}function Kt(t,e){var n=e.name,r=e.type,i=e.direction,o=n[0].toUpperCase()+n.slice(1,-1),a="find"+o;t.prototype[a]=function(t,e){if("mixed"===r||"mixed"===this.type||r===this.type){t=""+t;var n=this._nodes.get(t);if(void 0===n)throw new Y("Graph.".concat(a,': could not find the "').concat(t,'" node in the graph.'));return function(t,e,n,r){if("mixed"!==t){if("undirected"===t)return zt(n,n.undirected,r);if("string"==typeof e)return zt(n,n[e],r)}var i,o=new Set;if("undirected"!==t){if("out"!==e&&(i=Mt(o,n,n.in,r)))return i;if("in"!==e&&(i=Mt(o,n,n.out,r)))return i}if("directed"!==t&&(i=Mt(o,n,n.undirected,r)))return i}("mixed"===r?this.type:r,i,n,e)}};var u="some"+o;t.prototype[u]=function(t,e){return !!this[a](t,e)};var c="every"+o;t.prototype[c]=function(t,e){return !this[a](t,(function(t,n){return !e(t,n)}))};}function It(t,e){var n=e.name,r=e.type,i=e.direction,o=n.slice(0,-1)+"Entries";t.prototype[o]=function(t){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return O.empty();t=""+t;var e=this._nodes.get(t);if(void 0===e)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));return function(t,e,n){if("mixed"!==t){if("undirected"===t)return Pt(n,n.undirected);if("string"==typeof e)return Pt(n,n[e])}var r=O.empty(),i=new Set;return "undirected"!==t&&("out"!==e&&(r=rt(r,Tt(i,n,n.in))),"in"!==e&&(r=rt(r,Tt(i,n,n.out)))),"directed"!==t&&(r=rt(r,Tt(i,n,n.undirected))),r}("mixed"===r?this.type:r,i,e)};}function Ft(t,e,n,r,i){for(var o,a,u,c,d,s,h,f=r._nodes.values(),p=r.type;!0!==(o=f.next()).done;){var l=!1;if(a=o.value,"undirected"!==p)for(u in c=a.out)if(s=(d=c[u]).target,l=!0,h=i(a.key,s.key,a.attributes,s.attributes,d.key,d.attributes,d.undirected),t&&h)return d;if("directed"!==p)for(u in c=a.undirected)if(!(e&&a.key>u)&&((s=(d=c[u]).target).key!==u&&(s=d.source),l=!0,h=i(a.key,s.key,a.attributes,s.attributes,d.key,d.attributes,d.undirected),t&&h))return d;if(n&&!l&&(h=i(a.key,null,a.attributes,null,null,null,null),t&&h))return null}}function Yt(t,e,n,r,i){for(var o,a,u,c,d,s,h,f,p,l=r._nodes.values(),g=r.type;!0!==(o=l.next()).done;){var y=!1;if(a=o.value,"undirected"!==g)for(u in s=a.out)for(c=s[u].values();!0!==(d=c.next()).done;)if(f=(h=d.value).target,y=!0,p=i(a.key,f.key,a.attributes,f.attributes,h.key,h.attributes,h.undirected),t&&p)return h;if("directed"!==g)for(u in s=a.undirected)if(!(e&&a.key>u))for(c=s[u].values();!0!==(d=c.next()).done;)if((f=(h=d.value).target).key!==u&&(f=h.source),y=!0,p=i(a.key,f.key,a.attributes,f.attributes,h.key,h.attributes,h.undirected),t&&p)return h;if(n&&!y&&(p=i(a.key,null,a.attributes,null,null,null,null),t&&p))return null}}function Bt(t,e){var n={key:t};return f(e.attributes)||(n.attributes=c({},e.attributes)),n}function qt(t,e){var n={key:t,source:e.source.key,target:e.target.key};return f(e.attributes)||(n.attributes=c({},e.attributes)),e.undirected&&(n.undirected=!0),n}function Jt(t){return h(t)?"key"in t?!("attributes"in t)||h(t.attributes)&&null!==t.attributes?null:"invalid-attributes":"no-key":"not-object"}function Vt(t){return h(t)?"source"in t?"target"in t?!("attributes"in t)||h(t.attributes)&&null!==t.attributes?"undirected"in t&&"boolean"!=typeof t.undirected?"invalid-undirected":null:"invalid-attributes":"no-target":"no-source":"not-object"}var Ht,Qt=(Ht=255&Math.floor(256*Math.random()),function(){return Ht++}),Xt=new Set(["directed","undirected","mixed"]),Zt=new Set(["domain","_events","_eventsCount","_maxListeners"]),$t={allowSelfLoops:!0,multi:!1,type:"mixed"};function te(t,e,n){var r=new t.NodeDataClass(e,n);return t._nodes.set(e,r),t.emit("nodeAdded",{key:e,attributes:n}),r}function ee(t,e,n,r,i,o,a,u){if(!r&&"undirected"===t.type)throw new B("Graph.".concat(e,": you cannot add a directed edge to an undirected graph. Use the #.addEdge or #.addUndirectedEdge instead."));if(r&&"directed"===t.type)throw new B("Graph.".concat(e,": you cannot add an undirected edge to a directed graph. Use the #.addEdge or #.addDirectedEdge instead."));if(u&&!h(u))throw new F("Graph.".concat(e,': invalid attributes. Expecting an object but got "').concat(u,'"'));if(o=""+o,a=""+a,u=u||{},!t.allowSelfLoops&&o===a)throw new B("Graph.".concat(e,': source & target are the same ("').concat(o,"\"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false."));var c=t._nodes.get(o),d=t._nodes.get(a);if(!c)throw new Y("Graph.".concat(e,': source node "').concat(o,'" not found.'));if(!d)throw new Y("Graph.".concat(e,': target node "').concat(a,'" not found.'));var s={key:null,undirected:r,source:o,target:a,attributes:u};if(n)i=t._edgeKeyGenerator();else if(i=""+i,t._edges.has(i))throw new B("Graph.".concat(e,': the "').concat(i,'" edge already exists in the graph.'));if(!t.multi&&(r?void 0!==c.undirected[a]:void 0!==c.out[a]))throw new B("Graph.".concat(e,': an edge linking "').concat(o,'" to "').concat(a,"\" already exists. If you really want to add multiple edges linking those nodes, you should create a multi graph by using the 'multi' option."));var f=new H(r,i,c,d,u);return t._edges.set(i,f),o===a?r?(c.undirectedSelfLoops++,t._undirectedSelfLoopCount++):(c.directedSelfLoops++,t._directedSelfLoopCount++):r?(c.undirectedDegree++,d.undirectedDegree++):(c.outDegree++,d.inDegree++),Q(t,r,f,o,a,c,d),r?t._undirectedSize++:t._directedSize++,s.key=i,t.emit("edgeAdded",s),i}function ne(t,e,n,r,i,o,a,u,d){if(!r&&"undirected"===t.type)throw new B("Graph.".concat(e,": you cannot merge/update a directed edge to an undirected graph. Use the #.mergeEdge/#.updateEdge or #.addUndirectedEdge instead."));if(r&&"directed"===t.type)throw new B("Graph.".concat(e,": you cannot merge/update an undirected edge to a directed graph. Use the #.mergeEdge/#.updateEdge or #.addDirectedEdge instead."));if(u)if(d){if("function"!=typeof u)throw new F("Graph.".concat(e,': invalid updater function. Expecting a function but got "').concat(u,'"'))}else if(!h(u))throw new F("Graph.".concat(e,': invalid attributes. Expecting an object but got "').concat(u,'"'));var s;if(o=""+o,a=""+a,d&&(s=u,u=void 0),!t.allowSelfLoops&&o===a)throw new B("Graph.".concat(e,': source & target are the same ("').concat(o,"\"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false."));var f,p,l=t._nodes.get(o),g=t._nodes.get(a);if(!n&&(f=t._edges.get(i))){if(f.source.key!==o||f.target.key!==a||r&&(f.source.key!==a||f.target.key!==o))throw new B("Graph.".concat(e,': inconsistency detected when attempting to merge the "').concat(i,'" edge with "').concat(o,'" source & "').concat(a,'" target vs. ("').concat(f.source.key,'", "').concat(f.target.key,'").'));p=f;}if(p||t.multi||!l||(p=r?l.undirected[a]:l.out[a]),p){var y=[p.key,!1,!1,!1];if(d?!s:!u)return y;if(d){var v=p.attributes;p.attributes=s(v),t.emit("edgeAttributesUpdated",{type:"replace",key:p.key,attributes:p.attributes});}else c(p.attributes,u),t.emit("edgeAttributesUpdated",{type:"merge",key:p.key,attributes:p.attributes,data:u});return y}u=u||{},d&&s&&(u=s(u));var b={key:null,undirected:r,source:o,target:a,attributes:u};if(n)i=t._edgeKeyGenerator();else if(i=""+i,t._edges.has(i))throw new B("Graph.".concat(e,': the "').concat(i,'" edge already exists in the graph.'));var w=!1,m=!1;return l||(l=te(t,o,{}),w=!0,o===a&&(g=l,m=!0)),g||(g=te(t,a,{}),m=!0),f=new H(r,i,l,g,u),t._edges.set(i,f),o===a?r?(l.undirectedSelfLoops++,t._undirectedSelfLoopCount++):(l.directedSelfLoops++,t._directedSelfLoopCount++):r?(l.undirectedDegree++,g.undirectedDegree++):(l.outDegree++,g.inDegree++),Q(t,r,f,o,a,l,g),r?t._undirectedSize++:t._directedSize++,b.key=i,t.emit("edgeAdded",b),[i,!0,w,m]}var re=function(n){function r(t){var e;if(e=n.call(this)||this,"boolean"!=typeof(t=c({},$t,t)).multi)throw new F("Graph.constructor: invalid 'multi' option. Expecting a boolean but got \"".concat(t.multi,'".'));if(!Xt.has(t.type))throw new F('Graph.constructor: invalid \'type\' option. Should be one of "mixed", "directed" or "undirected" but got "'.concat(t.type,'".'));if("boolean"!=typeof t.allowSelfLoops)throw new F("Graph.constructor: invalid 'allowSelfLoops' option. Expecting a boolean but got \"".concat(t.allowSelfLoops,'".'));var r="mixed"===t.type?q:"directed"===t.type?J:V;p(u(e),"NodeDataClass",r);var i=Qt(),o=0;return p(u(e),"_attributes",{}),p(u(e),"_nodes",new Map),p(u(e),"_edges",new Map),p(u(e),"_directedSize",0),p(u(e),"_undirectedSize",0),p(u(e),"_directedSelfLoopCount",0),p(u(e),"_undirectedSelfLoopCount",0),p(u(e),"_edgeKeyGenerator",(function(){var t;do{t="geid_"+i+"_"+o++;}while(e._edges.has(t));return t})),p(u(e),"_options",t),Zt.forEach((function(t){return p(u(e),t,e[t])})),l(u(e),"order",(function(){return e._nodes.size})),l(u(e),"size",(function(){return e._edges.size})),l(u(e),"directedSize",(function(){return e._directedSize})),l(u(e),"undirectedSize",(function(){return e._undirectedSize})),l(u(e),"selfLoopCount",(function(){return e._directedSelfLoopCount+e._undirectedSelfLoopCount})),l(u(e),"directedSelfLoopCount",(function(){return e._directedSelfLoopCount})),l(u(e),"undirectedSelfLoopCount",(function(){return e._undirectedSelfLoopCount})),l(u(e),"multi",e._options.multi),l(u(e),"type",e._options.type),l(u(e),"allowSelfLoops",e._options.allowSelfLoops),l(u(e),"implementation",(function(){return "graphology"})),e}e(r,n);var i=r.prototype;return i._resetInstanceCounters=function(){this._directedSize=0,this._undirectedSize=0,this._directedSelfLoopCount=0,this._undirectedSelfLoopCount=0;},i.hasNode=function(t){return this._nodes.has(""+t)},i.hasDirectedEdge=function(t,e){if("undirected"===this.type)return !1;if(1===arguments.length){var n=""+t,r=this._edges.get(n);return !!r&&!r.undirected}if(2===arguments.length){t=""+t,e=""+e;var i=this._nodes.get(t);if(!i)return !1;var o=i.out[e];return !!o&&(!this.multi||!!o.size)}throw new F("Graph.hasDirectedEdge: invalid arity (".concat(arguments.length,", instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target."))},i.hasUndirectedEdge=function(t,e){if("directed"===this.type)return !1;if(1===arguments.length){var n=""+t,r=this._edges.get(n);return !!r&&r.undirected}if(2===arguments.length){t=""+t,e=""+e;var i=this._nodes.get(t);if(!i)return !1;var o=i.undirected[e];return !!o&&(!this.multi||!!o.size)}throw new F("Graph.hasDirectedEdge: invalid arity (".concat(arguments.length,", instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target."))},i.hasEdge=function(t,e){if(1===arguments.length){var n=""+t;return this._edges.has(n)}if(2===arguments.length){t=""+t,e=""+e;var r=this._nodes.get(t);if(!r)return !1;var i=void 0!==r.out&&r.out[e];return i||(i=void 0!==r.undirected&&r.undirected[e]),!!i&&(!this.multi||!!i.size)}throw new F("Graph.hasEdge: invalid arity (".concat(arguments.length,", instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target."))},i.directedEdge=function(t,e){if("undirected"!==this.type){if(t=""+t,e=""+e,this.multi)throw new B("Graph.directedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.directedEdges instead.");var n=this._nodes.get(t);if(!n)throw new Y('Graph.directedEdge: could not find the "'.concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y('Graph.directedEdge: could not find the "'.concat(e,'" target node in the graph.'));var r=n.out&&n.out[e]||void 0;return r?r.key:void 0}},i.undirectedEdge=function(t,e){if("directed"!==this.type){if(t=""+t,e=""+e,this.multi)throw new B("Graph.undirectedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.undirectedEdges instead.");var n=this._nodes.get(t);if(!n)throw new Y('Graph.undirectedEdge: could not find the "'.concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y('Graph.undirectedEdge: could not find the "'.concat(e,'" target node in the graph.'));var r=n.undirected&&n.undirected[e]||void 0;return r?r.key:void 0}},i.edge=function(t,e){if(this.multi)throw new B("Graph.edge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.edges instead.");t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.edge: could not find the "'.concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y('Graph.edge: could not find the "'.concat(e,'" target node in the graph.'));var r=n.out&&n.out[e]||n.undirected&&n.undirected[e]||void 0;if(r)return r.key},i.areDirectedNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areDirectedNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&(e in n.in||e in n.out)},i.areOutNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areOutNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&e in n.out},i.areInNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areInNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&e in n.in},i.areUndirectedNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areUndirectedNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "directed"!==this.type&&e in n.undirected},i.areNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&(e in n.in||e in n.out)||"directed"!==this.type&&e in n.undirected},i.areInboundNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areInboundNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&e in n.in||"directed"!==this.type&&e in n.undirected},i.areOutboundNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areOutboundNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&e in n.out||"directed"!==this.type&&e in n.undirected},i.inDegree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.inDegree: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.inDegree+e.directedSelfLoops},i.outDegree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.outDegree: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.outDegree+e.directedSelfLoops},i.directedDegree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.directedDegree: could not find the "'.concat(t,'" node in the graph.'));if("undirected"===this.type)return 0;var n=e.directedSelfLoops;return e.inDegree+n+(e.outDegree+n)},i.undirectedDegree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.undirectedDegree: could not find the "'.concat(t,'" node in the graph.'));if("directed"===this.type)return 0;var n=e.undirectedSelfLoops;return e.undirectedDegree+2*n},i.degree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.degree: could not find the "'.concat(t,'" node in the graph.'));var n=0;return "directed"!==this.type&&(n+=e.undirectedDegree+2*e.undirectedSelfLoops),"undirected"!==this.type&&(n+=e.inDegree+e.outDegree+2*e.directedSelfLoops),n},i.inDegreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.inDegreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.inDegree},i.outDegreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.outDegreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.outDegree},i.directedDegreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.directedDegreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.inDegree+e.outDegree},i.undirectedDegreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.undirectedDegreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));return "directed"===this.type?0:e.undirectedDegree},i.degreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.degreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));var n=0;return "directed"!==this.type&&(n+=e.undirectedDegree),"undirected"!==this.type&&(n+=e.inDegree+e.outDegree),n},i.source=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.source: could not find the "'.concat(t,'" edge in the graph.'));return e.source.key},i.target=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.target: could not find the "'.concat(t,'" edge in the graph.'));return e.target.key},i.extremities=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.extremities: could not find the "'.concat(t,'" edge in the graph.'));return [e.source.key,e.target.key]},i.opposite=function(t,e){t=""+t,e=""+e;var n=this._edges.get(e);if(!n)throw new Y('Graph.opposite: could not find the "'.concat(e,'" edge in the graph.'));var r=n.source.key,i=n.target.key;if(t===r)return i;if(t===i)return r;throw new Y('Graph.opposite: the "'.concat(t,'" node is not attached to the "').concat(e,'" edge (').concat(r,", ").concat(i,")."))},i.hasExtremity=function(t,e){t=""+t,e=""+e;var n=this._edges.get(t);if(!n)throw new Y('Graph.hasExtremity: could not find the "'.concat(t,'" edge in the graph.'));return n.source.key===e||n.target.key===e},i.isUndirected=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.isUndirected: could not find the "'.concat(t,'" edge in the graph.'));return e.undirected},i.isDirected=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.isDirected: could not find the "'.concat(t,'" edge in the graph.'));return !e.undirected},i.isSelfLoop=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.isSelfLoop: could not find the "'.concat(t,'" edge in the graph.'));return e.source===e.target},i.addNode=function(t,e){var n=function(t,e,n){if(n&&!h(n))throw new F('Graph.addNode: invalid attributes. Expecting an object but got "'.concat(n,'"'));if(e=""+e,n=n||{},t._nodes.has(e))throw new B('Graph.addNode: the "'.concat(e,'" node already exist in the graph.'));var r=new t.NodeDataClass(e,n);return t._nodes.set(e,r),t.emit("nodeAdded",{key:e,attributes:n}),r}(this,t,e);return n.key},i.mergeNode=function(t,e){if(e&&!h(e))throw new F('Graph.mergeNode: invalid attributes. Expecting an object but got "'.concat(e,'"'));t=""+t,e=e||{};var n=this._nodes.get(t);return n?(e&&(c(n.attributes,e),this.emit("nodeAttributesUpdated",{type:"merge",key:t,attributes:n.attributes,data:e})),[t,!1]):(n=new this.NodeDataClass(t,e),this._nodes.set(t,n),this.emit("nodeAdded",{key:t,attributes:e}),[t,!0])},i.updateNode=function(t,e){if(e&&"function"!=typeof e)throw new F('Graph.updateNode: invalid updater function. Expecting a function but got "'.concat(e,'"'));t=""+t;var n=this._nodes.get(t);if(n){if(e){var r=n.attributes;n.attributes=e(r),this.emit("nodeAttributesUpdated",{type:"replace",key:t,attributes:n.attributes});}return [t,!1]}var i=e?e({}):{};return n=new this.NodeDataClass(t,i),this._nodes.set(t,n),this.emit("nodeAdded",{key:t,attributes:i}),[t,!0]},i.dropNode=function(t){var e=this;t=""+t;var n=this._nodes.get(t);if(!n)throw new Y('Graph.dropNode: could not find the "'.concat(t,'" node in the graph.'));this.forEachEdge(t,(function(t){e.dropEdge(t);})),this._nodes.delete(t),this.emit("nodeDropped",{key:t,attributes:n.attributes});},i.dropEdge=function(t){var e;if(arguments.length>1){var n=""+arguments[0],r=""+arguments[1];if(!(e=d(this,n,r,this.type)))throw new Y('Graph.dropEdge: could not find the "'.concat(n,'" -> "').concat(r,'" edge in the graph.'))}else if(t=""+t,!(e=this._edges.get(t)))throw new Y('Graph.dropEdge: could not find the "'.concat(t,'" edge in the graph.'));this._edges.delete(e.key);var i=e,o=i.source,a=i.target,u=i.attributes,c=e.undirected;return o===a?c?(o.undirectedSelfLoops--,this._undirectedSelfLoopCount--):(o.directedSelfLoops--,this._directedSelfLoopCount--):c?(o.undirectedDegree--,a.undirectedDegree--):(o.outDegree--,a.inDegree--),X(this,c,e),c?this._undirectedSize--:this._directedSize--,this.emit("edgeDropped",{key:t,attributes:u,source:o.key,target:a.key,undirected:c}),this},i.clear=function(){this._edges.clear(),this._nodes.clear(),this._resetInstanceCounters(),this.emit("cleared");},i.clearEdges=function(){!function(t){for(var e,n=t._nodes.values();!0!==(e=n.next()).done;)e.value.clear();}(this),this._edges.clear(),this._resetInstanceCounters(),this.emit("edgesCleared");},i.getAttribute=function(t){return this._attributes[t]},i.getAttributes=function(){return this._attributes},i.hasAttribute=function(t){return this._attributes.hasOwnProperty(t)},i.setAttribute=function(t,e){return this._attributes[t]=e,this.emit("attributesUpdated",{type:"set",attributes:this._attributes,name:t}),this},i.updateAttribute=function(t,e){if("function"!=typeof e)throw new F("Graph.updateAttribute: updater should be a function.");var n=this._attributes[t];return this._attributes[t]=e(n),this.emit("attributesUpdated",{type:"set",attributes:this._attributes,name:t}),this},i.removeAttribute=function(t){return delete this._attributes[t],this.emit("attributesUpdated",{type:"remove",attributes:this._attributes,name:t}),this},i.replaceAttributes=function(t){if(!h(t))throw new F("Graph.replaceAttributes: provided attributes are not a plain object.");return this._attributes=t,this.emit("attributesUpdated",{type:"replace",attributes:this._attributes}),this},i.mergeAttributes=function(t){if(!h(t))throw new F("Graph.mergeAttributes: provided attributes are not a plain object.");return c(this._attributes,t),this.emit("attributesUpdated",{type:"merge",attributes:this._attributes,data:t}),this},i.updateAttributes=function(t){if("function"!=typeof t)throw new F("Graph.updateAttributes: provided updater is not a function.");return this._attributes=t(this._attributes),this.emit("attributesUpdated",{type:"update",attributes:this._attributes}),this},i.updateEachNodeAttributes=function(t,e){if("function"!=typeof t)throw new F("Graph.updateEachNodeAttributes: expecting an updater function.");if(e&&!g(e))throw new F("Graph.updateEachNodeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}");for(var n,r,i=this._nodes.values();!0!==(n=i.next()).done;)(r=n.value).attributes=t(r.key,r.attributes);this.emit("eachNodeAttributesUpdated",{hints:e||null});},i.updateEachEdgeAttributes=function(t,e){if("function"!=typeof t)throw new F("Graph.updateEachEdgeAttributes: expecting an updater function.");if(e&&!g(e))throw new F("Graph.updateEachEdgeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}");for(var n,r,i,o,a=this._edges.values();!0!==(n=a.next()).done;)i=(r=n.value).source,o=r.target,r.attributes=t(r.key,r.attributes,i.key,o.key,i.attributes,o.attributes,r.undirected);this.emit("eachEdgeAttributesUpdated",{hints:e||null});},i.forEachAdjacencyEntry=function(t){if("function"!=typeof t)throw new F("Graph.forEachAdjacencyEntry: expecting a callback.");this.multi?Yt(!1,!1,!1,this,t):Ft(!1,!1,!1,this,t);},i.forEachAdjacencyEntryWithOrphans=function(t){if("function"!=typeof t)throw new F("Graph.forEachAdjacencyEntryWithOrphans: expecting a callback.");this.multi?Yt(!1,!1,!0,this,t):Ft(!1,!1,!0,this,t);},i.forEachAssymetricAdjacencyEntry=function(t){if("function"!=typeof t)throw new F("Graph.forEachAssymetricAdjacencyEntry: expecting a callback.");this.multi?Yt(!1,!0,!1,this,t):Ft(!1,!0,!1,this,t);},i.forEachAssymetricAdjacencyEntryWithOrphans=function(t){if("function"!=typeof t)throw new F("Graph.forEachAssymetricAdjacencyEntryWithOrphans: expecting a callback.");this.multi?Yt(!1,!0,!0,this,t):Ft(!1,!0,!0,this,t);},i.nodes=function(){return "function"==typeof Array.from?Array.from(this._nodes.keys()):K(this._nodes.keys(),this._nodes.size)},i.forEachNode=function(t){if("function"!=typeof t)throw new F("Graph.forEachNode: expecting a callback.");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)t((n=e.value).key,n.attributes);},i.findNode=function(t){if("function"!=typeof t)throw new F("Graph.findNode: expecting a callback.");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)if(t((n=e.value).key,n.attributes))return n.key},i.mapNodes=function(t){if("function"!=typeof t)throw new F("Graph.mapNode: expecting a callback.");for(var e,n,r=this._nodes.values(),i=new Array(this.order),o=0;!0!==(e=r.next()).done;)n=e.value,i[o++]=t(n.key,n.attributes);return i},i.someNode=function(t){if("function"!=typeof t)throw new F("Graph.someNode: expecting a callback.");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)if(t((n=e.value).key,n.attributes))return !0;return !1},i.everyNode=function(t){if("function"!=typeof t)throw new F("Graph.everyNode: expecting a callback.");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)if(!t((n=e.value).key,n.attributes))return !1;return !0},i.filterNodes=function(t){if("function"!=typeof t)throw new F("Graph.filterNodes: expecting a callback.");for(var e,n,r=this._nodes.values(),i=[];!0!==(e=r.next()).done;)t((n=e.value).key,n.attributes)&&i.push(n.key);return i},i.reduceNodes=function(t,e){if("function"!=typeof t)throw new F("Graph.reduceNodes: expecting a callback.");if(arguments.length<2)throw new F("Graph.reduceNodes: missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.");for(var n,r,i=e,o=this._nodes.values();!0!==(n=o.next()).done;)i=t(i,(r=n.value).key,r.attributes);return i},i.nodeEntries=function(){var t=this._nodes.values();return new O((function(){var e=t.next();if(e.done)return e;var n=e.value;return {value:{node:n.key,attributes:n.attributes},done:!1}}))},i.exportNode=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.exportNode: could not find the "'.concat(t,'" node in the graph.'));return Bt(t,e)},i.exportEdge=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.exportEdge: could not find the "'.concat(t,'" edge in the graph.'));return qt(t,e)},i.export=function(){var t=new Array(this._nodes.size),e=0;this._nodes.forEach((function(n,r){t[e++]=Bt(r,n);}));var n=new Array(this._edges.size);return e=0,this._edges.forEach((function(t,r){n[e++]=qt(r,t);})),{attributes:this.getAttributes(),nodes:t,edges:n,options:{type:this.type,multi:this.multi,allowSelfLoops:this.allowSelfLoops}}},i.importNode=function(t){var e=arguments.length>1&&void 0!==arguments[1]&&arguments[1],n=Jt(t);if(n){if("not-object"===n)throw new F('Graph.importNode: invalid serialized node. A serialized node should be a plain object with at least a "key" property.');if("no-key"===n)throw new F("Graph.importNode: no key provided.");if("invalid-attributes"===n)throw new F("Graph.importNode: invalid attributes. Attributes should be a plain object, null or omitted.")}var r=t.key,i=t.attributes,o=void 0===i?{}:i;return e?this.mergeNode(r,o):this.addNode(r,o),this},i.importEdge=function(t){var e=arguments.length>1&&void 0!==arguments[1]&&arguments[1],n=Vt(t);if(n){if("not-object"===n)throw new F('Graph.importEdge: invalid serialized edge. A serialized edge should be a plain object with at least a "source" & "target" property.');if("no-source"===n)throw new F("Graph.importEdge: missing souce.");if("no-target"===n)throw new F("Graph.importEdge: missing target.");if("invalid-attributes"===n)throw new F("Graph.importEdge: invalid attributes. Attributes should be a plain object, null or omitted.");if("invalid-undirected"===n)throw new F("Graph.importEdge: invalid undirected. Undirected should be boolean or omitted.")}var r=t.source,i=t.target,o=t.attributes,a=void 0===o?{}:o,u=t.undirected,c=void 0!==u&&u;return "key"in t?(e?c?this.mergeUndirectedEdgeWithKey:this.mergeDirectedEdgeWithKey:c?this.addUndirectedEdgeWithKey:this.addDirectedEdgeWithKey).call(this,t.key,r,i,a):(e?c?this.mergeUndirectedEdge:this.mergeDirectedEdge:c?this.addUndirectedEdge:this.addDirectedEdge).call(this,r,i,a),this},i.import=function(t){var e,n,r,i=arguments.length>1&&void 0!==arguments[1]&&arguments[1];if(s(t))return this.import(t.export(),i),this;if(!h(t))throw new F("Graph.import: invalid argument. Expecting a serialized graph or, alternatively, a Graph instance.");if(t.attributes){if(!h(t.attributes))throw new F("Graph.import: invalid attributes. Expecting a plain object.");i?this.mergeAttributes(t.attributes):this.replaceAttributes(t.attributes);}if(t.nodes){if(r=t.nodes,!Array.isArray(r))throw new F("Graph.import: invalid nodes. Expecting an array.");for(e=0,n=r.length;e<n;e++)this.importNode(r[e],i);}if(t.edges){if(r=t.edges,!Array.isArray(r))throw new F("Graph.import: invalid edges. Expecting an array.");for(e=0,n=r.length;e<n;e++)this.importEdge(r[e],i);}return this},i.nullCopy=function(t){var e=new r(c({},this._options,t));return e.replaceAttributes(c({},this.getAttributes())),e},i.emptyCopy=function(t){var e=this.nullCopy(t);return this._nodes.forEach((function(t,n){var r=c({},t.attributes);t=new e.NodeDataClass(n,r),e._nodes.set(n,t);})),e},i.copy=function(){for(var t,e,n=this.emptyCopy(),r=this._edges.values();!0!==(t=r.next()).done;)ee(n,"copy",!1,(e=t.value).undirected,e.key,e.source.key,e.target.key,c({},e.attributes));return n},i.upgradeToMixed=function(){return "mixed"===this.type||(this._nodes.forEach((function(t){return t.upgradeToMixed()})),this._options.type="mixed",l(this,"type",this._options.type),p(this,"NodeDataClass",q)),this},i.upgradeToMulti=function(){return this.multi||(this._options.multi=!0,l(this,"multi",!0),(t=this)._nodes.forEach((function(e,n){if(e.out)for(var r in e.out){var i=new Set;i.add(e.out[r]),e.out[r]=i,t._nodes.get(r).in[n]=i;}if(e.undirected)for(var o in e.undirected)if(!(o>n)){var a=new Set;a.add(e.undirected[o]),e.undirected[o]=a,t._nodes.get(o).undirected[n]=a;}}))),this;var t;},i.toJSON=function(){return this.export()},i.toString=function(){return "[object Graph]"},i.inspect=function(){var e=this,n={};this._nodes.forEach((function(t,e){n[e]=t.attributes;}));var r={},i={};this._edges.forEach((function(t,n){var o,a=t.undirected?"--":"->",u="",c=t.source.key,d=t.target.key;t.undirected&&c>d&&(o=c,c=d,d=o);var s="(".concat(c,")").concat(a,"(").concat(d,")");n.startsWith("geid_")?e.multi&&(void 0===i[s]?i[s]=0:i[s]++,u+="".concat(i[s],". ")):u+="[".concat(n,"]: "),r[u+=s]=t.attributes;}));var o={};for(var a in this)this.hasOwnProperty(a)&&!Zt.has(a)&&"function"!=typeof this[a]&&"symbol"!==t(a)&&(o[a]=this[a]);return o.attributes=this._attributes,o.nodes=n,o.edges=r,p(o,"constructor",this.constructor),o},r}(v.exports.EventEmitter);"undefined"!=typeof Symbol&&(re.prototype[Symbol.for("nodejs.util.inspect.custom")]=re.prototype.inspect),[{name:function(t){return "".concat(t,"Edge")},generateKey:!0},{name:function(t){return "".concat(t,"DirectedEdge")},generateKey:!0,type:"directed"},{name:function(t){return "".concat(t,"UndirectedEdge")},generateKey:!0,type:"undirected"},{name:function(t){return "".concat(t,"EdgeWithKey")}},{name:function(t){return "".concat(t,"DirectedEdgeWithKey")},type:"directed"},{name:function(t){return "".concat(t,"UndirectedEdgeWithKey")},type:"undirected"}].forEach((function(t){["add","merge","update"].forEach((function(e){var n=t.name(e),r="add"===e?ee:ne;t.generateKey?re.prototype[n]=function(i,o,a){return r(this,n,!0,"undirected"===(t.type||this.type),null,i,o,a,"update"===e)}:re.prototype[n]=function(i,o,a,u){return r(this,n,!1,"undirected"===(t.type||this.type),i,o,a,u,"update"===e)};}));})),function(t){$.forEach((function(e){var n=e.name,r=e.attacher;r(t,n("Node"),0),r(t,n("Source"),1),r(t,n("Target"),2),r(t,n("Opposite"),3);}));}(re),function(t){tt.forEach((function(e){var n=e.name,r=e.attacher;r(t,n("Edge"),"mixed"),r(t,n("DirectedEdge"),"directed"),r(t,n("UndirectedEdge"),"undirected");}));}(re),function(t){it.forEach((function(e){!function(t,e){var n=e.name,r=e.type,i=e.direction;t.prototype[n]=function(t,e){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return [];if(!arguments.length)return wt(this,r);if(1===arguments.length){t=""+t;var o=this._nodes.get(t);if(void 0===o)throw new Y("Graph.".concat(n,': could not find the "').concat(t,'" node in the graph.'));return Gt(this.multi,"mixed"===r?this.type:r,i,o)}if(2===arguments.length){t=""+t,e=""+e;var a=this._nodes.get(t);if(!a)throw new Y("Graph.".concat(n,':  could not find the "').concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y("Graph.".concat(n,':  could not find the "').concat(e,'" target node in the graph.'));return At(r,this.multi,i,a,e)}throw new F("Graph.".concat(n,": too many arguments (expecting 0, 1 or 2 and got ").concat(arguments.length,")."))};}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o="forEach"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[o]=function(t,e,n){if("mixed"===r||"mixed"===this.type||r===this.type){if(1===arguments.length)return mt(this,r,n=t);if(2===arguments.length){t=""+t,n=e;var a=this._nodes.get(t);if(void 0===a)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));return xt(this.multi,"mixed"===r?this.type:r,i,a,n)}if(3===arguments.length){t=""+t,e=""+e;var u=this._nodes.get(t);if(!u)throw new Y("Graph.".concat(o,':  could not find the "').concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y("Graph.".concat(o,':  could not find the "').concat(e,'" target node in the graph.'));return Lt(r,this.multi,i,u,e,n)}throw new F("Graph.".concat(o,": too many arguments (expecting 1, 2 or 3 and got ").concat(arguments.length,")."))}};var a="map"+n[0].toUpperCase()+n.slice(1);t.prototype[a]=function(){var t,e=Array.prototype.slice.call(arguments),n=e.pop();if(0===e.length){var i=0;"directed"!==r&&(i+=this.undirectedSize),"undirected"!==r&&(i+=this.directedSize),t=new Array(i);var a=0;e.push((function(e,r,i,o,u,c,d){t[a++]=n(e,r,i,o,u,c,d);}));}else t=[],e.push((function(e,r,i,o,a,u,c){t.push(n(e,r,i,o,a,u,c));}));return this[o].apply(this,e),t};var u="filter"+n[0].toUpperCase()+n.slice(1);t.prototype[u]=function(){var t=Array.prototype.slice.call(arguments),e=t.pop(),n=[];return t.push((function(t,r,i,o,a,u,c){e(t,r,i,o,a,u,c)&&n.push(t);})),this[o].apply(this,t),n};var c="reduce"+n[0].toUpperCase()+n.slice(1);t.prototype[c]=function(){var t,e,n=Array.prototype.slice.call(arguments);if(n.length<2||n.length>4)throw new F("Graph.".concat(c,": invalid number of arguments (expecting 2, 3 or 4 and got ").concat(n.length,")."));if("function"==typeof n[n.length-1]&&"function"!=typeof n[n.length-2])throw new F("Graph.".concat(c,": missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array."));2===n.length?(t=n[0],e=n[1],n=[]):3===n.length?(t=n[1],e=n[2],n=[n[0]]):4===n.length&&(t=n[2],e=n[3],n=[n[0],n[1]]);var r=e;return n.push((function(e,n,i,o,a,u,c){r=t(r,e,n,i,o,a,u,c);})),this[o].apply(this,n),r};}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o="find"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[o]=function(t,e,n){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return !1;if(1===arguments.length)return _t(this,r,n=t);if(2===arguments.length){t=""+t,n=e;var a=this._nodes.get(t);if(void 0===a)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));return Et(this.multi,"mixed"===r?this.type:r,i,a,n)}if(3===arguments.length){t=""+t,e=""+e;var u=this._nodes.get(t);if(!u)throw new Y("Graph.".concat(o,':  could not find the "').concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y("Graph.".concat(o,':  could not find the "').concat(e,'" target node in the graph.'));return Dt(r,this.multi,i,u,e,n)}throw new F("Graph.".concat(o,": too many arguments (expecting 1, 2 or 3 and got ").concat(arguments.length,")."))};var a="some"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[a]=function(){var t=Array.prototype.slice.call(arguments),e=t.pop();return t.push((function(t,n,r,i,o,a,u){return e(t,n,r,i,o,a,u)})),!!this[o].apply(this,t)};var u="every"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[u]=function(){var t=Array.prototype.slice.call(arguments),e=t.pop();return t.push((function(t,n,r,i,o,a,u){return !e(t,n,r,i,o,a,u)})),!this[o].apply(this,t)};}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o=n.slice(0,-1)+"Entries";t.prototype[o]=function(t,e){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return O.empty();if(!arguments.length)return kt(this,r);if(1===arguments.length){t=""+t;var n=this._nodes.get(t);if(!n)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));return St(r,i,n)}if(2===arguments.length){t=""+t,e=""+e;var a=this._nodes.get(t);if(!a)throw new Y("Graph.".concat(o,':  could not find the "').concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y("Graph.".concat(o,':  could not find the "').concat(e,'" target node in the graph.'));return Nt(r,i,a,e)}throw new F("Graph.".concat(o,": too many arguments (expecting 0, 1 or 2 and got ").concat(arguments.length,")."))};}(t,e);}));}(re),function(t){Ut.forEach((function(e){Rt(t,e),Wt(t,e),Kt(t,e),It(t,e);}));}(re);var ie=function(t){function n(e){var n=c({type:"directed"},e);if("multi"in n&&!1!==n.multi)throw new F("DirectedGraph.from: inconsistent indication that the graph should be multi in given options!");if("directed"!==n.type)throw new F('DirectedGraph.from: inconsistent "'+n.type+'" type in given options!');return t.call(this,n)||this}return e(n,t),n}(re),oe=function(t){function n(e){var n=c({type:"undirected"},e);if("multi"in n&&!1!==n.multi)throw new F("UndirectedGraph.from: inconsistent indication that the graph should be multi in given options!");if("undirected"!==n.type)throw new F('UndirectedGraph.from: inconsistent "'+n.type+'" type in given options!');return t.call(this,n)||this}return e(n,t),n}(re),ae=function(t){function n(e){var n=c({multi:!0},e);if("multi"in n&&!0!==n.multi)throw new F("MultiGraph.from: inconsistent indication that the graph should be simple in given options!");return t.call(this,n)||this}return e(n,t),n}(re),ue=function(t){function n(e){var n=c({type:"directed",multi:!0},e);if("multi"in n&&!0!==n.multi)throw new F("MultiDirectedGraph.from: inconsistent indication that the graph should be simple in given options!");if("directed"!==n.type)throw new F('MultiDirectedGraph.from: inconsistent "'+n.type+'" type in given options!');return t.call(this,n)||this}return e(n,t),n}(re),ce=function(t){function n(e){var n=c({type:"undirected",multi:!0},e);if("multi"in n&&!0!==n.multi)throw new F("MultiUndirectedGraph.from: inconsistent indication that the graph should be simple in given options!");if("undirected"!==n.type)throw new F('MultiUndirectedGraph.from: inconsistent "'+n.type+'" type in given options!');return t.call(this,n)||this}return e(n,t),n}(re);function de(t){t.from=function(e,n){var r=c({},e.options,n),i=new t(r);return i.import(e),i};}return de(re),de(ie),de(oe),de(ae),de(ue),de(ce),re.Graph=re,re.DirectedGraph=ie,re.UndirectedGraph=oe,re.MultiGraph=ae,re.MultiDirectedGraph=ue,re.MultiUndirectedGraph=ce,re.InvalidArgumentsGraphError=F,re.NotFoundGraphError=Y,re.UsageGraphError=B,re}));
-
-});
-
-/**
- * Graphology isGraph
- * ===================
- *
- * Very simple function aiming at ensuring the given variable is a
- * graphology instance.
- */
-/**
- * Checking the value is a graphology instance.
- *
- * @param  {any}     value - Target value.
- * @return {boolean}
- */
-var isGraph = function isGraph(value) {
-  return (
-    value !== null &&
-    typeof value === 'object' &&
-    typeof value.addUndirectedEdgeWithKey === 'function' &&
-    typeof value.dropNode === 'function' &&
-    typeof value.multi === 'boolean'
-  );
-};
-
-var ARRAY_BUFFER_SUPPORT$1 = typeof ArrayBuffer !== 'undefined';
-var SYMBOL_SUPPORT$1 = typeof Symbol !== 'undefined';
-
-var support = {
-	ARRAY_BUFFER_SUPPORT: ARRAY_BUFFER_SUPPORT$1,
-	SYMBOL_SUPPORT: SYMBOL_SUPPORT$1
-};
-
-/**
- * Obliterator ForEach Function
- * =============================
- *
- * Helper function used to easily iterate over mixed values.
- */
-
-var ARRAY_BUFFER_SUPPORT = support.ARRAY_BUFFER_SUPPORT;
-var SYMBOL_SUPPORT = support.SYMBOL_SUPPORT;
-
-/**
- * Function able to iterate over almost any iterable JS value.
- *
- * @param  {any}      iterable - Iterable value.
- * @param  {function} callback - Callback function.
- */
-var foreach = function forEach(iterable, callback) {
-  var iterator, k, i, l, s;
-
-  if (!iterable) throw new Error('obliterator/forEach: invalid iterable.');
-
-  if (typeof callback !== 'function')
-    throw new Error('obliterator/forEach: expecting a callback.');
-
-  // The target is an array or a string or function arguments
-  if (
-    Array.isArray(iterable) ||
-    (ARRAY_BUFFER_SUPPORT && ArrayBuffer.isView(iterable)) ||
-    typeof iterable === 'string' ||
-    iterable.toString() === '[object Arguments]'
-  ) {
-    for (i = 0, l = iterable.length; i < l; i++) callback(iterable[i], i);
-    return;
-  }
-
-  // The target has a #.forEach method
-  if (typeof iterable.forEach === 'function') {
-    iterable.forEach(callback);
-    return;
-  }
-
-  // The target is iterable
-  if (
-    SYMBOL_SUPPORT &&
-    Symbol.iterator in iterable &&
-    typeof iterable.next !== 'function'
-  ) {
-    iterable = iterable[Symbol.iterator]();
-  }
-
-  // The target is an iterator
-  if (typeof iterable.next === 'function') {
-    iterator = iterable;
-    i = 0;
-
-    while (((s = iterator.next()), s.done !== true)) {
-      callback(s.value, i);
-      i++;
-    }
-
-    return;
-  }
-
-  // The target is a plain object
-  for (k in iterable) {
-    if (iterable.hasOwnProperty(k)) {
-      callback(iterable[k], k);
-    }
-  }
-
-  return;
-};
-
-/**
- * Mnemonist Typed Array Helpers
- * ==============================
- *
- * Miscellaneous helpers related to typed arrays.
- */
-
-var typedArrays = createCommonjsModule(function (module, exports) {
-/**
- * When using an unsigned integer array to store pointers, one might want to
- * choose the optimal word size in regards to the actual numbers of pointers
- * to store.
- *
- * This helpers does just that.
- *
- * @param  {number} size - Expected size of the array to map.
- * @return {TypedArray}
- */
-var MAX_8BIT_INTEGER = Math.pow(2, 8) - 1,
-    MAX_16BIT_INTEGER = Math.pow(2, 16) - 1,
-    MAX_32BIT_INTEGER = Math.pow(2, 32) - 1;
-
-var MAX_SIGNED_8BIT_INTEGER = Math.pow(2, 7) - 1,
-    MAX_SIGNED_16BIT_INTEGER = Math.pow(2, 15) - 1,
-    MAX_SIGNED_32BIT_INTEGER = Math.pow(2, 31) - 1;
-
-exports.getPointerArray = function(size) {
-  var maxIndex = size - 1;
-
-  if (maxIndex <= MAX_8BIT_INTEGER)
-    return Uint8Array;
-
-  if (maxIndex <= MAX_16BIT_INTEGER)
-    return Uint16Array;
-
-  if (maxIndex <= MAX_32BIT_INTEGER)
-    return Uint32Array;
-
-  throw new Error('mnemonist: Pointer Array of size > 4294967295 is not supported.');
-};
-
-exports.getSignedPointerArray = function(size) {
-  var maxIndex = size - 1;
-
-  if (maxIndex <= MAX_SIGNED_8BIT_INTEGER)
-    return Int8Array;
-
-  if (maxIndex <= MAX_SIGNED_16BIT_INTEGER)
-    return Int16Array;
-
-  if (maxIndex <= MAX_SIGNED_32BIT_INTEGER)
-    return Int32Array;
-
-  return Float64Array;
-};
-
-/**
- * Function returning the minimal type able to represent the given number.
- *
- * @param  {number} value - Value to test.
- * @return {TypedArrayClass}
- */
-exports.getNumberType = function(value) {
-
-  // <= 32 bits itnteger?
-  if (value === (value | 0)) {
-
-    // Negative
-    if (Math.sign(value) === -1) {
-      if (value <= 127 && value >= -128)
-        return Int8Array;
-
-      if (value <= 32767 && value >= -32768)
-        return Int16Array;
-
-      return Int32Array;
-    }
-    else {
-
-      if (value <= 255)
-        return Uint8Array;
-
-      if (value <= 65535)
-        return Uint16Array;
-
-      return Uint32Array;
-    }
-  }
-
-  // 53 bits integer & floats
-  // NOTE: it's kinda hard to tell whether we could use 32bits or not...
-  return Float64Array;
-};
-
-/**
- * Function returning the minimal type able to represent the given array
- * of JavaScript numbers.
- *
- * @param  {array}    array  - Array to represent.
- * @param  {function} getter - Optional getter.
- * @return {TypedArrayClass}
- */
-var TYPE_PRIORITY = {
-  Uint8Array: 1,
-  Int8Array: 2,
-  Uint16Array: 3,
-  Int16Array: 4,
-  Uint32Array: 5,
-  Int32Array: 6,
-  Float32Array: 7,
-  Float64Array: 8
-};
-
-// TODO: make this a one-shot for one value
-exports.getMinimalRepresentation = function(array, getter) {
-  var maxType = null,
-      maxPriority = 0,
-      p,
-      t,
-      v,
-      i,
-      l;
-
-  for (i = 0, l = array.length; i < l; i++) {
-    v = getter ? getter(array[i]) : array[i];
-    t = exports.getNumberType(v);
-    p = TYPE_PRIORITY[t.name];
-
-    if (p > maxPriority) {
-      maxPriority = p;
-      maxType = t;
-    }
-  }
-
-  return maxType;
-};
-
-/**
- * Function returning whether the given value is a typed array.
- *
- * @param  {any} value - Value to test.
- * @return {boolean}
- */
-exports.isTypedArray = function(value) {
-  return typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView(value);
-};
-
-/**
- * Function used to concat byte arrays.
- *
- * @param  {...ByteArray}
- * @return {ByteArray}
- */
-exports.concat = function() {
-  var length = 0,
-      i,
-      o,
-      l;
-
-  for (i = 0, l = arguments.length; i < l; i++)
-    length += arguments[i].length;
-
-  var array = new (arguments[0].constructor)(length);
-
-  for (i = 0, o = 0; i < l; i++) {
-    array.set(arguments[i], o);
-    o += arguments[i].length;
-  }
-
-  return array;
-};
-
-/**
- * Function used to initialize a byte array of indices.
- *
- * @param  {number}    length - Length of target.
- * @return {ByteArray}
- */
-exports.indices = function(length) {
-  var PointerArray = exports.getPointerArray(length);
-
-  var array = new PointerArray(length);
-
-  for (var i = 0; i < length; i++)
-    array[i] = i;
-
-  return array;
-};
-});
-
-/**
- * Mnemonist Iterable Function
- * ============================
- *
- * Harmonized iteration helpers over mixed iterable targets.
- */
-
-/**
- * Function used to determine whether the given object supports array-like
- * random access.
- *
- * @param  {any} target - Target object.
- * @return {boolean}
- */
-function isArrayLike(target) {
-  return Array.isArray(target) || typedArrays.isTypedArray(target);
-}
-
-/**
- * Function used to guess the length of the structure over which we are going
- * to iterate.
- *
- * @param  {any} target - Target object.
- * @return {number|undefined}
- */
-function guessLength(target) {
-  if (typeof target.length === 'number')
-    return target.length;
-
-  if (typeof target.size === 'number')
-    return target.size;
-
-  return;
-}
-
-/**
- * Function used to convert an iterable to an array.
- *
- * @param  {any}   target - Iteration target.
- * @return {array}
- */
-function toArray(target) {
-  var l = guessLength(target);
-
-  var array = typeof l === 'number' ? new Array(l) : [];
-
-  var i = 0;
-
-  // TODO: we could optimize when given target is array like
-  foreach(target, function(value) {
-    array[i++] = value;
-  });
-
-  return array;
-}
-
-/**
- * Same as above but returns a supplementary indices array.
- *
- * @param  {any}   target - Iteration target.
- * @return {array}
- */
-function toArrayWithIndices(target) {
-  var l = guessLength(target);
-
-  var IndexArray = typeof l === 'number' ?
-    typedArrays.getPointerArray(l) :
-    Array;
-
-  var array = typeof l === 'number' ? new Array(l) : [];
-  var indices = typeof l === 'number' ? new IndexArray(l) : [];
-
-  var i = 0;
-
-  // TODO: we could optimize when given target is array like
-  foreach(target, function(value) {
-    array[i] = value;
-    indices[i] = i++;
-  });
-
-  return [array, indices];
-}
-
-/**
- * Exporting.
- */
-var isArrayLike_1 = isArrayLike;
-var guessLength_1 = guessLength;
-var toArray_1 = toArray;
-var toArrayWithIndices_1 = toArrayWithIndices;
-
-var iterables = {
-	isArrayLike: isArrayLike_1,
-	guessLength: guessLength_1,
-	toArray: toArray_1,
-	toArrayWithIndices: toArrayWithIndices_1
-};
-
-/**
- * Obliterator Iterator Class
- * ===========================
- *
- * Simple class representing the library's iterators.
- */
-/**
- * Iterator class.
- *
- * @constructor
- * @param {function} next - Next function.
- */
-function Iterator(next) {
-  if (typeof next !== 'function')
-    throw new Error('obliterator/iterator: expecting a function!');
-
-  this.next = next;
-}
-
-/**
- * If symbols are supported, we add `next` to `Symbol.iterator`.
- */
-if (typeof Symbol !== 'undefined')
-  Iterator.prototype[Symbol.iterator] = function () {
-    return this;
-  };
-
-/**
- * Returning an iterator of the given values.
- *
- * @param  {any...} values - Values.
- * @return {Iterator}
- */
-Iterator.of = function () {
-  var args = arguments,
-    l = args.length,
-    i = 0;
-
-  return new Iterator(function () {
-    if (i >= l) return {done: true};
-
-    return {done: false, value: args[i++]};
-  });
-};
-
-/**
- * Returning an empty iterator.
- *
- * @return {Iterator}
- */
-Iterator.empty = function () {
-  var iterator = new Iterator(function () {
-    return {done: true};
-  });
-
-  return iterator;
-};
-
-/**
- * Returning an iterator over the given indexed sequence.
- *
- * @param  {string|Array} sequence - Target sequence.
- * @return {Iterator}
- */
-Iterator.fromSequence = function (sequence) {
-  var i = 0,
-    l = sequence.length;
-
-  return new Iterator(function () {
-    if (i >= l) return {done: true};
-
-    return {done: false, value: sequence[i++]};
-  });
-};
-
-/**
- * Returning whether the given value is an iterator.
- *
- * @param  {any} value - Value.
- * @return {boolean}
- */
-Iterator.is = function (value) {
-  if (value instanceof Iterator) return true;
-
-  return (
-    typeof value === 'object' &&
-    value !== null &&
-    typeof value.next === 'function'
-  );
-};
-
-/**
- * Exporting.
- */
-var iterator = Iterator;
-
-/**
- * Mnemonist FixedDeque
- * =====================
- *
- * Fixed capacity double-ended queue implemented as ring deque.
- */
-
-/**
- * FixedDeque.
- *
- * @constructor
- */
-function FixedDeque(ArrayClass, capacity) {
-
-  if (arguments.length < 2)
-    throw new Error('mnemonist/fixed-deque: expecting an Array class and a capacity.');
-
-  if (typeof capacity !== 'number' || capacity <= 0)
-    throw new Error('mnemonist/fixed-deque: `capacity` should be a positive number.');
-
-  this.ArrayClass = ArrayClass;
-  this.capacity = capacity;
-  this.items = new ArrayClass(this.capacity);
-  this.clear();
-}
-
-/**
- * Method used to clear the structure.
- *
- * @return {undefined}
- */
-FixedDeque.prototype.clear = function() {
-
-  // Properties
-  this.start = 0;
-  this.size = 0;
-};
-
-/**
- * Method used to append a value to the deque.
- *
- * @param  {any}    item - Item to append.
- * @return {number}      - Returns the new size of the deque.
- */
-FixedDeque.prototype.push = function(item) {
-  if (this.size === this.capacity)
-    throw new Error('mnemonist/fixed-deque.push: deque capacity (' + this.capacity + ') exceeded!');
-
-  var index = (this.start + this.size) % this.capacity;
-
-  this.items[index] = item;
-
-  return ++this.size;
-};
-
-/**
- * Method used to prepend a value to the deque.
- *
- * @param  {any}    item - Item to prepend.
- * @return {number}      - Returns the new size of the deque.
- */
-FixedDeque.prototype.unshift = function(item) {
-  if (this.size === this.capacity)
-    throw new Error('mnemonist/fixed-deque.unshift: deque capacity (' + this.capacity + ') exceeded!');
-
-  var index = this.start - 1;
-
-  if (this.start === 0)
-    index = this.capacity - 1;
-
-  this.items[index] = item;
-  this.start = index;
-
-  return ++this.size;
-};
-
-/**
- * Method used to pop the deque.
- *
- * @return {any} - Returns the popped item.
- */
-FixedDeque.prototype.pop = function() {
-  if (this.size === 0)
-    return;
-
-  const index = (this.start + this.size - 1) % this.capacity;
-
-  this.size--;
-
-  return this.items[index];
-};
-
-/**
- * Method used to shift the deque.
- *
- * @return {any} - Returns the shifted item.
- */
-FixedDeque.prototype.shift = function() {
-  if (this.size === 0)
-    return;
-
-  var index = this.start;
-
-  this.size--;
-  this.start++;
-
-  if (this.start === this.capacity)
-    this.start = 0;
-
-  return this.items[index];
-};
-
-/**
- * Method used to peek the first value of the deque.
- *
- * @return {any}
- */
-FixedDeque.prototype.peekFirst = function() {
-  if (this.size === 0)
-    return;
-
-  return this.items[this.start];
-};
-
-/**
- * Method used to peek the last value of the deque.
- *
- * @return {any}
- */
-FixedDeque.prototype.peekLast = function() {
-  if (this.size === 0)
-    return;
-
-  var index = this.start + this.size - 1;
-
-  if (index > this.capacity)
-    index -= this.capacity;
-
-  return this.items[index];
-};
-
-/**
- * Method used to get the desired value of the deque.
- *
- * @param  {number} index
- * @return {any}
- */
-FixedDeque.prototype.get = function(index) {
-  if (this.size === 0)
-    return;
-
-  index = this.start + index;
-
-  if (index > this.capacity)
-    index -= this.capacity;
-
-  return this.items[index];
-};
-
-/**
- * Method used to iterate over the deque.
- *
- * @param  {function}  callback - Function to call for each item.
- * @param  {object}    scope    - Optional scope.
- * @return {undefined}
- */
-FixedDeque.prototype.forEach = function(callback, scope) {
-  scope = arguments.length > 1 ? scope : this;
-
-  var c = this.capacity,
-      l = this.size,
-      i = this.start,
-      j = 0;
-
-  while (j < l) {
-    callback.call(scope, this.items[i], j, this);
-    i++;
-    j++;
-
-    if (i === c)
-      i = 0;
-  }
-};
-
-/**
- * Method used to convert the deque to a JavaScript array.
- *
- * @return {array}
- */
-// TODO: optional array class as argument?
-FixedDeque.prototype.toArray = function() {
-
-  // Optimization
-  var offset = this.start + this.size;
-
-  if (offset < this.capacity)
-    return this.items.slice(this.start, offset);
-
-  var array = new this.ArrayClass(this.size),
-      c = this.capacity,
-      l = this.size,
-      i = this.start,
-      j = 0;
-
-  while (j < l) {
-    array[j] = this.items[i];
-    i++;
-    j++;
-
-    if (i === c)
-      i = 0;
-  }
-
-  return array;
-};
-
-/**
- * Method used to create an iterator over the deque's values.
- *
- * @return {Iterator}
- */
-FixedDeque.prototype.values = function() {
-  var items = this.items,
-      c = this.capacity,
-      l = this.size,
-      i = this.start,
-      j = 0;
-
-  return new iterator(function() {
-    if (j >= l)
-      return {
-        done: true
-      };
-
-    var value = items[i];
-
-    i++;
-    j++;
-
-    if (i === c)
-      i = 0;
-
-    return {
-      value: value,
-      done: false
-    };
-  });
-};
-
-/**
- * Method used to create an iterator over the deque's entries.
- *
- * @return {Iterator}
- */
-FixedDeque.prototype.entries = function() {
-  var items = this.items,
-      c = this.capacity,
-      l = this.size,
-      i = this.start,
-      j = 0;
-
-  return new iterator(function() {
-    if (j >= l)
-      return {
-        done: true
-      };
-
-    var value = items[i];
-
-    i++;
-
-    if (i === c)
-      i = 0;
-
-    return {
-      value: [j++, value],
-      done: false
-    };
-  });
-};
-
-/**
- * Attaching the #.values method to Symbol.iterator if possible.
- */
-if (typeof Symbol !== 'undefined')
-  FixedDeque.prototype[Symbol.iterator] = FixedDeque.prototype.values;
-
-/**
- * Convenience known methods.
- */
-FixedDeque.prototype.inspect = function() {
-  var array = this.toArray();
-
-  array.type = this.ArrayClass.name;
-  array.capacity = this.capacity;
-
-  // Trick so that node displays the name of the constructor
-  Object.defineProperty(array, 'constructor', {
-    value: FixedDeque,
-    enumerable: false
-  });
-
-  return array;
-};
-
-if (typeof Symbol !== 'undefined')
-  FixedDeque.prototype[Symbol.for('nodejs.util.inspect.custom')] = FixedDeque.prototype.inspect;
-
-/**
- * Static @.from function taking an arbitrary iterable & converting it into
- * a deque.
- *
- * @param  {Iterable} iterable   - Target iterable.
- * @param  {function} ArrayClass - Array class to use.
- * @param  {number}   capacity   - Desired capacity.
- * @return {FiniteStack}
- */
-FixedDeque.from = function(iterable, ArrayClass, capacity) {
-  if (arguments.length < 3) {
-    capacity = iterables.guessLength(iterable);
-
-    if (typeof capacity !== 'number')
-      throw new Error('mnemonist/fixed-deque.from: could not guess iterable length. Please provide desired capacity as last argument.');
-  }
-
-  var deque = new FixedDeque(ArrayClass, capacity);
-
-  if (iterables.isArrayLike(iterable)) {
-    var i, l;
-
-    for (i = 0, l = iterable.length; i < l; i++)
-      deque.items[i] = iterable[i];
-
-    deque.size = l;
-
-    return deque;
-  }
-
-  iterables.forEach(iterable, function(value) {
-    deque.push(value);
-  });
-
-  return deque;
-};
-
-/**
- * Exporting.
- */
-var fixedDeque = FixedDeque;
-
-/**
- * Graphology Traversal Utils
- * ===========================
- *
- * Miscellaneous utils used throughout the library.
- */
-function TraversalRecord$2(node, attr, depth) {
-  this.node = node;
-  this.attributes = attr;
-  this.depth = depth;
-}
-
-var TraversalRecord_1 = TraversalRecord$2;
-
-var utils = {
-	TraversalRecord: TraversalRecord_1
-};
-
-/**
- * Graphology Traversal BFS
- * =========================
- *
- * Breadth-First Search traversal function.
- */
-
-var TraversalRecord$1 = utils.TraversalRecord;
-
-/**
- * BFS traversal in the given graph using a callback function
- *
- * @param {Graph}    graph    - Target graph.
- * @param {function} callback - Iteration callback.
- */
-function bfs(graph, callback) {
-  if (!isGraph(graph))
-    throw new Error('graphology-traversal/bfs: expecting a graphology instance.');
-
-  if (typeof callback !== 'function')
-    throw new Error('graphology-traversal/bfs: given callback is not a function.');
-
-  // Early termination
-  if (graph.order === 0)
-    return;
-
-  var seen = new Set();
-  var queue = new fixedDeque(Array, graph.order);
-  var record, depth;
-
-  function neighborCallback(neighbor, attr) {
-    if (seen.has(neighbor))
-      return;
-
-    seen.add(neighbor);
-    queue.push(new TraversalRecord$1(neighbor, attr, depth + 1));
-  }
-
-  graph.forEachNode(function(node, attr) {
-    if (seen.has(node))
-      return;
-
-    seen.add(node);
-    queue.push(new TraversalRecord$1(node, attr, 0));
-
-    while (queue.size !== 0) {
-      record = queue.shift();
-      depth = record.depth;
-
-      callback(record.node, record.attributes, depth);
-
-      graph.forEachOutboundNeighbor(record.node, neighborCallback);
-    }
-  });
-}
-
-/**
- * BFS traversal in the given graph, starting from the given node, using a
- * callback function.
- *
- * @param {Graph}    graph    - Target graph.
- * @param {string}   node     - Starting node.
- * @param {function} callback - Iteration callback.
- */
-function bfsFromNode(graph, node, callback) {
-  if (!isGraph(graph))
-    throw new Error('graphology-traversal/dfs: expecting a graphology instance.');
-
-  if (typeof callback !== 'function')
-    throw new Error('graphology-traversal/dfs: given callback is not a function.');
-
-  // Early termination
-  if (graph.order === 0)
-    return;
-
-  node = '' + node;
-
-  var seen = new Set();
-  var queue = new fixedDeque(Array, graph.order);
-  var depth, record;
-
-  function neighborCallback(neighbor, attr) {
-    if (seen.has(neighbor))
-      return;
-
-    seen.add(neighbor);
-    queue.push(new TraversalRecord$1(neighbor, attr, depth + 1));
-  }
-
-  seen.add(node);
-  queue.push(new TraversalRecord$1(node, graph.getNodeAttributes(node), 0));
-
-  while (queue.size !== 0) {
-    record = queue.shift();
-    depth = record.depth;
-
-    callback(record.node, record.attributes, depth);
-
-    graph.forEachOutboundNeighbor(record.node, neighborCallback);
-  }
-}
-
-var bfs_2 = bfs;
-var bfsFromNode_1 = bfsFromNode;
-
-var bfs_1 = {
-	bfs: bfs_2,
-	bfsFromNode: bfsFromNode_1
-};
-
-/**
- * Graphology Traversal DFS
- * =========================
- *
- * Depth-First Search traversal function.
- */
-
-var TraversalRecord = utils.TraversalRecord;
-
-/**
- * DFS traversal in the given graph using a callback function
- *
- * @param {Graph}    graph    - Target graph.
- * @param {function} callback - Iteration callback.
- */
-function dfs(graph, callback) {
-  if (!isGraph(graph))
-    throw new Error('graphology-traversal/dfs: expecting a graphology instance.');
-
-  if (typeof callback !== 'function')
-    throw new Error('graphology-traversal/dfs: given callback is not a function.');
-
-  // Early termination
-  if (graph.order === 0)
-    return;
-
-  var seen = new Set();
-  var stack = [];
-  var depth, record;
-
-  function neighborCallback(neighbor, attr) {
-    if (seen.has(neighbor))
-      return;
-
-    seen.add(neighbor);
-    stack.push(new TraversalRecord(neighbor, attr, depth + 1));
-  }
-
-  graph.forEachNode(function(node, attr) {
-    if (seen.has(node))
-      return;
-
-    seen.add(node);
-    stack.push(new TraversalRecord(node, attr, 0));
-
-    while (stack.length !== 0) {
-      record = stack.pop();
-      depth = record.depth;
-
-      callback(record.node, record.attributes, depth);
-
-      graph.forEachOutboundNeighbor(record.node, neighborCallback);
-    }
-  });
-}
-
-/**
- * DFS traversal in the given graph, starting from the given node, using a
- * callback function.
- *
- * @param {Graph}    graph    - Target graph.
- * @param {string}   node     - Starting node.
- * @param {function} callback - Iteration callback.
- */
-function dfsFromNode(graph, node, callback) {
-  if (!isGraph(graph))
-    throw new Error('graphology-traversal/dfs: expecting a graphology instance.');
-
-  if (typeof callback !== 'function')
-    throw new Error('graphology-traversal/dfs: given callback is not a function.');
-
-  // Early termination
-  if (graph.order === 0)
-    return;
-
-  node = '' + node;
-
-  var seen = new Set();
-  var stack = [];
-  var depth, record;
-
-  function neighborCallback(neighbor, attr) {
-    if (seen.has(neighbor))
-      return;
-
-    seen.add(neighbor);
-    stack.push(new TraversalRecord(neighbor, attr, depth + 1));
-  }
-
-  seen.add(node);
-  stack.push(new TraversalRecord(node, graph.getNodeAttributes(node), 0));
-
-  while (stack.length !== 0) {
-    record = stack.pop();
-    depth = record.depth;
-
-    callback(record.node, record.attributes, depth);
-
-    graph.forEachOutboundNeighbor(record.node, neighborCallback);
-  }
-}
-
-var dfs_2 = dfs;
-var dfsFromNode_1 = dfsFromNode;
-
-var dfs_1 = {
-	dfs: dfs_2,
-	dfsFromNode: dfsFromNode_1
-};
-
-var graphologyTraversal = createCommonjsModule(function (module, exports) {
-var k;
-
-for (k in bfs_1)
-  exports[k] = bfs_1[k];
-
-for (k in dfs_1)
-  exports[k] = dfs_1[k];
-});
-
-// TODO - this is a hack to get the graph to work with the approvals
-// I shouldn't need
-const DIRECTIONS = ["up", "same", "down", "next", "prev"];
-// This function takes the real & implied graphs for a given relation, and returns a new graphs with both.
-// It makes implied relations real
-// TODO use reflexiveClosure instead
-function closeImpliedLinks(real, implied) {
-    const closedG = real.copy();
-    implied.forEachEdge((key, a, s, t) => {
-        closedG.mergeEdge(t, s, a);
-    });
-    return closedG;
-}
-function removeUnlinkedNodes(g) {
-    const copy = g.copy();
-    copy.forEachNode((node) => {
-        if (!copy.degree(node))
-            copy.dropNode(node);
-    });
-    return copy;
-}
-/**
- * Return a subgraph of all nodes & edges with `dirs.includes(a.dir)`
- * @param  {MultiGraph} main
- * @param  {Directions} dir
- */
-function getSubInDirs(main, ...dirs) {
-    const sub = new graphology_umd_min.MultiGraph();
-    main === null || main === void 0 ? void 0 : main.forEachEdge((k, a, s, t) => {
-        if (dirs.includes(a.dir)) {
-            //@ts-ignore
-            addNodesIfNot(sub, [s, t], a);
-            sub.addEdge(s, t, a);
-        }
-    });
-    return sub;
-}
-/**
- * Return a subgraph of all nodes & edges with `files.includes(a.field)`
- * @param  {MultiGraph} main
- * @param  {string[]} fields
- */
-function getSubForFields(main, fields) {
-    const sub = new graphology_umd_min.MultiGraph();
-    main.forEachEdge((k, a, s, t) => {
-        if (fields.includes(a.field)) {
-            //@ts-ignore
-            addNodesIfNot(sub, [s, t], a);
-            sub.addEdge(s, t, a);
-        }
-    });
-    return sub;
-}
-/**
- * For every edge in `g`, add the reverse of the edge to a copy of `g`.
- *
- * It also sets the attrs of the reverse edges to `oppDir` and `oppFields[0]`
- * @param  {MultiGraph} g
- * @param  {UserHier[]} userHiers
- * @param  {boolean} closeAsOpposite
- */
-function getReflexiveClosure(g, userHiers, closeAsOpposite = true) {
-    const copy = g.copy();
-    copy.forEachEdge((k, a, s, t) => {
-        var _a;
-        const { dir, field } = a;
-        if (field === undefined)
-            return;
-        const oppDir = getOppDir(dir);
-        const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, dir);
-        addNodesIfNot(copy, [s, t], {
-            //@ts-ignore
-            dir: closeAsOpposite ? oppDir : dir,
-            field: closeAsOpposite ? oppField : field,
-        });
-        addEdgeIfNot(copy, t, s, {
-            //@ts-ignore
-            dir: closeAsOpposite ? oppDir : dir,
-            field: closeAsOpposite ? oppField : field,
-            implied: BC_I_REFLEXIVE,
-        });
-    });
-    return copy;
-}
-function addNodesIfNot(g, nodes, attr = { order: 9999 }) {
-    for (const node of nodes) {
-        g.updateNode(node, (exstantAttrs) => {
-            const extantOrder = exstantAttrs.order;
-            return Object.assign(Object.assign({}, exstantAttrs), { order: extantOrder && extantOrder < 9999 ? extantOrder : attr.order });
-        });
-    }
-}
-function addEdgeIfNot(g, source, target, attr) {
-    if (!g.hasEdge(source, target))
-        g.addEdge(source, target, attr);
-}
-const getSinks = (g) => g.filterNodes((node) => g.hasNode(node) && !g.outDegree(node));
-const getOutNeighbours = (g, node) => g.hasNode(node) ? g.outNeighbors(node) : [];
-const getInNeighbours = (g, node) => g.hasNode(node) ? g.inNeighbors(node) : [];
-const getOppDir = (dir) => {
-    switch (dir) {
-        case "up":
-            return "down";
-        case "down":
-            return "up";
-        case "same":
-            return "same";
-        case "next":
-            return "prev";
-        case "prev":
-            return "next";
-    }
-};
-/**
- *  Get the hierarchy and direction that `field` is in
- * */
-function getFieldInfo(userHiers, field) {
-    let fieldDir;
-    let fieldHier;
-    DIRECTIONS.forEach((dir) => {
-        userHiers.forEach((hier) => {
-            if (hier[dir].includes(field)) {
-                fieldDir = dir;
-                fieldHier = hier;
-                return;
-            }
-        });
-    });
-    return { fieldHier, fieldDir };
-}
-function getOppFields(userHiers, field) {
-    // If the field ends with `>`, it is already the opposite field we need (coming from getOppFallback`)
-    if (field.endsWith(">"))
-        return field.slice(0, -4);
-    const { fieldHier, fieldDir } = getFieldInfo(userHiers, field);
-    if (!fieldHier || !fieldDir)
-        return undefined;
-    const oppDir = getOppDir(fieldDir);
-    return fieldHier[oppDir];
-}
-function dfsAllPaths(g, start) {
-    const queue = [{ node: start, path: [] }];
-    const visited = {};
-    const allPaths = [];
-    let i = 0;
-    while (queue.length > 0 && i < 1000) {
-        i++;
-        const { node, path } = queue.shift();
-        const extPath = [node, ...path];
-        const succsNotVisited = g.hasNode(node)
-            ? g.filterOutNeighbors(node, (succ) => !visited[succ] || visited[succ] < 5)
-            : [];
-        const newItems = succsNotVisited.map((succ) => {
-            visited[succ] = visited[succ] ? visited[succ] + 1 : 1;
-            return { node: succ, path: extPath };
-        });
-        queue.unshift(...newItems);
-        if (!g.hasNode(node) || !g.outDegree(node))
-            allPaths.push(extPath);
-    }
-    return allPaths;
-}
-function bfsAllPaths(g, start) {
-    const pathsArr = [];
-    const queue = [{ node: start, path: [] }];
-    let i = 0;
-    while (queue.length !== 0 && i < 1000) {
-        i++;
-        const { node, path } = queue.shift();
-        const extPath = [node, ...path];
-        const succs = g.hasNode(node)
-            ? g.filterOutNeighbors(node, (n) => !path.includes(n))
-            : [];
-        for (const node of succs) {
-            queue.push({ node, path: extPath });
-        }
-        // terminal node
-        if (!g.hasNode(node) || succs.length === 0) {
-            pathsArr.push(extPath);
-        }
-    }
-    // Splice off the current note from the path
-    pathsArr.forEach((path) => {
-        if (path.length)
-            path.splice(path.length - 1, 1);
-    });
-    loglevel.info({ pathsArr });
-    return pathsArr;
-}
-function removeCycles(g, startNode) {
-    const copy = g.copy();
-    let prevNode = null;
-    graphologyTraversal.dfsFromNode(copy, startNode, (n) => {
-        copy.forEachOutNeighbor(n, (t) => {
-            if (t === prevNode && copy.hasEdge(t, prevNode)) {
-                copy.dropEdge(t, prevNode);
-            }
-        });
-        prevNode = n;
-    });
-    return copy;
-}
-function buildObsGraph(app) {
-    const ObsG = new graphology_umd_min.MultiGraph();
-    const { resolvedLinks, unresolvedLinks } = app.metadataCache;
-    for (const source in resolvedLinks) {
-        if (!source.endsWith(".md"))
-            continue;
-        const sourceBase = getBaseFromMDPath(source);
-        addNodesIfNot(ObsG, [sourceBase]);
-        for (const dest in resolvedLinks[source]) {
-            if (!dest.endsWith(".md"))
-                continue;
-            const destBase = getBaseFromMDPath(dest);
-            addNodesIfNot(ObsG, [destBase]);
-            ObsG.addEdge(sourceBase, destBase, { resolved: true });
-        }
-    }
-    for (const source in unresolvedLinks) {
-        const sourceBase = getBaseFromMDPath(source);
-        addNodesIfNot(ObsG, [sourceBase]);
-        for (const dest in unresolvedLinks[source]) {
-            const destBase = getBaseFromMDPath(dest);
-            addNodesIfNot(ObsG, [destBase]);
-            if (sourceBase === destBase)
-                continue;
-            ObsG.addEdge(sourceBase, destBase, { resolved: false });
-        }
-    }
-    loglevel.info({ ObsG });
-    return ObsG;
-}
-function populateMain(settings, mainG, source, field, target, sourceOrder, targetOrder, fillOpp = false) {
-    var _a;
-    const { userHiers } = settings;
-    const dir = getFieldInfo(userHiers, field).fieldDir;
-    addNodesIfNot(mainG, [source], {
-        order: sourceOrder,
-    });
-    addNodesIfNot(mainG, [target], {
-        order: targetOrder,
-    });
-    addEdgeIfNot(mainG, source, target, {
-        dir,
-        field,
-    });
-    if (fillOpp) {
-        const oppDir = getOppDir(dir);
-        const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : getFields(userHiers, oppDir)[0];
-        addEdgeIfNot(mainG, target, source, {
-            dir: oppDir,
-            field: oppField,
-        });
-    }
-}
-const getTargetOrder = (frontms, target) => {
-    var _a, _b;
-    return parseInt((_b = (_a = frontms.find((arr) => arr.file.basename === target)) === null || _a === void 0 ? void 0 : _a[BC_ORDER]) !== null && _b !== void 0 ? _b : "9999");
+const MATRIX_VIEW = "BC-matrix";
+const STATS_VIEW = "BC-stats";
+const DUCK_VIEW = "BC-ducks";
+const TREE_VIEW = "BC-tree";
+const TRAIL_ICON = "BC-trail-icon";
+const TRAIL_ICON_SVG = '<path fill="currentColor" stroke="currentColor" d="M48.8,4c-6,0-13.5,0.5-19.7,3.3S17.9,15.9,17.9,25c0,5,2.6,9.7,6.1,13.9s8.1,8.3,12.6,12.3s9,7.8,12.2,11.5 c3.2,3.7,5.1,7.1,5.1,10.2c0,14.4-13.4,19.3-13.4,19.3c-0.7,0.2-1.2,0.8-1.3,1.5s0.1,1.4,0.7,1.9c0.6,0.5,1.3,0.6,2,0.3 c0,0,16.1-6.1,16.1-23c0-4.6-2.6-8.8-6.1-12.8c-3.5-4-8.1-7.9-12.6-11.8c-4.5-3.9-8.9-7.9-12.2-11.8c-3.2-3.9-5.2-7.7-5.2-11.4 c0-7.8,3.6-11.6,8.8-14S43,8,48.8,8c4.6,0,9.3,0,11,0c0.7,0,1.4-0.4,1.7-1c0.3-0.6,0.3-1.4,0-2s-1-1-1.7-1C58.3,4,53.4,4,48.8,4 L48.8,4z M78.1,4c-0.6,0-1.2,0.2-1.6,0.7l-8.9,9.9c-0.5,0.6-0.7,1.4-0.3,2.2c0.3,0.7,1,1.2,1.8,1.2h0.1l-2.8,2.6 c-0.6,0.6-0.8,1.4-0.5,2.2c0.3,0.8,1,1.3,1.9,1.3h1.3l-4.5,4.6c-0.6,0.6-0.7,1.4-0.4,2.2c0.3,0.7,1,1.2,1.8,1.2h10v4 c0,0.7,0.4,1.4,1,1.8c0.6,0.4,1.4,0.4,2,0c0.6-0.4,1-1,1-1.8v-4h10c0.8,0,1.5-0.5,1.8-1.2c0.3-0.7,0.1-1.6-0.4-2.2L86.9,24h1.3 c0.8,0,1.6-0.5,1.9-1.3c0.3-0.8,0.1-1.6-0.5-2.2l-2.8-2.6h0.1c0.8,0,1.5-0.5,1.8-1.2c0.3-0.7,0.2-1.6-0.3-2.2l-8.9-9.9 C79.1,4.3,78.6,4,78.1,4L78.1,4z M78,9l4.4,4.9h-0.7c-0.8,0-1.6,0.5-1.9,1.3c-0.3,0.8-0.1,1.6,0.5,2.2l2.8,2.6h-1.1 c-0.8,0-1.5,0.5-1.8,1.2c-0.3,0.7-0.1,1.6,0.4,2.2l4.5,4.6H70.8l4.5-4.6c0.6-0.6,0.7-1.4,0.4-2.2c-0.3-0.7-1-1.2-1.8-1.2h-1.1 l2.8-2.6c0.6-0.6,0.8-1.4,0.5-2.2c-0.3-0.8-1-1.3-1.9-1.3h-0.7L78,9z M52.4,12c-4.1,0-7.1,0.5-9.4,1.5c-2.3,1-3.8,2.5-4.5,4.3 c-0.7,1.8-0.5,3.6,0.1,5.2c0.6,1.5,1.5,2.9,2.5,3.9c5.4,5.4,18.1,12.6,29.6,21c5.8,4.2,11.2,8.6,15.1,13c3.9,4.4,6.2,8.7,6.2,12.4 c0,14.5-12.9,18.7-12.9,18.7c-0.7,0.2-1.2,0.8-1.4,1.5s0.1,1.5,0.7,1.9c0.6,0.5,1.3,0.6,2,0.3c0,0,15.6-5.6,15.6-22.5 c0-5.3-2.9-10.3-7.2-15.1C84.6,53.6,79,49,73.1,44.7c-11.8-8.6-24.8-16.3-29.2-20.6c-0.6-0.6-1.2-1.5-1.6-2.4 c-0.3-0.9-0.4-1.7-0.1-2.4c0.3-0.7,0.8-1.4,2.3-2c1.5-0.7,4.1-1.2,7.8-1.2c4.9,0,9.4,0.1,9.4,0.1c0.7,0,1.4-0.3,1.8-1 c0.4-0.6,0.4-1.4,0-2.1c-0.4-0.6-1.1-1-1.8-1C61.9,12.1,57.3,12,52.4,12L52.4,12z M24,46c-0.5,0-1.1,0.2-1.4,0.6L9.2,60.5 c-0.6,0.6-0.7,1.4-0.4,2.2c0.3,0.7,1,1.2,1.8,1.2h3l-6.5,6.8c-0.6,0.6-0.7,1.4-0.4,2.2s1,1.2,1.8,1.2H13l-8.5,8.6 C4,83.2,3.8,84,4.2,84.8C4.5,85.5,5.2,86,6,86h16v5.4c0,0.7,0.4,1.4,1,1.8c0.6,0.4,1.4,0.4,2,0c0.6-0.4,1-1,1-1.8V86h16 c0.8,0,1.5-0.5,1.8-1.2c0.3-0.7,0.1-1.6-0.4-2.2L35,74h4.4c0.8,0,1.5-0.5,1.8-1.2s0.2-1.6-0.4-2.2l-6.5-6.8h3 c0.8,0,1.5-0.5,1.8-1.2c0.3-0.7,0.2-1.6-0.4-2.2L25.4,46.6C25.1,46.2,24.5,46,24,46L24,46z M24,50.9l8.7,9h-3 c-0.8,0-1.5,0.5-1.8,1.2s-0.2,1.6,0.4,2.2l6.5,6.8h-4.5c-0.8,0-1.5,0.5-1.8,1.2c-0.3,0.7-0.1,1.6,0.4,2.2l8.5,8.6H10.8l8.5-8.6 c0.6-0.6,0.7-1.4,0.4-2.2c-0.3-0.7-1-1.2-1.8-1.2h-4.5l6.5-6.8c0.6-0.6,0.7-1.4,0.4-2.2c-0.3-0.7-1-1.2-1.8-1.2h-3L24,50.9z"/>';
+const DUCK_ICON = "BC-duck-icon";
+const DUCK_ICON_SVG = '<path fill="currentColor" stroke="currentColor" d="M72,31c0-1.5-1.2-2.8-2.8-2.8c-1.5,0-2.8,1.2-2.8,2.8s1.2,2.8,2.8,2.8C70.8,33.8,72,32.6,72,31z M80.4,47.7c10.7,0,19.4-8.7,19.4-19.4H88.4c-0.1-0.6-0.1-1.1-0.2-1.7c-1.6-7.1-7.3-12.8-14.3-144c-1.6-0.4-3.1-0.5-4.6-0.5c-10.7,0-19.4,8.7-19.4,19.4v13.9h-9.4c-6.8,0-13.6-2.4-18.2-7.3c-0.7-0.7-1.6-1.1-2.4-11c-1.7,0-3.3,1.3-3.3,3.3c0,16.4,12.5,31,28.6,32.6c1.6,0.2,3.1-1.1,3.1-2.8v-2.8c0-1.4-1-2.6-2.4-2.7c-7.9-09-14.8-6.2-18.4-13.5c4.1,1.6,8.5,2.5,13.1,2.5l17.7,0.1V31c0-6.1,5-11.1,11.1-11.1c0.9,0,1.8,0.1,2.7,0.3c3.9,0.9,7.2,4.2,8.1,8.1C814,34.4,78,39.1,74,41l-4.7,2.3v12.4l2.1,2.4c1.5,1.8,3.4,4.7,3.5,8.8c0.1,3.4-1.3,6.7-3.9,9.4c-3,3-7,4.8-11.2,4.8H43.9c-1,0-2.1-01-3.2-0.2C25.2,79.5,12.3,68.1,8.7,53.2h5.1c-1.2-2.7-2-5.5-2.5-8.3H5.4c-3.3,0-6,3-5.5,6.3c2.9,20.3,19.4,36.1,40,38c1.3,0.1,2.6,02,4,0.2h15.8c12.5,0,23.7-10.2,23.4-22.7c-0.1-5.4-2.2-10.3-5.6-14.1v-4.9H80.4L80.4,47.7z"/>';
+const splitLinksRegex = new RegExp(/\[\[(.+?)\]\]/g);
+const dropHeaderOrAlias = new RegExp(/\[\[([^#|]+)\]\]/);
+/** A meta-regex that takes in a string of the form `/regex/flags`, and returns 2 groups, the inner `regex`, and the `flags`. */
+const regNFlags = new RegExp(/^.(.*?)\W(\w*)$/);
+const VISTYPES = [
+    "Force Directed Graph",
+    "Tidy Tree",
+    "Circle Packing",
+    "Edge Bundling",
+    "Arc Diagram",
+    "Sunburst",
+    "Tree Map",
+    "Icicle",
+    "Radial Tree",
+];
+const DIRECTIONS$1 = ["up", "same", "down", "next", "prev"];
+const ARROW_DIRECTIONS = {
+    up: "↑",
+    same: "↔",
+    down: "↓",
+    next: "→",
+    prev: "←",
+};
+const RELATIONS = ["Parent", "Sibling", "Child"];
+const REAlCLOSED = ["Real", "Closed"];
+const ALLUNLINKED = ["All", "No Unlinked"];
+const CODEBLOCK_TYPES = ["tree", "juggl"];
+const CODEBLOCK_FIELDS = [
+    "type",
+    "dir",
+    "fields",
+    "depth",
+    "title",
+    "flat",
+    "content",
+    "from",
+    "implied",
+];
+const JUGGL_CB_DEFAULTS = {
+    animateLayout: true,
+    autoAddNodes: false,
+    autoExpand: false,
+    autoZoom: false,
+    coreStore: "core",
+    expandInitial: false,
+    fdgdLayout: "d3-force",
+    filter: "",
+    height: "750px",
+    hoverEdges: false,
+    layout: "force-directed",
+    limit: 250,
+    mergeEdges: true,
+    metaKeyHover: true,
+    mode: "workspace",
+    navigator: true,
+    openWithShift: false,
+    readContent: true,
+    styleGroups: [],
+    toolbar: true,
+    width: "100%",
+    zoomSpeed: 1,
+};
+const JUGGL_TRAIL_DEFAULTS = Object.assign(JUGGL_CB_DEFAULTS, {
+    animateLayout: true,
+    autoZoom: false,
+    fdgdLayout: "d3-force",
+    height: "400px",
+    readContent: false,
+    toolbar: false,
+    navigator: false,
+});
+CODEBLOCK_FIELDS.push(...Object.keys(JUGGL_CB_DEFAULTS));
+const blankUserHier = () => {
+    return { up: [], same: [], down: [], next: [], prev: [] };
+};
+const blankRealNImplied = () => {
+    return {
+        up: { reals: [], implieds: [] },
+        down: { reals: [], implieds: [] },
+        same: { reals: [], implieds: [] },
+        next: { reals: [], implieds: [] },
+        prev: { reals: [], implieds: [] },
+    };
 };
-const getSourceOrder = (frontm) => { var _a; return parseInt((_a = frontm[BC_ORDER]) !== null && _a !== void 0 ? _a : "9999"); };
+const [BC_I_AUNT, BC_I_COUSIN, BC_I_SIBLING_1, BC_I_SIBLING_2, BC_I_REFLEXIVE,] = ["BC-Aunt", "BC-Cousin", "BC-Sibling-1", "BC-Sibling-2", "BC-Reflexive"];
+const [BC_FOLDER_NOTE, BC_FOLDER_NOTE_RECURSIVE, BC_TAG_NOTE, BC_TAG_NOTE_FIELD, BC_TAG_NOTE_EXACT, BC_LINK_NOTE, BC_TRAVERSE_NOTE, BC_REGEX_NOTE, BC_REGEX_NOTE_FIELD, BC_IGNORE_DENDRON, BC_HIDE_TRAIL, BC_ORDER,] = [
+    "BC-folder-note",
+    "BC-folder-note-recursive",
+    "BC-tag-note",
+    "BC-tag-note-field",
+    "BC-tag-note-exact",
+    "BC-link-note",
+    "BC-traverse-note",
+    "BC-regex-note",
+    "BC-regex-note-field",
+    "BC-ignore-dendron",
+    "BC-hide-trail",
+    "BC-order",
+];
+const BC_FIELDS_INFO = [
+    {
+        field: BC_FOLDER_NOTE,
+        desc: "Set this note as a Breadcrumbs folder-note. All other notes in this folder will be added to the graph with the field name specified in this key's value",
+        after: ": ",
+        alt: true,
+    },
+    {
+        field: BC_FOLDER_NOTE_RECURSIVE,
+        desc: "Recursively add notes in subfolders to the foldernote of _that_ subfolder.",
+        after: ": true",
+        alt: false,
+    },
+    {
+        field: BC_TAG_NOTE,
+        desc: "Set this note as a Breadcrumbs tag-note. All other notes with this tag will be added to the graph using the default fieldName specified in `Settings > Alternative Hierarchies > Tag Notes > Default Field`, or using the fieldName you specify with `BC-tag-note-field: fieldName`",
+        after: ": '#",
+        alt: true,
+    },
+    {
+        field: BC_TAG_NOTE_FIELD,
+        desc: "Manually choose the field for this tag-note to use",
+        after: ": ",
+        alt: false,
+    },
+    {
+        field: BC_TAG_NOTE_EXACT,
+        desc: "Only look for notes with the exact tag. i.e. `#A` won't match `#A/B`",
+        after: ": true",
+        alt: false,
+    },
+    {
+        field: BC_LINK_NOTE,
+        desc: "Set this note as a Breadcrumbs link-note. All links leaving this note will be added to the graph with the field name specified in this key's value.",
+        after: ": ",
+        alt: true,
+    },
+    {
+        field: BC_TRAVERSE_NOTE,
+        desc: "Set this note as a Breadcrumbs traverse-note. Starting from this note, the Obsidian graph will be traversed in depth-first order, and all notes along the way will be added to the BC graph using the fieldName you specify",
+        after: ": ",
+        alt: true,
+    },
+    {
+        field: BC_REGEX_NOTE,
+        desc: "Set this note as a Breadcrumbs regex-note. The value of this field is a regular expression (of the form '/regex/flags'). All note names that match the regex will be added to the BC graph using the default fieldName specified in `Settings > Alternative Hierarchies > Regex Notes > Default Field`, or using the fieldName you specify in 'BC-regex-note-field'.",
+        after: ": '/",
+        alt: true,
+    },
+    {
+        field: BC_REGEX_NOTE_FIELD,
+        desc: "Manually choose the field for this regex-note to use",
+        after: ": ",
+        alt: false,
+    },
+    {
+        field: BC_IGNORE_DENDRON,
+        desc: "Tells Breadcrumbs to not treat this note as a dendron note (only useful if the note name has you dendron splitter in it, usually a period `.`).",
+        after: ": true",
+        alt: false,
+    },
+    {
+        field: BC_HIDE_TRAIL,
+        desc: "Don't show the trail in this note",
+        after: ": true",
+        alt: false,
+    },
+    {
+        field: BC_ORDER,
+        desc: "Set the order of this note in the List/Matrix view. A lower value places this note higher in the order.",
+        after: ": ",
+        alt: false,
+    },
+];
+const BC_ALTS = BC_FIELDS_INFO.filter((f) => f.alt).map((f) => f.field);
+const DEFAULT_SETTINGS = {
+    addDendronNotes: false,
+    aliasesInIndex: false,
+    alphaSortAsc: true,
+    altLinkFields: [],
+    CSVPaths: "",
+    dateFormat: "YYYY-MM-DD",
+    debugMode: "WARN",
+    defaultView: true,
+    dendronNoteDelimiter: ".",
+    dendronNoteField: "up",
+    downViewWrap: false,
+    dotsColour: "#000000",
+    dvWaitTime: 5000,
+    enableAlphaSort: true,
+    fieldSuggestor: true,
+    filterImpliedSiblingsOfDifferentTypes: false,
+    limitWriteBCCheckboxes: [],
+    CHECKBOX_STATES_OVERWRITTEN: false,
+    gridDots: false,
+    gridHeatmap: false,
+    heatmapColour: getComputedStyle(document.body).getPropertyValue("--text-accent"),
+    hierarchyNotes: [""],
+    HNUpField: "",
+    indexNotes: [""],
+    namingSystemField: "",
+    namingSystemRegex: "",
+    namingSystemSplit: ".",
+    namingSystemEndsWithDelimiter: false,
+    refreshOnNoteChange: false,
+    useAllMetadata: true,
+    openMatrixOnLoad: true,
+    openStatsOnLoad: true,
+    openDuckOnLoad: false,
+    openDownOnLoad: true,
+    parseJugglLinksWithoutJuggl: false,
+    showNameOrType: true,
+    showRelationType: true,
+    regexNoteField: "",
+    rlLeaf: true,
+    showAllPathsIfNoneToIndexNote: false,
+    showAllAliases: true,
+    showBCs: true,
+    showBCsInEditLPMode: false,
+    showRefreshNotice: true,
+    showImpliedRelations: true,
+    showTrail: true,
+    showGrid: true,
+    showJuggl: false,
+    showPrevNext: true,
+    sortByNameShowAlias: false,
+    squareDirectionsOrder: [0, 1, 2, 3, 4],
+    limitTrailCheckboxes: [],
+    limitJumpToFirstFields: [],
+    showAll: false,
+    noPathMessage: `This note has no real or implied parents`,
+    tagNoteField: "",
+    threadIntoNewPane: false,
+    threadingTemplate: "{{field}} of {{current}}",
+    threadingDirTemplates: { up: "", same: "", down: "", next: "", prev: "" },
+    trailSeperator: "→",
+    treatCurrNodeAsImpliedSibling: false,
+    trimDendronNotes: false,
+    respectReadableLineLength: true,
+    userHiers: [
+        {
+            up: ["up"],
+            same: ["same"],
+            down: ["down"],
+            next: ["next"],
+            prev: ["prev"],
+        },
+    ],
+    writeBCsInline: false,
+    showWriteAllBCsCmd: false,
+    visGraph: "Force Directed Graph",
+    visRelation: "Parent",
+    visClosed: "Real",
+    visAll: "All",
+    wikilinkIndex: true,
+    impliedRelations: {
+        siblingIdentity: false,
+        sameParentIsSibling: true,
+        siblingsSiblingIsSibling: false,
+        parentsSiblingsIsParents: false,
+        parentsParentsIsParent: false,
+        cousinsIsSibling: false,
+    },
+};
 
 function normalise(arr) {
     const max = Math.max(...arr);
@@ -5006,22 +3226,6 @@ const dropDendron = (path, settings) => settings.trimDendronNotes
     ? path.split(settings.dendronNoteDelimiter).last()
     : path;
 const dropPathNDendron = (path, settings) => dropDendron(dropPath(path), settings);
-/**
- * Get basename from a **Markdown** `path`
- * @param  {string} path
- */
-const getBaseFromMDPath = (path) => {
-    const splitSlash = path.split("/").last();
-    if (splitSlash.endsWith(".md")) {
-        return splitSlash.split(".md").slice(0, -1).join(".");
-    }
-    else
-        return splitSlash;
-};
-const getDVBasename = (file) => file.basename || file.name;
-const getFolderName = (file) => { var _a; 
-//@ts-ignore
-return ((_a = file === null || file === void 0 ? void 0 : file.parent) === null || _a === void 0 ? void 0 : _a.name) || file.folder; };
 const dropFolder = (path) => path.split("/").last().split(".").slice(0, -1).join(".");
 const splitAndTrim = (fields) => {
     if (!fields || fields === "")
@@ -5057,6 +3261,18 @@ function transpose(A) {
     }
     return AT;
 }
+/**
+ * Given an array of strings, return an array of objects that represent the runs of consecutive strings
+ * in the array.
+ * @param {string} arr
+ * @returns An array of objects with the following properties:
+ *
+ *   `value`: the value of the run
+ *
+ *   `first`: the index of the first element in the run
+ *
+ *   `last`: the index of the last element in the run
+ */
 function runs(arr) {
     const runs = [];
     let i = 0;
@@ -5070,6 +3286,47 @@ function runs(arr) {
     }
     return runs;
 }
+function swapItems(i, j, arr) {
+    const max = arr.length - 1;
+    if (i < 0 || i > max || j < 0 || j > max)
+        return arr;
+    const tmp = arr[i];
+    arr[i] = arr[j];
+    arr[j] = tmp;
+    return arr;
+}
+const linkClass = (app, to, realQ = true) => `internal-link BC-Link ${isInVault(app, to) ? "" : "is-unresolved"} ${realQ ? "" : "BC-Implied"}`;
+function strToRegex(input) {
+    const match = input.match(regNFlags);
+    if (!match)
+        return null;
+    const [, innerRegex, flags] = match;
+    try {
+        const regex = new RegExp(innerRegex, flags);
+        return regex;
+    }
+    catch (e) {
+        console.log(e);
+        return null;
+    }
+}
+
+/**
+ * Get basename from a **Markdown** `path`
+ * @param  {string} path
+ */
+const getBaseFromMDPath = (path) => {
+    const splitSlash = path.split("/").last();
+    if (splitSlash.endsWith(".md")) {
+        return splitSlash.split(".md").slice(0, -1).join(".");
+    }
+    else
+        return splitSlash;
+};
+const getDVBasename = (file) => file.basename || file.name;
+const getFolderName = (file) => { var _a; 
+//@ts-ignore
+return ((_a = file === null || file === void 0 ? void 0 : file.parent) === null || _a === void 0 ? void 0 : _a.name) || file.folder; };
 function makeWiki(str, wikiQ = true) {
     let copy = str.slice();
     if (wikiQ) {
@@ -5084,27 +3341,6 @@ function dropWikilinks(str) {
         copy = copy.slice(2, -2);
     return copy;
 }
-/**
- * Get all the fields in `dir`.
- * Returns all fields if `dir === 'all'`
- * @param  {UserHier[]} userHiers
- * @param  {Directions|"all"} dir
- */
-function getFields(userHiers, dir = "all") {
-    const fields = [];
-    userHiers.forEach((hier) => {
-        if (dir === "all") {
-            DIRECTIONS$1.forEach((eachDir) => {
-                fields.push(...hier[eachDir]);
-            });
-        }
-        else {
-            fields.push(...hier[dir]);
-        }
-    });
-    return fields;
-}
-const hierToStr = (hier) => DIRECTIONS$1.map((dir) => `${ARROW_DIRECTIONS[dir]}: ${hier[dir].join(", ")}`).join("\n");
 /**
  * Adds or updates the given yaml `key` to `value` in the given TFile
  * @param  {string} key
@@ -5142,100 +3378,6 @@ function splitAtYaml(content) {
         ];
     }
 }
-function swapItems(i, j, arr) {
-    const max = arr.length - 1;
-    if (i < 0 || i > max || j < 0 || j > max)
-        return arr;
-    const tmp = arr[i];
-    arr[i] = arr[j];
-    arr[j] = tmp;
-    return arr;
-}
-const linkClass = (app, to, realQ = true) => `internal-link BC-Link ${isInVault(app, to) ? "" : "is-unresolved"} ${realQ ? "" : "BC-Implied"}`;
-const fallbackField = (field, dir) => `${field} <${ARROW_DIRECTIONS[dir]}>`;
-const fallbackOppField = (field, dir) => `${field} <${ARROW_DIRECTIONS[getOppDir(dir)]}>`;
-/** Remember to filter by hierarchy in MatrixView! */
-function getRealnImplied(plugin, currNode, dir = null) {
-    const realsnImplieds = blankRealNImplied();
-    const { settings, closedG } = plugin;
-    const { userHiers } = settings;
-    if (!closedG.hasNode(currNode))
-        return realsnImplieds;
-    closedG.forEachEdge(currNode, (k, a, s, t) => {
-        var _a;
-        const { field, dir: edgeDir, implied, } = a;
-        const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, edgeDir);
-        (dir ? [dir, getOppDir(dir)] : DIRECTIONS$1).forEach((currDir) => {
-            const oppDir = getOppDir(currDir);
-            // Reals
-            if (s === currNode && (edgeDir === currDir || edgeDir === oppDir)) {
-                const arr = realsnImplieds[edgeDir].reals;
-                if (arr.findIndex((item) => item.to === t) === -1) {
-                    arr.push({ to: t, real: true, field, implied });
-                }
-            }
-            // Implieds
-            // If `s !== currNode` then `t` must be
-            else if (edgeDir === currDir || edgeDir === oppDir) {
-                const arr = realsnImplieds[getOppDir(edgeDir)].implieds;
-                if (arr.findIndex((item) => item.to === s) === -1) {
-                    arr.push({
-                        to: s,
-                        real: false,
-                        field: oppField,
-                        implied,
-                    });
-                }
-            }
-        });
-    });
-    return realsnImplieds;
-}
-function getMatrixNeighbours(plugin, currNode) {
-    const { closedG } = plugin;
-    const { userHiers } = plugin.settings;
-    const neighbours = blankRealNImplied();
-    if (!closedG)
-        return neighbours;
-    closedG.forEachEdge(currNode, (k, a, s, t) => {
-        var _a;
-        const { field, dir, implied } = a;
-        if (s === currNode) {
-            neighbours[dir].reals.push({ to: t, field, implied });
-        }
-        else {
-            neighbours[getOppDir(dir)].implieds.push({
-                to: s,
-                field: (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, dir),
-                implied,
-            });
-        }
-    });
-    return neighbours;
-}
-function iterateHiers(userHiers, fn) {
-    userHiers.forEach((hier) => {
-        DIRECTIONS$1.forEach((dir) => {
-            hier[dir].forEach((field) => {
-                fn(hier, dir, field);
-            });
-        });
-    });
-}
-function strToRegex(input) {
-    const match = input.match(regNFlags);
-    if (!match)
-        return null;
-    const [, innerRegex, flags] = match;
-    try {
-        const regex = new RegExp(innerRegex, flags);
-        return regex;
-    }
-    catch (e) {
-        console.log(e);
-        return null;
-    }
-}
 const dropHash = (tag) => tag.startsWith("#") ? tag.slice(1) : tag;
 function getAlt(node, plugin) {
     var _a;
@@ -5257,6 +3399,434 @@ function getAlt(node, plugin) {
         return null;
 }
 
+function noop() { }
+function assign(tar, src) {
+    // @ts-ignore
+    for (const k in src)
+        tar[k] = src[k];
+    return tar;
+}
+function run(fn) {
+    return fn();
+}
+function blank_object() {
+    return Object.create(null);
+}
+function run_all(fns) {
+    fns.forEach(run);
+}
+function is_function(thing) {
+    return typeof thing === 'function';
+}
+function safe_not_equal(a, b) {
+    return a != a ? b == b : a !== b || ((a && typeof a === 'object') || typeof a === 'function');
+}
+function is_empty(obj) {
+    return Object.keys(obj).length === 0;
+}
+function create_slot(definition, ctx, $$scope, fn) {
+    if (definition) {
+        const slot_ctx = get_slot_context(definition, ctx, $$scope, fn);
+        return definition[0](slot_ctx);
+    }
+}
+function get_slot_context(definition, ctx, $$scope, fn) {
+    return definition[1] && fn
+        ? assign($$scope.ctx.slice(), definition[1](fn(ctx)))
+        : $$scope.ctx;
+}
+function get_slot_changes(definition, $$scope, dirty, fn) {
+    if (definition[2] && fn) {
+        const lets = definition[2](fn(dirty));
+        if ($$scope.dirty === undefined) {
+            return lets;
+        }
+        if (typeof lets === 'object') {
+            const merged = [];
+            const len = Math.max($$scope.dirty.length, lets.length);
+            for (let i = 0; i < len; i += 1) {
+                merged[i] = $$scope.dirty[i] | lets[i];
+            }
+            return merged;
+        }
+        return $$scope.dirty | lets;
+    }
+    return $$scope.dirty;
+}
+function update_slot(slot, slot_definition, ctx, $$scope, dirty, get_slot_changes_fn, get_slot_context_fn) {
+    const slot_changes = get_slot_changes(slot_definition, $$scope, dirty, get_slot_changes_fn);
+    if (slot_changes) {
+        const slot_context = get_slot_context(slot_definition, ctx, $$scope, get_slot_context_fn);
+        slot.p(slot_context, slot_changes);
+    }
+}
+function exclude_internal_props(props) {
+    const result = {};
+    for (const k in props)
+        if (k[0] !== '$')
+            result[k] = props[k];
+    return result;
+}
+function null_to_empty(value) {
+    return value == null ? '' : value;
+}
+
+function append(target, node) {
+    target.appendChild(node);
+}
+function insert(target, node, anchor) {
+    target.insertBefore(node, anchor || null);
+}
+function detach(node) {
+    node.parentNode.removeChild(node);
+}
+function destroy_each(iterations, detaching) {
+    for (let i = 0; i < iterations.length; i += 1) {
+        if (iterations[i])
+            iterations[i].d(detaching);
+    }
+}
+function element(name) {
+    return document.createElement(name);
+}
+function svg_element(name) {
+    return document.createElementNS('http://www.w3.org/2000/svg', name);
+}
+function text(data) {
+    return document.createTextNode(data);
+}
+function space() {
+    return text(' ');
+}
+function empty() {
+    return text('');
+}
+function listen(node, event, handler, options) {
+    node.addEventListener(event, handler, options);
+    return () => node.removeEventListener(event, handler, options);
+}
+function attr(node, attribute, value) {
+    if (value == null)
+        node.removeAttribute(attribute);
+    else if (node.getAttribute(attribute) !== value)
+        node.setAttribute(attribute, value);
+}
+function get_binding_group_value(group, __value, checked) {
+    const value = new Set();
+    for (let i = 0; i < group.length; i += 1) {
+        if (group[i].checked)
+            value.add(group[i].__value);
+    }
+    if (!checked) {
+        value.delete(__value);
+    }
+    return Array.from(value);
+}
+function children(element) {
+    return Array.from(element.childNodes);
+}
+function set_data(text, data) {
+    data = '' + data;
+    if (text.wholeText !== data)
+        text.data = data;
+}
+function set_input_value(input, value) {
+    input.value = value == null ? '' : value;
+}
+function set_style(node, key, value, important) {
+    node.style.setProperty(key, value, important ? 'important' : '');
+}
+function select_option(select, value) {
+    for (let i = 0; i < select.options.length; i += 1) {
+        const option = select.options[i];
+        if (option.__value === value) {
+            option.selected = true;
+            return;
+        }
+    }
+}
+function select_value(select) {
+    const selected_option = select.querySelector(':checked') || select.options[0];
+    return selected_option && selected_option.__value;
+}
+
+let current_component;
+function set_current_component(component) {
+    current_component = component;
+}
+function get_current_component() {
+    if (!current_component)
+        throw new Error('Function called outside component initialization');
+    return current_component;
+}
+function onMount(fn) {
+    get_current_component().$$.on_mount.push(fn);
+}
+
+const dirty_components = [];
+const binding_callbacks = [];
+const render_callbacks = [];
+const flush_callbacks = [];
+const resolved_promise = Promise.resolve();
+let update_scheduled = false;
+function schedule_update() {
+    if (!update_scheduled) {
+        update_scheduled = true;
+        resolved_promise.then(flush);
+    }
+}
+function add_render_callback(fn) {
+    render_callbacks.push(fn);
+}
+let flushing = false;
+const seen_callbacks = new Set();
+function flush() {
+    if (flushing)
+        return;
+    flushing = true;
+    do {
+        // first, call beforeUpdate functions
+        // and update components
+        for (let i = 0; i < dirty_components.length; i += 1) {
+            const component = dirty_components[i];
+            set_current_component(component);
+            update(component.$$);
+        }
+        set_current_component(null);
+        dirty_components.length = 0;
+        while (binding_callbacks.length)
+            binding_callbacks.pop()();
+        // then, once components are updated, call
+        // afterUpdate functions. This may cause
+        // subsequent updates...
+        for (let i = 0; i < render_callbacks.length; i += 1) {
+            const callback = render_callbacks[i];
+            if (!seen_callbacks.has(callback)) {
+                // ...so guard against infinite loops
+                seen_callbacks.add(callback);
+                callback();
+            }
+        }
+        render_callbacks.length = 0;
+    } while (dirty_components.length);
+    while (flush_callbacks.length) {
+        flush_callbacks.pop()();
+    }
+    update_scheduled = false;
+    flushing = false;
+    seen_callbacks.clear();
+}
+function update($$) {
+    if ($$.fragment !== null) {
+        $$.update();
+        run_all($$.before_update);
+        const dirty = $$.dirty;
+        $$.dirty = [-1];
+        $$.fragment && $$.fragment.p($$.ctx, dirty);
+        $$.after_update.forEach(add_render_callback);
+    }
+}
+const outroing = new Set();
+let outros;
+function group_outros() {
+    outros = {
+        r: 0,
+        c: [],
+        p: outros // parent group
+    };
+}
+function check_outros() {
+    if (!outros.r) {
+        run_all(outros.c);
+    }
+    outros = outros.p;
+}
+function transition_in(block, local) {
+    if (block && block.i) {
+        outroing.delete(block);
+        block.i(local);
+    }
+}
+function transition_out(block, local, detach, callback) {
+    if (block && block.o) {
+        if (outroing.has(block))
+            return;
+        outroing.add(block);
+        outros.c.push(() => {
+            outroing.delete(block);
+            if (callback) {
+                if (detach)
+                    block.d(1);
+                callback();
+            }
+        });
+        block.o(local);
+    }
+}
+
+function get_spread_update(levels, updates) {
+    const update = {};
+    const to_null_out = {};
+    const accounted_for = { $$scope: 1 };
+    let i = levels.length;
+    while (i--) {
+        const o = levels[i];
+        const n = updates[i];
+        if (n) {
+            for (const key in o) {
+                if (!(key in n))
+                    to_null_out[key] = 1;
+            }
+            for (const key in n) {
+                if (!accounted_for[key]) {
+                    update[key] = n[key];
+                    accounted_for[key] = 1;
+                }
+            }
+            levels[i] = n;
+        }
+        else {
+            for (const key in o) {
+                accounted_for[key] = 1;
+            }
+        }
+    }
+    for (const key in to_null_out) {
+        if (!(key in update))
+            update[key] = undefined;
+    }
+    return update;
+}
+function get_spread_object(spread_props) {
+    return typeof spread_props === 'object' && spread_props !== null ? spread_props : {};
+}
+function create_component(block) {
+    block && block.c();
+}
+function mount_component(component, target, anchor, customElement) {
+    const { fragment, on_mount, on_destroy, after_update } = component.$$;
+    fragment && fragment.m(target, anchor);
+    if (!customElement) {
+        // onMount happens before the initial afterUpdate
+        add_render_callback(() => {
+            const new_on_destroy = on_mount.map(run).filter(is_function);
+            if (on_destroy) {
+                on_destroy.push(...new_on_destroy);
+            }
+            else {
+                // Edge case - component was destroyed immediately,
+                // most likely as a result of a binding initialising
+                run_all(new_on_destroy);
+            }
+            component.$$.on_mount = [];
+        });
+    }
+    after_update.forEach(add_render_callback);
+}
+function destroy_component(component, detaching) {
+    const $$ = component.$$;
+    if ($$.fragment !== null) {
+        run_all($$.on_destroy);
+        $$.fragment && $$.fragment.d(detaching);
+        // TODO null out other refs, including component.$$ (but need to
+        // preserve final state?)
+        $$.on_destroy = $$.fragment = null;
+        $$.ctx = [];
+    }
+}
+function make_dirty(component, i) {
+    if (component.$$.dirty[0] === -1) {
+        dirty_components.push(component);
+        schedule_update();
+        component.$$.dirty.fill(0);
+    }
+    component.$$.dirty[(i / 31) | 0] |= (1 << (i % 31));
+}
+function init(component, options, instance, create_fragment, not_equal, props, dirty = [-1]) {
+    const parent_component = current_component;
+    set_current_component(component);
+    const $$ = component.$$ = {
+        fragment: null,
+        ctx: null,
+        // state
+        props,
+        update: noop,
+        not_equal,
+        bound: blank_object(),
+        // lifecycle
+        on_mount: [],
+        on_destroy: [],
+        on_disconnect: [],
+        before_update: [],
+        after_update: [],
+        context: new Map(parent_component ? parent_component.$$.context : []),
+        // everything else
+        callbacks: blank_object(),
+        dirty,
+        skip_bound: false
+    };
+    let ready = false;
+    $$.ctx = instance
+        ? instance(component, options.props || {}, (i, ret, ...rest) => {
+            const value = rest.length ? rest[0] : ret;
+            if ($$.ctx && not_equal($$.ctx[i], $$.ctx[i] = value)) {
+                if (!$$.skip_bound && $$.bound[i])
+                    $$.bound[i](value);
+                if (ready)
+                    make_dirty(component, i);
+            }
+            return ret;
+        })
+        : [];
+    $$.update();
+    ready = true;
+    run_all($$.before_update);
+    // `false` as a special case of no DOM component
+    $$.fragment = create_fragment ? create_fragment($$.ctx) : false;
+    if (options.target) {
+        if (options.hydrate) {
+            const nodes = children(options.target);
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            $$.fragment && $$.fragment.l(nodes);
+            nodes.forEach(detach);
+        }
+        else {
+            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion
+            $$.fragment && $$.fragment.c();
+        }
+        if (options.intro)
+            transition_in(component.$$.fragment);
+        mount_component(component, options.target, options.anchor, options.customElement);
+        flush();
+    }
+    set_current_component(parent_component);
+}
+/**
+ * Base class for Svelte components. Used when dev=false.
+ */
+class SvelteComponent {
+    $destroy() {
+        destroy_component(this, 1);
+        this.$destroy = noop;
+    }
+    $on(type, callback) {
+        const callbacks = (this.$$.callbacks[type] || (this.$$.callbacks[type] = []));
+        callbacks.push(callback);
+        return () => {
+            const index = callbacks.indexOf(callback);
+            if (index !== -1)
+                callbacks.splice(index, 1);
+        };
+    }
+    $set($$props) {
+        if (this.$$set && !is_empty($$props)) {
+            this.$$.skip_bound = true;
+            this.$$set($$props);
+            this.$$.skip_bound = false;
+        }
+    }
+}
+
 /* src\Components\ModifyHNItemComp.svelte generated by Svelte v3.35.0 */
 
 function add_css$d() {
@@ -5838,3901 +4408,4364 @@ class HierarchyNoteSelectorModal extends obsidian.FuzzySuggestModal {
     }
 }
 
-/* src\Components\KoFi.svelte generated by Svelte v3.35.0 */
+/**
+ * @license
+ * Lodash <https://lodash.com/>
+ * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
+ * Released under MIT license <https://lodash.com/license>
+ * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
+ * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+ */
+
+var lodash = createCommonjsModule(function (module, exports) {
+(function() {
+
+  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
+  var undefined$1;
+
+  /** Used as the semantic version number. */
+  var VERSION = '4.17.21';
+
+  /** Used as the size to enable large array optimizations. */
+  var LARGE_ARRAY_SIZE = 200;
+
+  /** Error message constants. */
+  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',
+      FUNC_ERROR_TEXT = 'Expected a function',
+      INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';
+
+  /** Used to stand-in for `undefined` hash values. */
+  var HASH_UNDEFINED = '__lodash_hash_undefined__';
+
+  /** Used as the maximum memoize cache size. */
+  var MAX_MEMOIZE_SIZE = 500;
+
+  /** Used as the internal argument placeholder. */
+  var PLACEHOLDER = '__lodash_placeholder__';
+
+  /** Used to compose bitmasks for cloning. */
+  var CLONE_DEEP_FLAG = 1,
+      CLONE_FLAT_FLAG = 2,
+      CLONE_SYMBOLS_FLAG = 4;
+
+  /** Used to compose bitmasks for value comparisons. */
+  var COMPARE_PARTIAL_FLAG = 1,
+      COMPARE_UNORDERED_FLAG = 2;
+
+  /** Used to compose bitmasks for function metadata. */
+  var WRAP_BIND_FLAG = 1,
+      WRAP_BIND_KEY_FLAG = 2,
+      WRAP_CURRY_BOUND_FLAG = 4,
+      WRAP_CURRY_FLAG = 8,
+      WRAP_CURRY_RIGHT_FLAG = 16,
+      WRAP_PARTIAL_FLAG = 32,
+      WRAP_PARTIAL_RIGHT_FLAG = 64,
+      WRAP_ARY_FLAG = 128,
+      WRAP_REARG_FLAG = 256,
+      WRAP_FLIP_FLAG = 512;
+
+  /** Used as default options for `_.truncate`. */
+  var DEFAULT_TRUNC_LENGTH = 30,
+      DEFAULT_TRUNC_OMISSION = '...';
+
+  /** Used to detect hot functions by number of calls within a span of milliseconds. */
+  var HOT_COUNT = 800,
+      HOT_SPAN = 16;
+
+  /** Used to indicate the type of lazy iteratees. */
+  var LAZY_FILTER_FLAG = 1,
+      LAZY_MAP_FLAG = 2,
+      LAZY_WHILE_FLAG = 3;
+
+  /** Used as references for various `Number` constants. */
+  var INFINITY = 1 / 0,
+      MAX_SAFE_INTEGER = 9007199254740991,
+      MAX_INTEGER = 1.7976931348623157e+308,
+      NAN = 0 / 0;
+
+  /** Used as references for the maximum length and index of an array. */
+  var MAX_ARRAY_LENGTH = 4294967295,
+      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,
+      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
+
+  /** Used to associate wrap methods with their bit flags. */
+  var wrapFlags = [
+    ['ary', WRAP_ARY_FLAG],
+    ['bind', WRAP_BIND_FLAG],
+    ['bindKey', WRAP_BIND_KEY_FLAG],
+    ['curry', WRAP_CURRY_FLAG],
+    ['curryRight', WRAP_CURRY_RIGHT_FLAG],
+    ['flip', WRAP_FLIP_FLAG],
+    ['partial', WRAP_PARTIAL_FLAG],
+    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],
+    ['rearg', WRAP_REARG_FLAG]
+  ];
+
+  /** `Object#toString` result references. */
+  var argsTag = '[object Arguments]',
+      arrayTag = '[object Array]',
+      asyncTag = '[object AsyncFunction]',
+      boolTag = '[object Boolean]',
+      dateTag = '[object Date]',
+      domExcTag = '[object DOMException]',
+      errorTag = '[object Error]',
+      funcTag = '[object Function]',
+      genTag = '[object GeneratorFunction]',
+      mapTag = '[object Map]',
+      numberTag = '[object Number]',
+      nullTag = '[object Null]',
+      objectTag = '[object Object]',
+      promiseTag = '[object Promise]',
+      proxyTag = '[object Proxy]',
+      regexpTag = '[object RegExp]',
+      setTag = '[object Set]',
+      stringTag = '[object String]',
+      symbolTag = '[object Symbol]',
+      undefinedTag = '[object Undefined]',
+      weakMapTag = '[object WeakMap]',
+      weakSetTag = '[object WeakSet]';
+
+  var arrayBufferTag = '[object ArrayBuffer]',
+      dataViewTag = '[object DataView]',
+      float32Tag = '[object Float32Array]',
+      float64Tag = '[object Float64Array]',
+      int8Tag = '[object Int8Array]',
+      int16Tag = '[object Int16Array]',
+      int32Tag = '[object Int32Array]',
+      uint8Tag = '[object Uint8Array]',
+      uint8ClampedTag = '[object Uint8ClampedArray]',
+      uint16Tag = '[object Uint16Array]',
+      uint32Tag = '[object Uint32Array]';
+
+  /** Used to match empty string literals in compiled template source. */
+  var reEmptyStringLeading = /\b__p \+= '';/g,
+      reEmptyStringMiddle = /\b(__p \+=) '' \+/g,
+      reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g;
+
+  /** Used to match HTML entities and HTML characters. */
+  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,
+      reUnescapedHtml = /[&<>"']/g,
+      reHasEscapedHtml = RegExp(reEscapedHtml.source),
+      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);
+
+  /** Used to match template delimiters. */
+  var reEscape = /<%-([\s\S]+?)%>/g,
+      reEvaluate = /<%([\s\S]+?)%>/g,
+      reInterpolate = /<%=([\s\S]+?)%>/g;
+
+  /** Used to match property names within property paths. */
+  var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
+      reIsPlainProp = /^\w*$/,
+      rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g;
+
+  /**
+   * Used to match `RegExp`
+   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
+   */
+  var reRegExpChar = /[\\^$.*+?()[\]{}|]/g,
+      reHasRegExpChar = RegExp(reRegExpChar.source);
 
-function create_fragment$l(ctx) {
-	let script;
-	let script_src_value;
-	let t;
-	let div;
-	let mounted;
-	let dispose;
+  /** Used to match leading whitespace. */
+  var reTrimStart = /^\s+/;
 
-	return {
-		c() {
-			script = element("script");
-			t = space();
-			div = element("div");
-			attr(script, "type", "text/javascript");
-			if (script.src !== (script_src_value = "https://ko-fi.com/widgets/widget_2.js")) attr(script, "src", script_src_value);
-		},
-		m(target, anchor) {
-			append(document.head, script);
-			insert(target, t, anchor);
-			insert(target, div, anchor);
-			/*div_binding*/ ctx[2](div);
+  /** Used to match a single whitespace character. */
+  var reWhitespace = /\s/;
 
-			if (!mounted) {
-				dispose = listen(script, "load", /*initializeKofi*/ ctx[1]);
-				mounted = true;
-			}
-		},
-		p: noop,
-		i: noop,
-		o: noop,
-		d(detaching) {
-			detach(script);
-			if (detaching) detach(t);
-			if (detaching) detach(div);
-			/*div_binding*/ ctx[2](null);
-			mounted = false;
-			dispose();
-		}
-	};
-}
+  /** Used to match wrap detail comments. */
+  var reWrapComment = /\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/,
+      reWrapDetails = /\{\n\/\* \[wrapped with (.+)\] \*/,
+      reSplitDetails = /,? & /;
 
-function instance$l($$self, $$props, $$invalidate) {
-	let button;
+  /** Used to match words composed of alphanumeric characters. */
+  var reAsciiWord = /[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g;
 
-	var initializeKofi = () => {
-		kofiwidget2.init("Support Breadcrumbs development!", "#29abe0", "G2G454TZF");
-		$$invalidate(0, button.innerHTML = kofiwidget2.getHTML(), button);
-	};
+  /**
+   * Used to validate the `validate` option in `_.template` variable.
+   *
+   * Forbids characters which could potentially change the meaning of the function argument definition:
+   * - "()," (modification of function parameters)
+   * - "=" (default value)
+   * - "[]{}" (destructuring of function parameters)
+   * - "/" (beginning of a comment)
+   * - whitespace
+   */
+  var reForbiddenIdentifierChars = /[()=,{}\[\]\/\s]/;
 
-	function div_binding($$value) {
-		binding_callbacks[$$value ? "unshift" : "push"](() => {
-			button = $$value;
-			$$invalidate(0, button);
-		});
-	}
+  /** Used to match backslashes in property paths. */
+  var reEscapeChar = /\\(\\)?/g;
 
-	return [button, initializeKofi, div_binding];
-}
+  /**
+   * Used to match
+   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).
+   */
+  var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g;
 
-class KoFi extends SvelteComponent {
-	constructor(options) {
-		super();
-		init(this, options, instance$l, create_fragment$l, safe_not_equal, {});
-	}
-}
+  /** Used to match `RegExp` flags from their coerced string values. */
+  var reFlags = /\w*$/;
 
-function addCreateIndexSettings(plugin, cmdsDetails) {
-    const { settings } = plugin;
-    const createIndexDetails = subDetails("Create Index", cmdsDetails);
-    new obsidian.Setting(createIndexDetails)
-        .setName("Add wiklink brackets")
-        .setDesc(fragWithHTML("When creating an index, should it wrap the note name in wikilinks <code>[[]]</code> or not.\n✅ = yes, ❌ = no."))
-        .addToggle((toggle) => toggle.setValue(settings.wikilinkIndex).onChange(async (value) => {
-        settings.wikilinkIndex = value;
-        await plugin.saveSettings();
-    }));
-    new obsidian.Setting(createIndexDetails)
-        .setName("Show aliases of notes in index")
-        .setDesc("Show the aliases of each note in brackets.\n✅ = yes, ❌ = no.")
-        .addToggle((toggle) => toggle.setValue(settings.aliasesInIndex).onChange(async (value) => {
-        settings.aliasesInIndex = value;
-        await plugin.saveSettings();
-    }));
-}
+  /** Used to detect bad signed hexadecimal string values. */
+  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
 
-function addCSVSettings(plugin, alternativeHierarchyDetails) {
-    const { settings } = plugin;
-    const csvDetails = subDetails("CSV Notes", alternativeHierarchyDetails);
-    new obsidian.Setting(csvDetails)
-        .setName("CSV Breadcrumb Paths")
-        .setDesc("The file path of a csv files with breadcrumbs information.")
-        .addText((text) => {
-        text.setValue(settings.CSVPaths);
-        text.inputEl.onblur = async () => {
-            settings.CSVPaths = text.inputEl.value;
-            await plugin.saveSettings();
-        };
-    });
-}
+  /** Used to detect binary string values. */
+  var reIsBinary = /^0b[01]+$/i;
 
-function addDebuggingsSettings(plugin, containerEl) {
-    const { settings } = plugin;
-    const debugDetails = details("Debugging", containerEl);
-    new obsidian.Setting(debugDetails)
-        .setName("Debug Mode")
-        .setDesc(fragWithHTML("Set the minimum level of debug messages to console log. If you choose <code>TRACE</code>, then everything will be logged. If you choose <code>ERROR</code>, then only the most necessary issues will be logged. <code>SILENT</code> will turn off all logs."))
-        .addDropdown((dd) => {
-        Object.keys(loglevel.levels).forEach((key) => dd.addOption(key, key));
-        dd.setValue(settings.debugMode).onChange(async (value) => {
-            loglevel.setLevel(value);
-            settings.debugMode = value;
-            await plugin.saveSettings();
-        });
-    });
-    debugDetails.createEl("button", { text: "Console log settings" }, (el) => {
-        el.addEventListener("click", () => console.log(settings));
-    });
-}
+  /** Used to detect host constructors (Safari). */
+  var reIsHostCtor = /^\[object .+?Constructor\]$/;
 
-function addDendronSettings(plugin, alternativeHierarchyDetails) {
-    const { settings } = plugin;
-    const { userHiers } = settings;
-    const fields = getFields(userHiers);
-    const dendronDetails = subDetails("Dendron Notes", alternativeHierarchyDetails);
-    new obsidian.Setting(dendronDetails)
-        .setName("Add Dendron notes to graph")
-        .setDesc(fragWithHTML("Dendron notes create a hierarchy using note names.</br><code>nmath.algebra</code> is a note about algebra, whose parent is <code>math</code>.</br><code>nmath.calculus.limits</code> is a note about limits whose parent is the note <code>math.calculus</code>, the parent of which is <code>math</code>."))
-        .addToggle((toggle) => toggle.setValue(settings.addDendronNotes).onChange(async (value) => {
-        settings.addDendronNotes = value;
-        await plugin.saveSettings();
-    }));
-    new obsidian.Setting(dendronDetails)
-        .setName("Dendron note delimiter")
-        .setDesc(fragWithHTML("If you choose to use Dendron notes (setting above), which delimiter should Breadcrumbs look for? The default is <code>.</code>."))
-        .addText((text) => {
-        text.setPlaceholder("Delimiter").setValue(settings.dendronNoteDelimiter);
-        text.inputEl.onblur = async () => {
-            const value = text.getValue();
-            if (value) {
-                settings.dendronNoteDelimiter = value;
-                await plugin.saveSettings();
-            }
-            else {
-                new obsidian.Notice(`The delimiter can't be blank`);
-                settings.dendronNoteDelimiter = DEFAULT_SETTINGS.dendronNoteDelimiter;
-                await plugin.saveSettings();
-            }
-        };
-    });
-    new obsidian.Setting(dendronDetails)
-        .setName("Trim Dendron Note Names")
-        .setDesc(fragWithHTML("When displaying a dendron note name, should it be trimmed to only show the last item in the chain?</br>e.g. <code>A.B.C</code> would be trimmed to only display <code>C</code>."))
-        .addToggle((toggle) => toggle.setValue(settings.trimDendronNotes).onChange(async (value) => {
-        settings.trimDendronNotes = value;
-        await plugin.saveSettings();
-        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
-    }));
-    new obsidian.Setting(dendronDetails)
-        .setName("Dendron Note Field")
-        .setDesc("Which field should Breadcrumbs use for Dendron notes?")
-        .addDropdown((cb) => {
-        fields.forEach((field) => {
-            cb.addOption(field, field);
-        });
-        cb.setValue(settings.dendronNoteField);
-        cb.onChange(async (value) => {
-            settings.dendronNoteField = value;
-            await plugin.saveSettings();
-        });
-    });
-}
+  /** Used to detect octal string values. */
+  var reIsOctal = /^0o[0-7]+$/i;
+
+  /** Used to detect unsigned integer values. */
+  var reIsUint = /^(?:0|[1-9]\d*)$/;
+
+  /** Used to match Latin Unicode letters (excluding mathematical operators). */
+  var reLatin = /[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/g;
+
+  /** Used to ensure capturing order of template delimiters. */
+  var reNoMatch = /($^)/;
+
+  /** Used to match unescaped characters in compiled string literals. */
+  var reUnescapedString = /['\n\r\u2028\u2029\\]/g;
+
+  /** Used to compose unicode character classes. */
+  var rsAstralRange = '\\ud800-\\udfff',
+      rsComboMarksRange = '\\u0300-\\u036f',
+      reComboHalfMarksRange = '\\ufe20-\\ufe2f',
+      rsComboSymbolsRange = '\\u20d0-\\u20ff',
+      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
+      rsDingbatRange = '\\u2700-\\u27bf',
+      rsLowerRange = 'a-z\\xdf-\\xf6\\xf8-\\xff',
+      rsMathOpRange = '\\xac\\xb1\\xd7\\xf7',
+      rsNonCharRange = '\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf',
+      rsPunctuationRange = '\\u2000-\\u206f',
+      rsSpaceRange = ' \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000',
+      rsUpperRange = 'A-Z\\xc0-\\xd6\\xd8-\\xde',
+      rsVarRange = '\\ufe0e\\ufe0f',
+      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;
+
+  /** Used to compose unicode capture groups. */
+  var rsApos = "['\u2019]",
+      rsAstral = '[' + rsAstralRange + ']',
+      rsBreak = '[' + rsBreakRange + ']',
+      rsCombo = '[' + rsComboRange + ']',
+      rsDigits = '\\d+',
+      rsDingbat = '[' + rsDingbatRange + ']',
+      rsLower = '[' + rsLowerRange + ']',
+      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',
+      rsFitz = '\\ud83c[\\udffb-\\udfff]',
+      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',
+      rsNonAstral = '[^' + rsAstralRange + ']',
+      rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}',
+      rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]',
+      rsUpper = '[' + rsUpperRange + ']',
+      rsZWJ = '\\u200d';
+
+  /** Used to compose unicode regexes. */
+  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',
+      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',
+      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',
+      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',
+      reOptMod = rsModifier + '?',
+      rsOptVar = '[' + rsVarRange + ']?',
+      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
+      rsOrdLower = '\\d*(?:1st|2nd|3rd|(?![123])\\dth)(?=\\b|[A-Z_])',
+      rsOrdUpper = '\\d*(?:1ST|2ND|3RD|(?![123])\\dTH)(?=\\b|[a-z_])',
+      rsSeq = rsOptVar + reOptMod + rsOptJoin,
+      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,
+      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';
 
-async function getCSVRows(plugin) {
-    const { CSVPaths } = plugin.settings;
-    const CSVRows = [];
-    if (CSVPaths === "")
-        return CSVRows;
-    const fullPath = obsidian.normalizePath(CSVPaths);
-    const content = await plugin.app.vault.adapter.read(fullPath);
-    const lines = content.split("\n");
-    const headers = lines[0].split(",").map((head) => head.trim());
-    lines.slice(1).forEach((row) => {
-        const rowObj = {};
-        row
-            .split(",")
-            .map((head) => dropWikilinks(head.trim()))
-            .forEach((item, i) => {
-            rowObj[headers[i]] = item;
-        });
-        loglevel.debug({ rowObj });
-        CSVRows.push(rowObj);
-    });
-    return CSVRows;
-}
-function addCSVCrumbs(g, CSVRows, dir, field) {
-    CSVRows.forEach((row) => {
-        addNodesIfNot(g, [row.file]);
-        if (field === "" || !row[field])
-            return;
-        addNodesIfNot(g, [row[field]]);
-        addEdgeIfNot(g, row.file, row[field], { dir, field });
-    });
-}
+  /** Used to match apostrophes. */
+  var reApos = RegExp(rsApos, 'g');
 
-function addDendronNotesToGraph(plugin, frontms, mainG) {
-    const { settings } = plugin;
-    const { addDendronNotes, dendronNoteDelimiter, dendronNoteField } = settings;
-    if (!addDendronNotes)
-        return;
-    for (const frontm of frontms) {
-        // Doesn't currently work yet
-        if (frontm[BC_IGNORE_DENDRON])
-            continue;
-        const basename = getDVBasename(frontm.file);
-        const splits = basename.split(dendronNoteDelimiter);
-        if (splits.length <= 1)
-            continue;
-        const nextSlice = splits.slice(0, -1).join(dendronNoteDelimiter);
-        if (!nextSlice)
-            continue;
-        const nextSliceFile = frontms.find((fm) => getDVBasename(fm.file) === nextSlice);
-        if (!nextSliceFile || nextSliceFile[BC_IGNORE_DENDRON])
-            continue;
-        const sourceOrder = getSourceOrder(frontm);
-        const targetOrder = getTargetOrder(frontms, nextSlice);
-        populateMain(settings, mainG, basename, dendronNoteField, nextSlice, sourceOrder, targetOrder, true);
-    }
-}
+  /**
+   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and
+   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).
+   */
+  var reComboMark = RegExp(rsCombo, 'g');
 
-const getSubsFromFolder = (folder) => {
-    const otherNotes = [], subFolders = [];
-    folder.children.forEach((tAbstract) => {
-        if (tAbstract instanceof obsidian.TFile) {
-            otherNotes.push(tAbstract);
-        }
-        else
-            subFolders.push(tAbstract);
-    });
-    return { otherNotes, subFolders };
-};
-function addFolderNotesToGraph(plugin, folderNotes, frontms, mainG) {
-    const { settings, app } = plugin;
-    const { userHiers } = settings;
-    const fields = getFields(userHiers);
-    folderNotes.forEach((altFile) => {
-        const { file } = altFile;
-        const basename = getDVBasename(file);
-        const topFolderName = getFolderName(file);
-        const topFolder = app.vault.getAbstractFileByPath(topFolderName);
-        const targets = frontms
-            .map((ff) => ff.file)
-            .filter((other) => getFolderName(other) === topFolderName && other.path !== file.path)
-            .map(getDVBasename);
-        const field = altFile[BC_FOLDER_NOTE];
-        if (typeof field !== "string" || !fields.includes(field))
-            return;
-        targets.forEach((target) => {
-            // This is getting the order of the folder note, not the source pointing up to it
-            const sourceOrder = getSourceOrder(altFile);
-            const targetOrder = getTargetOrder(frontms, basename);
-            populateMain(settings, mainG, basename, field, target, sourceOrder, targetOrder, true);
-        });
-        if (altFile[BC_FOLDER_NOTE_RECURSIVE]) {
-            const { subFolders } = getSubsFromFolder(topFolder);
-            const folderQueue = [...subFolders];
-            console.log({ startingQueue: folderQueue.slice() });
-            let currFolder = folderQueue.shift();
-            while (currFolder !== undefined) {
-                const { otherNotes, subFolders } = getSubsFromFolder(currFolder);
-                const folderNote = currFolder.name;
-                const targets = otherNotes.map(getDVBasename);
-                // if (!isInVault(app, folderNote, folderNote)) continue;
-                const sourceOrder = 9999; // getSourceOrder(altFile);
-                const targetOrder = 9999; //  getTargetOrder(frontms, basename);
-                const parentFolderNote = currFolder.parent.name;
-                populateMain(settings, mainG, parentFolderNote, field, folderNote, sourceOrder, targetOrder, true);
-                targets.forEach((target) => {
-                    if (target === folderNote)
-                        return;
-                    console.log("adding", folderNote, "→", target);
-                    const sourceOrder = 9999; // getSourceOrder(altFile);
-                    const targetOrder = 9999; //  getTargetOrder(frontms, basename);
-                    populateMain(settings, mainG, folderNote, field, target, sourceOrder, targetOrder, true);
-                });
-                folderQueue.push(...subFolders);
-                currFolder = folderQueue.shift();
-            }
-        }
-        // First add otherNotes to graph
-        // Then iterate subFolders doing the same
-    });
-}
+  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
+  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');
 
-async function getHierarchyNoteItems(plugin, file) {
-    const { userHiers } = plugin.settings;
-    const { listItems } = plugin.app.metadataCache.getFileCache(file);
-    if (!listItems)
-        return [];
-    const lines = (await plugin.app.vault.cachedRead(file)).split("\n");
-    const hierarchyNoteItems = [];
-    const afterBulletReg = new RegExp(/\s*[+*-]\s(.*$)/);
-    const dropWikiLinksReg = new RegExp(/\[\[(.*?)\]\]/);
-    const fieldReg = new RegExp(/(.*?)\[\[.*?\]\]/);
-    const problemFields = [];
-    const upFields = getFields(userHiers, "up");
-    for (const item of listItems) {
-        const currItem = lines[item.position.start.line];
-        const afterBulletCurr = afterBulletReg.exec(currItem)[1];
-        const note = dropWikiLinksReg.exec(afterBulletCurr)[1];
-        let field = fieldReg.exec(afterBulletCurr)[1].trim() || null;
-        // Ensure fieldName is one of the existing up fields. `null` if not
-        if (field !== null && !upFields.includes(field)) {
-            problemFields.push(field);
-            field = null;
-        }
-        const { parent } = item;
-        if (parent >= 0) {
-            const parentNote = lines[parent];
-            const afterBulletParent = afterBulletReg.exec(parentNote)[1];
-            const dropWikiParent = dropWikiLinksReg.exec(afterBulletParent)[1];
-            hierarchyNoteItems.push({
-                note,
-                parent: dropWikiParent,
-                field,
-            });
-        }
-        else {
-            hierarchyNoteItems.push({
-                note,
-                parent: null,
-                field,
-            });
-        }
-    }
-    if (problemFields.length > 0) {
-        const msg = `'${problemFields.join(", ")}' is/are not a field in any of your hierarchies, but is/are being used in: '${file.basename}'`;
-        new obsidian.Notice(msg);
-        console.log(msg, { problemFields });
-    }
-    return hierarchyNoteItems;
-}
-function addHNsToGraph(settings, hnArr, mainG) {
-    const { HNUpField, userHiers } = settings;
-    const upFields = getFields(userHiers, "up");
-    hnArr.forEach((hnItem, i) => {
-        var _a, _b;
-        const { note, field, parent } = hnItem;
-        const upField = field !== null && field !== void 0 ? field : (HNUpField || upFields[0]);
-        const downField = (_a = getOppFields(userHiers, upField)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(upField, "up");
-        if (parent === null) {
-            const s = note;
-            const t = (_b = hnArr[i + 1]) === null || _b === void 0 ? void 0 : _b.note;
-            addNodesIfNot(mainG, [s, t]);
-            addEdgeIfNot(mainG, s, t, { dir: "down", field: downField });
-        }
-        else {
-            addNodesIfNot(mainG, [note, parent]);
-            addEdgeIfNot(mainG, note, parent, {
-                dir: "up",
-                field: upField,
-            });
-            // I don't think this needs to be done if the reverse is done above
-            addNodesIfNot(mainG, [parent, note]);
-            addEdgeIfNot(mainG, parent, note, {
-                dir: "down",
-                field: downField,
-            });
-        }
-    });
-}
+  /** Used to match complex or compound words. */
+  var reUnicodeWord = RegExp([
+    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',
+    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',
+    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,
+    rsUpper + '+' + rsOptContrUpper,
+    rsOrdUpper,
+    rsOrdLower,
+    rsDigits,
+    rsEmoji
+  ].join('|'), 'g');
+
+  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
+  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');
+
+  /** Used to detect strings that need a more robust regexp to match words. */
+  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;
+
+  /** Used to assign default `context` object properties. */
+  var contextProps = [
+    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',
+    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',
+    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',
+    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',
+    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'
+  ];
+
+  /** Used to make template sourceURLs easier to identify. */
+  var templateCounter = -1;
+
+  /** Used to identify `toStringTag` values of typed arrays. */
+  var typedArrayTags = {};
+  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
+  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
+  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
+  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
+  typedArrayTags[uint32Tag] = true;
+  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =
+  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
+  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =
+  typedArrayTags[errorTag] = typedArrayTags[funcTag] =
+  typedArrayTags[mapTag] = typedArrayTags[numberTag] =
+  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =
+  typedArrayTags[setTag] = typedArrayTags[stringTag] =
+  typedArrayTags[weakMapTag] = false;
 
-const CAT_DANGLING = 'dangling';
-const CORE_STORE_ID = 'core';
-class VizId {
-    constructor(id, storeId) {
-        this.id = id;
-        this.storeId = storeId;
-    }
-    toString() {
-        return `${this.storeId}:${this.id}`;
-    }
-    toId() {
-        return this.toString();
-    }
-    static fromId(id) {
-        const split = id.split(':');
-        const storeId = split[0];
-        const _id = split.slice(1).join(':');
-        return new VizId(_id, storeId);
-    }
-    static fromNode(node) {
-        return VizId.fromId(node.id());
-    }
-    static fromNodes(nodes) {
-        return nodes.map((n) => VizId.fromNode(n));
-    }
-    static fromFile(file) {
-        return new VizId(file.name, 'core');
-    }
-    static toId(id, storeId) {
-        return new VizId(id, storeId).toId();
-    }
-}
-const _parseTags = function (tags) {
-    return [].concat(...tags
-        .map((tag) => {
-        tag = tag.slice(1);
-        const hSplit = tag.split('/');
-        const tags = [];
-        for (const i in hSplit) {
-            const hTag = hSplit.slice(0, parseInt(i) + 1).join('-');
-            tags.push(`tag-${hTag}`);
-        }
-        return tags;
-    }));
-};
-const getClasses = function (file, metadataCache) {
-    if (file) {
-        const classes = [];
-        if (['png', 'jpg', 'jpeg', 'gif', 'bmp', 'svg', 'tiff'].contains(file.extension)) {
-            classes.push('image');
-        }
-        else if (['mp3', 'webm', 'wav', 'm4a', 'ogg', '3gp', 'flac'].contains(file.extension)) {
-            classes.push('audio');
-        }
-        else if (['mp4', 'webm', 'ogv'].contains(file.extension)) {
-            classes.push('video');
-        }
-        else if (file.extension === 'pdf') {
-            classes.push('pdf');
-        }
-        // This is replaced by the 'path' data attribute.
-        // if (!(file.parent.name === '/' || file.parent.name === '')) {
-        //   classes.push(`folder-${file.parent.name
-        //       .replace(' ', '_')}`);
-        // } else {
-        //   classes.push('root');
-        // }
-        if (file.extension === 'md') {
-            classes.push('note');
-            const cache = metadataCache.getFileCache(file);
-            if (cache?.frontmatter) {
-                if ('image' in cache.frontmatter) {
-                    classes.push('image');
-                }
-                if ('tags' in cache.frontmatter) {
-                    const tags = obsidian.parseFrontMatterTags(cache.frontmatter);
-                    if (tags) {
-                        classes.push(..._parseTags(tags));
-                    }
-                }
-                if ('cssclass' in cache.frontmatter) {
-                    const clazzes = obsidian.parseFrontMatterStringArray(cache.frontmatter, 'cssclass');
-                    if (clazzes) {
-                        classes.push(...clazzes);
-                    }
-                }
-            }
-            if (cache?.tags) {
-                classes.push(..._parseTags(cache.tags.map((t) => t.tag)));
-            }
-        }
-        else {
-            classes.push('file');
-        }
-        return classes;
-    }
-    return [CAT_DANGLING];
-};
-const nodeFromFile = async function (file, plugin, settings, id) {
-    if (!id) {
-        id = VizId.toId(file.name, CORE_STORE_ID);
-    }
-    const cache = plugin.app.metadataCache.getFileCache(file);
-    const name = file.extension === 'md' ? file.basename : file.name;
-    const classes = getClasses(file, plugin.app.metadataCache).join(' ');
-    const data = {
-        id,
-        name,
-        path: file.path,
-    };
-    if (['png', 'jpg', 'jpeg', 'gif', 'bmp', 'svg', 'tiff'].contains(file.extension)) {
-        try {
-            // @ts-ignore
-            data['resource_url'] = `http://localhost:${plugin.settings.imgServerPort}/${encodeURI(file.path)}`;
-        }
-        catch { }
-    }
-    if (settings.readContent && file.extension == 'md') {
-        data['content'] = await plugin.app.vault.cachedRead(file);
-    }
-    const frontmatter = cache?.frontmatter;
-    if (frontmatter) {
-        Object.keys(frontmatter).forEach((k) => {
-            if (!(k === 'position')) {
-                if (k === 'image') {
-                    const imageField = frontmatter[k];
-                    try {
-                        // Check if url. throws error otherwise
-                        new URL(imageField);
-                        data[k] = imageField;
-                    }
-                    catch {
-                        try {
-                            // @ts-ignore
-                            data[k] = `http://localhost:${plugin.settings.imgServerPort}/${encodeURI(imageField)}`;
-                        }
-                        catch { }
-                    }
-                }
-                else {
-                    data[k] = frontmatter[k];
-                }
-            }
-        });
-    }
-    return {
-        group: 'nodes',
-        data: data,
-        classes: classes,
-    };
-};
-const nodeDangling = function (path) {
-    return {
-        group: 'nodes',
-        data: {
-            id: VizId.toId(path, CORE_STORE_ID),
-            name: path,
-        },
-        classes: 'dangling',
-    };
-};
-const wikilinkRegex = '\\[\\[([^\\]\\r\\n]+?)\\]\\]';
-const nameRegex = '[^\\W\\d]\\w*';
-const regexEscape = function (str) {
-    return str.replace(/[-\/\\^$*+?.()|[\]{}]/g, '\\$&');
-};
-const parseTypedLink = function (link, line, typedLinkPrefix) {
-    // TODO: This is something specific I use, but shouldn't keep being in this repo.
-    const regexPublishedIn = new RegExp(`^${regexEscape(typedLinkPrefix)} (publishedIn) (\\d\\d\\d\\d) (${wikilinkRegex},? *)+$`);
-    const matchPI = regexPublishedIn.exec(line);
-    if (!(matchPI === null)) {
-        return {
-            class: 'type-publishedIn',
-            isInline: false,
-            properties: {
-                year: matchPI[2],
-                context: '',
-                type: 'publishedIn',
-            },
-        };
-    }
-    // Intuition: Start with the typed link prefix. Then a neo4j name (nameRegex).
-    // Then one or more of the wikilink group: wikilink regex separated by optional comma and multiple spaces
-    const regex = new RegExp(`^${regexEscape(typedLinkPrefix)} (${nameRegex}) (${wikilinkRegex},? *)+$`);
-    const match = regex.exec(line);
-    const splitLink = link.original.split('|');
-    let alias = null;
-    if (splitLink.length > 1) {
-        alias = splitLink.slice(1).join().slice(0, -2);
-    }
-    if (!(match === null)) {
-        return {
-            class: `type-${match[1]}`,
-            isInline: false,
-            properties: {
-                alias: alias,
-                context: '',
-                type: match[1],
-            },
-        };
-    }
-    return null;
-};
+  /** Used to identify `toStringTag` values supported by `_.clone`. */
+  var cloneableTags = {};
+  cloneableTags[argsTag] = cloneableTags[arrayTag] =
+  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =
+  cloneableTags[boolTag] = cloneableTags[dateTag] =
+  cloneableTags[float32Tag] = cloneableTags[float64Tag] =
+  cloneableTags[int8Tag] = cloneableTags[int16Tag] =
+  cloneableTags[int32Tag] = cloneableTags[mapTag] =
+  cloneableTags[numberTag] = cloneableTags[objectTag] =
+  cloneableTags[regexpTag] = cloneableTags[setTag] =
+  cloneableTags[stringTag] = cloneableTags[symbolTag] =
+  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
+  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
+  cloneableTags[errorTag] = cloneableTags[funcTag] =
+  cloneableTags[weakMapTag] = false;
+
+  /** Used to map Latin Unicode letters to basic Latin letters. */
+  var deburredLetters = {
+    // Latin-1 Supplement block.
+    '\xc0': 'A',  '\xc1': 'A', '\xc2': 'A', '\xc3': 'A', '\xc4': 'A', '\xc5': 'A',
+    '\xe0': 'a',  '\xe1': 'a', '\xe2': 'a', '\xe3': 'a', '\xe4': 'a', '\xe5': 'a',
+    '\xc7': 'C',  '\xe7': 'c',
+    '\xd0': 'D',  '\xf0': 'd',
+    '\xc8': 'E',  '\xc9': 'E', '\xca': 'E', '\xcb': 'E',
+    '\xe8': 'e',  '\xe9': 'e', '\xea': 'e', '\xeb': 'e',
+    '\xcc': 'I',  '\xcd': 'I', '\xce': 'I', '\xcf': 'I',
+    '\xec': 'i',  '\xed': 'i', '\xee': 'i', '\xef': 'i',
+    '\xd1': 'N',  '\xf1': 'n',
+    '\xd2': 'O',  '\xd3': 'O', '\xd4': 'O', '\xd5': 'O', '\xd6': 'O', '\xd8': 'O',
+    '\xf2': 'o',  '\xf3': 'o', '\xf4': 'o', '\xf5': 'o', '\xf6': 'o', '\xf8': 'o',
+    '\xd9': 'U',  '\xda': 'U', '\xdb': 'U', '\xdc': 'U',
+    '\xf9': 'u',  '\xfa': 'u', '\xfb': 'u', '\xfc': 'u',
+    '\xdd': 'Y',  '\xfd': 'y', '\xff': 'y',
+    '\xc6': 'Ae', '\xe6': 'ae',
+    '\xde': 'Th', '\xfe': 'th',
+    '\xdf': 'ss',
+    // Latin Extended-A block.
+    '\u0100': 'A',  '\u0102': 'A', '\u0104': 'A',
+    '\u0101': 'a',  '\u0103': 'a', '\u0105': 'a',
+    '\u0106': 'C',  '\u0108': 'C', '\u010a': 'C', '\u010c': 'C',
+    '\u0107': 'c',  '\u0109': 'c', '\u010b': 'c', '\u010d': 'c',
+    '\u010e': 'D',  '\u0110': 'D', '\u010f': 'd', '\u0111': 'd',
+    '\u0112': 'E',  '\u0114': 'E', '\u0116': 'E', '\u0118': 'E', '\u011a': 'E',
+    '\u0113': 'e',  '\u0115': 'e', '\u0117': 'e', '\u0119': 'e', '\u011b': 'e',
+    '\u011c': 'G',  '\u011e': 'G', '\u0120': 'G', '\u0122': 'G',
+    '\u011d': 'g',  '\u011f': 'g', '\u0121': 'g', '\u0123': 'g',
+    '\u0124': 'H',  '\u0126': 'H', '\u0125': 'h', '\u0127': 'h',
+    '\u0128': 'I',  '\u012a': 'I', '\u012c': 'I', '\u012e': 'I', '\u0130': 'I',
+    '\u0129': 'i',  '\u012b': 'i', '\u012d': 'i', '\u012f': 'i', '\u0131': 'i',
+    '\u0134': 'J',  '\u0135': 'j',
+    '\u0136': 'K',  '\u0137': 'k', '\u0138': 'k',
+    '\u0139': 'L',  '\u013b': 'L', '\u013d': 'L', '\u013f': 'L', '\u0141': 'L',
+    '\u013a': 'l',  '\u013c': 'l', '\u013e': 'l', '\u0140': 'l', '\u0142': 'l',
+    '\u0143': 'N',  '\u0145': 'N', '\u0147': 'N', '\u014a': 'N',
+    '\u0144': 'n',  '\u0146': 'n', '\u0148': 'n', '\u014b': 'n',
+    '\u014c': 'O',  '\u014e': 'O', '\u0150': 'O',
+    '\u014d': 'o',  '\u014f': 'o', '\u0151': 'o',
+    '\u0154': 'R',  '\u0156': 'R', '\u0158': 'R',
+    '\u0155': 'r',  '\u0157': 'r', '\u0159': 'r',
+    '\u015a': 'S',  '\u015c': 'S', '\u015e': 'S', '\u0160': 'S',
+    '\u015b': 's',  '\u015d': 's', '\u015f': 's', '\u0161': 's',
+    '\u0162': 'T',  '\u0164': 'T', '\u0166': 'T',
+    '\u0163': 't',  '\u0165': 't', '\u0167': 't',
+    '\u0168': 'U',  '\u016a': 'U', '\u016c': 'U', '\u016e': 'U', '\u0170': 'U', '\u0172': 'U',
+    '\u0169': 'u',  '\u016b': 'u', '\u016d': 'u', '\u016f': 'u', '\u0171': 'u', '\u0173': 'u',
+    '\u0174': 'W',  '\u0175': 'w',
+    '\u0176': 'Y',  '\u0177': 'y', '\u0178': 'Y',
+    '\u0179': 'Z',  '\u017b': 'Z', '\u017d': 'Z',
+    '\u017a': 'z',  '\u017c': 'z', '\u017e': 'z',
+    '\u0132': 'IJ', '\u0133': 'ij',
+    '\u0152': 'Oe', '\u0153': 'oe',
+    '\u0149': "'n", '\u017f': 's'
+  };
 
-const getPlugin = function (app) {
-    // @ts-ignore
-    if ('juggl' in app.plugins.plugins) {
-        // @ts-ignore
-        return app.plugins.plugins['juggl'];
-    }
-    return null;
-};
+  /** Used to map characters to HTML entities. */
+  var htmlEscapes = {
+    '&': '&amp;',
+    '<': '&lt;',
+    '>': '&gt;',
+    '"': '&quot;',
+    "'": '&#39;'
+  };
 
-// TODO I think it'd be better to do this whole thing as an obj instead of JugglLink[]
-// => {[note: string]: {type: string, linksInLine: string[]}[]}
-async function getJugglLinks(plugin, files) {
-    const { settings, app, db } = plugin;
-    db.start2G("getJugglLinks");
-    const { userHiers } = settings;
-    // Add Juggl links
-    const typedLinksArr = await Promise.all(files.map(async (file) => {
-        var _a, _b;
-        const jugglLink = { file, links: [] };
-        // Use Obs metadatacache to get the links in the current file
-        const links = (_b = (_a = app.metadataCache.getFileCache(file)) === null || _a === void 0 ? void 0 : _a.links) !== null && _b !== void 0 ? _b : [];
-        const content = links.length ? await app.vault.cachedRead(file) : "";
-        const lines = content.split("\n");
-        links.forEach((link) => {
-            var _a, _b, _c, _d, _e, _f, _g;
-            const lineNo = link.position.start.line;
-            const line = lines[lineNo];
-            // Check the line for wikilinks, and return an array of link.innerText
-            const linksInLine = (_c = (_b = (_a = line
-                .match(splitLinksRegex)) === null || _a === void 0 ? void 0 : _a.map((link) => link.slice(2, link.length - 2))) === null || _b === void 0 ? void 0 : _b.map((innerText) => innerText.split("|")[0])) !== null && _c !== void 0 ? _c : [];
-            const typedLinkPrefix = (_e = (_d = app.plugins.plugins.juggl) === null || _d === void 0 ? void 0 : _d.settings.typedLinkPrefix) !== null && _e !== void 0 ? _e : "-";
-            const parsedLinks = parseTypedLink(link, line, typedLinkPrefix);
-            const field = (_g = (_f = parsedLinks === null || parsedLinks === void 0 ? void 0 : parsedLinks.properties) === null || _f === void 0 ? void 0 : _f.type) !== null && _g !== void 0 ? _g : "";
-            if (field === "")
-                return;
-            const { fieldDir } = getFieldInfo(userHiers, field) || {};
-            if (!fieldDir)
-                return;
-            jugglLink.links.push({
-                dir: fieldDir,
-                field,
-                linksInLine,
-            });
-        });
-        return jugglLink;
-    }));
-    const allFields = getFields(userHiers);
-    const filteredLinks = typedLinksArr.map((jugglLink) => {
-        // Filter out links whose type is not in allFields
-        jugglLink.links = jugglLink.links.filter((link) => allFields.includes(link.field));
-        return jugglLink;
-    });
-    db.end2G({ filteredLinks });
-    return filteredLinks;
-}
-function addJugglLinksToGraph(settings, jugglLinks, frontms, mainG) {
-    jugglLinks.forEach((jugglLink) => {
-        const { basename } = jugglLink.file;
-        jugglLink.links.forEach((link) => {
-            const { dir, field, linksInLine } = link;
-            if (dir === "")
-                return;
-            const sourceOrder = getTargetOrder(frontms, basename);
-            linksInLine.forEach((linkInLine) => {
-                // Is this a bug? Why not `getSourceOrder`?
-                const targetsOrder = getTargetOrder(frontms, linkInLine);
-                populateMain(settings, mainG, basename, field, linkInLine, sourceOrder, targetsOrder);
-            });
-        });
-    });
-}
+  /** Used to map HTML entities to characters. */
+  var htmlUnescapes = {
+    '&amp;': '&',
+    '&lt;': '<',
+    '&gt;': '>',
+    '&quot;': '"',
+    '&#39;': "'"
+  };
 
-function addLinkNotesToGraph(plugin, eligableAlts, frontms, mainG) {
-    const { app, settings } = plugin;
-    const { userHiers } = settings;
-    eligableAlts.forEach((altFile) => {
-        var _a, _b, _c, _d;
-        const linkNoteFile = altFile.file;
-        const linkNoteBasename = getDVBasename(linkNoteFile);
-        let field = altFile[BC_LINK_NOTE];
-        if (typeof field !== "string" || !getFields(userHiers).includes(field))
-            return;
-        const links = (_b = (_a = app.metadataCache
-            .getFileCache(linkNoteFile)) === null || _a === void 0 ? void 0 : _a.links) === null || _b === void 0 ? void 0 : _b.map((l) => l.link.match(/[^#|]+/)[0]);
-        const embeds = (_d = (_c = app.metadataCache
-            .getFileCache(linkNoteFile)) === null || _c === void 0 ? void 0 : _c.embeds) === null || _d === void 0 ? void 0 : _d.map((l) => l.link.match(/[^#|]+/)[0]);
-        const targets = [...(links !== null && links !== void 0 ? links : []), ...(embeds !== null && embeds !== void 0 ? embeds : [])];
-        for (const target of targets) {
-            const sourceOrder = getSourceOrder(altFile);
-            const targetOrder = getTargetOrder(frontms, linkNoteBasename);
-            populateMain(settings, mainG, linkNoteBasename, field, target, sourceOrder, targetOrder, true);
-        }
-    });
-}
+  /** Used to escape characters for inclusion in compiled string literals. */
+  var stringEscapes = {
+    '\\': '\\',
+    "'": "'",
+    '\n': 'n',
+    '\r': 'r',
+    '\u2028': 'u2028',
+    '\u2029': 'u2029'
+  };
 
-function addRegexNotesToGraph(plugin, eligableAlts, frontms, mainG) {
-    const { settings } = plugin;
-    const { userHiers, regexNoteField } = settings;
-    const fields = getFields(userHiers);
-    eligableAlts.forEach((altFile) => {
-        const regexNoteFile = altFile.file;
-        const regexNoteBasename = getDVBasename(regexNoteFile);
-        const regex = strToRegex(altFile[BC_REGEX_NOTE]);
-        loglevel.info({ regex });
-        let field = altFile[BC_REGEX_NOTE_FIELD];
-        if (typeof field !== "string" || !fields.includes(field))
-            field = regexNoteField || fields[0];
-        const targets = [];
-        frontms.forEach((page) => {
-            const basename = getDVBasename(page.file);
-            if (basename !== regexNoteBasename && regex.test(basename))
-                targets.push(basename);
-        });
-        for (const target of targets) {
-            const sourceOrder = getSourceOrder(altFile);
-            const targetOrder = getTargetOrder(frontms, regexNoteBasename);
-            populateMain(settings, mainG, regexNoteBasename, field, target, sourceOrder, targetOrder, true);
-        }
-    });
-}
+  /** Built-in method references without a dependency on `root`. */
+  var freeParseFloat = parseFloat,
+      freeParseInt = parseInt;
 
-const getAllTags = (app, file, withHash = true) => {
-    var _a, _b;
-    const { tags, frontmatter } = app.metadataCache.getFileCache(file);
-    const allTags = [];
-    tags === null || tags === void 0 ? void 0 : tags.forEach((t) => allTags.push(dropHash(t.tag)));
-    [(_a = frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter.tags) !== null && _a !== void 0 ? _a : []].flat().forEach((t) => {
-        splitAndTrim(t).forEach((innerT) => allTags.push(dropHash(innerT)));
-    });
-    [(_b = frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter.tag) !== null && _b !== void 0 ? _b : []].flat().forEach((t) => {
-        splitAndTrim(t).forEach((innerT) => allTags.push(dropHash(innerT)));
-    });
-    return allTags.map((t) => (withHash ? "#" : "") + t.toLowerCase());
-};
-function addTagNotesToGraph(plugin, eligableAlts, frontms, mainG) {
-    const { settings, app } = plugin;
-    const { userHiers, tagNoteField } = settings;
-    const fields = getFields(userHiers);
-    eligableAlts.forEach((altFile) => {
-        const tagNoteFile = altFile.file;
-        const tagNoteBasename = getDVBasename(tagNoteFile);
-        const tag = altFile[BC_TAG_NOTE].trim().toLowerCase();
-        if (!tag.startsWith("#"))
-            return;
-        const hasThisTag = (file) => {
-            const allTags = getAllTags(app, file);
-            return altFile[BC_TAG_NOTE_EXACT] !== undefined
-                ? allTags.includes(tag)
-                : allTags.some((t) => t.includes(tag));
-        };
-        const targets = frontms
-            .map((ff) => ff.file)
-            .filter((file) => file.path !== tagNoteFile.path && hasThisTag(file))
-            .map(getDVBasename);
-        let field = altFile[BC_TAG_NOTE_FIELD];
-        if (typeof field !== "string" || !fields.includes(field))
-            field = tagNoteField || fields[0];
-        targets.forEach((target) => {
-            const sourceOrder = getSourceOrder(altFile);
-            const targetOrder = getTargetOrder(frontms, tagNoteBasename);
-            populateMain(settings, mainG, tagNoteBasename, field, target, sourceOrder, targetOrder, true);
-        });
-    });
-}
+  /** Detect free variable `global` from Node.js. */
+  var freeGlobal = typeof commonjsGlobal == 'object' && commonjsGlobal && commonjsGlobal.Object === Object && commonjsGlobal;
 
-function addTraverseNotesToGraph(plugin, traverseNotes, mainG, obsG) {
-    const { settings } = plugin;
-    const { userHiers } = settings;
-    traverseNotes.forEach((altFile) => {
-        const { file } = altFile;
-        const basename = getDVBasename(file);
-        const noCycles = removeCycles(obsG, basename);
-        let field = altFile[BC_TRAVERSE_NOTE];
-        if (typeof field !== "string" || !getFields(userHiers).includes(field))
-            return;
-        const allPaths = dfsAllPaths(noCycles, basename);
-        loglevel.info(allPaths);
-        const reversed = [...allPaths].map((path) => path.reverse());
-        reversed.forEach((path) => {
-            path.forEach((node, i) => {
-                const next = path[i + 1];
-                if (next === undefined)
-                    return;
-                populateMain(settings, mainG, node, field, next, 9999, 9999, true);
-            });
-        });
-    });
-}
+  /** Detect free variable `self`. */
+  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;
+
+  /** Used as a reference to the global object. */
+  var root = freeGlobal || freeSelf || Function('return this')();
+
+  /** Detect free variable `exports`. */
+  var freeExports = exports && !exports.nodeType && exports;
+
+  /** Detect free variable `module`. */
+  var freeModule = freeExports && 'object' == 'object' && module && !module.nodeType && module;
+
+  /** Detect the popular CommonJS extension `module.exports`. */
+  var moduleExports = freeModule && freeModule.exports === freeExports;
+
+  /** Detect free variable `process` from Node.js. */
+  var freeProcess = moduleExports && freeGlobal.process;
+
+  /** Used to access faster Node.js helpers. */
+  var nodeUtil = (function() {
+    try {
+      // Use `util.types` for Node.js 10+.
+      var types = freeModule && freeModule.require && freeModule.require('util').types;
 
-/* src\Components\NextPrev.svelte generated by Svelte v3.35.0 */
+      if (types) {
+        return types;
+      }
 
-function add_css$c() {
-	var style = element("style");
-	style.id = "svelte-1cqb0v5-style";
-	style.textContent = ".BC-nexts.svelte-1cqb0v5 div.svelte-1cqb0v5{text-align:right}.BC-right-arrow.svelte-1cqb0v5.svelte-1cqb0v5{padding-left:5px;float:right}.BC-left-arrow.svelte-1cqb0v5.svelte-1cqb0v5{padding-right:5px;float:left}.BC-nexts.svelte-1cqb0v5.svelte-1cqb0v5{border-left:1px solid var(--background-modifier-border)}.BC-prevs.svelte-1cqb0v5.svelte-1cqb0v5{border-right:1px solid var(--background-modifier-border)}.BC-NextPrev-Container.svelte-1cqb0v5.svelte-1cqb0v5{display:grid;grid-template-columns:1fr 1fr}";
-	append(document.head, style);
-}
+      // Legacy `process.binding('util')` for Node.js < 10.
+      return freeProcess && freeProcess.binding && freeProcess.binding('util');
+    } catch (e) {}
+  }());
 
-function get_each_context$b(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[6] = list[i];
-	return child_ctx;
-}
+  /* Node.js helper references. */
+  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,
+      nodeIsDate = nodeUtil && nodeUtil.isDate,
+      nodeIsMap = nodeUtil && nodeUtil.isMap,
+      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,
+      nodeIsSet = nodeUtil && nodeUtil.isSet,
+      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;
 
-function get_each_context_1$8(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[9] = list[i];
-	return child_ctx;
-}
+  /*--------------------------------------------------------------------------*/
 
-// (15:6) {#each prev as p}
-function create_each_block_1$8(ctx) {
-	let div;
-	let strong;
-	let t0_value = /*p*/ ctx[9].field + "";
-	let t0;
-	let t1;
-	let t2_value = /*p*/ ctx[9].to + "";
-	let t2;
-	let t3;
-	let div_class_value;
-	let mounted;
-	let dispose;
+  /**
+   * A faster alternative to `Function#apply`, this function invokes `func`
+   * with the `this` binding of `thisArg` and the arguments of `args`.
+   *
+   * @private
+   * @param {Function} func The function to invoke.
+   * @param {*} thisArg The `this` binding of `func`.
+   * @param {Array} args The arguments to invoke `func` with.
+   * @returns {*} Returns the result of `func`.
+   */
+  function apply(func, thisArg, args) {
+    switch (args.length) {
+      case 0: return func.call(thisArg);
+      case 1: return func.call(thisArg, args[0]);
+      case 2: return func.call(thisArg, args[0], args[1]);
+      case 3: return func.call(thisArg, args[0], args[1], args[2]);
+    }
+    return func.apply(thisArg, args);
+  }
 
-	function click_handler(...args) {
-		return /*click_handler*/ ctx[4](/*p*/ ctx[9], ...args);
-	}
+  /**
+   * A specialized version of `baseAggregator` for arrays.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} setter The function to set `accumulator` values.
+   * @param {Function} iteratee The iteratee to transform keys.
+   * @param {Object} accumulator The initial aggregated object.
+   * @returns {Function} Returns `accumulator`.
+   */
+  function arrayAggregator(array, setter, iteratee, accumulator) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
 
-	return {
-		c() {
-			div = element("div");
-			strong = element("strong");
-			t0 = text(t0_value);
-			t1 = space();
-			t2 = text(t2_value);
-			t3 = space();
-			attr(div, "class", div_class_value = "" + (null_to_empty(linkClass(/*app*/ ctx[0], /*p*/ ctx[9].to, /*p*/ ctx[9].real)) + " svelte-1cqb0v5"));
-		},
-		m(target, anchor) {
-			insert(target, div, anchor);
-			append(div, strong);
-			append(strong, t0);
-			append(div, t1);
-			append(div, t2);
-			append(div, t3);
+    while (++index < length) {
+      var value = array[index];
+      setter(accumulator, value, iteratee(value), array);
+    }
+    return accumulator;
+  }
 
-			if (!mounted) {
-				dispose = listen(div, "click", click_handler);
-				mounted = true;
-			}
-		},
-		p(new_ctx, dirty) {
-			ctx = new_ctx;
-			if (dirty & /*prev*/ 4 && t0_value !== (t0_value = /*p*/ ctx[9].field + "")) set_data(t0, t0_value);
-			if (dirty & /*prev*/ 4 && t2_value !== (t2_value = /*p*/ ctx[9].to + "")) set_data(t2, t2_value);
+  /**
+   * A specialized version of `_.forEach` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {Array} Returns `array`.
+   */
+  function arrayEach(array, iteratee) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
 
-			if (dirty & /*app, prev*/ 5 && div_class_value !== (div_class_value = "" + (null_to_empty(linkClass(/*app*/ ctx[0], /*p*/ ctx[9].to, /*p*/ ctx[9].real)) + " svelte-1cqb0v5"))) {
-				attr(div, "class", div_class_value);
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(div);
-			mounted = false;
-			dispose();
-		}
-	};
-}
+    while (++index < length) {
+      if (iteratee(array[index], index, array) === false) {
+        break;
+      }
+    }
+    return array;
+  }
 
-// (28:6) {#each next as n}
-function create_each_block$b(ctx) {
-	let div;
-	let t0_value = /*n*/ ctx[6].to + "";
-	let t0;
-	let t1;
-	let strong;
-	let t2_value = /*n*/ ctx[6].field + "";
-	let t2;
-	let t3;
-	let div_class_value;
-	let mounted;
-	let dispose;
+  /**
+   * A specialized version of `_.forEachRight` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {Array} Returns `array`.
+   */
+  function arrayEachRight(array, iteratee) {
+    var length = array == null ? 0 : array.length;
 
-	function click_handler_1(...args) {
-		return /*click_handler_1*/ ctx[5](/*n*/ ctx[6], ...args);
-	}
+    while (length--) {
+      if (iteratee(array[length], length, array) === false) {
+        break;
+      }
+    }
+    return array;
+  }
 
-	return {
-		c() {
-			div = element("div");
-			t0 = text(t0_value);
-			t1 = space();
-			strong = element("strong");
-			t2 = text(t2_value);
-			t3 = space();
-			attr(div, "class", div_class_value = "" + (linkClass(/*app*/ ctx[0], /*n*/ ctx[6].to, /*n*/ ctx[6].real) + " BC-next" + " svelte-1cqb0v5"));
-		},
-		m(target, anchor) {
-			insert(target, div, anchor);
-			append(div, t0);
-			append(div, t1);
-			append(div, strong);
-			append(strong, t2);
-			append(div, t3);
+  /**
+   * A specialized version of `_.every` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} predicate The function invoked per iteration.
+   * @returns {boolean} Returns `true` if all elements pass the predicate check,
+   *  else `false`.
+   */
+  function arrayEvery(array, predicate) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
 
-			if (!mounted) {
-				dispose = listen(div, "click", click_handler_1);
-				mounted = true;
-			}
-		},
-		p(new_ctx, dirty) {
-			ctx = new_ctx;
-			if (dirty & /*next*/ 2 && t0_value !== (t0_value = /*n*/ ctx[6].to + "")) set_data(t0, t0_value);
-			if (dirty & /*next*/ 2 && t2_value !== (t2_value = /*n*/ ctx[6].field + "")) set_data(t2, t2_value);
+    while (++index < length) {
+      if (!predicate(array[index], index, array)) {
+        return false;
+      }
+    }
+    return true;
+  }
+
+  /**
+   * A specialized version of `_.filter` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} predicate The function invoked per iteration.
+   * @returns {Array} Returns the new filtered array.
+   */
+  function arrayFilter(array, predicate) {
+    var index = -1,
+        length = array == null ? 0 : array.length,
+        resIndex = 0,
+        result = [];
+
+    while (++index < length) {
+      var value = array[index];
+      if (predicate(value, index, array)) {
+        result[resIndex++] = value;
+      }
+    }
+    return result;
+  }
+
+  /**
+   * A specialized version of `_.includes` for arrays without support for
+   * specifying an index to search from.
+   *
+   * @private
+   * @param {Array} [array] The array to inspect.
+   * @param {*} target The value to search for.
+   * @returns {boolean} Returns `true` if `target` is found, else `false`.
+   */
+  function arrayIncludes(array, value) {
+    var length = array == null ? 0 : array.length;
+    return !!length && baseIndexOf(array, value, 0) > -1;
+  }
 
-			if (dirty & /*app, next*/ 3 && div_class_value !== (div_class_value = "" + (linkClass(/*app*/ ctx[0], /*n*/ ctx[6].to, /*n*/ ctx[6].real) + " BC-next" + " svelte-1cqb0v5"))) {
-				attr(div, "class", div_class_value);
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(div);
-			mounted = false;
-			dispose();
-		}
-	};
-}
+  /**
+   * This function is like `arrayIncludes` except that it accepts a comparator.
+   *
+   * @private
+   * @param {Array} [array] The array to inspect.
+   * @param {*} target The value to search for.
+   * @param {Function} comparator The comparator invoked per element.
+   * @returns {boolean} Returns `true` if `target` is found, else `false`.
+   */
+  function arrayIncludesWith(array, value, comparator) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
 
-function create_fragment$k(ctx) {
-	let div2;
-	let div0;
-	let span0;
-	let t;
-	let div1;
-	let span1;
-	let each_value_1 = /*prev*/ ctx[2];
-	let each_blocks_1 = [];
+    while (++index < length) {
+      if (comparator(value, array[index])) {
+        return true;
+      }
+    }
+    return false;
+  }
 
-	for (let i = 0; i < each_value_1.length; i += 1) {
-		each_blocks_1[i] = create_each_block_1$8(get_each_context_1$8(ctx, each_value_1, i));
-	}
+  /**
+   * A specialized version of `_.map` for arrays without support for iteratee
+   * shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {Array} Returns the new mapped array.
+   */
+  function arrayMap(array, iteratee) {
+    var index = -1,
+        length = array == null ? 0 : array.length,
+        result = Array(length);
 
-	let each_value = /*next*/ ctx[1];
-	let each_blocks = [];
+    while (++index < length) {
+      result[index] = iteratee(array[index], index, array);
+    }
+    return result;
+  }
 
-	for (let i = 0; i < each_value.length; i += 1) {
-		each_blocks[i] = create_each_block$b(get_each_context$b(ctx, each_value, i));
-	}
+  /**
+   * Appends the elements of `values` to `array`.
+   *
+   * @private
+   * @param {Array} array The array to modify.
+   * @param {Array} values The values to append.
+   * @returns {Array} Returns `array`.
+   */
+  function arrayPush(array, values) {
+    var index = -1,
+        length = values.length,
+        offset = array.length;
 
-	return {
-		c() {
-			div2 = element("div");
-			div0 = element("div");
-			span0 = element("span");
+    while (++index < length) {
+      array[offset + index] = values[index];
+    }
+    return array;
+  }
 
-			for (let i = 0; i < each_blocks_1.length; i += 1) {
-				each_blocks_1[i].c();
-			}
+  /**
+   * A specialized version of `_.reduce` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @param {*} [accumulator] The initial value.
+   * @param {boolean} [initAccum] Specify using the first element of `array` as
+   *  the initial value.
+   * @returns {*} Returns the accumulated value.
+   */
+  function arrayReduce(array, iteratee, accumulator, initAccum) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
 
-			t = space();
-			div1 = element("div");
-			span1 = element("span");
+    if (initAccum && length) {
+      accumulator = array[++index];
+    }
+    while (++index < length) {
+      accumulator = iteratee(accumulator, array[index], index, array);
+    }
+    return accumulator;
+  }
 
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
+  /**
+   * A specialized version of `_.reduceRight` for arrays without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @param {*} [accumulator] The initial value.
+   * @param {boolean} [initAccum] Specify using the last element of `array` as
+   *  the initial value.
+   * @returns {*} Returns the accumulated value.
+   */
+  function arrayReduceRight(array, iteratee, accumulator, initAccum) {
+    var length = array == null ? 0 : array.length;
+    if (initAccum && length) {
+      accumulator = array[--length];
+    }
+    while (length--) {
+      accumulator = iteratee(accumulator, array[length], length, array);
+    }
+    return accumulator;
+  }
 
-			attr(div0, "class", "BC-prevs svelte-1cqb0v5");
-			attr(div1, "class", "BC-nexts svelte-1cqb0v5");
-			attr(div2, "class", "BC-NextPrev-Container svelte-1cqb0v5");
-		},
-		m(target, anchor) {
-			insert(target, div2, anchor);
-			append(div2, div0);
-			append(div0, span0);
+  /**
+   * A specialized version of `_.some` for arrays without support for iteratee
+   * shorthands.
+   *
+   * @private
+   * @param {Array} [array] The array to iterate over.
+   * @param {Function} predicate The function invoked per iteration.
+   * @returns {boolean} Returns `true` if any element passes the predicate check,
+   *  else `false`.
+   */
+  function arraySome(array, predicate) {
+    var index = -1,
+        length = array == null ? 0 : array.length;
 
-			for (let i = 0; i < each_blocks_1.length; i += 1) {
-				each_blocks_1[i].m(span0, null);
-			}
+    while (++index < length) {
+      if (predicate(array[index], index, array)) {
+        return true;
+      }
+    }
+    return false;
+  }
 
-			append(div2, t);
-			append(div2, div1);
-			append(div1, span1);
+  /**
+   * Gets the size of an ASCII `string`.
+   *
+   * @private
+   * @param {string} string The string inspect.
+   * @returns {number} Returns the string size.
+   */
+  var asciiSize = baseProperty('length');
 
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(span1, null);
-			}
-		},
-		p(ctx, [dirty]) {
-			if (dirty & /*linkClass, app, prev, openOrSwitch*/ 5) {
-				each_value_1 = /*prev*/ ctx[2];
-				let i;
+  /**
+   * Converts an ASCII `string` to an array.
+   *
+   * @private
+   * @param {string} string The string to convert.
+   * @returns {Array} Returns the converted array.
+   */
+  function asciiToArray(string) {
+    return string.split('');
+  }
 
-				for (i = 0; i < each_value_1.length; i += 1) {
-					const child_ctx = get_each_context_1$8(ctx, each_value_1, i);
+  /**
+   * Splits an ASCII `string` into an array of its words.
+   *
+   * @private
+   * @param {string} The string to inspect.
+   * @returns {Array} Returns the words of `string`.
+   */
+  function asciiWords(string) {
+    return string.match(reAsciiWord) || [];
+  }
 
-					if (each_blocks_1[i]) {
-						each_blocks_1[i].p(child_ctx, dirty);
-					} else {
-						each_blocks_1[i] = create_each_block_1$8(child_ctx);
-						each_blocks_1[i].c();
-						each_blocks_1[i].m(span0, null);
-					}
-				}
+  /**
+   * The base implementation of methods like `_.findKey` and `_.findLastKey`,
+   * without support for iteratee shorthands, which iterates over `collection`
+   * using `eachFunc`.
+   *
+   * @private
+   * @param {Array|Object} collection The collection to inspect.
+   * @param {Function} predicate The function invoked per iteration.
+   * @param {Function} eachFunc The function to iterate over `collection`.
+   * @returns {*} Returns the found element or its key, else `undefined`.
+   */
+  function baseFindKey(collection, predicate, eachFunc) {
+    var result;
+    eachFunc(collection, function(value, key, collection) {
+      if (predicate(value, key, collection)) {
+        result = key;
+        return false;
+      }
+    });
+    return result;
+  }
 
-				for (; i < each_blocks_1.length; i += 1) {
-					each_blocks_1[i].d(1);
-				}
+  /**
+   * The base implementation of `_.findIndex` and `_.findLastIndex` without
+   * support for iteratee shorthands.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {Function} predicate The function invoked per iteration.
+   * @param {number} fromIndex The index to search from.
+   * @param {boolean} [fromRight] Specify iterating from right to left.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function baseFindIndex(array, predicate, fromIndex, fromRight) {
+    var length = array.length,
+        index = fromIndex + (fromRight ? 1 : -1);
 
-				each_blocks_1.length = each_value_1.length;
-			}
+    while ((fromRight ? index-- : ++index < length)) {
+      if (predicate(array[index], index, array)) {
+        return index;
+      }
+    }
+    return -1;
+  }
 
-			if (dirty & /*linkClass, app, next, openOrSwitch*/ 3) {
-				each_value = /*next*/ ctx[1];
-				let i;
+  /**
+   * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} value The value to search for.
+   * @param {number} fromIndex The index to search from.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function baseIndexOf(array, value, fromIndex) {
+    return value === value
+      ? strictIndexOf(array, value, fromIndex)
+      : baseFindIndex(array, baseIsNaN, fromIndex);
+  }
 
-				for (i = 0; i < each_value.length; i += 1) {
-					const child_ctx = get_each_context$b(ctx, each_value, i);
+  /**
+   * This function is like `baseIndexOf` except that it accepts a comparator.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} value The value to search for.
+   * @param {number} fromIndex The index to search from.
+   * @param {Function} comparator The comparator invoked per element.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function baseIndexOfWith(array, value, fromIndex, comparator) {
+    var index = fromIndex - 1,
+        length = array.length;
 
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block$b(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(span1, null);
-					}
-				}
+    while (++index < length) {
+      if (comparator(array[index], value)) {
+        return index;
+      }
+    }
+    return -1;
+  }
 
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
+  /**
+   * The base implementation of `_.isNaN` without support for number objects.
+   *
+   * @private
+   * @param {*} value The value to check.
+   * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+   */
+  function baseIsNaN(value) {
+    return value !== value;
+  }
 
-				each_blocks.length = each_value.length;
-			}
-		},
-		i: noop,
-		o: noop,
-		d(detaching) {
-			if (detaching) detach(div2);
-			destroy_each(each_blocks_1, detaching);
-			destroy_each(each_blocks, detaching);
-		}
-	};
-}
+  /**
+   * The base implementation of `_.mean` and `_.meanBy` without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} array The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {number} Returns the mean.
+   */
+  function baseMean(array, iteratee) {
+    var length = array == null ? 0 : array.length;
+    return length ? (baseSum(array, iteratee) / length) : NAN;
+  }
 
-function instance$k($$self, $$props, $$invalidate) {
-	
-	
-	
-	let { app } = $$props;
-	let { plugin } = $$props;
-	let { next } = $$props;
-	let { prev } = $$props;
-	const click_handler = async (p, e) => openOrSwitch(app, p.to, e);
-	const click_handler_1 = async (n, e) => openOrSwitch(app, n.to, e);
+  /**
+   * The base implementation of `_.property` without support for deep paths.
+   *
+   * @private
+   * @param {string} key The key of the property to get.
+   * @returns {Function} Returns the new accessor function.
+   */
+  function baseProperty(key) {
+    return function(object) {
+      return object == null ? undefined$1 : object[key];
+    };
+  }
 
-	$$self.$$set = $$props => {
-		if ("app" in $$props) $$invalidate(0, app = $$props.app);
-		if ("plugin" in $$props) $$invalidate(3, plugin = $$props.plugin);
-		if ("next" in $$props) $$invalidate(1, next = $$props.next);
-		if ("prev" in $$props) $$invalidate(2, prev = $$props.prev);
-	};
+  /**
+   * The base implementation of `_.propertyOf` without support for deep paths.
+   *
+   * @private
+   * @param {Object} object The object to query.
+   * @returns {Function} Returns the new accessor function.
+   */
+  function basePropertyOf(object) {
+    return function(key) {
+      return object == null ? undefined$1 : object[key];
+    };
+  }
 
-	return [app, next, prev, plugin, click_handler, click_handler_1];
-}
+  /**
+   * The base implementation of `_.reduce` and `_.reduceRight`, without support
+   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.
+   *
+   * @private
+   * @param {Array|Object} collection The collection to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @param {*} accumulator The initial value.
+   * @param {boolean} initAccum Specify using the first or last element of
+   *  `collection` as the initial value.
+   * @param {Function} eachFunc The function to iterate over `collection`.
+   * @returns {*} Returns the accumulated value.
+   */
+  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {
+    eachFunc(collection, function(value, index, collection) {
+      accumulator = initAccum
+        ? (initAccum = false, value)
+        : iteratee(accumulator, value, index, collection);
+    });
+    return accumulator;
+  }
 
-class NextPrev extends SvelteComponent {
-	constructor(options) {
-		super();
-		if (!document.getElementById("svelte-1cqb0v5-style")) add_css$c();
-		init(this, options, instance$k, create_fragment$k, safe_not_equal, { app: 0, plugin: 3, next: 1, prev: 2 });
-	}
-}
+  /**
+   * The base implementation of `_.sortBy` which uses `comparer` to define the
+   * sort order of `array` and replaces criteria objects with their corresponding
+   * values.
+   *
+   * @private
+   * @param {Array} array The array to sort.
+   * @param {Function} comparer The function to define sort order.
+   * @returns {Array} Returns `array`.
+   */
+  function baseSortBy(array, comparer) {
+    var length = array.length;
 
-/**
- * @license
- * Lodash <https://lodash.com/>
- * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>
- * Released under MIT license <https://lodash.com/license>
- * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
- * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
- */
+    array.sort(comparer);
+    while (length--) {
+      array[length] = array[length].value;
+    }
+    return array;
+  }
 
-var lodash = createCommonjsModule(function (module, exports) {
-(function() {
+  /**
+   * The base implementation of `_.sum` and `_.sumBy` without support for
+   * iteratee shorthands.
+   *
+   * @private
+   * @param {Array} array The array to iterate over.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {number} Returns the sum.
+   */
+  function baseSum(array, iteratee) {
+    var result,
+        index = -1,
+        length = array.length;
 
-  /** Used as a safe reference for `undefined` in pre-ES5 environments. */
-  var undefined$1;
+    while (++index < length) {
+      var current = iteratee(array[index]);
+      if (current !== undefined$1) {
+        result = result === undefined$1 ? current : (result + current);
+      }
+    }
+    return result;
+  }
 
-  /** Used as the semantic version number. */
-  var VERSION = '4.17.21';
+  /**
+   * The base implementation of `_.times` without support for iteratee shorthands
+   * or max array length checks.
+   *
+   * @private
+   * @param {number} n The number of times to invoke `iteratee`.
+   * @param {Function} iteratee The function invoked per iteration.
+   * @returns {Array} Returns the array of results.
+   */
+  function baseTimes(n, iteratee) {
+    var index = -1,
+        result = Array(n);
 
-  /** Used as the size to enable large array optimizations. */
-  var LARGE_ARRAY_SIZE = 200;
+    while (++index < n) {
+      result[index] = iteratee(index);
+    }
+    return result;
+  }
 
-  /** Error message constants. */
-  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',
-      FUNC_ERROR_TEXT = 'Expected a function',
-      INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';
+  /**
+   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array
+   * of key-value pairs for `object` corresponding to the property names of `props`.
+   *
+   * @private
+   * @param {Object} object The object to query.
+   * @param {Array} props The property names to get values for.
+   * @returns {Object} Returns the key-value pairs.
+   */
+  function baseToPairs(object, props) {
+    return arrayMap(props, function(key) {
+      return [key, object[key]];
+    });
+  }
 
-  /** Used to stand-in for `undefined` hash values. */
-  var HASH_UNDEFINED = '__lodash_hash_undefined__';
+  /**
+   * The base implementation of `_.trim`.
+   *
+   * @private
+   * @param {string} string The string to trim.
+   * @returns {string} Returns the trimmed string.
+   */
+  function baseTrim(string) {
+    return string
+      ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')
+      : string;
+  }
 
-  /** Used as the maximum memoize cache size. */
-  var MAX_MEMOIZE_SIZE = 500;
+  /**
+   * The base implementation of `_.unary` without support for storing metadata.
+   *
+   * @private
+   * @param {Function} func The function to cap arguments for.
+   * @returns {Function} Returns the new capped function.
+   */
+  function baseUnary(func) {
+    return function(value) {
+      return func(value);
+    };
+  }
 
-  /** Used as the internal argument placeholder. */
-  var PLACEHOLDER = '__lodash_placeholder__';
+  /**
+   * The base implementation of `_.values` and `_.valuesIn` which creates an
+   * array of `object` property values corresponding to the property names
+   * of `props`.
+   *
+   * @private
+   * @param {Object} object The object to query.
+   * @param {Array} props The property names to get values for.
+   * @returns {Object} Returns the array of property values.
+   */
+  function baseValues(object, props) {
+    return arrayMap(props, function(key) {
+      return object[key];
+    });
+  }
 
-  /** Used to compose bitmasks for cloning. */
-  var CLONE_DEEP_FLAG = 1,
-      CLONE_FLAT_FLAG = 2,
-      CLONE_SYMBOLS_FLAG = 4;
+  /**
+   * Checks if a `cache` value for `key` exists.
+   *
+   * @private
+   * @param {Object} cache The cache to query.
+   * @param {string} key The key of the entry to check.
+   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+   */
+  function cacheHas(cache, key) {
+    return cache.has(key);
+  }
 
-  /** Used to compose bitmasks for value comparisons. */
-  var COMPARE_PARTIAL_FLAG = 1,
-      COMPARE_UNORDERED_FLAG = 2;
+  /**
+   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol
+   * that is not found in the character symbols.
+   *
+   * @private
+   * @param {Array} strSymbols The string symbols to inspect.
+   * @param {Array} chrSymbols The character symbols to find.
+   * @returns {number} Returns the index of the first unmatched string symbol.
+   */
+  function charsStartIndex(strSymbols, chrSymbols) {
+    var index = -1,
+        length = strSymbols.length;
 
-  /** Used to compose bitmasks for function metadata. */
-  var WRAP_BIND_FLAG = 1,
-      WRAP_BIND_KEY_FLAG = 2,
-      WRAP_CURRY_BOUND_FLAG = 4,
-      WRAP_CURRY_FLAG = 8,
-      WRAP_CURRY_RIGHT_FLAG = 16,
-      WRAP_PARTIAL_FLAG = 32,
-      WRAP_PARTIAL_RIGHT_FLAG = 64,
-      WRAP_ARY_FLAG = 128,
-      WRAP_REARG_FLAG = 256,
-      WRAP_FLIP_FLAG = 512;
+    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
+    return index;
+  }
 
-  /** Used as default options for `_.truncate`. */
-  var DEFAULT_TRUNC_LENGTH = 30,
-      DEFAULT_TRUNC_OMISSION = '...';
+  /**
+   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol
+   * that is not found in the character symbols.
+   *
+   * @private
+   * @param {Array} strSymbols The string symbols to inspect.
+   * @param {Array} chrSymbols The character symbols to find.
+   * @returns {number} Returns the index of the last unmatched string symbol.
+   */
+  function charsEndIndex(strSymbols, chrSymbols) {
+    var index = strSymbols.length;
 
-  /** Used to detect hot functions by number of calls within a span of milliseconds. */
-  var HOT_COUNT = 800,
-      HOT_SPAN = 16;
+    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
+    return index;
+  }
 
-  /** Used to indicate the type of lazy iteratees. */
-  var LAZY_FILTER_FLAG = 1,
-      LAZY_MAP_FLAG = 2,
-      LAZY_WHILE_FLAG = 3;
+  /**
+   * Gets the number of `placeholder` occurrences in `array`.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} placeholder The placeholder to search for.
+   * @returns {number} Returns the placeholder count.
+   */
+  function countHolders(array, placeholder) {
+    var length = array.length,
+        result = 0;
 
-  /** Used as references for various `Number` constants. */
-  var INFINITY = 1 / 0,
-      MAX_SAFE_INTEGER = 9007199254740991,
-      MAX_INTEGER = 1.7976931348623157e+308,
-      NAN = 0 / 0;
+    while (length--) {
+      if (array[length] === placeholder) {
+        ++result;
+      }
+    }
+    return result;
+  }
 
-  /** Used as references for the maximum length and index of an array. */
-  var MAX_ARRAY_LENGTH = 4294967295,
-      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,
-      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
+  /**
+   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A
+   * letters to basic Latin letters.
+   *
+   * @private
+   * @param {string} letter The matched letter to deburr.
+   * @returns {string} Returns the deburred letter.
+   */
+  var deburrLetter = basePropertyOf(deburredLetters);
 
-  /** Used to associate wrap methods with their bit flags. */
-  var wrapFlags = [
-    ['ary', WRAP_ARY_FLAG],
-    ['bind', WRAP_BIND_FLAG],
-    ['bindKey', WRAP_BIND_KEY_FLAG],
-    ['curry', WRAP_CURRY_FLAG],
-    ['curryRight', WRAP_CURRY_RIGHT_FLAG],
-    ['flip', WRAP_FLIP_FLAG],
-    ['partial', WRAP_PARTIAL_FLAG],
-    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],
-    ['rearg', WRAP_REARG_FLAG]
-  ];
+  /**
+   * Used by `_.escape` to convert characters to HTML entities.
+   *
+   * @private
+   * @param {string} chr The matched character to escape.
+   * @returns {string} Returns the escaped character.
+   */
+  var escapeHtmlChar = basePropertyOf(htmlEscapes);
 
-  /** `Object#toString` result references. */
-  var argsTag = '[object Arguments]',
-      arrayTag = '[object Array]',
-      asyncTag = '[object AsyncFunction]',
-      boolTag = '[object Boolean]',
-      dateTag = '[object Date]',
-      domExcTag = '[object DOMException]',
-      errorTag = '[object Error]',
-      funcTag = '[object Function]',
-      genTag = '[object GeneratorFunction]',
-      mapTag = '[object Map]',
-      numberTag = '[object Number]',
-      nullTag = '[object Null]',
-      objectTag = '[object Object]',
-      promiseTag = '[object Promise]',
-      proxyTag = '[object Proxy]',
-      regexpTag = '[object RegExp]',
-      setTag = '[object Set]',
-      stringTag = '[object String]',
-      symbolTag = '[object Symbol]',
-      undefinedTag = '[object Undefined]',
-      weakMapTag = '[object WeakMap]',
-      weakSetTag = '[object WeakSet]';
+  /**
+   * Used by `_.template` to escape characters for inclusion in compiled string literals.
+   *
+   * @private
+   * @param {string} chr The matched character to escape.
+   * @returns {string} Returns the escaped character.
+   */
+  function escapeStringChar(chr) {
+    return '\\' + stringEscapes[chr];
+  }
 
-  var arrayBufferTag = '[object ArrayBuffer]',
-      dataViewTag = '[object DataView]',
-      float32Tag = '[object Float32Array]',
-      float64Tag = '[object Float64Array]',
-      int8Tag = '[object Int8Array]',
-      int16Tag = '[object Int16Array]',
-      int32Tag = '[object Int32Array]',
-      uint8Tag = '[object Uint8Array]',
-      uint8ClampedTag = '[object Uint8ClampedArray]',
-      uint16Tag = '[object Uint16Array]',
-      uint32Tag = '[object Uint32Array]';
+  /**
+   * Gets the value at `key` of `object`.
+   *
+   * @private
+   * @param {Object} [object] The object to query.
+   * @param {string} key The key of the property to get.
+   * @returns {*} Returns the property value.
+   */
+  function getValue(object, key) {
+    return object == null ? undefined$1 : object[key];
+  }
 
-  /** Used to match empty string literals in compiled template source. */
-  var reEmptyStringLeading = /\b__p \+= '';/g,
-      reEmptyStringMiddle = /\b(__p \+=) '' \+/g,
-      reEmptyStringTrailing = /(__e\(.*?\)|\b__t\)) \+\n'';/g;
+  /**
+   * Checks if `string` contains Unicode symbols.
+   *
+   * @private
+   * @param {string} string The string to inspect.
+   * @returns {boolean} Returns `true` if a symbol is found, else `false`.
+   */
+  function hasUnicode(string) {
+    return reHasUnicode.test(string);
+  }
 
-  /** Used to match HTML entities and HTML characters. */
-  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,
-      reUnescapedHtml = /[&<>"']/g,
-      reHasEscapedHtml = RegExp(reEscapedHtml.source),
-      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);
+  /**
+   * Checks if `string` contains a word composed of Unicode symbols.
+   *
+   * @private
+   * @param {string} string The string to inspect.
+   * @returns {boolean} Returns `true` if a word is found, else `false`.
+   */
+  function hasUnicodeWord(string) {
+    return reHasUnicodeWord.test(string);
+  }
 
-  /** Used to match template delimiters. */
-  var reEscape = /<%-([\s\S]+?)%>/g,
-      reEvaluate = /<%([\s\S]+?)%>/g,
-      reInterpolate = /<%=([\s\S]+?)%>/g;
+  /**
+   * Converts `iterator` to an array.
+   *
+   * @private
+   * @param {Object} iterator The iterator to convert.
+   * @returns {Array} Returns the converted array.
+   */
+  function iteratorToArray(iterator) {
+    var data,
+        result = [];
 
-  /** Used to match property names within property paths. */
-  var reIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/,
-      reIsPlainProp = /^\w*$/,
-      rePropName = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g;
+    while (!(data = iterator.next()).done) {
+      result.push(data.value);
+    }
+    return result;
+  }
 
   /**
-   * Used to match `RegExp`
-   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).
+   * Converts `map` to its key-value pairs.
+   *
+   * @private
+   * @param {Object} map The map to convert.
+   * @returns {Array} Returns the key-value pairs.
    */
-  var reRegExpChar = /[\\^$.*+?()[\]{}|]/g,
-      reHasRegExpChar = RegExp(reRegExpChar.source);
+  function mapToArray(map) {
+    var index = -1,
+        result = Array(map.size);
 
-  /** Used to match leading whitespace. */
-  var reTrimStart = /^\s+/;
+    map.forEach(function(value, key) {
+      result[++index] = [key, value];
+    });
+    return result;
+  }
 
-  /** Used to match a single whitespace character. */
-  var reWhitespace = /\s/;
+  /**
+   * Creates a unary function that invokes `func` with its argument transformed.
+   *
+   * @private
+   * @param {Function} func The function to wrap.
+   * @param {Function} transform The argument transform.
+   * @returns {Function} Returns the new function.
+   */
+  function overArg(func, transform) {
+    return function(arg) {
+      return func(transform(arg));
+    };
+  }
 
-  /** Used to match wrap detail comments. */
-  var reWrapComment = /\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/,
-      reWrapDetails = /\{\n\/\* \[wrapped with (.+)\] \*/,
-      reSplitDetails = /,? & /;
+  /**
+   * Replaces all `placeholder` elements in `array` with an internal placeholder
+   * and returns an array of their indexes.
+   *
+   * @private
+   * @param {Array} array The array to modify.
+   * @param {*} placeholder The placeholder to replace.
+   * @returns {Array} Returns the new array of placeholder indexes.
+   */
+  function replaceHolders(array, placeholder) {
+    var index = -1,
+        length = array.length,
+        resIndex = 0,
+        result = [];
 
-  /** Used to match words composed of alphanumeric characters. */
-  var reAsciiWord = /[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g;
+    while (++index < length) {
+      var value = array[index];
+      if (value === placeholder || value === PLACEHOLDER) {
+        array[index] = PLACEHOLDER;
+        result[resIndex++] = index;
+      }
+    }
+    return result;
+  }
 
   /**
-   * Used to validate the `validate` option in `_.template` variable.
+   * Converts `set` to an array of its values.
    *
-   * Forbids characters which could potentially change the meaning of the function argument definition:
-   * - "()," (modification of function parameters)
-   * - "=" (default value)
-   * - "[]{}" (destructuring of function parameters)
-   * - "/" (beginning of a comment)
-   * - whitespace
+   * @private
+   * @param {Object} set The set to convert.
+   * @returns {Array} Returns the values.
    */
-  var reForbiddenIdentifierChars = /[()=,{}\[\]\/\s]/;
+  function setToArray(set) {
+    var index = -1,
+        result = Array(set.size);
 
-  /** Used to match backslashes in property paths. */
-  var reEscapeChar = /\\(\\)?/g;
+    set.forEach(function(value) {
+      result[++index] = value;
+    });
+    return result;
+  }
 
   /**
-   * Used to match
-   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).
+   * Converts `set` to its value-value pairs.
+   *
+   * @private
+   * @param {Object} set The set to convert.
+   * @returns {Array} Returns the value-value pairs.
    */
-  var reEsTemplate = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g;
+  function setToPairs(set) {
+    var index = -1,
+        result = Array(set.size);
 
-  /** Used to match `RegExp` flags from their coerced string values. */
-  var reFlags = /\w*$/;
+    set.forEach(function(value) {
+      result[++index] = [value, value];
+    });
+    return result;
+  }
 
-  /** Used to detect bad signed hexadecimal string values. */
-  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;
+  /**
+   * A specialized version of `_.indexOf` which performs strict equality
+   * comparisons of values, i.e. `===`.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} value The value to search for.
+   * @param {number} fromIndex The index to search from.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function strictIndexOf(array, value, fromIndex) {
+    var index = fromIndex - 1,
+        length = array.length;
 
-  /** Used to detect binary string values. */
-  var reIsBinary = /^0b[01]+$/i;
+    while (++index < length) {
+      if (array[index] === value) {
+        return index;
+      }
+    }
+    return -1;
+  }
 
-  /** Used to detect host constructors (Safari). */
-  var reIsHostCtor = /^\[object .+?Constructor\]$/;
+  /**
+   * A specialized version of `_.lastIndexOf` which performs strict equality
+   * comparisons of values, i.e. `===`.
+   *
+   * @private
+   * @param {Array} array The array to inspect.
+   * @param {*} value The value to search for.
+   * @param {number} fromIndex The index to search from.
+   * @returns {number} Returns the index of the matched value, else `-1`.
+   */
+  function strictLastIndexOf(array, value, fromIndex) {
+    var index = fromIndex + 1;
+    while (index--) {
+      if (array[index] === value) {
+        return index;
+      }
+    }
+    return index;
+  }
 
-  /** Used to detect octal string values. */
-  var reIsOctal = /^0o[0-7]+$/i;
+  /**
+   * Gets the number of symbols in `string`.
+   *
+   * @private
+   * @param {string} string The string to inspect.
+   * @returns {number} Returns the string size.
+   */
+  function stringSize(string) {
+    return hasUnicode(string)
+      ? unicodeSize(string)
+      : asciiSize(string);
+  }
 
-  /** Used to detect unsigned integer values. */
-  var reIsUint = /^(?:0|[1-9]\d*)$/;
+  /**
+   * Converts `string` to an array.
+   *
+   * @private
+   * @param {string} string The string to convert.
+   * @returns {Array} Returns the converted array.
+   */
+  function stringToArray(string) {
+    return hasUnicode(string)
+      ? unicodeToArray(string)
+      : asciiToArray(string);
+  }
 
-  /** Used to match Latin Unicode letters (excluding mathematical operators). */
-  var reLatin = /[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/g;
+  /**
+   * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace
+   * character of `string`.
+   *
+   * @private
+   * @param {string} string The string to inspect.
+   * @returns {number} Returns the index of the last non-whitespace character.
+   */
+  function trimmedEndIndex(string) {
+    var index = string.length;
 
-  /** Used to ensure capturing order of template delimiters. */
-  var reNoMatch = /($^)/;
+    while (index-- && reWhitespace.test(string.charAt(index))) {}
+    return index;
+  }
 
-  /** Used to match unescaped characters in compiled string literals. */
-  var reUnescapedString = /['\n\r\u2028\u2029\\]/g;
+  /**
+   * Used by `_.unescape` to convert HTML entities to characters.
+   *
+   * @private
+   * @param {string} chr The matched character to unescape.
+   * @returns {string} Returns the unescaped character.
+   */
+  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);
 
-  /** Used to compose unicode character classes. */
-  var rsAstralRange = '\\ud800-\\udfff',
-      rsComboMarksRange = '\\u0300-\\u036f',
-      reComboHalfMarksRange = '\\ufe20-\\ufe2f',
-      rsComboSymbolsRange = '\\u20d0-\\u20ff',
-      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,
-      rsDingbatRange = '\\u2700-\\u27bf',
-      rsLowerRange = 'a-z\\xdf-\\xf6\\xf8-\\xff',
-      rsMathOpRange = '\\xac\\xb1\\xd7\\xf7',
-      rsNonCharRange = '\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf',
-      rsPunctuationRange = '\\u2000-\\u206f',
-      rsSpaceRange = ' \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000',
-      rsUpperRange = 'A-Z\\xc0-\\xd6\\xd8-\\xde',
-      rsVarRange = '\\ufe0e\\ufe0f',
-      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;
+  /**
+   * Gets the size of a Unicode `string`.
+   *
+   * @private
+   * @param {string} string The string inspect.
+   * @returns {number} Returns the string size.
+   */
+  function unicodeSize(string) {
+    var result = reUnicode.lastIndex = 0;
+    while (reUnicode.test(string)) {
+      ++result;
+    }
+    return result;
+  }
 
-  /** Used to compose unicode capture groups. */
-  var rsApos = "['\u2019]",
-      rsAstral = '[' + rsAstralRange + ']',
-      rsBreak = '[' + rsBreakRange + ']',
-      rsCombo = '[' + rsComboRange + ']',
-      rsDigits = '\\d+',
-      rsDingbat = '[' + rsDingbatRange + ']',
-      rsLower = '[' + rsLowerRange + ']',
-      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',
-      rsFitz = '\\ud83c[\\udffb-\\udfff]',
-      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',
-      rsNonAstral = '[^' + rsAstralRange + ']',
-      rsRegional = '(?:\\ud83c[\\udde6-\\uddff]){2}',
-      rsSurrPair = '[\\ud800-\\udbff][\\udc00-\\udfff]',
-      rsUpper = '[' + rsUpperRange + ']',
-      rsZWJ = '\\u200d';
+  /**
+   * Converts a Unicode `string` to an array.
+   *
+   * @private
+   * @param {string} string The string to convert.
+   * @returns {Array} Returns the converted array.
+   */
+  function unicodeToArray(string) {
+    return string.match(reUnicode) || [];
+  }
 
-  /** Used to compose unicode regexes. */
-  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',
-      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',
-      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',
-      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',
-      reOptMod = rsModifier + '?',
-      rsOptVar = '[' + rsVarRange + ']?',
-      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',
-      rsOrdLower = '\\d*(?:1st|2nd|3rd|(?![123])\\dth)(?=\\b|[A-Z_])',
-      rsOrdUpper = '\\d*(?:1ST|2ND|3RD|(?![123])\\dTH)(?=\\b|[a-z_])',
-      rsSeq = rsOptVar + reOptMod + rsOptJoin,
-      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,
-      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';
+  /**
+   * Splits a Unicode `string` into an array of its words.
+   *
+   * @private
+   * @param {string} The string to inspect.
+   * @returns {Array} Returns the words of `string`.
+   */
+  function unicodeWords(string) {
+    return string.match(reUnicodeWord) || [];
+  }
 
-  /** Used to match apostrophes. */
-  var reApos = RegExp(rsApos, 'g');
+  /*--------------------------------------------------------------------------*/
 
   /**
-   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and
-   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).
+   * Create a new pristine `lodash` function using the `context` object.
+   *
+   * @static
+   * @memberOf _
+   * @since 1.1.0
+   * @category Util
+   * @param {Object} [context=root] The context object.
+   * @returns {Function} Returns a new `lodash` function.
+   * @example
+   *
+   * _.mixin({ 'foo': _.constant('foo') });
+   *
+   * var lodash = _.runInContext();
+   * lodash.mixin({ 'bar': lodash.constant('bar') });
+   *
+   * _.isFunction(_.foo);
+   * // => true
+   * _.isFunction(_.bar);
+   * // => false
+   *
+   * lodash.isFunction(lodash.foo);
+   * // => false
+   * lodash.isFunction(lodash.bar);
+   * // => true
+   *
+   * // Create a suped-up `defer` in Node.js.
+   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;
    */
-  var reComboMark = RegExp(rsCombo, 'g');
+  var runInContext = (function runInContext(context) {
+    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));
 
-  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */
-  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');
+    /** Built-in constructor references. */
+    var Array = context.Array,
+        Date = context.Date,
+        Error = context.Error,
+        Function = context.Function,
+        Math = context.Math,
+        Object = context.Object,
+        RegExp = context.RegExp,
+        String = context.String,
+        TypeError = context.TypeError;
 
-  /** Used to match complex or compound words. */
-  var reUnicodeWord = RegExp([
-    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',
-    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',
-    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,
-    rsUpper + '+' + rsOptContrUpper,
-    rsOrdUpper,
-    rsOrdLower,
-    rsDigits,
-    rsEmoji
-  ].join('|'), 'g');
+    /** Used for built-in method references. */
+    var arrayProto = Array.prototype,
+        funcProto = Function.prototype,
+        objectProto = Object.prototype;
 
-  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */
-  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');
+    /** Used to detect overreaching core-js shims. */
+    var coreJsData = context['__core-js_shared__'];
 
-  /** Used to detect strings that need a more robust regexp to match words. */
-  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;
+    /** Used to resolve the decompiled source of functions. */
+    var funcToString = funcProto.toString;
 
-  /** Used to assign default `context` object properties. */
-  var contextProps = [
-    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',
-    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',
-    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',
-    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',
-    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'
-  ];
+    /** Used to check objects for own properties. */
+    var hasOwnProperty = objectProto.hasOwnProperty;
 
-  /** Used to make template sourceURLs easier to identify. */
-  var templateCounter = -1;
+    /** Used to generate unique IDs. */
+    var idCounter = 0;
 
-  /** Used to identify `toStringTag` values of typed arrays. */
-  var typedArrayTags = {};
-  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =
-  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =
-  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =
-  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =
-  typedArrayTags[uint32Tag] = true;
-  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =
-  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =
-  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =
-  typedArrayTags[errorTag] = typedArrayTags[funcTag] =
-  typedArrayTags[mapTag] = typedArrayTags[numberTag] =
-  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =
-  typedArrayTags[setTag] = typedArrayTags[stringTag] =
-  typedArrayTags[weakMapTag] = false;
+    /** Used to detect methods masquerading as native. */
+    var maskSrcKey = (function() {
+      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');
+      return uid ? ('Symbol(src)_1.' + uid) : '';
+    }());
 
-  /** Used to identify `toStringTag` values supported by `_.clone`. */
-  var cloneableTags = {};
-  cloneableTags[argsTag] = cloneableTags[arrayTag] =
-  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =
-  cloneableTags[boolTag] = cloneableTags[dateTag] =
-  cloneableTags[float32Tag] = cloneableTags[float64Tag] =
-  cloneableTags[int8Tag] = cloneableTags[int16Tag] =
-  cloneableTags[int32Tag] = cloneableTags[mapTag] =
-  cloneableTags[numberTag] = cloneableTags[objectTag] =
-  cloneableTags[regexpTag] = cloneableTags[setTag] =
-  cloneableTags[stringTag] = cloneableTags[symbolTag] =
-  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =
-  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;
-  cloneableTags[errorTag] = cloneableTags[funcTag] =
-  cloneableTags[weakMapTag] = false;
+    /**
+     * Used to resolve the
+     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
+     * of values.
+     */
+    var nativeObjectToString = objectProto.toString;
 
-  /** Used to map Latin Unicode letters to basic Latin letters. */
-  var deburredLetters = {
-    // Latin-1 Supplement block.
-    '\xc0': 'A',  '\xc1': 'A', '\xc2': 'A', '\xc3': 'A', '\xc4': 'A', '\xc5': 'A',
-    '\xe0': 'a',  '\xe1': 'a', '\xe2': 'a', '\xe3': 'a', '\xe4': 'a', '\xe5': 'a',
-    '\xc7': 'C',  '\xe7': 'c',
-    '\xd0': 'D',  '\xf0': 'd',
-    '\xc8': 'E',  '\xc9': 'E', '\xca': 'E', '\xcb': 'E',
-    '\xe8': 'e',  '\xe9': 'e', '\xea': 'e', '\xeb': 'e',
-    '\xcc': 'I',  '\xcd': 'I', '\xce': 'I', '\xcf': 'I',
-    '\xec': 'i',  '\xed': 'i', '\xee': 'i', '\xef': 'i',
-    '\xd1': 'N',  '\xf1': 'n',
-    '\xd2': 'O',  '\xd3': 'O', '\xd4': 'O', '\xd5': 'O', '\xd6': 'O', '\xd8': 'O',
-    '\xf2': 'o',  '\xf3': 'o', '\xf4': 'o', '\xf5': 'o', '\xf6': 'o', '\xf8': 'o',
-    '\xd9': 'U',  '\xda': 'U', '\xdb': 'U', '\xdc': 'U',
-    '\xf9': 'u',  '\xfa': 'u', '\xfb': 'u', '\xfc': 'u',
-    '\xdd': 'Y',  '\xfd': 'y', '\xff': 'y',
-    '\xc6': 'Ae', '\xe6': 'ae',
-    '\xde': 'Th', '\xfe': 'th',
-    '\xdf': 'ss',
-    // Latin Extended-A block.
-    '\u0100': 'A',  '\u0102': 'A', '\u0104': 'A',
-    '\u0101': 'a',  '\u0103': 'a', '\u0105': 'a',
-    '\u0106': 'C',  '\u0108': 'C', '\u010a': 'C', '\u010c': 'C',
-    '\u0107': 'c',  '\u0109': 'c', '\u010b': 'c', '\u010d': 'c',
-    '\u010e': 'D',  '\u0110': 'D', '\u010f': 'd', '\u0111': 'd',
-    '\u0112': 'E',  '\u0114': 'E', '\u0116': 'E', '\u0118': 'E', '\u011a': 'E',
-    '\u0113': 'e',  '\u0115': 'e', '\u0117': 'e', '\u0119': 'e', '\u011b': 'e',
-    '\u011c': 'G',  '\u011e': 'G', '\u0120': 'G', '\u0122': 'G',
-    '\u011d': 'g',  '\u011f': 'g', '\u0121': 'g', '\u0123': 'g',
-    '\u0124': 'H',  '\u0126': 'H', '\u0125': 'h', '\u0127': 'h',
-    '\u0128': 'I',  '\u012a': 'I', '\u012c': 'I', '\u012e': 'I', '\u0130': 'I',
-    '\u0129': 'i',  '\u012b': 'i', '\u012d': 'i', '\u012f': 'i', '\u0131': 'i',
-    '\u0134': 'J',  '\u0135': 'j',
-    '\u0136': 'K',  '\u0137': 'k', '\u0138': 'k',
-    '\u0139': 'L',  '\u013b': 'L', '\u013d': 'L', '\u013f': 'L', '\u0141': 'L',
-    '\u013a': 'l',  '\u013c': 'l', '\u013e': 'l', '\u0140': 'l', '\u0142': 'l',
-    '\u0143': 'N',  '\u0145': 'N', '\u0147': 'N', '\u014a': 'N',
-    '\u0144': 'n',  '\u0146': 'n', '\u0148': 'n', '\u014b': 'n',
-    '\u014c': 'O',  '\u014e': 'O', '\u0150': 'O',
-    '\u014d': 'o',  '\u014f': 'o', '\u0151': 'o',
-    '\u0154': 'R',  '\u0156': 'R', '\u0158': 'R',
-    '\u0155': 'r',  '\u0157': 'r', '\u0159': 'r',
-    '\u015a': 'S',  '\u015c': 'S', '\u015e': 'S', '\u0160': 'S',
-    '\u015b': 's',  '\u015d': 's', '\u015f': 's', '\u0161': 's',
-    '\u0162': 'T',  '\u0164': 'T', '\u0166': 'T',
-    '\u0163': 't',  '\u0165': 't', '\u0167': 't',
-    '\u0168': 'U',  '\u016a': 'U', '\u016c': 'U', '\u016e': 'U', '\u0170': 'U', '\u0172': 'U',
-    '\u0169': 'u',  '\u016b': 'u', '\u016d': 'u', '\u016f': 'u', '\u0171': 'u', '\u0173': 'u',
-    '\u0174': 'W',  '\u0175': 'w',
-    '\u0176': 'Y',  '\u0177': 'y', '\u0178': 'Y',
-    '\u0179': 'Z',  '\u017b': 'Z', '\u017d': 'Z',
-    '\u017a': 'z',  '\u017c': 'z', '\u017e': 'z',
-    '\u0132': 'IJ', '\u0133': 'ij',
-    '\u0152': 'Oe', '\u0153': 'oe',
-    '\u0149': "'n", '\u017f': 's'
-  };
+    /** Used to infer the `Object` constructor. */
+    var objectCtorString = funcToString.call(Object);
+
+    /** Used to restore the original `_` reference in `_.noConflict`. */
+    var oldDash = root._;
+
+    /** Used to detect if a method is native. */
+    var reIsNative = RegExp('^' +
+      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
+      .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
+    );
+
+    /** Built-in value references. */
+    var Buffer = moduleExports ? context.Buffer : undefined$1,
+        Symbol = context.Symbol,
+        Uint8Array = context.Uint8Array,
+        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined$1,
+        getPrototype = overArg(Object.getPrototypeOf, Object),
+        objectCreate = Object.create,
+        propertyIsEnumerable = objectProto.propertyIsEnumerable,
+        splice = arrayProto.splice,
+        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined$1,
+        symIterator = Symbol ? Symbol.iterator : undefined$1,
+        symToStringTag = Symbol ? Symbol.toStringTag : undefined$1;
+
+    var defineProperty = (function() {
+      try {
+        var func = getNative(Object, 'defineProperty');
+        func({}, '', {});
+        return func;
+      } catch (e) {}
+    }());
 
-  /** Used to map characters to HTML entities. */
-  var htmlEscapes = {
-    '&': '&amp;',
-    '<': '&lt;',
-    '>': '&gt;',
-    '"': '&quot;',
-    "'": '&#39;'
-  };
+    /** Mocked built-ins. */
+    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,
+        ctxNow = Date && Date.now !== root.Date.now && Date.now,
+        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;
 
-  /** Used to map HTML entities to characters. */
-  var htmlUnescapes = {
-    '&amp;': '&',
-    '&lt;': '<',
-    '&gt;': '>',
-    '&quot;': '"',
-    '&#39;': "'"
-  };
+    /* Built-in method references for those with the same name as other `lodash` methods. */
+    var nativeCeil = Math.ceil,
+        nativeFloor = Math.floor,
+        nativeGetSymbols = Object.getOwnPropertySymbols,
+        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined$1,
+        nativeIsFinite = context.isFinite,
+        nativeJoin = arrayProto.join,
+        nativeKeys = overArg(Object.keys, Object),
+        nativeMax = Math.max,
+        nativeMin = Math.min,
+        nativeNow = Date.now,
+        nativeParseInt = context.parseInt,
+        nativeRandom = Math.random,
+        nativeReverse = arrayProto.reverse;
 
-  /** Used to escape characters for inclusion in compiled string literals. */
-  var stringEscapes = {
-    '\\': '\\',
-    "'": "'",
-    '\n': 'n',
-    '\r': 'r',
-    '\u2028': 'u2028',
-    '\u2029': 'u2029'
-  };
+    /* Built-in method references that are verified to be native. */
+    var DataView = getNative(context, 'DataView'),
+        Map = getNative(context, 'Map'),
+        Promise = getNative(context, 'Promise'),
+        Set = getNative(context, 'Set'),
+        WeakMap = getNative(context, 'WeakMap'),
+        nativeCreate = getNative(Object, 'create');
 
-  /** Built-in method references without a dependency on `root`. */
-  var freeParseFloat = parseFloat,
-      freeParseInt = parseInt;
+    /** Used to store function metadata. */
+    var metaMap = WeakMap && new WeakMap;
 
-  /** Detect free variable `global` from Node.js. */
-  var freeGlobal = typeof commonjsGlobal == 'object' && commonjsGlobal && commonjsGlobal.Object === Object && commonjsGlobal;
+    /** Used to lookup unminified function names. */
+    var realNames = {};
 
-  /** Detect free variable `self`. */
-  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;
+    /** Used to detect maps, sets, and weakmaps. */
+    var dataViewCtorString = toSource(DataView),
+        mapCtorString = toSource(Map),
+        promiseCtorString = toSource(Promise),
+        setCtorString = toSource(Set),
+        weakMapCtorString = toSource(WeakMap);
 
-  /** Used as a reference to the global object. */
-  var root = freeGlobal || freeSelf || Function('return this')();
+    /** Used to convert symbols to primitives and strings. */
+    var symbolProto = Symbol ? Symbol.prototype : undefined$1,
+        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined$1,
+        symbolToString = symbolProto ? symbolProto.toString : undefined$1;
 
-  /** Detect free variable `exports`. */
-  var freeExports = exports && !exports.nodeType && exports;
+    /*------------------------------------------------------------------------*/
 
-  /** Detect free variable `module`. */
-  var freeModule = freeExports && 'object' == 'object' && module && !module.nodeType && module;
+    /**
+     * Creates a `lodash` object which wraps `value` to enable implicit method
+     * chain sequences. Methods that operate on and return arrays, collections,
+     * and functions can be chained together. Methods that retrieve a single value
+     * or may return a primitive value will automatically end the chain sequence
+     * and return the unwrapped value. Otherwise, the value must be unwrapped
+     * with `_#value`.
+     *
+     * Explicit chain sequences, which must be unwrapped with `_#value`, may be
+     * enabled using `_.chain`.
+     *
+     * The execution of chained methods is lazy, that is, it's deferred until
+     * `_#value` is implicitly or explicitly called.
+     *
+     * Lazy evaluation allows several methods to support shortcut fusion.
+     * Shortcut fusion is an optimization to merge iteratee calls; this avoids
+     * the creation of intermediate arrays and can greatly reduce the number of
+     * iteratee executions. Sections of a chain sequence qualify for shortcut
+     * fusion if the section is applied to an array and iteratees accept only
+     * one argument. The heuristic for whether a section qualifies for shortcut
+     * fusion is subject to change.
+     *
+     * Chaining is supported in custom builds as long as the `_#value` method is
+     * directly or indirectly included in the build.
+     *
+     * In addition to lodash methods, wrappers have `Array` and `String` methods.
+     *
+     * The wrapper `Array` methods are:
+     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`
+     *
+     * The wrapper `String` methods are:
+     * `replace` and `split`
+     *
+     * The wrapper methods that support shortcut fusion are:
+     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,
+     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,
+     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`
+     *
+     * The chainable wrapper methods are:
+     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,
+     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,
+     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,
+     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,
+     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,
+     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,
+     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,
+     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,
+     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,
+     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,
+     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,
+     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,
+     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,
+     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,
+     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,
+     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,
+     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,
+     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,
+     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,
+     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,
+     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,
+     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,
+     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,
+     * `zipObject`, `zipObjectDeep`, and `zipWith`
+     *
+     * The wrapper methods that are **not** chainable by default are:
+     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,
+     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,
+     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,
+     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,
+     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,
+     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,
+     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,
+     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,
+     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,
+     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,
+     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,
+     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,
+     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,
+     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,
+     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,
+     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,
+     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,
+     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,
+     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,
+     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,
+     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,
+     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,
+     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,
+     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,
+     * `upperFirst`, `value`, and `words`
+     *
+     * @name _
+     * @constructor
+     * @category Seq
+     * @param {*} value The value to wrap in a `lodash` instance.
+     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @example
+     *
+     * function square(n) {
+     *   return n * n;
+     * }
+     *
+     * var wrapped = _([1, 2, 3]);
+     *
+     * // Returns an unwrapped value.
+     * wrapped.reduce(_.add);
+     * // => 6
+     *
+     * // Returns a wrapped value.
+     * var squares = wrapped.map(square);
+     *
+     * _.isArray(squares);
+     * // => false
+     *
+     * _.isArray(squares.value());
+     * // => true
+     */
+    function lodash(value) {
+      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {
+        if (value instanceof LodashWrapper) {
+          return value;
+        }
+        if (hasOwnProperty.call(value, '__wrapped__')) {
+          return wrapperClone(value);
+        }
+      }
+      return new LodashWrapper(value);
+    }
 
-  /** Detect the popular CommonJS extension `module.exports`. */
-  var moduleExports = freeModule && freeModule.exports === freeExports;
+    /**
+     * The base implementation of `_.create` without support for assigning
+     * properties to the created object.
+     *
+     * @private
+     * @param {Object} proto The object to inherit from.
+     * @returns {Object} Returns the new object.
+     */
+    var baseCreate = (function() {
+      function object() {}
+      return function(proto) {
+        if (!isObject(proto)) {
+          return {};
+        }
+        if (objectCreate) {
+          return objectCreate(proto);
+        }
+        object.prototype = proto;
+        var result = new object;
+        object.prototype = undefined$1;
+        return result;
+      };
+    }());
+
+    /**
+     * The function whose prototype chain sequence wrappers inherit from.
+     *
+     * @private
+     */
+    function baseLodash() {
+      // No operation performed.
+    }
+
+    /**
+     * The base constructor for creating `lodash` wrapper objects.
+     *
+     * @private
+     * @param {*} value The value to wrap.
+     * @param {boolean} [chainAll] Enable explicit method chain sequences.
+     */
+    function LodashWrapper(value, chainAll) {
+      this.__wrapped__ = value;
+      this.__actions__ = [];
+      this.__chain__ = !!chainAll;
+      this.__index__ = 0;
+      this.__values__ = undefined$1;
+    }
 
-  /** Detect free variable `process` from Node.js. */
-  var freeProcess = moduleExports && freeGlobal.process;
+    /**
+     * By default, the template delimiters used by lodash are like those in
+     * embedded Ruby (ERB) as well as ES2015 template strings. Change the
+     * following template settings to use alternative delimiters.
+     *
+     * @static
+     * @memberOf _
+     * @type {Object}
+     */
+    lodash.templateSettings = {
 
-  /** Used to access faster Node.js helpers. */
-  var nodeUtil = (function() {
-    try {
-      // Use `util.types` for Node.js 10+.
-      var types = freeModule && freeModule.require && freeModule.require('util').types;
+      /**
+       * Used to detect `data` property values to be HTML-escaped.
+       *
+       * @memberOf _.templateSettings
+       * @type {RegExp}
+       */
+      'escape': reEscape,
 
-      if (types) {
-        return types;
-      }
+      /**
+       * Used to detect code to be evaluated.
+       *
+       * @memberOf _.templateSettings
+       * @type {RegExp}
+       */
+      'evaluate': reEvaluate,
 
-      // Legacy `process.binding('util')` for Node.js < 10.
-      return freeProcess && freeProcess.binding && freeProcess.binding('util');
-    } catch (e) {}
-  }());
+      /**
+       * Used to detect `data` property values to inject.
+       *
+       * @memberOf _.templateSettings
+       * @type {RegExp}
+       */
+      'interpolate': reInterpolate,
 
-  /* Node.js helper references. */
-  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,
-      nodeIsDate = nodeUtil && nodeUtil.isDate,
-      nodeIsMap = nodeUtil && nodeUtil.isMap,
-      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,
-      nodeIsSet = nodeUtil && nodeUtil.isSet,
-      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;
+      /**
+       * Used to reference the data object in the template text.
+       *
+       * @memberOf _.templateSettings
+       * @type {string}
+       */
+      'variable': '',
 
-  /*--------------------------------------------------------------------------*/
+      /**
+       * Used to import variables into the compiled template.
+       *
+       * @memberOf _.templateSettings
+       * @type {Object}
+       */
+      'imports': {
 
-  /**
-   * A faster alternative to `Function#apply`, this function invokes `func`
-   * with the `this` binding of `thisArg` and the arguments of `args`.
-   *
-   * @private
-   * @param {Function} func The function to invoke.
-   * @param {*} thisArg The `this` binding of `func`.
-   * @param {Array} args The arguments to invoke `func` with.
-   * @returns {*} Returns the result of `func`.
-   */
-  function apply(func, thisArg, args) {
-    switch (args.length) {
-      case 0: return func.call(thisArg);
-      case 1: return func.call(thisArg, args[0]);
-      case 2: return func.call(thisArg, args[0], args[1]);
-      case 3: return func.call(thisArg, args[0], args[1], args[2]);
-    }
-    return func.apply(thisArg, args);
-  }
+        /**
+         * A reference to the `lodash` function.
+         *
+         * @memberOf _.templateSettings.imports
+         * @type {Function}
+         */
+        '_': lodash
+      }
+    };
 
-  /**
-   * A specialized version of `baseAggregator` for arrays.
-   *
-   * @private
-   * @param {Array} [array] The array to iterate over.
-   * @param {Function} setter The function to set `accumulator` values.
-   * @param {Function} iteratee The iteratee to transform keys.
-   * @param {Object} accumulator The initial aggregated object.
-   * @returns {Function} Returns `accumulator`.
-   */
-  function arrayAggregator(array, setter, iteratee, accumulator) {
-    var index = -1,
-        length = array == null ? 0 : array.length;
+    // Ensure wrappers are instances of `baseLodash`.
+    lodash.prototype = baseLodash.prototype;
+    lodash.prototype.constructor = lodash;
 
-    while (++index < length) {
-      var value = array[index];
-      setter(accumulator, value, iteratee(value), array);
-    }
-    return accumulator;
-  }
+    LodashWrapper.prototype = baseCreate(baseLodash.prototype);
+    LodashWrapper.prototype.constructor = LodashWrapper;
 
-  /**
-   * A specialized version of `_.forEach` for arrays without support for
-   * iteratee shorthands.
-   *
-   * @private
-   * @param {Array} [array] The array to iterate over.
-   * @param {Function} iteratee The function invoked per iteration.
-   * @returns {Array} Returns `array`.
-   */
-  function arrayEach(array, iteratee) {
-    var index = -1,
-        length = array == null ? 0 : array.length;
+    /*------------------------------------------------------------------------*/
 
-    while (++index < length) {
-      if (iteratee(array[index], index, array) === false) {
-        break;
-      }
+    /**
+     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.
+     *
+     * @private
+     * @constructor
+     * @param {*} value The value to wrap.
+     */
+    function LazyWrapper(value) {
+      this.__wrapped__ = value;
+      this.__actions__ = [];
+      this.__dir__ = 1;
+      this.__filtered__ = false;
+      this.__iteratees__ = [];
+      this.__takeCount__ = MAX_ARRAY_LENGTH;
+      this.__views__ = [];
     }
-    return array;
-  }
-
-  /**
-   * A specialized version of `_.forEachRight` for arrays without support for
-   * iteratee shorthands.
-   *
-   * @private
-   * @param {Array} [array] The array to iterate over.
-   * @param {Function} iteratee The function invoked per iteration.
-   * @returns {Array} Returns `array`.
-   */
-  function arrayEachRight(array, iteratee) {
-    var length = array == null ? 0 : array.length;
 
-    while (length--) {
-      if (iteratee(array[length], length, array) === false) {
-        break;
-      }
+    /**
+     * Creates a clone of the lazy wrapper object.
+     *
+     * @private
+     * @name clone
+     * @memberOf LazyWrapper
+     * @returns {Object} Returns the cloned `LazyWrapper` object.
+     */
+    function lazyClone() {
+      var result = new LazyWrapper(this.__wrapped__);
+      result.__actions__ = copyArray(this.__actions__);
+      result.__dir__ = this.__dir__;
+      result.__filtered__ = this.__filtered__;
+      result.__iteratees__ = copyArray(this.__iteratees__);
+      result.__takeCount__ = this.__takeCount__;
+      result.__views__ = copyArray(this.__views__);
+      return result;
     }
-    return array;
-  }
-
-  /**
-   * A specialized version of `_.every` for arrays without support for
-   * iteratee shorthands.
-   *
-   * @private
-   * @param {Array} [array] The array to iterate over.
-   * @param {Function} predicate The function invoked per iteration.
-   * @returns {boolean} Returns `true` if all elements pass the predicate check,
-   *  else `false`.
-   */
-  function arrayEvery(array, predicate) {
-    var index = -1,
-        length = array == null ? 0 : array.length;
 
-    while (++index < length) {
-      if (!predicate(array[index], index, array)) {
-        return false;
+    /**
+     * Reverses the direction of lazy iteration.
+     *
+     * @private
+     * @name reverse
+     * @memberOf LazyWrapper
+     * @returns {Object} Returns the new reversed `LazyWrapper` object.
+     */
+    function lazyReverse() {
+      if (this.__filtered__) {
+        var result = new LazyWrapper(this);
+        result.__dir__ = -1;
+        result.__filtered__ = true;
+      } else {
+        result = this.clone();
+        result.__dir__ *= -1;
       }
+      return result;
     }
-    return true;
-  }
 
-  /**
-   * A specialized version of `_.filter` for arrays without support for
-   * iteratee shorthands.
-   *
-   * @private
-   * @param {Array} [array] The array to iterate over.
-   * @param {Function} predicate The function invoked per iteration.
-   * @returns {Array} Returns the new filtered array.
-   */
-  function arrayFilter(array, predicate) {
-    var index = -1,
-        length = array == null ? 0 : array.length,
-        resIndex = 0,
-        result = [];
+    /**
+     * Extracts the unwrapped value from its lazy wrapper.
+     *
+     * @private
+     * @name value
+     * @memberOf LazyWrapper
+     * @returns {*} Returns the unwrapped value.
+     */
+    function lazyValue() {
+      var array = this.__wrapped__.value(),
+          dir = this.__dir__,
+          isArr = isArray(array),
+          isRight = dir < 0,
+          arrLength = isArr ? array.length : 0,
+          view = getView(0, arrLength, this.__views__),
+          start = view.start,
+          end = view.end,
+          length = end - start,
+          index = isRight ? end : (start - 1),
+          iteratees = this.__iteratees__,
+          iterLength = iteratees.length,
+          resIndex = 0,
+          takeCount = nativeMin(length, this.__takeCount__);
 
-    while (++index < length) {
-      var value = array[index];
-      if (predicate(value, index, array)) {
-        result[resIndex++] = value;
+      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {
+        return baseWrapperValue(array, this.__actions__);
       }
-    }
-    return result;
-  }
+      var result = [];
 
-  /**
-   * A specialized version of `_.includes` for arrays without support for
-   * specifying an index to search from.
-   *
-   * @private
-   * @param {Array} [array] The array to inspect.
-   * @param {*} target The value to search for.
-   * @returns {boolean} Returns `true` if `target` is found, else `false`.
-   */
-  function arrayIncludes(array, value) {
-    var length = array == null ? 0 : array.length;
-    return !!length && baseIndexOf(array, value, 0) > -1;
-  }
+      outer:
+      while (length-- && resIndex < takeCount) {
+        index += dir;
 
-  /**
-   * This function is like `arrayIncludes` except that it accepts a comparator.
-   *
-   * @private
-   * @param {Array} [array] The array to inspect.
-   * @param {*} target The value to search for.
-   * @param {Function} comparator The comparator invoked per element.
-   * @returns {boolean} Returns `true` if `target` is found, else `false`.
-   */
-  function arrayIncludesWith(array, value, comparator) {
-    var index = -1,
-        length = array == null ? 0 : array.length;
+        var iterIndex = -1,
+            value = array[index];
 
-    while (++index < length) {
-      if (comparator(value, array[index])) {
-        return true;
+        while (++iterIndex < iterLength) {
+          var data = iteratees[iterIndex],
+              iteratee = data.iteratee,
+              type = data.type,
+              computed = iteratee(value);
+
+          if (type == LAZY_MAP_FLAG) {
+            value = computed;
+          } else if (!computed) {
+            if (type == LAZY_FILTER_FLAG) {
+              continue outer;
+            } else {
+              break outer;
+            }
+          }
+        }
+        result[resIndex++] = value;
       }
+      return result;
     }
-    return false;
-  }
 
-  /**
-   * A specialized version of `_.map` for arrays without support for iteratee
-   * shorthands.
-   *
-   * @private
-   * @param {Array} [array] The array to iterate over.
-   * @param {Function} iteratee The function invoked per iteration.
-   * @returns {Array} Returns the new mapped array.
-   */
-  function arrayMap(array, iteratee) {
-    var index = -1,
-        length = array == null ? 0 : array.length,
-        result = Array(length);
+    // Ensure `LazyWrapper` is an instance of `baseLodash`.
+    LazyWrapper.prototype = baseCreate(baseLodash.prototype);
+    LazyWrapper.prototype.constructor = LazyWrapper;
 
-    while (++index < length) {
-      result[index] = iteratee(array[index], index, array);
-    }
-    return result;
-  }
+    /*------------------------------------------------------------------------*/
 
-  /**
-   * Appends the elements of `values` to `array`.
-   *
-   * @private
-   * @param {Array} array The array to modify.
-   * @param {Array} values The values to append.
-   * @returns {Array} Returns `array`.
-   */
-  function arrayPush(array, values) {
-    var index = -1,
-        length = values.length,
-        offset = array.length;
+    /**
+     * Creates a hash object.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [entries] The key-value pairs to cache.
+     */
+    function Hash(entries) {
+      var index = -1,
+          length = entries == null ? 0 : entries.length;
 
-    while (++index < length) {
-      array[offset + index] = values[index];
+      this.clear();
+      while (++index < length) {
+        var entry = entries[index];
+        this.set(entry[0], entry[1]);
+      }
     }
-    return array;
-  }
 
-  /**
-   * A specialized version of `_.reduce` for arrays without support for
-   * iteratee shorthands.
-   *
-   * @private
-   * @param {Array} [array] The array to iterate over.
-   * @param {Function} iteratee The function invoked per iteration.
-   * @param {*} [accumulator] The initial value.
-   * @param {boolean} [initAccum] Specify using the first element of `array` as
-   *  the initial value.
-   * @returns {*} Returns the accumulated value.
-   */
-  function arrayReduce(array, iteratee, accumulator, initAccum) {
-    var index = -1,
-        length = array == null ? 0 : array.length;
+    /**
+     * Removes all key-value entries from the hash.
+     *
+     * @private
+     * @name clear
+     * @memberOf Hash
+     */
+    function hashClear() {
+      this.__data__ = nativeCreate ? nativeCreate(null) : {};
+      this.size = 0;
+    }
 
-    if (initAccum && length) {
-      accumulator = array[++index];
+    /**
+     * Removes `key` and its value from the hash.
+     *
+     * @private
+     * @name delete
+     * @memberOf Hash
+     * @param {Object} hash The hash to modify.
+     * @param {string} key The key of the value to remove.
+     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     */
+    function hashDelete(key) {
+      var result = this.has(key) && delete this.__data__[key];
+      this.size -= result ? 1 : 0;
+      return result;
     }
-    while (++index < length) {
-      accumulator = iteratee(accumulator, array[index], index, array);
+
+    /**
+     * Gets the hash value for `key`.
+     *
+     * @private
+     * @name get
+     * @memberOf Hash
+     * @param {string} key The key of the value to get.
+     * @returns {*} Returns the entry value.
+     */
+    function hashGet(key) {
+      var data = this.__data__;
+      if (nativeCreate) {
+        var result = data[key];
+        return result === HASH_UNDEFINED ? undefined$1 : result;
+      }
+      return hasOwnProperty.call(data, key) ? data[key] : undefined$1;
     }
-    return accumulator;
-  }
 
-  /**
-   * A specialized version of `_.reduceRight` for arrays without support for
-   * iteratee shorthands.
-   *
-   * @private
-   * @param {Array} [array] The array to iterate over.
-   * @param {Function} iteratee The function invoked per iteration.
-   * @param {*} [accumulator] The initial value.
-   * @param {boolean} [initAccum] Specify using the last element of `array` as
-   *  the initial value.
-   * @returns {*} Returns the accumulated value.
-   */
-  function arrayReduceRight(array, iteratee, accumulator, initAccum) {
-    var length = array == null ? 0 : array.length;
-    if (initAccum && length) {
-      accumulator = array[--length];
+    /**
+     * Checks if a hash value for `key` exists.
+     *
+     * @private
+     * @name has
+     * @memberOf Hash
+     * @param {string} key The key of the entry to check.
+     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     */
+    function hashHas(key) {
+      var data = this.__data__;
+      return nativeCreate ? (data[key] !== undefined$1) : hasOwnProperty.call(data, key);
     }
-    while (length--) {
-      accumulator = iteratee(accumulator, array[length], length, array);
+
+    /**
+     * Sets the hash `key` to `value`.
+     *
+     * @private
+     * @name set
+     * @memberOf Hash
+     * @param {string} key The key of the value to set.
+     * @param {*} value The value to set.
+     * @returns {Object} Returns the hash instance.
+     */
+    function hashSet(key, value) {
+      var data = this.__data__;
+      this.size += this.has(key) ? 0 : 1;
+      data[key] = (nativeCreate && value === undefined$1) ? HASH_UNDEFINED : value;
+      return this;
     }
-    return accumulator;
-  }
 
-  /**
-   * A specialized version of `_.some` for arrays without support for iteratee
-   * shorthands.
-   *
-   * @private
-   * @param {Array} [array] The array to iterate over.
-   * @param {Function} predicate The function invoked per iteration.
-   * @returns {boolean} Returns `true` if any element passes the predicate check,
-   *  else `false`.
-   */
-  function arraySome(array, predicate) {
-    var index = -1,
-        length = array == null ? 0 : array.length;
+    // Add methods to `Hash`.
+    Hash.prototype.clear = hashClear;
+    Hash.prototype['delete'] = hashDelete;
+    Hash.prototype.get = hashGet;
+    Hash.prototype.has = hashHas;
+    Hash.prototype.set = hashSet;
 
-    while (++index < length) {
-      if (predicate(array[index], index, array)) {
-        return true;
+    /*------------------------------------------------------------------------*/
+
+    /**
+     * Creates an list cache object.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [entries] The key-value pairs to cache.
+     */
+    function ListCache(entries) {
+      var index = -1,
+          length = entries == null ? 0 : entries.length;
+
+      this.clear();
+      while (++index < length) {
+        var entry = entries[index];
+        this.set(entry[0], entry[1]);
       }
     }
-    return false;
-  }
-
-  /**
-   * Gets the size of an ASCII `string`.
-   *
-   * @private
-   * @param {string} string The string inspect.
-   * @returns {number} Returns the string size.
-   */
-  var asciiSize = baseProperty('length');
 
-  /**
-   * Converts an ASCII `string` to an array.
-   *
-   * @private
-   * @param {string} string The string to convert.
-   * @returns {Array} Returns the converted array.
-   */
-  function asciiToArray(string) {
-    return string.split('');
-  }
+    /**
+     * Removes all key-value entries from the list cache.
+     *
+     * @private
+     * @name clear
+     * @memberOf ListCache
+     */
+    function listCacheClear() {
+      this.__data__ = [];
+      this.size = 0;
+    }
 
-  /**
-   * Splits an ASCII `string` into an array of its words.
-   *
-   * @private
-   * @param {string} The string to inspect.
-   * @returns {Array} Returns the words of `string`.
-   */
-  function asciiWords(string) {
-    return string.match(reAsciiWord) || [];
-  }
+    /**
+     * Removes `key` and its value from the list cache.
+     *
+     * @private
+     * @name delete
+     * @memberOf ListCache
+     * @param {string} key The key of the value to remove.
+     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     */
+    function listCacheDelete(key) {
+      var data = this.__data__,
+          index = assocIndexOf(data, key);
 
-  /**
-   * The base implementation of methods like `_.findKey` and `_.findLastKey`,
-   * without support for iteratee shorthands, which iterates over `collection`
-   * using `eachFunc`.
-   *
-   * @private
-   * @param {Array|Object} collection The collection to inspect.
-   * @param {Function} predicate The function invoked per iteration.
-   * @param {Function} eachFunc The function to iterate over `collection`.
-   * @returns {*} Returns the found element or its key, else `undefined`.
-   */
-  function baseFindKey(collection, predicate, eachFunc) {
-    var result;
-    eachFunc(collection, function(value, key, collection) {
-      if (predicate(value, key, collection)) {
-        result = key;
+      if (index < 0) {
         return false;
       }
-    });
-    return result;
-  }
+      var lastIndex = data.length - 1;
+      if (index == lastIndex) {
+        data.pop();
+      } else {
+        splice.call(data, index, 1);
+      }
+      --this.size;
+      return true;
+    }
 
-  /**
-   * The base implementation of `_.findIndex` and `_.findLastIndex` without
-   * support for iteratee shorthands.
-   *
-   * @private
-   * @param {Array} array The array to inspect.
-   * @param {Function} predicate The function invoked per iteration.
-   * @param {number} fromIndex The index to search from.
-   * @param {boolean} [fromRight] Specify iterating from right to left.
-   * @returns {number} Returns the index of the matched value, else `-1`.
-   */
-  function baseFindIndex(array, predicate, fromIndex, fromRight) {
-    var length = array.length,
-        index = fromIndex + (fromRight ? 1 : -1);
+    /**
+     * Gets the list cache value for `key`.
+     *
+     * @private
+     * @name get
+     * @memberOf ListCache
+     * @param {string} key The key of the value to get.
+     * @returns {*} Returns the entry value.
+     */
+    function listCacheGet(key) {
+      var data = this.__data__,
+          index = assocIndexOf(data, key);
 
-    while ((fromRight ? index-- : ++index < length)) {
-      if (predicate(array[index], index, array)) {
-        return index;
-      }
+      return index < 0 ? undefined$1 : data[index][1];
     }
-    return -1;
-  }
 
-  /**
-   * The base implementation of `_.indexOf` without `fromIndex` bounds checks.
-   *
-   * @private
-   * @param {Array} array The array to inspect.
-   * @param {*} value The value to search for.
-   * @param {number} fromIndex The index to search from.
-   * @returns {number} Returns the index of the matched value, else `-1`.
-   */
-  function baseIndexOf(array, value, fromIndex) {
-    return value === value
-      ? strictIndexOf(array, value, fromIndex)
-      : baseFindIndex(array, baseIsNaN, fromIndex);
-  }
+    /**
+     * Checks if a list cache value for `key` exists.
+     *
+     * @private
+     * @name has
+     * @memberOf ListCache
+     * @param {string} key The key of the entry to check.
+     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     */
+    function listCacheHas(key) {
+      return assocIndexOf(this.__data__, key) > -1;
+    }
 
-  /**
-   * This function is like `baseIndexOf` except that it accepts a comparator.
-   *
-   * @private
-   * @param {Array} array The array to inspect.
-   * @param {*} value The value to search for.
-   * @param {number} fromIndex The index to search from.
-   * @param {Function} comparator The comparator invoked per element.
-   * @returns {number} Returns the index of the matched value, else `-1`.
-   */
-  function baseIndexOfWith(array, value, fromIndex, comparator) {
-    var index = fromIndex - 1,
-        length = array.length;
+    /**
+     * Sets the list cache `key` to `value`.
+     *
+     * @private
+     * @name set
+     * @memberOf ListCache
+     * @param {string} key The key of the value to set.
+     * @param {*} value The value to set.
+     * @returns {Object} Returns the list cache instance.
+     */
+    function listCacheSet(key, value) {
+      var data = this.__data__,
+          index = assocIndexOf(data, key);
 
-    while (++index < length) {
-      if (comparator(array[index], value)) {
-        return index;
+      if (index < 0) {
+        ++this.size;
+        data.push([key, value]);
+      } else {
+        data[index][1] = value;
       }
+      return this;
     }
-    return -1;
-  }
-
-  /**
-   * The base implementation of `_.isNaN` without support for number objects.
-   *
-   * @private
-   * @param {*} value The value to check.
-   * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
-   */
-  function baseIsNaN(value) {
-    return value !== value;
-  }
 
-  /**
-   * The base implementation of `_.mean` and `_.meanBy` without support for
-   * iteratee shorthands.
-   *
-   * @private
-   * @param {Array} array The array to iterate over.
-   * @param {Function} iteratee The function invoked per iteration.
-   * @returns {number} Returns the mean.
-   */
-  function baseMean(array, iteratee) {
-    var length = array == null ? 0 : array.length;
-    return length ? (baseSum(array, iteratee) / length) : NAN;
-  }
+    // Add methods to `ListCache`.
+    ListCache.prototype.clear = listCacheClear;
+    ListCache.prototype['delete'] = listCacheDelete;
+    ListCache.prototype.get = listCacheGet;
+    ListCache.prototype.has = listCacheHas;
+    ListCache.prototype.set = listCacheSet;
 
-  /**
-   * The base implementation of `_.property` without support for deep paths.
-   *
-   * @private
-   * @param {string} key The key of the property to get.
-   * @returns {Function} Returns the new accessor function.
-   */
-  function baseProperty(key) {
-    return function(object) {
-      return object == null ? undefined$1 : object[key];
-    };
-  }
+    /*------------------------------------------------------------------------*/
 
-  /**
-   * The base implementation of `_.propertyOf` without support for deep paths.
-   *
-   * @private
-   * @param {Object} object The object to query.
-   * @returns {Function} Returns the new accessor function.
-   */
-  function basePropertyOf(object) {
-    return function(key) {
-      return object == null ? undefined$1 : object[key];
-    };
-  }
+    /**
+     * Creates a map cache object to store key-value pairs.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [entries] The key-value pairs to cache.
+     */
+    function MapCache(entries) {
+      var index = -1,
+          length = entries == null ? 0 : entries.length;
 
-  /**
-   * The base implementation of `_.reduce` and `_.reduceRight`, without support
-   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.
-   *
-   * @private
-   * @param {Array|Object} collection The collection to iterate over.
-   * @param {Function} iteratee The function invoked per iteration.
-   * @param {*} accumulator The initial value.
-   * @param {boolean} initAccum Specify using the first or last element of
-   *  `collection` as the initial value.
-   * @param {Function} eachFunc The function to iterate over `collection`.
-   * @returns {*} Returns the accumulated value.
-   */
-  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {
-    eachFunc(collection, function(value, index, collection) {
-      accumulator = initAccum
-        ? (initAccum = false, value)
-        : iteratee(accumulator, value, index, collection);
-    });
-    return accumulator;
-  }
+      this.clear();
+      while (++index < length) {
+        var entry = entries[index];
+        this.set(entry[0], entry[1]);
+      }
+    }
 
-  /**
-   * The base implementation of `_.sortBy` which uses `comparer` to define the
-   * sort order of `array` and replaces criteria objects with their corresponding
-   * values.
-   *
-   * @private
-   * @param {Array} array The array to sort.
-   * @param {Function} comparer The function to define sort order.
-   * @returns {Array} Returns `array`.
-   */
-  function baseSortBy(array, comparer) {
-    var length = array.length;
+    /**
+     * Removes all key-value entries from the map.
+     *
+     * @private
+     * @name clear
+     * @memberOf MapCache
+     */
+    function mapCacheClear() {
+      this.size = 0;
+      this.__data__ = {
+        'hash': new Hash,
+        'map': new (Map || ListCache),
+        'string': new Hash
+      };
+    }
 
-    array.sort(comparer);
-    while (length--) {
-      array[length] = array[length].value;
+    /**
+     * Removes `key` and its value from the map.
+     *
+     * @private
+     * @name delete
+     * @memberOf MapCache
+     * @param {string} key The key of the value to remove.
+     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     */
+    function mapCacheDelete(key) {
+      var result = getMapData(this, key)['delete'](key);
+      this.size -= result ? 1 : 0;
+      return result;
     }
-    return array;
-  }
 
-  /**
-   * The base implementation of `_.sum` and `_.sumBy` without support for
-   * iteratee shorthands.
-   *
-   * @private
-   * @param {Array} array The array to iterate over.
-   * @param {Function} iteratee The function invoked per iteration.
-   * @returns {number} Returns the sum.
-   */
-  function baseSum(array, iteratee) {
-    var result,
-        index = -1,
-        length = array.length;
+    /**
+     * Gets the map value for `key`.
+     *
+     * @private
+     * @name get
+     * @memberOf MapCache
+     * @param {string} key The key of the value to get.
+     * @returns {*} Returns the entry value.
+     */
+    function mapCacheGet(key) {
+      return getMapData(this, key).get(key);
+    }
 
-    while (++index < length) {
-      var current = iteratee(array[index]);
-      if (current !== undefined$1) {
-        result = result === undefined$1 ? current : (result + current);
-      }
+    /**
+     * Checks if a map value for `key` exists.
+     *
+     * @private
+     * @name has
+     * @memberOf MapCache
+     * @param {string} key The key of the entry to check.
+     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     */
+    function mapCacheHas(key) {
+      return getMapData(this, key).has(key);
     }
-    return result;
-  }
 
-  /**
-   * The base implementation of `_.times` without support for iteratee shorthands
-   * or max array length checks.
-   *
-   * @private
-   * @param {number} n The number of times to invoke `iteratee`.
-   * @param {Function} iteratee The function invoked per iteration.
-   * @returns {Array} Returns the array of results.
-   */
-  function baseTimes(n, iteratee) {
-    var index = -1,
-        result = Array(n);
+    /**
+     * Sets the map `key` to `value`.
+     *
+     * @private
+     * @name set
+     * @memberOf MapCache
+     * @param {string} key The key of the value to set.
+     * @param {*} value The value to set.
+     * @returns {Object} Returns the map cache instance.
+     */
+    function mapCacheSet(key, value) {
+      var data = getMapData(this, key),
+          size = data.size;
 
-    while (++index < n) {
-      result[index] = iteratee(index);
+      data.set(key, value);
+      this.size += data.size == size ? 0 : 1;
+      return this;
     }
-    return result;
-  }
 
-  /**
-   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array
-   * of key-value pairs for `object` corresponding to the property names of `props`.
-   *
-   * @private
-   * @param {Object} object The object to query.
-   * @param {Array} props The property names to get values for.
-   * @returns {Object} Returns the key-value pairs.
-   */
-  function baseToPairs(object, props) {
-    return arrayMap(props, function(key) {
-      return [key, object[key]];
-    });
-  }
+    // Add methods to `MapCache`.
+    MapCache.prototype.clear = mapCacheClear;
+    MapCache.prototype['delete'] = mapCacheDelete;
+    MapCache.prototype.get = mapCacheGet;
+    MapCache.prototype.has = mapCacheHas;
+    MapCache.prototype.set = mapCacheSet;
 
-  /**
-   * The base implementation of `_.trim`.
-   *
-   * @private
-   * @param {string} string The string to trim.
-   * @returns {string} Returns the trimmed string.
-   */
-  function baseTrim(string) {
-    return string
-      ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')
-      : string;
-  }
+    /*------------------------------------------------------------------------*/
 
-  /**
-   * The base implementation of `_.unary` without support for storing metadata.
-   *
-   * @private
-   * @param {Function} func The function to cap arguments for.
-   * @returns {Function} Returns the new capped function.
-   */
-  function baseUnary(func) {
-    return function(value) {
-      return func(value);
-    };
-  }
+    /**
+     *
+     * Creates an array cache object to store unique values.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [values] The values to cache.
+     */
+    function SetCache(values) {
+      var index = -1,
+          length = values == null ? 0 : values.length;
 
-  /**
-   * The base implementation of `_.values` and `_.valuesIn` which creates an
-   * array of `object` property values corresponding to the property names
-   * of `props`.
-   *
-   * @private
-   * @param {Object} object The object to query.
-   * @param {Array} props The property names to get values for.
-   * @returns {Object} Returns the array of property values.
-   */
-  function baseValues(object, props) {
-    return arrayMap(props, function(key) {
-      return object[key];
-    });
-  }
+      this.__data__ = new MapCache;
+      while (++index < length) {
+        this.add(values[index]);
+      }
+    }
 
-  /**
-   * Checks if a `cache` value for `key` exists.
-   *
-   * @private
-   * @param {Object} cache The cache to query.
-   * @param {string} key The key of the entry to check.
-   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
-   */
-  function cacheHas(cache, key) {
-    return cache.has(key);
-  }
+    /**
+     * Adds `value` to the array cache.
+     *
+     * @private
+     * @name add
+     * @memberOf SetCache
+     * @alias push
+     * @param {*} value The value to cache.
+     * @returns {Object} Returns the cache instance.
+     */
+    function setCacheAdd(value) {
+      this.__data__.set(value, HASH_UNDEFINED);
+      return this;
+    }
 
-  /**
-   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol
-   * that is not found in the character symbols.
-   *
-   * @private
-   * @param {Array} strSymbols The string symbols to inspect.
-   * @param {Array} chrSymbols The character symbols to find.
-   * @returns {number} Returns the index of the first unmatched string symbol.
-   */
-  function charsStartIndex(strSymbols, chrSymbols) {
-    var index = -1,
-        length = strSymbols.length;
+    /**
+     * Checks if `value` is in the array cache.
+     *
+     * @private
+     * @name has
+     * @memberOf SetCache
+     * @param {*} value The value to search for.
+     * @returns {number} Returns `true` if `value` is found, else `false`.
+     */
+    function setCacheHas(value) {
+      return this.__data__.has(value);
+    }
 
-    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
-    return index;
-  }
+    // Add methods to `SetCache`.
+    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
+    SetCache.prototype.has = setCacheHas;
 
-  /**
-   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol
-   * that is not found in the character symbols.
-   *
-   * @private
-   * @param {Array} strSymbols The string symbols to inspect.
-   * @param {Array} chrSymbols The character symbols to find.
-   * @returns {number} Returns the index of the last unmatched string symbol.
-   */
-  function charsEndIndex(strSymbols, chrSymbols) {
-    var index = strSymbols.length;
+    /*------------------------------------------------------------------------*/
 
-    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}
-    return index;
-  }
+    /**
+     * Creates a stack cache object to store key-value pairs.
+     *
+     * @private
+     * @constructor
+     * @param {Array} [entries] The key-value pairs to cache.
+     */
+    function Stack(entries) {
+      var data = this.__data__ = new ListCache(entries);
+      this.size = data.size;
+    }
 
-  /**
-   * Gets the number of `placeholder` occurrences in `array`.
-   *
-   * @private
-   * @param {Array} array The array to inspect.
-   * @param {*} placeholder The placeholder to search for.
-   * @returns {number} Returns the placeholder count.
-   */
-  function countHolders(array, placeholder) {
-    var length = array.length,
-        result = 0;
+    /**
+     * Removes all key-value entries from the stack.
+     *
+     * @private
+     * @name clear
+     * @memberOf Stack
+     */
+    function stackClear() {
+      this.__data__ = new ListCache;
+      this.size = 0;
+    }
 
-    while (length--) {
-      if (array[length] === placeholder) {
-        ++result;
-      }
+    /**
+     * Removes `key` and its value from the stack.
+     *
+     * @private
+     * @name delete
+     * @memberOf Stack
+     * @param {string} key The key of the value to remove.
+     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     */
+    function stackDelete(key) {
+      var data = this.__data__,
+          result = data['delete'](key);
+
+      this.size = data.size;
+      return result;
     }
-    return result;
-  }
 
-  /**
-   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A
-   * letters to basic Latin letters.
-   *
-   * @private
-   * @param {string} letter The matched letter to deburr.
-   * @returns {string} Returns the deburred letter.
-   */
-  var deburrLetter = basePropertyOf(deburredLetters);
+    /**
+     * Gets the stack value for `key`.
+     *
+     * @private
+     * @name get
+     * @memberOf Stack
+     * @param {string} key The key of the value to get.
+     * @returns {*} Returns the entry value.
+     */
+    function stackGet(key) {
+      return this.__data__.get(key);
+    }
 
-  /**
-   * Used by `_.escape` to convert characters to HTML entities.
-   *
-   * @private
-   * @param {string} chr The matched character to escape.
-   * @returns {string} Returns the escaped character.
-   */
-  var escapeHtmlChar = basePropertyOf(htmlEscapes);
+    /**
+     * Checks if a stack value for `key` exists.
+     *
+     * @private
+     * @name has
+     * @memberOf Stack
+     * @param {string} key The key of the entry to check.
+     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     */
+    function stackHas(key) {
+      return this.__data__.has(key);
+    }
 
-  /**
-   * Used by `_.template` to escape characters for inclusion in compiled string literals.
-   *
-   * @private
-   * @param {string} chr The matched character to escape.
-   * @returns {string} Returns the escaped character.
-   */
-  function escapeStringChar(chr) {
-    return '\\' + stringEscapes[chr];
-  }
+    /**
+     * Sets the stack `key` to `value`.
+     *
+     * @private
+     * @name set
+     * @memberOf Stack
+     * @param {string} key The key of the value to set.
+     * @param {*} value The value to set.
+     * @returns {Object} Returns the stack cache instance.
+     */
+    function stackSet(key, value) {
+      var data = this.__data__;
+      if (data instanceof ListCache) {
+        var pairs = data.__data__;
+        if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {
+          pairs.push([key, value]);
+          this.size = ++data.size;
+          return this;
+        }
+        data = this.__data__ = new MapCache(pairs);
+      }
+      data.set(key, value);
+      this.size = data.size;
+      return this;
+    }
 
-  /**
-   * Gets the value at `key` of `object`.
-   *
-   * @private
-   * @param {Object} [object] The object to query.
-   * @param {string} key The key of the property to get.
-   * @returns {*} Returns the property value.
-   */
-  function getValue(object, key) {
-    return object == null ? undefined$1 : object[key];
-  }
+    // Add methods to `Stack`.
+    Stack.prototype.clear = stackClear;
+    Stack.prototype['delete'] = stackDelete;
+    Stack.prototype.get = stackGet;
+    Stack.prototype.has = stackHas;
+    Stack.prototype.set = stackSet;
 
-  /**
-   * Checks if `string` contains Unicode symbols.
-   *
-   * @private
-   * @param {string} string The string to inspect.
-   * @returns {boolean} Returns `true` if a symbol is found, else `false`.
-   */
-  function hasUnicode(string) {
-    return reHasUnicode.test(string);
-  }
+    /*------------------------------------------------------------------------*/
 
-  /**
-   * Checks if `string` contains a word composed of Unicode symbols.
-   *
-   * @private
-   * @param {string} string The string to inspect.
-   * @returns {boolean} Returns `true` if a word is found, else `false`.
-   */
-  function hasUnicodeWord(string) {
-    return reHasUnicodeWord.test(string);
-  }
+    /**
+     * Creates an array of the enumerable property names of the array-like `value`.
+     *
+     * @private
+     * @param {*} value The value to query.
+     * @param {boolean} inherited Specify returning inherited property names.
+     * @returns {Array} Returns the array of property names.
+     */
+    function arrayLikeKeys(value, inherited) {
+      var isArr = isArray(value),
+          isArg = !isArr && isArguments(value),
+          isBuff = !isArr && !isArg && isBuffer(value),
+          isType = !isArr && !isArg && !isBuff && isTypedArray(value),
+          skipIndexes = isArr || isArg || isBuff || isType,
+          result = skipIndexes ? baseTimes(value.length, String) : [],
+          length = result.length;
 
-  /**
-   * Converts `iterator` to an array.
-   *
-   * @private
-   * @param {Object} iterator The iterator to convert.
-   * @returns {Array} Returns the converted array.
-   */
-  function iteratorToArray(iterator) {
-    var data,
-        result = [];
+      for (var key in value) {
+        if ((inherited || hasOwnProperty.call(value, key)) &&
+            !(skipIndexes && (
+               // Safari 9 has enumerable `arguments.length` in strict mode.
+               key == 'length' ||
+               // Node.js 0.10 has enumerable non-index properties on buffers.
+               (isBuff && (key == 'offset' || key == 'parent')) ||
+               // PhantomJS 2 has enumerable non-index properties on typed arrays.
+               (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||
+               // Skip index properties.
+               isIndex(key, length)
+            ))) {
+          result.push(key);
+        }
+      }
+      return result;
+    }
 
-    while (!(data = iterator.next()).done) {
-      result.push(data.value);
+    /**
+     * A specialized version of `_.sample` for arrays.
+     *
+     * @private
+     * @param {Array} array The array to sample.
+     * @returns {*} Returns the random element.
+     */
+    function arraySample(array) {
+      var length = array.length;
+      return length ? array[baseRandom(0, length - 1)] : undefined$1;
     }
-    return result;
-  }
 
-  /**
-   * Converts `map` to its key-value pairs.
-   *
-   * @private
-   * @param {Object} map The map to convert.
-   * @returns {Array} Returns the key-value pairs.
-   */
-  function mapToArray(map) {
-    var index = -1,
-        result = Array(map.size);
+    /**
+     * A specialized version of `_.sampleSize` for arrays.
+     *
+     * @private
+     * @param {Array} array The array to sample.
+     * @param {number} n The number of elements to sample.
+     * @returns {Array} Returns the random elements.
+     */
+    function arraySampleSize(array, n) {
+      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));
+    }
 
-    map.forEach(function(value, key) {
-      result[++index] = [key, value];
-    });
-    return result;
-  }
+    /**
+     * A specialized version of `_.shuffle` for arrays.
+     *
+     * @private
+     * @param {Array} array The array to shuffle.
+     * @returns {Array} Returns the new shuffled array.
+     */
+    function arrayShuffle(array) {
+      return shuffleSelf(copyArray(array));
+    }
 
-  /**
-   * Creates a unary function that invokes `func` with its argument transformed.
-   *
-   * @private
-   * @param {Function} func The function to wrap.
-   * @param {Function} transform The argument transform.
-   * @returns {Function} Returns the new function.
-   */
-  function overArg(func, transform) {
-    return function(arg) {
-      return func(transform(arg));
-    };
-  }
+    /**
+     * This function is like `assignValue` except that it doesn't assign
+     * `undefined` values.
+     *
+     * @private
+     * @param {Object} object The object to modify.
+     * @param {string} key The key of the property to assign.
+     * @param {*} value The value to assign.
+     */
+    function assignMergeValue(object, key, value) {
+      if ((value !== undefined$1 && !eq(object[key], value)) ||
+          (value === undefined$1 && !(key in object))) {
+        baseAssignValue(object, key, value);
+      }
+    }
 
-  /**
-   * Replaces all `placeholder` elements in `array` with an internal placeholder
-   * and returns an array of their indexes.
-   *
-   * @private
-   * @param {Array} array The array to modify.
-   * @param {*} placeholder The placeholder to replace.
-   * @returns {Array} Returns the new array of placeholder indexes.
-   */
-  function replaceHolders(array, placeholder) {
-    var index = -1,
-        length = array.length,
-        resIndex = 0,
-        result = [];
+    /**
+     * Assigns `value` to `key` of `object` if the existing value is not equivalent
+     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons.
+     *
+     * @private
+     * @param {Object} object The object to modify.
+     * @param {string} key The key of the property to assign.
+     * @param {*} value The value to assign.
+     */
+    function assignValue(object, key, value) {
+      var objValue = object[key];
+      if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||
+          (value === undefined$1 && !(key in object))) {
+        baseAssignValue(object, key, value);
+      }
+    }
 
-    while (++index < length) {
-      var value = array[index];
-      if (value === placeholder || value === PLACEHOLDER) {
-        array[index] = PLACEHOLDER;
-        result[resIndex++] = index;
+    /**
+     * Gets the index at which the `key` is found in `array` of key-value pairs.
+     *
+     * @private
+     * @param {Array} array The array to inspect.
+     * @param {*} key The key to search for.
+     * @returns {number} Returns the index of the matched value, else `-1`.
+     */
+    function assocIndexOf(array, key) {
+      var length = array.length;
+      while (length--) {
+        if (eq(array[length][0], key)) {
+          return length;
+        }
       }
+      return -1;
     }
-    return result;
-  }
 
-  /**
-   * Converts `set` to an array of its values.
-   *
-   * @private
-   * @param {Object} set The set to convert.
-   * @returns {Array} Returns the values.
-   */
-  function setToArray(set) {
-    var index = -1,
-        result = Array(set.size);
+    /**
+     * Aggregates elements of `collection` on `accumulator` with keys transformed
+     * by `iteratee` and values set by `setter`.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} setter The function to set `accumulator` values.
+     * @param {Function} iteratee The iteratee to transform keys.
+     * @param {Object} accumulator The initial aggregated object.
+     * @returns {Function} Returns `accumulator`.
+     */
+    function baseAggregator(collection, setter, iteratee, accumulator) {
+      baseEach(collection, function(value, key, collection) {
+        setter(accumulator, value, iteratee(value), collection);
+      });
+      return accumulator;
+    }
 
-    set.forEach(function(value) {
-      result[++index] = value;
-    });
-    return result;
-  }
+    /**
+     * The base implementation of `_.assign` without support for multiple sources
+     * or `customizer` functions.
+     *
+     * @private
+     * @param {Object} object The destination object.
+     * @param {Object} source The source object.
+     * @returns {Object} Returns `object`.
+     */
+    function baseAssign(object, source) {
+      return object && copyObject(source, keys(source), object);
+    }
 
-  /**
-   * Converts `set` to its value-value pairs.
-   *
-   * @private
-   * @param {Object} set The set to convert.
-   * @returns {Array} Returns the value-value pairs.
-   */
-  function setToPairs(set) {
-    var index = -1,
-        result = Array(set.size);
+    /**
+     * The base implementation of `_.assignIn` without support for multiple sources
+     * or `customizer` functions.
+     *
+     * @private
+     * @param {Object} object The destination object.
+     * @param {Object} source The source object.
+     * @returns {Object} Returns `object`.
+     */
+    function baseAssignIn(object, source) {
+      return object && copyObject(source, keysIn(source), object);
+    }
 
-    set.forEach(function(value) {
-      result[++index] = [value, value];
-    });
-    return result;
-  }
+    /**
+     * The base implementation of `assignValue` and `assignMergeValue` without
+     * value checks.
+     *
+     * @private
+     * @param {Object} object The object to modify.
+     * @param {string} key The key of the property to assign.
+     * @param {*} value The value to assign.
+     */
+    function baseAssignValue(object, key, value) {
+      if (key == '__proto__' && defineProperty) {
+        defineProperty(object, key, {
+          'configurable': true,
+          'enumerable': true,
+          'value': value,
+          'writable': true
+        });
+      } else {
+        object[key] = value;
+      }
+    }
 
-  /**
-   * A specialized version of `_.indexOf` which performs strict equality
-   * comparisons of values, i.e. `===`.
-   *
-   * @private
-   * @param {Array} array The array to inspect.
-   * @param {*} value The value to search for.
-   * @param {number} fromIndex The index to search from.
-   * @returns {number} Returns the index of the matched value, else `-1`.
-   */
-  function strictIndexOf(array, value, fromIndex) {
-    var index = fromIndex - 1,
-        length = array.length;
+    /**
+     * The base implementation of `_.at` without support for individual paths.
+     *
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {string[]} paths The property paths to pick.
+     * @returns {Array} Returns the picked elements.
+     */
+    function baseAt(object, paths) {
+      var index = -1,
+          length = paths.length,
+          result = Array(length),
+          skip = object == null;
 
-    while (++index < length) {
-      if (array[index] === value) {
-        return index;
+      while (++index < length) {
+        result[index] = skip ? undefined$1 : get(object, paths[index]);
       }
+      return result;
     }
-    return -1;
-  }
 
-  /**
-   * A specialized version of `_.lastIndexOf` which performs strict equality
-   * comparisons of values, i.e. `===`.
-   *
-   * @private
-   * @param {Array} array The array to inspect.
-   * @param {*} value The value to search for.
-   * @param {number} fromIndex The index to search from.
-   * @returns {number} Returns the index of the matched value, else `-1`.
-   */
-  function strictLastIndexOf(array, value, fromIndex) {
-    var index = fromIndex + 1;
-    while (index--) {
-      if (array[index] === value) {
-        return index;
+    /**
+     * The base implementation of `_.clamp` which doesn't coerce arguments.
+     *
+     * @private
+     * @param {number} number The number to clamp.
+     * @param {number} [lower] The lower bound.
+     * @param {number} upper The upper bound.
+     * @returns {number} Returns the clamped number.
+     */
+    function baseClamp(number, lower, upper) {
+      if (number === number) {
+        if (upper !== undefined$1) {
+          number = number <= upper ? number : upper;
+        }
+        if (lower !== undefined$1) {
+          number = number >= lower ? number : lower;
+        }
       }
+      return number;
     }
-    return index;
-  }
 
-  /**
-   * Gets the number of symbols in `string`.
-   *
-   * @private
-   * @param {string} string The string to inspect.
-   * @returns {number} Returns the string size.
-   */
-  function stringSize(string) {
-    return hasUnicode(string)
-      ? unicodeSize(string)
-      : asciiSize(string);
-  }
+    /**
+     * The base implementation of `_.clone` and `_.cloneDeep` which tracks
+     * traversed objects.
+     *
+     * @private
+     * @param {*} value The value to clone.
+     * @param {boolean} bitmask The bitmask flags.
+     *  1 - Deep clone
+     *  2 - Flatten inherited properties
+     *  4 - Clone symbols
+     * @param {Function} [customizer] The function to customize cloning.
+     * @param {string} [key] The key of `value`.
+     * @param {Object} [object] The parent object of `value`.
+     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.
+     * @returns {*} Returns the cloned value.
+     */
+    function baseClone(value, bitmask, customizer, key, object, stack) {
+      var result,
+          isDeep = bitmask & CLONE_DEEP_FLAG,
+          isFlat = bitmask & CLONE_FLAT_FLAG,
+          isFull = bitmask & CLONE_SYMBOLS_FLAG;
 
-  /**
-   * Converts `string` to an array.
-   *
-   * @private
-   * @param {string} string The string to convert.
-   * @returns {Array} Returns the converted array.
-   */
-  function stringToArray(string) {
-    return hasUnicode(string)
-      ? unicodeToArray(string)
-      : asciiToArray(string);
-  }
+      if (customizer) {
+        result = object ? customizer(value, key, object, stack) : customizer(value);
+      }
+      if (result !== undefined$1) {
+        return result;
+      }
+      if (!isObject(value)) {
+        return value;
+      }
+      var isArr = isArray(value);
+      if (isArr) {
+        result = initCloneArray(value);
+        if (!isDeep) {
+          return copyArray(value, result);
+        }
+      } else {
+        var tag = getTag(value),
+            isFunc = tag == funcTag || tag == genTag;
 
-  /**
-   * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace
-   * character of `string`.
-   *
-   * @private
-   * @param {string} string The string to inspect.
-   * @returns {number} Returns the index of the last non-whitespace character.
-   */
-  function trimmedEndIndex(string) {
-    var index = string.length;
+        if (isBuffer(value)) {
+          return cloneBuffer(value, isDeep);
+        }
+        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
+          result = (isFlat || isFunc) ? {} : initCloneObject(value);
+          if (!isDeep) {
+            return isFlat
+              ? copySymbolsIn(value, baseAssignIn(result, value))
+              : copySymbols(value, baseAssign(result, value));
+          }
+        } else {
+          if (!cloneableTags[tag]) {
+            return object ? value : {};
+          }
+          result = initCloneByTag(value, tag, isDeep);
+        }
+      }
+      // Check for circular references and return its corresponding clone.
+      stack || (stack = new Stack);
+      var stacked = stack.get(value);
+      if (stacked) {
+        return stacked;
+      }
+      stack.set(value, result);
 
-    while (index-- && reWhitespace.test(string.charAt(index))) {}
-    return index;
-  }
+      if (isSet(value)) {
+        value.forEach(function(subValue) {
+          result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));
+        });
+      } else if (isMap(value)) {
+        value.forEach(function(subValue, key) {
+          result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));
+        });
+      }
 
-  /**
-   * Used by `_.unescape` to convert HTML entities to characters.
-   *
-   * @private
-   * @param {string} chr The matched character to unescape.
-   * @returns {string} Returns the unescaped character.
-   */
-  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);
+      var keysFunc = isFull
+        ? (isFlat ? getAllKeysIn : getAllKeys)
+        : (isFlat ? keysIn : keys);
 
-  /**
-   * Gets the size of a Unicode `string`.
-   *
-   * @private
-   * @param {string} string The string inspect.
-   * @returns {number} Returns the string size.
-   */
-  function unicodeSize(string) {
-    var result = reUnicode.lastIndex = 0;
-    while (reUnicode.test(string)) {
-      ++result;
+      var props = isArr ? undefined$1 : keysFunc(value);
+      arrayEach(props || value, function(subValue, key) {
+        if (props) {
+          key = subValue;
+          subValue = value[key];
+        }
+        // Recursively populate clone (susceptible to call stack limits).
+        assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));
+      });
+      return result;
     }
-    return result;
-  }
-
-  /**
-   * Converts a Unicode `string` to an array.
-   *
-   * @private
-   * @param {string} string The string to convert.
-   * @returns {Array} Returns the converted array.
-   */
-  function unicodeToArray(string) {
-    return string.match(reUnicode) || [];
-  }
-
-  /**
-   * Splits a Unicode `string` into an array of its words.
-   *
-   * @private
-   * @param {string} The string to inspect.
-   * @returns {Array} Returns the words of `string`.
-   */
-  function unicodeWords(string) {
-    return string.match(reUnicodeWord) || [];
-  }
-
-  /*--------------------------------------------------------------------------*/
-
-  /**
-   * Create a new pristine `lodash` function using the `context` object.
-   *
-   * @static
-   * @memberOf _
-   * @since 1.1.0
-   * @category Util
-   * @param {Object} [context=root] The context object.
-   * @returns {Function} Returns a new `lodash` function.
-   * @example
-   *
-   * _.mixin({ 'foo': _.constant('foo') });
-   *
-   * var lodash = _.runInContext();
-   * lodash.mixin({ 'bar': lodash.constant('bar') });
-   *
-   * _.isFunction(_.foo);
-   * // => true
-   * _.isFunction(_.bar);
-   * // => false
-   *
-   * lodash.isFunction(lodash.foo);
-   * // => false
-   * lodash.isFunction(lodash.bar);
-   * // => true
-   *
-   * // Create a suped-up `defer` in Node.js.
-   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;
-   */
-  var runInContext = (function runInContext(context) {
-    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));
 
-    /** Built-in constructor references. */
-    var Array = context.Array,
-        Date = context.Date,
-        Error = context.Error,
-        Function = context.Function,
-        Math = context.Math,
-        Object = context.Object,
-        RegExp = context.RegExp,
-        String = context.String,
-        TypeError = context.TypeError;
+    /**
+     * The base implementation of `_.conforms` which doesn't clone `source`.
+     *
+     * @private
+     * @param {Object} source The object of property predicates to conform to.
+     * @returns {Function} Returns the new spec function.
+     */
+    function baseConforms(source) {
+      var props = keys(source);
+      return function(object) {
+        return baseConformsTo(object, source, props);
+      };
+    }
 
-    /** Used for built-in method references. */
-    var arrayProto = Array.prototype,
-        funcProto = Function.prototype,
-        objectProto = Object.prototype;
+    /**
+     * The base implementation of `_.conformsTo` which accepts `props` to check.
+     *
+     * @private
+     * @param {Object} object The object to inspect.
+     * @param {Object} source The object of property predicates to conform to.
+     * @returns {boolean} Returns `true` if `object` conforms, else `false`.
+     */
+    function baseConformsTo(object, source, props) {
+      var length = props.length;
+      if (object == null) {
+        return !length;
+      }
+      object = Object(object);
+      while (length--) {
+        var key = props[length],
+            predicate = source[key],
+            value = object[key];
 
-    /** Used to detect overreaching core-js shims. */
-    var coreJsData = context['__core-js_shared__'];
+        if ((value === undefined$1 && !(key in object)) || !predicate(value)) {
+          return false;
+        }
+      }
+      return true;
+    }
 
-    /** Used to resolve the decompiled source of functions. */
-    var funcToString = funcProto.toString;
+    /**
+     * The base implementation of `_.delay` and `_.defer` which accepts `args`
+     * to provide to `func`.
+     *
+     * @private
+     * @param {Function} func The function to delay.
+     * @param {number} wait The number of milliseconds to delay invocation.
+     * @param {Array} args The arguments to provide to `func`.
+     * @returns {number|Object} Returns the timer id or timeout object.
+     */
+    function baseDelay(func, wait, args) {
+      if (typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
+      }
+      return setTimeout(function() { func.apply(undefined$1, args); }, wait);
+    }
 
-    /** Used to check objects for own properties. */
-    var hasOwnProperty = objectProto.hasOwnProperty;
+    /**
+     * The base implementation of methods like `_.difference` without support
+     * for excluding multiple arrays or iteratee shorthands.
+     *
+     * @private
+     * @param {Array} array The array to inspect.
+     * @param {Array} values The values to exclude.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     */
+    function baseDifference(array, values, iteratee, comparator) {
+      var index = -1,
+          includes = arrayIncludes,
+          isCommon = true,
+          length = array.length,
+          result = [],
+          valuesLength = values.length;
 
-    /** Used to generate unique IDs. */
-    var idCounter = 0;
+      if (!length) {
+        return result;
+      }
+      if (iteratee) {
+        values = arrayMap(values, baseUnary(iteratee));
+      }
+      if (comparator) {
+        includes = arrayIncludesWith;
+        isCommon = false;
+      }
+      else if (values.length >= LARGE_ARRAY_SIZE) {
+        includes = cacheHas;
+        isCommon = false;
+        values = new SetCache(values);
+      }
+      outer:
+      while (++index < length) {
+        var value = array[index],
+            computed = iteratee == null ? value : iteratee(value);
 
-    /** Used to detect methods masquerading as native. */
-    var maskSrcKey = (function() {
-      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');
-      return uid ? ('Symbol(src)_1.' + uid) : '';
-    }());
+        value = (comparator || value !== 0) ? value : 0;
+        if (isCommon && computed === computed) {
+          var valuesIndex = valuesLength;
+          while (valuesIndex--) {
+            if (values[valuesIndex] === computed) {
+              continue outer;
+            }
+          }
+          result.push(value);
+        }
+        else if (!includes(values, computed, comparator)) {
+          result.push(value);
+        }
+      }
+      return result;
+    }
 
     /**
-     * Used to resolve the
-     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)
-     * of values.
+     * The base implementation of `_.forEach` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Array|Object} Returns `collection`.
      */
-    var nativeObjectToString = objectProto.toString;
-
-    /** Used to infer the `Object` constructor. */
-    var objectCtorString = funcToString.call(Object);
-
-    /** Used to restore the original `_` reference in `_.noConflict`. */
-    var oldDash = root._;
+    var baseEach = createBaseEach(baseForOwn);
 
-    /** Used to detect if a method is native. */
-    var reIsNative = RegExp('^' +
-      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\$&')
-      .replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, '$1.*?') + '$'
-    );
+    /**
+     * The base implementation of `_.forEachRight` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Array|Object} Returns `collection`.
+     */
+    var baseEachRight = createBaseEach(baseForOwnRight, true);
 
-    /** Built-in value references. */
-    var Buffer = moduleExports ? context.Buffer : undefined$1,
-        Symbol = context.Symbol,
-        Uint8Array = context.Uint8Array,
-        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined$1,
-        getPrototype = overArg(Object.getPrototypeOf, Object),
-        objectCreate = Object.create,
-        propertyIsEnumerable = objectProto.propertyIsEnumerable,
-        splice = arrayProto.splice,
-        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined$1,
-        symIterator = Symbol ? Symbol.iterator : undefined$1,
-        symToStringTag = Symbol ? Symbol.toStringTag : undefined$1;
+    /**
+     * The base implementation of `_.every` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} predicate The function invoked per iteration.
+     * @returns {boolean} Returns `true` if all elements pass the predicate check,
+     *  else `false`
+     */
+    function baseEvery(collection, predicate) {
+      var result = true;
+      baseEach(collection, function(value, index, collection) {
+        result = !!predicate(value, index, collection);
+        return result;
+      });
+      return result;
+    }
 
-    var defineProperty = (function() {
-      try {
-        var func = getNative(Object, 'defineProperty');
-        func({}, '', {});
-        return func;
-      } catch (e) {}
-    }());
+    /**
+     * The base implementation of methods like `_.max` and `_.min` which accepts a
+     * `comparator` to determine the extremum value.
+     *
+     * @private
+     * @param {Array} array The array to iterate over.
+     * @param {Function} iteratee The iteratee invoked per iteration.
+     * @param {Function} comparator The comparator used to compare values.
+     * @returns {*} Returns the extremum value.
+     */
+    function baseExtremum(array, iteratee, comparator) {
+      var index = -1,
+          length = array.length;
 
-    /** Mocked built-ins. */
-    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,
-        ctxNow = Date && Date.now !== root.Date.now && Date.now,
-        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;
+      while (++index < length) {
+        var value = array[index],
+            current = iteratee(value);
 
-    /* Built-in method references for those with the same name as other `lodash` methods. */
-    var nativeCeil = Math.ceil,
-        nativeFloor = Math.floor,
-        nativeGetSymbols = Object.getOwnPropertySymbols,
-        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined$1,
-        nativeIsFinite = context.isFinite,
-        nativeJoin = arrayProto.join,
-        nativeKeys = overArg(Object.keys, Object),
-        nativeMax = Math.max,
-        nativeMin = Math.min,
-        nativeNow = Date.now,
-        nativeParseInt = context.parseInt,
-        nativeRandom = Math.random,
-        nativeReverse = arrayProto.reverse;
+        if (current != null && (computed === undefined$1
+              ? (current === current && !isSymbol(current))
+              : comparator(current, computed)
+            )) {
+          var computed = current,
+              result = value;
+        }
+      }
+      return result;
+    }
 
-    /* Built-in method references that are verified to be native. */
-    var DataView = getNative(context, 'DataView'),
-        Map = getNative(context, 'Map'),
-        Promise = getNative(context, 'Promise'),
-        Set = getNative(context, 'Set'),
-        WeakMap = getNative(context, 'WeakMap'),
-        nativeCreate = getNative(Object, 'create');
+    /**
+     * The base implementation of `_.fill` without an iteratee call guard.
+     *
+     * @private
+     * @param {Array} array The array to fill.
+     * @param {*} value The value to fill `array` with.
+     * @param {number} [start=0] The start position.
+     * @param {number} [end=array.length] The end position.
+     * @returns {Array} Returns `array`.
+     */
+    function baseFill(array, value, start, end) {
+      var length = array.length;
 
-    /** Used to store function metadata. */
-    var metaMap = WeakMap && new WeakMap;
+      start = toInteger(start);
+      if (start < 0) {
+        start = -start > length ? 0 : (length + start);
+      }
+      end = (end === undefined$1 || end > length) ? length : toInteger(end);
+      if (end < 0) {
+        end += length;
+      }
+      end = start > end ? 0 : toLength(end);
+      while (start < end) {
+        array[start++] = value;
+      }
+      return array;
+    }
 
-    /** Used to lookup unminified function names. */
-    var realNames = {};
+    /**
+     * The base implementation of `_.filter` without support for iteratee shorthands.
+     *
+     * @private
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} predicate The function invoked per iteration.
+     * @returns {Array} Returns the new filtered array.
+     */
+    function baseFilter(collection, predicate) {
+      var result = [];
+      baseEach(collection, function(value, index, collection) {
+        if (predicate(value, index, collection)) {
+          result.push(value);
+        }
+      });
+      return result;
+    }
 
-    /** Used to detect maps, sets, and weakmaps. */
-    var dataViewCtorString = toSource(DataView),
-        mapCtorString = toSource(Map),
-        promiseCtorString = toSource(Promise),
-        setCtorString = toSource(Set),
-        weakMapCtorString = toSource(WeakMap);
+    /**
+     * The base implementation of `_.flatten` with support for restricting flattening.
+     *
+     * @private
+     * @param {Array} array The array to flatten.
+     * @param {number} depth The maximum recursion depth.
+     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
+     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
+     * @param {Array} [result=[]] The initial result value.
+     * @returns {Array} Returns the new flattened array.
+     */
+    function baseFlatten(array, depth, predicate, isStrict, result) {
+      var index = -1,
+          length = array.length;
 
-    /** Used to convert symbols to primitives and strings. */
-    var symbolProto = Symbol ? Symbol.prototype : undefined$1,
-        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined$1,
-        symbolToString = symbolProto ? symbolProto.toString : undefined$1;
+      predicate || (predicate = isFlattenable);
+      result || (result = []);
 
-    /*------------------------------------------------------------------------*/
+      while (++index < length) {
+        var value = array[index];
+        if (depth > 0 && predicate(value)) {
+          if (depth > 1) {
+            // Recursively flatten arrays (susceptible to call stack limits).
+            baseFlatten(value, depth - 1, predicate, isStrict, result);
+          } else {
+            arrayPush(result, value);
+          }
+        } else if (!isStrict) {
+          result[result.length] = value;
+        }
+      }
+      return result;
+    }
 
     /**
-     * Creates a `lodash` object which wraps `value` to enable implicit method
-     * chain sequences. Methods that operate on and return arrays, collections,
-     * and functions can be chained together. Methods that retrieve a single value
-     * or may return a primitive value will automatically end the chain sequence
-     * and return the unwrapped value. Otherwise, the value must be unwrapped
-     * with `_#value`.
-     *
-     * Explicit chain sequences, which must be unwrapped with `_#value`, may be
-     * enabled using `_.chain`.
-     *
-     * The execution of chained methods is lazy, that is, it's deferred until
-     * `_#value` is implicitly or explicitly called.
-     *
-     * Lazy evaluation allows several methods to support shortcut fusion.
-     * Shortcut fusion is an optimization to merge iteratee calls; this avoids
-     * the creation of intermediate arrays and can greatly reduce the number of
-     * iteratee executions. Sections of a chain sequence qualify for shortcut
-     * fusion if the section is applied to an array and iteratees accept only
-     * one argument. The heuristic for whether a section qualifies for shortcut
-     * fusion is subject to change.
-     *
-     * Chaining is supported in custom builds as long as the `_#value` method is
-     * directly or indirectly included in the build.
-     *
-     * In addition to lodash methods, wrappers have `Array` and `String` methods.
-     *
-     * The wrapper `Array` methods are:
-     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`
-     *
-     * The wrapper `String` methods are:
-     * `replace` and `split`
-     *
-     * The wrapper methods that support shortcut fusion are:
-     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,
-     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,
-     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`
-     *
-     * The chainable wrapper methods are:
-     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,
-     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,
-     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,
-     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,
-     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,
-     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,
-     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,
-     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,
-     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,
-     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,
-     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,
-     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,
-     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,
-     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,
-     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,
-     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,
-     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,
-     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,
-     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,
-     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,
-     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,
-     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,
-     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,
-     * `zipObject`, `zipObjectDeep`, and `zipWith`
-     *
-     * The wrapper methods that are **not** chainable by default are:
-     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,
-     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,
-     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,
-     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,
-     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,
-     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,
-     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,
-     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,
-     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,
-     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,
-     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,
-     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,
-     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,
-     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,
-     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,
-     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,
-     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,
-     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,
-     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,
-     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,
-     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,
-     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,
-     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,
-     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,
-     * `upperFirst`, `value`, and `words`
-     *
-     * @name _
-     * @constructor
-     * @category Seq
-     * @param {*} value The value to wrap in a `lodash` instance.
-     * @returns {Object} Returns the new `lodash` wrapper instance.
-     * @example
-     *
-     * function square(n) {
-     *   return n * n;
-     * }
-     *
-     * var wrapped = _([1, 2, 3]);
+     * The base implementation of `baseForOwn` which iterates over `object`
+     * properties returned by `keysFunc` and invokes `iteratee` for each property.
+     * Iteratee functions may exit iteration early by explicitly returning `false`.
      *
-     * // Returns an unwrapped value.
-     * wrapped.reduce(_.add);
-     * // => 6
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @param {Function} keysFunc The function to get the keys of `object`.
+     * @returns {Object} Returns `object`.
+     */
+    var baseFor = createBaseFor();
+
+    /**
+     * This function is like `baseFor` except that it iterates over properties
+     * in the opposite order.
      *
-     * // Returns a wrapped value.
-     * var squares = wrapped.map(square);
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @param {Function} keysFunc The function to get the keys of `object`.
+     * @returns {Object} Returns `object`.
+     */
+    var baseForRight = createBaseFor(true);
+
+    /**
+     * The base implementation of `_.forOwn` without support for iteratee shorthands.
      *
-     * _.isArray(squares);
-     * // => false
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Object} Returns `object`.
+     */
+    function baseForOwn(object, iteratee) {
+      return object && baseFor(object, iteratee, keys);
+    }
+
+    /**
+     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.
      *
-     * _.isArray(squares.value());
-     * // => true
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Object} Returns `object`.
      */
-    function lodash(value) {
-      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {
-        if (value instanceof LodashWrapper) {
-          return value;
-        }
-        if (hasOwnProperty.call(value, '__wrapped__')) {
-          return wrapperClone(value);
-        }
-      }
-      return new LodashWrapper(value);
+    function baseForOwnRight(object, iteratee) {
+      return object && baseForRight(object, iteratee, keys);
     }
 
     /**
-     * The base implementation of `_.create` without support for assigning
-     * properties to the created object.
+     * The base implementation of `_.functions` which creates an array of
+     * `object` function property names filtered from `props`.
      *
      * @private
-     * @param {Object} proto The object to inherit from.
-     * @returns {Object} Returns the new object.
+     * @param {Object} object The object to inspect.
+     * @param {Array} props The property names to filter.
+     * @returns {Array} Returns the function names.
      */
-    var baseCreate = (function() {
-      function object() {}
-      return function(proto) {
-        if (!isObject(proto)) {
-          return {};
-        }
-        if (objectCreate) {
-          return objectCreate(proto);
-        }
-        object.prototype = proto;
-        var result = new object;
-        object.prototype = undefined$1;
-        return result;
-      };
-    }());
+    function baseFunctions(object, props) {
+      return arrayFilter(props, function(key) {
+        return isFunction(object[key]);
+      });
+    }
 
     /**
-     * The function whose prototype chain sequence wrappers inherit from.
+     * The base implementation of `_.get` without support for default values.
      *
      * @private
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path of the property to get.
+     * @returns {*} Returns the resolved value.
      */
-    function baseLodash() {
-      // No operation performed.
+    function baseGet(object, path) {
+      path = castPath(path, object);
+
+      var index = 0,
+          length = path.length;
+
+      while (object != null && index < length) {
+        object = object[toKey(path[index++])];
+      }
+      return (index && index == length) ? object : undefined$1;
     }
 
     /**
-     * The base constructor for creating `lodash` wrapper objects.
+     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses
+     * `keysFunc` and `symbolsFunc` to get the enumerable property names and
+     * symbols of `object`.
      *
      * @private
-     * @param {*} value The value to wrap.
-     * @param {boolean} [chainAll] Enable explicit method chain sequences.
+     * @param {Object} object The object to query.
+     * @param {Function} keysFunc The function to get the keys of `object`.
+     * @param {Function} symbolsFunc The function to get the symbols of `object`.
+     * @returns {Array} Returns the array of property names and symbols.
      */
-    function LodashWrapper(value, chainAll) {
-      this.__wrapped__ = value;
-      this.__actions__ = [];
-      this.__chain__ = !!chainAll;
-      this.__index__ = 0;
-      this.__values__ = undefined$1;
+    function baseGetAllKeys(object, keysFunc, symbolsFunc) {
+      var result = keysFunc(object);
+      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));
     }
 
     /**
-     * By default, the template delimiters used by lodash are like those in
-     * embedded Ruby (ERB) as well as ES2015 template strings. Change the
-     * following template settings to use alternative delimiters.
+     * The base implementation of `getTag` without fallbacks for buggy environments.
      *
-     * @static
-     * @memberOf _
-     * @type {Object}
+     * @private
+     * @param {*} value The value to query.
+     * @returns {string} Returns the `toStringTag`.
      */
-    lodash.templateSettings = {
-
-      /**
-       * Used to detect `data` property values to be HTML-escaped.
-       *
-       * @memberOf _.templateSettings
-       * @type {RegExp}
-       */
-      'escape': reEscape,
-
-      /**
-       * Used to detect code to be evaluated.
-       *
-       * @memberOf _.templateSettings
-       * @type {RegExp}
-       */
-      'evaluate': reEvaluate,
-
-      /**
-       * Used to detect `data` property values to inject.
-       *
-       * @memberOf _.templateSettings
-       * @type {RegExp}
-       */
-      'interpolate': reInterpolate,
-
-      /**
-       * Used to reference the data object in the template text.
-       *
-       * @memberOf _.templateSettings
-       * @type {string}
-       */
-      'variable': '',
-
-      /**
-       * Used to import variables into the compiled template.
-       *
-       * @memberOf _.templateSettings
-       * @type {Object}
-       */
-      'imports': {
-
-        /**
-         * A reference to the `lodash` function.
-         *
-         * @memberOf _.templateSettings.imports
-         * @type {Function}
-         */
-        '_': lodash
+    function baseGetTag(value) {
+      if (value == null) {
+        return value === undefined$1 ? undefinedTag : nullTag;
       }
-    };
-
-    // Ensure wrappers are instances of `baseLodash`.
-    lodash.prototype = baseLodash.prototype;
-    lodash.prototype.constructor = lodash;
-
-    LodashWrapper.prototype = baseCreate(baseLodash.prototype);
-    LodashWrapper.prototype.constructor = LodashWrapper;
+      return (symToStringTag && symToStringTag in Object(value))
+        ? getRawTag(value)
+        : objectToString(value);
+    }
 
-    /*------------------------------------------------------------------------*/
+    /**
+     * The base implementation of `_.gt` which doesn't coerce arguments.
+     *
+     * @private
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if `value` is greater than `other`,
+     *  else `false`.
+     */
+    function baseGt(value, other) {
+      return value > other;
+    }
 
     /**
-     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.
+     * The base implementation of `_.has` without support for deep paths.
      *
      * @private
-     * @constructor
-     * @param {*} value The value to wrap.
+     * @param {Object} [object] The object to query.
+     * @param {Array|string} key The key to check.
+     * @returns {boolean} Returns `true` if `key` exists, else `false`.
      */
-    function LazyWrapper(value) {
-      this.__wrapped__ = value;
-      this.__actions__ = [];
-      this.__dir__ = 1;
-      this.__filtered__ = false;
-      this.__iteratees__ = [];
-      this.__takeCount__ = MAX_ARRAY_LENGTH;
-      this.__views__ = [];
+    function baseHas(object, key) {
+      return object != null && hasOwnProperty.call(object, key);
     }
 
     /**
-     * Creates a clone of the lazy wrapper object.
+     * The base implementation of `_.hasIn` without support for deep paths.
      *
      * @private
-     * @name clone
-     * @memberOf LazyWrapper
-     * @returns {Object} Returns the cloned `LazyWrapper` object.
+     * @param {Object} [object] The object to query.
+     * @param {Array|string} key The key to check.
+     * @returns {boolean} Returns `true` if `key` exists, else `false`.
      */
-    function lazyClone() {
-      var result = new LazyWrapper(this.__wrapped__);
-      result.__actions__ = copyArray(this.__actions__);
-      result.__dir__ = this.__dir__;
-      result.__filtered__ = this.__filtered__;
-      result.__iteratees__ = copyArray(this.__iteratees__);
-      result.__takeCount__ = this.__takeCount__;
-      result.__views__ = copyArray(this.__views__);
-      return result;
+    function baseHasIn(object, key) {
+      return object != null && key in Object(object);
     }
 
     /**
-     * Reverses the direction of lazy iteration.
+     * The base implementation of `_.inRange` which doesn't coerce arguments.
      *
      * @private
-     * @name reverse
-     * @memberOf LazyWrapper
-     * @returns {Object} Returns the new reversed `LazyWrapper` object.
+     * @param {number} number The number to check.
+     * @param {number} start The start of the range.
+     * @param {number} end The end of the range.
+     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.
      */
-    function lazyReverse() {
-      if (this.__filtered__) {
-        var result = new LazyWrapper(this);
-        result.__dir__ = -1;
-        result.__filtered__ = true;
-      } else {
-        result = this.clone();
-        result.__dir__ *= -1;
-      }
-      return result;
+    function baseInRange(number, start, end) {
+      return number >= nativeMin(start, end) && number < nativeMax(start, end);
     }
 
     /**
-     * Extracts the unwrapped value from its lazy wrapper.
+     * The base implementation of methods like `_.intersection`, without support
+     * for iteratee shorthands, that accepts an array of arrays to inspect.
      *
      * @private
-     * @name value
-     * @memberOf LazyWrapper
-     * @returns {*} Returns the unwrapped value.
+     * @param {Array} arrays The arrays to inspect.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of shared values.
      */
-    function lazyValue() {
-      var array = this.__wrapped__.value(),
-          dir = this.__dir__,
-          isArr = isArray(array),
-          isRight = dir < 0,
-          arrLength = isArr ? array.length : 0,
-          view = getView(0, arrLength, this.__views__),
-          start = view.start,
-          end = view.end,
-          length = end - start,
-          index = isRight ? end : (start - 1),
-          iteratees = this.__iteratees__,
-          iterLength = iteratees.length,
-          resIndex = 0,
-          takeCount = nativeMin(length, this.__takeCount__);
+    function baseIntersection(arrays, iteratee, comparator) {
+      var includes = comparator ? arrayIncludesWith : arrayIncludes,
+          length = arrays[0].length,
+          othLength = arrays.length,
+          othIndex = othLength,
+          caches = Array(othLength),
+          maxLength = Infinity,
+          result = [];
 
-      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {
-        return baseWrapperValue(array, this.__actions__);
+      while (othIndex--) {
+        var array = arrays[othIndex];
+        if (othIndex && iteratee) {
+          array = arrayMap(array, baseUnary(iteratee));
+        }
+        maxLength = nativeMin(array.length, maxLength);
+        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))
+          ? new SetCache(othIndex && array)
+          : undefined$1;
       }
-      var result = [];
-
-      outer:
-      while (length-- && resIndex < takeCount) {
-        index += dir;
+      array = arrays[0];
 
-        var iterIndex = -1,
-            value = array[index];
+      var index = -1,
+          seen = caches[0];
 
-        while (++iterIndex < iterLength) {
-          var data = iteratees[iterIndex],
-              iteratee = data.iteratee,
-              type = data.type,
-              computed = iteratee(value);
+      outer:
+      while (++index < length && result.length < maxLength) {
+        var value = array[index],
+            computed = iteratee ? iteratee(value) : value;
 
-          if (type == LAZY_MAP_FLAG) {
-            value = computed;
-          } else if (!computed) {
-            if (type == LAZY_FILTER_FLAG) {
+        value = (comparator || value !== 0) ? value : 0;
+        if (!(seen
+              ? cacheHas(seen, computed)
+              : includes(result, computed, comparator)
+            )) {
+          othIndex = othLength;
+          while (--othIndex) {
+            var cache = caches[othIndex];
+            if (!(cache
+                  ? cacheHas(cache, computed)
+                  : includes(arrays[othIndex], computed, comparator))
+                ) {
               continue outer;
-            } else {
-              break outer;
             }
           }
+          if (seen) {
+            seen.push(computed);
+          }
+          result.push(value);
         }
-        result[resIndex++] = value;
       }
       return result;
     }
 
-    // Ensure `LazyWrapper` is an instance of `baseLodash`.
-    LazyWrapper.prototype = baseCreate(baseLodash.prototype);
-    LazyWrapper.prototype.constructor = LazyWrapper;
-
-    /*------------------------------------------------------------------------*/
+    /**
+     * The base implementation of `_.invert` and `_.invertBy` which inverts
+     * `object` with values transformed by `iteratee` and set by `setter`.
+     *
+     * @private
+     * @param {Object} object The object to iterate over.
+     * @param {Function} setter The function to set `accumulator` values.
+     * @param {Function} iteratee The iteratee to transform values.
+     * @param {Object} accumulator The initial inverted object.
+     * @returns {Function} Returns `accumulator`.
+     */
+    function baseInverter(object, setter, iteratee, accumulator) {
+      baseForOwn(object, function(value, key, object) {
+        setter(accumulator, iteratee(value), key, object);
+      });
+      return accumulator;
+    }
 
     /**
-     * Creates a hash object.
+     * The base implementation of `_.invoke` without support for individual
+     * method arguments.
      *
      * @private
-     * @constructor
-     * @param {Array} [entries] The key-value pairs to cache.
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path of the method to invoke.
+     * @param {Array} args The arguments to invoke the method with.
+     * @returns {*} Returns the result of the invoked method.
      */
-    function Hash(entries) {
-      var index = -1,
-          length = entries == null ? 0 : entries.length;
+    function baseInvoke(object, path, args) {
+      path = castPath(path, object);
+      object = parent(object, path);
+      var func = object == null ? object : object[toKey(last(path))];
+      return func == null ? undefined$1 : apply(func, object, args);
+    }
 
-      this.clear();
-      while (++index < length) {
-        var entry = entries[index];
-        this.set(entry[0], entry[1]);
-      }
+    /**
+     * The base implementation of `_.isArguments`.
+     *
+     * @private
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an `arguments` object,
+     */
+    function baseIsArguments(value) {
+      return isObjectLike(value) && baseGetTag(value) == argsTag;
     }
 
     /**
-     * Removes all key-value entries from the hash.
+     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.
      *
      * @private
-     * @name clear
-     * @memberOf Hash
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.
      */
-    function hashClear() {
-      this.__data__ = nativeCreate ? nativeCreate(null) : {};
-      this.size = 0;
+    function baseIsArrayBuffer(value) {
+      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;
     }
 
     /**
-     * Removes `key` and its value from the hash.
+     * The base implementation of `_.isDate` without Node.js optimizations.
      *
      * @private
-     * @name delete
-     * @memberOf Hash
-     * @param {Object} hash The hash to modify.
-     * @param {string} key The key of the value to remove.
-     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.
      */
-    function hashDelete(key) {
-      var result = this.has(key) && delete this.__data__[key];
-      this.size -= result ? 1 : 0;
-      return result;
+    function baseIsDate(value) {
+      return isObjectLike(value) && baseGetTag(value) == dateTag;
     }
 
     /**
-     * Gets the hash value for `key`.
+     * The base implementation of `_.isEqual` which supports partial comparisons
+     * and tracks traversed objects.
      *
      * @private
-     * @name get
-     * @memberOf Hash
-     * @param {string} key The key of the value to get.
-     * @returns {*} Returns the entry value.
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @param {boolean} bitmask The bitmask flags.
+     *  1 - Unordered comparison
+     *  2 - Partial comparison
+     * @param {Function} [customizer] The function to customize comparisons.
+     * @param {Object} [stack] Tracks traversed `value` and `other` objects.
+     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
      */
-    function hashGet(key) {
-      var data = this.__data__;
-      if (nativeCreate) {
-        var result = data[key];
-        return result === HASH_UNDEFINED ? undefined$1 : result;
+    function baseIsEqual(value, other, bitmask, customizer, stack) {
+      if (value === other) {
+        return true;
       }
-      return hasOwnProperty.call(data, key) ? data[key] : undefined$1;
+      if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {
+        return value !== value && other !== other;
+      }
+      return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
     }
 
     /**
-     * Checks if a hash value for `key` exists.
+     * A specialized version of `baseIsEqual` for arrays and objects which performs
+     * deep comparisons and tracks traversed objects enabling objects with circular
+     * references to be compared.
      *
      * @private
-     * @name has
-     * @memberOf Hash
-     * @param {string} key The key of the entry to check.
-     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     * @param {Object} object The object to compare.
+     * @param {Object} other The other object to compare.
+     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+     * @param {Function} customizer The function to customize comparisons.
+     * @param {Function} equalFunc The function to determine equivalents of values.
+     * @param {Object} [stack] Tracks traversed `object` and `other` objects.
+     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
      */
-    function hashHas(key) {
-      var data = this.__data__;
-      return nativeCreate ? (data[key] !== undefined$1) : hasOwnProperty.call(data, key);
+    function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
+      var objIsArr = isArray(object),
+          othIsArr = isArray(other),
+          objTag = objIsArr ? arrayTag : getTag(object),
+          othTag = othIsArr ? arrayTag : getTag(other);
+
+      objTag = objTag == argsTag ? objectTag : objTag;
+      othTag = othTag == argsTag ? objectTag : othTag;
+
+      var objIsObj = objTag == objectTag,
+          othIsObj = othTag == objectTag,
+          isSameTag = objTag == othTag;
+
+      if (isSameTag && isBuffer(object)) {
+        if (!isBuffer(other)) {
+          return false;
+        }
+        objIsArr = true;
+        objIsObj = false;
+      }
+      if (isSameTag && !objIsObj) {
+        stack || (stack = new Stack);
+        return (objIsArr || isTypedArray(object))
+          ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)
+          : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
+      }
+      if (!(bitmask & COMPARE_PARTIAL_FLAG)) {
+        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
+            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
+
+        if (objIsWrapped || othIsWrapped) {
+          var objUnwrapped = objIsWrapped ? object.value() : object,
+              othUnwrapped = othIsWrapped ? other.value() : other;
+
+          stack || (stack = new Stack);
+          return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);
+        }
+      }
+      if (!isSameTag) {
+        return false;
+      }
+      stack || (stack = new Stack);
+      return equalObjects(object, other, bitmask, customizer, equalFunc, stack);
     }
 
     /**
-     * Sets the hash `key` to `value`.
+     * The base implementation of `_.isMap` without Node.js optimizations.
      *
      * @private
-     * @name set
-     * @memberOf Hash
-     * @param {string} key The key of the value to set.
-     * @param {*} value The value to set.
-     * @returns {Object} Returns the hash instance.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a map, else `false`.
      */
-    function hashSet(key, value) {
-      var data = this.__data__;
-      this.size += this.has(key) ? 0 : 1;
-      data[key] = (nativeCreate && value === undefined$1) ? HASH_UNDEFINED : value;
-      return this;
+    function baseIsMap(value) {
+      return isObjectLike(value) && getTag(value) == mapTag;
     }
 
-    // Add methods to `Hash`.
-    Hash.prototype.clear = hashClear;
-    Hash.prototype['delete'] = hashDelete;
-    Hash.prototype.get = hashGet;
-    Hash.prototype.has = hashHas;
-    Hash.prototype.set = hashSet;
-
-    /*------------------------------------------------------------------------*/
-
     /**
-     * Creates an list cache object.
+     * The base implementation of `_.isMatch` without support for iteratee shorthands.
      *
      * @private
-     * @constructor
-     * @param {Array} [entries] The key-value pairs to cache.
+     * @param {Object} object The object to inspect.
+     * @param {Object} source The object of property values to match.
+     * @param {Array} matchData The property names, values, and compare flags to match.
+     * @param {Function} [customizer] The function to customize comparisons.
+     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
      */
-    function ListCache(entries) {
-      var index = -1,
-          length = entries == null ? 0 : entries.length;
+    function baseIsMatch(object, source, matchData, customizer) {
+      var index = matchData.length,
+          length = index,
+          noCustomizer = !customizer;
 
-      this.clear();
+      if (object == null) {
+        return !length;
+      }
+      object = Object(object);
+      while (index--) {
+        var data = matchData[index];
+        if ((noCustomizer && data[2])
+              ? data[1] !== object[data[0]]
+              : !(data[0] in object)
+            ) {
+          return false;
+        }
+      }
       while (++index < length) {
-        var entry = entries[index];
-        this.set(entry[0], entry[1]);
+        data = matchData[index];
+        var key = data[0],
+            objValue = object[key],
+            srcValue = data[1];
+
+        if (noCustomizer && data[2]) {
+          if (objValue === undefined$1 && !(key in object)) {
+            return false;
+          }
+        } else {
+          var stack = new Stack;
+          if (customizer) {
+            var result = customizer(objValue, srcValue, key, object, source, stack);
+          }
+          if (!(result === undefined$1
+                ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)
+                : result
+              )) {
+            return false;
+          }
+        }
       }
+      return true;
     }
 
     /**
-     * Removes all key-value entries from the list cache.
+     * The base implementation of `_.isNative` without bad shim checks.
      *
      * @private
-     * @name clear
-     * @memberOf ListCache
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a native function,
+     *  else `false`.
      */
-    function listCacheClear() {
-      this.__data__ = [];
-      this.size = 0;
+    function baseIsNative(value) {
+      if (!isObject(value) || isMasked(value)) {
+        return false;
+      }
+      var pattern = isFunction(value) ? reIsNative : reIsHostCtor;
+      return pattern.test(toSource(value));
     }
 
     /**
-     * Removes `key` and its value from the list cache.
+     * The base implementation of `_.isRegExp` without Node.js optimizations.
      *
      * @private
-     * @name delete
-     * @memberOf ListCache
-     * @param {string} key The key of the value to remove.
-     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.
      */
-    function listCacheDelete(key) {
-      var data = this.__data__,
-          index = assocIndexOf(data, key);
-
-      if (index < 0) {
-        return false;
-      }
-      var lastIndex = data.length - 1;
-      if (index == lastIndex) {
-        data.pop();
-      } else {
-        splice.call(data, index, 1);
-      }
-      --this.size;
-      return true;
+    function baseIsRegExp(value) {
+      return isObjectLike(value) && baseGetTag(value) == regexpTag;
     }
 
     /**
-     * Gets the list cache value for `key`.
+     * The base implementation of `_.isSet` without Node.js optimizations.
      *
      * @private
-     * @name get
-     * @memberOf ListCache
-     * @param {string} key The key of the value to get.
-     * @returns {*} Returns the entry value.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a set, else `false`.
      */
-    function listCacheGet(key) {
-      var data = this.__data__,
-          index = assocIndexOf(data, key);
-
-      return index < 0 ? undefined$1 : data[index][1];
+    function baseIsSet(value) {
+      return isObjectLike(value) && getTag(value) == setTag;
     }
 
     /**
-     * Checks if a list cache value for `key` exists.
+     * The base implementation of `_.isTypedArray` without Node.js optimizations.
      *
      * @private
-     * @name has
-     * @memberOf ListCache
-     * @param {string} key The key of the entry to check.
-     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
      */
-    function listCacheHas(key) {
-      return assocIndexOf(this.__data__, key) > -1;
+    function baseIsTypedArray(value) {
+      return isObjectLike(value) &&
+        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];
     }
 
     /**
-     * Sets the list cache `key` to `value`.
+     * The base implementation of `_.iteratee`.
      *
      * @private
-     * @name set
-     * @memberOf ListCache
-     * @param {string} key The key of the value to set.
-     * @param {*} value The value to set.
-     * @returns {Object} Returns the list cache instance.
+     * @param {*} [value=_.identity] The value to convert to an iteratee.
+     * @returns {Function} Returns the iteratee.
      */
-    function listCacheSet(key, value) {
-      var data = this.__data__,
-          index = assocIndexOf(data, key);
-
-      if (index < 0) {
-        ++this.size;
-        data.push([key, value]);
-      } else {
-        data[index][1] = value;
+    function baseIteratee(value) {
+      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
+      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
+      if (typeof value == 'function') {
+        return value;
       }
-      return this;
+      if (value == null) {
+        return identity;
+      }
+      if (typeof value == 'object') {
+        return isArray(value)
+          ? baseMatchesProperty(value[0], value[1])
+          : baseMatches(value);
+      }
+      return property(value);
     }
 
-    // Add methods to `ListCache`.
-    ListCache.prototype.clear = listCacheClear;
-    ListCache.prototype['delete'] = listCacheDelete;
-    ListCache.prototype.get = listCacheGet;
-    ListCache.prototype.has = listCacheHas;
-    ListCache.prototype.set = listCacheSet;
-
-    /*------------------------------------------------------------------------*/
+    /**
+     * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.
+     *
+     * @private
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names.
+     */
+    function baseKeys(object) {
+      if (!isPrototype(object)) {
+        return nativeKeys(object);
+      }
+      var result = [];
+      for (var key in Object(object)) {
+        if (hasOwnProperty.call(object, key) && key != 'constructor') {
+          result.push(key);
+        }
+      }
+      return result;
+    }
 
     /**
-     * Creates a map cache object to store key-value pairs.
+     * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.
      *
      * @private
-     * @constructor
-     * @param {Array} [entries] The key-value pairs to cache.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names.
      */
-    function MapCache(entries) {
-      var index = -1,
-          length = entries == null ? 0 : entries.length;
+    function baseKeysIn(object) {
+      if (!isObject(object)) {
+        return nativeKeysIn(object);
+      }
+      var isProto = isPrototype(object),
+          result = [];
 
-      this.clear();
-      while (++index < length) {
-        var entry = entries[index];
-        this.set(entry[0], entry[1]);
+      for (var key in object) {
+        if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {
+          result.push(key);
+        }
       }
+      return result;
     }
 
     /**
-     * Removes all key-value entries from the map.
+     * The base implementation of `_.lt` which doesn't coerce arguments.
      *
      * @private
-     * @name clear
-     * @memberOf MapCache
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if `value` is less than `other`,
+     *  else `false`.
      */
-    function mapCacheClear() {
-      this.size = 0;
-      this.__data__ = {
-        'hash': new Hash,
-        'map': new (Map || ListCache),
-        'string': new Hash
-      };
+    function baseLt(value, other) {
+      return value < other;
     }
 
     /**
-     * Removes `key` and its value from the map.
+     * The base implementation of `_.map` without support for iteratee shorthands.
      *
      * @private
-     * @name delete
-     * @memberOf MapCache
-     * @param {string} key The key of the value to remove.
-     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} iteratee The function invoked per iteration.
+     * @returns {Array} Returns the new mapped array.
      */
-    function mapCacheDelete(key) {
-      var result = getMapData(this, key)['delete'](key);
-      this.size -= result ? 1 : 0;
+    function baseMap(collection, iteratee) {
+      var index = -1,
+          result = isArrayLike(collection) ? Array(collection.length) : [];
+
+      baseEach(collection, function(value, key, collection) {
+        result[++index] = iteratee(value, key, collection);
+      });
       return result;
     }
 
     /**
-     * Gets the map value for `key`.
+     * The base implementation of `_.matches` which doesn't clone `source`.
      *
      * @private
-     * @name get
-     * @memberOf MapCache
-     * @param {string} key The key of the value to get.
-     * @returns {*} Returns the entry value.
+     * @param {Object} source The object of property values to match.
+     * @returns {Function} Returns the new spec function.
      */
-    function mapCacheGet(key) {
-      return getMapData(this, key).get(key);
+    function baseMatches(source) {
+      var matchData = getMatchData(source);
+      if (matchData.length == 1 && matchData[0][2]) {
+        return matchesStrictComparable(matchData[0][0], matchData[0][1]);
+      }
+      return function(object) {
+        return object === source || baseIsMatch(object, source, matchData);
+      };
     }
 
     /**
-     * Checks if a map value for `key` exists.
+     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.
      *
      * @private
-     * @name has
-     * @memberOf MapCache
-     * @param {string} key The key of the entry to check.
-     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     * @param {string} path The path of the property to get.
+     * @param {*} srcValue The value to match.
+     * @returns {Function} Returns the new spec function.
      */
-    function mapCacheHas(key) {
-      return getMapData(this, key).has(key);
+    function baseMatchesProperty(path, srcValue) {
+      if (isKey(path) && isStrictComparable(srcValue)) {
+        return matchesStrictComparable(toKey(path), srcValue);
+      }
+      return function(object) {
+        var objValue = get(object, path);
+        return (objValue === undefined$1 && objValue === srcValue)
+          ? hasIn(object, path)
+          : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);
+      };
     }
 
     /**
-     * Sets the map `key` to `value`.
+     * The base implementation of `_.merge` without support for multiple sources.
      *
      * @private
-     * @name set
-     * @memberOf MapCache
-     * @param {string} key The key of the value to set.
-     * @param {*} value The value to set.
-     * @returns {Object} Returns the map cache instance.
+     * @param {Object} object The destination object.
+     * @param {Object} source The source object.
+     * @param {number} srcIndex The index of `source`.
+     * @param {Function} [customizer] The function to customize merged values.
+     * @param {Object} [stack] Tracks traversed source values and their merged
+     *  counterparts.
      */
-    function mapCacheSet(key, value) {
-      var data = getMapData(this, key),
-          size = data.size;
+    function baseMerge(object, source, srcIndex, customizer, stack) {
+      if (object === source) {
+        return;
+      }
+      baseFor(source, function(srcValue, key) {
+        stack || (stack = new Stack);
+        if (isObject(srcValue)) {
+          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
+        }
+        else {
+          var newValue = customizer
+            ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)
+            : undefined$1;
 
-      data.set(key, value);
-      this.size += data.size == size ? 0 : 1;
-      return this;
+          if (newValue === undefined$1) {
+            newValue = srcValue;
+          }
+          assignMergeValue(object, key, newValue);
+        }
+      }, keysIn);
     }
 
-    // Add methods to `MapCache`.
-    MapCache.prototype.clear = mapCacheClear;
-    MapCache.prototype['delete'] = mapCacheDelete;
-    MapCache.prototype.get = mapCacheGet;
-    MapCache.prototype.has = mapCacheHas;
-    MapCache.prototype.set = mapCacheSet;
-
-    /*------------------------------------------------------------------------*/
-
     /**
-     *
-     * Creates an array cache object to store unique values.
+     * A specialized version of `baseMerge` for arrays and objects which performs
+     * deep merges and tracks traversed objects enabling objects with circular
+     * references to be merged.
      *
      * @private
-     * @constructor
-     * @param {Array} [values] The values to cache.
+     * @param {Object} object The destination object.
+     * @param {Object} source The source object.
+     * @param {string} key The key of the value to merge.
+     * @param {number} srcIndex The index of `source`.
+     * @param {Function} mergeFunc The function to merge values.
+     * @param {Function} [customizer] The function to customize assigned values.
+     * @param {Object} [stack] Tracks traversed source values and their merged
+     *  counterparts.
      */
-    function SetCache(values) {
-      var index = -1,
-          length = values == null ? 0 : values.length;
+    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {
+      var objValue = safeGet(object, key),
+          srcValue = safeGet(source, key),
+          stacked = stack.get(srcValue);
 
-      this.__data__ = new MapCache;
-      while (++index < length) {
-        this.add(values[index]);
+      if (stacked) {
+        assignMergeValue(object, key, stacked);
+        return;
+      }
+      var newValue = customizer
+        ? customizer(objValue, srcValue, (key + ''), object, source, stack)
+        : undefined$1;
+
+      var isCommon = newValue === undefined$1;
+
+      if (isCommon) {
+        var isArr = isArray(srcValue),
+            isBuff = !isArr && isBuffer(srcValue),
+            isTyped = !isArr && !isBuff && isTypedArray(srcValue);
+
+        newValue = srcValue;
+        if (isArr || isBuff || isTyped) {
+          if (isArray(objValue)) {
+            newValue = objValue;
+          }
+          else if (isArrayLikeObject(objValue)) {
+            newValue = copyArray(objValue);
+          }
+          else if (isBuff) {
+            isCommon = false;
+            newValue = cloneBuffer(srcValue, true);
+          }
+          else if (isTyped) {
+            isCommon = false;
+            newValue = cloneTypedArray(srcValue, true);
+          }
+          else {
+            newValue = [];
+          }
+        }
+        else if (isPlainObject(srcValue) || isArguments(srcValue)) {
+          newValue = objValue;
+          if (isArguments(objValue)) {
+            newValue = toPlainObject(objValue);
+          }
+          else if (!isObject(objValue) || isFunction(objValue)) {
+            newValue = initCloneObject(srcValue);
+          }
+        }
+        else {
+          isCommon = false;
+        }
+      }
+      if (isCommon) {
+        // Recursively merge objects and arrays (susceptible to call stack limits).
+        stack.set(srcValue, newValue);
+        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);
+        stack['delete'](srcValue);
       }
+      assignMergeValue(object, key, newValue);
     }
 
     /**
-     * Adds `value` to the array cache.
+     * The base implementation of `_.nth` which doesn't coerce arguments.
      *
      * @private
-     * @name add
-     * @memberOf SetCache
-     * @alias push
-     * @param {*} value The value to cache.
-     * @returns {Object} Returns the cache instance.
+     * @param {Array} array The array to query.
+     * @param {number} n The index of the element to return.
+     * @returns {*} Returns the nth element of `array`.
      */
-    function setCacheAdd(value) {
-      this.__data__.set(value, HASH_UNDEFINED);
-      return this;
+    function baseNth(array, n) {
+      var length = array.length;
+      if (!length) {
+        return;
+      }
+      n += n < 0 ? length : 0;
+      return isIndex(n, length) ? array[n] : undefined$1;
     }
 
     /**
-     * Checks if `value` is in the array cache.
+     * The base implementation of `_.orderBy` without param guards.
      *
      * @private
-     * @name has
-     * @memberOf SetCache
-     * @param {*} value The value to search for.
-     * @returns {number} Returns `true` if `value` is found, else `false`.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
+     * @param {string[]} orders The sort orders of `iteratees`.
+     * @returns {Array} Returns the new sorted array.
      */
-    function setCacheHas(value) {
-      return this.__data__.has(value);
-    }
+    function baseOrderBy(collection, iteratees, orders) {
+      if (iteratees.length) {
+        iteratees = arrayMap(iteratees, function(iteratee) {
+          if (isArray(iteratee)) {
+            return function(value) {
+              return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);
+            }
+          }
+          return iteratee;
+        });
+      } else {
+        iteratees = [identity];
+      }
 
-    // Add methods to `SetCache`.
-    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;
-    SetCache.prototype.has = setCacheHas;
+      var index = -1;
+      iteratees = arrayMap(iteratees, baseUnary(getIteratee()));
 
-    /*------------------------------------------------------------------------*/
+      var result = baseMap(collection, function(value, key, collection) {
+        var criteria = arrayMap(iteratees, function(iteratee) {
+          return iteratee(value);
+        });
+        return { 'criteria': criteria, 'index': ++index, 'value': value };
+      });
+
+      return baseSortBy(result, function(object, other) {
+        return compareMultiple(object, other, orders);
+      });
+    }
 
     /**
-     * Creates a stack cache object to store key-value pairs.
+     * The base implementation of `_.pick` without support for individual
+     * property identifiers.
      *
      * @private
-     * @constructor
-     * @param {Array} [entries] The key-value pairs to cache.
+     * @param {Object} object The source object.
+     * @param {string[]} paths The property paths to pick.
+     * @returns {Object} Returns the new object.
      */
-    function Stack(entries) {
-      var data = this.__data__ = new ListCache(entries);
-      this.size = data.size;
+    function basePick(object, paths) {
+      return basePickBy(object, paths, function(value, path) {
+        return hasIn(object, path);
+      });
     }
 
     /**
-     * Removes all key-value entries from the stack.
+     * The base implementation of  `_.pickBy` without support for iteratee shorthands.
      *
      * @private
-     * @name clear
-     * @memberOf Stack
+     * @param {Object} object The source object.
+     * @param {string[]} paths The property paths to pick.
+     * @param {Function} predicate The function invoked per property.
+     * @returns {Object} Returns the new object.
      */
-    function stackClear() {
-      this.__data__ = new ListCache;
-      this.size = 0;
+    function basePickBy(object, paths, predicate) {
+      var index = -1,
+          length = paths.length,
+          result = {};
+
+      while (++index < length) {
+        var path = paths[index],
+            value = baseGet(object, path);
+
+        if (predicate(value, path)) {
+          baseSet(result, castPath(path, object), value);
+        }
+      }
+      return result;
     }
 
     /**
-     * Removes `key` and its value from the stack.
+     * A specialized version of `baseProperty` which supports deep paths.
      *
      * @private
-     * @name delete
-     * @memberOf Stack
-     * @param {string} key The key of the value to remove.
-     * @returns {boolean} Returns `true` if the entry was removed, else `false`.
+     * @param {Array|string} path The path of the property to get.
+     * @returns {Function} Returns the new accessor function.
      */
-    function stackDelete(key) {
-      var data = this.__data__,
-          result = data['delete'](key);
-
-      this.size = data.size;
-      return result;
+    function basePropertyDeep(path) {
+      return function(object) {
+        return baseGet(object, path);
+      };
     }
 
     /**
-     * Gets the stack value for `key`.
+     * The base implementation of `_.pullAllBy` without support for iteratee
+     * shorthands.
      *
      * @private
-     * @name get
-     * @memberOf Stack
-     * @param {string} key The key of the value to get.
-     * @returns {*} Returns the entry value.
+     * @param {Array} array The array to modify.
+     * @param {Array} values The values to remove.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns `array`.
      */
-    function stackGet(key) {
-      return this.__data__.get(key);
+    function basePullAll(array, values, iteratee, comparator) {
+      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,
+          index = -1,
+          length = values.length,
+          seen = array;
+
+      if (array === values) {
+        values = copyArray(values);
+      }
+      if (iteratee) {
+        seen = arrayMap(array, baseUnary(iteratee));
+      }
+      while (++index < length) {
+        var fromIndex = 0,
+            value = values[index],
+            computed = iteratee ? iteratee(value) : value;
+
+        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {
+          if (seen !== array) {
+            splice.call(seen, fromIndex, 1);
+          }
+          splice.call(array, fromIndex, 1);
+        }
+      }
+      return array;
     }
 
     /**
-     * Checks if a stack value for `key` exists.
+     * The base implementation of `_.pullAt` without support for individual
+     * indexes or capturing the removed elements.
      *
      * @private
-     * @name has
-     * @memberOf Stack
-     * @param {string} key The key of the entry to check.
-     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.
+     * @param {Array} array The array to modify.
+     * @param {number[]} indexes The indexes of elements to remove.
+     * @returns {Array} Returns `array`.
      */
-    function stackHas(key) {
-      return this.__data__.has(key);
+    function basePullAt(array, indexes) {
+      var length = array ? indexes.length : 0,
+          lastIndex = length - 1;
+
+      while (length--) {
+        var index = indexes[length];
+        if (length == lastIndex || index !== previous) {
+          var previous = index;
+          if (isIndex(index)) {
+            splice.call(array, index, 1);
+          } else {
+            baseUnset(array, index);
+          }
+        }
+      }
+      return array;
     }
 
     /**
-     * Sets the stack `key` to `value`.
+     * The base implementation of `_.random` without support for returning
+     * floating-point numbers.
      *
      * @private
-     * @name set
-     * @memberOf Stack
-     * @param {string} key The key of the value to set.
-     * @param {*} value The value to set.
-     * @returns {Object} Returns the stack cache instance.
+     * @param {number} lower The lower bound.
+     * @param {number} upper The upper bound.
+     * @returns {number} Returns the random number.
      */
-    function stackSet(key, value) {
-      var data = this.__data__;
-      if (data instanceof ListCache) {
-        var pairs = data.__data__;
-        if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {
-          pairs.push([key, value]);
-          this.size = ++data.size;
-          return this;
-        }
-        data = this.__data__ = new MapCache(pairs);
-      }
-      data.set(key, value);
-      this.size = data.size;
-      return this;
+    function baseRandom(lower, upper) {
+      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));
     }
 
-    // Add methods to `Stack`.
-    Stack.prototype.clear = stackClear;
-    Stack.prototype['delete'] = stackDelete;
-    Stack.prototype.get = stackGet;
-    Stack.prototype.has = stackHas;
-    Stack.prototype.set = stackSet;
-
-    /*------------------------------------------------------------------------*/
-
     /**
-     * Creates an array of the enumerable property names of the array-like `value`.
+     * The base implementation of `_.range` and `_.rangeRight` which doesn't
+     * coerce arguments.
      *
      * @private
-     * @param {*} value The value to query.
-     * @param {boolean} inherited Specify returning inherited property names.
-     * @returns {Array} Returns the array of property names.
+     * @param {number} start The start of the range.
+     * @param {number} end The end of the range.
+     * @param {number} step The value to increment or decrement by.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Array} Returns the range of numbers.
      */
-    function arrayLikeKeys(value, inherited) {
-      var isArr = isArray(value),
-          isArg = !isArr && isArguments(value),
-          isBuff = !isArr && !isArg && isBuffer(value),
-          isType = !isArr && !isArg && !isBuff && isTypedArray(value),
-          skipIndexes = isArr || isArg || isBuff || isType,
-          result = skipIndexes ? baseTimes(value.length, String) : [],
-          length = result.length;
+    function baseRange(start, end, step, fromRight) {
+      var index = -1,
+          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),
+          result = Array(length);
 
-      for (var key in value) {
-        if ((inherited || hasOwnProperty.call(value, key)) &&
-            !(skipIndexes && (
-               // Safari 9 has enumerable `arguments.length` in strict mode.
-               key == 'length' ||
-               // Node.js 0.10 has enumerable non-index properties on buffers.
-               (isBuff && (key == 'offset' || key == 'parent')) ||
-               // PhantomJS 2 has enumerable non-index properties on typed arrays.
-               (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||
-               // Skip index properties.
-               isIndex(key, length)
-            ))) {
-          result.push(key);
-        }
+      while (length--) {
+        result[fromRight ? length : ++index] = start;
+        start += step;
       }
       return result;
     }
 
     /**
-     * A specialized version of `_.sample` for arrays.
+     * The base implementation of `_.repeat` which doesn't coerce arguments.
      *
      * @private
-     * @param {Array} array The array to sample.
-     * @returns {*} Returns the random element.
+     * @param {string} string The string to repeat.
+     * @param {number} n The number of times to repeat the string.
+     * @returns {string} Returns the repeated string.
      */
-    function arraySample(array) {
-      var length = array.length;
-      return length ? array[baseRandom(0, length - 1)] : undefined$1;
+    function baseRepeat(string, n) {
+      var result = '';
+      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {
+        return result;
+      }
+      // Leverage the exponentiation by squaring algorithm for a faster repeat.
+      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.
+      do {
+        if (n % 2) {
+          result += string;
+        }
+        n = nativeFloor(n / 2);
+        if (n) {
+          string += string;
+        }
+      } while (n);
+
+      return result;
     }
 
     /**
-     * A specialized version of `_.sampleSize` for arrays.
+     * The base implementation of `_.rest` which doesn't validate or coerce arguments.
      *
      * @private
-     * @param {Array} array The array to sample.
-     * @param {number} n The number of elements to sample.
-     * @returns {Array} Returns the random elements.
+     * @param {Function} func The function to apply a rest parameter to.
+     * @param {number} [start=func.length-1] The start position of the rest parameter.
+     * @returns {Function} Returns the new function.
      */
-    function arraySampleSize(array, n) {
-      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));
+    function baseRest(func, start) {
+      return setToString(overRest(func, start, identity), func + '');
     }
 
     /**
-     * A specialized version of `_.shuffle` for arrays.
+     * The base implementation of `_.sample`.
      *
      * @private
-     * @param {Array} array The array to shuffle.
-     * @returns {Array} Returns the new shuffled array.
+     * @param {Array|Object} collection The collection to sample.
+     * @returns {*} Returns the random element.
      */
-    function arrayShuffle(array) {
-      return shuffleSelf(copyArray(array));
+    function baseSample(collection) {
+      return arraySample(values(collection));
     }
 
     /**
-     * This function is like `assignValue` except that it doesn't assign
-     * `undefined` values.
+     * The base implementation of `_.sampleSize` without param guards.
      *
      * @private
-     * @param {Object} object The object to modify.
-     * @param {string} key The key of the property to assign.
-     * @param {*} value The value to assign.
+     * @param {Array|Object} collection The collection to sample.
+     * @param {number} n The number of elements to sample.
+     * @returns {Array} Returns the random elements.
      */
-    function assignMergeValue(object, key, value) {
-      if ((value !== undefined$1 && !eq(object[key], value)) ||
-          (value === undefined$1 && !(key in object))) {
-        baseAssignValue(object, key, value);
-      }
+    function baseSampleSize(collection, n) {
+      var array = values(collection);
+      return shuffleSelf(array, baseClamp(n, 0, array.length));
     }
 
     /**
-     * Assigns `value` to `key` of `object` if the existing value is not equivalent
-     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * for equality comparisons.
+     * The base implementation of `_.set`.
      *
      * @private
      * @param {Object} object The object to modify.
-     * @param {string} key The key of the property to assign.
-     * @param {*} value The value to assign.
+     * @param {Array|string} path The path of the property to set.
+     * @param {*} value The value to set.
+     * @param {Function} [customizer] The function to customize path creation.
+     * @returns {Object} Returns `object`.
      */
-    function assignValue(object, key, value) {
-      var objValue = object[key];
-      if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||
-          (value === undefined$1 && !(key in object))) {
-        baseAssignValue(object, key, value);
+    function baseSet(object, path, value, customizer) {
+      if (!isObject(object)) {
+        return object;
       }
-    }
+      path = castPath(path, object);
 
-    /**
-     * Gets the index at which the `key` is found in `array` of key-value pairs.
-     *
-     * @private
-     * @param {Array} array The array to inspect.
-     * @param {*} key The key to search for.
-     * @returns {number} Returns the index of the matched value, else `-1`.
-     */
-    function assocIndexOf(array, key) {
-      var length = array.length;
-      while (length--) {
-        if (eq(array[length][0], key)) {
-          return length;
+      var index = -1,
+          length = path.length,
+          lastIndex = length - 1,
+          nested = object;
+
+      while (nested != null && ++index < length) {
+        var key = toKey(path[index]),
+            newValue = value;
+
+        if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
+          return object;
         }
-      }
-      return -1;
-    }
 
-    /**
-     * Aggregates elements of `collection` on `accumulator` with keys transformed
-     * by `iteratee` and values set by `setter`.
-     *
-     * @private
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} setter The function to set `accumulator` values.
-     * @param {Function} iteratee The iteratee to transform keys.
-     * @param {Object} accumulator The initial aggregated object.
-     * @returns {Function} Returns `accumulator`.
-     */
-    function baseAggregator(collection, setter, iteratee, accumulator) {
-      baseEach(collection, function(value, key, collection) {
-        setter(accumulator, value, iteratee(value), collection);
-      });
-      return accumulator;
+        if (index != lastIndex) {
+          var objValue = nested[key];
+          newValue = customizer ? customizer(objValue, key, nested) : undefined$1;
+          if (newValue === undefined$1) {
+            newValue = isObject(objValue)
+              ? objValue
+              : (isIndex(path[index + 1]) ? [] : {});
+          }
+        }
+        assignValue(nested, key, newValue);
+        nested = nested[key];
+      }
+      return object;
     }
 
     /**
-     * The base implementation of `_.assign` without support for multiple sources
-     * or `customizer` functions.
+     * The base implementation of `setData` without support for hot loop shorting.
      *
      * @private
-     * @param {Object} object The destination object.
-     * @param {Object} source The source object.
-     * @returns {Object} Returns `object`.
+     * @param {Function} func The function to associate metadata with.
+     * @param {*} data The metadata.
+     * @returns {Function} Returns `func`.
      */
-    function baseAssign(object, source) {
-      return object && copyObject(source, keys(source), object);
-    }
+    var baseSetData = !metaMap ? identity : function(func, data) {
+      metaMap.set(func, data);
+      return func;
+    };
 
     /**
-     * The base implementation of `_.assignIn` without support for multiple sources
-     * or `customizer` functions.
+     * The base implementation of `setToString` without support for hot loop shorting.
      *
      * @private
-     * @param {Object} object The destination object.
-     * @param {Object} source The source object.
-     * @returns {Object} Returns `object`.
+     * @param {Function} func The function to modify.
+     * @param {Function} string The `toString` result.
+     * @returns {Function} Returns `func`.
      */
-    function baseAssignIn(object, source) {
-      return object && copyObject(source, keysIn(source), object);
-    }
+    var baseSetToString = !defineProperty ? identity : function(func, string) {
+      return defineProperty(func, 'toString', {
+        'configurable': true,
+        'enumerable': false,
+        'value': constant(string),
+        'writable': true
+      });
+    };
 
     /**
-     * The base implementation of `assignValue` and `assignMergeValue` without
-     * value checks.
+     * The base implementation of `_.shuffle`.
      *
      * @private
-     * @param {Object} object The object to modify.
-     * @param {string} key The key of the property to assign.
-     * @param {*} value The value to assign.
+     * @param {Array|Object} collection The collection to shuffle.
+     * @returns {Array} Returns the new shuffled array.
      */
-    function baseAssignValue(object, key, value) {
-      if (key == '__proto__' && defineProperty) {
-        defineProperty(object, key, {
-          'configurable': true,
-          'enumerable': true,
-          'value': value,
-          'writable': true
-        });
-      } else {
-        object[key] = value;
-      }
+    function baseShuffle(collection) {
+      return shuffleSelf(values(collection));
     }
 
     /**
-     * The base implementation of `_.at` without support for individual paths.
+     * The base implementation of `_.slice` without an iteratee call guard.
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {string[]} paths The property paths to pick.
-     * @returns {Array} Returns the picked elements.
+     * @param {Array} array The array to slice.
+     * @param {number} [start=0] The start position.
+     * @param {number} [end=array.length] The end position.
+     * @returns {Array} Returns the slice of `array`.
      */
-    function baseAt(object, paths) {
+    function baseSlice(array, start, end) {
       var index = -1,
-          length = paths.length,
-          result = Array(length),
-          skip = object == null;
+          length = array.length;
+
+      if (start < 0) {
+        start = -start > length ? 0 : (length + start);
+      }
+      end = end > length ? length : end;
+      if (end < 0) {
+        end += length;
+      }
+      length = start > end ? 0 : ((end - start) >>> 0);
+      start >>>= 0;
 
+      var result = Array(length);
       while (++index < length) {
-        result[index] = skip ? undefined$1 : get(object, paths[index]);
+        result[index] = array[index + start];
       }
       return result;
     }
 
     /**
-     * The base implementation of `_.clamp` which doesn't coerce arguments.
+     * The base implementation of `_.some` without support for iteratee shorthands.
      *
      * @private
-     * @param {number} number The number to clamp.
-     * @param {number} [lower] The lower bound.
-     * @param {number} upper The upper bound.
-     * @returns {number} Returns the clamped number.
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} predicate The function invoked per iteration.
+     * @returns {boolean} Returns `true` if any element passes the predicate check,
+     *  else `false`.
      */
-    function baseClamp(number, lower, upper) {
-      if (number === number) {
-        if (upper !== undefined$1) {
-          number = number <= upper ? number : upper;
-        }
-        if (lower !== undefined$1) {
-          number = number >= lower ? number : lower;
-        }
-      }
-      return number;
+    function baseSome(collection, predicate) {
+      var result;
+
+      baseEach(collection, function(value, index, collection) {
+        result = predicate(value, index, collection);
+        return !result;
+      });
+      return !!result;
     }
 
     /**
-     * The base implementation of `_.clone` and `_.cloneDeep` which tracks
-     * traversed objects.
+     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which
+     * performs a binary search of `array` to determine the index at which `value`
+     * should be inserted into `array` in order to maintain its sort order.
      *
      * @private
-     * @param {*} value The value to clone.
-     * @param {boolean} bitmask The bitmask flags.
-     *  1 - Deep clone
-     *  2 - Flatten inherited properties
-     *  4 - Clone symbols
-     * @param {Function} [customizer] The function to customize cloning.
-     * @param {string} [key] The key of `value`.
-     * @param {Object} [object] The parent object of `value`.
-     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.
-     * @returns {*} Returns the cloned value.
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @param {boolean} [retHighest] Specify returning the highest qualified index.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
      */
-    function baseClone(value, bitmask, customizer, key, object, stack) {
-      var result,
-          isDeep = bitmask & CLONE_DEEP_FLAG,
-          isFlat = bitmask & CLONE_FLAT_FLAG,
-          isFull = bitmask & CLONE_SYMBOLS_FLAG;
+    function baseSortedIndex(array, value, retHighest) {
+      var low = 0,
+          high = array == null ? low : array.length;
 
-      if (customizer) {
-        result = object ? customizer(value, key, object, stack) : customizer(value);
-      }
-      if (result !== undefined$1) {
-        return result;
-      }
-      if (!isObject(value)) {
-        return value;
-      }
-      var isArr = isArray(value);
-      if (isArr) {
-        result = initCloneArray(value);
-        if (!isDeep) {
-          return copyArray(value, result);
-        }
-      } else {
-        var tag = getTag(value),
-            isFunc = tag == funcTag || tag == genTag;
+      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
+        while (low < high) {
+          var mid = (low + high) >>> 1,
+              computed = array[mid];
 
-        if (isBuffer(value)) {
-          return cloneBuffer(value, isDeep);
-        }
-        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {
-          result = (isFlat || isFunc) ? {} : initCloneObject(value);
-          if (!isDeep) {
-            return isFlat
-              ? copySymbolsIn(value, baseAssignIn(result, value))
-              : copySymbols(value, baseAssign(result, value));
-          }
-        } else {
-          if (!cloneableTags[tag]) {
-            return object ? value : {};
+          if (computed !== null && !isSymbol(computed) &&
+              (retHighest ? (computed <= value) : (computed < value))) {
+            low = mid + 1;
+          } else {
+            high = mid;
           }
-          result = initCloneByTag(value, tag, isDeep);
         }
+        return high;
       }
-      // Check for circular references and return its corresponding clone.
-      stack || (stack = new Stack);
-      var stacked = stack.get(value);
-      if (stacked) {
-        return stacked;
-      }
-      stack.set(value, result);
+      return baseSortedIndexBy(array, value, identity, retHighest);
+    }
 
-      if (isSet(value)) {
-        value.forEach(function(subValue) {
-          result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));
-        });
-      } else if (isMap(value)) {
-        value.forEach(function(subValue, key) {
-          result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));
-        });
+    /**
+     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`
+     * which invokes `iteratee` for `value` and each element of `array` to compute
+     * their sort ranking. The iteratee is invoked with one argument; (value).
+     *
+     * @private
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @param {Function} iteratee The iteratee invoked per element.
+     * @param {boolean} [retHighest] Specify returning the highest qualified index.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
+     */
+    function baseSortedIndexBy(array, value, iteratee, retHighest) {
+      var low = 0,
+          high = array == null ? 0 : array.length;
+      if (high === 0) {
+        return 0;
       }
 
-      var keysFunc = isFull
-        ? (isFlat ? getAllKeysIn : getAllKeys)
-        : (isFlat ? keysIn : keys);
+      value = iteratee(value);
+      var valIsNaN = value !== value,
+          valIsNull = value === null,
+          valIsSymbol = isSymbol(value),
+          valIsUndefined = value === undefined$1;
 
-      var props = isArr ? undefined$1 : keysFunc(value);
-      arrayEach(props || value, function(subValue, key) {
-        if (props) {
-          key = subValue;
-          subValue = value[key];
+      while (low < high) {
+        var mid = nativeFloor((low + high) / 2),
+            computed = iteratee(array[mid]),
+            othIsDefined = computed !== undefined$1,
+            othIsNull = computed === null,
+            othIsReflexive = computed === computed,
+            othIsSymbol = isSymbol(computed);
+
+        if (valIsNaN) {
+          var setLow = retHighest || othIsReflexive;
+        } else if (valIsUndefined) {
+          setLow = othIsReflexive && (retHighest || othIsDefined);
+        } else if (valIsNull) {
+          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);
+        } else if (valIsSymbol) {
+          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);
+        } else if (othIsNull || othIsSymbol) {
+          setLow = false;
+        } else {
+          setLow = retHighest ? (computed <= value) : (computed < value);
         }
-        // Recursively populate clone (susceptible to call stack limits).
-        assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));
-      });
-      return result;
+        if (setLow) {
+          low = mid + 1;
+        } else {
+          high = mid;
+        }
+      }
+      return nativeMin(high, MAX_ARRAY_INDEX);
     }
 
     /**
-     * The base implementation of `_.conforms` which doesn't clone `source`.
+     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without
+     * support for iteratee shorthands.
      *
      * @private
-     * @param {Object} source The object of property predicates to conform to.
-     * @returns {Function} Returns the new spec function.
+     * @param {Array} array The array to inspect.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @returns {Array} Returns the new duplicate free array.
      */
-    function baseConforms(source) {
-      var props = keys(source);
-      return function(object) {
-        return baseConformsTo(object, source, props);
-      };
+    function baseSortedUniq(array, iteratee) {
+      var index = -1,
+          length = array.length,
+          resIndex = 0,
+          result = [];
+
+      while (++index < length) {
+        var value = array[index],
+            computed = iteratee ? iteratee(value) : value;
+
+        if (!index || !eq(computed, seen)) {
+          var seen = computed;
+          result[resIndex++] = value === 0 ? 0 : value;
+        }
+      }
+      return result;
     }
 
     /**
-     * The base implementation of `_.conformsTo` which accepts `props` to check.
+     * The base implementation of `_.toNumber` which doesn't ensure correct
+     * conversions of binary, hexadecimal, or octal string values.
      *
      * @private
-     * @param {Object} object The object to inspect.
-     * @param {Object} source The object of property predicates to conform to.
-     * @returns {boolean} Returns `true` if `object` conforms, else `false`.
+     * @param {*} value The value to process.
+     * @returns {number} Returns the number.
      */
-    function baseConformsTo(object, source, props) {
-      var length = props.length;
-      if (object == null) {
-        return !length;
+    function baseToNumber(value) {
+      if (typeof value == 'number') {
+        return value;
       }
-      object = Object(object);
-      while (length--) {
-        var key = props[length],
-            predicate = source[key],
-            value = object[key];
-
-        if ((value === undefined$1 && !(key in object)) || !predicate(value)) {
-          return false;
-        }
+      if (isSymbol(value)) {
+        return NAN;
       }
-      return true;
+      return +value;
     }
 
     /**
-     * The base implementation of `_.delay` and `_.defer` which accepts `args`
-     * to provide to `func`.
+     * The base implementation of `_.toString` which doesn't convert nullish
+     * values to empty strings.
      *
      * @private
-     * @param {Function} func The function to delay.
-     * @param {number} wait The number of milliseconds to delay invocation.
-     * @param {Array} args The arguments to provide to `func`.
-     * @returns {number|Object} Returns the timer id or timeout object.
+     * @param {*} value The value to process.
+     * @returns {string} Returns the string.
      */
-    function baseDelay(func, wait, args) {
-      if (typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
+    function baseToString(value) {
+      // Exit early for strings to avoid a performance hit in some environments.
+      if (typeof value == 'string') {
+        return value;
       }
-      return setTimeout(function() { func.apply(undefined$1, args); }, wait);
+      if (isArray(value)) {
+        // Recursively convert values (susceptible to call stack limits).
+        return arrayMap(value, baseToString) + '';
+      }
+      if (isSymbol(value)) {
+        return symbolToString ? symbolToString.call(value) : '';
+      }
+      var result = (value + '');
+      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
     }
 
     /**
-     * The base implementation of methods like `_.difference` without support
-     * for excluding multiple arrays or iteratee shorthands.
+     * The base implementation of `_.uniqBy` without support for iteratee shorthands.
      *
      * @private
      * @param {Array} array The array to inspect.
-     * @param {Array} values The values to exclude.
      * @param {Function} [iteratee] The iteratee invoked per element.
      * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns the new array of filtered values.
+     * @returns {Array} Returns the new duplicate free array.
      */
-    function baseDifference(array, values, iteratee, comparator) {
+    function baseUniq(array, iteratee, comparator) {
       var index = -1,
           includes = arrayIncludes,
-          isCommon = true,
           length = array.length,
+          isCommon = true,
           result = [],
-          valuesLength = values.length;
+          seen = result;
 
-      if (!length) {
-        return result;
-      }
-      if (iteratee) {
-        values = arrayMap(values, baseUnary(iteratee));
-      }
       if (comparator) {
-        includes = arrayIncludesWith;
         isCommon = false;
+        includes = arrayIncludesWith;
       }
-      else if (values.length >= LARGE_ARRAY_SIZE) {
-        includes = cacheHas;
+      else if (length >= LARGE_ARRAY_SIZE) {
+        var set = iteratee ? null : createSet(array);
+        if (set) {
+          return setToArray(set);
+        }
         isCommon = false;
-        values = new SetCache(values);
+        includes = cacheHas;
+        seen = new SetCache;
+      }
+      else {
+        seen = iteratee ? [] : result;
       }
       outer:
       while (++index < length) {
         var value = array[index],
-            computed = iteratee == null ? value : iteratee(value);
+            computed = iteratee ? iteratee(value) : value;
 
         value = (comparator || value !== 0) ? value : 0;
         if (isCommon && computed === computed) {
-          var valuesIndex = valuesLength;
-          while (valuesIndex--) {
-            if (values[valuesIndex] === computed) {
+          var seenIndex = seen.length;
+          while (seenIndex--) {
+            if (seen[seenIndex] === computed) {
               continue outer;
             }
           }
+          if (iteratee) {
+            seen.push(computed);
+          }
           result.push(value);
         }
-        else if (!includes(values, computed, comparator)) {
+        else if (!includes(seen, computed, comparator)) {
+          if (seen !== result) {
+            seen.push(computed);
+          }
           result.push(value);
         }
       }
@@ -9740,14912 +8773,14624 @@ var lodash = createCommonjsModule(function (module, exports) {
     }
 
     /**
-     * The base implementation of `_.forEach` without support for iteratee shorthands.
+     * The base implementation of `_.unset`.
      *
      * @private
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Array|Object} Returns `collection`.
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The property path to unset.
+     * @returns {boolean} Returns `true` if the property is deleted, else `false`.
      */
-    var baseEach = createBaseEach(baseForOwn);
+    function baseUnset(object, path) {
+      path = castPath(path, object);
+      object = parent(object, path);
+      return object == null || delete object[toKey(last(path))];
+    }
 
     /**
-     * The base implementation of `_.forEachRight` without support for iteratee shorthands.
+     * The base implementation of `_.update`.
      *
      * @private
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Array|Object} Returns `collection`.
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to update.
+     * @param {Function} updater The function to produce the updated value.
+     * @param {Function} [customizer] The function to customize path creation.
+     * @returns {Object} Returns `object`.
      */
-    var baseEachRight = createBaseEach(baseForOwnRight, true);
+    function baseUpdate(object, path, updater, customizer) {
+      return baseSet(object, path, updater(baseGet(object, path)), customizer);
+    }
 
     /**
-     * The base implementation of `_.every` without support for iteratee shorthands.
+     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`
+     * without support for iteratee shorthands.
      *
      * @private
-     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Array} array The array to query.
      * @param {Function} predicate The function invoked per iteration.
-     * @returns {boolean} Returns `true` if all elements pass the predicate check,
-     *  else `false`
+     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Array} Returns the slice of `array`.
      */
-    function baseEvery(collection, predicate) {
-      var result = true;
-      baseEach(collection, function(value, index, collection) {
-        result = !!predicate(value, index, collection);
-        return result;
-      });
-      return result;
+    function baseWhile(array, predicate, isDrop, fromRight) {
+      var length = array.length,
+          index = fromRight ? length : -1;
+
+      while ((fromRight ? index-- : ++index < length) &&
+        predicate(array[index], index, array)) {}
+
+      return isDrop
+        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))
+        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));
     }
 
     /**
-     * The base implementation of methods like `_.max` and `_.min` which accepts a
-     * `comparator` to determine the extremum value.
+     * The base implementation of `wrapperValue` which returns the result of
+     * performing a sequence of actions on the unwrapped `value`, where each
+     * successive action is supplied the return value of the previous.
      *
      * @private
-     * @param {Array} array The array to iterate over.
-     * @param {Function} iteratee The iteratee invoked per iteration.
-     * @param {Function} comparator The comparator used to compare values.
-     * @returns {*} Returns the extremum value.
+     * @param {*} value The unwrapped value.
+     * @param {Array} actions Actions to perform to resolve the unwrapped value.
+     * @returns {*} Returns the resolved value.
      */
-    function baseExtremum(array, iteratee, comparator) {
+    function baseWrapperValue(value, actions) {
+      var result = value;
+      if (result instanceof LazyWrapper) {
+        result = result.value();
+      }
+      return arrayReduce(actions, function(result, action) {
+        return action.func.apply(action.thisArg, arrayPush([result], action.args));
+      }, result);
+    }
+
+    /**
+     * The base implementation of methods like `_.xor`, without support for
+     * iteratee shorthands, that accepts an array of arrays to inspect.
+     *
+     * @private
+     * @param {Array} arrays The arrays to inspect.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of values.
+     */
+    function baseXor(arrays, iteratee, comparator) {
+      var length = arrays.length;
+      if (length < 2) {
+        return length ? baseUniq(arrays[0]) : [];
+      }
       var index = -1,
-          length = array.length;
+          result = Array(length);
 
       while (++index < length) {
-        var value = array[index],
-            current = iteratee(value);
+        var array = arrays[index],
+            othIndex = -1;
+
+        while (++othIndex < length) {
+          if (othIndex != index) {
+            result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);
+          }
+        }
+      }
+      return baseUniq(baseFlatten(result, 1), iteratee, comparator);
+    }
+
+    /**
+     * This base implementation of `_.zipObject` which assigns values using `assignFunc`.
+     *
+     * @private
+     * @param {Array} props The property identifiers.
+     * @param {Array} values The property values.
+     * @param {Function} assignFunc The function to assign values.
+     * @returns {Object} Returns the new object.
+     */
+    function baseZipObject(props, values, assignFunc) {
+      var index = -1,
+          length = props.length,
+          valsLength = values.length,
+          result = {};
 
-        if (current != null && (computed === undefined$1
-              ? (current === current && !isSymbol(current))
-              : comparator(current, computed)
-            )) {
-          var computed = current,
-              result = value;
-        }
+      while (++index < length) {
+        var value = index < valsLength ? values[index] : undefined$1;
+        assignFunc(result, props[index], value);
       }
       return result;
     }
 
     /**
-     * The base implementation of `_.fill` without an iteratee call guard.
+     * Casts `value` to an empty array if it's not an array like object.
      *
      * @private
-     * @param {Array} array The array to fill.
-     * @param {*} value The value to fill `array` with.
-     * @param {number} [start=0] The start position.
-     * @param {number} [end=array.length] The end position.
-     * @returns {Array} Returns `array`.
+     * @param {*} value The value to inspect.
+     * @returns {Array|Object} Returns the cast array-like object.
      */
-    function baseFill(array, value, start, end) {
-      var length = array.length;
-
-      start = toInteger(start);
-      if (start < 0) {
-        start = -start > length ? 0 : (length + start);
-      }
-      end = (end === undefined$1 || end > length) ? length : toInteger(end);
-      if (end < 0) {
-        end += length;
-      }
-      end = start > end ? 0 : toLength(end);
-      while (start < end) {
-        array[start++] = value;
-      }
-      return array;
+    function castArrayLikeObject(value) {
+      return isArrayLikeObject(value) ? value : [];
     }
 
     /**
-     * The base implementation of `_.filter` without support for iteratee shorthands.
+     * Casts `value` to `identity` if it's not a function.
      *
      * @private
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} predicate The function invoked per iteration.
-     * @returns {Array} Returns the new filtered array.
+     * @param {*} value The value to inspect.
+     * @returns {Function} Returns cast function.
      */
-    function baseFilter(collection, predicate) {
-      var result = [];
-      baseEach(collection, function(value, index, collection) {
-        if (predicate(value, index, collection)) {
-          result.push(value);
-        }
-      });
-      return result;
+    function castFunction(value) {
+      return typeof value == 'function' ? value : identity;
     }
 
     /**
-     * The base implementation of `_.flatten` with support for restricting flattening.
+     * Casts `value` to a path array if it's not one.
      *
      * @private
-     * @param {Array} array The array to flatten.
-     * @param {number} depth The maximum recursion depth.
-     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.
-     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.
-     * @param {Array} [result=[]] The initial result value.
-     * @returns {Array} Returns the new flattened array.
+     * @param {*} value The value to inspect.
+     * @param {Object} [object] The object to query keys on.
+     * @returns {Array} Returns the cast property path array.
      */
-    function baseFlatten(array, depth, predicate, isStrict, result) {
-      var index = -1,
-          length = array.length;
-
-      predicate || (predicate = isFlattenable);
-      result || (result = []);
-
-      while (++index < length) {
-        var value = array[index];
-        if (depth > 0 && predicate(value)) {
-          if (depth > 1) {
-            // Recursively flatten arrays (susceptible to call stack limits).
-            baseFlatten(value, depth - 1, predicate, isStrict, result);
-          } else {
-            arrayPush(result, value);
-          }
-        } else if (!isStrict) {
-          result[result.length] = value;
-        }
+    function castPath(value, object) {
+      if (isArray(value)) {
+        return value;
       }
-      return result;
+      return isKey(value, object) ? [value] : stringToPath(toString(value));
     }
 
     /**
-     * The base implementation of `baseForOwn` which iterates over `object`
-     * properties returned by `keysFunc` and invokes `iteratee` for each property.
-     * Iteratee functions may exit iteration early by explicitly returning `false`.
+     * A `baseRest` alias which can be replaced with `identity` by module
+     * replacement plugins.
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {Function} keysFunc The function to get the keys of `object`.
-     * @returns {Object} Returns `object`.
+     * @type {Function}
+     * @param {Function} func The function to apply a rest parameter to.
+     * @returns {Function} Returns the new function.
      */
-    var baseFor = createBaseFor();
+    var castRest = baseRest;
 
     /**
-     * This function is like `baseFor` except that it iterates over properties
-     * in the opposite order.
+     * Casts `array` to a slice if it's needed.
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @param {Function} keysFunc The function to get the keys of `object`.
-     * @returns {Object} Returns `object`.
+     * @param {Array} array The array to inspect.
+     * @param {number} start The start position.
+     * @param {number} [end=array.length] The end position.
+     * @returns {Array} Returns the cast slice.
      */
-    var baseForRight = createBaseFor(true);
+    function castSlice(array, start, end) {
+      var length = array.length;
+      end = end === undefined$1 ? length : end;
+      return (!start && end >= length) ? array : baseSlice(array, start, end);
+    }
 
     /**
-     * The base implementation of `_.forOwn` without support for iteratee shorthands.
+     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Object} Returns `object`.
+     * @param {number|Object} id The timer id or timeout object of the timer to clear.
      */
-    function baseForOwn(object, iteratee) {
-      return object && baseFor(object, iteratee, keys);
-    }
+    var clearTimeout = ctxClearTimeout || function(id) {
+      return root.clearTimeout(id);
+    };
 
     /**
-     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.
+     * Creates a clone of  `buffer`.
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Object} Returns `object`.
+     * @param {Buffer} buffer The buffer to clone.
+     * @param {boolean} [isDeep] Specify a deep clone.
+     * @returns {Buffer} Returns the cloned buffer.
      */
-    function baseForOwnRight(object, iteratee) {
-      return object && baseForRight(object, iteratee, keys);
+    function cloneBuffer(buffer, isDeep) {
+      if (isDeep) {
+        return buffer.slice();
+      }
+      var length = buffer.length,
+          result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);
+
+      buffer.copy(result);
+      return result;
     }
 
     /**
-     * The base implementation of `_.functions` which creates an array of
-     * `object` function property names filtered from `props`.
+     * Creates a clone of `arrayBuffer`.
      *
      * @private
-     * @param {Object} object The object to inspect.
-     * @param {Array} props The property names to filter.
-     * @returns {Array} Returns the function names.
+     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.
+     * @returns {ArrayBuffer} Returns the cloned array buffer.
      */
-    function baseFunctions(object, props) {
-      return arrayFilter(props, function(key) {
-        return isFunction(object[key]);
-      });
+    function cloneArrayBuffer(arrayBuffer) {
+      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);
+      new Uint8Array(result).set(new Uint8Array(arrayBuffer));
+      return result;
     }
 
     /**
-     * The base implementation of `_.get` without support for default values.
+     * Creates a clone of `dataView`.
      *
      * @private
-     * @param {Object} object The object to query.
-     * @param {Array|string} path The path of the property to get.
-     * @returns {*} Returns the resolved value.
+     * @param {Object} dataView The data view to clone.
+     * @param {boolean} [isDeep] Specify a deep clone.
+     * @returns {Object} Returns the cloned data view.
      */
-    function baseGet(object, path) {
-      path = castPath(path, object);
-
-      var index = 0,
-          length = path.length;
+    function cloneDataView(dataView, isDeep) {
+      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;
+      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);
+    }
 
-      while (object != null && index < length) {
-        object = object[toKey(path[index++])];
-      }
-      return (index && index == length) ? object : undefined$1;
+    /**
+     * Creates a clone of `regexp`.
+     *
+     * @private
+     * @param {Object} regexp The regexp to clone.
+     * @returns {Object} Returns the cloned regexp.
+     */
+    function cloneRegExp(regexp) {
+      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));
+      result.lastIndex = regexp.lastIndex;
+      return result;
     }
 
     /**
-     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses
-     * `keysFunc` and `symbolsFunc` to get the enumerable property names and
-     * symbols of `object`.
+     * Creates a clone of the `symbol` object.
      *
      * @private
-     * @param {Object} object The object to query.
-     * @param {Function} keysFunc The function to get the keys of `object`.
-     * @param {Function} symbolsFunc The function to get the symbols of `object`.
-     * @returns {Array} Returns the array of property names and symbols.
+     * @param {Object} symbol The symbol object to clone.
+     * @returns {Object} Returns the cloned symbol object.
      */
-    function baseGetAllKeys(object, keysFunc, symbolsFunc) {
-      var result = keysFunc(object);
-      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));
+    function cloneSymbol(symbol) {
+      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};
     }
 
     /**
-     * The base implementation of `getTag` without fallbacks for buggy environments.
+     * Creates a clone of `typedArray`.
      *
      * @private
-     * @param {*} value The value to query.
-     * @returns {string} Returns the `toStringTag`.
+     * @param {Object} typedArray The typed array to clone.
+     * @param {boolean} [isDeep] Specify a deep clone.
+     * @returns {Object} Returns the cloned typed array.
      */
-    function baseGetTag(value) {
-      if (value == null) {
-        return value === undefined$1 ? undefinedTag : nullTag;
-      }
-      return (symToStringTag && symToStringTag in Object(value))
-        ? getRawTag(value)
-        : objectToString(value);
+    function cloneTypedArray(typedArray, isDeep) {
+      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;
+      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);
     }
 
     /**
-     * The base implementation of `_.gt` which doesn't coerce arguments.
+     * Compares values to sort them in ascending order.
      *
      * @private
      * @param {*} value The value to compare.
      * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is greater than `other`,
-     *  else `false`.
+     * @returns {number} Returns the sort order indicator for `value`.
      */
-    function baseGt(value, other) {
-      return value > other;
+    function compareAscending(value, other) {
+      if (value !== other) {
+        var valIsDefined = value !== undefined$1,
+            valIsNull = value === null,
+            valIsReflexive = value === value,
+            valIsSymbol = isSymbol(value);
+
+        var othIsDefined = other !== undefined$1,
+            othIsNull = other === null,
+            othIsReflexive = other === other,
+            othIsSymbol = isSymbol(other);
+
+        if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||
+            (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||
+            (valIsNull && othIsDefined && othIsReflexive) ||
+            (!valIsDefined && othIsReflexive) ||
+            !valIsReflexive) {
+          return 1;
+        }
+        if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||
+            (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||
+            (othIsNull && valIsDefined && valIsReflexive) ||
+            (!othIsDefined && valIsReflexive) ||
+            !othIsReflexive) {
+          return -1;
+        }
+      }
+      return 0;
     }
 
     /**
-     * The base implementation of `_.has` without support for deep paths.
+     * Used by `_.orderBy` to compare multiple properties of a value to another
+     * and stable sort them.
      *
-     * @private
-     * @param {Object} [object] The object to query.
-     * @param {Array|string} key The key to check.
-     * @returns {boolean} Returns `true` if `key` exists, else `false`.
-     */
-    function baseHas(object, key) {
-      return object != null && hasOwnProperty.call(object, key);
-    }
-
-    /**
-     * The base implementation of `_.hasIn` without support for deep paths.
+     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,
+     * specify an order of "desc" for descending or "asc" for ascending sort order
+     * of corresponding values.
      *
      * @private
-     * @param {Object} [object] The object to query.
-     * @param {Array|string} key The key to check.
-     * @returns {boolean} Returns `true` if `key` exists, else `false`.
+     * @param {Object} object The object to compare.
+     * @param {Object} other The other object to compare.
+     * @param {boolean[]|string[]} orders The order to sort by for each property.
+     * @returns {number} Returns the sort order indicator for `object`.
      */
-    function baseHasIn(object, key) {
-      return object != null && key in Object(object);
-    }
+    function compareMultiple(object, other, orders) {
+      var index = -1,
+          objCriteria = object.criteria,
+          othCriteria = other.criteria,
+          length = objCriteria.length,
+          ordersLength = orders.length;
 
-    /**
-     * The base implementation of `_.inRange` which doesn't coerce arguments.
-     *
-     * @private
-     * @param {number} number The number to check.
-     * @param {number} start The start of the range.
-     * @param {number} end The end of the range.
-     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.
-     */
-    function baseInRange(number, start, end) {
-      return number >= nativeMin(start, end) && number < nativeMax(start, end);
+      while (++index < length) {
+        var result = compareAscending(objCriteria[index], othCriteria[index]);
+        if (result) {
+          if (index >= ordersLength) {
+            return result;
+          }
+          var order = orders[index];
+          return result * (order == 'desc' ? -1 : 1);
+        }
+      }
+      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
+      // that causes it, under certain circumstances, to provide the same value for
+      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247
+      // for more details.
+      //
+      // This also ensures a stable sort in V8 and other engines.
+      // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.
+      return object.index - other.index;
     }
 
     /**
-     * The base implementation of methods like `_.intersection`, without support
-     * for iteratee shorthands, that accepts an array of arrays to inspect.
+     * Creates an array that is the composition of partially applied arguments,
+     * placeholders, and provided arguments into a single array of arguments.
      *
      * @private
-     * @param {Array} arrays The arrays to inspect.
-     * @param {Function} [iteratee] The iteratee invoked per element.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns the new array of shared values.
+     * @param {Array} args The provided arguments.
+     * @param {Array} partials The arguments to prepend to those provided.
+     * @param {Array} holders The `partials` placeholder indexes.
+     * @params {boolean} [isCurried] Specify composing for a curried function.
+     * @returns {Array} Returns the new array of composed arguments.
      */
-    function baseIntersection(arrays, iteratee, comparator) {
-      var includes = comparator ? arrayIncludesWith : arrayIncludes,
-          length = arrays[0].length,
-          othLength = arrays.length,
-          othIndex = othLength,
-          caches = Array(othLength),
-          maxLength = Infinity,
-          result = [];
+    function composeArgs(args, partials, holders, isCurried) {
+      var argsIndex = -1,
+          argsLength = args.length,
+          holdersLength = holders.length,
+          leftIndex = -1,
+          leftLength = partials.length,
+          rangeLength = nativeMax(argsLength - holdersLength, 0),
+          result = Array(leftLength + rangeLength),
+          isUncurried = !isCurried;
 
-      while (othIndex--) {
-        var array = arrays[othIndex];
-        if (othIndex && iteratee) {
-          array = arrayMap(array, baseUnary(iteratee));
-        }
-        maxLength = nativeMin(array.length, maxLength);
-        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))
-          ? new SetCache(othIndex && array)
-          : undefined$1;
+      while (++leftIndex < leftLength) {
+        result[leftIndex] = partials[leftIndex];
       }
-      array = arrays[0];
-
-      var index = -1,
-          seen = caches[0];
-
-      outer:
-      while (++index < length && result.length < maxLength) {
-        var value = array[index],
-            computed = iteratee ? iteratee(value) : value;
-
-        value = (comparator || value !== 0) ? value : 0;
-        if (!(seen
-              ? cacheHas(seen, computed)
-              : includes(result, computed, comparator)
-            )) {
-          othIndex = othLength;
-          while (--othIndex) {
-            var cache = caches[othIndex];
-            if (!(cache
-                  ? cacheHas(cache, computed)
-                  : includes(arrays[othIndex], computed, comparator))
-                ) {
-              continue outer;
-            }
-          }
-          if (seen) {
-            seen.push(computed);
-          }
-          result.push(value);
+      while (++argsIndex < holdersLength) {
+        if (isUncurried || argsIndex < argsLength) {
+          result[holders[argsIndex]] = args[argsIndex];
         }
       }
+      while (rangeLength--) {
+        result[leftIndex++] = args[argsIndex++];
+      }
       return result;
     }
 
     /**
-     * The base implementation of `_.invert` and `_.invertBy` which inverts
-     * `object` with values transformed by `iteratee` and set by `setter`.
+     * This function is like `composeArgs` except that the arguments composition
+     * is tailored for `_.partialRight`.
      *
      * @private
-     * @param {Object} object The object to iterate over.
-     * @param {Function} setter The function to set `accumulator` values.
-     * @param {Function} iteratee The iteratee to transform values.
-     * @param {Object} accumulator The initial inverted object.
-     * @returns {Function} Returns `accumulator`.
+     * @param {Array} args The provided arguments.
+     * @param {Array} partials The arguments to append to those provided.
+     * @param {Array} holders The `partials` placeholder indexes.
+     * @params {boolean} [isCurried] Specify composing for a curried function.
+     * @returns {Array} Returns the new array of composed arguments.
      */
-    function baseInverter(object, setter, iteratee, accumulator) {
-      baseForOwn(object, function(value, key, object) {
-        setter(accumulator, iteratee(value), key, object);
-      });
-      return accumulator;
+    function composeArgsRight(args, partials, holders, isCurried) {
+      var argsIndex = -1,
+          argsLength = args.length,
+          holdersIndex = -1,
+          holdersLength = holders.length,
+          rightIndex = -1,
+          rightLength = partials.length,
+          rangeLength = nativeMax(argsLength - holdersLength, 0),
+          result = Array(rangeLength + rightLength),
+          isUncurried = !isCurried;
+
+      while (++argsIndex < rangeLength) {
+        result[argsIndex] = args[argsIndex];
+      }
+      var offset = argsIndex;
+      while (++rightIndex < rightLength) {
+        result[offset + rightIndex] = partials[rightIndex];
+      }
+      while (++holdersIndex < holdersLength) {
+        if (isUncurried || argsIndex < argsLength) {
+          result[offset + holders[holdersIndex]] = args[argsIndex++];
+        }
+      }
+      return result;
     }
 
     /**
-     * The base implementation of `_.invoke` without support for individual
-     * method arguments.
+     * Copies the values of `source` to `array`.
      *
      * @private
-     * @param {Object} object The object to query.
-     * @param {Array|string} path The path of the method to invoke.
-     * @param {Array} args The arguments to invoke the method with.
-     * @returns {*} Returns the result of the invoked method.
+     * @param {Array} source The array to copy values from.
+     * @param {Array} [array=[]] The array to copy values to.
+     * @returns {Array} Returns `array`.
      */
-    function baseInvoke(object, path, args) {
-      path = castPath(path, object);
-      object = parent(object, path);
-      var func = object == null ? object : object[toKey(last(path))];
-      return func == null ? undefined$1 : apply(func, object, args);
+    function copyArray(source, array) {
+      var index = -1,
+          length = source.length;
+
+      array || (array = Array(length));
+      while (++index < length) {
+        array[index] = source[index];
+      }
+      return array;
     }
 
     /**
-     * The base implementation of `_.isArguments`.
+     * Copies properties of `source` to `object`.
      *
      * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is an `arguments` object,
+     * @param {Object} source The object to copy properties from.
+     * @param {Array} props The property identifiers to copy.
+     * @param {Object} [object={}] The object to copy properties to.
+     * @param {Function} [customizer] The function to customize copied values.
+     * @returns {Object} Returns `object`.
      */
-    function baseIsArguments(value) {
-      return isObjectLike(value) && baseGetTag(value) == argsTag;
+    function copyObject(source, props, object, customizer) {
+      var isNew = !object;
+      object || (object = {});
+
+      var index = -1,
+          length = props.length;
+
+      while (++index < length) {
+        var key = props[index];
+
+        var newValue = customizer
+          ? customizer(object[key], source[key], key, object, source)
+          : undefined$1;
+
+        if (newValue === undefined$1) {
+          newValue = source[key];
+        }
+        if (isNew) {
+          baseAssignValue(object, key, newValue);
+        } else {
+          assignValue(object, key, newValue);
+        }
+      }
+      return object;
     }
 
     /**
-     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.
+     * Copies own symbols of `source` to `object`.
      *
      * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.
+     * @param {Object} source The object to copy symbols from.
+     * @param {Object} [object={}] The object to copy symbols to.
+     * @returns {Object} Returns `object`.
      */
-    function baseIsArrayBuffer(value) {
-      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;
+    function copySymbols(source, object) {
+      return copyObject(source, getSymbols(source), object);
     }
 
     /**
-     * The base implementation of `_.isDate` without Node.js optimizations.
+     * Copies own and inherited symbols of `source` to `object`.
      *
      * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.
+     * @param {Object} source The object to copy symbols from.
+     * @param {Object} [object={}] The object to copy symbols to.
+     * @returns {Object} Returns `object`.
      */
-    function baseIsDate(value) {
-      return isObjectLike(value) && baseGetTag(value) == dateTag;
+    function copySymbolsIn(source, object) {
+      return copyObject(source, getSymbolsIn(source), object);
     }
 
     /**
-     * The base implementation of `_.isEqual` which supports partial comparisons
-     * and tracks traversed objects.
+     * Creates a function like `_.groupBy`.
      *
      * @private
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @param {boolean} bitmask The bitmask flags.
-     *  1 - Unordered comparison
-     *  2 - Partial comparison
-     * @param {Function} [customizer] The function to customize comparisons.
-     * @param {Object} [stack] Tracks traversed `value` and `other` objects.
-     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+     * @param {Function} setter The function to set accumulator values.
+     * @param {Function} [initializer] The accumulator object initializer.
+     * @returns {Function} Returns the new aggregator function.
      */
-    function baseIsEqual(value, other, bitmask, customizer, stack) {
-      if (value === other) {
-        return true;
-      }
-      if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {
-        return value !== value && other !== other;
-      }
-      return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);
+    function createAggregator(setter, initializer) {
+      return function(collection, iteratee) {
+        var func = isArray(collection) ? arrayAggregator : baseAggregator,
+            accumulator = initializer ? initializer() : {};
+
+        return func(collection, setter, getIteratee(iteratee, 2), accumulator);
+      };
     }
 
     /**
-     * A specialized version of `baseIsEqual` for arrays and objects which performs
-     * deep comparisons and tracks traversed objects enabling objects with circular
-     * references to be compared.
+     * Creates a function like `_.assign`.
      *
      * @private
-     * @param {Object} object The object to compare.
-     * @param {Object} other The other object to compare.
-     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
-     * @param {Function} customizer The function to customize comparisons.
-     * @param {Function} equalFunc The function to determine equivalents of values.
-     * @param {Object} [stack] Tracks traversed `object` and `other` objects.
-     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+     * @param {Function} assigner The function to assign values.
+     * @returns {Function} Returns the new assigner function.
      */
-    function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {
-      var objIsArr = isArray(object),
-          othIsArr = isArray(other),
-          objTag = objIsArr ? arrayTag : getTag(object),
-          othTag = othIsArr ? arrayTag : getTag(other);
-
-      objTag = objTag == argsTag ? objectTag : objTag;
-      othTag = othTag == argsTag ? objectTag : othTag;
+    function createAssigner(assigner) {
+      return baseRest(function(object, sources) {
+        var index = -1,
+            length = sources.length,
+            customizer = length > 1 ? sources[length - 1] : undefined$1,
+            guard = length > 2 ? sources[2] : undefined$1;
 
-      var objIsObj = objTag == objectTag,
-          othIsObj = othTag == objectTag,
-          isSameTag = objTag == othTag;
+        customizer = (assigner.length > 3 && typeof customizer == 'function')
+          ? (length--, customizer)
+          : undefined$1;
 
-      if (isSameTag && isBuffer(object)) {
-        if (!isBuffer(other)) {
-          return false;
+        if (guard && isIterateeCall(sources[0], sources[1], guard)) {
+          customizer = length < 3 ? undefined$1 : customizer;
+          length = 1;
         }
-        objIsArr = true;
-        objIsObj = false;
-      }
-      if (isSameTag && !objIsObj) {
-        stack || (stack = new Stack);
-        return (objIsArr || isTypedArray(object))
-          ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)
-          : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);
-      }
-      if (!(bitmask & COMPARE_PARTIAL_FLAG)) {
-        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),
-            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');
-
-        if (objIsWrapped || othIsWrapped) {
-          var objUnwrapped = objIsWrapped ? object.value() : object,
-              othUnwrapped = othIsWrapped ? other.value() : other;
-
-          stack || (stack = new Stack);
-          return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);
+        object = Object(object);
+        while (++index < length) {
+          var source = sources[index];
+          if (source) {
+            assigner(object, source, index, customizer);
+          }
         }
-      }
-      if (!isSameTag) {
-        return false;
-      }
-      stack || (stack = new Stack);
-      return equalObjects(object, other, bitmask, customizer, equalFunc, stack);
+        return object;
+      });
     }
 
     /**
-     * The base implementation of `_.isMap` without Node.js optimizations.
+     * Creates a `baseEach` or `baseEachRight` function.
      *
      * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a map, else `false`.
+     * @param {Function} eachFunc The function to iterate over a collection.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Function} Returns the new base function.
      */
-    function baseIsMap(value) {
-      return isObjectLike(value) && getTag(value) == mapTag;
+    function createBaseEach(eachFunc, fromRight) {
+      return function(collection, iteratee) {
+        if (collection == null) {
+          return collection;
+        }
+        if (!isArrayLike(collection)) {
+          return eachFunc(collection, iteratee);
+        }
+        var length = collection.length,
+            index = fromRight ? length : -1,
+            iterable = Object(collection);
+
+        while ((fromRight ? index-- : ++index < length)) {
+          if (iteratee(iterable[index], index, iterable) === false) {
+            break;
+          }
+        }
+        return collection;
+      };
     }
 
     /**
-     * The base implementation of `_.isMatch` without support for iteratee shorthands.
+     * Creates a base function for methods like `_.forIn` and `_.forOwn`.
      *
      * @private
-     * @param {Object} object The object to inspect.
-     * @param {Object} source The object of property values to match.
-     * @param {Array} matchData The property names, values, and compare flags to match.
-     * @param {Function} [customizer] The function to customize comparisons.
-     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Function} Returns the new base function.
      */
-    function baseIsMatch(object, source, matchData, customizer) {
-      var index = matchData.length,
-          length = index,
-          noCustomizer = !customizer;
-
-      if (object == null) {
-        return !length;
-      }
-      object = Object(object);
-      while (index--) {
-        var data = matchData[index];
-        if ((noCustomizer && data[2])
-              ? data[1] !== object[data[0]]
-              : !(data[0] in object)
-            ) {
-          return false;
-        }
-      }
-      while (++index < length) {
-        data = matchData[index];
-        var key = data[0],
-            objValue = object[key],
-            srcValue = data[1];
+    function createBaseFor(fromRight) {
+      return function(object, iteratee, keysFunc) {
+        var index = -1,
+            iterable = Object(object),
+            props = keysFunc(object),
+            length = props.length;
 
-        if (noCustomizer && data[2]) {
-          if (objValue === undefined$1 && !(key in object)) {
-            return false;
-          }
-        } else {
-          var stack = new Stack;
-          if (customizer) {
-            var result = customizer(objValue, srcValue, key, object, source, stack);
-          }
-          if (!(result === undefined$1
-                ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)
-                : result
-              )) {
-            return false;
+        while (length--) {
+          var key = props[fromRight ? length : ++index];
+          if (iteratee(iterable[key], key, iterable) === false) {
+            break;
           }
         }
-      }
-      return true;
+        return object;
+      };
     }
 
     /**
-     * The base implementation of `_.isNative` without bad shim checks.
+     * Creates a function that wraps `func` to invoke it with the optional `this`
+     * binding of `thisArg`.
      *
      * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a native function,
-     *  else `false`.
+     * @param {Function} func The function to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {*} [thisArg] The `this` binding of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function baseIsNative(value) {
-      if (!isObject(value) || isMasked(value)) {
-        return false;
+    function createBind(func, bitmask, thisArg) {
+      var isBind = bitmask & WRAP_BIND_FLAG,
+          Ctor = createCtor(func);
+
+      function wrapper() {
+        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
+        return fn.apply(isBind ? thisArg : this, arguments);
       }
-      var pattern = isFunction(value) ? reIsNative : reIsHostCtor;
-      return pattern.test(toSource(value));
+      return wrapper;
     }
 
     /**
-     * The base implementation of `_.isRegExp` without Node.js optimizations.
+     * Creates a function like `_.lowerFirst`.
      *
      * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.
+     * @param {string} methodName The name of the `String` case method to use.
+     * @returns {Function} Returns the new case function.
      */
-    function baseIsRegExp(value) {
-      return isObjectLike(value) && baseGetTag(value) == regexpTag;
+    function createCaseFirst(methodName) {
+      return function(string) {
+        string = toString(string);
+
+        var strSymbols = hasUnicode(string)
+          ? stringToArray(string)
+          : undefined$1;
+
+        var chr = strSymbols
+          ? strSymbols[0]
+          : string.charAt(0);
+
+        var trailing = strSymbols
+          ? castSlice(strSymbols, 1).join('')
+          : string.slice(1);
+
+        return chr[methodName]() + trailing;
+      };
     }
 
     /**
-     * The base implementation of `_.isSet` without Node.js optimizations.
+     * Creates a function like `_.camelCase`.
      *
      * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a set, else `false`.
+     * @param {Function} callback The function to combine each word.
+     * @returns {Function} Returns the new compounder function.
      */
-    function baseIsSet(value) {
-      return isObjectLike(value) && getTag(value) == setTag;
+    function createCompounder(callback) {
+      return function(string) {
+        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');
+      };
     }
 
     /**
-     * The base implementation of `_.isTypedArray` without Node.js optimizations.
+     * Creates a function that produces an instance of `Ctor` regardless of
+     * whether it was invoked as part of a `new` expression or by `call` or `apply`.
      *
      * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
+     * @param {Function} Ctor The constructor to wrap.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function baseIsTypedArray(value) {
-      return isObjectLike(value) &&
-        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];
+    function createCtor(Ctor) {
+      return function() {
+        // Use a `switch` statement to work with class constructors. See
+        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist
+        // for more details.
+        var args = arguments;
+        switch (args.length) {
+          case 0: return new Ctor;
+          case 1: return new Ctor(args[0]);
+          case 2: return new Ctor(args[0], args[1]);
+          case 3: return new Ctor(args[0], args[1], args[2]);
+          case 4: return new Ctor(args[0], args[1], args[2], args[3]);
+          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);
+          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);
+          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);
+        }
+        var thisBinding = baseCreate(Ctor.prototype),
+            result = Ctor.apply(thisBinding, args);
+
+        // Mimic the constructor's `return` behavior.
+        // See https://es5.github.io/#x13.2.2 for more details.
+        return isObject(result) ? result : thisBinding;
+      };
     }
 
     /**
-     * The base implementation of `_.iteratee`.
+     * Creates a function that wraps `func` to enable currying.
      *
      * @private
-     * @param {*} [value=_.identity] The value to convert to an iteratee.
-     * @returns {Function} Returns the iteratee.
+     * @param {Function} func The function to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {number} arity The arity of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function baseIteratee(value) {
-      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.
-      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.
-      if (typeof value == 'function') {
-        return value;
-      }
-      if (value == null) {
-        return identity;
-      }
-      if (typeof value == 'object') {
-        return isArray(value)
-          ? baseMatchesProperty(value[0], value[1])
-          : baseMatches(value);
+    function createCurry(func, bitmask, arity) {
+      var Ctor = createCtor(func);
+
+      function wrapper() {
+        var length = arguments.length,
+            args = Array(length),
+            index = length,
+            placeholder = getHolder(wrapper);
+
+        while (index--) {
+          args[index] = arguments[index];
+        }
+        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)
+          ? []
+          : replaceHolders(args, placeholder);
+
+        length -= holders.length;
+        if (length < arity) {
+          return createRecurry(
+            func, bitmask, createHybrid, wrapper.placeholder, undefined$1,
+            args, holders, undefined$1, undefined$1, arity - length);
+        }
+        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
+        return apply(fn, this, args);
       }
-      return property(value);
+      return wrapper;
     }
 
     /**
-     * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.
+     * Creates a `_.find` or `_.findLast` function.
      *
      * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property names.
+     * @param {Function} findIndexFunc The function to find the collection index.
+     * @returns {Function} Returns the new find function.
      */
-    function baseKeys(object) {
-      if (!isPrototype(object)) {
-        return nativeKeys(object);
-      }
-      var result = [];
-      for (var key in Object(object)) {
-        if (hasOwnProperty.call(object, key) && key != 'constructor') {
-          result.push(key);
+    function createFind(findIndexFunc) {
+      return function(collection, predicate, fromIndex) {
+        var iterable = Object(collection);
+        if (!isArrayLike(collection)) {
+          var iteratee = getIteratee(predicate, 3);
+          collection = keys(collection);
+          predicate = function(key) { return iteratee(iterable[key], key, iterable); };
         }
-      }
-      return result;
+        var index = findIndexFunc(collection, predicate, fromIndex);
+        return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined$1;
+      };
     }
 
     /**
-     * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.
+     * Creates a `_.flow` or `_.flowRight` function.
      *
      * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property names.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Function} Returns the new flow function.
      */
-    function baseKeysIn(object) {
-      if (!isObject(object)) {
-        return nativeKeysIn(object);
-      }
-      var isProto = isPrototype(object),
-          result = [];
+    function createFlow(fromRight) {
+      return flatRest(function(funcs) {
+        var length = funcs.length,
+            index = length,
+            prereq = LodashWrapper.prototype.thru;
 
-      for (var key in object) {
-        if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {
-          result.push(key);
+        if (fromRight) {
+          funcs.reverse();
         }
-      }
-      return result;
+        while (index--) {
+          var func = funcs[index];
+          if (typeof func != 'function') {
+            throw new TypeError(FUNC_ERROR_TEXT);
+          }
+          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {
+            var wrapper = new LodashWrapper([], true);
+          }
+        }
+        index = wrapper ? index : length;
+        while (++index < length) {
+          func = funcs[index];
+
+          var funcName = getFuncName(func),
+              data = funcName == 'wrapper' ? getData(func) : undefined$1;
+
+          if (data && isLaziable(data[0]) &&
+                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&
+                !data[4].length && data[9] == 1
+              ) {
+            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
+          } else {
+            wrapper = (func.length == 1 && isLaziable(func))
+              ? wrapper[funcName]()
+              : wrapper.thru(func);
+          }
+        }
+        return function() {
+          var args = arguments,
+              value = args[0];
+
+          if (wrapper && args.length == 1 && isArray(value)) {
+            return wrapper.plant(value).value();
+          }
+          var index = 0,
+              result = length ? funcs[index].apply(this, args) : value;
+
+          while (++index < length) {
+            result = funcs[index].call(this, result);
+          }
+          return result;
+        };
+      });
     }
 
     /**
-     * The base implementation of `_.lt` which doesn't coerce arguments.
+     * Creates a function that wraps `func` to invoke it with optional `this`
+     * binding of `thisArg`, partial application, and currying.
      *
      * @private
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is less than `other`,
-     *  else `false`.
+     * @param {Function|string} func The function or method name to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {*} [thisArg] The `this` binding of `func`.
+     * @param {Array} [partials] The arguments to prepend to those provided to
+     *  the new function.
+     * @param {Array} [holders] The `partials` placeholder indexes.
+     * @param {Array} [partialsRight] The arguments to append to those provided
+     *  to the new function.
+     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.
+     * @param {Array} [argPos] The argument positions of the new function.
+     * @param {number} [ary] The arity cap of `func`.
+     * @param {number} [arity] The arity of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function baseLt(value, other) {
-      return value < other;
+    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {
+      var isAry = bitmask & WRAP_ARY_FLAG,
+          isBind = bitmask & WRAP_BIND_FLAG,
+          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,
+          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),
+          isFlip = bitmask & WRAP_FLIP_FLAG,
+          Ctor = isBindKey ? undefined$1 : createCtor(func);
+
+      function wrapper() {
+        var length = arguments.length,
+            args = Array(length),
+            index = length;
+
+        while (index--) {
+          args[index] = arguments[index];
+        }
+        if (isCurried) {
+          var placeholder = getHolder(wrapper),
+              holdersCount = countHolders(args, placeholder);
+        }
+        if (partials) {
+          args = composeArgs(args, partials, holders, isCurried);
+        }
+        if (partialsRight) {
+          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);
+        }
+        length -= holdersCount;
+        if (isCurried && length < arity) {
+          var newHolders = replaceHolders(args, placeholder);
+          return createRecurry(
+            func, bitmask, createHybrid, wrapper.placeholder, thisArg,
+            args, newHolders, argPos, ary, arity - length
+          );
+        }
+        var thisBinding = isBind ? thisArg : this,
+            fn = isBindKey ? thisBinding[func] : func;
+
+        length = args.length;
+        if (argPos) {
+          args = reorder(args, argPos);
+        } else if (isFlip && length > 1) {
+          args.reverse();
+        }
+        if (isAry && ary < length) {
+          args.length = ary;
+        }
+        if (this && this !== root && this instanceof wrapper) {
+          fn = Ctor || createCtor(fn);
+        }
+        return fn.apply(thisBinding, args);
+      }
+      return wrapper;
     }
 
     /**
-     * The base implementation of `_.map` without support for iteratee shorthands.
+     * Creates a function like `_.invertBy`.
      *
      * @private
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} iteratee The function invoked per iteration.
-     * @returns {Array} Returns the new mapped array.
+     * @param {Function} setter The function to set accumulator values.
+     * @param {Function} toIteratee The function to resolve iteratees.
+     * @returns {Function} Returns the new inverter function.
      */
-    function baseMap(collection, iteratee) {
-      var index = -1,
-          result = isArrayLike(collection) ? Array(collection.length) : [];
-
-      baseEach(collection, function(value, key, collection) {
-        result[++index] = iteratee(value, key, collection);
-      });
-      return result;
+    function createInverter(setter, toIteratee) {
+      return function(object, iteratee) {
+        return baseInverter(object, setter, toIteratee(iteratee), {});
+      };
     }
 
     /**
-     * The base implementation of `_.matches` which doesn't clone `source`.
+     * Creates a function that performs a mathematical operation on two values.
      *
      * @private
-     * @param {Object} source The object of property values to match.
-     * @returns {Function} Returns the new spec function.
+     * @param {Function} operator The function to perform the operation.
+     * @param {number} [defaultValue] The value used for `undefined` arguments.
+     * @returns {Function} Returns the new mathematical operation function.
      */
-    function baseMatches(source) {
-      var matchData = getMatchData(source);
-      if (matchData.length == 1 && matchData[0][2]) {
-        return matchesStrictComparable(matchData[0][0], matchData[0][1]);
-      }
-      return function(object) {
-        return object === source || baseIsMatch(object, source, matchData);
+    function createMathOperation(operator, defaultValue) {
+      return function(value, other) {
+        var result;
+        if (value === undefined$1 && other === undefined$1) {
+          return defaultValue;
+        }
+        if (value !== undefined$1) {
+          result = value;
+        }
+        if (other !== undefined$1) {
+          if (result === undefined$1) {
+            return other;
+          }
+          if (typeof value == 'string' || typeof other == 'string') {
+            value = baseToString(value);
+            other = baseToString(other);
+          } else {
+            value = baseToNumber(value);
+            other = baseToNumber(other);
+          }
+          result = operator(value, other);
+        }
+        return result;
       };
     }
 
     /**
-     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.
+     * Creates a function like `_.over`.
      *
      * @private
-     * @param {string} path The path of the property to get.
-     * @param {*} srcValue The value to match.
-     * @returns {Function} Returns the new spec function.
+     * @param {Function} arrayFunc The function to iterate over iteratees.
+     * @returns {Function} Returns the new over function.
      */
-    function baseMatchesProperty(path, srcValue) {
-      if (isKey(path) && isStrictComparable(srcValue)) {
-        return matchesStrictComparable(toKey(path), srcValue);
-      }
-      return function(object) {
-        var objValue = get(object, path);
-        return (objValue === undefined$1 && objValue === srcValue)
-          ? hasIn(object, path)
-          : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);
-      };
+    function createOver(arrayFunc) {
+      return flatRest(function(iteratees) {
+        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));
+        return baseRest(function(args) {
+          var thisArg = this;
+          return arrayFunc(iteratees, function(iteratee) {
+            return apply(iteratee, thisArg, args);
+          });
+        });
+      });
     }
 
     /**
-     * The base implementation of `_.merge` without support for multiple sources.
+     * Creates the padding for `string` based on `length`. The `chars` string
+     * is truncated if the number of characters exceeds `length`.
      *
      * @private
-     * @param {Object} object The destination object.
-     * @param {Object} source The source object.
-     * @param {number} srcIndex The index of `source`.
-     * @param {Function} [customizer] The function to customize merged values.
-     * @param {Object} [stack] Tracks traversed source values and their merged
-     *  counterparts.
+     * @param {number} length The padding length.
+     * @param {string} [chars=' '] The string used as padding.
+     * @returns {string} Returns the padding for `string`.
      */
-    function baseMerge(object, source, srcIndex, customizer, stack) {
-      if (object === source) {
-        return;
-      }
-      baseFor(source, function(srcValue, key) {
-        stack || (stack = new Stack);
-        if (isObject(srcValue)) {
-          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);
-        }
-        else {
-          var newValue = customizer
-            ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)
-            : undefined$1;
+    function createPadding(length, chars) {
+      chars = chars === undefined$1 ? ' ' : baseToString(chars);
 
-          if (newValue === undefined$1) {
-            newValue = srcValue;
-          }
-          assignMergeValue(object, key, newValue);
-        }
-      }, keysIn);
+      var charsLength = chars.length;
+      if (charsLength < 2) {
+        return charsLength ? baseRepeat(chars, length) : chars;
+      }
+      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));
+      return hasUnicode(chars)
+        ? castSlice(stringToArray(result), 0, length).join('')
+        : result.slice(0, length);
     }
 
     /**
-     * A specialized version of `baseMerge` for arrays and objects which performs
-     * deep merges and tracks traversed objects enabling objects with circular
-     * references to be merged.
+     * Creates a function that wraps `func` to invoke it with the `this` binding
+     * of `thisArg` and `partials` prepended to the arguments it receives.
      *
      * @private
-     * @param {Object} object The destination object.
-     * @param {Object} source The source object.
-     * @param {string} key The key of the value to merge.
-     * @param {number} srcIndex The index of `source`.
-     * @param {Function} mergeFunc The function to merge values.
-     * @param {Function} [customizer] The function to customize assigned values.
-     * @param {Object} [stack] Tracks traversed source values and their merged
-     *  counterparts.
+     * @param {Function} func The function to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {*} thisArg The `this` binding of `func`.
+     * @param {Array} partials The arguments to prepend to those provided to
+     *  the new function.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {
-      var objValue = safeGet(object, key),
-          srcValue = safeGet(source, key),
-          stacked = stack.get(srcValue);
-
-      if (stacked) {
-        assignMergeValue(object, key, stacked);
-        return;
-      }
-      var newValue = customizer
-        ? customizer(objValue, srcValue, (key + ''), object, source, stack)
-        : undefined$1;
-
-      var isCommon = newValue === undefined$1;
+    function createPartial(func, bitmask, thisArg, partials) {
+      var isBind = bitmask & WRAP_BIND_FLAG,
+          Ctor = createCtor(func);
 
-      if (isCommon) {
-        var isArr = isArray(srcValue),
-            isBuff = !isArr && isBuffer(srcValue),
-            isTyped = !isArr && !isBuff && isTypedArray(srcValue);
+      function wrapper() {
+        var argsIndex = -1,
+            argsLength = arguments.length,
+            leftIndex = -1,
+            leftLength = partials.length,
+            args = Array(leftLength + argsLength),
+            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
 
-        newValue = srcValue;
-        if (isArr || isBuff || isTyped) {
-          if (isArray(objValue)) {
-            newValue = objValue;
-          }
-          else if (isArrayLikeObject(objValue)) {
-            newValue = copyArray(objValue);
-          }
-          else if (isBuff) {
-            isCommon = false;
-            newValue = cloneBuffer(srcValue, true);
-          }
-          else if (isTyped) {
-            isCommon = false;
-            newValue = cloneTypedArray(srcValue, true);
-          }
-          else {
-            newValue = [];
-          }
-        }
-        else if (isPlainObject(srcValue) || isArguments(srcValue)) {
-          newValue = objValue;
-          if (isArguments(objValue)) {
-            newValue = toPlainObject(objValue);
-          }
-          else if (!isObject(objValue) || isFunction(objValue)) {
-            newValue = initCloneObject(srcValue);
-          }
+        while (++leftIndex < leftLength) {
+          args[leftIndex] = partials[leftIndex];
         }
-        else {
-          isCommon = false;
+        while (argsLength--) {
+          args[leftIndex++] = arguments[++argsIndex];
         }
+        return apply(fn, isBind ? thisArg : this, args);
       }
-      if (isCommon) {
-        // Recursively merge objects and arrays (susceptible to call stack limits).
-        stack.set(srcValue, newValue);
-        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);
-        stack['delete'](srcValue);
-      }
-      assignMergeValue(object, key, newValue);
+      return wrapper;
     }
 
     /**
-     * The base implementation of `_.nth` which doesn't coerce arguments.
+     * Creates a `_.range` or `_.rangeRight` function.
      *
      * @private
-     * @param {Array} array The array to query.
-     * @param {number} n The index of the element to return.
-     * @returns {*} Returns the nth element of `array`.
+     * @param {boolean} [fromRight] Specify iterating from right to left.
+     * @returns {Function} Returns the new range function.
      */
-    function baseNth(array, n) {
-      var length = array.length;
-      if (!length) {
-        return;
-      }
-      n += n < 0 ? length : 0;
-      return isIndex(n, length) ? array[n] : undefined$1;
+    function createRange(fromRight) {
+      return function(start, end, step) {
+        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {
+          end = step = undefined$1;
+        }
+        // Ensure the sign of `-0` is preserved.
+        start = toFinite(start);
+        if (end === undefined$1) {
+          end = start;
+          start = 0;
+        } else {
+          end = toFinite(end);
+        }
+        step = step === undefined$1 ? (start < end ? 1 : -1) : toFinite(step);
+        return baseRange(start, end, step, fromRight);
+      };
+    }
+
+    /**
+     * Creates a function that performs a relational operation on two values.
+     *
+     * @private
+     * @param {Function} operator The function to perform the operation.
+     * @returns {Function} Returns the new relational operation function.
+     */
+    function createRelationalOperation(operator) {
+      return function(value, other) {
+        if (!(typeof value == 'string' && typeof other == 'string')) {
+          value = toNumber(value);
+          other = toNumber(other);
+        }
+        return operator(value, other);
+      };
     }
 
     /**
-     * The base implementation of `_.orderBy` without param guards.
+     * Creates a function that wraps `func` to continue currying.
      *
      * @private
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.
-     * @param {string[]} orders The sort orders of `iteratees`.
-     * @returns {Array} Returns the new sorted array.
+     * @param {Function} func The function to wrap.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @param {Function} wrapFunc The function to create the `func` wrapper.
+     * @param {*} placeholder The placeholder value.
+     * @param {*} [thisArg] The `this` binding of `func`.
+     * @param {Array} [partials] The arguments to prepend to those provided to
+     *  the new function.
+     * @param {Array} [holders] The `partials` placeholder indexes.
+     * @param {Array} [argPos] The argument positions of the new function.
+     * @param {number} [ary] The arity cap of `func`.
+     * @param {number} [arity] The arity of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function baseOrderBy(collection, iteratees, orders) {
-      if (iteratees.length) {
-        iteratees = arrayMap(iteratees, function(iteratee) {
-          if (isArray(iteratee)) {
-            return function(value) {
-              return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);
-            }
-          }
-          return iteratee;
-        });
-      } else {
-        iteratees = [identity];
-      }
+    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {
+      var isCurry = bitmask & WRAP_CURRY_FLAG,
+          newHolders = isCurry ? holders : undefined$1,
+          newHoldersRight = isCurry ? undefined$1 : holders,
+          newPartials = isCurry ? partials : undefined$1,
+          newPartialsRight = isCurry ? undefined$1 : partials;
 
-      var index = -1;
-      iteratees = arrayMap(iteratees, baseUnary(getIteratee()));
+      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);
+      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);
 
-      var result = baseMap(collection, function(value, key, collection) {
-        var criteria = arrayMap(iteratees, function(iteratee) {
-          return iteratee(value);
-        });
-        return { 'criteria': criteria, 'index': ++index, 'value': value };
-      });
+      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {
+        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);
+      }
+      var newData = [
+        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,
+        newHoldersRight, argPos, ary, arity
+      ];
 
-      return baseSortBy(result, function(object, other) {
-        return compareMultiple(object, other, orders);
-      });
+      var result = wrapFunc.apply(undefined$1, newData);
+      if (isLaziable(func)) {
+        setData(result, newData);
+      }
+      result.placeholder = placeholder;
+      return setWrapToString(result, func, bitmask);
     }
 
     /**
-     * The base implementation of `_.pick` without support for individual
-     * property identifiers.
+     * Creates a function like `_.round`.
      *
      * @private
-     * @param {Object} object The source object.
-     * @param {string[]} paths The property paths to pick.
-     * @returns {Object} Returns the new object.
+     * @param {string} methodName The name of the `Math` method to use when rounding.
+     * @returns {Function} Returns the new round function.
      */
-    function basePick(object, paths) {
-      return basePickBy(object, paths, function(value, path) {
-        return hasIn(object, path);
-      });
+    function createRound(methodName) {
+      var func = Math[methodName];
+      return function(number, precision) {
+        number = toNumber(number);
+        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);
+        if (precision && nativeIsFinite(number)) {
+          // Shift with exponential notation to avoid floating-point issues.
+          // See [MDN](https://mdn.io/round#Examples) for more details.
+          var pair = (toString(number) + 'e').split('e'),
+              value = func(pair[0] + 'e' + (+pair[1] + precision));
+
+          pair = (toString(value) + 'e').split('e');
+          return +(pair[0] + 'e' + (+pair[1] - precision));
+        }
+        return func(number);
+      };
     }
 
     /**
-     * The base implementation of  `_.pickBy` without support for iteratee shorthands.
+     * Creates a set object of `values`.
      *
      * @private
-     * @param {Object} object The source object.
-     * @param {string[]} paths The property paths to pick.
-     * @param {Function} predicate The function invoked per property.
-     * @returns {Object} Returns the new object.
+     * @param {Array} values The values to add to the set.
+     * @returns {Object} Returns the new set.
      */
-    function basePickBy(object, paths, predicate) {
-      var index = -1,
-          length = paths.length,
-          result = {};
-
-      while (++index < length) {
-        var path = paths[index],
-            value = baseGet(object, path);
-
-        if (predicate(value, path)) {
-          baseSet(result, castPath(path, object), value);
-        }
-      }
-      return result;
-    }
+    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {
+      return new Set(values);
+    };
 
     /**
-     * A specialized version of `baseProperty` which supports deep paths.
+     * Creates a `_.toPairs` or `_.toPairsIn` function.
      *
      * @private
-     * @param {Array|string} path The path of the property to get.
-     * @returns {Function} Returns the new accessor function.
+     * @param {Function} keysFunc The function to get the keys of a given object.
+     * @returns {Function} Returns the new pairs function.
      */
-    function basePropertyDeep(path) {
+    function createToPairs(keysFunc) {
       return function(object) {
-        return baseGet(object, path);
+        var tag = getTag(object);
+        if (tag == mapTag) {
+          return mapToArray(object);
+        }
+        if (tag == setTag) {
+          return setToPairs(object);
+        }
+        return baseToPairs(object, keysFunc(object));
       };
     }
 
     /**
-     * The base implementation of `_.pullAllBy` without support for iteratee
-     * shorthands.
+     * Creates a function that either curries or invokes `func` with optional
+     * `this` binding and partially applied arguments.
      *
      * @private
-     * @param {Array} array The array to modify.
-     * @param {Array} values The values to remove.
-     * @param {Function} [iteratee] The iteratee invoked per element.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns `array`.
+     * @param {Function|string} func The function or method name to wrap.
+     * @param {number} bitmask The bitmask flags.
+     *    1 - `_.bind`
+     *    2 - `_.bindKey`
+     *    4 - `_.curry` or `_.curryRight` of a bound function
+     *    8 - `_.curry`
+     *   16 - `_.curryRight`
+     *   32 - `_.partial`
+     *   64 - `_.partialRight`
+     *  128 - `_.rearg`
+     *  256 - `_.ary`
+     *  512 - `_.flip`
+     * @param {*} [thisArg] The `this` binding of `func`.
+     * @param {Array} [partials] The arguments to be partially applied.
+     * @param {Array} [holders] The `partials` placeholder indexes.
+     * @param {Array} [argPos] The argument positions of the new function.
+     * @param {number} [ary] The arity cap of `func`.
+     * @param {number} [arity] The arity of `func`.
+     * @returns {Function} Returns the new wrapped function.
      */
-    function basePullAll(array, values, iteratee, comparator) {
-      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,
-          index = -1,
-          length = values.length,
-          seen = array;
-
-      if (array === values) {
-        values = copyArray(values);
+    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {
+      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;
+      if (!isBindKey && typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
       }
-      if (iteratee) {
-        seen = arrayMap(array, baseUnary(iteratee));
+      var length = partials ? partials.length : 0;
+      if (!length) {
+        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);
+        partials = holders = undefined$1;
       }
-      while (++index < length) {
-        var fromIndex = 0,
-            value = values[index],
-            computed = iteratee ? iteratee(value) : value;
+      ary = ary === undefined$1 ? ary : nativeMax(toInteger(ary), 0);
+      arity = arity === undefined$1 ? arity : toInteger(arity);
+      length -= holders ? holders.length : 0;
 
-        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {
-          if (seen !== array) {
-            splice.call(seen, fromIndex, 1);
-          }
-          splice.call(array, fromIndex, 1);
-        }
+      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {
+        var partialsRight = partials,
+            holdersRight = holders;
+
+        partials = holders = undefined$1;
       }
-      return array;
-    }
+      var data = isBindKey ? undefined$1 : getData(func);
 
-    /**
-     * The base implementation of `_.pullAt` without support for individual
-     * indexes or capturing the removed elements.
-     *
-     * @private
-     * @param {Array} array The array to modify.
-     * @param {number[]} indexes The indexes of elements to remove.
-     * @returns {Array} Returns `array`.
-     */
-    function basePullAt(array, indexes) {
-      var length = array ? indexes.length : 0,
-          lastIndex = length - 1;
+      var newData = [
+        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,
+        argPos, ary, arity
+      ];
 
-      while (length--) {
-        var index = indexes[length];
-        if (length == lastIndex || index !== previous) {
-          var previous = index;
-          if (isIndex(index)) {
-            splice.call(array, index, 1);
-          } else {
-            baseUnset(array, index);
-          }
-        }
+      if (data) {
+        mergeData(newData, data);
+      }
+      func = newData[0];
+      bitmask = newData[1];
+      thisArg = newData[2];
+      partials = newData[3];
+      holders = newData[4];
+      arity = newData[9] = newData[9] === undefined$1
+        ? (isBindKey ? 0 : func.length)
+        : nativeMax(newData[9] - length, 0);
+
+      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {
+        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);
+      }
+      if (!bitmask || bitmask == WRAP_BIND_FLAG) {
+        var result = createBind(func, bitmask, thisArg);
+      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {
+        result = createCurry(func, bitmask, arity);
+      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {
+        result = createPartial(func, bitmask, thisArg, partials);
+      } else {
+        result = createHybrid.apply(undefined$1, newData);
       }
-      return array;
-    }
-
-    /**
-     * The base implementation of `_.random` without support for returning
-     * floating-point numbers.
-     *
-     * @private
-     * @param {number} lower The lower bound.
-     * @param {number} upper The upper bound.
-     * @returns {number} Returns the random number.
-     */
-    function baseRandom(lower, upper) {
-      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));
+      var setter = data ? baseSetData : setData;
+      return setWrapToString(setter(result, newData), func, bitmask);
     }
 
     /**
-     * The base implementation of `_.range` and `_.rangeRight` which doesn't
-     * coerce arguments.
+     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties
+     * of source objects to the destination object for all destination properties
+     * that resolve to `undefined`.
      *
      * @private
-     * @param {number} start The start of the range.
-     * @param {number} end The end of the range.
-     * @param {number} step The value to increment or decrement by.
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Array} Returns the range of numbers.
+     * @param {*} objValue The destination value.
+     * @param {*} srcValue The source value.
+     * @param {string} key The key of the property to assign.
+     * @param {Object} object The parent object of `objValue`.
+     * @returns {*} Returns the value to assign.
      */
-    function baseRange(start, end, step, fromRight) {
-      var index = -1,
-          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),
-          result = Array(length);
-
-      while (length--) {
-        result[fromRight ? length : ++index] = start;
-        start += step;
+    function customDefaultsAssignIn(objValue, srcValue, key, object) {
+      if (objValue === undefined$1 ||
+          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {
+        return srcValue;
       }
-      return result;
+      return objValue;
     }
 
     /**
-     * The base implementation of `_.repeat` which doesn't coerce arguments.
+     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source
+     * objects into destination objects that are passed thru.
      *
      * @private
-     * @param {string} string The string to repeat.
-     * @param {number} n The number of times to repeat the string.
-     * @returns {string} Returns the repeated string.
+     * @param {*} objValue The destination value.
+     * @param {*} srcValue The source value.
+     * @param {string} key The key of the property to merge.
+     * @param {Object} object The parent object of `objValue`.
+     * @param {Object} source The parent object of `srcValue`.
+     * @param {Object} [stack] Tracks traversed source values and their merged
+     *  counterparts.
+     * @returns {*} Returns the value to assign.
      */
-    function baseRepeat(string, n) {
-      var result = '';
-      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {
-        return result;
+    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {
+      if (isObject(objValue) && isObject(srcValue)) {
+        // Recursively merge objects and arrays (susceptible to call stack limits).
+        stack.set(srcValue, objValue);
+        baseMerge(objValue, srcValue, undefined$1, customDefaultsMerge, stack);
+        stack['delete'](srcValue);
       }
-      // Leverage the exponentiation by squaring algorithm for a faster repeat.
-      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.
-      do {
-        if (n % 2) {
-          result += string;
-        }
-        n = nativeFloor(n / 2);
-        if (n) {
-          string += string;
-        }
-      } while (n);
-
-      return result;
+      return objValue;
     }
 
     /**
-     * The base implementation of `_.rest` which doesn't validate or coerce arguments.
+     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain
+     * objects.
      *
      * @private
-     * @param {Function} func The function to apply a rest parameter to.
-     * @param {number} [start=func.length-1] The start position of the rest parameter.
-     * @returns {Function} Returns the new function.
+     * @param {*} value The value to inspect.
+     * @param {string} key The key of the property to inspect.
+     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.
      */
-    function baseRest(func, start) {
-      return setToString(overRest(func, start, identity), func + '');
+    function customOmitClone(value) {
+      return isPlainObject(value) ? undefined$1 : value;
     }
 
     /**
-     * The base implementation of `_.sample`.
+     * A specialized version of `baseIsEqualDeep` for arrays with support for
+     * partial deep comparisons.
      *
      * @private
-     * @param {Array|Object} collection The collection to sample.
-     * @returns {*} Returns the random element.
+     * @param {Array} array The array to compare.
+     * @param {Array} other The other array to compare.
+     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+     * @param {Function} customizer The function to customize comparisons.
+     * @param {Function} equalFunc The function to determine equivalents of values.
+     * @param {Object} stack Tracks traversed `array` and `other` objects.
+     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
      */
-    function baseSample(collection) {
-      return arraySample(values(collection));
-    }
+    function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
+      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
+          arrLength = array.length,
+          othLength = other.length;
 
-    /**
-     * The base implementation of `_.sampleSize` without param guards.
-     *
-     * @private
-     * @param {Array|Object} collection The collection to sample.
-     * @param {number} n The number of elements to sample.
-     * @returns {Array} Returns the random elements.
-     */
-    function baseSampleSize(collection, n) {
-      var array = values(collection);
-      return shuffleSelf(array, baseClamp(n, 0, array.length));
+      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
+        return false;
+      }
+      // Check that cyclic values are equal.
+      var arrStacked = stack.get(array);
+      var othStacked = stack.get(other);
+      if (arrStacked && othStacked) {
+        return arrStacked == other && othStacked == array;
+      }
+      var index = -1,
+          result = true,
+          seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined$1;
+
+      stack.set(array, other);
+      stack.set(other, array);
+
+      // Ignore non-index properties.
+      while (++index < arrLength) {
+        var arrValue = array[index],
+            othValue = other[index];
+
+        if (customizer) {
+          var compared = isPartial
+            ? customizer(othValue, arrValue, index, other, array, stack)
+            : customizer(arrValue, othValue, index, array, other, stack);
+        }
+        if (compared !== undefined$1) {
+          if (compared) {
+            continue;
+          }
+          result = false;
+          break;
+        }
+        // Recursively compare arrays (susceptible to call stack limits).
+        if (seen) {
+          if (!arraySome(other, function(othValue, othIndex) {
+                if (!cacheHas(seen, othIndex) &&
+                    (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
+                  return seen.push(othIndex);
+                }
+              })) {
+            result = false;
+            break;
+          }
+        } else if (!(
+              arrValue === othValue ||
+                equalFunc(arrValue, othValue, bitmask, customizer, stack)
+            )) {
+          result = false;
+          break;
+        }
+      }
+      stack['delete'](array);
+      stack['delete'](other);
+      return result;
     }
 
     /**
-     * The base implementation of `_.set`.
+     * A specialized version of `baseIsEqualDeep` for comparing objects of
+     * the same `toStringTag`.
+     *
+     * **Note:** This function only supports comparing values with tags of
+     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
      *
      * @private
-     * @param {Object} object The object to modify.
-     * @param {Array|string} path The path of the property to set.
-     * @param {*} value The value to set.
-     * @param {Function} [customizer] The function to customize path creation.
-     * @returns {Object} Returns `object`.
+     * @param {Object} object The object to compare.
+     * @param {Object} other The other object to compare.
+     * @param {string} tag The `toStringTag` of the objects to compare.
+     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+     * @param {Function} customizer The function to customize comparisons.
+     * @param {Function} equalFunc The function to determine equivalents of values.
+     * @param {Object} stack Tracks traversed `object` and `other` objects.
+     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
      */
-    function baseSet(object, path, value, customizer) {
-      if (!isObject(object)) {
-        return object;
-      }
-      path = castPath(path, object);
+    function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
+      switch (tag) {
+        case dataViewTag:
+          if ((object.byteLength != other.byteLength) ||
+              (object.byteOffset != other.byteOffset)) {
+            return false;
+          }
+          object = object.buffer;
+          other = other.buffer;
 
-      var index = -1,
-          length = path.length,
-          lastIndex = length - 1,
-          nested = object;
+        case arrayBufferTag:
+          if ((object.byteLength != other.byteLength) ||
+              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
+            return false;
+          }
+          return true;
 
-      while (nested != null && ++index < length) {
-        var key = toKey(path[index]),
-            newValue = value;
+        case boolTag:
+        case dateTag:
+        case numberTag:
+          // Coerce booleans to `1` or `0` and dates to milliseconds.
+          // Invalid dates are coerced to `NaN`.
+          return eq(+object, +other);
+
+        case errorTag:
+          return object.name == other.name && object.message == other.message;
+
+        case regexpTag:
+        case stringTag:
+          // Coerce regexes to strings and treat strings, primitives and objects,
+          // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring
+          // for more details.
+          return object == (other + '');
+
+        case mapTag:
+          var convert = mapToArray;
+
+        case setTag:
+          var isPartial = bitmask & COMPARE_PARTIAL_FLAG;
+          convert || (convert = setToArray);
+
+          if (object.size != other.size && !isPartial) {
+            return false;
+          }
+          // Assume cyclic values are equal.
+          var stacked = stack.get(object);
+          if (stacked) {
+            return stacked == other;
+          }
+          bitmask |= COMPARE_UNORDERED_FLAG;
 
-        if (key === '__proto__' || key === 'constructor' || key === 'prototype') {
-          return object;
-        }
+          // Recursively compare objects (susceptible to call stack limits).
+          stack.set(object, other);
+          var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);
+          stack['delete'](object);
+          return result;
 
-        if (index != lastIndex) {
-          var objValue = nested[key];
-          newValue = customizer ? customizer(objValue, key, nested) : undefined$1;
-          if (newValue === undefined$1) {
-            newValue = isObject(objValue)
-              ? objValue
-              : (isIndex(path[index + 1]) ? [] : {});
+        case symbolTag:
+          if (symbolValueOf) {
+            return symbolValueOf.call(object) == symbolValueOf.call(other);
           }
-        }
-        assignValue(nested, key, newValue);
-        nested = nested[key];
       }
-      return object;
+      return false;
     }
 
     /**
-     * The base implementation of `setData` without support for hot loop shorting.
-     *
-     * @private
-     * @param {Function} func The function to associate metadata with.
-     * @param {*} data The metadata.
-     * @returns {Function} Returns `func`.
-     */
-    var baseSetData = !metaMap ? identity : function(func, data) {
-      metaMap.set(func, data);
-      return func;
-    };
-
-    /**
-     * The base implementation of `setToString` without support for hot loop shorting.
+     * A specialized version of `baseIsEqualDeep` for objects with support for
+     * partial deep comparisons.
      *
      * @private
-     * @param {Function} func The function to modify.
-     * @param {Function} string The `toString` result.
-     * @returns {Function} Returns `func`.
+     * @param {Object} object The object to compare.
+     * @param {Object} other The other object to compare.
+     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
+     * @param {Function} customizer The function to customize comparisons.
+     * @param {Function} equalFunc The function to determine equivalents of values.
+     * @param {Object} stack Tracks traversed `object` and `other` objects.
+     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
      */
-    var baseSetToString = !defineProperty ? identity : function(func, string) {
-      return defineProperty(func, 'toString', {
-        'configurable': true,
-        'enumerable': false,
-        'value': constant(string),
-        'writable': true
-      });
-    };
+    function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
+      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
+          objProps = getAllKeys(object),
+          objLength = objProps.length,
+          othProps = getAllKeys(other),
+          othLength = othProps.length;
 
-    /**
-     * The base implementation of `_.shuffle`.
-     *
-     * @private
-     * @param {Array|Object} collection The collection to shuffle.
-     * @returns {Array} Returns the new shuffled array.
-     */
-    function baseShuffle(collection) {
-      return shuffleSelf(values(collection));
-    }
+      if (objLength != othLength && !isPartial) {
+        return false;
+      }
+      var index = objLength;
+      while (index--) {
+        var key = objProps[index];
+        if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {
+          return false;
+        }
+      }
+      // Check that cyclic values are equal.
+      var objStacked = stack.get(object);
+      var othStacked = stack.get(other);
+      if (objStacked && othStacked) {
+        return objStacked == other && othStacked == object;
+      }
+      var result = true;
+      stack.set(object, other);
+      stack.set(other, object);
 
-    /**
-     * The base implementation of `_.slice` without an iteratee call guard.
-     *
-     * @private
-     * @param {Array} array The array to slice.
-     * @param {number} [start=0] The start position.
-     * @param {number} [end=array.length] The end position.
-     * @returns {Array} Returns the slice of `array`.
-     */
-    function baseSlice(array, start, end) {
-      var index = -1,
-          length = array.length;
+      var skipCtor = isPartial;
+      while (++index < objLength) {
+        key = objProps[index];
+        var objValue = object[key],
+            othValue = other[key];
 
-      if (start < 0) {
-        start = -start > length ? 0 : (length + start);
-      }
-      end = end > length ? length : end;
-      if (end < 0) {
-        end += length;
+        if (customizer) {
+          var compared = isPartial
+            ? customizer(othValue, objValue, key, other, object, stack)
+            : customizer(objValue, othValue, key, object, other, stack);
+        }
+        // Recursively compare objects (susceptible to call stack limits).
+        if (!(compared === undefined$1
+              ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))
+              : compared
+            )) {
+          result = false;
+          break;
+        }
+        skipCtor || (skipCtor = key == 'constructor');
       }
-      length = start > end ? 0 : ((end - start) >>> 0);
-      start >>>= 0;
+      if (result && !skipCtor) {
+        var objCtor = object.constructor,
+            othCtor = other.constructor;
 
-      var result = Array(length);
-      while (++index < length) {
-        result[index] = array[index + start];
+        // Non `Object` object instances with different constructors are not equal.
+        if (objCtor != othCtor &&
+            ('constructor' in object && 'constructor' in other) &&
+            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
+              typeof othCtor == 'function' && othCtor instanceof othCtor)) {
+          result = false;
+        }
       }
+      stack['delete'](object);
+      stack['delete'](other);
       return result;
     }
 
     /**
-     * The base implementation of `_.some` without support for iteratee shorthands.
+     * A specialized version of `baseRest` which flattens the rest array.
      *
      * @private
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} predicate The function invoked per iteration.
-     * @returns {boolean} Returns `true` if any element passes the predicate check,
-     *  else `false`.
+     * @param {Function} func The function to apply a rest parameter to.
+     * @returns {Function} Returns the new function.
      */
-    function baseSome(collection, predicate) {
-      var result;
-
-      baseEach(collection, function(value, index, collection) {
-        result = predicate(value, index, collection);
-        return !result;
-      });
-      return !!result;
+    function flatRest(func) {
+      return setToString(overRest(func, undefined$1, flatten), func + '');
     }
 
     /**
-     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which
-     * performs a binary search of `array` to determine the index at which `value`
-     * should be inserted into `array` in order to maintain its sort order.
+     * Creates an array of own enumerable property names and symbols of `object`.
      *
      * @private
-     * @param {Array} array The sorted array to inspect.
-     * @param {*} value The value to evaluate.
-     * @param {boolean} [retHighest] Specify returning the highest qualified index.
-     * @returns {number} Returns the index at which `value` should be inserted
-     *  into `array`.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names and symbols.
      */
-    function baseSortedIndex(array, value, retHighest) {
-      var low = 0,
-          high = array == null ? low : array.length;
-
-      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {
-        while (low < high) {
-          var mid = (low + high) >>> 1,
-              computed = array[mid];
-
-          if (computed !== null && !isSymbol(computed) &&
-              (retHighest ? (computed <= value) : (computed < value))) {
-            low = mid + 1;
-          } else {
-            high = mid;
-          }
-        }
-        return high;
-      }
-      return baseSortedIndexBy(array, value, identity, retHighest);
+    function getAllKeys(object) {
+      return baseGetAllKeys(object, keys, getSymbols);
     }
 
     /**
-     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`
-     * which invokes `iteratee` for `value` and each element of `array` to compute
-     * their sort ranking. The iteratee is invoked with one argument; (value).
-     *
-     * @private
-     * @param {Array} array The sorted array to inspect.
-     * @param {*} value The value to evaluate.
-     * @param {Function} iteratee The iteratee invoked per element.
-     * @param {boolean} [retHighest] Specify returning the highest qualified index.
-     * @returns {number} Returns the index at which `value` should be inserted
-     *  into `array`.
-     */
-    function baseSortedIndexBy(array, value, iteratee, retHighest) {
-      var low = 0,
-          high = array == null ? 0 : array.length;
-      if (high === 0) {
-        return 0;
-      }
-
-      value = iteratee(value);
-      var valIsNaN = value !== value,
-          valIsNull = value === null,
-          valIsSymbol = isSymbol(value),
-          valIsUndefined = value === undefined$1;
-
-      while (low < high) {
-        var mid = nativeFloor((low + high) / 2),
-            computed = iteratee(array[mid]),
-            othIsDefined = computed !== undefined$1,
-            othIsNull = computed === null,
-            othIsReflexive = computed === computed,
-            othIsSymbol = isSymbol(computed);
-
-        if (valIsNaN) {
-          var setLow = retHighest || othIsReflexive;
-        } else if (valIsUndefined) {
-          setLow = othIsReflexive && (retHighest || othIsDefined);
-        } else if (valIsNull) {
-          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);
-        } else if (valIsSymbol) {
-          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);
-        } else if (othIsNull || othIsSymbol) {
-          setLow = false;
-        } else {
-          setLow = retHighest ? (computed <= value) : (computed < value);
-        }
-        if (setLow) {
-          low = mid + 1;
-        } else {
-          high = mid;
-        }
-      }
-      return nativeMin(high, MAX_ARRAY_INDEX);
+     * Creates an array of own and inherited enumerable property names and
+     * symbols of `object`.
+     *
+     * @private
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names and symbols.
+     */
+    function getAllKeysIn(object) {
+      return baseGetAllKeys(object, keysIn, getSymbolsIn);
     }
 
     /**
-     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without
-     * support for iteratee shorthands.
+     * Gets metadata for `func`.
      *
      * @private
-     * @param {Array} array The array to inspect.
-     * @param {Function} [iteratee] The iteratee invoked per element.
-     * @returns {Array} Returns the new duplicate free array.
+     * @param {Function} func The function to query.
+     * @returns {*} Returns the metadata for `func`.
      */
-    function baseSortedUniq(array, iteratee) {
-      var index = -1,
-          length = array.length,
-          resIndex = 0,
-          result = [];
+    var getData = !metaMap ? noop : function(func) {
+      return metaMap.get(func);
+    };
 
-      while (++index < length) {
-        var value = array[index],
-            computed = iteratee ? iteratee(value) : value;
+    /**
+     * Gets the name of `func`.
+     *
+     * @private
+     * @param {Function} func The function to query.
+     * @returns {string} Returns the function name.
+     */
+    function getFuncName(func) {
+      var result = (func.name + ''),
+          array = realNames[result],
+          length = hasOwnProperty.call(realNames, result) ? array.length : 0;
 
-        if (!index || !eq(computed, seen)) {
-          var seen = computed;
-          result[resIndex++] = value === 0 ? 0 : value;
+      while (length--) {
+        var data = array[length],
+            otherFunc = data.func;
+        if (otherFunc == null || otherFunc == func) {
+          return data.name;
         }
       }
       return result;
     }
 
     /**
-     * The base implementation of `_.toNumber` which doesn't ensure correct
-     * conversions of binary, hexadecimal, or octal string values.
+     * Gets the argument placeholder value for `func`.
      *
      * @private
-     * @param {*} value The value to process.
-     * @returns {number} Returns the number.
+     * @param {Function} func The function to inspect.
+     * @returns {*} Returns the placeholder value.
      */
-    function baseToNumber(value) {
-      if (typeof value == 'number') {
-        return value;
-      }
-      if (isSymbol(value)) {
-        return NAN;
-      }
-      return +value;
+    function getHolder(func) {
+      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;
+      return object.placeholder;
     }
 
     /**
-     * The base implementation of `_.toString` which doesn't convert nullish
-     * values to empty strings.
+     * Gets the appropriate "iteratee" function. If `_.iteratee` is customized,
+     * this function returns the custom method, otherwise it returns `baseIteratee`.
+     * If arguments are provided, the chosen function is invoked with them and
+     * its result is returned.
      *
      * @private
-     * @param {*} value The value to process.
-     * @returns {string} Returns the string.
+     * @param {*} [value] The value to convert to an iteratee.
+     * @param {number} [arity] The arity of the created iteratee.
+     * @returns {Function} Returns the chosen function or its result.
      */
-    function baseToString(value) {
-      // Exit early for strings to avoid a performance hit in some environments.
-      if (typeof value == 'string') {
-        return value;
-      }
-      if (isArray(value)) {
-        // Recursively convert values (susceptible to call stack limits).
-        return arrayMap(value, baseToString) + '';
-      }
-      if (isSymbol(value)) {
-        return symbolToString ? symbolToString.call(value) : '';
-      }
-      var result = (value + '');
-      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
+    function getIteratee() {
+      var result = lodash.iteratee || iteratee;
+      result = result === iteratee ? baseIteratee : result;
+      return arguments.length ? result(arguments[0], arguments[1]) : result;
     }
 
     /**
-     * The base implementation of `_.uniqBy` without support for iteratee shorthands.
+     * Gets the data for `map`.
      *
      * @private
-     * @param {Array} array The array to inspect.
-     * @param {Function} [iteratee] The iteratee invoked per element.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns the new duplicate free array.
+     * @param {Object} map The map to query.
+     * @param {string} key The reference key.
+     * @returns {*} Returns the map data.
      */
-    function baseUniq(array, iteratee, comparator) {
-      var index = -1,
-          includes = arrayIncludes,
-          length = array.length,
-          isCommon = true,
-          result = [],
-          seen = result;
-
-      if (comparator) {
-        isCommon = false;
-        includes = arrayIncludesWith;
-      }
-      else if (length >= LARGE_ARRAY_SIZE) {
-        var set = iteratee ? null : createSet(array);
-        if (set) {
-          return setToArray(set);
-        }
-        isCommon = false;
-        includes = cacheHas;
-        seen = new SetCache;
-      }
-      else {
-        seen = iteratee ? [] : result;
-      }
-      outer:
-      while (++index < length) {
-        var value = array[index],
-            computed = iteratee ? iteratee(value) : value;
-
-        value = (comparator || value !== 0) ? value : 0;
-        if (isCommon && computed === computed) {
-          var seenIndex = seen.length;
-          while (seenIndex--) {
-            if (seen[seenIndex] === computed) {
-              continue outer;
-            }
-          }
-          if (iteratee) {
-            seen.push(computed);
-          }
-          result.push(value);
-        }
-        else if (!includes(seen, computed, comparator)) {
-          if (seen !== result) {
-            seen.push(computed);
-          }
-          result.push(value);
-        }
-      }
-      return result;
+    function getMapData(map, key) {
+      var data = map.__data__;
+      return isKeyable(key)
+        ? data[typeof key == 'string' ? 'string' : 'hash']
+        : data.map;
     }
 
     /**
-     * The base implementation of `_.unset`.
+     * Gets the property names, values, and compare flags of `object`.
      *
      * @private
-     * @param {Object} object The object to modify.
-     * @param {Array|string} path The property path to unset.
-     * @returns {boolean} Returns `true` if the property is deleted, else `false`.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the match data of `object`.
      */
-    function baseUnset(object, path) {
-      path = castPath(path, object);
-      object = parent(object, path);
-      return object == null || delete object[toKey(last(path))];
+    function getMatchData(object) {
+      var result = keys(object),
+          length = result.length;
+
+      while (length--) {
+        var key = result[length],
+            value = object[key];
+
+        result[length] = [key, value, isStrictComparable(value)];
+      }
+      return result;
     }
 
     /**
-     * The base implementation of `_.update`.
+     * Gets the native function at `key` of `object`.
      *
      * @private
-     * @param {Object} object The object to modify.
-     * @param {Array|string} path The path of the property to update.
-     * @param {Function} updater The function to produce the updated value.
-     * @param {Function} [customizer] The function to customize path creation.
-     * @returns {Object} Returns `object`.
+     * @param {Object} object The object to query.
+     * @param {string} key The key of the method to get.
+     * @returns {*} Returns the function if it's native, else `undefined`.
      */
-    function baseUpdate(object, path, updater, customizer) {
-      return baseSet(object, path, updater(baseGet(object, path)), customizer);
+    function getNative(object, key) {
+      var value = getValue(object, key);
+      return baseIsNative(value) ? value : undefined$1;
     }
 
     /**
-     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`
-     * without support for iteratee shorthands.
+     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.
      *
      * @private
-     * @param {Array} array The array to query.
-     * @param {Function} predicate The function invoked per iteration.
-     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Array} Returns the slice of `array`.
+     * @param {*} value The value to query.
+     * @returns {string} Returns the raw `toStringTag`.
      */
-    function baseWhile(array, predicate, isDrop, fromRight) {
-      var length = array.length,
-          index = fromRight ? length : -1;
+    function getRawTag(value) {
+      var isOwn = hasOwnProperty.call(value, symToStringTag),
+          tag = value[symToStringTag];
 
-      while ((fromRight ? index-- : ++index < length) &&
-        predicate(array[index], index, array)) {}
+      try {
+        value[symToStringTag] = undefined$1;
+        var unmasked = true;
+      } catch (e) {}
 
-      return isDrop
-        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))
-        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));
+      var result = nativeObjectToString.call(value);
+      if (unmasked) {
+        if (isOwn) {
+          value[symToStringTag] = tag;
+        } else {
+          delete value[symToStringTag];
+        }
+      }
+      return result;
     }
 
     /**
-     * The base implementation of `wrapperValue` which returns the result of
-     * performing a sequence of actions on the unwrapped `value`, where each
-     * successive action is supplied the return value of the previous.
+     * Creates an array of the own enumerable symbols of `object`.
      *
      * @private
-     * @param {*} value The unwrapped value.
-     * @param {Array} actions Actions to perform to resolve the unwrapped value.
-     * @returns {*} Returns the resolved value.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of symbols.
      */
-    function baseWrapperValue(value, actions) {
-      var result = value;
-      if (result instanceof LazyWrapper) {
-        result = result.value();
+    var getSymbols = !nativeGetSymbols ? stubArray : function(object) {
+      if (object == null) {
+        return [];
+      }
+      object = Object(object);
+      return arrayFilter(nativeGetSymbols(object), function(symbol) {
+        return propertyIsEnumerable.call(object, symbol);
+      });
+    };
+
+    /**
+     * Creates an array of the own and inherited enumerable symbols of `object`.
+     *
+     * @private
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of symbols.
+     */
+    var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {
+      var result = [];
+      while (object) {
+        arrayPush(result, getSymbols(object));
+        object = getPrototype(object);
       }
-      return arrayReduce(actions, function(result, action) {
-        return action.func.apply(action.thisArg, arrayPush([result], action.args));
-      }, result);
-    }
+      return result;
+    };
 
     /**
-     * The base implementation of methods like `_.xor`, without support for
-     * iteratee shorthands, that accepts an array of arrays to inspect.
+     * Gets the `toStringTag` of `value`.
      *
      * @private
-     * @param {Array} arrays The arrays to inspect.
-     * @param {Function} [iteratee] The iteratee invoked per element.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns the new array of values.
+     * @param {*} value The value to query.
+     * @returns {string} Returns the `toStringTag`.
      */
-    function baseXor(arrays, iteratee, comparator) {
-      var length = arrays.length;
-      if (length < 2) {
-        return length ? baseUniq(arrays[0]) : [];
-      }
-      var index = -1,
-          result = Array(length);
+    var getTag = baseGetTag;
 
-      while (++index < length) {
-        var array = arrays[index],
-            othIndex = -1;
+    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.
+    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||
+        (Map && getTag(new Map) != mapTag) ||
+        (Promise && getTag(Promise.resolve()) != promiseTag) ||
+        (Set && getTag(new Set) != setTag) ||
+        (WeakMap && getTag(new WeakMap) != weakMapTag)) {
+      getTag = function(value) {
+        var result = baseGetTag(value),
+            Ctor = result == objectTag ? value.constructor : undefined$1,
+            ctorString = Ctor ? toSource(Ctor) : '';
 
-        while (++othIndex < length) {
-          if (othIndex != index) {
-            result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);
+        if (ctorString) {
+          switch (ctorString) {
+            case dataViewCtorString: return dataViewTag;
+            case mapCtorString: return mapTag;
+            case promiseCtorString: return promiseTag;
+            case setCtorString: return setTag;
+            case weakMapCtorString: return weakMapTag;
           }
         }
-      }
-      return baseUniq(baseFlatten(result, 1), iteratee, comparator);
+        return result;
+      };
     }
 
     /**
-     * This base implementation of `_.zipObject` which assigns values using `assignFunc`.
+     * Gets the view, applying any `transforms` to the `start` and `end` positions.
      *
      * @private
-     * @param {Array} props The property identifiers.
-     * @param {Array} values The property values.
-     * @param {Function} assignFunc The function to assign values.
-     * @returns {Object} Returns the new object.
+     * @param {number} start The start of the view.
+     * @param {number} end The end of the view.
+     * @param {Array} transforms The transformations to apply to the view.
+     * @returns {Object} Returns an object containing the `start` and `end`
+     *  positions of the view.
      */
-    function baseZipObject(props, values, assignFunc) {
+    function getView(start, end, transforms) {
       var index = -1,
-          length = props.length,
-          valsLength = values.length,
-          result = {};
+          length = transforms.length;
 
       while (++index < length) {
-        var value = index < valsLength ? values[index] : undefined$1;
-        assignFunc(result, props[index], value);
+        var data = transforms[index],
+            size = data.size;
+
+        switch (data.type) {
+          case 'drop':      start += size; break;
+          case 'dropRight': end -= size; break;
+          case 'take':      end = nativeMin(end, start + size); break;
+          case 'takeRight': start = nativeMax(start, end - size); break;
+        }
       }
-      return result;
+      return { 'start': start, 'end': end };
     }
 
     /**
-     * Casts `value` to an empty array if it's not an array like object.
+     * Extracts wrapper details from the `source` body comment.
      *
      * @private
-     * @param {*} value The value to inspect.
-     * @returns {Array|Object} Returns the cast array-like object.
+     * @param {string} source The source to inspect.
+     * @returns {Array} Returns the wrapper details.
      */
-    function castArrayLikeObject(value) {
-      return isArrayLikeObject(value) ? value : [];
+    function getWrapDetails(source) {
+      var match = source.match(reWrapDetails);
+      return match ? match[1].split(reSplitDetails) : [];
     }
 
     /**
-     * Casts `value` to `identity` if it's not a function.
+     * Checks if `path` exists on `object`.
      *
      * @private
-     * @param {*} value The value to inspect.
-     * @returns {Function} Returns cast function.
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path to check.
+     * @param {Function} hasFunc The function to check properties.
+     * @returns {boolean} Returns `true` if `path` exists, else `false`.
      */
-    function castFunction(value) {
-      return typeof value == 'function' ? value : identity;
-    }
+    function hasPath(object, path, hasFunc) {
+      path = castPath(path, object);
 
-    /**
-     * Casts `value` to a path array if it's not one.
-     *
-     * @private
-     * @param {*} value The value to inspect.
-     * @param {Object} [object] The object to query keys on.
-     * @returns {Array} Returns the cast property path array.
-     */
-    function castPath(value, object) {
-      if (isArray(value)) {
-        return value;
+      var index = -1,
+          length = path.length,
+          result = false;
+
+      while (++index < length) {
+        var key = toKey(path[index]);
+        if (!(result = object != null && hasFunc(object, key))) {
+          break;
+        }
+        object = object[key];
       }
-      return isKey(value, object) ? [value] : stringToPath(toString(value));
+      if (result || ++index != length) {
+        return result;
+      }
+      length = object == null ? 0 : object.length;
+      return !!length && isLength(length) && isIndex(key, length) &&
+        (isArray(object) || isArguments(object));
     }
 
     /**
-     * A `baseRest` alias which can be replaced with `identity` by module
-     * replacement plugins.
+     * Initializes an array clone.
      *
      * @private
-     * @type {Function}
-     * @param {Function} func The function to apply a rest parameter to.
-     * @returns {Function} Returns the new function.
+     * @param {Array} array The array to clone.
+     * @returns {Array} Returns the initialized clone.
      */
-    var castRest = baseRest;
+    function initCloneArray(array) {
+      var length = array.length,
+          result = new array.constructor(length);
+
+      // Add properties assigned by `RegExp#exec`.
+      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {
+        result.index = array.index;
+        result.input = array.input;
+      }
+      return result;
+    }
 
     /**
-     * Casts `array` to a slice if it's needed.
+     * Initializes an object clone.
      *
      * @private
-     * @param {Array} array The array to inspect.
-     * @param {number} start The start position.
-     * @param {number} [end=array.length] The end position.
-     * @returns {Array} Returns the cast slice.
+     * @param {Object} object The object to clone.
+     * @returns {Object} Returns the initialized clone.
      */
-    function castSlice(array, start, end) {
-      var length = array.length;
-      end = end === undefined$1 ? length : end;
-      return (!start && end >= length) ? array : baseSlice(array, start, end);
+    function initCloneObject(object) {
+      return (typeof object.constructor == 'function' && !isPrototype(object))
+        ? baseCreate(getPrototype(object))
+        : {};
     }
 
     /**
-     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).
+     * Initializes an object clone based on its `toStringTag`.
+     *
+     * **Note:** This function only supports cloning values with tags of
+     * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.
      *
      * @private
-     * @param {number|Object} id The timer id or timeout object of the timer to clear.
+     * @param {Object} object The object to clone.
+     * @param {string} tag The `toStringTag` of the object to clone.
+     * @param {boolean} [isDeep] Specify a deep clone.
+     * @returns {Object} Returns the initialized clone.
      */
-    var clearTimeout = ctxClearTimeout || function(id) {
-      return root.clearTimeout(id);
-    };
+    function initCloneByTag(object, tag, isDeep) {
+      var Ctor = object.constructor;
+      switch (tag) {
+        case arrayBufferTag:
+          return cloneArrayBuffer(object);
+
+        case boolTag:
+        case dateTag:
+          return new Ctor(+object);
+
+        case dataViewTag:
+          return cloneDataView(object, isDeep);
+
+        case float32Tag: case float64Tag:
+        case int8Tag: case int16Tag: case int32Tag:
+        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:
+          return cloneTypedArray(object, isDeep);
+
+        case mapTag:
+          return new Ctor;
+
+        case numberTag:
+        case stringTag:
+          return new Ctor(object);
+
+        case regexpTag:
+          return cloneRegExp(object);
+
+        case setTag:
+          return new Ctor;
+
+        case symbolTag:
+          return cloneSymbol(object);
+      }
+    }
 
     /**
-     * Creates a clone of  `buffer`.
+     * Inserts wrapper `details` in a comment at the top of the `source` body.
      *
      * @private
-     * @param {Buffer} buffer The buffer to clone.
-     * @param {boolean} [isDeep] Specify a deep clone.
-     * @returns {Buffer} Returns the cloned buffer.
+     * @param {string} source The source to modify.
+     * @returns {Array} details The details to insert.
+     * @returns {string} Returns the modified source.
      */
-    function cloneBuffer(buffer, isDeep) {
-      if (isDeep) {
-        return buffer.slice();
+    function insertWrapDetails(source, details) {
+      var length = details.length;
+      if (!length) {
+        return source;
       }
-      var length = buffer.length,
-          result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);
-
-      buffer.copy(result);
-      return result;
+      var lastIndex = length - 1;
+      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];
+      details = details.join(length > 2 ? ', ' : ' ');
+      return source.replace(reWrapComment, '{\n/* [wrapped with ' + details + '] */\n');
     }
 
     /**
-     * Creates a clone of `arrayBuffer`.
+     * Checks if `value` is a flattenable `arguments` object or array.
      *
      * @private
-     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.
-     * @returns {ArrayBuffer} Returns the cloned array buffer.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
      */
-    function cloneArrayBuffer(arrayBuffer) {
-      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);
-      new Uint8Array(result).set(new Uint8Array(arrayBuffer));
-      return result;
+    function isFlattenable(value) {
+      return isArray(value) || isArguments(value) ||
+        !!(spreadableSymbol && value && value[spreadableSymbol]);
     }
 
     /**
-     * Creates a clone of `dataView`.
+     * Checks if `value` is a valid array-like index.
      *
      * @private
-     * @param {Object} dataView The data view to clone.
-     * @param {boolean} [isDeep] Specify a deep clone.
-     * @returns {Object} Returns the cloned data view.
+     * @param {*} value The value to check.
+     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
+     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
      */
-    function cloneDataView(dataView, isDeep) {
-      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;
-      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);
+    function isIndex(value, length) {
+      var type = typeof value;
+      length = length == null ? MAX_SAFE_INTEGER : length;
+
+      return !!length &&
+        (type == 'number' ||
+          (type != 'symbol' && reIsUint.test(value))) &&
+            (value > -1 && value % 1 == 0 && value < length);
     }
 
     /**
-     * Creates a clone of `regexp`.
+     * Checks if the given arguments are from an iteratee call.
      *
      * @private
-     * @param {Object} regexp The regexp to clone.
-     * @returns {Object} Returns the cloned regexp.
+     * @param {*} value The potential iteratee value argument.
+     * @param {*} index The potential iteratee index or key argument.
+     * @param {*} object The potential iteratee object argument.
+     * @returns {boolean} Returns `true` if the arguments are from an iteratee call,
+     *  else `false`.
      */
-    function cloneRegExp(regexp) {
-      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));
-      result.lastIndex = regexp.lastIndex;
-      return result;
+    function isIterateeCall(value, index, object) {
+      if (!isObject(object)) {
+        return false;
+      }
+      var type = typeof index;
+      if (type == 'number'
+            ? (isArrayLike(object) && isIndex(index, object.length))
+            : (type == 'string' && index in object)
+          ) {
+        return eq(object[index], value);
+      }
+      return false;
     }
 
     /**
-     * Creates a clone of the `symbol` object.
+     * Checks if `value` is a property name and not a property path.
      *
      * @private
-     * @param {Object} symbol The symbol object to clone.
-     * @returns {Object} Returns the cloned symbol object.
+     * @param {*} value The value to check.
+     * @param {Object} [object] The object to query keys on.
+     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.
      */
-    function cloneSymbol(symbol) {
-      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};
+    function isKey(value, object) {
+      if (isArray(value)) {
+        return false;
+      }
+      var type = typeof value;
+      if (type == 'number' || type == 'symbol' || type == 'boolean' ||
+          value == null || isSymbol(value)) {
+        return true;
+      }
+      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
+        (object != null && value in Object(object));
     }
 
     /**
-     * Creates a clone of `typedArray`.
+     * Checks if `value` is suitable for use as unique object key.
      *
      * @private
-     * @param {Object} typedArray The typed array to clone.
-     * @param {boolean} [isDeep] Specify a deep clone.
-     * @returns {Object} Returns the cloned typed array.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
      */
-    function cloneTypedArray(typedArray, isDeep) {
-      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;
-      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);
+    function isKeyable(value) {
+      var type = typeof value;
+      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
+        ? (value !== '__proto__')
+        : (value === null);
     }
 
     /**
-     * Compares values to sort them in ascending order.
+     * Checks if `func` has a lazy counterpart.
      *
      * @private
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @returns {number} Returns the sort order indicator for `value`.
+     * @param {Function} func The function to check.
+     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,
+     *  else `false`.
      */
-    function compareAscending(value, other) {
-      if (value !== other) {
-        var valIsDefined = value !== undefined$1,
-            valIsNull = value === null,
-            valIsReflexive = value === value,
-            valIsSymbol = isSymbol(value);
-
-        var othIsDefined = other !== undefined$1,
-            othIsNull = other === null,
-            othIsReflexive = other === other,
-            othIsSymbol = isSymbol(other);
+    function isLaziable(func) {
+      var funcName = getFuncName(func),
+          other = lodash[funcName];
 
-        if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||
-            (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||
-            (valIsNull && othIsDefined && othIsReflexive) ||
-            (!valIsDefined && othIsReflexive) ||
-            !valIsReflexive) {
-          return 1;
-        }
-        if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||
-            (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||
-            (othIsNull && valIsDefined && valIsReflexive) ||
-            (!othIsDefined && valIsReflexive) ||
-            !othIsReflexive) {
-          return -1;
-        }
+      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {
+        return false;
       }
-      return 0;
+      if (func === other) {
+        return true;
+      }
+      var data = getData(other);
+      return !!data && func === data[0];
     }
 
     /**
-     * Used by `_.orderBy` to compare multiple properties of a value to another
-     * and stable sort them.
-     *
-     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,
-     * specify an order of "desc" for descending or "asc" for ascending sort order
-     * of corresponding values.
+     * Checks if `func` has its source masked.
      *
      * @private
-     * @param {Object} object The object to compare.
-     * @param {Object} other The other object to compare.
-     * @param {boolean[]|string[]} orders The order to sort by for each property.
-     * @returns {number} Returns the sort order indicator for `object`.
+     * @param {Function} func The function to check.
+     * @returns {boolean} Returns `true` if `func` is masked, else `false`.
      */
-    function compareMultiple(object, other, orders) {
-      var index = -1,
-          objCriteria = object.criteria,
-          othCriteria = other.criteria,
-          length = objCriteria.length,
-          ordersLength = orders.length;
-
-      while (++index < length) {
-        var result = compareAscending(objCriteria[index], othCriteria[index]);
-        if (result) {
-          if (index >= ordersLength) {
-            return result;
-          }
-          var order = orders[index];
-          return result * (order == 'desc' ? -1 : 1);
-        }
-      }
-      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications
-      // that causes it, under certain circumstances, to provide the same value for
-      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247
-      // for more details.
-      //
-      // This also ensures a stable sort in V8 and other engines.
-      // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.
-      return object.index - other.index;
+    function isMasked(func) {
+      return !!maskSrcKey && (maskSrcKey in func);
     }
 
     /**
-     * Creates an array that is the composition of partially applied arguments,
-     * placeholders, and provided arguments into a single array of arguments.
+     * Checks if `func` is capable of being masked.
      *
      * @private
-     * @param {Array} args The provided arguments.
-     * @param {Array} partials The arguments to prepend to those provided.
-     * @param {Array} holders The `partials` placeholder indexes.
-     * @params {boolean} [isCurried] Specify composing for a curried function.
-     * @returns {Array} Returns the new array of composed arguments.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.
      */
-    function composeArgs(args, partials, holders, isCurried) {
-      var argsIndex = -1,
-          argsLength = args.length,
-          holdersLength = holders.length,
-          leftIndex = -1,
-          leftLength = partials.length,
-          rangeLength = nativeMax(argsLength - holdersLength, 0),
-          result = Array(leftLength + rangeLength),
-          isUncurried = !isCurried;
-
-      while (++leftIndex < leftLength) {
-        result[leftIndex] = partials[leftIndex];
-      }
-      while (++argsIndex < holdersLength) {
-        if (isUncurried || argsIndex < argsLength) {
-          result[holders[argsIndex]] = args[argsIndex];
-        }
-      }
-      while (rangeLength--) {
-        result[leftIndex++] = args[argsIndex++];
-      }
-      return result;
-    }
+    var isMaskable = coreJsData ? isFunction : stubFalse;
 
     /**
-     * This function is like `composeArgs` except that the arguments composition
-     * is tailored for `_.partialRight`.
+     * Checks if `value` is likely a prototype object.
      *
      * @private
-     * @param {Array} args The provided arguments.
-     * @param {Array} partials The arguments to append to those provided.
-     * @param {Array} holders The `partials` placeholder indexes.
-     * @params {boolean} [isCurried] Specify composing for a curried function.
-     * @returns {Array} Returns the new array of composed arguments.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
      */
-    function composeArgsRight(args, partials, holders, isCurried) {
-      var argsIndex = -1,
-          argsLength = args.length,
-          holdersIndex = -1,
-          holdersLength = holders.length,
-          rightIndex = -1,
-          rightLength = partials.length,
-          rangeLength = nativeMax(argsLength - holdersLength, 0),
-          result = Array(rangeLength + rightLength),
-          isUncurried = !isCurried;
+    function isPrototype(value) {
+      var Ctor = value && value.constructor,
+          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;
 
-      while (++argsIndex < rangeLength) {
-        result[argsIndex] = args[argsIndex];
-      }
-      var offset = argsIndex;
-      while (++rightIndex < rightLength) {
-        result[offset + rightIndex] = partials[rightIndex];
-      }
-      while (++holdersIndex < holdersLength) {
-        if (isUncurried || argsIndex < argsLength) {
-          result[offset + holders[holdersIndex]] = args[argsIndex++];
-        }
-      }
-      return result;
+      return value === proto;
     }
 
     /**
-     * Copies the values of `source` to `array`.
+     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
      *
      * @private
-     * @param {Array} source The array to copy values from.
-     * @param {Array} [array=[]] The array to copy values to.
-     * @returns {Array} Returns `array`.
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` if suitable for strict
+     *  equality comparisons, else `false`.
      */
-    function copyArray(source, array) {
-      var index = -1,
-          length = source.length;
-
-      array || (array = Array(length));
-      while (++index < length) {
-        array[index] = source[index];
-      }
-      return array;
+    function isStrictComparable(value) {
+      return value === value && !isObject(value);
     }
 
     /**
-     * Copies properties of `source` to `object`.
+     * A specialized version of `matchesProperty` for source values suitable
+     * for strict equality comparisons, i.e. `===`.
      *
      * @private
-     * @param {Object} source The object to copy properties from.
-     * @param {Array} props The property identifiers to copy.
-     * @param {Object} [object={}] The object to copy properties to.
-     * @param {Function} [customizer] The function to customize copied values.
-     * @returns {Object} Returns `object`.
+     * @param {string} key The key of the property to get.
+     * @param {*} srcValue The value to match.
+     * @returns {Function} Returns the new spec function.
      */
-    function copyObject(source, props, object, customizer) {
-      var isNew = !object;
-      object || (object = {});
-
-      var index = -1,
-          length = props.length;
-
-      while (++index < length) {
-        var key = props[index];
-
-        var newValue = customizer
-          ? customizer(object[key], source[key], key, object, source)
-          : undefined$1;
-
-        if (newValue === undefined$1) {
-          newValue = source[key];
-        }
-        if (isNew) {
-          baseAssignValue(object, key, newValue);
-        } else {
-          assignValue(object, key, newValue);
+    function matchesStrictComparable(key, srcValue) {
+      return function(object) {
+        if (object == null) {
+          return false;
         }
-      }
-      return object;
+        return object[key] === srcValue &&
+          (srcValue !== undefined$1 || (key in Object(object)));
+      };
     }
 
     /**
-     * Copies own symbols of `source` to `object`.
+     * A specialized version of `_.memoize` which clears the memoized function's
+     * cache when it exceeds `MAX_MEMOIZE_SIZE`.
      *
      * @private
-     * @param {Object} source The object to copy symbols from.
-     * @param {Object} [object={}] The object to copy symbols to.
-     * @returns {Object} Returns `object`.
+     * @param {Function} func The function to have its output memoized.
+     * @returns {Function} Returns the new memoized function.
      */
-    function copySymbols(source, object) {
-      return copyObject(source, getSymbols(source), object);
+    function memoizeCapped(func) {
+      var result = memoize(func, function(key) {
+        if (cache.size === MAX_MEMOIZE_SIZE) {
+          cache.clear();
+        }
+        return key;
+      });
+
+      var cache = result.cache;
+      return result;
     }
 
     /**
-     * Copies own and inherited symbols of `source` to `object`.
+     * Merges the function metadata of `source` into `data`.
+     *
+     * Merging metadata reduces the number of wrappers used to invoke a function.
+     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`
+     * may be applied regardless of execution order. Methods like `_.ary` and
+     * `_.rearg` modify function arguments, making the order in which they are
+     * executed important, preventing the merging of metadata. However, we make
+     * an exception for a safe combined case where curried functions have `_.ary`
+     * and or `_.rearg` applied.
      *
      * @private
-     * @param {Object} source The object to copy symbols from.
-     * @param {Object} [object={}] The object to copy symbols to.
-     * @returns {Object} Returns `object`.
+     * @param {Array} data The destination metadata.
+     * @param {Array} source The source metadata.
+     * @returns {Array} Returns `data`.
      */
-    function copySymbolsIn(source, object) {
-      return copyObject(source, getSymbolsIn(source), object);
+    function mergeData(data, source) {
+      var bitmask = data[1],
+          srcBitmask = source[1],
+          newBitmask = bitmask | srcBitmask,
+          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);
+
+      var isCombo =
+        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||
+        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||
+        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));
+
+      // Exit early if metadata can't be merged.
+      if (!(isCommon || isCombo)) {
+        return data;
+      }
+      // Use source `thisArg` if available.
+      if (srcBitmask & WRAP_BIND_FLAG) {
+        data[2] = source[2];
+        // Set when currying a bound function.
+        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;
+      }
+      // Compose partial arguments.
+      var value = source[3];
+      if (value) {
+        var partials = data[3];
+        data[3] = partials ? composeArgs(partials, value, source[4]) : value;
+        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];
+      }
+      // Compose partial right arguments.
+      value = source[5];
+      if (value) {
+        partials = data[5];
+        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;
+        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];
+      }
+      // Use source `argPos` if available.
+      value = source[7];
+      if (value) {
+        data[7] = value;
+      }
+      // Use source `ary` if it's smaller.
+      if (srcBitmask & WRAP_ARY_FLAG) {
+        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);
+      }
+      // Use source `arity` if one is not provided.
+      if (data[9] == null) {
+        data[9] = source[9];
+      }
+      // Use source `func` and merge bitmasks.
+      data[0] = source[0];
+      data[1] = newBitmask;
+
+      return data;
     }
 
     /**
-     * Creates a function like `_.groupBy`.
+     * This function is like
+     * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
+     * except that it includes inherited enumerable properties.
      *
      * @private
-     * @param {Function} setter The function to set accumulator values.
-     * @param {Function} [initializer] The accumulator object initializer.
-     * @returns {Function} Returns the new aggregator function.
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names.
      */
-    function createAggregator(setter, initializer) {
-      return function(collection, iteratee) {
-        var func = isArray(collection) ? arrayAggregator : baseAggregator,
-            accumulator = initializer ? initializer() : {};
-
-        return func(collection, setter, getIteratee(iteratee, 2), accumulator);
-      };
+    function nativeKeysIn(object) {
+      var result = [];
+      if (object != null) {
+        for (var key in Object(object)) {
+          result.push(key);
+        }
+      }
+      return result;
     }
 
     /**
-     * Creates a function like `_.assign`.
+     * Converts `value` to a string using `Object.prototype.toString`.
      *
      * @private
-     * @param {Function} assigner The function to assign values.
-     * @returns {Function} Returns the new assigner function.
+     * @param {*} value The value to convert.
+     * @returns {string} Returns the converted string.
      */
-    function createAssigner(assigner) {
-      return baseRest(function(object, sources) {
-        var index = -1,
-            length = sources.length,
-            customizer = length > 1 ? sources[length - 1] : undefined$1,
-            guard = length > 2 ? sources[2] : undefined$1;
-
-        customizer = (assigner.length > 3 && typeof customizer == 'function')
-          ? (length--, customizer)
-          : undefined$1;
-
-        if (guard && isIterateeCall(sources[0], sources[1], guard)) {
-          customizer = length < 3 ? undefined$1 : customizer;
-          length = 1;
-        }
-        object = Object(object);
-        while (++index < length) {
-          var source = sources[index];
-          if (source) {
-            assigner(object, source, index, customizer);
-          }
-        }
-        return object;
-      });
+    function objectToString(value) {
+      return nativeObjectToString.call(value);
     }
 
     /**
-     * Creates a `baseEach` or `baseEachRight` function.
+     * A specialized version of `baseRest` which transforms the rest array.
      *
      * @private
-     * @param {Function} eachFunc The function to iterate over a collection.
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Function} Returns the new base function.
+     * @param {Function} func The function to apply a rest parameter to.
+     * @param {number} [start=func.length-1] The start position of the rest parameter.
+     * @param {Function} transform The rest array transform.
+     * @returns {Function} Returns the new function.
      */
-    function createBaseEach(eachFunc, fromRight) {
-      return function(collection, iteratee) {
-        if (collection == null) {
-          return collection;
-        }
-        if (!isArrayLike(collection)) {
-          return eachFunc(collection, iteratee);
-        }
-        var length = collection.length,
-            index = fromRight ? length : -1,
-            iterable = Object(collection);
+    function overRest(func, start, transform) {
+      start = nativeMax(start === undefined$1 ? (func.length - 1) : start, 0);
+      return function() {
+        var args = arguments,
+            index = -1,
+            length = nativeMax(args.length - start, 0),
+            array = Array(length);
 
-        while ((fromRight ? index-- : ++index < length)) {
-          if (iteratee(iterable[index], index, iterable) === false) {
-            break;
-          }
+        while (++index < length) {
+          array[index] = args[start + index];
         }
-        return collection;
+        index = -1;
+        var otherArgs = Array(start + 1);
+        while (++index < start) {
+          otherArgs[index] = args[index];
+        }
+        otherArgs[start] = transform(array);
+        return apply(func, this, otherArgs);
       };
     }
 
     /**
-     * Creates a base function for methods like `_.forIn` and `_.forOwn`.
+     * Gets the parent value at `path` of `object`.
      *
      * @private
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Function} Returns the new base function.
+     * @param {Object} object The object to query.
+     * @param {Array} path The path to get the parent value of.
+     * @returns {*} Returns the parent value.
      */
-    function createBaseFor(fromRight) {
-      return function(object, iteratee, keysFunc) {
-        var index = -1,
-            iterable = Object(object),
-            props = keysFunc(object),
-            length = props.length;
-
-        while (length--) {
-          var key = props[fromRight ? length : ++index];
-          if (iteratee(iterable[key], key, iterable) === false) {
-            break;
-          }
-        }
-        return object;
-      };
+    function parent(object, path) {
+      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));
     }
 
     /**
-     * Creates a function that wraps `func` to invoke it with the optional `this`
-     * binding of `thisArg`.
+     * Reorder `array` according to the specified indexes where the element at
+     * the first index is assigned as the first element, the element at
+     * the second index is assigned as the second element, and so on.
      *
      * @private
-     * @param {Function} func The function to wrap.
-     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
-     * @param {*} [thisArg] The `this` binding of `func`.
-     * @returns {Function} Returns the new wrapped function.
+     * @param {Array} array The array to reorder.
+     * @param {Array} indexes The arranged array indexes.
+     * @returns {Array} Returns `array`.
      */
-    function createBind(func, bitmask, thisArg) {
-      var isBind = bitmask & WRAP_BIND_FLAG,
-          Ctor = createCtor(func);
+    function reorder(array, indexes) {
+      var arrLength = array.length,
+          length = nativeMin(indexes.length, arrLength),
+          oldArray = copyArray(array);
 
-      function wrapper() {
-        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
-        return fn.apply(isBind ? thisArg : this, arguments);
+      while (length--) {
+        var index = indexes[length];
+        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined$1;
       }
-      return wrapper;
+      return array;
     }
 
     /**
-     * Creates a function like `_.lowerFirst`.
+     * Gets the value at `key`, unless `key` is "__proto__" or "constructor".
      *
      * @private
-     * @param {string} methodName The name of the `String` case method to use.
-     * @returns {Function} Returns the new case function.
+     * @param {Object} object The object to query.
+     * @param {string} key The key of the property to get.
+     * @returns {*} Returns the property value.
      */
-    function createCaseFirst(methodName) {
-      return function(string) {
-        string = toString(string);
-
-        var strSymbols = hasUnicode(string)
-          ? stringToArray(string)
-          : undefined$1;
-
-        var chr = strSymbols
-          ? strSymbols[0]
-          : string.charAt(0);
+    function safeGet(object, key) {
+      if (key === 'constructor' && typeof object[key] === 'function') {
+        return;
+      }
 
-        var trailing = strSymbols
-          ? castSlice(strSymbols, 1).join('')
-          : string.slice(1);
+      if (key == '__proto__') {
+        return;
+      }
 
-        return chr[methodName]() + trailing;
-      };
+      return object[key];
     }
 
     /**
-     * Creates a function like `_.camelCase`.
+     * Sets metadata for `func`.
+     *
+     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short
+     * period of time, it will trip its breaker and transition to an identity
+     * function to avoid garbage collection pauses in V8. See
+     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)
+     * for more details.
      *
      * @private
-     * @param {Function} callback The function to combine each word.
-     * @returns {Function} Returns the new compounder function.
+     * @param {Function} func The function to associate metadata with.
+     * @param {*} data The metadata.
+     * @returns {Function} Returns `func`.
      */
-    function createCompounder(callback) {
-      return function(string) {
-        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');
-      };
-    }
+    var setData = shortOut(baseSetData);
 
     /**
-     * Creates a function that produces an instance of `Ctor` regardless of
-     * whether it was invoked as part of a `new` expression or by `call` or `apply`.
+     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).
      *
      * @private
-     * @param {Function} Ctor The constructor to wrap.
-     * @returns {Function} Returns the new wrapped function.
+     * @param {Function} func The function to delay.
+     * @param {number} wait The number of milliseconds to delay invocation.
+     * @returns {number|Object} Returns the timer id or timeout object.
      */
-    function createCtor(Ctor) {
-      return function() {
-        // Use a `switch` statement to work with class constructors. See
-        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist
-        // for more details.
-        var args = arguments;
-        switch (args.length) {
-          case 0: return new Ctor;
-          case 1: return new Ctor(args[0]);
-          case 2: return new Ctor(args[0], args[1]);
-          case 3: return new Ctor(args[0], args[1], args[2]);
-          case 4: return new Ctor(args[0], args[1], args[2], args[3]);
-          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);
-          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);
-          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);
-        }
-        var thisBinding = baseCreate(Ctor.prototype),
-            result = Ctor.apply(thisBinding, args);
+    var setTimeout = ctxSetTimeout || function(func, wait) {
+      return root.setTimeout(func, wait);
+    };
 
-        // Mimic the constructor's `return` behavior.
-        // See https://es5.github.io/#x13.2.2 for more details.
-        return isObject(result) ? result : thisBinding;
-      };
-    }
+    /**
+     * Sets the `toString` method of `func` to return `string`.
+     *
+     * @private
+     * @param {Function} func The function to modify.
+     * @param {Function} string The `toString` result.
+     * @returns {Function} Returns `func`.
+     */
+    var setToString = shortOut(baseSetToString);
 
     /**
-     * Creates a function that wraps `func` to enable currying.
+     * Sets the `toString` method of `wrapper` to mimic the source of `reference`
+     * with wrapper details in a comment at the top of the source body.
      *
      * @private
-     * @param {Function} func The function to wrap.
+     * @param {Function} wrapper The function to modify.
+     * @param {Function} reference The reference function.
      * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
-     * @param {number} arity The arity of `func`.
-     * @returns {Function} Returns the new wrapped function.
+     * @returns {Function} Returns `wrapper`.
      */
-    function createCurry(func, bitmask, arity) {
-      var Ctor = createCtor(func);
-
-      function wrapper() {
-        var length = arguments.length,
-            args = Array(length),
-            index = length,
-            placeholder = getHolder(wrapper);
-
-        while (index--) {
-          args[index] = arguments[index];
-        }
-        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)
-          ? []
-          : replaceHolders(args, placeholder);
-
-        length -= holders.length;
-        if (length < arity) {
-          return createRecurry(
-            func, bitmask, createHybrid, wrapper.placeholder, undefined$1,
-            args, holders, undefined$1, undefined$1, arity - length);
-        }
-        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
-        return apply(fn, this, args);
-      }
-      return wrapper;
+    function setWrapToString(wrapper, reference, bitmask) {
+      var source = (reference + '');
+      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));
     }
 
     /**
-     * Creates a `_.find` or `_.findLast` function.
+     * Creates a function that'll short out and invoke `identity` instead
+     * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`
+     * milliseconds.
      *
      * @private
-     * @param {Function} findIndexFunc The function to find the collection index.
-     * @returns {Function} Returns the new find function.
+     * @param {Function} func The function to restrict.
+     * @returns {Function} Returns the new shortable function.
      */
-    function createFind(findIndexFunc) {
-      return function(collection, predicate, fromIndex) {
-        var iterable = Object(collection);
-        if (!isArrayLike(collection)) {
-          var iteratee = getIteratee(predicate, 3);
-          collection = keys(collection);
-          predicate = function(key) { return iteratee(iterable[key], key, iterable); };
+    function shortOut(func) {
+      var count = 0,
+          lastCalled = 0;
+
+      return function() {
+        var stamp = nativeNow(),
+            remaining = HOT_SPAN - (stamp - lastCalled);
+
+        lastCalled = stamp;
+        if (remaining > 0) {
+          if (++count >= HOT_COUNT) {
+            return arguments[0];
+          }
+        } else {
+          count = 0;
         }
-        var index = findIndexFunc(collection, predicate, fromIndex);
-        return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined$1;
+        return func.apply(undefined$1, arguments);
       };
     }
 
     /**
-     * Creates a `_.flow` or `_.flowRight` function.
+     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.
      *
      * @private
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Function} Returns the new flow function.
+     * @param {Array} array The array to shuffle.
+     * @param {number} [size=array.length] The size of `array`.
+     * @returns {Array} Returns `array`.
      */
-    function createFlow(fromRight) {
-      return flatRest(function(funcs) {
-        var length = funcs.length,
-            index = length,
-            prereq = LodashWrapper.prototype.thru;
-
-        if (fromRight) {
-          funcs.reverse();
-        }
-        while (index--) {
-          var func = funcs[index];
-          if (typeof func != 'function') {
-            throw new TypeError(FUNC_ERROR_TEXT);
-          }
-          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {
-            var wrapper = new LodashWrapper([], true);
-          }
-        }
-        index = wrapper ? index : length;
-        while (++index < length) {
-          func = funcs[index];
-
-          var funcName = getFuncName(func),
-              data = funcName == 'wrapper' ? getData(func) : undefined$1;
-
-          if (data && isLaziable(data[0]) &&
-                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&
-                !data[4].length && data[9] == 1
-              ) {
-            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);
-          } else {
-            wrapper = (func.length == 1 && isLaziable(func))
-              ? wrapper[funcName]()
-              : wrapper.thru(func);
-          }
-        }
-        return function() {
-          var args = arguments,
-              value = args[0];
+    function shuffleSelf(array, size) {
+      var index = -1,
+          length = array.length,
+          lastIndex = length - 1;
 
-          if (wrapper && args.length == 1 && isArray(value)) {
-            return wrapper.plant(value).value();
-          }
-          var index = 0,
-              result = length ? funcs[index].apply(this, args) : value;
+      size = size === undefined$1 ? length : size;
+      while (++index < size) {
+        var rand = baseRandom(index, lastIndex),
+            value = array[rand];
 
-          while (++index < length) {
-            result = funcs[index].call(this, result);
-          }
-          return result;
-        };
-      });
+        array[rand] = array[index];
+        array[index] = value;
+      }
+      array.length = size;
+      return array;
     }
 
     /**
-     * Creates a function that wraps `func` to invoke it with optional `this`
-     * binding of `thisArg`, partial application, and currying.
+     * Converts `string` to a property path array.
      *
      * @private
-     * @param {Function|string} func The function or method name to wrap.
-     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
-     * @param {*} [thisArg] The `this` binding of `func`.
-     * @param {Array} [partials] The arguments to prepend to those provided to
-     *  the new function.
-     * @param {Array} [holders] The `partials` placeholder indexes.
-     * @param {Array} [partialsRight] The arguments to append to those provided
-     *  to the new function.
-     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.
-     * @param {Array} [argPos] The argument positions of the new function.
-     * @param {number} [ary] The arity cap of `func`.
-     * @param {number} [arity] The arity of `func`.
-     * @returns {Function} Returns the new wrapped function.
+     * @param {string} string The string to convert.
+     * @returns {Array} Returns the property path array.
      */
-    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {
-      var isAry = bitmask & WRAP_ARY_FLAG,
-          isBind = bitmask & WRAP_BIND_FLAG,
-          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,
-          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),
-          isFlip = bitmask & WRAP_FLIP_FLAG,
-          Ctor = isBindKey ? undefined$1 : createCtor(func);
-
-      function wrapper() {
-        var length = arguments.length,
-            args = Array(length),
-            index = length;
-
-        while (index--) {
-          args[index] = arguments[index];
-        }
-        if (isCurried) {
-          var placeholder = getHolder(wrapper),
-              holdersCount = countHolders(args, placeholder);
-        }
-        if (partials) {
-          args = composeArgs(args, partials, holders, isCurried);
-        }
-        if (partialsRight) {
-          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);
-        }
-        length -= holdersCount;
-        if (isCurried && length < arity) {
-          var newHolders = replaceHolders(args, placeholder);
-          return createRecurry(
-            func, bitmask, createHybrid, wrapper.placeholder, thisArg,
-            args, newHolders, argPos, ary, arity - length
-          );
-        }
-        var thisBinding = isBind ? thisArg : this,
-            fn = isBindKey ? thisBinding[func] : func;
+    var stringToPath = memoizeCapped(function(string) {
+      var result = [];
+      if (string.charCodeAt(0) === 46 /* . */) {
+        result.push('');
+      }
+      string.replace(rePropName, function(match, number, quote, subString) {
+        result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));
+      });
+      return result;
+    });
 
-        length = args.length;
-        if (argPos) {
-          args = reorder(args, argPos);
-        } else if (isFlip && length > 1) {
-          args.reverse();
-        }
-        if (isAry && ary < length) {
-          args.length = ary;
-        }
-        if (this && this !== root && this instanceof wrapper) {
-          fn = Ctor || createCtor(fn);
-        }
-        return fn.apply(thisBinding, args);
+    /**
+     * Converts `value` to a string key if it's not a string or symbol.
+     *
+     * @private
+     * @param {*} value The value to inspect.
+     * @returns {string|symbol} Returns the key.
+     */
+    function toKey(value) {
+      if (typeof value == 'string' || isSymbol(value)) {
+        return value;
       }
-      return wrapper;
+      var result = (value + '');
+      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
     }
 
     /**
-     * Creates a function like `_.invertBy`.
+     * Converts `func` to its source code.
      *
      * @private
-     * @param {Function} setter The function to set accumulator values.
-     * @param {Function} toIteratee The function to resolve iteratees.
-     * @returns {Function} Returns the new inverter function.
+     * @param {Function} func The function to convert.
+     * @returns {string} Returns the source code.
      */
-    function createInverter(setter, toIteratee) {
-      return function(object, iteratee) {
-        return baseInverter(object, setter, toIteratee(iteratee), {});
-      };
+    function toSource(func) {
+      if (func != null) {
+        try {
+          return funcToString.call(func);
+        } catch (e) {}
+        try {
+          return (func + '');
+        } catch (e) {}
+      }
+      return '';
     }
 
     /**
-     * Creates a function that performs a mathematical operation on two values.
+     * Updates wrapper `details` based on `bitmask` flags.
      *
      * @private
-     * @param {Function} operator The function to perform the operation.
-     * @param {number} [defaultValue] The value used for `undefined` arguments.
-     * @returns {Function} Returns the new mathematical operation function.
+     * @returns {Array} details The details to modify.
+     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
+     * @returns {Array} Returns `details`.
      */
-    function createMathOperation(operator, defaultValue) {
-      return function(value, other) {
-        var result;
-        if (value === undefined$1 && other === undefined$1) {
-          return defaultValue;
-        }
-        if (value !== undefined$1) {
-          result = value;
-        }
-        if (other !== undefined$1) {
-          if (result === undefined$1) {
-            return other;
-          }
-          if (typeof value == 'string' || typeof other == 'string') {
-            value = baseToString(value);
-            other = baseToString(other);
-          } else {
-            value = baseToNumber(value);
-            other = baseToNumber(other);
-          }
-          result = operator(value, other);
+    function updateWrapDetails(details, bitmask) {
+      arrayEach(wrapFlags, function(pair) {
+        var value = '_.' + pair[0];
+        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {
+          details.push(value);
         }
-        return result;
-      };
+      });
+      return details.sort();
     }
 
     /**
-     * Creates a function like `_.over`.
+     * Creates a clone of `wrapper`.
      *
      * @private
-     * @param {Function} arrayFunc The function to iterate over iteratees.
-     * @returns {Function} Returns the new over function.
+     * @param {Object} wrapper The wrapper to clone.
+     * @returns {Object} Returns the cloned wrapper.
      */
-    function createOver(arrayFunc) {
-      return flatRest(function(iteratees) {
-        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));
-        return baseRest(function(args) {
-          var thisArg = this;
-          return arrayFunc(iteratees, function(iteratee) {
-            return apply(iteratee, thisArg, args);
-          });
-        });
-      });
+    function wrapperClone(wrapper) {
+      if (wrapper instanceof LazyWrapper) {
+        return wrapper.clone();
+      }
+      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);
+      result.__actions__ = copyArray(wrapper.__actions__);
+      result.__index__  = wrapper.__index__;
+      result.__values__ = wrapper.__values__;
+      return result;
     }
 
+    /*------------------------------------------------------------------------*/
+
     /**
-     * Creates the padding for `string` based on `length`. The `chars` string
-     * is truncated if the number of characters exceeds `length`.
+     * Creates an array of elements split into groups the length of `size`.
+     * If `array` can't be split evenly, the final chunk will be the remaining
+     * elements.
      *
-     * @private
-     * @param {number} length The padding length.
-     * @param {string} [chars=' '] The string used as padding.
-     * @returns {string} Returns the padding for `string`.
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to process.
+     * @param {number} [size=1] The length of each chunk
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the new array of chunks.
+     * @example
+     *
+     * _.chunk(['a', 'b', 'c', 'd'], 2);
+     * // => [['a', 'b'], ['c', 'd']]
+     *
+     * _.chunk(['a', 'b', 'c', 'd'], 3);
+     * // => [['a', 'b', 'c'], ['d']]
      */
-    function createPadding(length, chars) {
-      chars = chars === undefined$1 ? ' ' : baseToString(chars);
+    function chunk(array, size, guard) {
+      if ((guard ? isIterateeCall(array, size, guard) : size === undefined$1)) {
+        size = 1;
+      } else {
+        size = nativeMax(toInteger(size), 0);
+      }
+      var length = array == null ? 0 : array.length;
+      if (!length || size < 1) {
+        return [];
+      }
+      var index = 0,
+          resIndex = 0,
+          result = Array(nativeCeil(length / size));
 
-      var charsLength = chars.length;
-      if (charsLength < 2) {
-        return charsLength ? baseRepeat(chars, length) : chars;
+      while (index < length) {
+        result[resIndex++] = baseSlice(array, index, (index += size));
       }
-      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));
-      return hasUnicode(chars)
-        ? castSlice(stringToArray(result), 0, length).join('')
-        : result.slice(0, length);
+      return result;
+    }
+
+    /**
+     * Creates an array with all falsey values removed. The values `false`, `null`,
+     * `0`, `""`, `undefined`, and `NaN` are falsey.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to compact.
+     * @returns {Array} Returns the new array of filtered values.
+     * @example
+     *
+     * _.compact([0, 1, false, 2, '', 3]);
+     * // => [1, 2, 3]
+     */
+    function compact(array) {
+      var index = -1,
+          length = array == null ? 0 : array.length,
+          resIndex = 0,
+          result = [];
+
+      while (++index < length) {
+        var value = array[index];
+        if (value) {
+          result[resIndex++] = value;
+        }
+      }
+      return result;
     }
 
     /**
-     * Creates a function that wraps `func` to invoke it with the `this` binding
-     * of `thisArg` and `partials` prepended to the arguments it receives.
+     * Creates a new array concatenating `array` with any additional arrays
+     * and/or values.
      *
-     * @private
-     * @param {Function} func The function to wrap.
-     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
-     * @param {*} thisArg The `this` binding of `func`.
-     * @param {Array} partials The arguments to prepend to those provided to
-     *  the new function.
-     * @returns {Function} Returns the new wrapped function.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to concatenate.
+     * @param {...*} [values] The values to concatenate.
+     * @returns {Array} Returns the new concatenated array.
+     * @example
+     *
+     * var array = [1];
+     * var other = _.concat(array, 2, [3], [[4]]);
+     *
+     * console.log(other);
+     * // => [1, 2, 3, [4]]
+     *
+     * console.log(array);
+     * // => [1]
      */
-    function createPartial(func, bitmask, thisArg, partials) {
-      var isBind = bitmask & WRAP_BIND_FLAG,
-          Ctor = createCtor(func);
-
-      function wrapper() {
-        var argsIndex = -1,
-            argsLength = arguments.length,
-            leftIndex = -1,
-            leftLength = partials.length,
-            args = Array(leftLength + argsLength),
-            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;
+    function concat() {
+      var length = arguments.length;
+      if (!length) {
+        return [];
+      }
+      var args = Array(length - 1),
+          array = arguments[0],
+          index = length;
 
-        while (++leftIndex < leftLength) {
-          args[leftIndex] = partials[leftIndex];
-        }
-        while (argsLength--) {
-          args[leftIndex++] = arguments[++argsIndex];
-        }
-        return apply(fn, isBind ? thisArg : this, args);
+      while (index--) {
+        args[index - 1] = arguments[index];
       }
-      return wrapper;
+      return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));
     }
 
     /**
-     * Creates a `_.range` or `_.rangeRight` function.
+     * Creates an array of `array` values not included in the other given arrays
+     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons. The order and references of result values are
+     * determined by the first array.
      *
-     * @private
-     * @param {boolean} [fromRight] Specify iterating from right to left.
-     * @returns {Function} Returns the new range function.
+     * **Note:** Unlike `_.pullAll`, this method returns a new array.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {...Array} [values] The values to exclude.
+     * @returns {Array} Returns the new array of filtered values.
+     * @see _.without, _.xor
+     * @example
+     *
+     * _.difference([2, 1], [2, 3]);
+     * // => [1]
      */
-    function createRange(fromRight) {
-      return function(start, end, step) {
-        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {
-          end = step = undefined$1;
-        }
-        // Ensure the sign of `-0` is preserved.
-        start = toFinite(start);
-        if (end === undefined$1) {
-          end = start;
-          start = 0;
-        } else {
-          end = toFinite(end);
-        }
-        step = step === undefined$1 ? (start < end ? 1 : -1) : toFinite(step);
-        return baseRange(start, end, step, fromRight);
-      };
-    }
+    var difference = baseRest(function(array, values) {
+      return isArrayLikeObject(array)
+        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))
+        : [];
+    });
 
     /**
-     * Creates a function that performs a relational operation on two values.
+     * This method is like `_.difference` except that it accepts `iteratee` which
+     * is invoked for each element of `array` and `values` to generate the criterion
+     * by which they're compared. The order and references of result values are
+     * determined by the first array. The iteratee is invoked with one argument:
+     * (value).
      *
-     * @private
-     * @param {Function} operator The function to perform the operation.
-     * @returns {Function} Returns the new relational operation function.
+     * **Note:** Unlike `_.pullAllBy`, this method returns a new array.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {...Array} [values] The values to exclude.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     * @example
+     *
+     * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);
+     * // => [1.2]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');
+     * // => [{ 'x': 2 }]
      */
-    function createRelationalOperation(operator) {
-      return function(value, other) {
-        if (!(typeof value == 'string' && typeof other == 'string')) {
-          value = toNumber(value);
-          other = toNumber(other);
-        }
-        return operator(value, other);
-      };
-    }
+    var differenceBy = baseRest(function(array, values) {
+      var iteratee = last(values);
+      if (isArrayLikeObject(iteratee)) {
+        iteratee = undefined$1;
+      }
+      return isArrayLikeObject(array)
+        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))
+        : [];
+    });
 
     /**
-     * Creates a function that wraps `func` to continue currying.
+     * This method is like `_.difference` except that it accepts `comparator`
+     * which is invoked to compare elements of `array` to `values`. The order and
+     * references of result values are determined by the first array. The comparator
+     * is invoked with two arguments: (arrVal, othVal).
      *
-     * @private
-     * @param {Function} func The function to wrap.
-     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
-     * @param {Function} wrapFunc The function to create the `func` wrapper.
-     * @param {*} placeholder The placeholder value.
-     * @param {*} [thisArg] The `this` binding of `func`.
-     * @param {Array} [partials] The arguments to prepend to those provided to
-     *  the new function.
-     * @param {Array} [holders] The `partials` placeholder indexes.
-     * @param {Array} [argPos] The argument positions of the new function.
-     * @param {number} [ary] The arity cap of `func`.
-     * @param {number} [arity] The arity of `func`.
-     * @returns {Function} Returns the new wrapped function.
+     * **Note:** Unlike `_.pullAllWith`, this method returns a new array.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {...Array} [values] The values to exclude.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     * @example
+     *
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+     *
+     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);
+     * // => [{ 'x': 2, 'y': 1 }]
      */
-    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {
-      var isCurry = bitmask & WRAP_CURRY_FLAG,
-          newHolders = isCurry ? holders : undefined$1,
-          newHoldersRight = isCurry ? undefined$1 : holders,
-          newPartials = isCurry ? partials : undefined$1,
-          newPartialsRight = isCurry ? undefined$1 : partials;
-
-      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);
-      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);
+    var differenceWith = baseRest(function(array, values) {
+      var comparator = last(values);
+      if (isArrayLikeObject(comparator)) {
+        comparator = undefined$1;
+      }
+      return isArrayLikeObject(array)
+        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined$1, comparator)
+        : [];
+    });
 
-      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {
-        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);
+    /**
+     * Creates a slice of `array` with `n` elements dropped from the beginning.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.5.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {number} [n=1] The number of elements to drop.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * _.drop([1, 2, 3]);
+     * // => [2, 3]
+     *
+     * _.drop([1, 2, 3], 2);
+     * // => [3]
+     *
+     * _.drop([1, 2, 3], 5);
+     * // => []
+     *
+     * _.drop([1, 2, 3], 0);
+     * // => [1, 2, 3]
+     */
+    function drop(array, n, guard) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return [];
       }
-      var newData = [
-        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,
-        newHoldersRight, argPos, ary, arity
-      ];
+      n = (guard || n === undefined$1) ? 1 : toInteger(n);
+      return baseSlice(array, n < 0 ? 0 : n, length);
+    }
 
-      var result = wrapFunc.apply(undefined$1, newData);
-      if (isLaziable(func)) {
-        setData(result, newData);
+    /**
+     * Creates a slice of `array` with `n` elements dropped from the end.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {number} [n=1] The number of elements to drop.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * _.dropRight([1, 2, 3]);
+     * // => [1, 2]
+     *
+     * _.dropRight([1, 2, 3], 2);
+     * // => [1]
+     *
+     * _.dropRight([1, 2, 3], 5);
+     * // => []
+     *
+     * _.dropRight([1, 2, 3], 0);
+     * // => [1, 2, 3]
+     */
+    function dropRight(array, n, guard) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return [];
       }
-      result.placeholder = placeholder;
-      return setWrapToString(result, func, bitmask);
+      n = (guard || n === undefined$1) ? 1 : toInteger(n);
+      n = length - n;
+      return baseSlice(array, 0, n < 0 ? 0 : n);
     }
 
     /**
-     * Creates a function like `_.round`.
+     * Creates a slice of `array` excluding elements dropped from the end.
+     * Elements are dropped until `predicate` returns falsey. The predicate is
+     * invoked with three arguments: (value, index, array).
      *
-     * @private
-     * @param {string} methodName The name of the `Math` method to use when rounding.
-     * @returns {Function} Returns the new round function.
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * var users = [
+     *   { 'user': 'barney',  'active': true },
+     *   { 'user': 'fred',    'active': false },
+     *   { 'user': 'pebbles', 'active': false }
+     * ];
+     *
+     * _.dropRightWhile(users, function(o) { return !o.active; });
+     * // => objects for ['barney']
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });
+     * // => objects for ['barney', 'fred']
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.dropRightWhile(users, ['active', false]);
+     * // => objects for ['barney']
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.dropRightWhile(users, 'active');
+     * // => objects for ['barney', 'fred', 'pebbles']
      */
-    function createRound(methodName) {
-      var func = Math[methodName];
-      return function(number, precision) {
-        number = toNumber(number);
-        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);
-        if (precision && nativeIsFinite(number)) {
-          // Shift with exponential notation to avoid floating-point issues.
-          // See [MDN](https://mdn.io/round#Examples) for more details.
-          var pair = (toString(number) + 'e').split('e'),
-              value = func(pair[0] + 'e' + (+pair[1] + precision));
-
-          pair = (toString(value) + 'e').split('e');
-          return +(pair[0] + 'e' + (+pair[1] - precision));
-        }
-        return func(number);
-      };
+    function dropRightWhile(array, predicate) {
+      return (array && array.length)
+        ? baseWhile(array, getIteratee(predicate, 3), true, true)
+        : [];
     }
 
     /**
-     * Creates a set object of `values`.
+     * Creates a slice of `array` excluding elements dropped from the beginning.
+     * Elements are dropped until `predicate` returns falsey. The predicate is
+     * invoked with three arguments: (value, index, array).
      *
-     * @private
-     * @param {Array} values The values to add to the set.
-     * @returns {Object} Returns the new set.
-     */
-    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {
-      return new Set(values);
-    };
-
-    /**
-     * Creates a `_.toPairs` or `_.toPairsIn` function.
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
      *
-     * @private
-     * @param {Function} keysFunc The function to get the keys of a given object.
-     * @returns {Function} Returns the new pairs function.
+     * var users = [
+     *   { 'user': 'barney',  'active': false },
+     *   { 'user': 'fred',    'active': false },
+     *   { 'user': 'pebbles', 'active': true }
+     * ];
+     *
+     * _.dropWhile(users, function(o) { return !o.active; });
+     * // => objects for ['pebbles']
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.dropWhile(users, { 'user': 'barney', 'active': false });
+     * // => objects for ['fred', 'pebbles']
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.dropWhile(users, ['active', false]);
+     * // => objects for ['pebbles']
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.dropWhile(users, 'active');
+     * // => objects for ['barney', 'fred', 'pebbles']
      */
-    function createToPairs(keysFunc) {
-      return function(object) {
-        var tag = getTag(object);
-        if (tag == mapTag) {
-          return mapToArray(object);
-        }
-        if (tag == setTag) {
-          return setToPairs(object);
-        }
-        return baseToPairs(object, keysFunc(object));
-      };
+    function dropWhile(array, predicate) {
+      return (array && array.length)
+        ? baseWhile(array, getIteratee(predicate, 3), true)
+        : [];
     }
 
     /**
-     * Creates a function that either curries or invokes `func` with optional
-     * `this` binding and partially applied arguments.
+     * Fills elements of `array` with `value` from `start` up to, but not
+     * including, `end`.
      *
-     * @private
-     * @param {Function|string} func The function or method name to wrap.
-     * @param {number} bitmask The bitmask flags.
-     *    1 - `_.bind`
-     *    2 - `_.bindKey`
-     *    4 - `_.curry` or `_.curryRight` of a bound function
-     *    8 - `_.curry`
-     *   16 - `_.curryRight`
-     *   32 - `_.partial`
-     *   64 - `_.partialRight`
-     *  128 - `_.rearg`
-     *  256 - `_.ary`
-     *  512 - `_.flip`
-     * @param {*} [thisArg] The `this` binding of `func`.
-     * @param {Array} [partials] The arguments to be partially applied.
-     * @param {Array} [holders] The `partials` placeholder indexes.
-     * @param {Array} [argPos] The argument positions of the new function.
-     * @param {number} [ary] The arity cap of `func`.
-     * @param {number} [arity] The arity of `func`.
-     * @returns {Function} Returns the new wrapped function.
+     * **Note:** This method mutates `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.2.0
+     * @category Array
+     * @param {Array} array The array to fill.
+     * @param {*} value The value to fill `array` with.
+     * @param {number} [start=0] The start position.
+     * @param {number} [end=array.length] The end position.
+     * @returns {Array} Returns `array`.
+     * @example
+     *
+     * var array = [1, 2, 3];
+     *
+     * _.fill(array, 'a');
+     * console.log(array);
+     * // => ['a', 'a', 'a']
+     *
+     * _.fill(Array(3), 2);
+     * // => [2, 2, 2]
+     *
+     * _.fill([4, 6, 8, 10], '*', 1, 3);
+     * // => [4, '*', '*', 10]
      */
-    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {
-      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;
-      if (!isBindKey && typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      var length = partials ? partials.length : 0;
+    function fill(array, value, start, end) {
+      var length = array == null ? 0 : array.length;
       if (!length) {
-        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);
-        partials = holders = undefined$1;
-      }
-      ary = ary === undefined$1 ? ary : nativeMax(toInteger(ary), 0);
-      arity = arity === undefined$1 ? arity : toInteger(arity);
-      length -= holders ? holders.length : 0;
-
-      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {
-        var partialsRight = partials,
-            holdersRight = holders;
-
-        partials = holders = undefined$1;
+        return [];
       }
-      var data = isBindKey ? undefined$1 : getData(func);
-
-      var newData = [
-        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,
-        argPos, ary, arity
-      ];
-
-      if (data) {
-        mergeData(newData, data);
+      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {
+        start = 0;
+        end = length;
       }
-      func = newData[0];
-      bitmask = newData[1];
-      thisArg = newData[2];
-      partials = newData[3];
-      holders = newData[4];
-      arity = newData[9] = newData[9] === undefined$1
-        ? (isBindKey ? 0 : func.length)
-        : nativeMax(newData[9] - length, 0);
+      return baseFill(array, value, start, end);
+    }
 
-      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {
-        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);
+    /**
+     * This method is like `_.find` except that it returns the index of the first
+     * element `predicate` returns truthy for instead of the element itself.
+     *
+     * @static
+     * @memberOf _
+     * @since 1.1.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param {number} [fromIndex=0] The index to search from.
+     * @returns {number} Returns the index of the found element, else `-1`.
+     * @example
+     *
+     * var users = [
+     *   { 'user': 'barney',  'active': false },
+     *   { 'user': 'fred',    'active': false },
+     *   { 'user': 'pebbles', 'active': true }
+     * ];
+     *
+     * _.findIndex(users, function(o) { return o.user == 'barney'; });
+     * // => 0
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.findIndex(users, { 'user': 'fred', 'active': false });
+     * // => 1
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.findIndex(users, ['active', false]);
+     * // => 0
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.findIndex(users, 'active');
+     * // => 2
+     */
+    function findIndex(array, predicate, fromIndex) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return -1;
       }
-      if (!bitmask || bitmask == WRAP_BIND_FLAG) {
-        var result = createBind(func, bitmask, thisArg);
-      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {
-        result = createCurry(func, bitmask, arity);
-      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {
-        result = createPartial(func, bitmask, thisArg, partials);
-      } else {
-        result = createHybrid.apply(undefined$1, newData);
+      var index = fromIndex == null ? 0 : toInteger(fromIndex);
+      if (index < 0) {
+        index = nativeMax(length + index, 0);
       }
-      var setter = data ? baseSetData : setData;
-      return setWrapToString(setter(result, newData), func, bitmask);
+      return baseFindIndex(array, getIteratee(predicate, 3), index);
     }
 
     /**
-     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties
-     * of source objects to the destination object for all destination properties
-     * that resolve to `undefined`.
+     * This method is like `_.findIndex` except that it iterates over elements
+     * of `collection` from right to left.
      *
-     * @private
-     * @param {*} objValue The destination value.
-     * @param {*} srcValue The source value.
-     * @param {string} key The key of the property to assign.
-     * @param {Object} object The parent object of `objValue`.
-     * @returns {*} Returns the value to assign.
+     * @static
+     * @memberOf _
+     * @since 2.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param {number} [fromIndex=array.length-1] The index to search from.
+     * @returns {number} Returns the index of the found element, else `-1`.
+     * @example
+     *
+     * var users = [
+     *   { 'user': 'barney',  'active': true },
+     *   { 'user': 'fred',    'active': false },
+     *   { 'user': 'pebbles', 'active': false }
+     * ];
+     *
+     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });
+     * // => 2
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.findLastIndex(users, { 'user': 'barney', 'active': true });
+     * // => 0
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.findLastIndex(users, ['active', false]);
+     * // => 2
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.findLastIndex(users, 'active');
+     * // => 0
      */
-    function customDefaultsAssignIn(objValue, srcValue, key, object) {
-      if (objValue === undefined$1 ||
-          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {
-        return srcValue;
+    function findLastIndex(array, predicate, fromIndex) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return -1;
       }
-      return objValue;
+      var index = length - 1;
+      if (fromIndex !== undefined$1) {
+        index = toInteger(fromIndex);
+        index = fromIndex < 0
+          ? nativeMax(length + index, 0)
+          : nativeMin(index, length - 1);
+      }
+      return baseFindIndex(array, getIteratee(predicate, 3), index, true);
     }
 
     /**
-     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source
-     * objects into destination objects that are passed thru.
+     * Flattens `array` a single level deep.
      *
-     * @private
-     * @param {*} objValue The destination value.
-     * @param {*} srcValue The source value.
-     * @param {string} key The key of the property to merge.
-     * @param {Object} object The parent object of `objValue`.
-     * @param {Object} source The parent object of `srcValue`.
-     * @param {Object} [stack] Tracks traversed source values and their merged
-     *  counterparts.
-     * @returns {*} Returns the value to assign.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to flatten.
+     * @returns {Array} Returns the new flattened array.
+     * @example
+     *
+     * _.flatten([1, [2, [3, [4]], 5]]);
+     * // => [1, 2, [3, [4]], 5]
      */
-    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {
-      if (isObject(objValue) && isObject(srcValue)) {
-        // Recursively merge objects and arrays (susceptible to call stack limits).
-        stack.set(srcValue, objValue);
-        baseMerge(objValue, srcValue, undefined$1, customDefaultsMerge, stack);
-        stack['delete'](srcValue);
-      }
-      return objValue;
+    function flatten(array) {
+      var length = array == null ? 0 : array.length;
+      return length ? baseFlatten(array, 1) : [];
     }
 
     /**
-     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain
-     * objects.
+     * Recursively flattens `array`.
      *
-     * @private
-     * @param {*} value The value to inspect.
-     * @param {string} key The key of the property to inspect.
-     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to flatten.
+     * @returns {Array} Returns the new flattened array.
+     * @example
+     *
+     * _.flattenDeep([1, [2, [3, [4]], 5]]);
+     * // => [1, 2, 3, 4, 5]
      */
-    function customOmitClone(value) {
-      return isPlainObject(value) ? undefined$1 : value;
+    function flattenDeep(array) {
+      var length = array == null ? 0 : array.length;
+      return length ? baseFlatten(array, INFINITY) : [];
     }
 
     /**
-     * A specialized version of `baseIsEqualDeep` for arrays with support for
-     * partial deep comparisons.
+     * Recursively flatten `array` up to `depth` times.
      *
-     * @private
-     * @param {Array} array The array to compare.
-     * @param {Array} other The other array to compare.
-     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
-     * @param {Function} customizer The function to customize comparisons.
-     * @param {Function} equalFunc The function to determine equivalents of values.
-     * @param {Object} stack Tracks traversed `array` and `other` objects.
-     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.
+     * @static
+     * @memberOf _
+     * @since 4.4.0
+     * @category Array
+     * @param {Array} array The array to flatten.
+     * @param {number} [depth=1] The maximum recursion depth.
+     * @returns {Array} Returns the new flattened array.
+     * @example
+     *
+     * var array = [1, [2, [3, [4]], 5]];
+     *
+     * _.flattenDepth(array, 1);
+     * // => [1, 2, [3, [4]], 5]
+     *
+     * _.flattenDepth(array, 2);
+     * // => [1, 2, 3, [4], 5]
      */
-    function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {
-      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
-          arrLength = array.length,
-          othLength = other.length;
-
-      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {
-        return false;
-      }
-      // Check that cyclic values are equal.
-      var arrStacked = stack.get(array);
-      var othStacked = stack.get(other);
-      if (arrStacked && othStacked) {
-        return arrStacked == other && othStacked == array;
+    function flattenDepth(array, depth) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return [];
       }
-      var index = -1,
-          result = true,
-          seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined$1;
-
-      stack.set(array, other);
-      stack.set(other, array);
+      depth = depth === undefined$1 ? 1 : toInteger(depth);
+      return baseFlatten(array, depth);
+    }
 
-      // Ignore non-index properties.
-      while (++index < arrLength) {
-        var arrValue = array[index],
-            othValue = other[index];
+    /**
+     * The inverse of `_.toPairs`; this method returns an object composed
+     * from key-value `pairs`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} pairs The key-value pairs.
+     * @returns {Object} Returns the new object.
+     * @example
+     *
+     * _.fromPairs([['a', 1], ['b', 2]]);
+     * // => { 'a': 1, 'b': 2 }
+     */
+    function fromPairs(pairs) {
+      var index = -1,
+          length = pairs == null ? 0 : pairs.length,
+          result = {};
 
-        if (customizer) {
-          var compared = isPartial
-            ? customizer(othValue, arrValue, index, other, array, stack)
-            : customizer(arrValue, othValue, index, array, other, stack);
-        }
-        if (compared !== undefined$1) {
-          if (compared) {
-            continue;
-          }
-          result = false;
-          break;
-        }
-        // Recursively compare arrays (susceptible to call stack limits).
-        if (seen) {
-          if (!arraySome(other, function(othValue, othIndex) {
-                if (!cacheHas(seen, othIndex) &&
-                    (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {
-                  return seen.push(othIndex);
-                }
-              })) {
-            result = false;
-            break;
-          }
-        } else if (!(
-              arrValue === othValue ||
-                equalFunc(arrValue, othValue, bitmask, customizer, stack)
-            )) {
-          result = false;
-          break;
-        }
+      while (++index < length) {
+        var pair = pairs[index];
+        result[pair[0]] = pair[1];
       }
-      stack['delete'](array);
-      stack['delete'](other);
       return result;
     }
 
     /**
-     * A specialized version of `baseIsEqualDeep` for comparing objects of
-     * the same `toStringTag`.
+     * Gets the first element of `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @alias first
+     * @category Array
+     * @param {Array} array The array to query.
+     * @returns {*} Returns the first element of `array`.
+     * @example
+     *
+     * _.head([1, 2, 3]);
+     * // => 1
+     *
+     * _.head([]);
+     * // => undefined
+     */
+    function head(array) {
+      return (array && array.length) ? array[0] : undefined$1;
+    }
+
+    /**
+     * Gets the index at which the first occurrence of `value` is found in `array`
+     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons. If `fromIndex` is negative, it's used as the
+     * offset from the end of `array`.
      *
-     * **Note:** This function only supports comparing values with tags of
-     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {*} value The value to search for.
+     * @param {number} [fromIndex=0] The index to search from.
+     * @returns {number} Returns the index of the matched value, else `-1`.
+     * @example
      *
-     * @private
-     * @param {Object} object The object to compare.
-     * @param {Object} other The other object to compare.
-     * @param {string} tag The `toStringTag` of the objects to compare.
-     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
-     * @param {Function} customizer The function to customize comparisons.
-     * @param {Function} equalFunc The function to determine equivalents of values.
-     * @param {Object} stack Tracks traversed `object` and `other` objects.
-     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+     * _.indexOf([1, 2, 1, 2], 2);
+     * // => 1
+     *
+     * // Search from the `fromIndex`.
+     * _.indexOf([1, 2, 1, 2], 2, 2);
+     * // => 3
      */
-    function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {
-      switch (tag) {
-        case dataViewTag:
-          if ((object.byteLength != other.byteLength) ||
-              (object.byteOffset != other.byteOffset)) {
-            return false;
-          }
-          object = object.buffer;
-          other = other.buffer;
-
-        case arrayBufferTag:
-          if ((object.byteLength != other.byteLength) ||
-              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {
-            return false;
-          }
-          return true;
-
-        case boolTag:
-        case dateTag:
-        case numberTag:
-          // Coerce booleans to `1` or `0` and dates to milliseconds.
-          // Invalid dates are coerced to `NaN`.
-          return eq(+object, +other);
-
-        case errorTag:
-          return object.name == other.name && object.message == other.message;
-
-        case regexpTag:
-        case stringTag:
-          // Coerce regexes to strings and treat strings, primitives and objects,
-          // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring
-          // for more details.
-          return object == (other + '');
-
-        case mapTag:
-          var convert = mapToArray;
-
-        case setTag:
-          var isPartial = bitmask & COMPARE_PARTIAL_FLAG;
-          convert || (convert = setToArray);
-
-          if (object.size != other.size && !isPartial) {
-            return false;
-          }
-          // Assume cyclic values are equal.
-          var stacked = stack.get(object);
-          if (stacked) {
-            return stacked == other;
-          }
-          bitmask |= COMPARE_UNORDERED_FLAG;
-
-          // Recursively compare objects (susceptible to call stack limits).
-          stack.set(object, other);
-          var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);
-          stack['delete'](object);
-          return result;
-
-        case symbolTag:
-          if (symbolValueOf) {
-            return symbolValueOf.call(object) == symbolValueOf.call(other);
-          }
+    function indexOf(array, value, fromIndex) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return -1;
       }
-      return false;
+      var index = fromIndex == null ? 0 : toInteger(fromIndex);
+      if (index < 0) {
+        index = nativeMax(length + index, 0);
+      }
+      return baseIndexOf(array, value, index);
     }
 
     /**
-     * A specialized version of `baseIsEqualDeep` for objects with support for
-     * partial deep comparisons.
+     * Gets all but the last element of `array`.
      *
-     * @private
-     * @param {Object} object The object to compare.
-     * @param {Object} other The other object to compare.
-     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.
-     * @param {Function} customizer The function to customize comparisons.
-     * @param {Function} equalFunc The function to determine equivalents of values.
-     * @param {Object} stack Tracks traversed `object` and `other` objects.
-     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * _.initial([1, 2, 3]);
+     * // => [1, 2]
      */
-    function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {
-      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,
-          objProps = getAllKeys(object),
-          objLength = objProps.length,
-          othProps = getAllKeys(other),
-          othLength = othProps.length;
-
-      if (objLength != othLength && !isPartial) {
-        return false;
-      }
-      var index = objLength;
-      while (index--) {
-        var key = objProps[index];
-        if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {
-          return false;
-        }
-      }
-      // Check that cyclic values are equal.
-      var objStacked = stack.get(object);
-      var othStacked = stack.get(other);
-      if (objStacked && othStacked) {
-        return objStacked == other && othStacked == object;
-      }
-      var result = true;
-      stack.set(object, other);
-      stack.set(other, object);
+    function initial(array) {
+      var length = array == null ? 0 : array.length;
+      return length ? baseSlice(array, 0, -1) : [];
+    }
 
-      var skipCtor = isPartial;
-      while (++index < objLength) {
-        key = objProps[index];
-        var objValue = object[key],
-            othValue = other[key];
+    /**
+     * Creates an array of unique values that are included in all given arrays
+     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons. The order and references of result values are
+     * determined by the first array.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @returns {Array} Returns the new array of intersecting values.
+     * @example
+     *
+     * _.intersection([2, 1], [2, 3]);
+     * // => [2]
+     */
+    var intersection = baseRest(function(arrays) {
+      var mapped = arrayMap(arrays, castArrayLikeObject);
+      return (mapped.length && mapped[0] === arrays[0])
+        ? baseIntersection(mapped)
+        : [];
+    });
 
-        if (customizer) {
-          var compared = isPartial
-            ? customizer(othValue, objValue, key, other, object, stack)
-            : customizer(objValue, othValue, key, object, other, stack);
-        }
-        // Recursively compare objects (susceptible to call stack limits).
-        if (!(compared === undefined$1
-              ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))
-              : compared
-            )) {
-          result = false;
-          break;
-        }
-        skipCtor || (skipCtor = key == 'constructor');
-      }
-      if (result && !skipCtor) {
-        var objCtor = object.constructor,
-            othCtor = other.constructor;
+    /**
+     * This method is like `_.intersection` except that it accepts `iteratee`
+     * which is invoked for each element of each `arrays` to generate the criterion
+     * by which they're compared. The order and references of result values are
+     * determined by the first array. The iteratee is invoked with one argument:
+     * (value).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new array of intersecting values.
+     * @example
+     *
+     * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);
+     * // => [2.1]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
+     * // => [{ 'x': 1 }]
+     */
+    var intersectionBy = baseRest(function(arrays) {
+      var iteratee = last(arrays),
+          mapped = arrayMap(arrays, castArrayLikeObject);
 
-        // Non `Object` object instances with different constructors are not equal.
-        if (objCtor != othCtor &&
-            ('constructor' in object && 'constructor' in other) &&
-            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&
-              typeof othCtor == 'function' && othCtor instanceof othCtor)) {
-          result = false;
-        }
+      if (iteratee === last(mapped)) {
+        iteratee = undefined$1;
+      } else {
+        mapped.pop();
       }
-      stack['delete'](object);
-      stack['delete'](other);
-      return result;
-    }
+      return (mapped.length && mapped[0] === arrays[0])
+        ? baseIntersection(mapped, getIteratee(iteratee, 2))
+        : [];
+    });
 
     /**
-     * A specialized version of `baseRest` which flattens the rest array.
+     * This method is like `_.intersection` except that it accepts `comparator`
+     * which is invoked to compare elements of `arrays`. The order and references
+     * of result values are determined by the first array. The comparator is
+     * invoked with two arguments: (arrVal, othVal).
      *
-     * @private
-     * @param {Function} func The function to apply a rest parameter to.
-     * @returns {Function} Returns the new function.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of intersecting values.
+     * @example
+     *
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     *
+     * _.intersectionWith(objects, others, _.isEqual);
+     * // => [{ 'x': 1, 'y': 2 }]
      */
-    function flatRest(func) {
-      return setToString(overRest(func, undefined$1, flatten), func + '');
-    }
+    var intersectionWith = baseRest(function(arrays) {
+      var comparator = last(arrays),
+          mapped = arrayMap(arrays, castArrayLikeObject);
+
+      comparator = typeof comparator == 'function' ? comparator : undefined$1;
+      if (comparator) {
+        mapped.pop();
+      }
+      return (mapped.length && mapped[0] === arrays[0])
+        ? baseIntersection(mapped, undefined$1, comparator)
+        : [];
+    });
 
     /**
-     * Creates an array of own enumerable property names and symbols of `object`.
+     * Converts all elements in `array` into a string separated by `separator`.
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property names and symbols.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to convert.
+     * @param {string} [separator=','] The element separator.
+     * @returns {string} Returns the joined string.
+     * @example
+     *
+     * _.join(['a', 'b', 'c'], '~');
+     * // => 'a~b~c'
      */
-    function getAllKeys(object) {
-      return baseGetAllKeys(object, keys, getSymbols);
+    function join(array, separator) {
+      return array == null ? '' : nativeJoin.call(array, separator);
     }
 
     /**
-     * Creates an array of own and inherited enumerable property names and
-     * symbols of `object`.
+     * Gets the last element of `array`.
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property names and symbols.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @returns {*} Returns the last element of `array`.
+     * @example
+     *
+     * _.last([1, 2, 3]);
+     * // => 3
      */
-    function getAllKeysIn(object) {
-      return baseGetAllKeys(object, keysIn, getSymbolsIn);
+    function last(array) {
+      var length = array == null ? 0 : array.length;
+      return length ? array[length - 1] : undefined$1;
     }
 
     /**
-     * Gets metadata for `func`.
+     * This method is like `_.indexOf` except that it iterates over elements of
+     * `array` from right to left.
      *
-     * @private
-     * @param {Function} func The function to query.
-     * @returns {*} Returns the metadata for `func`.
-     */
-    var getData = !metaMap ? noop : function(func) {
-      return metaMap.get(func);
-    };
-
-    /**
-     * Gets the name of `func`.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {*} value The value to search for.
+     * @param {number} [fromIndex=array.length-1] The index to search from.
+     * @returns {number} Returns the index of the matched value, else `-1`.
+     * @example
      *
-     * @private
-     * @param {Function} func The function to query.
-     * @returns {string} Returns the function name.
+     * _.lastIndexOf([1, 2, 1, 2], 2);
+     * // => 3
+     *
+     * // Search from the `fromIndex`.
+     * _.lastIndexOf([1, 2, 1, 2], 2, 2);
+     * // => 1
      */
-    function getFuncName(func) {
-      var result = (func.name + ''),
-          array = realNames[result],
-          length = hasOwnProperty.call(realNames, result) ? array.length : 0;
-
-      while (length--) {
-        var data = array[length],
-            otherFunc = data.func;
-        if (otherFunc == null || otherFunc == func) {
-          return data.name;
-        }
+    function lastIndexOf(array, value, fromIndex) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return -1;
       }
-      return result;
+      var index = length;
+      if (fromIndex !== undefined$1) {
+        index = toInteger(fromIndex);
+        index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);
+      }
+      return value === value
+        ? strictLastIndexOf(array, value, index)
+        : baseFindIndex(array, baseIsNaN, index, true);
     }
 
     /**
-     * Gets the argument placeholder value for `func`.
+     * Gets the element at index `n` of `array`. If `n` is negative, the nth
+     * element from the end is returned.
      *
-     * @private
-     * @param {Function} func The function to inspect.
-     * @returns {*} Returns the placeholder value.
-     */
-    function getHolder(func) {
-      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;
-      return object.placeholder;
-    }
-
-    /**
-     * Gets the appropriate "iteratee" function. If `_.iteratee` is customized,
-     * this function returns the custom method, otherwise it returns `baseIteratee`.
-     * If arguments are provided, the chosen function is invoked with them and
-     * its result is returned.
+     * @static
+     * @memberOf _
+     * @since 4.11.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {number} [n=0] The index of the element to return.
+     * @returns {*} Returns the nth element of `array`.
+     * @example
      *
-     * @private
-     * @param {*} [value] The value to convert to an iteratee.
-     * @param {number} [arity] The arity of the created iteratee.
-     * @returns {Function} Returns the chosen function or its result.
-     */
-    function getIteratee() {
-      var result = lodash.iteratee || iteratee;
-      result = result === iteratee ? baseIteratee : result;
-      return arguments.length ? result(arguments[0], arguments[1]) : result;
-    }
-
-    /**
-     * Gets the data for `map`.
+     * var array = ['a', 'b', 'c', 'd'];
      *
-     * @private
-     * @param {Object} map The map to query.
-     * @param {string} key The reference key.
-     * @returns {*} Returns the map data.
+     * _.nth(array, 1);
+     * // => 'b'
+     *
+     * _.nth(array, -2);
+     * // => 'c';
      */
-    function getMapData(map, key) {
-      var data = map.__data__;
-      return isKeyable(key)
-        ? data[typeof key == 'string' ? 'string' : 'hash']
-        : data.map;
+    function nth(array, n) {
+      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined$1;
     }
 
     /**
-     * Gets the property names, values, and compare flags of `object`.
+     * Removes all given values from `array` using
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons.
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the match data of `object`.
+     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`
+     * to remove elements from an array by predicate.
+     *
+     * @static
+     * @memberOf _
+     * @since 2.0.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @param {...*} [values] The values to remove.
+     * @returns {Array} Returns `array`.
+     * @example
+     *
+     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];
+     *
+     * _.pull(array, 'a', 'c');
+     * console.log(array);
+     * // => ['b', 'b']
      */
-    function getMatchData(object) {
-      var result = keys(object),
-          length = result.length;
-
-      while (length--) {
-        var key = result[length],
-            value = object[key];
-
-        result[length] = [key, value, isStrictComparable(value)];
-      }
-      return result;
-    }
+    var pull = baseRest(pullAll);
 
     /**
-     * Gets the native function at `key` of `object`.
+     * This method is like `_.pull` except that it accepts an array of values to remove.
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @param {string} key The key of the method to get.
-     * @returns {*} Returns the function if it's native, else `undefined`.
+     * **Note:** Unlike `_.difference`, this method mutates `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @param {Array} values The values to remove.
+     * @returns {Array} Returns `array`.
+     * @example
+     *
+     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];
+     *
+     * _.pullAll(array, ['a', 'c']);
+     * console.log(array);
+     * // => ['b', 'b']
      */
-    function getNative(object, key) {
-      var value = getValue(object, key);
-      return baseIsNative(value) ? value : undefined$1;
+    function pullAll(array, values) {
+      return (array && array.length && values && values.length)
+        ? basePullAll(array, values)
+        : array;
     }
 
     /**
-     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.
+     * This method is like `_.pullAll` except that it accepts `iteratee` which is
+     * invoked for each element of `array` and `values` to generate the criterion
+     * by which they're compared. The iteratee is invoked with one argument: (value).
      *
-     * @private
-     * @param {*} value The value to query.
-     * @returns {string} Returns the raw `toStringTag`.
+     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @param {Array} values The values to remove.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns `array`.
+     * @example
+     *
+     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];
+     *
+     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');
+     * console.log(array);
+     * // => [{ 'x': 2 }]
      */
-    function getRawTag(value) {
-      var isOwn = hasOwnProperty.call(value, symToStringTag),
-          tag = value[symToStringTag];
-
-      try {
-        value[symToStringTag] = undefined$1;
-        var unmasked = true;
-      } catch (e) {}
-
-      var result = nativeObjectToString.call(value);
-      if (unmasked) {
-        if (isOwn) {
-          value[symToStringTag] = tag;
-        } else {
-          delete value[symToStringTag];
-        }
-      }
-      return result;
+    function pullAllBy(array, values, iteratee) {
+      return (array && array.length && values && values.length)
+        ? basePullAll(array, values, getIteratee(iteratee, 2))
+        : array;
     }
 
     /**
-     * Creates an array of the own enumerable symbols of `object`.
+     * This method is like `_.pullAll` except that it accepts `comparator` which
+     * is invoked to compare elements of `array` to `values`. The comparator is
+     * invoked with two arguments: (arrVal, othVal).
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of symbols.
-     */
-    var getSymbols = !nativeGetSymbols ? stubArray : function(object) {
-      if (object == null) {
-        return [];
-      }
-      object = Object(object);
-      return arrayFilter(nativeGetSymbols(object), function(symbol) {
-        return propertyIsEnumerable.call(object, symbol);
-      });
-    };
-
-    /**
-     * Creates an array of the own and inherited enumerable symbols of `object`.
+     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of symbols.
+     * @static
+     * @memberOf _
+     * @since 4.6.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @param {Array} values The values to remove.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns `array`.
+     * @example
+     *
+     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];
+     *
+     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);
+     * console.log(array);
+     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]
      */
-    var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {
-      var result = [];
-      while (object) {
-        arrayPush(result, getSymbols(object));
-        object = getPrototype(object);
-      }
-      return result;
-    };
+    function pullAllWith(array, values, comparator) {
+      return (array && array.length && values && values.length)
+        ? basePullAll(array, values, undefined$1, comparator)
+        : array;
+    }
 
     /**
-     * Gets the `toStringTag` of `value`.
+     * Removes elements from `array` corresponding to `indexes` and returns an
+     * array of removed elements.
      *
-     * @private
-     * @param {*} value The value to query.
-     * @returns {string} Returns the `toStringTag`.
+     * **Note:** Unlike `_.at`, this method mutates `array`.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @param {...(number|number[])} [indexes] The indexes of elements to remove.
+     * @returns {Array} Returns the new array of removed elements.
+     * @example
+     *
+     * var array = ['a', 'b', 'c', 'd'];
+     * var pulled = _.pullAt(array, [1, 3]);
+     *
+     * console.log(array);
+     * // => ['a', 'c']
+     *
+     * console.log(pulled);
+     * // => ['b', 'd']
      */
-    var getTag = baseGetTag;
+    var pullAt = flatRest(function(array, indexes) {
+      var length = array == null ? 0 : array.length,
+          result = baseAt(array, indexes);
 
-    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.
-    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||
-        (Map && getTag(new Map) != mapTag) ||
-        (Promise && getTag(Promise.resolve()) != promiseTag) ||
-        (Set && getTag(new Set) != setTag) ||
-        (WeakMap && getTag(new WeakMap) != weakMapTag)) {
-      getTag = function(value) {
-        var result = baseGetTag(value),
-            Ctor = result == objectTag ? value.constructor : undefined$1,
-            ctorString = Ctor ? toSource(Ctor) : '';
+      basePullAt(array, arrayMap(indexes, function(index) {
+        return isIndex(index, length) ? +index : index;
+      }).sort(compareAscending));
 
-        if (ctorString) {
-          switch (ctorString) {
-            case dataViewCtorString: return dataViewTag;
-            case mapCtorString: return mapTag;
-            case promiseCtorString: return promiseTag;
-            case setCtorString: return setTag;
-            case weakMapCtorString: return weakMapTag;
-          }
-        }
-        return result;
-      };
-    }
+      return result;
+    });
 
     /**
-     * Gets the view, applying any `transforms` to the `start` and `end` positions.
+     * Removes all elements from `array` that `predicate` returns truthy for
+     * and returns an array of the removed elements. The predicate is invoked
+     * with three arguments: (value, index, array).
      *
-     * @private
-     * @param {number} start The start of the view.
-     * @param {number} end The end of the view.
-     * @param {Array} transforms The transformations to apply to the view.
-     * @returns {Object} Returns an object containing the `start` and `end`
-     *  positions of the view.
+     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`
+     * to pull elements from an array by value.
+     *
+     * @static
+     * @memberOf _
+     * @since 2.0.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the new array of removed elements.
+     * @example
+     *
+     * var array = [1, 2, 3, 4];
+     * var evens = _.remove(array, function(n) {
+     *   return n % 2 == 0;
+     * });
+     *
+     * console.log(array);
+     * // => [1, 3]
+     *
+     * console.log(evens);
+     * // => [2, 4]
      */
-    function getView(start, end, transforms) {
+    function remove(array, predicate) {
+      var result = [];
+      if (!(array && array.length)) {
+        return result;
+      }
       var index = -1,
-          length = transforms.length;
+          indexes = [],
+          length = array.length;
 
+      predicate = getIteratee(predicate, 3);
       while (++index < length) {
-        var data = transforms[index],
-            size = data.size;
-
-        switch (data.type) {
-          case 'drop':      start += size; break;
-          case 'dropRight': end -= size; break;
-          case 'take':      end = nativeMin(end, start + size); break;
-          case 'takeRight': start = nativeMax(start, end - size); break;
+        var value = array[index];
+        if (predicate(value, index, array)) {
+          result.push(value);
+          indexes.push(index);
         }
       }
-      return { 'start': start, 'end': end };
+      basePullAt(array, indexes);
+      return result;
     }
 
     /**
-     * Extracts wrapper details from the `source` body comment.
+     * Reverses `array` so that the first element becomes the last, the second
+     * element becomes the second to last, and so on.
      *
-     * @private
-     * @param {string} source The source to inspect.
-     * @returns {Array} Returns the wrapper details.
-     */
-    function getWrapDetails(source) {
-      var match = source.match(reWrapDetails);
-      return match ? match[1].split(reSplitDetails) : [];
-    }
-
-    /**
-     * Checks if `path` exists on `object`.
+     * **Note:** This method mutates `array` and is based on
+     * [`Array#reverse`](https://mdn.io/Array/reverse).
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @param {Array|string} path The path to check.
-     * @param {Function} hasFunc The function to check properties.
-     * @returns {boolean} Returns `true` if `path` exists, else `false`.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to modify.
+     * @returns {Array} Returns `array`.
+     * @example
+     *
+     * var array = [1, 2, 3];
+     *
+     * _.reverse(array);
+     * // => [3, 2, 1]
+     *
+     * console.log(array);
+     * // => [3, 2, 1]
      */
-    function hasPath(object, path, hasFunc) {
-      path = castPath(path, object);
-
-      var index = -1,
-          length = path.length,
-          result = false;
+    function reverse(array) {
+      return array == null ? array : nativeReverse.call(array);
+    }
 
-      while (++index < length) {
-        var key = toKey(path[index]);
-        if (!(result = object != null && hasFunc(object, key))) {
-          break;
-        }
-        object = object[key];
+    /**
+     * Creates a slice of `array` from `start` up to, but not including, `end`.
+     *
+     * **Note:** This method is used instead of
+     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are
+     * returned.
+     *
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to slice.
+     * @param {number} [start=0] The start position.
+     * @param {number} [end=array.length] The end position.
+     * @returns {Array} Returns the slice of `array`.
+     */
+    function slice(array, start, end) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return [];
       }
-      if (result || ++index != length) {
-        return result;
+      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {
+        start = 0;
+        end = length;
       }
-      length = object == null ? 0 : object.length;
-      return !!length && isLength(length) && isIndex(key, length) &&
-        (isArray(object) || isArguments(object));
+      else {
+        start = start == null ? 0 : toInteger(start);
+        end = end === undefined$1 ? length : toInteger(end);
+      }
+      return baseSlice(array, start, end);
     }
 
     /**
-     * Initializes an array clone.
+     * Uses a binary search to determine the lowest index at which `value`
+     * should be inserted into `array` in order to maintain its sort order.
      *
-     * @private
-     * @param {Array} array The array to clone.
-     * @returns {Array} Returns the initialized clone.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
+     * @example
+     *
+     * _.sortedIndex([30, 50], 40);
+     * // => 1
      */
-    function initCloneArray(array) {
-      var length = array.length,
-          result = new array.constructor(length);
-
-      // Add properties assigned by `RegExp#exec`.
-      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {
-        result.index = array.index;
-        result.input = array.input;
-      }
-      return result;
+    function sortedIndex(array, value) {
+      return baseSortedIndex(array, value);
     }
 
     /**
-     * Initializes an object clone.
+     * This method is like `_.sortedIndex` except that it accepts `iteratee`
+     * which is invoked for `value` and each element of `array` to compute their
+     * sort ranking. The iteratee is invoked with one argument: (value).
      *
-     * @private
-     * @param {Object} object The object to clone.
-     * @returns {Object} Returns the initialized clone.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
+     * @example
+     *
+     * var objects = [{ 'x': 4 }, { 'x': 5 }];
+     *
+     * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });
+     * // => 0
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.sortedIndexBy(objects, { 'x': 4 }, 'x');
+     * // => 0
      */
-    function initCloneObject(object) {
-      return (typeof object.constructor == 'function' && !isPrototype(object))
-        ? baseCreate(getPrototype(object))
-        : {};
+    function sortedIndexBy(array, value, iteratee) {
+      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));
     }
 
     /**
-     * Initializes an object clone based on its `toStringTag`.
+     * This method is like `_.indexOf` except that it performs a binary
+     * search on a sorted `array`.
      *
-     * **Note:** This function only supports cloning values with tags of
-     * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {*} value The value to search for.
+     * @returns {number} Returns the index of the matched value, else `-1`.
+     * @example
      *
-     * @private
-     * @param {Object} object The object to clone.
-     * @param {string} tag The `toStringTag` of the object to clone.
-     * @param {boolean} [isDeep] Specify a deep clone.
-     * @returns {Object} Returns the initialized clone.
+     * _.sortedIndexOf([4, 5, 5, 5, 6], 5);
+     * // => 1
      */
-    function initCloneByTag(object, tag, isDeep) {
-      var Ctor = object.constructor;
-      switch (tag) {
-        case arrayBufferTag:
-          return cloneArrayBuffer(object);
-
-        case boolTag:
-        case dateTag:
-          return new Ctor(+object);
-
-        case dataViewTag:
-          return cloneDataView(object, isDeep);
-
-        case float32Tag: case float64Tag:
-        case int8Tag: case int16Tag: case int32Tag:
-        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:
-          return cloneTypedArray(object, isDeep);
-
-        case mapTag:
-          return new Ctor;
-
-        case numberTag:
-        case stringTag:
-          return new Ctor(object);
-
-        case regexpTag:
-          return cloneRegExp(object);
-
-        case setTag:
-          return new Ctor;
-
-        case symbolTag:
-          return cloneSymbol(object);
+    function sortedIndexOf(array, value) {
+      var length = array == null ? 0 : array.length;
+      if (length) {
+        var index = baseSortedIndex(array, value);
+        if (index < length && eq(array[index], value)) {
+          return index;
+        }
       }
+      return -1;
     }
 
     /**
-     * Inserts wrapper `details` in a comment at the top of the `source` body.
+     * This method is like `_.sortedIndex` except that it returns the highest
+     * index at which `value` should be inserted into `array` in order to
+     * maintain its sort order.
      *
-     * @private
-     * @param {string} source The source to modify.
-     * @returns {Array} details The details to insert.
-     * @returns {string} Returns the modified source.
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
+     * @example
+     *
+     * _.sortedLastIndex([4, 5, 5, 5, 6], 5);
+     * // => 4
      */
-    function insertWrapDetails(source, details) {
-      var length = details.length;
-      if (!length) {
-        return source;
-      }
-      var lastIndex = length - 1;
-      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];
-      details = details.join(length > 2 ? ', ' : ' ');
-      return source.replace(reWrapComment, '{\n/* [wrapped with ' + details + '] */\n');
+    function sortedLastIndex(array, value) {
+      return baseSortedIndex(array, value, true);
     }
 
     /**
-     * Checks if `value` is a flattenable `arguments` object or array.
+     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`
+     * which is invoked for `value` and each element of `array` to compute their
+     * sort ranking. The iteratee is invoked with one argument: (value).
      *
-     * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The sorted array to inspect.
+     * @param {*} value The value to evaluate.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {number} Returns the index at which `value` should be inserted
+     *  into `array`.
+     * @example
+     *
+     * var objects = [{ 'x': 4 }, { 'x': 5 }];
+     *
+     * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });
+     * // => 1
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');
+     * // => 1
      */
-    function isFlattenable(value) {
-      return isArray(value) || isArguments(value) ||
-        !!(spreadableSymbol && value && value[spreadableSymbol]);
+    function sortedLastIndexBy(array, value, iteratee) {
+      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);
     }
 
     /**
-     * Checks if `value` is a valid array-like index.
+     * This method is like `_.lastIndexOf` except that it performs a binary
+     * search on a sorted `array`.
      *
-     * @private
-     * @param {*} value The value to check.
-     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.
-     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {*} value The value to search for.
+     * @returns {number} Returns the index of the matched value, else `-1`.
+     * @example
+     *
+     * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);
+     * // => 3
      */
-    function isIndex(value, length) {
-      var type = typeof value;
-      length = length == null ? MAX_SAFE_INTEGER : length;
-
-      return !!length &&
-        (type == 'number' ||
-          (type != 'symbol' && reIsUint.test(value))) &&
-            (value > -1 && value % 1 == 0 && value < length);
+    function sortedLastIndexOf(array, value) {
+      var length = array == null ? 0 : array.length;
+      if (length) {
+        var index = baseSortedIndex(array, value, true) - 1;
+        if (eq(array[index], value)) {
+          return index;
+        }
+      }
+      return -1;
     }
 
     /**
-     * Checks if the given arguments are from an iteratee call.
+     * This method is like `_.uniq` except that it's designed and optimized
+     * for sorted arrays.
      *
-     * @private
-     * @param {*} value The potential iteratee value argument.
-     * @param {*} index The potential iteratee index or key argument.
-     * @param {*} object The potential iteratee object argument.
-     * @returns {boolean} Returns `true` if the arguments are from an iteratee call,
-     *  else `false`.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @returns {Array} Returns the new duplicate free array.
+     * @example
+     *
+     * _.sortedUniq([1, 1, 2]);
+     * // => [1, 2]
      */
-    function isIterateeCall(value, index, object) {
-      if (!isObject(object)) {
-        return false;
-      }
-      var type = typeof index;
-      if (type == 'number'
-            ? (isArrayLike(object) && isIndex(index, object.length))
-            : (type == 'string' && index in object)
-          ) {
-        return eq(object[index], value);
-      }
-      return false;
+    function sortedUniq(array) {
+      return (array && array.length)
+        ? baseSortedUniq(array)
+        : [];
     }
 
     /**
-     * Checks if `value` is a property name and not a property path.
+     * This method is like `_.uniqBy` except that it's designed and optimized
+     * for sorted arrays.
      *
-     * @private
-     * @param {*} value The value to check.
-     * @param {Object} [object] The object to query keys on.
-     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {Function} [iteratee] The iteratee invoked per element.
+     * @returns {Array} Returns the new duplicate free array.
+     * @example
+     *
+     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);
+     * // => [1.1, 2.3]
      */
-    function isKey(value, object) {
-      if (isArray(value)) {
-        return false;
-      }
-      var type = typeof value;
-      if (type == 'number' || type == 'symbol' || type == 'boolean' ||
-          value == null || isSymbol(value)) {
-        return true;
-      }
-      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||
-        (object != null && value in Object(object));
+    function sortedUniqBy(array, iteratee) {
+      return (array && array.length)
+        ? baseSortedUniq(array, getIteratee(iteratee, 2))
+        : [];
     }
 
     /**
-     * Checks if `value` is suitable for use as unique object key.
+     * Gets all but the first element of `array`.
      *
-     * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * _.tail([1, 2, 3]);
+     * // => [2, 3]
      */
-    function isKeyable(value) {
-      var type = typeof value;
-      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')
-        ? (value !== '__proto__')
-        : (value === null);
+    function tail(array) {
+      var length = array == null ? 0 : array.length;
+      return length ? baseSlice(array, 1, length) : [];
     }
 
     /**
-     * Checks if `func` has a lazy counterpart.
+     * Creates a slice of `array` with `n` elements taken from the beginning.
      *
-     * @private
-     * @param {Function} func The function to check.
-     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,
-     *  else `false`.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {number} [n=1] The number of elements to take.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * _.take([1, 2, 3]);
+     * // => [1]
+     *
+     * _.take([1, 2, 3], 2);
+     * // => [1, 2]
+     *
+     * _.take([1, 2, 3], 5);
+     * // => [1, 2, 3]
+     *
+     * _.take([1, 2, 3], 0);
+     * // => []
      */
-    function isLaziable(func) {
-      var funcName = getFuncName(func),
-          other = lodash[funcName];
-
-      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {
-        return false;
-      }
-      if (func === other) {
-        return true;
+    function take(array, n, guard) {
+      if (!(array && array.length)) {
+        return [];
       }
-      var data = getData(other);
-      return !!data && func === data[0];
+      n = (guard || n === undefined$1) ? 1 : toInteger(n);
+      return baseSlice(array, 0, n < 0 ? 0 : n);
     }
 
     /**
-     * Checks if `func` has its source masked.
+     * Creates a slice of `array` with `n` elements taken from the end.
      *
-     * @private
-     * @param {Function} func The function to check.
-     * @returns {boolean} Returns `true` if `func` is masked, else `false`.
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {number} [n=1] The number of elements to take.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * _.takeRight([1, 2, 3]);
+     * // => [3]
+     *
+     * _.takeRight([1, 2, 3], 2);
+     * // => [2, 3]
+     *
+     * _.takeRight([1, 2, 3], 5);
+     * // => [1, 2, 3]
+     *
+     * _.takeRight([1, 2, 3], 0);
+     * // => []
      */
-    function isMasked(func) {
-      return !!maskSrcKey && (maskSrcKey in func);
+    function takeRight(array, n, guard) {
+      var length = array == null ? 0 : array.length;
+      if (!length) {
+        return [];
+      }
+      n = (guard || n === undefined$1) ? 1 : toInteger(n);
+      n = length - n;
+      return baseSlice(array, n < 0 ? 0 : n, length);
     }
 
     /**
-     * Checks if `func` is capable of being masked.
+     * Creates a slice of `array` with elements taken from the end. Elements are
+     * taken until `predicate` returns falsey. The predicate is invoked with
+     * three arguments: (value, index, array).
      *
-     * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.
-     */
-    var isMaskable = coreJsData ? isFunction : stubFalse;
-
-    /**
-     * Checks if `value` is likely a prototype object.
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
      *
-     * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.
+     * var users = [
+     *   { 'user': 'barney',  'active': true },
+     *   { 'user': 'fred',    'active': false },
+     *   { 'user': 'pebbles', 'active': false }
+     * ];
+     *
+     * _.takeRightWhile(users, function(o) { return !o.active; });
+     * // => objects for ['fred', 'pebbles']
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });
+     * // => objects for ['pebbles']
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.takeRightWhile(users, ['active', false]);
+     * // => objects for ['fred', 'pebbles']
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.takeRightWhile(users, 'active');
+     * // => []
      */
-    function isPrototype(value) {
-      var Ctor = value && value.constructor,
-          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;
-
-      return value === proto;
+    function takeRightWhile(array, predicate) {
+      return (array && array.length)
+        ? baseWhile(array, getIteratee(predicate, 3), false, true)
+        : [];
     }
 
     /**
-     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.
+     * Creates a slice of `array` with elements taken from the beginning. Elements
+     * are taken until `predicate` returns falsey. The predicate is invoked with
+     * three arguments: (value, index, array).
+     *
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Array
+     * @param {Array} array The array to query.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the slice of `array`.
+     * @example
+     *
+     * var users = [
+     *   { 'user': 'barney',  'active': false },
+     *   { 'user': 'fred',    'active': false },
+     *   { 'user': 'pebbles', 'active': true }
+     * ];
+     *
+     * _.takeWhile(users, function(o) { return !o.active; });
+     * // => objects for ['barney', 'fred']
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.takeWhile(users, { 'user': 'barney', 'active': false });
+     * // => objects for ['barney']
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.takeWhile(users, ['active', false]);
+     * // => objects for ['barney', 'fred']
      *
-     * @private
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` if suitable for strict
-     *  equality comparisons, else `false`.
+     * // The `_.property` iteratee shorthand.
+     * _.takeWhile(users, 'active');
+     * // => []
      */
-    function isStrictComparable(value) {
-      return value === value && !isObject(value);
+    function takeWhile(array, predicate) {
+      return (array && array.length)
+        ? baseWhile(array, getIteratee(predicate, 3))
+        : [];
     }
 
     /**
-     * A specialized version of `matchesProperty` for source values suitable
-     * for strict equality comparisons, i.e. `===`.
+     * Creates an array of unique values, in order, from all given arrays using
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons.
      *
-     * @private
-     * @param {string} key The key of the property to get.
-     * @param {*} srcValue The value to match.
-     * @returns {Function} Returns the new spec function.
-     */
-    function matchesStrictComparable(key, srcValue) {
-      return function(object) {
-        if (object == null) {
-          return false;
-        }
-        return object[key] === srcValue &&
-          (srcValue !== undefined$1 || (key in Object(object)));
-      };
-    }
-
-    /**
-     * A specialized version of `_.memoize` which clears the memoized function's
-     * cache when it exceeds `MAX_MEMOIZE_SIZE`.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @returns {Array} Returns the new array of combined values.
+     * @example
      *
-     * @private
-     * @param {Function} func The function to have its output memoized.
-     * @returns {Function} Returns the new memoized function.
+     * _.union([2], [1, 2]);
+     * // => [2, 1]
      */
-    function memoizeCapped(func) {
-      var result = memoize(func, function(key) {
-        if (cache.size === MAX_MEMOIZE_SIZE) {
-          cache.clear();
-        }
-        return key;
-      });
-
-      var cache = result.cache;
-      return result;
-    }
+    var union = baseRest(function(arrays) {
+      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));
+    });
 
     /**
-     * Merges the function metadata of `source` into `data`.
+     * This method is like `_.union` except that it accepts `iteratee` which is
+     * invoked for each element of each `arrays` to generate the criterion by
+     * which uniqueness is computed. Result values are chosen from the first
+     * array in which the value occurs. The iteratee is invoked with one argument:
+     * (value).
      *
-     * Merging metadata reduces the number of wrappers used to invoke a function.
-     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`
-     * may be applied regardless of execution order. Methods like `_.ary` and
-     * `_.rearg` modify function arguments, making the order in which they are
-     * executed important, preventing the merging of metadata. However, we make
-     * an exception for a safe combined case where curried functions have `_.ary`
-     * and or `_.rearg` applied.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new array of combined values.
+     * @example
      *
-     * @private
-     * @param {Array} data The destination metadata.
-     * @param {Array} source The source metadata.
-     * @returns {Array} Returns `data`.
+     * _.unionBy([2.1], [1.2, 2.3], Math.floor);
+     * // => [2.1, 1.2]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
+     * // => [{ 'x': 1 }, { 'x': 2 }]
      */
-    function mergeData(data, source) {
-      var bitmask = data[1],
-          srcBitmask = source[1],
-          newBitmask = bitmask | srcBitmask,
-          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);
-
-      var isCombo =
-        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||
-        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||
-        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));
-
-      // Exit early if metadata can't be merged.
-      if (!(isCommon || isCombo)) {
-        return data;
-      }
-      // Use source `thisArg` if available.
-      if (srcBitmask & WRAP_BIND_FLAG) {
-        data[2] = source[2];
-        // Set when currying a bound function.
-        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;
-      }
-      // Compose partial arguments.
-      var value = source[3];
-      if (value) {
-        var partials = data[3];
-        data[3] = partials ? composeArgs(partials, value, source[4]) : value;
-        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];
-      }
-      // Compose partial right arguments.
-      value = source[5];
-      if (value) {
-        partials = data[5];
-        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;
-        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];
-      }
-      // Use source `argPos` if available.
-      value = source[7];
-      if (value) {
-        data[7] = value;
-      }
-      // Use source `ary` if it's smaller.
-      if (srcBitmask & WRAP_ARY_FLAG) {
-        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);
-      }
-      // Use source `arity` if one is not provided.
-      if (data[9] == null) {
-        data[9] = source[9];
+    var unionBy = baseRest(function(arrays) {
+      var iteratee = last(arrays);
+      if (isArrayLikeObject(iteratee)) {
+        iteratee = undefined$1;
       }
-      // Use source `func` and merge bitmasks.
-      data[0] = source[0];
-      data[1] = newBitmask;
-
-      return data;
-    }
+      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));
+    });
 
     /**
-     * This function is like
-     * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
-     * except that it includes inherited enumerable properties.
+     * This method is like `_.union` except that it accepts `comparator` which
+     * is invoked to compare elements of `arrays`. Result values are chosen from
+     * the first array in which the value occurs. The comparator is invoked
+     * with two arguments: (arrVal, othVal).
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property names.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of combined values.
+     * @example
+     *
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     *
+     * _.unionWith(objects, others, _.isEqual);
+     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
      */
-    function nativeKeysIn(object) {
-      var result = [];
-      if (object != null) {
-        for (var key in Object(object)) {
-          result.push(key);
-        }
-      }
-      return result;
-    }
+    var unionWith = baseRest(function(arrays) {
+      var comparator = last(arrays);
+      comparator = typeof comparator == 'function' ? comparator : undefined$1;
+      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined$1, comparator);
+    });
 
     /**
-     * Converts `value` to a string using `Object.prototype.toString`.
+     * Creates a duplicate-free version of an array, using
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons, in which only the first occurrence of each element
+     * is kept. The order of result values is determined by the order they occur
+     * in the array.
      *
-     * @private
-     * @param {*} value The value to convert.
-     * @returns {string} Returns the converted string.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @returns {Array} Returns the new duplicate free array.
+     * @example
+     *
+     * _.uniq([2, 1, 2]);
+     * // => [2, 1]
      */
-    function objectToString(value) {
-      return nativeObjectToString.call(value);
+    function uniq(array) {
+      return (array && array.length) ? baseUniq(array) : [];
     }
 
     /**
-     * A specialized version of `baseRest` which transforms the rest array.
+     * This method is like `_.uniq` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the criterion by which
+     * uniqueness is computed. The order of result values is determined by the
+     * order they occur in the array. The iteratee is invoked with one argument:
+     * (value).
      *
-     * @private
-     * @param {Function} func The function to apply a rest parameter to.
-     * @param {number} [start=func.length-1] The start position of the rest parameter.
-     * @param {Function} transform The rest array transform.
-     * @returns {Function} Returns the new function.
-     */
-    function overRest(func, start, transform) {
-      start = nativeMax(start === undefined$1 ? (func.length - 1) : start, 0);
-      return function() {
-        var args = arguments,
-            index = -1,
-            length = nativeMax(args.length - start, 0),
-            array = Array(length);
-
-        while (++index < length) {
-          array[index] = args[start + index];
-        }
-        index = -1;
-        var otherArgs = Array(start + 1);
-        while (++index < start) {
-          otherArgs[index] = args[index];
-        }
-        otherArgs[start] = transform(array);
-        return apply(func, this, otherArgs);
-      };
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new duplicate free array.
+     * @example
+     *
+     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);
+     * // => [2.1, 1.2]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
+     * // => [{ 'x': 1 }, { 'x': 2 }]
+     */
+    function uniqBy(array, iteratee) {
+      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];
     }
 
     /**
-     * Gets the parent value at `path` of `object`.
+     * This method is like `_.uniq` except that it accepts `comparator` which
+     * is invoked to compare elements of `array`. The order of result values is
+     * determined by the order they occur in the array.The comparator is invoked
+     * with two arguments: (arrVal, othVal).
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @param {Array} path The path to get the parent value of.
-     * @returns {*} Returns the parent value.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new duplicate free array.
+     * @example
+     *
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     *
+     * _.uniqWith(objects, _.isEqual);
+     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]
      */
-    function parent(object, path) {
-      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));
+    function uniqWith(array, comparator) {
+      comparator = typeof comparator == 'function' ? comparator : undefined$1;
+      return (array && array.length) ? baseUniq(array, undefined$1, comparator) : [];
     }
 
     /**
-     * Reorder `array` according to the specified indexes where the element at
-     * the first index is assigned as the first element, the element at
-     * the second index is assigned as the second element, and so on.
+     * This method is like `_.zip` except that it accepts an array of grouped
+     * elements and creates an array regrouping the elements to their pre-zip
+     * configuration.
      *
-     * @private
-     * @param {Array} array The array to reorder.
-     * @param {Array} indexes The arranged array indexes.
-     * @returns {Array} Returns `array`.
+     * @static
+     * @memberOf _
+     * @since 1.2.0
+     * @category Array
+     * @param {Array} array The array of grouped elements to process.
+     * @returns {Array} Returns the new array of regrouped elements.
+     * @example
+     *
+     * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);
+     * // => [['a', 1, true], ['b', 2, false]]
+     *
+     * _.unzip(zipped);
+     * // => [['a', 'b'], [1, 2], [true, false]]
      */
-    function reorder(array, indexes) {
-      var arrLength = array.length,
-          length = nativeMin(indexes.length, arrLength),
-          oldArray = copyArray(array);
-
-      while (length--) {
-        var index = indexes[length];
-        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined$1;
+    function unzip(array) {
+      if (!(array && array.length)) {
+        return [];
       }
-      return array;
+      var length = 0;
+      array = arrayFilter(array, function(group) {
+        if (isArrayLikeObject(group)) {
+          length = nativeMax(group.length, length);
+          return true;
+        }
+      });
+      return baseTimes(length, function(index) {
+        return arrayMap(array, baseProperty(index));
+      });
     }
 
     /**
-     * Gets the value at `key`, unless `key` is "__proto__" or "constructor".
+     * This method is like `_.unzip` except that it accepts `iteratee` to specify
+     * how regrouped values should be combined. The iteratee is invoked with the
+     * elements of each group: (...group).
      *
-     * @private
-     * @param {Object} object The object to query.
-     * @param {string} key The key of the property to get.
-     * @returns {*} Returns the property value.
+     * @static
+     * @memberOf _
+     * @since 3.8.0
+     * @category Array
+     * @param {Array} array The array of grouped elements to process.
+     * @param {Function} [iteratee=_.identity] The function to combine
+     *  regrouped values.
+     * @returns {Array} Returns the new array of regrouped elements.
+     * @example
+     *
+     * var zipped = _.zip([1, 2], [10, 20], [100, 200]);
+     * // => [[1, 10, 100], [2, 20, 200]]
+     *
+     * _.unzipWith(zipped, _.add);
+     * // => [3, 30, 300]
      */
-    function safeGet(object, key) {
-      if (key === 'constructor' && typeof object[key] === 'function') {
-        return;
+    function unzipWith(array, iteratee) {
+      if (!(array && array.length)) {
+        return [];
       }
-
-      if (key == '__proto__') {
-        return;
+      var result = unzip(array);
+      if (iteratee == null) {
+        return result;
       }
-
-      return object[key];
+      return arrayMap(result, function(group) {
+        return apply(iteratee, undefined$1, group);
+      });
     }
 
     /**
-     * Sets metadata for `func`.
+     * Creates an array excluding all given values using
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * for equality comparisons.
      *
-     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short
-     * period of time, it will trip its breaker and transition to an identity
-     * function to avoid garbage collection pauses in V8. See
-     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)
-     * for more details.
+     * **Note:** Unlike `_.pull`, this method returns a new array.
      *
-     * @private
-     * @param {Function} func The function to associate metadata with.
-     * @param {*} data The metadata.
-     * @returns {Function} Returns `func`.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {Array} array The array to inspect.
+     * @param {...*} [values] The values to exclude.
+     * @returns {Array} Returns the new array of filtered values.
+     * @see _.difference, _.xor
+     * @example
+     *
+     * _.without([2, 1, 2, 3], 1, 2);
+     * // => [3]
      */
-    var setData = shortOut(baseSetData);
+    var without = baseRest(function(array, values) {
+      return isArrayLikeObject(array)
+        ? baseDifference(array, values)
+        : [];
+    });
 
     /**
-     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).
+     * Creates an array of unique values that is the
+     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)
+     * of the given arrays. The order of result values is determined by the order
+     * they occur in the arrays.
      *
-     * @private
-     * @param {Function} func The function to delay.
-     * @param {number} wait The number of milliseconds to delay invocation.
-     * @returns {number|Object} Returns the timer id or timeout object.
+     * @static
+     * @memberOf _
+     * @since 2.4.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @returns {Array} Returns the new array of filtered values.
+     * @see _.difference, _.without
+     * @example
+     *
+     * _.xor([2, 1], [2, 3]);
+     * // => [1, 3]
      */
-    var setTimeout = ctxSetTimeout || function(func, wait) {
-      return root.setTimeout(func, wait);
-    };
+    var xor = baseRest(function(arrays) {
+      return baseXor(arrayFilter(arrays, isArrayLikeObject));
+    });
 
     /**
-     * Sets the `toString` method of `func` to return `string`.
+     * This method is like `_.xor` except that it accepts `iteratee` which is
+     * invoked for each element of each `arrays` to generate the criterion by
+     * which by which they're compared. The order of result values is determined
+     * by the order they occur in the arrays. The iteratee is invoked with one
+     * argument: (value).
      *
-     * @private
-     * @param {Function} func The function to modify.
-     * @param {Function} string The `toString` result.
-     * @returns {Function} Returns `func`.
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     * @example
+     *
+     * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);
+     * // => [1.2, 3.4]
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
+     * // => [{ 'x': 2 }]
      */
-    var setToString = shortOut(baseSetToString);
+    var xorBy = baseRest(function(arrays) {
+      var iteratee = last(arrays);
+      if (isArrayLikeObject(iteratee)) {
+        iteratee = undefined$1;
+      }
+      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));
+    });
 
     /**
-     * Sets the `toString` method of `wrapper` to mimic the source of `reference`
-     * with wrapper details in a comment at the top of the source body.
+     * This method is like `_.xor` except that it accepts `comparator` which is
+     * invoked to compare elements of `arrays`. The order of result values is
+     * determined by the order they occur in the arrays. The comparator is invoked
+     * with two arguments: (arrVal, othVal).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to inspect.
+     * @param {Function} [comparator] The comparator invoked per element.
+     * @returns {Array} Returns the new array of filtered values.
+     * @example
+     *
+     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
+     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     *
+     * _.xorWith(objects, others, _.isEqual);
+     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
+     */
+    var xorWith = baseRest(function(arrays) {
+      var comparator = last(arrays);
+      comparator = typeof comparator == 'function' ? comparator : undefined$1;
+      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined$1, comparator);
+    });
+
+    /**
+     * Creates an array of grouped elements, the first of which contains the
+     * first elements of the given arrays, the second of which contains the
+     * second elements of the given arrays, and so on.
+     *
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to process.
+     * @returns {Array} Returns the new array of grouped elements.
+     * @example
+     *
+     * _.zip(['a', 'b'], [1, 2], [true, false]);
+     * // => [['a', 1, true], ['b', 2, false]]
+     */
+    var zip = baseRest(unzip);
+
+    /**
+     * This method is like `_.fromPairs` except that it accepts two arrays,
+     * one of property identifiers and one of corresponding values.
      *
-     * @private
-     * @param {Function} wrapper The function to modify.
-     * @param {Function} reference The reference function.
-     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
-     * @returns {Function} Returns `wrapper`.
+     * @static
+     * @memberOf _
+     * @since 0.4.0
+     * @category Array
+     * @param {Array} [props=[]] The property identifiers.
+     * @param {Array} [values=[]] The property values.
+     * @returns {Object} Returns the new object.
+     * @example
+     *
+     * _.zipObject(['a', 'b'], [1, 2]);
+     * // => { 'a': 1, 'b': 2 }
      */
-    function setWrapToString(wrapper, reference, bitmask) {
-      var source = (reference + '');
-      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));
+    function zipObject(props, values) {
+      return baseZipObject(props || [], values || [], assignValue);
     }
 
     /**
-     * Creates a function that'll short out and invoke `identity` instead
-     * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`
-     * milliseconds.
+     * This method is like `_.zipObject` except that it supports property paths.
      *
-     * @private
-     * @param {Function} func The function to restrict.
-     * @returns {Function} Returns the new shortable function.
+     * @static
+     * @memberOf _
+     * @since 4.1.0
+     * @category Array
+     * @param {Array} [props=[]] The property identifiers.
+     * @param {Array} [values=[]] The property values.
+     * @returns {Object} Returns the new object.
+     * @example
+     *
+     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);
+     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }
      */
-    function shortOut(func) {
-      var count = 0,
-          lastCalled = 0;
-
-      return function() {
-        var stamp = nativeNow(),
-            remaining = HOT_SPAN - (stamp - lastCalled);
-
-        lastCalled = stamp;
-        if (remaining > 0) {
-          if (++count >= HOT_COUNT) {
-            return arguments[0];
-          }
-        } else {
-          count = 0;
-        }
-        return func.apply(undefined$1, arguments);
-      };
+    function zipObjectDeep(props, values) {
+      return baseZipObject(props || [], values || [], baseSet);
     }
 
     /**
-     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.
+     * This method is like `_.zip` except that it accepts `iteratee` to specify
+     * how grouped values should be combined. The iteratee is invoked with the
+     * elements of each group: (...group).
      *
-     * @private
-     * @param {Array} array The array to shuffle.
-     * @param {number} [size=array.length] The size of `array`.
-     * @returns {Array} Returns `array`.
+     * @static
+     * @memberOf _
+     * @since 3.8.0
+     * @category Array
+     * @param {...Array} [arrays] The arrays to process.
+     * @param {Function} [iteratee=_.identity] The function to combine
+     *  grouped values.
+     * @returns {Array} Returns the new array of grouped elements.
+     * @example
+     *
+     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {
+     *   return a + b + c;
+     * });
+     * // => [111, 222]
      */
-    function shuffleSelf(array, size) {
-      var index = -1,
-          length = array.length,
-          lastIndex = length - 1;
+    var zipWith = baseRest(function(arrays) {
+      var length = arrays.length,
+          iteratee = length > 1 ? arrays[length - 1] : undefined$1;
 
-      size = size === undefined$1 ? length : size;
-      while (++index < size) {
-        var rand = baseRandom(index, lastIndex),
-            value = array[rand];
+      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined$1;
+      return unzipWith(arrays, iteratee);
+    });
 
-        array[rand] = array[index];
-        array[index] = value;
-      }
-      array.length = size;
-      return array;
-    }
+    /*------------------------------------------------------------------------*/
 
     /**
-     * Converts `string` to a property path array.
+     * Creates a `lodash` wrapper instance that wraps `value` with explicit method
+     * chain sequences enabled. The result of such sequences must be unwrapped
+     * with `_#value`.
      *
-     * @private
-     * @param {string} string The string to convert.
-     * @returns {Array} Returns the property path array.
+     * @static
+     * @memberOf _
+     * @since 1.3.0
+     * @category Seq
+     * @param {*} value The value to wrap.
+     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @example
+     *
+     * var users = [
+     *   { 'user': 'barney',  'age': 36 },
+     *   { 'user': 'fred',    'age': 40 },
+     *   { 'user': 'pebbles', 'age': 1 }
+     * ];
+     *
+     * var youngest = _
+     *   .chain(users)
+     *   .sortBy('age')
+     *   .map(function(o) {
+     *     return o.user + ' is ' + o.age;
+     *   })
+     *   .head()
+     *   .value();
+     * // => 'pebbles is 1'
      */
-    var stringToPath = memoizeCapped(function(string) {
-      var result = [];
-      if (string.charCodeAt(0) === 46 /* . */) {
-        result.push('');
-      }
-      string.replace(rePropName, function(match, number, quote, subString) {
-        result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));
-      });
+    function chain(value) {
+      var result = lodash(value);
+      result.__chain__ = true;
       return result;
-    });
+    }
 
     /**
-     * Converts `value` to a string key if it's not a string or symbol.
+     * This method invokes `interceptor` and returns `value`. The interceptor
+     * is invoked with one argument; (value). The purpose of this method is to
+     * "tap into" a method chain sequence in order to modify intermediate results.
      *
-     * @private
-     * @param {*} value The value to inspect.
-     * @returns {string|symbol} Returns the key.
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Seq
+     * @param {*} value The value to provide to `interceptor`.
+     * @param {Function} interceptor The function to invoke.
+     * @returns {*} Returns `value`.
+     * @example
+     *
+     * _([1, 2, 3])
+     *  .tap(function(array) {
+     *    // Mutate input array.
+     *    array.pop();
+     *  })
+     *  .reverse()
+     *  .value();
+     * // => [2, 1]
      */
-    function toKey(value) {
-      if (typeof value == 'string' || isSymbol(value)) {
-        return value;
-      }
-      var result = (value + '');
-      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;
+    function tap(value, interceptor) {
+      interceptor(value);
+      return value;
     }
 
     /**
-     * Converts `func` to its source code.
+     * This method is like `_.tap` except that it returns the result of `interceptor`.
+     * The purpose of this method is to "pass thru" values replacing intermediate
+     * results in a method chain sequence.
      *
-     * @private
-     * @param {Function} func The function to convert.
-     * @returns {string} Returns the source code.
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Seq
+     * @param {*} value The value to provide to `interceptor`.
+     * @param {Function} interceptor The function to invoke.
+     * @returns {*} Returns the result of `interceptor`.
+     * @example
+     *
+     * _('  abc  ')
+     *  .chain()
+     *  .trim()
+     *  .thru(function(value) {
+     *    return [value];
+     *  })
+     *  .value();
+     * // => ['abc']
      */
-    function toSource(func) {
-      if (func != null) {
-        try {
-          return funcToString.call(func);
-        } catch (e) {}
-        try {
-          return (func + '');
-        } catch (e) {}
-      }
-      return '';
+    function thru(value, interceptor) {
+      return interceptor(value);
     }
 
     /**
-     * Updates wrapper `details` based on `bitmask` flags.
+     * This method is the wrapper version of `_.at`.
      *
-     * @private
-     * @returns {Array} details The details to modify.
-     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.
-     * @returns {Array} Returns `details`.
+     * @name at
+     * @memberOf _
+     * @since 1.0.0
+     * @category Seq
+     * @param {...(string|string[])} [paths] The property paths to pick.
+     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @example
+     *
+     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };
+     *
+     * _(object).at(['a[0].b.c', 'a[1]']).value();
+     * // => [3, 4]
      */
-    function updateWrapDetails(details, bitmask) {
-      arrayEach(wrapFlags, function(pair) {
-        var value = '_.' + pair[0];
-        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {
-          details.push(value);
+    var wrapperAt = flatRest(function(paths) {
+      var length = paths.length,
+          start = length ? paths[0] : 0,
+          value = this.__wrapped__,
+          interceptor = function(object) { return baseAt(object, paths); };
+
+      if (length > 1 || this.__actions__.length ||
+          !(value instanceof LazyWrapper) || !isIndex(start)) {
+        return this.thru(interceptor);
+      }
+      value = value.slice(start, +start + (length ? 1 : 0));
+      value.__actions__.push({
+        'func': thru,
+        'args': [interceptor],
+        'thisArg': undefined$1
+      });
+      return new LodashWrapper(value, this.__chain__).thru(function(array) {
+        if (length && !array.length) {
+          array.push(undefined$1);
         }
+        return array;
       });
-      return details.sort();
-    }
+    });
 
     /**
-     * Creates a clone of `wrapper`.
+     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.
      *
-     * @private
-     * @param {Object} wrapper The wrapper to clone.
-     * @returns {Object} Returns the cloned wrapper.
+     * @name chain
+     * @memberOf _
+     * @since 0.1.0
+     * @category Seq
+     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @example
+     *
+     * var users = [
+     *   { 'user': 'barney', 'age': 36 },
+     *   { 'user': 'fred',   'age': 40 }
+     * ];
+     *
+     * // A sequence without explicit chaining.
+     * _(users).head();
+     * // => { 'user': 'barney', 'age': 36 }
+     *
+     * // A sequence with explicit chaining.
+     * _(users)
+     *   .chain()
+     *   .head()
+     *   .pick('user')
+     *   .value();
+     * // => { 'user': 'barney' }
      */
-    function wrapperClone(wrapper) {
-      if (wrapper instanceof LazyWrapper) {
-        return wrapper.clone();
-      }
-      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);
-      result.__actions__ = copyArray(wrapper.__actions__);
-      result.__index__  = wrapper.__index__;
-      result.__values__ = wrapper.__values__;
-      return result;
+    function wrapperChain() {
+      return chain(this);
     }
 
-    /*------------------------------------------------------------------------*/
-
     /**
-     * Creates an array of elements split into groups the length of `size`.
-     * If `array` can't be split evenly, the final chunk will be the remaining
-     * elements.
+     * Executes the chain sequence and returns the wrapped result.
      *
-     * @static
+     * @name commit
      * @memberOf _
-     * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to process.
-     * @param {number} [size=1] The length of each chunk
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Array} Returns the new array of chunks.
+     * @since 3.2.0
+     * @category Seq
+     * @returns {Object} Returns the new `lodash` wrapper instance.
      * @example
      *
-     * _.chunk(['a', 'b', 'c', 'd'], 2);
-     * // => [['a', 'b'], ['c', 'd']]
+     * var array = [1, 2];
+     * var wrapped = _(array).push(3);
      *
-     * _.chunk(['a', 'b', 'c', 'd'], 3);
-     * // => [['a', 'b', 'c'], ['d']]
+     * console.log(array);
+     * // => [1, 2]
+     *
+     * wrapped = wrapped.commit();
+     * console.log(array);
+     * // => [1, 2, 3]
+     *
+     * wrapped.last();
+     * // => 3
+     *
+     * console.log(array);
+     * // => [1, 2, 3]
      */
-    function chunk(array, size, guard) {
-      if ((guard ? isIterateeCall(array, size, guard) : size === undefined$1)) {
-        size = 1;
-      } else {
-        size = nativeMax(toInteger(size), 0);
-      }
-      var length = array == null ? 0 : array.length;
-      if (!length || size < 1) {
-        return [];
-      }
-      var index = 0,
-          resIndex = 0,
-          result = Array(nativeCeil(length / size));
-
-      while (index < length) {
-        result[resIndex++] = baseSlice(array, index, (index += size));
-      }
-      return result;
+    function wrapperCommit() {
+      return new LodashWrapper(this.value(), this.__chain__);
     }
 
     /**
-     * Creates an array with all falsey values removed. The values `false`, `null`,
-     * `0`, `""`, `undefined`, and `NaN` are falsey.
+     * Gets the next value on a wrapped object following the
+     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).
      *
-     * @static
+     * @name next
      * @memberOf _
-     * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to compact.
-     * @returns {Array} Returns the new array of filtered values.
+     * @since 4.0.0
+     * @category Seq
+     * @returns {Object} Returns the next iterator value.
      * @example
      *
-     * _.compact([0, 1, false, 2, '', 3]);
-     * // => [1, 2, 3]
+     * var wrapped = _([1, 2]);
+     *
+     * wrapped.next();
+     * // => { 'done': false, 'value': 1 }
+     *
+     * wrapped.next();
+     * // => { 'done': false, 'value': 2 }
+     *
+     * wrapped.next();
+     * // => { 'done': true, 'value': undefined }
      */
-    function compact(array) {
-      var index = -1,
-          length = array == null ? 0 : array.length,
-          resIndex = 0,
-          result = [];
-
-      while (++index < length) {
-        var value = array[index];
-        if (value) {
-          result[resIndex++] = value;
-        }
+    function wrapperNext() {
+      if (this.__values__ === undefined$1) {
+        this.__values__ = toArray(this.value());
       }
-      return result;
+      var done = this.__index__ >= this.__values__.length,
+          value = done ? undefined$1 : this.__values__[this.__index__++];
+
+      return { 'done': done, 'value': value };
     }
 
     /**
-     * Creates a new array concatenating `array` with any additional arrays
-     * and/or values.
+     * Enables the wrapper to be iterable.
      *
-     * @static
+     * @name Symbol.iterator
      * @memberOf _
      * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to concatenate.
-     * @param {...*} [values] The values to concatenate.
-     * @returns {Array} Returns the new concatenated array.
+     * @category Seq
+     * @returns {Object} Returns the wrapper object.
      * @example
      *
-     * var array = [1];
-     * var other = _.concat(array, 2, [3], [[4]]);
+     * var wrapped = _([1, 2]);
      *
-     * console.log(other);
-     * // => [1, 2, 3, [4]]
+     * wrapped[Symbol.iterator]() === wrapped;
+     * // => true
      *
-     * console.log(array);
-     * // => [1]
+     * Array.from(wrapped);
+     * // => [1, 2]
      */
-    function concat() {
-      var length = arguments.length;
-      if (!length) {
-        return [];
-      }
-      var args = Array(length - 1),
-          array = arguments[0],
-          index = length;
-
-      while (index--) {
-        args[index - 1] = arguments[index];
-      }
-      return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));
+    function wrapperToIterator() {
+      return this;
     }
 
     /**
-     * Creates an array of `array` values not included in the other given arrays
-     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * for equality comparisons. The order and references of result values are
-     * determined by the first array.
-     *
-     * **Note:** Unlike `_.pullAll`, this method returns a new array.
+     * Creates a clone of the chain sequence planting `value` as the wrapped value.
      *
-     * @static
+     * @name plant
      * @memberOf _
-     * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {...Array} [values] The values to exclude.
-     * @returns {Array} Returns the new array of filtered values.
-     * @see _.without, _.xor
+     * @since 3.2.0
+     * @category Seq
+     * @param {*} value The value to plant.
+     * @returns {Object} Returns the new `lodash` wrapper instance.
      * @example
      *
-     * _.difference([2, 1], [2, 3]);
-     * // => [1]
+     * function square(n) {
+     *   return n * n;
+     * }
+     *
+     * var wrapped = _([1, 2]).map(square);
+     * var other = wrapped.plant([3, 4]);
+     *
+     * other.value();
+     * // => [9, 16]
+     *
+     * wrapped.value();
+     * // => [1, 4]
      */
-    var difference = baseRest(function(array, values) {
-      return isArrayLikeObject(array)
-        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))
-        : [];
-    });
+    function wrapperPlant(value) {
+      var result,
+          parent = this;
+
+      while (parent instanceof baseLodash) {
+        var clone = wrapperClone(parent);
+        clone.__index__ = 0;
+        clone.__values__ = undefined$1;
+        if (result) {
+          previous.__wrapped__ = clone;
+        } else {
+          result = clone;
+        }
+        var previous = clone;
+        parent = parent.__wrapped__;
+      }
+      previous.__wrapped__ = value;
+      return result;
+    }
 
     /**
-     * This method is like `_.difference` except that it accepts `iteratee` which
-     * is invoked for each element of `array` and `values` to generate the criterion
-     * by which they're compared. The order and references of result values are
-     * determined by the first array. The iteratee is invoked with one argument:
-     * (value).
-     *
-     * **Note:** Unlike `_.pullAllBy`, this method returns a new array.
+     * This method is the wrapper version of `_.reverse`.
      *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {...Array} [values] The values to exclude.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {Array} Returns the new array of filtered values.
+     * **Note:** This method mutates the wrapped array.
+     *
+     * @name reverse
+     * @memberOf _
+     * @since 0.1.0
+     * @category Seq
+     * @returns {Object} Returns the new `lodash` wrapper instance.
      * @example
      *
-     * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);
-     * // => [1.2]
+     * var array = [1, 2, 3];
      *
-     * // The `_.property` iteratee shorthand.
-     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');
-     * // => [{ 'x': 2 }]
+     * _(array).reverse().value()
+     * // => [3, 2, 1]
+     *
+     * console.log(array);
+     * // => [3, 2, 1]
      */
-    var differenceBy = baseRest(function(array, values) {
-      var iteratee = last(values);
-      if (isArrayLikeObject(iteratee)) {
-        iteratee = undefined$1;
+    function wrapperReverse() {
+      var value = this.__wrapped__;
+      if (value instanceof LazyWrapper) {
+        var wrapped = value;
+        if (this.__actions__.length) {
+          wrapped = new LazyWrapper(this);
+        }
+        wrapped = wrapped.reverse();
+        wrapped.__actions__.push({
+          'func': thru,
+          'args': [reverse],
+          'thisArg': undefined$1
+        });
+        return new LodashWrapper(wrapped, this.__chain__);
       }
-      return isArrayLikeObject(array)
-        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))
-        : [];
-    });
+      return this.thru(reverse);
+    }
 
     /**
-     * This method is like `_.difference` except that it accepts `comparator`
-     * which is invoked to compare elements of `array` to `values`. The order and
-     * references of result values are determined by the first array. The comparator
-     * is invoked with two arguments: (arrVal, othVal).
-     *
-     * **Note:** Unlike `_.pullAllWith`, this method returns a new array.
+     * Executes the chain sequence to resolve the unwrapped value.
      *
-     * @static
+     * @name value
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {...Array} [values] The values to exclude.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns the new array of filtered values.
+     * @since 0.1.0
+     * @alias toJSON, valueOf
+     * @category Seq
+     * @returns {*} Returns the resolved unwrapped value.
      * @example
      *
-     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
-     *
-     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);
-     * // => [{ 'x': 2, 'y': 1 }]
+     * _([1, 2, 3]).value();
+     * // => [1, 2, 3]
      */
-    var differenceWith = baseRest(function(array, values) {
-      var comparator = last(values);
-      if (isArrayLikeObject(comparator)) {
-        comparator = undefined$1;
-      }
-      return isArrayLikeObject(array)
-        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined$1, comparator)
-        : [];
-    });
+    function wrapperValue() {
+      return baseWrapperValue(this.__wrapped__, this.__actions__);
+    }
+
+    /*------------------------------------------------------------------------*/
 
     /**
-     * Creates a slice of `array` with `n` elements dropped from the beginning.
+     * Creates an object composed of keys generated from the results of running
+     * each element of `collection` thru `iteratee`. The corresponding value of
+     * each key is the number of times the key was returned by `iteratee`. The
+     * iteratee is invoked with one argument: (value).
      *
      * @static
      * @memberOf _
      * @since 0.5.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @param {number} [n=1] The number of elements to drop.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Array} Returns the slice of `array`.
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
+     * @returns {Object} Returns the composed aggregate object.
      * @example
      *
-     * _.drop([1, 2, 3]);
-     * // => [2, 3]
-     *
-     * _.drop([1, 2, 3], 2);
-     * // => [3]
-     *
-     * _.drop([1, 2, 3], 5);
-     * // => []
+     * _.countBy([6.1, 4.2, 6.3], Math.floor);
+     * // => { '4': 1, '6': 2 }
      *
-     * _.drop([1, 2, 3], 0);
-     * // => [1, 2, 3]
+     * // The `_.property` iteratee shorthand.
+     * _.countBy(['one', 'two', 'three'], 'length');
+     * // => { '3': 2, '5': 1 }
      */
-    function drop(array, n, guard) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return [];
+    var countBy = createAggregator(function(result, value, key) {
+      if (hasOwnProperty.call(result, key)) {
+        ++result[key];
+      } else {
+        baseAssignValue(result, key, 1);
       }
-      n = (guard || n === undefined$1) ? 1 : toInteger(n);
-      return baseSlice(array, n < 0 ? 0 : n, length);
-    }
+    });
 
     /**
-     * Creates a slice of `array` with `n` elements dropped from the end.
+     * Checks if `predicate` returns truthy for **all** elements of `collection`.
+     * Iteration is stopped once `predicate` returns falsey. The predicate is
+     * invoked with three arguments: (value, index|key, collection).
+     *
+     * **Note:** This method returns `true` for
+     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because
+     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of
+     * elements of empty collections.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @param {number} [n=1] The number of elements to drop.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
      * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Array} Returns the slice of `array`.
+     * @returns {boolean} Returns `true` if all elements pass the predicate check,
+     *  else `false`.
      * @example
      *
-     * _.dropRight([1, 2, 3]);
-     * // => [1, 2]
+     * _.every([true, 1, null, 'yes'], Boolean);
+     * // => false
      *
-     * _.dropRight([1, 2, 3], 2);
-     * // => [1]
+     * var users = [
+     *   { 'user': 'barney', 'age': 36, 'active': false },
+     *   { 'user': 'fred',   'age': 40, 'active': false }
+     * ];
      *
-     * _.dropRight([1, 2, 3], 5);
-     * // => []
+     * // The `_.matches` iteratee shorthand.
+     * _.every(users, { 'user': 'barney', 'active': false });
+     * // => false
      *
-     * _.dropRight([1, 2, 3], 0);
-     * // => [1, 2, 3]
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.every(users, ['active', false]);
+     * // => true
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.every(users, 'active');
+     * // => false
      */
-    function dropRight(array, n, guard) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return [];
+    function every(collection, predicate, guard) {
+      var func = isArray(collection) ? arrayEvery : baseEvery;
+      if (guard && isIterateeCall(collection, predicate, guard)) {
+        predicate = undefined$1;
       }
-      n = (guard || n === undefined$1) ? 1 : toInteger(n);
-      n = length - n;
-      return baseSlice(array, 0, n < 0 ? 0 : n);
+      return func(collection, getIteratee(predicate, 3));
     }
 
     /**
-     * Creates a slice of `array` excluding elements dropped from the end.
-     * Elements are dropped until `predicate` returns falsey. The predicate is
-     * invoked with three arguments: (value, index, array).
+     * Iterates over elements of `collection`, returning an array of all elements
+     * `predicate` returns truthy for. The predicate is invoked with three
+     * arguments: (value, index|key, collection).
+     *
+     * **Note:** Unlike `_.remove`, this method returns a new array.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to query.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
      * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the slice of `array`.
+     * @returns {Array} Returns the new filtered array.
+     * @see _.reject
      * @example
      *
      * var users = [
-     *   { 'user': 'barney',  'active': true },
-     *   { 'user': 'fred',    'active': false },
-     *   { 'user': 'pebbles', 'active': false }
+     *   { 'user': 'barney', 'age': 36, 'active': true },
+     *   { 'user': 'fred',   'age': 40, 'active': false }
      * ];
      *
-     * _.dropRightWhile(users, function(o) { return !o.active; });
-     * // => objects for ['barney']
+     * _.filter(users, function(o) { return !o.active; });
+     * // => objects for ['fred']
      *
      * // The `_.matches` iteratee shorthand.
-     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });
-     * // => objects for ['barney', 'fred']
+     * _.filter(users, { 'age': 36, 'active': true });
+     * // => objects for ['barney']
      *
      * // The `_.matchesProperty` iteratee shorthand.
-     * _.dropRightWhile(users, ['active', false]);
-     * // => objects for ['barney']
+     * _.filter(users, ['active', false]);
+     * // => objects for ['fred']
      *
      * // The `_.property` iteratee shorthand.
-     * _.dropRightWhile(users, 'active');
-     * // => objects for ['barney', 'fred', 'pebbles']
+     * _.filter(users, 'active');
+     * // => objects for ['barney']
+     *
+     * // Combining several predicates using `_.overEvery` or `_.overSome`.
+     * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));
+     * // => objects for ['fred', 'barney']
      */
-    function dropRightWhile(array, predicate) {
-      return (array && array.length)
-        ? baseWhile(array, getIteratee(predicate, 3), true, true)
-        : [];
+    function filter(collection, predicate) {
+      var func = isArray(collection) ? arrayFilter : baseFilter;
+      return func(collection, getIteratee(predicate, 3));
     }
 
     /**
-     * Creates a slice of `array` excluding elements dropped from the beginning.
-     * Elements are dropped until `predicate` returns falsey. The predicate is
-     * invoked with three arguments: (value, index, array).
+     * Iterates over elements of `collection`, returning the first element
+     * `predicate` returns truthy for. The predicate is invoked with three
+     * arguments: (value, index|key, collection).
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to query.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to inspect.
      * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the slice of `array`.
+     * @param {number} [fromIndex=0] The index to search from.
+     * @returns {*} Returns the matched element, else `undefined`.
      * @example
      *
      * var users = [
-     *   { 'user': 'barney',  'active': false },
-     *   { 'user': 'fred',    'active': false },
-     *   { 'user': 'pebbles', 'active': true }
+     *   { 'user': 'barney',  'age': 36, 'active': true },
+     *   { 'user': 'fred',    'age': 40, 'active': false },
+     *   { 'user': 'pebbles', 'age': 1,  'active': true }
      * ];
      *
-     * _.dropWhile(users, function(o) { return !o.active; });
-     * // => objects for ['pebbles']
+     * _.find(users, function(o) { return o.age < 40; });
+     * // => object for 'barney'
      *
      * // The `_.matches` iteratee shorthand.
-     * _.dropWhile(users, { 'user': 'barney', 'active': false });
-     * // => objects for ['fred', 'pebbles']
+     * _.find(users, { 'age': 1, 'active': true });
+     * // => object for 'pebbles'
      *
      * // The `_.matchesProperty` iteratee shorthand.
-     * _.dropWhile(users, ['active', false]);
-     * // => objects for ['pebbles']
+     * _.find(users, ['active', false]);
+     * // => object for 'fred'
      *
      * // The `_.property` iteratee shorthand.
-     * _.dropWhile(users, 'active');
-     * // => objects for ['barney', 'fred', 'pebbles']
+     * _.find(users, 'active');
+     * // => object for 'barney'
      */
-    function dropWhile(array, predicate) {
-      return (array && array.length)
-        ? baseWhile(array, getIteratee(predicate, 3), true)
-        : [];
-    }
+    var find = createFind(findIndex);
 
     /**
-     * Fills elements of `array` with `value` from `start` up to, but not
-     * including, `end`.
-     *
-     * **Note:** This method mutates `array`.
+     * This method is like `_.find` except that it iterates over elements of
+     * `collection` from right to left.
      *
      * @static
      * @memberOf _
-     * @since 3.2.0
-     * @category Array
-     * @param {Array} array The array to fill.
-     * @param {*} value The value to fill `array` with.
-     * @param {number} [start=0] The start position.
-     * @param {number} [end=array.length] The end position.
-     * @returns {Array} Returns `array`.
+     * @since 2.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param {number} [fromIndex=collection.length-1] The index to search from.
+     * @returns {*} Returns the matched element, else `undefined`.
      * @example
      *
-     * var array = [1, 2, 3];
+     * _.findLast([1, 2, 3, 4], function(n) {
+     *   return n % 2 == 1;
+     * });
+     * // => 3
+     */
+    var findLast = createFind(findLastIndex);
+
+    /**
+     * Creates a flattened array of values by running each element in `collection`
+     * thru `iteratee` and flattening the mapped results. The iteratee is invoked
+     * with three arguments: (value, index|key, collection).
      *
-     * _.fill(array, 'a');
-     * console.log(array);
-     * // => ['a', 'a', 'a']
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the new flattened array.
+     * @example
      *
-     * _.fill(Array(3), 2);
-     * // => [2, 2, 2]
+     * function duplicate(n) {
+     *   return [n, n];
+     * }
      *
-     * _.fill([4, 6, 8, 10], '*', 1, 3);
-     * // => [4, '*', '*', 10]
+     * _.flatMap([1, 2], duplicate);
+     * // => [1, 1, 2, 2]
      */
-    function fill(array, value, start, end) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return [];
-      }
-      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {
-        start = 0;
-        end = length;
-      }
-      return baseFill(array, value, start, end);
+    function flatMap(collection, iteratee) {
+      return baseFlatten(map(collection, iteratee), 1);
     }
 
     /**
-     * This method is like `_.find` except that it returns the index of the first
-     * element `predicate` returns truthy for instead of the element itself.
+     * This method is like `_.flatMap` except that it recursively flattens the
+     * mapped results.
      *
      * @static
      * @memberOf _
-     * @since 1.1.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @param {number} [fromIndex=0] The index to search from.
-     * @returns {number} Returns the index of the found element, else `-1`.
+     * @since 4.7.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the new flattened array.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney',  'active': false },
-     *   { 'user': 'fred',    'active': false },
-     *   { 'user': 'pebbles', 'active': true }
-     * ];
-     *
-     * _.findIndex(users, function(o) { return o.user == 'barney'; });
-     * // => 0
-     *
-     * // The `_.matches` iteratee shorthand.
-     * _.findIndex(users, { 'user': 'fred', 'active': false });
-     * // => 1
-     *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.findIndex(users, ['active', false]);
-     * // => 0
+     * function duplicate(n) {
+     *   return [[[n, n]]];
+     * }
      *
-     * // The `_.property` iteratee shorthand.
-     * _.findIndex(users, 'active');
-     * // => 2
+     * _.flatMapDeep([1, 2], duplicate);
+     * // => [1, 1, 2, 2]
      */
-    function findIndex(array, predicate, fromIndex) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return -1;
-      }
-      var index = fromIndex == null ? 0 : toInteger(fromIndex);
-      if (index < 0) {
-        index = nativeMax(length + index, 0);
-      }
-      return baseFindIndex(array, getIteratee(predicate, 3), index);
+    function flatMapDeep(collection, iteratee) {
+      return baseFlatten(map(collection, iteratee), INFINITY);
     }
 
     /**
-     * This method is like `_.findIndex` except that it iterates over elements
-     * of `collection` from right to left.
+     * This method is like `_.flatMap` except that it recursively flattens the
+     * mapped results up to `depth` times.
      *
      * @static
      * @memberOf _
-     * @since 2.0.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @param {number} [fromIndex=array.length-1] The index to search from.
-     * @returns {number} Returns the index of the found element, else `-1`.
+     * @since 4.7.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @param {number} [depth=1] The maximum recursion depth.
+     * @returns {Array} Returns the new flattened array.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney',  'active': true },
-     *   { 'user': 'fred',    'active': false },
-     *   { 'user': 'pebbles', 'active': false }
-     * ];
+     * function duplicate(n) {
+     *   return [[[n, n]]];
+     * }
      *
-     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });
-     * // => 2
+     * _.flatMapDepth([1, 2], duplicate, 2);
+     * // => [[1, 1], [2, 2]]
+     */
+    function flatMapDepth(collection, iteratee, depth) {
+      depth = depth === undefined$1 ? 1 : toInteger(depth);
+      return baseFlatten(map(collection, iteratee), depth);
+    }
+
+    /**
+     * Iterates over elements of `collection` and invokes `iteratee` for each element.
+     * The iteratee is invoked with three arguments: (value, index|key, collection).
+     * Iteratee functions may exit iteration early by explicitly returning `false`.
      *
-     * // The `_.matches` iteratee shorthand.
-     * _.findLastIndex(users, { 'user': 'barney', 'active': true });
-     * // => 0
+     * **Note:** As with other "Collections" methods, objects with a "length"
+     * property are iterated like arrays. To avoid this behavior use `_.forIn`
+     * or `_.forOwn` for object iteration.
      *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.findLastIndex(users, ['active', false]);
-     * // => 2
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @alias each
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Array|Object} Returns `collection`.
+     * @see _.forEachRight
+     * @example
      *
-     * // The `_.property` iteratee shorthand.
-     * _.findLastIndex(users, 'active');
-     * // => 0
+     * _.forEach([1, 2], function(value) {
+     *   console.log(value);
+     * });
+     * // => Logs `1` then `2`.
+     *
+     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {
+     *   console.log(key);
+     * });
+     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
      */
-    function findLastIndex(array, predicate, fromIndex) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return -1;
-      }
-      var index = length - 1;
-      if (fromIndex !== undefined$1) {
-        index = toInteger(fromIndex);
-        index = fromIndex < 0
-          ? nativeMax(length + index, 0)
-          : nativeMin(index, length - 1);
-      }
-      return baseFindIndex(array, getIteratee(predicate, 3), index, true);
+    function forEach(collection, iteratee) {
+      var func = isArray(collection) ? arrayEach : baseEach;
+      return func(collection, getIteratee(iteratee, 3));
     }
 
     /**
-     * Flattens `array` a single level deep.
+     * This method is like `_.forEach` except that it iterates over elements of
+     * `collection` from right to left.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to flatten.
-     * @returns {Array} Returns the new flattened array.
+     * @since 2.0.0
+     * @alias eachRight
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Array|Object} Returns `collection`.
+     * @see _.forEach
      * @example
      *
-     * _.flatten([1, [2, [3, [4]], 5]]);
-     * // => [1, 2, [3, [4]], 5]
+     * _.forEachRight([1, 2], function(value) {
+     *   console.log(value);
+     * });
+     * // => Logs `2` then `1`.
      */
-    function flatten(array) {
-      var length = array == null ? 0 : array.length;
-      return length ? baseFlatten(array, 1) : [];
+    function forEachRight(collection, iteratee) {
+      var func = isArray(collection) ? arrayEachRight : baseEachRight;
+      return func(collection, getIteratee(iteratee, 3));
     }
 
     /**
-     * Recursively flattens `array`.
+     * Creates an object composed of keys generated from the results of running
+     * each element of `collection` thru `iteratee`. The order of grouped values
+     * is determined by the order they occur in `collection`. The corresponding
+     * value of each key is an array of elements responsible for generating the
+     * key. The iteratee is invoked with one argument: (value).
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to flatten.
-     * @returns {Array} Returns the new flattened array.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
+     * @returns {Object} Returns the composed aggregate object.
      * @example
      *
-     * _.flattenDeep([1, [2, [3, [4]], 5]]);
-     * // => [1, 2, 3, 4, 5]
+     * _.groupBy([6.1, 4.2, 6.3], Math.floor);
+     * // => { '4': [4.2], '6': [6.1, 6.3] }
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.groupBy(['one', 'two', 'three'], 'length');
+     * // => { '3': ['one', 'two'], '5': ['three'] }
      */
-    function flattenDeep(array) {
-      var length = array == null ? 0 : array.length;
-      return length ? baseFlatten(array, INFINITY) : [];
-    }
+    var groupBy = createAggregator(function(result, value, key) {
+      if (hasOwnProperty.call(result, key)) {
+        result[key].push(value);
+      } else {
+        baseAssignValue(result, key, [value]);
+      }
+    });
 
     /**
-     * Recursively flatten `array` up to `depth` times.
+     * Checks if `value` is in `collection`. If `collection` is a string, it's
+     * checked for a substring of `value`, otherwise
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * is used for equality comparisons. If `fromIndex` is negative, it's used as
+     * the offset from the end of `collection`.
      *
      * @static
      * @memberOf _
-     * @since 4.4.0
-     * @category Array
-     * @param {Array} array The array to flatten.
-     * @param {number} [depth=1] The maximum recursion depth.
-     * @returns {Array} Returns the new flattened array.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object|string} collection The collection to inspect.
+     * @param {*} value The value to search for.
+     * @param {number} [fromIndex=0] The index to search from.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.
+     * @returns {boolean} Returns `true` if `value` is found, else `false`.
      * @example
      *
-     * var array = [1, [2, [3, [4]], 5]];
+     * _.includes([1, 2, 3], 1);
+     * // => true
      *
-     * _.flattenDepth(array, 1);
-     * // => [1, 2, [3, [4]], 5]
+     * _.includes([1, 2, 3], 1, 2);
+     * // => false
      *
-     * _.flattenDepth(array, 2);
-     * // => [1, 2, 3, [4], 5]
+     * _.includes({ 'a': 1, 'b': 2 }, 1);
+     * // => true
+     *
+     * _.includes('abcd', 'bc');
+     * // => true
      */
-    function flattenDepth(array, depth) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return [];
+    function includes(collection, value, fromIndex, guard) {
+      collection = isArrayLike(collection) ? collection : values(collection);
+      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;
+
+      var length = collection.length;
+      if (fromIndex < 0) {
+        fromIndex = nativeMax(length + fromIndex, 0);
       }
-      depth = depth === undefined$1 ? 1 : toInteger(depth);
-      return baseFlatten(array, depth);
+      return isString(collection)
+        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)
+        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);
     }
 
     /**
-     * The inverse of `_.toPairs`; this method returns an object composed
-     * from key-value `pairs`.
+     * Invokes the method at `path` of each element in `collection`, returning
+     * an array of the results of each invoked method. Any additional arguments
+     * are provided to each invoked method. If `path` is a function, it's invoked
+     * for, and `this` bound to, each element in `collection`.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Array
-     * @param {Array} pairs The key-value pairs.
-     * @returns {Object} Returns the new object.
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Array|Function|string} path The path of the method to invoke or
+     *  the function invoked per iteration.
+     * @param {...*} [args] The arguments to invoke each method with.
+     * @returns {Array} Returns the array of results.
      * @example
      *
-     * _.fromPairs([['a', 1], ['b', 2]]);
-     * // => { 'a': 1, 'b': 2 }
+     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');
+     * // => [[1, 5, 7], [1, 2, 3]]
+     *
+     * _.invokeMap([123, 456], String.prototype.split, '');
+     * // => [['1', '2', '3'], ['4', '5', '6']]
      */
-    function fromPairs(pairs) {
+    var invokeMap = baseRest(function(collection, path, args) {
       var index = -1,
-          length = pairs == null ? 0 : pairs.length,
-          result = {};
+          isFunc = typeof path == 'function',
+          result = isArrayLike(collection) ? Array(collection.length) : [];
 
-      while (++index < length) {
-        var pair = pairs[index];
-        result[pair[0]] = pair[1];
-      }
+      baseEach(collection, function(value) {
+        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);
+      });
       return result;
-    }
+    });
 
     /**
-     * Gets the first element of `array`.
+     * Creates an object composed of keys generated from the results of running
+     * each element of `collection` thru `iteratee`. The corresponding value of
+     * each key is the last element responsible for generating the key. The
+     * iteratee is invoked with one argument: (value).
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @alias first
-     * @category Array
-     * @param {Array} array The array to query.
-     * @returns {*} Returns the first element of `array`.
+     * @since 4.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
+     * @returns {Object} Returns the composed aggregate object.
      * @example
      *
-     * _.head([1, 2, 3]);
-     * // => 1
+     * var array = [
+     *   { 'dir': 'left', 'code': 97 },
+     *   { 'dir': 'right', 'code': 100 }
+     * ];
      *
-     * _.head([]);
-     * // => undefined
+     * _.keyBy(array, function(o) {
+     *   return String.fromCharCode(o.code);
+     * });
+     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
+     *
+     * _.keyBy(array, 'dir');
+     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
      */
-    function head(array) {
-      return (array && array.length) ? array[0] : undefined$1;
-    }
+    var keyBy = createAggregator(function(result, value, key) {
+      baseAssignValue(result, key, value);
+    });
 
     /**
-     * Gets the index at which the first occurrence of `value` is found in `array`
-     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * for equality comparisons. If `fromIndex` is negative, it's used as the
-     * offset from the end of `array`.
+     * Creates an array of values by running each element in `collection` thru
+     * `iteratee`. The iteratee is invoked with three arguments:
+     * (value, index|key, collection).
+     *
+     * Many lodash methods are guarded to work as iteratees for methods like
+     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.
+     *
+     * The guarded methods are:
+     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,
+     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,
+     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,
+     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {*} value The value to search for.
-     * @param {number} [fromIndex=0] The index to search from.
-     * @returns {number} Returns the index of the matched value, else `-1`.
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the new mapped array.
      * @example
      *
-     * _.indexOf([1, 2, 1, 2], 2);
-     * // => 1
+     * function square(n) {
+     *   return n * n;
+     * }
      *
-     * // Search from the `fromIndex`.
-     * _.indexOf([1, 2, 1, 2], 2, 2);
-     * // => 3
-     */
-    function indexOf(array, value, fromIndex) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return -1;
-      }
-      var index = fromIndex == null ? 0 : toInteger(fromIndex);
-      if (index < 0) {
-        index = nativeMax(length + index, 0);
-      }
-      return baseIndexOf(array, value, index);
-    }
-
-    /**
-     * Gets all but the last element of `array`.
+     * _.map([4, 8], square);
+     * // => [16, 64]
      *
-     * @static
-     * @memberOf _
-     * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @returns {Array} Returns the slice of `array`.
-     * @example
+     * _.map({ 'a': 4, 'b': 8 }, square);
+     * // => [16, 64] (iteration order is not guaranteed)
      *
-     * _.initial([1, 2, 3]);
-     * // => [1, 2]
+     * var users = [
+     *   { 'user': 'barney' },
+     *   { 'user': 'fred' }
+     * ];
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.map(users, 'user');
+     * // => ['barney', 'fred']
      */
-    function initial(array) {
-      var length = array == null ? 0 : array.length;
-      return length ? baseSlice(array, 0, -1) : [];
+    function map(collection, iteratee) {
+      var func = isArray(collection) ? arrayMap : baseMap;
+      return func(collection, getIteratee(iteratee, 3));
     }
 
     /**
-     * Creates an array of unique values that are included in all given arrays
-     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * for equality comparisons. The order and references of result values are
-     * determined by the first array.
+     * This method is like `_.sortBy` except that it allows specifying the sort
+     * orders of the iteratees to sort by. If `orders` is unspecified, all values
+     * are sorted in ascending order. Otherwise, specify an order of "desc" for
+     * descending or "asc" for ascending sort order of corresponding values.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to inspect.
-     * @returns {Array} Returns the new array of intersecting values.
+     * @since 4.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]
+     *  The iteratees to sort by.
+     * @param {string[]} [orders] The sort orders of `iteratees`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.
+     * @returns {Array} Returns the new sorted array.
      * @example
      *
-     * _.intersection([2, 1], [2, 3]);
-     * // => [2]
+     * var users = [
+     *   { 'user': 'fred',   'age': 48 },
+     *   { 'user': 'barney', 'age': 34 },
+     *   { 'user': 'fred',   'age': 40 },
+     *   { 'user': 'barney', 'age': 36 }
+     * ];
+     *
+     * // Sort by `user` in ascending order and by `age` in descending order.
+     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);
+     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]
      */
-    var intersection = baseRest(function(arrays) {
-      var mapped = arrayMap(arrays, castArrayLikeObject);
-      return (mapped.length && mapped[0] === arrays[0])
-        ? baseIntersection(mapped)
-        : [];
-    });
+    function orderBy(collection, iteratees, orders, guard) {
+      if (collection == null) {
+        return [];
+      }
+      if (!isArray(iteratees)) {
+        iteratees = iteratees == null ? [] : [iteratees];
+      }
+      orders = guard ? undefined$1 : orders;
+      if (!isArray(orders)) {
+        orders = orders == null ? [] : [orders];
+      }
+      return baseOrderBy(collection, iteratees, orders);
+    }
 
     /**
-     * This method is like `_.intersection` except that it accepts `iteratee`
-     * which is invoked for each element of each `arrays` to generate the criterion
-     * by which they're compared. The order and references of result values are
-     * determined by the first array. The iteratee is invoked with one argument:
-     * (value).
+     * Creates an array of elements split into two groups, the first of which
+     * contains elements `predicate` returns truthy for, the second of which
+     * contains elements `predicate` returns falsey for. The predicate is
+     * invoked with one argument: (value).
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to inspect.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {Array} Returns the new array of intersecting values.
+     * @since 3.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the array of grouped elements.
      * @example
      *
-     * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);
-     * // => [2.1]
+     * var users = [
+     *   { 'user': 'barney',  'age': 36, 'active': false },
+     *   { 'user': 'fred',    'age': 40, 'active': true },
+     *   { 'user': 'pebbles', 'age': 1,  'active': false }
+     * ];
+     *
+     * _.partition(users, function(o) { return o.active; });
+     * // => objects for [['fred'], ['barney', 'pebbles']]
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.partition(users, { 'age': 1, 'active': false });
+     * // => objects for [['pebbles'], ['barney', 'fred']]
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.partition(users, ['active', false]);
+     * // => objects for [['barney', 'pebbles'], ['fred']]
      *
      * // The `_.property` iteratee shorthand.
-     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
-     * // => [{ 'x': 1 }]
+     * _.partition(users, 'active');
+     * // => objects for [['fred'], ['barney', 'pebbles']]
      */
-    var intersectionBy = baseRest(function(arrays) {
-      var iteratee = last(arrays),
-          mapped = arrayMap(arrays, castArrayLikeObject);
-
-      if (iteratee === last(mapped)) {
-        iteratee = undefined$1;
-      } else {
-        mapped.pop();
-      }
-      return (mapped.length && mapped[0] === arrays[0])
-        ? baseIntersection(mapped, getIteratee(iteratee, 2))
-        : [];
-    });
+    var partition = createAggregator(function(result, value, key) {
+      result[key ? 0 : 1].push(value);
+    }, function() { return [[], []]; });
 
     /**
-     * This method is like `_.intersection` except that it accepts `comparator`
-     * which is invoked to compare elements of `arrays`. The order and references
-     * of result values are determined by the first array. The comparator is
-     * invoked with two arguments: (arrVal, othVal).
+     * Reduces `collection` to a value which is the accumulated result of running
+     * each element in `collection` thru `iteratee`, where each successive
+     * invocation is supplied the return value of the previous. If `accumulator`
+     * is not given, the first element of `collection` is used as the initial
+     * value. The iteratee is invoked with four arguments:
+     * (accumulator, value, index|key, collection).
+     *
+     * Many lodash methods are guarded to work as iteratees for methods like
+     * `_.reduce`, `_.reduceRight`, and `_.transform`.
+     *
+     * The guarded methods are:
+     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,
+     * and `sortBy`
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to inspect.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns the new array of intersecting values.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @param {*} [accumulator] The initial value.
+     * @returns {*} Returns the accumulated value.
+     * @see _.reduceRight
      * @example
      *
-     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
-     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     * _.reduce([1, 2], function(sum, n) {
+     *   return sum + n;
+     * }, 0);
+     * // => 3
      *
-     * _.intersectionWith(objects, others, _.isEqual);
-     * // => [{ 'x': 1, 'y': 2 }]
+     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
+     *   (result[value] || (result[value] = [])).push(key);
+     *   return result;
+     * }, {});
+     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)
      */
-    var intersectionWith = baseRest(function(arrays) {
-      var comparator = last(arrays),
-          mapped = arrayMap(arrays, castArrayLikeObject);
+    function reduce(collection, iteratee, accumulator) {
+      var func = isArray(collection) ? arrayReduce : baseReduce,
+          initAccum = arguments.length < 3;
 
-      comparator = typeof comparator == 'function' ? comparator : undefined$1;
-      if (comparator) {
-        mapped.pop();
-      }
-      return (mapped.length && mapped[0] === arrays[0])
-        ? baseIntersection(mapped, undefined$1, comparator)
-        : [];
-    });
+      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);
+    }
 
     /**
-     * Converts all elements in `array` into a string separated by `separator`.
+     * This method is like `_.reduce` except that it iterates over elements of
+     * `collection` from right to left.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to convert.
-     * @param {string} [separator=','] The element separator.
-     * @returns {string} Returns the joined string.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @param {*} [accumulator] The initial value.
+     * @returns {*} Returns the accumulated value.
+     * @see _.reduce
      * @example
      *
-     * _.join(['a', 'b', 'c'], '~');
-     * // => 'a~b~c'
+     * var array = [[0, 1], [2, 3], [4, 5]];
+     *
+     * _.reduceRight(array, function(flattened, other) {
+     *   return flattened.concat(other);
+     * }, []);
+     * // => [4, 5, 2, 3, 0, 1]
      */
-    function join(array, separator) {
-      return array == null ? '' : nativeJoin.call(array, separator);
+    function reduceRight(collection, iteratee, accumulator) {
+      var func = isArray(collection) ? arrayReduceRight : baseReduce,
+          initAccum = arguments.length < 3;
+
+      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);
     }
 
     /**
-     * Gets the last element of `array`.
+     * The opposite of `_.filter`; this method returns the elements of `collection`
+     * that `predicate` does **not** return truthy for.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @returns {*} Returns the last element of `array`.
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the new filtered array.
+     * @see _.filter
      * @example
      *
-     * _.last([1, 2, 3]);
-     * // => 3
+     * var users = [
+     *   { 'user': 'barney', 'age': 36, 'active': false },
+     *   { 'user': 'fred',   'age': 40, 'active': true }
+     * ];
+     *
+     * _.reject(users, function(o) { return !o.active; });
+     * // => objects for ['fred']
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.reject(users, { 'age': 40, 'active': true });
+     * // => objects for ['barney']
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.reject(users, ['active', false]);
+     * // => objects for ['fred']
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.reject(users, 'active');
+     * // => objects for ['barney']
      */
-    function last(array) {
-      var length = array == null ? 0 : array.length;
-      return length ? array[length - 1] : undefined$1;
+    function reject(collection, predicate) {
+      var func = isArray(collection) ? arrayFilter : baseFilter;
+      return func(collection, negate(getIteratee(predicate, 3)));
     }
 
     /**
-     * This method is like `_.indexOf` except that it iterates over elements of
-     * `array` from right to left.
+     * Gets a random element from `collection`.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {*} value The value to search for.
-     * @param {number} [fromIndex=array.length-1] The index to search from.
-     * @returns {number} Returns the index of the matched value, else `-1`.
+     * @since 2.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to sample.
+     * @returns {*} Returns the random element.
      * @example
      *
-     * _.lastIndexOf([1, 2, 1, 2], 2);
-     * // => 3
-     *
-     * // Search from the `fromIndex`.
-     * _.lastIndexOf([1, 2, 1, 2], 2, 2);
-     * // => 1
+     * _.sample([1, 2, 3, 4]);
+     * // => 2
      */
-    function lastIndexOf(array, value, fromIndex) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return -1;
-      }
-      var index = length;
-      if (fromIndex !== undefined$1) {
-        index = toInteger(fromIndex);
-        index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);
-      }
-      return value === value
-        ? strictLastIndexOf(array, value, index)
-        : baseFindIndex(array, baseIsNaN, index, true);
+    function sample(collection) {
+      var func = isArray(collection) ? arraySample : baseSample;
+      return func(collection);
     }
 
     /**
-     * Gets the element at index `n` of `array`. If `n` is negative, the nth
-     * element from the end is returned.
+     * Gets `n` random elements at unique keys from `collection` up to the
+     * size of `collection`.
      *
      * @static
      * @memberOf _
-     * @since 4.11.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @param {number} [n=0] The index of the element to return.
-     * @returns {*} Returns the nth element of `array`.
+     * @since 4.0.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to sample.
+     * @param {number} [n=1] The number of elements to sample.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the random elements.
      * @example
      *
-     * var array = ['a', 'b', 'c', 'd'];
-     *
-     * _.nth(array, 1);
-     * // => 'b'
+     * _.sampleSize([1, 2, 3], 2);
+     * // => [3, 1]
      *
-     * _.nth(array, -2);
-     * // => 'c';
+     * _.sampleSize([1, 2, 3], 4);
+     * // => [2, 3, 1]
      */
-    function nth(array, n) {
-      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined$1;
+    function sampleSize(collection, n, guard) {
+      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined$1)) {
+        n = 1;
+      } else {
+        n = toInteger(n);
+      }
+      var func = isArray(collection) ? arraySampleSize : baseSampleSize;
+      return func(collection, n);
     }
 
     /**
-     * Removes all given values from `array` using
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * for equality comparisons.
-     *
-     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`
-     * to remove elements from an array by predicate.
+     * Creates an array of shuffled values, using a version of the
+     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).
      *
      * @static
      * @memberOf _
-     * @since 2.0.0
-     * @category Array
-     * @param {Array} array The array to modify.
-     * @param {...*} [values] The values to remove.
-     * @returns {Array} Returns `array`.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to shuffle.
+     * @returns {Array} Returns the new shuffled array.
      * @example
      *
-     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];
-     *
-     * _.pull(array, 'a', 'c');
-     * console.log(array);
-     * // => ['b', 'b']
+     * _.shuffle([1, 2, 3, 4]);
+     * // => [4, 1, 3, 2]
      */
-    var pull = baseRest(pullAll);
+    function shuffle(collection) {
+      var func = isArray(collection) ? arrayShuffle : baseShuffle;
+      return func(collection);
+    }
 
     /**
-     * This method is like `_.pull` except that it accepts an array of values to remove.
-     *
-     * **Note:** Unlike `_.difference`, this method mutates `array`.
+     * Gets the size of `collection` by returning its length for array-like
+     * values or the number of own enumerable string keyed properties for objects.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to modify.
-     * @param {Array} values The values to remove.
-     * @returns {Array} Returns `array`.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object|string} collection The collection to inspect.
+     * @returns {number} Returns the collection size.
      * @example
      *
-     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];
+     * _.size([1, 2, 3]);
+     * // => 3
      *
-     * _.pullAll(array, ['a', 'c']);
-     * console.log(array);
-     * // => ['b', 'b']
+     * _.size({ 'a': 1, 'b': 2 });
+     * // => 2
+     *
+     * _.size('pebbles');
+     * // => 7
      */
-    function pullAll(array, values) {
-      return (array && array.length && values && values.length)
-        ? basePullAll(array, values)
-        : array;
+    function size(collection) {
+      if (collection == null) {
+        return 0;
+      }
+      if (isArrayLike(collection)) {
+        return isString(collection) ? stringSize(collection) : collection.length;
+      }
+      var tag = getTag(collection);
+      if (tag == mapTag || tag == setTag) {
+        return collection.size;
+      }
+      return baseKeys(collection).length;
     }
 
     /**
-     * This method is like `_.pullAll` except that it accepts `iteratee` which is
-     * invoked for each element of `array` and `values` to generate the criterion
-     * by which they're compared. The iteratee is invoked with one argument: (value).
-     *
-     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.
+     * Checks if `predicate` returns truthy for **any** element of `collection`.
+     * Iteration is stopped once `predicate` returns truthy. The predicate is
+     * invoked with three arguments: (value, index|key, collection).
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to modify.
-     * @param {Array} values The values to remove.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {Array} Returns `array`.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {boolean} Returns `true` if any element passes the predicate check,
+     *  else `false`.
      * @example
      *
-     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];
+     * _.some([null, 0, 'yes', false], Boolean);
+     * // => true
      *
-     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');
-     * console.log(array);
-     * // => [{ 'x': 2 }]
+     * var users = [
+     *   { 'user': 'barney', 'active': true },
+     *   { 'user': 'fred',   'active': false }
+     * ];
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.some(users, { 'user': 'barney', 'active': false });
+     * // => false
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.some(users, ['active', false]);
+     * // => true
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.some(users, 'active');
+     * // => true
      */
-    function pullAllBy(array, values, iteratee) {
-      return (array && array.length && values && values.length)
-        ? basePullAll(array, values, getIteratee(iteratee, 2))
-        : array;
+    function some(collection, predicate, guard) {
+      var func = isArray(collection) ? arraySome : baseSome;
+      if (guard && isIterateeCall(collection, predicate, guard)) {
+        predicate = undefined$1;
+      }
+      return func(collection, getIteratee(predicate, 3));
     }
 
     /**
-     * This method is like `_.pullAll` except that it accepts `comparator` which
-     * is invoked to compare elements of `array` to `values`. The comparator is
-     * invoked with two arguments: (arrVal, othVal).
-     *
-     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.
+     * Creates an array of elements, sorted in ascending order by the results of
+     * running each element in a collection thru each iteratee. This method
+     * performs a stable sort, that is, it preserves the original sort order of
+     * equal elements. The iteratees are invoked with one argument: (value).
      *
      * @static
      * @memberOf _
-     * @since 4.6.0
-     * @category Array
-     * @param {Array} array The array to modify.
-     * @param {Array} values The values to remove.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns `array`.
+     * @since 0.1.0
+     * @category Collection
+     * @param {Array|Object} collection The collection to iterate over.
+     * @param {...(Function|Function[])} [iteratees=[_.identity]]
+     *  The iteratees to sort by.
+     * @returns {Array} Returns the new sorted array.
      * @example
      *
-     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];
+     * var users = [
+     *   { 'user': 'fred',   'age': 48 },
+     *   { 'user': 'barney', 'age': 36 },
+     *   { 'user': 'fred',   'age': 30 },
+     *   { 'user': 'barney', 'age': 34 }
+     * ];
      *
-     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);
-     * console.log(array);
-     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]
+     * _.sortBy(users, [function(o) { return o.user; }]);
+     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]
+     *
+     * _.sortBy(users, ['user', 'age']);
+     * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]
      */
-    function pullAllWith(array, values, comparator) {
-      return (array && array.length && values && values.length)
-        ? basePullAll(array, values, undefined$1, comparator)
-        : array;
-    }
+    var sortBy = baseRest(function(collection, iteratees) {
+      if (collection == null) {
+        return [];
+      }
+      var length = iteratees.length;
+      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {
+        iteratees = [];
+      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {
+        iteratees = [iteratees[0]];
+      }
+      return baseOrderBy(collection, baseFlatten(iteratees, 1), []);
+    });
+
+    /*------------------------------------------------------------------------*/
 
     /**
-     * Removes elements from `array` corresponding to `indexes` and returns an
-     * array of removed elements.
-     *
-     * **Note:** Unlike `_.at`, this method mutates `array`.
+     * Gets the timestamp of the number of milliseconds that have elapsed since
+     * the Unix epoch (1 January 1970 00:00:00 UTC).
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to modify.
-     * @param {...(number|number[])} [indexes] The indexes of elements to remove.
-     * @returns {Array} Returns the new array of removed elements.
+     * @since 2.4.0
+     * @category Date
+     * @returns {number} Returns the timestamp.
      * @example
      *
-     * var array = ['a', 'b', 'c', 'd'];
-     * var pulled = _.pullAt(array, [1, 3]);
-     *
-     * console.log(array);
-     * // => ['a', 'c']
-     *
-     * console.log(pulled);
-     * // => ['b', 'd']
+     * _.defer(function(stamp) {
+     *   console.log(_.now() - stamp);
+     * }, _.now());
+     * // => Logs the number of milliseconds it took for the deferred invocation.
      */
-    var pullAt = flatRest(function(array, indexes) {
-      var length = array == null ? 0 : array.length,
-          result = baseAt(array, indexes);
-
-      basePullAt(array, arrayMap(indexes, function(index) {
-        return isIndex(index, length) ? +index : index;
-      }).sort(compareAscending));
+    var now = ctxNow || function() {
+      return root.Date.now();
+    };
 
-      return result;
-    });
+    /*------------------------------------------------------------------------*/
 
     /**
-     * Removes all elements from `array` that `predicate` returns truthy for
-     * and returns an array of the removed elements. The predicate is invoked
-     * with three arguments: (value, index, array).
-     *
-     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`
-     * to pull elements from an array by value.
+     * The opposite of `_.before`; this method creates a function that invokes
+     * `func` once it's called `n` or more times.
      *
      * @static
      * @memberOf _
-     * @since 2.0.0
-     * @category Array
-     * @param {Array} array The array to modify.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the new array of removed elements.
+     * @since 0.1.0
+     * @category Function
+     * @param {number} n The number of calls before `func` is invoked.
+     * @param {Function} func The function to restrict.
+     * @returns {Function} Returns the new restricted function.
      * @example
      *
-     * var array = [1, 2, 3, 4];
-     * var evens = _.remove(array, function(n) {
-     *   return n % 2 == 0;
-     * });
+     * var saves = ['profile', 'settings'];
      *
-     * console.log(array);
-     * // => [1, 3]
+     * var done = _.after(saves.length, function() {
+     *   console.log('done saving!');
+     * });
      *
-     * console.log(evens);
-     * // => [2, 4]
+     * _.forEach(saves, function(type) {
+     *   asyncSave({ 'type': type, 'complete': done });
+     * });
+     * // => Logs 'done saving!' after the two async saves have completed.
      */
-    function remove(array, predicate) {
-      var result = [];
-      if (!(array && array.length)) {
-        return result;
+    function after(n, func) {
+      if (typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
       }
-      var index = -1,
-          indexes = [],
-          length = array.length;
-
-      predicate = getIteratee(predicate, 3);
-      while (++index < length) {
-        var value = array[index];
-        if (predicate(value, index, array)) {
-          result.push(value);
-          indexes.push(index);
+      n = toInteger(n);
+      return function() {
+        if (--n < 1) {
+          return func.apply(this, arguments);
         }
-      }
-      basePullAt(array, indexes);
-      return result;
+      };
     }
 
     /**
-     * Reverses `array` so that the first element becomes the last, the second
-     * element becomes the second to last, and so on.
-     *
-     * **Note:** This method mutates `array` and is based on
-     * [`Array#reverse`](https://mdn.io/Array/reverse).
+     * Creates a function that invokes `func`, with up to `n` arguments,
+     * ignoring any additional arguments.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to modify.
-     * @returns {Array} Returns `array`.
+     * @since 3.0.0
+     * @category Function
+     * @param {Function} func The function to cap arguments for.
+     * @param {number} [n=func.length] The arity cap.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Function} Returns the new capped function.
      * @example
      *
-     * var array = [1, 2, 3];
-     *
-     * _.reverse(array);
-     * // => [3, 2, 1]
-     *
-     * console.log(array);
-     * // => [3, 2, 1]
+     * _.map(['6', '8', '10'], _.ary(parseInt, 1));
+     * // => [6, 8, 10]
      */
-    function reverse(array) {
-      return array == null ? array : nativeReverse.call(array);
+    function ary(func, n, guard) {
+      n = guard ? undefined$1 : n;
+      n = (func && n == null) ? func.length : n;
+      return createWrap(func, WRAP_ARY_FLAG, undefined$1, undefined$1, undefined$1, undefined$1, n);
     }
 
     /**
-     * Creates a slice of `array` from `start` up to, but not including, `end`.
-     *
-     * **Note:** This method is used instead of
-     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are
-     * returned.
+     * Creates a function that invokes `func`, with the `this` binding and arguments
+     * of the created function, while it's called less than `n` times. Subsequent
+     * calls to the created function return the result of the last `func` invocation.
      *
      * @static
      * @memberOf _
      * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to slice.
-     * @param {number} [start=0] The start position.
-     * @param {number} [end=array.length] The end position.
-     * @returns {Array} Returns the slice of `array`.
+     * @category Function
+     * @param {number} n The number of calls at which `func` is no longer invoked.
+     * @param {Function} func The function to restrict.
+     * @returns {Function} Returns the new restricted function.
+     * @example
+     *
+     * jQuery(element).on('click', _.before(5, addContactToList));
+     * // => Allows adding up to 4 contacts to the list.
      */
-    function slice(array, start, end) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return [];
-      }
-      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {
-        start = 0;
-        end = length;
-      }
-      else {
-        start = start == null ? 0 : toInteger(start);
-        end = end === undefined$1 ? length : toInteger(end);
+    function before(n, func) {
+      var result;
+      if (typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
       }
-      return baseSlice(array, start, end);
+      n = toInteger(n);
+      return function() {
+        if (--n > 0) {
+          result = func.apply(this, arguments);
+        }
+        if (n <= 1) {
+          func = undefined$1;
+        }
+        return result;
+      };
     }
 
     /**
-     * Uses a binary search to determine the lowest index at which `value`
-     * should be inserted into `array` in order to maintain its sort order.
+     * Creates a function that invokes `func` with the `this` binding of `thisArg`
+     * and `partials` prepended to the arguments it receives.
+     *
+     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,
+     * may be used as a placeholder for partially applied arguments.
+     *
+     * **Note:** Unlike native `Function#bind`, this method doesn't set the "length"
+     * property of bound functions.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Array
-     * @param {Array} array The sorted array to inspect.
-     * @param {*} value The value to evaluate.
-     * @returns {number} Returns the index at which `value` should be inserted
-     *  into `array`.
+     * @category Function
+     * @param {Function} func The function to bind.
+     * @param {*} thisArg The `this` binding of `func`.
+     * @param {...*} [partials] The arguments to be partially applied.
+     * @returns {Function} Returns the new bound function.
      * @example
      *
-     * _.sortedIndex([30, 50], 40);
-     * // => 1
+     * function greet(greeting, punctuation) {
+     *   return greeting + ' ' + this.user + punctuation;
+     * }
+     *
+     * var object = { 'user': 'fred' };
+     *
+     * var bound = _.bind(greet, object, 'hi');
+     * bound('!');
+     * // => 'hi fred!'
+     *
+     * // Bound with placeholders.
+     * var bound = _.bind(greet, object, _, '!');
+     * bound('hi');
+     * // => 'hi fred!'
      */
-    function sortedIndex(array, value) {
-      return baseSortedIndex(array, value);
-    }
+    var bind = baseRest(function(func, thisArg, partials) {
+      var bitmask = WRAP_BIND_FLAG;
+      if (partials.length) {
+        var holders = replaceHolders(partials, getHolder(bind));
+        bitmask |= WRAP_PARTIAL_FLAG;
+      }
+      return createWrap(func, bitmask, thisArg, partials, holders);
+    });
 
     /**
-     * This method is like `_.sortedIndex` except that it accepts `iteratee`
-     * which is invoked for `value` and each element of `array` to compute their
-     * sort ranking. The iteratee is invoked with one argument: (value).
+     * Creates a function that invokes the method at `object[key]` with `partials`
+     * prepended to the arguments it receives.
+     *
+     * This method differs from `_.bind` by allowing bound functions to reference
+     * methods that may be redefined or don't yet exist. See
+     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)
+     * for more details.
+     *
+     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic
+     * builds, may be used as a placeholder for partially applied arguments.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The sorted array to inspect.
-     * @param {*} value The value to evaluate.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {number} Returns the index at which `value` should be inserted
-     *  into `array`.
+     * @since 0.10.0
+     * @category Function
+     * @param {Object} object The object to invoke the method on.
+     * @param {string} key The key of the method.
+     * @param {...*} [partials] The arguments to be partially applied.
+     * @returns {Function} Returns the new bound function.
      * @example
      *
-     * var objects = [{ 'x': 4 }, { 'x': 5 }];
+     * var object = {
+     *   'user': 'fred',
+     *   'greet': function(greeting, punctuation) {
+     *     return greeting + ' ' + this.user + punctuation;
+     *   }
+     * };
      *
-     * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });
-     * // => 0
+     * var bound = _.bindKey(object, 'greet', 'hi');
+     * bound('!');
+     * // => 'hi fred!'
      *
-     * // The `_.property` iteratee shorthand.
-     * _.sortedIndexBy(objects, { 'x': 4 }, 'x');
-     * // => 0
+     * object.greet = function(greeting, punctuation) {
+     *   return greeting + 'ya ' + this.user + punctuation;
+     * };
+     *
+     * bound('!');
+     * // => 'hiya fred!'
+     *
+     * // Bound with placeholders.
+     * var bound = _.bindKey(object, 'greet', _, '!');
+     * bound('hi');
+     * // => 'hiya fred!'
      */
-    function sortedIndexBy(array, value, iteratee) {
-      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));
-    }
+    var bindKey = baseRest(function(object, key, partials) {
+      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;
+      if (partials.length) {
+        var holders = replaceHolders(partials, getHolder(bindKey));
+        bitmask |= WRAP_PARTIAL_FLAG;
+      }
+      return createWrap(key, bitmask, object, partials, holders);
+    });
 
     /**
-     * This method is like `_.indexOf` except that it performs a binary
-     * search on a sorted `array`.
+     * Creates a function that accepts arguments of `func` and either invokes
+     * `func` returning its result, if at least `arity` number of arguments have
+     * been provided, or returns a function that accepts the remaining `func`
+     * arguments, and so on. The arity of `func` may be specified if `func.length`
+     * is not sufficient.
+     *
+     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,
+     * may be used as a placeholder for provided arguments.
+     *
+     * **Note:** This method doesn't set the "length" property of curried functions.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {*} value The value to search for.
-     * @returns {number} Returns the index of the matched value, else `-1`.
+     * @since 2.0.0
+     * @category Function
+     * @param {Function} func The function to curry.
+     * @param {number} [arity=func.length] The arity of `func`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Function} Returns the new curried function.
      * @example
      *
-     * _.sortedIndexOf([4, 5, 5, 5, 6], 5);
-     * // => 1
+     * var abc = function(a, b, c) {
+     *   return [a, b, c];
+     * };
+     *
+     * var curried = _.curry(abc);
+     *
+     * curried(1)(2)(3);
+     * // => [1, 2, 3]
+     *
+     * curried(1, 2)(3);
+     * // => [1, 2, 3]
+     *
+     * curried(1, 2, 3);
+     * // => [1, 2, 3]
+     *
+     * // Curried with placeholders.
+     * curried(1)(_, 3)(2);
+     * // => [1, 2, 3]
      */
-    function sortedIndexOf(array, value) {
-      var length = array == null ? 0 : array.length;
-      if (length) {
-        var index = baseSortedIndex(array, value);
-        if (index < length && eq(array[index], value)) {
-          return index;
-        }
-      }
-      return -1;
+    function curry(func, arity, guard) {
+      arity = guard ? undefined$1 : arity;
+      var result = createWrap(func, WRAP_CURRY_FLAG, undefined$1, undefined$1, undefined$1, undefined$1, undefined$1, arity);
+      result.placeholder = curry.placeholder;
+      return result;
     }
 
     /**
-     * This method is like `_.sortedIndex` except that it returns the highest
-     * index at which `value` should be inserted into `array` in order to
-     * maintain its sort order.
+     * This method is like `_.curry` except that arguments are applied to `func`
+     * in the manner of `_.partialRight` instead of `_.partial`.
+     *
+     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic
+     * builds, may be used as a placeholder for provided arguments.
+     *
+     * **Note:** This method doesn't set the "length" property of curried functions.
      *
      * @static
      * @memberOf _
      * @since 3.0.0
-     * @category Array
-     * @param {Array} array The sorted array to inspect.
-     * @param {*} value The value to evaluate.
-     * @returns {number} Returns the index at which `value` should be inserted
-     *  into `array`.
+     * @category Function
+     * @param {Function} func The function to curry.
+     * @param {number} [arity=func.length] The arity of `func`.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Function} Returns the new curried function.
      * @example
      *
-     * _.sortedLastIndex([4, 5, 5, 5, 6], 5);
-     * // => 4
-     */
-    function sortedLastIndex(array, value) {
-      return baseSortedIndex(array, value, true);
-    }
-
-    /**
-     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`
-     * which is invoked for `value` and each element of `array` to compute their
-     * sort ranking. The iteratee is invoked with one argument: (value).
+     * var abc = function(a, b, c) {
+     *   return [a, b, c];
+     * };
      *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The sorted array to inspect.
-     * @param {*} value The value to evaluate.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {number} Returns the index at which `value` should be inserted
-     *  into `array`.
-     * @example
+     * var curried = _.curryRight(abc);
      *
-     * var objects = [{ 'x': 4 }, { 'x': 5 }];
+     * curried(3)(2)(1);
+     * // => [1, 2, 3]
      *
-     * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });
-     * // => 1
+     * curried(2, 3)(1);
+     * // => [1, 2, 3]
      *
-     * // The `_.property` iteratee shorthand.
-     * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');
-     * // => 1
+     * curried(1, 2, 3);
+     * // => [1, 2, 3]
+     *
+     * // Curried with placeholders.
+     * curried(3)(1, _)(2);
+     * // => [1, 2, 3]
      */
-    function sortedLastIndexBy(array, value, iteratee) {
-      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);
+    function curryRight(func, arity, guard) {
+      arity = guard ? undefined$1 : arity;
+      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined$1, undefined$1, undefined$1, undefined$1, undefined$1, arity);
+      result.placeholder = curryRight.placeholder;
+      return result;
     }
 
     /**
-     * This method is like `_.lastIndexOf` except that it performs a binary
-     * search on a sorted `array`.
+     * Creates a debounced function that delays invoking `func` until after `wait`
+     * milliseconds have elapsed since the last time the debounced function was
+     * invoked. The debounced function comes with a `cancel` method to cancel
+     * delayed `func` invocations and a `flush` method to immediately invoke them.
+     * Provide `options` to indicate whether `func` should be invoked on the
+     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked
+     * with the last arguments provided to the debounced function. Subsequent
+     * calls to the debounced function return the result of the last `func`
+     * invocation.
+     *
+     * **Note:** If `leading` and `trailing` options are `true`, `func` is
+     * invoked on the trailing edge of the timeout only if the debounced function
+     * is invoked more than once during the `wait` timeout.
+     *
+     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
+     * until to the next tick, similar to `setTimeout` with a timeout of `0`.
+     *
+     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
+     * for details over the differences between `_.debounce` and `_.throttle`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {*} value The value to search for.
-     * @returns {number} Returns the index of the matched value, else `-1`.
+     * @since 0.1.0
+     * @category Function
+     * @param {Function} func The function to debounce.
+     * @param {number} [wait=0] The number of milliseconds to delay.
+     * @param {Object} [options={}] The options object.
+     * @param {boolean} [options.leading=false]
+     *  Specify invoking on the leading edge of the timeout.
+     * @param {number} [options.maxWait]
+     *  The maximum time `func` is allowed to be delayed before it's invoked.
+     * @param {boolean} [options.trailing=true]
+     *  Specify invoking on the trailing edge of the timeout.
+     * @returns {Function} Returns the new debounced function.
      * @example
      *
-     * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);
-     * // => 3
+     * // Avoid costly calculations while the window size is in flux.
+     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));
+     *
+     * // Invoke `sendMail` when clicked, debouncing subsequent calls.
+     * jQuery(element).on('click', _.debounce(sendMail, 300, {
+     *   'leading': true,
+     *   'trailing': false
+     * }));
+     *
+     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.
+     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });
+     * var source = new EventSource('/stream');
+     * jQuery(source).on('message', debounced);
+     *
+     * // Cancel the trailing debounced invocation.
+     * jQuery(window).on('popstate', debounced.cancel);
      */
-    function sortedLastIndexOf(array, value) {
-      var length = array == null ? 0 : array.length;
-      if (length) {
-        var index = baseSortedIndex(array, value, true) - 1;
-        if (eq(array[index], value)) {
-          return index;
+    function debounce(func, wait, options) {
+      var lastArgs,
+          lastThis,
+          maxWait,
+          result,
+          timerId,
+          lastCallTime,
+          lastInvokeTime = 0,
+          leading = false,
+          maxing = false,
+          trailing = true;
+
+      if (typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
+      }
+      wait = toNumber(wait) || 0;
+      if (isObject(options)) {
+        leading = !!options.leading;
+        maxing = 'maxWait' in options;
+        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;
+        trailing = 'trailing' in options ? !!options.trailing : trailing;
+      }
+
+      function invokeFunc(time) {
+        var args = lastArgs,
+            thisArg = lastThis;
+
+        lastArgs = lastThis = undefined$1;
+        lastInvokeTime = time;
+        result = func.apply(thisArg, args);
+        return result;
+      }
+
+      function leadingEdge(time) {
+        // Reset any `maxWait` timer.
+        lastInvokeTime = time;
+        // Start the timer for the trailing edge.
+        timerId = setTimeout(timerExpired, wait);
+        // Invoke the leading edge.
+        return leading ? invokeFunc(time) : result;
+      }
+
+      function remainingWait(time) {
+        var timeSinceLastCall = time - lastCallTime,
+            timeSinceLastInvoke = time - lastInvokeTime,
+            timeWaiting = wait - timeSinceLastCall;
+
+        return maxing
+          ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)
+          : timeWaiting;
+      }
+
+      function shouldInvoke(time) {
+        var timeSinceLastCall = time - lastCallTime,
+            timeSinceLastInvoke = time - lastInvokeTime;
+
+        // Either this is the first call, activity has stopped and we're at the
+        // trailing edge, the system time has gone backwards and we're treating
+        // it as the trailing edge, or we've hit the `maxWait` limit.
+        return (lastCallTime === undefined$1 || (timeSinceLastCall >= wait) ||
+          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));
+      }
+
+      function timerExpired() {
+        var time = now();
+        if (shouldInvoke(time)) {
+          return trailingEdge(time);
+        }
+        // Restart the timer.
+        timerId = setTimeout(timerExpired, remainingWait(time));
+      }
+
+      function trailingEdge(time) {
+        timerId = undefined$1;
+
+        // Only invoke if we have `lastArgs` which means `func` has been
+        // debounced at least once.
+        if (trailing && lastArgs) {
+          return invokeFunc(time);
+        }
+        lastArgs = lastThis = undefined$1;
+        return result;
+      }
+
+      function cancel() {
+        if (timerId !== undefined$1) {
+          clearTimeout(timerId);
+        }
+        lastInvokeTime = 0;
+        lastArgs = lastCallTime = lastThis = timerId = undefined$1;
+      }
+
+      function flush() {
+        return timerId === undefined$1 ? result : trailingEdge(now());
+      }
+
+      function debounced() {
+        var time = now(),
+            isInvoking = shouldInvoke(time);
+
+        lastArgs = arguments;
+        lastThis = this;
+        lastCallTime = time;
+
+        if (isInvoking) {
+          if (timerId === undefined$1) {
+            return leadingEdge(lastCallTime);
+          }
+          if (maxing) {
+            // Handle invocations in a tight loop.
+            clearTimeout(timerId);
+            timerId = setTimeout(timerExpired, wait);
+            return invokeFunc(lastCallTime);
+          }
+        }
+        if (timerId === undefined$1) {
+          timerId = setTimeout(timerExpired, wait);
         }
+        return result;
       }
-      return -1;
+      debounced.cancel = cancel;
+      debounced.flush = flush;
+      return debounced;
     }
 
     /**
-     * This method is like `_.uniq` except that it's designed and optimized
-     * for sorted arrays.
+     * Defers invoking the `func` until the current call stack has cleared. Any
+     * additional arguments are provided to `func` when it's invoked.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @returns {Array} Returns the new duplicate free array.
+     * @since 0.1.0
+     * @category Function
+     * @param {Function} func The function to defer.
+     * @param {...*} [args] The arguments to invoke `func` with.
+     * @returns {number} Returns the timer id.
      * @example
      *
-     * _.sortedUniq([1, 1, 2]);
-     * // => [1, 2]
+     * _.defer(function(text) {
+     *   console.log(text);
+     * }, 'deferred');
+     * // => Logs 'deferred' after one millisecond.
      */
-    function sortedUniq(array) {
-      return (array && array.length)
-        ? baseSortedUniq(array)
-        : [];
-    }
+    var defer = baseRest(function(func, args) {
+      return baseDelay(func, 1, args);
+    });
 
     /**
-     * This method is like `_.uniqBy` except that it's designed and optimized
-     * for sorted arrays.
+     * Invokes `func` after `wait` milliseconds. Any additional arguments are
+     * provided to `func` when it's invoked.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {Function} [iteratee] The iteratee invoked per element.
-     * @returns {Array} Returns the new duplicate free array.
+     * @since 0.1.0
+     * @category Function
+     * @param {Function} func The function to delay.
+     * @param {number} wait The number of milliseconds to delay invocation.
+     * @param {...*} [args] The arguments to invoke `func` with.
+     * @returns {number} Returns the timer id.
      * @example
      *
-     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);
-     * // => [1.1, 2.3]
+     * _.delay(function(text) {
+     *   console.log(text);
+     * }, 1000, 'later');
+     * // => Logs 'later' after one second.
      */
-    function sortedUniqBy(array, iteratee) {
-      return (array && array.length)
-        ? baseSortedUniq(array, getIteratee(iteratee, 2))
-        : [];
-    }
+    var delay = baseRest(function(func, wait, args) {
+      return baseDelay(func, toNumber(wait) || 0, args);
+    });
 
     /**
-     * Gets all but the first element of `array`.
+     * Creates a function that invokes `func` with arguments reversed.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @returns {Array} Returns the slice of `array`.
+     * @category Function
+     * @param {Function} func The function to flip arguments for.
+     * @returns {Function} Returns the new flipped function.
      * @example
      *
-     * _.tail([1, 2, 3]);
-     * // => [2, 3]
+     * var flipped = _.flip(function() {
+     *   return _.toArray(arguments);
+     * });
+     *
+     * flipped('a', 'b', 'c', 'd');
+     * // => ['d', 'c', 'b', 'a']
      */
-    function tail(array) {
-      var length = array == null ? 0 : array.length;
-      return length ? baseSlice(array, 1, length) : [];
+    function flip(func) {
+      return createWrap(func, WRAP_FLIP_FLAG);
     }
 
     /**
-     * Creates a slice of `array` with `n` elements taken from the beginning.
+     * Creates a function that memoizes the result of `func`. If `resolver` is
+     * provided, it determines the cache key for storing the result based on the
+     * arguments provided to the memoized function. By default, the first argument
+     * provided to the memoized function is used as the map cache key. The `func`
+     * is invoked with the `this` binding of the memoized function.
+     *
+     * **Note:** The cache is exposed as the `cache` property on the memoized
+     * function. Its creation may be customized by replacing the `_.memoize.Cache`
+     * constructor with one whose instances implement the
+     * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)
+     * method interface of `clear`, `delete`, `get`, `has`, and `set`.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @param {number} [n=1] The number of elements to take.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Array} Returns the slice of `array`.
+     * @category Function
+     * @param {Function} func The function to have its output memoized.
+     * @param {Function} [resolver] The function to resolve the cache key.
+     * @returns {Function} Returns the new memoized function.
      * @example
      *
-     * _.take([1, 2, 3]);
-     * // => [1]
+     * var object = { 'a': 1, 'b': 2 };
+     * var other = { 'c': 3, 'd': 4 };
      *
-     * _.take([1, 2, 3], 2);
+     * var values = _.memoize(_.values);
+     * values(object);
      * // => [1, 2]
      *
-     * _.take([1, 2, 3], 5);
-     * // => [1, 2, 3]
-     *
-     * _.take([1, 2, 3], 0);
-     * // => []
-     */
-    function take(array, n, guard) {
-      if (!(array && array.length)) {
-        return [];
-      }
-      n = (guard || n === undefined$1) ? 1 : toInteger(n);
-      return baseSlice(array, 0, n < 0 ? 0 : n);
-    }
-
-    /**
-     * Creates a slice of `array` with `n` elements taken from the end.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @param {number} [n=1] The number of elements to take.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Array} Returns the slice of `array`.
-     * @example
-     *
-     * _.takeRight([1, 2, 3]);
-     * // => [3]
+     * values(other);
+     * // => [3, 4]
      *
-     * _.takeRight([1, 2, 3], 2);
-     * // => [2, 3]
+     * object.a = 2;
+     * values(object);
+     * // => [1, 2]
      *
-     * _.takeRight([1, 2, 3], 5);
-     * // => [1, 2, 3]
+     * // Modify the result cache.
+     * values.cache.set(object, ['a', 'b']);
+     * values(object);
+     * // => ['a', 'b']
      *
-     * _.takeRight([1, 2, 3], 0);
-     * // => []
+     * // Replace `_.memoize.Cache`.
+     * _.memoize.Cache = WeakMap;
      */
-    function takeRight(array, n, guard) {
-      var length = array == null ? 0 : array.length;
-      if (!length) {
-        return [];
+    function memoize(func, resolver) {
+      if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {
+        throw new TypeError(FUNC_ERROR_TEXT);
       }
-      n = (guard || n === undefined$1) ? 1 : toInteger(n);
-      n = length - n;
-      return baseSlice(array, n < 0 ? 0 : n, length);
-    }
+      var memoized = function() {
+        var args = arguments,
+            key = resolver ? resolver.apply(this, args) : args[0],
+            cache = memoized.cache;
 
-    /**
-     * Creates a slice of `array` with elements taken from the end. Elements are
-     * taken until `predicate` returns falsey. The predicate is invoked with
-     * three arguments: (value, index, array).
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the slice of `array`.
-     * @example
-     *
-     * var users = [
-     *   { 'user': 'barney',  'active': true },
-     *   { 'user': 'fred',    'active': false },
-     *   { 'user': 'pebbles', 'active': false }
-     * ];
-     *
-     * _.takeRightWhile(users, function(o) { return !o.active; });
-     * // => objects for ['fred', 'pebbles']
-     *
-     * // The `_.matches` iteratee shorthand.
-     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });
-     * // => objects for ['pebbles']
-     *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.takeRightWhile(users, ['active', false]);
-     * // => objects for ['fred', 'pebbles']
-     *
-     * // The `_.property` iteratee shorthand.
-     * _.takeRightWhile(users, 'active');
-     * // => []
-     */
-    function takeRightWhile(array, predicate) {
-      return (array && array.length)
-        ? baseWhile(array, getIteratee(predicate, 3), false, true)
-        : [];
+        if (cache.has(key)) {
+          return cache.get(key);
+        }
+        var result = func.apply(this, args);
+        memoized.cache = cache.set(key, result) || cache;
+        return result;
+      };
+      memoized.cache = new (memoize.Cache || MapCache);
+      return memoized;
     }
 
+    // Expose `MapCache`.
+    memoize.Cache = MapCache;
+
     /**
-     * Creates a slice of `array` with elements taken from the beginning. Elements
-     * are taken until `predicate` returns falsey. The predicate is invoked with
-     * three arguments: (value, index, array).
+     * Creates a function that negates the result of the predicate `func`. The
+     * `func` predicate is invoked with the `this` binding and arguments of the
+     * created function.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Array
-     * @param {Array} array The array to query.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the slice of `array`.
-     * @example
-     *
-     * var users = [
-     *   { 'user': 'barney',  'active': false },
-     *   { 'user': 'fred',    'active': false },
-     *   { 'user': 'pebbles', 'active': true }
-     * ];
-     *
-     * _.takeWhile(users, function(o) { return !o.active; });
-     * // => objects for ['barney', 'fred']
-     *
-     * // The `_.matches` iteratee shorthand.
-     * _.takeWhile(users, { 'user': 'barney', 'active': false });
-     * // => objects for ['barney']
+     * @since 3.0.0
+     * @category Function
+     * @param {Function} predicate The predicate to negate.
+     * @returns {Function} Returns the new negated function.
+     * @example
      *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.takeWhile(users, ['active', false]);
-     * // => objects for ['barney', 'fred']
+     * function isEven(n) {
+     *   return n % 2 == 0;
+     * }
      *
-     * // The `_.property` iteratee shorthand.
-     * _.takeWhile(users, 'active');
-     * // => []
+     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));
+     * // => [1, 3, 5]
      */
-    function takeWhile(array, predicate) {
-      return (array && array.length)
-        ? baseWhile(array, getIteratee(predicate, 3))
-        : [];
+    function negate(predicate) {
+      if (typeof predicate != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
+      }
+      return function() {
+        var args = arguments;
+        switch (args.length) {
+          case 0: return !predicate.call(this);
+          case 1: return !predicate.call(this, args[0]);
+          case 2: return !predicate.call(this, args[0], args[1]);
+          case 3: return !predicate.call(this, args[0], args[1], args[2]);
+        }
+        return !predicate.apply(this, args);
+      };
     }
 
     /**
-     * Creates an array of unique values, in order, from all given arrays using
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * for equality comparisons.
+     * Creates a function that is restricted to invoking `func` once. Repeat calls
+     * to the function return the value of the first invocation. The `func` is
+     * invoked with the `this` binding and arguments of the created function.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to inspect.
-     * @returns {Array} Returns the new array of combined values.
+     * @category Function
+     * @param {Function} func The function to restrict.
+     * @returns {Function} Returns the new restricted function.
      * @example
      *
-     * _.union([2], [1, 2]);
-     * // => [2, 1]
+     * var initialize = _.once(createApplication);
+     * initialize();
+     * initialize();
+     * // => `createApplication` is invoked once
      */
-    var union = baseRest(function(arrays) {
-      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));
-    });
+    function once(func) {
+      return before(2, func);
+    }
 
     /**
-     * This method is like `_.union` except that it accepts `iteratee` which is
-     * invoked for each element of each `arrays` to generate the criterion by
-     * which uniqueness is computed. Result values are chosen from the first
-     * array in which the value occurs. The iteratee is invoked with one argument:
-     * (value).
+     * Creates a function that invokes `func` with its arguments transformed.
      *
      * @static
-     * @memberOf _
      * @since 4.0.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to inspect.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {Array} Returns the new array of combined values.
+     * @memberOf _
+     * @category Function
+     * @param {Function} func The function to wrap.
+     * @param {...(Function|Function[])} [transforms=[_.identity]]
+     *  The argument transforms.
+     * @returns {Function} Returns the new function.
      * @example
      *
-     * _.unionBy([2.1], [1.2, 2.3], Math.floor);
-     * // => [2.1, 1.2]
+     * function doubled(n) {
+     *   return n * 2;
+     * }
      *
-     * // The `_.property` iteratee shorthand.
-     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
-     * // => [{ 'x': 1 }, { 'x': 2 }]
+     * function square(n) {
+     *   return n * n;
+     * }
+     *
+     * var func = _.overArgs(function(x, y) {
+     *   return [x, y];
+     * }, [square, doubled]);
+     *
+     * func(9, 3);
+     * // => [81, 6]
+     *
+     * func(10, 5);
+     * // => [100, 10]
      */
-    var unionBy = baseRest(function(arrays) {
-      var iteratee = last(arrays);
-      if (isArrayLikeObject(iteratee)) {
-        iteratee = undefined$1;
-      }
-      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));
+    var overArgs = castRest(function(func, transforms) {
+      transforms = (transforms.length == 1 && isArray(transforms[0]))
+        ? arrayMap(transforms[0], baseUnary(getIteratee()))
+        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));
+
+      var funcsLength = transforms.length;
+      return baseRest(function(args) {
+        var index = -1,
+            length = nativeMin(args.length, funcsLength);
+
+        while (++index < length) {
+          args[index] = transforms[index].call(this, args[index]);
+        }
+        return apply(func, this, args);
+      });
     });
 
     /**
-     * This method is like `_.union` except that it accepts `comparator` which
-     * is invoked to compare elements of `arrays`. Result values are chosen from
-     * the first array in which the value occurs. The comparator is invoked
-     * with two arguments: (arrVal, othVal).
+     * Creates a function that invokes `func` with `partials` prepended to the
+     * arguments it receives. This method is like `_.bind` except it does **not**
+     * alter the `this` binding.
+     *
+     * The `_.partial.placeholder` value, which defaults to `_` in monolithic
+     * builds, may be used as a placeholder for partially applied arguments.
+     *
+     * **Note:** This method doesn't set the "length" property of partially
+     * applied functions.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to inspect.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns the new array of combined values.
+     * @since 0.2.0
+     * @category Function
+     * @param {Function} func The function to partially apply arguments to.
+     * @param {...*} [partials] The arguments to be partially applied.
+     * @returns {Function} Returns the new partially applied function.
      * @example
      *
-     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
-     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     * function greet(greeting, name) {
+     *   return greeting + ' ' + name;
+     * }
      *
-     * _.unionWith(objects, others, _.isEqual);
-     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
+     * var sayHelloTo = _.partial(greet, 'hello');
+     * sayHelloTo('fred');
+     * // => 'hello fred'
+     *
+     * // Partially applied with placeholders.
+     * var greetFred = _.partial(greet, _, 'fred');
+     * greetFred('hi');
+     * // => 'hi fred'
      */
-    var unionWith = baseRest(function(arrays) {
-      var comparator = last(arrays);
-      comparator = typeof comparator == 'function' ? comparator : undefined$1;
-      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined$1, comparator);
+    var partial = baseRest(function(func, partials) {
+      var holders = replaceHolders(partials, getHolder(partial));
+      return createWrap(func, WRAP_PARTIAL_FLAG, undefined$1, partials, holders);
     });
 
     /**
-     * Creates a duplicate-free version of an array, using
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * for equality comparisons, in which only the first occurrence of each element
-     * is kept. The order of result values is determined by the order they occur
-     * in the array.
+     * This method is like `_.partial` except that partially applied arguments
+     * are appended to the arguments it receives.
+     *
+     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic
+     * builds, may be used as a placeholder for partially applied arguments.
+     *
+     * **Note:** This method doesn't set the "length" property of partially
+     * applied functions.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @returns {Array} Returns the new duplicate free array.
+     * @since 1.0.0
+     * @category Function
+     * @param {Function} func The function to partially apply arguments to.
+     * @param {...*} [partials] The arguments to be partially applied.
+     * @returns {Function} Returns the new partially applied function.
      * @example
      *
-     * _.uniq([2, 1, 2]);
-     * // => [2, 1]
+     * function greet(greeting, name) {
+     *   return greeting + ' ' + name;
+     * }
+     *
+     * var greetFred = _.partialRight(greet, 'fred');
+     * greetFred('hi');
+     * // => 'hi fred'
+     *
+     * // Partially applied with placeholders.
+     * var sayHelloTo = _.partialRight(greet, 'hello', _);
+     * sayHelloTo('fred');
+     * // => 'hello fred'
      */
-    function uniq(array) {
-      return (array && array.length) ? baseUniq(array) : [];
-    }
+    var partialRight = baseRest(function(func, partials) {
+      var holders = replaceHolders(partials, getHolder(partialRight));
+      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined$1, partials, holders);
+    });
 
     /**
-     * This method is like `_.uniq` except that it accepts `iteratee` which is
-     * invoked for each element in `array` to generate the criterion by which
-     * uniqueness is computed. The order of result values is determined by the
-     * order they occur in the array. The iteratee is invoked with one argument:
-     * (value).
+     * Creates a function that invokes `func` with arguments arranged according
+     * to the specified `indexes` where the argument value at the first index is
+     * provided as the first argument, the argument value at the second index is
+     * provided as the second argument, and so on.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {Array} Returns the new duplicate free array.
+     * @since 3.0.0
+     * @category Function
+     * @param {Function} func The function to rearrange arguments for.
+     * @param {...(number|number[])} indexes The arranged argument indexes.
+     * @returns {Function} Returns the new function.
      * @example
      *
-     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);
-     * // => [2.1, 1.2]
+     * var rearged = _.rearg(function(a, b, c) {
+     *   return [a, b, c];
+     * }, [2, 0, 1]);
      *
-     * // The `_.property` iteratee shorthand.
-     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');
-     * // => [{ 'x': 1 }, { 'x': 2 }]
+     * rearged('b', 'c', 'a')
+     * // => ['a', 'b', 'c']
      */
-    function uniqBy(array, iteratee) {
-      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];
-    }
+    var rearg = flatRest(function(func, indexes) {
+      return createWrap(func, WRAP_REARG_FLAG, undefined$1, undefined$1, undefined$1, indexes);
+    });
 
     /**
-     * This method is like `_.uniq` except that it accepts `comparator` which
-     * is invoked to compare elements of `array`. The order of result values is
-     * determined by the order they occur in the array.The comparator is invoked
-     * with two arguments: (arrVal, othVal).
+     * Creates a function that invokes `func` with the `this` binding of the
+     * created function and arguments from `start` and beyond provided as
+     * an array.
+     *
+     * **Note:** This method is based on the
+     * [rest parameter](https://mdn.io/rest_parameters).
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns the new duplicate free array.
+     * @category Function
+     * @param {Function} func The function to apply a rest parameter to.
+     * @param {number} [start=func.length-1] The start position of the rest parameter.
+     * @returns {Function} Returns the new function.
      * @example
      *
-     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     * var say = _.rest(function(what, names) {
+     *   return what + ' ' + _.initial(names).join(', ') +
+     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);
+     * });
      *
-     * _.uniqWith(objects, _.isEqual);
-     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]
+     * say('hello', 'fred', 'barney', 'pebbles');
+     * // => 'hello fred, barney, & pebbles'
      */
-    function uniqWith(array, comparator) {
-      comparator = typeof comparator == 'function' ? comparator : undefined$1;
-      return (array && array.length) ? baseUniq(array, undefined$1, comparator) : [];
+    function rest(func, start) {
+      if (typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
+      }
+      start = start === undefined$1 ? start : toInteger(start);
+      return baseRest(func, start);
     }
 
     /**
-     * This method is like `_.zip` except that it accepts an array of grouped
-     * elements and creates an array regrouping the elements to their pre-zip
-     * configuration.
+     * Creates a function that invokes `func` with the `this` binding of the
+     * create function and an array of arguments much like
+     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).
+     *
+     * **Note:** This method is based on the
+     * [spread operator](https://mdn.io/spread_operator).
      *
      * @static
      * @memberOf _
-     * @since 1.2.0
-     * @category Array
-     * @param {Array} array The array of grouped elements to process.
-     * @returns {Array} Returns the new array of regrouped elements.
+     * @since 3.2.0
+     * @category Function
+     * @param {Function} func The function to spread arguments over.
+     * @param {number} [start=0] The start position of the spread.
+     * @returns {Function} Returns the new function.
      * @example
      *
-     * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);
-     * // => [['a', 1, true], ['b', 2, false]]
+     * var say = _.spread(function(who, what) {
+     *   return who + ' says ' + what;
+     * });
      *
-     * _.unzip(zipped);
-     * // => [['a', 'b'], [1, 2], [true, false]]
+     * say(['fred', 'hello']);
+     * // => 'fred says hello'
+     *
+     * var numbers = Promise.all([
+     *   Promise.resolve(40),
+     *   Promise.resolve(36)
+     * ]);
+     *
+     * numbers.then(_.spread(function(x, y) {
+     *   return x + y;
+     * }));
+     * // => a Promise of 76
      */
-    function unzip(array) {
-      if (!(array && array.length)) {
-        return [];
+    function spread(func, start) {
+      if (typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
       }
-      var length = 0;
-      array = arrayFilter(array, function(group) {
-        if (isArrayLikeObject(group)) {
-          length = nativeMax(group.length, length);
-          return true;
+      start = start == null ? 0 : nativeMax(toInteger(start), 0);
+      return baseRest(function(args) {
+        var array = args[start],
+            otherArgs = castSlice(args, 0, start);
+
+        if (array) {
+          arrayPush(otherArgs, array);
         }
-      });
-      return baseTimes(length, function(index) {
-        return arrayMap(array, baseProperty(index));
+        return apply(func, this, otherArgs);
       });
     }
 
     /**
-     * This method is like `_.unzip` except that it accepts `iteratee` to specify
-     * how regrouped values should be combined. The iteratee is invoked with the
-     * elements of each group: (...group).
+     * Creates a throttled function that only invokes `func` at most once per
+     * every `wait` milliseconds. The throttled function comes with a `cancel`
+     * method to cancel delayed `func` invocations and a `flush` method to
+     * immediately invoke them. Provide `options` to indicate whether `func`
+     * should be invoked on the leading and/or trailing edge of the `wait`
+     * timeout. The `func` is invoked with the last arguments provided to the
+     * throttled function. Subsequent calls to the throttled function return the
+     * result of the last `func` invocation.
+     *
+     * **Note:** If `leading` and `trailing` options are `true`, `func` is
+     * invoked on the trailing edge of the timeout only if the throttled function
+     * is invoked more than once during the `wait` timeout.
+     *
+     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
+     * until to the next tick, similar to `setTimeout` with a timeout of `0`.
+     *
+     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
+     * for details over the differences between `_.throttle` and `_.debounce`.
      *
      * @static
      * @memberOf _
-     * @since 3.8.0
-     * @category Array
-     * @param {Array} array The array of grouped elements to process.
-     * @param {Function} [iteratee=_.identity] The function to combine
-     *  regrouped values.
-     * @returns {Array} Returns the new array of regrouped elements.
+     * @since 0.1.0
+     * @category Function
+     * @param {Function} func The function to throttle.
+     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.
+     * @param {Object} [options={}] The options object.
+     * @param {boolean} [options.leading=true]
+     *  Specify invoking on the leading edge of the timeout.
+     * @param {boolean} [options.trailing=true]
+     *  Specify invoking on the trailing edge of the timeout.
+     * @returns {Function} Returns the new throttled function.
      * @example
      *
-     * var zipped = _.zip([1, 2], [10, 20], [100, 200]);
-     * // => [[1, 10, 100], [2, 20, 200]]
+     * // Avoid excessively updating the position while scrolling.
+     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));
      *
-     * _.unzipWith(zipped, _.add);
-     * // => [3, 30, 300]
+     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.
+     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });
+     * jQuery(element).on('click', throttled);
+     *
+     * // Cancel the trailing throttled invocation.
+     * jQuery(window).on('popstate', throttled.cancel);
      */
-    function unzipWith(array, iteratee) {
-      if (!(array && array.length)) {
-        return [];
+    function throttle(func, wait, options) {
+      var leading = true,
+          trailing = true;
+
+      if (typeof func != 'function') {
+        throw new TypeError(FUNC_ERROR_TEXT);
       }
-      var result = unzip(array);
-      if (iteratee == null) {
-        return result;
+      if (isObject(options)) {
+        leading = 'leading' in options ? !!options.leading : leading;
+        trailing = 'trailing' in options ? !!options.trailing : trailing;
       }
-      return arrayMap(result, function(group) {
-        return apply(iteratee, undefined$1, group);
+      return debounce(func, wait, {
+        'leading': leading,
+        'maxWait': wait,
+        'trailing': trailing
       });
     }
 
     /**
-     * Creates an array excluding all given values using
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * for equality comparisons.
-     *
-     * **Note:** Unlike `_.pull`, this method returns a new array.
+     * Creates a function that accepts up to one argument, ignoring any
+     * additional arguments.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Array
-     * @param {Array} array The array to inspect.
-     * @param {...*} [values] The values to exclude.
-     * @returns {Array} Returns the new array of filtered values.
-     * @see _.difference, _.xor
+     * @since 4.0.0
+     * @category Function
+     * @param {Function} func The function to cap arguments for.
+     * @returns {Function} Returns the new capped function.
      * @example
      *
-     * _.without([2, 1, 2, 3], 1, 2);
-     * // => [3]
+     * _.map(['6', '8', '10'], _.unary(parseInt));
+     * // => [6, 8, 10]
      */
-    var without = baseRest(function(array, values) {
-      return isArrayLikeObject(array)
-        ? baseDifference(array, values)
-        : [];
-    });
+    function unary(func) {
+      return ary(func, 1);
+    }
 
     /**
-     * Creates an array of unique values that is the
-     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)
-     * of the given arrays. The order of result values is determined by the order
-     * they occur in the arrays.
+     * Creates a function that provides `value` to `wrapper` as its first
+     * argument. Any additional arguments provided to the function are appended
+     * to those provided to the `wrapper`. The wrapper is invoked with the `this`
+     * binding of the created function.
      *
      * @static
      * @memberOf _
-     * @since 2.4.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to inspect.
-     * @returns {Array} Returns the new array of filtered values.
-     * @see _.difference, _.without
+     * @since 0.1.0
+     * @category Function
+     * @param {*} value The value to wrap.
+     * @param {Function} [wrapper=identity] The wrapper function.
+     * @returns {Function} Returns the new function.
      * @example
      *
-     * _.xor([2, 1], [2, 3]);
-     * // => [1, 3]
+     * var p = _.wrap(_.escape, function(func, text) {
+     *   return '<p>' + func(text) + '</p>';
+     * });
+     *
+     * p('fred, barney, & pebbles');
+     * // => '<p>fred, barney, &amp; pebbles</p>'
      */
-    var xor = baseRest(function(arrays) {
-      return baseXor(arrayFilter(arrays, isArrayLikeObject));
-    });
+    function wrap(value, wrapper) {
+      return partial(castFunction(wrapper), value);
+    }
+
+    /*------------------------------------------------------------------------*/
 
     /**
-     * This method is like `_.xor` except that it accepts `iteratee` which is
-     * invoked for each element of each `arrays` to generate the criterion by
-     * which by which they're compared. The order of result values is determined
-     * by the order they occur in the arrays. The iteratee is invoked with one
-     * argument: (value).
+     * Casts `value` as an array if it's not one.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to inspect.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {Array} Returns the new array of filtered values.
+     * @since 4.4.0
+     * @category Lang
+     * @param {*} value The value to inspect.
+     * @returns {Array} Returns the cast array.
      * @example
      *
-     * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);
-     * // => [1.2, 3.4]
+     * _.castArray(1);
+     * // => [1]
      *
-     * // The `_.property` iteratee shorthand.
-     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');
-     * // => [{ 'x': 2 }]
-     */
-    var xorBy = baseRest(function(arrays) {
-      var iteratee = last(arrays);
-      if (isArrayLikeObject(iteratee)) {
-        iteratee = undefined$1;
-      }
-      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));
-    });
-
-    /**
-     * This method is like `_.xor` except that it accepts `comparator` which is
-     * invoked to compare elements of `arrays`. The order of result values is
-     * determined by the order they occur in the arrays. The comparator is invoked
-     * with two arguments: (arrVal, othVal).
+     * _.castArray({ 'a': 1 });
+     * // => [{ 'a': 1 }]
+     *
+     * _.castArray('abc');
+     * // => ['abc']
+     *
+     * _.castArray(null);
+     * // => [null]
      *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to inspect.
-     * @param {Function} [comparator] The comparator invoked per element.
-     * @returns {Array} Returns the new array of filtered values.
-     * @example
+     * _.castArray(undefined);
+     * // => [undefined]
      *
-     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];
-     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];
+     * _.castArray();
+     * // => []
      *
-     * _.xorWith(objects, others, _.isEqual);
-     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]
+     * var array = [1, 2, 3];
+     * console.log(_.castArray(array) === array);
+     * // => true
      */
-    var xorWith = baseRest(function(arrays) {
-      var comparator = last(arrays);
-      comparator = typeof comparator == 'function' ? comparator : undefined$1;
-      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined$1, comparator);
-    });
+    function castArray() {
+      if (!arguments.length) {
+        return [];
+      }
+      var value = arguments[0];
+      return isArray(value) ? value : [value];
+    }
 
     /**
-     * Creates an array of grouped elements, the first of which contains the
-     * first elements of the given arrays, the second of which contains the
-     * second elements of the given arrays, and so on.
+     * Creates a shallow clone of `value`.
+     *
+     * **Note:** This method is loosely based on the
+     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)
+     * and supports cloning arrays, array buffers, booleans, date objects, maps,
+     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed
+     * arrays. The own enumerable properties of `arguments` objects are cloned
+     * as plain objects. An empty object is returned for uncloneable values such
+     * as error objects, functions, DOM nodes, and WeakMaps.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to process.
-     * @returns {Array} Returns the new array of grouped elements.
+     * @category Lang
+     * @param {*} value The value to clone.
+     * @returns {*} Returns the cloned value.
+     * @see _.cloneDeep
      * @example
      *
-     * _.zip(['a', 'b'], [1, 2], [true, false]);
-     * // => [['a', 1, true], ['b', 2, false]]
+     * var objects = [{ 'a': 1 }, { 'b': 2 }];
+     *
+     * var shallow = _.clone(objects);
+     * console.log(shallow[0] === objects[0]);
+     * // => true
      */
-    var zip = baseRest(unzip);
+    function clone(value) {
+      return baseClone(value, CLONE_SYMBOLS_FLAG);
+    }
 
     /**
-     * This method is like `_.fromPairs` except that it accepts two arrays,
-     * one of property identifiers and one of corresponding values.
+     * This method is like `_.clone` except that it accepts `customizer` which
+     * is invoked to produce the cloned value. If `customizer` returns `undefined`,
+     * cloning is handled by the method instead. The `customizer` is invoked with
+     * up to four arguments; (value [, index|key, object, stack]).
      *
      * @static
      * @memberOf _
-     * @since 0.4.0
-     * @category Array
-     * @param {Array} [props=[]] The property identifiers.
-     * @param {Array} [values=[]] The property values.
-     * @returns {Object} Returns the new object.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to clone.
+     * @param {Function} [customizer] The function to customize cloning.
+     * @returns {*} Returns the cloned value.
+     * @see _.cloneDeepWith
      * @example
      *
-     * _.zipObject(['a', 'b'], [1, 2]);
-     * // => { 'a': 1, 'b': 2 }
+     * function customizer(value) {
+     *   if (_.isElement(value)) {
+     *     return value.cloneNode(false);
+     *   }
+     * }
+     *
+     * var el = _.cloneWith(document.body, customizer);
+     *
+     * console.log(el === document.body);
+     * // => false
+     * console.log(el.nodeName);
+     * // => 'BODY'
+     * console.log(el.childNodes.length);
+     * // => 0
      */
-    function zipObject(props, values) {
-      return baseZipObject(props || [], values || [], assignValue);
+    function cloneWith(value, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined$1;
+      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);
     }
 
     /**
-     * This method is like `_.zipObject` except that it supports property paths.
+     * This method is like `_.clone` except that it recursively clones `value`.
      *
      * @static
      * @memberOf _
-     * @since 4.1.0
-     * @category Array
-     * @param {Array} [props=[]] The property identifiers.
-     * @param {Array} [values=[]] The property values.
-     * @returns {Object} Returns the new object.
+     * @since 1.0.0
+     * @category Lang
+     * @param {*} value The value to recursively clone.
+     * @returns {*} Returns the deep cloned value.
+     * @see _.clone
      * @example
      *
-     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);
-     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }
+     * var objects = [{ 'a': 1 }, { 'b': 2 }];
+     *
+     * var deep = _.cloneDeep(objects);
+     * console.log(deep[0] === objects[0]);
+     * // => false
      */
-    function zipObjectDeep(props, values) {
-      return baseZipObject(props || [], values || [], baseSet);
+    function cloneDeep(value) {
+      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);
     }
 
     /**
-     * This method is like `_.zip` except that it accepts `iteratee` to specify
-     * how grouped values should be combined. The iteratee is invoked with the
-     * elements of each group: (...group).
+     * This method is like `_.cloneWith` except that it recursively clones `value`.
      *
      * @static
      * @memberOf _
-     * @since 3.8.0
-     * @category Array
-     * @param {...Array} [arrays] The arrays to process.
-     * @param {Function} [iteratee=_.identity] The function to combine
-     *  grouped values.
-     * @returns {Array} Returns the new array of grouped elements.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to recursively clone.
+     * @param {Function} [customizer] The function to customize cloning.
+     * @returns {*} Returns the deep cloned value.
+     * @see _.cloneWith
      * @example
      *
-     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {
-     *   return a + b + c;
-     * });
-     * // => [111, 222]
+     * function customizer(value) {
+     *   if (_.isElement(value)) {
+     *     return value.cloneNode(true);
+     *   }
+     * }
+     *
+     * var el = _.cloneDeepWith(document.body, customizer);
+     *
+     * console.log(el === document.body);
+     * // => false
+     * console.log(el.nodeName);
+     * // => 'BODY'
+     * console.log(el.childNodes.length);
+     * // => 20
      */
-    var zipWith = baseRest(function(arrays) {
-      var length = arrays.length,
-          iteratee = length > 1 ? arrays[length - 1] : undefined$1;
-
-      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined$1;
-      return unzipWith(arrays, iteratee);
-    });
-
-    /*------------------------------------------------------------------------*/
+    function cloneDeepWith(value, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined$1;
+      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);
+    }
 
     /**
-     * Creates a `lodash` wrapper instance that wraps `value` with explicit method
-     * chain sequences enabled. The result of such sequences must be unwrapped
-     * with `_#value`.
+     * Checks if `object` conforms to `source` by invoking the predicate
+     * properties of `source` with the corresponding property values of `object`.
+     *
+     * **Note:** This method is equivalent to `_.conforms` when `source` is
+     * partially applied.
      *
      * @static
      * @memberOf _
-     * @since 1.3.0
-     * @category Seq
-     * @param {*} value The value to wrap.
-     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @since 4.14.0
+     * @category Lang
+     * @param {Object} object The object to inspect.
+     * @param {Object} source The object of property predicates to conform to.
+     * @returns {boolean} Returns `true` if `object` conforms, else `false`.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney',  'age': 36 },
-     *   { 'user': 'fred',    'age': 40 },
-     *   { 'user': 'pebbles', 'age': 1 }
-     * ];
+     * var object = { 'a': 1, 'b': 2 };
      *
-     * var youngest = _
-     *   .chain(users)
-     *   .sortBy('age')
-     *   .map(function(o) {
-     *     return o.user + ' is ' + o.age;
-     *   })
-     *   .head()
-     *   .value();
-     * // => 'pebbles is 1'
+     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });
+     * // => true
+     *
+     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });
+     * // => false
      */
-    function chain(value) {
-      var result = lodash(value);
-      result.__chain__ = true;
-      return result;
+    function conformsTo(object, source) {
+      return source == null || baseConformsTo(object, source, keys(source));
     }
 
     /**
-     * This method invokes `interceptor` and returns `value`. The interceptor
-     * is invoked with one argument; (value). The purpose of this method is to
-     * "tap into" a method chain sequence in order to modify intermediate results.
+     * Performs a
+     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
+     * comparison between two values to determine if they are equivalent.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Seq
-     * @param {*} value The value to provide to `interceptor`.
-     * @param {Function} interceptor The function to invoke.
-     * @returns {*} Returns `value`.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
      * @example
      *
-     * _([1, 2, 3])
-     *  .tap(function(array) {
-     *    // Mutate input array.
-     *    array.pop();
-     *  })
-     *  .reverse()
-     *  .value();
-     * // => [2, 1]
-     */
-    function tap(value, interceptor) {
-      interceptor(value);
-      return value;
-    }
-
-    /**
-     * This method is like `_.tap` except that it returns the result of `interceptor`.
-     * The purpose of this method is to "pass thru" values replacing intermediate
-     * results in a method chain sequence.
+     * var object = { 'a': 1 };
+     * var other = { 'a': 1 };
+     *
+     * _.eq(object, object);
+     * // => true
+     *
+     * _.eq(object, other);
+     * // => false
+     *
+     * _.eq('a', 'a');
+     * // => true
      *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category Seq
-     * @param {*} value The value to provide to `interceptor`.
-     * @param {Function} interceptor The function to invoke.
-     * @returns {*} Returns the result of `interceptor`.
-     * @example
+     * _.eq('a', Object('a'));
+     * // => false
      *
-     * _('  abc  ')
-     *  .chain()
-     *  .trim()
-     *  .thru(function(value) {
-     *    return [value];
-     *  })
-     *  .value();
-     * // => ['abc']
+     * _.eq(NaN, NaN);
+     * // => true
      */
-    function thru(value, interceptor) {
-      return interceptor(value);
+    function eq(value, other) {
+      return value === other || (value !== value && other !== other);
     }
 
     /**
-     * This method is the wrapper version of `_.at`.
+     * Checks if `value` is greater than `other`.
      *
-     * @name at
+     * @static
      * @memberOf _
-     * @since 1.0.0
-     * @category Seq
-     * @param {...(string|string[])} [paths] The property paths to pick.
-     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @since 3.9.0
+     * @category Lang
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if `value` is greater than `other`,
+     *  else `false`.
+     * @see _.lt
      * @example
      *
-     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };
+     * _.gt(3, 1);
+     * // => true
      *
-     * _(object).at(['a[0].b.c', 'a[1]']).value();
-     * // => [3, 4]
+     * _.gt(3, 3);
+     * // => false
+     *
+     * _.gt(1, 3);
+     * // => false
      */
-    var wrapperAt = flatRest(function(paths) {
-      var length = paths.length,
-          start = length ? paths[0] : 0,
-          value = this.__wrapped__,
-          interceptor = function(object) { return baseAt(object, paths); };
-
-      if (length > 1 || this.__actions__.length ||
-          !(value instanceof LazyWrapper) || !isIndex(start)) {
-        return this.thru(interceptor);
-      }
-      value = value.slice(start, +start + (length ? 1 : 0));
-      value.__actions__.push({
-        'func': thru,
-        'args': [interceptor],
-        'thisArg': undefined$1
-      });
-      return new LodashWrapper(value, this.__chain__).thru(function(array) {
-        if (length && !array.length) {
-          array.push(undefined$1);
-        }
-        return array;
-      });
-    });
+    var gt = createRelationalOperation(baseGt);
 
     /**
-     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.
+     * Checks if `value` is greater than or equal to `other`.
      *
-     * @name chain
+     * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Seq
-     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @since 3.9.0
+     * @category Lang
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if `value` is greater than or equal to
+     *  `other`, else `false`.
+     * @see _.lte
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36 },
-     *   { 'user': 'fred',   'age': 40 }
-     * ];
+     * _.gte(3, 1);
+     * // => true
      *
-     * // A sequence without explicit chaining.
-     * _(users).head();
-     * // => { 'user': 'barney', 'age': 36 }
+     * _.gte(3, 3);
+     * // => true
      *
-     * // A sequence with explicit chaining.
-     * _(users)
-     *   .chain()
-     *   .head()
-     *   .pick('user')
-     *   .value();
-     * // => { 'user': 'barney' }
+     * _.gte(1, 3);
+     * // => false
      */
-    function wrapperChain() {
-      return chain(this);
-    }
+    var gte = createRelationalOperation(function(value, other) {
+      return value >= other;
+    });
 
     /**
-     * Executes the chain sequence and returns the wrapped result.
+     * Checks if `value` is likely an `arguments` object.
      *
-     * @name commit
+     * @static
      * @memberOf _
-     * @since 3.2.0
-     * @category Seq
-     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @since 0.1.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an `arguments` object,
+     *  else `false`.
      * @example
      *
-     * var array = [1, 2];
-     * var wrapped = _(array).push(3);
-     *
-     * console.log(array);
-     * // => [1, 2]
-     *
-     * wrapped = wrapped.commit();
-     * console.log(array);
-     * // => [1, 2, 3]
-     *
-     * wrapped.last();
-     * // => 3
+     * _.isArguments(function() { return arguments; }());
+     * // => true
      *
-     * console.log(array);
-     * // => [1, 2, 3]
+     * _.isArguments([1, 2, 3]);
+     * // => false
      */
-    function wrapperCommit() {
-      return new LodashWrapper(this.value(), this.__chain__);
-    }
+    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {
+      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&
+        !propertyIsEnumerable.call(value, 'callee');
+    };
 
     /**
-     * Gets the next value on a wrapped object following the
-     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).
+     * Checks if `value` is classified as an `Array` object.
      *
-     * @name next
+     * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Seq
-     * @returns {Object} Returns the next iterator value.
+     * @since 0.1.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an array, else `false`.
      * @example
      *
-     * var wrapped = _([1, 2]);
+     * _.isArray([1, 2, 3]);
+     * // => true
      *
-     * wrapped.next();
-     * // => { 'done': false, 'value': 1 }
+     * _.isArray(document.body.children);
+     * // => false
      *
-     * wrapped.next();
-     * // => { 'done': false, 'value': 2 }
+     * _.isArray('abc');
+     * // => false
      *
-     * wrapped.next();
-     * // => { 'done': true, 'value': undefined }
+     * _.isArray(_.noop);
+     * // => false
      */
-    function wrapperNext() {
-      if (this.__values__ === undefined$1) {
-        this.__values__ = toArray(this.value());
-      }
-      var done = this.__index__ >= this.__values__.length,
-          value = done ? undefined$1 : this.__values__[this.__index__++];
-
-      return { 'done': done, 'value': value };
-    }
+    var isArray = Array.isArray;
 
     /**
-     * Enables the wrapper to be iterable.
+     * Checks if `value` is classified as an `ArrayBuffer` object.
      *
-     * @name Symbol.iterator
+     * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Seq
-     * @returns {Object} Returns the wrapper object.
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.
      * @example
      *
-     * var wrapped = _([1, 2]);
-     *
-     * wrapped[Symbol.iterator]() === wrapped;
+     * _.isArrayBuffer(new ArrayBuffer(2));
      * // => true
      *
-     * Array.from(wrapped);
-     * // => [1, 2]
+     * _.isArrayBuffer(new Array(2));
+     * // => false
      */
-    function wrapperToIterator() {
-      return this;
-    }
+    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;
 
     /**
-     * Creates a clone of the chain sequence planting `value` as the wrapped value.
+     * Checks if `value` is array-like. A value is considered array-like if it's
+     * not a function and has a `value.length` that's an integer greater than or
+     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
      *
-     * @name plant
+     * @static
      * @memberOf _
-     * @since 3.2.0
-     * @category Seq
-     * @param {*} value The value to plant.
-     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
      * @example
      *
-     * function square(n) {
-     *   return n * n;
-     * }
-     *
-     * var wrapped = _([1, 2]).map(square);
-     * var other = wrapped.plant([3, 4]);
-     *
-     * other.value();
-     * // => [9, 16]
-     *
-     * wrapped.value();
-     * // => [1, 4]
-     */
-    function wrapperPlant(value) {
-      var result,
-          parent = this;
-
-      while (parent instanceof baseLodash) {
-        var clone = wrapperClone(parent);
-        clone.__index__ = 0;
-        clone.__values__ = undefined$1;
-        if (result) {
-          previous.__wrapped__ = clone;
-        } else {
-          result = clone;
-        }
-        var previous = clone;
-        parent = parent.__wrapped__;
-      }
-      previous.__wrapped__ = value;
-      return result;
+     * _.isArrayLike([1, 2, 3]);
+     * // => true
+     *
+     * _.isArrayLike(document.body.children);
+     * // => true
+     *
+     * _.isArrayLike('abc');
+     * // => true
+     *
+     * _.isArrayLike(_.noop);
+     * // => false
+     */
+    function isArrayLike(value) {
+      return value != null && isLength(value.length) && !isFunction(value);
     }
 
     /**
-     * This method is the wrapper version of `_.reverse`.
-     *
-     * **Note:** This method mutates the wrapped array.
+     * This method is like `_.isArrayLike` except that it also checks if `value`
+     * is an object.
      *
-     * @name reverse
+     * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Seq
-     * @returns {Object} Returns the new `lodash` wrapper instance.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an array-like object,
+     *  else `false`.
      * @example
      *
-     * var array = [1, 2, 3];
+     * _.isArrayLikeObject([1, 2, 3]);
+     * // => true
      *
-     * _(array).reverse().value()
-     * // => [3, 2, 1]
+     * _.isArrayLikeObject(document.body.children);
+     * // => true
      *
-     * console.log(array);
-     * // => [3, 2, 1]
+     * _.isArrayLikeObject('abc');
+     * // => false
+     *
+     * _.isArrayLikeObject(_.noop);
+     * // => false
      */
-    function wrapperReverse() {
-      var value = this.__wrapped__;
-      if (value instanceof LazyWrapper) {
-        var wrapped = value;
-        if (this.__actions__.length) {
-          wrapped = new LazyWrapper(this);
-        }
-        wrapped = wrapped.reverse();
-        wrapped.__actions__.push({
-          'func': thru,
-          'args': [reverse],
-          'thisArg': undefined$1
-        });
-        return new LodashWrapper(wrapped, this.__chain__);
-      }
-      return this.thru(reverse);
+    function isArrayLikeObject(value) {
+      return isObjectLike(value) && isArrayLike(value);
     }
 
     /**
-     * Executes the chain sequence to resolve the unwrapped value.
+     * Checks if `value` is classified as a boolean primitive or object.
      *
-     * @name value
+     * @static
      * @memberOf _
      * @since 0.1.0
-     * @alias toJSON, valueOf
-     * @category Seq
-     * @returns {*} Returns the resolved unwrapped value.
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.
      * @example
      *
-     * _([1, 2, 3]).value();
-     * // => [1, 2, 3]
+     * _.isBoolean(false);
+     * // => true
+     *
+     * _.isBoolean(null);
+     * // => false
      */
-    function wrapperValue() {
-      return baseWrapperValue(this.__wrapped__, this.__actions__);
+    function isBoolean(value) {
+      return value === true || value === false ||
+        (isObjectLike(value) && baseGetTag(value) == boolTag);
     }
 
-    /*------------------------------------------------------------------------*/
-
     /**
-     * Creates an object composed of keys generated from the results of running
-     * each element of `collection` thru `iteratee`. The corresponding value of
-     * each key is the number of times the key was returned by `iteratee`. The
-     * iteratee is invoked with one argument: (value).
+     * Checks if `value` is a buffer.
      *
      * @static
      * @memberOf _
-     * @since 0.5.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
-     * @returns {Object} Returns the composed aggregate object.
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.
      * @example
      *
-     * _.countBy([6.1, 4.2, 6.3], Math.floor);
-     * // => { '4': 1, '6': 2 }
+     * _.isBuffer(new Buffer(2));
+     * // => true
      *
-     * // The `_.property` iteratee shorthand.
-     * _.countBy(['one', 'two', 'three'], 'length');
-     * // => { '3': 2, '5': 1 }
+     * _.isBuffer(new Uint8Array(2));
+     * // => false
      */
-    var countBy = createAggregator(function(result, value, key) {
-      if (hasOwnProperty.call(result, key)) {
-        ++result[key];
-      } else {
-        baseAssignValue(result, key, 1);
-      }
-    });
+    var isBuffer = nativeIsBuffer || stubFalse;
 
     /**
-     * Checks if `predicate` returns truthy for **all** elements of `collection`.
-     * Iteration is stopped once `predicate` returns falsey. The predicate is
-     * invoked with three arguments: (value, index|key, collection).
-     *
-     * **Note:** This method returns `true` for
-     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because
-     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of
-     * elements of empty collections.
+     * Checks if `value` is classified as a `Date` object.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {boolean} Returns `true` if all elements pass the predicate check,
-     *  else `false`.
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.
      * @example
      *
-     * _.every([true, 1, null, 'yes'], Boolean);
-     * // => false
-     *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36, 'active': false },
-     *   { 'user': 'fred',   'age': 40, 'active': false }
-     * ];
+     * _.isDate(new Date);
+     * // => true
      *
-     * // The `_.matches` iteratee shorthand.
-     * _.every(users, { 'user': 'barney', 'active': false });
+     * _.isDate('Mon April 23 2012');
      * // => false
+     */
+    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;
+
+    /**
+     * Checks if `value` is likely a DOM element.
      *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.every(users, ['active', false]);
+     * @static
+     * @memberOf _
+     * @since 0.1.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.
+     * @example
+     *
+     * _.isElement(document.body);
      * // => true
      *
-     * // The `_.property` iteratee shorthand.
-     * _.every(users, 'active');
+     * _.isElement('<body>');
      * // => false
      */
-    function every(collection, predicate, guard) {
-      var func = isArray(collection) ? arrayEvery : baseEvery;
-      if (guard && isIterateeCall(collection, predicate, guard)) {
-        predicate = undefined$1;
-      }
-      return func(collection, getIteratee(predicate, 3));
+    function isElement(value) {
+      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);
     }
 
     /**
-     * Iterates over elements of `collection`, returning an array of all elements
-     * `predicate` returns truthy for. The predicate is invoked with three
-     * arguments: (value, index|key, collection).
+     * Checks if `value` is an empty object, collection, map, or set.
      *
-     * **Note:** Unlike `_.remove`, this method returns a new array.
+     * Objects are considered empty if they have no own enumerable string keyed
+     * properties.
+     *
+     * Array-like values such as `arguments` objects, arrays, buffers, strings, or
+     * jQuery-like collections are considered empty if they have a `length` of `0`.
+     * Similarly, maps and sets are considered empty if they have a `size` of `0`.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the new filtered array.
-     * @see _.reject
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is empty, else `false`.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36, 'active': true },
-     *   { 'user': 'fred',   'age': 40, 'active': false }
-     * ];
-     *
-     * _.filter(users, function(o) { return !o.active; });
-     * // => objects for ['fred']
+     * _.isEmpty(null);
+     * // => true
      *
-     * // The `_.matches` iteratee shorthand.
-     * _.filter(users, { 'age': 36, 'active': true });
-     * // => objects for ['barney']
+     * _.isEmpty(true);
+     * // => true
      *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.filter(users, ['active', false]);
-     * // => objects for ['fred']
+     * _.isEmpty(1);
+     * // => true
      *
-     * // The `_.property` iteratee shorthand.
-     * _.filter(users, 'active');
-     * // => objects for ['barney']
+     * _.isEmpty([1, 2, 3]);
+     * // => false
      *
-     * // Combining several predicates using `_.overEvery` or `_.overSome`.
-     * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));
-     * // => objects for ['fred', 'barney']
+     * _.isEmpty({ 'a': 1 });
+     * // => false
      */
-    function filter(collection, predicate) {
-      var func = isArray(collection) ? arrayFilter : baseFilter;
-      return func(collection, getIteratee(predicate, 3));
+    function isEmpty(value) {
+      if (value == null) {
+        return true;
+      }
+      if (isArrayLike(value) &&
+          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||
+            isBuffer(value) || isTypedArray(value) || isArguments(value))) {
+        return !value.length;
+      }
+      var tag = getTag(value);
+      if (tag == mapTag || tag == setTag) {
+        return !value.size;
+      }
+      if (isPrototype(value)) {
+        return !baseKeys(value).length;
+      }
+      for (var key in value) {
+        if (hasOwnProperty.call(value, key)) {
+          return false;
+        }
+      }
+      return true;
     }
 
     /**
-     * Iterates over elements of `collection`, returning the first element
-     * `predicate` returns truthy for. The predicate is invoked with three
-     * arguments: (value, index|key, collection).
+     * Performs a deep comparison between two values to determine if they are
+     * equivalent.
+     *
+     * **Note:** This method supports comparing arrays, array buffers, booleans,
+     * date objects, error objects, maps, numbers, `Object` objects, regexes,
+     * sets, strings, symbols, and typed arrays. `Object` objects are compared
+     * by their own, not inherited, enumerable properties. Functions and DOM
+     * nodes are compared by strict equality, i.e. `===`.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to inspect.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @param {number} [fromIndex=0] The index to search from.
-     * @returns {*} Returns the matched element, else `undefined`.
+     * @category Lang
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney',  'age': 36, 'active': true },
-     *   { 'user': 'fred',    'age': 40, 'active': false },
-     *   { 'user': 'pebbles', 'age': 1,  'active': true }
-     * ];
-     *
-     * _.find(users, function(o) { return o.age < 40; });
-     * // => object for 'barney'
-     *
-     * // The `_.matches` iteratee shorthand.
-     * _.find(users, { 'age': 1, 'active': true });
-     * // => object for 'pebbles'
-     *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.find(users, ['active', false]);
-     * // => object for 'fred'
-     *
-     * // The `_.property` iteratee shorthand.
-     * _.find(users, 'active');
-     * // => object for 'barney'
-     */
-    var find = createFind(findIndex);
-
-    /**
-     * This method is like `_.find` except that it iterates over elements of
-     * `collection` from right to left.
+     * var object = { 'a': 1 };
+     * var other = { 'a': 1 };
      *
-     * @static
-     * @memberOf _
-     * @since 2.0.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to inspect.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @param {number} [fromIndex=collection.length-1] The index to search from.
-     * @returns {*} Returns the matched element, else `undefined`.
-     * @example
+     * _.isEqual(object, other);
+     * // => true
      *
-     * _.findLast([1, 2, 3, 4], function(n) {
-     *   return n % 2 == 1;
-     * });
-     * // => 3
+     * object === other;
+     * // => false
      */
-    var findLast = createFind(findLastIndex);
+    function isEqual(value, other) {
+      return baseIsEqual(value, other);
+    }
 
     /**
-     * Creates a flattened array of values by running each element in `collection`
-     * thru `iteratee` and flattening the mapped results. The iteratee is invoked
-     * with three arguments: (value, index|key, collection).
+     * This method is like `_.isEqual` except that it accepts `customizer` which
+     * is invoked to compare values. If `customizer` returns `undefined`, comparisons
+     * are handled by the method instead. The `customizer` is invoked with up to
+     * six arguments: (objValue, othValue [, index|key, object, other, stack]).
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the new flattened array.
+     * @category Lang
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @param {Function} [customizer] The function to customize comparisons.
+     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
      * @example
      *
-     * function duplicate(n) {
-     *   return [n, n];
+     * function isGreeting(value) {
+     *   return /^h(?:i|ello)$/.test(value);
      * }
      *
-     * _.flatMap([1, 2], duplicate);
-     * // => [1, 1, 2, 2]
+     * function customizer(objValue, othValue) {
+     *   if (isGreeting(objValue) && isGreeting(othValue)) {
+     *     return true;
+     *   }
+     * }
+     *
+     * var array = ['hello', 'goodbye'];
+     * var other = ['hi', 'goodbye'];
+     *
+     * _.isEqualWith(array, other, customizer);
+     * // => true
      */
-    function flatMap(collection, iteratee) {
-      return baseFlatten(map(collection, iteratee), 1);
+    function isEqualWith(value, other, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined$1;
+      var result = customizer ? customizer(value, other) : undefined$1;
+      return result === undefined$1 ? baseIsEqual(value, other, undefined$1, customizer) : !!result;
     }
 
     /**
-     * This method is like `_.flatMap` except that it recursively flattens the
-     * mapped results.
+     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,
+     * `SyntaxError`, `TypeError`, or `URIError` object.
      *
      * @static
      * @memberOf _
-     * @since 4.7.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the new flattened array.
+     * @since 3.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an error object, else `false`.
      * @example
      *
-     * function duplicate(n) {
-     *   return [[[n, n]]];
-     * }
+     * _.isError(new Error);
+     * // => true
      *
-     * _.flatMapDeep([1, 2], duplicate);
-     * // => [1, 1, 2, 2]
+     * _.isError(Error);
+     * // => false
      */
-    function flatMapDeep(collection, iteratee) {
-      return baseFlatten(map(collection, iteratee), INFINITY);
+    function isError(value) {
+      if (!isObjectLike(value)) {
+        return false;
+      }
+      var tag = baseGetTag(value);
+      return tag == errorTag || tag == domExcTag ||
+        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));
     }
 
     /**
-     * This method is like `_.flatMap` except that it recursively flattens the
-     * mapped results up to `depth` times.
+     * Checks if `value` is a finite primitive number.
+     *
+     * **Note:** This method is based on
+     * [`Number.isFinite`](https://mdn.io/Number/isFinite).
      *
      * @static
      * @memberOf _
-     * @since 4.7.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {number} [depth=1] The maximum recursion depth.
-     * @returns {Array} Returns the new flattened array.
+     * @since 0.1.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.
      * @example
      *
-     * function duplicate(n) {
-     *   return [[[n, n]]];
-     * }
+     * _.isFinite(3);
+     * // => true
      *
-     * _.flatMapDepth([1, 2], duplicate, 2);
-     * // => [[1, 1], [2, 2]]
+     * _.isFinite(Number.MIN_VALUE);
+     * // => true
+     *
+     * _.isFinite(Infinity);
+     * // => false
+     *
+     * _.isFinite('3');
+     * // => false
      */
-    function flatMapDepth(collection, iteratee, depth) {
-      depth = depth === undefined$1 ? 1 : toInteger(depth);
-      return baseFlatten(map(collection, iteratee), depth);
+    function isFinite(value) {
+      return typeof value == 'number' && nativeIsFinite(value);
     }
 
     /**
-     * Iterates over elements of `collection` and invokes `iteratee` for each element.
-     * The iteratee is invoked with three arguments: (value, index|key, collection).
-     * Iteratee functions may exit iteration early by explicitly returning `false`.
-     *
-     * **Note:** As with other "Collections" methods, objects with a "length"
-     * property are iterated like arrays. To avoid this behavior use `_.forIn`
-     * or `_.forOwn` for object iteration.
+     * Checks if `value` is classified as a `Function` object.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @alias each
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Array|Object} Returns `collection`.
-     * @see _.forEachRight
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a function, else `false`.
      * @example
      *
-     * _.forEach([1, 2], function(value) {
-     *   console.log(value);
-     * });
-     * // => Logs `1` then `2`.
+     * _.isFunction(_);
+     * // => true
      *
-     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {
-     *   console.log(key);
-     * });
-     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
+     * _.isFunction(/abc/);
+     * // => false
      */
-    function forEach(collection, iteratee) {
-      var func = isArray(collection) ? arrayEach : baseEach;
-      return func(collection, getIteratee(iteratee, 3));
+    function isFunction(value) {
+      if (!isObject(value)) {
+        return false;
+      }
+      // The use of `Object#toString` avoids issues with the `typeof` operator
+      // in Safari 9 which returns 'object' for typed arrays and other constructors.
+      var tag = baseGetTag(value);
+      return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;
     }
 
     /**
-     * This method is like `_.forEach` except that it iterates over elements of
-     * `collection` from right to left.
+     * Checks if `value` is an integer.
+     *
+     * **Note:** This method is based on
+     * [`Number.isInteger`](https://mdn.io/Number/isInteger).
      *
      * @static
      * @memberOf _
-     * @since 2.0.0
-     * @alias eachRight
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Array|Object} Returns `collection`.
-     * @see _.forEach
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an integer, else `false`.
      * @example
      *
-     * _.forEachRight([1, 2], function(value) {
-     *   console.log(value);
-     * });
-     * // => Logs `2` then `1`.
+     * _.isInteger(3);
+     * // => true
+     *
+     * _.isInteger(Number.MIN_VALUE);
+     * // => false
+     *
+     * _.isInteger(Infinity);
+     * // => false
+     *
+     * _.isInteger('3');
+     * // => false
      */
-    function forEachRight(collection, iteratee) {
-      var func = isArray(collection) ? arrayEachRight : baseEachRight;
-      return func(collection, getIteratee(iteratee, 3));
+    function isInteger(value) {
+      return typeof value == 'number' && value == toInteger(value);
     }
 
     /**
-     * Creates an object composed of keys generated from the results of running
-     * each element of `collection` thru `iteratee`. The order of grouped values
-     * is determined by the order they occur in `collection`. The corresponding
-     * value of each key is an array of elements responsible for generating the
-     * key. The iteratee is invoked with one argument: (value).
+     * Checks if `value` is a valid array-like length.
      *
-     * @static
-     * @memberOf _
-     * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
-     * @returns {Object} Returns the composed aggregate object.
+     * **Note:** This method is loosely based on
+     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).
+     *
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.
      * @example
      *
-     * _.groupBy([6.1, 4.2, 6.3], Math.floor);
-     * // => { '4': [4.2], '6': [6.1, 6.3] }
+     * _.isLength(3);
+     * // => true
      *
-     * // The `_.property` iteratee shorthand.
-     * _.groupBy(['one', 'two', 'three'], 'length');
-     * // => { '3': ['one', 'two'], '5': ['three'] }
+     * _.isLength(Number.MIN_VALUE);
+     * // => false
+     *
+     * _.isLength(Infinity);
+     * // => false
+     *
+     * _.isLength('3');
+     * // => false
      */
-    var groupBy = createAggregator(function(result, value, key) {
-      if (hasOwnProperty.call(result, key)) {
-        result[key].push(value);
-      } else {
-        baseAssignValue(result, key, [value]);
-      }
-    });
+    function isLength(value) {
+      return typeof value == 'number' &&
+        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
+    }
 
     /**
-     * Checks if `value` is in `collection`. If `collection` is a string, it's
-     * checked for a substring of `value`, otherwise
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * is used for equality comparisons. If `fromIndex` is negative, it's used as
-     * the offset from the end of `collection`.
+     * Checks if `value` is the
+     * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)
+     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object|string} collection The collection to inspect.
-     * @param {*} value The value to search for.
-     * @param {number} [fromIndex=0] The index to search from.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.
-     * @returns {boolean} Returns `true` if `value` is found, else `false`.
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is an object, else `false`.
      * @example
      *
-     * _.includes([1, 2, 3], 1);
+     * _.isObject({});
      * // => true
      *
-     * _.includes([1, 2, 3], 1, 2);
-     * // => false
-     *
-     * _.includes({ 'a': 1, 'b': 2 }, 1);
+     * _.isObject([1, 2, 3]);
      * // => true
      *
-     * _.includes('abcd', 'bc');
+     * _.isObject(_.noop);
      * // => true
+     *
+     * _.isObject(null);
+     * // => false
      */
-    function includes(collection, value, fromIndex, guard) {
-      collection = isArrayLike(collection) ? collection : values(collection);
-      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;
-
-      var length = collection.length;
-      if (fromIndex < 0) {
-        fromIndex = nativeMax(length + fromIndex, 0);
-      }
-      return isString(collection)
-        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)
-        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);
+    function isObject(value) {
+      var type = typeof value;
+      return value != null && (type == 'object' || type == 'function');
     }
 
     /**
-     * Invokes the method at `path` of each element in `collection`, returning
-     * an array of the results of each invoked method. Any additional arguments
-     * are provided to each invoked method. If `path` is a function, it's invoked
-     * for, and `this` bound to, each element in `collection`.
+     * Checks if `value` is object-like. A value is object-like if it's not `null`
+     * and has a `typeof` result of "object".
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Array|Function|string} path The path of the method to invoke or
-     *  the function invoked per iteration.
-     * @param {...*} [args] The arguments to invoke each method with.
-     * @returns {Array} Returns the array of results.
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
      * @example
      *
-     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');
-     * // => [[1, 5, 7], [1, 2, 3]]
+     * _.isObjectLike({});
+     * // => true
      *
-     * _.invokeMap([123, 456], String.prototype.split, '');
-     * // => [['1', '2', '3'], ['4', '5', '6']]
+     * _.isObjectLike([1, 2, 3]);
+     * // => true
+     *
+     * _.isObjectLike(_.noop);
+     * // => false
+     *
+     * _.isObjectLike(null);
+     * // => false
      */
-    var invokeMap = baseRest(function(collection, path, args) {
-      var index = -1,
-          isFunc = typeof path == 'function',
-          result = isArrayLike(collection) ? Array(collection.length) : [];
-
-      baseEach(collection, function(value) {
-        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);
-      });
-      return result;
-    });
+    function isObjectLike(value) {
+      return value != null && typeof value == 'object';
+    }
 
     /**
-     * Creates an object composed of keys generated from the results of running
-     * each element of `collection` thru `iteratee`. The corresponding value of
-     * each key is the last element responsible for generating the key. The
-     * iteratee is invoked with one argument: (value).
+     * Checks if `value` is classified as a `Map` object.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.
-     * @returns {Object} Returns the composed aggregate object.
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a map, else `false`.
      * @example
      *
-     * var array = [
-     *   { 'dir': 'left', 'code': 97 },
-     *   { 'dir': 'right', 'code': 100 }
-     * ];
-     *
-     * _.keyBy(array, function(o) {
-     *   return String.fromCharCode(o.code);
-     * });
-     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }
+     * _.isMap(new Map);
+     * // => true
      *
-     * _.keyBy(array, 'dir');
-     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }
+     * _.isMap(new WeakMap);
+     * // => false
      */
-    var keyBy = createAggregator(function(result, value, key) {
-      baseAssignValue(result, key, value);
-    });
+    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;
 
     /**
-     * Creates an array of values by running each element in `collection` thru
-     * `iteratee`. The iteratee is invoked with three arguments:
-     * (value, index|key, collection).
+     * Performs a partial deep comparison between `object` and `source` to
+     * determine if `object` contains equivalent property values.
      *
-     * Many lodash methods are guarded to work as iteratees for methods like
-     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.
+     * **Note:** This method is equivalent to `_.matches` when `source` is
+     * partially applied.
      *
-     * The guarded methods are:
-     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,
-     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,
-     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,
-     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`
+     * Partial comparisons will match empty array and empty object `source`
+     * values against any array or object value, respectively. See `_.isEqual`
+     * for a list of supported value comparisons.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the new mapped array.
+     * @since 3.0.0
+     * @category Lang
+     * @param {Object} object The object to inspect.
+     * @param {Object} source The object of property values to match.
+     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
      * @example
      *
-     * function square(n) {
-     *   return n * n;
-     * }
-     *
-     * _.map([4, 8], square);
-     * // => [16, 64]
-     *
-     * _.map({ 'a': 4, 'b': 8 }, square);
-     * // => [16, 64] (iteration order is not guaranteed)
+     * var object = { 'a': 1, 'b': 2 };
      *
-     * var users = [
-     *   { 'user': 'barney' },
-     *   { 'user': 'fred' }
-     * ];
+     * _.isMatch(object, { 'b': 2 });
+     * // => true
      *
-     * // The `_.property` iteratee shorthand.
-     * _.map(users, 'user');
-     * // => ['barney', 'fred']
+     * _.isMatch(object, { 'b': 1 });
+     * // => false
      */
-    function map(collection, iteratee) {
-      var func = isArray(collection) ? arrayMap : baseMap;
-      return func(collection, getIteratee(iteratee, 3));
+    function isMatch(object, source) {
+      return object === source || baseIsMatch(object, source, getMatchData(source));
     }
 
     /**
-     * This method is like `_.sortBy` except that it allows specifying the sort
-     * orders of the iteratees to sort by. If `orders` is unspecified, all values
-     * are sorted in ascending order. Otherwise, specify an order of "desc" for
-     * descending or "asc" for ascending sort order of corresponding values.
+     * This method is like `_.isMatch` except that it accepts `customizer` which
+     * is invoked to compare values. If `customizer` returns `undefined`, comparisons
+     * are handled by the method instead. The `customizer` is invoked with five
+     * arguments: (objValue, srcValue, index|key, object, source).
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]
-     *  The iteratees to sort by.
-     * @param {string[]} [orders] The sort orders of `iteratees`.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.
-     * @returns {Array} Returns the new sorted array.
+     * @category Lang
+     * @param {Object} object The object to inspect.
+     * @param {Object} source The object of property values to match.
+     * @param {Function} [customizer] The function to customize comparisons.
+     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
      * @example
      *
-     * var users = [
-     *   { 'user': 'fred',   'age': 48 },
-     *   { 'user': 'barney', 'age': 34 },
-     *   { 'user': 'fred',   'age': 40 },
-     *   { 'user': 'barney', 'age': 36 }
-     * ];
+     * function isGreeting(value) {
+     *   return /^h(?:i|ello)$/.test(value);
+     * }
      *
-     * // Sort by `user` in ascending order and by `age` in descending order.
-     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);
-     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]
-     */
-    function orderBy(collection, iteratees, orders, guard) {
-      if (collection == null) {
-        return [];
-      }
-      if (!isArray(iteratees)) {
-        iteratees = iteratees == null ? [] : [iteratees];
-      }
-      orders = guard ? undefined$1 : orders;
-      if (!isArray(orders)) {
-        orders = orders == null ? [] : [orders];
-      }
-      return baseOrderBy(collection, iteratees, orders);
+     * function customizer(objValue, srcValue) {
+     *   if (isGreeting(objValue) && isGreeting(srcValue)) {
+     *     return true;
+     *   }
+     * }
+     *
+     * var object = { 'greeting': 'hello' };
+     * var source = { 'greeting': 'hi' };
+     *
+     * _.isMatchWith(object, source, customizer);
+     * // => true
+     */
+    function isMatchWith(object, source, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined$1;
+      return baseIsMatch(object, source, getMatchData(source), customizer);
     }
 
     /**
-     * Creates an array of elements split into two groups, the first of which
-     * contains elements `predicate` returns truthy for, the second of which
-     * contains elements `predicate` returns falsey for. The predicate is
-     * invoked with one argument: (value).
+     * Checks if `value` is `NaN`.
+     *
+     * **Note:** This method is based on
+     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as
+     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for
+     * `undefined` and other non-number values.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the array of grouped elements.
+     * @since 0.1.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney',  'age': 36, 'active': false },
-     *   { 'user': 'fred',    'age': 40, 'active': true },
-     *   { 'user': 'pebbles', 'age': 1,  'active': false }
-     * ];
-     *
-     * _.partition(users, function(o) { return o.active; });
-     * // => objects for [['fred'], ['barney', 'pebbles']]
+     * _.isNaN(NaN);
+     * // => true
      *
-     * // The `_.matches` iteratee shorthand.
-     * _.partition(users, { 'age': 1, 'active': false });
-     * // => objects for [['pebbles'], ['barney', 'fred']]
+     * _.isNaN(new Number(NaN));
+     * // => true
      *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.partition(users, ['active', false]);
-     * // => objects for [['barney', 'pebbles'], ['fred']]
+     * isNaN(undefined);
+     * // => true
      *
-     * // The `_.property` iteratee shorthand.
-     * _.partition(users, 'active');
-     * // => objects for [['fred'], ['barney', 'pebbles']]
+     * _.isNaN(undefined);
+     * // => false
      */
-    var partition = createAggregator(function(result, value, key) {
-      result[key ? 0 : 1].push(value);
-    }, function() { return [[], []]; });
+    function isNaN(value) {
+      // An `NaN` primitive is the only value that is not equal to itself.
+      // Perform the `toStringTag` check first to avoid errors with some
+      // ActiveX objects in IE.
+      return isNumber(value) && value != +value;
+    }
 
     /**
-     * Reduces `collection` to a value which is the accumulated result of running
-     * each element in `collection` thru `iteratee`, where each successive
-     * invocation is supplied the return value of the previous. If `accumulator`
-     * is not given, the first element of `collection` is used as the initial
-     * value. The iteratee is invoked with four arguments:
-     * (accumulator, value, index|key, collection).
-     *
-     * Many lodash methods are guarded to work as iteratees for methods like
-     * `_.reduce`, `_.reduceRight`, and `_.transform`.
+     * Checks if `value` is a pristine native function.
      *
-     * The guarded methods are:
-     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,
-     * and `sortBy`
+     * **Note:** This method can't reliably detect native functions in the presence
+     * of the core-js package because core-js circumvents this kind of detection.
+     * Despite multiple requests, the core-js maintainer has made it clear: any
+     * attempt to fix the detection will be obstructed. As a result, we're left
+     * with little choice but to throw an error. Unfortunately, this also affects
+     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),
+     * which rely on core-js.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [accumulator] The initial value.
-     * @returns {*} Returns the accumulated value.
-     * @see _.reduceRight
+     * @since 3.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a native function,
+     *  else `false`.
      * @example
      *
-     * _.reduce([1, 2], function(sum, n) {
-     *   return sum + n;
-     * }, 0);
-     * // => 3
+     * _.isNative(Array.prototype.push);
+     * // => true
      *
-     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
-     *   (result[value] || (result[value] = [])).push(key);
-     *   return result;
-     * }, {});
-     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)
+     * _.isNative(_);
+     * // => false
      */
-    function reduce(collection, iteratee, accumulator) {
-      var func = isArray(collection) ? arrayReduce : baseReduce,
-          initAccum = arguments.length < 3;
-
-      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);
+    function isNative(value) {
+      if (isMaskable(value)) {
+        throw new Error(CORE_ERROR_TEXT);
+      }
+      return baseIsNative(value);
     }
 
     /**
-     * This method is like `_.reduce` except that it iterates over elements of
-     * `collection` from right to left.
+     * Checks if `value` is `null`.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [accumulator] The initial value.
-     * @returns {*} Returns the accumulated value.
-     * @see _.reduce
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.
      * @example
      *
-     * var array = [[0, 1], [2, 3], [4, 5]];
+     * _.isNull(null);
+     * // => true
      *
-     * _.reduceRight(array, function(flattened, other) {
-     *   return flattened.concat(other);
-     * }, []);
-     * // => [4, 5, 2, 3, 0, 1]
+     * _.isNull(void 0);
+     * // => false
      */
-    function reduceRight(collection, iteratee, accumulator) {
-      var func = isArray(collection) ? arrayReduceRight : baseReduce,
-          initAccum = arguments.length < 3;
-
-      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);
+    function isNull(value) {
+      return value === null;
     }
 
     /**
-     * The opposite of `_.filter`; this method returns the elements of `collection`
-     * that `predicate` does **not** return truthy for.
+     * Checks if `value` is `null` or `undefined`.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the new filtered array.
-     * @see _.filter
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is nullish, else `false`.
      * @example
      *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36, 'active': false },
-     *   { 'user': 'fred',   'age': 40, 'active': true }
-     * ];
-     *
-     * _.reject(users, function(o) { return !o.active; });
-     * // => objects for ['fred']
-     *
-     * // The `_.matches` iteratee shorthand.
-     * _.reject(users, { 'age': 40, 'active': true });
-     * // => objects for ['barney']
+     * _.isNil(null);
+     * // => true
      *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.reject(users, ['active', false]);
-     * // => objects for ['fred']
+     * _.isNil(void 0);
+     * // => true
      *
-     * // The `_.property` iteratee shorthand.
-     * _.reject(users, 'active');
-     * // => objects for ['barney']
+     * _.isNil(NaN);
+     * // => false
      */
-    function reject(collection, predicate) {
-      var func = isArray(collection) ? arrayFilter : baseFilter;
-      return func(collection, negate(getIteratee(predicate, 3)));
+    function isNil(value) {
+      return value == null;
     }
 
     /**
-     * Gets a random element from `collection`.
+     * Checks if `value` is classified as a `Number` primitive or object.
+     *
+     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are
+     * classified as numbers, use the `_.isFinite` method.
      *
      * @static
      * @memberOf _
-     * @since 2.0.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to sample.
-     * @returns {*} Returns the random element.
+     * @since 0.1.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a number, else `false`.
      * @example
      *
-     * _.sample([1, 2, 3, 4]);
-     * // => 2
+     * _.isNumber(3);
+     * // => true
+     *
+     * _.isNumber(Number.MIN_VALUE);
+     * // => true
+     *
+     * _.isNumber(Infinity);
+     * // => true
+     *
+     * _.isNumber('3');
+     * // => false
      */
-    function sample(collection) {
-      var func = isArray(collection) ? arraySample : baseSample;
-      return func(collection);
+    function isNumber(value) {
+      return typeof value == 'number' ||
+        (isObjectLike(value) && baseGetTag(value) == numberTag);
     }
 
     /**
-     * Gets `n` random elements at unique keys from `collection` up to the
-     * size of `collection`.
+     * Checks if `value` is a plain object, that is, an object created by the
+     * `Object` constructor or one with a `[[Prototype]]` of `null`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to sample.
-     * @param {number} [n=1] The number of elements to sample.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Array} Returns the random elements.
+     * @since 0.8.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
      * @example
      *
-     * _.sampleSize([1, 2, 3], 2);
-     * // => [3, 1]
+     * function Foo() {
+     *   this.a = 1;
+     * }
      *
-     * _.sampleSize([1, 2, 3], 4);
-     * // => [2, 3, 1]
-     */
-    function sampleSize(collection, n, guard) {
-      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined$1)) {
-        n = 1;
-      } else {
-        n = toInteger(n);
+     * _.isPlainObject(new Foo);
+     * // => false
+     *
+     * _.isPlainObject([1, 2, 3]);
+     * // => false
+     *
+     * _.isPlainObject({ 'x': 0, 'y': 0 });
+     * // => true
+     *
+     * _.isPlainObject(Object.create(null));
+     * // => true
+     */
+    function isPlainObject(value) {
+      if (!isObjectLike(value) || baseGetTag(value) != objectTag) {
+        return false;
       }
-      var func = isArray(collection) ? arraySampleSize : baseSampleSize;
-      return func(collection, n);
+      var proto = getPrototype(value);
+      if (proto === null) {
+        return true;
+      }
+      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;
+      return typeof Ctor == 'function' && Ctor instanceof Ctor &&
+        funcToString.call(Ctor) == objectCtorString;
     }
 
     /**
-     * Creates an array of shuffled values, using a version of the
-     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).
+     * Checks if `value` is classified as a `RegExp` object.
      *
      * @static
      * @memberOf _
      * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to shuffle.
-     * @returns {Array} Returns the new shuffled array.
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.
      * @example
      *
-     * _.shuffle([1, 2, 3, 4]);
-     * // => [4, 1, 3, 2]
+     * _.isRegExp(/abc/);
+     * // => true
+     *
+     * _.isRegExp('/abc/');
+     * // => false
      */
-    function shuffle(collection) {
-      var func = isArray(collection) ? arrayShuffle : baseShuffle;
-      return func(collection);
-    }
+    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;
 
     /**
-     * Gets the size of `collection` by returning its length for array-like
-     * values or the number of own enumerable string keyed properties for objects.
+     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754
+     * double precision number which isn't the result of a rounded unsafe integer.
+     *
+     * **Note:** This method is based on
+     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object|string} collection The collection to inspect.
-     * @returns {number} Returns the collection size.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.
      * @example
      *
-     * _.size([1, 2, 3]);
-     * // => 3
+     * _.isSafeInteger(3);
+     * // => true
      *
-     * _.size({ 'a': 1, 'b': 2 });
-     * // => 2
+     * _.isSafeInteger(Number.MIN_VALUE);
+     * // => false
      *
-     * _.size('pebbles');
-     * // => 7
+     * _.isSafeInteger(Infinity);
+     * // => false
+     *
+     * _.isSafeInteger('3');
+     * // => false
      */
-    function size(collection) {
-      if (collection == null) {
-        return 0;
-      }
-      if (isArrayLike(collection)) {
-        return isString(collection) ? stringSize(collection) : collection.length;
-      }
-      var tag = getTag(collection);
-      if (tag == mapTag || tag == setTag) {
-        return collection.size;
-      }
-      return baseKeys(collection).length;
+    function isSafeInteger(value) {
+      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;
     }
 
     /**
-     * Checks if `predicate` returns truthy for **any** element of `collection`.
-     * Iteration is stopped once `predicate` returns truthy. The predicate is
-     * invoked with three arguments: (value, index|key, collection).
+     * Checks if `value` is classified as a `Set` object.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {boolean} Returns `true` if any element passes the predicate check,
-     *  else `false`.
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a set, else `false`.
      * @example
      *
-     * _.some([null, 0, 'yes', false], Boolean);
+     * _.isSet(new Set);
      * // => true
      *
-     * var users = [
-     *   { 'user': 'barney', 'active': true },
-     *   { 'user': 'fred',   'active': false }
-     * ];
-     *
-     * // The `_.matches` iteratee shorthand.
-     * _.some(users, { 'user': 'barney', 'active': false });
+     * _.isSet(new WeakSet);
      * // => false
-     *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.some(users, ['active', false]);
-     * // => true
-     *
-     * // The `_.property` iteratee shorthand.
-     * _.some(users, 'active');
-     * // => true
      */
-    function some(collection, predicate, guard) {
-      var func = isArray(collection) ? arraySome : baseSome;
-      if (guard && isIterateeCall(collection, predicate, guard)) {
-        predicate = undefined$1;
-      }
-      return func(collection, getIteratee(predicate, 3));
-    }
+    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;
 
     /**
-     * Creates an array of elements, sorted in ascending order by the results of
-     * running each element in a collection thru each iteratee. This method
-     * performs a stable sort, that is, it preserves the original sort order of
-     * equal elements. The iteratees are invoked with one argument: (value).
+     * Checks if `value` is classified as a `String` primitive or object.
      *
      * @static
-     * @memberOf _
      * @since 0.1.0
-     * @category Collection
-     * @param {Array|Object} collection The collection to iterate over.
-     * @param {...(Function|Function[])} [iteratees=[_.identity]]
-     *  The iteratees to sort by.
-     * @returns {Array} Returns the new sorted array.
+     * @memberOf _
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a string, else `false`.
      * @example
      *
-     * var users = [
-     *   { 'user': 'fred',   'age': 48 },
-     *   { 'user': 'barney', 'age': 36 },
-     *   { 'user': 'fred',   'age': 30 },
-     *   { 'user': 'barney', 'age': 34 }
-     * ];
-     *
-     * _.sortBy(users, [function(o) { return o.user; }]);
-     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]
+     * _.isString('abc');
+     * // => true
      *
-     * _.sortBy(users, ['user', 'age']);
-     * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]
+     * _.isString(1);
+     * // => false
      */
-    var sortBy = baseRest(function(collection, iteratees) {
-      if (collection == null) {
-        return [];
-      }
-      var length = iteratees.length;
-      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {
-        iteratees = [];
-      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {
-        iteratees = [iteratees[0]];
-      }
-      return baseOrderBy(collection, baseFlatten(iteratees, 1), []);
-    });
-
-    /*------------------------------------------------------------------------*/
+    function isString(value) {
+      return typeof value == 'string' ||
+        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);
+    }
 
     /**
-     * Gets the timestamp of the number of milliseconds that have elapsed since
-     * the Unix epoch (1 January 1970 00:00:00 UTC).
+     * Checks if `value` is classified as a `Symbol` primitive or object.
      *
      * @static
      * @memberOf _
-     * @since 2.4.0
-     * @category Date
-     * @returns {number} Returns the timestamp.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.
      * @example
      *
-     * _.defer(function(stamp) {
-     *   console.log(_.now() - stamp);
-     * }, _.now());
-     * // => Logs the number of milliseconds it took for the deferred invocation.
+     * _.isSymbol(Symbol.iterator);
+     * // => true
+     *
+     * _.isSymbol('abc');
+     * // => false
      */
-    var now = ctxNow || function() {
-      return root.Date.now();
-    };
-
-    /*------------------------------------------------------------------------*/
+    function isSymbol(value) {
+      return typeof value == 'symbol' ||
+        (isObjectLike(value) && baseGetTag(value) == symbolTag);
+    }
 
     /**
-     * The opposite of `_.before`; this method creates a function that invokes
-     * `func` once it's called `n` or more times.
+     * Checks if `value` is classified as a typed array.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Function
-     * @param {number} n The number of calls before `func` is invoked.
-     * @param {Function} func The function to restrict.
-     * @returns {Function} Returns the new restricted function.
+     * @since 3.0.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
      * @example
      *
-     * var saves = ['profile', 'settings'];
-     *
-     * var done = _.after(saves.length, function() {
-     *   console.log('done saving!');
-     * });
+     * _.isTypedArray(new Uint8Array);
+     * // => true
      *
-     * _.forEach(saves, function(type) {
-     *   asyncSave({ 'type': type, 'complete': done });
-     * });
-     * // => Logs 'done saving!' after the two async saves have completed.
+     * _.isTypedArray([]);
+     * // => false
      */
-    function after(n, func) {
-      if (typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      n = toInteger(n);
-      return function() {
-        if (--n < 1) {
-          return func.apply(this, arguments);
-        }
-      };
-    }
+    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;
 
     /**
-     * Creates a function that invokes `func`, with up to `n` arguments,
-     * ignoring any additional arguments.
+     * Checks if `value` is `undefined`.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 3.0.0
-     * @category Function
-     * @param {Function} func The function to cap arguments for.
-     * @param {number} [n=func.length] The arity cap.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Function} Returns the new capped function.
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.
      * @example
      *
-     * _.map(['6', '8', '10'], _.ary(parseInt, 1));
-     * // => [6, 8, 10]
-     */
-    function ary(func, n, guard) {
-      n = guard ? undefined$1 : n;
-      n = (func && n == null) ? func.length : n;
-      return createWrap(func, WRAP_ARY_FLAG, undefined$1, undefined$1, undefined$1, undefined$1, n);
+     * _.isUndefined(void 0);
+     * // => true
+     *
+     * _.isUndefined(null);
+     * // => false
+     */
+    function isUndefined(value) {
+      return value === undefined$1;
     }
 
     /**
-     * Creates a function that invokes `func`, with the `this` binding and arguments
-     * of the created function, while it's called less than `n` times. Subsequent
-     * calls to the created function return the result of the last `func` invocation.
+     * Checks if `value` is classified as a `WeakMap` object.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Function
-     * @param {number} n The number of calls at which `func` is no longer invoked.
-     * @param {Function} func The function to restrict.
-     * @returns {Function} Returns the new restricted function.
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.
      * @example
      *
-     * jQuery(element).on('click', _.before(5, addContactToList));
-     * // => Allows adding up to 4 contacts to the list.
+     * _.isWeakMap(new WeakMap);
+     * // => true
+     *
+     * _.isWeakMap(new Map);
+     * // => false
      */
-    function before(n, func) {
-      var result;
-      if (typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      n = toInteger(n);
-      return function() {
-        if (--n > 0) {
-          result = func.apply(this, arguments);
-        }
-        if (n <= 1) {
-          func = undefined$1;
-        }
-        return result;
-      };
+    function isWeakMap(value) {
+      return isObjectLike(value) && getTag(value) == weakMapTag;
     }
 
     /**
-     * Creates a function that invokes `func` with the `this` binding of `thisArg`
-     * and `partials` prepended to the arguments it receives.
-     *
-     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,
-     * may be used as a placeholder for partially applied arguments.
-     *
-     * **Note:** Unlike native `Function#bind`, this method doesn't set the "length"
-     * property of bound functions.
+     * Checks if `value` is classified as a `WeakSet` object.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Function
-     * @param {Function} func The function to bind.
-     * @param {*} thisArg The `this` binding of `func`.
-     * @param {...*} [partials] The arguments to be partially applied.
-     * @returns {Function} Returns the new bound function.
+     * @since 4.3.0
+     * @category Lang
+     * @param {*} value The value to check.
+     * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.
      * @example
      *
-     * function greet(greeting, punctuation) {
-     *   return greeting + ' ' + this.user + punctuation;
-     * }
-     *
-     * var object = { 'user': 'fred' };
-     *
-     * var bound = _.bind(greet, object, 'hi');
-     * bound('!');
-     * // => 'hi fred!'
+     * _.isWeakSet(new WeakSet);
+     * // => true
      *
-     * // Bound with placeholders.
-     * var bound = _.bind(greet, object, _, '!');
-     * bound('hi');
-     * // => 'hi fred!'
+     * _.isWeakSet(new Set);
+     * // => false
      */
-    var bind = baseRest(function(func, thisArg, partials) {
-      var bitmask = WRAP_BIND_FLAG;
-      if (partials.length) {
-        var holders = replaceHolders(partials, getHolder(bind));
-        bitmask |= WRAP_PARTIAL_FLAG;
-      }
-      return createWrap(func, bitmask, thisArg, partials, holders);
-    });
+    function isWeakSet(value) {
+      return isObjectLike(value) && baseGetTag(value) == weakSetTag;
+    }
 
     /**
-     * Creates a function that invokes the method at `object[key]` with `partials`
-     * prepended to the arguments it receives.
-     *
-     * This method differs from `_.bind` by allowing bound functions to reference
-     * methods that may be redefined or don't yet exist. See
-     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)
-     * for more details.
-     *
-     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic
-     * builds, may be used as a placeholder for partially applied arguments.
+     * Checks if `value` is less than `other`.
      *
      * @static
      * @memberOf _
-     * @since 0.10.0
-     * @category Function
-     * @param {Object} object The object to invoke the method on.
-     * @param {string} key The key of the method.
-     * @param {...*} [partials] The arguments to be partially applied.
-     * @returns {Function} Returns the new bound function.
+     * @since 3.9.0
+     * @category Lang
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if `value` is less than `other`,
+     *  else `false`.
+     * @see _.gt
      * @example
      *
-     * var object = {
-     *   'user': 'fred',
-     *   'greet': function(greeting, punctuation) {
-     *     return greeting + ' ' + this.user + punctuation;
-     *   }
-     * };
-     *
-     * var bound = _.bindKey(object, 'greet', 'hi');
-     * bound('!');
-     * // => 'hi fred!'
-     *
-     * object.greet = function(greeting, punctuation) {
-     *   return greeting + 'ya ' + this.user + punctuation;
-     * };
+     * _.lt(1, 3);
+     * // => true
      *
-     * bound('!');
-     * // => 'hiya fred!'
+     * _.lt(3, 3);
+     * // => false
      *
-     * // Bound with placeholders.
-     * var bound = _.bindKey(object, 'greet', _, '!');
-     * bound('hi');
-     * // => 'hiya fred!'
+     * _.lt(3, 1);
+     * // => false
      */
-    var bindKey = baseRest(function(object, key, partials) {
-      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;
-      if (partials.length) {
-        var holders = replaceHolders(partials, getHolder(bindKey));
-        bitmask |= WRAP_PARTIAL_FLAG;
-      }
-      return createWrap(key, bitmask, object, partials, holders);
-    });
+    var lt = createRelationalOperation(baseLt);
 
     /**
-     * Creates a function that accepts arguments of `func` and either invokes
-     * `func` returning its result, if at least `arity` number of arguments have
-     * been provided, or returns a function that accepts the remaining `func`
-     * arguments, and so on. The arity of `func` may be specified if `func.length`
-     * is not sufficient.
-     *
-     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,
-     * may be used as a placeholder for provided arguments.
-     *
-     * **Note:** This method doesn't set the "length" property of curried functions.
+     * Checks if `value` is less than or equal to `other`.
      *
      * @static
      * @memberOf _
-     * @since 2.0.0
-     * @category Function
-     * @param {Function} func The function to curry.
-     * @param {number} [arity=func.length] The arity of `func`.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Function} Returns the new curried function.
+     * @since 3.9.0
+     * @category Lang
+     * @param {*} value The value to compare.
+     * @param {*} other The other value to compare.
+     * @returns {boolean} Returns `true` if `value` is less than or equal to
+     *  `other`, else `false`.
+     * @see _.gte
      * @example
      *
-     * var abc = function(a, b, c) {
-     *   return [a, b, c];
-     * };
-     *
-     * var curried = _.curry(abc);
-     *
-     * curried(1)(2)(3);
-     * // => [1, 2, 3]
-     *
-     * curried(1, 2)(3);
-     * // => [1, 2, 3]
+     * _.lte(1, 3);
+     * // => true
      *
-     * curried(1, 2, 3);
-     * // => [1, 2, 3]
+     * _.lte(3, 3);
+     * // => true
      *
-     * // Curried with placeholders.
-     * curried(1)(_, 3)(2);
-     * // => [1, 2, 3]
+     * _.lte(3, 1);
+     * // => false
      */
-    function curry(func, arity, guard) {
-      arity = guard ? undefined$1 : arity;
-      var result = createWrap(func, WRAP_CURRY_FLAG, undefined$1, undefined$1, undefined$1, undefined$1, undefined$1, arity);
-      result.placeholder = curry.placeholder;
-      return result;
-    }
+    var lte = createRelationalOperation(function(value, other) {
+      return value <= other;
+    });
 
     /**
-     * This method is like `_.curry` except that arguments are applied to `func`
-     * in the manner of `_.partialRight` instead of `_.partial`.
-     *
-     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic
-     * builds, may be used as a placeholder for provided arguments.
-     *
-     * **Note:** This method doesn't set the "length" property of curried functions.
+     * Converts `value` to an array.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 3.0.0
-     * @category Function
-     * @param {Function} func The function to curry.
-     * @param {number} [arity=func.length] The arity of `func`.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Function} Returns the new curried function.
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {Array} Returns the converted array.
      * @example
      *
-     * var abc = function(a, b, c) {
-     *   return [a, b, c];
-     * };
-     *
-     * var curried = _.curryRight(abc);
-     *
-     * curried(3)(2)(1);
-     * // => [1, 2, 3]
+     * _.toArray({ 'a': 1, 'b': 2 });
+     * // => [1, 2]
      *
-     * curried(2, 3)(1);
-     * // => [1, 2, 3]
+     * _.toArray('abc');
+     * // => ['a', 'b', 'c']
      *
-     * curried(1, 2, 3);
-     * // => [1, 2, 3]
+     * _.toArray(1);
+     * // => []
      *
-     * // Curried with placeholders.
-     * curried(3)(1, _)(2);
-     * // => [1, 2, 3]
+     * _.toArray(null);
+     * // => []
      */
-    function curryRight(func, arity, guard) {
-      arity = guard ? undefined$1 : arity;
-      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined$1, undefined$1, undefined$1, undefined$1, undefined$1, arity);
-      result.placeholder = curryRight.placeholder;
-      return result;
+    function toArray(value) {
+      if (!value) {
+        return [];
+      }
+      if (isArrayLike(value)) {
+        return isString(value) ? stringToArray(value) : copyArray(value);
+      }
+      if (symIterator && value[symIterator]) {
+        return iteratorToArray(value[symIterator]());
+      }
+      var tag = getTag(value),
+          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);
+
+      return func(value);
     }
 
     /**
-     * Creates a debounced function that delays invoking `func` until after `wait`
-     * milliseconds have elapsed since the last time the debounced function was
-     * invoked. The debounced function comes with a `cancel` method to cancel
-     * delayed `func` invocations and a `flush` method to immediately invoke them.
-     * Provide `options` to indicate whether `func` should be invoked on the
-     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked
-     * with the last arguments provided to the debounced function. Subsequent
-     * calls to the debounced function return the result of the last `func`
-     * invocation.
-     *
-     * **Note:** If `leading` and `trailing` options are `true`, `func` is
-     * invoked on the trailing edge of the timeout only if the debounced function
-     * is invoked more than once during the `wait` timeout.
-     *
-     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
-     * until to the next tick, similar to `setTimeout` with a timeout of `0`.
-     *
-     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
-     * for details over the differences between `_.debounce` and `_.throttle`.
+     * Converts `value` to a finite number.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Function
-     * @param {Function} func The function to debounce.
-     * @param {number} [wait=0] The number of milliseconds to delay.
-     * @param {Object} [options={}] The options object.
-     * @param {boolean} [options.leading=false]
-     *  Specify invoking on the leading edge of the timeout.
-     * @param {number} [options.maxWait]
-     *  The maximum time `func` is allowed to be delayed before it's invoked.
-     * @param {boolean} [options.trailing=true]
-     *  Specify invoking on the trailing edge of the timeout.
-     * @returns {Function} Returns the new debounced function.
+     * @since 4.12.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {number} Returns the converted number.
      * @example
      *
-     * // Avoid costly calculations while the window size is in flux.
-     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));
+     * _.toFinite(3.2);
+     * // => 3.2
      *
-     * // Invoke `sendMail` when clicked, debouncing subsequent calls.
-     * jQuery(element).on('click', _.debounce(sendMail, 300, {
-     *   'leading': true,
-     *   'trailing': false
-     * }));
+     * _.toFinite(Number.MIN_VALUE);
+     * // => 5e-324
      *
-     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.
-     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });
-     * var source = new EventSource('/stream');
-     * jQuery(source).on('message', debounced);
+     * _.toFinite(Infinity);
+     * // => 1.7976931348623157e+308
      *
-     * // Cancel the trailing debounced invocation.
-     * jQuery(window).on('popstate', debounced.cancel);
+     * _.toFinite('3.2');
+     * // => 3.2
      */
-    function debounce(func, wait, options) {
-      var lastArgs,
-          lastThis,
-          maxWait,
-          result,
-          timerId,
-          lastCallTime,
-          lastInvokeTime = 0,
-          leading = false,
-          maxing = false,
-          trailing = true;
-
-      if (typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      wait = toNumber(wait) || 0;
-      if (isObject(options)) {
-        leading = !!options.leading;
-        maxing = 'maxWait' in options;
-        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;
-        trailing = 'trailing' in options ? !!options.trailing : trailing;
-      }
-
-      function invokeFunc(time) {
-        var args = lastArgs,
-            thisArg = lastThis;
-
-        lastArgs = lastThis = undefined$1;
-        lastInvokeTime = time;
-        result = func.apply(thisArg, args);
-        return result;
-      }
-
-      function leadingEdge(time) {
-        // Reset any `maxWait` timer.
-        lastInvokeTime = time;
-        // Start the timer for the trailing edge.
-        timerId = setTimeout(timerExpired, wait);
-        // Invoke the leading edge.
-        return leading ? invokeFunc(time) : result;
-      }
-
-      function remainingWait(time) {
-        var timeSinceLastCall = time - lastCallTime,
-            timeSinceLastInvoke = time - lastInvokeTime,
-            timeWaiting = wait - timeSinceLastCall;
-
-        return maxing
-          ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)
-          : timeWaiting;
-      }
-
-      function shouldInvoke(time) {
-        var timeSinceLastCall = time - lastCallTime,
-            timeSinceLastInvoke = time - lastInvokeTime;
-
-        // Either this is the first call, activity has stopped and we're at the
-        // trailing edge, the system time has gone backwards and we're treating
-        // it as the trailing edge, or we've hit the `maxWait` limit.
-        return (lastCallTime === undefined$1 || (timeSinceLastCall >= wait) ||
-          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));
-      }
-
-      function timerExpired() {
-        var time = now();
-        if (shouldInvoke(time)) {
-          return trailingEdge(time);
-        }
-        // Restart the timer.
-        timerId = setTimeout(timerExpired, remainingWait(time));
-      }
-
-      function trailingEdge(time) {
-        timerId = undefined$1;
-
-        // Only invoke if we have `lastArgs` which means `func` has been
-        // debounced at least once.
-        if (trailing && lastArgs) {
-          return invokeFunc(time);
-        }
-        lastArgs = lastThis = undefined$1;
-        return result;
-      }
-
-      function cancel() {
-        if (timerId !== undefined$1) {
-          clearTimeout(timerId);
-        }
-        lastInvokeTime = 0;
-        lastArgs = lastCallTime = lastThis = timerId = undefined$1;
-      }
-
-      function flush() {
-        return timerId === undefined$1 ? result : trailingEdge(now());
+    function toFinite(value) {
+      if (!value) {
+        return value === 0 ? value : 0;
       }
-
-      function debounced() {
-        var time = now(),
-            isInvoking = shouldInvoke(time);
-
-        lastArgs = arguments;
-        lastThis = this;
-        lastCallTime = time;
-
-        if (isInvoking) {
-          if (timerId === undefined$1) {
-            return leadingEdge(lastCallTime);
-          }
-          if (maxing) {
-            // Handle invocations in a tight loop.
-            clearTimeout(timerId);
-            timerId = setTimeout(timerExpired, wait);
-            return invokeFunc(lastCallTime);
-          }
-        }
-        if (timerId === undefined$1) {
-          timerId = setTimeout(timerExpired, wait);
-        }
-        return result;
+      value = toNumber(value);
+      if (value === INFINITY || value === -INFINITY) {
+        var sign = (value < 0 ? -1 : 1);
+        return sign * MAX_INTEGER;
       }
-      debounced.cancel = cancel;
-      debounced.flush = flush;
-      return debounced;
+      return value === value ? value : 0;
     }
 
     /**
-     * Defers invoking the `func` until the current call stack has cleared. Any
-     * additional arguments are provided to `func` when it's invoked.
+     * Converts `value` to an integer.
+     *
+     * **Note:** This method is loosely based on
+     * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Function
-     * @param {Function} func The function to defer.
-     * @param {...*} [args] The arguments to invoke `func` with.
-     * @returns {number} Returns the timer id.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {number} Returns the converted integer.
      * @example
      *
-     * _.defer(function(text) {
-     *   console.log(text);
-     * }, 'deferred');
-     * // => Logs 'deferred' after one millisecond.
+     * _.toInteger(3.2);
+     * // => 3
+     *
+     * _.toInteger(Number.MIN_VALUE);
+     * // => 0
+     *
+     * _.toInteger(Infinity);
+     * // => 1.7976931348623157e+308
+     *
+     * _.toInteger('3.2');
+     * // => 3
      */
-    var defer = baseRest(function(func, args) {
-      return baseDelay(func, 1, args);
-    });
+    function toInteger(value) {
+      var result = toFinite(value),
+          remainder = result % 1;
+
+      return result === result ? (remainder ? result - remainder : result) : 0;
+    }
 
     /**
-     * Invokes `func` after `wait` milliseconds. Any additional arguments are
-     * provided to `func` when it's invoked.
+     * Converts `value` to an integer suitable for use as the length of an
+     * array-like object.
+     *
+     * **Note:** This method is based on
+     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Function
-     * @param {Function} func The function to delay.
-     * @param {number} wait The number of milliseconds to delay invocation.
-     * @param {...*} [args] The arguments to invoke `func` with.
-     * @returns {number} Returns the timer id.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {number} Returns the converted integer.
      * @example
      *
-     * _.delay(function(text) {
-     *   console.log(text);
-     * }, 1000, 'later');
-     * // => Logs 'later' after one second.
+     * _.toLength(3.2);
+     * // => 3
+     *
+     * _.toLength(Number.MIN_VALUE);
+     * // => 0
+     *
+     * _.toLength(Infinity);
+     * // => 4294967295
+     *
+     * _.toLength('3.2');
+     * // => 3
      */
-    var delay = baseRest(function(func, wait, args) {
-      return baseDelay(func, toNumber(wait) || 0, args);
-    });
+    function toLength(value) {
+      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;
+    }
 
     /**
-     * Creates a function that invokes `func` with arguments reversed.
+     * Converts `value` to a number.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Function
-     * @param {Function} func The function to flip arguments for.
-     * @returns {Function} Returns the new flipped function.
+     * @category Lang
+     * @param {*} value The value to process.
+     * @returns {number} Returns the number.
      * @example
      *
-     * var flipped = _.flip(function() {
-     *   return _.toArray(arguments);
-     * });
+     * _.toNumber(3.2);
+     * // => 3.2
      *
-     * flipped('a', 'b', 'c', 'd');
-     * // => ['d', 'c', 'b', 'a']
+     * _.toNumber(Number.MIN_VALUE);
+     * // => 5e-324
+     *
+     * _.toNumber(Infinity);
+     * // => Infinity
+     *
+     * _.toNumber('3.2');
+     * // => 3.2
      */
-    function flip(func) {
-      return createWrap(func, WRAP_FLIP_FLAG);
+    function toNumber(value) {
+      if (typeof value == 'number') {
+        return value;
+      }
+      if (isSymbol(value)) {
+        return NAN;
+      }
+      if (isObject(value)) {
+        var other = typeof value.valueOf == 'function' ? value.valueOf() : value;
+        value = isObject(other) ? (other + '') : other;
+      }
+      if (typeof value != 'string') {
+        return value === 0 ? value : +value;
+      }
+      value = baseTrim(value);
+      var isBinary = reIsBinary.test(value);
+      return (isBinary || reIsOctal.test(value))
+        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)
+        : (reIsBadHex.test(value) ? NAN : +value);
     }
 
     /**
-     * Creates a function that memoizes the result of `func`. If `resolver` is
-     * provided, it determines the cache key for storing the result based on the
-     * arguments provided to the memoized function. By default, the first argument
-     * provided to the memoized function is used as the map cache key. The `func`
-     * is invoked with the `this` binding of the memoized function.
-     *
-     * **Note:** The cache is exposed as the `cache` property on the memoized
-     * function. Its creation may be customized by replacing the `_.memoize.Cache`
-     * constructor with one whose instances implement the
-     * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)
-     * method interface of `clear`, `delete`, `get`, `has`, and `set`.
+     * Converts `value` to a plain object flattening inherited enumerable string
+     * keyed properties of `value` to own properties of the plain object.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Function
-     * @param {Function} func The function to have its output memoized.
-     * @param {Function} [resolver] The function to resolve the cache key.
-     * @returns {Function} Returns the new memoized function.
+     * @since 3.0.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {Object} Returns the converted plain object.
      * @example
      *
-     * var object = { 'a': 1, 'b': 2 };
-     * var other = { 'c': 3, 'd': 4 };
-     *
-     * var values = _.memoize(_.values);
-     * values(object);
-     * // => [1, 2]
-     *
-     * values(other);
-     * // => [3, 4]
+     * function Foo() {
+     *   this.b = 2;
+     * }
      *
-     * object.a = 2;
-     * values(object);
-     * // => [1, 2]
+     * Foo.prototype.c = 3;
      *
-     * // Modify the result cache.
-     * values.cache.set(object, ['a', 'b']);
-     * values(object);
-     * // => ['a', 'b']
+     * _.assign({ 'a': 1 }, new Foo);
+     * // => { 'a': 1, 'b': 2 }
      *
-     * // Replace `_.memoize.Cache`.
-     * _.memoize.Cache = WeakMap;
+     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));
+     * // => { 'a': 1, 'b': 2, 'c': 3 }
      */
-    function memoize(func, resolver) {
-      if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      var memoized = function() {
-        var args = arguments,
-            key = resolver ? resolver.apply(this, args) : args[0],
-            cache = memoized.cache;
-
-        if (cache.has(key)) {
-          return cache.get(key);
-        }
-        var result = func.apply(this, args);
-        memoized.cache = cache.set(key, result) || cache;
-        return result;
-      };
-      memoized.cache = new (memoize.Cache || MapCache);
-      return memoized;
+    function toPlainObject(value) {
+      return copyObject(value, keysIn(value));
     }
 
-    // Expose `MapCache`.
-    memoize.Cache = MapCache;
-
     /**
-     * Creates a function that negates the result of the predicate `func`. The
-     * `func` predicate is invoked with the `this` binding and arguments of the
-     * created function.
+     * Converts `value` to a safe integer. A safe integer can be compared and
+     * represented correctly.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Function
-     * @param {Function} predicate The predicate to negate.
-     * @returns {Function} Returns the new negated function.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {number} Returns the converted integer.
      * @example
      *
-     * function isEven(n) {
-     *   return n % 2 == 0;
-     * }
+     * _.toSafeInteger(3.2);
+     * // => 3
      *
-     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));
-     * // => [1, 3, 5]
+     * _.toSafeInteger(Number.MIN_VALUE);
+     * // => 0
+     *
+     * _.toSafeInteger(Infinity);
+     * // => 9007199254740991
+     *
+     * _.toSafeInteger('3.2');
+     * // => 3
      */
-    function negate(predicate) {
-      if (typeof predicate != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      return function() {
-        var args = arguments;
-        switch (args.length) {
-          case 0: return !predicate.call(this);
-          case 1: return !predicate.call(this, args[0]);
-          case 2: return !predicate.call(this, args[0], args[1]);
-          case 3: return !predicate.call(this, args[0], args[1], args[2]);
-        }
-        return !predicate.apply(this, args);
-      };
+    function toSafeInteger(value) {
+      return value
+        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)
+        : (value === 0 ? value : 0);
     }
 
     /**
-     * Creates a function that is restricted to invoking `func` once. Repeat calls
-     * to the function return the value of the first invocation. The `func` is
-     * invoked with the `this` binding and arguments of the created function.
+     * Converts `value` to a string. An empty string is returned for `null`
+     * and `undefined` values. The sign of `-0` is preserved.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Function
-     * @param {Function} func The function to restrict.
-     * @returns {Function} Returns the new restricted function.
+     * @since 4.0.0
+     * @category Lang
+     * @param {*} value The value to convert.
+     * @returns {string} Returns the converted string.
      * @example
      *
-     * var initialize = _.once(createApplication);
-     * initialize();
-     * initialize();
-     * // => `createApplication` is invoked once
+     * _.toString(null);
+     * // => ''
+     *
+     * _.toString(-0);
+     * // => '-0'
+     *
+     * _.toString([1, 2, 3]);
+     * // => '1,2,3'
      */
-    function once(func) {
-      return before(2, func);
+    function toString(value) {
+      return value == null ? '' : baseToString(value);
     }
 
+    /*------------------------------------------------------------------------*/
+
     /**
-     * Creates a function that invokes `func` with its arguments transformed.
+     * Assigns own enumerable string keyed properties of source objects to the
+     * destination object. Source objects are applied from left to right.
+     * Subsequent sources overwrite property assignments of previous sources.
+     *
+     * **Note:** This method mutates `object` and is loosely based on
+     * [`Object.assign`](https://mdn.io/Object/assign).
      *
      * @static
-     * @since 4.0.0
      * @memberOf _
-     * @category Function
-     * @param {Function} func The function to wrap.
-     * @param {...(Function|Function[])} [transforms=[_.identity]]
-     *  The argument transforms.
-     * @returns {Function} Returns the new function.
+     * @since 0.10.0
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} [sources] The source objects.
+     * @returns {Object} Returns `object`.
+     * @see _.assignIn
      * @example
      *
-     * function doubled(n) {
-     *   return n * 2;
+     * function Foo() {
+     *   this.a = 1;
      * }
      *
-     * function square(n) {
-     *   return n * n;
+     * function Bar() {
+     *   this.c = 3;
      * }
      *
-     * var func = _.overArgs(function(x, y) {
-     *   return [x, y];
-     * }, [square, doubled]);
-     *
-     * func(9, 3);
-     * // => [81, 6]
+     * Foo.prototype.b = 2;
+     * Bar.prototype.d = 4;
      *
-     * func(10, 5);
-     * // => [100, 10]
-     */
-    var overArgs = castRest(function(func, transforms) {
-      transforms = (transforms.length == 1 && isArray(transforms[0]))
-        ? arrayMap(transforms[0], baseUnary(getIteratee()))
-        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));
-
-      var funcsLength = transforms.length;
-      return baseRest(function(args) {
-        var index = -1,
-            length = nativeMin(args.length, funcsLength);
-
-        while (++index < length) {
-          args[index] = transforms[index].call(this, args[index]);
+     * _.assign({ 'a': 0 }, new Foo, new Bar);
+     * // => { 'a': 1, 'c': 3 }
+     */
+    var assign = createAssigner(function(object, source) {
+      if (isPrototype(source) || isArrayLike(source)) {
+        copyObject(source, keys(source), object);
+        return;
+      }
+      for (var key in source) {
+        if (hasOwnProperty.call(source, key)) {
+          assignValue(object, key, source[key]);
         }
-        return apply(func, this, args);
-      });
+      }
     });
 
     /**
-     * Creates a function that invokes `func` with `partials` prepended to the
-     * arguments it receives. This method is like `_.bind` except it does **not**
-     * alter the `this` binding.
-     *
-     * The `_.partial.placeholder` value, which defaults to `_` in monolithic
-     * builds, may be used as a placeholder for partially applied arguments.
+     * This method is like `_.assign` except that it iterates over own and
+     * inherited source properties.
      *
-     * **Note:** This method doesn't set the "length" property of partially
-     * applied functions.
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 0.2.0
-     * @category Function
-     * @param {Function} func The function to partially apply arguments to.
-     * @param {...*} [partials] The arguments to be partially applied.
-     * @returns {Function} Returns the new partially applied function.
+     * @since 4.0.0
+     * @alias extend
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} [sources] The source objects.
+     * @returns {Object} Returns `object`.
+     * @see _.assign
      * @example
      *
-     * function greet(greeting, name) {
-     *   return greeting + ' ' + name;
+     * function Foo() {
+     *   this.a = 1;
      * }
      *
-     * var sayHelloTo = _.partial(greet, 'hello');
-     * sayHelloTo('fred');
-     * // => 'hello fred'
+     * function Bar() {
+     *   this.c = 3;
+     * }
      *
-     * // Partially applied with placeholders.
-     * var greetFred = _.partial(greet, _, 'fred');
-     * greetFred('hi');
-     * // => 'hi fred'
+     * Foo.prototype.b = 2;
+     * Bar.prototype.d = 4;
+     *
+     * _.assignIn({ 'a': 0 }, new Foo, new Bar);
+     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }
      */
-    var partial = baseRest(function(func, partials) {
-      var holders = replaceHolders(partials, getHolder(partial));
-      return createWrap(func, WRAP_PARTIAL_FLAG, undefined$1, partials, holders);
+    var assignIn = createAssigner(function(object, source) {
+      copyObject(source, keysIn(source), object);
     });
 
     /**
-     * This method is like `_.partial` except that partially applied arguments
-     * are appended to the arguments it receives.
-     *
-     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic
-     * builds, may be used as a placeholder for partially applied arguments.
+     * This method is like `_.assignIn` except that it accepts `customizer`
+     * which is invoked to produce the assigned values. If `customizer` returns
+     * `undefined`, assignment is handled by the method instead. The `customizer`
+     * is invoked with five arguments: (objValue, srcValue, key, object, source).
      *
-     * **Note:** This method doesn't set the "length" property of partially
-     * applied functions.
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 1.0.0
-     * @category Function
-     * @param {Function} func The function to partially apply arguments to.
-     * @param {...*} [partials] The arguments to be partially applied.
-     * @returns {Function} Returns the new partially applied function.
+     * @since 4.0.0
+     * @alias extendWith
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} sources The source objects.
+     * @param {Function} [customizer] The function to customize assigned values.
+     * @returns {Object} Returns `object`.
+     * @see _.assignWith
      * @example
      *
-     * function greet(greeting, name) {
-     *   return greeting + ' ' + name;
+     * function customizer(objValue, srcValue) {
+     *   return _.isUndefined(objValue) ? srcValue : objValue;
      * }
      *
-     * var greetFred = _.partialRight(greet, 'fred');
-     * greetFred('hi');
-     * // => 'hi fred'
+     * var defaults = _.partialRight(_.assignInWith, customizer);
      *
-     * // Partially applied with placeholders.
-     * var sayHelloTo = _.partialRight(greet, 'hello', _);
-     * sayHelloTo('fred');
-     * // => 'hello fred'
+     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
+     * // => { 'a': 1, 'b': 2 }
      */
-    var partialRight = baseRest(function(func, partials) {
-      var holders = replaceHolders(partials, getHolder(partialRight));
-      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined$1, partials, holders);
+    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {
+      copyObject(source, keysIn(source), object, customizer);
     });
 
     /**
-     * Creates a function that invokes `func` with arguments arranged according
-     * to the specified `indexes` where the argument value at the first index is
-     * provided as the first argument, the argument value at the second index is
-     * provided as the second argument, and so on.
+     * This method is like `_.assign` except that it accepts `customizer`
+     * which is invoked to produce the assigned values. If `customizer` returns
+     * `undefined`, assignment is handled by the method instead. The `customizer`
+     * is invoked with five arguments: (objValue, srcValue, key, object, source).
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Function
-     * @param {Function} func The function to rearrange arguments for.
-     * @param {...(number|number[])} indexes The arranged argument indexes.
-     * @returns {Function} Returns the new function.
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} sources The source objects.
+     * @param {Function} [customizer] The function to customize assigned values.
+     * @returns {Object} Returns `object`.
+     * @see _.assignInWith
      * @example
      *
-     * var rearged = _.rearg(function(a, b, c) {
-     *   return [a, b, c];
-     * }, [2, 0, 1]);
+     * function customizer(objValue, srcValue) {
+     *   return _.isUndefined(objValue) ? srcValue : objValue;
+     * }
      *
-     * rearged('b', 'c', 'a')
-     * // => ['a', 'b', 'c']
+     * var defaults = _.partialRight(_.assignWith, customizer);
+     *
+     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
+     * // => { 'a': 1, 'b': 2 }
      */
-    var rearg = flatRest(function(func, indexes) {
-      return createWrap(func, WRAP_REARG_FLAG, undefined$1, undefined$1, undefined$1, indexes);
+    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {
+      copyObject(source, keys(source), object, customizer);
     });
 
     /**
-     * Creates a function that invokes `func` with the `this` binding of the
-     * created function and arguments from `start` and beyond provided as
-     * an array.
-     *
-     * **Note:** This method is based on the
-     * [rest parameter](https://mdn.io/rest_parameters).
+     * Creates an array of values corresponding to `paths` of `object`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Function
-     * @param {Function} func The function to apply a rest parameter to.
-     * @param {number} [start=func.length-1] The start position of the rest parameter.
-     * @returns {Function} Returns the new function.
+     * @since 1.0.0
+     * @category Object
+     * @param {Object} object The object to iterate over.
+     * @param {...(string|string[])} [paths] The property paths to pick.
+     * @returns {Array} Returns the picked values.
      * @example
      *
-     * var say = _.rest(function(what, names) {
-     *   return what + ' ' + _.initial(names).join(', ') +
-     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);
-     * });
+     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };
      *
-     * say('hello', 'fred', 'barney', 'pebbles');
-     * // => 'hello fred, barney, & pebbles'
+     * _.at(object, ['a[0].b.c', 'a[1]']);
+     * // => [3, 4]
      */
-    function rest(func, start) {
-      if (typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      start = start === undefined$1 ? start : toInteger(start);
-      return baseRest(func, start);
-    }
+    var at = flatRest(baseAt);
 
     /**
-     * Creates a function that invokes `func` with the `this` binding of the
-     * create function and an array of arguments much like
-     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).
-     *
-     * **Note:** This method is based on the
-     * [spread operator](https://mdn.io/spread_operator).
+     * Creates an object that inherits from the `prototype` object. If a
+     * `properties` object is given, its own enumerable string keyed properties
+     * are assigned to the created object.
      *
      * @static
      * @memberOf _
-     * @since 3.2.0
-     * @category Function
-     * @param {Function} func The function to spread arguments over.
-     * @param {number} [start=0] The start position of the spread.
-     * @returns {Function} Returns the new function.
+     * @since 2.3.0
+     * @category Object
+     * @param {Object} prototype The object to inherit from.
+     * @param {Object} [properties] The properties to assign to the object.
+     * @returns {Object} Returns the new object.
      * @example
      *
-     * var say = _.spread(function(who, what) {
-     *   return who + ' says ' + what;
-     * });
-     *
-     * say(['fred', 'hello']);
-     * // => 'fred says hello'
+     * function Shape() {
+     *   this.x = 0;
+     *   this.y = 0;
+     * }
      *
-     * var numbers = Promise.all([
-     *   Promise.resolve(40),
-     *   Promise.resolve(36)
-     * ]);
+     * function Circle() {
+     *   Shape.call(this);
+     * }
      *
-     * numbers.then(_.spread(function(x, y) {
-     *   return x + y;
-     * }));
-     * // => a Promise of 76
-     */
-    function spread(func, start) {
-      if (typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
-      }
-      start = start == null ? 0 : nativeMax(toInteger(start), 0);
-      return baseRest(function(args) {
-        var array = args[start],
-            otherArgs = castSlice(args, 0, start);
-
-        if (array) {
-          arrayPush(otherArgs, array);
-        }
-        return apply(func, this, otherArgs);
-      });
-    }
-
-    /**
-     * Creates a throttled function that only invokes `func` at most once per
-     * every `wait` milliseconds. The throttled function comes with a `cancel`
-     * method to cancel delayed `func` invocations and a `flush` method to
-     * immediately invoke them. Provide `options` to indicate whether `func`
-     * should be invoked on the leading and/or trailing edge of the `wait`
-     * timeout. The `func` is invoked with the last arguments provided to the
-     * throttled function. Subsequent calls to the throttled function return the
-     * result of the last `func` invocation.
+     * Circle.prototype = _.create(Shape.prototype, {
+     *   'constructor': Circle
+     * });
      *
-     * **Note:** If `leading` and `trailing` options are `true`, `func` is
-     * invoked on the trailing edge of the timeout only if the throttled function
-     * is invoked more than once during the `wait` timeout.
+     * var circle = new Circle;
+     * circle instanceof Circle;
+     * // => true
      *
-     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred
-     * until to the next tick, similar to `setTimeout` with a timeout of `0`.
+     * circle instanceof Shape;
+     * // => true
+     */
+    function create(prototype, properties) {
+      var result = baseCreate(prototype);
+      return properties == null ? result : baseAssign(result, properties);
+    }
+
+    /**
+     * Assigns own and inherited enumerable string keyed properties of source
+     * objects to the destination object for all destination properties that
+     * resolve to `undefined`. Source objects are applied from left to right.
+     * Once a property is set, additional values of the same property are ignored.
      *
-     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)
-     * for details over the differences between `_.throttle` and `_.debounce`.
+     * **Note:** This method mutates `object`.
      *
      * @static
-     * @memberOf _
      * @since 0.1.0
-     * @category Function
-     * @param {Function} func The function to throttle.
-     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.
-     * @param {Object} [options={}] The options object.
-     * @param {boolean} [options.leading=true]
-     *  Specify invoking on the leading edge of the timeout.
-     * @param {boolean} [options.trailing=true]
-     *  Specify invoking on the trailing edge of the timeout.
-     * @returns {Function} Returns the new throttled function.
+     * @memberOf _
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} [sources] The source objects.
+     * @returns {Object} Returns `object`.
+     * @see _.defaultsDeep
      * @example
      *
-     * // Avoid excessively updating the position while scrolling.
-     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));
-     *
-     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.
-     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });
-     * jQuery(element).on('click', throttled);
-     *
-     * // Cancel the trailing throttled invocation.
-     * jQuery(window).on('popstate', throttled.cancel);
+     * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
+     * // => { 'a': 1, 'b': 2 }
      */
-    function throttle(func, wait, options) {
-      var leading = true,
-          trailing = true;
+    var defaults = baseRest(function(object, sources) {
+      object = Object(object);
 
-      if (typeof func != 'function') {
-        throw new TypeError(FUNC_ERROR_TEXT);
+      var index = -1;
+      var length = sources.length;
+      var guard = length > 2 ? sources[2] : undefined$1;
+
+      if (guard && isIterateeCall(sources[0], sources[1], guard)) {
+        length = 1;
       }
-      if (isObject(options)) {
-        leading = 'leading' in options ? !!options.leading : leading;
-        trailing = 'trailing' in options ? !!options.trailing : trailing;
+
+      while (++index < length) {
+        var source = sources[index];
+        var props = keysIn(source);
+        var propsIndex = -1;
+        var propsLength = props.length;
+
+        while (++propsIndex < propsLength) {
+          var key = props[propsIndex];
+          var value = object[key];
+
+          if (value === undefined$1 ||
+              (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {
+            object[key] = source[key];
+          }
+        }
       }
-      return debounce(func, wait, {
-        'leading': leading,
-        'maxWait': wait,
-        'trailing': trailing
-      });
-    }
+
+      return object;
+    });
 
     /**
-     * Creates a function that accepts up to one argument, ignoring any
-     * additional arguments.
+     * This method is like `_.defaults` except that it recursively assigns
+     * default properties.
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Function
-     * @param {Function} func The function to cap arguments for.
-     * @returns {Function} Returns the new capped function.
+     * @since 3.10.0
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} [sources] The source objects.
+     * @returns {Object} Returns `object`.
+     * @see _.defaults
      * @example
      *
-     * _.map(['6', '8', '10'], _.unary(parseInt));
-     * // => [6, 8, 10]
+     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });
+     * // => { 'a': { 'b': 2, 'c': 3 } }
      */
-    function unary(func) {
-      return ary(func, 1);
-    }
+    var defaultsDeep = baseRest(function(args) {
+      args.push(undefined$1, customDefaultsMerge);
+      return apply(mergeWith, undefined$1, args);
+    });
 
     /**
-     * Creates a function that provides `value` to `wrapper` as its first
-     * argument. Any additional arguments provided to the function are appended
-     * to those provided to the `wrapper`. The wrapper is invoked with the `this`
-     * binding of the created function.
+     * This method is like `_.find` except that it returns the key of the first
+     * element `predicate` returns truthy for instead of the element itself.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Function
-     * @param {*} value The value to wrap.
-     * @param {Function} [wrapper=identity] The wrapper function.
-     * @returns {Function} Returns the new function.
+     * @since 1.1.0
+     * @category Object
+     * @param {Object} object The object to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {string|undefined} Returns the key of the matched element,
+     *  else `undefined`.
      * @example
      *
-     * var p = _.wrap(_.escape, function(func, text) {
-     *   return '<p>' + func(text) + '</p>';
-     * });
+     * var users = {
+     *   'barney':  { 'age': 36, 'active': true },
+     *   'fred':    { 'age': 40, 'active': false },
+     *   'pebbles': { 'age': 1,  'active': true }
+     * };
      *
-     * p('fred, barney, & pebbles');
-     * // => '<p>fred, barney, &amp; pebbles</p>'
+     * _.findKey(users, function(o) { return o.age < 40; });
+     * // => 'barney' (iteration order is not guaranteed)
+     *
+     * // The `_.matches` iteratee shorthand.
+     * _.findKey(users, { 'age': 1, 'active': true });
+     * // => 'pebbles'
+     *
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.findKey(users, ['active', false]);
+     * // => 'fred'
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.findKey(users, 'active');
+     * // => 'barney'
      */
-    function wrap(value, wrapper) {
-      return partial(castFunction(wrapper), value);
+    function findKey(object, predicate) {
+      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);
     }
 
-    /*------------------------------------------------------------------------*/
-
     /**
-     * Casts `value` as an array if it's not one.
+     * This method is like `_.findKey` except that it iterates over elements of
+     * a collection in the opposite order.
      *
      * @static
      * @memberOf _
-     * @since 4.4.0
-     * @category Lang
-     * @param {*} value The value to inspect.
-     * @returns {Array} Returns the cast array.
+     * @since 2.0.0
+     * @category Object
+     * @param {Object} object The object to inspect.
+     * @param {Function} [predicate=_.identity] The function invoked per iteration.
+     * @returns {string|undefined} Returns the key of the matched element,
+     *  else `undefined`.
      * @example
      *
-     * _.castArray(1);
-     * // => [1]
+     * var users = {
+     *   'barney':  { 'age': 36, 'active': true },
+     *   'fred':    { 'age': 40, 'active': false },
+     *   'pebbles': { 'age': 1,  'active': true }
+     * };
      *
-     * _.castArray({ 'a': 1 });
-     * // => [{ 'a': 1 }]
+     * _.findLastKey(users, function(o) { return o.age < 40; });
+     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'
      *
-     * _.castArray('abc');
-     * // => ['abc']
+     * // The `_.matches` iteratee shorthand.
+     * _.findLastKey(users, { 'age': 36, 'active': true });
+     * // => 'barney'
      *
-     * _.castArray(null);
-     * // => [null]
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.findLastKey(users, ['active', false]);
+     * // => 'fred'
      *
-     * _.castArray(undefined);
-     * // => [undefined]
+     * // The `_.property` iteratee shorthand.
+     * _.findLastKey(users, 'active');
+     * // => 'pebbles'
+     */
+    function findLastKey(object, predicate) {
+      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);
+    }
+
+    /**
+     * Iterates over own and inherited enumerable string keyed properties of an
+     * object and invokes `iteratee` for each property. The iteratee is invoked
+     * with three arguments: (value, key, object). Iteratee functions may exit
+     * iteration early by explicitly returning `false`.
      *
-     * _.castArray();
-     * // => []
+     * @static
+     * @memberOf _
+     * @since 0.3.0
+     * @category Object
+     * @param {Object} object The object to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Object} Returns `object`.
+     * @see _.forInRight
+     * @example
      *
-     * var array = [1, 2, 3];
-     * console.log(_.castArray(array) === array);
-     * // => true
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
+     *
+     * Foo.prototype.c = 3;
+     *
+     * _.forIn(new Foo, function(value, key) {
+     *   console.log(key);
+     * });
+     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).
      */
-    function castArray() {
-      if (!arguments.length) {
-        return [];
-      }
-      var value = arguments[0];
-      return isArray(value) ? value : [value];
+    function forIn(object, iteratee) {
+      return object == null
+        ? object
+        : baseFor(object, getIteratee(iteratee, 3), keysIn);
     }
 
     /**
-     * Creates a shallow clone of `value`.
-     *
-     * **Note:** This method is loosely based on the
-     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)
-     * and supports cloning arrays, array buffers, booleans, date objects, maps,
-     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed
-     * arrays. The own enumerable properties of `arguments` objects are cloned
-     * as plain objects. An empty object is returned for uncloneable values such
-     * as error objects, functions, DOM nodes, and WeakMaps.
+     * This method is like `_.forIn` except that it iterates over properties of
+     * `object` in the opposite order.
      *
      * @static
-     * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to clone.
-     * @returns {*} Returns the cloned value.
-     * @see _.cloneDeep
+     * @memberOf _
+     * @since 2.0.0
+     * @category Object
+     * @param {Object} object The object to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Object} Returns `object`.
+     * @see _.forIn
      * @example
      *
-     * var objects = [{ 'a': 1 }, { 'b': 2 }];
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
      *
-     * var shallow = _.clone(objects);
-     * console.log(shallow[0] === objects[0]);
-     * // => true
+     * Foo.prototype.c = 3;
+     *
+     * _.forInRight(new Foo, function(value, key) {
+     *   console.log(key);
+     * });
+     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.
      */
-    function clone(value) {
-      return baseClone(value, CLONE_SYMBOLS_FLAG);
+    function forInRight(object, iteratee) {
+      return object == null
+        ? object
+        : baseForRight(object, getIteratee(iteratee, 3), keysIn);
     }
 
     /**
-     * This method is like `_.clone` except that it accepts `customizer` which
-     * is invoked to produce the cloned value. If `customizer` returns `undefined`,
-     * cloning is handled by the method instead. The `customizer` is invoked with
-     * up to four arguments; (value [, index|key, object, stack]).
+     * Iterates over own enumerable string keyed properties of an object and
+     * invokes `iteratee` for each property. The iteratee is invoked with three
+     * arguments: (value, key, object). Iteratee functions may exit iteration
+     * early by explicitly returning `false`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to clone.
-     * @param {Function} [customizer] The function to customize cloning.
-     * @returns {*} Returns the cloned value.
-     * @see _.cloneDeepWith
+     * @since 0.3.0
+     * @category Object
+     * @param {Object} object The object to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Object} Returns `object`.
+     * @see _.forOwnRight
      * @example
      *
-     * function customizer(value) {
-     *   if (_.isElement(value)) {
-     *     return value.cloneNode(false);
-     *   }
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
      * }
      *
-     * var el = _.cloneWith(document.body, customizer);
+     * Foo.prototype.c = 3;
      *
-     * console.log(el === document.body);
-     * // => false
-     * console.log(el.nodeName);
-     * // => 'BODY'
-     * console.log(el.childNodes.length);
-     * // => 0
+     * _.forOwn(new Foo, function(value, key) {
+     *   console.log(key);
+     * });
+     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
      */
-    function cloneWith(value, customizer) {
-      customizer = typeof customizer == 'function' ? customizer : undefined$1;
-      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);
+    function forOwn(object, iteratee) {
+      return object && baseForOwn(object, getIteratee(iteratee, 3));
     }
 
     /**
-     * This method is like `_.clone` except that it recursively clones `value`.
+     * This method is like `_.forOwn` except that it iterates over properties of
+     * `object` in the opposite order.
      *
      * @static
      * @memberOf _
-     * @since 1.0.0
-     * @category Lang
-     * @param {*} value The value to recursively clone.
-     * @returns {*} Returns the deep cloned value.
-     * @see _.clone
+     * @since 2.0.0
+     * @category Object
+     * @param {Object} object The object to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Object} Returns `object`.
+     * @see _.forOwn
      * @example
      *
-     * var objects = [{ 'a': 1 }, { 'b': 2 }];
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
      *
-     * var deep = _.cloneDeep(objects);
-     * console.log(deep[0] === objects[0]);
-     * // => false
+     * Foo.prototype.c = 3;
+     *
+     * _.forOwnRight(new Foo, function(value, key) {
+     *   console.log(key);
+     * });
+     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.
      */
-    function cloneDeep(value) {
-      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);
+    function forOwnRight(object, iteratee) {
+      return object && baseForOwnRight(object, getIteratee(iteratee, 3));
     }
 
     /**
-     * This method is like `_.cloneWith` except that it recursively clones `value`.
+     * Creates an array of function property names from own enumerable properties
+     * of `object`.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to recursively clone.
-     * @param {Function} [customizer] The function to customize cloning.
-     * @returns {*} Returns the deep cloned value.
-     * @see _.cloneWith
+     * @category Object
+     * @param {Object} object The object to inspect.
+     * @returns {Array} Returns the function names.
+     * @see _.functionsIn
      * @example
      *
-     * function customizer(value) {
-     *   if (_.isElement(value)) {
-     *     return value.cloneNode(true);
-     *   }
+     * function Foo() {
+     *   this.a = _.constant('a');
+     *   this.b = _.constant('b');
      * }
      *
-     * var el = _.cloneDeepWith(document.body, customizer);
+     * Foo.prototype.c = _.constant('c');
      *
-     * console.log(el === document.body);
-     * // => false
-     * console.log(el.nodeName);
-     * // => 'BODY'
-     * console.log(el.childNodes.length);
-     * // => 20
+     * _.functions(new Foo);
+     * // => ['a', 'b']
      */
-    function cloneDeepWith(value, customizer) {
-      customizer = typeof customizer == 'function' ? customizer : undefined$1;
-      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);
+    function functions(object) {
+      return object == null ? [] : baseFunctions(object, keys(object));
     }
 
     /**
-     * Checks if `object` conforms to `source` by invoking the predicate
-     * properties of `source` with the corresponding property values of `object`.
-     *
-     * **Note:** This method is equivalent to `_.conforms` when `source` is
-     * partially applied.
+     * Creates an array of function property names from own and inherited
+     * enumerable properties of `object`.
      *
      * @static
      * @memberOf _
-     * @since 4.14.0
-     * @category Lang
+     * @since 4.0.0
+     * @category Object
      * @param {Object} object The object to inspect.
-     * @param {Object} source The object of property predicates to conform to.
-     * @returns {boolean} Returns `true` if `object` conforms, else `false`.
+     * @returns {Array} Returns the function names.
+     * @see _.functions
      * @example
      *
-     * var object = { 'a': 1, 'b': 2 };
+     * function Foo() {
+     *   this.a = _.constant('a');
+     *   this.b = _.constant('b');
+     * }
      *
-     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });
-     * // => true
+     * Foo.prototype.c = _.constant('c');
      *
-     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });
-     * // => false
+     * _.functionsIn(new Foo);
+     * // => ['a', 'b', 'c']
      */
-    function conformsTo(object, source) {
-      return source == null || baseConformsTo(object, source, keys(source));
+    function functionsIn(object) {
+      return object == null ? [] : baseFunctions(object, keysIn(object));
     }
 
     /**
-     * Performs a
-     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)
-     * comparison between two values to determine if they are equivalent.
+     * Gets the value at `path` of `object`. If the resolved value is
+     * `undefined`, the `defaultValue` is returned in its place.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+     * @since 3.7.0
+     * @category Object
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path of the property to get.
+     * @param {*} [defaultValue] The value returned for `undefined` resolved values.
+     * @returns {*} Returns the resolved value.
      * @example
      *
-     * var object = { 'a': 1 };
-     * var other = { 'a': 1 };
-     *
-     * _.eq(object, object);
-     * // => true
-     *
-     * _.eq(object, other);
-     * // => false
+     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
      *
-     * _.eq('a', 'a');
-     * // => true
+     * _.get(object, 'a[0].b.c');
+     * // => 3
      *
-     * _.eq('a', Object('a'));
-     * // => false
+     * _.get(object, ['a', '0', 'b', 'c']);
+     * // => 3
      *
-     * _.eq(NaN, NaN);
-     * // => true
+     * _.get(object, 'a.b.c', 'default');
+     * // => 'default'
      */
-    function eq(value, other) {
-      return value === other || (value !== value && other !== other);
+    function get(object, path, defaultValue) {
+      var result = object == null ? undefined$1 : baseGet(object, path);
+      return result === undefined$1 ? defaultValue : result;
     }
 
     /**
-     * Checks if `value` is greater than `other`.
+     * Checks if `path` is a direct property of `object`.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 3.9.0
-     * @category Lang
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is greater than `other`,
-     *  else `false`.
-     * @see _.lt
+     * @category Object
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path to check.
+     * @returns {boolean} Returns `true` if `path` exists, else `false`.
      * @example
      *
-     * _.gt(3, 1);
+     * var object = { 'a': { 'b': 2 } };
+     * var other = _.create({ 'a': _.create({ 'b': 2 }) });
+     *
+     * _.has(object, 'a');
      * // => true
      *
-     * _.gt(3, 3);
-     * // => false
+     * _.has(object, 'a.b');
+     * // => true
      *
-     * _.gt(1, 3);
+     * _.has(object, ['a', 'b']);
+     * // => true
+     *
+     * _.has(other, 'a');
      * // => false
      */
-    var gt = createRelationalOperation(baseGt);
+    function has(object, path) {
+      return object != null && hasPath(object, path, baseHas);
+    }
 
     /**
-     * Checks if `value` is greater than or equal to `other`.
+     * Checks if `path` is a direct or inherited property of `object`.
      *
      * @static
      * @memberOf _
-     * @since 3.9.0
-     * @category Lang
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is greater than or equal to
-     *  `other`, else `false`.
-     * @see _.lte
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path to check.
+     * @returns {boolean} Returns `true` if `path` exists, else `false`.
      * @example
      *
-     * _.gte(3, 1);
+     * var object = _.create({ 'a': _.create({ 'b': 2 }) });
+     *
+     * _.hasIn(object, 'a');
      * // => true
      *
-     * _.gte(3, 3);
+     * _.hasIn(object, 'a.b');
      * // => true
      *
-     * _.gte(1, 3);
+     * _.hasIn(object, ['a', 'b']);
+     * // => true
+     *
+     * _.hasIn(object, 'b');
      * // => false
      */
-    var gte = createRelationalOperation(function(value, other) {
-      return value >= other;
-    });
+    function hasIn(object, path) {
+      return object != null && hasPath(object, path, baseHasIn);
+    }
 
     /**
-     * Checks if `value` is likely an `arguments` object.
+     * Creates an object composed of the inverted keys and values of `object`.
+     * If `object` contains duplicate values, subsequent values overwrite
+     * property assignments of previous values.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is an `arguments` object,
-     *  else `false`.
+     * @since 0.7.0
+     * @category Object
+     * @param {Object} object The object to invert.
+     * @returns {Object} Returns the new inverted object.
      * @example
      *
-     * _.isArguments(function() { return arguments; }());
-     * // => true
+     * var object = { 'a': 1, 'b': 2, 'c': 1 };
      *
-     * _.isArguments([1, 2, 3]);
-     * // => false
+     * _.invert(object);
+     * // => { '1': 'c', '2': 'b' }
      */
-    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {
-      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&
-        !propertyIsEnumerable.call(value, 'callee');
-    };
+    var invert = createInverter(function(result, value, key) {
+      if (value != null &&
+          typeof value.toString != 'function') {
+        value = nativeObjectToString.call(value);
+      }
+
+      result[value] = key;
+    }, constant(identity));
 
     /**
-     * Checks if `value` is classified as an `Array` object.
+     * This method is like `_.invert` except that the inverted object is generated
+     * from the results of running each element of `object` thru `iteratee`. The
+     * corresponding inverted value of each inverted key is an array of keys
+     * responsible for generating the inverted value. The iteratee is invoked
+     * with one argument: (value).
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is an array, else `false`.
+     * @since 4.1.0
+     * @category Object
+     * @param {Object} object The object to invert.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {Object} Returns the new inverted object.
      * @example
      *
-     * _.isArray([1, 2, 3]);
-     * // => true
-     *
-     * _.isArray(document.body.children);
-     * // => false
+     * var object = { 'a': 1, 'b': 2, 'c': 1 };
      *
-     * _.isArray('abc');
-     * // => false
+     * _.invertBy(object);
+     * // => { '1': ['a', 'c'], '2': ['b'] }
      *
-     * _.isArray(_.noop);
-     * // => false
+     * _.invertBy(object, function(value) {
+     *   return 'group' + value;
+     * });
+     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }
      */
-    var isArray = Array.isArray;
+    var invertBy = createInverter(function(result, value, key) {
+      if (value != null &&
+          typeof value.toString != 'function') {
+        value = nativeObjectToString.call(value);
+      }
+
+      if (hasOwnProperty.call(result, value)) {
+        result[value].push(key);
+      } else {
+        result[value] = [key];
+      }
+    }, getIteratee);
 
     /**
-     * Checks if `value` is classified as an `ArrayBuffer` object.
+     * Invokes the method at `path` of `object`.
      *
      * @static
      * @memberOf _
-     * @since 4.3.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path of the method to invoke.
+     * @param {...*} [args] The arguments to invoke the method with.
+     * @returns {*} Returns the result of the invoked method.
      * @example
      *
-     * _.isArrayBuffer(new ArrayBuffer(2));
-     * // => true
+     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };
      *
-     * _.isArrayBuffer(new Array(2));
-     * // => false
+     * _.invoke(object, 'a[0].b.c.slice', 1, 3);
+     * // => [2, 3]
      */
-    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;
+    var invoke = baseRest(baseInvoke);
 
     /**
-     * Checks if `value` is array-like. A value is considered array-like if it's
-     * not a function and has a `value.length` that's an integer greater than or
-     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.
+     * Creates an array of the own enumerable property names of `object`.
+     *
+     * **Note:** Non-object values are coerced to objects. See the
+     * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
+     * for more details.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.
+     * @category Object
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names.
      * @example
      *
-     * _.isArrayLike([1, 2, 3]);
-     * // => true
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
      *
-     * _.isArrayLike(document.body.children);
-     * // => true
+     * Foo.prototype.c = 3;
      *
-     * _.isArrayLike('abc');
-     * // => true
+     * _.keys(new Foo);
+     * // => ['a', 'b'] (iteration order is not guaranteed)
      *
-     * _.isArrayLike(_.noop);
-     * // => false
+     * _.keys('hi');
+     * // => ['0', '1']
      */
-    function isArrayLike(value) {
-      return value != null && isLength(value.length) && !isFunction(value);
+    function keys(object) {
+      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);
     }
 
     /**
-     * This method is like `_.isArrayLike` except that it also checks if `value`
-     * is an object.
+     * Creates an array of the own and inherited enumerable property names of `object`.
+     *
+     * **Note:** Non-object values are coerced to objects.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is an array-like object,
-     *  else `false`.
+     * @since 3.0.0
+     * @category Object
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property names.
      * @example
      *
-     * _.isArrayLikeObject([1, 2, 3]);
-     * // => true
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
      *
-     * _.isArrayLikeObject(document.body.children);
-     * // => true
+     * Foo.prototype.c = 3;
      *
-     * _.isArrayLikeObject('abc');
-     * // => false
+     * _.keysIn(new Foo);
+     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)
+     */
+    function keysIn(object) {
+      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);
+    }
+
+    /**
+     * The opposite of `_.mapValues`; this method creates an object with the
+     * same values as `object` and keys generated by running each own enumerable
+     * string keyed property of `object` thru `iteratee`. The iteratee is invoked
+     * with three arguments: (value, key, object).
      *
-     * _.isArrayLikeObject(_.noop);
-     * // => false
+     * @static
+     * @memberOf _
+     * @since 3.8.0
+     * @category Object
+     * @param {Object} object The object to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Object} Returns the new mapped object.
+     * @see _.mapValues
+     * @example
+     *
+     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {
+     *   return key + value;
+     * });
+     * // => { 'a1': 1, 'b2': 2 }
      */
-    function isArrayLikeObject(value) {
-      return isObjectLike(value) && isArrayLike(value);
+    function mapKeys(object, iteratee) {
+      var result = {};
+      iteratee = getIteratee(iteratee, 3);
+
+      baseForOwn(object, function(value, key, object) {
+        baseAssignValue(result, iteratee(value, key, object), value);
+      });
+      return result;
     }
 
     /**
-     * Checks if `value` is classified as a boolean primitive or object.
+     * Creates an object with the same keys as `object` and values generated
+     * by running each own enumerable string keyed property of `object` thru
+     * `iteratee`. The iteratee is invoked with three arguments:
+     * (value, key, object).
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.
+     * @since 2.4.0
+     * @category Object
+     * @param {Object} object The object to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Object} Returns the new mapped object.
+     * @see _.mapKeys
      * @example
      *
-     * _.isBoolean(false);
-     * // => true
+     * var users = {
+     *   'fred':    { 'user': 'fred',    'age': 40 },
+     *   'pebbles': { 'user': 'pebbles', 'age': 1 }
+     * };
      *
-     * _.isBoolean(null);
-     * // => false
+     * _.mapValues(users, function(o) { return o.age; });
+     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.mapValues(users, 'age');
+     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
      */
-    function isBoolean(value) {
-      return value === true || value === false ||
-        (isObjectLike(value) && baseGetTag(value) == boolTag);
+    function mapValues(object, iteratee) {
+      var result = {};
+      iteratee = getIteratee(iteratee, 3);
+
+      baseForOwn(object, function(value, key, object) {
+        baseAssignValue(result, key, iteratee(value, key, object));
+      });
+      return result;
     }
 
     /**
-     * Checks if `value` is a buffer.
+     * This method is like `_.assign` except that it recursively merges own and
+     * inherited enumerable string keyed properties of source objects into the
+     * destination object. Source properties that resolve to `undefined` are
+     * skipped if a destination value exists. Array and plain object properties
+     * are merged recursively. Other objects and value types are overridden by
+     * assignment. Source objects are applied from left to right. Subsequent
+     * sources overwrite property assignments of previous sources.
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 4.3.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.
+     * @since 0.5.0
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} [sources] The source objects.
+     * @returns {Object} Returns `object`.
      * @example
      *
-     * _.isBuffer(new Buffer(2));
-     * // => true
+     * var object = {
+     *   'a': [{ 'b': 2 }, { 'd': 4 }]
+     * };
      *
-     * _.isBuffer(new Uint8Array(2));
-     * // => false
+     * var other = {
+     *   'a': [{ 'c': 3 }, { 'e': 5 }]
+     * };
+     *
+     * _.merge(object, other);
+     * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }
      */
-    var isBuffer = nativeIsBuffer || stubFalse;
+    var merge = createAssigner(function(object, source, srcIndex) {
+      baseMerge(object, source, srcIndex);
+    });
 
     /**
-     * Checks if `value` is classified as a `Date` object.
+     * This method is like `_.merge` except that it accepts `customizer` which
+     * is invoked to produce the merged values of the destination and source
+     * properties. If `customizer` returns `undefined`, merging is handled by the
+     * method instead. The `customizer` is invoked with six arguments:
+     * (objValue, srcValue, key, object, source, stack).
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The destination object.
+     * @param {...Object} sources The source objects.
+     * @param {Function} customizer The function to customize assigned values.
+     * @returns {Object} Returns `object`.
      * @example
      *
-     * _.isDate(new Date);
-     * // => true
+     * function customizer(objValue, srcValue) {
+     *   if (_.isArray(objValue)) {
+     *     return objValue.concat(srcValue);
+     *   }
+     * }
      *
-     * _.isDate('Mon April 23 2012');
-     * // => false
+     * var object = { 'a': [1], 'b': [2] };
+     * var other = { 'a': [3], 'b': [4] };
+     *
+     * _.mergeWith(object, other, customizer);
+     * // => { 'a': [1, 3], 'b': [2, 4] }
      */
-    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;
+    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {
+      baseMerge(object, source, srcIndex, customizer);
+    });
 
     /**
-     * Checks if `value` is likely a DOM element.
+     * The opposite of `_.pick`; this method creates an object composed of the
+     * own and inherited enumerable property paths of `object` that are not omitted.
+     *
+     * **Note:** This method is considerably slower than `_.pick`.
      *
      * @static
-     * @memberOf _
      * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.
+     * @memberOf _
+     * @category Object
+     * @param {Object} object The source object.
+     * @param {...(string|string[])} [paths] The property paths to omit.
+     * @returns {Object} Returns the new object.
      * @example
      *
-     * _.isElement(document.body);
-     * // => true
+     * var object = { 'a': 1, 'b': '2', 'c': 3 };
      *
-     * _.isElement('<body>');
-     * // => false
+     * _.omit(object, ['a', 'c']);
+     * // => { 'b': '2' }
      */
-    function isElement(value) {
-      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);
-    }
+    var omit = flatRest(function(object, paths) {
+      var result = {};
+      if (object == null) {
+        return result;
+      }
+      var isDeep = false;
+      paths = arrayMap(paths, function(path) {
+        path = castPath(path, object);
+        isDeep || (isDeep = path.length > 1);
+        return path;
+      });
+      copyObject(object, getAllKeysIn(object), result);
+      if (isDeep) {
+        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);
+      }
+      var length = paths.length;
+      while (length--) {
+        baseUnset(result, paths[length]);
+      }
+      return result;
+    });
 
     /**
-     * Checks if `value` is an empty object, collection, map, or set.
-     *
-     * Objects are considered empty if they have no own enumerable string keyed
-     * properties.
-     *
-     * Array-like values such as `arguments` objects, arrays, buffers, strings, or
-     * jQuery-like collections are considered empty if they have a `length` of `0`.
-     * Similarly, maps and sets are considered empty if they have a `size` of `0`.
+     * The opposite of `_.pickBy`; this method creates an object composed of
+     * the own and inherited enumerable string keyed properties of `object` that
+     * `predicate` doesn't return truthy for. The predicate is invoked with two
+     * arguments: (value, key).
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is empty, else `false`.
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The source object.
+     * @param {Function} [predicate=_.identity] The function invoked per property.
+     * @returns {Object} Returns the new object.
      * @example
      *
-     * _.isEmpty(null);
-     * // => true
-     *
-     * _.isEmpty(true);
-     * // => true
-     *
-     * _.isEmpty(1);
-     * // => true
-     *
-     * _.isEmpty([1, 2, 3]);
-     * // => false
+     * var object = { 'a': 1, 'b': '2', 'c': 3 };
      *
-     * _.isEmpty({ 'a': 1 });
-     * // => false
+     * _.omitBy(object, _.isNumber);
+     * // => { 'b': '2' }
      */
-    function isEmpty(value) {
-      if (value == null) {
-        return true;
-      }
-      if (isArrayLike(value) &&
-          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||
-            isBuffer(value) || isTypedArray(value) || isArguments(value))) {
-        return !value.length;
-      }
-      var tag = getTag(value);
-      if (tag == mapTag || tag == setTag) {
-        return !value.size;
-      }
-      if (isPrototype(value)) {
-        return !baseKeys(value).length;
-      }
-      for (var key in value) {
-        if (hasOwnProperty.call(value, key)) {
-          return false;
-        }
-      }
-      return true;
+    function omitBy(object, predicate) {
+      return pickBy(object, negate(getIteratee(predicate)));
     }
 
     /**
-     * Performs a deep comparison between two values to determine if they are
-     * equivalent.
-     *
-     * **Note:** This method supports comparing arrays, array buffers, booleans,
-     * date objects, error objects, maps, numbers, `Object` objects, regexes,
-     * sets, strings, symbols, and typed arrays. `Object` objects are compared
-     * by their own, not inherited, enumerable properties. Functions and DOM
-     * nodes are compared by strict equality, i.e. `===`.
+     * Creates an object composed of the picked `object` properties.
      *
      * @static
-     * @memberOf _
      * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+     * @memberOf _
+     * @category Object
+     * @param {Object} object The source object.
+     * @param {...(string|string[])} [paths] The property paths to pick.
+     * @returns {Object} Returns the new object.
      * @example
      *
-     * var object = { 'a': 1 };
-     * var other = { 'a': 1 };
-     *
-     * _.isEqual(object, other);
-     * // => true
+     * var object = { 'a': 1, 'b': '2', 'c': 3 };
      *
-     * object === other;
-     * // => false
+     * _.pick(object, ['a', 'c']);
+     * // => { 'a': 1, 'c': 3 }
      */
-    function isEqual(value, other) {
-      return baseIsEqual(value, other);
-    }
+    var pick = flatRest(function(object, paths) {
+      return object == null ? {} : basePick(object, paths);
+    });
 
     /**
-     * This method is like `_.isEqual` except that it accepts `customizer` which
-     * is invoked to compare values. If `customizer` returns `undefined`, comparisons
-     * are handled by the method instead. The `customizer` is invoked with up to
-     * six arguments: (objValue, othValue [, index|key, object, other, stack]).
+     * Creates an object composed of the `object` properties `predicate` returns
+     * truthy for. The predicate is invoked with two arguments: (value, key).
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @param {Function} [customizer] The function to customize comparisons.
-     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.
+     * @category Object
+     * @param {Object} object The source object.
+     * @param {Function} [predicate=_.identity] The function invoked per property.
+     * @returns {Object} Returns the new object.
      * @example
      *
-     * function isGreeting(value) {
-     *   return /^h(?:i|ello)$/.test(value);
-     * }
-     *
-     * function customizer(objValue, othValue) {
-     *   if (isGreeting(objValue) && isGreeting(othValue)) {
-     *     return true;
-     *   }
-     * }
-     *
-     * var array = ['hello', 'goodbye'];
-     * var other = ['hi', 'goodbye'];
+     * var object = { 'a': 1, 'b': '2', 'c': 3 };
      *
-     * _.isEqualWith(array, other, customizer);
-     * // => true
+     * _.pickBy(object, _.isNumber);
+     * // => { 'a': 1, 'c': 3 }
      */
-    function isEqualWith(value, other, customizer) {
-      customizer = typeof customizer == 'function' ? customizer : undefined$1;
-      var result = customizer ? customizer(value, other) : undefined$1;
-      return result === undefined$1 ? baseIsEqual(value, other, undefined$1, customizer) : !!result;
+    function pickBy(object, predicate) {
+      if (object == null) {
+        return {};
+      }
+      var props = arrayMap(getAllKeysIn(object), function(prop) {
+        return [prop];
+      });
+      predicate = getIteratee(predicate);
+      return basePickBy(object, props, function(value, path) {
+        return predicate(value, path[0]);
+      });
     }
 
     /**
-     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,
-     * `SyntaxError`, `TypeError`, or `URIError` object.
+     * This method is like `_.get` except that if the resolved value is a
+     * function it's invoked with the `this` binding of its parent object and
+     * its result is returned.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 3.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is an error object, else `false`.
+     * @category Object
+     * @param {Object} object The object to query.
+     * @param {Array|string} path The path of the property to resolve.
+     * @param {*} [defaultValue] The value returned for `undefined` resolved values.
+     * @returns {*} Returns the resolved value.
      * @example
      *
-     * _.isError(new Error);
-     * // => true
+     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };
      *
-     * _.isError(Error);
-     * // => false
+     * _.result(object, 'a[0].b.c1');
+     * // => 3
+     *
+     * _.result(object, 'a[0].b.c2');
+     * // => 4
+     *
+     * _.result(object, 'a[0].b.c3', 'default');
+     * // => 'default'
+     *
+     * _.result(object, 'a[0].b.c3', _.constant('default'));
+     * // => 'default'
      */
-    function isError(value) {
-      if (!isObjectLike(value)) {
-        return false;
+    function result(object, path, defaultValue) {
+      path = castPath(path, object);
+
+      var index = -1,
+          length = path.length;
+
+      // Ensure the loop is entered when path is empty.
+      if (!length) {
+        length = 1;
+        object = undefined$1;
       }
-      var tag = baseGetTag(value);
-      return tag == errorTag || tag == domExcTag ||
-        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));
+      while (++index < length) {
+        var value = object == null ? undefined$1 : object[toKey(path[index])];
+        if (value === undefined$1) {
+          index = length;
+          value = defaultValue;
+        }
+        object = isFunction(value) ? value.call(object) : value;
+      }
+      return object;
     }
 
     /**
-     * Checks if `value` is a finite primitive number.
+     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,
+     * it's created. Arrays are created for missing index properties while objects
+     * are created for all other missing properties. Use `_.setWith` to customize
+     * `path` creation.
      *
-     * **Note:** This method is based on
-     * [`Number.isFinite`](https://mdn.io/Number/isFinite).
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.
+     * @since 3.7.0
+     * @category Object
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to set.
+     * @param {*} value The value to set.
+     * @returns {Object} Returns `object`.
      * @example
      *
-     * _.isFinite(3);
-     * // => true
-     *
-     * _.isFinite(Number.MIN_VALUE);
-     * // => true
+     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
      *
-     * _.isFinite(Infinity);
-     * // => false
+     * _.set(object, 'a[0].b.c', 4);
+     * console.log(object.a[0].b.c);
+     * // => 4
      *
-     * _.isFinite('3');
-     * // => false
+     * _.set(object, ['x', '0', 'y', 'z'], 5);
+     * console.log(object.x[0].y.z);
+     * // => 5
      */
-    function isFinite(value) {
-      return typeof value == 'number' && nativeIsFinite(value);
+    function set(object, path, value) {
+      return object == null ? object : baseSet(object, path, value);
     }
 
     /**
-     * Checks if `value` is classified as a `Function` object.
+     * This method is like `_.set` except that it accepts `customizer` which is
+     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`
+     * path creation is handled by the method instead. The `customizer` is invoked
+     * with three arguments: (nsValue, key, nsObject).
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a function, else `false`.
+     * @since 4.0.0
+     * @category Object
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to set.
+     * @param {*} value The value to set.
+     * @param {Function} [customizer] The function to customize assigned values.
+     * @returns {Object} Returns `object`.
      * @example
      *
-     * _.isFunction(_);
-     * // => true
+     * var object = {};
      *
-     * _.isFunction(/abc/);
-     * // => false
+     * _.setWith(object, '[0][1]', 'a', Object);
+     * // => { '0': { '1': 'a' } }
      */
-    function isFunction(value) {
-      if (!isObject(value)) {
-        return false;
-      }
-      // The use of `Object#toString` avoids issues with the `typeof` operator
-      // in Safari 9 which returns 'object' for typed arrays and other constructors.
-      var tag = baseGetTag(value);
-      return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;
+    function setWith(object, path, value, customizer) {
+      customizer = typeof customizer == 'function' ? customizer : undefined$1;
+      return object == null ? object : baseSet(object, path, value, customizer);
     }
 
     /**
-     * Checks if `value` is an integer.
-     *
-     * **Note:** This method is based on
-     * [`Number.isInteger`](https://mdn.io/Number/isInteger).
+     * Creates an array of own enumerable string keyed-value pairs for `object`
+     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its
+     * entries are returned.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is an integer, else `false`.
+     * @alias entries
+     * @category Object
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the key-value pairs.
      * @example
      *
-     * _.isInteger(3);
-     * // => true
-     *
-     * _.isInteger(Number.MIN_VALUE);
-     * // => false
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
      *
-     * _.isInteger(Infinity);
-     * // => false
+     * Foo.prototype.c = 3;
      *
-     * _.isInteger('3');
-     * // => false
+     * _.toPairs(new Foo);
+     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)
      */
-    function isInteger(value) {
-      return typeof value == 'number' && value == toInteger(value);
-    }
+    var toPairs = createToPairs(keys);
 
     /**
-     * Checks if `value` is a valid array-like length.
-     *
-     * **Note:** This method is loosely based on
-     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).
+     * Creates an array of own and inherited enumerable string keyed-value pairs
+     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map
+     * or set, its entries are returned.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.
+     * @alias entriesIn
+     * @category Object
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the key-value pairs.
      * @example
      *
-     * _.isLength(3);
-     * // => true
-     *
-     * _.isLength(Number.MIN_VALUE);
-     * // => false
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
      *
-     * _.isLength(Infinity);
-     * // => false
+     * Foo.prototype.c = 3;
      *
-     * _.isLength('3');
-     * // => false
+     * _.toPairsIn(new Foo);
+     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)
      */
-    function isLength(value) {
-      return typeof value == 'number' &&
-        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;
-    }
+    var toPairsIn = createToPairs(keysIn);
 
     /**
-     * Checks if `value` is the
-     * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)
-     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)
+     * An alternative to `_.reduce`; this method transforms `object` to a new
+     * `accumulator` object which is the result of running each of its own
+     * enumerable string keyed properties thru `iteratee`, with each invocation
+     * potentially mutating the `accumulator` object. If `accumulator` is not
+     * provided, a new object with the same `[[Prototype]]` will be used. The
+     * iteratee is invoked with four arguments: (accumulator, value, key, object).
+     * Iteratee functions may exit iteration early by explicitly returning `false`.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is an object, else `false`.
+     * @since 1.3.0
+     * @category Object
+     * @param {Object} object The object to iterate over.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @param {*} [accumulator] The custom accumulator value.
+     * @returns {*} Returns the accumulated value.
      * @example
      *
-     * _.isObject({});
-     * // => true
-     *
-     * _.isObject([1, 2, 3]);
-     * // => true
-     *
-     * _.isObject(_.noop);
-     * // => true
+     * _.transform([2, 3, 4], function(result, n) {
+     *   result.push(n *= n);
+     *   return n % 2 == 0;
+     * }, []);
+     * // => [4, 9]
      *
-     * _.isObject(null);
-     * // => false
+     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
+     *   (result[value] || (result[value] = [])).push(key);
+     * }, {});
+     * // => { '1': ['a', 'c'], '2': ['b'] }
      */
-    function isObject(value) {
-      var type = typeof value;
-      return value != null && (type == 'object' || type == 'function');
+    function transform(object, iteratee, accumulator) {
+      var isArr = isArray(object),
+          isArrLike = isArr || isBuffer(object) || isTypedArray(object);
+
+      iteratee = getIteratee(iteratee, 4);
+      if (accumulator == null) {
+        var Ctor = object && object.constructor;
+        if (isArrLike) {
+          accumulator = isArr ? new Ctor : [];
+        }
+        else if (isObject(object)) {
+          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};
+        }
+        else {
+          accumulator = {};
+        }
+      }
+      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {
+        return iteratee(accumulator, value, index, object);
+      });
+      return accumulator;
     }
 
     /**
-     * Checks if `value` is object-like. A value is object-like if it's not `null`
-     * and has a `typeof` result of "object".
+     * Removes the property at `path` of `object`.
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.
+     * @category Object
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to unset.
+     * @returns {boolean} Returns `true` if the property is deleted, else `false`.
      * @example
      *
-     * _.isObjectLike({});
-     * // => true
-     *
-     * _.isObjectLike([1, 2, 3]);
+     * var object = { 'a': [{ 'b': { 'c': 7 } }] };
+     * _.unset(object, 'a[0].b.c');
      * // => true
      *
-     * _.isObjectLike(_.noop);
-     * // => false
-     *
-     * _.isObjectLike(null);
-     * // => false
-     */
-    function isObjectLike(value) {
-      return value != null && typeof value == 'object';
-    }
-
-    /**
-     * Checks if `value` is classified as a `Map` object.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.3.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a map, else `false`.
-     * @example
+     * console.log(object);
+     * // => { 'a': [{ 'b': {} }] };
      *
-     * _.isMap(new Map);
+     * _.unset(object, ['a', '0', 'b', 'c']);
      * // => true
      *
-     * _.isMap(new WeakMap);
-     * // => false
+     * console.log(object);
+     * // => { 'a': [{ 'b': {} }] };
      */
-    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;
+    function unset(object, path) {
+      return object == null ? true : baseUnset(object, path);
+    }
 
     /**
-     * Performs a partial deep comparison between `object` and `source` to
-     * determine if `object` contains equivalent property values.
-     *
-     * **Note:** This method is equivalent to `_.matches` when `source` is
-     * partially applied.
+     * This method is like `_.set` except that accepts `updater` to produce the
+     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`
+     * is invoked with one argument: (value).
      *
-     * Partial comparisons will match empty array and empty object `source`
-     * values against any array or object value, respectively. See `_.isEqual`
-     * for a list of supported value comparisons.
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category Lang
-     * @param {Object} object The object to inspect.
-     * @param {Object} source The object of property values to match.
-     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
+     * @since 4.6.0
+     * @category Object
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to set.
+     * @param {Function} updater The function to produce the updated value.
+     * @returns {Object} Returns `object`.
      * @example
      *
-     * var object = { 'a': 1, 'b': 2 };
+     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
      *
-     * _.isMatch(object, { 'b': 2 });
-     * // => true
+     * _.update(object, 'a[0].b.c', function(n) { return n * n; });
+     * console.log(object.a[0].b.c);
+     * // => 9
      *
-     * _.isMatch(object, { 'b': 1 });
-     * // => false
+     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });
+     * console.log(object.x[0].y.z);
+     * // => 0
      */
-    function isMatch(object, source) {
-      return object === source || baseIsMatch(object, source, getMatchData(source));
+    function update(object, path, updater) {
+      return object == null ? object : baseUpdate(object, path, castFunction(updater));
     }
 
     /**
-     * This method is like `_.isMatch` except that it accepts `customizer` which
-     * is invoked to compare values. If `customizer` returns `undefined`, comparisons
-     * are handled by the method instead. The `customizer` is invoked with five
-     * arguments: (objValue, srcValue, index|key, object, source).
+     * This method is like `_.update` except that it accepts `customizer` which is
+     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`
+     * path creation is handled by the method instead. The `customizer` is invoked
+     * with three arguments: (nsValue, key, nsObject).
+     *
+     * **Note:** This method mutates `object`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {Object} object The object to inspect.
-     * @param {Object} source The object of property values to match.
-     * @param {Function} [customizer] The function to customize comparisons.
-     * @returns {boolean} Returns `true` if `object` is a match, else `false`.
+     * @since 4.6.0
+     * @category Object
+     * @param {Object} object The object to modify.
+     * @param {Array|string} path The path of the property to set.
+     * @param {Function} updater The function to produce the updated value.
+     * @param {Function} [customizer] The function to customize assigned values.
+     * @returns {Object} Returns `object`.
      * @example
      *
-     * function isGreeting(value) {
-     *   return /^h(?:i|ello)$/.test(value);
-     * }
-     *
-     * function customizer(objValue, srcValue) {
-     *   if (isGreeting(objValue) && isGreeting(srcValue)) {
-     *     return true;
-     *   }
-     * }
-     *
-     * var object = { 'greeting': 'hello' };
-     * var source = { 'greeting': 'hi' };
+     * var object = {};
      *
-     * _.isMatchWith(object, source, customizer);
-     * // => true
+     * _.updateWith(object, '[0][1]', _.constant('a'), Object);
+     * // => { '0': { '1': 'a' } }
      */
-    function isMatchWith(object, source, customizer) {
+    function updateWith(object, path, updater, customizer) {
       customizer = typeof customizer == 'function' ? customizer : undefined$1;
-      return baseIsMatch(object, source, getMatchData(source), customizer);
+      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);
     }
 
     /**
-     * Checks if `value` is `NaN`.
+     * Creates an array of the own enumerable string keyed property values of `object`.
      *
-     * **Note:** This method is based on
-     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as
-     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for
-     * `undefined` and other non-number values.
+     * **Note:** Non-object values are coerced to objects.
      *
      * @static
-     * @memberOf _
      * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.
+     * @memberOf _
+     * @category Object
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property values.
      * @example
      *
-     * _.isNaN(NaN);
-     * // => true
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
      *
-     * _.isNaN(new Number(NaN));
-     * // => true
+     * Foo.prototype.c = 3;
      *
-     * isNaN(undefined);
-     * // => true
+     * _.values(new Foo);
+     * // => [1, 2] (iteration order is not guaranteed)
      *
-     * _.isNaN(undefined);
-     * // => false
+     * _.values('hi');
+     * // => ['h', 'i']
      */
-    function isNaN(value) {
-      // An `NaN` primitive is the only value that is not equal to itself.
-      // Perform the `toStringTag` check first to avoid errors with some
-      // ActiveX objects in IE.
-      return isNumber(value) && value != +value;
+    function values(object) {
+      return object == null ? [] : baseValues(object, keys(object));
     }
 
     /**
-     * Checks if `value` is a pristine native function.
+     * Creates an array of the own and inherited enumerable string keyed property
+     * values of `object`.
      *
-     * **Note:** This method can't reliably detect native functions in the presence
-     * of the core-js package because core-js circumvents this kind of detection.
-     * Despite multiple requests, the core-js maintainer has made it clear: any
-     * attempt to fix the detection will be obstructed. As a result, we're left
-     * with little choice but to throw an error. Unfortunately, this also affects
-     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),
-     * which rely on core-js.
+     * **Note:** Non-object values are coerced to objects.
      *
      * @static
      * @memberOf _
      * @since 3.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a native function,
-     *  else `false`.
+     * @category Object
+     * @param {Object} object The object to query.
+     * @returns {Array} Returns the array of property values.
      * @example
      *
-     * _.isNative(Array.prototype.push);
-     * // => true
+     * function Foo() {
+     *   this.a = 1;
+     *   this.b = 2;
+     * }
      *
-     * _.isNative(_);
-     * // => false
+     * Foo.prototype.c = 3;
+     *
+     * _.valuesIn(new Foo);
+     * // => [1, 2, 3] (iteration order is not guaranteed)
      */
-    function isNative(value) {
-      if (isMaskable(value)) {
-        throw new Error(CORE_ERROR_TEXT);
-      }
-      return baseIsNative(value);
+    function valuesIn(object) {
+      return object == null ? [] : baseValues(object, keysIn(object));
     }
 
+    /*------------------------------------------------------------------------*/
+
     /**
-     * Checks if `value` is `null`.
+     * Clamps `number` within the inclusive `lower` and `upper` bounds.
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.
+     * @since 4.0.0
+     * @category Number
+     * @param {number} number The number to clamp.
+     * @param {number} [lower] The lower bound.
+     * @param {number} upper The upper bound.
+     * @returns {number} Returns the clamped number.
      * @example
      *
-     * _.isNull(null);
-     * // => true
+     * _.clamp(-10, -5, 5);
+     * // => -5
      *
-     * _.isNull(void 0);
-     * // => false
+     * _.clamp(10, -5, 5);
+     * // => 5
      */
-    function isNull(value) {
-      return value === null;
+    function clamp(number, lower, upper) {
+      if (upper === undefined$1) {
+        upper = lower;
+        lower = undefined$1;
+      }
+      if (upper !== undefined$1) {
+        upper = toNumber(upper);
+        upper = upper === upper ? upper : 0;
+      }
+      if (lower !== undefined$1) {
+        lower = toNumber(lower);
+        lower = lower === lower ? lower : 0;
+      }
+      return baseClamp(toNumber(number), lower, upper);
     }
 
     /**
-     * Checks if `value` is `null` or `undefined`.
+     * Checks if `n` is between `start` and up to, but not including, `end`. If
+     * `end` is not specified, it's set to `start` with `start` then set to `0`.
+     * If `start` is greater than `end` the params are swapped to support
+     * negative ranges.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is nullish, else `false`.
+     * @since 3.3.0
+     * @category Number
+     * @param {number} number The number to check.
+     * @param {number} [start=0] The start of the range.
+     * @param {number} end The end of the range.
+     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.
+     * @see _.range, _.rangeRight
      * @example
      *
-     * _.isNil(null);
+     * _.inRange(3, 2, 4);
      * // => true
      *
-     * _.isNil(void 0);
+     * _.inRange(4, 8);
      * // => true
      *
-     * _.isNil(NaN);
+     * _.inRange(4, 2);
      * // => false
-     */
-    function isNil(value) {
-      return value == null;
-    }
-
-    /**
-     * Checks if `value` is classified as a `Number` primitive or object.
-     *
-     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are
-     * classified as numbers, use the `_.isFinite` method.
      *
-     * @static
-     * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a number, else `false`.
-     * @example
+     * _.inRange(2, 2);
+     * // => false
      *
-     * _.isNumber(3);
+     * _.inRange(1.2, 2);
      * // => true
      *
-     * _.isNumber(Number.MIN_VALUE);
-     * // => true
+     * _.inRange(5.2, 4);
+     * // => false
      *
-     * _.isNumber(Infinity);
+     * _.inRange(-3, -2, -6);
      * // => true
-     *
-     * _.isNumber('3');
-     * // => false
      */
-    function isNumber(value) {
-      return typeof value == 'number' ||
-        (isObjectLike(value) && baseGetTag(value) == numberTag);
+    function inRange(number, start, end) {
+      start = toFinite(start);
+      if (end === undefined$1) {
+        end = start;
+        start = 0;
+      } else {
+        end = toFinite(end);
+      }
+      number = toNumber(number);
+      return baseInRange(number, start, end);
     }
 
     /**
-     * Checks if `value` is a plain object, that is, an object created by the
-     * `Object` constructor or one with a `[[Prototype]]` of `null`.
+     * Produces a random number between the inclusive `lower` and `upper` bounds.
+     * If only one argument is provided a number between `0` and the given number
+     * is returned. If `floating` is `true`, or either `lower` or `upper` are
+     * floats, a floating-point number is returned instead of an integer.
+     *
+     * **Note:** JavaScript follows the IEEE-754 standard for resolving
+     * floating-point values which can produce unexpected results.
      *
      * @static
      * @memberOf _
-     * @since 0.8.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.
+     * @since 0.7.0
+     * @category Number
+     * @param {number} [lower=0] The lower bound.
+     * @param {number} [upper=1] The upper bound.
+     * @param {boolean} [floating] Specify returning a floating-point number.
+     * @returns {number} Returns the random number.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     * }
-     *
-     * _.isPlainObject(new Foo);
-     * // => false
+     * _.random(0, 5);
+     * // => an integer between 0 and 5
      *
-     * _.isPlainObject([1, 2, 3]);
-     * // => false
+     * _.random(5);
+     * // => also an integer between 0 and 5
      *
-     * _.isPlainObject({ 'x': 0, 'y': 0 });
-     * // => true
+     * _.random(5, true);
+     * // => a floating-point number between 0 and 5
      *
-     * _.isPlainObject(Object.create(null));
-     * // => true
+     * _.random(1.2, 5.2);
+     * // => a floating-point number between 1.2 and 5.2
      */
-    function isPlainObject(value) {
-      if (!isObjectLike(value) || baseGetTag(value) != objectTag) {
-        return false;
+    function random(lower, upper, floating) {
+      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {
+        upper = floating = undefined$1;
       }
-      var proto = getPrototype(value);
-      if (proto === null) {
-        return true;
+      if (floating === undefined$1) {
+        if (typeof upper == 'boolean') {
+          floating = upper;
+          upper = undefined$1;
+        }
+        else if (typeof lower == 'boolean') {
+          floating = lower;
+          lower = undefined$1;
+        }
       }
-      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;
-      return typeof Ctor == 'function' && Ctor instanceof Ctor &&
-        funcToString.call(Ctor) == objectCtorString;
+      if (lower === undefined$1 && upper === undefined$1) {
+        lower = 0;
+        upper = 1;
+      }
+      else {
+        lower = toFinite(lower);
+        if (upper === undefined$1) {
+          upper = lower;
+          lower = 0;
+        } else {
+          upper = toFinite(upper);
+        }
+      }
+      if (lower > upper) {
+        var temp = lower;
+        lower = upper;
+        upper = temp;
+      }
+      if (floating || lower % 1 || upper % 1) {
+        var rand = nativeRandom();
+        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);
+      }
+      return baseRandom(lower, upper);
     }
 
+    /*------------------------------------------------------------------------*/
+
     /**
-     * Checks if `value` is classified as a `RegExp` object.
+     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).
      *
      * @static
      * @memberOf _
-     * @since 0.1.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the camel cased string.
      * @example
      *
-     * _.isRegExp(/abc/);
-     * // => true
+     * _.camelCase('Foo Bar');
+     * // => 'fooBar'
      *
-     * _.isRegExp('/abc/');
-     * // => false
+     * _.camelCase('--foo-bar--');
+     * // => 'fooBar'
+     *
+     * _.camelCase('__FOO_BAR__');
+     * // => 'fooBar'
      */
-    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;
+    var camelCase = createCompounder(function(result, word, index) {
+      word = word.toLowerCase();
+      return result + (index ? capitalize(word) : word);
+    });
 
     /**
-     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754
-     * double precision number which isn't the result of a rounded unsafe integer.
-     *
-     * **Note:** This method is based on
-     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).
+     * Converts the first character of `string` to upper case and the remaining
+     * to lower case.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to capitalize.
+     * @returns {string} Returns the capitalized string.
      * @example
      *
-     * _.isSafeInteger(3);
-     * // => true
-     *
-     * _.isSafeInteger(Number.MIN_VALUE);
-     * // => false
+     * _.capitalize('FRED');
+     * // => 'Fred'
+     */
+    function capitalize(string) {
+      return upperFirst(toString(string).toLowerCase());
+    }
+
+    /**
+     * Deburrs `string` by converting
+     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)
+     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)
+     * letters to basic Latin letters and removing
+     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).
      *
-     * _.isSafeInteger(Infinity);
-     * // => false
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to deburr.
+     * @returns {string} Returns the deburred string.
+     * @example
      *
-     * _.isSafeInteger('3');
-     * // => false
+     * _.deburr('déjà vu');
+     * // => 'deja vu'
      */
-    function isSafeInteger(value) {
-      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;
+    function deburr(string) {
+      string = toString(string);
+      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');
     }
 
     /**
-     * Checks if `value` is classified as a `Set` object.
+     * Checks if `string` ends with the given target string.
      *
      * @static
      * @memberOf _
-     * @since 4.3.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a set, else `false`.
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to inspect.
+     * @param {string} [target] The string to search for.
+     * @param {number} [position=string.length] The position to search up to.
+     * @returns {boolean} Returns `true` if `string` ends with `target`,
+     *  else `false`.
      * @example
      *
-     * _.isSet(new Set);
+     * _.endsWith('abc', 'c');
      * // => true
      *
-     * _.isSet(new WeakSet);
+     * _.endsWith('abc', 'b');
      * // => false
+     *
+     * _.endsWith('abc', 'b', 2);
+     * // => true
      */
-    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;
+    function endsWith(string, target, position) {
+      string = toString(string);
+      target = baseToString(target);
+
+      var length = string.length;
+      position = position === undefined$1
+        ? length
+        : baseClamp(toInteger(position), 0, length);
+
+      var end = position;
+      position -= target.length;
+      return position >= 0 && string.slice(position, end) == target;
+    }
 
     /**
-     * Checks if `value` is classified as a `String` primitive or object.
+     * Converts the characters "&", "<", ">", '"', and "'" in `string` to their
+     * corresponding HTML entities.
+     *
+     * **Note:** No other characters are escaped. To escape additional
+     * characters use a third-party library like [_he_](https://mths.be/he).
+     *
+     * Though the ">" character is escaped for symmetry, characters like
+     * ">" and "/" don't need escaping in HTML and have no special meaning
+     * unless they're part of a tag or unquoted attribute value. See
+     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)
+     * (under "semi-related fun fact") for more details.
+     *
+     * When working with HTML you should always
+     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce
+     * XSS vectors.
      *
      * @static
      * @since 0.1.0
      * @memberOf _
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a string, else `false`.
+     * @category String
+     * @param {string} [string=''] The string to escape.
+     * @returns {string} Returns the escaped string.
      * @example
      *
-     * _.isString('abc');
-     * // => true
-     *
-     * _.isString(1);
-     * // => false
+     * _.escape('fred, barney, & pebbles');
+     * // => 'fred, barney, &amp; pebbles'
      */
-    function isString(value) {
-      return typeof value == 'string' ||
-        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);
+    function escape(string) {
+      string = toString(string);
+      return (string && reHasUnescapedHtml.test(string))
+        ? string.replace(reUnescapedHtml, escapeHtmlChar)
+        : string;
     }
 
     /**
-     * Checks if `value` is classified as a `Symbol` primitive or object.
+     * Escapes the `RegExp` special characters "^", "$", "\", ".", "*", "+",
+     * "?", "(", ")", "[", "]", "{", "}", and "|" in `string`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to escape.
+     * @returns {string} Returns the escaped string.
      * @example
      *
-     * _.isSymbol(Symbol.iterator);
-     * // => true
-     *
-     * _.isSymbol('abc');
-     * // => false
+     * _.escapeRegExp('[lodash](https://lodash.com/)');
+     * // => '\[lodash\]\(https://lodash\.com/\)'
      */
-    function isSymbol(value) {
-      return typeof value == 'symbol' ||
-        (isObjectLike(value) && baseGetTag(value) == symbolTag);
+    function escapeRegExp(string) {
+      string = toString(string);
+      return (string && reHasRegExpChar.test(string))
+        ? string.replace(reRegExpChar, '\\$&')
+        : string;
     }
 
     /**
-     * Checks if `value` is classified as a typed array.
+     * Converts `string` to
+     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).
      *
      * @static
      * @memberOf _
      * @since 3.0.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the kebab cased string.
      * @example
      *
-     * _.isTypedArray(new Uint8Array);
-     * // => true
+     * _.kebabCase('Foo Bar');
+     * // => 'foo-bar'
      *
-     * _.isTypedArray([]);
-     * // => false
+     * _.kebabCase('fooBar');
+     * // => 'foo-bar'
+     *
+     * _.kebabCase('__FOO_BAR__');
+     * // => 'foo-bar'
      */
-    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;
+    var kebabCase = createCompounder(function(result, word, index) {
+      return result + (index ? '-' : '') + word.toLowerCase();
+    });
 
     /**
-     * Checks if `value` is `undefined`.
+     * Converts `string`, as space separated words, to lower case.
      *
      * @static
-     * @since 0.1.0
      * @memberOf _
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the lower cased string.
      * @example
      *
-     * _.isUndefined(void 0);
-     * // => true
+     * _.lowerCase('--Foo-Bar--');
+     * // => 'foo bar'
      *
-     * _.isUndefined(null);
-     * // => false
+     * _.lowerCase('fooBar');
+     * // => 'foo bar'
+     *
+     * _.lowerCase('__FOO_BAR__');
+     * // => 'foo bar'
      */
-    function isUndefined(value) {
-      return value === undefined$1;
-    }
+    var lowerCase = createCompounder(function(result, word, index) {
+      return result + (index ? ' ' : '') + word.toLowerCase();
+    });
 
     /**
-     * Checks if `value` is classified as a `WeakMap` object.
+     * Converts the first character of `string` to lower case.
      *
      * @static
      * @memberOf _
-     * @since 4.3.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the converted string.
      * @example
      *
-     * _.isWeakMap(new WeakMap);
-     * // => true
+     * _.lowerFirst('Fred');
+     * // => 'fred'
      *
-     * _.isWeakMap(new Map);
-     * // => false
+     * _.lowerFirst('FRED');
+     * // => 'fRED'
      */
-    function isWeakMap(value) {
-      return isObjectLike(value) && getTag(value) == weakMapTag;
-    }
+    var lowerFirst = createCaseFirst('toLowerCase');
 
     /**
-     * Checks if `value` is classified as a `WeakSet` object.
+     * Pads `string` on the left and right sides if it's shorter than `length`.
+     * Padding characters are truncated if they can't be evenly divided by `length`.
      *
      * @static
      * @memberOf _
-     * @since 4.3.0
-     * @category Lang
-     * @param {*} value The value to check.
-     * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to pad.
+     * @param {number} [length=0] The padding length.
+     * @param {string} [chars=' '] The string used as padding.
+     * @returns {string} Returns the padded string.
      * @example
      *
-     * _.isWeakSet(new WeakSet);
-     * // => true
+     * _.pad('abc', 8);
+     * // => '  abc   '
      *
-     * _.isWeakSet(new Set);
-     * // => false
+     * _.pad('abc', 8, '_-');
+     * // => '_-abc_-_'
+     *
+     * _.pad('abc', 3);
+     * // => 'abc'
      */
-    function isWeakSet(value) {
-      return isObjectLike(value) && baseGetTag(value) == weakSetTag;
+    function pad(string, length, chars) {
+      string = toString(string);
+      length = toInteger(length);
+
+      var strLength = length ? stringSize(string) : 0;
+      if (!length || strLength >= length) {
+        return string;
+      }
+      var mid = (length - strLength) / 2;
+      return (
+        createPadding(nativeFloor(mid), chars) +
+        string +
+        createPadding(nativeCeil(mid), chars)
+      );
     }
 
     /**
-     * Checks if `value` is less than `other`.
+     * Pads `string` on the right side if it's shorter than `length`. Padding
+     * characters are truncated if they exceed `length`.
      *
      * @static
      * @memberOf _
-     * @since 3.9.0
-     * @category Lang
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is less than `other`,
-     *  else `false`.
-     * @see _.gt
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to pad.
+     * @param {number} [length=0] The padding length.
+     * @param {string} [chars=' '] The string used as padding.
+     * @returns {string} Returns the padded string.
      * @example
      *
-     * _.lt(1, 3);
-     * // => true
+     * _.padEnd('abc', 6);
+     * // => 'abc   '
      *
-     * _.lt(3, 3);
-     * // => false
+     * _.padEnd('abc', 6, '_-');
+     * // => 'abc_-_'
      *
-     * _.lt(3, 1);
-     * // => false
+     * _.padEnd('abc', 3);
+     * // => 'abc'
      */
-    var lt = createRelationalOperation(baseLt);
+    function padEnd(string, length, chars) {
+      string = toString(string);
+      length = toInteger(length);
+
+      var strLength = length ? stringSize(string) : 0;
+      return (length && strLength < length)
+        ? (string + createPadding(length - strLength, chars))
+        : string;
+    }
 
     /**
-     * Checks if `value` is less than or equal to `other`.
+     * Pads `string` on the left side if it's shorter than `length`. Padding
+     * characters are truncated if they exceed `length`.
      *
      * @static
      * @memberOf _
-     * @since 3.9.0
-     * @category Lang
-     * @param {*} value The value to compare.
-     * @param {*} other The other value to compare.
-     * @returns {boolean} Returns `true` if `value` is less than or equal to
-     *  `other`, else `false`.
-     * @see _.gte
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to pad.
+     * @param {number} [length=0] The padding length.
+     * @param {string} [chars=' '] The string used as padding.
+     * @returns {string} Returns the padded string.
      * @example
      *
-     * _.lte(1, 3);
-     * // => true
+     * _.padStart('abc', 6);
+     * // => '   abc'
      *
-     * _.lte(3, 3);
-     * // => true
+     * _.padStart('abc', 6, '_-');
+     * // => '_-_abc'
      *
-     * _.lte(3, 1);
-     * // => false
+     * _.padStart('abc', 3);
+     * // => 'abc'
      */
-    var lte = createRelationalOperation(function(value, other) {
-      return value <= other;
-    });
+    function padStart(string, length, chars) {
+      string = toString(string);
+      length = toInteger(length);
+
+      var strLength = length ? stringSize(string) : 0;
+      return (length && strLength < length)
+        ? (createPadding(length - strLength, chars) + string)
+        : string;
+    }
 
     /**
-     * Converts `value` to an array.
+     * Converts `string` to an integer of the specified radix. If `radix` is
+     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a
+     * hexadecimal, in which case a `radix` of `16` is used.
+     *
+     * **Note:** This method aligns with the
+     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.
      *
      * @static
-     * @since 0.1.0
      * @memberOf _
-     * @category Lang
-     * @param {*} value The value to convert.
-     * @returns {Array} Returns the converted array.
+     * @since 1.1.0
+     * @category String
+     * @param {string} string The string to convert.
+     * @param {number} [radix=10] The radix to interpret `value` by.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {number} Returns the converted integer.
      * @example
      *
-     * _.toArray({ 'a': 1, 'b': 2 });
-     * // => [1, 2]
-     *
-     * _.toArray('abc');
-     * // => ['a', 'b', 'c']
-     *
-     * _.toArray(1);
-     * // => []
+     * _.parseInt('08');
+     * // => 8
      *
-     * _.toArray(null);
-     * // => []
+     * _.map(['6', '08', '10'], _.parseInt);
+     * // => [6, 8, 10]
      */
-    function toArray(value) {
-      if (!value) {
-        return [];
-      }
-      if (isArrayLike(value)) {
-        return isString(value) ? stringToArray(value) : copyArray(value);
-      }
-      if (symIterator && value[symIterator]) {
-        return iteratorToArray(value[symIterator]());
+    function parseInt(string, radix, guard) {
+      if (guard || radix == null) {
+        radix = 0;
+      } else if (radix) {
+        radix = +radix;
       }
-      var tag = getTag(value),
-          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);
-
-      return func(value);
+      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);
     }
 
     /**
-     * Converts `value` to a finite number.
+     * Repeats the given string `n` times.
      *
      * @static
      * @memberOf _
-     * @since 4.12.0
-     * @category Lang
-     * @param {*} value The value to convert.
-     * @returns {number} Returns the converted number.
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to repeat.
+     * @param {number} [n=1] The number of times to repeat the string.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {string} Returns the repeated string.
      * @example
      *
-     * _.toFinite(3.2);
-     * // => 3.2
-     *
-     * _.toFinite(Number.MIN_VALUE);
-     * // => 5e-324
+     * _.repeat('*', 3);
+     * // => '***'
      *
-     * _.toFinite(Infinity);
-     * // => 1.7976931348623157e+308
+     * _.repeat('abc', 2);
+     * // => 'abcabc'
      *
-     * _.toFinite('3.2');
-     * // => 3.2
+     * _.repeat('abc', 0);
+     * // => ''
      */
-    function toFinite(value) {
-      if (!value) {
-        return value === 0 ? value : 0;
-      }
-      value = toNumber(value);
-      if (value === INFINITY || value === -INFINITY) {
-        var sign = (value < 0 ? -1 : 1);
-        return sign * MAX_INTEGER;
+    function repeat(string, n, guard) {
+      if ((guard ? isIterateeCall(string, n, guard) : n === undefined$1)) {
+        n = 1;
+      } else {
+        n = toInteger(n);
       }
-      return value === value ? value : 0;
+      return baseRepeat(toString(string), n);
     }
 
     /**
-     * Converts `value` to an integer.
+     * Replaces matches for `pattern` in `string` with `replacement`.
      *
-     * **Note:** This method is loosely based on
-     * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).
+     * **Note:** This method is based on
+     * [`String#replace`](https://mdn.io/String/replace).
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to convert.
-     * @returns {number} Returns the converted integer.
+     * @category String
+     * @param {string} [string=''] The string to modify.
+     * @param {RegExp|string} pattern The pattern to replace.
+     * @param {Function|string} replacement The match replacement.
+     * @returns {string} Returns the modified string.
      * @example
      *
-     * _.toInteger(3.2);
-     * // => 3
-     *
-     * _.toInteger(Number.MIN_VALUE);
-     * // => 0
-     *
-     * _.toInteger(Infinity);
-     * // => 1.7976931348623157e+308
-     *
-     * _.toInteger('3.2');
-     * // => 3
+     * _.replace('Hi Fred', 'Fred', 'Barney');
+     * // => 'Hi Barney'
      */
-    function toInteger(value) {
-      var result = toFinite(value),
-          remainder = result % 1;
+    function replace() {
+      var args = arguments,
+          string = toString(args[0]);
 
-      return result === result ? (remainder ? result - remainder : result) : 0;
+      return args.length < 3 ? string : string.replace(args[1], args[2]);
     }
 
     /**
-     * Converts `value` to an integer suitable for use as the length of an
-     * array-like object.
-     *
-     * **Note:** This method is based on
-     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).
+     * Converts `string` to
+     * [snake case](https://en.wikipedia.org/wiki/Snake_case).
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to convert.
-     * @returns {number} Returns the converted integer.
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the snake cased string.
      * @example
      *
-     * _.toLength(3.2);
-     * // => 3
-     *
-     * _.toLength(Number.MIN_VALUE);
-     * // => 0
+     * _.snakeCase('Foo Bar');
+     * // => 'foo_bar'
      *
-     * _.toLength(Infinity);
-     * // => 4294967295
+     * _.snakeCase('fooBar');
+     * // => 'foo_bar'
      *
-     * _.toLength('3.2');
-     * // => 3
+     * _.snakeCase('--FOO-BAR--');
+     * // => 'foo_bar'
      */
-    function toLength(value) {
-      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;
-    }
+    var snakeCase = createCompounder(function(result, word, index) {
+      return result + (index ? '_' : '') + word.toLowerCase();
+    });
 
     /**
-     * Converts `value` to a number.
+     * Splits `string` by `separator`.
+     *
+     * **Note:** This method is based on
+     * [`String#split`](https://mdn.io/String/split).
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to process.
-     * @returns {number} Returns the number.
+     * @category String
+     * @param {string} [string=''] The string to split.
+     * @param {RegExp|string} separator The separator pattern to split by.
+     * @param {number} [limit] The length to truncate results to.
+     * @returns {Array} Returns the string segments.
      * @example
      *
-     * _.toNumber(3.2);
-     * // => 3.2
-     *
-     * _.toNumber(Number.MIN_VALUE);
-     * // => 5e-324
-     *
-     * _.toNumber(Infinity);
-     * // => Infinity
-     *
-     * _.toNumber('3.2');
-     * // => 3.2
+     * _.split('a-b-c', '-', 2);
+     * // => ['a', 'b']
      */
-    function toNumber(value) {
-      if (typeof value == 'number') {
-        return value;
-      }
-      if (isSymbol(value)) {
-        return NAN;
+    function split(string, separator, limit) {
+      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {
+        separator = limit = undefined$1;
       }
-      if (isObject(value)) {
-        var other = typeof value.valueOf == 'function' ? value.valueOf() : value;
-        value = isObject(other) ? (other + '') : other;
+      limit = limit === undefined$1 ? MAX_ARRAY_LENGTH : limit >>> 0;
+      if (!limit) {
+        return [];
       }
-      if (typeof value != 'string') {
-        return value === 0 ? value : +value;
+      string = toString(string);
+      if (string && (
+            typeof separator == 'string' ||
+            (separator != null && !isRegExp(separator))
+          )) {
+        separator = baseToString(separator);
+        if (!separator && hasUnicode(string)) {
+          return castSlice(stringToArray(string), 0, limit);
+        }
       }
-      value = baseTrim(value);
-      var isBinary = reIsBinary.test(value);
-      return (isBinary || reIsOctal.test(value))
-        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)
-        : (reIsBadHex.test(value) ? NAN : +value);
+      return string.split(separator, limit);
     }
 
     /**
-     * Converts `value` to a plain object flattening inherited enumerable string
-     * keyed properties of `value` to own properties of the plain object.
+     * Converts `string` to
+     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).
+     *
+     * @static
+     * @memberOf _
+     * @since 3.1.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the start cased string.
+     * @example
+     *
+     * _.startCase('--foo-bar--');
+     * // => 'Foo Bar'
+     *
+     * _.startCase('fooBar');
+     * // => 'Foo Bar'
+     *
+     * _.startCase('__FOO_BAR__');
+     * // => 'FOO BAR'
+     */
+    var startCase = createCompounder(function(result, word, index) {
+      return result + (index ? ' ' : '') + upperFirst(word);
+    });
+
+    /**
+     * Checks if `string` starts with the given target string.
      *
      * @static
      * @memberOf _
      * @since 3.0.0
-     * @category Lang
-     * @param {*} value The value to convert.
-     * @returns {Object} Returns the converted plain object.
+     * @category String
+     * @param {string} [string=''] The string to inspect.
+     * @param {string} [target] The string to search for.
+     * @param {number} [position=0] The position to search from.
+     * @returns {boolean} Returns `true` if `string` starts with `target`,
+     *  else `false`.
      * @example
      *
-     * function Foo() {
-     *   this.b = 2;
-     * }
-     *
-     * Foo.prototype.c = 3;
+     * _.startsWith('abc', 'a');
+     * // => true
      *
-     * _.assign({ 'a': 1 }, new Foo);
-     * // => { 'a': 1, 'b': 2 }
+     * _.startsWith('abc', 'b');
+     * // => false
      *
-     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));
-     * // => { 'a': 1, 'b': 2, 'c': 3 }
+     * _.startsWith('abc', 'b', 1);
+     * // => true
      */
-    function toPlainObject(value) {
-      return copyObject(value, keysIn(value));
+    function startsWith(string, target, position) {
+      string = toString(string);
+      position = position == null
+        ? 0
+        : baseClamp(toInteger(position), 0, string.length);
+
+      target = baseToString(target);
+      return string.slice(position, position + target.length) == target;
     }
 
     /**
-     * Converts `value` to a safe integer. A safe integer can be compared and
-     * represented correctly.
+     * Creates a compiled template function that can interpolate data properties
+     * in "interpolate" delimiters, HTML-escape interpolated data properties in
+     * "escape" delimiters, and execute JavaScript in "evaluate" delimiters. Data
+     * properties may be accessed as free variables in the template. If a setting
+     * object is given, it takes precedence over `_.templateSettings` values.
+     *
+     * **Note:** In the development build `_.template` utilizes
+     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)
+     * for easier debugging.
+     *
+     * For more information on precompiling templates see
+     * [lodash's custom builds documentation](https://lodash.com/custom-builds).
+     *
+     * For more information on Chrome extension sandboxes see
+     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to convert.
-     * @returns {number} Returns the converted integer.
+     * @category String
+     * @param {string} [string=''] The template string.
+     * @param {Object} [options={}] The options object.
+     * @param {RegExp} [options.escape=_.templateSettings.escape]
+     *  The HTML "escape" delimiter.
+     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]
+     *  The "evaluate" delimiter.
+     * @param {Object} [options.imports=_.templateSettings.imports]
+     *  An object to import into the template as free variables.
+     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]
+     *  The "interpolate" delimiter.
+     * @param {string} [options.sourceURL='lodash.templateSources[n]']
+     *  The sourceURL of the compiled template.
+     * @param {string} [options.variable='obj']
+     *  The data object variable name.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Function} Returns the compiled template function.
      * @example
      *
-     * _.toSafeInteger(3.2);
-     * // => 3
+     * // Use the "interpolate" delimiter to create a compiled template.
+     * var compiled = _.template('hello <%= user %>!');
+     * compiled({ 'user': 'fred' });
+     * // => 'hello fred!'
      *
-     * _.toSafeInteger(Number.MIN_VALUE);
-     * // => 0
+     * // Use the HTML "escape" delimiter to escape data property values.
+     * var compiled = _.template('<b><%- value %></b>');
+     * compiled({ 'value': '<script>' });
+     * // => '<b>&lt;script&gt;</b>'
      *
-     * _.toSafeInteger(Infinity);
-     * // => 9007199254740991
+     * // Use the "evaluate" delimiter to execute JavaScript and generate HTML.
+     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');
+     * compiled({ 'users': ['fred', 'barney'] });
+     * // => '<li>fred</li><li>barney</li>'
      *
-     * _.toSafeInteger('3.2');
-     * // => 3
+     * // Use the internal `print` function in "evaluate" delimiters.
+     * var compiled = _.template('<% print("hello " + user); %>!');
+     * compiled({ 'user': 'barney' });
+     * // => 'hello barney!'
+     *
+     * // Use the ES template literal delimiter as an "interpolate" delimiter.
+     * // Disable support by replacing the "interpolate" delimiter.
+     * var compiled = _.template('hello ${ user }!');
+     * compiled({ 'user': 'pebbles' });
+     * // => 'hello pebbles!'
+     *
+     * // Use backslashes to treat delimiters as plain text.
+     * var compiled = _.template('<%= "\\<%- value %\\>" %>');
+     * compiled({ 'value': 'ignored' });
+     * // => '<%- value %>'
+     *
+     * // Use the `imports` option to import `jQuery` as `jq`.
+     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';
+     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });
+     * compiled({ 'users': ['fred', 'barney'] });
+     * // => '<li>fred</li><li>barney</li>'
+     *
+     * // Use the `sourceURL` option to specify a custom sourceURL for the template.
+     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });
+     * compiled(data);
+     * // => Find the source of "greeting.jst" under the Sources tab or Resources panel of the web inspector.
+     *
+     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.
+     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });
+     * compiled.source;
+     * // => function(data) {
+     * //   var __t, __p = '';
+     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';
+     * //   return __p;
+     * // }
+     *
+     * // Use custom template delimiters.
+     * _.templateSettings.interpolate = /{{([\s\S]+?)}}/g;
+     * var compiled = _.template('hello {{ user }}!');
+     * compiled({ 'user': 'mustache' });
+     * // => 'hello mustache!'
+     *
+     * // Use the `source` property to inline compiled templates for meaningful
+     * // line numbers in error messages and stack traces.
+     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\
+     *   var JST = {\
+     *     "main": ' + _.template(mainText).source + '\
+     *   };\
+     * ');
      */
-    function toSafeInteger(value) {
-      return value
-        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)
-        : (value === 0 ? value : 0);
+    function template(string, options, guard) {
+      // Based on John Resig's `tmpl` implementation
+      // (http://ejohn.org/blog/javascript-micro-templating/)
+      // and Laura Doktorova's doT.js (https://github.com/olado/doT).
+      var settings = lodash.templateSettings;
+
+      if (guard && isIterateeCall(string, options, guard)) {
+        options = undefined$1;
+      }
+      string = toString(string);
+      options = assignInWith({}, options, settings, customDefaultsAssignIn);
+
+      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),
+          importsKeys = keys(imports),
+          importsValues = baseValues(imports, importsKeys);
+
+      var isEscaping,
+          isEvaluating,
+          index = 0,
+          interpolate = options.interpolate || reNoMatch,
+          source = "__p += '";
+
+      // Compile the regexp to match each delimiter.
+      var reDelimiters = RegExp(
+        (options.escape || reNoMatch).source + '|' +
+        interpolate.source + '|' +
+        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +
+        (options.evaluate || reNoMatch).source + '|$'
+      , 'g');
+
+      // Use a sourceURL for easier debugging.
+      // The sourceURL gets injected into the source that's eval-ed, so be careful
+      // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in
+      // and escape the comment, thus injecting code that gets evaled.
+      var sourceURL = '//# sourceURL=' +
+        (hasOwnProperty.call(options, 'sourceURL')
+          ? (options.sourceURL + '').replace(/\s/g, ' ')
+          : ('lodash.templateSources[' + (++templateCounter) + ']')
+        ) + '\n';
+
+      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {
+        interpolateValue || (interpolateValue = esTemplateValue);
+
+        // Escape characters that can't be included in string literals.
+        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);
+
+        // Replace delimiters with snippets.
+        if (escapeValue) {
+          isEscaping = true;
+          source += "' +\n__e(" + escapeValue + ") +\n'";
+        }
+        if (evaluateValue) {
+          isEvaluating = true;
+          source += "';\n" + evaluateValue + ";\n__p += '";
+        }
+        if (interpolateValue) {
+          source += "' +\n((__t = (" + interpolateValue + ")) == null ? '' : __t) +\n'";
+        }
+        index = offset + match.length;
+
+        // The JS engine embedded in Adobe products needs `match` returned in
+        // order to produce the correct `offset` value.
+        return match;
+      });
+
+      source += "';\n";
+
+      // If `variable` is not specified wrap a with-statement around the generated
+      // code to add the data object to the top of the scope chain.
+      var variable = hasOwnProperty.call(options, 'variable') && options.variable;
+      if (!variable) {
+        source = 'with (obj) {\n' + source + '\n}\n';
+      }
+      // Throw an error if a forbidden character was found in `variable`, to prevent
+      // potential command injection attacks.
+      else if (reForbiddenIdentifierChars.test(variable)) {
+        throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);
+      }
+
+      // Cleanup code by stripping empty strings.
+      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)
+        .replace(reEmptyStringMiddle, '$1')
+        .replace(reEmptyStringTrailing, '$1;');
+
+      // Frame code as the function body.
+      source = 'function(' + (variable || 'obj') + ') {\n' +
+        (variable
+          ? ''
+          : 'obj || (obj = {});\n'
+        ) +
+        "var __t, __p = ''" +
+        (isEscaping
+           ? ', __e = _.escape'
+           : ''
+        ) +
+        (isEvaluating
+          ? ', __j = Array.prototype.join;\n' +
+            "function print() { __p += __j.call(arguments, '') }\n"
+          : ';\n'
+        ) +
+        source +
+        'return __p\n}';
+
+      var result = attempt(function() {
+        return Function(importsKeys, sourceURL + 'return ' + source)
+          .apply(undefined$1, importsValues);
+      });
+
+      // Provide the compiled function's source by its `toString` method or
+      // the `source` property as a convenience for inlining compiled templates.
+      result.source = source;
+      if (isError(result)) {
+        throw result;
+      }
+      return result;
     }
 
     /**
-     * Converts `value` to a string. An empty string is returned for `null`
-     * and `undefined` values. The sign of `-0` is preserved.
+     * Converts `string`, as a whole, to lower case just like
+     * [String#toLowerCase](https://mdn.io/toLowerCase).
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Lang
-     * @param {*} value The value to convert.
-     * @returns {string} Returns the converted string.
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the lower cased string.
      * @example
      *
-     * _.toString(null);
-     * // => ''
+     * _.toLower('--Foo-Bar--');
+     * // => '--foo-bar--'
      *
-     * _.toString(-0);
-     * // => '-0'
+     * _.toLower('fooBar');
+     * // => 'foobar'
      *
-     * _.toString([1, 2, 3]);
-     * // => '1,2,3'
+     * _.toLower('__FOO_BAR__');
+     * // => '__foo_bar__'
      */
-    function toString(value) {
-      return value == null ? '' : baseToString(value);
+    function toLower(value) {
+      return toString(value).toLowerCase();
     }
 
-    /*------------------------------------------------------------------------*/
-
-    /**
-     * Assigns own enumerable string keyed properties of source objects to the
-     * destination object. Source objects are applied from left to right.
-     * Subsequent sources overwrite property assignments of previous sources.
-     *
-     * **Note:** This method mutates `object` and is loosely based on
-     * [`Object.assign`](https://mdn.io/Object/assign).
-     *
-     * @static
-     * @memberOf _
-     * @since 0.10.0
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} [sources] The source objects.
-     * @returns {Object} Returns `object`.
-     * @see _.assignIn
-     * @example
-     *
-     * function Foo() {
-     *   this.a = 1;
-     * }
-     *
-     * function Bar() {
-     *   this.c = 3;
-     * }
-     *
-     * Foo.prototype.b = 2;
-     * Bar.prototype.d = 4;
-     *
-     * _.assign({ 'a': 0 }, new Foo, new Bar);
-     * // => { 'a': 1, 'c': 3 }
-     */
-    var assign = createAssigner(function(object, source) {
-      if (isPrototype(source) || isArrayLike(source)) {
-        copyObject(source, keys(source), object);
-        return;
-      }
-      for (var key in source) {
-        if (hasOwnProperty.call(source, key)) {
-          assignValue(object, key, source[key]);
-        }
-      }
-    });
-
     /**
-     * This method is like `_.assign` except that it iterates over own and
-     * inherited source properties.
-     *
-     * **Note:** This method mutates `object`.
+     * Converts `string`, as a whole, to upper case just like
+     * [String#toUpperCase](https://mdn.io/toUpperCase).
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @alias extend
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} [sources] The source objects.
-     * @returns {Object} Returns `object`.
-     * @see _.assign
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the upper cased string.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     * }
-     *
-     * function Bar() {
-     *   this.c = 3;
-     * }
+     * _.toUpper('--foo-bar--');
+     * // => '--FOO-BAR--'
      *
-     * Foo.prototype.b = 2;
-     * Bar.prototype.d = 4;
+     * _.toUpper('fooBar');
+     * // => 'FOOBAR'
      *
-     * _.assignIn({ 'a': 0 }, new Foo, new Bar);
-     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }
+     * _.toUpper('__foo_bar__');
+     * // => '__FOO_BAR__'
      */
-    var assignIn = createAssigner(function(object, source) {
-      copyObject(source, keysIn(source), object);
-    });
+    function toUpper(value) {
+      return toString(value).toUpperCase();
+    }
 
     /**
-     * This method is like `_.assignIn` except that it accepts `customizer`
-     * which is invoked to produce the assigned values. If `customizer` returns
-     * `undefined`, assignment is handled by the method instead. The `customizer`
-     * is invoked with five arguments: (objValue, srcValue, key, object, source).
-     *
-     * **Note:** This method mutates `object`.
+     * Removes leading and trailing whitespace or specified characters from `string`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @alias extendWith
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} sources The source objects.
-     * @param {Function} [customizer] The function to customize assigned values.
-     * @returns {Object} Returns `object`.
-     * @see _.assignWith
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to trim.
+     * @param {string} [chars=whitespace] The characters to trim.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {string} Returns the trimmed string.
      * @example
      *
-     * function customizer(objValue, srcValue) {
-     *   return _.isUndefined(objValue) ? srcValue : objValue;
-     * }
+     * _.trim('  abc  ');
+     * // => 'abc'
      *
-     * var defaults = _.partialRight(_.assignInWith, customizer);
+     * _.trim('-_-abc-_-', '_-');
+     * // => 'abc'
      *
-     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
-     * // => { 'a': 1, 'b': 2 }
+     * _.map(['  foo  ', '  bar  '], _.trim);
+     * // => ['foo', 'bar']
      */
-    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {
-      copyObject(source, keysIn(source), object, customizer);
-    });
+    function trim(string, chars, guard) {
+      string = toString(string);
+      if (string && (guard || chars === undefined$1)) {
+        return baseTrim(string);
+      }
+      if (!string || !(chars = baseToString(chars))) {
+        return string;
+      }
+      var strSymbols = stringToArray(string),
+          chrSymbols = stringToArray(chars),
+          start = charsStartIndex(strSymbols, chrSymbols),
+          end = charsEndIndex(strSymbols, chrSymbols) + 1;
+
+      return castSlice(strSymbols, start, end).join('');
+    }
 
     /**
-     * This method is like `_.assign` except that it accepts `customizer`
-     * which is invoked to produce the assigned values. If `customizer` returns
-     * `undefined`, assignment is handled by the method instead. The `customizer`
-     * is invoked with five arguments: (objValue, srcValue, key, object, source).
-     *
-     * **Note:** This method mutates `object`.
+     * Removes trailing whitespace or specified characters from `string`.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} sources The source objects.
-     * @param {Function} [customizer] The function to customize assigned values.
-     * @returns {Object} Returns `object`.
-     * @see _.assignInWith
+     * @category String
+     * @param {string} [string=''] The string to trim.
+     * @param {string} [chars=whitespace] The characters to trim.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {string} Returns the trimmed string.
      * @example
      *
-     * function customizer(objValue, srcValue) {
-     *   return _.isUndefined(objValue) ? srcValue : objValue;
-     * }
-     *
-     * var defaults = _.partialRight(_.assignWith, customizer);
+     * _.trimEnd('  abc  ');
+     * // => '  abc'
      *
-     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
-     * // => { 'a': 1, 'b': 2 }
+     * _.trimEnd('-_-abc-_-', '_-');
+     * // => '-_-abc'
      */
-    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {
-      copyObject(source, keys(source), object, customizer);
-    });
+    function trimEnd(string, chars, guard) {
+      string = toString(string);
+      if (string && (guard || chars === undefined$1)) {
+        return string.slice(0, trimmedEndIndex(string) + 1);
+      }
+      if (!string || !(chars = baseToString(chars))) {
+        return string;
+      }
+      var strSymbols = stringToArray(string),
+          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;
 
-    /**
-     * Creates an array of values corresponding to `paths` of `object`.
-     *
-     * @static
-     * @memberOf _
-     * @since 1.0.0
-     * @category Object
-     * @param {Object} object The object to iterate over.
-     * @param {...(string|string[])} [paths] The property paths to pick.
-     * @returns {Array} Returns the picked values.
-     * @example
-     *
-     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };
-     *
-     * _.at(object, ['a[0].b.c', 'a[1]']);
-     * // => [3, 4]
-     */
-    var at = flatRest(baseAt);
+      return castSlice(strSymbols, 0, end).join('');
+    }
 
     /**
-     * Creates an object that inherits from the `prototype` object. If a
-     * `properties` object is given, its own enumerable string keyed properties
-     * are assigned to the created object.
+     * Removes leading whitespace or specified characters from `string`.
      *
      * @static
      * @memberOf _
-     * @since 2.3.0
-     * @category Object
-     * @param {Object} prototype The object to inherit from.
-     * @param {Object} [properties] The properties to assign to the object.
-     * @returns {Object} Returns the new object.
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to trim.
+     * @param {string} [chars=whitespace] The characters to trim.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {string} Returns the trimmed string.
      * @example
      *
-     * function Shape() {
-     *   this.x = 0;
-     *   this.y = 0;
-     * }
-     *
-     * function Circle() {
-     *   Shape.call(this);
-     * }
-     *
-     * Circle.prototype = _.create(Shape.prototype, {
-     *   'constructor': Circle
-     * });
-     *
-     * var circle = new Circle;
-     * circle instanceof Circle;
-     * // => true
+     * _.trimStart('  abc  ');
+     * // => 'abc  '
      *
-     * circle instanceof Shape;
-     * // => true
+     * _.trimStart('-_-abc-_-', '_-');
+     * // => 'abc-_-'
      */
-    function create(prototype, properties) {
-      var result = baseCreate(prototype);
-      return properties == null ? result : baseAssign(result, properties);
+    function trimStart(string, chars, guard) {
+      string = toString(string);
+      if (string && (guard || chars === undefined$1)) {
+        return string.replace(reTrimStart, '');
+      }
+      if (!string || !(chars = baseToString(chars))) {
+        return string;
+      }
+      var strSymbols = stringToArray(string),
+          start = charsStartIndex(strSymbols, stringToArray(chars));
+
+      return castSlice(strSymbols, start).join('');
     }
 
     /**
-     * Assigns own and inherited enumerable string keyed properties of source
-     * objects to the destination object for all destination properties that
-     * resolve to `undefined`. Source objects are applied from left to right.
-     * Once a property is set, additional values of the same property are ignored.
-     *
-     * **Note:** This method mutates `object`.
+     * Truncates `string` if it's longer than the given maximum string length.
+     * The last characters of the truncated string are replaced with the omission
+     * string which defaults to "...".
      *
      * @static
-     * @since 0.1.0
      * @memberOf _
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} [sources] The source objects.
-     * @returns {Object} Returns `object`.
-     * @see _.defaultsDeep
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to truncate.
+     * @param {Object} [options={}] The options object.
+     * @param {number} [options.length=30] The maximum string length.
+     * @param {string} [options.omission='...'] The string to indicate text is omitted.
+     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.
+     * @returns {string} Returns the truncated string.
      * @example
      *
-     * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });
-     * // => { 'a': 1, 'b': 2 }
+     * _.truncate('hi-diddly-ho there, neighborino');
+     * // => 'hi-diddly-ho there, neighbo...'
+     *
+     * _.truncate('hi-diddly-ho there, neighborino', {
+     *   'length': 24,
+     *   'separator': ' '
+     * });
+     * // => 'hi-diddly-ho there,...'
+     *
+     * _.truncate('hi-diddly-ho there, neighborino', {
+     *   'length': 24,
+     *   'separator': /,? +/
+     * });
+     * // => 'hi-diddly-ho there...'
+     *
+     * _.truncate('hi-diddly-ho there, neighborino', {
+     *   'omission': ' [...]'
+     * });
+     * // => 'hi-diddly-ho there, neig [...]'
      */
-    var defaults = baseRest(function(object, sources) {
-      object = Object(object);
-
-      var index = -1;
-      var length = sources.length;
-      var guard = length > 2 ? sources[2] : undefined$1;
+    function truncate(string, options) {
+      var length = DEFAULT_TRUNC_LENGTH,
+          omission = DEFAULT_TRUNC_OMISSION;
 
-      if (guard && isIterateeCall(sources[0], sources[1], guard)) {
-        length = 1;
+      if (isObject(options)) {
+        var separator = 'separator' in options ? options.separator : separator;
+        length = 'length' in options ? toInteger(options.length) : length;
+        omission = 'omission' in options ? baseToString(options.omission) : omission;
       }
+      string = toString(string);
 
-      while (++index < length) {
-        var source = sources[index];
-        var props = keysIn(source);
-        var propsIndex = -1;
-        var propsLength = props.length;
+      var strLength = string.length;
+      if (hasUnicode(string)) {
+        var strSymbols = stringToArray(string);
+        strLength = strSymbols.length;
+      }
+      if (length >= strLength) {
+        return string;
+      }
+      var end = length - stringSize(omission);
+      if (end < 1) {
+        return omission;
+      }
+      var result = strSymbols
+        ? castSlice(strSymbols, 0, end).join('')
+        : string.slice(0, end);
 
-        while (++propsIndex < propsLength) {
-          var key = props[propsIndex];
-          var value = object[key];
+      if (separator === undefined$1) {
+        return result + omission;
+      }
+      if (strSymbols) {
+        end += (result.length - end);
+      }
+      if (isRegExp(separator)) {
+        if (string.slice(end).search(separator)) {
+          var match,
+              substring = result;
 
-          if (value === undefined$1 ||
-              (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {
-            object[key] = source[key];
+          if (!separator.global) {
+            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');
+          }
+          separator.lastIndex = 0;
+          while ((match = separator.exec(substring))) {
+            var newEnd = match.index;
           }
+          result = result.slice(0, newEnd === undefined$1 ? end : newEnd);
+        }
+      } else if (string.indexOf(baseToString(separator), end) != end) {
+        var index = result.lastIndexOf(separator);
+        if (index > -1) {
+          result = result.slice(0, index);
         }
       }
-
-      return object;
-    });
+      return result + omission;
+    }
 
     /**
-     * This method is like `_.defaults` except that it recursively assigns
-     * default properties.
+     * The inverse of `_.escape`; this method converts the HTML entities
+     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to
+     * their corresponding characters.
      *
-     * **Note:** This method mutates `object`.
+     * **Note:** No other HTML entities are unescaped. To unescape additional
+     * HTML entities use a third-party library like [_he_](https://mths.be/he).
      *
      * @static
      * @memberOf _
-     * @since 3.10.0
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} [sources] The source objects.
-     * @returns {Object} Returns `object`.
-     * @see _.defaults
+     * @since 0.6.0
+     * @category String
+     * @param {string} [string=''] The string to unescape.
+     * @returns {string} Returns the unescaped string.
      * @example
      *
-     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });
-     * // => { 'a': { 'b': 2, 'c': 3 } }
+     * _.unescape('fred, barney, &amp; pebbles');
+     * // => 'fred, barney, & pebbles'
      */
-    var defaultsDeep = baseRest(function(args) {
-      args.push(undefined$1, customDefaultsMerge);
-      return apply(mergeWith, undefined$1, args);
-    });
+    function unescape(string) {
+      string = toString(string);
+      return (string && reHasEscapedHtml.test(string))
+        ? string.replace(reEscapedHtml, unescapeHtmlChar)
+        : string;
+    }
 
     /**
-     * This method is like `_.find` except that it returns the key of the first
-     * element `predicate` returns truthy for instead of the element itself.
+     * Converts `string`, as space separated words, to upper case.
      *
      * @static
      * @memberOf _
-     * @since 1.1.0
-     * @category Object
-     * @param {Object} object The object to inspect.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {string|undefined} Returns the key of the matched element,
-     *  else `undefined`.
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the upper cased string.
      * @example
      *
-     * var users = {
-     *   'barney':  { 'age': 36, 'active': true },
-     *   'fred':    { 'age': 40, 'active': false },
-     *   'pebbles': { 'age': 1,  'active': true }
-     * };
+     * _.upperCase('--foo-bar');
+     * // => 'FOO BAR'
      *
-     * _.findKey(users, function(o) { return o.age < 40; });
-     * // => 'barney' (iteration order is not guaranteed)
+     * _.upperCase('fooBar');
+     * // => 'FOO BAR'
      *
-     * // The `_.matches` iteratee shorthand.
-     * _.findKey(users, { 'age': 1, 'active': true });
-     * // => 'pebbles'
+     * _.upperCase('__foo_bar__');
+     * // => 'FOO BAR'
+     */
+    var upperCase = createCompounder(function(result, word, index) {
+      return result + (index ? ' ' : '') + word.toUpperCase();
+    });
+
+    /**
+     * Converts the first character of `string` to upper case.
      *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.findKey(users, ['active', false]);
-     * // => 'fred'
+     * @static
+     * @memberOf _
+     * @since 4.0.0
+     * @category String
+     * @param {string} [string=''] The string to convert.
+     * @returns {string} Returns the converted string.
+     * @example
      *
-     * // The `_.property` iteratee shorthand.
-     * _.findKey(users, 'active');
-     * // => 'barney'
+     * _.upperFirst('fred');
+     * // => 'Fred'
+     *
+     * _.upperFirst('FRED');
+     * // => 'FRED'
      */
-    function findKey(object, predicate) {
-      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);
-    }
+    var upperFirst = createCaseFirst('toUpperCase');
 
     /**
-     * This method is like `_.findKey` except that it iterates over elements of
-     * a collection in the opposite order.
+     * Splits `string` into an array of its words.
      *
      * @static
      * @memberOf _
-     * @since 2.0.0
-     * @category Object
-     * @param {Object} object The object to inspect.
-     * @param {Function} [predicate=_.identity] The function invoked per iteration.
-     * @returns {string|undefined} Returns the key of the matched element,
-     *  else `undefined`.
+     * @since 3.0.0
+     * @category String
+     * @param {string} [string=''] The string to inspect.
+     * @param {RegExp|string} [pattern] The pattern to match words.
+     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
+     * @returns {Array} Returns the words of `string`.
      * @example
      *
-     * var users = {
-     *   'barney':  { 'age': 36, 'active': true },
-     *   'fred':    { 'age': 40, 'active': false },
-     *   'pebbles': { 'age': 1,  'active': true }
-     * };
+     * _.words('fred, barney, & pebbles');
+     * // => ['fred', 'barney', 'pebbles']
      *
-     * _.findLastKey(users, function(o) { return o.age < 40; });
-     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'
+     * _.words('fred, barney, & pebbles', /[^, ]+/g);
+     * // => ['fred', 'barney', '&', 'pebbles']
+     */
+    function words(string, pattern, guard) {
+      string = toString(string);
+      pattern = guard ? undefined$1 : pattern;
+
+      if (pattern === undefined$1) {
+        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);
+      }
+      return string.match(pattern) || [];
+    }
+
+    /*------------------------------------------------------------------------*/
+
+    /**
+     * Attempts to invoke `func`, returning either the result or the caught error
+     * object. Any additional arguments are provided to `func` when it's invoked.
      *
-     * // The `_.matches` iteratee shorthand.
-     * _.findLastKey(users, { 'age': 36, 'active': true });
-     * // => 'barney'
+     * @static
+     * @memberOf _
+     * @since 3.0.0
+     * @category Util
+     * @param {Function} func The function to attempt.
+     * @param {...*} [args] The arguments to invoke `func` with.
+     * @returns {*} Returns the `func` result or error object.
+     * @example
      *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.findLastKey(users, ['active', false]);
-     * // => 'fred'
+     * // Avoid throwing errors for invalid selectors.
+     * var elements = _.attempt(function(selector) {
+     *   return document.querySelectorAll(selector);
+     * }, '>_>');
      *
-     * // The `_.property` iteratee shorthand.
-     * _.findLastKey(users, 'active');
-     * // => 'pebbles'
+     * if (_.isError(elements)) {
+     *   elements = [];
+     * }
      */
-    function findLastKey(object, predicate) {
-      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);
-    }
+    var attempt = baseRest(function(func, args) {
+      try {
+        return apply(func, undefined$1, args);
+      } catch (e) {
+        return isError(e) ? e : new Error(e);
+      }
+    });
 
     /**
-     * Iterates over own and inherited enumerable string keyed properties of an
-     * object and invokes `iteratee` for each property. The iteratee is invoked
-     * with three arguments: (value, key, object). Iteratee functions may exit
-     * iteration early by explicitly returning `false`.
+     * Binds methods of an object to the object itself, overwriting the existing
+     * method.
+     *
+     * **Note:** This method doesn't set the "length" property of bound functions.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 0.3.0
-     * @category Object
-     * @param {Object} object The object to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @category Util
+     * @param {Object} object The object to bind and assign the bound methods to.
+     * @param {...(string|string[])} methodNames The object method names to bind.
      * @returns {Object} Returns `object`.
-     * @see _.forInRight
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
-     * }
-     *
-     * Foo.prototype.c = 3;
+     * var view = {
+     *   'label': 'docs',
+     *   'click': function() {
+     *     console.log('clicked ' + this.label);
+     *   }
+     * };
      *
-     * _.forIn(new Foo, function(value, key) {
-     *   console.log(key);
-     * });
-     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).
+     * _.bindAll(view, ['click']);
+     * jQuery(element).on('click', view.click);
+     * // => Logs 'clicked docs' when clicked.
      */
-    function forIn(object, iteratee) {
-      return object == null
-        ? object
-        : baseFor(object, getIteratee(iteratee, 3), keysIn);
-    }
+    var bindAll = flatRest(function(object, methodNames) {
+      arrayEach(methodNames, function(key) {
+        key = toKey(key);
+        baseAssignValue(object, key, bind(object[key], object));
+      });
+      return object;
+    });
 
     /**
-     * This method is like `_.forIn` except that it iterates over properties of
-     * `object` in the opposite order.
+     * Creates a function that iterates over `pairs` and invokes the corresponding
+     * function of the first predicate to return truthy. The predicate-function
+     * pairs are invoked with the `this` binding and arguments of the created
+     * function.
      *
      * @static
      * @memberOf _
-     * @since 2.0.0
-     * @category Object
-     * @param {Object} object The object to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Object} Returns `object`.
-     * @see _.forIn
+     * @since 4.0.0
+     * @category Util
+     * @param {Array} pairs The predicate-function pairs.
+     * @returns {Function} Returns the new composite function.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
-     * }
+     * var func = _.cond([
+     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],
+     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],
+     *   [_.stubTrue,                      _.constant('no match')]
+     * ]);
      *
-     * Foo.prototype.c = 3;
+     * func({ 'a': 1, 'b': 2 });
+     * // => 'matches A'
      *
-     * _.forInRight(new Foo, function(value, key) {
-     *   console.log(key);
-     * });
-     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.
+     * func({ 'a': 0, 'b': 1 });
+     * // => 'matches B'
+     *
+     * func({ 'a': '1', 'b': '2' });
+     * // => 'no match'
      */
-    function forInRight(object, iteratee) {
-      return object == null
-        ? object
-        : baseForRight(object, getIteratee(iteratee, 3), keysIn);
+    function cond(pairs) {
+      var length = pairs == null ? 0 : pairs.length,
+          toIteratee = getIteratee();
+
+      pairs = !length ? [] : arrayMap(pairs, function(pair) {
+        if (typeof pair[1] != 'function') {
+          throw new TypeError(FUNC_ERROR_TEXT);
+        }
+        return [toIteratee(pair[0]), pair[1]];
+      });
+
+      return baseRest(function(args) {
+        var index = -1;
+        while (++index < length) {
+          var pair = pairs[index];
+          if (apply(pair[0], this, args)) {
+            return apply(pair[1], this, args);
+          }
+        }
+      });
     }
 
     /**
-     * Iterates over own enumerable string keyed properties of an object and
-     * invokes `iteratee` for each property. The iteratee is invoked with three
-     * arguments: (value, key, object). Iteratee functions may exit iteration
-     * early by explicitly returning `false`.
+     * Creates a function that invokes the predicate properties of `source` with
+     * the corresponding property values of a given object, returning `true` if
+     * all predicates return truthy, else `false`.
+     *
+     * **Note:** The created function is equivalent to `_.conformsTo` with
+     * `source` partially applied.
      *
      * @static
      * @memberOf _
-     * @since 0.3.0
-     * @category Object
-     * @param {Object} object The object to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Object} Returns `object`.
-     * @see _.forOwnRight
+     * @since 4.0.0
+     * @category Util
+     * @param {Object} source The object of property predicates to conform to.
+     * @returns {Function} Returns the new spec function.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
-     * }
-     *
-     * Foo.prototype.c = 3;
+     * var objects = [
+     *   { 'a': 2, 'b': 1 },
+     *   { 'a': 1, 'b': 2 }
+     * ];
      *
-     * _.forOwn(new Foo, function(value, key) {
-     *   console.log(key);
-     * });
-     * // => Logs 'a' then 'b' (iteration order is not guaranteed).
+     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));
+     * // => [{ 'a': 1, 'b': 2 }]
      */
-    function forOwn(object, iteratee) {
-      return object && baseForOwn(object, getIteratee(iteratee, 3));
+    function conforms(source) {
+      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));
     }
 
     /**
-     * This method is like `_.forOwn` except that it iterates over properties of
-     * `object` in the opposite order.
+     * Creates a function that returns `value`.
      *
      * @static
      * @memberOf _
-     * @since 2.0.0
-     * @category Object
-     * @param {Object} object The object to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Object} Returns `object`.
-     * @see _.forOwn
+     * @since 2.4.0
+     * @category Util
+     * @param {*} value The value to return from the new function.
+     * @returns {Function} Returns the new constant function.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
-     * }
+     * var objects = _.times(2, _.constant({ 'a': 1 }));
      *
-     * Foo.prototype.c = 3;
+     * console.log(objects);
+     * // => [{ 'a': 1 }, { 'a': 1 }]
      *
-     * _.forOwnRight(new Foo, function(value, key) {
-     *   console.log(key);
-     * });
-     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.
+     * console.log(objects[0] === objects[1]);
+     * // => true
      */
-    function forOwnRight(object, iteratee) {
-      return object && baseForOwnRight(object, getIteratee(iteratee, 3));
+    function constant(value) {
+      return function() {
+        return value;
+      };
     }
 
     /**
-     * Creates an array of function property names from own enumerable properties
-     * of `object`.
+     * Checks `value` to determine whether a default value should be returned in
+     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,
+     * or `undefined`.
      *
      * @static
-     * @since 0.1.0
      * @memberOf _
-     * @category Object
-     * @param {Object} object The object to inspect.
-     * @returns {Array} Returns the function names.
-     * @see _.functionsIn
+     * @since 4.14.0
+     * @category Util
+     * @param {*} value The value to check.
+     * @param {*} defaultValue The default value.
+     * @returns {*} Returns the resolved value.
      * @example
      *
-     * function Foo() {
-     *   this.a = _.constant('a');
-     *   this.b = _.constant('b');
-     * }
-     *
-     * Foo.prototype.c = _.constant('c');
+     * _.defaultTo(1, 10);
+     * // => 1
      *
-     * _.functions(new Foo);
-     * // => ['a', 'b']
+     * _.defaultTo(undefined, 10);
+     * // => 10
      */
-    function functions(object) {
-      return object == null ? [] : baseFunctions(object, keys(object));
+    function defaultTo(value, defaultValue) {
+      return (value == null || value !== value) ? defaultValue : value;
     }
 
     /**
-     * Creates an array of function property names from own and inherited
-     * enumerable properties of `object`.
+     * Creates a function that returns the result of invoking the given functions
+     * with the `this` binding of the created function, where each successive
+     * invocation is supplied the return value of the previous.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Object
-     * @param {Object} object The object to inspect.
-     * @returns {Array} Returns the function names.
-     * @see _.functions
+     * @since 3.0.0
+     * @category Util
+     * @param {...(Function|Function[])} [funcs] The functions to invoke.
+     * @returns {Function} Returns the new composite function.
+     * @see _.flowRight
      * @example
      *
-     * function Foo() {
-     *   this.a = _.constant('a');
-     *   this.b = _.constant('b');
+     * function square(n) {
+     *   return n * n;
      * }
      *
-     * Foo.prototype.c = _.constant('c');
-     *
-     * _.functionsIn(new Foo);
-     * // => ['a', 'b', 'c']
+     * var addSquare = _.flow([_.add, square]);
+     * addSquare(1, 2);
+     * // => 9
      */
-    function functionsIn(object) {
-      return object == null ? [] : baseFunctions(object, keysIn(object));
-    }
+    var flow = createFlow();
 
     /**
-     * Gets the value at `path` of `object`. If the resolved value is
-     * `undefined`, the `defaultValue` is returned in its place.
+     * This method is like `_.flow` except that it creates a function that
+     * invokes the given functions from right to left.
      *
      * @static
+     * @since 3.0.0
      * @memberOf _
-     * @since 3.7.0
-     * @category Object
-     * @param {Object} object The object to query.
-     * @param {Array|string} path The path of the property to get.
-     * @param {*} [defaultValue] The value returned for `undefined` resolved values.
-     * @returns {*} Returns the resolved value.
+     * @category Util
+     * @param {...(Function|Function[])} [funcs] The functions to invoke.
+     * @returns {Function} Returns the new composite function.
+     * @see _.flow
      * @example
      *
-     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
-     *
-     * _.get(object, 'a[0].b.c');
-     * // => 3
-     *
-     * _.get(object, ['a', '0', 'b', 'c']);
-     * // => 3
+     * function square(n) {
+     *   return n * n;
+     * }
      *
-     * _.get(object, 'a.b.c', 'default');
-     * // => 'default'
+     * var addSquare = _.flowRight([square, _.add]);
+     * addSquare(1, 2);
+     * // => 9
      */
-    function get(object, path, defaultValue) {
-      var result = object == null ? undefined$1 : baseGet(object, path);
-      return result === undefined$1 ? defaultValue : result;
-    }
+    var flowRight = createFlow(true);
 
     /**
-     * Checks if `path` is a direct property of `object`.
+     * This method returns the first argument it receives.
      *
      * @static
      * @since 0.1.0
      * @memberOf _
-     * @category Object
-     * @param {Object} object The object to query.
-     * @param {Array|string} path The path to check.
-     * @returns {boolean} Returns `true` if `path` exists, else `false`.
+     * @category Util
+     * @param {*} value Any value.
+     * @returns {*} Returns `value`.
      * @example
      *
-     * var object = { 'a': { 'b': 2 } };
-     * var other = _.create({ 'a': _.create({ 'b': 2 }) });
-     *
-     * _.has(object, 'a');
-     * // => true
-     *
-     * _.has(object, 'a.b');
-     * // => true
+     * var object = { 'a': 1 };
      *
-     * _.has(object, ['a', 'b']);
+     * console.log(_.identity(object) === object);
      * // => true
-     *
-     * _.has(other, 'a');
-     * // => false
      */
-    function has(object, path) {
-      return object != null && hasPath(object, path, baseHas);
+    function identity(value) {
+      return value;
     }
 
     /**
-     * Checks if `path` is a direct or inherited property of `object`.
+     * Creates a function that invokes `func` with the arguments of the created
+     * function. If `func` is a property name, the created function returns the
+     * property value for a given element. If `func` is an array or object, the
+     * created function returns `true` for elements that contain the equivalent
+     * source properties, otherwise it returns `false`.
      *
      * @static
-     * @memberOf _
      * @since 4.0.0
-     * @category Object
-     * @param {Object} object The object to query.
-     * @param {Array|string} path The path to check.
-     * @returns {boolean} Returns `true` if `path` exists, else `false`.
+     * @memberOf _
+     * @category Util
+     * @param {*} [func=_.identity] The value to convert to a callback.
+     * @returns {Function} Returns the callback.
      * @example
      *
-     * var object = _.create({ 'a': _.create({ 'b': 2 }) });
+     * var users = [
+     *   { 'user': 'barney', 'age': 36, 'active': true },
+     *   { 'user': 'fred',   'age': 40, 'active': false }
+     * ];
      *
-     * _.hasIn(object, 'a');
-     * // => true
+     * // The `_.matches` iteratee shorthand.
+     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));
+     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]
      *
-     * _.hasIn(object, 'a.b');
-     * // => true
+     * // The `_.matchesProperty` iteratee shorthand.
+     * _.filter(users, _.iteratee(['user', 'fred']));
+     * // => [{ 'user': 'fred', 'age': 40 }]
      *
-     * _.hasIn(object, ['a', 'b']);
-     * // => true
+     * // The `_.property` iteratee shorthand.
+     * _.map(users, _.iteratee('user'));
+     * // => ['barney', 'fred']
      *
-     * _.hasIn(object, 'b');
-     * // => false
+     * // Create custom iteratee shorthands.
+     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {
+     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {
+     *     return func.test(string);
+     *   };
+     * });
+     *
+     * _.filter(['abc', 'def'], /ef/);
+     * // => ['def']
      */
-    function hasIn(object, path) {
-      return object != null && hasPath(object, path, baseHasIn);
+    function iteratee(func) {
+      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));
     }
 
     /**
-     * Creates an object composed of the inverted keys and values of `object`.
-     * If `object` contains duplicate values, subsequent values overwrite
-     * property assignments of previous values.
+     * Creates a function that performs a partial deep comparison between a given
+     * object and `source`, returning `true` if the given object has equivalent
+     * property values, else `false`.
+     *
+     * **Note:** The created function is equivalent to `_.isMatch` with `source`
+     * partially applied.
+     *
+     * Partial comparisons will match empty array and empty object `source`
+     * values against any array or object value, respectively. See `_.isEqual`
+     * for a list of supported value comparisons.
+     *
+     * **Note:** Multiple values can be checked by combining several matchers
+     * using `_.overSome`
      *
      * @static
      * @memberOf _
-     * @since 0.7.0
-     * @category Object
-     * @param {Object} object The object to invert.
-     * @returns {Object} Returns the new inverted object.
+     * @since 3.0.0
+     * @category Util
+     * @param {Object} source The object of property values to match.
+     * @returns {Function} Returns the new spec function.
      * @example
      *
-     * var object = { 'a': 1, 'b': 2, 'c': 1 };
+     * var objects = [
+     *   { 'a': 1, 'b': 2, 'c': 3 },
+     *   { 'a': 4, 'b': 5, 'c': 6 }
+     * ];
      *
-     * _.invert(object);
-     * // => { '1': 'c', '2': 'b' }
+     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));
+     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]
+     *
+     * // Checking for several possible values
+     * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));
+     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]
      */
-    var invert = createInverter(function(result, value, key) {
-      if (value != null &&
-          typeof value.toString != 'function') {
-        value = nativeObjectToString.call(value);
-      }
-
-      result[value] = key;
-    }, constant(identity));
+    function matches(source) {
+      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));
+    }
 
     /**
-     * This method is like `_.invert` except that the inverted object is generated
-     * from the results of running each element of `object` thru `iteratee`. The
-     * corresponding inverted value of each inverted key is an array of keys
-     * responsible for generating the inverted value. The iteratee is invoked
-     * with one argument: (value).
+     * Creates a function that performs a partial deep comparison between the
+     * value at `path` of a given object to `srcValue`, returning `true` if the
+     * object value is equivalent, else `false`.
+     *
+     * **Note:** Partial comparisons will match empty array and empty object
+     * `srcValue` values against any array or object value, respectively. See
+     * `_.isEqual` for a list of supported value comparisons.
+     *
+     * **Note:** Multiple values can be checked by combining several matchers
+     * using `_.overSome`
      *
      * @static
      * @memberOf _
-     * @since 4.1.0
-     * @category Object
-     * @param {Object} object The object to invert.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {Object} Returns the new inverted object.
+     * @since 3.2.0
+     * @category Util
+     * @param {Array|string} path The path of the property to get.
+     * @param {*} srcValue The value to match.
+     * @returns {Function} Returns the new spec function.
      * @example
      *
-     * var object = { 'a': 1, 'b': 2, 'c': 1 };
+     * var objects = [
+     *   { 'a': 1, 'b': 2, 'c': 3 },
+     *   { 'a': 4, 'b': 5, 'c': 6 }
+     * ];
      *
-     * _.invertBy(object);
-     * // => { '1': ['a', 'c'], '2': ['b'] }
+     * _.find(objects, _.matchesProperty('a', 4));
+     * // => { 'a': 4, 'b': 5, 'c': 6 }
      *
-     * _.invertBy(object, function(value) {
-     *   return 'group' + value;
-     * });
-     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }
+     * // Checking for several possible values
+     * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));
+     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]
      */
-    var invertBy = createInverter(function(result, value, key) {
-      if (value != null &&
-          typeof value.toString != 'function') {
-        value = nativeObjectToString.call(value);
-      }
-
-      if (hasOwnProperty.call(result, value)) {
-        result[value].push(key);
-      } else {
-        result[value] = [key];
-      }
-    }, getIteratee);
+    function matchesProperty(path, srcValue) {
+      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));
+    }
 
     /**
-     * Invokes the method at `path` of `object`.
+     * Creates a function that invokes the method at `path` of a given object.
+     * Any additional arguments are provided to the invoked method.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Object
-     * @param {Object} object The object to query.
+     * @since 3.7.0
+     * @category Util
      * @param {Array|string} path The path of the method to invoke.
      * @param {...*} [args] The arguments to invoke the method with.
-     * @returns {*} Returns the result of the invoked method.
+     * @returns {Function} Returns the new invoker function.
      * @example
      *
-     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };
+     * var objects = [
+     *   { 'a': { 'b': _.constant(2) } },
+     *   { 'a': { 'b': _.constant(1) } }
+     * ];
      *
-     * _.invoke(object, 'a[0].b.c.slice', 1, 3);
-     * // => [2, 3]
+     * _.map(objects, _.method('a.b'));
+     * // => [2, 1]
+     *
+     * _.map(objects, _.method(['a', 'b']));
+     * // => [2, 1]
      */
-    var invoke = baseRest(baseInvoke);
+    var method = baseRest(function(path, args) {
+      return function(object) {
+        return baseInvoke(object, path, args);
+      };
+    });
 
     /**
-     * Creates an array of the own enumerable property names of `object`.
-     *
-     * **Note:** Non-object values are coerced to objects. See the
-     * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)
-     * for more details.
+     * The opposite of `_.method`; this method creates a function that invokes
+     * the method at a given path of `object`. Any additional arguments are
+     * provided to the invoked method.
      *
      * @static
-     * @since 0.1.0
      * @memberOf _
-     * @category Object
+     * @since 3.7.0
+     * @category Util
      * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property names.
+     * @param {...*} [args] The arguments to invoke the method with.
+     * @returns {Function} Returns the new invoker function.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
-     * }
-     *
-     * Foo.prototype.c = 3;
+     * var array = _.times(3, _.constant),
+     *     object = { 'a': array, 'b': array, 'c': array };
      *
-     * _.keys(new Foo);
-     * // => ['a', 'b'] (iteration order is not guaranteed)
+     * _.map(['a[2]', 'c[0]'], _.methodOf(object));
+     * // => [2, 0]
      *
-     * _.keys('hi');
-     * // => ['0', '1']
+     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));
+     * // => [2, 0]
      */
-    function keys(object) {
-      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);
-    }
+    var methodOf = baseRest(function(object, args) {
+      return function(path) {
+        return baseInvoke(object, path, args);
+      };
+    });
 
     /**
-     * Creates an array of the own and inherited enumerable property names of `object`.
+     * Adds all own enumerable string keyed function properties of a source
+     * object to the destination object. If `object` is a function, then methods
+     * are added to its prototype as well.
      *
-     * **Note:** Non-object values are coerced to objects.
+     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to
+     * avoid conflicts caused by modifying the original.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 3.0.0
-     * @category Object
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property names.
+     * @category Util
+     * @param {Function|Object} [object=lodash] The destination object.
+     * @param {Object} source The object of functions to add.
+     * @param {Object} [options={}] The options object.
+     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.
+     * @returns {Function|Object} Returns `object`.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
+     * function vowels(string) {
+     *   return _.filter(string, function(v) {
+     *     return /[aeiou]/i.test(v);
+     *   });
      * }
      *
-     * Foo.prototype.c = 3;
-     *
-     * _.keysIn(new Foo);
-     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)
-     */
-    function keysIn(object) {
-      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);
-    }
-
-    /**
-     * The opposite of `_.mapValues`; this method creates an object with the
-     * same values as `object` and keys generated by running each own enumerable
-     * string keyed property of `object` thru `iteratee`. The iteratee is invoked
-     * with three arguments: (value, key, object).
+     * _.mixin({ 'vowels': vowels });
+     * _.vowels('fred');
+     * // => ['e']
      *
-     * @static
-     * @memberOf _
-     * @since 3.8.0
-     * @category Object
-     * @param {Object} object The object to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Object} Returns the new mapped object.
-     * @see _.mapValues
-     * @example
+     * _('fred').vowels().value();
+     * // => ['e']
      *
-     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {
-     *   return key + value;
-     * });
-     * // => { 'a1': 1, 'b2': 2 }
+     * _.mixin({ 'vowels': vowels }, { 'chain': false });
+     * _('fred').vowels();
+     * // => ['e']
      */
-    function mapKeys(object, iteratee) {
-      var result = {};
-      iteratee = getIteratee(iteratee, 3);
+    function mixin(object, source, options) {
+      var props = keys(source),
+          methodNames = baseFunctions(source, props);
 
-      baseForOwn(object, function(value, key, object) {
-        baseAssignValue(result, iteratee(value, key, object), value);
+      if (options == null &&
+          !(isObject(source) && (methodNames.length || !props.length))) {
+        options = source;
+        source = object;
+        object = this;
+        methodNames = baseFunctions(source, keys(source));
+      }
+      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,
+          isFunc = isFunction(object);
+
+      arrayEach(methodNames, function(methodName) {
+        var func = source[methodName];
+        object[methodName] = func;
+        if (isFunc) {
+          object.prototype[methodName] = function() {
+            var chainAll = this.__chain__;
+            if (chain || chainAll) {
+              var result = object(this.__wrapped__),
+                  actions = result.__actions__ = copyArray(this.__actions__);
+
+              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });
+              result.__chain__ = chainAll;
+              return result;
+            }
+            return func.apply(object, arrayPush([this.value()], arguments));
+          };
+        }
       });
-      return result;
+
+      return object;
     }
 
     /**
-     * Creates an object with the same keys as `object` and values generated
-     * by running each own enumerable string keyed property of `object` thru
-     * `iteratee`. The iteratee is invoked with three arguments:
-     * (value, key, object).
+     * Reverts the `_` variable to its previous value and returns a reference to
+     * the `lodash` function.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 2.4.0
-     * @category Object
-     * @param {Object} object The object to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Object} Returns the new mapped object.
-     * @see _.mapKeys
+     * @category Util
+     * @returns {Function} Returns the `lodash` function.
      * @example
      *
-     * var users = {
-     *   'fred':    { 'user': 'fred',    'age': 40 },
-     *   'pebbles': { 'user': 'pebbles', 'age': 1 }
-     * };
-     *
-     * _.mapValues(users, function(o) { return o.age; });
-     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
-     *
-     * // The `_.property` iteratee shorthand.
-     * _.mapValues(users, 'age');
-     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)
+     * var lodash = _.noConflict();
      */
-    function mapValues(object, iteratee) {
-      var result = {};
-      iteratee = getIteratee(iteratee, 3);
-
-      baseForOwn(object, function(value, key, object) {
-        baseAssignValue(result, key, iteratee(value, key, object));
-      });
-      return result;
+    function noConflict() {
+      if (root._ === this) {
+        root._ = oldDash;
+      }
+      return this;
     }
 
     /**
-     * This method is like `_.assign` except that it recursively merges own and
-     * inherited enumerable string keyed properties of source objects into the
-     * destination object. Source properties that resolve to `undefined` are
-     * skipped if a destination value exists. Array and plain object properties
-     * are merged recursively. Other objects and value types are overridden by
-     * assignment. Source objects are applied from left to right. Subsequent
-     * sources overwrite property assignments of previous sources.
-     *
-     * **Note:** This method mutates `object`.
+     * This method returns `undefined`.
      *
      * @static
      * @memberOf _
-     * @since 0.5.0
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} [sources] The source objects.
-     * @returns {Object} Returns `object`.
+     * @since 2.3.0
+     * @category Util
      * @example
      *
-     * var object = {
-     *   'a': [{ 'b': 2 }, { 'd': 4 }]
-     * };
-     *
-     * var other = {
-     *   'a': [{ 'c': 3 }, { 'e': 5 }]
-     * };
-     *
-     * _.merge(object, other);
-     * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }
+     * _.times(2, _.noop);
+     * // => [undefined, undefined]
      */
-    var merge = createAssigner(function(object, source, srcIndex) {
-      baseMerge(object, source, srcIndex);
-    });
+    function noop() {
+      // No operation performed.
+    }
 
     /**
-     * This method is like `_.merge` except that it accepts `customizer` which
-     * is invoked to produce the merged values of the destination and source
-     * properties. If `customizer` returns `undefined`, merging is handled by the
-     * method instead. The `customizer` is invoked with six arguments:
-     * (objValue, srcValue, key, object, source, stack).
-     *
-     * **Note:** This method mutates `object`.
+     * Creates a function that gets the argument at index `n`. If `n` is negative,
+     * the nth argument from the end is returned.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Object
-     * @param {Object} object The destination object.
-     * @param {...Object} sources The source objects.
-     * @param {Function} customizer The function to customize assigned values.
-     * @returns {Object} Returns `object`.
-     * @example
-     *
-     * function customizer(objValue, srcValue) {
-     *   if (_.isArray(objValue)) {
-     *     return objValue.concat(srcValue);
-     *   }
-     * }
+     * @category Util
+     * @param {number} [n=0] The index of the argument to return.
+     * @returns {Function} Returns the new pass-thru function.
+     * @example
      *
-     * var object = { 'a': [1], 'b': [2] };
-     * var other = { 'a': [3], 'b': [4] };
+     * var func = _.nthArg(1);
+     * func('a', 'b', 'c', 'd');
+     * // => 'b'
      *
-     * _.mergeWith(object, other, customizer);
-     * // => { 'a': [1, 3], 'b': [2, 4] }
+     * var func = _.nthArg(-2);
+     * func('a', 'b', 'c', 'd');
+     * // => 'c'
      */
-    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {
-      baseMerge(object, source, srcIndex, customizer);
-    });
+    function nthArg(n) {
+      n = toInteger(n);
+      return baseRest(function(args) {
+        return baseNth(args, n);
+      });
+    }
 
     /**
-     * The opposite of `_.pick`; this method creates an object composed of the
-     * own and inherited enumerable property paths of `object` that are not omitted.
-     *
-     * **Note:** This method is considerably slower than `_.pick`.
+     * Creates a function that invokes `iteratees` with the arguments it receives
+     * and returns their results.
      *
      * @static
-     * @since 0.1.0
      * @memberOf _
-     * @category Object
-     * @param {Object} object The source object.
-     * @param {...(string|string[])} [paths] The property paths to omit.
-     * @returns {Object} Returns the new object.
+     * @since 4.0.0
+     * @category Util
+     * @param {...(Function|Function[])} [iteratees=[_.identity]]
+     *  The iteratees to invoke.
+     * @returns {Function} Returns the new function.
      * @example
      *
-     * var object = { 'a': 1, 'b': '2', 'c': 3 };
+     * var func = _.over([Math.max, Math.min]);
      *
-     * _.omit(object, ['a', 'c']);
-     * // => { 'b': '2' }
+     * func(1, 2, 3, 4);
+     * // => [4, 1]
      */
-    var omit = flatRest(function(object, paths) {
-      var result = {};
-      if (object == null) {
-        return result;
-      }
-      var isDeep = false;
-      paths = arrayMap(paths, function(path) {
-        path = castPath(path, object);
-        isDeep || (isDeep = path.length > 1);
-        return path;
-      });
-      copyObject(object, getAllKeysIn(object), result);
-      if (isDeep) {
-        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);
-      }
-      var length = paths.length;
-      while (length--) {
-        baseUnset(result, paths[length]);
-      }
-      return result;
-    });
+    var over = createOver(arrayMap);
 
     /**
-     * The opposite of `_.pickBy`; this method creates an object composed of
-     * the own and inherited enumerable string keyed properties of `object` that
-     * `predicate` doesn't return truthy for. The predicate is invoked with two
-     * arguments: (value, key).
+     * Creates a function that checks if **all** of the `predicates` return
+     * truthy when invoked with the arguments it receives.
+     *
+     * Following shorthands are possible for providing predicates.
+     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.
+     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Object
-     * @param {Object} object The source object.
-     * @param {Function} [predicate=_.identity] The function invoked per property.
-     * @returns {Object} Returns the new object.
+     * @category Util
+     * @param {...(Function|Function[])} [predicates=[_.identity]]
+     *  The predicates to check.
+     * @returns {Function} Returns the new function.
      * @example
      *
-     * var object = { 'a': 1, 'b': '2', 'c': 3 };
+     * var func = _.overEvery([Boolean, isFinite]);
      *
-     * _.omitBy(object, _.isNumber);
-     * // => { 'b': '2' }
+     * func('1');
+     * // => true
+     *
+     * func(null);
+     * // => false
+     *
+     * func(NaN);
+     * // => false
      */
-    function omitBy(object, predicate) {
-      return pickBy(object, negate(getIteratee(predicate)));
-    }
+    var overEvery = createOver(arrayEvery);
 
     /**
-     * Creates an object composed of the picked `object` properties.
+     * Creates a function that checks if **any** of the `predicates` return
+     * truthy when invoked with the arguments it receives.
+     *
+     * Following shorthands are possible for providing predicates.
+     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.
+     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.
      *
      * @static
-     * @since 0.1.0
      * @memberOf _
-     * @category Object
-     * @param {Object} object The source object.
-     * @param {...(string|string[])} [paths] The property paths to pick.
-     * @returns {Object} Returns the new object.
+     * @since 4.0.0
+     * @category Util
+     * @param {...(Function|Function[])} [predicates=[_.identity]]
+     *  The predicates to check.
+     * @returns {Function} Returns the new function.
      * @example
      *
-     * var object = { 'a': 1, 'b': '2', 'c': 3 };
+     * var func = _.overSome([Boolean, isFinite]);
      *
-     * _.pick(object, ['a', 'c']);
-     * // => { 'a': 1, 'c': 3 }
+     * func('1');
+     * // => true
+     *
+     * func(null);
+     * // => true
+     *
+     * func(NaN);
+     * // => false
+     *
+     * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])
+     * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])
      */
-    var pick = flatRest(function(object, paths) {
-      return object == null ? {} : basePick(object, paths);
-    });
+    var overSome = createOver(arraySome);
 
     /**
-     * Creates an object composed of the `object` properties `predicate` returns
-     * truthy for. The predicate is invoked with two arguments: (value, key).
+     * Creates a function that returns the value at `path` of a given object.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Object
-     * @param {Object} object The source object.
-     * @param {Function} [predicate=_.identity] The function invoked per property.
-     * @returns {Object} Returns the new object.
+     * @since 2.4.0
+     * @category Util
+     * @param {Array|string} path The path of the property to get.
+     * @returns {Function} Returns the new accessor function.
      * @example
      *
-     * var object = { 'a': 1, 'b': '2', 'c': 3 };
+     * var objects = [
+     *   { 'a': { 'b': 2 } },
+     *   { 'a': { 'b': 1 } }
+     * ];
      *
-     * _.pickBy(object, _.isNumber);
-     * // => { 'a': 1, 'c': 3 }
+     * _.map(objects, _.property('a.b'));
+     * // => [2, 1]
+     *
+     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');
+     * // => [1, 2]
      */
-    function pickBy(object, predicate) {
-      if (object == null) {
-        return {};
-      }
-      var props = arrayMap(getAllKeysIn(object), function(prop) {
-        return [prop];
-      });
-      predicate = getIteratee(predicate);
-      return basePickBy(object, props, function(value, path) {
-        return predicate(value, path[0]);
-      });
+    function property(path) {
+      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);
     }
 
     /**
-     * This method is like `_.get` except that if the resolved value is a
-     * function it's invoked with the `this` binding of its parent object and
-     * its result is returned.
+     * The opposite of `_.property`; this method creates a function that returns
+     * the value at a given path of `object`.
      *
      * @static
-     * @since 0.1.0
      * @memberOf _
-     * @category Object
+     * @since 3.0.0
+     * @category Util
      * @param {Object} object The object to query.
-     * @param {Array|string} path The path of the property to resolve.
-     * @param {*} [defaultValue] The value returned for `undefined` resolved values.
-     * @returns {*} Returns the resolved value.
+     * @returns {Function} Returns the new accessor function.
      * @example
      *
-     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };
-     *
-     * _.result(object, 'a[0].b.c1');
-     * // => 3
-     *
-     * _.result(object, 'a[0].b.c2');
-     * // => 4
+     * var array = [0, 1, 2],
+     *     object = { 'a': array, 'b': array, 'c': array };
      *
-     * _.result(object, 'a[0].b.c3', 'default');
-     * // => 'default'
+     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));
+     * // => [2, 0]
      *
-     * _.result(object, 'a[0].b.c3', _.constant('default'));
-     * // => 'default'
+     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));
+     * // => [2, 0]
      */
-    function result(object, path, defaultValue) {
-      path = castPath(path, object);
-
-      var index = -1,
-          length = path.length;
-
-      // Ensure the loop is entered when path is empty.
-      if (!length) {
-        length = 1;
-        object = undefined$1;
-      }
-      while (++index < length) {
-        var value = object == null ? undefined$1 : object[toKey(path[index])];
-        if (value === undefined$1) {
-          index = length;
-          value = defaultValue;
-        }
-        object = isFunction(value) ? value.call(object) : value;
-      }
-      return object;
+    function propertyOf(object) {
+      return function(path) {
+        return object == null ? undefined$1 : baseGet(object, path);
+      };
     }
 
     /**
-     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,
-     * it's created. Arrays are created for missing index properties while objects
-     * are created for all other missing properties. Use `_.setWith` to customize
-     * `path` creation.
+     * Creates an array of numbers (positive and/or negative) progressing from
+     * `start` up to, but not including, `end`. A step of `-1` is used if a negative
+     * `start` is specified without an `end` or `step`. If `end` is not specified,
+     * it's set to `start` with `start` then set to `0`.
      *
-     * **Note:** This method mutates `object`.
+     * **Note:** JavaScript follows the IEEE-754 standard for resolving
+     * floating-point values which can produce unexpected results.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 3.7.0
-     * @category Object
-     * @param {Object} object The object to modify.
-     * @param {Array|string} path The path of the property to set.
-     * @param {*} value The value to set.
-     * @returns {Object} Returns `object`.
+     * @category Util
+     * @param {number} [start=0] The start of the range.
+     * @param {number} end The end of the range.
+     * @param {number} [step=1] The value to increment or decrement by.
+     * @returns {Array} Returns the range of numbers.
+     * @see _.inRange, _.rangeRight
      * @example
      *
-     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
+     * _.range(4);
+     * // => [0, 1, 2, 3]
+     *
+     * _.range(-4);
+     * // => [0, -1, -2, -3]
+     *
+     * _.range(1, 5);
+     * // => [1, 2, 3, 4]
+     *
+     * _.range(0, 20, 5);
+     * // => [0, 5, 10, 15]
      *
-     * _.set(object, 'a[0].b.c', 4);
-     * console.log(object.a[0].b.c);
-     * // => 4
+     * _.range(0, -4, -1);
+     * // => [0, -1, -2, -3]
      *
-     * _.set(object, ['x', '0', 'y', 'z'], 5);
-     * console.log(object.x[0].y.z);
-     * // => 5
+     * _.range(1, 4, 0);
+     * // => [1, 1, 1]
+     *
+     * _.range(0);
+     * // => []
      */
-    function set(object, path, value) {
-      return object == null ? object : baseSet(object, path, value);
-    }
+    var range = createRange();
 
     /**
-     * This method is like `_.set` except that it accepts `customizer` which is
-     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`
-     * path creation is handled by the method instead. The `customizer` is invoked
-     * with three arguments: (nsValue, key, nsObject).
-     *
-     * **Note:** This method mutates `object`.
+     * This method is like `_.range` except that it populates values in
+     * descending order.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category Object
-     * @param {Object} object The object to modify.
-     * @param {Array|string} path The path of the property to set.
-     * @param {*} value The value to set.
-     * @param {Function} [customizer] The function to customize assigned values.
-     * @returns {Object} Returns `object`.
+     * @category Util
+     * @param {number} [start=0] The start of the range.
+     * @param {number} end The end of the range.
+     * @param {number} [step=1] The value to increment or decrement by.
+     * @returns {Array} Returns the range of numbers.
+     * @see _.inRange, _.range
      * @example
      *
-     * var object = {};
+     * _.rangeRight(4);
+     * // => [3, 2, 1, 0]
      *
-     * _.setWith(object, '[0][1]', 'a', Object);
-     * // => { '0': { '1': 'a' } }
+     * _.rangeRight(-4);
+     * // => [-3, -2, -1, 0]
+     *
+     * _.rangeRight(1, 5);
+     * // => [4, 3, 2, 1]
+     *
+     * _.rangeRight(0, 20, 5);
+     * // => [15, 10, 5, 0]
+     *
+     * _.rangeRight(0, -4, -1);
+     * // => [-3, -2, -1, 0]
+     *
+     * _.rangeRight(1, 4, 0);
+     * // => [1, 1, 1]
+     *
+     * _.rangeRight(0);
+     * // => []
      */
-    function setWith(object, path, value, customizer) {
-      customizer = typeof customizer == 'function' ? customizer : undefined$1;
-      return object == null ? object : baseSet(object, path, value, customizer);
-    }
+    var rangeRight = createRange(true);
 
     /**
-     * Creates an array of own enumerable string keyed-value pairs for `object`
-     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its
-     * entries are returned.
+     * This method returns a new empty array.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @alias entries
-     * @category Object
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the key-value pairs.
+     * @since 4.13.0
+     * @category Util
+     * @returns {Array} Returns the new empty array.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
-     * }
+     * var arrays = _.times(2, _.stubArray);
      *
-     * Foo.prototype.c = 3;
+     * console.log(arrays);
+     * // => [[], []]
      *
-     * _.toPairs(new Foo);
-     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)
+     * console.log(arrays[0] === arrays[1]);
+     * // => false
      */
-    var toPairs = createToPairs(keys);
+    function stubArray() {
+      return [];
+    }
 
     /**
-     * Creates an array of own and inherited enumerable string keyed-value pairs
-     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map
-     * or set, its entries are returned.
+     * This method returns `false`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @alias entriesIn
-     * @category Object
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the key-value pairs.
+     * @since 4.13.0
+     * @category Util
+     * @returns {boolean} Returns `false`.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
-     * }
-     *
-     * Foo.prototype.c = 3;
-     *
-     * _.toPairsIn(new Foo);
-     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)
+     * _.times(2, _.stubFalse);
+     * // => [false, false]
      */
-    var toPairsIn = createToPairs(keysIn);
+    function stubFalse() {
+      return false;
+    }
 
     /**
-     * An alternative to `_.reduce`; this method transforms `object` to a new
-     * `accumulator` object which is the result of running each of its own
-     * enumerable string keyed properties thru `iteratee`, with each invocation
-     * potentially mutating the `accumulator` object. If `accumulator` is not
-     * provided, a new object with the same `[[Prototype]]` will be used. The
-     * iteratee is invoked with four arguments: (accumulator, value, key, object).
-     * Iteratee functions may exit iteration early by explicitly returning `false`.
+     * This method returns a new empty object.
      *
      * @static
      * @memberOf _
-     * @since 1.3.0
-     * @category Object
-     * @param {Object} object The object to iterate over.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @param {*} [accumulator] The custom accumulator value.
-     * @returns {*} Returns the accumulated value.
+     * @since 4.13.0
+     * @category Util
+     * @returns {Object} Returns the new empty object.
      * @example
      *
-     * _.transform([2, 3, 4], function(result, n) {
-     *   result.push(n *= n);
-     *   return n % 2 == 0;
-     * }, []);
-     * // => [4, 9]
+     * var objects = _.times(2, _.stubObject);
      *
-     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {
-     *   (result[value] || (result[value] = [])).push(key);
-     * }, {});
-     * // => { '1': ['a', 'c'], '2': ['b'] }
+     * console.log(objects);
+     * // => [{}, {}]
+     *
+     * console.log(objects[0] === objects[1]);
+     * // => false
      */
-    function transform(object, iteratee, accumulator) {
-      var isArr = isArray(object),
-          isArrLike = isArr || isBuffer(object) || isTypedArray(object);
-
-      iteratee = getIteratee(iteratee, 4);
-      if (accumulator == null) {
-        var Ctor = object && object.constructor;
-        if (isArrLike) {
-          accumulator = isArr ? new Ctor : [];
-        }
-        else if (isObject(object)) {
-          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};
-        }
-        else {
-          accumulator = {};
-        }
-      }
-      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {
-        return iteratee(accumulator, value, index, object);
-      });
-      return accumulator;
+    function stubObject() {
+      return {};
     }
 
     /**
-     * Removes the property at `path` of `object`.
-     *
-     * **Note:** This method mutates `object`.
+     * This method returns an empty string.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Object
-     * @param {Object} object The object to modify.
-     * @param {Array|string} path The path of the property to unset.
-     * @returns {boolean} Returns `true` if the property is deleted, else `false`.
+     * @since 4.13.0
+     * @category Util
+     * @returns {string} Returns the empty string.
      * @example
      *
-     * var object = { 'a': [{ 'b': { 'c': 7 } }] };
-     * _.unset(object, 'a[0].b.c');
-     * // => true
-     *
-     * console.log(object);
-     * // => { 'a': [{ 'b': {} }] };
-     *
-     * _.unset(object, ['a', '0', 'b', 'c']);
-     * // => true
-     *
-     * console.log(object);
-     * // => { 'a': [{ 'b': {} }] };
+     * _.times(2, _.stubString);
+     * // => ['', '']
      */
-    function unset(object, path) {
-      return object == null ? true : baseUnset(object, path);
+    function stubString() {
+      return '';
     }
 
     /**
-     * This method is like `_.set` except that accepts `updater` to produce the
-     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`
-     * is invoked with one argument: (value).
-     *
-     * **Note:** This method mutates `object`.
+     * This method returns `true`.
      *
      * @static
      * @memberOf _
-     * @since 4.6.0
-     * @category Object
-     * @param {Object} object The object to modify.
-     * @param {Array|string} path The path of the property to set.
-     * @param {Function} updater The function to produce the updated value.
-     * @returns {Object} Returns `object`.
+     * @since 4.13.0
+     * @category Util
+     * @returns {boolean} Returns `true`.
      * @example
      *
-     * var object = { 'a': [{ 'b': { 'c': 3 } }] };
-     *
-     * _.update(object, 'a[0].b.c', function(n) { return n * n; });
-     * console.log(object.a[0].b.c);
-     * // => 9
-     *
-     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });
-     * console.log(object.x[0].y.z);
-     * // => 0
+     * _.times(2, _.stubTrue);
+     * // => [true, true]
      */
-    function update(object, path, updater) {
-      return object == null ? object : baseUpdate(object, path, castFunction(updater));
+    function stubTrue() {
+      return true;
     }
 
     /**
-     * This method is like `_.update` except that it accepts `customizer` which is
-     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`
-     * path creation is handled by the method instead. The `customizer` is invoked
-     * with three arguments: (nsValue, key, nsObject).
-     *
-     * **Note:** This method mutates `object`.
+     * Invokes the iteratee `n` times, returning an array of the results of
+     * each invocation. The iteratee is invoked with one argument; (index).
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 4.6.0
-     * @category Object
-     * @param {Object} object The object to modify.
-     * @param {Array|string} path The path of the property to set.
-     * @param {Function} updater The function to produce the updated value.
-     * @param {Function} [customizer] The function to customize assigned values.
-     * @returns {Object} Returns `object`.
+     * @category Util
+     * @param {number} n The number of times to invoke `iteratee`.
+     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
+     * @returns {Array} Returns the array of results.
      * @example
      *
-     * var object = {};
+     * _.times(3, String);
+     * // => ['0', '1', '2']
      *
-     * _.updateWith(object, '[0][1]', _.constant('a'), Object);
-     * // => { '0': { '1': 'a' } }
+     *  _.times(4, _.constant(0));
+     * // => [0, 0, 0, 0]
      */
-    function updateWith(object, path, updater, customizer) {
-      customizer = typeof customizer == 'function' ? customizer : undefined$1;
-      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);
+    function times(n, iteratee) {
+      n = toInteger(n);
+      if (n < 1 || n > MAX_SAFE_INTEGER) {
+        return [];
+      }
+      var index = MAX_ARRAY_LENGTH,
+          length = nativeMin(n, MAX_ARRAY_LENGTH);
+
+      iteratee = getIteratee(iteratee);
+      n -= MAX_ARRAY_LENGTH;
+
+      var result = baseTimes(length, iteratee);
+      while (++index < n) {
+        iteratee(index);
+      }
+      return result;
     }
 
     /**
-     * Creates an array of the own enumerable string keyed property values of `object`.
-     *
-     * **Note:** Non-object values are coerced to objects.
+     * Converts `value` to a property path array.
      *
      * @static
-     * @since 0.1.0
      * @memberOf _
-     * @category Object
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property values.
+     * @since 4.0.0
+     * @category Util
+     * @param {*} value The value to convert.
+     * @returns {Array} Returns the new property path array.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
-     * }
-     *
-     * Foo.prototype.c = 3;
-     *
-     * _.values(new Foo);
-     * // => [1, 2] (iteration order is not guaranteed)
+     * _.toPath('a.b.c');
+     * // => ['a', 'b', 'c']
      *
-     * _.values('hi');
-     * // => ['h', 'i']
+     * _.toPath('a[0].b.c');
+     * // => ['a', '0', 'b', 'c']
      */
-    function values(object) {
-      return object == null ? [] : baseValues(object, keys(object));
+    function toPath(value) {
+      if (isArray(value)) {
+        return arrayMap(value, toKey);
+      }
+      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));
     }
 
     /**
-     * Creates an array of the own and inherited enumerable string keyed property
-     * values of `object`.
-     *
-     * **Note:** Non-object values are coerced to objects.
+     * Generates a unique ID. If `prefix` is given, the ID is appended to it.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 3.0.0
-     * @category Object
-     * @param {Object} object The object to query.
-     * @returns {Array} Returns the array of property values.
+     * @category Util
+     * @param {string} [prefix=''] The value to prefix the ID with.
+     * @returns {string} Returns the unique ID.
      * @example
      *
-     * function Foo() {
-     *   this.a = 1;
-     *   this.b = 2;
-     * }
-     *
-     * Foo.prototype.c = 3;
+     * _.uniqueId('contact_');
+     * // => 'contact_104'
      *
-     * _.valuesIn(new Foo);
-     * // => [1, 2, 3] (iteration order is not guaranteed)
+     * _.uniqueId();
+     * // => '105'
      */
-    function valuesIn(object) {
-      return object == null ? [] : baseValues(object, keysIn(object));
+    function uniqueId(prefix) {
+      var id = ++idCounter;
+      return toString(prefix) + id;
     }
 
     /*------------------------------------------------------------------------*/
 
     /**
-     * Clamps `number` within the inclusive `lower` and `upper` bounds.
+     * Adds two numbers.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category Number
-     * @param {number} number The number to clamp.
-     * @param {number} [lower] The lower bound.
-     * @param {number} upper The upper bound.
-     * @returns {number} Returns the clamped number.
+     * @since 3.4.0
+     * @category Math
+     * @param {number} augend The first number in an addition.
+     * @param {number} addend The second number in an addition.
+     * @returns {number} Returns the total.
      * @example
      *
-     * _.clamp(-10, -5, 5);
-     * // => -5
-     *
-     * _.clamp(10, -5, 5);
-     * // => 5
+     * _.add(6, 4);
+     * // => 10
      */
-    function clamp(number, lower, upper) {
-      if (upper === undefined$1) {
-        upper = lower;
-        lower = undefined$1;
-      }
-      if (upper !== undefined$1) {
-        upper = toNumber(upper);
-        upper = upper === upper ? upper : 0;
-      }
-      if (lower !== undefined$1) {
-        lower = toNumber(lower);
-        lower = lower === lower ? lower : 0;
-      }
-      return baseClamp(toNumber(number), lower, upper);
-    }
+    var add = createMathOperation(function(augend, addend) {
+      return augend + addend;
+    }, 0);
 
     /**
-     * Checks if `n` is between `start` and up to, but not including, `end`. If
-     * `end` is not specified, it's set to `start` with `start` then set to `0`.
-     * If `start` is greater than `end` the params are swapped to support
-     * negative ranges.
+     * Computes `number` rounded up to `precision`.
      *
      * @static
      * @memberOf _
-     * @since 3.3.0
-     * @category Number
-     * @param {number} number The number to check.
-     * @param {number} [start=0] The start of the range.
-     * @param {number} end The end of the range.
-     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.
-     * @see _.range, _.rangeRight
+     * @since 3.10.0
+     * @category Math
+     * @param {number} number The number to round up.
+     * @param {number} [precision=0] The precision to round up to.
+     * @returns {number} Returns the rounded up number.
      * @example
      *
-     * _.inRange(3, 2, 4);
-     * // => true
-     *
-     * _.inRange(4, 8);
-     * // => true
-     *
-     * _.inRange(4, 2);
-     * // => false
-     *
-     * _.inRange(2, 2);
-     * // => false
-     *
-     * _.inRange(1.2, 2);
-     * // => true
+     * _.ceil(4.006);
+     * // => 5
      *
-     * _.inRange(5.2, 4);
-     * // => false
+     * _.ceil(6.004, 2);
+     * // => 6.01
      *
-     * _.inRange(-3, -2, -6);
-     * // => true
+     * _.ceil(6040, -2);
+     * // => 6100
      */
-    function inRange(number, start, end) {
-      start = toFinite(start);
-      if (end === undefined$1) {
-        end = start;
-        start = 0;
-      } else {
-        end = toFinite(end);
-      }
-      number = toNumber(number);
-      return baseInRange(number, start, end);
-    }
+    var ceil = createRound('ceil');
 
     /**
-     * Produces a random number between the inclusive `lower` and `upper` bounds.
-     * If only one argument is provided a number between `0` and the given number
-     * is returned. If `floating` is `true`, or either `lower` or `upper` are
-     * floats, a floating-point number is returned instead of an integer.
-     *
-     * **Note:** JavaScript follows the IEEE-754 standard for resolving
-     * floating-point values which can produce unexpected results.
+     * Divide two numbers.
      *
      * @static
      * @memberOf _
-     * @since 0.7.0
-     * @category Number
-     * @param {number} [lower=0] The lower bound.
-     * @param {number} [upper=1] The upper bound.
-     * @param {boolean} [floating] Specify returning a floating-point number.
-     * @returns {number} Returns the random number.
+     * @since 4.7.0
+     * @category Math
+     * @param {number} dividend The first number in a division.
+     * @param {number} divisor The second number in a division.
+     * @returns {number} Returns the quotient.
      * @example
      *
-     * _.random(0, 5);
-     * // => an integer between 0 and 5
-     *
-     * _.random(5);
-     * // => also an integer between 0 and 5
-     *
-     * _.random(5, true);
-     * // => a floating-point number between 0 and 5
-     *
-     * _.random(1.2, 5.2);
-     * // => a floating-point number between 1.2 and 5.2
+     * _.divide(6, 4);
+     * // => 1.5
      */
-    function random(lower, upper, floating) {
-      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {
-        upper = floating = undefined$1;
-      }
-      if (floating === undefined$1) {
-        if (typeof upper == 'boolean') {
-          floating = upper;
-          upper = undefined$1;
-        }
-        else if (typeof lower == 'boolean') {
-          floating = lower;
-          lower = undefined$1;
-        }
-      }
-      if (lower === undefined$1 && upper === undefined$1) {
-        lower = 0;
-        upper = 1;
-      }
-      else {
-        lower = toFinite(lower);
-        if (upper === undefined$1) {
-          upper = lower;
-          lower = 0;
-        } else {
-          upper = toFinite(upper);
-        }
-      }
-      if (lower > upper) {
-        var temp = lower;
-        lower = upper;
-        upper = temp;
-      }
-      if (floating || lower % 1 || upper % 1) {
-        var rand = nativeRandom();
-        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);
-      }
-      return baseRandom(lower, upper);
-    }
-
-    /*------------------------------------------------------------------------*/
+    var divide = createMathOperation(function(dividend, divisor) {
+      return dividend / divisor;
+    }, 1);
 
     /**
-     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).
+     * Computes `number` rounded down to `precision`.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the camel cased string.
+     * @since 3.10.0
+     * @category Math
+     * @param {number} number The number to round down.
+     * @param {number} [precision=0] The precision to round down to.
+     * @returns {number} Returns the rounded down number.
      * @example
      *
-     * _.camelCase('Foo Bar');
-     * // => 'fooBar'
+     * _.floor(4.006);
+     * // => 4
      *
-     * _.camelCase('--foo-bar--');
-     * // => 'fooBar'
+     * _.floor(0.046, 2);
+     * // => 0.04
      *
-     * _.camelCase('__FOO_BAR__');
-     * // => 'fooBar'
+     * _.floor(4060, -2);
+     * // => 4000
      */
-    var camelCase = createCompounder(function(result, word, index) {
-      word = word.toLowerCase();
-      return result + (index ? capitalize(word) : word);
-    });
+    var floor = createRound('floor');
 
     /**
-     * Converts the first character of `string` to upper case and the remaining
-     * to lower case.
+     * Computes the maximum value of `array`. If `array` is empty or falsey,
+     * `undefined` is returned.
      *
      * @static
+     * @since 0.1.0
      * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to capitalize.
-     * @returns {string} Returns the capitalized string.
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @returns {*} Returns the maximum value.
      * @example
      *
-     * _.capitalize('FRED');
-     * // => 'Fred'
+     * _.max([4, 2, 8, 6]);
+     * // => 8
+     *
+     * _.max([]);
+     * // => undefined
      */
-    function capitalize(string) {
-      return upperFirst(toString(string).toLowerCase());
+    function max(array) {
+      return (array && array.length)
+        ? baseExtremum(array, identity, baseGt)
+        : undefined$1;
     }
 
     /**
-     * Deburrs `string` by converting
-     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)
-     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)
-     * letters to basic Latin letters and removing
-     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).
+     * This method is like `_.max` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the criterion by which
+     * the value is ranked. The iteratee is invoked with one argument: (value).
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to deburr.
-     * @returns {string} Returns the deburred string.
+     * @since 4.0.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {*} Returns the maximum value.
      * @example
      *
-     * _.deburr('déjà vu');
-     * // => 'deja vu'
+     * var objects = [{ 'n': 1 }, { 'n': 2 }];
+     *
+     * _.maxBy(objects, function(o) { return o.n; });
+     * // => { 'n': 2 }
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.maxBy(objects, 'n');
+     * // => { 'n': 2 }
      */
-    function deburr(string) {
-      string = toString(string);
-      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');
+    function maxBy(array, iteratee) {
+      return (array && array.length)
+        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)
+        : undefined$1;
     }
 
     /**
-     * Checks if `string` ends with the given target string.
+     * Computes the mean of the values in `array`.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to inspect.
-     * @param {string} [target] The string to search for.
-     * @param {number} [position=string.length] The position to search up to.
-     * @returns {boolean} Returns `true` if `string` ends with `target`,
-     *  else `false`.
+     * @since 4.0.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @returns {number} Returns the mean.
      * @example
      *
-     * _.endsWith('abc', 'c');
-     * // => true
-     *
-     * _.endsWith('abc', 'b');
-     * // => false
-     *
-     * _.endsWith('abc', 'b', 2);
-     * // => true
+     * _.mean([4, 2, 8, 6]);
+     * // => 5
      */
-    function endsWith(string, target, position) {
-      string = toString(string);
-      target = baseToString(target);
-
-      var length = string.length;
-      position = position === undefined$1
-        ? length
-        : baseClamp(toInteger(position), 0, length);
-
-      var end = position;
-      position -= target.length;
-      return position >= 0 && string.slice(position, end) == target;
+    function mean(array) {
+      return baseMean(array, identity);
     }
 
     /**
-     * Converts the characters "&", "<", ">", '"', and "'" in `string` to their
-     * corresponding HTML entities.
+     * This method is like `_.mean` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the value to be averaged.
+     * The iteratee is invoked with one argument: (value).
      *
-     * **Note:** No other characters are escaped. To escape additional
-     * characters use a third-party library like [_he_](https://mths.be/he).
+     * @static
+     * @memberOf _
+     * @since 4.7.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {number} Returns the mean.
+     * @example
      *
-     * Though the ">" character is escaped for symmetry, characters like
-     * ">" and "/" don't need escaping in HTML and have no special meaning
-     * unless they're part of a tag or unquoted attribute value. See
-     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)
-     * (under "semi-related fun fact") for more details.
+     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];
      *
-     * When working with HTML you should always
-     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce
-     * XSS vectors.
+     * _.meanBy(objects, function(o) { return o.n; });
+     * // => 5
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.meanBy(objects, 'n');
+     * // => 5
+     */
+    function meanBy(array, iteratee) {
+      return baseMean(array, getIteratee(iteratee, 2));
+    }
+
+    /**
+     * Computes the minimum value of `array`. If `array` is empty or falsey,
+     * `undefined` is returned.
      *
      * @static
      * @since 0.1.0
      * @memberOf _
-     * @category String
-     * @param {string} [string=''] The string to escape.
-     * @returns {string} Returns the escaped string.
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @returns {*} Returns the minimum value.
      * @example
      *
-     * _.escape('fred, barney, & pebbles');
-     * // => 'fred, barney, &amp; pebbles'
+     * _.min([4, 2, 8, 6]);
+     * // => 2
+     *
+     * _.min([]);
+     * // => undefined
      */
-    function escape(string) {
-      string = toString(string);
-      return (string && reHasUnescapedHtml.test(string))
-        ? string.replace(reUnescapedHtml, escapeHtmlChar)
-        : string;
+    function min(array) {
+      return (array && array.length)
+        ? baseExtremum(array, identity, baseLt)
+        : undefined$1;
     }
 
     /**
-     * Escapes the `RegExp` special characters "^", "$", "\", ".", "*", "+",
-     * "?", "(", ")", "[", "]", "{", "}", and "|" in `string`.
+     * This method is like `_.min` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the criterion by which
+     * the value is ranked. The iteratee is invoked with one argument: (value).
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to escape.
-     * @returns {string} Returns the escaped string.
+     * @since 4.0.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {*} Returns the minimum value.
      * @example
      *
-     * _.escapeRegExp('[lodash](https://lodash.com/)');
-     * // => '\[lodash\]\(https://lodash\.com/\)'
+     * var objects = [{ 'n': 1 }, { 'n': 2 }];
+     *
+     * _.minBy(objects, function(o) { return o.n; });
+     * // => { 'n': 1 }
+     *
+     * // The `_.property` iteratee shorthand.
+     * _.minBy(objects, 'n');
+     * // => { 'n': 1 }
      */
-    function escapeRegExp(string) {
-      string = toString(string);
-      return (string && reHasRegExpChar.test(string))
-        ? string.replace(reRegExpChar, '\\$&')
-        : string;
+    function minBy(array, iteratee) {
+      return (array && array.length)
+        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)
+        : undefined$1;
     }
 
     /**
-     * Converts `string` to
-     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).
+     * Multiply two numbers.
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the kebab cased string.
+     * @since 4.7.0
+     * @category Math
+     * @param {number} multiplier The first number in a multiplication.
+     * @param {number} multiplicand The second number in a multiplication.
+     * @returns {number} Returns the product.
      * @example
      *
-     * _.kebabCase('Foo Bar');
-     * // => 'foo-bar'
+     * _.multiply(6, 4);
+     * // => 24
+     */
+    var multiply = createMathOperation(function(multiplier, multiplicand) {
+      return multiplier * multiplicand;
+    }, 1);
+
+    /**
+     * Computes `number` rounded to `precision`.
      *
-     * _.kebabCase('fooBar');
-     * // => 'foo-bar'
+     * @static
+     * @memberOf _
+     * @since 3.10.0
+     * @category Math
+     * @param {number} number The number to round.
+     * @param {number} [precision=0] The precision to round to.
+     * @returns {number} Returns the rounded number.
+     * @example
+     *
+     * _.round(4.006);
+     * // => 4
      *
-     * _.kebabCase('__FOO_BAR__');
-     * // => 'foo-bar'
+     * _.round(4.006, 2);
+     * // => 4.01
+     *
+     * _.round(4060, -2);
+     * // => 4100
      */
-    var kebabCase = createCompounder(function(result, word, index) {
-      return result + (index ? '-' : '') + word.toLowerCase();
-    });
+    var round = createRound('round');
 
     /**
-     * Converts `string`, as space separated words, to lower case.
+     * Subtract two numbers.
      *
      * @static
      * @memberOf _
      * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the lower cased string.
+     * @category Math
+     * @param {number} minuend The first number in a subtraction.
+     * @param {number} subtrahend The second number in a subtraction.
+     * @returns {number} Returns the difference.
      * @example
      *
-     * _.lowerCase('--Foo-Bar--');
-     * // => 'foo bar'
-     *
-     * _.lowerCase('fooBar');
-     * // => 'foo bar'
-     *
-     * _.lowerCase('__FOO_BAR__');
-     * // => 'foo bar'
+     * _.subtract(6, 4);
+     * // => 2
      */
-    var lowerCase = createCompounder(function(result, word, index) {
-      return result + (index ? ' ' : '') + word.toLowerCase();
-    });
+    var subtract = createMathOperation(function(minuend, subtrahend) {
+      return minuend - subtrahend;
+    }, 0);
 
     /**
-     * Converts the first character of `string` to lower case.
+     * Computes the sum of the values in `array`.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the converted string.
+     * @since 3.4.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @returns {number} Returns the sum.
      * @example
      *
-     * _.lowerFirst('Fred');
-     * // => 'fred'
-     *
-     * _.lowerFirst('FRED');
-     * // => 'fRED'
+     * _.sum([4, 2, 8, 6]);
+     * // => 20
      */
-    var lowerFirst = createCaseFirst('toLowerCase');
+    function sum(array) {
+      return (array && array.length)
+        ? baseSum(array, identity)
+        : 0;
+    }
 
     /**
-     * Pads `string` on the left and right sides if it's shorter than `length`.
-     * Padding characters are truncated if they can't be evenly divided by `length`.
+     * This method is like `_.sum` except that it accepts `iteratee` which is
+     * invoked for each element in `array` to generate the value to be summed.
+     * The iteratee is invoked with one argument: (value).
      *
      * @static
      * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to pad.
-     * @param {number} [length=0] The padding length.
-     * @param {string} [chars=' '] The string used as padding.
-     * @returns {string} Returns the padded string.
+     * @since 4.0.0
+     * @category Math
+     * @param {Array} array The array to iterate over.
+     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
+     * @returns {number} Returns the sum.
      * @example
      *
-     * _.pad('abc', 8);
-     * // => '  abc   '
+     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];
      *
-     * _.pad('abc', 8, '_-');
-     * // => '_-abc_-_'
+     * _.sumBy(objects, function(o) { return o.n; });
+     * // => 20
      *
-     * _.pad('abc', 3);
-     * // => 'abc'
+     * // The `_.property` iteratee shorthand.
+     * _.sumBy(objects, 'n');
+     * // => 20
      */
-    function pad(string, length, chars) {
-      string = toString(string);
-      length = toInteger(length);
-
-      var strLength = length ? stringSize(string) : 0;
-      if (!length || strLength >= length) {
-        return string;
-      }
-      var mid = (length - strLength) / 2;
-      return (
-        createPadding(nativeFloor(mid), chars) +
-        string +
-        createPadding(nativeCeil(mid), chars)
-      );
+    function sumBy(array, iteratee) {
+      return (array && array.length)
+        ? baseSum(array, getIteratee(iteratee, 2))
+        : 0;
     }
 
-    /**
-     * Pads `string` on the right side if it's shorter than `length`. Padding
-     * characters are truncated if they exceed `length`.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to pad.
-     * @param {number} [length=0] The padding length.
-     * @param {string} [chars=' '] The string used as padding.
-     * @returns {string} Returns the padded string.
-     * @example
-     *
-     * _.padEnd('abc', 6);
-     * // => 'abc   '
-     *
-     * _.padEnd('abc', 6, '_-');
-     * // => 'abc_-_'
-     *
-     * _.padEnd('abc', 3);
-     * // => 'abc'
-     */
-    function padEnd(string, length, chars) {
-      string = toString(string);
-      length = toInteger(length);
+    /*------------------------------------------------------------------------*/
+
+    // Add methods that return wrapped values in chain sequences.
+    lodash.after = after;
+    lodash.ary = ary;
+    lodash.assign = assign;
+    lodash.assignIn = assignIn;
+    lodash.assignInWith = assignInWith;
+    lodash.assignWith = assignWith;
+    lodash.at = at;
+    lodash.before = before;
+    lodash.bind = bind;
+    lodash.bindAll = bindAll;
+    lodash.bindKey = bindKey;
+    lodash.castArray = castArray;
+    lodash.chain = chain;
+    lodash.chunk = chunk;
+    lodash.compact = compact;
+    lodash.concat = concat;
+    lodash.cond = cond;
+    lodash.conforms = conforms;
+    lodash.constant = constant;
+    lodash.countBy = countBy;
+    lodash.create = create;
+    lodash.curry = curry;
+    lodash.curryRight = curryRight;
+    lodash.debounce = debounce;
+    lodash.defaults = defaults;
+    lodash.defaultsDeep = defaultsDeep;
+    lodash.defer = defer;
+    lodash.delay = delay;
+    lodash.difference = difference;
+    lodash.differenceBy = differenceBy;
+    lodash.differenceWith = differenceWith;
+    lodash.drop = drop;
+    lodash.dropRight = dropRight;
+    lodash.dropRightWhile = dropRightWhile;
+    lodash.dropWhile = dropWhile;
+    lodash.fill = fill;
+    lodash.filter = filter;
+    lodash.flatMap = flatMap;
+    lodash.flatMapDeep = flatMapDeep;
+    lodash.flatMapDepth = flatMapDepth;
+    lodash.flatten = flatten;
+    lodash.flattenDeep = flattenDeep;
+    lodash.flattenDepth = flattenDepth;
+    lodash.flip = flip;
+    lodash.flow = flow;
+    lodash.flowRight = flowRight;
+    lodash.fromPairs = fromPairs;
+    lodash.functions = functions;
+    lodash.functionsIn = functionsIn;
+    lodash.groupBy = groupBy;
+    lodash.initial = initial;
+    lodash.intersection = intersection;
+    lodash.intersectionBy = intersectionBy;
+    lodash.intersectionWith = intersectionWith;
+    lodash.invert = invert;
+    lodash.invertBy = invertBy;
+    lodash.invokeMap = invokeMap;
+    lodash.iteratee = iteratee;
+    lodash.keyBy = keyBy;
+    lodash.keys = keys;
+    lodash.keysIn = keysIn;
+    lodash.map = map;
+    lodash.mapKeys = mapKeys;
+    lodash.mapValues = mapValues;
+    lodash.matches = matches;
+    lodash.matchesProperty = matchesProperty;
+    lodash.memoize = memoize;
+    lodash.merge = merge;
+    lodash.mergeWith = mergeWith;
+    lodash.method = method;
+    lodash.methodOf = methodOf;
+    lodash.mixin = mixin;
+    lodash.negate = negate;
+    lodash.nthArg = nthArg;
+    lodash.omit = omit;
+    lodash.omitBy = omitBy;
+    lodash.once = once;
+    lodash.orderBy = orderBy;
+    lodash.over = over;
+    lodash.overArgs = overArgs;
+    lodash.overEvery = overEvery;
+    lodash.overSome = overSome;
+    lodash.partial = partial;
+    lodash.partialRight = partialRight;
+    lodash.partition = partition;
+    lodash.pick = pick;
+    lodash.pickBy = pickBy;
+    lodash.property = property;
+    lodash.propertyOf = propertyOf;
+    lodash.pull = pull;
+    lodash.pullAll = pullAll;
+    lodash.pullAllBy = pullAllBy;
+    lodash.pullAllWith = pullAllWith;
+    lodash.pullAt = pullAt;
+    lodash.range = range;
+    lodash.rangeRight = rangeRight;
+    lodash.rearg = rearg;
+    lodash.reject = reject;
+    lodash.remove = remove;
+    lodash.rest = rest;
+    lodash.reverse = reverse;
+    lodash.sampleSize = sampleSize;
+    lodash.set = set;
+    lodash.setWith = setWith;
+    lodash.shuffle = shuffle;
+    lodash.slice = slice;
+    lodash.sortBy = sortBy;
+    lodash.sortedUniq = sortedUniq;
+    lodash.sortedUniqBy = sortedUniqBy;
+    lodash.split = split;
+    lodash.spread = spread;
+    lodash.tail = tail;
+    lodash.take = take;
+    lodash.takeRight = takeRight;
+    lodash.takeRightWhile = takeRightWhile;
+    lodash.takeWhile = takeWhile;
+    lodash.tap = tap;
+    lodash.throttle = throttle;
+    lodash.thru = thru;
+    lodash.toArray = toArray;
+    lodash.toPairs = toPairs;
+    lodash.toPairsIn = toPairsIn;
+    lodash.toPath = toPath;
+    lodash.toPlainObject = toPlainObject;
+    lodash.transform = transform;
+    lodash.unary = unary;
+    lodash.union = union;
+    lodash.unionBy = unionBy;
+    lodash.unionWith = unionWith;
+    lodash.uniq = uniq;
+    lodash.uniqBy = uniqBy;
+    lodash.uniqWith = uniqWith;
+    lodash.unset = unset;
+    lodash.unzip = unzip;
+    lodash.unzipWith = unzipWith;
+    lodash.update = update;
+    lodash.updateWith = updateWith;
+    lodash.values = values;
+    lodash.valuesIn = valuesIn;
+    lodash.without = without;
+    lodash.words = words;
+    lodash.wrap = wrap;
+    lodash.xor = xor;
+    lodash.xorBy = xorBy;
+    lodash.xorWith = xorWith;
+    lodash.zip = zip;
+    lodash.zipObject = zipObject;
+    lodash.zipObjectDeep = zipObjectDeep;
+    lodash.zipWith = zipWith;
+
+    // Add aliases.
+    lodash.entries = toPairs;
+    lodash.entriesIn = toPairsIn;
+    lodash.extend = assignIn;
+    lodash.extendWith = assignInWith;
 
-      var strLength = length ? stringSize(string) : 0;
-      return (length && strLength < length)
-        ? (string + createPadding(length - strLength, chars))
-        : string;
-    }
+    // Add methods to `lodash.prototype`.
+    mixin(lodash, lodash);
 
-    /**
-     * Pads `string` on the left side if it's shorter than `length`. Padding
-     * characters are truncated if they exceed `length`.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to pad.
-     * @param {number} [length=0] The padding length.
-     * @param {string} [chars=' '] The string used as padding.
-     * @returns {string} Returns the padded string.
-     * @example
-     *
-     * _.padStart('abc', 6);
-     * // => '   abc'
-     *
-     * _.padStart('abc', 6, '_-');
-     * // => '_-_abc'
-     *
-     * _.padStart('abc', 3);
-     * // => 'abc'
-     */
-    function padStart(string, length, chars) {
-      string = toString(string);
-      length = toInteger(length);
+    /*------------------------------------------------------------------------*/
 
-      var strLength = length ? stringSize(string) : 0;
-      return (length && strLength < length)
-        ? (createPadding(length - strLength, chars) + string)
-        : string;
-    }
+    // Add methods that return unwrapped values in chain sequences.
+    lodash.add = add;
+    lodash.attempt = attempt;
+    lodash.camelCase = camelCase;
+    lodash.capitalize = capitalize;
+    lodash.ceil = ceil;
+    lodash.clamp = clamp;
+    lodash.clone = clone;
+    lodash.cloneDeep = cloneDeep;
+    lodash.cloneDeepWith = cloneDeepWith;
+    lodash.cloneWith = cloneWith;
+    lodash.conformsTo = conformsTo;
+    lodash.deburr = deburr;
+    lodash.defaultTo = defaultTo;
+    lodash.divide = divide;
+    lodash.endsWith = endsWith;
+    lodash.eq = eq;
+    lodash.escape = escape;
+    lodash.escapeRegExp = escapeRegExp;
+    lodash.every = every;
+    lodash.find = find;
+    lodash.findIndex = findIndex;
+    lodash.findKey = findKey;
+    lodash.findLast = findLast;
+    lodash.findLastIndex = findLastIndex;
+    lodash.findLastKey = findLastKey;
+    lodash.floor = floor;
+    lodash.forEach = forEach;
+    lodash.forEachRight = forEachRight;
+    lodash.forIn = forIn;
+    lodash.forInRight = forInRight;
+    lodash.forOwn = forOwn;
+    lodash.forOwnRight = forOwnRight;
+    lodash.get = get;
+    lodash.gt = gt;
+    lodash.gte = gte;
+    lodash.has = has;
+    lodash.hasIn = hasIn;
+    lodash.head = head;
+    lodash.identity = identity;
+    lodash.includes = includes;
+    lodash.indexOf = indexOf;
+    lodash.inRange = inRange;
+    lodash.invoke = invoke;
+    lodash.isArguments = isArguments;
+    lodash.isArray = isArray;
+    lodash.isArrayBuffer = isArrayBuffer;
+    lodash.isArrayLike = isArrayLike;
+    lodash.isArrayLikeObject = isArrayLikeObject;
+    lodash.isBoolean = isBoolean;
+    lodash.isBuffer = isBuffer;
+    lodash.isDate = isDate;
+    lodash.isElement = isElement;
+    lodash.isEmpty = isEmpty;
+    lodash.isEqual = isEqual;
+    lodash.isEqualWith = isEqualWith;
+    lodash.isError = isError;
+    lodash.isFinite = isFinite;
+    lodash.isFunction = isFunction;
+    lodash.isInteger = isInteger;
+    lodash.isLength = isLength;
+    lodash.isMap = isMap;
+    lodash.isMatch = isMatch;
+    lodash.isMatchWith = isMatchWith;
+    lodash.isNaN = isNaN;
+    lodash.isNative = isNative;
+    lodash.isNil = isNil;
+    lodash.isNull = isNull;
+    lodash.isNumber = isNumber;
+    lodash.isObject = isObject;
+    lodash.isObjectLike = isObjectLike;
+    lodash.isPlainObject = isPlainObject;
+    lodash.isRegExp = isRegExp;
+    lodash.isSafeInteger = isSafeInteger;
+    lodash.isSet = isSet;
+    lodash.isString = isString;
+    lodash.isSymbol = isSymbol;
+    lodash.isTypedArray = isTypedArray;
+    lodash.isUndefined = isUndefined;
+    lodash.isWeakMap = isWeakMap;
+    lodash.isWeakSet = isWeakSet;
+    lodash.join = join;
+    lodash.kebabCase = kebabCase;
+    lodash.last = last;
+    lodash.lastIndexOf = lastIndexOf;
+    lodash.lowerCase = lowerCase;
+    lodash.lowerFirst = lowerFirst;
+    lodash.lt = lt;
+    lodash.lte = lte;
+    lodash.max = max;
+    lodash.maxBy = maxBy;
+    lodash.mean = mean;
+    lodash.meanBy = meanBy;
+    lodash.min = min;
+    lodash.minBy = minBy;
+    lodash.stubArray = stubArray;
+    lodash.stubFalse = stubFalse;
+    lodash.stubObject = stubObject;
+    lodash.stubString = stubString;
+    lodash.stubTrue = stubTrue;
+    lodash.multiply = multiply;
+    lodash.nth = nth;
+    lodash.noConflict = noConflict;
+    lodash.noop = noop;
+    lodash.now = now;
+    lodash.pad = pad;
+    lodash.padEnd = padEnd;
+    lodash.padStart = padStart;
+    lodash.parseInt = parseInt;
+    lodash.random = random;
+    lodash.reduce = reduce;
+    lodash.reduceRight = reduceRight;
+    lodash.repeat = repeat;
+    lodash.replace = replace;
+    lodash.result = result;
+    lodash.round = round;
+    lodash.runInContext = runInContext;
+    lodash.sample = sample;
+    lodash.size = size;
+    lodash.snakeCase = snakeCase;
+    lodash.some = some;
+    lodash.sortedIndex = sortedIndex;
+    lodash.sortedIndexBy = sortedIndexBy;
+    lodash.sortedIndexOf = sortedIndexOf;
+    lodash.sortedLastIndex = sortedLastIndex;
+    lodash.sortedLastIndexBy = sortedLastIndexBy;
+    lodash.sortedLastIndexOf = sortedLastIndexOf;
+    lodash.startCase = startCase;
+    lodash.startsWith = startsWith;
+    lodash.subtract = subtract;
+    lodash.sum = sum;
+    lodash.sumBy = sumBy;
+    lodash.template = template;
+    lodash.times = times;
+    lodash.toFinite = toFinite;
+    lodash.toInteger = toInteger;
+    lodash.toLength = toLength;
+    lodash.toLower = toLower;
+    lodash.toNumber = toNumber;
+    lodash.toSafeInteger = toSafeInteger;
+    lodash.toString = toString;
+    lodash.toUpper = toUpper;
+    lodash.trim = trim;
+    lodash.trimEnd = trimEnd;
+    lodash.trimStart = trimStart;
+    lodash.truncate = truncate;
+    lodash.unescape = unescape;
+    lodash.uniqueId = uniqueId;
+    lodash.upperCase = upperCase;
+    lodash.upperFirst = upperFirst;
 
-    /**
-     * Converts `string` to an integer of the specified radix. If `radix` is
-     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a
-     * hexadecimal, in which case a `radix` of `16` is used.
-     *
-     * **Note:** This method aligns with the
-     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.
-     *
-     * @static
-     * @memberOf _
-     * @since 1.1.0
-     * @category String
-     * @param {string} string The string to convert.
-     * @param {number} [radix=10] The radix to interpret `value` by.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {number} Returns the converted integer.
-     * @example
-     *
-     * _.parseInt('08');
-     * // => 8
-     *
-     * _.map(['6', '08', '10'], _.parseInt);
-     * // => [6, 8, 10]
-     */
-    function parseInt(string, radix, guard) {
-      if (guard || radix == null) {
-        radix = 0;
-      } else if (radix) {
-        radix = +radix;
-      }
-      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);
-    }
+    // Add aliases.
+    lodash.each = forEach;
+    lodash.eachRight = forEachRight;
+    lodash.first = head;
 
-    /**
-     * Repeats the given string `n` times.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to repeat.
-     * @param {number} [n=1] The number of times to repeat the string.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {string} Returns the repeated string.
-     * @example
-     *
-     * _.repeat('*', 3);
-     * // => '***'
-     *
-     * _.repeat('abc', 2);
-     * // => 'abcabc'
-     *
-     * _.repeat('abc', 0);
-     * // => ''
-     */
-    function repeat(string, n, guard) {
-      if ((guard ? isIterateeCall(string, n, guard) : n === undefined$1)) {
-        n = 1;
-      } else {
-        n = toInteger(n);
-      }
-      return baseRepeat(toString(string), n);
-    }
+    mixin(lodash, (function() {
+      var source = {};
+      baseForOwn(lodash, function(func, methodName) {
+        if (!hasOwnProperty.call(lodash.prototype, methodName)) {
+          source[methodName] = func;
+        }
+      });
+      return source;
+    }()), { 'chain': false });
+
+    /*------------------------------------------------------------------------*/
 
     /**
-     * Replaces matches for `pattern` in `string` with `replacement`.
-     *
-     * **Note:** This method is based on
-     * [`String#replace`](https://mdn.io/String/replace).
+     * The semantic version number.
      *
      * @static
      * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to modify.
-     * @param {RegExp|string} pattern The pattern to replace.
-     * @param {Function|string} replacement The match replacement.
-     * @returns {string} Returns the modified string.
-     * @example
-     *
-     * _.replace('Hi Fred', 'Fred', 'Barney');
-     * // => 'Hi Barney'
+     * @type {string}
      */
-    function replace() {
-      var args = arguments,
-          string = toString(args[0]);
+    lodash.VERSION = VERSION;
 
-      return args.length < 3 ? string : string.replace(args[1], args[2]);
-    }
+    // Assign default placeholders.
+    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {
+      lodash[methodName].placeholder = lodash;
+    });
 
-    /**
-     * Converts `string` to
-     * [snake case](https://en.wikipedia.org/wiki/Snake_case).
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the snake cased string.
-     * @example
-     *
-     * _.snakeCase('Foo Bar');
-     * // => 'foo_bar'
-     *
-     * _.snakeCase('fooBar');
-     * // => 'foo_bar'
-     *
-     * _.snakeCase('--FOO-BAR--');
-     * // => 'foo_bar'
-     */
-    var snakeCase = createCompounder(function(result, word, index) {
-      return result + (index ? '_' : '') + word.toLowerCase();
+    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.
+    arrayEach(['drop', 'take'], function(methodName, index) {
+      LazyWrapper.prototype[methodName] = function(n) {
+        n = n === undefined$1 ? 1 : nativeMax(toInteger(n), 0);
+
+        var result = (this.__filtered__ && !index)
+          ? new LazyWrapper(this)
+          : this.clone();
+
+        if (result.__filtered__) {
+          result.__takeCount__ = nativeMin(n, result.__takeCount__);
+        } else {
+          result.__views__.push({
+            'size': nativeMin(n, MAX_ARRAY_LENGTH),
+            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')
+          });
+        }
+        return result;
+      };
+
+      LazyWrapper.prototype[methodName + 'Right'] = function(n) {
+        return this.reverse()[methodName](n).reverse();
+      };
     });
 
-    /**
-     * Splits `string` by `separator`.
-     *
-     * **Note:** This method is based on
-     * [`String#split`](https://mdn.io/String/split).
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to split.
-     * @param {RegExp|string} separator The separator pattern to split by.
-     * @param {number} [limit] The length to truncate results to.
-     * @returns {Array} Returns the string segments.
-     * @example
-     *
-     * _.split('a-b-c', '-', 2);
-     * // => ['a', 'b']
-     */
-    function split(string, separator, limit) {
-      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {
-        separator = limit = undefined$1;
+    // Add `LazyWrapper` methods that accept an `iteratee` value.
+    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {
+      var type = index + 1,
+          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;
+
+      LazyWrapper.prototype[methodName] = function(iteratee) {
+        var result = this.clone();
+        result.__iteratees__.push({
+          'iteratee': getIteratee(iteratee, 3),
+          'type': type
+        });
+        result.__filtered__ = result.__filtered__ || isFilter;
+        return result;
+      };
+    });
+
+    // Add `LazyWrapper` methods for `_.head` and `_.last`.
+    arrayEach(['head', 'last'], function(methodName, index) {
+      var takeName = 'take' + (index ? 'Right' : '');
+
+      LazyWrapper.prototype[methodName] = function() {
+        return this[takeName](1).value()[0];
+      };
+    });
+
+    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.
+    arrayEach(['initial', 'tail'], function(methodName, index) {
+      var dropName = 'drop' + (index ? '' : 'Right');
+
+      LazyWrapper.prototype[methodName] = function() {
+        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);
+      };
+    });
+
+    LazyWrapper.prototype.compact = function() {
+      return this.filter(identity);
+    };
+
+    LazyWrapper.prototype.find = function(predicate) {
+      return this.filter(predicate).head();
+    };
+
+    LazyWrapper.prototype.findLast = function(predicate) {
+      return this.reverse().find(predicate);
+    };
+
+    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {
+      if (typeof path == 'function') {
+        return new LazyWrapper(this);
       }
-      limit = limit === undefined$1 ? MAX_ARRAY_LENGTH : limit >>> 0;
-      if (!limit) {
-        return [];
+      return this.map(function(value) {
+        return baseInvoke(value, path, args);
+      });
+    });
+
+    LazyWrapper.prototype.reject = function(predicate) {
+      return this.filter(negate(getIteratee(predicate)));
+    };
+
+    LazyWrapper.prototype.slice = function(start, end) {
+      start = toInteger(start);
+
+      var result = this;
+      if (result.__filtered__ && (start > 0 || end < 0)) {
+        return new LazyWrapper(result);
       }
-      string = toString(string);
-      if (string && (
-            typeof separator == 'string' ||
-            (separator != null && !isRegExp(separator))
-          )) {
-        separator = baseToString(separator);
-        if (!separator && hasUnicode(string)) {
-          return castSlice(stringToArray(string), 0, limit);
+      if (start < 0) {
+        result = result.takeRight(-start);
+      } else if (start) {
+        result = result.drop(start);
+      }
+      if (end !== undefined$1) {
+        end = toInteger(end);
+        result = end < 0 ? result.dropRight(-end) : result.take(end - start);
+      }
+      return result;
+    };
+
+    LazyWrapper.prototype.takeRightWhile = function(predicate) {
+      return this.reverse().takeWhile(predicate).reverse();
+    };
+
+    LazyWrapper.prototype.toArray = function() {
+      return this.take(MAX_ARRAY_LENGTH);
+    };
+
+    // Add `LazyWrapper` methods to `lodash.prototype`.
+    baseForOwn(LazyWrapper.prototype, function(func, methodName) {
+      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),
+          isTaker = /^(?:head|last)$/.test(methodName),
+          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],
+          retUnwrapped = isTaker || /^find/.test(methodName);
+
+      if (!lodashFunc) {
+        return;
+      }
+      lodash.prototype[methodName] = function() {
+        var value = this.__wrapped__,
+            args = isTaker ? [1] : arguments,
+            isLazy = value instanceof LazyWrapper,
+            iteratee = args[0],
+            useLazy = isLazy || isArray(value);
+
+        var interceptor = function(value) {
+          var result = lodashFunc.apply(lodash, arrayPush([value], args));
+          return (isTaker && chainAll) ? result[0] : result;
+        };
+
+        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {
+          // Avoid lazy use if the iteratee has a "length" value other than `1`.
+          isLazy = useLazy = false;
         }
-      }
-      return string.split(separator, limit);
-    }
+        var chainAll = this.__chain__,
+            isHybrid = !!this.__actions__.length,
+            isUnwrapped = retUnwrapped && !chainAll,
+            onlyLazy = isLazy && !isHybrid;
 
-    /**
-     * Converts `string` to
-     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).
-     *
-     * @static
-     * @memberOf _
-     * @since 3.1.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the start cased string.
-     * @example
-     *
-     * _.startCase('--foo-bar--');
-     * // => 'Foo Bar'
-     *
-     * _.startCase('fooBar');
-     * // => 'Foo Bar'
-     *
-     * _.startCase('__FOO_BAR__');
-     * // => 'FOO BAR'
-     */
-    var startCase = createCompounder(function(result, word, index) {
-      return result + (index ? ' ' : '') + upperFirst(word);
+        if (!retUnwrapped && useLazy) {
+          value = onlyLazy ? value : new LazyWrapper(this);
+          var result = func.apply(value, args);
+          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined$1 });
+          return new LodashWrapper(result, chainAll);
+        }
+        if (isUnwrapped && onlyLazy) {
+          return func.apply(this, args);
+        }
+        result = this.thru(interceptor);
+        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;
+      };
     });
 
-    /**
-     * Checks if `string` starts with the given target string.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to inspect.
-     * @param {string} [target] The string to search for.
-     * @param {number} [position=0] The position to search from.
-     * @returns {boolean} Returns `true` if `string` starts with `target`,
-     *  else `false`.
-     * @example
-     *
-     * _.startsWith('abc', 'a');
-     * // => true
-     *
-     * _.startsWith('abc', 'b');
-     * // => false
-     *
-     * _.startsWith('abc', 'b', 1);
-     * // => true
-     */
-    function startsWith(string, target, position) {
-      string = toString(string);
-      position = position == null
-        ? 0
-        : baseClamp(toInteger(position), 0, string.length);
-
-      target = baseToString(target);
-      return string.slice(position, position + target.length) == target;
-    }
+    // Add `Array` methods to `lodash.prototype`.
+    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {
+      var func = arrayProto[methodName],
+          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',
+          retUnwrapped = /^(?:pop|shift)$/.test(methodName);
 
-    /**
-     * Creates a compiled template function that can interpolate data properties
-     * in "interpolate" delimiters, HTML-escape interpolated data properties in
-     * "escape" delimiters, and execute JavaScript in "evaluate" delimiters. Data
-     * properties may be accessed as free variables in the template. If a setting
-     * object is given, it takes precedence over `_.templateSettings` values.
-     *
-     * **Note:** In the development build `_.template` utilizes
-     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)
-     * for easier debugging.
-     *
-     * For more information on precompiling templates see
-     * [lodash's custom builds documentation](https://lodash.com/custom-builds).
-     *
-     * For more information on Chrome extension sandboxes see
-     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category String
-     * @param {string} [string=''] The template string.
-     * @param {Object} [options={}] The options object.
-     * @param {RegExp} [options.escape=_.templateSettings.escape]
-     *  The HTML "escape" delimiter.
-     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]
-     *  The "evaluate" delimiter.
-     * @param {Object} [options.imports=_.templateSettings.imports]
-     *  An object to import into the template as free variables.
-     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]
-     *  The "interpolate" delimiter.
-     * @param {string} [options.sourceURL='lodash.templateSources[n]']
-     *  The sourceURL of the compiled template.
-     * @param {string} [options.variable='obj']
-     *  The data object variable name.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Function} Returns the compiled template function.
-     * @example
-     *
-     * // Use the "interpolate" delimiter to create a compiled template.
-     * var compiled = _.template('hello <%= user %>!');
-     * compiled({ 'user': 'fred' });
-     * // => 'hello fred!'
-     *
-     * // Use the HTML "escape" delimiter to escape data property values.
-     * var compiled = _.template('<b><%- value %></b>');
-     * compiled({ 'value': '<script>' });
-     * // => '<b>&lt;script&gt;</b>'
-     *
-     * // Use the "evaluate" delimiter to execute JavaScript and generate HTML.
-     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');
-     * compiled({ 'users': ['fred', 'barney'] });
-     * // => '<li>fred</li><li>barney</li>'
-     *
-     * // Use the internal `print` function in "evaluate" delimiters.
-     * var compiled = _.template('<% print("hello " + user); %>!');
-     * compiled({ 'user': 'barney' });
-     * // => 'hello barney!'
-     *
-     * // Use the ES template literal delimiter as an "interpolate" delimiter.
-     * // Disable support by replacing the "interpolate" delimiter.
-     * var compiled = _.template('hello ${ user }!');
-     * compiled({ 'user': 'pebbles' });
-     * // => 'hello pebbles!'
-     *
-     * // Use backslashes to treat delimiters as plain text.
-     * var compiled = _.template('<%= "\\<%- value %\\>" %>');
-     * compiled({ 'value': 'ignored' });
-     * // => '<%- value %>'
-     *
-     * // Use the `imports` option to import `jQuery` as `jq`.
-     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';
-     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });
-     * compiled({ 'users': ['fred', 'barney'] });
-     * // => '<li>fred</li><li>barney</li>'
-     *
-     * // Use the `sourceURL` option to specify a custom sourceURL for the template.
-     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });
-     * compiled(data);
-     * // => Find the source of "greeting.jst" under the Sources tab or Resources panel of the web inspector.
-     *
-     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.
-     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });
-     * compiled.source;
-     * // => function(data) {
-     * //   var __t, __p = '';
-     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';
-     * //   return __p;
-     * // }
-     *
-     * // Use custom template delimiters.
-     * _.templateSettings.interpolate = /{{([\s\S]+?)}}/g;
-     * var compiled = _.template('hello {{ user }}!');
-     * compiled({ 'user': 'mustache' });
-     * // => 'hello mustache!'
-     *
-     * // Use the `source` property to inline compiled templates for meaningful
-     * // line numbers in error messages and stack traces.
-     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\
-     *   var JST = {\
-     *     "main": ' + _.template(mainText).source + '\
-     *   };\
-     * ');
-     */
-    function template(string, options, guard) {
-      // Based on John Resig's `tmpl` implementation
-      // (http://ejohn.org/blog/javascript-micro-templating/)
-      // and Laura Doktorova's doT.js (https://github.com/olado/doT).
-      var settings = lodash.templateSettings;
+      lodash.prototype[methodName] = function() {
+        var args = arguments;
+        if (retUnwrapped && !this.__chain__) {
+          var value = this.value();
+          return func.apply(isArray(value) ? value : [], args);
+        }
+        return this[chainName](function(value) {
+          return func.apply(isArray(value) ? value : [], args);
+        });
+      };
+    });
 
-      if (guard && isIterateeCall(string, options, guard)) {
-        options = undefined$1;
+    // Map minified method names to their real names.
+    baseForOwn(LazyWrapper.prototype, function(func, methodName) {
+      var lodashFunc = lodash[methodName];
+      if (lodashFunc) {
+        var key = lodashFunc.name + '';
+        if (!hasOwnProperty.call(realNames, key)) {
+          realNames[key] = [];
+        }
+        realNames[key].push({ 'name': methodName, 'func': lodashFunc });
       }
-      string = toString(string);
-      options = assignInWith({}, options, settings, customDefaultsAssignIn);
+    });
 
-      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),
-          importsKeys = keys(imports),
-          importsValues = baseValues(imports, importsKeys);
+    realNames[createHybrid(undefined$1, WRAP_BIND_KEY_FLAG).name] = [{
+      'name': 'wrapper',
+      'func': undefined$1
+    }];
 
-      var isEscaping,
-          isEvaluating,
-          index = 0,
-          interpolate = options.interpolate || reNoMatch,
-          source = "__p += '";
+    // Add methods to `LazyWrapper`.
+    LazyWrapper.prototype.clone = lazyClone;
+    LazyWrapper.prototype.reverse = lazyReverse;
+    LazyWrapper.prototype.value = lazyValue;
 
-      // Compile the regexp to match each delimiter.
-      var reDelimiters = RegExp(
-        (options.escape || reNoMatch).source + '|' +
-        interpolate.source + '|' +
-        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +
-        (options.evaluate || reNoMatch).source + '|$'
-      , 'g');
+    // Add chain sequence methods to the `lodash` wrapper.
+    lodash.prototype.at = wrapperAt;
+    lodash.prototype.chain = wrapperChain;
+    lodash.prototype.commit = wrapperCommit;
+    lodash.prototype.next = wrapperNext;
+    lodash.prototype.plant = wrapperPlant;
+    lodash.prototype.reverse = wrapperReverse;
+    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;
 
-      // Use a sourceURL for easier debugging.
-      // The sourceURL gets injected into the source that's eval-ed, so be careful
-      // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in
-      // and escape the comment, thus injecting code that gets evaled.
-      var sourceURL = '//# sourceURL=' +
-        (hasOwnProperty.call(options, 'sourceURL')
-          ? (options.sourceURL + '').replace(/\s/g, ' ')
-          : ('lodash.templateSources[' + (++templateCounter) + ']')
-        ) + '\n';
+    // Add lazy aliases.
+    lodash.prototype.first = lodash.prototype.head;
 
-      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {
-        interpolateValue || (interpolateValue = esTemplateValue);
+    if (symIterator) {
+      lodash.prototype[symIterator] = wrapperToIterator;
+    }
+    return lodash;
+  });
 
-        // Escape characters that can't be included in string literals.
-        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);
+  /*--------------------------------------------------------------------------*/
 
-        // Replace delimiters with snippets.
-        if (escapeValue) {
-          isEscaping = true;
-          source += "' +\n__e(" + escapeValue + ") +\n'";
-        }
-        if (evaluateValue) {
-          isEvaluating = true;
-          source += "';\n" + evaluateValue + ";\n__p += '";
-        }
-        if (interpolateValue) {
-          source += "' +\n((__t = (" + interpolateValue + ")) == null ? '' : __t) +\n'";
-        }
-        index = offset + match.length;
+  // Export lodash.
+  var _ = runInContext();
 
-        // The JS engine embedded in Adobe products needs `match` returned in
-        // order to produce the correct `offset` value.
-        return match;
-      });
+  // Some AMD build optimizers, like r.js, check for condition patterns like:
+  if (freeModule) {
+    // Export for Node.js.
+    (freeModule.exports = _)._ = _;
+    // Export for CommonJS support.
+    freeExports._ = _;
+  }
+  else {
+    // Export to the global object.
+    root._ = _;
+  }
+}.call(commonjsGlobal));
+});
 
-      source += "';\n";
+var graphology_umd_min = createCommonjsModule(function (module, exports) {
+!function(t,e){module.exports=e();}(commonjsGlobal,(function(){function t(e){return t="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},t(e)}function e(t,e){t.prototype=Object.create(e.prototype),t.prototype.constructor=t,r(t,e);}function n(t){return n=Object.setPrototypeOf?Object.getPrototypeOf:function(t){return t.__proto__||Object.getPrototypeOf(t)},n(t)}function r(t,e){return r=Object.setPrototypeOf||function(t,e){return t.__proto__=e,t},r(t,e)}function i(){if("undefined"==typeof Reflect||!Reflect.construct)return !1;if(Reflect.construct.sham)return !1;if("function"==typeof Proxy)return !0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(t){return !1}}function o(t,e,n){return o=i()?Reflect.construct:function(t,e,n){var i=[null];i.push.apply(i,e);var o=new(Function.bind.apply(t,i));return n&&r(o,n.prototype),o},o.apply(null,arguments)}function a(t){var e="function"==typeof Map?new Map:void 0;return a=function(t){if(null===t||(i=t,-1===Function.toString.call(i).indexOf("[native code]")))return t;var i;if("function"!=typeof t)throw new TypeError("Super expression must either be null or a function");if(void 0!==e){if(e.has(t))return e.get(t);e.set(t,a);}function a(){return o(t,arguments,n(this).constructor)}return a.prototype=Object.create(t.prototype,{constructor:{value:a,enumerable:!1,writable:!0,configurable:!0}}),r(a,t)},a(t)}function u(t){if(void 0===t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return t}var c=function(){for(var t=arguments[0],e=1,n=arguments.length;e<n;e++)if(arguments[e])for(var r in arguments[e])t[r]=arguments[e][r];return t};function d(t,e,n,r){var i=t._nodes.get(e),o=null;return i?o="mixed"===r?i.out&&i.out[n]||i.undirected&&i.undirected[n]:"directed"===r?i.out&&i.out[n]:i.undirected&&i.undirected[n]:o}function s(e){return null!==e&&"object"===t(e)&&"function"==typeof e.addUndirectedEdgeWithKey&&"function"==typeof e.dropNode}function h(e){return "object"===t(e)&&null!==e&&e.constructor===Object}function f(t){var e;for(e in t)return !1;return !0}function p(t,e,n){Object.defineProperty(t,e,{enumerable:!1,configurable:!1,writable:!0,value:n});}function l(t,e,n){var r={enumerable:!0,configurable:!0};"function"==typeof n?r.get=n:(r.value=n,r.writable=!1),Object.defineProperty(t,e,r);}function g(t){return !!h(t)&&!(t.attributes&&!Array.isArray(t.attributes))}"function"==typeof Object.assign&&(c=Object.assign);var y,v={exports:{}},b="object"==typeof Reflect?Reflect:null,w=b&&"function"==typeof b.apply?b.apply:function(t,e,n){return Function.prototype.apply.call(t,e,n)};y=b&&"function"==typeof b.ownKeys?b.ownKeys:Object.getOwnPropertySymbols?function(t){return Object.getOwnPropertyNames(t).concat(Object.getOwnPropertySymbols(t))}:function(t){return Object.getOwnPropertyNames(t)};var m=Number.isNaN||function(t){return t!=t};function _(){_.init.call(this);}v.exports=_,v.exports.once=function(t,e){return new Promise((function(n,r){function i(n){t.removeListener(e,o),r(n);}function o(){"function"==typeof t.removeListener&&t.removeListener("error",i),n([].slice.call(arguments));}U(t,e,o,{once:!0}),"error"!==e&&function(t,e,n){"function"==typeof t.on&&U(t,"error",e,n);}(t,i,{once:!0});}))},_.EventEmitter=_,_.prototype._events=void 0,_.prototype._eventsCount=0,_.prototype._maxListeners=void 0;var k=10;function G(t){if("function"!=typeof t)throw new TypeError('The "listener" argument must be of type Function. Received type '+typeof t)}function x(t){return void 0===t._maxListeners?_.defaultMaxListeners:t._maxListeners}function E(t,e,n,r){var i,o,a,u;if(G(n),void 0===(o=t._events)?(o=t._events=Object.create(null),t._eventsCount=0):(void 0!==o.newListener&&(t.emit("newListener",e,n.listener?n.listener:n),o=t._events),a=o[e]),void 0===a)a=o[e]=n,++t._eventsCount;else if("function"==typeof a?a=o[e]=r?[n,a]:[a,n]:r?a.unshift(n):a.push(n),(i=x(t))>0&&a.length>i&&!a.warned){a.warned=!0;var c=new Error("Possible EventEmitter memory leak detected. "+a.length+" "+String(e)+" listeners added. Use emitter.setMaxListeners() to increase limit");c.name="MaxListenersExceededWarning",c.emitter=t,c.type=e,c.count=a.length,u=c,console&&console.warn&&console.warn(u);}return t}function S(){if(!this.fired)return this.target.removeListener(this.type,this.wrapFn),this.fired=!0,0===arguments.length?this.listener.call(this.target):this.listener.apply(this.target,arguments)}function A(t,e,n){var r={fired:!1,wrapFn:void 0,target:t,type:e,listener:n},i=S.bind(r);return i.listener=n,r.wrapFn=i,i}function L(t,e,n){var r=t._events;if(void 0===r)return [];var i=r[e];return void 0===i?[]:"function"==typeof i?n?[i.listener||i]:[i]:n?function(t){for(var e=new Array(t.length),n=0;n<e.length;++n)e[n]=t[n].listener||t[n];return e}(i):N(i,i.length)}function D(t){var e=this._events;if(void 0!==e){var n=e[t];if("function"==typeof n)return 1;if(void 0!==n)return n.length}return 0}function N(t,e){for(var n=new Array(e),r=0;r<e;++r)n[r]=t[r];return n}function U(t,e,n,r){if("function"==typeof t.on)r.once?t.once(e,n):t.on(e,n);else {if("function"!=typeof t.addEventListener)throw new TypeError('The "emitter" argument must be of type EventEmitter. Received type '+typeof t);t.addEventListener(e,(function i(o){r.once&&t.removeEventListener(e,i),n(o);}));}}function j(t){if("function"!=typeof t)throw new Error("obliterator/iterator: expecting a function!");this.next=t;}Object.defineProperty(_,"defaultMaxListeners",{enumerable:!0,get:function(){return k},set:function(t){if("number"!=typeof t||t<0||m(t))throw new RangeError('The value of "defaultMaxListeners" is out of range. It must be a non-negative number. Received '+t+".");k=t;}}),_.init=function(){void 0!==this._events&&this._events!==Object.getPrototypeOf(this)._events||(this._events=Object.create(null),this._eventsCount=0),this._maxListeners=this._maxListeners||void 0;},_.prototype.setMaxListeners=function(t){if("number"!=typeof t||t<0||m(t))throw new RangeError('The value of "n" is out of range. It must be a non-negative number. Received '+t+".");return this._maxListeners=t,this},_.prototype.getMaxListeners=function(){return x(this)},_.prototype.emit=function(t){for(var e=[],n=1;n<arguments.length;n++)e.push(arguments[n]);var r="error"===t,i=this._events;if(void 0!==i)r=r&&void 0===i.error;else if(!r)return !1;if(r){var o;if(e.length>0&&(o=e[0]),o instanceof Error)throw o;var a=new Error("Unhandled error."+(o?" ("+o.message+")":""));throw a.context=o,a}var u=i[t];if(void 0===u)return !1;if("function"==typeof u)w(u,this,e);else {var c=u.length,d=N(u,c);for(n=0;n<c;++n)w(d[n],this,e);}return !0},_.prototype.addListener=function(t,e){return E(this,t,e,!1)},_.prototype.on=_.prototype.addListener,_.prototype.prependListener=function(t,e){return E(this,t,e,!0)},_.prototype.once=function(t,e){return G(e),this.on(t,A(this,t,e)),this},_.prototype.prependOnceListener=function(t,e){return G(e),this.prependListener(t,A(this,t,e)),this},_.prototype.removeListener=function(t,e){var n,r,i,o,a;if(G(e),void 0===(r=this._events))return this;if(void 0===(n=r[t]))return this;if(n===e||n.listener===e)0==--this._eventsCount?this._events=Object.create(null):(delete r[t],r.removeListener&&this.emit("removeListener",t,n.listener||e));else if("function"!=typeof n){for(i=-1,o=n.length-1;o>=0;o--)if(n[o]===e||n[o].listener===e){a=n[o].listener,i=o;break}if(i<0)return this;0===i?n.shift():function(t,e){for(;e+1<t.length;e++)t[e]=t[e+1];t.pop();}(n,i),1===n.length&&(r[t]=n[0]),void 0!==r.removeListener&&this.emit("removeListener",t,a||e);}return this},_.prototype.off=_.prototype.removeListener,_.prototype.removeAllListeners=function(t){var e,n,r;if(void 0===(n=this._events))return this;if(void 0===n.removeListener)return 0===arguments.length?(this._events=Object.create(null),this._eventsCount=0):void 0!==n[t]&&(0==--this._eventsCount?this._events=Object.create(null):delete n[t]),this;if(0===arguments.length){var i,o=Object.keys(n);for(r=0;r<o.length;++r)"removeListener"!==(i=o[r])&&this.removeAllListeners(i);return this.removeAllListeners("removeListener"),this._events=Object.create(null),this._eventsCount=0,this}if("function"==typeof(e=n[t]))this.removeListener(t,e);else if(void 0!==e)for(r=e.length-1;r>=0;r--)this.removeListener(t,e[r]);return this},_.prototype.listeners=function(t){return L(this,t,!0)},_.prototype.rawListeners=function(t){return L(this,t,!1)},_.listenerCount=function(t,e){return "function"==typeof t.listenerCount?t.listenerCount(e):D.call(t,e)},_.prototype.listenerCount=D,_.prototype.eventNames=function(){return this._eventsCount>0?y(this._events):[]},"undefined"!=typeof Symbol&&(j.prototype[Symbol.iterator]=function(){return this}),j.of=function(){var t=arguments,e=t.length,n=0;return new j((function(){return n>=e?{done:!0}:{done:!1,value:t[n++]}}))},j.empty=function(){return new j((function(){return {done:!0}}))},j.fromSequence=function(t){var e=0,n=t.length;return new j((function(){return e>=n?{done:!0}:{done:!1,value:t[e++]}}))},j.is=function(t){return t instanceof j||"object"==typeof t&&null!==t&&"function"==typeof t.next};var O=j,C={};C.ARRAY_BUFFER_SUPPORT="undefined"!=typeof ArrayBuffer,C.SYMBOL_SUPPORT="undefined"!=typeof Symbol;var z=O,M=C,P=M.ARRAY_BUFFER_SUPPORT,T=M.SYMBOL_SUPPORT;var R=function(t){var e=function(t){return "string"==typeof t||Array.isArray(t)||P&&ArrayBuffer.isView(t)?z.fromSequence(t):"object"!=typeof t||null===t?null:T&&"function"==typeof t[Symbol.iterator]?t[Symbol.iterator]():"function"==typeof t.next?t:null}(t);if(!e)throw new Error("obliterator: target is not iterable nor a valid iterator.");return e},W=R,K=function(t,e){for(var n,r=arguments.length>1?e:1/0,i=r!==1/0?new Array(r):[],o=0,a=W(t);;){if(o===r)return i;if((n=a.next()).done)return o!==e&&(i.length=o),i;i[o++]=n.value;}},I=function(t){function n(e){var n;return (n=t.call(this)||this).name="GraphError",n.message=e,n}return e(n,t),n}(a(Error)),F=function(t){function n(e){var r;return (r=t.call(this,e)||this).name="InvalidArgumentsGraphError","function"==typeof Error.captureStackTrace&&Error.captureStackTrace(u(r),n.prototype.constructor),r}return e(n,t),n}(I),Y=function(t){function n(e){var r;return (r=t.call(this,e)||this).name="NotFoundGraphError","function"==typeof Error.captureStackTrace&&Error.captureStackTrace(u(r),n.prototype.constructor),r}return e(n,t),n}(I),B=function(t){function n(e){var r;return (r=t.call(this,e)||this).name="UsageGraphError","function"==typeof Error.captureStackTrace&&Error.captureStackTrace(u(r),n.prototype.constructor),r}return e(n,t),n}(I);function q(t,e){this.key=t,this.attributes=e,this.clear();}function J(t,e){this.key=t,this.attributes=e,this.clear();}function V(t,e){this.key=t,this.attributes=e,this.clear();}function H(t,e,n,r,i){this.key=e,this.attributes=i,this.undirected=t,this.source=n,this.target=r;}function Q(t,e,n,r,i,o,a){var u,c,d="out",s="in";if(e&&(d=s="undirected"),t.multi){if(void 0===(c=(u=o[d])[i])&&(c=new Set,u[i]=c),c.add(n),r===i&&e)return;void 0===(u=a[s])[r]&&(u[r]=c);}else {if(o[d][i]=n,r===i&&e)return;a[s][r]=n;}}function X(t,e,n){var r=t.multi,i=n.source,o=n.target,a=i.key,u=o.key,c=i[e?"undirected":"out"],d=e?"undirected":"in";if(u in c)if(r){var s=c[u];1===s.size?(delete c[u],delete o[d][a]):s.delete(n);}else delete c[u];r||delete o[d][a];}q.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.undirectedDegree=0,this.directedSelfLoops=0,this.undirectedSelfLoops=0,this.in={},this.out={},this.undirected={};},J.prototype.clear=function(){this.inDegree=0,this.outDegree=0,this.directedSelfLoops=0,this.in={},this.out={};},J.prototype.upgradeToMixed=function(){this.undirectedDegree=0,this.undirectedSelfLoops=0,this.undirected={};},V.prototype.clear=function(){this.undirectedDegree=0,this.undirectedSelfLoops=0,this.undirected={};},V.prototype.upgradeToMixed=function(){this.inDegree=0,this.outDegree=0,this.directedSelfLoops=0,this.in={},this.out={};};function Z(t,e,n,r,i,o,a){var u,c,d,s;if(r=""+r,0===n){if(!(u=t._nodes.get(r)))throw new Y("Graph.".concat(e,': could not find the "').concat(r,'" node in the graph.'));d=i,s=o;}else if(3===n){if(i=""+i,!(c=t._edges.get(i)))throw new Y("Graph.".concat(e,': could not find the "').concat(i,'" edge in the graph.'));var h=c.source.key,f=c.target.key;if(r===h)u=c.target;else {if(r!==f)throw new Y("Graph.".concat(e,': the "').concat(r,'" node is not attached to the "').concat(i,'" edge (').concat(h,", ").concat(f,")."));u=c.source;}d=o,s=a;}else {if(!(c=t._edges.get(r)))throw new Y("Graph.".concat(e,': could not find the "').concat(r,'" edge in the graph.'));u=1===n?c.source:c.target,d=i,s=o;}return [u,d,s]}var $=[{name:function(t){return "get".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];return a.attributes[u]};}},{name:function(t){return "get".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r){return Z(this,e,n,t,r)[0].attributes};}},{name:function(t){return "has".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];return a.attributes.hasOwnProperty(u)};}},{name:function(t){return "set".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i,o){var a=Z(this,e,n,t,r,i,o),u=a[0],c=a[1],d=a[2];return u.attributes[c]=d,this.emit("nodeAttributesUpdated",{key:u.key,type:"set",attributes:u.attributes,name:c}),this};}},{name:function(t){return "update".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i,o){var a=Z(this,e,n,t,r,i,o),u=a[0],c=a[1],d=a[2];if("function"!=typeof d)throw new F("Graph.".concat(e,": updater should be a function."));var s=u.attributes,h=d(s[c]);return s[c]=h,this.emit("nodeAttributesUpdated",{key:u.key,type:"set",attributes:u.attributes,name:c}),this};}},{name:function(t){return "remove".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];return delete a.attributes[u],this.emit("nodeAttributesUpdated",{key:a.key,type:"remove",attributes:a.attributes,name:u}),this};}},{name:function(t){return "replace".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];if(!h(u))throw new F("Graph.".concat(e,": provided attributes are not a plain object."));return a.attributes=u,this.emit("nodeAttributesUpdated",{key:a.key,type:"replace",attributes:a.attributes}),this};}},{name:function(t){return "merge".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];if(!h(u))throw new F("Graph.".concat(e,": provided attributes are not a plain object."));return c(a.attributes,u),this.emit("nodeAttributesUpdated",{key:a.key,type:"merge",attributes:a.attributes,data:u}),this};}},{name:function(t){return "update".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o=Z(this,e,n,t,r,i),a=o[0],u=o[1];if("function"!=typeof u)throw new F("Graph.".concat(e,": provided updater is not a function."));return a.attributes=u(a.attributes),this.emit("nodeAttributesUpdated",{key:a.key,type:"update",attributes:a.attributes}),this};}}];var tt=[{name:function(t){return "get".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return i.attributes[r]};}},{name:function(t){return "get".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t){var r;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>1){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var i=""+t,o=""+arguments[1];if(!(r=d(this,i,o,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(i,'" - "').concat(o,'").'))}else if(t=""+t,!(r=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&r.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return r.attributes};}},{name:function(t){return "has".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return i.attributes.hasOwnProperty(r)};}},{name:function(t){return "set".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>3){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var a=""+t,u=""+r;if(r=arguments[2],i=arguments[3],!(o=d(this,a,u,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(a,'" - "').concat(u,'").'))}else if(t=""+t,!(o=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&o.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return o.attributes[r]=i,this.emit("edgeAttributesUpdated",{key:o.key,type:"set",attributes:o.attributes,name:r}),this};}},{name:function(t){return "update".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r,i){var o;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>3){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var a=""+t,u=""+r;if(r=arguments[2],i=arguments[3],!(o=d(this,a,u,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(a,'" - "').concat(u,'").'))}else if(t=""+t,!(o=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("function"!=typeof i)throw new F("Graph.".concat(e,": updater should be a function."));if("mixed"!==n&&o.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return o.attributes[r]=i(o.attributes[r]),this.emit("edgeAttributesUpdated",{key:o.key,type:"set",attributes:o.attributes,name:r}),this};}},{name:function(t){return "remove".concat(t,"Attribute")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return delete i.attributes[r],this.emit("edgeAttributesUpdated",{key:i.key,type:"remove",attributes:i.attributes,name:r}),this};}},{name:function(t){return "replace".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if(!h(r))throw new F("Graph.".concat(e,": provided attributes are not a plain object."));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return i.attributes=r,this.emit("edgeAttributesUpdated",{key:i.key,type:"replace",attributes:i.attributes}),this};}},{name:function(t){return "merge".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if(!h(r))throw new F("Graph.".concat(e,": provided attributes are not a plain object."));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return c(i.attributes,r),this.emit("edgeAttributesUpdated",{key:i.key,type:"merge",attributes:i.attributes,data:r}),this};}},{name:function(t){return "update".concat(t,"Attributes")},attacher:function(t,e,n){t.prototype[e]=function(t,r){var i;if("mixed"!==this.type&&"mixed"!==n&&n!==this.type)throw new B("Graph.".concat(e,": cannot find this type of edges in your ").concat(this.type," graph."));if(arguments.length>2){if(this.multi)throw new B("Graph.".concat(e,": cannot use a {source,target} combo when asking about an edge's attributes in a MultiGraph since we cannot infer the one you want information about."));var o=""+t,a=""+r;if(r=arguments[2],!(i=d(this,o,a,n)))throw new Y("Graph.".concat(e,': could not find an edge for the given path ("').concat(o,'" - "').concat(a,'").'))}else if(t=""+t,!(i=this._edges.get(t)))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" edge in the graph.'));if("function"!=typeof r)throw new F("Graph.".concat(e,": provided updater is not a function."));if("mixed"!==n&&i.undirected!==("undirected"===n))throw new Y("Graph.".concat(e,': could not find the "').concat(t,'" ').concat(n," edge in the graph."));return i.attributes=r(i.attributes),this.emit("edgeAttributesUpdated",{key:i.key,type:"update",attributes:i.attributes}),this};}}];var et=O,nt=R,rt=function(){var t,e=arguments,n=-1;return new et((function r(){if(!t){if(++n>=e.length)return {done:!0};t=nt(e[n]);}var i=t.next();return i.done?(t=null,r()):i}))},it=[{name:"edges",type:"mixed"},{name:"inEdges",type:"directed",direction:"in"},{name:"outEdges",type:"directed",direction:"out"},{name:"inboundEdges",type:"mixed",direction:"in"},{name:"outboundEdges",type:"mixed",direction:"out"},{name:"directedEdges",type:"directed"},{name:"undirectedEdges",type:"undirected"}];function ot(t,e){for(var n in e)t.push(e[n].key);}function at(t,e){for(var n in e)e[n].forEach((function(e){return t.push(e.key)}));}function ut(t,e,n){for(var r in t)if(r!==n){var i=t[r];e(i.key,i.attributes,i.source.key,i.target.key,i.source.attributes,i.target.attributes,i.undirected);}}function ct(t,e,n){for(var r in t)r!==n&&t[r].forEach((function(t){return e(t.key,t.attributes,t.source.key,t.target.key,t.source.attributes,t.target.attributes,t.undirected)}));}function dt(t,e,n){for(var r in t)if(r!==n){var i=t[r];if(e(i.key,i.attributes,i.source.key,i.target.key,i.source.attributes,i.target.attributes,i.undirected))return i.key}}function st(t,e,n){var r,i,o,a,u;for(var c in t)if(c!==n)for(r=t[c].values();!0!==(i=r.next()).done;)if(a=(o=i.value).source,u=o.target,e(o.key,o.attributes,a.key,u.key,a.attributes,u.attributes,o.undirected))return o.key}function ht(t,e){var n=Object.keys(t),r=n.length,i=null,o=0;return new O((function a(){var u;if(i){var c=i.next();if(c.done)return i=null,o++,a();u=c.value;}else {if(o>=r)return {done:!0};var d=n[o];if(d===e)return o++,a();if((u=t[d])instanceof Set)return i=u.values(),a();o++;}return {done:!1,value:{edge:u.key,attributes:u.attributes,source:u.source.key,target:u.target.key,sourceAttributes:u.source.attributes,targetAttributes:u.target.attributes,undirected:u.undirected}}}))}function ft(t,e,n){var r=e[n];r&&t.push(r.key);}function pt(t,e,n){var r=e[n];r&&r.forEach((function(e){return t.push(e.key)}));}function lt(t,e,n){var r=t[e];if(r){var i=r.source,o=r.target;n(r.key,r.attributes,i.key,o.key,i.attributes,o.attributes,r.undirected);}}function gt(t,e,n){var r=t[e];r&&r.forEach((function(t){return n(t.key,t.attributes,t.source.key,t.target.key,t.source.attributes,t.target.attributes,t.undirected)}));}function yt(t,e,n){var r=t[e];if(r){var i=r.source,o=r.target;return n(r.key,r.attributes,i.key,o.key,i.attributes,o.attributes,r.undirected)?r.key:void 0}}function vt(t,e,n){var r=t[e];if(r)for(var i,o,a=r.values();!0!==(i=a.next()).done;)if(n((o=i.value).key,o.attributes,o.source.key,o.target.key,o.source.attributes,o.target.attributes,o.undirected))return o.key}function bt(t,e){var n=t[e];if(n instanceof Set){var r=n.values();return new O((function(){var t=r.next();if(t.done)return t;var e=t.value;return {done:!1,value:{edge:e.key,attributes:e.attributes,source:e.source.key,target:e.target.key,sourceAttributes:e.source.attributes,targetAttributes:e.target.attributes,undirected:e.undirected}}}))}return O.of([n.key,n.attributes,n.source.key,n.target.key,n.source.attributes,n.target.attributes])}function wt(t,e){if(0===t.size)return [];if("mixed"===e||e===t.type)return "function"==typeof Array.from?Array.from(t._edges.keys()):K(t._edges.keys(),t._edges.size);for(var n,r,i="undirected"===e?t.undirectedSize:t.directedSize,o=new Array(i),a="undirected"===e,u=t._edges.values(),c=0;!0!==(n=u.next()).done;)(r=n.value).undirected===a&&(o[c++]=r.key);return o}function mt(t,e,n){if(0!==t.size)for(var r,i,o="mixed"!==e&&e!==t.type,a="undirected"===e,u=t._edges.values();!0!==(r=u.next()).done;)if(i=r.value,!o||i.undirected===a){var c=i,d=c.key,s=c.attributes,h=c.source,f=c.target;n(d,s,h.key,f.key,h.attributes,f.attributes,i.undirected);}}function _t(t,e,n){if(0!==t.size)for(var r,i,o="mixed"!==e&&e!==t.type,a="undirected"===e,u=t._edges.values();!0!==(r=u.next()).done;)if(i=r.value,!o||i.undirected===a){var c=i,d=c.key,s=c.attributes,h=c.source,f=c.target;if(n(d,s,h.key,f.key,h.attributes,f.attributes,i.undirected))return d}}function kt(t,e){if(0===t.size)return O.empty();var n="mixed"!==e&&e!==t.type,r="undirected"===e,i=t._edges.values();return new O((function(){for(var t,e;;){if((t=i.next()).done)return t;if(e=t.value,!n||e.undirected===r)break}return {value:{edge:e.key,attributes:e.attributes,source:e.source.key,target:e.target.key,sourceAttributes:e.source.attributes,targetAttributes:e.target.attributes,undirected:e.undirected},done:!1}}))}function Gt(t,e,n,r){var i=[],o=t?at:ot;return "undirected"!==e&&("out"!==n&&o(i,r.in),"in"!==n&&o(i,r.out),!n&&r.directedSelfLoops>0&&i.splice(i.lastIndexOf(r.key),1)),"directed"!==e&&o(i,r.undirected),i}function xt(t,e,n,r,i){var o=t?ct:ut;"undirected"!==e&&("out"!==n&&o(r.in,i),"in"!==n&&o(r.out,i,n?null:r.key)),"directed"!==e&&o(r.undirected,i);}function Et(t,e,n,r,i){var o,a=t?st:dt;if("undirected"!==e){if("out"!==n&&(o=a(r.in,i)))return o;if("in"!==n&&(o=a(r.out,i,n?null:r.key)))return o}if("directed"!==e&&(o=a(r.undirected,i)))return o}function St(t,e,n){var r=O.empty();return "undirected"!==t&&("out"!==e&&void 0!==n.in&&(r=rt(r,ht(n.in))),"in"!==e&&void 0!==n.out&&(r=rt(r,ht(n.out,e?null:n.key)))),"directed"!==t&&void 0!==n.undirected&&(r=rt(r,ht(n.undirected))),r}function At(t,e,n,r,i){var o=e?pt:ft,a=[];return "undirected"!==t&&(void 0!==r.in&&"out"!==n&&o(a,r.in,i),void 0!==r.out&&"in"!==n&&o(a,r.out,i),!n&&r.directedSelfLoops>0&&a.splice(a.lastIndexOf(r.key),1)),"directed"!==t&&void 0!==r.undirected&&o(a,r.undirected,i),a}function Lt(t,e,n,r,i,o){var a=e?gt:lt;"undirected"!==t&&(void 0!==r.in&&"out"!==n&&a(r.in,i,o),r.key!==i&&void 0!==r.out&&"in"!==n&&a(r.out,i,o)),"directed"!==t&&void 0!==r.undirected&&a(r.undirected,i,o);}function Dt(t,e,n,r,i,o){var a,u=e?vt:yt;if("undirected"!==t){if(void 0!==r.in&&"out"!==n&&(a=u(r.in,i,o)))return a;if(r.key!==i&&void 0!==r.out&&"in"!==n&&(a=u(r.out,i,o,n?null:r.key)))return a}if("directed"!==t&&void 0!==r.undirected&&(a=u(r.undirected,i,o)))return a}function Nt(t,e,n,r){var i=O.empty();return "undirected"!==t&&(void 0!==n.in&&"out"!==e&&r in n.in&&(i=rt(i,bt(n.in,r))),void 0!==n.out&&"in"!==e&&r in n.out&&(i=rt(i,bt(n.out,r)))),"directed"!==t&&void 0!==n.undirected&&r in n.undirected&&(i=rt(i,bt(n.undirected,r))),i}var Ut=[{name:"neighbors",type:"mixed"},{name:"inNeighbors",type:"directed",direction:"in"},{name:"outNeighbors",type:"directed",direction:"out"},{name:"inboundNeighbors",type:"mixed",direction:"in"},{name:"outboundNeighbors",type:"mixed",direction:"out"},{name:"directedNeighbors",type:"directed"},{name:"undirectedNeighbors",type:"undirected"}];function jt(t,e){if(void 0!==e)for(var n in e)t.add(n);}function Ot(t,e,n){for(var r in e){var i=e[r];i instanceof Set&&(i=i.values().next().value);var o=i.source,a=i.target,u=o===t?a:o;n(u.key,u.attributes);}}function Ct(t,e,n,r){for(var i in n){var o=n[i];o instanceof Set&&(o=o.values().next().value);var a=o.source,u=o.target,c=a===e?u:a;t.has(c.key)||(t.add(c.key),r(c.key,c.attributes));}}function zt(t,e,n){for(var r in e){var i=e[r];i instanceof Set&&(i=i.values().next().value);var o=i.source,a=i.target,u=o===t?a:o;if(n(u.key,u.attributes))return u.key}}function Mt(t,e,n,r){for(var i in n){var o=n[i];o instanceof Set&&(o=o.values().next().value);var a=o.source,u=o.target,c=a===e?u:a;if(!t.has(c.key))if(t.add(c.key),r(c.key,c.attributes))return c.key}}function Pt(t,e){var n=Object.keys(e),r=n.length,i=0;return new O((function(){if(i>=r)return {done:!0};var o=e[n[i++]];o instanceof Set&&(o=o.values().next().value);var a=o.source,u=o.target,c=a===t?u:a;return {done:!1,value:{neighbor:c.key,attributes:c.attributes}}}))}function Tt(t,e,n){var r=Object.keys(n),i=r.length,o=0;return new O((function a(){if(o>=i)return {done:!0};var u=n[r[o++]];u instanceof Set&&(u=u.values().next().value);var c=u.source,d=u.target,s=c===e?d:c;return t.has(s.key)?a():(t.add(s.key),{done:!1,value:{neighbor:s.key,attributes:s.attributes}})}))}function Rt(t,e){var n=e.name,r=e.type,i=e.direction;t.prototype[n]=function(t){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return [];t=""+t;var e=this._nodes.get(t);if(void 0===e)throw new Y("Graph.".concat(n,': could not find the "').concat(t,'" node in the graph.'));return function(t,e,n){if("mixed"!==t){if("undirected"===t)return Object.keys(n.undirected);if("string"==typeof e)return Object.keys(n[e])}var r=new Set;return "undirected"!==t&&("out"!==e&&jt(r,n.in),"in"!==e&&jt(r,n.out)),"directed"!==t&&jt(r,n.undirected),K(r.values(),r.size)}("mixed"===r?this.type:r,i,e)};}function Wt(t,e){var n=e.name,r=e.type,i=e.direction,o="forEach"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[o]=function(t,e){if("mixed"===r||"mixed"===this.type||r===this.type){t=""+t;var n=this._nodes.get(t);if(void 0===n)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));!function(t,e,n,r){if("mixed"!==t){if("undirected"===t)return Ot(n,n.undirected,r);if("string"==typeof e)return Ot(n,n[e],r)}var i=new Set;"undirected"!==t&&("out"!==e&&Ct(i,n,n.in,r),"in"!==e&&Ct(i,n,n.out,r)),"directed"!==t&&Ct(i,n,n.undirected,r);}("mixed"===r?this.type:r,i,n,e);}};var a="map"+n[0].toUpperCase()+n.slice(1);t.prototype[a]=function(t,e){var n=[];return this[o](t,(function(t,r){n.push(e(t,r));})),n};var u="filter"+n[0].toUpperCase()+n.slice(1);t.prototype[u]=function(t,e){var n=[];return this[o](t,(function(t,r){e(t,r)&&n.push(t);})),n};var c="reduce"+n[0].toUpperCase()+n.slice(1);t.prototype[c]=function(t,e,n){if(arguments.length<3)throw new F("Graph.".concat(c,": missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array."));var r=n;return this[o](t,(function(t,n){r=e(r,t,n);})),r};}function Kt(t,e){var n=e.name,r=e.type,i=e.direction,o=n[0].toUpperCase()+n.slice(1,-1),a="find"+o;t.prototype[a]=function(t,e){if("mixed"===r||"mixed"===this.type||r===this.type){t=""+t;var n=this._nodes.get(t);if(void 0===n)throw new Y("Graph.".concat(a,': could not find the "').concat(t,'" node in the graph.'));return function(t,e,n,r){if("mixed"!==t){if("undirected"===t)return zt(n,n.undirected,r);if("string"==typeof e)return zt(n,n[e],r)}var i,o=new Set;if("undirected"!==t){if("out"!==e&&(i=Mt(o,n,n.in,r)))return i;if("in"!==e&&(i=Mt(o,n,n.out,r)))return i}if("directed"!==t&&(i=Mt(o,n,n.undirected,r)))return i}("mixed"===r?this.type:r,i,n,e)}};var u="some"+o;t.prototype[u]=function(t,e){return !!this[a](t,e)};var c="every"+o;t.prototype[c]=function(t,e){return !this[a](t,(function(t,n){return !e(t,n)}))};}function It(t,e){var n=e.name,r=e.type,i=e.direction,o=n.slice(0,-1)+"Entries";t.prototype[o]=function(t){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return O.empty();t=""+t;var e=this._nodes.get(t);if(void 0===e)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));return function(t,e,n){if("mixed"!==t){if("undirected"===t)return Pt(n,n.undirected);if("string"==typeof e)return Pt(n,n[e])}var r=O.empty(),i=new Set;return "undirected"!==t&&("out"!==e&&(r=rt(r,Tt(i,n,n.in))),"in"!==e&&(r=rt(r,Tt(i,n,n.out)))),"directed"!==t&&(r=rt(r,Tt(i,n,n.undirected))),r}("mixed"===r?this.type:r,i,e)};}function Ft(t,e,n,r,i){for(var o,a,u,c,d,s,h,f=r._nodes.values(),p=r.type;!0!==(o=f.next()).done;){var l=!1;if(a=o.value,"undirected"!==p)for(u in c=a.out)if(s=(d=c[u]).target,l=!0,h=i(a.key,s.key,a.attributes,s.attributes,d.key,d.attributes,d.undirected),t&&h)return d;if("directed"!==p)for(u in c=a.undirected)if(!(e&&a.key>u)&&((s=(d=c[u]).target).key!==u&&(s=d.source),l=!0,h=i(a.key,s.key,a.attributes,s.attributes,d.key,d.attributes,d.undirected),t&&h))return d;if(n&&!l&&(h=i(a.key,null,a.attributes,null,null,null,null),t&&h))return null}}function Yt(t,e,n,r,i){for(var o,a,u,c,d,s,h,f,p,l=r._nodes.values(),g=r.type;!0!==(o=l.next()).done;){var y=!1;if(a=o.value,"undirected"!==g)for(u in s=a.out)for(c=s[u].values();!0!==(d=c.next()).done;)if(f=(h=d.value).target,y=!0,p=i(a.key,f.key,a.attributes,f.attributes,h.key,h.attributes,h.undirected),t&&p)return h;if("directed"!==g)for(u in s=a.undirected)if(!(e&&a.key>u))for(c=s[u].values();!0!==(d=c.next()).done;)if((f=(h=d.value).target).key!==u&&(f=h.source),y=!0,p=i(a.key,f.key,a.attributes,f.attributes,h.key,h.attributes,h.undirected),t&&p)return h;if(n&&!y&&(p=i(a.key,null,a.attributes,null,null,null,null),t&&p))return null}}function Bt(t,e){var n={key:t};return f(e.attributes)||(n.attributes=c({},e.attributes)),n}function qt(t,e){var n={key:t,source:e.source.key,target:e.target.key};return f(e.attributes)||(n.attributes=c({},e.attributes)),e.undirected&&(n.undirected=!0),n}function Jt(t){return h(t)?"key"in t?!("attributes"in t)||h(t.attributes)&&null!==t.attributes?null:"invalid-attributes":"no-key":"not-object"}function Vt(t){return h(t)?"source"in t?"target"in t?!("attributes"in t)||h(t.attributes)&&null!==t.attributes?"undirected"in t&&"boolean"!=typeof t.undirected?"invalid-undirected":null:"invalid-attributes":"no-target":"no-source":"not-object"}var Ht,Qt=(Ht=255&Math.floor(256*Math.random()),function(){return Ht++}),Xt=new Set(["directed","undirected","mixed"]),Zt=new Set(["domain","_events","_eventsCount","_maxListeners"]),$t={allowSelfLoops:!0,multi:!1,type:"mixed"};function te(t,e,n){var r=new t.NodeDataClass(e,n);return t._nodes.set(e,r),t.emit("nodeAdded",{key:e,attributes:n}),r}function ee(t,e,n,r,i,o,a,u){if(!r&&"undirected"===t.type)throw new B("Graph.".concat(e,": you cannot add a directed edge to an undirected graph. Use the #.addEdge or #.addUndirectedEdge instead."));if(r&&"directed"===t.type)throw new B("Graph.".concat(e,": you cannot add an undirected edge to a directed graph. Use the #.addEdge or #.addDirectedEdge instead."));if(u&&!h(u))throw new F("Graph.".concat(e,': invalid attributes. Expecting an object but got "').concat(u,'"'));if(o=""+o,a=""+a,u=u||{},!t.allowSelfLoops&&o===a)throw new B("Graph.".concat(e,': source & target are the same ("').concat(o,"\"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false."));var c=t._nodes.get(o),d=t._nodes.get(a);if(!c)throw new Y("Graph.".concat(e,': source node "').concat(o,'" not found.'));if(!d)throw new Y("Graph.".concat(e,': target node "').concat(a,'" not found.'));var s={key:null,undirected:r,source:o,target:a,attributes:u};if(n)i=t._edgeKeyGenerator();else if(i=""+i,t._edges.has(i))throw new B("Graph.".concat(e,': the "').concat(i,'" edge already exists in the graph.'));if(!t.multi&&(r?void 0!==c.undirected[a]:void 0!==c.out[a]))throw new B("Graph.".concat(e,': an edge linking "').concat(o,'" to "').concat(a,"\" already exists. If you really want to add multiple edges linking those nodes, you should create a multi graph by using the 'multi' option."));var f=new H(r,i,c,d,u);return t._edges.set(i,f),o===a?r?(c.undirectedSelfLoops++,t._undirectedSelfLoopCount++):(c.directedSelfLoops++,t._directedSelfLoopCount++):r?(c.undirectedDegree++,d.undirectedDegree++):(c.outDegree++,d.inDegree++),Q(t,r,f,o,a,c,d),r?t._undirectedSize++:t._directedSize++,s.key=i,t.emit("edgeAdded",s),i}function ne(t,e,n,r,i,o,a,u,d){if(!r&&"undirected"===t.type)throw new B("Graph.".concat(e,": you cannot merge/update a directed edge to an undirected graph. Use the #.mergeEdge/#.updateEdge or #.addUndirectedEdge instead."));if(r&&"directed"===t.type)throw new B("Graph.".concat(e,": you cannot merge/update an undirected edge to a directed graph. Use the #.mergeEdge/#.updateEdge or #.addDirectedEdge instead."));if(u)if(d){if("function"!=typeof u)throw new F("Graph.".concat(e,': invalid updater function. Expecting a function but got "').concat(u,'"'))}else if(!h(u))throw new F("Graph.".concat(e,': invalid attributes. Expecting an object but got "').concat(u,'"'));var s;if(o=""+o,a=""+a,d&&(s=u,u=void 0),!t.allowSelfLoops&&o===a)throw new B("Graph.".concat(e,': source & target are the same ("').concat(o,"\"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false."));var f,p,l=t._nodes.get(o),g=t._nodes.get(a);if(!n&&(f=t._edges.get(i))){if(f.source.key!==o||f.target.key!==a||r&&(f.source.key!==a||f.target.key!==o))throw new B("Graph.".concat(e,': inconsistency detected when attempting to merge the "').concat(i,'" edge with "').concat(o,'" source & "').concat(a,'" target vs. ("').concat(f.source.key,'", "').concat(f.target.key,'").'));p=f;}if(p||t.multi||!l||(p=r?l.undirected[a]:l.out[a]),p){var y=[p.key,!1,!1,!1];if(d?!s:!u)return y;if(d){var v=p.attributes;p.attributes=s(v),t.emit("edgeAttributesUpdated",{type:"replace",key:p.key,attributes:p.attributes});}else c(p.attributes,u),t.emit("edgeAttributesUpdated",{type:"merge",key:p.key,attributes:p.attributes,data:u});return y}u=u||{},d&&s&&(u=s(u));var b={key:null,undirected:r,source:o,target:a,attributes:u};if(n)i=t._edgeKeyGenerator();else if(i=""+i,t._edges.has(i))throw new B("Graph.".concat(e,': the "').concat(i,'" edge already exists in the graph.'));var w=!1,m=!1;return l||(l=te(t,o,{}),w=!0,o===a&&(g=l,m=!0)),g||(g=te(t,a,{}),m=!0),f=new H(r,i,l,g,u),t._edges.set(i,f),o===a?r?(l.undirectedSelfLoops++,t._undirectedSelfLoopCount++):(l.directedSelfLoops++,t._directedSelfLoopCount++):r?(l.undirectedDegree++,g.undirectedDegree++):(l.outDegree++,g.inDegree++),Q(t,r,f,o,a,l,g),r?t._undirectedSize++:t._directedSize++,b.key=i,t.emit("edgeAdded",b),[i,!0,w,m]}var re=function(n){function r(t){var e;if(e=n.call(this)||this,"boolean"!=typeof(t=c({},$t,t)).multi)throw new F("Graph.constructor: invalid 'multi' option. Expecting a boolean but got \"".concat(t.multi,'".'));if(!Xt.has(t.type))throw new F('Graph.constructor: invalid \'type\' option. Should be one of "mixed", "directed" or "undirected" but got "'.concat(t.type,'".'));if("boolean"!=typeof t.allowSelfLoops)throw new F("Graph.constructor: invalid 'allowSelfLoops' option. Expecting a boolean but got \"".concat(t.allowSelfLoops,'".'));var r="mixed"===t.type?q:"directed"===t.type?J:V;p(u(e),"NodeDataClass",r);var i=Qt(),o=0;return p(u(e),"_attributes",{}),p(u(e),"_nodes",new Map),p(u(e),"_edges",new Map),p(u(e),"_directedSize",0),p(u(e),"_undirectedSize",0),p(u(e),"_directedSelfLoopCount",0),p(u(e),"_undirectedSelfLoopCount",0),p(u(e),"_edgeKeyGenerator",(function(){var t;do{t="geid_"+i+"_"+o++;}while(e._edges.has(t));return t})),p(u(e),"_options",t),Zt.forEach((function(t){return p(u(e),t,e[t])})),l(u(e),"order",(function(){return e._nodes.size})),l(u(e),"size",(function(){return e._edges.size})),l(u(e),"directedSize",(function(){return e._directedSize})),l(u(e),"undirectedSize",(function(){return e._undirectedSize})),l(u(e),"selfLoopCount",(function(){return e._directedSelfLoopCount+e._undirectedSelfLoopCount})),l(u(e),"directedSelfLoopCount",(function(){return e._directedSelfLoopCount})),l(u(e),"undirectedSelfLoopCount",(function(){return e._undirectedSelfLoopCount})),l(u(e),"multi",e._options.multi),l(u(e),"type",e._options.type),l(u(e),"allowSelfLoops",e._options.allowSelfLoops),l(u(e),"implementation",(function(){return "graphology"})),e}e(r,n);var i=r.prototype;return i._resetInstanceCounters=function(){this._directedSize=0,this._undirectedSize=0,this._directedSelfLoopCount=0,this._undirectedSelfLoopCount=0;},i.hasNode=function(t){return this._nodes.has(""+t)},i.hasDirectedEdge=function(t,e){if("undirected"===this.type)return !1;if(1===arguments.length){var n=""+t,r=this._edges.get(n);return !!r&&!r.undirected}if(2===arguments.length){t=""+t,e=""+e;var i=this._nodes.get(t);if(!i)return !1;var o=i.out[e];return !!o&&(!this.multi||!!o.size)}throw new F("Graph.hasDirectedEdge: invalid arity (".concat(arguments.length,", instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target."))},i.hasUndirectedEdge=function(t,e){if("directed"===this.type)return !1;if(1===arguments.length){var n=""+t,r=this._edges.get(n);return !!r&&r.undirected}if(2===arguments.length){t=""+t,e=""+e;var i=this._nodes.get(t);if(!i)return !1;var o=i.undirected[e];return !!o&&(!this.multi||!!o.size)}throw new F("Graph.hasDirectedEdge: invalid arity (".concat(arguments.length,", instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target."))},i.hasEdge=function(t,e){if(1===arguments.length){var n=""+t;return this._edges.has(n)}if(2===arguments.length){t=""+t,e=""+e;var r=this._nodes.get(t);if(!r)return !1;var i=void 0!==r.out&&r.out[e];return i||(i=void 0!==r.undirected&&r.undirected[e]),!!i&&(!this.multi||!!i.size)}throw new F("Graph.hasEdge: invalid arity (".concat(arguments.length,", instead of 1 or 2). You can either ask for an edge id or for the existence of an edge between a source & a target."))},i.directedEdge=function(t,e){if("undirected"!==this.type){if(t=""+t,e=""+e,this.multi)throw new B("Graph.directedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.directedEdges instead.");var n=this._nodes.get(t);if(!n)throw new Y('Graph.directedEdge: could not find the "'.concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y('Graph.directedEdge: could not find the "'.concat(e,'" target node in the graph.'));var r=n.out&&n.out[e]||void 0;return r?r.key:void 0}},i.undirectedEdge=function(t,e){if("directed"!==this.type){if(t=""+t,e=""+e,this.multi)throw new B("Graph.undirectedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.undirectedEdges instead.");var n=this._nodes.get(t);if(!n)throw new Y('Graph.undirectedEdge: could not find the "'.concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y('Graph.undirectedEdge: could not find the "'.concat(e,'" target node in the graph.'));var r=n.undirected&&n.undirected[e]||void 0;return r?r.key:void 0}},i.edge=function(t,e){if(this.multi)throw new B("Graph.edge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.edges instead.");t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.edge: could not find the "'.concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y('Graph.edge: could not find the "'.concat(e,'" target node in the graph.'));var r=n.out&&n.out[e]||n.undirected&&n.undirected[e]||void 0;if(r)return r.key},i.areDirectedNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areDirectedNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&(e in n.in||e in n.out)},i.areOutNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areOutNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&e in n.out},i.areInNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areInNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&e in n.in},i.areUndirectedNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areUndirectedNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "directed"!==this.type&&e in n.undirected},i.areNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&(e in n.in||e in n.out)||"directed"!==this.type&&e in n.undirected},i.areInboundNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areInboundNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&e in n.in||"directed"!==this.type&&e in n.undirected},i.areOutboundNeighbors=function(t,e){t=""+t,e=""+e;var n=this._nodes.get(t);if(!n)throw new Y('Graph.areOutboundNeighbors: could not find the "'.concat(t,'" node in the graph.'));return "undirected"!==this.type&&e in n.out||"directed"!==this.type&&e in n.undirected},i.inDegree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.inDegree: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.inDegree+e.directedSelfLoops},i.outDegree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.outDegree: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.outDegree+e.directedSelfLoops},i.directedDegree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.directedDegree: could not find the "'.concat(t,'" node in the graph.'));if("undirected"===this.type)return 0;var n=e.directedSelfLoops;return e.inDegree+n+(e.outDegree+n)},i.undirectedDegree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.undirectedDegree: could not find the "'.concat(t,'" node in the graph.'));if("directed"===this.type)return 0;var n=e.undirectedSelfLoops;return e.undirectedDegree+2*n},i.degree=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.degree: could not find the "'.concat(t,'" node in the graph.'));var n=0;return "directed"!==this.type&&(n+=e.undirectedDegree+2*e.undirectedSelfLoops),"undirected"!==this.type&&(n+=e.inDegree+e.outDegree+2*e.directedSelfLoops),n},i.inDegreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.inDegreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.inDegree},i.outDegreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.outDegreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.outDegree},i.directedDegreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.directedDegreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));return "undirected"===this.type?0:e.inDegree+e.outDegree},i.undirectedDegreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.undirectedDegreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));return "directed"===this.type?0:e.undirectedDegree},i.degreeWithoutSelfLoops=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.degreeWithoutSelfLoops: could not find the "'.concat(t,'" node in the graph.'));var n=0;return "directed"!==this.type&&(n+=e.undirectedDegree),"undirected"!==this.type&&(n+=e.inDegree+e.outDegree),n},i.source=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.source: could not find the "'.concat(t,'" edge in the graph.'));return e.source.key},i.target=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.target: could not find the "'.concat(t,'" edge in the graph.'));return e.target.key},i.extremities=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.extremities: could not find the "'.concat(t,'" edge in the graph.'));return [e.source.key,e.target.key]},i.opposite=function(t,e){t=""+t,e=""+e;var n=this._edges.get(e);if(!n)throw new Y('Graph.opposite: could not find the "'.concat(e,'" edge in the graph.'));var r=n.source.key,i=n.target.key;if(t===r)return i;if(t===i)return r;throw new Y('Graph.opposite: the "'.concat(t,'" node is not attached to the "').concat(e,'" edge (').concat(r,", ").concat(i,")."))},i.hasExtremity=function(t,e){t=""+t,e=""+e;var n=this._edges.get(t);if(!n)throw new Y('Graph.hasExtremity: could not find the "'.concat(t,'" edge in the graph.'));return n.source.key===e||n.target.key===e},i.isUndirected=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.isUndirected: could not find the "'.concat(t,'" edge in the graph.'));return e.undirected},i.isDirected=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.isDirected: could not find the "'.concat(t,'" edge in the graph.'));return !e.undirected},i.isSelfLoop=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.isSelfLoop: could not find the "'.concat(t,'" edge in the graph.'));return e.source===e.target},i.addNode=function(t,e){var n=function(t,e,n){if(n&&!h(n))throw new F('Graph.addNode: invalid attributes. Expecting an object but got "'.concat(n,'"'));if(e=""+e,n=n||{},t._nodes.has(e))throw new B('Graph.addNode: the "'.concat(e,'" node already exist in the graph.'));var r=new t.NodeDataClass(e,n);return t._nodes.set(e,r),t.emit("nodeAdded",{key:e,attributes:n}),r}(this,t,e);return n.key},i.mergeNode=function(t,e){if(e&&!h(e))throw new F('Graph.mergeNode: invalid attributes. Expecting an object but got "'.concat(e,'"'));t=""+t,e=e||{};var n=this._nodes.get(t);return n?(e&&(c(n.attributes,e),this.emit("nodeAttributesUpdated",{type:"merge",key:t,attributes:n.attributes,data:e})),[t,!1]):(n=new this.NodeDataClass(t,e),this._nodes.set(t,n),this.emit("nodeAdded",{key:t,attributes:e}),[t,!0])},i.updateNode=function(t,e){if(e&&"function"!=typeof e)throw new F('Graph.updateNode: invalid updater function. Expecting a function but got "'.concat(e,'"'));t=""+t;var n=this._nodes.get(t);if(n){if(e){var r=n.attributes;n.attributes=e(r),this.emit("nodeAttributesUpdated",{type:"replace",key:t,attributes:n.attributes});}return [t,!1]}var i=e?e({}):{};return n=new this.NodeDataClass(t,i),this._nodes.set(t,n),this.emit("nodeAdded",{key:t,attributes:i}),[t,!0]},i.dropNode=function(t){var e=this;t=""+t;var n=this._nodes.get(t);if(!n)throw new Y('Graph.dropNode: could not find the "'.concat(t,'" node in the graph.'));this.forEachEdge(t,(function(t){e.dropEdge(t);})),this._nodes.delete(t),this.emit("nodeDropped",{key:t,attributes:n.attributes});},i.dropEdge=function(t){var e;if(arguments.length>1){var n=""+arguments[0],r=""+arguments[1];if(!(e=d(this,n,r,this.type)))throw new Y('Graph.dropEdge: could not find the "'.concat(n,'" -> "').concat(r,'" edge in the graph.'))}else if(t=""+t,!(e=this._edges.get(t)))throw new Y('Graph.dropEdge: could not find the "'.concat(t,'" edge in the graph.'));this._edges.delete(e.key);var i=e,o=i.source,a=i.target,u=i.attributes,c=e.undirected;return o===a?c?(o.undirectedSelfLoops--,this._undirectedSelfLoopCount--):(o.directedSelfLoops--,this._directedSelfLoopCount--):c?(o.undirectedDegree--,a.undirectedDegree--):(o.outDegree--,a.inDegree--),X(this,c,e),c?this._undirectedSize--:this._directedSize--,this.emit("edgeDropped",{key:t,attributes:u,source:o.key,target:a.key,undirected:c}),this},i.clear=function(){this._edges.clear(),this._nodes.clear(),this._resetInstanceCounters(),this.emit("cleared");},i.clearEdges=function(){!function(t){for(var e,n=t._nodes.values();!0!==(e=n.next()).done;)e.value.clear();}(this),this._edges.clear(),this._resetInstanceCounters(),this.emit("edgesCleared");},i.getAttribute=function(t){return this._attributes[t]},i.getAttributes=function(){return this._attributes},i.hasAttribute=function(t){return this._attributes.hasOwnProperty(t)},i.setAttribute=function(t,e){return this._attributes[t]=e,this.emit("attributesUpdated",{type:"set",attributes:this._attributes,name:t}),this},i.updateAttribute=function(t,e){if("function"!=typeof e)throw new F("Graph.updateAttribute: updater should be a function.");var n=this._attributes[t];return this._attributes[t]=e(n),this.emit("attributesUpdated",{type:"set",attributes:this._attributes,name:t}),this},i.removeAttribute=function(t){return delete this._attributes[t],this.emit("attributesUpdated",{type:"remove",attributes:this._attributes,name:t}),this},i.replaceAttributes=function(t){if(!h(t))throw new F("Graph.replaceAttributes: provided attributes are not a plain object.");return this._attributes=t,this.emit("attributesUpdated",{type:"replace",attributes:this._attributes}),this},i.mergeAttributes=function(t){if(!h(t))throw new F("Graph.mergeAttributes: provided attributes are not a plain object.");return c(this._attributes,t),this.emit("attributesUpdated",{type:"merge",attributes:this._attributes,data:t}),this},i.updateAttributes=function(t){if("function"!=typeof t)throw new F("Graph.updateAttributes: provided updater is not a function.");return this._attributes=t(this._attributes),this.emit("attributesUpdated",{type:"update",attributes:this._attributes}),this},i.updateEachNodeAttributes=function(t,e){if("function"!=typeof t)throw new F("Graph.updateEachNodeAttributes: expecting an updater function.");if(e&&!g(e))throw new F("Graph.updateEachNodeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}");for(var n,r,i=this._nodes.values();!0!==(n=i.next()).done;)(r=n.value).attributes=t(r.key,r.attributes);this.emit("eachNodeAttributesUpdated",{hints:e||null});},i.updateEachEdgeAttributes=function(t,e){if("function"!=typeof t)throw new F("Graph.updateEachEdgeAttributes: expecting an updater function.");if(e&&!g(e))throw new F("Graph.updateEachEdgeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}");for(var n,r,i,o,a=this._edges.values();!0!==(n=a.next()).done;)i=(r=n.value).source,o=r.target,r.attributes=t(r.key,r.attributes,i.key,o.key,i.attributes,o.attributes,r.undirected);this.emit("eachEdgeAttributesUpdated",{hints:e||null});},i.forEachAdjacencyEntry=function(t){if("function"!=typeof t)throw new F("Graph.forEachAdjacencyEntry: expecting a callback.");this.multi?Yt(!1,!1,!1,this,t):Ft(!1,!1,!1,this,t);},i.forEachAdjacencyEntryWithOrphans=function(t){if("function"!=typeof t)throw new F("Graph.forEachAdjacencyEntryWithOrphans: expecting a callback.");this.multi?Yt(!1,!1,!0,this,t):Ft(!1,!1,!0,this,t);},i.forEachAssymetricAdjacencyEntry=function(t){if("function"!=typeof t)throw new F("Graph.forEachAssymetricAdjacencyEntry: expecting a callback.");this.multi?Yt(!1,!0,!1,this,t):Ft(!1,!0,!1,this,t);},i.forEachAssymetricAdjacencyEntryWithOrphans=function(t){if("function"!=typeof t)throw new F("Graph.forEachAssymetricAdjacencyEntryWithOrphans: expecting a callback.");this.multi?Yt(!1,!0,!0,this,t):Ft(!1,!0,!0,this,t);},i.nodes=function(){return "function"==typeof Array.from?Array.from(this._nodes.keys()):K(this._nodes.keys(),this._nodes.size)},i.forEachNode=function(t){if("function"!=typeof t)throw new F("Graph.forEachNode: expecting a callback.");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)t((n=e.value).key,n.attributes);},i.findNode=function(t){if("function"!=typeof t)throw new F("Graph.findNode: expecting a callback.");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)if(t((n=e.value).key,n.attributes))return n.key},i.mapNodes=function(t){if("function"!=typeof t)throw new F("Graph.mapNode: expecting a callback.");for(var e,n,r=this._nodes.values(),i=new Array(this.order),o=0;!0!==(e=r.next()).done;)n=e.value,i[o++]=t(n.key,n.attributes);return i},i.someNode=function(t){if("function"!=typeof t)throw new F("Graph.someNode: expecting a callback.");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)if(t((n=e.value).key,n.attributes))return !0;return !1},i.everyNode=function(t){if("function"!=typeof t)throw new F("Graph.everyNode: expecting a callback.");for(var e,n,r=this._nodes.values();!0!==(e=r.next()).done;)if(!t((n=e.value).key,n.attributes))return !1;return !0},i.filterNodes=function(t){if("function"!=typeof t)throw new F("Graph.filterNodes: expecting a callback.");for(var e,n,r=this._nodes.values(),i=[];!0!==(e=r.next()).done;)t((n=e.value).key,n.attributes)&&i.push(n.key);return i},i.reduceNodes=function(t,e){if("function"!=typeof t)throw new F("Graph.reduceNodes: expecting a callback.");if(arguments.length<2)throw new F("Graph.reduceNodes: missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array.");for(var n,r,i=e,o=this._nodes.values();!0!==(n=o.next()).done;)i=t(i,(r=n.value).key,r.attributes);return i},i.nodeEntries=function(){var t=this._nodes.values();return new O((function(){var e=t.next();if(e.done)return e;var n=e.value;return {value:{node:n.key,attributes:n.attributes},done:!1}}))},i.exportNode=function(t){t=""+t;var e=this._nodes.get(t);if(!e)throw new Y('Graph.exportNode: could not find the "'.concat(t,'" node in the graph.'));return Bt(t,e)},i.exportEdge=function(t){t=""+t;var e=this._edges.get(t);if(!e)throw new Y('Graph.exportEdge: could not find the "'.concat(t,'" edge in the graph.'));return qt(t,e)},i.export=function(){var t=new Array(this._nodes.size),e=0;this._nodes.forEach((function(n,r){t[e++]=Bt(r,n);}));var n=new Array(this._edges.size);return e=0,this._edges.forEach((function(t,r){n[e++]=qt(r,t);})),{attributes:this.getAttributes(),nodes:t,edges:n,options:{type:this.type,multi:this.multi,allowSelfLoops:this.allowSelfLoops}}},i.importNode=function(t){var e=arguments.length>1&&void 0!==arguments[1]&&arguments[1],n=Jt(t);if(n){if("not-object"===n)throw new F('Graph.importNode: invalid serialized node. A serialized node should be a plain object with at least a "key" property.');if("no-key"===n)throw new F("Graph.importNode: no key provided.");if("invalid-attributes"===n)throw new F("Graph.importNode: invalid attributes. Attributes should be a plain object, null or omitted.")}var r=t.key,i=t.attributes,o=void 0===i?{}:i;return e?this.mergeNode(r,o):this.addNode(r,o),this},i.importEdge=function(t){var e=arguments.length>1&&void 0!==arguments[1]&&arguments[1],n=Vt(t);if(n){if("not-object"===n)throw new F('Graph.importEdge: invalid serialized edge. A serialized edge should be a plain object with at least a "source" & "target" property.');if("no-source"===n)throw new F("Graph.importEdge: missing souce.");if("no-target"===n)throw new F("Graph.importEdge: missing target.");if("invalid-attributes"===n)throw new F("Graph.importEdge: invalid attributes. Attributes should be a plain object, null or omitted.");if("invalid-undirected"===n)throw new F("Graph.importEdge: invalid undirected. Undirected should be boolean or omitted.")}var r=t.source,i=t.target,o=t.attributes,a=void 0===o?{}:o,u=t.undirected,c=void 0!==u&&u;return "key"in t?(e?c?this.mergeUndirectedEdgeWithKey:this.mergeDirectedEdgeWithKey:c?this.addUndirectedEdgeWithKey:this.addDirectedEdgeWithKey).call(this,t.key,r,i,a):(e?c?this.mergeUndirectedEdge:this.mergeDirectedEdge:c?this.addUndirectedEdge:this.addDirectedEdge).call(this,r,i,a),this},i.import=function(t){var e,n,r,i=arguments.length>1&&void 0!==arguments[1]&&arguments[1];if(s(t))return this.import(t.export(),i),this;if(!h(t))throw new F("Graph.import: invalid argument. Expecting a serialized graph or, alternatively, a Graph instance.");if(t.attributes){if(!h(t.attributes))throw new F("Graph.import: invalid attributes. Expecting a plain object.");i?this.mergeAttributes(t.attributes):this.replaceAttributes(t.attributes);}if(t.nodes){if(r=t.nodes,!Array.isArray(r))throw new F("Graph.import: invalid nodes. Expecting an array.");for(e=0,n=r.length;e<n;e++)this.importNode(r[e],i);}if(t.edges){if(r=t.edges,!Array.isArray(r))throw new F("Graph.import: invalid edges. Expecting an array.");for(e=0,n=r.length;e<n;e++)this.importEdge(r[e],i);}return this},i.nullCopy=function(t){var e=new r(c({},this._options,t));return e.replaceAttributes(c({},this.getAttributes())),e},i.emptyCopy=function(t){var e=this.nullCopy(t);return this._nodes.forEach((function(t,n){var r=c({},t.attributes);t=new e.NodeDataClass(n,r),e._nodes.set(n,t);})),e},i.copy=function(){for(var t,e,n=this.emptyCopy(),r=this._edges.values();!0!==(t=r.next()).done;)ee(n,"copy",!1,(e=t.value).undirected,e.key,e.source.key,e.target.key,c({},e.attributes));return n},i.upgradeToMixed=function(){return "mixed"===this.type||(this._nodes.forEach((function(t){return t.upgradeToMixed()})),this._options.type="mixed",l(this,"type",this._options.type),p(this,"NodeDataClass",q)),this},i.upgradeToMulti=function(){return this.multi||(this._options.multi=!0,l(this,"multi",!0),(t=this)._nodes.forEach((function(e,n){if(e.out)for(var r in e.out){var i=new Set;i.add(e.out[r]),e.out[r]=i,t._nodes.get(r).in[n]=i;}if(e.undirected)for(var o in e.undirected)if(!(o>n)){var a=new Set;a.add(e.undirected[o]),e.undirected[o]=a,t._nodes.get(o).undirected[n]=a;}}))),this;var t;},i.toJSON=function(){return this.export()},i.toString=function(){return "[object Graph]"},i.inspect=function(){var e=this,n={};this._nodes.forEach((function(t,e){n[e]=t.attributes;}));var r={},i={};this._edges.forEach((function(t,n){var o,a=t.undirected?"--":"->",u="",c=t.source.key,d=t.target.key;t.undirected&&c>d&&(o=c,c=d,d=o);var s="(".concat(c,")").concat(a,"(").concat(d,")");n.startsWith("geid_")?e.multi&&(void 0===i[s]?i[s]=0:i[s]++,u+="".concat(i[s],". ")):u+="[".concat(n,"]: "),r[u+=s]=t.attributes;}));var o={};for(var a in this)this.hasOwnProperty(a)&&!Zt.has(a)&&"function"!=typeof this[a]&&"symbol"!==t(a)&&(o[a]=this[a]);return o.attributes=this._attributes,o.nodes=n,o.edges=r,p(o,"constructor",this.constructor),o},r}(v.exports.EventEmitter);"undefined"!=typeof Symbol&&(re.prototype[Symbol.for("nodejs.util.inspect.custom")]=re.prototype.inspect),[{name:function(t){return "".concat(t,"Edge")},generateKey:!0},{name:function(t){return "".concat(t,"DirectedEdge")},generateKey:!0,type:"directed"},{name:function(t){return "".concat(t,"UndirectedEdge")},generateKey:!0,type:"undirected"},{name:function(t){return "".concat(t,"EdgeWithKey")}},{name:function(t){return "".concat(t,"DirectedEdgeWithKey")},type:"directed"},{name:function(t){return "".concat(t,"UndirectedEdgeWithKey")},type:"undirected"}].forEach((function(t){["add","merge","update"].forEach((function(e){var n=t.name(e),r="add"===e?ee:ne;t.generateKey?re.prototype[n]=function(i,o,a){return r(this,n,!0,"undirected"===(t.type||this.type),null,i,o,a,"update"===e)}:re.prototype[n]=function(i,o,a,u){return r(this,n,!1,"undirected"===(t.type||this.type),i,o,a,u,"update"===e)};}));})),function(t){$.forEach((function(e){var n=e.name,r=e.attacher;r(t,n("Node"),0),r(t,n("Source"),1),r(t,n("Target"),2),r(t,n("Opposite"),3);}));}(re),function(t){tt.forEach((function(e){var n=e.name,r=e.attacher;r(t,n("Edge"),"mixed"),r(t,n("DirectedEdge"),"directed"),r(t,n("UndirectedEdge"),"undirected");}));}(re),function(t){it.forEach((function(e){!function(t,e){var n=e.name,r=e.type,i=e.direction;t.prototype[n]=function(t,e){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return [];if(!arguments.length)return wt(this,r);if(1===arguments.length){t=""+t;var o=this._nodes.get(t);if(void 0===o)throw new Y("Graph.".concat(n,': could not find the "').concat(t,'" node in the graph.'));return Gt(this.multi,"mixed"===r?this.type:r,i,o)}if(2===arguments.length){t=""+t,e=""+e;var a=this._nodes.get(t);if(!a)throw new Y("Graph.".concat(n,':  could not find the "').concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y("Graph.".concat(n,':  could not find the "').concat(e,'" target node in the graph.'));return At(r,this.multi,i,a,e)}throw new F("Graph.".concat(n,": too many arguments (expecting 0, 1 or 2 and got ").concat(arguments.length,")."))};}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o="forEach"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[o]=function(t,e,n){if("mixed"===r||"mixed"===this.type||r===this.type){if(1===arguments.length)return mt(this,r,n=t);if(2===arguments.length){t=""+t,n=e;var a=this._nodes.get(t);if(void 0===a)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));return xt(this.multi,"mixed"===r?this.type:r,i,a,n)}if(3===arguments.length){t=""+t,e=""+e;var u=this._nodes.get(t);if(!u)throw new Y("Graph.".concat(o,':  could not find the "').concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y("Graph.".concat(o,':  could not find the "').concat(e,'" target node in the graph.'));return Lt(r,this.multi,i,u,e,n)}throw new F("Graph.".concat(o,": too many arguments (expecting 1, 2 or 3 and got ").concat(arguments.length,")."))}};var a="map"+n[0].toUpperCase()+n.slice(1);t.prototype[a]=function(){var t,e=Array.prototype.slice.call(arguments),n=e.pop();if(0===e.length){var i=0;"directed"!==r&&(i+=this.undirectedSize),"undirected"!==r&&(i+=this.directedSize),t=new Array(i);var a=0;e.push((function(e,r,i,o,u,c,d){t[a++]=n(e,r,i,o,u,c,d);}));}else t=[],e.push((function(e,r,i,o,a,u,c){t.push(n(e,r,i,o,a,u,c));}));return this[o].apply(this,e),t};var u="filter"+n[0].toUpperCase()+n.slice(1);t.prototype[u]=function(){var t=Array.prototype.slice.call(arguments),e=t.pop(),n=[];return t.push((function(t,r,i,o,a,u,c){e(t,r,i,o,a,u,c)&&n.push(t);})),this[o].apply(this,t),n};var c="reduce"+n[0].toUpperCase()+n.slice(1);t.prototype[c]=function(){var t,e,n=Array.prototype.slice.call(arguments);if(n.length<2||n.length>4)throw new F("Graph.".concat(c,": invalid number of arguments (expecting 2, 3 or 4 and got ").concat(n.length,")."));if("function"==typeof n[n.length-1]&&"function"!=typeof n[n.length-2])throw new F("Graph.".concat(c,": missing initial value. You must provide it because the callback takes more than one argument and we cannot infer the initial value from the first iteration, as you could with a simple array."));2===n.length?(t=n[0],e=n[1],n=[]):3===n.length?(t=n[1],e=n[2],n=[n[0]]):4===n.length&&(t=n[2],e=n[3],n=[n[0],n[1]]);var r=e;return n.push((function(e,n,i,o,a,u,c){r=t(r,e,n,i,o,a,u,c);})),this[o].apply(this,n),r};}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o="find"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[o]=function(t,e,n){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return !1;if(1===arguments.length)return _t(this,r,n=t);if(2===arguments.length){t=""+t,n=e;var a=this._nodes.get(t);if(void 0===a)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));return Et(this.multi,"mixed"===r?this.type:r,i,a,n)}if(3===arguments.length){t=""+t,e=""+e;var u=this._nodes.get(t);if(!u)throw new Y("Graph.".concat(o,':  could not find the "').concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y("Graph.".concat(o,':  could not find the "').concat(e,'" target node in the graph.'));return Dt(r,this.multi,i,u,e,n)}throw new F("Graph.".concat(o,": too many arguments (expecting 1, 2 or 3 and got ").concat(arguments.length,")."))};var a="some"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[a]=function(){var t=Array.prototype.slice.call(arguments),e=t.pop();return t.push((function(t,n,r,i,o,a,u){return e(t,n,r,i,o,a,u)})),!!this[o].apply(this,t)};var u="every"+n[0].toUpperCase()+n.slice(1,-1);t.prototype[u]=function(){var t=Array.prototype.slice.call(arguments),e=t.pop();return t.push((function(t,n,r,i,o,a,u){return !e(t,n,r,i,o,a,u)})),!this[o].apply(this,t)};}(t,e),function(t,e){var n=e.name,r=e.type,i=e.direction,o=n.slice(0,-1)+"Entries";t.prototype[o]=function(t,e){if("mixed"!==r&&"mixed"!==this.type&&r!==this.type)return O.empty();if(!arguments.length)return kt(this,r);if(1===arguments.length){t=""+t;var n=this._nodes.get(t);if(!n)throw new Y("Graph.".concat(o,': could not find the "').concat(t,'" node in the graph.'));return St(r,i,n)}if(2===arguments.length){t=""+t,e=""+e;var a=this._nodes.get(t);if(!a)throw new Y("Graph.".concat(o,':  could not find the "').concat(t,'" source node in the graph.'));if(!this._nodes.has(e))throw new Y("Graph.".concat(o,':  could not find the "').concat(e,'" target node in the graph.'));return Nt(r,i,a,e)}throw new F("Graph.".concat(o,": too many arguments (expecting 0, 1 or 2 and got ").concat(arguments.length,")."))};}(t,e);}));}(re),function(t){Ut.forEach((function(e){Rt(t,e),Wt(t,e),Kt(t,e),It(t,e);}));}(re);var ie=function(t){function n(e){var n=c({type:"directed"},e);if("multi"in n&&!1!==n.multi)throw new F("DirectedGraph.from: inconsistent indication that the graph should be multi in given options!");if("directed"!==n.type)throw new F('DirectedGraph.from: inconsistent "'+n.type+'" type in given options!');return t.call(this,n)||this}return e(n,t),n}(re),oe=function(t){function n(e){var n=c({type:"undirected"},e);if("multi"in n&&!1!==n.multi)throw new F("UndirectedGraph.from: inconsistent indication that the graph should be multi in given options!");if("undirected"!==n.type)throw new F('UndirectedGraph.from: inconsistent "'+n.type+'" type in given options!');return t.call(this,n)||this}return e(n,t),n}(re),ae=function(t){function n(e){var n=c({multi:!0},e);if("multi"in n&&!0!==n.multi)throw new F("MultiGraph.from: inconsistent indication that the graph should be simple in given options!");return t.call(this,n)||this}return e(n,t),n}(re),ue=function(t){function n(e){var n=c({type:"directed",multi:!0},e);if("multi"in n&&!0!==n.multi)throw new F("MultiDirectedGraph.from: inconsistent indication that the graph should be simple in given options!");if("directed"!==n.type)throw new F('MultiDirectedGraph.from: inconsistent "'+n.type+'" type in given options!');return t.call(this,n)||this}return e(n,t),n}(re),ce=function(t){function n(e){var n=c({type:"undirected",multi:!0},e);if("multi"in n&&!0!==n.multi)throw new F("MultiUndirectedGraph.from: inconsistent indication that the graph should be simple in given options!");if("undirected"!==n.type)throw new F('MultiUndirectedGraph.from: inconsistent "'+n.type+'" type in given options!');return t.call(this,n)||this}return e(n,t),n}(re);function de(t){t.from=function(e,n){var r=c({},e.options,n),i=new t(r);return i.import(e),i};}return de(re),de(ie),de(oe),de(ae),de(ue),de(ce),re.Graph=re,re.DirectedGraph=ie,re.UndirectedGraph=oe,re.MultiGraph=ae,re.MultiDirectedGraph=ue,re.MultiUndirectedGraph=ce,re.InvalidArgumentsGraphError=F,re.NotFoundGraphError=Y,re.UsageGraphError=B,re}));
 
-      // If `variable` is not specified wrap a with-statement around the generated
-      // code to add the data object to the top of the scope chain.
-      var variable = hasOwnProperty.call(options, 'variable') && options.variable;
-      if (!variable) {
-        source = 'with (obj) {\n' + source + '\n}\n';
-      }
-      // Throw an error if a forbidden character was found in `variable`, to prevent
-      // potential command injection attacks.
-      else if (reForbiddenIdentifierChars.test(variable)) {
-        throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);
-      }
+});
 
-      // Cleanup code by stripping empty strings.
-      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)
-        .replace(reEmptyStringMiddle, '$1')
-        .replace(reEmptyStringTrailing, '$1;');
+/**
+ * Graphology isGraph
+ * ===================
+ *
+ * Very simple function aiming at ensuring the given variable is a
+ * graphology instance.
+ */
+/**
+ * Checking the value is a graphology instance.
+ *
+ * @param  {any}     value - Target value.
+ * @return {boolean}
+ */
+var isGraph = function isGraph(value) {
+  return (
+    value !== null &&
+    typeof value === 'object' &&
+    typeof value.addUndirectedEdgeWithKey === 'function' &&
+    typeof value.dropNode === 'function' &&
+    typeof value.multi === 'boolean'
+  );
+};
 
-      // Frame code as the function body.
-      source = 'function(' + (variable || 'obj') + ') {\n' +
-        (variable
-          ? ''
-          : 'obj || (obj = {});\n'
-        ) +
-        "var __t, __p = ''" +
-        (isEscaping
-           ? ', __e = _.escape'
-           : ''
-        ) +
-        (isEvaluating
-          ? ', __j = Array.prototype.join;\n' +
-            "function print() { __p += __j.call(arguments, '') }\n"
-          : ';\n'
-        ) +
-        source +
-        'return __p\n}';
+var ARRAY_BUFFER_SUPPORT$1 = typeof ArrayBuffer !== 'undefined';
+var SYMBOL_SUPPORT$1 = typeof Symbol !== 'undefined';
 
-      var result = attempt(function() {
-        return Function(importsKeys, sourceURL + 'return ' + source)
-          .apply(undefined$1, importsValues);
-      });
+var support = {
+	ARRAY_BUFFER_SUPPORT: ARRAY_BUFFER_SUPPORT$1,
+	SYMBOL_SUPPORT: SYMBOL_SUPPORT$1
+};
 
-      // Provide the compiled function's source by its `toString` method or
-      // the `source` property as a convenience for inlining compiled templates.
-      result.source = source;
-      if (isError(result)) {
-        throw result;
-      }
-      return result;
-    }
+/**
+ * Obliterator ForEach Function
+ * =============================
+ *
+ * Helper function used to easily iterate over mixed values.
+ */
 
-    /**
-     * Converts `string`, as a whole, to lower case just like
-     * [String#toLowerCase](https://mdn.io/toLowerCase).
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the lower cased string.
-     * @example
-     *
-     * _.toLower('--Foo-Bar--');
-     * // => '--foo-bar--'
-     *
-     * _.toLower('fooBar');
-     * // => 'foobar'
-     *
-     * _.toLower('__FOO_BAR__');
-     * // => '__foo_bar__'
-     */
-    function toLower(value) {
-      return toString(value).toLowerCase();
-    }
+var ARRAY_BUFFER_SUPPORT = support.ARRAY_BUFFER_SUPPORT;
+var SYMBOL_SUPPORT = support.SYMBOL_SUPPORT;
 
-    /**
-     * Converts `string`, as a whole, to upper case just like
-     * [String#toUpperCase](https://mdn.io/toUpperCase).
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the upper cased string.
-     * @example
-     *
-     * _.toUpper('--foo-bar--');
-     * // => '--FOO-BAR--'
-     *
-     * _.toUpper('fooBar');
-     * // => 'FOOBAR'
-     *
-     * _.toUpper('__foo_bar__');
-     * // => '__FOO_BAR__'
-     */
-    function toUpper(value) {
-      return toString(value).toUpperCase();
-    }
+/**
+ * Function able to iterate over almost any iterable JS value.
+ *
+ * @param  {any}      iterable - Iterable value.
+ * @param  {function} callback - Callback function.
+ */
+var foreach = function forEach(iterable, callback) {
+  var iterator, k, i, l, s;
 
-    /**
-     * Removes leading and trailing whitespace or specified characters from `string`.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to trim.
-     * @param {string} [chars=whitespace] The characters to trim.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {string} Returns the trimmed string.
-     * @example
-     *
-     * _.trim('  abc  ');
-     * // => 'abc'
-     *
-     * _.trim('-_-abc-_-', '_-');
-     * // => 'abc'
-     *
-     * _.map(['  foo  ', '  bar  '], _.trim);
-     * // => ['foo', 'bar']
-     */
-    function trim(string, chars, guard) {
-      string = toString(string);
-      if (string && (guard || chars === undefined$1)) {
-        return baseTrim(string);
-      }
-      if (!string || !(chars = baseToString(chars))) {
-        return string;
-      }
-      var strSymbols = stringToArray(string),
-          chrSymbols = stringToArray(chars),
-          start = charsStartIndex(strSymbols, chrSymbols),
-          end = charsEndIndex(strSymbols, chrSymbols) + 1;
+  if (!iterable) throw new Error('obliterator/forEach: invalid iterable.');
 
-      return castSlice(strSymbols, start, end).join('');
-    }
+  if (typeof callback !== 'function')
+    throw new Error('obliterator/forEach: expecting a callback.');
 
-    /**
-     * Removes trailing whitespace or specified characters from `string`.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to trim.
-     * @param {string} [chars=whitespace] The characters to trim.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {string} Returns the trimmed string.
-     * @example
-     *
-     * _.trimEnd('  abc  ');
-     * // => '  abc'
-     *
-     * _.trimEnd('-_-abc-_-', '_-');
-     * // => '-_-abc'
-     */
-    function trimEnd(string, chars, guard) {
-      string = toString(string);
-      if (string && (guard || chars === undefined$1)) {
-        return string.slice(0, trimmedEndIndex(string) + 1);
-      }
-      if (!string || !(chars = baseToString(chars))) {
-        return string;
-      }
-      var strSymbols = stringToArray(string),
-          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;
+  // The target is an array or a string or function arguments
+  if (
+    Array.isArray(iterable) ||
+    (ARRAY_BUFFER_SUPPORT && ArrayBuffer.isView(iterable)) ||
+    typeof iterable === 'string' ||
+    iterable.toString() === '[object Arguments]'
+  ) {
+    for (i = 0, l = iterable.length; i < l; i++) callback(iterable[i], i);
+    return;
+  }
 
-      return castSlice(strSymbols, 0, end).join('');
+  // The target has a #.forEach method
+  if (typeof iterable.forEach === 'function') {
+    iterable.forEach(callback);
+    return;
+  }
+
+  // The target is iterable
+  if (
+    SYMBOL_SUPPORT &&
+    Symbol.iterator in iterable &&
+    typeof iterable.next !== 'function'
+  ) {
+    iterable = iterable[Symbol.iterator]();
+  }
+
+  // The target is an iterator
+  if (typeof iterable.next === 'function') {
+    iterator = iterable;
+    i = 0;
+
+    while (((s = iterator.next()), s.done !== true)) {
+      callback(s.value, i);
+      i++;
     }
 
-    /**
-     * Removes leading whitespace or specified characters from `string`.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to trim.
-     * @param {string} [chars=whitespace] The characters to trim.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {string} Returns the trimmed string.
-     * @example
-     *
-     * _.trimStart('  abc  ');
-     * // => 'abc  '
-     *
-     * _.trimStart('-_-abc-_-', '_-');
-     * // => 'abc-_-'
-     */
-    function trimStart(string, chars, guard) {
-      string = toString(string);
-      if (string && (guard || chars === undefined$1)) {
-        return string.replace(reTrimStart, '');
-      }
-      if (!string || !(chars = baseToString(chars))) {
-        return string;
-      }
-      var strSymbols = stringToArray(string),
-          start = charsStartIndex(strSymbols, stringToArray(chars));
+    return;
+  }
 
-      return castSlice(strSymbols, start).join('');
+  // The target is a plain object
+  for (k in iterable) {
+    if (iterable.hasOwnProperty(k)) {
+      callback(iterable[k], k);
     }
+  }
 
-    /**
-     * Truncates `string` if it's longer than the given maximum string length.
-     * The last characters of the truncated string are replaced with the omission
-     * string which defaults to "...".
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to truncate.
-     * @param {Object} [options={}] The options object.
-     * @param {number} [options.length=30] The maximum string length.
-     * @param {string} [options.omission='...'] The string to indicate text is omitted.
-     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.
-     * @returns {string} Returns the truncated string.
-     * @example
-     *
-     * _.truncate('hi-diddly-ho there, neighborino');
-     * // => 'hi-diddly-ho there, neighbo...'
-     *
-     * _.truncate('hi-diddly-ho there, neighborino', {
-     *   'length': 24,
-     *   'separator': ' '
-     * });
-     * // => 'hi-diddly-ho there,...'
-     *
-     * _.truncate('hi-diddly-ho there, neighborino', {
-     *   'length': 24,
-     *   'separator': /,? +/
-     * });
-     * // => 'hi-diddly-ho there...'
-     *
-     * _.truncate('hi-diddly-ho there, neighborino', {
-     *   'omission': ' [...]'
-     * });
-     * // => 'hi-diddly-ho there, neig [...]'
-     */
-    function truncate(string, options) {
-      var length = DEFAULT_TRUNC_LENGTH,
-          omission = DEFAULT_TRUNC_OMISSION;
+  return;
+};
 
-      if (isObject(options)) {
-        var separator = 'separator' in options ? options.separator : separator;
-        length = 'length' in options ? toInteger(options.length) : length;
-        omission = 'omission' in options ? baseToString(options.omission) : omission;
-      }
-      string = toString(string);
+/**
+ * Mnemonist Typed Array Helpers
+ * ==============================
+ *
+ * Miscellaneous helpers related to typed arrays.
+ */
 
-      var strLength = string.length;
-      if (hasUnicode(string)) {
-        var strSymbols = stringToArray(string);
-        strLength = strSymbols.length;
-      }
-      if (length >= strLength) {
-        return string;
-      }
-      var end = length - stringSize(omission);
-      if (end < 1) {
-        return omission;
-      }
-      var result = strSymbols
-        ? castSlice(strSymbols, 0, end).join('')
-        : string.slice(0, end);
+var typedArrays = createCommonjsModule(function (module, exports) {
+/**
+ * When using an unsigned integer array to store pointers, one might want to
+ * choose the optimal word size in regards to the actual numbers of pointers
+ * to store.
+ *
+ * This helpers does just that.
+ *
+ * @param  {number} size - Expected size of the array to map.
+ * @return {TypedArray}
+ */
+var MAX_8BIT_INTEGER = Math.pow(2, 8) - 1,
+    MAX_16BIT_INTEGER = Math.pow(2, 16) - 1,
+    MAX_32BIT_INTEGER = Math.pow(2, 32) - 1;
 
-      if (separator === undefined$1) {
-        return result + omission;
-      }
-      if (strSymbols) {
-        end += (result.length - end);
-      }
-      if (isRegExp(separator)) {
-        if (string.slice(end).search(separator)) {
-          var match,
-              substring = result;
+var MAX_SIGNED_8BIT_INTEGER = Math.pow(2, 7) - 1,
+    MAX_SIGNED_16BIT_INTEGER = Math.pow(2, 15) - 1,
+    MAX_SIGNED_32BIT_INTEGER = Math.pow(2, 31) - 1;
 
-          if (!separator.global) {
-            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');
-          }
-          separator.lastIndex = 0;
-          while ((match = separator.exec(substring))) {
-            var newEnd = match.index;
-          }
-          result = result.slice(0, newEnd === undefined$1 ? end : newEnd);
-        }
-      } else if (string.indexOf(baseToString(separator), end) != end) {
-        var index = result.lastIndexOf(separator);
-        if (index > -1) {
-          result = result.slice(0, index);
-        }
-      }
-      return result + omission;
-    }
+exports.getPointerArray = function(size) {
+  var maxIndex = size - 1;
 
-    /**
-     * The inverse of `_.escape`; this method converts the HTML entities
-     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to
-     * their corresponding characters.
-     *
-     * **Note:** No other HTML entities are unescaped. To unescape additional
-     * HTML entities use a third-party library like [_he_](https://mths.be/he).
-     *
-     * @static
-     * @memberOf _
-     * @since 0.6.0
-     * @category String
-     * @param {string} [string=''] The string to unescape.
-     * @returns {string} Returns the unescaped string.
-     * @example
-     *
-     * _.unescape('fred, barney, &amp; pebbles');
-     * // => 'fred, barney, & pebbles'
-     */
-    function unescape(string) {
-      string = toString(string);
-      return (string && reHasEscapedHtml.test(string))
-        ? string.replace(reEscapedHtml, unescapeHtmlChar)
-        : string;
-    }
+  if (maxIndex <= MAX_8BIT_INTEGER)
+    return Uint8Array;
 
-    /**
-     * Converts `string`, as space separated words, to upper case.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the upper cased string.
-     * @example
-     *
-     * _.upperCase('--foo-bar');
-     * // => 'FOO BAR'
-     *
-     * _.upperCase('fooBar');
-     * // => 'FOO BAR'
-     *
-     * _.upperCase('__foo_bar__');
-     * // => 'FOO BAR'
-     */
-    var upperCase = createCompounder(function(result, word, index) {
-      return result + (index ? ' ' : '') + word.toUpperCase();
-    });
+  if (maxIndex <= MAX_16BIT_INTEGER)
+    return Uint16Array;
 
-    /**
-     * Converts the first character of `string` to upper case.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category String
-     * @param {string} [string=''] The string to convert.
-     * @returns {string} Returns the converted string.
-     * @example
-     *
-     * _.upperFirst('fred');
-     * // => 'Fred'
-     *
-     * _.upperFirst('FRED');
-     * // => 'FRED'
-     */
-    var upperFirst = createCaseFirst('toUpperCase');
+  if (maxIndex <= MAX_32BIT_INTEGER)
+    return Uint32Array;
+
+  throw new Error('mnemonist: Pointer Array of size > 4294967295 is not supported.');
+};
 
-    /**
-     * Splits `string` into an array of its words.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category String
-     * @param {string} [string=''] The string to inspect.
-     * @param {RegExp|string} [pattern] The pattern to match words.
-     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.
-     * @returns {Array} Returns the words of `string`.
-     * @example
-     *
-     * _.words('fred, barney, & pebbles');
-     * // => ['fred', 'barney', 'pebbles']
-     *
-     * _.words('fred, barney, & pebbles', /[^, ]+/g);
-     * // => ['fred', 'barney', '&', 'pebbles']
-     */
-    function words(string, pattern, guard) {
-      string = toString(string);
-      pattern = guard ? undefined$1 : pattern;
+exports.getSignedPointerArray = function(size) {
+  var maxIndex = size - 1;
 
-      if (pattern === undefined$1) {
-        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);
-      }
-      return string.match(pattern) || [];
-    }
+  if (maxIndex <= MAX_SIGNED_8BIT_INTEGER)
+    return Int8Array;
 
-    /*------------------------------------------------------------------------*/
+  if (maxIndex <= MAX_SIGNED_16BIT_INTEGER)
+    return Int16Array;
 
-    /**
-     * Attempts to invoke `func`, returning either the result or the caught error
-     * object. Any additional arguments are provided to `func` when it's invoked.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category Util
-     * @param {Function} func The function to attempt.
-     * @param {...*} [args] The arguments to invoke `func` with.
-     * @returns {*} Returns the `func` result or error object.
-     * @example
-     *
-     * // Avoid throwing errors for invalid selectors.
-     * var elements = _.attempt(function(selector) {
-     *   return document.querySelectorAll(selector);
-     * }, '>_>');
-     *
-     * if (_.isError(elements)) {
-     *   elements = [];
-     * }
-     */
-    var attempt = baseRest(function(func, args) {
-      try {
-        return apply(func, undefined$1, args);
-      } catch (e) {
-        return isError(e) ? e : new Error(e);
-      }
-    });
+  if (maxIndex <= MAX_SIGNED_32BIT_INTEGER)
+    return Int32Array;
 
-    /**
-     * Binds methods of an object to the object itself, overwriting the existing
-     * method.
-     *
-     * **Note:** This method doesn't set the "length" property of bound functions.
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category Util
-     * @param {Object} object The object to bind and assign the bound methods to.
-     * @param {...(string|string[])} methodNames The object method names to bind.
-     * @returns {Object} Returns `object`.
-     * @example
-     *
-     * var view = {
-     *   'label': 'docs',
-     *   'click': function() {
-     *     console.log('clicked ' + this.label);
-     *   }
-     * };
-     *
-     * _.bindAll(view, ['click']);
-     * jQuery(element).on('click', view.click);
-     * // => Logs 'clicked docs' when clicked.
-     */
-    var bindAll = flatRest(function(object, methodNames) {
-      arrayEach(methodNames, function(key) {
-        key = toKey(key);
-        baseAssignValue(object, key, bind(object[key], object));
-      });
-      return object;
-    });
+  return Float64Array;
+};
 
-    /**
-     * Creates a function that iterates over `pairs` and invokes the corresponding
-     * function of the first predicate to return truthy. The predicate-function
-     * pairs are invoked with the `this` binding and arguments of the created
-     * function.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Util
-     * @param {Array} pairs The predicate-function pairs.
-     * @returns {Function} Returns the new composite function.
-     * @example
-     *
-     * var func = _.cond([
-     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],
-     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],
-     *   [_.stubTrue,                      _.constant('no match')]
-     * ]);
-     *
-     * func({ 'a': 1, 'b': 2 });
-     * // => 'matches A'
-     *
-     * func({ 'a': 0, 'b': 1 });
-     * // => 'matches B'
-     *
-     * func({ 'a': '1', 'b': '2' });
-     * // => 'no match'
-     */
-    function cond(pairs) {
-      var length = pairs == null ? 0 : pairs.length,
-          toIteratee = getIteratee();
+/**
+ * Function returning the minimal type able to represent the given number.
+ *
+ * @param  {number} value - Value to test.
+ * @return {TypedArrayClass}
+ */
+exports.getNumberType = function(value) {
 
-      pairs = !length ? [] : arrayMap(pairs, function(pair) {
-        if (typeof pair[1] != 'function') {
-          throw new TypeError(FUNC_ERROR_TEXT);
-        }
-        return [toIteratee(pair[0]), pair[1]];
-      });
+  // <= 32 bits itnteger?
+  if (value === (value | 0)) {
 
-      return baseRest(function(args) {
-        var index = -1;
-        while (++index < length) {
-          var pair = pairs[index];
-          if (apply(pair[0], this, args)) {
-            return apply(pair[1], this, args);
-          }
-        }
-      });
-    }
+    // Negative
+    if (Math.sign(value) === -1) {
+      if (value <= 127 && value >= -128)
+        return Int8Array;
 
-    /**
-     * Creates a function that invokes the predicate properties of `source` with
-     * the corresponding property values of a given object, returning `true` if
-     * all predicates return truthy, else `false`.
-     *
-     * **Note:** The created function is equivalent to `_.conformsTo` with
-     * `source` partially applied.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Util
-     * @param {Object} source The object of property predicates to conform to.
-     * @returns {Function} Returns the new spec function.
-     * @example
-     *
-     * var objects = [
-     *   { 'a': 2, 'b': 1 },
-     *   { 'a': 1, 'b': 2 }
-     * ];
-     *
-     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));
-     * // => [{ 'a': 1, 'b': 2 }]
-     */
-    function conforms(source) {
-      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));
+      if (value <= 32767 && value >= -32768)
+        return Int16Array;
+
+      return Int32Array;
     }
+    else {
 
-    /**
-     * Creates a function that returns `value`.
-     *
-     * @static
-     * @memberOf _
-     * @since 2.4.0
-     * @category Util
-     * @param {*} value The value to return from the new function.
-     * @returns {Function} Returns the new constant function.
-     * @example
-     *
-     * var objects = _.times(2, _.constant({ 'a': 1 }));
-     *
-     * console.log(objects);
-     * // => [{ 'a': 1 }, { 'a': 1 }]
-     *
-     * console.log(objects[0] === objects[1]);
-     * // => true
-     */
-    function constant(value) {
-      return function() {
-        return value;
-      };
+      if (value <= 255)
+        return Uint8Array;
+
+      if (value <= 65535)
+        return Uint16Array;
+
+      return Uint32Array;
     }
+  }
+
+  // 53 bits integer & floats
+  // NOTE: it's kinda hard to tell whether we could use 32bits or not...
+  return Float64Array;
+};
+
+/**
+ * Function returning the minimal type able to represent the given array
+ * of JavaScript numbers.
+ *
+ * @param  {array}    array  - Array to represent.
+ * @param  {function} getter - Optional getter.
+ * @return {TypedArrayClass}
+ */
+var TYPE_PRIORITY = {
+  Uint8Array: 1,
+  Int8Array: 2,
+  Uint16Array: 3,
+  Int16Array: 4,
+  Uint32Array: 5,
+  Int32Array: 6,
+  Float32Array: 7,
+  Float64Array: 8
+};
+
+// TODO: make this a one-shot for one value
+exports.getMinimalRepresentation = function(array, getter) {
+  var maxType = null,
+      maxPriority = 0,
+      p,
+      t,
+      v,
+      i,
+      l;
 
-    /**
-     * Checks `value` to determine whether a default value should be returned in
-     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,
-     * or `undefined`.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.14.0
-     * @category Util
-     * @param {*} value The value to check.
-     * @param {*} defaultValue The default value.
-     * @returns {*} Returns the resolved value.
-     * @example
-     *
-     * _.defaultTo(1, 10);
-     * // => 1
-     *
-     * _.defaultTo(undefined, 10);
-     * // => 10
-     */
-    function defaultTo(value, defaultValue) {
-      return (value == null || value !== value) ? defaultValue : value;
+  for (i = 0, l = array.length; i < l; i++) {
+    v = getter ? getter(array[i]) : array[i];
+    t = exports.getNumberType(v);
+    p = TYPE_PRIORITY[t.name];
+
+    if (p > maxPriority) {
+      maxPriority = p;
+      maxType = t;
     }
+  }
 
-    /**
-     * Creates a function that returns the result of invoking the given functions
-     * with the `this` binding of the created function, where each successive
-     * invocation is supplied the return value of the previous.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category Util
-     * @param {...(Function|Function[])} [funcs] The functions to invoke.
-     * @returns {Function} Returns the new composite function.
-     * @see _.flowRight
-     * @example
-     *
-     * function square(n) {
-     *   return n * n;
-     * }
-     *
-     * var addSquare = _.flow([_.add, square]);
-     * addSquare(1, 2);
-     * // => 9
-     */
-    var flow = createFlow();
+  return maxType;
+};
 
-    /**
-     * This method is like `_.flow` except that it creates a function that
-     * invokes the given functions from right to left.
-     *
-     * @static
-     * @since 3.0.0
-     * @memberOf _
-     * @category Util
-     * @param {...(Function|Function[])} [funcs] The functions to invoke.
-     * @returns {Function} Returns the new composite function.
-     * @see _.flow
-     * @example
-     *
-     * function square(n) {
-     *   return n * n;
-     * }
-     *
-     * var addSquare = _.flowRight([square, _.add]);
-     * addSquare(1, 2);
-     * // => 9
-     */
-    var flowRight = createFlow(true);
+/**
+ * Function returning whether the given value is a typed array.
+ *
+ * @param  {any} value - Value to test.
+ * @return {boolean}
+ */
+exports.isTypedArray = function(value) {
+  return typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView(value);
+};
 
-    /**
-     * This method returns the first argument it receives.
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category Util
-     * @param {*} value Any value.
-     * @returns {*} Returns `value`.
-     * @example
-     *
-     * var object = { 'a': 1 };
-     *
-     * console.log(_.identity(object) === object);
-     * // => true
-     */
-    function identity(value) {
-      return value;
-    }
+/**
+ * Function used to concat byte arrays.
+ *
+ * @param  {...ByteArray}
+ * @return {ByteArray}
+ */
+exports.concat = function() {
+  var length = 0,
+      i,
+      o,
+      l;
 
-    /**
-     * Creates a function that invokes `func` with the arguments of the created
-     * function. If `func` is a property name, the created function returns the
-     * property value for a given element. If `func` is an array or object, the
-     * created function returns `true` for elements that contain the equivalent
-     * source properties, otherwise it returns `false`.
-     *
-     * @static
-     * @since 4.0.0
-     * @memberOf _
-     * @category Util
-     * @param {*} [func=_.identity] The value to convert to a callback.
-     * @returns {Function} Returns the callback.
-     * @example
-     *
-     * var users = [
-     *   { 'user': 'barney', 'age': 36, 'active': true },
-     *   { 'user': 'fred',   'age': 40, 'active': false }
-     * ];
-     *
-     * // The `_.matches` iteratee shorthand.
-     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));
-     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]
-     *
-     * // The `_.matchesProperty` iteratee shorthand.
-     * _.filter(users, _.iteratee(['user', 'fred']));
-     * // => [{ 'user': 'fred', 'age': 40 }]
-     *
-     * // The `_.property` iteratee shorthand.
-     * _.map(users, _.iteratee('user'));
-     * // => ['barney', 'fred']
-     *
-     * // Create custom iteratee shorthands.
-     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {
-     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {
-     *     return func.test(string);
-     *   };
-     * });
-     *
-     * _.filter(['abc', 'def'], /ef/);
-     * // => ['def']
-     */
-    function iteratee(func) {
-      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));
-    }
+  for (i = 0, l = arguments.length; i < l; i++)
+    length += arguments[i].length;
 
-    /**
-     * Creates a function that performs a partial deep comparison between a given
-     * object and `source`, returning `true` if the given object has equivalent
-     * property values, else `false`.
-     *
-     * **Note:** The created function is equivalent to `_.isMatch` with `source`
-     * partially applied.
-     *
-     * Partial comparisons will match empty array and empty object `source`
-     * values against any array or object value, respectively. See `_.isEqual`
-     * for a list of supported value comparisons.
-     *
-     * **Note:** Multiple values can be checked by combining several matchers
-     * using `_.overSome`
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category Util
-     * @param {Object} source The object of property values to match.
-     * @returns {Function} Returns the new spec function.
-     * @example
-     *
-     * var objects = [
-     *   { 'a': 1, 'b': 2, 'c': 3 },
-     *   { 'a': 4, 'b': 5, 'c': 6 }
-     * ];
-     *
-     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));
-     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]
-     *
-     * // Checking for several possible values
-     * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));
-     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]
-     */
-    function matches(source) {
-      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));
-    }
+  var array = new (arguments[0].constructor)(length);
 
-    /**
-     * Creates a function that performs a partial deep comparison between the
-     * value at `path` of a given object to `srcValue`, returning `true` if the
-     * object value is equivalent, else `false`.
-     *
-     * **Note:** Partial comparisons will match empty array and empty object
-     * `srcValue` values against any array or object value, respectively. See
-     * `_.isEqual` for a list of supported value comparisons.
-     *
-     * **Note:** Multiple values can be checked by combining several matchers
-     * using `_.overSome`
-     *
-     * @static
-     * @memberOf _
-     * @since 3.2.0
-     * @category Util
-     * @param {Array|string} path The path of the property to get.
-     * @param {*} srcValue The value to match.
-     * @returns {Function} Returns the new spec function.
-     * @example
-     *
-     * var objects = [
-     *   { 'a': 1, 'b': 2, 'c': 3 },
-     *   { 'a': 4, 'b': 5, 'c': 6 }
-     * ];
-     *
-     * _.find(objects, _.matchesProperty('a', 4));
-     * // => { 'a': 4, 'b': 5, 'c': 6 }
-     *
-     * // Checking for several possible values
-     * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));
-     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]
-     */
-    function matchesProperty(path, srcValue) {
-      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));
-    }
+  for (i = 0, o = 0; i < l; i++) {
+    array.set(arguments[i], o);
+    o += arguments[i].length;
+  }
+
+  return array;
+};
+
+/**
+ * Function used to initialize a byte array of indices.
+ *
+ * @param  {number}    length - Length of target.
+ * @return {ByteArray}
+ */
+exports.indices = function(length) {
+  var PointerArray = exports.getPointerArray(length);
 
-    /**
-     * Creates a function that invokes the method at `path` of a given object.
-     * Any additional arguments are provided to the invoked method.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.7.0
-     * @category Util
-     * @param {Array|string} path The path of the method to invoke.
-     * @param {...*} [args] The arguments to invoke the method with.
-     * @returns {Function} Returns the new invoker function.
-     * @example
-     *
-     * var objects = [
-     *   { 'a': { 'b': _.constant(2) } },
-     *   { 'a': { 'b': _.constant(1) } }
-     * ];
-     *
-     * _.map(objects, _.method('a.b'));
-     * // => [2, 1]
-     *
-     * _.map(objects, _.method(['a', 'b']));
-     * // => [2, 1]
-     */
-    var method = baseRest(function(path, args) {
-      return function(object) {
-        return baseInvoke(object, path, args);
-      };
-    });
+  var array = new PointerArray(length);
 
-    /**
-     * The opposite of `_.method`; this method creates a function that invokes
-     * the method at a given path of `object`. Any additional arguments are
-     * provided to the invoked method.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.7.0
-     * @category Util
-     * @param {Object} object The object to query.
-     * @param {...*} [args] The arguments to invoke the method with.
-     * @returns {Function} Returns the new invoker function.
-     * @example
-     *
-     * var array = _.times(3, _.constant),
-     *     object = { 'a': array, 'b': array, 'c': array };
-     *
-     * _.map(['a[2]', 'c[0]'], _.methodOf(object));
-     * // => [2, 0]
-     *
-     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));
-     * // => [2, 0]
-     */
-    var methodOf = baseRest(function(object, args) {
-      return function(path) {
-        return baseInvoke(object, path, args);
-      };
-    });
+  for (var i = 0; i < length; i++)
+    array[i] = i;
 
-    /**
-     * Adds all own enumerable string keyed function properties of a source
-     * object to the destination object. If `object` is a function, then methods
-     * are added to its prototype as well.
-     *
-     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to
-     * avoid conflicts caused by modifying the original.
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category Util
-     * @param {Function|Object} [object=lodash] The destination object.
-     * @param {Object} source The object of functions to add.
-     * @param {Object} [options={}] The options object.
-     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.
-     * @returns {Function|Object} Returns `object`.
-     * @example
-     *
-     * function vowels(string) {
-     *   return _.filter(string, function(v) {
-     *     return /[aeiou]/i.test(v);
-     *   });
-     * }
-     *
-     * _.mixin({ 'vowels': vowels });
-     * _.vowels('fred');
-     * // => ['e']
-     *
-     * _('fred').vowels().value();
-     * // => ['e']
-     *
-     * _.mixin({ 'vowels': vowels }, { 'chain': false });
-     * _('fred').vowels();
-     * // => ['e']
-     */
-    function mixin(object, source, options) {
-      var props = keys(source),
-          methodNames = baseFunctions(source, props);
+  return array;
+};
+});
 
-      if (options == null &&
-          !(isObject(source) && (methodNames.length || !props.length))) {
-        options = source;
-        source = object;
-        object = this;
-        methodNames = baseFunctions(source, keys(source));
-      }
-      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,
-          isFunc = isFunction(object);
+/**
+ * Mnemonist Iterable Function
+ * ============================
+ *
+ * Harmonized iteration helpers over mixed iterable targets.
+ */
 
-      arrayEach(methodNames, function(methodName) {
-        var func = source[methodName];
-        object[methodName] = func;
-        if (isFunc) {
-          object.prototype[methodName] = function() {
-            var chainAll = this.__chain__;
-            if (chain || chainAll) {
-              var result = object(this.__wrapped__),
-                  actions = result.__actions__ = copyArray(this.__actions__);
+/**
+ * Function used to determine whether the given object supports array-like
+ * random access.
+ *
+ * @param  {any} target - Target object.
+ * @return {boolean}
+ */
+function isArrayLike(target) {
+  return Array.isArray(target) || typedArrays.isTypedArray(target);
+}
 
-              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });
-              result.__chain__ = chainAll;
-              return result;
-            }
-            return func.apply(object, arrayPush([this.value()], arguments));
-          };
-        }
-      });
+/**
+ * Function used to guess the length of the structure over which we are going
+ * to iterate.
+ *
+ * @param  {any} target - Target object.
+ * @return {number|undefined}
+ */
+function guessLength(target) {
+  if (typeof target.length === 'number')
+    return target.length;
 
-      return object;
-    }
+  if (typeof target.size === 'number')
+    return target.size;
 
-    /**
-     * Reverts the `_` variable to its previous value and returns a reference to
-     * the `lodash` function.
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category Util
-     * @returns {Function} Returns the `lodash` function.
-     * @example
-     *
-     * var lodash = _.noConflict();
-     */
-    function noConflict() {
-      if (root._ === this) {
-        root._ = oldDash;
-      }
-      return this;
-    }
+  return;
+}
 
-    /**
-     * This method returns `undefined`.
-     *
-     * @static
-     * @memberOf _
-     * @since 2.3.0
-     * @category Util
-     * @example
-     *
-     * _.times(2, _.noop);
-     * // => [undefined, undefined]
-     */
-    function noop() {
-      // No operation performed.
-    }
+/**
+ * Function used to convert an iterable to an array.
+ *
+ * @param  {any}   target - Iteration target.
+ * @return {array}
+ */
+function toArray(target) {
+  var l = guessLength(target);
 
-    /**
-     * Creates a function that gets the argument at index `n`. If `n` is negative,
-     * the nth argument from the end is returned.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Util
-     * @param {number} [n=0] The index of the argument to return.
-     * @returns {Function} Returns the new pass-thru function.
-     * @example
-     *
-     * var func = _.nthArg(1);
-     * func('a', 'b', 'c', 'd');
-     * // => 'b'
-     *
-     * var func = _.nthArg(-2);
-     * func('a', 'b', 'c', 'd');
-     * // => 'c'
-     */
-    function nthArg(n) {
-      n = toInteger(n);
-      return baseRest(function(args) {
-        return baseNth(args, n);
-      });
-    }
+  var array = typeof l === 'number' ? new Array(l) : [];
 
-    /**
-     * Creates a function that invokes `iteratees` with the arguments it receives
-     * and returns their results.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Util
-     * @param {...(Function|Function[])} [iteratees=[_.identity]]
-     *  The iteratees to invoke.
-     * @returns {Function} Returns the new function.
-     * @example
-     *
-     * var func = _.over([Math.max, Math.min]);
-     *
-     * func(1, 2, 3, 4);
-     * // => [4, 1]
-     */
-    var over = createOver(arrayMap);
+  var i = 0;
+
+  // TODO: we could optimize when given target is array like
+  foreach(target, function(value) {
+    array[i++] = value;
+  });
+
+  return array;
+}
 
-    /**
-     * Creates a function that checks if **all** of the `predicates` return
-     * truthy when invoked with the arguments it receives.
-     *
-     * Following shorthands are possible for providing predicates.
-     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.
-     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Util
-     * @param {...(Function|Function[])} [predicates=[_.identity]]
-     *  The predicates to check.
-     * @returns {Function} Returns the new function.
-     * @example
-     *
-     * var func = _.overEvery([Boolean, isFinite]);
-     *
-     * func('1');
-     * // => true
-     *
-     * func(null);
-     * // => false
-     *
-     * func(NaN);
-     * // => false
-     */
-    var overEvery = createOver(arrayEvery);
+/**
+ * Same as above but returns a supplementary indices array.
+ *
+ * @param  {any}   target - Iteration target.
+ * @return {array}
+ */
+function toArrayWithIndices(target) {
+  var l = guessLength(target);
 
-    /**
-     * Creates a function that checks if **any** of the `predicates` return
-     * truthy when invoked with the arguments it receives.
-     *
-     * Following shorthands are possible for providing predicates.
-     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.
-     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Util
-     * @param {...(Function|Function[])} [predicates=[_.identity]]
-     *  The predicates to check.
-     * @returns {Function} Returns the new function.
-     * @example
-     *
-     * var func = _.overSome([Boolean, isFinite]);
-     *
-     * func('1');
-     * // => true
-     *
-     * func(null);
-     * // => true
-     *
-     * func(NaN);
-     * // => false
-     *
-     * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])
-     * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])
-     */
-    var overSome = createOver(arraySome);
+  var IndexArray = typeof l === 'number' ?
+    typedArrays.getPointerArray(l) :
+    Array;
 
-    /**
-     * Creates a function that returns the value at `path` of a given object.
-     *
-     * @static
-     * @memberOf _
-     * @since 2.4.0
-     * @category Util
-     * @param {Array|string} path The path of the property to get.
-     * @returns {Function} Returns the new accessor function.
-     * @example
-     *
-     * var objects = [
-     *   { 'a': { 'b': 2 } },
-     *   { 'a': { 'b': 1 } }
-     * ];
-     *
-     * _.map(objects, _.property('a.b'));
-     * // => [2, 1]
-     *
-     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');
-     * // => [1, 2]
-     */
-    function property(path) {
-      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);
-    }
+  var array = typeof l === 'number' ? new Array(l) : [];
+  var indices = typeof l === 'number' ? new IndexArray(l) : [];
 
-    /**
-     * The opposite of `_.property`; this method creates a function that returns
-     * the value at a given path of `object`.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.0.0
-     * @category Util
-     * @param {Object} object The object to query.
-     * @returns {Function} Returns the new accessor function.
-     * @example
-     *
-     * var array = [0, 1, 2],
-     *     object = { 'a': array, 'b': array, 'c': array };
-     *
-     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));
-     * // => [2, 0]
-     *
-     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));
-     * // => [2, 0]
-     */
-    function propertyOf(object) {
-      return function(path) {
-        return object == null ? undefined$1 : baseGet(object, path);
-      };
-    }
+  var i = 0;
 
-    /**
-     * Creates an array of numbers (positive and/or negative) progressing from
-     * `start` up to, but not including, `end`. A step of `-1` is used if a negative
-     * `start` is specified without an `end` or `step`. If `end` is not specified,
-     * it's set to `start` with `start` then set to `0`.
-     *
-     * **Note:** JavaScript follows the IEEE-754 standard for resolving
-     * floating-point values which can produce unexpected results.
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category Util
-     * @param {number} [start=0] The start of the range.
-     * @param {number} end The end of the range.
-     * @param {number} [step=1] The value to increment or decrement by.
-     * @returns {Array} Returns the range of numbers.
-     * @see _.inRange, _.rangeRight
-     * @example
-     *
-     * _.range(4);
-     * // => [0, 1, 2, 3]
-     *
-     * _.range(-4);
-     * // => [0, -1, -2, -3]
-     *
-     * _.range(1, 5);
-     * // => [1, 2, 3, 4]
-     *
-     * _.range(0, 20, 5);
-     * // => [0, 5, 10, 15]
-     *
-     * _.range(0, -4, -1);
-     * // => [0, -1, -2, -3]
-     *
-     * _.range(1, 4, 0);
-     * // => [1, 1, 1]
-     *
-     * _.range(0);
-     * // => []
-     */
-    var range = createRange();
+  // TODO: we could optimize when given target is array like
+  foreach(target, function(value) {
+    array[i] = value;
+    indices[i] = i++;
+  });
 
-    /**
-     * This method is like `_.range` except that it populates values in
-     * descending order.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Util
-     * @param {number} [start=0] The start of the range.
-     * @param {number} end The end of the range.
-     * @param {number} [step=1] The value to increment or decrement by.
-     * @returns {Array} Returns the range of numbers.
-     * @see _.inRange, _.range
-     * @example
-     *
-     * _.rangeRight(4);
-     * // => [3, 2, 1, 0]
-     *
-     * _.rangeRight(-4);
-     * // => [-3, -2, -1, 0]
-     *
-     * _.rangeRight(1, 5);
-     * // => [4, 3, 2, 1]
-     *
-     * _.rangeRight(0, 20, 5);
-     * // => [15, 10, 5, 0]
-     *
-     * _.rangeRight(0, -4, -1);
-     * // => [-3, -2, -1, 0]
-     *
-     * _.rangeRight(1, 4, 0);
-     * // => [1, 1, 1]
-     *
-     * _.rangeRight(0);
-     * // => []
-     */
-    var rangeRight = createRange(true);
+  return [array, indices];
+}
 
-    /**
-     * This method returns a new empty array.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.13.0
-     * @category Util
-     * @returns {Array} Returns the new empty array.
-     * @example
-     *
-     * var arrays = _.times(2, _.stubArray);
-     *
-     * console.log(arrays);
-     * // => [[], []]
-     *
-     * console.log(arrays[0] === arrays[1]);
-     * // => false
-     */
-    function stubArray() {
-      return [];
-    }
+/**
+ * Exporting.
+ */
+var isArrayLike_1 = isArrayLike;
+var guessLength_1 = guessLength;
+var toArray_1 = toArray;
+var toArrayWithIndices_1 = toArrayWithIndices;
+
+var iterables = {
+	isArrayLike: isArrayLike_1,
+	guessLength: guessLength_1,
+	toArray: toArray_1,
+	toArrayWithIndices: toArrayWithIndices_1
+};
+
+/**
+ * Obliterator Iterator Class
+ * ===========================
+ *
+ * Simple class representing the library's iterators.
+ */
+/**
+ * Iterator class.
+ *
+ * @constructor
+ * @param {function} next - Next function.
+ */
+function Iterator(next) {
+  if (typeof next !== 'function')
+    throw new Error('obliterator/iterator: expecting a function!');
 
-    /**
-     * This method returns `false`.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.13.0
-     * @category Util
-     * @returns {boolean} Returns `false`.
-     * @example
-     *
-     * _.times(2, _.stubFalse);
-     * // => [false, false]
-     */
-    function stubFalse() {
-      return false;
-    }
+  this.next = next;
+}
 
-    /**
-     * This method returns a new empty object.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.13.0
-     * @category Util
-     * @returns {Object} Returns the new empty object.
-     * @example
-     *
-     * var objects = _.times(2, _.stubObject);
-     *
-     * console.log(objects);
-     * // => [{}, {}]
-     *
-     * console.log(objects[0] === objects[1]);
-     * // => false
-     */
-    function stubObject() {
-      return {};
-    }
+/**
+ * If symbols are supported, we add `next` to `Symbol.iterator`.
+ */
+if (typeof Symbol !== 'undefined')
+  Iterator.prototype[Symbol.iterator] = function () {
+    return this;
+  };
 
-    /**
-     * This method returns an empty string.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.13.0
-     * @category Util
-     * @returns {string} Returns the empty string.
-     * @example
-     *
-     * _.times(2, _.stubString);
-     * // => ['', '']
-     */
-    function stubString() {
-      return '';
-    }
+/**
+ * Returning an iterator of the given values.
+ *
+ * @param  {any...} values - Values.
+ * @return {Iterator}
+ */
+Iterator.of = function () {
+  var args = arguments,
+    l = args.length,
+    i = 0;
 
-    /**
-     * This method returns `true`.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.13.0
-     * @category Util
-     * @returns {boolean} Returns `true`.
-     * @example
-     *
-     * _.times(2, _.stubTrue);
-     * // => [true, true]
-     */
-    function stubTrue() {
-      return true;
-    }
+  return new Iterator(function () {
+    if (i >= l) return {done: true};
 
-    /**
-     * Invokes the iteratee `n` times, returning an array of the results of
-     * each invocation. The iteratee is invoked with one argument; (index).
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category Util
-     * @param {number} n The number of times to invoke `iteratee`.
-     * @param {Function} [iteratee=_.identity] The function invoked per iteration.
-     * @returns {Array} Returns the array of results.
-     * @example
-     *
-     * _.times(3, String);
-     * // => ['0', '1', '2']
-     *
-     *  _.times(4, _.constant(0));
-     * // => [0, 0, 0, 0]
-     */
-    function times(n, iteratee) {
-      n = toInteger(n);
-      if (n < 1 || n > MAX_SAFE_INTEGER) {
-        return [];
-      }
-      var index = MAX_ARRAY_LENGTH,
-          length = nativeMin(n, MAX_ARRAY_LENGTH);
+    return {done: false, value: args[i++]};
+  });
+};
 
-      iteratee = getIteratee(iteratee);
-      n -= MAX_ARRAY_LENGTH;
+/**
+ * Returning an empty iterator.
+ *
+ * @return {Iterator}
+ */
+Iterator.empty = function () {
+  var iterator = new Iterator(function () {
+    return {done: true};
+  });
 
-      var result = baseTimes(length, iteratee);
-      while (++index < n) {
-        iteratee(index);
-      }
-      return result;
-    }
+  return iterator;
+};
 
-    /**
-     * Converts `value` to a property path array.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Util
-     * @param {*} value The value to convert.
-     * @returns {Array} Returns the new property path array.
-     * @example
-     *
-     * _.toPath('a.b.c');
-     * // => ['a', 'b', 'c']
-     *
-     * _.toPath('a[0].b.c');
-     * // => ['a', '0', 'b', 'c']
-     */
-    function toPath(value) {
-      if (isArray(value)) {
-        return arrayMap(value, toKey);
-      }
-      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));
-    }
+/**
+ * Returning an iterator over the given indexed sequence.
+ *
+ * @param  {string|Array} sequence - Target sequence.
+ * @return {Iterator}
+ */
+Iterator.fromSequence = function (sequence) {
+  var i = 0,
+    l = sequence.length;
 
-    /**
-     * Generates a unique ID. If `prefix` is given, the ID is appended to it.
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category Util
-     * @param {string} [prefix=''] The value to prefix the ID with.
-     * @returns {string} Returns the unique ID.
-     * @example
-     *
-     * _.uniqueId('contact_');
-     * // => 'contact_104'
-     *
-     * _.uniqueId();
-     * // => '105'
-     */
-    function uniqueId(prefix) {
-      var id = ++idCounter;
-      return toString(prefix) + id;
-    }
+  return new Iterator(function () {
+    if (i >= l) return {done: true};
 
-    /*------------------------------------------------------------------------*/
+    return {done: false, value: sequence[i++]};
+  });
+};
 
-    /**
-     * Adds two numbers.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.4.0
-     * @category Math
-     * @param {number} augend The first number in an addition.
-     * @param {number} addend The second number in an addition.
-     * @returns {number} Returns the total.
-     * @example
-     *
-     * _.add(6, 4);
-     * // => 10
-     */
-    var add = createMathOperation(function(augend, addend) {
-      return augend + addend;
-    }, 0);
+/**
+ * Returning whether the given value is an iterator.
+ *
+ * @param  {any} value - Value.
+ * @return {boolean}
+ */
+Iterator.is = function (value) {
+  if (value instanceof Iterator) return true;
 
-    /**
-     * Computes `number` rounded up to `precision`.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.10.0
-     * @category Math
-     * @param {number} number The number to round up.
-     * @param {number} [precision=0] The precision to round up to.
-     * @returns {number} Returns the rounded up number.
-     * @example
-     *
-     * _.ceil(4.006);
-     * // => 5
-     *
-     * _.ceil(6.004, 2);
-     * // => 6.01
-     *
-     * _.ceil(6040, -2);
-     * // => 6100
-     */
-    var ceil = createRound('ceil');
+  return (
+    typeof value === 'object' &&
+    value !== null &&
+    typeof value.next === 'function'
+  );
+};
 
-    /**
-     * Divide two numbers.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.7.0
-     * @category Math
-     * @param {number} dividend The first number in a division.
-     * @param {number} divisor The second number in a division.
-     * @returns {number} Returns the quotient.
-     * @example
-     *
-     * _.divide(6, 4);
-     * // => 1.5
-     */
-    var divide = createMathOperation(function(dividend, divisor) {
-      return dividend / divisor;
-    }, 1);
+/**
+ * Exporting.
+ */
+var iterator = Iterator;
 
-    /**
-     * Computes `number` rounded down to `precision`.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.10.0
-     * @category Math
-     * @param {number} number The number to round down.
-     * @param {number} [precision=0] The precision to round down to.
-     * @returns {number} Returns the rounded down number.
-     * @example
-     *
-     * _.floor(4.006);
-     * // => 4
-     *
-     * _.floor(0.046, 2);
-     * // => 0.04
-     *
-     * _.floor(4060, -2);
-     * // => 4000
-     */
-    var floor = createRound('floor');
+/**
+ * Mnemonist FixedDeque
+ * =====================
+ *
+ * Fixed capacity double-ended queue implemented as ring deque.
+ */
 
-    /**
-     * Computes the maximum value of `array`. If `array` is empty or falsey,
-     * `undefined` is returned.
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category Math
-     * @param {Array} array The array to iterate over.
-     * @returns {*} Returns the maximum value.
-     * @example
-     *
-     * _.max([4, 2, 8, 6]);
-     * // => 8
-     *
-     * _.max([]);
-     * // => undefined
-     */
-    function max(array) {
-      return (array && array.length)
-        ? baseExtremum(array, identity, baseGt)
-        : undefined$1;
-    }
+/**
+ * FixedDeque.
+ *
+ * @constructor
+ */
+function FixedDeque(ArrayClass, capacity) {
 
-    /**
-     * This method is like `_.max` except that it accepts `iteratee` which is
-     * invoked for each element in `array` to generate the criterion by which
-     * the value is ranked. The iteratee is invoked with one argument: (value).
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Math
-     * @param {Array} array The array to iterate over.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {*} Returns the maximum value.
-     * @example
-     *
-     * var objects = [{ 'n': 1 }, { 'n': 2 }];
-     *
-     * _.maxBy(objects, function(o) { return o.n; });
-     * // => { 'n': 2 }
-     *
-     * // The `_.property` iteratee shorthand.
-     * _.maxBy(objects, 'n');
-     * // => { 'n': 2 }
-     */
-    function maxBy(array, iteratee) {
-      return (array && array.length)
-        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)
-        : undefined$1;
-    }
+  if (arguments.length < 2)
+    throw new Error('mnemonist/fixed-deque: expecting an Array class and a capacity.');
 
-    /**
-     * Computes the mean of the values in `array`.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Math
-     * @param {Array} array The array to iterate over.
-     * @returns {number} Returns the mean.
-     * @example
-     *
-     * _.mean([4, 2, 8, 6]);
-     * // => 5
-     */
-    function mean(array) {
-      return baseMean(array, identity);
-    }
+  if (typeof capacity !== 'number' || capacity <= 0)
+    throw new Error('mnemonist/fixed-deque: `capacity` should be a positive number.');
 
-    /**
-     * This method is like `_.mean` except that it accepts `iteratee` which is
-     * invoked for each element in `array` to generate the value to be averaged.
-     * The iteratee is invoked with one argument: (value).
-     *
-     * @static
-     * @memberOf _
-     * @since 4.7.0
-     * @category Math
-     * @param {Array} array The array to iterate over.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {number} Returns the mean.
-     * @example
-     *
-     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];
-     *
-     * _.meanBy(objects, function(o) { return o.n; });
-     * // => 5
-     *
-     * // The `_.property` iteratee shorthand.
-     * _.meanBy(objects, 'n');
-     * // => 5
-     */
-    function meanBy(array, iteratee) {
-      return baseMean(array, getIteratee(iteratee, 2));
-    }
+  this.ArrayClass = ArrayClass;
+  this.capacity = capacity;
+  this.items = new ArrayClass(this.capacity);
+  this.clear();
+}
 
-    /**
-     * Computes the minimum value of `array`. If `array` is empty or falsey,
-     * `undefined` is returned.
-     *
-     * @static
-     * @since 0.1.0
-     * @memberOf _
-     * @category Math
-     * @param {Array} array The array to iterate over.
-     * @returns {*} Returns the minimum value.
-     * @example
-     *
-     * _.min([4, 2, 8, 6]);
-     * // => 2
-     *
-     * _.min([]);
-     * // => undefined
-     */
-    function min(array) {
-      return (array && array.length)
-        ? baseExtremum(array, identity, baseLt)
-        : undefined$1;
-    }
+/**
+ * Method used to clear the structure.
+ *
+ * @return {undefined}
+ */
+FixedDeque.prototype.clear = function() {
 
-    /**
-     * This method is like `_.min` except that it accepts `iteratee` which is
-     * invoked for each element in `array` to generate the criterion by which
-     * the value is ranked. The iteratee is invoked with one argument: (value).
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Math
-     * @param {Array} array The array to iterate over.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {*} Returns the minimum value.
-     * @example
-     *
-     * var objects = [{ 'n': 1 }, { 'n': 2 }];
-     *
-     * _.minBy(objects, function(o) { return o.n; });
-     * // => { 'n': 1 }
-     *
-     * // The `_.property` iteratee shorthand.
-     * _.minBy(objects, 'n');
-     * // => { 'n': 1 }
-     */
-    function minBy(array, iteratee) {
-      return (array && array.length)
-        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)
-        : undefined$1;
-    }
+  // Properties
+  this.start = 0;
+  this.size = 0;
+};
 
-    /**
-     * Multiply two numbers.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.7.0
-     * @category Math
-     * @param {number} multiplier The first number in a multiplication.
-     * @param {number} multiplicand The second number in a multiplication.
-     * @returns {number} Returns the product.
-     * @example
-     *
-     * _.multiply(6, 4);
-     * // => 24
-     */
-    var multiply = createMathOperation(function(multiplier, multiplicand) {
-      return multiplier * multiplicand;
-    }, 1);
+/**
+ * Method used to append a value to the deque.
+ *
+ * @param  {any}    item - Item to append.
+ * @return {number}      - Returns the new size of the deque.
+ */
+FixedDeque.prototype.push = function(item) {
+  if (this.size === this.capacity)
+    throw new Error('mnemonist/fixed-deque.push: deque capacity (' + this.capacity + ') exceeded!');
+
+  var index = (this.start + this.size) % this.capacity;
+
+  this.items[index] = item;
+
+  return ++this.size;
+};
 
-    /**
-     * Computes `number` rounded to `precision`.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.10.0
-     * @category Math
-     * @param {number} number The number to round.
-     * @param {number} [precision=0] The precision to round to.
-     * @returns {number} Returns the rounded number.
-     * @example
-     *
-     * _.round(4.006);
-     * // => 4
-     *
-     * _.round(4.006, 2);
-     * // => 4.01
-     *
-     * _.round(4060, -2);
-     * // => 4100
-     */
-    var round = createRound('round');
+/**
+ * Method used to prepend a value to the deque.
+ *
+ * @param  {any}    item - Item to prepend.
+ * @return {number}      - Returns the new size of the deque.
+ */
+FixedDeque.prototype.unshift = function(item) {
+  if (this.size === this.capacity)
+    throw new Error('mnemonist/fixed-deque.unshift: deque capacity (' + this.capacity + ') exceeded!');
 
-    /**
-     * Subtract two numbers.
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Math
-     * @param {number} minuend The first number in a subtraction.
-     * @param {number} subtrahend The second number in a subtraction.
-     * @returns {number} Returns the difference.
-     * @example
-     *
-     * _.subtract(6, 4);
-     * // => 2
-     */
-    var subtract = createMathOperation(function(minuend, subtrahend) {
-      return minuend - subtrahend;
-    }, 0);
+  var index = this.start - 1;
 
-    /**
-     * Computes the sum of the values in `array`.
-     *
-     * @static
-     * @memberOf _
-     * @since 3.4.0
-     * @category Math
-     * @param {Array} array The array to iterate over.
-     * @returns {number} Returns the sum.
-     * @example
-     *
-     * _.sum([4, 2, 8, 6]);
-     * // => 20
-     */
-    function sum(array) {
-      return (array && array.length)
-        ? baseSum(array, identity)
-        : 0;
-    }
+  if (this.start === 0)
+    index = this.capacity - 1;
 
-    /**
-     * This method is like `_.sum` except that it accepts `iteratee` which is
-     * invoked for each element in `array` to generate the value to be summed.
-     * The iteratee is invoked with one argument: (value).
-     *
-     * @static
-     * @memberOf _
-     * @since 4.0.0
-     * @category Math
-     * @param {Array} array The array to iterate over.
-     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.
-     * @returns {number} Returns the sum.
-     * @example
-     *
-     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];
-     *
-     * _.sumBy(objects, function(o) { return o.n; });
-     * // => 20
-     *
-     * // The `_.property` iteratee shorthand.
-     * _.sumBy(objects, 'n');
-     * // => 20
-     */
-    function sumBy(array, iteratee) {
-      return (array && array.length)
-        ? baseSum(array, getIteratee(iteratee, 2))
-        : 0;
-    }
+  this.items[index] = item;
+  this.start = index;
 
-    /*------------------------------------------------------------------------*/
+  return ++this.size;
+};
 
-    // Add methods that return wrapped values in chain sequences.
-    lodash.after = after;
-    lodash.ary = ary;
-    lodash.assign = assign;
-    lodash.assignIn = assignIn;
-    lodash.assignInWith = assignInWith;
-    lodash.assignWith = assignWith;
-    lodash.at = at;
-    lodash.before = before;
-    lodash.bind = bind;
-    lodash.bindAll = bindAll;
-    lodash.bindKey = bindKey;
-    lodash.castArray = castArray;
-    lodash.chain = chain;
-    lodash.chunk = chunk;
-    lodash.compact = compact;
-    lodash.concat = concat;
-    lodash.cond = cond;
-    lodash.conforms = conforms;
-    lodash.constant = constant;
-    lodash.countBy = countBy;
-    lodash.create = create;
-    lodash.curry = curry;
-    lodash.curryRight = curryRight;
-    lodash.debounce = debounce;
-    lodash.defaults = defaults;
-    lodash.defaultsDeep = defaultsDeep;
-    lodash.defer = defer;
-    lodash.delay = delay;
-    lodash.difference = difference;
-    lodash.differenceBy = differenceBy;
-    lodash.differenceWith = differenceWith;
-    lodash.drop = drop;
-    lodash.dropRight = dropRight;
-    lodash.dropRightWhile = dropRightWhile;
-    lodash.dropWhile = dropWhile;
-    lodash.fill = fill;
-    lodash.filter = filter;
-    lodash.flatMap = flatMap;
-    lodash.flatMapDeep = flatMapDeep;
-    lodash.flatMapDepth = flatMapDepth;
-    lodash.flatten = flatten;
-    lodash.flattenDeep = flattenDeep;
-    lodash.flattenDepth = flattenDepth;
-    lodash.flip = flip;
-    lodash.flow = flow;
-    lodash.flowRight = flowRight;
-    lodash.fromPairs = fromPairs;
-    lodash.functions = functions;
-    lodash.functionsIn = functionsIn;
-    lodash.groupBy = groupBy;
-    lodash.initial = initial;
-    lodash.intersection = intersection;
-    lodash.intersectionBy = intersectionBy;
-    lodash.intersectionWith = intersectionWith;
-    lodash.invert = invert;
-    lodash.invertBy = invertBy;
-    lodash.invokeMap = invokeMap;
-    lodash.iteratee = iteratee;
-    lodash.keyBy = keyBy;
-    lodash.keys = keys;
-    lodash.keysIn = keysIn;
-    lodash.map = map;
-    lodash.mapKeys = mapKeys;
-    lodash.mapValues = mapValues;
-    lodash.matches = matches;
-    lodash.matchesProperty = matchesProperty;
-    lodash.memoize = memoize;
-    lodash.merge = merge;
-    lodash.mergeWith = mergeWith;
-    lodash.method = method;
-    lodash.methodOf = methodOf;
-    lodash.mixin = mixin;
-    lodash.negate = negate;
-    lodash.nthArg = nthArg;
-    lodash.omit = omit;
-    lodash.omitBy = omitBy;
-    lodash.once = once;
-    lodash.orderBy = orderBy;
-    lodash.over = over;
-    lodash.overArgs = overArgs;
-    lodash.overEvery = overEvery;
-    lodash.overSome = overSome;
-    lodash.partial = partial;
-    lodash.partialRight = partialRight;
-    lodash.partition = partition;
-    lodash.pick = pick;
-    lodash.pickBy = pickBy;
-    lodash.property = property;
-    lodash.propertyOf = propertyOf;
-    lodash.pull = pull;
-    lodash.pullAll = pullAll;
-    lodash.pullAllBy = pullAllBy;
-    lodash.pullAllWith = pullAllWith;
-    lodash.pullAt = pullAt;
-    lodash.range = range;
-    lodash.rangeRight = rangeRight;
-    lodash.rearg = rearg;
-    lodash.reject = reject;
-    lodash.remove = remove;
-    lodash.rest = rest;
-    lodash.reverse = reverse;
-    lodash.sampleSize = sampleSize;
-    lodash.set = set;
-    lodash.setWith = setWith;
-    lodash.shuffle = shuffle;
-    lodash.slice = slice;
-    lodash.sortBy = sortBy;
-    lodash.sortedUniq = sortedUniq;
-    lodash.sortedUniqBy = sortedUniqBy;
-    lodash.split = split;
-    lodash.spread = spread;
-    lodash.tail = tail;
-    lodash.take = take;
-    lodash.takeRight = takeRight;
-    lodash.takeRightWhile = takeRightWhile;
-    lodash.takeWhile = takeWhile;
-    lodash.tap = tap;
-    lodash.throttle = throttle;
-    lodash.thru = thru;
-    lodash.toArray = toArray;
-    lodash.toPairs = toPairs;
-    lodash.toPairsIn = toPairsIn;
-    lodash.toPath = toPath;
-    lodash.toPlainObject = toPlainObject;
-    lodash.transform = transform;
-    lodash.unary = unary;
-    lodash.union = union;
-    lodash.unionBy = unionBy;
-    lodash.unionWith = unionWith;
-    lodash.uniq = uniq;
-    lodash.uniqBy = uniqBy;
-    lodash.uniqWith = uniqWith;
-    lodash.unset = unset;
-    lodash.unzip = unzip;
-    lodash.unzipWith = unzipWith;
-    lodash.update = update;
-    lodash.updateWith = updateWith;
-    lodash.values = values;
-    lodash.valuesIn = valuesIn;
-    lodash.without = without;
-    lodash.words = words;
-    lodash.wrap = wrap;
-    lodash.xor = xor;
-    lodash.xorBy = xorBy;
-    lodash.xorWith = xorWith;
-    lodash.zip = zip;
-    lodash.zipObject = zipObject;
-    lodash.zipObjectDeep = zipObjectDeep;
-    lodash.zipWith = zipWith;
+/**
+ * Method used to pop the deque.
+ *
+ * @return {any} - Returns the popped item.
+ */
+FixedDeque.prototype.pop = function() {
+  if (this.size === 0)
+    return;
 
-    // Add aliases.
-    lodash.entries = toPairs;
-    lodash.entriesIn = toPairsIn;
-    lodash.extend = assignIn;
-    lodash.extendWith = assignInWith;
+  const index = (this.start + this.size - 1) % this.capacity;
 
-    // Add methods to `lodash.prototype`.
-    mixin(lodash, lodash);
+  this.size--;
 
-    /*------------------------------------------------------------------------*/
+  return this.items[index];
+};
 
-    // Add methods that return unwrapped values in chain sequences.
-    lodash.add = add;
-    lodash.attempt = attempt;
-    lodash.camelCase = camelCase;
-    lodash.capitalize = capitalize;
-    lodash.ceil = ceil;
-    lodash.clamp = clamp;
-    lodash.clone = clone;
-    lodash.cloneDeep = cloneDeep;
-    lodash.cloneDeepWith = cloneDeepWith;
-    lodash.cloneWith = cloneWith;
-    lodash.conformsTo = conformsTo;
-    lodash.deburr = deburr;
-    lodash.defaultTo = defaultTo;
-    lodash.divide = divide;
-    lodash.endsWith = endsWith;
-    lodash.eq = eq;
-    lodash.escape = escape;
-    lodash.escapeRegExp = escapeRegExp;
-    lodash.every = every;
-    lodash.find = find;
-    lodash.findIndex = findIndex;
-    lodash.findKey = findKey;
-    lodash.findLast = findLast;
-    lodash.findLastIndex = findLastIndex;
-    lodash.findLastKey = findLastKey;
-    lodash.floor = floor;
-    lodash.forEach = forEach;
-    lodash.forEachRight = forEachRight;
-    lodash.forIn = forIn;
-    lodash.forInRight = forInRight;
-    lodash.forOwn = forOwn;
-    lodash.forOwnRight = forOwnRight;
-    lodash.get = get;
-    lodash.gt = gt;
-    lodash.gte = gte;
-    lodash.has = has;
-    lodash.hasIn = hasIn;
-    lodash.head = head;
-    lodash.identity = identity;
-    lodash.includes = includes;
-    lodash.indexOf = indexOf;
-    lodash.inRange = inRange;
-    lodash.invoke = invoke;
-    lodash.isArguments = isArguments;
-    lodash.isArray = isArray;
-    lodash.isArrayBuffer = isArrayBuffer;
-    lodash.isArrayLike = isArrayLike;
-    lodash.isArrayLikeObject = isArrayLikeObject;
-    lodash.isBoolean = isBoolean;
-    lodash.isBuffer = isBuffer;
-    lodash.isDate = isDate;
-    lodash.isElement = isElement;
-    lodash.isEmpty = isEmpty;
-    lodash.isEqual = isEqual;
-    lodash.isEqualWith = isEqualWith;
-    lodash.isError = isError;
-    lodash.isFinite = isFinite;
-    lodash.isFunction = isFunction;
-    lodash.isInteger = isInteger;
-    lodash.isLength = isLength;
-    lodash.isMap = isMap;
-    lodash.isMatch = isMatch;
-    lodash.isMatchWith = isMatchWith;
-    lodash.isNaN = isNaN;
-    lodash.isNative = isNative;
-    lodash.isNil = isNil;
-    lodash.isNull = isNull;
-    lodash.isNumber = isNumber;
-    lodash.isObject = isObject;
-    lodash.isObjectLike = isObjectLike;
-    lodash.isPlainObject = isPlainObject;
-    lodash.isRegExp = isRegExp;
-    lodash.isSafeInteger = isSafeInteger;
-    lodash.isSet = isSet;
-    lodash.isString = isString;
-    lodash.isSymbol = isSymbol;
-    lodash.isTypedArray = isTypedArray;
-    lodash.isUndefined = isUndefined;
-    lodash.isWeakMap = isWeakMap;
-    lodash.isWeakSet = isWeakSet;
-    lodash.join = join;
-    lodash.kebabCase = kebabCase;
-    lodash.last = last;
-    lodash.lastIndexOf = lastIndexOf;
-    lodash.lowerCase = lowerCase;
-    lodash.lowerFirst = lowerFirst;
-    lodash.lt = lt;
-    lodash.lte = lte;
-    lodash.max = max;
-    lodash.maxBy = maxBy;
-    lodash.mean = mean;
-    lodash.meanBy = meanBy;
-    lodash.min = min;
-    lodash.minBy = minBy;
-    lodash.stubArray = stubArray;
-    lodash.stubFalse = stubFalse;
-    lodash.stubObject = stubObject;
-    lodash.stubString = stubString;
-    lodash.stubTrue = stubTrue;
-    lodash.multiply = multiply;
-    lodash.nth = nth;
-    lodash.noConflict = noConflict;
-    lodash.noop = noop;
-    lodash.now = now;
-    lodash.pad = pad;
-    lodash.padEnd = padEnd;
-    lodash.padStart = padStart;
-    lodash.parseInt = parseInt;
-    lodash.random = random;
-    lodash.reduce = reduce;
-    lodash.reduceRight = reduceRight;
-    lodash.repeat = repeat;
-    lodash.replace = replace;
-    lodash.result = result;
-    lodash.round = round;
-    lodash.runInContext = runInContext;
-    lodash.sample = sample;
-    lodash.size = size;
-    lodash.snakeCase = snakeCase;
-    lodash.some = some;
-    lodash.sortedIndex = sortedIndex;
-    lodash.sortedIndexBy = sortedIndexBy;
-    lodash.sortedIndexOf = sortedIndexOf;
-    lodash.sortedLastIndex = sortedLastIndex;
-    lodash.sortedLastIndexBy = sortedLastIndexBy;
-    lodash.sortedLastIndexOf = sortedLastIndexOf;
-    lodash.startCase = startCase;
-    lodash.startsWith = startsWith;
-    lodash.subtract = subtract;
-    lodash.sum = sum;
-    lodash.sumBy = sumBy;
-    lodash.template = template;
-    lodash.times = times;
-    lodash.toFinite = toFinite;
-    lodash.toInteger = toInteger;
-    lodash.toLength = toLength;
-    lodash.toLower = toLower;
-    lodash.toNumber = toNumber;
-    lodash.toSafeInteger = toSafeInteger;
-    lodash.toString = toString;
-    lodash.toUpper = toUpper;
-    lodash.trim = trim;
-    lodash.trimEnd = trimEnd;
-    lodash.trimStart = trimStart;
-    lodash.truncate = truncate;
-    lodash.unescape = unescape;
-    lodash.uniqueId = uniqueId;
-    lodash.upperCase = upperCase;
-    lodash.upperFirst = upperFirst;
+/**
+ * Method used to shift the deque.
+ *
+ * @return {any} - Returns the shifted item.
+ */
+FixedDeque.prototype.shift = function() {
+  if (this.size === 0)
+    return;
+
+  var index = this.start;
+
+  this.size--;
+  this.start++;
+
+  if (this.start === this.capacity)
+    this.start = 0;
+
+  return this.items[index];
+};
+
+/**
+ * Method used to peek the first value of the deque.
+ *
+ * @return {any}
+ */
+FixedDeque.prototype.peekFirst = function() {
+  if (this.size === 0)
+    return;
+
+  return this.items[this.start];
+};
+
+/**
+ * Method used to peek the last value of the deque.
+ *
+ * @return {any}
+ */
+FixedDeque.prototype.peekLast = function() {
+  if (this.size === 0)
+    return;
+
+  var index = this.start + this.size - 1;
+
+  if (index > this.capacity)
+    index -= this.capacity;
+
+  return this.items[index];
+};
+
+/**
+ * Method used to get the desired value of the deque.
+ *
+ * @param  {number} index
+ * @return {any}
+ */
+FixedDeque.prototype.get = function(index) {
+  if (this.size === 0)
+    return;
+
+  index = this.start + index;
+
+  if (index > this.capacity)
+    index -= this.capacity;
+
+  return this.items[index];
+};
+
+/**
+ * Method used to iterate over the deque.
+ *
+ * @param  {function}  callback - Function to call for each item.
+ * @param  {object}    scope    - Optional scope.
+ * @return {undefined}
+ */
+FixedDeque.prototype.forEach = function(callback, scope) {
+  scope = arguments.length > 1 ? scope : this;
+
+  var c = this.capacity,
+      l = this.size,
+      i = this.start,
+      j = 0;
+
+  while (j < l) {
+    callback.call(scope, this.items[i], j, this);
+    i++;
+    j++;
+
+    if (i === c)
+      i = 0;
+  }
+};
 
-    // Add aliases.
-    lodash.each = forEach;
-    lodash.eachRight = forEachRight;
-    lodash.first = head;
+/**
+ * Method used to convert the deque to a JavaScript array.
+ *
+ * @return {array}
+ */
+// TODO: optional array class as argument?
+FixedDeque.prototype.toArray = function() {
 
-    mixin(lodash, (function() {
-      var source = {};
-      baseForOwn(lodash, function(func, methodName) {
-        if (!hasOwnProperty.call(lodash.prototype, methodName)) {
-          source[methodName] = func;
-        }
-      });
-      return source;
-    }()), { 'chain': false });
+  // Optimization
+  var offset = this.start + this.size;
 
-    /*------------------------------------------------------------------------*/
+  if (offset < this.capacity)
+    return this.items.slice(this.start, offset);
 
-    /**
-     * The semantic version number.
-     *
-     * @static
-     * @memberOf _
-     * @type {string}
-     */
-    lodash.VERSION = VERSION;
+  var array = new this.ArrayClass(this.size),
+      c = this.capacity,
+      l = this.size,
+      i = this.start,
+      j = 0;
 
-    // Assign default placeholders.
-    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {
-      lodash[methodName].placeholder = lodash;
-    });
+  while (j < l) {
+    array[j] = this.items[i];
+    i++;
+    j++;
 
-    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.
-    arrayEach(['drop', 'take'], function(methodName, index) {
-      LazyWrapper.prototype[methodName] = function(n) {
-        n = n === undefined$1 ? 1 : nativeMax(toInteger(n), 0);
+    if (i === c)
+      i = 0;
+  }
 
-        var result = (this.__filtered__ && !index)
-          ? new LazyWrapper(this)
-          : this.clone();
+  return array;
+};
 
-        if (result.__filtered__) {
-          result.__takeCount__ = nativeMin(n, result.__takeCount__);
-        } else {
-          result.__views__.push({
-            'size': nativeMin(n, MAX_ARRAY_LENGTH),
-            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')
-          });
-        }
-        return result;
-      };
+/**
+ * Method used to create an iterator over the deque's values.
+ *
+ * @return {Iterator}
+ */
+FixedDeque.prototype.values = function() {
+  var items = this.items,
+      c = this.capacity,
+      l = this.size,
+      i = this.start,
+      j = 0;
 
-      LazyWrapper.prototype[methodName + 'Right'] = function(n) {
-        return this.reverse()[methodName](n).reverse();
+  return new iterator(function() {
+    if (j >= l)
+      return {
+        done: true
       };
-    });
 
-    // Add `LazyWrapper` methods that accept an `iteratee` value.
-    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {
-      var type = index + 1,
-          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;
+    var value = items[i];
 
-      LazyWrapper.prototype[methodName] = function(iteratee) {
-        var result = this.clone();
-        result.__iteratees__.push({
-          'iteratee': getIteratee(iteratee, 3),
-          'type': type
-        });
-        result.__filtered__ = result.__filtered__ || isFilter;
-        return result;
+    i++;
+    j++;
+
+    if (i === c)
+      i = 0;
+
+    return {
+      value: value,
+      done: false
+    };
+  });
+};
+
+/**
+ * Method used to create an iterator over the deque's entries.
+ *
+ * @return {Iterator}
+ */
+FixedDeque.prototype.entries = function() {
+  var items = this.items,
+      c = this.capacity,
+      l = this.size,
+      i = this.start,
+      j = 0;
+
+  return new iterator(function() {
+    if (j >= l)
+      return {
+        done: true
       };
-    });
 
-    // Add `LazyWrapper` methods for `_.head` and `_.last`.
-    arrayEach(['head', 'last'], function(methodName, index) {
-      var takeName = 'take' + (index ? 'Right' : '');
+    var value = items[i];
+
+    i++;
+
+    if (i === c)
+      i = 0;
+
+    return {
+      value: [j++, value],
+      done: false
+    };
+  });
+};
+
+/**
+ * Attaching the #.values method to Symbol.iterator if possible.
+ */
+if (typeof Symbol !== 'undefined')
+  FixedDeque.prototype[Symbol.iterator] = FixedDeque.prototype.values;
+
+/**
+ * Convenience known methods.
+ */
+FixedDeque.prototype.inspect = function() {
+  var array = this.toArray();
+
+  array.type = this.ArrayClass.name;
+  array.capacity = this.capacity;
+
+  // Trick so that node displays the name of the constructor
+  Object.defineProperty(array, 'constructor', {
+    value: FixedDeque,
+    enumerable: false
+  });
+
+  return array;
+};
+
+if (typeof Symbol !== 'undefined')
+  FixedDeque.prototype[Symbol.for('nodejs.util.inspect.custom')] = FixedDeque.prototype.inspect;
+
+/**
+ * Static @.from function taking an arbitrary iterable & converting it into
+ * a deque.
+ *
+ * @param  {Iterable} iterable   - Target iterable.
+ * @param  {function} ArrayClass - Array class to use.
+ * @param  {number}   capacity   - Desired capacity.
+ * @return {FiniteStack}
+ */
+FixedDeque.from = function(iterable, ArrayClass, capacity) {
+  if (arguments.length < 3) {
+    capacity = iterables.guessLength(iterable);
+
+    if (typeof capacity !== 'number')
+      throw new Error('mnemonist/fixed-deque.from: could not guess iterable length. Please provide desired capacity as last argument.');
+  }
+
+  var deque = new FixedDeque(ArrayClass, capacity);
+
+  if (iterables.isArrayLike(iterable)) {
+    var i, l;
+
+    for (i = 0, l = iterable.length; i < l; i++)
+      deque.items[i] = iterable[i];
+
+    deque.size = l;
+
+    return deque;
+  }
+
+  iterables.forEach(iterable, function(value) {
+    deque.push(value);
+  });
+
+  return deque;
+};
+
+/**
+ * Exporting.
+ */
+var fixedDeque = FixedDeque;
+
+/**
+ * Graphology Traversal Utils
+ * ===========================
+ *
+ * Miscellaneous utils used throughout the library.
+ */
+function TraversalRecord$2(node, attr, depth) {
+  this.node = node;
+  this.attributes = attr;
+  this.depth = depth;
+}
+
+var TraversalRecord_1 = TraversalRecord$2;
+
+var utils = {
+	TraversalRecord: TraversalRecord_1
+};
+
+/**
+ * Graphology Traversal BFS
+ * =========================
+ *
+ * Breadth-First Search traversal function.
+ */
+
+var TraversalRecord$1 = utils.TraversalRecord;
+
+/**
+ * BFS traversal in the given graph using a callback function
+ *
+ * @param {Graph}    graph    - Target graph.
+ * @param {function} callback - Iteration callback.
+ */
+function bfs(graph, callback) {
+  if (!isGraph(graph))
+    throw new Error('graphology-traversal/bfs: expecting a graphology instance.');
+
+  if (typeof callback !== 'function')
+    throw new Error('graphology-traversal/bfs: given callback is not a function.');
+
+  // Early termination
+  if (graph.order === 0)
+    return;
 
-      LazyWrapper.prototype[methodName] = function() {
-        return this[takeName](1).value()[0];
-      };
-    });
+  var seen = new Set();
+  var queue = new fixedDeque(Array, graph.order);
+  var record, depth;
 
-    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.
-    arrayEach(['initial', 'tail'], function(methodName, index) {
-      var dropName = 'drop' + (index ? '' : 'Right');
+  function neighborCallback(neighbor, attr) {
+    if (seen.has(neighbor))
+      return;
 
-      LazyWrapper.prototype[methodName] = function() {
-        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);
-      };
-    });
+    seen.add(neighbor);
+    queue.push(new TraversalRecord$1(neighbor, attr, depth + 1));
+  }
 
-    LazyWrapper.prototype.compact = function() {
-      return this.filter(identity);
-    };
+  graph.forEachNode(function(node, attr) {
+    if (seen.has(node))
+      return;
 
-    LazyWrapper.prototype.find = function(predicate) {
-      return this.filter(predicate).head();
-    };
+    seen.add(node);
+    queue.push(new TraversalRecord$1(node, attr, 0));
 
-    LazyWrapper.prototype.findLast = function(predicate) {
-      return this.reverse().find(predicate);
-    };
+    while (queue.size !== 0) {
+      record = queue.shift();
+      depth = record.depth;
 
-    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {
-      if (typeof path == 'function') {
-        return new LazyWrapper(this);
-      }
-      return this.map(function(value) {
-        return baseInvoke(value, path, args);
-      });
-    });
+      callback(record.node, record.attributes, depth);
 
-    LazyWrapper.prototype.reject = function(predicate) {
-      return this.filter(negate(getIteratee(predicate)));
-    };
+      graph.forEachOutboundNeighbor(record.node, neighborCallback);
+    }
+  });
+}
 
-    LazyWrapper.prototype.slice = function(start, end) {
-      start = toInteger(start);
+/**
+ * BFS traversal in the given graph, starting from the given node, using a
+ * callback function.
+ *
+ * @param {Graph}    graph    - Target graph.
+ * @param {string}   node     - Starting node.
+ * @param {function} callback - Iteration callback.
+ */
+function bfsFromNode(graph, node, callback) {
+  if (!isGraph(graph))
+    throw new Error('graphology-traversal/dfs: expecting a graphology instance.');
 
-      var result = this;
-      if (result.__filtered__ && (start > 0 || end < 0)) {
-        return new LazyWrapper(result);
-      }
-      if (start < 0) {
-        result = result.takeRight(-start);
-      } else if (start) {
-        result = result.drop(start);
-      }
-      if (end !== undefined$1) {
-        end = toInteger(end);
-        result = end < 0 ? result.dropRight(-end) : result.take(end - start);
-      }
-      return result;
-    };
+  if (typeof callback !== 'function')
+    throw new Error('graphology-traversal/dfs: given callback is not a function.');
 
-    LazyWrapper.prototype.takeRightWhile = function(predicate) {
-      return this.reverse().takeWhile(predicate).reverse();
-    };
+  // Early termination
+  if (graph.order === 0)
+    return;
 
-    LazyWrapper.prototype.toArray = function() {
-      return this.take(MAX_ARRAY_LENGTH);
-    };
+  node = '' + node;
 
-    // Add `LazyWrapper` methods to `lodash.prototype`.
-    baseForOwn(LazyWrapper.prototype, function(func, methodName) {
-      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),
-          isTaker = /^(?:head|last)$/.test(methodName),
-          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],
-          retUnwrapped = isTaker || /^find/.test(methodName);
+  var seen = new Set();
+  var queue = new fixedDeque(Array, graph.order);
+  var depth, record;
 
-      if (!lodashFunc) {
-        return;
-      }
-      lodash.prototype[methodName] = function() {
-        var value = this.__wrapped__,
-            args = isTaker ? [1] : arguments,
-            isLazy = value instanceof LazyWrapper,
-            iteratee = args[0],
-            useLazy = isLazy || isArray(value);
+  function neighborCallback(neighbor, attr) {
+    if (seen.has(neighbor))
+      return;
 
-        var interceptor = function(value) {
-          var result = lodashFunc.apply(lodash, arrayPush([value], args));
-          return (isTaker && chainAll) ? result[0] : result;
-        };
+    seen.add(neighbor);
+    queue.push(new TraversalRecord$1(neighbor, attr, depth + 1));
+  }
 
-        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {
-          // Avoid lazy use if the iteratee has a "length" value other than `1`.
-          isLazy = useLazy = false;
-        }
-        var chainAll = this.__chain__,
-            isHybrid = !!this.__actions__.length,
-            isUnwrapped = retUnwrapped && !chainAll,
-            onlyLazy = isLazy && !isHybrid;
+  seen.add(node);
+  queue.push(new TraversalRecord$1(node, graph.getNodeAttributes(node), 0));
 
-        if (!retUnwrapped && useLazy) {
-          value = onlyLazy ? value : new LazyWrapper(this);
-          var result = func.apply(value, args);
-          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined$1 });
-          return new LodashWrapper(result, chainAll);
-        }
-        if (isUnwrapped && onlyLazy) {
-          return func.apply(this, args);
-        }
-        result = this.thru(interceptor);
-        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;
-      };
-    });
+  while (queue.size !== 0) {
+    record = queue.shift();
+    depth = record.depth;
 
-    // Add `Array` methods to `lodash.prototype`.
-    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {
-      var func = arrayProto[methodName],
-          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',
-          retUnwrapped = /^(?:pop|shift)$/.test(methodName);
+    callback(record.node, record.attributes, depth);
 
-      lodash.prototype[methodName] = function() {
-        var args = arguments;
-        if (retUnwrapped && !this.__chain__) {
-          var value = this.value();
-          return func.apply(isArray(value) ? value : [], args);
-        }
-        return this[chainName](function(value) {
-          return func.apply(isArray(value) ? value : [], args);
-        });
-      };
-    });
+    graph.forEachOutboundNeighbor(record.node, neighborCallback);
+  }
+}
 
-    // Map minified method names to their real names.
-    baseForOwn(LazyWrapper.prototype, function(func, methodName) {
-      var lodashFunc = lodash[methodName];
-      if (lodashFunc) {
-        var key = lodashFunc.name + '';
-        if (!hasOwnProperty.call(realNames, key)) {
-          realNames[key] = [];
-        }
-        realNames[key].push({ 'name': methodName, 'func': lodashFunc });
-      }
-    });
+var bfs_2 = bfs;
+var bfsFromNode_1 = bfsFromNode;
 
-    realNames[createHybrid(undefined$1, WRAP_BIND_KEY_FLAG).name] = [{
-      'name': 'wrapper',
-      'func': undefined$1
-    }];
+var bfs_1 = {
+	bfs: bfs_2,
+	bfsFromNode: bfsFromNode_1
+};
 
-    // Add methods to `LazyWrapper`.
-    LazyWrapper.prototype.clone = lazyClone;
-    LazyWrapper.prototype.reverse = lazyReverse;
-    LazyWrapper.prototype.value = lazyValue;
+/**
+ * Graphology Traversal DFS
+ * =========================
+ *
+ * Depth-First Search traversal function.
+ */
 
-    // Add chain sequence methods to the `lodash` wrapper.
-    lodash.prototype.at = wrapperAt;
-    lodash.prototype.chain = wrapperChain;
-    lodash.prototype.commit = wrapperCommit;
-    lodash.prototype.next = wrapperNext;
-    lodash.prototype.plant = wrapperPlant;
-    lodash.prototype.reverse = wrapperReverse;
-    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;
+var TraversalRecord = utils.TraversalRecord;
 
-    // Add lazy aliases.
-    lodash.prototype.first = lodash.prototype.head;
+/**
+ * DFS traversal in the given graph using a callback function
+ *
+ * @param {Graph}    graph    - Target graph.
+ * @param {function} callback - Iteration callback.
+ */
+function dfs(graph, callback) {
+  if (!isGraph(graph))
+    throw new Error('graphology-traversal/dfs: expecting a graphology instance.');
 
-    if (symIterator) {
-      lodash.prototype[symIterator] = wrapperToIterator;
-    }
-    return lodash;
-  });
+  if (typeof callback !== 'function')
+    throw new Error('graphology-traversal/dfs: given callback is not a function.');
 
-  /*--------------------------------------------------------------------------*/
+  // Early termination
+  if (graph.order === 0)
+    return;
 
-  // Export lodash.
-  var _ = runInContext();
+  var seen = new Set();
+  var stack = [];
+  var depth, record;
 
-  // Some AMD build optimizers, like r.js, check for condition patterns like:
-  if (freeModule) {
-    // Export for Node.js.
-    (freeModule.exports = _)._ = _;
-    // Export for CommonJS support.
-    freeExports._ = _;
-  }
-  else {
-    // Export to the global object.
-    root._ = _;
+  function neighborCallback(neighbor, attr) {
+    if (seen.has(neighbor))
+      return;
+
+    seen.add(neighbor);
+    stack.push(new TraversalRecord(neighbor, attr, depth + 1));
   }
-}.call(commonjsGlobal));
-});
 
-/* src\Components\TrailGrid.svelte generated by Svelte v3.35.0 */
+  graph.forEachNode(function(node, attr) {
+    if (seen.has(node))
+      return;
 
-function add_css$b() {
-	var style = element("style");
-	style.id = "svelte-ybyqyo-style";
-	style.textContent = "div.BC-trail-grid.svelte-ybyqyo{border:2px solid var(--background-modifier-border);display:grid;align-items:stretch;width:auto;height:auto}div.BC-trail-grid-item.svelte-ybyqyo{display:flex;flex-direction:column;border:1px solid var(--background-modifier-border);align-items:center;justify-content:center;padding:2px;font-size:smaller}div.BC-trail-grid-item.BC-filler.svelte-ybyqyo{opacity:0.7}.dot.svelte-ybyqyo{height:5px;width:5px;border-radius:50%;display:inline-block}";
-	append(document.head, style);
-}
+    seen.add(node);
+    stack.push(new TraversalRecord(node, attr, 0));
 
-function get_each_context$a(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[20] = list[i];
-	child_ctx[22] = i;
-	return child_ctx;
-}
+    while (stack.length !== 0) {
+      record = stack.pop();
+      depth = record.depth;
 
-function get_each_context_1$7(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[23] = list[i];
-	return child_ctx;
-}
+      callback(record.node, record.attributes, depth);
 
-function get_each_context_2$3(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[22] = list[i];
-	return child_ctx;
+      graph.forEachOutboundNeighbor(record.node, neighborCallback);
+    }
+  });
 }
 
-// (83:8) {#if step.value && settings.gridDots}
-function create_if_block$6(ctx) {
-	let div;
-	let each_value_2 = lodash.range(Math.floor(/*wordCounts*/ ctx[3][/*step*/ ctx[23].value] / 1000));
-	let each_blocks = [];
-
-	for (let i = 0; i < each_value_2.length; i += 1) {
-		each_blocks[i] = create_each_block_2$3(get_each_context_2$3(ctx, each_value_2, i));
-	}
+/**
+ * DFS traversal in the given graph, starting from the given node, using a
+ * callback function.
+ *
+ * @param {Graph}    graph    - Target graph.
+ * @param {string}   node     - Starting node.
+ * @param {function} callback - Iteration callback.
+ */
+function dfsFromNode(graph, node, callback) {
+  if (!isGraph(graph))
+    throw new Error('graphology-traversal/dfs: expecting a graphology instance.');
 
-	return {
-		c() {
-			div = element("div");
+  if (typeof callback !== 'function')
+    throw new Error('graphology-traversal/dfs: given callback is not a function.');
 
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
+  // Early termination
+  if (graph.order === 0)
+    return;
 
-			attr(div, "class", "dots");
-		},
-		m(target, anchor) {
-			insert(target, div, anchor);
+  node = '' + node;
 
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(div, null);
-			}
-		},
-		p(ctx, dirty) {
-			if (dirty & /*settings, wordCounts*/ 40) {
-				each_value_2 = lodash.range(Math.floor(/*wordCounts*/ ctx[3][/*step*/ ctx[23].value] / 1000));
-				let i;
+  var seen = new Set();
+  var stack = [];
+  var depth, record;
 
-				for (i = 0; i < each_value_2.length; i += 1) {
-					const child_ctx = get_each_context_2$3(ctx, each_value_2, i);
+  function neighborCallback(neighbor, attr) {
+    if (seen.has(neighbor))
+      return;
 
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block_2$3(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(div, null);
-					}
-				}
+    seen.add(neighbor);
+    stack.push(new TraversalRecord(neighbor, attr, depth + 1));
+  }
 
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
+  seen.add(node);
+  stack.push(new TraversalRecord(node, graph.getNodeAttributes(node), 0));
 
-				each_blocks.length = each_value_2.length;
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(div);
-			destroy_each(each_blocks, detaching);
-		}
-	};
-}
+  while (stack.length !== 0) {
+    record = stack.pop();
+    depth = record.depth;
 
-// (85:12) {#each range(Math.floor(wordCounts[step.value] / 1000)) as i}
-function create_each_block_2$3(ctx) {
-	let span;
+    callback(record.node, record.attributes, depth);
 
-	return {
-		c() {
-			span = element("span");
-			attr(span, "class", "dot svelte-ybyqyo");
-			set_style(span, "background-color", /*settings*/ ctx[5].dotsColour);
-		},
-		m(target, anchor) {
-			insert(target, span, anchor);
-		},
-		p: noop,
-		d(detaching) {
-			if (detaching) detach(span);
-		}
-	};
+    graph.forEachOutboundNeighbor(record.node, neighborCallback);
+  }
 }
 
-// (66:4) {#each allRuns[i] as step}
-function create_each_block_1$7(ctx) {
-	let div1;
-	let div0;
-	let t0_value = (getAlt(/*step*/ ctx[23].value, /*plugin*/ ctx[2]) ?? dropDendron(/*step*/ ctx[23].value, /*settings*/ ctx[5])) + "";
-	let t0;
-	let div0_class_value;
-	let t1;
-	let t2;
-	let div1_class_value;
-	let div1_style_value;
-	let mounted;
-	let dispose;
-	let if_block = /*step*/ ctx[23].value && /*settings*/ ctx[5].gridDots && create_if_block$6(ctx);
-
-	function click_handler(...args) {
-		return /*click_handler*/ ctx[9](/*step*/ ctx[23], ...args);
-	}
-
-	function mouseover_handler(...args) {
-		return /*mouseover_handler*/ ctx[10](/*step*/ ctx[23], ...args);
-	}
-
-	return {
-		c() {
-			div1 = element("div");
-			div0 = element("div");
-			t0 = text(t0_value);
-			t1 = space();
-			if (if_block) if_block.c();
-			t2 = space();
-			attr(div0, "class", div0_class_value = "" + (null_to_empty(linkClass(/*app*/ ctx[1], /*step*/ ctx[23].value)) + " svelte-ybyqyo"));
-			attr(div1, "class", div1_class_value = "BC-trail-grid-item " + (/*step*/ ctx[23].value === "" ? "BC-filler" : "") + " svelte-ybyqyo");
+var dfs_2 = dfs;
+var dfsFromNode_1 = dfsFromNode;
 
-			attr(div1, "style", div1_style_value = "\r\n            grid-area: " + (/*step*/ ctx[23].first + 1) + " / " + (/*i*/ ctx[22] + 1) + " / \r\n                " + (/*step*/ ctx[23].last + 2) + " / " + (/*i*/ ctx[22] + 2) + ";\r\n            " + (/*settings*/ ctx[5].gridHeatmap
-			? `background-color: ${/*settings*/ ctx[5].heatmapColour}${Math.round(/*children*/ ctx[4][/*step*/ ctx[23].value] * 200 + 55).toString(16)}`
-			: ""));
-		},
-		m(target, anchor) {
-			insert(target, div1, anchor);
-			append(div1, div0);
-			append(div0, t0);
-			append(div1, t1);
-			if (if_block) if_block.m(div1, null);
-			append(div1, t2);
+var dfs_1 = {
+	dfs: dfs_2,
+	dfsFromNode: dfsFromNode_1
+};
 
-			if (!mounted) {
-				dispose = [
-					listen(div1, "click", click_handler),
-					listen(div1, "mouseover", mouseover_handler)
-				];
+var graphologyTraversal = createCommonjsModule(function (module, exports) {
+var k;
 
-				mounted = true;
-			}
-		},
-		p(new_ctx, dirty) {
-			ctx = new_ctx;
-			if (dirty & /*plugin*/ 4 && t0_value !== (t0_value = (getAlt(/*step*/ ctx[23].value, /*plugin*/ ctx[2]) ?? dropDendron(/*step*/ ctx[23].value, /*settings*/ ctx[5])) + "")) set_data(t0, t0_value);
+for (k in bfs_1)
+  exports[k] = bfs_1[k];
 
-			if (dirty & /*app*/ 2 && div0_class_value !== (div0_class_value = "" + (null_to_empty(linkClass(/*app*/ ctx[1], /*step*/ ctx[23].value)) + " svelte-ybyqyo"))) {
-				attr(div0, "class", div0_class_value);
-			}
+for (k in dfs_1)
+  exports[k] = dfs_1[k];
+});
 
-			if (/*step*/ ctx[23].value && /*settings*/ ctx[5].gridDots) if_block.p(ctx, dirty);
+/**
+ * Get all the fields in `dir`.
+ * Returns all fields if `dir === 'all'`
+ * @param  {UserHier[]} userHiers
+ * @param  {Directions|"all"} dir
+ */
+function getFields(userHiers, dir = "all") {
+    const fields = [];
+    userHiers.forEach((hier) => {
+        if (dir === "all") {
+            DIRECTIONS$1.forEach((eachDir) => {
+                fields.push(...hier[eachDir]);
+            });
+        }
+        else {
+            fields.push(...hier[dir]);
+        }
+    });
+    return fields;
+}
+const getOppDir = (dir) => {
+    switch (dir) {
+        case "up":
+            return "down";
+        case "down":
+            return "up";
+        case "same":
+            return "same";
+        case "next":
+            return "prev";
+        case "prev":
+            return "next";
+    }
+};
+function getFieldInfo(userHiers, field) {
+    let fieldDir;
+    let fieldHier;
+    DIRECTIONS$1.forEach((dir) => {
+        userHiers.forEach((hier) => {
+            if (hier[dir].includes(field)) {
+                fieldDir = dir;
+                fieldHier = hier;
+                return;
+            }
+        });
+    });
+    return { fieldHier, fieldDir };
+}
+function getOppFields(userHiers, field) {
+    // If the field ends with `>`, it is already the opposite field we need (coming from getOppFallback`)
+    if (field.endsWith(">"))
+        return field.slice(0, -4);
+    const { fieldHier, fieldDir } = getFieldInfo(userHiers, field);
+    if (!fieldHier || !fieldDir)
+        return undefined;
+    const oppDir = getOppDir(fieldDir);
+    return fieldHier[oppDir];
+}
+const hierToStr = (hier) => DIRECTIONS$1.map((dir) => `${ARROW_DIRECTIONS[dir]}: ${hier[dir].join(", ")}`).join("\n");
+const fallbackField = (field, dir) => `${field} <${ARROW_DIRECTIONS[dir]}>`;
+const fallbackOppField = (field, dir) => `${field} <${ARROW_DIRECTIONS[getOppDir(dir)]}>`;
+function iterateHiers(userHiers, fn) {
+    userHiers.forEach((hier) => {
+        DIRECTIONS$1.forEach((dir) => {
+            hier[dir].forEach((field) => {
+                fn(hier, dir, field);
+            });
+        });
+    });
+}
 
-			if (dirty & /*children*/ 16 && div1_style_value !== (div1_style_value = "\r\n            grid-area: " + (/*step*/ ctx[23].first + 1) + " / " + (/*i*/ ctx[22] + 1) + " / \r\n                " + (/*step*/ ctx[23].last + 2) + " / " + (/*i*/ ctx[22] + 2) + ";\r\n            " + (/*settings*/ ctx[5].gridHeatmap
-			? `background-color: ${/*settings*/ ctx[5].heatmapColour}${Math.round(/*children*/ ctx[4][/*step*/ ctx[23].value] * 200 + 55).toString(16)}`
-			: ""))) {
-				attr(div1, "style", div1_style_value);
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(div1);
-			if (if_block) if_block.d();
-			mounted = false;
-			run_all(dispose);
-		}
-	};
+// TODO - this is a hack to get the graph to work with the approvals
+// I shouldn't need
+const DIRECTIONS = ["up", "same", "down", "next", "prev"];
+// This function takes the real & implied graphs for a given relation, and returns a new graphs with both.
+// It makes implied relations real
+// TODO use reflexiveClosure instead
+function closeImpliedLinks(real, implied) {
+    const closedG = real.copy();
+    implied.forEachEdge((key, a, s, t) => {
+        closedG.mergeEdge(t, s, a);
+    });
+    return closedG;
+}
+function removeUnlinkedNodes(g) {
+    const copy = g.copy();
+    copy.forEachNode((node) => {
+        if (!copy.degree(node))
+            copy.dropNode(node);
+    });
+    return copy;
+}
+/**
+ * Return a subgraph of all nodes & edges with `dirs.includes(a.dir)`
+ * @param  {MultiGraph} main
+ * @param  {Directions} dir
+ */
+function getSubInDirs(main, ...dirs) {
+    const sub = new graphology_umd_min.MultiGraph();
+    main === null || main === void 0 ? void 0 : main.forEachEdge((k, a, s, t) => {
+        if (dirs.includes(a.dir)) {
+            //@ts-ignore
+            addNodesIfNot(sub, [s, t], a);
+            sub.addEdge(s, t, a);
+        }
+    });
+    return sub;
+}
+/**
+ * Return a subgraph of all nodes & edges with `files.includes(a.field)`
+ * @param  {MultiGraph} main
+ * @param  {string[]} fields
+ */
+function getSubForFields(main, fields) {
+    const sub = new graphology_umd_min.MultiGraph();
+    main.forEachEdge((k, a, s, t) => {
+        if (fields.includes(a.field)) {
+            //@ts-ignore
+            addNodesIfNot(sub, [s, t], a);
+            sub.addEdge(s, t, a);
+        }
+    });
+    return sub;
+}
+/**
+ * For every edge in `g`, add the reverse of the edge to a copy of `g`.
+ *
+ * It also sets the attrs of the reverse edges to `oppDir` and `oppFields[0]`
+ * @param  {MultiGraph} g
+ * @param  {UserHier[]} userHiers
+ * @param  {boolean} closeAsOpposite
+ */
+function getReflexiveClosure(g, userHiers, closeAsOpposite = true) {
+    const copy = g.copy();
+    copy.forEachEdge((k, a, s, t) => {
+        var _a;
+        const { dir, field } = a;
+        if (field === undefined)
+            return;
+        const oppDir = getOppDir(dir);
+        const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, dir);
+        addNodesIfNot(copy, [s, t], {
+            //@ts-ignore
+            dir: closeAsOpposite ? oppDir : dir,
+            field: closeAsOpposite ? oppField : field,
+        });
+        addEdgeIfNot(copy, t, s, {
+            //@ts-ignore
+            dir: closeAsOpposite ? oppDir : dir,
+            field: closeAsOpposite ? oppField : field,
+            implied: BC_I_REFLEXIVE,
+        });
+    });
+    return copy;
+}
+function addNodesIfNot(g, nodes, attr = { order: 9999 }) {
+    for (const node of nodes) {
+        g.updateNode(node, (exstantAttrs) => {
+            const extantOrder = exstantAttrs.order;
+            return Object.assign(Object.assign({}, exstantAttrs), { order: extantOrder && extantOrder < 9999 ? extantOrder : attr.order });
+        });
+    }
+}
+function addEdgeIfNot(g, source, target, attr) {
+    if (!g.hasEdge(source, target))
+        g.addEdge(source, target, attr);
+}
+const getSinks = (g) => g.filterNodes((node) => g.hasNode(node) && !g.outDegree(node));
+const getOutNeighbours = (g, node) => g.hasNode(node) ? g.outNeighbors(node) : [];
+const getInNeighbours = (g, node) => g.hasNode(node) ? g.inNeighbors(node) : [];
+/**
+ *  Get the hierarchy and direction that `field` is in
+ * */
+function dfsAllPaths(g, start) {
+    const queue = [{ node: start, path: [] }];
+    const visited = {};
+    const allPaths = [];
+    let i = 0;
+    while (queue.length > 0 && i < 1000) {
+        i++;
+        const { node, path } = queue.shift();
+        const extPath = [node, ...path];
+        const succsNotVisited = g.hasNode(node)
+            ? g.filterOutNeighbors(node, (succ) => !visited[succ] || visited[succ] < 5)
+            : [];
+        const newItems = succsNotVisited.map((succ) => {
+            visited[succ] = visited[succ] ? visited[succ] + 1 : 1;
+            return { node: succ, path: extPath };
+        });
+        queue.unshift(...newItems);
+        if (!g.hasNode(node) || !g.outDegree(node))
+            allPaths.push(extPath);
+    }
+    return allPaths;
+}
+function bfsAllPaths(g, start) {
+    const pathsArr = [];
+    const queue = [{ node: start, path: [] }];
+    let i = 0;
+    while (queue.length !== 0 && i < 1000) {
+        i++;
+        const { node, path } = queue.shift();
+        const extPath = [node, ...path];
+        const succs = g.hasNode(node)
+            ? g.filterOutNeighbors(node, (n) => !path.includes(n))
+            : [];
+        for (const node of succs) {
+            queue.push({ node, path: extPath });
+        }
+        // terminal node
+        if (!g.hasNode(node) || succs.length === 0) {
+            pathsArr.push(extPath);
+        }
+    }
+    // Splice off the current note from the path
+    pathsArr.forEach((path) => {
+        if (path.length)
+            path.splice(path.length - 1, 1);
+    });
+    loglevel.info({ pathsArr });
+    return pathsArr;
+}
+function removeCycles(g, startNode) {
+    const copy = g.copy();
+    let prevNode = null;
+    graphologyTraversal.dfsFromNode(copy, startNode, (n) => {
+        copy.forEachOutNeighbor(n, (t) => {
+            if (t === prevNode && copy.hasEdge(t, prevNode)) {
+                copy.dropEdge(t, prevNode);
+            }
+        });
+        prevNode = n;
+    });
+    return copy;
+}
+function buildObsGraph(app) {
+    const ObsG = new graphology_umd_min.MultiGraph();
+    const { resolvedLinks, unresolvedLinks } = app.metadataCache;
+    for (const source in resolvedLinks) {
+        if (!source.endsWith(".md"))
+            continue;
+        const sourceBase = getBaseFromMDPath(source);
+        addNodesIfNot(ObsG, [sourceBase]);
+        for (const dest in resolvedLinks[source]) {
+            if (!dest.endsWith(".md"))
+                continue;
+            const destBase = getBaseFromMDPath(dest);
+            addNodesIfNot(ObsG, [destBase]);
+            ObsG.addEdge(sourceBase, destBase, { resolved: true });
+        }
+    }
+    for (const source in unresolvedLinks) {
+        const sourceBase = getBaseFromMDPath(source);
+        addNodesIfNot(ObsG, [sourceBase]);
+        for (const dest in unresolvedLinks[source]) {
+            const destBase = getBaseFromMDPath(dest);
+            addNodesIfNot(ObsG, [destBase]);
+            if (sourceBase === destBase)
+                continue;
+            ObsG.addEdge(sourceBase, destBase, { resolved: false });
+        }
+    }
+    loglevel.info({ ObsG });
+    return ObsG;
+}
+function populateMain(settings, mainG, source, field, target, sourceOrder, targetOrder, fillOpp = false) {
+    var _a;
+    const { userHiers } = settings;
+    const dir = getFieldInfo(userHiers, field).fieldDir;
+    addNodesIfNot(mainG, [source], {
+        order: sourceOrder,
+    });
+    addNodesIfNot(mainG, [target], {
+        order: targetOrder,
+    });
+    addEdgeIfNot(mainG, source, target, {
+        dir,
+        field,
+    });
+    if (fillOpp) {
+        const oppDir = getOppDir(dir);
+        const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : getFields(userHiers, oppDir)[0];
+        addEdgeIfNot(mainG, target, source, {
+            dir: oppDir,
+            field: oppField,
+        });
+    }
+}
+const getTargetOrder = (frontms, target) => {
+    var _a, _b;
+    return parseInt((_b = (_a = frontms.find((arr) => arr.file.basename === target)) === null || _a === void 0 ? void 0 : _a[BC_ORDER]) !== null && _b !== void 0 ? _b : "9999");
+};
+const getSourceOrder = (frontm) => { var _a; return parseInt((_a = frontm[BC_ORDER]) !== null && _a !== void 0 ? _a : "9999"); };
+/** Remember to filter by hierarchy in MatrixView! */
+function getRealnImplied(plugin, currNode, dir = null) {
+    const realsnImplieds = blankRealNImplied();
+    const { settings, closedG } = plugin;
+    const { userHiers } = settings;
+    if (!closedG.hasNode(currNode))
+        return realsnImplieds;
+    closedG.forEachEdge(currNode, (k, a, s, t) => {
+        var _a;
+        const { field, dir: edgeDir, implied, } = a;
+        const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, edgeDir);
+        (dir ? [dir, getOppDir(dir)] : DIRECTIONS).forEach((currDir) => {
+            const oppDir = getOppDir(currDir);
+            // Reals
+            if (s === currNode && (edgeDir === currDir || edgeDir === oppDir)) {
+                const arr = realsnImplieds[edgeDir].reals;
+                if (arr.findIndex((item) => item.to === t) === -1) {
+                    arr.push({ to: t, real: true, field, implied });
+                }
+            }
+            // Implieds
+            // If `s !== currNode` then `t` must be
+            else if (edgeDir === currDir || edgeDir === oppDir) {
+                const arr = realsnImplieds[getOppDir(edgeDir)].implieds;
+                if (arr.findIndex((item) => item.to === s) === -1) {
+                    arr.push({
+                        to: s,
+                        real: false,
+                        field: oppField,
+                        implied,
+                    });
+                }
+            }
+        });
+    });
+    return realsnImplieds;
 }
 
-// (65:2) {#each transposedTrails as col, i}
-function create_each_block$a(ctx) {
-	let each_1_anchor;
-	let each_value_1 = /*allRuns*/ ctx[8][/*i*/ ctx[22]];
-	let each_blocks = [];
-
-	for (let i = 0; i < each_value_1.length; i += 1) {
-		each_blocks[i] = create_each_block_1$7(get_each_context_1$7(ctx, each_value_1, i));
-	}
-
-	return {
-		c() {
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			each_1_anchor = empty();
-		},
-		m(target, anchor) {
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(target, anchor);
-			}
-
-			insert(target, each_1_anchor, anchor);
-		},
-		p(ctx, dirty) {
-			if (dirty & /*allRuns, settings, Math, children, openOrSwitch, app, hoverPreview, activeLeafView, range, wordCounts, linkClass, getAlt, plugin, dropDendron*/ 382) {
-				each_value_1 = /*allRuns*/ ctx[8][/*i*/ ctx[22]];
-				let i;
-
-				for (i = 0; i < each_value_1.length; i += 1) {
-					const child_ctx = get_each_context_1$7(ctx, each_value_1, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block_1$7(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(each_1_anchor.parentNode, each_1_anchor);
-					}
-				}
+/**
+ * Returns a copy of `index`, doesn't mutate.
+ * @param  {string} index
+ */
+function addAliasesToIndex(plugin, index) {
+    var _a, _b, _c, _d;
+    const { aliasesInIndex } = plugin.settings;
+    const copy = index.slice();
+    const lines = copy.split("\n");
+    for (let line of lines) {
+        if (aliasesInIndex) {
+            const note = line.split("- ")[1];
+            if (!note)
+                continue;
+            const currFile = plugin.app.metadataCache.getFirstLinkpathDest(note, "");
+            if (currFile !== null) {
+                const cache = plugin.app.metadataCache.getFileCache(currFile);
+                const alias = (_b = (_a = cache === null || cache === void 0 ? void 0 : cache.frontmatter) === null || _a === void 0 ? void 0 : _a.alias) !== null && _b !== void 0 ? _b : [];
+                const aliases = (_d = (_c = cache === null || cache === void 0 ? void 0 : cache.frontmatter) === null || _c === void 0 ? void 0 : _c.aliases) !== null && _d !== void 0 ? _d : [];
+                const allAliases = [...[alias].flat(3), ...[aliases].flat(3)];
+                if (allAliases.length) {
+                    line += ` (${allAliases.join(", ")})`;
+                }
+            }
+        }
+    }
+    return lines.join("\n");
+}
+/**
+ * Create an index of all the paths in the graph.
+ * @param allPaths - A list of all paths from the root to the leaves.
+ * @param {boolean} asWikilinks - Whether to use wikilinks instead of plain text.
+ * @returns A string.
+ */
+function createIndex(allPaths, asWikilinks) {
+    let index = "";
+    const copy = lodash.cloneDeep(allPaths);
+    const reversed = copy.map((path) => path.reverse());
+    reversed.forEach((path) => path.shift());
+    const indent = "  ";
+    const visited = {};
+    reversed.forEach((path) => {
+        for (let depth = 0; depth < path.length; depth++) {
+            const currNode = path[depth];
+            // If that node has been visited before at the current depth
+            if (visited.hasOwnProperty(currNode) &&
+                visited[currNode].includes(depth)) {
+                continue;
+            }
+            else {
+                index += `${indent.repeat(depth)}- ${asWikilinks ? makeWiki(currNode) : currNode}`;
+                index += "\n";
+                if (!visited.hasOwnProperty(currNode))
+                    visited[currNode] = [];
+                visited[currNode].push(depth);
+            }
+        }
+    });
+    return index;
+}
+async function copyLocalIndex(plugin) {
+    const { settings, closedG } = plugin;
+    const { wikilinkIndex } = settings;
+    const { basename } = plugin.app.workspace.getActiveFile();
+    const onlyDowns = getSubInDirs(closedG, "down");
+    const allPaths = dfsAllPaths(onlyDowns, basename);
+    const index = addAliasesToIndex(plugin, createIndex(allPaths, wikilinkIndex));
+    loglevel.info({ index });
+    await copy(index);
+}
+async function copyGlobalIndex(plugin) {
+    const { settings, closedG } = plugin;
+    const { wikilinkIndex } = settings;
+    const onlyDowns = getSubInDirs(closedG, "down");
+    const onlyUps = getSubInDirs(closedG, "up");
+    const sinks = getSinks(onlyUps);
+    let globalIndex = "";
+    sinks.forEach((terminal) => {
+        globalIndex += terminal + "\n";
+        const allPaths = dfsAllPaths(onlyDowns, terminal);
+        globalIndex +=
+            addAliasesToIndex(plugin, createIndex(allPaths, wikilinkIndex)) + "\n";
+    });
+    loglevel.info({ globalIndex });
+    await copy(globalIndex);
+}
 
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
+/* src\Components\RenderMarkdown.svelte generated by Svelte v3.35.0 */
 
-				each_blocks.length = each_value_1.length;
-			}
-		},
-		d(detaching) {
-			destroy_each(each_blocks, detaching);
-			if (detaching) detach(each_1_anchor);
-		}
-	};
+function add_css$c() {
+	var style = element("style");
+	style.id = "svelte-7e9i10-style";
+	style.textContent = "div.BC-note-content.svelte-7e9i10{padding-left:20px}";
+	append(document.head, style);
 }
 
-function create_fragment$j(ctx) {
+function create_fragment$l(ctx) {
 	let div;
-	let each_value = /*transposedTrails*/ ctx[7];
-	let each_blocks = [];
-
-	for (let i = 0; i < each_value.length; i += 1) {
-		each_blocks[i] = create_each_block$a(get_each_context$a(ctx, each_value, i));
-	}
 
 	return {
 		c() {
 			div = element("div");
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			attr(div, "class", "BC-trail-grid svelte-ybyqyo");
-			set_style(div, "grid-template-columns", ("1fr ").repeat(/*transposedTrails*/ ctx[7].length));
-			set_style(div, "grid-template-rows", ("1fr ").repeat(/*sortedTrails*/ ctx[0].length));
+			attr(div, "class", "BC-note-content svelte-7e9i10");
 		},
 		m(target, anchor) {
 			insert(target, div, anchor);
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(div, null);
-			}
-		},
-		p(ctx, [dirty]) {
-			if (dirty & /*allRuns, settings, Math, children, openOrSwitch, app, hoverPreview, activeLeafView, range, wordCounts, linkClass, getAlt, plugin, dropDendron*/ 382) {
-				each_value = /*transposedTrails*/ ctx[7];
-				let i;
-
-				for (i = 0; i < each_value.length; i += 1) {
-					const child_ctx = get_each_context$a(ctx, each_value, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block$a(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(div, null);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value.length;
-			}
-
-			if (dirty & /*sortedTrails*/ 1) {
-				set_style(div, "grid-template-rows", ("1fr ").repeat(/*sortedTrails*/ ctx[0].length));
-			}
+			/*div_binding*/ ctx[3](div);
 		},
+		p: noop,
 		i: noop,
 		o: noop,
 		d(detaching) {
 			if (detaching) detach(div);
-			destroy_each(each_blocks, detaching);
-		}
-	};
-}
-
-function instance$j($$self, $$props, $$invalidate) {
-	
-	
-	let { sortedTrails } = $$props;
-	let { app } = $$props;
-	let { plugin } = $$props;
-	const { settings } = plugin;
-	const { userHiers } = settings;
-	const currFile = app.workspace.getActiveFile();
-	const activeLeafView = app.workspace.activeLeaf.view;
-	const allCells = [...new Set(sortedTrails.reduce((a, b) => [...a, ...b]))];
-	const wordCounts = {};
-
-	allCells.forEach(cell => {
-		var _a;
-
-		try {
-			$$invalidate(
-				3,
-				wordCounts[cell] = (_a = app.metadataCache.getFirstLinkpathDest(cell, "")) === null || _a === void 0
-				? void 0
-				: _a.stat.size,
-				wordCounts
-			);
-		} catch(error) {
-			console.log(error, { currFile });
-			$$invalidate(3, wordCounts[cell] = 0, wordCounts);
+			/*div_binding*/ ctx[3](null);
 		}
-	});
+	};
+}
 
-	// const data: {[cell: string]: number} = {}
-	// allCells.forEach(cell => data[cell] = app.metadataCache.getFileCache(app.metadataCache.getFirstLinkpathDest(cell, currFile.path))?.links.length ?? 0);
-	const { mainG } = plugin;
+function instance$l($$self, $$props, $$invalidate) {
+	var __awaiter = this && this.__awaiter || function (thisArg, _arguments, P, generator) {
+		function adopt(value) {
+			return value instanceof P
+			? value
+			: new P(function (resolve) {
+						resolve(value);
+					});
+		}
 
-	// const [up, down] = [getSubInDirs(mainG, "up"), getSubInDirs(mainG, "down")];
-	// const closedParents = closeImpliedLinks(up, down);
-	const closedParents = getReflexiveClosure(getSubInDirs(mainG, "up", "down"), userHiers);
+		return new (P || (P = Promise))(function (resolve, reject) {
+				function fulfilled(value) {
+					try {
+						step(generator.next(value));
+					} catch(e) {
+						reject(e);
+					}
+				}
 
-	const children = {};
-	allCells.forEach(cell => $$invalidate(4, children[cell] = getOutNeighbours(closedParents, cell).length, children));
-	const normalisedData = normalise(Object.values(children));
+				function rejected(value) {
+					try {
+						step(generator["throw"](value));
+					} catch(e) {
+						reject(e);
+					}
+				}
 
-	allCells.forEach((cell, i) => {
-		$$invalidate(4, children[cell] = normalisedData[i], children);
-	});
+				function step(result) {
+					result.done
+					? resolve(result.value)
+					: adopt(result.value).then(fulfilled, rejected);
+				}
 
-	// const normalisedData = allCells.forEach(cell => {
-	// })
-	// const links: {[cell: string]: number}[] = []
-	// data.forEach(cell => links[Object.keys(cell)[0]] = (Object.values(cell)[0]?.links.length ?? 0))
-	// console.log(data)
-	const maxLength = Math.max(...sortedTrails.map(trail => trail.length));
+				step((generator = generator.apply(thisArg, _arguments || [])).next());
+			});
+	};
 
-	const paddedTrails = sortedTrails.map(trail => padArray(trail, maxLength));
+	let { path } = $$props;
+	let { app } = $$props;
 
-	// const permutations: string[][][] = permute(paddedTrails.map(trail => [trail[0]]))
-	// //  permutations.map(trails => sum(transpose(trails).map(runs).map(runs => runs.length)))
-	// const ALLRuns = permutations.map(permutation => transpose(permutation).map(runs))
-	// const runsPerRun = ALLRuns.map(runs => runs[0].length)
-	// const minRunLength = Math.min(...runsPerRun);
-	// const indexOfMinRun = runsPerRun.indexOf(minRunLength);
-	// const minRun = ALLRuns[indexOfMinRun]
-	const transposedTrails = transpose(paddedTrails);
+	function getContent(note) {
+		return __awaiter(this, void 0, void 0, function* () {
+			const file = app.metadataCache.getFirstLinkpathDest(note, "");
+			return yield app.vault.cachedRead(file);
+		});
+	}
 
-	const allRuns = transposedTrails.map(runs);
-	const click_handler = (step, e) => openOrSwitch(app, step.value, e);
-	const mouseover_handler = (step, e) => hoverPreview(e, activeLeafView, step.value);
+	let el;
+
+	onMount(() => __awaiter(void 0, void 0, void 0, function* () {
+		obsidian.MarkdownRenderer.renderMarkdown(yield getContent(path), el, path, null);
+	}));
+
+	function div_binding($$value) {
+		binding_callbacks[$$value ? "unshift" : "push"](() => {
+			el = $$value;
+			$$invalidate(0, el);
+		});
+	}
 
 	$$self.$$set = $$props => {
-		if ("sortedTrails" in $$props) $$invalidate(0, sortedTrails = $$props.sortedTrails);
-		if ("app" in $$props) $$invalidate(1, app = $$props.app);
-		if ("plugin" in $$props) $$invalidate(2, plugin = $$props.plugin);
+		if ("path" in $$props) $$invalidate(1, path = $$props.path);
+		if ("app" in $$props) $$invalidate(2, app = $$props.app);
 	};
 
-	return [
-		sortedTrails,
-		app,
-		plugin,
-		wordCounts,
-		children,
-		settings,
-		activeLeafView,
-		transposedTrails,
-		allRuns,
-		click_handler,
-		mouseover_handler
-	];
+	return [el, path, app, div_binding];
 }
 
-class TrailGrid extends SvelteComponent {
+class RenderMarkdown extends SvelteComponent {
 	constructor(options) {
 		super();
-		if (!document.getElementById("svelte-ybyqyo-style")) add_css$b();
-		init(this, options, instance$j, create_fragment$j, safe_not_equal, { sortedTrails: 0, app: 1, plugin: 2 });
+		if (!document.getElementById("svelte-7e9i10-style")) add_css$c();
+		init(this, options, instance$l, create_fragment$l, safe_not_equal, { path: 1, app: 2 });
 	}
 }
 
-/* src\Components\TrailPath.svelte generated by Svelte v3.35.0 */
+/* src\Components\CBTree.svelte generated by Svelte v3.35.0 */
 
-function add_css$a() {
+function add_css$b() {
 	var style = element("style");
-	style.id = "svelte-3c1frp-style";
-	style.textContent = "span.BC-trail-path-container.svelte-3c1frp{display:flex;justify-content:space-between}";
+	style.id = "svelte-yt7jmz-style";
+	style.textContent = ".BC-tree.svelte-yt7jmz{padding-left:5px}pre.indent.svelte-yt7jmz{display:inline;background-color:transparent;position:top}details.svelte-yt7jmz{display:inline-block}.is-unresolved.svelte-yt7jmz{color:var(--text-muted)}";
 	append(document.head, style);
 }
 
-function get_each_context$9(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[10] = list[i];
-	return child_ctx;
-}
-
-function get_each_context_1$6(ctx, list, i) {
+function get_each_context$b(ctx, list, i) {
 	const child_ctx = ctx.slice();
-	child_ctx[13] = list[i];
-	child_ctx[15] = i;
+	child_ctx[17] = list[i][0];
+	child_ctx[18] = list[i][1];
 	return child_ctx;
 }
 
-// (20:8) {:else}
-function create_else_block$2(ctx) {
-	let each_1_anchor;
-	let each_value_1 = /*trail*/ ctx[10];
-	let each_blocks = [];
-
-	for (let i = 0; i < each_value_1.length; i += 1) {
-		each_blocks[i] = create_each_block_1$6(get_each_context_1$6(ctx, each_value_1, i));
-	}
+// (27:0) {#if title !== "false"}
+function create_if_block_2$3(ctx) {
+	let h3;
+	let t0;
+	let t1;
+	let t2;
 
 	return {
 		c() {
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			each_1_anchor = empty();
+			h3 = element("h3");
+			t0 = text(/*dir*/ ctx[1]);
+			t1 = text(" of ");
+			t2 = text(/*basename*/ ctx[5]);
 		},
 		m(target, anchor) {
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(target, anchor);
-			}
-
-			insert(target, each_1_anchor, anchor);
+			insert(target, h3, anchor);
+			append(h3, t0);
+			append(h3, t1);
+			append(h3, t2);
 		},
 		p(ctx, dirty) {
-			if (dirty & /*settings, trailsToShow, openOrSwitch, app, hoverPreview, view, getAlt, plugin, dropDendron*/ 118) {
-				each_value_1 = /*trail*/ ctx[10];
-				let i;
-
-				for (i = 0; i < each_value_1.length; i += 1) {
-					const child_ctx = get_each_context_1$6(ctx, each_value_1, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block_1$6(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(each_1_anchor.parentNode, each_1_anchor);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value_1.length;
-			}
+			if (dirty & /*dir*/ 2) set_data(t0, /*dir*/ ctx[1]);
+			if (dirty & /*basename*/ 32) set_data(t2, /*basename*/ ctx[5]);
 		},
 		d(detaching) {
-			destroy_each(each_blocks, detaching);
-			if (detaching) detach(each_1_anchor);
+			if (detaching) detach(h3);
 		}
 	};
 }
 
-// (18:8) {#if trail.length === 0}
-function create_if_block_1$4(ctx) {
-	let span;
+// (32:4) {#if meetsConditions(indent, link)}
+function create_if_block$6(ctx) {
+	let current_block_type_index;
+	let if_block;
+	let if_block_anchor;
+	let current;
+	const if_block_creators = [create_if_block_1$4, create_else_block$2];
+	const if_blocks = [];
+
+	function select_block_type(ctx, dirty) {
+		if (/*content*/ ctx[3] === "open" || /*content*/ ctx[3] === "closed") return 0;
+		return 1;
+	}
+
+	current_block_type_index = select_block_type(ctx);
+	if_block = if_blocks[current_block_type_index] = if_block_creators[current_block_type_index](ctx);
 
 	return {
 		c() {
-			span = element("span");
-			span.textContent = `${/*settings*/ ctx[5].noPathMessage}`;
+			if_block.c();
+			if_block_anchor = empty();
 		},
 		m(target, anchor) {
-			insert(target, span, anchor);
+			if_blocks[current_block_type_index].m(target, anchor);
+			insert(target, if_block_anchor, anchor);
+			current = true;
 		},
-		p: noop,
-		d(detaching) {
-			if (detaching) detach(span);
-		}
-	};
-}
+		p(ctx, dirty) {
+			let previous_block_index = current_block_type_index;
+			current_block_type_index = select_block_type(ctx);
 
-// (29:12) {#if i < trail.length - 1}
-function create_if_block_2$3(ctx) {
-	let span;
+			if (current_block_type_index === previous_block_index) {
+				if_blocks[current_block_type_index].p(ctx, dirty);
+			} else {
+				group_outros();
 
-	return {
-		c() {
-			span = element("span");
-			span.textContent = `${" " + /*settings*/ ctx[5].trailSeperator + " "}`;
+				transition_out(if_blocks[previous_block_index], 1, 1, () => {
+					if_blocks[previous_block_index] = null;
+				});
+
+				check_outros();
+				if_block = if_blocks[current_block_type_index];
+
+				if (!if_block) {
+					if_block = if_blocks[current_block_type_index] = if_block_creators[current_block_type_index](ctx);
+					if_block.c();
+				} else {
+					if_block.p(ctx, dirty);
+				}
+
+				transition_in(if_block, 1);
+				if_block.m(if_block_anchor.parentNode, if_block_anchor);
+			}
 		},
-		m(target, anchor) {
-			insert(target, span, anchor);
+		i(local) {
+			if (current) return;
+			transition_in(if_block);
+			current = true;
+		},
+		o(local) {
+			transition_out(if_block);
+			current = false;
 		},
-		p: noop,
 		d(detaching) {
-			if (detaching) detach(span);
+			if_blocks[current_block_type_index].d(detaching);
+			if (detaching) detach(if_block_anchor);
 		}
 	};
 }
 
-// (21:10) {#each trail as crumb, i}
-function create_each_block_1$6(ctx) {
-	let span;
-	let t0_value = (getAlt(/*crumb*/ ctx[13], /*plugin*/ ctx[2]) ?? dropDendron(/*crumb*/ ctx[13], /*settings*/ ctx[5])) + "";
+// (57:6) {:else}
+function create_else_block$2(ctx) {
+	let div;
+	let pre;
+	let t0_value = /*indent*/ ctx[17] + "-" + "";
 	let t0;
 	let t1;
-	let if_block_anchor;
+	let span;
+	let a;
+	let t2_value = dropDendron(/*link*/ ctx[18], /*settings*/ ctx[6]) + "";
+	let t2;
+	let a_class_value;
+	let t3;
 	let mounted;
 	let dispose;
 
-	function click_handler(...args) {
-		return /*click_handler*/ ctx[7](/*crumb*/ ctx[13], ...args);
-	}
-
-	function mouseover_handler(...args) {
-		return /*mouseover_handler*/ ctx[8](/*crumb*/ ctx[13], ...args);
+	function click_handler_1(...args) {
+		return /*click_handler_1*/ ctx[15](/*link*/ ctx[18], ...args);
 	}
 
-	let if_block = /*i*/ ctx[15] < /*trail*/ ctx[10].length - 1 && create_if_block_2$3(ctx);
-
 	return {
 		c() {
-			span = element("span");
+			div = element("div");
+			pre = element("pre");
 			t0 = text(t0_value);
 			t1 = space();
-			if (if_block) if_block.c();
-			if_block_anchor = empty();
-			attr(span, "class", "internal-link BC-Link");
+			span = element("span");
+			a = element("a");
+			t2 = text(t2_value);
+			t3 = space();
+			attr(pre, "class", "indent svelte-yt7jmz");
+
+			attr(a, "class", a_class_value = "internal-link " + (isInVault(/*plugin*/ ctx[0].app, /*link*/ ctx[18])
+			? ""
+			: "is-unresolved") + " svelte-yt7jmz");
+
+			attr(span, "class", "internal-link");
 		},
 		m(target, anchor) {
-			insert(target, span, anchor);
-			append(span, t0);
-			insert(target, t1, anchor);
-			if (if_block) if_block.m(target, anchor);
-			insert(target, if_block_anchor, anchor);
+			insert(target, div, anchor);
+			append(div, pre);
+			append(pre, t0);
+			append(div, t1);
+			append(div, span);
+			append(span, a);
+			append(a, t2);
+			append(div, t3);
 
 			if (!mounted) {
 				dispose = [
-					listen(span, "click", click_handler),
-					listen(span, "mouseover", mouseover_handler)
+					listen(span, "click", click_handler_1),
+					listen(span, "mouseover", mouseover_handler_1)
 				];
 
 				mounted = true;
@@ -24653,2163 +23398,2164 @@ function create_each_block_1$6(ctx) {
 		},
 		p(new_ctx, dirty) {
 			ctx = new_ctx;
-			if (dirty & /*trailsToShow, plugin*/ 20 && t0_value !== (t0_value = (getAlt(/*crumb*/ ctx[13], /*plugin*/ ctx[2]) ?? dropDendron(/*crumb*/ ctx[13], /*settings*/ ctx[5])) + "")) set_data(t0, t0_value);
+			if (dirty & /*lines*/ 16 && t0_value !== (t0_value = /*indent*/ ctx[17] + "-" + "")) set_data(t0, t0_value);
+			if (dirty & /*lines*/ 16 && t2_value !== (t2_value = dropDendron(/*link*/ ctx[18], /*settings*/ ctx[6]) + "")) set_data(t2, t2_value);
 
-			if (/*i*/ ctx[15] < /*trail*/ ctx[10].length - 1) {
-				if (if_block) {
-					if_block.p(ctx, dirty);
-				} else {
-					if_block = create_if_block_2$3(ctx);
-					if_block.c();
-					if_block.m(if_block_anchor.parentNode, if_block_anchor);
-				}
-			} else if (if_block) {
-				if_block.d(1);
-				if_block = null;
+			if (dirty & /*plugin, lines*/ 17 && a_class_value !== (a_class_value = "internal-link " + (isInVault(/*plugin*/ ctx[0].app, /*link*/ ctx[18])
+			? ""
+			: "is-unresolved") + " svelte-yt7jmz")) {
+				attr(a, "class", a_class_value);
 			}
 		},
+		i: noop,
+		o: noop,
 		d(detaching) {
-			if (detaching) detach(span);
-			if (detaching) detach(t1);
-			if (if_block) if_block.d(detaching);
-			if (detaching) detach(if_block_anchor);
+			if (detaching) detach(div);
 			mounted = false;
 			run_all(dispose);
 		}
 	};
 }
 
-// (16:4) {#each trailsToShow as trail}
-function create_each_block$9(ctx) {
+// (33:6) {#if content === "open" || content === "closed"}
+function create_if_block_1$4(ctx) {
 	let div;
-	let t;
+	let pre;
+	let t0_value = /*indent*/ ctx[17] + "";
+	let t0;
+	let t1;
+	let details;
+	let summary;
+	let span;
+	let a;
+	let t2_value = dropDendron(/*link*/ ctx[18], /*settings*/ ctx[6]) + "";
+	let t2;
+	let a_class_value;
+	let t3;
+	let rendermarkdown;
+	let details_open_value;
+	let t4;
+	let current;
+	let mounted;
+	let dispose;
 
-	function select_block_type(ctx, dirty) {
-		if (/*trail*/ ctx[10].length === 0) return create_if_block_1$4;
-		return create_else_block$2;
+	function click_handler(...args) {
+		return /*click_handler*/ ctx[14](/*link*/ ctx[18], ...args);
 	}
 
-	let current_block_type = select_block_type(ctx);
-	let if_block = current_block_type(ctx);
+	rendermarkdown = new RenderMarkdown({
+			props: {
+				app: /*app*/ ctx[7],
+				path: /*link*/ ctx[18]
+			}
+		});
 
 	return {
 		c() {
 			div = element("div");
-			if_block.c();
-			t = space();
+			pre = element("pre");
+			t0 = text(t0_value);
+			t1 = space();
+			details = element("details");
+			summary = element("summary");
+			span = element("span");
+			a = element("a");
+			t2 = text(t2_value);
+			t3 = space();
+			create_component(rendermarkdown.$$.fragment);
+			t4 = space();
+			attr(pre, "class", "indent svelte-yt7jmz");
+
+			attr(a, "class", a_class_value = "internal-link " + (isInVault(/*plugin*/ ctx[0].app, /*link*/ ctx[18])
+			? ""
+			: "is-unresolved") + " svelte-yt7jmz");
+
+			attr(span, "class", "internal-link");
+			details.open = details_open_value = /*content*/ ctx[3] === "open";
+			attr(details, "class", "svelte-yt7jmz");
 		},
 		m(target, anchor) {
 			insert(target, div, anchor);
-			if_block.m(div, null);
-			append(div, t);
+			append(div, pre);
+			append(pre, t0);
+			append(div, t1);
+			append(div, details);
+			append(details, summary);
+			append(summary, span);
+			append(span, a);
+			append(a, t2);
+			append(details, t3);
+			mount_component(rendermarkdown, details, null);
+			append(div, t4);
+			current = true;
+
+			if (!mounted) {
+				dispose = [
+					listen(span, "click", click_handler),
+					listen(span, "mouseover", mouseover_handler)
+				];
+
+				mounted = true;
+			}
 		},
-		p(ctx, dirty) {
-			if (current_block_type === (current_block_type = select_block_type(ctx)) && if_block) {
-				if_block.p(ctx, dirty);
-			} else {
-				if_block.d(1);
-				if_block = current_block_type(ctx);
+		p(new_ctx, dirty) {
+			ctx = new_ctx;
+			if ((!current || dirty & /*lines*/ 16) && t0_value !== (t0_value = /*indent*/ ctx[17] + "")) set_data(t0, t0_value);
+			if ((!current || dirty & /*lines*/ 16) && t2_value !== (t2_value = dropDendron(/*link*/ ctx[18], /*settings*/ ctx[6]) + "")) set_data(t2, t2_value);
 
-				if (if_block) {
-					if_block.c();
-					if_block.m(div, t);
-				}
+			if (!current || dirty & /*plugin, lines*/ 17 && a_class_value !== (a_class_value = "internal-link " + (isInVault(/*plugin*/ ctx[0].app, /*link*/ ctx[18])
+			? ""
+			: "is-unresolved") + " svelte-yt7jmz")) {
+				attr(a, "class", a_class_value);
+			}
+
+			const rendermarkdown_changes = {};
+			if (dirty & /*lines*/ 16) rendermarkdown_changes.path = /*link*/ ctx[18];
+			rendermarkdown.$set(rendermarkdown_changes);
+
+			if (!current || dirty & /*content*/ 8 && details_open_value !== (details_open_value = /*content*/ ctx[3] === "open")) {
+				details.open = details_open_value;
 			}
 		},
+		i(local) {
+			if (current) return;
+			transition_in(rendermarkdown.$$.fragment, local);
+			current = true;
+		},
+		o(local) {
+			transition_out(rendermarkdown.$$.fragment, local);
+			current = false;
+		},
 		d(detaching) {
 			if (detaching) detach(div);
-			if_block.d();
+			destroy_component(rendermarkdown);
+			mounted = false;
+			run_all(dispose);
 		}
 	};
 }
 
-// (38:2) {#if sortedTrails.length > 1}
-function create_if_block$5(ctx) {
-	let div;
-	let button;
-	let t_value = (/*showAll*/ ctx[3] ? "Shortest" : "All") + "";
-	let t;
-	let mounted;
-	let dispose;
+// (31:2) {#each lines as [indent, link]}
+function create_each_block$b(ctx) {
+	let show_if = /*meetsConditions*/ ctx[8](/*indent*/ ctx[17], /*link*/ ctx[18]);
+	let if_block_anchor;
+	let current;
+	let if_block = show_if && create_if_block$6(ctx);
 
 	return {
 		c() {
-			div = element("div");
-			button = element("button");
-			t = text(t_value);
-			attr(button, "class", "button-div");
+			if (if_block) if_block.c();
+			if_block_anchor = empty();
 		},
 		m(target, anchor) {
-			insert(target, div, anchor);
-			append(div, button);
-			append(button, t);
+			if (if_block) if_block.m(target, anchor);
+			insert(target, if_block_anchor, anchor);
+			current = true;
+		},
+		p(ctx, dirty) {
+			if (dirty & /*lines*/ 16) show_if = /*meetsConditions*/ ctx[8](/*indent*/ ctx[17], /*link*/ ctx[18]);
 
-			if (!mounted) {
-				dispose = listen(button, "click", /*click_handler_1*/ ctx[9]);
-				mounted = true;
+			if (show_if) {
+				if (if_block) {
+					if_block.p(ctx, dirty);
+
+					if (dirty & /*lines*/ 16) {
+						transition_in(if_block, 1);
+					}
+				} else {
+					if_block = create_if_block$6(ctx);
+					if_block.c();
+					transition_in(if_block, 1);
+					if_block.m(if_block_anchor.parentNode, if_block_anchor);
+				}
+			} else if (if_block) {
+				group_outros();
+
+				transition_out(if_block, 1, 1, () => {
+					if_block = null;
+				});
+
+				check_outros();
 			}
 		},
-		p(ctx, dirty) {
-			if (dirty & /*showAll*/ 8 && t_value !== (t_value = (/*showAll*/ ctx[3] ? "Shortest" : "All") + "")) set_data(t, t_value);
+		i(local) {
+			if (current) return;
+			transition_in(if_block);
+			current = true;
+		},
+		o(local) {
+			transition_out(if_block);
+			current = false;
 		},
 		d(detaching) {
-			if (detaching) detach(div);
-			mounted = false;
-			dispose();
+			if (if_block) if_block.d(detaching);
+			if (detaching) detach(if_block_anchor);
 		}
 	};
 }
 
-function create_fragment$i(ctx) {
-	let span;
-	let div;
+function create_fragment$k(ctx) {
 	let t;
-	let each_value = /*trailsToShow*/ ctx[4];
+	let div;
+	let current;
+	let if_block = /*title*/ ctx[2] !== "false" && create_if_block_2$3(ctx);
+	let each_value = /*lines*/ ctx[4];
 	let each_blocks = [];
 
 	for (let i = 0; i < each_value.length; i += 1) {
-		each_blocks[i] = create_each_block$9(get_each_context$9(ctx, each_value, i));
+		each_blocks[i] = create_each_block$b(get_each_context$b(ctx, each_value, i));
 	}
 
-	let if_block = /*sortedTrails*/ ctx[0].length > 1 && create_if_block$5(ctx);
+	const out = i => transition_out(each_blocks[i], 1, 1, () => {
+		each_blocks[i] = null;
+	});
 
 	return {
 		c() {
-			span = element("span");
+			if (if_block) if_block.c();
+			t = space();
 			div = element("div");
 
 			for (let i = 0; i < each_blocks.length; i += 1) {
 				each_blocks[i].c();
 			}
 
-			t = space();
-			if (if_block) if_block.c();
-			attr(div, "class", "trails-div");
-			attr(span, "class", "BC-trail-path-container svelte-3c1frp");
+			attr(div, "class", "BC-tree svelte-yt7jmz");
 		},
 		m(target, anchor) {
-			insert(target, span, anchor);
-			append(span, div);
+			if (if_block) if_block.m(target, anchor);
+			insert(target, t, anchor);
+			insert(target, div, anchor);
 
 			for (let i = 0; i < each_blocks.length; i += 1) {
 				each_blocks[i].m(div, null);
 			}
 
-			append(span, t);
-			if (if_block) if_block.m(span, null);
+			current = true;
 		},
 		p(ctx, [dirty]) {
-			if (dirty & /*settings, trailsToShow, openOrSwitch, app, hoverPreview, view, getAlt, plugin, dropDendron*/ 118) {
-				each_value = /*trailsToShow*/ ctx[4];
-				let i;
-
-				for (i = 0; i < each_value.length; i += 1) {
-					const child_ctx = get_each_context$9(ctx, each_value, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block$9(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(div, null);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value.length;
-			}
-
-			if (/*sortedTrails*/ ctx[0].length > 1) {
+			if (/*title*/ ctx[2] !== "false") {
 				if (if_block) {
 					if_block.p(ctx, dirty);
 				} else {
-					if_block = create_if_block$5(ctx);
+					if_block = create_if_block_2$3(ctx);
 					if_block.c();
-					if_block.m(span, null);
+					if_block.m(t.parentNode, t);
 				}
 			} else if (if_block) {
 				if_block.d(1);
 				if_block = null;
 			}
-		},
-		i: noop,
-		o: noop,
-		d(detaching) {
-			if (detaching) detach(span);
-			destroy_each(each_blocks, detaching);
-			if (if_block) if_block.d();
-		}
-	};
-}
-
-function instance$i($$self, $$props, $$invalidate) {
-	let trailsToShow;
-	
-	
-	let { sortedTrails } = $$props;
-	let { app } = $$props;
-	let { plugin } = $$props;
-	const { settings } = plugin;
-	const { view } = app.workspace.activeLeaf;
-	let showAll = settings.showAll;
-	const click_handler = async (crumb, e) => await openOrSwitch(app, crumb, e);
-	const mouseover_handler = (crumb, e) => hoverPreview(e, view, crumb);
-	const click_handler_1 = () => $$invalidate(3, showAll = !showAll);
-
-	$$self.$$set = $$props => {
-		if ("sortedTrails" in $$props) $$invalidate(0, sortedTrails = $$props.sortedTrails);
-		if ("app" in $$props) $$invalidate(1, app = $$props.app);
-		if ("plugin" in $$props) $$invalidate(2, plugin = $$props.plugin);
-	};
-
-	$$self.$$.update = () => {
-		if ($$self.$$.dirty & /*showAll, sortedTrails*/ 9) {
-			$$invalidate(4, trailsToShow = showAll ? sortedTrails : [sortedTrails[0]]);
-		}
-	};
 
-	return [
-		sortedTrails,
-		app,
-		plugin,
-		showAll,
-		trailsToShow,
-		settings,
-		view,
-		click_handler,
-		mouseover_handler,
-		click_handler_1
-	];
-}
+			if (dirty & /*content, app, lines, openOrSwitch, plugin, isInVault, dropDendron, settings, meetsConditions*/ 473) {
+				each_value = /*lines*/ ctx[4];
+				let i;
 
-class TrailPath extends SvelteComponent {
-	constructor(options) {
-		super();
-		if (!document.getElementById("svelte-3c1frp-style")) add_css$a();
-		init(this, options, instance$i, create_fragment$i, safe_not_equal, { sortedTrails: 0, app: 1, plugin: 2 });
-	}
-}
+				for (i = 0; i < each_value.length; i += 1) {
+					const child_ctx = get_each_context$b(ctx, each_value, i);
 
-/**
- * Returns a copy of `index`, doesn't mutate.
- * @param  {string} index
- */
-function addAliasesToIndex(plugin, index) {
-    var _a, _b, _c, _d;
-    const { aliasesInIndex } = plugin.settings;
-    const copy = index.slice();
-    const lines = copy.split("\n");
-    for (let line of lines) {
-        if (aliasesInIndex) {
-            const note = line.split("- ")[1];
-            if (!note)
-                continue;
-            const currFile = plugin.app.metadataCache.getFirstLinkpathDest(note, "");
-            if (currFile !== null) {
-                const cache = plugin.app.metadataCache.getFileCache(currFile);
-                const alias = (_b = (_a = cache === null || cache === void 0 ? void 0 : cache.frontmatter) === null || _a === void 0 ? void 0 : _a.alias) !== null && _b !== void 0 ? _b : [];
-                const aliases = (_d = (_c = cache === null || cache === void 0 ? void 0 : cache.frontmatter) === null || _c === void 0 ? void 0 : _c.aliases) !== null && _d !== void 0 ? _d : [];
-                const allAliases = [...[alias].flat(3), ...[aliases].flat(3)];
-                if (allAliases.length) {
-                    line += ` (${allAliases.join(", ")})`;
-                }
-            }
-        }
-    }
-    return lines.join("\n");
-}
-/**
- * Create an index of all the paths in the graph.
- * @param allPaths - A list of all paths from the root to the leaves.
- * @param {boolean} asWikilinks - Whether to use wikilinks instead of plain text.
- * @returns A string.
- */
-function createIndex(allPaths, asWikilinks) {
-    let index = "";
-    const copy = lodash.cloneDeep(allPaths);
-    const reversed = copy.map((path) => path.reverse());
-    reversed.forEach((path) => path.shift());
-    const indent = "  ";
-    const visited = {};
-    reversed.forEach((path) => {
-        for (let depth = 0; depth < path.length; depth++) {
-            const currNode = path[depth];
-            // If that node has been visited before at the current depth
-            if (visited.hasOwnProperty(currNode) &&
-                visited[currNode].includes(depth)) {
-                continue;
-            }
-            else {
-                index += `${indent.repeat(depth)}- ${asWikilinks ? makeWiki(currNode) : currNode}`;
-                index += "\n";
-                if (!visited.hasOwnProperty(currNode))
-                    visited[currNode] = [];
-                visited[currNode].push(depth);
-            }
-        }
-    });
-    return index;
-}
-async function copyLocalIndex(plugin) {
-    const { settings, closedG } = plugin;
-    const { wikilinkIndex } = settings;
-    const { basename } = plugin.app.workspace.getActiveFile();
-    const onlyDowns = getSubInDirs(closedG, "down");
-    const allPaths = dfsAllPaths(onlyDowns, basename);
-    const index = addAliasesToIndex(plugin, createIndex(allPaths, wikilinkIndex));
-    loglevel.info({ index });
-    await copy(index);
-}
-async function copyGlobalIndex(plugin) {
-    const { settings, closedG } = plugin;
-    const { wikilinkIndex } = settings;
-    const onlyDowns = getSubInDirs(closedG, "down");
-    const onlyUps = getSubInDirs(closedG, "up");
-    const sinks = getSinks(onlyUps);
-    let globalIndex = "";
-    sinks.forEach((terminal) => {
-        globalIndex += terminal + "\n";
-        const allPaths = dfsAllPaths(onlyDowns, terminal);
-        globalIndex +=
-            addAliasesToIndex(plugin, createIndex(allPaths, wikilinkIndex)) + "\n";
-    });
-    loglevel.info({ globalIndex });
-    await copy(globalIndex);
-}
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+						transition_in(each_blocks[i], 1);
+					} else {
+						each_blocks[i] = create_each_block$b(child_ctx);
+						each_blocks[i].c();
+						transition_in(each_blocks[i], 1);
+						each_blocks[i].m(div, null);
+					}
+				}
 
-/* src\Components\JugglButton.svelte generated by Svelte v3.35.0 */
+				group_outros();
 
-function create_fragment$h(ctx) {
-	let button;
-	let t;
-	let mounted;
-	let dispose;
+				for (i = each_value.length; i < each_blocks.length; i += 1) {
+					out(i);
+				}
 
-	return {
-		c() {
-			button = element("button");
-			t = text(/*icon*/ ctx[0]);
-			attr(button, "type", "button");
-			attr(button, "class", "juggl-button");
-			attr(button, "aria-label", /*title*/ ctx[3]);
-			button.disabled = /*disabled*/ ctx[2];
+				check_outros();
+			}
 		},
-		m(target, anchor) {
-			insert(target, button, anchor);
-			append(button, t);
-
-			if (!mounted) {
-				dispose = listen(button, "click", function () {
-					if (is_function(/*onClick*/ ctx[1])) /*onClick*/ ctx[1].apply(this, arguments);
-				});
+		i(local) {
+			if (current) return;
 
-				mounted = true;
+			for (let i = 0; i < each_value.length; i += 1) {
+				transition_in(each_blocks[i]);
 			}
+
+			current = true;
 		},
-		p(new_ctx, [dirty]) {
-			ctx = new_ctx;
-			if (dirty & /*icon*/ 1) set_data(t, /*icon*/ ctx[0]);
+		o(local) {
+			each_blocks = each_blocks.filter(Boolean);
 
-			if (dirty & /*title*/ 8) {
-				attr(button, "aria-label", /*title*/ ctx[3]);
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				transition_out(each_blocks[i]);
 			}
 
-			if (dirty & /*disabled*/ 4) {
-				button.disabled = /*disabled*/ ctx[2];
-			}
+			current = false;
 		},
-		i: noop,
-		o: noop,
 		d(detaching) {
-			if (detaching) detach(button);
-			mounted = false;
-			dispose();
+			if (if_block) if_block.d(detaching);
+			if (detaching) detach(t);
+			if (detaching) detach(div);
+			destroy_each(each_blocks, detaching);
 		}
 	};
 }
 
-function instance$h($$self, $$props, $$invalidate) {
-	let { icon } = $$props;
-	let { onClick } = $$props;
-	let { disabled = false } = $$props;
-	let { title } = $$props;
-
-	$$self.$$set = $$props => {
-		if ("icon" in $$props) $$invalidate(0, icon = $$props.icon);
-		if ("onClick" in $$props) $$invalidate(1, onClick = $$props.onClick);
-		if ("disabled" in $$props) $$invalidate(2, disabled = $$props.disabled);
-		if ("title" in $$props) $$invalidate(3, title = $$props.title);
-	};
-
-	return [icon, onClick, disabled, title];
-}
-
-class JugglButton extends SvelteComponent {
-	constructor(options) {
-		super();
-
-		init(this, options, instance$h, create_fragment$h, safe_not_equal, {
-			icon: 0,
-			onClick: 1,
-			disabled: 2,
-			title: 3
-		});
-	}
-}
-
-const STORE_ID = "core";
-class BCStoreEvents extends obsidian.Events {
-}
-class BCStore extends obsidian.Component {
-    constructor(graph, metadata, plugin) {
-        super();
-        this.graph = graph;
-        this.cache = metadata;
-        this.plugin = plugin;
-    }
-    asString(node) {
-        const id = VizId.fromNode(node);
-        return id.id.slice(0, -3);
-    }
-    getFile(nodeId) {
-        return this.cache.getFirstLinkpathDest(nodeId.id, "");
-    }
-    async connectNodes(allNodes, newNodes, graph) {
-        const edges = [];
-        const nodesListS = new Set(allNodes.map((node) => this.asString(node)).filter((s) => s));
-        newNodes.forEach((node) => {
-            this.graph.forEachOutEdge(this.asString(node), (key, attr, source, target) => {
-                if (nodesListS.has(target)) {
-                    edges.push({
-                        data: {
-                            id: `BC:${source}->${target}`,
-                            source: VizId.toId(source, STORE_ID) + ".md",
-                            target: VizId.toId(target, STORE_ID) + ".md",
-                            type: attr.field,
-                            dir: attr.dir,
-                        },
-                        classes: `type-${attr.field} dir-${attr.dir} breadcrumbs$`,
-                    });
-                }
-            });
-        });
-        return Promise.resolve(edges);
-    }
-    getEvents(view) {
-        return new BCStoreEvents();
-    }
-    getNeighbourhood(nodeId) {
-        // TODO
-        return Promise.resolve([]);
-    }
-    refreshNode(id, view) {
-        return;
-    }
-    storeId() {
-        return STORE_ID;
-    }
-    get(nodeId, view) {
-        const file = this.getFile(nodeId);
-        if (file === null) {
-            const dangling = nodeDangling(nodeId.id);
-            console.log({ dangling });
-            return Promise.resolve(nodeDangling(nodeId.id));
-        }
-        const cache = this.cache.getFileCache(file);
-        if (cache === null) {
-            console.log("returning empty cache", nodeId);
-            return Promise.resolve(nodeDangling(nodeId.id));
-        }
-        return Promise.resolve(nodeFromFile(file, this.plugin, view.settings, nodeId.toId()));
-    }
-}
-function createJuggl(plugin, target, initialNodes, args) {
-    try {
-        const jugglPlugin = getPlugin(plugin.app);
-        if (!jugglPlugin) {
-            // TODO: Error handling
-            return;
-        }
-        for (let key in JUGGL_CB_DEFAULTS) {
-            if (key in args && args[key] === undefined) {
-                args[key] = JUGGL_CB_DEFAULTS[key];
-            }
-        }
-        const bcStore = new BCStore(plugin.mainG, plugin.app.metadataCache, jugglPlugin);
-        const stores = {
-            coreStore: bcStore,
-            dataStores: [bcStore],
-        };
-        console.log({ args }, { initialNodes });
-        const juggl = jugglPlugin.createJuggl(target, args, stores, initialNodes);
-        plugin.addChild(juggl);
-        // juggl.load();
-        console.log({ juggl });
-        return juggl;
-    }
-    catch (error) {
-        console.log({ error });
-        return null;
-    }
-}
-function zoomToSource(juggl, source) {
-    if (!juggl) {
-        return;
-    }
-    juggl.on("vizReady", (viz) => {
-        // After layout is done, center on source node
-        viz.one("layoutstop", (e) => {
-            const viz = e.cy;
-            const node = viz.$id(VizId.toId(source + ".md", STORE_ID));
-            viz.animate({
-                center: {
-                    eles: node,
-                },
-                duration: 250,
-                queue: false,
-                zoom: 1.7,
-            });
-        });
-    });
-}
-function createJugglTrail(plugin, target, paths, source, args) {
-    const toolbarDiv = document.createElement("div");
-    toolbarDiv.addClass("cy-toolbar");
-    target.appendChild(toolbarDiv);
-    const sectDiv = document.createElement("div");
-    sectDiv.addClass("cy-toolbar-section");
-    toolbarDiv.appendChild(sectDiv);
-    const amtChildren = target.children.length;
-    let jugglUp = null;
-    let jugglDown = null;
-    new JugglButton({
-        target: sectDiv,
-        props: {
-            icon: "↑",
-            onClick: () => {
-                if (jugglUp) {
-                    target.children[amtChildren].classList.remove("juggl-hide");
-                }
-                if (jugglDown) {
-                    target.children[amtChildren + 1].classList.add("juggl-hide");
-                }
-            },
-            disabled: false,
-            title: "Show up graph",
-        },
-    });
-    new JugglButton({
-        target: sectDiv,
-        props: {
-            icon: "↓",
-            onClick: () => {
-                if (jugglDown) {
-                    target.children[amtChildren + 1].classList.remove("juggl-hide");
-                    if (jugglUp) {
-                        target.children[amtChildren].classList.add("juggl-hide");
-                    }
-                    return;
-                }
-                const sub = getSubInDirs(plugin.mainG, "down", "up");
-                const closed = getReflexiveClosure(sub, plugin.settings.userHiers);
-                const subClosed = getSubInDirs(closed, "down");
-                const allPaths = dfsAllPaths(subClosed, source);
-                const index = createIndex(allPaths, false);
-                const lines = index
-                    .split("\n")
-                    .map((line) => {
-                    const pair = line.split("- ");
-                    console.log({ pair });
-                    return pair[1];
-                })
-                    .filter((pair) => pair && pair !== "");
-                let nodesS = new Set(lines);
-                nodesS.add(source);
-                const nodes = Array.from(nodesS).map((s) => s + ".md");
-                console.log({ nodes });
-                jugglDown = createJuggl(plugin, target, nodes, args);
-                if (jugglUp) {
-                    target.children[amtChildren].addClass("juggl-hide");
-                }
-                zoomToSource(jugglDown, source);
-            },
-            disabled: false,
-            title: "Show down graph",
-        },
-    });
-    // new JugglButton({
-    //     target: sectDiv,
-    //     props: {
-    //         icon: "⛶",
-    //         onClick: () => {
-    //             console.log("here")
-    //             target.children[1].addClass("juggl-full-screen")
-    //             target.children[1].setAttr("style", "");
-    //         },
-    //         disabled: false,
-    //         title: "Full height"
-    //     }
-    // });
-    let nodes = Array.from(new Set(paths.reduce((prev, curr) => prev.concat(curr), [])));
-    nodes.push(source);
-    nodes = nodes.map((s) => s + ".md");
-    jugglUp = createJuggl(plugin, target, nodes, args);
-    zoomToSource(jugglUp, source);
+const mouseover_handler = e => {
+	
+}; //   hoverPreview needs an itemView so it can access `app`...
+//   hoverPreview(e, el, link)
+
+const mouseover_handler_1 = e => {
+	
+}; //   hoverPreview needs an itemView so it can access `app`...
+//   hoverPreview(e, el, link)
+
+function instance$k($$self, $$props, $$invalidate) {
+	
+	
+	let { plugin } = $$props;
+	let { el } = $$props;
+	let { dir } = $$props;
+	let { fields } = $$props;
+	let { title } = $$props;
+	let { content } = $$props;
+	let { lines } = $$props;
+	let { froms } = $$props;
+	let { min } = $$props;
+	let { max } = $$props;
+	let { basename } = $$props;
+	const { settings, app } = plugin;
+	const indentToDepth = indent => indent.length / 2 + 1;
+
+	const meetsConditions = (indent, node) => {
+		const depth = indentToDepth(indent);
+		return depth >= min && depth <= max && (froms === undefined || froms.includes(node));
+	};
+
+	const click_handler = async (link, e) => await openOrSwitch(plugin.app, link, e);
+	const click_handler_1 = async (link, e) => await openOrSwitch(plugin.app, link, e);
+
+	$$self.$$set = $$props => {
+		if ("plugin" in $$props) $$invalidate(0, plugin = $$props.plugin);
+		if ("el" in $$props) $$invalidate(9, el = $$props.el);
+		if ("dir" in $$props) $$invalidate(1, dir = $$props.dir);
+		if ("fields" in $$props) $$invalidate(10, fields = $$props.fields);
+		if ("title" in $$props) $$invalidate(2, title = $$props.title);
+		if ("content" in $$props) $$invalidate(3, content = $$props.content);
+		if ("lines" in $$props) $$invalidate(4, lines = $$props.lines);
+		if ("froms" in $$props) $$invalidate(11, froms = $$props.froms);
+		if ("min" in $$props) $$invalidate(12, min = $$props.min);
+		if ("max" in $$props) $$invalidate(13, max = $$props.max);
+		if ("basename" in $$props) $$invalidate(5, basename = $$props.basename);
+	};
+
+	return [
+		plugin,
+		dir,
+		title,
+		content,
+		lines,
+		basename,
+		settings,
+		app,
+		meetsConditions,
+		el,
+		fields,
+		froms,
+		min,
+		max,
+		click_handler,
+		click_handler_1
+	];
+}
+
+class CBTree extends SvelteComponent {
+	constructor(options) {
+		super();
+		if (!document.getElementById("svelte-yt7jmz-style")) add_css$b();
+
+		init(this, options, instance$k, create_fragment$k, safe_not_equal, {
+			plugin: 0,
+			el: 9,
+			dir: 1,
+			fields: 10,
+			title: 2,
+			content: 3,
+			lines: 4,
+			froms: 11,
+			min: 12,
+			max: 13,
+			basename: 5
+		});
+	}
+}
+
+const CAT_DANGLING = 'dangling';
+const CORE_STORE_ID = 'core';
+class VizId {
+    constructor(id, storeId) {
+        this.id = id;
+        this.storeId = storeId;
+    }
+    toString() {
+        return `${this.storeId}:${this.id}`;
+    }
+    toId() {
+        return this.toString();
+    }
+    static fromId(id) {
+        const split = id.split(':');
+        const storeId = split[0];
+        const _id = split.slice(1).join(':');
+        return new VizId(_id, storeId);
+    }
+    static fromNode(node) {
+        return VizId.fromId(node.id());
+    }
+    static fromNodes(nodes) {
+        return nodes.map((n) => VizId.fromNode(n));
+    }
+    static fromFile(file) {
+        return new VizId(file.name, 'core');
+    }
+    static toId(id, storeId) {
+        return new VizId(id, storeId).toId();
+    }
+}
+const _parseTags = function (tags) {
+    return [].concat(...tags
+        .map((tag) => {
+        tag = tag.slice(1);
+        const hSplit = tag.split('/');
+        const tags = [];
+        for (const i in hSplit) {
+            const hTag = hSplit.slice(0, parseInt(i) + 1).join('-');
+            tags.push(`tag-${hTag}`);
+        }
+        return tags;
+    }));
+};
+const getClasses = function (file, metadataCache) {
+    if (file) {
+        const classes = [];
+        if (['png', 'jpg', 'jpeg', 'gif', 'bmp', 'svg', 'tiff'].contains(file.extension)) {
+            classes.push('image');
+        }
+        else if (['mp3', 'webm', 'wav', 'm4a', 'ogg', '3gp', 'flac'].contains(file.extension)) {
+            classes.push('audio');
+        }
+        else if (['mp4', 'webm', 'ogv'].contains(file.extension)) {
+            classes.push('video');
+        }
+        else if (file.extension === 'pdf') {
+            classes.push('pdf');
+        }
+        // This is replaced by the 'path' data attribute.
+        // if (!(file.parent.name === '/' || file.parent.name === '')) {
+        //   classes.push(`folder-${file.parent.name
+        //       .replace(' ', '_')}`);
+        // } else {
+        //   classes.push('root');
+        // }
+        if (file.extension === 'md') {
+            classes.push('note');
+            const cache = metadataCache.getFileCache(file);
+            if (cache?.frontmatter) {
+                if ('image' in cache.frontmatter) {
+                    classes.push('image');
+                }
+                if ('tags' in cache.frontmatter) {
+                    const tags = obsidian.parseFrontMatterTags(cache.frontmatter);
+                    if (tags) {
+                        classes.push(..._parseTags(tags));
+                    }
+                }
+                if ('cssclass' in cache.frontmatter) {
+                    const clazzes = obsidian.parseFrontMatterStringArray(cache.frontmatter, 'cssclass');
+                    if (clazzes) {
+                        classes.push(...clazzes);
+                    }
+                }
+            }
+            if (cache?.tags) {
+                classes.push(..._parseTags(cache.tags.map((t) => t.tag)));
+            }
+        }
+        else {
+            classes.push('file');
+        }
+        return classes;
+    }
+    return [CAT_DANGLING];
+};
+const nodeFromFile = async function (file, plugin, settings, id) {
+    if (!id) {
+        id = VizId.toId(file.name, CORE_STORE_ID);
+    }
+    const cache = plugin.app.metadataCache.getFileCache(file);
+    const name = file.extension === 'md' ? file.basename : file.name;
+    const classes = getClasses(file, plugin.app.metadataCache).join(' ');
+    const data = {
+        id,
+        name,
+        path: file.path,
+    };
+    if (['png', 'jpg', 'jpeg', 'gif', 'bmp', 'svg', 'tiff'].contains(file.extension)) {
+        try {
+            // @ts-ignore
+            data['resource_url'] = `http://localhost:${plugin.settings.imgServerPort}/${encodeURI(file.path)}`;
+        }
+        catch { }
+    }
+    if (settings.readContent && file.extension == 'md') {
+        data['content'] = await plugin.app.vault.cachedRead(file);
+    }
+    const frontmatter = cache?.frontmatter;
+    if (frontmatter) {
+        Object.keys(frontmatter).forEach((k) => {
+            if (!(k === 'position')) {
+                if (k === 'image') {
+                    const imageField = frontmatter[k];
+                    try {
+                        // Check if url. throws error otherwise
+                        new URL(imageField);
+                        data[k] = imageField;
+                    }
+                    catch {
+                        try {
+                            // @ts-ignore
+                            data[k] = `http://localhost:${plugin.settings.imgServerPort}/${encodeURI(imageField)}`;
+                        }
+                        catch { }
+                    }
+                }
+                else {
+                    data[k] = frontmatter[k];
+                }
+            }
+        });
+    }
+    return {
+        group: 'nodes',
+        data: data,
+        classes: classes,
+    };
+};
+const nodeDangling = function (path) {
+    return {
+        group: 'nodes',
+        data: {
+            id: VizId.toId(path, CORE_STORE_ID),
+            name: path,
+        },
+        classes: 'dangling',
+    };
+};
+const wikilinkRegex = '\\[\\[([^\\]\\r\\n]+?)\\]\\]';
+const nameRegex = '[^\\W\\d]\\w*';
+const regexEscape = function (str) {
+    return str.replace(/[-\/\\^$*+?.()|[\]{}]/g, '\\$&');
+};
+const parseTypedLink = function (link, line, typedLinkPrefix) {
+    // TODO: This is something specific I use, but shouldn't keep being in this repo.
+    const regexPublishedIn = new RegExp(`^${regexEscape(typedLinkPrefix)} (publishedIn) (\\d\\d\\d\\d) (${wikilinkRegex},? *)+$`);
+    const matchPI = regexPublishedIn.exec(line);
+    if (!(matchPI === null)) {
+        return {
+            class: 'type-publishedIn',
+            isInline: false,
+            properties: {
+                year: matchPI[2],
+                context: '',
+                type: 'publishedIn',
+            },
+        };
+    }
+    // Intuition: Start with the typed link prefix. Then a neo4j name (nameRegex).
+    // Then one or more of the wikilink group: wikilink regex separated by optional comma and multiple spaces
+    const regex = new RegExp(`^${regexEscape(typedLinkPrefix)} (${nameRegex}) (${wikilinkRegex},? *)+$`);
+    const match = regex.exec(line);
+    const splitLink = link.original.split('|');
+    let alias = null;
+    if (splitLink.length > 1) {
+        alias = splitLink.slice(1).join().slice(0, -2);
+    }
+    if (!(match === null)) {
+        return {
+            class: `type-${match[1]}`,
+            isInline: false,
+            properties: {
+                alias: alias,
+                context: '',
+                type: match[1],
+            },
+        };
+    }
+    return null;
+};
+
+const getPlugin = function (app) {
+    // @ts-ignore
+    if ('juggl' in app.plugins.plugins) {
+        // @ts-ignore
+        return app.plugins.plugins['juggl'];
+    }
+    return null;
+};
+
+/* src\Components\JugglButton.svelte generated by Svelte v3.35.0 */
+
+function create_fragment$j(ctx) {
+	let button;
+	let t;
+	let mounted;
+	let dispose;
+
+	return {
+		c() {
+			button = element("button");
+			t = text(/*icon*/ ctx[0]);
+			attr(button, "type", "button");
+			attr(button, "class", "juggl-button");
+			attr(button, "aria-label", /*title*/ ctx[3]);
+			button.disabled = /*disabled*/ ctx[2];
+		},
+		m(target, anchor) {
+			insert(target, button, anchor);
+			append(button, t);
+
+			if (!mounted) {
+				dispose = listen(button, "click", function () {
+					if (is_function(/*onClick*/ ctx[1])) /*onClick*/ ctx[1].apply(this, arguments);
+				});
+
+				mounted = true;
+			}
+		},
+		p(new_ctx, [dirty]) {
+			ctx = new_ctx;
+			if (dirty & /*icon*/ 1) set_data(t, /*icon*/ ctx[0]);
+
+			if (dirty & /*title*/ 8) {
+				attr(button, "aria-label", /*title*/ ctx[3]);
+			}
+
+			if (dirty & /*disabled*/ 4) {
+				button.disabled = /*disabled*/ ctx[2];
+			}
+		},
+		i: noop,
+		o: noop,
+		d(detaching) {
+			if (detaching) detach(button);
+			mounted = false;
+			dispose();
+		}
+	};
 }
 
-function getLimitedTrailSub(plugin) {
-    const { settings, mainG } = plugin;
-    const { limitTrailCheckboxes, userHiers } = settings;
-    let subGraph;
-    if (getFields(userHiers).every((field) => limitTrailCheckboxes.includes(field))) {
-        subGraph = getSubInDirs(mainG, "up", "down");
-    }
-    else {
-        const oppFields = limitTrailCheckboxes
-            .map((field) => { var _a, _b; return (_b = (_a = getOppFields(userHiers, field)) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : fallbackOppField(field, "up"); })
-            .filter((field) => field !== undefined);
-        subGraph = getSubForFields(mainG, [...limitTrailCheckboxes, ...oppFields]);
-    }
-    const closed = getReflexiveClosure(subGraph, userHiers);
-    return getSubInDirs(closed, "up");
-}
-function getBreadcrumbs(settings, g, currFile) {
-    const { basename, extension } = currFile;
-    if (extension !== "md")
-        return null;
-    const allTrails = bfsAllPaths(g, basename);
-    let filteredTrails = [...allTrails];
-    const { indexNotes, showAllPathsIfNoneToIndexNote } = settings;
-    // Filter for index notes
-    if (
-    // Works for `undefined` and `""`
-    indexNotes[0] &&
-        filteredTrails.length) {
-        filteredTrails = filteredTrails.filter((trail) => indexNotes.includes(trail[0]));
-        if (filteredTrails.length === 0 && showAllPathsIfNoneToIndexNote)
-            filteredTrails = [...allTrails];
-    }
-    const sortedTrails = filteredTrails
-        .filter((trail) => trail.length > 0)
-        .sort((a, b) => a.length - b.length);
-    return sortedTrails;
-}
-function getNextNPrev(plugin, currNode) {
-    const { mainG } = plugin;
-    const { userHiers } = plugin.settings;
-    if (!mainG)
-        return null;
-    const nextNPrev = blankRealNImplied();
-    mainG.forEachEdge(currNode, (k, a, s, t) => {
-        var _a;
-        const { dir, field, implied } = a;
-        if (dir !== "next" && dir !== "prev")
-            return;
-        if (s === currNode) {
-            nextNPrev[dir].reals.push({ field, to: t, real: true, implied });
-        }
-        else {
-            const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, dir);
-            nextNPrev[getOppDir(dir)].implieds.push({
-                field: oppField,
-                to: s,
-                real: false,
-                implied,
-            });
-        }
-    });
-    return nextNPrev;
+function instance$j($$self, $$props, $$invalidate) {
+	let { icon } = $$props;
+	let { onClick } = $$props;
+	let { disabled = false } = $$props;
+	let { title } = $$props;
+
+	$$self.$$set = $$props => {
+		if ("icon" in $$props) $$invalidate(0, icon = $$props.icon);
+		if ("onClick" in $$props) $$invalidate(1, onClick = $$props.onClick);
+		if ("disabled" in $$props) $$invalidate(2, disabled = $$props.disabled);
+		if ("title" in $$props) $$invalidate(3, title = $$props.title);
+	};
+
+	return [icon, onClick, disabled, title];
+}
+
+class JugglButton extends SvelteComponent {
+	constructor(options) {
+		super();
+
+		init(this, options, instance$j, create_fragment$j, safe_not_equal, {
+			icon: 0,
+			onClick: 1,
+			disabled: 2,
+			title: 3
+		});
+	}
+}
+
+const STORE_ID = "core";
+class BCStoreEvents extends obsidian.Events {
 }
-async function drawTrail(plugin) {
-    var _a, _b, _c, _d;
-    try {
-        const { settings, db, app } = plugin;
-        const { showBCs, noPathMessage, respectReadableLineLength, showTrail, showGrid, showJuggl, showPrevNext, showBCsInEditLPMode, } = settings;
-        db.start2G("drawTrail");
-        const activeMDView = app.workspace.getActiveViewOfType(obsidian.MarkdownView);
-        const mode = activeMDView === null || activeMDView === void 0 ? void 0 : activeMDView.getMode();
-        if (!showBCs ||
-            !activeMDView ||
-            (mode !== "preview" && !showBCsInEditLPMode)) {
-            (_a = activeMDView === null || activeMDView === void 0 ? void 0 : activeMDView.containerEl.querySelector(".BC-trail")) === null || _a === void 0 ? void 0 : _a.remove();
-            db.end2G();
-            return;
-        }
-        const { file } = activeMDView;
-        const { frontmatter } = (_b = app.metadataCache.getFileCache(file)) !== null && _b !== void 0 ? _b : {};
-        // @ts-ignore
-        const { hideTrailField } = settings;
-        if (hideTrailField && (frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter[hideTrailField])) {
-            new obsidian.Notice(`${file.basename} still uses an old frontmatter field to hide it's trail. This settings has been deprecated in favour of a standardised field: 'BC-hide-trail'. Please change it so that this note's trail is hidden again.`);
-        }
-        if ((frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter[BC_HIDE_TRAIL]) || (frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter["kanban-plugin"])) {
-            db.end2G();
-            return;
-        }
-        const view = mode === "preview"
-            ? activeMDView.previewMode.containerEl.querySelector("div.markdown-preview-view")
-            : activeMDView.contentEl.querySelector("div.markdown-source-view");
-        (_c = activeMDView.containerEl
-            .querySelectorAll(".BC-trail")) === null || _c === void 0 ? void 0 : _c.forEach((trail) => trail.remove());
-        const closedUp = getLimitedTrailSub(plugin);
-        const sortedTrails = getBreadcrumbs(settings, closedUp, file);
-        loglevel.info({ sortedTrails });
-        const { basename } = file;
-        const { next: { reals: rNext, implieds: iNext }, prev: { reals: rPrev, implieds: iPrev }, } = getNextNPrev(plugin, basename);
-        // Remove duplicate implied
-        const next = [...rNext];
-        iNext.forEach((i) => {
-            if (next.findIndex((n) => n.to === i.to) === -1) {
-                next.push(i);
-            }
-        });
-        const prev = [...rPrev];
-        iPrev.forEach((i) => {
-            if (prev.findIndex((n) => n.to === i.to) === -1) {
-                prev.push(i);
-            }
-        });
-        const noItems = !sortedTrails.length && !next.length && !prev.length;
-        if (noItems && noPathMessage === "") {
-            db.end2G();
-            return;
-        }
-        const selectorForMaxWidth = mode === "preview"
-            ? ".markdown-preview-view.is-readable-line-width .markdown-preview-sizer"
-            : "";
-        const elForMaxWidth = selectorForMaxWidth !== ""
-            ? document.querySelector(selectorForMaxWidth)
-            : null;
-        const max_width = elForMaxWidth
-            ? getComputedStyle(elForMaxWidth).getPropertyValue("max-width")
-            : "100%";
-        const trailDiv = createDiv({
-            cls: `BC-trail ${respectReadableLineLength
-                ? "is-readable-line-width markdown-preview-sizer markdown-preview-section"
-                : ""}`,
-            attr: {
-                style: (mode !== "preview" ? `max-width: ${max_width};` : "") +
-                    "margin: 0 auto;",
-            },
+class BCStore extends obsidian.Component {
+    constructor(graph, metadata, plugin) {
+        super();
+        this.graph = graph;
+        this.cache = metadata;
+        this.plugin = plugin;
+    }
+    asString(node) {
+        const id = VizId.fromNode(node);
+        return id.id.slice(0, -3);
+    }
+    getFile(nodeId) {
+        return this.cache.getFirstLinkpathDest(nodeId.id, "");
+    }
+    async connectNodes(allNodes, newNodes, graph) {
+        const edges = [];
+        const nodesListS = new Set(allNodes.map((node) => this.asString(node)).filter((s) => s));
+        newNodes.forEach((node) => {
+            this.graph.forEachOutEdge(this.asString(node), (key, attr, source, target) => {
+                if (nodesListS.has(target)) {
+                    edges.push({
+                        data: {
+                            id: `BC:${source}->${target}`,
+                            source: VizId.toId(source, STORE_ID) + ".md",
+                            target: VizId.toId(target, STORE_ID) + ".md",
+                            type: attr.field,
+                            dir: attr.dir,
+                        },
+                        classes: `type-${attr.field} dir-${attr.dir} breadcrumbs$`,
+                    });
+                }
+            });
         });
-        plugin.visited.push([file.path, trailDiv]);
-        if (mode === "preview") {
-            view.querySelector("div.markdown-preview-sizer").before(trailDiv);
-        }
-        else {
-            const cmEditor = view.querySelector("div.cm-contentContainer");
-            // const cmSizer = view.querySelector("div.CodeMirror-sizer");
-            if (cmEditor) {
-                (_d = cmEditor.firstChild) === null || _d === void 0 ? void 0 : _d.before(trailDiv);
-            }
-            // if (cmSizer) cmSizer.before(trailDiv);
+        return Promise.resolve(edges);
+    }
+    getEvents(view) {
+        return new BCStoreEvents();
+    }
+    getNeighbourhood(nodeId) {
+        // TODO
+        return Promise.resolve([]);
+    }
+    refreshNode(id, view) {
+        return;
+    }
+    storeId() {
+        return STORE_ID;
+    }
+    get(nodeId, view) {
+        const file = this.getFile(nodeId);
+        if (file === null) {
+            const dangling = nodeDangling(nodeId.id);
+            console.log({ dangling });
+            return Promise.resolve(nodeDangling(nodeId.id));
         }
-        trailDiv.empty();
-        if (settings.indexNotes.includes(basename)) {
-            trailDiv.innerText = "Index Note";
-            db.end2G();
-            return;
+        const cache = this.cache.getFileCache(file);
+        if (cache === null) {
+            console.log("returning empty cache", nodeId);
+            return Promise.resolve(nodeDangling(nodeId.id));
         }
-        if (noItems) {
-            trailDiv.innerText = noPathMessage;
-            db.end2G();
+        return Promise.resolve(nodeFromFile(file, this.plugin, view.settings, nodeId.toId()));
+    }
+}
+function createJuggl(plugin, target, initialNodes, args) {
+    try {
+        const jugglPlugin = getPlugin(plugin.app);
+        if (!jugglPlugin) {
+            // TODO: Error handling
             return;
         }
-        const props = { sortedTrails, app, plugin };
-        if (showTrail && sortedTrails.length) {
-            new TrailPath({
-                target: trailDiv,
-                props,
-            });
-        }
-        if (showGrid && sortedTrails.length) {
-            new TrailGrid({
-                target: trailDiv,
-                props,
-            });
-        }
-        if (showPrevNext && (next.length || prev.length)) {
-            new NextPrev({
-                target: trailDiv,
-                props: { app, plugin, next, prev },
-            });
-        }
-        if (showJuggl && sortedTrails.length) {
-            createJugglTrail(plugin, trailDiv, props.sortedTrails, basename, JUGGL_TRAIL_DEFAULTS);
+        for (let key in JUGGL_CB_DEFAULTS) {
+            if (key in args && args[key] === undefined) {
+                args[key] = JUGGL_CB_DEFAULTS[key];
+            }
         }
-        db.end2G();
+        const bcStore = new BCStore(plugin.mainG, plugin.app.metadataCache, jugglPlugin);
+        const stores = {
+            coreStore: bcStore,
+            dataStores: [bcStore],
+        };
+        console.log({ args }, { initialNodes });
+        const juggl = jugglPlugin.createJuggl(target, args, stores, initialNodes);
+        plugin.addChild(juggl);
+        // juggl.load();
+        console.log({ juggl });
+        return juggl;
     }
-    catch (err) {
-        loglevel.error(err);
-        plugin.db.end2G();
+    catch (error) {
+        console.log({ error });
+        return null;
     }
-}
-
-function getDVMetadataCache(plugin, files) {
-    const { app, db } = plugin;
-    db.startGs("getDVMetadataCache", "dvCaches");
-    const frontms = files.map((file) => {
-        const dvCache = app.plugins.plugins.dataview.api.page(file.path);
-        loglevel.debug(`${file.basename}:`, { dvCache });
-        return dvCache;
-    });
-    db.endGs(2, { frontms });
-    return frontms;
-}
-function getObsMetadataCache(plugin, files) {
-    const { app, db } = plugin;
-    db.startGs("getObsMetadataCache", "obsCaches");
-    const frontms = files.map((file) => {
-        loglevel.debug(`GetObsMetadataCache: ${file.basename}`);
-        const { frontmatter } = app.metadataCache.getFileCache(file);
-        loglevel.debug({ frontmatter });
-        if (frontmatter)
-            return Object.assign({ file }, frontmatter);
-        else
-            return { file };
-    });
-    db.endGs(2, { frontms });
-    return frontms;
 }
-/**
- * Keep unwrapping a proxied item until it isn't one anymore
- * @param  {RawValue} item
- */
-function unproxy(item) {
-    const unproxied = [];
-    const queue = [item];
-    while (queue.length) {
-        const currItem = queue.shift();
-        // @ts-ignore
-        if (typeof currItem.defaultComparator === "function") {
-            const possibleUnproxied = Object.assign({}, currItem);
-            const { values } = possibleUnproxied;
-            if (values)
-                queue.push(...values);
-            else
-                unproxied.push(possibleUnproxied);
-        }
-        else {
-            unproxied.push(currItem);
-        }
+function zoomToSource(juggl, source) {
+    if (!juggl) {
+        return;
     }
-    return unproxied;
+    juggl.on("vizReady", (viz) => {
+        // After layout is done, center on source node
+        viz.one("layoutstop", (e) => {
+            const viz = e.cy;
+            const node = viz.$id(VizId.toId(source + ".md", STORE_ID));
+            viz.animate({
+                center: {
+                    eles: node,
+                },
+                duration: 250,
+                queue: false,
+                zoom: 1.7,
+            });
+        });
+    });
 }
-/**
- * Given a `dvCache[field]` value, parse the link(s) out of it
- * @param  {string|string[]|string[][]|dvLink|dvLink[]|Pos|TFile} value
- * @param  {BCSettings} settings
- */
-function parseFieldValue(value) {
-    if (value === undefined)
-        return [];
-    const parsed = [];
-    try {
-        const rawValuesPreFlat = value;
-        if (!rawValuesPreFlat)
-            return [];
-        if (typeof rawValuesPreFlat === "string") {
-            const splits = rawValuesPreFlat.match(splitLinksRegex);
-            if (splits !== null) {
-                const linkNames = splits.map((link) => getBaseFromMDPath(link.match(dropHeaderOrAlias)[1]));
-                parsed.push(...linkNames);
-            }
-        }
-        else {
-            const rawValues = [value].flat(4);
-            loglevel.debug(...rawValues);
-            rawValues.forEach((rawItem) => {
-                if (!rawItem)
-                    return;
-                const unProxied = unproxy(rawItem);
-                unProxied.forEach((value) => {
-                    if (typeof value === "string" || typeof value === "number") {
-                        const rawAsString = value.toString();
-                        const splits = rawAsString.match(splitLinksRegex);
-                        if (splits !== null) {
-                            const strs = splits.map((link) => getBaseFromMDPath(link.match(dropHeaderOrAlias)[1]));
-                            parsed.push(...strs);
-                        }
-                        else {
-                            const basename = getBaseFromMDPath(rawAsString);
-                            parsed.push(basename.split("#")[0].split("|")[0]);
-                        }
-                    }
-                    else if (value.path !== undefined) {
-                        const basename = getBaseFromMDPath(value.path);
-                        if (basename !== undefined)
-                            parsed.push(basename);
+function createJugglTrail(plugin, target, paths, source, args) {
+    const toolbarDiv = document.createElement("div");
+    toolbarDiv.addClass("cy-toolbar");
+    target.appendChild(toolbarDiv);
+    const sectDiv = document.createElement("div");
+    sectDiv.addClass("cy-toolbar-section");
+    toolbarDiv.appendChild(sectDiv);
+    const amtChildren = target.children.length;
+    let jugglUp = null;
+    let jugglDown = null;
+    new JugglButton({
+        target: sectDiv,
+        props: {
+            icon: "↑",
+            onClick: () => {
+                if (jugglUp) {
+                    target.children[amtChildren].classList.remove("juggl-hide");
+                }
+                if (jugglDown) {
+                    target.children[amtChildren + 1].classList.add("juggl-hide");
+                }
+            },
+            disabled: false,
+            title: "Show up graph",
+        },
+    });
+    new JugglButton({
+        target: sectDiv,
+        props: {
+            icon: "↓",
+            onClick: () => {
+                if (jugglDown) {
+                    target.children[amtChildren + 1].classList.remove("juggl-hide");
+                    if (jugglUp) {
+                        target.children[amtChildren].classList.add("juggl-hide");
                     }
-                });
-            });
+                    return;
+                }
+                const sub = getSubInDirs(plugin.mainG, "down", "up");
+                const closed = getReflexiveClosure(sub, plugin.settings.userHiers);
+                const subClosed = getSubInDirs(closed, "down");
+                const allPaths = dfsAllPaths(subClosed, source);
+                const index = createIndex(allPaths, false);
+                const lines = index
+                    .split("\n")
+                    .map((line) => {
+                    const pair = line.split("- ");
+                    console.log({ pair });
+                    return pair[1];
+                })
+                    .filter((pair) => pair && pair !== "");
+                let nodesS = new Set(lines);
+                nodesS.add(source);
+                const nodes = Array.from(nodesS).map((s) => s + ".md");
+                console.log({ nodes });
+                jugglDown = createJuggl(plugin, target, nodes, args);
+                if (jugglUp) {
+                    target.children[amtChildren].addClass("juggl-hide");
+                }
+                zoomToSource(jugglDown, source);
+            },
+            disabled: false,
+            title: "Show down graph",
+        },
+    });
+    // new JugglButton({
+    //     target: sectDiv,
+    //     props: {
+    //         icon: "⛶",
+    //         onClick: () => {
+    //             console.log("here")
+    //             target.children[1].addClass("juggl-full-screen")
+    //             target.children[1].setAttr("style", "");
+    //         },
+    //         disabled: false,
+    //         title: "Full height"
+    //     }
+    // });
+    let nodes = Array.from(new Set(paths.reduce((prev, curr) => prev.concat(curr), [])));
+    nodes.push(source);
+    nodes = nodes.map((s) => s + ".md");
+    jugglUp = createJuggl(plugin, target, nodes, args);
+    zoomToSource(jugglUp, source);
+}
+
+function getCodeblockCB(plugin) {
+    const { settings } = plugin;
+    return (source, el, ctx) => {
+        var _a, _b;
+        const parsedSource = parseCodeBlockSource(source);
+        console.log(parsedSource);
+        const err = codeblockError(plugin, parsedSource);
+        if (err !== "") {
+            el.innerHTML = err;
+            return;
         }
-        return parsed;
-    }
-    catch (err) {
-        loglevel.error(err);
-        return parsed;
-    }
-}
-async function buildMainG(plugin) {
-    const mainG = new graphology_umd_min.MultiGraph();
-    try {
-        const { settings, app, db } = plugin;
-        db.start2G("initGraphs");
-        const files = app.vault.getMarkdownFiles();
-        const dvQ = !!app.plugins.enabledPlugins.has("dataview");
-        let frontms = dvQ
-            ? getDVMetadataCache(plugin, files)
-            : getObsMetadataCache(plugin, files);
-        if (frontms.some((frontm) => frontm === undefined)) {
-            await wait(2000);
-            frontms = dvQ
-                ? getDVMetadataCache(plugin, files)
-                : getObsMetadataCache(plugin, files);
+        let min = 0, max = Infinity;
+        let { depth, dir, from, implied, flat } = parsedSource;
+        if (depth !== undefined) {
+            const minNum = parseInt(depth[0]);
+            if (!isNaN(minNum))
+                min = minNum;
+            const maxNum = parseInt(depth[1]);
+            if (!isNaN(maxNum))
+                max = maxNum;
         }
+        const currFile = plugin.app.metadataCache.getFirstLinkpathDest(ctx.sourcePath, "");
         const { userHiers } = settings;
-        if (userHiers.length === 0) {
-            db.end2G();
-            new obsidian.Notice("You do not have any Breadcrumbs hierarchies set up.");
-            return mainG;
-        }
-        const useCSV = settings.CSVPaths !== "";
-        const CSVRows = useCSV ? await getCSVRows(plugin) : [];
-        const eligableAlts = {};
-        BC_ALTS.forEach((alt) => (eligableAlts[alt] = []));
-        function noticeIfBroken(frontm) {
-            const basename = getDVBasename(frontm.file);
-            // @ts-ignore
-            if (frontm[BC_FOLDER_NOTE] === true) {
-                const msg = `CONSOLE LOGGED: ${basename} is using a deprecated folder-note value. Instead of 'true', it now takes in the fieldName you want to use.`;
-                new obsidian.Notice(msg);
-                loglevel.warn(msg);
-            }
-            // @ts-ignore
-            if (frontm[BC_LINK_NOTE] === true) {
-                const msg = `CONSOLE LOGGED: ${basename} is using a deprecated link-note value. Instead of 'true', it now takes in the fieldName you want to use.`;
-                new obsidian.Notice(msg);
-                loglevel.warn(msg);
-            }
-            if (frontm["BC-folder-note-up"]) {
-                const msg = `CONSOLE LOGGED: ${basename} is using a deprecated folder-note-up value. Instead of setting the fieldName here, it goes directly into 'BC-folder-note: fieldName'.`;
-                new obsidian.Notice(msg);
-                loglevel.warn(msg);
-            }
-        }
-        db.start2G("addFrontmatterToGraph");
-        frontms.forEach((frontm) => {
-            BC_ALTS.forEach((alt) => {
-                if (frontm[alt]) {
-                    eligableAlts[alt].push(frontm);
-                }
-            });
-            noticeIfBroken(frontm);
-            const basename = getDVBasename(frontm.file);
-            const sourceOrder = getSourceOrder(frontm);
-            iterateHiers(userHiers, (hier, dir, field) => {
-                const values = parseFieldValue(frontm[field]);
-                values.forEach((target) => {
-                    if ((target.startsWith("<%") && target.endsWith("%>")) ||
-                        (target.startsWith("{{") && target.endsWith("}}")))
-                        return;
-                    const targetOrder = getTargetOrder(frontms, target);
-                    populateMain(settings, mainG, basename, field, target, sourceOrder, targetOrder);
-                });
-                if (useCSV)
-                    addCSVCrumbs(mainG, CSVRows, dir, field);
-            });
-        });
-        db.end2G();
-        // SECTION  Juggl Links
-        const jugglLinks = app.plugins.plugins.juggl || settings.parseJugglLinksWithoutJuggl
-            ? await getJugglLinks(plugin, files)
-            : [];
-        if (jugglLinks.length)
-            addJugglLinksToGraph(settings, jugglLinks, frontms, mainG);
-        // !SECTION  Juggl Links
-        // SECTION  Hierarchy Notes
-        db.start2G("Hierarchy Notes");
-        if (settings.hierarchyNotes[0] !== "") {
-            for (const note of settings.hierarchyNotes) {
-                const file = app.metadataCache.getFirstLinkpathDest(note, "");
-                if (file) {
-                    addHNsToGraph(settings, await getHierarchyNoteItems(plugin, file), mainG);
-                }
-                else {
-                    new obsidian.Notice(`${note} is no longer in your vault. It is best to remove it in Breadcrumbs settings.`);
+        const { basename } = currFile;
+        let froms = undefined;
+        if (from !== undefined) {
+            try {
+                const api = (_a = plugin.app.plugins.plugins.dataview) === null || _a === void 0 ? void 0 : _a.api;
+                if (api) {
+                    const pages = (_b = api.pagePaths(from)) === null || _b === void 0 ? void 0 : _b.values;
+                    froms = pages.map(dropFolder);
                 }
+                else
+                    new obsidian.Notice("Dataview must be enabled for `from` to work.");
+            }
+            catch (e) {
+                new obsidian.Notice(`The query "${from}" failed.`);
             }
         }
-        db.end2G();
-        // !SECTION  Hierarchy Notes
-        db.start1G("Alternative Hierarchies");
-        addFolderNotesToGraph(plugin, eligableAlts[BC_FOLDER_NOTE], frontms, mainG);
-        addTagNotesToGraph(plugin, eligableAlts[BC_TAG_NOTE], frontms, mainG);
-        addLinkNotesToGraph(plugin, eligableAlts[BC_LINK_NOTE], frontms, mainG);
-        addRegexNotesToGraph(plugin, eligableAlts[BC_REGEX_NOTE], frontms, mainG);
-        // plugin.addNamingSystemNotesToGraph(frontms, mainG);
-        addTraverseNotesToGraph(plugin, eligableAlts[BC_TRAVERSE_NOTE], mainG, buildObsGraph(app));
-        addDendronNotesToGraph(plugin, frontms, mainG);
-        db.end1G();
-        files.forEach((file) => {
-            const { basename } = file;
-            addNodesIfNot(mainG, [basename]);
-        });
-        db.end2G("graphs inited", { mainG });
-        return mainG;
-    }
-    catch (err) {
-        loglevel.error(err);
-        plugin.db.end2G();
-        return mainG;
-    }
-}
-function addSiblingsFromSameParent(g, settings) {
-    const { userHiers, treatCurrNodeAsImpliedSibling } = settings;
-    g.forEachNode((currN, a) => {
-        // Find parents of current node
-        g.forEachOutEdge(currN, (k, currNAttr, s, parentNode) => {
-            var _a;
-            if (currNAttr.dir !== "up")
-                return;
-            const { fieldDir, fieldHier } = getFieldInfo(userHiers, currNAttr.field);
-            const field = (_a = fieldHier.same[0]) !== null && _a !== void 0 ? _a : fallbackField(currNAttr.field, fieldDir);
-            // Find the children of those parents
-            g.forEachOutEdge(parentNode, (k, a, s, impliedSibling) => {
-                // Skip the current node if the settings say to
-                if (a.dir !== "down" ||
-                    (!treatCurrNodeAsImpliedSibling && impliedSibling === currN))
-                    return;
-                addEdgeIfNot(g, currN, impliedSibling, {
-                    dir: "same",
-                    field,
-                    implied: BC_I_SIBLING_1,
+        const oppDir = getOppDir(dir);
+        const sub = implied === "false"
+            ? getSubInDirs(plugin.mainG, dir)
+            : getSubInDirs(plugin.mainG, dir, oppDir);
+        const closed = getReflexiveClosure(sub, userHiers);
+        const subClosed = getSubInDirs(closed, dir);
+        const allPaths = dfsAllPaths(subClosed, basename);
+        const index = createIndex(allPaths, false);
+        loglevel.info({ allPaths, index });
+        const lines = index
+            .split("\n")
+            .map((line) => {
+            const pair = line.split("- ");
+            return [flat === "true" ? "" : pair[0], pair.slice(1).join("- ")];
+        })
+            .filter((pair) => pair[1] !== "");
+        switch (parsedSource.type) {
+            case "tree":
+                new CBTree({
+                    target: el,
+                    props: Object.assign({ plugin,
+                        el,
+                        min,
+                        max,
+                        lines,
+                        froms,
+                        basename }, parsedSource),
                 });
-            });
-        });
-    });
+                break;
+            case "juggl":
+                createdJugglCB(plugin, el, parsedSource, lines, froms, basename, min, max);
+                break;
+        }
+    };
 }
-function addAuntsUncles(g) {
-    g.forEachNode((currN, a) => {
-        // Find parents of current node
-        g.forEachOutEdge(currN, (k, currEAttr, s, parentNode) => {
-            if (currEAttr.dir !== "up")
-                return;
-            // Find the siblings of those parents
-            g.forEachOutEdge(parentNode, (k, a, s, uncle) => {
-                if (a.dir !== "same")
-                    return;
-                addEdgeIfNot(g, currN, uncle, {
-                    dir: "up",
-                    // Use the starting node's parent field
-                    field: currEAttr.field,
-                    implied: BC_I_AUNT,
-                });
-            });
-        });
+function parseCodeBlockSource(source) {
+    const lines = source.split("\n");
+    const getValue = (type) => {
+        var _a, _b, _c;
+        return (_c = (_b = (_a = lines
+            .find((l) => l.startsWith(`${type}:`))) === null || _a === void 0 ? void 0 : _a.split(":")) === null || _b === void 0 ? void 0 : _b[1]) === null || _c === void 0 ? void 0 : _c.trim();
+    };
+    const results = {};
+    CODEBLOCK_FIELDS.forEach((field) => {
+        results[field] = getValue(field);
+        if (results[field] === "false") {
+            results[field] = false;
+        }
+        if (results[field] === "true") {
+            results[field] = true;
+        }
     });
+    results.field = results.field
+        ? splitAndTrim(results.field)
+        : undefined;
+    if (results.depth) {
+        const match = results.depth.match(/(\d*)-?(\d*)/);
+        results.depth = [match[1], match[2]];
+    }
+    return results;
 }
-function addCousins(g) {
-    g.forEachNode((currN, a) => {
-        // Find parents of current node
-        g.forEachOutEdge(currN, (k, currEAttr, s, parentNode) => {
-            if (currEAttr.dir !== "up")
-                return;
-            // Find the siblings of those parents
-            g.forEachOutEdge(parentNode, (k, parentSiblingAttr, s, uncle) => {
-                if (parentSiblingAttr.dir !== "same")
-                    return;
-                g.forEachOutEdge(uncle, (k, a, s, cousin) => {
-                    if (a.dir !== "down" || currN === cousin)
-                        return;
-                    addEdgeIfNot(g, currN, cousin, {
-                        dir: "same",
-                        field: parentSiblingAttr.field,
-                        implied: BC_I_COUSIN,
-                    });
-                });
-            });
-        });
+function codeblockError(plugin, parsedSource) {
+    var _a;
+    const { dir, fields, type, title, depth, flat, content, from, implied } = parsedSource;
+    const { userHiers } = plugin.settings;
+    let err = "";
+    if (!CODEBLOCK_TYPES.includes(type))
+        err += `<code>type: ${type}</code> is not a valid type. It must be one of: ${CODEBLOCK_TYPES.map((type) => `<code>${type}</code>`).join(", ")}.</br>`;
+    const validDir = DIRECTIONS$1.includes(dir);
+    if (!validDir)
+        err += `<code>dir: ${dir}</code> is not a valid direction.</br>`;
+    const allFields = getFields(userHiers);
+    (_a = [fields].flat()) === null || _a === void 0 ? void 0 : _a.forEach((f) => {
+        if (f !== undefined && !allFields.includes(f))
+            err += `<code>fields: ${f}</code> is not a field in your hierarchies.</br>`;
     });
+    if (title !== undefined && title !== "false")
+        err += `<code>title: ${title}</code> is not a valid value. It has to be <code>false</code>, or leave the entire line out.</br>`;
+    if (depth !== undefined && depth.every((num) => isNaN(parseInt(num))))
+        err += `<code>depth: ${depth}</code> is not a valid value. It has to be a number.</br>`;
+    if (flat !== undefined && flat !== "true")
+        err += `<code>flat: ${flat}</code> is not a valid value. It has to be <code>true</code>, or leave the entire line out.</br>`;
+    if (content !== undefined && content !== "open" && content !== "closed")
+        err += `<code>content: ${content}</code> is not a valid value. It has to be <code>open</code> or <code>closed</code>, or leave the entire line out.</br>`;
+    if (from !== undefined &&
+        !plugin.app.plugins.enabledPlugins.has("dataview")) {
+        err += `Dataview must be enabled to use <code>from</code>.</br>`;
+    }
+    if (implied !== undefined && implied !== "false")
+        err += `<code>implied: ${implied}</code> is not a valid value. It has to be <code>false</code>, or leave the entire line out.</br>`;
+    return err === ""
+        ? ""
+        : `${err}</br>
+    A valid example would be:
+    <pre><code>
+      type: tree
+      dir: ${validDir ? dir : "down"}
+      fields: ${allFields
+            .map((f) => {
+            return { f, dir: getFieldInfo(userHiers, f).fieldDir };
+        })
+            .filter((info) => info.dir === dir)
+            .map((info) => info.f)
+            .join(", ") || "child"}
+      depth: 3
+      </code></pre>`;
 }
-// Sis --> Me <-- Bro
-// Implies: Sis <--> Bro
-function addStructuralEquivalenceSiblings(g) {
-    g.forEachNode((currN, a) => {
-        g.forEachInEdge(currN, (k, aSis, sis, _) => {
-            if (aSis.dir !== "same")
-                return;
-            g.forEachInEdge(currN, (k, aBro, bro, _) => {
-                if (aBro.dir !== "same" || sis === bro)
-                    return;
-                if (aBro.field === aSis.field) {
-                    addEdgeIfNot(g, sis, bro, {
-                        dir: "same",
-                        field: aBro.field,
-                        implied: BC_I_SIBLING_2,
-                    });
-                }
-            });
-        });
-    });
+function indentToDepth(indent) {
+    return indent.length / 2 + 1;
 }
-function buildClosedG(plugin) {
-    const { mainG, settings } = plugin;
-    const { userHiers, impliedRelations: { sameParentIsSibling, parentsSiblingsIsParents, cousinsIsSibling, siblingsSiblingIsSibling, }, } = settings;
-    let closedG = getReflexiveClosure(mainG, userHiers);
-    if (sameParentIsSibling)
-        addSiblingsFromSameParent(closedG, settings);
-    if (parentsSiblingsIsParents)
-        addAuntsUncles(closedG);
-    if (cousinsIsSibling)
-        addCousins(closedG);
-    if (siblingsSiblingIsSibling)
-        addStructuralEquivalenceSiblings(closedG);
-    return closedG;
+function meetsConditions(indent, node, froms, min, max) {
+    const depth = indentToDepth(indent);
+    return (depth >= min &&
+        depth <= max &&
+        (froms === undefined || froms.includes(node)));
 }
-async function refreshIndex(plugin) {
-    var _a;
-    if (!plugin.activeLeafChange)
-        plugin.registerActiveLeafChangeEvent();
-    if (!plugin.layoutChange)
-        plugin.registerLayoutChangeEvent();
-    plugin.mainG = await buildMainG(plugin);
-    plugin.closedG = buildClosedG(plugin);
-    for (const { type } of plugin.VIEWS)
-        await ((_a = plugin.getActiveTYPEView(type)) === null || _a === void 0 ? void 0 : _a.draw());
-    if (plugin.settings.showBCs)
-        await drawTrail(plugin);
-    if (plugin.settings.showRefreshNotice)
-        new obsidian.Notice("Index refreshed");
-}
-
-/* src\Components\Checkboxes.svelte generated by Svelte v3.35.0 */
-
-function add_css$9() {
-	var style = element("style");
-	style.id = "svelte-t4gbbx-style";
-	style.textContent = ".grid.svelte-t4gbbx{display:grid;grid-template-columns:repeat(auto-fit, minmax(100px, 1fr))}";
-	append(document.head, style);
-}
-
-function get_each_context$8(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[11] = list[i];
-	return child_ctx;
-}
-
-// (43:2) {#each options as option}
-function create_each_block$8(ctx) {
-	let div;
-	let label;
-	let input;
-	let input_value_value;
-	let t0;
-	let t1_value = /*option*/ ctx[11] + "";
-	let t1;
-	let t2;
-	let mounted;
-	let dispose;
-
-	return {
-		c() {
-			div = element("div");
-			label = element("label");
-			input = element("input");
-			t0 = space();
-			t1 = text(t1_value);
-			t2 = space();
-			attr(input, "type", "checkbox");
-			input.__value = input_value_value = /*option*/ ctx[11];
-			input.value = input.__value;
-			/*$$binding_groups*/ ctx[8][0].push(input);
-		},
-		m(target, anchor) {
-			insert(target, div, anchor);
-			append(div, label);
-			append(label, input);
-			input.checked = ~/*selected*/ ctx[1].indexOf(input.__value);
-			append(label, t0);
-			append(label, t1);
-			append(div, t2);
-
-			if (!mounted) {
-				dispose = [
-					listen(input, "change", /*input_change_handler*/ ctx[7]),
-					listen(input, "change", /*change_handler*/ ctx[9])
-				];
-
-				mounted = true;
-			}
-		},
-		p(ctx, dirty) {
-			if (dirty & /*options*/ 1 && input_value_value !== (input_value_value = /*option*/ ctx[11])) {
-				input.__value = input_value_value;
-				input.value = input.__value;
-			}
-
-			if (dirty & /*selected*/ 2) {
-				input.checked = ~/*selected*/ ctx[1].indexOf(input.__value);
-			}
-
-			if (dirty & /*options*/ 1 && t1_value !== (t1_value = /*option*/ ctx[11] + "")) set_data(t1, t1_value);
-		},
-		d(detaching) {
-			if (detaching) detach(div);
-			/*$$binding_groups*/ ctx[8][0].splice(/*$$binding_groups*/ ctx[8][0].indexOf(input), 1);
-			mounted = false;
-			run_all(dispose);
-		}
-	};
+function createdJugglCB(plugin, target, args, lines, froms, source, min, max) {
+    const nodes = lines
+        .filter(([indent, node]) => meetsConditions(indent, node, froms, min, max))
+        .map(([_, node]) => node + ".md");
+    if (min <= 0) {
+        nodes.push(source + ".md");
+    }
+    console.log({ lines, nodes });
+    createJuggl(plugin, target, nodes, args);
 }
 
-function create_fragment$g(ctx) {
-	let div0;
-	let button;
-	let t0;
-	let t1_value = (/*toNone*/ ctx[2] ? "None" : "All") + "";
-	let t1;
-	let t2;
-	let div1;
-	let mounted;
-	let dispose;
-	let each_value = /*options*/ ctx[0];
-	let each_blocks = [];
-
-	for (let i = 0; i < each_value.length; i += 1) {
-		each_blocks[i] = create_each_block$8(get_each_context$8(ctx, each_value, i));
-	}
-
-	return {
-		c() {
-			div0 = element("div");
-			button = element("button");
-			t0 = text("Select ");
-			t1 = text(t1_value);
-			t2 = space();
-			div1 = element("div");
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			attr(div1, "class", "grid svelte-t4gbbx");
-		},
-		m(target, anchor) {
-			insert(target, div0, anchor);
-			append(div0, button);
-			append(button, t0);
-			append(button, t1);
-			insert(target, t2, anchor);
-			insert(target, div1, anchor);
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(div1, null);
-			}
-
-			if (!mounted) {
-				dispose = listen(button, "click", /*click_handler*/ ctx[6]);
-				mounted = true;
-			}
-		},
-		p(ctx, [dirty]) {
-			if (dirty & /*toNone*/ 4 && t1_value !== (t1_value = (/*toNone*/ ctx[2] ? "None" : "All") + "")) set_data(t1, t1_value);
-
-			if (dirty & /*options, selected, save*/ 11) {
-				each_value = /*options*/ ctx[0];
-				let i;
-
-				for (i = 0; i < each_value.length; i += 1) {
-					const child_ctx = get_each_context$8(ctx, each_value, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block$8(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(div1, null);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value.length;
-			}
-		},
-		i: noop,
-		o: noop,
-		d(detaching) {
-			if (detaching) detach(div0);
-			if (detaching) detach(t2);
-			if (detaching) detach(div1);
-			destroy_each(each_blocks, detaching);
-			mounted = false;
-			dispose();
-		}
-	};
+async function jumpToFirstDir(plugin, dir) {
+    var _a;
+    const { limitJumpToFirstFields } = plugin.settings;
+    const file = plugin.app.workspace.getActiveFile();
+    if (!file) {
+        new obsidian.Notice("You need to be focussed on a Markdown file");
+        return;
+    }
+    const { basename } = file;
+    const realsNImplieds = getRealnImplied(plugin, basename, dir)[dir];
+    const allBCs = [...realsNImplieds.reals, ...realsNImplieds.implieds];
+    if (allBCs.length === 0) {
+        new obsidian.Notice(`No ${dir} found`);
+        return;
+    }
+    const toNode = (_a = allBCs.find((bc) => limitJumpToFirstFields.includes(bc.field))) === null || _a === void 0 ? void 0 : _a.to;
+    if (!toNode) {
+        new obsidian.Notice(`No note was found in ${dir} given the limited fields allowed: ${limitJumpToFirstFields.join(", ")}`);
+        return;
+    }
+    const toFile = plugin.app.metadataCache.getFirstLinkpathDest(toNode, "");
+    await plugin.app.workspace.activeLeaf.openFile(toFile);
 }
 
-function instance$g($$self, $$props, $$invalidate) {
-	var __awaiter = this && this.__awaiter || function (thisArg, _arguments, P, generator) {
-		function adopt(value) {
-			return value instanceof P
-			? value
-			: new P(function (resolve) {
-						resolve(value);
-					});
-		}
-
-		return new (P || (P = Promise))(function (resolve, reject) {
-				function fulfilled(value) {
-					try {
-						step(generator.next(value));
-					} catch(e) {
-						reject(e);
-					}
-				}
-
-				function rejected(value) {
-					try {
-						step(generator["throw"](value));
-					} catch(e) {
-						reject(e);
-					}
-				}
-
-				function step(result) {
-					result.done
-					? resolve(result.value)
-					: adopt(result.value).then(fulfilled, rejected);
-				}
-
-				step((generator = generator.apply(thisArg, _arguments || [])).next());
-			});
-	};
-
-	
-	let { plugin } = $$props;
-	let { settingName } = $$props;
-	let { options } = $$props;
-	let selected = plugin.settings[settingName];
-	let toNone = selected.length === 0 ? false : true;
-
-	function save() {
-		return __awaiter(this, void 0, void 0, function* () {
-			if (plugin.settings[settingName] === undefined) {
-				return console.log(settingName + " not found in BC settings");
-			}
-
-			$$invalidate(4, plugin.settings[settingName] = selected, plugin);
-			yield plugin.saveSettings();
-			yield refreshIndex(plugin);
-		});
-	}
-
-	const $$binding_groups = [[]];
-
-	const click_handler = async () => {
-		if (toNone) $$invalidate(1, selected = []); else $$invalidate(1, selected = options);
-		await save();
-	};
-
-	function input_change_handler() {
-		selected = get_binding_group_value($$binding_groups[0], this.__value, this.checked);
-		$$invalidate(1, selected);
-	}
-
-	const change_handler = async () => save();
-
-	$$self.$$set = $$props => {
-		if ("plugin" in $$props) $$invalidate(4, plugin = $$props.plugin);
-		if ("settingName" in $$props) $$invalidate(5, settingName = $$props.settingName);
-		if ("options" in $$props) $$invalidate(0, options = $$props.options);
-	};
-
-	$$self.$$.update = () => {
-		if ($$self.$$.dirty & /*selected*/ 2) {
-			$$invalidate(2, toNone = selected.length === 0 ? false : true);
-		}
-	};
-
-	return [
-		options,
-		selected,
-		toNone,
-		save,
-		plugin,
-		settingName,
-		click_handler,
-		input_change_handler,
-		$$binding_groups,
-		change_handler
-	];
+async function thread(plugin, field) {
+    var _a, _b;
+    const { app, settings } = plugin;
+    const { userHiers, writeBCsInline, threadingTemplate, dateFormat, threadingDirTemplates, threadIntoNewPane, } = settings;
+    const currFile = app.workspace.getActiveFile();
+    if (!currFile)
+        return;
+    const newFileParent = app.fileManager.getNewFileParent(currFile.path);
+    const dir = getFieldInfo(userHiers, field).fieldDir;
+    const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, dir);
+    let newBasename = threadingTemplate
+        ? threadingTemplate
+            .replace("{{current}}", currFile.basename)
+            .replace("{{field}}", field)
+            .replace("{{dir}}", dir)
+            //@ts-ignore
+            .replace("{{date}}", moment().format(dateFormat))
+        : "Untitled";
+    let i = 1;
+    while (app.metadataCache.getFirstLinkpathDest(newBasename, "")) {
+        if (i === 1)
+            newBasename += ` ${i}`;
+        else
+            newBasename = newBasename.slice(0, -2) + ` ${i}`;
+        i++;
+    }
+    const crumb = writeBCsInline
+        ? `${oppField}:: [[${currFile.basename}]]`
+        : `---\n${oppField}: ['${currFile.basename}']\n---`;
+    const templatePath = threadingDirTemplates[dir];
+    let newContent = crumb;
+    if (templatePath) {
+        const templateFile = app.metadataCache.getFirstLinkpathDest(templatePath, "");
+        const template = await app.vault.cachedRead(templateFile);
+        newContent = template.replace(/\{\{BC-thread-crumb\}\}/i, writeBCsInline
+            ? `${oppField}:: [[${currFile.basename}]]`
+            : `${oppField}: ['${currFile.basename}']`);
+    }
+    const newFile = await app.vault.create(obsidian.normalizePath(`${newFileParent.path}/${newBasename}.md`), newContent);
+    if (!writeBCsInline) {
+        const { api } = (_b = app.plugins.plugins.metaedit) !== null && _b !== void 0 ? _b : {};
+        if (!api) {
+            new obsidian.Notice("Metaedit must be enabled to write to yaml. Alternatively, toggle the setting `Write Breadcrumbs Inline` to use Dataview inline fields instead.");
+            return;
+        }
+        await createOrUpdateYaml(field, newFile.basename, currFile, app.metadataCache.getFileCache(currFile).frontmatter, api);
+    }
+    else {
+        // TODO Check if this note already has this field
+        let content = await app.vault.read(currFile);
+        const splits = splitAtYaml(content);
+        content =
+            splits[0] +
+                (splits[0].length ? "\n" : "") +
+                `${field}:: [[${newFile.basename}]]` +
+                (splits[1].length ? "\n" : "") +
+                splits[1];
+        await app.vault.modify(currFile, content);
+    }
+    const leaf = threadIntoNewPane
+        ? app.workspace.splitActiveLeaf()
+        : app.workspace.activeLeaf;
+    await leaf.openFile(newFile, { active: true, mode: "source" });
+    if (templatePath) {
+        if (app.plugins.plugins["templater-obsidian"]) {
+            app.commands.executeCommandById("templater-obsidian:replace-in-file-templater");
+        }
+        else {
+            new obsidian.Notice("The Templater plugin must be enabled to resolve the templates in the new note");
+        }
+    }
+    if (threadingTemplate) {
+        // @ts-ignore
+        const editor = leaf.view.editor;
+        editor.setCursor(editor.getValue().length);
+    }
+    else {
+        const noteNameInputs = document.getElementsByClassName("view-header-title");
+        const newNoteInputEl = Array.from(noteNameInputs).find((input) => input.innerText === newBasename);
+        newNoteInputEl.innerText = "";
+        newNoteInputEl.focus();
+    }
 }
 
-class Checkboxes extends SvelteComponent {
-	constructor(options) {
-		super();
-		if (!document.getElementById("svelte-t4gbbx-style")) add_css$9();
-		init(this, options, instance$g, create_fragment$g, safe_not_equal, { plugin: 4, settingName: 5, options: 0 });
-	}
+async function writeBCToFile(plugin, file) {
+    var _a;
+    const { app, settings, mainG } = plugin;
+    const { limitWriteBCCheckboxes, writeBCsInline, userHiers } = settings;
+    const { frontmatter } = app.metadataCache.getFileCache(file);
+    const api = (_a = app.plugins.plugins.metaedit) === null || _a === void 0 ? void 0 : _a.api;
+    if (!api) {
+        new obsidian.Notice("Metaedit must be enabled for this function to work");
+        return;
+    }
+    const succInfo = mainG.mapInEdges(file.basename, (k, a, s, t) => {
+        var _a;
+        const oppField = (_a = getOppFields(userHiers, a.field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(a.field, a.dir);
+        return { succ: s, field: oppField };
+    });
+    for (const { succ, field } of succInfo) {
+        if (!limitWriteBCCheckboxes.includes(field))
+            return;
+        if (!writeBCsInline) {
+            await createOrUpdateYaml(field, succ, file, frontmatter, api);
+        }
+        else {
+            // TODO Check if this note already has this field
+            let content = await app.vault.read(file);
+            const splits = splitAtYaml(content);
+            content =
+                splits[0] +
+                    (splits[0].length ? "\n" : "") +
+                    `${field}:: [[${succ}]]` +
+                    (splits[1].length ? "\n" : "") +
+                    splits[1];
+            await app.vault.modify(file, content);
+        }
+    }
+}
+async function writeBCsToAllFiles(plugin) {
+    if (!plugin.settings.showWriteAllBCsCmd) {
+        new obsidian.Notice("You first need to enable this command in Breadcrumbs' settings.");
+        return;
+    }
+    if (window.confirm("This action will write the implied Breadcrumbs of each file to that file.\nIt uses the MetaEdit plugins API to update the YAML, so it should only affect that frontmatter of your note.\nI can't promise that nothing bad will happen. **This operation cannot be undone**.")) {
+        if (window.confirm("Are you sure? You have been warned that this operation will attempt to update all files with implied breadcrumbs.")) {
+            if (window.confirm("For real, please make a back up before.")) {
+                const notice = new obsidian.Notice("Operation Started");
+                const problemFiles = [];
+                for (const file of plugin.app.vault.getMarkdownFiles()) {
+                    try {
+                        await writeBCToFile(plugin, file);
+                    }
+                    catch (e) {
+                        problemFiles.push(file.path);
+                    }
+                }
+                notice.setMessage("Operation Complete");
+                if (problemFiles.length) {
+                    new obsidian.Notice("Some files were not updated due to errors. Check the console to see which ones.");
+                    console.log({ problemFiles });
+                }
+            }
+        }
+    }
 }
 
-function addGeneralSettings(plugin, containerEl) {
-    const { settings } = plugin;
-    const generalDetails = details("General Options", containerEl);
-    new obsidian.Setting(generalDetails)
-        .setName("Show Refresh Index Notice")
-        .setDesc("When Refreshing Index, should it show a notice once the operation is complete?")
-        .addToggle((toggle) => toggle.setValue(settings.showRefreshNotice).onChange(async (value) => {
-        settings.showRefreshNotice = value;
-        await plugin.saveSettings();
-    }));
-    new obsidian.Setting(generalDetails)
-        .setName("Open Views by Default")
-        .setDesc("Choose which of the views to open onload")
-        .addToggle((toggle) => {
-        toggle
-            .setTooltip("Matrix View")
-            .setValue(settings.openMatrixOnLoad)
-            .onChange(async (value) => {
-            settings.openMatrixOnLoad = value;
-            await plugin.saveSettings();
-        });
-    })
-        .addToggle((toggle) => {
-        toggle
-            .setTooltip("Stats View")
-            .setValue(settings.openStatsOnLoad)
-            .onChange(async (value) => {
-            settings.openStatsOnLoad = value;
-            await plugin.saveSettings();
-        });
-    })
-        .addToggle((toggle) => {
-        toggle
-            .setTooltip("Ducks View")
-            .setValue(settings.openDuckOnLoad)
-            .onChange(async (value) => {
-            settings.openDuckOnLoad = value;
-            await plugin.saveSettings();
+class FieldSuggestor extends obsidian.EditorSuggest {
+    constructor(plugin) {
+        super(plugin.app);
+        this.getSuggestions = (context) => {
+            const { query } = context;
+            return BC_FIELDS_INFO.map((sug) => sug.field).filter((sug) => sug.includes(query));
+        };
+        this.plugin = plugin;
+    }
+    onTrigger(cursor, editor, _) {
+        var _a;
+        if (this.plugin.settings.fieldSuggestor) {
+            const sub = editor.getLine(cursor.line).substring(0, cursor.ch);
+            const match = (_a = sub.match(/^BC-(.*)$/)) === null || _a === void 0 ? void 0 : _a[1];
+            if (match !== undefined) {
+                return {
+                    end: cursor,
+                    start: {
+                        ch: sub.lastIndexOf(match),
+                        line: cursor.line,
+                    },
+                    query: match,
+                };
+            }
+        }
+        return null;
+    }
+    renderSuggestion(suggestion, el) {
+        var _a;
+        el.createDiv({
+            text: suggestion.replace("BC-", ""),
+            cls: "BC-suggester-container",
+            attr: {
+                "aria-label": (_a = BC_FIELDS_INFO.find((f) => f.field === suggestion)) === null || _a === void 0 ? void 0 : _a.desc,
+                "aria-label-position": "right",
+            },
         });
-    })
-        .addToggle((toggle) => {
-        toggle
-            .setTooltip("Tree View")
-            .setValue(settings.openDownOnLoad)
-            .onChange(async (value) => {
-            settings.openDownOnLoad = value;
-            await plugin.saveSettings();
+    }
+    selectSuggestion(suggestion) {
+        var _a;
+        const { context } = this;
+        if (context) {
+            const replacement = `${suggestion}${(_a = BC_FIELDS_INFO.find((f) => f.field === suggestion)) === null || _a === void 0 ? void 0 : _a.after}`;
+            context.editor.replaceRange(replacement, { ch: 0, line: context.start.line }, context.end);
+        }
+    }
+}
+
+async function getCSVRows(plugin) {
+    const { CSVPaths } = plugin.settings;
+    const CSVRows = [];
+    if (CSVPaths === "")
+        return CSVRows;
+    const fullPath = obsidian.normalizePath(CSVPaths);
+    const content = await plugin.app.vault.adapter.read(fullPath);
+    const lines = content.split("\n");
+    const headers = lines[0].split(",").map((head) => head.trim());
+    lines.slice(1).forEach((row) => {
+        const rowObj = {};
+        row
+            .split(",")
+            .map((head) => dropWikilinks(head.trim()))
+            .forEach((item, i) => {
+            rowObj[headers[i]] = item;
         });
+        loglevel.debug({ rowObj });
+        CSVRows.push(rowObj);
     });
-    new obsidian.Setting(generalDetails)
-        .setName("Refresh Index on Note Change")
-        .setDesc("Refresh the Breadcrumbs index data everytime you change notes.\nThis is how Breadcrumbs used to work, making it responsive to changes immediately after changing notes. However, this can be very slow on large vaults, so it is off by default.")
-        .addToggle((toggle) => toggle.setValue(settings.refreshOnNoteChange).onChange(async (value) => {
-        settings.refreshOnNoteChange = value;
-        await plugin.saveSettings();
-    }));
-    new obsidian.Setting(generalDetails)
-        .setName("Fields used for Alternative note names (Aliases)")
-        .setDesc(fragWithHTML("A comma-separated list of fields you use to specify note name aliases. These fields will be checked, in order, and be used to display an alternate note title in both the list/matrix view, and trail/grid view.</br>This field will probably be <code>alias</code> or <code>aliases</code>, but it can be anything, like <code>title</code>, for example."))
-        .addText((text) => {
-        text.setValue(settings.altLinkFields.join(", "));
-        text.inputEl.onblur = async () => {
-            settings.altLinkFields = splitAndTrim(text.getValue());
-            await plugin.saveSettings();
-        };
-    });
-    new obsidian.Setting(generalDetails)
-        .setName("Only show first alias")
-        .setDesc("If a note has an alias (using the fields in the setting above), should only the first one be shown?")
-        .addToggle((toggle) => toggle.setValue(!settings.showAllAliases).onChange(async (value) => {
-        settings.showAllAliases = !value;
-        await plugin.saveSettings();
-        await refreshIndex(plugin);
-    }));
-    new obsidian.Setting(generalDetails)
-        .setName("Use yaml or inline fields for hierarchy data")
-        .setDesc("If enabled, Breadcrumbs will make it's hierarchy using yaml fields, and inline fields (if you have Dataview enabled).\nIf this is disabled, it will only use Juggl links for it's metadata (See below).")
-        .addToggle((toggle) => toggle.setValue(settings.useAllMetadata).onChange(async (value) => {
-        settings.useAllMetadata = value;
-        await plugin.saveSettings();
-        await refreshIndex(plugin);
-    }));
-    new obsidian.Setting(generalDetails)
-        .setName("Use Juggl link syntax without having Juggl installed.")
-        .setDesc(fragWithHTML('Should Breadcrumbs look for <a href="https://juggl.io/Link+Types">Juggl links</a> even if you don\'t have Juggl installed? If you do have Juggl installed, it will always look for Juggl links.'))
-        .addToggle((toggle) => toggle
-        .setValue(settings.parseJugglLinksWithoutJuggl)
-        .onChange(async (value) => {
-        settings.parseJugglLinksWithoutJuggl = value;
-        await plugin.saveSettings();
-    }));
-    generalDetails.createDiv().createEl("strong", {
-        text: "When running `Jump to first <direction>` command, limit which fields it can use.",
-    });
-    new Checkboxes({
-        target: generalDetails,
-        props: {
-            plugin,
-            settingName: "limitJumpToFirstFields",
-            options: getFields(settings.userHiers),
-        },
+    return CSVRows;
+}
+function addCSVCrumbs(g, CSVRows, dir, field) {
+    CSVRows.forEach((row) => {
+        addNodesIfNot(g, [row.file]);
+        if (field === "" || !row[field])
+            return;
+        addNodesIfNot(g, [row[field]]);
+        addEdgeIfNot(g, row.file, row[field], { dir, field });
     });
-    if (plugin.app.plugins.plugins.dataview !== undefined) {
-        new obsidian.Setting(generalDetails)
-            .setName("Dataview Wait Time")
-            .setDesc('Enter an integer number of seconds to wait for the Dataview Index to load. The larger your vault, the longer it will take.\nIf you see an error in the console saying "Cannot destructure currGraphs of undefined", try making this time longer. If you don\'t get that error, you can make this time shorter to make the Breadcrumbs load faster. The default is 5 seconds.')
-            .addText((text) => text
-            .setPlaceholder("Seconds")
-            .setValue((settings.dvWaitTime / 1000).toString())
-            .onChange(async (value) => {
-            const num = Number(value);
-            if (num > 0) {
-                settings.dvWaitTime = num * 1000;
-                await plugin.saveSettings();
-            }
-            else {
-                new obsidian.Notice("The interval must be a non-negative number");
-            }
-        }));
-    }
 }
 
-function addHierarchyNoteSettings(plugin, alternativeHierarchyDetails) {
+function addDendronNotesToGraph(plugin, frontms, mainG) {
     const { settings } = plugin;
-    const hierarchyNoteDetails = subDetails("Hierarchy Notes", alternativeHierarchyDetails);
-    new obsidian.Setting(hierarchyNoteDetails)
-        .setName("Hierarchy Note(s)")
-        .setDesc("A list of notes used to create external Breadcrumb structures.")
-        .addText((text) => {
-        text
-            .setPlaceholder("Hierarchy Note(s)")
-            .setValue(settings.hierarchyNotes.join(", "));
-        text.inputEl.onblur = async () => {
-            const splits = splitAndTrim(text.getValue());
-            if (splits[0] === undefined) {
-                settings.hierarchyNotes = splits;
-                await plugin.saveSettings();
-            }
-            else if (splits.every((note) => isInVault(this.app, note))) {
-                settings.hierarchyNotes = splits;
-                await plugin.saveSettings();
-            }
-            else {
-                new obsidian.Notice("Atleast one of the notes is not in your vault");
+    const { addDendronNotes, dendronNoteDelimiter, dendronNoteField } = settings;
+    if (!addDendronNotes)
+        return;
+    for (const frontm of frontms) {
+        // Doesn't currently work yet
+        if (frontm[BC_IGNORE_DENDRON])
+            continue;
+        const basename = getDVBasename(frontm.file);
+        const splits = basename.split(dendronNoteDelimiter);
+        if (splits.length <= 1)
+            continue;
+        const nextSlice = splits.slice(0, -1).join(dendronNoteDelimiter);
+        if (!nextSlice)
+            continue;
+        const nextSliceFile = frontms.find((fm) => getDVBasename(fm.file) === nextSlice);
+        if (!nextSliceFile || nextSliceFile[BC_IGNORE_DENDRON])
+            continue;
+        const sourceOrder = getSourceOrder(frontm);
+        const targetOrder = getTargetOrder(frontms, nextSlice);
+        populateMain(settings, mainG, basename, dendronNoteField, nextSlice, sourceOrder, targetOrder, true);
+    }
+}
+
+const getSubsFromFolder = (folder) => {
+    const otherNotes = [], subFolders = [];
+    folder.children.forEach((tAbstract) => {
+        if (tAbstract instanceof obsidian.TFile) {
+            otherNotes.push(tAbstract);
+        }
+        else
+            subFolders.push(tAbstract);
+    });
+    return { otherNotes, subFolders };
+};
+function addFolderNotesToGraph(plugin, folderNotes, frontms, mainG) {
+    const { settings, app } = plugin;
+    const { userHiers } = settings;
+    const fields = getFields(userHiers);
+    folderNotes.forEach((altFile) => {
+        const { file } = altFile;
+        const basename = getDVBasename(file);
+        const topFolderName = getFolderName(file);
+        const topFolder = app.vault.getAbstractFileByPath(topFolderName);
+        const targets = frontms
+            .map((ff) => ff.file)
+            .filter((other) => getFolderName(other) === topFolderName && other.path !== file.path)
+            .map(getDVBasename);
+        const field = altFile[BC_FOLDER_NOTE];
+        if (typeof field !== "string" || !fields.includes(field))
+            return;
+        targets.forEach((target) => {
+            // This is getting the order of the folder note, not the source pointing up to it
+            const sourceOrder = getSourceOrder(altFile);
+            const targetOrder = getTargetOrder(frontms, basename);
+            populateMain(settings, mainG, basename, field, target, sourceOrder, targetOrder, true);
+        });
+        if (altFile[BC_FOLDER_NOTE_RECURSIVE]) {
+            const { subFolders } = getSubsFromFolder(topFolder);
+            const folderQueue = [...subFolders];
+            console.log({ startingQueue: folderQueue.slice() });
+            let currFolder = folderQueue.shift();
+            while (currFolder !== undefined) {
+                const { otherNotes, subFolders } = getSubsFromFolder(currFolder);
+                const folderNote = currFolder.name;
+                const targets = otherNotes.map(getDVBasename);
+                // if (!isInVault(app, folderNote, folderNote)) continue;
+                const sourceOrder = 9999; // getSourceOrder(altFile);
+                const targetOrder = 9999; //  getTargetOrder(frontms, basename);
+                const parentFolderNote = currFolder.parent.name;
+                populateMain(settings, mainG, parentFolderNote, field, folderNote, sourceOrder, targetOrder, true);
+                targets.forEach((target) => {
+                    if (target === folderNote)
+                        return;
+                    console.log("adding", folderNote, "→", target);
+                    const sourceOrder = 9999; // getSourceOrder(altFile);
+                    const targetOrder = 9999; //  getTargetOrder(frontms, basename);
+                    populateMain(settings, mainG, folderNote, field, target, sourceOrder, targetOrder, true);
+                });
+                folderQueue.push(...subFolders);
+                currFolder = folderQueue.shift();
             }
-        };
+        }
+        // First add otherNotes to graph
+        // Then iterate subFolders doing the same
+    });
+}
+
+async function getHierarchyNoteItems(plugin, file) {
+    const { userHiers } = plugin.settings;
+    const { listItems } = plugin.app.metadataCache.getFileCache(file);
+    if (!listItems)
+        return [];
+    const lines = (await plugin.app.vault.cachedRead(file)).split("\n");
+    const hierarchyNoteItems = [];
+    const afterBulletReg = new RegExp(/\s*[+*-]\s(.*$)/);
+    const dropWikiLinksReg = new RegExp(/\[\[(.*?)\]\]/);
+    const fieldReg = new RegExp(/(.*?)\[\[.*?\]\]/);
+    const problemFields = [];
+    const upFields = getFields(userHiers, "up");
+    for (const item of listItems) {
+        const currItem = lines[item.position.start.line];
+        const afterBulletCurr = afterBulletReg.exec(currItem)[1];
+        const note = dropWikiLinksReg.exec(afterBulletCurr)[1];
+        let field = fieldReg.exec(afterBulletCurr)[1].trim() || null;
+        // Ensure fieldName is one of the existing up fields. `null` if not
+        if (field !== null && !upFields.includes(field)) {
+            problemFields.push(field);
+            field = null;
+        }
+        const { parent } = item;
+        if (parent >= 0) {
+            const parentNote = lines[parent];
+            const afterBulletParent = afterBulletReg.exec(parentNote)[1];
+            const dropWikiParent = dropWikiLinksReg.exec(afterBulletParent)[1];
+            hierarchyNoteItems.push({
+                note,
+                parent: dropWikiParent,
+                field,
+            });
+        }
+        else {
+            hierarchyNoteItems.push({
+                note,
+                parent: null,
+                field,
+            });
+        }
+    }
+    if (problemFields.length > 0) {
+        const msg = `'${problemFields.join(", ")}' is/are not a field in any of your hierarchies, but is/are being used in: '${file.basename}'`;
+        new obsidian.Notice(msg);
+        console.log(msg, { problemFields });
+    }
+    return hierarchyNoteItems;
+}
+function addHNsToGraph(settings, hnArr, mainG) {
+    const { HNUpField, userHiers } = settings;
+    const upFields = getFields(userHiers, "up");
+    hnArr.forEach((hnItem, i) => {
+        var _a, _b;
+        const { note, field, parent } = hnItem;
+        const upField = field !== null && field !== void 0 ? field : (HNUpField || upFields[0]);
+        const downField = (_a = getOppFields(userHiers, upField)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(upField, "up");
+        if (parent === null) {
+            const s = note;
+            const t = (_b = hnArr[i + 1]) === null || _b === void 0 ? void 0 : _b.note;
+            addNodesIfNot(mainG, [s, t]);
+            addEdgeIfNot(mainG, s, t, { dir: "down", field: downField });
+        }
+        else {
+            addNodesIfNot(mainG, [note, parent]);
+            addEdgeIfNot(mainG, note, parent, {
+                dir: "up",
+                field: upField,
+            });
+            // I don't think this needs to be done if the reverse is done above
+            addNodesIfNot(mainG, [parent, note]);
+            addEdgeIfNot(mainG, parent, note, {
+                dir: "down",
+                field: downField,
+            });
+        }
+    });
+}
+
+// TODO I think it'd be better to do this whole thing as an obj instead of JugglLink[]
+// => {[note: string]: {type: string, linksInLine: string[]}[]}
+async function getJugglLinks(plugin, files) {
+    const { settings, app, db } = plugin;
+    db.start2G("getJugglLinks");
+    const { userHiers } = settings;
+    // Add Juggl links
+    const typedLinksArr = await Promise.all(files.map(async (file) => {
+        var _a, _b;
+        const jugglLink = { file, links: [] };
+        // Use Obs metadatacache to get the links in the current file
+        const links = (_b = (_a = app.metadataCache.getFileCache(file)) === null || _a === void 0 ? void 0 : _a.links) !== null && _b !== void 0 ? _b : [];
+        const content = links.length ? await app.vault.cachedRead(file) : "";
+        const lines = content.split("\n");
+        links.forEach((link) => {
+            var _a, _b, _c, _d, _e, _f, _g;
+            const lineNo = link.position.start.line;
+            const line = lines[lineNo];
+            // Check the line for wikilinks, and return an array of link.innerText
+            const linksInLine = (_c = (_b = (_a = line
+                .match(splitLinksRegex)) === null || _a === void 0 ? void 0 : _a.map((link) => link.slice(2, link.length - 2))) === null || _b === void 0 ? void 0 : _b.map((innerText) => innerText.split("|")[0])) !== null && _c !== void 0 ? _c : [];
+            const typedLinkPrefix = (_e = (_d = app.plugins.plugins.juggl) === null || _d === void 0 ? void 0 : _d.settings.typedLinkPrefix) !== null && _e !== void 0 ? _e : "-";
+            const parsedLinks = parseTypedLink(link, line, typedLinkPrefix);
+            const field = (_g = (_f = parsedLinks === null || parsedLinks === void 0 ? void 0 : parsedLinks.properties) === null || _f === void 0 ? void 0 : _f.type) !== null && _g !== void 0 ? _g : "";
+            if (field === "")
+                return;
+            const { fieldDir } = getFieldInfo(userHiers, field) || {};
+            if (!fieldDir)
+                return;
+            jugglLink.links.push({
+                dir: fieldDir,
+                field,
+                linksInLine,
+            });
+        });
+        return jugglLink;
+    }));
+    const allFields = getFields(userHiers);
+    const filteredLinks = typedLinksArr.map((jugglLink) => {
+        // Filter out links whose type is not in allFields
+        jugglLink.links = jugglLink.links.filter((link) => allFields.includes(link.field));
+        return jugglLink;
     });
-    new obsidian.Setting(hierarchyNoteDetails)
-        .setName("Hierarchy Note Up Field Name")
-        .setDesc("Using the breadcrumbs generated by the hierarchy note, which ↑ type should they count as? This has to be one of the ↑ types of one of your existing hierarchies. If you want it to be something else, you can make a new hierarchy just for it.")
-        .addText((text) => {
-        let finalValue = settings.HNUpField;
-        text.setPlaceholder("").setValue(settings.HNUpField);
-        text.inputEl.onblur = async () => {
-            finalValue = text.getValue();
-            if (finalValue === "") {
-                settings.HNUpField = finalValue;
-                await plugin.saveSettings();
-            }
-            else {
-                const upFields = getFields(settings.userHiers, "up");
-                if (upFields.includes(finalValue)) {
-                    settings.HNUpField = finalValue;
-                    await plugin.saveSettings();
-                }
-                else {
-                    new obsidian.Notice("The field name must be one of the exisitng ↓ fields in your hierarchies.");
-                }
-            }
-        };
+    db.end2G({ filteredLinks });
+    return filteredLinks;
+}
+function addJugglLinksToGraph(settings, jugglLinks, frontms, mainG) {
+    jugglLinks.forEach((jugglLink) => {
+        const { basename } = jugglLink.file;
+        jugglLink.links.forEach((link) => {
+            const { dir, field, linksInLine } = link;
+            if (dir === "")
+                return;
+            const sourceOrder = getTargetOrder(frontms, basename);
+            linksInLine.forEach((linkInLine) => {
+                // Is this a bug? Why not `getSourceOrder`?
+                const targetsOrder = getTargetOrder(frontms, linkInLine);
+                populateMain(settings, mainG, basename, field, linkInLine, sourceOrder, targetsOrder);
+            });
+        });
     });
 }
 
-/* node_modules\svelte-icons\components\IconBase.svelte generated by Svelte v3.35.0 */
-
-function add_css$8() {
-	var style = element("style");
-	style.id = "svelte-c8tyih-style";
-	style.textContent = "svg.svelte-c8tyih{stroke:currentColor;fill:currentColor;stroke-width:0;width:100%;height:auto;max-height:100%}";
-	append(document.head, style);
+function addLinkNotesToGraph(plugin, eligableAlts, frontms, mainG) {
+    const { app, settings } = plugin;
+    const { userHiers } = settings;
+    eligableAlts.forEach((altFile) => {
+        var _a, _b, _c, _d;
+        const linkNoteFile = altFile.file;
+        const linkNoteBasename = getDVBasename(linkNoteFile);
+        let field = altFile[BC_LINK_NOTE];
+        if (typeof field !== "string" || !getFields(userHiers).includes(field))
+            return;
+        const links = (_b = (_a = app.metadataCache
+            .getFileCache(linkNoteFile)) === null || _a === void 0 ? void 0 : _a.links) === null || _b === void 0 ? void 0 : _b.map((l) => l.link.match(/[^#|]+/)[0]);
+        const embeds = (_d = (_c = app.metadataCache
+            .getFileCache(linkNoteFile)) === null || _c === void 0 ? void 0 : _c.embeds) === null || _d === void 0 ? void 0 : _d.map((l) => l.link.match(/[^#|]+/)[0]);
+        const targets = [...(links !== null && links !== void 0 ? links : []), ...(embeds !== null && embeds !== void 0 ? embeds : [])];
+        for (const target of targets) {
+            const sourceOrder = getSourceOrder(altFile);
+            const targetOrder = getTargetOrder(frontms, linkNoteBasename);
+            populateMain(settings, mainG, linkNoteBasename, field, target, sourceOrder, targetOrder, true);
+        }
+    });
 }
 
-// (18:2) {#if title}
-function create_if_block$4(ctx) {
-	let title_1;
-	let t;
-
-	return {
-		c() {
-			title_1 = svg_element("title");
-			t = text(/*title*/ ctx[0]);
-		},
-		m(target, anchor) {
-			insert(target, title_1, anchor);
-			append(title_1, t);
-		},
-		p(ctx, dirty) {
-			if (dirty & /*title*/ 1) set_data(t, /*title*/ ctx[0]);
-		},
-		d(detaching) {
-			if (detaching) detach(title_1);
-		}
-	};
+function addRegexNotesToGraph(plugin, eligableAlts, frontms, mainG) {
+    const { settings } = plugin;
+    const { userHiers, regexNoteField } = settings;
+    const fields = getFields(userHiers);
+    eligableAlts.forEach((altFile) => {
+        const regexNoteFile = altFile.file;
+        const regexNoteBasename = getDVBasename(regexNoteFile);
+        const regex = strToRegex(altFile[BC_REGEX_NOTE]);
+        loglevel.info({ regex });
+        let field = altFile[BC_REGEX_NOTE_FIELD];
+        if (typeof field !== "string" || !fields.includes(field))
+            field = regexNoteField || fields[0];
+        const targets = [];
+        frontms.forEach((page) => {
+            const basename = getDVBasename(page.file);
+            if (basename !== regexNoteBasename && regex.test(basename))
+                targets.push(basename);
+        });
+        for (const target of targets) {
+            const sourceOrder = getSourceOrder(altFile);
+            const targetOrder = getTargetOrder(frontms, regexNoteBasename);
+            populateMain(settings, mainG, regexNoteBasename, field, target, sourceOrder, targetOrder, true);
+        }
+    });
 }
 
-function create_fragment$f(ctx) {
-	let svg;
-	let if_block_anchor;
-	let current;
-	let if_block = /*title*/ ctx[0] && create_if_block$4(ctx);
-	const default_slot_template = /*#slots*/ ctx[3].default;
-	const default_slot = create_slot(default_slot_template, ctx, /*$$scope*/ ctx[2], null);
-
-	return {
-		c() {
-			svg = svg_element("svg");
-			if (if_block) if_block.c();
-			if_block_anchor = empty();
-			if (default_slot) default_slot.c();
-			attr(svg, "xmlns", "http://www.w3.org/2000/svg");
-			attr(svg, "viewBox", /*viewBox*/ ctx[1]);
-			attr(svg, "class", "svelte-c8tyih");
-		},
-		m(target, anchor) {
-			insert(target, svg, anchor);
-			if (if_block) if_block.m(svg, null);
-			append(svg, if_block_anchor);
-
-			if (default_slot) {
-				default_slot.m(svg, null);
-			}
-
-			current = true;
-		},
-		p(ctx, [dirty]) {
-			if (/*title*/ ctx[0]) {
-				if (if_block) {
-					if_block.p(ctx, dirty);
-				} else {
-					if_block = create_if_block$4(ctx);
-					if_block.c();
-					if_block.m(svg, if_block_anchor);
-				}
-			} else if (if_block) {
-				if_block.d(1);
-				if_block = null;
-			}
-
-			if (default_slot) {
-				if (default_slot.p && dirty & /*$$scope*/ 4) {
-					update_slot(default_slot, default_slot_template, ctx, /*$$scope*/ ctx[2], dirty, null, null);
-				}
-			}
-
-			if (!current || dirty & /*viewBox*/ 2) {
-				attr(svg, "viewBox", /*viewBox*/ ctx[1]);
-			}
-		},
-		i(local) {
-			if (current) return;
-			transition_in(default_slot, local);
-			current = true;
-		},
-		o(local) {
-			transition_out(default_slot, local);
-			current = false;
-		},
-		d(detaching) {
-			if (detaching) detach(svg);
-			if (if_block) if_block.d();
-			if (default_slot) default_slot.d(detaching);
-		}
-	};
+const getAllTags = (app, file, withHash = true) => {
+    var _a, _b;
+    const { tags, frontmatter } = app.metadataCache.getFileCache(file);
+    const allTags = [];
+    tags === null || tags === void 0 ? void 0 : tags.forEach((t) => allTags.push(dropHash(t.tag)));
+    [(_a = frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter.tags) !== null && _a !== void 0 ? _a : []].flat().forEach((t) => {
+        splitAndTrim(t).forEach((innerT) => allTags.push(dropHash(innerT)));
+    });
+    [(_b = frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter.tag) !== null && _b !== void 0 ? _b : []].flat().forEach((t) => {
+        splitAndTrim(t).forEach((innerT) => allTags.push(dropHash(innerT)));
+    });
+    return allTags.map((t) => (withHash ? "#" : "") + t.toLowerCase());
+};
+function addTagNotesToGraph(plugin, eligableAlts, frontms, mainG) {
+    const { settings, app } = plugin;
+    const { userHiers, tagNoteField } = settings;
+    const fields = getFields(userHiers);
+    eligableAlts.forEach((altFile) => {
+        const tagNoteFile = altFile.file;
+        const tagNoteBasename = getDVBasename(tagNoteFile);
+        const tag = altFile[BC_TAG_NOTE].trim().toLowerCase();
+        if (!tag.startsWith("#"))
+            return;
+        const hasThisTag = (file) => {
+            const allTags = getAllTags(app, file);
+            return altFile[BC_TAG_NOTE_EXACT] !== undefined
+                ? allTags.includes(tag)
+                : allTags.some((t) => t.includes(tag));
+        };
+        const targets = frontms
+            .map((ff) => ff.file)
+            .filter((file) => file.path !== tagNoteFile.path && hasThisTag(file))
+            .map(getDVBasename);
+        let field = altFile[BC_TAG_NOTE_FIELD];
+        if (typeof field !== "string" || !fields.includes(field))
+            field = tagNoteField || fields[0];
+        targets.forEach((target) => {
+            const sourceOrder = getSourceOrder(altFile);
+            const targetOrder = getTargetOrder(frontms, tagNoteBasename);
+            populateMain(settings, mainG, tagNoteBasename, field, target, sourceOrder, targetOrder, true);
+        });
+    });
 }
 
-function instance$f($$self, $$props, $$invalidate) {
-	let { $$slots: slots = {}, $$scope } = $$props;
-	let { title = null } = $$props;
-	let { viewBox } = $$props;
+function addTraverseNotesToGraph(plugin, traverseNotes, mainG, obsG) {
+    const { settings } = plugin;
+    const { userHiers } = settings;
+    traverseNotes.forEach((altFile) => {
+        const { file } = altFile;
+        const basename = getDVBasename(file);
+        const noCycles = removeCycles(obsG, basename);
+        let field = altFile[BC_TRAVERSE_NOTE];
+        if (typeof field !== "string" || !getFields(userHiers).includes(field))
+            return;
+        const allPaths = dfsAllPaths(noCycles, basename);
+        loglevel.info(allPaths);
+        const reversed = [...allPaths].map((path) => path.reverse());
+        reversed.forEach((path) => {
+            path.forEach((node, i) => {
+                const next = path[i + 1];
+                if (next === undefined)
+                    return;
+                populateMain(settings, mainG, node, field, next, 9999, 9999, true);
+            });
+        });
+    });
+}
 
-	$$self.$$set = $$props => {
-		if ("title" in $$props) $$invalidate(0, title = $$props.title);
-		if ("viewBox" in $$props) $$invalidate(1, viewBox = $$props.viewBox);
-		if ("$$scope" in $$props) $$invalidate(2, $$scope = $$props.$$scope);
-	};
+/* src\Components\NextPrev.svelte generated by Svelte v3.35.0 */
 
-	return [title, viewBox, $$scope, slots];
+function add_css$a() {
+	var style = element("style");
+	style.id = "svelte-1cqb0v5-style";
+	style.textContent = ".BC-nexts.svelte-1cqb0v5 div.svelte-1cqb0v5{text-align:right}.BC-right-arrow.svelte-1cqb0v5.svelte-1cqb0v5{padding-left:5px;float:right}.BC-left-arrow.svelte-1cqb0v5.svelte-1cqb0v5{padding-right:5px;float:left}.BC-nexts.svelte-1cqb0v5.svelte-1cqb0v5{border-left:1px solid var(--background-modifier-border)}.BC-prevs.svelte-1cqb0v5.svelte-1cqb0v5{border-right:1px solid var(--background-modifier-border)}.BC-NextPrev-Container.svelte-1cqb0v5.svelte-1cqb0v5{display:grid;grid-template-columns:1fr 1fr}";
+	append(document.head, style);
 }
 
-class IconBase extends SvelteComponent {
-	constructor(options) {
-		super();
-		if (!document.getElementById("svelte-c8tyih-style")) add_css$8();
-		init(this, options, instance$f, create_fragment$f, safe_not_equal, { title: 0, viewBox: 1 });
-	}
+function get_each_context$a(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[6] = list[i];
+	return child_ctx;
 }
 
-/* node_modules\svelte-icons\fa\FaListUl.svelte generated by Svelte v3.35.0 */
-
-function create_default_slot$5(ctx) {
-	let path;
-
-	return {
-		c() {
-			path = svg_element("path");
-			attr(path, "d", "M48 48a48 48 0 1 0 48 48 48 48 0 0 0-48-48zm0 160a48 48 0 1 0 48 48 48 48 0 0 0-48-48zm0 160a48 48 0 1 0 48 48 48 48 0 0 0-48-48zm448 16H176a16 16 0 0 0-16 16v32a16 16 0 0 0 16 16h320a16 16 0 0 0 16-16v-32a16 16 0 0 0-16-16zm0-320H176a16 16 0 0 0-16 16v32a16 16 0 0 0 16 16h320a16 16 0 0 0 16-16V80a16 16 0 0 0-16-16zm0 160H176a16 16 0 0 0-16 16v32a16 16 0 0 0 16 16h320a16 16 0 0 0 16-16v-32a16 16 0 0 0-16-16z");
-		},
-		m(target, anchor) {
-			insert(target, path, anchor);
-		},
-		d(detaching) {
-			if (detaching) detach(path);
-		}
-	};
+function get_each_context_1$8(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[9] = list[i];
+	return child_ctx;
 }
 
-function create_fragment$e(ctx) {
-	let iconbase;
-	let current;
-	const iconbase_spread_levels = [{ viewBox: "0 0 512 512" }, /*$$props*/ ctx[0]];
-
-	let iconbase_props = {
-		$$slots: { default: [create_default_slot$5] },
-		$$scope: { ctx }
-	};
+// (15:6) {#each prev as p}
+function create_each_block_1$8(ctx) {
+	let div;
+	let strong;
+	let t0_value = /*p*/ ctx[9].field + "";
+	let t0;
+	let t1;
+	let t2_value = /*p*/ ctx[9].to + "";
+	let t2;
+	let t3;
+	let div_class_value;
+	let mounted;
+	let dispose;
 
-	for (let i = 0; i < iconbase_spread_levels.length; i += 1) {
-		iconbase_props = assign(iconbase_props, iconbase_spread_levels[i]);
+	function click_handler(...args) {
+		return /*click_handler*/ ctx[4](/*p*/ ctx[9], ...args);
 	}
 
-	iconbase = new IconBase({ props: iconbase_props });
-
 	return {
 		c() {
-			create_component(iconbase.$$.fragment);
+			div = element("div");
+			strong = element("strong");
+			t0 = text(t0_value);
+			t1 = space();
+			t2 = text(t2_value);
+			t3 = space();
+			attr(div, "class", div_class_value = "" + (null_to_empty(linkClass(/*app*/ ctx[0], /*p*/ ctx[9].to, /*p*/ ctx[9].real)) + " svelte-1cqb0v5"));
 		},
 		m(target, anchor) {
-			mount_component(iconbase, target, anchor);
-			current = true;
-		},
-		p(ctx, [dirty]) {
-			const iconbase_changes = (dirty & /*$$props*/ 1)
-			? get_spread_update(iconbase_spread_levels, [iconbase_spread_levels[0], get_spread_object(/*$$props*/ ctx[0])])
-			: {};
+			insert(target, div, anchor);
+			append(div, strong);
+			append(strong, t0);
+			append(div, t1);
+			append(div, t2);
+			append(div, t3);
 
-			if (dirty & /*$$scope*/ 2) {
-				iconbase_changes.$$scope = { dirty, ctx };
+			if (!mounted) {
+				dispose = listen(div, "click", click_handler);
+				mounted = true;
 			}
-
-			iconbase.$set(iconbase_changes);
-		},
-		i(local) {
-			if (current) return;
-			transition_in(iconbase.$$.fragment, local);
-			current = true;
 		},
-		o(local) {
-			transition_out(iconbase.$$.fragment, local);
-			current = false;
-		},
-		d(detaching) {
-			destroy_component(iconbase, detaching);
-		}
-	};
-}
-
-function instance$e($$self, $$props, $$invalidate) {
-	$$self.$$set = $$new_props => {
-		$$invalidate(0, $$props = assign(assign({}, $$props), exclude_internal_props($$new_props)));
-	};
-
-	$$props = exclude_internal_props($$props);
-	return [$$props];
-}
-
-class FaListUl extends SvelteComponent {
-	constructor(options) {
-		super();
-		init(this, options, instance$e, create_fragment$e, safe_not_equal, {});
-	}
-}
-
-/* node_modules\svelte-icons\fa\FaPlus.svelte generated by Svelte v3.35.0 */
-
-function create_default_slot$4(ctx) {
-	let path;
+		p(new_ctx, dirty) {
+			ctx = new_ctx;
+			if (dirty & /*prev*/ 4 && t0_value !== (t0_value = /*p*/ ctx[9].field + "")) set_data(t0, t0_value);
+			if (dirty & /*prev*/ 4 && t2_value !== (t2_value = /*p*/ ctx[9].to + "")) set_data(t2, t2_value);
 
-	return {
-		c() {
-			path = svg_element("path");
-			attr(path, "d", "M416 208H272V64c0-17.67-14.33-32-32-32h-32c-17.67 0-32 14.33-32 32v144H32c-17.67 0-32 14.33-32 32v32c0 17.67 14.33 32 32 32h144v144c0 17.67 14.33 32 32 32h32c17.67 0 32-14.33 32-32V304h144c17.67 0 32-14.33 32-32v-32c0-17.67-14.33-32-32-32z");
-		},
-		m(target, anchor) {
-			insert(target, path, anchor);
+			if (dirty & /*app, prev*/ 5 && div_class_value !== (div_class_value = "" + (null_to_empty(linkClass(/*app*/ ctx[0], /*p*/ ctx[9].to, /*p*/ ctx[9].real)) + " svelte-1cqb0v5"))) {
+				attr(div, "class", div_class_value);
+			}
 		},
 		d(detaching) {
-			if (detaching) detach(path);
+			if (detaching) detach(div);
+			mounted = false;
+			dispose();
 		}
 	};
 }
 
-function create_fragment$d(ctx) {
-	let iconbase;
-	let current;
-	const iconbase_spread_levels = [{ viewBox: "0 0 448 512" }, /*$$props*/ ctx[0]];
-
-	let iconbase_props = {
-		$$slots: { default: [create_default_slot$4] },
-		$$scope: { ctx }
-	};
+// (28:6) {#each next as n}
+function create_each_block$a(ctx) {
+	let div;
+	let t0_value = /*n*/ ctx[6].to + "";
+	let t0;
+	let t1;
+	let strong;
+	let t2_value = /*n*/ ctx[6].field + "";
+	let t2;
+	let t3;
+	let div_class_value;
+	let mounted;
+	let dispose;
 
-	for (let i = 0; i < iconbase_spread_levels.length; i += 1) {
-		iconbase_props = assign(iconbase_props, iconbase_spread_levels[i]);
+	function click_handler_1(...args) {
+		return /*click_handler_1*/ ctx[5](/*n*/ ctx[6], ...args);
 	}
 
-	iconbase = new IconBase({ props: iconbase_props });
-
 	return {
 		c() {
-			create_component(iconbase.$$.fragment);
+			div = element("div");
+			t0 = text(t0_value);
+			t1 = space();
+			strong = element("strong");
+			t2 = text(t2_value);
+			t3 = space();
+			attr(div, "class", div_class_value = "" + (linkClass(/*app*/ ctx[0], /*n*/ ctx[6].to, /*n*/ ctx[6].real) + " BC-next" + " svelte-1cqb0v5"));
 		},
 		m(target, anchor) {
-			mount_component(iconbase, target, anchor);
-			current = true;
-		},
-		p(ctx, [dirty]) {
-			const iconbase_changes = (dirty & /*$$props*/ 1)
-			? get_spread_update(iconbase_spread_levels, [iconbase_spread_levels[0], get_spread_object(/*$$props*/ ctx[0])])
-			: {};
+			insert(target, div, anchor);
+			append(div, t0);
+			append(div, t1);
+			append(div, strong);
+			append(strong, t2);
+			append(div, t3);
 
-			if (dirty & /*$$scope*/ 2) {
-				iconbase_changes.$$scope = { dirty, ctx };
+			if (!mounted) {
+				dispose = listen(div, "click", click_handler_1);
+				mounted = true;
 			}
-
-			iconbase.$set(iconbase_changes);
-		},
-		i(local) {
-			if (current) return;
-			transition_in(iconbase.$$.fragment, local);
-			current = true;
-		},
-		o(local) {
-			transition_out(iconbase.$$.fragment, local);
-			current = false;
 		},
-		d(detaching) {
-			destroy_component(iconbase, detaching);
-		}
-	};
-}
-
-function instance$d($$self, $$props, $$invalidate) {
-	$$self.$$set = $$new_props => {
-		$$invalidate(0, $$props = assign(assign({}, $$props), exclude_internal_props($$new_props)));
-	};
-
-	$$props = exclude_internal_props($$props);
-	return [$$props];
-}
-
-class FaPlus extends SvelteComponent {
-	constructor(options) {
-		super();
-		init(this, options, instance$d, create_fragment$d, safe_not_equal, {});
-	}
-}
-
-/* node_modules\svelte-icons\fa\FaRegTrashAlt.svelte generated by Svelte v3.35.0 */
-
-function create_default_slot$3(ctx) {
-	let path;
+		p(new_ctx, dirty) {
+			ctx = new_ctx;
+			if (dirty & /*next*/ 2 && t0_value !== (t0_value = /*n*/ ctx[6].to + "")) set_data(t0, t0_value);
+			if (dirty & /*next*/ 2 && t2_value !== (t2_value = /*n*/ ctx[6].field + "")) set_data(t2, t2_value);
 
-	return {
-		c() {
-			path = svg_element("path");
-			attr(path, "d", "M268 416h24a12 12 0 0 0 12-12V188a12 12 0 0 0-12-12h-24a12 12 0 0 0-12 12v216a12 12 0 0 0 12 12zM432 80h-82.41l-34-56.7A48 48 0 0 0 274.41 0H173.59a48 48 0 0 0-41.16 23.3L98.41 80H16A16 16 0 0 0 0 96v16a16 16 0 0 0 16 16h16v336a48 48 0 0 0 48 48h288a48 48 0 0 0 48-48V128h16a16 16 0 0 0 16-16V96a16 16 0 0 0-16-16zM171.84 50.91A6 6 0 0 1 177 48h94a6 6 0 0 1 5.15 2.91L293.61 80H154.39zM368 464H80V128h288zm-212-48h24a12 12 0 0 0 12-12V188a12 12 0 0 0-12-12h-24a12 12 0 0 0-12 12v216a12 12 0 0 0 12 12z");
-		},
-		m(target, anchor) {
-			insert(target, path, anchor);
+			if (dirty & /*app, next*/ 3 && div_class_value !== (div_class_value = "" + (linkClass(/*app*/ ctx[0], /*n*/ ctx[6].to, /*n*/ ctx[6].real) + " BC-next" + " svelte-1cqb0v5"))) {
+				attr(div, "class", div_class_value);
+			}
 		},
 		d(detaching) {
-			if (detaching) detach(path);
+			if (detaching) detach(div);
+			mounted = false;
+			dispose();
 		}
 	};
 }
 
-function create_fragment$c(ctx) {
-	let iconbase;
-	let current;
-	const iconbase_spread_levels = [{ viewBox: "0 0 448 512" }, /*$$props*/ ctx[0]];
-
-	let iconbase_props = {
-		$$slots: { default: [create_default_slot$3] },
-		$$scope: { ctx }
-	};
+function create_fragment$i(ctx) {
+	let div2;
+	let div0;
+	let span0;
+	let t;
+	let div1;
+	let span1;
+	let each_value_1 = /*prev*/ ctx[2];
+	let each_blocks_1 = [];
 
-	for (let i = 0; i < iconbase_spread_levels.length; i += 1) {
-		iconbase_props = assign(iconbase_props, iconbase_spread_levels[i]);
+	for (let i = 0; i < each_value_1.length; i += 1) {
+		each_blocks_1[i] = create_each_block_1$8(get_each_context_1$8(ctx, each_value_1, i));
 	}
 
-	iconbase = new IconBase({ props: iconbase_props });
+	let each_value = /*next*/ ctx[1];
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value.length; i += 1) {
+		each_blocks[i] = create_each_block$a(get_each_context$a(ctx, each_value, i));
+	}
 
 	return {
 		c() {
-			create_component(iconbase.$$.fragment);
+			div2 = element("div");
+			div0 = element("div");
+			span0 = element("span");
+
+			for (let i = 0; i < each_blocks_1.length; i += 1) {
+				each_blocks_1[i].c();
+			}
+
+			t = space();
+			div1 = element("div");
+			span1 = element("span");
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			attr(div0, "class", "BC-prevs svelte-1cqb0v5");
+			attr(div1, "class", "BC-nexts svelte-1cqb0v5");
+			attr(div2, "class", "BC-NextPrev-Container svelte-1cqb0v5");
 		},
 		m(target, anchor) {
-			mount_component(iconbase, target, anchor);
-			current = true;
+			insert(target, div2, anchor);
+			append(div2, div0);
+			append(div0, span0);
+
+			for (let i = 0; i < each_blocks_1.length; i += 1) {
+				each_blocks_1[i].m(span0, null);
+			}
+
+			append(div2, t);
+			append(div2, div1);
+			append(div1, span1);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(span1, null);
+			}
 		},
 		p(ctx, [dirty]) {
-			const iconbase_changes = (dirty & /*$$props*/ 1)
-			? get_spread_update(iconbase_spread_levels, [iconbase_spread_levels[0], get_spread_object(/*$$props*/ ctx[0])])
-			: {};
+			if (dirty & /*linkClass, app, prev, openOrSwitch*/ 5) {
+				each_value_1 = /*prev*/ ctx[2];
+				let i;
 
-			if (dirty & /*$$scope*/ 2) {
-				iconbase_changes.$$scope = { dirty, ctx };
+				for (i = 0; i < each_value_1.length; i += 1) {
+					const child_ctx = get_each_context_1$8(ctx, each_value_1, i);
+
+					if (each_blocks_1[i]) {
+						each_blocks_1[i].p(child_ctx, dirty);
+					} else {
+						each_blocks_1[i] = create_each_block_1$8(child_ctx);
+						each_blocks_1[i].c();
+						each_blocks_1[i].m(span0, null);
+					}
+				}
+
+				for (; i < each_blocks_1.length; i += 1) {
+					each_blocks_1[i].d(1);
+				}
+
+				each_blocks_1.length = each_value_1.length;
 			}
 
-			iconbase.$set(iconbase_changes);
-		},
-		i(local) {
-			if (current) return;
-			transition_in(iconbase.$$.fragment, local);
-			current = true;
-		},
-		o(local) {
-			transition_out(iconbase.$$.fragment, local);
-			current = false;
+			if (dirty & /*linkClass, app, next, openOrSwitch*/ 3) {
+				each_value = /*next*/ ctx[1];
+				let i;
+
+				for (i = 0; i < each_value.length; i += 1) {
+					const child_ctx = get_each_context$a(ctx, each_value, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block$a(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(span1, null);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value.length;
+			}
 		},
+		i: noop,
+		o: noop,
 		d(detaching) {
-			destroy_component(iconbase, detaching);
+			if (detaching) detach(div2);
+			destroy_each(each_blocks_1, detaching);
+			destroy_each(each_blocks, detaching);
 		}
 	};
 }
 
-function instance$c($$self, $$props, $$invalidate) {
-	$$self.$$set = $$new_props => {
-		$$invalidate(0, $$props = assign(assign({}, $$props), exclude_internal_props($$new_props)));
+function instance$i($$self, $$props, $$invalidate) {
+	
+	
+	
+	let { app } = $$props;
+	let { plugin } = $$props;
+	let { next } = $$props;
+	let { prev } = $$props;
+	const click_handler = async (p, e) => openOrSwitch(app, p.to, e);
+	const click_handler_1 = async (n, e) => openOrSwitch(app, n.to, e);
+
+	$$self.$$set = $$props => {
+		if ("app" in $$props) $$invalidate(0, app = $$props.app);
+		if ("plugin" in $$props) $$invalidate(3, plugin = $$props.plugin);
+		if ("next" in $$props) $$invalidate(1, next = $$props.next);
+		if ("prev" in $$props) $$invalidate(2, prev = $$props.prev);
 	};
 
-	$$props = exclude_internal_props($$props);
-	return [$$props];
+	return [app, next, prev, plugin, click_handler, click_handler_1];
 }
 
-class FaRegTrashAlt extends SvelteComponent {
+class NextPrev extends SvelteComponent {
 	constructor(options) {
 		super();
-		init(this, options, instance$c, create_fragment$c, safe_not_equal, {});
+		if (!document.getElementById("svelte-1cqb0v5-style")) add_css$a();
+		init(this, options, instance$i, create_fragment$i, safe_not_equal, { app: 0, plugin: 3, next: 1, prev: 2 });
 	}
 }
 
-/* src\Components\UserHierarchies.svelte generated by Svelte v3.35.0 */
+/* src\Components\TrailGrid.svelte generated by Svelte v3.35.0 */
 
-function add_css$7() {
+function add_css$9() {
 	var style = element("style");
-	style.id = "svelte-5y4abu-style";
-	style.textContent = "label.BC-Arrow-Label.svelte-5y4abu.svelte-5y4abu{display:inline-block;width:20px !important}div.GA-Buttons.svelte-5y4abu.svelte-5y4abu{padding-bottom:5px}details.BC-Hier-Details.svelte-5y4abu.svelte-5y4abu{border:1px solid var(--background-modifier-border);border-radius:10px;padding:10px 5px 10px 10px;margin-bottom:15px}.BC-Hier-Details.svelte-5y4abu summary.svelte-5y4abu::marker{font-size:10px}.BC-Hier-Details.svelte-5y4abu summary button.svelte-5y4abu{float:right}.icon.svelte-5y4abu.svelte-5y4abu{color:var(--text-normal);display:inline-block;padding-top:3px;width:17px;height:17px}";
+	style.id = "svelte-ybyqyo-style";
+	style.textContent = "div.BC-trail-grid.svelte-ybyqyo{border:2px solid var(--background-modifier-border);display:grid;align-items:stretch;width:auto;height:auto}div.BC-trail-grid-item.svelte-ybyqyo{display:flex;flex-direction:column;border:1px solid var(--background-modifier-border);align-items:center;justify-content:center;padding:2px;font-size:smaller}div.BC-trail-grid-item.BC-filler.svelte-ybyqyo{opacity:0.7}.dot.svelte-ybyqyo{height:5px;width:5px;border-radius:50%;display:inline-block}";
 	append(document.head, style);
 }
 
-function get_each_context$7(ctx, list, i) {
+function get_each_context$9(ctx, list, i) {
 	const child_ctx = ctx.slice();
-	child_ctx[12] = list[i];
-	child_ctx[14] = i;
+	child_ctx[20] = list[i];
+	child_ctx[22] = i;
 	return child_ctx;
 }
 
-function get_each_context_1$5(ctx, list, i) {
+function get_each_context_1$7(ctx, list, i) {
 	const child_ctx = ctx.slice();
-	child_ctx[15] = list[i];
+	child_ctx[23] = list[i];
 	return child_ctx;
 }
 
-// (93:6) {#each DIRECTIONS as dir}
-function create_each_block_1$5(ctx) {
+function get_each_context_2$3(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[22] = list[i];
+	return child_ctx;
+}
+
+// (84:8) {#if step.value && settings.gridDots}
+function create_if_block$5(ctx) {
 	let div;
-	let label;
-	let t0_value = ARROW_DIRECTIONS[/*dir*/ ctx[15]] + "";
+	let each_value_2 = lodash.range(Math.floor(/*wordCounts*/ ctx[3][/*step*/ ctx[23].value] / 1000));
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value_2.length; i += 1) {
+		each_blocks[i] = create_each_block_2$3(get_each_context_2$3(ctx, each_value_2, i));
+	}
+
+	return {
+		c() {
+			div = element("div");
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			attr(div, "class", "dots");
+		},
+		m(target, anchor) {
+			insert(target, div, anchor);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(div, null);
+			}
+		},
+		p(ctx, dirty) {
+			if (dirty & /*settings, wordCounts*/ 40) {
+				each_value_2 = lodash.range(Math.floor(/*wordCounts*/ ctx[3][/*step*/ ctx[23].value] / 1000));
+				let i;
+
+				for (i = 0; i < each_value_2.length; i += 1) {
+					const child_ctx = get_each_context_2$3(ctx, each_value_2, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block_2$3(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(div, null);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value_2.length;
+			}
+		},
+		d(detaching) {
+			if (detaching) detach(div);
+			destroy_each(each_blocks, detaching);
+		}
+	};
+}
+
+// (86:12) {#each range(Math.floor(wordCounts[step.value] / 1000)) as i}
+function create_each_block_2$3(ctx) {
+	let span;
+
+	return {
+		c() {
+			span = element("span");
+			attr(span, "class", "dot svelte-ybyqyo");
+			set_style(span, "background-color", /*settings*/ ctx[5].dotsColour);
+		},
+		m(target, anchor) {
+			insert(target, span, anchor);
+		},
+		p: noop,
+		d(detaching) {
+			if (detaching) detach(span);
+		}
+	};
+}
+
+// (67:4) {#each allRuns[i] as step}
+function create_each_block_1$7(ctx) {
+	let div1;
+	let div0;
+	let t0_value = (getAlt(/*step*/ ctx[23].value, /*plugin*/ ctx[2]) ?? dropDendron(/*step*/ ctx[23].value, /*settings*/ ctx[5])) + "";
 	let t0;
-	let label_for_value;
+	let div0_class_value;
 	let t1;
-	let input;
-	let input_name_value;
-	let input_value_value;
+	let t2;
+	let div1_class_value;
+	let div1_style_value;
 	let mounted;
 	let dispose;
+	let if_block = /*step*/ ctx[23].value && /*settings*/ ctx[5].gridDots && create_if_block$5(ctx);
 
-	function change_handler(...args) {
-		return /*change_handler*/ ctx[10](/*i*/ ctx[14], /*dir*/ ctx[15], ...args);
+	function click_handler(...args) {
+		return /*click_handler*/ ctx[9](/*step*/ ctx[23], ...args);
+	}
+
+	function mouseover_handler(...args) {
+		return /*mouseover_handler*/ ctx[10](/*step*/ ctx[23], ...args);
 	}
 
 	return {
 		c() {
-			div = element("div");
-			label = element("label");
+			div1 = element("div");
+			div0 = element("div");
 			t0 = text(t0_value);
 			t1 = space();
-			input = element("input");
-			attr(label, "class", "BC-Arrow-Label svelte-5y4abu");
-			attr(label, "for", label_for_value = /*dir*/ ctx[15]);
-			attr(input, "type", "text");
-			attr(input, "size", "20");
-			attr(input, "name", input_name_value = /*dir*/ ctx[15]);
-			input.value = input_value_value = /*hier*/ ctx[12][/*dir*/ ctx[15]]?.join(", ") ?? "";
+			if (if_block) if_block.c();
+			t2 = space();
+			attr(div0, "class", div0_class_value = "" + (null_to_empty(linkClass(/*app*/ ctx[1], /*step*/ ctx[23].value)) + " svelte-ybyqyo"));
+			attr(div1, "class", div1_class_value = "BC-trail-grid-item " + (/*step*/ ctx[23].value === "" ? "BC-filler" : "") + " svelte-ybyqyo");
+
+			attr(div1, "style", div1_style_value = "\r\n            grid-area: " + (/*step*/ ctx[23].first + 1) + " / " + (/*i*/ ctx[22] + 1) + " / \r\n                " + (/*step*/ ctx[23].last + 2) + " / " + (/*i*/ ctx[22] + 2) + ";\r\n            " + (/*settings*/ ctx[5].gridHeatmap
+			? `background-color: ${/*settings*/ ctx[5].heatmapColour}${Math.round(/*children*/ ctx[4][/*step*/ ctx[23].value] * 200 + 55).toString(16)}`
+			: ""));
 		},
 		m(target, anchor) {
-			insert(target, div, anchor);
-			append(div, label);
-			append(label, t0);
-			append(div, t1);
-			append(div, input);
+			insert(target, div1, anchor);
+			append(div1, div0);
+			append(div0, t0);
+			append(div1, t1);
+			if (if_block) if_block.m(div1, null);
+			append(div1, t2);
 
 			if (!mounted) {
-				dispose = listen(input, "change", change_handler);
+				dispose = [
+					listen(div1, "click", click_handler),
+					listen(div1, "mouseover", mouseover_handler)
+				];
+
 				mounted = true;
 			}
 		},
 		p(new_ctx, dirty) {
 			ctx = new_ctx;
+			if (dirty & /*plugin*/ 4 && t0_value !== (t0_value = (getAlt(/*step*/ ctx[23].value, /*plugin*/ ctx[2]) ?? dropDendron(/*step*/ ctx[23].value, /*settings*/ ctx[5])) + "")) set_data(t0, t0_value);
 
-			if (dirty & /*currHiers*/ 1 && input_value_value !== (input_value_value = /*hier*/ ctx[12][/*dir*/ ctx[15]]?.join(", ") ?? "") && input.value !== input_value_value) {
-				input.value = input_value_value;
+			if (dirty & /*app*/ 2 && div0_class_value !== (div0_class_value = "" + (null_to_empty(linkClass(/*app*/ ctx[1], /*step*/ ctx[23].value)) + " svelte-ybyqyo"))) {
+				attr(div0, "class", div0_class_value);
+			}
+
+			if (/*step*/ ctx[23].value && /*settings*/ ctx[5].gridDots) if_block.p(ctx, dirty);
+
+			if (dirty & /*children*/ 16 && div1_style_value !== (div1_style_value = "\r\n            grid-area: " + (/*step*/ ctx[23].first + 1) + " / " + (/*i*/ ctx[22] + 1) + " / \r\n                " + (/*step*/ ctx[23].last + 2) + " / " + (/*i*/ ctx[22] + 2) + ";\r\n            " + (/*settings*/ ctx[5].gridHeatmap
+			? `background-color: ${/*settings*/ ctx[5].heatmapColour}${Math.round(/*children*/ ctx[4][/*step*/ ctx[23].value] * 200 + 55).toString(16)}`
+			: ""))) {
+				attr(div1, "style", div1_style_value);
 			}
 		},
 		d(detaching) {
-			if (detaching) detach(div);
+			if (detaching) detach(div1);
+			if (if_block) if_block.d();
 			mounted = false;
-			dispose();
+			run_all(dispose);
 		}
 	};
 }
 
-// (61:2) {#each currHiers as hier, i}
-function create_each_block$7(ctx) {
-	let details;
-	let summary;
-	let t0_value = DIRECTIONS$1.map(func).map(func_1).join(" ") + "";
-	let t0;
-	let t1;
-	let span;
-	let button0;
-	let t3;
-	let button1;
-	let t5;
-	let button2;
-	let t7;
-	let t8;
-	let mounted;
-	let dispose;
-
-	function func(...args) {
-		return /*func*/ ctx[6](/*hier*/ ctx[12], ...args);
-	}
-
-	function click_handler_3() {
-		return /*click_handler_3*/ ctx[7](/*i*/ ctx[14]);
-	}
-
-	function click_handler_4() {
-		return /*click_handler_4*/ ctx[8](/*i*/ ctx[14]);
-	}
-
-	function click_handler_5() {
-		return /*click_handler_5*/ ctx[9](/*i*/ ctx[14]);
-	}
-
-	let each_value_1 = DIRECTIONS$1;
+// (66:2) {#each transposedTrails as col, i}
+function create_each_block$9(ctx) {
+	let each_1_anchor;
+	let each_value_1 = /*allRuns*/ ctx[8][/*i*/ ctx[22]];
 	let each_blocks = [];
 
 	for (let i = 0; i < each_value_1.length; i += 1) {
-		each_blocks[i] = create_each_block_1$5(get_each_context_1$5(ctx, each_value_1, i));
+		each_blocks[i] = create_each_block_1$7(get_each_context_1$7(ctx, each_value_1, i));
 	}
 
 	return {
 		c() {
-			details = element("details");
-			summary = element("summary");
-			t0 = text(t0_value);
-			t1 = space();
-			span = element("span");
-			button0 = element("button");
-			button0.textContent = "↑";
-			t3 = space();
-			button1 = element("button");
-			button1.textContent = "↓";
-			t5 = space();
-			button2 = element("button");
-			button2.textContent = "X";
-			t7 = space();
-
 			for (let i = 0; i < each_blocks.length; i += 1) {
 				each_blocks[i].c();
 			}
 
-			t8 = space();
-			attr(button0, "aria-label", "Swap with Hierarchy Above");
-			attr(button0, "class", "svelte-5y4abu");
-			attr(button1, "aria-label", "Swap with Hierarchy Below");
-			attr(button1, "class", "svelte-5y4abu");
-			attr(button2, "aria-label", "Remove Hierarchy");
-			attr(button2, "class", "svelte-5y4abu");
-			attr(span, "class", "GA-Buttons");
-			attr(summary, "class", "svelte-5y4abu");
-			attr(details, "class", "BC-Hier-Details svelte-5y4abu");
+			each_1_anchor = empty();
 		},
 		m(target, anchor) {
-			insert(target, details, anchor);
-			append(details, summary);
-			append(summary, t0);
-			append(summary, t1);
-			append(summary, span);
-			append(span, button0);
-			append(span, t3);
-			append(span, button1);
-			append(span, t5);
-			append(span, button2);
-			append(details, t7);
-
 			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(details, null);
+				each_blocks[i].m(target, anchor);
 			}
 
-			append(details, t8);
-
-			if (!mounted) {
-				dispose = [
-					listen(button0, "click", click_handler_3),
-					listen(button1, "click", click_handler_4),
-					listen(button2, "click", click_handler_5)
-				];
-
-				mounted = true;
-			}
+			insert(target, each_1_anchor, anchor);
 		},
-		p(new_ctx, dirty) {
-			ctx = new_ctx;
-			if (dirty & /*currHiers*/ 1 && t0_value !== (t0_value = DIRECTIONS$1.map(func).map(func_1).join(" ") + "")) set_data(t0, t0_value);
-
-			if (dirty & /*DIRECTIONS, currHiers, splitAndTrim, update, ARROW_DIRECTIONS*/ 3) {
-				each_value_1 = DIRECTIONS$1;
+		p(ctx, dirty) {
+			if (dirty & /*allRuns, settings, Math, children, openOrSwitch, app, hoverPreview, activeLeafView, range, wordCounts, linkClass, getAlt, plugin, dropDendron*/ 382) {
+				each_value_1 = /*allRuns*/ ctx[8][/*i*/ ctx[22]];
 				let i;
 
 				for (i = 0; i < each_value_1.length; i += 1) {
-					const child_ctx = get_each_context_1$5(ctx, each_value_1, i);
+					const child_ctx = get_each_context_1$7(ctx, each_value_1, i);
 
 					if (each_blocks[i]) {
 						each_blocks[i].p(child_ctx, dirty);
 					} else {
-						each_blocks[i] = create_each_block_1$5(child_ctx);
+						each_blocks[i] = create_each_block_1$7(child_ctx);
 						each_blocks[i].c();
-						each_blocks[i].m(details, t8);
+						each_blocks[i].m(each_1_anchor.parentNode, each_1_anchor);
 					}
 				}
 
@@ -26821,117 +25567,54 @@ function create_each_block$7(ctx) {
 			}
 		},
 		d(detaching) {
-			if (detaching) detach(details);
 			destroy_each(each_blocks, detaching);
-			mounted = false;
-			run_all(dispose);
+			if (detaching) detach(each_1_anchor);
 		}
 	};
 }
 
-function create_fragment$b(ctx) {
-	let div4;
-	let div3;
-	let button0;
-	let div0;
-	let faplus;
-	let t0;
-	let button1;
-	let div1;
-	let faregtrashalt;
-	let t1;
-	let button2;
-	let div2;
-	let falistul;
-	let t2;
-	let current;
-	let mounted;
-	let dispose;
-	faplus = new FaPlus({});
-	faregtrashalt = new FaRegTrashAlt({});
-	falistul = new FaListUl({});
-	let each_value = /*currHiers*/ ctx[0];
+function create_fragment$h(ctx) {
+	let div;
+	let each_value = /*transposedTrails*/ ctx[7];
 	let each_blocks = [];
 
 	for (let i = 0; i < each_value.length; i += 1) {
-		each_blocks[i] = create_each_block$7(get_each_context$7(ctx, each_value, i));
+		each_blocks[i] = create_each_block$9(get_each_context$9(ctx, each_value, i));
 	}
 
 	return {
 		c() {
-			div4 = element("div");
-			div3 = element("div");
-			button0 = element("button");
-			div0 = element("div");
-			create_component(faplus.$$.fragment);
-			t0 = space();
-			button1 = element("button");
-			div1 = element("div");
-			create_component(faregtrashalt.$$.fragment);
-			t1 = space();
-			button2 = element("button");
-			div2 = element("div");
-			create_component(falistul.$$.fragment);
-			t2 = space();
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			attr(div0, "class", "icon svelte-5y4abu");
-			attr(button0, "aria-label", "Add New Hierarchy");
-			attr(div1, "class", "icon svelte-5y4abu");
-			attr(button1, "aria-label", "Reset All Hierarchies");
-			attr(div2, "class", "icon svelte-5y4abu");
-			attr(button2, "aria-label", "Show Hierarchies");
-			attr(div3, "class", "GA-Buttons svelte-5y4abu");
-		},
-		m(target, anchor) {
-			insert(target, div4, anchor);
-			append(div4, div3);
-			append(div3, button0);
-			append(button0, div0);
-			mount_component(faplus, div0, null);
-			append(div3, t0);
-			append(div3, button1);
-			append(button1, div1);
-			mount_component(faregtrashalt, div1, null);
-			append(div3, t1);
-			append(div3, button2);
-			append(button2, div2);
-			mount_component(falistul, div2, null);
-			append(div4, t2);
+			div = element("div");
 
 			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(div4, null);
+				each_blocks[i].c();
 			}
 
-			current = true;
-
-			if (!mounted) {
-				dispose = [
-					listen(button0, "click", /*click_handler*/ ctx[3]),
-					listen(button1, "click", /*click_handler_1*/ ctx[4]),
-					listen(button2, "click", /*click_handler_2*/ ctx[5])
-				];
+			attr(div, "class", "BC-trail-grid svelte-ybyqyo");
+			set_style(div, "grid-template-columns", ("1fr ").repeat(/*transposedTrails*/ ctx[7].length));
+			set_style(div, "grid-template-rows", ("1fr ").repeat(/*sortedTrails*/ ctx[0].length));
+		},
+		m(target, anchor) {
+			insert(target, div, anchor);
 
-				mounted = true;
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(div, null);
 			}
 		},
 		p(ctx, [dirty]) {
-			if (dirty & /*DIRECTIONS, currHiers, splitAndTrim, update, ARROW_DIRECTIONS, swapItems*/ 3) {
-				each_value = /*currHiers*/ ctx[0];
+			if (dirty & /*allRuns, settings, Math, children, openOrSwitch, app, hoverPreview, activeLeafView, range, wordCounts, linkClass, getAlt, plugin, dropDendron*/ 382) {
+				each_value = /*transposedTrails*/ ctx[7];
 				let i;
 
 				for (i = 0; i < each_value.length; i += 1) {
-					const child_ctx = get_each_context$7(ctx, each_value, i);
+					const child_ctx = get_each_context$9(ctx, each_value, i);
 
 					if (each_blocks[i]) {
 						each_blocks[i].p(child_ctx, dirty);
 					} else {
-						each_blocks[i] = create_each_block$7(child_ctx);
+						each_blocks[i] = create_each_block$9(child_ctx);
 						each_blocks[i].c();
-						each_blocks[i].m(div4, null);
+						each_blocks[i].m(div, null);
 					}
 				}
 
@@ -26941,306 +25624,439 @@ function create_fragment$b(ctx) {
 
 				each_blocks.length = each_value.length;
 			}
+
+			if (dirty & /*sortedTrails*/ 1) {
+				set_style(div, "grid-template-rows", ("1fr ").repeat(/*sortedTrails*/ ctx[0].length));
+			}
 		},
-		i(local) {
-			if (current) return;
-			transition_in(faplus.$$.fragment, local);
-			transition_in(faregtrashalt.$$.fragment, local);
-			transition_in(falistul.$$.fragment, local);
-			current = true;
-		},
-		o(local) {
-			transition_out(faplus.$$.fragment, local);
-			transition_out(faregtrashalt.$$.fragment, local);
-			transition_out(falistul.$$.fragment, local);
-			current = false;
-		},
+		i: noop,
+		o: noop,
 		d(detaching) {
-			if (detaching) detach(div4);
-			destroy_component(faplus);
-			destroy_component(faregtrashalt);
-			destroy_component(falistul);
+			if (detaching) detach(div);
 			destroy_each(each_blocks, detaching);
-			mounted = false;
-			run_all(dispose);
 		}
 	};
 }
 
-const func_1 = dirFields => `(${dirFields})`;
-
-function instance$b($$self, $$props, $$invalidate) {
-	var __awaiter = this && this.__awaiter || function (thisArg, _arguments, P, generator) {
-		function adopt(value) {
-			return value instanceof P
-			? value
-			: new P(function (resolve) {
-						resolve(value);
-					});
-		}
-
-		return new (P || (P = Promise))(function (resolve, reject) {
-				function fulfilled(value) {
-					try {
-						step(generator.next(value));
-					} catch(e) {
-						reject(e);
-					}
-				}
-
-				function rejected(value) {
-					try {
-						step(generator["throw"](value));
-					} catch(e) {
-						reject(e);
-					}
-				}
-
-				function step(result) {
-					result.done
-					? resolve(result.value)
-					: adopt(result.value).then(fulfilled, rejected);
-				}
-
-				step((generator = generator.apply(thisArg, _arguments || [])).next());
-			});
-	};
-
+function instance$h($$self, $$props, $$invalidate) {
 	
 	
+	let { sortedTrails } = $$props;
+	let { app } = $$props;
 	let { plugin } = $$props;
-	let currHiers = [...plugin.settings.userHiers];
-
-	function update(currHiers) {
-		return __awaiter(this, void 0, void 0, function* () {
-			$$invalidate(2, plugin.settings.userHiers = currHiers, plugin);
-			yield plugin.saveSettings();
-		});
-	}
+	const { settings } = plugin;
+	const { userHiers } = settings;
+	const currFile = app.workspace.getActiveFile();
+	const activeLeafView = app.workspace.activeLeaf.view;
+	const allCells = [...new Set(sortedTrails.reduce((a, b) => [...a, ...b]))];
+	const wordCounts = {};
 
-	const click_handler = async () => $$invalidate(0, currHiers = [...currHiers, blankUserHier()]);
+	allCells.forEach(cell => {
+		var _a;
 
-	const click_handler_1 = async () => {
-		if (window.confirm("Are you sure you want to reset all hierarchies?")) {
-			$$invalidate(0, currHiers = []);
-			await update(currHiers);
+		try {
+			$$invalidate(
+				3,
+				wordCounts[cell] = (_a = app.metadataCache.getFirstLinkpathDest(cell, "")) === null || _a === void 0
+				? void 0
+				: _a.stat.size,
+				wordCounts
+			);
+		} catch(error) {
+			console.log(error, { currFile });
+			$$invalidate(3, wordCounts[cell] = 0, wordCounts);
 		}
-	};
+	});
 
-	const click_handler_2 = () => new obsidian.Notice(currHiers.map(hierToStr).join("\n\n"));
-	const func = (hier, dir) => hier[dir]?.join(", ") ?? "";
+	// const data: {[cell: string]: number} = {}
+	// allCells.forEach(cell => data[cell] = app.metadataCache.getFileCache(app.metadataCache.getFirstLinkpathDest(cell, currFile.path))?.links.length ?? 0);
+	const { mainG } = plugin;
 
-	const click_handler_3 = async i => {
-		$$invalidate(0, currHiers = swapItems(i, i - 1, currHiers));
-		await update(currHiers);
-	};
+	// const [up, down] = [getSubInDirs(mainG, "up"), getSubInDirs(mainG, "down")];
+	// const closedParents = closeImpliedLinks(up, down);
+	const closedParents = getReflexiveClosure(getSubInDirs(mainG, "up", "down"), userHiers);
 
-	const click_handler_4 = async i => {
-		$$invalidate(0, currHiers = swapItems(i, i + 1, currHiers));
-		await update(currHiers);
-	};
+	const children = {};
+	allCells.forEach(cell => $$invalidate(4, children[cell] = getOutNeighbours(closedParents, cell).length, children));
+	const normalisedData = normalise(Object.values(children));
 
-	const click_handler_5 = async i => {
-		currHiers.splice(i, 1);
-		$$invalidate(0, currHiers);
-		await update(currHiers);
-	};
+	allCells.forEach((cell, i) => {
+		$$invalidate(4, children[cell] = normalisedData[i], children);
+	});
 
-	const change_handler = async (i, dir, e) => {
-		const { value } = e.target;
-		$$invalidate(0, currHiers[i][dir] = splitAndTrim(value), currHiers);
-		await update(currHiers);
-	};
+	// const normalisedData = allCells.forEach(cell => {
+	// })
+	// const links: {[cell: string]: number}[] = []
+	// data.forEach(cell => links[Object.keys(cell)[0]] = (Object.values(cell)[0]?.links.length ?? 0))
+	// console.log(data)
+	const maxLength = Math.max(...sortedTrails.map(trail => trail.length));
+
+	const paddedTrails = sortedTrails.map(trail => padArray(trail, maxLength));
+
+	// const permutations: string[][][] = permute(paddedTrails.map(trail => [trail[0]]))
+	// //  permutations.map(trails => sum(transpose(trails).map(runs).map(runs => runs.length)))
+	// const ALLRuns = permutations.map(permutation => transpose(permutation).map(runs))
+	// const runsPerRun = ALLRuns.map(runs => runs[0].length)
+	// const minRunLength = Math.min(...runsPerRun);
+	// const indexOfMinRun = runsPerRun.indexOf(minRunLength);
+	// const minRun = ALLRuns[indexOfMinRun]
+	const transposedTrails = transpose(paddedTrails);
+
+	const allRuns = transposedTrails.map(runs);
+	const click_handler = (step, e) => openOrSwitch(app, step.value, e);
+	const mouseover_handler = (step, e) => hoverPreview(e, activeLeafView, step.value);
 
 	$$self.$$set = $$props => {
+		if ("sortedTrails" in $$props) $$invalidate(0, sortedTrails = $$props.sortedTrails);
+		if ("app" in $$props) $$invalidate(1, app = $$props.app);
 		if ("plugin" in $$props) $$invalidate(2, plugin = $$props.plugin);
 	};
 
 	return [
-		currHiers,
-		update,
+		sortedTrails,
+		app,
 		plugin,
+		wordCounts,
+		children,
+		settings,
+		activeLeafView,
+		transposedTrails,
+		allRuns,
 		click_handler,
-		click_handler_1,
-		click_handler_2,
-		func,
-		click_handler_3,
-		click_handler_4,
-		click_handler_5,
-		change_handler
+		mouseover_handler
 	];
 }
 
-class UserHierarchies extends SvelteComponent {
+class TrailGrid extends SvelteComponent {
 	constructor(options) {
 		super();
-		if (!document.getElementById("svelte-5y4abu-style")) add_css$7();
-		init(this, options, instance$b, create_fragment$b, safe_not_equal, { plugin: 2 });
+		if (!document.getElementById("svelte-ybyqyo-style")) add_css$9();
+		init(this, options, instance$h, create_fragment$h, safe_not_equal, { sortedTrails: 0, app: 1, plugin: 2 });
 	}
 }
 
-function addHierarchySettings(plugin, containerEl) {
-    const fieldDetails = details("Hierarchies", containerEl);
-    fieldDetails.createEl("p", {
-        text: "Here you can set up different hierarchies you use in your vault. To add a new hierarchy, click the plus button. Then, fill in the field names of your hierachy into the 3 boxes that appear. The ↑ field is for parent relations, the → field is for siblings, and ↓ is for child relations.",
-    });
-    fieldDetails.createEl("p", {
-        text: "For each direction (up, same, down), you can enter multiple field names in a comma seperated list. For example: `parent, broader, upper`",
-    });
-    new UserHierarchies({
-        target: fieldDetails,
-        props: { plugin },
-    });
-}
+/* src\Components\TrailPath.svelte generated by Svelte v3.35.0 */
+
+function add_css$8() {
+	var style = element("style");
+	style.id = "svelte-3c1frp-style";
+	style.textContent = "span.BC-trail-path-container.svelte-3c1frp{display:flex;justify-content:space-between}";
+	append(document.head, style);
+}
+
+function get_each_context$8(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[10] = list[i];
+	return child_ctx;
+}
+
+function get_each_context_1$6(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[13] = list[i];
+	child_ctx[15] = i;
+	return child_ctx;
+}
+
+// (21:8) {:else}
+function create_else_block$1(ctx) {
+	let each_1_anchor;
+	let each_value_1 = /*trail*/ ctx[10];
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value_1.length; i += 1) {
+		each_blocks[i] = create_each_block_1$6(get_each_context_1$6(ctx, each_value_1, i));
+	}
+
+	return {
+		c() {
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			each_1_anchor = empty();
+		},
+		m(target, anchor) {
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(target, anchor);
+			}
+
+			insert(target, each_1_anchor, anchor);
+		},
+		p(ctx, dirty) {
+			if (dirty & /*settings, trailsToShow, openOrSwitch, app, hoverPreview, view, getAlt, plugin, dropDendron*/ 118) {
+				each_value_1 = /*trail*/ ctx[10];
+				let i;
+
+				for (i = 0; i < each_value_1.length; i += 1) {
+					const child_ctx = get_each_context_1$6(ctx, each_value_1, i);
 
-/* src\Components\Lists.svelte generated by Svelte v3.35.0 */
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block_1$6(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(each_1_anchor.parentNode, each_1_anchor);
+					}
+				}
 
-function add_css$6() {
-	var style = element("style");
-	style.id = "svelte-1dlhare-style";
-	style.textContent = "summary.hier-summary.svelte-1dlhare{color:var(--text-title-h2);font-size:larger}summary.svelte-1dlhare{color:var(--text-title-h3)}h5.BC-header.svelte-1dlhare{color:var(--text-title-h5)}.markdown-preview-view.svelte-1dlhare{padding-left:10px}.internal-link.is-unresolved.svelte-1dlhare{color:var(--text-muted)}";
-	append(document.head, style);
-}
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
 
-function get_each_context$6(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[13] = list[i];
-	return child_ctx;
+				each_blocks.length = each_value_1.length;
+			}
+		},
+		d(detaching) {
+			destroy_each(each_blocks, detaching);
+			if (detaching) detach(each_1_anchor);
+		}
+	};
 }
 
-function get_each_context_1$4(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[16] = list[i];
-	return child_ctx;
-}
+// (19:8) {#if trail.length === 0}
+function create_if_block_1$3(ctx) {
+	let span;
 
-function get_each_context_2$2(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[19] = list[i];
-	return child_ctx;
+	return {
+		c() {
+			span = element("span");
+			span.textContent = `${/*settings*/ ctx[5].noPathMessage}`;
+		},
+		m(target, anchor) {
+			insert(target, span, anchor);
+		},
+		p: noop,
+		d(detaching) {
+			if (detaching) detach(span);
+		}
+	};
 }
 
-function get_each_context_3$2(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[22] = list[i];
-	return child_ctx;
+// (30:12) {#if i < trail.length - 1}
+function create_if_block_2$2(ctx) {
+	let span;
+
+	return {
+		c() {
+			span = element("span");
+			span.textContent = `${" " + /*settings*/ ctx[5].trailSeperator + " "}`;
+		},
+		m(target, anchor) {
+			insert(target, span, anchor);
+		},
+		p: noop,
+		d(detaching) {
+			if (detaching) detach(span);
+		}
+	};
 }
 
-// (26:8) {#if square.realItems.length || (showImpliedRelations && square.impliedItems.length)}
-function create_if_block$3(ctx) {
-	let details;
-	let summary;
-	let t0_value = /*square*/ ctx[16].field + "";
+// (22:10) {#each trail as crumb, i}
+function create_each_block_1$6(ctx) {
+	let span;
+	let t0_value = (getAlt(/*crumb*/ ctx[13], /*plugin*/ ctx[2]) ?? dropDendron(/*crumb*/ ctx[13], /*settings*/ ctx[5])) + "";
 	let t0;
 	let t1;
-	let t2;
-	let if_block0 = /*square*/ ctx[16].realItems.length && create_if_block_3$1(ctx);
-	let if_block1 = /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length && create_if_block_1$3(ctx);
+	let if_block_anchor;
+	let mounted;
+	let dispose;
+
+	function click_handler(...args) {
+		return /*click_handler*/ ctx[7](/*crumb*/ ctx[13], ...args);
+	}
+
+	function mouseover_handler(...args) {
+		return /*mouseover_handler*/ ctx[8](/*crumb*/ ctx[13], ...args);
+	}
+
+	let if_block = /*i*/ ctx[15] < /*trail*/ ctx[10].length - 1 && create_if_block_2$2(ctx);
 
 	return {
 		c() {
-			details = element("details");
-			summary = element("summary");
+			span = element("span");
 			t0 = text(t0_value);
 			t1 = space();
-			if (if_block0) if_block0.c();
-			t2 = space();
-			if (if_block1) if_block1.c();
-			attr(summary, "class", "svelte-1dlhare");
-			details.open = true;
-			attr(details, "class", "BC-details");
+			if (if_block) if_block.c();
+			if_block_anchor = empty();
+			attr(span, "class", "internal-link BC-Link");
 		},
 		m(target, anchor) {
-			insert(target, details, anchor);
-			append(details, summary);
-			append(summary, t0);
-			append(details, t1);
-			if (if_block0) if_block0.m(details, null);
-			append(details, t2);
-			if (if_block1) if_block1.m(details, null);
+			insert(target, span, anchor);
+			append(span, t0);
+			insert(target, t1, anchor);
+			if (if_block) if_block.m(target, anchor);
+			insert(target, if_block_anchor, anchor);
+
+			if (!mounted) {
+				dispose = [
+					listen(span, "click", click_handler),
+					listen(span, "mouseover", mouseover_handler)
+				];
+
+				mounted = true;
+			}
 		},
-		p(ctx, dirty) {
-			if (dirty & /*filteredSquaresArr*/ 1 && t0_value !== (t0_value = /*square*/ ctx[16].field + "")) set_data(t0, t0_value);
+		p(new_ctx, dirty) {
+			ctx = new_ctx;
+			if (dirty & /*trailsToShow, plugin*/ 20 && t0_value !== (t0_value = (getAlt(/*crumb*/ ctx[13], /*plugin*/ ctx[2]) ?? dropDendron(/*crumb*/ ctx[13], /*settings*/ ctx[5])) + "")) set_data(t0, t0_value);
 
-			if (/*square*/ ctx[16].realItems.length) {
-				if (if_block0) {
-					if_block0.p(ctx, dirty);
+			if (/*i*/ ctx[15] < /*trail*/ ctx[10].length - 1) {
+				if (if_block) {
+					if_block.p(ctx, dirty);
 				} else {
-					if_block0 = create_if_block_3$1(ctx);
-					if_block0.c();
-					if_block0.m(details, t2);
+					if_block = create_if_block_2$2(ctx);
+					if_block.c();
+					if_block.m(if_block_anchor.parentNode, if_block_anchor);
 				}
-			} else if (if_block0) {
-				if_block0.d(1);
-				if_block0 = null;
+			} else if (if_block) {
+				if_block.d(1);
+				if_block = null;
 			}
+		},
+		d(detaching) {
+			if (detaching) detach(span);
+			if (detaching) detach(t1);
+			if (if_block) if_block.d(detaching);
+			if (detaching) detach(if_block_anchor);
+			mounted = false;
+			run_all(dispose);
+		}
+	};
+}
 
-			if (/*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) {
-				if (if_block1) {
-					if_block1.p(ctx, dirty);
-				} else {
-					if_block1 = create_if_block_1$3(ctx);
-					if_block1.c();
-					if_block1.m(details, null);
+// (17:4) {#each trailsToShow as trail}
+function create_each_block$8(ctx) {
+	let div;
+	let t;
+
+	function select_block_type(ctx, dirty) {
+		if (/*trail*/ ctx[10].length === 0) return create_if_block_1$3;
+		return create_else_block$1;
+	}
+
+	let current_block_type = select_block_type(ctx);
+	let if_block = current_block_type(ctx);
+
+	return {
+		c() {
+			div = element("div");
+			if_block.c();
+			t = space();
+		},
+		m(target, anchor) {
+			insert(target, div, anchor);
+			if_block.m(div, null);
+			append(div, t);
+		},
+		p(ctx, dirty) {
+			if (current_block_type === (current_block_type = select_block_type(ctx)) && if_block) {
+				if_block.p(ctx, dirty);
+			} else {
+				if_block.d(1);
+				if_block = current_block_type(ctx);
+
+				if (if_block) {
+					if_block.c();
+					if_block.m(div, t);
 				}
-			} else if (if_block1) {
-				if_block1.d(1);
-				if_block1 = null;
 			}
 		},
 		d(detaching) {
-			if (detaching) detach(details);
-			if (if_block0) if_block0.d();
-			if (if_block1) if_block1.d();
+			if (detaching) detach(div);
+			if_block.d();
+		}
+	};
+}
+
+// (39:2) {#if sortedTrails.length > 1}
+function create_if_block$4(ctx) {
+	let div;
+	let button;
+	let t_value = (/*showAll*/ ctx[3] ? "Shortest" : "All") + "";
+	let t;
+	let mounted;
+	let dispose;
+
+	return {
+		c() {
+			div = element("div");
+			button = element("button");
+			t = text(t_value);
+			attr(button, "class", "button-div");
+		},
+		m(target, anchor) {
+			insert(target, div, anchor);
+			append(div, button);
+			append(button, t);
+
+			if (!mounted) {
+				dispose = listen(button, "click", /*click_handler_1*/ ctx[9]);
+				mounted = true;
+			}
+		},
+		p(ctx, dirty) {
+			if (dirty & /*showAll*/ 8 && t_value !== (t_value = (/*showAll*/ ctx[3] ? "Shortest" : "All") + "")) set_data(t, t_value);
+		},
+		d(detaching) {
+			if (detaching) detach(div);
+			mounted = false;
+			dispose();
 		}
 	};
 }
 
-// (29:12) {#if square.realItems.length}
-function create_if_block_3$1(ctx) {
+function create_fragment$g(ctx) {
+	let span;
+	let div;
 	let t;
-	let ol;
-	let if_block = /*showRelationType*/ ctx[8] && create_if_block_4$1();
-	let each_value_3 = /*square*/ ctx[16].realItems;
+	let each_value = /*trailsToShow*/ ctx[4];
 	let each_blocks = [];
 
-	for (let i = 0; i < each_value_3.length; i += 1) {
-		each_blocks[i] = create_each_block_3$2(get_each_context_3$2(ctx, each_value_3, i));
+	for (let i = 0; i < each_value.length; i += 1) {
+		each_blocks[i] = create_each_block$8(get_each_context$8(ctx, each_value, i));
 	}
 
+	let if_block = /*sortedTrails*/ ctx[0].length > 1 && create_if_block$4(ctx);
+
 	return {
 		c() {
-			if (if_block) if_block.c();
-			t = space();
-			ol = element("ol");
+			span = element("span");
+			div = element("div");
 
 			for (let i = 0; i < each_blocks.length; i += 1) {
 				each_blocks[i].c();
 			}
+
+			t = space();
+			if (if_block) if_block.c();
+			attr(div, "class", "trails-div");
+			attr(span, "class", "BC-trail-path-container svelte-3c1frp");
 		},
 		m(target, anchor) {
-			if (if_block) if_block.m(target, anchor);
-			insert(target, t, anchor);
-			insert(target, ol, anchor);
+			insert(target, span, anchor);
+			append(span, div);
 
 			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(ol, null);
+				each_blocks[i].m(div, null);
 			}
+
+			append(span, t);
+			if (if_block) if_block.m(span, null);
 		},
-		p(ctx, dirty) {
-			if (dirty & /*filteredSquaresArr, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings*/ 29) {
-				each_value_3 = /*square*/ ctx[16].realItems;
+		p(ctx, [dirty]) {
+			if (dirty & /*settings, trailsToShow, openOrSwitch, app, hoverPreview, view, getAlt, plugin, dropDendron*/ 118) {
+				each_value = /*trailsToShow*/ ctx[4];
 				let i;
 
-				for (i = 0; i < each_value_3.length; i += 1) {
-					const child_ctx = get_each_context_3$2(ctx, each_value_3, i);
+				for (i = 0; i < each_value.length; i += 1) {
+					const child_ctx = get_each_context$8(ctx, each_value, i);
 
 					if (each_blocks[i]) {
 						each_blocks[i].p(child_ctx, dirty);
 					} else {
-						each_blocks[i] = create_each_block_3$2(child_ctx);
+						each_blocks[i] = create_each_block$8(child_ctx);
 						each_blocks[i].c();
-						each_blocks[i].m(ol, null);
+						each_blocks[i].m(div, null);
 					}
 				}
 
@@ -27248,674 +26064,925 @@ function create_if_block_3$1(ctx) {
 					each_blocks[i].d(1);
 				}
 
-				each_blocks.length = each_value_3.length;
+				each_blocks.length = each_value.length;
+			}
+
+			if (/*sortedTrails*/ ctx[0].length > 1) {
+				if (if_block) {
+					if_block.p(ctx, dirty);
+				} else {
+					if_block = create_if_block$4(ctx);
+					if_block.c();
+					if_block.m(span, null);
+				}
+			} else if (if_block) {
+				if_block.d(1);
+				if_block = null;
 			}
 		},
+		i: noop,
+		o: noop,
 		d(detaching) {
-			if (if_block) if_block.d(detaching);
-			if (detaching) detach(t);
-			if (detaching) detach(ol);
+			if (detaching) detach(span);
 			destroy_each(each_blocks, detaching);
+			if (if_block) if_block.d();
 		}
 	};
 }
 
-// (30:14) {#if showRelationType}
-function create_if_block_4$1(ctx) {
-	let h5;
+function instance$g($$self, $$props, $$invalidate) {
+	let trailsToShow;
+	
+	
+	let { sortedTrails } = $$props;
+	let { app } = $$props;
+	let { plugin } = $$props;
+	const { settings } = plugin;
+	const { view } = app.workspace.activeLeaf;
+	let showAll = settings.showAll;
+	const click_handler = async (crumb, e) => await openOrSwitch(app, crumb, e);
+	const mouseover_handler = (crumb, e) => hoverPreview(e, view, crumb);
+	const click_handler_1 = () => $$invalidate(3, showAll = !showAll);
 
-	return {
-		c() {
-			h5 = element("h5");
-			h5.textContent = "Real";
-			attr(h5, "class", "BC-header svelte-1dlhare");
-		},
-		m(target, anchor) {
-			insert(target, h5, anchor);
-		},
-		d(detaching) {
-			if (detaching) detach(h5);
-		}
+	$$self.$$set = $$props => {
+		if ("sortedTrails" in $$props) $$invalidate(0, sortedTrails = $$props.sortedTrails);
+		if ("app" in $$props) $$invalidate(1, app = $$props.app);
+		if ("plugin" in $$props) $$invalidate(2, plugin = $$props.plugin);
 	};
-}
 
-// (35:16) {#each square.realItems as realItem}
-function create_each_block_3$2(ctx) {
-	let li;
-	let div;
-	let t0_value = (/*realItem*/ ctx[22].alt ?? dropPathNDendron(/*realItem*/ ctx[22].to, /*settings*/ ctx[2])) + "";
-	let t0;
-	let div_class_value;
-	let t1;
-	let mounted;
-	let dispose;
+	$$self.$$.update = () => {
+		if ($$self.$$.dirty & /*showAll, sortedTrails*/ 9) {
+			$$invalidate(4, trailsToShow = showAll ? sortedTrails : [sortedTrails[0]]);
+		}
+	};
 
-	function click_handler(...args) {
-		return /*click_handler*/ ctx[9](/*realItem*/ ctx[22], ...args);
-	}
+	return [
+		sortedTrails,
+		app,
+		plugin,
+		showAll,
+		trailsToShow,
+		settings,
+		view,
+		click_handler,
+		mouseover_handler,
+		click_handler_1
+	];
+}
 
-	function mouseover_handler(...args) {
-		return /*mouseover_handler*/ ctx[10](/*realItem*/ ctx[22], ...args);
+class TrailPath extends SvelteComponent {
+	constructor(options) {
+		super();
+		if (!document.getElementById("svelte-3c1frp-style")) add_css$8();
+		init(this, options, instance$g, create_fragment$g, safe_not_equal, { sortedTrails: 0, app: 1, plugin: 2 });
 	}
+}
 
-	return {
-		c() {
-			li = element("li");
-			div = element("div");
-			t0 = text(t0_value);
-			t1 = space();
-			attr(div, "class", div_class_value = "" + (/*realItem*/ ctx[22].cls + " " + (/*realItem*/ ctx[22].implied ?? "") + " svelte-1dlhare"));
-		},
-		m(target, anchor) {
-			insert(target, li, anchor);
-			append(li, div);
-			append(div, t0);
-			append(li, t1);
-
-			if (!mounted) {
-				dispose = [
-					listen(div, "click", click_handler),
-					listen(div, "mouseover", mouseover_handler)
-				];
-
-				mounted = true;
-			}
-		},
-		p(new_ctx, dirty) {
-			ctx = new_ctx;
-			if (dirty & /*filteredSquaresArr, settings*/ 5 && t0_value !== (t0_value = (/*realItem*/ ctx[22].alt ?? dropPathNDendron(/*realItem*/ ctx[22].to, /*settings*/ ctx[2])) + "")) set_data(t0, t0_value);
-
-			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "" + (/*realItem*/ ctx[22].cls + " " + (/*realItem*/ ctx[22].implied ?? "") + " svelte-1dlhare"))) {
-				attr(div, "class", div_class_value);
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(li);
-			mounted = false;
-			run_all(dispose);
-		}
-	};
+function getLimitedTrailSub(plugin) {
+    const { settings, mainG } = plugin;
+    const { limitTrailCheckboxes, userHiers } = settings;
+    let subGraph;
+    if (getFields(userHiers).every((field) => limitTrailCheckboxes.includes(field))) {
+        subGraph = getSubInDirs(mainG, "up", "down");
+    }
+    else {
+        const oppFields = limitTrailCheckboxes
+            .map((field) => { var _a, _b; return (_b = (_a = getOppFields(userHiers, field)) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : fallbackOppField(field, "up"); })
+            .filter((field) => field !== undefined);
+        subGraph = getSubForFields(mainG, [...limitTrailCheckboxes, ...oppFields]);
+    }
+    const closed = getReflexiveClosure(subGraph, userHiers);
+    return getSubInDirs(closed, "up");
+}
+function getBreadcrumbs(settings, g, currFile) {
+    const { basename, extension } = currFile;
+    if (extension !== "md")
+        return null;
+    const allTrails = bfsAllPaths(g, basename);
+    let filteredTrails = [...allTrails];
+    const { indexNotes, showAllPathsIfNoneToIndexNote } = settings;
+    // Filter for index notes
+    if (
+    // Works for `undefined` and `""`
+    indexNotes[0] &&
+        filteredTrails.length) {
+        filteredTrails = filteredTrails.filter((trail) => indexNotes.includes(trail[0]));
+        if (filteredTrails.length === 0 && showAllPathsIfNoneToIndexNote)
+            filteredTrails = [...allTrails];
+    }
+    const sortedTrails = filteredTrails
+        .filter((trail) => trail.length > 0)
+        .sort((a, b) => a.length - b.length);
+    return sortedTrails;
+}
+function getNextNPrev(plugin, currNode) {
+    const { mainG } = plugin;
+    const { userHiers } = plugin.settings;
+    if (!mainG)
+        return null;
+    const nextNPrev = blankRealNImplied();
+    mainG.forEachEdge(currNode, (k, a, s, t) => {
+        var _a;
+        const { dir, field, implied } = a;
+        if (dir !== "next" && dir !== "prev")
+            return;
+        if (s === currNode) {
+            nextNPrev[dir].reals.push({ field, to: t, real: true, implied });
+        }
+        else {
+            const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, dir);
+            nextNPrev[getOppDir(dir)].implieds.push({
+                field: oppField,
+                to: s,
+                real: false,
+                implied,
+            });
+        }
+    });
+    return nextNPrev;
+}
+async function drawTrail(plugin) {
+    var _a, _b, _c, _d;
+    try {
+        const { settings, db, app } = plugin;
+        const { showBCs, noPathMessage, respectReadableLineLength, showTrail, showGrid, showJuggl, showPrevNext, showBCsInEditLPMode, } = settings;
+        db.start2G("drawTrail");
+        const activeMDView = app.workspace.getActiveViewOfType(obsidian.MarkdownView);
+        const mode = activeMDView === null || activeMDView === void 0 ? void 0 : activeMDView.getMode();
+        if (!showBCs ||
+            !activeMDView ||
+            (mode !== "preview" && !showBCsInEditLPMode)) {
+            (_a = activeMDView === null || activeMDView === void 0 ? void 0 : activeMDView.containerEl.querySelector(".BC-trail")) === null || _a === void 0 ? void 0 : _a.remove();
+            db.end2G();
+            return;
+        }
+        const { file } = activeMDView;
+        const { frontmatter } = (_b = app.metadataCache.getFileCache(file)) !== null && _b !== void 0 ? _b : {};
+        // @ts-ignore
+        const { hideTrailField } = settings;
+        if (hideTrailField && (frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter[hideTrailField])) {
+            new obsidian.Notice(`${file.basename} still uses an old frontmatter field to hide it's trail. This settings has been deprecated in favour of a standardised field: 'BC-hide-trail'. Please change it so that this note's trail is hidden again.`);
+        }
+        if ((frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter[BC_HIDE_TRAIL]) || (frontmatter === null || frontmatter === void 0 ? void 0 : frontmatter["kanban-plugin"])) {
+            db.end2G();
+            return;
+        }
+        const view = mode === "preview"
+            ? activeMDView.previewMode.containerEl.querySelector("div.markdown-preview-view")
+            : activeMDView.contentEl.querySelector("div.markdown-source-view");
+        (_c = activeMDView.containerEl
+            .querySelectorAll(".BC-trail")) === null || _c === void 0 ? void 0 : _c.forEach((trail) => trail.remove());
+        const closedUp = getLimitedTrailSub(plugin);
+        const sortedTrails = getBreadcrumbs(settings, closedUp, file);
+        loglevel.info({ sortedTrails });
+        const { basename } = file;
+        const { next: { reals: rNext, implieds: iNext }, prev: { reals: rPrev, implieds: iPrev }, } = getNextNPrev(plugin, basename);
+        // Remove duplicate implied
+        const next = [...rNext];
+        iNext.forEach((i) => {
+            if (next.findIndex((n) => n.to === i.to) === -1) {
+                next.push(i);
+            }
+        });
+        const prev = [...rPrev];
+        iPrev.forEach((i) => {
+            if (prev.findIndex((n) => n.to === i.to) === -1) {
+                prev.push(i);
+            }
+        });
+        const noItems = !sortedTrails.length && !next.length && !prev.length;
+        if (noItems && noPathMessage === "") {
+            db.end2G();
+            return;
+        }
+        const selectorForMaxWidth = mode === "preview"
+            ? ".markdown-preview-view.is-readable-line-width .markdown-preview-sizer"
+            : "";
+        const elForMaxWidth = selectorForMaxWidth !== ""
+            ? document.querySelector(selectorForMaxWidth)
+            : null;
+        const max_width = elForMaxWidth
+            ? getComputedStyle(elForMaxWidth).getPropertyValue("max-width")
+            : "100%";
+        const trailDiv = createDiv({
+            cls: `BC-trail ${respectReadableLineLength
+                ? "is-readable-line-width markdown-preview-sizer markdown-preview-section"
+                : ""}`,
+            attr: {
+                style: (mode !== "preview" ? `max-width: ${max_width};` : "") +
+                    "margin: 0 auto;",
+            },
+        });
+        plugin.visited.push([file.path, trailDiv]);
+        if (mode === "preview") {
+            view.querySelector("div.markdown-preview-sizer").before(trailDiv);
+        }
+        else {
+            const cmEditor = view.querySelector("div.cm-contentContainer");
+            // const cmSizer = view.querySelector("div.CodeMirror-sizer");
+            if (cmEditor) {
+                (_d = cmEditor.firstChild) === null || _d === void 0 ? void 0 : _d.before(trailDiv);
+            }
+            // if (cmSizer) cmSizer.before(trailDiv);
+        }
+        trailDiv.empty();
+        if (settings.indexNotes.includes(basename)) {
+            trailDiv.innerText = "Index Note";
+            db.end2G();
+            return;
+        }
+        if (noItems) {
+            trailDiv.innerText = noPathMessage;
+            db.end2G();
+            return;
+        }
+        const props = { sortedTrails, app, plugin };
+        if (showTrail && sortedTrails.length) {
+            new TrailPath({
+                target: trailDiv,
+                props,
+            });
+        }
+        if (showGrid && sortedTrails.length) {
+            new TrailGrid({
+                target: trailDiv,
+                props,
+            });
+        }
+        if (showPrevNext && (next.length || prev.length)) {
+            new NextPrev({
+                target: trailDiv,
+                props: { app, plugin, next, prev },
+            });
+        }
+        if (showJuggl && sortedTrails.length) {
+            createJugglTrail(plugin, trailDiv, props.sortedTrails, basename, JUGGL_TRAIL_DEFAULTS);
+        }
+        db.end2G();
+    }
+    catch (err) {
+        loglevel.error(err);
+        plugin.db.end2G();
+    }
 }
 
-// (50:12) {#if showImpliedRelations && square.impliedItems.length}
-function create_if_block_1$3(ctx) {
-	let t;
-	let ol;
-	let ol_start_value;
-	let if_block = /*showRelationType*/ ctx[8] && create_if_block_2$2();
-	let each_value_2 = /*square*/ ctx[16].impliedItems;
-	let each_blocks = [];
-
-	for (let i = 0; i < each_value_2.length; i += 1) {
-		each_blocks[i] = create_each_block_2$2(get_each_context_2$2(ctx, each_value_2, i));
-	}
-
-	return {
-		c() {
-			if (if_block) if_block.c();
-			t = space();
-			ol = element("ol");
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			attr(ol, "start", ol_start_value = /*square*/ ctx[16].realItems.length + 1);
-		},
-		m(target, anchor) {
-			if (if_block) if_block.m(target, anchor);
-			insert(target, t, anchor);
-			insert(target, ol, anchor);
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(ol, null);
-			}
-		},
-		p(ctx, dirty) {
-			if (dirty & /*treatCurrNodeAsImpliedSibling, filteredSquaresArr, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings*/ 223) {
-				each_value_2 = /*square*/ ctx[16].impliedItems;
-				let i;
-
-				for (i = 0; i < each_value_2.length; i += 1) {
-					const child_ctx = get_each_context_2$2(ctx, each_value_2, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block_2$2(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(ol, null);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value_2.length;
-			}
-
-			if (dirty & /*filteredSquaresArr*/ 1 && ol_start_value !== (ol_start_value = /*square*/ ctx[16].realItems.length + 1)) {
-				attr(ol, "start", ol_start_value);
-			}
-		},
-		d(detaching) {
-			if (if_block) if_block.d(detaching);
-			if (detaching) detach(t);
-			if (detaching) detach(ol);
-			destroy_each(each_blocks, detaching);
-		}
-	};
+function getDVMetadataCache(plugin, files) {
+    const { app, db } = plugin;
+    db.startGs("getDVMetadataCache", "dvCaches");
+    const frontms = files.map((file) => {
+        const dvCache = app.plugins.plugins.dataview.api.page(file.path);
+        loglevel.debug(`${file.basename}:`, { dvCache });
+        return dvCache;
+    });
+    db.endGs(2, { frontms });
+    return frontms;
+}
+function getObsMetadataCache(plugin, files) {
+    const { app, db } = plugin;
+    db.startGs("getObsMetadataCache", "obsCaches");
+    const frontms = files.map((file) => {
+        loglevel.debug(`GetObsMetadataCache: ${file.basename}`);
+        const { frontmatter } = app.metadataCache.getFileCache(file);
+        loglevel.debug({ frontmatter });
+        if (frontmatter)
+            return Object.assign({ file }, frontmatter);
+        else
+            return { file };
+    });
+    db.endGs(2, { frontms });
+    return frontms;
+}
+/**
+ * Keep unwrapping a proxied item until it isn't one anymore
+ * @param  {RawValue} item
+ */
+function unproxy(item) {
+    const unproxied = [];
+    const queue = [item];
+    while (queue.length) {
+        const currItem = queue.shift();
+        // @ts-ignore
+        if (typeof currItem.defaultComparator === "function") {
+            const possibleUnproxied = Object.assign({}, currItem);
+            const { values } = possibleUnproxied;
+            if (values)
+                queue.push(...values);
+            else
+                unproxied.push(possibleUnproxied);
+        }
+        else {
+            unproxied.push(currItem);
+        }
+    }
+    return unproxied;
+}
+/**
+ * Given a `dvCache[field]` value, parse the link(s) out of it
+ * @param  {string|string[]|string[][]|dvLink|dvLink[]|Pos|TFile} value
+ * @param  {BCSettings} settings
+ */
+function parseFieldValue(value) {
+    if (value === undefined)
+        return [];
+    const parsed = [];
+    try {
+        const rawValuesPreFlat = value;
+        if (!rawValuesPreFlat)
+            return [];
+        if (typeof rawValuesPreFlat === "string") {
+            const splits = rawValuesPreFlat.match(splitLinksRegex);
+            if (splits !== null) {
+                const linkNames = splits.map((link) => getBaseFromMDPath(link.match(dropHeaderOrAlias)[1]));
+                parsed.push(...linkNames);
+            }
+        }
+        else {
+            const rawValues = [value].flat(4);
+            loglevel.debug(...rawValues);
+            rawValues.forEach((rawItem) => {
+                if (!rawItem)
+                    return;
+                const unProxied = unproxy(rawItem);
+                unProxied.forEach((value) => {
+                    if (typeof value === "string" || typeof value === "number") {
+                        const rawAsString = value.toString();
+                        const splits = rawAsString.match(splitLinksRegex);
+                        if (splits !== null) {
+                            const strs = splits.map((link) => getBaseFromMDPath(link.match(dropHeaderOrAlias)[1]));
+                            parsed.push(...strs);
+                        }
+                        else {
+                            const basename = getBaseFromMDPath(rawAsString);
+                            parsed.push(basename.split("#")[0].split("|")[0]);
+                        }
+                    }
+                    else if (value.path !== undefined) {
+                        const basename = getBaseFromMDPath(value.path);
+                        if (basename !== undefined)
+                            parsed.push(basename);
+                    }
+                });
+            });
+        }
+        return parsed;
+    }
+    catch (err) {
+        loglevel.error(err);
+        return parsed;
+    }
+}
+async function buildMainG(plugin) {
+    const mainG = new graphology_umd_min.MultiGraph();
+    try {
+        const { settings, app, db } = plugin;
+        db.start2G("initGraphs");
+        const files = app.vault.getMarkdownFiles();
+        const dvQ = !!app.plugins.enabledPlugins.has("dataview");
+        let frontms = dvQ
+            ? getDVMetadataCache(plugin, files)
+            : getObsMetadataCache(plugin, files);
+        if (frontms.some((frontm) => frontm === undefined)) {
+            await wait(2000);
+            frontms = dvQ
+                ? getDVMetadataCache(plugin, files)
+                : getObsMetadataCache(plugin, files);
+        }
+        const { userHiers } = settings;
+        if (userHiers.length === 0) {
+            db.end2G();
+            new obsidian.Notice("You do not have any Breadcrumbs hierarchies set up.");
+            return mainG;
+        }
+        const useCSV = settings.CSVPaths !== "";
+        const CSVRows = useCSV ? await getCSVRows(plugin) : [];
+        const eligableAlts = {};
+        BC_ALTS.forEach((alt) => (eligableAlts[alt] = []));
+        function noticeIfBroken(frontm) {
+            const basename = getDVBasename(frontm.file);
+            // @ts-ignore
+            if (frontm[BC_FOLDER_NOTE] === true) {
+                const msg = `CONSOLE LOGGED: ${basename} is using a deprecated folder-note value. Instead of 'true', it now takes in the fieldName you want to use.`;
+                new obsidian.Notice(msg);
+                loglevel.warn(msg);
+            }
+            // @ts-ignore
+            if (frontm[BC_LINK_NOTE] === true) {
+                const msg = `CONSOLE LOGGED: ${basename} is using a deprecated link-note value. Instead of 'true', it now takes in the fieldName you want to use.`;
+                new obsidian.Notice(msg);
+                loglevel.warn(msg);
+            }
+            if (frontm["BC-folder-note-up"]) {
+                const msg = `CONSOLE LOGGED: ${basename} is using a deprecated folder-note-up value. Instead of setting the fieldName here, it goes directly into 'BC-folder-note: fieldName'.`;
+                new obsidian.Notice(msg);
+                loglevel.warn(msg);
+            }
+        }
+        db.start2G("addFrontmatterToGraph");
+        frontms.forEach((frontm) => {
+            BC_ALTS.forEach((alt) => {
+                if (frontm[alt]) {
+                    eligableAlts[alt].push(frontm);
+                }
+            });
+            noticeIfBroken(frontm);
+            const basename = getDVBasename(frontm.file);
+            const sourceOrder = getSourceOrder(frontm);
+            iterateHiers(userHiers, (hier, dir, field) => {
+                const values = parseFieldValue(frontm[field]);
+                values.forEach((target) => {
+                    if ((target.startsWith("<%") && target.endsWith("%>")) ||
+                        (target.startsWith("{{") && target.endsWith("}}")))
+                        return;
+                    const targetOrder = getTargetOrder(frontms, target);
+                    populateMain(settings, mainG, basename, field, target, sourceOrder, targetOrder);
+                });
+                if (useCSV)
+                    addCSVCrumbs(mainG, CSVRows, dir, field);
+            });
+        });
+        db.end2G();
+        // SECTION  Juggl Links
+        const jugglLinks = app.plugins.plugins.juggl || settings.parseJugglLinksWithoutJuggl
+            ? await getJugglLinks(plugin, files)
+            : [];
+        if (jugglLinks.length)
+            addJugglLinksToGraph(settings, jugglLinks, frontms, mainG);
+        // !SECTION  Juggl Links
+        // SECTION  Hierarchy Notes
+        db.start2G("Hierarchy Notes");
+        if (settings.hierarchyNotes[0] !== "") {
+            for (const note of settings.hierarchyNotes) {
+                const file = app.metadataCache.getFirstLinkpathDest(note, "");
+                if (file) {
+                    addHNsToGraph(settings, await getHierarchyNoteItems(plugin, file), mainG);
+                }
+                else {
+                    new obsidian.Notice(`${note} is no longer in your vault. It is best to remove it in Breadcrumbs settings.`);
+                }
+            }
+        }
+        db.end2G();
+        // !SECTION  Hierarchy Notes
+        db.start1G("Alternative Hierarchies");
+        addFolderNotesToGraph(plugin, eligableAlts[BC_FOLDER_NOTE], frontms, mainG);
+        addTagNotesToGraph(plugin, eligableAlts[BC_TAG_NOTE], frontms, mainG);
+        addLinkNotesToGraph(plugin, eligableAlts[BC_LINK_NOTE], frontms, mainG);
+        addRegexNotesToGraph(plugin, eligableAlts[BC_REGEX_NOTE], frontms, mainG);
+        // plugin.addNamingSystemNotesToGraph(frontms, mainG);
+        addTraverseNotesToGraph(plugin, eligableAlts[BC_TRAVERSE_NOTE], mainG, buildObsGraph(app));
+        addDendronNotesToGraph(plugin, frontms, mainG);
+        db.end1G();
+        files.forEach((file) => {
+            const { basename } = file;
+            addNodesIfNot(mainG, [basename]);
+        });
+        db.end2G("graphs inited", { mainG });
+        return mainG;
+    }
+    catch (err) {
+        loglevel.error(err);
+        plugin.db.end2G();
+        return mainG;
+    }
+}
+function addSiblingsFromSameParent(g, settings) {
+    const { userHiers, treatCurrNodeAsImpliedSibling } = settings;
+    g.forEachNode((currN, a) => {
+        // Find parents of current node
+        g.forEachOutEdge(currN, (k, currNAttr, s, parentNode) => {
+            var _a;
+            if (currNAttr.dir !== "up")
+                return;
+            const { fieldDir, fieldHier } = getFieldInfo(userHiers, currNAttr.field);
+            const field = (_a = fieldHier.same[0]) !== null && _a !== void 0 ? _a : fallbackField(currNAttr.field, fieldDir);
+            // Find the children of those parents
+            g.forEachOutEdge(parentNode, (k, a, s, impliedSibling) => {
+                // Skip the current node if the settings say to
+                if (a.dir !== "down" ||
+                    (!treatCurrNodeAsImpliedSibling && impliedSibling === currN))
+                    return;
+                addEdgeIfNot(g, currN, impliedSibling, {
+                    dir: "same",
+                    field,
+                    implied: BC_I_SIBLING_1,
+                });
+            });
+        });
+    });
+}
+function addAuntsUncles(g) {
+    g.forEachNode((currN, a) => {
+        // Find parents of current node
+        g.forEachOutEdge(currN, (k, currEAttr, s, parentNode) => {
+            if (currEAttr.dir !== "up")
+                return;
+            // Find the siblings of those parents
+            g.forEachOutEdge(parentNode, (k, a, s, uncle) => {
+                if (a.dir !== "same")
+                    return;
+                addEdgeIfNot(g, currN, uncle, {
+                    dir: "up",
+                    // Use the starting node's parent field
+                    field: currEAttr.field,
+                    implied: BC_I_AUNT,
+                });
+            });
+        });
+    });
+}
+function addCousins(g) {
+    g.forEachNode((currN, a) => {
+        // Find parents of current node
+        g.forEachOutEdge(currN, (k, currEAttr, s, parentNode) => {
+            if (currEAttr.dir !== "up")
+                return;
+            // Find the siblings of those parents
+            g.forEachOutEdge(parentNode, (k, parentSiblingAttr, s, uncle) => {
+                if (parentSiblingAttr.dir !== "same")
+                    return;
+                g.forEachOutEdge(uncle, (k, a, s, cousin) => {
+                    if (a.dir !== "down" || currN === cousin)
+                        return;
+                    addEdgeIfNot(g, currN, cousin, {
+                        dir: "same",
+                        field: parentSiblingAttr.field,
+                        implied: BC_I_COUSIN,
+                    });
+                });
+            });
+        });
+    });
+}
+// Sis --> Me <-- Bro
+// Implies: Sis <--> Bro
+function addStructuralEquivalenceSiblings(g) {
+    g.forEachNode((currN, a) => {
+        g.forEachInEdge(currN, (k, aSis, sis, _) => {
+            if (aSis.dir !== "same")
+                return;
+            g.forEachInEdge(currN, (k, aBro, bro, _) => {
+                if (aBro.dir !== "same" || sis === bro)
+                    return;
+                if (aBro.field === aSis.field) {
+                    addEdgeIfNot(g, sis, bro, {
+                        dir: "same",
+                        field: aBro.field,
+                        implied: BC_I_SIBLING_2,
+                    });
+                }
+            });
+        });
+    });
+}
+function buildClosedG(plugin) {
+    const { mainG, settings } = plugin;
+    const { userHiers, impliedRelations: { sameParentIsSibling, parentsSiblingsIsParents, cousinsIsSibling, siblingsSiblingIsSibling, }, } = settings;
+    let closedG = getReflexiveClosure(mainG, userHiers);
+    if (sameParentIsSibling)
+        addSiblingsFromSameParent(closedG, settings);
+    if (parentsSiblingsIsParents)
+        addAuntsUncles(closedG);
+    if (cousinsIsSibling)
+        addCousins(closedG);
+    if (siblingsSiblingIsSibling)
+        addStructuralEquivalenceSiblings(closedG);
+    return closedG;
+}
+async function refreshIndex(plugin) {
+    var _a;
+    if (!plugin.activeLeafChange)
+        plugin.registerActiveLeafChangeEvent();
+    if (!plugin.layoutChange)
+        plugin.registerLayoutChangeEvent();
+    plugin.mainG = await buildMainG(plugin);
+    plugin.closedG = buildClosedG(plugin);
+    for (const { type } of plugin.VIEWS)
+        await ((_a = plugin.getActiveTYPEView(type)) === null || _a === void 0 ? void 0 : _a.draw());
+    if (plugin.settings.showBCs)
+        await drawTrail(plugin);
+    if (plugin.settings.showRefreshNotice)
+        new obsidian.Notice("Index refreshed");
 }
 
-// (51:14) {#if showRelationType}
-function create_if_block_2$2(ctx) {
-	let h5;
-
-	return {
-		c() {
-			h5 = element("h5");
-			h5.textContent = "Implied";
-			attr(h5, "class", "BC-header svelte-1dlhare");
-		},
-		m(target, anchor) {
-			insert(target, h5, anchor);
-		},
-		d(detaching) {
-			if (detaching) detach(h5);
-		}
-	};
-}
+/* src\Components\KoFi.svelte generated by Svelte v3.35.0 */
 
-// (56:16) {#each square.impliedItems as impliedItem}
-function create_each_block_2$2(ctx) {
-	let li;
-	let div;
-	let t_value = (/*impliedItem*/ ctx[19].alt ?? dropPathNDendron(/*impliedItem*/ ctx[19].to, /*settings*/ ctx[2])) + "";
+function create_fragment$f(ctx) {
+	let script;
+	let script_src_value;
 	let t;
-	let div_class_value;
-	let div_aria_label_value;
-	let div_aria_label_position_value;
-	let li_class_value;
+	let div;
 	let mounted;
 	let dispose;
 
-	function click_handler_1(...args) {
-		return /*click_handler_1*/ ctx[11](/*impliedItem*/ ctx[19], ...args);
-	}
-
-	function mouseover_handler_1(...args) {
-		return /*mouseover_handler_1*/ ctx[12](/*impliedItem*/ ctx[19], ...args);
-	}
-
-	return {
-		c() {
-			li = element("li");
-			div = element("div");
-			t = text(t_value);
-			attr(div, "class", div_class_value = "" + (/*impliedItem*/ ctx[19].cls + " " + (/*impliedItem*/ ctx[19].implied ?? "") + " svelte-1dlhare"));
-			attr(div, "aria-label", div_aria_label_value = /*impliedItem*/ ctx[19].parent ?? "");
-			attr(div, "aria-label-position", div_aria_label_position_value = /*rlLeaf*/ ctx[6] ? "left" : "right");
-
-			attr(li, "class", li_class_value = "BC-Implied " + (/*treatCurrNodeAsImpliedSibling*/ ctx[7] && /*impliedItem*/ ctx[19].to === /*currFile*/ ctx[1].basename
-			? "BC-active-note"
-			: ""));
-		},
-		m(target, anchor) {
-			insert(target, li, anchor);
-			append(li, div);
-			append(div, t);
-
-			if (!mounted) {
-				dispose = [
-					listen(div, "click", click_handler_1),
-					listen(div, "mouseover", mouseover_handler_1)
-				];
-
-				mounted = true;
-			}
-		},
-		p(new_ctx, dirty) {
-			ctx = new_ctx;
-			if (dirty & /*filteredSquaresArr, settings*/ 5 && t_value !== (t_value = (/*impliedItem*/ ctx[19].alt ?? dropPathNDendron(/*impliedItem*/ ctx[19].to, /*settings*/ ctx[2])) + "")) set_data(t, t_value);
-
-			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "" + (/*impliedItem*/ ctx[19].cls + " " + (/*impliedItem*/ ctx[19].implied ?? "") + " svelte-1dlhare"))) {
-				attr(div, "class", div_class_value);
-			}
-
-			if (dirty & /*filteredSquaresArr*/ 1 && div_aria_label_value !== (div_aria_label_value = /*impliedItem*/ ctx[19].parent ?? "")) {
-				attr(div, "aria-label", div_aria_label_value);
-			}
-
-			if (dirty & /*filteredSquaresArr, currFile*/ 3 && li_class_value !== (li_class_value = "BC-Implied " + (/*treatCurrNodeAsImpliedSibling*/ ctx[7] && /*impliedItem*/ ctx[19].to === /*currFile*/ ctx[1].basename
-			? "BC-active-note"
-			: ""))) {
-				attr(li, "class", li_class_value);
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(li);
-			mounted = false;
-			run_all(dispose);
-		}
-	};
-}
-
-// (25:6) {#each squares as square}
-function create_each_block_1$4(ctx) {
-	let if_block_anchor;
-	let if_block = (/*square*/ ctx[16].realItems.length || /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) && create_if_block$3(ctx);
-
-	return {
-		c() {
-			if (if_block) if_block.c();
-			if_block_anchor = empty();
-		},
-		m(target, anchor) {
-			if (if_block) if_block.m(target, anchor);
-			insert(target, if_block_anchor, anchor);
-		},
-		p(ctx, dirty) {
-			if (/*square*/ ctx[16].realItems.length || /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) {
-				if (if_block) {
-					if_block.p(ctx, dirty);
-				} else {
-					if_block = create_if_block$3(ctx);
-					if_block.c();
-					if_block.m(if_block_anchor.parentNode, if_block_anchor);
-				}
-			} else if (if_block) {
-				if_block.d(1);
-				if_block = null;
-			}
-		},
-		d(detaching) {
-			if (if_block) if_block.d(detaching);
-			if (detaching) detach(if_block_anchor);
-		}
-	};
-}
-
-// (19:2) {#each filteredSquaresArr as squares}
-function create_each_block$6(ctx) {
-	let details;
-	let summary;
-	let t0_value = /*squares*/ ctx[13].map(func).join(", ") + "";
-	let t0;
-	let t1;
-	let t2;
-	let each_value_1 = /*squares*/ ctx[13];
-	let each_blocks = [];
-
-	for (let i = 0; i < each_value_1.length; i += 1) {
-		each_blocks[i] = create_each_block_1$4(get_each_context_1$4(ctx, each_value_1, i));
-	}
-
-	return {
-		c() {
-			details = element("details");
-			summary = element("summary");
-			t0 = text(t0_value);
-			t1 = space();
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			t2 = space();
-			attr(summary, "class", "hier-summary svelte-1dlhare");
-			details.open = true;
-		},
-		m(target, anchor) {
-			insert(target, details, anchor);
-			append(details, summary);
-			append(summary, t0);
-			append(details, t1);
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(details, null);
-			}
-
-			append(details, t2);
-		},
-		p(ctx, dirty) {
-			if (dirty & /*filteredSquaresArr*/ 1 && t0_value !== (t0_value = /*squares*/ ctx[13].map(func).join(", ") + "")) set_data(t0, t0_value);
-
-			if (dirty & /*filteredSquaresArr, treatCurrNodeAsImpliedSibling, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings, showRelationType, showImpliedRelations*/ 511) {
-				each_value_1 = /*squares*/ ctx[13];
-				let i;
-
-				for (i = 0; i < each_value_1.length; i += 1) {
-					const child_ctx = get_each_context_1$4(ctx, each_value_1, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block_1$4(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(details, t2);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value_1.length;
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(details);
-			destroy_each(each_blocks, detaching);
-		}
-	};
-}
-
-function create_fragment$a(ctx) {
-	let div;
-	let div_class_value;
-	let each_value = /*filteredSquaresArr*/ ctx[0];
-	let each_blocks = [];
-
-	for (let i = 0; i < each_value.length; i += 1) {
-		each_blocks[i] = create_each_block$6(get_each_context$6(ctx, each_value, i));
-	}
-
 	return {
 		c() {
+			script = element("script");
+			t = space();
 			div = element("div");
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			attr(div, "class", div_class_value = "BC-list markdown-preview-view " + (/*filteredSquaresArr*/ ctx[0].length
-			? ""
-			: "BC-empty-view") + " svelte-1dlhare");
+			attr(script, "type", "text/javascript");
+			if (script.src !== (script_src_value = "https://ko-fi.com/widgets/widget_2.js")) attr(script, "src", script_src_value);
 		},
 		m(target, anchor) {
-			insert(target, div, anchor);
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(div, null);
-			}
-		},
-		p(ctx, [dirty]) {
-			if (dirty & /*filteredSquaresArr, treatCurrNodeAsImpliedSibling, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings, showRelationType, showImpliedRelations*/ 511) {
-				each_value = /*filteredSquaresArr*/ ctx[0];
-				let i;
-
-				for (i = 0; i < each_value.length; i += 1) {
-					const child_ctx = get_each_context$6(ctx, each_value, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block$6(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(div, null);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value.length;
-			}
+			append(document.head, script);
+			insert(target, t, anchor);
+			insert(target, div, anchor);
+			/*div_binding*/ ctx[2](div);
 
-			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "BC-list markdown-preview-view " + (/*filteredSquaresArr*/ ctx[0].length
-			? ""
-			: "BC-empty-view") + " svelte-1dlhare")) {
-				attr(div, "class", div_class_value);
+			if (!mounted) {
+				dispose = listen(script, "load", /*initializeKofi*/ ctx[1]);
+				mounted = true;
 			}
 		},
+		p: noop,
 		i: noop,
 		o: noop,
 		d(detaching) {
+			detach(script);
+			if (detaching) detach(t);
 			if (detaching) detach(div);
-			destroy_each(each_blocks, detaching);
+			/*div_binding*/ ctx[2](null);
+			mounted = false;
+			dispose();
 		}
 	};
 }
 
-const func = square => square.field;
-
-function instance$a($$self, $$props, $$invalidate) {
-	
-	
-	
-	let { filteredSquaresArr } = $$props;
-	let { currFile } = $$props;
-	let { settings } = $$props;
-	let { matrixView } = $$props;
-	let { app } = $$props;
-	const { showImpliedRelations, rlLeaf, treatCurrNodeAsImpliedSibling, showRelationType } = settings;
-	const click_handler = async (realItem, e) => openOrSwitch(app, realItem.to, e);
-	const mouseover_handler = (realItem, e) => hoverPreview(e, matrixView, realItem.to);
-	const click_handler_1 = async (impliedItem, e) => openOrSwitch(app, impliedItem.to, e);
-	const mouseover_handler_1 = (impliedItem, e) => hoverPreview(e, matrixView, impliedItem.to);
+function instance$f($$self, $$props, $$invalidate) {
+	let button;
 
-	$$self.$$set = $$props => {
-		if ("filteredSquaresArr" in $$props) $$invalidate(0, filteredSquaresArr = $$props.filteredSquaresArr);
-		if ("currFile" in $$props) $$invalidate(1, currFile = $$props.currFile);
-		if ("settings" in $$props) $$invalidate(2, settings = $$props.settings);
-		if ("matrixView" in $$props) $$invalidate(3, matrixView = $$props.matrixView);
-		if ("app" in $$props) $$invalidate(4, app = $$props.app);
+	var initializeKofi = () => {
+		kofiwidget2.init("Support Breadcrumbs development!", "#29abe0", "G2G454TZF");
+		$$invalidate(0, button.innerHTML = kofiwidget2.getHTML(), button);
 	};
 
-	return [
-		filteredSquaresArr,
-		currFile,
-		settings,
-		matrixView,
-		app,
-		showImpliedRelations,
-		rlLeaf,
-		treatCurrNodeAsImpliedSibling,
-		showRelationType,
-		click_handler,
-		mouseover_handler,
-		click_handler_1,
-		mouseover_handler_1
-	];
-}
-
-class Lists extends SvelteComponent {
-	constructor(options) {
-		super();
-		if (!document.getElementById("svelte-1dlhare-style")) add_css$6();
-
-		init(this, options, instance$a, create_fragment$a, safe_not_equal, {
-			filteredSquaresArr: 0,
-			currFile: 1,
-			settings: 2,
-			matrixView: 3,
-			app: 4
+	function div_binding($$value) {
+		binding_callbacks[$$value ? "unshift" : "push"](() => {
+			button = $$value;
+			$$invalidate(0, button);
 		});
 	}
-}
 
-/* src\Components\Matrix.svelte generated by Svelte v3.35.0 */
-
-function add_css$5() {
-	var style = element("style");
-	style.id = "svelte-sp0k97-style";
-	style.textContent = "div.BC-Matrix.svelte-sp0k97.svelte-sp0k97{padding:5px}div.BC-Matrix.svelte-sp0k97>div.svelte-sp0k97{border:3px solid var(--background-modifier-border);border-radius:3px;text-align:center;margin:3px;position:relative;height:fit-content}div.BC-Matrix-square.svelte-sp0k97.svelte-sp0k97{border:1px solid var(--background-modifier-border)}div.BC-Matrix-headers.svelte-sp0k97.svelte-sp0k97{display:flex;justify-content:space-between;align-items:center}.BC-Matrix-header.svelte-sp0k97.svelte-sp0k97{margin:2px;padding:0px 10px}ol.svelte-sp0k97.svelte-sp0k97{margin:3px;padding-left:30px}";
-	append(document.head, style);
+	return [button, initializeKofi, div_binding];
 }
 
-function get_each_context$5(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[13] = list[i];
-	return child_ctx;
+class KoFi extends SvelteComponent {
+	constructor(options) {
+		super();
+		init(this, options, instance$f, create_fragment$f, safe_not_equal, {});
+	}
 }
 
-function get_each_context_1$3(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[16] = list[i];
-	return child_ctx;
+function addCreateIndexSettings(plugin, cmdsDetails) {
+    const { settings } = plugin;
+    const createIndexDetails = subDetails("Create Index", cmdsDetails);
+    new obsidian.Setting(createIndexDetails)
+        .setName("Add wiklink brackets")
+        .setDesc(fragWithHTML("When creating an index, should it wrap the note name in wikilinks <code>[[]]</code> or not.\n✅ = yes, ❌ = no."))
+        .addToggle((toggle) => toggle.setValue(settings.wikilinkIndex).onChange(async (value) => {
+        settings.wikilinkIndex = value;
+        await plugin.saveSettings();
+    }));
+    new obsidian.Setting(createIndexDetails)
+        .setName("Show aliases of notes in index")
+        .setDesc("Show the aliases of each note in brackets.\n✅ = yes, ❌ = no.")
+        .addToggle((toggle) => toggle.setValue(settings.aliasesInIndex).onChange(async (value) => {
+        settings.aliasesInIndex = value;
+        await plugin.saveSettings();
+    }));
 }
 
-function get_each_context_2$1(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[19] = list[i];
-	return child_ctx;
+function addCSVSettings(plugin, alternativeHierarchyDetails) {
+    const { settings } = plugin;
+    const csvDetails = subDetails("CSV Notes", alternativeHierarchyDetails);
+    new obsidian.Setting(csvDetails)
+        .setName("CSV Breadcrumb Paths")
+        .setDesc("The file path of a csv files with breadcrumbs information.")
+        .addText((text) => {
+        text.setValue(settings.CSVPaths);
+        text.inputEl.onblur = async () => {
+            settings.CSVPaths = text.inputEl.value;
+            await plugin.saveSettings();
+        };
+    });
 }
 
-function get_each_context_3$1(ctx, list, i) {
-	const child_ctx = ctx.slice();
-	child_ctx[22] = list[i];
-	return child_ctx;
+function addDebuggingsSettings(plugin, containerEl) {
+    const { settings } = plugin;
+    const debugDetails = details("Debugging", containerEl);
+    new obsidian.Setting(debugDetails)
+        .setName("Debug Mode")
+        .setDesc(fragWithHTML("Set the minimum level of debug messages to console log. If you choose <code>TRACE</code>, then everything will be logged. If you choose <code>ERROR</code>, then only the most necessary issues will be logged. <code>SILENT</code> will turn off all logs."))
+        .addDropdown((dd) => {
+        Object.keys(loglevel.levels).forEach((key) => dd.addOption(key, key));
+        dd.setValue(settings.debugMode).onChange(async (value) => {
+            loglevel.setLevel(value);
+            settings.debugMode = value;
+            await plugin.saveSettings();
+        });
+    });
+    debugDetails.createEl("button", { text: "Console log settings" }, (el) => {
+        el.addEventListener("click", () => console.log(settings));
+    });
 }
 
-// (22:8) {#if square.realItems.length || (showImpliedRelations && square.impliedItems.length)}
-function create_if_block$2(ctx) {
-	let div1;
-	let div0;
-	let h4;
-	let t0_value = /*square*/ ctx[16].field + "";
-	let t0;
-	let t1;
-	let t2;
-	let t3;
-	let if_block0 = /*showRelationType*/ ctx[8] && create_if_block_5(ctx);
-	let if_block1 = /*square*/ ctx[16].realItems.length && create_if_block_4(ctx);
-	let if_block2 = /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length && create_if_block_1$2(ctx);
-
-	return {
-		c() {
-			div1 = element("div");
-			div0 = element("div");
-			h4 = element("h4");
-			t0 = text(t0_value);
-			t1 = space();
-			if (if_block0) if_block0.c();
-			t2 = space();
-			if (if_block1) if_block1.c();
-			t3 = space();
-			if (if_block2) if_block2.c();
-			attr(h4, "class", "BC-Matrix-header svelte-sp0k97");
-			attr(div0, "class", "BC-Matrix-headers svelte-sp0k97");
-			attr(div1, "class", "BC-Matrix-square svelte-sp0k97");
-		},
-		m(target, anchor) {
-			insert(target, div1, anchor);
-			append(div1, div0);
-			append(div0, h4);
-			append(h4, t0);
-			append(div0, t1);
-			if (if_block0) if_block0.m(div0, null);
-			append(div1, t2);
-			if (if_block1) if_block1.m(div1, null);
-			append(div1, t3);
-			if (if_block2) if_block2.m(div1, null);
-		},
-		p(ctx, dirty) {
-			if (dirty & /*filteredSquaresArr*/ 1 && t0_value !== (t0_value = /*square*/ ctx[16].field + "")) set_data(t0, t0_value);
-			if (/*showRelationType*/ ctx[8]) if_block0.p(ctx, dirty);
-
-			if (/*square*/ ctx[16].realItems.length) {
-				if (if_block1) {
-					if_block1.p(ctx, dirty);
-				} else {
-					if_block1 = create_if_block_4(ctx);
-					if_block1.c();
-					if_block1.m(div1, t3);
-				}
-			} else if (if_block1) {
-				if_block1.d(1);
-				if_block1 = null;
-			}
+function addDendronSettings(plugin, alternativeHierarchyDetails) {
+    const { settings } = plugin;
+    const { userHiers } = settings;
+    const fields = getFields(userHiers);
+    const dendronDetails = subDetails("Dendron Notes", alternativeHierarchyDetails);
+    new obsidian.Setting(dendronDetails)
+        .setName("Add Dendron notes to graph")
+        .setDesc(fragWithHTML("Dendron notes create a hierarchy using note names.</br><code>nmath.algebra</code> is a note about algebra, whose parent is <code>math</code>.</br><code>nmath.calculus.limits</code> is a note about limits whose parent is the note <code>math.calculus</code>, the parent of which is <code>math</code>."))
+        .addToggle((toggle) => toggle.setValue(settings.addDendronNotes).onChange(async (value) => {
+        settings.addDendronNotes = value;
+        await plugin.saveSettings();
+    }));
+    new obsidian.Setting(dendronDetails)
+        .setName("Dendron note delimiter")
+        .setDesc(fragWithHTML("If you choose to use Dendron notes (setting above), which delimiter should Breadcrumbs look for? The default is <code>.</code>."))
+        .addText((text) => {
+        text.setPlaceholder("Delimiter").setValue(settings.dendronNoteDelimiter);
+        text.inputEl.onblur = async () => {
+            const value = text.getValue();
+            if (value) {
+                settings.dendronNoteDelimiter = value;
+                await plugin.saveSettings();
+            }
+            else {
+                new obsidian.Notice(`The delimiter can't be blank`);
+                settings.dendronNoteDelimiter = DEFAULT_SETTINGS.dendronNoteDelimiter;
+                await plugin.saveSettings();
+            }
+        };
+    });
+    new obsidian.Setting(dendronDetails)
+        .setName("Trim Dendron Note Names")
+        .setDesc(fragWithHTML("When displaying a dendron note name, should it be trimmed to only show the last item in the chain?</br>e.g. <code>A.B.C</code> would be trimmed to only display <code>C</code>."))
+        .addToggle((toggle) => toggle.setValue(settings.trimDendronNotes).onChange(async (value) => {
+        settings.trimDendronNotes = value;
+        await plugin.saveSettings();
+        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
+    }));
+    new obsidian.Setting(dendronDetails)
+        .setName("Dendron Note Field")
+        .setDesc("Which field should Breadcrumbs use for Dendron notes?")
+        .addDropdown((cb) => {
+        fields.forEach((field) => {
+            cb.addOption(field, field);
+        });
+        cb.setValue(settings.dendronNoteField);
+        cb.onChange(async (value) => {
+            settings.dendronNoteField = value;
+            await plugin.saveSettings();
+        });
+    });
+}
 
-			if (/*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) {
-				if (if_block2) {
-					if_block2.p(ctx, dirty);
-				} else {
-					if_block2 = create_if_block_1$2(ctx);
-					if_block2.c();
-					if_block2.m(div1, null);
-				}
-			} else if (if_block2) {
-				if_block2.d(1);
-				if_block2 = null;
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(div1);
-			if (if_block0) if_block0.d();
-			if (if_block1) if_block1.d();
-			if (if_block2) if_block2.d();
-		}
-	};
+/* src\Components\Checkboxes.svelte generated by Svelte v3.35.0 */
+
+function add_css$7() {
+	var style = element("style");
+	style.id = "svelte-t4gbbx-style";
+	style.textContent = ".grid.svelte-t4gbbx{display:grid;grid-template-columns:repeat(auto-fit, minmax(100px, 1fr))}";
+	append(document.head, style);
 }
 
-// (27:14) {#if showRelationType}
-function create_if_block_5(ctx) {
-	let h6;
-	let t_value = (/*square*/ ctx[16].realItems.length ? "Real" : "Implied") + "";
-	let t;
+function get_each_context$7(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[11] = list[i];
+	return child_ctx;
+}
+
+// (43:2) {#each options as option}
+function create_each_block$7(ctx) {
+	let div;
+	let label;
+	let input;
+	let input_value_value;
+	let t0;
+	let t1_value = /*option*/ ctx[11] + "";
+	let t1;
+	let t2;
+	let mounted;
+	let dispose;
 
 	return {
 		c() {
-			h6 = element("h6");
-			t = text(t_value);
-			attr(h6, "class", "BC-Matrix-header svelte-sp0k97");
+			div = element("div");
+			label = element("label");
+			input = element("input");
+			t0 = space();
+			t1 = text(t1_value);
+			t2 = space();
+			attr(input, "type", "checkbox");
+			input.__value = input_value_value = /*option*/ ctx[11];
+			input.value = input.__value;
+			/*$$binding_groups*/ ctx[8][0].push(input);
 		},
 		m(target, anchor) {
-			insert(target, h6, anchor);
-			append(h6, t);
+			insert(target, div, anchor);
+			append(div, label);
+			append(label, input);
+			input.checked = ~/*selected*/ ctx[1].indexOf(input.__value);
+			append(label, t0);
+			append(label, t1);
+			append(div, t2);
+
+			if (!mounted) {
+				dispose = [
+					listen(input, "change", /*input_change_handler*/ ctx[7]),
+					listen(input, "change", /*change_handler*/ ctx[9])
+				];
+
+				mounted = true;
+			}
 		},
 		p(ctx, dirty) {
-			if (dirty & /*filteredSquaresArr*/ 1 && t_value !== (t_value = (/*square*/ ctx[16].realItems.length ? "Real" : "Implied") + "")) set_data(t, t_value);
+			if (dirty & /*options*/ 1 && input_value_value !== (input_value_value = /*option*/ ctx[11])) {
+				input.__value = input_value_value;
+				input.value = input.__value;
+			}
+
+			if (dirty & /*selected*/ 2) {
+				input.checked = ~/*selected*/ ctx[1].indexOf(input.__value);
+			}
+
+			if (dirty & /*options*/ 1 && t1_value !== (t1_value = /*option*/ ctx[11] + "")) set_data(t1, t1_value);
 		},
 		d(detaching) {
-			if (detaching) detach(h6);
+			if (detaching) detach(div);
+			/*$$binding_groups*/ ctx[8][0].splice(/*$$binding_groups*/ ctx[8][0].indexOf(input), 1);
+			mounted = false;
+			run_all(dispose);
 		}
 	};
 }
 
-// (33:12) {#if square.realItems.length}
-function create_if_block_4(ctx) {
-	let ol;
-	let each_value_3 = /*square*/ ctx[16].realItems;
+function create_fragment$e(ctx) {
+	let div0;
+	let button;
+	let t0;
+	let t1_value = (/*toNone*/ ctx[2] ? "None" : "All") + "";
+	let t1;
+	let t2;
+	let div1;
+	let mounted;
+	let dispose;
+	let each_value = /*options*/ ctx[0];
 	let each_blocks = [];
 
-	for (let i = 0; i < each_value_3.length; i += 1) {
-		each_blocks[i] = create_each_block_3$1(get_each_context_3$1(ctx, each_value_3, i));
+	for (let i = 0; i < each_value.length; i += 1) {
+		each_blocks[i] = create_each_block$7(get_each_context$7(ctx, each_value, i));
 	}
 
 	return {
 		c() {
-			ol = element("ol");
+			div0 = element("div");
+			button = element("button");
+			t0 = text("Select ");
+			t1 = text(t1_value);
+			t2 = space();
+			div1 = element("div");
 
 			for (let i = 0; i < each_blocks.length; i += 1) {
 				each_blocks[i].c();
 			}
 
-			attr(ol, "class", "svelte-sp0k97");
+			attr(div1, "class", "grid svelte-t4gbbx");
 		},
 		m(target, anchor) {
-			insert(target, ol, anchor);
+			insert(target, div0, anchor);
+			append(div0, button);
+			append(button, t0);
+			append(button, t1);
+			insert(target, t2, anchor);
+			insert(target, div1, anchor);
 
 			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(ol, null);
+				each_blocks[i].m(div1, null);
+			}
+
+			if (!mounted) {
+				dispose = listen(button, "click", /*click_handler*/ ctx[6]);
+				mounted = true;
 			}
 		},
-		p(ctx, dirty) {
-			if (dirty & /*filteredSquaresArr, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings*/ 29) {
-				each_value_3 = /*square*/ ctx[16].realItems;
+		p(ctx, [dirty]) {
+			if (dirty & /*toNone*/ 4 && t1_value !== (t1_value = (/*toNone*/ ctx[2] ? "None" : "All") + "")) set_data(t1, t1_value);
+
+			if (dirty & /*options, selected, save*/ 11) {
+				each_value = /*options*/ ctx[0];
 				let i;
 
-				for (i = 0; i < each_value_3.length; i += 1) {
-					const child_ctx = get_each_context_3$1(ctx, each_value_3, i);
+				for (i = 0; i < each_value.length; i += 1) {
+					const child_ctx = get_each_context$7(ctx, each_value, i);
 
 					if (each_blocks[i]) {
 						each_blocks[i].p(child_ctx, dirty);
 					} else {
-						each_blocks[i] = create_each_block_3$1(child_ctx);
+						each_blocks[i] = create_each_block$7(child_ctx);
 						each_blocks[i].c();
-						each_blocks[i].m(ol, null);
+						each_blocks[i].m(div1, null);
 					}
 				}
 
@@ -27923,1725 +26990,2038 @@ function create_if_block_4(ctx) {
 					each_blocks[i].d(1);
 				}
 
-				each_blocks.length = each_value_3.length;
+				each_blocks.length = each_value.length;
 			}
 		},
+		i: noop,
+		o: noop,
 		d(detaching) {
-			if (detaching) detach(ol);
+			if (detaching) detach(div0);
+			if (detaching) detach(t2);
+			if (detaching) detach(div1);
 			destroy_each(each_blocks, detaching);
+			mounted = false;
+			dispose();
 		}
 	};
 }
 
-// (35:16) {#each square.realItems as realItem}
-function create_each_block_3$1(ctx) {
-	let li;
-	let div;
-	let t0_value = (/*realItem*/ ctx[22].alt ?? dropPathNDendron(/*realItem*/ ctx[22].to, /*settings*/ ctx[2])) + "";
-	let t0;
-	let div_class_value;
-	let t1;
-	let mounted;
-	let dispose;
+function instance$e($$self, $$props, $$invalidate) {
+	var __awaiter = this && this.__awaiter || function (thisArg, _arguments, P, generator) {
+		function adopt(value) {
+			return value instanceof P
+			? value
+			: new P(function (resolve) {
+						resolve(value);
+					});
+		}
 
-	function click_handler(...args) {
-		return /*click_handler*/ ctx[9](/*realItem*/ ctx[22], ...args);
-	}
+		return new (P || (P = Promise))(function (resolve, reject) {
+				function fulfilled(value) {
+					try {
+						step(generator.next(value));
+					} catch(e) {
+						reject(e);
+					}
+				}
 
-	function mouseover_handler(...args) {
-		return /*mouseover_handler*/ ctx[10](/*realItem*/ ctx[22], ...args);
+				function rejected(value) {
+					try {
+						step(generator["throw"](value));
+					} catch(e) {
+						reject(e);
+					}
+				}
+
+				function step(result) {
+					result.done
+					? resolve(result.value)
+					: adopt(result.value).then(fulfilled, rejected);
+				}
+
+				step((generator = generator.apply(thisArg, _arguments || [])).next());
+			});
+	};
+
+	
+	let { plugin } = $$props;
+	let { settingName } = $$props;
+	let { options } = $$props;
+	let selected = plugin.settings[settingName];
+	let toNone = selected.length === 0 ? false : true;
+
+	function save() {
+		return __awaiter(this, void 0, void 0, function* () {
+			if (plugin.settings[settingName] === undefined) {
+				return console.log(settingName + " not found in BC settings");
+			}
+
+			$$invalidate(4, plugin.settings[settingName] = selected, plugin);
+			yield plugin.saveSettings();
+			yield refreshIndex(plugin);
+		});
 	}
 
-	return {
-		c() {
-			li = element("li");
-			div = element("div");
-			t0 = text(t0_value);
-			t1 = space();
-			attr(div, "class", div_class_value = "" + (/*realItem*/ ctx[22].cls + " " + (/*realItem*/ ctx[22].implied ?? "") + " svelte-sp0k97"));
-		},
-		m(target, anchor) {
-			insert(target, li, anchor);
-			append(li, div);
-			append(div, t0);
-			append(li, t1);
+	const $$binding_groups = [[]];
+
+	const click_handler = async () => {
+		if (toNone) $$invalidate(1, selected = []); else $$invalidate(1, selected = options);
+		await save();
+	};
+
+	function input_change_handler() {
+		selected = get_binding_group_value($$binding_groups[0], this.__value, this.checked);
+		$$invalidate(1, selected);
+	}
 
-			if (!mounted) {
-				dispose = [
-					listen(div, "click", click_handler),
-					listen(div, "mouseover", mouseover_handler)
-				];
+	const change_handler = async () => save();
 
-				mounted = true;
-			}
-		},
-		p(new_ctx, dirty) {
-			ctx = new_ctx;
-			if (dirty & /*filteredSquaresArr, settings*/ 5 && t0_value !== (t0_value = (/*realItem*/ ctx[22].alt ?? dropPathNDendron(/*realItem*/ ctx[22].to, /*settings*/ ctx[2])) + "")) set_data(t0, t0_value);
+	$$self.$$set = $$props => {
+		if ("plugin" in $$props) $$invalidate(4, plugin = $$props.plugin);
+		if ("settingName" in $$props) $$invalidate(5, settingName = $$props.settingName);
+		if ("options" in $$props) $$invalidate(0, options = $$props.options);
+	};
 
-			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "" + (/*realItem*/ ctx[22].cls + " " + (/*realItem*/ ctx[22].implied ?? "") + " svelte-sp0k97"))) {
-				attr(div, "class", div_class_value);
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(li);
-			mounted = false;
-			run_all(dispose);
+	$$self.$$.update = () => {
+		if ($$self.$$.dirty & /*selected*/ 2) {
+			$$invalidate(2, toNone = selected.length === 0 ? false : true);
 		}
 	};
-}
 
-// (50:12) {#if showImpliedRelations && square.impliedItems.length}
-function create_if_block_1$2(ctx) {
-	let div;
-	let h4;
-	let t0;
-	let t1;
-	let ol;
-	let ol_start_value;
-	let if_block = /*square*/ ctx[16].impliedItems.length && create_if_block_2$1(ctx);
-	let each_value_2 = /*square*/ ctx[16].impliedItems;
-	let each_blocks = [];
+	return [
+		options,
+		selected,
+		toNone,
+		save,
+		plugin,
+		settingName,
+		click_handler,
+		input_change_handler,
+		$$binding_groups,
+		change_handler
+	];
+}
 
-	for (let i = 0; i < each_value_2.length; i += 1) {
-		each_blocks[i] = create_each_block_2$1(get_each_context_2$1(ctx, each_value_2, i));
+class Checkboxes extends SvelteComponent {
+	constructor(options) {
+		super();
+		if (!document.getElementById("svelte-t4gbbx-style")) add_css$7();
+		init(this, options, instance$e, create_fragment$e, safe_not_equal, { plugin: 4, settingName: 5, options: 0 });
 	}
+}
 
-	return {
-		c() {
-			div = element("div");
-			h4 = element("h4");
-			t0 = space();
-			if (if_block) if_block.c();
-			t1 = space();
-			ol = element("ol");
+function addGeneralSettings(plugin, containerEl) {
+    const { settings } = plugin;
+    const generalDetails = details("General Options", containerEl);
+    new obsidian.Setting(generalDetails)
+        .setName("Show Refresh Index Notice")
+        .setDesc("When Refreshing Index, should it show a notice once the operation is complete?")
+        .addToggle((toggle) => toggle.setValue(settings.showRefreshNotice).onChange(async (value) => {
+        settings.showRefreshNotice = value;
+        await plugin.saveSettings();
+    }));
+    new obsidian.Setting(generalDetails)
+        .setName("Open Views by Default")
+        .setDesc("Choose which of the views to open onload")
+        .addToggle((toggle) => {
+        toggle
+            .setTooltip("Matrix View")
+            .setValue(settings.openMatrixOnLoad)
+            .onChange(async (value) => {
+            settings.openMatrixOnLoad = value;
+            await plugin.saveSettings();
+        });
+    })
+        .addToggle((toggle) => {
+        toggle
+            .setTooltip("Stats View")
+            .setValue(settings.openStatsOnLoad)
+            .onChange(async (value) => {
+            settings.openStatsOnLoad = value;
+            await plugin.saveSettings();
+        });
+    })
+        .addToggle((toggle) => {
+        toggle
+            .setTooltip("Ducks View")
+            .setValue(settings.openDuckOnLoad)
+            .onChange(async (value) => {
+            settings.openDuckOnLoad = value;
+            await plugin.saveSettings();
+        });
+    })
+        .addToggle((toggle) => {
+        toggle
+            .setTooltip("Tree View")
+            .setValue(settings.openDownOnLoad)
+            .onChange(async (value) => {
+            settings.openDownOnLoad = value;
+            await plugin.saveSettings();
+        });
+    });
+    new obsidian.Setting(generalDetails)
+        .setName("Refresh Index on Note Change")
+        .setDesc("Refresh the Breadcrumbs index data everytime you change notes.\nThis is how Breadcrumbs used to work, making it responsive to changes immediately after changing notes. However, this can be very slow on large vaults, so it is off by default.")
+        .addToggle((toggle) => toggle.setValue(settings.refreshOnNoteChange).onChange(async (value) => {
+        settings.refreshOnNoteChange = value;
+        await plugin.saveSettings();
+    }));
+    new obsidian.Setting(generalDetails)
+        .setName("Fields used for Alternative note names (Aliases)")
+        .setDesc(fragWithHTML("A comma-separated list of fields you use to specify note name aliases. These fields will be checked, in order, and be used to display an alternate note title in both the list/matrix view, and trail/grid view.</br>This field will probably be <code>alias</code> or <code>aliases</code>, but it can be anything, like <code>title</code>, for example."))
+        .addText((text) => {
+        text.setValue(settings.altLinkFields.join(", "));
+        text.inputEl.onblur = async () => {
+            settings.altLinkFields = splitAndTrim(text.getValue());
+            await plugin.saveSettings();
+        };
+    });
+    new obsidian.Setting(generalDetails)
+        .setName("Only show first alias")
+        .setDesc("If a note has an alias (using the fields in the setting above), should only the first one be shown?")
+        .addToggle((toggle) => toggle.setValue(!settings.showAllAliases).onChange(async (value) => {
+        settings.showAllAliases = !value;
+        await plugin.saveSettings();
+        await refreshIndex(plugin);
+    }));
+    new obsidian.Setting(generalDetails)
+        .setName("Use yaml or inline fields for hierarchy data")
+        .setDesc("If enabled, Breadcrumbs will make it's hierarchy using yaml fields, and inline fields (if you have Dataview enabled).\nIf this is disabled, it will only use Juggl links for it's metadata (See below).")
+        .addToggle((toggle) => toggle.setValue(settings.useAllMetadata).onChange(async (value) => {
+        settings.useAllMetadata = value;
+        await plugin.saveSettings();
+        await refreshIndex(plugin);
+    }));
+    new obsidian.Setting(generalDetails)
+        .setName("Use Juggl link syntax without having Juggl installed.")
+        .setDesc(fragWithHTML('Should Breadcrumbs look for <a href="https://juggl.io/Link+Types">Juggl links</a> even if you don\'t have Juggl installed? If you do have Juggl installed, it will always look for Juggl links.'))
+        .addToggle((toggle) => toggle
+        .setValue(settings.parseJugglLinksWithoutJuggl)
+        .onChange(async (value) => {
+        settings.parseJugglLinksWithoutJuggl = value;
+        await plugin.saveSettings();
+    }));
+    generalDetails.createDiv().createEl("strong", {
+        text: "When running `Jump to first <direction>` command, limit which fields it can use.",
+    });
+    new Checkboxes({
+        target: generalDetails,
+        props: {
+            plugin,
+            settingName: "limitJumpToFirstFields",
+            options: getFields(settings.userHiers),
+        },
+    });
+    if (plugin.app.plugins.plugins.dataview !== undefined) {
+        new obsidian.Setting(generalDetails)
+            .setName("Dataview Wait Time")
+            .setDesc('Enter an integer number of seconds to wait for the Dataview Index to load. The larger your vault, the longer it will take.\nIf you see an error in the console saying "Cannot destructure currGraphs of undefined", try making this time longer. If you don\'t get that error, you can make this time shorter to make the Breadcrumbs load faster. The default is 5 seconds.')
+            .addText((text) => text
+            .setPlaceholder("Seconds")
+            .setValue((settings.dvWaitTime / 1000).toString())
+            .onChange(async (value) => {
+            const num = Number(value);
+            if (num > 0) {
+                settings.dvWaitTime = num * 1000;
+                await plugin.saveSettings();
+            }
+            else {
+                new obsidian.Notice("The interval must be a non-negative number");
+            }
+        }));
+    }
+}
 
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
+function addHierarchyNoteSettings(plugin, alternativeHierarchyDetails) {
+    const { settings } = plugin;
+    const hierarchyNoteDetails = subDetails("Hierarchy Notes", alternativeHierarchyDetails);
+    new obsidian.Setting(hierarchyNoteDetails)
+        .setName("Hierarchy Note(s)")
+        .setDesc("A list of notes used to create external Breadcrumb structures.")
+        .addText((text) => {
+        text
+            .setPlaceholder("Hierarchy Note(s)")
+            .setValue(settings.hierarchyNotes.join(", "));
+        text.inputEl.onblur = async () => {
+            const splits = splitAndTrim(text.getValue());
+            if (splits[0] === undefined) {
+                settings.hierarchyNotes = splits;
+                await plugin.saveSettings();
+            }
+            else if (splits.every((note) => isInVault(this.app, note))) {
+                settings.hierarchyNotes = splits;
+                await plugin.saveSettings();
+            }
+            else {
+                new obsidian.Notice("Atleast one of the notes is not in your vault");
+            }
+        };
+    });
+    new obsidian.Setting(hierarchyNoteDetails)
+        .setName("Hierarchy Note Up Field Name")
+        .setDesc("Using the breadcrumbs generated by the hierarchy note, which ↑ type should they count as? This has to be one of the ↑ types of one of your existing hierarchies. If you want it to be something else, you can make a new hierarchy just for it.")
+        .addText((text) => {
+        let finalValue = settings.HNUpField;
+        text.setPlaceholder("").setValue(settings.HNUpField);
+        text.inputEl.onblur = async () => {
+            finalValue = text.getValue();
+            if (finalValue === "") {
+                settings.HNUpField = finalValue;
+                await plugin.saveSettings();
+            }
+            else {
+                const upFields = getFields(settings.userHiers, "up");
+                if (upFields.includes(finalValue)) {
+                    settings.HNUpField = finalValue;
+                    await plugin.saveSettings();
+                }
+                else {
+                    new obsidian.Notice("The field name must be one of the exisitng ↓ fields in your hierarchies.");
+                }
+            }
+        };
+    });
+}
+
+/* node_modules\svelte-icons\components\IconBase.svelte generated by Svelte v3.35.0 */
+
+function add_css$6() {
+	var style = element("style");
+	style.id = "svelte-c8tyih-style";
+	style.textContent = "svg.svelte-c8tyih{stroke:currentColor;fill:currentColor;stroke-width:0;width:100%;height:auto;max-height:100%}";
+	append(document.head, style);
+}
+
+// (18:2) {#if title}
+function create_if_block$3(ctx) {
+	let title_1;
+	let t;
 
-			attr(h4, "class", "BC-Matrix-header svelte-sp0k97");
-			attr(div, "class", "BC-Matrix-headers svelte-sp0k97");
-			attr(ol, "start", ol_start_value = /*square*/ ctx[16].realItems.length + 1);
-			attr(ol, "class", "svelte-sp0k97");
+	return {
+		c() {
+			title_1 = svg_element("title");
+			t = text(/*title*/ ctx[0]);
 		},
 		m(target, anchor) {
-			insert(target, div, anchor);
-			append(div, h4);
-			append(div, t0);
-			if (if_block) if_block.m(div, null);
-			insert(target, t1, anchor);
-			insert(target, ol, anchor);
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(ol, null);
-			}
+			insert(target, title_1, anchor);
+			append(title_1, t);
 		},
 		p(ctx, dirty) {
-			if (/*square*/ ctx[16].impliedItems.length) {
-				if (if_block) {
-					if_block.p(ctx, dirty);
-				} else {
-					if_block = create_if_block_2$1(ctx);
-					if_block.c();
-					if_block.m(div, null);
-				}
-			} else if (if_block) {
-				if_block.d(1);
-				if_block = null;
-			}
-
-			if (dirty & /*treatCurrNodeAsImpliedSibling, filteredSquaresArr, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings*/ 223) {
-				each_value_2 = /*square*/ ctx[16].impliedItems;
-				let i;
-
-				for (i = 0; i < each_value_2.length; i += 1) {
-					const child_ctx = get_each_context_2$1(ctx, each_value_2, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block_2$1(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(ol, null);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value_2.length;
-			}
-
-			if (dirty & /*filteredSquaresArr*/ 1 && ol_start_value !== (ol_start_value = /*square*/ ctx[16].realItems.length + 1)) {
-				attr(ol, "start", ol_start_value);
-			}
+			if (dirty & /*title*/ 1) set_data(t, /*title*/ ctx[0]);
 		},
 		d(detaching) {
-			if (detaching) detach(div);
-			if (if_block) if_block.d();
-			if (detaching) detach(t1);
-			if (detaching) detach(ol);
-			destroy_each(each_blocks, detaching);
+			if (detaching) detach(title_1);
 		}
 	};
 }
 
-// (53:16) {#if square.impliedItems.length}
-function create_if_block_2$1(ctx) {
+function create_fragment$d(ctx) {
+	let svg;
 	let if_block_anchor;
-	let if_block = /*showRelationType*/ ctx[8] && /*square*/ ctx[16].realItems.length && create_if_block_3();
+	let current;
+	let if_block = /*title*/ ctx[0] && create_if_block$3(ctx);
+	const default_slot_template = /*#slots*/ ctx[3].default;
+	const default_slot = create_slot(default_slot_template, ctx, /*$$scope*/ ctx[2], null);
 
 	return {
 		c() {
+			svg = svg_element("svg");
 			if (if_block) if_block.c();
 			if_block_anchor = empty();
+			if (default_slot) default_slot.c();
+			attr(svg, "xmlns", "http://www.w3.org/2000/svg");
+			attr(svg, "viewBox", /*viewBox*/ ctx[1]);
+			attr(svg, "class", "svelte-c8tyih");
 		},
 		m(target, anchor) {
-			if (if_block) if_block.m(target, anchor);
-			insert(target, if_block_anchor, anchor);
+			insert(target, svg, anchor);
+			if (if_block) if_block.m(svg, null);
+			append(svg, if_block_anchor);
+
+			if (default_slot) {
+				default_slot.m(svg, null);
+			}
+
+			current = true;
 		},
-		p(ctx, dirty) {
-			if (/*showRelationType*/ ctx[8] && /*square*/ ctx[16].realItems.length) {
-				if (if_block) ; else {
-					if_block = create_if_block_3();
+		p(ctx, [dirty]) {
+			if (/*title*/ ctx[0]) {
+				if (if_block) {
+					if_block.p(ctx, dirty);
+				} else {
+					if_block = create_if_block$3(ctx);
 					if_block.c();
-					if_block.m(if_block_anchor.parentNode, if_block_anchor);
+					if_block.m(svg, if_block_anchor);
 				}
 			} else if (if_block) {
 				if_block.d(1);
 				if_block = null;
 			}
-		},
-		d(detaching) {
-			if (if_block) if_block.d(detaching);
-			if (detaching) detach(if_block_anchor);
-		}
-	};
-}
 
-// (54:18) {#if showRelationType && square.realItems.length}
-function create_if_block_3(ctx) {
-	let h6;
+			if (default_slot) {
+				if (default_slot.p && dirty & /*$$scope*/ 4) {
+					update_slot(default_slot, default_slot_template, ctx, /*$$scope*/ ctx[2], dirty, null, null);
+				}
+			}
 
-	return {
-		c() {
-			h6 = element("h6");
-			h6.textContent = "Implied";
-			attr(h6, "class", "BC-Matrix-header svelte-sp0k97");
+			if (!current || dirty & /*viewBox*/ 2) {
+				attr(svg, "viewBox", /*viewBox*/ ctx[1]);
+			}
 		},
-		m(target, anchor) {
-			insert(target, h6, anchor);
+		i(local) {
+			if (current) return;
+			transition_in(default_slot, local);
+			current = true;
+		},
+		o(local) {
+			transition_out(default_slot, local);
+			current = false;
 		},
 		d(detaching) {
-			if (detaching) detach(h6);
+			if (detaching) detach(svg);
+			if (if_block) if_block.d();
+			if (default_slot) default_slot.d(detaching);
 		}
 	};
 }
 
-// (60:16) {#each square.impliedItems as impliedItem}
-function create_each_block_2$1(ctx) {
-	let li;
-	let div;
-	let t_value = (/*impliedItem*/ ctx[19].alt ?? dropPathNDendron(/*impliedItem*/ ctx[19].to, /*settings*/ ctx[2])) + "";
-	let t;
-	let div_class_value;
-	let div_aria_label_value;
-	let div_aria_label_position_value;
-	let li_class_value;
-	let mounted;
-	let dispose;
-
-	function click_handler_1(...args) {
-		return /*click_handler_1*/ ctx[11](/*impliedItem*/ ctx[19], ...args);
-	}
-
-	function mouseover_handler_1(...args) {
-		return /*mouseover_handler_1*/ ctx[12](/*impliedItem*/ ctx[19], ...args);
-	}
-
-	return {
-		c() {
-			li = element("li");
-			div = element("div");
-			t = text(t_value);
-			attr(div, "class", div_class_value = "" + (/*impliedItem*/ ctx[19].cls + " " + (/*impliedItem*/ ctx[19].implied ?? "") + " svelte-sp0k97"));
-
-			attr(div, "aria-label", div_aria_label_value = /*impliedItem*/ ctx[19].parent
-			? "↑ " + /*impliedItem*/ ctx[19].parent
-			: "");
-
-			attr(div, "aria-label-position", div_aria_label_position_value = /*rlLeaf*/ ctx[6] ? "left" : "right");
-
-			attr(li, "class", li_class_value = "BC-Implied " + (/*treatCurrNodeAsImpliedSibling*/ ctx[7] && /*impliedItem*/ ctx[19].to === /*currFile*/ ctx[1].basename
-			? "BC-active-note"
-			: ""));
-		},
-		m(target, anchor) {
-			insert(target, li, anchor);
-			append(li, div);
-			append(div, t);
-
-			if (!mounted) {
-				dispose = [
-					listen(div, "click", click_handler_1),
-					listen(div, "mouseover", mouseover_handler_1)
-				];
-
-				mounted = true;
-			}
-		},
-		p(new_ctx, dirty) {
-			ctx = new_ctx;
-			if (dirty & /*filteredSquaresArr, settings*/ 5 && t_value !== (t_value = (/*impliedItem*/ ctx[19].alt ?? dropPathNDendron(/*impliedItem*/ ctx[19].to, /*settings*/ ctx[2])) + "")) set_data(t, t_value);
-
-			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "" + (/*impliedItem*/ ctx[19].cls + " " + (/*impliedItem*/ ctx[19].implied ?? "") + " svelte-sp0k97"))) {
-				attr(div, "class", div_class_value);
-			}
-
-			if (dirty & /*filteredSquaresArr*/ 1 && div_aria_label_value !== (div_aria_label_value = /*impliedItem*/ ctx[19].parent
-			? "↑ " + /*impliedItem*/ ctx[19].parent
-			: "")) {
-				attr(div, "aria-label", div_aria_label_value);
-			}
+function instance$d($$self, $$props, $$invalidate) {
+	let { $$slots: slots = {}, $$scope } = $$props;
+	let { title = null } = $$props;
+	let { viewBox } = $$props;
 
-			if (dirty & /*filteredSquaresArr, currFile*/ 3 && li_class_value !== (li_class_value = "BC-Implied " + (/*treatCurrNodeAsImpliedSibling*/ ctx[7] && /*impliedItem*/ ctx[19].to === /*currFile*/ ctx[1].basename
-			? "BC-active-note"
-			: ""))) {
-				attr(li, "class", li_class_value);
-			}
-		},
-		d(detaching) {
-			if (detaching) detach(li);
-			mounted = false;
-			run_all(dispose);
-		}
+	$$self.$$set = $$props => {
+		if ("title" in $$props) $$invalidate(0, title = $$props.title);
+		if ("viewBox" in $$props) $$invalidate(1, viewBox = $$props.viewBox);
+		if ("$$scope" in $$props) $$invalidate(2, $$scope = $$props.$$scope);
 	};
-}
 
-// (21:6) {#each squares as square}
-function create_each_block_1$3(ctx) {
-	let if_block_anchor;
-	let if_block = (/*square*/ ctx[16].realItems.length || /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) && create_if_block$2(ctx);
+	return [title, viewBox, $$scope, slots];
+}
 
-	return {
-		c() {
-			if (if_block) if_block.c();
-			if_block_anchor = empty();
-		},
-		m(target, anchor) {
-			if (if_block) if_block.m(target, anchor);
-			insert(target, if_block_anchor, anchor);
-		},
-		p(ctx, dirty) {
-			if (/*square*/ ctx[16].realItems.length || /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) {
-				if (if_block) {
-					if_block.p(ctx, dirty);
-				} else {
-					if_block = create_if_block$2(ctx);
-					if_block.c();
-					if_block.m(if_block_anchor.parentNode, if_block_anchor);
-				}
-			} else if (if_block) {
-				if_block.d(1);
-				if_block = null;
-			}
+class IconBase extends SvelteComponent {
+	constructor(options) {
+		super();
+		if (!document.getElementById("svelte-c8tyih-style")) add_css$6();
+		init(this, options, instance$d, create_fragment$d, safe_not_equal, { title: 0, viewBox: 1 });
+	}
+}
+
+/* node_modules\svelte-icons\fa\FaListUl.svelte generated by Svelte v3.35.0 */
+
+function create_default_slot$5(ctx) {
+	let path;
+
+	return {
+		c() {
+			path = svg_element("path");
+			attr(path, "d", "M48 48a48 48 0 1 0 48 48 48 48 0 0 0-48-48zm0 160a48 48 0 1 0 48 48 48 48 0 0 0-48-48zm0 160a48 48 0 1 0 48 48 48 48 0 0 0-48-48zm448 16H176a16 16 0 0 0-16 16v32a16 16 0 0 0 16 16h320a16 16 0 0 0 16-16v-32a16 16 0 0 0-16-16zm0-320H176a16 16 0 0 0-16 16v32a16 16 0 0 0 16 16h320a16 16 0 0 0 16-16V80a16 16 0 0 0-16-16zm0 160H176a16 16 0 0 0-16 16v32a16 16 0 0 0 16 16h320a16 16 0 0 0 16-16v-32a16 16 0 0 0-16-16z");
+		},
+		m(target, anchor) {
+			insert(target, path, anchor);
 		},
 		d(detaching) {
-			if (if_block) if_block.d(detaching);
-			if (detaching) detach(if_block_anchor);
+			if (detaching) detach(path);
 		}
 	};
 }
 
-// (19:2) {#each filteredSquaresArr as squares}
-function create_each_block$5(ctx) {
-	let div;
-	let t;
-	let each_value_1 = /*squares*/ ctx[13];
-	let each_blocks = [];
+function create_fragment$c(ctx) {
+	let iconbase;
+	let current;
+	const iconbase_spread_levels = [{ viewBox: "0 0 512 512" }, /*$$props*/ ctx[0]];
 
-	for (let i = 0; i < each_value_1.length; i += 1) {
-		each_blocks[i] = create_each_block_1$3(get_each_context_1$3(ctx, each_value_1, i));
+	let iconbase_props = {
+		$$slots: { default: [create_default_slot$5] },
+		$$scope: { ctx }
+	};
+
+	for (let i = 0; i < iconbase_spread_levels.length; i += 1) {
+		iconbase_props = assign(iconbase_props, iconbase_spread_levels[i]);
 	}
 
+	iconbase = new IconBase({ props: iconbase_props });
+
 	return {
 		c() {
-			div = element("div");
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			t = space();
-			attr(div, "class", "BC-matrix-hier svelte-sp0k97");
+			create_component(iconbase.$$.fragment);
 		},
 		m(target, anchor) {
-			insert(target, div, anchor);
+			mount_component(iconbase, target, anchor);
+			current = true;
+		},
+		p(ctx, [dirty]) {
+			const iconbase_changes = (dirty & /*$$props*/ 1)
+			? get_spread_update(iconbase_spread_levels, [iconbase_spread_levels[0], get_spread_object(/*$$props*/ ctx[0])])
+			: {};
 
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(div, null);
+			if (dirty & /*$$scope*/ 2) {
+				iconbase_changes.$$scope = { dirty, ctx };
 			}
 
-			append(div, t);
+			iconbase.$set(iconbase_changes);
 		},
-		p(ctx, dirty) {
-			if (dirty & /*filteredSquaresArr, treatCurrNodeAsImpliedSibling, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings, showRelationType, showImpliedRelations*/ 511) {
-				each_value_1 = /*squares*/ ctx[13];
-				let i;
-
-				for (i = 0; i < each_value_1.length; i += 1) {
-					const child_ctx = get_each_context_1$3(ctx, each_value_1, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block_1$3(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(div, t);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value_1.length;
-			}
+		i(local) {
+			if (current) return;
+			transition_in(iconbase.$$.fragment, local);
+			current = true;
+		},
+		o(local) {
+			transition_out(iconbase.$$.fragment, local);
+			current = false;
 		},
 		d(detaching) {
-			if (detaching) detach(div);
-			destroy_each(each_blocks, detaching);
+			destroy_component(iconbase, detaching);
 		}
 	};
 }
 
-function create_fragment$9(ctx) {
-	let div;
-	let div_class_value;
-	let each_value = /*filteredSquaresArr*/ ctx[0];
-	let each_blocks = [];
+function instance$c($$self, $$props, $$invalidate) {
+	$$self.$$set = $$new_props => {
+		$$invalidate(0, $$props = assign(assign({}, $$props), exclude_internal_props($$new_props)));
+	};
 
-	for (let i = 0; i < each_value.length; i += 1) {
-		each_blocks[i] = create_each_block$5(get_each_context$5(ctx, each_value, i));
+	$$props = exclude_internal_props($$props);
+	return [$$props];
+}
+
+class FaListUl extends SvelteComponent {
+	constructor(options) {
+		super();
+		init(this, options, instance$c, create_fragment$c, safe_not_equal, {});
 	}
+}
 
-	return {
-		c() {
-			div = element("div");
+/* node_modules\svelte-icons\fa\FaPlus.svelte generated by Svelte v3.35.0 */
 
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
+function create_default_slot$4(ctx) {
+	let path;
 
-			attr(div, "class", div_class_value = "BC-Matrix  markdown-preview-view " + (/*filteredSquaresArr*/ ctx[0].length
-			? ""
-			: "BC-empty-view") + " svelte-sp0k97");
+	return {
+		c() {
+			path = svg_element("path");
+			attr(path, "d", "M416 208H272V64c0-17.67-14.33-32-32-32h-32c-17.67 0-32 14.33-32 32v144H32c-17.67 0-32 14.33-32 32v32c0 17.67 14.33 32 32 32h144v144c0 17.67 14.33 32 32 32h32c17.67 0 32-14.33 32-32V304h144c17.67 0 32-14.33 32-32v-32c0-17.67-14.33-32-32-32z");
 		},
 		m(target, anchor) {
-			insert(target, div, anchor);
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(div, null);
-			}
-		},
-		p(ctx, [dirty]) {
-			if (dirty & /*filteredSquaresArr, treatCurrNodeAsImpliedSibling, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings, showRelationType, showImpliedRelations*/ 511) {
-				each_value = /*filteredSquaresArr*/ ctx[0];
-				let i;
-
-				for (i = 0; i < each_value.length; i += 1) {
-					const child_ctx = get_each_context$5(ctx, each_value, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-					} else {
-						each_blocks[i] = create_each_block$5(child_ctx);
-						each_blocks[i].c();
-						each_blocks[i].m(div, null);
-					}
-				}
-
-				for (; i < each_blocks.length; i += 1) {
-					each_blocks[i].d(1);
-				}
-
-				each_blocks.length = each_value.length;
-			}
-
-			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "BC-Matrix  markdown-preview-view " + (/*filteredSquaresArr*/ ctx[0].length
-			? ""
-			: "BC-empty-view") + " svelte-sp0k97")) {
-				attr(div, "class", div_class_value);
-			}
+			insert(target, path, anchor);
 		},
-		i: noop,
-		o: noop,
 		d(detaching) {
-			if (detaching) detach(div);
-			destroy_each(each_blocks, detaching);
+			if (detaching) detach(path);
 		}
 	};
 }
 
-function instance$9($$self, $$props, $$invalidate) {
-	
-	
-	
-	let { filteredSquaresArr } = $$props;
-	let { currFile } = $$props;
-	let { settings } = $$props;
-	let { matrixView } = $$props;
-	let { app } = $$props;
-	const { showImpliedRelations, rlLeaf, treatCurrNodeAsImpliedSibling, showRelationType } = settings;
-	const click_handler = async (realItem, e) => openOrSwitch(app, realItem.to, e);
-	const mouseover_handler = (realItem, event) => hoverPreview(event, matrixView, realItem.to);
-	const click_handler_1 = async (impliedItem, e) => openOrSwitch(app, impliedItem.to, e);
-	const mouseover_handler_1 = (impliedItem, e) => hoverPreview(e, matrixView, impliedItem.to);
+function create_fragment$b(ctx) {
+	let iconbase;
+	let current;
+	const iconbase_spread_levels = [{ viewBox: "0 0 448 512" }, /*$$props*/ ctx[0]];
 
-	$$self.$$set = $$props => {
-		if ("filteredSquaresArr" in $$props) $$invalidate(0, filteredSquaresArr = $$props.filteredSquaresArr);
-		if ("currFile" in $$props) $$invalidate(1, currFile = $$props.currFile);
-		if ("settings" in $$props) $$invalidate(2, settings = $$props.settings);
-		if ("matrixView" in $$props) $$invalidate(3, matrixView = $$props.matrixView);
-		if ("app" in $$props) $$invalidate(4, app = $$props.app);
+	let iconbase_props = {
+		$$slots: { default: [create_default_slot$4] },
+		$$scope: { ctx }
 	};
 
-	return [
-		filteredSquaresArr,
-		currFile,
-		settings,
-		matrixView,
-		app,
-		showImpliedRelations,
-		rlLeaf,
-		treatCurrNodeAsImpliedSibling,
-		showRelationType,
-		click_handler,
-		mouseover_handler,
-		click_handler_1,
-		mouseover_handler_1
-	];
-}
+	for (let i = 0; i < iconbase_spread_levels.length; i += 1) {
+		iconbase_props = assign(iconbase_props, iconbase_spread_levels[i]);
+	}
 
-class Matrix extends SvelteComponent {
-	constructor(options) {
-		super();
-		if (!document.getElementById("svelte-sp0k97-style")) add_css$5();
+	iconbase = new IconBase({ props: iconbase_props });
 
-		init(this, options, instance$9, create_fragment$9, safe_not_equal, {
-			filteredSquaresArr: 0,
-			currFile: 1,
-			settings: 2,
-			matrixView: 3,
-			app: 4
-		});
-	}
+	return {
+		c() {
+			create_component(iconbase.$$.fragment);
+		},
+		m(target, anchor) {
+			mount_component(iconbase, target, anchor);
+			current = true;
+		},
+		p(ctx, [dirty]) {
+			const iconbase_changes = (dirty & /*$$props*/ 1)
+			? get_spread_update(iconbase_spread_levels, [iconbase_spread_levels[0], get_spread_object(/*$$props*/ ctx[0])])
+			: {};
+
+			if (dirty & /*$$scope*/ 2) {
+				iconbase_changes.$$scope = { dirty, ctx };
+			}
+
+			iconbase.$set(iconbase_changes);
+		},
+		i(local) {
+			if (current) return;
+			transition_in(iconbase.$$.fragment, local);
+			current = true;
+		},
+		o(local) {
+			transition_out(iconbase.$$.fragment, local);
+			current = false;
+		},
+		d(detaching) {
+			destroy_component(iconbase, detaching);
+		}
+	};
 }
 
-class MatrixView extends obsidian.ItemView {
-    constructor(leaf, plugin) {
-        super(leaf);
-        this.icon = TRAIL_ICON;
-        this.toInternalLinkObj = (to, realQ = true, parent, implied) => {
-            return {
-                to,
-                cls: linkClass(this.app, to, realQ),
-                alt: this.getAlt(to),
-                order: this.getOrder(to),
-                parent,
-                implied,
-            };
-        };
-        this.getOrder = (node) => Number.parseInt(this.plugin.mainG.getNodeAttribute(node, "order"));
-        this.plugin = plugin;
-        this.db = new Debugger(plugin);
-    }
-    async onload() {
-        super.onload();
-        this.matrixQ = this.plugin.settings.defaultView;
-        this.app.workspace.onLayoutReady(() => {
-            setTimeout(async () => await this.draw(), this.app.plugins.plugins.dataview
-                ? this.app.plugins.plugins.dataview.api
-                    ? 1
-                    : this.plugin.settings.dvWaitTime
-                : 3000);
-        });
-    }
-    getViewType() {
-        return MATRIX_VIEW;
-    }
-    getDisplayText() {
-        return "Breadcrumbs Matrix";
-    }
-    async onOpen() { }
-    onClose() {
-        var _a;
-        (_a = this.view) === null || _a === void 0 ? void 0 : _a.$destroy();
-        return Promise.resolve();
-    }
-    getAlt(node) {
-        var _a, _b;
-        const { altLinkFields, showAllAliases } = this.plugin.settings;
-        if (altLinkFields.length) {
-            // dv First
-            const dv = (_a = this.app.plugins.plugins.dataview) === null || _a === void 0 ? void 0 : _a.api;
-            if (dv) {
-                const page = dv.page(node);
-                if (!page)
-                    return null;
-                for (const alt of altLinkFields) {
-                    const value = page[alt];
-                    const arr = typeof value === "string" ? splitAndTrim(value) : value;
-                    if (value)
-                        return showAllAliases ? arr.join(", ") : arr[0];
-                }
-            }
-            else {
-                const file = this.app.metadataCache.getFirstLinkpathDest(node, "");
-                if (file) {
-                    const metadata = this.app.metadataCache.getFileCache(file);
-                    for (const altField of altLinkFields) {
-                        const value = (_b = metadata === null || metadata === void 0 ? void 0 : metadata.frontmatter) === null || _b === void 0 ? void 0 : _b[altField];
-                        const arr = typeof value === "string" ? splitAndTrim(value) : value;
-                        if (value)
-                            return showAllAliases ? arr.join(", ") : arr[0];
-                    }
-                }
-            }
-        }
-        else
-            return null;
-    }
-    // ANCHOR Remove duplicate implied links
-    removeDuplicateImplied(reals, implieds) {
-        const realTos = reals.map((real) => real.to);
-        return implieds.filter((implied) => !realTos.includes(implied.to));
-    }
-    getHierSquares(userHiers, currFile) {
-        const { plugin } = this;
-        const { mainG, settings } = plugin;
-        const { alphaSortAsc, enableAlphaSort, treatCurrNodeAsImpliedSibling, squareDirectionsOrder, sortByNameShowAlias, } = settings;
-        if (!mainG)
-            return [];
-        const { basename } = currFile;
-        // const realsnImplieds = getRealnImplied(plugin, basename);
-        const realsnImplieds = getMatrixNeighbours(plugin, basename);
-        return userHiers.map((hier) => {
-            const filteredRealNImplied = blankRealNImplied();
-            const resultsFilter = (item, dir, oppDir, arrow) => hier[dir].includes(item.field) ||
-                (item.field.includes(`<${arrow}>`) &&
-                    hier[oppDir].includes(item.field.split(" <")[0]));
-            for (const dir in realsnImplieds) {
-                const oppDir = getOppDir(dir);
-                const arrow = ARROW_DIRECTIONS[dir];
-                const { reals, implieds } = realsnImplieds[dir];
-                filteredRealNImplied[dir].reals = reals
-                    .filter((real) => resultsFilter(real, dir, oppDir, arrow))
-                    .map((item) => this.toInternalLinkObj(item.to, true, null, item.implied));
-                filteredRealNImplied[dir].implieds = implieds
-                    .filter((implied) => resultsFilter(implied, dir, oppDir, arrow))
-                    .map((item) => this.toInternalLinkObj(item.to, false, null, item.implied));
-            }
-            let { up: { reals: ru, implieds: iu }, same: { reals: rs, implieds: is }, down: { reals: rd, implieds: id }, next: { reals: rn, implieds: iN }, prev: { reals: rp, implieds: ip }, } = filteredRealNImplied;
-            // !SECTION
-            [iu, is, id, iN, ip] = [
-                this.removeDuplicateImplied(ru, iu),
-                this.removeDuplicateImplied(rs, is),
-                this.removeDuplicateImplied(rd, id),
-                this.removeDuplicateImplied(rn, iN),
-                this.removeDuplicateImplied(rp, ip),
-            ];
-            const iSameNoDup = [];
-            is.forEach((impSib) => {
-                if (iSameNoDup.every((noDup) => noDup.to !== impSib.to)) {
-                    iSameNoDup.push(impSib);
-                }
-            });
-            is = iSameNoDup;
-            const getFieldInHier = (dir) => hier[dir][0]
-                ? hier[dir].join(", ")
-                : `${hier[getOppDir(dir)].join(",")}${ARROW_DIRECTIONS[dir]}`;
-            const squares = [ru, rs, rd, rn, rp, iu, is, id, iN, ip];
-            if (enableAlphaSort) {
-                squares.forEach((sq) => sq.sort((a, b) => {
-                    var _a, _b;
-                    return (sortByNameShowAlias ? a.to : (_a = a.alt) !== null && _a !== void 0 ? _a : a.to) <
-                        (sortByNameShowAlias ? b.to : (_b = b.alt) !== null && _b !== void 0 ? _b : b.to)
-                        ? alphaSortAsc
-                            ? -1
-                            : 1
-                        : alphaSortAsc
-                            ? 1
-                            : -1;
-                }));
-            }
-            squares.forEach((sq) => sq.sort((a, b) => a.order - b.order));
-            loglevel.info([
-                { ru },
-                { rs },
-                { rd },
-                { rn },
-                { rp },
-                { iu },
-                { is },
-                { id },
-                { iN },
-                { ip },
-            ]);
-            const square = [
-                {
-                    realItems: ru,
-                    impliedItems: iu,
-                    field: getFieldInHier("up"),
-                },
-                {
-                    realItems: rs,
-                    impliedItems: is,
-                    field: getFieldInHier("same"),
-                },
-                {
-                    realItems: rd,
-                    impliedItems: id,
-                    field: getFieldInHier("down"),
-                },
-                {
-                    realItems: rn,
-                    impliedItems: iN,
-                    field: getFieldInHier("next"),
-                },
-                {
-                    realItems: rp,
-                    impliedItems: ip,
-                    field: getFieldInHier("prev"),
-                },
-            ];
-            return squareDirectionsOrder.map((order) => square[order]);
-        });
-    }
-    drawButtons(contentEl) {
-        const { plugin, matrixQ } = this;
-        const { settings } = plugin;
-        const { alphaSortAsc } = settings;
-        contentEl.createEl("button", {
-            text: matrixQ ? "List" : "Matrix",
-            attr: {
-                "aria-label": "Mode",
-                style: "padding: 1px 6px 2px 6px !important; margin-left: 7px;",
-            },
-        }, (el) => {
-            el.onclick = async () => {
-                this.matrixQ = !matrixQ;
-                el.innerText = matrixQ ? "List" : "Matrix";
-                await this.draw();
-            };
-        });
-        contentEl.createEl("button", {
-            text: "↻",
-            attr: {
-                "aria-label": "Refresh Index",
-                style: "padding: 1px 6px 2px 6px;",
-            },
-        }, (el) => (el.onclick = async () => await refreshIndex(plugin)));
-        contentEl.createEl("button", {
-            text: alphaSortAsc ? "↗" : "↘",
-            attr: {
-                "aria-label": "Alphabetical sorting order",
-                style: "padding: 1px 6px 2px 6px;",
-            },
-        }, (el) => {
-            el.onclick = async () => {
-                plugin.settings.alphaSortAsc = !alphaSortAsc;
-                await this.plugin.saveSettings();
-                el.innerText = alphaSortAsc ? "↗" : "↘";
-                await this.draw();
-            };
-        });
-    }
-    async draw() {
-        try {
-            const { contentEl, db, plugin } = this;
-            db.start2G("Draw Matrix/List View");
-            contentEl.empty();
-            const { settings } = plugin;
-            const { userHiers } = settings;
-            const currFile = this.app.workspace.getActiveFile();
-            if (!currFile)
-                return;
-            this.drawButtons(contentEl);
-            const hierSquares = this.getHierSquares(userHiers, currFile).filter((squareArr) => squareArr.some((sq) => sq.realItems.length + sq.impliedItems.length > 0));
-            const compInput = {
-                target: contentEl,
-                props: {
-                    filteredSquaresArr: hierSquares,
-                    currFile,
-                    settings,
-                    matrixView: this,
-                    app: this.app,
-                },
-            };
-            this.matrixQ
-                ? (this.view = new Matrix(compInput))
-                : (this.view = new Lists(compInput));
-            db.end2G();
-        }
-        catch (err) {
-            loglevel.error(err);
-            this.db.end2G();
-        }
-    }
+function instance$b($$self, $$props, $$invalidate) {
+	$$self.$$set = $$new_props => {
+		$$invalidate(0, $$props = assign(assign({}, $$props), exclude_internal_props($$new_props)));
+	};
+
+	$$props = exclude_internal_props($$props);
+	return [$$props];
+}
+
+class FaPlus extends SvelteComponent {
+	constructor(options) {
+		super();
+		init(this, options, instance$b, create_fragment$b, safe_not_equal, {});
+	}
+}
+
+/* node_modules\svelte-icons\fa\FaRegTrashAlt.svelte generated by Svelte v3.35.0 */
+
+function create_default_slot$3(ctx) {
+	let path;
+
+	return {
+		c() {
+			path = svg_element("path");
+			attr(path, "d", "M268 416h24a12 12 0 0 0 12-12V188a12 12 0 0 0-12-12h-24a12 12 0 0 0-12 12v216a12 12 0 0 0 12 12zM432 80h-82.41l-34-56.7A48 48 0 0 0 274.41 0H173.59a48 48 0 0 0-41.16 23.3L98.41 80H16A16 16 0 0 0 0 96v16a16 16 0 0 0 16 16h16v336a48 48 0 0 0 48 48h288a48 48 0 0 0 48-48V128h16a16 16 0 0 0 16-16V96a16 16 0 0 0-16-16zM171.84 50.91A6 6 0 0 1 177 48h94a6 6 0 0 1 5.15 2.91L293.61 80H154.39zM368 464H80V128h288zm-212-48h24a12 12 0 0 0 12-12V188a12 12 0 0 0-12-12h-24a12 12 0 0 0-12 12v216a12 12 0 0 0 12 12z");
+		},
+		m(target, anchor) {
+			insert(target, path, anchor);
+		},
+		d(detaching) {
+			if (detaching) detach(path);
+		}
+	};
+}
+
+function create_fragment$a(ctx) {
+	let iconbase;
+	let current;
+	const iconbase_spread_levels = [{ viewBox: "0 0 448 512" }, /*$$props*/ ctx[0]];
+
+	let iconbase_props = {
+		$$slots: { default: [create_default_slot$3] },
+		$$scope: { ctx }
+	};
+
+	for (let i = 0; i < iconbase_spread_levels.length; i += 1) {
+		iconbase_props = assign(iconbase_props, iconbase_spread_levels[i]);
+	}
+
+	iconbase = new IconBase({ props: iconbase_props });
+
+	return {
+		c() {
+			create_component(iconbase.$$.fragment);
+		},
+		m(target, anchor) {
+			mount_component(iconbase, target, anchor);
+			current = true;
+		},
+		p(ctx, [dirty]) {
+			const iconbase_changes = (dirty & /*$$props*/ 1)
+			? get_spread_update(iconbase_spread_levels, [iconbase_spread_levels[0], get_spread_object(/*$$props*/ ctx[0])])
+			: {};
+
+			if (dirty & /*$$scope*/ 2) {
+				iconbase_changes.$$scope = { dirty, ctx };
+			}
+
+			iconbase.$set(iconbase_changes);
+		},
+		i(local) {
+			if (current) return;
+			transition_in(iconbase.$$.fragment, local);
+			current = true;
+		},
+		o(local) {
+			transition_out(iconbase.$$.fragment, local);
+			current = false;
+		},
+		d(detaching) {
+			destroy_component(iconbase, detaching);
+		}
+	};
+}
+
+function instance$a($$self, $$props, $$invalidate) {
+	$$self.$$set = $$new_props => {
+		$$invalidate(0, $$props = assign(assign({}, $$props), exclude_internal_props($$new_props)));
+	};
+
+	$$props = exclude_internal_props($$props);
+	return [$$props];
+}
+
+class FaRegTrashAlt extends SvelteComponent {
+	constructor(options) {
+		super();
+		init(this, options, instance$a, create_fragment$a, safe_not_equal, {});
+	}
+}
+
+/* src\Components\UserHierarchies.svelte generated by Svelte v3.35.0 */
+
+function add_css$5() {
+	var style = element("style");
+	style.id = "svelte-5y4abu-style";
+	style.textContent = "label.BC-Arrow-Label.svelte-5y4abu.svelte-5y4abu{display:inline-block;width:20px !important}div.GA-Buttons.svelte-5y4abu.svelte-5y4abu{padding-bottom:5px}details.BC-Hier-Details.svelte-5y4abu.svelte-5y4abu{border:1px solid var(--background-modifier-border);border-radius:10px;padding:10px 5px 10px 10px;margin-bottom:15px}.BC-Hier-Details.svelte-5y4abu summary.svelte-5y4abu::marker{font-size:10px}.BC-Hier-Details.svelte-5y4abu summary button.svelte-5y4abu{float:right}.icon.svelte-5y4abu.svelte-5y4abu{color:var(--text-normal);display:inline-block;padding-top:3px;width:17px;height:17px}";
+	append(document.head, style);
+}
+
+function get_each_context$6(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[12] = list[i];
+	child_ctx[14] = i;
+	return child_ctx;
+}
+
+function get_each_context_1$5(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[15] = list[i];
+	return child_ctx;
+}
+
+// (94:6) {#each DIRECTIONS as dir}
+function create_each_block_1$5(ctx) {
+	let div;
+	let label;
+	let t0_value = ARROW_DIRECTIONS[/*dir*/ ctx[15]] + "";
+	let t0;
+	let label_for_value;
+	let t1;
+	let input;
+	let input_name_value;
+	let input_value_value;
+	let mounted;
+	let dispose;
+
+	function change_handler(...args) {
+		return /*change_handler*/ ctx[10](/*i*/ ctx[14], /*dir*/ ctx[15], ...args);
+	}
+
+	return {
+		c() {
+			div = element("div");
+			label = element("label");
+			t0 = text(t0_value);
+			t1 = space();
+			input = element("input");
+			attr(label, "class", "BC-Arrow-Label svelte-5y4abu");
+			attr(label, "for", label_for_value = /*dir*/ ctx[15]);
+			attr(input, "type", "text");
+			attr(input, "size", "20");
+			attr(input, "name", input_name_value = /*dir*/ ctx[15]);
+			input.value = input_value_value = /*hier*/ ctx[12][/*dir*/ ctx[15]]?.join(", ") ?? "";
+		},
+		m(target, anchor) {
+			insert(target, div, anchor);
+			append(div, label);
+			append(label, t0);
+			append(div, t1);
+			append(div, input);
+
+			if (!mounted) {
+				dispose = listen(input, "change", change_handler);
+				mounted = true;
+			}
+		},
+		p(new_ctx, dirty) {
+			ctx = new_ctx;
+
+			if (dirty & /*currHiers*/ 1 && input_value_value !== (input_value_value = /*hier*/ ctx[12][/*dir*/ ctx[15]]?.join(", ") ?? "") && input.value !== input_value_value) {
+				input.value = input_value_value;
+			}
+		},
+		d(detaching) {
+			if (detaching) detach(div);
+			mounted = false;
+			dispose();
+		}
+	};
 }
 
-function addMatrixViewSettings(plugin, viewDetails) {
-    const { settings } = plugin;
-    const MLViewDetails = subDetails("Matrix/List View", viewDetails);
-    new obsidian.Setting(MLViewDetails)
-        .setName("Show Matrix or List view by default")
-        .setDesc("When Obsidian first loads, which view should it show? ✅ = Matrix, ❌ = List")
-        .addToggle((toggle) => toggle.setValue(settings.defaultView).onChange(async (value) => {
-        settings.defaultView = value;
-        await plugin.saveSettings();
-    }));
-    // TODO I don't think this setting works anymore. I removed it's functionality when adding multiple hierarchies
-    // new Setting(MLViewDetails)
-    //   .setName("Show all field names or just relation types")
-    //   .setDesc(
-    //     "This changes the headers in matrix/list view. You can have the headers be the list of metadata fields for each relation type (e.g. `parent, broader, upper`). Or you can have them just be the name of the relation type, i.e. 'Parent', 'Sibling', 'Child'. ✅ = show the full list of names."
-    //   )
-    //   .addToggle((toggle) =>
-    //     toggle.setValue(settings.showNameOrType).onChange(async (value) => {
-    //       settings.showNameOrType = value;
-    //       await plugin.saveSettings();
-    //       await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
-    //     })
-    //   );
-    new obsidian.Setting(MLViewDetails)
-        .setName("Show Relationship Type")
-        .setDesc(fragWithHTML("Show whether a link is real or implied. A real link is one you explicitly put in a note. E.g. <code>parent:: [[Note]]</code>. An implied link is the reverse of a real link. For example, if A is the real parent of B, then B must be the implied child of A."))
-        .addToggle((toggle) => toggle.setValue(settings.showRelationType).onChange(async (value) => {
-        settings.showRelationType = value;
-        await plugin.saveSettings();
-        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
-    }));
-    new obsidian.Setting(MLViewDetails)
-        .setName("Directions Order")
-        .setDesc(fragWithHTML(`Change the order in which the directions appear in the M/L view. Use numbers to change the order, the default is "up, same, down, next, prev" (<code>01234</code>).
-          <ul>
-            <li>0 = up</li>
-            <li>1 = same</li>
-            <li>2 = down</li>
-            <li>3 = next</li>
-            <li>4 = prev</li>
-          </ul>
-          <strong>Note:</strong> You can remove numbers to hide those directions in the Matrix View. For example, <code>02</code> will only show up and down, in that order.`))
-        .addText((text) => {
-        text.setValue(settings.squareDirectionsOrder.join(""));
-        text.inputEl.onblur = async () => {
-            const value = text.getValue();
-            const values = value.split("");
-            if (value.length <= 5 &&
-                values.every((value) => ["0", "1", "2", "3", "4"].includes(value))) {
-                settings.squareDirectionsOrder = values.map((order) => Number.parseInt(order));
-                await plugin.saveSettings();
-                await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
-            }
-            else {
-                new obsidian.Notice('The value must be a 5 digit number using only the digits "0", "1", "2", "3", "4"');
-            }
-        };
-    });
-    new obsidian.Setting(MLViewDetails)
-        .setName("Enable Alpahebtical Sorting")
-        .setDesc("By default, items in the Matrix view are sorted by the order they appear in your notes. Toggle this on to enable Alphabetical sorting. You can choose ascending/descending order in the setting below.")
-        .addToggle((toggle) => toggle.setValue(settings.enableAlphaSort).onChange(async (value) => {
-        settings.enableAlphaSort = value;
-        await plugin.saveSettings();
-        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
-    }));
-    // TODO hide this setting if !enableAlphaSort
-    new obsidian.Setting(MLViewDetails)
-        .setName("Sort Alphabetically Ascending/Descending")
-        .setDesc("Sort square items alphabetically in Ascending (✅) or Descending (❌) order, by default.")
-        .addToggle((toggle) => toggle.setValue(settings.alphaSortAsc).onChange(async (value) => {
-        settings.alphaSortAsc = value;
-        await plugin.saveSettings();
-        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
-    }));
-    new obsidian.Setting(MLViewDetails)
-        .setName("Sort by note name, but show alias")
-        .setDesc("When this is turned off, notes will first be sorted by their alias, and then by their name if no alias is found. Turn this on to sort by note name always, but still show the alias in the results.")
-        .addToggle((toggle) => toggle.setValue(settings.sortByNameShowAlias).onChange(async (value) => {
-        settings.sortByNameShowAlias = value;
-        await plugin.saveSettings();
-        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
-    }));
-    new obsidian.Setting(MLViewDetails)
-        .setName("Show Implied Relations")
-        .setDesc("Whether or not to show implied relations at all.")
-        .addToggle((toggle) => toggle.setValue(settings.showImpliedRelations).onChange(async (value) => {
-        settings.showImpliedRelations = value;
-        await plugin.saveSettings();
-        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
-    }));
-    new obsidian.Setting(MLViewDetails)
-        .setName("Filter Implied Siblings")
-        .setDesc(fragWithHTML(`Implied siblings are:
-          <ol>
-            <li>notes with the same parent, or</li>
-            <li>notes that are real siblings.</li>
-          </ol>
-          This setting only applies to type 1 implied siblings. If enabled, Breadcrumbs will filter type 1 implied siblings so that they not only share the same parent, but the parent relation has the exact same type. For example, the two real relations <code>B -parent-> A</code>, and <code>C -parent-> A</code> create an implied sibling between B and C (they have the same parent, A). The two real relations <code>B -parent-> A</code>, and <code>C -up-> A</code> create an implied sibling between B and C (they also have the same parent, A). But if this setting is turned on, the second implied sibling would not show, because the parent types are differnet (parent versus up).`))
-        .addToggle((toggle) => toggle
-        .setValue(settings.filterImpliedSiblingsOfDifferentTypes)
-        .onChange(async (value) => {
-        settings.filterImpliedSiblingsOfDifferentTypes = value;
-        await plugin.saveSettings();
-        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
-    }));
-    new obsidian.Setting(MLViewDetails)
-        .setName("Open View in Right or Left side")
-        .setDesc("When loading the matrix view, should it open on the left or right side leaf? ✅ = Right, ❌ = Left.")
-        .addToggle((toggle) => toggle.setValue(settings.rlLeaf).onChange(async (value) => {
-        settings.rlLeaf = value;
-        await plugin.saveSettings();
-        await this.app.workspace.detachLeavesOfType(MATRIX_VIEW);
-        await openView(this.app, MATRIX_VIEW, MatrixView, value ? "right" : "left");
-    }));
+// (62:2) {#each currHiers as hier, i}
+function create_each_block$6(ctx) {
+	let details;
+	let summary;
+	let t0_value = DIRECTIONS$1.map(func).map(func_1).join(" ") + "";
+	let t0;
+	let t1;
+	let span;
+	let button0;
+	let t3;
+	let button1;
+	let t5;
+	let button2;
+	let t7;
+	let t8;
+	let mounted;
+	let dispose;
+
+	function func(...args) {
+		return /*func*/ ctx[6](/*hier*/ ctx[12], ...args);
+	}
+
+	function click_handler_3() {
+		return /*click_handler_3*/ ctx[7](/*i*/ ctx[14]);
+	}
+
+	function click_handler_4() {
+		return /*click_handler_4*/ ctx[8](/*i*/ ctx[14]);
+	}
+
+	function click_handler_5() {
+		return /*click_handler_5*/ ctx[9](/*i*/ ctx[14]);
+	}
+
+	let each_value_1 = DIRECTIONS$1;
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value_1.length; i += 1) {
+		each_blocks[i] = create_each_block_1$5(get_each_context_1$5(ctx, each_value_1, i));
+	}
+
+	return {
+		c() {
+			details = element("details");
+			summary = element("summary");
+			t0 = text(t0_value);
+			t1 = space();
+			span = element("span");
+			button0 = element("button");
+			button0.textContent = "↑";
+			t3 = space();
+			button1 = element("button");
+			button1.textContent = "↓";
+			t5 = space();
+			button2 = element("button");
+			button2.textContent = "X";
+			t7 = space();
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			t8 = space();
+			attr(button0, "aria-label", "Swap with Hierarchy Above");
+			attr(button0, "class", "svelte-5y4abu");
+			attr(button1, "aria-label", "Swap with Hierarchy Below");
+			attr(button1, "class", "svelte-5y4abu");
+			attr(button2, "aria-label", "Remove Hierarchy");
+			attr(button2, "class", "svelte-5y4abu");
+			attr(span, "class", "GA-Buttons");
+			attr(summary, "class", "svelte-5y4abu");
+			attr(details, "class", "BC-Hier-Details svelte-5y4abu");
+		},
+		m(target, anchor) {
+			insert(target, details, anchor);
+			append(details, summary);
+			append(summary, t0);
+			append(summary, t1);
+			append(summary, span);
+			append(span, button0);
+			append(span, t3);
+			append(span, button1);
+			append(span, t5);
+			append(span, button2);
+			append(details, t7);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(details, null);
+			}
+
+			append(details, t8);
+
+			if (!mounted) {
+				dispose = [
+					listen(button0, "click", click_handler_3),
+					listen(button1, "click", click_handler_4),
+					listen(button2, "click", click_handler_5)
+				];
+
+				mounted = true;
+			}
+		},
+		p(new_ctx, dirty) {
+			ctx = new_ctx;
+			if (dirty & /*currHiers*/ 1 && t0_value !== (t0_value = DIRECTIONS$1.map(func).map(func_1).join(" ") + "")) set_data(t0, t0_value);
+
+			if (dirty & /*DIRECTIONS, currHiers, splitAndTrim, update, ARROW_DIRECTIONS*/ 3) {
+				each_value_1 = DIRECTIONS$1;
+				let i;
+
+				for (i = 0; i < each_value_1.length; i += 1) {
+					const child_ctx = get_each_context_1$5(ctx, each_value_1, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block_1$5(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(details, t8);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value_1.length;
+			}
+		},
+		d(detaching) {
+			if (detaching) detach(details);
+			destroy_each(each_blocks, detaching);
+			mounted = false;
+			run_all(dispose);
+		}
+	};
 }
 
-function addNoSystemSettings(plugin, alternativeHierarchyDetails) {
-    const { settings } = plugin;
-    const { userHiers } = settings;
-    const fields = getFields(userHiers);
-    const noSystemDetails = subDetails("Naming System", alternativeHierarchyDetails);
-    new obsidian.Setting(noSystemDetails)
-        .setName("Naming System Regex")
-        .setDesc(fragWithHTML("If you name your notes using the Johnny Decimal System or a related system, enter a regular expression matching the longest possible naming system you use. The regex should only match the naming system part of the name, not the actual note title.</br> For example, if you use the Johnny Decimal System, you might use <code>/^\\d\\.\\d\\.\\w/g</code> to match the note named <code>1.2.a Cars</code>.</br>If you don't want to choose a default, select the blank option at the bottom of the list."))
-        .addText((text) => {
-        text.setValue(settings.namingSystemRegex);
-        text.inputEl.onblur = async () => {
-            const value = text.getValue();
-            if (value === "" || strToRegex(value)) {
-                settings.namingSystemRegex = value;
-                await plugin.saveSettings();
-                await refreshIndex(plugin);
-            }
-            else {
-                new obsidian.Notice("Invalid Regex");
-            }
-        };
-    });
-    new obsidian.Setting(noSystemDetails)
-        .setName("Naming System Delimiter")
-        .setDesc(fragWithHTML("What character do you use to split up your naming convention? For example, if you use <code>1.2.a.b</code>, then your delimiter is a period (<code>.</code>)."))
-        .addText((text) => {
-        text.setValue(settings.namingSystemSplit);
-        text.inputEl.onblur = async () => {
-            const value = text.getValue();
-            settings.namingSystemSplit = value;
-            await plugin.saveSettings();
-            await refreshIndex(plugin);
-        };
-    });
-    new obsidian.Setting(noSystemDetails)
-        .setName("Naming System Field")
-        .setDesc("Which field should Breadcrumbs use for Naming System notes?")
-        .addDropdown((dd) => {
-        fields.forEach((field) => {
-            dd.addOption(field, field);
-        });
-        dd.setValue(settings.namingSystemField);
-        dd.onChange(async (value) => {
-            settings.namingSystemField = value;
-            await plugin.saveSettings();
-            await refreshIndex(plugin);
-        });
-    });
-    new obsidian.Setting(noSystemDetails)
-        .setName("Naming System Ends with Delimiter")
-        .setDesc(fragWithHTML("Does your naming convention end with the delimiter? For example, <code>1.2. Note</code> does end with the delimiter, but <code>1.2 Note</code> does not.</br>For matching purposes, it is highly recommended to name your notes with the delimiter on the end. Only turn this setting on if you do name your notes this way, but know that the results may not be as accurate if you don't."))
-        .addToggle((tog) => tog
-        .setValue(settings.namingSystemEndsWithDelimiter)
-        .onChange(async (value) => {
-        settings.namingSystemEndsWithDelimiter = value;
-        await plugin.saveSettings();
-        await refreshIndex(plugin);
-    }));
-}
+function create_fragment$9(ctx) {
+	let div4;
+	let div3;
+	let button0;
+	let div0;
+	let faplus;
+	let t0;
+	let button1;
+	let div1;
+	let faregtrashalt;
+	let t1;
+	let button2;
+	let div2;
+	let falistul;
+	let t2;
+	let current;
+	let mounted;
+	let dispose;
+	faplus = new FaPlus({});
+	faregtrashalt = new FaRegTrashAlt({});
+	falistul = new FaListUl({});
+	let each_value = /*currHiers*/ ctx[0];
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value.length; i += 1) {
+		each_blocks[i] = create_each_block$6(get_each_context$6(ctx, each_value, i));
+	}
+
+	return {
+		c() {
+			div4 = element("div");
+			div3 = element("div");
+			button0 = element("button");
+			div0 = element("div");
+			create_component(faplus.$$.fragment);
+			t0 = space();
+			button1 = element("button");
+			div1 = element("div");
+			create_component(faregtrashalt.$$.fragment);
+			t1 = space();
+			button2 = element("button");
+			div2 = element("div");
+			create_component(falistul.$$.fragment);
+			t2 = space();
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			attr(div0, "class", "icon svelte-5y4abu");
+			attr(button0, "aria-label", "Add New Hierarchy");
+			attr(div1, "class", "icon svelte-5y4abu");
+			attr(button1, "aria-label", "Reset All Hierarchies");
+			attr(div2, "class", "icon svelte-5y4abu");
+			attr(button2, "aria-label", "Show Hierarchies");
+			attr(div3, "class", "GA-Buttons svelte-5y4abu");
+		},
+		m(target, anchor) {
+			insert(target, div4, anchor);
+			append(div4, div3);
+			append(div3, button0);
+			append(button0, div0);
+			mount_component(faplus, div0, null);
+			append(div3, t0);
+			append(div3, button1);
+			append(button1, div1);
+			mount_component(faregtrashalt, div1, null);
+			append(div3, t1);
+			append(div3, button2);
+			append(button2, div2);
+			mount_component(falistul, div2, null);
+			append(div4, t2);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(div4, null);
+			}
+
+			current = true;
+
+			if (!mounted) {
+				dispose = [
+					listen(button0, "click", /*click_handler*/ ctx[3]),
+					listen(button1, "click", /*click_handler_1*/ ctx[4]),
+					listen(button2, "click", /*click_handler_2*/ ctx[5])
+				];
+
+				mounted = true;
+			}
+		},
+		p(ctx, [dirty]) {
+			if (dirty & /*DIRECTIONS, currHiers, splitAndTrim, update, ARROW_DIRECTIONS, swapItems*/ 3) {
+				each_value = /*currHiers*/ ctx[0];
+				let i;
 
-function addRegexNoteSettings(plugin, alternativeHierarchyDetails) {
-    const { settings } = plugin;
-    const regexNoteDetails = subDetails("Regex Notes", alternativeHierarchyDetails);
-    new obsidian.Setting(regexNoteDetails)
-        .setName("Default Regex Note Field")
-        .setDesc(fragWithHTML("By default, regex notes use the first field in your hierarchies (usually an <code>↑</code> field). Choose a different one to use by default, without having to specify <code>BC-regex-note-field: {field}</code>.</br>If you don't want to choose a default, select the blank option at the bottom of the list."))
-        .addDropdown((dd) => {
-        const options = {};
-        getFields(settings.userHiers).forEach((field) => (options[field] = field));
-        dd.addOptions(Object.assign(options, { "": "" }));
-        dd.onChange(async (field) => {
-            settings.regexNoteField = field;
-            await plugin.saveSettings();
-            await refreshIndex(plugin);
-        });
-    });
+				for (i = 0; i < each_value.length; i += 1) {
+					const child_ctx = get_each_context$6(ctx, each_value, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block$6(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(div4, null);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value.length;
+			}
+		},
+		i(local) {
+			if (current) return;
+			transition_in(faplus.$$.fragment, local);
+			transition_in(faregtrashalt.$$.fragment, local);
+			transition_in(falistul.$$.fragment, local);
+			current = true;
+		},
+		o(local) {
+			transition_out(faplus.$$.fragment, local);
+			transition_out(faregtrashalt.$$.fragment, local);
+			transition_out(falistul.$$.fragment, local);
+			current = false;
+		},
+		d(detaching) {
+			if (detaching) detach(div4);
+			destroy_component(faplus);
+			destroy_component(faregtrashalt);
+			destroy_component(falistul);
+			destroy_each(each_blocks, detaching);
+			mounted = false;
+			run_all(dispose);
+		}
+	};
 }
 
-function addRelationSettings(plugin, containerEl) {
-    const { settings } = plugin;
-    const relationDetails = details("Relationships", containerEl);
-    // MarkdownRenderer.renderMarkdown(
-    //   "```mermaid\nflowchart BT\nMe -->|up| Dad\nDad -->|same| Aunt\nMe -->|up| Aunt\n```",
-    //   containerEl,
-    //   "",
-    //   null
-    // );
-    relationDetails.createEl("p", {
-        text: "Here you can toggle on/off different ypes of implied relationships. All of your explicit (real) relationships will still show, but you can choose which implied ones get filled in.\nAll implied relationships are given a CSS class of the type of implied relaiton, so you can style the differently. For example `.BC-Aunt`.",
-    });
-    new obsidian.Setting(relationDetails)
-        .setName("Same Parent is Siblings")
-        .setDesc("If one note shares a parent with another, treat them as siblings")
-        .addToggle((tg) => tg
-        .setValue(settings.impliedRelations.sameParentIsSibling)
-        .onChange(async (val) => {
-        settings.impliedRelations.sameParentIsSibling = val;
-        await plugin.saveSettings();
-        await refreshIndex(plugin);
-    }));
-    new obsidian.Setting(relationDetails)
-        .setName("Siblings' Siblings")
-        .setDesc("Treat your siblings' siblings as your siblings")
-        .addToggle((tg) => tg
-        .setValue(settings.impliedRelations.siblingsSiblingIsSibling)
-        .onChange(async (val) => {
-        settings.impliedRelations.siblingsSiblingIsSibling = val;
-        await plugin.saveSettings();
-        await refreshIndex(plugin);
-    }));
-    new obsidian.Setting(relationDetails)
-        .setName("Aunt/Uncle")
-        .setDesc("Treat your parent's siblings as your parents (aunts/uncles)")
-        .addToggle((tg) => tg
-        .setValue(settings.impliedRelations.parentsSiblingsIsParents)
-        .onChange(async (val) => {
-        settings.impliedRelations.parentsSiblingsIsParents = val;
-        await plugin.saveSettings();
-        await refreshIndex(plugin);
-    }));
-    new obsidian.Setting(relationDetails)
-        .setName("Cousins")
-        .setDesc("Treat the cousins of a note as siblings (parents' siblings' children are cousins)")
-        .addToggle((tg) => tg
-        .setValue(settings.impliedRelations.cousinsIsSibling)
-        .onChange(async (val) => {
-        settings.impliedRelations.cousinsIsSibling = val;
-        await plugin.saveSettings();
-        await refreshIndex(plugin);
-    }));
-    new obsidian.Setting(relationDetails)
-        .setName("Make Current Note an Implied Sibling")
-        .setDesc("Techincally, the current note is always it's own implied sibling. By default, it is not show as such. Toggle this on to make it show.")
-        .addToggle((toggle) => toggle
-        .setValue(settings.treatCurrNodeAsImpliedSibling)
-        .onChange(async (value) => {
-        settings.treatCurrNodeAsImpliedSibling = value;
-        await plugin.saveSettings();
-        await refreshIndex(plugin);
-    }));
+const func_1 = dirFields => `(${dirFields})`;
+
+function instance$9($$self, $$props, $$invalidate) {
+	var __awaiter = this && this.__awaiter || function (thisArg, _arguments, P, generator) {
+		function adopt(value) {
+			return value instanceof P
+			? value
+			: new P(function (resolve) {
+						resolve(value);
+					});
+		}
+
+		return new (P || (P = Promise))(function (resolve, reject) {
+				function fulfilled(value) {
+					try {
+						step(generator.next(value));
+					} catch(e) {
+						reject(e);
+					}
+				}
+
+				function rejected(value) {
+					try {
+						step(generator["throw"](value));
+					} catch(e) {
+						reject(e);
+					}
+				}
+
+				function step(result) {
+					result.done
+					? resolve(result.value)
+					: adopt(result.value).then(fulfilled, rejected);
+				}
+
+				step((generator = generator.apply(thisArg, _arguments || [])).next());
+			});
+	};
+
+	
+	
+	let { plugin } = $$props;
+	let currHiers = [...plugin.settings.userHiers];
+
+	function update(currHiers) {
+		return __awaiter(this, void 0, void 0, function* () {
+			$$invalidate(2, plugin.settings.userHiers = currHiers, plugin);
+			yield plugin.saveSettings();
+		});
+	}
+
+	const click_handler = async () => $$invalidate(0, currHiers = [...currHiers, blankUserHier()]);
+
+	const click_handler_1 = async () => {
+		if (window.confirm("Are you sure you want to reset all hierarchies?")) {
+			$$invalidate(0, currHiers = []);
+			await update(currHiers);
+		}
+	};
+
+	const click_handler_2 = () => new obsidian.Notice(currHiers.map(hierToStr).join("\n\n"));
+	const func = (hier, dir) => hier[dir]?.join(", ") ?? "";
+
+	const click_handler_3 = async i => {
+		$$invalidate(0, currHiers = swapItems(i, i - 1, currHiers));
+		await update(currHiers);
+	};
+
+	const click_handler_4 = async i => {
+		$$invalidate(0, currHiers = swapItems(i, i + 1, currHiers));
+		await update(currHiers);
+	};
+
+	const click_handler_5 = async i => {
+		currHiers.splice(i, 1);
+		$$invalidate(0, currHiers);
+		await update(currHiers);
+	};
+
+	const change_handler = async (i, dir, e) => {
+		const { value } = e.target;
+		$$invalidate(0, currHiers[i][dir] = splitAndTrim(value), currHiers);
+		await update(currHiers);
+	};
+
+	$$self.$$set = $$props => {
+		if ("plugin" in $$props) $$invalidate(2, plugin = $$props.plugin);
+	};
+
+	return [
+		currHiers,
+		update,
+		plugin,
+		click_handler,
+		click_handler_1,
+		click_handler_2,
+		func,
+		click_handler_3,
+		click_handler_4,
+		click_handler_5,
+		change_handler
+	];
 }
 
-function addTagNoteSettings(plugin, alternativeHierarchyDetails) {
-    const { settings } = plugin;
-    const tagNoteDetails = subDetails("Tag Notes", alternativeHierarchyDetails);
-    new obsidian.Setting(tagNoteDetails)
-        .setName("Default Tag Note Field")
-        .setDesc(fragWithHTML("By default, tag notes use the first field in your hierarchies (usually an <code>↑</code> field). Choose a different one to use by default, without having to specify <code>BC-tag-note-field: {field}</code>.</br>If you don't want to choose a default, select the blank option at the bottom of the list."))
-        .addDropdown((dd) => {
-        const options = {};
-        getFields(settings.userHiers).forEach((field) => (options[field] = field));
-        dd.addOptions(Object.assign(options, { "": "" }));
-        dd.onChange(async (field) => {
-            settings.tagNoteField = field;
-            await plugin.saveSettings();
-            await refreshIndex(plugin);
-        });
-    });
+class UserHierarchies extends SvelteComponent {
+	constructor(options) {
+		super();
+		if (!document.getElementById("svelte-5y4abu-style")) add_css$5();
+		init(this, options, instance$9, create_fragment$9, safe_not_equal, { plugin: 2 });
+	}
 }
 
-function addThreadingSettings(plugin, cmdsDetails) {
-    const { settings } = plugin;
-    const threadingDetails = subDetails("Threading", cmdsDetails);
-    threadingDetails.createDiv({
-        text: "Settings for the commands `Create new <field> from current note`",
+function addHierarchySettings(plugin, containerEl) {
+    const fieldDetails = details("Hierarchies", containerEl);
+    fieldDetails.createEl("p", {
+        text: "Here you can set up different hierarchies you use in your vault. To add a new hierarchy, click the plus button. Then, fill in the field names of your hierachy into the 3 boxes that appear. The ↑ field is for parent relations, the → field is for siblings, and ↓ is for child relations.",
     });
-    new obsidian.Setting(threadingDetails)
-        .setName("Open new threads in new pane or current pane")
-        .addToggle((tog) => tog.onChange(async (value) => {
-        settings.threadIntoNewPane = value;
-        await plugin.saveSettings();
-    }));
-    new obsidian.Setting(threadingDetails)
-        .setName("New Note Name Template")
-        .setDesc(fragWithHTML(`When threading into a new note, choose the template for the new note name.</br>
-        The default is <code>{{field}} of {{current}}</code>.</br>
-        Options include:</br>
-        <ul>
-        <li><code>{{field}}</code>: the field being thread into</li>
-        <li><code>{{dir}}</code>: the direction being thread into</li>
-        <li><code>{{current}}</code>: the current note name</li>
-        <li><code>{{date}}</code>: the current date (Set the format in the setting below)</li>
-        </ul>`))
-        .addText((text) => {
-        text.setValue(settings.threadingTemplate);
-        text.inputEl.onblur = async () => {
-            settings.threadingTemplate = text.getValue();
-            await plugin.saveSettings();
-        };
+    fieldDetails.createEl("p", {
+        text: "For each direction (up, same, down), you can enter multiple field names in a comma seperated list. For example: `parent, broader, upper`",
     });
-    const threadDirTemplatesSetting = new obsidian.Setting(threadingDetails)
-        .setClass("thread-dir-templates")
-        .setName("Templater Template per Direction")
-        .setDesc(fragWithHTML(`For each direction to be thread into, choose a Templater template to insert into the new note.</br>
-          Give the basename, or the full file path (e.g. <code>Templates/Parent Template</code>).`));
-    DIRECTIONS$1.forEach((dir) => threadDirTemplatesSetting.addText((text) => {
-        text
-            .setPlaceholder(ARROW_DIRECTIONS[dir])
-            .setValue(settings.threadingDirTemplates[dir]);
-        text.inputEl.onblur = async () => {
-            settings.threadingDirTemplates[dir] = text.getValue();
-            await plugin.saveSettings();
-        };
-    }));
-    new obsidian.Setting(threadingDetails)
-        .setName("Date Format")
-        .setDesc("The date format used in the Threading Template (setting above)")
-        .addMomentFormat((format) => {
-        format
-            .setDefaultFormat(DEFAULT_SETTINGS.dateFormat)
-            .setValue(settings.dateFormat)
-            .onChange(async (value) => {
-            settings.dateFormat = value;
-            await plugin.saveSettings();
-        });
+    new UserHierarchies({
+        target: fieldDetails,
+        props: { plugin },
     });
 }
 
-function addTrailViewSettings(plugin, viewDetails) {
-    const { settings, app } = plugin;
-    const trailDetails = subDetails("Trail/Grid/Juggl", viewDetails);
-    new obsidian.Setting(trailDetails)
-        .setName("Show Breadcrumbs")
-        .setDesc("Show a set of different views at the top of the current note.")
-        .addToggle((toggle) => toggle.setValue(settings.showBCs).onChange(async (value) => {
-        settings.showBCs = value;
-        await plugin.saveSettings();
-        await drawTrail(plugin);
-    }));
-    new obsidian.Setting(trailDetails)
-        .setName("Show Breadcrumbs in Edit/Live-Preview Mode")
-        .setDesc("It always shows in preview mode, but should it also show in the other two?\n\nKeep in mind that there is currently a limitation where the Breadcrumbs view will be stuck to the top of the note in edit/LP mode, even if you scroll down.")
-        .addToggle((toggle) => toggle.setValue(settings.showBCsInEditLPMode).onChange(async (value) => {
-        settings.showBCsInEditLPMode = value;
-        await plugin.saveSettings();
-        await drawTrail(plugin);
-    }));
-    const limitTrailFieldsDiv = trailDetails.createDiv({
-        cls: "limit-ML-fields",
-    });
-    limitTrailFieldsDiv.createEl("strong", {
-        text: "Limit Trail View to only show certain fields",
-    });
-    new Checkboxes({
-        target: trailDetails,
-        props: {
-            plugin,
-            settingName: "limitTrailCheckboxes",
-            options: getFields(settings.userHiers, "up"),
-        },
-    });
-    new obsidian.Setting(trailDetails)
-        .setName("Views to show")
-        .setDesc("Choose which of the views to show at the top of the note.\nTrail, Grid, Juggl graph and/or the Next-Previous view. " +
-        "Juggl requires having the Juggl plugin installed.")
-        .addToggle((toggle) => {
-        toggle
-            .setTooltip("Show Trail view")
-            .setValue(settings.showTrail)
-            .onChange(async (value) => {
-            settings.showTrail = value;
-            await plugin.saveSettings();
-            await drawTrail(plugin);
-        });
-    })
-        .addToggle((toggle) => {
-        toggle
-            .setTooltip("Show Grid view")
-            .setValue(settings.showGrid)
-            .onChange(async (value) => {
-            settings.showGrid = value;
-            await plugin.saveSettings();
-            await drawTrail(plugin);
-        });
-    })
-        .addToggle((toggle) => {
-        toggle
-            .setTooltip("Show Juggl view")
-            .setValue(settings.showJuggl)
-            .onChange(async (value) => {
-            settings.showJuggl = value;
-            await plugin.saveSettings();
-            await drawTrail(plugin);
-        });
-    })
-        .addToggle((toggle) => {
-        toggle
-            .setTooltip("Show Next/Previous view")
-            .setValue(settings.showPrevNext)
-            .onChange(async (value) => {
-            settings.showPrevNext = value;
-            await plugin.saveSettings();
-            await drawTrail(plugin);
-        });
-    });
-    new obsidian.Setting(trailDetails)
-        .setName("Grid view dots")
-        .setDesc("If the grid view is visible, shows dots based on the file size of each cell.")
-        .addToggle((toggle) => toggle.setValue(settings.gridDots).onChange(async (value) => {
-        settings.gridDots = value;
-        await plugin.saveSettings();
-        await drawTrail(plugin);
-    }));
-    const dotsColour = trailDetails.createDiv();
-    dotsColour.createEl("h4", {
-        text: "Dots colour",
-    });
-    const dotsColourPicker = dotsColour.createEl("input", {
-        type: "color",
-    });
-    dotsColourPicker.value = settings.dotsColour;
-    dotsColourPicker.addEventListener("change", async () => {
-        settings.dotsColour = dotsColourPicker.value;
-        await plugin.saveSettings();
-    });
-    new obsidian.Setting(trailDetails)
-        .setName("Grid view heatmap")
-        .setDesc("If the grid view is visible, change the background colour of squares based on the number of children leaving that note.")
-        .addToggle((toggle) => toggle.setValue(settings.gridHeatmap).onChange(async (value) => {
-        settings.gridHeatmap = value;
-        await plugin.saveSettings();
-        await drawTrail(plugin);
-    }));
-    const heatmapColour = trailDetails.createDiv();
-    heatmapColour.createEl("h4", {
-        text: "Heat map colour",
-    });
-    const heatmapColourPicker = heatmapColour.createEl("input", {
-        type: "color",
-    });
-    heatmapColourPicker.value = settings.heatmapColour;
-    heatmapColourPicker.addEventListener("change", async () => {
-        settings.heatmapColour = heatmapColourPicker.value;
-        await plugin.saveSettings();
-    });
-    new obsidian.Setting(trailDetails)
-        .setName("Index Note(s)")
-        .setDesc(fragWithHTML("The note that all of your other notes lead back to. The parent of all your parent notes. Just enter the basename. So if your index note is <code>000 Home.md</code>, enter <code>000 Home</code>. You can also have multiple index notes (comma-separated list). The breadcrumb trail will show the shortest path back to any one of the index notes listed. You can now leave this field empty, meaning the trail will show a path going as far up the parent-tree as possible."))
-        .addText((text) => {
-        text
-            .setPlaceholder("Index Note")
-            .setValue(settings.indexNotes.join(", "));
-        text.inputEl.onblur = async () => {
-            const splits = splitAndTrim(text.getValue());
-            if (splits[0] === undefined ||
-                splits.every((index) => isInVault(app, index))) {
-                settings.indexNotes = splits;
-                await plugin.saveSettings();
-            }
-            else {
-                new obsidian.Notice(`Atleast one of the notes is not in your vault`);
-            }
-        };
-    });
-    new obsidian.Setting(trailDetails)
-        .setName("Shows all paths if none to index note are found")
-        .setDesc("If you have an index notes chosen, but the trail view has no paths going up to those index notes, should it show all paths instead?")
-        .addToggle((toggle) => toggle
-        .setValue(settings.showAllPathsIfNoneToIndexNote)
-        .onChange(async (value) => {
-        settings.showAllPathsIfNoneToIndexNote = value;
-        await plugin.saveSettings();
-        await drawTrail(plugin);
-    }));
-    new obsidian.Setting(trailDetails)
-        .setName("Default: All or Shortest")
-        .setDesc("If multiple paths are found going up the parent tree, should all of them be shown by default, or only the shortest? ✅ = all, ❌ = shortest")
-        .addToggle((toggle) => toggle.setValue(settings.showAll).onChange(async (value) => {
-        settings.showAll = value;
-        await plugin.saveSettings();
-        await drawTrail(plugin);
-    }));
-    new obsidian.Setting(trailDetails)
-        .setName("Breadcrumb trail seperator")
-        .setDesc("The character to show between crumbs in the breadcrumb trail. The default is '→'")
-        .addText((text) => text
-        .setPlaceholder("→")
-        .setValue(settings.trailSeperator)
-        .onChange(async (value) => {
-        settings.trailSeperator = value;
-        await plugin.saveSettings();
-        await drawTrail(plugin);
-    }));
-    new obsidian.Setting(trailDetails)
-        .setName("No path found message")
-        .setDesc("The text to display when no path to the index note was found, or when the current note has no parent (this happens if you haven't chosen an index note)")
-        .addText((text) => text
-        .setPlaceholder(`No path to index note was found`)
-        .setValue(settings.noPathMessage)
-        .onChange(async (value) => {
-        settings.noPathMessage = value;
-        await plugin.saveSettings();
-        await drawTrail(plugin);
-    }));
-    new obsidian.Setting(trailDetails)
-        .setName("Respect Readable Line Length")
-        .setDesc("Should the breadcrumbs trail adjust its width to the readable line length, or use as much space as possible? ✅ = use readable line length.")
-        .addToggle((toggle) => toggle
-        .setValue(settings.respectReadableLineLength)
-        .onChange(async (value) => {
-        settings.respectReadableLineLength = value;
-        await plugin.saveSettings();
-        await drawTrail(plugin);
-    }));
+/* src\Components\Lists.svelte generated by Svelte v3.35.0 */
+
+function add_css$4() {
+	var style = element("style");
+	style.id = "svelte-1dlhare-style";
+	style.textContent = "summary.hier-summary.svelte-1dlhare{color:var(--text-title-h2);font-size:larger}summary.svelte-1dlhare{color:var(--text-title-h3)}h5.BC-header.svelte-1dlhare{color:var(--text-title-h5)}.markdown-preview-view.svelte-1dlhare{padding-left:10px}.internal-link.is-unresolved.svelte-1dlhare{color:var(--text-muted)}";
+	append(document.head, style);
+}
+
+function get_each_context$5(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[13] = list[i];
+	return child_ctx;
+}
+
+function get_each_context_1$4(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[16] = list[i];
+	return child_ctx;
+}
+
+function get_each_context_2$2(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[19] = list[i];
+	return child_ctx;
+}
+
+function get_each_context_3$2(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[22] = list[i];
+	return child_ctx;
+}
+
+// (26:8) {#if square.realItems.length || (showImpliedRelations && square.impliedItems.length)}
+function create_if_block$2(ctx) {
+	let details;
+	let summary;
+	let t0_value = /*square*/ ctx[16].field + "";
+	let t0;
+	let t1;
+	let t2;
+	let if_block0 = /*square*/ ctx[16].realItems.length && create_if_block_3$1(ctx);
+	let if_block1 = /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length && create_if_block_1$2(ctx);
+
+	return {
+		c() {
+			details = element("details");
+			summary = element("summary");
+			t0 = text(t0_value);
+			t1 = space();
+			if (if_block0) if_block0.c();
+			t2 = space();
+			if (if_block1) if_block1.c();
+			attr(summary, "class", "svelte-1dlhare");
+			details.open = true;
+			attr(details, "class", "BC-details");
+		},
+		m(target, anchor) {
+			insert(target, details, anchor);
+			append(details, summary);
+			append(summary, t0);
+			append(details, t1);
+			if (if_block0) if_block0.m(details, null);
+			append(details, t2);
+			if (if_block1) if_block1.m(details, null);
+		},
+		p(ctx, dirty) {
+			if (dirty & /*filteredSquaresArr*/ 1 && t0_value !== (t0_value = /*square*/ ctx[16].field + "")) set_data(t0, t0_value);
+
+			if (/*square*/ ctx[16].realItems.length) {
+				if (if_block0) {
+					if_block0.p(ctx, dirty);
+				} else {
+					if_block0 = create_if_block_3$1(ctx);
+					if_block0.c();
+					if_block0.m(details, t2);
+				}
+			} else if (if_block0) {
+				if_block0.d(1);
+				if_block0 = null;
+			}
+
+			if (/*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) {
+				if (if_block1) {
+					if_block1.p(ctx, dirty);
+				} else {
+					if_block1 = create_if_block_1$2(ctx);
+					if_block1.c();
+					if_block1.m(details, null);
+				}
+			} else if (if_block1) {
+				if_block1.d(1);
+				if_block1 = null;
+			}
+		},
+		d(detaching) {
+			if (detaching) detach(details);
+			if (if_block0) if_block0.d();
+			if (if_block1) if_block1.d();
+		}
+	};
+}
+
+// (29:12) {#if square.realItems.length}
+function create_if_block_3$1(ctx) {
+	let t;
+	let ol;
+	let if_block = /*showRelationType*/ ctx[8] && create_if_block_4$1();
+	let each_value_3 = /*square*/ ctx[16].realItems;
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value_3.length; i += 1) {
+		each_blocks[i] = create_each_block_3$2(get_each_context_3$2(ctx, each_value_3, i));
+	}
+
+	return {
+		c() {
+			if (if_block) if_block.c();
+			t = space();
+			ol = element("ol");
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+		},
+		m(target, anchor) {
+			if (if_block) if_block.m(target, anchor);
+			insert(target, t, anchor);
+			insert(target, ol, anchor);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(ol, null);
+			}
+		},
+		p(ctx, dirty) {
+			if (dirty & /*filteredSquaresArr, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings*/ 29) {
+				each_value_3 = /*square*/ ctx[16].realItems;
+				let i;
+
+				for (i = 0; i < each_value_3.length; i += 1) {
+					const child_ctx = get_each_context_3$2(ctx, each_value_3, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block_3$2(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(ol, null);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value_3.length;
+			}
+		},
+		d(detaching) {
+			if (if_block) if_block.d(detaching);
+			if (detaching) detach(t);
+			if (detaching) detach(ol);
+			destroy_each(each_blocks, detaching);
+		}
+	};
+}
+
+// (30:14) {#if showRelationType}
+function create_if_block_4$1(ctx) {
+	let h5;
+
+	return {
+		c() {
+			h5 = element("h5");
+			h5.textContent = "Real";
+			attr(h5, "class", "BC-header svelte-1dlhare");
+		},
+		m(target, anchor) {
+			insert(target, h5, anchor);
+		},
+		d(detaching) {
+			if (detaching) detach(h5);
+		}
+	};
 }
 
-function addTreeViewSettings(plugin, viewDetails) {
-    const { settings } = plugin;
-    const treeViewDetails = subDetails("Tree View", viewDetails);
-    new obsidian.Setting(treeViewDetails)
-        .setName("Enable line wrapping")
-        .setDesc("Make the items in the tree view line wrap when there isn't enough space (✅). ❌ makes them overflow off the screen.")
-        .addToggle((toggle) => toggle.setValue(settings.downViewWrap).onChange(async (value) => {
-        settings.downViewWrap = value;
-        await plugin.saveSettings();
-    }));
-}
+// (35:16) {#each square.realItems as realItem}
+function create_each_block_3$2(ctx) {
+	let li;
+	let div;
+	let t0_value = (/*realItem*/ ctx[22].alt ?? dropPathNDendron(/*realItem*/ ctx[22].to, /*settings*/ ctx[2])) + "";
+	let t0;
+	let div_class_value;
+	let t1;
+	let mounted;
+	let dispose;
+
+	function click_handler(...args) {
+		return /*click_handler*/ ctx[9](/*realItem*/ ctx[22], ...args);
+	}
+
+	function mouseover_handler(...args) {
+		return /*mouseover_handler*/ ctx[10](/*realItem*/ ctx[22], ...args);
+	}
+
+	return {
+		c() {
+			li = element("li");
+			div = element("div");
+			t0 = text(t0_value);
+			t1 = space();
+			attr(div, "class", div_class_value = "" + (/*realItem*/ ctx[22].cls + " " + (/*realItem*/ ctx[22].implied ?? "") + " svelte-1dlhare"));
+		},
+		m(target, anchor) {
+			insert(target, li, anchor);
+			append(li, div);
+			append(div, t0);
+			append(li, t1);
+
+			if (!mounted) {
+				dispose = [
+					listen(div, "click", click_handler),
+					listen(div, "mouseover", mouseover_handler)
+				];
 
-function addVisModalSettings(plugin, viewDetails) {
-    const { settings } = plugin;
-    const visModalDetails = subDetails("Visualisation Modal", viewDetails);
-    new obsidian.Setting(visModalDetails)
-        .setName("Default Visualisation Type")
-        .setDesc("Which visualisation to show by defualt")
-        .addDropdown((cb) => {
-        VISTYPES.forEach((option) => {
-            cb.addOption(option, option);
-        });
-        cb.setValue(settings.visGraph);
-        cb.onChange(async (value) => {
-            settings.visGraph = value;
-            await plugin.saveSettings();
-        });
-    });
-    new obsidian.Setting(visModalDetails)
-        .setName("Default Relation")
-        .setDesc("Which relation type to show first when opening the modal")
-        .addDropdown((dd) => {
-        RELATIONS.forEach((option) => {
-            dd.addOption(option, option);
-        });
-        dd.setValue(settings.visRelation);
-        dd.onChange(async (value) => {
-            settings.visRelation = value;
-            await plugin.saveSettings();
-        });
-    });
-    new obsidian.Setting(visModalDetails)
-        .setName("Default Real/Closed")
-        .setDesc("Show the real or closed graph by default")
-        .addDropdown((cb) => {
-        REAlCLOSED.forEach((option) => {
-            cb.addOption(option, option);
-        });
-        cb.setValue(settings.visClosed);
-        cb.onChange(async (value) => {
-            settings.visClosed = value;
-            await plugin.saveSettings();
-        });
-    });
-    new obsidian.Setting(visModalDetails)
-        .setName("Default Unlinked")
-        .setDesc("Show all nodes or only those which have links by default")
-        .addDropdown((cb) => {
-        ALLUNLINKED.forEach((option) => {
-            cb.addOption(option, option);
-        });
-        cb.setValue(settings.visAll);
-        cb.onChange(async (value) => {
-            settings.visAll = value;
-            await plugin.saveSettings();
-        });
-    });
-}
+				mounted = true;
+			}
+		},
+		p(new_ctx, dirty) {
+			ctx = new_ctx;
+			if (dirty & /*filteredSquaresArr, settings*/ 5 && t0_value !== (t0_value = (/*realItem*/ ctx[22].alt ?? dropPathNDendron(/*realItem*/ ctx[22].to, /*settings*/ ctx[2])) + "")) set_data(t0, t0_value);
 
-function addWriteBCsSettings(plugin, cmdsDetails) {
-    const { settings } = plugin;
-    const writeBCsToFileDetails = subDetails("Write Breadcrumbs to File", cmdsDetails);
-    const limitWriteBCDiv = writeBCsToFileDetails.createDiv({
-        cls: "limit-ML-fields",
-    });
-    limitWriteBCDiv.createEl("strong", {
-        text: "Limit to only write certain fields to files",
-    });
-    new Checkboxes({
-        target: writeBCsToFileDetails,
-        props: {
-            plugin,
-            options: getFields(settings.userHiers),
-            settingName: "limitWriteBCCheckboxes",
-        },
-    });
-    new obsidian.Setting(writeBCsToFileDetails)
-        .setName("Write BCs to file Inline")
-        .setDesc("When writing BCs to file, should they be written inline (using Dataview syntax), or into the YAML of the note?")
-        .addToggle((toggle) => toggle.setValue(settings.writeBCsInline).onChange(async (value) => {
-        settings.writeBCsInline = value;
-        await plugin.saveSettings();
-    }));
-    new obsidian.Setting(writeBCsToFileDetails)
-        .setName(fragWithHTML("Show the <code>Write Breadcrumbs to ALL Files</code> command"))
-        .setDesc("This command attempts to update ALL files with implied breadcrumbs pointing to them. So, it is not shown by default (even though it has 3 confirmation boxes to ensure you want to run it")
-        .addToggle((toggle) => toggle.setValue(settings.showWriteAllBCsCmd).onChange(async (value) => {
-        settings.showWriteAllBCsCmd = value;
-        await plugin.saveSettings();
-    }));
+			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "" + (/*realItem*/ ctx[22].cls + " " + (/*realItem*/ ctx[22].implied ?? "") + " svelte-1dlhare"))) {
+				attr(div, "class", div_class_value);
+			}
+		},
+		d(detaching) {
+			if (detaching) detach(li);
+			mounted = false;
+			run_all(dispose);
+		}
+	};
 }
 
-const fragWithHTML = (html) => createFragment((frag) => (frag.createDiv().innerHTML = html));
-const details = (text, parent) => parent.createEl("details", {}, (d) => d.createEl("summary", { text }));
-const subDetails = (text, parent) => parent
-    .createDiv({
-    attr: { style: "padding-left: 10px;" },
-})
-    .createEl("details", {}, (d) => d.createEl("summary", { text }));
-class BCSettingTab extends obsidian.PluginSettingTab {
-    constructor(app, plugin) {
-        super(app, plugin);
-        this.plugin = plugin;
-        this.app = app;
-    }
-    async display() {
-        const { plugin, containerEl } = this;
-        const { settings } = plugin;
-        containerEl.empty();
-        containerEl.createEl("h2", { text: "Breadcrumbs Settings" });
-        addHierarchySettings(plugin, containerEl);
-        addRelationSettings(plugin, containerEl);
-        addGeneralSettings(plugin, containerEl);
-        const viewDetails = details("Views", containerEl);
-        addMatrixViewSettings(plugin, viewDetails);
-        addTrailViewSettings(plugin, viewDetails);
-        addVisModalSettings(plugin, viewDetails);
-        addTreeViewSettings(plugin, viewDetails);
-        const alternativeHierarchyDetails = details("Alternative Hierarchies", containerEl);
-        new obsidian.Setting(alternativeHierarchyDetails)
-            .setName("Enable Field Suggestor")
-            .setDesc(fragWithHTML('Alot of Breadcrumbs features require a metadata (or inline Dataview) field to work. For example, `BC-folder-note`.</br>The Field Suggestor will show an autocomplete menu with all available Breadcrumbs field options when the content you type matches the regex <code>/^BC-.*$/</code>. Basically, just type "BC-" at the start of a line to trigger it.'))
-            .addToggle((toggle) => toggle.setValue(settings.fieldSuggestor).onChange(async (value) => {
-            settings.fieldSuggestor = value;
-            await plugin.saveSettings();
-        }));
-        addTagNoteSettings(plugin, alternativeHierarchyDetails);
-        addRegexNoteSettings(plugin, alternativeHierarchyDetails);
-        addNoSystemSettings(plugin, alternativeHierarchyDetails);
-        addHierarchyNoteSettings(plugin, alternativeHierarchyDetails);
-        addCSVSettings(plugin, alternativeHierarchyDetails);
-        addDendronSettings(plugin, alternativeHierarchyDetails);
-        const cmdsDetails = details("Commands", containerEl);
-        addWriteBCsSettings(plugin, cmdsDetails);
-        addCreateIndexSettings(plugin, cmdsDetails);
-        addThreadingSettings(plugin, cmdsDetails);
-        addDebuggingsSettings(plugin, containerEl);
-        new KoFi({ target: containerEl });
-    }
+// (50:12) {#if showImpliedRelations && square.impliedItems.length}
+function create_if_block_1$2(ctx) {
+	let t;
+	let ol;
+	let ol_start_value;
+	let if_block = /*showRelationType*/ ctx[8] && create_if_block_2$1();
+	let each_value_2 = /*square*/ ctx[16].impliedItems;
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value_2.length; i += 1) {
+		each_blocks[i] = create_each_block_2$2(get_each_context_2$2(ctx, each_value_2, i));
+	}
+
+	return {
+		c() {
+			if (if_block) if_block.c();
+			t = space();
+			ol = element("ol");
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			attr(ol, "start", ol_start_value = /*square*/ ctx[16].realItems.length + 1);
+		},
+		m(target, anchor) {
+			if (if_block) if_block.m(target, anchor);
+			insert(target, t, anchor);
+			insert(target, ol, anchor);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(ol, null);
+			}
+		},
+		p(ctx, dirty) {
+			if (dirty & /*treatCurrNodeAsImpliedSibling, filteredSquaresArr, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings*/ 223) {
+				each_value_2 = /*square*/ ctx[16].impliedItems;
+				let i;
+
+				for (i = 0; i < each_value_2.length; i += 1) {
+					const child_ctx = get_each_context_2$2(ctx, each_value_2, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block_2$2(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(ol, null);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value_2.length;
+			}
+
+			if (dirty & /*filteredSquaresArr*/ 1 && ol_start_value !== (ol_start_value = /*square*/ ctx[16].realItems.length + 1)) {
+				attr(ol, "start", ol_start_value);
+			}
+		},
+		d(detaching) {
+			if (if_block) if_block.d(detaching);
+			if (detaching) detach(t);
+			if (detaching) detach(ol);
+			destroy_each(each_blocks, detaching);
+		}
+	};
 }
 
-/* src\Components\RenderMarkdown.svelte generated by Svelte v3.35.0 */
+// (51:14) {#if showRelationType}
+function create_if_block_2$1(ctx) {
+	let h5;
 
-function add_css$4() {
-	var style = element("style");
-	style.id = "svelte-7e9i10-style";
-	style.textContent = "div.BC-note-content.svelte-7e9i10{padding-left:20px}";
-	append(document.head, style);
+	return {
+		c() {
+			h5 = element("h5");
+			h5.textContent = "Implied";
+			attr(h5, "class", "BC-header svelte-1dlhare");
+		},
+		m(target, anchor) {
+			insert(target, h5, anchor);
+		},
+		d(detaching) {
+			if (detaching) detach(h5);
+		}
+	};
 }
 
-function create_fragment$8(ctx) {
+// (56:16) {#each square.impliedItems as impliedItem}
+function create_each_block_2$2(ctx) {
+	let li;
 	let div;
+	let t_value = (/*impliedItem*/ ctx[19].alt ?? dropPathNDendron(/*impliedItem*/ ctx[19].to, /*settings*/ ctx[2])) + "";
+	let t;
+	let div_class_value;
+	let div_aria_label_value;
+	let div_aria_label_position_value;
+	let li_class_value;
+	let mounted;
+	let dispose;
+
+	function click_handler_1(...args) {
+		return /*click_handler_1*/ ctx[11](/*impliedItem*/ ctx[19], ...args);
+	}
+
+	function mouseover_handler_1(...args) {
+		return /*mouseover_handler_1*/ ctx[12](/*impliedItem*/ ctx[19], ...args);
+	}
 
 	return {
 		c() {
+			li = element("li");
 			div = element("div");
-			attr(div, "class", "BC-note-content svelte-7e9i10");
+			t = text(t_value);
+			attr(div, "class", div_class_value = "" + (/*impliedItem*/ ctx[19].cls + " " + (/*impliedItem*/ ctx[19].implied ?? "") + " svelte-1dlhare"));
+			attr(div, "aria-label", div_aria_label_value = /*impliedItem*/ ctx[19].parent ?? "");
+			attr(div, "aria-label-position", div_aria_label_position_value = /*rlLeaf*/ ctx[6] ? "left" : "right");
+
+			attr(li, "class", li_class_value = "BC-Implied " + (/*treatCurrNodeAsImpliedSibling*/ ctx[7] && /*impliedItem*/ ctx[19].to === /*currFile*/ ctx[1].basename
+			? "BC-active-note"
+			: ""));
 		},
 		m(target, anchor) {
-			insert(target, div, anchor);
-			/*div_binding*/ ctx[3](div);
+			insert(target, li, anchor);
+			append(li, div);
+			append(div, t);
+
+			if (!mounted) {
+				dispose = [
+					listen(div, "click", click_handler_1),
+					listen(div, "mouseover", mouseover_handler_1)
+				];
+
+				mounted = true;
+			}
+		},
+		p(new_ctx, dirty) {
+			ctx = new_ctx;
+			if (dirty & /*filteredSquaresArr, settings*/ 5 && t_value !== (t_value = (/*impliedItem*/ ctx[19].alt ?? dropPathNDendron(/*impliedItem*/ ctx[19].to, /*settings*/ ctx[2])) + "")) set_data(t, t_value);
+
+			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "" + (/*impliedItem*/ ctx[19].cls + " " + (/*impliedItem*/ ctx[19].implied ?? "") + " svelte-1dlhare"))) {
+				attr(div, "class", div_class_value);
+			}
+
+			if (dirty & /*filteredSquaresArr*/ 1 && div_aria_label_value !== (div_aria_label_value = /*impliedItem*/ ctx[19].parent ?? "")) {
+				attr(div, "aria-label", div_aria_label_value);
+			}
+
+			if (dirty & /*filteredSquaresArr, currFile*/ 3 && li_class_value !== (li_class_value = "BC-Implied " + (/*treatCurrNodeAsImpliedSibling*/ ctx[7] && /*impliedItem*/ ctx[19].to === /*currFile*/ ctx[1].basename
+			? "BC-active-note"
+			: ""))) {
+				attr(li, "class", li_class_value);
+			}
 		},
-		p: noop,
-		i: noop,
-		o: noop,
 		d(detaching) {
-			if (detaching) detach(div);
-			/*div_binding*/ ctx[3](null);
+			if (detaching) detach(li);
+			mounted = false;
+			run_all(dispose);
 		}
 	};
 }
 
-function instance$8($$self, $$props, $$invalidate) {
-	var __awaiter = this && this.__awaiter || function (thisArg, _arguments, P, generator) {
-		function adopt(value) {
-			return value instanceof P
-			? value
-			: new P(function (resolve) {
-						resolve(value);
-					});
-		}
+// (25:6) {#each squares as square}
+function create_each_block_1$4(ctx) {
+	let if_block_anchor;
+	let if_block = (/*square*/ ctx[16].realItems.length || /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) && create_if_block$2(ctx);
 
-		return new (P || (P = Promise))(function (resolve, reject) {
-				function fulfilled(value) {
-					try {
-						step(generator.next(value));
-					} catch(e) {
-						reject(e);
-					}
+	return {
+		c() {
+			if (if_block) if_block.c();
+			if_block_anchor = empty();
+		},
+		m(target, anchor) {
+			if (if_block) if_block.m(target, anchor);
+			insert(target, if_block_anchor, anchor);
+		},
+		p(ctx, dirty) {
+			if (/*square*/ ctx[16].realItems.length || /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) {
+				if (if_block) {
+					if_block.p(ctx, dirty);
+				} else {
+					if_block = create_if_block$2(ctx);
+					if_block.c();
+					if_block.m(if_block_anchor.parentNode, if_block_anchor);
 				}
+			} else if (if_block) {
+				if_block.d(1);
+				if_block = null;
+			}
+		},
+		d(detaching) {
+			if (if_block) if_block.d(detaching);
+			if (detaching) detach(if_block_anchor);
+		}
+	};
+}
 
-				function rejected(value) {
-					try {
-						step(generator["throw"](value));
-					} catch(e) {
-						reject(e);
+// (19:2) {#each filteredSquaresArr as squares}
+function create_each_block$5(ctx) {
+	let details;
+	let summary;
+	let t0_value = /*squares*/ ctx[13].map(func).join(", ") + "";
+	let t0;
+	let t1;
+	let t2;
+	let each_value_1 = /*squares*/ ctx[13];
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value_1.length; i += 1) {
+		each_blocks[i] = create_each_block_1$4(get_each_context_1$4(ctx, each_value_1, i));
+	}
+
+	return {
+		c() {
+			details = element("details");
+			summary = element("summary");
+			t0 = text(t0_value);
+			t1 = space();
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			t2 = space();
+			attr(summary, "class", "hier-summary svelte-1dlhare");
+			details.open = true;
+		},
+		m(target, anchor) {
+			insert(target, details, anchor);
+			append(details, summary);
+			append(summary, t0);
+			append(details, t1);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(details, null);
+			}
+
+			append(details, t2);
+		},
+		p(ctx, dirty) {
+			if (dirty & /*filteredSquaresArr*/ 1 && t0_value !== (t0_value = /*squares*/ ctx[13].map(func).join(", ") + "")) set_data(t0, t0_value);
+
+			if (dirty & /*filteredSquaresArr, treatCurrNodeAsImpliedSibling, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings, showRelationType, showImpliedRelations*/ 511) {
+				each_value_1 = /*squares*/ ctx[13];
+				let i;
+
+				for (i = 0; i < each_value_1.length; i += 1) {
+					const child_ctx = get_each_context_1$4(ctx, each_value_1, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block_1$4(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(details, t2);
 					}
 				}
 
-				function step(result) {
-					result.done
-					? resolve(result.value)
-					: adopt(result.value).then(fulfilled, rejected);
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
 				}
 
-				step((generator = generator.apply(thisArg, _arguments || [])).next());
-			});
+				each_blocks.length = each_value_1.length;
+			}
+		},
+		d(detaching) {
+			if (detaching) detach(details);
+			destroy_each(each_blocks, detaching);
+		}
 	};
+}
 
-	let { path } = $$props;
-	let { app } = $$props;
+function create_fragment$8(ctx) {
+	let div;
+	let div_class_value;
+	let each_value = /*filteredSquaresArr*/ ctx[0];
+	let each_blocks = [];
 
-	function getContent(note) {
-		return __awaiter(this, void 0, void 0, function* () {
-			const file = app.metadataCache.getFirstLinkpathDest(note, "");
-			return yield app.vault.cachedRead(file);
-		});
+	for (let i = 0; i < each_value.length; i += 1) {
+		each_blocks[i] = create_each_block$5(get_each_context$5(ctx, each_value, i));
 	}
 
-	let el;
+	return {
+		c() {
+			div = element("div");
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			attr(div, "class", div_class_value = "BC-list markdown-preview-view " + (/*filteredSquaresArr*/ ctx[0].length
+			? ""
+			: "BC-empty-view") + " svelte-1dlhare");
+		},
+		m(target, anchor) {
+			insert(target, div, anchor);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(div, null);
+			}
+		},
+		p(ctx, [dirty]) {
+			if (dirty & /*filteredSquaresArr, treatCurrNodeAsImpliedSibling, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings, showRelationType, showImpliedRelations*/ 511) {
+				each_value = /*filteredSquaresArr*/ ctx[0];
+				let i;
+
+				for (i = 0; i < each_value.length; i += 1) {
+					const child_ctx = get_each_context$5(ctx, each_value, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block$5(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(div, null);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value.length;
+			}
+
+			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "BC-list markdown-preview-view " + (/*filteredSquaresArr*/ ctx[0].length
+			? ""
+			: "BC-empty-view") + " svelte-1dlhare")) {
+				attr(div, "class", div_class_value);
+			}
+		},
+		i: noop,
+		o: noop,
+		d(detaching) {
+			if (detaching) detach(div);
+			destroy_each(each_blocks, detaching);
+		}
+	};
+}
 
-	onMount(() => __awaiter(void 0, void 0, void 0, function* () {
-		obsidian.MarkdownRenderer.renderMarkdown(yield getContent(path), el, path, null);
-	}));
+const func = square => square.field;
 
-	function div_binding($$value) {
-		binding_callbacks[$$value ? "unshift" : "push"](() => {
-			el = $$value;
-			$$invalidate(0, el);
-		});
-	}
+function instance$8($$self, $$props, $$invalidate) {
+	
+	
+	
+	let { filteredSquaresArr } = $$props;
+	let { currFile } = $$props;
+	let { settings } = $$props;
+	let { matrixView } = $$props;
+	let { app } = $$props;
+	const { showImpliedRelations, rlLeaf, treatCurrNodeAsImpliedSibling, showRelationType } = settings;
+	const click_handler = async (realItem, e) => openOrSwitch(app, realItem.to, e);
+	const mouseover_handler = (realItem, e) => hoverPreview(e, matrixView, realItem.to);
+	const click_handler_1 = async (impliedItem, e) => openOrSwitch(app, impliedItem.to, e);
+	const mouseover_handler_1 = (impliedItem, e) => hoverPreview(e, matrixView, impliedItem.to);
 
 	$$self.$$set = $$props => {
-		if ("path" in $$props) $$invalidate(1, path = $$props.path);
-		if ("app" in $$props) $$invalidate(2, app = $$props.app);
+		if ("filteredSquaresArr" in $$props) $$invalidate(0, filteredSquaresArr = $$props.filteredSquaresArr);
+		if ("currFile" in $$props) $$invalidate(1, currFile = $$props.currFile);
+		if ("settings" in $$props) $$invalidate(2, settings = $$props.settings);
+		if ("matrixView" in $$props) $$invalidate(3, matrixView = $$props.matrixView);
+		if ("app" in $$props) $$invalidate(4, app = $$props.app);
 	};
 
-	return [el, path, app, div_binding];
+	return [
+		filteredSquaresArr,
+		currFile,
+		settings,
+		matrixView,
+		app,
+		showImpliedRelations,
+		rlLeaf,
+		treatCurrNodeAsImpliedSibling,
+		showRelationType,
+		click_handler,
+		mouseover_handler,
+		click_handler_1,
+		mouseover_handler_1
+	];
 }
 
-class RenderMarkdown extends SvelteComponent {
+class Lists extends SvelteComponent {
 	constructor(options) {
 		super();
-		if (!document.getElementById("svelte-7e9i10-style")) add_css$4();
-		init(this, options, instance$8, create_fragment$8, safe_not_equal, { path: 1, app: 2 });
+		if (!document.getElementById("svelte-1dlhare-style")) add_css$4();
+
+		init(this, options, instance$8, create_fragment$8, safe_not_equal, {
+			filteredSquaresArr: 0,
+			currFile: 1,
+			settings: 2,
+			matrixView: 3,
+			app: 4
+		});
 	}
 }
 
-/* src\Components\CBTree.svelte generated by Svelte v3.35.0 */
+/* src\Components\Matrix.svelte generated by Svelte v3.35.0 */
 
 function add_css$3() {
 	var style = element("style");
-	style.id = "svelte-yt7jmz-style";
-	style.textContent = ".BC-tree.svelte-yt7jmz{padding-left:5px}pre.indent.svelte-yt7jmz{display:inline;background-color:transparent;position:top}details.svelte-yt7jmz{display:inline-block}.is-unresolved.svelte-yt7jmz{color:var(--text-muted)}";
+	style.id = "svelte-sp0k97-style";
+	style.textContent = "div.BC-Matrix.svelte-sp0k97.svelte-sp0k97{padding:5px}div.BC-Matrix.svelte-sp0k97>div.svelte-sp0k97{border:3px solid var(--background-modifier-border);border-radius:3px;text-align:center;margin:3px;position:relative;height:fit-content}div.BC-Matrix-square.svelte-sp0k97.svelte-sp0k97{border:1px solid var(--background-modifier-border)}div.BC-Matrix-headers.svelte-sp0k97.svelte-sp0k97{display:flex;justify-content:space-between;align-items:center}.BC-Matrix-header.svelte-sp0k97.svelte-sp0k97{margin:2px;padding:0px 10px}ol.svelte-sp0k97.svelte-sp0k97{margin:3px;padding-left:30px}";
 	append(document.head, style);
 }
 
 function get_each_context$4(ctx, list, i) {
 	const child_ctx = ctx.slice();
-	child_ctx[17] = list[i][0];
-	child_ctx[18] = list[i][1];
+	child_ctx[13] = list[i];
 	return child_ctx;
 }
 
-// (27:0) {#if title !== "false"}
-function create_if_block_2(ctx) {
-	let h3;
+function get_each_context_1$3(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[16] = list[i];
+	return child_ctx;
+}
+
+function get_each_context_2$1(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[19] = list[i];
+	return child_ctx;
+}
+
+function get_each_context_3$1(ctx, list, i) {
+	const child_ctx = ctx.slice();
+	child_ctx[22] = list[i];
+	return child_ctx;
+}
+
+// (22:8) {#if square.realItems.length || (showImpliedRelations && square.impliedItems.length)}
+function create_if_block$1(ctx) {
+	let div1;
+	let div0;
+	let h4;
+	let t0_value = /*square*/ ctx[16].field + "";
 	let t0;
 	let t1;
 	let t2;
+	let t3;
+	let if_block0 = /*showRelationType*/ ctx[8] && create_if_block_5(ctx);
+	let if_block1 = /*square*/ ctx[16].realItems.length && create_if_block_4(ctx);
+	let if_block2 = /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length && create_if_block_1$1(ctx);
 
 	return {
 		c() {
-			h3 = element("h3");
-			t0 = text(/*dir*/ ctx[1]);
-			t1 = text(" of ");
-			t2 = text(/*basename*/ ctx[5]);
+			div1 = element("div");
+			div0 = element("div");
+			h4 = element("h4");
+			t0 = text(t0_value);
+			t1 = space();
+			if (if_block0) if_block0.c();
+			t2 = space();
+			if (if_block1) if_block1.c();
+			t3 = space();
+			if (if_block2) if_block2.c();
+			attr(h4, "class", "BC-Matrix-header svelte-sp0k97");
+			attr(div0, "class", "BC-Matrix-headers svelte-sp0k97");
+			attr(div1, "class", "BC-Matrix-square svelte-sp0k97");
 		},
 		m(target, anchor) {
-			insert(target, h3, anchor);
-			append(h3, t0);
-			append(h3, t1);
-			append(h3, t2);
+			insert(target, div1, anchor);
+			append(div1, div0);
+			append(div0, h4);
+			append(h4, t0);
+			append(div0, t1);
+			if (if_block0) if_block0.m(div0, null);
+			append(div1, t2);
+			if (if_block1) if_block1.m(div1, null);
+			append(div1, t3);
+			if (if_block2) if_block2.m(div1, null);
 		},
 		p(ctx, dirty) {
-			if (dirty & /*dir*/ 2) set_data(t0, /*dir*/ ctx[1]);
-			if (dirty & /*basename*/ 32) set_data(t2, /*basename*/ ctx[5]);
+			if (dirty & /*filteredSquaresArr*/ 1 && t0_value !== (t0_value = /*square*/ ctx[16].field + "")) set_data(t0, t0_value);
+			if (/*showRelationType*/ ctx[8]) if_block0.p(ctx, dirty);
+
+			if (/*square*/ ctx[16].realItems.length) {
+				if (if_block1) {
+					if_block1.p(ctx, dirty);
+				} else {
+					if_block1 = create_if_block_4(ctx);
+					if_block1.c();
+					if_block1.m(div1, t3);
+				}
+			} else if (if_block1) {
+				if_block1.d(1);
+				if_block1 = null;
+			}
+
+			if (/*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) {
+				if (if_block2) {
+					if_block2.p(ctx, dirty);
+				} else {
+					if_block2 = create_if_block_1$1(ctx);
+					if_block2.c();
+					if_block2.m(div1, null);
+				}
+			} else if (if_block2) {
+				if_block2.d(1);
+				if_block2 = null;
+			}
 		},
 		d(detaching) {
-			if (detaching) detach(h3);
+			if (detaching) detach(div1);
+			if (if_block0) if_block0.d();
+			if (if_block1) if_block1.d();
+			if (if_block2) if_block2.d();
 		}
 	};
 }
 
-// (32:4) {#if meetsConditions(indent, link)}
-function create_if_block$1(ctx) {
-	let current_block_type_index;
-	let if_block;
-	let if_block_anchor;
-	let current;
-	const if_block_creators = [create_if_block_1$1, create_else_block$1];
-	const if_blocks = [];
+// (27:14) {#if showRelationType}
+function create_if_block_5(ctx) {
+	let h6;
+	let t_value = (/*square*/ ctx[16].realItems.length ? "Real" : "Implied") + "";
+	let t;
 
-	function select_block_type(ctx, dirty) {
-		if (/*content*/ ctx[3] === "open" || /*content*/ ctx[3] === "closed") return 0;
-		return 1;
-	}
+	return {
+		c() {
+			h6 = element("h6");
+			t = text(t_value);
+			attr(h6, "class", "BC-Matrix-header svelte-sp0k97");
+		},
+		m(target, anchor) {
+			insert(target, h6, anchor);
+			append(h6, t);
+		},
+		p(ctx, dirty) {
+			if (dirty & /*filteredSquaresArr*/ 1 && t_value !== (t_value = (/*square*/ ctx[16].realItems.length ? "Real" : "Implied") + "")) set_data(t, t_value);
+		},
+		d(detaching) {
+			if (detaching) detach(h6);
+		}
+	};
+}
 
-	current_block_type_index = select_block_type(ctx);
-	if_block = if_blocks[current_block_type_index] = if_block_creators[current_block_type_index](ctx);
+// (33:12) {#if square.realItems.length}
+function create_if_block_4(ctx) {
+	let ol;
+	let each_value_3 = /*square*/ ctx[16].realItems;
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value_3.length; i += 1) {
+		each_blocks[i] = create_each_block_3$1(get_each_context_3$1(ctx, each_value_3, i));
+	}
 
 	return {
 		c() {
-			if_block.c();
-			if_block_anchor = empty();
+			ol = element("ol");
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			attr(ol, "class", "svelte-sp0k97");
 		},
 		m(target, anchor) {
-			if_blocks[current_block_type_index].m(target, anchor);
-			insert(target, if_block_anchor, anchor);
-			current = true;
+			insert(target, ol, anchor);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(ol, null);
+			}
 		},
 		p(ctx, dirty) {
-			let previous_block_index = current_block_type_index;
-			current_block_type_index = select_block_type(ctx);
-
-			if (current_block_type_index === previous_block_index) {
-				if_blocks[current_block_type_index].p(ctx, dirty);
-			} else {
-				group_outros();
+			if (dirty & /*filteredSquaresArr, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings*/ 29) {
+				each_value_3 = /*square*/ ctx[16].realItems;
+				let i;
 
-				transition_out(if_blocks[previous_block_index], 1, 1, () => {
-					if_blocks[previous_block_index] = null;
-				});
+				for (i = 0; i < each_value_3.length; i += 1) {
+					const child_ctx = get_each_context_3$1(ctx, each_value_3, i);
 
-				check_outros();
-				if_block = if_blocks[current_block_type_index];
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block_3$1(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(ol, null);
+					}
+				}
 
-				if (!if_block) {
-					if_block = if_blocks[current_block_type_index] = if_block_creators[current_block_type_index](ctx);
-					if_block.c();
-				} else {
-					if_block.p(ctx, dirty);
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
 				}
 
-				transition_in(if_block, 1);
-				if_block.m(if_block_anchor.parentNode, if_block_anchor);
+				each_blocks.length = each_value_3.length;
 			}
 		},
-		i(local) {
-			if (current) return;
-			transition_in(if_block);
-			current = true;
-		},
-		o(local) {
-			transition_out(if_block);
-			current = false;
-		},
 		d(detaching) {
-			if_blocks[current_block_type_index].d(detaching);
-			if (detaching) detach(if_block_anchor);
+			if (detaching) detach(ol);
+			destroy_each(each_blocks, detaching);
 		}
 	};
 }
 
-// (57:6) {:else}
-function create_else_block$1(ctx) {
+// (35:16) {#each square.realItems as realItem}
+function create_each_block_3$1(ctx) {
+	let li;
 	let div;
-	let pre;
-	let t0_value = /*indent*/ ctx[17] + "-" + "";
+	let t0_value = (/*realItem*/ ctx[22].alt ?? dropPathNDendron(/*realItem*/ ctx[22].to, /*settings*/ ctx[2])) + "";
 	let t0;
+	let div_class_value;
 	let t1;
-	let span;
-	let a;
-	let t2_value = dropDendron(/*link*/ ctx[18], /*settings*/ ctx[6]) + "";
-	let t2;
-	let a_class_value;
-	let t3;
 	let mounted;
 	let dispose;
 
-	function click_handler_1(...args) {
-		return /*click_handler_1*/ ctx[15](/*link*/ ctx[18], ...args);
+	function click_handler(...args) {
+		return /*click_handler*/ ctx[9](/*realItem*/ ctx[22], ...args);
+	}
+
+	function mouseover_handler(...args) {
+		return /*mouseover_handler*/ ctx[10](/*realItem*/ ctx[22], ...args);
 	}
 
 	return {
 		c() {
+			li = element("li");
 			div = element("div");
-			pre = element("pre");
 			t0 = text(t0_value);
 			t1 = space();
-			span = element("span");
-			a = element("a");
-			t2 = text(t2_value);
-			t3 = space();
-			attr(pre, "class", "indent svelte-yt7jmz");
-
-			attr(a, "class", a_class_value = "internal-link " + (isInVault(/*plugin*/ ctx[0].app, /*link*/ ctx[18])
-			? ""
-			: "is-unresolved") + " svelte-yt7jmz");
-
-			attr(span, "class", "internal-link");
+			attr(div, "class", div_class_value = "" + (/*realItem*/ ctx[22].cls + " " + (/*realItem*/ ctx[22].implied ?? "") + " svelte-sp0k97"));
 		},
 		m(target, anchor) {
-			insert(target, div, anchor);
-			append(div, pre);
-			append(pre, t0);
-			append(div, t1);
-			append(div, span);
-			append(span, a);
-			append(a, t2);
-			append(div, t3);
+			insert(target, li, anchor);
+			append(li, div);
+			append(div, t0);
+			append(li, t1);
 
 			if (!mounted) {
 				dispose = [
-					listen(span, "click", click_handler_1),
-					listen(span, "mouseover", mouseover_handler_1)
+					listen(div, "click", click_handler),
+					listen(div, "mouseover", mouseover_handler)
 				];
 
 				mounted = true;
@@ -29649,101 +29029,216 @@ function create_else_block$1(ctx) {
 		},
 		p(new_ctx, dirty) {
 			ctx = new_ctx;
-			if (dirty & /*lines*/ 16 && t0_value !== (t0_value = /*indent*/ ctx[17] + "-" + "")) set_data(t0, t0_value);
-			if (dirty & /*lines*/ 16 && t2_value !== (t2_value = dropDendron(/*link*/ ctx[18], /*settings*/ ctx[6]) + "")) set_data(t2, t2_value);
+			if (dirty & /*filteredSquaresArr, settings*/ 5 && t0_value !== (t0_value = (/*realItem*/ ctx[22].alt ?? dropPathNDendron(/*realItem*/ ctx[22].to, /*settings*/ ctx[2])) + "")) set_data(t0, t0_value);
 
-			if (dirty & /*plugin, lines*/ 17 && a_class_value !== (a_class_value = "internal-link " + (isInVault(/*plugin*/ ctx[0].app, /*link*/ ctx[18])
-			? ""
-			: "is-unresolved") + " svelte-yt7jmz")) {
-				attr(a, "class", a_class_value);
+			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "" + (/*realItem*/ ctx[22].cls + " " + (/*realItem*/ ctx[22].implied ?? "") + " svelte-sp0k97"))) {
+				attr(div, "class", div_class_value);
 			}
 		},
-		i: noop,
-		o: noop,
 		d(detaching) {
-			if (detaching) detach(div);
+			if (detaching) detach(li);
 			mounted = false;
 			run_all(dispose);
 		}
 	};
 }
 
-// (33:6) {#if content === "open" || content === "closed"}
+// (50:12) {#if showImpliedRelations && square.impliedItems.length}
 function create_if_block_1$1(ctx) {
 	let div;
-	let pre;
-	let t0_value = /*indent*/ ctx[17] + "";
+	let h4;
 	let t0;
 	let t1;
-	let details;
-	let summary;
-	let span;
-	let a;
-	let t2_value = dropDendron(/*link*/ ctx[18], /*settings*/ ctx[6]) + "";
-	let t2;
-	let a_class_value;
-	let t3;
-	let rendermarkdown;
-	let details_open_value;
-	let t4;
-	let current;
+	let ol;
+	let ol_start_value;
+	let if_block = /*square*/ ctx[16].impliedItems.length && create_if_block_2(ctx);
+	let each_value_2 = /*square*/ ctx[16].impliedItems;
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value_2.length; i += 1) {
+		each_blocks[i] = create_each_block_2$1(get_each_context_2$1(ctx, each_value_2, i));
+	}
+
+	return {
+		c() {
+			div = element("div");
+			h4 = element("h4");
+			t0 = space();
+			if (if_block) if_block.c();
+			t1 = space();
+			ol = element("ol");
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			attr(h4, "class", "BC-Matrix-header svelte-sp0k97");
+			attr(div, "class", "BC-Matrix-headers svelte-sp0k97");
+			attr(ol, "start", ol_start_value = /*square*/ ctx[16].realItems.length + 1);
+			attr(ol, "class", "svelte-sp0k97");
+		},
+		m(target, anchor) {
+			insert(target, div, anchor);
+			append(div, h4);
+			append(div, t0);
+			if (if_block) if_block.m(div, null);
+			insert(target, t1, anchor);
+			insert(target, ol, anchor);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(ol, null);
+			}
+		},
+		p(ctx, dirty) {
+			if (/*square*/ ctx[16].impliedItems.length) {
+				if (if_block) {
+					if_block.p(ctx, dirty);
+				} else {
+					if_block = create_if_block_2(ctx);
+					if_block.c();
+					if_block.m(div, null);
+				}
+			} else if (if_block) {
+				if_block.d(1);
+				if_block = null;
+			}
+
+			if (dirty & /*treatCurrNodeAsImpliedSibling, filteredSquaresArr, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings*/ 223) {
+				each_value_2 = /*square*/ ctx[16].impliedItems;
+				let i;
+
+				for (i = 0; i < each_value_2.length; i += 1) {
+					const child_ctx = get_each_context_2$1(ctx, each_value_2, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block_2$1(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(ol, null);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value_2.length;
+			}
+
+			if (dirty & /*filteredSquaresArr*/ 1 && ol_start_value !== (ol_start_value = /*square*/ ctx[16].realItems.length + 1)) {
+				attr(ol, "start", ol_start_value);
+			}
+		},
+		d(detaching) {
+			if (detaching) detach(div);
+			if (if_block) if_block.d();
+			if (detaching) detach(t1);
+			if (detaching) detach(ol);
+			destroy_each(each_blocks, detaching);
+		}
+	};
+}
+
+// (53:16) {#if square.impliedItems.length}
+function create_if_block_2(ctx) {
+	let if_block_anchor;
+	let if_block = /*showRelationType*/ ctx[8] && /*square*/ ctx[16].realItems.length && create_if_block_3();
+
+	return {
+		c() {
+			if (if_block) if_block.c();
+			if_block_anchor = empty();
+		},
+		m(target, anchor) {
+			if (if_block) if_block.m(target, anchor);
+			insert(target, if_block_anchor, anchor);
+		},
+		p(ctx, dirty) {
+			if (/*showRelationType*/ ctx[8] && /*square*/ ctx[16].realItems.length) {
+				if (if_block) ; else {
+					if_block = create_if_block_3();
+					if_block.c();
+					if_block.m(if_block_anchor.parentNode, if_block_anchor);
+				}
+			} else if (if_block) {
+				if_block.d(1);
+				if_block = null;
+			}
+		},
+		d(detaching) {
+			if (if_block) if_block.d(detaching);
+			if (detaching) detach(if_block_anchor);
+		}
+	};
+}
+
+// (54:18) {#if showRelationType && square.realItems.length}
+function create_if_block_3(ctx) {
+	let h6;
+
+	return {
+		c() {
+			h6 = element("h6");
+			h6.textContent = "Implied";
+			attr(h6, "class", "BC-Matrix-header svelte-sp0k97");
+		},
+		m(target, anchor) {
+			insert(target, h6, anchor);
+		},
+		d(detaching) {
+			if (detaching) detach(h6);
+		}
+	};
+}
+
+// (60:16) {#each square.impliedItems as impliedItem}
+function create_each_block_2$1(ctx) {
+	let li;
+	let div;
+	let t_value = (/*impliedItem*/ ctx[19].alt ?? dropPathNDendron(/*impliedItem*/ ctx[19].to, /*settings*/ ctx[2])) + "";
+	let t;
+	let div_class_value;
+	let div_aria_label_value;
+	let div_aria_label_position_value;
+	let li_class_value;
 	let mounted;
 	let dispose;
 
-	function click_handler(...args) {
-		return /*click_handler*/ ctx[14](/*link*/ ctx[18], ...args);
+	function click_handler_1(...args) {
+		return /*click_handler_1*/ ctx[11](/*impliedItem*/ ctx[19], ...args);
 	}
 
-	rendermarkdown = new RenderMarkdown({
-			props: {
-				app: /*app*/ ctx[7],
-				path: /*link*/ ctx[18]
-			}
-		});
+	function mouseover_handler_1(...args) {
+		return /*mouseover_handler_1*/ ctx[12](/*impliedItem*/ ctx[19], ...args);
+	}
 
 	return {
 		c() {
+			li = element("li");
 			div = element("div");
-			pre = element("pre");
-			t0 = text(t0_value);
-			t1 = space();
-			details = element("details");
-			summary = element("summary");
-			span = element("span");
-			a = element("a");
-			t2 = text(t2_value);
-			t3 = space();
-			create_component(rendermarkdown.$$.fragment);
-			t4 = space();
-			attr(pre, "class", "indent svelte-yt7jmz");
+			t = text(t_value);
+			attr(div, "class", div_class_value = "" + (/*impliedItem*/ ctx[19].cls + " " + (/*impliedItem*/ ctx[19].implied ?? "") + " svelte-sp0k97"));
 
-			attr(a, "class", a_class_value = "internal-link " + (isInVault(/*plugin*/ ctx[0].app, /*link*/ ctx[18])
-			? ""
-			: "is-unresolved") + " svelte-yt7jmz");
+			attr(div, "aria-label", div_aria_label_value = /*impliedItem*/ ctx[19].parent
+			? "↑ " + /*impliedItem*/ ctx[19].parent
+			: "");
 
-			attr(span, "class", "internal-link");
-			details.open = details_open_value = /*content*/ ctx[3] === "open";
-			attr(details, "class", "svelte-yt7jmz");
+			attr(div, "aria-label-position", div_aria_label_position_value = /*rlLeaf*/ ctx[6] ? "left" : "right");
+
+			attr(li, "class", li_class_value = "BC-Implied " + (/*treatCurrNodeAsImpliedSibling*/ ctx[7] && /*impliedItem*/ ctx[19].to === /*currFile*/ ctx[1].basename
+			? "BC-active-note"
+			: ""));
 		},
 		m(target, anchor) {
-			insert(target, div, anchor);
-			append(div, pre);
-			append(pre, t0);
-			append(div, t1);
-			append(div, details);
-			append(details, summary);
-			append(summary, span);
-			append(span, a);
-			append(a, t2);
-			append(details, t3);
-			mount_component(rendermarkdown, details, null);
-			append(div, t4);
-			current = true;
+			insert(target, li, anchor);
+			append(li, div);
+			append(div, t);
 
 			if (!mounted) {
 				dispose = [
-					listen(span, "click", click_handler),
-					listen(span, "mouseover", mouseover_handler)
+					listen(div, "click", click_handler_1),
+					listen(div, "mouseover", mouseover_handler_1)
 				];
 
 				mounted = true;
@@ -29751,47 +29246,36 @@ function create_if_block_1$1(ctx) {
 		},
 		p(new_ctx, dirty) {
 			ctx = new_ctx;
-			if ((!current || dirty & /*lines*/ 16) && t0_value !== (t0_value = /*indent*/ ctx[17] + "")) set_data(t0, t0_value);
-			if ((!current || dirty & /*lines*/ 16) && t2_value !== (t2_value = dropDendron(/*link*/ ctx[18], /*settings*/ ctx[6]) + "")) set_data(t2, t2_value);
+			if (dirty & /*filteredSquaresArr, settings*/ 5 && t_value !== (t_value = (/*impliedItem*/ ctx[19].alt ?? dropPathNDendron(/*impliedItem*/ ctx[19].to, /*settings*/ ctx[2])) + "")) set_data(t, t_value);
 
-			if (!current || dirty & /*plugin, lines*/ 17 && a_class_value !== (a_class_value = "internal-link " + (isInVault(/*plugin*/ ctx[0].app, /*link*/ ctx[18])
-			? ""
-			: "is-unresolved") + " svelte-yt7jmz")) {
-				attr(a, "class", a_class_value);
+			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "" + (/*impliedItem*/ ctx[19].cls + " " + (/*impliedItem*/ ctx[19].implied ?? "") + " svelte-sp0k97"))) {
+				attr(div, "class", div_class_value);
 			}
 
-			const rendermarkdown_changes = {};
-			if (dirty & /*lines*/ 16) rendermarkdown_changes.path = /*link*/ ctx[18];
-			rendermarkdown.$set(rendermarkdown_changes);
+			if (dirty & /*filteredSquaresArr*/ 1 && div_aria_label_value !== (div_aria_label_value = /*impliedItem*/ ctx[19].parent
+			? "↑ " + /*impliedItem*/ ctx[19].parent
+			: "")) {
+				attr(div, "aria-label", div_aria_label_value);
+			}
 
-			if (!current || dirty & /*content*/ 8 && details_open_value !== (details_open_value = /*content*/ ctx[3] === "open")) {
-				details.open = details_open_value;
+			if (dirty & /*filteredSquaresArr, currFile*/ 3 && li_class_value !== (li_class_value = "BC-Implied " + (/*treatCurrNodeAsImpliedSibling*/ ctx[7] && /*impliedItem*/ ctx[19].to === /*currFile*/ ctx[1].basename
+			? "BC-active-note"
+			: ""))) {
+				attr(li, "class", li_class_value);
 			}
 		},
-		i(local) {
-			if (current) return;
-			transition_in(rendermarkdown.$$.fragment, local);
-			current = true;
-		},
-		o(local) {
-			transition_out(rendermarkdown.$$.fragment, local);
-			current = false;
-		},
 		d(detaching) {
-			if (detaching) detach(div);
-			destroy_component(rendermarkdown);
+			if (detaching) detach(li);
 			mounted = false;
 			run_all(dispose);
 		}
 	};
 }
 
-// (31:2) {#each lines as [indent, link]}
-function create_each_block$4(ctx) {
-	let show_if = /*meetsConditions*/ ctx[8](/*indent*/ ctx[17], /*link*/ ctx[18]);
+// (21:6) {#each squares as square}
+function create_each_block_1$3(ctx) {
 	let if_block_anchor;
-	let current;
-	let if_block = show_if && create_if_block$1(ctx);
+	let if_block = (/*square*/ ctx[16].realItems.length || /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) && create_if_block$1(ctx);
 
 	return {
 		c() {
@@ -29801,629 +29285,1159 @@ function create_each_block$4(ctx) {
 		m(target, anchor) {
 			if (if_block) if_block.m(target, anchor);
 			insert(target, if_block_anchor, anchor);
-			current = true;
 		},
 		p(ctx, dirty) {
-			if (dirty & /*lines*/ 16) show_if = /*meetsConditions*/ ctx[8](/*indent*/ ctx[17], /*link*/ ctx[18]);
-
-			if (show_if) {
+			if (/*square*/ ctx[16].realItems.length || /*showImpliedRelations*/ ctx[5] && /*square*/ ctx[16].impliedItems.length) {
 				if (if_block) {
 					if_block.p(ctx, dirty);
-
-					if (dirty & /*lines*/ 16) {
-						transition_in(if_block, 1);
-					}
 				} else {
 					if_block = create_if_block$1(ctx);
 					if_block.c();
-					transition_in(if_block, 1);
 					if_block.m(if_block_anchor.parentNode, if_block_anchor);
 				}
 			} else if (if_block) {
-				group_outros();
+				if_block.d(1);
+				if_block = null;
+			}
+		},
+		d(detaching) {
+			if (if_block) if_block.d(detaching);
+			if (detaching) detach(if_block_anchor);
+		}
+	};
+}
 
-				transition_out(if_block, 1, 1, () => {
-					if_block = null;
-				});
+// (19:2) {#each filteredSquaresArr as squares}
+function create_each_block$4(ctx) {
+	let div;
+	let t;
+	let each_value_1 = /*squares*/ ctx[13];
+	let each_blocks = [];
 
-				check_outros();
+	for (let i = 0; i < each_value_1.length; i += 1) {
+		each_blocks[i] = create_each_block_1$3(get_each_context_1$3(ctx, each_value_1, i));
+	}
+
+	return {
+		c() {
+			div = element("div");
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
 			}
+
+			t = space();
+			attr(div, "class", "BC-matrix-hier svelte-sp0k97");
 		},
-		i(local) {
-			if (current) return;
-			transition_in(if_block);
-			current = true;
+		m(target, anchor) {
+			insert(target, div, anchor);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(div, null);
+			}
+
+			append(div, t);
 		},
-		o(local) {
-			transition_out(if_block);
-			current = false;
+		p(ctx, dirty) {
+			if (dirty & /*filteredSquaresArr, treatCurrNodeAsImpliedSibling, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings, showRelationType, showImpliedRelations*/ 511) {
+				each_value_1 = /*squares*/ ctx[13];
+				let i;
+
+				for (i = 0; i < each_value_1.length; i += 1) {
+					const child_ctx = get_each_context_1$3(ctx, each_value_1, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block_1$3(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(div, t);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value_1.length;
+			}
+		},
+		d(detaching) {
+			if (detaching) detach(div);
+			destroy_each(each_blocks, detaching);
+		}
+	};
+}
+
+function create_fragment$7(ctx) {
+	let div;
+	let div_class_value;
+	let each_value = /*filteredSquaresArr*/ ctx[0];
+	let each_blocks = [];
+
+	for (let i = 0; i < each_value.length; i += 1) {
+		each_blocks[i] = create_each_block$4(get_each_context$4(ctx, each_value, i));
+	}
+
+	return {
+		c() {
+			div = element("div");
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].c();
+			}
+
+			attr(div, "class", div_class_value = "BC-Matrix  markdown-preview-view " + (/*filteredSquaresArr*/ ctx[0].length
+			? ""
+			: "BC-empty-view") + " svelte-sp0k97");
+		},
+		m(target, anchor) {
+			insert(target, div, anchor);
+
+			for (let i = 0; i < each_blocks.length; i += 1) {
+				each_blocks[i].m(div, null);
+			}
+		},
+		p(ctx, [dirty]) {
+			if (dirty & /*filteredSquaresArr, treatCurrNodeAsImpliedSibling, currFile, rlLeaf, openOrSwitch, app, hoverPreview, matrixView, dropPathNDendron, settings, showRelationType, showImpliedRelations*/ 511) {
+				each_value = /*filteredSquaresArr*/ ctx[0];
+				let i;
+
+				for (i = 0; i < each_value.length; i += 1) {
+					const child_ctx = get_each_context$4(ctx, each_value, i);
+
+					if (each_blocks[i]) {
+						each_blocks[i].p(child_ctx, dirty);
+					} else {
+						each_blocks[i] = create_each_block$4(child_ctx);
+						each_blocks[i].c();
+						each_blocks[i].m(div, null);
+					}
+				}
+
+				for (; i < each_blocks.length; i += 1) {
+					each_blocks[i].d(1);
+				}
+
+				each_blocks.length = each_value.length;
+			}
+
+			if (dirty & /*filteredSquaresArr*/ 1 && div_class_value !== (div_class_value = "BC-Matrix  markdown-preview-view " + (/*filteredSquaresArr*/ ctx[0].length
+			? ""
+			: "BC-empty-view") + " svelte-sp0k97")) {
+				attr(div, "class", div_class_value);
+			}
 		},
+		i: noop,
+		o: noop,
 		d(detaching) {
-			if (if_block) if_block.d(detaching);
-			if (detaching) detach(if_block_anchor);
+			if (detaching) detach(div);
+			destroy_each(each_blocks, detaching);
 		}
 	};
 }
 
-function create_fragment$7(ctx) {
-	let t;
-	let div;
-	let current;
-	let if_block = /*title*/ ctx[2] !== "false" && create_if_block_2(ctx);
-	let each_value = /*lines*/ ctx[4];
-	let each_blocks = [];
-
-	for (let i = 0; i < each_value.length; i += 1) {
-		each_blocks[i] = create_each_block$4(get_each_context$4(ctx, each_value, i));
-	}
-
-	const out = i => transition_out(each_blocks[i], 1, 1, () => {
-		each_blocks[i] = null;
-	});
-
-	return {
-		c() {
-			if (if_block) if_block.c();
-			t = space();
-			div = element("div");
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].c();
-			}
-
-			attr(div, "class", "BC-tree svelte-yt7jmz");
-		},
-		m(target, anchor) {
-			if (if_block) if_block.m(target, anchor);
-			insert(target, t, anchor);
-			insert(target, div, anchor);
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				each_blocks[i].m(div, null);
-			}
-
-			current = true;
-		},
-		p(ctx, [dirty]) {
-			if (/*title*/ ctx[2] !== "false") {
-				if (if_block) {
-					if_block.p(ctx, dirty);
-				} else {
-					if_block = create_if_block_2(ctx);
-					if_block.c();
-					if_block.m(t.parentNode, t);
-				}
-			} else if (if_block) {
-				if_block.d(1);
-				if_block = null;
-			}
-
-			if (dirty & /*content, app, lines, openOrSwitch, plugin, isInVault, dropDendron, settings, meetsConditions*/ 473) {
-				each_value = /*lines*/ ctx[4];
-				let i;
-
-				for (i = 0; i < each_value.length; i += 1) {
-					const child_ctx = get_each_context$4(ctx, each_value, i);
-
-					if (each_blocks[i]) {
-						each_blocks[i].p(child_ctx, dirty);
-						transition_in(each_blocks[i], 1);
-					} else {
-						each_blocks[i] = create_each_block$4(child_ctx);
-						each_blocks[i].c();
-						transition_in(each_blocks[i], 1);
-						each_blocks[i].m(div, null);
-					}
-				}
-
-				group_outros();
-
-				for (i = each_value.length; i < each_blocks.length; i += 1) {
-					out(i);
-				}
-
-				check_outros();
-			}
-		},
-		i(local) {
-			if (current) return;
-
-			for (let i = 0; i < each_value.length; i += 1) {
-				transition_in(each_blocks[i]);
-			}
-
-			current = true;
-		},
-		o(local) {
-			each_blocks = each_blocks.filter(Boolean);
-
-			for (let i = 0; i < each_blocks.length; i += 1) {
-				transition_out(each_blocks[i]);
-			}
-
-			current = false;
-		},
-		d(detaching) {
-			if (if_block) if_block.d(detaching);
-			if (detaching) detach(t);
-			if (detaching) detach(div);
-			destroy_each(each_blocks, detaching);
-		}
-	};
+function instance$7($$self, $$props, $$invalidate) {
+	
+	
+	
+	let { filteredSquaresArr } = $$props;
+	let { currFile } = $$props;
+	let { settings } = $$props;
+	let { matrixView } = $$props;
+	let { app } = $$props;
+	const { showImpliedRelations, rlLeaf, treatCurrNodeAsImpliedSibling, showRelationType } = settings;
+	const click_handler = async (realItem, e) => openOrSwitch(app, realItem.to, e);
+	const mouseover_handler = (realItem, event) => hoverPreview(event, matrixView, realItem.to);
+	const click_handler_1 = async (impliedItem, e) => openOrSwitch(app, impliedItem.to, e);
+	const mouseover_handler_1 = (impliedItem, e) => hoverPreview(e, matrixView, impliedItem.to);
+
+	$$self.$$set = $$props => {
+		if ("filteredSquaresArr" in $$props) $$invalidate(0, filteredSquaresArr = $$props.filteredSquaresArr);
+		if ("currFile" in $$props) $$invalidate(1, currFile = $$props.currFile);
+		if ("settings" in $$props) $$invalidate(2, settings = $$props.settings);
+		if ("matrixView" in $$props) $$invalidate(3, matrixView = $$props.matrixView);
+		if ("app" in $$props) $$invalidate(4, app = $$props.app);
+	};
+
+	return [
+		filteredSquaresArr,
+		currFile,
+		settings,
+		matrixView,
+		app,
+		showImpliedRelations,
+		rlLeaf,
+		treatCurrNodeAsImpliedSibling,
+		showRelationType,
+		click_handler,
+		mouseover_handler,
+		click_handler_1,
+		mouseover_handler_1
+	];
+}
+
+class Matrix extends SvelteComponent {
+	constructor(options) {
+		super();
+		if (!document.getElementById("svelte-sp0k97-style")) add_css$3();
+
+		init(this, options, instance$7, create_fragment$7, safe_not_equal, {
+			filteredSquaresArr: 0,
+			currFile: 1,
+			settings: 2,
+			matrixView: 3,
+			app: 4
+		});
+	}
+}
+
+class MatrixView extends obsidian.ItemView {
+    constructor(leaf, plugin) {
+        super(leaf);
+        this.icon = TRAIL_ICON;
+        this.toInternalLinkObj = (to, realQ = true, parent, implied) => {
+            return {
+                to,
+                cls: linkClass(this.app, to, realQ),
+                alt: this.getAlt(to),
+                order: this.getOrder(to),
+                parent,
+                implied,
+            };
+        };
+        this.getOrder = (node) => Number.parseInt(this.plugin.mainG.getNodeAttribute(node, "order"));
+        this.plugin = plugin;
+        this.db = new Debugger(plugin);
+    }
+    async onload() {
+        super.onload();
+        this.matrixQ = this.plugin.settings.defaultView;
+        this.app.workspace.onLayoutReady(() => {
+            setTimeout(async () => await this.draw(), this.app.plugins.plugins.dataview
+                ? this.app.plugins.plugins.dataview.api
+                    ? 1
+                    : this.plugin.settings.dvWaitTime
+                : 3000);
+        });
+    }
+    getViewType() {
+        return MATRIX_VIEW;
+    }
+    getDisplayText() {
+        return "Breadcrumbs Matrix";
+    }
+    async onOpen() { }
+    onClose() {
+        var _a;
+        (_a = this.view) === null || _a === void 0 ? void 0 : _a.$destroy();
+        return Promise.resolve();
+    }
+    getAlt(node) {
+        var _a, _b;
+        const { altLinkFields, showAllAliases } = this.plugin.settings;
+        if (altLinkFields.length) {
+            // dv First
+            const dv = (_a = this.app.plugins.plugins.dataview) === null || _a === void 0 ? void 0 : _a.api;
+            if (dv) {
+                const page = dv.page(node);
+                if (!page)
+                    return null;
+                for (const alt of altLinkFields) {
+                    const value = page[alt];
+                    const arr = typeof value === "string" ? splitAndTrim(value) : value;
+                    if (value)
+                        return showAllAliases ? arr.join(", ") : arr[0];
+                }
+            }
+            else {
+                const file = this.app.metadataCache.getFirstLinkpathDest(node, "");
+                if (file) {
+                    const metadata = this.app.metadataCache.getFileCache(file);
+                    for (const altField of altLinkFields) {
+                        const value = (_b = metadata === null || metadata === void 0 ? void 0 : metadata.frontmatter) === null || _b === void 0 ? void 0 : _b[altField];
+                        const arr = typeof value === "string" ? splitAndTrim(value) : value;
+                        if (value)
+                            return showAllAliases ? arr.join(", ") : arr[0];
+                    }
+                }
+            }
+        }
+        else
+            return null;
+    }
+    // ANCHOR Remove duplicate implied links
+    removeDuplicateImplied(reals, implieds) {
+        const realTos = reals.map((real) => real.to);
+        return implieds.filter((implied) => !realTos.includes(implied.to));
+    }
+    getMatrixNeighbours(plugin, currNode) {
+        const { closedG } = plugin;
+        const { userHiers } = plugin.settings;
+        const neighbours = blankRealNImplied();
+        if (!closedG)
+            return neighbours;
+        closedG.forEachEdge(currNode, (k, a, s, t) => {
+            var _a;
+            const { field, dir, implied } = a;
+            if (s === currNode) {
+                neighbours[dir].reals.push({ to: t, field, implied });
+            }
+            else {
+                neighbours[getOppDir(dir)].implieds.push({
+                    to: s,
+                    field: (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, dir),
+                    implied,
+                });
+            }
+        });
+        return neighbours;
+    }
+    getHierSquares(userHiers, currFile) {
+        const { plugin } = this;
+        const { mainG, settings } = plugin;
+        const { alphaSortAsc, enableAlphaSort, treatCurrNodeAsImpliedSibling, squareDirectionsOrder, sortByNameShowAlias, } = settings;
+        if (!mainG)
+            return [];
+        const { basename } = currFile;
+        // const realsnImplieds = getRealnImplied(plugin, basename);
+        const realsnImplieds = this.getMatrixNeighbours(plugin, basename);
+        return userHiers.map((hier) => {
+            const filteredRealNImplied = blankRealNImplied();
+            const resultsFilter = (item, dir, oppDir, arrow) => hier[dir].includes(item.field) ||
+                (item.field.includes(`<${arrow}>`) &&
+                    hier[oppDir].includes(item.field.split(" <")[0]));
+            for (const dir in realsnImplieds) {
+                const oppDir = getOppDir(dir);
+                const arrow = ARROW_DIRECTIONS[dir];
+                const { reals, implieds } = realsnImplieds[dir];
+                filteredRealNImplied[dir].reals = reals
+                    .filter((real) => resultsFilter(real, dir, oppDir, arrow))
+                    .map((item) => this.toInternalLinkObj(item.to, true, null, item.implied));
+                filteredRealNImplied[dir].implieds = implieds
+                    .filter((implied) => resultsFilter(implied, dir, oppDir, arrow))
+                    .map((item) => this.toInternalLinkObj(item.to, false, null, item.implied));
+            }
+            let { up: { reals: ru, implieds: iu }, same: { reals: rs, implieds: is }, down: { reals: rd, implieds: id }, next: { reals: rn, implieds: iN }, prev: { reals: rp, implieds: ip }, } = filteredRealNImplied;
+            // !SECTION
+            [iu, is, id, iN, ip] = [
+                this.removeDuplicateImplied(ru, iu),
+                this.removeDuplicateImplied(rs, is),
+                this.removeDuplicateImplied(rd, id),
+                this.removeDuplicateImplied(rn, iN),
+                this.removeDuplicateImplied(rp, ip),
+            ];
+            const iSameNoDup = [];
+            is.forEach((impSib) => {
+                if (iSameNoDup.every((noDup) => noDup.to !== impSib.to)) {
+                    iSameNoDup.push(impSib);
+                }
+            });
+            is = iSameNoDup;
+            const getFieldInHier = (dir) => hier[dir][0]
+                ? hier[dir].join(", ")
+                : `${hier[getOppDir(dir)].join(",")}${ARROW_DIRECTIONS[dir]}`;
+            const squares = [ru, rs, rd, rn, rp, iu, is, id, iN, ip];
+            if (enableAlphaSort) {
+                squares.forEach((sq) => sq.sort((a, b) => {
+                    var _a, _b;
+                    return (sortByNameShowAlias ? a.to : (_a = a.alt) !== null && _a !== void 0 ? _a : a.to) <
+                        (sortByNameShowAlias ? b.to : (_b = b.alt) !== null && _b !== void 0 ? _b : b.to)
+                        ? alphaSortAsc
+                            ? -1
+                            : 1
+                        : alphaSortAsc
+                            ? 1
+                            : -1;
+                }));
+            }
+            squares.forEach((sq) => sq.sort((a, b) => a.order - b.order));
+            loglevel.info([
+                { ru },
+                { rs },
+                { rd },
+                { rn },
+                { rp },
+                { iu },
+                { is },
+                { id },
+                { iN },
+                { ip },
+            ]);
+            const square = [
+                {
+                    realItems: ru,
+                    impliedItems: iu,
+                    field: getFieldInHier("up"),
+                },
+                {
+                    realItems: rs,
+                    impliedItems: is,
+                    field: getFieldInHier("same"),
+                },
+                {
+                    realItems: rd,
+                    impliedItems: id,
+                    field: getFieldInHier("down"),
+                },
+                {
+                    realItems: rn,
+                    impliedItems: iN,
+                    field: getFieldInHier("next"),
+                },
+                {
+                    realItems: rp,
+                    impliedItems: ip,
+                    field: getFieldInHier("prev"),
+                },
+            ];
+            return squareDirectionsOrder.map((order) => square[order]);
+        });
+    }
+    drawButtons(contentEl) {
+        const { plugin, matrixQ } = this;
+        const { settings } = plugin;
+        const { alphaSortAsc } = settings;
+        contentEl.createEl("button", {
+            text: matrixQ ? "List" : "Matrix",
+            attr: {
+                "aria-label": "Mode",
+                style: "padding: 1px 6px 2px 6px !important; margin-left: 7px;",
+            },
+        }, (el) => {
+            el.onclick = async () => {
+                this.matrixQ = !matrixQ;
+                el.innerText = matrixQ ? "List" : "Matrix";
+                await this.draw();
+            };
+        });
+        contentEl.createEl("button", {
+            text: "↻",
+            attr: {
+                "aria-label": "Refresh Index",
+                style: "padding: 1px 6px 2px 6px;",
+            },
+        }, (el) => (el.onclick = async () => await refreshIndex(plugin)));
+        contentEl.createEl("button", {
+            text: alphaSortAsc ? "↗" : "↘",
+            attr: {
+                "aria-label": "Alphabetical sorting order",
+                style: "padding: 1px 6px 2px 6px;",
+            },
+        }, (el) => {
+            el.onclick = async () => {
+                plugin.settings.alphaSortAsc = !alphaSortAsc;
+                await this.plugin.saveSettings();
+                el.innerText = alphaSortAsc ? "↗" : "↘";
+                await this.draw();
+            };
+        });
+    }
+    async draw() {
+        try {
+            const { contentEl, db, plugin } = this;
+            db.start2G("Draw Matrix/List View");
+            contentEl.empty();
+            const { settings } = plugin;
+            const { userHiers } = settings;
+            const currFile = this.app.workspace.getActiveFile();
+            if (!currFile)
+                return;
+            this.drawButtons(contentEl);
+            const hierSquares = this.getHierSquares(userHiers, currFile).filter((squareArr) => squareArr.some((sq) => sq.realItems.length + sq.impliedItems.length > 0));
+            const compInput = {
+                target: contentEl,
+                props: {
+                    filteredSquaresArr: hierSquares,
+                    currFile,
+                    settings,
+                    matrixView: this,
+                    app: this.app,
+                },
+            };
+            this.matrixQ
+                ? (this.view = new Matrix(compInput))
+                : (this.view = new Lists(compInput));
+            db.end2G();
+        }
+        catch (err) {
+            loglevel.error(err);
+            this.db.end2G();
+        }
+    }
+}
+
+function addMatrixViewSettings(plugin, viewDetails) {
+    const { settings } = plugin;
+    const MLViewDetails = subDetails("Matrix/List View", viewDetails);
+    new obsidian.Setting(MLViewDetails)
+        .setName("Show Matrix or List view by default")
+        .setDesc("When Obsidian first loads, which view should it show? ✅ = Matrix, ❌ = List")
+        .addToggle((toggle) => toggle.setValue(settings.defaultView).onChange(async (value) => {
+        settings.defaultView = value;
+        await plugin.saveSettings();
+    }));
+    // TODO I don't think this setting works anymore. I removed it's functionality when adding multiple hierarchies
+    // new Setting(MLViewDetails)
+    //   .setName("Show all field names or just relation types")
+    //   .setDesc(
+    //     "This changes the headers in matrix/list view. You can have the headers be the list of metadata fields for each relation type (e.g. `parent, broader, upper`). Or you can have them just be the name of the relation type, i.e. 'Parent', 'Sibling', 'Child'. ✅ = show the full list of names."
+    //   )
+    //   .addToggle((toggle) =>
+    //     toggle.setValue(settings.showNameOrType).onChange(async (value) => {
+    //       settings.showNameOrType = value;
+    //       await plugin.saveSettings();
+    //       await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
+    //     })
+    //   );
+    new obsidian.Setting(MLViewDetails)
+        .setName("Show Relationship Type")
+        .setDesc(fragWithHTML("Show whether a link is real or implied. A real link is one you explicitly put in a note. E.g. <code>parent:: [[Note]]</code>. An implied link is the reverse of a real link. For example, if A is the real parent of B, then B must be the implied child of A."))
+        .addToggle((toggle) => toggle.setValue(settings.showRelationType).onChange(async (value) => {
+        settings.showRelationType = value;
+        await plugin.saveSettings();
+        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
+    }));
+    new obsidian.Setting(MLViewDetails)
+        .setName("Directions Order")
+        .setDesc(fragWithHTML(`Change the order in which the directions appear in the M/L view. Use numbers to change the order, the default is "up, same, down, next, prev" (<code>01234</code>).
+          <ul>
+            <li>0 = up</li>
+            <li>1 = same</li>
+            <li>2 = down</li>
+            <li>3 = next</li>
+            <li>4 = prev</li>
+          </ul>
+          <strong>Note:</strong> You can remove numbers to hide those directions in the Matrix View. For example, <code>02</code> will only show up and down, in that order.`))
+        .addText((text) => {
+        text.setValue(settings.squareDirectionsOrder.join(""));
+        text.inputEl.onblur = async () => {
+            const value = text.getValue();
+            const values = value.split("");
+            if (value.length <= 5 &&
+                values.every((value) => ["0", "1", "2", "3", "4"].includes(value))) {
+                settings.squareDirectionsOrder = values.map((order) => Number.parseInt(order));
+                await plugin.saveSettings();
+                await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
+            }
+            else {
+                new obsidian.Notice('The value must be a 5 digit number using only the digits "0", "1", "2", "3", "4"');
+            }
+        };
+    });
+    new obsidian.Setting(MLViewDetails)
+        .setName("Enable Alpahebtical Sorting")
+        .setDesc("By default, items in the Matrix view are sorted by the order they appear in your notes. Toggle this on to enable Alphabetical sorting. You can choose ascending/descending order in the setting below.")
+        .addToggle((toggle) => toggle.setValue(settings.enableAlphaSort).onChange(async (value) => {
+        settings.enableAlphaSort = value;
+        await plugin.saveSettings();
+        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
+    }));
+    // TODO hide this setting if !enableAlphaSort
+    new obsidian.Setting(MLViewDetails)
+        .setName("Sort Alphabetically Ascending/Descending")
+        .setDesc("Sort square items alphabetically in Ascending (✅) or Descending (❌) order, by default.")
+        .addToggle((toggle) => toggle.setValue(settings.alphaSortAsc).onChange(async (value) => {
+        settings.alphaSortAsc = value;
+        await plugin.saveSettings();
+        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
+    }));
+    new obsidian.Setting(MLViewDetails)
+        .setName("Sort by note name, but show alias")
+        .setDesc("When this is turned off, notes will first be sorted by their alias, and then by their name if no alias is found. Turn this on to sort by note name always, but still show the alias in the results.")
+        .addToggle((toggle) => toggle.setValue(settings.sortByNameShowAlias).onChange(async (value) => {
+        settings.sortByNameShowAlias = value;
+        await plugin.saveSettings();
+        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
+    }));
+    new obsidian.Setting(MLViewDetails)
+        .setName("Show Implied Relations")
+        .setDesc("Whether or not to show implied relations at all.")
+        .addToggle((toggle) => toggle.setValue(settings.showImpliedRelations).onChange(async (value) => {
+        settings.showImpliedRelations = value;
+        await plugin.saveSettings();
+        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
+    }));
+    new obsidian.Setting(MLViewDetails)
+        .setName("Filter Implied Siblings")
+        .setDesc(fragWithHTML(`Implied siblings are:
+          <ol>
+            <li>notes with the same parent, or</li>
+            <li>notes that are real siblings.</li>
+          </ol>
+          This setting only applies to type 1 implied siblings. If enabled, Breadcrumbs will filter type 1 implied siblings so that they not only share the same parent, but the parent relation has the exact same type. For example, the two real relations <code>B -parent-> A</code>, and <code>C -parent-> A</code> create an implied sibling between B and C (they have the same parent, A). The two real relations <code>B -parent-> A</code>, and <code>C -up-> A</code> create an implied sibling between B and C (they also have the same parent, A). But if this setting is turned on, the second implied sibling would not show, because the parent types are differnet (parent versus up).`))
+        .addToggle((toggle) => toggle
+        .setValue(settings.filterImpliedSiblingsOfDifferentTypes)
+        .onChange(async (value) => {
+        settings.filterImpliedSiblingsOfDifferentTypes = value;
+        await plugin.saveSettings();
+        await plugin.getActiveTYPEView(MATRIX_VIEW).draw();
+    }));
+    new obsidian.Setting(MLViewDetails)
+        .setName("Open View in Right or Left side")
+        .setDesc("When loading the matrix view, should it open on the left or right side leaf? ✅ = Right, ❌ = Left.")
+        .addToggle((toggle) => toggle.setValue(settings.rlLeaf).onChange(async (value) => {
+        settings.rlLeaf = value;
+        await plugin.saveSettings();
+        await this.app.workspace.detachLeavesOfType(MATRIX_VIEW);
+        await openView(this.app, MATRIX_VIEW, MatrixView, value ? "right" : "left");
+    }));
 }
 
-const mouseover_handler = e => {
-	
-}; //   hoverPreview needs an itemView so it can access `app`...
-//   hoverPreview(e, el, link)
-
-const mouseover_handler_1 = e => {
-	
-}; //   hoverPreview needs an itemView so it can access `app`...
-//   hoverPreview(e, el, link)
-
-function instance$7($$self, $$props, $$invalidate) {
-	
-	
-	let { plugin } = $$props;
-	let { el } = $$props;
-	let { dir } = $$props;
-	let { fields } = $$props;
-	let { title } = $$props;
-	let { content } = $$props;
-	let { lines } = $$props;
-	let { froms } = $$props;
-	let { min } = $$props;
-	let { max } = $$props;
-	let { basename } = $$props;
-	const { settings, app } = plugin;
-	const indentToDepth = indent => indent.length / 2 + 1;
-
-	const meetsConditions = (indent, node) => {
-		const depth = indentToDepth(indent);
-		return depth >= min && depth <= max && (froms === undefined || froms.includes(node));
-	};
-
-	const click_handler = async (link, e) => await openOrSwitch(plugin.app, link, e);
-	const click_handler_1 = async (link, e) => await openOrSwitch(plugin.app, link, e);
-
-	$$self.$$set = $$props => {
-		if ("plugin" in $$props) $$invalidate(0, plugin = $$props.plugin);
-		if ("el" in $$props) $$invalidate(9, el = $$props.el);
-		if ("dir" in $$props) $$invalidate(1, dir = $$props.dir);
-		if ("fields" in $$props) $$invalidate(10, fields = $$props.fields);
-		if ("title" in $$props) $$invalidate(2, title = $$props.title);
-		if ("content" in $$props) $$invalidate(3, content = $$props.content);
-		if ("lines" in $$props) $$invalidate(4, lines = $$props.lines);
-		if ("froms" in $$props) $$invalidate(11, froms = $$props.froms);
-		if ("min" in $$props) $$invalidate(12, min = $$props.min);
-		if ("max" in $$props) $$invalidate(13, max = $$props.max);
-		if ("basename" in $$props) $$invalidate(5, basename = $$props.basename);
-	};
+function addNoSystemSettings(plugin, alternativeHierarchyDetails) {
+    const { settings } = plugin;
+    const { userHiers } = settings;
+    const fields = getFields(userHiers);
+    const noSystemDetails = subDetails("Naming System", alternativeHierarchyDetails);
+    new obsidian.Setting(noSystemDetails)
+        .setName("Naming System Regex")
+        .setDesc(fragWithHTML("If you name your notes using the Johnny Decimal System or a related system, enter a regular expression matching the longest possible naming system you use. The regex should only match the naming system part of the name, not the actual note title.</br> For example, if you use the Johnny Decimal System, you might use <code>/^\\d\\.\\d\\.\\w/g</code> to match the note named <code>1.2.a Cars</code>.</br>If you don't want to choose a default, select the blank option at the bottom of the list."))
+        .addText((text) => {
+        text.setValue(settings.namingSystemRegex);
+        text.inputEl.onblur = async () => {
+            const value = text.getValue();
+            if (value === "" || strToRegex(value)) {
+                settings.namingSystemRegex = value;
+                await plugin.saveSettings();
+                await refreshIndex(plugin);
+            }
+            else {
+                new obsidian.Notice("Invalid Regex");
+            }
+        };
+    });
+    new obsidian.Setting(noSystemDetails)
+        .setName("Naming System Delimiter")
+        .setDesc(fragWithHTML("What character do you use to split up your naming convention? For example, if you use <code>1.2.a.b</code>, then your delimiter is a period (<code>.</code>)."))
+        .addText((text) => {
+        text.setValue(settings.namingSystemSplit);
+        text.inputEl.onblur = async () => {
+            const value = text.getValue();
+            settings.namingSystemSplit = value;
+            await plugin.saveSettings();
+            await refreshIndex(plugin);
+        };
+    });
+    new obsidian.Setting(noSystemDetails)
+        .setName("Naming System Field")
+        .setDesc("Which field should Breadcrumbs use for Naming System notes?")
+        .addDropdown((dd) => {
+        fields.forEach((field) => {
+            dd.addOption(field, field);
+        });
+        dd.setValue(settings.namingSystemField);
+        dd.onChange(async (value) => {
+            settings.namingSystemField = value;
+            await plugin.saveSettings();
+            await refreshIndex(plugin);
+        });
+    });
+    new obsidian.Setting(noSystemDetails)
+        .setName("Naming System Ends with Delimiter")
+        .setDesc(fragWithHTML("Does your naming convention end with the delimiter? For example, <code>1.2. Note</code> does end with the delimiter, but <code>1.2 Note</code> does not.</br>For matching purposes, it is highly recommended to name your notes with the delimiter on the end. Only turn this setting on if you do name your notes this way, but know that the results may not be as accurate if you don't."))
+        .addToggle((tog) => tog
+        .setValue(settings.namingSystemEndsWithDelimiter)
+        .onChange(async (value) => {
+        settings.namingSystemEndsWithDelimiter = value;
+        await plugin.saveSettings();
+        await refreshIndex(plugin);
+    }));
+}
 
-	return [
-		plugin,
-		dir,
-		title,
-		content,
-		lines,
-		basename,
-		settings,
-		app,
-		meetsConditions,
-		el,
-		fields,
-		froms,
-		min,
-		max,
-		click_handler,
-		click_handler_1
-	];
+function addRegexNoteSettings(plugin, alternativeHierarchyDetails) {
+    const { settings } = plugin;
+    const regexNoteDetails = subDetails("Regex Notes", alternativeHierarchyDetails);
+    new obsidian.Setting(regexNoteDetails)
+        .setName("Default Regex Note Field")
+        .setDesc(fragWithHTML("By default, regex notes use the first field in your hierarchies (usually an <code>↑</code> field). Choose a different one to use by default, without having to specify <code>BC-regex-note-field: {field}</code>.</br>If you don't want to choose a default, select the blank option at the bottom of the list."))
+        .addDropdown((dd) => {
+        const options = {};
+        getFields(settings.userHiers).forEach((field) => (options[field] = field));
+        dd.addOptions(Object.assign(options, { "": "" }));
+        dd.onChange(async (field) => {
+            settings.regexNoteField = field;
+            await plugin.saveSettings();
+            await refreshIndex(plugin);
+        });
+    });
 }
 
-class CBTree extends SvelteComponent {
-	constructor(options) {
-		super();
-		if (!document.getElementById("svelte-yt7jmz-style")) add_css$3();
+function addRelationSettings(plugin, containerEl) {
+    const { settings } = plugin;
+    const relationDetails = details("Relationships", containerEl);
+    // MarkdownRenderer.renderMarkdown(
+    //   "```mermaid\nflowchart BT\nMe -->|up| Dad\nDad -->|same| Aunt\nMe -->|up| Aunt\n```",
+    //   containerEl,
+    //   "",
+    //   null
+    // );
+    relationDetails.createEl("p", {
+        text: "Here you can toggle on/off different ypes of implied relationships. All of your explicit (real) relationships will still show, but you can choose which implied ones get filled in.\nAll implied relationships are given a CSS class of the type of implied relaiton, so you can style the differently. For example `.BC-Aunt`.",
+    });
+    new obsidian.Setting(relationDetails)
+        .setName("Same Parent is Siblings")
+        .setDesc("If one note shares a parent with another, treat them as siblings")
+        .addToggle((tg) => tg
+        .setValue(settings.impliedRelations.sameParentIsSibling)
+        .onChange(async (val) => {
+        settings.impliedRelations.sameParentIsSibling = val;
+        await plugin.saveSettings();
+        await refreshIndex(plugin);
+    }));
+    new obsidian.Setting(relationDetails)
+        .setName("Siblings' Siblings")
+        .setDesc("Treat your siblings' siblings as your siblings")
+        .addToggle((tg) => tg
+        .setValue(settings.impliedRelations.siblingsSiblingIsSibling)
+        .onChange(async (val) => {
+        settings.impliedRelations.siblingsSiblingIsSibling = val;
+        await plugin.saveSettings();
+        await refreshIndex(plugin);
+    }));
+    new obsidian.Setting(relationDetails)
+        .setName("Aunt/Uncle")
+        .setDesc("Treat your parent's siblings as your parents (aunts/uncles)")
+        .addToggle((tg) => tg
+        .setValue(settings.impliedRelations.parentsSiblingsIsParents)
+        .onChange(async (val) => {
+        settings.impliedRelations.parentsSiblingsIsParents = val;
+        await plugin.saveSettings();
+        await refreshIndex(plugin);
+    }));
+    new obsidian.Setting(relationDetails)
+        .setName("Cousins")
+        .setDesc("Treat the cousins of a note as siblings (parents' siblings' children are cousins)")
+        .addToggle((tg) => tg
+        .setValue(settings.impliedRelations.cousinsIsSibling)
+        .onChange(async (val) => {
+        settings.impliedRelations.cousinsIsSibling = val;
+        await plugin.saveSettings();
+        await refreshIndex(plugin);
+    }));
+    new obsidian.Setting(relationDetails)
+        .setName("Make Current Note an Implied Sibling")
+        .setDesc("Techincally, the current note is always it's own implied sibling. By default, it is not show as such. Toggle this on to make it show.")
+        .addToggle((toggle) => toggle
+        .setValue(settings.treatCurrNodeAsImpliedSibling)
+        .onChange(async (value) => {
+        settings.treatCurrNodeAsImpliedSibling = value;
+        await plugin.saveSettings();
+        await refreshIndex(plugin);
+    }));
+}
 
-		init(this, options, instance$7, create_fragment$7, safe_not_equal, {
-			plugin: 0,
-			el: 9,
-			dir: 1,
-			fields: 10,
-			title: 2,
-			content: 3,
-			lines: 4,
-			froms: 11,
-			min: 12,
-			max: 13,
-			basename: 5
-		});
-	}
+function addTagNoteSettings(plugin, alternativeHierarchyDetails) {
+    const { settings } = plugin;
+    const tagNoteDetails = subDetails("Tag Notes", alternativeHierarchyDetails);
+    new obsidian.Setting(tagNoteDetails)
+        .setName("Default Tag Note Field")
+        .setDesc(fragWithHTML("By default, tag notes use the first field in your hierarchies (usually an <code>↑</code> field). Choose a different one to use by default, without having to specify <code>BC-tag-note-field: {field}</code>.</br>If you don't want to choose a default, select the blank option at the bottom of the list."))
+        .addDropdown((dd) => {
+        const options = {};
+        getFields(settings.userHiers).forEach((field) => (options[field] = field));
+        dd.addOptions(Object.assign(options, { "": "" }));
+        dd.onChange(async (field) => {
+            settings.tagNoteField = field;
+            await plugin.saveSettings();
+            await refreshIndex(plugin);
+        });
+    });
 }
 
-function getCodeblockCB(plugin) {
+function addThreadingSettings(plugin, cmdsDetails) {
     const { settings } = plugin;
-    return (source, el, ctx) => {
-        var _a, _b;
-        const parsedSource = parseCodeBlockSource(source);
-        console.log(parsedSource);
-        const err = codeblockError(plugin, parsedSource);
-        if (err !== "") {
-            el.innerHTML = err;
-            return;
-        }
-        let min = 0, max = Infinity;
-        let { depth, dir, from, implied, flat } = parsedSource;
-        if (depth !== undefined) {
-            const minNum = parseInt(depth[0]);
-            if (!isNaN(minNum))
-                min = minNum;
-            const maxNum = parseInt(depth[1]);
-            if (!isNaN(maxNum))
-                max = maxNum;
-        }
-        const currFile = plugin.app.metadataCache.getFirstLinkpathDest(ctx.sourcePath, "");
-        const { userHiers } = settings;
-        const { basename } = currFile;
-        let froms = undefined;
-        if (from !== undefined) {
-            try {
-                const api = (_a = plugin.app.plugins.plugins.dataview) === null || _a === void 0 ? void 0 : _a.api;
-                if (api) {
-                    const pages = (_b = api.pagePaths(from)) === null || _b === void 0 ? void 0 : _b.values;
-                    froms = pages.map(dropFolder);
-                }
-                else
-                    new obsidian.Notice("Dataview must be enabled for `from` to work.");
-            }
-            catch (e) {
-                new obsidian.Notice(`The query "${from}" failed.`);
-            }
-        }
-        const oppDir = getOppDir(dir);
-        const sub = implied === "false"
-            ? getSubInDirs(plugin.mainG, dir)
-            : getSubInDirs(plugin.mainG, dir, oppDir);
-        const closed = getReflexiveClosure(sub, userHiers);
-        const subClosed = getSubInDirs(closed, dir);
-        const allPaths = dfsAllPaths(subClosed, basename);
-        const index = createIndex(allPaths, false);
-        loglevel.info({ allPaths, index });
-        const lines = index
-            .split("\n")
-            .map((line) => {
-            const pair = line.split("- ");
-            return [flat === "true" ? "" : pair[0], pair.slice(1).join("- ")];
-        })
-            .filter((pair) => pair[1] !== "");
-        switch (parsedSource.type) {
-            case "tree":
-                new CBTree({
-                    target: el,
-                    props: Object.assign({ plugin,
-                        el,
-                        min,
-                        max,
-                        lines,
-                        froms,
-                        basename }, parsedSource),
-                });
-                break;
-            case "juggl":
-                createdJugglCB(plugin, el, parsedSource, lines, froms, basename, min, max);
-                break;
-        }
-    };
-}
-function parseCodeBlockSource(source) {
-    const lines = source.split("\n");
-    const getValue = (type) => {
-        var _a, _b, _c;
-        return (_c = (_b = (_a = lines
-            .find((l) => l.startsWith(`${type}:`))) === null || _a === void 0 ? void 0 : _a.split(":")) === null || _b === void 0 ? void 0 : _b[1]) === null || _c === void 0 ? void 0 : _c.trim();
-    };
-    const results = {};
-    CODEBLOCK_FIELDS.forEach((field) => {
-        results[field] = getValue(field);
-        if (results[field] === "false") {
-            results[field] = false;
-        }
-        if (results[field] === "true") {
-            results[field] = true;
-        }
+    const threadingDetails = subDetails("Threading", cmdsDetails);
+    threadingDetails.createDiv({
+        text: "Settings for the commands `Create new <field> from current note`",
+    });
+    new obsidian.Setting(threadingDetails)
+        .setName("Open new threads in new pane or current pane")
+        .addToggle((tog) => tog.onChange(async (value) => {
+        settings.threadIntoNewPane = value;
+        await plugin.saveSettings();
+    }));
+    new obsidian.Setting(threadingDetails)
+        .setName("New Note Name Template")
+        .setDesc(fragWithHTML(`When threading into a new note, choose the template for the new note name.</br>
+        The default is <code>{{field}} of {{current}}</code>.</br>
+        Options include:</br>
+        <ul>
+        <li><code>{{field}}</code>: the field being thread into</li>
+        <li><code>{{dir}}</code>: the direction being thread into</li>
+        <li><code>{{current}}</code>: the current note name</li>
+        <li><code>{{date}}</code>: the current date (Set the format in the setting below)</li>
+        </ul>`))
+        .addText((text) => {
+        text.setValue(settings.threadingTemplate);
+        text.inputEl.onblur = async () => {
+            settings.threadingTemplate = text.getValue();
+            await plugin.saveSettings();
+        };
+    });
+    const threadDirTemplatesSetting = new obsidian.Setting(threadingDetails)
+        .setClass("thread-dir-templates")
+        .setName("Templater Template per Direction")
+        .setDesc(fragWithHTML(`For each direction to be thread into, choose a Templater template to insert into the new note.</br>
+          Give the basename, or the full file path (e.g. <code>Templates/Parent Template</code>).`));
+    DIRECTIONS$1.forEach((dir) => threadDirTemplatesSetting.addText((text) => {
+        text
+            .setPlaceholder(ARROW_DIRECTIONS[dir])
+            .setValue(settings.threadingDirTemplates[dir]);
+        text.inputEl.onblur = async () => {
+            settings.threadingDirTemplates[dir] = text.getValue();
+            await plugin.saveSettings();
+        };
+    }));
+    new obsidian.Setting(threadingDetails)
+        .setName("Date Format")
+        .setDesc("The date format used in the Threading Template (setting above)")
+        .addMomentFormat((format) => {
+        format
+            .setDefaultFormat(DEFAULT_SETTINGS.dateFormat)
+            .setValue(settings.dateFormat)
+            .onChange(async (value) => {
+            settings.dateFormat = value;
+            await plugin.saveSettings();
+        });
+    });
+}
+
+function addTrailViewSettings(plugin, viewDetails) {
+    const { settings, app } = plugin;
+    const trailDetails = subDetails("Trail/Grid/Juggl", viewDetails);
+    new obsidian.Setting(trailDetails)
+        .setName("Show Breadcrumbs")
+        .setDesc("Show a set of different views at the top of the current note.")
+        .addToggle((toggle) => toggle.setValue(settings.showBCs).onChange(async (value) => {
+        settings.showBCs = value;
+        await plugin.saveSettings();
+        await drawTrail(plugin);
+    }));
+    new obsidian.Setting(trailDetails)
+        .setName("Show Breadcrumbs in Edit/Live-Preview Mode")
+        .setDesc("It always shows in preview mode, but should it also show in the other two?\n\nKeep in mind that there is currently a limitation where the Breadcrumbs view will be stuck to the top of the note in edit/LP mode, even if you scroll down.")
+        .addToggle((toggle) => toggle.setValue(settings.showBCsInEditLPMode).onChange(async (value) => {
+        settings.showBCsInEditLPMode = value;
+        await plugin.saveSettings();
+        await drawTrail(plugin);
+    }));
+    const limitTrailFieldsDiv = trailDetails.createDiv({
+        cls: "limit-ML-fields",
+    });
+    limitTrailFieldsDiv.createEl("strong", {
+        text: "Limit Trail View to only show certain fields",
+    });
+    new Checkboxes({
+        target: trailDetails,
+        props: {
+            plugin,
+            settingName: "limitTrailCheckboxes",
+            options: getFields(settings.userHiers, "up"),
+        },
+    });
+    new obsidian.Setting(trailDetails)
+        .setName("Views to show")
+        .setDesc("Choose which of the views to show at the top of the note.\nTrail, Grid, Juggl graph and/or the Next-Previous view. " +
+        "Juggl requires having the Juggl plugin installed.")
+        .addToggle((toggle) => {
+        toggle
+            .setTooltip("Show Trail view")
+            .setValue(settings.showTrail)
+            .onChange(async (value) => {
+            settings.showTrail = value;
+            await plugin.saveSettings();
+            await drawTrail(plugin);
+        });
+    })
+        .addToggle((toggle) => {
+        toggle
+            .setTooltip("Show Grid view")
+            .setValue(settings.showGrid)
+            .onChange(async (value) => {
+            settings.showGrid = value;
+            await plugin.saveSettings();
+            await drawTrail(plugin);
+        });
+    })
+        .addToggle((toggle) => {
+        toggle
+            .setTooltip("Show Juggl view")
+            .setValue(settings.showJuggl)
+            .onChange(async (value) => {
+            settings.showJuggl = value;
+            await plugin.saveSettings();
+            await drawTrail(plugin);
+        });
+    })
+        .addToggle((toggle) => {
+        toggle
+            .setTooltip("Show Next/Previous view")
+            .setValue(settings.showPrevNext)
+            .onChange(async (value) => {
+            settings.showPrevNext = value;
+            await plugin.saveSettings();
+            await drawTrail(plugin);
+        });
+    });
+    new obsidian.Setting(trailDetails)
+        .setName("Grid view dots")
+        .setDesc("If the grid view is visible, shows dots based on the file size of each cell.")
+        .addToggle((toggle) => toggle.setValue(settings.gridDots).onChange(async (value) => {
+        settings.gridDots = value;
+        await plugin.saveSettings();
+        await drawTrail(plugin);
+    }));
+    const dotsColour = trailDetails.createDiv();
+    dotsColour.createEl("h4", {
+        text: "Dots colour",
+    });
+    const dotsColourPicker = dotsColour.createEl("input", {
+        type: "color",
+    });
+    dotsColourPicker.value = settings.dotsColour;
+    dotsColourPicker.addEventListener("change", async () => {
+        settings.dotsColour = dotsColourPicker.value;
+        await plugin.saveSettings();
+    });
+    new obsidian.Setting(trailDetails)
+        .setName("Grid view heatmap")
+        .setDesc("If the grid view is visible, change the background colour of squares based on the number of children leaving that note.")
+        .addToggle((toggle) => toggle.setValue(settings.gridHeatmap).onChange(async (value) => {
+        settings.gridHeatmap = value;
+        await plugin.saveSettings();
+        await drawTrail(plugin);
+    }));
+    const heatmapColour = trailDetails.createDiv();
+    heatmapColour.createEl("h4", {
+        text: "Heat map colour",
     });
-    results.field = results.field
-        ? splitAndTrim(results.field)
-        : undefined;
-    if (results.depth) {
-        const match = results.depth.match(/(\d*)-?(\d*)/);
-        results.depth = [match[1], match[2]];
-    }
-    return results;
-}
-function codeblockError(plugin, parsedSource) {
-    var _a;
-    const { dir, fields, type, title, depth, flat, content, from, implied } = parsedSource;
-    const { userHiers } = plugin.settings;
-    let err = "";
-    if (!CODEBLOCK_TYPES.includes(type))
-        err += `<code>type: ${type}</code> is not a valid type. It must be one of: ${CODEBLOCK_TYPES.map((type) => `<code>${type}</code>`).join(", ")}.</br>`;
-    const validDir = DIRECTIONS$1.includes(dir);
-    if (!validDir)
-        err += `<code>dir: ${dir}</code> is not a valid direction.</br>`;
-    const allFields = getFields(userHiers);
-    (_a = [fields].flat()) === null || _a === void 0 ? void 0 : _a.forEach((f) => {
-        if (f !== undefined && !allFields.includes(f))
-            err += `<code>fields: ${f}</code> is not a field in your hierarchies.</br>`;
+    const heatmapColourPicker = heatmapColour.createEl("input", {
+        type: "color",
     });
-    if (title !== undefined && title !== "false")
-        err += `<code>title: ${title}</code> is not a valid value. It has to be <code>false</code>, or leave the entire line out.</br>`;
-    if (depth !== undefined && depth.every((num) => isNaN(parseInt(num))))
-        err += `<code>depth: ${depth}</code> is not a valid value. It has to be a number.</br>`;
-    if (flat !== undefined && flat !== "true")
-        err += `<code>flat: ${flat}</code> is not a valid value. It has to be <code>true</code>, or leave the entire line out.</br>`;
-    if (content !== undefined && content !== "open" && content !== "closed")
-        err += `<code>content: ${content}</code> is not a valid value. It has to be <code>open</code> or <code>closed</code>, or leave the entire line out.</br>`;
-    if (from !== undefined &&
-        !plugin.app.plugins.enabledPlugins.has("dataview")) {
-        err += `Dataview must be enabled to use <code>from</code>.</br>`;
-    }
-    if (implied !== undefined && implied !== "false")
-        err += `<code>implied: ${implied}</code> is not a valid value. It has to be <code>false</code>, or leave the entire line out.</br>`;
-    return err === ""
-        ? ""
-        : `${err}</br>
-    A valid example would be:
-    <pre><code>
-      type: tree
-      dir: ${validDir ? dir : "down"}
-      fields: ${allFields
-            .map((f) => {
-            return { f, dir: getFieldInfo(userHiers, f).fieldDir };
-        })
-            .filter((info) => info.dir === dir)
-            .map((info) => info.f)
-            .join(", ") || "child"}
-      depth: 3
-      </code></pre>`;
-}
-function indentToDepth(indent) {
-    return indent.length / 2 + 1;
-}
-function meetsConditions(indent, node, froms, min, max) {
-    const depth = indentToDepth(indent);
-    return (depth >= min &&
-        depth <= max &&
-        (froms === undefined || froms.includes(node)));
-}
-function createdJugglCB(plugin, target, args, lines, froms, source, min, max) {
-    const nodes = lines
-        .filter(([indent, node]) => meetsConditions(indent, node, froms, min, max))
-        .map(([_, node]) => node + ".md");
-    if (min <= 0) {
-        nodes.push(source + ".md");
-    }
-    console.log({ lines, nodes });
-    createJuggl(plugin, target, nodes, args);
-}
-
-async function jumpToFirstDir(plugin, dir) {
-    var _a;
-    const { limitJumpToFirstFields } = plugin.settings;
-    const file = plugin.app.workspace.getActiveFile();
-    if (!file) {
-        new obsidian.Notice("You need to be focussed on a Markdown file");
-        return;
-    }
-    const { basename } = file;
-    const realsNImplieds = getRealnImplied(plugin, basename, dir)[dir];
-    const allBCs = [...realsNImplieds.reals, ...realsNImplieds.implieds];
-    if (allBCs.length === 0) {
-        new obsidian.Notice(`No ${dir} found`);
-        return;
-    }
-    const toNode = (_a = allBCs.find((bc) => limitJumpToFirstFields.includes(bc.field))) === null || _a === void 0 ? void 0 : _a.to;
-    if (!toNode) {
-        new obsidian.Notice(`No note was found in ${dir} given the limited fields allowed: ${limitJumpToFirstFields.join(", ")}`);
-        return;
-    }
-    const toFile = plugin.app.metadataCache.getFirstLinkpathDest(toNode, "");
-    await plugin.app.workspace.activeLeaf.openFile(toFile);
-}
-
-async function thread(plugin, field) {
-    var _a, _b;
-    const { app, settings } = plugin;
-    const { userHiers, writeBCsInline, threadingTemplate, dateFormat, threadingDirTemplates, threadIntoNewPane, } = settings;
-    const currFile = app.workspace.getActiveFile();
-    if (!currFile)
-        return;
-    const newFileParent = app.fileManager.getNewFileParent(currFile.path);
-    const dir = getFieldInfo(userHiers, field).fieldDir;
-    const oppField = (_a = getOppFields(userHiers, field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(field, dir);
-    let newBasename = threadingTemplate
-        ? threadingTemplate
-            .replace("{{current}}", currFile.basename)
-            .replace("{{field}}", field)
-            .replace("{{dir}}", dir)
-            //@ts-ignore
-            .replace("{{date}}", moment().format(dateFormat))
-        : "Untitled";
-    let i = 1;
-    while (app.metadataCache.getFirstLinkpathDest(newBasename, "")) {
-        if (i === 1)
-            newBasename += ` ${i}`;
-        else
-            newBasename = newBasename.slice(0, -2) + ` ${i}`;
-        i++;
-    }
-    const crumb = writeBCsInline
-        ? `${oppField}:: [[${currFile.basename}]]`
-        : `---\n${oppField}: ['${currFile.basename}']\n---`;
-    const templatePath = threadingDirTemplates[dir];
-    let newContent = crumb;
-    if (templatePath) {
-        const templateFile = app.metadataCache.getFirstLinkpathDest(templatePath, "");
-        const template = await app.vault.cachedRead(templateFile);
-        newContent = template.replace(/\{\{BC-thread-crumb\}\}/i, writeBCsInline
-            ? `${oppField}:: [[${currFile.basename}]]`
-            : `${oppField}: ['${currFile.basename}']`);
-    }
-    const newFile = await app.vault.create(obsidian.normalizePath(`${newFileParent.path}/${newBasename}.md`), newContent);
-    if (!writeBCsInline) {
-        const { api } = (_b = app.plugins.plugins.metaedit) !== null && _b !== void 0 ? _b : {};
-        if (!api) {
-            new obsidian.Notice("Metaedit must be enabled to write to yaml. Alternatively, toggle the setting `Write Breadcrumbs Inline` to use Dataview inline fields instead.");
-            return;
-        }
-        await createOrUpdateYaml(field, newFile.basename, currFile, app.metadataCache.getFileCache(currFile).frontmatter, api);
-    }
-    else {
-        // TODO Check if this note already has this field
-        let content = await app.vault.read(currFile);
-        const splits = splitAtYaml(content);
-        content =
-            splits[0] +
-                (splits[0].length ? "\n" : "") +
-                `${field}:: [[${newFile.basename}]]` +
-                (splits[1].length ? "\n" : "") +
-                splits[1];
-        await app.vault.modify(currFile, content);
-    }
-    const leaf = threadIntoNewPane
-        ? app.workspace.splitActiveLeaf()
-        : app.workspace.activeLeaf;
-    await leaf.openFile(newFile, { active: true, mode: "source" });
-    if (templatePath) {
-        if (app.plugins.plugins["templater-obsidian"]) {
-            app.commands.executeCommandById("templater-obsidian:replace-in-file-templater");
-        }
-        else {
-            new obsidian.Notice("The Templater plugin must be enabled to resolve the templates in the new note");
-        }
-    }
-    if (threadingTemplate) {
-        // @ts-ignore
-        const editor = leaf.view.editor;
-        editor.setCursor(editor.getValue().length);
-    }
-    else {
-        const noteNameInputs = document.getElementsByClassName("view-header-title");
-        const newNoteInputEl = Array.from(noteNameInputs).find((input) => input.innerText === newBasename);
-        newNoteInputEl.innerText = "";
-        newNoteInputEl.focus();
-    }
+    heatmapColourPicker.value = settings.heatmapColour;
+    heatmapColourPicker.addEventListener("change", async () => {
+        settings.heatmapColour = heatmapColourPicker.value;
+        await plugin.saveSettings();
+    });
+    new obsidian.Setting(trailDetails)
+        .setName("Index Note(s)")
+        .setDesc(fragWithHTML("The note that all of your other notes lead back to. The parent of all your parent notes. Just enter the basename. So if your index note is <code>000 Home.md</code>, enter <code>000 Home</code>. You can also have multiple index notes (comma-separated list). The breadcrumb trail will show the shortest path back to any one of the index notes listed. You can now leave this field empty, meaning the trail will show a path going as far up the parent-tree as possible."))
+        .addText((text) => {
+        text
+            .setPlaceholder("Index Note")
+            .setValue(settings.indexNotes.join(", "));
+        text.inputEl.onblur = async () => {
+            const splits = splitAndTrim(text.getValue());
+            if (splits[0] === undefined ||
+                splits.every((index) => isInVault(app, index))) {
+                settings.indexNotes = splits;
+                await plugin.saveSettings();
+            }
+            else {
+                new obsidian.Notice(`Atleast one of the notes is not in your vault`);
+            }
+        };
+    });
+    new obsidian.Setting(trailDetails)
+        .setName("Shows all paths if none to index note are found")
+        .setDesc("If you have an index notes chosen, but the trail view has no paths going up to those index notes, should it show all paths instead?")
+        .addToggle((toggle) => toggle
+        .setValue(settings.showAllPathsIfNoneToIndexNote)
+        .onChange(async (value) => {
+        settings.showAllPathsIfNoneToIndexNote = value;
+        await plugin.saveSettings();
+        await drawTrail(plugin);
+    }));
+    new obsidian.Setting(trailDetails)
+        .setName("Default: All or Shortest")
+        .setDesc("If multiple paths are found going up the parent tree, should all of them be shown by default, or only the shortest? ✅ = all, ❌ = shortest")
+        .addToggle((toggle) => toggle.setValue(settings.showAll).onChange(async (value) => {
+        settings.showAll = value;
+        await plugin.saveSettings();
+        await drawTrail(plugin);
+    }));
+    new obsidian.Setting(trailDetails)
+        .setName("Breadcrumb trail seperator")
+        .setDesc("The character to show between crumbs in the breadcrumb trail. The default is '→'")
+        .addText((text) => text
+        .setPlaceholder("→")
+        .setValue(settings.trailSeperator)
+        .onChange(async (value) => {
+        settings.trailSeperator = value;
+        await plugin.saveSettings();
+        await drawTrail(plugin);
+    }));
+    new obsidian.Setting(trailDetails)
+        .setName("No path found message")
+        .setDesc("The text to display when no path to the index note was found, or when the current note has no parent (this happens if you haven't chosen an index note)")
+        .addText((text) => text
+        .setPlaceholder(`No path to index note was found`)
+        .setValue(settings.noPathMessage)
+        .onChange(async (value) => {
+        settings.noPathMessage = value;
+        await plugin.saveSettings();
+        await drawTrail(plugin);
+    }));
+    new obsidian.Setting(trailDetails)
+        .setName("Respect Readable Line Length")
+        .setDesc("Should the breadcrumbs trail adjust its width to the readable line length, or use as much space as possible? ✅ = use readable line length.")
+        .addToggle((toggle) => toggle
+        .setValue(settings.respectReadableLineLength)
+        .onChange(async (value) => {
+        settings.respectReadableLineLength = value;
+        await plugin.saveSettings();
+        await drawTrail(plugin);
+    }));
 }
 
-async function writeBCToFile(plugin, file) {
-    var _a;
-    const { app, settings, mainG } = plugin;
-    const { limitWriteBCCheckboxes, writeBCsInline, userHiers } = settings;
-    const { frontmatter } = app.metadataCache.getFileCache(file);
-    const api = (_a = app.plugins.plugins.metaedit) === null || _a === void 0 ? void 0 : _a.api;
-    if (!api) {
-        new obsidian.Notice("Metaedit must be enabled for this function to work");
-        return;
-    }
-    const succInfo = mainG.mapInEdges(file.basename, (k, a, s, t) => {
-        var _a;
-        const oppField = (_a = getOppFields(userHiers, a.field)[0]) !== null && _a !== void 0 ? _a : fallbackOppField(a.field, a.dir);
-        return { succ: s, field: oppField };
+function addTreeViewSettings(plugin, viewDetails) {
+    const { settings } = plugin;
+    const treeViewDetails = subDetails("Tree View", viewDetails);
+    new obsidian.Setting(treeViewDetails)
+        .setName("Enable line wrapping")
+        .setDesc("Make the items in the tree view line wrap when there isn't enough space (✅). ❌ makes them overflow off the screen.")
+        .addToggle((toggle) => toggle.setValue(settings.downViewWrap).onChange(async (value) => {
+        settings.downViewWrap = value;
+        await plugin.saveSettings();
+    }));
+}
+
+function addVisModalSettings(plugin, viewDetails) {
+    const { settings } = plugin;
+    const visModalDetails = subDetails("Visualisation Modal", viewDetails);
+    new obsidian.Setting(visModalDetails)
+        .setName("Default Visualisation Type")
+        .setDesc("Which visualisation to show by defualt")
+        .addDropdown((cb) => {
+        VISTYPES.forEach((option) => {
+            cb.addOption(option, option);
+        });
+        cb.setValue(settings.visGraph);
+        cb.onChange(async (value) => {
+            settings.visGraph = value;
+            await plugin.saveSettings();
+        });
+    });
+    new obsidian.Setting(visModalDetails)
+        .setName("Default Relation")
+        .setDesc("Which relation type to show first when opening the modal")
+        .addDropdown((dd) => {
+        RELATIONS.forEach((option) => {
+            dd.addOption(option, option);
+        });
+        dd.setValue(settings.visRelation);
+        dd.onChange(async (value) => {
+            settings.visRelation = value;
+            await plugin.saveSettings();
+        });
+    });
+    new obsidian.Setting(visModalDetails)
+        .setName("Default Real/Closed")
+        .setDesc("Show the real or closed graph by default")
+        .addDropdown((cb) => {
+        REAlCLOSED.forEach((option) => {
+            cb.addOption(option, option);
+        });
+        cb.setValue(settings.visClosed);
+        cb.onChange(async (value) => {
+            settings.visClosed = value;
+            await plugin.saveSettings();
+        });
+    });
+    new obsidian.Setting(visModalDetails)
+        .setName("Default Unlinked")
+        .setDesc("Show all nodes or only those which have links by default")
+        .addDropdown((cb) => {
+        ALLUNLINKED.forEach((option) => {
+            cb.addOption(option, option);
+        });
+        cb.setValue(settings.visAll);
+        cb.onChange(async (value) => {
+            settings.visAll = value;
+            await plugin.saveSettings();
+        });
     });
-    for (const { succ, field } of succInfo) {
-        if (!limitWriteBCCheckboxes.includes(field))
-            return;
-        if (!writeBCsInline) {
-            await createOrUpdateYaml(field, succ, file, frontmatter, api);
-        }
-        else {
-            // TODO Check if this note already has this field
-            let content = await app.vault.read(file);
-            const splits = splitAtYaml(content);
-            content =
-                splits[0] +
-                    (splits[0].length ? "\n" : "") +
-                    `${field}:: [[${succ}]]` +
-                    (splits[1].length ? "\n" : "") +
-                    splits[1];
-            await app.vault.modify(file, content);
-        }
-    }
-}
-async function writeBCsToAllFiles(plugin) {
-    if (!plugin.settings.showWriteAllBCsCmd) {
-        new obsidian.Notice("You first need to enable this command in Breadcrumbs' settings.");
-        return;
-    }
-    if (window.confirm("This action will write the implied Breadcrumbs of each file to that file.\nIt uses the MetaEdit plugins API to update the YAML, so it should only affect that frontmatter of your note.\nI can't promise that nothing bad will happen. **This operation cannot be undone**.")) {
-        if (window.confirm("Are you sure? You have been warned that this operation will attempt to update all files with implied breadcrumbs.")) {
-            if (window.confirm("For real, please make a back up before.")) {
-                const notice = new obsidian.Notice("Operation Started");
-                const problemFiles = [];
-                for (const file of plugin.app.vault.getMarkdownFiles()) {
-                    try {
-                        await writeBCToFile(plugin, file);
-                    }
-                    catch (e) {
-                        problemFiles.push(file.path);
-                    }
-                }
-                notice.setMessage("Operation Complete");
-                if (problemFiles.length) {
-                    new obsidian.Notice("Some files were not updated due to errors. Check the console to see which ones.");
-                    console.log({ problemFiles });
-                }
-            }
-        }
-    }
 }
 
-class FieldSuggestor extends obsidian.EditorSuggest {
-    constructor(plugin) {
-        super(plugin.app);
-        this.getSuggestions = (context) => {
-            const { query } = context;
-            return BC_FIELDS_INFO.map((sug) => sug.field).filter((sug) => sug.includes(query));
-        };
+function addWriteBCsSettings(plugin, cmdsDetails) {
+    const { settings } = plugin;
+    const writeBCsToFileDetails = subDetails("Write Breadcrumbs to File", cmdsDetails);
+    const limitWriteBCDiv = writeBCsToFileDetails.createDiv({
+        cls: "limit-ML-fields",
+    });
+    limitWriteBCDiv.createEl("strong", {
+        text: "Limit to only write certain fields to files",
+    });
+    new Checkboxes({
+        target: writeBCsToFileDetails,
+        props: {
+            plugin,
+            options: getFields(settings.userHiers),
+            settingName: "limitWriteBCCheckboxes",
+        },
+    });
+    new obsidian.Setting(writeBCsToFileDetails)
+        .setName("Write BCs to file Inline")
+        .setDesc("When writing BCs to file, should they be written inline (using Dataview syntax), or into the YAML of the note?")
+        .addToggle((toggle) => toggle.setValue(settings.writeBCsInline).onChange(async (value) => {
+        settings.writeBCsInline = value;
+        await plugin.saveSettings();
+    }));
+    new obsidian.Setting(writeBCsToFileDetails)
+        .setName(fragWithHTML("Show the <code>Write Breadcrumbs to ALL Files</code> command"))
+        .setDesc("This command attempts to update ALL files with implied breadcrumbs pointing to them. So, it is not shown by default (even though it has 3 confirmation boxes to ensure you want to run it")
+        .addToggle((toggle) => toggle.setValue(settings.showWriteAllBCsCmd).onChange(async (value) => {
+        settings.showWriteAllBCsCmd = value;
+        await plugin.saveSettings();
+    }));
+}
+
+const fragWithHTML = (html) => createFragment((frag) => (frag.createDiv().innerHTML = html));
+const details = (text, parent) => parent.createEl("details", {}, (d) => d.createEl("summary", { text }));
+const subDetails = (text, parent) => parent
+    .createDiv({
+    attr: { style: "padding-left: 10px;" },
+})
+    .createEl("details", {}, (d) => d.createEl("summary", { text }));
+class BCSettingTab extends obsidian.PluginSettingTab {
+    constructor(app, plugin) {
+        super(app, plugin);
         this.plugin = plugin;
+        this.app = app;
     }
-    onTrigger(cursor, editor, _) {
-        var _a;
-        if (this.plugin.settings.fieldSuggestor) {
-            const sub = editor.getLine(cursor.line).substring(0, cursor.ch);
-            const match = (_a = sub.match(/^BC-(.*)$/)) === null || _a === void 0 ? void 0 : _a[1];
-            if (match !== undefined) {
-                return {
-                    end: cursor,
-                    start: {
-                        ch: sub.lastIndexOf(match),
-                        line: cursor.line,
-                    },
-                    query: match,
-                };
-            }
-        }
-        return null;
-    }
-    renderSuggestion(suggestion, el) {
-        var _a;
-        el.createDiv({
-            text: suggestion.replace("BC-", ""),
-            cls: "BC-suggester-container",
-            attr: {
-                "aria-label": (_a = BC_FIELDS_INFO.find((f) => f.field === suggestion)) === null || _a === void 0 ? void 0 : _a.desc,
-                "aria-label-position": "right",
-            },
-        });
-    }
-    selectSuggestion(suggestion) {
-        var _a;
-        const { context } = this;
-        if (context) {
-            const replacement = `${suggestion}${(_a = BC_FIELDS_INFO.find((f) => f.field === suggestion)) === null || _a === void 0 ? void 0 : _a.after}`;
-            context.editor.replaceRange(replacement, { ch: 0, line: context.start.line }, context.end);
-        }
+    async display() {
+        const { plugin, containerEl } = this;
+        const { settings } = plugin;
+        containerEl.empty();
+        containerEl.createEl("h2", { text: "Breadcrumbs Settings" });
+        addHierarchySettings(plugin, containerEl);
+        addRelationSettings(plugin, containerEl);
+        addGeneralSettings(plugin, containerEl);
+        const viewDetails = details("Views", containerEl);
+        addMatrixViewSettings(plugin, viewDetails);
+        addTrailViewSettings(plugin, viewDetails);
+        addVisModalSettings(plugin, viewDetails);
+        addTreeViewSettings(plugin, viewDetails);
+        const alternativeHierarchyDetails = details("Alternative Hierarchies", containerEl);
+        new obsidian.Setting(alternativeHierarchyDetails)
+            .setName("Enable Field Suggestor")
+            .setDesc(fragWithHTML('Alot of Breadcrumbs features require a metadata (or inline Dataview) field to work. For example, `BC-folder-note`.</br>The Field Suggestor will show an autocomplete menu with all available Breadcrumbs field options when the content you type matches the regex <code>/^BC-.*$/</code>. Basically, just type "BC-" at the start of a line to trigger it.'))
+            .addToggle((toggle) => toggle.setValue(settings.fieldSuggestor).onChange(async (value) => {
+            settings.fieldSuggestor = value;
+            await plugin.saveSettings();
+        }));
+        addTagNoteSettings(plugin, alternativeHierarchyDetails);
+        addRegexNoteSettings(plugin, alternativeHierarchyDetails);
+        addNoSystemSettings(plugin, alternativeHierarchyDetails);
+        addHierarchyNoteSettings(plugin, alternativeHierarchyDetails);
+        addCSVSettings(plugin, alternativeHierarchyDetails);
+        addDendronSettings(plugin, alternativeHierarchyDetails);
+        const cmdsDetails = details("Commands", containerEl);
+        addWriteBCsSettings(plugin, cmdsDetails);
+        addCreateIndexSettings(plugin, cmdsDetails);
+        addThreadingSettings(plugin, cmdsDetails);
+        addDebuggingsSettings(plugin, containerEl);
+        new KoFi({ target: containerEl });
     }
 }
 
@@ -30873,7 +30887,7 @@ function get_each_context_7(ctx, list, i) {
 	return child_ctx;
 }
 
-// (95:4) {#each DIRECTIONS as dir}
+// (96:4) {#each DIRECTIONS as dir}
 function create_each_block_7(ctx) {
 	let td;
 	let t_value = ARROW_DIRECTIONS[/*dir*/ ctx[28]] + "";
@@ -30896,7 +30910,7 @@ function create_each_block_7(ctx) {
 	};
 }
 
-// (107:6) {#each DIRECTIONS as dir}
+// (108:6) {#each DIRECTIONS as dir}
 function create_each_block_6(ctx) {
 	let td;
 	let t0_value = /*data*/ ctx[2][/*i*/ ctx[37]][/*dir*/ ctx[28]].Merged.nodes.length + "";
@@ -30940,7 +30954,7 @@ function create_each_block_6(ctx) {
 	};
 }
 
-// (128:6) {#each DIRECTIONS as dir}
+// (129:6) {#each DIRECTIONS as dir}
 function create_each_block_5(ctx) {
 	let td;
 	let t0_value = /*data*/ ctx[2][/*i*/ ctx[37]][/*dir*/ ctx[28]].Merged.edges.length + "";
@@ -30984,7 +30998,7 @@ function create_each_block_5(ctx) {
 	};
 }
 
-// (149:6) {#each DIRECTIONS as dir}
+// (150:6) {#each DIRECTIONS as dir}
 function create_each_block_4(ctx) {
 	let td;
 	let t0_value = /*data*/ ctx[2][/*i*/ ctx[37]][/*dir*/ ctx[28]].Implied.edges.length + "";
@@ -31028,7 +31042,7 @@ function create_each_block_4(ctx) {
 	};
 }
 
-// (101:2) {#each userHiers as hier, i}
+// (102:2) {#each userHiers as hier, i}
 function create_each_block_3(ctx) {
 	let tr0;
 	let td0;
@@ -31302,7 +31316,7 @@ function create_each_block_3(ctx) {
 	};
 }
 
-// (172:4) {#each DIRECTIONS as dir}
+// (173:4) {#each DIRECTIONS as dir}
 function create_each_block_2(ctx) {
 	let td;
 	let t0_value = lodash.sum(/*data*/ ctx[2].map(func_3)) + "";
@@ -31354,7 +31368,7 @@ function create_each_block_2(ctx) {
 	};
 }
 
-// (214:4) {#each DIRECTIONS as dir}
+// (215:4) {#each DIRECTIONS as dir}
 function create_each_block_1$2(ctx) {
 	let td;
 	let t0_value = lodash.sum(/*data*/ ctx[2].map(func_5)) + "";
@@ -31406,7 +31420,7 @@ function create_each_block_1$2(ctx) {
 	};
 }
 
-// (252:4) {#each DIRECTIONS as dir}
+// (253:4) {#each DIRECTIONS as dir}
 function create_each_block$2(ctx) {
 	let td;
 	let t0_value = lodash.sum(/*data*/ ctx[2].map(func_7)) + "";
diff --git a/src/AlternativeHierarchies/CSVCrumbs.ts b/src/AlternativeHierarchies/CSVCrumbs.ts
index 883c1c74..4708d665 100644
--- a/src/AlternativeHierarchies/CSVCrumbs.ts
+++ b/src/AlternativeHierarchies/CSVCrumbs.ts
@@ -1,10 +1,10 @@
 import type { MultiGraph } from "graphology";
+import { debug } from "loglevel";
 import { normalizePath } from "obsidian";
-import { dropWikilinks } from "../sharedFunctions";
+import { dropWikilinks } from "../Utils/ObsidianUtils";
 import type { Directions } from "../interfaces";
-import { addEdgeIfNot, addNodesIfNot } from "../graphUtils";
-import { debug } from "loglevel";
 import type BCPlugin from "../main";
+import { addEdgeIfNot, addNodesIfNot } from "../Utils/graphUtils";
 
 export async function getCSVRows(plugin: BCPlugin) {
   const { CSVPaths } = plugin.settings;
diff --git a/src/AlternativeHierarchies/DendronNotes.ts b/src/AlternativeHierarchies/DendronNotes.ts
index dc9003e5..961fdf7b 100644
--- a/src/AlternativeHierarchies/DendronNotes.ts
+++ b/src/AlternativeHierarchies/DendronNotes.ts
@@ -1,9 +1,13 @@
 import type { MultiGraph } from "graphology";
 import { BC_IGNORE_DENDRON } from "../constants";
-import { getSourceOrder, getTargetOrder, populateMain } from "../graphUtils";
 import type { dvFrontmatterCache } from "../interfaces";
 import type BCPlugin from "../main";
-import { getDVBasename } from "../sharedFunctions";
+import {
+  getSourceOrder,
+  getTargetOrder,
+  populateMain,
+} from "../Utils/graphUtils";
+import { getDVBasename } from "../Utils/ObsidianUtils";
 
 export function addDendronNotesToGraph(
   plugin: BCPlugin,
diff --git a/src/AlternativeHierarchies/FolderNotes.ts b/src/AlternativeHierarchies/FolderNotes.ts
index f3805ff7..99d43a39 100644
--- a/src/AlternativeHierarchies/FolderNotes.ts
+++ b/src/AlternativeHierarchies/FolderNotes.ts
@@ -1,10 +1,15 @@
 import type { MultiGraph } from "graphology";
 import { TFile, TFolder } from "obsidian";
 import { BC_FOLDER_NOTE, BC_FOLDER_NOTE_RECURSIVE } from "../constants";
-import { getSourceOrder, getTargetOrder, populateMain } from "../graphUtils";
-import type { BCSettings, dvFrontmatterCache } from "../interfaces";
+import type { dvFrontmatterCache } from "../interfaces";
 import type BCPlugin from "../main";
-import { getDVBasename, getFields, getFolderName } from "../sharedFunctions";
+import {
+  getSourceOrder,
+  getTargetOrder,
+  populateMain,
+} from "../Utils/graphUtils";
+import { getFields } from "../Utils/HierUtils";
+import { getDVBasename, getFolderName } from "../Utils/ObsidianUtils";
 
 const getSubsFromFolder = (folder: TFolder) => {
   const otherNotes: TFile[] = [],
diff --git a/src/AlternativeHierarchies/HierarchyNotes/HierarchyNoteManipulator.ts b/src/AlternativeHierarchies/HierarchyNotes/HierarchyNoteManipulator.ts
index 0d495435..88c5f482 100644
--- a/src/AlternativeHierarchies/HierarchyNotes/HierarchyNoteManipulator.ts
+++ b/src/AlternativeHierarchies/HierarchyNotes/HierarchyNoteManipulator.ts
@@ -8,10 +8,10 @@ import {
   Notice,
   TFile,
 } from "obsidian";
-import { ModifyHierItemModal } from "./ModifyHierItemModal";
 import type { BCSettings } from "../../interfaces";
 import type BCPlugin from "../../main";
-import { dropWikilinks } from "../../sharedFunctions";
+import { dropWikilinks } from "../../Utils/ObsidianUtils";
+import { ModifyHierItemModal } from "./ModifyHierItemModal";
 
 interface HNItem {
   depth: number;
diff --git a/src/AlternativeHierarchies/HierarchyNotes/HierarchyNotes.ts b/src/AlternativeHierarchies/HierarchyNotes/HierarchyNotes.ts
index 3ffe7a42..1cec462d 100644
--- a/src/AlternativeHierarchies/HierarchyNotes/HierarchyNotes.ts
+++ b/src/AlternativeHierarchies/HierarchyNotes/HierarchyNotes.ts
@@ -1,9 +1,13 @@
 import type { MultiGraph } from "graphology";
 import { Notice, TFile } from "obsidian";
-import { addEdgeIfNot, addNodesIfNot, getOppFields } from "../../graphUtils";
 import type { BCSettings, HierarchyNoteItem } from "../../interfaces";
 import type BCPlugin from "../../main";
-import { fallbackOppField, getFields } from "../../sharedFunctions";
+import { addEdgeIfNot, addNodesIfNot } from "../../Utils/graphUtils";
+import {
+  fallbackOppField,
+  getFields,
+  getOppFields,
+} from "../../Utils/HierUtils";
 
 export async function getHierarchyNoteItems(plugin: BCPlugin, file: TFile) {
   const { userHiers } = plugin.settings;
diff --git a/src/AlternativeHierarchies/JugglLinks.ts b/src/AlternativeHierarchies/JugglLinks.ts
index 6aa2b5ea..1ddd1974 100644
--- a/src/AlternativeHierarchies/JugglLinks.ts
+++ b/src/AlternativeHierarchies/JugglLinks.ts
@@ -2,10 +2,10 @@ import type { MultiGraph } from "graphology";
 import { parseTypedLink } from "juggl-api";
 import type { TFile } from "obsidian";
 import { splitLinksRegex } from "../constants";
-import { getFieldInfo, getTargetOrder, populateMain } from "../graphUtils";
 import type { BCSettings, dvFrontmatterCache, JugglLink } from "../interfaces";
 import type BCPlugin from "../main";
-import { getFields } from "../sharedFunctions";
+import { getTargetOrder, populateMain } from "../Utils/graphUtils";
+import { getFieldInfo, getFields } from "../Utils/HierUtils";
 
 // TODO I think it'd be better to do this whole thing as an obj instead of JugglLink[]
 // => {[note: string]: {type: string, linksInLine: string[]}[]}
diff --git a/src/AlternativeHierarchies/LinkNotes.ts b/src/AlternativeHierarchies/LinkNotes.ts
index 2d62e3d1..a8bd5ec5 100644
--- a/src/AlternativeHierarchies/LinkNotes.ts
+++ b/src/AlternativeHierarchies/LinkNotes.ts
@@ -1,9 +1,14 @@
 import type { MultiGraph } from "graphology";
 import { BC_LINK_NOTE } from "../constants";
-import { getSourceOrder, getTargetOrder, populateMain } from "../graphUtils";
 import type { dvFrontmatterCache } from "../interfaces";
 import type BCPlugin from "../main";
-import { getDVBasename, getFields } from "../sharedFunctions";
+import {
+  getSourceOrder,
+  getTargetOrder,
+  populateMain,
+} from "../Utils/graphUtils";
+import { getFields } from "../Utils/HierUtils";
+import { getDVBasename } from "../Utils/ObsidianUtils";
 
 export function addLinkNotesToGraph(
   plugin: BCPlugin,
diff --git a/src/AlternativeHierarchies/NamingSystem.ts b/src/AlternativeHierarchies/NamingSystem.ts
index 1fc5b14a..acc2133e 100644
--- a/src/AlternativeHierarchies/NamingSystem.ts
+++ b/src/AlternativeHierarchies/NamingSystem.ts
@@ -1,8 +1,14 @@
 import type { MultiGraph } from "graphology";
-import type BCPlugin from "../main";
-import { getSourceOrder, getTargetOrder, populateMain } from "../graphUtils";
 import type { dvFrontmatterCache } from "../interfaces";
-import { getDVBasename, getFields, strToRegex } from "../sharedFunctions";
+import type BCPlugin from "../main";
+import { strToRegex } from "../Utils/generalUtils";
+import {
+  getSourceOrder,
+  getTargetOrder,
+  populateMain,
+} from "../Utils/graphUtils";
+import { getFields } from "../Utils/HierUtils";
+import { getDVBasename } from "../Utils/ObsidianUtils";
 
 export function addNamingSystemNotesToGraph(
   plugin: BCPlugin,
diff --git a/src/AlternativeHierarchies/RegexNotes.ts b/src/AlternativeHierarchies/RegexNotes.ts
index 8b95fba9..bed554dc 100644
--- a/src/AlternativeHierarchies/RegexNotes.ts
+++ b/src/AlternativeHierarchies/RegexNotes.ts
@@ -1,10 +1,16 @@
 import type { MultiGraph } from "graphology";
 import { info } from "loglevel";
-import type BCPlugin from "../main";
 import { BC_REGEX_NOTE, BC_REGEX_NOTE_FIELD } from "../constants";
-import { getSourceOrder, getTargetOrder, populateMain } from "../graphUtils";
 import type { dvFrontmatterCache } from "../interfaces";
-import { getDVBasename, getFields, strToRegex } from "../sharedFunctions";
+import type BCPlugin from "../main";
+import { strToRegex } from "../Utils/generalUtils";
+import {
+  getSourceOrder,
+  getTargetOrder,
+  populateMain,
+} from "../Utils/graphUtils";
+import { getFields } from "../Utils/HierUtils";
+import { getDVBasename } from "../Utils/ObsidianUtils";
 
 export function addRegexNotesToGraph(
   plugin: BCPlugin,
diff --git a/src/AlternativeHierarchies/TagNotes.ts b/src/AlternativeHierarchies/TagNotes.ts
index 664fd1df..9ea92509 100644
--- a/src/AlternativeHierarchies/TagNotes.ts
+++ b/src/AlternativeHierarchies/TagNotes.ts
@@ -5,15 +5,16 @@ import {
   BC_TAG_NOTE_EXACT,
   BC_TAG_NOTE_FIELD,
 } from "../constants";
-import { getSourceOrder, getTargetOrder, populateMain } from "../graphUtils";
 import type { dvFrontmatterCache } from "../interfaces";
 import type BCPlugin from "../main";
+import { splitAndTrim } from "../Utils/generalUtils";
 import {
-  dropHash,
-  getDVBasename,
-  getFields,
-  splitAndTrim,
-} from "../sharedFunctions";
+  getSourceOrder,
+  getTargetOrder,
+  populateMain,
+} from "../Utils/graphUtils";
+import { getFields } from "../Utils/HierUtils";
+import { dropHash, getDVBasename } from "../Utils/ObsidianUtils";
 
 const getAllTags = (app: App, file: TFile, withHash = true): string[] => {
   const { tags, frontmatter } = app.metadataCache.getFileCache(file);
diff --git a/src/AlternativeHierarchies/TraverseNotes.ts b/src/AlternativeHierarchies/TraverseNotes.ts
index 2e51ab86..3974e1db 100644
--- a/src/AlternativeHierarchies/TraverseNotes.ts
+++ b/src/AlternativeHierarchies/TraverseNotes.ts
@@ -1,10 +1,11 @@
 import type { MultiGraph } from "graphology";
 import { info } from "loglevel";
 import { BC_TRAVERSE_NOTE } from "../constants";
-import { dfsAllPaths, populateMain, removeCycles } from "../graphUtils";
 import type { dvFrontmatterCache } from "../interfaces";
 import type BCPlugin from "../main";
-import { getDVBasename, getFields } from "../sharedFunctions";
+import { dfsAllPaths, populateMain, removeCycles } from "../Utils/graphUtils";
+import { getFields } from "../Utils/HierUtils";
+import { getDVBasename } from "../Utils/ObsidianUtils";
 
 export function addTraverseNotesToGraph(
   plugin: BCPlugin,
@@ -14,7 +15,7 @@ export function addTraverseNotesToGraph(
 ) {
   const { settings } = plugin;
   const { userHiers } = settings;
-  
+
   traverseNotes.forEach((altFile) => {
     const { file } = altFile;
     const basename = getDVBasename(file);
diff --git a/src/Codeblocks.ts b/src/Codeblocks.ts
index 2b61a9ce..cf4082f3 100644
--- a/src/Codeblocks.ts
+++ b/src/Codeblocks.ts
@@ -3,16 +3,15 @@ import { MarkdownPostProcessorContext, Notice } from "obsidian";
 import { createIndex } from "./Commands/CreateIndex";
 import CBTree from "./Components/CBTree.svelte";
 import { CODEBLOCK_FIELDS, CODEBLOCK_TYPES, DIRECTIONS } from "./constants";
+import type { CodeblockFields, ParsedCodeblock } from "./interfaces";
+import type BCPlugin from "./main";
+import { dropFolder, splitAndTrim } from "./Utils/generalUtils";
 import {
   dfsAllPaths,
-  getFieldInfo,
-  getOppDir,
   getReflexiveClosure,
   getSubInDirs,
-} from "./graphUtils";
-import type { CodeblockFields, ParsedCodeblock } from "./interfaces";
-import type BCPlugin from "./main";
-import { dropFolder, getFields, splitAndTrim } from "./sharedFunctions";
+} from "./Utils/graphUtils";
+import { getFieldInfo, getFields, getOppDir } from "./Utils/HierUtils";
 import { createJuggl } from "./Visualisations/Juggl";
 
 export function getCodeblockCB(plugin: BCPlugin) {
diff --git a/src/Commands/CreateIndex.ts b/src/Commands/CreateIndex.ts
index b9ac7f1e..b3a1f44b 100644
--- a/src/Commands/CreateIndex.ts
+++ b/src/Commands/CreateIndex.ts
@@ -1,9 +1,9 @@
 import { cloneDeep } from "lodash";
 import { info } from "loglevel";
 import { copy } from "obsidian-community-lib/dist/utils";
-import { dfsAllPaths, getSinks, getSubInDirs } from "../graphUtils";
 import type BCPlugin from "../main";
-import { makeWiki } from "../sharedFunctions";
+import { dfsAllPaths, getSinks, getSubInDirs } from "../Utils/graphUtils";
+import { makeWiki } from "../Utils/ObsidianUtils";
 
 /**
  * Returns a copy of `index`, doesn't mutate.
diff --git a/src/Commands/WriteBCs.ts b/src/Commands/WriteBCs.ts
index ba8e8077..6993f467 100644
--- a/src/Commands/WriteBCs.ts
+++ b/src/Commands/WriteBCs.ts
@@ -1,11 +1,7 @@
 import { Notice, TFile } from "obsidian";
-import {
-  createOrUpdateYaml,
-  fallbackOppField,
-  splitAtYaml,
-} from "../sharedFunctions";
 import type BCPlugin from "../main";
-import { getOppFields } from "../graphUtils";
+import { fallbackOppField, getOppFields } from "../Utils/HierUtils";
+import { createOrUpdateYaml, splitAtYaml } from "../Utils/ObsidianUtils";
 
 export async function writeBCToFile(plugin: BCPlugin, file: TFile) {
   const { app, settings, mainG } = plugin;
diff --git a/src/Commands/jumpToFirstDir.ts b/src/Commands/jumpToFirstDir.ts
index 9e8656ef..9859a335 100644
--- a/src/Commands/jumpToFirstDir.ts
+++ b/src/Commands/jumpToFirstDir.ts
@@ -1,7 +1,7 @@
 import { Notice } from "obsidian";
-import { getRealnImplied } from "../sharedFunctions";
 import type { Directions } from "../interfaces";
 import type BCPlugin from "../main";
+import { getRealnImplied } from "../Utils/graphUtils";
 
 export async function jumpToFirstDir(plugin: BCPlugin, dir: Directions) {
   const { limitJumpToFirstFields } = plugin.settings;
diff --git a/src/Commands/threading.ts b/src/Commands/threading.ts
index ba37746d..c74d33ab 100644
--- a/src/Commands/threading.ts
+++ b/src/Commands/threading.ts
@@ -1,11 +1,11 @@
 import { normalizePath, Notice } from "obsidian";
-import { getFieldInfo, getOppFields } from "../graphUtils";
 import type BCPlugin from "../main";
 import {
-  createOrUpdateYaml,
   fallbackOppField,
-  splitAtYaml,
-} from "../sharedFunctions";
+  getFieldInfo,
+  getOppFields,
+} from "../Utils/HierUtils";
+import { createOrUpdateYaml, splitAtYaml } from "../Utils/ObsidianUtils";
 
 export async function thread(plugin: BCPlugin, field: string) {
   const { app, settings } = plugin;
diff --git a/src/Components/CBTree.svelte b/src/Components/CBTree.svelte
index 3508d63a..e510c6dc 100644
--- a/src/Components/CBTree.svelte
+++ b/src/Components/CBTree.svelte
@@ -2,7 +2,7 @@
   import { isInVault, openOrSwitch } from "obsidian-community-lib/dist/utils";
   import type { Directions } from "../interfaces";
   import type BCPlugin from "../main";
-  import { dropDendron, dropFolder } from "../sharedFunctions";
+  import { dropDendron } from "../Utils/generalUtils";
   import RenderMarkdown from "./RenderMarkdown.svelte";
 
   export let plugin: BCPlugin;
@@ -17,8 +17,7 @@
   export let max: number;
   export let basename: string;
 
-  const {settings, app} = plugin;
-
+  const { settings, app } = plugin;
 
   const indentToDepth = (indent: string) => indent.length / 2 + 1;
 
diff --git a/src/Components/Lists.svelte b/src/Components/Lists.svelte
index 5c56d0f2..51617a99 100644
--- a/src/Components/Lists.svelte
+++ b/src/Components/Lists.svelte
@@ -1,8 +1,8 @@
 <script lang="ts">
   import type { App, TFile } from "obsidian";
   import { hoverPreview, openOrSwitch } from "obsidian-community-lib";
-  import { dropPathNDendron } from "../sharedFunctions";
   import type { BCSettings, SquareProps } from "../interfaces";
+  import { dropPathNDendron } from "../Utils/generalUtils";
   import type MatrixView from "../Views/MatrixView";
 
   export let filteredSquaresArr: SquareProps[][];
diff --git a/src/Components/Matrix.svelte b/src/Components/Matrix.svelte
index f0fa2a2c..74016fc8 100644
--- a/src/Components/Matrix.svelte
+++ b/src/Components/Matrix.svelte
@@ -2,8 +2,8 @@
   import type { App, TFile } from "obsidian";
   import { hoverPreview, openOrSwitch } from "obsidian-community-lib";
   import type { BCSettings, SquareProps } from "../interfaces";
+  import { dropPathNDendron } from "../Utils/generalUtils";
   import type MatrixView from "../Views/MatrixView";
-  import { dropPathNDendron } from "../sharedFunctions";
 
   export let filteredSquaresArr: SquareProps[][];
   export let currFile: TFile;
diff --git a/src/Components/ModifyHNItemComp.svelte b/src/Components/ModifyHNItemComp.svelte
index 36c6c371..d0fb1d06 100644
--- a/src/Components/ModifyHNItemComp.svelte
+++ b/src/Components/ModifyHNItemComp.svelte
@@ -2,10 +2,10 @@
   import { error } from "console";
   import { Notice, TFile } from "obsidian";
   import { onMount } from "svelte";
-  import { ARROW_DIRECTIONS } from "../constants";
   import type { ModifyHierItemModal } from "../AlternativeHierarchies/HierarchyNotes/ModifyHierItemModal";
+  import { ARROW_DIRECTIONS } from "../constants";
   import type { BCSettings } from "../interfaces";
-  import { dropWikilinks, makeWiki } from "../sharedFunctions";
+  import { dropWikilinks, makeWiki } from "../Utils/ObsidianUtils";
 
   export let modal: ModifyHierItemModal;
   export let settings: BCSettings;
diff --git a/src/Components/NextPrev.svelte b/src/Components/NextPrev.svelte
index 33e0f0d1..508942be 100644
--- a/src/Components/NextPrev.svelte
+++ b/src/Components/NextPrev.svelte
@@ -3,7 +3,7 @@
   import { openOrSwitch } from "obsidian-community-lib";
   import type { SquareItem } from "../interfaces";
   import type BCPlugin from "../main";
-  import { linkClass } from "../sharedFunctions";
+  import { linkClass } from "../Utils/generalUtils";
 
   export let app: App;
   export let plugin: BCPlugin;
diff --git a/src/Components/SideTree.svelte b/src/Components/SideTree.svelte
index 8fb4bf15..c73ee77c 100644
--- a/src/Components/SideTree.svelte
+++ b/src/Components/SideTree.svelte
@@ -9,11 +9,11 @@
   import FaRegSnowflake from "svelte-icons/fa/FaRegSnowflake.svelte";
   import { createIndex } from "../Commands/CreateIndex";
   import { DIRECTIONS } from "../constants";
-  import { dfsAllPaths, getOppDir, getSubInDirs } from "../graphUtils";
   import type { Directions } from "../interfaces";
   import type BCPlugin from "../main";
   import { refreshIndex } from "../refreshIndex";
-  import { dropDendron } from "../sharedFunctions";
+  import { dropDendron } from "../Utils/generalUtils";
+  import { dfsAllPaths, getSubInDirs } from "../Utils/graphUtils";
   import type TreeView from "../Views/TreeView";
 
   export let plugin: BCPlugin;
diff --git a/src/Components/Stats.svelte b/src/Components/Stats.svelte
index eab7bc23..00c94d69 100644
--- a/src/Components/Stats.svelte
+++ b/src/Components/Stats.svelte
@@ -2,13 +2,14 @@
   import { sum } from "lodash";
   import { debug } from "loglevel";
   import { copy } from "obsidian-community-lib";
-  import { refreshIndex } from "../refreshIndex";
-  import { Debugger } from "../Debugger";
   import { ARROW_DIRECTIONS, DIRECTIONS, STATS_VIEW } from "../constants";
-  import { closeImpliedLinks, getOppDir, getSubForFields } from "../graphUtils";
+  import { Debugger } from "../Debugger";
   import type { Directions, HierData } from "../interfaces";
   import type BCPlugin from "../main";
-  import { hierToStr, makeWiki } from "../sharedFunctions";
+  import { refreshIndex } from "../refreshIndex";
+  import { closeImpliedLinks, getSubForFields } from "../Utils/graphUtils";
+  import { getOppDir, hierToStr } from "../Utils/HierUtils";
+  import { makeWiki } from "../Utils/ObsidianUtils";
 
   export let plugin: BCPlugin;
 
diff --git a/src/Components/TrailGrid.svelte b/src/Components/TrailGrid.svelte
index d3da102e..f8b06756 100644
--- a/src/Components/TrailGrid.svelte
+++ b/src/Components/TrailGrid.svelte
@@ -5,21 +5,21 @@
     hoverPreview,
     openOrSwitch,
   } from "obsidian-community-lib/dist/utils";
-  import {
-    getOutNeighbours,
-    getReflexiveClosure,
-    getSubInDirs,
-  } from "../graphUtils";
   import type BCPlugin from "../main";
   import {
     dropDendron,
-    getAlt,
     linkClass,
     normalise,
     padArray,
     runs,
     transpose,
-  } from "../sharedFunctions";
+  } from "../Utils/generalUtils";
+  import {
+    getOutNeighbours,
+    getReflexiveClosure,
+    getSubInDirs,
+  } from "../Utils/graphUtils";
+  import { getAlt } from "../Utils/ObsidianUtils";
   export let sortedTrails: string[][];
   export let app: App;
   export let plugin: BCPlugin;
diff --git a/src/Components/TrailPath.svelte b/src/Components/TrailPath.svelte
index 97863a10..2dddbce6 100644
--- a/src/Components/TrailPath.svelte
+++ b/src/Components/TrailPath.svelte
@@ -4,8 +4,9 @@
     hoverPreview,
     openOrSwitch,
   } from "obsidian-community-lib/dist/utils";
-  import { dropDendron, getAlt, splitAndTrim } from "../sharedFunctions";
   import type BCPlugin from "../main";
+  import { dropDendron } from "../Utils/generalUtils";
+  import { getAlt } from "../Utils/ObsidianUtils";
 
   export let sortedTrails: string[][];
   export let app: App;
diff --git a/src/Components/UserHierarchies.svelte b/src/Components/UserHierarchies.svelte
index 0db6838a..a33d4516 100644
--- a/src/Components/UserHierarchies.svelte
+++ b/src/Components/UserHierarchies.svelte
@@ -1,12 +1,13 @@
 <script lang="ts">
   import { Notice } from "obsidian";
-  import type { UserHier } from "../interfaces";
-  import { ARROW_DIRECTIONS, blankUserHier, DIRECTIONS } from "../constants";
-  import type BCPlugin from "../main";
-  import { hierToStr, splitAndTrim, swapItems } from "../sharedFunctions";
   import FaListUl from "svelte-icons/fa/FaListUl.svelte";
   import FaPlus from "svelte-icons/fa/FaPlus.svelte";
   import FaRegTrashAlt from "svelte-icons/fa/FaRegTrashAlt.svelte";
+  import { ARROW_DIRECTIONS, blankUserHier, DIRECTIONS } from "../constants";
+  import type { UserHier } from "../interfaces";
+  import type BCPlugin from "../main";
+  import { splitAndTrim, swapItems } from "../Utils/generalUtils";
+  import { hierToStr } from "../Utils/HierUtils";
 
   export let plugin: BCPlugin;
 
diff --git a/src/Components/VisComp.svelte b/src/Components/VisComp.svelte
index cc7961b5..e8c7650e 100644
--- a/src/Components/VisComp.svelte
+++ b/src/Components/VisComp.svelte
@@ -1,12 +1,11 @@
 <script lang="ts">
-  import { ALLUNLINKED, REAlCLOSED, RELATIONS, VISTYPES } from "../constants";
-  import type { BCSettings, VisGraphs, visTypes } from "../interfaces";
+  import { ALLUNLINKED,REAlCLOSED,RELATIONS,VISTYPES } from "../constants";
+  import type { BCSettings,VisGraphs,visTypes } from "../interfaces";
   import {
-    closeImpliedLinks,
-    getSubInDirs,
-    removeUnlinkedNodes,
-  } from "../graphUtils";
-  import type { VisModal } from "../Visualisations/VisModal";
+  closeImpliedLinks,
+  getSubInDirs,
+  removeUnlinkedNodes
+  } from "../Utils/graphUtils";
   import { arcDiagram } from "../Visualisations/ArcDiagram";
   import { circlePacking } from "../Visualisations/CirclePacking";
   import { edgeBundling } from "../Visualisations/EdgeBundling";
@@ -16,6 +15,7 @@
   import { sunburst } from "../Visualisations/Sunburst";
   import { tidyTree } from "../Visualisations/TidyTree";
   import { treeMap } from "../Visualisations/TreeMap";
+  import type { VisModal } from "../Visualisations/VisModal";
 
   export let modal: VisModal;
   export let settings: BCSettings;
diff --git a/src/Settings/DendronSettings.ts b/src/Settings/DendronSettings.ts
index 6b3eb421..5f856936 100644
--- a/src/Settings/DendronSettings.ts
+++ b/src/Settings/DendronSettings.ts
@@ -1,7 +1,7 @@
 import { DropdownComponent, Notice, Setting } from "obsidian";
-import { getFields } from "../sharedFunctions";
 import { DEFAULT_SETTINGS, MATRIX_VIEW } from "../constants";
 import type BCPlugin from "../main";
+import { getFields } from "../Utils/HierUtils";
 import { fragWithHTML, subDetails } from "./BreadcrumbsSettingTab";
 
 export function addDendronSettings(
diff --git a/src/Settings/GeneralSettings.ts b/src/Settings/GeneralSettings.ts
index 8dc33765..cb3c3276 100644
--- a/src/Settings/GeneralSettings.ts
+++ b/src/Settings/GeneralSettings.ts
@@ -2,7 +2,8 @@ import { Notice, Setting } from "obsidian";
 import Checkboxes from "../Components/Checkboxes.svelte";
 import type BCPlugin from "../main";
 import { refreshIndex } from "../refreshIndex";
-import { getFields, splitAndTrim } from "../sharedFunctions";
+import { splitAndTrim } from "../Utils/generalUtils";
+import { getFields } from "../Utils/HierUtils";
 import { details, fragWithHTML } from "./BreadcrumbsSettingTab";
 
 export function addGeneralSettings(plugin: BCPlugin, containerEl: HTMLElement) {
diff --git a/src/Settings/HierarchyNoteSettings.ts b/src/Settings/HierarchyNoteSettings.ts
index d6c11160..647d572d 100644
--- a/src/Settings/HierarchyNoteSettings.ts
+++ b/src/Settings/HierarchyNoteSettings.ts
@@ -1,7 +1,8 @@
 import { Notice, Setting } from "obsidian";
 import { isInVault } from "obsidian-community-lib/dist/utils";
 import type BCPlugin from "../main";
-import { getFields, splitAndTrim } from "../sharedFunctions";
+import { splitAndTrim } from "../Utils/generalUtils";
+import { getFields } from "../Utils/HierUtils";
 import { subDetails } from "./BreadcrumbsSettingTab";
 
 export function addHierarchyNoteSettings(
diff --git a/src/Settings/NoSystemSettings.ts b/src/Settings/NoSystemSettings.ts
index 7ed6dae2..9ebf9d21 100644
--- a/src/Settings/NoSystemSettings.ts
+++ b/src/Settings/NoSystemSettings.ts
@@ -1,7 +1,8 @@
 import { Notice, Setting } from "obsidian";
 import type BCPlugin from "../main";
 import { refreshIndex } from "../refreshIndex";
-import { getFields, strToRegex } from "../sharedFunctions";
+import { strToRegex } from "../Utils/generalUtils";
+import { getFields } from "../Utils/HierUtils";
 import { fragWithHTML, subDetails } from "./BreadcrumbsSettingTab";
 
 export function addNoSystemSettings(
diff --git a/src/Settings/RegexNoteSettings.ts b/src/Settings/RegexNoteSettings.ts
index d428b0de..8d832a56 100644
--- a/src/Settings/RegexNoteSettings.ts
+++ b/src/Settings/RegexNoteSettings.ts
@@ -1,7 +1,7 @@
 import { DropdownComponent, Setting } from "obsidian";
 import type BCPlugin from "../main";
 import { refreshIndex } from "../refreshIndex";
-import { getFields } from "../sharedFunctions";
+import { getFields } from "../Utils/HierUtils";
 import { fragWithHTML, subDetails } from "./BreadcrumbsSettingTab";
 
 export function addRegexNoteSettings(
diff --git a/src/Settings/TagNoteSettings.ts b/src/Settings/TagNoteSettings.ts
index 34ad57ae..6cc86289 100644
--- a/src/Settings/TagNoteSettings.ts
+++ b/src/Settings/TagNoteSettings.ts
@@ -1,7 +1,7 @@
 import { DropdownComponent, Setting } from "obsidian";
 import type BCPlugin from "../main";
 import { refreshIndex } from "../refreshIndex";
-import { getFields } from "../sharedFunctions";
+import { getFields } from "../Utils/HierUtils";
 import { fragWithHTML, subDetails } from "./BreadcrumbsSettingTab";
 
 export function addTagNoteSettings(
diff --git a/src/Settings/TrailSettings.ts b/src/Settings/TrailSettings.ts
index bc2494e3..8971464e 100644
--- a/src/Settings/TrailSettings.ts
+++ b/src/Settings/TrailSettings.ts
@@ -1,10 +1,11 @@
 import { Notice, Setting } from "obsidian";
 import { isInVault } from "obsidian-community-lib/dist/utils";
+import Checkboxes from "../Components/Checkboxes.svelte";
 import type BCPlugin from "../main";
-import { getFields, splitAndTrim } from "../sharedFunctions";
+import { splitAndTrim } from "../Utils/generalUtils";
+import { getFields } from "../Utils/HierUtils";
 import { drawTrail } from "../Views/TrailView";
 import { fragWithHTML, subDetails } from "./BreadcrumbsSettingTab";
-import Checkboxes from "../Components/Checkboxes.svelte";
 
 export function addTrailViewSettings(
   plugin: BCPlugin,
diff --git a/src/Settings/WriteBCsSettings.ts b/src/Settings/WriteBCsSettings.ts
index d645ddee..1d80fc77 100644
--- a/src/Settings/WriteBCsSettings.ts
+++ b/src/Settings/WriteBCsSettings.ts
@@ -1,7 +1,7 @@
 import { Setting } from "obsidian";
 import Checkboxes from "../Components/Checkboxes.svelte";
 import type BCPlugin from "../main";
-import { getFields } from "../sharedFunctions";
+import { getFields } from "../Utils/HierUtils";
 import { fragWithHTML, subDetails } from "./BreadcrumbsSettingTab";
 
 export function addWriteBCsSettings(
diff --git a/src/Utils/HierUtils.ts b/src/Utils/HierUtils.ts
new file mode 100644
index 00000000..1b7bc709
--- /dev/null
+++ b/src/Utils/HierUtils.ts
@@ -0,0 +1,88 @@
+import { ARROW_DIRECTIONS, DIRECTIONS } from "../constants";
+import type { Directions, UserHier } from "../interfaces";
+
+/**
+ * Get all the fields in `dir`.
+ * Returns all fields if `dir === 'all'`
+ * @param  {UserHier[]} userHiers
+ * @param  {Directions|"all"} dir
+ */
+export function getFields(
+  userHiers: UserHier[],
+  dir: Directions | "all" = "all"
+) {
+  const fields: string[] = [];
+  userHiers.forEach((hier) => {
+    if (dir === "all") {
+      DIRECTIONS.forEach((eachDir) => {
+        fields.push(...hier[eachDir]);
+      });
+    } else {
+      fields.push(...hier[dir]);
+    }
+  });
+  return fields;
+}
+
+export const getOppDir = (dir: Directions): Directions => {
+  switch (dir) {
+    case "up":
+      return "down";
+    case "down":
+      return "up";
+    case "same":
+      return "same";
+    case "next":
+      return "prev";
+    case "prev":
+      return "next";
+  }
+};
+
+export function getFieldInfo(userHiers: UserHier[], field: string) {
+  let fieldDir: Directions;
+  let fieldHier: UserHier;
+
+  DIRECTIONS.forEach((dir: Directions) => {
+    userHiers.forEach((hier) => {
+      if (hier[dir].includes(field)) {
+        fieldDir = dir;
+        fieldHier = hier;
+        return;
+      }
+    });
+  });
+  return { fieldHier, fieldDir };
+}
+
+export function getOppFields(userHiers: UserHier[], field: string) {
+  // If the field ends with `>`, it is already the opposite field we need (coming from getOppFallback`)
+  if (field.endsWith(">")) return field.slice(0, -4);
+  const { fieldHier, fieldDir } = getFieldInfo(userHiers, field);
+  if (!fieldHier || !fieldDir) return undefined;
+  const oppDir = getOppDir(fieldDir);
+  return fieldHier[oppDir];
+}
+
+export const hierToStr = (hier: UserHier) =>
+  DIRECTIONS.map(
+    (dir) => `${ARROW_DIRECTIONS[dir]}: ${hier[dir].join(", ")}`
+  ).join("\n");
+
+export const fallbackField = (field: string, dir: Directions) =>
+  `${field} <${ARROW_DIRECTIONS[dir]}>`;
+export const fallbackOppField = (field: string, dir: Directions) =>
+  `${field} <${ARROW_DIRECTIONS[getOppDir(dir)]}>`;
+
+export function iterateHiers(
+  userHiers: UserHier[],
+  fn: (hier: UserHier, dir: Directions, field: string) => void
+) {
+  userHiers.forEach((hier) => {
+    DIRECTIONS.forEach((dir) => {
+      hier[dir].forEach((field) => {
+        fn(hier, dir, field);
+      });
+    });
+  });
+}
diff --git a/src/Utils/ObsidianUtils.ts b/src/Utils/ObsidianUtils.ts
new file mode 100644
index 00000000..bf10d410
--- /dev/null
+++ b/src/Utils/ObsidianUtils.ts
@@ -0,0 +1,101 @@
+import type { FrontMatterCache, TFile } from "obsidian";
+import type { MetaeditApi } from "../interfaces";
+import type BCPlugin from "../main";
+import { splitAndTrim } from "./generalUtils";
+
+/**
+ * Get basename from a **Markdown** `path`
+ * @param  {string} path
+ */
+export const getBaseFromMDPath = (path: string) => {
+  const splitSlash = path.split("/").last();
+  if (splitSlash.endsWith(".md")) {
+    return splitSlash.split(".md").slice(0, -1).join(".");
+  } else return splitSlash;
+};
+
+export const getDVBasename = (file: TFile) => file.basename || file.name;
+export const getFolderName = (file: TFile): string =>
+  //@ts-ignore
+  file?.parent?.name || file.folder;
+
+export function makeWiki(str: string, wikiQ = true) {
+  let copy = str.slice();
+  if (wikiQ) {
+    copy = "[[" + copy;
+    copy += "]]";
+  }
+  return copy;
+}
+
+export function dropWikilinks(str: string) {
+  let copy = str.slice();
+  if (copy.startsWith("[[") && copy.endsWith("]]")) copy = copy.slice(2, -2);
+  return copy;
+}
+
+/**
+ * Adds or updates the given yaml `key` to `value` in the given TFile
+ * @param  {string} key
+ * @param  {string} value
+ * @param  {TFile} file
+ * @param  {FrontMatterCache|undefined} frontmatter
+ * @param  {MetaeditApi} api
+ */
+export const createOrUpdateYaml = async (
+  key: string,
+  value: string,
+  file: TFile,
+  frontmatter: FrontMatterCache | undefined,
+  api: MetaeditApi
+) => {
+  const valueStr = value.toString();
+
+  if (!frontmatter || frontmatter[key] === undefined) {
+    console.log(`Creating: ${key}: ${valueStr}`);
+    await api.createYamlProperty(key, `['${valueStr}']`, file);
+  } else if ([...[frontmatter[key]]].flat(3).some((val) => val == valueStr)) {
+    console.log("Already Exists!");
+    return;
+  } else {
+    const oldValueFlat: string[] = [...[frontmatter[key]]].flat(4);
+    const newValue = [...oldValueFlat, `'${valueStr}'`];
+    console.log(`Updating: ${key}: ${newValue}`);
+    await api.update(key, `[${newValue.join(", ")}]`, file);
+  }
+};
+
+export function splitAtYaml(content: string): [string, string] {
+  const startsWithYaml = content.startsWith("---");
+  if (!startsWithYaml) return ["", content];
+  else {
+    const splits = content.split("---");
+    return [
+      splits.slice(0, 2).join("---") + "---",
+      splits.slice(2).join("---"),
+    ];
+  }
+}
+
+export const dropHash = (tag: string) =>
+  tag.startsWith("#") ? tag.slice(1) : tag;
+
+export const addHash = (tag: string) => (tag.startsWith("#") ? tag : `#${tag}`);
+
+export function getAlt(node: string, plugin: BCPlugin): string | null {
+  const { app } = plugin;
+  const { altLinkFields, showAllAliases } = plugin.settings;
+  if (altLinkFields.length) {
+    const file = app.metadataCache.getFirstLinkpathDest(node, "");
+    if (file) {
+      const metadata = app.metadataCache.getFileCache(file);
+      for (const altField of altLinkFields) {
+        const value = metadata?.frontmatter?.[altField];
+
+        const arr: string[] =
+          typeof value === "string" ? splitAndTrim(value) : value;
+        if (value) return showAllAliases ? arr.join(", ") : arr[0];
+      }
+    }
+  } else return null;
+}
diff --git a/src/Utils/generalUtils.ts b/src/Utils/generalUtils.ts
new file mode 100644
index 00000000..9b1ea0e5
--- /dev/null
+++ b/src/Utils/generalUtils.ts
@@ -0,0 +1,166 @@
+import type { App } from "obsidian";
+import { isInVault } from "obsidian-community-lib";
+import { dropHeaderOrAlias, regNFlags, splitLinksRegex } from "../constants";
+import type { BCSettings } from "../interfaces";
+
+export function sum(arr: number[]): number {
+  return arr.reduce((a, b) => a + b);
+}
+
+export function normalise(arr: number[]): number[] {
+  const max = Math.max(...arr);
+  return arr.map((item) => item / max);
+}
+
+export const isSubset = <T>(arr1: T[], arr2: T[]): boolean =>
+  arr1.every((value) => arr2.includes(value));
+
+export function splitAndDrop(str: string): string[] {
+  return (
+    str
+      ?.match(splitLinksRegex)
+      ?.map((link) => link.match(dropHeaderOrAlias)?.[1]) ?? []
+  );
+}
+
+export const dropPath = (path: string) => path.replace(/^.*\//, "");
+export const dropDendron = (path: string, settings: BCSettings) =>
+  settings.trimDendronNotes
+    ? path.split(settings.dendronNoteDelimiter).last()
+    : path;
+
+export const dropPathNDendron = (path: string, settings: BCSettings) =>
+  dropDendron(dropPath(path), settings);
+
+export const dropFolder = (path: string) =>
+  path.split("/").last().split(".").slice(0, -1).join(".");
+
+export const splitAndTrim = (fields: string): string[] => {
+  if (!fields || fields === "") return [];
+  else return fields.split(",").map((str) => str.trim());
+};
+
+export function padArray(arr: any[], finalLength: number, filler = ""): any[] {
+  const copy = [...arr];
+  const currLength = copy.length;
+  if (currLength > finalLength) {
+    throw new Error("Current length is greater than final length");
+  } else if (currLength === finalLength) {
+    return copy;
+  } else {
+    for (let i = currLength; i < finalLength; i++) {
+      copy.push(filler);
+    }
+    return copy;
+  }
+}
+
+export function transpose(A: any[][]): any[][] {
+  const cols = A[0].length;
+  const AT: any[][] = [];
+  // For each column
+  for (let j = 0; j < cols; j++) {
+    // Add a new row to AT
+    AT.push([]);
+    // And fill it with the values in the jth column of A
+    A.forEach((row) => AT[j].push(row[j]));
+  }
+  return AT;
+}
+
+/**
+ * Given an array of strings, return an array of objects that represent the runs of consecutive strings
+ * in the array.
+ * @param {string} arr
+ * @returns An array of objects with the following properties:
+ *
+ *   `value`: the value of the run
+ *
+ *   `first`: the index of the first element in the run
+ *
+ *   `last`: the index of the last element in the run
+ */
+export function runs(
+  arr: string[]
+): { value: string; first: number; last: number }[] {
+  const runs: { value: string; first: number; last: number }[] = [];
+  let i = 0;
+  while (i < arr.length) {
+    const currValue = arr[i];
+    runs.push({ value: currValue, first: i, last: undefined });
+    while (currValue === arr[i]) {
+      i++;
+    }
+    runs.last().last = i - 1;
+  }
+  return runs;
+}
+
+// SOURCE https://stackoverflow.com/questions/9960908/permutations-in-javascript
+/**
+ * Given a permutation, return all possible permutations of that permutation.
+ * @param permutation - the array to be permuted
+ * @returns `[ [ 1, 2, 3 ], [ 1, 3, 2 ], [ 2, 1, 3 ], [ 2, 3, 1 ], [ 3, 1, 2 ], [ 3, 2, 1 ] ]`
+ */
+export function permute(permutation: any[]): any[][] {
+  const length = permutation.length,
+    result = [permutation.slice()],
+    c = new Array(length).fill(0);
+
+  let i = 1,
+    k: number,
+    p: number;
+
+  while (i < length) {
+    if (c[i] < i) {
+      k = i % 2 && c[i];
+      p = permutation[i];
+      permutation[i] = permutation[k];
+      permutation[k] = p;
+      ++c[i];
+      i = 1;
+      result.push(permutation.slice());
+    } else {
+      c[i] = 0;
+      ++i;
+    }
+  }
+  return result;
+}
+
+export const range = (n: number) => [...Array(n).keys()];
+
+export function complement<T>(A: T[], B: T[]) {
+  return A.filter((a) => !B.includes(a));
+}
+
+export function swapItems<T>(i: number, j: number, arr: T[]) {
+  const max = arr.length - 1;
+  if (i < 0 || i > max || j < 0 || j > max) return arr;
+  const tmp = arr[i];
+  arr[i] = arr[j];
+  arr[j] = tmp;
+  return arr;
+}
+
+export const linkClass = (app: App, to: string, realQ = true) =>
+  `internal-link BC-Link ${isInVault(app, to) ? "" : "is-unresolved"} ${
+    realQ ? "" : "BC-Implied"
+  }`;
+
+export function removeDuplicates<T>(arr: T[]) {
+  return [...new Set(arr)];
+}
+
+export function strToRegex(input: string) {
+  const match = input.match(regNFlags);
+  if (!match) return null;
+  const [, innerRegex, flags] = match;
+  try {
+    const regex = new RegExp(innerRegex, flags);
+    return regex;
+  } catch (e) {
+    console.log(e);
+    return null;
+  }
+}
diff --git a/src/graphUtils.ts b/src/Utils/graphUtils.ts
similarity index 82%
rename from src/graphUtils.ts
rename to src/Utils/graphUtils.ts
index ec6a08f4..72b7ab45 100644
--- a/src/graphUtils.ts
+++ b/src/Utils/graphUtils.ts
@@ -3,20 +3,25 @@ import { dfsFromNode } from "graphology-traversal";
 import type { Attributes } from "graphology-types";
 import { info } from "loglevel";
 import type { App } from "obsidian";
-import { BC_I_REFLEXIVE, BC_ORDER } from "./constants";
+import type BCPlugin from "../../main";
+import { BC_I_REFLEXIVE, BC_ORDER, blankRealNImplied } from "../constants";
 // import { DIRECTIONS } from "./constants";
 import type {
   BCSettings,
   Directions,
   dvFrontmatterCache,
   NodePath,
+  RealNImplied,
   UserHier,
-} from "./interfaces";
+} from "../interfaces";
 import {
   fallbackOppField,
-  getBaseFromMDPath,
+  getFieldInfo,
   getFields,
-} from "./sharedFunctions";
+  getOppDir,
+  getOppFields,
+} from "./HierUtils";
+import { getBaseFromMDPath } from "./ObsidianUtils";
 
 // TODO - this is a hack to get the graph to work with the approvals
 // I shouldn't need
@@ -148,48 +153,9 @@ export const getOutNeighbours = (g: MultiGraph, node: string) =>
 export const getInNeighbours = (g: MultiGraph, node: string) =>
   g.hasNode(node) ? g.inNeighbors(node) : [];
 
-export const getOppDir = (dir: Directions): Directions => {
-  switch (dir) {
-    case "up":
-      return "down";
-    case "down":
-      return "up";
-    case "same":
-      return "same";
-    case "next":
-      return "prev";
-    case "prev":
-      return "next";
-  }
-};
-
 /**
  *  Get the hierarchy and direction that `field` is in
  * */
-export function getFieldInfo(userHiers: UserHier[], field: string) {
-  let fieldDir: Directions;
-  let fieldHier: UserHier;
-
-  DIRECTIONS.forEach((dir: Directions) => {
-    userHiers.forEach((hier) => {
-      if (hier[dir].includes(field)) {
-        fieldDir = dir;
-        fieldHier = hier;
-        return;
-      }
-    });
-  });
-  return { fieldHier, fieldDir };
-}
-
-export function getOppFields(userHiers: UserHier[], field: string) {
-  // If the field ends with `>`, it is already the opposite field we need (coming from getOppFallback`)
-  if (field.endsWith(">")) return field.slice(0, -4);
-  const { fieldHier, fieldDir } = getFieldInfo(userHiers, field);
-  if (!fieldHier || !fieldDir) return undefined;
-  const oppDir = getOppDir(fieldDir);
-  return fieldHier[oppDir];
-}
 
 export function dfsAllPaths(g: MultiGraph, start: string): string[][] {
   const queue: NodePath[] = [{ node: start, path: [] }];
@@ -354,3 +320,52 @@ export const getTargetOrder = (frontms: dvFrontmatterCache[], target: string) =>
 
 export const getSourceOrder = (frontm: dvFrontmatterCache) =>
   parseInt((frontm[BC_ORDER] as string) ?? "9999");
+
+/** Remember to filter by hierarchy in MatrixView! */
+export function getRealnImplied(
+  plugin: BCPlugin,
+  currNode: string,
+  dir: Directions = null
+): RealNImplied {
+  const realsnImplieds: RealNImplied = blankRealNImplied();
+  const { settings, closedG } = plugin;
+  const { userHiers } = settings;
+
+  if (!closedG.hasNode(currNode)) return realsnImplieds;
+  closedG.forEachEdge(currNode, (k, a, s, t) => {
+    const {
+      field,
+      dir: edgeDir,
+      implied,
+    } = a as { field: string; dir: Directions; implied?: string };
+    const oppField =
+      getOppFields(userHiers, field)[0] ?? fallbackOppField(field, edgeDir);
+
+    (dir ? [dir, getOppDir(dir)] : DIRECTIONS).forEach(
+      (currDir: Directions) => {
+        const oppDir = getOppDir(currDir);
+        // Reals
+        if (s === currNode && (edgeDir === currDir || edgeDir === oppDir)) {
+          const arr = realsnImplieds[edgeDir].reals;
+          if (arr.findIndex((item) => item.to === t) === -1) {
+            arr.push({ to: t, real: true, field, implied });
+          }
+        }
+        // Implieds
+        // If `s !== currNode` then `t` must be
+        else if (edgeDir === currDir || edgeDir === oppDir) {
+          const arr = realsnImplieds[getOppDir(edgeDir)].implieds;
+          if (arr.findIndex((item) => item.to === s) === -1) {
+            arr.push({
+              to: s,
+              real: false,
+              field: oppField,
+              implied,
+            });
+          }
+        }
+      }
+    );
+  });
+  return realsnImplieds;
+}
diff --git a/src/Views/MatrixView.ts b/src/Views/MatrixView.ts
index 6a564f5c..ebf8aa08 100644
--- a/src/Views/MatrixView.ts
+++ b/src/Views/MatrixView.ts
@@ -9,7 +9,6 @@ import {
   MATRIX_VIEW,
   TRAIL_ICON,
 } from "../constants";
-import { getOppDir } from "../graphUtils";
 import type {
   Directions,
   internalLinkObj,
@@ -19,11 +18,8 @@ import type {
 } from "../interfaces";
 import type BCPlugin from "../main";
 import { refreshIndex } from "../refreshIndex";
-import {
-  getMatrixNeighbours,
-  linkClass,
-  splitAndTrim,
-} from "../sharedFunctions";
+import { linkClass, splitAndTrim } from "../Utils/generalUtils";
+import { fallbackOppField, getOppDir, getOppFields } from "../Utils/HierUtils";
 
 export default class MatrixView extends ItemView {
   private plugin: BCPlugin;
@@ -129,6 +125,34 @@ export default class MatrixView extends ItemView {
   getOrder = (node: string) =>
     Number.parseInt(this.plugin.mainG.getNodeAttribute(node, "order"));
 
+  getMatrixNeighbours(plugin: BCPlugin, currNode: string) {
+    const { closedG } = plugin;
+    const { userHiers } = plugin.settings;
+    const neighbours = blankRealNImplied();
+    if (!closedG) return neighbours;
+
+    closedG.forEachEdge(currNode, (k, a, s, t) => {
+      const { field, dir, implied } = a as {
+        field: string;
+        dir: Directions;
+        implied?: string;
+      };
+
+      if (s === currNode) {
+        neighbours[dir].reals.push({ to: t, field, implied });
+      } else {
+        neighbours[getOppDir(dir)].implieds.push({
+          to: s,
+          field:
+            getOppFields(userHiers, field)[0] ?? fallbackOppField(field, dir),
+          implied,
+        });
+      }
+    });
+
+    return neighbours;
+  }
+
   getHierSquares(userHiers: UserHier[], currFile: TFile): SquareProps[][] {
     const { plugin } = this;
     const { mainG, settings } = plugin;
@@ -143,7 +167,7 @@ export default class MatrixView extends ItemView {
 
     const { basename } = currFile;
     // const realsnImplieds = getRealnImplied(plugin, basename);
-    const realsnImplieds = getMatrixNeighbours(plugin, basename);
+    const realsnImplieds = this.getMatrixNeighbours(plugin, basename);
 
     return userHiers.map((hier) => {
       const filteredRealNImplied: {
diff --git a/src/Views/TrailView.ts b/src/Views/TrailView.ts
index 36264032..8a734dcd 100644
--- a/src/Views/TrailView.ts
+++ b/src/Views/TrailView.ts
@@ -9,17 +9,20 @@ import {
   blankRealNImplied,
   JUGGL_TRAIL_DEFAULTS,
 } from "../constants";
+import type { BCSettings, EdgeAttr, RealNImplied } from "../interfaces";
+import type BCPlugin from "../main";
 import {
   bfsAllPaths,
-  getOppDir,
-  getOppFields,
   getReflexiveClosure,
   getSubForFields,
   getSubInDirs,
-} from "../graphUtils";
-import type { BCSettings, EdgeAttr, RealNImplied } from "../interfaces";
-import type BCPlugin from "../main";
-import { fallbackOppField, getFields } from "../sharedFunctions";
+} from "../Utils/graphUtils";
+import {
+  fallbackOppField,
+  getFields,
+  getOppDir,
+  getOppFields,
+} from "../Utils/HierUtils";
 import { createJugglTrail } from "../Visualisations/Juggl";
 
 function getLimitedTrailSub(plugin: BCPlugin) {
diff --git a/src/Visualisations/Juggl.ts b/src/Visualisations/Juggl.ts
index b41b856d..cc32cc75 100644
--- a/src/Visualisations/Juggl.ts
+++ b/src/Visualisations/Juggl.ts
@@ -16,8 +16,12 @@ import { Component, Events, MetadataCache, TFile } from "obsidian";
 import { createIndex } from "../Commands/CreateIndex";
 import JugglButton from "../Components/JugglButton.svelte";
 import { JUGGL_CB_DEFAULTS } from "../constants";
-import { dfsAllPaths, getReflexiveClosure, getSubInDirs } from "../graphUtils";
 import type BCPlugin from "../main";
+import {
+  dfsAllPaths,
+  getReflexiveClosure,
+  getSubInDirs,
+} from "../Utils/graphUtils";
 const STORE_ID = "core";
 
 class BCStoreEvents extends Events implements DataStoreEvents {}
diff --git a/src/Visualisations/VisModal.ts b/src/Visualisations/VisModal.ts
index 918e1dad..519856a7 100644
--- a/src/Visualisations/VisModal.ts
+++ b/src/Visualisations/VisModal.ts
@@ -1,10 +1,14 @@
 import * as d3 from "d3";
 import type Graph from "graphology";
 import { App, Modal, Notice } from "obsidian";
+import VisComp from "../Components/VisComp.svelte";
 import type { AdjListItem, d3Graph } from "../interfaces";
 import type BCPlugin from "../main";
-import { getInNeighbours, getOutNeighbours, getSinks } from "../graphUtils";
-import VisComp from "../Components/VisComp.svelte";
+import {
+  getInNeighbours,
+  getOutNeighbours,
+  getSinks,
+} from "../Utils/graphUtils";
 
 export function graphlibToD3(g: Graph): d3Graph {
   const d3Graph: d3Graph = { nodes: [], links: [] };
diff --git a/src/main.ts b/src/main.ts
index 531df652..408599e1 100644
--- a/src/main.ts
+++ b/src/main.ts
@@ -8,7 +8,6 @@ import {
 } from "obsidian-community-lib/dist/utils";
 import { Debugger } from "src/Debugger";
 import { HierarchyNoteSelectorModal } from "./AlternativeHierarchies/HierarchyNotes/HierNoteModal";
-import { BCSettingTab } from "./Settings/BreadcrumbsSettingTab";
 import { getCodeblockCB } from "./Codeblocks";
 import { copyGlobalIndex, copyLocalIndex } from "./Commands/CreateIndex";
 import { jumpToFirstDir } from "./Commands/jumpToFirstDir";
@@ -28,7 +27,8 @@ import {
 import { FieldSuggestor } from "./FieldSuggestor";
 import type { BCSettings, Directions, MyView, ViewInfo } from "./interfaces";
 import { buildClosedG, buildMainG, refreshIndex } from "./refreshIndex";
-import { getFields } from "./sharedFunctions";
+import { BCSettingTab } from "./Settings/BreadcrumbsSettingTab";
+import { getFields } from "./Utils/HierUtils";
 import DucksView from "./Views/DucksView";
 import MatrixView from "./Views/MatrixView";
 import StatsView from "./Views/StatsView";
diff --git a/src/refreshIndex.ts b/src/refreshIndex.ts
index 1ccc6f40..3f58ada8 100644
--- a/src/refreshIndex.ts
+++ b/src/refreshIndex.ts
@@ -31,16 +31,6 @@ import {
   dropHeaderOrAlias,
   splitLinksRegex,
 } from "./constants";
-import {
-  addEdgeIfNot,
-  addNodesIfNot,
-  buildObsGraph,
-  getFieldInfo,
-  getReflexiveClosure,
-  getSourceOrder,
-  getTargetOrder,
-  populateMain,
-} from "./graphUtils";
 import type {
   BCSettings,
   dvFrontmatterCache,
@@ -49,11 +39,16 @@ import type {
 } from "./interfaces";
 import type BCPlugin from "./main";
 import {
-  fallbackField,
-  getBaseFromMDPath,
-  getDVBasename,
-  iterateHiers,
-} from "./sharedFunctions";
+  addEdgeIfNot,
+  addNodesIfNot,
+  buildObsGraph,
+  getReflexiveClosure,
+  getSourceOrder,
+  getTargetOrder,
+  populateMain,
+} from "./Utils/graphUtils";
+import { fallbackField, getFieldInfo, iterateHiers } from "./Utils/HierUtils";
+import { getBaseFromMDPath, getDVBasename } from "./Utils/ObsidianUtils";
 import { drawTrail } from "./Views/TrailView";
 
 export function getDVMetadataCache(plugin: BCPlugin, files: TFile[]) {
diff --git a/src/sharedFunctions.ts b/src/sharedFunctions.ts
deleted file mode 100644
index b67afcca..00000000
--- a/src/sharedFunctions.ts
+++ /dev/null
@@ -1,382 +0,0 @@
-import type { App, FrontMatterCache, TFile } from "obsidian";
-import { isInVault } from "obsidian-community-lib";
-import {
-  ARROW_DIRECTIONS,
-  blankRealNImplied,
-  DIRECTIONS,
-  dropHeaderOrAlias,
-  regNFlags,
-  splitLinksRegex,
-} from "./constants";
-import { getOppDir, getOppFields } from "./graphUtils";
-import type {
-  BCSettings,
-  Directions,
-  MetaeditApi,
-  RealNImplied,
-  UserHier,
-} from "./interfaces";
-import type BCPlugin from "./main";
-
-export function sum(arr: number[]): number {
-  return arr.reduce((a, b) => a + b);
-}
-
-export function normalise(arr: number[]): number[] {
-  const max = Math.max(...arr);
-  return arr.map((item) => item / max);
-}
-
-export const isSubset = <T>(arr1: T[], arr2: T[]): boolean =>
-  arr1.every((value) => arr2.includes(value));
-
-export function splitAndDrop(str: string): string[] {
-  return (
-    str
-      ?.match(splitLinksRegex)
-      ?.map((link) => link.match(dropHeaderOrAlias)?.[1]) ?? []
-  );
-}
-
-export const dropPath = (path: string) => path.replace(/^.*\//, "");
-export const dropDendron = (path: string, settings: BCSettings) =>
-  settings.trimDendronNotes
-    ? path.split(settings.dendronNoteDelimiter).last()
-    : path;
-
-export const dropPathNDendron = (path: string, settings: BCSettings) =>
-  dropDendron(dropPath(path), settings);
-
-/**
- * Get basename from a **Markdown** `path`
- * @param  {string} path
- */
-export const getBaseFromMDPath = (path: string) => {
-  const splitSlash = path.split("/").last();
-  if (splitSlash.endsWith(".md")) {
-    return splitSlash.split(".md").slice(0, -1).join(".");
-  } else return splitSlash;
-};
-
-export const getDVBasename = (file: TFile) => file.basename || file.name;
-export const getFolderName = (file: TFile): string =>
-  //@ts-ignore
-  file?.parent?.name || file.folder;
-
-export const dropFolder = (path: string) =>
-  path.split("/").last().split(".").slice(0, -1).join(".");
-
-export const splitAndTrim = (fields: string): string[] => {
-  if (!fields || fields === "") return [];
-  else return fields.split(",").map((str) => str.trim());
-};
-
-export function padArray(arr: any[], finalLength: number, filler = ""): any[] {
-  const copy = [...arr];
-  const currLength = copy.length;
-  if (currLength > finalLength) {
-    throw new Error("Current length is greater than final length");
-  } else if (currLength === finalLength) {
-    return copy;
-  } else {
-    for (let i = currLength; i < finalLength; i++) {
-      copy.push(filler);
-    }
-    return copy;
-  }
-}
-
-export function transpose(A: any[][]): any[][] {
-  const cols = A[0].length;
-  const AT: any[][] = [];
-  // For each column
-  for (let j = 0; j < cols; j++) {
-    // Add a new row to AT
-    AT.push([]);
-    // And fill it with the values in the jth column of A
-    A.forEach((row) => AT[j].push(row[j]));
-  }
-  return AT;
-}
-
-export function runs(
-  arr: string[]
-): { value: string; first: number; last: number }[] {
-  const runs: { value: string; first: number; last: number }[] = [];
-  let i = 0;
-  while (i < arr.length) {
-    const currValue = arr[i];
-    runs.push({ value: currValue, first: i, last: undefined });
-    while (currValue === arr[i]) {
-      i++;
-    }
-    runs.last().last = i - 1;
-  }
-  return runs;
-}
-
-// SOURCE https://stackoverflow.com/questions/9960908/permutations-in-javascript
-export function permute(permutation: any[]): any[][] {
-  const length = permutation.length,
-    result = [permutation.slice()],
-    c = new Array(length).fill(0);
-
-  let i = 1,
-    k: number,
-    p: number;
-
-  while (i < length) {
-    if (c[i] < i) {
-      k = i % 2 && c[i];
-      p = permutation[i];
-      permutation[i] = permutation[k];
-      permutation[k] = p;
-      ++c[i];
-      i = 1;
-      result.push(permutation.slice());
-    } else {
-      c[i] = 0;
-      ++i;
-    }
-  }
-  return result;
-}
-
-export const range = (n: number) => [...Array(n).keys()];
-
-export function complement<T>(A: T[], B: T[]) {
-  return A.filter((a) => !B.includes(a));
-}
-
-export function makeWiki(str: string, wikiQ = true) {
-  let copy = str.slice();
-  if (wikiQ) {
-    copy = "[[" + copy;
-    copy += "]]";
-  }
-  return copy;
-}
-
-export function dropWikilinks(str: string) {
-  let copy = str.slice();
-  if (copy.startsWith("[[") && copy.endsWith("]]")) copy = copy.slice(2, -2);
-  return copy;
-}
-
-/**
- * Get all the fields in `dir`.
- * Returns all fields if `dir === 'all'`
- * @param  {UserHier[]} userHiers
- * @param  {Directions|"all"} dir
- */
-export function getFields(
-  userHiers: UserHier[],
-  dir: Directions | "all" = "all"
-) {
-  const fields: string[] = [];
-  userHiers.forEach((hier) => {
-    if (dir === "all") {
-      DIRECTIONS.forEach((eachDir) => {
-        fields.push(...hier[eachDir]);
-      });
-    } else {
-      fields.push(...hier[dir]);
-    }
-  });
-  return fields;
-}
-
-export const hierToStr = (hier: UserHier) =>
-  DIRECTIONS.map(
-    (dir) => `${ARROW_DIRECTIONS[dir]}: ${hier[dir].join(", ")}`
-  ).join("\n");
-
-export function removeDuplicates<T>(arr: T[]) {
-  return [...new Set(arr)];
-}
-
-/**
- * Adds or updates the given yaml `key` to `value` in the given TFile
- * @param  {string} key
- * @param  {string} value
- * @param  {TFile} file
- * @param  {FrontMatterCache|undefined} frontmatter
- * @param  {MetaeditApi} api
- */
-export const createOrUpdateYaml = async (
-  key: string,
-  value: string,
-  file: TFile,
-  frontmatter: FrontMatterCache | undefined,
-  api: MetaeditApi
-) => {
-  const valueStr = value.toString();
-
-  if (!frontmatter || frontmatter[key] === undefined) {
-    console.log(`Creating: ${key}: ${valueStr}`);
-    await api.createYamlProperty(key, `['${valueStr}']`, file);
-  } else if ([...[frontmatter[key]]].flat(3).some((val) => val == valueStr)) {
-    console.log("Already Exists!");
-    return;
-  } else {
-    const oldValueFlat: string[] = [...[frontmatter[key]]].flat(4);
-    const newValue = [...oldValueFlat, `'${valueStr}'`];
-    console.log(`Updating: ${key}: ${newValue}`);
-    await api.update(key, `[${newValue.join(", ")}]`, file);
-  }
-};
-
-export function splitAtYaml(content: string): [string, string] {
-  const startsWithYaml = content.startsWith("---");
-  if (!startsWithYaml) return ["", content];
-  else {
-    const splits = content.split("---");
-    return [
-      splits.slice(0, 2).join("---") + "---",
-      splits.slice(2).join("---"),
-    ];
-  }
-}
-
-export function swapItems<T>(i: number, j: number, arr: T[]) {
-  const max = arr.length - 1;
-  if (i < 0 || i > max || j < 0 || j > max) return arr;
-  const tmp = arr[i];
-  arr[i] = arr[j];
-  arr[j] = tmp;
-  return arr;
-}
-
-export const linkClass = (app: App, to: string, realQ = true) =>
-  `internal-link BC-Link ${isInVault(app, to) ? "" : "is-unresolved"} ${
-    realQ ? "" : "BC-Implied"
-  }`;
-
-export const fallbackField = (field: string, dir: Directions) =>
-  `${field} <${ARROW_DIRECTIONS[dir]}>`;
-export const fallbackOppField = (field: string, dir: Directions) =>
-  `${field} <${ARROW_DIRECTIONS[getOppDir(dir)]}>`;
-
-/** Remember to filter by hierarchy in MatrixView! */
-export function getRealnImplied(
-  plugin: BCPlugin,
-  currNode: string,
-  dir: Directions = null
-): RealNImplied {
-  const realsnImplieds: RealNImplied = blankRealNImplied();
-  const { settings, closedG } = plugin;
-  const { userHiers } = settings;
-
-  if (!closedG.hasNode(currNode)) return realsnImplieds;
-  closedG.forEachEdge(currNode, (k, a, s, t) => {
-    const {
-      field,
-      dir: edgeDir,
-      implied,
-    } = a as { field: string; dir: Directions; implied?: string };
-    const oppField =
-      getOppFields(userHiers, field)[0] ?? fallbackOppField(field, edgeDir);
-
-    (dir ? [dir, getOppDir(dir)] : DIRECTIONS).forEach((currDir) => {
-      const oppDir = getOppDir(currDir);
-      // Reals
-      if (s === currNode && (edgeDir === currDir || edgeDir === oppDir)) {
-        const arr = realsnImplieds[edgeDir].reals;
-        if (arr.findIndex((item) => item.to === t) === -1) {
-          arr.push({ to: t, real: true, field, implied });
-        }
-      }
-      // Implieds
-      // If `s !== currNode` then `t` must be
-      else if (edgeDir === currDir || edgeDir === oppDir) {
-        const arr = realsnImplieds[getOppDir(edgeDir)].implieds;
-        if (arr.findIndex((item) => item.to === s) === -1) {
-          arr.push({
-            to: s,
-            real: false,
-            field: oppField,
-            implied,
-          });
-        }
-      }
-    });
-  });
-  return realsnImplieds;
-}
-
-export function getMatrixNeighbours(plugin: BCPlugin, currNode: string) {
-  const { closedG } = plugin;
-  const { userHiers } = plugin.settings;
-  const neighbours = blankRealNImplied();
-  if (!closedG) return neighbours;
-
-  closedG.forEachEdge(currNode, (k, a, s, t) => {
-    const { field, dir, implied } = a as {
-      field: string;
-      dir: Directions;
-      implied?: string;
-    };
-
-    if (s === currNode) {
-      neighbours[dir].reals.push({ to: t, field, implied });
-    } else {
-      neighbours[getOppDir(dir)].implieds.push({
-        to: s,
-        field:
-          getOppFields(userHiers, field)[0] ?? fallbackOppField(field, dir),
-        implied,
-      });
-    }
-  });
-
-  return neighbours;
-}
-
-export function iterateHiers(
-  userHiers: UserHier[],
-  fn: (hier: UserHier, dir: Directions, field: string) => void
-) {
-  userHiers.forEach((hier) => {
-    DIRECTIONS.forEach((dir) => {
-      hier[dir].forEach((field) => {
-        fn(hier, dir, field);
-      });
-    });
-  });
-}
-
-export function strToRegex(input: string) {
-  const match = input.match(regNFlags);
-  if (!match) return null;
-  const [, innerRegex, flags] = match;
-  try {
-    const regex = new RegExp(innerRegex, flags);
-    return regex;
-  } catch (e) {
-    console.log(e);
-    return null;
-  }
-}
-
-export const dropHash = (tag: string) =>
-  tag.startsWith("#") ? tag.slice(1) : tag;
-
-export const addHash = (tag: string) => (tag.startsWith("#") ? tag : `#${tag}`);
-
-export function getAlt(node: string, plugin: BCPlugin): string | null {
-  const { app } = plugin;
-  const { altLinkFields, showAllAliases } = plugin.settings;
-  if (altLinkFields.length) {
-    const file = app.metadataCache.getFirstLinkpathDest(node, "");
-    if (file) {
-      const metadata = app.metadataCache.getFileCache(file);
-      for (const altField of altLinkFields) {
-        const value = metadata?.frontmatter?.[altField];
-
-        const arr: string[] =
-          typeof value === "string" ? splitAndTrim(value) : value;
-        if (value) return showAllAliases ? arr.join(", ") : arr[0];
-      }
-    }
-  } else return null;
-}
diff --git a/test/dfsAllPaths.ts b/test/dfsAllPaths.ts
index e38d8d9b..915e195c 100644
--- a/test/dfsAllPaths.ts
+++ b/test/dfsAllPaths.ts
@@ -1,5 +1,5 @@
 import { MultiGraph } from "graphology";
-import { dfsAllPaths } from "../src/graphUtils";
+import { dfsAllPaths } from "../src/Utils/graphUtils";
 import { testGraph, verify } from "./testUtils";
 
 require("approvals").mocha();
diff --git a/test/getReflexiveClosure.ts b/test/getReflexiveClosure.ts
index cbf0b6e7..69523e1e 100644
--- a/test/getReflexiveClosure.ts
+++ b/test/getReflexiveClosure.ts
@@ -1,5 +1,5 @@
 import { MultiGraph } from "graphology";
-import { getReflexiveClosure } from "../src/graphUtils";
+import { getReflexiveClosure } from "../src/Utils/graphUtils";
 import { testHiers, verify } from "./testUtils";
 
 require("approvals").mocha();