@pie-element/ebsr 9.12.1 → 9.12.2-next.19

package/configure/node_modules/@pie-element/multiple-choice/node_modules/@pie-lib/pie-toolbox/code/graphing-solution-set/utils.js

@@ -0,0 +1,314 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.thinnerShapesNeeded = exports.sameAxes = exports.roundNumber = exports.polygonToArea = exports.pointsToArea = exports.point = exports.lineToArea = exports.isDuplicatedMark = exports.getTickValues = exports.getRightestPoints = exports.getMiddleOfTwoPoints = exports.getAngleDeg = exports.getAdjustedGraphLimits = exports.findLongestWord = exports.equalPoints = exports.countWords = exports.bounds = exports.arrowDimensions = exports.areArraysOfObjectsEqual = exports.amountToIncreaseWidth = void 0;
+
+var _head = _interopRequireDefault(require("lodash/head"));
+
+var _tail = _interopRequireDefault(require("lodash/tail"));
+
+var _plot = require("../plot");
+
+var _invariant = _interopRequireDefault(require("invariant"));
+
+var _isEqual = _interopRequireDefault(require("lodash/isEqual"));
+
+var _isEmpty = _interopRequireDefault(require("lodash/isEmpty"));
+
+var _cloneDeep = _interopRequireDefault(require("lodash/cloneDeep"));
+
+var bounds = _plot.utils.bounds;
+exports.bounds = bounds;
+var point = _plot.utils.point; //TODO: This can be removed?
+
+exports.point = point;
+
+var getAngleDeg = function getAngleDeg() {
+  return 0;
+}; //TODO: This can be removed?
+
+
+exports.getAngleDeg = getAngleDeg;
+
+var arrowDimensions = function arrowDimensions() {
+  return 0;
+};
+
+exports.arrowDimensions = arrowDimensions;
+
+var getTickValues = function getTickValues(prop) {
+  var tickValues = [];
+  var tickVal = 0;
+
+  while (tickVal >= prop.min && tickValues.indexOf(tickVal) < 0) {
+    tickValues.push(tickVal);
+    tickVal = Math.round((tickVal - prop.step) * 10000) / 10000;
+  }
+
+  tickVal = Math.round(prop.step * 10000) / 10000;
+
+  while (tickVal <= prop.max && tickValues.indexOf(tickVal) < 0) {
+    tickValues.push(tickVal);
+    tickVal = Math.round((tickVal + prop.step) * 10000) / 10000;
+  } // return only ticks that are inside the min-max interval
+
+
+  if (tickValues) {
+    return tickValues.filter(function (tV) {
+      return tV >= prop.min && tV <= prop.max;
+    });
+  }
+
+  return [];
+};
+
+exports.getTickValues = getTickValues;
+
+var countWords = function countWords(label) {
+  if (label == null || (0, _isEmpty["default"])(label)) {
+    return 1;
+  }
+
+  var words = label.split(' ');
+  return words.length;
+}; // findLongestWord is also used in plot
+
+
+exports.countWords = countWords;
+
+var findLongestWord = function findLongestWord(label) {
+  var longestWord = (label || '').replace(/<[^>]+>/g, '').split(' ').sort(function (a, b) {
+    return b.length - a.length;
+  });
+  return longestWord[0].length;
+}; // amountToIncreaseWidth is also used in plot
+
+
+exports.findLongestWord = findLongestWord;
+
+var amountToIncreaseWidth = function amountToIncreaseWidth(longestWord) {
+  if (!longestWord) {
+    return 0;
+  }
+
+  return longestWord * 10;
+};
+
+exports.amountToIncreaseWidth = amountToIncreaseWidth;
+
+var polygonToArea = function polygonToArea(points) {
+  var h = (0, _head["default"])(points);
+  var area = {
+    left: h.x,
+    top: h.y,
+    bottom: h.y,
+    right: h.x
+  };
+  return (0, _tail["default"])(points).reduce(function (a, p) {
+    a.left = Math.min(a.left, p.x);
+    a.top = Math.max(a.top, p.y);
+    a.bottom = Math.min(a.bottom, p.y);
+    a.right = Math.max(a.right, p.x);
+    return a;
+  }, area);
+};
+
+exports.polygonToArea = polygonToArea;
+
+var lineToArea = function lineToArea(from, to) {
+  return pointsToArea(from, to);
+};
+
+exports.lineToArea = lineToArea;
+
+var pointsToArea = function pointsToArea(a, b) {
+  (0, _invariant["default"])(!!a && !!b, 'a or b is undefined');
+  var left = Math.min(a.x, b.x);
+  var top = Math.max(a.y, b.y);
+  var bottom = Math.min(a.y, b.y);
+  var right = Math.max(a.x, b.x);
+  return {
+    left: left,
+    top: top,
+    bottom: bottom,
+    right: right
+  };
+};
+
+exports.pointsToArea = pointsToArea;
+
+var getRightestPoints = function getRightestPoints(points) {
+  var sortedPoints = (0, _cloneDeep["default"])(points);
+  sortedPoints.sort(function (a, b) {
+    return b.x - a.x;
+  });
+  return {
+    a: sortedPoints[0],
+    b: sortedPoints[1]
+  };
+};
+
+exports.getRightestPoints = getRightestPoints;
+
+var getMiddleOfTwoPoints = function getMiddleOfTwoPoints(a, b) {
+  return {
+    x: (a.x + b.x) / 2,
+    y: (a.y + b.y) / 2
+  };
+};
+
+exports.getMiddleOfTwoPoints = getMiddleOfTwoPoints;
+
+var roundNumber = function roundNumber(number) {
+  return parseFloat(number.toFixed(4));
+};
+
+exports.roundNumber = roundNumber;
+
+var sameAxes = function sameAxes(p1, p2) {
+  return p1 && p2 && (roundNumber(p1.x) === roundNumber(p2.x) || roundNumber(p1.y) === roundNumber(p2.y));
+};
+
+exports.sameAxes = sameAxes;
+
+var equalPoints = function equalPoints(p1, p2) {
+  return p1 && p2 && (0, _isEqual["default"])({
+    x: roundNumber(p1.x),
+    y: roundNumber(p1.y)
+  }, {
+    x: roundNumber(p2.x),
+    y: roundNumber(p2.y)
+  });
+};
+
+exports.equalPoints = equalPoints;
+
+var getDistanceBetweenTicks = function getDistanceBetweenTicks(axis, size) {
+  var min = axis.min,
+      max = axis.max,
+      step = axis.step;
+  var nbOfTicks = (max - min) / step;
+  return size / nbOfTicks;
+};
+
+var thinnerShapesNeeded = function thinnerShapesNeeded(graphProps) {
+  var domain = graphProps.domain,
+      range = graphProps.range,
+      _graphProps$size = graphProps.size,
+      width = _graphProps$size.width,
+      height = _graphProps$size.height; // 14 is the default width of a point
+
+  return getDistanceBetweenTicks(domain, width) < 14 || getDistanceBetweenTicks(range, height) < 14;
+};
+
+exports.thinnerShapesNeeded = thinnerShapesNeeded;
+
+var getAdjustedGraphLimits = function getAdjustedGraphLimits(graphProps) {
+  var domain = graphProps.domain,
+      range = graphProps.range,
+      _graphProps$size2 = graphProps.size,
+      width = _graphProps$size2.width,
+      height = _graphProps$size2.height;
+  var domainTicksDistance = getDistanceBetweenTicks(domain, width);
+  var rangeTicksDistance = getDistanceBetweenTicks(range, height); // 15 is the distance required for the arrow to extend the graph
+
+  var domainPadding = domain.step / (domainTicksDistance / 15);
+  var rangePadding = range.step / (rangeTicksDistance / 15);
+  return {
+    domain: {
+      min: domain.min - domainPadding,
+      max: domain.max + domainPadding
+    },
+    range: {
+      min: range.min - rangePadding,
+      max: range.max + rangePadding
+    }
+  };
+};
+
+exports.getAdjustedGraphLimits = getAdjustedGraphLimits;
+
+var sortPoints = function sortPoints(array) {
+  return (array || []).sort(function (a, b) {
+    return a.x - b.x || a.y - b.y;
+  });
+}; // check colliniarity of 3 points (source: https://www.geeksforgeeks.org/program-check-three-points-collinear/)
+
+
+var checkCollinearity = function checkCollinearity(a, b, c) {
+  return (a.x - b.x) * (c.y - b.y) === (c.x - b.x) * (a.y - b.y);
+}; // 2 lines are overlapping if all 4 points are collinear
+
+
+var isSameLine = function isSameLine(markA, markB) {
+  return checkCollinearity(markA.from, markB.from, markB.to) && checkCollinearity(markA.to, markB.from, markB.to);
+};
+
+var isDuplicatedMark = function isDuplicatedMark(mark, marks, oldMark) {
+  var type = mark.type,
+      building = mark.building;
+
+  if (building) {
+    return false;
+  }
+
+  var filteredMarks = (marks || []).filter(function (m) {
+    return m.type === type && !m.building;
+  });
+  var index = filteredMarks.findIndex(function (m) {
+    return (0, _isEqual["default"])(m, oldMark);
+  });
+
+  if (index !== -1) {
+    filteredMarks.splice(index, 1);
+  }
+
+  var duplicated = filteredMarks.find(function (m) {
+    if (type === 'line') {
+      var from = mark.from,
+          to = mark.to;
+      return equalPoints(from, m.from) && equalPoints(to, m.to) || equalPoints(from, m.to) && equalPoints(to, m.from) || type === 'line' && isSameLine(m, mark);
+    } else if (type === 'polygon') {
+      return (0, _isEqual["default"])(sortPoints((0, _cloneDeep["default"])(mark.points)), sortPoints((0, _cloneDeep["default"])(m.points)));
+    }
+  });
+  return !!duplicated;
+};
+
+exports.isDuplicatedMark = isDuplicatedMark;
+
+var areArraysOfObjectsEqual = function areArraysOfObjectsEqual(array1, array2) {
+  // Check if both arrays have the same length
+  if (array1.length !== array2.length) {
+    return false;
+  } // Iterate through each object in the arrays
+
+
+  for (var i = 0; i < array1.length; i++) {
+    // Get the current objects in both arrays
+    var obj1 = array1[i];
+    var obj2 = array2[i]; // Check if the objects have the same number of properties
+
+    if (Object.keys(obj1).length !== Object.keys(obj2).length) {
+      return false;
+    } // Iterate through each property in the objects
+
+
+    for (var key in obj1) {
+      // Check if the properties and their values are equal
+      if (obj1[key] !== obj2[key]) {
+        return false;
+      }
+    }
+  } // If all objects are equal, the arrays are the same
+
+
+  return true;
+};
+
+exports.areArraysOfObjectsEqual = areArraysOfObjectsEqual;
+//# sourceMappingURL=utils.js.map

package/configure/node_modules/@pie-element/multiple-choice/node_modules/@pie-lib/pie-toolbox/code/graphing-solution-set/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../src/code/graphing-solution-set/utils.js"],"names":["bounds","utils","point","getAngleDeg","arrowDimensions","getTickValues","prop","tickValues","tickVal","min","indexOf","push","Math","round","step","max","filter","tV","countWords","label","words","split","length","findLongestWord","longestWord","replace","sort","a","b","amountToIncreaseWidth","polygonToArea","points","h","area","left","x","top","y","bottom","right","reduce","p","lineToArea","from","to","pointsToArea","getRightestPoints","sortedPoints","getMiddleOfTwoPoints","roundNumber","number","parseFloat","toFixed","sameAxes","p1","p2","equalPoints","getDistanceBetweenTicks","axis","size","nbOfTicks","thinnerShapesNeeded","graphProps","domain","range","width","height","getAdjustedGraphLimits","domainTicksDistance","rangeTicksDistance","domainPadding","rangePadding","sortPoints","array","checkCollinearity","c","isSameLine","markA","markB","isDuplicatedMark","mark","marks","oldMark","type","building","filteredMarks","m","index","findIndex","splice","duplicated","find","areArraysOfObjectsEqual","array1","array2","i","obj1","obj2","Object","keys","key"],"mappings":";;;;;;;;;AAAA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AAEO,IAAMA,MAAM,GAAGC,YAAMD,MAArB;;AACA,IAAME,KAAK,GAAGD,YAAMC,KAApB,C,CAEP;;;;AACO,IAAMC,WAAW,GAAG,SAAdA,WAAc;AAAA,SAAM,CAAN;AAAA,CAApB,C,CACP;;;;;AACO,IAAMC,eAAe,GAAG,SAAlBA,eAAkB;AAAA,SAAM,CAAN;AAAA,CAAxB;;;;AAEA,IAAMC,aAAa,GAAG,SAAhBA,aAAgB,CAACC,IAAD,EAAU;AACrC,MAAMC,UAAU,GAAG,EAAnB;AACA,MAAIC,OAAO,GAAG,CAAd;;AAEA,SAAOA,OAAO,IAAIF,IAAI,CAACG,GAAhB,IAAuBF,UAAU,CAACG,OAAX,CAAmBF,OAAnB,IAA8B,CAA5D,EAA+D;AAC7DD,IAAAA,UAAU,CAACI,IAAX,CAAgBH,OAAhB;AACAA,IAAAA,OAAO,GAAGI,IAAI,CAACC,KAAL,CAAW,CAACL,OAAO,GAAGF,IAAI,CAACQ,IAAhB,IAAwB,KAAnC,IAA4C,KAAtD;AACD;;AAEDN,EAAAA,OAAO,GAAGI,IAAI,CAACC,KAAL,CAAWP,IAAI,CAACQ,IAAL,GAAY,KAAvB,IAAgC,KAA1C;;AAEA,SAAON,OAAO,IAAIF,IAAI,CAACS,GAAhB,IAAuBR,UAAU,CAACG,OAAX,CAAmBF,OAAnB,IAA8B,CAA5D,EAA+D;AAC7DD,IAAAA,UAAU,CAACI,IAAX,CAAgBH,OAAhB;AACAA,IAAAA,OAAO,GAAGI,IAAI,CAACC,KAAL,CAAW,CAACL,OAAO,GAAGF,IAAI,CAACQ,IAAhB,IAAwB,KAAnC,IAA4C,KAAtD;AACD,GAdoC,CAgBrC;;;AACA,MAAIP,UAAJ,EAAgB;AACd,WAAOA,UAAU,CAACS,MAAX,CAAkB,UAACC,EAAD;AAAA,aAAQA,EAAE,IAAIX,IAAI,CAACG,GAAX,IAAkBQ,EAAE,IAAIX,IAAI,CAACS,GAArC;AAAA,KAAlB,CAAP;AACD;;AAED,SAAO,EAAP;AACD,CAtBM;;;;AAwBA,IAAMG,UAAU,GAAG,SAAbA,UAAa,CAACC,KAAD,EAAW;AACnC,MAAIA,KAAK,IAAI,IAAT,IAAiB,yBAAQA,KAAR,CAArB,EAAqC;AACnC,WAAO,CAAP;AACD;;AAED,MAAMC,KAAK,GAAGD,KAAK,CAACE,KAAN,CAAY,GAAZ,CAAd;AACA,SAAOD,KAAK,CAACE,MAAb;AACD,CAPM,C,CASP;;;;;AACO,IAAMC,eAAe,GAAG,SAAlBA,eAAkB,CAACJ,KAAD,EAAW;AACxC,MAAIK,WAAW,GAAG,CAACL,KAAK,IAAI,EAAV,EACfM,OADe,CACP,UADO,EACK,EADL,EAEfJ,KAFe,CAET,GAFS,EAGfK,IAHe,CAGV,UAACC,CAAD,EAAIC,CAAJ;AAAA,WAAUA,CAAC,CAACN,MAAF,GAAWK,CAAC,CAACL,MAAvB;AAAA,GAHU,CAAlB;AAKA,SAAOE,WAAW,CAAC,CAAD,CAAX,CAAeF,MAAtB;AACD,CAPM,C,CASP;;;;;AACO,IAAMO,qBAAqB,GAAG,SAAxBA,qBAAwB,CAACL,WAAD,EAAiB;AACpD,MAAI,CAACA,WAAL,EAAkB;AAChB,WAAO,CAAP;AACD;;AAED,SAAOA,WAAW,GAAG,EAArB;AACD,CANM;;;;AAQA,IAAMM,aAAa,GAAG,SAAhBA,aAAgB,CAACC,MAAD,EAAY;AACvC,MAAMC,CAAC,GAAG,sBAAKD,MAAL,CAAV;AACA,MAAME,IAAI,GAAG;AACXC,IAAAA,IAAI,EAAEF,CAAC,CAACG,CADG;AAEXC,IAAAA,GAAG,EAAEJ,CAAC,CAACK,CAFI;AAGXC,IAAAA,MAAM,EAAEN,CAAC,CAACK,CAHC;AAIXE,IAAAA,KAAK,EAAEP,CAAC,CAACG;AAJE,GAAb;AAMA,SAAO,sBAAKJ,MAAL,EAAaS,MAAb,CAAoB,UAACb,CAAD,EAAIc,CAAJ,EAAU;AACnCd,IAAAA,CAAC,CAACO,IAAF,GAAStB,IAAI,CAACH,GAAL,CAASkB,CAAC,CAACO,IAAX,EAAiBO,CAAC,CAACN,CAAnB,CAAT;AACAR,IAAAA,CAAC,CAACS,GAAF,GAAQxB,IAAI,CAACG,GAAL,CAASY,CAAC,CAACS,GAAX,EAAgBK,CAAC,CAACJ,CAAlB,CAAR;AACAV,IAAAA,CAAC,CAACW,MAAF,GAAW1B,IAAI,CAACH,GAAL,CAASkB,CAAC,CAACW,MAAX,EAAmBG,CAAC,CAACJ,CAArB,CAAX;AACAV,IAAAA,CAAC,CAACY,KAAF,GAAU3B,IAAI,CAACG,GAAL,CAASY,CAAC,CAACY,KAAX,EAAkBE,CAAC,CAACN,CAApB,CAAV;AACA,WAAOR,CAAP;AACD,GANM,EAMJM,IANI,CAAP;AAOD,CAfM;;;;AAiBA,IAAMS,UAAU,GAAG,SAAbA,UAAa,CAACC,IAAD,EAAOC,EAAP;AAAA,SAAcC,YAAY,CAACF,IAAD,EAAOC,EAAP,CAA1B;AAAA,CAAnB;;;;AAEA,IAAMC,YAAY,GAAG,SAAfA,YAAe,CAAClB,CAAD,EAAIC,CAAJ,EAAU;AACpC,6BAAU,CAAC,CAACD,CAAF,IAAO,CAAC,CAACC,CAAnB,EAAsB,qBAAtB;AACA,MAAMM,IAAI,GAAGtB,IAAI,CAACH,GAAL,CAASkB,CAAC,CAACQ,CAAX,EAAcP,CAAC,CAACO,CAAhB,CAAb;AACA,MAAMC,GAAG,GAAGxB,IAAI,CAACG,GAAL,CAASY,CAAC,CAACU,CAAX,EAAcT,CAAC,CAACS,CAAhB,CAAZ;AACA,MAAMC,MAAM,GAAG1B,IAAI,CAACH,GAAL,CAASkB,CAAC,CAACU,CAAX,EAAcT,CAAC,CAACS,CAAhB,CAAf;AACA,MAAME,KAAK,GAAG3B,IAAI,CAACG,GAAL,CAASY,CAAC,CAACQ,CAAX,EAAcP,CAAC,CAACO,CAAhB,CAAd;AACA,SAAO;AAAED,IAAAA,IAAI,EAAJA,IAAF;AAAQE,IAAAA,GAAG,EAAHA,GAAR;AAAaE,IAAAA,MAAM,EAANA,MAAb;AAAqBC,IAAAA,KAAK,EAALA;AAArB,GAAP;AACD,CAPM;;;;AASA,IAAMO,iBAAiB,GAAG,SAApBA,iBAAoB,CAACf,MAAD,EAAY;AAC3C,MAAMgB,YAAY,GAAG,2BAAUhB,MAAV,CAArB;AACAgB,EAAAA,YAAY,CAACrB,IAAb,CAAkB,UAACC,CAAD,EAAIC,CAAJ;AAAA,WAAUA,CAAC,CAACO,CAAF,GAAMR,CAAC,CAACQ,CAAlB;AAAA,GAAlB;AAEA,SAAO;AAAER,IAAAA,CAAC,EAAEoB,YAAY,CAAC,CAAD,CAAjB;AAAsBnB,IAAAA,CAAC,EAAEmB,YAAY,CAAC,CAAD;AAArC,GAAP;AACD,CALM;;;;AAOA,IAAMC,oBAAoB,GAAG,SAAvBA,oBAAuB,CAACrB,CAAD,EAAIC,CAAJ;AAAA,SAAW;AAC7CO,IAAAA,CAAC,EAAE,CAACR,CAAC,CAACQ,CAAF,GAAMP,CAAC,CAACO,CAAT,IAAc,CAD4B;AAE7CE,IAAAA,CAAC,EAAE,CAACV,CAAC,CAACU,CAAF,GAAMT,CAAC,CAACS,CAAT,IAAc;AAF4B,GAAX;AAAA,CAA7B;;;;AAKA,IAAMY,WAAW,GAAG,SAAdA,WAAc,CAACC,MAAD;AAAA,SAAYC,UAAU,CAACD,MAAM,CAACE,OAAP,CAAe,CAAf,CAAD,CAAtB;AAAA,CAApB;;;;AAEA,IAAMC,QAAQ,GAAG,SAAXA,QAAW,CAACC,EAAD,EAAKC,EAAL;AAAA,SACtBD,EAAE,IAAIC,EAAN,KAAaN,WAAW,CAACK,EAAE,CAACnB,CAAJ,CAAX,KAAsBc,WAAW,CAACM,EAAE,CAACpB,CAAJ,CAAjC,IAA2Cc,WAAW,CAACK,EAAE,CAACjB,CAAJ,CAAX,KAAsBY,WAAW,CAACM,EAAE,CAAClB,CAAJ,CAAzF,CADsB;AAAA,CAAjB;;;;AAGA,IAAMmB,WAAW,GAAG,SAAdA,WAAc,CAACF,EAAD,EAAKC,EAAL;AAAA,SACzBD,EAAE,IACFC,EADA,IAEA,yBACE;AACEpB,IAAAA,CAAC,EAAEc,WAAW,CAACK,EAAE,CAACnB,CAAJ,CADhB;AAEEE,IAAAA,CAAC,EAAEY,WAAW,CAACK,EAAE,CAACjB,CAAJ;AAFhB,GADF,EAKE;AACEF,IAAAA,CAAC,EAAEc,WAAW,CAACM,EAAE,CAACpB,CAAJ,CADhB;AAEEE,IAAAA,CAAC,EAAEY,WAAW,CAACM,EAAE,CAAClB,CAAJ;AAFhB,GALF,CAHyB;AAAA,CAApB;;;;AAcP,IAAMoB,uBAAuB,GAAG,SAA1BA,uBAA0B,CAACC,IAAD,EAAOC,IAAP,EAAgB;AAC9C,MAAQlD,GAAR,GAA2BiD,IAA3B,CAAQjD,GAAR;AAAA,MAAaM,GAAb,GAA2B2C,IAA3B,CAAa3C,GAAb;AAAA,MAAkBD,IAAlB,GAA2B4C,IAA3B,CAAkB5C,IAAlB;AACA,MAAM8C,SAAS,GAAG,CAAC7C,GAAG,GAAGN,GAAP,IAAcK,IAAhC;AAEA,SAAO6C,IAAI,GAAGC,SAAd;AACD,CALD;;AAOO,IAAMC,mBAAmB,GAAG,SAAtBA,mBAAsB,CAACC,UAAD,EAAgB;AACjD,MACEC,MADF,GAIID,UAJJ,CACEC,MADF;AAAA,MAEEC,KAFF,GAIIF,UAJJ,CAEEE,KAFF;AAAA,yBAIIF,UAJJ,CAGEH,IAHF;AAAA,MAGUM,KAHV,oBAGUA,KAHV;AAAA,MAGiBC,MAHjB,oBAGiBA,MAHjB,CADiD,CAOjD;;AACA,SAAOT,uBAAuB,CAACM,MAAD,EAASE,KAAT,CAAvB,GAAyC,EAAzC,IAA+CR,uBAAuB,CAACO,KAAD,EAAQE,MAAR,CAAvB,GAAyC,EAA/F;AACD,CATM;;;;AAWA,IAAMC,sBAAsB,GAAG,SAAzBA,sBAAyB,CAACL,UAAD,EAAgB;AACpD,MACEC,MADF,GAIID,UAJJ,CACEC,MADF;AAAA,MAEEC,KAFF,GAIIF,UAJJ,CAEEE,KAFF;AAAA,0BAIIF,UAJJ,CAGEH,IAHF;AAAA,MAGUM,KAHV,qBAGUA,KAHV;AAAA,MAGiBC,MAHjB,qBAGiBA,MAHjB;AAKA,MAAME,mBAAmB,GAAGX,uBAAuB,CAACM,MAAD,EAASE,KAAT,CAAnD;AACA,MAAMI,kBAAkB,GAAGZ,uBAAuB,CAACO,KAAD,EAAQE,MAAR,CAAlD,CAPoD,CASpD;;AACA,MAAMI,aAAa,GAAGP,MAAM,CAACjD,IAAP,IAAesD,mBAAmB,GAAG,EAArC,CAAtB;AACA,MAAMG,YAAY,GAAGP,KAAK,CAAClD,IAAN,IAAcuD,kBAAkB,GAAG,EAAnC,CAArB;AAEA,SAAO;AACLN,IAAAA,MAAM,EAAE;AACNtD,MAAAA,GAAG,EAAEsD,MAAM,CAACtD,GAAP,GAAa6D,aADZ;AAENvD,MAAAA,GAAG,EAAEgD,MAAM,CAAChD,GAAP,GAAauD;AAFZ,KADH;AAKLN,IAAAA,KAAK,EAAE;AACLvD,MAAAA,GAAG,EAAEuD,KAAK,CAACvD,GAAN,GAAY8D,YADZ;AAELxD,MAAAA,GAAG,EAAEiD,KAAK,CAACjD,GAAN,GAAYwD;AAFZ;AALF,GAAP;AAUD,CAvBM;;;;AAyBP,IAAMC,UAAU,GAAG,SAAbA,UAAa,CAACC,KAAD;AAAA,SAAW,CAACA,KAAK,IAAI,EAAV,EAAc/C,IAAd,CAAmB,UAACC,CAAD,EAAIC,CAAJ;AAAA,WAAUD,CAAC,CAACQ,CAAF,GAAMP,CAAC,CAACO,CAAR,IAAaR,CAAC,CAACU,CAAF,GAAMT,CAAC,CAACS,CAA/B;AAAA,GAAnB,CAAX;AAAA,CAAnB,C,CAEA;;;AACA,IAAMqC,iBAAiB,GAAG,SAApBA,iBAAoB,CAAC/C,CAAD,EAAIC,CAAJ,EAAO+C,CAAP;AAAA,SAAa,CAAChD,CAAC,CAACQ,CAAF,GAAMP,CAAC,CAACO,CAAT,KAAewC,CAAC,CAACtC,CAAF,GAAMT,CAAC,CAACS,CAAvB,MAA8B,CAACsC,CAAC,CAACxC,CAAF,GAAMP,CAAC,CAACO,CAAT,KAAeR,CAAC,CAACU,CAAF,GAAMT,CAAC,CAACS,CAAvB,CAA3C;AAAA,CAA1B,C,CAEA;;;AACA,IAAMuC,UAAU,GAAG,SAAbA,UAAa,CAACC,KAAD,EAAQC,KAAR;AAAA,SACjBJ,iBAAiB,CAACG,KAAK,CAAClC,IAAP,EAAamC,KAAK,CAACnC,IAAnB,EAAyBmC,KAAK,CAAClC,EAA/B,CAAjB,IAAuD8B,iBAAiB,CAACG,KAAK,CAACjC,EAAP,EAAWkC,KAAK,CAACnC,IAAjB,EAAuBmC,KAAK,CAAClC,EAA7B,CADvD;AAAA,CAAnB;;AAGO,IAAMmC,gBAAgB,GAAG,SAAnBA,gBAAmB,CAACC,IAAD,EAAOC,KAAP,EAAcC,OAAd,EAA0B;AACxD,MAAQC,IAAR,GAA2BH,IAA3B,CAAQG,IAAR;AAAA,MAAcC,QAAd,GAA2BJ,IAA3B,CAAcI,QAAd;;AAEA,MAAIA,QAAJ,EAAc;AACZ,WAAO,KAAP;AACD;;AAED,MAAMC,aAAa,GAAG,CAACJ,KAAK,IAAI,EAAV,EAAcjE,MAAd,CAAqB,UAACsE,CAAD;AAAA,WAAOA,CAAC,CAACH,IAAF,KAAWA,IAAX,IAAmB,CAACG,CAAC,CAACF,QAA7B;AAAA,GAArB,CAAtB;AACA,MAAMG,KAAK,GAAGF,aAAa,CAACG,SAAd,CAAwB,UAACF,CAAD;AAAA,WAAO,yBAAQA,CAAR,EAAWJ,OAAX,CAAP;AAAA,GAAxB,CAAd;;AAEA,MAAIK,KAAK,KAAK,CAAC,CAAf,EAAkB;AAChBF,IAAAA,aAAa,CAACI,MAAd,CAAqBF,KAArB,EAA4B,CAA5B;AACD;;AAED,MAAMG,UAAU,GAAGL,aAAa,CAACM,IAAd,CAAmB,UAACL,CAAD,EAAO;AAC3C,QAAIH,IAAI,KAAK,MAAb,EAAqB;AACnB,UAAQxC,IAAR,GAAqBqC,IAArB,CAAQrC,IAAR;AAAA,UAAcC,EAAd,GAAqBoC,IAArB,CAAcpC,EAAd;AACA,aACGY,WAAW,CAACb,IAAD,EAAO2C,CAAC,CAAC3C,IAAT,CAAX,IAA6Ba,WAAW,CAACZ,EAAD,EAAK0C,CAAC,CAAC1C,EAAP,CAAzC,IACCY,WAAW,CAACb,IAAD,EAAO2C,CAAC,CAAC1C,EAAT,CAAX,IAA2BY,WAAW,CAACZ,EAAD,EAAK0C,CAAC,CAAC3C,IAAP,CADvC,IAECwC,IAAI,KAAK,MAAT,IAAmBP,UAAU,CAACU,CAAD,EAAIN,IAAJ,CAHhC;AAKD,KAPD,MAOO,IAAIG,IAAI,KAAK,SAAb,EAAwB;AAC7B,aAAO,yBAAQX,UAAU,CAAC,2BAAUQ,IAAI,CAACjD,MAAf,CAAD,CAAlB,EAA4CyC,UAAU,CAAC,2BAAUc,CAAC,CAACvD,MAAZ,CAAD,CAAtD,CAAP;AACD;AACF,GAXkB,CAAnB;AAaA,SAAO,CAAC,CAAC2D,UAAT;AACD,CA5BM;;;;AA8BA,IAAME,uBAAuB,GAAG,SAA1BA,uBAA0B,CAACC,MAAD,EAASC,MAAT,EAAoB;AACzD;AACA,MAAID,MAAM,CAACvE,MAAP,KAAkBwE,MAAM,CAACxE,MAA7B,EAAqC;AACnC,WAAO,KAAP;AACD,GAJwD,CAKzD;;;AACA,OAAK,IAAIyE,CAAC,GAAG,CAAb,EAAgBA,CAAC,GAAGF,MAAM,CAACvE,MAA3B,EAAmCyE,CAAC,EAApC,EAAwC;AACtC;AACA,QAAMC,IAAI,GAAGH,MAAM,CAACE,CAAD,CAAnB;AACA,QAAME,IAAI,GAAGH,MAAM,CAACC,CAAD,CAAnB,CAHsC,CAItC;;AACA,QAAIG,MAAM,CAACC,IAAP,CAAYH,IAAZ,EAAkB1E,MAAlB,KAA6B4E,MAAM,CAACC,IAAP,CAAYF,IAAZ,EAAkB3E,MAAnD,EAA2D;AACzD,aAAO,KAAP;AACD,KAPqC,CAQtC;;;AACA,SAAK,IAAM8E,GAAX,IAAkBJ,IAAlB,EAAwB;AACtB;AACA,UAAIA,IAAI,CAACI,GAAD,CAAJ,KAAcH,IAAI,CAACG,GAAD,CAAtB,EAA6B;AAC3B,eAAO,KAAP;AACD;AACF;AACF,GArBwD,CAsBzD;;;AACA,SAAO,IAAP;AACD,CAxBM","sourcesContent":["import head from 'lodash/head';\nimport tail from 'lodash/tail';\nimport { utils } from '../plot';\nimport invariant from 'invariant';\nimport isEqual from 'lodash/isEqual';\nimport isEmpty from 'lodash/isEmpty';\nimport cloneDeep from 'lodash/cloneDeep';\n\nexport const bounds = utils.bounds;\nexport const point = utils.point;\n\n//TODO: This can be removed?\nexport const getAngleDeg = () => 0;\n//TODO: This can be removed?\nexport const arrowDimensions = () => 0;\n\nexport const getTickValues = (prop) => {\n  const tickValues = [];\n  let tickVal = 0;\n\n  while (tickVal >= prop.min && tickValues.indexOf(tickVal) < 0) {\n    tickValues.push(tickVal);\n    tickVal = Math.round((tickVal - prop.step) * 10000) / 10000;\n  }\n\n  tickVal = Math.round(prop.step * 10000) / 10000;\n\n  while (tickVal <= prop.max && tickValues.indexOf(tickVal) < 0) {\n    tickValues.push(tickVal);\n    tickVal = Math.round((tickVal + prop.step) * 10000) / 10000;\n  }\n\n  // return only ticks that are inside the min-max interval\n  if (tickValues) {\n    return tickValues.filter((tV) => tV >= prop.min && tV <= prop.max);\n  }\n\n  return [];\n};\n\nexport const countWords = (label) => {\n  if (label == null || isEmpty(label)) {\n    return 1;\n  }\n\n  const words = label.split(' ');\n  return words.length;\n};\n\n// findLongestWord is also used in plot\nexport const findLongestWord = (label) => {\n  let longestWord = (label || '')\n    .replace(/<[^>]+>/g, '')\n    .split(' ')\n    .sort((a, b) => b.length - a.length);\n\n  return longestWord[0].length;\n};\n\n// amountToIncreaseWidth is also used in plot\nexport const amountToIncreaseWidth = (longestWord) => {\n  if (!longestWord) {\n    return 0;\n  }\n\n  return longestWord * 10;\n};\n\nexport const polygonToArea = (points) => {\n  const h = head(points);\n  const area = {\n    left: h.x,\n    top: h.y,\n    bottom: h.y,\n    right: h.x,\n  };\n  return tail(points).reduce((a, p) => {\n    a.left = Math.min(a.left, p.x);\n    a.top = Math.max(a.top, p.y);\n    a.bottom = Math.min(a.bottom, p.y);\n    a.right = Math.max(a.right, p.x);\n    return a;\n  }, area);\n};\n\nexport const lineToArea = (from, to) => pointsToArea(from, to);\n\nexport const pointsToArea = (a, b) => {\n  invariant(!!a && !!b, 'a or b is undefined');\n  const left = Math.min(a.x, b.x);\n  const top = Math.max(a.y, b.y);\n  const bottom = Math.min(a.y, b.y);\n  const right = Math.max(a.x, b.x);\n  return { left, top, bottom, right };\n};\n\nexport const getRightestPoints = (points) => {\n  const sortedPoints = cloneDeep(points);\n  sortedPoints.sort((a, b) => b.x - a.x);\n\n  return { a: sortedPoints[0], b: sortedPoints[1] };\n};\n\nexport const getMiddleOfTwoPoints = (a, b) => ({\n  x: (a.x + b.x) / 2,\n  y: (a.y + b.y) / 2,\n});\n\nexport const roundNumber = (number) => parseFloat(number.toFixed(4));\n\nexport const sameAxes = (p1, p2) =>\n  p1 && p2 && (roundNumber(p1.x) === roundNumber(p2.x) || roundNumber(p1.y) === roundNumber(p2.y));\n\nexport const equalPoints = (p1, p2) =>\n  p1 &&\n  p2 &&\n  isEqual(\n    {\n      x: roundNumber(p1.x),\n      y: roundNumber(p1.y),\n    },\n    {\n      x: roundNumber(p2.x),\n      y: roundNumber(p2.y),\n    },\n  );\n\nconst getDistanceBetweenTicks = (axis, size) => {\n  const { min, max, step } = axis;\n  const nbOfTicks = (max - min) / step;\n\n  return size / nbOfTicks;\n};\n\nexport const thinnerShapesNeeded = (graphProps) => {\n  const {\n    domain,\n    range,\n    size: { width, height },\n  } = graphProps;\n\n  // 14 is the default width of a point\n  return getDistanceBetweenTicks(domain, width) < 14 || getDistanceBetweenTicks(range, height) < 14;\n};\n\nexport const getAdjustedGraphLimits = (graphProps) => {\n  const {\n    domain,\n    range,\n    size: { width, height },\n  } = graphProps;\n  const domainTicksDistance = getDistanceBetweenTicks(domain, width);\n  const rangeTicksDistance = getDistanceBetweenTicks(range, height);\n\n  // 15 is the distance required for the arrow to extend the graph\n  const domainPadding = domain.step / (domainTicksDistance / 15);\n  const rangePadding = range.step / (rangeTicksDistance / 15);\n\n  return {\n    domain: {\n      min: domain.min - domainPadding,\n      max: domain.max + domainPadding,\n    },\n    range: {\n      min: range.min - rangePadding,\n      max: range.max + rangePadding,\n    },\n  };\n};\n\nconst sortPoints = (array) => (array || []).sort((a, b) => a.x - b.x || a.y - b.y);\n\n// check colliniarity of 3 points (source: https://www.geeksforgeeks.org/program-check-three-points-collinear/)\nconst checkCollinearity = (a, b, c) => (a.x - b.x) * (c.y - b.y) === (c.x - b.x) * (a.y - b.y);\n\n// 2 lines are overlapping if all 4 points are collinear\nconst isSameLine = (markA, markB) =>\n  checkCollinearity(markA.from, markB.from, markB.to) && checkCollinearity(markA.to, markB.from, markB.to);\n\nexport const isDuplicatedMark = (mark, marks, oldMark) => {\n  const { type, building } = mark;\n\n  if (building) {\n    return false;\n  }\n\n  const filteredMarks = (marks || []).filter((m) => m.type === type && !m.building);\n  const index = filteredMarks.findIndex((m) => isEqual(m, oldMark));\n\n  if (index !== -1) {\n    filteredMarks.splice(index, 1);\n  }\n\n  const duplicated = filteredMarks.find((m) => {\n    if (type === 'line') {\n      const { from, to } = mark;\n      return (\n        (equalPoints(from, m.from) && equalPoints(to, m.to)) ||\n        (equalPoints(from, m.to) && equalPoints(to, m.from)) ||\n        (type === 'line' && isSameLine(m, mark))\n      );\n    } else if (type === 'polygon') {\n      return isEqual(sortPoints(cloneDeep(mark.points)), sortPoints(cloneDeep(m.points)));\n    }\n  });\n\n  return !!duplicated;\n};\n\nexport const areArraysOfObjectsEqual = (array1, array2) => {\n  // Check if both arrays have the same length\n  if (array1.length !== array2.length) {\n    return false;\n  }\n  // Iterate through each object in the arrays\n  for (let i = 0; i < array1.length; i++) {\n    // Get the current objects in both arrays\n    const obj1 = array1[i];\n    const obj2 = array2[i];\n    // Check if the objects have the same number of properties\n    if (Object.keys(obj1).length !== Object.keys(obj2).length) {\n      return false;\n    }\n    // Iterate through each property in the objects\n    for (const key in obj1) {\n      // Check if the properties and their values are equal\n      if (obj1[key] !== obj2[key]) {\n        return false;\n      }\n    }\n  }\n  // If all objects are equal, the arrays are the same\n  return true;\n};\n"],"file":"utils.js"}

package/configure/node_modules/@pie-element/multiple-choice/node_modules/@pie-lib/pie-toolbox/code/graphing-utils/index.js

@@ -0,0 +1,343 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.xPoints = exports.sinY = exports.pointsToAForAbsolute = exports.pointsToABForExponential = exports.pointsToABC = exports.parabolaFromTwoPoints = exports.parabolaFromThreePoints = exports.parabola = exports.getAmplitudeAndFreq = exports.exponentialFromTwoPoints = exports.exponential = exports["default"] = exports.buildDataPoints = exports.absoluteFromTwoPoints = exports.absolute = exports.FREQ_DIVIDER = void 0;
+
+var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
+
+var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
+
+var _debug = _interopRequireDefault(require("debug"));
+
+var _pointGeometry = _interopRequireDefault(require("@mapbox/point-geometry"));
+
+var _lodash = _interopRequireDefault(require("lodash"));
+
+function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); enumerableOnly && (symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; })), keys.push.apply(keys, symbols); } return keys; }
+
+function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = null != arguments[i] ? arguments[i] : {}; i % 2 ? ownKeys(Object(source), !0).forEach(function (key) { (0, _defineProperty2["default"])(target, key, source[key]); }) : Object.getOwnPropertyDescriptors ? Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)) : ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } return target; }
+
+var log = (0, _debug["default"])('pie-lib:graphing:tools:utils');
+var FREQ_DIVIDER = 16;
+exports.FREQ_DIVIDER = FREQ_DIVIDER;
+
+var getAmplitudeAndFreq = function getAmplitudeAndFreq(root, edge) {
+  if (!edge) {
+    return {
+      freq: 0,
+      amplitude: 0
+    };
+  }
+
+  if (root.x == edge.x) {
+    return {
+      freq: 0,
+      amplitude: 0
+    };
+  }
+
+  var r = new _pointGeometry["default"](root.x, root.y);
+  var e = new _pointGeometry["default"](edge.x, edge.y);
+  var d = e.sub(r); // edge point describes 1/4 of the freq
+
+  return {
+    freq: d.x * 4,
+    amplitude: d.y
+  };
+};
+/**
+ * build the x points with root as the anchor.
+ */
+
+
+exports.getAmplitudeAndFreq = getAmplitudeAndFreq;
+
+var xPoints = function xPoints(root, freq, min, max) {
+  freq = Math.abs(freq);
+  log('[xPoints] root:', root, 'freq:', freq, ' min:', min, ' max:', max);
+
+  var leftpoints = _lodash["default"].rangeRight(root, min - freq, freq * -1);
+
+  var rightpoints = _lodash["default"].range(root + freq, max + freq, freq);
+
+  return _lodash["default"].concat(leftpoints, rightpoints);
+};
+/**
+ * Calculate y for x value using amp, freq and shift
+ * https://www.desmos.com/calculator/f1psfoiiv6
+ */
+
+
+exports.xPoints = xPoints;
+
+var sinY = function sinY(amplitude, freq, shift) {
+  return function (x) {
+    shift = _objectSpread({
+      phase: 0,
+      vertical: 0
+    }, shift);
+    var TWO_PI = Math.PI * 2;
+    var num = TWO_PI * (x - shift.phase);
+    var frac = num / freq;
+    var sin = Math.sin(frac);
+    var sinFloat = parseFloat(sin).toFixed(10);
+    return amplitude * sinFloat + shift.vertical;
+  };
+};
+/**
+ * You need three points for the quadratic eq, so we mirror the edge point
+ * https://www.desmos.com/calculator/xhz1xqgpca
+ */
+
+
+exports.sinY = sinY;
+
+var parabolaFromTwoPoints = function parabolaFromTwoPoints(root, edge) {
+  edge = edge || _objectSpread({}, root);
+  var mirrorEdge = {
+    x: root.x - (edge.x - root.x),
+    y: edge.y
+  };
+  return parabolaFromThreePoints(root, edge, mirrorEdge);
+};
+
+exports.parabolaFromTwoPoints = parabolaFromTwoPoints;
+
+var parabolaFromThreePoints = function parabolaFromThreePoints(one, two, three) {
+  log(one, two, three);
+
+  var _pointsToABC = pointsToABC(one, two, three),
+      a = _pointsToABC.a,
+      b = _pointsToABC.b,
+      c = _pointsToABC.c;
+
+  log(a, b, c);
+  return parabola(a, b, c);
+};
+/** derive a,b,c from the 3 points */
+
+
+exports.parabolaFromThreePoints = parabolaFromThreePoints;
+
+var pointsToABC = function pointsToABC(one, two, three) {
+  var a1 = Math.pow(one.x, 2) * -1 + Math.pow(two.x, 2);
+  var b1 = one.x * -1 + two.x;
+  var d1 = one.y * -1 + two.y;
+  var a2 = Math.pow(two.x, 2) * -1 + Math.pow(three.x, 2);
+  var b2 = two.x * -1 + three.x;
+  var d2 = two.y * -1 + three.y;
+  var bMult = b2 / b1 * -1;
+  var a3 = bMult * a1 + a2;
+  var d3 = bMult * d1 + d2;
+  var a = d3 / a3;
+  var b = (d1 - a1 * a) / b1;
+  var c = one.y - a * Math.pow(one.x, 2) - b * one.x;
+  return {
+    a: a,
+    b: b,
+    c: c
+  };
+};
+/**
+ * y=ax^2+bx+c
+ */
+
+
+exports.pointsToABC = pointsToABC;
+
+var parabola = function parabola(a, b, c) {
+  return function (x) {
+    return a * Math.pow(x, 2) + b * x + c;
+  };
+};
+/**
+ * Absolute value from two points Root (Vertex) the point where the two rays intersect and edge One point on a ray.
+ * @param root 1st point selected on graph
+ * @param edge 2nd point selected on graph
+ * https://www.desmos.com/calculator/rarxiatpip
+ */
+
+
+exports.parabola = parabola;
+
+var absoluteFromTwoPoints = function absoluteFromTwoPoints(root, edge) {
+  edge = edge || _objectSpread({}, root);
+  var a = pointsToAForAbsolute(root, edge);
+  return absolute(a, root.x, root.y);
+};
+/*
+ * Finds value of a in y=a*abs(x-h)+k function
+ * @param one 1st point
+ * @param two 2nd point
+ * */
+
+
+exports.absoluteFromTwoPoints = absoluteFromTwoPoints;
+
+var pointsToAForAbsolute = function pointsToAForAbsolute(one, two) {
+  var y1 = two.y - one.y;
+  var x1 = two.x - one.x;
+  var a = y1 / x1;
+
+  if (two.x < one.x) {
+    a = a * -1;
+  }
+
+  return a;
+};
+/**
+ * y=a*abs(x-h)+k
+ */
+
+
+exports.pointsToAForAbsolute = pointsToAForAbsolute;
+
+var absolute = function absolute(a, h, k) {
+  return function (x) {
+    return a * Math.abs(x - h) + k;
+  };
+};
+/**
+ * Exponential from two points on exponential graph.
+ * @param root 1st point selected on graph
+ * @param edge 2nd point selected on graph
+ * https://www.desmos.com/calculator/3fisjexbvp
+ */
+
+
+exports.absolute = absolute;
+
+var exponentialFromTwoPoints = function exponentialFromTwoPoints(root, edge) {
+  edge = edge || _objectSpread({}, root);
+
+  var _pointsToABForExponen = pointsToABForExponential(root, edge),
+      a = _pointsToABForExponen.a,
+      b = _pointsToABForExponen.b;
+
+  return exponential(a, b);
+};
+/*
+ * Finds value of a and b in y=a*(b)^x function
+ * @param one 1st point
+ * @param two 2nd point
+ * */
+
+
+exports.exponentialFromTwoPoints = exponentialFromTwoPoints;
+
+var pointsToABForExponential = function pointsToABForExponential(one, two) {
+  var p = one.y / two.y;
+  var r = 1 / (one.x - two.x);
+  var b = Math.pow(p, r);
+  var a = one.y / Math.pow(b, one.x);
+  return {
+    a: a,
+    b: b
+  };
+};
+/**
+ * y=a*(b)^x
+ */
+
+
+exports.pointsToABForExponential = pointsToABForExponential;
+
+var exponential = function exponential(a, b) {
+  return function (x) {
+    return a * Math.pow(b, x);
+  };
+};
+/**
+ * Generate a set of data points, add spacing before min and after max if there is space between minx + min and maxX and max
+ * @param {*} domain
+ * @param {*} range
+ * @param {*} root
+ * @param {*} edge
+ * @param {*} yFn
+ * @param {*} excludeOutsidePoints
+ */
+
+
+exports.exponential = exponential;
+
+var buildDataPoints = function buildDataPoints(domain, range, root, edge, yFn) {
+  var excludeOutsidePoints = arguments.length > 5 && arguments[5] !== undefined ? arguments[5] : false;
+  log('[buildDataPoints] domain:', domain, 'range:', range, 'root:', root, 'edge:', edge);
+  domain = _objectSpread({
+    min: 0,
+    max: 0,
+    step: 1
+  }, domain);
+  range = _objectSpread({
+    min: 0,
+    max: 0,
+    step: 1
+  }, range);
+  edge = edge ? edge : _objectSpread({}, root);
+  var minX = Math.min(root.x, edge.x);
+  var xPts = xPoints(minX, domain.step, domain.min - domain.step, domain.max + domain.step);
+  log('[buildDataPoints]:xPts:', xPts);
+  var startIndex = -1;
+  var endIndex = -1; // generate points based on the yFn
+
+  var points = xPts.map(function (v) {
+    return new _pointGeometry["default"](v, yFn(v));
+  });
+
+  if (!excludeOutsidePoints) {
+    return points;
+  } // exclude the points with y outside range min and max
+
+
+  var filteredPoints = points.reduce(function (acc, val, index) {
+    if (val.y >= range.min - range.step && val.y <= range.max + range.step) {
+      if (startIndex === -1) {
+        startIndex = index;
+      }
+
+      if (endIndex < index) {
+        endIndex = index;
+      }
+
+      return [].concat((0, _toConsumableArray2["default"])(acc), [val]);
+    }
+
+    return acc;
+  }, []); // add the first value outside range min and max smaller than range.min if exists
+
+  if (startIndex - 1 >= 0) {
+    filteredPoints.unshift(points[startIndex - 1]);
+  } // add the first value outside range min and max greater than range.min if exists
+
+
+  if (endIndex + 1 <= points.length - 1) {
+    filteredPoints.push(points[endIndex + 1]);
+  }
+
+  return points;
+};
+
+exports.buildDataPoints = buildDataPoints;
+var _default = {
+  FREQ_DIVIDER: FREQ_DIVIDER,
+  getAmplitudeAndFreq: getAmplitudeAndFreq,
+  xPoints: xPoints,
+  sinY: sinY,
+  parabolaFromTwoPoints: parabolaFromTwoPoints,
+  parabolaFromThreePoints: parabolaFromThreePoints,
+  pointsToABC: pointsToABC,
+  parabola: parabola,
+  absoluteFromTwoPoints: absoluteFromTwoPoints,
+  pointsToAForAbsolute: pointsToAForAbsolute,
+  absolute: absolute,
+  exponentialFromTwoPoints: exponentialFromTwoPoints,
+  pointsToABForExponential: pointsToABForExponential,
+  exponential: exponential,
+  buildDataPoints: buildDataPoints
+};
+exports["default"] = _default;
+//# sourceMappingURL=index.js.map