@pie-element/graphing-solution-set 6.1.2-next.1 → 6.1.2

package/lib/utils.js

@@ -0,0 +1,515 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.removeInvalidAnswers = exports.pointInsidePolygon = exports.findSectionsInSolutionSet = exports.checkIfLinesAreAdded = void 0;
+/*
+ * Check if a line is complete
+ * @param {Object} item - mark object
+ * */
+const completeFromTo = item => item && completeMark.point(item.from) && completeMark.point(item.to);
+
+/*
+ * Check if a point is correct and complete
+ * @param {Object} point - point object
+ * */
+const completePoint = point => point && Number.isFinite(point.x) && Number.isFinite(point.y);
+
+/*
+ * Complete mark object for line and point
+ * */
+const completeMark = {
+  line: completeFromTo,
+  point: completePoint
+};
+
+//////////////////////////////////////////////////////////////////////////////////
+// BELOW FUNCTIONS ARE USED IN configure/src/utils as well
+//////////////////////////////////////////////////////////////////////////////////
+
+/*
+ * Function to calculate the distance between two points
+ * @param {Object} a - point a
+ * @param {Object} b - point b
+ * */
+const distance = (a, b) => {
+  return Number(Math.sqrt((a.x - b.x) ** 2 + (a.y - b.y) ** 2).toFixed(3));
+};
+
+/*
+ * Function to check if a point lies on edges of a polygon
+ * @param {Object} point - point object
+ * @param {Array} polygon - polygon points array
+ * */
+const pointInPolygon = (point, polygon) => {
+  let c = point;
+  let inside = false;
+  let clonePolygon = [...polygon];
+  clonePolygon.push(polygon[0]);
+  for (let i = 0; i < clonePolygon.length - 1; i++) {
+    let a = clonePolygon[i];
+    let b = clonePolygon[i + 1];
+    // check if point is on the edge
+    if (distance(a, c) + distance(c, b) === distance(a, b)) {
+      inside = true;
+      break;
+    }
+  }
+  return inside;
+};
+
+/*
+ * Function to get the intersection point of two lines
+ * @param {Number} x1 - x coordinate of point 1 of line 1
+ * @param {Number} y1 - y coordinate of point 1 of line 1
+ * @param {Number} x2 - x coordinate of point 2 of line 1
+ * @param {Number} y2 - y coordinate of point 2 of line 1
+ * @param {Number} x3 - x coordinate of point 1 of line 2
+ * @param {Number} y3 - y coordinate of point 1 of line 2
+ * @param {Number} x4 - x coordinate of point 2 of line 2
+ * @param {Number} y4 - y coordinate of point 2 of line 2
+ * */
+const lineIntersect = (x1, y1, x2, y2, x3, y3, x4, y4) => {
+  let ua,
+    denominator = (y4 - y3) * (x2 - x1) - (x4 - x3) * (y2 - y1);
+  if (denominator === 0) {
+    return null;
+  }
+  ua = ((x4 - x3) * (y1 - y3) - (y4 - y3) * (x1 - x3)) / denominator;
+  return {
+    x: Number((x1 + ua * (x2 - x1)).toFixed(3)),
+    y: Number((y1 + ua * (y2 - y1)).toFixed(3))
+  };
+};
+
+/*
+ * Check if a point is inside the graph
+ * @param {Object} point - point object
+ * @param {Object} domain - domain object
+ * @param {Object} range - range object
+ * */
+const isPointInsideGraph = (point, domain, range) => {
+  return point.x > domain.min && point.x < domain.max && point.y > range.min && point.y < range.max;
+};
+
+/*
+ * Check if a point is on or inside the graph
+ * @param {Object} point - point object
+ * @param {Object} domain - domain object
+ * @param {Object} range - range object
+ * */
+const isPointOnOrInsideGraph = (point, domain, range) => {
+  return point.x >= domain.min && point.x <= domain.max && point.y >= range.min && point.y <= range.max;
+};
+
+/*
+ * Find the intersection point of a mark with the graph
+ * @param {Object} mark - mark object
+ * @param {Object} domain - domain object
+ * @param {Object} range - range object
+ * */
+const findIntersectionPointForMark = (mark, domain, range) => {
+  let intersectionPoint = [];
+  let tempData = [[domain.max, range.max, domain.max, range.min], [domain.min, range.max, domain.min, range.min], [domain.min, range.max, domain.max, range.max], [domain.min, range.min, domain.max, range.min]];
+  for (let i = 0; i < tempData.length; i++) {
+    let intersection = lineIntersect(mark.from.x, mark.from.y, mark.to.x, mark.to.y, tempData[i][0], tempData[i][1], tempData[i][2], tempData[i][3]);
+    if (intersection && isPointOnOrInsideGraph(intersection, domain, range)) {
+      intersectionPoint.push(intersection);
+    }
+  }
+  return intersectionPoint;
+};
+
+/*
+ * Sort points in clockwise direction for a polygon
+ * @param {Array} points - points array
+ * */
+const sortPointsClockWise = points => {
+  // Find min max to get center and Sort from top to bottom
+  points.sort((a, b) => a.y - b.y);
+  // Get center y
+  const cy = (points[0].y + points[points.length - 1].y) / 2;
+  // Sort from right to left
+  points.sort((a, b) => b.x - a.x);
+  // Get center x
+  const cx = (points[0].x + points[points.length - 1].x) / 2;
+  // Center point
+  const center = {
+    x: cx,
+    y: cy
+  };
+  // As the points are sorted from right to left the first point is the rightmost Starting angle used to reference other angles
+  let startAng;
+  points.forEach(point => {
+    let ang = Math.atan2(point.y - center.y, point.x - center.x);
+    if (!startAng) {
+      startAng = ang;
+    } else {
+      if (ang < startAng) {
+        // ensure that all points are clockwise of the start point
+        ang += Math.PI * 2;
+      }
+    }
+    point.angle = ang; // add the angle to the point
+  });
+  // first sort clockwise
+  points.sort((a, b) => a.angle - b.angle);
+  // then reverse the order
+  const ccwPoints = points.reverse();
+  // move the last point back to the start
+  ccwPoints.unshift(ccwPoints.pop());
+  return ccwPoints.map(({
+    angle,
+    ...attr
+  }) => attr);
+};
+
+/*
+ * Function to calculate the dot product of two vectors
+ * @param {Object} v1 - point 1
+ * @param {Object} v2 - point 2
+ * */
+const dotProduct = (v1, v2) => {
+  return v1.x * v2.x + v1.y * v2.y;
+};
+
+/*
+ * Function to calculate the magnitude of a vector
+ * @param {Object} v - point object
+ * */
+const magnitude = v => {
+  return Math.sqrt(v.x * v.x + v.y * v.y);
+};
+
+/*
+ * Function to calculate the angle between two vectors in radians
+ * @param {Object} v1 - point 1
+ * @param {Object} v2 - point 2
+ * */
+const angleBetweenVectors = (v1, v2) => {
+  const dot = dotProduct(v1, v2);
+  const magV1 = magnitude(v1);
+  const magV2 = magnitude(v2);
+  // Ensure the dot product is within the domain of the acos function
+  return Math.acos(dot / (magV1 * magV2));
+};
+
+/*
+ * Function to check if a point lies between the angle formed by two lines
+ * @param {Object} commonPoint - common point of the two lines
+ * @param {Object} point1 - point 1 of cone
+ * @param {Object} point2 - point 2 of cone
+ * @param {Object} testPoint - point to be tested
+ * */
+const pointInAngle = (commonPoint, point1, point2, testPoint) => {
+  const vector1 = {
+    x: point1.x - commonPoint.x,
+    y: point1.y - commonPoint.y
+  };
+  const vector2 = {
+    x: point2.x - commonPoint.x,
+    y: point2.y - commonPoint.y
+  };
+  const testVector = {
+    x: testPoint.x - commonPoint.x,
+    y: testPoint.y - commonPoint.y
+  };
+  const angle1 = angleBetweenVectors(vector1, testVector);
+  const angle2 = angleBetweenVectors(vector2, testVector);
+  const angleSum = angle1 + angle2;
+  // Check if the sum of angles is approximately equal to the angle between the two lines
+  // You may need to adjust the tolerance (e.g., 0.0001) based on your specific requirements
+  const tolerance = 0.0001;
+  return Math.abs(angleSum - angleBetweenVectors(vector1, vector2)) < tolerance;
+};
+
+/*
+ * Function to remove duplicate points from an array
+ * @param {Array} array - array of points
+ * */
+const removeDuplicatesFromArray = array => {
+  return array.filter((obj, index) => {
+    return index === array.findIndex(o => obj.x === o.x && obj.y === o.y);
+  });
+};
+
+/*
+ * Function to remove duplicate points and filter sections
+ * @param {Array} sections - array of sections
+ * */
+const removeDuplicateAndFilterSections = sections => {
+  //removing duplicate points.
+  for (let i = 0; i < sections.length; i++) {
+    sections[i] = sections[i].filter((obj, index) => {
+      return index === sections[i].findIndex(o => obj.x === o.x && obj.y === o.y);
+    });
+  }
+  //removing arrays with two points
+  sections = sections.filter(section => section.length > 2);
+  //sorting the points in clockwise direction
+  for (let i = 0; i < sections.length; i++) {
+    sections[i] = sortPointsClockWise(sections[i]);
+  }
+  return sections;
+};
+
+/*
+ * Function to find sections in solution set for one line
+ * @param {Array} intersectionPoint - intersection point
+ * @param {Object} domain - domain object
+ * @param {Object} range - range object
+ * */
+const findSectionsInSolutionSetForOneLine = (intersectionPoint, domain, range) => {
+  let sections = [];
+  sections.push([].concat(intersectionPoint));
+  sections.push([].concat(intersectionPoint));
+  if (intersectionPoint[0].x === domain.max && intersectionPoint[1].y === range.max || intersectionPoint[1].x === domain.max && intersectionPoint[0].y === range.max) {
+    sections[0].push({
+      x: domain.max,
+      y: range.max
+    });
+    sections[1].push({
+      x: domain.min,
+      y: range.max
+    }, {
+      x: domain.min,
+      y: range.min
+    }, {
+      x: domain.max,
+      y: range.min
+    });
+  } else if (intersectionPoint[0].x === domain.min && intersectionPoint[1].y === range.max || intersectionPoint[1].x === domain.min && intersectionPoint[0].y === range.max) {
+    sections[0].push({
+      x: domain.min,
+      y: range.max
+    });
+    sections[1].push({
+      x: domain.max,
+      y: range.max
+    }, {
+      x: domain.max,
+      y: range.min
+    }, {
+      x: domain.min,
+      y: range.min
+    });
+  } else if (intersectionPoint[0].x === domain.min && intersectionPoint[1].y === range.min || intersectionPoint[1].x === domain.min && intersectionPoint[0].y === range.min) {
+    sections[0].push({
+      x: domain.min,
+      y: range.min
+    });
+    sections[1].push({
+      x: domain.max,
+      y: range.min
+    }, {
+      x: domain.max,
+      y: range.max
+    }, {
+      x: domain.min,
+      y: range.max
+    });
+  } else if (intersectionPoint[0].x === domain.max && intersectionPoint[1].y === range.min || intersectionPoint[1].x === domain.max && intersectionPoint[0].y === range.min) {
+    sections[0].push({
+      x: domain.max,
+      y: range.min
+    });
+    sections[1].push({
+      x: domain.min,
+      y: range.min
+    }, {
+      x: domain.min,
+      y: range.max
+    }, {
+      x: domain.max,
+      y: range.max
+    });
+  } else if (intersectionPoint[0].x === domain.min && intersectionPoint[1].x === domain.max || intersectionPoint[0].x === domain.max && intersectionPoint[1].x === domain.min) {
+    sections[0].push({
+      x: domain.min,
+      y: range.max
+    }, {
+      x: domain.max,
+      y: range.max
+    });
+    sections[1].push({
+      x: domain.min,
+      y: range.min
+    }, {
+      x: domain.max,
+      y: range.min
+    });
+  } else if (intersectionPoint[0].y === range.min && intersectionPoint[1].y === range.max || intersectionPoint[0].y === range.max && intersectionPoint[1].y === range.min) {
+    sections[0].push({
+      x: domain.min,
+      y: range.min
+    }, {
+      x: domain.min,
+      y: range.max
+    });
+    sections[1].push({
+      x: domain.max,
+      y: range.min
+    }, {
+      x: domain.max,
+      y: range.max
+    });
+  }
+  return removeDuplicateAndFilterSections(sections);
+};
+
+/*
+ * Function to find sections in solution set for two lines
+ * @param {Object} gssLineData - graphing solution set line data
+ * @param {Array} answers - answers array
+ * @param {Object} domain - domain object
+ * @param {Object} range - range object
+ * */
+const findSectionsInSolutionSetForTwoLines = (gssLineData, answers, domain, range) => {
+  let mark1 = answers[0];
+  let mark2 = answers[1];
+  let cornerPoints = [{
+    x: domain.min,
+    y: range.min
+  }, {
+    x: domain.min,
+    y: range.max
+  }, {
+    x: domain.max,
+    y: range.min
+  }, {
+    x: domain.max,
+    y: range.max
+  }];
+  let intersectPoint = lineIntersect(mark1.from.x, mark1.from.y, mark1.to.x, mark1.to.y, mark2.from.x, mark2.from.y, mark2.to.x, mark2.to.y);
+  let sections = [];
+  let intersectionPoint1 = findIntersectionPointForMark(mark1, domain, range);
+  intersectionPoint1 = removeDuplicatesFromArray(intersectionPoint1);
+  let intersectionPoint2 = findIntersectionPointForMark(mark2, domain, range);
+  intersectionPoint2 = removeDuplicatesFromArray(intersectionPoint2);
+  if (intersectPoint && isPointInsideGraph(intersectPoint, domain, range)) {
+    for (let i = 0; i < intersectionPoint1.length; i++) {
+      for (let j = 0; j < intersectionPoint2.length; j++) {
+        let bucket = [];
+        let newCornerPoints = [];
+        bucket.push(intersectPoint);
+        bucket.push(intersectionPoint1[i]);
+        bucket.push(intersectionPoint2[j]);
+        for (let k = 0; k < cornerPoints.length; k++) {
+          if (pointInAngle(intersectPoint, intersectionPoint1[i], intersectionPoint2[j], cornerPoints[k])) {
+            bucket.push(cornerPoints[k]);
+          } else {
+            newCornerPoints.push(cornerPoints[k]);
+          }
+        }
+        cornerPoints = newCornerPoints;
+        sections.push(bucket);
+      }
+    }
+  } else {
+    let sections1 = findSectionsInSolutionSetForOneLine(intersectionPoint1, domain, range);
+    let sections2 = findSectionsInSolutionSetForOneLine(intersectionPoint2, domain, range);
+    for (let i = 0; i < sections1.length; i++) {
+      if (!(pointInPolygon(intersectionPoint2[0], sections1[i]) && pointInPolygon(intersectionPoint2[1], sections1[i]))) {
+        sections.push(sections1[i]);
+      }
+    }
+    for (let i = 0; i < sections2.length; i++) {
+      if (!(pointInPolygon(intersectionPoint1[0], sections2[i]) && pointInPolygon(intersectionPoint1[1], sections2[i]))) {
+        sections.push(sections2[i]);
+      }
+    }
+    for (let i = 0; i < sections.length; i++) {
+      cornerPoints = cornerPoints.filter(function (o1) {
+        return !sections[i].some(function (o2) {
+          return o1.x === o2.x && o1.y === o2.y;
+        });
+      });
+    }
+    let sections3 = cornerPoints.concat(intersectionPoint1, intersectionPoint2);
+    sections.push(sections3);
+  }
+  return removeDuplicateAndFilterSections(sections);
+};
+
+/*
+ * Function to find sections in solution set
+ * @param {Object} gssLineData - graphing solution set line data
+ * @param {Array} answers - answers array
+ * @param {Object} domain - domain object
+ * @param {Object} range - range object
+ * */
+const findSectionsInSolutionSet = (gssLineData, answers, domain, range) => {
+  if (gssLineData.numberOfLines === 1) {
+    const intersectionPoint = findIntersectionPointForMark(answers[0], domain, range);
+    gssLineData.sections = findSectionsInSolutionSetForOneLine(intersectionPoint, domain, range);
+  } else {
+    gssLineData.sections = findSectionsInSolutionSetForTwoLines(gssLineData, answers, domain, range);
+  }
+  return gssLineData;
+};
+
+/*
+ * Function to check if a point is inside a polygon
+ * @param {Object} point - point to be checked
+ * @param {Array} polygon - polygon points array
+ * */
+exports.findSectionsInSolutionSet = findSectionsInSolutionSet;
+const pointInsidePolygon = (point, polygon) => {
+  const num_vertices = polygon.length;
+  const x = point.x;
+  const y = point.y;
+  let inside = false;
+  let p1 = polygon[0];
+  let p2;
+  for (let i = 1; i <= num_vertices; i++) {
+    p2 = polygon[i % num_vertices];
+    if (y > Math.min(p1.y, p2.y)) {
+      if (y <= Math.max(p1.y, p2.y)) {
+        if (x <= Math.max(p1.x, p2.x)) {
+          const x_intersection = (y - p1.y) * (p2.x - p1.x) / (p2.y - p1.y) + p1.x;
+          if (p1.x === p2.x || x <= x_intersection) {
+            inside = !inside;
+          }
+        }
+      }
+    }
+    p1 = p2;
+  }
+  return inside;
+};
+
+/*
+ * Function to check if lines are added in the graph
+ * @param {Object} gssLineData - graphing solution set line data
+ * @param {Array} answer - answer array
+ * */
+exports.pointInsidePolygon = pointInsidePolygon;
+const checkIfLinesAreAdded = (gssLineData, answer) => {
+  if (answer.length === 0) {
+    return false;
+  }
+  if (gssLineData.numberOfLines === 1) {
+    if (answer.length === 1) {
+      return !answer[0].building;
+    }
+  } else {
+    if (answer.length !== 2) {
+      return false;
+    } else {
+      return !answer[1].building;
+    }
+  }
+};
+
+/*
+ * Function to remove invalid answers
+ * @param {Array} answers - answers array
+ * */
+exports.checkIfLinesAreAdded = checkIfLinesAreAdded;
+const removeInvalidAnswers = answers => answers ? (answers || []).filter(({
+  type,
+  ...answer
+}) => completeMark[type] ? completeMark[type](answer) : false) : [];
+exports.removeInvalidAnswers = removeInvalidAnswers;
+//# sourceMappingURL=utils.js.map

package/lib/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","names":["completeFromTo","item","completeMark","point","from","to","completePoint","Number","isFinite","x","y","line","distance","a","b","Math","sqrt","toFixed","pointInPolygon","polygon","c","inside","clonePolygon","push","i","length","lineIntersect","x1","y1","x2","y2","x3","y3","x4","y4","ua","denominator","isPointInsideGraph","domain","range","min","max","isPointOnOrInsideGraph","findIntersectionPointForMark","mark","intersectionPoint","tempData","intersection","sortPointsClockWise","points","sort","cy","cx","center","startAng","forEach","ang","atan2","PI","angle","ccwPoints","reverse","unshift","pop","map","attr","dotProduct","v1","v2","magnitude","v","angleBetweenVectors","dot","magV1","magV2","acos","pointInAngle","commonPoint","point1","point2","testPoint","vector1","vector2","testVector","angle1","angle2","angleSum","tolerance","abs","removeDuplicatesFromArray","array","filter","obj","index","findIndex","o","removeDuplicateAndFilterSections","sections","section","findSectionsInSolutionSetForOneLine","concat","findSectionsInSolutionSetForTwoLines","gssLineData","answers","mark1","mark2","cornerPoints","intersectPoint","intersectionPoint1","intersectionPoint2","j","bucket","newCornerPoints","k","sections1","sections2","o1","some","o2","sections3","findSectionsInSolutionSet","numberOfLines","exports","pointInsidePolygon","num_vertices","p1","p2","x_intersection","checkIfLinesAreAdded","answer","building","removeInvalidAnswers","type"],"sources":["../src/utils.js"],"sourcesContent":["/*\n * Check if a line is complete\n * @param {Object} item - mark object\n * */\nconst completeFromTo = (item) => item && completeMark.point(item.from) && completeMark.point(item.to);\n\n/*\n * Check if a point is correct and complete\n * @param {Object} point - point object\n * */\nconst completePoint = (point) => point && Number.isFinite(point.x) && Number.isFinite(point.y);\n\n/*\n * Complete mark object for line and point\n * */\nconst completeMark = {\n  line: completeFromTo,\n  point: completePoint,\n};\n\n//////////////////////////////////////////////////////////////////////////////////\n// BELOW FUNCTIONS ARE USED IN configure/src/utils as well\n//////////////////////////////////////////////////////////////////////////////////\n\n/*\n * Function to calculate the distance between two points\n * @param {Object} a - point a\n * @param {Object} b - point b\n * */\nconst distance = (a, b) => {\n  return Number(Math.sqrt((a.x - b.x) ** 2 + (a.y - b.y) ** 2).toFixed(3));\n};\n\n/*\n * Function to check if a point lies on edges of a polygon\n * @param {Object} point - point object\n * @param {Array} polygon - polygon points array\n * */\nconst pointInPolygon = (point, polygon) => {\n  let c = point;\n  let inside = false;\n  let clonePolygon = [...polygon];\n  clonePolygon.push(polygon[0]);\n  for (let i = 0; i < clonePolygon.length - 1; i++) {\n    let a = clonePolygon[i];\n    let b = clonePolygon[i + 1];\n    // check if point is on the edge\n    if (distance(a, c) + distance(c, b) === distance(a, b)) {\n      inside = true;\n      break;\n    }\n  }\n  return inside;\n};\n\n/*\n * Function to get the intersection point of two lines\n * @param {Number} x1 - x coordinate of point 1 of line 1\n * @param {Number} y1 - y coordinate of point 1 of line 1\n * @param {Number} x2 - x coordinate of point 2 of line 1\n * @param {Number} y2 - y coordinate of point 2 of line 1\n * @param {Number} x3 - x coordinate of point 1 of line 2\n * @param {Number} y3 - y coordinate of point 1 of line 2\n * @param {Number} x4 - x coordinate of point 2 of line 2\n * @param {Number} y4 - y coordinate of point 2 of line 2\n * */\nconst lineIntersect = (x1, y1, x2, y2, x3, y3, x4, y4) => {\n  let ua,\n    denominator = (y4 - y3) * (x2 - x1) - (x4 - x3) * (y2 - y1);\n  if (denominator === 0) {\n    return null;\n  }\n  ua = ((x4 - x3) * (y1 - y3) - (y4 - y3) * (x1 - x3)) / denominator;\n  return {\n    x: Number((x1 + ua * (x2 - x1)).toFixed(3)),\n    y: Number((y1 + ua * (y2 - y1)).toFixed(3)),\n  };\n};\n\n/*\n * Check if a point is inside the graph\n * @param {Object} point - point object\n * @param {Object} domain - domain object\n * @param {Object} range - range object\n * */\nconst isPointInsideGraph = (point, domain, range) => {\n  return point.x > domain.min && point.x < domain.max && point.y > range.min && point.y < range.max;\n};\n\n/*\n * Check if a point is on or inside the graph\n * @param {Object} point - point object\n * @param {Object} domain - domain object\n * @param {Object} range - range object\n * */\nconst isPointOnOrInsideGraph = (point, domain, range) => {\n  return point.x >= domain.min && point.x <= domain.max && point.y >= range.min && point.y <= range.max;\n};\n\n/*\n * Find the intersection point of a mark with the graph\n * @param {Object} mark - mark object\n * @param {Object} domain - domain object\n * @param {Object} range - range object\n * */\nconst findIntersectionPointForMark = (mark, domain, range) => {\n  let intersectionPoint = [];\n  let tempData = [\n    [domain.max, range.max, domain.max, range.min],\n    [domain.min, range.max, domain.min, range.min],\n    [domain.min, range.max, domain.max, range.max],\n    [domain.min, range.min, domain.max, range.min],\n  ];\n  for (let i = 0; i < tempData.length; i++) {\n    let intersection = lineIntersect(\n      mark.from.x,\n      mark.from.y,\n      mark.to.x,\n      mark.to.y,\n      tempData[i][0],\n      tempData[i][1],\n      tempData[i][2],\n      tempData[i][3],\n    );\n    if (intersection && isPointOnOrInsideGraph(intersection, domain, range)) {\n      intersectionPoint.push(intersection);\n    }\n  }\n  return intersectionPoint;\n};\n\n/*\n * Sort points in clockwise direction for a polygon\n * @param {Array} points - points array\n * */\nconst sortPointsClockWise = (points) => {\n  // Find min max to get center and Sort from top to bottom\n  points.sort((a, b) => a.y - b.y);\n  // Get center y\n  const cy = (points[0].y + points[points.length - 1].y) / 2;\n  // Sort from right to left\n  points.sort((a, b) => b.x - a.x);\n  // Get center x\n  const cx = (points[0].x + points[points.length - 1].x) / 2;\n  // Center point\n  const center = { x: cx, y: cy };\n  // As the points are sorted from right to left the first point is the rightmost Starting angle used to reference other angles\n  let startAng;\n  points.forEach((point) => {\n    let ang = Math.atan2(point.y - center.y, point.x - center.x);\n    if (!startAng) {\n      startAng = ang;\n    } else {\n      if (ang < startAng) {\n        // ensure that all points are clockwise of the start point\n        ang += Math.PI * 2;\n      }\n    }\n    point.angle = ang; // add the angle to the point\n  });\n  // first sort clockwise\n  points.sort((a, b) => a.angle - b.angle);\n  // then reverse the order\n  const ccwPoints = points.reverse();\n  // move the last point back to the start\n  ccwPoints.unshift(ccwPoints.pop());\n  return ccwPoints.map(({ angle, ...attr }) => attr);\n};\n\n/*\n * Function to calculate the dot product of two vectors\n * @param {Object} v1 - point 1\n * @param {Object} v2 - point 2\n * */\nconst dotProduct = (v1, v2) => {\n  return v1.x * v2.x + v1.y * v2.y;\n};\n\n/*\n * Function to calculate the magnitude of a vector\n * @param {Object} v - point object\n * */\nconst magnitude = (v) => {\n  return Math.sqrt(v.x * v.x + v.y * v.y);\n};\n\n/*\n * Function to calculate the angle between two vectors in radians\n * @param {Object} v1 - point 1\n * @param {Object} v2 - point 2\n * */\nconst angleBetweenVectors = (v1, v2) => {\n  const dot = dotProduct(v1, v2);\n  const magV1 = magnitude(v1);\n  const magV2 = magnitude(v2);\n  // Ensure the dot product is within the domain of the acos function\n  return Math.acos(dot / (magV1 * magV2));\n};\n\n/*\n * Function to check if a point lies between the angle formed by two lines\n * @param {Object} commonPoint - common point of the two lines\n * @param {Object} point1 - point 1 of cone\n * @param {Object} point2 - point 2 of cone\n * @param {Object} testPoint - point to be tested\n * */\nconst pointInAngle = (commonPoint, point1, point2, testPoint) => {\n  const vector1 = { x: point1.x - commonPoint.x, y: point1.y - commonPoint.y };\n  const vector2 = { x: point2.x - commonPoint.x, y: point2.y - commonPoint.y };\n  const testVector = { x: testPoint.x - commonPoint.x, y: testPoint.y - commonPoint.y };\n  const angle1 = angleBetweenVectors(vector1, testVector);\n  const angle2 = angleBetweenVectors(vector2, testVector);\n  const angleSum = angle1 + angle2;\n  // Check if the sum of angles is approximately equal to the angle between the two lines\n  // You may need to adjust the tolerance (e.g., 0.0001) based on your specific requirements\n  const tolerance = 0.0001;\n  return Math.abs(angleSum - angleBetweenVectors(vector1, vector2)) < tolerance;\n};\n\n/*\n * Function to remove duplicate points from an array\n * @param {Array} array - array of points\n * */\nconst removeDuplicatesFromArray = (array) => {\n  return array.filter((obj, index) => {\n    return index === array.findIndex((o) => obj.x === o.x && obj.y === o.y);\n  });\n};\n\n/*\n * Function to remove duplicate points and filter sections\n * @param {Array} sections - array of sections\n * */\nconst removeDuplicateAndFilterSections = (sections) => {\n  //removing duplicate points.\n  for (let i = 0; i < sections.length; i++) {\n    sections[i] = sections[i].filter((obj, index) => {\n      return index === sections[i].findIndex((o) => obj.x === o.x && obj.y === o.y);\n    });\n  }\n  //removing arrays with two points\n  sections = sections.filter((section) => section.length > 2);\n  //sorting the points in clockwise direction\n  for (let i = 0; i < sections.length; i++) {\n    sections[i] = sortPointsClockWise(sections[i]);\n  }\n  return sections;\n};\n\n/*\n * Function to find sections in solution set for one line\n * @param {Array} intersectionPoint - intersection point\n * @param {Object} domain - domain object\n * @param {Object} range - range object\n * */\nconst findSectionsInSolutionSetForOneLine = (intersectionPoint, domain, range) => {\n  let sections = [];\n  sections.push([].concat(intersectionPoint));\n  sections.push([].concat(intersectionPoint));\n  if (\n    (intersectionPoint[0].x === domain.max && intersectionPoint[1].y === range.max) ||\n    (intersectionPoint[1].x === domain.max && intersectionPoint[0].y === range.max)\n  ) {\n    sections[0].push({ x: domain.max, y: range.max });\n    sections[1].push({ x: domain.min, y: range.max }, { x: domain.min, y: range.min }, { x: domain.max, y: range.min });\n  } else if (\n    (intersectionPoint[0].x === domain.min && intersectionPoint[1].y === range.max) ||\n    (intersectionPoint[1].x === domain.min && intersectionPoint[0].y === range.max)\n  ) {\n    sections[0].push({ x: domain.min, y: range.max });\n    sections[1].push({ x: domain.max, y: range.max }, { x: domain.max, y: range.min }, { x: domain.min, y: range.min });\n  } else if (\n    (intersectionPoint[0].x === domain.min && intersectionPoint[1].y === range.min) ||\n    (intersectionPoint[1].x === domain.min && intersectionPoint[0].y === range.min)\n  ) {\n    sections[0].push({ x: domain.min, y: range.min });\n    sections[1].push({ x: domain.max, y: range.min }, { x: domain.max, y: range.max }, { x: domain.min, y: range.max });\n  } else if (\n    (intersectionPoint[0].x === domain.max && intersectionPoint[1].y === range.min) ||\n    (intersectionPoint[1].x === domain.max && intersectionPoint[0].y === range.min)\n  ) {\n    sections[0].push({ x: domain.max, y: range.min });\n    sections[1].push({ x: domain.min, y: range.min }, { x: domain.min, y: range.max }, { x: domain.max, y: range.max });\n  } else if (\n    (intersectionPoint[0].x === domain.min && intersectionPoint[1].x === domain.max) ||\n    (intersectionPoint[0].x === domain.max && intersectionPoint[1].x === domain.min)\n  ) {\n    sections[0].push({ x: domain.min, y: range.max }, { x: domain.max, y: range.max });\n    sections[1].push({ x: domain.min, y: range.min }, { x: domain.max, y: range.min });\n  } else if (\n    (intersectionPoint[0].y === range.min && intersectionPoint[1].y === range.max) ||\n    (intersectionPoint[0].y === range.max && intersectionPoint[1].y === range.min)\n  ) {\n    sections[0].push({ x: domain.min, y: range.min }, { x: domain.min, y: range.max });\n    sections[1].push({ x: domain.max, y: range.min }, { x: domain.max, y: range.max });\n  }\n  return removeDuplicateAndFilterSections(sections);\n};\n\n/*\n * Function to find sections in solution set for two lines\n * @param {Object} gssLineData - graphing solution set line data\n * @param {Array} answers - answers array\n * @param {Object} domain - domain object\n * @param {Object} range - range object\n * */\nconst findSectionsInSolutionSetForTwoLines = (gssLineData, answers, domain, range) => {\n  let mark1 = answers[0];\n  let mark2 = answers[1];\n  let cornerPoints = [\n    { x: domain.min, y: range.min },\n    { x: domain.min, y: range.max },\n    { x: domain.max, y: range.min },\n    { x: domain.max, y: range.max },\n  ];\n  let intersectPoint = lineIntersect(\n    mark1.from.x,\n    mark1.from.y,\n    mark1.to.x,\n    mark1.to.y,\n    mark2.from.x,\n    mark2.from.y,\n    mark2.to.x,\n    mark2.to.y,\n  );\n  let sections = [];\n  let intersectionPoint1 = findIntersectionPointForMark(mark1, domain, range);\n  intersectionPoint1 = removeDuplicatesFromArray(intersectionPoint1);\n  let intersectionPoint2 = findIntersectionPointForMark(mark2, domain, range);\n  intersectionPoint2 = removeDuplicatesFromArray(intersectionPoint2);\n  if (intersectPoint && isPointInsideGraph(intersectPoint, domain, range)) {\n    for (let i = 0; i < intersectionPoint1.length; i++) {\n      for (let j = 0; j < intersectionPoint2.length; j++) {\n        let bucket = [];\n        let newCornerPoints = [];\n        bucket.push(intersectPoint);\n        bucket.push(intersectionPoint1[i]);\n        bucket.push(intersectionPoint2[j]);\n        for (let k = 0; k < cornerPoints.length; k++) {\n          if (pointInAngle(intersectPoint, intersectionPoint1[i], intersectionPoint2[j], cornerPoints[k])) {\n            bucket.push(cornerPoints[k]);\n          } else {\n            newCornerPoints.push(cornerPoints[k]);\n          }\n        }\n        cornerPoints = newCornerPoints;\n        sections.push(bucket);\n      }\n    }\n  } else {\n    let sections1 = findSectionsInSolutionSetForOneLine(intersectionPoint1, domain, range);\n    let sections2 = findSectionsInSolutionSetForOneLine(intersectionPoint2, domain, range);\n    for (let i = 0; i < sections1.length; i++) {\n      if (\n        !(pointInPolygon(intersectionPoint2[0], sections1[i]) && pointInPolygon(intersectionPoint2[1], sections1[i]))\n      ) {\n        sections.push(sections1[i]);\n      }\n    }\n    for (let i = 0; i < sections2.length; i++) {\n      if (\n        !(pointInPolygon(intersectionPoint1[0], sections2[i]) && pointInPolygon(intersectionPoint1[1], sections2[i]))\n      ) {\n        sections.push(sections2[i]);\n      }\n    }\n    for (let i = 0; i < sections.length; i++) {\n      cornerPoints = cornerPoints.filter(function (o1) {\n        return !sections[i].some(function (o2) {\n          return o1.x === o2.x && o1.y === o2.y;\n        });\n      });\n    }\n    let sections3 = cornerPoints.concat(intersectionPoint1, intersectionPoint2);\n    sections.push(sections3);\n  }\n  return removeDuplicateAndFilterSections(sections);\n};\n\n/*\n * Function to find sections in solution set\n * @param {Object} gssLineData - graphing solution set line data\n * @param {Array} answers - answers array\n * @param {Object} domain - domain object\n * @param {Object} range - range object\n * */\nexport const findSectionsInSolutionSet = (gssLineData, answers, domain, range) => {\n  if (gssLineData.numberOfLines === 1) {\n    const intersectionPoint = findIntersectionPointForMark(answers[0], domain, range);\n    gssLineData.sections = findSectionsInSolutionSetForOneLine(intersectionPoint, domain, range);\n  } else {\n    gssLineData.sections = findSectionsInSolutionSetForTwoLines(gssLineData, answers, domain, range);\n  }\n  return gssLineData;\n};\n\n/*\n * Function to check if a point is inside a polygon\n * @param {Object} point - point to be checked\n * @param {Array} polygon - polygon points array\n * */\nexport const pointInsidePolygon = (point, polygon) => {\n  const num_vertices = polygon.length;\n  const x = point.x;\n  const y = point.y;\n  let inside = false;\n  let p1 = polygon[0];\n  let p2;\n  for (let i = 1; i <= num_vertices; i++) {\n    p2 = polygon[i % num_vertices];\n    if (y > Math.min(p1.y, p2.y)) {\n      if (y <= Math.max(p1.y, p2.y)) {\n        if (x <= Math.max(p1.x, p2.x)) {\n          const x_intersection = ((y - p1.y) * (p2.x - p1.x)) / (p2.y - p1.y) + p1.x;\n          if (p1.x === p2.x || x <= x_intersection) {\n            inside = !inside;\n          }\n        }\n      }\n    }\n    p1 = p2;\n  }\n  return inside;\n};\n\n/*\n * Function to check if lines are added in the graph\n * @param {Object} gssLineData - graphing solution set line data\n * @param {Array} answer - answer array\n * */\nexport const checkIfLinesAreAdded = (gssLineData, answer) => {\n  if (answer.length === 0) {\n    return false;\n  }\n  if (gssLineData.numberOfLines === 1) {\n    if (answer.length === 1) {\n      return !answer[0].building;\n    }\n  } else {\n    if (answer.length !== 2) {\n      return false;\n    } else {\n      return !answer[1].building;\n    }\n  }\n};\n\n/*\n * Function to remove invalid answers\n * @param {Array} answers - answers array\n * */\nexport const removeInvalidAnswers = (answers) =>\n  answers\n    ? (answers || []).filter(({ type, ...answer }) => (completeMark[type] ? completeMark[type](answer) : false))\n    : [];\n"],"mappings":";;;;;;AAAA;AACA;AACA;AACA;AACA,MAAMA,cAAc,GAAIC,IAAI,IAAKA,IAAI,IAAIC,YAAY,CAACC,KAAK,CAACF,IAAI,CAACG,IAAI,CAAC,IAAIF,YAAY,CAACC,KAAK,CAACF,IAAI,CAACI,EAAE,CAAC;;AAErG;AACA;AACA;AACA;AACA,MAAMC,aAAa,GAAIH,KAAK,IAAKA,KAAK,IAAII,MAAM,CAACC,QAAQ,CAACL,KAAK,CAACM,CAAC,CAAC,IAAIF,MAAM,CAACC,QAAQ,CAACL,KAAK,CAACO,CAAC,CAAC;;AAE9F;AACA;AACA;AACA,MAAMR,YAAY,GAAG;EACnBS,IAAI,EAAEX,cAAc;EACpBG,KAAK,EAAEG;AACT,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAMM,QAAQ,GAAGA,CAACC,CAAC,EAAEC,CAAC,KAAK;EACzB,OAAOP,MAAM,CAACQ,IAAI,CAACC,IAAI,CAAC,CAACH,CAAC,CAACJ,CAAC,GAAGK,CAAC,CAACL,CAAC,KAAK,CAAC,GAAG,CAACI,CAAC,CAACH,CAAC,GAAGI,CAAC,CAACJ,CAAC,KAAK,CAAC,CAAC,CAACO,OAAO,CAAC,CAAC,CAAC,CAAC;AAC1E,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,MAAMC,cAAc,GAAGA,CAACf,KAAK,EAAEgB,OAAO,KAAK;EACzC,IAAIC,CAAC,GAAGjB,KAAK;EACb,IAAIkB,MAAM,GAAG,KAAK;EAClB,IAAIC,YAAY,GAAG,CAAC,GAAGH,OAAO,CAAC;EAC/BG,YAAY,CAACC,IAAI,CAACJ,OAAO,CAAC,CAAC,CAAC,CAAC;EAC7B,KAAK,IAAIK,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGF,YAAY,CAACG,MAAM,GAAG,CAAC,EAAED,CAAC,EAAE,EAAE;IAChD,IAAIX,CAAC,GAAGS,YAAY,CAACE,CAAC,CAAC;IACvB,IAAIV,CAAC,GAAGQ,YAAY,CAACE,CAAC,GAAG,CAAC,CAAC;IAC3B;IACA,IAAIZ,QAAQ,CAACC,CAAC,EAAEO,CAAC,CAAC,GAAGR,QAAQ,CAACQ,CAAC,EAAEN,CAAC,CAAC,KAAKF,QAAQ,CAACC,CAAC,EAAEC,CAAC,CAAC,EAAE;MACtDO,MAAM,GAAG,IAAI;MACb;IACF;EACF;EACA,OAAOA,MAAM;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMK,aAAa,GAAGA,CAACC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAAEC,EAAE,EAAEC,EAAE,KAAK;EACxD,IAAIC,EAAE;IACJC,WAAW,GAAG,CAACF,EAAE,GAAGF,EAAE,KAAKH,EAAE,GAAGF,EAAE,CAAC,GAAG,CAACM,EAAE,GAAGF,EAAE,KAAKD,EAAE,GAAGF,EAAE,CAAC;EAC7D,IAAIQ,WAAW,KAAK,CAAC,EAAE;IACrB,OAAO,IAAI;EACb;EACAD,EAAE,GAAG,CAAC,CAACF,EAAE,GAAGF,EAAE,KAAKH,EAAE,GAAGI,EAAE,CAAC,GAAG,CAACE,EAAE,GAAGF,EAAE,KAAKL,EAAE,GAAGI,EAAE,CAAC,IAAIK,WAAW;EAClE,OAAO;IACL3B,CAAC,EAAEF,MAAM,CAAC,CAACoB,EAAE,GAAGQ,EAAE,IAAIN,EAAE,GAAGF,EAAE,CAAC,EAAEV,OAAO,CAAC,CAAC,CAAC,CAAC;IAC3CP,CAAC,EAAEH,MAAM,CAAC,CAACqB,EAAE,GAAGO,EAAE,IAAIL,EAAE,GAAGF,EAAE,CAAC,EAAEX,OAAO,CAAC,CAAC,CAAC;EAC5C,CAAC;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,MAAMoB,kBAAkB,GAAGA,CAAClC,KAAK,EAAEmC,MAAM,EAAEC,KAAK,KAAK;EACnD,OAAOpC,KAAK,CAACM,CAAC,GAAG6B,MAAM,CAACE,GAAG,IAAIrC,KAAK,CAACM,CAAC,GAAG6B,MAAM,CAACG,GAAG,IAAItC,KAAK,CAACO,CAAC,GAAG6B,KAAK,CAACC,GAAG,IAAIrC,KAAK,CAACO,CAAC,GAAG6B,KAAK,CAACE,GAAG;AACnG,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,MAAMC,sBAAsB,GAAGA,CAACvC,KAAK,EAAEmC,MAAM,EAAEC,KAAK,KAAK;EACvD,OAAOpC,KAAK,CAACM,CAAC,IAAI6B,MAAM,CAACE,GAAG,IAAIrC,KAAK,CAACM,CAAC,IAAI6B,MAAM,CAACG,GAAG,IAAItC,KAAK,CAACO,CAAC,IAAI6B,KAAK,CAACC,GAAG,IAAIrC,KAAK,CAACO,CAAC,IAAI6B,KAAK,CAACE,GAAG;AACvG,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,4BAA4B,GAAGA,CAACC,IAAI,EAAEN,MAAM,EAAEC,KAAK,KAAK;EAC5D,IAAIM,iBAAiB,GAAG,EAAE;EAC1B,IAAIC,QAAQ,GAAG,CACb,CAACR,MAAM,CAACG,GAAG,EAAEF,KAAK,CAACE,GAAG,EAAEH,MAAM,CAACG,GAAG,EAAEF,KAAK,CAACC,GAAG,CAAC,EAC9C,CAACF,MAAM,CAACE,GAAG,EAAED,KAAK,CAACE,GAAG,EAAEH,MAAM,CAACE,GAAG,EAAED,KAAK,CAACC,GAAG,CAAC,EAC9C,CAACF,MAAM,CAACE,GAAG,EAAED,KAAK,CAACE,GAAG,EAAEH,MAAM,CAACG,GAAG,EAAEF,KAAK,CAACE,GAAG,CAAC,EAC9C,CAACH,MAAM,CAACE,GAAG,EAAED,KAAK,CAACC,GAAG,EAAEF,MAAM,CAACG,GAAG,EAAEF,KAAK,CAACC,GAAG,CAAC,CAC/C;EACD,KAAK,IAAIhB,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGsB,QAAQ,CAACrB,MAAM,EAAED,CAAC,EAAE,EAAE;IACxC,IAAIuB,YAAY,GAAGrB,aAAa,CAC9BkB,IAAI,CAACxC,IAAI,CAACK,CAAC,EACXmC,IAAI,CAACxC,IAAI,CAACM,CAAC,EACXkC,IAAI,CAACvC,EAAE,CAACI,CAAC,EACTmC,IAAI,CAACvC,EAAE,CAACK,CAAC,EACToC,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,CAAC,EACdsB,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,CAAC,EACdsB,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,CAAC,EACdsB,QAAQ,CAACtB,CAAC,CAAC,CAAC,CAAC,CACf,CAAC;IACD,IAAIuB,YAAY,IAAIL,sBAAsB,CAACK,YAAY,EAAET,MAAM,EAAEC,KAAK,CAAC,EAAE;MACvEM,iBAAiB,CAACtB,IAAI,CAACwB,YAAY,CAAC;IACtC;EACF;EACA,OAAOF,iBAAiB;AAC1B,CAAC;;AAED;AACA;AACA;AACA;AACA,MAAMG,mBAAmB,GAAIC,MAAM,IAAK;EACtC;EACAA,MAAM,CAACC,IAAI,CAAC,CAACrC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACH,CAAC,GAAGI,CAAC,CAACJ,CAAC,CAAC;EAChC;EACA,MAAMyC,EAAE,GAAG,CAACF,MAAM,CAAC,CAAC,CAAC,CAACvC,CAAC,GAAGuC,MAAM,CAACA,MAAM,CAACxB,MAAM,GAAG,CAAC,CAAC,CAACf,CAAC,IAAI,CAAC;EAC1D;EACAuC,MAAM,CAACC,IAAI,CAAC,CAACrC,CAAC,EAAEC,CAAC,KAAKA,CAAC,CAACL,CAAC,GAAGI,CAAC,CAACJ,CAAC,CAAC;EAChC;EACA,MAAM2C,EAAE,GAAG,CAACH,MAAM,CAAC,CAAC,CAAC,CAACxC,CAAC,GAAGwC,MAAM,CAACA,MAAM,CAACxB,MAAM,GAAG,CAAC,CAAC,CAAChB,CAAC,IAAI,CAAC;EAC1D;EACA,MAAM4C,MAAM,GAAG;IAAE5C,CAAC,EAAE2C,EAAE;IAAE1C,CAAC,EAAEyC;EAAG,CAAC;EAC/B;EACA,IAAIG,QAAQ;EACZL,MAAM,CAACM,OAAO,CAAEpD,KAAK,IAAK;IACxB,IAAIqD,GAAG,GAAGzC,IAAI,CAAC0C,KAAK,CAACtD,KAAK,CAACO,CAAC,GAAG2C,MAAM,CAAC3C,CAAC,EAAEP,KAAK,CAACM,CAAC,GAAG4C,MAAM,CAAC5C,CAAC,CAAC;IAC5D,IAAI,CAAC6C,QAAQ,EAAE;MACbA,QAAQ,GAAGE,GAAG;IAChB,CAAC,MAAM;MACL,IAAIA,GAAG,GAAGF,QAAQ,EAAE;QAClB;QACAE,GAAG,IAAIzC,IAAI,CAAC2C,EAAE,GAAG,CAAC;MACpB;IACF;IACAvD,KAAK,CAACwD,KAAK,GAAGH,GAAG,CAAC,CAAC;EACrB,CAAC,CAAC;EACF;EACAP,MAAM,CAACC,IAAI,CAAC,CAACrC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC8C,KAAK,GAAG7C,CAAC,CAAC6C,KAAK,CAAC;EACxC;EACA,MAAMC,SAAS,GAAGX,MAAM,CAACY,OAAO,CAAC,CAAC;EAClC;EACAD,SAAS,CAACE,OAAO,CAACF,SAAS,CAACG,GAAG,CAAC,CAAC,CAAC;EAClC,OAAOH,SAAS,CAACI,GAAG,CAAC,CAAC;IAAEL,KAAK;IAAE,GAAGM;EAAK,CAAC,KAAKA,IAAI,CAAC;AACpD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,MAAMC,UAAU,GAAGA,CAACC,EAAE,EAAEC,EAAE,KAAK;EAC7B,OAAOD,EAAE,CAAC1D,CAAC,GAAG2D,EAAE,CAAC3D,CAAC,GAAG0D,EAAE,CAACzD,CAAC,GAAG0D,EAAE,CAAC1D,CAAC;AAClC,CAAC;;AAED;AACA;AACA;AACA;AACA,MAAM2D,SAAS,GAAIC,CAAC,IAAK;EACvB,OAAOvD,IAAI,CAACC,IAAI,CAACsD,CAAC,CAAC7D,CAAC,GAAG6D,CAAC,CAAC7D,CAAC,GAAG6D,CAAC,CAAC5D,CAAC,GAAG4D,CAAC,CAAC5D,CAAC,CAAC;AACzC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,MAAM6D,mBAAmB,GAAGA,CAACJ,EAAE,EAAEC,EAAE,KAAK;EACtC,MAAMI,GAAG,GAAGN,UAAU,CAACC,EAAE,EAAEC,EAAE,CAAC;EAC9B,MAAMK,KAAK,GAAGJ,SAAS,CAACF,EAAE,CAAC;EAC3B,MAAMO,KAAK,GAAGL,SAAS,CAACD,EAAE,CAAC;EAC3B;EACA,OAAOrD,IAAI,CAAC4D,IAAI,CAACH,GAAG,IAAIC,KAAK,GAAGC,KAAK,CAAC,CAAC;AACzC,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,YAAY,GAAGA,CAACC,WAAW,EAAEC,MAAM,EAAEC,MAAM,EAAEC,SAAS,KAAK;EAC/D,MAAMC,OAAO,GAAG;IAAExE,CAAC,EAAEqE,MAAM,CAACrE,CAAC,GAAGoE,WAAW,CAACpE,CAAC;IAAEC,CAAC,EAAEoE,MAAM,CAACpE,CAAC,GAAGmE,WAAW,CAACnE;EAAE,CAAC;EAC5E,MAAMwE,OAAO,GAAG;IAAEzE,CAAC,EAAEsE,MAAM,CAACtE,CAAC,GAAGoE,WAAW,CAACpE,CAAC;IAAEC,CAAC,EAAEqE,MAAM,CAACrE,CAAC,GAAGmE,WAAW,CAACnE;EAAE,CAAC;EAC5E,MAAMyE,UAAU,GAAG;IAAE1E,CAAC,EAAEuE,SAAS,CAACvE,CAAC,GAAGoE,WAAW,CAACpE,CAAC;IAAEC,CAAC,EAAEsE,SAAS,CAACtE,CAAC,GAAGmE,WAAW,CAACnE;EAAE,CAAC;EACrF,MAAM0E,MAAM,GAAGb,mBAAmB,CAACU,OAAO,EAAEE,UAAU,CAAC;EACvD,MAAME,MAAM,GAAGd,mBAAmB,CAACW,OAAO,EAAEC,UAAU,CAAC;EACvD,MAAMG,QAAQ,GAAGF,MAAM,GAAGC,MAAM;EAChC;EACA;EACA,MAAME,SAAS,GAAG,MAAM;EACxB,OAAOxE,IAAI,CAACyE,GAAG,CAACF,QAAQ,GAAGf,mBAAmB,CAACU,OAAO,EAAEC,OAAO,CAAC,CAAC,GAAGK,SAAS;AAC/E,CAAC;;AAED;AACA;AACA;AACA;AACA,MAAME,yBAAyB,GAAIC,KAAK,IAAK;EAC3C,OAAOA,KAAK,CAACC,MAAM,CAAC,CAACC,GAAG,EAAEC,KAAK,KAAK;IAClC,OAAOA,KAAK,KAAKH,KAAK,CAACI,SAAS,CAAEC,CAAC,IAAKH,GAAG,CAACnF,CAAC,KAAKsF,CAAC,CAACtF,CAAC,IAAImF,GAAG,CAAClF,CAAC,KAAKqF,CAAC,CAACrF,CAAC,CAAC;EACzE,CAAC,CAAC;AACJ,CAAC;;AAED;AACA;AACA;AACA;AACA,MAAMsF,gCAAgC,GAAIC,QAAQ,IAAK;EACrD;EACA,KAAK,IAAIzE,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGyE,QAAQ,CAACxE,MAAM,EAAED,CAAC,EAAE,EAAE;IACxCyE,QAAQ,CAACzE,CAAC,CAAC,GAAGyE,QAAQ,CAACzE,CAAC,CAAC,CAACmE,MAAM,CAAC,CAACC,GAAG,EAAEC,KAAK,KAAK;MAC/C,OAAOA,KAAK,KAAKI,QAAQ,CAACzE,CAAC,CAAC,CAACsE,SAAS,CAAEC,CAAC,IAAKH,GAAG,CAACnF,CAAC,KAAKsF,CAAC,CAACtF,CAAC,IAAImF,GAAG,CAAClF,CAAC,KAAKqF,CAAC,CAACrF,CAAC,CAAC;IAC/E,CAAC,CAAC;EACJ;EACA;EACAuF,QAAQ,GAAGA,QAAQ,CAACN,MAAM,CAAEO,OAAO,IAAKA,OAAO,CAACzE,MAAM,GAAG,CAAC,CAAC;EAC3D;EACA,KAAK,IAAID,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGyE,QAAQ,CAACxE,MAAM,EAAED,CAAC,EAAE,EAAE;IACxCyE,QAAQ,CAACzE,CAAC,CAAC,GAAGwB,mBAAmB,CAACiD,QAAQ,CAACzE,CAAC,CAAC,CAAC;EAChD;EACA,OAAOyE,QAAQ;AACjB,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,MAAME,mCAAmC,GAAGA,CAACtD,iBAAiB,EAAEP,MAAM,EAAEC,KAAK,KAAK;EAChF,IAAI0D,QAAQ,GAAG,EAAE;EACjBA,QAAQ,CAAC1E,IAAI,CAAC,EAAE,CAAC6E,MAAM,CAACvD,iBAAiB,CAAC,CAAC;EAC3CoD,QAAQ,CAAC1E,IAAI,CAAC,EAAE,CAAC6E,MAAM,CAACvD,iBAAiB,CAAC,CAAC;EAC3C,IACGA,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACG,GAAG,IAAII,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACE,GAAG,IAC7EI,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACG,GAAG,IAAII,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACE,GAAI,EAC/E;IACAwD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,CAAC;IACjDwD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,EAAE;MAAEhC,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,EAAE;MAAE/B,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,CAAC;EACrH,CAAC,MAAM,IACJK,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACE,GAAG,IAAIK,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACE,GAAG,IAC7EI,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACE,GAAG,IAAIK,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACE,GAAI,EAC/E;IACAwD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,CAAC;IACjDwD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,EAAE;MAAEhC,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,EAAE;MAAE/B,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,CAAC;EACrH,CAAC,MAAM,IACJK,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACE,GAAG,IAAIK,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACC,GAAG,IAC7EK,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACE,GAAG,IAAIK,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACC,GAAI,EAC/E;IACAyD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,CAAC;IACjDyD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,EAAE;MAAE/B,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,EAAE;MAAEhC,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,CAAC;EACrH,CAAC,MAAM,IACJI,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACG,GAAG,IAAII,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACC,GAAG,IAC7EK,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACG,GAAG,IAAII,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACC,GAAI,EAC/E;IACAyD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,CAAC;IACjDyD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,EAAE;MAAE/B,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,EAAE;MAAEhC,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,CAAC;EACrH,CAAC,MAAM,IACJI,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACE,GAAG,IAAIK,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACG,GAAG,IAC9EI,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACG,GAAG,IAAII,iBAAiB,CAAC,CAAC,CAAC,CAACpC,CAAC,KAAK6B,MAAM,CAACE,GAAI,EAChF;IACAyD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,EAAE;MAAEhC,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,CAAC;IAClFwD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,EAAE;MAAE/B,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,CAAC;EACpF,CAAC,MAAM,IACJK,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACC,GAAG,IAAIK,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACE,GAAG,IAC5EI,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACE,GAAG,IAAII,iBAAiB,CAAC,CAAC,CAAC,CAACnC,CAAC,KAAK6B,KAAK,CAACC,GAAI,EAC9E;IACAyD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,EAAE;MAAE/B,CAAC,EAAE6B,MAAM,CAACE,GAAG;MAAE9B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,CAAC;IAClFwD,QAAQ,CAAC,CAAC,CAAC,CAAC1E,IAAI,CAAC;MAAEd,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACC;IAAI,CAAC,EAAE;MAAE/B,CAAC,EAAE6B,MAAM,CAACG,GAAG;MAAE/B,CAAC,EAAE6B,KAAK,CAACE;IAAI,CAAC,CAAC;EACpF;EACA,OAAOuD,gCAAgC,CAACC,QAAQ,CAAC;AACnD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAMI,oCAAoC,GAAGA,CAACC,WAAW,EAAEC,OAAO,EAAEjE,MAAM,EAAEC,KAAK,KAAK;EACpF,IAAIiE,KAAK,GAAGD,OAAO,CAAC,CAAC,CAAC;EACtB,IAAIE,KAAK,GAAGF,OAAO,CAAC,CAAC,CAAC;EACtB,IAAIG,YAAY,GAAG,CACjB;IAAEjG,CAAC,EAAE6B,MAAM,CAACE,GAAG;IAAE9B,CAAC,EAAE6B,KAAK,CAACC;EAAI,CAAC,EAC/B;IAAE/B,CAAC,EAAE6B,MAAM,CAACE,GAAG;IAAE9B,CAAC,EAAE6B,KAAK,CAACE;EAAI,CAAC,EAC/B;IAAEhC,CAAC,EAAE6B,MAAM,CAACG,GAAG;IAAE/B,CAAC,EAAE6B,KAAK,CAACC;EAAI,CAAC,EAC/B;IAAE/B,CAAC,EAAE6B,MAAM,CAACG,GAAG;IAAE/B,CAAC,EAAE6B,KAAK,CAACE;EAAI,CAAC,CAChC;EACD,IAAIkE,cAAc,GAAGjF,aAAa,CAChC8E,KAAK,CAACpG,IAAI,CAACK,CAAC,EACZ+F,KAAK,CAACpG,IAAI,CAACM,CAAC,EACZ8F,KAAK,CAACnG,EAAE,CAACI,CAAC,EACV+F,KAAK,CAACnG,EAAE,CAACK,CAAC,EACV+F,KAAK,CAACrG,IAAI,CAACK,CAAC,EACZgG,KAAK,CAACrG,IAAI,CAACM,CAAC,EACZ+F,KAAK,CAACpG,EAAE,CAACI,CAAC,EACVgG,KAAK,CAACpG,EAAE,CAACK,CACX,CAAC;EACD,IAAIuF,QAAQ,GAAG,EAAE;EACjB,IAAIW,kBAAkB,GAAGjE,4BAA4B,CAAC6D,KAAK,EAAElE,MAAM,EAAEC,KAAK,CAAC;EAC3EqE,kBAAkB,GAAGnB,yBAAyB,CAACmB,kBAAkB,CAAC;EAClE,IAAIC,kBAAkB,GAAGlE,4BAA4B,CAAC8D,KAAK,EAAEnE,MAAM,EAAEC,KAAK,CAAC;EAC3EsE,kBAAkB,GAAGpB,yBAAyB,CAACoB,kBAAkB,CAAC;EAClE,IAAIF,cAAc,IAAItE,kBAAkB,CAACsE,cAAc,EAAErE,MAAM,EAAEC,KAAK,CAAC,EAAE;IACvE,KAAK,IAAIf,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGoF,kBAAkB,CAACnF,MAAM,EAAED,CAAC,EAAE,EAAE;MAClD,KAAK,IAAIsF,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGD,kBAAkB,CAACpF,MAAM,EAAEqF,CAAC,EAAE,EAAE;QAClD,IAAIC,MAAM,GAAG,EAAE;QACf,IAAIC,eAAe,GAAG,EAAE;QACxBD,MAAM,CAACxF,IAAI,CAACoF,cAAc,CAAC;QAC3BI,MAAM,CAACxF,IAAI,CAACqF,kBAAkB,CAACpF,CAAC,CAAC,CAAC;QAClCuF,MAAM,CAACxF,IAAI,CAACsF,kBAAkB,CAACC,CAAC,CAAC,CAAC;QAClC,KAAK,IAAIG,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGP,YAAY,CAACjF,MAAM,EAAEwF,CAAC,EAAE,EAAE;UAC5C,IAAIrC,YAAY,CAAC+B,cAAc,EAAEC,kBAAkB,CAACpF,CAAC,CAAC,EAAEqF,kBAAkB,CAACC,CAAC,CAAC,EAAEJ,YAAY,CAACO,CAAC,CAAC,CAAC,EAAE;YAC/FF,MAAM,CAACxF,IAAI,CAACmF,YAAY,CAACO,CAAC,CAAC,CAAC;UAC9B,CAAC,MAAM;YACLD,eAAe,CAACzF,IAAI,CAACmF,YAAY,CAACO,CAAC,CAAC,CAAC;UACvC;QACF;QACAP,YAAY,GAAGM,eAAe;QAC9Bf,QAAQ,CAAC1E,IAAI,CAACwF,MAAM,CAAC;MACvB;IACF;EACF,CAAC,MAAM;IACL,IAAIG,SAAS,GAAGf,mCAAmC,CAACS,kBAAkB,EAAEtE,MAAM,EAAEC,KAAK,CAAC;IACtF,IAAI4E,SAAS,GAAGhB,mCAAmC,CAACU,kBAAkB,EAAEvE,MAAM,EAAEC,KAAK,CAAC;IACtF,KAAK,IAAIf,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG0F,SAAS,CAACzF,MAAM,EAAED,CAAC,EAAE,EAAE;MACzC,IACE,EAAEN,cAAc,CAAC2F,kBAAkB,CAAC,CAAC,CAAC,EAAEK,SAAS,CAAC1F,CAAC,CAAC,CAAC,IAAIN,cAAc,CAAC2F,kBAAkB,CAAC,CAAC,CAAC,EAAEK,SAAS,CAAC1F,CAAC,CAAC,CAAC,CAAC,EAC7G;QACAyE,QAAQ,CAAC1E,IAAI,CAAC2F,SAAS,CAAC1F,CAAC,CAAC,CAAC;MAC7B;IACF;IACA,KAAK,IAAIA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAG2F,SAAS,CAAC1F,MAAM,EAAED,CAAC,EAAE,EAAE;MACzC,IACE,EAAEN,cAAc,CAAC0F,kBAAkB,CAAC,CAAC,CAAC,EAAEO,SAAS,CAAC3F,CAAC,CAAC,CAAC,IAAIN,cAAc,CAAC0F,kBAAkB,CAAC,CAAC,CAAC,EAAEO,SAAS,CAAC3F,CAAC,CAAC,CAAC,CAAC,EAC7G;QACAyE,QAAQ,CAAC1E,IAAI,CAAC4F,SAAS,CAAC3F,CAAC,CAAC,CAAC;MAC7B;IACF;IACA,KAAK,IAAIA,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGyE,QAAQ,CAACxE,MAAM,EAAED,CAAC,EAAE,EAAE;MACxCkF,YAAY,GAAGA,YAAY,CAACf,MAAM,CAAC,UAAUyB,EAAE,EAAE;QAC/C,OAAO,CAACnB,QAAQ,CAACzE,CAAC,CAAC,CAAC6F,IAAI,CAAC,UAAUC,EAAE,EAAE;UACrC,OAAOF,EAAE,CAAC3G,CAAC,KAAK6G,EAAE,CAAC7G,CAAC,IAAI2G,EAAE,CAAC1G,CAAC,KAAK4G,EAAE,CAAC5G,CAAC;QACvC,CAAC,CAAC;MACJ,CAAC,CAAC;IACJ;IACA,IAAI6G,SAAS,GAAGb,YAAY,CAACN,MAAM,CAACQ,kBAAkB,EAAEC,kBAAkB,CAAC;IAC3EZ,QAAQ,CAAC1E,IAAI,CAACgG,SAAS,CAAC;EAC1B;EACA,OAAOvB,gCAAgC,CAACC,QAAQ,CAAC;AACnD,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACO,MAAMuB,yBAAyB,GAAGA,CAAClB,WAAW,EAAEC,OAAO,EAAEjE,MAAM,EAAEC,KAAK,KAAK;EAChF,IAAI+D,WAAW,CAACmB,aAAa,KAAK,CAAC,EAAE;IACnC,MAAM5E,iBAAiB,GAAGF,4BAA4B,CAAC4D,OAAO,CAAC,CAAC,CAAC,EAAEjE,MAAM,EAAEC,KAAK,CAAC;IACjF+D,WAAW,CAACL,QAAQ,GAAGE,mCAAmC,CAACtD,iBAAiB,EAAEP,MAAM,EAAEC,KAAK,CAAC;EAC9F,CAAC,MAAM;IACL+D,WAAW,CAACL,QAAQ,GAAGI,oCAAoC,CAACC,WAAW,EAAEC,OAAO,EAAEjE,MAAM,EAAEC,KAAK,CAAC;EAClG;EACA,OAAO+D,WAAW;AACpB,CAAC;;AAED;AACA;AACA;AACA;AACA;AAJAoB,OAAA,CAAAF,yBAAA,GAAAA,yBAAA;AAKO,MAAMG,kBAAkB,GAAGA,CAACxH,KAAK,EAAEgB,OAAO,KAAK;EACpD,MAAMyG,YAAY,GAAGzG,OAAO,CAACM,MAAM;EACnC,MAAMhB,CAAC,GAAGN,KAAK,CAACM,CAAC;EACjB,MAAMC,CAAC,GAAGP,KAAK,CAACO,CAAC;EACjB,IAAIW,MAAM,GAAG,KAAK;EAClB,IAAIwG,EAAE,GAAG1G,OAAO,CAAC,CAAC,CAAC;EACnB,IAAI2G,EAAE;EACN,KAAK,IAAItG,CAAC,GAAG,CAAC,EAAEA,CAAC,IAAIoG,YAAY,EAAEpG,CAAC,EAAE,EAAE;IACtCsG,EAAE,GAAG3G,OAAO,CAACK,CAAC,GAAGoG,YAAY,CAAC;IAC9B,IAAIlH,CAAC,GAAGK,IAAI,CAACyB,GAAG,CAACqF,EAAE,CAACnH,CAAC,EAAEoH,EAAE,CAACpH,CAAC,CAAC,EAAE;MAC5B,IAAIA,CAAC,IAAIK,IAAI,CAAC0B,GAAG,CAACoF,EAAE,CAACnH,CAAC,EAAEoH,EAAE,CAACpH,CAAC,CAAC,EAAE;QAC7B,IAAID,CAAC,IAAIM,IAAI,CAAC0B,GAAG,CAACoF,EAAE,CAACpH,CAAC,EAAEqH,EAAE,CAACrH,CAAC,CAAC,EAAE;UAC7B,MAAMsH,cAAc,GAAI,CAACrH,CAAC,GAAGmH,EAAE,CAACnH,CAAC,KAAKoH,EAAE,CAACrH,CAAC,GAAGoH,EAAE,CAACpH,CAAC,CAAC,IAAKqH,EAAE,CAACpH,CAAC,GAAGmH,EAAE,CAACnH,CAAC,CAAC,GAAGmH,EAAE,CAACpH,CAAC;UAC1E,IAAIoH,EAAE,CAACpH,CAAC,KAAKqH,EAAE,CAACrH,CAAC,IAAIA,CAAC,IAAIsH,cAAc,EAAE;YACxC1G,MAAM,GAAG,CAACA,MAAM;UAClB;QACF;MACF;IACF;IACAwG,EAAE,GAAGC,EAAE;EACT;EACA,OAAOzG,MAAM;AACf,CAAC;;AAED;AACA;AACA;AACA;AACA;AAJAqG,OAAA,CAAAC,kBAAA,GAAAA,kBAAA;AAKO,MAAMK,oBAAoB,GAAGA,CAAC1B,WAAW,EAAE2B,MAAM,KAAK;EAC3D,IAAIA,MAAM,CAACxG,MAAM,KAAK,CAAC,EAAE;IACvB,OAAO,KAAK;EACd;EACA,IAAI6E,WAAW,CAACmB,aAAa,KAAK,CAAC,EAAE;IACnC,IAAIQ,MAAM,CAACxG,MAAM,KAAK,CAAC,EAAE;MACvB,OAAO,CAACwG,MAAM,CAAC,CAAC,CAAC,CAACC,QAAQ;IAC5B;EACF,CAAC,MAAM;IACL,IAAID,MAAM,CAACxG,MAAM,KAAK,CAAC,EAAE;MACvB,OAAO,KAAK;IACd,CAAC,MAAM;MACL,OAAO,CAACwG,MAAM,CAAC,CAAC,CAAC,CAACC,QAAQ;IAC5B;EACF;AACF,CAAC;;AAED;AACA;AACA;AACA;AAHAR,OAAA,CAAAM,oBAAA,GAAAA,oBAAA;AAIO,MAAMG,oBAAoB,GAAI5B,OAAO,IAC1CA,OAAO,GACH,CAACA,OAAO,IAAI,EAAE,EAAEZ,MAAM,CAAC,CAAC;EAAEyC,IAAI;EAAE,GAAGH;AAAO,CAAC,KAAM/H,YAAY,CAACkI,IAAI,CAAC,GAAGlI,YAAY,CAACkI,IAAI,CAAC,CAACH,MAAM,CAAC,GAAG,KAAM,CAAC,GAC1G,EAAE;AAACP,OAAA,CAAAS,oBAAA,GAAAA,oBAAA","ignoreList":[]}