graphql 0.0.1-test.1

package/jsutils/suggestionList.js

@@ -0,0 +1,139 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.suggestionList = suggestionList;
+
+var _naturalCompare = require('./naturalCompare.js');
+
+/**
+ * Given an invalid input string and a list of valid options, returns a filtered
+ * list of valid options sorted based on their similarity with the input.
+ */
+function suggestionList(input, options) {
+  const optionsByDistance = Object.create(null);
+  const lexicalDistance = new LexicalDistance(input);
+  const threshold = Math.floor(input.length * 0.4) + 1;
+
+  for (const option of options) {
+    const distance = lexicalDistance.measure(option, threshold);
+
+    if (distance !== undefined) {
+      optionsByDistance[option] = distance;
+    }
+  }
+
+  return Object.keys(optionsByDistance).sort((a, b) => {
+    const distanceDiff = optionsByDistance[a] - optionsByDistance[b];
+    return distanceDiff !== 0
+      ? distanceDiff
+      : (0, _naturalCompare.naturalCompare)(a, b);
+  });
+}
+/**
+ * Computes the lexical distance between strings A and B.
+ *
+ * The "distance" between two strings is given by counting the minimum number
+ * of edits needed to transform string A into string B. An edit can be an
+ * insertion, deletion, or substitution of a single character, or a swap of two
+ * adjacent characters.
+ *
+ * Includes a custom alteration from Damerau-Levenshtein to treat case changes
+ * as a single edit which helps identify mis-cased values with an edit distance
+ * of 1.
+ *
+ * This distance can be useful for detecting typos in input or sorting
+ */
+
+class LexicalDistance {
+  constructor(input) {
+    this._input = input;
+    this._inputLowerCase = input.toLowerCase();
+    this._inputArray = stringToArray(this._inputLowerCase);
+    this._rows = [
+      new Array(input.length + 1).fill(0),
+      new Array(input.length + 1).fill(0),
+      new Array(input.length + 1).fill(0),
+    ];
+  }
+
+  measure(option, threshold) {
+    if (this._input === option) {
+      return 0;
+    }
+
+    const optionLowerCase = option.toLowerCase(); // Any case change counts as a single edit
+
+    if (this._inputLowerCase === optionLowerCase) {
+      return 1;
+    }
+
+    let a = stringToArray(optionLowerCase);
+    let b = this._inputArray;
+
+    if (a.length < b.length) {
+      const tmp = a;
+      a = b;
+      b = tmp;
+    }
+
+    const aLength = a.length;
+    const bLength = b.length;
+
+    if (aLength - bLength > threshold) {
+      return undefined;
+    }
+
+    const rows = this._rows;
+
+    for (let j = 0; j <= bLength; j++) {
+      rows[0][j] = j;
+    }
+
+    for (let i = 1; i <= aLength; i++) {
+      const upRow = rows[(i - 1) % 3];
+      const currentRow = rows[i % 3];
+      let smallestCell = (currentRow[0] = i);
+
+      for (let j = 1; j <= bLength; j++) {
+        const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+        let currentCell = Math.min(
+          upRow[j] + 1, // delete
+          currentRow[j - 1] + 1, // insert
+          upRow[j - 1] + cost, // substitute
+        );
+
+        if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
+          // transposition
+          const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];
+          currentCell = Math.min(currentCell, doubleDiagonalCell + 1);
+        }
+
+        if (currentCell < smallestCell) {
+          smallestCell = currentCell;
+        }
+
+        currentRow[j] = currentCell;
+      } // Early exit, since distance can't go smaller than smallest element of the previous row.
+
+      if (smallestCell > threshold) {
+        return undefined;
+      }
+    }
+
+    const distance = rows[aLength % 3][bLength];
+    return distance <= threshold ? distance : undefined;
+  }
+}
+
+function stringToArray(str) {
+  const strLength = str.length;
+  const array = new Array(strLength);
+
+  for (let i = 0; i < strLength; ++i) {
+    array[i] = str.charCodeAt(i);
+  }
+
+  return array;
+}

package/jsutils/suggestionList.mjs

@@ -0,0 +1,130 @@
+import { naturalCompare } from './naturalCompare.mjs';
+/**
+ * Given an invalid input string and a list of valid options, returns a filtered
+ * list of valid options sorted based on their similarity with the input.
+ */
+
+export function suggestionList(input, options) {
+  const optionsByDistance = Object.create(null);
+  const lexicalDistance = new LexicalDistance(input);
+  const threshold = Math.floor(input.length * 0.4) + 1;
+
+  for (const option of options) {
+    const distance = lexicalDistance.measure(option, threshold);
+
+    if (distance !== undefined) {
+      optionsByDistance[option] = distance;
+    }
+  }
+
+  return Object.keys(optionsByDistance).sort((a, b) => {
+    const distanceDiff = optionsByDistance[a] - optionsByDistance[b];
+    return distanceDiff !== 0 ? distanceDiff : naturalCompare(a, b);
+  });
+}
+/**
+ * Computes the lexical distance between strings A and B.
+ *
+ * The "distance" between two strings is given by counting the minimum number
+ * of edits needed to transform string A into string B. An edit can be an
+ * insertion, deletion, or substitution of a single character, or a swap of two
+ * adjacent characters.
+ *
+ * Includes a custom alteration from Damerau-Levenshtein to treat case changes
+ * as a single edit which helps identify mis-cased values with an edit distance
+ * of 1.
+ *
+ * This distance can be useful for detecting typos in input or sorting
+ */
+
+class LexicalDistance {
+  constructor(input) {
+    this._input = input;
+    this._inputLowerCase = input.toLowerCase();
+    this._inputArray = stringToArray(this._inputLowerCase);
+    this._rows = [
+      new Array(input.length + 1).fill(0),
+      new Array(input.length + 1).fill(0),
+      new Array(input.length + 1).fill(0),
+    ];
+  }
+
+  measure(option, threshold) {
+    if (this._input === option) {
+      return 0;
+    }
+
+    const optionLowerCase = option.toLowerCase(); // Any case change counts as a single edit
+
+    if (this._inputLowerCase === optionLowerCase) {
+      return 1;
+    }
+
+    let a = stringToArray(optionLowerCase);
+    let b = this._inputArray;
+
+    if (a.length < b.length) {
+      const tmp = a;
+      a = b;
+      b = tmp;
+    }
+
+    const aLength = a.length;
+    const bLength = b.length;
+
+    if (aLength - bLength > threshold) {
+      return undefined;
+    }
+
+    const rows = this._rows;
+
+    for (let j = 0; j <= bLength; j++) {
+      rows[0][j] = j;
+    }
+
+    for (let i = 1; i <= aLength; i++) {
+      const upRow = rows[(i - 1) % 3];
+      const currentRow = rows[i % 3];
+      let smallestCell = (currentRow[0] = i);
+
+      for (let j = 1; j <= bLength; j++) {
+        const cost = a[i - 1] === b[j - 1] ? 0 : 1;
+        let currentCell = Math.min(
+          upRow[j] + 1, // delete
+          currentRow[j - 1] + 1, // insert
+          upRow[j - 1] + cost, // substitute
+        );
+
+        if (i > 1 && j > 1 && a[i - 1] === b[j - 2] && a[i - 2] === b[j - 1]) {
+          // transposition
+          const doubleDiagonalCell = rows[(i - 2) % 3][j - 2];
+          currentCell = Math.min(currentCell, doubleDiagonalCell + 1);
+        }
+
+        if (currentCell < smallestCell) {
+          smallestCell = currentCell;
+        }
+
+        currentRow[j] = currentCell;
+      } // Early exit, since distance can't go smaller than smallest element of the previous row.
+
+      if (smallestCell > threshold) {
+        return undefined;
+      }
+    }
+
+    const distance = rows[aLength % 3][bLength];
+    return distance <= threshold ? distance : undefined;
+  }
+}
+
+function stringToArray(str) {
+  const strLength = str.length;
+  const array = new Array(strLength);
+
+  for (let i = 0; i < strLength; ++i) {
+    array[i] = str.charCodeAt(i);
+  }
+
+  return array;
+}

package/jsutils/toError.d.ts

@@ -0,0 +1,4 @@
+/**
+ * Sometimes a non-error is thrown, wrap it as an Error instance to ensure a consistent Error interface.
+ */
+export declare function toError(thrownValue: unknown): Error;

package/jsutils/toError.js

@@ -0,0 +1,25 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.toError = toError;
+
+var _inspect = require('./inspect.js');
+
+/**
+ * Sometimes a non-error is thrown, wrap it as an Error instance to ensure a consistent Error interface.
+ */
+function toError(thrownValue) {
+  return thrownValue instanceof Error
+    ? thrownValue
+    : new NonErrorThrown(thrownValue);
+}
+
+class NonErrorThrown extends Error {
+  constructor(thrownValue) {
+    super('Unexpected error value: ' + (0, _inspect.inspect)(thrownValue));
+    this.name = 'NonErrorThrown';
+    this.thrownValue = thrownValue;
+  }
+}

package/jsutils/toError.mjs

@@ -0,0 +1,18 @@
+import { inspect } from './inspect.mjs';
+/**
+ * Sometimes a non-error is thrown, wrap it as an Error instance to ensure a consistent Error interface.
+ */
+
+export function toError(thrownValue) {
+  return thrownValue instanceof Error
+    ? thrownValue
+    : new NonErrorThrown(thrownValue);
+}
+
+class NonErrorThrown extends Error {
+  constructor(thrownValue) {
+    super('Unexpected error value: ' + inspect(thrownValue));
+    this.name = 'NonErrorThrown';
+    this.thrownValue = thrownValue;
+  }
+}

package/jsutils/toObjMap.d.ts

@@ -0,0 +1,5 @@
+import type { Maybe } from './Maybe';
+import type { ReadOnlyObjMap, ReadOnlyObjMapLike } from './ObjMap';
+export declare function toObjMap<T>(
+  obj: Maybe<ReadOnlyObjMapLike<T>>,
+): ReadOnlyObjMap<T>;

package/jsutils/toObjMap.js

@@ -0,0 +1,24 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.toObjMap = toObjMap;
+
+function toObjMap(obj) {
+  if (obj == null) {
+    return Object.create(null);
+  }
+
+  if (Object.getPrototypeOf(obj) === null) {
+    return obj;
+  }
+
+  const map = Object.create(null);
+
+  for (const [key, value] of Object.entries(obj)) {
+    map[key] = value;
+  }
+
+  return map;
+}

package/jsutils/toObjMap.mjs

@@ -0,0 +1,17 @@
+export function toObjMap(obj) {
+  if (obj == null) {
+    return Object.create(null);
+  }
+
+  if (Object.getPrototypeOf(obj) === null) {
+    return obj;
+  }
+
+  const map = Object.create(null);
+
+  for (const [key, value] of Object.entries(obj)) {
+    map[key] = value;
+  }
+
+  return map;
+}