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

package/dist/browser/controller/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../src/controller/defaults.ts","../../../src/controller/utils.ts","../../../src/controller/index.ts"],"sourcesContent":["// @ts-nocheck\n/**\n * @synced-from pie-elements/packages/graphing-solution-set/controller/src/defaults.js\n * @auto-generated\n *\n * This file is automatically synced from pie-elements and converted to TypeScript.\n * Manual edits will be overwritten on next sync.\n * To make changes, edit the upstream JavaScript file and run sync again.\n */\n\n/*\n * This file contains the default configuration for the Graphing Solution Set Item Type.\n * Model is similar to the one used in graphing item type except for the gssLineData object which handles\n * the configuration for the lines and the solution set.\n *\n * Same model is used in configure/src default.js\n * */\nexport default {\n  answers: {\n    correctAnswer: {\n      name: 'Correct Answer',\n      marks: [],\n    },\n  },\n  arrows: {\n    left: true,\n    right: true,\n    up: true,\n    down: true,\n  },\n  marks: [],\n  defaultGridConfiguration: 0,\n  domain: {\n    min: -5,\n    max: 5,\n    step: 1,\n    labelStep: 1,\n    axisLabel: 'x',\n  },\n  graph: {\n    width: 500,\n    height: 500,\n  },\n  gssLineData: {\n    numberOfLines: 1,\n    selectedTool: 'lineA',\n    sections: [],\n    lineA: {\n      lineType: 'Solid',\n    },\n  },\n  includeAxes: true,\n  labels: {},\n  labelsEnabled: true,\n  padding: true,\n  prompt: '',\n  range: {\n    min: -5,\n    max: 5,\n    step: 1,\n    labelStep: 1,\n    axisLabel: 'y',\n  },\n  rationale: '',\n  standardGrid: false,\n  title: '',\n  coordinatesOnHover: false,\n  promptEnabled: true,\n  rationaleEnabled: true,\n  teacherInstructionsEnabled: true,\n  studentInstructionsEnabled: true,\n};\n","// @ts-nocheck\n/**\n * @synced-from pie-elements/packages/graphing-solution-set/controller/src/utils.js\n * @auto-generated\n *\n * This file is automatically synced from pie-elements and converted to TypeScript.\n * Manual edits will be overwritten on next sync.\n * To make changes, edit the upstream JavaScript file and run sync again.\n */\n\nimport { isEqual, differenceWith, uniq, uniqWith } from '@pie-element/shared-lodash';\n\n/*\n * Constant to check equal segments\n * @param {Object} segment1 - segment 1\n * @param {Object} segment2 - segment 2\n * */\nexport const equalSegment = (segment1, segment2) => {\n  // A.from = B.from, A.to = B.to OR A.from = B.to, A.to = B.from\n  // x1 = x3 & y1 = y3 & x2 = x4 & y2 = y4\n  return (\n    (isEqual(segment1.from, segment2.from) && isEqual(segment1.to, segment2.to)) ||\n    (isEqual(segment1.to, segment2.from) && isEqual(segment1.from, segment2.to))\n  );\n};\n\n// this function is implemented in configure as well\n/*\n * Constant to get sorted answers\n * @param {Object} answers - answers\n * */\nexport const sortedAnswers = (answers) =>\n  Object.keys(answers || {})\n    .sort()\n    .reduce((result, key) => {\n      if (key !== 'correctAnswer') {\n        result[key] = answers[key];\n      }\n      return result;\n    }, {});\n\n/*\n * Constant to return line equation coefficients\n * @param {Object} line - line\n * */\nconst returnLineEquationCoefficients = (line) => {\n  line = { ...line, to: { ...line.to }, from: { ...line.from } };\n  const xA = line.from.x;\n  const yA = line.from.y;\n  const xB = line.to.x;\n  const yB = line.to.y;\n  return {\n    a: yB - yA,\n    b: xA - xB,\n    c: xB * yA - xA * yB,\n  };\n};\n\n/*\n * Constant to get significant decimals\n * @param {Number} number - number\n * */\nconst getSignificantDecimals = (number) => Math.round(number * 10000) / 10000;\n\n/*\n * Constant to check equal lines\n * @param {Object} line1 - line 1\n * @param {Object} line2 - line 2\n * */\nexport const equalLine = (line1, line2) => {\n  // line equation: ax + by + c = 0\n  // 2 lines are equal if a1/a2 = b1/b2 = c1/c2, where a, b, c are the coefficients in line equation\n  // line equation knowing 2 points: (y - yA) / (yB - yA) = (x - xA) / (xB - xA)\n  // extending this equation, we get: x * (yB - yA) + y * (xA - xB) + (xB * yA - xA * yB) = 0\n  // where a = yB - yA; b = xA - xB; c = xB * yA - xA * yB\n  const { a: a1, b: b1, c: c1 } = returnLineEquationCoefficients(line1);\n  const { a: a2, b: b2, c: c2 } = returnLineEquationCoefficients(line2);\n  const proportions = [];\n  if (a2 !== 0) {\n    proportions.push(getSignificantDecimals(a1 / a2));\n  } else if (a1 !== a2) {\n    return false;\n  }\n  if (b2 !== 0) {\n    proportions.push(getSignificantDecimals(b1 / b2));\n  } else if (b1 !== b2) {\n    return false;\n  }\n  if (c2 !== 0) {\n    proportions.push(getSignificantDecimals(c1 / c2));\n  } else if (c1 !== c2) {\n    return false;\n  }\n  return uniq(proportions).length === 1 && line1.fill === line2.fill;\n  // (y2 - y1)/(x2 - x1) = (y4 - y3)/(x4 - x3);\n  // return ((Math.abs((line1.to.y - line1.from.y) / (line1.to.x - line1.from.x))) === (Math.abs((line2.to.y - line2.from.y) / (line2.to.x - line2.from.x))));\n};\n\n/*\n * Constant to construct segments from points\n * @param {Array} points - points\n * */\nexport const constructSegmentsFromPoints = (points) => {\n  // takes the list of points that represent a polygon and transforms it into a list of segments; eg.:\n  // points: A, B, C, D => segments: AB, BC, CD, DA\n  return (points || []).map((point, index) => ({ from: point, to: points[(index + 1) % points.length] }));\n};\n\n/*\n * Constant to remove duplicate segments\n * @param {Array} segments - segments\n * */\nexport const removeDuplicateSegments = (segments) => {\n  segments = segments || [];\n  // removes segments that are duplicates; eg. These segments are the same, so one will be removed:\n  // segment1: from: { x: 1, y: 1 }, to: { x: 2, y: 1 }\n  // segment2: from: { x: 2, y: 1 }, to: { x: 1, y: 1 }\n  return uniqWith(segments, (s1, s2) => equalSegment(s1, s2));\n};\n\n/*\n * Constant to remove invalid segments\n * @param {Array} segments - segments\n * */\nexport const removeInvalidSegments = (segments) => {\n  segments = segments || [];\n  // removes segments that start in a point and end in the same point (eg.: from: { x: 1, y: 1 }, to: { x: 1, y: 1 })\n  return segments.filter((segment) => !isEqual(segment.from, segment.to));\n};\n\n/*\n * Constant to check equal polygons\n * @param {Object} poly1 - polygon 1 points\n * @param {Object} poly2 - polygon 2 points\n * */\nexport const equalPolygon = (poly1, poly2) => {\n  const { points: points1 } = poly1;\n  const { points: points2 } = poly2;\n  // generate segments\n  const segments1 = constructSegmentsFromPoints(points1);\n  const segments2 = constructSegmentsFromPoints(points2);\n  const segments1NoDuplicates = removeDuplicateSegments(removeInvalidSegments(segments1));\n  const segments2NoDuplicates = removeDuplicateSegments(removeInvalidSegments(segments2));\n  const differentSegments1 = differenceWith(segments1NoDuplicates, segments2NoDuplicates, equalSegment);\n  const differentSegments2 = differenceWith(segments2NoDuplicates, segments1NoDuplicates, equalSegment);\n  return (!differentSegments1 || !differentSegments1.length) && (!differentSegments2 || !differentSegments2.length);\n};\n\n/*\n * Constant to compare equal marks\n * */\nexport const equalMarks = {\n  line: (sessAnswer, mark) => equalLine(sessAnswer, mark),\n  polygon: (sessAnswer, poly) => equalPolygon(sessAnswer, poly),\n};\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 * 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} item - mark object\n * */\nconst completePoints = (item) =>\n  item &&\n  item.points &&\n  item.points.length &&\n  (item.points.filter((point) => completePoint(point)) || []).length === item.points.length;\n\n/*\n * Complete mark object for line and point\n * */\nconst completeMark = {\n  point: completePoint,\n  line: completeFromTo,\n  polygon: completePoints,\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","// @ts-nocheck\n/**\n * @synced-from pie-elements/packages/graphing-solution-set/controller/src/index.js\n * @auto-generated\n *\n * This file is automatically synced from pie-elements and converted to TypeScript.\n * Manual edits will be overwritten on next sync.\n * To make changes, edit the upstream JavaScript file and run sync again.\n */\n\nimport debug from 'debug';\nimport { cloneDeep, isEmpty, uniqWith } from '@pie-element/shared-lodash';\nimport defaults from './defaults.js';\nimport { equalMarks, sortedAnswers, removeInvalidAnswers } from './utils.js';\n\nconst log = debug('@pie-element:graphing-solution-set:controller');\n\nconst initializeGraphMap = () => ({\n  line: [],\n});\n\n/*\n * Function to compare two marks\n * @param {Object} mark1 - first mark\n * @param {Object} mark2 - second mark\n * */\nexport const compareMarks = (mark1, mark2) => {\n  // marks can be compared with equalMarks[type] function only if they have the same type;\n  // if type is different, they are clearly not equal\n  return !!(\n    mark1 &&\n    mark2 &&\n    mark1.type === mark2.type &&\n    equalMarks[mark1.type] &&\n    equalMarks[mark1.type](mark1, mark2)\n  );\n};\n\n/*\n * Function to get the corrected answer\n * @param {Object} sessionAnswers - array of marks from session\n * @param {Object} marks - array of marks from correct answer\n * */\nexport const getAnswerCorrected = ({ sessionAnswers, marks: correctAnswers }) => {\n  sessionAnswers = sessionAnswers || [];\n  correctAnswers = correctAnswers || [];\n  const rez = cloneDeep(sessionAnswers).reduce((correctedAnswer, answer) => {\n    const answerIsCorrect = correctAnswers.find((mark) => compareMarks(answer, mark));\n    answer.correctness = answerIsCorrect ? 'correct' : 'incorrect';\n    return [...correctedAnswer, answer];\n  }, []);\n  // add missing objects from correct answer\n  const missingAnswers = cloneDeep(correctAnswers).reduce((correctedAnswer, answer) => {\n    const answerIndex = sessionAnswers.find((mark) => compareMarks(answer, mark));\n    if (!answerIndex) {\n      // means that corrected answer is missing from session, so we mark it as missing object\n      return [...correctedAnswer, { ...answer, correctness: 'missing' }];\n    }\n    return correctedAnswer;\n  }, []);\n  return [...rez, ...missingAnswers];\n};\n\n/*\n * Function to get the best answer\n * @param {Object} question - question object\n * @param {Object} session - session object\n * @param {Object} env - env object\n * */\nexport const getBestAnswer = (question, session, env = {}) => {\n  // questionPossibleAnswers contains all possible answers (correct response and alternates);\n  let { answers: questionPossibleAnswers = {}, scoringType } = question || {};\n  let { answer } = session || {};\n  // filter the incomplete objects\n  Object.entries(questionPossibleAnswers || {}).forEach(\n    ([key, value]) =>\n      (questionPossibleAnswers[key] = { ...value, marks: value?.marks.filter((mark) => !mark.building) }),\n  );\n  // initialize answer if no values\n  answer = answer || [];\n  // initialize one possible answer if no values\n  if (isEmpty(questionPossibleAnswers)) {\n    questionPossibleAnswers = { correctAnswer: initializeGraphMap() };\n  } else {\n    questionPossibleAnswers = {\n      correctAnswer: questionPossibleAnswers.correctAnswer,\n      ...sortedAnswers(questionPossibleAnswers),\n    };\n  }\n  // student's answers without DUPLICATES\n  const sessionAnswers = uniqWith(answer, compareMarks);\n  // array of possible answers entries\n  const possibleAnswers = Object.entries(questionPossibleAnswers);\n  return possibleAnswers.reduce(\n    (acc, entry) => {\n      // iterating each possible answer (main + alternates)\n      const possibleAnswerKey = entry[0];\n      const possibleAnswer = entry[1] || {};\n      let { marks } = possibleAnswer;\n      if (!marks || !marks.length) {\n        return acc;\n      }\n      // returns array of marks, each having 'correctness' property\n      const correctedAnswer = getAnswerCorrected({ sessionAnswers, marks });\n      const correctMarks = correctedAnswer.filter((answer) => answer.correctness === 'correct');\n      // filter out missing objects because they do not affect the calculation of the score\n      // only correct and incorrect are needed\n      const scoredCorrectedAnswer = correctedAnswer.filter((answer) => answer.correctness !== 'missing');\n      const maxScore = marks.length;\n      let score = correctMarks.length;\n      // if extra placements\n      if (scoredCorrectedAnswer.length > maxScore) {\n        score -= scoredCorrectedAnswer.length - maxScore;\n      }\n      if (score < 0) {\n        score = 0;\n      }\n      if (score / maxScore > acc.bestScore || !acc.foundOneSolution) {\n        acc.bestScore = Math.floor(score / maxScore);\n        acc.bestScoreAnswerKey = possibleAnswerKey;\n        acc.answersCorrected = correctedAnswer;\n        acc.foundOneSolution = true;\n      }\n      return acc;\n    },\n    {\n      bestScore: 0,\n      bestScoreAnswerKey: null,\n      // initially we just suppose all the answers are incorrect\n      answersCorrected: cloneDeep(sessionAnswers).map((answer) => ({ ...answer, correctness: 'incorrect' })),\n      foundOneSolution: false,\n    },\n  );\n};\n\n/*\n * Constant normalize\n * @param {Object} question - question object\n * */\nexport const normalize = (question) => ({ ...defaults, ...question });\n\n/*\n * Function to set model\n * @param {Object} question - question object\n * @param {Object} session - session object\n * @param {Object} env - env object\n * */\nexport function model(question, session, env) {\n  return new Promise((resolve) => {\n    const normalizedQuestion = normalize(question);\n    // ensure removing of invalid answers\n    // need this if undo redo was last operation\n    session.answer = removeInvalidAnswers(session.answer);\n    // console.log('normalizedQuestion', normalizedQuestion);\n    const { defaultTool, extraCSSRules, prompt, promptEnabled, graph, answers, toolbarTools, ...questionProps } =\n      normalizedQuestion || {};\n    let { arrows } = normalizedQuestion;\n    const { mode, role } = env || {};\n\n    // This is used for offering support for old models which have the property arrows: boolean\n    // Same thing is set in authoring : packages/graphing/configure/src/configure.jsx - componentDidMount\n    if (typeof arrows === 'boolean') {\n      if (arrows) {\n        arrows = {\n          left: true,\n          right: true,\n          up: true,\n          down: true,\n        };\n      } else {\n        arrows = {\n          left: false,\n          right: false,\n          up: false,\n          down: false,\n        };\n      }\n    }\n\n    const base = {\n      ...questionProps,\n      answers,\n      arrows,\n      defaultTool: 'line',\n      disabled: env.mode !== 'gather',\n      prompt: promptEnabled ? prompt : null,\n      rationale: null,\n      size: graph,\n      showToggle:\n        env.mode === 'evaluate' &&\n        !isEmpty(answers) &&\n        answers.correctAnswer &&\n        answers.correctAnswer.marks &&\n        !isEmpty(answers.correctAnswer.marks),\n      teacherInstructions: null,\n      toolbarTools,\n      extraCSSRules,\n    };\n\n    if (role === 'instructor' && (mode === 'view' || mode === 'evaluate')) {\n      const { rationale, rationaleEnabled, teacherInstructions, teacherInstructionsEnabled } = normalizedQuestion || {};\n\n      base.rationale = rationaleEnabled ? rationale : null;\n      base.teacherInstructions = teacherInstructionsEnabled ? teacherInstructions : null;\n    }\n\n    if (mode === 'evaluate') {\n      if (\n        !isEmpty(answers) &&\n        answers.correctAnswer &&\n        answers.correctAnswer.marks &&\n        !isEmpty(answers.correctAnswer.marks)\n      ) {\n        const { answersCorrected, bestScoreAnswerKey, bestScore } = getBestAnswer(normalizedQuestion, session, env);\n        // array of marks from session with 'correctness' property set\n        base.answersCorrected = answersCorrected;\n        base.correctResponse = bestScoreAnswerKey ? (answers[bestScoreAnswerKey] || {}).marks : [];\n        base.showToggle = base.showToggle && bestScore !== 1;\n      } else {\n        base.answersCorrected = (session && session.answer) || [];\n        base.correctResponse = [];\n      }\n    }\n\n    log('base: ', base);\n    resolve(base);\n  });\n}\n\n/*\n * Function to check the outcome\n * @param {Object} question - question object\n * @param {Object} session - session object\n * @param {Object} env - env object\n * */\nexport function outcome(question, session, env = {}) {\n  return new Promise((resolve) => {\n    if (!session || isEmpty(session)) {\n      resolve({ score: 0, empty: true });\n    }\n    if (\n      env.mode !== 'evaluate' ||\n      isEmpty(question.answers) ||\n      (question.answers && question.answers.correctAnswer && isEmpty(question.answers.correctAnswer.marks))\n    ) {\n      resolve({ score: 0 });\n    }\n    const { bestScore } = getBestAnswer(question, session, env);\n    resolve({ score: bestScore });\n  });\n}\n\n/*\n * Constant to create correct response session\n * @param {Object} question - question object\n * @param {Object} env - env object\n * */\nexport const createCorrectResponseSession = (question, env) => {\n  return new Promise((resolve) => {\n    if (env.mode !== 'evaluate' && env.role === 'instructor') {\n      const { answers } = question || {};\n      let marks = [];\n      if (answers && Object.values(answers)) {\n        const correctAnswer = answers.correctAnswer || Object.values(answers)[0] || {};\n        marks = correctAnswer.marks || [];\n      }\n      resolve({\n        answer: marks,\n        id: '1',\n      });\n    } else {\n      resolve(null);\n    }\n  });\n};\n\n/*\n * Constant to validate model before saving item\n * @param {Object} model - model object\n * */\nexport const validate = (model = {}) => {\n  const { answers, gssLineData } = model;\n  const errors = {};\n  const correctAnswerErrors = {};\n  let found = false;\n  if (gssLineData.numberOfLines === 1) {\n    if (answers.correctAnswer.marks.length < 1) {\n      found = true;\n      correctAnswerErrors.correctAnswer = 'At least 1 line object should be defined.';\n    } else if (answers.correctAnswer.marks.length === 1 && answers.correctAnswer.marks[0].building) {\n      found = true;\n      correctAnswerErrors.correctAnswer = '1 or more graph object should be correctly defined.';\n    }\n  } else {\n    if (answers.correctAnswer.marks.length < 2) {\n      found = true;\n      correctAnswerErrors.correctAnswer = 'At least 2 line object should be defined.';\n    } else if (answers.correctAnswer.marks.length === 2) {\n      if (answers.correctAnswer.marks[0].building || answers.correctAnswer.marks[1].building) {\n        found = true;\n        correctAnswerErrors.correctAnswer = '1 or more graph object should be correctly defined.';\n      }\n    }\n  }\n  let polygon = answers.correctAnswer.marks.find((mark) => mark.type === 'polygon');\n  if (!found && (!gssLineData.selectedTool === 'solutionSet' || !polygon)) {\n    correctAnswerErrors.correctAnswer = 'Please select a solution set for the graphing solution set item.';\n  }\n  if (!isEmpty(correctAnswerErrors)) {\n    errors.correctAnswerErrors = correctAnswerErrors;\n  }\n  return errors;\n};\n"],"mappings":";;mCAiBA,IAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAsDA,GCtDa,KAAgB,GAAU,MAIlC,EAAQ,EAAS,MAAM,EAAS,IAAI,KAAK,EAAQ,EAAS,IAAI,EAAS,EAAE,KACzE,EAAQ,EAAS,IAAI,EAAS,IAAI,KAAK,EAAQ,EAAS,MAAM,EAAS,EAAE,GASjE,KAAiB,MAC5B,OAAO,KAAK,KAAW,CAAC,CAAC,EACtB,KAAK,EACL,QAAQ,GAAQ,OACX,MAAQ,oBACV,EAAO,KAAO,EAAQ,KAEjB,IACN,CAAC,CAAC,GAMH,KAAkC,MAAS;CAC/C,IAAO;EAAE,GAAG;EAAM,IAAI,EAAE,GAAG,EAAK,GAAG;EAAG,MAAM,EAAE,GAAG,EAAK,KAAK;CAAE;CAC7D,IAAM,IAAK,EAAK,KAAK,GACf,IAAK,EAAK,KAAK,GACf,IAAK,EAAK,GAAG,GACb,IAAK,EAAK,GAAG;CACnB,OAAO;EACL,GAAG,IAAK;EACR,GAAG,IAAK;EACR,GAAG,IAAK,IAAK,IAAK;CACpB;AACF,GAMM,KAA0B,MAAW,KAAK,MAAM,IAAS,GAAK,IAAI,KAO3D,KAAa,GAAO,MAAU;CAMzC,IAAM,EAAE,GAAG,GAAI,GAAG,GAAI,GAAG,MAAO,EAA+B,CAAK,GAC9D,EAAE,GAAG,GAAI,GAAG,GAAO,MAAO,EAA+B,CAAK,GAC9D,IAAc,CAAC;CACrB,IAAI,MAAO,GACT,EAAY,KAAK,EAAuB,IAAK,CAAE,CAAC;MAC3C,IAAI,MAAO,GAChB,OAAO;CAET,IAAI,MAAO,GACT,EAAY,KAAK,EAAuB,IAAK,CAAE,CAAC;MAC3C,IAAI,MAAO,GAChB,OAAO;CAET,IAAI,MAAO,GACT,EAAY,KAAK,EAAuB,IAAK,CAAE,CAAC;MAC3C,IAAI,MAAO,GAChB,OAAO;CAET,OAAO,EAAK,CAAW,EAAE,WAAW,KAAK,EAAM,SAAS,EAAM;AAGhE,GAMa,KAA+B,OAGlC,KAAU,CAAC,GAAG,KAAK,GAAO,OAAW;CAAE,MAAM;CAAO,IAAI,GAAQ,IAAQ,KAAK,EAAO;AAAQ,EAAE,GAO3F,KAA2B,OACtC,MAAuB,CAAC,GAIjB,EAAS,IAAW,GAAI,MAAO,EAAa,GAAI,CAAE,CAAC,IAO/C,KAAyB,OACpC,MAAuB,CAAC,GAEjB,EAAS,QAAQ,MAAY,CAAC,EAAQ,EAAQ,MAAM,EAAQ,EAAE,CAAC,IAQ3D,KAAgB,GAAO,MAAU;CAC5C,IAAM,EAAE,QAAQ,MAAY,GACtB,EAAE,QAAQ,MAAY,GAEtB,IAAY,EAA4B,CAAO,GAC/C,IAAY,EAA4B,CAAO,GAC/C,IAAwB,EAAwB,EAAsB,CAAS,CAAC,GAChF,IAAwB,EAAwB,EAAsB,CAAS,CAAC,GAChF,IAAqB,EAAe,GAAuB,GAAuB,CAAY,GAC9F,IAAqB,EAAe,GAAuB,GAAuB,CAAY;CACpG,QAAQ,CAAC,KAAsB,CAAC,EAAmB,YAAY,CAAC,KAAsB,CAAC,EAAmB;AAC5G,GAKa,IAAa;CACxB,OAAO,GAAY,MAAS,EAAU,GAAY,CAAI;CACtD,UAAU,GAAY,MAAS,EAAa,GAAY,CAAI;AAC9D,GAMM,KAAiB,MAAU,KAAS,OAAO,SAAS,EAAM,CAAC,KAAK,OAAO,SAAS,EAAM,CAAC,GAqBvF,IAAe;CACnB,OAAO;CACP,OAjBsB,MAAS,KAAQ,EAAa,MAAM,EAAK,IAAI,KAAK,EAAa,MAAM,EAAK,EAAE;CAkBlG,UAZsB,MACtB,KACA,EAAK,UACL,EAAK,OAAO,WACX,EAAK,OAAO,QAAQ,MAAU,EAAc,CAAK,CAAC,KAAK,CAAC,GAAG,WAAW,EAAK,OAAO;AASrF,GAMa,KAAwB,MACnC,KACK,KAAW,CAAC,GAAG,QAAQ,EAAE,SAAM,GAAG,QAAc,EAAa,KAAQ,EAAa,GAAM,CAAM,IAAI,EAAM,IACzG,CAAC,GCnLD,KAAA,GAAA,EAAA,SAAY,+CAA+C,GAE3D,WAA4B,EAChC,MAAM,CAAC,EACT,IAOa,KAAgB,GAAO,MAG3B,CAAC,EACN,KACA,KACA,EAAM,SAAS,EAAM,QACrB,EAAW,EAAM,SACjB,EAAW,EAAM,MAAM,GAAO,CAAK,IAS1B,KAAsB,EAAE,mBAAgB,OAAO,QAAqB;CAE/E,AADA,MAAmC,CAAC,GACpC,MAAmC,CAAC;CACpC,IAAM,IAAM,EAAU,CAAc,EAAE,QAAQ,GAAiB,OAE7D,EAAO,cADiB,EAAe,MAAM,MAAS,EAAa,GAAQ,CAAI,CAC1D,IAAkB,YAAY,aAC5C,CAAC,GAAG,GAAiB,CAAM,IACjC,CAAC,CAAC,GAEC,IAAiB,EAAU,CAAc,EAAE,QAAQ,GAAiB,MACpD,EAAe,MAAM,MAAS,EAAa,GAAQ,CAAI,CACtE,IAIE,IAFE,CAAC,GAAG,GAAiB;EAAE,GAAG;EAAQ,aAAa;CAAU,CAAC,GAGlE,CAAC,CAAC;CACL,OAAO,CAAC,GAAG,GAAK,GAAG,CAAc;AACnC,GAQa,KAAiB,GAAU,GAAS,IAAM,CAAC,MAAM;CAE5D,IAAI,EAAE,SAAS,IAA0B,CAAC,GAAG,mBAAgB,KAAY,CAAC,GACtE,EAAE,cAAW,KAAW,CAAC;CAS7B,AAPA,OAAO,QAAQ,KAA2B,CAAC,CAAC,EAAE,SAC3C,CAAC,GAAK,OACJ,EAAwB,KAAO;EAAE,GAAG;EAAO,OAAO,GAAO,MAAM,QAAQ,MAAS,CAAC,EAAK,QAAQ;CAAE,CACrG,GAEA,MAAmB,CAAC,GAEpB,AAGE,IAHE,EAAQ,CAAuB,IACP,EAAE,eAAe,EAAmB,EAAE,IAEtC;EACxB,eAAe,EAAwB;EACvC,GAAG,EAAc,CAAuB;CAC1C;CAGF,IAAM,IAAiB,EAAS,GAAQ,CAAY;CAGpD,OADwB,OAAO,QAAQ,CAChC,EAAgB,QACpB,GAAK,MAAU;EAEd,IAAM,IAAoB,EAAM,IAE5B,EAAE,aADiB,EAAM,MAAM,CAAC;EAEpC,IAAI,CAAC,KAAS,CAAC,EAAM,QACnB,OAAO;EAGT,IAAM,IAAkB,EAAmB;GAAE;GAAgB;EAAM,CAAC,GAC9D,IAAe,EAAgB,QAAQ,MAAW,EAAO,gBAAgB,SAAS,GAGlF,IAAwB,EAAgB,QAAQ,MAAW,EAAO,gBAAgB,SAAS,GAC3F,IAAW,EAAM,QACnB,IAAQ,EAAa;EAczB,OAZI,EAAsB,SAAS,MACjC,KAAS,EAAsB,SAAS,IAEtC,IAAQ,MACV,IAAQ,KAEN,IAAQ,IAAW,EAAI,aAAa,CAAC,EAAI,sBAC3C,EAAI,YAAY,KAAK,MAAM,IAAQ,CAAQ,GAC3C,EAAI,qBAAqB,GACzB,EAAI,mBAAmB,GACvB,EAAI,mBAAmB,KAElB;CACT,GACA;EACE,WAAW;EACX,oBAAoB;EAEpB,kBAAkB,EAAU,CAAc,EAAE,KAAK,OAAY;GAAE,GAAG;GAAQ,aAAa;EAAY,EAAE;EACrG,kBAAkB;CACpB,CACF;AACF,GAMa,KAAa,OAAc;CAAE,GAAG;CAAU,GAAG;AAAS;AAQnE,SAAgB,EAAM,GAAU,GAAS,GAAK;CAC5C,OAAO,IAAI,SAAS,MAAY;EAC9B,IAAM,IAAqB,EAAU,CAAQ;EAG7C,EAAQ,SAAS,EAAqB,EAAQ,MAAM;EAEpD,IAAM,EAAE,gBAAa,kBAAe,WAAQ,kBAAe,UAAO,YAAS,iBAAc,GAAG,MAC1F,KAAsB,CAAC,GACrB,EAAE,cAAW,GACX,EAAE,SAAM,YAAS,KAAO,CAAC;EAI/B,AAAI,OAAO,KAAW,cACpB,AAQE,IARE,IACO;GACP,MAAM;GACN,OAAO;GACP,IAAI;GACJ,MAAM;EACR,IAES;GACP,MAAM;GACN,OAAO;GACP,IAAI;GACJ,MAAM;EACR;EAIJ,IAAM,IAAO;GACX,GAAG;GACH;GACA;GACA,aAAa;GACb,UAAU,EAAI,SAAS;GACvB,QAAQ,IAAgB,IAAS;GACjC,WAAW;GACX,MAAM;GACN,YACE,EAAI,SAAS,cACb,CAAC,EAAQ,CAAO,KAChB,EAAQ,iBACR,EAAQ,cAAc,SACtB,CAAC,EAAQ,EAAQ,cAAc,KAAK;GACtC,qBAAqB;GACrB;GACA;EACF;EAEA,IAAI,MAAS,iBAAiB,MAAS,UAAU,MAAS,aAAa;GACrE,IAAM,EAAE,cAAW,qBAAkB,wBAAqB,kCAA+B,KAAsB,CAAC;GAGhH,AADA,EAAK,YAAY,IAAmB,IAAY,MAChD,EAAK,sBAAsB,IAA6B,IAAsB;EAChF;EAEA,IAAI,MAAS,YACX,IACE,CAAC,EAAQ,CAAO,KAChB,EAAQ,iBACR,EAAQ,cAAc,SACtB,CAAC,EAAQ,EAAQ,cAAc,KAAK,GACpC;GACA,IAAM,EAAE,qBAAkB,uBAAoB,iBAAc,EAAc,GAAoB,GAAS,CAAG;GAI1G,AAFA,EAAK,mBAAmB,GACxB,EAAK,kBAAkB,KAAsB,EAAQ,MAAuB,CAAC,GAAG,QAAQ,CAAC,GACzF,EAAK,aAAa,EAAK,cAAc,MAAc;EACrD,OAEE,AADA,EAAK,mBAAoB,KAAW,EAAQ,UAAW,CAAC,GACxD,EAAK,kBAAkB,CAAC;EAK5B,AADA,EAAI,UAAU,CAAI,GAClB,EAAQ,CAAI;CACd,CAAC;AACH;AAQA,SAAgB,EAAQ,GAAU,GAAS,IAAM,CAAC,GAAG;CACnD,OAAO,IAAI,SAAS,MAAY;EAI9B,CAHI,CAAC,KAAW,EAAQ,CAAO,MAC7B,EAAQ;GAAE,OAAO;GAAG,OAAO;EAAK,CAAC,IAGjC,EAAI,SAAS,cACb,EAAQ,EAAS,OAAO,KACvB,EAAS,WAAW,EAAS,QAAQ,iBAAiB,EAAQ,EAAS,QAAQ,cAAc,KAAK,MAEnG,EAAQ,EAAE,OAAO,EAAE,CAAC;EAEtB,IAAM,EAAE,iBAAc,EAAc,GAAU,GAAS,CAAG;EAC1D,EAAQ,EAAE,OAAO,EAAU,CAAC;CAC9B,CAAC;AACH;AAOA,IAAa,KAAgC,GAAU,MAC9C,IAAI,SAAS,MAAY;CAC9B,IAAI,EAAI,SAAS,cAAc,EAAI,SAAS,cAAc;EACxD,IAAM,EAAE,eAAY,KAAY,CAAC,GAC7B,IAAQ,CAAC;EAKb,AAJI,KAAW,OAAO,OAAO,CAAO,MAElC,KADsB,EAAQ,iBAAiB,OAAO,OAAO,CAAO,EAAE,MAAM,CAAC,GACvD,SAAS,CAAC,IAElC,EAAQ;GACN,QAAQ;GACR,IAAI;EACN,CAAC;CACH,OACE,EAAQ,IAAI;AAEhB,CAAC,GAOU,KAAY,IAAQ,CAAC,MAAM;CACtC,IAAM,EAAE,YAAS,mBAAgB,GAC3B,IAAS,CAAC,GACV,IAAsB,CAAC,GACzB,IAAQ;CACZ,AAAI,EAAY,kBAAkB,IAC5B,EAAQ,cAAc,MAAM,SAAS,KACvC,IAAQ,IACR,EAAoB,gBAAgB,+CAC3B,EAAQ,cAAc,MAAM,WAAW,KAAK,EAAQ,cAAc,MAAM,GAAG,aACpF,IAAQ,IACR,EAAoB,gBAAgB,yDAGlC,EAAQ,cAAc,MAAM,SAAS,KACvC,IAAQ,IACR,EAAoB,gBAAgB,+CAC3B,EAAQ,cAAc,MAAM,WAAW,MAC5C,EAAQ,cAAc,MAAM,GAAG,YAAY,EAAQ,cAAc,MAAM,GAAG,cAC5E,IAAQ,IACR,EAAoB,gBAAgB;CAI1C,IAAI,IAAU,EAAQ,cAAc,MAAM,MAAM,MAAS,EAAK,SAAS,SAAS;CAOhF,OANI,CAAC,MAAU,CAAC,EAAY,iBAAiB,iBAAiB,CAAC,OAC7D,EAAoB,gBAAgB,qEAEjC,EAAQ,CAAmB,MAC9B,EAAO,sBAAsB,IAExB;AACT"}