@opentrace/components 0.1.0-pr.110.8

package/dist/useHighlights-D6Jl6Woe.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"useHighlights-D6Jl6Woe.cjs","sources":["../node_modules/events/events.js","../node_modules/graphology/dist/graphology.mjs","../node_modules/graphology-utils/is-graph.js","../src/colors/nodeColors.ts","../src/colors/linkColors.ts","../src/colors/communityColors.ts","../src/graph/useGraphFilters.ts","../node_modules/graphology-utils/defaults.js","../node_modules/graphology-utils/infer-type.js","../node_modules/obliterator/iterator.js","../node_modules/mnemonist/utils/typed-arrays.js","../node_modules/mnemonist/sparse-map.js","../node_modules/mnemonist/sparse-queue-set.js","../node_modules/pandemonium/random-index.js","../node_modules/graphology-utils/getters.js","../node_modules/graphology-indices/louvain.js","../node_modules/graphology-communities-louvain/index.js","../src/graph/useCommunities.ts","../src/graph/useHighlights.ts"],"sourcesContent":["// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n  ? R.apply\n  : function ReflectApply(target, receiver, args) {\n    return Function.prototype.apply.call(target, receiver, args);\n  }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n  ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target)\n      .concat(Object.getOwnPropertySymbols(target));\n  };\n} else {\n  ReflectOwnKeys = function ReflectOwnKeys(target) {\n    return Object.getOwnPropertyNames(target);\n  };\n}\n\nfunction ProcessEmitWarning(warning) {\n  if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n  return value !== value;\n}\n\nfunction EventEmitter() {\n  EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n  if (typeof listener !== 'function') {\n    throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n  }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n  enumerable: true,\n  get: function() {\n    return defaultMaxListeners;\n  },\n  set: function(arg) {\n    if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n      throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n    }\n    defaultMaxListeners = arg;\n  }\n});\n\nEventEmitter.init = function() {\n\n  if (this._events === undefined ||\n      this._events === Object.getPrototypeOf(this)._events) {\n    this._events = Object.create(null);\n    this._eventsCount = 0;\n  }\n\n  this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n  if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n    throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n  }\n  this._maxListeners = n;\n  return this;\n};\n\nfunction _getMaxListeners(that) {\n  if (that._maxListeners === undefined)\n    return EventEmitter.defaultMaxListeners;\n  return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n  return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n  var args = [];\n  for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n  var doError = (type === 'error');\n\n  var events = this._events;\n  if (events !== undefined)\n    doError = (doError && events.error === undefined);\n  else if (!doError)\n    return false;\n\n  // If there is no 'error' event listener then throw.\n  if (doError) {\n    var er;\n    if (args.length > 0)\n      er = args[0];\n    if (er instanceof Error) {\n      // Note: The comments on the `throw` lines are intentional, they show\n      // up in Node's output if this results in an unhandled exception.\n      throw er; // Unhandled 'error' event\n    }\n    // At least give some kind of context to the user\n    var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n    err.context = er;\n    throw err; // Unhandled 'error' event\n  }\n\n  var handler = events[type];\n\n  if (handler === undefined)\n    return false;\n\n  if (typeof handler === 'function') {\n    ReflectApply(handler, this, args);\n  } else {\n    var len = handler.length;\n    var listeners = arrayClone(handler, len);\n    for (var i = 0; i < len; ++i)\n      ReflectApply(listeners[i], this, args);\n  }\n\n  return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n  var m;\n  var events;\n  var existing;\n\n  checkListener(listener);\n\n  events = target._events;\n  if (events === undefined) {\n    events = target._events = Object.create(null);\n    target._eventsCount = 0;\n  } else {\n    // To avoid recursion in the case that type === \"newListener\"! Before\n    // adding it to the listeners, first emit \"newListener\".\n    if (events.newListener !== undefined) {\n      target.emit('newListener', type,\n                  listener.listener ? listener.listener : listener);\n\n      // Re-assign `events` because a newListener handler could have caused the\n      // this._events to be assigned to a new object\n      events = target._events;\n    }\n    existing = events[type];\n  }\n\n  if (existing === undefined) {\n    // Optimize the case of one listener. Don't need the extra array object.\n    existing = events[type] = listener;\n    ++target._eventsCount;\n  } else {\n    if (typeof existing === 'function') {\n      // Adding the second element, need to change to array.\n      existing = events[type] =\n        prepend ? [listener, existing] : [existing, listener];\n      // If we've already got an array, just append.\n    } else if (prepend) {\n      existing.unshift(listener);\n    } else {\n      existing.push(listener);\n    }\n\n    // Check for listener leak\n    m = _getMaxListeners(target);\n    if (m > 0 && existing.length > m && !existing.warned) {\n      existing.warned = true;\n      // No error code for this since it is a Warning\n      // eslint-disable-next-line no-restricted-syntax\n      var w = new Error('Possible EventEmitter memory leak detected. ' +\n                          existing.length + ' ' + String(type) + ' listeners ' +\n                          'added. Use emitter.setMaxListeners() to ' +\n                          'increase limit');\n      w.name = 'MaxListenersExceededWarning';\n      w.emitter = target;\n      w.type = type;\n      w.count = existing.length;\n      ProcessEmitWarning(w);\n    }\n  }\n\n  return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n  return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n    function prependListener(type, listener) {\n      return _addListener(this, type, listener, true);\n    };\n\nfunction onceWrapper() {\n  if (!this.fired) {\n    this.target.removeListener(this.type, this.wrapFn);\n    this.fired = true;\n    if (arguments.length === 0)\n      return this.listener.call(this.target);\n    return this.listener.apply(this.target, arguments);\n  }\n}\n\nfunction _onceWrap(target, type, listener) {\n  var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n  var wrapped = onceWrapper.bind(state);\n  wrapped.listener = listener;\n  state.wrapFn = wrapped;\n  return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n  checkListener(listener);\n  this.on(type, _onceWrap(this, type, listener));\n  return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n    function prependOnceListener(type, listener) {\n      checkListener(listener);\n      this.prependListener(type, _onceWrap(this, type, listener));\n      return this;\n    };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n    function removeListener(type, listener) {\n      var list, events, position, i, originalListener;\n\n      checkListener(listener);\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      list = events[type];\n      if (list === undefined)\n        return this;\n\n      if (list === listener || list.listener === listener) {\n        if (--this._eventsCount === 0)\n          this._events = Object.create(null);\n        else {\n          delete events[type];\n          if (events.removeListener)\n            this.emit('removeListener', type, list.listener || listener);\n        }\n      } else if (typeof list !== 'function') {\n        position = -1;\n\n        for (i = list.length - 1; i >= 0; i--) {\n          if (list[i] === listener || list[i].listener === listener) {\n            originalListener = list[i].listener;\n            position = i;\n            break;\n          }\n        }\n\n        if (position < 0)\n          return this;\n\n        if (position === 0)\n          list.shift();\n        else {\n          spliceOne(list, position);\n        }\n\n        if (list.length === 1)\n          events[type] = list[0];\n\n        if (events.removeListener !== undefined)\n          this.emit('removeListener', type, originalListener || listener);\n      }\n\n      return this;\n    };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n    function removeAllListeners(type) {\n      var listeners, events, i;\n\n      events = this._events;\n      if (events === undefined)\n        return this;\n\n      // not listening for removeListener, no need to emit\n      if (events.removeListener === undefined) {\n        if (arguments.length === 0) {\n          this._events = Object.create(null);\n          this._eventsCount = 0;\n        } else if (events[type] !== undefined) {\n          if (--this._eventsCount === 0)\n            this._events = Object.create(null);\n          else\n            delete events[type];\n        }\n        return this;\n      }\n\n      // emit removeListener for all listeners on all events\n      if (arguments.length === 0) {\n        var keys = Object.keys(events);\n        var key;\n        for (i = 0; i < keys.length; ++i) {\n          key = keys[i];\n          if (key === 'removeListener') continue;\n          this.removeAllListeners(key);\n        }\n        this.removeAllListeners('removeListener');\n        this._events = Object.create(null);\n        this._eventsCount = 0;\n        return this;\n      }\n\n      listeners = events[type];\n\n      if (typeof listeners === 'function') {\n        this.removeListener(type, listeners);\n      } else if (listeners !== undefined) {\n        // LIFO order\n        for (i = listeners.length - 1; i >= 0; i--) {\n          this.removeListener(type, listeners[i]);\n        }\n      }\n\n      return this;\n    };\n\nfunction _listeners(target, type, unwrap) {\n  var events = target._events;\n\n  if (events === undefined)\n    return [];\n\n  var evlistener = events[type];\n  if (evlistener === undefined)\n    return [];\n\n  if (typeof evlistener === 'function')\n    return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n  return unwrap ?\n    unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n  return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n  return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n  if (typeof emitter.listenerCount === 'function') {\n    return emitter.listenerCount(type);\n  } else {\n    return listenerCount.call(emitter, type);\n  }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n  var events = this._events;\n\n  if (events !== undefined) {\n    var evlistener = events[type];\n\n    if (typeof evlistener === 'function') {\n      return 1;\n    } else if (evlistener !== undefined) {\n      return evlistener.length;\n    }\n  }\n\n  return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n  return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n  var copy = new Array(n);\n  for (var i = 0; i < n; ++i)\n    copy[i] = arr[i];\n  return copy;\n}\n\nfunction spliceOne(list, index) {\n  for (; index + 1 < list.length; index++)\n    list[index] = list[index + 1];\n  list.pop();\n}\n\nfunction unwrapListeners(arr) {\n  var ret = new Array(arr.length);\n  for (var i = 0; i < ret.length; ++i) {\n    ret[i] = arr[i].listener || arr[i];\n  }\n  return ret;\n}\n\nfunction once(emitter, name) {\n  return new Promise(function (resolve, reject) {\n    function errorListener(err) {\n      emitter.removeListener(name, resolver);\n      reject(err);\n    }\n\n    function resolver() {\n      if (typeof emitter.removeListener === 'function') {\n        emitter.removeListener('error', errorListener);\n      }\n      resolve([].slice.call(arguments));\n    };\n\n    eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n    if (name !== 'error') {\n      addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n    }\n  });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n  if (typeof emitter.on === 'function') {\n    eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n  }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n  if (typeof emitter.on === 'function') {\n    if (flags.once) {\n      emitter.once(name, listener);\n    } else {\n      emitter.on(name, listener);\n    }\n  } else if (typeof emitter.addEventListener === 'function') {\n    // EventTarget does not have `error` event semantics like Node\n    // EventEmitters, we do not listen for `error` events here.\n    emitter.addEventListener(name, function wrapListener(arg) {\n      // IE does not have builtin `{ once: true }` support so we\n      // have to do it manually.\n      if (flags.once) {\n        emitter.removeEventListener(name, wrapListener);\n      }\n      listener(arg);\n    });\n  } else {\n    throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n  }\n}\n","import { EventEmitter } from 'events';\n\n/**\n * Graphology Utilities\n * =====================\n *\n * Collection of helpful functions used by the implementation.\n */\n\n/**\n * Object.assign-like polyfill.\n *\n * @param  {object} target       - First object.\n * @param  {object} [...objects] - Objects to merge.\n * @return {object}\n */\nfunction assignPolyfill() {\n  const target = arguments[0];\n\n  for (let i = 1, l = arguments.length; i < l; i++) {\n    if (!arguments[i]) continue;\n\n    for (const k in arguments[i]) target[k] = arguments[i][k];\n  }\n\n  return target;\n}\n\nlet assign = assignPolyfill;\n\nif (typeof Object.assign === 'function') assign = Object.assign;\n\n/**\n * Function returning the first matching edge for given path.\n * Note: this function does not check the existence of source & target. This\n * must be performed by the caller.\n *\n * @param  {Graph}  graph  - Target graph.\n * @param  {any}    source - Source node.\n * @param  {any}    target - Target node.\n * @param  {string} type   - Type of the edge (mixed, directed or undirected).\n * @return {string|null}\n */\nfunction getMatchingEdge(graph, source, target, type) {\n  const sourceData = graph._nodes.get(source);\n\n  let edge = null;\n\n  if (!sourceData) return edge;\n\n  if (type === 'mixed') {\n    edge =\n      (sourceData.out && sourceData.out[target]) ||\n      (sourceData.undirected && sourceData.undirected[target]);\n  } else if (type === 'directed') {\n    edge = sourceData.out && sourceData.out[target];\n  } else {\n    edge = sourceData.undirected && sourceData.undirected[target];\n  }\n\n  return edge;\n}\n\n/**\n * Checks whether the given value is a plain object.\n *\n * @param  {mixed}   value - Target value.\n * @return {boolean}\n */\nfunction isPlainObject(value) {\n  // NOTE: as per https://github.com/graphology/graphology/issues/149\n  // this function has been loosened not to reject object instances\n  // coming from other JavaScript contexts. It has also been chosen\n  // not to improve it to avoid obvious false positives and avoid\n  // taking a performance hit. People should really use TypeScript\n  // if they want to avoid feeding subtly irrelvant attribute objects.\n  return typeof value === 'object' && value !== null;\n}\n\n/**\n * Checks whether the given object is empty.\n *\n * @param  {object}  o - Target Object.\n * @return {boolean}\n */\nfunction isEmpty(o) {\n  let k;\n\n  for (k in o) return false;\n\n  return true;\n}\n\n/**\n * Creates a \"private\" property for the given member name by concealing it\n * using the `enumerable` option.\n *\n * @param {object} target - Target object.\n * @param {string} name   - Member name.\n */\nfunction privateProperty(target, name, value) {\n  Object.defineProperty(target, name, {\n    enumerable: false,\n    configurable: false,\n    writable: true,\n    value\n  });\n}\n\n/**\n * Creates a read-only property for the given member name & the given getter.\n *\n * @param {object}   target - Target object.\n * @param {string}   name   - Member name.\n * @param {mixed}    value  - The attached getter or fixed value.\n */\nfunction readOnlyProperty(target, name, value) {\n  const descriptor = {\n    enumerable: true,\n    configurable: true\n  };\n\n  if (typeof value === 'function') {\n    descriptor.get = value;\n  } else {\n    descriptor.value = value;\n    descriptor.writable = false;\n  }\n\n  Object.defineProperty(target, name, descriptor);\n}\n\n/**\n * Returns whether the given object constitute valid hints.\n *\n * @param {object} hints - Target object.\n */\nfunction validateHints(hints) {\n  if (!isPlainObject(hints)) return false;\n\n  if (hints.attributes && !Array.isArray(hints.attributes)) return false;\n\n  return true;\n}\n\n/**\n * Creates a function generating incremental ids for edges.\n *\n * @return {function}\n */\nfunction incrementalIdStartingFromRandomByte() {\n  let i = Math.floor(Math.random() * 256) & 0xff;\n\n  return () => {\n    return i++;\n  };\n}\n\n/**\n * Chains multiple iterators into a single iterator.\n *\n * @param {...Iterator} iterables\n * @returns {Iterator}\n */\nfunction chain() {\n  const iterables = arguments;\n  let current = null;\n  let i = -1;\n\n  return {\n    [Symbol.iterator]() {\n      return this;\n    },\n    next() {\n      let step = null;\n\n      do {\n        if (current === null) {\n          i++;\n          if (i >= iterables.length) return {done: true};\n          current = iterables[i][Symbol.iterator]();\n        }\n        step = current.next();\n        if (step.done) {\n          current = null;\n          continue;\n        }\n        break;\n        // eslint-disable-next-line no-constant-condition\n      } while (true);\n\n      return step;\n    }\n  };\n}\n\nfunction emptyIterator() {\n  return {\n    [Symbol.iterator]() {\n      return this;\n    },\n    next() {\n      return {done: true};\n    }\n  };\n}\n\n/**\n * Graphology Custom Errors\n * =========================\n *\n * Defining custom errors for ease of use & easy unit tests across\n * implementations (normalized typology rather than relying on error\n * messages to check whether the correct error was found).\n */\nclass GraphError extends Error {\n  constructor(message) {\n    super();\n    this.name = 'GraphError';\n    this.message = message;\n  }\n}\n\nclass InvalidArgumentsGraphError extends GraphError {\n  constructor(message) {\n    super(message);\n    this.name = 'InvalidArgumentsGraphError';\n\n    // This is V8 specific to enhance stack readability\n    if (typeof Error.captureStackTrace === 'function')\n      Error.captureStackTrace(\n        this,\n        InvalidArgumentsGraphError.prototype.constructor\n      );\n  }\n}\n\nclass NotFoundGraphError extends GraphError {\n  constructor(message) {\n    super(message);\n    this.name = 'NotFoundGraphError';\n\n    // This is V8 specific to enhance stack readability\n    if (typeof Error.captureStackTrace === 'function')\n      Error.captureStackTrace(this, NotFoundGraphError.prototype.constructor);\n  }\n}\n\nclass UsageGraphError extends GraphError {\n  constructor(message) {\n    super(message);\n    this.name = 'UsageGraphError';\n\n    // This is V8 specific to enhance stack readability\n    if (typeof Error.captureStackTrace === 'function')\n      Error.captureStackTrace(this, UsageGraphError.prototype.constructor);\n  }\n}\n\n/**\n * Graphology Internal Data Classes\n * =================================\n *\n * Internal classes hopefully reduced to structs by engines & storing\n * necessary information for nodes & edges.\n *\n * Note that those classes don't rely on the `class` keyword to avoid some\n * cruft introduced by most of ES2015 transpilers.\n */\n\n/**\n * MixedNodeData class.\n *\n * @constructor\n * @param {string} string     - The node's key.\n * @param {object} attributes - Node's attributes.\n */\nfunction MixedNodeData(key, attributes) {\n  // Attributes\n  this.key = key;\n  this.attributes = attributes;\n\n  this.clear();\n}\n\nMixedNodeData.prototype.clear = function () {\n  // Degrees\n  this.inDegree = 0;\n  this.outDegree = 0;\n  this.undirectedDegree = 0;\n  this.undirectedLoops = 0;\n  this.directedLoops = 0;\n\n  // Indices\n  this.in = {};\n  this.out = {};\n  this.undirected = {};\n};\n\n/**\n * DirectedNodeData class.\n *\n * @constructor\n * @param {string} string     - The node's key.\n * @param {object} attributes - Node's attributes.\n */\nfunction DirectedNodeData(key, attributes) {\n  // Attributes\n  this.key = key;\n  this.attributes = attributes;\n\n  this.clear();\n}\n\nDirectedNodeData.prototype.clear = function () {\n  // Degrees\n  this.inDegree = 0;\n  this.outDegree = 0;\n  this.directedLoops = 0;\n\n  // Indices\n  this.in = {};\n  this.out = {};\n};\n\n/**\n * UndirectedNodeData class.\n *\n * @constructor\n * @param {string} string     - The node's key.\n * @param {object} attributes - Node's attributes.\n */\nfunction UndirectedNodeData(key, attributes) {\n  // Attributes\n  this.key = key;\n  this.attributes = attributes;\n\n  this.clear();\n}\n\nUndirectedNodeData.prototype.clear = function () {\n  // Degrees\n  this.undirectedDegree = 0;\n  this.undirectedLoops = 0;\n\n  // Indices\n  this.undirected = {};\n};\n\n/**\n * EdgeData class.\n *\n * @constructor\n * @param {boolean} undirected   - Whether the edge is undirected.\n * @param {string}  string       - The edge's key.\n * @param {string}  source       - Source of the edge.\n * @param {string}  target       - Target of the edge.\n * @param {object}  attributes   - Edge's attributes.\n */\nfunction EdgeData(undirected, key, source, target, attributes) {\n  // Attributes\n  this.key = key;\n  this.attributes = attributes;\n  this.undirected = undirected;\n\n  // Extremities\n  this.source = source;\n  this.target = target;\n}\n\nEdgeData.prototype.attach = function () {\n  let outKey = 'out';\n  let inKey = 'in';\n\n  if (this.undirected) outKey = inKey = 'undirected';\n\n  const source = this.source.key;\n  const target = this.target.key;\n\n  // Handling source\n  this.source[outKey][target] = this;\n\n  if (this.undirected && source === target) return;\n\n  // Handling target\n  this.target[inKey][source] = this;\n};\n\nEdgeData.prototype.attachMulti = function () {\n  let outKey = 'out';\n  let inKey = 'in';\n\n  const source = this.source.key;\n  const target = this.target.key;\n\n  if (this.undirected) outKey = inKey = 'undirected';\n\n  // Handling source\n  const adj = this.source[outKey];\n  const head = adj[target];\n\n  if (typeof head === 'undefined') {\n    adj[target] = this;\n\n    // Self-loop optimization\n    if (!(this.undirected && source === target)) {\n      // Handling target\n      this.target[inKey][source] = this;\n    }\n\n    return;\n  }\n\n  // Prepending to doubly-linked list\n  head.previous = this;\n  this.next = head;\n\n  // Pointing to new head\n  // NOTE: use mutating swap later to avoid lookup?\n  adj[target] = this;\n  this.target[inKey][source] = this;\n};\n\nEdgeData.prototype.detach = function () {\n  const source = this.source.key;\n  const target = this.target.key;\n\n  let outKey = 'out';\n  let inKey = 'in';\n\n  if (this.undirected) outKey = inKey = 'undirected';\n\n  delete this.source[outKey][target];\n\n  // No-op delete in case of undirected self-loop\n  delete this.target[inKey][source];\n};\n\nEdgeData.prototype.detachMulti = function () {\n  const source = this.source.key;\n  const target = this.target.key;\n\n  let outKey = 'out';\n  let inKey = 'in';\n\n  if (this.undirected) outKey = inKey = 'undirected';\n\n  // Deleting from doubly-linked list\n  if (this.previous === undefined) {\n    // We are dealing with the head\n\n    // Should we delete the adjacency entry because it is now empty?\n    if (this.next === undefined) {\n      delete this.source[outKey][target];\n\n      // No-op delete in case of undirected self-loop\n      delete this.target[inKey][source];\n    } else {\n      // Detaching\n      this.next.previous = undefined;\n\n      // NOTE: could avoid the lookups by creating a #.become mutating method\n      this.source[outKey][target] = this.next;\n\n      // No-op delete in case of undirected self-loop\n      this.target[inKey][source] = this.next;\n    }\n  } else {\n    // We are dealing with another list node\n    this.previous.next = this.next;\n\n    // If not last\n    if (this.next !== undefined) {\n      this.next.previous = this.previous;\n    }\n  }\n};\n\n/**\n * Graphology Node Attributes methods\n * ===================================\n */\n\nconst NODE = 0;\nconst SOURCE = 1;\nconst TARGET = 2;\nconst OPPOSITE = 3;\n\nfunction findRelevantNodeData(\n  graph,\n  method,\n  mode,\n  nodeOrEdge,\n  nameOrEdge,\n  add1,\n  add2\n) {\n  let nodeData, edgeData, arg1, arg2;\n\n  nodeOrEdge = '' + nodeOrEdge;\n\n  if (mode === NODE) {\n    nodeData = graph._nodes.get(nodeOrEdge);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.${method}: could not find the \"${nodeOrEdge}\" node in the graph.`\n      );\n\n    arg1 = nameOrEdge;\n    arg2 = add1;\n  } else if (mode === OPPOSITE) {\n    nameOrEdge = '' + nameOrEdge;\n\n    edgeData = graph._edges.get(nameOrEdge);\n\n    if (!edgeData)\n      throw new NotFoundGraphError(\n        `Graph.${method}: could not find the \"${nameOrEdge}\" edge in the graph.`\n      );\n\n    const source = edgeData.source.key;\n    const target = edgeData.target.key;\n\n    if (nodeOrEdge === source) {\n      nodeData = edgeData.target;\n    } else if (nodeOrEdge === target) {\n      nodeData = edgeData.source;\n    } else {\n      throw new NotFoundGraphError(\n        `Graph.${method}: the \"${nodeOrEdge}\" node is not attached to the \"${nameOrEdge}\" edge (${source}, ${target}).`\n      );\n    }\n\n    arg1 = add1;\n    arg2 = add2;\n  } else {\n    edgeData = graph._edges.get(nodeOrEdge);\n\n    if (!edgeData)\n      throw new NotFoundGraphError(\n        `Graph.${method}: could not find the \"${nodeOrEdge}\" edge in the graph.`\n      );\n\n    if (mode === SOURCE) {\n      nodeData = edgeData.source;\n    } else {\n      nodeData = edgeData.target;\n    }\n\n    arg1 = nameOrEdge;\n    arg2 = add1;\n  }\n\n  return [nodeData, arg1, arg2];\n}\n\nfunction attachNodeAttributeGetter(Class, method, mode) {\n  Class.prototype[method] = function (nodeOrEdge, nameOrEdge, add1) {\n    const [data, name] = findRelevantNodeData(\n      this,\n      method,\n      mode,\n      nodeOrEdge,\n      nameOrEdge,\n      add1\n    );\n\n    return data.attributes[name];\n  };\n}\n\nfunction attachNodeAttributesGetter(Class, method, mode) {\n  Class.prototype[method] = function (nodeOrEdge, nameOrEdge) {\n    const [data] = findRelevantNodeData(\n      this,\n      method,\n      mode,\n      nodeOrEdge,\n      nameOrEdge\n    );\n\n    return data.attributes;\n  };\n}\n\nfunction attachNodeAttributeChecker(Class, method, mode) {\n  Class.prototype[method] = function (nodeOrEdge, nameOrEdge, add1) {\n    const [data, name] = findRelevantNodeData(\n      this,\n      method,\n      mode,\n      nodeOrEdge,\n      nameOrEdge,\n      add1\n    );\n\n    return data.attributes.hasOwnProperty(name);\n  };\n}\n\nfunction attachNodeAttributeSetter(Class, method, mode) {\n  Class.prototype[method] = function (nodeOrEdge, nameOrEdge, add1, add2) {\n    const [data, name, value] = findRelevantNodeData(\n      this,\n      method,\n      mode,\n      nodeOrEdge,\n      nameOrEdge,\n      add1,\n      add2\n    );\n\n    data.attributes[name] = value;\n\n    // Emitting\n    this.emit('nodeAttributesUpdated', {\n      key: data.key,\n      type: 'set',\n      attributes: data.attributes,\n      name\n    });\n\n    return this;\n  };\n}\n\nfunction attachNodeAttributeUpdater(Class, method, mode) {\n  Class.prototype[method] = function (nodeOrEdge, nameOrEdge, add1, add2) {\n    const [data, name, updater] = findRelevantNodeData(\n      this,\n      method,\n      mode,\n      nodeOrEdge,\n      nameOrEdge,\n      add1,\n      add2\n    );\n\n    if (typeof updater !== 'function')\n      throw new InvalidArgumentsGraphError(\n        `Graph.${method}: updater should be a function.`\n      );\n\n    const attributes = data.attributes;\n    const value = updater(attributes[name]);\n\n    attributes[name] = value;\n\n    // Emitting\n    this.emit('nodeAttributesUpdated', {\n      key: data.key,\n      type: 'set',\n      attributes: data.attributes,\n      name\n    });\n\n    return this;\n  };\n}\n\nfunction attachNodeAttributeRemover(Class, method, mode) {\n  Class.prototype[method] = function (nodeOrEdge, nameOrEdge, add1) {\n    const [data, name] = findRelevantNodeData(\n      this,\n      method,\n      mode,\n      nodeOrEdge,\n      nameOrEdge,\n      add1\n    );\n\n    delete data.attributes[name];\n\n    // Emitting\n    this.emit('nodeAttributesUpdated', {\n      key: data.key,\n      type: 'remove',\n      attributes: data.attributes,\n      name\n    });\n\n    return this;\n  };\n}\n\nfunction attachNodeAttributesReplacer(Class, method, mode) {\n  Class.prototype[method] = function (nodeOrEdge, nameOrEdge, add1) {\n    const [data, attributes] = findRelevantNodeData(\n      this,\n      method,\n      mode,\n      nodeOrEdge,\n      nameOrEdge,\n      add1\n    );\n\n    if (!isPlainObject(attributes))\n      throw new InvalidArgumentsGraphError(\n        `Graph.${method}: provided attributes are not a plain object.`\n      );\n\n    data.attributes = attributes;\n\n    // Emitting\n    this.emit('nodeAttributesUpdated', {\n      key: data.key,\n      type: 'replace',\n      attributes: data.attributes\n    });\n\n    return this;\n  };\n}\n\nfunction attachNodeAttributesMerger(Class, method, mode) {\n  Class.prototype[method] = function (nodeOrEdge, nameOrEdge, add1) {\n    const [data, attributes] = findRelevantNodeData(\n      this,\n      method,\n      mode,\n      nodeOrEdge,\n      nameOrEdge,\n      add1\n    );\n\n    if (!isPlainObject(attributes))\n      throw new InvalidArgumentsGraphError(\n        `Graph.${method}: provided attributes are not a plain object.`\n      );\n\n    assign(data.attributes, attributes);\n\n    // Emitting\n    this.emit('nodeAttributesUpdated', {\n      key: data.key,\n      type: 'merge',\n      attributes: data.attributes,\n      data: attributes\n    });\n\n    return this;\n  };\n}\n\nfunction attachNodeAttributesUpdater(Class, method, mode) {\n  Class.prototype[method] = function (nodeOrEdge, nameOrEdge, add1) {\n    const [data, updater] = findRelevantNodeData(\n      this,\n      method,\n      mode,\n      nodeOrEdge,\n      nameOrEdge,\n      add1\n    );\n\n    if (typeof updater !== 'function')\n      throw new InvalidArgumentsGraphError(\n        `Graph.${method}: provided updater is not a function.`\n      );\n\n    data.attributes = updater(data.attributes);\n\n    // Emitting\n    this.emit('nodeAttributesUpdated', {\n      key: data.key,\n      type: 'update',\n      attributes: data.attributes\n    });\n\n    return this;\n  };\n}\n\n/**\n * List of methods to attach.\n */\nconst NODE_ATTRIBUTES_METHODS = [\n  {\n    name: element => `get${element}Attribute`,\n    attacher: attachNodeAttributeGetter\n  },\n  {\n    name: element => `get${element}Attributes`,\n    attacher: attachNodeAttributesGetter\n  },\n  {\n    name: element => `has${element}Attribute`,\n    attacher: attachNodeAttributeChecker\n  },\n  {\n    name: element => `set${element}Attribute`,\n    attacher: attachNodeAttributeSetter\n  },\n  {\n    name: element => `update${element}Attribute`,\n    attacher: attachNodeAttributeUpdater\n  },\n  {\n    name: element => `remove${element}Attribute`,\n    attacher: attachNodeAttributeRemover\n  },\n  {\n    name: element => `replace${element}Attributes`,\n    attacher: attachNodeAttributesReplacer\n  },\n  {\n    name: element => `merge${element}Attributes`,\n    attacher: attachNodeAttributesMerger\n  },\n  {\n    name: element => `update${element}Attributes`,\n    attacher: attachNodeAttributesUpdater\n  }\n];\n\n/**\n * Attach every attributes-related methods to a Graph class.\n *\n * @param {function} Graph - Target class.\n */\nfunction attachNodeAttributesMethods(Graph) {\n  NODE_ATTRIBUTES_METHODS.forEach(function ({name, attacher}) {\n    // For nodes\n    attacher(Graph, name('Node'), NODE);\n\n    // For sources\n    attacher(Graph, name('Source'), SOURCE);\n\n    // For targets\n    attacher(Graph, name('Target'), TARGET);\n\n    // For opposites\n    attacher(Graph, name('Opposite'), OPPOSITE);\n  });\n}\n\n/**\n * Graphology Edge Attributes methods\n * ===================================\n */\n\n/**\n * Attach an attribute getter method onto the provided class.\n *\n * @param {function} Class         - Target class.\n * @param {string}   method        - Method name.\n * @param {string}   type          - Type of the edge to find.\n */\nfunction attachEdgeAttributeGetter(Class, method, type) {\n  /**\n   * Get the desired attribute for the given element (node or edge).\n   *\n   * Arity 2:\n   * @param  {any}    element - Target element.\n   * @param  {string} name    - Attribute's name.\n   *\n   * Arity 3 (only for edges):\n   * @param  {any}     source - Source element.\n   * @param  {any}     target - Target element.\n   * @param  {string}  name   - Attribute's name.\n   *\n   * @return {mixed}          - The attribute's value.\n   *\n   * @throws {Error} - Will throw if too many arguments are provided.\n   * @throws {Error} - Will throw if any of the elements is not found.\n   */\n  Class.prototype[method] = function (element, name) {\n    let data;\n\n    if (this.type !== 'mixed' && type !== 'mixed' && type !== this.type)\n      throw new UsageGraphError(\n        `Graph.${method}: cannot find this type of edges in your ${this.type} graph.`\n      );\n\n    if (arguments.length > 2) {\n      if (this.multi)\n        throw new UsageGraphError(\n          `Graph.${method}: 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.`\n        );\n\n      const source = '' + element;\n      const target = '' + name;\n\n      name = arguments[2];\n\n      data = getMatchingEdge(this, source, target, type);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find an edge for the given path (\"${source}\" - \"${target}\").`\n        );\n    } else {\n      if (type !== 'mixed')\n        throw new UsageGraphError(\n          `Graph.${method}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`\n        );\n\n      element = '' + element;\n      data = this._edges.get(element);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find the \"${element}\" edge in the graph.`\n        );\n    }\n\n    return data.attributes[name];\n  };\n}\n\n/**\n * Attach an attributes getter method onto the provided class.\n *\n * @param {function} Class       - Target class.\n * @param {string}   method      - Method name.\n * @param {string}   type        - Type of the edge to find.\n */\nfunction attachEdgeAttributesGetter(Class, method, type) {\n  /**\n   * Retrieves all the target element's attributes.\n   *\n   * Arity 2:\n   * @param  {any}    element - Target element.\n   *\n   * Arity 3 (only for edges):\n   * @param  {any}     source - Source element.\n   * @param  {any}     target - Target element.\n   *\n   * @return {object}          - The element's attributes.\n   *\n   * @throws {Error} - Will throw if too many arguments are provided.\n   * @throws {Error} - Will throw if any of the elements is not found.\n   */\n  Class.prototype[method] = function (element) {\n    let data;\n\n    if (this.type !== 'mixed' && type !== 'mixed' && type !== this.type)\n      throw new UsageGraphError(\n        `Graph.${method}: cannot find this type of edges in your ${this.type} graph.`\n      );\n\n    if (arguments.length > 1) {\n      if (this.multi)\n        throw new UsageGraphError(\n          `Graph.${method}: 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.`\n        );\n\n      const source = '' + element,\n        target = '' + arguments[1];\n\n      data = getMatchingEdge(this, source, target, type);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find an edge for the given path (\"${source}\" - \"${target}\").`\n        );\n    } else {\n      if (type !== 'mixed')\n        throw new UsageGraphError(\n          `Graph.${method}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`\n        );\n\n      element = '' + element;\n      data = this._edges.get(element);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find the \"${element}\" edge in the graph.`\n        );\n    }\n\n    return data.attributes;\n  };\n}\n\n/**\n * Attach an attribute checker method onto the provided class.\n *\n * @param {function} Class       - Target class.\n * @param {string}   method      - Method name.\n * @param {string}   type        - Type of the edge to find.\n */\nfunction attachEdgeAttributeChecker(Class, method, type) {\n  /**\n   * Checks whether the desired attribute is set for the given element (node or edge).\n   *\n   * Arity 2:\n   * @param  {any}    element - Target element.\n   * @param  {string} name    - Attribute's name.\n   *\n   * Arity 3 (only for edges):\n   * @param  {any}     source - Source element.\n   * @param  {any}     target - Target element.\n   * @param  {string}  name   - Attribute's name.\n   *\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if too many arguments are provided.\n   * @throws {Error} - Will throw if any of the elements is not found.\n   */\n  Class.prototype[method] = function (element, name) {\n    let data;\n\n    if (this.type !== 'mixed' && type !== 'mixed' && type !== this.type)\n      throw new UsageGraphError(\n        `Graph.${method}: cannot find this type of edges in your ${this.type} graph.`\n      );\n\n    if (arguments.length > 2) {\n      if (this.multi)\n        throw new UsageGraphError(\n          `Graph.${method}: 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.`\n        );\n\n      const source = '' + element;\n      const target = '' + name;\n\n      name = arguments[2];\n\n      data = getMatchingEdge(this, source, target, type);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find an edge for the given path (\"${source}\" - \"${target}\").`\n        );\n    } else {\n      if (type !== 'mixed')\n        throw new UsageGraphError(\n          `Graph.${method}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`\n        );\n\n      element = '' + element;\n      data = this._edges.get(element);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find the \"${element}\" edge in the graph.`\n        );\n    }\n\n    return data.attributes.hasOwnProperty(name);\n  };\n}\n\n/**\n * Attach an attribute setter method onto the provided class.\n *\n * @param {function} Class         - Target class.\n * @param {string}   method        - Method name.\n * @param {string}   type          - Type of the edge to find.\n */\nfunction attachEdgeAttributeSetter(Class, method, type) {\n  /**\n   * Set the desired attribute for the given element (node or edge).\n   *\n   * Arity 2:\n   * @param  {any}    element - Target element.\n   * @param  {string} name    - Attribute's name.\n   * @param  {mixed}  value   - New attribute value.\n   *\n   * Arity 3 (only for edges):\n   * @param  {any}     source - Source element.\n   * @param  {any}     target - Target element.\n   * @param  {string}  name   - Attribute's name.\n   * @param  {mixed}  value   - New attribute value.\n   *\n   * @return {Graph}          - Returns itself for chaining.\n   *\n   * @throws {Error} - Will throw if too many arguments are provided.\n   * @throws {Error} - Will throw if any of the elements is not found.\n   */\n  Class.prototype[method] = function (element, name, value) {\n    let data;\n\n    if (this.type !== 'mixed' && type !== 'mixed' && type !== this.type)\n      throw new UsageGraphError(\n        `Graph.${method}: cannot find this type of edges in your ${this.type} graph.`\n      );\n\n    if (arguments.length > 3) {\n      if (this.multi)\n        throw new UsageGraphError(\n          `Graph.${method}: 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.`\n        );\n\n      const source = '' + element;\n      const target = '' + name;\n\n      name = arguments[2];\n      value = arguments[3];\n\n      data = getMatchingEdge(this, source, target, type);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find an edge for the given path (\"${source}\" - \"${target}\").`\n        );\n    } else {\n      if (type !== 'mixed')\n        throw new UsageGraphError(\n          `Graph.${method}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`\n        );\n\n      element = '' + element;\n      data = this._edges.get(element);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find the \"${element}\" edge in the graph.`\n        );\n    }\n\n    data.attributes[name] = value;\n\n    // Emitting\n    this.emit('edgeAttributesUpdated', {\n      key: data.key,\n      type: 'set',\n      attributes: data.attributes,\n      name\n    });\n\n    return this;\n  };\n}\n\n/**\n * Attach an attribute updater method onto the provided class.\n *\n * @param {function} Class         - Target class.\n * @param {string}   method        - Method name.\n * @param {string}   type          - Type of the edge to find.\n */\nfunction attachEdgeAttributeUpdater(Class, method, type) {\n  /**\n   * Update the desired attribute for the given element (node or edge) using\n   * the provided function.\n   *\n   * Arity 2:\n   * @param  {any}      element - Target element.\n   * @param  {string}   name    - Attribute's name.\n   * @param  {function} updater - Updater function.\n   *\n   * Arity 3 (only for edges):\n   * @param  {any}      source  - Source element.\n   * @param  {any}      target  - Target element.\n   * @param  {string}   name    - Attribute's name.\n   * @param  {function} updater - Updater function.\n   *\n   * @return {Graph}            - Returns itself for chaining.\n   *\n   * @throws {Error} - Will throw if too many arguments are provided.\n   * @throws {Error} - Will throw if any of the elements is not found.\n   */\n  Class.prototype[method] = function (element, name, updater) {\n    let data;\n\n    if (this.type !== 'mixed' && type !== 'mixed' && type !== this.type)\n      throw new UsageGraphError(\n        `Graph.${method}: cannot find this type of edges in your ${this.type} graph.`\n      );\n\n    if (arguments.length > 3) {\n      if (this.multi)\n        throw new UsageGraphError(\n          `Graph.${method}: 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.`\n        );\n\n      const source = '' + element;\n      const target = '' + name;\n\n      name = arguments[2];\n      updater = arguments[3];\n\n      data = getMatchingEdge(this, source, target, type);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find an edge for the given path (\"${source}\" - \"${target}\").`\n        );\n    } else {\n      if (type !== 'mixed')\n        throw new UsageGraphError(\n          `Graph.${method}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`\n        );\n\n      element = '' + element;\n      data = this._edges.get(element);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find the \"${element}\" edge in the graph.`\n        );\n    }\n\n    if (typeof updater !== 'function')\n      throw new InvalidArgumentsGraphError(\n        `Graph.${method}: updater should be a function.`\n      );\n\n    data.attributes[name] = updater(data.attributes[name]);\n\n    // Emitting\n    this.emit('edgeAttributesUpdated', {\n      key: data.key,\n      type: 'set',\n      attributes: data.attributes,\n      name\n    });\n\n    return this;\n  };\n}\n\n/**\n * Attach an attribute remover method onto the provided class.\n *\n * @param {function} Class         - Target class.\n * @param {string}   method        - Method name.\n * @param {string}   type          - Type of the edge to find.\n */\nfunction attachEdgeAttributeRemover(Class, method, type) {\n  /**\n   * Remove the desired attribute for the given element (node or edge).\n   *\n   * Arity 2:\n   * @param  {any}    element - Target element.\n   * @param  {string} name    - Attribute's name.\n   *\n   * Arity 3 (only for edges):\n   * @param  {any}     source - Source element.\n   * @param  {any}     target - Target element.\n   * @param  {string}  name   - Attribute's name.\n   *\n   * @return {Graph}          - Returns itself for chaining.\n   *\n   * @throws {Error} - Will throw if too many arguments are provided.\n   * @throws {Error} - Will throw if any of the elements is not found.\n   */\n  Class.prototype[method] = function (element, name) {\n    let data;\n\n    if (this.type !== 'mixed' && type !== 'mixed' && type !== this.type)\n      throw new UsageGraphError(\n        `Graph.${method}: cannot find this type of edges in your ${this.type} graph.`\n      );\n\n    if (arguments.length > 2) {\n      if (this.multi)\n        throw new UsageGraphError(\n          `Graph.${method}: 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.`\n        );\n\n      const source = '' + element;\n      const target = '' + name;\n\n      name = arguments[2];\n\n      data = getMatchingEdge(this, source, target, type);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find an edge for the given path (\"${source}\" - \"${target}\").`\n        );\n    } else {\n      if (type !== 'mixed')\n        throw new UsageGraphError(\n          `Graph.${method}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`\n        );\n\n      element = '' + element;\n      data = this._edges.get(element);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find the \"${element}\" edge in the graph.`\n        );\n    }\n\n    delete data.attributes[name];\n\n    // Emitting\n    this.emit('edgeAttributesUpdated', {\n      key: data.key,\n      type: 'remove',\n      attributes: data.attributes,\n      name\n    });\n\n    return this;\n  };\n}\n\n/**\n * Attach an attribute replacer method onto the provided class.\n *\n * @param {function} Class         - Target class.\n * @param {string}   method        - Method name.\n * @param {string}   type          - Type of the edge to find.\n */\nfunction attachEdgeAttributesReplacer(Class, method, type) {\n  /**\n   * Replace the attributes for the given element (node or edge).\n   *\n   * Arity 2:\n   * @param  {any}    element    - Target element.\n   * @param  {object} attributes - New attributes.\n   *\n   * Arity 3 (only for edges):\n   * @param  {any}     source     - Source element.\n   * @param  {any}     target     - Target element.\n   * @param  {object}  attributes - New attributes.\n   *\n   * @return {Graph}              - Returns itself for chaining.\n   *\n   * @throws {Error} - Will throw if too many arguments are provided.\n   * @throws {Error} - Will throw if any of the elements is not found.\n   */\n  Class.prototype[method] = function (element, attributes) {\n    let data;\n\n    if (this.type !== 'mixed' && type !== 'mixed' && type !== this.type)\n      throw new UsageGraphError(\n        `Graph.${method}: cannot find this type of edges in your ${this.type} graph.`\n      );\n\n    if (arguments.length > 2) {\n      if (this.multi)\n        throw new UsageGraphError(\n          `Graph.${method}: 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.`\n        );\n\n      const source = '' + element,\n        target = '' + attributes;\n\n      attributes = arguments[2];\n\n      data = getMatchingEdge(this, source, target, type);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find an edge for the given path (\"${source}\" - \"${target}\").`\n        );\n    } else {\n      if (type !== 'mixed')\n        throw new UsageGraphError(\n          `Graph.${method}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`\n        );\n\n      element = '' + element;\n      data = this._edges.get(element);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find the \"${element}\" edge in the graph.`\n        );\n    }\n\n    if (!isPlainObject(attributes))\n      throw new InvalidArgumentsGraphError(\n        `Graph.${method}: provided attributes are not a plain object.`\n      );\n\n    data.attributes = attributes;\n\n    // Emitting\n    this.emit('edgeAttributesUpdated', {\n      key: data.key,\n      type: 'replace',\n      attributes: data.attributes\n    });\n\n    return this;\n  };\n}\n\n/**\n * Attach an attribute merger method onto the provided class.\n *\n * @param {function} Class         - Target class.\n * @param {string}   method        - Method name.\n * @param {string}   type          - Type of the edge to find.\n */\nfunction attachEdgeAttributesMerger(Class, method, type) {\n  /**\n   * Merge the attributes for the given element (node or edge).\n   *\n   * Arity 2:\n   * @param  {any}    element    - Target element.\n   * @param  {object} attributes - Attributes to merge.\n   *\n   * Arity 3 (only for edges):\n   * @param  {any}     source     - Source element.\n   * @param  {any}     target     - Target element.\n   * @param  {object}  attributes - Attributes to merge.\n   *\n   * @return {Graph}              - Returns itself for chaining.\n   *\n   * @throws {Error} - Will throw if too many arguments are provided.\n   * @throws {Error} - Will throw if any of the elements is not found.\n   */\n  Class.prototype[method] = function (element, attributes) {\n    let data;\n\n    if (this.type !== 'mixed' && type !== 'mixed' && type !== this.type)\n      throw new UsageGraphError(\n        `Graph.${method}: cannot find this type of edges in your ${this.type} graph.`\n      );\n\n    if (arguments.length > 2) {\n      if (this.multi)\n        throw new UsageGraphError(\n          `Graph.${method}: 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.`\n        );\n\n      const source = '' + element,\n        target = '' + attributes;\n\n      attributes = arguments[2];\n\n      data = getMatchingEdge(this, source, target, type);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find an edge for the given path (\"${source}\" - \"${target}\").`\n        );\n    } else {\n      if (type !== 'mixed')\n        throw new UsageGraphError(\n          `Graph.${method}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`\n        );\n\n      element = '' + element;\n      data = this._edges.get(element);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find the \"${element}\" edge in the graph.`\n        );\n    }\n\n    if (!isPlainObject(attributes))\n      throw new InvalidArgumentsGraphError(\n        `Graph.${method}: provided attributes are not a plain object.`\n      );\n\n    assign(data.attributes, attributes);\n\n    // Emitting\n    this.emit('edgeAttributesUpdated', {\n      key: data.key,\n      type: 'merge',\n      attributes: data.attributes,\n      data: attributes\n    });\n\n    return this;\n  };\n}\n\n/**\n * Attach an attribute updater method onto the provided class.\n *\n * @param {function} Class         - Target class.\n * @param {string}   method        - Method name.\n * @param {string}   type          - Type of the edge to find.\n */\nfunction attachEdgeAttributesUpdater(Class, method, type) {\n  /**\n   * Update the attributes of the given element (node or edge).\n   *\n   * Arity 2:\n   * @param  {any}      element - Target element.\n   * @param  {function} updater - Updater function.\n   *\n   * Arity 3 (only for edges):\n   * @param  {any}      source  - Source element.\n   * @param  {any}      target  - Target element.\n   * @param  {function} updater - Updater function.\n   *\n   * @return {Graph}            - Returns itself for chaining.\n   *\n   * @throws {Error} - Will throw if too many arguments are provided.\n   * @throws {Error} - Will throw if any of the elements is not found.\n   */\n  Class.prototype[method] = function (element, updater) {\n    let data;\n\n    if (this.type !== 'mixed' && type !== 'mixed' && type !== this.type)\n      throw new UsageGraphError(\n        `Graph.${method}: cannot find this type of edges in your ${this.type} graph.`\n      );\n\n    if (arguments.length > 2) {\n      if (this.multi)\n        throw new UsageGraphError(\n          `Graph.${method}: 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.`\n        );\n\n      const source = '' + element,\n        target = '' + updater;\n\n      updater = arguments[2];\n\n      data = getMatchingEdge(this, source, target, type);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find an edge for the given path (\"${source}\" - \"${target}\").`\n        );\n    } else {\n      if (type !== 'mixed')\n        throw new UsageGraphError(\n          `Graph.${method}: calling this method with only a key (vs. a source and target) does not make sense since an edge with this key could have the other type.`\n        );\n\n      element = '' + element;\n      data = this._edges.get(element);\n\n      if (!data)\n        throw new NotFoundGraphError(\n          `Graph.${method}: could not find the \"${element}\" edge in the graph.`\n        );\n    }\n\n    if (typeof updater !== 'function')\n      throw new InvalidArgumentsGraphError(\n        `Graph.${method}: provided updater is not a function.`\n      );\n\n    data.attributes = updater(data.attributes);\n\n    // Emitting\n    this.emit('edgeAttributesUpdated', {\n      key: data.key,\n      type: 'update',\n      attributes: data.attributes\n    });\n\n    return this;\n  };\n}\n\n/**\n * List of methods to attach.\n */\nconst EDGE_ATTRIBUTES_METHODS = [\n  {\n    name: element => `get${element}Attribute`,\n    attacher: attachEdgeAttributeGetter\n  },\n  {\n    name: element => `get${element}Attributes`,\n    attacher: attachEdgeAttributesGetter\n  },\n  {\n    name: element => `has${element}Attribute`,\n    attacher: attachEdgeAttributeChecker\n  },\n  {\n    name: element => `set${element}Attribute`,\n    attacher: attachEdgeAttributeSetter\n  },\n  {\n    name: element => `update${element}Attribute`,\n    attacher: attachEdgeAttributeUpdater\n  },\n  {\n    name: element => `remove${element}Attribute`,\n    attacher: attachEdgeAttributeRemover\n  },\n  {\n    name: element => `replace${element}Attributes`,\n    attacher: attachEdgeAttributesReplacer\n  },\n  {\n    name: element => `merge${element}Attributes`,\n    attacher: attachEdgeAttributesMerger\n  },\n  {\n    name: element => `update${element}Attributes`,\n    attacher: attachEdgeAttributesUpdater\n  }\n];\n\n/**\n * Attach every attributes-related methods to a Graph class.\n *\n * @param {function} Graph - Target class.\n */\nfunction attachEdgeAttributesMethods(Graph) {\n  EDGE_ATTRIBUTES_METHODS.forEach(function ({name, attacher}) {\n    // For edges\n    attacher(Graph, name('Edge'), 'mixed');\n\n    // For directed edges\n    attacher(Graph, name('DirectedEdge'), 'directed');\n\n    // For undirected edges\n    attacher(Graph, name('UndirectedEdge'), 'undirected');\n  });\n}\n\n/**\n * Graphology Edge Iteration\n * ==========================\n *\n * Attaching some methods to the Graph class to be able to iterate over a\n * graph's edges.\n */\n\n/**\n * Definitions.\n */\nconst EDGES_ITERATION = [\n  {\n    name: 'edges',\n    type: 'mixed'\n  },\n  {\n    name: 'inEdges',\n    type: 'directed',\n    direction: 'in'\n  },\n  {\n    name: 'outEdges',\n    type: 'directed',\n    direction: 'out'\n  },\n  {\n    name: 'inboundEdges',\n    type: 'mixed',\n    direction: 'in'\n  },\n  {\n    name: 'outboundEdges',\n    type: 'mixed',\n    direction: 'out'\n  },\n  {\n    name: 'directedEdges',\n    type: 'directed'\n  },\n  {\n    name: 'undirectedEdges',\n    type: 'undirected'\n  }\n];\n\n/**\n * Function iterating over edges from the given object to match one of them.\n *\n * @param {object}   object   - Target object.\n * @param {function} callback - Function to call.\n */\nfunction forEachSimple(breakable, object, callback, avoid) {\n  let shouldBreak = false;\n\n  for (const k in object) {\n    if (k === avoid) continue;\n\n    const edgeData = object[k];\n\n    shouldBreak = callback(\n      edgeData.key,\n      edgeData.attributes,\n      edgeData.source.key,\n      edgeData.target.key,\n      edgeData.source.attributes,\n      edgeData.target.attributes,\n      edgeData.undirected\n    );\n\n    if (breakable && shouldBreak) return edgeData.key;\n  }\n\n  return;\n}\n\nfunction forEachMulti(breakable, object, callback, avoid) {\n  let edgeData, source, target;\n\n  let shouldBreak = false;\n\n  for (const k in object) {\n    if (k === avoid) continue;\n\n    edgeData = object[k];\n\n    do {\n      source = edgeData.source;\n      target = edgeData.target;\n\n      shouldBreak = callback(\n        edgeData.key,\n        edgeData.attributes,\n        source.key,\n        target.key,\n        source.attributes,\n        target.attributes,\n        edgeData.undirected\n      );\n\n      if (breakable && shouldBreak) return edgeData.key;\n\n      edgeData = edgeData.next;\n    } while (edgeData !== undefined);\n  }\n\n  return;\n}\n\n/**\n * Function returning an iterator over edges from the given object.\n *\n * @param  {object}   object - Target object.\n * @return {Iterator}\n */\nfunction createIterator(object, avoid) {\n  const keys = Object.keys(object);\n  const l = keys.length;\n\n  let edgeData;\n  let i = 0;\n\n  return {\n    [Symbol.iterator]() {\n      return this;\n    },\n    next() {\n      do {\n        if (!edgeData) {\n          if (i >= l) return {done: true};\n\n          const k = keys[i++];\n\n          if (k === avoid) {\n            edgeData = undefined;\n            continue;\n          }\n\n          edgeData = object[k];\n        } else {\n          edgeData = edgeData.next;\n        }\n      } while (!edgeData);\n\n      return {\n        done: false,\n        value: {\n          edge: edgeData.key,\n          attributes: edgeData.attributes,\n          source: edgeData.source.key,\n          target: edgeData.target.key,\n          sourceAttributes: edgeData.source.attributes,\n          targetAttributes: edgeData.target.attributes,\n          undirected: edgeData.undirected\n        }\n      };\n    }\n  };\n}\n\n/**\n * Function iterating over the egdes from the object at given key to match\n * one of them.\n *\n * @param {object}   object   - Target object.\n * @param {mixed}    k        - Neighbor key.\n * @param {function} callback - Callback to use.\n */\nfunction forEachForKeySimple(breakable, object, k, callback) {\n  const edgeData = object[k];\n\n  if (!edgeData) return;\n\n  const sourceData = edgeData.source;\n  const targetData = edgeData.target;\n\n  if (\n    callback(\n      edgeData.key,\n      edgeData.attributes,\n      sourceData.key,\n      targetData.key,\n      sourceData.attributes,\n      targetData.attributes,\n      edgeData.undirected\n    ) &&\n    breakable\n  )\n    return edgeData.key;\n}\n\nfunction forEachForKeyMulti(breakable, object, k, callback) {\n  let edgeData = object[k];\n\n  if (!edgeData) return;\n\n  let shouldBreak = false;\n\n  do {\n    shouldBreak = callback(\n      edgeData.key,\n      edgeData.attributes,\n      edgeData.source.key,\n      edgeData.target.key,\n      edgeData.source.attributes,\n      edgeData.target.attributes,\n      edgeData.undirected\n    );\n\n    if (breakable && shouldBreak) return edgeData.key;\n\n    edgeData = edgeData.next;\n  } while (edgeData !== undefined);\n\n  return;\n}\n\n/**\n * Function returning an iterator over the egdes from the object at given key.\n *\n * @param  {object}   object   - Target object.\n * @param  {mixed}    k        - Neighbor key.\n * @return {Iterator}\n */\nfunction createIteratorForKey(object, k) {\n  let edgeData = object[k];\n\n  if (edgeData.next !== undefined) {\n    return {\n      [Symbol.iterator]() {\n        return this;\n      },\n      next() {\n        if (!edgeData) return {done: true};\n\n        const value = {\n          edge: edgeData.key,\n          attributes: edgeData.attributes,\n          source: edgeData.source.key,\n          target: edgeData.target.key,\n          sourceAttributes: edgeData.source.attributes,\n          targetAttributes: edgeData.target.attributes,\n          undirected: edgeData.undirected\n        };\n\n        edgeData = edgeData.next;\n\n        return {\n          done: false,\n          value\n        };\n      }\n    };\n  }\n\n  let done = false;\n  return {\n    [Symbol.iterator]() {\n      return this;\n    },\n    next() {\n      if (done === true) return {done: true};\n      done = true;\n      return {\n        done: false,\n        value: {\n          edge: edgeData.key,\n          attributes: edgeData.attributes,\n          source: edgeData.source.key,\n          target: edgeData.target.key,\n          sourceAttributes: edgeData.source.attributes,\n          targetAttributes: edgeData.target.attributes,\n          undirected: edgeData.undirected\n        }\n      };\n    }\n  };\n}\n\n/**\n * Function creating an array of edges for the given type.\n *\n * @param  {Graph}   graph - Target Graph instance.\n * @param  {string}  type  - Type of edges to retrieve.\n * @return {array}         - Array of edges.\n */\nfunction createEdgeArray(graph, type) {\n  if (graph.size === 0) return [];\n\n  if (type === 'mixed' || type === graph.type) {\n    return Array.from(graph._edges.keys());\n  }\n\n  const size =\n    type === 'undirected' ? graph.undirectedSize : graph.directedSize;\n\n  const list = new Array(size),\n    mask = type === 'undirected';\n\n  const iterator = graph._edges.values();\n\n  let i = 0;\n  let step, data;\n\n  while (((step = iterator.next()), step.done !== true)) {\n    data = step.value;\n\n    if (data.undirected === mask) list[i++] = data.key;\n  }\n\n  return list;\n}\n\n/**\n * Function iterating over a graph's edges using a callback to match one of\n * them.\n *\n * @param  {Graph}    graph    - Target Graph instance.\n * @param  {string}   type     - Type of edges to retrieve.\n * @param  {function} callback - Function to call.\n */\nfunction forEachEdge(breakable, graph, type, callback) {\n  if (graph.size === 0) return;\n\n  const shouldFilter = type !== 'mixed' && type !== graph.type;\n  const mask = type === 'undirected';\n\n  let step, data;\n  let shouldBreak = false;\n  const iterator = graph._edges.values();\n\n  while (((step = iterator.next()), step.done !== true)) {\n    data = step.value;\n\n    if (shouldFilter && data.undirected !== mask) continue;\n\n    const {key, attributes, source, target} = data;\n\n    shouldBreak = callback(\n      key,\n      attributes,\n      source.key,\n      target.key,\n      source.attributes,\n      target.attributes,\n      data.undirected\n    );\n\n    if (breakable && shouldBreak) return key;\n  }\n\n  return;\n}\n\n/**\n * Function creating an iterator of edges for the given type.\n *\n * @param  {Graph}    graph - Target Graph instance.\n * @param  {string}   type  - Type of edges to retrieve.\n * @return {Iterator}\n */\nfunction createEdgeIterator(graph, type) {\n  if (graph.size === 0) return emptyIterator();\n\n  const shouldFilter = type !== 'mixed' && type !== graph.type;\n  const mask = type === 'undirected';\n\n  const iterator = graph._edges.values();\n\n  return {\n    [Symbol.iterator]() {\n      return this;\n    },\n    next() {\n      let step, data;\n\n      // eslint-disable-next-line no-constant-condition\n      while (true) {\n        step = iterator.next();\n\n        if (step.done) return step;\n\n        data = step.value;\n\n        if (shouldFilter && data.undirected !== mask) continue;\n\n        break;\n      }\n\n      const value = {\n        edge: data.key,\n        attributes: data.attributes,\n        source: data.source.key,\n        target: data.target.key,\n        sourceAttributes: data.source.attributes,\n        targetAttributes: data.target.attributes,\n        undirected: data.undirected\n      };\n\n      return {value, done: false};\n    }\n  };\n}\n\n/**\n * Function iterating over a node's edges using a callback to match one of them.\n *\n * @param  {boolean}  multi     - Whether the graph is multi or not.\n * @param  {string}   type      - Type of edges to retrieve.\n * @param  {string}   direction - In or out?\n * @param  {any}      nodeData  - Target node's data.\n * @param  {function} callback  - Function to call.\n */\nfunction forEachEdgeForNode(\n  breakable,\n  multi,\n  type,\n  direction,\n  nodeData,\n  callback\n) {\n  const fn = multi ? forEachMulti : forEachSimple;\n\n  let found;\n\n  if (type !== 'undirected') {\n    if (direction !== 'out') {\n      found = fn(breakable, nodeData.in, callback);\n\n      if (breakable && found) return found;\n    }\n    if (direction !== 'in') {\n      found = fn(\n        breakable,\n        nodeData.out,\n        callback,\n        !direction ? nodeData.key : undefined\n      );\n\n      if (breakable && found) return found;\n    }\n  }\n\n  if (type !== 'directed') {\n    found = fn(breakable, nodeData.undirected, callback);\n\n    if (breakable && found) return found;\n  }\n\n  return;\n}\n\n/**\n * Function creating an array of edges for the given type & the given node.\n *\n * @param  {boolean} multi     - Whether the graph is multi or not.\n * @param  {string}  type      - Type of edges to retrieve.\n * @param  {string}  direction - In or out?\n * @param  {any}     nodeData  - Target node's data.\n * @return {array}             - Array of edges.\n */\nfunction createEdgeArrayForNode(multi, type, direction, nodeData) {\n  const edges = []; // TODO: possibility to know size beforehand or factorize with map\n\n  forEachEdgeForNode(false, multi, type, direction, nodeData, function (key) {\n    edges.push(key);\n  });\n\n  return edges;\n}\n\n/**\n * Function iterating over a node's edges using a callback.\n *\n * @param  {string}   type      - Type of edges to retrieve.\n * @param  {string}   direction - In or out?\n * @param  {any}      nodeData  - Target node's data.\n * @return {Iterator}\n */\nfunction createEdgeIteratorForNode(type, direction, nodeData) {\n  let iterator = emptyIterator();\n\n  if (type !== 'undirected') {\n    if (direction !== 'out' && typeof nodeData.in !== 'undefined')\n      iterator = chain(iterator, createIterator(nodeData.in));\n    if (direction !== 'in' && typeof nodeData.out !== 'undefined')\n      iterator = chain(\n        iterator,\n        createIterator(nodeData.out, !direction ? nodeData.key : undefined)\n      );\n  }\n\n  if (type !== 'directed' && typeof nodeData.undirected !== 'undefined') {\n    iterator = chain(iterator, createIterator(nodeData.undirected));\n  }\n\n  return iterator;\n}\n\n/**\n * Function iterating over edges for the given path using a callback to match\n * one of them.\n *\n * @param  {string}   type       - Type of edges to retrieve.\n * @param  {boolean}  multi      - Whether the graph is multi.\n * @param  {string}   direction  - In or out?\n * @param  {NodeData} sourceData - Source node's data.\n * @param  {string}   target     - Target node.\n * @param  {function} callback   - Function to call.\n */\nfunction forEachEdgeForPath(\n  breakable,\n  type,\n  multi,\n  direction,\n  sourceData,\n  target,\n  callback\n) {\n  const fn = multi ? forEachForKeyMulti : forEachForKeySimple;\n\n  let found;\n\n  if (type !== 'undirected') {\n    if (typeof sourceData.in !== 'undefined' && direction !== 'out') {\n      found = fn(breakable, sourceData.in, target, callback);\n\n      if (breakable && found) return found;\n    }\n\n    if (\n      typeof sourceData.out !== 'undefined' &&\n      direction !== 'in' &&\n      (direction || sourceData.key !== target)\n    ) {\n      found = fn(breakable, sourceData.out, target, callback);\n\n      if (breakable && found) return found;\n    }\n  }\n\n  if (type !== 'directed') {\n    if (typeof sourceData.undirected !== 'undefined') {\n      found = fn(breakable, sourceData.undirected, target, callback);\n\n      if (breakable && found) return found;\n    }\n  }\n\n  return;\n}\n\n/**\n * Function creating an array of edges for the given path.\n *\n * @param  {string}   type       - Type of edges to retrieve.\n * @param  {boolean}  multi      - Whether the graph is multi.\n * @param  {string}   direction  - In or out?\n * @param  {NodeData} sourceData - Source node's data.\n * @param  {any}      target     - Target node.\n * @return {array}               - Array of edges.\n */\nfunction createEdgeArrayForPath(type, multi, direction, sourceData, target) {\n  const edges = []; // TODO: possibility to know size beforehand or factorize with map\n\n  forEachEdgeForPath(\n    false,\n    type,\n    multi,\n    direction,\n    sourceData,\n    target,\n    function (key) {\n      edges.push(key);\n    }\n  );\n\n  return edges;\n}\n\n/**\n * Function returning an iterator over edges for the given path.\n *\n * @param  {string}   type       - Type of edges to retrieve.\n * @param  {string}   direction  - In or out?\n * @param  {NodeData} sourceData - Source node's data.\n * @param  {string}   target     - Target node.\n * @param  {function} callback   - Function to call.\n */\nfunction createEdgeIteratorForPath(type, direction, sourceData, target) {\n  let iterator = emptyIterator();\n\n  if (type !== 'undirected') {\n    if (\n      typeof sourceData.in !== 'undefined' &&\n      direction !== 'out' &&\n      target in sourceData.in\n    )\n      iterator = chain(iterator, createIteratorForKey(sourceData.in, target));\n\n    if (\n      typeof sourceData.out !== 'undefined' &&\n      direction !== 'in' &&\n      target in sourceData.out &&\n      (direction || sourceData.key !== target)\n    )\n      iterator = chain(iterator, createIteratorForKey(sourceData.out, target));\n  }\n\n  if (type !== 'directed') {\n    if (\n      typeof sourceData.undirected !== 'undefined' &&\n      target in sourceData.undirected\n    )\n      iterator = chain(\n        iterator,\n        createIteratorForKey(sourceData.undirected, target)\n      );\n  }\n\n  return iterator;\n}\n\n/**\n * Function attaching an edge array creator method to the Graph prototype.\n *\n * @param {function} Class       - Target class.\n * @param {object}   description - Method description.\n */\nfunction attachEdgeArrayCreator(Class, description) {\n  const {name, type, direction} = description;\n\n  /**\n   * Function returning an array of certain edges.\n   *\n   * Arity 0: Return all the relevant edges.\n   *\n   * Arity 1: Return all of a node's relevant edges.\n   * @param  {any}   node   - Target node.\n   *\n   * Arity 2: Return the relevant edges across the given path.\n   * @param  {any}   source - Source node.\n   * @param  {any}   target - Target node.\n   *\n   * @return {array|number} - The edges or the number of edges.\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  Class.prototype[name] = function (source, target) {\n    // Early termination\n    if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type)\n      return [];\n\n    if (!arguments.length) return createEdgeArray(this, type);\n\n    if (arguments.length === 1) {\n      source = '' + source;\n\n      const nodeData = this._nodes.get(source);\n\n      if (typeof nodeData === 'undefined')\n        throw new NotFoundGraphError(\n          `Graph.${name}: could not find the \"${source}\" node in the graph.`\n        );\n\n      // Iterating over a node's edges\n      return createEdgeArrayForNode(\n        this.multi,\n        type === 'mixed' ? this.type : type,\n        direction,\n        nodeData\n      );\n    }\n\n    if (arguments.length === 2) {\n      source = '' + source;\n      target = '' + target;\n\n      const sourceData = this._nodes.get(source);\n\n      if (!sourceData)\n        throw new NotFoundGraphError(\n          `Graph.${name}:  could not find the \"${source}\" source node in the graph.`\n        );\n\n      if (!this._nodes.has(target))\n        throw new NotFoundGraphError(\n          `Graph.${name}:  could not find the \"${target}\" target node in the graph.`\n        );\n\n      // Iterating over the edges between source & target\n      return createEdgeArrayForPath(\n        type,\n        this.multi,\n        direction,\n        sourceData,\n        target\n      );\n    }\n\n    throw new InvalidArgumentsGraphError(\n      `Graph.${name}: too many arguments (expecting 0, 1 or 2 and got ${arguments.length}).`\n    );\n  };\n}\n\n/**\n * Function attaching a edge callback iterator method to the Graph prototype.\n *\n * @param {function} Class       - Target class.\n * @param {object}   description - Method description.\n */\nfunction attachForEachEdge(Class, description) {\n  const {name, type, direction} = description;\n\n  const forEachName = 'forEach' + name[0].toUpperCase() + name.slice(1, -1);\n\n  /**\n   * Function iterating over the graph's relevant edges by applying the given\n   * callback.\n   *\n   * Arity 1: Iterate over all the relevant edges.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 2: Iterate over all of a node's relevant edges.\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 3: Iterate over the relevant edges across the given path.\n   * @param  {any}      source   - Source node.\n   * @param  {any}      target   - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * @return {undefined}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  Class.prototype[forEachName] = function (source, target, callback) {\n    // Early termination\n    if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type) return;\n\n    if (arguments.length === 1) {\n      callback = source;\n      return forEachEdge(false, this, type, callback);\n    }\n\n    if (arguments.length === 2) {\n      source = '' + source;\n      callback = target;\n\n      const nodeData = this._nodes.get(source);\n\n      if (typeof nodeData === 'undefined')\n        throw new NotFoundGraphError(\n          `Graph.${forEachName}: could not find the \"${source}\" node in the graph.`\n        );\n\n      // Iterating over a node's edges\n      // TODO: maybe attach the sub method to the instance dynamically?\n      return forEachEdgeForNode(\n        false,\n        this.multi,\n        type === 'mixed' ? this.type : type,\n        direction,\n        nodeData,\n        callback\n      );\n    }\n\n    if (arguments.length === 3) {\n      source = '' + source;\n      target = '' + target;\n\n      const sourceData = this._nodes.get(source);\n\n      if (!sourceData)\n        throw new NotFoundGraphError(\n          `Graph.${forEachName}:  could not find the \"${source}\" source node in the graph.`\n        );\n\n      if (!this._nodes.has(target))\n        throw new NotFoundGraphError(\n          `Graph.${forEachName}:  could not find the \"${target}\" target node in the graph.`\n        );\n\n      // Iterating over the edges between source & target\n      return forEachEdgeForPath(\n        false,\n        type,\n        this.multi,\n        direction,\n        sourceData,\n        target,\n        callback\n      );\n    }\n\n    throw new InvalidArgumentsGraphError(\n      `Graph.${forEachName}: too many arguments (expecting 1, 2 or 3 and got ${arguments.length}).`\n    );\n  };\n\n  /**\n   * Function mapping the graph's relevant edges by applying the given\n   * callback.\n   *\n   * Arity 1: Map all the relevant edges.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 2: Map all of a node's relevant edges.\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 3: Map the relevant edges across the given path.\n   * @param  {any}      source   - Source node.\n   * @param  {any}      target   - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * @return {undefined}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const mapName = 'map' + name[0].toUpperCase() + name.slice(1);\n\n  Class.prototype[mapName] = function () {\n    const args = Array.prototype.slice.call(arguments);\n    const callback = args.pop();\n\n    let result;\n\n    // We know the result length beforehand\n    if (args.length === 0) {\n      let length = 0;\n\n      if (type !== 'directed') length += this.undirectedSize;\n      if (type !== 'undirected') length += this.directedSize;\n\n      result = new Array(length);\n\n      let i = 0;\n\n      args.push((e, ea, s, t, sa, ta, u) => {\n        result[i++] = callback(e, ea, s, t, sa, ta, u);\n      });\n    }\n\n    // We don't know the result length beforehand\n    // TODO: we can in some instances of simple graphs, knowing degree\n    else {\n      result = [];\n\n      args.push((e, ea, s, t, sa, ta, u) => {\n        result.push(callback(e, ea, s, t, sa, ta, u));\n      });\n    }\n\n    this[forEachName].apply(this, args);\n\n    return result;\n  };\n\n  /**\n   * Function filtering the graph's relevant edges using the provided predicate\n   * function.\n   *\n   * Arity 1: Filter all the relevant edges.\n   * @param  {function} predicate - Predicate to use.\n   *\n   * Arity 2: Filter all of a node's relevant edges.\n   * @param  {any}      node      - Target node.\n   * @param  {function} predicate - Predicate to use.\n   *\n   * Arity 3: Filter the relevant edges across the given path.\n   * @param  {any}      source    - Source node.\n   * @param  {any}      target    - Target node.\n   * @param  {function} predicate - Predicate to use.\n   *\n   * @return {undefined}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const filterName = 'filter' + name[0].toUpperCase() + name.slice(1);\n\n  Class.prototype[filterName] = function () {\n    const args = Array.prototype.slice.call(arguments);\n    const callback = args.pop();\n\n    const result = [];\n\n    args.push((e, ea, s, t, sa, ta, u) => {\n      if (callback(e, ea, s, t, sa, ta, u)) result.push(e);\n    });\n\n    this[forEachName].apply(this, args);\n\n    return result;\n  };\n\n  /**\n   * Function reducing the graph's relevant edges using the provided accumulator\n   * function.\n   *\n   * Arity 1: Reduce all the relevant edges.\n   * @param  {function} accumulator  - Accumulator to use.\n   * @param  {any}      initialValue - Initial value.\n   *\n   * Arity 2: Reduce all of a node's relevant edges.\n   * @param  {any}      node         - Target node.\n   * @param  {function} accumulator  - Accumulator to use.\n   * @param  {any}      initialValue - Initial value.\n   *\n   * Arity 3: Reduce the relevant edges across the given path.\n   * @param  {any}      source       - Source node.\n   * @param  {any}      target       - Target node.\n   * @param  {function} accumulator  - Accumulator to use.\n   * @param  {any}      initialValue - Initial value.\n   *\n   * @return {undefined}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const reduceName = 'reduce' + name[0].toUpperCase() + name.slice(1);\n\n  Class.prototype[reduceName] = function () {\n    let args = Array.prototype.slice.call(arguments);\n\n    if (args.length < 2 || args.length > 4) {\n      throw new InvalidArgumentsGraphError(\n        `Graph.${reduceName}: invalid number of arguments (expecting 2, 3 or 4 and got ${args.length}).`\n      );\n    }\n\n    if (\n      typeof args[args.length - 1] === 'function' &&\n      typeof args[args.length - 2] !== 'function'\n    ) {\n      throw new InvalidArgumentsGraphError(\n        `Graph.${reduceName}: 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.`\n      );\n    }\n\n    let callback;\n    let initialValue;\n\n    if (args.length === 2) {\n      callback = args[0];\n      initialValue = args[1];\n      args = [];\n    } else if (args.length === 3) {\n      callback = args[1];\n      initialValue = args[2];\n      args = [args[0]];\n    } else if (args.length === 4) {\n      callback = args[2];\n      initialValue = args[3];\n      args = [args[0], args[1]];\n    }\n\n    let accumulator = initialValue;\n\n    args.push((e, ea, s, t, sa, ta, u) => {\n      accumulator = callback(accumulator, e, ea, s, t, sa, ta, u);\n    });\n\n    this[forEachName].apply(this, args);\n\n    return accumulator;\n  };\n}\n\n/**\n * Function attaching a breakable edge callback iterator method to the Graph\n * prototype.\n *\n * @param {function} Class       - Target class.\n * @param {object}   description - Method description.\n */\nfunction attachFindEdge(Class, description) {\n  const {name, type, direction} = description;\n\n  const findEdgeName = 'find' + name[0].toUpperCase() + name.slice(1, -1);\n\n  /**\n   * Function iterating over the graph's relevant edges in order to match\n   * one of them using the provided predicate function.\n   *\n   * Arity 1: Iterate over all the relevant edges.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 2: Iterate over all of a node's relevant edges.\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 3: Iterate over the relevant edges across the given path.\n   * @param  {any}      source   - Source node.\n   * @param  {any}      target   - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * @return {undefined}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  Class.prototype[findEdgeName] = function (source, target, callback) {\n    // Early termination\n    if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type)\n      return false;\n\n    if (arguments.length === 1) {\n      callback = source;\n      return forEachEdge(true, this, type, callback);\n    }\n\n    if (arguments.length === 2) {\n      source = '' + source;\n      callback = target;\n\n      const nodeData = this._nodes.get(source);\n\n      if (typeof nodeData === 'undefined')\n        throw new NotFoundGraphError(\n          `Graph.${findEdgeName}: could not find the \"${source}\" node in the graph.`\n        );\n\n      // Iterating over a node's edges\n      // TODO: maybe attach the sub method to the instance dynamically?\n      return forEachEdgeForNode(\n        true,\n        this.multi,\n        type === 'mixed' ? this.type : type,\n        direction,\n        nodeData,\n        callback\n      );\n    }\n\n    if (arguments.length === 3) {\n      source = '' + source;\n      target = '' + target;\n\n      const sourceData = this._nodes.get(source);\n\n      if (!sourceData)\n        throw new NotFoundGraphError(\n          `Graph.${findEdgeName}:  could not find the \"${source}\" source node in the graph.`\n        );\n\n      if (!this._nodes.has(target))\n        throw new NotFoundGraphError(\n          `Graph.${findEdgeName}:  could not find the \"${target}\" target node in the graph.`\n        );\n\n      // Iterating over the edges between source & target\n      return forEachEdgeForPath(\n        true,\n        type,\n        this.multi,\n        direction,\n        sourceData,\n        target,\n        callback\n      );\n    }\n\n    throw new InvalidArgumentsGraphError(\n      `Graph.${findEdgeName}: too many arguments (expecting 1, 2 or 3 and got ${arguments.length}).`\n    );\n  };\n\n  /**\n   * Function iterating over the graph's relevant edges in order to assert\n   * whether any one of them matches the provided predicate function.\n   *\n   * Arity 1: Iterate over all the relevant edges.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 2: Iterate over all of a node's relevant edges.\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 3: Iterate over the relevant edges across the given path.\n   * @param  {any}      source   - Source node.\n   * @param  {any}      target   - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * @return {undefined}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const someName = 'some' + name[0].toUpperCase() + name.slice(1, -1);\n\n  Class.prototype[someName] = function () {\n    const args = Array.prototype.slice.call(arguments);\n    const callback = args.pop();\n\n    args.push((e, ea, s, t, sa, ta, u) => {\n      return callback(e, ea, s, t, sa, ta, u);\n    });\n\n    const found = this[findEdgeName].apply(this, args);\n\n    if (found) return true;\n\n    return false;\n  };\n\n  /**\n   * Function iterating over the graph's relevant edges in order to assert\n   * whether all of them matche the provided predicate function.\n   *\n   * Arity 1: Iterate over all the relevant edges.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 2: Iterate over all of a node's relevant edges.\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * Arity 3: Iterate over the relevant edges across the given path.\n   * @param  {any}      source   - Source node.\n   * @param  {any}      target   - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * @return {undefined}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const everyName = 'every' + name[0].toUpperCase() + name.slice(1, -1);\n\n  Class.prototype[everyName] = function () {\n    const args = Array.prototype.slice.call(arguments);\n    const callback = args.pop();\n\n    args.push((e, ea, s, t, sa, ta, u) => {\n      return !callback(e, ea, s, t, sa, ta, u);\n    });\n\n    const found = this[findEdgeName].apply(this, args);\n\n    if (found) return false;\n\n    return true;\n  };\n}\n\n/**\n * Function attaching an edge iterator method to the Graph prototype.\n *\n * @param {function} Class       - Target class.\n * @param {object}   description - Method description.\n */\nfunction attachEdgeIteratorCreator(Class, description) {\n  const {name: originalName, type, direction} = description;\n\n  const name = originalName.slice(0, -1) + 'Entries';\n\n  /**\n   * Function returning an iterator over the graph's edges.\n   *\n   * Arity 0: Iterate over all the relevant edges.\n   *\n   * Arity 1: Iterate over all of a node's relevant edges.\n   * @param  {any}   node   - Target node.\n   *\n   * Arity 2: Iterate over the relevant edges across the given path.\n   * @param  {any}   source - Source node.\n   * @param  {any}   target - Target node.\n   *\n   * @return {array|number} - The edges or the number of edges.\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  Class.prototype[name] = function (source, target) {\n    // Early termination\n    if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type)\n      return emptyIterator();\n\n    if (!arguments.length) return createEdgeIterator(this, type);\n\n    if (arguments.length === 1) {\n      source = '' + source;\n\n      const sourceData = this._nodes.get(source);\n\n      if (!sourceData)\n        throw new NotFoundGraphError(\n          `Graph.${name}: could not find the \"${source}\" node in the graph.`\n        );\n\n      // Iterating over a node's edges\n      return createEdgeIteratorForNode(type, direction, sourceData);\n    }\n\n    if (arguments.length === 2) {\n      source = '' + source;\n      target = '' + target;\n\n      const sourceData = this._nodes.get(source);\n\n      if (!sourceData)\n        throw new NotFoundGraphError(\n          `Graph.${name}:  could not find the \"${source}\" source node in the graph.`\n        );\n\n      if (!this._nodes.has(target))\n        throw new NotFoundGraphError(\n          `Graph.${name}:  could not find the \"${target}\" target node in the graph.`\n        );\n\n      // Iterating over the edges between source & target\n      return createEdgeIteratorForPath(type, direction, sourceData, target);\n    }\n\n    throw new InvalidArgumentsGraphError(\n      `Graph.${name}: too many arguments (expecting 0, 1 or 2 and got ${arguments.length}).`\n    );\n  };\n}\n\n/**\n * Function attaching every edge iteration method to the Graph class.\n *\n * @param {function} Graph - Graph class.\n */\nfunction attachEdgeIterationMethods(Graph) {\n  EDGES_ITERATION.forEach(description => {\n    attachEdgeArrayCreator(Graph, description);\n    attachForEachEdge(Graph, description);\n    attachFindEdge(Graph, description);\n    attachEdgeIteratorCreator(Graph, description);\n  });\n}\n\n/**\n * Graphology Neighbor Iteration\n * ==============================\n *\n * Attaching some methods to the Graph class to be able to iterate over\n * neighbors.\n */\n\n/**\n * Definitions.\n */\nconst NEIGHBORS_ITERATION = [\n  {\n    name: 'neighbors',\n    type: 'mixed'\n  },\n  {\n    name: 'inNeighbors',\n    type: 'directed',\n    direction: 'in'\n  },\n  {\n    name: 'outNeighbors',\n    type: 'directed',\n    direction: 'out'\n  },\n  {\n    name: 'inboundNeighbors',\n    type: 'mixed',\n    direction: 'in'\n  },\n  {\n    name: 'outboundNeighbors',\n    type: 'mixed',\n    direction: 'out'\n  },\n  {\n    name: 'directedNeighbors',\n    type: 'directed'\n  },\n  {\n    name: 'undirectedNeighbors',\n    type: 'undirected'\n  }\n];\n\n/**\n * Helpers.\n */\nfunction CompositeSetWrapper() {\n  this.A = null;\n  this.B = null;\n}\n\nCompositeSetWrapper.prototype.wrap = function (set) {\n  if (this.A === null) this.A = set;\n  else if (this.B === null) this.B = set;\n};\n\nCompositeSetWrapper.prototype.has = function (key) {\n  if (this.A !== null && key in this.A) return true;\n  if (this.B !== null && key in this.B) return true;\n  return false;\n};\n\n/**\n * Function iterating over the given node's relevant neighbors to match\n * one of them using a predicated function.\n *\n * @param  {string}   type      - Type of neighbors.\n * @param  {string}   direction - Direction.\n * @param  {any}      nodeData  - Target node's data.\n * @param  {function} callback  - Callback to use.\n */\nfunction forEachInObjectOnce(breakable, visited, nodeData, object, callback) {\n  for (const k in object) {\n    const edgeData = object[k];\n\n    const sourceData = edgeData.source;\n    const targetData = edgeData.target;\n\n    const neighborData = sourceData === nodeData ? targetData : sourceData;\n\n    if (visited && visited.has(neighborData.key)) continue;\n\n    const shouldBreak = callback(neighborData.key, neighborData.attributes);\n\n    if (breakable && shouldBreak) return neighborData.key;\n  }\n\n  return;\n}\n\nfunction forEachNeighbor(breakable, type, direction, nodeData, callback) {\n  // If we want only undirected or in or out, we can roll some optimizations\n  if (type !== 'mixed') {\n    if (type === 'undirected')\n      return forEachInObjectOnce(\n        breakable,\n        null,\n        nodeData,\n        nodeData.undirected,\n        callback\n      );\n\n    if (typeof direction === 'string')\n      return forEachInObjectOnce(\n        breakable,\n        null,\n        nodeData,\n        nodeData[direction],\n        callback\n      );\n  }\n\n  // Else we need to keep a set of neighbors not to return duplicates\n  // We cheat by querying the other adjacencies\n  const visited = new CompositeSetWrapper();\n\n  let found;\n\n  if (type !== 'undirected') {\n    if (direction !== 'out') {\n      found = forEachInObjectOnce(\n        breakable,\n        null,\n        nodeData,\n        nodeData.in,\n        callback\n      );\n\n      if (breakable && found) return found;\n\n      visited.wrap(nodeData.in);\n    }\n    if (direction !== 'in') {\n      found = forEachInObjectOnce(\n        breakable,\n        visited,\n        nodeData,\n        nodeData.out,\n        callback\n      );\n\n      if (breakable && found) return found;\n\n      visited.wrap(nodeData.out);\n    }\n  }\n\n  if (type !== 'directed') {\n    found = forEachInObjectOnce(\n      breakable,\n      visited,\n      nodeData,\n      nodeData.undirected,\n      callback\n    );\n\n    if (breakable && found) return found;\n  }\n\n  return;\n}\n\n/**\n * Function creating an array of relevant neighbors for the given node.\n *\n * @param  {string}       type      - Type of neighbors.\n * @param  {string}       direction - Direction.\n * @param  {any}          nodeData  - Target node's data.\n * @return {Array}                  - The list of neighbors.\n */\nfunction createNeighborArrayForNode(type, direction, nodeData) {\n  // If we want only undirected or in or out, we can roll some optimizations\n  if (type !== 'mixed') {\n    if (type === 'undirected') return Object.keys(nodeData.undirected);\n\n    if (typeof direction === 'string') return Object.keys(nodeData[direction]);\n  }\n\n  const neighbors = [];\n\n  forEachNeighbor(false, type, direction, nodeData, function (key) {\n    neighbors.push(key);\n  });\n\n  return neighbors;\n}\n\n/**\n * Function returning an iterator over the given node's relevant neighbors.\n *\n * @param  {string}   type      - Type of neighbors.\n * @param  {string}   direction - Direction.\n * @param  {any}      nodeData  - Target node's data.\n * @return {Iterator}\n */\nfunction createDedupedObjectIterator(visited, nodeData, object) {\n  const keys = Object.keys(object);\n  const l = keys.length;\n\n  let i = 0;\n\n  return {\n    [Symbol.iterator]() {\n      return this;\n    },\n    next() {\n      let neighborData = null;\n\n      do {\n        if (i >= l) {\n          if (visited) visited.wrap(object);\n          return {done: true};\n        }\n\n        const edgeData = object[keys[i++]];\n\n        const sourceData = edgeData.source;\n        const targetData = edgeData.target;\n\n        neighborData = sourceData === nodeData ? targetData : sourceData;\n\n        if (visited && visited.has(neighborData.key)) {\n          neighborData = null;\n          continue;\n        }\n      } while (neighborData === null);\n\n      return {\n        done: false,\n        value: {neighbor: neighborData.key, attributes: neighborData.attributes}\n      };\n    }\n  };\n}\n\nfunction createNeighborIterator(type, direction, nodeData) {\n  // If we want only undirected or in or out, we can roll some optimizations\n  if (type !== 'mixed') {\n    if (type === 'undirected')\n      return createDedupedObjectIterator(null, nodeData, nodeData.undirected);\n\n    if (typeof direction === 'string')\n      return createDedupedObjectIterator(null, nodeData, nodeData[direction]);\n  }\n\n  let iterator = emptyIterator();\n\n  // Else we need to keep a set of neighbors not to return duplicates\n  // We cheat by querying the other adjacencies\n  const visited = new CompositeSetWrapper();\n\n  if (type !== 'undirected') {\n    if (direction !== 'out') {\n      iterator = chain(\n        iterator,\n        createDedupedObjectIterator(visited, nodeData, nodeData.in)\n      );\n    }\n    if (direction !== 'in') {\n      iterator = chain(\n        iterator,\n        createDedupedObjectIterator(visited, nodeData, nodeData.out)\n      );\n    }\n  }\n\n  if (type !== 'directed') {\n    iterator = chain(\n      iterator,\n      createDedupedObjectIterator(visited, nodeData, nodeData.undirected)\n    );\n  }\n\n  return iterator;\n}\n\n/**\n * Function attaching a neighbors array creator method to the Graph prototype.\n *\n * @param {function} Class       - Target class.\n * @param {object}   description - Method description.\n */\nfunction attachNeighborArrayCreator(Class, description) {\n  const {name, type, direction} = description;\n\n  /**\n   * Function returning an array of certain neighbors.\n   *\n   * @param  {any}   node   - Target node.\n   * @return {array} - The neighbors of neighbors.\n   *\n   * @throws {Error} - Will throw if node is not found in the graph.\n   */\n  Class.prototype[name] = function (node) {\n    // Early termination\n    if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type)\n      return [];\n\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (typeof nodeData === 'undefined')\n      throw new NotFoundGraphError(\n        `Graph.${name}: could not find the \"${node}\" node in the graph.`\n      );\n\n    // Here, we want to iterate over a node's relevant neighbors\n    return createNeighborArrayForNode(\n      type === 'mixed' ? this.type : type,\n      direction,\n      nodeData\n    );\n  };\n}\n\n/**\n * Function attaching a neighbors callback iterator method to the Graph prototype.\n *\n * @param {function} Class       - Target class.\n * @param {object}   description - Method description.\n */\nfunction attachForEachNeighbor(Class, description) {\n  const {name, type, direction} = description;\n\n  const forEachName = 'forEach' + name[0].toUpperCase() + name.slice(1, -1);\n\n  /**\n   * Function iterating over all the relevant neighbors using a callback.\n   *\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   * @return {undefined}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  Class.prototype[forEachName] = function (node, callback) {\n    // Early termination\n    if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type) return;\n\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (typeof nodeData === 'undefined')\n      throw new NotFoundGraphError(\n        `Graph.${forEachName}: could not find the \"${node}\" node in the graph.`\n      );\n\n    // Here, we want to iterate over a node's relevant neighbors\n    forEachNeighbor(\n      false,\n      type === 'mixed' ? this.type : type,\n      direction,\n      nodeData,\n      callback\n    );\n  };\n\n  /**\n   * Function mapping the relevant neighbors using a callback.\n   *\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const mapName = 'map' + name[0].toUpperCase() + name.slice(1);\n\n  Class.prototype[mapName] = function (node, callback) {\n    // TODO: optimize when size is known beforehand\n    const result = [];\n\n    this[forEachName](node, (n, a) => {\n      result.push(callback(n, a));\n    });\n\n    return result;\n  };\n\n  /**\n   * Function filtering the relevant neighbors using a callback.\n   *\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const filterName = 'filter' + name[0].toUpperCase() + name.slice(1);\n\n  Class.prototype[filterName] = function (node, callback) {\n    const result = [];\n\n    this[forEachName](node, (n, a) => {\n      if (callback(n, a)) result.push(n);\n    });\n\n    return result;\n  };\n\n  /**\n   * Function reducing the relevant neighbors using a callback.\n   *\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const reduceName = 'reduce' + name[0].toUpperCase() + name.slice(1);\n\n  Class.prototype[reduceName] = function (node, callback, initialValue) {\n    if (arguments.length < 3)\n      throw new InvalidArgumentsGraphError(\n        `Graph.${reduceName}: 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.`\n      );\n\n    let accumulator = initialValue;\n\n    this[forEachName](node, (n, a) => {\n      accumulator = callback(accumulator, n, a);\n    });\n\n    return accumulator;\n  };\n}\n\n/**\n * Function attaching a breakable neighbors callback iterator method to the\n * Graph prototype.\n *\n * @param {function} Class       - Target class.\n * @param {object}   description - Method description.\n */\nfunction attachFindNeighbor(Class, description) {\n  const {name, type, direction} = description;\n\n  const capitalizedSingular = name[0].toUpperCase() + name.slice(1, -1);\n\n  const findName = 'find' + capitalizedSingular;\n\n  /**\n   * Function iterating over all the relevant neighbors using a callback.\n   *\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   * @return {undefined}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  Class.prototype[findName] = function (node, callback) {\n    // Early termination\n    if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type) return;\n\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (typeof nodeData === 'undefined')\n      throw new NotFoundGraphError(\n        `Graph.${findName}: could not find the \"${node}\" node in the graph.`\n      );\n\n    // Here, we want to iterate over a node's relevant neighbors\n    return forEachNeighbor(\n      true,\n      type === 'mixed' ? this.type : type,\n      direction,\n      nodeData,\n      callback\n    );\n  };\n\n  /**\n   * Function iterating over all the relevant neighbors to find if any of them\n   * matches the given predicate.\n   *\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const someName = 'some' + capitalizedSingular;\n\n  Class.prototype[someName] = function (node, callback) {\n    const found = this[findName](node, callback);\n\n    if (found) return true;\n\n    return false;\n  };\n\n  /**\n   * Function iterating over all the relevant neighbors to find if all of them\n   * matche the given predicate.\n   *\n   * @param  {any}      node     - Target node.\n   * @param  {function} callback - Callback to use.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  const everyName = 'every' + capitalizedSingular;\n\n  Class.prototype[everyName] = function (node, callback) {\n    const found = this[findName](node, (n, a) => {\n      return !callback(n, a);\n    });\n\n    if (found) return false;\n\n    return true;\n  };\n}\n\n/**\n * Function attaching a neighbors callback iterator method to the Graph prototype.\n *\n * @param {function} Class       - Target class.\n * @param {object}   description - Method description.\n */\nfunction attachNeighborIteratorCreator(Class, description) {\n  const {name, type, direction} = description;\n\n  const iteratorName = name.slice(0, -1) + 'Entries';\n\n  /**\n   * Function returning an iterator over all the relevant neighbors.\n   *\n   * @param  {any}      node     - Target node.\n   * @return {Iterator}\n   *\n   * @throws {Error} - Will throw if there are too many arguments.\n   */\n  Class.prototype[iteratorName] = function (node) {\n    // Early termination\n    if (type !== 'mixed' && this.type !== 'mixed' && type !== this.type)\n      return emptyIterator();\n\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (typeof nodeData === 'undefined')\n      throw new NotFoundGraphError(\n        `Graph.${iteratorName}: could not find the \"${node}\" node in the graph.`\n      );\n\n    // Here, we want to iterate over a node's relevant neighbors\n    return createNeighborIterator(\n      type === 'mixed' ? this.type : type,\n      direction,\n      nodeData\n    );\n  };\n}\n\n/**\n * Function attaching every neighbor iteration method to the Graph class.\n *\n * @param {function} Graph - Graph class.\n */\nfunction attachNeighborIterationMethods(Graph) {\n  NEIGHBORS_ITERATION.forEach(description => {\n    attachNeighborArrayCreator(Graph, description);\n    attachForEachNeighbor(Graph, description);\n    attachFindNeighbor(Graph, description);\n    attachNeighborIteratorCreator(Graph, description);\n  });\n}\n\n/**\n * Graphology Adjacency Iteration\n * ===============================\n *\n * Attaching some methods to the Graph class to be able to iterate over a\n * graph's adjacency.\n */\n\n/**\n * Function iterating over a simple graph's adjacency using a callback.\n *\n * @param {boolean}  breakable         - Can we break?\n * @param {boolean}  assymetric        - Whether to emit undirected edges only once.\n * @param {boolean}  disconnectedNodes - Whether to emit disconnected nodes.\n * @param {Graph}    graph             - Target Graph instance.\n * @param {callback} function          - Iteration callback.\n */\nfunction forEachAdjacency(\n  breakable,\n  assymetric,\n  disconnectedNodes,\n  graph,\n  callback\n) {\n  const iterator = graph._nodes.values();\n\n  const type = graph.type;\n\n  let step, sourceData, neighbor, adj, edgeData, targetData, shouldBreak;\n\n  while (((step = iterator.next()), step.done !== true)) {\n    let hasEdges = false;\n\n    sourceData = step.value;\n\n    if (type !== 'undirected') {\n      adj = sourceData.out;\n\n      for (neighbor in adj) {\n        edgeData = adj[neighbor];\n\n        do {\n          targetData = edgeData.target;\n\n          hasEdges = true;\n          shouldBreak = callback(\n            sourceData.key,\n            targetData.key,\n            sourceData.attributes,\n            targetData.attributes,\n            edgeData.key,\n            edgeData.attributes,\n            edgeData.undirected\n          );\n\n          if (breakable && shouldBreak) return edgeData;\n\n          edgeData = edgeData.next;\n        } while (edgeData);\n      }\n    }\n\n    if (type !== 'directed') {\n      adj = sourceData.undirected;\n\n      for (neighbor in adj) {\n        if (assymetric && sourceData.key > neighbor) continue;\n\n        edgeData = adj[neighbor];\n\n        do {\n          targetData = edgeData.target;\n\n          if (targetData.key !== neighbor) targetData = edgeData.source;\n\n          hasEdges = true;\n          shouldBreak = callback(\n            sourceData.key,\n            targetData.key,\n            sourceData.attributes,\n            targetData.attributes,\n            edgeData.key,\n            edgeData.attributes,\n            edgeData.undirected\n          );\n\n          if (breakable && shouldBreak) return edgeData;\n\n          edgeData = edgeData.next;\n        } while (edgeData);\n      }\n    }\n\n    if (disconnectedNodes && !hasEdges) {\n      shouldBreak = callback(\n        sourceData.key,\n        null,\n        sourceData.attributes,\n        null,\n        null,\n        null,\n        null\n      );\n\n      if (breakable && shouldBreak) return null;\n    }\n  }\n\n  return;\n}\n\n/**\n * Graphology Serialization Utilities\n * ===================================\n *\n * Collection of functions used by the graph serialization schemes.\n */\n\n/**\n * Formats internal node data into a serialized node.\n *\n * @param  {any}    key  - The node's key.\n * @param  {object} data - Internal node's data.\n * @return {array}       - The serialized node.\n */\nfunction serializeNode(key, data) {\n  const serialized = {key};\n\n  if (!isEmpty(data.attributes))\n    serialized.attributes = assign({}, data.attributes);\n\n  return serialized;\n}\n\n/**\n * Formats internal edge data into a serialized edge.\n *\n * @param  {string} type - The graph's type.\n * @param  {any}    key  - The edge's key.\n * @param  {object} data - Internal edge's data.\n * @return {array}       - The serialized edge.\n */\nfunction serializeEdge(type, key, data) {\n  const serialized = {\n    key,\n    source: data.source.key,\n    target: data.target.key\n  };\n\n  if (!isEmpty(data.attributes))\n    serialized.attributes = assign({}, data.attributes);\n\n  if (type === 'mixed' && data.undirected) serialized.undirected = true;\n\n  return serialized;\n}\n\n/**\n * Checks whether the given value is a serialized node.\n *\n * @param  {mixed} value - Target value.\n * @return {string|null}\n */\nfunction validateSerializedNode(value) {\n  if (!isPlainObject(value))\n    throw new InvalidArgumentsGraphError(\n      'Graph.import: invalid serialized node. A serialized node should be a plain object with at least a \"key\" property.'\n    );\n\n  if (!('key' in value))\n    throw new InvalidArgumentsGraphError(\n      'Graph.import: serialized node is missing its key.'\n    );\n\n  if (\n    'attributes' in value &&\n    (!isPlainObject(value.attributes) || value.attributes === null)\n  )\n    throw new InvalidArgumentsGraphError(\n      'Graph.import: invalid attributes. Attributes should be a plain object, null or omitted.'\n    );\n}\n\n/**\n * Checks whether the given value is a serialized edge.\n *\n * @param  {mixed} value - Target value.\n * @return {string|null}\n */\nfunction validateSerializedEdge(value) {\n  if (!isPlainObject(value))\n    throw new InvalidArgumentsGraphError(\n      'Graph.import: invalid serialized edge. A serialized edge should be a plain object with at least a \"source\" & \"target\" property.'\n    );\n\n  if (!('source' in value))\n    throw new InvalidArgumentsGraphError(\n      'Graph.import: serialized edge is missing its source.'\n    );\n\n  if (!('target' in value))\n    throw new InvalidArgumentsGraphError(\n      'Graph.import: serialized edge is missing its target.'\n    );\n\n  if (\n    'attributes' in value &&\n    (!isPlainObject(value.attributes) || value.attributes === null)\n  )\n    throw new InvalidArgumentsGraphError(\n      'Graph.import: invalid attributes. Attributes should be a plain object, null or omitted.'\n    );\n\n  if ('undirected' in value && typeof value.undirected !== 'boolean')\n    throw new InvalidArgumentsGraphError(\n      'Graph.import: invalid undirectedness information. Undirected should be boolean or omitted.'\n    );\n}\n\n/* eslint no-nested-ternary: 0 */\n\n/**\n * Constants.\n */\nconst INSTANCE_ID = incrementalIdStartingFromRandomByte();\n\n/**\n * Enums.\n */\nconst TYPES = new Set(['directed', 'undirected', 'mixed']);\n\nconst EMITTER_PROPS = new Set([\n  'domain',\n  '_events',\n  '_eventsCount',\n  '_maxListeners'\n]);\n\nconst EDGE_ADD_METHODS = [\n  {\n    name: verb => `${verb}Edge`,\n    generateKey: true\n  },\n  {\n    name: verb => `${verb}DirectedEdge`,\n    generateKey: true,\n    type: 'directed'\n  },\n  {\n    name: verb => `${verb}UndirectedEdge`,\n    generateKey: true,\n    type: 'undirected'\n  },\n  {\n    name: verb => `${verb}EdgeWithKey`\n  },\n  {\n    name: verb => `${verb}DirectedEdgeWithKey`,\n    type: 'directed'\n  },\n  {\n    name: verb => `${verb}UndirectedEdgeWithKey`,\n    type: 'undirected'\n  }\n];\n\n/**\n * Default options.\n */\nconst DEFAULTS = {\n  allowSelfLoops: true,\n  multi: false,\n  type: 'mixed'\n};\n\n/**\n * Abstract functions used by the Graph class for various methods.\n */\n\n/**\n * Internal method used to add a node to the given graph\n *\n * @param  {Graph}   graph           - Target graph.\n * @param  {any}     node            - The node's key.\n * @param  {object}  [attributes]    - Optional attributes.\n * @return {NodeData}                - Created node data.\n */\nfunction addNode(graph, node, attributes) {\n  if (attributes && !isPlainObject(attributes))\n    throw new InvalidArgumentsGraphError(\n      `Graph.addNode: invalid attributes. Expecting an object but got \"${attributes}\"`\n    );\n\n  // String coercion\n  node = '' + node;\n  attributes = attributes || {};\n\n  if (graph._nodes.has(node))\n    throw new UsageGraphError(\n      `Graph.addNode: the \"${node}\" node already exist in the graph.`\n    );\n\n  const data = new graph.NodeDataClass(node, attributes);\n\n  // Adding the node to internal register\n  graph._nodes.set(node, data);\n\n  // Emitting\n  graph.emit('nodeAdded', {\n    key: node,\n    attributes\n  });\n\n  return data;\n}\n\n/**\n * Same as the above but without sanity checks because we call this in contexts\n * where necessary checks were already done.\n */\nfunction unsafeAddNode(graph, node, attributes) {\n  const data = new graph.NodeDataClass(node, attributes);\n\n  graph._nodes.set(node, data);\n\n  graph.emit('nodeAdded', {\n    key: node,\n    attributes\n  });\n\n  return data;\n}\n\n/**\n * Internal method used to add an arbitrary edge to the given graph.\n *\n * @param  {Graph}   graph           - Target graph.\n * @param  {string}  name            - Name of the child method for errors.\n * @param  {boolean} mustGenerateKey - Should the graph generate an id?\n * @param  {boolean} undirected      - Whether the edge is undirected.\n * @param  {any}     edge            - The edge's key.\n * @param  {any}     source          - The source node.\n * @param  {any}     target          - The target node.\n * @param  {object}  [attributes]    - Optional attributes.\n * @return {any}                     - The edge.\n *\n * @throws {Error} - Will throw if the graph is of the wrong type.\n * @throws {Error} - Will throw if the given attributes are not an object.\n * @throws {Error} - Will throw if source or target doesn't exist.\n * @throws {Error} - Will throw if the edge already exist.\n */\nfunction addEdge(\n  graph,\n  name,\n  mustGenerateKey,\n  undirected,\n  edge,\n  source,\n  target,\n  attributes\n) {\n  // Checking validity of operation\n  if (!undirected && graph.type === 'undirected')\n    throw new UsageGraphError(\n      `Graph.${name}: you cannot add a directed edge to an undirected graph. Use the #.addEdge or #.addUndirectedEdge instead.`\n    );\n\n  if (undirected && graph.type === 'directed')\n    throw new UsageGraphError(\n      `Graph.${name}: you cannot add an undirected edge to a directed graph. Use the #.addEdge or #.addDirectedEdge instead.`\n    );\n\n  if (attributes && !isPlainObject(attributes))\n    throw new InvalidArgumentsGraphError(\n      `Graph.${name}: invalid attributes. Expecting an object but got \"${attributes}\"`\n    );\n\n  // Coercion of source & target:\n  source = '' + source;\n  target = '' + target;\n  attributes = attributes || {};\n\n  if (!graph.allowSelfLoops && source === target)\n    throw new UsageGraphError(\n      `Graph.${name}: source & target are the same (\"${source}\"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false.`\n    );\n\n  const sourceData = graph._nodes.get(source),\n    targetData = graph._nodes.get(target);\n\n  if (!sourceData)\n    throw new NotFoundGraphError(\n      `Graph.${name}: source node \"${source}\" not found.`\n    );\n\n  if (!targetData)\n    throw new NotFoundGraphError(\n      `Graph.${name}: target node \"${target}\" not found.`\n    );\n\n  // Must the graph generate an id for this edge?\n  const eventData = {\n    key: null,\n    undirected,\n    source,\n    target,\n    attributes\n  };\n\n  if (mustGenerateKey) {\n    // NOTE: in this case we can guarantee that the key does not already\n    // exist and is already correctly casted as a string\n    edge = graph._edgeKeyGenerator();\n  } else {\n    // Coercion of edge key\n    edge = '' + edge;\n\n    // Here, we have a key collision\n    if (graph._edges.has(edge))\n      throw new UsageGraphError(\n        `Graph.${name}: the \"${edge}\" edge already exists in the graph.`\n      );\n  }\n\n  // Here, we might have a source / target collision\n  if (\n    !graph.multi &&\n    (undirected\n      ? typeof sourceData.undirected[target] !== 'undefined'\n      : typeof sourceData.out[target] !== 'undefined')\n  ) {\n    throw new UsageGraphError(\n      `Graph.${name}: an edge linking \"${source}\" to \"${target}\" already exists. If you really want to add multiple edges linking those nodes, you should create a multi graph by using the 'multi' option.`\n    );\n  }\n\n  // Storing some data\n  const edgeData = new EdgeData(\n    undirected,\n    edge,\n    sourceData,\n    targetData,\n    attributes\n  );\n\n  // Adding the edge to the internal register\n  graph._edges.set(edge, edgeData);\n\n  // Incrementing node degree counters\n  const isSelfLoop = source === target;\n\n  if (undirected) {\n    sourceData.undirectedDegree++;\n    targetData.undirectedDegree++;\n\n    if (isSelfLoop) {\n      sourceData.undirectedLoops++;\n      graph._undirectedSelfLoopCount++;\n    }\n  } else {\n    sourceData.outDegree++;\n    targetData.inDegree++;\n\n    if (isSelfLoop) {\n      sourceData.directedLoops++;\n      graph._directedSelfLoopCount++;\n    }\n  }\n\n  // Updating relevant index\n  if (graph.multi) edgeData.attachMulti();\n  else edgeData.attach();\n\n  if (undirected) graph._undirectedSize++;\n  else graph._directedSize++;\n\n  // Emitting\n  eventData.key = edge;\n\n  graph.emit('edgeAdded', eventData);\n\n  return edge;\n}\n\n/**\n * Internal method used to add an arbitrary edge to the given graph.\n *\n * @param  {Graph}   graph           - Target graph.\n * @param  {string}  name            - Name of the child method for errors.\n * @param  {boolean} mustGenerateKey - Should the graph generate an id?\n * @param  {boolean} undirected      - Whether the edge is undirected.\n * @param  {any}     edge            - The edge's key.\n * @param  {any}     source          - The source node.\n * @param  {any}     target          - The target node.\n * @param  {object}  [attributes]    - Optional attributes.\n * @param  {boolean} [asUpdater]       - Are we updating or merging?\n * @return {any}                     - The edge.\n *\n * @throws {Error} - Will throw if the graph is of the wrong type.\n * @throws {Error} - Will throw if the given attributes are not an object.\n * @throws {Error} - Will throw if source or target doesn't exist.\n * @throws {Error} - Will throw if the edge already exist.\n */\nfunction mergeEdge(\n  graph,\n  name,\n  mustGenerateKey,\n  undirected,\n  edge,\n  source,\n  target,\n  attributes,\n  asUpdater\n) {\n  // Checking validity of operation\n  if (!undirected && graph.type === 'undirected')\n    throw new UsageGraphError(\n      `Graph.${name}: you cannot merge/update a directed edge to an undirected graph. Use the #.mergeEdge/#.updateEdge or #.addUndirectedEdge instead.`\n    );\n\n  if (undirected && graph.type === 'directed')\n    throw new UsageGraphError(\n      `Graph.${name}: you cannot merge/update an undirected edge to a directed graph. Use the #.mergeEdge/#.updateEdge or #.addDirectedEdge instead.`\n    );\n\n  if (attributes) {\n    if (asUpdater) {\n      if (typeof attributes !== 'function')\n        throw new InvalidArgumentsGraphError(\n          `Graph.${name}: invalid updater function. Expecting a function but got \"${attributes}\"`\n        );\n    } else {\n      if (!isPlainObject(attributes))\n        throw new InvalidArgumentsGraphError(\n          `Graph.${name}: invalid attributes. Expecting an object but got \"${attributes}\"`\n        );\n    }\n  }\n\n  // Coercion of source & target:\n  source = '' + source;\n  target = '' + target;\n\n  let updater;\n\n  if (asUpdater) {\n    updater = attributes;\n    attributes = undefined;\n  }\n\n  if (!graph.allowSelfLoops && source === target)\n    throw new UsageGraphError(\n      `Graph.${name}: source & target are the same (\"${source}\"), thus creating a loop explicitly forbidden by this graph 'allowSelfLoops' option set to false.`\n    );\n\n  let sourceData = graph._nodes.get(source);\n  let targetData = graph._nodes.get(target);\n  let edgeData;\n\n  // Do we need to handle duplicate?\n  let alreadyExistingEdgeData;\n\n  if (!mustGenerateKey) {\n    edgeData = graph._edges.get(edge);\n\n    if (edgeData) {\n      // Here, we need to ensure, if the user gave a key, that source & target\n      // are consistent\n      if (edgeData.source.key !== source || edgeData.target.key !== target) {\n        // If source or target inconsistent\n        if (\n          !undirected ||\n          edgeData.source.key !== target ||\n          edgeData.target.key !== source\n        ) {\n          // If directed, or source/target aren't flipped\n          throw new UsageGraphError(\n            `Graph.${name}: inconsistency detected when attempting to merge the \"${edge}\" edge with \"${source}\" source & \"${target}\" target vs. (\"${edgeData.source.key}\", \"${edgeData.target.key}\").`\n          );\n        }\n      }\n\n      alreadyExistingEdgeData = edgeData;\n    }\n  }\n\n  // Here, we might have a source / target collision\n  if (!alreadyExistingEdgeData && !graph.multi && sourceData) {\n    alreadyExistingEdgeData = undirected\n      ? sourceData.undirected[target]\n      : sourceData.out[target];\n  }\n\n  // Handling duplicates\n  if (alreadyExistingEdgeData) {\n    const info = [alreadyExistingEdgeData.key, false, false, false];\n\n    // We can skip the attribute merging part if the user did not provide them\n    if (asUpdater ? !updater : !attributes) return info;\n\n    // Updating the attributes\n    if (asUpdater) {\n      const oldAttributes = alreadyExistingEdgeData.attributes;\n      alreadyExistingEdgeData.attributes = updater(oldAttributes);\n\n      graph.emit('edgeAttributesUpdated', {\n        type: 'replace',\n        key: alreadyExistingEdgeData.key,\n        attributes: alreadyExistingEdgeData.attributes\n      });\n    }\n\n    // Merging the attributes\n    else {\n      assign(alreadyExistingEdgeData.attributes, attributes);\n\n      graph.emit('edgeAttributesUpdated', {\n        type: 'merge',\n        key: alreadyExistingEdgeData.key,\n        attributes: alreadyExistingEdgeData.attributes,\n        data: attributes\n      });\n    }\n\n    return info;\n  }\n\n  attributes = attributes || {};\n\n  if (asUpdater && updater) attributes = updater(attributes);\n\n  // Must the graph generate an id for this edge?\n  const eventData = {\n    key: null,\n    undirected,\n    source,\n    target,\n    attributes\n  };\n\n  if (mustGenerateKey) {\n    // NOTE: in this case we can guarantee that the key does not already\n    // exist and is already correctly casted as a string\n    edge = graph._edgeKeyGenerator();\n  } else {\n    // Coercion of edge key\n    edge = '' + edge;\n\n    // Here, we have a key collision\n    if (graph._edges.has(edge))\n      throw new UsageGraphError(\n        `Graph.${name}: the \"${edge}\" edge already exists in the graph.`\n      );\n  }\n\n  let sourceWasAdded = false;\n  let targetWasAdded = false;\n\n  if (!sourceData) {\n    sourceData = unsafeAddNode(graph, source, {});\n    sourceWasAdded = true;\n\n    if (source === target) {\n      targetData = sourceData;\n      targetWasAdded = true;\n    }\n  }\n  if (!targetData) {\n    targetData = unsafeAddNode(graph, target, {});\n    targetWasAdded = true;\n  }\n\n  // Storing some data\n  edgeData = new EdgeData(undirected, edge, sourceData, targetData, attributes);\n\n  // Adding the edge to the internal register\n  graph._edges.set(edge, edgeData);\n\n  // Incrementing node degree counters\n  const isSelfLoop = source === target;\n\n  if (undirected) {\n    sourceData.undirectedDegree++;\n    targetData.undirectedDegree++;\n\n    if (isSelfLoop) {\n      sourceData.undirectedLoops++;\n      graph._undirectedSelfLoopCount++;\n    }\n  } else {\n    sourceData.outDegree++;\n    targetData.inDegree++;\n\n    if (isSelfLoop) {\n      sourceData.directedLoops++;\n      graph._directedSelfLoopCount++;\n    }\n  }\n\n  // Updating relevant index\n  if (graph.multi) edgeData.attachMulti();\n  else edgeData.attach();\n\n  if (undirected) graph._undirectedSize++;\n  else graph._directedSize++;\n\n  // Emitting\n  eventData.key = edge;\n\n  graph.emit('edgeAdded', eventData);\n\n  return [edge, true, sourceWasAdded, targetWasAdded];\n}\n\n/**\n * Internal method used to drop an edge.\n *\n * @param  {Graph}    graph    - Target graph.\n * @param  {EdgeData} edgeData - Data of the edge to drop.\n */\nfunction dropEdgeFromData(graph, edgeData) {\n  // Dropping the edge from the register\n  graph._edges.delete(edgeData.key);\n\n  // Updating related degrees\n  const {source: sourceData, target: targetData, attributes} = edgeData;\n\n  const undirected = edgeData.undirected;\n\n  const isSelfLoop = sourceData === targetData;\n\n  if (undirected) {\n    sourceData.undirectedDegree--;\n    targetData.undirectedDegree--;\n\n    if (isSelfLoop) {\n      sourceData.undirectedLoops--;\n      graph._undirectedSelfLoopCount--;\n    }\n  } else {\n    sourceData.outDegree--;\n    targetData.inDegree--;\n\n    if (isSelfLoop) {\n      sourceData.directedLoops--;\n      graph._directedSelfLoopCount--;\n    }\n  }\n\n  // Clearing index\n  if (graph.multi) edgeData.detachMulti();\n  else edgeData.detach();\n\n  if (undirected) graph._undirectedSize--;\n  else graph._directedSize--;\n\n  // Emitting\n  graph.emit('edgeDropped', {\n    key: edgeData.key,\n    attributes,\n    source: sourceData.key,\n    target: targetData.key,\n    undirected\n  });\n}\n\n/**\n * Graph class\n *\n * @constructor\n * @param  {object}  [options] - Options:\n * @param  {boolean}   [allowSelfLoops] - Allow self loops?\n * @param  {string}    [type]           - Type of the graph.\n * @param  {boolean}   [map]            - Allow references as keys?\n * @param  {boolean}   [multi]          - Allow parallel edges?\n *\n * @throws {Error} - Will throw if the arguments are not valid.\n */\nclass Graph extends EventEmitter {\n  constructor(options) {\n    super();\n\n    //-- Solving options\n    options = assign({}, DEFAULTS, options);\n\n    // Enforcing options validity\n    if (typeof options.multi !== 'boolean')\n      throw new InvalidArgumentsGraphError(\n        `Graph.constructor: invalid 'multi' option. Expecting a boolean but got \"${options.multi}\".`\n      );\n\n    if (!TYPES.has(options.type))\n      throw new InvalidArgumentsGraphError(\n        `Graph.constructor: invalid 'type' option. Should be one of \"mixed\", \"directed\" or \"undirected\" but got \"${options.type}\".`\n      );\n\n    if (typeof options.allowSelfLoops !== 'boolean')\n      throw new InvalidArgumentsGraphError(\n        `Graph.constructor: invalid 'allowSelfLoops' option. Expecting a boolean but got \"${options.allowSelfLoops}\".`\n      );\n\n    //-- Private properties\n\n    // Utilities\n    const NodeDataClass =\n      options.type === 'mixed'\n        ? MixedNodeData\n        : options.type === 'directed'\n        ? DirectedNodeData\n        : UndirectedNodeData;\n\n    privateProperty(this, 'NodeDataClass', NodeDataClass);\n\n    // Internal edge key generator\n\n    // NOTE: this internal generator produce keys that are strings\n    // composed of a weird prefix, an incremental instance id starting from\n    // a random byte and finally an internal instance incremental id.\n    // All this to avoid intra-frame and cross-frame adversarial inputs\n    // that can force a single #.addEdge call to degenerate into a O(n)\n    // available key search loop.\n\n    // It also ensures that automatically generated edge keys are unlikely\n    // to produce collisions with arbitrary keys given by users.\n    const instancePrefix = 'geid_' + INSTANCE_ID() + '_';\n    let edgeId = 0;\n\n    const edgeKeyGenerator = () => {\n      let availableEdgeKey;\n\n      do {\n        availableEdgeKey = instancePrefix + edgeId++;\n      } while (this._edges.has(availableEdgeKey));\n\n      return availableEdgeKey;\n    };\n\n    // Indexes\n    privateProperty(this, '_attributes', {});\n    privateProperty(this, '_nodes', new Map());\n    privateProperty(this, '_edges', new Map());\n    privateProperty(this, '_directedSize', 0);\n    privateProperty(this, '_undirectedSize', 0);\n    privateProperty(this, '_directedSelfLoopCount', 0);\n    privateProperty(this, '_undirectedSelfLoopCount', 0);\n    privateProperty(this, '_edgeKeyGenerator', edgeKeyGenerator);\n\n    // Options\n    privateProperty(this, '_options', options);\n\n    // Emitter properties\n    EMITTER_PROPS.forEach(prop => privateProperty(this, prop, this[prop]));\n\n    //-- Properties readers\n    readOnlyProperty(this, 'order', () => this._nodes.size);\n    readOnlyProperty(this, 'size', () => this._edges.size);\n    readOnlyProperty(this, 'directedSize', () => this._directedSize);\n    readOnlyProperty(this, 'undirectedSize', () => this._undirectedSize);\n    readOnlyProperty(\n      this,\n      'selfLoopCount',\n      () => this._directedSelfLoopCount + this._undirectedSelfLoopCount\n    );\n    readOnlyProperty(\n      this,\n      'directedSelfLoopCount',\n      () => this._directedSelfLoopCount\n    );\n    readOnlyProperty(\n      this,\n      'undirectedSelfLoopCount',\n      () => this._undirectedSelfLoopCount\n    );\n    readOnlyProperty(this, 'multi', this._options.multi);\n    readOnlyProperty(this, 'type', this._options.type);\n    readOnlyProperty(this, 'allowSelfLoops', this._options.allowSelfLoops);\n    readOnlyProperty(this, 'implementation', () => 'graphology');\n  }\n\n  _resetInstanceCounters() {\n    this._directedSize = 0;\n    this._undirectedSize = 0;\n    this._directedSelfLoopCount = 0;\n    this._undirectedSelfLoopCount = 0;\n  }\n\n  /**---------------------------------------------------------------------------\n   * Read\n   **---------------------------------------------------------------------------\n   */\n\n  /**\n   * Method returning whether the given node is found in the graph.\n   *\n   * @param  {any}     node - The node.\n   * @return {boolean}\n   */\n  hasNode(node) {\n    return this._nodes.has('' + node);\n  }\n\n  /**\n   * Method returning whether the given directed edge is found in the graph.\n   *\n   * Arity 1:\n   * @param  {any}     edge - The edge's key.\n   *\n   * Arity 2:\n   * @param  {any}     source - The edge's source.\n   * @param  {any}     target - The edge's target.\n   *\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the arguments are invalid.\n   */\n  hasDirectedEdge(source, target) {\n    // Early termination\n    if (this.type === 'undirected') return false;\n\n    if (arguments.length === 1) {\n      const edge = '' + source;\n\n      const edgeData = this._edges.get(edge);\n\n      return !!edgeData && !edgeData.undirected;\n    } else if (arguments.length === 2) {\n      source = '' + source;\n      target = '' + target;\n\n      // If the node source or the target is not in the graph we break\n      const nodeData = this._nodes.get(source);\n\n      if (!nodeData) return false;\n\n      // Is there a directed edge pointing toward target?\n      return nodeData.out.hasOwnProperty(target);\n    }\n\n    throw new InvalidArgumentsGraphError(\n      `Graph.hasDirectedEdge: invalid arity (${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.`\n    );\n  }\n\n  /**\n   * Method returning whether the given undirected edge is found in the graph.\n   *\n   * Arity 1:\n   * @param  {any}     edge - The edge's key.\n   *\n   * Arity 2:\n   * @param  {any}     source - The edge's source.\n   * @param  {any}     target - The edge's target.\n   *\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the arguments are invalid.\n   */\n  hasUndirectedEdge(source, target) {\n    // Early termination\n    if (this.type === 'directed') return false;\n\n    if (arguments.length === 1) {\n      const edge = '' + source;\n\n      const edgeData = this._edges.get(edge);\n\n      return !!edgeData && edgeData.undirected;\n    } else if (arguments.length === 2) {\n      source = '' + source;\n      target = '' + target;\n\n      // If the node source or the target is not in the graph we break\n      const nodeData = this._nodes.get(source);\n\n      if (!nodeData) return false;\n\n      // Is there a directed edge pointing toward target?\n      return nodeData.undirected.hasOwnProperty(target);\n    }\n\n    throw new InvalidArgumentsGraphError(\n      `Graph.hasDirectedEdge: invalid arity (${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.`\n    );\n  }\n\n  /**\n   * Method returning whether the given edge is found in the graph.\n   *\n   * Arity 1:\n   * @param  {any}     edge - The edge's key.\n   *\n   * Arity 2:\n   * @param  {any}     source - The edge's source.\n   * @param  {any}     target - The edge's target.\n   *\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the arguments are invalid.\n   */\n  hasEdge(source, target) {\n    if (arguments.length === 1) {\n      const edge = '' + source;\n\n      return this._edges.has(edge);\n    } else if (arguments.length === 2) {\n      source = '' + source;\n      target = '' + target;\n\n      // If the node source or the target is not in the graph we break\n      const nodeData = this._nodes.get(source);\n\n      if (!nodeData) return false;\n\n      // Is there a directed edge pointing toward target?\n      return (\n        (typeof nodeData.out !== 'undefined' &&\n          nodeData.out.hasOwnProperty(target)) ||\n        (typeof nodeData.undirected !== 'undefined' &&\n          nodeData.undirected.hasOwnProperty(target))\n      );\n    }\n\n    throw new InvalidArgumentsGraphError(\n      `Graph.hasEdge: invalid arity (${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.`\n    );\n  }\n\n  /**\n   * Method returning the edge matching source & target in a directed fashion.\n   *\n   * @param  {any} source - The edge's source.\n   * @param  {any} target - The edge's target.\n   *\n   * @return {any|undefined}\n   *\n   * @throws {Error} - Will throw if the graph is multi.\n   * @throws {Error} - Will throw if source or target doesn't exist.\n   */\n  directedEdge(source, target) {\n    if (this.type === 'undirected') return;\n\n    source = '' + source;\n    target = '' + target;\n\n    if (this.multi)\n      throw new UsageGraphError(\n        'Graph.directedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.directedEdges instead.'\n      );\n\n    const sourceData = this._nodes.get(source);\n\n    if (!sourceData)\n      throw new NotFoundGraphError(\n        `Graph.directedEdge: could not find the \"${source}\" source node in the graph.`\n      );\n\n    if (!this._nodes.has(target))\n      throw new NotFoundGraphError(\n        `Graph.directedEdge: could not find the \"${target}\" target node in the graph.`\n      );\n\n    const edgeData = (sourceData.out && sourceData.out[target]) || undefined;\n\n    if (edgeData) return edgeData.key;\n  }\n\n  /**\n   * Method returning the edge matching source & target in a undirected fashion.\n   *\n   * @param  {any} source - The edge's source.\n   * @param  {any} target - The edge's target.\n   *\n   * @return {any|undefined}\n   *\n   * @throws {Error} - Will throw if the graph is multi.\n   * @throws {Error} - Will throw if source or target doesn't exist.\n   */\n  undirectedEdge(source, target) {\n    if (this.type === 'directed') return;\n\n    source = '' + source;\n    target = '' + target;\n\n    if (this.multi)\n      throw new UsageGraphError(\n        'Graph.undirectedEdge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.undirectedEdges instead.'\n      );\n\n    const sourceData = this._nodes.get(source);\n\n    if (!sourceData)\n      throw new NotFoundGraphError(\n        `Graph.undirectedEdge: could not find the \"${source}\" source node in the graph.`\n      );\n\n    if (!this._nodes.has(target))\n      throw new NotFoundGraphError(\n        `Graph.undirectedEdge: could not find the \"${target}\" target node in the graph.`\n      );\n\n    const edgeData =\n      (sourceData.undirected && sourceData.undirected[target]) || undefined;\n\n    if (edgeData) return edgeData.key;\n  }\n\n  /**\n   * Method returning the edge matching source & target in a mixed fashion.\n   *\n   * @param  {any} source - The edge's source.\n   * @param  {any} target - The edge's target.\n   *\n   * @return {any|undefined}\n   *\n   * @throws {Error} - Will throw if the graph is multi.\n   * @throws {Error} - Will throw if source or target doesn't exist.\n   */\n  edge(source, target) {\n    if (this.multi)\n      throw new UsageGraphError(\n        'Graph.edge: this method is irrelevant with multigraphs since there might be multiple edges between source & target. See #.edges instead.'\n      );\n\n    source = '' + source;\n    target = '' + target;\n\n    const sourceData = this._nodes.get(source);\n\n    if (!sourceData)\n      throw new NotFoundGraphError(\n        `Graph.edge: could not find the \"${source}\" source node in the graph.`\n      );\n\n    if (!this._nodes.has(target))\n      throw new NotFoundGraphError(\n        `Graph.edge: could not find the \"${target}\" target node in the graph.`\n      );\n\n    const edgeData =\n      (sourceData.out && sourceData.out[target]) ||\n      (sourceData.undirected && sourceData.undirected[target]) ||\n      undefined;\n\n    if (edgeData) return edgeData.key;\n  }\n\n  /**\n   * Method returning whether two nodes are directed neighbors.\n   *\n   * @param  {any}     node     - The node's key.\n   * @param  {any}     neighbor - The neighbor's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  areDirectedNeighbors(node, neighbor) {\n    node = '' + node;\n    neighbor = '' + neighbor;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.areDirectedNeighbors: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'undirected') return false;\n\n    return neighbor in nodeData.in || neighbor in nodeData.out;\n  }\n\n  /**\n   * Method returning whether two nodes are out neighbors.\n   *\n   * @param  {any}     node     - The node's key.\n   * @param  {any}     neighbor - The neighbor's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  areOutNeighbors(node, neighbor) {\n    node = '' + node;\n    neighbor = '' + neighbor;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.areOutNeighbors: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'undirected') return false;\n\n    return neighbor in nodeData.out;\n  }\n\n  /**\n   * Method returning whether two nodes are in neighbors.\n   *\n   * @param  {any}     node     - The node's key.\n   * @param  {any}     neighbor - The neighbor's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  areInNeighbors(node, neighbor) {\n    node = '' + node;\n    neighbor = '' + neighbor;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.areInNeighbors: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'undirected') return false;\n\n    return neighbor in nodeData.in;\n  }\n\n  /**\n   * Method returning whether two nodes are undirected neighbors.\n   *\n   * @param  {any}     node     - The node's key.\n   * @param  {any}     neighbor - The neighbor's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  areUndirectedNeighbors(node, neighbor) {\n    node = '' + node;\n    neighbor = '' + neighbor;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.areUndirectedNeighbors: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'directed') return false;\n\n    return neighbor in nodeData.undirected;\n  }\n\n  /**\n   * Method returning whether two nodes are neighbors.\n   *\n   * @param  {any}     node     - The node's key.\n   * @param  {any}     neighbor - The neighbor's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  areNeighbors(node, neighbor) {\n    node = '' + node;\n    neighbor = '' + neighbor;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.areNeighbors: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type !== 'undirected') {\n      if (neighbor in nodeData.in || neighbor in nodeData.out) return true;\n    }\n\n    if (this.type !== 'directed') {\n      if (neighbor in nodeData.undirected) return true;\n    }\n\n    return false;\n  }\n\n  /**\n   * Method returning whether two nodes are inbound neighbors.\n   *\n   * @param  {any}     node     - The node's key.\n   * @param  {any}     neighbor - The neighbor's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  areInboundNeighbors(node, neighbor) {\n    node = '' + node;\n    neighbor = '' + neighbor;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.areInboundNeighbors: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type !== 'undirected') {\n      if (neighbor in nodeData.in) return true;\n    }\n\n    if (this.type !== 'directed') {\n      if (neighbor in nodeData.undirected) return true;\n    }\n\n    return false;\n  }\n\n  /**\n   * Method returning whether two nodes are outbound neighbors.\n   *\n   * @param  {any}     node     - The node's key.\n   * @param  {any}     neighbor - The neighbor's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  areOutboundNeighbors(node, neighbor) {\n    node = '' + node;\n    neighbor = '' + neighbor;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.areOutboundNeighbors: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type !== 'undirected') {\n      if (neighbor in nodeData.out) return true;\n    }\n\n    if (this.type !== 'directed') {\n      if (neighbor in nodeData.undirected) return true;\n    }\n\n    return false;\n  }\n\n  /**\n   * Method returning the given node's in degree.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's in degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  inDegree(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.inDegree: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'undirected') return 0;\n\n    return nodeData.inDegree;\n  }\n\n  /**\n   * Method returning the given node's out degree.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's in degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  outDegree(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.outDegree: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'undirected') return 0;\n\n    return nodeData.outDegree;\n  }\n\n  /**\n   * Method returning the given node's directed degree.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's in degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  directedDegree(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.directedDegree: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'undirected') return 0;\n\n    return nodeData.inDegree + nodeData.outDegree;\n  }\n\n  /**\n   * Method returning the given node's undirected degree.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's in degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  undirectedDegree(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.undirectedDegree: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'directed') return 0;\n\n    return nodeData.undirectedDegree;\n  }\n\n  /**\n   * Method returning the given node's inbound degree.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's inbound degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  inboundDegree(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.inboundDegree: could not find the \"${node}\" node in the graph.`\n      );\n\n    let degree = 0;\n\n    if (this.type !== 'directed') {\n      degree += nodeData.undirectedDegree;\n    }\n\n    if (this.type !== 'undirected') {\n      degree += nodeData.inDegree;\n    }\n\n    return degree;\n  }\n\n  /**\n   * Method returning the given node's outbound degree.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's outbound degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  outboundDegree(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.outboundDegree: could not find the \"${node}\" node in the graph.`\n      );\n\n    let degree = 0;\n\n    if (this.type !== 'directed') {\n      degree += nodeData.undirectedDegree;\n    }\n\n    if (this.type !== 'undirected') {\n      degree += nodeData.outDegree;\n    }\n\n    return degree;\n  }\n\n  /**\n   * Method returning the given node's directed degree.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  degree(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.degree: could not find the \"${node}\" node in the graph.`\n      );\n\n    let degree = 0;\n\n    if (this.type !== 'directed') {\n      degree += nodeData.undirectedDegree;\n    }\n\n    if (this.type !== 'undirected') {\n      degree += nodeData.inDegree + nodeData.outDegree;\n    }\n\n    return degree;\n  }\n\n  /**\n   * Method returning the given node's in degree without considering self loops.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's in degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  inDegreeWithoutSelfLoops(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.inDegreeWithoutSelfLoops: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'undirected') return 0;\n\n    return nodeData.inDegree - nodeData.directedLoops;\n  }\n\n  /**\n   * Method returning the given node's out degree without considering self loops.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's in degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  outDegreeWithoutSelfLoops(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.outDegreeWithoutSelfLoops: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'undirected') return 0;\n\n    return nodeData.outDegree - nodeData.directedLoops;\n  }\n\n  /**\n   * Method returning the given node's directed degree without considering self loops.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's in degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  directedDegreeWithoutSelfLoops(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.directedDegreeWithoutSelfLoops: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'undirected') return 0;\n\n    return nodeData.inDegree + nodeData.outDegree - nodeData.directedLoops * 2;\n  }\n\n  /**\n   * Method returning the given node's undirected degree without considering self loops.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's in degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  undirectedDegreeWithoutSelfLoops(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.undirectedDegreeWithoutSelfLoops: could not find the \"${node}\" node in the graph.`\n      );\n\n    if (this.type === 'directed') return 0;\n\n    return nodeData.undirectedDegree - nodeData.undirectedLoops * 2;\n  }\n\n  /**\n   * Method returning the given node's inbound degree without considering self loops.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's inbound degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  inboundDegreeWithoutSelfLoops(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.inboundDegreeWithoutSelfLoops: could not find the \"${node}\" node in the graph.`\n      );\n\n    let degree = 0;\n    let loops = 0;\n\n    if (this.type !== 'directed') {\n      degree += nodeData.undirectedDegree;\n      loops += nodeData.undirectedLoops * 2;\n    }\n\n    if (this.type !== 'undirected') {\n      degree += nodeData.inDegree;\n      loops += nodeData.directedLoops;\n    }\n\n    return degree - loops;\n  }\n\n  /**\n   * Method returning the given node's outbound degree without considering self loops.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's outbound degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  outboundDegreeWithoutSelfLoops(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.outboundDegreeWithoutSelfLoops: could not find the \"${node}\" node in the graph.`\n      );\n\n    let degree = 0;\n    let loops = 0;\n\n    if (this.type !== 'directed') {\n      degree += nodeData.undirectedDegree;\n      loops += nodeData.undirectedLoops * 2;\n    }\n\n    if (this.type !== 'undirected') {\n      degree += nodeData.outDegree;\n      loops += nodeData.directedLoops;\n    }\n\n    return degree - loops;\n  }\n\n  /**\n   * Method returning the given node's directed degree without considering self loops.\n   *\n   * @param  {any}     node - The node's key.\n   * @return {number}       - The node's degree.\n   *\n   * @throws {Error} - Will throw if the node isn't in the graph.\n   */\n  degreeWithoutSelfLoops(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.degreeWithoutSelfLoops: could not find the \"${node}\" node in the graph.`\n      );\n\n    let degree = 0;\n    let loops = 0;\n\n    if (this.type !== 'directed') {\n      degree += nodeData.undirectedDegree;\n      loops += nodeData.undirectedLoops * 2;\n    }\n\n    if (this.type !== 'undirected') {\n      degree += nodeData.inDegree + nodeData.outDegree;\n      loops += nodeData.directedLoops * 2;\n    }\n\n    return degree - loops;\n  }\n\n  /**\n   * Method returning the given edge's source.\n   *\n   * @param  {any} edge - The edge's key.\n   * @return {any}      - The edge's source.\n   *\n   * @throws {Error} - Will throw if the edge isn't in the graph.\n   */\n  source(edge) {\n    edge = '' + edge;\n\n    const data = this._edges.get(edge);\n\n    if (!data)\n      throw new NotFoundGraphError(\n        `Graph.source: could not find the \"${edge}\" edge in the graph.`\n      );\n\n    return data.source.key;\n  }\n\n  /**\n   * Method returning the given edge's target.\n   *\n   * @param  {any} edge - The edge's key.\n   * @return {any}      - The edge's target.\n   *\n   * @throws {Error} - Will throw if the edge isn't in the graph.\n   */\n  target(edge) {\n    edge = '' + edge;\n\n    const data = this._edges.get(edge);\n\n    if (!data)\n      throw new NotFoundGraphError(\n        `Graph.target: could not find the \"${edge}\" edge in the graph.`\n      );\n\n    return data.target.key;\n  }\n\n  /**\n   * Method returning the given edge's extremities.\n   *\n   * @param  {any}   edge - The edge's key.\n   * @return {array}      - The edge's extremities.\n   *\n   * @throws {Error} - Will throw if the edge isn't in the graph.\n   */\n  extremities(edge) {\n    edge = '' + edge;\n\n    const edgeData = this._edges.get(edge);\n\n    if (!edgeData)\n      throw new NotFoundGraphError(\n        `Graph.extremities: could not find the \"${edge}\" edge in the graph.`\n      );\n\n    return [edgeData.source.key, edgeData.target.key];\n  }\n\n  /**\n   * Given a node & an edge, returns the other extremity of the edge.\n   *\n   * @param  {any}   node - The node's key.\n   * @param  {any}   edge - The edge's key.\n   * @return {any}        - The related node.\n   *\n   * @throws {Error} - Will throw if the edge isn't in the graph or if the\n   *                   edge & node are not related.\n   */\n  opposite(node, edge) {\n    node = '' + node;\n    edge = '' + edge;\n\n    const data = this._edges.get(edge);\n\n    if (!data)\n      throw new NotFoundGraphError(\n        `Graph.opposite: could not find the \"${edge}\" edge in the graph.`\n      );\n\n    const source = data.source.key;\n    const target = data.target.key;\n\n    if (node === source) return target;\n    if (node === target) return source;\n\n    throw new NotFoundGraphError(\n      `Graph.opposite: the \"${node}\" node is not attached to the \"${edge}\" edge (${source}, ${target}).`\n    );\n  }\n\n  /**\n   * Returns whether the given edge has the given node as extremity.\n   *\n   * @param  {any}     edge - The edge's key.\n   * @param  {any}     node - The node's key.\n   * @return {boolean}      - The related node.\n   *\n   * @throws {Error} - Will throw if either the node or the edge isn't in the graph.\n   */\n  hasExtremity(edge, node) {\n    edge = '' + edge;\n    node = '' + node;\n\n    const data = this._edges.get(edge);\n\n    if (!data)\n      throw new NotFoundGraphError(\n        `Graph.hasExtremity: could not find the \"${edge}\" edge in the graph.`\n      );\n\n    return data.source.key === node || data.target.key === node;\n  }\n\n  /**\n   * Method returning whether the given edge is undirected.\n   *\n   * @param  {any}     edge - The edge's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the edge isn't in the graph.\n   */\n  isUndirected(edge) {\n    edge = '' + edge;\n\n    const data = this._edges.get(edge);\n\n    if (!data)\n      throw new NotFoundGraphError(\n        `Graph.isUndirected: could not find the \"${edge}\" edge in the graph.`\n      );\n\n    return data.undirected;\n  }\n\n  /**\n   * Method returning whether the given edge is directed.\n   *\n   * @param  {any}     edge - The edge's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the edge isn't in the graph.\n   */\n  isDirected(edge) {\n    edge = '' + edge;\n\n    const data = this._edges.get(edge);\n\n    if (!data)\n      throw new NotFoundGraphError(\n        `Graph.isDirected: could not find the \"${edge}\" edge in the graph.`\n      );\n\n    return !data.undirected;\n  }\n\n  /**\n   * Method returning whether the given edge is a self loop.\n   *\n   * @param  {any}     edge - The edge's key.\n   * @return {boolean}\n   *\n   * @throws {Error} - Will throw if the edge isn't in the graph.\n   */\n  isSelfLoop(edge) {\n    edge = '' + edge;\n\n    const data = this._edges.get(edge);\n\n    if (!data)\n      throw new NotFoundGraphError(\n        `Graph.isSelfLoop: could not find the \"${edge}\" edge in the graph.`\n      );\n\n    return data.source === data.target;\n  }\n\n  /**---------------------------------------------------------------------------\n   * Mutation\n   **---------------------------------------------------------------------------\n   */\n\n  /**\n   * Method used to add a node to the graph.\n   *\n   * @param  {any}    node         - The node.\n   * @param  {object} [attributes] - Optional attributes.\n   * @return {any}                 - The node.\n   *\n   * @throws {Error} - Will throw if the given node already exist.\n   * @throws {Error} - Will throw if the given attributes are not an object.\n   */\n  addNode(node, attributes) {\n    const nodeData = addNode(this, node, attributes);\n\n    return nodeData.key;\n  }\n\n  /**\n   * Method used to merge a node into the graph.\n   *\n   * @param  {any}    node         - The node.\n   * @param  {object} [attributes] - Optional attributes.\n   * @return {any}                 - The node.\n   */\n  mergeNode(node, attributes) {\n    if (attributes && !isPlainObject(attributes))\n      throw new InvalidArgumentsGraphError(\n        `Graph.mergeNode: invalid attributes. Expecting an object but got \"${attributes}\"`\n      );\n\n    // String coercion\n    node = '' + node;\n    attributes = attributes || {};\n\n    // If the node already exists, we merge the attributes\n    let data = this._nodes.get(node);\n\n    if (data) {\n      if (attributes) {\n        assign(data.attributes, attributes);\n\n        this.emit('nodeAttributesUpdated', {\n          type: 'merge',\n          key: node,\n          attributes: data.attributes,\n          data: attributes\n        });\n      }\n      return [node, false];\n    }\n\n    data = new this.NodeDataClass(node, attributes);\n\n    // Adding the node to internal register\n    this._nodes.set(node, data);\n\n    // Emitting\n    this.emit('nodeAdded', {\n      key: node,\n      attributes\n    });\n\n    return [node, true];\n  }\n\n  /**\n   * Method used to add a node if it does not exist in the graph or else to\n   * update its attributes using a function.\n   *\n   * @param  {any}      node      - The node.\n   * @param  {function} [updater] - Optional updater function.\n   * @return {any}                - The node.\n   */\n  updateNode(node, updater) {\n    if (updater && typeof updater !== 'function')\n      throw new InvalidArgumentsGraphError(\n        `Graph.updateNode: invalid updater function. Expecting a function but got \"${updater}\"`\n      );\n\n    // String coercion\n    node = '' + node;\n\n    // If the node already exists, we update the attributes\n    let data = this._nodes.get(node);\n\n    if (data) {\n      if (updater) {\n        const oldAttributes = data.attributes;\n        data.attributes = updater(oldAttributes);\n\n        this.emit('nodeAttributesUpdated', {\n          type: 'replace',\n          key: node,\n          attributes: data.attributes\n        });\n      }\n      return [node, false];\n    }\n\n    const attributes = updater ? updater({}) : {};\n\n    data = new this.NodeDataClass(node, attributes);\n\n    // Adding the node to internal register\n    this._nodes.set(node, data);\n\n    // Emitting\n    this.emit('nodeAdded', {\n      key: node,\n      attributes\n    });\n\n    return [node, true];\n  }\n\n  /**\n   * Method used to drop a single node & all its attached edges from the graph.\n   *\n   * @param  {any}    node - The node.\n   * @return {Graph}\n   *\n   * @throws {Error} - Will throw if the node doesn't exist.\n   */\n  dropNode(node) {\n    node = '' + node;\n\n    const nodeData = this._nodes.get(node);\n\n    if (!nodeData)\n      throw new NotFoundGraphError(\n        `Graph.dropNode: could not find the \"${node}\" node in the graph.`\n      );\n\n    let edgeData;\n\n    // Removing attached edges\n    // NOTE: we could be faster here, but this is such a pain to maintain\n    if (this.type !== 'undirected') {\n      for (const neighbor in nodeData.out) {\n        edgeData = nodeData.out[neighbor];\n\n        do {\n          dropEdgeFromData(this, edgeData);\n          edgeData = edgeData.next;\n        } while (edgeData);\n      }\n\n      for (const neighbor in nodeData.in) {\n        edgeData = nodeData.in[neighbor];\n\n        do {\n          dropEdgeFromData(this, edgeData);\n          edgeData = edgeData.next;\n        } while (edgeData);\n      }\n    }\n\n    if (this.type !== 'directed') {\n      for (const neighbor in nodeData.undirected) {\n        edgeData = nodeData.undirected[neighbor];\n\n        do {\n          dropEdgeFromData(this, edgeData);\n          edgeData = edgeData.next;\n        } while (edgeData);\n      }\n    }\n\n    // Dropping the node from the register\n    this._nodes.delete(node);\n\n    // Emitting\n    this.emit('nodeDropped', {\n      key: node,\n      attributes: nodeData.attributes\n    });\n  }\n\n  /**\n   * Method used to drop a single edge from the graph.\n   *\n   * Arity 1:\n   * @param  {any}    edge - The edge.\n   *\n   * Arity 2:\n   * @param  {any}    source - Source node.\n   * @param  {any}    target - Target node.\n   *\n   * @return {Graph}\n   *\n   * @throws {Error} - Will throw if the edge doesn't exist.\n   */\n  dropEdge(edge) {\n    let edgeData;\n\n    if (arguments.length > 1) {\n      const source = '' + arguments[0];\n      const target = '' + arguments[1];\n\n      edgeData = getMatchingEdge(this, source, target, this.type);\n\n      if (!edgeData)\n        throw new NotFoundGraphError(\n          `Graph.dropEdge: could not find the \"${source}\" -> \"${target}\" edge in the graph.`\n        );\n    } else {\n      edge = '' + edge;\n\n      edgeData = this._edges.get(edge);\n\n      if (!edgeData)\n        throw new NotFoundGraphError(\n          `Graph.dropEdge: could not find the \"${edge}\" edge in the graph.`\n        );\n    }\n\n    dropEdgeFromData(this, edgeData);\n\n    return this;\n  }\n\n  /**\n   * Method used to drop a single directed edge from the graph.\n   *\n   * @param  {any}    source - Source node.\n   * @param  {any}    target - Target node.\n   *\n   * @return {Graph}\n   *\n   * @throws {Error} - Will throw if the edge doesn't exist.\n   */\n  dropDirectedEdge(source, target) {\n    if (arguments.length < 2)\n      throw new UsageGraphError(\n        'Graph.dropDirectedEdge: it does not make sense to try and drop a directed edge by key. What if the edge with this key is undirected? Use #.dropEdge for this purpose instead.'\n      );\n\n    if (this.multi)\n      throw new UsageGraphError(\n        'Graph.dropDirectedEdge: cannot use a {source,target} combo when dropping an edge in a MultiGraph since we cannot infer the one you want to delete as there could be multiple ones.'\n      );\n\n    source = '' + source;\n    target = '' + target;\n\n    const edgeData = getMatchingEdge(this, source, target, 'directed');\n\n    if (!edgeData)\n      throw new NotFoundGraphError(\n        `Graph.dropDirectedEdge: could not find a \"${source}\" -> \"${target}\" edge in the graph.`\n      );\n\n    dropEdgeFromData(this, edgeData);\n\n    return this;\n  }\n\n  /**\n   * Method used to drop a single undirected edge from the graph.\n   *\n   * @param  {any}    source - Source node.\n   * @param  {any}    target - Target node.\n   *\n   * @return {Graph}\n   *\n   * @throws {Error} - Will throw if the edge doesn't exist.\n   */\n  dropUndirectedEdge(source, target) {\n    if (arguments.length < 2)\n      throw new UsageGraphError(\n        'Graph.dropUndirectedEdge: it does not make sense to drop a directed edge by key. What if the edge with this key is undirected? Use #.dropEdge for this purpose instead.'\n      );\n\n    if (this.multi)\n      throw new UsageGraphError(\n        'Graph.dropUndirectedEdge: cannot use a {source,target} combo when dropping an edge in a MultiGraph since we cannot infer the one you want to delete as there could be multiple ones.'\n      );\n\n    const edgeData = getMatchingEdge(this, source, target, 'undirected');\n\n    if (!edgeData)\n      throw new NotFoundGraphError(\n        `Graph.dropUndirectedEdge: could not find a \"${source}\" -> \"${target}\" edge in the graph.`\n      );\n\n    dropEdgeFromData(this, edgeData);\n\n    return this;\n  }\n\n  /**\n   * Method used to remove every edge & every node from the graph.\n   *\n   * @return {Graph}\n   */\n  clear() {\n    // Clearing edges\n    this._edges.clear();\n\n    // Clearing nodes\n    this._nodes.clear();\n\n    // Reset counters\n    this._resetInstanceCounters();\n\n    // Emitting\n    this.emit('cleared');\n  }\n\n  /**\n   * Method used to remove every edge from the graph.\n   *\n   * @return {Graph}\n   */\n  clearEdges() {\n    // Clearing structure index\n    const iterator = this._nodes.values();\n\n    let step;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      step.value.clear();\n    }\n\n    // Clearing edges\n    this._edges.clear();\n\n    // Reset counters\n    this._resetInstanceCounters();\n\n    // Emitting\n    this.emit('edgesCleared');\n  }\n\n  /**---------------------------------------------------------------------------\n   * Attributes-related methods\n   **---------------------------------------------------------------------------\n   */\n\n  /**\n   * Method returning the desired graph's attribute.\n   *\n   * @param  {string} name - Name of the attribute.\n   * @return {any}\n   */\n  getAttribute(name) {\n    return this._attributes[name];\n  }\n\n  /**\n   * Method returning the graph's attributes.\n   *\n   * @return {object}\n   */\n  getAttributes() {\n    return this._attributes;\n  }\n\n  /**\n   * Method returning whether the graph has the desired attribute.\n   *\n   * @param  {string}  name - Name of the attribute.\n   * @return {boolean}\n   */\n  hasAttribute(name) {\n    return this._attributes.hasOwnProperty(name);\n  }\n\n  /**\n   * Method setting a value for the desired graph's attribute.\n   *\n   * @param  {string}  name  - Name of the attribute.\n   * @param  {any}     value - Value for the attribute.\n   * @return {Graph}\n   */\n  setAttribute(name, value) {\n    this._attributes[name] = value;\n\n    // Emitting\n    this.emit('attributesUpdated', {\n      type: 'set',\n      attributes: this._attributes,\n      name\n    });\n\n    return this;\n  }\n\n  /**\n   * Method using a function to update the desired graph's attribute's value.\n   *\n   * @param  {string}   name    - Name of the attribute.\n   * @param  {function} updater - Function use to update the attribute's value.\n   * @return {Graph}\n   */\n  updateAttribute(name, updater) {\n    if (typeof updater !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.updateAttribute: updater should be a function.'\n      );\n\n    const value = this._attributes[name];\n\n    this._attributes[name] = updater(value);\n\n    // Emitting\n    this.emit('attributesUpdated', {\n      type: 'set',\n      attributes: this._attributes,\n      name\n    });\n\n    return this;\n  }\n\n  /**\n   * Method removing the desired graph's attribute.\n   *\n   * @param  {string} name  - Name of the attribute.\n   * @return {Graph}\n   */\n  removeAttribute(name) {\n    delete this._attributes[name];\n\n    // Emitting\n    this.emit('attributesUpdated', {\n      type: 'remove',\n      attributes: this._attributes,\n      name\n    });\n\n    return this;\n  }\n\n  /**\n   * Method replacing the graph's attributes.\n   *\n   * @param  {object} attributes - New attributes.\n   * @return {Graph}\n   *\n   * @throws {Error} - Will throw if given attributes are not a plain object.\n   */\n  replaceAttributes(attributes) {\n    if (!isPlainObject(attributes))\n      throw new InvalidArgumentsGraphError(\n        'Graph.replaceAttributes: provided attributes are not a plain object.'\n      );\n\n    this._attributes = attributes;\n\n    // Emitting\n    this.emit('attributesUpdated', {\n      type: 'replace',\n      attributes: this._attributes\n    });\n\n    return this;\n  }\n\n  /**\n   * Method merging the graph's attributes.\n   *\n   * @param  {object} attributes - Attributes to merge.\n   * @return {Graph}\n   *\n   * @throws {Error} - Will throw if given attributes are not a plain object.\n   */\n  mergeAttributes(attributes) {\n    if (!isPlainObject(attributes))\n      throw new InvalidArgumentsGraphError(\n        'Graph.mergeAttributes: provided attributes are not a plain object.'\n      );\n\n    assign(this._attributes, attributes);\n\n    // Emitting\n    this.emit('attributesUpdated', {\n      type: 'merge',\n      attributes: this._attributes,\n      data: attributes\n    });\n\n    return this;\n  }\n\n  /**\n   * Method updating the graph's attributes.\n   *\n   * @param  {function} updater - Function used to update the attributes.\n   * @return {Graph}\n   *\n   * @throws {Error} - Will throw if given updater is not a function.\n   */\n  updateAttributes(updater) {\n    if (typeof updater !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.updateAttributes: provided updater is not a function.'\n      );\n\n    this._attributes = updater(this._attributes);\n\n    // Emitting\n    this.emit('attributesUpdated', {\n      type: 'update',\n      attributes: this._attributes\n    });\n\n    return this;\n  }\n\n  /**\n   * Method used to update each node's attributes using the given function.\n   *\n   * @param {function}  updater - Updater function to use.\n   * @param {object}    [hints] - Optional hints.\n   */\n  updateEachNodeAttributes(updater, hints) {\n    if (typeof updater !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.updateEachNodeAttributes: expecting an updater function.'\n      );\n\n    if (hints && !validateHints(hints))\n      throw new InvalidArgumentsGraphError(\n        'Graph.updateEachNodeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}'\n      );\n\n    const iterator = this._nodes.values();\n\n    let step, nodeData;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      nodeData = step.value;\n      nodeData.attributes = updater(nodeData.key, nodeData.attributes);\n    }\n\n    this.emit('eachNodeAttributesUpdated', {\n      hints: hints ? hints : null\n    });\n  }\n\n  /**\n   * Method used to update each edge's attributes using the given function.\n   *\n   * @param {function}  updater - Updater function to use.\n   * @param {object}    [hints] - Optional hints.\n   */\n  updateEachEdgeAttributes(updater, hints) {\n    if (typeof updater !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.updateEachEdgeAttributes: expecting an updater function.'\n      );\n\n    if (hints && !validateHints(hints))\n      throw new InvalidArgumentsGraphError(\n        'Graph.updateEachEdgeAttributes: invalid hints. Expecting an object having the following shape: {attributes?: [string]}'\n      );\n\n    const iterator = this._edges.values();\n\n    let step, edgeData, sourceData, targetData;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      edgeData = step.value;\n      sourceData = edgeData.source;\n      targetData = edgeData.target;\n\n      edgeData.attributes = updater(\n        edgeData.key,\n        edgeData.attributes,\n        sourceData.key,\n        targetData.key,\n        sourceData.attributes,\n        targetData.attributes,\n        edgeData.undirected\n      );\n    }\n\n    this.emit('eachEdgeAttributesUpdated', {\n      hints: hints ? hints : null\n    });\n  }\n\n  /**---------------------------------------------------------------------------\n   * Iteration-related methods\n   **---------------------------------------------------------------------------\n   */\n\n  /**\n   * Method iterating over the graph's adjacency using the given callback.\n   *\n   * @param  {function}  callback - Callback to use.\n   */\n  forEachAdjacencyEntry(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.forEachAdjacencyEntry: expecting a callback.'\n      );\n\n    forEachAdjacency(false, false, false, this, callback);\n  }\n  forEachAdjacencyEntryWithOrphans(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.forEachAdjacencyEntryWithOrphans: expecting a callback.'\n      );\n\n    forEachAdjacency(false, false, true, this, callback);\n  }\n\n  /**\n   * Method iterating over the graph's assymetric adjacency using the given callback.\n   *\n   * @param  {function}  callback - Callback to use.\n   */\n  forEachAssymetricAdjacencyEntry(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.forEachAssymetricAdjacencyEntry: expecting a callback.'\n      );\n\n    forEachAdjacency(false, true, false, this, callback);\n  }\n  forEachAssymetricAdjacencyEntryWithOrphans(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.forEachAssymetricAdjacencyEntryWithOrphans: expecting a callback.'\n      );\n\n    forEachAdjacency(false, true, true, this, callback);\n  }\n\n  /**\n   * Method returning the list of the graph's nodes.\n   *\n   * @return {array} - The nodes.\n   */\n  nodes() {\n    return Array.from(this._nodes.keys());\n  }\n\n  /**\n   * Method iterating over the graph's nodes using the given callback.\n   *\n   * @param  {function}  callback - Callback (key, attributes, index).\n   */\n  forEachNode(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.forEachNode: expecting a callback.'\n      );\n\n    const iterator = this._nodes.values();\n\n    let step, nodeData;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      nodeData = step.value;\n      callback(nodeData.key, nodeData.attributes);\n    }\n  }\n\n  /**\n   * Method iterating attempting to find a node matching the given predicate\n   * function.\n   *\n   * @param  {function}  callback - Callback (key, attributes).\n   */\n  findNode(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.findNode: expecting a callback.'\n      );\n\n    const iterator = this._nodes.values();\n\n    let step, nodeData;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      nodeData = step.value;\n\n      if (callback(nodeData.key, nodeData.attributes)) return nodeData.key;\n    }\n\n    return;\n  }\n\n  /**\n   * Method mapping nodes.\n   *\n   * @param  {function}  callback - Callback (key, attributes).\n   */\n  mapNodes(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.mapNode: expecting a callback.'\n      );\n\n    const iterator = this._nodes.values();\n\n    let step, nodeData;\n\n    const result = new Array(this.order);\n    let i = 0;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      nodeData = step.value;\n      result[i++] = callback(nodeData.key, nodeData.attributes);\n    }\n\n    return result;\n  }\n\n  /**\n   * Method returning whether some node verify the given predicate.\n   *\n   * @param  {function}  callback - Callback (key, attributes).\n   */\n  someNode(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.someNode: expecting a callback.'\n      );\n\n    const iterator = this._nodes.values();\n\n    let step, nodeData;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      nodeData = step.value;\n\n      if (callback(nodeData.key, nodeData.attributes)) return true;\n    }\n\n    return false;\n  }\n\n  /**\n   * Method returning whether all node verify the given predicate.\n   *\n   * @param  {function}  callback - Callback (key, attributes).\n   */\n  everyNode(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.everyNode: expecting a callback.'\n      );\n\n    const iterator = this._nodes.values();\n\n    let step, nodeData;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      nodeData = step.value;\n\n      if (!callback(nodeData.key, nodeData.attributes)) return false;\n    }\n\n    return true;\n  }\n\n  /**\n   * Method filtering nodes.\n   *\n   * @param  {function}  callback - Callback (key, attributes).\n   */\n  filterNodes(callback) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.filterNodes: expecting a callback.'\n      );\n\n    const iterator = this._nodes.values();\n\n    let step, nodeData;\n\n    const result = [];\n\n    while (((step = iterator.next()), step.done !== true)) {\n      nodeData = step.value;\n\n      if (callback(nodeData.key, nodeData.attributes))\n        result.push(nodeData.key);\n    }\n\n    return result;\n  }\n\n  /**\n   * Method reducing nodes.\n   *\n   * @param  {function}  callback - Callback (accumulator, key, attributes).\n   */\n  reduceNodes(callback, initialValue) {\n    if (typeof callback !== 'function')\n      throw new InvalidArgumentsGraphError(\n        'Graph.reduceNodes: expecting a callback.'\n      );\n\n    if (arguments.length < 2)\n      throw new InvalidArgumentsGraphError(\n        '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.'\n      );\n\n    let accumulator = initialValue;\n\n    const iterator = this._nodes.values();\n\n    let step, nodeData;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      nodeData = step.value;\n      accumulator = callback(accumulator, nodeData.key, nodeData.attributes);\n    }\n\n    return accumulator;\n  }\n\n  /**\n   * Method returning an iterator over the graph's node entries.\n   *\n   * @return {Iterator}\n   */\n  nodeEntries() {\n    const iterator = this._nodes.values();\n\n    return {\n      [Symbol.iterator]() {\n        return this;\n      },\n      next() {\n        const step = iterator.next();\n        if (step.done) return step;\n        const data = step.value;\n        return {\n          value: {node: data.key, attributes: data.attributes},\n          done: false\n        };\n      }\n    };\n  }\n\n  /**---------------------------------------------------------------------------\n   * Serialization\n   **---------------------------------------------------------------------------\n   */\n\n  /**\n   * Method used to export the whole graph.\n   *\n   * @return {object} - The serialized graph.\n   */\n  export() {\n    const nodes = new Array(this._nodes.size);\n\n    let i = 0;\n\n    this._nodes.forEach((data, key) => {\n      nodes[i++] = serializeNode(key, data);\n    });\n\n    const edges = new Array(this._edges.size);\n\n    i = 0;\n\n    this._edges.forEach((data, key) => {\n      edges[i++] = serializeEdge(this.type, key, data);\n    });\n\n    return {\n      options: {\n        type: this.type,\n        multi: this.multi,\n        allowSelfLoops: this.allowSelfLoops\n      },\n      attributes: this.getAttributes(),\n      nodes,\n      edges\n    };\n  }\n\n  /**\n   * Method used to import a serialized graph.\n   *\n   * @param  {object|Graph} data  - The serialized graph.\n   * @param  {boolean}      merge - Whether to merge data.\n   * @return {Graph}              - Returns itself for chaining.\n   */\n  import(data, merge = false) {\n    // Importing a Graph instance directly\n    if (data instanceof Graph) {\n      // Nodes\n      data.forEachNode((n, a) => {\n        if (merge) this.mergeNode(n, a);\n        else this.addNode(n, a);\n      });\n\n      // Edges\n      data.forEachEdge((e, a, s, t, _sa, _ta, u) => {\n        if (merge) {\n          if (u) this.mergeUndirectedEdgeWithKey(e, s, t, a);\n          else this.mergeDirectedEdgeWithKey(e, s, t, a);\n        } else {\n          if (u) this.addUndirectedEdgeWithKey(e, s, t, a);\n          else this.addDirectedEdgeWithKey(e, s, t, a);\n        }\n      });\n\n      return this;\n    }\n\n    // Importing a serialized graph\n    if (!isPlainObject(data))\n      throw new InvalidArgumentsGraphError(\n        'Graph.import: invalid argument. Expecting a serialized graph or, alternatively, a Graph instance.'\n      );\n\n    if (data.attributes) {\n      if (!isPlainObject(data.attributes))\n        throw new InvalidArgumentsGraphError(\n          'Graph.import: invalid attributes. Expecting a plain object.'\n        );\n\n      if (merge) this.mergeAttributes(data.attributes);\n      else this.replaceAttributes(data.attributes);\n    }\n\n    let i, l, list, node, edge;\n\n    if (data.nodes) {\n      list = data.nodes;\n\n      if (!Array.isArray(list))\n        throw new InvalidArgumentsGraphError(\n          'Graph.import: invalid nodes. Expecting an array.'\n        );\n\n      for (i = 0, l = list.length; i < l; i++) {\n        node = list[i];\n\n        // Validating\n        validateSerializedNode(node);\n\n        // Adding the node\n        const {key, attributes} = node;\n\n        if (merge) this.mergeNode(key, attributes);\n        else this.addNode(key, attributes);\n      }\n    }\n\n    if (data.edges) {\n      let undirectedByDefault = false;\n\n      if (this.type === 'undirected') {\n        undirectedByDefault = true;\n      }\n\n      list = data.edges;\n\n      if (!Array.isArray(list))\n        throw new InvalidArgumentsGraphError(\n          'Graph.import: invalid edges. Expecting an array.'\n        );\n\n      for (i = 0, l = list.length; i < l; i++) {\n        edge = list[i];\n\n        // Validating\n        validateSerializedEdge(edge);\n\n        // Adding the edge\n        const {\n          source,\n          target,\n          attributes,\n          undirected = undirectedByDefault\n        } = edge;\n\n        let method;\n\n        if ('key' in edge) {\n          method = merge\n            ? undirected\n              ? this.mergeUndirectedEdgeWithKey\n              : this.mergeDirectedEdgeWithKey\n            : undirected\n            ? this.addUndirectedEdgeWithKey\n            : this.addDirectedEdgeWithKey;\n\n          method.call(this, edge.key, source, target, attributes);\n        } else {\n          method = merge\n            ? undirected\n              ? this.mergeUndirectedEdge\n              : this.mergeDirectedEdge\n            : undirected\n            ? this.addUndirectedEdge\n            : this.addDirectedEdge;\n\n          method.call(this, source, target, attributes);\n        }\n      }\n    }\n\n    return this;\n  }\n\n  /**---------------------------------------------------------------------------\n   * Utils\n   **---------------------------------------------------------------------------\n   */\n\n  /**\n   * Method returning a null copy of the graph, i.e. a graph without nodes\n   * & edges but with the exact same options.\n   *\n   * @param  {object} options - Options to merge with the current ones.\n   * @return {Graph}          - The null copy.\n   */\n  nullCopy(options) {\n    const graph = new Graph(assign({}, this._options, options));\n    graph.replaceAttributes(assign({}, this.getAttributes()));\n    return graph;\n  }\n\n  /**\n   * Method returning an empty copy of the graph, i.e. a graph without edges but\n   * with the exact same options.\n   *\n   * @param  {object} options - Options to merge with the current ones.\n   * @return {Graph}          - The empty copy.\n   */\n  emptyCopy(options) {\n    const graph = this.nullCopy(options);\n\n    this._nodes.forEach((nodeData, key) => {\n      const attributes = assign({}, nodeData.attributes);\n\n      // NOTE: no need to emit events since user cannot access the instance yet\n      nodeData = new graph.NodeDataClass(key, attributes);\n      graph._nodes.set(key, nodeData);\n    });\n\n    return graph;\n  }\n\n  /**\n   * Method returning an exact copy of the graph.\n   *\n   * @param  {object} options - Upgrade options.\n   * @return {Graph}          - The copy.\n   */\n  copy(options) {\n    options = options || {};\n\n    if (\n      typeof options.type === 'string' &&\n      options.type !== this.type &&\n      options.type !== 'mixed'\n    )\n      throw new UsageGraphError(\n        `Graph.copy: cannot create an incompatible copy from \"${this.type}\" type to \"${options.type}\" because this would mean losing information about the current graph.`\n      );\n\n    if (\n      typeof options.multi === 'boolean' &&\n      options.multi !== this.multi &&\n      options.multi !== true\n    )\n      throw new UsageGraphError(\n        'Graph.copy: cannot create an incompatible copy by downgrading a multi graph to a simple one because this would mean losing information about the current graph.'\n      );\n\n    if (\n      typeof options.allowSelfLoops === 'boolean' &&\n      options.allowSelfLoops !== this.allowSelfLoops &&\n      options.allowSelfLoops !== true\n    )\n      throw new UsageGraphError(\n        'Graph.copy: cannot create an incompatible copy from a graph allowing self loops to one that does not because this would mean losing information about the current graph.'\n      );\n\n    const graph = this.emptyCopy(options);\n\n    const iterator = this._edges.values();\n\n    let step, edgeData;\n\n    while (((step = iterator.next()), step.done !== true)) {\n      edgeData = step.value;\n\n      // NOTE: no need to emit events since user cannot access the instance yet\n      addEdge(\n        graph,\n        'copy',\n        false,\n        edgeData.undirected,\n        edgeData.key,\n        edgeData.source.key,\n        edgeData.target.key,\n        assign({}, edgeData.attributes)\n      );\n    }\n\n    return graph;\n  }\n\n  /**---------------------------------------------------------------------------\n   * Known methods\n   **---------------------------------------------------------------------------\n   */\n\n  /**\n   * Method used by JavaScript to perform JSON serialization.\n   *\n   * @return {object} - The serialized graph.\n   */\n  toJSON() {\n    return this.export();\n  }\n\n  /**\n   * Method returning [object Graph].\n   */\n  toString() {\n    return '[object Graph]';\n  }\n\n  /**\n   * Method used internally by node's console to display a custom object.\n   *\n   * @return {object} - Formatted object representation of the graph.\n   */\n  inspect() {\n    const nodes = {};\n    this._nodes.forEach((data, key) => {\n      nodes[key] = data.attributes;\n    });\n\n    const edges = {},\n      multiIndex = {};\n\n    this._edges.forEach((data, key) => {\n      const direction = data.undirected ? '--' : '->';\n\n      let label = '';\n\n      let source = data.source.key;\n      let target = data.target.key;\n      let tmp;\n\n      if (data.undirected && source > target) {\n        tmp = source;\n        source = target;\n        target = tmp;\n      }\n\n      const desc = `(${source})${direction}(${target})`;\n\n      if (!key.startsWith('geid_')) {\n        label += `[${key}]: `;\n      } else if (this.multi) {\n        if (typeof multiIndex[desc] === 'undefined') {\n          multiIndex[desc] = 0;\n        } else {\n          multiIndex[desc]++;\n        }\n\n        label += `${multiIndex[desc]}. `;\n      }\n\n      label += desc;\n\n      edges[label] = data.attributes;\n    });\n\n    const dummy = {};\n\n    for (const k in this) {\n      if (\n        this.hasOwnProperty(k) &&\n        !EMITTER_PROPS.has(k) &&\n        typeof this[k] !== 'function' &&\n        typeof k !== 'symbol'\n      )\n        dummy[k] = this[k];\n    }\n\n    dummy.attributes = this._attributes;\n    dummy.nodes = nodes;\n    dummy.edges = edges;\n\n    privateProperty(dummy, 'constructor', this.constructor);\n\n    return dummy;\n  }\n}\n\n/**\n * Attaching methods to the prototype.\n *\n * Here, we are attaching a wide variety of methods to the Graph class'\n * prototype when those are very numerous and when their creation is\n * abstracted.\n */\n\n/**\n * Attaching custom inspect method for node >= 10.\n */\nif (typeof Symbol !== 'undefined')\n  Graph.prototype[Symbol.for('nodejs.util.inspect.custom')] =\n    Graph.prototype.inspect;\n\n/**\n * Related to edge addition.\n */\nEDGE_ADD_METHODS.forEach(method => {\n  ['add', 'merge', 'update'].forEach(verb => {\n    const name = method.name(verb);\n    const fn = verb === 'add' ? addEdge : mergeEdge;\n\n    if (method.generateKey) {\n      Graph.prototype[name] = function (source, target, attributes) {\n        return fn(\n          this,\n          name,\n          true,\n          (method.type || this.type) === 'undirected',\n          null,\n          source,\n          target,\n          attributes,\n          verb === 'update'\n        );\n      };\n    } else {\n      Graph.prototype[name] = function (edge, source, target, attributes) {\n        return fn(\n          this,\n          name,\n          false,\n          (method.type || this.type) === 'undirected',\n          edge,\n          source,\n          target,\n          attributes,\n          verb === 'update'\n        );\n      };\n    }\n  });\n});\n\n/**\n * Attributes-related.\n */\nattachNodeAttributesMethods(Graph);\nattachEdgeAttributesMethods(Graph);\n\n/**\n * Edge iteration-related.\n */\nattachEdgeIterationMethods(Graph);\n\n/**\n * Neighbor iteration-related.\n */\nattachNeighborIterationMethods(Graph);\n\n/**\n * Graphology Helper Classes\n * ==========================\n *\n * Building some higher-order classes instantiating the graph with\n * predefinite options.\n */\n\n/**\n * Alternative constructors.\n */\nclass DirectedGraph extends Graph {\n  constructor(options) {\n    const finalOptions = assign({type: 'directed'}, options);\n\n    if ('multi' in finalOptions && finalOptions.multi !== false)\n      throw new InvalidArgumentsGraphError(\n        'DirectedGraph.from: inconsistent indication that the graph should be multi in given options!'\n      );\n\n    if (finalOptions.type !== 'directed')\n      throw new InvalidArgumentsGraphError(\n        'DirectedGraph.from: inconsistent \"' +\n          finalOptions.type +\n          '\" type in given options!'\n      );\n\n    super(finalOptions);\n  }\n}\nclass UndirectedGraph extends Graph {\n  constructor(options) {\n    const finalOptions = assign({type: 'undirected'}, options);\n\n    if ('multi' in finalOptions && finalOptions.multi !== false)\n      throw new InvalidArgumentsGraphError(\n        'UndirectedGraph.from: inconsistent indication that the graph should be multi in given options!'\n      );\n\n    if (finalOptions.type !== 'undirected')\n      throw new InvalidArgumentsGraphError(\n        'UndirectedGraph.from: inconsistent \"' +\n          finalOptions.type +\n          '\" type in given options!'\n      );\n\n    super(finalOptions);\n  }\n}\nclass MultiGraph extends Graph {\n  constructor(options) {\n    const finalOptions = assign({multi: true}, options);\n\n    if ('multi' in finalOptions && finalOptions.multi !== true)\n      throw new InvalidArgumentsGraphError(\n        'MultiGraph.from: inconsistent indication that the graph should be simple in given options!'\n      );\n\n    super(finalOptions);\n  }\n}\nclass MultiDirectedGraph extends Graph {\n  constructor(options) {\n    const finalOptions = assign({type: 'directed', multi: true}, options);\n\n    if ('multi' in finalOptions && finalOptions.multi !== true)\n      throw new InvalidArgumentsGraphError(\n        'MultiDirectedGraph.from: inconsistent indication that the graph should be simple in given options!'\n      );\n\n    if (finalOptions.type !== 'directed')\n      throw new InvalidArgumentsGraphError(\n        'MultiDirectedGraph.from: inconsistent \"' +\n          finalOptions.type +\n          '\" type in given options!'\n      );\n\n    super(finalOptions);\n  }\n}\nclass MultiUndirectedGraph extends Graph {\n  constructor(options) {\n    const finalOptions = assign({type: 'undirected', multi: true}, options);\n\n    if ('multi' in finalOptions && finalOptions.multi !== true)\n      throw new InvalidArgumentsGraphError(\n        'MultiUndirectedGraph.from: inconsistent indication that the graph should be simple in given options!'\n      );\n\n    if (finalOptions.type !== 'undirected')\n      throw new InvalidArgumentsGraphError(\n        'MultiUndirectedGraph.from: inconsistent \"' +\n          finalOptions.type +\n          '\" type in given options!'\n      );\n\n    super(finalOptions);\n  }\n}\n\n/**\n * Attaching static #.from method to each of the constructors.\n */\nfunction attachStaticFromMethod(Class) {\n  /**\n   * Builds a graph from serialized data or another graph's data.\n   *\n   * @param  {Graph|SerializedGraph} data      - Hydratation data.\n   * @param  {object}                [options] - Options.\n   * @return {Class}\n   */\n  Class.from = function (data, options) {\n    // Merging given options with serialized ones\n    const finalOptions = assign({}, data.options, options);\n\n    const instance = new Class(finalOptions);\n    instance.import(data);\n\n    return instance;\n  };\n}\n\nattachStaticFromMethod(Graph);\nattachStaticFromMethod(DirectedGraph);\nattachStaticFromMethod(UndirectedGraph);\nattachStaticFromMethod(MultiGraph);\nattachStaticFromMethod(MultiDirectedGraph);\nattachStaticFromMethod(MultiUndirectedGraph);\n\nGraph.Graph = Graph;\nGraph.DirectedGraph = DirectedGraph;\nGraph.UndirectedGraph = UndirectedGraph;\nGraph.MultiGraph = MultiGraph;\nGraph.MultiDirectedGraph = MultiDirectedGraph;\nGraph.MultiUndirectedGraph = MultiUndirectedGraph;\n\nGraph.InvalidArgumentsGraphError = InvalidArgumentsGraphError;\nGraph.NotFoundGraphError = NotFoundGraphError;\nGraph.UsageGraphError = UsageGraphError;\n\n/**\n * Graphology ESM Endoint\n * =======================\n *\n * Endpoint for ESM modules consumers.\n */\n\nexport { DirectedGraph, Graph, InvalidArgumentsGraphError, MultiDirectedGraph, MultiGraph, MultiUndirectedGraph, NotFoundGraphError, UndirectedGraph, UsageGraphError, Graph as default };\n//# sourceMappingURL=graphology.mjs.map\n","/**\n * Graphology isGraph\n * ===================\n *\n * Very simple function aiming at ensuring the given variable is a\n * graphology instance.\n */\n\n/**\n * Checking the value is a graphology instance.\n *\n * @param  {any}     value - Target value.\n * @return {boolean}\n */\nmodule.exports = function isGraph(value) {\n  return (\n    value !== null &&\n    typeof value === 'object' &&\n    typeof value.addUndirectedEdgeWithKey === 'function' &&\n    typeof value.dropNode === 'function' &&\n    typeof value.multi === 'boolean'\n  );\n};\n","/*\n * Copyright 2026 OpenTrace Contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Deterministic color assignment for node types.\n * Ported from insight-ui's getGroupColor — uses a fixed palette\n * with DJB2 hash fallback for unknown types.\n */\n\nconst PALETTE = [\n  '#6366f1', // Indigo\n  '#f59e0b', // Amber\n  '#10b981', // Emerald\n  '#8b5cf6', // Violet\n  '#ef4444', // Red\n  '#3b82f6', // Blue\n  '#ec4899', // Pink\n  '#14b8a6', // Teal\n  '#f97316', // Orange\n  '#84cc16', // Lime\n  '#a855f7', // Purple\n  '#06b6d4', // Cyan\n];\n\n/** Well-known node types → fixed colors for visual consistency */\nconst KNOWN: Record<string, string> = {\n  Repository: '#10b981',\n  Class: '#3b82f6',\n  Function: '#a855f7',\n  File: '#84cc16',\n  Directory: '#22d3ee',\n};\n\nfunction djb2(str: string): number {\n  let h = 5381;\n  for (let i = 0; i < str.length; i++) {\n    h = ((h << 5) + h + str.charCodeAt(i)) | 0;\n  }\n  return Math.abs(h);\n}\n\nexport function getNodeColor(type: string): string {\n  return KNOWN[type] ?? PALETTE[djb2(type) % PALETTE.length];\n}\n","/*\n * Copyright 2026 OpenTrace Contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Deterministic color assignment for relationship (link) types.\n * Follows the same pattern as nodeColors.ts — fixed palette with\n * DJB2 hash fallback for unknown types.\n */\n\nconst PALETTE = [\n  '#f472b6', // Pink\n  '#60a5fa', // Blue\n  '#34d399', // Emerald\n  '#fbbf24', // Amber\n  '#a78bfa', // Violet\n  '#fb923c', // Orange\n  '#2dd4bf', // Teal\n  '#f87171', // Red\n  '#38bdf8', // Sky\n  '#a3e635', // Lime\n  '#c084fc', // Purple\n  '#22d3ee', // Cyan\n];\n\n/** Well-known relationship types → fixed colors */\nconst KNOWN: Record<string, string> = {\n  CALLS: '#60a5fa', // Blue — invocation / dependency chains\n  READS: '#fbbf24', // Amber — data access\n  WRITES: '#fb923c', // Orange — data mutation\n  DEFINED_IN: '#34d399', // Emerald — containment / location\n  PART_OF: '#2dd4bf', // Teal — structural membership\n  DEPENDS_ON: '#f472b6', // Pink — dependency edges\n  EXTENDS: '#a78bfa', // Violet — inheritance\n  HANDLES: '#38bdf8', // Sky — endpoint handling\n  IMPORTS: '#c084fc', // Purple — module imports\n  AUTHORED: '#f87171', // Red — authorship\n  ASSIGNED: '#22d3ee', // Cyan — assignment\n  PARTICIPATED: '#a3e635', // Lime — participation\n};\n\nfunction djb2(str: string): number {\n  let h = 5381;\n  for (let i = 0; i < str.length; i++) {\n    h = ((h << 5) + h + str.charCodeAt(i)) | 0;\n  }\n  return Math.abs(h);\n}\n\nexport function getLinkColor(type: string): string {\n  const upper = type.toUpperCase();\n  return KNOWN[upper] ?? PALETTE[djb2(upper) % PALETTE.length];\n}\n","/*\n * Copyright 2026 OpenTrace Contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\n/**\n * Community detection color palette and mapping utilities.\n * Separate from the type palette in nodeColors.ts to avoid confusion when toggling.\n * Uses warm/cool alternation for maximum perceptual distance on dark backgrounds.\n */\n\nconst COMMUNITY_PALETTE = [\n  '#f472b6', // Pink\n  '#38bdf8', // Sky\n  '#fb923c', // Orange\n  '#4ade80', // Green\n  '#c084fc', // Purple\n  '#fbbf24', // Amber\n  '#22d3ee', // Cyan\n  '#f87171', // Red\n  '#a3e635', // Lime\n  '#818cf8', // Indigo\n  '#fb7185', // Rose\n  '#2dd4bf', // Teal\n  '#e879f9', // Fuchsia\n  '#60a5fa', // Blue\n  '#facc15', // Yellow\n  '#34d399', // Emerald\n];\n\nconst FALLBACK_COLOR = '#64748b'; // Slate grey\n\n/**\n * Build a stable community→color mapping, sorted by member count (largest community\n * gets the first palette slot). This ensures the most prominent communities get the\n * most visually distinct colors.\n */\nexport function buildCommunityColorMap(\n  assignments: Record<string, number>,\n): Map<number, string> {\n  // Count members per community\n  const counts = new Map<number, number>();\n  for (const communityId of Object.values(assignments)) {\n    counts.set(communityId, (counts.get(communityId) || 0) + 1);\n  }\n\n  // Sort by count descending\n  const sorted = [...counts.entries()].sort((a, b) => b[1] - a[1]);\n\n  const colorMap = new Map<number, string>();\n  for (let i = 0; i < sorted.length; i++) {\n    colorMap.set(sorted[i][0], COMMUNITY_PALETTE[i % COMMUNITY_PALETTE.length]);\n  }\n  return colorMap;\n}\n\n// Node types that represent structural containers (ordered by priority — most specific first)\nconst CONTAINER_TYPES = ['Package', 'Directory', 'Repository'];\n\ninterface NameableNode {\n  id: string;\n  name: string;\n  type: string;\n}\n\n/**\n * Derive a human-readable name for each community based on its member nodes.\n *\n * Strategy (in priority order):\n * 1. Highest-priority container node (Module > Package > Directory > ...)\n * 2. Longest common path prefix of node names (e.g., \"src/components\")\n * 3. Hub node — the node whose name appears most often as a prefix/substring\n *    in other members' names, or failing that, the shortest-named node\n *    (often the defining class/file of the cluster)\n * 4. Dominant node type + hub qualifier (e.g., \"Functions · handleRequest\")\n *\n * A final dedup pass appends the hub node name to any colliding labels.\n */\nexport function buildCommunityNames(\n  assignments: Record<string, number>,\n  nodes: NameableNode[],\n): Map<number, string> {\n  // Group nodes by community\n  const groups = new Map<number, NameableNode[]>();\n  for (const node of nodes) {\n    const cid = assignments[node.id];\n    if (cid === undefined) continue;\n    let list = groups.get(cid);\n    if (!list) {\n      list = [];\n      groups.set(cid, list);\n    }\n    list.push(node);\n  }\n\n  const names = new Map<number, string>();\n  // Track hub node per community for dedup\n  const hubs = new Map<number, string>();\n\n  for (const [cid, members] of groups) {\n    const hub = findHubNode(members);\n    if (hub) hubs.set(cid, hub);\n\n    // Strategy 1: Find the highest-priority container node\n    let containerName: string | null = null;\n    let bestPriority = CONTAINER_TYPES.length;\n    for (const node of members) {\n      const priority = CONTAINER_TYPES.indexOf(node.type);\n      if (priority !== -1 && priority < bestPriority) {\n        bestPriority = priority;\n        containerName = node.name;\n      }\n    }\n    if (containerName) {\n      names.set(cid, containerName);\n      continue;\n    }\n\n    // Strategy 2: Longest common path prefix\n    const nodeNames = members.map((n) => n.name);\n    const prefix = longestCommonPrefix(nodeNames);\n    if (prefix.length > 0) {\n      // Trim to last path separator for a clean directory-like name\n      const trimmed = prefix.includes('/')\n        ? prefix.slice(0, prefix.lastIndexOf('/') + 1)\n        : prefix.includes('.')\n          ? prefix.slice(0, prefix.lastIndexOf('.') + 1)\n          : prefix;\n      if (trimmed.length > 1) {\n        names.set(cid, trimmed.replace(/\\/$/, ''));\n        continue;\n      }\n    }\n\n    // Strategy 3: Hub node name directly (if it's distinctive enough)\n    if (hub) {\n      names.set(cid, hub);\n      continue;\n    }\n\n    // Strategy 4: Dominant node type (last resort)\n    const typeCounts = new Map<string, number>();\n    for (const node of members) {\n      typeCounts.set(node.type, (typeCounts.get(node.type) || 0) + 1);\n    }\n    let dominantType = 'Nodes';\n    let maxCount = 0;\n    for (const [type, count] of typeCounts) {\n      if (count > maxCount) {\n        maxCount = count;\n        dominantType = type;\n      }\n    }\n    names.set(cid, pluralize(dominantType));\n  }\n\n  // Dedup: guarantee every community name is unique.\n  // Pass 1: append hub qualifier to collisions.\n  // Pass 2: if still colliding, append numeric suffix.\n  dedup(names, hubs);\n\n  return names;\n}\n\n/**\n * Find the most representative node in a community.\n * Picks the node whose name is a prefix/substring of the most other members,\n * breaking ties by shortest name (classes/files tend to be shorter than methods).\n */\nfunction findHubNode(members: NameableNode[]): string | null {\n  if (members.length === 0) return null;\n  if (members.length === 1) return members[0].name;\n\n  // Score each node by how many other members' names contain it as substring\n  const scores: { name: string; score: number; len: number }[] = [];\n  for (const node of members) {\n    const lowerName = node.name.toLowerCase();\n    // Skip very short names (single char, empty) — they'd match everything\n    if (lowerName.length <= 1) continue;\n    let score = 0;\n    for (const other of members) {\n      if (other === node) continue;\n      if (other.name.toLowerCase().includes(lowerName)) score++;\n    }\n    scores.push({ name: node.name, score, len: node.name.length });\n  }\n\n  if (scores.length === 0) {\n    // All names are very short — pick the shortest\n    return members.reduce((a, b) => (a.name.length <= b.name.length ? a : b))\n      .name;\n  }\n\n  // Sort by: highest score, then shortest name\n  scores.sort((a, b) => b.score - a.score || a.len - b.len);\n\n  return scores[0].name;\n}\n\n/** Mutates `names` until every value is unique. */\nfunction dedup(names: Map<number, string>, hubs: Map<number, string>): void {\n  // Collect collisions\n  const byCid = () => {\n    const map = new Map<string, number[]>();\n    for (const [cid, name] of names) {\n      let list = map.get(name);\n      if (!list) {\n        list = [];\n        map.set(name, list);\n      }\n      list.push(cid);\n    }\n    return map;\n  };\n\n  // Pass 1: append hub qualifier\n  for (const [, cids] of byCid()) {\n    if (cids.length <= 1) continue;\n    for (const cid of cids) {\n      const hub = hubs.get(cid);\n      const current = names.get(cid)!;\n      if (hub && hub !== current && !current.includes(hub)) {\n        names.set(cid, `${current} · ${hub}`);\n      }\n    }\n  }\n\n  // Pass 2: if still colliding, append numeric suffix\n  for (const [, cids] of byCid()) {\n    if (cids.length <= 1) continue;\n    for (let i = 0; i < cids.length; i++) {\n      const cid = cids[i];\n      names.set(cid, `${names.get(cid)!} (${i + 1})`);\n    }\n  }\n}\n\nfunction longestCommonPrefix(strings: string[]): string {\n  if (strings.length === 0) return '';\n  if (strings.length === 1) return strings[0];\n  let prefix = strings[0];\n  for (let i = 1; i < strings.length; i++) {\n    while (!strings[i].startsWith(prefix)) {\n      prefix = prefix.slice(0, -1);\n      if (prefix.length === 0) return '';\n    }\n  }\n  return prefix;\n}\n\nfunction pluralize(type: string): string {\n  if (type.endsWith('s')) return type;\n  if (type.endsWith('y')) return type.slice(0, -1) + 'ies';\n  return type + 's';\n}\n\n/**\n * Look up the community color for a given node.\n */\nexport function getCommunityColor(\n  communityAssignments: Record<string, number>,\n  communityColorMap: Map<number, string>,\n  nodeId: string,\n): string {\n  const communityId = communityAssignments[nodeId];\n  if (communityId === undefined) return FALLBACK_COLOR;\n  return communityColorMap.get(communityId) ?? FALLBACK_COLOR;\n}\n","/*\n * Copyright 2026 OpenTrace Contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { useEffect } from 'react';\nimport type Graph from 'graphology';\nimport type { GraphNode, FilterState, GetSubTypeFn } from './types';\n\n// ─── Filter Logic ───────────────────────────────────────────────────────\n\n/**\n * Determine whether a node should be hidden based on the current filter state.\n * Exported so it can be reused by other components.\n */\nexport function shouldHideNode(\n  node: GraphNode,\n  filterState: FilterState,\n  communityAssignments: Record<string, number>,\n  availableSubTypes: Map<string, { subType: string; count: number }[]>,\n  getSubType: GetSubTypeFn,\n): boolean {\n  // Community filter\n  const communityId = communityAssignments[node.id];\n  if (\n    communityId !== undefined &&\n    filterState.hiddenCommunities.has(communityId)\n  ) {\n    return true;\n  }\n\n  // Sub-type filter: only applies when the node type has sub-types\n  const subTypes = availableSubTypes.get(node.type);\n  if (subTypes && subTypes.length > 0) {\n    const subType = getSubType(node);\n    if (subType && filterState.hiddenSubTypes.has(`${node.type}:${subType}`)) {\n      return true;\n    }\n  }\n\n  // Type filter\n  if (filterState.hiddenNodeTypes.has(node.type)) {\n    return true;\n  }\n\n  return false;\n}\n\n// ─── Hook ───────────────────────────────────────────────────────────────\n\n/**\n * Sets `hidden` attribute on nodes/edges based on filter state.\n * Never touches x/y positions.\n */\nexport function useGraphFilters(\n  graph: Graph,\n  layoutReady: boolean,\n  filterState: FilterState,\n  communityAssignments: Record<string, number>,\n  availableSubTypes: Map<string, { subType: string; count: number }[]>,\n  getSubType: GetSubTypeFn,\n): void {\n  useEffect(() => {\n    if (!layoutReady || graph.order === 0) return;\n\n    // Track which nodes are hidden so we can hide their edges too\n    const hiddenNodes = new Set<string>();\n\n    // Batched node update — single event\n    graph.updateEachNodeAttributes((id, attrs) => {\n      const graphNode = attrs._graphNode as GraphNode | undefined;\n      if (!graphNode) return attrs;\n\n      const hidden = shouldHideNode(\n        graphNode,\n        filterState,\n        communityAssignments,\n        availableSubTypes,\n        getSubType,\n      );\n\n      if (hidden) hiddenNodes.add(id);\n      attrs.hidden = hidden;\n      return attrs;\n    });\n\n    // Batched edge update — single event\n    graph.updateEachEdgeAttributes((_id, attrs, source, target) => {\n      // Hide edge if either endpoint is hidden\n      if (hiddenNodes.has(source) || hiddenNodes.has(target)) {\n        attrs.hidden = true;\n        return attrs;\n      }\n\n      // Hide edge if its link type is hidden\n      const label = attrs.label as string | undefined;\n      if (label && filterState.hiddenLinkTypes.has(label)) {\n        attrs.hidden = true;\n        return attrs;\n      }\n\n      attrs.hidden = false;\n      return attrs;\n    });\n  }, [\n    graph,\n    layoutReady,\n    filterState,\n    communityAssignments,\n    availableSubTypes,\n    getSubType,\n  ]);\n}\n","/**\n * Graphology Defaults\n * ====================\n *\n * Helper function used throughout the standard lib to resolve defaults.\n */\nfunction isLeaf(o) {\n  return (\n    !o ||\n    typeof o !== 'object' ||\n    typeof o === 'function' ||\n    Array.isArray(o) ||\n    o instanceof Set ||\n    o instanceof Map ||\n    o instanceof RegExp ||\n    o instanceof Date\n  );\n}\n\nfunction resolveDefaults(target, defaults) {\n  target = target || {};\n\n  var output = {};\n\n  for (var k in defaults) {\n    var existing = target[k];\n    var def = defaults[k];\n\n    // Recursion\n    if (!isLeaf(def)) {\n      output[k] = resolveDefaults(existing, def);\n\n      continue;\n    }\n\n    // Leaf\n    if (existing === undefined) {\n      output[k] = def;\n    } else {\n      output[k] = existing;\n    }\n  }\n\n  return output;\n}\n\nmodule.exports = resolveDefaults;\n","/**\n * Graphology inferType\n * =====================\n *\n * Useful function used to \"guess\" the real type of the given Graph using\n * introspection.\n */\nvar isGraph = require('./is-graph.js');\n\n/**\n * Returning the inferred type of the given graph.\n *\n * @param  {Graph}   graph - Target graph.\n * @return {boolean}\n */\nmodule.exports = function inferType(graph) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-utils/infer-type: expecting a valid graphology instance.'\n    );\n\n  var declaredType = graph.type;\n\n  if (declaredType !== 'mixed') return declaredType;\n\n  if (\n    (graph.directedSize === 0 && graph.undirectedSize === 0) ||\n    (graph.directedSize > 0 && graph.undirectedSize > 0)\n  )\n    return 'mixed';\n\n  if (graph.directedSize > 0) return 'directed';\n\n  return 'undirected';\n};\n","/**\n * Obliterator Iterator Class\n * ===========================\n *\n * Simple class representing the library's iterators.\n */\n\n/**\n * Iterator class.\n *\n * @constructor\n * @param {function} next - Next function.\n */\nfunction Iterator(next) {\n  if (typeof next !== 'function')\n    throw new Error('obliterator/iterator: expecting a function!');\n\n  this.next = next;\n}\n\n/**\n * If symbols are supported, we add `next` to `Symbol.iterator`.\n */\nif (typeof Symbol !== 'undefined')\n  Iterator.prototype[Symbol.iterator] = function () {\n    return this;\n  };\n\n/**\n * Returning an iterator of the given values.\n *\n * @param  {any...} values - Values.\n * @return {Iterator}\n */\nIterator.of = function () {\n  var args = arguments,\n    l = args.length,\n    i = 0;\n\n  return new Iterator(function () {\n    if (i >= l) return {done: true};\n\n    return {done: false, value: args[i++]};\n  });\n};\n\n/**\n * Returning an empty iterator.\n *\n * @return {Iterator}\n */\nIterator.empty = function () {\n  var iterator = new Iterator(function () {\n    return {done: true};\n  });\n\n  return iterator;\n};\n\n/**\n * Returning an iterator over the given indexed sequence.\n *\n * @param  {string|Array} sequence - Target sequence.\n * @return {Iterator}\n */\nIterator.fromSequence = function (sequence) {\n  var i = 0,\n    l = sequence.length;\n\n  return new Iterator(function () {\n    if (i >= l) return {done: true};\n\n    return {done: false, value: sequence[i++]};\n  });\n};\n\n/**\n * Returning whether the given value is an iterator.\n *\n * @param  {any} value - Value.\n * @return {boolean}\n */\nIterator.is = function (value) {\n  if (value instanceof Iterator) return true;\n\n  return (\n    typeof value === 'object' &&\n    value !== null &&\n    typeof value.next === 'function'\n  );\n};\n\n/**\n * Exporting.\n */\nmodule.exports = Iterator;\n","/**\n * Mnemonist Typed Array Helpers\n * ==============================\n *\n * Miscellaneous helpers related to typed arrays.\n */\n\n/**\n * When using an unsigned integer array to store pointers, one might want to\n * choose the optimal word size in regards to the actual numbers of pointers\n * to store.\n *\n * This helpers does just that.\n *\n * @param  {number} size - Expected size of the array to map.\n * @return {TypedArray}\n */\nvar MAX_8BIT_INTEGER = Math.pow(2, 8) - 1,\n    MAX_16BIT_INTEGER = Math.pow(2, 16) - 1,\n    MAX_32BIT_INTEGER = Math.pow(2, 32) - 1;\n\nvar MAX_SIGNED_8BIT_INTEGER = Math.pow(2, 7) - 1,\n    MAX_SIGNED_16BIT_INTEGER = Math.pow(2, 15) - 1,\n    MAX_SIGNED_32BIT_INTEGER = Math.pow(2, 31) - 1;\n\nexports.getPointerArray = function(size) {\n  var maxIndex = size - 1;\n\n  if (maxIndex <= MAX_8BIT_INTEGER)\n    return Uint8Array;\n\n  if (maxIndex <= MAX_16BIT_INTEGER)\n    return Uint16Array;\n\n  if (maxIndex <= MAX_32BIT_INTEGER)\n    return Uint32Array;\n\n  throw new Error('mnemonist: Pointer Array of size > 4294967295 is not supported.');\n};\n\nexports.getSignedPointerArray = function(size) {\n  var maxIndex = size - 1;\n\n  if (maxIndex <= MAX_SIGNED_8BIT_INTEGER)\n    return Int8Array;\n\n  if (maxIndex <= MAX_SIGNED_16BIT_INTEGER)\n    return Int16Array;\n\n  if (maxIndex <= MAX_SIGNED_32BIT_INTEGER)\n    return Int32Array;\n\n  return Float64Array;\n};\n\n/**\n * Function returning the minimal type able to represent the given number.\n *\n * @param  {number} value - Value to test.\n * @return {TypedArrayClass}\n */\nexports.getNumberType = function(value) {\n\n  // <= 32 bits itnteger?\n  if (value === (value | 0)) {\n\n    // Negative\n    if (Math.sign(value) === -1) {\n      if (value <= 127 && value >= -128)\n        return Int8Array;\n\n      if (value <= 32767 && value >= -32768)\n        return Int16Array;\n\n      return Int32Array;\n    }\n    else {\n\n      if (value <= 255)\n        return Uint8Array;\n\n      if (value <= 65535)\n        return Uint16Array;\n\n      return Uint32Array;\n    }\n  }\n\n  // 53 bits integer & floats\n  // NOTE: it's kinda hard to tell whether we could use 32bits or not...\n  return Float64Array;\n};\n\n/**\n * Function returning the minimal type able to represent the given array\n * of JavaScript numbers.\n *\n * @param  {array}    array  - Array to represent.\n * @param  {function} getter - Optional getter.\n * @return {TypedArrayClass}\n */\nvar TYPE_PRIORITY = {\n  Uint8Array: 1,\n  Int8Array: 2,\n  Uint16Array: 3,\n  Int16Array: 4,\n  Uint32Array: 5,\n  Int32Array: 6,\n  Float32Array: 7,\n  Float64Array: 8\n};\n\n// TODO: make this a one-shot for one value\nexports.getMinimalRepresentation = function(array, getter) {\n  var maxType = null,\n      maxPriority = 0,\n      p,\n      t,\n      v,\n      i,\n      l;\n\n  for (i = 0, l = array.length; i < l; i++) {\n    v = getter ? getter(array[i]) : array[i];\n    t = exports.getNumberType(v);\n    p = TYPE_PRIORITY[t.name];\n\n    if (p > maxPriority) {\n      maxPriority = p;\n      maxType = t;\n    }\n  }\n\n  return maxType;\n};\n\n/**\n * Function returning whether the given value is a typed array.\n *\n * @param  {any} value - Value to test.\n * @return {boolean}\n */\nexports.isTypedArray = function(value) {\n  return typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView(value);\n};\n\n/**\n * Function used to concat byte arrays.\n *\n * @param  {...ByteArray}\n * @return {ByteArray}\n */\nexports.concat = function() {\n  var length = 0,\n      i,\n      o,\n      l;\n\n  for (i = 0, l = arguments.length; i < l; i++)\n    length += arguments[i].length;\n\n  var array = new (arguments[0].constructor)(length);\n\n  for (i = 0, o = 0; i < l; i++) {\n    array.set(arguments[i], o);\n    o += arguments[i].length;\n  }\n\n  return array;\n};\n\n/**\n * Function used to initialize a byte array of indices.\n *\n * @param  {number}    length - Length of target.\n * @return {ByteArray}\n */\nexports.indices = function(length) {\n  var PointerArray = exports.getPointerArray(length);\n\n  var array = new PointerArray(length);\n\n  for (var i = 0; i < length; i++)\n    array[i] = i;\n\n  return array;\n};\n","/**\n * Mnemonist SparseMap\n * ====================\n *\n * JavaScript sparse map implemented on top of byte arrays.\n *\n * [Reference]: https://research.swtch.com/sparse\n */\nvar Iterator = require('obliterator/iterator'),\n    getPointerArray = require('./utils/typed-arrays.js').getPointerArray;\n\n/**\n * SparseMap.\n *\n * @constructor\n */\nfunction SparseMap(Values, length) {\n  if (arguments.length < 2) {\n    length = Values;\n    Values = Array;\n  }\n\n  var ByteArray = getPointerArray(length);\n\n  // Properties\n  this.size = 0;\n  this.length = length;\n  this.dense = new ByteArray(length);\n  this.sparse = new ByteArray(length);\n  this.vals = new Values(length);\n}\n\n/**\n * Method used to clear the structure.\n *\n * @return {undefined}\n */\nSparseMap.prototype.clear = function() {\n  this.size = 0;\n};\n\n/**\n * Method used to check the existence of a member in the set.\n *\n * @param  {number} member - Member to test.\n * @return {SparseMap}\n */\nSparseMap.prototype.has = function(member) {\n  var index = this.sparse[member];\n\n  return (\n    index < this.size &&\n    this.dense[index] === member\n  );\n};\n\n/**\n * Method used to get the value associated to a member in the set.\n *\n * @param  {number} member - Member to test.\n * @return {any}\n */\nSparseMap.prototype.get = function(member) {\n  var index = this.sparse[member];\n\n  if (index < this.size && this.dense[index] === member)\n    return this.vals[index];\n\n  return;\n};\n\n/**\n * Method used to set a value into the map.\n *\n * @param  {number} member - Member to set.\n * @param  {any}    value  - Associated value.\n * @return {SparseMap}\n */\nSparseMap.prototype.set = function(member, value) {\n  var index = this.sparse[member];\n\n  if (index < this.size && this.dense[index] === member) {\n    this.vals[index] = value;\n    return this;\n  }\n\n  this.dense[this.size] = member;\n  this.sparse[member] = this.size;\n  this.vals[this.size] = value;\n  this.size++;\n\n  return this;\n};\n\n/**\n * Method used to remove a member from the set.\n *\n * @param  {number} member - Member to delete.\n * @return {boolean}\n */\nSparseMap.prototype.delete = function(member) {\n  var index = this.sparse[member];\n\n  if (index >= this.size || this.dense[index] !== member)\n    return false;\n\n  index = this.dense[this.size - 1];\n  this.dense[this.sparse[member]] = index;\n  this.sparse[index] = this.sparse[member];\n  this.size--;\n\n  return true;\n};\n\n/**\n * Method used to iterate over the set's values.\n *\n * @param  {function}  callback - Function to call for each item.\n * @param  {object}    scope    - Optional scope.\n * @return {undefined}\n */\nSparseMap.prototype.forEach = function(callback, scope) {\n  scope = arguments.length > 1 ? scope : this;\n\n  for (var i = 0; i < this.size; i++)\n    callback.call(scope, this.vals[i], this.dense[i]);\n};\n\n/**\n * Method used to create an iterator over a set's members.\n *\n * @return {Iterator}\n */\nSparseMap.prototype.keys = function() {\n  var size = this.size,\n      dense = this.dense,\n      i = 0;\n\n  return new Iterator(function() {\n    if (i < size) {\n      var item = dense[i];\n      i++;\n\n      return {\n        value: item\n      };\n    }\n\n    return {\n      done: true\n    };\n  });\n};\n\n/**\n * Method used to create an iterator over a set's values.\n *\n * @return {Iterator}\n */\nSparseMap.prototype.values = function() {\n  var size = this.size,\n      values = this.vals,\n      i = 0;\n\n  return new Iterator(function() {\n    if (i < size) {\n      var item = values[i];\n      i++;\n\n      return {\n        value: item\n      };\n    }\n\n    return {\n      done: true\n    };\n  });\n};\n\n/**\n * Method used to create an iterator over a set's entries.\n *\n * @return {Iterator}\n */\nSparseMap.prototype.entries = function() {\n  var size = this.size,\n      dense = this.dense,\n      values = this.vals,\n      i = 0;\n\n  return new Iterator(function() {\n    if (i < size) {\n      var item = [dense[i], values[i]];\n      i++;\n\n      return {\n        value: item\n      };\n    }\n\n    return {\n      done: true\n    };\n  });\n};\n\n/**\n * Attaching the #.entries method to Symbol.iterator if possible.\n */\nif (typeof Symbol !== 'undefined')\n  SparseMap.prototype[Symbol.iterator] = SparseMap.prototype.entries;\n\n/**\n * Convenience known methods.\n */\nSparseMap.prototype.inspect = function() {\n  var proxy = new Map();\n\n  for (var i = 0; i < this.size; i++)\n    proxy.set(this.dense[i], this.vals[i]);\n\n  // Trick so that node displays the name of the constructor\n  Object.defineProperty(proxy, 'constructor', {\n    value: SparseMap,\n    enumerable: false\n  });\n\n  proxy.length = this.length;\n\n  if (this.vals.constructor !== Array)\n    proxy.type = this.vals.constructor.name;\n\n  return proxy;\n};\n\nif (typeof Symbol !== 'undefined')\n  SparseMap.prototype[Symbol.for('nodejs.util.inspect.custom')] = SparseMap.prototype.inspect;\n\n/**\n * Exporting.\n */\nmodule.exports = SparseMap;\n","/**\n * Mnemonist SparseQueueSet\n * =========================\n *\n * JavaScript sparse queue set implemented on top of byte arrays.\n *\n * [Reference]: https://research.swtch.com/sparse\n */\nvar Iterator = require('obliterator/iterator'),\n    getPointerArray = require('./utils/typed-arrays.js').getPointerArray;\n\n/**\n * SparseQueueSet.\n *\n * @constructor\n */\nfunction SparseQueueSet(capacity) {\n\n  var ByteArray = getPointerArray(capacity);\n\n  // Properties\n  this.start = 0;\n  this.size = 0;\n  this.capacity = capacity;\n  this.dense = new ByteArray(capacity);\n  this.sparse = new ByteArray(capacity);\n}\n\n/**\n * Method used to clear the structure.\n *\n * @return {undefined}\n */\nSparseQueueSet.prototype.clear = function() {\n  this.start = 0;\n  this.size = 0;\n};\n\n/**\n * Method used to check the existence of a member in the queue.\n *\n * @param  {number} member - Member to test.\n * @return {SparseQueueSet}\n */\nSparseQueueSet.prototype.has = function(member) {\n  if (this.size === 0)\n    return false;\n\n  var index = this.sparse[member];\n\n  var inBounds = (\n    index < this.capacity &&\n    (\n      index >= this.start &&\n      index < this.start + this.size\n    ) ||\n    (\n      index < ((this.start + this.size) % this.capacity)\n    )\n  );\n\n  return (\n    inBounds &&\n    this.dense[index] === member\n  );\n};\n\n/**\n * Method used to add a member to the queue.\n *\n * @param  {number} member - Member to add.\n * @return {SparseQueueSet}\n */\nSparseQueueSet.prototype.enqueue = function(member) {\n  var index = this.sparse[member];\n\n  if (this.size !== 0) {\n    var inBounds = (\n      index < this.capacity &&\n      (\n        index >= this.start &&\n        index < this.start + this.size\n      ) ||\n      (\n        index < ((this.start + this.size) % this.capacity)\n      )\n    );\n\n    if (inBounds && this.dense[index] === member)\n      return this;\n  }\n\n  index = (this.start + this.size) % this.capacity;\n\n  this.dense[index] = member;\n  this.sparse[member] = index;\n  this.size++;\n\n  return this;\n};\n\n/**\n * Method used to remove the next member from the queue.\n *\n * @param  {number} member - Member to delete.\n * @return {boolean}\n */\nSparseQueueSet.prototype.dequeue = function() {\n  if (this.size === 0)\n    return;\n\n  var index = this.start;\n\n  this.size--;\n  this.start++;\n\n  if (this.start === this.capacity)\n    this.start = 0;\n\n  var member = this.dense[index];\n\n  this.sparse[member] = this.capacity;\n\n  return member;\n};\n\n/**\n * Method used to iterate over the queue's values.\n *\n * @param  {function}  callback - Function to call for each item.\n * @param  {object}    scope    - Optional scope.\n * @return {undefined}\n */\nSparseQueueSet.prototype.forEach = function(callback, scope) {\n  scope = arguments.length > 1 ? scope : this;\n\n  var c = this.capacity,\n      l = this.size,\n      i = this.start,\n      j = 0;\n\n  while (j < l) {\n    callback.call(scope, this.dense[i], j, this);\n    i++;\n    j++;\n\n    if (i === c)\n      i = 0;\n  }\n};\n\n/**\n * Method used to create an iterator over a set's values.\n *\n * @return {Iterator}\n */\nSparseQueueSet.prototype.values = function() {\n  var dense = this.dense,\n      c = this.capacity,\n      l = this.size,\n      i = this.start,\n      j = 0;\n\n  return new Iterator(function() {\n    if (j >= l)\n      return {\n        done: true\n      };\n\n    var value = dense[i];\n\n    i++;\n    j++;\n\n    if (i === c)\n      i = 0;\n\n    return {\n      value: value,\n      done: false\n    };\n  });\n};\n\n/**\n * Attaching the #.values method to Symbol.iterator if possible.\n */\nif (typeof Symbol !== 'undefined')\n  SparseQueueSet.prototype[Symbol.iterator] = SparseQueueSet.prototype.values;\n\n/**\n * Convenience known methods.\n */\nSparseQueueSet.prototype.inspect = function() {\n  var proxy = [];\n\n  this.forEach(function(member) {\n    proxy.push(member);\n  });\n\n  // Trick so that node displays the name of the constructor\n  Object.defineProperty(proxy, 'constructor', {\n    value: SparseQueueSet,\n    enumerable: false\n  });\n\n  proxy.capacity = this.capacity;\n\n  return proxy;\n};\n\nif (typeof Symbol !== 'undefined')\n  SparseQueueSet.prototype[Symbol.for('nodejs.util.inspect.custom')] = SparseQueueSet.prototype.inspect;\n\n/**\n * Exporting.\n */\nmodule.exports = SparseQueueSet;\n","/**\n * Pandemonium Random Index\n * =========================\n *\n * Random index function.\n */\n\n/**\n * Creating a function returning a random index from the given array.\n *\n * @param  {function} rng - RNG function returning uniform random.\n * @return {function}     - The created function.\n */\nfunction createRandomIndex(rng) {\n  /**\n   * Random function.\n   *\n   * @param  {array|number}  array - Target array or length of the array.\n   * @return {number}\n   */\n  return function (length) {\n    if (typeof length !== 'number') length = length.length;\n\n    return Math.floor(rng() * length);\n  };\n}\n\n/**\n * Default random index using `Math.random`.\n */\nvar randomIndex = createRandomIndex(Math.random);\n\n/**\n * Exporting.\n */\nrandomIndex.createRandomIndex = createRandomIndex;\nmodule.exports = randomIndex;\n","/**\n * Graphology Weight Getter\n * =========================\n *\n * Function creating weight getters.\n */\nfunction coerceWeight(value) {\n  // Ensuring target value is a correct number\n  if (typeof value !== 'number' || isNaN(value)) return 1;\n\n  return value;\n}\n\nfunction createNodeValueGetter(nameOrFunction, defaultValue) {\n  var getter = {};\n\n  var coerceToDefault = function (v) {\n    if (typeof v === 'undefined') return defaultValue;\n\n    return v;\n  };\n\n  if (typeof defaultValue === 'function') coerceToDefault = defaultValue;\n\n  var get = function (attributes) {\n    return coerceToDefault(attributes[nameOrFunction]);\n  };\n\n  var returnDefault = function () {\n    return coerceToDefault(undefined);\n  };\n\n  if (typeof nameOrFunction === 'string') {\n    getter.fromAttributes = get;\n    getter.fromGraph = function (graph, node) {\n      return get(graph.getNodeAttributes(node));\n    };\n    getter.fromEntry = function (node, attributes) {\n      return get(attributes);\n    };\n  } else if (typeof nameOrFunction === 'function') {\n    getter.fromAttributes = function () {\n      throw new Error(\n        'graphology-utils/getters/createNodeValueGetter: irrelevant usage.'\n      );\n    };\n    getter.fromGraph = function (graph, node) {\n      return coerceToDefault(\n        nameOrFunction(node, graph.getNodeAttributes(node))\n      );\n    };\n    getter.fromEntry = function (node, attributes) {\n      return coerceToDefault(nameOrFunction(node, attributes));\n    };\n  } else {\n    getter.fromAttributes = returnDefault;\n    getter.fromGraph = returnDefault;\n    getter.fromEntry = returnDefault;\n  }\n\n  return getter;\n}\n\nfunction createEdgeValueGetter(nameOrFunction, defaultValue) {\n  var getter = {};\n\n  var coerceToDefault = function (v) {\n    if (typeof v === 'undefined') return defaultValue;\n\n    return v;\n  };\n\n  if (typeof defaultValue === 'function') coerceToDefault = defaultValue;\n\n  var get = function (attributes) {\n    return coerceToDefault(attributes[nameOrFunction]);\n  };\n\n  var returnDefault = function () {\n    return coerceToDefault(undefined);\n  };\n\n  if (typeof nameOrFunction === 'string') {\n    getter.fromAttributes = get;\n    getter.fromGraph = function (graph, edge) {\n      return get(graph.getEdgeAttributes(edge));\n    };\n    getter.fromEntry = function (edge, attributes) {\n      return get(attributes);\n    };\n    getter.fromPartialEntry = getter.fromEntry;\n    getter.fromMinimalEntry = getter.fromEntry;\n  } else if (typeof nameOrFunction === 'function') {\n    getter.fromAttributes = function () {\n      throw new Error(\n        'graphology-utils/getters/createEdgeValueGetter: irrelevant usage.'\n      );\n    };\n    getter.fromGraph = function (graph, edge) {\n      // TODO: we can do better, check #310\n      var extremities = graph.extremities(edge);\n      return coerceToDefault(\n        nameOrFunction(\n          edge,\n          graph.getEdgeAttributes(edge),\n          extremities[0],\n          extremities[1],\n          graph.getNodeAttributes(extremities[0]),\n          graph.getNodeAttributes(extremities[1]),\n          graph.isUndirected(edge)\n        )\n      );\n    };\n    getter.fromEntry = function (e, a, s, t, sa, ta, u) {\n      return coerceToDefault(nameOrFunction(e, a, s, t, sa, ta, u));\n    };\n    getter.fromPartialEntry = function (e, a, s, t) {\n      return coerceToDefault(nameOrFunction(e, a, s, t));\n    };\n    getter.fromMinimalEntry = function (e, a) {\n      return coerceToDefault(nameOrFunction(e, a));\n    };\n  } else {\n    getter.fromAttributes = returnDefault;\n    getter.fromGraph = returnDefault;\n    getter.fromEntry = returnDefault;\n    getter.fromMinimalEntry = returnDefault;\n  }\n\n  return getter;\n}\n\nexports.createNodeValueGetter = createNodeValueGetter;\nexports.createEdgeValueGetter = createEdgeValueGetter;\nexports.createEdgeWeightGetter = function (name) {\n  return createEdgeValueGetter(name, coerceWeight);\n};\n","/**\n * Graphology Louvain Indices\n * ===========================\n *\n * Undirected & Directed Louvain Index structures used to compute the famous\n * Louvain community detection algorithm.\n *\n * Most of the rationale is explained in `graphology-metrics`.\n *\n * Note that this index shares a lot with the classic Union-Find data\n * structure. It also relies on a unused id stack to make sure we can\n * increase again the number of communites when isolating nodes.\n *\n * [Articles]\n * M. E. J. Newman, « Modularity and community structure in networks »,\n * Proc. Natl. Acad. Sci. USA, vol. 103, no 23, 2006, p. 8577–8582\n * https://dx.doi.org/10.1073%2Fpnas.0601602103\n *\n * Newman, M. E. J. « Community detection in networks: Modularity optimization\n * and maximum likelihood are equivalent ». Physical Review E, vol. 94, no 5,\n * novembre 2016, p. 052315. arXiv.org, doi:10.1103/PhysRevE.94.052315.\n * https://arxiv.org/pdf/1606.02319.pdf\n *\n * Blondel, Vincent D., et al. « Fast unfolding of communities in large\n * networks ». Journal of Statistical Mechanics: Theory and Experiment,\n * vol. 2008, no 10, octobre 2008, p. P10008. DOI.org (Crossref),\n * doi:10.1088/1742-5468/2008/10/P10008.\n * https://arxiv.org/pdf/0803.0476.pdf\n *\n * Nicolas Dugué, Anthony Perez. Directed Louvain: maximizing modularity in\n * directed networks. [Research Report] Université d’Orléans. 2015. hal-01231784\n * https://hal.archives-ouvertes.fr/hal-01231784\n *\n * R. Lambiotte, J.-C. Delvenne and M. Barahona. Laplacian Dynamics and\n * Multiscale Modular Structure in Networks,\n * doi:10.1109/TNSE.2015.2391998.\n * https://arxiv.org/abs/0812.1770\n *\n * [Latex]:\n *\n * Undirected Case:\n * ----------------\n *\n * \\Delta Q=\\bigg{[}\\frac{\\sum^{c}_{in}-(2d_{c}+l)}{2m}-\\bigg{(}\\frac{\\sum^{c}_{tot}-(d+l)}{2m}\\bigg{)}^{2}+\\frac{\\sum^{t}_{in}+(2d_{t}+l)}{2m}-\\bigg{(}\\frac{\\sum^{t}_{tot}+(d+l)}{2m}\\bigg{)}^{2}\\bigg{]}-\\bigg{[}\\frac{\\sum^{c}_{in}}{2m}-\\bigg{(}\\frac{\\sum^{c}_{tot}}{2m}\\bigg{)}^{2}+\\frac{\\sum^{t}_{in}}{2m}-\\bigg{(}\\frac{\\sum^{t}_{tot}}{2m}\\bigg{)}^{2}\\bigg{]}\n * \\Delta Q=\\frac{d_{t}-d_{c}}{m}+\\frac{l\\sum^{c}_{tot}+d\\sum^{c}_{tot}-d^{2}-l^{2}-2dl-l\\sum^{t}_{tot}-d\\sum^{t}_{tot}}{2m^{2}}\n * \\Delta Q=\\frac{d_{t}-d_{c}}{m}+\\frac{(l+d)\\sum^{c}_{tot}-d^{2}-l^{2}-2dl-(l+d)\\sum^{t}_{tot}}{2m^{2}}\n *\n * Directed Case:\n * --------------\n * \\Delta Q_d=\\bigg{[}\\frac{\\sum^{c}_{in}-(d_{c.in}+d_{c.out}+l)}{m}-\\frac{(\\sum^{c}_{tot.in}-(d_{in}+l))(\\sum^{c}_{tot.out}-(d_{out}+l))}{m^{2}}+\\frac{\\sum^{t}_{in}+(d_{t.in}+d_{t.out}+l)}{m}-\\frac{(\\sum^{t}_{tot.in}+(d_{in}+l))(\\sum^{t}_{tot.out}+(d_{out}+l))}{m^{2}}\\bigg{]}-\\bigg{[}\\frac{\\sum^{c}_{in}}{m}-\\frac{\\sum^{c}_{tot.in}\\sum^{c}_{tot.out}}{m^{2}}+\\frac{\\sum^{t}_{in}}{m}-\\frac{\\sum^{t}_{tot.in}\\sum^{t}_{tot.out}}{m^{2}}\\bigg{]}\n *\n * [Notes]:\n * Louvain is a bit unclear on this but delta computation are not derived from\n * Q1 - Q2 but rather between Q when considered node is isolated in its own\n * community versus Q with this node in target community. This is in fact\n * an optimization because the subtract part is constant in the formulae and\n * does not affect delta comparisons.\n */\nvar typed = require('mnemonist/utils/typed-arrays');\nvar resolveDefaults = require('graphology-utils/defaults');\nvar createEdgeWeightGetter =\n  require('graphology-utils/getters').createEdgeWeightGetter;\n\nvar INSPECT = Symbol.for('nodejs.util.inspect.custom');\n\nvar DEFAULTS = {\n  getEdgeWeight: 'weight',\n  keepDendrogram: false,\n  resolution: 1\n};\n\nfunction UndirectedLouvainIndex(graph, options) {\n  // Solving options\n  options = resolveDefaults(options, DEFAULTS);\n\n  var resolution = options.resolution;\n\n  // Weight getters\n  var getEdgeWeight = createEdgeWeightGetter(options.getEdgeWeight).fromEntry;\n\n  // Building the index\n  var size = (graph.size - graph.selfLoopCount) * 2;\n\n  var NeighborhoodPointerArray = typed.getPointerArray(size);\n  var NodesPointerArray = typed.getPointerArray(graph.order + 1);\n\n  // NOTE: this memory optimization can yield overflow deopt when computing deltas\n  var WeightsArray = options.getEdgeWeight\n    ? Float64Array\n    : typed.getPointerArray(graph.size * 2);\n\n  // Properties\n  this.C = graph.order;\n  this.M = 0;\n  this.E = size;\n  this.U = 0;\n  this.resolution = resolution;\n  this.level = 0;\n  this.graph = graph;\n  this.nodes = new Array(graph.order);\n  this.keepDendrogram = options.keepDendrogram;\n\n  // Edge-level\n  this.neighborhood = new NodesPointerArray(size);\n  this.weights = new WeightsArray(size);\n\n  // Node-level\n  this.loops = new WeightsArray(graph.order);\n  this.starts = new NeighborhoodPointerArray(graph.order + 1);\n  this.belongings = new NodesPointerArray(graph.order);\n  this.dendrogram = [];\n  this.mapping = null;\n\n  // Community-level\n  this.counts = new NodesPointerArray(graph.order);\n  this.unused = new NodesPointerArray(graph.order);\n  this.totalWeights = new WeightsArray(graph.order);\n\n  var ids = {};\n\n  var weight;\n\n  var i = 0,\n    n = 0;\n\n  var self = this;\n\n  graph.forEachNode(function (node) {\n    self.nodes[i] = node;\n\n    // Node map to index\n    ids[node] = i;\n\n    // Initializing starts\n    n += graph.undirectedDegreeWithoutSelfLoops(node);\n    self.starts[i] = n;\n\n    // Belongings\n    self.belongings[i] = i;\n    self.counts[i] = 1;\n    i++;\n  });\n\n  // Single sweep over the edges\n  graph.forEachEdge(function (edge, attr, source, target, sa, ta, u) {\n    weight = getEdgeWeight(edge, attr, source, target, sa, ta, u);\n\n    source = ids[source];\n    target = ids[target];\n\n    self.M += weight;\n\n    // Self loop?\n    if (source === target) {\n      self.totalWeights[source] += weight * 2;\n      self.loops[source] = weight * 2;\n    } else {\n      self.totalWeights[source] += weight;\n      self.totalWeights[target] += weight;\n\n      var startSource = --self.starts[source],\n        startTarget = --self.starts[target];\n\n      self.neighborhood[startSource] = target;\n      self.neighborhood[startTarget] = source;\n\n      self.weights[startSource] = weight;\n      self.weights[startTarget] = weight;\n    }\n  });\n\n  this.starts[i] = this.E;\n\n  if (this.keepDendrogram) this.dendrogram.push(this.belongings.slice());\n  else this.mapping = this.belongings.slice();\n}\n\nUndirectedLouvainIndex.prototype.isolate = function (i, degree) {\n  var currentCommunity = this.belongings[i];\n\n  // The node is already isolated\n  if (this.counts[currentCommunity] === 1) return currentCommunity;\n\n  var newCommunity = this.unused[--this.U];\n\n  var loops = this.loops[i];\n\n  this.totalWeights[currentCommunity] -= degree + loops;\n  this.totalWeights[newCommunity] += degree + loops;\n\n  this.belongings[i] = newCommunity;\n\n  this.counts[currentCommunity]--;\n  this.counts[newCommunity]++;\n\n  return newCommunity;\n};\n\nUndirectedLouvainIndex.prototype.move = function (i, degree, targetCommunity) {\n  var currentCommunity = this.belongings[i],\n    loops = this.loops[i];\n\n  this.totalWeights[currentCommunity] -= degree + loops;\n  this.totalWeights[targetCommunity] += degree + loops;\n\n  this.belongings[i] = targetCommunity;\n\n  var nowEmpty = this.counts[currentCommunity]-- === 1;\n  this.counts[targetCommunity]++;\n\n  if (nowEmpty) this.unused[this.U++] = currentCommunity;\n};\n\nUndirectedLouvainIndex.prototype.computeNodeDegree = function (i) {\n  var o, l, weight;\n\n  var degree = 0;\n\n  for (o = this.starts[i], l = this.starts[i + 1]; o < l; o++) {\n    weight = this.weights[o];\n\n    degree += weight;\n  }\n\n  return degree;\n};\n\nUndirectedLouvainIndex.prototype.expensiveIsolate = function (i) {\n  var degree = this.computeNodeDegree(i);\n  return this.isolate(i, degree);\n};\n\nUndirectedLouvainIndex.prototype.expensiveMove = function (i, ci) {\n  var degree = this.computeNodeDegree(i);\n  this.move(i, degree, ci);\n};\n\nUndirectedLouvainIndex.prototype.zoomOut = function () {\n  var inducedGraph = new Array(this.C - this.U),\n    newLabels = {};\n\n  var N = this.nodes.length;\n\n  var C = 0,\n    E = 0;\n\n  var i, j, l, m, n, ci, cj, data, adj;\n\n  // Renumbering communities\n  for (i = 0, l = this.C; i < l; i++) {\n    ci = this.belongings[i];\n\n    if (!(ci in newLabels)) {\n      newLabels[ci] = C;\n      inducedGraph[C] = {\n        adj: {},\n        totalWeights: this.totalWeights[ci],\n        internalWeights: 0\n      };\n      C++;\n    }\n\n    // We do this to otpimize the number of lookups in next loop\n    this.belongings[i] = newLabels[ci];\n  }\n\n  // Actualizing dendrogram\n  var currentLevel, nextLevel;\n\n  if (this.keepDendrogram) {\n    currentLevel = this.dendrogram[this.level];\n    nextLevel = new (typed.getPointerArray(C))(N);\n\n    for (i = 0; i < N; i++) nextLevel[i] = this.belongings[currentLevel[i]];\n\n    this.dendrogram.push(nextLevel);\n  } else {\n    for (i = 0; i < N; i++) this.mapping[i] = this.belongings[this.mapping[i]];\n  }\n\n  // Building induced graph matrix\n  for (i = 0, l = this.C; i < l; i++) {\n    ci = this.belongings[i];\n\n    data = inducedGraph[ci];\n    adj = data.adj;\n    data.internalWeights += this.loops[i];\n\n    for (j = this.starts[i], m = this.starts[i + 1]; j < m; j++) {\n      n = this.neighborhood[j];\n      cj = this.belongings[n];\n\n      if (ci === cj) {\n        data.internalWeights += this.weights[j];\n        continue;\n      }\n\n      if (!(cj in adj)) adj[cj] = 0;\n\n      adj[cj] += this.weights[j];\n    }\n  }\n\n  // Rewriting neighborhood\n  this.C = C;\n\n  n = 0;\n\n  for (ci = 0; ci < C; ci++) {\n    data = inducedGraph[ci];\n    adj = data.adj;\n\n    ci = +ci;\n\n    this.totalWeights[ci] = data.totalWeights;\n    this.loops[ci] = data.internalWeights;\n    this.counts[ci] = 1;\n\n    this.starts[ci] = n;\n    this.belongings[ci] = ci;\n\n    for (cj in adj) {\n      this.neighborhood[n] = +cj;\n      this.weights[n] = adj[cj];\n\n      E++;\n      n++;\n    }\n  }\n\n  this.starts[C] = E;\n\n  this.E = E;\n  this.U = 0;\n  this.level++;\n\n  return newLabels;\n};\n\nUndirectedLouvainIndex.prototype.modularity = function () {\n  var ci, cj, i, j, m;\n\n  var Q = 0;\n  var M2 = this.M * 2;\n  var internalWeights = new Float64Array(this.C);\n\n  for (i = 0; i < this.C; i++) {\n    ci = this.belongings[i];\n    internalWeights[ci] += this.loops[i];\n\n    for (j = this.starts[i], m = this.starts[i + 1]; j < m; j++) {\n      cj = this.belongings[this.neighborhood[j]];\n\n      if (ci !== cj) continue;\n\n      internalWeights[ci] += this.weights[j];\n    }\n  }\n\n  for (i = 0; i < this.C; i++) {\n    Q +=\n      internalWeights[i] / M2 -\n      Math.pow(this.totalWeights[i] / M2, 2) * this.resolution;\n  }\n\n  return Q;\n};\n\nUndirectedLouvainIndex.prototype.delta = function (\n  i,\n  degree,\n  targetCommunityDegree,\n  targetCommunity\n) {\n  var M = this.M;\n\n  var targetCommunityTotalWeight = this.totalWeights[targetCommunity];\n\n  degree += this.loops[i];\n\n  return (\n    targetCommunityDegree / M - // NOTE: formula is a bit different here because targetCommunityDegree is passed without * 2\n    (targetCommunityTotalWeight * degree * this.resolution) / (2 * M * M)\n  );\n};\n\nUndirectedLouvainIndex.prototype.deltaWithOwnCommunity = function (\n  i,\n  degree,\n  targetCommunityDegree,\n  targetCommunity\n) {\n  var M = this.M;\n\n  var targetCommunityTotalWeight = this.totalWeights[targetCommunity];\n\n  degree += this.loops[i];\n\n  return (\n    targetCommunityDegree / M - // NOTE: formula is a bit different here because targetCommunityDegree is passed without * 2\n    ((targetCommunityTotalWeight - degree) * degree * this.resolution) /\n      (2 * M * M)\n  );\n};\n\n// NOTE: this is just a faster but equivalent version of #.delta\n// It is just off by a constant factor and is just faster to compute\nUndirectedLouvainIndex.prototype.fastDelta = function (\n  i,\n  degree,\n  targetCommunityDegree,\n  targetCommunity\n) {\n  var M = this.M;\n\n  var targetCommunityTotalWeight = this.totalWeights[targetCommunity];\n\n  degree += this.loops[i];\n\n  return (\n    targetCommunityDegree -\n    (degree * targetCommunityTotalWeight * this.resolution) / (2 * M)\n  );\n};\n\nUndirectedLouvainIndex.prototype.fastDeltaWithOwnCommunity = function (\n  i,\n  degree,\n  targetCommunityDegree,\n  targetCommunity\n) {\n  var M = this.M;\n\n  var targetCommunityTotalWeight = this.totalWeights[targetCommunity];\n\n  degree += this.loops[i];\n\n  return (\n    targetCommunityDegree -\n    (degree * (targetCommunityTotalWeight - degree) * this.resolution) / (2 * M)\n  );\n};\n\nUndirectedLouvainIndex.prototype.bounds = function (i) {\n  return [this.starts[i], this.starts[i + 1]];\n};\n\nUndirectedLouvainIndex.prototype.project = function () {\n  var self = this;\n\n  var projection = {};\n\n  self.nodes.slice(0, this.C).forEach(function (node, i) {\n    projection[node] = Array.from(\n      self.neighborhood.slice(self.starts[i], self.starts[i + 1])\n    ).map(function (j) {\n      return self.nodes[j];\n    });\n  });\n\n  return projection;\n};\n\nUndirectedLouvainIndex.prototype.collect = function (level) {\n  if (arguments.length < 1) level = this.level;\n\n  var o = {};\n\n  var mapping = this.keepDendrogram ? this.dendrogram[level] : this.mapping;\n\n  var i, l;\n\n  for (i = 0, l = mapping.length; i < l; i++) o[this.nodes[i]] = mapping[i];\n\n  return o;\n};\n\nUndirectedLouvainIndex.prototype.assign = function (prop, level) {\n  if (arguments.length < 2) level = this.level;\n\n  var mapping = this.keepDendrogram ? this.dendrogram[level] : this.mapping;\n\n  var i, l;\n\n  for (i = 0, l = mapping.length; i < l; i++)\n    this.graph.setNodeAttribute(this.nodes[i], prop, mapping[i]);\n};\n\nUndirectedLouvainIndex.prototype[INSPECT] = function () {\n  var proxy = {};\n\n  // Trick so that node displays the name of the constructor\n  Object.defineProperty(proxy, 'constructor', {\n    value: UndirectedLouvainIndex,\n    enumerable: false\n  });\n\n  proxy.C = this.C;\n  proxy.M = this.M;\n  proxy.E = this.E;\n  proxy.U = this.U;\n  proxy.resolution = this.resolution;\n  proxy.level = this.level;\n  proxy.nodes = this.nodes;\n  proxy.starts = this.starts.slice(0, proxy.C + 1);\n\n  var eTruncated = ['neighborhood', 'weights'];\n  var cTruncated = ['counts', 'loops', 'belongings', 'totalWeights'];\n\n  var self = this;\n\n  eTruncated.forEach(function (key) {\n    proxy[key] = self[key].slice(0, proxy.E);\n  });\n\n  cTruncated.forEach(function (key) {\n    proxy[key] = self[key].slice(0, proxy.C);\n  });\n\n  proxy.unused = this.unused.slice(0, this.U);\n\n  if (this.keepDendrogram) proxy.dendrogram = this.dendrogram;\n  else proxy.mapping = this.mapping;\n\n  return proxy;\n};\n\nfunction DirectedLouvainIndex(graph, options) {\n  // Solving options\n  options = resolveDefaults(options, DEFAULTS);\n\n  var resolution = options.resolution;\n\n  // Weight getters\n  var getEdgeWeight = createEdgeWeightGetter(options.getEdgeWeight).fromEntry;\n\n  // Building the index\n  var size = (graph.size - graph.selfLoopCount) * 2;\n\n  var NeighborhoodPointerArray = typed.getPointerArray(size);\n  var NodesPointerArray = typed.getPointerArray(graph.order + 1);\n\n  // NOTE: this memory optimization can yield overflow deopt when computing deltas\n  var WeightsArray = options.getEdgeWeight\n    ? Float64Array\n    : typed.getPointerArray(graph.size * 2);\n\n  // Properties\n  this.C = graph.order;\n  this.M = 0;\n  this.E = size;\n  this.U = 0;\n  this.resolution = resolution;\n  this.level = 0;\n  this.graph = graph;\n  this.nodes = new Array(graph.order);\n  this.keepDendrogram = options.keepDendrogram;\n\n  // Edge-level\n  // NOTE: edges are stored out then in, in this order\n  this.neighborhood = new NodesPointerArray(size);\n  this.weights = new WeightsArray(size);\n\n  // Node-level\n  this.loops = new WeightsArray(graph.order);\n  this.starts = new NeighborhoodPointerArray(graph.order + 1);\n  this.offsets = new NeighborhoodPointerArray(graph.order);\n  this.belongings = new NodesPointerArray(graph.order);\n  this.dendrogram = [];\n\n  // Community-level\n  this.counts = new NodesPointerArray(graph.order);\n  this.unused = new NodesPointerArray(graph.order);\n  this.totalInWeights = new WeightsArray(graph.order);\n  this.totalOutWeights = new WeightsArray(graph.order);\n\n  var ids = {};\n\n  var weight;\n\n  var i = 0,\n    n = 0;\n\n  var self = this;\n\n  graph.forEachNode(function (node) {\n    self.nodes[i] = node;\n\n    // Node map to index\n    ids[node] = i;\n\n    // Initializing starts & offsets\n    n += graph.outDegreeWithoutSelfLoops(node);\n    self.starts[i] = n;\n\n    n += graph.inDegreeWithoutSelfLoops(node);\n    self.offsets[i] = n;\n\n    // Belongings\n    self.belongings[i] = i;\n    self.counts[i] = 1;\n    i++;\n  });\n\n  // Single sweep over the edges\n  graph.forEachEdge(function (edge, attr, source, target, sa, ta, u) {\n    weight = getEdgeWeight(edge, attr, source, target, sa, ta, u);\n\n    source = ids[source];\n    target = ids[target];\n\n    self.M += weight;\n\n    // Self loop?\n    if (source === target) {\n      self.loops[source] += weight;\n      self.totalInWeights[source] += weight;\n      self.totalOutWeights[source] += weight;\n    } else {\n      self.totalOutWeights[source] += weight;\n      self.totalInWeights[target] += weight;\n\n      var startSource = --self.starts[source],\n        startTarget = --self.offsets[target];\n\n      self.neighborhood[startSource] = target;\n      self.neighborhood[startTarget] = source;\n\n      self.weights[startSource] = weight;\n      self.weights[startTarget] = weight;\n    }\n  });\n\n  this.starts[i] = this.E;\n\n  if (this.keepDendrogram) this.dendrogram.push(this.belongings.slice());\n  else this.mapping = this.belongings.slice();\n}\n\nDirectedLouvainIndex.prototype.bounds = UndirectedLouvainIndex.prototype.bounds;\n\nDirectedLouvainIndex.prototype.inBounds = function (i) {\n  return [this.offsets[i], this.starts[i + 1]];\n};\n\nDirectedLouvainIndex.prototype.outBounds = function (i) {\n  return [this.starts[i], this.offsets[i]];\n};\n\nDirectedLouvainIndex.prototype.project =\n  UndirectedLouvainIndex.prototype.project;\n\nDirectedLouvainIndex.prototype.projectIn = function () {\n  var self = this;\n\n  var projection = {};\n\n  self.nodes.slice(0, this.C).forEach(function (node, i) {\n    projection[node] = Array.from(\n      self.neighborhood.slice(self.offsets[i], self.starts[i + 1])\n    ).map(function (j) {\n      return self.nodes[j];\n    });\n  });\n\n  return projection;\n};\n\nDirectedLouvainIndex.prototype.projectOut = function () {\n  var self = this;\n\n  var projection = {};\n\n  self.nodes.slice(0, this.C).forEach(function (node, i) {\n    projection[node] = Array.from(\n      self.neighborhood.slice(self.starts[i], self.offsets[i])\n    ).map(function (j) {\n      return self.nodes[j];\n    });\n  });\n\n  return projection;\n};\n\nDirectedLouvainIndex.prototype.isolate = function (i, inDegree, outDegree) {\n  var currentCommunity = this.belongings[i];\n\n  // The node is already isolated\n  if (this.counts[currentCommunity] === 1) return currentCommunity;\n\n  var newCommunity = this.unused[--this.U];\n\n  var loops = this.loops[i];\n\n  this.totalInWeights[currentCommunity] -= inDegree + loops;\n  this.totalInWeights[newCommunity] += inDegree + loops;\n\n  this.totalOutWeights[currentCommunity] -= outDegree + loops;\n  this.totalOutWeights[newCommunity] += outDegree + loops;\n\n  this.belongings[i] = newCommunity;\n\n  this.counts[currentCommunity]--;\n  this.counts[newCommunity]++;\n\n  return newCommunity;\n};\n\nDirectedLouvainIndex.prototype.move = function (\n  i,\n  inDegree,\n  outDegree,\n  targetCommunity\n) {\n  var currentCommunity = this.belongings[i],\n    loops = this.loops[i];\n\n  this.totalInWeights[currentCommunity] -= inDegree + loops;\n  this.totalInWeights[targetCommunity] += inDegree + loops;\n\n  this.totalOutWeights[currentCommunity] -= outDegree + loops;\n  this.totalOutWeights[targetCommunity] += outDegree + loops;\n\n  this.belongings[i] = targetCommunity;\n\n  var nowEmpty = this.counts[currentCommunity]-- === 1;\n  this.counts[targetCommunity]++;\n\n  if (nowEmpty) this.unused[this.U++] = currentCommunity;\n};\n\nDirectedLouvainIndex.prototype.computeNodeInDegree = function (i) {\n  var o, l, weight;\n\n  var inDegree = 0;\n\n  for (o = this.offsets[i], l = this.starts[i + 1]; o < l; o++) {\n    weight = this.weights[o];\n\n    inDegree += weight;\n  }\n\n  return inDegree;\n};\n\nDirectedLouvainIndex.prototype.computeNodeOutDegree = function (i) {\n  var o, l, weight;\n\n  var outDegree = 0;\n\n  for (o = this.starts[i], l = this.offsets[i]; o < l; o++) {\n    weight = this.weights[o];\n\n    outDegree += weight;\n  }\n\n  return outDegree;\n};\n\nDirectedLouvainIndex.prototype.expensiveMove = function (i, ci) {\n  var inDegree = this.computeNodeInDegree(i),\n    outDegree = this.computeNodeOutDegree(i);\n\n  this.move(i, inDegree, outDegree, ci);\n};\n\nDirectedLouvainIndex.prototype.zoomOut = function () {\n  var inducedGraph = new Array(this.C - this.U),\n    newLabels = {};\n\n  var N = this.nodes.length;\n\n  var C = 0,\n    E = 0;\n\n  var i, j, l, m, n, ci, cj, data, offset, out, adj, inAdj, outAdj;\n\n  // Renumbering communities\n  for (i = 0, l = this.C; i < l; i++) {\n    ci = this.belongings[i];\n\n    if (!(ci in newLabels)) {\n      newLabels[ci] = C;\n      inducedGraph[C] = {\n        inAdj: {},\n        outAdj: {},\n        totalInWeights: this.totalInWeights[ci],\n        totalOutWeights: this.totalOutWeights[ci],\n        internalWeights: 0\n      };\n      C++;\n    }\n\n    // We do this to otpimize the number of lookups in next loop\n    this.belongings[i] = newLabels[ci];\n  }\n\n  // Actualizing dendrogram\n  var currentLevel, nextLevel;\n\n  if (this.keepDendrogram) {\n    currentLevel = this.dendrogram[this.level];\n    nextLevel = new (typed.getPointerArray(C))(N);\n\n    for (i = 0; i < N; i++) nextLevel[i] = this.belongings[currentLevel[i]];\n\n    this.dendrogram.push(nextLevel);\n  } else {\n    for (i = 0; i < N; i++) this.mapping[i] = this.belongings[this.mapping[i]];\n  }\n\n  // Building induced graph matrix\n  for (i = 0, l = this.C; i < l; i++) {\n    ci = this.belongings[i];\n    offset = this.offsets[i];\n\n    data = inducedGraph[ci];\n    inAdj = data.inAdj;\n    outAdj = data.outAdj;\n    data.internalWeights += this.loops[i];\n\n    for (j = this.starts[i], m = this.starts[i + 1]; j < m; j++) {\n      n = this.neighborhood[j];\n      cj = this.belongings[n];\n      out = j < offset;\n\n      adj = out ? outAdj : inAdj;\n\n      if (ci === cj) {\n        if (out) data.internalWeights += this.weights[j];\n\n        continue;\n      }\n\n      if (!(cj in adj)) adj[cj] = 0;\n\n      adj[cj] += this.weights[j];\n    }\n  }\n\n  // Rewriting neighborhood\n  this.C = C;\n\n  n = 0;\n\n  for (ci = 0; ci < C; ci++) {\n    data = inducedGraph[ci];\n    inAdj = data.inAdj;\n    outAdj = data.outAdj;\n\n    ci = +ci;\n\n    this.totalInWeights[ci] = data.totalInWeights;\n    this.totalOutWeights[ci] = data.totalOutWeights;\n    this.loops[ci] = data.internalWeights;\n    this.counts[ci] = 1;\n\n    this.starts[ci] = n;\n    this.belongings[ci] = ci;\n\n    for (cj in outAdj) {\n      this.neighborhood[n] = +cj;\n      this.weights[n] = outAdj[cj];\n\n      E++;\n      n++;\n    }\n\n    this.offsets[ci] = n;\n\n    for (cj in inAdj) {\n      this.neighborhood[n] = +cj;\n      this.weights[n] = inAdj[cj];\n\n      E++;\n      n++;\n    }\n  }\n\n  this.starts[C] = E;\n\n  this.E = E;\n  this.U = 0;\n  this.level++;\n\n  return newLabels;\n};\n\nDirectedLouvainIndex.prototype.modularity = function () {\n  var ci, cj, i, j, m;\n\n  var Q = 0;\n  var M = this.M;\n  var internalWeights = new Float64Array(this.C);\n\n  for (i = 0; i < this.C; i++) {\n    ci = this.belongings[i];\n    internalWeights[ci] += this.loops[i];\n\n    for (j = this.starts[i], m = this.offsets[i]; j < m; j++) {\n      cj = this.belongings[this.neighborhood[j]];\n\n      if (ci !== cj) continue;\n\n      internalWeights[ci] += this.weights[j];\n    }\n  }\n\n  for (i = 0; i < this.C; i++)\n    Q +=\n      internalWeights[i] / M -\n      ((this.totalInWeights[i] * this.totalOutWeights[i]) / Math.pow(M, 2)) *\n        this.resolution;\n\n  return Q;\n};\n\nDirectedLouvainIndex.prototype.delta = function (\n  i,\n  inDegree,\n  outDegree,\n  targetCommunityDegree,\n  targetCommunity\n) {\n  var M = this.M;\n\n  var targetCommunityTotalInWeight = this.totalInWeights[targetCommunity],\n    targetCommunityTotalOutWeight = this.totalOutWeights[targetCommunity];\n\n  var loops = this.loops[i];\n\n  inDegree += loops;\n  outDegree += loops;\n\n  return (\n    targetCommunityDegree / M -\n    ((outDegree * targetCommunityTotalInWeight +\n      inDegree * targetCommunityTotalOutWeight) *\n      this.resolution) /\n      (M * M)\n  );\n};\n\nDirectedLouvainIndex.prototype.deltaWithOwnCommunity = function (\n  i,\n  inDegree,\n  outDegree,\n  targetCommunityDegree,\n  targetCommunity\n) {\n  var M = this.M;\n\n  var targetCommunityTotalInWeight = this.totalInWeights[targetCommunity],\n    targetCommunityTotalOutWeight = this.totalOutWeights[targetCommunity];\n\n  var loops = this.loops[i];\n\n  inDegree += loops;\n  outDegree += loops;\n\n  return (\n    targetCommunityDegree / M -\n    ((outDegree * (targetCommunityTotalInWeight - inDegree) +\n      inDegree * (targetCommunityTotalOutWeight - outDegree)) *\n      this.resolution) /\n      (M * M)\n  );\n};\n\nDirectedLouvainIndex.prototype.collect =\n  UndirectedLouvainIndex.prototype.collect;\nDirectedLouvainIndex.prototype.assign = UndirectedLouvainIndex.prototype.assign;\n\nDirectedLouvainIndex.prototype[INSPECT] = function () {\n  var proxy = {};\n\n  // Trick so that node displays the name of the constructor\n  Object.defineProperty(proxy, 'constructor', {\n    value: DirectedLouvainIndex,\n    enumerable: false\n  });\n\n  proxy.C = this.C;\n  proxy.M = this.M;\n  proxy.E = this.E;\n  proxy.U = this.U;\n  proxy.resolution = this.resolution;\n  proxy.level = this.level;\n  proxy.nodes = this.nodes;\n  proxy.starts = this.starts.slice(0, proxy.C + 1);\n\n  var eTruncated = ['neighborhood', 'weights'];\n  var cTruncated = [\n    'counts',\n    'offsets',\n    'loops',\n    'belongings',\n    'totalInWeights',\n    'totalOutWeights'\n  ];\n\n  var self = this;\n\n  eTruncated.forEach(function (key) {\n    proxy[key] = self[key].slice(0, proxy.E);\n  });\n\n  cTruncated.forEach(function (key) {\n    proxy[key] = self[key].slice(0, proxy.C);\n  });\n\n  proxy.unused = this.unused.slice(0, this.U);\n\n  if (this.keepDendrogram) proxy.dendrogram = this.dendrogram;\n  else proxy.mapping = this.mapping;\n\n  return proxy;\n};\n\nexports.UndirectedLouvainIndex = UndirectedLouvainIndex;\nexports.DirectedLouvainIndex = DirectedLouvainIndex;\n","/**\n * Graphology Louvain Algorithm\n * =============================\n *\n * JavaScript implementation of the famous Louvain community detection\n * algorithm for graphology.\n *\n * [Articles]\n * M. E. J. Newman, « Modularity and community structure in networks »,\n * Proc. Natl. Acad. Sci. USA, vol. 103, no 23, 2006, p. 8577–8582\n * https://dx.doi.org/10.1073%2Fpnas.0601602103\n *\n * Newman, M. E. J. « Community detection in networks: Modularity optimization\n * and maximum likelihood are equivalent ». Physical Review E, vol. 94, no 5,\n * novembre 2016, p. 052315. arXiv.org, doi:10.1103/PhysRevE.94.052315.\n * https://arxiv.org/pdf/1606.02319.pdf\n *\n * Blondel, Vincent D., et al. « Fast unfolding of communities in large\n * networks ». Journal of Statistical Mechanics: Theory and Experiment,\n * vol. 2008, no 10, octobre 2008, p. P10008. DOI.org (Crossref),\n * doi:10.1088/1742-5468/2008/10/P10008.\n * https://arxiv.org/pdf/0803.0476.pdf\n *\n * Nicolas Dugué, Anthony Perez. Directed Louvain: maximizing modularity in\n * directed networks. [Research Report] Université d’Orléans. 2015. hal-01231784\n * https://hal.archives-ouvertes.fr/hal-01231784\n *\n * R. Lambiotte, J.-C. Delvenne and M. Barahona. Laplacian Dynamics and\n * Multiscale Modular Structure in Networks,\n * doi:10.1109/TNSE.2015.2391998.\n * https://arxiv.org/abs/0812.1770\n *\n * Traag, V. A., et al. « From Louvain to Leiden: Guaranteeing Well-Connected\n * Communities ». Scientific Reports, vol. 9, no 1, décembre 2019, p. 5233.\n * DOI.org (Crossref), doi:10.1038/s41598-019-41695-z.\n * https://arxiv.org/abs/1810.08473\n */\nvar resolveDefaults = require('graphology-utils/defaults');\nvar isGraph = require('graphology-utils/is-graph');\nvar inferType = require('graphology-utils/infer-type');\nvar SparseMap = require('mnemonist/sparse-map');\nvar SparseQueueSet = require('mnemonist/sparse-queue-set');\nvar createRandomIndex = require('pandemonium/random-index').createRandomIndex;\n\nvar indices = require('graphology-indices/louvain');\n\nvar UndirectedLouvainIndex = indices.UndirectedLouvainIndex;\nvar DirectedLouvainIndex = indices.DirectedLouvainIndex;\n\nvar DEFAULTS = {\n  nodeCommunityAttribute: 'community',\n  getEdgeWeight: 'weight',\n  fastLocalMoves: true,\n  randomWalk: true,\n  resolution: 1,\n  rng: Math.random\n};\n\nfunction addWeightToCommunity(map, community, weight) {\n  var currentWeight = map.get(community);\n\n  if (typeof currentWeight === 'undefined') currentWeight = 0;\n\n  currentWeight += weight;\n\n  map.set(community, currentWeight);\n}\n\nvar EPSILON = 1e-10;\n\nfunction tieBreaker(\n  bestCommunity,\n  currentCommunity,\n  targetCommunity,\n  delta,\n  bestDelta\n) {\n  if (Math.abs(delta - bestDelta) < EPSILON) {\n    if (bestCommunity === currentCommunity) {\n      return false;\n    } else {\n      return targetCommunity > bestCommunity;\n    }\n  } else if (delta > bestDelta) {\n    return true;\n  }\n\n  return false;\n}\n\nfunction undirectedLouvain(detailed, graph, options) {\n  var index = new UndirectedLouvainIndex(graph, {\n    getEdgeWeight: options.getEdgeWeight,\n    keepDendrogram: detailed,\n    resolution: options.resolution\n  });\n\n  var randomIndex = createRandomIndex(options.rng);\n\n  // State variables\n  var moveWasMade = true,\n    localMoveWasMade = true;\n\n  // Communities\n  var currentCommunity, targetCommunity;\n  var communities = new SparseMap(Float64Array, index.C);\n\n  // Traversal\n  var queue, start, end, weight, ci, ri, s, i, j, l;\n\n  // Metrics\n  var degree, targetCommunityDegree;\n\n  // Moves\n  var bestCommunity, bestDelta, deltaIsBetter, delta;\n\n  // Details\n  var deltaComputations = 0,\n    nodesVisited = 0,\n    moves = [],\n    localMoves,\n    currentMoves;\n\n  if (options.fastLocalMoves) queue = new SparseQueueSet(index.C);\n\n  while (moveWasMade) {\n    l = index.C;\n\n    moveWasMade = false;\n    localMoveWasMade = true;\n\n    if (options.fastLocalMoves) {\n      currentMoves = 0;\n\n      // Traversal of the graph\n      ri = options.randomWalk ? randomIndex(l) : 0;\n\n      for (s = 0; s < l; s++, ri++) {\n        i = ri % l;\n        queue.enqueue(i);\n      }\n\n      while (queue.size !== 0) {\n        i = queue.dequeue();\n        nodesVisited++;\n\n        degree = 0;\n        communities.clear();\n\n        currentCommunity = index.belongings[i];\n\n        start = index.starts[i];\n        end = index.starts[i + 1];\n\n        // Traversing neighbors\n        for (; start < end; start++) {\n          j = index.neighborhood[start];\n          weight = index.weights[start];\n\n          targetCommunity = index.belongings[j];\n\n          // Incrementing metrics\n          degree += weight;\n          addWeightToCommunity(communities, targetCommunity, weight);\n        }\n\n        // Finding best community to move to\n        bestDelta = index.fastDeltaWithOwnCommunity(\n          i,\n          degree,\n          communities.get(currentCommunity) || 0,\n          currentCommunity\n        );\n        bestCommunity = currentCommunity;\n\n        for (ci = 0; ci < communities.size; ci++) {\n          targetCommunity = communities.dense[ci];\n\n          if (targetCommunity === currentCommunity) continue;\n\n          targetCommunityDegree = communities.vals[ci];\n\n          deltaComputations++;\n\n          delta = index.fastDelta(\n            i,\n            degree,\n            targetCommunityDegree,\n            targetCommunity\n          );\n\n          deltaIsBetter = tieBreaker(\n            bestCommunity,\n            currentCommunity,\n            targetCommunity,\n            delta,\n            bestDelta\n          );\n\n          if (deltaIsBetter) {\n            bestDelta = delta;\n            bestCommunity = targetCommunity;\n          }\n        }\n\n        // Should we move the node?\n        if (bestDelta < 0) {\n          // NOTE: this is to allow nodes to move back to their own singleton\n          // This code however only deals with modularity (e.g. the condition\n          // about bestDelta < 0, which is the delta for moving back to\n          // singleton wrt. modularity). Indeed, rarely, the Louvain\n          // algorithm can produce such cases when a node would be better in\n          // a singleton that in its own community when considering self loops\n          // or a resolution != 1. In this case, delta with your own community\n          // is indeed less than 0. To handle different metrics, one should\n          // consider computing the delta for going back to singleton because\n          // it might not be 0.\n          bestCommunity = index.isolate(i, degree);\n\n          // If the node was already in a singleton community, we don't consider\n          // a move was made\n          if (bestCommunity === currentCommunity) continue;\n        } else {\n          // If no move was made, we continue to next node\n          if (bestCommunity === currentCommunity) {\n            continue;\n          } else {\n            // Actually moving the node to a new community\n            index.move(i, degree, bestCommunity);\n          }\n        }\n\n        moveWasMade = true;\n        currentMoves++;\n\n        // Adding neighbors from other communities to the queue\n        start = index.starts[i];\n        end = index.starts[i + 1];\n\n        for (; start < end; start++) {\n          j = index.neighborhood[start];\n          targetCommunity = index.belongings[j];\n\n          if (targetCommunity !== bestCommunity) queue.enqueue(j);\n        }\n      }\n\n      moves.push(currentMoves);\n    } else {\n      localMoves = [];\n      moves.push(localMoves);\n\n      // Traditional Louvain iterative traversal of the graph\n      while (localMoveWasMade) {\n        localMoveWasMade = false;\n        currentMoves = 0;\n\n        ri = options.randomWalk ? randomIndex(l) : 0;\n\n        for (s = 0; s < l; s++, ri++) {\n          i = ri % l;\n\n          nodesVisited++;\n\n          degree = 0;\n          communities.clear();\n\n          currentCommunity = index.belongings[i];\n\n          start = index.starts[i];\n          end = index.starts[i + 1];\n\n          // Traversing neighbors\n          for (; start < end; start++) {\n            j = index.neighborhood[start];\n            weight = index.weights[start];\n\n            targetCommunity = index.belongings[j];\n\n            // Incrementing metrics\n            degree += weight;\n            addWeightToCommunity(communities, targetCommunity, weight);\n          }\n\n          // Finding best community to move to\n          bestDelta = index.fastDeltaWithOwnCommunity(\n            i,\n            degree,\n            communities.get(currentCommunity) || 0,\n            currentCommunity\n          );\n          bestCommunity = currentCommunity;\n\n          for (ci = 0; ci < communities.size; ci++) {\n            targetCommunity = communities.dense[ci];\n\n            if (targetCommunity === currentCommunity) continue;\n\n            targetCommunityDegree = communities.vals[ci];\n\n            deltaComputations++;\n\n            delta = index.fastDelta(\n              i,\n              degree,\n              targetCommunityDegree,\n              targetCommunity\n            );\n\n            deltaIsBetter = tieBreaker(\n              bestCommunity,\n              currentCommunity,\n              targetCommunity,\n              delta,\n              bestDelta\n            );\n\n            if (deltaIsBetter) {\n              bestDelta = delta;\n              bestCommunity = targetCommunity;\n            }\n          }\n\n          // Should we move the node?\n          if (bestDelta < 0) {\n            // NOTE: this is to allow nodes to move back to their own singleton\n            // This code however only deals with modularity (e.g. the condition\n            // about bestDelta < 0, which is the delta for moving back to\n            // singleton wrt. modularity). Indeed, rarely, the Louvain\n            // algorithm can produce such cases when a node would be better in\n            // a singleton that in its own community when considering self loops\n            // or a resolution != 1. In this case, delta with your own community\n            // is indeed less than 0. To handle different metrics, one should\n            // consider computing the delta for going back to singleton because\n            // it might not be 0.\n            bestCommunity = index.isolate(i, degree);\n\n            // If the node was already in a singleton community, we don't consider\n            // a move was made\n            if (bestCommunity === currentCommunity) continue;\n          } else {\n            // If no move was made, we continue to next node\n            if (bestCommunity === currentCommunity) {\n              continue;\n            } else {\n              // Actually moving the node to a new community\n              index.move(i, degree, bestCommunity);\n            }\n          }\n\n          localMoveWasMade = true;\n          currentMoves++;\n        }\n\n        localMoves.push(currentMoves);\n\n        moveWasMade = localMoveWasMade || moveWasMade;\n      }\n    }\n\n    // We continue working on the induced graph\n    if (moveWasMade) index.zoomOut();\n  }\n\n  var results = {\n    index: index,\n    deltaComputations: deltaComputations,\n    nodesVisited: nodesVisited,\n    moves: moves\n  };\n\n  return results;\n}\n\nfunction directedLouvain(detailed, graph, options) {\n  var index = new DirectedLouvainIndex(graph, {\n    getEdgeWeight: options.getEdgeWeight,\n    keepDendrogram: detailed,\n    resolution: options.resolution\n  });\n\n  var randomIndex = createRandomIndex(options.rng);\n\n  // State variables\n  var moveWasMade = true,\n    localMoveWasMade = true;\n\n  // Communities\n  var currentCommunity, targetCommunity;\n  var communities = new SparseMap(Float64Array, index.C);\n\n  // Traversal\n  var queue, start, end, offset, out, weight, ci, ri, s, i, j, l;\n\n  // Metrics\n  var inDegree, outDegree, targetCommunityDegree;\n\n  // Moves\n  var bestCommunity, bestDelta, deltaIsBetter, delta;\n\n  // Details\n  var deltaComputations = 0,\n    nodesVisited = 0,\n    moves = [],\n    localMoves,\n    currentMoves;\n\n  if (options.fastLocalMoves) queue = new SparseQueueSet(index.C);\n\n  while (moveWasMade) {\n    l = index.C;\n\n    moveWasMade = false;\n    localMoveWasMade = true;\n\n    if (options.fastLocalMoves) {\n      currentMoves = 0;\n\n      // Traversal of the graph\n      ri = options.randomWalk ? randomIndex(l) : 0;\n\n      for (s = 0; s < l; s++, ri++) {\n        i = ri % l;\n        queue.enqueue(i);\n      }\n\n      while (queue.size !== 0) {\n        i = queue.dequeue();\n        nodesVisited++;\n\n        inDegree = 0;\n        outDegree = 0;\n        communities.clear();\n\n        currentCommunity = index.belongings[i];\n\n        start = index.starts[i];\n        end = index.starts[i + 1];\n        offset = index.offsets[i];\n\n        // Traversing neighbors\n        for (; start < end; start++) {\n          out = start < offset;\n          j = index.neighborhood[start];\n          weight = index.weights[start];\n\n          targetCommunity = index.belongings[j];\n\n          // Incrementing metrics\n          if (out) outDegree += weight;\n          else inDegree += weight;\n\n          addWeightToCommunity(communities, targetCommunity, weight);\n        }\n\n        // Finding best community to move to\n        bestDelta = index.deltaWithOwnCommunity(\n          i,\n          inDegree,\n          outDegree,\n          communities.get(currentCommunity) || 0,\n          currentCommunity\n        );\n        bestCommunity = currentCommunity;\n\n        for (ci = 0; ci < communities.size; ci++) {\n          targetCommunity = communities.dense[ci];\n\n          if (targetCommunity === currentCommunity) continue;\n\n          targetCommunityDegree = communities.vals[ci];\n\n          deltaComputations++;\n\n          delta = index.delta(\n            i,\n            inDegree,\n            outDegree,\n            targetCommunityDegree,\n            targetCommunity\n          );\n\n          deltaIsBetter = tieBreaker(\n            bestCommunity,\n            currentCommunity,\n            targetCommunity,\n            delta,\n            bestDelta\n          );\n\n          if (deltaIsBetter) {\n            bestDelta = delta;\n            bestCommunity = targetCommunity;\n          }\n        }\n\n        // Should we move the node?\n        if (bestDelta < 0) {\n          // NOTE: this is to allow nodes to move back to their own singleton\n          // This code however only deals with modularity (e.g. the condition\n          // about bestDelta < 0, which is the delta for moving back to\n          // singleton wrt. modularity). Indeed, rarely, the Louvain\n          // algorithm can produce such cases when a node would be better in\n          // a singleton that in its own community when considering self loops\n          // or a resolution != 1. In this case, delta with your own community\n          // is indeed less than 0. To handle different metrics, one should\n          // consider computing the delta for going back to singleton because\n          // it might not be 0.\n          bestCommunity = index.isolate(i, inDegree, outDegree);\n\n          // If the node was already in a singleton community, we don't consider\n          // a move was made\n          if (bestCommunity === currentCommunity) continue;\n        } else {\n          // If no move was made, we continue to next node\n          if (bestCommunity === currentCommunity) {\n            continue;\n          } else {\n            // Actually moving the node to a new community\n            index.move(i, inDegree, outDegree, bestCommunity);\n          }\n        }\n\n        moveWasMade = true;\n        currentMoves++;\n\n        // Adding neighbors from other communities to the queue\n        start = index.starts[i];\n        end = index.starts[i + 1];\n\n        for (; start < end; start++) {\n          j = index.neighborhood[start];\n          targetCommunity = index.belongings[j];\n\n          if (targetCommunity !== bestCommunity) queue.enqueue(j);\n        }\n      }\n\n      moves.push(currentMoves);\n    } else {\n      localMoves = [];\n      moves.push(localMoves);\n\n      // Traditional Louvain iterative traversal of the graph\n      while (localMoveWasMade) {\n        localMoveWasMade = false;\n        currentMoves = 0;\n\n        ri = options.randomWalk ? randomIndex(l) : 0;\n\n        for (s = 0; s < l; s++, ri++) {\n          i = ri % l;\n\n          nodesVisited++;\n\n          inDegree = 0;\n          outDegree = 0;\n          communities.clear();\n\n          currentCommunity = index.belongings[i];\n\n          start = index.starts[i];\n          end = index.starts[i + 1];\n          offset = index.offsets[i];\n\n          // Traversing neighbors\n          for (; start < end; start++) {\n            out = start < offset;\n            j = index.neighborhood[start];\n            weight = index.weights[start];\n\n            targetCommunity = index.belongings[j];\n\n            // Incrementing metrics\n            if (out) outDegree += weight;\n            else inDegree += weight;\n\n            addWeightToCommunity(communities, targetCommunity, weight);\n          }\n\n          // Finding best community to move to\n          bestDelta = index.deltaWithOwnCommunity(\n            i,\n            inDegree,\n            outDegree,\n            communities.get(currentCommunity) || 0,\n            currentCommunity\n          );\n          bestCommunity = currentCommunity;\n\n          for (ci = 0; ci < communities.size; ci++) {\n            targetCommunity = communities.dense[ci];\n\n            if (targetCommunity === currentCommunity) continue;\n\n            targetCommunityDegree = communities.vals[ci];\n\n            deltaComputations++;\n\n            delta = index.delta(\n              i,\n              inDegree,\n              outDegree,\n              targetCommunityDegree,\n              targetCommunity\n            );\n\n            deltaIsBetter = tieBreaker(\n              bestCommunity,\n              currentCommunity,\n              targetCommunity,\n              delta,\n              bestDelta\n            );\n\n            if (deltaIsBetter) {\n              bestDelta = delta;\n              bestCommunity = targetCommunity;\n            }\n          }\n\n          // Should we move the node?\n          if (bestDelta < 0) {\n            // NOTE: this is to allow nodes to move back to their own singleton\n            // This code however only deals with modularity (e.g. the condition\n            // about bestDelta < 0, which is the delta for moving back to\n            // singleton wrt. modularity). Indeed, rarely, the Louvain\n            // algorithm can produce such cases when a node would be better in\n            // a singleton that in its own community when considering self loops\n            // or a resolution != 1. In this case, delta with your own community\n            // is indeed less than 0. To handle different metrics, one should\n            // consider computing the delta for going back to singleton because\n            // it might not be 0.\n            bestCommunity = index.isolate(i, inDegree, outDegree);\n\n            // If the node was already in a singleton community, we don't consider\n            // a move was made\n            if (bestCommunity === currentCommunity) continue;\n          } else {\n            // If no move was made, we continue to next node\n            if (bestCommunity === currentCommunity) {\n              continue;\n            } else {\n              // Actually moving the node to a new community\n              index.move(i, inDegree, outDegree, bestCommunity);\n            }\n          }\n\n          localMoveWasMade = true;\n          currentMoves++;\n        }\n\n        localMoves.push(currentMoves);\n\n        moveWasMade = localMoveWasMade || moveWasMade;\n      }\n    }\n\n    // We continue working on the induced graph\n    if (moveWasMade) index.zoomOut();\n  }\n\n  var results = {\n    index: index,\n    deltaComputations: deltaComputations,\n    nodesVisited: nodesVisited,\n    moves: moves\n  };\n\n  return results;\n}\n\n/**\n * Function returning the communities mapping of the graph.\n *\n * @param  {boolean} assign             - Assign communities to nodes attributes?\n * @param  {boolean} detailed           - Whether to return detailed information.\n * @param  {Graph}   graph              - Target graph.\n * @param  {object}  options            - Options:\n * @param  {string}    nodeCommunityAttribute - Community node attribute name.\n * @param  {string}    getEdgeWeight          - Weight edge attribute name or getter function.\n * @param  {string}    deltaComputation       - Method to use to compute delta computations.\n * @param  {boolean}   fastLocalMoves         - Whether to use the fast local move optimization.\n * @param  {boolean}   randomWalk             - Whether to traverse the graph in random order.\n * @param  {number}    resolution             - Resolution parameter.\n * @param  {function}  rng                    - RNG function to use.\n * @return {object}\n */\nfunction louvain(assign, detailed, graph, options) {\n  if (!isGraph(graph))\n    throw new Error(\n      'graphology-communities-louvain: the given graph is not a valid graphology instance.'\n    );\n\n  var type = inferType(graph);\n\n  if (type === 'mixed')\n    throw new Error(\n      'graphology-communities-louvain: cannot run the algorithm on a true mixed graph.'\n    );\n\n  // Attributes name\n  options = resolveDefaults(options, DEFAULTS);\n\n  // Empty graph case\n  var c = 0;\n\n  if (graph.size === 0) {\n    if (assign) {\n      graph.forEachNode(function (node) {\n        graph.setNodeAttribute(node, options.nodeCommunityAttribute, c++);\n      });\n\n      return;\n    }\n\n    var communities = {};\n\n    graph.forEachNode(function (node) {\n      communities[node] = c++;\n    });\n\n    if (!detailed) return communities;\n\n    return {\n      communities: communities,\n      count: graph.order,\n      deltaComputations: 0,\n      dendrogram: null,\n      level: 0,\n      modularity: NaN,\n      moves: null,\n      nodesVisited: 0,\n      resolution: options.resolution\n    };\n  }\n\n  var fn = type === 'undirected' ? undirectedLouvain : directedLouvain;\n\n  var results = fn(detailed, graph, options);\n\n  var index = results.index;\n\n  // Standard output\n  if (!detailed) {\n    if (assign) {\n      index.assign(options.nodeCommunityAttribute);\n      return;\n    }\n\n    return index.collect();\n  }\n\n  // Detailed output\n  var output = {\n    count: index.C,\n    deltaComputations: results.deltaComputations,\n    dendrogram: index.dendrogram,\n    level: index.level,\n    modularity: index.modularity(),\n    moves: results.moves,\n    nodesVisited: results.nodesVisited,\n    resolution: options.resolution\n  };\n\n  if (assign) {\n    index.assign(options.nodeCommunityAttribute);\n    return output;\n  }\n\n  output.communities = index.collect();\n\n  return output;\n}\n\n/**\n * Exporting.\n */\nvar fn = louvain.bind(null, false, false);\nfn.assign = louvain.bind(null, true, false);\nfn.detailed = louvain.bind(null, false, true);\nfn.defaults = DEFAULTS;\n\nmodule.exports = fn;\n","/*\n * Copyright 2026 OpenTrace Contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { useMemo } from 'react';\nimport { UndirectedGraph } from 'graphology';\nimport louvain from 'graphology-communities-louvain';\nimport type {\n  GraphNode,\n  GraphLink,\n  CommunityData,\n  LayoutConfig,\n} from './types';\n\n/**\n * Compute Louvain communities on the full (unfiltered) graph.\n * Color and naming functions are provided via layoutConfig to avoid\n * coupling to a specific color palette.\n */\nexport function useCommunities(\n  allNodes: GraphNode[],\n  allLinks: GraphLink[],\n  layoutConfig: LayoutConfig,\n): CommunityData {\n  return useMemo(() => {\n    if (allNodes.length === 0) {\n      return {\n        assignments: {} as Record<string, number>,\n        colorMap: new Map<number, string>(),\n        names: new Map<number, string>(),\n        count: 0,\n      };\n    }\n\n    const tempGraph = new UndirectedGraph();\n    const nodeIdSet = new Set<string>();\n\n    for (const node of allNodes) {\n      if (!nodeIdSet.has(node.id)) {\n        tempGraph.addNode(node.id);\n        nodeIdSet.add(node.id);\n      }\n    }\n\n    for (const link of allLinks) {\n      const source =\n        typeof link.source === 'string'\n          ? link.source\n          : (link.source as GraphNode).id;\n      const target =\n        typeof link.target === 'string'\n          ? link.target\n          : (link.target as GraphNode).id;\n      if (source === target) continue;\n      if (!nodeIdSet.has(source) || !nodeIdSet.has(target)) continue;\n\n      if (tempGraph.hasEdge(source, target)) {\n        const w =\n          (tempGraph.getEdgeAttribute(source, target, 'weight') as number) ?? 1;\n        tempGraph.setEdgeAttribute(source, target, 'weight', w + 1);\n      } else {\n        tempGraph.addEdge(source, target, { weight: 1 });\n      }\n    }\n\n    const assignments = louvain(tempGraph, {\n      resolution: layoutConfig.louvainResolution,\n      getEdgeWeight: 'weight',\n    });\n    const colorMap = layoutConfig.buildCommunityColorMap(assignments);\n    const names = layoutConfig.buildCommunityNames(assignments, allNodes);\n    const count = new Set(Object.values(assignments)).size;\n\n    if (process.env.NODE_ENV === 'development') {\n      console.log(\n        `[graph] Louvain: ${count} communities from ${allNodes.length} nodes`,\n      );\n    }\n\n    return { assignments, colorMap, names, count };\n  }, [allNodes, allLinks, layoutConfig]);\n}\n","/*\n * Copyright 2026 OpenTrace Contributors\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *     http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n\nimport { useMemo } from 'react';\nimport type Graph from 'graphology';\nimport type { GraphNode, GraphLink, FilterState } from './types';\n\n/** Extract a string ID from a link endpoint (handles string, number, and object forms). */\nfunction endpointId(endpoint: string | number | GraphNode | undefined): string {\n  if (typeof endpoint === 'string') return endpoint;\n  if (typeof endpoint === 'object' && endpoint !== null)\n    return (endpoint as GraphNode).id;\n  return String(endpoint);\n}\n\n/**\n * Compute highlight sets (nodes, links, labels) and a hop-distance map based on\n * the current search query, selected node, hop depth, and filter state.\n *\n * Adjacency is built from `allLinks` filtered by `filterState.hiddenLinkTypes`\n * and excluding links whose endpoints belong to hidden node types.\n */\nexport function useHighlights(\n  _graph: Graph,\n  _layoutReady: boolean,\n  allNodes: GraphNode[],\n  allLinks: GraphLink[],\n  searchQuery: string,\n  selectedNodeId: string | null,\n  hops: number,\n  filterState: FilterState,\n): {\n  highlightNodes: Set<string>;\n  highlightLinks: Set<string>;\n  labelNodes: Set<string>;\n  hopMap: Map<string, number>;\n} {\n  // Build a node-type lookup so we can filter out hidden endpoint types.\n  const nodeTypeMap = useMemo(() => {\n    const map = new Map<string, string>();\n    for (const node of allNodes) {\n      map.set(node.id, node.type);\n    }\n    return map;\n  }, [allNodes]);\n\n  // Build adjacency from allLinks, respecting filter state.\n  const adjacency = useMemo(() => {\n    const map = new Map<string, { neighbor: string; linkKey: string }[]>();\n    for (const link of allLinks) {\n      // Skip hidden link types.\n      if (filterState.hiddenLinkTypes.has(link.label)) continue;\n\n      const sourceId = endpointId(link.source);\n      const targetId = endpointId(link.target);\n\n      // Skip links where either endpoint is a hidden node type.\n      const sourceType = nodeTypeMap.get(sourceId);\n      const targetType = nodeTypeMap.get(targetId);\n      if (sourceType && filterState.hiddenNodeTypes.has(sourceType)) continue;\n      if (targetType && filterState.hiddenNodeTypes.has(targetType)) continue;\n\n      const linkKey = `${sourceId}-${targetId}`;\n      if (!map.has(sourceId)) map.set(sourceId, []);\n      if (!map.has(targetId)) map.set(targetId, []);\n      map.get(sourceId)!.push({ neighbor: targetId, linkKey });\n      map.get(targetId)!.push({ neighbor: sourceId, linkKey });\n    }\n    return map;\n  }, [\n    allLinks,\n    filterState.hiddenLinkTypes,\n    filterState.hiddenNodeTypes,\n    nodeTypeMap,\n  ]);\n\n  // Compute highlights via search and/or BFS from selected node.\n  return useMemo(() => {\n    const highlightNodes = new Set<string>();\n    const highlightLinks = new Set<string>();\n    const labelNodes = new Set<string>();\n    const hopMap = new Map<string, number>();\n\n    // Search: find nodes whose name, id, or type contain the query.\n    if (searchQuery) {\n      const q = searchQuery.toLowerCase();\n      for (const node of allNodes) {\n        if (\n          node.name?.toLowerCase().includes(q) ||\n          node.id.toLowerCase().includes(q) ||\n          node.type.toLowerCase().includes(q)\n        ) {\n          highlightNodes.add(node.id);\n          labelNodes.add(node.id);\n        }\n      }\n    }\n\n    // BFS from selected node up to `hops` depth for highlights,\n    // but only up to min(2, hops) for labels.\n    if (selectedNodeId) {\n      const labelDepth = Math.min(2, hops);\n      highlightNodes.add(selectedNodeId);\n      labelNodes.add(selectedNodeId);\n      hopMap.set(selectedNodeId, 0);\n      let frontier = new Set<string>([selectedNodeId]);\n      for (let depth = 0; depth < hops && frontier.size > 0; depth++) {\n        const nextFrontier = new Set<string>();\n        frontier.forEach((nodeId) => {\n          const edges = adjacency.get(nodeId);\n          if (!edges) return;\n          edges.forEach(({ neighbor, linkKey }) => {\n            highlightLinks.add(linkKey);\n            if (!highlightNodes.has(neighbor)) {\n              nextFrontier.add(neighbor);\n              hopMap.set(neighbor, depth + 1);\n            }\n            highlightNodes.add(neighbor);\n            if (depth < labelDepth) {\n              labelNodes.add(neighbor);\n            }\n          });\n        });\n        frontier = nextFrontier;\n      }\n    }\n\n    return { highlightNodes, highlightLinks, labelNodes, hopMap };\n  }, [allNodes, searchQuery, selectedNodeId, hops, adjacency]);\n}\n"],"names":["ReflectApply","ReflectOwnKeys","NumberIsNaN","eventsModule","events","once","Graph","iterator","t","EventEmitter","isGraph","PALETTE","KNOWN","djb2","useEffect","defaults","require$$0","inferType","exports","require$$1","require$$2","DEFAULTS","louvain","require$$3","require$$4","require$$5","require$$6","assign","fn","useMemo"],"mappings":";;;;;;;;;;AAuBA,MAAI,IAAI,OAAO,YAAY,WAAW,UAAU;AAChD,MAAI,eAAe,KAAK,OAAO,EAAE,UAAU,aACvC,EAAE,QACF,SAASA,cAAa,QAAQ,UAAU,MAAM;AAC9C,WAAO,SAAS,UAAU,MAAM,KAAK,QAAQ,UAAU,IAAI;AAAA,EAC/D;AAEA,MAAI;AACJ,MAAI,KAAK,OAAO,EAAE,YAAY,YAAY;AACxC,qBAAiB,EAAE;AAAA,EACrB,WAAW,OAAO,uBAAuB;AACvC,qBAAiB,SAASC,gBAAe,QAAQ;AAC/C,aAAO,OAAO,oBAAoB,MAAM,EACrC,OAAO,OAAO,sBAAsB,MAAM,CAAC;AAAA,IAClD;AAAA,EACA,OAAO;AACL,qBAAiB,SAASA,gBAAe,QAAQ;AAC/C,aAAO,OAAO,oBAAoB,MAAM;AAAA,IAC5C;AAAA,EACA;AAEA,WAAS,mBAAmB,SAAS;AACnC,QAAI,WAAW,QAAQ,KAAM,SAAQ,KAAK,OAAO;AAAA,EACnD;AAEA,MAAI,cAAc,OAAO,SAAS,SAASC,aAAY,OAAO;AAC5D,WAAO,UAAU;AAAA,EACnB;AAEA,WAAS,eAAe;AACtB,iBAAa,KAAK,KAAK,IAAI;AAAA,EAC7B;AACAC,SAAA,UAAiB;AACjBA,SAAA,QAAA,OAAsB;AAGtB,eAAa,eAAe;AAE5B,eAAa,UAAU,UAAU;AACjC,eAAa,UAAU,eAAe;AACtC,eAAa,UAAU,gBAAgB;AAIvC,MAAI,sBAAsB;AAE1B,WAAS,cAAc,UAAU;AAC/B,QAAI,OAAO,aAAa,YAAY;AAClC,YAAM,IAAI,UAAU,qEAAqE,OAAO,QAAQ;AAAA,IAC5G;AAAA,EACA;AAEA,SAAO,eAAe,cAAc,uBAAuB;AAAA,IACzD,YAAY;AAAA,IACZ,KAAK,WAAW;AACd,aAAO;AAAA,IACX;AAAA,IACE,KAAK,SAAS,KAAK;AACjB,UAAI,OAAO,QAAQ,YAAY,MAAM,KAAK,YAAY,GAAG,GAAG;AAC1D,cAAM,IAAI,WAAW,oGAAoG,MAAM,GAAG;AAAA,MACxI;AACI,4BAAsB;AAAA,IAC1B;AAAA,EACA,CAAC;AAED,eAAa,OAAO,WAAW;AAE7B,QAAI,KAAK,YAAY,UACjB,KAAK,YAAY,OAAO,eAAe,IAAI,EAAE,SAAS;AACxD,WAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,WAAK,eAAe;AAAA,IACxB;AAEE,SAAK,gBAAgB,KAAK,iBAAiB;AAAA,EAC7C;AAIA,eAAa,UAAU,kBAAkB,SAAS,gBAAgB,GAAG;AACnE,QAAI,OAAO,MAAM,YAAY,IAAI,KAAK,YAAY,CAAC,GAAG;AACpD,YAAM,IAAI,WAAW,kFAAkF,IAAI,GAAG;AAAA,IAClH;AACE,SAAK,gBAAgB;AACrB,WAAO;AAAA,EACT;AAEA,WAAS,iBAAiB,MAAM;AAC9B,QAAI,KAAK,kBAAkB;AACzB,aAAO,aAAa;AACtB,WAAO,KAAK;AAAA,EACd;AAEA,eAAa,UAAU,kBAAkB,SAAS,kBAAkB;AAClE,WAAO,iBAAiB,IAAI;AAAA,EAC9B;AAEA,eAAa,UAAU,OAAO,SAAS,KAAK,MAAM;AAChD,QAAI,OAAO,CAAA;AACX,aAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAK,MAAK,KAAK,UAAU,CAAC,CAAC;AACjE,QAAI,UAAW,SAAS;AAExB,QAAIC,UAAS,KAAK;AAClB,QAAIA,YAAW;AACb,gBAAW,WAAWA,QAAO,UAAU;AAAA,aAChC,CAAC;AACR,aAAO;AAGT,QAAI,SAAS;AACX,UAAI;AACJ,UAAI,KAAK,SAAS;AAChB,aAAK,KAAK,CAAC;AACb,UAAI,cAAc,OAAO;AAGvB,cAAM;AAAA,MACZ;AAEI,UAAI,MAAM,IAAI,MAAM,sBAAsB,KAAK,OAAO,GAAG,UAAU,MAAM,GAAG;AAC5E,UAAI,UAAU;AACd,YAAM;AAAA,IACV;AAEE,QAAI,UAAUA,QAAO,IAAI;AAEzB,QAAI,YAAY;AACd,aAAO;AAET,QAAI,OAAO,YAAY,YAAY;AACjC,mBAAa,SAAS,MAAM,IAAI;AAAA,IACpC,OAAS;AACL,UAAI,MAAM,QAAQ;AAClB,UAAI,YAAY,WAAW,SAAS,GAAG;AACvC,eAAS,IAAI,GAAG,IAAI,KAAK,EAAE;AACzB,qBAAa,UAAU,CAAC,GAAG,MAAM,IAAI;AAAA,IAC3C;AAEE,WAAO;AAAA,EACT;AAEA,WAAS,aAAa,QAAQ,MAAM,UAAU,SAAS;AACrD,QAAI;AACJ,QAAIA;AACJ,QAAI;AAEJ,kBAAc,QAAQ;AAEtB,IAAAA,UAAS,OAAO;AAChB,QAAIA,YAAW,QAAW;AACxB,MAAAA,UAAS,OAAO,UAAU,uBAAO,OAAO,IAAI;AAC5C,aAAO,eAAe;AAAA,IAC1B,OAAS;AAGL,UAAIA,QAAO,gBAAgB,QAAW;AACpC,eAAO;AAAA,UAAK;AAAA,UAAe;AAAA,UACf,SAAS,WAAW,SAAS,WAAW;AAAA,QAAQ;AAI5D,QAAAA,UAAS,OAAO;AAAA,MACtB;AACI,iBAAWA,QAAO,IAAI;AAAA,IAC1B;AAEE,QAAI,aAAa,QAAW;AAE1B,iBAAWA,QAAO,IAAI,IAAI;AAC1B,QAAE,OAAO;AAAA,IACb,OAAS;AACL,UAAI,OAAO,aAAa,YAAY;AAElC,mBAAWA,QAAO,IAAI,IACpB,UAAU,CAAC,UAAU,QAAQ,IAAI,CAAC,UAAU,QAAQ;AAAA,MAE5D,WAAe,SAAS;AAClB,iBAAS,QAAQ,QAAQ;AAAA,MAC/B,OAAW;AACL,iBAAS,KAAK,QAAQ;AAAA,MAC5B;AAGI,UAAI,iBAAiB,MAAM;AAC3B,UAAI,IAAI,KAAK,SAAS,SAAS,KAAK,CAAC,SAAS,QAAQ;AACpD,iBAAS,SAAS;AAGlB,YAAI,IAAI,IAAI,MAAM,iDACE,SAAS,SAAS,MAAM,OAAO,IAAI,IAAI,mEAEvB;AACpC,UAAE,OAAO;AACT,UAAE,UAAU;AACZ,UAAE,OAAO;AACT,UAAE,QAAQ,SAAS;AACnB,2BAAmB,CAAC;AAAA,MAC1B;AAAA,IACA;AAEE,WAAO;AAAA,EACT;AAEA,eAAa,UAAU,cAAc,SAAS,YAAY,MAAM,UAAU;AACxE,WAAO,aAAa,MAAM,MAAM,UAAU,KAAK;AAAA,EACjD;AAEA,eAAa,UAAU,KAAK,aAAa,UAAU;AAEnD,eAAa,UAAU,kBACnB,SAAS,gBAAgB,MAAM,UAAU;AACvC,WAAO,aAAa,MAAM,MAAM,UAAU,IAAI;AAAA,EACpD;AAEA,WAAS,cAAc;AACrB,QAAI,CAAC,KAAK,OAAO;AACf,WAAK,OAAO,eAAe,KAAK,MAAM,KAAK,MAAM;AACjD,WAAK,QAAQ;AACb,UAAI,UAAU,WAAW;AACvB,eAAO,KAAK,SAAS,KAAK,KAAK,MAAM;AACvC,aAAO,KAAK,SAAS,MAAM,KAAK,QAAQ,SAAS;AAAA,IACrD;AAAA,EACA;AAEA,WAAS,UAAU,QAAQ,MAAM,UAAU;AACzC,QAAI,QAAQ,EAAE,OAAO,OAAO,QAAQ,QAAW,QAAgB,MAAY,SAAkB;AAC7F,QAAI,UAAU,YAAY,KAAK,KAAK;AACpC,YAAQ,WAAW;AACnB,UAAM,SAAS;AACf,WAAO;AAAA,EACT;AAEA,eAAa,UAAU,OAAO,SAASC,MAAK,MAAM,UAAU;AAC1D,kBAAc,QAAQ;AACtB,SAAK,GAAG,MAAM,UAAU,MAAM,MAAM,QAAQ,CAAC;AAC7C,WAAO;AAAA,EACT;AAEA,eAAa,UAAU,sBACnB,SAAS,oBAAoB,MAAM,UAAU;AAC3C,kBAAc,QAAQ;AACtB,SAAK,gBAAgB,MAAM,UAAU,MAAM,MAAM,QAAQ,CAAC;AAC1D,WAAO;AAAA,EACb;AAGA,eAAa,UAAU,iBACnB,SAAS,eAAe,MAAM,UAAU;AACtC,QAAI,MAAMD,SAAQ,UAAU,GAAG;AAE/B,kBAAc,QAAQ;AAEtB,IAAAA,UAAS,KAAK;AACd,QAAIA,YAAW;AACb,aAAO;AAET,WAAOA,QAAO,IAAI;AAClB,QAAI,SAAS;AACX,aAAO;AAET,QAAI,SAAS,YAAY,KAAK,aAAa,UAAU;AACnD,UAAI,EAAE,KAAK,iBAAiB;AAC1B,aAAK,UAAU,uBAAO,OAAO,IAAI;AAAA,WAC9B;AACH,eAAOA,QAAO,IAAI;AAClB,YAAIA,QAAO;AACT,eAAK,KAAK,kBAAkB,MAAM,KAAK,YAAY,QAAQ;AAAA,MACvE;AAAA,IACA,WAAiB,OAAO,SAAS,YAAY;AACrC,iBAAW;AAEX,WAAK,IAAI,KAAK,SAAS,GAAG,KAAK,GAAG,KAAK;AACrC,YAAI,KAAK,CAAC,MAAM,YAAY,KAAK,CAAC,EAAE,aAAa,UAAU;AACzD,6BAAmB,KAAK,CAAC,EAAE;AAC3B,qBAAW;AACX;AAAA,QACZ;AAAA,MACA;AAEQ,UAAI,WAAW;AACb,eAAO;AAET,UAAI,aAAa;AACf,aAAK,MAAK;AAAA,WACP;AACH,kBAAU,MAAM,QAAQ;AAAA,MAClC;AAEQ,UAAI,KAAK,WAAW;AAClB,QAAAA,QAAO,IAAI,IAAI,KAAK,CAAC;AAEvB,UAAIA,QAAO,mBAAmB;AAC5B,aAAK,KAAK,kBAAkB,MAAM,oBAAoB,QAAQ;AAAA,IACxE;AAEM,WAAO;AAAA,EACb;AAEA,eAAa,UAAU,MAAM,aAAa,UAAU;AAEpD,eAAa,UAAU,qBACnB,SAAS,mBAAmB,MAAM;AAChC,QAAI,WAAWA,SAAQ;AAEvB,IAAAA,UAAS,KAAK;AACd,QAAIA,YAAW;AACb,aAAO;AAGT,QAAIA,QAAO,mBAAmB,QAAW;AACvC,UAAI,UAAU,WAAW,GAAG;AAC1B,aAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,aAAK,eAAe;AAAA,MAC9B,WAAmBA,QAAO,IAAI,MAAM,QAAW;AACrC,YAAI,EAAE,KAAK,iBAAiB;AAC1B,eAAK,UAAU,uBAAO,OAAO,IAAI;AAAA;AAEjC,iBAAOA,QAAO,IAAI;AAAA,MAC9B;AACQ,aAAO;AAAA,IACf;AAGM,QAAI,UAAU,WAAW,GAAG;AAC1B,UAAI,OAAO,OAAO,KAAKA,OAAM;AAC7B,UAAI;AACJ,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,EAAE,GAAG;AAChC,cAAM,KAAK,CAAC;AACZ,YAAI,QAAQ,iBAAkB;AAC9B,aAAK,mBAAmB,GAAG;AAAA,MACrC;AACQ,WAAK,mBAAmB,gBAAgB;AACxC,WAAK,UAAU,uBAAO,OAAO,IAAI;AACjC,WAAK,eAAe;AACpB,aAAO;AAAA,IACf;AAEM,gBAAYA,QAAO,IAAI;AAEvB,QAAI,OAAO,cAAc,YAAY;AACnC,WAAK,eAAe,MAAM,SAAS;AAAA,IAC3C,WAAiB,cAAc,QAAW;AAElC,WAAK,IAAI,UAAU,SAAS,GAAG,KAAK,GAAG,KAAK;AAC1C,aAAK,eAAe,MAAM,UAAU,CAAC,CAAC;AAAA,MAChD;AAAA,IACA;AAEM,WAAO;AAAA,EACb;AAEA,WAAS,WAAW,QAAQ,MAAM,QAAQ;AACxC,QAAIA,UAAS,OAAO;AAEpB,QAAIA,YAAW;AACb,aAAO,CAAA;AAET,QAAI,aAAaA,QAAO,IAAI;AAC5B,QAAI,eAAe;AACjB,aAAO,CAAA;AAET,QAAI,OAAO,eAAe;AACxB,aAAO,SAAS,CAAC,WAAW,YAAY,UAAU,IAAI,CAAC,UAAU;AAEnE,WAAO,SACL,gBAAgB,UAAU,IAAI,WAAW,YAAY,WAAW,MAAM;AAAA,EAC1E;AAEA,eAAa,UAAU,YAAY,SAAS,UAAU,MAAM;AAC1D,WAAO,WAAW,MAAM,MAAM,IAAI;AAAA,EACpC;AAEA,eAAa,UAAU,eAAe,SAAS,aAAa,MAAM;AAChE,WAAO,WAAW,MAAM,MAAM,KAAK;AAAA,EACrC;AAEA,eAAa,gBAAgB,SAAS,SAAS,MAAM;AACnD,QAAI,OAAO,QAAQ,kBAAkB,YAAY;AAC/C,aAAO,QAAQ,cAAc,IAAI;AAAA,IACrC,OAAS;AACL,aAAO,cAAc,KAAK,SAAS,IAAI;AAAA,IAC3C;AAAA,EACA;AAEA,eAAa,UAAU,gBAAgB;AACvC,WAAS,cAAc,MAAM;AAC3B,QAAIA,UAAS,KAAK;AAElB,QAAIA,YAAW,QAAW;AACxB,UAAI,aAAaA,QAAO,IAAI;AAE5B,UAAI,OAAO,eAAe,YAAY;AACpC,eAAO;AAAA,MACb,WAAe,eAAe,QAAW;AACnC,eAAO,WAAW;AAAA,MACxB;AAAA,IACA;AAEE,WAAO;AAAA,EACT;AAEA,eAAa,UAAU,aAAa,SAAS,aAAa;AACxD,WAAO,KAAK,eAAe,IAAI,eAAe,KAAK,OAAO,IAAI,CAAA;AAAA,EAChE;AAEA,WAAS,WAAW,KAAK,GAAG;AAC1B,QAAI,OAAO,IAAI,MAAM,CAAC;AACtB,aAAS,IAAI,GAAG,IAAI,GAAG,EAAE;AACvB,WAAK,CAAC,IAAI,IAAI,CAAC;AACjB,WAAO;AAAA,EACT;AAEA,WAAS,UAAU,MAAM,OAAO;AAC9B,WAAO,QAAQ,IAAI,KAAK,QAAQ;AAC9B,WAAK,KAAK,IAAI,KAAK,QAAQ,CAAC;AAC9B,SAAK,IAAG;AAAA,EACV;AAEA,WAAS,gBAAgB,KAAK;AAC5B,QAAI,MAAM,IAAI,MAAM,IAAI,MAAM;AAC9B,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,EAAE,GAAG;AACnC,UAAI,CAAC,IAAI,IAAI,CAAC,EAAE,YAAY,IAAI,CAAC;AAAA,IACrC;AACE,WAAO;AAAA,EACT;AAEA,WAAS,KAAK,SAAS,MAAM;AAC3B,WAAO,IAAI,QAAQ,SAAU,SAAS,QAAQ;AAC5C,eAAS,cAAc,KAAK;AAC1B,gBAAQ,eAAe,MAAM,QAAQ;AACrC,eAAO,GAAG;AAAA,MAChB;AAEI,eAAS,WAAW;AAClB,YAAI,OAAO,QAAQ,mBAAmB,YAAY;AAChD,kBAAQ,eAAe,SAAS,aAAa;AAAA,QACrD;AACM,gBAAQ,CAAA,EAAG,MAAM,KAAK,SAAS,CAAC;AAAA,MACtC;AAEI,qCAA+B,SAAS,MAAM,UAAU,EAAE,MAAM,MAAM;AACtE,UAAI,SAAS,SAAS;AACpB,sCAA8B,SAAS,eAAe,EAAE,MAAM,KAAI,CAAE;AAAA,MAC1E;AAAA,IACA,CAAG;AAAA,EACH;AAEA,WAAS,8BAA8B,SAAS,SAAS,OAAO;AAC9D,QAAI,OAAO,QAAQ,OAAO,YAAY;AACpC,qCAA+B,SAAS,SAAS,SAAS,KAAK;AAAA,IACnE;AAAA,EACA;AAEA,WAAS,+BAA+B,SAAS,MAAM,UAAU,OAAO;AACtE,QAAI,OAAO,QAAQ,OAAO,YAAY;AACpC,UAAI,MAAM,MAAM;AACd,gBAAQ,KAAK,MAAM,QAAQ;AAAA,MACjC,OAAW;AACL,gBAAQ,GAAG,MAAM,QAAQ;AAAA,MAC/B;AAAA,IACA,WAAa,OAAO,QAAQ,qBAAqB,YAAY;AAGzD,cAAQ,iBAAiB,MAAM,SAAS,aAAa,KAAK;AAGxD,YAAI,MAAM,MAAM;AACd,kBAAQ,oBAAoB,MAAM,YAAY;AAAA,QACtD;AACM,iBAAS,GAAG;AAAA,MAClB,CAAK;AAAA,IACL,OAAS;AACL,YAAM,IAAI,UAAU,wEAAwE,OAAO,OAAO;AAAA,IAC9G;AAAA,EACA;;;;ACheA,SAAS,iBAAiB;AACxB,QAAM,SAAS,UAAU,CAAC;AAE1B,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG,KAAK;AAChD,QAAI,CAAC,UAAU,CAAC,EAAG;AAEnB,eAAW,KAAK,UAAU,CAAC,EAAG,QAAO,CAAC,IAAI,UAAU,CAAC,EAAE,CAAC;AAAA,EAC1D;AAEA,SAAO;AACT;AAEA,IAAI,SAAS;AAEb,IAAI,OAAO,OAAO,WAAW,WAAY,UAAS,OAAO;AAazD,SAAS,gBAAgB,OAAO,QAAQ,QAAQ,MAAM;AACpD,QAAM,aAAa,MAAM,OAAO,IAAI,MAAM;AAE1C,MAAI,OAAO;AAEX,MAAI,CAAC,WAAY,QAAO;AAExB,MAAI,SAAS,SAAS;AACpB,WACG,WAAW,OAAO,WAAW,IAAI,MAAM,KACvC,WAAW,cAAc,WAAW,WAAW,MAAM;AAAA,EAC1D,WAAW,SAAS,YAAY;AAC9B,WAAO,WAAW,OAAO,WAAW,IAAI,MAAM;AAAA,EAChD,OAAO;AACL,WAAO,WAAW,cAAc,WAAW,WAAW,MAAM;AAAA,EAC9D;AAEA,SAAO;AACT;AAQA,SAAS,cAAc,OAAO;AAO5B,SAAO,OAAO,UAAU,YAAY,UAAU;AAChD;AAQA,SAAS,QAAQ,GAAG;AAClB,MAAI;AAEJ,OAAK,KAAK,EAAG,QAAO;AAEpB,SAAO;AACT;AASA,SAAS,gBAAgB,QAAQ,MAAM,OAAO;AAC5C,SAAO,eAAe,QAAQ,MAAM;AAAA,IAClC,YAAY;AAAA,IACZ,cAAc;AAAA,IACd,UAAU;AAAA,IACV;AAAA,EACJ,CAAG;AACH;AASA,SAAS,iBAAiB,QAAQ,MAAM,OAAO;AAC7C,QAAM,aAAa;AAAA,IACjB,YAAY;AAAA,IACZ,cAAc;AAAA,EAClB;AAEE,MAAI,OAAO,UAAU,YAAY;AAC/B,eAAW,MAAM;AAAA,EACnB,OAAO;AACL,eAAW,QAAQ;AACnB,eAAW,WAAW;AAAA,EACxB;AAEA,SAAO,eAAe,QAAQ,MAAM,UAAU;AAChD;AAOA,SAAS,cAAc,OAAO;AAC5B,MAAI,CAAC,cAAc,KAAK,EAAG,QAAO;AAElC,MAAI,MAAM,cAAc,CAAC,MAAM,QAAQ,MAAM,UAAU,EAAG,QAAO;AAEjE,SAAO;AACT;AAOA,SAAS,sCAAsC;AAC7C,MAAI,IAAI,KAAK,MAAM,KAAK,OAAM,IAAK,GAAG,IAAI;AAE1C,SAAO,MAAM;AACX,WAAO;AAAA,EACT;AACF;AAQA,SAAS,QAAQ;AACf,QAAM,YAAY;AAClB,MAAI,UAAU;AACd,MAAI,IAAI;AAER,SAAO;AAAA,IACL,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO;AAAA,IACT;AAAA,IACA,OAAO;AACL,UAAI,OAAO;AAEX,SAAG;AACD,YAAI,YAAY,MAAM;AACpB;AACA,cAAI,KAAK,UAAU,OAAQ,QAAO,EAAC,MAAM,KAAI;AAC7C,oBAAU,UAAU,CAAC,EAAE,OAAO,QAAQ,EAAC;AAAA,QACzC;AACA,eAAO,QAAQ,KAAI;AACnB,YAAI,KAAK,MAAM;AACb,oBAAU;AACV;AAAA,QACF;AACA;AAAA,MAEF,SAAS;AAET,aAAO;AAAA,IACT;AAAA,EACJ;AACA;AAEA,SAAS,gBAAgB;AACvB,SAAO;AAAA,IACL,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO;AAAA,IACT;AAAA,IACA,OAAO;AACL,aAAO,EAAC,MAAM,KAAI;AAAA,IACpB;AAAA,EACJ;AACA;AAUA,MAAM,mBAAmB,MAAM;AAAA,EAC7B,YAAY,SAAS;AACnB,UAAK;AACL,SAAK,OAAO;AACZ,SAAK,UAAU;AAAA,EACjB;AACF;AAEA,MAAM,mCAAmC,WAAW;AAAA,EAClD,YAAY,SAAS;AACnB,UAAM,OAAO;AACb,SAAK,OAAO;AAGZ,QAAI,OAAO,MAAM,sBAAsB;AACrC,YAAM;AAAA,QACJ;AAAA,QACA,2BAA2B,UAAU;AAAA,MAC7C;AAAA,EACE;AACF;AAEA,MAAM,2BAA2B,WAAW;AAAA,EAC1C,YAAY,SAAS;AACnB,UAAM,OAAO;AACb,SAAK,OAAO;AAGZ,QAAI,OAAO,MAAM,sBAAsB;AACrC,YAAM,kBAAkB,MAAM,mBAAmB,UAAU,WAAW;AAAA,EAC1E;AACF;AAEA,MAAM,wBAAwB,WAAW;AAAA,EACvC,YAAY,SAAS;AACnB,UAAM,OAAO;AACb,SAAK,OAAO;AAGZ,QAAI,OAAO,MAAM,sBAAsB;AACrC,YAAM,kBAAkB,MAAM,gBAAgB,UAAU,WAAW;AAAA,EACvE;AACF;AAoBA,SAAS,cAAc,KAAK,YAAY;AAEtC,OAAK,MAAM;AACX,OAAK,aAAa;AAElB,OAAK,MAAK;AACZ;AAEA,cAAc,UAAU,QAAQ,WAAY;AAE1C,OAAK,WAAW;AAChB,OAAK,YAAY;AACjB,OAAK,mBAAmB;AACxB,OAAK,kBAAkB;AACvB,OAAK,gBAAgB;AAGrB,OAAK,KAAK,CAAA;AACV,OAAK,MAAM,CAAA;AACX,OAAK,aAAa,CAAA;AACpB;AASA,SAAS,iBAAiB,KAAK,YAAY;AAEzC,OAAK,MAAM;AACX,OAAK,aAAa;AAElB,OAAK,MAAK;AACZ;AAEA,iBAAiB,UAAU,QAAQ,WAAY;AAE7C,OAAK,WAAW;AAChB,OAAK,YAAY;AACjB,OAAK,gBAAgB;AAGrB,OAAK,KAAK,CAAA;AACV,OAAK,MAAM,CAAA;AACb;AASA,SAAS,mBAAmB,KAAK,YAAY;AAE3C,OAAK,MAAM;AACX,OAAK,aAAa;AAElB,OAAK,MAAK;AACZ;AAEA,mBAAmB,UAAU,QAAQ,WAAY;AAE/C,OAAK,mBAAmB;AACxB,OAAK,kBAAkB;AAGvB,OAAK,aAAa,CAAA;AACpB;AAYA,SAAS,SAAS,YAAY,KAAK,QAAQ,QAAQ,YAAY;AAE7D,OAAK,MAAM;AACX,OAAK,aAAa;AAClB,OAAK,aAAa;AAGlB,OAAK,SAAS;AACd,OAAK,SAAS;AAChB;AAEA,SAAS,UAAU,SAAS,WAAY;AACtC,MAAI,SAAS;AACb,MAAI,QAAQ;AAEZ,MAAI,KAAK,WAAY,UAAS,QAAQ;AAEtC,QAAM,SAAS,KAAK,OAAO;AAC3B,QAAM,SAAS,KAAK,OAAO;AAG3B,OAAK,OAAO,MAAM,EAAE,MAAM,IAAI;AAE9B,MAAI,KAAK,cAAc,WAAW,OAAQ;AAG1C,OAAK,OAAO,KAAK,EAAE,MAAM,IAAI;AAC/B;AAEA,SAAS,UAAU,cAAc,WAAY;AAC3C,MAAI,SAAS;AACb,MAAI,QAAQ;AAEZ,QAAM,SAAS,KAAK,OAAO;AAC3B,QAAM,SAAS,KAAK,OAAO;AAE3B,MAAI,KAAK,WAAY,UAAS,QAAQ;AAGtC,QAAM,MAAM,KAAK,OAAO,MAAM;AAC9B,QAAM,OAAO,IAAI,MAAM;AAEvB,MAAI,OAAO,SAAS,aAAa;AAC/B,QAAI,MAAM,IAAI;AAGd,QAAI,EAAE,KAAK,cAAc,WAAW,SAAS;AAE3C,WAAK,OAAO,KAAK,EAAE,MAAM,IAAI;AAAA,IAC/B;AAEA;AAAA,EACF;AAGA,OAAK,WAAW;AAChB,OAAK,OAAO;AAIZ,MAAI,MAAM,IAAI;AACd,OAAK,OAAO,KAAK,EAAE,MAAM,IAAI;AAC/B;AAEA,SAAS,UAAU,SAAS,WAAY;AACtC,QAAM,SAAS,KAAK,OAAO;AAC3B,QAAM,SAAS,KAAK,OAAO;AAE3B,MAAI,SAAS;AACb,MAAI,QAAQ;AAEZ,MAAI,KAAK,WAAY,UAAS,QAAQ;AAEtC,SAAO,KAAK,OAAO,MAAM,EAAE,MAAM;AAGjC,SAAO,KAAK,OAAO,KAAK,EAAE,MAAM;AAClC;AAEA,SAAS,UAAU,cAAc,WAAY;AAC3C,QAAM,SAAS,KAAK,OAAO;AAC3B,QAAM,SAAS,KAAK,OAAO;AAE3B,MAAI,SAAS;AACb,MAAI,QAAQ;AAEZ,MAAI,KAAK,WAAY,UAAS,QAAQ;AAGtC,MAAI,KAAK,aAAa,QAAW;AAI/B,QAAI,KAAK,SAAS,QAAW;AAC3B,aAAO,KAAK,OAAO,MAAM,EAAE,MAAM;AAGjC,aAAO,KAAK,OAAO,KAAK,EAAE,MAAM;AAAA,IAClC,OAAO;AAEL,WAAK,KAAK,WAAW;AAGrB,WAAK,OAAO,MAAM,EAAE,MAAM,IAAI,KAAK;AAGnC,WAAK,OAAO,KAAK,EAAE,MAAM,IAAI,KAAK;AAAA,IACpC;AAAA,EACF,OAAO;AAEL,SAAK,SAAS,OAAO,KAAK;AAG1B,QAAI,KAAK,SAAS,QAAW;AAC3B,WAAK,KAAK,WAAW,KAAK;AAAA,IAC5B;AAAA,EACF;AACF;AAOA,MAAM,OAAO;AACb,MAAM,SAAS;AACf,MAAM,SAAS;AACf,MAAM,WAAW;AAEjB,SAAS,qBACP,OACA,QACA,MACA,YACA,YACA,MACA,MACA;AACA,MAAI,UAAU,UAAU,MAAM;AAE9B,eAAa,KAAK;AAElB,MAAI,SAAS,MAAM;AACjB,eAAW,MAAM,OAAO,IAAI,UAAU;AAEtC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,yBAAyB,UAAU;AAAA,MAC1D;AAEI,WAAO;AACP,WAAO;AAAA,EACT,WAAW,SAAS,UAAU;AAC5B,iBAAa,KAAK;AAElB,eAAW,MAAM,OAAO,IAAI,UAAU;AAEtC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,yBAAyB,UAAU;AAAA,MAC1D;AAEI,UAAM,SAAS,SAAS,OAAO;AAC/B,UAAM,SAAS,SAAS,OAAO;AAE/B,QAAI,eAAe,QAAQ;AACzB,iBAAW,SAAS;AAAA,IACtB,WAAW,eAAe,QAAQ;AAChC,iBAAW,SAAS;AAAA,IACtB,OAAO;AACL,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,UAAU,UAAU,kCAAkC,UAAU,WAAW,MAAM,KAAK,MAAM;AAAA,MACnH;AAAA,IACI;AAEA,WAAO;AACP,WAAO;AAAA,EACT,OAAO;AACL,eAAW,MAAM,OAAO,IAAI,UAAU;AAEtC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,yBAAyB,UAAU;AAAA,MAC1D;AAEI,QAAI,SAAS,QAAQ;AACnB,iBAAW,SAAS;AAAA,IACtB,OAAO;AACL,iBAAW,SAAS;AAAA,IACtB;AAEA,WAAO;AACP,WAAO;AAAA,EACT;AAEA,SAAO,CAAC,UAAU,MAAM,IAAI;AAC9B;AAEA,SAAS,0BAA0B,OAAO,QAAQ,MAAM;AACtD,QAAM,UAAU,MAAM,IAAI,SAAU,YAAY,YAAY,MAAM;AAChE,UAAM,CAAC,MAAM,IAAI,IAAI;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,WAAO,KAAK,WAAW,IAAI;AAAA,EAC7B;AACF;AAEA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AACvD,QAAM,UAAU,MAAM,IAAI,SAAU,YAAY,YAAY;AAC1D,UAAM,CAAC,IAAI,IAAI;AAAA,MACb;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,WAAO,KAAK;AAAA,EACd;AACF;AAEA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AACvD,QAAM,UAAU,MAAM,IAAI,SAAU,YAAY,YAAY,MAAM;AAChE,UAAM,CAAC,MAAM,IAAI,IAAI;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,WAAO,KAAK,WAAW,eAAe,IAAI;AAAA,EAC5C;AACF;AAEA,SAAS,0BAA0B,OAAO,QAAQ,MAAM;AACtD,QAAM,UAAU,MAAM,IAAI,SAAU,YAAY,YAAY,MAAM,MAAM;AACtE,UAAM,CAAC,MAAM,MAAM,KAAK,IAAI;AAAA,MAC1B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,SAAK,WAAW,IAAI,IAAI;AAGxB,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB;AAAA,IACN,CAAK;AAED,WAAO;AAAA,EACT;AACF;AAEA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AACvD,QAAM,UAAU,MAAM,IAAI,SAAU,YAAY,YAAY,MAAM,MAAM;AACtE,UAAM,CAAC,MAAM,MAAM,OAAO,IAAI;AAAA,MAC5B;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,QAAI,OAAO,YAAY;AACrB,YAAM,IAAI;AAAA,QACR,SAAS,MAAM;AAAA,MACvB;AAEI,UAAM,aAAa,KAAK;AACxB,UAAM,QAAQ,QAAQ,WAAW,IAAI,CAAC;AAEtC,eAAW,IAAI,IAAI;AAGnB,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB;AAAA,IACN,CAAK;AAED,WAAO;AAAA,EACT;AACF;AAEA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AACvD,QAAM,UAAU,MAAM,IAAI,SAAU,YAAY,YAAY,MAAM;AAChE,UAAM,CAAC,MAAM,IAAI,IAAI;AAAA,MACnB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,WAAO,KAAK,WAAW,IAAI;AAG3B,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB;AAAA,IACN,CAAK;AAED,WAAO;AAAA,EACT;AACF;AAEA,SAAS,6BAA6B,OAAO,QAAQ,MAAM;AACzD,QAAM,UAAU,MAAM,IAAI,SAAU,YAAY,YAAY,MAAM;AAChE,UAAM,CAAC,MAAM,UAAU,IAAI;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,QAAI,CAAC,cAAc,UAAU;AAC3B,YAAM,IAAI;AAAA,QACR,SAAS,MAAM;AAAA,MACvB;AAEI,SAAK,aAAa;AAGlB,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,IACvB,CAAK;AAED,WAAO;AAAA,EACT;AACF;AAEA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AACvD,QAAM,UAAU,MAAM,IAAI,SAAU,YAAY,YAAY,MAAM;AAChE,UAAM,CAAC,MAAM,UAAU,IAAI;AAAA,MACzB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,QAAI,CAAC,cAAc,UAAU;AAC3B,YAAM,IAAI;AAAA,QACR,SAAS,MAAM;AAAA,MACvB;AAEI,WAAO,KAAK,YAAY,UAAU;AAGlC,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB,MAAM;AAAA,IACZ,CAAK;AAED,WAAO;AAAA,EACT;AACF;AAEA,SAAS,4BAA4B,OAAO,QAAQ,MAAM;AACxD,QAAM,UAAU,MAAM,IAAI,SAAU,YAAY,YAAY,MAAM;AAChE,UAAM,CAAC,MAAM,OAAO,IAAI;AAAA,MACtB;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAEI,QAAI,OAAO,YAAY;AACrB,YAAM,IAAI;AAAA,QACR,SAAS,MAAM;AAAA,MACvB;AAEI,SAAK,aAAa,QAAQ,KAAK,UAAU;AAGzC,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,IACvB,CAAK;AAED,WAAO;AAAA,EACT;AACF;AAKA,MAAM,0BAA0B;AAAA,EAC9B;AAAA,IACE,MAAM,aAAW,MAAM,OAAO;AAAA,IAC9B,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,MAAM,OAAO;AAAA,IAC9B,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,MAAM,OAAO;AAAA,IAC9B,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,MAAM,OAAO;AAAA,IAC9B,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,SAAS,OAAO;AAAA,IACjC,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,SAAS,OAAO;AAAA,IACjC,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,UAAU,OAAO;AAAA,IAClC,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,QAAQ,OAAO;AAAA,IAChC,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,SAAS,OAAO;AAAA,IACjC,UAAU;AAAA,EACd;AACA;AAOA,SAAS,4BAA4BE,QAAO;AAC1C,0BAAwB,QAAQ,SAAU,EAAC,MAAM,SAAQ,GAAG;AAE1D,aAASA,QAAO,KAAK,MAAM,GAAG,IAAI;AAGlC,aAASA,QAAO,KAAK,QAAQ,GAAG,MAAM;AAGtC,aAASA,QAAO,KAAK,QAAQ,GAAG,MAAM;AAGtC,aAASA,QAAO,KAAK,UAAU,GAAG,QAAQ;AAAA,EAC5C,CAAC;AACH;AAcA,SAAS,0BAA0B,OAAO,QAAQ,MAAM;AAkBtD,QAAM,UAAU,MAAM,IAAI,SAAU,SAAS,MAAM;AACjD,QAAI;AAEJ,QAAI,KAAK,SAAS,WAAW,SAAS,WAAW,SAAS,KAAK;AAC7D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,4CAA4C,KAAK,IAAI;AAAA,MAC5E;AAEI,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,KAAK;AACP,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,YAAM,SAAS,KAAK;AACpB,YAAM,SAAS,KAAK;AAEpB,aAAO,UAAU,CAAC;AAElB,aAAO,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;AAEjD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,iDAAiD,MAAM,QAAQ,MAAM;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,SAAS;AACX,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,gBAAU,KAAK;AACf,aAAO,KAAK,OAAO,IAAI,OAAO;AAE9B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,yBAAyB,OAAO;AAAA,QACzD;AAAA,IACI;AAEA,WAAO,KAAK,WAAW,IAAI;AAAA,EAC7B;AACF;AASA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AAgBvD,QAAM,UAAU,MAAM,IAAI,SAAU,SAAS;AAC3C,QAAI;AAEJ,QAAI,KAAK,SAAS,WAAW,SAAS,WAAW,SAAS,KAAK;AAC7D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,4CAA4C,KAAK,IAAI;AAAA,MAC5E;AAEI,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,KAAK;AACP,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,YAAM,SAAS,KAAK,SAClB,SAAS,KAAK,UAAU,CAAC;AAE3B,aAAO,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;AAEjD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,iDAAiD,MAAM,QAAQ,MAAM;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,SAAS;AACX,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,gBAAU,KAAK;AACf,aAAO,KAAK,OAAO,IAAI,OAAO;AAE9B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,yBAAyB,OAAO;AAAA,QACzD;AAAA,IACI;AAEA,WAAO,KAAK;AAAA,EACd;AACF;AASA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AAkBvD,QAAM,UAAU,MAAM,IAAI,SAAU,SAAS,MAAM;AACjD,QAAI;AAEJ,QAAI,KAAK,SAAS,WAAW,SAAS,WAAW,SAAS,KAAK;AAC7D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,4CAA4C,KAAK,IAAI;AAAA,MAC5E;AAEI,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,KAAK;AACP,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,YAAM,SAAS,KAAK;AACpB,YAAM,SAAS,KAAK;AAEpB,aAAO,UAAU,CAAC;AAElB,aAAO,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;AAEjD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,iDAAiD,MAAM,QAAQ,MAAM;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,SAAS;AACX,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,gBAAU,KAAK;AACf,aAAO,KAAK,OAAO,IAAI,OAAO;AAE9B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,yBAAyB,OAAO;AAAA,QACzD;AAAA,IACI;AAEA,WAAO,KAAK,WAAW,eAAe,IAAI;AAAA,EAC5C;AACF;AASA,SAAS,0BAA0B,OAAO,QAAQ,MAAM;AAoBtD,QAAM,UAAU,MAAM,IAAI,SAAU,SAAS,MAAM,OAAO;AACxD,QAAI;AAEJ,QAAI,KAAK,SAAS,WAAW,SAAS,WAAW,SAAS,KAAK;AAC7D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,4CAA4C,KAAK,IAAI;AAAA,MAC5E;AAEI,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,KAAK;AACP,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,YAAM,SAAS,KAAK;AACpB,YAAM,SAAS,KAAK;AAEpB,aAAO,UAAU,CAAC;AAClB,cAAQ,UAAU,CAAC;AAEnB,aAAO,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;AAEjD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,iDAAiD,MAAM,QAAQ,MAAM;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,SAAS;AACX,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,gBAAU,KAAK;AACf,aAAO,KAAK,OAAO,IAAI,OAAO;AAE9B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,yBAAyB,OAAO;AAAA,QACzD;AAAA,IACI;AAEA,SAAK,WAAW,IAAI,IAAI;AAGxB,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB;AAAA,IACN,CAAK;AAED,WAAO;AAAA,EACT;AACF;AASA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AAqBvD,QAAM,UAAU,MAAM,IAAI,SAAU,SAAS,MAAM,SAAS;AAC1D,QAAI;AAEJ,QAAI,KAAK,SAAS,WAAW,SAAS,WAAW,SAAS,KAAK;AAC7D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,4CAA4C,KAAK,IAAI;AAAA,MAC5E;AAEI,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,KAAK;AACP,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,YAAM,SAAS,KAAK;AACpB,YAAM,SAAS,KAAK;AAEpB,aAAO,UAAU,CAAC;AAClB,gBAAU,UAAU,CAAC;AAErB,aAAO,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;AAEjD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,iDAAiD,MAAM,QAAQ,MAAM;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,SAAS;AACX,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,gBAAU,KAAK;AACf,aAAO,KAAK,OAAO,IAAI,OAAO;AAE9B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,yBAAyB,OAAO;AAAA,QACzD;AAAA,IACI;AAEA,QAAI,OAAO,YAAY;AACrB,YAAM,IAAI;AAAA,QACR,SAAS,MAAM;AAAA,MACvB;AAEI,SAAK,WAAW,IAAI,IAAI,QAAQ,KAAK,WAAW,IAAI,CAAC;AAGrD,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB;AAAA,IACN,CAAK;AAED,WAAO;AAAA,EACT;AACF;AASA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AAkBvD,QAAM,UAAU,MAAM,IAAI,SAAU,SAAS,MAAM;AACjD,QAAI;AAEJ,QAAI,KAAK,SAAS,WAAW,SAAS,WAAW,SAAS,KAAK;AAC7D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,4CAA4C,KAAK,IAAI;AAAA,MAC5E;AAEI,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,KAAK;AACP,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,YAAM,SAAS,KAAK;AACpB,YAAM,SAAS,KAAK;AAEpB,aAAO,UAAU,CAAC;AAElB,aAAO,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;AAEjD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,iDAAiD,MAAM,QAAQ,MAAM;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,SAAS;AACX,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,gBAAU,KAAK;AACf,aAAO,KAAK,OAAO,IAAI,OAAO;AAE9B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,yBAAyB,OAAO;AAAA,QACzD;AAAA,IACI;AAEA,WAAO,KAAK,WAAW,IAAI;AAG3B,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB;AAAA,IACN,CAAK;AAED,WAAO;AAAA,EACT;AACF;AASA,SAAS,6BAA6B,OAAO,QAAQ,MAAM;AAkBzD,QAAM,UAAU,MAAM,IAAI,SAAU,SAAS,YAAY;AACvD,QAAI;AAEJ,QAAI,KAAK,SAAS,WAAW,SAAS,WAAW,SAAS,KAAK;AAC7D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,4CAA4C,KAAK,IAAI;AAAA,MAC5E;AAEI,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,KAAK;AACP,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,YAAM,SAAS,KAAK,SAClB,SAAS,KAAK;AAEhB,mBAAa,UAAU,CAAC;AAExB,aAAO,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;AAEjD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,iDAAiD,MAAM,QAAQ,MAAM;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,SAAS;AACX,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,gBAAU,KAAK;AACf,aAAO,KAAK,OAAO,IAAI,OAAO;AAE9B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,yBAAyB,OAAO;AAAA,QACzD;AAAA,IACI;AAEA,QAAI,CAAC,cAAc,UAAU;AAC3B,YAAM,IAAI;AAAA,QACR,SAAS,MAAM;AAAA,MACvB;AAEI,SAAK,aAAa;AAGlB,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,IACvB,CAAK;AAED,WAAO;AAAA,EACT;AACF;AASA,SAAS,2BAA2B,OAAO,QAAQ,MAAM;AAkBvD,QAAM,UAAU,MAAM,IAAI,SAAU,SAAS,YAAY;AACvD,QAAI;AAEJ,QAAI,KAAK,SAAS,WAAW,SAAS,WAAW,SAAS,KAAK;AAC7D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,4CAA4C,KAAK,IAAI;AAAA,MAC5E;AAEI,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,KAAK;AACP,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,YAAM,SAAS,KAAK,SAClB,SAAS,KAAK;AAEhB,mBAAa,UAAU,CAAC;AAExB,aAAO,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;AAEjD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,iDAAiD,MAAM,QAAQ,MAAM;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,SAAS;AACX,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,gBAAU,KAAK;AACf,aAAO,KAAK,OAAO,IAAI,OAAO;AAE9B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,yBAAyB,OAAO;AAAA,QACzD;AAAA,IACI;AAEA,QAAI,CAAC,cAAc,UAAU;AAC3B,YAAM,IAAI;AAAA,QACR,SAAS,MAAM;AAAA,MACvB;AAEI,WAAO,KAAK,YAAY,UAAU;AAGlC,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB,MAAM;AAAA,IACZ,CAAK;AAED,WAAO;AAAA,EACT;AACF;AASA,SAAS,4BAA4B,OAAO,QAAQ,MAAM;AAkBxD,QAAM,UAAU,MAAM,IAAI,SAAU,SAAS,SAAS;AACpD,QAAI;AAEJ,QAAI,KAAK,SAAS,WAAW,SAAS,WAAW,SAAS,KAAK;AAC7D,YAAM,IAAI;AAAA,QACR,SAAS,MAAM,4CAA4C,KAAK,IAAI;AAAA,MAC5E;AAEI,QAAI,UAAU,SAAS,GAAG;AACxB,UAAI,KAAK;AACP,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,YAAM,SAAS,KAAK,SAClB,SAAS,KAAK;AAEhB,gBAAU,UAAU,CAAC;AAErB,aAAO,gBAAgB,MAAM,QAAQ,QAAQ,IAAI;AAEjD,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,iDAAiD,MAAM,QAAQ,MAAM;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,SAAS;AACX,cAAM,IAAI;AAAA,UACR,SAAS,MAAM;AAAA,QACzB;AAEM,gBAAU,KAAK;AACf,aAAO,KAAK,OAAO,IAAI,OAAO;AAE9B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,MAAM,yBAAyB,OAAO;AAAA,QACzD;AAAA,IACI;AAEA,QAAI,OAAO,YAAY;AACrB,YAAM,IAAI;AAAA,QACR,SAAS,MAAM;AAAA,MACvB;AAEI,SAAK,aAAa,QAAQ,KAAK,UAAU;AAGzC,SAAK,KAAK,yBAAyB;AAAA,MACjC,KAAK,KAAK;AAAA,MACV,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,IACvB,CAAK;AAED,WAAO;AAAA,EACT;AACF;AAKA,MAAM,0BAA0B;AAAA,EAC9B;AAAA,IACE,MAAM,aAAW,MAAM,OAAO;AAAA,IAC9B,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,MAAM,OAAO;AAAA,IAC9B,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,MAAM,OAAO;AAAA,IAC9B,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,MAAM,OAAO;AAAA,IAC9B,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,SAAS,OAAO;AAAA,IACjC,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,SAAS,OAAO;AAAA,IACjC,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,UAAU,OAAO;AAAA,IAClC,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,QAAQ,OAAO;AAAA,IAChC,UAAU;AAAA,EACd;AAAA,EACE;AAAA,IACE,MAAM,aAAW,SAAS,OAAO;AAAA,IACjC,UAAU;AAAA,EACd;AACA;AAOA,SAAS,4BAA4BA,QAAO;AAC1C,0BAAwB,QAAQ,SAAU,EAAC,MAAM,SAAQ,GAAG;AAE1D,aAASA,QAAO,KAAK,MAAM,GAAG,OAAO;AAGrC,aAASA,QAAO,KAAK,cAAc,GAAG,UAAU;AAGhD,aAASA,QAAO,KAAK,gBAAgB,GAAG,YAAY;AAAA,EACtD,CAAC;AACH;AAaA,MAAM,kBAAkB;AAAA,EACtB;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,EACV;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,WAAW;AAAA,EACf;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,WAAW;AAAA,EACf;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,WAAW;AAAA,EACf;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,WAAW;AAAA,EACf;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,EACV;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,EACV;AACA;AAQA,SAAS,cAAc,WAAW,QAAQ,UAAU,OAAO;AACzD,MAAI,cAAc;AAElB,aAAW,KAAK,QAAQ;AACtB,QAAI,MAAM,MAAO;AAEjB,UAAM,WAAW,OAAO,CAAC;AAEzB,kBAAc;AAAA,MACZ,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS,OAAO;AAAA,MAChB,SAAS,OAAO;AAAA,MAChB,SAAS,OAAO;AAAA,MAChB,SAAS,OAAO;AAAA,MAChB,SAAS;AAAA,IACf;AAEI,QAAI,aAAa,YAAa,QAAO,SAAS;AAAA,EAChD;AAEA;AACF;AAEA,SAAS,aAAa,WAAW,QAAQ,UAAU,OAAO;AACxD,MAAI,UAAU,QAAQ;AAEtB,MAAI,cAAc;AAElB,aAAW,KAAK,QAAQ;AACtB,QAAI,MAAM,MAAO;AAEjB,eAAW,OAAO,CAAC;AAEnB,OAAG;AACD,eAAS,SAAS;AAClB,eAAS,SAAS;AAElB,oBAAc;AAAA,QACZ,SAAS;AAAA,QACT,SAAS;AAAA,QACT,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,OAAO;AAAA,QACP,SAAS;AAAA,MACjB;AAEM,UAAI,aAAa,YAAa,QAAO,SAAS;AAE9C,iBAAW,SAAS;AAAA,IACtB,SAAS,aAAa;AAAA,EACxB;AAEA;AACF;AAQA,SAAS,eAAe,QAAQ,OAAO;AACrC,QAAM,OAAO,OAAO,KAAK,MAAM;AAC/B,QAAM,IAAI,KAAK;AAEf,MAAI;AACJ,MAAI,IAAI;AAER,SAAO;AAAA,IACL,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO;AAAA,IACT;AAAA,IACA,OAAO;AACL,SAAG;AACD,YAAI,CAAC,UAAU;AACb,cAAI,KAAK,EAAG,QAAO,EAAC,MAAM,KAAI;AAE9B,gBAAM,IAAI,KAAK,GAAG;AAElB,cAAI,MAAM,OAAO;AACf,uBAAW;AACX;AAAA,UACF;AAEA,qBAAW,OAAO,CAAC;AAAA,QACrB,OAAO;AACL,qBAAW,SAAS;AAAA,QACtB;AAAA,MACF,SAAS,CAAC;AAEV,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO;AAAA,UACL,MAAM,SAAS;AAAA,UACf,YAAY,SAAS;AAAA,UACrB,QAAQ,SAAS,OAAO;AAAA,UACxB,QAAQ,SAAS,OAAO;AAAA,UACxB,kBAAkB,SAAS,OAAO;AAAA,UAClC,kBAAkB,SAAS,OAAO;AAAA,UAClC,YAAY,SAAS;AAAA,QAC/B;AAAA,MACA;AAAA,IACI;AAAA,EACJ;AACA;AAUA,SAAS,oBAAoB,WAAW,QAAQ,GAAG,UAAU;AAC3D,QAAM,WAAW,OAAO,CAAC;AAEzB,MAAI,CAAC,SAAU;AAEf,QAAM,aAAa,SAAS;AAC5B,QAAM,aAAa,SAAS;AAE5B,MACE;AAAA,IACE,SAAS;AAAA,IACT,SAAS;AAAA,IACT,WAAW;AAAA,IACX,WAAW;AAAA,IACX,WAAW;AAAA,IACX,WAAW;AAAA,IACX,SAAS;AAAA,EACf,KACI;AAEA,WAAO,SAAS;AACpB;AAEA,SAAS,mBAAmB,WAAW,QAAQ,GAAG,UAAU;AAC1D,MAAI,WAAW,OAAO,CAAC;AAEvB,MAAI,CAAC,SAAU;AAEf,MAAI,cAAc;AAElB,KAAG;AACD,kBAAc;AAAA,MACZ,SAAS;AAAA,MACT,SAAS;AAAA,MACT,SAAS,OAAO;AAAA,MAChB,SAAS,OAAO;AAAA,MAChB,SAAS,OAAO;AAAA,MAChB,SAAS,OAAO;AAAA,MAChB,SAAS;AAAA,IACf;AAEI,QAAI,aAAa,YAAa,QAAO,SAAS;AAE9C,eAAW,SAAS;AAAA,EACtB,SAAS,aAAa;AAEtB;AACF;AASA,SAAS,qBAAqB,QAAQ,GAAG;AACvC,MAAI,WAAW,OAAO,CAAC;AAEvB,MAAI,SAAS,SAAS,QAAW;AAC/B,WAAO;AAAA,MACL,CAAC,OAAO,QAAQ,IAAI;AAClB,eAAO;AAAA,MACT;AAAA,MACA,OAAO;AACL,YAAI,CAAC,SAAU,QAAO,EAAC,MAAM,KAAI;AAEjC,cAAM,QAAQ;AAAA,UACZ,MAAM,SAAS;AAAA,UACf,YAAY,SAAS;AAAA,UACrB,QAAQ,SAAS,OAAO;AAAA,UACxB,QAAQ,SAAS,OAAO;AAAA,UACxB,kBAAkB,SAAS,OAAO;AAAA,UAClC,kBAAkB,SAAS,OAAO;AAAA,UAClC,YAAY,SAAS;AAAA,QAC/B;AAEQ,mBAAW,SAAS;AAEpB,eAAO;AAAA,UACL,MAAM;AAAA,UACN;AAAA,QACV;AAAA,MACM;AAAA,IACN;AAAA,EACE;AAEA,MAAI,OAAO;AACX,SAAO;AAAA,IACL,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO;AAAA,IACT;AAAA,IACA,OAAO;AACL,UAAI,SAAS,KAAM,QAAO,EAAC,MAAM,KAAI;AACrC,aAAO;AACP,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO;AAAA,UACL,MAAM,SAAS;AAAA,UACf,YAAY,SAAS;AAAA,UACrB,QAAQ,SAAS,OAAO;AAAA,UACxB,QAAQ,SAAS,OAAO;AAAA,UACxB,kBAAkB,SAAS,OAAO;AAAA,UAClC,kBAAkB,SAAS,OAAO;AAAA,UAClC,YAAY,SAAS;AAAA,QAC/B;AAAA,MACA;AAAA,IACI;AAAA,EACJ;AACA;AASA,SAAS,gBAAgB,OAAO,MAAM;AACpC,MAAI,MAAM,SAAS,EAAG,QAAO,CAAA;AAE7B,MAAI,SAAS,WAAW,SAAS,MAAM,MAAM;AAC3C,WAAO,MAAM,KAAK,MAAM,OAAO,KAAI,CAAE;AAAA,EACvC;AAEA,QAAM,OACJ,SAAS,eAAe,MAAM,iBAAiB,MAAM;AAEvD,QAAM,OAAO,IAAI,MAAM,IAAI,GACzB,OAAO,SAAS;AAElB,QAAMC,YAAW,MAAM,OAAO,OAAM;AAEpC,MAAI,IAAI;AACR,MAAI,MAAM;AAEV,SAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,WAAO,KAAK;AAEZ,QAAI,KAAK,eAAe,KAAM,MAAK,GAAG,IAAI,KAAK;AAAA,EACjD;AAEA,SAAO;AACT;AAUA,SAAS,YAAY,WAAW,OAAO,MAAM,UAAU;AACrD,MAAI,MAAM,SAAS,EAAG;AAEtB,QAAM,eAAe,SAAS,WAAW,SAAS,MAAM;AACxD,QAAM,OAAO,SAAS;AAEtB,MAAI,MAAM;AACV,MAAI,cAAc;AAClB,QAAMA,YAAW,MAAM,OAAO,OAAM;AAEpC,SAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,WAAO,KAAK;AAEZ,QAAI,gBAAgB,KAAK,eAAe,KAAM;AAE9C,UAAM,EAAC,KAAK,YAAY,QAAQ,OAAM,IAAI;AAE1C,kBAAc;AAAA,MACZ;AAAA,MACA;AAAA,MACA,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,OAAO;AAAA,MACP,KAAK;AAAA,IACX;AAEI,QAAI,aAAa,YAAa,QAAO;AAAA,EACvC;AAEA;AACF;AASA,SAAS,mBAAmB,OAAO,MAAM;AACvC,MAAI,MAAM,SAAS,EAAG,QAAO,cAAa;AAE1C,QAAM,eAAe,SAAS,WAAW,SAAS,MAAM;AACxD,QAAM,OAAO,SAAS;AAEtB,QAAMA,YAAW,MAAM,OAAO,OAAM;AAEpC,SAAO;AAAA,IACL,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO;AAAA,IACT;AAAA,IACA,OAAO;AACL,UAAI,MAAM;AAGV,aAAO,MAAM;AACX,eAAOA,UAAS,KAAI;AAEpB,YAAI,KAAK,KAAM,QAAO;AAEtB,eAAO,KAAK;AAEZ,YAAI,gBAAgB,KAAK,eAAe,KAAM;AAE9C;AAAA,MACF;AAEA,YAAM,QAAQ;AAAA,QACZ,MAAM,KAAK;AAAA,QACX,YAAY,KAAK;AAAA,QACjB,QAAQ,KAAK,OAAO;AAAA,QACpB,QAAQ,KAAK,OAAO;AAAA,QACpB,kBAAkB,KAAK,OAAO;AAAA,QAC9B,kBAAkB,KAAK,OAAO;AAAA,QAC9B,YAAY,KAAK;AAAA,MACzB;AAEM,aAAO,EAAC,OAAO,MAAM,MAAK;AAAA,IAC5B;AAAA,EACJ;AACA;AAWA,SAAS,mBACP,WACA,OACA,MACA,WACA,UACA,UACA;AACA,QAAM,KAAK,QAAQ,eAAe;AAElC,MAAI;AAEJ,MAAI,SAAS,cAAc;AACzB,QAAI,cAAc,OAAO;AACvB,cAAQ,GAAG,WAAW,SAAS,IAAI,QAAQ;AAE3C,UAAI,aAAa,MAAO,QAAO;AAAA,IACjC;AACA,QAAI,cAAc,MAAM;AACtB,cAAQ;AAAA,QACN;AAAA,QACA,SAAS;AAAA,QACT;AAAA,QACA,CAAC,YAAY,SAAS,MAAM;AAAA,MACpC;AAEM,UAAI,aAAa,MAAO,QAAO;AAAA,IACjC;AAAA,EACF;AAEA,MAAI,SAAS,YAAY;AACvB,YAAQ,GAAG,WAAW,SAAS,YAAY,QAAQ;AAEnD,QAAI,aAAa,MAAO,QAAO;AAAA,EACjC;AAEA;AACF;AAWA,SAAS,uBAAuB,OAAO,MAAM,WAAW,UAAU;AAChE,QAAM,QAAQ,CAAA;AAEd,qBAAmB,OAAO,OAAO,MAAM,WAAW,UAAU,SAAU,KAAK;AACzE,UAAM,KAAK,GAAG;AAAA,EAChB,CAAC;AAED,SAAO;AACT;AAUA,SAAS,0BAA0B,MAAM,WAAW,UAAU;AAC5D,MAAIA,YAAW,cAAa;AAE5B,MAAI,SAAS,cAAc;AACzB,QAAI,cAAc,SAAS,OAAO,SAAS,OAAO;AAChD,MAAAA,YAAW,MAAMA,WAAU,eAAe,SAAS,EAAE,CAAC;AACxD,QAAI,cAAc,QAAQ,OAAO,SAAS,QAAQ;AAChD,MAAAA,YAAW;AAAA,QACTA;AAAA,QACA,eAAe,SAAS,KAAK,CAAC,YAAY,SAAS,MAAM,MAAS;AAAA,MAC1E;AAAA,EACE;AAEA,MAAI,SAAS,cAAc,OAAO,SAAS,eAAe,aAAa;AACrE,IAAAA,YAAW,MAAMA,WAAU,eAAe,SAAS,UAAU,CAAC;AAAA,EAChE;AAEA,SAAOA;AACT;AAaA,SAAS,mBACP,WACA,MACA,OACA,WACA,YACA,QACA,UACA;AACA,QAAM,KAAK,QAAQ,qBAAqB;AAExC,MAAI;AAEJ,MAAI,SAAS,cAAc;AACzB,QAAI,OAAO,WAAW,OAAO,eAAe,cAAc,OAAO;AAC/D,cAAQ,GAAG,WAAW,WAAW,IAAI,QAAQ,QAAQ;AAErD,UAAI,aAAa,MAAO,QAAO;AAAA,IACjC;AAEA,QACE,OAAO,WAAW,QAAQ,eAC1B,cAAc,SACb,aAAa,WAAW,QAAQ,SACjC;AACA,cAAQ,GAAG,WAAW,WAAW,KAAK,QAAQ,QAAQ;AAEtD,UAAI,aAAa,MAAO,QAAO;AAAA,IACjC;AAAA,EACF;AAEA,MAAI,SAAS,YAAY;AACvB,QAAI,OAAO,WAAW,eAAe,aAAa;AAChD,cAAQ,GAAG,WAAW,WAAW,YAAY,QAAQ,QAAQ;AAE7D,UAAI,aAAa,MAAO,QAAO;AAAA,IACjC;AAAA,EACF;AAEA;AACF;AAYA,SAAS,uBAAuB,MAAM,OAAO,WAAW,YAAY,QAAQ;AAC1E,QAAM,QAAQ,CAAA;AAEd;AAAA,IACE;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA,SAAU,KAAK;AACb,YAAM,KAAK,GAAG;AAAA,IAChB;AAAA,EACJ;AAEE,SAAO;AACT;AAWA,SAAS,0BAA0B,MAAM,WAAW,YAAY,QAAQ;AACtE,MAAIA,YAAW,cAAa;AAE5B,MAAI,SAAS,cAAc;AACzB,QACE,OAAO,WAAW,OAAO,eACzB,cAAc,SACd,UAAU,WAAW;AAErB,MAAAA,YAAW,MAAMA,WAAU,qBAAqB,WAAW,IAAI,MAAM,CAAC;AAExE,QACE,OAAO,WAAW,QAAQ,eAC1B,cAAc,QACd,UAAU,WAAW,QACpB,aAAa,WAAW,QAAQ;AAEjC,MAAAA,YAAW,MAAMA,WAAU,qBAAqB,WAAW,KAAK,MAAM,CAAC;AAAA,EAC3E;AAEA,MAAI,SAAS,YAAY;AACvB,QACE,OAAO,WAAW,eAAe,eACjC,UAAU,WAAW;AAErB,MAAAA,YAAW;AAAA,QACTA;AAAA,QACA,qBAAqB,WAAW,YAAY,MAAM;AAAA,MAC1D;AAAA,EACE;AAEA,SAAOA;AACT;AAQA,SAAS,uBAAuB,OAAO,aAAa;AAClD,QAAM,EAAC,MAAM,MAAM,UAAS,IAAI;AAkBhC,QAAM,UAAU,IAAI,IAAI,SAAU,QAAQ,QAAQ;AAEhD,QAAI,SAAS,WAAW,KAAK,SAAS,WAAW,SAAS,KAAK;AAC7D,aAAO,CAAA;AAET,QAAI,CAAC,UAAU,OAAQ,QAAO,gBAAgB,MAAM,IAAI;AAExD,QAAI,UAAU,WAAW,GAAG;AAC1B,eAAS,KAAK;AAEd,YAAM,WAAW,KAAK,OAAO,IAAI,MAAM;AAEvC,UAAI,OAAO,aAAa;AACtB,cAAM,IAAI;AAAA,UACR,SAAS,IAAI,yBAAyB,MAAM;AAAA,QACtD;AAGM,aAAO;AAAA,QACL,KAAK;AAAA,QACL,SAAS,UAAU,KAAK,OAAO;AAAA,QAC/B;AAAA,QACA;AAAA,MACR;AAAA,IACI;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,eAAS,KAAK;AACd,eAAS,KAAK;AAEd,YAAM,aAAa,KAAK,OAAO,IAAI,MAAM;AAEzC,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,IAAI,0BAA0B,MAAM;AAAA,QACvD;AAEM,UAAI,CAAC,KAAK,OAAO,IAAI,MAAM;AACzB,cAAM,IAAI;AAAA,UACR,SAAS,IAAI,0BAA0B,MAAM;AAAA,QACvD;AAGM,aAAO;AAAA,QACL;AAAA,QACA,KAAK;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,MACR;AAAA,IACI;AAEA,UAAM,IAAI;AAAA,MACR,SAAS,IAAI,qDAAqD,UAAU,MAAM;AAAA,IACxF;AAAA,EACE;AACF;AAQA,SAAS,kBAAkB,OAAO,aAAa;AAC7C,QAAM,EAAC,MAAM,MAAM,UAAS,IAAI;AAEhC,QAAM,cAAc,YAAY,KAAK,CAAC,EAAE,YAAW,IAAK,KAAK,MAAM,GAAG,EAAE;AAsBxE,QAAM,UAAU,WAAW,IAAI,SAAU,QAAQ,QAAQ,UAAU;AAEjE,QAAI,SAAS,WAAW,KAAK,SAAS,WAAW,SAAS,KAAK,KAAM;AAErE,QAAI,UAAU,WAAW,GAAG;AAC1B,iBAAW;AACX,aAAO,YAAY,OAAO,MAAM,MAAM,QAAQ;AAAA,IAChD;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,eAAS,KAAK;AACd,iBAAW;AAEX,YAAM,WAAW,KAAK,OAAO,IAAI,MAAM;AAEvC,UAAI,OAAO,aAAa;AACtB,cAAM,IAAI;AAAA,UACR,SAAS,WAAW,yBAAyB,MAAM;AAAA,QAC7D;AAIM,aAAO;AAAA,QACL;AAAA,QACA,KAAK;AAAA,QACL,SAAS,UAAU,KAAK,OAAO;AAAA,QAC/B;AAAA,QACA;AAAA,QACA;AAAA,MACR;AAAA,IACI;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,eAAS,KAAK;AACd,eAAS,KAAK;AAEd,YAAM,aAAa,KAAK,OAAO,IAAI,MAAM;AAEzC,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,WAAW,0BAA0B,MAAM;AAAA,QAC9D;AAEM,UAAI,CAAC,KAAK,OAAO,IAAI,MAAM;AACzB,cAAM,IAAI;AAAA,UACR,SAAS,WAAW,0BAA0B,MAAM;AAAA,QAC9D;AAGM,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACR;AAAA,IACI;AAEA,UAAM,IAAI;AAAA,MACR,SAAS,WAAW,qDAAqD,UAAU,MAAM;AAAA,IAC/F;AAAA,EACE;AAsBA,QAAM,UAAU,QAAQ,KAAK,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;AAE5D,QAAM,UAAU,OAAO,IAAI,WAAY;AACrC,UAAM,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AACjD,UAAM,WAAW,KAAK,IAAG;AAEzB,QAAI;AAGJ,QAAI,KAAK,WAAW,GAAG;AACrB,UAAI,SAAS;AAEb,UAAI,SAAS,WAAY,WAAU,KAAK;AACxC,UAAI,SAAS,aAAc,WAAU,KAAK;AAE1C,eAAS,IAAI,MAAM,MAAM;AAEzB,UAAI,IAAI;AAER,WAAK,KAAK,CAAC,GAAG,IAAI,GAAGC,IAAG,IAAI,IAAI,MAAM;AACpC,eAAO,GAAG,IAAI,SAAS,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,CAAC;AAAA,MAC/C,CAAC;AAAA,IACH,OAIK;AACH,eAAS,CAAA;AAET,WAAK,KAAK,CAAC,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,MAAM;AACpC,eAAO,KAAK,SAAS,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,CAAC,CAAC;AAAA,MAC9C,CAAC;AAAA,IACH;AAEA,SAAK,WAAW,EAAE,MAAM,MAAM,IAAI;AAElC,WAAO;AAAA,EACT;AAsBA,QAAM,aAAa,WAAW,KAAK,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;AAElE,QAAM,UAAU,UAAU,IAAI,WAAY;AACxC,UAAM,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AACjD,UAAM,WAAW,KAAK,IAAG;AAEzB,UAAM,SAAS,CAAA;AAEf,SAAK,KAAK,CAAC,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,MAAM;AACpC,UAAI,SAAS,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,CAAC,EAAG,QAAO,KAAK,CAAC;AAAA,IACrD,CAAC;AAED,SAAK,WAAW,EAAE,MAAM,MAAM,IAAI;AAElC,WAAO;AAAA,EACT;AAyBA,QAAM,aAAa,WAAW,KAAK,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;AAElE,QAAM,UAAU,UAAU,IAAI,WAAY;AACxC,QAAI,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AAE/C,QAAI,KAAK,SAAS,KAAK,KAAK,SAAS,GAAG;AACtC,YAAM,IAAI;AAAA,QACR,SAAS,UAAU,8DAA8D,KAAK,MAAM;AAAA,MACpG;AAAA,IACI;AAEA,QACE,OAAO,KAAK,KAAK,SAAS,CAAC,MAAM,cACjC,OAAO,KAAK,KAAK,SAAS,CAAC,MAAM,YACjC;AACA,YAAM,IAAI;AAAA,QACR,SAAS,UAAU;AAAA,MAC3B;AAAA,IACI;AAEA,QAAI;AACJ,QAAI;AAEJ,QAAI,KAAK,WAAW,GAAG;AACrB,iBAAW,KAAK,CAAC;AACjB,qBAAe,KAAK,CAAC;AACrB,aAAO,CAAA;AAAA,IACT,WAAW,KAAK,WAAW,GAAG;AAC5B,iBAAW,KAAK,CAAC;AACjB,qBAAe,KAAK,CAAC;AACrB,aAAO,CAAC,KAAK,CAAC,CAAC;AAAA,IACjB,WAAW,KAAK,WAAW,GAAG;AAC5B,iBAAW,KAAK,CAAC;AACjB,qBAAe,KAAK,CAAC;AACrB,aAAO,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC;AAAA,IAC1B;AAEA,QAAI,cAAc;AAElB,SAAK,KAAK,CAAC,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,MAAM;AACpC,oBAAc,SAAS,aAAa,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,CAAC;AAAA,IAC5D,CAAC;AAED,SAAK,WAAW,EAAE,MAAM,MAAM,IAAI;AAElC,WAAO;AAAA,EACT;AACF;AASA,SAAS,eAAe,OAAO,aAAa;AAC1C,QAAM,EAAC,MAAM,MAAM,UAAS,IAAI;AAEhC,QAAM,eAAe,SAAS,KAAK,CAAC,EAAE,YAAW,IAAK,KAAK,MAAM,GAAG,EAAE;AAsBtE,QAAM,UAAU,YAAY,IAAI,SAAU,QAAQ,QAAQ,UAAU;AAElE,QAAI,SAAS,WAAW,KAAK,SAAS,WAAW,SAAS,KAAK;AAC7D,aAAO;AAET,QAAI,UAAU,WAAW,GAAG;AAC1B,iBAAW;AACX,aAAO,YAAY,MAAM,MAAM,MAAM,QAAQ;AAAA,IAC/C;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,eAAS,KAAK;AACd,iBAAW;AAEX,YAAM,WAAW,KAAK,OAAO,IAAI,MAAM;AAEvC,UAAI,OAAO,aAAa;AACtB,cAAM,IAAI;AAAA,UACR,SAAS,YAAY,yBAAyB,MAAM;AAAA,QAC9D;AAIM,aAAO;AAAA,QACL;AAAA,QACA,KAAK;AAAA,QACL,SAAS,UAAU,KAAK,OAAO;AAAA,QAC/B;AAAA,QACA;AAAA,QACA;AAAA,MACR;AAAA,IACI;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,eAAS,KAAK;AACd,eAAS,KAAK;AAEd,YAAM,aAAa,KAAK,OAAO,IAAI,MAAM;AAEzC,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,YAAY,0BAA0B,MAAM;AAAA,QAC/D;AAEM,UAAI,CAAC,KAAK,OAAO,IAAI,MAAM;AACzB,cAAM,IAAI;AAAA,UACR,SAAS,YAAY,0BAA0B,MAAM;AAAA,QAC/D;AAGM,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA,KAAK;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACR;AAAA,IACI;AAEA,UAAM,IAAI;AAAA,MACR,SAAS,YAAY,qDAAqD,UAAU,MAAM;AAAA,IAChG;AAAA,EACE;AAsBA,QAAM,WAAW,SAAS,KAAK,CAAC,EAAE,YAAW,IAAK,KAAK,MAAM,GAAG,EAAE;AAElE,QAAM,UAAU,QAAQ,IAAI,WAAY;AACtC,UAAM,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AACjD,UAAM,WAAW,KAAK,IAAG;AAEzB,SAAK,KAAK,CAAC,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,MAAM;AACpC,aAAO,SAAS,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,CAAC;AAAA,IACxC,CAAC;AAED,UAAM,QAAQ,KAAK,YAAY,EAAE,MAAM,MAAM,IAAI;AAEjD,QAAI,MAAO,QAAO;AAElB,WAAO;AAAA,EACT;AAsBA,QAAM,YAAY,UAAU,KAAK,CAAC,EAAE,YAAW,IAAK,KAAK,MAAM,GAAG,EAAE;AAEpE,QAAM,UAAU,SAAS,IAAI,WAAY;AACvC,UAAM,OAAO,MAAM,UAAU,MAAM,KAAK,SAAS;AACjD,UAAM,WAAW,KAAK,IAAG;AAEzB,SAAK,KAAK,CAAC,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,MAAM;AACpC,aAAO,CAAC,SAAS,GAAG,IAAI,GAAGA,IAAG,IAAI,IAAI,CAAC;AAAA,IACzC,CAAC;AAED,UAAM,QAAQ,KAAK,YAAY,EAAE,MAAM,MAAM,IAAI;AAEjD,QAAI,MAAO,QAAO;AAElB,WAAO;AAAA,EACT;AACF;AAQA,SAAS,0BAA0B,OAAO,aAAa;AACrD,QAAM,EAAC,MAAM,cAAc,MAAM,UAAS,IAAI;AAE9C,QAAM,OAAO,aAAa,MAAM,GAAG,EAAE,IAAI;AAkBzC,QAAM,UAAU,IAAI,IAAI,SAAU,QAAQ,QAAQ;AAEhD,QAAI,SAAS,WAAW,KAAK,SAAS,WAAW,SAAS,KAAK;AAC7D,aAAO,cAAa;AAEtB,QAAI,CAAC,UAAU,OAAQ,QAAO,mBAAmB,MAAM,IAAI;AAE3D,QAAI,UAAU,WAAW,GAAG;AAC1B,eAAS,KAAK;AAEd,YAAM,aAAa,KAAK,OAAO,IAAI,MAAM;AAEzC,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,IAAI,yBAAyB,MAAM;AAAA,QACtD;AAGM,aAAO,0BAA0B,MAAM,WAAW,UAAU;AAAA,IAC9D;AAEA,QAAI,UAAU,WAAW,GAAG;AAC1B,eAAS,KAAK;AACd,eAAS,KAAK;AAEd,YAAM,aAAa,KAAK,OAAO,IAAI,MAAM;AAEzC,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,SAAS,IAAI,0BAA0B,MAAM;AAAA,QACvD;AAEM,UAAI,CAAC,KAAK,OAAO,IAAI,MAAM;AACzB,cAAM,IAAI;AAAA,UACR,SAAS,IAAI,0BAA0B,MAAM;AAAA,QACvD;AAGM,aAAO,0BAA0B,MAAM,WAAW,YAAY,MAAM;AAAA,IACtE;AAEA,UAAM,IAAI;AAAA,MACR,SAAS,IAAI,qDAAqD,UAAU,MAAM;AAAA,IACxF;AAAA,EACE;AACF;AAOA,SAAS,2BAA2BF,QAAO;AACzC,kBAAgB,QAAQ,iBAAe;AACrC,2BAAuBA,QAAO,WAAW;AACzC,sBAAkBA,QAAO,WAAW;AACpC,mBAAeA,QAAO,WAAW;AACjC,8BAA0BA,QAAO,WAAW;AAAA,EAC9C,CAAC;AACH;AAaA,MAAM,sBAAsB;AAAA,EAC1B;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,EACV;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,WAAW;AAAA,EACf;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,WAAW;AAAA,EACf;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,WAAW;AAAA,EACf;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,IACN,WAAW;AAAA,EACf;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,EACV;AAAA,EACE;AAAA,IACE,MAAM;AAAA,IACN,MAAM;AAAA,EACV;AACA;AAKA,SAAS,sBAAsB;AAC7B,OAAK,IAAI;AACT,OAAK,IAAI;AACX;AAEA,oBAAoB,UAAU,OAAO,SAAU,KAAK;AAClD,MAAI,KAAK,MAAM,KAAM,MAAK,IAAI;AAAA,WACrB,KAAK,MAAM,KAAM,MAAK,IAAI;AACrC;AAEA,oBAAoB,UAAU,MAAM,SAAU,KAAK;AACjD,MAAI,KAAK,MAAM,QAAQ,OAAO,KAAK,EAAG,QAAO;AAC7C,MAAI,KAAK,MAAM,QAAQ,OAAO,KAAK,EAAG,QAAO;AAC7C,SAAO;AACT;AAWA,SAAS,oBAAoB,WAAW,SAAS,UAAU,QAAQ,UAAU;AAC3E,aAAW,KAAK,QAAQ;AACtB,UAAM,WAAW,OAAO,CAAC;AAEzB,UAAM,aAAa,SAAS;AAC5B,UAAM,aAAa,SAAS;AAE5B,UAAM,eAAe,eAAe,WAAW,aAAa;AAE5D,QAAI,WAAW,QAAQ,IAAI,aAAa,GAAG,EAAG;AAE9C,UAAM,cAAc,SAAS,aAAa,KAAK,aAAa,UAAU;AAEtE,QAAI,aAAa,YAAa,QAAO,aAAa;AAAA,EACpD;AAEA;AACF;AAEA,SAAS,gBAAgB,WAAW,MAAM,WAAW,UAAU,UAAU;AAEvE,MAAI,SAAS,SAAS;AACpB,QAAI,SAAS;AACX,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT;AAAA,MACR;AAEI,QAAI,OAAO,cAAc;AACvB,aAAO;AAAA,QACL;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS,SAAS;AAAA,QAClB;AAAA,MACR;AAAA,EACE;AAIA,QAAM,UAAU,IAAI,oBAAmB;AAEvC,MAAI;AAEJ,MAAI,SAAS,cAAc;AACzB,QAAI,cAAc,OAAO;AACvB,cAAQ;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT;AAAA,MACR;AAEM,UAAI,aAAa,MAAO,QAAO;AAE/B,cAAQ,KAAK,SAAS,EAAE;AAAA,IAC1B;AACA,QAAI,cAAc,MAAM;AACtB,cAAQ;AAAA,QACN;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT;AAAA,MACR;AAEM,UAAI,aAAa,MAAO,QAAO;AAE/B,cAAQ,KAAK,SAAS,GAAG;AAAA,IAC3B;AAAA,EACF;AAEA,MAAI,SAAS,YAAY;AACvB,YAAQ;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA,MACA,SAAS;AAAA,MACT;AAAA,IACN;AAEI,QAAI,aAAa,MAAO,QAAO;AAAA,EACjC;AAEA;AACF;AAUA,SAAS,2BAA2B,MAAM,WAAW,UAAU;AAE7D,MAAI,SAAS,SAAS;AACpB,QAAI,SAAS,aAAc,QAAO,OAAO,KAAK,SAAS,UAAU;AAEjE,QAAI,OAAO,cAAc,SAAU,QAAO,OAAO,KAAK,SAAS,SAAS,CAAC;AAAA,EAC3E;AAEA,QAAM,YAAY,CAAA;AAElB,kBAAgB,OAAO,MAAM,WAAW,UAAU,SAAU,KAAK;AAC/D,cAAU,KAAK,GAAG;AAAA,EACpB,CAAC;AAED,SAAO;AACT;AAUA,SAAS,4BAA4B,SAAS,UAAU,QAAQ;AAC9D,QAAM,OAAO,OAAO,KAAK,MAAM;AAC/B,QAAM,IAAI,KAAK;AAEf,MAAI,IAAI;AAER,SAAO;AAAA,IACL,CAAC,OAAO,QAAQ,IAAI;AAClB,aAAO;AAAA,IACT;AAAA,IACA,OAAO;AACL,UAAI,eAAe;AAEnB,SAAG;AACD,YAAI,KAAK,GAAG;AACV,cAAI,QAAS,SAAQ,KAAK,MAAM;AAChC,iBAAO,EAAC,MAAM,KAAI;AAAA,QACpB;AAEA,cAAM,WAAW,OAAO,KAAK,GAAG,CAAC;AAEjC,cAAM,aAAa,SAAS;AAC5B,cAAM,aAAa,SAAS;AAE5B,uBAAe,eAAe,WAAW,aAAa;AAEtD,YAAI,WAAW,QAAQ,IAAI,aAAa,GAAG,GAAG;AAC5C,yBAAe;AACf;AAAA,QACF;AAAA,MACF,SAAS,iBAAiB;AAE1B,aAAO;AAAA,QACL,MAAM;AAAA,QACN,OAAO,EAAC,UAAU,aAAa,KAAK,YAAY,aAAa,WAAU;AAAA,MAC/E;AAAA,IACI;AAAA,EACJ;AACA;AAEA,SAAS,uBAAuB,MAAM,WAAW,UAAU;AAEzD,MAAI,SAAS,SAAS;AACpB,QAAI,SAAS;AACX,aAAO,4BAA4B,MAAM,UAAU,SAAS,UAAU;AAExE,QAAI,OAAO,cAAc;AACvB,aAAO,4BAA4B,MAAM,UAAU,SAAS,SAAS,CAAC;AAAA,EAC1E;AAEA,MAAIC,YAAW,cAAa;AAI5B,QAAM,UAAU,IAAI,oBAAmB;AAEvC,MAAI,SAAS,cAAc;AACzB,QAAI,cAAc,OAAO;AACvB,MAAAA,YAAW;AAAA,QACTA;AAAA,QACA,4BAA4B,SAAS,UAAU,SAAS,EAAE;AAAA,MAClE;AAAA,IACI;AACA,QAAI,cAAc,MAAM;AACtB,MAAAA,YAAW;AAAA,QACTA;AAAA,QACA,4BAA4B,SAAS,UAAU,SAAS,GAAG;AAAA,MACnE;AAAA,IACI;AAAA,EACF;AAEA,MAAI,SAAS,YAAY;AACvB,IAAAA,YAAW;AAAA,MACTA;AAAA,MACA,4BAA4B,SAAS,UAAU,SAAS,UAAU;AAAA,IACxE;AAAA,EACE;AAEA,SAAOA;AACT;AAQA,SAAS,2BAA2B,OAAO,aAAa;AACtD,QAAM,EAAC,MAAM,MAAM,UAAS,IAAI;AAUhC,QAAM,UAAU,IAAI,IAAI,SAAU,MAAM;AAEtC,QAAI,SAAS,WAAW,KAAK,SAAS,WAAW,SAAS,KAAK;AAC7D,aAAO,CAAA;AAET,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR,SAAS,IAAI,yBAAyB,IAAI;AAAA,MAClD;AAGI,WAAO;AAAA,MACL,SAAS,UAAU,KAAK,OAAO;AAAA,MAC/B;AAAA,MACA;AAAA,IACN;AAAA,EACE;AACF;AAQA,SAAS,sBAAsB,OAAO,aAAa;AACjD,QAAM,EAAC,MAAM,MAAM,UAAS,IAAI;AAEhC,QAAM,cAAc,YAAY,KAAK,CAAC,EAAE,YAAW,IAAK,KAAK,MAAM,GAAG,EAAE;AAWxE,QAAM,UAAU,WAAW,IAAI,SAAU,MAAM,UAAU;AAEvD,QAAI,SAAS,WAAW,KAAK,SAAS,WAAW,SAAS,KAAK,KAAM;AAErE,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR,SAAS,WAAW,yBAAyB,IAAI;AAAA,MACzD;AAGI;AAAA,MACE;AAAA,MACA,SAAS,UAAU,KAAK,OAAO;AAAA,MAC/B;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAAA,EACE;AAUA,QAAM,UAAU,QAAQ,KAAK,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;AAE5D,QAAM,UAAU,OAAO,IAAI,SAAU,MAAM,UAAU;AAEnD,UAAM,SAAS,CAAA;AAEf,SAAK,WAAW,EAAE,MAAM,CAAC,GAAG,MAAM;AAChC,aAAO,KAAK,SAAS,GAAG,CAAC,CAAC;AAAA,IAC5B,CAAC;AAED,WAAO;AAAA,EACT;AAUA,QAAM,aAAa,WAAW,KAAK,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;AAElE,QAAM,UAAU,UAAU,IAAI,SAAU,MAAM,UAAU;AACtD,UAAM,SAAS,CAAA;AAEf,SAAK,WAAW,EAAE,MAAM,CAAC,GAAG,MAAM;AAChC,UAAI,SAAS,GAAG,CAAC,EAAG,QAAO,KAAK,CAAC;AAAA,IACnC,CAAC;AAED,WAAO;AAAA,EACT;AAUA,QAAM,aAAa,WAAW,KAAK,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;AAElE,QAAM,UAAU,UAAU,IAAI,SAAU,MAAM,UAAU,cAAc;AACpE,QAAI,UAAU,SAAS;AACrB,YAAM,IAAI;AAAA,QACR,SAAS,UAAU;AAAA,MAC3B;AAEI,QAAI,cAAc;AAElB,SAAK,WAAW,EAAE,MAAM,CAAC,GAAG,MAAM;AAChC,oBAAc,SAAS,aAAa,GAAG,CAAC;AAAA,IAC1C,CAAC;AAED,WAAO;AAAA,EACT;AACF;AASA,SAAS,mBAAmB,OAAO,aAAa;AAC9C,QAAM,EAAC,MAAM,MAAM,UAAS,IAAI;AAEhC,QAAM,sBAAsB,KAAK,CAAC,EAAE,YAAW,IAAK,KAAK,MAAM,GAAG,EAAE;AAEpE,QAAM,WAAW,SAAS;AAW1B,QAAM,UAAU,QAAQ,IAAI,SAAU,MAAM,UAAU;AAEpD,QAAI,SAAS,WAAW,KAAK,SAAS,WAAW,SAAS,KAAK,KAAM;AAErE,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR,SAAS,QAAQ,yBAAyB,IAAI;AAAA,MACtD;AAGI,WAAO;AAAA,MACL;AAAA,MACA,SAAS,UAAU,KAAK,OAAO;AAAA,MAC/B;AAAA,MACA;AAAA,MACA;AAAA,IACN;AAAA,EACE;AAYA,QAAM,WAAW,SAAS;AAE1B,QAAM,UAAU,QAAQ,IAAI,SAAU,MAAM,UAAU;AACpD,UAAM,QAAQ,KAAK,QAAQ,EAAE,MAAM,QAAQ;AAE3C,QAAI,MAAO,QAAO;AAElB,WAAO;AAAA,EACT;AAYA,QAAM,YAAY,UAAU;AAE5B,QAAM,UAAU,SAAS,IAAI,SAAU,MAAM,UAAU;AACrD,UAAM,QAAQ,KAAK,QAAQ,EAAE,MAAM,CAAC,GAAG,MAAM;AAC3C,aAAO,CAAC,SAAS,GAAG,CAAC;AAAA,IACvB,CAAC;AAED,QAAI,MAAO,QAAO;AAElB,WAAO;AAAA,EACT;AACF;AAQA,SAAS,8BAA8B,OAAO,aAAa;AACzD,QAAM,EAAC,MAAM,MAAM,UAAS,IAAI;AAEhC,QAAM,eAAe,KAAK,MAAM,GAAG,EAAE,IAAI;AAUzC,QAAM,UAAU,YAAY,IAAI,SAAU,MAAM;AAE9C,QAAI,SAAS,WAAW,KAAK,SAAS,WAAW,SAAS,KAAK;AAC7D,aAAO,cAAa;AAEtB,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR,SAAS,YAAY,yBAAyB,IAAI;AAAA,MAC1D;AAGI,WAAO;AAAA,MACL,SAAS,UAAU,KAAK,OAAO;AAAA,MAC/B;AAAA,MACA;AAAA,IACN;AAAA,EACE;AACF;AAOA,SAAS,+BAA+BD,QAAO;AAC7C,sBAAoB,QAAQ,iBAAe;AACzC,+BAA2BA,QAAO,WAAW;AAC7C,0BAAsBA,QAAO,WAAW;AACxC,uBAAmBA,QAAO,WAAW;AACrC,kCAA8BA,QAAO,WAAW;AAAA,EAClD,CAAC;AACH;AAmBA,SAAS,iBACP,WACA,YACA,mBACA,OACA,UACA;AACA,QAAMC,YAAW,MAAM,OAAO,OAAM;AAEpC,QAAM,OAAO,MAAM;AAEhB,MAAC,MAAM,YAAY,UAAU,KAAK,UAAU;AAE/C,SAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,QAAI,WAAW;AAEf,iBAAa,KAAK;AAElB,QAAI,SAAS,cAAc;AACzB,YAAM,WAAW;AAEjB,WAAK,YAAY,KAAK;AACpB,mBAAW,IAAI,QAAQ;AAEvB,WAAG;AACD,uBAAa,SAAS;AAEtB,qBAAW;AACG;AAAA,YACZ,WAAW;AAAA,YACX,WAAW;AAAA,YACX,WAAW;AAAA,YACX,WAAW;AAAA,YACX,SAAS;AAAA,YACT,SAAS;AAAA,YACT,SAAS;AAAA,UACrB;AAIU,qBAAW,SAAS;AAAA,QACtB,SAAS;AAAA,MACX;AAAA,IACF;AAEA,QAAI,SAAS,YAAY;AACvB,YAAM,WAAW;AAEjB,WAAK,YAAY,KAAK;AACpB,YAAI,cAAc,WAAW,MAAM,SAAU;AAE7C,mBAAW,IAAI,QAAQ;AAEvB,WAAG;AACD,uBAAa,SAAS;AAEtB,cAAI,WAAW,QAAQ,SAAU,cAAa,SAAS;AAEvD,qBAAW;AACG;AAAA,YACZ,WAAW;AAAA,YACX,WAAW;AAAA,YACX,WAAW;AAAA,YACX,WAAW;AAAA,YACX,SAAS;AAAA,YACT,SAAS;AAAA,YACT,SAAS;AAAA,UACrB;AAIU,qBAAW,SAAS;AAAA,QACtB,SAAS;AAAA,MACX;AAAA,IACF;AAEA,QAAI,qBAAqB,CAAC,UAAU;AACpB;AAAA,QACZ,WAAW;AAAA,QACX;AAAA,QACA,WAAW;AAAA,QACX;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MACR;AAAA,IAGI;AAAA,EACF;AAEA;AACF;AAgBA,SAAS,cAAc,KAAK,MAAM;AAChC,QAAM,aAAa,EAAC,IAAG;AAEvB,MAAI,CAAC,QAAQ,KAAK,UAAU;AAC1B,eAAW,aAAa,OAAO,CAAA,GAAI,KAAK,UAAU;AAEpD,SAAO;AACT;AAUA,SAAS,cAAc,MAAM,KAAK,MAAM;AACtC,QAAM,aAAa;AAAA,IACjB;AAAA,IACA,QAAQ,KAAK,OAAO;AAAA,IACpB,QAAQ,KAAK,OAAO;AAAA,EACxB;AAEE,MAAI,CAAC,QAAQ,KAAK,UAAU;AAC1B,eAAW,aAAa,OAAO,CAAA,GAAI,KAAK,UAAU;AAEpD,MAAI,SAAS,WAAW,KAAK,WAAY,YAAW,aAAa;AAEjE,SAAO;AACT;AAQA,SAAS,uBAAuB,OAAO;AACrC,MAAI,CAAC,cAAc,KAAK;AACtB,UAAM,IAAI;AAAA,MACR;AAAA,IACN;AAEE,MAAI,EAAE,SAAS;AACb,UAAM,IAAI;AAAA,MACR;AAAA,IACN;AAEE,MACE,gBAAgB,UACf,CAAC,cAAc,MAAM,UAAU,KAAK,MAAM,eAAe;AAE1D,UAAM,IAAI;AAAA,MACR;AAAA,IACN;AACA;AAQA,SAAS,uBAAuB,OAAO;AACrC,MAAI,CAAC,cAAc,KAAK;AACtB,UAAM,IAAI;AAAA,MACR;AAAA,IACN;AAEE,MAAI,EAAE,YAAY;AAChB,UAAM,IAAI;AAAA,MACR;AAAA,IACN;AAEE,MAAI,EAAE,YAAY;AAChB,UAAM,IAAI;AAAA,MACR;AAAA,IACN;AAEE,MACE,gBAAgB,UACf,CAAC,cAAc,MAAM,UAAU,KAAK,MAAM,eAAe;AAE1D,UAAM,IAAI;AAAA,MACR;AAAA,IACN;AAEE,MAAI,gBAAgB,SAAS,OAAO,MAAM,eAAe;AACvD,UAAM,IAAI;AAAA,MACR;AAAA,IACN;AACA;AAOA,MAAM,cAAc,oCAAmC;AAKvD,MAAM,QAAQ,oBAAI,IAAI,CAAC,YAAY,cAAc,OAAO,CAAC;AAEzD,MAAM,gBAAgB,oBAAI,IAAI;AAAA,EAC5B;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,CAAC;AAED,MAAM,mBAAmB;AAAA,EACvB;AAAA,IACE,MAAM,UAAQ,GAAG,IAAI;AAAA,IACrB,aAAa;AAAA,EACjB;AAAA,EACE;AAAA,IACE,MAAM,UAAQ,GAAG,IAAI;AAAA,IACrB,aAAa;AAAA,IACb,MAAM;AAAA,EACV;AAAA,EACE;AAAA,IACE,MAAM,UAAQ,GAAG,IAAI;AAAA,IACrB,aAAa;AAAA,IACb,MAAM;AAAA,EACV;AAAA,EACE;AAAA,IACE,MAAM,UAAQ,GAAG,IAAI;AAAA,EACzB;AAAA,EACE;AAAA,IACE,MAAM,UAAQ,GAAG,IAAI;AAAA,IACrB,MAAM;AAAA,EACV;AAAA,EACE;AAAA,IACE,MAAM,UAAQ,GAAG,IAAI;AAAA,IACrB,MAAM;AAAA,EACV;AACA;AAKA,MAAM,WAAW;AAAA,EACf,gBAAgB;AAAA,EAChB,OAAO;AAAA,EACP,MAAM;AACR;AAcA,SAAS,QAAQ,OAAO,MAAM,YAAY;AACxC,MAAI,cAAc,CAAC,cAAc,UAAU;AACzC,UAAM,IAAI;AAAA,MACR,mEAAmE,UAAU;AAAA,IACnF;AAGE,SAAO,KAAK;AACZ,eAAa,cAAc,CAAA;AAE3B,MAAI,MAAM,OAAO,IAAI,IAAI;AACvB,UAAM,IAAI;AAAA,MACR,uBAAuB,IAAI;AAAA,IACjC;AAEE,QAAM,OAAO,IAAI,MAAM,cAAc,MAAM,UAAU;AAGrD,QAAM,OAAO,IAAI,MAAM,IAAI;AAG3B,QAAM,KAAK,aAAa;AAAA,IACtB,KAAK;AAAA,IACL;AAAA,EACJ,CAAG;AAED,SAAO;AACT;AAMA,SAAS,cAAc,OAAO,MAAM,YAAY;AAC9C,QAAM,OAAO,IAAI,MAAM,cAAc,MAAM,UAAU;AAErD,QAAM,OAAO,IAAI,MAAM,IAAI;AAE3B,QAAM,KAAK,aAAa;AAAA,IACtB,KAAK;AAAA,IACL;AAAA,EACJ,CAAG;AAED,SAAO;AACT;AAoBA,SAAS,QACP,OACA,MACA,iBACA,YACA,MACA,QACA,QACA,YACA;AAEA,MAAI,CAAC,cAAc,MAAM,SAAS;AAChC,UAAM,IAAI;AAAA,MACR,SAAS,IAAI;AAAA,IACnB;AAEE,MAAI,cAAc,MAAM,SAAS;AAC/B,UAAM,IAAI;AAAA,MACR,SAAS,IAAI;AAAA,IACnB;AAEE,MAAI,cAAc,CAAC,cAAc,UAAU;AACzC,UAAM,IAAI;AAAA,MACR,SAAS,IAAI,sDAAsD,UAAU;AAAA,IACnF;AAGE,WAAS,KAAK;AACd,WAAS,KAAK;AACd,eAAa,cAAc,CAAA;AAE3B,MAAI,CAAC,MAAM,kBAAkB,WAAW;AACtC,UAAM,IAAI;AAAA,MACR,SAAS,IAAI,oCAAoC,MAAM;AAAA,IAC7D;AAEE,QAAM,aAAa,MAAM,OAAO,IAAI,MAAM,GACxC,aAAa,MAAM,OAAO,IAAI,MAAM;AAEtC,MAAI,CAAC;AACH,UAAM,IAAI;AAAA,MACR,SAAS,IAAI,kBAAkB,MAAM;AAAA,IAC3C;AAEE,MAAI,CAAC;AACH,UAAM,IAAI;AAAA,MACR,SAAS,IAAI,kBAAkB,MAAM;AAAA,IAC3C;AAGE,QAAM,YAAY;AAAA,IAChB,KAAK;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAEE,MAAI,iBAAiB;AAGnB,WAAO,MAAM,kBAAiB;AAAA,EAChC,OAAO;AAEL,WAAO,KAAK;AAGZ,QAAI,MAAM,OAAO,IAAI,IAAI;AACvB,YAAM,IAAI;AAAA,QACR,SAAS,IAAI,UAAU,IAAI;AAAA,MACnC;AAAA,EACE;AAGA,MACE,CAAC,MAAM,UACN,aACG,OAAO,WAAW,WAAW,MAAM,MAAM,cACzC,OAAO,WAAW,IAAI,MAAM,MAAM,cACtC;AACA,UAAM,IAAI;AAAA,MACR,SAAS,IAAI,sBAAsB,MAAM,SAAS,MAAM;AAAA,IAC9D;AAAA,EACE;AAGA,QAAM,WAAW,IAAI;AAAA,IACnB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAGE,QAAM,OAAO,IAAI,MAAM,QAAQ;AAG/B,QAAM,aAAa,WAAW;AAE9B,MAAI,YAAY;AACd,eAAW;AACX,eAAW;AAEX,QAAI,YAAY;AACd,iBAAW;AACX,YAAM;AAAA,IACR;AAAA,EACF,OAAO;AACL,eAAW;AACX,eAAW;AAEX,QAAI,YAAY;AACd,iBAAW;AACX,YAAM;AAAA,IACR;AAAA,EACF;AAGA,MAAI,MAAM,MAAO,UAAS,YAAW;AAAA,MAChC,UAAS,OAAM;AAEpB,MAAI,WAAY,OAAM;AAAA,MACjB,OAAM;AAGX,YAAU,MAAM;AAEhB,QAAM,KAAK,aAAa,SAAS;AAEjC,SAAO;AACT;AAqBA,SAAS,UACP,OACA,MACA,iBACA,YACA,MACA,QACA,QACA,YACA,WACA;AAEA,MAAI,CAAC,cAAc,MAAM,SAAS;AAChC,UAAM,IAAI;AAAA,MACR,SAAS,IAAI;AAAA,IACnB;AAEE,MAAI,cAAc,MAAM,SAAS;AAC/B,UAAM,IAAI;AAAA,MACR,SAAS,IAAI;AAAA,IACnB;AAEE,MAAI,YAAY;AACd,QAAI,WAAW;AACb,UAAI,OAAO,eAAe;AACxB,cAAM,IAAI;AAAA,UACR,SAAS,IAAI,6DAA6D,UAAU;AAAA,QAC9F;AAAA,IACI,OAAO;AACL,UAAI,CAAC,cAAc,UAAU;AAC3B,cAAM,IAAI;AAAA,UACR,SAAS,IAAI,sDAAsD,UAAU;AAAA,QACvF;AAAA,IACI;AAAA,EACF;AAGA,WAAS,KAAK;AACd,WAAS,KAAK;AAEd,MAAI;AAEJ,MAAI,WAAW;AACb,cAAU;AACV,iBAAa;AAAA,EACf;AAEA,MAAI,CAAC,MAAM,kBAAkB,WAAW;AACtC,UAAM,IAAI;AAAA,MACR,SAAS,IAAI,oCAAoC,MAAM;AAAA,IAC7D;AAEE,MAAI,aAAa,MAAM,OAAO,IAAI,MAAM;AACxC,MAAI,aAAa,MAAM,OAAO,IAAI,MAAM;AACxC,MAAI;AAGJ,MAAI;AAEJ,MAAI,CAAC,iBAAiB;AACpB,eAAW,MAAM,OAAO,IAAI,IAAI;AAEhC,QAAI,UAAU;AAGZ,UAAI,SAAS,OAAO,QAAQ,UAAU,SAAS,OAAO,QAAQ,QAAQ;AAEpE,YACE,CAAC,cACD,SAAS,OAAO,QAAQ,UACxB,SAAS,OAAO,QAAQ,QACxB;AAEA,gBAAM,IAAI;AAAA,YACR,SAAS,IAAI,0DAA0D,IAAI,gBAAgB,MAAM,eAAe,MAAM,kBAAkB,SAAS,OAAO,GAAG,OAAO,SAAS,OAAO,GAAG;AAAA,UACjM;AAAA,QACQ;AAAA,MACF;AAEA,gCAA0B;AAAA,IAC5B;AAAA,EACF;AAGA,MAAI,CAAC,2BAA2B,CAAC,MAAM,SAAS,YAAY;AAC1D,8BAA0B,aACtB,WAAW,WAAW,MAAM,IAC5B,WAAW,IAAI,MAAM;AAAA,EAC3B;AAGA,MAAI,yBAAyB;AAC3B,UAAM,OAAO,CAAC,wBAAwB,KAAK,OAAO,OAAO,KAAK;AAG9D,QAAI,YAAY,CAAC,UAAU,CAAC,WAAY,QAAO;AAG/C,QAAI,WAAW;AACb,YAAM,gBAAgB,wBAAwB;AAC9C,8BAAwB,aAAa,QAAQ,aAAa;AAE1D,YAAM,KAAK,yBAAyB;AAAA,QAClC,MAAM;AAAA,QACN,KAAK,wBAAwB;AAAA,QAC7B,YAAY,wBAAwB;AAAA,MAC5C,CAAO;AAAA,IACH,OAGK;AACH,aAAO,wBAAwB,YAAY,UAAU;AAErD,YAAM,KAAK,yBAAyB;AAAA,QAClC,MAAM;AAAA,QACN,KAAK,wBAAwB;AAAA,QAC7B,YAAY,wBAAwB;AAAA,QACpC,MAAM;AAAA,MACd,CAAO;AAAA,IACH;AAEA,WAAO;AAAA,EACT;AAEA,eAAa,cAAc,CAAA;AAE3B,MAAI,aAAa,QAAS,cAAa,QAAQ,UAAU;AAGzD,QAAM,YAAY;AAAA,IAChB,KAAK;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAEE,MAAI,iBAAiB;AAGnB,WAAO,MAAM,kBAAiB;AAAA,EAChC,OAAO;AAEL,WAAO,KAAK;AAGZ,QAAI,MAAM,OAAO,IAAI,IAAI;AACvB,YAAM,IAAI;AAAA,QACR,SAAS,IAAI,UAAU,IAAI;AAAA,MACnC;AAAA,EACE;AAEA,MAAI,iBAAiB;AACrB,MAAI,iBAAiB;AAErB,MAAI,CAAC,YAAY;AACf,iBAAa,cAAc,OAAO,QAAQ,CAAA,CAAE;AAC5C,qBAAiB;AAEjB,QAAI,WAAW,QAAQ;AACrB,mBAAa;AACb,uBAAiB;AAAA,IACnB;AAAA,EACF;AACA,MAAI,CAAC,YAAY;AACf,iBAAa,cAAc,OAAO,QAAQ,CAAA,CAAE;AAC5C,qBAAiB;AAAA,EACnB;AAGA,aAAW,IAAI,SAAS,YAAY,MAAM,YAAY,YAAY,UAAU;AAG5E,QAAM,OAAO,IAAI,MAAM,QAAQ;AAG/B,QAAM,aAAa,WAAW;AAE9B,MAAI,YAAY;AACd,eAAW;AACX,eAAW;AAEX,QAAI,YAAY;AACd,iBAAW;AACX,YAAM;AAAA,IACR;AAAA,EACF,OAAO;AACL,eAAW;AACX,eAAW;AAEX,QAAI,YAAY;AACd,iBAAW;AACX,YAAM;AAAA,IACR;AAAA,EACF;AAGA,MAAI,MAAM,MAAO,UAAS,YAAW;AAAA,MAChC,UAAS,OAAM;AAEpB,MAAI,WAAY,OAAM;AAAA,MACjB,OAAM;AAGX,YAAU,MAAM;AAEhB,QAAM,KAAK,aAAa,SAAS;AAEjC,SAAO,CAAC,MAAM,MAAM,gBAAgB,cAAc;AACpD;AAQA,SAAS,iBAAiB,OAAO,UAAU;AAEzC,QAAM,OAAO,OAAO,SAAS,GAAG;AAGhC,QAAM,EAAC,QAAQ,YAAY,QAAQ,YAAY,WAAU,IAAI;AAE7D,QAAM,aAAa,SAAS;AAE5B,QAAM,aAAa,eAAe;AAElC,MAAI,YAAY;AACd,eAAW;AACX,eAAW;AAEX,QAAI,YAAY;AACd,iBAAW;AACX,YAAM;AAAA,IACR;AAAA,EACF,OAAO;AACL,eAAW;AACX,eAAW;AAEX,QAAI,YAAY;AACd,iBAAW;AACX,YAAM;AAAA,IACR;AAAA,EACF;AAGA,MAAI,MAAM,MAAO,UAAS,YAAW;AAAA,MAChC,UAAS,OAAM;AAEpB,MAAI,WAAY,OAAM;AAAA,MACjB,OAAM;AAGX,QAAM,KAAK,eAAe;AAAA,IACxB,KAAK,SAAS;AAAA,IACd;AAAA,IACA,QAAQ,WAAW;AAAA,IACnB,QAAQ,WAAW;AAAA,IACnB;AAAA,EACJ,CAAG;AACH;AAcA,MAAM,cAAcE,cAAAA,aAAa;AAAA,EAC/B,YAAY,SAAS;AACnB,UAAK;AAGL,cAAU,OAAO,IAAI,UAAU,OAAO;AAGtC,QAAI,OAAO,QAAQ,UAAU;AAC3B,YAAM,IAAI;AAAA,QACR,2EAA2E,QAAQ,KAAK;AAAA,MAChG;AAEI,QAAI,CAAC,MAAM,IAAI,QAAQ,IAAI;AACzB,YAAM,IAAI;AAAA,QACR,2GAA2G,QAAQ,IAAI;AAAA,MAC/H;AAEI,QAAI,OAAO,QAAQ,mBAAmB;AACpC,YAAM,IAAI;AAAA,QACR,oFAAoF,QAAQ,cAAc;AAAA,MAClH;AAKI,UAAM,gBACJ,QAAQ,SAAS,UACb,gBACA,QAAQ,SAAS,aACjB,mBACA;AAEN,oBAAgB,MAAM,iBAAiB,aAAa;AAapD,UAAM,iBAAiB,UAAU,YAAW,IAAK;AACjD,QAAI,SAAS;AAEb,UAAM,mBAAmB,MAAM;AAC7B,UAAI;AAEJ,SAAG;AACD,2BAAmB,iBAAiB;AAAA,MACtC,SAAS,KAAK,OAAO,IAAI,gBAAgB;AAEzC,aAAO;AAAA,IACT;AAGA,oBAAgB,MAAM,eAAe,EAAE;AACvC,oBAAgB,MAAM,UAAU,oBAAI,IAAG,CAAE;AACzC,oBAAgB,MAAM,UAAU,oBAAI,IAAG,CAAE;AACzC,oBAAgB,MAAM,iBAAiB,CAAC;AACxC,oBAAgB,MAAM,mBAAmB,CAAC;AAC1C,oBAAgB,MAAM,0BAA0B,CAAC;AACjD,oBAAgB,MAAM,4BAA4B,CAAC;AACnD,oBAAgB,MAAM,qBAAqB,gBAAgB;AAG3D,oBAAgB,MAAM,YAAY,OAAO;AAGzC,kBAAc,QAAQ,UAAQ,gBAAgB,MAAM,MAAM,KAAK,IAAI,CAAC,CAAC;AAGrE,qBAAiB,MAAM,SAAS,MAAM,KAAK,OAAO,IAAI;AACtD,qBAAiB,MAAM,QAAQ,MAAM,KAAK,OAAO,IAAI;AACrD,qBAAiB,MAAM,gBAAgB,MAAM,KAAK,aAAa;AAC/D,qBAAiB,MAAM,kBAAkB,MAAM,KAAK,eAAe;AACnE;AAAA,MACE;AAAA,MACA;AAAA,MACA,MAAM,KAAK,yBAAyB,KAAK;AAAA,IAC/C;AACI;AAAA,MACE;AAAA,MACA;AAAA,MACA,MAAM,KAAK;AAAA,IACjB;AACI;AAAA,MACE;AAAA,MACA;AAAA,MACA,MAAM,KAAK;AAAA,IACjB;AACI,qBAAiB,MAAM,SAAS,KAAK,SAAS,KAAK;AACnD,qBAAiB,MAAM,QAAQ,KAAK,SAAS,IAAI;AACjD,qBAAiB,MAAM,kBAAkB,KAAK,SAAS,cAAc;AACrE,qBAAiB,MAAM,kBAAkB,MAAM,YAAY;AAAA,EAC7D;AAAA,EAEA,yBAAyB;AACvB,SAAK,gBAAgB;AACrB,SAAK,kBAAkB;AACvB,SAAK,yBAAyB;AAC9B,SAAK,2BAA2B;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,QAAQ,MAAM;AACZ,WAAO,KAAK,OAAO,IAAI,KAAK,IAAI;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,gBAAgB,QAAQ,QAAQ;AAE9B,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,QAAI,UAAU,WAAW,GAAG;AAC1B,YAAM,OAAO,KAAK;AAElB,YAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,aAAO,CAAC,CAAC,YAAY,CAAC,SAAS;AAAA,IACjC,WAAW,UAAU,WAAW,GAAG;AACjC,eAAS,KAAK;AACd,eAAS,KAAK;AAGd,YAAM,WAAW,KAAK,OAAO,IAAI,MAAM;AAEvC,UAAI,CAAC,SAAU,QAAO;AAGtB,aAAO,SAAS,IAAI,eAAe,MAAM;AAAA,IAC3C;AAEA,UAAM,IAAI;AAAA,MACR,yCAAyC,UAAU,MAAM;AAAA,IAC/D;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,kBAAkB,QAAQ,QAAQ;AAEhC,QAAI,KAAK,SAAS,WAAY,QAAO;AAErC,QAAI,UAAU,WAAW,GAAG;AAC1B,YAAM,OAAO,KAAK;AAElB,YAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,aAAO,CAAC,CAAC,YAAY,SAAS;AAAA,IAChC,WAAW,UAAU,WAAW,GAAG;AACjC,eAAS,KAAK;AACd,eAAS,KAAK;AAGd,YAAM,WAAW,KAAK,OAAO,IAAI,MAAM;AAEvC,UAAI,CAAC,SAAU,QAAO;AAGtB,aAAO,SAAS,WAAW,eAAe,MAAM;AAAA,IAClD;AAEA,UAAM,IAAI;AAAA,MACR,yCAAyC,UAAU,MAAM;AAAA,IAC/D;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,QAAQ,QAAQ,QAAQ;AACtB,QAAI,UAAU,WAAW,GAAG;AAC1B,YAAM,OAAO,KAAK;AAElB,aAAO,KAAK,OAAO,IAAI,IAAI;AAAA,IAC7B,WAAW,UAAU,WAAW,GAAG;AACjC,eAAS,KAAK;AACd,eAAS,KAAK;AAGd,YAAM,WAAW,KAAK,OAAO,IAAI,MAAM;AAEvC,UAAI,CAAC,SAAU,QAAO;AAGtB,aACG,OAAO,SAAS,QAAQ,eACvB,SAAS,IAAI,eAAe,MAAM,KACnC,OAAO,SAAS,eAAe,eAC9B,SAAS,WAAW,eAAe,MAAM;AAAA,IAE/C;AAEA,UAAM,IAAI;AAAA,MACR,iCAAiC,UAAU,MAAM;AAAA,IACvD;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,aAAa,QAAQ,QAAQ;AAC3B,QAAI,KAAK,SAAS,aAAc;AAEhC,aAAS,KAAK;AACd,aAAS,KAAK;AAEd,QAAI,KAAK;AACP,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAM,aAAa,KAAK,OAAO,IAAI,MAAM;AAEzC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,2CAA2C,MAAM;AAAA,MACzD;AAEI,QAAI,CAAC,KAAK,OAAO,IAAI,MAAM;AACzB,YAAM,IAAI;AAAA,QACR,2CAA2C,MAAM;AAAA,MACzD;AAEI,UAAM,WAAY,WAAW,OAAO,WAAW,IAAI,MAAM,KAAM;AAE/D,QAAI,SAAU,QAAO,SAAS;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,eAAe,QAAQ,QAAQ;AAC7B,QAAI,KAAK,SAAS,WAAY;AAE9B,aAAS,KAAK;AACd,aAAS,KAAK;AAEd,QAAI,KAAK;AACP,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAM,aAAa,KAAK,OAAO,IAAI,MAAM;AAEzC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,6CAA6C,MAAM;AAAA,MAC3D;AAEI,QAAI,CAAC,KAAK,OAAO,IAAI,MAAM;AACzB,YAAM,IAAI;AAAA,QACR,6CAA6C,MAAM;AAAA,MAC3D;AAEI,UAAM,WACH,WAAW,cAAc,WAAW,WAAW,MAAM,KAAM;AAE9D,QAAI,SAAU,QAAO,SAAS;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,KAAK,QAAQ,QAAQ;AACnB,QAAI,KAAK;AACP,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,aAAS,KAAK;AACd,aAAS,KAAK;AAEd,UAAM,aAAa,KAAK,OAAO,IAAI,MAAM;AAEzC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,mCAAmC,MAAM;AAAA,MACjD;AAEI,QAAI,CAAC,KAAK,OAAO,IAAI,MAAM;AACzB,YAAM,IAAI;AAAA,QACR,mCAAmC,MAAM;AAAA,MACjD;AAEI,UAAM,WACH,WAAW,OAAO,WAAW,IAAI,MAAM,KACvC,WAAW,cAAc,WAAW,WAAW,MAAM,KACtD;AAEF,QAAI,SAAU,QAAO,SAAS;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,qBAAqB,MAAM,UAAU;AACnC,WAAO,KAAK;AACZ,eAAW,KAAK;AAEhB,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,mDAAmD,IAAI;AAAA,MAC/D;AAEI,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,WAAO,YAAY,SAAS,MAAM,YAAY,SAAS;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,gBAAgB,MAAM,UAAU;AAC9B,WAAO,KAAK;AACZ,eAAW,KAAK;AAEhB,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,8CAA8C,IAAI;AAAA,MAC1D;AAEI,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,WAAO,YAAY,SAAS;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,eAAe,MAAM,UAAU;AAC7B,WAAO,KAAK;AACZ,eAAW,KAAK;AAEhB,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,6CAA6C,IAAI;AAAA,MACzD;AAEI,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,WAAO,YAAY,SAAS;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,uBAAuB,MAAM,UAAU;AACrC,WAAO,KAAK;AACZ,eAAW,KAAK;AAEhB,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,qDAAqD,IAAI;AAAA,MACjE;AAEI,QAAI,KAAK,SAAS,WAAY,QAAO;AAErC,WAAO,YAAY,SAAS;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,aAAa,MAAM,UAAU;AAC3B,WAAO,KAAK;AACZ,eAAW,KAAK;AAEhB,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,2CAA2C,IAAI;AAAA,MACvD;AAEI,QAAI,KAAK,SAAS,cAAc;AAC9B,UAAI,YAAY,SAAS,MAAM,YAAY,SAAS,IAAK,QAAO;AAAA,IAClE;AAEA,QAAI,KAAK,SAAS,YAAY;AAC5B,UAAI,YAAY,SAAS,WAAY,QAAO;AAAA,IAC9C;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,oBAAoB,MAAM,UAAU;AAClC,WAAO,KAAK;AACZ,eAAW,KAAK;AAEhB,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,kDAAkD,IAAI;AAAA,MAC9D;AAEI,QAAI,KAAK,SAAS,cAAc;AAC9B,UAAI,YAAY,SAAS,GAAI,QAAO;AAAA,IACtC;AAEA,QAAI,KAAK,SAAS,YAAY;AAC5B,UAAI,YAAY,SAAS,WAAY,QAAO;AAAA,IAC9C;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,qBAAqB,MAAM,UAAU;AACnC,WAAO,KAAK;AACZ,eAAW,KAAK;AAEhB,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,mDAAmD,IAAI;AAAA,MAC/D;AAEI,QAAI,KAAK,SAAS,cAAc;AAC9B,UAAI,YAAY,SAAS,IAAK,QAAO;AAAA,IACvC;AAEA,QAAI,KAAK,SAAS,YAAY;AAC5B,UAAI,YAAY,SAAS,WAAY,QAAO;AAAA,IAC9C;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,SAAS,MAAM;AACb,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,uCAAuC,IAAI;AAAA,MACnD;AAEI,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,UAAU,MAAM;AACd,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,wCAAwC,IAAI;AAAA,MACpD;AAEI,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,eAAe,MAAM;AACnB,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,6CAA6C,IAAI;AAAA,MACzD;AAEI,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,WAAO,SAAS,WAAW,SAAS;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,iBAAiB,MAAM;AACrB,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,+CAA+C,IAAI;AAAA,MAC3D;AAEI,QAAI,KAAK,SAAS,WAAY,QAAO;AAErC,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,cAAc,MAAM;AAClB,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,4CAA4C,IAAI;AAAA,MACxD;AAEI,QAAI,SAAS;AAEb,QAAI,KAAK,SAAS,YAAY;AAC5B,gBAAU,SAAS;AAAA,IACrB;AAEA,QAAI,KAAK,SAAS,cAAc;AAC9B,gBAAU,SAAS;AAAA,IACrB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,eAAe,MAAM;AACnB,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,6CAA6C,IAAI;AAAA,MACzD;AAEI,QAAI,SAAS;AAEb,QAAI,KAAK,SAAS,YAAY;AAC5B,gBAAU,SAAS;AAAA,IACrB;AAEA,QAAI,KAAK,SAAS,cAAc;AAC9B,gBAAU,SAAS;AAAA,IACrB;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAO,MAAM;AACX,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,qCAAqC,IAAI;AAAA,MACjD;AAEI,QAAI,SAAS;AAEb,QAAI,KAAK,SAAS,YAAY;AAC5B,gBAAU,SAAS;AAAA,IACrB;AAEA,QAAI,KAAK,SAAS,cAAc;AAC9B,gBAAU,SAAS,WAAW,SAAS;AAAA,IACzC;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,yBAAyB,MAAM;AAC7B,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,uDAAuD,IAAI;AAAA,MACnE;AAEI,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,WAAO,SAAS,WAAW,SAAS;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,0BAA0B,MAAM;AAC9B,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,wDAAwD,IAAI;AAAA,MACpE;AAEI,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,WAAO,SAAS,YAAY,SAAS;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,+BAA+B,MAAM;AACnC,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,6DAA6D,IAAI;AAAA,MACzE;AAEI,QAAI,KAAK,SAAS,aAAc,QAAO;AAEvC,WAAO,SAAS,WAAW,SAAS,YAAY,SAAS,gBAAgB;AAAA,EAC3E;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,iCAAiC,MAAM;AACrC,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,+DAA+D,IAAI;AAAA,MAC3E;AAEI,QAAI,KAAK,SAAS,WAAY,QAAO;AAErC,WAAO,SAAS,mBAAmB,SAAS,kBAAkB;AAAA,EAChE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,8BAA8B,MAAM;AAClC,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,4DAA4D,IAAI;AAAA,MACxE;AAEI,QAAI,SAAS;AACb,QAAI,QAAQ;AAEZ,QAAI,KAAK,SAAS,YAAY;AAC5B,gBAAU,SAAS;AACnB,eAAS,SAAS,kBAAkB;AAAA,IACtC;AAEA,QAAI,KAAK,SAAS,cAAc;AAC9B,gBAAU,SAAS;AACnB,eAAS,SAAS;AAAA,IACpB;AAEA,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,+BAA+B,MAAM;AACnC,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,6DAA6D,IAAI;AAAA,MACzE;AAEI,QAAI,SAAS;AACb,QAAI,QAAQ;AAEZ,QAAI,KAAK,SAAS,YAAY;AAC5B,gBAAU,SAAS;AACnB,eAAS,SAAS,kBAAkB;AAAA,IACtC;AAEA,QAAI,KAAK,SAAS,cAAc;AAC9B,gBAAU,SAAS;AACnB,eAAS,SAAS;AAAA,IACpB;AAEA,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,uBAAuB,MAAM;AAC3B,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,qDAAqD,IAAI;AAAA,MACjE;AAEI,QAAI,SAAS;AACb,QAAI,QAAQ;AAEZ,QAAI,KAAK,SAAS,YAAY;AAC5B,gBAAU,SAAS;AACnB,eAAS,SAAS,kBAAkB;AAAA,IACtC;AAEA,QAAI,KAAK,SAAS,cAAc;AAC9B,gBAAU,SAAS,WAAW,SAAS;AACvC,eAAS,SAAS,gBAAgB;AAAA,IACpC;AAEA,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAO,MAAM;AACX,WAAO,KAAK;AAEZ,UAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AAEjC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,qCAAqC,IAAI;AAAA,MACjD;AAEI,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,OAAO,MAAM;AACX,WAAO,KAAK;AAEZ,UAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AAEjC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,qCAAqC,IAAI;AAAA,MACjD;AAEI,WAAO,KAAK,OAAO;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,YAAY,MAAM;AAChB,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,0CAA0C,IAAI;AAAA,MACtD;AAEI,WAAO,CAAC,SAAS,OAAO,KAAK,SAAS,OAAO,GAAG;AAAA,EAClD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,SAAS,MAAM,MAAM;AACnB,WAAO,KAAK;AACZ,WAAO,KAAK;AAEZ,UAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AAEjC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,uCAAuC,IAAI;AAAA,MACnD;AAEI,UAAM,SAAS,KAAK,OAAO;AAC3B,UAAM,SAAS,KAAK,OAAO;AAE3B,QAAI,SAAS,OAAQ,QAAO;AAC5B,QAAI,SAAS,OAAQ,QAAO;AAE5B,UAAM,IAAI;AAAA,MACR,wBAAwB,IAAI,kCAAkC,IAAI,WAAW,MAAM,KAAK,MAAM;AAAA,IACpG;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,aAAa,MAAM,MAAM;AACvB,WAAO,KAAK;AACZ,WAAO,KAAK;AAEZ,UAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AAEjC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,2CAA2C,IAAI;AAAA,MACvD;AAEI,WAAO,KAAK,OAAO,QAAQ,QAAQ,KAAK,OAAO,QAAQ;AAAA,EACzD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,aAAa,MAAM;AACjB,WAAO,KAAK;AAEZ,UAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AAEjC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,2CAA2C,IAAI;AAAA,MACvD;AAEI,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,WAAW,MAAM;AACf,WAAO,KAAK;AAEZ,UAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AAEjC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,yCAAyC,IAAI;AAAA,MACrD;AAEI,WAAO,CAAC,KAAK;AAAA,EACf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,WAAW,MAAM;AACf,WAAO,KAAK;AAEZ,UAAM,OAAO,KAAK,OAAO,IAAI,IAAI;AAEjC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,yCAAyC,IAAI;AAAA,MACrD;AAEI,WAAO,KAAK,WAAW,KAAK;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBA,QAAQ,MAAM,YAAY;AACxB,UAAM,WAAW,QAAQ,MAAM,MAAM,UAAU;AAE/C,WAAO,SAAS;AAAA,EAClB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,UAAU,MAAM,YAAY;AAC1B,QAAI,cAAc,CAAC,cAAc,UAAU;AACzC,YAAM,IAAI;AAAA,QACR,qEAAqE,UAAU;AAAA,MACvF;AAGI,WAAO,KAAK;AACZ,iBAAa,cAAc,CAAA;AAG3B,QAAI,OAAO,KAAK,OAAO,IAAI,IAAI;AAE/B,QAAI,MAAM;AACR,UAAI,YAAY;AACd,eAAO,KAAK,YAAY,UAAU;AAElC,aAAK,KAAK,yBAAyB;AAAA,UACjC,MAAM;AAAA,UACN,KAAK;AAAA,UACL,YAAY,KAAK;AAAA,UACjB,MAAM;AAAA,QAChB,CAAS;AAAA,MACH;AACA,aAAO,CAAC,MAAM,KAAK;AAAA,IACrB;AAEA,WAAO,IAAI,KAAK,cAAc,MAAM,UAAU;AAG9C,SAAK,OAAO,IAAI,MAAM,IAAI;AAG1B,SAAK,KAAK,aAAa;AAAA,MACrB,KAAK;AAAA,MACL;AAAA,IACN,CAAK;AAED,WAAO,CAAC,MAAM,IAAI;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,WAAW,MAAM,SAAS;AACxB,QAAI,WAAW,OAAO,YAAY;AAChC,YAAM,IAAI;AAAA,QACR,6EAA6E,OAAO;AAAA,MAC5F;AAGI,WAAO,KAAK;AAGZ,QAAI,OAAO,KAAK,OAAO,IAAI,IAAI;AAE/B,QAAI,MAAM;AACR,UAAI,SAAS;AACX,cAAM,gBAAgB,KAAK;AAC3B,aAAK,aAAa,QAAQ,aAAa;AAEvC,aAAK,KAAK,yBAAyB;AAAA,UACjC,MAAM;AAAA,UACN,KAAK;AAAA,UACL,YAAY,KAAK;AAAA,QAC3B,CAAS;AAAA,MACH;AACA,aAAO,CAAC,MAAM,KAAK;AAAA,IACrB;AAEA,UAAM,aAAa,UAAU,QAAQ,CAAA,CAAE,IAAI,CAAA;AAE3C,WAAO,IAAI,KAAK,cAAc,MAAM,UAAU;AAG9C,SAAK,OAAO,IAAI,MAAM,IAAI;AAG1B,SAAK,KAAK,aAAa;AAAA,MACrB,KAAK;AAAA,MACL;AAAA,IACN,CAAK;AAED,WAAO,CAAC,MAAM,IAAI;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,SAAS,MAAM;AACb,WAAO,KAAK;AAEZ,UAAM,WAAW,KAAK,OAAO,IAAI,IAAI;AAErC,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,uCAAuC,IAAI;AAAA,MACnD;AAEI,QAAI;AAIJ,QAAI,KAAK,SAAS,cAAc;AAC9B,iBAAW,YAAY,SAAS,KAAK;AACnC,mBAAW,SAAS,IAAI,QAAQ;AAEhC,WAAG;AACD,2BAAiB,MAAM,QAAQ;AAC/B,qBAAW,SAAS;AAAA,QACtB,SAAS;AAAA,MACX;AAEA,iBAAW,YAAY,SAAS,IAAI;AAClC,mBAAW,SAAS,GAAG,QAAQ;AAE/B,WAAG;AACD,2BAAiB,MAAM,QAAQ;AAC/B,qBAAW,SAAS;AAAA,QACtB,SAAS;AAAA,MACX;AAAA,IACF;AAEA,QAAI,KAAK,SAAS,YAAY;AAC5B,iBAAW,YAAY,SAAS,YAAY;AAC1C,mBAAW,SAAS,WAAW,QAAQ;AAEvC,WAAG;AACD,2BAAiB,MAAM,QAAQ;AAC/B,qBAAW,SAAS;AAAA,QACtB,SAAS;AAAA,MACX;AAAA,IACF;AAGA,SAAK,OAAO,OAAO,IAAI;AAGvB,SAAK,KAAK,eAAe;AAAA,MACvB,KAAK;AAAA,MACL,YAAY,SAAS;AAAA,IAC3B,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBA,SAAS,MAAM;AACb,QAAI;AAEJ,QAAI,UAAU,SAAS,GAAG;AACxB,YAAM,SAAS,KAAK,UAAU,CAAC;AAC/B,YAAM,SAAS,KAAK,UAAU,CAAC;AAE/B,iBAAW,gBAAgB,MAAM,QAAQ,QAAQ,KAAK,IAAI;AAE1D,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,uCAAuC,MAAM,SAAS,MAAM;AAAA,QACtE;AAAA,IACI,OAAO;AACL,aAAO,KAAK;AAEZ,iBAAW,KAAK,OAAO,IAAI,IAAI;AAE/B,UAAI,CAAC;AACH,cAAM,IAAI;AAAA,UACR,uCAAuC,IAAI;AAAA,QACrD;AAAA,IACI;AAEA,qBAAiB,MAAM,QAAQ;AAE/B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,iBAAiB,QAAQ,QAAQ;AAC/B,QAAI,UAAU,SAAS;AACrB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,KAAK;AACP,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,aAAS,KAAK;AACd,aAAS,KAAK;AAEd,UAAM,WAAW,gBAAgB,MAAM,QAAQ,QAAQ,UAAU;AAEjE,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,6CAA6C,MAAM,SAAS,MAAM;AAAA,MAC1E;AAEI,qBAAiB,MAAM,QAAQ;AAE/B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,mBAAmB,QAAQ,QAAQ;AACjC,QAAI,UAAU,SAAS;AACrB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,KAAK;AACP,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAM,WAAW,gBAAgB,MAAM,QAAQ,QAAQ,YAAY;AAEnE,QAAI,CAAC;AACH,YAAM,IAAI;AAAA,QACR,+CAA+C,MAAM,SAAS,MAAM;AAAA,MAC5E;AAEI,qBAAiB,MAAM,QAAQ;AAE/B,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ;AAEN,SAAK,OAAO,MAAK;AAGjB,SAAK,OAAO,MAAK;AAGjB,SAAK,uBAAsB;AAG3B,SAAK,KAAK,SAAS;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa;AAEX,UAAMF,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI;AAEJ,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,WAAK,MAAM,MAAK;AAAA,IAClB;AAGA,SAAK,OAAO,MAAK;AAGjB,SAAK,uBAAsB;AAG3B,SAAK,KAAK,cAAc;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAaA,aAAa,MAAM;AACjB,WAAO,KAAK,YAAY,IAAI;AAAA,EAC9B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,gBAAgB;AACd,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAa,MAAM;AACjB,WAAO,KAAK,YAAY,eAAe,IAAI;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,aAAa,MAAM,OAAO;AACxB,SAAK,YAAY,IAAI,IAAI;AAGzB,SAAK,KAAK,qBAAqB;AAAA,MAC7B,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB;AAAA,IACN,CAAK;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,gBAAgB,MAAM,SAAS;AAC7B,QAAI,OAAO,YAAY;AACrB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAM,QAAQ,KAAK,YAAY,IAAI;AAEnC,SAAK,YAAY,IAAI,IAAI,QAAQ,KAAK;AAGtC,SAAK,KAAK,qBAAqB;AAAA,MAC7B,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB;AAAA,IACN,CAAK;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,gBAAgB,MAAM;AACpB,WAAO,KAAK,YAAY,IAAI;AAG5B,SAAK,KAAK,qBAAqB;AAAA,MAC7B,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB;AAAA,IACN,CAAK;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,kBAAkB,YAAY;AAC5B,QAAI,CAAC,cAAc,UAAU;AAC3B,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,SAAK,cAAc;AAGnB,SAAK,KAAK,qBAAqB;AAAA,MAC7B,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,IACvB,CAAK;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,gBAAgB,YAAY;AAC1B,QAAI,CAAC,cAAc,UAAU;AAC3B,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,WAAO,KAAK,aAAa,UAAU;AAGnC,SAAK,KAAK,qBAAqB;AAAA,MAC7B,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,MACjB,MAAM;AAAA,IACZ,CAAK;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,iBAAiB,SAAS;AACxB,QAAI,OAAO,YAAY;AACrB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,SAAK,cAAc,QAAQ,KAAK,WAAW;AAG3C,SAAK,KAAK,qBAAqB;AAAA,MAC7B,MAAM;AAAA,MACN,YAAY,KAAK;AAAA,IACvB,CAAK;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,yBAAyB,SAAS,OAAO;AACvC,QAAI,OAAO,YAAY;AACrB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,SAAS,CAAC,cAAc,KAAK;AAC/B,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM;AAEV,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAChB,eAAS,aAAa,QAAQ,SAAS,KAAK,SAAS,UAAU;AAAA,IACjE;AAEA,SAAK,KAAK,6BAA6B;AAAA,MACrC,OAAO,QAAQ,QAAQ;AAAA,IAC7B,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,yBAAyB,SAAS,OAAO;AACvC,QAAI,OAAO,YAAY;AACrB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,SAAS,CAAC,cAAc,KAAK;AAC/B,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM,UAAU,YAAY;AAEhC,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAChB,mBAAa,SAAS;AACtB,mBAAa,SAAS;AAEtB,eAAS,aAAa;AAAA,QACpB,SAAS;AAAA,QACT,SAAS;AAAA,QACT,WAAW;AAAA,QACX,WAAW;AAAA,QACX,WAAW;AAAA,QACX,WAAW;AAAA,QACX,SAAS;AAAA,MACjB;AAAA,IACI;AAEA,SAAK,KAAK,6BAA6B;AAAA,MACrC,OAAO,QAAQ,QAAQ;AAAA,IAC7B,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,sBAAsB,UAAU;AAC9B,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,qBAAiB,OAAO,OAAO,OAAO,MAAM,QAAQ;AAAA,EACtD;AAAA,EACA,iCAAiC,UAAU;AACzC,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,qBAAiB,OAAO,OAAO,MAAM,MAAM,QAAQ;AAAA,EACrD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,gCAAgC,UAAU;AACxC,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,qBAAiB,OAAO,MAAM,OAAO,MAAM,QAAQ;AAAA,EACrD;AAAA,EACA,2CAA2C,UAAU;AACnD,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,qBAAiB,OAAO,MAAM,MAAM,MAAM,QAAQ;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,QAAQ;AACN,WAAO,MAAM,KAAK,KAAK,OAAO,KAAI,CAAE;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,UAAU;AACpB,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM;AAEV,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAChB,eAAS,SAAS,KAAK,SAAS,UAAU;AAAA,IAC5C;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,SAAS,UAAU;AACjB,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM;AAEV,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAEhB,UAAI,SAAS,SAAS,KAAK,SAAS,UAAU,EAAG,QAAO,SAAS;AAAA,IACnE;AAEA;AAAA,EACF;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,UAAU;AACjB,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM;AAEV,UAAM,SAAS,IAAI,MAAM,KAAK,KAAK;AACnC,QAAI,IAAI;AAER,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAChB,aAAO,GAAG,IAAI,SAAS,SAAS,KAAK,SAAS,UAAU;AAAA,IAC1D;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAAS,UAAU;AACjB,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM;AAEV,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAEhB,UAAI,SAAS,SAAS,KAAK,SAAS,UAAU,EAAG,QAAO;AAAA,IAC1D;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU,UAAU;AAClB,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM;AAEV,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAEhB,UAAI,CAAC,SAAS,SAAS,KAAK,SAAS,UAAU,EAAG,QAAO;AAAA,IAC3D;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,UAAU;AACpB,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM;AAEV,UAAM,SAAS,CAAA;AAEf,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAEhB,UAAI,SAAS,SAAS,KAAK,SAAS,UAAU;AAC5C,eAAO,KAAK,SAAS,GAAG;AAAA,IAC5B;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,YAAY,UAAU,cAAc;AAClC,QAAI,OAAO,aAAa;AACtB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,UAAU,SAAS;AACrB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,cAAc;AAElB,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM;AAEV,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAChB,oBAAc,SAAS,aAAa,SAAS,KAAK,SAAS,UAAU;AAAA,IACvE;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc;AACZ,UAAMA,YAAW,KAAK,OAAO,OAAM;AAEnC,WAAO;AAAA,MACL,CAAC,OAAO,QAAQ,IAAI;AAClB,eAAO;AAAA,MACT;AAAA,MACA,OAAO;AACL,cAAM,OAAOA,UAAS,KAAI;AAC1B,YAAI,KAAK,KAAM,QAAO;AACtB,cAAM,OAAO,KAAK;AAClB,eAAO;AAAA,UACL,OAAO,EAAC,MAAM,KAAK,KAAK,YAAY,KAAK,WAAU;AAAA,UACnD,MAAM;AAAA,QAChB;AAAA,MACM;AAAA,IACN;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,SAAS;AACP,UAAM,QAAQ,IAAI,MAAM,KAAK,OAAO,IAAI;AAExC,QAAI,IAAI;AAER,SAAK,OAAO,QAAQ,CAAC,MAAM,QAAQ;AACjC,YAAM,GAAG,IAAI,cAAc,KAAK,IAAI;AAAA,IACtC,CAAC;AAED,UAAM,QAAQ,IAAI,MAAM,KAAK,OAAO,IAAI;AAExC,QAAI;AAEJ,SAAK,OAAO,QAAQ,CAAC,MAAM,QAAQ;AACjC,YAAM,GAAG,IAAI,cAAc,KAAK,MAAM,KAAK,IAAI;AAAA,IACjD,CAAC;AAED,WAAO;AAAA,MACL,SAAS;AAAA,QACP,MAAM,KAAK;AAAA,QACX,OAAO,KAAK;AAAA,QACZ,gBAAgB,KAAK;AAAA,MAC7B;AAAA,MACM,YAAY,KAAK,cAAa;AAAA,MAC9B;AAAA,MACA;AAAA,IACN;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,OAAO,MAAM,QAAQ,OAAO;AAE1B,QAAI,gBAAgB,OAAO;AAEzB,WAAK,YAAY,CAAC,GAAG,MAAM;AACzB,YAAI,MAAO,MAAK,UAAU,GAAG,CAAC;AAAA,YACzB,MAAK,QAAQ,GAAG,CAAC;AAAA,MACxB,CAAC;AAGD,WAAK,YAAY,CAAC,GAAG,GAAG,GAAGC,IAAG,KAAK,KAAK,MAAM;AAC5C,YAAI,OAAO;AACT,cAAI,EAAG,MAAK,2BAA2B,GAAG,GAAGA,IAAG,CAAC;AAAA,cAC5C,MAAK,yBAAyB,GAAG,GAAGA,IAAG,CAAC;AAAA,QAC/C,OAAO;AACL,cAAI,EAAG,MAAK,yBAAyB,GAAG,GAAGA,IAAG,CAAC;AAAA,cAC1C,MAAK,uBAAuB,GAAG,GAAGA,IAAG,CAAC;AAAA,QAC7C;AAAA,MACF,CAAC;AAED,aAAO;AAAA,IACT;AAGA,QAAI,CAAC,cAAc,IAAI;AACrB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,KAAK,YAAY;AACnB,UAAI,CAAC,cAAc,KAAK,UAAU;AAChC,cAAM,IAAI;AAAA,UACR;AAAA,QACV;AAEM,UAAI,MAAO,MAAK,gBAAgB,KAAK,UAAU;AAAA,UAC1C,MAAK,kBAAkB,KAAK,UAAU;AAAA,IAC7C;AAEA,QAAI,GAAG,GAAG,MAAM,MAAM;AAEtB,QAAI,KAAK,OAAO;AACd,aAAO,KAAK;AAEZ,UAAI,CAAC,MAAM,QAAQ,IAAI;AACrB,cAAM,IAAI;AAAA,UACR;AAAA,QACV;AAEM,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AACvC,eAAO,KAAK,CAAC;AAGb,+BAAuB,IAAI;AAG3B,cAAM,EAAC,KAAK,WAAU,IAAI;AAE1B,YAAI,MAAO,MAAK,UAAU,KAAK,UAAU;AAAA,YACpC,MAAK,QAAQ,KAAK,UAAU;AAAA,MACnC;AAAA,IACF;AAEA,QAAI,KAAK,OAAO;AACd,UAAI,sBAAsB;AAE1B,UAAI,KAAK,SAAS,cAAc;AAC9B,8BAAsB;AAAA,MACxB;AAEA,aAAO,KAAK;AAEZ,UAAI,CAAC,MAAM,QAAQ,IAAI;AACrB,cAAM,IAAI;AAAA,UACR;AAAA,QACV;AAEM,WAAK,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,KAAK;AACvC,eAAO,KAAK,CAAC;AAGb,+BAAuB,IAAI;AAG3B,cAAM;AAAA,UACJ;AAAA,UACA;AAAA,UACA;AAAA,UACA,aAAa;AAAA,QACvB,IAAY;AAEJ,YAAI;AAEJ,YAAI,SAAS,MAAM;AACjB,mBAAS,QACL,aACE,KAAK,6BACL,KAAK,2BACP,aACA,KAAK,2BACL,KAAK;AAET,iBAAO,KAAK,MAAM,KAAK,KAAK,QAAQ,QAAQ,UAAU;AAAA,QACxD,OAAO;AACL,mBAAS,QACL,aACE,KAAK,sBACL,KAAK,oBACP,aACA,KAAK,oBACL,KAAK;AAET,iBAAO,KAAK,MAAM,QAAQ,QAAQ,UAAU;AAAA,QAC9C;AAAA,MACF;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAcA,SAAS,SAAS;AAChB,UAAM,QAAQ,IAAI,MAAM,OAAO,CAAA,GAAI,KAAK,UAAU,OAAO,CAAC;AAC1D,UAAM,kBAAkB,OAAO,CAAA,GAAI,KAAK,cAAa,CAAE,CAAC;AACxD,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,UAAU,SAAS;AACjB,UAAM,QAAQ,KAAK,SAAS,OAAO;AAEnC,SAAK,OAAO,QAAQ,CAAC,UAAU,QAAQ;AACrC,YAAM,aAAa,OAAO,IAAI,SAAS,UAAU;AAGjD,iBAAW,IAAI,MAAM,cAAc,KAAK,UAAU;AAClD,YAAM,OAAO,IAAI,KAAK,QAAQ;AAAA,IAChC,CAAC;AAED,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,KAAK,SAAS;AACZ,cAAU,WAAW,CAAA;AAErB,QACE,OAAO,QAAQ,SAAS,YACxB,QAAQ,SAAS,KAAK,QACtB,QAAQ,SAAS;AAEjB,YAAM,IAAI;AAAA,QACR,wDAAwD,KAAK,IAAI,cAAc,QAAQ,IAAI;AAAA,MACnG;AAEI,QACE,OAAO,QAAQ,UAAU,aACzB,QAAQ,UAAU,KAAK,SACvB,QAAQ,UAAU;AAElB,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QACE,OAAO,QAAQ,mBAAmB,aAClC,QAAQ,mBAAmB,KAAK,kBAChC,QAAQ,mBAAmB;AAE3B,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAM,QAAQ,KAAK,UAAU,OAAO;AAEpC,UAAMD,YAAW,KAAK,OAAO,OAAM;AAEnC,QAAI,MAAM;AAEV,WAAS,OAAOA,UAAS,KAAI,GAAK,KAAK,SAAS,MAAO;AACrD,iBAAW,KAAK;AAGhB;AAAA,QACE;AAAA,QACA;AAAA,QACA;AAAA,QACA,SAAS;AAAA,QACT,SAAS;AAAA,QACT,SAAS,OAAO;AAAA,QAChB,SAAS,OAAO;AAAA,QAChB,OAAO,CAAA,GAAI,SAAS,UAAU;AAAA,MACtC;AAAA,IACI;AAEA,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAYA,SAAS;AACP,WAAO,KAAK,OAAM;AAAA,EACpB;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW;AACT,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU;AACR,UAAM,QAAQ,CAAA;AACd,SAAK,OAAO,QAAQ,CAAC,MAAM,QAAQ;AACjC,YAAM,GAAG,IAAI,KAAK;AAAA,IACpB,CAAC;AAED,UAAM,QAAQ,CAAA,GACZ,aAAa,CAAA;AAEf,SAAK,OAAO,QAAQ,CAAC,MAAM,QAAQ;AACjC,YAAM,YAAY,KAAK,aAAa,OAAO;AAE3C,UAAI,QAAQ;AAEZ,UAAI,SAAS,KAAK,OAAO;AACzB,UAAI,SAAS,KAAK,OAAO;AACzB,UAAI;AAEJ,UAAI,KAAK,cAAc,SAAS,QAAQ;AACtC,cAAM;AACN,iBAAS;AACT,iBAAS;AAAA,MACX;AAEA,YAAM,OAAO,IAAI,MAAM,IAAI,SAAS,IAAI,MAAM;AAE9C,UAAI,CAAC,IAAI,WAAW,OAAO,GAAG;AAC5B,iBAAS,IAAI,GAAG;AAAA,MAClB,WAAW,KAAK,OAAO;AACrB,YAAI,OAAO,WAAW,IAAI,MAAM,aAAa;AAC3C,qBAAW,IAAI,IAAI;AAAA,QACrB,OAAO;AACL,qBAAW,IAAI;AAAA,QACjB;AAEA,iBAAS,GAAG,WAAW,IAAI,CAAC;AAAA,MAC9B;AAEA,eAAS;AAET,YAAM,KAAK,IAAI,KAAK;AAAA,IACtB,CAAC;AAED,UAAM,QAAQ,CAAA;AAEd,eAAW,KAAK,MAAM;AACpB,UACE,KAAK,eAAe,CAAC,KACrB,CAAC,cAAc,IAAI,CAAC,KACpB,OAAO,KAAK,CAAC,MAAM,cACnB,OAAO,MAAM;AAEb,cAAM,CAAC,IAAI,KAAK,CAAC;AAAA,IACrB;AAEA,UAAM,aAAa,KAAK;AACxB,UAAM,QAAQ;AACd,UAAM,QAAQ;AAEd,oBAAgB,OAAO,eAAe,KAAK,WAAW;AAEtD,WAAO;AAAA,EACT;AACF;AAaA,IAAI,OAAO,WAAW;AACpB,QAAM,UAAU,uBAAO,IAAI,4BAA4B,CAAC,IACtD,MAAM,UAAU;AAKpB,iBAAiB,QAAQ,YAAU;AACjC,GAAC,OAAO,SAAS,QAAQ,EAAE,QAAQ,UAAQ;AACzC,UAAM,OAAO,OAAO,KAAK,IAAI;AAC7B,UAAM,KAAK,SAAS,QAAQ,UAAU;AAEtC,QAAI,OAAO,aAAa;AACtB,YAAM,UAAU,IAAI,IAAI,SAAU,QAAQ,QAAQ,YAAY;AAC5D,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,WACC,OAAO,QAAQ,KAAK,UAAU;AAAA,UAC/B;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,SAAS;AAAA,QACnB;AAAA,MACM;AAAA,IACF,OAAO;AACL,YAAM,UAAU,IAAI,IAAI,SAAU,MAAM,QAAQ,QAAQ,YAAY;AAClE,eAAO;AAAA,UACL;AAAA,UACA;AAAA,UACA;AAAA,WACC,OAAO,QAAQ,KAAK,UAAU;AAAA,UAC/B;AAAA,UACA;AAAA,UACA;AAAA,UACA;AAAA,UACA,SAAS;AAAA,QACnB;AAAA,MACM;AAAA,IACF;AAAA,EACF,CAAC;AACH,CAAC;AAKD,4BAA4B,KAAK;AACjC,4BAA4B,KAAK;AAKjC,2BAA2B,KAAK;AAKhC,+BAA+B,KAAK;AAapC,MAAM,sBAAsB,MAAM;AAAA,EAChC,YAAY,SAAS;AACnB,UAAM,eAAe,OAAO,EAAC,MAAM,WAAU,GAAG,OAAO;AAEvD,QAAI,WAAW,gBAAgB,aAAa,UAAU;AACpD,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,aAAa,SAAS;AACxB,YAAM,IAAI;AAAA,QACR,uCACE,aAAa,OACb;AAAA,MACV;AAEI,UAAM,YAAY;AAAA,EACpB;AACF;AACA,MAAM,wBAAwB,MAAM;AAAA,EAClC,YAAY,SAAS;AACnB,UAAM,eAAe,OAAO,EAAC,MAAM,aAAY,GAAG,OAAO;AAEzD,QAAI,WAAW,gBAAgB,aAAa,UAAU;AACpD,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,aAAa,SAAS;AACxB,YAAM,IAAI;AAAA,QACR,yCACE,aAAa,OACb;AAAA,MACV;AAEI,UAAM,YAAY;AAAA,EACpB;AACF;AACA,MAAM,mBAAmB,MAAM;AAAA,EAC7B,YAAY,SAAS;AACnB,UAAM,eAAe,OAAO,EAAC,OAAO,KAAI,GAAG,OAAO;AAElD,QAAI,WAAW,gBAAgB,aAAa,UAAU;AACpD,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,UAAM,YAAY;AAAA,EACpB;AACF;AACA,MAAM,2BAA2B,MAAM;AAAA,EACrC,YAAY,SAAS;AACnB,UAAM,eAAe,OAAO,EAAC,MAAM,YAAY,OAAO,KAAI,GAAG,OAAO;AAEpE,QAAI,WAAW,gBAAgB,aAAa,UAAU;AACpD,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,aAAa,SAAS;AACxB,YAAM,IAAI;AAAA,QACR,4CACE,aAAa,OACb;AAAA,MACV;AAEI,UAAM,YAAY;AAAA,EACpB;AACF;AACA,MAAM,6BAA6B,MAAM;AAAA,EACvC,YAAY,SAAS;AACnB,UAAM,eAAe,OAAO,EAAC,MAAM,cAAc,OAAO,KAAI,GAAG,OAAO;AAEtE,QAAI,WAAW,gBAAgB,aAAa,UAAU;AACpD,YAAM,IAAI;AAAA,QACR;AAAA,MACR;AAEI,QAAI,aAAa,SAAS;AACxB,YAAM,IAAI;AAAA,QACR,8CACE,aAAa,OACb;AAAA,MACV;AAEI,UAAM,YAAY;AAAA,EACpB;AACF;AAKA,SAAS,uBAAuB,OAAO;AAQrC,QAAM,OAAO,SAAU,MAAM,SAAS;AAEpC,UAAM,eAAe,OAAO,CAAA,GAAI,KAAK,SAAS,OAAO;AAErD,UAAM,WAAW,IAAI,MAAM,YAAY;AACvC,aAAS,OAAO,IAAI;AAEpB,WAAO;AAAA,EACT;AACF;AAEA,uBAAuB,KAAK;AAC5B,uBAAuB,aAAa;AACpC,uBAAuB,eAAe;AACtC,uBAAuB,UAAU;AACjC,uBAAuB,kBAAkB;AACzC,uBAAuB,oBAAoB;AAE3C,MAAM,QAAQ;AACd,MAAM,gBAAgB;AACtB,MAAM,kBAAkB;AACxB,MAAM,aAAa;AACnB,MAAM,qBAAqB;AAC3B,MAAM,uBAAuB;AAE7B,MAAM,6BAA6B;AACnC,MAAM,qBAAqB;AAC3B,MAAM,kBAAkB;;;;;;ACljNxB,YAAiB,SAASG,SAAQ,OAAO;AACvC,WACE,UAAU,QACV,OAAO,UAAU,YACjB,OAAO,MAAM,6BAA6B,cAC1C,OAAO,MAAM,aAAa,cAC1B,OAAO,MAAM,UAAU;AAAA,EAE3B;;;ACAA,MAAMC,YAAU;AAAA,EACd;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AACF;AAGA,MAAMC,UAAgC;AAAA,EACpC,YAAY;AAAA,EACZ,OAAO;AAAA,EACP,UAAU;AAAA,EACV,MAAM;AAAA,EACN,WAAW;AACb;AAEA,SAASC,OAAK,KAAqB;AACjC,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,SAAM,KAAK,KAAK,IAAI,IAAI,WAAW,CAAC,IAAK;AAAA,EAC3C;AACA,SAAO,KAAK,IAAI,CAAC;AACnB;AAEO,SAAS,aAAa,MAAsB;AACjD,SAAOD,QAAM,IAAI,KAAKD,UAAQE,OAAK,IAAI,IAAIF,UAAQ,MAAM;AAC3D;AClCA,MAAM,UAAU;AAAA,EACd;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AACF;AAGA,MAAM,QAAgC;AAAA,EACpC,OAAO;AAAA;AAAA,EACP,OAAO;AAAA;AAAA,EACP,QAAQ;AAAA;AAAA,EACR,YAAY;AAAA;AAAA,EACZ,SAAS;AAAA;AAAA,EACT,YAAY;AAAA;AAAA,EACZ,SAAS;AAAA;AAAA,EACT,SAAS;AAAA;AAAA,EACT,SAAS;AAAA;AAAA,EACT,UAAU;AAAA;AAAA,EACV,UAAU;AAAA;AAAA,EACV,cAAc;AAAA;AAChB;AAEA,SAAS,KAAK,KAAqB;AACjC,MAAI,IAAI;AACR,WAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;AACnC,SAAM,KAAK,KAAK,IAAI,IAAI,WAAW,CAAC,IAAK;AAAA,EAC3C;AACA,SAAO,KAAK,IAAI,CAAC;AACnB;AAEO,SAAS,aAAa,MAAsB;AACjD,QAAM,QAAQ,KAAK,YAAA;AACnB,SAAO,MAAM,KAAK,KAAK,QAAQ,KAAK,KAAK,IAAI,QAAQ,MAAM;AAC7D;AC1CA,MAAM,oBAAoB;AAAA,EACxB;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AACF;AAEA,MAAM,iBAAiB;AAOhB,SAAS,uBACd,aACqB;AAErB,QAAM,6BAAa,IAAA;AACnB,aAAW,eAAe,OAAO,OAAO,WAAW,GAAG;AACpD,WAAO,IAAI,cAAc,OAAO,IAAI,WAAW,KAAK,KAAK,CAAC;AAAA,EAC5D;AAGA,QAAM,SAAS,CAAC,GAAG,OAAO,QAAA,CAAS,EAAE,KAAK,CAAC,GAAG,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAE/D,QAAM,+BAAe,IAAA;AACrB,WAAS,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;AACtC,aAAS,IAAI,OAAO,CAAC,EAAE,CAAC,GAAG,kBAAkB,IAAI,kBAAkB,MAAM,CAAC;AAAA,EAC5E;AACA,SAAO;AACT;AAGA,MAAM,kBAAkB,CAAC,WAAW,aAAa,YAAY;AAqBtD,SAAS,oBACd,aACA,OACqB;AAErB,QAAM,6BAAa,IAAA;AACnB,aAAW,QAAQ,OAAO;AACxB,UAAM,MAAM,YAAY,KAAK,EAAE;AAC/B,QAAI,QAAQ,OAAW;AACvB,QAAI,OAAO,OAAO,IAAI,GAAG;AACzB,QAAI,CAAC,MAAM;AACT,aAAO,CAAA;AACP,aAAO,IAAI,KAAK,IAAI;AAAA,IACtB;AACA,SAAK,KAAK,IAAI;AAAA,EAChB;AAEA,QAAM,4BAAY,IAAA;AAElB,QAAM,2BAAW,IAAA;AAEjB,aAAW,CAAC,KAAK,OAAO,KAAK,QAAQ;AACnC,UAAM,MAAM,YAAY,OAAO;AAC/B,QAAI,IAAK,MAAK,IAAI,KAAK,GAAG;AAG1B,QAAI,gBAA+B;AACnC,QAAI,eAAe,gBAAgB;AACnC,eAAW,QAAQ,SAAS;AAC1B,YAAM,WAAW,gBAAgB,QAAQ,KAAK,IAAI;AAClD,UAAI,aAAa,MAAM,WAAW,cAAc;AAC9C,uBAAe;AACf,wBAAgB,KAAK;AAAA,MACvB;AAAA,IACF;AACA,QAAI,eAAe;AACjB,YAAM,IAAI,KAAK,aAAa;AAC5B;AAAA,IACF;AAGA,UAAM,YAAY,QAAQ,IAAI,CAAC,MAAM,EAAE,IAAI;AAC3C,UAAM,SAAS,oBAAoB,SAAS;AAC5C,QAAI,OAAO,SAAS,GAAG;AAErB,YAAM,UAAU,OAAO,SAAS,GAAG,IAC/B,OAAO,MAAM,GAAG,OAAO,YAAY,GAAG,IAAI,CAAC,IAC3C,OAAO,SAAS,GAAG,IACjB,OAAO,MAAM,GAAG,OAAO,YAAY,GAAG,IAAI,CAAC,IAC3C;AACN,UAAI,QAAQ,SAAS,GAAG;AACtB,cAAM,IAAI,KAAK,QAAQ,QAAQ,OAAO,EAAE,CAAC;AACzC;AAAA,MACF;AAAA,IACF;AAGA,QAAI,KAAK;AACP,YAAM,IAAI,KAAK,GAAG;AAClB;AAAA,IACF;AAGA,UAAM,iCAAiB,IAAA;AACvB,eAAW,QAAQ,SAAS;AAC1B,iBAAW,IAAI,KAAK,OAAO,WAAW,IAAI,KAAK,IAAI,KAAK,KAAK,CAAC;AAAA,IAChE;AACA,QAAI,eAAe;AACnB,QAAI,WAAW;AACf,eAAW,CAAC,MAAM,KAAK,KAAK,YAAY;AACtC,UAAI,QAAQ,UAAU;AACpB,mBAAW;AACX,uBAAe;AAAA,MACjB;AAAA,IACF;AACA,UAAM,IAAI,KAAK,UAAU,YAAY,CAAC;AAAA,EACxC;AAKA,QAAM,OAAO,IAAI;AAEjB,SAAO;AACT;AAOA,SAAS,YAAY,SAAwC;AAC3D,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,MAAI,QAAQ,WAAW,EAAG,QAAO,QAAQ,CAAC,EAAE;AAG5C,QAAM,SAAyD,CAAA;AAC/D,aAAW,QAAQ,SAAS;AAC1B,UAAM,YAAY,KAAK,KAAK,YAAA;AAE5B,QAAI,UAAU,UAAU,EAAG;AAC3B,QAAI,QAAQ;AACZ,eAAW,SAAS,SAAS;AAC3B,UAAI,UAAU,KAAM;AACpB,UAAI,MAAM,KAAK,YAAA,EAAc,SAAS,SAAS,EAAG;AAAA,IACpD;AACA,WAAO,KAAK,EAAE,MAAM,KAAK,MAAM,OAAO,KAAK,KAAK,KAAK,OAAA,CAAQ;AAAA,EAC/D;AAEA,MAAI,OAAO,WAAW,GAAG;AAEvB,WAAO,QAAQ,OAAO,CAAC,GAAG,MAAO,EAAE,KAAK,UAAU,EAAE,KAAK,SAAS,IAAI,CAAE,EACrE;AAAA,EACL;AAGA,SAAO,KAAK,CAAC,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG;AAExD,SAAO,OAAO,CAAC,EAAE;AACnB;AAGA,SAAS,MAAM,OAA4B,MAAiC;AAE1E,QAAM,QAAQ,MAAM;AAClB,UAAM,0BAAU,IAAA;AAChB,eAAW,CAAC,KAAK,IAAI,KAAK,OAAO;AAC/B,UAAI,OAAO,IAAI,IAAI,IAAI;AACvB,UAAI,CAAC,MAAM;AACT,eAAO,CAAA;AACP,YAAI,IAAI,MAAM,IAAI;AAAA,MACpB;AACA,WAAK,KAAK,GAAG;AAAA,IACf;AACA,WAAO;AAAA,EACT;AAGA,aAAW,CAAA,EAAG,IAAI,KAAK,SAAS;AAC9B,QAAI,KAAK,UAAU,EAAG;AACtB,eAAW,OAAO,MAAM;AACtB,YAAM,MAAM,KAAK,IAAI,GAAG;AACxB,YAAM,UAAU,MAAM,IAAI,GAAG;AAC7B,UAAI,OAAO,QAAQ,WAAW,CAAC,QAAQ,SAAS,GAAG,GAAG;AACpD,cAAM,IAAI,KAAK,GAAG,OAAO,MAAM,GAAG,EAAE;AAAA,MACtC;AAAA,IACF;AAAA,EACF;AAGA,aAAW,CAAA,EAAG,IAAI,KAAK,SAAS;AAC9B,QAAI,KAAK,UAAU,EAAG;AACtB,aAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,YAAM,MAAM,KAAK,CAAC;AAClB,YAAM,IAAI,KAAK,GAAG,MAAM,IAAI,GAAG,CAAE,KAAK,IAAI,CAAC,GAAG;AAAA,IAChD;AAAA,EACF;AACF;AAEA,SAAS,oBAAoB,SAA2B;AACtD,MAAI,QAAQ,WAAW,EAAG,QAAO;AACjC,MAAI,QAAQ,WAAW,EAAG,QAAO,QAAQ,CAAC;AAC1C,MAAI,SAAS,QAAQ,CAAC;AACtB,WAAS,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,WAAO,CAAC,QAAQ,CAAC,EAAE,WAAW,MAAM,GAAG;AACrC,eAAS,OAAO,MAAM,GAAG,EAAE;AAC3B,UAAI,OAAO,WAAW,EAAG,QAAO;AAAA,IAClC;AAAA,EACF;AACA,SAAO;AACT;AAEA,SAAS,UAAU,MAAsB;AACvC,MAAI,KAAK,SAAS,GAAG,EAAG,QAAO;AAC/B,MAAI,KAAK,SAAS,GAAG,UAAU,KAAK,MAAM,GAAG,EAAE,IAAI;AACnD,SAAO,OAAO;AAChB;AAKO,SAAS,kBACd,sBACA,mBACA,QACQ;AACR,QAAM,cAAc,qBAAqB,MAAM;AAC/C,MAAI,gBAAgB,OAAW,QAAO;AACtC,SAAO,kBAAkB,IAAI,WAAW,KAAK;AAC/C;AC5PO,SAAS,eACd,MACA,aACA,sBACA,mBACA,YACS;AAET,QAAM,cAAc,qBAAqB,KAAK,EAAE;AAChD,MACE,gBAAgB,UAChB,YAAY,kBAAkB,IAAI,WAAW,GAC7C;AACA,WAAO;AAAA,EACT;AAGA,QAAM,WAAW,kBAAkB,IAAI,KAAK,IAAI;AAChD,MAAI,YAAY,SAAS,SAAS,GAAG;AACnC,UAAM,UAAU,WAAW,IAAI;AAC/B,QAAI,WAAW,YAAY,eAAe,IAAI,GAAG,KAAK,IAAI,IAAI,OAAO,EAAE,GAAG;AACxE,aAAO;AAAA,IACT;AAAA,EACF;AAGA,MAAI,YAAY,gBAAgB,IAAI,KAAK,IAAI,GAAG;AAC9C,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAQO,SAAS,gBACd,OACA,aACA,aACA,sBACA,mBACA,YACM;AACNG,IAAAA,UAAU,MAAM;AACd,QAAI,CAAC,eAAe,MAAM,UAAU,EAAG;AAGvC,UAAM,kCAAkB,IAAA;AAGxB,UAAM,yBAAyB,CAAC,IAAI,UAAU;AAC5C,YAAM,YAAY,MAAM;AACxB,UAAI,CAAC,UAAW,QAAO;AAEvB,YAAM,SAAS;AAAA,QACb;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,QACA;AAAA,MAAA;AAGF,UAAI,OAAQ,aAAY,IAAI,EAAE;AAC9B,YAAM,SAAS;AACf,aAAO;AAAA,IACT,CAAC;AAGD,UAAM,yBAAyB,CAAC,KAAK,OAAO,QAAQ,WAAW;AAE7D,UAAI,YAAY,IAAI,MAAM,KAAK,YAAY,IAAI,MAAM,GAAG;AACtD,cAAM,SAAS;AACf,eAAO;AAAA,MACT;AAGA,YAAM,QAAQ,MAAM;AACpB,UAAI,SAAS,YAAY,gBAAgB,IAAI,KAAK,GAAG;AACnD,cAAM,SAAS;AACf,eAAO;AAAA,MACT;AAEA,YAAM,SAAS;AACf,aAAO;AAAA,IACT,CAAC;AAAA,EACH,GAAG;AAAA,IACD;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EAAA,CACD;AACH;;;;;;ACrHA,WAAS,OAAO,GAAG;AACjB,WACE,CAAC,KACD,OAAO,MAAM,YACb,OAAO,MAAM,cACb,MAAM,QAAQ,CAAC,KACf,aAAa,OACb,aAAa,OACb,aAAa,UACb,aAAa;AAAA,EAEjB;AAEA,WAAS,gBAAgB,QAAQC,WAAU;AACzC,aAAS,UAAU,CAAA;AAEnB,QAAI,SAAS,CAAA;AAEb,aAAS,KAAKA,WAAU;AACtB,UAAI,WAAW,OAAO,CAAC;AACvB,UAAI,MAAMA,UAAS,CAAC;AAGpB,UAAI,CAAC,OAAO,GAAG,GAAG;AAChB,eAAO,CAAC,IAAI,gBAAgB,UAAU,GAAG;AAEzC;AAAA,MACN;AAGI,UAAI,aAAa,QAAW;AAC1B,eAAO,CAAC,IAAI;AAAA,MAClB,OAAW;AACL,eAAO,CAAC,IAAI;AAAA,MAClB;AAAA,IACA;AAEE,WAAO;AAAA,EACT;AAEA,aAAiB;;;;;;;;ACvCjB,MAAIL,WAAUM,eAAA;AAQd,cAAiB,SAASC,WAAU,OAAO;AACzC,QAAI,CAACP,SAAQ,KAAK;AAChB,YAAM,IAAI;AAAA,QACR;AAAA;AAGJ,QAAI,eAAe,MAAM;AAEzB,QAAI,iBAAiB,QAAS,QAAO;AAErC,QACG,MAAM,iBAAiB,KAAK,MAAM,mBAAmB,KACrD,MAAM,eAAe,KAAK,MAAM,iBAAiB;AAElD,aAAO;AAET,QAAI,MAAM,eAAe,EAAG,QAAO;AAEnC,WAAO;AAAA,EACT;;;;;;;;ACrBA,WAAS,SAAS,MAAM;AACtB,QAAI,OAAO,SAAS;AAClB,YAAM,IAAI,MAAM,6CAA6C;AAE/D,SAAK,OAAO;AAAA,EACd;AAKA,MAAI,OAAO,WAAW;AACpB,aAAS,UAAU,OAAO,QAAQ,IAAI,WAAY;AAChD,aAAO;AAAA,IACX;AAQA,WAAS,KAAK,WAAY;AACxB,QAAI,OAAO,WACT,IAAI,KAAK,QACT,IAAI;AAEN,WAAO,IAAI,SAAS,WAAY;AAC9B,UAAI,KAAK,EAAG,QAAO,EAAC,MAAM,KAAI;AAE9B,aAAO,EAAC,MAAM,OAAO,OAAO,KAAK,GAAG,EAAC;AAAA,IACzC,CAAG;AAAA,EACH;AAOA,WAAS,QAAQ,WAAY;AAC3B,QAAIH,YAAW,IAAI,SAAS,WAAY;AACtC,aAAO,EAAC,MAAM,KAAI;AAAA,IACtB,CAAG;AAED,WAAOA;AAAA,EACT;AAQA,WAAS,eAAe,SAAU,UAAU;AAC1C,QAAI,IAAI,GACN,IAAI,SAAS;AAEf,WAAO,IAAI,SAAS,WAAY;AAC9B,UAAI,KAAK,EAAG,QAAO,EAAC,MAAM,KAAI;AAE9B,aAAO,EAAC,MAAM,OAAO,OAAO,SAAS,GAAG,EAAC;AAAA,IAC7C,CAAG;AAAA,EACH;AAQA,WAAS,KAAK,SAAU,OAAO;AAC7B,QAAI,iBAAiB,SAAU,QAAO;AAEtC,WACE,OAAO,UAAU,YACjB,UAAU,QACV,OAAO,MAAM,SAAS;AAAA,EAE1B;AAKA,aAAiB;;;;;;;;;AC9EjB,QAAI,mBAAmB,KAAK,IAAI,GAAG,CAAC,IAAI,GACpC,oBAAoB,KAAK,IAAI,GAAG,EAAE,IAAI,GACtC,oBAAoB,KAAK,IAAI,GAAG,EAAE,IAAI;AAE1C,QAAI,0BAA0B,KAAK,IAAI,GAAG,CAAC,IAAI,GAC3C,2BAA2B,KAAK,IAAI,GAAG,EAAE,IAAI,GAC7C,2BAA2B,KAAK,IAAI,GAAG,EAAE,IAAI;AAEjDW,cAAA,kBAA0B,SAAS,MAAM;AACvC,UAAI,WAAW,OAAO;AAEtB,UAAI,YAAY;AACd,eAAO;AAET,UAAI,YAAY;AACd,eAAO;AAET,UAAI,YAAY;AACd,eAAO;AAET,YAAM,IAAI,MAAM,iEAAiE;AAAA,IACnF;AAEAA,cAAA,wBAAgC,SAAS,MAAM;AAC7C,UAAI,WAAW,OAAO;AAEtB,UAAI,YAAY;AACd,eAAO;AAET,UAAI,YAAY;AACd,eAAO;AAET,UAAI,YAAY;AACd,eAAO;AAET,aAAO;AAAA,IACT;AAQAA,cAAA,gBAAwB,SAAS,OAAO;AAGtC,UAAI,WAAW,QAAQ,IAAI;AAGzB,YAAI,KAAK,KAAK,KAAK,MAAM,IAAI;AAC3B,cAAI,SAAS,OAAO,SAAS;AAC3B,mBAAO;AAET,cAAI,SAAS,SAAS,SAAS;AAC7B,mBAAO;AAET,iBAAO;AAAA,QACb,OACS;AAEH,cAAI,SAAS;AACX,mBAAO;AAET,cAAI,SAAS;AACX,mBAAO;AAET,iBAAO;AAAA,QACb;AAAA,MACA;AAIE,aAAO;AAAA,IACT;AAUA,QAAI,gBAAgB;AAAA,MAClB,YAAY;AAAA,MACZ,WAAW;AAAA,MACX,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,aAAa;AAAA,MACb,YAAY;AAAA,MACZ,cAAc;AAAA,MACd,cAAc;AAAA;AAIhBA,cAAA,2BAAmC,SAAS,OAAO,QAAQ;AACzD,UAAI,UAAU,MACV,cAAc,GACd,GACAV,IACA,GACA,GACA;AAEJ,WAAK,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAI,GAAG,KAAK;AACxC,YAAI,SAAS,OAAO,MAAM,CAAC,CAAC,IAAI,MAAM,CAAC;AACvC,QAAAA,KAAIU,UAAQ,cAAc,CAAC;AAC3B,YAAI,cAAcV,GAAE,IAAI;AAExB,YAAI,IAAI,aAAa;AACnB,wBAAc;AACd,oBAAUA;AAAA,QAChB;AAAA,MACA;AAEE,aAAO;AAAA,IACT;AAQAU,cAAA,eAAuB,SAAS,OAAO;AACrC,aAAO,OAAO,gBAAgB,eAAe,YAAY,OAAO,KAAK;AAAA,IACvE;AAQAA,cAAA,SAAiB,WAAW;AAC1B,UAAI,SAAS,GACT,GACA,GACA;AAEJ,WAAK,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,GAAG;AACvC,kBAAU,UAAU,CAAC,EAAE;AAEzB,UAAI,QAAQ,IAAK,UAAU,CAAC,EAAE,YAAa,MAAM;AAEjD,WAAK,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK;AAC7B,cAAM,IAAI,UAAU,CAAC,GAAG,CAAC;AACzB,aAAK,UAAU,CAAC,EAAE;AAAA,MACtB;AAEE,aAAO;AAAA,IACT;AAQAA,cAAA,UAAkB,SAAS,QAAQ;AACjC,UAAI,eAAeA,UAAQ,gBAAgB,MAAM;AAEjD,UAAI,QAAQ,IAAI,aAAa,MAAM;AAEnC,eAAS,IAAI,GAAG,IAAI,QAAQ;AAC1B,cAAM,CAAC,IAAI;AAEb,aAAO;AAAA,IACT;AAAA;;;;;;;;AClLA,MAAI,WAAWF,gBAAA,GACX,kBAAkBG,mBAAA,EAAmC;AAOzD,WAAS,UAAU,QAAQ,QAAQ;AACjC,QAAI,UAAU,SAAS,GAAG;AACxB,eAAS;AACT,eAAS;AAAA,IACb;AAEE,QAAI,YAAY,gBAAgB,MAAM;AAGtC,SAAK,OAAO;AACZ,SAAK,SAAS;AACd,SAAK,QAAQ,IAAI,UAAU,MAAM;AACjC,SAAK,SAAS,IAAI,UAAU,MAAM;AAClC,SAAK,OAAO,IAAI,OAAO,MAAM;AAAA,EAC/B;AAOA,YAAU,UAAU,QAAQ,WAAW;AACrC,SAAK,OAAO;AAAA,EACd;AAQA,YAAU,UAAU,MAAM,SAAS,QAAQ;AACzC,QAAI,QAAQ,KAAK,OAAO,MAAM;AAE9B,WACE,QAAQ,KAAK,QACb,KAAK,MAAM,KAAK,MAAM;AAAA,EAE1B;AAQA,YAAU,UAAU,MAAM,SAAS,QAAQ;AACzC,QAAI,QAAQ,KAAK,OAAO,MAAM;AAE9B,QAAI,QAAQ,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM;AAC7C,aAAO,KAAK,KAAK,KAAK;AAExB;AAAA,EACF;AASA,YAAU,UAAU,MAAM,SAAS,QAAQ,OAAO;AAChD,QAAI,QAAQ,KAAK,OAAO,MAAM;AAE9B,QAAI,QAAQ,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM,QAAQ;AACrD,WAAK,KAAK,KAAK,IAAI;AACnB,aAAO;AAAA,IACX;AAEE,SAAK,MAAM,KAAK,IAAI,IAAI;AACxB,SAAK,OAAO,MAAM,IAAI,KAAK;AAC3B,SAAK,KAAK,KAAK,IAAI,IAAI;AACvB,SAAK;AAEL,WAAO;AAAA,EACT;AAQA,YAAU,UAAU,SAAS,SAAS,QAAQ;AAC5C,QAAI,QAAQ,KAAK,OAAO,MAAM;AAE9B,QAAI,SAAS,KAAK,QAAQ,KAAK,MAAM,KAAK,MAAM;AAC9C,aAAO;AAET,YAAQ,KAAK,MAAM,KAAK,OAAO,CAAC;AAChC,SAAK,MAAM,KAAK,OAAO,MAAM,CAAC,IAAI;AAClC,SAAK,OAAO,KAAK,IAAI,KAAK,OAAO,MAAM;AACvC,SAAK;AAEL,WAAO;AAAA,EACT;AASA,YAAU,UAAU,UAAU,SAAS,UAAU,OAAO;AACtD,YAAQ,UAAU,SAAS,IAAI,QAAQ;AAEvC,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM;AAC7B,eAAS,KAAK,OAAO,KAAK,KAAK,CAAC,GAAG,KAAK,MAAM,CAAC,CAAC;AAAA,EACpD;AAOA,YAAU,UAAU,OAAO,WAAW;AACpC,QAAI,OAAO,KAAK,MACZ,QAAQ,KAAK,OACb,IAAI;AAER,WAAO,IAAI,SAAS,WAAW;AAC7B,UAAI,IAAI,MAAM;AACZ,YAAI,OAAO,MAAM,CAAC;AAClB;AAEA,eAAO;AAAA,UACL,OAAO;AAAA;MAEf;AAEI,aAAO;AAAA,QACL,MAAM;AAAA;IAEZ,CAAG;AAAA,EACH;AAOA,YAAU,UAAU,SAAS,WAAW;AACtC,QAAI,OAAO,KAAK,MACZ,SAAS,KAAK,MACd,IAAI;AAER,WAAO,IAAI,SAAS,WAAW;AAC7B,UAAI,IAAI,MAAM;AACZ,YAAI,OAAO,OAAO,CAAC;AACnB;AAEA,eAAO;AAAA,UACL,OAAO;AAAA;MAEf;AAEI,aAAO;AAAA,QACL,MAAM;AAAA;IAEZ,CAAG;AAAA,EACH;AAOA,YAAU,UAAU,UAAU,WAAW;AACvC,QAAI,OAAO,KAAK,MACZ,QAAQ,KAAK,OACb,SAAS,KAAK,MACd,IAAI;AAER,WAAO,IAAI,SAAS,WAAW;AAC7B,UAAI,IAAI,MAAM;AACZ,YAAI,OAAO,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC;AAC/B;AAEA,eAAO;AAAA,UACL,OAAO;AAAA;MAEf;AAEI,aAAO;AAAA,QACL,MAAM;AAAA;IAEZ,CAAG;AAAA,EACH;AAKA,MAAI,OAAO,WAAW;AACpB,cAAU,UAAU,OAAO,QAAQ,IAAI,UAAU,UAAU;AAK7D,YAAU,UAAU,UAAU,WAAW;AACvC,QAAI,QAAQ,oBAAI,IAAG;AAEnB,aAAS,IAAI,GAAG,IAAI,KAAK,MAAM;AAC7B,YAAM,IAAI,KAAK,MAAM,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;AAGvC,WAAO,eAAe,OAAO,eAAe;AAAA,MAC1C,OAAO;AAAA,MACP,YAAY;AAAA,IAChB,CAAG;AAED,UAAM,SAAS,KAAK;AAEpB,QAAI,KAAK,KAAK,gBAAgB;AAC5B,YAAM,OAAO,KAAK,KAAK,YAAY;AAErC,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,WAAW;AACpB,cAAU,UAAU,uBAAO,IAAI,4BAA4B,CAAC,IAAI,UAAU,UAAU;AAKtF,cAAiB;;;;;;;;AC1OjB,MAAI,WAAWH,gBAAA,GACX,kBAAkBG,mBAAA,EAAmC;AAOzD,WAAS,eAAe,UAAU;AAEhC,QAAI,YAAY,gBAAgB,QAAQ;AAGxC,SAAK,QAAQ;AACb,SAAK,OAAO;AACZ,SAAK,WAAW;AAChB,SAAK,QAAQ,IAAI,UAAU,QAAQ;AACnC,SAAK,SAAS,IAAI,UAAU,QAAQ;AAAA,EACtC;AAOA,iBAAe,UAAU,QAAQ,WAAW;AAC1C,SAAK,QAAQ;AACb,SAAK,OAAO;AAAA,EACd;AAQA,iBAAe,UAAU,MAAM,SAAS,QAAQ;AAC9C,QAAI,KAAK,SAAS;AAChB,aAAO;AAET,QAAI,QAAQ,KAAK,OAAO,MAAM;AAE9B,QAAI,WACF,QAAQ,KAAK,aAEX,SAAS,KAAK,SACd,QAAQ,KAAK,QAAQ,KAAK,SAG1B,SAAU,KAAK,QAAQ,KAAK,QAAQ,KAAK;AAI7C,WACE,YACA,KAAK,MAAM,KAAK,MAAM;AAAA,EAE1B;AAQA,iBAAe,UAAU,UAAU,SAAS,QAAQ;AAClD,QAAI,QAAQ,KAAK,OAAO,MAAM;AAE9B,QAAI,KAAK,SAAS,GAAG;AACnB,UAAI,WACF,QAAQ,KAAK,aAEX,SAAS,KAAK,SACd,QAAQ,KAAK,QAAQ,KAAK,SAG1B,SAAU,KAAK,QAAQ,KAAK,QAAQ,KAAK;AAI7C,UAAI,YAAY,KAAK,MAAM,KAAK,MAAM;AACpC,eAAO;AAAA,IACb;AAEE,aAAS,KAAK,QAAQ,KAAK,QAAQ,KAAK;AAExC,SAAK,MAAM,KAAK,IAAI;AACpB,SAAK,OAAO,MAAM,IAAI;AACtB,SAAK;AAEL,WAAO;AAAA,EACT;AAQA,iBAAe,UAAU,UAAU,WAAW;AAC5C,QAAI,KAAK,SAAS;AAChB;AAEF,QAAI,QAAQ,KAAK;AAEjB,SAAK;AACL,SAAK;AAEL,QAAI,KAAK,UAAU,KAAK;AACtB,WAAK,QAAQ;AAEf,QAAI,SAAS,KAAK,MAAM,KAAK;AAE7B,SAAK,OAAO,MAAM,IAAI,KAAK;AAE3B,WAAO;AAAA,EACT;AASA,iBAAe,UAAU,UAAU,SAAS,UAAU,OAAO;AAC3D,YAAQ,UAAU,SAAS,IAAI,QAAQ;AAEvC,QAAI,IAAI,KAAK,UACT,IAAI,KAAK,MACT,IAAI,KAAK,OACT,IAAI;AAER,WAAO,IAAI,GAAG;AACZ,eAAS,KAAK,OAAO,KAAK,MAAM,CAAC,GAAG,GAAG,IAAI;AAC3C;AACA;AAEA,UAAI,MAAM;AACR,YAAI;AAAA,IACV;AAAA,EACA;AAOA,iBAAe,UAAU,SAAS,WAAW;AAC3C,QAAI,QAAQ,KAAK,OACb,IAAI,KAAK,UACT,IAAI,KAAK,MACT,IAAI,KAAK,OACT,IAAI;AAER,WAAO,IAAI,SAAS,WAAW;AAC7B,UAAI,KAAK;AACP,eAAO;AAAA,UACL,MAAM;AAAA;AAGV,UAAI,QAAQ,MAAM,CAAC;AAEnB;AACA;AAEA,UAAI,MAAM;AACR,YAAI;AAEN,aAAO;AAAA,QACL;AAAA,QACA,MAAM;AAAA;IAEZ,CAAG;AAAA,EACH;AAKA,MAAI,OAAO,WAAW;AACpB,mBAAe,UAAU,OAAO,QAAQ,IAAI,eAAe,UAAU;AAKvE,iBAAe,UAAU,UAAU,WAAW;AAC5C,QAAI,QAAQ,CAAA;AAEZ,SAAK,QAAQ,SAAS,QAAQ;AAC5B,YAAM,KAAK,MAAM;AAAA,IACrB,CAAG;AAGD,WAAO,eAAe,OAAO,eAAe;AAAA,MAC1C,OAAO;AAAA,MACP,YAAY;AAAA,IAChB,CAAG;AAED,UAAM,WAAW,KAAK;AAEtB,WAAO;AAAA,EACT;AAEA,MAAI,OAAO,WAAW;AACpB,mBAAe,UAAU,uBAAO,IAAI,4BAA4B,CAAC,IAAI,eAAe,UAAU;AAKhG,mBAAiB;;;;;;;;AC5MjB,WAAS,kBAAkB,KAAK;AAO9B,WAAO,SAAU,QAAQ;AACvB,UAAI,OAAO,WAAW,SAAU,UAAS,OAAO;AAEhD,aAAO,KAAK,MAAM,IAAG,IAAK,MAAM;AAAA,IACpC;AAAA,EACA;AAKA,MAAI,cAAc,kBAAkB,KAAK,MAAM;AAK/C,cAAY,oBAAoB;AAChC,kBAAiB;;;;;;;;;AC9BjB,WAAS,aAAa,OAAO;AAE3B,QAAI,OAAO,UAAU,YAAY,MAAM,KAAK,EAAG,QAAO;AAEtD,WAAO;AAAA,EACT;AAEA,WAAS,sBAAsB,gBAAgB,cAAc;AAC3D,QAAI,SAAS,CAAA;AAEb,QAAI,kBAAkB,SAAU,GAAG;AACjC,UAAI,OAAO,MAAM,YAAa,QAAO;AAErC,aAAO;AAAA,IACX;AAEE,QAAI,OAAO,iBAAiB,WAAY,mBAAkB;AAE1D,QAAI,MAAM,SAAU,YAAY;AAC9B,aAAO,gBAAgB,WAAW,cAAc,CAAC;AAAA,IACrD;AAEE,QAAI,gBAAgB,WAAY;AAC9B,aAAO,gBAAgB,MAAS;AAAA,IACpC;AAEE,QAAI,OAAO,mBAAmB,UAAU;AACtC,aAAO,iBAAiB;AACxB,aAAO,YAAY,SAAU,OAAO,MAAM;AACxC,eAAO,IAAI,MAAM,kBAAkB,IAAI,CAAC;AAAA,MAC9C;AACI,aAAO,YAAY,SAAU,MAAM,YAAY;AAC7C,eAAO,IAAI,UAAU;AAAA,MAC3B;AAAA,IACA,WAAa,OAAO,mBAAmB,YAAY;AAC/C,aAAO,iBAAiB,WAAY;AAClC,cAAM,IAAI;AAAA,UACR;AAAA;MAER;AACI,aAAO,YAAY,SAAU,OAAO,MAAM;AACxC,eAAO;AAAA,UACL,eAAe,MAAM,MAAM,kBAAkB,IAAI,CAAC;AAAA;MAE1D;AACI,aAAO,YAAY,SAAU,MAAM,YAAY;AAC7C,eAAO,gBAAgB,eAAe,MAAM,UAAU,CAAC;AAAA,MAC7D;AAAA,IACA,OAAS;AACL,aAAO,iBAAiB;AACxB,aAAO,YAAY;AACnB,aAAO,YAAY;AAAA,IACvB;AAEE,WAAO;AAAA,EACT;AAEA,WAAS,sBAAsB,gBAAgB,cAAc;AAC3D,QAAI,SAAS,CAAA;AAEb,QAAI,kBAAkB,SAAU,GAAG;AACjC,UAAI,OAAO,MAAM,YAAa,QAAO;AAErC,aAAO;AAAA,IACX;AAEE,QAAI,OAAO,iBAAiB,WAAY,mBAAkB;AAE1D,QAAI,MAAM,SAAU,YAAY;AAC9B,aAAO,gBAAgB,WAAW,cAAc,CAAC;AAAA,IACrD;AAEE,QAAI,gBAAgB,WAAY;AAC9B,aAAO,gBAAgB,MAAS;AAAA,IACpC;AAEE,QAAI,OAAO,mBAAmB,UAAU;AACtC,aAAO,iBAAiB;AACxB,aAAO,YAAY,SAAU,OAAO,MAAM;AACxC,eAAO,IAAI,MAAM,kBAAkB,IAAI,CAAC;AAAA,MAC9C;AACI,aAAO,YAAY,SAAU,MAAM,YAAY;AAC7C,eAAO,IAAI,UAAU;AAAA,MAC3B;AACI,aAAO,mBAAmB,OAAO;AACjC,aAAO,mBAAmB,OAAO;AAAA,IACrC,WAAa,OAAO,mBAAmB,YAAY;AAC/C,aAAO,iBAAiB,WAAY;AAClC,cAAM,IAAI;AAAA,UACR;AAAA;MAER;AACI,aAAO,YAAY,SAAU,OAAO,MAAM;AAExC,YAAI,cAAc,MAAM,YAAY,IAAI;AACxC,eAAO;AAAA,UACL;AAAA,YACE;AAAA,YACA,MAAM,kBAAkB,IAAI;AAAA,YAC5B,YAAY,CAAC;AAAA,YACb,YAAY,CAAC;AAAA,YACb,MAAM,kBAAkB,YAAY,CAAC,CAAC;AAAA,YACtC,MAAM,kBAAkB,YAAY,CAAC,CAAC;AAAA,YACtC,MAAM,aAAa,IAAI;AAAA,UACjC;AAAA;MAEA;AACI,aAAO,YAAY,SAAU,GAAG,GAAG,GAAGX,IAAG,IAAI,IAAI,GAAG;AAClD,eAAO,gBAAgB,eAAe,GAAG,GAAG,GAAGA,IAAG,IAAI,IAAI,CAAC,CAAC;AAAA,MAClE;AACI,aAAO,mBAAmB,SAAU,GAAG,GAAG,GAAGA,IAAG;AAC9C,eAAO,gBAAgB,eAAe,GAAG,GAAG,GAAGA,EAAC,CAAC;AAAA,MACvD;AACI,aAAO,mBAAmB,SAAU,GAAG,GAAG;AACxC,eAAO,gBAAgB,eAAe,GAAG,CAAC,CAAC;AAAA,MACjD;AAAA,IACA,OAAS;AACL,aAAO,iBAAiB;AACxB,aAAO,YAAY;AACnB,aAAO,YAAY;AACnB,aAAO,mBAAmB;AAAA,IAC9B;AAEE,WAAO;AAAA,EACT;AAEA,UAAA,wBAAgC;AAChC,UAAA,wBAAgC;AAChC,UAAA,yBAAiC,SAAU,MAAM;AAC/C,WAAO,sBAAsB,MAAM,YAAY;AAAA,EACjD;;;;;;;AC9EA,MAAI,QAAQQ,mBAAA;AACZ,MAAI,kBAAkBG,gBAAA;AACtB,MAAI,yBACFC,eAAA,EAAoC;AAEtC,MAAI,UAAU,uBAAO,IAAI,4BAA4B;AAErD,MAAIC,YAAW;AAAA,IACb,eAAe;AAAA,IACf,gBAAgB;AAAA,IAChB,YAAY;AAAA;AAGd,WAAS,uBAAuB,OAAO,SAAS;AAE9C,cAAU,gBAAgB,SAASA,SAAQ;AAE3C,QAAI,aAAa,QAAQ;AAGzB,QAAI,gBAAgB,uBAAuB,QAAQ,aAAa,EAAE;AAGlE,QAAI,QAAQ,MAAM,OAAO,MAAM,iBAAiB;AAEhD,QAAI,2BAA2B,MAAM,gBAAgB,IAAI;AACzD,QAAI,oBAAoB,MAAM,gBAAgB,MAAM,QAAQ,CAAC;AAG7D,QAAI,eAAe,QAAQ,gBACvB,eACA,MAAM,gBAAgB,MAAM,OAAO,CAAC;AAGxC,SAAK,IAAI,MAAM;AACf,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,aAAa;AAClB,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,SAAK,QAAQ,IAAI,MAAM,MAAM,KAAK;AAClC,SAAK,iBAAiB,QAAQ;AAG9B,SAAK,eAAe,IAAI,kBAAkB,IAAI;AAC9C,SAAK,UAAU,IAAI,aAAa,IAAI;AAGpC,SAAK,QAAQ,IAAI,aAAa,MAAM,KAAK;AACzC,SAAK,SAAS,IAAI,yBAAyB,MAAM,QAAQ,CAAC;AAC1D,SAAK,aAAa,IAAI,kBAAkB,MAAM,KAAK;AACnD,SAAK,aAAa,CAAA;AAClB,SAAK,UAAU;AAGf,SAAK,SAAS,IAAI,kBAAkB,MAAM,KAAK;AAC/C,SAAK,SAAS,IAAI,kBAAkB,MAAM,KAAK;AAC/C,SAAK,eAAe,IAAI,aAAa,MAAM,KAAK;AAEhD,QAAI,MAAM,CAAA;AAEV,QAAI;AAEJ,QAAI,IAAI,GACN,IAAI;AAEN,QAAI,OAAO;AAEX,UAAM,YAAY,SAAU,MAAM;AAChC,WAAK,MAAM,CAAC,IAAI;AAGhB,UAAI,IAAI,IAAI;AAGZ,WAAK,MAAM,iCAAiC,IAAI;AAChD,WAAK,OAAO,CAAC,IAAI;AAGjB,WAAK,WAAW,CAAC,IAAI;AACrB,WAAK,OAAO,CAAC,IAAI;AACjB;AAAA,IACJ,CAAG;AAGD,UAAM,YAAY,SAAU,MAAM,MAAM,QAAQ,QAAQ,IAAI,IAAI,GAAG;AACjE,eAAS,cAAc,MAAM,MAAM,QAAQ,QAAQ,IAAI,IAAI,CAAC;AAE5D,eAAS,IAAI,MAAM;AACnB,eAAS,IAAI,MAAM;AAEnB,WAAK,KAAK;AAGV,UAAI,WAAW,QAAQ;AACrB,aAAK,aAAa,MAAM,KAAK,SAAS;AACtC,aAAK,MAAM,MAAM,IAAI,SAAS;AAAA,MACpC,OAAW;AACL,aAAK,aAAa,MAAM,KAAK;AAC7B,aAAK,aAAa,MAAM,KAAK;AAE7B,YAAI,cAAc,EAAE,KAAK,OAAO,MAAM,GACpC,cAAc,EAAE,KAAK,OAAO,MAAM;AAEpC,aAAK,aAAa,WAAW,IAAI;AACjC,aAAK,aAAa,WAAW,IAAI;AAEjC,aAAK,QAAQ,WAAW,IAAI;AAC5B,aAAK,QAAQ,WAAW,IAAI;AAAA,MAClC;AAAA,IACA,CAAG;AAED,SAAK,OAAO,CAAC,IAAI,KAAK;AAEtB,QAAI,KAAK,eAAgB,MAAK,WAAW,KAAK,KAAK,WAAW,OAAO;AAAA,QAChE,MAAK,UAAU,KAAK,WAAW,MAAK;AAAA,EAC3C;AAEA,yBAAuB,UAAU,UAAU,SAAU,GAAG,QAAQ;AAC9D,QAAI,mBAAmB,KAAK,WAAW,CAAC;AAGxC,QAAI,KAAK,OAAO,gBAAgB,MAAM,EAAG,QAAO;AAEhD,QAAI,eAAe,KAAK,OAAO,EAAE,KAAK,CAAC;AAEvC,QAAI,QAAQ,KAAK,MAAM,CAAC;AAExB,SAAK,aAAa,gBAAgB,KAAK,SAAS;AAChD,SAAK,aAAa,YAAY,KAAK,SAAS;AAE5C,SAAK,WAAW,CAAC,IAAI;AAErB,SAAK,OAAO,gBAAgB;AAC5B,SAAK,OAAO,YAAY;AAExB,WAAO;AAAA,EACT;AAEA,yBAAuB,UAAU,OAAO,SAAU,GAAG,QAAQ,iBAAiB;AAC5E,QAAI,mBAAmB,KAAK,WAAW,CAAC,GACtC,QAAQ,KAAK,MAAM,CAAC;AAEtB,SAAK,aAAa,gBAAgB,KAAK,SAAS;AAChD,SAAK,aAAa,eAAe,KAAK,SAAS;AAE/C,SAAK,WAAW,CAAC,IAAI;AAErB,QAAI,WAAW,KAAK,OAAO,gBAAgB,QAAQ;AACnD,SAAK,OAAO,eAAe;AAE3B,QAAI,SAAU,MAAK,OAAO,KAAK,GAAG,IAAI;AAAA,EACxC;AAEA,yBAAuB,UAAU,oBAAoB,SAAU,GAAG;AAChE,QAAI,GAAG,GAAG;AAEV,QAAI,SAAS;AAEb,SAAK,IAAI,KAAK,OAAO,CAAC,GAAG,IAAI,KAAK,OAAO,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK;AAC3D,eAAS,KAAK,QAAQ,CAAC;AAEvB,gBAAU;AAAA,IACd;AAEE,WAAO;AAAA,EACT;AAEA,yBAAuB,UAAU,mBAAmB,SAAU,GAAG;AAC/D,QAAI,SAAS,KAAK,kBAAkB,CAAC;AACrC,WAAO,KAAK,QAAQ,GAAG,MAAM;AAAA,EAC/B;AAEA,yBAAuB,UAAU,gBAAgB,SAAU,GAAG,IAAI;AAChE,QAAI,SAAS,KAAK,kBAAkB,CAAC;AACrC,SAAK,KAAK,GAAG,QAAQ,EAAE;AAAA,EACzB;AAEA,yBAAuB,UAAU,UAAU,WAAY;AACrD,QAAI,eAAe,IAAI,MAAM,KAAK,IAAI,KAAK,CAAC,GAC1C,YAAY,CAAA;AAEd,QAAI,IAAI,KAAK,MAAM;AAEnB,QAAI,IAAI,GACN,IAAI;AAEN,QAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,MAAM;AAGjC,SAAK,IAAI,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK;AAClC,WAAK,KAAK,WAAW,CAAC;AAEtB,UAAI,EAAE,MAAM,YAAY;AACtB,kBAAU,EAAE,IAAI;AAChB,qBAAa,CAAC,IAAI;AAAA,UAChB,KAAK,CAAA;AAAA,UACL,cAAc,KAAK,aAAa,EAAE;AAAA,UAClC,iBAAiB;AAAA;AAEnB;AAAA,MACN;AAGI,WAAK,WAAW,CAAC,IAAI,UAAU,EAAE;AAAA,IACrC;AAGE,QAAI,cAAc;AAElB,QAAI,KAAK,gBAAgB;AACvB,qBAAe,KAAK,WAAW,KAAK,KAAK;AACzC,kBAAY,KAAK,MAAM,gBAAgB,CAAC,GAAG,CAAC;AAE5C,WAAK,IAAI,GAAG,IAAI,GAAG,IAAK,WAAU,CAAC,IAAI,KAAK,WAAW,aAAa,CAAC,CAAC;AAEtE,WAAK,WAAW,KAAK,SAAS;AAAA,IAClC,OAAS;AACL,WAAK,IAAI,GAAG,IAAI,GAAG,IAAK,MAAK,QAAQ,CAAC,IAAI,KAAK,WAAW,KAAK,QAAQ,CAAC,CAAC;AAAA,IAC7E;AAGE,SAAK,IAAI,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK;AAClC,WAAK,KAAK,WAAW,CAAC;AAEtB,aAAO,aAAa,EAAE;AACtB,YAAM,KAAK;AACX,WAAK,mBAAmB,KAAK,MAAM,CAAC;AAEpC,WAAK,IAAI,KAAK,OAAO,CAAC,GAAG,IAAI,KAAK,OAAO,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK;AAC3D,YAAI,KAAK,aAAa,CAAC;AACvB,aAAK,KAAK,WAAW,CAAC;AAEtB,YAAI,OAAO,IAAI;AACb,eAAK,mBAAmB,KAAK,QAAQ,CAAC;AACtC;AAAA,QACR;AAEM,YAAI,EAAE,MAAM,KAAM,KAAI,EAAE,IAAI;AAE5B,YAAI,EAAE,KAAK,KAAK,QAAQ,CAAC;AAAA,MAC/B;AAAA,IACA;AAGE,SAAK,IAAI;AAET,QAAI;AAEJ,SAAK,KAAK,GAAG,KAAK,GAAG,MAAM;AACzB,aAAO,aAAa,EAAE;AACtB,YAAM,KAAK;AAEX,WAAK,CAAC;AAEN,WAAK,aAAa,EAAE,IAAI,KAAK;AAC7B,WAAK,MAAM,EAAE,IAAI,KAAK;AACtB,WAAK,OAAO,EAAE,IAAI;AAElB,WAAK,OAAO,EAAE,IAAI;AAClB,WAAK,WAAW,EAAE,IAAI;AAEtB,WAAK,MAAM,KAAK;AACd,aAAK,aAAa,CAAC,IAAI,CAAC;AACxB,aAAK,QAAQ,CAAC,IAAI,IAAI,EAAE;AAExB;AACA;AAAA,MACN;AAAA,IACA;AAEE,SAAK,OAAO,CAAC,IAAI;AAEjB,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK;AAEL,WAAO;AAAA,EACT;AAEA,yBAAuB,UAAU,aAAa,WAAY;AACxD,QAAI,IAAI,IAAI,GAAG,GAAG;AAElB,QAAI,IAAI;AACR,QAAI,KAAK,KAAK,IAAI;AAClB,QAAI,kBAAkB,IAAI,aAAa,KAAK,CAAC;AAE7C,SAAK,IAAI,GAAG,IAAI,KAAK,GAAG,KAAK;AAC3B,WAAK,KAAK,WAAW,CAAC;AACtB,sBAAgB,EAAE,KAAK,KAAK,MAAM,CAAC;AAEnC,WAAK,IAAI,KAAK,OAAO,CAAC,GAAG,IAAI,KAAK,OAAO,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK;AAC3D,aAAK,KAAK,WAAW,KAAK,aAAa,CAAC,CAAC;AAEzC,YAAI,OAAO,GAAI;AAEf,wBAAgB,EAAE,KAAK,KAAK,QAAQ,CAAC;AAAA,MAC3C;AAAA,IACA;AAEE,SAAK,IAAI,GAAG,IAAI,KAAK,GAAG,KAAK;AAC3B,WACE,gBAAgB,CAAC,IAAI,KACrB,KAAK,IAAI,KAAK,aAAa,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK;AAAA,IACpD;AAEE,WAAO;AAAA,EACT;AAEA,yBAAuB,UAAU,QAAQ,SACvC,GACA,QACA,uBACA,iBACA;AACA,QAAI,IAAI,KAAK;AAEb,QAAI,6BAA6B,KAAK,aAAa,eAAe;AAElE,cAAU,KAAK,MAAM,CAAC;AAEtB,WACE,wBAAwB;AAAA,IACvB,6BAA6B,SAAS,KAAK,cAAe,IAAI,IAAI;AAAA,EAEvE;AAEA,yBAAuB,UAAU,wBAAwB,SACvD,GACA,QACA,uBACA,iBACA;AACA,QAAI,IAAI,KAAK;AAEb,QAAI,6BAA6B,KAAK,aAAa,eAAe;AAElE,cAAU,KAAK,MAAM,CAAC;AAEtB,WACE,wBAAwB;AAAA,KACtB,6BAA6B,UAAU,SAAS,KAAK,cACpD,IAAI,IAAI;AAAA,EAEf;AAIA,yBAAuB,UAAU,YAAY,SAC3C,GACA,QACA,uBACA,iBACA;AACA,QAAI,IAAI,KAAK;AAEb,QAAI,6BAA6B,KAAK,aAAa,eAAe;AAElE,cAAU,KAAK,MAAM,CAAC;AAEtB,WACE,wBACC,SAAS,6BAA6B,KAAK,cAAe,IAAI;AAAA,EAEnE;AAEA,yBAAuB,UAAU,4BAA4B,SAC3D,GACA,QACA,uBACA,iBACA;AACA,QAAI,IAAI,KAAK;AAEb,QAAI,6BAA6B,KAAK,aAAa,eAAe;AAElE,cAAU,KAAK,MAAM,CAAC;AAEtB,WACE,wBACC,UAAU,6BAA6B,UAAU,KAAK,cAAe,IAAI;AAAA,EAE9E;AAEA,yBAAuB,UAAU,SAAS,SAAU,GAAG;AACrD,WAAO,CAAC,KAAK,OAAO,CAAC,GAAG,KAAK,OAAO,IAAI,CAAC,CAAC;AAAA,EAC5C;AAEA,yBAAuB,UAAU,UAAU,WAAY;AACrD,QAAI,OAAO;AAEX,QAAI,aAAa,CAAA;AAEjB,SAAK,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,QAAQ,SAAU,MAAM,GAAG;AACrD,iBAAW,IAAI,IAAI,MAAM;AAAA,QACvB,KAAK,aAAa,MAAM,KAAK,OAAO,CAAC,GAAG,KAAK,OAAO,IAAI,CAAC,CAAC;AAAA,MAChE,EAAM,IAAI,SAAU,GAAG;AACjB,eAAO,KAAK,MAAM,CAAC;AAAA,MACzB,CAAK;AAAA,IACL,CAAG;AAED,WAAO;AAAA,EACT;AAEA,yBAAuB,UAAU,UAAU,SAAU,OAAO;AAC1D,QAAI,UAAU,SAAS,EAAG,SAAQ,KAAK;AAEvC,QAAI,IAAI,CAAA;AAER,QAAI,UAAU,KAAK,iBAAiB,KAAK,WAAW,KAAK,IAAI,KAAK;AAElE,QAAI,GAAG;AAEP,SAAK,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAAI,GAAG,IAAK,GAAE,KAAK,MAAM,CAAC,CAAC,IAAI,QAAQ,CAAC;AAExE,WAAO;AAAA,EACT;AAEA,yBAAuB,UAAU,SAAS,SAAU,MAAM,OAAO;AAC/D,QAAI,UAAU,SAAS,EAAG,SAAQ,KAAK;AAEvC,QAAI,UAAU,KAAK,iBAAiB,KAAK,WAAW,KAAK,IAAI,KAAK;AAElE,QAAI,GAAG;AAEP,SAAK,IAAI,GAAG,IAAI,QAAQ,QAAQ,IAAI,GAAG;AACrC,WAAK,MAAM,iBAAiB,KAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,CAAC,CAAC;AAAA,EAC/D;AAEA,yBAAuB,UAAU,OAAO,IAAI,WAAY;AACtD,QAAI,QAAQ,CAAA;AAGZ,WAAO,eAAe,OAAO,eAAe;AAAA,MAC1C,OAAO;AAAA,MACP,YAAY;AAAA,IAChB,CAAG;AAED,UAAM,IAAI,KAAK;AACf,UAAM,IAAI,KAAK;AACf,UAAM,IAAI,KAAK;AACf,UAAM,IAAI,KAAK;AACf,UAAM,aAAa,KAAK;AACxB,UAAM,QAAQ,KAAK;AACnB,UAAM,QAAQ,KAAK;AACnB,UAAM,SAAS,KAAK,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;AAE/C,QAAI,aAAa,CAAC,gBAAgB,SAAS;AAC3C,QAAI,aAAa,CAAC,UAAU,SAAS,cAAc,cAAc;AAEjE,QAAI,OAAO;AAEX,eAAW,QAAQ,SAAU,KAAK;AAChC,YAAM,GAAG,IAAI,KAAK,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;AAAA,IAC3C,CAAG;AAED,eAAW,QAAQ,SAAU,KAAK;AAChC,YAAM,GAAG,IAAI,KAAK,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;AAAA,IAC3C,CAAG;AAED,UAAM,SAAS,KAAK,OAAO,MAAM,GAAG,KAAK,CAAC;AAE1C,QAAI,KAAK,eAAgB,OAAM,aAAa,KAAK;AAAA,QAC5C,OAAM,UAAU,KAAK;AAE1B,WAAO;AAAA,EACT;AAEA,WAAS,qBAAqB,OAAO,SAAS;AAE5C,cAAU,gBAAgB,SAASA,SAAQ;AAE3C,QAAI,aAAa,QAAQ;AAGzB,QAAI,gBAAgB,uBAAuB,QAAQ,aAAa,EAAE;AAGlE,QAAI,QAAQ,MAAM,OAAO,MAAM,iBAAiB;AAEhD,QAAI,2BAA2B,MAAM,gBAAgB,IAAI;AACzD,QAAI,oBAAoB,MAAM,gBAAgB,MAAM,QAAQ,CAAC;AAG7D,QAAI,eAAe,QAAQ,gBACvB,eACA,MAAM,gBAAgB,MAAM,OAAO,CAAC;AAGxC,SAAK,IAAI,MAAM;AACf,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK,aAAa;AAClB,SAAK,QAAQ;AACb,SAAK,QAAQ;AACb,SAAK,QAAQ,IAAI,MAAM,MAAM,KAAK;AAClC,SAAK,iBAAiB,QAAQ;AAI9B,SAAK,eAAe,IAAI,kBAAkB,IAAI;AAC9C,SAAK,UAAU,IAAI,aAAa,IAAI;AAGpC,SAAK,QAAQ,IAAI,aAAa,MAAM,KAAK;AACzC,SAAK,SAAS,IAAI,yBAAyB,MAAM,QAAQ,CAAC;AAC1D,SAAK,UAAU,IAAI,yBAAyB,MAAM,KAAK;AACvD,SAAK,aAAa,IAAI,kBAAkB,MAAM,KAAK;AACnD,SAAK,aAAa,CAAA;AAGlB,SAAK,SAAS,IAAI,kBAAkB,MAAM,KAAK;AAC/C,SAAK,SAAS,IAAI,kBAAkB,MAAM,KAAK;AAC/C,SAAK,iBAAiB,IAAI,aAAa,MAAM,KAAK;AAClD,SAAK,kBAAkB,IAAI,aAAa,MAAM,KAAK;AAEnD,QAAI,MAAM,CAAA;AAEV,QAAI;AAEJ,QAAI,IAAI,GACN,IAAI;AAEN,QAAI,OAAO;AAEX,UAAM,YAAY,SAAU,MAAM;AAChC,WAAK,MAAM,CAAC,IAAI;AAGhB,UAAI,IAAI,IAAI;AAGZ,WAAK,MAAM,0BAA0B,IAAI;AACzC,WAAK,OAAO,CAAC,IAAI;AAEjB,WAAK,MAAM,yBAAyB,IAAI;AACxC,WAAK,QAAQ,CAAC,IAAI;AAGlB,WAAK,WAAW,CAAC,IAAI;AACrB,WAAK,OAAO,CAAC,IAAI;AACjB;AAAA,IACJ,CAAG;AAGD,UAAM,YAAY,SAAU,MAAM,MAAM,QAAQ,QAAQ,IAAI,IAAI,GAAG;AACjE,eAAS,cAAc,MAAM,MAAM,QAAQ,QAAQ,IAAI,IAAI,CAAC;AAE5D,eAAS,IAAI,MAAM;AACnB,eAAS,IAAI,MAAM;AAEnB,WAAK,KAAK;AAGV,UAAI,WAAW,QAAQ;AACrB,aAAK,MAAM,MAAM,KAAK;AACtB,aAAK,eAAe,MAAM,KAAK;AAC/B,aAAK,gBAAgB,MAAM,KAAK;AAAA,MACtC,OAAW;AACL,aAAK,gBAAgB,MAAM,KAAK;AAChC,aAAK,eAAe,MAAM,KAAK;AAE/B,YAAI,cAAc,EAAE,KAAK,OAAO,MAAM,GACpC,cAAc,EAAE,KAAK,QAAQ,MAAM;AAErC,aAAK,aAAa,WAAW,IAAI;AACjC,aAAK,aAAa,WAAW,IAAI;AAEjC,aAAK,QAAQ,WAAW,IAAI;AAC5B,aAAK,QAAQ,WAAW,IAAI;AAAA,MAClC;AAAA,IACA,CAAG;AAED,SAAK,OAAO,CAAC,IAAI,KAAK;AAEtB,QAAI,KAAK,eAAgB,MAAK,WAAW,KAAK,KAAK,WAAW,OAAO;AAAA,QAChE,MAAK,UAAU,KAAK,WAAW,MAAK;AAAA,EAC3C;AAEA,uBAAqB,UAAU,SAAS,uBAAuB,UAAU;AAEzE,uBAAqB,UAAU,WAAW,SAAU,GAAG;AACrD,WAAO,CAAC,KAAK,QAAQ,CAAC,GAAG,KAAK,OAAO,IAAI,CAAC,CAAC;AAAA,EAC7C;AAEA,uBAAqB,UAAU,YAAY,SAAU,GAAG;AACtD,WAAO,CAAC,KAAK,OAAO,CAAC,GAAG,KAAK,QAAQ,CAAC,CAAC;AAAA,EACzC;AAEA,uBAAqB,UAAU,UAC7B,uBAAuB,UAAU;AAEnC,uBAAqB,UAAU,YAAY,WAAY;AACrD,QAAI,OAAO;AAEX,QAAI,aAAa,CAAA;AAEjB,SAAK,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,QAAQ,SAAU,MAAM,GAAG;AACrD,iBAAW,IAAI,IAAI,MAAM;AAAA,QACvB,KAAK,aAAa,MAAM,KAAK,QAAQ,CAAC,GAAG,KAAK,OAAO,IAAI,CAAC,CAAC;AAAA,MACjE,EAAM,IAAI,SAAU,GAAG;AACjB,eAAO,KAAK,MAAM,CAAC;AAAA,MACzB,CAAK;AAAA,IACL,CAAG;AAED,WAAO;AAAA,EACT;AAEA,uBAAqB,UAAU,aAAa,WAAY;AACtD,QAAI,OAAO;AAEX,QAAI,aAAa,CAAA;AAEjB,SAAK,MAAM,MAAM,GAAG,KAAK,CAAC,EAAE,QAAQ,SAAU,MAAM,GAAG;AACrD,iBAAW,IAAI,IAAI,MAAM;AAAA,QACvB,KAAK,aAAa,MAAM,KAAK,OAAO,CAAC,GAAG,KAAK,QAAQ,CAAC,CAAC;AAAA,MAC7D,EAAM,IAAI,SAAU,GAAG;AACjB,eAAO,KAAK,MAAM,CAAC;AAAA,MACzB,CAAK;AAAA,IACL,CAAG;AAED,WAAO;AAAA,EACT;AAEA,uBAAqB,UAAU,UAAU,SAAU,GAAG,UAAU,WAAW;AACzE,QAAI,mBAAmB,KAAK,WAAW,CAAC;AAGxC,QAAI,KAAK,OAAO,gBAAgB,MAAM,EAAG,QAAO;AAEhD,QAAI,eAAe,KAAK,OAAO,EAAE,KAAK,CAAC;AAEvC,QAAI,QAAQ,KAAK,MAAM,CAAC;AAExB,SAAK,eAAe,gBAAgB,KAAK,WAAW;AACpD,SAAK,eAAe,YAAY,KAAK,WAAW;AAEhD,SAAK,gBAAgB,gBAAgB,KAAK,YAAY;AACtD,SAAK,gBAAgB,YAAY,KAAK,YAAY;AAElD,SAAK,WAAW,CAAC,IAAI;AAErB,SAAK,OAAO,gBAAgB;AAC5B,SAAK,OAAO,YAAY;AAExB,WAAO;AAAA,EACT;AAEA,uBAAqB,UAAU,OAAO,SACpC,GACA,UACA,WACA,iBACA;AACA,QAAI,mBAAmB,KAAK,WAAW,CAAC,GACtC,QAAQ,KAAK,MAAM,CAAC;AAEtB,SAAK,eAAe,gBAAgB,KAAK,WAAW;AACpD,SAAK,eAAe,eAAe,KAAK,WAAW;AAEnD,SAAK,gBAAgB,gBAAgB,KAAK,YAAY;AACtD,SAAK,gBAAgB,eAAe,KAAK,YAAY;AAErD,SAAK,WAAW,CAAC,IAAI;AAErB,QAAI,WAAW,KAAK,OAAO,gBAAgB,QAAQ;AACnD,SAAK,OAAO,eAAe;AAE3B,QAAI,SAAU,MAAK,OAAO,KAAK,GAAG,IAAI;AAAA,EACxC;AAEA,uBAAqB,UAAU,sBAAsB,SAAU,GAAG;AAChE,QAAI,GAAG,GAAG;AAEV,QAAI,WAAW;AAEf,SAAK,IAAI,KAAK,QAAQ,CAAC,GAAG,IAAI,KAAK,OAAO,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK;AAC5D,eAAS,KAAK,QAAQ,CAAC;AAEvB,kBAAY;AAAA,IAChB;AAEE,WAAO;AAAA,EACT;AAEA,uBAAqB,UAAU,uBAAuB,SAAU,GAAG;AACjE,QAAI,GAAG,GAAG;AAEV,QAAI,YAAY;AAEhB,SAAK,IAAI,KAAK,OAAO,CAAC,GAAG,IAAI,KAAK,QAAQ,CAAC,GAAG,IAAI,GAAG,KAAK;AACxD,eAAS,KAAK,QAAQ,CAAC;AAEvB,mBAAa;AAAA,IACjB;AAEE,WAAO;AAAA,EACT;AAEA,uBAAqB,UAAU,gBAAgB,SAAU,GAAG,IAAI;AAC9D,QAAI,WAAW,KAAK,oBAAoB,CAAC,GACvC,YAAY,KAAK,qBAAqB,CAAC;AAEzC,SAAK,KAAK,GAAG,UAAU,WAAW,EAAE;AAAA,EACtC;AAEA,uBAAqB,UAAU,UAAU,WAAY;AACnD,QAAI,eAAe,IAAI,MAAM,KAAK,IAAI,KAAK,CAAC,GAC1C,YAAY,CAAA;AAEd,QAAI,IAAI,KAAK,MAAM;AAEnB,QAAI,IAAI,GACN,IAAI;AAEN,QAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,MAAM,QAAQ,KAAK,KAAK,OAAO;AAG1D,SAAK,IAAI,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK;AAClC,WAAK,KAAK,WAAW,CAAC;AAEtB,UAAI,EAAE,MAAM,YAAY;AACtB,kBAAU,EAAE,IAAI;AAChB,qBAAa,CAAC,IAAI;AAAA,UAChB,OAAO,CAAA;AAAA,UACP,QAAQ,CAAA;AAAA,UACR,gBAAgB,KAAK,eAAe,EAAE;AAAA,UACtC,iBAAiB,KAAK,gBAAgB,EAAE;AAAA,UACxC,iBAAiB;AAAA;AAEnB;AAAA,MACN;AAGI,WAAK,WAAW,CAAC,IAAI,UAAU,EAAE;AAAA,IACrC;AAGE,QAAI,cAAc;AAElB,QAAI,KAAK,gBAAgB;AACvB,qBAAe,KAAK,WAAW,KAAK,KAAK;AACzC,kBAAY,KAAK,MAAM,gBAAgB,CAAC,GAAG,CAAC;AAE5C,WAAK,IAAI,GAAG,IAAI,GAAG,IAAK,WAAU,CAAC,IAAI,KAAK,WAAW,aAAa,CAAC,CAAC;AAEtE,WAAK,WAAW,KAAK,SAAS;AAAA,IAClC,OAAS;AACL,WAAK,IAAI,GAAG,IAAI,GAAG,IAAK,MAAK,QAAQ,CAAC,IAAI,KAAK,WAAW,KAAK,QAAQ,CAAC,CAAC;AAAA,IAC7E;AAGE,SAAK,IAAI,GAAG,IAAI,KAAK,GAAG,IAAI,GAAG,KAAK;AAClC,WAAK,KAAK,WAAW,CAAC;AACtB,eAAS,KAAK,QAAQ,CAAC;AAEvB,aAAO,aAAa,EAAE;AACtB,cAAQ,KAAK;AACb,eAAS,KAAK;AACd,WAAK,mBAAmB,KAAK,MAAM,CAAC;AAEpC,WAAK,IAAI,KAAK,OAAO,CAAC,GAAG,IAAI,KAAK,OAAO,IAAI,CAAC,GAAG,IAAI,GAAG,KAAK;AAC3D,YAAI,KAAK,aAAa,CAAC;AACvB,aAAK,KAAK,WAAW,CAAC;AACtB,cAAM,IAAI;AAEV,cAAM,MAAM,SAAS;AAErB,YAAI,OAAO,IAAI;AACb,cAAI,IAAK,MAAK,mBAAmB,KAAK,QAAQ,CAAC;AAE/C;AAAA,QACR;AAEM,YAAI,EAAE,MAAM,KAAM,KAAI,EAAE,IAAI;AAE5B,YAAI,EAAE,KAAK,KAAK,QAAQ,CAAC;AAAA,MAC/B;AAAA,IACA;AAGE,SAAK,IAAI;AAET,QAAI;AAEJ,SAAK,KAAK,GAAG,KAAK,GAAG,MAAM;AACzB,aAAO,aAAa,EAAE;AACtB,cAAQ,KAAK;AACb,eAAS,KAAK;AAEd,WAAK,CAAC;AAEN,WAAK,eAAe,EAAE,IAAI,KAAK;AAC/B,WAAK,gBAAgB,EAAE,IAAI,KAAK;AAChC,WAAK,MAAM,EAAE,IAAI,KAAK;AACtB,WAAK,OAAO,EAAE,IAAI;AAElB,WAAK,OAAO,EAAE,IAAI;AAClB,WAAK,WAAW,EAAE,IAAI;AAEtB,WAAK,MAAM,QAAQ;AACjB,aAAK,aAAa,CAAC,IAAI,CAAC;AACxB,aAAK,QAAQ,CAAC,IAAI,OAAO,EAAE;AAE3B;AACA;AAAA,MACN;AAEI,WAAK,QAAQ,EAAE,IAAI;AAEnB,WAAK,MAAM,OAAO;AAChB,aAAK,aAAa,CAAC,IAAI,CAAC;AACxB,aAAK,QAAQ,CAAC,IAAI,MAAM,EAAE;AAE1B;AACA;AAAA,MACN;AAAA,IACA;AAEE,SAAK,OAAO,CAAC,IAAI;AAEjB,SAAK,IAAI;AACT,SAAK,IAAI;AACT,SAAK;AAEL,WAAO;AAAA,EACT;AAEA,uBAAqB,UAAU,aAAa,WAAY;AACtD,QAAI,IAAI,IAAI,GAAG,GAAG;AAElB,QAAI,IAAI;AACR,QAAI,IAAI,KAAK;AACb,QAAI,kBAAkB,IAAI,aAAa,KAAK,CAAC;AAE7C,SAAK,IAAI,GAAG,IAAI,KAAK,GAAG,KAAK;AAC3B,WAAK,KAAK,WAAW,CAAC;AACtB,sBAAgB,EAAE,KAAK,KAAK,MAAM,CAAC;AAEnC,WAAK,IAAI,KAAK,OAAO,CAAC,GAAG,IAAI,KAAK,QAAQ,CAAC,GAAG,IAAI,GAAG,KAAK;AACxD,aAAK,KAAK,WAAW,KAAK,aAAa,CAAC,CAAC;AAEzC,YAAI,OAAO,GAAI;AAEf,wBAAgB,EAAE,KAAK,KAAK,QAAQ,CAAC;AAAA,MAC3C;AAAA,IACA;AAEE,SAAK,IAAI,GAAG,IAAI,KAAK,GAAG;AACtB,WACE,gBAAgB,CAAC,IAAI,IACnB,KAAK,eAAe,CAAC,IAAI,KAAK,gBAAgB,CAAC,IAAK,KAAK,IAAI,GAAG,CAAC,IACjE,KAAK;AAEX,WAAO;AAAA,EACT;AAEA,uBAAqB,UAAU,QAAQ,SACrC,GACA,UACA,WACA,uBACA,iBACA;AACA,QAAI,IAAI,KAAK;AAEb,QAAI,+BAA+B,KAAK,eAAe,eAAe,GACpE,gCAAgC,KAAK,gBAAgB,eAAe;AAEtE,QAAI,QAAQ,KAAK,MAAM,CAAC;AAExB,gBAAY;AACZ,iBAAa;AAEb,WACE,wBAAwB,KACtB,YAAY,+BACZ,WAAW,iCACX,KAAK,cACJ,IAAI;AAAA,EAEX;AAEA,uBAAqB,UAAU,wBAAwB,SACrD,GACA,UACA,WACA,uBACA,iBACA;AACA,QAAI,IAAI,KAAK;AAEb,QAAI,+BAA+B,KAAK,eAAe,eAAe,GACpE,gCAAgC,KAAK,gBAAgB,eAAe;AAEtE,QAAI,QAAQ,KAAK,MAAM,CAAC;AAExB,gBAAY;AACZ,iBAAa;AAEb,WACE,wBAAwB,KACtB,aAAa,+BAA+B,YAC5C,YAAY,gCAAgC,cAC5C,KAAK,cACJ,IAAI;AAAA,EAEX;AAEA,uBAAqB,UAAU,UAC7B,uBAAuB,UAAU;AACnC,uBAAqB,UAAU,SAAS,uBAAuB,UAAU;AAEzE,uBAAqB,UAAU,OAAO,IAAI,WAAY;AACpD,QAAI,QAAQ,CAAA;AAGZ,WAAO,eAAe,OAAO,eAAe;AAAA,MAC1C,OAAO;AAAA,MACP,YAAY;AAAA,IAChB,CAAG;AAED,UAAM,IAAI,KAAK;AACf,UAAM,IAAI,KAAK;AACf,UAAM,IAAI,KAAK;AACf,UAAM,IAAI,KAAK;AACf,UAAM,aAAa,KAAK;AACxB,UAAM,QAAQ,KAAK;AACnB,UAAM,QAAQ,KAAK;AACnB,UAAM,SAAS,KAAK,OAAO,MAAM,GAAG,MAAM,IAAI,CAAC;AAE/C,QAAI,aAAa,CAAC,gBAAgB,SAAS;AAC3C,QAAI,aAAa;AAAA,MACf;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAGF,QAAI,OAAO;AAEX,eAAW,QAAQ,SAAU,KAAK;AAChC,YAAM,GAAG,IAAI,KAAK,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;AAAA,IAC3C,CAAG;AAED,eAAW,QAAQ,SAAU,KAAK;AAChC,YAAM,GAAG,IAAI,KAAK,GAAG,EAAE,MAAM,GAAG,MAAM,CAAC;AAAA,IAC3C,CAAG;AAED,UAAM,SAAS,KAAK,OAAO,MAAM,GAAG,KAAK,CAAC;AAE1C,QAAI,KAAK,eAAgB,OAAM,aAAa,KAAK;AAAA,QAC5C,OAAM,UAAU,KAAK;AAE1B,WAAO;AAAA,EACT;AAEAC,YAAA,yBAAiC;AACjCA,YAAA,uBAA+B;;;;;;;;ACv9B/B,MAAI,kBAAkBN,gBAAA;AACtB,MAAIN,WAAUS,eAAA;AACd,MAAIF,aAAYG,iBAAA;AAChB,MAAI,YAAYG,iBAAA;AAChB,MAAI,iBAAiBC,sBAAA;AACrB,MAAI,oBAAoBC,mBAAA,EAAoC;AAE5D,MAAI,UAAUC,eAAA;AAEd,MAAI,yBAAyB,QAAQ;AACrC,MAAI,uBAAuB,QAAQ;AAEnC,MAAIL,YAAW;AAAA,IACb,wBAAwB;AAAA,IACxB,eAAe;AAAA,IACf,gBAAgB;AAAA,IAChB,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ,KAAK,KAAK;AAAA;AAGZ,WAAS,qBAAqB,KAAK,WAAW,QAAQ;AACpD,QAAI,gBAAgB,IAAI,IAAI,SAAS;AAErC,QAAI,OAAO,kBAAkB,YAAa,iBAAgB;AAE1D,qBAAiB;AAEjB,QAAI,IAAI,WAAW,aAAa;AAAA,EAClC;AAEA,MAAI,UAAU;AAEd,WAAS,WACP,eACA,kBACA,iBACA,OACA,WACA;AACA,QAAI,KAAK,IAAI,QAAQ,SAAS,IAAI,SAAS;AACzC,UAAI,kBAAkB,kBAAkB;AACtC,eAAO;AAAA,MACb,OAAW;AACL,eAAO,kBAAkB;AAAA,MAC/B;AAAA,IACA,WAAa,QAAQ,WAAW;AAC5B,aAAO;AAAA,IACX;AAEE,WAAO;AAAA,EACT;AAEA,WAAS,kBAAkB,UAAU,OAAO,SAAS;AACnD,QAAI,QAAQ,IAAI,uBAAuB,OAAO;AAAA,MAC5C,eAAe,QAAQ;AAAA,MACvB,gBAAgB;AAAA,MAChB,YAAY,QAAQ;AAAA,IACxB,CAAG;AAED,QAAI,cAAc,kBAAkB,QAAQ,GAAG;AAG/C,QAAI,cAAc,MAChB,mBAAmB;AAGrB,QAAI,kBAAkB;AACtB,QAAI,cAAc,IAAI,UAAU,cAAc,MAAM,CAAC;AAGrD,QAAI,OAAO,OAAO,KAAK,QAAQ,IAAI,IAAI,GAAG,GAAG,GAAG;AAGhD,QAAI,QAAQ;AAGZ,QAAI,eAAe,WAAW,eAAe;AAG7C,QAAI,oBAAoB,GACtB,eAAe,GACf,QAAQ,CAAA,GACR,YACA;AAEF,QAAI,QAAQ,eAAgB,SAAQ,IAAI,eAAe,MAAM,CAAC;AAE9D,WAAO,aAAa;AAClB,UAAI,MAAM;AAEV,oBAAc;AACd,yBAAmB;AAEnB,UAAI,QAAQ,gBAAgB;AAC1B,uBAAe;AAGf,aAAK,QAAQ,aAAa,YAAY,CAAC,IAAI;AAE3C,aAAK,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM;AAC5B,cAAI,KAAK;AACT,gBAAM,QAAQ,CAAC;AAAA,QACvB;AAEM,eAAO,MAAM,SAAS,GAAG;AACvB,cAAI,MAAM,QAAO;AACjB;AAEA,mBAAS;AACT,sBAAY,MAAK;AAEjB,6BAAmB,MAAM,WAAW,CAAC;AAErC,kBAAQ,MAAM,OAAO,CAAC;AACtB,gBAAM,MAAM,OAAO,IAAI,CAAC;AAGxB,iBAAO,QAAQ,KAAK,SAAS;AAC3B,gBAAI,MAAM,aAAa,KAAK;AAC5B,qBAAS,MAAM,QAAQ,KAAK;AAE5B,8BAAkB,MAAM,WAAW,CAAC;AAGpC,sBAAU;AACV,iCAAqB,aAAa,iBAAiB,MAAM;AAAA,UACnE;AAGQ,sBAAY,MAAM;AAAA,YAChB;AAAA,YACA;AAAA,YACA,YAAY,IAAI,gBAAgB,KAAK;AAAA,YACrC;AAAA;AAEF,0BAAgB;AAEhB,eAAK,KAAK,GAAG,KAAK,YAAY,MAAM,MAAM;AACxC,8BAAkB,YAAY,MAAM,EAAE;AAEtC,gBAAI,oBAAoB,iBAAkB;AAE1C,oCAAwB,YAAY,KAAK,EAAE;AAE3C;AAEA,oBAAQ,MAAM;AAAA,cACZ;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA;AAGF,4BAAgB;AAAA,cACd;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA;AAGF,gBAAI,eAAe;AACjB,0BAAY;AACZ,8BAAgB;AAAA,YAC5B;AAAA,UACA;AAGQ,cAAI,YAAY,GAAG;AAWjB,4BAAgB,MAAM,QAAQ,GAAG,MAAM;AAIvC,gBAAI,kBAAkB,iBAAkB;AAAA,UAClD,OAAe;AAEL,gBAAI,kBAAkB,kBAAkB;AACtC;AAAA,YACZ,OAAiB;AAEL,oBAAM,KAAK,GAAG,QAAQ,aAAa;AAAA,YAC/C;AAAA,UACA;AAEQ,wBAAc;AACd;AAGA,kBAAQ,MAAM,OAAO,CAAC;AACtB,gBAAM,MAAM,OAAO,IAAI,CAAC;AAExB,iBAAO,QAAQ,KAAK,SAAS;AAC3B,gBAAI,MAAM,aAAa,KAAK;AAC5B,8BAAkB,MAAM,WAAW,CAAC;AAEpC,gBAAI,oBAAoB,cAAe,OAAM,QAAQ,CAAC;AAAA,UAChE;AAAA,QACA;AAEM,cAAM,KAAK,YAAY;AAAA,MAC7B,OAAW;AACL,qBAAa,CAAA;AACb,cAAM,KAAK,UAAU;AAGrB,eAAO,kBAAkB;AACvB,6BAAmB;AACnB,yBAAe;AAEf,eAAK,QAAQ,aAAa,YAAY,CAAC,IAAI;AAE3C,eAAK,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM;AAC5B,gBAAI,KAAK;AAET;AAEA,qBAAS;AACT,wBAAY,MAAK;AAEjB,+BAAmB,MAAM,WAAW,CAAC;AAErC,oBAAQ,MAAM,OAAO,CAAC;AACtB,kBAAM,MAAM,OAAO,IAAI,CAAC;AAGxB,mBAAO,QAAQ,KAAK,SAAS;AAC3B,kBAAI,MAAM,aAAa,KAAK;AAC5B,uBAAS,MAAM,QAAQ,KAAK;AAE5B,gCAAkB,MAAM,WAAW,CAAC;AAGpC,wBAAU;AACV,mCAAqB,aAAa,iBAAiB,MAAM;AAAA,YACrE;AAGU,wBAAY,MAAM;AAAA,cAChB;AAAA,cACA;AAAA,cACA,YAAY,IAAI,gBAAgB,KAAK;AAAA,cACrC;AAAA;AAEF,4BAAgB;AAEhB,iBAAK,KAAK,GAAG,KAAK,YAAY,MAAM,MAAM;AACxC,gCAAkB,YAAY,MAAM,EAAE;AAEtC,kBAAI,oBAAoB,iBAAkB;AAE1C,sCAAwB,YAAY,KAAK,EAAE;AAE3C;AAEA,sBAAQ,MAAM;AAAA,gBACZ;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA;AAGF,8BAAgB;AAAA,gBACd;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA;AAGF,kBAAI,eAAe;AACjB,4BAAY;AACZ,gCAAgB;AAAA,cAC9B;AAAA,YACA;AAGU,gBAAI,YAAY,GAAG;AAWjB,8BAAgB,MAAM,QAAQ,GAAG,MAAM;AAIvC,kBAAI,kBAAkB,iBAAkB;AAAA,YACpD,OAAiB;AAEL,kBAAI,kBAAkB,kBAAkB;AACtC;AAAA,cACd,OAAmB;AAEL,sBAAM,KAAK,GAAG,QAAQ,aAAa;AAAA,cACjD;AAAA,YACA;AAEU,+BAAmB;AACnB;AAAA,UACV;AAEQ,qBAAW,KAAK,YAAY;AAE5B,wBAAc,oBAAoB;AAAA,QAC1C;AAAA,MACA;AAGI,UAAI,YAAa,OAAM,QAAO;AAAA,IAClC;AAEE,QAAI,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAGF,WAAO;AAAA,EACT;AAEA,WAAS,gBAAgB,UAAU,OAAO,SAAS;AACjD,QAAI,QAAQ,IAAI,qBAAqB,OAAO;AAAA,MAC1C,eAAe,QAAQ;AAAA,MACvB,gBAAgB;AAAA,MAChB,YAAY,QAAQ;AAAA,IACxB,CAAG;AAED,QAAI,cAAc,kBAAkB,QAAQ,GAAG;AAG/C,QAAI,cAAc,MAChB,mBAAmB;AAGrB,QAAI,kBAAkB;AACtB,QAAI,cAAc,IAAI,UAAU,cAAc,MAAM,CAAC;AAGrD,QAAI,OAAO,OAAO,KAAK,QAAQ,KAAK,QAAQ,IAAI,IAAI,GAAG,GAAG,GAAG;AAG7D,QAAI,UAAU,WAAW;AAGzB,QAAI,eAAe,WAAW,eAAe;AAG7C,QAAI,oBAAoB,GACtB,eAAe,GACf,QAAQ,CAAA,GACR,YACA;AAEF,QAAI,QAAQ,eAAgB,SAAQ,IAAI,eAAe,MAAM,CAAC;AAE9D,WAAO,aAAa;AAClB,UAAI,MAAM;AAEV,oBAAc;AACd,yBAAmB;AAEnB,UAAI,QAAQ,gBAAgB;AAC1B,uBAAe;AAGf,aAAK,QAAQ,aAAa,YAAY,CAAC,IAAI;AAE3C,aAAK,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM;AAC5B,cAAI,KAAK;AACT,gBAAM,QAAQ,CAAC;AAAA,QACvB;AAEM,eAAO,MAAM,SAAS,GAAG;AACvB,cAAI,MAAM,QAAO;AACjB;AAEA,qBAAW;AACX,sBAAY;AACZ,sBAAY,MAAK;AAEjB,6BAAmB,MAAM,WAAW,CAAC;AAErC,kBAAQ,MAAM,OAAO,CAAC;AACtB,gBAAM,MAAM,OAAO,IAAI,CAAC;AACxB,mBAAS,MAAM,QAAQ,CAAC;AAGxB,iBAAO,QAAQ,KAAK,SAAS;AAC3B,kBAAM,QAAQ;AACd,gBAAI,MAAM,aAAa,KAAK;AAC5B,qBAAS,MAAM,QAAQ,KAAK;AAE5B,8BAAkB,MAAM,WAAW,CAAC;AAGpC,gBAAI,IAAK,cAAa;AAAA,gBACjB,aAAY;AAEjB,iCAAqB,aAAa,iBAAiB,MAAM;AAAA,UACnE;AAGQ,sBAAY,MAAM;AAAA,YAChB;AAAA,YACA;AAAA,YACA;AAAA,YACA,YAAY,IAAI,gBAAgB,KAAK;AAAA,YACrC;AAAA;AAEF,0BAAgB;AAEhB,eAAK,KAAK,GAAG,KAAK,YAAY,MAAM,MAAM;AACxC,8BAAkB,YAAY,MAAM,EAAE;AAEtC,gBAAI,oBAAoB,iBAAkB;AAE1C,oCAAwB,YAAY,KAAK,EAAE;AAE3C;AAEA,oBAAQ,MAAM;AAAA,cACZ;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA;AAGF,4BAAgB;AAAA,cACd;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA,cACA;AAAA;AAGF,gBAAI,eAAe;AACjB,0BAAY;AACZ,8BAAgB;AAAA,YAC5B;AAAA,UACA;AAGQ,cAAI,YAAY,GAAG;AAWjB,4BAAgB,MAAM,QAAQ,GAAG,UAAU,SAAS;AAIpD,gBAAI,kBAAkB,iBAAkB;AAAA,UAClD,OAAe;AAEL,gBAAI,kBAAkB,kBAAkB;AACtC;AAAA,YACZ,OAAiB;AAEL,oBAAM,KAAK,GAAG,UAAU,WAAW,aAAa;AAAA,YAC5D;AAAA,UACA;AAEQ,wBAAc;AACd;AAGA,kBAAQ,MAAM,OAAO,CAAC;AACtB,gBAAM,MAAM,OAAO,IAAI,CAAC;AAExB,iBAAO,QAAQ,KAAK,SAAS;AAC3B,gBAAI,MAAM,aAAa,KAAK;AAC5B,8BAAkB,MAAM,WAAW,CAAC;AAEpC,gBAAI,oBAAoB,cAAe,OAAM,QAAQ,CAAC;AAAA,UAChE;AAAA,QACA;AAEM,cAAM,KAAK,YAAY;AAAA,MAC7B,OAAW;AACL,qBAAa,CAAA;AACb,cAAM,KAAK,UAAU;AAGrB,eAAO,kBAAkB;AACvB,6BAAmB;AACnB,yBAAe;AAEf,eAAK,QAAQ,aAAa,YAAY,CAAC,IAAI;AAE3C,eAAK,IAAI,GAAG,IAAI,GAAG,KAAK,MAAM;AAC5B,gBAAI,KAAK;AAET;AAEA,uBAAW;AACX,wBAAY;AACZ,wBAAY,MAAK;AAEjB,+BAAmB,MAAM,WAAW,CAAC;AAErC,oBAAQ,MAAM,OAAO,CAAC;AACtB,kBAAM,MAAM,OAAO,IAAI,CAAC;AACxB,qBAAS,MAAM,QAAQ,CAAC;AAGxB,mBAAO,QAAQ,KAAK,SAAS;AAC3B,oBAAM,QAAQ;AACd,kBAAI,MAAM,aAAa,KAAK;AAC5B,uBAAS,MAAM,QAAQ,KAAK;AAE5B,gCAAkB,MAAM,WAAW,CAAC;AAGpC,kBAAI,IAAK,cAAa;AAAA,kBACjB,aAAY;AAEjB,mCAAqB,aAAa,iBAAiB,MAAM;AAAA,YACrE;AAGU,wBAAY,MAAM;AAAA,cAChB;AAAA,cACA;AAAA,cACA;AAAA,cACA,YAAY,IAAI,gBAAgB,KAAK;AAAA,cACrC;AAAA;AAEF,4BAAgB;AAEhB,iBAAK,KAAK,GAAG,KAAK,YAAY,MAAM,MAAM;AACxC,gCAAkB,YAAY,MAAM,EAAE;AAEtC,kBAAI,oBAAoB,iBAAkB;AAE1C,sCAAwB,YAAY,KAAK,EAAE;AAE3C;AAEA,sBAAQ,MAAM;AAAA,gBACZ;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA;AAGF,8BAAgB;AAAA,gBACd;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA,gBACA;AAAA;AAGF,kBAAI,eAAe;AACjB,4BAAY;AACZ,gCAAgB;AAAA,cAC9B;AAAA,YACA;AAGU,gBAAI,YAAY,GAAG;AAWjB,8BAAgB,MAAM,QAAQ,GAAG,UAAU,SAAS;AAIpD,kBAAI,kBAAkB,iBAAkB;AAAA,YACpD,OAAiB;AAEL,kBAAI,kBAAkB,kBAAkB;AACtC;AAAA,cACd,OAAmB;AAEL,sBAAM,KAAK,GAAG,UAAU,WAAW,aAAa;AAAA,cAC9D;AAAA,YACA;AAEU,+BAAmB;AACnB;AAAA,UACV;AAEQ,qBAAW,KAAK,YAAY;AAE5B,wBAAc,oBAAoB;AAAA,QAC1C;AAAA,MACA;AAGI,UAAI,YAAa,OAAM,QAAO;AAAA,IAClC;AAEE,QAAI,UAAU;AAAA,MACZ;AAAA,MACA;AAAA,MACA;AAAA,MACA;AAAA;AAGF,WAAO;AAAA,EACT;AAkBA,WAASC,SAAQK,SAAQ,UAAU,OAAO,SAAS;AACjD,QAAI,CAACjB,SAAQ,KAAK;AAChB,YAAM,IAAI;AAAA,QACR;AAAA;AAGJ,QAAI,OAAOO,WAAU,KAAK;AAE1B,QAAI,SAAS;AACX,YAAM,IAAI;AAAA,QACR;AAAA;AAIJ,cAAU,gBAAgB,SAASI,SAAQ;AAG3C,QAAI,IAAI;AAER,QAAI,MAAM,SAAS,GAAG;AACpB,UAAIM,SAAQ;AACV,cAAM,YAAY,SAAU,MAAM;AAChC,gBAAM,iBAAiB,MAAM,QAAQ,wBAAwB,GAAG;AAAA,QACxE,CAAO;AAED;AAAA,MACN;AAEI,UAAI,cAAc,CAAA;AAElB,YAAM,YAAY,SAAU,MAAM;AAChC,oBAAY,IAAI,IAAI;AAAA,MAC1B,CAAK;AAED,UAAI,CAAC,SAAU,QAAO;AAEtB,aAAO;AAAA,QACL;AAAA,QACA,OAAO,MAAM;AAAA,QACb,mBAAmB;AAAA,QACnB,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,YAAY;AAAA,QACZ,OAAO;AAAA,QACP,cAAc;AAAA,QACd,YAAY,QAAQ;AAAA;IAE1B;AAEE,QAAIC,MAAK,SAAS,eAAe,oBAAoB;AAErD,QAAI,UAAUA,IAAG,UAAU,OAAO,OAAO;AAEzC,QAAI,QAAQ,QAAQ;AAGpB,QAAI,CAAC,UAAU;AACb,UAAID,SAAQ;AACV,cAAM,OAAO,QAAQ,sBAAsB;AAC3C;AAAA,MACN;AAEI,aAAO,MAAM,QAAO;AAAA,IACxB;AAGE,QAAI,SAAS;AAAA,MACX,OAAO,MAAM;AAAA,MACb,mBAAmB,QAAQ;AAAA,MAC3B,YAAY,MAAM;AAAA,MAClB,OAAO,MAAM;AAAA,MACb,YAAY,MAAM,WAAU;AAAA,MAC5B,OAAO,QAAQ;AAAA,MACf,cAAc,QAAQ;AAAA,MACtB,YAAY,QAAQ;AAAA;AAGtB,QAAIA,SAAQ;AACV,YAAM,OAAO,QAAQ,sBAAsB;AAC3C,aAAO;AAAA,IACX;AAEE,WAAO,cAAc,MAAM,QAAO;AAElC,WAAO;AAAA,EACT;AAKA,MAAI,KAAKL,SAAQ,KAAK,MAAM,OAAO,KAAK;AACxC,KAAG,SAASA,SAAQ,KAAK,MAAM,MAAM,KAAK;AAC1C,KAAG,WAAWA,SAAQ,KAAK,MAAM,OAAO,IAAI;AAC5C,KAAG,WAAWD;AAEd,iCAAiB;;;;;AChvBV,SAAS,eACd,UACA,UACA,cACe;AACf,SAAOQ,EAAAA,QAAQ,MAAM;AACnB,QAAI,SAAS,WAAW,GAAG;AACzB,aAAO;AAAA,QACL,aAAa,CAAA;AAAA,QACb,8BAAc,IAAA;AAAA,QACd,2BAAW,IAAA;AAAA,QACX,OAAO;AAAA,MAAA;AAAA,IAEX;AAEA,UAAM,YAAY,IAAI,gBAAA;AACtB,UAAM,gCAAgB,IAAA;AAEtB,eAAW,QAAQ,UAAU;AAC3B,UAAI,CAAC,UAAU,IAAI,KAAK,EAAE,GAAG;AAC3B,kBAAU,QAAQ,KAAK,EAAE;AACzB,kBAAU,IAAI,KAAK,EAAE;AAAA,MACvB;AAAA,IACF;AAEA,eAAW,QAAQ,UAAU;AAC3B,YAAM,SACJ,OAAO,KAAK,WAAW,WACnB,KAAK,SACJ,KAAK,OAAqB;AACjC,YAAM,SACJ,OAAO,KAAK,WAAW,WACnB,KAAK,SACJ,KAAK,OAAqB;AACjC,UAAI,WAAW,OAAQ;AACvB,UAAI,CAAC,UAAU,IAAI,MAAM,KAAK,CAAC,UAAU,IAAI,MAAM,EAAG;AAEtD,UAAI,UAAU,QAAQ,QAAQ,MAAM,GAAG;AACrC,cAAM,IACH,UAAU,iBAAiB,QAAQ,QAAQ,QAAQ,KAAgB;AACtE,kBAAU,iBAAiB,QAAQ,QAAQ,UAAU,IAAI,CAAC;AAAA,MAC5D,OAAO;AACL,kBAAU,QAAQ,QAAQ,QAAQ,EAAE,QAAQ,GAAG;AAAA,MACjD;AAAA,IACF;AAEA,UAAM,cAAc,QAAQ,WAAW;AAAA,MACrC,YAAY,aAAa;AAAA,MACzB,eAAe;AAAA,IAAA,CAChB;AACD,UAAM,WAAW,aAAa,uBAAuB,WAAW;AAChE,UAAM,QAAQ,aAAa,oBAAoB,aAAa,QAAQ;AACpE,UAAM,QAAQ,IAAI,IAAI,OAAO,OAAO,WAAW,CAAC,EAAE;AAElD,QAAI,QAAQ,IAAI,aAAa,eAAe;AAC1C,cAAQ;AAAA,QACN,oBAAoB,KAAK,qBAAqB,SAAS,MAAM;AAAA,MAAA;AAAA,IAEjE;AAEA,WAAO,EAAE,aAAa,UAAU,OAAO,MAAA;AAAA,EACzC,GAAG,CAAC,UAAU,UAAU,YAAY,CAAC;AACvC;ACxEA,SAAS,WAAW,UAA2D;AAC7E,MAAI,OAAO,aAAa,SAAU,QAAO;AACzC,MAAI,OAAO,aAAa,YAAY,aAAa;AAC/C,WAAQ,SAAuB;AACjC,SAAO,OAAO,QAAQ;AACxB;AASO,SAAS,cACd,QACA,cACA,UACA,UACA,aACA,gBACA,MACA,aAMA;AAEA,QAAM,cAAcA,EAAAA,QAAQ,MAAM;AAChC,UAAM,0BAAU,IAAA;AAChB,eAAW,QAAQ,UAAU;AAC3B,UAAI,IAAI,KAAK,IAAI,KAAK,IAAI;AAAA,IAC5B;AACA,WAAO;AAAA,EACT,GAAG,CAAC,QAAQ,CAAC;AAGb,QAAM,YAAYA,EAAAA,QAAQ,MAAM;AAC9B,UAAM,0BAAU,IAAA;AAChB,eAAW,QAAQ,UAAU;AAE3B,UAAI,YAAY,gBAAgB,IAAI,KAAK,KAAK,EAAG;AAEjD,YAAM,WAAW,WAAW,KAAK,MAAM;AACvC,YAAM,WAAW,WAAW,KAAK,MAAM;AAGvC,YAAM,aAAa,YAAY,IAAI,QAAQ;AAC3C,YAAM,aAAa,YAAY,IAAI,QAAQ;AAC3C,UAAI,cAAc,YAAY,gBAAgB,IAAI,UAAU,EAAG;AAC/D,UAAI,cAAc,YAAY,gBAAgB,IAAI,UAAU,EAAG;AAE/D,YAAM,UAAU,GAAG,QAAQ,IAAI,QAAQ;AACvC,UAAI,CAAC,IAAI,IAAI,QAAQ,EAAG,KAAI,IAAI,UAAU,EAAE;AAC5C,UAAI,CAAC,IAAI,IAAI,QAAQ,EAAG,KAAI,IAAI,UAAU,EAAE;AAC5C,UAAI,IAAI,QAAQ,EAAG,KAAK,EAAE,UAAU,UAAU,SAAS;AACvD,UAAI,IAAI,QAAQ,EAAG,KAAK,EAAE,UAAU,UAAU,SAAS;AAAA,IACzD;AACA,WAAO;AAAA,EACT,GAAG;AAAA,IACD;AAAA,IACA,YAAY;AAAA,IACZ,YAAY;AAAA,IACZ;AAAA,EAAA,CACD;AAGD,SAAOA,EAAAA,QAAQ,MAAM;AACnB,UAAM,qCAAqB,IAAA;AAC3B,UAAM,qCAAqB,IAAA;AAC3B,UAAM,iCAAiB,IAAA;AACvB,UAAM,6BAAa,IAAA;AAGnB,QAAI,aAAa;AACf,YAAM,IAAI,YAAY,YAAA;AACtB,iBAAW,QAAQ,UAAU;AAC3B,YACE,KAAK,MAAM,YAAA,EAAc,SAAS,CAAC,KACnC,KAAK,GAAG,YAAA,EAAc,SAAS,CAAC,KAChC,KAAK,KAAK,cAAc,SAAS,CAAC,GAClC;AACA,yBAAe,IAAI,KAAK,EAAE;AAC1B,qBAAW,IAAI,KAAK,EAAE;AAAA,QACxB;AAAA,MACF;AAAA,IACF;AAIA,QAAI,gBAAgB;AAClB,YAAM,aAAa,KAAK,IAAI,GAAG,IAAI;AACnC,qBAAe,IAAI,cAAc;AACjC,iBAAW,IAAI,cAAc;AAC7B,aAAO,IAAI,gBAAgB,CAAC;AAC5B,UAAI,WAAW,oBAAI,IAAY,CAAC,cAAc,CAAC;AAC/C,eAAS,QAAQ,GAAG,QAAQ,QAAQ,SAAS,OAAO,GAAG,SAAS;AAC9D,cAAM,mCAAmB,IAAA;AACzB,iBAAS,QAAQ,CAAC,WAAW;AAC3B,gBAAM,QAAQ,UAAU,IAAI,MAAM;AAClC,cAAI,CAAC,MAAO;AACZ,gBAAM,QAAQ,CAAC,EAAE,UAAU,cAAc;AACvC,2BAAe,IAAI,OAAO;AAC1B,gBAAI,CAAC,eAAe,IAAI,QAAQ,GAAG;AACjC,2BAAa,IAAI,QAAQ;AACzB,qBAAO,IAAI,UAAU,QAAQ,CAAC;AAAA,YAChC;AACA,2BAAe,IAAI,QAAQ;AAC3B,gBAAI,QAAQ,YAAY;AACtB,yBAAW,IAAI,QAAQ;AAAA,YACzB;AAAA,UACF,CAAC;AAAA,QACH,CAAC;AACD,mBAAW;AAAA,MACb;AAAA,IACF;AAEA,WAAO,EAAE,gBAAgB,gBAAgB,YAAY,OAAA;AAAA,EACvD,GAAG,CAAC,UAAU,aAAa,gBAAgB,MAAM,SAAS,CAAC;AAC7D;;;;;;;;;;;;;;;","x_google_ignoreList":[0,1,2,7,8,9,10,11,12,13,14,15,16]}