@khanacademy/kmath 0.0.0-PR862-20231207182234 → 0.0.0-PR875-20250222011102

package/dist/es/index.js

@@ -1,9 +1,53 @@
-import { addLibraryVersionToPerseusDebug } from '@khanacademy/perseus-core';
 import _ from 'underscore';
+import { approximateEqual, approximateDeepEqual } from '@khanacademy/perseus-core';
+import { point as point$1, sum as sum$1, number as number$1 } from '@khanacademy/kmath';
+import $ from 'jquery';
+
+/**
+ * Adds the given perseus library version information to the __perseus_debug__
+ * object and ensures that the object is attached to `globalThis` (`window` in
+ * browser environments).
+ *
+ * This allows each library to provide runtime version information to assist in
+ * debugging in production environments.
+ */
+const addLibraryVersionToPerseusDebug = (libraryName, libraryVersion) => {
+  // If the library version is the default value, then we don't want to
+  // prefix it with a "v" to indicate that it is a version number.
+  let prefix = "v";
+  if (libraryVersion === "__lib_version__") {
+    prefix = "";
+  }
+  const formattedVersion = `${prefix}${libraryVersion}`;
+  if (typeof globalThis !== "undefined") {
+    var _globalThis$__perseus;
+    globalThis.__perseus_debug__ = (_globalThis$__perseus = globalThis.__perseus_debug__) != null ? _globalThis$__perseus : {};
+    const existingVersionEntry = globalThis.__perseus_debug__[libraryName];
+    if (existingVersionEntry) {
+      // If we already have an entry and it doesn't match the registered
+      // version, we morph the entry into an array and log a warning.
+      if (existingVersionEntry !== formattedVersion) {
+        // Existing entry might be an array already (oops, at least 2
+        // versions of the library already loaded!).
+        const allVersions = Array.isArray(existingVersionEntry) ? existingVersionEntry : [existingVersionEntry];
+        allVersions.push(formattedVersion);
+        globalThis.__perseus_debug__[libraryName] = allVersions;
+
+        // eslint-disable-next-line no-console
+        console.warn(`Multiple versions of ${libraryName} loaded on this page: ${allVersions.sort().join(", ")}`);
+      }
+    } else {
+      globalThis.__perseus_debug__[libraryName] = formattedVersion;
+    }
+  } else {
+    // eslint-disable-next-line no-console
+    console.warn(`globalThis not found found (${formattedVersion})`);
+  }
+};
 
 // This file is processed by a Rollup plugin (replace) to inject the production
 const libName = "@khanacademy/kmath";
-const libVersion = "0.1.7";
+const libVersion = "0.3.5";
 addLibraryVersionToPerseusDebug(libName, libVersion);
 
 /**
@@ -32,7 +76,7 @@ function equal$4(x, y, tolerance) {
   }
   return Math.abs(x - y) < tolerance;
 }
-function sign(x, tolerance) /* Should be: 0 | 1 | -1 */{
+function sign$1(x, tolerance) /* Should be: 0 | 1 | -1 */{
   return equal$4(x, 0, tolerance) ? 0 : Math.abs(x) / x;
 }
 function isInteger(num, tolerance) {
@@ -101,7 +145,7 @@ var number = /*#__PURE__*/Object.freeze({
     EPSILON: EPSILON,
     is: is$2,
     equal: equal$4,
-    sign: sign,
+    sign: sign$1,
     isInteger: isInteger,
     round: round$2,
     roundTo: roundTo$2,
@@ -120,6 +164,17 @@ function arraySum(array) {
 function arrayProduct(array) {
   return array.reduce((memo, arg) => memo * arg, 1);
 }
+function zip(...arrays) {
+  const n = Math.min(...arrays.map(a => a.length));
+  const results = [];
+  for (let i = 0; i < n; i++) {
+    results.push(arrays.map(a => a[i]));
+  }
+  return results;
+}
+function map(pair, f) {
+  return [f(pair[0], 0), f(pair[1], 1)];
+}
 
 /**
  * Checks if the given vector contains only numbers and, optionally, is of the
@@ -129,8 +184,9 @@ function arrayProduct(array) {
  * is([1, "Hello", 3]) -> false
  * is([1, 2, 3], 1) -> false
  */
+
 function is$1(vec, dimension) {
-  if (!_.isArray(vec)) {
+  if (!Array.isArray(vec)) {
     return false;
   }
   if (dimension !== undefined && vec.length !== dimension) {
@@ -150,7 +206,7 @@ function length(v) {
 }
 // Dot product of two vectors
 function dot(a, b) {
-  const zipped = _.zip(a, b);
+  const zipped = zip(a, b);
   const multiplied = zipped.map(arrayProduct);
   return arraySum(multiplied);
 }
@@ -159,14 +215,14 @@ function dot(a, b) {
  *
  * add([1, 2], [3, 4]) -> [4, 6]
  */
-function add(...vecs) {
-  const zipped = _.zip(...vecs);
+function add$1(...vecs) {
+  const zipped = zip(...vecs);
   // @ts-expect-error - TS2322 - Type 'number[]' is not assignable to type 'V'.
   return zipped.map(arraySum);
 }
 function subtract(v1, v2) {
   // @ts-expect-error - TS2322 - Type 'number[]' is not assignable to type 'V'.
-  return _.zip(v1, v2).map(dim => dim[0] - dim[1]);
+  return zip(v1, v2).map(dim => dim[0] - dim[1]);
 }
 function negate(v) {
   // @ts-expect-error - TS2322 - Type 'number[]' is not assignable to type 'V'.
@@ -183,11 +239,7 @@ function scale(v1, scalar) {
   });
 }
 function equal$3(v1, v2, tolerance) {
-  // _.zip will nicely deal with the lengths, going through
-  // the length of the longest vector. knumber.equal then
-  // returns false for any number compared to the undefined
-  // passed in if one of the vectors is shorter.
-  return _.zip(v1, v2).every(pair => equal$4(pair[0], pair[1], tolerance));
+  return v1.length === v2.length && zip(v1, v2).every(pair => equal$4(pair[0], pair[1], tolerance));
 }
 function codirectional(v1, v2, tolerance) {
   // The origin is trivially codirectional with all other vectors.
@@ -200,7 +252,7 @@ function codirectional(v1, v2, tolerance) {
   v2 = normalize(v2);
   return equal$3(v1, v2, tolerance);
 }
-function collinear(v1, v2, tolerance) {
+function collinear$1(v1, v2, tolerance) {
   return codirectional(v1, v2, tolerance) || codirectional(v1, negate(v2), tolerance);
 }
 
@@ -275,6 +327,7 @@ function round$1(vec, precision) {
 }
 
 // Round each number to the nearest increment
+
 function roundTo$1(vec, increment) {
   // @ts-expect-error - TS2322 - Type 'number[]' is not assignable to type 'V'.
   return vec.map((elem, i) => roundTo$2(elem, increment[i] || increment));
@@ -288,19 +341,21 @@ function ceilTo$1(vec, increment) {
   return vec.map((elem, i) => ceilTo$2(elem, increment[i] || increment));
 }
 
-var vector = /*#__PURE__*/Object.freeze({
+var vector$1 = /*#__PURE__*/Object.freeze({
     __proto__: null,
+    zip: zip,
+    map: map,
     is: is$1,
     normalize: normalize,
     length: length,
     dot: dot,
-    add: add,
+    add: add$1,
     subtract: subtract,
     negate: negate,
     scale: scale,
     equal: equal$3,
     codirectional: codirectional,
-    collinear: collinear,
+    collinear: collinear$1,
     polarRadFromCart: polarRadFromCart$1,
     polarDegFromCart: polarDegFromCart$1,
     cartFromPolarRad: cartFromPolarRad$1,
@@ -328,14 +383,14 @@ function rotateRad(point, theta, center) {
   if (center === undefined) {
     return rotateRad$1(point, theta);
   } else {
-    return add(center, rotateRad$1(subtract(point, center), theta));
+    return add$1(center, rotateRad$1(subtract(point, center), theta));
   }
 }
 function rotateDeg(point, theta, center) {
   if (center === undefined) {
     return rotateDeg$1(point, theta);
   } else {
-    return add(center, rotateDeg$1(subtract(point, center), theta));
+    return add$1(center, rotateDeg$1(subtract(point, center), theta));
   }
 }
 
@@ -359,7 +414,7 @@ function reflectOverLine(point, line) {
   const pv = subtract(point, line[0]);
   const projectedPv = projection(pv, lv);
   const reflectedPv = subtract(scale(projectedPv, 2), pv);
-  return add(line[0], reflectedPv);
+  return add$1(line[0], reflectedPv);
 }
 
 /**
@@ -387,8 +442,8 @@ function compare(point1, point2, equalityTolerance) /* TODO: convert to -1 | 0 |
 const is = is$1;
 
 // Add and subtract vector(s)
-const addVector = add;
-const addVectors = add;
+const addVector = add$1;
+const addVectors = add$1;
 const subtractVector = subtract;
 const equal$2 = equal$3;
 
@@ -446,7 +501,7 @@ function equal$1(line1, line2, tolerance) {
   // Compare the directions of the lines
   const v1 = subtract(line1[1], line1[0]);
   const v2 = subtract(line2[1], line2[0]);
-  if (!collinear(v1, v2, tolerance)) {
+  if (!collinear$1(v1, v2, tolerance)) {
     return false;
   }
   // If the start point is the same for the two lines, then they are the same
@@ -456,7 +511,7 @@ function equal$1(line1, line2, tolerance) {
   // Make sure that the direction to get from line1 to
   // line2 is the same as the direction of the lines
   const line1ToLine2Vector = subtract(line2[0], line1[0]);
-  return collinear(v1, line1ToLine2Vector, tolerance);
+  return collinear$1(v1, line1ToLine2Vector, tolerance);
 }
 
 var line = /*#__PURE__*/Object.freeze({
@@ -487,5 +542,613 @@ var ray = /*#__PURE__*/Object.freeze({
     equal: equal
 });
 
-export { libVersion, line, number, point, ray, vector };
+/**
+ * A collection of geomtry-related utility functions
+ */
+
+// This should really be a readonly tuple of [number, number]
+
+// Given a number, return whether it is positive (1), negative (-1), or zero (0)
+function sign(val) {
+  if (approximateEqual(val, 0)) {
+    return 0;
+  }
+  return val > 0 ? 1 : -1;
+}
+
+// Determine whether three points are collinear (0), for a clockwise turn (negative),
+// or counterclockwise turn (positive)
+function ccw(a, b, c) {
+  return (b[0] - a[0]) * (c[1] - a[1]) - (c[0] - a[0]) * (b[1] - a[1]);
+}
+function collinear(a, b, c) {
+  return approximateEqual(ccw(a, b, c), 0);
+}
+
+// Given rect bounding points A and B, whether point C is inside the rect
+function pointInRect(a, b, c) {
+  return c[0] <= Math.max(a[0], b[0]) && c[0] >= Math.min(a[0], b[0]) && c[1] <= Math.max(a[1], b[1]) && c[1] >= Math.min(a[1], b[1]);
+}
+
+// Whether line segment AB intersects line segment CD
+// http://www.geeksforgeeks.org/check-if-two-given-line-segments-intersect/
+function intersects(ab, cd) {
+  const triplets = [[ab[0], ab[1], cd[0]], [ab[0], ab[1], cd[1]], [cd[0], cd[1], ab[0]], [cd[0], cd[1], ab[1]]];
+  const orientations = _.map(triplets, function (triplet) {
+    return sign(ccw(...triplet));
+  });
+  if (orientations[0] !== orientations[1] && orientations[2] !== orientations[3]) {
+    return true;
+  }
+  for (let i = 0; i < 4; i++) {
+    if (orientations[i] === 0 && pointInRect(...triplets[i])) {
+      return true;
+    }
+  }
+  return false;
+}
+
+// Whether any two sides of a polygon intersect each other
+function polygonSidesIntersect(vertices) {
+  for (let i = 0; i < vertices.length; i++) {
+    for (let k = i + 1; k < vertices.length; k++) {
+      // If any two vertices are the same point, sides overlap
+      if (point$1.equal(vertices[i], vertices[k])) {
+        return true;
+      }
+
+      // Find the other end of the sides starting at vertices i and k
+      const iNext = (i + 1) % vertices.length;
+      const kNext = (k + 1) % vertices.length;
+
+      // Adjacent sides always intersect (at the vertex); skip those
+      if (iNext === k || kNext === i) {
+        continue;
+      }
+      const side1 = [vertices[i], vertices[iNext]];
+      const side2 = [vertices[k], vertices[kNext]];
+      if (intersects(side1, side2)) {
+        return true;
+      }
+    }
+  }
+  return false;
+}
+function vector(a, b) {
+  return _.map(_.zip(a, b), function (pair) {
+    return pair[0] - pair[1];
+  });
+}
+function reverseVector(vector) {
+  return [-vector[0], -vector[1]];
+}
+
+// Returns whether connecting the given sequence of `points` forms a clockwise
+// path (assuming a closed loop, where the last point connects back to the
+// first).
+function clockwise(points) {
+  const segments = _.zip(points, points.slice(1).concat(points.slice(0, 1)));
+  const areas = _.map(segments, function (segment) {
+    const p1 = segment[0];
+    const p2 = segment[1];
+    return (p2[0] - p1[0]) * (p2[1] + p1[1]);
+  });
+  return sum$1(areas) > 0;
+}
+function magnitude(v) {
+  return Math.sqrt(_.reduce(v, function (memo, el) {
+    // @ts-expect-error - TS2345 - Argument of type 'Coord' is not assignable to parameter of type 'number'.
+    return memo + Math.pow(el, 2);
+  }, 0));
+}
+function dotProduct(a, b) {
+  return _.reduce(_.zip(a, b), function (memo, pair) {
+    return memo + pair[0] * pair[1];
+  }, 0);
+}
+function sideLengths(coords) {
+  const segments = _.zip(coords, rotate(coords));
+  return segments.map(function (segment) {
+    // @ts-expect-error - TS2345 - Argument of type 'number[]' is not assignable to parameter of type 'readonly Coord[]'. | TS2556 - A spread argument must either have a tuple type or be passed to a rest parameter.
+    return magnitude(vector(...segment));
+  });
+}
+
+// Based on http://math.stackexchange.com/a/151149
+function angleMeasures(coords) {
+  const triplets = _.zip(rotate(coords, -1), coords, rotate(coords, 1));
+  const offsets = _.map(triplets, function (triplet) {
+    const p = vector(triplet[1], triplet[0]);
+    const q = vector(triplet[2], triplet[1]);
+    // @ts-expect-error - TS2345 - Argument of type 'number[]' is not assignable to parameter of type 'Coord'. | TS2345 - Argument of type 'number[]' is not assignable to parameter of type 'readonly Coord[]'. | TS2345 - Argument of type 'number[]' is not assignable to parameter of type 'readonly Coord[]'.
+    const raw = Math.acos(dotProduct(p, q) / (magnitude(p) * magnitude(q)));
+    // @ts-expect-error - TS2556 - A spread argument must either have a tuple type or be passed to a rest parameter.
+    return sign(ccw(...triplet)) > 0 ? raw : -raw;
+  });
+  const sum = _.reduce(offsets, function (memo, arg) {
+    return memo + arg;
+  }, 0);
+  return _.map(offsets, function (offset) {
+    return sum > 0 ? Math.PI - offset : Math.PI + offset;
+  });
+}
+
+// Whether two polygons are similar (or if specified, congruent)
+function similar(coords1, coords2, tolerance) {
+  if (coords1.length !== coords2.length) {
+    return false;
+  }
+  const n = coords1.length;
+  const angles1 = angleMeasures(coords1);
+  const angles2 = angleMeasures(coords2);
+  const sides1 = sideLengths(coords1);
+  const sides2 = sideLengths(coords2);
+  for (let i = 0; i < 2 * n; i++) {
+    let angles = angles2.slice();
+    let sides = sides2.slice();
+
+    // Reverse angles and sides to allow matching reflected polygons
+    if (i >= n) {
+      angles.reverse();
+      sides.reverse();
+      // Since sides are calculated from two coordinates,
+      // simply reversing results in an off by one error
+      // @ts-expect-error - TS4104 - The type 'readonly number[]' is 'readonly' and cannot be assigned to the mutable type 'number[]'.
+      sides = rotate(sides, 1);
+    }
+
+    // @ts-expect-error - TS4104 - The type 'readonly number[]' is 'readonly' and cannot be assigned to the mutable type 'number[]'.
+    angles = rotate(angles, i);
+    // @ts-expect-error - TS4104 - The type 'readonly number[]' is 'readonly' and cannot be assigned to the mutable type 'number[]'.
+    sides = rotate(sides, i);
+    if (approximateDeepEqual(angles1, angles)) {
+      const sidePairs = _.zip(sides1, sides);
+      const factors = _.map(sidePairs, function (pair) {
+        return pair[0] / pair[1];
+      });
+      const same = _.all(factors, function (factor) {
+        return approximateEqual(factors[0], factor);
+      });
+      const congruentEnough = _.all(sidePairs, function (pair) {
+        return number$1.equal(pair[0], pair[1], tolerance);
+      });
+      if (same && congruentEnough) {
+        return true;
+      }
+    }
+  }
+  return false;
+}
+
+// Given triangle with sides ABC return angle opposite side C in degrees
+function lawOfCosines(a, b, c) {
+  return Math.acos((a * a + b * b - c * c) / (2 * a * b)) * 180 / Math.PI;
+}
+function canonicalSineCoefficients([amplitude, angularFrequency, phase, verticalOffset]) {
+  // For a curve of the form f(x) = a * Sin(b * x - c) + d,
+  // this function ensures that a, b > 0, and c is its
+  // smallest possible positive value.
+
+  // Guarantee a > 0
+  if (amplitude < 0) {
+    amplitude *= -1;
+    angularFrequency *= -1;
+    phase *= -1;
+  }
+  const period = 2 * Math.PI;
+  // Guarantee b > 0
+  if (angularFrequency < 0) {
+    angularFrequency *= -1;
+    phase *= -1;
+    phase += period / 2;
+  }
+
+  // Guarantee c is smallest possible positive value
+  while (phase > 0) {
+    phase -= period;
+  }
+  while (phase < 0) {
+    phase += period;
+  }
+  return [amplitude, angularFrequency, phase, verticalOffset];
+}
+
+// e.g. rotate([1, 2, 3]) -> [2, 3, 1]
+function rotate(array, n) {
+  n = typeof n === "undefined" ? 1 : n % array.length;
+  return array.slice(n).concat(array.slice(0, n));
+}
+function getLineEquation(first, second) {
+  if (approximateEqual(first[0], second[0])) {
+    return "x = " + first[0].toFixed(3);
+  }
+  const m = (second[1] - first[1]) / (second[0] - first[0]);
+  const b = first[1] - m * first[0];
+  return "y = " + m.toFixed(3) + "x + " + b.toFixed(3);
+}
+
+// Stolen from the wikipedia article
+// http://en.wikipedia.org/wiki/Line-line_intersection
+function getLineIntersection(
+// TODO(LP-10725): update these to be 2-tuples
+firstPoints, secondPoints) {
+  const x1 = firstPoints[0][0];
+  const y1 = firstPoints[0][1];
+  const x2 = firstPoints[1][0];
+  const y2 = firstPoints[1][1];
+  const x3 = secondPoints[0][0];
+  const y3 = secondPoints[0][1];
+  const x4 = secondPoints[1][0];
+  const y4 = secondPoints[1][1];
+  const determinant = (x1 - x2) * (y3 - y4) - (y1 - y2) * (x3 - x4);
+  if (Math.abs(determinant) < 1e-9) {
+    return "Lines are parallel";
+  }
+  const x = ((x1 * y2 - y1 * x2) * (x3 - x4) - (x1 - x2) * (x3 * y4 - y3 * x4)) / determinant;
+  const y = ((x1 * y2 - y1 * x2) * (y3 - y4) - (y1 - y2) * (x3 * y4 - y3 * x4)) / determinant;
+  return "Intersection: (" + x.toFixed(3) + ", " + y.toFixed(3) + ")";
+}
+
+var geometry = /*#__PURE__*/Object.freeze({
+    __proto__: null,
+    sign: sign,
+    ccw: ccw,
+    collinear: collinear,
+    intersects: intersects,
+    polygonSidesIntersect: polygonSidesIntersect,
+    vector: vector,
+    reverseVector: reverseVector,
+    clockwise: clockwise,
+    magnitude: magnitude,
+    angleMeasures: angleMeasures,
+    similar: similar,
+    lawOfCosines: lawOfCosines,
+    canonicalSineCoefficients: canonicalSineCoefficients,
+    rotate: rotate,
+    getLineEquation: getLineEquation,
+    getLineIntersection: getLineIntersection
+});
+
+// This file contains helper functions for working with angles.
+function convertDegreesToRadians(degrees) {
+  return degrees / 180 * Math.PI;
+}
+function convertRadiansToDegrees(radians) {
+  const degree = radians / Math.PI * 180;
+  // Account for floating point errors.
+  return Number(degree.toPrecision(15));
+}
+
+// Returns a value between -180 and 180, inclusive. The angle is measured
+// between the positive x-axis and the given vector.
+function calculateAngleInDegrees([x, y]) {
+  return Math.atan2(y, x) * 180 / Math.PI;
+}
+
+// Converts polar coordinates to cartesian. The th(eta) parameter is in degrees.
+function polar(r, th) {
+  if (typeof r === "number") {
+    r = [r, r];
+  }
+  th = th * Math.PI / 180;
+  return [r[0] * Math.cos(th), r[1] * Math.sin(th)];
+}
+// This function calculates the angle between two points and an optional vertex.
+// If the vertex is not provided, the angle is measured between the two points.
+// This does not account for reflex angles or clockwise position.
+const getAngleFromVertex = (point, vertex) => {
+  const x = point[0] - vertex[0];
+  const y = point[1] - vertex[1];
+  if (!x && !y) {
+    return 0;
+  }
+  return (180 + Math.atan2(-y, -x) * 180 / Math.PI + 360) % 360;
+};
+
+// This function calculates the clockwise angle between three points,
+// and is used to generate the labels and equation strings of the
+// current angle for the interactive graph.
+const getClockwiseAngle = (coords, allowReflexAngles = false) => {
+  const coordsCopy = [...coords];
+  // The coords are saved as [point1, vertex, point2] in the interactive graph
+  const areClockwise = clockwise([coordsCopy[0], coordsCopy[2], coordsCopy[1]]);
+
+  // We may need to reverse the coordinates if we allow
+  // reflex angles and the points are not in clockwise order.
+  const shouldReverseCoords = !areClockwise || allowReflexAngles;
+
+  // Reverse the coordinates accordingly to ensure the angle is calculated correctly
+  const clockwiseCoords = shouldReverseCoords ? coordsCopy.reverse() : coordsCopy;
+
+  // Calculate the angles between the two points and get the difference
+  // between the two angles to get the clockwise angle.
+  const startAngle = getAngleFromVertex(clockwiseCoords[0], clockwiseCoords[1]);
+  const endAngle = getAngleFromVertex(clockwiseCoords[2], clockwiseCoords[1]);
+  const angle = (startAngle + 360 - endAngle) % 360;
+  return angle;
+};
+
+var angles = /*#__PURE__*/Object.freeze({
+    __proto__: null,
+    convertDegreesToRadians: convertDegreesToRadians,
+    convertRadiansToDegrees: convertRadiansToDegrees,
+    calculateAngleInDegrees: calculateAngleInDegrees,
+    polar: polar,
+    getAngleFromVertex: getAngleFromVertex,
+    getClockwiseAngle: getClockwiseAngle
+});
+
+// TODO: there's another, very similar getSinusoidCoefficients function
+// they should probably be merged
+function getSinusoidCoefficients(coords) {
+  // It's assumed that p1 is the root and p2 is the first peak
+  const p1 = coords[0];
+  const p2 = coords[1];
+
+  // Resulting coefficients are canonical for this sine curve
+  const amplitude = p2[1] - p1[1];
+  const angularFrequency = Math.PI / (2 * (p2[0] - p1[0]));
+  const phase = p1[0] * angularFrequency;
+  const verticalOffset = p1[1];
+  return [amplitude, angularFrequency, phase, verticalOffset];
+}
+// TODO: there's another, very similar getQuadraticCoefficients function
+// they should probably be merged
+function getQuadraticCoefficients(coords) {
+  const p1 = coords[0];
+  const p2 = coords[1];
+  const p3 = coords[2];
+  const denom = (p1[0] - p2[0]) * (p1[0] - p3[0]) * (p2[0] - p3[0]);
+  if (denom === 0) {
+    // Many of the callers assume that the return value is always defined.
+    // @ts-expect-error - TS2322 - Type 'undefined' is not assignable to type 'QuadraticCoefficient'.
+    return;
+  }
+  const a = (p3[0] * (p2[1] - p1[1]) + p2[0] * (p1[1] - p3[1]) + p1[0] * (p3[1] - p2[1])) / denom;
+  const b = (p3[0] * p3[0] * (p1[1] - p2[1]) + p2[0] * p2[0] * (p3[1] - p1[1]) + p1[0] * p1[0] * (p2[1] - p3[1])) / denom;
+  const c = (p2[0] * p3[0] * (p2[0] - p3[0]) * p1[1] + p3[0] * p1[0] * (p3[0] - p1[0]) * p2[1] + p1[0] * p2[0] * (p1[0] - p2[0]) * p3[1]) / denom;
+  return [a, b, c];
+}
+
+var coefficients = /*#__PURE__*/Object.freeze({
+    __proto__: null,
+    getSinusoidCoefficients: getSinusoidCoefficients,
+    getQuadraticCoefficients: getQuadraticCoefficients
+});
+
+const KhanMath = {
+  // Simplify formulas before display
+  cleanMath: function (expr) {
+    return typeof expr === "string" ? expr.replace(/\+\s*-/g, "- ").replace(/-\s*-/g, "+ ").replace(/\^1/g, "") : expr;
+  },
+  // Bound a number by 1e-6 and 1e20 to avoid exponents after toString
+  bound: function (num) {
+    if (num === 0) {
+      return num;
+    }
+    if (num < 0) {
+      return -KhanMath.bound(-num);
+    }
+    return Math.max(1e-6, Math.min(num, 1e20));
+  },
+  factorial: function (x) {
+    if (x <= 1) {
+      return x;
+    }
+    return x * KhanMath.factorial(x - 1);
+  },
+  getGCD: function (a, b) {
+    if (arguments.length > 2) {
+      // TODO(kevinb): rewrite using rest args instead of arguments
+      // eslint-disable-next-line prefer-rest-params
+      const rest = [].slice.call(arguments, 1);
+      // @ts-expect-error - TS2556 - A spread argument must either have a tuple type or be passed to a rest parameter.
+      return KhanMath.getGCD(a, KhanMath.getGCD(...rest));
+    }
+    let mod;
+    a = Math.abs(a);
+    b = Math.abs(b);
+    while (b) {
+      mod = a % b;
+      a = b;
+      b = mod;
+    }
+    return a;
+  },
+  getLCM: function (a, b) {
+    if (arguments.length > 2) {
+      // TODO(kevinb): rewrite using rest args instead of arguments
+      // eslint-disable-next-line prefer-rest-params
+      const rest = [].slice.call(arguments, 1);
+      // @ts-expect-error - TS2556 - A spread argument must either have a tuple type or be passed to a rest parameter.
+      return KhanMath.getLCM(a, KhanMath.getLCM(...rest));
+    }
+    return Math.abs(a * b) / KhanMath.getGCD(a, b);
+  },
+  primes: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97],
+  isPrime: function (n) {
+    if (n <= 1) {
+      return false;
+    }
+    if (n < 101) {
+      return !!$.grep(KhanMath.primes, function (p, i) {
+        return Math.abs(p - n) <= 0.5;
+      }).length;
+    }
+    if (n <= 1 || n > 2 && n % 2 === 0) {
+      return false;
+    }
+    for (let i = 3, sqrt = Math.sqrt(n); i <= sqrt; i += 2) {
+      if (n % i === 0) {
+        return false;
+      }
+    }
+    return true;
+  },
+  // @ts-expect-error - TS2366 - Function lacks ending return statement and return type does not include 'undefined'.
+  getPrimeFactorization: function (number) {
+    if (number === 1) {
+      return [];
+    }
+    if (KhanMath.isPrime(number)) {
+      return [number];
+    }
+    const maxf = Math.sqrt(number);
+    for (let f = 2; f <= maxf; f++) {
+      if (number % f === 0) {
+        return $.merge(KhanMath.getPrimeFactorization(f), KhanMath.getPrimeFactorization(number / f));
+      }
+    }
+  },
+  // Round a number to the nearest increment
+  // E.g., if increment = 30 and num = 40, return 30. if increment = 30 and
+  //     num = 45, return 60.
+  roundToNearest: function (increment, num) {
+    return Math.round(num / increment) * increment;
+  },
+  // Round a number to a certain number of decimal places
+  roundTo: function (precision, num) {
+    const factor = Math.pow(10, precision).toFixed(5);
+    // @ts-expect-error - TS2345 - Argument of type 'string' is not assignable to parameter of type 'number'. | TS2363 - The right-hand side of an arithmetic operation must be of type 'any', 'number', 'bigint' or an enum type. | TS2363 - The right-hand side of an arithmetic operation must be of type 'any', 'number', 'bigint' or an enum type.
+    return Math.round((num * factor).toFixed(5)) / factor;
+  },
+  /**
+   * Return a string of num rounded to a fixed precision decimal places,
+   * with an approx symbol if num had to be rounded, and trailing 0s
+   */
+  toFixedApprox: function (num, precision) {
+    // TODO(aria): Make this locale-dependent
+    const fixedStr = num.toFixed(precision);
+    if (number$1.equal(+fixedStr, num)) {
+      return fixedStr;
+    }
+    return "\\approx " + fixedStr;
+  },
+  /**
+   * Return a string of num rounded to precision decimal places, with an
+   * approx symbol if num had to be rounded, but no trailing 0s if it was
+   * not rounded.
+   */
+  roundToApprox: function (num, precision) {
+    const fixed = KhanMath.roundTo(precision, num);
+    if (number$1.equal(fixed, num)) {
+      return String(fixed);
+    }
+    return KhanMath.toFixedApprox(num, precision);
+  },
+  // toFraction(4/8) => [1, 2]
+  // toFraction(0.666) => [333, 500]
+  // toFraction(0.666, 0.001) => [2, 3]
+  //
+  // tolerance can't be bigger than 1, sorry
+  toFraction: function (decimal, tolerance) {
+    if (tolerance == null) {
+      tolerance = Math.pow(2, -46);
+    }
+    if (decimal < 0 || decimal > 1) {
+      let fract = decimal % 1;
+      fract += fract < 0 ? 1 : 0;
+      const nd = KhanMath.toFraction(fract, tolerance);
+      nd[0] += Math.round(decimal - fract) * nd[1];
+      return nd;
+    }
+    if (Math.abs(Math.round(Number(decimal)) - decimal) <= tolerance) {
+      return [Math.round(decimal), 1];
+    }
+    let loN = 0;
+    let loD = 1;
+    let hiN = 1;
+    let hiD = 1;
+    let midN = 1;
+    let midD = 2;
+
+    // eslint-disable-next-line no-constant-condition
+    while (true) {
+      if (Math.abs(Number(midN / midD) - decimal) <= tolerance) {
+        return [midN, midD];
+      }
+      if (midN / midD < decimal) {
+        loN = midN;
+        loD = midD;
+      } else {
+        hiN = midN;
+        hiD = midD;
+      }
+      midN = loN + hiN;
+      midD = loD + hiD;
+    }
+  },
+  // Returns the format (string) of a given numeric string
+  // Note: purposively more inclusive than answer-types' predicate.forms
+  // That is, it is not necessarily true that interpreted input are numeric
+  getNumericFormat: function (text) {
+    text = $.trim(text);
+    text = text.replace(/\u2212/, "-").replace(/([+-])\s+/g, "$1");
+    if (text.match(/^[+-]?\d+$/)) {
+      return "integer";
+    }
+    if (text.match(/^[+-]?\d+\s+\d+\s*\/\s*\d+$/)) {
+      return "mixed";
+    }
+    const fraction = text.match(/^[+-]?(\d+)\s*\/\s*(\d+)$/);
+    if (fraction) {
+      return parseFloat(fraction[1]) > parseFloat(fraction[2]) ? "improper" : "proper";
+    }
+    if (text.replace(/[,. ]/g, "").match(/^\d+$/)) {
+      return "decimal";
+    }
+    if (text.match(/(pi?|\u03c0|t(?:au)?|\u03c4|pau)/)) {
+      return "pi";
+    }
+    return null;
+  },
+  // Returns a string of the number in a specified format
+  toNumericString: function (number, format) {
+    if (number == null) {
+      return "";
+    }
+    if (number === 0) {
+      return "0"; // otherwise it might end up as 0% or 0pi
+    }
+    if (format === "percent") {
+      return number * 100 + "%";
+    }
+    if (format === "pi") {
+      const fraction = number$1.toFraction(number / Math.PI);
+      const numerator = Math.abs(fraction[0]);
+      const denominator = fraction[1];
+      if (number$1.isInteger(numerator)) {
+        const sign = number < 0 ? "-" : "";
+        const pi = "\u03C0";
+        return sign + (numerator === 1 ? "" : numerator) + pi + (denominator === 1 ? "" : "/" + denominator);
+      }
+    }
+    if (_(["proper", "improper", "mixed", "fraction"]).contains(format)) {
+      const fraction = number$1.toFraction(number);
+      const numerator = Math.abs(fraction[0]);
+      const denominator = fraction[1];
+      const sign = number < 0 ? "-" : "";
+      if (denominator === 1) {
+        return sign + numerator; // for integers, irrational, d > 1000
+      }
+      if (format === "mixed") {
+        const modulus = numerator % denominator;
+        const integer = (numerator - modulus) / denominator;
+        return sign + (integer ? integer + " " : "") + modulus + "/" + denominator;
+      } // otherwise proper, improper, or fraction
+      return sign + numerator + "/" + denominator;
+    }
+
+    // otherwise (decimal, float, long long)
+    return String(number);
+  }
+};
+function sum(array) {
+  return array.reduce(add, 0);
+}
+function add(a, b) {
+  return a + b;
+}
+
+export { KhanMath, angles, coefficients, geometry, libVersion, line, number, point, ray, sum, vector$1 as vector };
 //# sourceMappingURL=index.js.map