prettier-rm-duplicate-json-keys/dist/sort.js

A Prettier plugin that removes duplicate keys from JSON files

'use strict';

function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator["return"] && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, "catch": function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
function asyncGeneratorStep(n, t, e, r, o, a, c) { try { var i = n[a](c), u = i.value; } catch (n) { return void e(n); } i.done ? t(u) : Promise.resolve(u).then(r, o); }
function _asyncToGenerator(n) { return function () { var t = this, e = arguments; return new Promise(function (r, o) { var a = n.apply(t, e); function _next(n) { asyncGeneratorStep(a, r, o, _next, _throw, "next", n); } function _throw(n) { asyncGeneratorStep(a, r, o, _next, _throw, "throw", n); } _next(void 0); }); }; }
function _slicedToArray(r, e) { return _arrayWithHoles(r) || _iterableToArrayLimit(r, e) || _unsupportedIterableToArray(r, e) || _nonIterableRest(); }
function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
function _iterableToArrayLimit(r, l) { var t = null == r ? null : "undefined" != typeof Symbol && r[Symbol.iterator] || r["@@iterator"]; if (null != t) { var e, n, i, u, a = [], f = !0, o = !1; try { if (i = (t = t.call(r)).next, 0 === l) { if (Object(t) !== t) return; f = !1; } else for (; !(f = (e = i.call(t)).done) && (a.push(e.value), a.length !== l); f = !0); } catch (r) { o = !0, n = r; } finally { try { if (!f && null != t["return"] && (u = t["return"](), Object(u) !== u)) return; } finally { if (o) throw n; } } return a; } }
function _arrayWithHoles(r) { if (Array.isArray(r)) return r; }
function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
function _toConsumableArray(r) { return _arrayWithoutHoles(r) || _iterableToArray(r) || _unsupportedIterableToArray(r) || _nonIterableSpread(); }
function _nonIterableSpread() { throw new TypeError("Invalid attempt to spread non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); }
function _unsupportedIterableToArray(r, a) { if (r) { if ("string" == typeof r) return _arrayLikeToArray(r, a); var t = {}.toString.call(r).slice(8, -1); return "Object" === t && r.constructor && (t = r.constructor.name), "Map" === t || "Set" === t ? Array.from(r) : "Arguments" === t || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(t) ? _arrayLikeToArray(r, a) : void 0; } }
function _iterableToArray(r) { if ("undefined" != typeof Symbol && null != r[Symbol.iterator] || null != r["@@iterator"]) return Array.from(r); }
function _arrayWithoutHoles(r) { if (Array.isArray(r)) return _arrayLikeToArray(r); }
function _arrayLikeToArray(r, a) { (null == a || a > r.length) && (a = r.length); for (var e = 0, n = Array(a); e < a; e++) n[e] = r[e]; return n; }
Object.defineProperty(exports, '__esModule', {
  value: true
});
exports.options = exports.parsers = void 0;
var babel_1 = require('prettier/plugins/babel');
/**
 * Lexical sort function for strings, meant to be used as the sort
 * function for `Array.prototype.sort`.
 *
 * @param a - First element to compare.
 * @param b - Second element to compare.
 * @returns A number indicating which element should come first.
 */
function lexicalSort(a, b) {
  if (a > b) {
    return 1;
  }
  if (a < b) {
    return -1;
  }
  return 0;
}
var integerPrefixRegex = /^([0-9]+)/;
/**
 * Numeric sort function for strings, meant to be used as the sort
 * function for `Array.prototype.sort`.
 *
 * The number prefixing each string (if any) is sorted numerically.
 * Otherwise the string is sorted Lexically.
 *
 * @param a - First element to compare.
 * @param b - Second element to compare.
 * @returns A number indicating which element should come first.
 */
function numericSort(a, b) {
  var aPrefixResult = a.match(integerPrefixRegex);
  var bPrefixResult = b.match(integerPrefixRegex);
  if (aPrefixResult !== null && bPrefixResult !== null) {
    // Guaranteed to be non-null because we checked for `null`, and because there is a capture
    // group in the regex
    /* eslint-disable @typescript-eslint/no-non-null-assertion */
    var rawAPrefix = aPrefixResult[1];
    var rawBPrefix = bPrefixResult[1];
    /* eslint-enable @typescript-eslint/no-non-null-assertion */
    var aPrefix = parseInt(rawAPrefix, 10);
    var bPrefix = parseInt(rawBPrefix, 10);
    var difference = aPrefix - bPrefix;
    if (difference !== 0) {
      return difference;
    }
  }
  return String(a) > String(b) ? 1 : -1;
}
/**
 * Reverse a sort function. This is meant to wrap functions meant to be
 * used as the sort function for `Array.prototype.sort`.
 *
 * @param sortFunction - The sort function to reverse.
 * @returns A reversed sort function.
 */
function reverseSort(sortFunction) {
  return function (a, b) {
    return -1 * sortFunction(a, b);
  };
}
/**
 * Make a sort function case-insensitive. This is meant to wrap
 * functions meant to be used as the sort function for
 * `Array.prototype.sort`.
 *
 * @param sortFunction - The sort function to make case-insensitive.
 * @returns A case-insensitive sort function.
 */
function caseInsensitiveSort(sortFunction) {
  return function (a, b) {
    return sortFunction(a.toLowerCase(), b.toLowerCase()) || sortFunction(a, b);
  };
}
/**
 * Skip sort function, meant to be used as the sort
 * function for `Array.prototype.sort`.
 *
 * @param _a - First element to compare.
 * @param _b - Second element to compare.
 * @returns A number indicating which element should come first.
 */
function noneSort(_a, _b) {
  return 0;
}
/**
 * A mapping of category sort algorithms to sort functions.
 */
var categorySortFunctions = {
  caseInsensitiveLexical: caseInsensitiveSort(lexicalSort),
  caseInsensitiveNumeric: caseInsensitiveSort(numericSort),
  caseInsensitiveReverseLexical: caseInsensitiveSort(reverseSort(lexicalSort)),
  caseInsensitiveReverseNumeric: caseInsensitiveSort(reverseSort(numericSort)),
  lexical: lexicalSort,
  numeric: numericSort,
  reverseLexical: reverseSort(lexicalSort),
  reverseNumeric: reverseSort(numericSort),
  none: noneSort
};
/**
 * A list of all allowed category sort values.
 */
var allowedCategorySortValues = [null].concat(_toConsumableArray(Object.keys(categorySortFunctions)));
/**
 * Asserts that the given AST properties only contain 'ObjectProperty' entries.
 * The other two types are not found in JSON files.
 *
 * @param properties - The properties to check.
 * @throws Throws an error if unexpected property types are found.
 */
function assertObjectPropertyTypes(properties) {
  var invalidProperty = properties.find(function (property) {
    return property.type !== 'ObjectProperty';
  });
  /* c8 ignore start */
  if (invalidProperty !== undefined) {
    throw new Error("Property type not supported: ".concat(invalidProperty.type));
  }
  /* c8 ignore stop */
}
/**
 * Asserts that the given AST object property is a string literal. This should
 * be the only type of key found in JSON files.
 *
 * @param objectPropertyKey - The key to check.
 * @throws Throws an error if the key has an unexpected type.
 */
function assertObjectPropertyKeyType(objectPropertyKey) {
  /* c8 ignore start */
  if (objectPropertyKey.type !== 'StringLiteral') {
    throw new Error("Object property key type not supported: ".concat(objectPropertyKey.type));
  }
  /* c8 ignore stop */
}
/**
 * Determins whether the given object property value is an array or object.
 *
 * @param value - The ObjectProperty value to check.
 * @returns True if the value is an array or object, false otherwise.
 */
function valueIsArrayOrObjectExpression(value) {
  return ['ObjectExpression', 'ArrayExpression'].includes(value.type);
}
/**
 * Sort properties of JavaScript objects within an AST.
 *
 * @param ast - The AST to sort.
 * @param recursive - Whether to sort the object recursively or not.
 * @param sortCompareFunction - A custom sort function.
 * @returns The sorted object.
 */
function sortAst(ast, recursive, sortCompareFunction) {
  if (ast.type === 'ArrayExpression' && recursive) {
    ast.elements = ast.elements.map(function (element) {
      if (element === null || element.type === 'NullLiteral') {
        return element;
      } /* c8 ignore start */else if (element.type === 'SpreadElement') {
        throw new Error('Unreachable; SpreadElement is not allowed in JSON');
      }
      /* c8 ignore stop */
      return sortAst(element, recursive, sortCompareFunction);
    });
  } else if (ast.type === 'ObjectExpression') {
    var properties = ast.properties;
    assertObjectPropertyTypes(properties);
    var sortedProperties = properties.sort(function (propertyA, propertyB) {
      assertObjectPropertyKeyType(propertyA.key);
      assertObjectPropertyKeyType(propertyB.key);
      return sortCompareFunction(propertyA.key.value, propertyB.key.value);
    });
    if (recursive) {
      var recursivelySortedProperties = sortedProperties.map(function (property) {
        var value = property.value;
        if (valueIsArrayOrObjectExpression(value)) {
          property.value = sortAst(value, recursive, sortCompareFunction);
        }
        return property;
      });
      ast.properties = recursivelySortedProperties;
    } else {
      ast.properties = sortedProperties;
    }
  }
  return ast;
}
/**
 * Parse JSON sort options from Prettier options.
 *
 * @param prettierOptions - Prettier options.
 * @returns JSON sort options.
 */
function parseOptions(prettierOptions) {
  // Unreachable, validated before here by Prettier
  /* c8 ignore start */
  if (typeof prettierOptions.jsonRecursiveSort !== 'boolean') {
    throw new Error("Invalid 'jsonRecursiveSort' option; expected boolean, got '".concat(_typeof(prettierOptions.jsonRecursiveSort), "'"));
  }
  /* c8 ignore stop */
  var parsedJsonSortOptions = {
    jsonRecursiveSort: prettierOptions.jsonRecursiveSort
  };
  if (prettierOptions.jsonSortOrder !== undefined) {
    var rawJsonSortOrder = prettierOptions.jsonSortOrder;
    // Unreachable, validated before here by Prettier
    /* c8 ignore start */
    if (typeof rawJsonSortOrder !== 'string') {
      throw new Error("Invalid 'jsonSortOrder' option; expected string, got '".concat(_typeof(prettierOptions.rawJsonSortOrder), "'"));
    }
    /* c8 ignore stop */
    var parsedJsonSortOrder;
    try {
      parsedJsonSortOrder = JSON.parse(rawJsonSortOrder);
    } catch (error) {
      // @ts-expect-error Error cause property not yet supported by '@types/node' (see https://github.com/DefinitelyTyped/DefinitelyTyped/pull/61827)
      throw new Error("Failed to parse sort order option as JSON", {
        cause: error
      });
    }
    if (Array.isArray(parsedJsonSortOrder) || _typeof(parsedJsonSortOrder) !== 'object') {
      throw new Error("Invalid custom sort order; must be an object");
    }
    for (var _i = 0, _Object$values = Object.values(parsedJsonSortOrder); _i < _Object$values.length; _i++) {
      var categorySort = _Object$values[_i];
      if (categorySort !== null && typeof categorySort !== 'string' || !allowedCategorySortValues.includes(categorySort)) {
        throw new Error("Invalid custom sort entry: value must be one of '".concat(String(allowedCategorySortValues.map(String)), "', got '").concat(String(categorySort), "'"));
      }
    }
    parsedJsonSortOptions.jsonSortOrder = parsedJsonSortOrder;
  }
  return parsedJsonSortOptions;
}
/**
 * Apply default sort options.
 *
 * @param options - JSON sort options as configured.
 * @returns JSON sort options with defaults applied.
 */
function applyDefaultOptions(options) {
  var jsonRecursiveSort = options.jsonRecursiveSort,
    jsonSortOrder = options.jsonSortOrder;
  return {
    jsonRecursiveSort: jsonRecursiveSort,
    // Default already applied by Prettier
    jsonSortOrder: jsonSortOrder !== null && jsonSortOrder !== void 0 ? jsonSortOrder : {}
  };
}
/**
 * Create sort compare function from a custom JSON sort order configuration.
 *
 * @param jsonSortOrder - JSON sort order configuration.
 * @returns A sorting function for comparing Object keys.
 */
function createSortCompareFunction(jsonSortOrder) {
  var evaluateSortEntry = function evaluateSortEntry(value, entry) {
    var regexRegex = /^\/((?:[\0-\t\x0B\f\x0E-\u2027\u202A-\uD7FF\uE000-\uFFFF]|[\uD800-\uDBFF][\uDC00-\uDFFF]|[\uD800-\uDBFF](?![\uDC00-\uDFFF])|(?:[^\uD800-\uDBFF]|^)[\uDC00-\uDFFF])+)\/([imsu]*)$/;
    var regexResult = entry.match(regexRegex);
    if (regexResult) {
      var _regexResult = _slicedToArray(regexResult, 3),
        regexSpec = _regexResult[1],
        flags = _regexResult[2];
      /* c8 ignore start */
      if (!regexSpec) {
        // The RegExp specifies that this capture group be non-empty, so this is unreachable
        throw new Error('Unreachable, empty RegExp specification found');
      }
      /* c8 ignore stop */
      var regex = new RegExp(regexSpec, flags);
      return Boolean(value.match(regex));
    }
    return value === entry;
  };
  var sortEntries = Object.keys(jsonSortOrder);
  return function (a, b) {
    var aIndex = sortEntries.findIndex(evaluateSortEntry.bind(null, a));
    var bIndex = sortEntries.findIndex(evaluateSortEntry.bind(null, b));
    if (aIndex === -1 && bIndex === -1) {
      return lexicalSort(a, b);
    } else if (bIndex === -1) {
      return -1;
    } else if (aIndex === -1) {
      return 1;
    } else if (aIndex === bIndex) {
      var sortEntry = sortEntries[aIndex];
      /* c8 ignore start */
      if (sortEntry === undefined) {
        // Sort entry guaranteed to be non-null because index was found
        throw new Error('Unreachable, undefined sort entry');
      }
      /* c8 ignore stop */
      var categorySort = jsonSortOrder[sortEntry];
      /* c8 ignore start */
      if (categorySort === undefined) {
        // Guaranteed to be defined because `sortEntry` is derived from `Object.keys`
        throw new Error('Unreachable, undefined category sort entry');
      }
      /* c8 ignore stop */
      var categorySortFunction = categorySort === null ? lexicalSort : categorySortFunctions[categorySort];
      return categorySortFunction(a, b);
    }
    return aIndex - bIndex;
  };
}
/**
 * Create a JSON sorting parser based upon the specified Prettier parser.
 *
 * @param parser - The Prettier JSON parser to base the sorting on.
 * @returns The JSON sorting parser.
 */
function createParser(parser) {
  return /*#__PURE__*/function () {
    var _ref = _asyncToGenerator(/*#__PURE__*/_regeneratorRuntime().mark(function _callee(text, prettierOptions) {
      var _applyDefaultOptions, jsonRecursiveSort, jsonSortOrder, jsonRootAst, ast, sortCompareFunction, sortedAst;
      return _regeneratorRuntime().wrap(function _callee$(_context) {
        while (1) switch (_context.prev = _context.next) {
          case 0:
            _applyDefaultOptions = applyDefaultOptions(parseOptions(prettierOptions)), jsonRecursiveSort = _applyDefaultOptions.jsonRecursiveSort, jsonSortOrder = _applyDefaultOptions.jsonSortOrder;
            _context.next = 3;
            return babel_1.parsers[parser].parse(text, prettierOptions);
          case 3:
            jsonRootAst = _context.sent;
            // The Prettier JSON parser wraps the AST in a 'JsonRoot' node
            // This ast variable is the real document root
            ast = jsonRootAst.node; // Only objects are intended to be sorted by this plugin
            // Arrays are considered only in recursive mode, so that we
            // can get to nested objected.
            if (ast.type === 'ObjectExpression' || ast.type === 'ArrayExpression' && jsonRecursiveSort) {
              _context.next = 7;
              break;
            }
            return _context.abrupt("return", jsonRootAst);
          case 7:
            sortCompareFunction = createSortCompareFunction(jsonSortOrder);
            sortedAst = sortAst(ast, jsonRecursiveSort, sortCompareFunction);
            return _context.abrupt("return", Object.assign(Object.assign({}, jsonRootAst), {
              node: sortedAst
            }));
          case 10:
          case "end":
            return _context.stop();
        }
      }, _callee);
    }));
    return function (_x, _x2) {
      return _ref.apply(this, arguments);
    };
  }();
}
exports.parsers = {
  json: Object.assign(Object.assign({}, babel_1.parsers.json), {
    parse: createParser('json')
  })
};
exports.options = {
  jsonRecursiveSort: {
    category: 'json-sort',
    "default": false,
    description: 'Sort JSON files recursively, including any nested properties',
    since: '0.0.2',
    type: 'boolean'
  },
  jsonSortOrder: {
    category: 'json-sort',
    description: 'A JSON string specifying a custom sort order',
    since: '0.0.4',
    type: 'string'
  }
};