graphql 0.0.1-test.1

package/jsutils/keyMap.mjs

@@ -0,0 +1,36 @@
+/**
+ * Creates a keyed JS object from an array, given a function to produce the keys
+ * for each value in the array.
+ *
+ * This provides a convenient lookup for the array items if the key function
+ * produces unique results.
+ * ```ts
+ * const phoneBook = [
+ *   { name: 'Jon', num: '555-1234' },
+ *   { name: 'Jenny', num: '867-5309' }
+ * ]
+ *
+ * const entriesByName = keyMap(
+ *   phoneBook,
+ *   entry => entry.name
+ * )
+ *
+ * // {
+ * //   Jon: { name: 'Jon', num: '555-1234' },
+ * //   Jenny: { name: 'Jenny', num: '867-5309' }
+ * // }
+ *
+ * const jennyEntry = entriesByName['Jenny']
+ *
+ * // { name: 'Jenny', num: '857-6309' }
+ * ```
+ */
+export function keyMap(list, keyFn) {
+  const result = Object.create(null);
+
+  for (const item of list) {
+    result[keyFn(item)] = item;
+  }
+
+  return result;
+}

package/jsutils/keyValMap.d.ts

@@ -0,0 +1,23 @@
+import type { ObjMap } from './ObjMap';
+/**
+ * Creates a keyed JS object from an array, given a function to produce the keys
+ * and a function to produce the values from each item in the array.
+ * ```ts
+ * const phoneBook = [
+ *   { name: 'Jon', num: '555-1234' },
+ *   { name: 'Jenny', num: '867-5309' }
+ * ]
+ *
+ * // { Jon: '555-1234', Jenny: '867-5309' }
+ * const phonesByName = keyValMap(
+ *   phoneBook,
+ *   entry => entry.name,
+ *   entry => entry.num
+ * )
+ * ```
+ */
+export declare function keyValMap<T, V>(
+  list: ReadonlyArray<T>,
+  keyFn: (item: T) => string,
+  valFn: (item: T) => V,
+): ObjMap<V>;

package/jsutils/keyValMap.js

@@ -0,0 +1,33 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.keyValMap = keyValMap;
+
+/**
+ * Creates a keyed JS object from an array, given a function to produce the keys
+ * and a function to produce the values from each item in the array.
+ * ```ts
+ * const phoneBook = [
+ *   { name: 'Jon', num: '555-1234' },
+ *   { name: 'Jenny', num: '867-5309' }
+ * ]
+ *
+ * // { Jon: '555-1234', Jenny: '867-5309' }
+ * const phonesByName = keyValMap(
+ *   phoneBook,
+ *   entry => entry.name,
+ *   entry => entry.num
+ * )
+ * ```
+ */
+function keyValMap(list, keyFn, valFn) {
+  const result = Object.create(null);
+
+  for (const item of list) {
+    result[keyFn(item)] = valFn(item);
+  }
+
+  return result;
+}

package/jsutils/keyValMap.mjs

@@ -0,0 +1,26 @@
+/**
+ * Creates a keyed JS object from an array, given a function to produce the keys
+ * and a function to produce the values from each item in the array.
+ * ```ts
+ * const phoneBook = [
+ *   { name: 'Jon', num: '555-1234' },
+ *   { name: 'Jenny', num: '867-5309' }
+ * ]
+ *
+ * // { Jon: '555-1234', Jenny: '867-5309' }
+ * const phonesByName = keyValMap(
+ *   phoneBook,
+ *   entry => entry.name,
+ *   entry => entry.num
+ * )
+ * ```
+ */
+export function keyValMap(list, keyFn, valFn) {
+  const result = Object.create(null);
+
+  for (const item of list) {
+    result[keyFn(item)] = valFn(item);
+  }
+
+  return result;
+}

package/jsutils/mapValue.d.ts

@@ -0,0 +1,9 @@
+import type { ObjMap, ReadOnlyObjMap } from './ObjMap';
+/**
+ * Creates an object map with the same keys as `map` and values generated by
+ * running each value of `map` thru `fn`.
+ */
+export declare function mapValue<T, V>(
+  map: ReadOnlyObjMap<T>,
+  fn: (value: T, key: string) => V,
+): ObjMap<V>;

package/jsutils/mapValue.js

@@ -0,0 +1,20 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.mapValue = mapValue;
+
+/**
+ * Creates an object map with the same keys as `map` and values generated by
+ * running each value of `map` thru `fn`.
+ */
+function mapValue(map, fn) {
+  const result = Object.create(null);
+
+  for (const key of Object.keys(map)) {
+    result[key] = fn(map[key], key);
+  }
+
+  return result;
+}

package/jsutils/mapValue.mjs

@@ -0,0 +1,13 @@
+/**
+ * Creates an object map with the same keys as `map` and values generated by
+ * running each value of `map` thru `fn`.
+ */
+export function mapValue(map, fn) {
+  const result = Object.create(null);
+
+  for (const key of Object.keys(map)) {
+    result[key] = fn(map[key], key);
+  }
+
+  return result;
+}

package/jsutils/memoize3.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Memoizes the provided three-argument function.
+ */
+export declare function memoize3<
+  A1 extends object,
+  A2 extends object,
+  A3 extends object,
+  R,
+>(fn: (a1: A1, a2: A2, a3: A3) => R): (a1: A1, a2: A2, a3: A3) => R;

package/jsutils/memoize3.js

@@ -0,0 +1,41 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.memoize3 = memoize3;
+
+/**
+ * Memoizes the provided three-argument function.
+ */
+function memoize3(fn) {
+  let cache0;
+  return function memoized(a1, a2, a3) {
+    if (cache0 === undefined) {
+      cache0 = new WeakMap();
+    }
+
+    let cache1 = cache0.get(a1);
+
+    if (cache1 === undefined) {
+      cache1 = new WeakMap();
+      cache0.set(a1, cache1);
+    }
+
+    let cache2 = cache1.get(a2);
+
+    if (cache2 === undefined) {
+      cache2 = new WeakMap();
+      cache1.set(a2, cache2);
+    }
+
+    let fnResult = cache2.get(a3);
+
+    if (fnResult === undefined) {
+      fnResult = fn(a1, a2, a3);
+      cache2.set(a3, fnResult);
+    }
+
+    return fnResult;
+  };
+}

package/jsutils/memoize3.mjs

@@ -0,0 +1,34 @@
+/**
+ * Memoizes the provided three-argument function.
+ */
+export function memoize3(fn) {
+  let cache0;
+  return function memoized(a1, a2, a3) {
+    if (cache0 === undefined) {
+      cache0 = new WeakMap();
+    }
+
+    let cache1 = cache0.get(a1);
+
+    if (cache1 === undefined) {
+      cache1 = new WeakMap();
+      cache0.set(a1, cache1);
+    }
+
+    let cache2 = cache1.get(a2);
+
+    if (cache2 === undefined) {
+      cache2 = new WeakMap();
+      cache1.set(a2, cache2);
+    }
+
+    let fnResult = cache2.get(a3);
+
+    if (fnResult === undefined) {
+      fnResult = fn(a1, a2, a3);
+      cache2.set(a3, fnResult);
+    }
+
+    return fnResult;
+  };
+}

package/jsutils/naturalCompare.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Returns a number indicating whether a reference string comes before, or after,
+ * or is the same as the given string in natural sort order.
+ *
+ * See: https://en.wikipedia.org/wiki/Natural_sort_order
+ *
+ */
+export declare function naturalCompare(aStr: string, bStr: string): number;

package/jsutils/naturalCompare.js

@@ -0,0 +1,69 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.naturalCompare = naturalCompare;
+
+/**
+ * Returns a number indicating whether a reference string comes before, or after,
+ * or is the same as the given string in natural sort order.
+ *
+ * See: https://en.wikipedia.org/wiki/Natural_sort_order
+ *
+ */
+function naturalCompare(aStr, bStr) {
+  let aIndex = 0;
+  let bIndex = 0;
+
+  while (aIndex < aStr.length && bIndex < bStr.length) {
+    let aChar = aStr.charCodeAt(aIndex);
+    let bChar = bStr.charCodeAt(bIndex);
+
+    if (isDigit(aChar) && isDigit(bChar)) {
+      let aNum = 0;
+
+      do {
+        ++aIndex;
+        aNum = aNum * 10 + aChar - DIGIT_0;
+        aChar = aStr.charCodeAt(aIndex);
+      } while (isDigit(aChar) && aNum > 0);
+
+      let bNum = 0;
+
+      do {
+        ++bIndex;
+        bNum = bNum * 10 + bChar - DIGIT_0;
+        bChar = bStr.charCodeAt(bIndex);
+      } while (isDigit(bChar) && bNum > 0);
+
+      if (aNum < bNum) {
+        return -1;
+      }
+
+      if (aNum > bNum) {
+        return 1;
+      }
+    } else {
+      if (aChar < bChar) {
+        return -1;
+      }
+
+      if (aChar > bChar) {
+        return 1;
+      }
+
+      ++aIndex;
+      ++bIndex;
+    }
+  }
+
+  return aStr.length - bStr.length;
+}
+
+const DIGIT_0 = 48;
+const DIGIT_9 = 57;
+
+function isDigit(code) {
+  return !isNaN(code) && DIGIT_0 <= code && code <= DIGIT_9;
+}

package/jsutils/naturalCompare.mjs

@@ -0,0 +1,61 @@
+/**
+ * Returns a number indicating whether a reference string comes before, or after,
+ * or is the same as the given string in natural sort order.
+ *
+ * See: https://en.wikipedia.org/wiki/Natural_sort_order
+ *
+ */
+export function naturalCompare(aStr, bStr) {
+  let aIndex = 0;
+  let bIndex = 0;
+
+  while (aIndex < aStr.length && bIndex < bStr.length) {
+    let aChar = aStr.charCodeAt(aIndex);
+    let bChar = bStr.charCodeAt(bIndex);
+
+    if (isDigit(aChar) && isDigit(bChar)) {
+      let aNum = 0;
+
+      do {
+        ++aIndex;
+        aNum = aNum * 10 + aChar - DIGIT_0;
+        aChar = aStr.charCodeAt(aIndex);
+      } while (isDigit(aChar) && aNum > 0);
+
+      let bNum = 0;
+
+      do {
+        ++bIndex;
+        bNum = bNum * 10 + bChar - DIGIT_0;
+        bChar = bStr.charCodeAt(bIndex);
+      } while (isDigit(bChar) && bNum > 0);
+
+      if (aNum < bNum) {
+        return -1;
+      }
+
+      if (aNum > bNum) {
+        return 1;
+      }
+    } else {
+      if (aChar < bChar) {
+        return -1;
+      }
+
+      if (aChar > bChar) {
+        return 1;
+      }
+
+      ++aIndex;
+      ++bIndex;
+    }
+  }
+
+  return aStr.length - bStr.length;
+}
+const DIGIT_0 = 48;
+const DIGIT_9 = 57;
+
+function isDigit(code) {
+  return !isNaN(code) && DIGIT_0 <= code && code <= DIGIT_9;
+}

package/jsutils/printPathArray.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Build a string describing the path.
+ */
+export declare function printPathArray(
+  path: ReadonlyArray<string | number>,
+): string;

package/jsutils/printPathArray.js

@@ -0,0 +1,17 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.printPathArray = printPathArray;
+
+/**
+ * Build a string describing the path.
+ */
+function printPathArray(path) {
+  return path
+    .map((key) =>
+      typeof key === 'number' ? '[' + key.toString() + ']' : '.' + key,
+    )
+    .join('');
+}

package/jsutils/printPathArray.mjs

@@ -0,0 +1,10 @@
+/**
+ * Build a string describing the path.
+ */
+export function printPathArray(path) {
+  return path
+    .map((key) =>
+      typeof key === 'number' ? '[' + key.toString() + ']' : '.' + key,
+    )
+    .join('');
+}

package/jsutils/promiseForObject.d.ts

@@ -0,0 +1,11 @@
+import type { ObjMap } from './ObjMap';
+/**
+ * This function transforms a JS object `ObjMap<Promise<T>>` into
+ * a `Promise<ObjMap<T>>`
+ *
+ * This is akin to bluebird's `Promise.props`, but implemented only using
+ * `Promise.all` so it will work with any implementation of ES6 promises.
+ */
+export declare function promiseForObject<T>(
+  object: ObjMap<Promise<T>>,
+): Promise<ObjMap<T>>;

package/jsutils/promiseForObject.js

@@ -0,0 +1,25 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.promiseForObject = promiseForObject;
+
+/**
+ * This function transforms a JS object `ObjMap<Promise<T>>` into
+ * a `Promise<ObjMap<T>>`
+ *
+ * This is akin to bluebird's `Promise.props`, but implemented only using
+ * `Promise.all` so it will work with any implementation of ES6 promises.
+ */
+function promiseForObject(object) {
+  return Promise.all(Object.values(object)).then((resolvedValues) => {
+    const resolvedObject = Object.create(null);
+
+    for (const [i, key] of Object.keys(object).entries()) {
+      resolvedObject[key] = resolvedValues[i];
+    }
+
+    return resolvedObject;
+  });
+}

package/jsutils/promiseForObject.mjs

@@ -0,0 +1,18 @@
+/**
+ * This function transforms a JS object `ObjMap<Promise<T>>` into
+ * a `Promise<ObjMap<T>>`
+ *
+ * This is akin to bluebird's `Promise.props`, but implemented only using
+ * `Promise.all` so it will work with any implementation of ES6 promises.
+ */
+export function promiseForObject(object) {
+  return Promise.all(Object.values(object)).then((resolvedValues) => {
+    const resolvedObject = Object.create(null);
+
+    for (const [i, key] of Object.keys(object).entries()) {
+      resolvedObject[key] = resolvedValues[i];
+    }
+
+    return resolvedObject;
+  });
+}

package/jsutils/promiseReduce.d.ts

@@ -0,0 +1,13 @@
+import type { PromiseOrValue } from './PromiseOrValue';
+/**
+ * Similar to Array.prototype.reduce(), however the reducing callback may return
+ * a Promise, in which case reduction will continue after each promise resolves.
+ *
+ * If the callback does not return a Promise, then this function will also not
+ * return a Promise.
+ */
+export declare function promiseReduce<T, U>(
+  values: Iterable<T>,
+  callbackFn: (accumulator: U, currentValue: T) => PromiseOrValue<U>,
+  initialValue: PromiseOrValue<U>,
+): PromiseOrValue<U>;

package/jsutils/promiseReduce.js

@@ -0,0 +1,27 @@
+'use strict';
+
+Object.defineProperty(exports, '__esModule', {
+  value: true,
+});
+exports.promiseReduce = promiseReduce;
+
+var _isPromise = require('./isPromise.js');
+
+/**
+ * Similar to Array.prototype.reduce(), however the reducing callback may return
+ * a Promise, in which case reduction will continue after each promise resolves.
+ *
+ * If the callback does not return a Promise, then this function will also not
+ * return a Promise.
+ */
+function promiseReduce(values, callbackFn, initialValue) {
+  let accumulator = initialValue;
+
+  for (const value of values) {
+    accumulator = (0, _isPromise.isPromise)(accumulator)
+      ? accumulator.then((resolved) => callbackFn(resolved, value))
+      : callbackFn(accumulator, value);
+  }
+
+  return accumulator;
+}

package/jsutils/promiseReduce.mjs

@@ -0,0 +1,20 @@
+import { isPromise } from './isPromise.mjs';
+
+/**
+ * Similar to Array.prototype.reduce(), however the reducing callback may return
+ * a Promise, in which case reduction will continue after each promise resolves.
+ *
+ * If the callback does not return a Promise, then this function will also not
+ * return a Promise.
+ */
+export function promiseReduce(values, callbackFn, initialValue) {
+  let accumulator = initialValue;
+
+  for (const value of values) {
+    accumulator = isPromise(accumulator)
+      ? accumulator.then((resolved) => callbackFn(resolved, value))
+      : callbackFn(accumulator, value);
+  }
+
+  return accumulator;
+}

package/jsutils/suggestionList.d.ts

@@ -0,0 +1,8 @@
+/**
+ * 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 declare function suggestionList(
+  input: string,
+  options: ReadonlyArray<string>,
+): Array<string>;