@burdenoff/microfe-vibecontrols 2026.1008.2 → 2026.1010.2

package/dist/node_modules/d3-time-format/src/locale.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"locale.js","names":[],"sources":["../../../../node_modules/d3-time-format/src/locale.js"],"sourcesContent":["import {\n  timeDay,\n  timeSunday,\n  timeMonday,\n  timeThursday,\n  timeYear,\n  utcDay,\n  utcSunday,\n  utcMonday,\n  utcThursday,\n  utcYear\n} from \"d3-time\";\n\nfunction localDate(d) {\n  if (0 <= d.y && d.y < 100) {\n    var date = new Date(-1, d.m, d.d, d.H, d.M, d.S, d.L);\n    date.setFullYear(d.y);\n    return date;\n  }\n  return new Date(d.y, d.m, d.d, d.H, d.M, d.S, d.L);\n}\n\nfunction utcDate(d) {\n  if (0 <= d.y && d.y < 100) {\n    var date = new Date(Date.UTC(-1, d.m, d.d, d.H, d.M, d.S, d.L));\n    date.setUTCFullYear(d.y);\n    return date;\n  }\n  return new Date(Date.UTC(d.y, d.m, d.d, d.H, d.M, d.S, d.L));\n}\n\nfunction newDate(y, m, d) {\n  return {y: y, m: m, d: d, H: 0, M: 0, S: 0, L: 0};\n}\n\nexport default function formatLocale(locale) {\n  var locale_dateTime = locale.dateTime,\n      locale_date = locale.date,\n      locale_time = locale.time,\n      locale_periods = locale.periods,\n      locale_weekdays = locale.days,\n      locale_shortWeekdays = locale.shortDays,\n      locale_months = locale.months,\n      locale_shortMonths = locale.shortMonths;\n\n  var periodRe = formatRe(locale_periods),\n      periodLookup = formatLookup(locale_periods),\n      weekdayRe = formatRe(locale_weekdays),\n      weekdayLookup = formatLookup(locale_weekdays),\n      shortWeekdayRe = formatRe(locale_shortWeekdays),\n      shortWeekdayLookup = formatLookup(locale_shortWeekdays),\n      monthRe = formatRe(locale_months),\n      monthLookup = formatLookup(locale_months),\n      shortMonthRe = formatRe(locale_shortMonths),\n      shortMonthLookup = formatLookup(locale_shortMonths);\n\n  var formats = {\n    \"a\": formatShortWeekday,\n    \"A\": formatWeekday,\n    \"b\": formatShortMonth,\n    \"B\": formatMonth,\n    \"c\": null,\n    \"d\": formatDayOfMonth,\n    \"e\": formatDayOfMonth,\n    \"f\": formatMicroseconds,\n    \"g\": formatYearISO,\n    \"G\": formatFullYearISO,\n    \"H\": formatHour24,\n    \"I\": formatHour12,\n    \"j\": formatDayOfYear,\n    \"L\": formatMilliseconds,\n    \"m\": formatMonthNumber,\n    \"M\": formatMinutes,\n    \"p\": formatPeriod,\n    \"q\": formatQuarter,\n    \"Q\": formatUnixTimestamp,\n    \"s\": formatUnixTimestampSeconds,\n    \"S\": formatSeconds,\n    \"u\": formatWeekdayNumberMonday,\n    \"U\": formatWeekNumberSunday,\n    \"V\": formatWeekNumberISO,\n    \"w\": formatWeekdayNumberSunday,\n    \"W\": formatWeekNumberMonday,\n    \"x\": null,\n    \"X\": null,\n    \"y\": formatYear,\n    \"Y\": formatFullYear,\n    \"Z\": formatZone,\n    \"%\": formatLiteralPercent\n  };\n\n  var utcFormats = {\n    \"a\": formatUTCShortWeekday,\n    \"A\": formatUTCWeekday,\n    \"b\": formatUTCShortMonth,\n    \"B\": formatUTCMonth,\n    \"c\": null,\n    \"d\": formatUTCDayOfMonth,\n    \"e\": formatUTCDayOfMonth,\n    \"f\": formatUTCMicroseconds,\n    \"g\": formatUTCYearISO,\n    \"G\": formatUTCFullYearISO,\n    \"H\": formatUTCHour24,\n    \"I\": formatUTCHour12,\n    \"j\": formatUTCDayOfYear,\n    \"L\": formatUTCMilliseconds,\n    \"m\": formatUTCMonthNumber,\n    \"M\": formatUTCMinutes,\n    \"p\": formatUTCPeriod,\n    \"q\": formatUTCQuarter,\n    \"Q\": formatUnixTimestamp,\n    \"s\": formatUnixTimestampSeconds,\n    \"S\": formatUTCSeconds,\n    \"u\": formatUTCWeekdayNumberMonday,\n    \"U\": formatUTCWeekNumberSunday,\n    \"V\": formatUTCWeekNumberISO,\n    \"w\": formatUTCWeekdayNumberSunday,\n    \"W\": formatUTCWeekNumberMonday,\n    \"x\": null,\n    \"X\": null,\n    \"y\": formatUTCYear,\n    \"Y\": formatUTCFullYear,\n    \"Z\": formatUTCZone,\n    \"%\": formatLiteralPercent\n  };\n\n  var parses = {\n    \"a\": parseShortWeekday,\n    \"A\": parseWeekday,\n    \"b\": parseShortMonth,\n    \"B\": parseMonth,\n    \"c\": parseLocaleDateTime,\n    \"d\": parseDayOfMonth,\n    \"e\": parseDayOfMonth,\n    \"f\": parseMicroseconds,\n    \"g\": parseYear,\n    \"G\": parseFullYear,\n    \"H\": parseHour24,\n    \"I\": parseHour24,\n    \"j\": parseDayOfYear,\n    \"L\": parseMilliseconds,\n    \"m\": parseMonthNumber,\n    \"M\": parseMinutes,\n    \"p\": parsePeriod,\n    \"q\": parseQuarter,\n    \"Q\": parseUnixTimestamp,\n    \"s\": parseUnixTimestampSeconds,\n    \"S\": parseSeconds,\n    \"u\": parseWeekdayNumberMonday,\n    \"U\": parseWeekNumberSunday,\n    \"V\": parseWeekNumberISO,\n    \"w\": parseWeekdayNumberSunday,\n    \"W\": parseWeekNumberMonday,\n    \"x\": parseLocaleDate,\n    \"X\": parseLocaleTime,\n    \"y\": parseYear,\n    \"Y\": parseFullYear,\n    \"Z\": parseZone,\n    \"%\": parseLiteralPercent\n  };\n\n  // These recursive directive definitions must be deferred.\n  formats.x = newFormat(locale_date, formats);\n  formats.X = newFormat(locale_time, formats);\n  formats.c = newFormat(locale_dateTime, formats);\n  utcFormats.x = newFormat(locale_date, utcFormats);\n  utcFormats.X = newFormat(locale_time, utcFormats);\n  utcFormats.c = newFormat(locale_dateTime, utcFormats);\n\n  function newFormat(specifier, formats) {\n    return function(date) {\n      var string = [],\n          i = -1,\n          j = 0,\n          n = specifier.length,\n          c,\n          pad,\n          format;\n\n      if (!(date instanceof Date)) date = new Date(+date);\n\n      while (++i < n) {\n        if (specifier.charCodeAt(i) === 37) {\n          string.push(specifier.slice(j, i));\n          if ((pad = pads[c = specifier.charAt(++i)]) != null) c = specifier.charAt(++i);\n          else pad = c === \"e\" ? \" \" : \"0\";\n          if (format = formats[c]) c = format(date, pad);\n          string.push(c);\n          j = i + 1;\n        }\n      }\n\n      string.push(specifier.slice(j, i));\n      return string.join(\"\");\n    };\n  }\n\n  function newParse(specifier, Z) {\n    return function(string) {\n      var d = newDate(1900, undefined, 1),\n          i = parseSpecifier(d, specifier, string += \"\", 0),\n          week, day;\n      if (i != string.length) return null;\n\n      // If a UNIX timestamp is specified, return it.\n      if (\"Q\" in d) return new Date(d.Q);\n      if (\"s\" in d) return new Date(d.s * 1000 + (\"L\" in d ? d.L : 0));\n\n      // If this is utcParse, never use the local timezone.\n      if (Z && !(\"Z\" in d)) d.Z = 0;\n\n      // The am-pm flag is 0 for AM, and 1 for PM.\n      if (\"p\" in d) d.H = d.H % 12 + d.p * 12;\n\n      // If the month was not specified, inherit from the quarter.\n      if (d.m === undefined) d.m = \"q\" in d ? d.q : 0;\n\n      // Convert day-of-week and week-of-year to day-of-year.\n      if (\"V\" in d) {\n        if (d.V < 1 || d.V > 53) return null;\n        if (!(\"w\" in d)) d.w = 1;\n        if (\"Z\" in d) {\n          week = utcDate(newDate(d.y, 0, 1)), day = week.getUTCDay();\n          week = day > 4 || day === 0 ? utcMonday.ceil(week) : utcMonday(week);\n          week = utcDay.offset(week, (d.V - 1) * 7);\n          d.y = week.getUTCFullYear();\n          d.m = week.getUTCMonth();\n          d.d = week.getUTCDate() + (d.w + 6) % 7;\n        } else {\n          week = localDate(newDate(d.y, 0, 1)), day = week.getDay();\n          week = day > 4 || day === 0 ? timeMonday.ceil(week) : timeMonday(week);\n          week = timeDay.offset(week, (d.V - 1) * 7);\n          d.y = week.getFullYear();\n          d.m = week.getMonth();\n          d.d = week.getDate() + (d.w + 6) % 7;\n        }\n      } else if (\"W\" in d || \"U\" in d) {\n        if (!(\"w\" in d)) d.w = \"u\" in d ? d.u % 7 : \"W\" in d ? 1 : 0;\n        day = \"Z\" in d ? utcDate(newDate(d.y, 0, 1)).getUTCDay() : localDate(newDate(d.y, 0, 1)).getDay();\n        d.m = 0;\n        d.d = \"W\" in d ? (d.w + 6) % 7 + d.W * 7 - (day + 5) % 7 : d.w + d.U * 7 - (day + 6) % 7;\n      }\n\n      // If a time zone is specified, all fields are interpreted as UTC and then\n      // offset according to the specified time zone.\n      if (\"Z\" in d) {\n        d.H += d.Z / 100 | 0;\n        d.M += d.Z % 100;\n        return utcDate(d);\n      }\n\n      // Otherwise, all fields are in local time.\n      return localDate(d);\n    };\n  }\n\n  function parseSpecifier(d, specifier, string, j) {\n    var i = 0,\n        n = specifier.length,\n        m = string.length,\n        c,\n        parse;\n\n    while (i < n) {\n      if (j >= m) return -1;\n      c = specifier.charCodeAt(i++);\n      if (c === 37) {\n        c = specifier.charAt(i++);\n        parse = parses[c in pads ? specifier.charAt(i++) : c];\n        if (!parse || ((j = parse(d, string, j)) < 0)) return -1;\n      } else if (c != string.charCodeAt(j++)) {\n        return -1;\n      }\n    }\n\n    return j;\n  }\n\n  function parsePeriod(d, string, i) {\n    var n = periodRe.exec(string.slice(i));\n    return n ? (d.p = periodLookup.get(n[0].toLowerCase()), i + n[0].length) : -1;\n  }\n\n  function parseShortWeekday(d, string, i) {\n    var n = shortWeekdayRe.exec(string.slice(i));\n    return n ? (d.w = shortWeekdayLookup.get(n[0].toLowerCase()), i + n[0].length) : -1;\n  }\n\n  function parseWeekday(d, string, i) {\n    var n = weekdayRe.exec(string.slice(i));\n    return n ? (d.w = weekdayLookup.get(n[0].toLowerCase()), i + n[0].length) : -1;\n  }\n\n  function parseShortMonth(d, string, i) {\n    var n = shortMonthRe.exec(string.slice(i));\n    return n ? (d.m = shortMonthLookup.get(n[0].toLowerCase()), i + n[0].length) : -1;\n  }\n\n  function parseMonth(d, string, i) {\n    var n = monthRe.exec(string.slice(i));\n    return n ? (d.m = monthLookup.get(n[0].toLowerCase()), i + n[0].length) : -1;\n  }\n\n  function parseLocaleDateTime(d, string, i) {\n    return parseSpecifier(d, locale_dateTime, string, i);\n  }\n\n  function parseLocaleDate(d, string, i) {\n    return parseSpecifier(d, locale_date, string, i);\n  }\n\n  function parseLocaleTime(d, string, i) {\n    return parseSpecifier(d, locale_time, string, i);\n  }\n\n  function formatShortWeekday(d) {\n    return locale_shortWeekdays[d.getDay()];\n  }\n\n  function formatWeekday(d) {\n    return locale_weekdays[d.getDay()];\n  }\n\n  function formatShortMonth(d) {\n    return locale_shortMonths[d.getMonth()];\n  }\n\n  function formatMonth(d) {\n    return locale_months[d.getMonth()];\n  }\n\n  function formatPeriod(d) {\n    return locale_periods[+(d.getHours() >= 12)];\n  }\n\n  function formatQuarter(d) {\n    return 1 + ~~(d.getMonth() / 3);\n  }\n\n  function formatUTCShortWeekday(d) {\n    return locale_shortWeekdays[d.getUTCDay()];\n  }\n\n  function formatUTCWeekday(d) {\n    return locale_weekdays[d.getUTCDay()];\n  }\n\n  function formatUTCShortMonth(d) {\n    return locale_shortMonths[d.getUTCMonth()];\n  }\n\n  function formatUTCMonth(d) {\n    return locale_months[d.getUTCMonth()];\n  }\n\n  function formatUTCPeriod(d) {\n    return locale_periods[+(d.getUTCHours() >= 12)];\n  }\n\n  function formatUTCQuarter(d) {\n    return 1 + ~~(d.getUTCMonth() / 3);\n  }\n\n  return {\n    format: function(specifier) {\n      var f = newFormat(specifier += \"\", formats);\n      f.toString = function() { return specifier; };\n      return f;\n    },\n    parse: function(specifier) {\n      var p = newParse(specifier += \"\", false);\n      p.toString = function() { return specifier; };\n      return p;\n    },\n    utcFormat: function(specifier) {\n      var f = newFormat(specifier += \"\", utcFormats);\n      f.toString = function() { return specifier; };\n      return f;\n    },\n    utcParse: function(specifier) {\n      var p = newParse(specifier += \"\", true);\n      p.toString = function() { return specifier; };\n      return p;\n    }\n  };\n}\n\nvar pads = {\"-\": \"\", \"_\": \" \", \"0\": \"0\"},\n    numberRe = /^\\s*\\d+/, // note: ignores next directive\n    percentRe = /^%/,\n    requoteRe = /[\\\\^$*+?|[\\]().{}]/g;\n\nfunction pad(value, fill, width) {\n  var sign = value < 0 ? \"-\" : \"\",\n      string = (sign ? -value : value) + \"\",\n      length = string.length;\n  return sign + (length < width ? new Array(width - length + 1).join(fill) + string : string);\n}\n\nfunction requote(s) {\n  return s.replace(requoteRe, \"\\\\$&\");\n}\n\nfunction formatRe(names) {\n  return new RegExp(\"^(?:\" + names.map(requote).join(\"|\") + \")\", \"i\");\n}\n\nfunction formatLookup(names) {\n  return new Map(names.map((name, i) => [name.toLowerCase(), i]));\n}\n\nfunction parseWeekdayNumberSunday(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 1));\n  return n ? (d.w = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseWeekdayNumberMonday(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 1));\n  return n ? (d.u = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseWeekNumberSunday(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.U = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseWeekNumberISO(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.V = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseWeekNumberMonday(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.W = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseFullYear(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 4));\n  return n ? (d.y = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseYear(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.y = +n[0] + (+n[0] > 68 ? 1900 : 2000), i + n[0].length) : -1;\n}\n\nfunction parseZone(d, string, i) {\n  var n = /^(Z)|([+-]\\d\\d)(?::?(\\d\\d))?/.exec(string.slice(i, i + 6));\n  return n ? (d.Z = n[1] ? 0 : -(n[2] + (n[3] || \"00\")), i + n[0].length) : -1;\n}\n\nfunction parseQuarter(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 1));\n  return n ? (d.q = n[0] * 3 - 3, i + n[0].length) : -1;\n}\n\nfunction parseMonthNumber(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.m = n[0] - 1, i + n[0].length) : -1;\n}\n\nfunction parseDayOfMonth(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.d = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseDayOfYear(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 3));\n  return n ? (d.m = 0, d.d = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseHour24(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.H = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseMinutes(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.M = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseSeconds(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 2));\n  return n ? (d.S = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseMilliseconds(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 3));\n  return n ? (d.L = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseMicroseconds(d, string, i) {\n  var n = numberRe.exec(string.slice(i, i + 6));\n  return n ? (d.L = Math.floor(n[0] / 1000), i + n[0].length) : -1;\n}\n\nfunction parseLiteralPercent(d, string, i) {\n  var n = percentRe.exec(string.slice(i, i + 1));\n  return n ? i + n[0].length : -1;\n}\n\nfunction parseUnixTimestamp(d, string, i) {\n  var n = numberRe.exec(string.slice(i));\n  return n ? (d.Q = +n[0], i + n[0].length) : -1;\n}\n\nfunction parseUnixTimestampSeconds(d, string, i) {\n  var n = numberRe.exec(string.slice(i));\n  return n ? (d.s = +n[0], i + n[0].length) : -1;\n}\n\nfunction formatDayOfMonth(d, p) {\n  return pad(d.getDate(), p, 2);\n}\n\nfunction formatHour24(d, p) {\n  return pad(d.getHours(), p, 2);\n}\n\nfunction formatHour12(d, p) {\n  return pad(d.getHours() % 12 || 12, p, 2);\n}\n\nfunction formatDayOfYear(d, p) {\n  return pad(1 + timeDay.count(timeYear(d), d), p, 3);\n}\n\nfunction formatMilliseconds(d, p) {\n  return pad(d.getMilliseconds(), p, 3);\n}\n\nfunction formatMicroseconds(d, p) {\n  return formatMilliseconds(d, p) + \"000\";\n}\n\nfunction formatMonthNumber(d, p) {\n  return pad(d.getMonth() + 1, p, 2);\n}\n\nfunction formatMinutes(d, p) {\n  return pad(d.getMinutes(), p, 2);\n}\n\nfunction formatSeconds(d, p) {\n  return pad(d.getSeconds(), p, 2);\n}\n\nfunction formatWeekdayNumberMonday(d) {\n  var day = d.getDay();\n  return day === 0 ? 7 : day;\n}\n\nfunction formatWeekNumberSunday(d, p) {\n  return pad(timeSunday.count(timeYear(d) - 1, d), p, 2);\n}\n\nfunction dISO(d) {\n  var day = d.getDay();\n  return (day >= 4 || day === 0) ? timeThursday(d) : timeThursday.ceil(d);\n}\n\nfunction formatWeekNumberISO(d, p) {\n  d = dISO(d);\n  return pad(timeThursday.count(timeYear(d), d) + (timeYear(d).getDay() === 4), p, 2);\n}\n\nfunction formatWeekdayNumberSunday(d) {\n  return d.getDay();\n}\n\nfunction formatWeekNumberMonday(d, p) {\n  return pad(timeMonday.count(timeYear(d) - 1, d), p, 2);\n}\n\nfunction formatYear(d, p) {\n  return pad(d.getFullYear() % 100, p, 2);\n}\n\nfunction formatYearISO(d, p) {\n  d = dISO(d);\n  return pad(d.getFullYear() % 100, p, 2);\n}\n\nfunction formatFullYear(d, p) {\n  return pad(d.getFullYear() % 10000, p, 4);\n}\n\nfunction formatFullYearISO(d, p) {\n  var day = d.getDay();\n  d = (day >= 4 || day === 0) ? timeThursday(d) : timeThursday.ceil(d);\n  return pad(d.getFullYear() % 10000, p, 4);\n}\n\nfunction formatZone(d) {\n  var z = d.getTimezoneOffset();\n  return (z > 0 ? \"-\" : (z *= -1, \"+\"))\n      + pad(z / 60 | 0, \"0\", 2)\n      + pad(z % 60, \"0\", 2);\n}\n\nfunction formatUTCDayOfMonth(d, p) {\n  return pad(d.getUTCDate(), p, 2);\n}\n\nfunction formatUTCHour24(d, p) {\n  return pad(d.getUTCHours(), p, 2);\n}\n\nfunction formatUTCHour12(d, p) {\n  return pad(d.getUTCHours() % 12 || 12, p, 2);\n}\n\nfunction formatUTCDayOfYear(d, p) {\n  return pad(1 + utcDay.count(utcYear(d), d), p, 3);\n}\n\nfunction formatUTCMilliseconds(d, p) {\n  return pad(d.getUTCMilliseconds(), p, 3);\n}\n\nfunction formatUTCMicroseconds(d, p) {\n  return formatUTCMilliseconds(d, p) + \"000\";\n}\n\nfunction formatUTCMonthNumber(d, p) {\n  return pad(d.getUTCMonth() + 1, p, 2);\n}\n\nfunction formatUTCMinutes(d, p) {\n  return pad(d.getUTCMinutes(), p, 2);\n}\n\nfunction formatUTCSeconds(d, p) {\n  return pad(d.getUTCSeconds(), p, 2);\n}\n\nfunction formatUTCWeekdayNumberMonday(d) {\n  var dow = d.getUTCDay();\n  return dow === 0 ? 7 : dow;\n}\n\nfunction formatUTCWeekNumberSunday(d, p) {\n  return pad(utcSunday.count(utcYear(d) - 1, d), p, 2);\n}\n\nfunction UTCdISO(d) {\n  var day = d.getUTCDay();\n  return (day >= 4 || day === 0) ? utcThursday(d) : utcThursday.ceil(d);\n}\n\nfunction formatUTCWeekNumberISO(d, p) {\n  d = UTCdISO(d);\n  return pad(utcThursday.count(utcYear(d), d) + (utcYear(d).getUTCDay() === 4), p, 2);\n}\n\nfunction formatUTCWeekdayNumberSunday(d) {\n  return d.getUTCDay();\n}\n\nfunction formatUTCWeekNumberMonday(d, p) {\n  return pad(utcMonday.count(utcYear(d) - 1, d), p, 2);\n}\n\nfunction formatUTCYear(d, p) {\n  return pad(d.getUTCFullYear() % 100, p, 2);\n}\n\nfunction formatUTCYearISO(d, p) {\n  d = UTCdISO(d);\n  return pad(d.getUTCFullYear() % 100, p, 2);\n}\n\nfunction formatUTCFullYear(d, p) {\n  return pad(d.getUTCFullYear() % 10000, p, 4);\n}\n\nfunction formatUTCFullYearISO(d, p) {\n  var day = d.getUTCDay();\n  d = (day >= 4 || day === 0) ? utcThursday(d) : utcThursday.ceil(d);\n  return pad(d.getUTCFullYear() % 10000, p, 4);\n}\n\nfunction formatUTCZone() {\n  return \"+0000\";\n}\n\nfunction formatLiteralPercent() {\n  return \"%\";\n}\n\nfunction formatUnixTimestamp(d) {\n  return +d;\n}\n\nfunction formatUnixTimestampSeconds(d) {\n  return Math.floor(+d / 1000);\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;AAaA,SAAS,EAAU,GAAG;AACpB,KAAI,KAAK,EAAE,KAAK,EAAE,IAAI,KAAK;EACzB,IAAI,IAAO,IAAI,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;AAErD,SADA,EAAK,YAAY,EAAE,EAAE,EACd;;AAET,QAAO,IAAI,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE;;AAGpD,SAAS,EAAQ,GAAG;AAClB,KAAI,KAAK,EAAE,KAAK,EAAE,IAAI,KAAK;EACzB,IAAI,IAAO,IAAI,KAAK,KAAK,IAAI,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;AAE/D,SADA,EAAK,eAAe,EAAE,EAAE,EACjB;;AAET,QAAO,IAAI,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC;;AAG9D,SAAS,EAAQ,GAAG,GAAG,GAAG;AACxB,QAAO;EAAI;EAAM;EAAM;EAAG,GAAG;EAAG,GAAG;EAAG,GAAG;EAAG,GAAG;EAAE;;AAGnD,SAAwB,EAAa,GAAQ;CAC3C,IAAI,IAAkB,EAAO,UACzB,IAAc,EAAO,MACrB,IAAc,EAAO,MACrB,IAAiB,EAAO,SACxB,IAAkB,EAAO,MACzB,IAAuB,EAAO,WAC9B,IAAgB,EAAO,QACvB,IAAqB,EAAO,aAE5B,IAAW,EAAS,EAAe,EACnC,IAAe,EAAa,EAAe,EAC3C,IAAY,EAAS,EAAgB,EACrC,IAAgB,EAAa,EAAgB,EAC7C,IAAiB,EAAS,EAAqB,EAC/C,KAAqB,EAAa,EAAqB,EACvD,KAAU,EAAS,EAAc,EACjC,KAAc,EAAa,EAAc,EACzC,KAAe,EAAS,EAAmB,EAC3C,KAAmB,EAAa,EAAmB,EAEnD,IAAU;EACZ,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACA;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,KAAK;EACN,EAEG,IAAa;EACf,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,KAAK;EACN,EAEG,KAAS;EACX,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,GAAK;EACL,KAAK;EACN;AAQD,CALA,EAAQ,IAAI,EAAU,GAAa,EAAQ,EAC3C,EAAQ,IAAI,EAAU,GAAa,EAAQ,EAC3C,EAAQ,IAAI,EAAU,GAAiB,EAAQ,EAC/C,EAAW,IAAI,EAAU,GAAa,EAAW,EACjD,EAAW,IAAI,EAAU,GAAa,EAAW,EACjD,EAAW,IAAI,EAAU,GAAiB,EAAW;CAErD,SAAS,EAAU,GAAW,GAAS;AACrC,SAAO,SAAS,GAAM;GACpB,IAAI,IAAS,EAAE,EACX,IAAI,IACJ,IAAI,GACJ,IAAI,EAAU,QACd,GACA,GACA;AAIJ,QAFM,aAAgB,SAAO,oBAAO,IAAI,KAAK,CAAC,EAAK,GAE5C,EAAE,IAAI,GACX,CAAI,EAAU,WAAW,EAAE,KAAK,OAC9B,EAAO,KAAK,EAAU,MAAM,GAAG,EAAE,CAAC,GAC7B,IAAM,EAAK,IAAI,EAAU,OAAO,EAAE,EAAE,MAAM,OAC1C,IAAM,MAAM,MAAM,MAAM,MADwB,IAAI,EAAU,OAAO,EAAE,EAAE,GAE1E,IAAS,EAAQ,QAAI,IAAI,EAAO,GAAM,EAAI,GAC9C,EAAO,KAAK,EAAE,EACd,IAAI,IAAI;AAKZ,UADA,EAAO,KAAK,EAAU,MAAM,GAAG,EAAE,CAAC,EAC3B,EAAO,KAAK,GAAG;;;CAI1B,SAAS,EAAS,GAAW,GAAG;AAC9B,SAAO,SAAS,GAAQ;GACtB,IAAI,IAAI,EAAQ,MAAM,KAAA,GAAW,EAAE,EAC/B,IAAI,EAAe,GAAG,GAAW,KAAU,IAAI,EAAE,EACjD,GAAM;AACV,OAAI,KAAK,EAAO,OAAQ,QAAO;AAG/B,OAAI,OAAO,EAAG,QAAO,IAAI,KAAK,EAAE,EAAE;AAClC,OAAI,OAAO,EAAG,QAAO,IAAI,KAAK,EAAE,IAAI,OAAQ,OAAO,IAAI,EAAE,IAAI,GAAG;AAYhE,OATI,KAAK,EAAE,OAAO,OAAI,EAAE,IAAI,IAGxB,OAAO,MAAG,EAAE,IAAI,EAAE,IAAI,KAAK,EAAE,IAAI,KAGjC,EAAE,MAAM,KAAA,MAAW,EAAE,IAAI,OAAO,IAAI,EAAE,IAAI,IAG1C,OAAO,GAAG;AACZ,QAAI,EAAE,IAAI,KAAK,EAAE,IAAI,GAAI,QAAO;AAEhC,IADM,OAAO,MAAI,EAAE,IAAI,IACnB,OAAO,KACT,IAAO,EAAQ,EAAQ,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,IAAM,EAAK,WAAW,EAC1D,IAAO,IAAM,KAAK,MAAQ,IAAI,EAAU,KAAK,EAAK,GAAG,EAAU,EAAK,EACpE,IAAO,EAAO,OAAO,IAAO,EAAE,IAAI,KAAK,EAAE,EACzC,EAAE,IAAI,EAAK,gBAAgB,EAC3B,EAAE,IAAI,EAAK,aAAa,EACxB,EAAE,IAAI,EAAK,YAAY,IAAI,EAAE,IAAI,KAAK,MAEtC,IAAO,EAAU,EAAQ,EAAE,GAAG,GAAG,EAAE,CAAC,EAAE,IAAM,EAAK,QAAQ,EACzD,IAAO,IAAM,KAAK,MAAQ,IAAI,EAAW,KAAK,EAAK,GAAG,EAAW,EAAK,EACtE,IAAO,EAAQ,OAAO,IAAO,EAAE,IAAI,KAAK,EAAE,EAC1C,EAAE,IAAI,EAAK,aAAa,EACxB,EAAE,IAAI,EAAK,UAAU,EACrB,EAAE,IAAI,EAAK,SAAS,IAAI,EAAE,IAAI,KAAK;WAE5B,OAAO,KAAK,OAAO,OACtB,OAAO,MAAI,EAAE,IAAI,OAAO,IAAI,EAAE,IAAI,IAAI,SAAO,KACnD,IAAM,OAAO,IAAI,EAAQ,EAAQ,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,WAAW,GAAG,EAAU,EAAQ,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,QAAQ,EACjG,EAAE,IAAI,GACN,EAAE,IAAI,OAAO,KAAK,EAAE,IAAI,KAAK,IAAI,EAAE,IAAI,KAAK,IAAM,KAAK,IAAI,EAAE,IAAI,EAAE,IAAI,KAAK,IAAM,KAAK;AAYzF,UAPI,OAAO,KACT,EAAE,KAAK,EAAE,IAAI,MAAM,GACnB,EAAE,KAAK,EAAE,IAAI,KACN,EAAQ,EAAE,IAIZ,EAAU,EAAE;;;CAIvB,SAAS,EAAe,GAAG,GAAW,GAAQ,GAAG;AAO/C,OANA,IAAI,IAAI,GACJ,IAAI,EAAU,QACd,IAAI,EAAO,QACX,GACA,GAEG,IAAI,IAAG;AACZ,OAAI,KAAK,EAAG,QAAO;AAEnB,OADA,IAAI,EAAU,WAAW,IAAI,EACzB,MAAM,IAGR;QAFA,IAAI,EAAU,OAAO,IAAI,EACzB,IAAQ,GAAO,KAAK,IAAO,EAAU,OAAO,IAAI,GAAG,IAC/C,CAAC,MAAW,IAAI,EAAM,GAAG,GAAQ,EAAE,IAAI,EAAI,QAAO;cAC7C,KAAK,EAAO,WAAW,IAAI,CACpC,QAAO;;AAIX,SAAO;;CAGT,SAAS,GAAY,GAAG,GAAQ,GAAG;EACjC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,EAAE,CAAC;AACtC,SAAO,KAAK,EAAE,IAAI,EAAa,IAAI,EAAE,GAAG,aAAa,CAAC,EAAE,IAAI,EAAE,GAAG,UAAU;;CAG7E,SAAS,GAAkB,GAAG,GAAQ,GAAG;EACvC,IAAI,IAAI,EAAe,KAAK,EAAO,MAAM,EAAE,CAAC;AAC5C,SAAO,KAAK,EAAE,IAAI,GAAmB,IAAI,EAAE,GAAG,aAAa,CAAC,EAAE,IAAI,EAAE,GAAG,UAAU;;CAGnF,SAAS,GAAa,GAAG,GAAQ,GAAG;EAClC,IAAI,IAAI,EAAU,KAAK,EAAO,MAAM,EAAE,CAAC;AACvC,SAAO,KAAK,EAAE,IAAI,EAAc,IAAI,EAAE,GAAG,aAAa,CAAC,EAAE,IAAI,EAAE,GAAG,UAAU;;CAG9E,SAAS,GAAgB,GAAG,GAAQ,GAAG;EACrC,IAAI,IAAI,GAAa,KAAK,EAAO,MAAM,EAAE,CAAC;AAC1C,SAAO,KAAK,EAAE,IAAI,GAAiB,IAAI,EAAE,GAAG,aAAa,CAAC,EAAE,IAAI,EAAE,GAAG,UAAU;;CAGjF,SAAS,GAAW,GAAG,GAAQ,GAAG;EAChC,IAAI,IAAI,GAAQ,KAAK,EAAO,MAAM,EAAE,CAAC;AACrC,SAAO,KAAK,EAAE,IAAI,GAAY,IAAI,EAAE,GAAG,aAAa,CAAC,EAAE,IAAI,EAAE,GAAG,UAAU;;CAG5E,SAAS,GAAoB,GAAG,GAAQ,GAAG;AACzC,SAAO,EAAe,GAAG,GAAiB,GAAQ,EAAE;;CAGtD,SAAS,EAAgB,GAAG,GAAQ,GAAG;AACrC,SAAO,EAAe,GAAG,GAAa,GAAQ,EAAE;;CAGlD,SAAS,GAAgB,GAAG,GAAQ,GAAG;AACrC,SAAO,EAAe,GAAG,GAAa,GAAQ,EAAE;;CAGlD,SAAS,GAAmB,GAAG;AAC7B,SAAO,EAAqB,EAAE,QAAQ;;CAGxC,SAAS,GAAc,GAAG;AACxB,SAAO,EAAgB,EAAE,QAAQ;;CAGnC,SAAS,GAAiB,GAAG;AAC3B,SAAO,EAAmB,EAAE,UAAU;;CAGxC,SAAS,GAAY,GAAG;AACtB,SAAO,EAAc,EAAE,UAAU;;CAGnC,SAAS,GAAa,GAAG;AACvB,SAAO,EAAe,EAAE,EAAE,UAAU,IAAI;;CAG1C,SAAS,GAAc,GAAG;AACxB,SAAO,IAAI,CAAC,EAAE,EAAE,UAAU,GAAG;;CAG/B,SAAS,GAAsB,GAAG;AAChC,SAAO,EAAqB,EAAE,WAAW;;CAG3C,SAAS,GAAiB,GAAG;AAC3B,SAAO,EAAgB,EAAE,WAAW;;CAGtC,SAAS,GAAoB,GAAG;AAC9B,SAAO,EAAmB,EAAE,aAAa;;CAG3C,SAAS,GAAe,GAAG;AACzB,SAAO,EAAc,EAAE,aAAa;;CAGtC,SAAS,GAAgB,GAAG;AAC1B,SAAO,EAAe,EAAE,EAAE,aAAa,IAAI;;CAG7C,SAAS,GAAiB,GAAG;AAC3B,SAAO,IAAI,CAAC,EAAE,EAAE,aAAa,GAAG;;AAGlC,QAAO;EACL,QAAQ,SAAS,GAAW;GAC1B,IAAI,IAAI,EAAU,KAAa,IAAI,EAAQ;AAE3C,UADA,EAAE,WAAW,WAAW;AAAE,WAAO;MAC1B;;EAET,OAAO,SAAS,GAAW;GACzB,IAAI,IAAI,EAAS,KAAa,IAAI,GAAM;AAExC,UADA,EAAE,WAAW,WAAW;AAAE,WAAO;MAC1B;;EAET,WAAW,SAAS,GAAW;GAC7B,IAAI,IAAI,EAAU,KAAa,IAAI,EAAW;AAE9C,UADA,EAAE,WAAW,WAAW;AAAE,WAAO;MAC1B;;EAET,UAAU,SAAS,GAAW;GAC5B,IAAI,IAAI,EAAS,KAAa,IAAI,GAAK;AAEvC,UADA,EAAE,WAAW,WAAW;AAAE,WAAO;MAC1B;;EAEV;;AAGH,IAAI,IAAO;CAAC,KAAK;CAAI,GAAK;CAAK,GAAK;CAAI,EACpC,IAAW,WACX,IAAY,MACZ,IAAY;AAEhB,SAAS,EAAI,GAAO,GAAM,GAAO;CAC/B,IAAI,IAAO,IAAQ,IAAI,MAAM,IACzB,KAAU,IAAO,CAAC,IAAQ,KAAS,IACnC,IAAS,EAAO;AACpB,QAAO,KAAQ,IAAS,IAAY,MAAM,IAAQ,IAAS,EAAE,CAAC,KAAK,EAAK,GAAG,IAAS;;AAGtF,SAAS,EAAQ,GAAG;AAClB,QAAO,EAAE,QAAQ,GAAW,OAAO;;AAGrC,SAAS,EAAS,GAAO;AACvB,QAAW,OAAO,SAAS,EAAM,IAAI,EAAQ,CAAC,KAAK,IAAI,GAAG,KAAK,IAAI;;AAGrE,SAAS,EAAa,GAAO;AAC3B,QAAO,IAAI,IAAI,EAAM,KAAK,GAAM,MAAM,CAAC,EAAK,aAAa,EAAE,EAAE,CAAC,CAAC;;AAGjE,SAAS,EAAyB,GAAG,GAAQ,GAAG;CAC9C,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,EAAyB,GAAG,GAAQ,GAAG;CAC9C,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,GAAsB,GAAG,GAAQ,GAAG;CAC3C,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,GAAmB,GAAG,GAAQ,GAAG;CACxC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,EAAsB,GAAG,GAAQ,GAAG;CAC3C,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,EAAc,GAAG,GAAQ,GAAG;CACnC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,EAAU,GAAG,GAAQ,GAAG;CAC/B,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,EAAE,KAAK,KAAK,OAAO,MAAO,IAAI,EAAE,GAAG,UAAU;;AAG3E,SAAS,GAAU,GAAG,GAAQ,GAAG;CAC/B,IAAI,IAAI,+BAA+B,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AACnE,QAAO,KAAK,EAAE,IAAI,EAAE,KAAK,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,IAAI,EAAE,GAAG,UAAU;;AAG5E,SAAS,GAAa,GAAG,GAAQ,GAAG;CAClC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,EAAE,KAAK,IAAI,GAAG,IAAI,EAAE,GAAG,UAAU;;AAGrD,SAAS,GAAiB,GAAG,GAAQ,GAAG;CACtC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,UAAU;;AAGjD,SAAS,EAAgB,GAAG,GAAQ,GAAG;CACrC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,GAAe,GAAG,GAAQ,GAAG;CACpC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,GAAG,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAGvD,SAAS,EAAY,GAAG,GAAQ,GAAG;CACjC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,GAAa,GAAG,GAAQ,GAAG;CAClC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,GAAa,GAAG,GAAQ,GAAG;CAClC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,GAAkB,GAAG,GAAQ,GAAG;CACvC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,GAAkB,GAAG,GAAQ,GAAG;CACvC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC7C,QAAO,KAAK,EAAE,IAAI,KAAK,MAAM,EAAE,KAAK,IAAK,EAAE,IAAI,EAAE,GAAG,UAAU;;AAGhE,SAAS,GAAoB,GAAG,GAAQ,GAAG;CACzC,IAAI,IAAI,EAAU,KAAK,EAAO,MAAM,GAAG,IAAI,EAAE,CAAC;AAC9C,QAAO,IAAI,IAAI,EAAE,GAAG,SAAS;;AAG/B,SAAS,GAAmB,GAAG,GAAQ,GAAG;CACxC,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,EAAE,CAAC;AACtC,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,GAA0B,GAAG,GAAQ,GAAG;CAC/C,IAAI,IAAI,EAAS,KAAK,EAAO,MAAM,EAAE,CAAC;AACtC,QAAO,KAAK,EAAE,IAAI,CAAC,EAAE,IAAI,IAAI,EAAE,GAAG,UAAU;;AAG9C,SAAS,EAAiB,GAAG,GAAG;AAC9B,QAAO,EAAI,EAAE,SAAS,EAAE,GAAG,EAAE;;AAG/B,SAAS,EAAa,GAAG,GAAG;AAC1B,QAAO,EAAI,EAAE,UAAU,EAAE,GAAG,EAAE;;AAGhC,SAAS,EAAa,GAAG,GAAG;AAC1B,QAAO,EAAI,EAAE,UAAU,GAAG,MAAM,IAAI,GAAG,EAAE;;AAG3C,SAAS,EAAgB,GAAG,GAAG;AAC7B,QAAO,EAAI,IAAI,EAAQ,MAAM,EAAS,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE;;AAGrD,SAAS,EAAmB,GAAG,GAAG;AAChC,QAAO,EAAI,EAAE,iBAAiB,EAAE,GAAG,EAAE;;AAGvC,SAAS,EAAmB,GAAG,GAAG;AAChC,QAAO,EAAmB,GAAG,EAAE,GAAG;;AAGpC,SAAS,EAAkB,GAAG,GAAG;AAC/B,QAAO,EAAI,EAAE,UAAU,GAAG,GAAG,GAAG,EAAE;;AAGpC,SAAS,EAAc,GAAG,GAAG;AAC3B,QAAO,EAAI,EAAE,YAAY,EAAE,GAAG,EAAE;;AAGlC,SAAS,EAAc,GAAG,GAAG;AAC3B,QAAO,EAAI,EAAE,YAAY,EAAE,GAAG,EAAE;;AAGlC,SAAS,EAA0B,GAAG;CACpC,IAAI,IAAM,EAAE,QAAQ;AACpB,QAAO,MAAQ,IAAI,IAAI;;AAGzB,SAAS,EAAuB,GAAG,GAAG;AACpC,QAAO,EAAI,EAAW,MAAM,EAAS,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE;;AAGxD,SAAS,EAAK,GAAG;CACf,IAAI,IAAM,EAAE,QAAQ;AACpB,QAAQ,KAAO,KAAK,MAAQ,IAAK,EAAa,EAAE,GAAG,EAAa,KAAK,EAAE;;AAGzE,SAAS,EAAoB,GAAG,GAAG;AAEjC,QADA,IAAI,EAAK,EAAE,EACJ,EAAI,EAAa,MAAM,EAAS,EAAE,EAAE,EAAE,IAAI,EAAS,EAAE,CAAC,QAAQ,KAAK,IAAI,GAAG,EAAE;;AAGrF,SAAS,GAA0B,GAAG;AACpC,QAAO,EAAE,QAAQ;;AAGnB,SAAS,GAAuB,GAAG,GAAG;AACpC,QAAO,EAAI,EAAW,MAAM,EAAS,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE;;AAGxD,SAAS,GAAW,GAAG,GAAG;AACxB,QAAO,EAAI,EAAE,aAAa,GAAG,KAAK,GAAG,EAAE;;AAGzC,SAAS,GAAc,GAAG,GAAG;AAE3B,QADA,IAAI,EAAK,EAAE,EACJ,EAAI,EAAE,aAAa,GAAG,KAAK,GAAG,EAAE;;AAGzC,SAAS,GAAe,GAAG,GAAG;AAC5B,QAAO,EAAI,EAAE,aAAa,GAAG,KAAO,GAAG,EAAE;;AAG3C,SAAS,GAAkB,GAAG,GAAG;CAC/B,IAAI,IAAM,EAAE,QAAQ;AAEpB,QADA,IAAK,KAAO,KAAK,MAAQ,IAAK,EAAa,EAAE,GAAG,EAAa,KAAK,EAAE,EAC7D,EAAI,EAAE,aAAa,GAAG,KAAO,GAAG,EAAE;;AAG3C,SAAS,GAAW,GAAG;CACrB,IAAI,IAAI,EAAE,mBAAmB;AAC7B,SAAQ,IAAI,IAAI,OAAO,KAAK,IAAI,QAC1B,EAAI,IAAI,KAAK,GAAG,KAAK,EAAE,GACvB,EAAI,IAAI,IAAI,KAAK,EAAE;;AAG3B,SAAS,EAAoB,GAAG,GAAG;AACjC,QAAO,EAAI,EAAE,YAAY,EAAE,GAAG,EAAE;;AAGlC,SAAS,GAAgB,GAAG,GAAG;AAC7B,QAAO,EAAI,EAAE,aAAa,EAAE,GAAG,EAAE;;AAGnC,SAAS,GAAgB,GAAG,GAAG;AAC7B,QAAO,EAAI,EAAE,aAAa,GAAG,MAAM,IAAI,GAAG,EAAE;;AAG9C,SAAS,GAAmB,GAAG,GAAG;AAChC,QAAO,EAAI,IAAI,EAAO,MAAM,EAAQ,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE;;AAGnD,SAAS,EAAsB,GAAG,GAAG;AACnC,QAAO,EAAI,EAAE,oBAAoB,EAAE,GAAG,EAAE;;AAG1C,SAAS,GAAsB,GAAG,GAAG;AACnC,QAAO,EAAsB,GAAG,EAAE,GAAG;;AAGvC,SAAS,GAAqB,GAAG,GAAG;AAClC,QAAO,EAAI,EAAE,aAAa,GAAG,GAAG,GAAG,EAAE;;AAGvC,SAAS,GAAiB,GAAG,GAAG;AAC9B,QAAO,EAAI,EAAE,eAAe,EAAE,GAAG,EAAE;;AAGrC,SAAS,GAAiB,GAAG,GAAG;AAC9B,QAAO,EAAI,EAAE,eAAe,EAAE,GAAG,EAAE;;AAGrC,SAAS,GAA6B,GAAG;CACvC,IAAI,IAAM,EAAE,WAAW;AACvB,QAAO,MAAQ,IAAI,IAAI;;AAGzB,SAAS,GAA0B,GAAG,GAAG;AACvC,QAAO,EAAI,EAAU,MAAM,EAAQ,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE;;AAGtD,SAAS,EAAQ,GAAG;CAClB,IAAI,IAAM,EAAE,WAAW;AACvB,QAAQ,KAAO,KAAK,MAAQ,IAAK,EAAY,EAAE,GAAG,EAAY,KAAK,EAAE;;AAGvE,SAAS,GAAuB,GAAG,GAAG;AAEpC,QADA,IAAI,EAAQ,EAAE,EACP,EAAI,EAAY,MAAM,EAAQ,EAAE,EAAE,EAAE,IAAI,EAAQ,EAAE,CAAC,WAAW,KAAK,IAAI,GAAG,EAAE;;AAGrF,SAAS,GAA6B,GAAG;AACvC,QAAO,EAAE,WAAW;;AAGtB,SAAS,GAA0B,GAAG,GAAG;AACvC,QAAO,EAAI,EAAU,MAAM,EAAQ,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE;;AAGtD,SAAS,GAAc,GAAG,GAAG;AAC3B,QAAO,EAAI,EAAE,gBAAgB,GAAG,KAAK,GAAG,EAAE;;AAG5C,SAAS,GAAiB,GAAG,GAAG;AAE9B,QADA,IAAI,EAAQ,EAAE,EACP,EAAI,EAAE,gBAAgB,GAAG,KAAK,GAAG,EAAE;;AAG5C,SAAS,GAAkB,GAAG,GAAG;AAC/B,QAAO,EAAI,EAAE,gBAAgB,GAAG,KAAO,GAAG,EAAE;;AAG9C,SAAS,GAAqB,GAAG,GAAG;CAClC,IAAI,IAAM,EAAE,WAAW;AAEvB,QADA,IAAK,KAAO,KAAK,MAAQ,IAAK,EAAY,EAAE,GAAG,EAAY,KAAK,EAAE,EAC3D,EAAI,EAAE,gBAAgB,GAAG,KAAO,GAAG,EAAE;;AAG9C,SAAS,KAAgB;AACvB,QAAO;;AAGT,SAAS,IAAuB;AAC9B,QAAO;;AAGT,SAAS,EAAoB,GAAG;AAC9B,QAAO,CAAC;;AAGV,SAAS,EAA2B,GAAG;AACrC,QAAO,KAAK,MAAO,IAAI,IAAK"}

package/dist/node_modules/dagre/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../node_modules/dagre/index.js"],"sourcesContent":["/*\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nmodule.exports = {\n  graphlib: require(\"./lib/graphlib\"),\n\n  layout: require(\"./lib/layout\"),\n  debug: require(\"./lib/debug\"),\n  util: {\n    time: require(\"./lib/util\").time,\n    notime: require(\"./lib/util\").notime\n  },\n  version: require(\"./lib/version\")\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;AAsBA,GAAO,UAAU;EACf,UAAA,GAAA;EAEA,QAAA,GAAA;EACA,OAAA,GAAA;EACA,MAAM;GACJ,MAAA,GAAA,CAA4B;GAC5B,QAAA,GAAA,CAA8B;GAC/B;EACD,SAAA,GAAA;EACD"}

package/dist/node_modules/dagre/lib/acyclic.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"acyclic.js","names":[],"sources":["../../../../node_modules/dagre/lib/acyclic.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar greedyFAS = require(\"./greedy-fas\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  var fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  _.forEach(fas, function(e) {\n    var label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, _.uniqueId(\"rev\"));\n  });\n\n  function weightFn(g) {\n    return function(e) {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  var fas = [];\n  var stack = {};\n  var visited = {};\n\n  function dfs(v) {\n    if (_.has(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function(e) {\n      if (_.has(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  _.forEach(g.nodes(), dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  _.forEach(g.edges(), function(e) {\n    var label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      var forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAEA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;EACV;EACC;EACP;CAED,SAAS,EAAI,GAAG;EACd,IAAI,IAAO,EAAE,OAAO,CAAC,cAAc,WAC/B,EAAU,GAAG,EAAS,EAAE,CAAC,GACzB,EAAO,EAAE;AACb,IAAE,QAAQ,GAAK,SAAS,GAAG;GACzB,IAAI,IAAQ,EAAE,KAAK,EAAE;AAIrB,GAHA,EAAE,WAAW,EAAE,EACf,EAAM,cAAc,EAAE,MACtB,EAAM,WAAW,IACjB,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,GAAO,EAAE,SAAS,MAAM,CAAC;IAC7C;EAEF,SAAS,EAAS,GAAG;AACnB,UAAO,SAAS,GAAG;AACjB,WAAO,EAAE,KAAK,EAAE,CAAC;;;;CAKvB,SAAS,EAAO,GAAG;EACjB,IAAI,IAAM,EAAE,EACR,IAAQ,EAAE,EACV,IAAU,EAAE;EAEhB,SAAS,EAAI,GAAG;AACV,KAAE,IAAI,GAAS,EAAE,KAGrB,EAAQ,KAAK,IACb,EAAM,KAAK,IACX,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG;AACnC,IAAI,EAAE,IAAI,GAAO,EAAE,EAAE,GACnB,EAAI,KAAK,EAAE,GAEX,EAAI,EAAE,EAAE;KAEV,EACF,OAAO,EAAM;;AAIf,SADA,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAI,EAClB;;CAGT,SAAS,EAAK,GAAG;AACf,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAQ,EAAE,KAAK,EAAE;AACrB,OAAI,EAAM,UAAU;AAClB,MAAE,WAAW,EAAE;IAEf,IAAI,IAAc,EAAM;AAGxB,IAFA,OAAO,EAAM,UACb,OAAO,EAAM,aACb,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,GAAO,EAAY;;IAEzC"}

package/dist/node_modules/dagre/lib/add-border-segments.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"add-border-segments.js","names":[],"sources":["../../../../node_modules/dagre/lib/add-border-segments.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    var children = g.children(v);\n    var node = g.node(v);\n    if (children.length) {\n      _.forEach(children, dfs);\n    }\n\n    if (_.has(node, \"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (var rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  var label = { width: 0, height: 0, rank: rank, borderType: prop };\n  var prev = sgNode[prop][rank - 1];\n  var curr = util.addDummyNode(g, \"border\", label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAkB,GAAG;EAC5B,SAAS,EAAI,GAAG;GACd,IAAI,IAAW,EAAE,SAAS,EAAE,EACxB,IAAO,EAAE,KAAK,EAAE;AAKpB,OAJI,EAAS,UACX,EAAE,QAAQ,GAAU,EAAI,EAGtB,EAAE,IAAI,GAAM,UAAU,EAAE;AAE1B,IADA,EAAK,aAAa,EAAE,EACpB,EAAK,cAAc,EAAE;AACrB,SAAK,IAAI,IAAO,EAAK,SAAS,IAAU,EAAK,UAAU,GACrD,IAAO,GACP,EAAE,EAEF,CADA,EAAc,GAAG,cAAc,OAAO,GAAG,GAAM,EAAK,EACpD,EAAc,GAAG,eAAe,OAAO,GAAG,GAAM,EAAK;;;AAK3D,IAAE,QAAQ,EAAE,UAAU,EAAE,EAAI;;CAG9B,SAAS,EAAc,GAAG,GAAM,GAAQ,GAAI,GAAQ,GAAM;EACxD,IAAI,IAAQ;GAAE,OAAO;GAAG,QAAQ;GAAS;GAAM,YAAY;GAAM,EAC7D,IAAO,EAAO,GAAM,IAAO,IAC3B,IAAO,EAAK,aAAa,GAAG,UAAU,GAAO,EAAO;AAGxD,EAFA,EAAO,GAAM,KAAQ,GACrB,EAAE,UAAU,GAAM,EAAG,EACjB,KACF,EAAE,QAAQ,GAAM,GAAM,EAAE,QAAQ,GAAG,CAAC"}

package/dist/node_modules/dagre/lib/coordinate-system.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"coordinate-system.js","names":[],"sources":["../../../../node_modules/dagre/lib/coordinate-system.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"bt\" || rankDir === \"rl\") {\n    reverseY(g);\n  }\n\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });\n  _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });\n}\n\nfunction swapWidthHeightOne(attrs) {\n  var w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, reverseYOne);\n    if (_.has(edge, \"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, swapXYOne);\n    if (_.has(edge, \"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  var x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAEA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;EACP;EACF;EACP;CAED,SAAS,EAAO,GAAG;EACjB,IAAI,IAAU,EAAE,OAAO,CAAC,QAAQ,aAAa;AAC7C,GAAI,MAAY,QAAQ,MAAY,SAClC,EAAgB,EAAE;;CAItB,SAAS,EAAK,GAAG;EACf,IAAI,IAAU,EAAE,OAAO,CAAC,QAAQ,aAAa;AAK7C,GAJI,MAAY,QAAQ,MAAY,SAClC,EAAS,EAAE,GAGT,MAAY,QAAQ,MAAY,UAClC,EAAO,EAAE,EACT,EAAgB,EAAE;;CAItB,SAAS,EAAgB,GAAG;AAE1B,EADA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,KAAmB,EAAE,KAAK,EAAE,CAAC;IAAI,EACpE,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,KAAmB,EAAE,KAAK,EAAE,CAAC;IAAI;;CAGtE,SAAS,EAAmB,GAAO;EACjC,IAAI,IAAI,EAAM;AAEd,EADA,EAAM,QAAQ,EAAM,QACpB,EAAM,SAAS;;CAGjB,SAAS,EAAS,GAAG;AAGnB,EAFA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,KAAY,EAAE,KAAK,EAAE,CAAC;IAAI,EAE7D,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,GADA,EAAE,QAAQ,EAAK,QAAQ,EAAY,EAC/B,EAAE,IAAI,GAAM,IAAI,IAClB,EAAY,EAAK;IAEnB;;CAGJ,SAAS,EAAY,GAAO;AAC1B,IAAM,IAAI,CAAC,EAAM;;CAGnB,SAAS,EAAO,GAAG;AAGjB,EAFA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,KAAU,EAAE,KAAK,EAAE,CAAC;IAAI,EAE3D,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,GADA,EAAE,QAAQ,EAAK,QAAQ,EAAU,EAC7B,EAAE,IAAI,GAAM,IAAI,IAClB,EAAU,EAAK;IAEjB;;CAGJ,SAAS,EAAU,GAAO;EACxB,IAAI,IAAI,EAAM;AAEd,EADA,EAAM,IAAI,EAAM,GAChB,EAAM,IAAI"}

package/dist/node_modules/dagre/lib/data/list.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"list.js","names":[],"sources":["../../../../../node_modules/dagre/lib/data/list.js"],"sourcesContent":["/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nmodule.exports = List;\n\nfunction List() {\n  var sentinel = {};\n  sentinel._next = sentinel._prev = sentinel;\n  this._sentinel = sentinel;\n}\n\nList.prototype.dequeue = function() {\n  var sentinel = this._sentinel;\n  var entry = sentinel._prev;\n  if (entry !== sentinel) {\n    unlink(entry);\n    return entry;\n  }\n};\n\nList.prototype.enqueue = function(entry) {\n  var sentinel = this._sentinel;\n  if (entry._prev && entry._next) {\n    unlink(entry);\n  }\n  entry._next = sentinel._next;\n  sentinel._next._prev = entry;\n  sentinel._next = entry;\n  entry._prev = sentinel;\n};\n\nList.prototype.toString = function() {\n  var strs = [];\n  var sentinel = this._sentinel;\n  var curr = sentinel._prev;\n  while (curr !== sentinel) {\n    strs.push(JSON.stringify(curr, filterOutLinks));\n    curr = curr._prev;\n  }\n  return \"[\" + strs.join(\", \") + \"]\";\n};\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== \"_next\" && k !== \"_prev\") {\n    return v;\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;AAKA,GAAO,UAAU;CAEjB,SAAS,IAAO;EACd,IAAI,IAAW,EAAE;AAEjB,EADA,EAAS,QAAQ,EAAS,QAAQ,GAClC,KAAK,YAAY;;AAuBnB,CApBA,EAAK,UAAU,UAAU,WAAW;EAClC,IAAI,IAAW,KAAK,WAChB,IAAQ,EAAS;AACrB,MAAI,MAAU,EAEZ,QADA,EAAO,EAAM,EACN;IAIX,EAAK,UAAU,UAAU,SAAS,GAAO;EACvC,IAAI,IAAW,KAAK;AAOpB,EANI,EAAM,SAAS,EAAM,SACvB,EAAO,EAAM,EAEf,EAAM,QAAQ,EAAS,OACvB,EAAS,MAAM,QAAQ,GACvB,EAAS,QAAQ,GACjB,EAAM,QAAQ;IAGhB,EAAK,UAAU,WAAW,WAAW;AAInC,OAHA,IAAI,IAAO,EAAE,EACT,IAAW,KAAK,WAChB,IAAO,EAAS,OACb,MAAS,GAEd,CADA,EAAK,KAAK,KAAK,UAAU,GAAM,EAAe,CAAC,EAC/C,IAAO,EAAK;AAEd,SAAO,MAAM,EAAK,KAAK,KAAK,GAAG;;CAGjC,SAAS,EAAO,GAAO;AAIrB,EAHA,EAAM,MAAM,QAAQ,EAAM,OAC1B,EAAM,MAAM,QAAQ,EAAM,OAC1B,OAAO,EAAM,OACb,OAAO,EAAM;;CAGf,SAAS,EAAe,GAAG,GAAG;AAC5B,MAAI,MAAM,WAAW,MAAM,QACzB,QAAO"}

package/dist/node_modules/dagre/lib/debug.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"debug.js","names":[],"sources":["../../../../node_modules/dagre/lib/debug.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  var layerMatrix = util.buildLayerMatrix(g);\n\n  var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  _.forEach(g.nodes(), function(v) {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  _.forEach(g.edges(), function(e) {\n    h.setEdge(e.v, e.w, {}, e.name);\n  });\n\n  _.forEach(layerMatrix, function(layer, i) {\n    var layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    _.reduce(layer, function(u, v) {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,CAA8B;AAElC,GAAO,UAAU,EACA,kBAChB;;CAGD,SAAS,EAAc,GAAG;EACxB,IAAI,IAAc,EAAK,iBAAiB,EAAE,EAEtC,IAAI,IAAI,EAAM;GAAE,UAAU;GAAM,YAAY;GAAM,CAAC,CAAC,SAAS,EAAE,CAAC;AAoBpE,SAlBA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAE/B,GADA,EAAE,QAAQ,GAAG,EAAE,OAAO,GAAG,CAAC,EAC1B,EAAE,UAAU,GAAG,UAAU,EAAE,KAAK,EAAE,CAAC,KAAK;IACxC,EAEF,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,KAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,KAAK;IAC/B,EAEF,EAAE,QAAQ,GAAa,SAAS,GAAO,GAAG;GACxC,IAAI,IAAS,UAAU;AAEvB,GADA,EAAE,QAAQ,GAAQ,EAAE,MAAM,QAAQ,CAAC,EACnC,EAAE,OAAO,GAAO,SAAS,GAAG,GAAG;AAE7B,WADA,EAAE,QAAQ,GAAG,GAAG,EAAE,OAAO,SAAS,CAAC,EAC5B;KACP;IACF,EAEK"}

package/dist/node_modules/dagre/lib/graphlib.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graphlib.js","names":[],"sources":["../../../../node_modules/dagre/lib/graphlib.js"],"sourcesContent":["/* global window */\n\nvar graphlib;\n\nif (typeof require === \"function\") {\n  try {\n    graphlib = require(\"graphlib\");\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!graphlib) {\n  graphlib = window.graphlib;\n}\n\nmodule.exports = graphlib;\n"],"x_google_ignoreList":[0],"mappings":";;;;CAEA,IAAI;AAEJ,KAAI,OAAA,KAAmB,WACrB,KAAI;AACF,MAAA,GAAA;SACU;AASd,CAJA,AACE,MAAW,OAAO,UAGpB,EAAO,UAAU"}

package/dist/node_modules/dagre/lib/greedy-fas.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"greedy-fas.js","names":[],"sources":["../../../../node_modules/dagre/lib/greedy-fas.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\nvar List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return _.flatten(_.map(results, function(e) {\n    return g.outEdges(e.v, e.w);\n  }), true);\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  var results = [];\n  var sources = buckets[buckets.length - 1];\n  var sinks = buckets[0];\n\n  var entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (var i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  var results = collectPredecessors ? [] : undefined;\n\n  _.forEach(g.inEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  _.forEach(g.outEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var w = edge.w;\n    var wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  var fasGraph = new Graph();\n  var maxIn = 0;\n  var maxOut = 0;\n\n  _.forEach(g.nodes(), function(v) {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  _.forEach(g.edges(), function(e) {\n    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    var weight = weightFn(e);\n    var edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n  var zeroIdx = maxIn + 1;\n\n  _.forEach(fasGraph.nodes(), function(v) {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,CAA8B,OAC9B,IAAA,GAAA;AASJ,GAAO,UAAU;CAEjB,IAAI,IAAoB,EAAE,SAAS,EAAE;CAErC,SAAS,EAAU,GAAG,GAAU;AAC9B,MAAI,EAAE,WAAW,IAAI,EACnB,QAAO,EAAE;EAEX,IAAI,IAAQ,EAAW,GAAG,KAAY,EAAkB,EACpD,IAAU,EAAY,EAAM,OAAO,EAAM,SAAS,EAAM,QAAQ;AAGpE,SAAO,EAAE,QAAQ,EAAE,IAAI,GAAS,SAAS,GAAG;AAC1C,UAAO,EAAE,SAAS,EAAE,GAAG,EAAE,EAAE;IAC3B,EAAE,GAAK;;CAGX,SAAS,EAAY,GAAG,GAAS,GAAS;AAMxC,OALA,IAAI,IAAU,EAAE,EACZ,IAAU,EAAQ,EAAQ,SAAS,IACnC,IAAQ,EAAQ,IAEhB,GACG,EAAE,WAAW,GAAE;AACpB,UAAQ,IAAQ,EAAM,SAAS,EAAO,GAAW,GAAG,GAAS,GAAS,EAAM;AAC5E,UAAQ,IAAQ,EAAQ,SAAS,EAAK,GAAW,GAAG,GAAS,GAAS,EAAM;AAC5E,OAAI,EAAE,WAAW,EACf;SAAK,IAAI,IAAI,EAAQ,SAAS,GAAG,IAAI,GAAG,EAAE,EAExC,KADA,IAAQ,EAAQ,GAAG,SAAS,EACxB,GAAO;AACT,SAAU,EAAQ,OAAO,EAAW,GAAG,GAAS,GAAS,GAAO,GAAK,CAAC;AACtE;;;;AAMR,SAAO;;CAGT,SAAS,EAAW,GAAG,GAAS,GAAS,GAAO,GAAqB;EACnE,IAAI,IAAU,IAAsB,EAAE,GAAG,KAAA;AAwBzC,SAtBA,EAAE,QAAQ,EAAE,QAAQ,EAAM,EAAE,EAAE,SAAS,GAAM;GAC3C,IAAI,IAAS,EAAE,KAAK,EAAK,EACrB,IAAS,EAAE,KAAK,EAAK,EAAE;AAO3B,GALI,KACF,EAAQ,KAAK;IAAE,GAAG,EAAK;IAAG,GAAG,EAAK;IAAG,CAAC,EAGxC,EAAO,OAAO,GACd,EAAa,GAAS,GAAS,EAAO;IACtC,EAEF,EAAE,QAAQ,EAAE,SAAS,EAAM,EAAE,EAAE,SAAS,GAAM;GAC5C,IAAI,IAAS,EAAE,KAAK,EAAK,EACrB,IAAI,EAAK,GACT,IAAS,EAAE,KAAK,EAAE;AAEtB,GADA,EAAO,MAAS,GAChB,EAAa,GAAS,GAAS,EAAO;IACtC,EAEF,EAAE,WAAW,EAAM,EAAE,EAEd;;CAGT,SAAS,EAAW,GAAG,GAAU;EAC/B,IAAI,IAAW,IAAI,GAAO,EACtB,IAAQ,GACR,IAAS;AAQb,EANA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,KAAS,QAAQ,GAAG;IAAK;IAAG,IAAM;IAAG,KAAK;IAAG,CAAC;IAC9C,EAIF,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAa,EAAS,KAAK,EAAE,GAAG,EAAE,EAAE,IAAI,GACxC,IAAS,EAAS,EAAE,EACpB,IAAa,IAAa;AAG9B,GAFA,EAAS,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAW,EACtC,IAAS,KAAK,IAAI,GAAQ,EAAS,KAAK,EAAE,EAAE,CAAC,OAAO,EAAO,EAC3D,IAAS,KAAK,IAAI,GAAQ,EAAS,KAAK,EAAE,EAAE,CAAC,MAAU,EAAO;IAC9D;EAEF,IAAI,IAAU,EAAE,MAAM,IAAS,IAAQ,EAAE,CAAC,IAAI,WAAW;AAAE,UAAO,IAAI,GAAM;IAAI,EAC5E,IAAU,IAAQ;AAMtB,SAJA,EAAE,QAAQ,EAAS,OAAO,EAAE,SAAS,GAAG;AACtC,KAAa,GAAS,GAAS,EAAS,KAAK,EAAE,CAAC;IAChD,EAEK;GAAE,OAAO;GAAmB;GAAkB;GAAS;;CAGhE,SAAS,EAAa,GAAS,GAAS,GAAO;AAC7C,EAAK,EAAM,MAEC,EAAM,KAGhB,EAAQ,EAAM,MAAM,EAAM,KAAQ,GAAS,QAAQ,EAAM,GAFzD,EAAQ,EAAQ,SAAS,GAAG,QAAQ,EAAM,GAF1C,EAAQ,GAAG,QAAQ,EAAM"}

package/dist/node_modules/dagre/lib/layout.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"layout.js","names":[],"sources":["../../../../node_modules/dagre/lib/layout.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar acyclic = require(\"./acyclic\");\nvar normalize = require(\"./normalize\");\nvar rank = require(\"./rank\");\nvar normalizeRanks = require(\"./util\").normalizeRanks;\nvar parentDummyChains = require(\"./parent-dummy-chains\");\nvar removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nvar nestingGraph = require(\"./nesting-graph\");\nvar addBorderSegments = require(\"./add-border-segments\");\nvar coordinateSystem = require(\"./coordinate-system\");\nvar order = require(\"./order\");\nvar position = require(\"./position\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n  var time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", function() {\n    var layoutGraph = \n      time(\"  buildLayoutGraph\", function() { return buildLayoutGraph(g); });\n    time(\"  runLayout\",        function() { runLayout(layoutGraph, time); });\n    time(\"  updateInputGraph\", function() { updateInputGraph(g, layoutGraph); });\n  });\n}\n\nfunction runLayout(g, time) {\n  time(\"    makeSpaceForEdgeLabels\", function() { makeSpaceForEdgeLabels(g); });\n  time(\"    removeSelfEdges\",        function() { removeSelfEdges(g); });\n  time(\"    acyclic\",                function() { acyclic.run(g); });\n  time(\"    nestingGraph.run\",       function() { nestingGraph.run(g); });\n  time(\"    rank\",                   function() { rank(util.asNonCompoundGraph(g)); });\n  time(\"    injectEdgeLabelProxies\", function() { injectEdgeLabelProxies(g); });\n  time(\"    removeEmptyRanks\",       function() { removeEmptyRanks(g); });\n  time(\"    nestingGraph.cleanup\",   function() { nestingGraph.cleanup(g); });\n  time(\"    normalizeRanks\",         function() { normalizeRanks(g); });\n  time(\"    assignRankMinMax\",       function() { assignRankMinMax(g); });\n  time(\"    removeEdgeLabelProxies\", function() { removeEdgeLabelProxies(g); });\n  time(\"    normalize.run\",          function() { normalize.run(g); });\n  time(\"    parentDummyChains\",      function() { parentDummyChains(g); });\n  time(\"    addBorderSegments\",      function() { addBorderSegments(g); });\n  time(\"    order\",                  function() { order(g); });\n  time(\"    insertSelfEdges\",        function() { insertSelfEdges(g); });\n  time(\"    adjustCoordinateSystem\", function() { coordinateSystem.adjust(g); });\n  time(\"    position\",               function() { position(g); });\n  time(\"    positionSelfEdges\",      function() { positionSelfEdges(g); });\n  time(\"    removeBorderNodes\",      function() { removeBorderNodes(g); });\n  time(\"    normalize.undo\",         function() { normalize.undo(g); });\n  time(\"    fixupEdgeLabelCoords\",   function() { fixupEdgeLabelCoords(g); });\n  time(\"    undoCoordinateSystem\",   function() { coordinateSystem.undo(g); });\n  time(\"    translateGraph\",         function() { translateGraph(g); });\n  time(\"    assignNodeIntersects\",   function() { assignNodeIntersects(g); });\n  time(\"    reversePoints\",          function() { reversePointsForReversedEdges(g); });\n  time(\"    acyclic.undo\",           function() { acyclic.undo(g); });\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  _.forEach(inputGraph.nodes(), function(v) {\n    var inputLabel = inputGraph.node(v);\n    var layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var inputLabel = inputGraph.edge(e);\n    var layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (_.has(layoutLabel, \"x\")) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nvar graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nvar nodeNumAttrs = [\"width\", \"height\"];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nvar edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nvar edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  var g = new Graph({ multigraph: true, compound: true });\n  var graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(_.merge({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    _.pick(graph, graphAttrs)));\n\n  _.forEach(inputGraph.nodes(), function(v) {\n    var node = canonicalize(inputGraph.node(v));\n    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, _.merge({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      _.pick(edge, edgeAttrs)));\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  var graph = g.graph();\n  graph.ranksep /= 2;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== \"c\") {\n      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.width && edge.height) {\n      var v = g.node(e.v);\n      var w = g.node(e.w);\n      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  var maxRank = 0;\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      maxRank = _.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"edge-proxy\") {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  var minX = Number.POSITIVE_INFINITY;\n  var maxX = 0;\n  var minY = Number.POSITIVE_INFINITY;\n  var maxY = 0;\n  var graphLabel = g.graph();\n  var marginX = graphLabel.marginx || 0;\n  var marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    var x = attrs.x;\n    var y = attrs.y;\n    var w = attrs.width;\n    var h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, function(p) {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (_.has(edge, \"x\")) { edge.x -= minX; }\n    if (_.has(edge, \"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    var nodeV = g.node(e.v);\n    var nodeW = g.node(e.w);\n    var p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  _.forEach(g.nodes(), function(v) {\n    if (g.children(v).length) {\n      var node = g.node(v);\n      var t = g.node(node.borderTop);\n      var b = g.node(node.borderBottom);\n      var l = g.node(_.last(node.borderLeft));\n      var r = g.node(_.last(node.borderRight));\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  _.forEach(g.nodes(), function(v) {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  _.forEach(layers, function(layer) {\n    var orderShift = 0;\n    _.forEach(layer, function(v, i) {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      _.forEach(node.selfEdges, function(selfEdge) {\n        util.addDummyNode(g, \"selfedge\", {\n          width: selfEdge.label.width,\n          height: selfEdge.label.height,\n          rank: node.rank,\n          order: i + (++orderShift),\n          e: selfEdge.e,\n          label: selfEdge.label\n        }, \"_se\");\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"selfedge\") {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + 2 * dx / 3, y: y - dy },\n        { x: x + 5 * dx / 6, y: y - dy },\n        { x: x +     dx    , y: y },\n        { x: x + 5 * dx / 6, y: y + dy },\n        { x: x + 2 * dx / 3, y: y + dy }\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  _.forEach(attrs, function(v, k) {\n    newAttrs[k.toLowerCase()] = v;\n  });\n  return newAttrs;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;CAEA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,CAAmC,gBACnC,IAAA,GAAA,EACA,IAAA,GAAA,CAAqC,kBACrC,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,CAA8B;AAElC,GAAO,UAAU;CAEjB,SAAS,EAAO,GAAG,GAAM;EACvB,IAAI,IAAO,KAAQ,EAAK,cAAc,EAAK,OAAO,EAAK;AACvD,IAAK,UAAU,WAAW;GACxB,IAAI,IACF,EAAK,sBAAsB,WAAW;AAAE,WAAO,EAAiB,EAAE;KAAI;AAExE,GADA,EAAK,eAAsB,WAAW;AAAE,MAAU,GAAa,EAAK;KAAI,EACxE,EAAK,sBAAsB,WAAW;AAAE,MAAiB,GAAG,EAAY;KAAI;IAC5E;;CAGJ,SAAS,EAAU,GAAG,GAAM;AA2B1B,EA1BA,EAAK,8BAA8B,WAAW;AAAE,KAAuB,EAAE;IAAI,EAC7E,EAAK,uBAA8B,WAAW;AAAE,KAAgB,EAAE;IAAI,EACtE,EAAK,eAA8B,WAAW;AAAE,KAAQ,IAAI,EAAE;IAAI,EAClE,EAAK,wBAA8B,WAAW;AAAE,KAAa,IAAI,EAAE;IAAI,EACvE,EAAK,YAA8B,WAAW;AAAE,KAAK,EAAK,mBAAmB,EAAE,CAAC;IAAI,EACpF,EAAK,8BAA8B,WAAW;AAAE,KAAuB,EAAE;IAAI,EAC7E,EAAK,wBAA8B,WAAW;AAAE,KAAiB,EAAE;IAAI,EACvE,EAAK,4BAA8B,WAAW;AAAE,KAAa,QAAQ,EAAE;IAAI,EAC3E,EAAK,sBAA8B,WAAW;AAAE,KAAe,EAAE;IAAI,EACrE,EAAK,wBAA8B,WAAW;AAAE,KAAiB,EAAE;IAAI,EACvE,EAAK,8BAA8B,WAAW;AAAE,KAAuB,EAAE;IAAI,EAC7E,EAAK,qBAA8B,WAAW;AAAE,KAAU,IAAI,EAAE;IAAI,EACpE,EAAK,yBAA8B,WAAW;AAAE,KAAkB,EAAE;IAAI,EACxE,EAAK,yBAA8B,WAAW;AAAE,KAAkB,EAAE;IAAI,EACxE,EAAK,aAA8B,WAAW;AAAE,KAAM,EAAE;IAAI,EAC5D,EAAK,uBAA8B,WAAW;AAAE,KAAgB,EAAE;IAAI,EACtE,EAAK,8BAA8B,WAAW;AAAE,KAAiB,OAAO,EAAE;IAAI,EAC9E,EAAK,gBAA8B,WAAW;AAAE,KAAS,EAAE;IAAI,EAC/D,EAAK,yBAA8B,WAAW;AAAE,KAAkB,EAAE;IAAI,EACxE,EAAK,yBAA8B,WAAW;AAAE,KAAkB,EAAE;IAAI,EACxE,EAAK,sBAA8B,WAAW;AAAE,KAAU,KAAK,EAAE;IAAI,EACrE,EAAK,4BAA8B,WAAW;AAAE,KAAqB,EAAE;IAAI,EAC3E,EAAK,4BAA8B,WAAW;AAAE,KAAiB,KAAK,EAAE;IAAI,EAC5E,EAAK,sBAA8B,WAAW;AAAE,KAAe,EAAE;IAAI,EACrE,EAAK,4BAA8B,WAAW;AAAE,KAAqB,EAAE;IAAI,EAC3E,EAAK,qBAA8B,WAAW;AAAE,KAA8B,EAAE;IAAI,EACpF,EAAK,oBAA8B,WAAW;AAAE,KAAQ,KAAK,EAAE;IAAI;;CASrE,SAAS,EAAiB,GAAY,GAAa;AA4BjD,EA3BA,EAAE,QAAQ,EAAW,OAAO,EAAE,SAAS,GAAG;GACxC,IAAI,IAAa,EAAW,KAAK,EAAE,EAC/B,IAAc,EAAY,KAAK,EAAE;AAErC,GAAI,MACF,EAAW,IAAI,EAAY,GAC3B,EAAW,IAAI,EAAY,GAEvB,EAAY,SAAS,EAAE,CAAC,WAC1B,EAAW,QAAQ,EAAY,OAC/B,EAAW,SAAS,EAAY;IAGpC,EAEF,EAAE,QAAQ,EAAW,OAAO,EAAE,SAAS,GAAG;GACxC,IAAI,IAAa,EAAW,KAAK,EAAE,EAC/B,IAAc,EAAY,KAAK,EAAE;AAGrC,GADA,EAAW,SAAS,EAAY,QAC5B,EAAE,IAAI,GAAa,IAAI,KACzB,EAAW,IAAI,EAAY,GAC3B,EAAW,IAAI,EAAY;IAE7B,EAEF,EAAW,OAAO,CAAC,QAAQ,EAAY,OAAO,CAAC,OAC/C,EAAW,OAAO,CAAC,SAAS,EAAY,OAAO,CAAC;;CAGlD,IAAI,IAAgB;EAAC;EAAW;EAAW;EAAW;EAAW;EAAU,EACvE,IAAgB;EAAE,SAAS;EAAI,SAAS;EAAI,SAAS;EAAI,SAAS;EAAM,EACxE,IAAa;EAAC;EAAa;EAAU;EAAW;EAAQ,EACxD,IAAe,CAAC,SAAS,SAAS,EAClC,IAAe;EAAE,OAAO;EAAG,QAAQ;EAAG,EACtC,IAAe;EAAC;EAAU;EAAU;EAAS;EAAU;EAAc,EACrE,IAAe;EACjB,QAAQ;EAAG,QAAQ;EAAG,OAAO;EAAG,QAAQ;EACxC,aAAa;EAAI,UAAU;EAC5B,EACG,IAAY,CAAC,WAAW;CAQ5B,SAAS,EAAiB,GAAY;EACpC,IAAI,IAAI,IAAI,EAAM;GAAE,YAAY;GAAM,UAAU;GAAM,CAAC,EACnD,IAAQ,EAAa,EAAW,OAAO,CAAC;AAqB5C,SAnBA,EAAE,SAAS,EAAE,MAAM,EAAE,EACnB,GACA,EAAkB,GAAO,EAAc,EACvC,EAAE,KAAK,GAAO,EAAW,CAAC,CAAC,EAE7B,EAAE,QAAQ,EAAW,OAAO,EAAE,SAAS,GAAG;GACxC,IAAI,IAAO,EAAa,EAAW,KAAK,EAAE,CAAC;AAE3C,GADA,EAAE,QAAQ,GAAG,EAAE,SAAS,EAAkB,GAAM,EAAa,EAAE,EAAa,CAAC,EAC7E,EAAE,UAAU,GAAG,EAAW,OAAO,EAAE,CAAC;IACpC,EAEF,EAAE,QAAQ,EAAW,OAAO,EAAE,SAAS,GAAG;GACxC,IAAI,IAAO,EAAa,EAAW,KAAK,EAAE,CAAC;AAC3C,KAAE,QAAQ,GAAG,EAAE,MAAM,EAAE,EACrB,GACA,EAAkB,GAAM,EAAa,EACrC,EAAE,KAAK,GAAM,EAAU,CAAC,CAAC;IAC3B,EAEK;;CAWT,SAAS,EAAuB,GAAG;EACjC,IAAI,IAAQ,EAAE,OAAO;AAErB,EADA,EAAM,WAAW,GACjB,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,GADA,EAAK,UAAU,GACX,EAAK,SAAS,aAAa,KAAK,QAC9B,EAAM,YAAY,QAAQ,EAAM,YAAY,OAC9C,EAAK,SAAS,EAAK,cAEnB,EAAK,UAAU,EAAK;IAGxB;;CASJ,SAAS,EAAuB,GAAG;AACjC,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,OAAI,EAAK,SAAS,EAAK,QAAQ;IAC7B,IAAI,IAAI,EAAE,KAAK,EAAE,EAAE,EAEf,IAAQ;KAAE,OADN,EAAE,KAAK,EAAE,EAAE,CACI,OAAO,EAAE,QAAQ,IAAI,EAAE;KAAS;KAAG;AAC1D,MAAK,aAAa,GAAG,cAAc,GAAO,MAAM;;IAElD;;CAGJ,SAAS,EAAiB,GAAG;EAC3B,IAAI,IAAU;AASd,EARA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,GAAI,EAAK,cACP,EAAK,UAAU,EAAE,KAAK,EAAK,UAAU,CAAC,MACtC,EAAK,UAAU,EAAE,KAAK,EAAK,aAAa,CAAC,MACzC,IAAU,EAAE,IAAI,GAAS,EAAK,QAAQ;IAExC,EACF,EAAE,OAAO,CAAC,UAAU;;CAGtB,SAAS,EAAuB,GAAG;AACjC,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,GAAI,EAAK,UAAU,iBACjB,EAAE,KAAK,EAAK,EAAE,CAAC,YAAY,EAAK,MAChC,EAAE,WAAW,EAAE;IAEjB;;CAGJ,SAAS,EAAe,GAAG;EACzB,IAAI,IAAO,UACP,IAAO,GACP,IAAO,UACP,IAAO,GACP,IAAa,EAAE,OAAO,EACtB,IAAU,EAAW,WAAW,GAChC,IAAU,EAAW,WAAW;EAEpC,SAAS,EAAY,GAAO;GAC1B,IAAI,IAAI,EAAM,GACV,IAAI,EAAM,GACV,IAAI,EAAM,OACV,IAAI,EAAM;AAId,GAHA,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE,EAChC,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE,EAChC,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE,EAChC,IAAO,KAAK,IAAI,GAAM,IAAI,IAAI,EAAE;;AA+BlC,EA5BA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,KAAY,EAAE,KAAK,EAAE,CAAC;IAAI,EAC7D,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,GAAI,EAAE,IAAI,GAAM,IAAI,IAClB,EAAY,EAAK;IAEnB,EAEF,KAAQ,GACR,KAAQ,GAER,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AAEpB,GADA,EAAK,KAAK,GACV,EAAK,KAAK;IACV,EAEF,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AAMpB,GALA,EAAE,QAAQ,EAAK,QAAQ,SAAS,GAAG;AAEjC,IADA,EAAE,KAAK,GACP,EAAE,KAAK;KACP,EACE,EAAE,IAAI,GAAM,IAAI,KAAI,EAAK,KAAK,IAC9B,EAAE,IAAI,GAAM,IAAI,KAAI,EAAK,KAAK;IAClC,EAEF,EAAW,QAAQ,IAAO,IAAO,GACjC,EAAW,SAAS,IAAO,IAAO;;CAGpC,SAAS,EAAqB,GAAG;AAC/B,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAQ,EAAE,KAAK,EAAE,EAAE,EACnB,IAAQ,EAAE,KAAK,EAAE,EAAE,EACnB,GAAI;AAUR,GATK,EAAK,UAKR,IAAK,EAAK,OAAO,IACjB,IAAK,EAAK,OAAO,EAAK,OAAO,SAAS,OALtC,EAAK,SAAS,EAAE,EAChB,IAAK,GACL,IAAK,IAKP,EAAK,OAAO,QAAQ,EAAK,cAAc,GAAO,EAAG,CAAC,EAClD,EAAK,OAAO,KAAK,EAAK,cAAc,GAAO,EAAG,CAAC;IAC/C;;CAGJ,SAAS,EAAqB,GAAG;AAC/B,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,OAAI,EAAE,IAAI,GAAM,IAAI,CAIlB,UAHI,EAAK,aAAa,OAAO,EAAK,aAAa,SAC7C,EAAK,SAAS,EAAK,cAEb,EAAK,UAAb;IACA,KAAK;AAAK,OAAK,KAAK,EAAK,QAAQ,IAAI,EAAK;AAAa;IACvD,KAAK;AAAK,OAAK,KAAK,EAAK,QAAQ,IAAI,EAAK;AAAa;;IAGzD;;CAGJ,SAAS,EAA8B,GAAG;AACxC,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,GAAI,EAAK,YACP,EAAK,OAAO,SAAS;IAEvB;;CAGJ,SAAS,EAAkB,GAAG;AAgB5B,EAfA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,OAAI,EAAE,SAAS,EAAE,CAAC,QAAQ;IACxB,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAI,EAAE,KAAK,EAAK,UAAU,EAC1B,IAAI,EAAE,KAAK,EAAK,aAAa,EAC7B,IAAI,EAAE,KAAK,EAAE,KAAK,EAAK,WAAW,CAAC,EACnC,IAAI,EAAE,KAAK,EAAE,KAAK,EAAK,YAAY,CAAC;AAKxC,IAHA,EAAK,QAAQ,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,EAChC,EAAK,SAAS,KAAK,IAAI,EAAE,IAAI,EAAE,EAAE,EACjC,EAAK,IAAI,EAAE,IAAI,EAAK,QAAQ,GAC5B,EAAK,IAAI,EAAE,IAAI,EAAK,SAAS;;IAE/B,EAEF,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,GAAI,EAAE,KAAK,EAAE,CAAC,UAAU,YACtB,EAAE,WAAW,EAAE;IAEjB;;CAGJ,SAAS,EAAgB,GAAG;AAC1B,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,OAAI,EAAE,MAAM,EAAE,GAAG;IACf,IAAI,IAAO,EAAE,KAAK,EAAE,EAAE;AAKtB,IAJA,AACE,EAAK,cAAY,EAAE,EAErB,EAAK,UAAU,KAAK;KAAK;KAAG,OAAO,EAAE,KAAK,EAAE;KAAE,CAAC,EAC/C,EAAE,WAAW,EAAE;;IAEjB;;CAGJ,SAAS,EAAgB,GAAG;EAC1B,IAAI,IAAS,EAAK,iBAAiB,EAAE;AACrC,IAAE,QAAQ,GAAQ,SAAS,GAAO;GAChC,IAAI,IAAa;AACjB,KAAE,QAAQ,GAAO,SAAS,GAAG,GAAG;IAC9B,IAAI,IAAO,EAAE,KAAK,EAAE;AAYpB,IAXA,EAAK,QAAQ,IAAI,GACjB,EAAE,QAAQ,EAAK,WAAW,SAAS,GAAU;AAC3C,OAAK,aAAa,GAAG,YAAY;MAC/B,OAAO,EAAS,MAAM;MACtB,QAAQ,EAAS,MAAM;MACvB,MAAM,EAAK;MACX,OAAO,IAAK,EAAE;MACd,GAAG,EAAS;MACZ,OAAO,EAAS;MACjB,EAAE,MAAM;MACT,EACF,OAAO,EAAK;KACZ;IACF;;CAGJ,SAAS,EAAkB,GAAG;AAC5B,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,OAAI,EAAK,UAAU,YAAY;IAC7B,IAAI,IAAW,EAAE,KAAK,EAAK,EAAE,EAAE,EAC3B,IAAI,EAAS,IAAI,EAAS,QAAQ,GAClC,IAAI,EAAS,GACb,IAAK,EAAK,IAAI,GACd,IAAK,EAAS,SAAS;AAW3B,IAVA,EAAE,QAAQ,EAAK,GAAG,EAAK,MAAM,EAC7B,EAAE,WAAW,EAAE,EACf,EAAK,MAAM,SAAS;KAClB;MAAE,GAAG,IAAI,IAAI,IAAK;MAAG,GAAG,IAAI;MAAI;KAChC;MAAE,GAAG,IAAI,IAAI,IAAK;MAAG,GAAG,IAAI;MAAI;KAChC;MAAE,GAAG,IAAQ;MAAW;MAAG;KAC3B;MAAE,GAAG,IAAI,IAAI,IAAK;MAAG,GAAG,IAAI;MAAI;KAChC;MAAE,GAAG,IAAI,IAAI,IAAK;MAAG,GAAG,IAAI;MAAI;KACjC,EACD,EAAK,MAAM,IAAI,EAAK,GACpB,EAAK,MAAM,IAAI,EAAK;;IAEtB;;CAGJ,SAAS,EAAkB,GAAK,GAAO;AACrC,SAAO,EAAE,UAAU,EAAE,KAAK,GAAK,EAAM,EAAE,OAAO;;CAGhD,SAAS,EAAa,GAAO;EAC3B,IAAI,IAAW,EAAE;AAIjB,SAHA,EAAE,QAAQ,GAAO,SAAS,GAAG,GAAG;AAC9B,KAAS,EAAE,aAAa,IAAI;IAC5B,EACK"}

package/dist/node_modules/dagre/lib/lodash.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"lodash.js","names":[],"sources":["../../../../node_modules/dagre/lib/lodash.js"],"sourcesContent":["/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      cloneDeep: require(\"lodash/cloneDeep\"),\n      constant: require(\"lodash/constant\"),\n      defaults: require(\"lodash/defaults\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      find: require(\"lodash/find\"),\n      flatten: require(\"lodash/flatten\"),\n      forEach: require(\"lodash/forEach\"),\n      forIn: require(\"lodash/forIn\"),\n      has:  require(\"lodash/has\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      last: require(\"lodash/last\"),\n      map: require(\"lodash/map\"),\n      mapValues: require(\"lodash/mapValues\"),\n      max: require(\"lodash/max\"),\n      merge: require(\"lodash/merge\"),\n      min: require(\"lodash/min\"),\n      minBy: require(\"lodash/minBy\"),\n      now: require(\"lodash/now\"),\n      pick: require(\"lodash/pick\"),\n      range: require(\"lodash/range\"),\n      reduce: require(\"lodash/reduce\"),\n      sortBy: require(\"lodash/sortBy\"),\n      uniqueId: require(\"lodash/uniqueId\"),\n      values: require(\"lodash/values\"),\n      zipObject: require(\"lodash/zipObject\"),\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAEA,IAAI;AAEJ,KAAI,OAAA,KAAmB,WACrB,KAAI;AACF,MAAS;GACP,WAAA,GAAA;GACA,UAAA,GAAA;GACA,UAAA,GAAA;GACA,MAAA,GAAA;GACA,QAAA,GAAA;GACA,MAAA,GAAA;GACA,SAAA,GAAA;GACA,SAAA,GAAA;GACA,OAAA,GAAA;GACA,KAAA,GAAA;GACA,aAAA,GAAA;GACA,MAAA,GAAA;GACA,KAAA,GAAA;GACA,WAAA,GAAA;GACA,KAAA,GAAA;GACA,OAAA,GAAA;GACA,KAAA,GAAA;GACA,OAAA,GAAA;GACA,KAAA,GAAA;GACA,MAAA,GAAA;GACA,OAAA,GAAA;GACA,QAAA,GAAA;GACA,QAAA,GAAA;GACA,UAAA,GAAA;GACA,QAAA,GAAA;GACA,WAAA,GAAA;GACD;SACS;AASd,CAJA,AACE,MAAS,OAAO,GAGlB,EAAO,UAAU"}

package/dist/node_modules/dagre/lib/nesting-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"nesting-graph.js","names":[],"sources":["../../../../node_modules/dagre/lib/nesting-graph.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  cleanup: cleanup\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  var depths = treeDepths(g);\n  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n  var nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  var weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  _.forEach(g.children(), function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n  });\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  var children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  var top = util.addBorderNode(g, \"_bt\");\n  var bottom = util.addBorderNode(g, \"_bb\");\n  var label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  _.forEach(children, function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    var childNode = g.node(child);\n    var childTop = childNode.borderTop ? childNode.borderTop : child;\n    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      _.forEach(children, function(child) {\n        dfs(child, depth + 1);\n      });\n    }\n    depths[v] = depth;\n  }\n  _.forEach(g.children(), function(v) { dfs(v, 1); });\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return _.reduce(g.edges(), function(acc, e) {\n    return acc + g.edge(e).weight;\n  }, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;EACV;EACI;EACV;CAyBD,SAAS,EAAI,GAAG;EACd,IAAI,IAAO,EAAK,aAAa,GAAG,QAAQ,EAAE,EAAE,QAAQ,EAChD,IAAS,EAAW,EAAE,EACtB,IAAS,EAAE,IAAI,EAAE,OAAO,EAAO,CAAC,GAAG,GACnC,IAAU,IAAI,IAAS;AAK3B,EAHA,EAAE,OAAO,CAAC,cAAc,GAGxB,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,KAAE,KAAK,EAAE,CAAC,UAAU;IAAW;EAGlE,IAAI,IAAS,EAAW,EAAE,GAAG;AAS7B,EANA,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,GAAO;AACtC,KAAI,GAAG,GAAM,GAAS,GAAQ,GAAQ,GAAQ,EAAM;IACpD,EAIF,EAAE,OAAO,CAAC,iBAAiB;;CAG7B,SAAS,EAAI,GAAG,GAAM,GAAS,GAAQ,GAAQ,GAAQ,GAAG;EACxD,IAAI,IAAW,EAAE,SAAS,EAAE;AAC5B,MAAI,CAAC,EAAS,QAAQ;AACpB,GAAI,MAAM,KACR,EAAE,QAAQ,GAAM,GAAG;IAAE,QAAQ;IAAG,QAAQ;IAAS,CAAC;AAEpD;;EAGF,IAAI,IAAM,EAAK,cAAc,GAAG,MAAM,EAClC,IAAS,EAAK,cAAc,GAAG,MAAM,EACrC,IAAQ,EAAE,KAAK,EAAE;AA6BrB,EA3BA,EAAE,UAAU,GAAK,EAAE,EACnB,EAAM,YAAY,GAClB,EAAE,UAAU,GAAQ,EAAE,EACtB,EAAM,eAAe,GAErB,EAAE,QAAQ,GAAU,SAAS,GAAO;AAClC,KAAI,GAAG,GAAM,GAAS,GAAQ,GAAQ,GAAQ,EAAM;GAEpD,IAAI,IAAY,EAAE,KAAK,EAAM,EACzB,IAAW,EAAU,YAAY,EAAU,YAAY,GACvD,IAAc,EAAU,eAAe,EAAU,eAAe,GAChE,IAAa,EAAU,YAAY,IAAS,IAAI,GAChD,IAAS,MAAa,IAAkB,IAAS,EAAO,KAAK,IAAzB;AAQxC,GANA,EAAE,QAAQ,GAAK,GAAU;IACvB,QAAQ;IACA;IACR,aAAa;IACd,CAAC,EAEF,EAAE,QAAQ,GAAa,GAAQ;IAC7B,QAAQ;IACA;IACR,aAAa;IACd,CAAC;IACF,EAEG,EAAE,OAAO,EAAE,IACd,EAAE,QAAQ,GAAM,GAAK;GAAE,QAAQ;GAAG,QAAQ,IAAS,EAAO;GAAI,CAAC;;CAInE,SAAS,EAAW,GAAG;EACrB,IAAI,IAAS,EAAE;EACf,SAAS,EAAI,GAAG,GAAO;GACrB,IAAI,IAAW,EAAE,SAAS,EAAE;AAM5B,GALI,KAAY,EAAS,UACvB,EAAE,QAAQ,GAAU,SAAS,GAAO;AAClC,MAAI,GAAO,IAAQ,EAAE;KACrB,EAEJ,EAAO,KAAK;;AAGd,SADA,EAAE,QAAQ,EAAE,UAAU,EAAE,SAAS,GAAG;AAAE,KAAI,GAAG,EAAE;IAAI,EAC5C;;CAGT,SAAS,EAAW,GAAG;AACrB,SAAO,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,GAAK,GAAG;AAC1C,UAAO,IAAM,EAAE,KAAK,EAAE,CAAC;KACtB,EAAE;;CAGP,SAAS,EAAQ,GAAG;EAClB,IAAI,IAAa,EAAE,OAAO;AAG1B,EAFA,EAAE,WAAW,EAAW,YAAY,EACpC,OAAO,EAAW,aAClB,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAE/B,GADW,EAAE,KAAK,EAAE,CACX,eACP,EAAE,WAAW,EAAE;IAEjB"}

package/dist/node_modules/dagre/lib/normalize.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"normalize.js","names":[],"sources":["../../../../node_modules/dagre/lib/normalize.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n}\n\nfunction normalizeEdge(g, e) {\n  var v = e.v;\n  var vRank = g.node(v).rank;\n  var w = e.w;\n  var wRank = g.node(w).rank;\n  var name = e.name;\n  var edgeLabel = g.edge(e);\n  var labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  var dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0, height: 0,\n      edgeLabel: edgeLabel, edgeObj: e,\n      rank: vRank\n    };\n    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = \"edge-label\";\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var origLabel = node.edgeLabel;\n    var w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === \"edge-label\") {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAEA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;EACV;EACC;EACP;CAkBD,SAAS,EAAI,GAAG;AAEd,EADA,EAAE,OAAO,CAAC,cAAc,EAAE,EAC1B,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAM;AAAE,KAAc,GAAG,EAAK;IAAI;;CAGlE,SAAS,EAAc,GAAG,GAAG;EAC3B,IAAI,IAAI,EAAE,GACN,IAAQ,EAAE,KAAK,EAAE,CAAC,MAClB,IAAI,EAAE,GACN,IAAQ,EAAE,KAAK,EAAE,CAAC,MAClB,IAAO,EAAE,MACT,IAAY,EAAE,KAAK,EAAE,EACrB,IAAY,EAAU;AAEtB,YAAU,IAAQ,GAEtB;KAAE,WAAW,EAAE;GAEf,IAAI,GAAO,GAAO;AAClB,QAAK,IAAI,GAAG,EAAE,GAAO,IAAQ,GAAO,EAAE,GAAG,EAAE,EAkBzC,CAjBA,EAAU,SAAS,EAAE,EACrB,IAAQ;IACN,OAAO;IAAG,QAAQ;IACP;IAAW,SAAS;IAC/B,MAAM;IACP,EACD,IAAQ,EAAK,aAAa,GAAG,QAAQ,GAAO,KAAK,EAC7C,MAAU,MACZ,EAAM,QAAQ,EAAU,OACxB,EAAM,SAAS,EAAU,QACzB,EAAM,QAAQ,cACd,EAAM,WAAW,EAAU,WAE7B,EAAE,QAAQ,GAAG,GAAO,EAAE,QAAQ,EAAU,QAAQ,EAAE,EAAK,EACnD,MAAM,KACR,EAAE,OAAO,CAAC,YAAY,KAAK,EAAM,EAEnC,IAAI;AAGN,KAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAU,QAAQ,EAAE,EAAK;;;CAGrD,SAAS,EAAK,GAAG;AACf,IAAE,QAAQ,EAAE,OAAO,CAAC,aAAa,SAAS,GAAG;GAC3C,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAY,EAAK,WACjB;AAEJ,QADA,EAAE,QAAQ,EAAK,SAAS,EAAU,EAC3B,EAAK,OAWV,CAVA,IAAI,EAAE,WAAW,EAAE,CAAC,IACpB,EAAE,WAAW,EAAE,EACf,EAAU,OAAO,KAAK;IAAE,GAAG,EAAK;IAAG,GAAG,EAAK;IAAG,CAAC,EAC3C,EAAK,UAAU,iBACjB,EAAU,IAAI,EAAK,GACnB,EAAU,IAAI,EAAK,GACnB,EAAU,QAAQ,EAAK,OACvB,EAAU,SAAS,EAAK,SAE1B,IAAI,GACJ,IAAO,EAAE,KAAK,EAAE;IAElB"}

package/dist/node_modules/dagre/lib/order/add-subgraph-constraints.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"add-subgraph-constraints.js","names":[],"sources":["../../../../../node_modules/dagre/lib/order/add-subgraph-constraints.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  var prev = {},\n    rootPrev;\n\n  _.forEach(vs, function(v) {\n    var child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      _.each(children, function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAuB,GAAG,GAAI,GAAI;EACzC,IAAI,IAAO,EAAE,EACX;AAEF,IAAE,QAAQ,GAAI,SAAS,GAAG;AAIxB,QAHA,IAAI,IAAQ,EAAE,OAAO,EAAE,EACrB,GACA,GACK,IAAO;AASZ,QARA,IAAS,EAAE,OAAO,EAAM,EACpB,KACF,IAAY,EAAK,IACjB,EAAK,KAAU,MAEf,IAAY,GACZ,IAAW,IAET,KAAa,MAAc,GAAO;AACpC,OAAG,QAAQ,GAAW,EAAM;AAC5B;;AAEF,QAAQ;;IAEV"}

package/dist/node_modules/dagre/lib/order/barycenter.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"barycenter.js","names":[],"sources":["../../../../../node_modules/dagre/lib/order/barycenter.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = barycenter;\n\nfunction barycenter(g, movable) {\n  return _.map(movable, function(v) {\n    var inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      var result = _.reduce(inV, function(acc, e) {\n        var edge = g.edge(e),\n          nodeU = g.node(e.v);\n        return {\n          sum: acc.sum + (edge.weight * nodeU.order),\n          weight: acc.weight + edge.weight\n        };\n      }, { sum: 0, weight: 0 });\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight\n      };\n    }\n  });\n}\n\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAW,GAAG,GAAS;AAC9B,SAAO,EAAE,IAAI,GAAS,SAAS,GAAG;GAChC,IAAI,IAAM,EAAE,QAAQ,EAAE;AACtB,OAAK,EAAI,QAEF;IACL,IAAI,IAAS,EAAE,OAAO,GAAK,SAAS,GAAK,GAAG;KAC1C,IAAI,IAAO,EAAE,KAAK,EAAE,EAClB,IAAQ,EAAE,KAAK,EAAE,EAAE;AACrB,YAAO;MACL,KAAK,EAAI,MAAO,EAAK,SAAS,EAAM;MACpC,QAAQ,EAAI,SAAS,EAAK;MAC3B;OACA;KAAE,KAAK;KAAG,QAAQ;KAAG,CAAC;AAEzB,WAAO;KACF;KACH,YAAY,EAAO,MAAM,EAAO;KAChC,QAAQ,EAAO;KAChB;SAfD,QAAO,EAAK,MAAG;IAiBjB"}

package/dist/node_modules/dagre/lib/order/build-layer-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"build-layer-graph.js","names":[],"sources":["../../../../../node_modules/dagre/lib/order/build-layer-graph.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\n\nmodule.exports = buildLayerGraph;\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship) {\n  var root = createRootNode(g),\n    result = new Graph({ compound: true }).setGraph({ root: root })\n      .setDefaultNodeLabel(function(v) { return g.node(v); });\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      _.forEach(g[relationship](v), function(e) {\n        var u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = !_.isUndefined(edge) ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (_.has(node, \"minRank\")) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank]\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = _.uniqueId(\"_root\"))));\n  return v;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,CAA+B;AAEnC,GAAO,UAAU;CAgCjB,SAAS,EAAgB,GAAG,GAAM,GAAc;EAC9C,IAAI,IAAO,EAAe,EAAE,EAC1B,IAAS,IAAI,EAAM,EAAE,UAAU,IAAM,CAAC,CAAC,SAAS,EAAQ,SAAM,CAAC,CAC5D,oBAAoB,SAAS,GAAG;AAAE,UAAO,EAAE,KAAK,EAAE;IAAI;AA2B3D,SAzBA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE,EAClB,IAAS,EAAE,OAAO,EAAE;AAEtB,IAAI,EAAK,SAAS,KAAQ,EAAK,WAAW,KAAQ,KAAQ,EAAK,aAC7D,EAAO,QAAQ,EAAE,EACjB,EAAO,UAAU,GAAG,KAAU,EAAK,EAGnC,EAAE,QAAQ,EAAE,GAAc,EAAE,EAAE,SAAS,GAAG;IACxC,IAAI,IAAI,EAAE,MAAM,IAAI,EAAE,IAAI,EAAE,GAC1B,IAAO,EAAO,KAAK,GAAG,EAAE,EACxB,IAAU,EAAE,YAAY,EAAK,GAAiB,IAAd,EAAK;AACvC,MAAO,QAAQ,GAAG,GAAG,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,SAAS,GAAQ,CAAC;KAC3D,EAEE,EAAE,IAAI,GAAM,UAAU,IACxB,EAAO,QAAQ,GAAG;IAChB,YAAY,EAAK,WAAW;IAC5B,aAAa,EAAK,YAAY;IAC/B,CAAC;IAGN,EAEK;;CAGT,SAAS,EAAe,GAAG;AAEzB,OADA,IAAI,GACG,EAAE,QAAS,IAAI,EAAE,SAAS,QAAQ,CAAE;AAC3C,SAAO"}

package/dist/node_modules/dagre/lib/order/cross-count.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cross-count.js","names":[],"sources":["../../../../../node_modules/dagre/lib/order/cross-count.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = crossCount;\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  var cc = 0;\n  for (var i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  var southPos = _.zipObject(southLayer,\n    _.map(southLayer, function (v, i) { return i; }));\n  var southEntries = _.flatten(_.map(northLayer, function(v) {\n    return _.sortBy(_.map(g.outEdges(v), function(e) {\n      return { pos: southPos[e.w], weight: g.edge(e).weight };\n    }), \"pos\");\n  }), true);\n\n  // Build the accumulator tree\n  var firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  var treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  var tree = _.map(new Array(treeSize), function() { return 0; });\n\n  // Calculate the weighted crossings\n  var cc = 0;\n  _.forEach(southEntries.forEach(function(entry) {\n    var index = entry.pos + firstIndex;\n    tree[index] += entry.weight;\n    var weightSum = 0;\n    while (index > 0) {\n      if (index % 2) {\n        weightSum += tree[index + 1];\n      }\n      index = (index - 1) >> 1;\n      tree[index] += entry.weight;\n    }\n    cc += entry.weight * weightSum;\n  }));\n\n  return cc;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAEA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAkBjB,SAAS,EAAW,GAAG,GAAU;AAE/B,OAAK,IADD,IAAK,GACA,IAAI,GAAG,IAAI,EAAS,QAAQ,EAAE,EACrC,MAAM,EAAmB,GAAG,EAAS,IAAE,IAAI,EAAS,GAAG;AAEzD,SAAO;;CAGT,SAAS,EAAmB,GAAG,GAAY,GAAY;AAcrD,OAVA,IAAI,IAAW,EAAE,UAAU,GACzB,EAAE,IAAI,GAAY,SAAU,GAAG,GAAG;AAAE,UAAO;IAAK,CAAC,EAC/C,IAAe,EAAE,QAAQ,EAAE,IAAI,GAAY,SAAS,GAAG;AACzD,UAAO,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG;AAC/C,WAAO;KAAE,KAAK,EAAS,EAAE;KAAI,QAAQ,EAAE,KAAK,EAAE,CAAC;KAAQ;KACvD,EAAE,MAAM;IACV,EAAE,GAAK,EAGL,IAAa,GACV,IAAa,EAAW,QAAQ,OAAe;EACtD,IAAI,IAAW,IAAI,IAAa;AAChC;EACA,IAAI,IAAO,EAAE,IAAQ,MAAM,EAAS,EAAE,WAAW;AAAE,UAAO;IAAK,EAG3D,IAAK;AAeT,SAdA,EAAE,QAAQ,EAAa,QAAQ,SAAS,GAAO;GAC7C,IAAI,IAAQ,EAAM,MAAM;AACxB,KAAK,MAAU,EAAM;AAErB,QADA,IAAI,IAAY,GACT,IAAQ,GAKb,CAJI,IAAQ,MACV,KAAa,EAAK,IAAQ,KAE5B,IAAS,IAAQ,KAAM,GACvB,EAAK,MAAU,EAAM;AAEvB,QAAM,EAAM,SAAS;IACrB,CAAC,EAEI"}

package/dist/node_modules/dagre/lib/order/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../../../node_modules/dagre/lib/order/index.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar initOrder = require(\"./init-order\");\nvar crossCount = require(\"./cross-count\");\nvar sortSubgraph = require(\"./sort-subgraph\");\nvar buildLayerGraph = require(\"./build-layer-graph\");\nvar addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\nmodule.exports = order;\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g) {\n  var maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), \"inEdges\"),\n    upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), \"outEdges\");\n\n  var layering = initOrder(g);\n  assignOrder(g, layering);\n\n  var bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = util.buildLayerMatrix(g);\n    var cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = _.cloneDeep(layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  return _.map(ranks, function(rank) {\n    return buildLayerGraph(g, rank, relationship);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  var cg = new Graph();\n  _.forEach(layerGraphs, function(lg) {\n    var root = lg.graph().root;\n    var sorted = sortSubgraph(lg, root, cg, biasRight);\n    _.forEach(sorted.vs, function(v, i) {\n      lg.node(v).order = i;\n    });\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, i) {\n      g.node(v).order = i;\n    });\n  });\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;CAEA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,CAA+B,OAC/B,IAAA,GAAA;AAEJ,GAAO,UAAU;CAiBjB,SAAS,EAAM,GAAG;EAChB,IAAI,IAAU,EAAK,QAAQ,EAAE,EAC3B,IAAkB,EAAiB,GAAG,EAAE,MAAM,GAAG,IAAU,EAAE,EAAE,UAAU,EACzE,IAAgB,EAAiB,GAAG,EAAE,MAAM,IAAU,GAAG,IAAI,GAAG,EAAE,WAAW,EAE3E,IAAW,EAAU,EAAE;AAC3B,IAAY,GAAG,EAAS;AAKxB,OAAK,IAHD,IAAS,UACX,GAEO,IAAI,GAAG,IAAW,GAAG,IAAW,GAAG,EAAE,GAAG,EAAE,GAAU;AAG3D,GAFA,EAAiB,IAAI,IAAI,IAAkB,GAAe,IAAI,KAAK,EAAE,EAErE,IAAW,EAAK,iBAAiB,EAAE;GACnC,IAAI,IAAK,EAAW,GAAG,EAAS;AAChC,GAAI,IAAK,MACP,IAAW,GACX,IAAO,EAAE,UAAU,EAAS,EAC5B,IAAS;;AAIb,IAAY,GAAG,EAAK;;CAGtB,SAAS,EAAiB,GAAG,GAAO,GAAc;AAChD,SAAO,EAAE,IAAI,GAAO,SAAS,GAAM;AACjC,UAAO,EAAgB,GAAG,GAAM,EAAa;IAC7C;;CAGJ,SAAS,EAAiB,GAAa,GAAW;EAChD,IAAI,IAAK,IAAI,GAAO;AACpB,IAAE,QAAQ,GAAa,SAAS,GAAI;GAClC,IAAI,IAAO,EAAG,OAAO,CAAC,MAClB,IAAS,EAAa,GAAI,GAAM,GAAI,EAAU;AAIlD,GAHA,EAAE,QAAQ,EAAO,IAAI,SAAS,GAAG,GAAG;AAClC,MAAG,KAAK,EAAE,CAAC,QAAQ;KACnB,EACF,EAAuB,GAAI,GAAI,EAAO,GAAG;IACzC;;CAGJ,SAAS,EAAY,GAAG,GAAU;AAChC,IAAE,QAAQ,GAAU,SAAS,GAAO;AAClC,KAAE,QAAQ,GAAO,SAAS,GAAG,GAAG;AAC9B,MAAE,KAAK,EAAE,CAAC,QAAQ;KAClB;IACF"}

package/dist/node_modules/dagre/lib/order/init-order.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"init-order.js","names":[],"sources":["../../../../../node_modules/dagre/lib/order/init-order.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = initOrder;\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  var visited = {};\n  var simpleNodes = _.filter(g.nodes(), function(v) {\n    return !g.children(v).length;\n  });\n  var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));\n  var layers = _.map(_.range(maxRank + 1), function() { return []; });\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    var node = g.node(v);\n    layers[node.rank].push(v);\n    _.forEach(g.successors(v), dfs);\n  }\n\n  var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });\n  _.forEach(orderedVs, dfs);\n\n  return layers;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAEA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAajB,SAAS,EAAU,GAAG;EACpB,IAAI,IAAU,EAAE,EACZ,IAAc,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,GAAG;AAChD,UAAO,CAAC,EAAE,SAAS,EAAE,CAAC;IACtB,EACE,IAAU,EAAE,IAAI,EAAE,IAAI,GAAa,SAAS,GAAG;AAAE,UAAO,EAAE,KAAK,EAAE,CAAC;IAAQ,CAAC,EAC3E,IAAS,EAAE,IAAI,EAAE,MAAM,IAAU,EAAE,EAAE,WAAW;AAAE,UAAO,EAAE;IAAI;EAEnE,SAAS,EAAI,GAAG;AACV,KAAE,IAAI,GAAS,EAAE,KACrB,EAAQ,KAAK,IAEb,EADW,EAAE,KAAK,EAAE,CACR,MAAM,KAAK,EAAE,EACzB,EAAE,QAAQ,EAAE,WAAW,EAAE,EAAE,EAAI;;EAGjC,IAAI,IAAY,EAAE,OAAO,GAAa,SAAS,GAAG;AAAE,UAAO,EAAE,KAAK,EAAE,CAAC;IAAQ;AAG7E,SAFA,EAAE,QAAQ,GAAW,EAAI,EAElB"}

package/dist/node_modules/dagre/lib/order/resolve-conflicts.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"resolve-conflicts.js","names":[],"sources":["../../../../../node_modules/dagre/lib/order/resolve-conflicts.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = resolveConflicts;\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  var mappedEntries = {};\n  _.forEach(entries, function(entry, i) {\n    var tmp = mappedEntries[entry.v] = {\n      indegree: 0,\n      \"in\": [],\n      out: [],\n      vs: [entry.v],\n      i: i\n    };\n    if (!_.isUndefined(entry.barycenter)) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  _.forEach(cg.edges(), function(e) {\n    var entryV = mappedEntries[e.v];\n    var entryW = mappedEntries[e.w];\n    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  var sourceSet = _.filter(mappedEntries, function(entry) {\n    return !entry.indegree;\n  });\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  var entries = [];\n\n  function handleIn(vEntry) {\n    return function(uEntry) {\n      if (uEntry.merged) {\n        return;\n      }\n      if (_.isUndefined(uEntry.barycenter) ||\n          _.isUndefined(vEntry.barycenter) ||\n          uEntry.barycenter >= vEntry.barycenter) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return function(wEntry) {\n      wEntry[\"in\"].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    var entry = sourceSet.pop();\n    entries.push(entry);\n    _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n    _.forEach(entry.out, handleOut(entry));\n  }\n\n  return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n    function(entry) {\n      return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n    });\n\n}\n\nfunction mergeEntries(target, source) {\n  var sum = 0;\n  var weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAEA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CA2BjB,SAAS,EAAiB,GAAS,GAAI;EACrC,IAAI,IAAgB,EAAE;AA4BtB,SA3BA,EAAE,QAAQ,GAAS,SAAS,GAAO,GAAG;GACpC,IAAI,IAAM,EAAc,EAAM,KAAK;IACjC,UAAU;IACV,IAAM,EAAE;IACR,KAAK,EAAE;IACP,IAAI,CAAC,EAAM,EAAE;IACV;IACJ;AACD,GAAK,EAAE,YAAY,EAAM,WAAW,KAClC,EAAI,aAAa,EAAM,YACvB,EAAI,SAAS,EAAM;IAErB,EAEF,EAAE,QAAQ,EAAG,OAAO,EAAE,SAAS,GAAG;GAChC,IAAI,IAAS,EAAc,EAAE,IACzB,IAAS,EAAc,EAAE;AAC7B,GAAI,CAAC,EAAE,YAAY,EAAO,IAAI,CAAC,EAAE,YAAY,EAAO,KAClD,EAAO,YACP,EAAO,IAAI,KAAK,EAAc,EAAE,GAAG;IAErC,EAMK,EAJS,EAAE,OAAO,GAAe,SAAS,GAAO;AACtD,UAAO,CAAC,EAAM;IACd,CAEkC;;CAGtC,SAAS,EAAmB,GAAW;EACrC,IAAI,IAAU,EAAE;EAEhB,SAAS,EAAS,GAAQ;AACxB,UAAO,SAAS,GAAQ;AAClB,MAAO,WAGP,EAAE,YAAY,EAAO,WAAW,IAChC,EAAE,YAAY,EAAO,WAAW,IAChC,EAAO,cAAc,EAAO,eAC9B,EAAa,GAAQ,EAAO;;;EAKlC,SAAS,EAAU,GAAQ;AACzB,UAAO,SAAS,GAAQ;AAEtB,IADA,EAAO,GAAM,KAAK,EAAO,EACrB,EAAE,EAAO,aAAa,KACxB,EAAU,KAAK,EAAO;;;AAK5B,SAAO,EAAU,SAAQ;GACvB,IAAI,IAAQ,EAAU,KAAK;AAG3B,GAFA,EAAQ,KAAK,EAAM,EACnB,EAAE,QAAQ,EAAM,GAAM,SAAS,EAAE,EAAS,EAAM,CAAC,EACjD,EAAE,QAAQ,EAAM,KAAK,EAAU,EAAM,CAAC;;AAGxC,SAAO,EAAE,IAAI,EAAE,OAAO,GAAS,SAAS,GAAO;AAAE,UAAO,CAAC,EAAM;IAAU,EACvE,SAAS,GAAO;AACd,UAAO,EAAE,KAAK,GAAO;IAAC;IAAM;IAAK;IAAc;IAAS,CAAC;IACzD;;CAIN,SAAS,EAAa,GAAQ,GAAQ;EACpC,IAAI,IAAM,GACN,IAAS;AAgBb,EAdI,EAAO,WACT,KAAO,EAAO,aAAa,EAAO,QAClC,KAAU,EAAO,SAGf,EAAO,WACT,KAAO,EAAO,aAAa,EAAO,QAClC,KAAU,EAAO,SAGnB,EAAO,KAAK,EAAO,GAAG,OAAO,EAAO,GAAG,EACvC,EAAO,aAAa,IAAM,GAC1B,EAAO,SAAS,GAChB,EAAO,IAAI,KAAK,IAAI,EAAO,GAAG,EAAO,EAAE,EACvC,EAAO,SAAS"}

package/dist/node_modules/dagre/lib/order/sort-subgraph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort-subgraph.js","names":[],"sources":["../../../../../node_modules/dagre/lib/order/sort-subgraph.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar barycenter = require(\"./barycenter\");\nvar resolveConflicts = require(\"./resolve-conflicts\");\nvar sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  var movable = g.children(v);\n  var node = g.node(v);\n  var bl = node ? node.borderLeft : undefined;\n  var br = node ? node.borderRight: undefined;\n  var subgraphs = {};\n\n  if (bl) {\n    movable = _.filter(movable, function(w) {\n      return w !== bl && w !== br;\n    });\n  }\n\n  var barycenters = barycenter(g, movable);\n  _.forEach(barycenters, function(entry) {\n    if (g.children(entry.v).length) {\n      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (_.has(subgraphResult, \"barycenter\")) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  var entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  var result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = _.flatten([bl, result.vs, br], true);\n    if (g.predecessors(bl).length) {\n      var blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!_.has(result, \"barycenter\")) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter = (result.barycenter * result.weight +\n                           blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  _.forEach(entries, function(entry) {\n    entry.vs = _.flatten(entry.vs.map(function(v) {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs;\n      }\n      return v;\n    }), true);\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (!_.isUndefined(target.barycenter)) {\n    target.barycenter = (target.barycenter * target.weight +\n                         other.barycenter * other.weight) /\n                        (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAa,GAAG,GAAG,GAAI,GAAW;EACzC,IAAI,IAAU,EAAE,SAAS,EAAE,EACvB,IAAO,EAAE,KAAK,EAAE,EAChB,IAAK,IAAO,EAAK,aAAa,KAAA,GAC9B,IAAK,IAAO,EAAK,cAAa,KAAA,GAC9B,IAAY,EAAE;AAElB,EAAI,MACF,IAAU,EAAE,OAAO,GAAS,SAAS,GAAG;AACtC,UAAO,MAAM,KAAM,MAAM;IACzB;EAGJ,IAAI,IAAc,EAAW,GAAG,EAAQ;AACxC,IAAE,QAAQ,GAAa,SAAS,GAAO;AACrC,OAAI,EAAE,SAAS,EAAM,EAAE,CAAC,QAAQ;IAC9B,IAAI,IAAiB,EAAa,GAAG,EAAM,GAAG,GAAI,EAAU;AAE5D,IADA,EAAU,EAAM,KAAK,GACjB,EAAE,IAAI,GAAgB,aAAa,IACrC,EAAiB,GAAO,EAAe;;IAG3C;EAEF,IAAI,IAAU,EAAiB,GAAa,EAAG;AAC/C,IAAgB,GAAS,EAAU;EAEnC,IAAI,IAAS,EAAK,GAAS,EAAU;AAErC,MAAI,MACF,EAAO,KAAK,EAAE,QAAQ;GAAC;GAAI,EAAO;GAAI;GAAG,EAAE,GAAK,EAC5C,EAAE,aAAa,EAAG,CAAC,SAAQ;GAC7B,IAAI,IAAS,EAAE,KAAK,EAAE,aAAa,EAAG,CAAC,GAAG,EACxC,IAAS,EAAE,KAAK,EAAE,aAAa,EAAG,CAAC,GAAG;AAOxC,GANK,EAAE,IAAI,GAAQ,aAAa,KAC9B,EAAO,aAAa,GACpB,EAAO,SAAS,IAElB,EAAO,cAAc,EAAO,aAAa,EAAO,SAC3B,EAAO,QAAQ,EAAO,UAAU,EAAO,SAAS,IACrE,EAAO,UAAU;;AAIrB,SAAO;;CAGT,SAAS,EAAgB,GAAS,GAAW;AAC3C,IAAE,QAAQ,GAAS,SAAS,GAAO;AACjC,KAAM,KAAK,EAAE,QAAQ,EAAM,GAAG,IAAI,SAAS,GAAG;AAI5C,WAHI,EAAU,KACL,EAAU,GAAG,KAEf;KACP,EAAE,GAAK;IACT;;CAGJ,SAAS,EAAiB,GAAQ,GAAO;AACvC,EAAK,EAAE,YAAY,EAAO,WAAW,IAMnC,EAAO,aAAa,EAAM,YAC1B,EAAO,SAAS,EAAM,WANtB,EAAO,cAAc,EAAO,aAAa,EAAO,SAC3B,EAAM,aAAa,EAAM,WACzB,EAAO,SAAS,EAAM,SAC3C,EAAO,UAAU,EAAM"}

package/dist/node_modules/dagre/lib/order/sort.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sort.js","names":[],"sources":["../../../../../node_modules/dagre/lib/order/sort.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n  var parts = util.partition(entries, function(entry) {\n    return _.has(entry, \"barycenter\");\n  });\n  var sortable = parts.lhs,\n    unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  _.forEach(sortable, function (entry) {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  var result = { vs: _.flatten(vs, true) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  var last;\n  while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return function(entryV, entryW) {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAK,GAAS,GAAW;EAChC,IAAI,IAAQ,EAAK,UAAU,GAAS,SAAS,GAAO;AAClD,UAAO,EAAE,IAAI,GAAO,aAAa;IACjC,EACE,IAAW,EAAM,KACnB,IAAa,EAAE,OAAO,EAAM,KAAK,SAAS,GAAO;AAAE,UAAO,CAAC,EAAM;IAAK,EACtE,IAAK,EAAE,EACP,IAAM,GACN,IAAS,GACT,IAAU;AAMZ,EAJA,EAAS,KAAK,EAAgB,CAAC,CAAC,EAAU,CAAC,EAE3C,IAAU,EAAkB,GAAI,GAAY,EAAQ,EAEpD,EAAE,QAAQ,GAAU,SAAU,GAAO;AAKnC,GAJA,KAAW,EAAM,GAAG,QACpB,EAAG,KAAK,EAAM,GAAG,EACjB,KAAO,EAAM,aAAa,EAAM,QAChC,KAAU,EAAM,QAChB,IAAU,EAAkB,GAAI,GAAY,EAAQ;IACpD;EAEF,IAAI,IAAS,EAAE,IAAI,EAAE,QAAQ,GAAI,GAAK,EAAE;AAKxC,SAJI,MACF,EAAO,aAAa,IAAM,GAC1B,EAAO,SAAS,IAEX;;CAGT,SAAS,EAAkB,GAAI,GAAY,GAAO;AAEhD,OADA,IAAI,GACG,EAAW,WAAW,IAAO,EAAE,KAAK,EAAW,EAAE,KAAK,GAG3D,CAFA,EAAW,KAAK,EAChB,EAAG,KAAK,EAAK,GAAG,EAChB;AAEF,SAAO;;CAGT,SAAS,EAAgB,GAAM;AAC7B,SAAO,SAAS,GAAQ,GAAQ;AAO9B,UANI,EAAO,aAAa,EAAO,aACtB,KACE,EAAO,aAAa,EAAO,aAC7B,IAGD,IAA6B,EAAO,IAAI,EAAO,IAAxC,EAAO,IAAI,EAAO"}

package/dist/node_modules/dagre/lib/parent-dummy-chains.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"parent-dummy-chains.js","names":[],"sources":["../../../../node_modules/dagre/lib/parent-dummy-chains.js"],"sourcesContent":["var _ = require(\"./lodash\");\n\nmodule.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n  var postorderNums = postorder(g);\n\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var edgeObj = node.edgeObj;\n    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    var path = pathData.path;\n    var lca = pathData.lca;\n    var pathIdx = 0;\n    var pathV = path[pathIdx];\n    var ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca &&\n               g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (pathIdx < path.length - 1 &&\n               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  var vPath = [];\n  var wPath = [];\n  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  var parent;\n  var lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent &&\n           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  var result = {};\n  var lim = 0;\n\n  function dfs(v) {\n    var low = lim;\n    _.forEach(g.children(v), dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  _.forEach(g.children(), dfs);\n\n  return result;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAkB,GAAG;EAC5B,IAAI,IAAgB,EAAU,EAAE;AAEhC,IAAE,QAAQ,EAAE,OAAO,CAAC,aAAa,SAAS,GAAG;AAU3C,QATA,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAU,EAAK,SACf,IAAW,EAAS,GAAG,GAAe,EAAQ,GAAG,EAAQ,EAAE,EAC3D,IAAO,EAAS,MAChB,IAAM,EAAS,KACf,IAAU,GACV,IAAQ,EAAK,IACb,IAAY,IAET,MAAM,EAAQ,IAAG;AAGtB,QAFA,IAAO,EAAE,KAAK,EAAE,EAEZ,GAAW;AACb,aAAQ,IAAQ,EAAK,QAAc,KAC5B,EAAE,KAAK,EAAM,CAAC,UAAU,EAAK,MAClC;AAGF,KAAI,MAAU,MACZ,IAAY;;AAIhB,QAAI,CAAC,GAAW;AACd,YAAO,IAAU,EAAK,SAAS,KACxB,EAAE,KAAK,IAAQ,EAAK,IAAU,GAAG,CAAC,WAAW,EAAK,MACvD;AAEF,SAAQ,EAAK;;AAIf,IADA,EAAE,UAAU,GAAG,EAAM,EACrB,IAAI,EAAE,WAAW,EAAE,CAAC;;IAEtB;;CAKJ,SAAS,EAAS,GAAG,GAAe,GAAG,GAAG;EACxC,IAAI,IAAQ,EAAE,EACV,IAAQ,EAAE,EACV,IAAM,KAAK,IAAI,EAAc,GAAG,KAAK,EAAc,GAAG,IAAI,EAC1D,IAAM,KAAK,IAAI,EAAc,GAAG,KAAK,EAAc,GAAG,IAAI,EAC1D,IAIK,GAHL;AAIJ;AAEE,GADA,IAAS,EAAE,OAAO,EAAO,EACzB,EAAM,KAAK,EAAO;SACX,MACC,EAAc,GAAQ,MAAM,KAAO,IAAM,EAAc,GAAQ;AAKzE,OAJA,IAAM,GAGN,IAAS,IACD,IAAS,EAAE,OAAO,EAAO,MAAM,GACrC,GAAM,KAAK,EAAO;AAGpB,SAAO;GAAE,MAAM,EAAM,OAAO,EAAM,SAAS,CAAC;GAAO;GAAK;;CAG1D,SAAS,EAAU,GAAG;EACpB,IAAI,IAAS,EAAE,EACX,IAAM;EAEV,SAAS,EAAI,GAAG;GACd,IAAI,IAAM;AAEV,GADA,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,EAAI,EAC7B,EAAO,KAAK;IAAO;IAAK,KAAK;IAAO;;AAItC,SAFA,EAAE,QAAQ,EAAE,UAAU,EAAE,EAAI,EAErB"}

package/dist/node_modules/dagre/lib/position/bk.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bk.js","names":[],"sources":["../../../../../node_modules/dagre/lib/position/bk.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nmodule.exports = {\n  positionX: positionX,\n  findType1Conflicts: findType1Conflicts,\n  findType2Conflicts: findType2Conflicts,\n  addConflict: addConflict,\n  hasConflict: hasConflict,\n  verticalAlignment: verticalAlignment,\n  horizontalCompaction: horizontalCompaction,\n  alignCoordinates: alignCoordinates,\n  findSmallestWidthAlignment: findSmallestWidthAlignment,\n  balance: balance\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  var conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    var\n      // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = _.last(layer);\n\n    _.forEach(layer, function(v, i) {\n      var w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        _.forEach(layer.slice(scanPos, i +1), function(scanNode) {\n          _.forEach(g.predecessors(scanNode), function(u) {\n            var uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) &&\n                !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  var conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    var v;\n    _.forEach(_.range(southPos, southEnd), function(i) {\n      v = south[i];\n      if (g.node(v).dummy) {\n        _.forEach(g.predecessors(v), function(u) {\n          var uNode = g.node(u);\n          if (uNode.dummy &&\n              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n\n  function visitLayer(north, south) {\n    var prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    _.forEach(south, function(v, southLookahead) {\n      if (g.node(v).dummy === \"border\") {\n        var predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return _.find(g.predecessors(v), function(u) {\n      return g.node(u).dummy;\n    });\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  var conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return _.has(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  var root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, order) {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  _.forEach(layering, function(layer) {\n    var prevIdx = -1;\n    _.forEach(layer, function(v) {\n      var ws = neighborFn(v);\n      if (ws.length) {\n        ws = _.sortBy(ws, function(w) { return pos[w]; });\n        var mp = (ws.length - 1) / 2;\n        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          var w = ws[i];\n          if (align[v] === v &&\n              prevIdx < pos[w] &&\n              !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  var xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    var stack = blockG.nodes();\n    var elem = stack.pop();\n    var visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    var min = blockG.outEdges(elem).reduce(function(acc, e) {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    var node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  _.forEach(align, function(v) {\n    xs[v] = xs[root[v]];\n  });\n\n  return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  var blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  _.forEach(layering, function(layer) {\n    var u;\n    _.forEach(layer, function(v) {\n      var vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return _.minBy(_.values(xss), function (xs) {\n    var max = Number.NEGATIVE_INFINITY;\n    var min = Number.POSITIVE_INFINITY;\n\n    _.forIn(xs, function (x, v) {\n      var halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    return max - min;\n  });\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  var alignToVals = _.values(alignTo),\n    alignToMin = _.min(alignToVals),\n    alignToMax = _.max(alignToVals);\n\n  _.forEach([\"u\", \"d\"], function(vert) {\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      var alignment = vert + horiz,\n        xs = xss[alignment],\n        delta;\n      if (xs === alignTo) return;\n\n      var xsVals = _.values(xs);\n      delta = horiz === \"l\" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n      if (delta) {\n        xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return _.mapValues(xss.ul, function(ignore, v) {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      var xs = _.sortBy(_.map(xss, v));\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  var layering = util.buildLayerMatrix(g);\n  var conflicts = _.merge(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering));\n\n  var xss = {};\n  var adjustedLayering;\n  _.forEach([\"u\", \"d\"], function(vert) {\n    adjustedLayering = vert === \"u\" ? layering : _.values(layering).reverse();\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      if (horiz === \"r\") {\n        adjustedLayering = _.map(adjustedLayering, function(inner) {\n          return _.values(inner).reverse();\n        });\n      }\n\n      var neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      var xs = horizontalCompaction(g, adjustedLayering,\n        align.root, align.align, horiz === \"r\");\n      if (horiz === \"r\") {\n        xs = _.mapValues(xs, function(x) { return -x; });\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n  var smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return function(g, v, w) {\n    var vLabel = g.node(v);\n    var wLabel = g.node(w);\n    var sum = 0;\n    var delta;\n\n    sum += vLabel.width / 2;\n    if (_.has(vLabel, \"labelpos\")) {\n      switch (vLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = -vLabel.width / 2; break;\n      case \"r\": delta = vLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (_.has(wLabel, \"labelpos\")) {\n      switch (wLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = wLabel.width / 2; break;\n      case \"r\": delta = -wLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAEA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,CAA+B,OAC/B,IAAA,GAAA;AAOJ,GAAO,UAAU;EACJ;EACS;EACA;EACP;EACA;EACM;EACG;EACJ;EACU;EACnB;EACV;CAmBD,SAAS,EAAmB,GAAG,GAAU;EACvC,IAAI,IAAY,EAAE;EAElB,SAAS,EAAW,GAAW,GAAO;GACpC,IAGE,IAAK,GAGL,IAAU,GACV,IAAkB,EAAU,QAC5B,IAAW,EAAE,KAAK,EAAM;AAsB1B,UApBA,EAAE,QAAQ,GAAO,SAAS,GAAG,GAAG;IAC9B,IAAI,IAAI,EAA0B,GAAG,EAAE,EACrC,IAAK,IAAI,EAAE,KAAK,EAAE,CAAC,QAAQ;AAE7B,KAAI,KAAK,MAAM,OACb,EAAE,QAAQ,EAAM,MAAM,GAAS,IAAG,EAAE,EAAE,SAAS,GAAU;AACvD,OAAE,QAAQ,EAAE,aAAa,EAAS,EAAE,SAAS,GAAG;MAC9C,IAAI,IAAS,EAAE,KAAK,EAAE,EACpB,IAAO,EAAO;AAChB,OAAK,IAAO,KAAM,IAAK,MACnB,EAAE,EAAO,SAAS,EAAE,KAAK,EAAS,CAAC,UACrC,EAAY,GAAW,GAAG,EAAS;OAErC;MACF,EACF,IAAU,IAAI,GACd,IAAK;KAEP,EAEK;;AAIT,SADA,EAAE,OAAO,GAAU,EAAW,EACvB;;CAGT,SAAS,EAAmB,GAAG,GAAU;EACvC,IAAI,IAAY,EAAE;EAElB,SAAS,EAAK,GAAO,GAAU,GAAU,GAAiB,GAAiB;GACzE,IAAI;AACJ,KAAE,QAAQ,EAAE,MAAM,GAAU,EAAS,EAAE,SAAS,GAAG;AAEjD,IADA,IAAI,EAAM,IACN,EAAE,KAAK,EAAE,CAAC,SACZ,EAAE,QAAQ,EAAE,aAAa,EAAE,EAAE,SAAS,GAAG;KACvC,IAAI,IAAQ,EAAE,KAAK,EAAE;AACrB,KAAI,EAAM,UACL,EAAM,QAAQ,KAAmB,EAAM,QAAQ,MAClD,EAAY,GAAW,GAAG,EAAE;MAE9B;KAEJ;;EAIJ,SAAS,EAAW,GAAO,GAAO;GAChC,IAAI,IAAe,IACjB,GACA,IAAW;AAeb,UAbA,EAAE,QAAQ,GAAO,SAAS,GAAG,GAAgB;AAC3C,QAAI,EAAE,KAAK,EAAE,CAAC,UAAU,UAAU;KAChC,IAAI,IAAe,EAAE,aAAa,EAAE;AACpC,KAAI,EAAa,WACf,IAAe,EAAE,KAAK,EAAa,GAAG,CAAC,OACvC,EAAK,GAAO,GAAU,GAAgB,GAAc,EAAa,EACjE,IAAW,GACX,IAAe;;AAGnB,MAAK,GAAO,GAAU,EAAM,QAAQ,GAAc,EAAM,OAAO;KAC/D,EAEK;;AAIT,SADA,EAAE,OAAO,GAAU,EAAW,EACvB;;CAGT,SAAS,EAA0B,GAAG,GAAG;AACvC,MAAI,EAAE,KAAK,EAAE,CAAC,MACZ,QAAO,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,SAAS,GAAG;AAC3C,UAAO,EAAE,KAAK,EAAE,CAAC;IACjB;;CAIN,SAAS,EAAY,GAAW,GAAG,GAAG;AACpC,MAAI,IAAI,GAAG;GACT,IAAI,IAAM;AAEV,GADA,IAAI,GACJ,IAAI;;EAGN,IAAI,IAAa,EAAU;AAI3B,EAHK,MACH,EAAU,KAAK,IAAa,EAAE,GAEhC,EAAW,KAAK;;CAGlB,SAAS,EAAY,GAAW,GAAG,GAAG;AACpC,MAAI,IAAI,GAAG;GACT,IAAI,IAAM;AAEV,GADA,IAAI,GACJ,IAAI;;AAEN,SAAO,EAAE,IAAI,EAAU,IAAI,EAAE;;CAW/B,SAAS,EAAkB,GAAG,GAAU,GAAW,GAAY;EAC7D,IAAI,IAAO,EAAE,EACX,IAAQ,EAAE,EACV,IAAM,EAAE;AAkCV,SA7BA,EAAE,QAAQ,GAAU,SAAS,GAAO;AAClC,KAAE,QAAQ,GAAO,SAAS,GAAG,GAAO;AAGlC,IAFA,EAAK,KAAK,GACV,EAAM,KAAK,GACX,EAAI,KAAK;KACT;IACF,EAEF,EAAE,QAAQ,GAAU,SAAS,GAAO;GAClC,IAAI,IAAU;AACd,KAAE,QAAQ,GAAO,SAAS,GAAG;IAC3B,IAAI,IAAK,EAAW,EAAE;AACtB,QAAI,EAAG,QAAQ;AACb,SAAK,EAAE,OAAO,GAAI,SAAS,GAAG;AAAE,aAAO,EAAI;OAAM;AAEjD,UAAK,IADD,KAAM,EAAG,SAAS,KAAK,GAClB,IAAI,KAAK,MAAM,EAAG,EAAE,IAAK,KAAK,KAAK,EAAG,EAAE,KAAK,GAAI,EAAE,GAAG;MAC7D,IAAI,IAAI,EAAG;AACX,MAAI,EAAM,OAAO,KACb,IAAU,EAAI,MACd,CAAC,EAAY,GAAW,GAAG,EAAE,KAC/B,EAAM,KAAK,GACX,EAAM,KAAK,EAAK,KAAK,EAAK,IAC1B,IAAU,EAAI;;;KAIpB;IACF,EAEK;GAAQ;GAAa;GAAO;;CAGrC,SAAS,EAAqB,GAAG,GAAU,GAAM,GAAO,GAAY;EAMlE,IAAI,IAAK,EAAE,EACT,IAAS,EAAgB,GAAG,GAAU,GAAM,EAAW,EACvD,IAAa,IAAa,eAAe;EAE3C,SAAS,EAAQ,GAAW,GAAe;AAIzC,QAHA,IAAI,IAAQ,EAAO,OAAO,EACtB,IAAO,EAAM,KAAK,EAClB,IAAU,EAAE,EACT,GASL,CARI,EAAQ,KACV,EAAU,EAAK,IAEf,EAAQ,KAAQ,IAChB,EAAM,KAAK,EAAK,EAChB,IAAQ,EAAM,OAAO,EAAc,EAAK,CAAC,GAG3C,IAAO,EAAM,KAAK;;EAKtB,SAAS,EAAM,GAAM;AACnB,KAAG,KAAQ,EAAO,QAAQ,EAAK,CAAC,OAAO,SAAS,GAAK,GAAG;AACtD,WAAO,KAAK,IAAI,GAAK,EAAG,EAAE,KAAK,EAAO,KAAK,EAAE,CAAC;MAC7C,EAAE;;EAIP,SAAS,EAAM,GAAM;GACnB,IAAI,IAAM,EAAO,SAAS,EAAK,CAAC,OAAO,SAAS,GAAK,GAAG;AACtD,WAAO,KAAK,IAAI,GAAK,EAAG,EAAE,KAAK,EAAO,KAAK,EAAE,CAAC;MAC7C,SAAyB,EAExB,IAAO,EAAE,KAAK,EAAK;AACvB,GAAI,MAAQ,YAA4B,EAAK,eAAe,MAC1D,EAAG,KAAQ,KAAK,IAAI,EAAG,IAAO,EAAI;;AAYtC,SARA,EAAQ,GAAO,EAAO,aAAa,KAAK,EAAO,CAAC,EAChD,EAAQ,GAAO,EAAO,WAAW,KAAK,EAAO,CAAC,EAG9C,EAAE,QAAQ,GAAO,SAAS,GAAG;AAC3B,KAAG,KAAK,EAAG,EAAK;IAChB,EAEK;;CAIT,SAAS,EAAgB,GAAG,GAAU,GAAM,GAAY;EACtD,IAAI,IAAa,IAAI,GAAO,EAC1B,IAAa,EAAE,OAAO,EACtB,IAAQ,EAAI,EAAW,SAAS,EAAW,SAAS,EAAW;AAgBjE,SAdA,EAAE,QAAQ,GAAU,SAAS,GAAO;GAClC,IAAI;AACJ,KAAE,QAAQ,GAAO,SAAS,GAAG;IAC3B,IAAI,IAAQ,EAAK;AAEjB,QADA,EAAW,QAAQ,EAAM,EACrB,GAAG;KACL,IAAI,IAAQ,EAAK,IACf,IAAU,EAAW,KAAK,GAAO,EAAM;AACzC,OAAW,QAAQ,GAAO,GAAO,KAAK,IAAI,EAAM,GAAG,GAAG,EAAE,EAAE,KAAW,EAAE,CAAC;;AAE1E,QAAI;KACJ;IACF,EAEK;;CAMT,SAAS,EAA2B,GAAG,GAAK;AAC1C,SAAO,EAAE,MAAM,EAAE,OAAO,EAAI,EAAE,SAAU,GAAI;GAC1C,IAAI,IAAM,WACN,IAAM;AASV,UAPA,EAAE,MAAM,GAAI,SAAU,GAAG,GAAG;IAC1B,IAAI,IAAY,EAAM,GAAG,EAAE,GAAG;AAG9B,IADA,IAAM,KAAK,IAAI,IAAI,GAAW,EAAI,EAClC,IAAM,KAAK,IAAI,IAAI,GAAW,EAAI;KAClC,EAEK,IAAM;IACb;;CAUJ,SAAS,EAAiB,GAAK,GAAS;EACtC,IAAI,IAAc,EAAE,OAAO,EAAQ,EACjC,IAAa,EAAE,IAAI,EAAY,EAC/B,IAAa,EAAE,IAAI,EAAY;AAEjC,IAAE,QAAQ,CAAC,KAAK,IAAI,EAAE,SAAS,GAAM;AACnC,KAAE,QAAQ,CAAC,KAAK,IAAI,EAAE,SAAS,GAAO;IACpC,IAAI,IAAY,IAAO,GACrB,IAAK,EAAI,IACT;AACE,cAAO,GAEX;SAAI,IAAS,EAAE,OAAO,EAAG;AAGzB,KAFA,IAAQ,MAAU,MAAM,IAAa,EAAE,IAAI,EAAO,GAAG,IAAa,EAAE,IAAI,EAAO,EAE3E,MACF,EAAI,KAAa,EAAE,UAAU,GAAI,SAAS,GAAG;AAAE,aAAO,IAAI;OAAS;;KAErE;IACF;;CAGJ,SAAS,EAAQ,GAAK,GAAO;AAC3B,SAAO,EAAE,UAAU,EAAI,IAAI,SAAS,GAAQ,GAAG;AAC7C,OAAI,EACF,QAAO,EAAI,EAAM,aAAa,EAAE;GAEhC,IAAI,IAAK,EAAE,OAAO,EAAE,IAAI,GAAK,EAAE,CAAC;AAChC,WAAQ,EAAG,KAAK,EAAG,MAAM;IAE3B;;CAGJ,SAAS,EAAU,GAAG;EACpB,IAAI,IAAW,EAAK,iBAAiB,EAAE,EACnC,IAAY,EAAE,MAChB,EAAmB,GAAG,EAAS,EAC/B,EAAmB,GAAG,EAAS,CAAC,EAE9B,IAAM,EAAE,EACR;AAuBJ,SAtBA,EAAE,QAAQ,CAAC,KAAK,IAAI,EAAE,SAAS,GAAM;AAEnC,GADA,IAAmB,MAAS,MAAM,IAAW,EAAE,OAAO,EAAS,CAAC,SAAS,EACzE,EAAE,QAAQ,CAAC,KAAK,IAAI,EAAE,SAAS,GAAO;AACpC,IAAI,MAAU,QACZ,IAAmB,EAAE,IAAI,GAAkB,SAAS,GAAO;AACzD,YAAO,EAAE,OAAO,EAAM,CAAC,SAAS;MAChC;IAGJ,IAAI,KAAc,MAAS,MAAM,EAAE,eAAe,EAAE,YAAY,KAAK,EAAE,EACnE,IAAQ,EAAkB,GAAG,GAAkB,GAAW,EAAW,EACrE,IAAK,EAAqB,GAAG,GAC/B,EAAM,MAAM,EAAM,OAAO,MAAU,IAAI;AAIzC,IAHI,MAAU,QACZ,IAAK,EAAE,UAAU,GAAI,SAAS,GAAG;AAAE,YAAO,CAAC;MAAK,GAElD,EAAI,IAAO,KAAS;KACpB;IACF,EAGF,EAAiB,GADG,EAA2B,GAAG,EAAI,CAClB,EAC7B,EAAQ,GAAK,EAAE,OAAO,CAAC,MAAM;;CAGtC,SAAS,EAAI,GAAS,GAAS,GAAY;AACzC,SAAO,SAAS,GAAG,GAAG,GAAG;GACvB,IAAI,IAAS,EAAE,KAAK,EAAE,EAClB,IAAS,EAAE,KAAK,EAAE,EAClB,IAAM,GACN;AAGJ,OADA,KAAO,EAAO,QAAQ,GAClB,EAAE,IAAI,GAAQ,WAAW,CAC3B,SAAQ,EAAO,SAAS,aAAa,EAArC;IACA,KAAK;AAAK,SAAQ,CAAC,EAAO,QAAQ;AAAG;IACrC,KAAK;AAAK,SAAQ,EAAO,QAAQ;AAAG;;AAYtC,OATI,MACF,KAAO,IAAa,IAAQ,CAAC,IAE/B,IAAQ,GAER,MAAQ,EAAO,QAAQ,IAAU,KAAW,GAC5C,MAAQ,EAAO,QAAQ,IAAU,KAAW,GAE5C,KAAO,EAAO,QAAQ,GAClB,EAAE,IAAI,GAAQ,WAAW,CAC3B,SAAQ,EAAO,SAAS,aAAa,EAArC;IACA,KAAK;AAAK,SAAQ,EAAO,QAAQ;AAAG;IACpC,KAAK;AAAK,SAAQ,CAAC,EAAO,QAAQ;AAAG;;AAQvC,UALI,MACF,KAAO,IAAa,IAAQ,CAAC,IAE/B,IAAQ,GAED;;;CAIX,SAAS,EAAM,GAAG,GAAG;AACnB,SAAO,EAAE,KAAK,EAAE,CAAC"}

package/dist/node_modules/dagre/lib/position/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../../../node_modules/dagre/lib/position/index.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar util = require(\"../util\");\nvar positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  _.forEach(positionX(g), function(x, v) {\n    g.node(v).x = x;\n  });\n}\n\nfunction positionY(g) {\n  var layering = util.buildLayerMatrix(g);\n  var rankSep = g.graph().ranksep;\n  var prevY = 0;\n  _.forEach(layering, function(layer) {\n    var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));\n    _.forEach(layer, function(v) {\n      g.node(v).y = prevY + maxHeight / 2;\n    });\n    prevY += maxHeight + rankSep;\n  });\n}\n\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAEA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,CAA4B;AAEhC,GAAO,UAAU;CAEjB,SAAS,EAAS,GAAG;AAInB,EAHA,IAAI,EAAK,mBAAmB,EAAE,EAE9B,EAAU,EAAE,EACZ,EAAE,QAAQ,EAAU,EAAE,EAAE,SAAS,GAAG,GAAG;AACrC,KAAE,KAAK,EAAE,CAAC,IAAI;IACd;;CAGJ,SAAS,EAAU,GAAG;EACpB,IAAI,IAAW,EAAK,iBAAiB,EAAE,EACnC,IAAU,EAAE,OAAO,CAAC,SACpB,IAAQ;AACZ,IAAE,QAAQ,GAAU,SAAS,GAAO;GAClC,IAAI,IAAY,EAAE,IAAI,EAAE,IAAI,GAAO,SAAS,GAAG;AAAE,WAAO,EAAE,KAAK,EAAE,CAAC;KAAU,CAAC;AAI7E,GAHA,EAAE,QAAQ,GAAO,SAAS,GAAG;AAC3B,MAAE,KAAK,EAAE,CAAC,IAAI,IAAQ,IAAY;KAClC,EACF,KAAS,IAAY;IACrB"}

package/dist/node_modules/dagre/lib/rank/feasible-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"feasible-tree.js","names":[],"sources":["../../../../../node_modules/dagre/lib/rank/feasible-tree.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    _.forEach(g.nodeEdges(v), function(e) {\n      var edgeV = e.v,\n        w = (v === edgeV) ? e.w : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  _.forEach(t.nodes(), dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  return _.minBy(g.edges(), function(e) {\n    if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n      return slack(g, e);\n    }\n  });\n}\n\nfunction shiftRanks(t, g, delta) {\n  _.forEach(t.nodes(), function(v) {\n    g.node(v).rank += delta;\n  });\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAEA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,CAA+B,OAC/B,IAAA,GAAA,CAA0B;AAE9B,GAAO,UAAU;CA2BjB,SAAS,EAAa,GAAG;EACvB,IAAI,IAAI,IAAI,EAAM,EAAE,UAAU,IAAO,CAAC,EAGlC,IAAQ,EAAE,OAAO,CAAC,IAClB,IAAO,EAAE,WAAW;AACxB,IAAE,QAAQ,GAAO,EAAE,CAAC;AAGpB,OADA,IAAI,GAAM,GACH,EAAU,GAAG,EAAE,GAAG,GAGvB,CAFA,IAAO,EAAiB,GAAG,EAAE,EAC7B,IAAQ,EAAE,QAAQ,EAAK,EAAE,GAAG,EAAM,GAAG,EAAK,GAAG,CAAC,EAAM,GAAG,EAAK,EAC5D,EAAW,GAAG,GAAG,EAAM;AAGzB,SAAO;;CAOT,SAAS,EAAU,GAAG,GAAG;EACvB,SAAS,EAAI,GAAG;AACd,KAAE,QAAQ,EAAE,UAAU,EAAE,EAAE,SAAS,GAAG;IACpC,IAAI,IAAQ,EAAE,GACZ,IAAK,MAAM,IAAS,EAAE,IAAI;AAC5B,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAM,GAAG,EAAE,KAC/B,EAAE,QAAQ,GAAG,EAAE,CAAC,EAChB,EAAE,QAAQ,GAAG,GAAG,EAAE,CAAC,EACnB,EAAI,EAAE;KAER;;AAIJ,SADA,EAAE,QAAQ,EAAE,OAAO,EAAE,EAAI,EAClB,EAAE,WAAW;;CAOtB,SAAS,EAAiB,GAAG,GAAG;AAC9B,SAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,GAAG;AACpC,OAAI,EAAE,QAAQ,EAAE,EAAE,KAAK,EAAE,QAAQ,EAAE,EAAE,CACnC,QAAO,EAAM,GAAG,EAAE;IAEpB;;CAGJ,SAAS,EAAW,GAAG,GAAG,GAAO;AAC/B,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,KAAE,KAAK,EAAE,CAAC,QAAQ;IAClB"}

package/dist/node_modules/dagre/lib/rank/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../../../node_modules/dagre/lib/rank/index.js"],"sourcesContent":["\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  switch(g.graph().ranker) {\n  case \"network-simplex\": networkSimplexRanker(g); break;\n  case \"tight-tree\": tightTreeRanker(g); break;\n  case \"longest-path\": longestPathRanker(g); break;\n  default: networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n  longestPath(g);\n  feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n  networkSimplex(g);\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAGA,IAAI,IAAA,GAAA,CAAuB,aACvB,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;CAqBjB,SAAS,EAAK,GAAG;AACf,UAAO,EAAE,OAAO,CAAC,QAAjB;GACA,KAAK;AAAmB,MAAqB,EAAE;AAAE;GACjD,KAAK;AAAc,MAAgB,EAAE;AAAE;GACvC,KAAK;AAAgB,MAAkB,EAAE;AAAE;GAC3C,QAAS,GAAqB,EAAE;;;CAKlC,IAAI,IAAoB;CAExB,SAAS,EAAgB,GAAG;AAE1B,EADA,EAAY,EAAE,EACd,EAAa,EAAE;;CAGjB,SAAS,EAAqB,GAAG;AAC/B,IAAe,EAAE"}

package/dist/node_modules/dagre/lib/rank/network-simplex.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"network-simplex.js","names":[],"sources":["../../../../../node_modules/dagre/lib/rank/network-simplex.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"../graphlib\").alg.preorder;\nvar postorder = require(\"../graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = simplify(g);\n  initRank(g);\n  var t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  _.forEach(vs, function(v) {\n    assignCutValue(t, g, v);\n  });\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  _.forEach(g.nodeEdges(child), function(e) {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  _.forEach(tree.neighbors(v), function(w) {\n    if (!_.has(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return _.find(tree.edges(), function(e) {\n    return tree.edge(e).cutvalue < 0;\n  });\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = _.filter(g.edges(), function(edge) {\n    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n  });\n\n  return _.minBy(candidates, function(edge) { return slack(g, edge); });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });\n  var vs = preorder(t, root);\n  vs = vs.slice(1);\n  _.forEach(vs, function(v) {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;CAEA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,CAA0B,OAC1B,IAAA,GAAA,CAA6B,aAC7B,IAAA,GAAA,CAAkC,IAAI,UACtC,IAAA,GAAA,CAAmC,IAAI,WACvC,IAAA,GAAA,CAA8B;AAUlC,CARA,EAAO,UAAU,GAGjB,EAAe,mBAAmB,GAClC,EAAe,gBAAgB,GAC/B,EAAe,eAAe,GAC9B,EAAe,YAAY,GAC3B,EAAe,YAAY,GAC3B,EAAe,gBAAgB;CAmC/B,SAAS,EAAe,GAAG;AAEzB,EADA,IAAI,EAAS,EAAE,EACf,EAAS,EAAE;EACX,IAAI,IAAI,EAAa,EAAE;AAEvB,EADA,EAAiB,EAAE,EACnB,EAAc,GAAG,EAAE;AAGnB,OADA,IAAI,GAAG,GACC,IAAI,EAAU,EAAE,EAEtB,CADA,IAAI,EAAU,GAAG,GAAG,EAAE,EACtB,EAAc,GAAG,GAAG,GAAG,EAAE;;CAO7B,SAAS,EAAc,GAAG,GAAG;EAC3B,IAAI,IAAK,EAAU,GAAG,EAAE,OAAO,CAAC;AAEhC,EADA,IAAK,EAAG,MAAM,GAAG,EAAG,SAAS,EAAE,EAC/B,EAAE,QAAQ,GAAI,SAAS,GAAG;AACxB,KAAe,GAAG,GAAG,EAAE;IACvB;;CAGJ,SAAS,EAAe,GAAG,GAAG,GAAO;EAEnC,IAAI,IADW,EAAE,KAAK,EAAM,CACN;AACtB,IAAE,KAAK,GAAO,EAAO,CAAC,WAAW,EAAa,GAAG,GAAG,EAAM;;CAO5D,SAAS,EAAa,GAAG,GAAG,GAAO;EAEjC,IAAI,IADW,EAAE,KAAK,EAAM,CACN,QAElB,IAAc,IAEd,IAAY,EAAE,KAAK,GAAO,EAAO,EAEjC,IAAW;AAyBf,SAvBA,AAEE,OADA,IAAc,IACF,EAAE,KAAK,GAAQ,EAAM,GAGnC,IAAW,EAAU,QAErB,EAAE,QAAQ,EAAE,UAAU,EAAM,EAAE,SAAS,GAAG;GACxC,IAAI,IAAY,EAAE,MAAM,GACtB,IAAQ,IAAY,EAAE,IAAI,EAAE;AAE9B,OAAI,MAAU,GAAQ;IACpB,IAAI,IAAe,MAAc,GAC/B,IAAc,EAAE,KAAK,EAAE,CAAC;AAG1B,QADA,KAAY,IAAe,IAAc,CAAC,GACtC,EAAW,GAAG,GAAO,EAAM,EAAE;KAC/B,IAAI,IAAgB,EAAE,KAAK,GAAO,EAAM,CAAC;AACzC,UAAY,IAAe,CAAC,IAAgB;;;IAGhD,EAEK;;CAGT,SAAS,EAAiB,GAAM,GAAM;AAIpC,EAHI,UAAU,SAAS,MACrB,IAAO,EAAK,OAAO,CAAC,KAEtB,EAAgB,GAAM,EAAE,EAAE,GAAG,EAAK;;CAGpC,SAAS,EAAgB,GAAM,GAAS,GAAS,GAAG,GAAQ;EAC1D,IAAI,IAAM,GACN,IAAQ,EAAK,KAAK,EAAE;AAkBxB,SAhBA,EAAQ,KAAK,IACb,EAAE,QAAQ,EAAK,UAAU,EAAE,EAAE,SAAS,GAAG;AACvC,GAAK,EAAE,IAAI,GAAS,EAAE,KACpB,IAAU,EAAgB,GAAM,GAAS,GAAS,GAAG,EAAE;IAEzD,EAEF,EAAM,MAAM,GACZ,EAAM,MAAM,KACR,IACF,EAAM,SAAS,IAGf,OAAO,EAAM,QAGR;;CAGT,SAAS,EAAU,GAAM;AACvB,SAAO,EAAE,KAAK,EAAK,OAAO,EAAE,SAAS,GAAG;AACtC,UAAO,EAAK,KAAK,EAAE,CAAC,WAAW;IAC/B;;CAGJ,SAAS,EAAU,GAAG,GAAG,GAAM;EAC7B,IAAI,IAAI,EAAK,GACT,IAAI,EAAK;AAKb,EAAK,EAAE,QAAQ,GAAG,EAAE,KAClB,IAAI,EAAK,GACT,IAAI,EAAK;EAGX,IAAI,IAAS,EAAE,KAAK,EAAE,EAClB,IAAS,EAAE,KAAK,EAAE,EAClB,IAAY,GACZ,IAAO;AAIX,EAAI,EAAO,MAAM,EAAO,QACtB,IAAY,GACZ,IAAO;EAGT,IAAI,IAAa,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,GAAM;AAClD,UAAO,MAAS,EAAa,GAAG,EAAE,KAAK,EAAK,EAAE,EAAE,EAAU,IACnD,MAAS,EAAa,GAAG,EAAE,KAAK,EAAK,EAAE,EAAE,EAAU;IAC1D;AAEF,SAAO,EAAE,MAAM,GAAY,SAAS,GAAM;AAAE,UAAO,EAAM,GAAG,EAAK;IAAI;;CAGvE,SAAS,EAAc,GAAG,GAAG,GAAG,GAAG;EACjC,IAAI,IAAI,EAAE,GACN,IAAI,EAAE;AAKV,EAJA,EAAE,WAAW,GAAG,EAAE,EAClB,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EACvB,EAAiB,EAAE,EACnB,EAAc,GAAG,EAAE,EACnB,EAAY,GAAG,EAAE;;CAGnB,SAAS,EAAY,GAAG,GAAG;EAEzB,IAAI,IAAK,EAAS,GADP,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,UAAO,CAAC,EAAE,KAAK,EAAE,CAAC;IAAU,CAC7C;AAE1B,EADA,IAAK,EAAG,MAAM,EAAE,EAChB,EAAE,QAAQ,GAAI,SAAS,GAAG;GACxB,IAAI,IAAS,EAAE,KAAK,EAAE,CAAC,QACrB,IAAO,EAAE,KAAK,GAAG,EAAO,EACxB,IAAU;AAOZ,GALK,MACH,IAAO,EAAE,KAAK,GAAQ,EAAE,EACxB,IAAU,KAGZ,EAAE,KAAK,EAAE,CAAC,OAAO,EAAE,KAAK,EAAO,CAAC,QAAQ,IAAU,EAAK,SAAS,CAAC,EAAK;IACtE;;CAMJ,SAAS,EAAW,GAAM,GAAG,GAAG;AAC9B,SAAO,EAAK,QAAQ,GAAG,EAAE;;CAO3B,SAAS,EAAa,GAAM,GAAQ,GAAW;AAC7C,SAAO,EAAU,OAAO,EAAO,OAAO,EAAO,OAAO,EAAU"}

package/dist/node_modules/dagre/lib/rank/util.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"util.js","names":[],"sources":["../../../../../node_modules/dagre/lib/rank/util.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = {\n  longestPath: longestPath,\n  slack: slack\n};\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (_.has(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    var rank = _.min(_.map(g.outEdges(v), function(e) {\n      return dfs(e.w) - g.edge(e).minlen;\n    }));\n\n    if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n        rank === undefined || // return value of _.map([]) for Lodash 4\n        rank === null) { // return value of _.map([null])\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  _.forEach(g.sources(), dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAEA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;EACF;EACN;EACR;CAuBD,SAAS,EAAY,GAAG;EACtB,IAAI,IAAU,EAAE;EAEhB,SAAS,EAAI,GAAG;GACd,IAAI,IAAQ,EAAE,KAAK,EAAE;AACrB,OAAI,EAAE,IAAI,GAAS,EAAE,CACnB,QAAO,EAAM;AAEf,KAAQ,KAAK;GAEb,IAAI,IAAO,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG;AAChD,WAAO,EAAI,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;KAC5B,CAAC;AAQH,WANI,MAAS,YACT,KACS,UACX,IAAO,IAGD,EAAM,OAAO;;AAGvB,IAAE,QAAQ,EAAE,SAAS,EAAE,EAAI;;CAO7B,SAAS,EAAM,GAAG,GAAG;AACnB,SAAO,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC"}

package/dist/node_modules/dagre/lib/util.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"util.js","names":[],"sources":["../../../../node_modules/dagre/lib/util.js"],"sourcesContent":["/* eslint \"no-console\": off */\n\n\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  addDummyNode: addDummyNode,\n  simplify: simplify,\n  asNonCompoundGraph: asNonCompoundGraph,\n  successorWeights: successorWeights,\n  predecessorWeights: predecessorWeights,\n  intersectRect: intersectRect,\n  buildLayerMatrix: buildLayerMatrix,\n  normalizeRanks: normalizeRanks,\n  removeEmptyRanks: removeEmptyRanks,\n  addBorderNode: addBorderNode,\n  maxRank: maxRank,\n  partition: partition,\n  time: time,\n  notime: notime\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v;\n  do {\n    v = _.uniqueId(name);\n  } while (g.hasNode(v));\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  var simplified = new Graph().setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    var label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen)\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  _.forEach(g.edges(), function(e) {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var sucs = {};\n    _.forEach(g.outEdges(v), function(e) {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var preds = {};\n    _.forEach(g.inEdges(v), function(e) {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  var x = rect.x;\n  var y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  var dx = point.x - x;\n  var dy = point.y - y;\n  var w = rect.width / 2;\n  var h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n  }\n\n  var sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = h * dx / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = w * dy / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    var rank = node.rank;\n    if (!_.isUndefined(rank)) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (_.has(node, \"rank\")) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\n  var layers = [];\n  _.forEach(g.nodes(), function(v) {\n    var rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  var delta = 0;\n  var nodeRankFactor = g.graph().nodeRankFactor;\n  _.forEach(layers, function(vs, i) {\n    if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (delta) {\n      _.forEach(vs, function(v) { g.node(v).rank += delta; });\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  var node = {\n    width: 0,\n    height: 0\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction maxRank(g) {\n  return _.max(_.map(g.nodes(), function(v) {\n    var rank = g.node(v).rank;\n    if (!_.isUndefined(rank)) {\n      return rank;\n    }\n  }));\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  var result = { lhs: [], rhs: [] };\n  _.forEach(collection, function(value) {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  var start = _.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (_.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAIA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,CAA8B;AAElC,GAAO,UAAU;EACD;EACJ;EACU;EACF;EACE;EACL;EACG;EACF;EACE;EACH;EACN;EACE;EACL;EACE;EACT;CAKD,SAAS,EAAa,GAAG,GAAM,GAAO,GAAM;EAC1C,IAAI;AACJ;AACE,OAAI,EAAE,SAAS,EAAK;SACb,EAAE,QAAQ,EAAE;AAIrB,SAFA,EAAM,QAAQ,GACd,EAAE,QAAQ,GAAG,EAAM,EACZ;;CAOT,SAAS,EAAS,GAAG;EACnB,IAAI,IAAa,IAAI,GAAO,CAAC,SAAS,EAAE,OAAO,CAAC;AAUhD,SATA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,KAAW,QAAQ,GAAG,EAAE,KAAK,EAAE,CAAC;IAAI,EACvE,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAc,EAAW,KAAK,EAAE,GAAG,EAAE,EAAE,IAAI;IAAE,QAAQ;IAAG,QAAQ;IAAG,EACnE,IAAQ,EAAE,KAAK,EAAE;AACrB,KAAW,QAAQ,EAAE,GAAG,EAAE,GAAG;IAC3B,QAAQ,EAAY,SAAS,EAAM;IACnC,QAAQ,KAAK,IAAI,EAAY,QAAQ,EAAM,OAAO;IACnD,CAAC;IACF,EACK;;CAGT,SAAS,EAAmB,GAAG;EAC7B,IAAI,IAAa,IAAI,EAAM,EAAE,YAAY,EAAE,cAAc,EAAE,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC;AAShF,SARA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,GAAK,EAAE,SAAS,EAAE,CAAC,UACjB,EAAW,QAAQ,GAAG,EAAE,KAAK,EAAE,CAAC;IAElC,EACF,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;AAC/B,KAAW,QAAQ,GAAG,EAAE,KAAK,EAAE,CAAC;IAChC,EACK;;CAGT,SAAS,EAAiB,GAAG;EAC3B,IAAI,IAAY,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,GAAG;GAC3C,IAAI,IAAO,EAAE;AAIb,UAHA,EAAE,QAAQ,EAAE,SAAS,EAAE,EAAE,SAAS,GAAG;AACnC,MAAK,EAAE,MAAM,EAAK,EAAE,MAAM,KAAK,EAAE,KAAK,EAAE,CAAC;KACzC,EACK;IACP;AACF,SAAO,EAAE,UAAU,EAAE,OAAO,EAAE,EAAU;;CAG1C,SAAS,EAAmB,GAAG;EAC7B,IAAI,IAAY,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,GAAG;GAC3C,IAAI,IAAQ,EAAE;AAId,UAHA,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAAE,SAAS,GAAG;AAClC,MAAM,EAAE,MAAM,EAAM,EAAE,MAAM,KAAK,EAAE,KAAK,EAAE,CAAC;KAC3C,EACK;IACP;AACF,SAAO,EAAE,UAAU,EAAE,OAAO,EAAE,EAAU;;CAO1C,SAAS,EAAc,GAAM,GAAO;EAClC,IAAI,IAAI,EAAK,GACT,IAAI,EAAK,GAIT,IAAK,EAAM,IAAI,GACf,IAAK,EAAM,IAAI,GACf,IAAI,EAAK,QAAQ,GACjB,IAAI,EAAK,SAAS;AAEtB,MAAI,CAAC,KAAM,CAAC,EACV,OAAU,MAAM,4DAA4D;EAG9E,IAAI,GAAI;AAiBR,SAhBI,KAAK,IAAI,EAAG,GAAG,IAAI,KAAK,IAAI,EAAG,GAAG,KAEhC,IAAK,MACP,IAAI,CAAC,IAEP,IAAK,IAAI,IAAK,GACd,IAAK,MAGD,IAAK,MACP,IAAI,CAAC,IAEP,IAAK,GACL,IAAK,IAAI,IAAK,IAGT;GAAE,GAAG,IAAI;GAAI,GAAG,IAAI;GAAI;;CAOjC,SAAS,EAAiB,GAAG;EAC3B,IAAI,IAAW,EAAE,IAAI,EAAE,MAAM,EAAQ,EAAE,GAAG,EAAE,EAAE,WAAW;AAAE,UAAO,EAAE;IAAI;AAQxE,SAPA,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE,EAChB,IAAO,EAAK;AAChB,GAAK,EAAE,YAAY,EAAK,KACtB,EAAS,GAAM,EAAK,SAAS;IAE/B,EACK;;CAOT,SAAS,EAAe,GAAG;EACzB,IAAI,IAAM,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,UAAO,EAAE,KAAK,EAAE,CAAC;IAAQ,CAAC;AACzE,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE;AACpB,GAAI,EAAE,IAAI,GAAM,OAAO,KACrB,EAAK,QAAQ;IAEf;;CAGJ,SAAS,EAAiB,GAAG;EAE3B,IAAI,IAAS,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,GAAG;AAAE,UAAO,EAAE,KAAK,EAAE,CAAC;IAAQ,CAAC,EAExE,IAAS,EAAE;AACf,IAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,GAAG;GAC/B,IAAI,IAAO,EAAE,KAAK,EAAE,CAAC,OAAO;AAI5B,GAHK,EAAO,OACV,EAAO,KAAQ,EAAE,GAEnB,EAAO,GAAM,KAAK,EAAE;IACpB;EAEF,IAAI,IAAQ,GACR,IAAiB,EAAE,OAAO,CAAC;AAC/B,IAAE,QAAQ,GAAQ,SAAS,GAAI,GAAG;AAChC,GAAI,EAAE,YAAY,EAAG,IAAI,IAAI,MAAmB,IAC9C,EAAE,IACO,KACT,EAAE,QAAQ,GAAI,SAAS,GAAG;AAAE,MAAE,KAAK,EAAE,CAAC,QAAQ;KAAS;IAEzD;;CAGJ,SAAS,EAAc,GAAG,GAAQ,GAAM,GAAO;EAC7C,IAAI,IAAO;GACT,OAAO;GACP,QAAQ;GACT;AAKD,SAJI,UAAU,UAAU,MACtB,EAAK,OAAO,GACZ,EAAK,QAAQ,IAER,EAAa,GAAG,UAAU,GAAM,EAAO;;CAGhD,SAAS,EAAQ,GAAG;AAClB,SAAO,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,GAAG;GACxC,IAAI,IAAO,EAAE,KAAK,EAAE,CAAC;AACrB,OAAI,CAAC,EAAE,YAAY,EAAK,CACtB,QAAO;IAET,CAAC;;CAQL,SAAS,EAAU,GAAY,GAAI;EACjC,IAAI,IAAS;GAAE,KAAK,EAAE;GAAE,KAAK,EAAE;GAAE;AAQjC,SAPA,EAAE,QAAQ,GAAY,SAAS,GAAO;AACpC,GAAI,EAAG,EAAM,GACX,EAAO,IAAI,KAAK,EAAM,GAEtB,EAAO,IAAI,KAAK,EAAM;IAExB,EACK;;CAOT,SAAS,EAAK,GAAM,GAAI;EACtB,IAAI,IAAQ,EAAE,KAAK;AACnB,MAAI;AACF,UAAO,GAAI;YACH;AACR,WAAQ,IAAI,IAAO,aAAa,EAAE,KAAK,GAAG,KAAS,KAAK;;;CAI5D,SAAS,EAAO,GAAM,GAAI;AACxB,SAAO,GAAI"}

package/dist/node_modules/dagre/lib/version.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"version.js","names":[],"sources":["../../../../node_modules/dagre/lib/version.js"],"sourcesContent":["module.exports = \"0.8.5\";\n"],"x_google_ignoreList":[0],"mappings":";;;AAAA,GAAO,UAAU"}