graphile-build-pg 4.13.0 → 4.14.1

package/node8plus/queryFromResolveDataFactory.js

@@ -4,35 +4,24 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = void 0;
-
 var _QueryBuilder = _interopRequireDefault(require("./QueryBuilder"));
-
 var sql = _interopRequireWildcard(require("pg-sql2"));
-
 var _isSafeInteger = _interopRequireDefault(require("lodash/isSafeInteger"));
-
 var _assert = _interopRequireDefault(require("assert"));
-
 var _util = require("util");
-
 function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-
 function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
+// eslint-disable-next-line flowtype/no-weak-types
 const identity = _ => _ !== null && _ !== undefined;
-
 function assertSafeName(name) {
   if (typeof name !== "string") {
     throw new Error(`Expected name to be a string; instead received '${(0, _util.inspect)(name)}'`);
   }
-
   if (!/^[@a-zA-Z0-9_]{1,63}$/.test(name)) {
     throw new Error(`Name '${name}' is not safe - either it is too long, too short, or has invalid characters`);
   }
 }
-
 var _default = (queryBuilderOptions = {}) => (from, fromAlias, resolveData, inOptions, withBuilder, context = {}, rootValue) => {
   const {
     pgQuery,
@@ -45,8 +34,8 @@ var _default = (queryBuilderOptions = {}) => (from, fromAlias, resolveData, inOp
     calculateHasNextPage,
     calculateHasPreviousPage,
     usesCursor: explicitlyUsesCursor
-  } = resolveData; // Push a query container for aggregates
-
+  } = resolveData;
+  // Push a query container for aggregates
   if (pgAggregateQuery && pgAggregateQuery.length || pgNamedQuery.length) {
     pgNamedQueryContainer.push({
       name: "aggregates",
@@ -63,9 +52,8 @@ var _default = (queryBuilderOptions = {}) => (from, fromAlias, resolveData, inOp
   where ${queryBuilder.buildWhereClause(false, false, options)}
 )`
     });
-  } // Convert pgAggregateQuery to pgNamedQueryContainer/pgNamedQuery combo
-
-
+  }
+  // Convert pgAggregateQuery to pgNamedQueryContainer/pgNamedQuery combo
   if (pgAggregateQuery && pgAggregateQuery.length) {
     // And a query for each previous query
     pgAggregateQuery.forEach(query => {
@@ -75,9 +63,9 @@ var _default = (queryBuilderOptions = {}) => (from, fromAlias, resolveData, inOp
       });
     });
   }
-
   const preventAsterisk = pgDontUseAsterisk ? pgDontUseAsterisk.length > 0 : false;
-  const options = { ...inOptions,
+  const options = {
+    ...inOptions,
     // Allow pgDontUseAsterisk to override useAsterisk
     useAsterisk: inOptions.useAsterisk && !preventAsterisk
   };
@@ -85,17 +73,14 @@ var _default = (queryBuilderOptions = {}) => (from, fromAlias, resolveData, inOp
   const rawCursorPrefix = reallyRawCursorPrefix && reallyRawCursorPrefix.filter(identity);
   const queryBuilder = new _QueryBuilder.default(queryBuilderOptions, context, rootValue);
   queryBuilder.from(from, fromAlias ? fromAlias : undefined);
-
   if (withBuilder) {
     withBuilder(queryBuilder);
   }
-
   if (pgQuery) {
     for (let i = 0, l = pgQuery.length; i < l; i++) {
       pgQuery[i](queryBuilder, resolveData);
     }
   }
-
   function generateNextPrevPageSql(sqlQueryAlias, canHaveCursorInWhere, queryHasBefore, queryHasFirst, offset = 0, invert = false) {
     /*
      * Strap in, 'coz this function gets hairy!
@@ -164,6 +149,7 @@ var _default = (queryBuilderOptions = {}) => (from, fromAlias, resolveData, inOp
      * hasNextPage we always pretend we're determining `hasNextPage`, and we
      * just invert everything.
      */
+
     const sqlCommonUnbounded = sql.fragment`\
 select 1
 from ${queryBuilder.getTableExpression()} as ${queryBuilder.getTableAlias()}`;
@@ -182,29 +168,26 @@ from ${queryBuilder.getTableExpression()} as ${queryBuilder.getTableAlias()}`;
      * upper bound. In hasPreviousPage mode (invert === true), it represents
      * everything from `(before || END)` backwards, with no lower bound.
      */
-
     const sqlCommon = sql.fragment`\
 ${sqlCommonUnbounded}
 where ${queryBuilder.buildWhereClause(!invert, invert, options)}`;
+
     /*
      * Since the offset makes the diagram asymmetric, if offset === 0
      * then the diagram is symmetric and things are simplified a little.
      */
-
     const isForwardOrSymmetric = !invert || offset === 0;
-
     if (!isForwardOrSymmetric) {
       (0, _assert.default)(invert);
-      (0, _assert.default)(offset > 0); // We're looking for a previous page, and there's an offset, so lets just
+      (0, _assert.default)(offset > 0);
+      // We're looking for a previous page, and there's an offset, so lets just
       // assume there's a previous page where offset is smaller.
-
       return sql.literal(true);
     } else if (canHaveCursorInWhere) {
       (0, _assert.default)(isForwardOrSymmetric);
-
       if (!queryHasBefore && !queryHasFirst) {
-        (0, _assert.default)(isForwardOrSymmetric); // There can be no next page since there's no upper bound
-
+        (0, _assert.default)(isForwardOrSymmetric);
+        // There can be no next page since there's no upper bound
         return sql.literal(false);
       } else if (queryHasBefore && !queryHasFirst) {
         /*
@@ -224,8 +207,8 @@ exists(
   and not (${queryBuilder.buildWhereBoundClause(invert)})
 )`;
       } else {
-        (0, _assert.default)(queryHasFirst); // queryHasBefore could be true or false.
-
+        (0, _assert.default)(queryHasFirst);
+        // queryHasBefore could be true or false.
         /*
          * There's a few ways that we could determine if there's a next page.
          *
@@ -245,7 +228,6 @@ exists(
          */
         // Drop the `first` limit, see if there are any records that aren't
         // already in the list we've fetched.
-
         return sql.fragment`\
 exists(
   ${sqlCommon}
@@ -255,22 +237,20 @@ exists(
       }
     } else {
       (0, _assert.default)(!invert || offset === 0); // isForwardOrSymmetric
-
-      (0, _assert.default)(!canHaveCursorInWhere); // We're dealing with LIMIT/OFFSET pagination here, which means `natural`
+      (0, _assert.default)(!canHaveCursorInWhere);
+      // We're dealing with LIMIT/OFFSET pagination here, which means `natural`
       // cursors, so the `queryBuilder` factors the before/after, first/last
       // into the limit / offset.
-
       const {
         limit
       } = queryBuilder.getFinalLimitAndOffset();
-
       if (limit == null) {
         // If paginating backwards, then offset > 0 has already been dealt
         // with. Unbounded, so there's no next page.
         return sql.fragment`false`;
       } else if (invert) {
-        (0, _assert.default)(offset === 0); // Paginating backwards and there's no offset (which factors in before/after), so there's no previous page.
-
+        (0, _assert.default)(offset === 0);
+        // Paginating backwards and there's no offset (which factors in before/after), so there's no previous page.
         return sql.fragment`false`;
       } else {
         (0, _assert.default)(!invert);
@@ -280,7 +260,6 @@ exists(
          *
          * We want to see if there's more than limit+offset records in sqlCommon.
          */
-
         return sql.fragment`\
 exists(
   ${sqlCommon}
@@ -289,15 +268,12 @@ exists(
       }
     }
   }
-
   const getPgCursorPrefix = () => rawCursorPrefix && rawCursorPrefix.length > 0 ? rawCursorPrefix : queryBuilder.data.cursorPrefix.map(val => sql.literal(val));
-
   if (options.withPagination || options.withPaginationAsFields || options.withCursor) {
     // Sometimes we need a __cursor even if it's not a collection; e.g. to get the edge field on a mutation
     if (usesCursor) {
       queryBuilder.selectCursor(() => {
         const orderBy = queryBuilder.getOrderByExpressionsAndDirections().map(([expr]) => expr);
-
         if (queryBuilder.isOrderUnique() && orderBy.length > 0) {
           return sql.fragment`json_build_array(${sql.join([...getPgCursorPrefix(), sql.fragment`json_build_array(${sql.join(orderBy, ", ")})`], ", ")})`;
         } else {
@@ -307,46 +283,37 @@ exists(
            * query with limit offset is in a subquery, so our row_number()
            * call doesn't know about it. Here we add the offset back in
            * again. See matching NOTE in QueryBuilder.js.
-           */
-          options.useAsterisk ? sql.fragment`${sql.literal(queryBuilder.getFinalOffset() || 0)} + ` : sql.fragment``}(row_number() over (partition by 1)))`;
+           */options.useAsterisk ? sql.fragment`${sql.literal(queryBuilder.getFinalOffset() || 0)} + ` : sql.fragment``}(row_number() over (partition by 1)))`;
         }
       });
     }
   }
-
   if (options.withPagination || options.withPaginationAsFields) {
     queryBuilder.setCursorComparator((cursorValue, isAfter) => {
       function badCursor() {
         queryBuilder.whereBound(sql.fragment`false`, isAfter);
       }
-
       const orderByExpressionsAndDirections = queryBuilder.getOrderByExpressionsAndDirections();
-
       if (orderByExpressionsAndDirections.length > 0) {
         if (!queryBuilder.isOrderUnique()) {
           throw new Error("The order supplied is not unique, so before/after cursors cannot be used. Please ensure the supplied order includes all the columns from the primary key or a unique constraint.");
         }
-
         const rawPrefixes = cursorValue.slice(0, cursorValue.length - 1);
         const rawCursors = cursorValue[cursorValue.length - 1];
-
         if (rawPrefixes.length !== getPgCursorPrefix().length) {
           badCursor();
           return;
         }
-
         if (!Array.isArray(rawCursors)) {
           badCursor();
           return;
         }
-
         let sqlFilter = sql.fragment`false`;
         const sqlCursors = rawCursors.map(val => sql.value(val));
-
         for (let i = orderByExpressionsAndDirections.length - 1; i >= 0; i--) {
-          const [sqlExpression, ascending] = orderByExpressionsAndDirections[i]; // If ascending and isAfter then >
+          const [sqlExpression, ascending] = orderByExpressionsAndDirections[i];
+          // If ascending and isAfter then >
           // If ascending and isBefore then <
-
           const comparison = Number(ascending) ^ Number(!isAfter) ? sql.fragment`>` : sql.fragment`<`;
           const sqlOldFilter = sqlFilter;
           sqlFilter = sql.fragment`\
@@ -359,17 +326,17 @@ OR\
     ${sqlOldFilter}\
   )\
 )`;
-        } // Check the cursor prefixes apply
-        // TODO:v5: we should be able to do this in JS-land rather than SQL-land
-
+        }
 
+        // Check the cursor prefixes apply
+        // TODO:v5: we should be able to do this in JS-land rather than SQL-land
         sqlFilter = sql.fragment`(((${sql.join(getPgCursorPrefix(), ", ")}) = (${sql.join(rawPrefixes.map(val => sql.value(val)), ", ")})) AND (${sqlFilter}))`;
         queryBuilder.whereBound(sqlFilter, isAfter);
-      } else if (cursorValue[0] === "natural" && (0, _isSafeInteger.default)(cursorValue[1]) && // $FlowFixMe: we know this is a number
+      } else if (cursorValue[0] === "natural" && (0, _isSafeInteger.default)(cursorValue[1]) &&
+      // $FlowFixMe: we know this is a number
       cursorValue[1] >= 0) {
         // $FlowFixMe: we know this is a number
         const cursorValue1 = cursorValue[1];
-
         if (isAfter) {
           queryBuilder.offset(() => cursorValue1);
         } else {
@@ -385,7 +352,8 @@ OR\
     const query = queryBuilder.build(options);
     const haveFields = queryBuilder.getSelectFieldsCount() > 0;
     const sqlQueryAlias = sql.identifier(Symbol());
-    const sqlSummaryAlias = sql.identifier(Symbol()); //
+    const sqlSummaryAlias = sql.identifier(Symbol());
+    //
     // Tables should ALWAYS push their PK onto the order stack, if this isn't
     // present then we're either dealing with a view or a table without a PK.
     // Either way, we don't have anything to guarantee uniqueness so we need to
@@ -394,7 +362,6 @@ OR\
     // TODO: support unique keys in PgAllRows etc
     // TODO: add a warning for cursor-based pagination when using the fallback
     // TODO: if it is a view maybe add a warning encouraging pgViewUniqueKey
-
     const canHaveCursorInWhere = queryBuilder.getOrderByExpressionsAndDirections().length > 0 && queryBuilder.isOrderUnique();
     const queryHasBefore = queryBuilder.compiledData.whereBound.upper.length > 0;
     const queryHasAfter = queryBuilder.compiledData.whereBound.lower.length > 0;
@@ -406,19 +373,15 @@ OR\
     const sqlWith = haveFields ? sql.fragment`with ${sqlQueryAlias} as (${query}), ${sqlSummaryAlias} as (select json_agg(to_json(${sqlQueryAlias})) as data from ${sqlQueryAlias})` : sql.fragment``;
     const sqlFrom = sql.fragment``;
     const fields = [];
-
     if (haveFields) {
       fields.push([sql.fragment`coalesce((select ${sqlSummaryAlias}.data from ${sqlSummaryAlias}), '[]'::json)`, "data"]);
-
       if (calculateHasNextPage) {
         fields.push([hasNextPage, "hasNextPage"]);
       }
-
       if (calculateHasPreviousPage) {
         fields.push([hasPreviousPage, "hasPreviousPage"]);
       }
     }
-
     if (pgNamedQuery && pgNamedQuery.length) {
       const groups = {};
       pgNamedQuery.forEach(({
@@ -426,35 +389,30 @@ OR\
         query
       }) => {
         assertSafeName(name);
-
         if (!groups[name]) {
           groups[name] = [];
         }
-
         groups[name].push(query);
       });
       Object.keys(groups).forEach(groupName => {
-        const queryCallbacks = groups[groupName]; // Get container
+        const queryCallbacks = groups[groupName];
 
+        // Get container
         const containers = pgNamedQueryContainer.filter(c => c.name === groupName);
-
         if (containers.length === 0) {
           throw new Error(`${queryCallbacks.length} pgNamedQuery entries with name: '${groupName}' existed, but there was no matching pgNamedQueryContainer.`);
         }
-
         if (containers.length > 1) {
           throw new Error(`${containers.length} pgNamedQueryContainer entries with name: '${groupName}' existed, but there should be exactly one.`);
         }
-
         const container = containers[0];
         const innerQueryBuilder = new _QueryBuilder.default(queryBuilderOptions, context, rootValue);
         innerQueryBuilder.from(queryBuilder.getTableExpression(), queryBuilder.getTableAlias());
-
         for (let i = 0, l = queryCallbacks.length; i < l; i++) {
           queryCallbacks[i](innerQueryBuilder);
-        } // Generate the SQL statement (e.g. `select ${innerQueryBuilder.build({onlyJsonField: true})} from ${queryBuilder.getTableExpression()} as ...`)
-
+        }
 
+        // Generate the SQL statement (e.g. `select ${innerQueryBuilder.build({onlyJsonField: true})} from ${queryBuilder.getTableExpression()} as ...`)
         const aggregatesSql = container.query({
           queryBuilder,
           innerQueryBuilder,
@@ -463,7 +421,6 @@ OR\
         fields.push([aggregatesSql, groupName]);
       });
     }
-
     if (options.withPaginationAsFields) {
       return sql.fragment`${sqlWith} select ${sql.join(fields.map(([expr, alias]) => sql.fragment`${expr} as ${sql.identifier(alias)}`), ", ")} ${sqlFrom}`;
     } else {
@@ -474,6 +431,5 @@ OR\
     return query;
   }
 };
-
 exports.default = _default;
 //# sourceMappingURL=queryFromResolveDataFactory.js.map

package/node8plus/queryFromResolveDataFactory.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/queryFromResolveDataFactory.js"],"names":["identity","_","undefined","assertSafeName","name","Error","test","queryBuilderOptions","from","fromAlias","resolveData","inOptions","withBuilder","context","rootValue","pgQuery","pgAggregateQuery","pgNamedQueryContainer","pgNamedQuery","pgCursorPrefix","reallyRawCursorPrefix","pgDontUseAsterisk","calculateHasNextPage","calculateHasPreviousPage","usesCursor","explicitlyUsesCursor","length","push","query","queryBuilder","options","innerQueryBuilder","sql","fragment","build","onlyJsonField","getTableExpression","getTableAlias","buildWhereClause","forEach","preventAsterisk","useAsterisk","rawCursorPrefix","filter","QueryBuilder","i","l","generateNextPrevPageSql","sqlQueryAlias","canHaveCursorInWhere","queryHasBefore","queryHasFirst","offset","invert","sqlCommonUnbounded","sqlCommon","isForwardOrSymmetric","literal","buildWhereBoundClause","getSelectCursor","blank","value","limit","getFinalLimitAndOffset","getPgCursorPrefix","data","cursorPrefix","map","val","withPagination","withPaginationAsFields","withCursor","selectCursor","orderBy","getOrderByExpressionsAndDirections","expr","isOrderUnique","join","getFinalOffset","setCursorComparator","cursorValue","isAfter","badCursor","whereBound","orderByExpressionsAndDirections","rawPrefixes","slice","rawCursors","Array","isArray","sqlFilter","sqlCursors","sqlExpression","ascending","comparison","Number","sqlOldFilter","null","cursorValue1","getOffset","Math","max","haveFields","getSelectFieldsCount","identifier","Symbol","sqlSummaryAlias","compiledData","upper","queryHasAfter","lower","queryHasZeroLimit","getFinalLimit","first","queryHasLast","last","hasNextPage","hasPreviousPage","sqlWith","sqlFrom","fields","groups","Object","keys","groupName","queryCallbacks","containers","c","container","aggregatesSql","alias","jsonbBuildObject"],"mappings":";;;;;;;AACA;;AAGA;;AAGA;;AACA;;AACA;;;;;;;;AAKA,MAAMA,QAAQ,GAAGC,CAAC,IAAIA,CAAC,KAAK,IAAN,IAAcA,CAAC,KAAKC,SAA1C;;AAEA,SAASC,cAAT,CAAwBC,IAAxB,EAAqC;AACnC,MAAI,OAAOA,IAAP,KAAgB,QAApB,EAA8B;AAC5B,UAAM,IAAIC,KAAJ,CACH,mDAAkD,mBAAQD,IAAR,CAAc,GAD7D,CAAN;AAGD;;AACD,MAAI,CAAC,wBAAwBE,IAAxB,CAA6BF,IAA7B,CAAL,EAAyC;AACvC,UAAM,IAAIC,KAAJ,CACH,SAAQD,IAAK,6EADV,CAAN;AAGD;AACF;;eAEc,CAACG,mBAAwC,GAAG,EAA5C,KACb,CACEC,IADF,EAEEC,SAFF,EAGEC,WAHF,EAIEC,SAJF,EAgBEC,WAhBF,EAiBEC,OAAwB,GAAG,EAjB7B,EAkBEC,SAlBF,KAmBK;AACH,QAAM;AACJC,IAAAA,OADI;AAEJC,IAAAA,gBAFI;AAEc;AAClBC,IAAAA,qBAAqB,GAAG,EAHpB;AAIJC,IAAAA,YAAY,GAAG,EAJX;AAKJC,IAAAA,cAAc,EAAEC,qBALZ;AAMJC,IAAAA,iBANI;AAOJC,IAAAA,oBAPI;AAQJC,IAAAA,wBARI;AASJC,IAAAA,UAAU,EAAEC;AATR,MAUFf,WAVJ,CADG,CAYH;;AACA,MAAKM,gBAAgB,IAAIA,gBAAgB,CAACU,MAAtC,IAAiDR,YAAY,CAACQ,MAAlE,EAA0E;AACxET,IAAAA,qBAAqB,CAACU,IAAtB,CAA2B;AACzBvB,MAAAA,IAAI,EAAE,YADmB;AAEzBwB,MAAAA,KAAK,EAAE,CAAC;AAAEC,QAAAA,YAAF;AAAgBC,QAAAA,OAAhB;AAAyBC,QAAAA;AAAzB,OAAD,KAAkDC,GAAG,CAACC,QAAS;AAC9E;AACA,WAAWF,iBAAiB,CAACG,KAAlB,CAAwB;AAAEC,QAAAA,aAAa,EAAE;AAAjB,OAAxB,CAAiD;AAC5D,SAASN,YAAY,CAACO,kBAAb,EAAkC,OAAMP,YAAY,CAACQ,aAAb,EAA6B;AAC9E,UAAUR,YAAY,CAACS,gBAAb,CAA8B,KAA9B,EAAqC,KAArC,EAA4CR,OAA5C,CAAqD;AAC/D;AAPiC,KAA3B;AASD,GAvBE,CAwBH;;;AACA,MAAId,gBAAgB,IAAIA,gBAAgB,CAACU,MAAzC,EAAiD;AAC/C;AACAV,IAAAA,gBAAgB,CAACuB,OAAjB,CAAyBX,KAAK,IAAI;AAChCV,MAAAA,YAAY,CAACS,IAAb,CAAkB;AAAEvB,QAAAA,IAAI,EAAE,YAAR;AAAsBwB,QAAAA;AAAtB,OAAlB;AACD,KAFD;AAGD;;AAED,QAAMY,eAAe,GAAGnB,iBAAiB,GACrCA,iBAAiB,CAACK,MAAlB,GAA2B,CADU,GAErC,KAFJ;AAGA,QAAMI,OAAO,GAAG,EACd,GAAGnB,SADW;AAEd;AACA8B,IAAAA,WAAW,EAAE9B,SAAS,CAAC8B,WAAV,IAAyB,CAACD;AAHzB,GAAhB;AAMA,QAAMhB,UAAmB,GACtBC,oBAAoB,IAAIA,oBAAoB,CAACC,MAArB,GAA8B,CAAvD,IACCJ,oBAAoB,IAAIA,oBAAoB,CAACI,MAArB,GAA8B,CADvD,IAECH,wBAAwB,IAAIA,wBAAwB,CAACG,MAAzB,GAAkC,CAF/D,IAGA,KAJF;AAKA,QAAMgB,eAAe,GACnBtB,qBAAqB,IAAIA,qBAAqB,CAACuB,MAAtB,CAA6B3C,QAA7B,CAD3B;AAGA,QAAM6B,YAAY,GAAG,IAAIe,qBAAJ,CACnBrC,mBADmB,EAEnBM,OAFmB,EAGnBC,SAHmB,CAArB;AAKAe,EAAAA,YAAY,CAACrB,IAAb,CAAkBA,IAAlB,EAAwBC,SAAS,GAAGA,SAAH,GAAeP,SAAhD;;AAEA,MAAIU,WAAJ,EAAiB;AACfA,IAAAA,WAAW,CAACiB,YAAD,CAAX;AACD;;AACD,MAAId,OAAJ,EAAa;AACX,SAAK,IAAI8B,CAAC,GAAG,CAAR,EAAWC,CAAC,GAAG/B,OAAO,CAACW,MAA5B,EAAoCmB,CAAC,GAAGC,CAAxC,EAA2CD,CAAC,EAA5C,EAAgD;AAC9C9B,MAAAA,OAAO,CAAC8B,CAAD,CAAP,CAAWhB,YAAX,EAAyBnB,WAAzB;AACD;AACF;;AAED,WAASqC,uBAAT,CACEC,aADF,EAEEC,oBAFF,EAGEC,cAHF,EAIEC,aAJF,EAKEC,MAAM,GAAG,CALX,EAMEC,MAAM,GAAG,KANX,EAOE;AACA;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEM,UAAMC,kBAAkB,GAAGtB,GAAG,CAACC,QAAS;AAC9C;AACA,OAAOJ,YAAY,CAACO,kBAAb,EAAkC,OAAMP,YAAY,CAACQ,aAAb,EAA6B,EAFtE;AAGA;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACM,UAAMkB,SAAS,GAAGvB,GAAG,CAACC,QAAS;AACrC,EAAEqB,kBAAmB;AACrB,QAAQzB,YAAY,CAACS,gBAAb,CAA8B,CAACe,MAA/B,EAAuCA,MAAvC,EAA+CvB,OAA/C,CAAwD,EAF1D;AAIA;AACN;AACA;AACA;;AACM,UAAM0B,oBAAoB,GAAG,CAACH,MAAD,IAAWD,MAAM,KAAK,CAAnD;;AAEA,QAAI,CAACI,oBAAL,EAA2B;AACzB,2BAAOH,MAAP;AACA,2BAAOD,MAAM,GAAG,CAAhB,EAFyB,CAGzB;AACA;;AACA,aAAOpB,GAAG,CAACyB,OAAJ,CAAY,IAAZ,CAAP;AACD,KAND,MAMO,IAAIR,oBAAJ,EAA0B;AAC/B,2BAAOO,oBAAP;;AACA,UAAI,CAACN,cAAD,IAAmB,CAACC,aAAxB,EAAuC;AACrC,6BAAOK,oBAAP,EADqC,CAErC;;AACA,eAAOxB,GAAG,CAACyB,OAAJ,CAAY,KAAZ,CAAP;AACD,OAJD,MAIO,IAAIP,cAAc,IAAI,CAACC,aAAvB,EAAsC;AAC3C;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACU,eAAOnB,GAAG,CAACC,QAAS;AAC9B;AACA,IAAIqB,kBAAmB;AACvB,UAAUzB,YAAY,CAACS,gBAAb,CAA8B,KAA9B,EAAqC,KAArC,EAA4CR,OAA5C,CAAqD;AAC/D,aAAaD,YAAY,CAAC6B,qBAAb,CAAmCL,MAAnC,CAA2C;AACxD,EALU;AAMD,OAjBM,MAiBA;AACL,6BAAOF,aAAP,EADK,CAEL;;AACA;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACU;AACA;;AACA,eAAOnB,GAAG,CAACC,QAAS;AAC9B;AACA,IAAIsB,SAAU;AACd,SAAS1B,YAAY,CAAC8B,eAAb,EAA+B,8CAA6CX,aAAc;AACnG,IAAII,MAAM,KAAK,CAAX,GAAepB,GAAG,CAAC4B,KAAnB,GAA2B5B,GAAG,CAACC,QAAS,UAASD,GAAG,CAAC6B,KAAJ,CAAUT,MAAV,CAAkB,EAAE;AACzE,EALU;AAMD;AACF,KApDM,MAoDA;AACL,2BAAO,CAACC,MAAD,IAAWD,MAAM,KAAK,CAA7B,EADK,CAC4B;;AACjC,2BAAO,CAACH,oBAAR,EAFK,CAGL;AACA;AACA;;AACA,YAAM;AAAEa,QAAAA;AAAF,UAAYjC,YAAY,CAACkC,sBAAb,EAAlB;;AAEA,UAAID,KAAK,IAAI,IAAb,EAAmB;AACjB;AACA;AACA,eAAO9B,GAAG,CAACC,QAAS,OAApB;AACD,OAJD,MAIO,IAAIoB,MAAJ,EAAY;AACjB,6BAAOD,MAAM,KAAK,CAAlB,EADiB,CAEjB;;AACA,eAAOpB,GAAG,CAACC,QAAS,OAApB;AACD,OAJM,MAIA;AACL,6BAAO,CAACoB,MAAR;AACA;AACV;AACA;AACA;AACA;AACA;;AACU,eAAOrB,GAAG,CAACC,QAAS;AAC9B;AACA,IAAIsB,SAAU;AACd,WAAWvB,GAAG,CAACyB,OAAJ,CAAYK,KAAK,GAAGV,MAApB,CAA4B;AACvC,EAJU;AAKD;AACF;AACF;;AACD,QAAMY,iBAAiB,GAAG,MACxBtB,eAAe,IAAIA,eAAe,CAAChB,MAAhB,GAAyB,CAA5C,GACIgB,eADJ,GAEIb,YAAY,CAACoC,IAAb,CAAkBC,YAAlB,CAA+BC,GAA/B,CAAmCC,GAAG,IAAIpC,GAAG,CAACyB,OAAJ,CAAYW,GAAZ,CAA1C,CAHN;;AAIA,MACEtC,OAAO,CAACuC,cAAR,IACAvC,OAAO,CAACwC,sBADR,IAEAxC,OAAO,CAACyC,UAHV,EAIE;AACA;AACA,QAAI/C,UAAJ,EAAgB;AACdK,MAAAA,YAAY,CAAC2C,YAAb,CAA0B,MAAW;AACnC,cAAMC,OAAO,GAAG5C,YAAY,CACzB6C,kCADa,GAEbP,GAFa,CAET,CAAC,CAACQ,IAAD,CAAD,KAAYA,IAFH,CAAhB;;AAGA,YAAI9C,YAAY,CAAC+C,aAAb,MAAgCH,OAAO,CAAC/C,MAAR,GAAiB,CAArD,EAAwD;AACtD,iBAAOM,GAAG,CAACC,QAAS,oBAAmBD,GAAG,CAAC6C,IAAJ,CACrC,CACE,GAAGb,iBAAiB,EADtB,EAEEhC,GAAG,CAACC,QAAS,oBAAmBD,GAAG,CAAC6C,IAAJ,CAASJ,OAAT,EAAkB,IAAlB,CAAwB,GAF1D,CADqC,EAKrC,IALqC,CAMrC,GANF;AAOD,SARD,MAQO;AACL,iBAAOzC,GAAG,CAACC,QAAS,oBAAmBD,GAAG,CAAC6C,IAAJ,CACrCb,iBAAiB,EADoB,EAErC,IAFqC,CAGrC;AACA;AACd;AACA;AACA;AACA;AACA;AACclC,UAAAA,OAAO,CAACW,WAAR,GACIT,GAAG,CAACC,QAAS,GAAED,GAAG,CAACyB,OAAJ,CACb5B,YAAY,CAACiD,cAAb,MAAiC,CADpB,CAEb,KAHN,GAII9C,GAAG,CAACC,QAAS,EAClB,uCAfD;AAgBD;AACF,OA9BD;AA+BD;AACF;;AACD,MAAIH,OAAO,CAACuC,cAAR,IAA0BvC,OAAO,CAACwC,sBAAtC,EAA8D;AAC5DzC,IAAAA,YAAY,CAACkD,mBAAb,CAAiC,CAACC,WAAD,EAAcC,OAAd,KAA0B;AACzD,eAASC,SAAT,GAAqB;AACnBrD,QAAAA,YAAY,CAACsD,UAAb,CAAwBnD,GAAG,CAACC,QAAS,OAArC,EAA6CgD,OAA7C;AACD;;AACD,YAAMG,+BAA+B,GACnCvD,YAAY,CAAC6C,kCAAb,EADF;;AAEA,UAAIU,+BAA+B,CAAC1D,MAAhC,GAAyC,CAA7C,EAAgD;AAC9C,YAAI,CAACG,YAAY,CAAC+C,aAAb,EAAL,EAAmC;AACjC,gBAAM,IAAIvE,KAAJ,CACJ,kLADI,CAAN;AAGD;;AACD,cAAMgF,WAAW,GAAGL,WAAW,CAACM,KAAZ,CAAkB,CAAlB,EAAqBN,WAAW,CAACtD,MAAZ,GAAqB,CAA1C,CAApB;AACA,cAAM6D,UAAU,GAAGP,WAAW,CAACA,WAAW,CAACtD,MAAZ,GAAqB,CAAtB,CAA9B;;AACA,YAAI2D,WAAW,CAAC3D,MAAZ,KAAuBsC,iBAAiB,GAAGtC,MAA/C,EAAuD;AACrDwD,UAAAA,SAAS;AACT;AACD;;AACD,YAAI,CAACM,KAAK,CAACC,OAAN,CAAcF,UAAd,CAAL,EAAgC;AAC9BL,UAAAA,SAAS;AACT;AACD;;AACD,YAAIQ,SAAS,GAAG1D,GAAG,CAACC,QAAS,OAA7B;AACA,cAAM0D,UAAU,GAAGJ,UAAU,CAACpB,GAAX,CAAeC,GAAG,IAAIpC,GAAG,CAAC6B,KAAJ,CAAUO,GAAV,CAAtB,CAAnB;;AACA,aACE,IAAIvB,CAAC,GAAGuC,+BAA+B,CAAC1D,MAAhC,GAAyC,CADnD,EAEEmB,CAAC,IAAI,CAFP,EAGEA,CAAC,EAHH,EAIE;AACA,gBAAM,CAAC+C,aAAD,EAAgBC,SAAhB,IACJT,+BAA+B,CAACvC,CAAD,CADjC,CADA,CAGA;AACA;;AACA,gBAAMiD,UAAU,GACdC,MAAM,CAACF,SAAD,CAAN,GAAoBE,MAAM,CAAC,CAACd,OAAF,CAA1B,GACIjD,GAAG,CAACC,QAAS,GADjB,GAEID,GAAG,CAACC,QAAS,GAHnB;AAKA,gBAAM+D,YAAY,GAAGN,SAArB;AACAA,UAAAA,SAAS,GAAG1D,GAAG,CAACC,QAAS;AACrC;AACA,KAAK2D,aAAc,IAAGE,UAAW,IAAGH,UAAU,CAAC9C,CAAD,CAAV,IAAiBb,GAAG,CAACiE,IAAK;AAC9D;AACA;AACA,MAAML,aAAc,MAAKD,UAAU,CAAC9C,CAAD,CAAV,IAAiBb,GAAG,CAACiE,IAAK;AACnD;AACA,MAAMD,YAAa;AACnB;AACA,EATY;AAUD,SA3C6C,CA6C9C;AACA;;;AACAN,QAAAA,SAAS,GAAG1D,GAAG,CAACC,QAAS,MAAKD,GAAG,CAAC6C,IAAJ,CAC5Bb,iBAAiB,EADW,EAE5B,IAF4B,CAG5B,QAAOhC,GAAG,CAAC6C,IAAJ,CACPQ,WAAW,CAAClB,GAAZ,CAAgBC,GAAG,IAAIpC,GAAG,CAAC6B,KAAJ,CAAUO,GAAV,CAAvB,CADO,EAEP,IAFO,CAGP,WAAUsB,SAAU,IANtB;AAOA7D,QAAAA,YAAY,CAACsD,UAAb,CAAwBO,SAAxB,EAAmCT,OAAnC;AACD,OAvDD,MAuDO,IACLD,WAAW,CAAC,CAAD,CAAX,KAAmB,SAAnB,IACA,4BAAcA,WAAW,CAAC,CAAD,CAAzB,CADA,IAEA;AACAA,MAAAA,WAAW,CAAC,CAAD,CAAX,IAAkB,CAJb,EAKL;AACA;AACA,cAAMkB,YAAoB,GAAGlB,WAAW,CAAC,CAAD,CAAxC;;AACA,YAAIC,OAAJ,EAAa;AACXpD,UAAAA,YAAY,CAACuB,MAAb,CAAoB,MAAM8C,YAA1B;AACD,SAFD,MAEO;AACLrE,UAAAA,YAAY,CAACiC,KAAb,CAAmB,MAAM;AACvB,kBAAMV,MAAM,GAAGvB,YAAY,CAACsE,SAAb,EAAf;AACA,mBAAOC,IAAI,CAACC,GAAL,CAAS,CAAT,EAAYH,YAAY,GAAG9C,MAAf,GAAwB,CAApC,CAAP;AACD,WAHD;AAID;AACF,OAhBM,MAgBA;AACL,cAAM,IAAI/C,KAAJ,CACJ,sDADI,CAAN;AAGD;AACF,KAlFD;AAoFA,UAAMuB,KAAK,GAAGC,YAAY,CAACK,KAAb,CAAmBJ,OAAnB,CAAd;AACA,UAAMwE,UAAU,GAAGzE,YAAY,CAAC0E,oBAAb,KAAsC,CAAzD;AACA,UAAMvD,aAAa,GAAGhB,GAAG,CAACwE,UAAJ,CAAeC,MAAM,EAArB,CAAtB;AACA,UAAMC,eAAe,GAAG1E,GAAG,CAACwE,UAAJ,CAAeC,MAAM,EAArB,CAAxB,CAxF4D,CAyF5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AACA,UAAMxD,oBAAoB,GACxBpB,YAAY,CAAC6C,kCAAb,GAAkDhD,MAAlD,GAA2D,CAA3D,IACAG,YAAY,CAAC+C,aAAb,EAFF;AAGA,UAAM1B,cAAc,GAClBrB,YAAY,CAAC8E,YAAb,CAA0BxB,UAA1B,CAAqCyB,KAArC,CAA2ClF,MAA3C,GAAoD,CADtD;AAEA,UAAMmF,aAAa,GACjBhF,YAAY,CAAC8E,YAAb,CAA0BxB,UAA1B,CAAqC2B,KAArC,CAA2CpF,MAA3C,GAAoD,CADtD;AAEA,UAAMqF,iBAAiB,GAAGlF,YAAY,CAACmF,aAAb,OAAiC,CAA3D;AACA,UAAM7D,aAAa,GAAG,4BAActB,YAAY,CAAC8E,YAAb,CAA0BM,KAAxC,CAAtB;AACA,UAAMC,YAAY,GAAG,4BAAcrF,YAAY,CAAC8E,YAAb,CAA0BQ,IAAxC,CAArB;AACA,UAAMC,WAAW,GAAGL,iBAAiB,GACjC/E,GAAG,CAACyB,OAAJ,CAAY,KAAZ,CADiC,GAEjCV,uBAAuB,CACrBC,aADqB,EAErBC,oBAFqB,EAGrBC,cAHqB,EAIrBC,aAJqB,EAKrBtB,YAAY,CAACiD,cAAb,MAAiC,CALZ,CAF3B;AASA,UAAMuC,eAAe,GAAGN,iBAAiB,GACrC/E,GAAG,CAACyB,OAAJ,CAAY,KAAZ,CADqC,GAErCV,uBAAuB,CACrBC,aADqB,EAErBC,oBAFqB,EAGrB4D,aAHqB,EAIrBK,YAJqB,EAKrBrF,YAAY,CAACiD,cAAb,MAAiC,CALZ,EAMrB,IANqB,CAF3B;AAWA,UAAMwC,OAAO,GAAGhB,UAAU,GACtBtE,GAAG,CAACC,QAAS,QAAOe,aAAc,QAAOpB,KAAM,MAAK8E,eAAgB,gCAA+B1D,aAAc,mBAAkBA,aAAc,GAD3H,GAEtBhB,GAAG,CAACC,QAAS,EAFjB;AAGA,UAAMsF,OAAO,GAAGvF,GAAG,CAACC,QAAS,EAA7B;AACA,UAAMuF,MAA8B,GAAG,EAAvC;;AACA,QAAIlB,UAAJ,EAAgB;AACdkB,MAAAA,MAAM,CAAC7F,IAAP,CAAY,CACVK,GAAG,CAACC,QAAS,oBAAmByE,eAAgB,cAAaA,eAAgB,gBADnE,EAEV,MAFU,CAAZ;;AAIA,UAAIpF,oBAAJ,EAA0B;AACxBkG,QAAAA,MAAM,CAAC7F,IAAP,CAAY,CAACyF,WAAD,EAAc,aAAd,CAAZ;AACD;;AACD,UAAI7F,wBAAJ,EAA8B;AAC5BiG,QAAAA,MAAM,CAAC7F,IAAP,CAAY,CAAC0F,eAAD,EAAkB,iBAAlB,CAAZ;AACD;AACF;;AACD,QAAInG,YAAY,IAAIA,YAAY,CAACQ,MAAjC,EAAyC;AACvC,YAAM+F,MAAM,GAAG,EAAf;AACAvG,MAAAA,YAAY,CAACqB,OAAb,CAAqB,CAAC;AAAEnC,QAAAA,IAAF;AAAQwB,QAAAA;AAAR,OAAD,KAAqB;AACxCzB,QAAAA,cAAc,CAACC,IAAD,CAAd;;AACA,YAAI,CAACqH,MAAM,CAACrH,IAAD,CAAX,EAAmB;AACjBqH,UAAAA,MAAM,CAACrH,IAAD,CAAN,GAAe,EAAf;AACD;;AACDqH,QAAAA,MAAM,CAACrH,IAAD,CAAN,CAAauB,IAAb,CAAkBC,KAAlB;AACD,OAND;AAOA8F,MAAAA,MAAM,CAACC,IAAP,CAAYF,MAAZ,EAAoBlF,OAApB,CAA4BqF,SAAS,IAAI;AACvC,cAAMC,cAAc,GAAGJ,MAAM,CAACG,SAAD,CAA7B,CADuC,CAGvC;;AACA,cAAME,UAAU,GAAG7G,qBAAqB,CAAC0B,MAAtB,CACjBoF,CAAC,IAAIA,CAAC,CAAC3H,IAAF,KAAWwH,SADC,CAAnB;;AAGA,YAAIE,UAAU,CAACpG,MAAX,KAAsB,CAA1B,EAA6B;AAC3B,gBAAM,IAAIrB,KAAJ,CACH,GAAEwH,cAAc,CAACnG,MAAO,qCAAoCkG,SAAU,6DADnE,CAAN;AAGD;;AACD,YAAIE,UAAU,CAACpG,MAAX,GAAoB,CAAxB,EAA2B;AACzB,gBAAM,IAAIrB,KAAJ,CACH,GAAEyH,UAAU,CAACpG,MAAO,8CAA6CkG,SAAU,6CADxE,CAAN;AAGD;;AACD,cAAMI,SAAS,GAAGF,UAAU,CAAC,CAAD,CAA5B;AAEA,cAAM/F,iBAAiB,GAAG,IAAIa,qBAAJ,CACxBrC,mBADwB,EAExBM,OAFwB,EAGxBC,SAHwB,CAA1B;AAKAiB,QAAAA,iBAAiB,CAACvB,IAAlB,CACEqB,YAAY,CAACO,kBAAb,EADF,EAEEP,YAAY,CAACQ,aAAb,EAFF;;AAKA,aAAK,IAAIQ,CAAC,GAAG,CAAR,EAAWC,CAAC,GAAG+E,cAAc,CAACnG,MAAnC,EAA2CmB,CAAC,GAAGC,CAA/C,EAAkDD,CAAC,EAAnD,EAAuD;AACrDgF,UAAAA,cAAc,CAAChF,CAAD,CAAd,CAAkBd,iBAAlB;AACD,SA/BsC,CAiCvC;;;AACA,cAAMkG,aAAa,GAAGD,SAAS,CAACpG,KAAV,CAAgB;AACpCC,UAAAA,YADoC;AAEpCE,UAAAA,iBAFoC;AAGpCD,UAAAA;AAHoC,SAAhB,CAAtB;AAMA0F,QAAAA,MAAM,CAAC7F,IAAP,CAAY,CAACsG,aAAD,EAAgBL,SAAhB,CAAZ;AACD,OAzCD;AA0CD;;AACD,QAAI9F,OAAO,CAACwC,sBAAZ,EAAoC;AAClC,aAAOtC,GAAG,CAACC,QAAS,GAAEqF,OAAQ,WAAUtF,GAAG,CAAC6C,IAAJ,CACtC2C,MAAM,CAACrD,GAAP,CACE,CAAC,CAACQ,IAAD,EAAOuD,KAAP,CAAD,KAAmBlG,GAAG,CAACC,QAAS,GAAE0C,IAAK,OAAM3C,GAAG,CAACwE,UAAJ,CAAe0B,KAAf,CAAsB,EADrE,CADsC,EAItC,IAJsC,CAKtC,IAAGX,OAAQ,EALb;AAMD,KAPD,MAOO;AACL,aAAOvF,GAAG,CAACC,QAAS,GAAEqF,OAAQ,WAAUzF,YAAY,CAACsG,gBAAb,CACtCX,MADsC,CAEtC,IAAGD,OAAQ,EAFb;AAGD;AACF,GAjND,MAiNO;AACL,UAAM3F,KAAK,GAAGC,YAAY,CAACK,KAAb,CAAmBJ,OAAnB,CAAd;AACA,WAAOF,KAAP;AACD;AACF,C","sourcesContent":["// @flow\nimport QueryBuilder from \"./QueryBuilder\";\nimport type { QueryBuilderOptions } from \"./QueryBuilder\";\nimport type { RawAlias } from \"./QueryBuilder\";\nimport * as sql from \"pg-sql2\";\nimport type { SQL } from \"pg-sql2\";\nimport type { DataForType } from \"graphile-build\";\nimport isSafeInteger from \"lodash/isSafeInteger\";\nimport assert from \"assert\";\nimport { inspect } from \"util\";\n\n// eslint-disable-next-line flowtype/no-weak-types\ntype GraphQLContext = any;\n\nconst identity = _ => _ !== null && _ !== undefined;\n\nfunction assertSafeName(name: mixed) {\n  if (typeof name !== \"string\") {\n    throw new Error(\n      `Expected name to be a string; instead received '${inspect(name)}'`\n    );\n  }\n  if (!/^[@a-zA-Z0-9_]{1,63}$/.test(name)) {\n    throw new Error(\n      `Name '${name}' is not safe - either it is too long, too short, or has invalid characters`\n    );\n  }\n}\n\nexport default (queryBuilderOptions: QueryBuilderOptions = {}) =>\n  (\n    from: SQL,\n    fromAlias: ?SQL,\n    resolveData: DataForType,\n    inOptions: {\n      withPagination?: boolean,\n      withPaginationAsFields?: boolean,\n      asJson?: boolean,\n      asJsonAggregate?: boolean,\n      addNullCase?: boolean,\n      addNotDistinctFromNullCase?: boolean,\n      onlyJsonField?: boolean,\n      useAsterisk?: boolean,\n      withCursor?: boolean,\n    },\n    // TODO:v5: context is not optional\n    withBuilder?: ((builder: QueryBuilder) => void) | null | void,\n    context?: GraphQLContext = {},\n    rootValue?: any // eslint-disable-line flowtype/no-weak-types\n  ) => {\n    const {\n      pgQuery,\n      pgAggregateQuery, // Shorthand for using pgNamedQueryContainer/pgNamedQuery combo\n      pgNamedQueryContainer = [],\n      pgNamedQuery = [],\n      pgCursorPrefix: reallyRawCursorPrefix,\n      pgDontUseAsterisk,\n      calculateHasNextPage,\n      calculateHasPreviousPage,\n      usesCursor: explicitlyUsesCursor,\n    } = resolveData;\n    // Push a query container for aggregates\n    if ((pgAggregateQuery && pgAggregateQuery.length) || pgNamedQuery.length) {\n      pgNamedQueryContainer.push({\n        name: \"aggregates\",\n        query: ({ queryBuilder, options, innerQueryBuilder }) => sql.fragment`\\\n(\n  select ${innerQueryBuilder.build({ onlyJsonField: true })}\n  from ${queryBuilder.getTableExpression()} as ${queryBuilder.getTableAlias()}\n  where ${queryBuilder.buildWhereClause(false, false, options)}\n)`,\n      });\n    }\n    // Convert pgAggregateQuery to pgNamedQueryContainer/pgNamedQuery combo\n    if (pgAggregateQuery && pgAggregateQuery.length) {\n      // And a query for each previous query\n      pgAggregateQuery.forEach(query => {\n        pgNamedQuery.push({ name: \"aggregates\", query });\n      });\n    }\n\n    const preventAsterisk = pgDontUseAsterisk\n      ? pgDontUseAsterisk.length > 0\n      : false;\n    const options = {\n      ...inOptions,\n      // Allow pgDontUseAsterisk to override useAsterisk\n      useAsterisk: inOptions.useAsterisk && !preventAsterisk,\n    };\n\n    const usesCursor: boolean =\n      (explicitlyUsesCursor && explicitlyUsesCursor.length > 0) ||\n      (calculateHasNextPage && calculateHasNextPage.length > 0) ||\n      (calculateHasPreviousPage && calculateHasPreviousPage.length > 0) ||\n      false;\n    const rawCursorPrefix =\n      reallyRawCursorPrefix && reallyRawCursorPrefix.filter(identity);\n\n    const queryBuilder = new QueryBuilder(\n      queryBuilderOptions,\n      context,\n      rootValue\n    );\n    queryBuilder.from(from, fromAlias ? fromAlias : undefined);\n\n    if (withBuilder) {\n      withBuilder(queryBuilder);\n    }\n    if (pgQuery) {\n      for (let i = 0, l = pgQuery.length; i < l; i++) {\n        pgQuery[i](queryBuilder, resolveData);\n      }\n    }\n\n    function generateNextPrevPageSql(\n      sqlQueryAlias,\n      canHaveCursorInWhere,\n      queryHasBefore,\n      queryHasFirst,\n      offset = 0,\n      invert = false\n    ) {\n      /*\n       * Strap in, 'coz this function gets hairy!\n       *\n       * The point of this function is to return SQL which will resolve to a\n       * boolean true/false depending on whether or not there is a (invert ?\n       * \"previous\" : \"next\") page.\n       *\n       * Connections have before, after, first, last and offset.\n       * - Users are forbidden from setting both first and last.\n       * - Users are forbidden from setting both offset and last.\n       *\n       * Further there are two main modes of paginating, one works by adding a\n       * where clause (this is preferred, but is not always possible, and is\n       * indicated by `canHaveCursorInWhere === true`) and the other works using\n       * standard LIMIT/OFFSET SQL pagination (and is indicated by\n       * `canHaveCursorInWhere === false`).\n       *\n       * The following diagram shows a full collection of records, #, starting at\n       * START and ending at END. The key after, before, offset, first and last\n       * variables are shown. One thing not show is that it's possible to have\n       * fewer records between before and after than requested by first or last.\n       * Another detail not clearly show is that if there is no `after` then\n       * `START` is used, similarly if there is no `before` then `END` is used.\n       *\n       *   #################################################### < collection\n       *   ^      ^<-offset->^<-first->^      ^<-last->^      ^\n       *   |      |          |         |      |        |      |\n       *   |      |          +---------+      +--------+      |\n       *   |      |          |  DATA1           DATA2  |      |\n       *   |      |          |                         |      |\n       *   |      |          |                         |      |\n       *   |      |          +-------------------------+      |\n       *   |      |                     DATA3          |      |\n       *   |    after                                before   |\n       *   |                                                  |\n       * START                                               END\n       *\n       * We want one of the three DATA blocks:\n       *\n       * - If `first` is set, then we want DATA1.\n       * - If `last` is set then we want DATA2.\n       * - If neither is set then we want DATA3.\n       *\n       * (Remember: you cannot set both `first` and `last` at the same time.)\n       *\n       * When invert === false:\n       *\n       *   Note that both DATA2 and DATA3 end at the same point, and we only care\n       *   if there's data *after* the relevant DATA block, so really we only\n       *   care if the query specified `first` (`queryHasFirst`) which makes\n       *   things complex (ending at the end of DATA1), otherwise we can use\n       *   `before` as the bound (end of DATA2/DATA3).\n       *\n       * When invert === true:\n       *\n       *   Similarly, DATA1 and DATA3 start at the same point, and we're going\n       *   backwards so we only care if there's data *before* the DATA block, so\n       *   really we just need to know if the query set `last` or not, but since\n       *   this is inverted we call it `queryHasFirst`.\n       *\n       * When `invert` is false we're calculating `hasNextPage`, when true we're\n       * calculating `hasPreviousPage`.\n       *\n       * Because of the near-symmetry of requesting hasPreviousPage vs\n       * hasNextPage we always pretend we're determining `hasNextPage`, and we\n       * just invert everything.\n       */\n\n      const sqlCommonUnbounded = sql.fragment`\\\nselect 1\nfrom ${queryBuilder.getTableExpression()} as ${queryBuilder.getTableAlias()}`;\n      /*\n       * This variable is a fragment to go into an `EXISTS(...)` call (after some tweaks).\n       *\n       * The buildWhereClause takes three arguments:\n       *\n       * - includeLowerBound (we want this for hasNextPage but not hasPreviousPage)\n       * - includeUpperBound (we want this for hasPreviousPage but not hasNextPage)\n       * - options (specifically `{addNullCase, addNotDistinctFromNullCase}`) -\n       *   we just pass this through.\n       *\n       * So in hasNextPage mode (invert === false), this common SQL ends up\n       * representing the collection from `(after || START)` onwards with no\n       * upper bound. In hasPreviousPage mode (invert === true), it represents\n       * everything from `(before || END)` backwards, with no lower bound.\n       */\n      const sqlCommon = sql.fragment`\\\n${sqlCommonUnbounded}\nwhere ${queryBuilder.buildWhereClause(!invert, invert, options)}`;\n\n      /*\n       * Since the offset makes the diagram asymmetric, if offset === 0\n       * then the diagram is symmetric and things are simplified a little.\n       */\n      const isForwardOrSymmetric = !invert || offset === 0;\n\n      if (!isForwardOrSymmetric) {\n        assert(invert);\n        assert(offset > 0);\n        // We're looking for a previous page, and there's an offset, so lets just\n        // assume there's a previous page where offset is smaller.\n        return sql.literal(true);\n      } else if (canHaveCursorInWhere) {\n        assert(isForwardOrSymmetric);\n        if (!queryHasBefore && !queryHasFirst) {\n          assert(isForwardOrSymmetric);\n          // There can be no next page since there's no upper bound\n          return sql.literal(false);\n        } else if (queryHasBefore && !queryHasFirst) {\n          /*\n           * We invert the upper buildWhereBoundClause to only represent the data\n           * after `before`, then check if there's at least one record in that set.\n           *\n           * This only works if the `before` cursor can be represented in the\n           * SQL WHERE clause, otherwise we're doing limit/offset pagination\n           * which requires different logic. It also only works if there's no\n           * `first` clause, otherwise there could be a next page before the\n           * `before` clause.\n           */\n          return sql.fragment`\\\nexists(\n  ${sqlCommonUnbounded}\n  where ${queryBuilder.buildWhereClause(false, false, options)}\n  and not (${queryBuilder.buildWhereBoundClause(invert)})\n)`;\n        } else {\n          assert(queryHasFirst);\n          // queryHasBefore could be true or false.\n          /*\n           * There's a few ways that we could determine if there's a next page.\n           *\n           * If !queryHasBefore, we could COUNT(*) the number of rows in\n           * `sqlCommon` and see if it's larger than `first`:\n           * `(select count(*) > ${first} from (${sqlCommon}) __random_table_alias__)`\n           *\n           * If !queryHasBefore, we could build a subquery table of offsetData\n           * from sqlCommon and see if it contains any rows:\n           * `EXISTS(select 1 from (${sqlCommon} OFFSET ${first}) __random_table_alias__)`.\n           *\n           * We could see if there's at least one row in sqlCommon that's not\n           * already in our chosen result set.\n           *\n           * We've chosen the latter approach here because it doesn't place a limit\n           * on queryHasBefore.\n           */\n          // Drop the `first` limit, see if there are any records that aren't\n          // already in the list we've fetched.\n          return sql.fragment`\\\nexists(\n  ${sqlCommon}\n  and (${queryBuilder.getSelectCursor()})::text not in (select __cursor::text from ${sqlQueryAlias})\n  ${offset === 0 ? sql.blank : sql.fragment`offset ${sql.value(offset)}`}\n)`;\n        }\n      } else {\n        assert(!invert || offset === 0); // isForwardOrSymmetric\n        assert(!canHaveCursorInWhere);\n        // We're dealing with LIMIT/OFFSET pagination here, which means `natural`\n        // cursors, so the `queryBuilder` factors the before/after, first/last\n        // into the limit / offset.\n        const { limit } = queryBuilder.getFinalLimitAndOffset();\n\n        if (limit == null) {\n          // If paginating backwards, then offset > 0 has already been dealt\n          // with. Unbounded, so there's no next page.\n          return sql.fragment`false`;\n        } else if (invert) {\n          assert(offset === 0);\n          // Paginating backwards and there's no offset (which factors in before/after), so there's no previous page.\n          return sql.fragment`false`;\n        } else {\n          assert(!invert);\n          /*\n           * We're paginating forwards; either there's a before, there's a first,\n           * or both.\n           *\n           * We want to see if there's more than limit+offset records in sqlCommon.\n           */\n          return sql.fragment`\\\nexists(\n  ${sqlCommon}\n  offset ${sql.literal(limit + offset)}\n)`;\n        }\n      }\n    }\n    const getPgCursorPrefix = () =>\n      rawCursorPrefix && rawCursorPrefix.length > 0\n        ? rawCursorPrefix\n        : queryBuilder.data.cursorPrefix.map(val => sql.literal(val));\n    if (\n      options.withPagination ||\n      options.withPaginationAsFields ||\n      options.withCursor\n    ) {\n      // Sometimes we need a __cursor even if it's not a collection; e.g. to get the edge field on a mutation\n      if (usesCursor) {\n        queryBuilder.selectCursor((): SQL => {\n          const orderBy = queryBuilder\n            .getOrderByExpressionsAndDirections()\n            .map(([expr]) => expr);\n          if (queryBuilder.isOrderUnique() && orderBy.length > 0) {\n            return sql.fragment`json_build_array(${sql.join(\n              [\n                ...getPgCursorPrefix(),\n                sql.fragment`json_build_array(${sql.join(orderBy, \", \")})`,\n              ],\n              \", \"\n            )})`;\n          } else {\n            return sql.fragment`json_build_array(${sql.join(\n              getPgCursorPrefix(),\n              \", \"\n            )}, ${\n              /*\n               * NOTE[useAsterisk/row_number]: If we have useAsterisk then the\n               * query with limit offset is in a subquery, so our row_number()\n               * call doesn't know about it. Here we add the offset back in\n               * again. See matching NOTE in QueryBuilder.js.\n               */\n              options.useAsterisk\n                ? sql.fragment`${sql.literal(\n                    queryBuilder.getFinalOffset() || 0\n                  )} + `\n                : sql.fragment``\n            }(row_number() over (partition by 1)))`;\n          }\n        });\n      }\n    }\n    if (options.withPagination || options.withPaginationAsFields) {\n      queryBuilder.setCursorComparator((cursorValue, isAfter) => {\n        function badCursor() {\n          queryBuilder.whereBound(sql.fragment`false`, isAfter);\n        }\n        const orderByExpressionsAndDirections =\n          queryBuilder.getOrderByExpressionsAndDirections();\n        if (orderByExpressionsAndDirections.length > 0) {\n          if (!queryBuilder.isOrderUnique()) {\n            throw new Error(\n              \"The order supplied is not unique, so before/after cursors cannot be used. Please ensure the supplied order includes all the columns from the primary key or a unique constraint.\"\n            );\n          }\n          const rawPrefixes = cursorValue.slice(0, cursorValue.length - 1);\n          const rawCursors = cursorValue[cursorValue.length - 1];\n          if (rawPrefixes.length !== getPgCursorPrefix().length) {\n            badCursor();\n            return;\n          }\n          if (!Array.isArray(rawCursors)) {\n            badCursor();\n            return;\n          }\n          let sqlFilter = sql.fragment`false`;\n          const sqlCursors = rawCursors.map(val => sql.value(val));\n          for (\n            let i = orderByExpressionsAndDirections.length - 1;\n            i >= 0;\n            i--\n          ) {\n            const [sqlExpression, ascending] =\n              orderByExpressionsAndDirections[i];\n            // If ascending and isAfter then >\n            // If ascending and isBefore then <\n            const comparison =\n              Number(ascending) ^ Number(!isAfter)\n                ? sql.fragment`>`\n                : sql.fragment`<`;\n\n            const sqlOldFilter = sqlFilter;\n            sqlFilter = sql.fragment`\\\n(\\\n  (${sqlExpression} ${comparison} ${sqlCursors[i] || sql.null})\nOR\\\n  (\\\n    ${sqlExpression} = ${sqlCursors[i] || sql.null}\\\n  AND\\\n    ${sqlOldFilter}\\\n  )\\\n)`;\n          }\n\n          // Check the cursor prefixes apply\n          // TODO:v5: we should be able to do this in JS-land rather than SQL-land\n          sqlFilter = sql.fragment`(((${sql.join(\n            getPgCursorPrefix(),\n            \", \"\n          )}) = (${sql.join(\n            rawPrefixes.map(val => sql.value(val)),\n            \", \"\n          )})) AND (${sqlFilter}))`;\n          queryBuilder.whereBound(sqlFilter, isAfter);\n        } else if (\n          cursorValue[0] === \"natural\" &&\n          isSafeInteger(cursorValue[1]) &&\n          // $FlowFixMe: we know this is a number\n          cursorValue[1] >= 0\n        ) {\n          // $FlowFixMe: we know this is a number\n          const cursorValue1: number = cursorValue[1];\n          if (isAfter) {\n            queryBuilder.offset(() => cursorValue1);\n          } else {\n            queryBuilder.limit(() => {\n              const offset = queryBuilder.getOffset();\n              return Math.max(0, cursorValue1 - offset - 1);\n            });\n          }\n        } else {\n          throw new Error(\n            \"Cannot use 'before'/'after' without unique 'orderBy'\"\n          );\n        }\n      });\n\n      const query = queryBuilder.build(options);\n      const haveFields = queryBuilder.getSelectFieldsCount() > 0;\n      const sqlQueryAlias = sql.identifier(Symbol());\n      const sqlSummaryAlias = sql.identifier(Symbol());\n      //\n      // Tables should ALWAYS push their PK onto the order stack, if this isn't\n      // present then we're either dealing with a view or a table without a PK.\n      // Either way, we don't have anything to guarantee uniqueness so we need to\n      // fall back to limit/offset.\n      //\n      // TODO: support unique keys in PgAllRows etc\n      // TODO: add a warning for cursor-based pagination when using the fallback\n      // TODO: if it is a view maybe add a warning encouraging pgViewUniqueKey\n      const canHaveCursorInWhere =\n        queryBuilder.getOrderByExpressionsAndDirections().length > 0 &&\n        queryBuilder.isOrderUnique();\n      const queryHasBefore =\n        queryBuilder.compiledData.whereBound.upper.length > 0;\n      const queryHasAfter =\n        queryBuilder.compiledData.whereBound.lower.length > 0;\n      const queryHasZeroLimit = queryBuilder.getFinalLimit() === 0;\n      const queryHasFirst = isSafeInteger(queryBuilder.compiledData.first);\n      const queryHasLast = isSafeInteger(queryBuilder.compiledData.last);\n      const hasNextPage = queryHasZeroLimit\n        ? sql.literal(false)\n        : generateNextPrevPageSql(\n            sqlQueryAlias,\n            canHaveCursorInWhere,\n            queryHasBefore,\n            queryHasFirst,\n            queryBuilder.getFinalOffset() || 0\n          );\n      const hasPreviousPage = queryHasZeroLimit\n        ? sql.literal(false)\n        : generateNextPrevPageSql(\n            sqlQueryAlias,\n            canHaveCursorInWhere,\n            queryHasAfter,\n            queryHasLast,\n            queryBuilder.getFinalOffset() || 0,\n            true\n          );\n\n      const sqlWith = haveFields\n        ? sql.fragment`with ${sqlQueryAlias} as (${query}), ${sqlSummaryAlias} as (select json_agg(to_json(${sqlQueryAlias})) as data from ${sqlQueryAlias})`\n        : sql.fragment``;\n      const sqlFrom = sql.fragment``;\n      const fields: Array<[SQL, RawAlias]> = [];\n      if (haveFields) {\n        fields.push([\n          sql.fragment`coalesce((select ${sqlSummaryAlias}.data from ${sqlSummaryAlias}), '[]'::json)`,\n          \"data\",\n        ]);\n        if (calculateHasNextPage) {\n          fields.push([hasNextPage, \"hasNextPage\"]);\n        }\n        if (calculateHasPreviousPage) {\n          fields.push([hasPreviousPage, \"hasPreviousPage\"]);\n        }\n      }\n      if (pgNamedQuery && pgNamedQuery.length) {\n        const groups = {};\n        pgNamedQuery.forEach(({ name, query }) => {\n          assertSafeName(name);\n          if (!groups[name]) {\n            groups[name] = [];\n          }\n          groups[name].push(query);\n        });\n        Object.keys(groups).forEach(groupName => {\n          const queryCallbacks = groups[groupName];\n\n          // Get container\n          const containers = pgNamedQueryContainer.filter(\n            c => c.name === groupName\n          );\n          if (containers.length === 0) {\n            throw new Error(\n              `${queryCallbacks.length} pgNamedQuery entries with name: '${groupName}' existed, but there was no matching pgNamedQueryContainer.`\n            );\n          }\n          if (containers.length > 1) {\n            throw new Error(\n              `${containers.length} pgNamedQueryContainer entries with name: '${groupName}' existed, but there should be exactly one.`\n            );\n          }\n          const container = containers[0];\n\n          const innerQueryBuilder = new QueryBuilder(\n            queryBuilderOptions,\n            context,\n            rootValue\n          );\n          innerQueryBuilder.from(\n            queryBuilder.getTableExpression(),\n            queryBuilder.getTableAlias()\n          );\n\n          for (let i = 0, l = queryCallbacks.length; i < l; i++) {\n            queryCallbacks[i](innerQueryBuilder);\n          }\n\n          // Generate the SQL statement (e.g. `select ${innerQueryBuilder.build({onlyJsonField: true})} from ${queryBuilder.getTableExpression()} as ...`)\n          const aggregatesSql = container.query({\n            queryBuilder,\n            innerQueryBuilder,\n            options,\n          });\n\n          fields.push([aggregatesSql, groupName]);\n        });\n      }\n      if (options.withPaginationAsFields) {\n        return sql.fragment`${sqlWith} select ${sql.join(\n          fields.map(\n            ([expr, alias]) => sql.fragment`${expr} as ${sql.identifier(alias)}`\n          ),\n          \", \"\n        )} ${sqlFrom}`;\n      } else {\n        return sql.fragment`${sqlWith} select ${queryBuilder.jsonbBuildObject(\n          fields\n        )} ${sqlFrom}`;\n      }\n    } else {\n      const query = queryBuilder.build(options);\n      return query;\n    }\n  };\n"],"file":"queryFromResolveDataFactory.js"}
+{"version":3,"file":"queryFromResolveDataFactory.js","names":["_QueryBuilder","_interopRequireDefault","require","sql","_interopRequireWildcard","_isSafeInteger","_assert","_util","_getRequireWildcardCache","nodeInterop","WeakMap","cacheBabelInterop","cacheNodeInterop","obj","__esModule","default","cache","has","get","newObj","hasPropertyDescriptor","Object","defineProperty","getOwnPropertyDescriptor","key","prototype","hasOwnProperty","call","desc","set","identity","_","undefined","assertSafeName","name","Error","inspect","test","_default","queryBuilderOptions","from","fromAlias","resolveData","inOptions","withBuilder","context","rootValue","pgQuery","pgAggregateQuery","pgNamedQueryContainer","pgNamedQuery","pgCursorPrefix","reallyRawCursorPrefix","pgDontUseAsterisk","calculateHasNextPage","calculateHasPreviousPage","usesCursor","explicitlyUsesCursor","length","push","query","queryBuilder","options","innerQueryBuilder","fragment","build","onlyJsonField","getTableExpression","getTableAlias","buildWhereClause","forEach","preventAsterisk","useAsterisk","rawCursorPrefix","filter","QueryBuilder","i","l","generateNextPrevPageSql","sqlQueryAlias","canHaveCursorInWhere","queryHasBefore","queryHasFirst","offset","invert","sqlCommonUnbounded","sqlCommon","isForwardOrSymmetric","assert","literal","buildWhereBoundClause","getSelectCursor","blank","value","limit","getFinalLimitAndOffset","getPgCursorPrefix","data","cursorPrefix","map","val","withPagination","withPaginationAsFields","withCursor","selectCursor","orderBy","getOrderByExpressionsAndDirections","expr","isOrderUnique","join","getFinalOffset","setCursorComparator","cursorValue","isAfter","badCursor","whereBound","orderByExpressionsAndDirections","rawPrefixes","slice","rawCursors","Array","isArray","sqlFilter","sqlCursors","sqlExpression","ascending","comparison","Number","sqlOldFilter","null","isSafeInteger","cursorValue1","getOffset","Math","max","haveFields","getSelectFieldsCount","identifier","Symbol","sqlSummaryAlias","compiledData","upper","queryHasAfter","lower","queryHasZeroLimit","getFinalLimit","first","queryHasLast","last","hasNextPage","hasPreviousPage","sqlWith","sqlFrom","fields","groups","keys","groupName","queryCallbacks","containers","c","container","aggregatesSql","alias","jsonbBuildObject","exports"],"sources":["../src/queryFromResolveDataFactory.js"],"sourcesContent":["// @flow\nimport QueryBuilder from \"./QueryBuilder\";\nimport type { QueryBuilderOptions } from \"./QueryBuilder\";\nimport type { RawAlias } from \"./QueryBuilder\";\nimport * as sql from \"pg-sql2\";\nimport type { SQL } from \"pg-sql2\";\nimport type { DataForType } from \"graphile-build\";\nimport isSafeInteger from \"lodash/isSafeInteger\";\nimport assert from \"assert\";\nimport { inspect } from \"util\";\n\n// eslint-disable-next-line flowtype/no-weak-types\ntype GraphQLContext = any;\n\nconst identity = _ => _ !== null && _ !== undefined;\n\nfunction assertSafeName(name: mixed) {\n  if (typeof name !== \"string\") {\n    throw new Error(\n      `Expected name to be a string; instead received '${inspect(name)}'`\n    );\n  }\n  if (!/^[@a-zA-Z0-9_]{1,63}$/.test(name)) {\n    throw new Error(\n      `Name '${name}' is not safe - either it is too long, too short, or has invalid characters`\n    );\n  }\n}\n\nexport default (queryBuilderOptions: QueryBuilderOptions = {}) =>\n  (\n    from: SQL,\n    fromAlias: ?SQL,\n    resolveData: DataForType,\n    inOptions: {\n      withPagination?: boolean,\n      withPaginationAsFields?: boolean,\n      asJson?: boolean,\n      asJsonAggregate?: boolean,\n      addNullCase?: boolean,\n      addNotDistinctFromNullCase?: boolean,\n      onlyJsonField?: boolean,\n      useAsterisk?: boolean,\n      withCursor?: boolean,\n    },\n    // TODO:v5: context is not optional\n    withBuilder?: ((builder: QueryBuilder) => void) | null | void,\n    context?: GraphQLContext = {},\n    rootValue?: any // eslint-disable-line flowtype/no-weak-types\n  ) => {\n    const {\n      pgQuery,\n      pgAggregateQuery, // Shorthand for using pgNamedQueryContainer/pgNamedQuery combo\n      pgNamedQueryContainer = [],\n      pgNamedQuery = [],\n      pgCursorPrefix: reallyRawCursorPrefix,\n      pgDontUseAsterisk,\n      calculateHasNextPage,\n      calculateHasPreviousPage,\n      usesCursor: explicitlyUsesCursor,\n    } = resolveData;\n    // Push a query container for aggregates\n    if ((pgAggregateQuery && pgAggregateQuery.length) || pgNamedQuery.length) {\n      pgNamedQueryContainer.push({\n        name: \"aggregates\",\n        query: ({ queryBuilder, options, innerQueryBuilder }) => sql.fragment`\\\n(\n  select ${innerQueryBuilder.build({ onlyJsonField: true })}\n  from ${queryBuilder.getTableExpression()} as ${queryBuilder.getTableAlias()}\n  where ${queryBuilder.buildWhereClause(false, false, options)}\n)`,\n      });\n    }\n    // Convert pgAggregateQuery to pgNamedQueryContainer/pgNamedQuery combo\n    if (pgAggregateQuery && pgAggregateQuery.length) {\n      // And a query for each previous query\n      pgAggregateQuery.forEach(query => {\n        pgNamedQuery.push({ name: \"aggregates\", query });\n      });\n    }\n\n    const preventAsterisk = pgDontUseAsterisk\n      ? pgDontUseAsterisk.length > 0\n      : false;\n    const options = {\n      ...inOptions,\n      // Allow pgDontUseAsterisk to override useAsterisk\n      useAsterisk: inOptions.useAsterisk && !preventAsterisk,\n    };\n\n    const usesCursor: boolean =\n      (explicitlyUsesCursor && explicitlyUsesCursor.length > 0) ||\n      (calculateHasNextPage && calculateHasNextPage.length > 0) ||\n      (calculateHasPreviousPage && calculateHasPreviousPage.length > 0) ||\n      false;\n    const rawCursorPrefix =\n      reallyRawCursorPrefix && reallyRawCursorPrefix.filter(identity);\n\n    const queryBuilder = new QueryBuilder(\n      queryBuilderOptions,\n      context,\n      rootValue\n    );\n    queryBuilder.from(from, fromAlias ? fromAlias : undefined);\n\n    if (withBuilder) {\n      withBuilder(queryBuilder);\n    }\n    if (pgQuery) {\n      for (let i = 0, l = pgQuery.length; i < l; i++) {\n        pgQuery[i](queryBuilder, resolveData);\n      }\n    }\n\n    function generateNextPrevPageSql(\n      sqlQueryAlias,\n      canHaveCursorInWhere,\n      queryHasBefore,\n      queryHasFirst,\n      offset = 0,\n      invert = false\n    ) {\n      /*\n       * Strap in, 'coz this function gets hairy!\n       *\n       * The point of this function is to return SQL which will resolve to a\n       * boolean true/false depending on whether or not there is a (invert ?\n       * \"previous\" : \"next\") page.\n       *\n       * Connections have before, after, first, last and offset.\n       * - Users are forbidden from setting both first and last.\n       * - Users are forbidden from setting both offset and last.\n       *\n       * Further there are two main modes of paginating, one works by adding a\n       * where clause (this is preferred, but is not always possible, and is\n       * indicated by `canHaveCursorInWhere === true`) and the other works using\n       * standard LIMIT/OFFSET SQL pagination (and is indicated by\n       * `canHaveCursorInWhere === false`).\n       *\n       * The following diagram shows a full collection of records, #, starting at\n       * START and ending at END. The key after, before, offset, first and last\n       * variables are shown. One thing not show is that it's possible to have\n       * fewer records between before and after than requested by first or last.\n       * Another detail not clearly show is that if there is no `after` then\n       * `START` is used, similarly if there is no `before` then `END` is used.\n       *\n       *   #################################################### < collection\n       *   ^      ^<-offset->^<-first->^      ^<-last->^      ^\n       *   |      |          |         |      |        |      |\n       *   |      |          +---------+      +--------+      |\n       *   |      |          |  DATA1           DATA2  |      |\n       *   |      |          |                         |      |\n       *   |      |          |                         |      |\n       *   |      |          +-------------------------+      |\n       *   |      |                     DATA3          |      |\n       *   |    after                                before   |\n       *   |                                                  |\n       * START                                               END\n       *\n       * We want one of the three DATA blocks:\n       *\n       * - If `first` is set, then we want DATA1.\n       * - If `last` is set then we want DATA2.\n       * - If neither is set then we want DATA3.\n       *\n       * (Remember: you cannot set both `first` and `last` at the same time.)\n       *\n       * When invert === false:\n       *\n       *   Note that both DATA2 and DATA3 end at the same point, and we only care\n       *   if there's data *after* the relevant DATA block, so really we only\n       *   care if the query specified `first` (`queryHasFirst`) which makes\n       *   things complex (ending at the end of DATA1), otherwise we can use\n       *   `before` as the bound (end of DATA2/DATA3).\n       *\n       * When invert === true:\n       *\n       *   Similarly, DATA1 and DATA3 start at the same point, and we're going\n       *   backwards so we only care if there's data *before* the DATA block, so\n       *   really we just need to know if the query set `last` or not, but since\n       *   this is inverted we call it `queryHasFirst`.\n       *\n       * When `invert` is false we're calculating `hasNextPage`, when true we're\n       * calculating `hasPreviousPage`.\n       *\n       * Because of the near-symmetry of requesting hasPreviousPage vs\n       * hasNextPage we always pretend we're determining `hasNextPage`, and we\n       * just invert everything.\n       */\n\n      const sqlCommonUnbounded = sql.fragment`\\\nselect 1\nfrom ${queryBuilder.getTableExpression()} as ${queryBuilder.getTableAlias()}`;\n      /*\n       * This variable is a fragment to go into an `EXISTS(...)` call (after some tweaks).\n       *\n       * The buildWhereClause takes three arguments:\n       *\n       * - includeLowerBound (we want this for hasNextPage but not hasPreviousPage)\n       * - includeUpperBound (we want this for hasPreviousPage but not hasNextPage)\n       * - options (specifically `{addNullCase, addNotDistinctFromNullCase}`) -\n       *   we just pass this through.\n       *\n       * So in hasNextPage mode (invert === false), this common SQL ends up\n       * representing the collection from `(after || START)` onwards with no\n       * upper bound. In hasPreviousPage mode (invert === true), it represents\n       * everything from `(before || END)` backwards, with no lower bound.\n       */\n      const sqlCommon = sql.fragment`\\\n${sqlCommonUnbounded}\nwhere ${queryBuilder.buildWhereClause(!invert, invert, options)}`;\n\n      /*\n       * Since the offset makes the diagram asymmetric, if offset === 0\n       * then the diagram is symmetric and things are simplified a little.\n       */\n      const isForwardOrSymmetric = !invert || offset === 0;\n\n      if (!isForwardOrSymmetric) {\n        assert(invert);\n        assert(offset > 0);\n        // We're looking for a previous page, and there's an offset, so lets just\n        // assume there's a previous page where offset is smaller.\n        return sql.literal(true);\n      } else if (canHaveCursorInWhere) {\n        assert(isForwardOrSymmetric);\n        if (!queryHasBefore && !queryHasFirst) {\n          assert(isForwardOrSymmetric);\n          // There can be no next page since there's no upper bound\n          return sql.literal(false);\n        } else if (queryHasBefore && !queryHasFirst) {\n          /*\n           * We invert the upper buildWhereBoundClause to only represent the data\n           * after `before`, then check if there's at least one record in that set.\n           *\n           * This only works if the `before` cursor can be represented in the\n           * SQL WHERE clause, otherwise we're doing limit/offset pagination\n           * which requires different logic. It also only works if there's no\n           * `first` clause, otherwise there could be a next page before the\n           * `before` clause.\n           */\n          return sql.fragment`\\\nexists(\n  ${sqlCommonUnbounded}\n  where ${queryBuilder.buildWhereClause(false, false, options)}\n  and not (${queryBuilder.buildWhereBoundClause(invert)})\n)`;\n        } else {\n          assert(queryHasFirst);\n          // queryHasBefore could be true or false.\n          /*\n           * There's a few ways that we could determine if there's a next page.\n           *\n           * If !queryHasBefore, we could COUNT(*) the number of rows in\n           * `sqlCommon` and see if it's larger than `first`:\n           * `(select count(*) > ${first} from (${sqlCommon}) __random_table_alias__)`\n           *\n           * If !queryHasBefore, we could build a subquery table of offsetData\n           * from sqlCommon and see if it contains any rows:\n           * `EXISTS(select 1 from (${sqlCommon} OFFSET ${first}) __random_table_alias__)`.\n           *\n           * We could see if there's at least one row in sqlCommon that's not\n           * already in our chosen result set.\n           *\n           * We've chosen the latter approach here because it doesn't place a limit\n           * on queryHasBefore.\n           */\n          // Drop the `first` limit, see if there are any records that aren't\n          // already in the list we've fetched.\n          return sql.fragment`\\\nexists(\n  ${sqlCommon}\n  and (${queryBuilder.getSelectCursor()})::text not in (select __cursor::text from ${sqlQueryAlias})\n  ${offset === 0 ? sql.blank : sql.fragment`offset ${sql.value(offset)}`}\n)`;\n        }\n      } else {\n        assert(!invert || offset === 0); // isForwardOrSymmetric\n        assert(!canHaveCursorInWhere);\n        // We're dealing with LIMIT/OFFSET pagination here, which means `natural`\n        // cursors, so the `queryBuilder` factors the before/after, first/last\n        // into the limit / offset.\n        const { limit } = queryBuilder.getFinalLimitAndOffset();\n\n        if (limit == null) {\n          // If paginating backwards, then offset > 0 has already been dealt\n          // with. Unbounded, so there's no next page.\n          return sql.fragment`false`;\n        } else if (invert) {\n          assert(offset === 0);\n          // Paginating backwards and there's no offset (which factors in before/after), so there's no previous page.\n          return sql.fragment`false`;\n        } else {\n          assert(!invert);\n          /*\n           * We're paginating forwards; either there's a before, there's a first,\n           * or both.\n           *\n           * We want to see if there's more than limit+offset records in sqlCommon.\n           */\n          return sql.fragment`\\\nexists(\n  ${sqlCommon}\n  offset ${sql.literal(limit + offset)}\n)`;\n        }\n      }\n    }\n    const getPgCursorPrefix = () =>\n      rawCursorPrefix && rawCursorPrefix.length > 0\n        ? rawCursorPrefix\n        : queryBuilder.data.cursorPrefix.map(val => sql.literal(val));\n    if (\n      options.withPagination ||\n      options.withPaginationAsFields ||\n      options.withCursor\n    ) {\n      // Sometimes we need a __cursor even if it's not a collection; e.g. to get the edge field on a mutation\n      if (usesCursor) {\n        queryBuilder.selectCursor((): SQL => {\n          const orderBy = queryBuilder\n            .getOrderByExpressionsAndDirections()\n            .map(([expr]) => expr);\n          if (queryBuilder.isOrderUnique() && orderBy.length > 0) {\n            return sql.fragment`json_build_array(${sql.join(\n              [\n                ...getPgCursorPrefix(),\n                sql.fragment`json_build_array(${sql.join(orderBy, \", \")})`,\n              ],\n              \", \"\n            )})`;\n          } else {\n            return sql.fragment`json_build_array(${sql.join(\n              getPgCursorPrefix(),\n              \", \"\n            )}, ${\n              /*\n               * NOTE[useAsterisk/row_number]: If we have useAsterisk then the\n               * query with limit offset is in a subquery, so our row_number()\n               * call doesn't know about it. Here we add the offset back in\n               * again. See matching NOTE in QueryBuilder.js.\n               */\n              options.useAsterisk\n                ? sql.fragment`${sql.literal(\n                    queryBuilder.getFinalOffset() || 0\n                  )} + `\n                : sql.fragment``\n            }(row_number() over (partition by 1)))`;\n          }\n        });\n      }\n    }\n    if (options.withPagination || options.withPaginationAsFields) {\n      queryBuilder.setCursorComparator((cursorValue, isAfter) => {\n        function badCursor() {\n          queryBuilder.whereBound(sql.fragment`false`, isAfter);\n        }\n        const orderByExpressionsAndDirections =\n          queryBuilder.getOrderByExpressionsAndDirections();\n        if (orderByExpressionsAndDirections.length > 0) {\n          if (!queryBuilder.isOrderUnique()) {\n            throw new Error(\n              \"The order supplied is not unique, so before/after cursors cannot be used. Please ensure the supplied order includes all the columns from the primary key or a unique constraint.\"\n            );\n          }\n          const rawPrefixes = cursorValue.slice(0, cursorValue.length - 1);\n          const rawCursors = cursorValue[cursorValue.length - 1];\n          if (rawPrefixes.length !== getPgCursorPrefix().length) {\n            badCursor();\n            return;\n          }\n          if (!Array.isArray(rawCursors)) {\n            badCursor();\n            return;\n          }\n          let sqlFilter = sql.fragment`false`;\n          const sqlCursors = rawCursors.map(val => sql.value(val));\n          for (\n            let i = orderByExpressionsAndDirections.length - 1;\n            i >= 0;\n            i--\n          ) {\n            const [sqlExpression, ascending] =\n              orderByExpressionsAndDirections[i];\n            // If ascending and isAfter then >\n            // If ascending and isBefore then <\n            const comparison =\n              Number(ascending) ^ Number(!isAfter)\n                ? sql.fragment`>`\n                : sql.fragment`<`;\n\n            const sqlOldFilter = sqlFilter;\n            sqlFilter = sql.fragment`\\\n(\\\n  (${sqlExpression} ${comparison} ${sqlCursors[i] || sql.null})\nOR\\\n  (\\\n    ${sqlExpression} = ${sqlCursors[i] || sql.null}\\\n  AND\\\n    ${sqlOldFilter}\\\n  )\\\n)`;\n          }\n\n          // Check the cursor prefixes apply\n          // TODO:v5: we should be able to do this in JS-land rather than SQL-land\n          sqlFilter = sql.fragment`(((${sql.join(\n            getPgCursorPrefix(),\n            \", \"\n          )}) = (${sql.join(\n            rawPrefixes.map(val => sql.value(val)),\n            \", \"\n          )})) AND (${sqlFilter}))`;\n          queryBuilder.whereBound(sqlFilter, isAfter);\n        } else if (\n          cursorValue[0] === \"natural\" &&\n          isSafeInteger(cursorValue[1]) &&\n          // $FlowFixMe: we know this is a number\n          cursorValue[1] >= 0\n        ) {\n          // $FlowFixMe: we know this is a number\n          const cursorValue1: number = cursorValue[1];\n          if (isAfter) {\n            queryBuilder.offset(() => cursorValue1);\n          } else {\n            queryBuilder.limit(() => {\n              const offset = queryBuilder.getOffset();\n              return Math.max(0, cursorValue1 - offset - 1);\n            });\n          }\n        } else {\n          throw new Error(\n            \"Cannot use 'before'/'after' without unique 'orderBy'\"\n          );\n        }\n      });\n\n      const query = queryBuilder.build(options);\n      const haveFields = queryBuilder.getSelectFieldsCount() > 0;\n      const sqlQueryAlias = sql.identifier(Symbol());\n      const sqlSummaryAlias = sql.identifier(Symbol());\n      //\n      // Tables should ALWAYS push their PK onto the order stack, if this isn't\n      // present then we're either dealing with a view or a table without a PK.\n      // Either way, we don't have anything to guarantee uniqueness so we need to\n      // fall back to limit/offset.\n      //\n      // TODO: support unique keys in PgAllRows etc\n      // TODO: add a warning for cursor-based pagination when using the fallback\n      // TODO: if it is a view maybe add a warning encouraging pgViewUniqueKey\n      const canHaveCursorInWhere =\n        queryBuilder.getOrderByExpressionsAndDirections().length > 0 &&\n        queryBuilder.isOrderUnique();\n      const queryHasBefore =\n        queryBuilder.compiledData.whereBound.upper.length > 0;\n      const queryHasAfter =\n        queryBuilder.compiledData.whereBound.lower.length > 0;\n      const queryHasZeroLimit = queryBuilder.getFinalLimit() === 0;\n      const queryHasFirst = isSafeInteger(queryBuilder.compiledData.first);\n      const queryHasLast = isSafeInteger(queryBuilder.compiledData.last);\n      const hasNextPage = queryHasZeroLimit\n        ? sql.literal(false)\n        : generateNextPrevPageSql(\n            sqlQueryAlias,\n            canHaveCursorInWhere,\n            queryHasBefore,\n            queryHasFirst,\n            queryBuilder.getFinalOffset() || 0\n          );\n      const hasPreviousPage = queryHasZeroLimit\n        ? sql.literal(false)\n        : generateNextPrevPageSql(\n            sqlQueryAlias,\n            canHaveCursorInWhere,\n            queryHasAfter,\n            queryHasLast,\n            queryBuilder.getFinalOffset() || 0,\n            true\n          );\n\n      const sqlWith = haveFields\n        ? sql.fragment`with ${sqlQueryAlias} as (${query}), ${sqlSummaryAlias} as (select json_agg(to_json(${sqlQueryAlias})) as data from ${sqlQueryAlias})`\n        : sql.fragment``;\n      const sqlFrom = sql.fragment``;\n      const fields: Array<[SQL, RawAlias]> = [];\n      if (haveFields) {\n        fields.push([\n          sql.fragment`coalesce((select ${sqlSummaryAlias}.data from ${sqlSummaryAlias}), '[]'::json)`,\n          \"data\",\n        ]);\n        if (calculateHasNextPage) {\n          fields.push([hasNextPage, \"hasNextPage\"]);\n        }\n        if (calculateHasPreviousPage) {\n          fields.push([hasPreviousPage, \"hasPreviousPage\"]);\n        }\n      }\n      if (pgNamedQuery && pgNamedQuery.length) {\n        const groups = {};\n        pgNamedQuery.forEach(({ name, query }) => {\n          assertSafeName(name);\n          if (!groups[name]) {\n            groups[name] = [];\n          }\n          groups[name].push(query);\n        });\n        Object.keys(groups).forEach(groupName => {\n          const queryCallbacks = groups[groupName];\n\n          // Get container\n          const containers = pgNamedQueryContainer.filter(\n            c => c.name === groupName\n          );\n          if (containers.length === 0) {\n            throw new Error(\n              `${queryCallbacks.length} pgNamedQuery entries with name: '${groupName}' existed, but there was no matching pgNamedQueryContainer.`\n            );\n          }\n          if (containers.length > 1) {\n            throw new Error(\n              `${containers.length} pgNamedQueryContainer entries with name: '${groupName}' existed, but there should be exactly one.`\n            );\n          }\n          const container = containers[0];\n\n          const innerQueryBuilder = new QueryBuilder(\n            queryBuilderOptions,\n            context,\n            rootValue\n          );\n          innerQueryBuilder.from(\n            queryBuilder.getTableExpression(),\n            queryBuilder.getTableAlias()\n          );\n\n          for (let i = 0, l = queryCallbacks.length; i < l; i++) {\n            queryCallbacks[i](innerQueryBuilder);\n          }\n\n          // Generate the SQL statement (e.g. `select ${innerQueryBuilder.build({onlyJsonField: true})} from ${queryBuilder.getTableExpression()} as ...`)\n          const aggregatesSql = container.query({\n            queryBuilder,\n            innerQueryBuilder,\n            options,\n          });\n\n          fields.push([aggregatesSql, groupName]);\n        });\n      }\n      if (options.withPaginationAsFields) {\n        return sql.fragment`${sqlWith} select ${sql.join(\n          fields.map(\n            ([expr, alias]) => sql.fragment`${expr} as ${sql.identifier(alias)}`\n          ),\n          \", \"\n        )} ${sqlFrom}`;\n      } else {\n        return sql.fragment`${sqlWith} select ${queryBuilder.jsonbBuildObject(\n          fields\n        )} ${sqlFrom}`;\n      }\n    } else {\n      const query = queryBuilder.build(options);\n      return query;\n    }\n  };\n"],"mappings":";;;;;;AACA,IAAAA,aAAA,GAAAC,sBAAA,CAAAC,OAAA;AAGA,IAAAC,GAAA,GAAAC,uBAAA,CAAAF,OAAA;AAGA,IAAAG,cAAA,GAAAJ,sBAAA,CAAAC,OAAA;AACA,IAAAI,OAAA,GAAAL,sBAAA,CAAAC,OAAA;AACA,IAAAK,KAAA,GAAAL,OAAA;AAA+B,SAAAM,yBAAAC,WAAA,eAAAC,OAAA,kCAAAC,iBAAA,OAAAD,OAAA,QAAAE,gBAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,WAAA,WAAAA,WAAA,GAAAG,gBAAA,GAAAD,iBAAA,KAAAF,WAAA;AAAA,SAAAL,wBAAAS,GAAA,EAAAJ,WAAA,SAAAA,WAAA,IAAAI,GAAA,IAAAA,GAAA,CAAAC,UAAA,WAAAD,GAAA,QAAAA,GAAA,oBAAAA,GAAA,wBAAAA,GAAA,4BAAAE,OAAA,EAAAF,GAAA,UAAAG,KAAA,GAAAR,wBAAA,CAAAC,WAAA,OAAAO,KAAA,IAAAA,KAAA,CAAAC,GAAA,CAAAJ,GAAA,YAAAG,KAAA,CAAAE,GAAA,CAAAL,GAAA,SAAAM,MAAA,WAAAC,qBAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,GAAA,IAAAX,GAAA,QAAAW,GAAA,kBAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAd,GAAA,EAAAW,GAAA,SAAAI,IAAA,GAAAR,qBAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAV,GAAA,EAAAW,GAAA,cAAAI,IAAA,KAAAA,IAAA,CAAAV,GAAA,IAAAU,IAAA,CAAAC,GAAA,KAAAR,MAAA,CAAAC,cAAA,CAAAH,MAAA,EAAAK,GAAA,EAAAI,IAAA,YAAAT,MAAA,CAAAK,GAAA,IAAAX,GAAA,CAAAW,GAAA,SAAAL,MAAA,CAAAJ,OAAA,GAAAF,GAAA,MAAAG,KAAA,IAAAA,KAAA,CAAAa,GAAA,CAAAhB,GAAA,EAAAM,MAAA,YAAAA,MAAA;AAAA,SAAAlB,uBAAAY,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AAE/B;AAGA,MAAMiB,QAAQ,GAAGC,CAAC,IAAIA,CAAC,KAAK,IAAI,IAAIA,CAAC,KAAKC,SAAS;AAEnD,SAASC,cAAcA,CAACC,IAAW,EAAE;EACnC,IAAI,OAAOA,IAAI,KAAK,QAAQ,EAAE;IAC5B,MAAM,IAAIC,KAAK,CACZ,mDAAkD,IAAAC,aAAO,EAACF,IAAI,CAAE,GACnE,CAAC;EACH;EACA,IAAI,CAAC,uBAAuB,CAACG,IAAI,CAACH,IAAI,CAAC,EAAE;IACvC,MAAM,IAAIC,KAAK,CACZ,SAAQD,IAAK,6EAChB,CAAC;EACH;AACF;AAAC,IAAAI,QAAA,GAEcA,CAACC,mBAAwC,GAAG,CAAC,CAAC,KAC3D,CACEC,IAAS,EACTC,SAAe,EACfC,WAAwB,EACxBC,SAUC,EAEDC,WAA6D,EAC7DC,OAAwB,GAAG,CAAC,CAAC,EAC7BC,SAAe,KACZ;EACH,MAAM;IACJC,OAAO;IACPC,gBAAgB;IAAE;IAClBC,qBAAqB,GAAG,EAAE;IAC1BC,YAAY,GAAG,EAAE;IACjBC,cAAc,EAAEC,qBAAqB;IACrCC,iBAAiB;IACjBC,oBAAoB;IACpBC,wBAAwB;IACxBC,UAAU,EAAEC;EACd,CAAC,GAAGf,WAAW;EACf;EACA,IAAKM,gBAAgB,IAAIA,gBAAgB,CAACU,MAAM,IAAKR,YAAY,CAACQ,MAAM,EAAE;IACxET,qBAAqB,CAACU,IAAI,CAAC;MACzBzB,IAAI,EAAE,YAAY;MAClB0B,KAAK,EAAEA,CAAC;QAAEC,YAAY;QAAEC,OAAO;QAAEC;MAAkB,CAAC,KAAK5D,GAAG,CAAC6D,QAAS;AAC9E;AACA,WAAWD,iBAAiB,CAACE,KAAK,CAAC;QAAEC,aAAa,EAAE;MAAK,CAAC,CAAE;AAC5D,SAASL,YAAY,CAACM,kBAAkB,CAAC,CAAE,OAAMN,YAAY,CAACO,aAAa,CAAC,CAAE;AAC9E,UAAUP,YAAY,CAACQ,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAEP,OAAO,CAAE;AAC/D;IACM,CAAC,CAAC;EACJ;EACA;EACA,IAAId,gBAAgB,IAAIA,gBAAgB,CAACU,MAAM,EAAE;IAC/C;IACAV,gBAAgB,CAACsB,OAAO,CAACV,KAAK,IAAI;MAChCV,YAAY,CAACS,IAAI,CAAC;QAAEzB,IAAI,EAAE,YAAY;QAAE0B;MAAM,CAAC,CAAC;IAClD,CAAC,CAAC;EACJ;EAEA,MAAMW,eAAe,GAAGlB,iBAAiB,GACrCA,iBAAiB,CAACK,MAAM,GAAG,CAAC,GAC5B,KAAK;EACT,MAAMI,OAAO,GAAG;IACd,GAAGnB,SAAS;IACZ;IACA6B,WAAW,EAAE7B,SAAS,CAAC6B,WAAW,IAAI,CAACD;EACzC,CAAC;EAED,MAAMf,UAAmB,GACtBC,oBAAoB,IAAIA,oBAAoB,CAACC,MAAM,GAAG,CAAC,IACvDJ,oBAAoB,IAAIA,oBAAoB,CAACI,MAAM,GAAG,CAAE,IACxDH,wBAAwB,IAAIA,wBAAwB,CAACG,MAAM,GAAG,CAAE,IACjE,KAAK;EACP,MAAMe,eAAe,GACnBrB,qBAAqB,IAAIA,qBAAqB,CAACsB,MAAM,CAAC5C,QAAQ,CAAC;EAEjE,MAAM+B,YAAY,GAAG,IAAIc,qBAAY,CACnCpC,mBAAmB,EACnBM,OAAO,EACPC,SACF,CAAC;EACDe,YAAY,CAACrB,IAAI,CAACA,IAAI,EAAEC,SAAS,GAAGA,SAAS,GAAGT,SAAS,CAAC;EAE1D,IAAIY,WAAW,EAAE;IACfA,WAAW,CAACiB,YAAY,CAAC;EAC3B;EACA,IAAId,OAAO,EAAE;IACX,KAAK,IAAI6B,CAAC,GAAG,CAAC,EAAEC,CAAC,GAAG9B,OAAO,CAACW,MAAM,EAAEkB,CAAC,GAAGC,CAAC,EAAED,CAAC,EAAE,EAAE;MAC9C7B,OAAO,CAAC6B,CAAC,CAAC,CAACf,YAAY,EAAEnB,WAAW,CAAC;IACvC;EACF;EAEA,SAASoC,uBAAuBA,CAC9BC,aAAa,EACbC,oBAAoB,EACpBC,cAAc,EACdC,aAAa,EACbC,MAAM,GAAG,CAAC,EACVC,MAAM,GAAG,KAAK,EACd;IACA;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;IAEM,MAAMC,kBAAkB,GAAGlF,GAAG,CAAC6D,QAAS;AAC9C;AACA,OAAOH,YAAY,CAACM,kBAAkB,CAAC,CAAE,OAAMN,YAAY,CAACO,aAAa,CAAC,CAAE,EAAC;IACvE;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;IACM,MAAMkB,SAAS,GAAGnF,GAAG,CAAC6D,QAAS;AACrC,EAAEqB,kBAAmB;AACrB,QAAQxB,YAAY,CAACQ,gBAAgB,CAAC,CAACe,MAAM,EAAEA,MAAM,EAAEtB,OAAO,CAAE,EAAC;;IAE3D;AACN;AACA;AACA;IACM,MAAMyB,oBAAoB,GAAG,CAACH,MAAM,IAAID,MAAM,KAAK,CAAC;IAEpD,IAAI,CAACI,oBAAoB,EAAE;MACzB,IAAAC,eAAM,EAACJ,MAAM,CAAC;MACd,IAAAI,eAAM,EAACL,MAAM,GAAG,CAAC,CAAC;MAClB;MACA;MACA,OAAOhF,GAAG,CAACsF,OAAO,CAAC,IAAI,CAAC;IAC1B,CAAC,MAAM,IAAIT,oBAAoB,EAAE;MAC/B,IAAAQ,eAAM,EAACD,oBAAoB,CAAC;MAC5B,IAAI,CAACN,cAAc,IAAI,CAACC,aAAa,EAAE;QACrC,IAAAM,eAAM,EAACD,oBAAoB,CAAC;QAC5B;QACA,OAAOpF,GAAG,CAACsF,OAAO,CAAC,KAAK,CAAC;MAC3B,CAAC,MAAM,IAAIR,cAAc,IAAI,CAACC,aAAa,EAAE;QAC3C;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;QACU,OAAO/E,GAAG,CAAC6D,QAAS;AAC9B;AACA,IAAIqB,kBAAmB;AACvB,UAAUxB,YAAY,CAACQ,gBAAgB,CAAC,KAAK,EAAE,KAAK,EAAEP,OAAO,CAAE;AAC/D,aAAaD,YAAY,CAAC6B,qBAAqB,CAACN,MAAM,CAAE;AACxD,EAAE;MACM,CAAC,MAAM;QACL,IAAAI,eAAM,EAACN,aAAa,CAAC;QACrB;QACA;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;QACU;QACA;QACA,OAAO/E,GAAG,CAAC6D,QAAS;AAC9B;AACA,IAAIsB,SAAU;AACd,SAASzB,YAAY,CAAC8B,eAAe,CAAC,CAAE,8CAA6CZ,aAAc;AACnG,IAAII,MAAM,KAAK,CAAC,GAAGhF,GAAG,CAACyF,KAAK,GAAGzF,GAAG,CAAC6D,QAAS,UAAS7D,GAAG,CAAC0F,KAAK,CAACV,MAAM,CAAE,EAAE;AACzE,EAAE;MACM;IACF,CAAC,MAAM;MACL,IAAAK,eAAM,EAAC,CAACJ,MAAM,IAAID,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;MACjC,IAAAK,eAAM,EAAC,CAACR,oBAAoB,CAAC;MAC7B;MACA;MACA;MACA,MAAM;QAAEc;MAAM,CAAC,GAAGjC,YAAY,CAACkC,sBAAsB,CAAC,CAAC;MAEvD,IAAID,KAAK,IAAI,IAAI,EAAE;QACjB;QACA;QACA,OAAO3F,GAAG,CAAC6D,QAAS,OAAM;MAC5B,CAAC,MAAM,IAAIoB,MAAM,EAAE;QACjB,IAAAI,eAAM,EAACL,MAAM,KAAK,CAAC,CAAC;QACpB;QACA,OAAOhF,GAAG,CAAC6D,QAAS,OAAM;MAC5B,CAAC,MAAM;QACL,IAAAwB,eAAM,EAAC,CAACJ,MAAM,CAAC;QACf;AACV;AACA;AACA;AACA;AACA;QACU,OAAOjF,GAAG,CAAC6D,QAAS;AAC9B;AACA,IAAIsB,SAAU;AACd,WAAWnF,GAAG,CAACsF,OAAO,CAACK,KAAK,GAAGX,MAAM,CAAE;AACvC,EAAE;MACM;IACF;EACF;EACA,MAAMa,iBAAiB,GAAGA,CAAA,KACxBvB,eAAe,IAAIA,eAAe,CAACf,MAAM,GAAG,CAAC,GACzCe,eAAe,GACfZ,YAAY,CAACoC,IAAI,CAACC,YAAY,CAACC,GAAG,CAACC,GAAG,IAAIjG,GAAG,CAACsF,OAAO,CAACW,GAAG,CAAC,CAAC;EACjE,IACEtC,OAAO,CAACuC,cAAc,IACtBvC,OAAO,CAACwC,sBAAsB,IAC9BxC,OAAO,CAACyC,UAAU,EAClB;IACA;IACA,IAAI/C,UAAU,EAAE;MACdK,YAAY,CAAC2C,YAAY,CAAC,MAAW;QACnC,MAAMC,OAAO,GAAG5C,YAAY,CACzB6C,kCAAkC,CAAC,CAAC,CACpCP,GAAG,CAAC,CAAC,CAACQ,IAAI,CAAC,KAAKA,IAAI,CAAC;QACxB,IAAI9C,YAAY,CAAC+C,aAAa,CAAC,CAAC,IAAIH,OAAO,CAAC/C,MAAM,GAAG,CAAC,EAAE;UACtD,OAAOvD,GAAG,CAAC6D,QAAS,oBAAmB7D,GAAG,CAAC0G,IAAI,CAC7C,CACE,GAAGb,iBAAiB,CAAC,CAAC,EACtB7F,GAAG,CAAC6D,QAAS,oBAAmB7D,GAAG,CAAC0G,IAAI,CAACJ,OAAO,EAAE,IAAI,CAAE,GAAE,CAC3D,EACD,IACF,CAAE,GAAE;QACN,CAAC,MAAM;UACL,OAAOtG,GAAG,CAAC6D,QAAS,oBAAmB7D,GAAG,CAAC0G,IAAI,CAC7Cb,iBAAiB,CAAC,CAAC,EACnB,IACF,CAAE;UACA;AACd;AACA;AACA;AACA;AACA,aACclC,OAAO,CAACU,WAAW,GACfrE,GAAG,CAAC6D,QAAS,GAAE7D,GAAG,CAACsF,OAAO,CACxB5B,YAAY,CAACiD,cAAc,CAAC,CAAC,IAAI,CACnC,CAAE,KAAI,GACN3G,GAAG,CAAC6D,QAAS,EAClB,uCAAsC;QACzC;MACF,CAAC,CAAC;IACJ;EACF;EACA,IAAIF,OAAO,CAACuC,cAAc,IAAIvC,OAAO,CAACwC,sBAAsB,EAAE;IAC5DzC,YAAY,CAACkD,mBAAmB,CAAC,CAACC,WAAW,EAAEC,OAAO,KAAK;MACzD,SAASC,SAASA,CAAA,EAAG;QACnBrD,YAAY,CAACsD,UAAU,CAAChH,GAAG,CAAC6D,QAAS,OAAM,EAAEiD,OAAO,CAAC;MACvD;MACA,MAAMG,+BAA+B,GACnCvD,YAAY,CAAC6C,kCAAkC,CAAC,CAAC;MACnD,IAAIU,+BAA+B,CAAC1D,MAAM,GAAG,CAAC,EAAE;QAC9C,IAAI,CAACG,YAAY,CAAC+C,aAAa,CAAC,CAAC,EAAE;UACjC,MAAM,IAAIzE,KAAK,CACb,kLACF,CAAC;QACH;QACA,MAAMkF,WAAW,GAAGL,WAAW,CAACM,KAAK,CAAC,CAAC,EAAEN,WAAW,CAACtD,MAAM,GAAG,CAAC,CAAC;QAChE,MAAM6D,UAAU,GAAGP,WAAW,CAACA,WAAW,CAACtD,MAAM,GAAG,CAAC,CAAC;QACtD,IAAI2D,WAAW,CAAC3D,MAAM,KAAKsC,iBAAiB,CAAC,CAAC,CAACtC,MAAM,EAAE;UACrDwD,SAAS,CAAC,CAAC;UACX;QACF;QACA,IAAI,CAACM,KAAK,CAACC,OAAO,CAACF,UAAU,CAAC,EAAE;UAC9BL,SAAS,CAAC,CAAC;UACX;QACF;QACA,IAAIQ,SAAS,GAAGvH,GAAG,CAAC6D,QAAS,OAAM;QACnC,MAAM2D,UAAU,GAAGJ,UAAU,CAACpB,GAAG,CAACC,GAAG,IAAIjG,GAAG,CAAC0F,KAAK,CAACO,GAAG,CAAC,CAAC;QACxD,KACE,IAAIxB,CAAC,GAAGwC,+BAA+B,CAAC1D,MAAM,GAAG,CAAC,EAClDkB,CAAC,IAAI,CAAC,EACNA,CAAC,EAAE,EACH;UACA,MAAM,CAACgD,aAAa,EAAEC,SAAS,CAAC,GAC9BT,+BAA+B,CAACxC,CAAC,CAAC;UACpC;UACA;UACA,MAAMkD,UAAU,GACdC,MAAM,CAACF,SAAS,CAAC,GAAGE,MAAM,CAAC,CAACd,OAAO,CAAC,GAChC9G,GAAG,CAAC6D,QAAS,GAAE,GACf7D,GAAG,CAAC6D,QAAS,GAAE;UAErB,MAAMgE,YAAY,GAAGN,SAAS;UAC9BA,SAAS,GAAGvH,GAAG,CAAC6D,QAAS;AACrC;AACA,KAAK4D,aAAc,IAAGE,UAAW,IAAGH,UAAU,CAAC/C,CAAC,CAAC,IAAIzE,GAAG,CAAC8H,IAAK;AAC9D;AACA;AACA,MAAML,aAAc,MAAKD,UAAU,CAAC/C,CAAC,CAAC,IAAIzE,GAAG,CAAC8H,IAAK;AACnD;AACA,MAAMD,YAAa;AACnB;AACA,EAAE;QACQ;;QAEA;QACA;QACAN,SAAS,GAAGvH,GAAG,CAAC6D,QAAS,MAAK7D,GAAG,CAAC0G,IAAI,CACpCb,iBAAiB,CAAC,CAAC,EACnB,IACF,CAAE,QAAO7F,GAAG,CAAC0G,IAAI,CACfQ,WAAW,CAAClB,GAAG,CAACC,GAAG,IAAIjG,GAAG,CAAC0F,KAAK,CAACO,GAAG,CAAC,CAAC,EACtC,IACF,CAAE,WAAUsB,SAAU,IAAG;QACzB7D,YAAY,CAACsD,UAAU,CAACO,SAAS,EAAET,OAAO,CAAC;MAC7C,CAAC,MAAM,IACLD,WAAW,CAAC,CAAC,CAAC,KAAK,SAAS,IAC5B,IAAAkB,sBAAa,EAAClB,WAAW,CAAC,CAAC,CAAC,CAAC;MAC7B;MACAA,WAAW,CAAC,CAAC,CAAC,IAAI,CAAC,EACnB;QACA;QACA,MAAMmB,YAAoB,GAAGnB,WAAW,CAAC,CAAC,CAAC;QAC3C,IAAIC,OAAO,EAAE;UACXpD,YAAY,CAACsB,MAAM,CAAC,MAAMgD,YAAY,CAAC;QACzC,CAAC,MAAM;UACLtE,YAAY,CAACiC,KAAK,CAAC,MAAM;YACvB,MAAMX,MAAM,GAAGtB,YAAY,CAACuE,SAAS,CAAC,CAAC;YACvC,OAAOC,IAAI,CAACC,GAAG,CAAC,CAAC,EAAEH,YAAY,GAAGhD,MAAM,GAAG,CAAC,CAAC;UAC/C,CAAC,CAAC;QACJ;MACF,CAAC,MAAM;QACL,MAAM,IAAIhD,KAAK,CACb,sDACF,CAAC;MACH;IACF,CAAC,CAAC;IAEF,MAAMyB,KAAK,GAAGC,YAAY,CAACI,KAAK,CAACH,OAAO,CAAC;IACzC,MAAMyE,UAAU,GAAG1E,YAAY,CAAC2E,oBAAoB,CAAC,CAAC,GAAG,CAAC;IAC1D,MAAMzD,aAAa,GAAG5E,GAAG,CAACsI,UAAU,CAACC,MAAM,CAAC,CAAC,CAAC;IAC9C,MAAMC,eAAe,GAAGxI,GAAG,CAACsI,UAAU,CAACC,MAAM,CAAC,CAAC,CAAC;IAChD;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA,MAAM1D,oBAAoB,GACxBnB,YAAY,CAAC6C,kCAAkC,CAAC,CAAC,CAAChD,MAAM,GAAG,CAAC,IAC5DG,YAAY,CAAC+C,aAAa,CAAC,CAAC;IAC9B,MAAM3B,cAAc,GAClBpB,YAAY,CAAC+E,YAAY,CAACzB,UAAU,CAAC0B,KAAK,CAACnF,MAAM,GAAG,CAAC;IACvD,MAAMoF,aAAa,GACjBjF,YAAY,CAAC+E,YAAY,CAACzB,UAAU,CAAC4B,KAAK,CAACrF,MAAM,GAAG,CAAC;IACvD,MAAMsF,iBAAiB,GAAGnF,YAAY,CAACoF,aAAa,CAAC,CAAC,KAAK,CAAC;IAC5D,MAAM/D,aAAa,GAAG,IAAAgD,sBAAa,EAACrE,YAAY,CAAC+E,YAAY,CAACM,KAAK,CAAC;IACpE,MAAMC,YAAY,GAAG,IAAAjB,sBAAa,EAACrE,YAAY,CAAC+E,YAAY,CAACQ,IAAI,CAAC;IAClE,MAAMC,WAAW,GAAGL,iBAAiB,GACjC7I,GAAG,CAACsF,OAAO,CAAC,KAAK,CAAC,GAClBX,uBAAuB,CACrBC,aAAa,EACbC,oBAAoB,EACpBC,cAAc,EACdC,aAAa,EACbrB,YAAY,CAACiD,cAAc,CAAC,CAAC,IAAI,CACnC,CAAC;IACL,MAAMwC,eAAe,GAAGN,iBAAiB,GACrC7I,GAAG,CAACsF,OAAO,CAAC,KAAK,CAAC,GAClBX,uBAAuB,CACrBC,aAAa,EACbC,oBAAoB,EACpB8D,aAAa,EACbK,YAAY,EACZtF,YAAY,CAACiD,cAAc,CAAC,CAAC,IAAI,CAAC,EAClC,IACF,CAAC;IAEL,MAAMyC,OAAO,GAAGhB,UAAU,GACtBpI,GAAG,CAAC6D,QAAS,QAAOe,aAAc,QAAOnB,KAAM,MAAK+E,eAAgB,gCAA+B5D,aAAc,mBAAkBA,aAAc,GAAE,GACnJ5E,GAAG,CAAC6D,QAAS,EAAC;IAClB,MAAMwF,OAAO,GAAGrJ,GAAG,CAAC6D,QAAS,EAAC;IAC9B,MAAMyF,MAA8B,GAAG,EAAE;IACzC,IAAIlB,UAAU,EAAE;MACdkB,MAAM,CAAC9F,IAAI,CAAC,CACVxD,GAAG,CAAC6D,QAAS,oBAAmB2E,eAAgB,cAAaA,eAAgB,gBAAe,EAC5F,MAAM,CACP,CAAC;MACF,IAAIrF,oBAAoB,EAAE;QACxBmG,MAAM,CAAC9F,IAAI,CAAC,CAAC0F,WAAW,EAAE,aAAa,CAAC,CAAC;MAC3C;MACA,IAAI9F,wBAAwB,EAAE;QAC5BkG,MAAM,CAAC9F,IAAI,CAAC,CAAC2F,eAAe,EAAE,iBAAiB,CAAC,CAAC;MACnD;IACF;IACA,IAAIpG,YAAY,IAAIA,YAAY,CAACQ,MAAM,EAAE;MACvC,MAAMgG,MAAM,GAAG,CAAC,CAAC;MACjBxG,YAAY,CAACoB,OAAO,CAAC,CAAC;QAAEpC,IAAI;QAAE0B;MAAM,CAAC,KAAK;QACxC3B,cAAc,CAACC,IAAI,CAAC;QACpB,IAAI,CAACwH,MAAM,CAACxH,IAAI,CAAC,EAAE;UACjBwH,MAAM,CAACxH,IAAI,CAAC,GAAG,EAAE;QACnB;QACAwH,MAAM,CAACxH,IAAI,CAAC,CAACyB,IAAI,CAACC,KAAK,CAAC;MAC1B,CAAC,CAAC;MACFvC,MAAM,CAACsI,IAAI,CAACD,MAAM,CAAC,CAACpF,OAAO,CAACsF,SAAS,IAAI;QACvC,MAAMC,cAAc,GAAGH,MAAM,CAACE,SAAS,CAAC;;QAExC;QACA,MAAME,UAAU,GAAG7G,qBAAqB,CAACyB,MAAM,CAC7CqF,CAAC,IAAIA,CAAC,CAAC7H,IAAI,KAAK0H,SAClB,CAAC;QACD,IAAIE,UAAU,CAACpG,MAAM,KAAK,CAAC,EAAE;UAC3B,MAAM,IAAIvB,KAAK,CACZ,GAAE0H,cAAc,CAACnG,MAAO,qCAAoCkG,SAAU,6DACzE,CAAC;QACH;QACA,IAAIE,UAAU,CAACpG,MAAM,GAAG,CAAC,EAAE;UACzB,MAAM,IAAIvB,KAAK,CACZ,GAAE2H,UAAU,CAACpG,MAAO,8CAA6CkG,SAAU,6CAC9E,CAAC;QACH;QACA,MAAMI,SAAS,GAAGF,UAAU,CAAC,CAAC,CAAC;QAE/B,MAAM/F,iBAAiB,GAAG,IAAIY,qBAAY,CACxCpC,mBAAmB,EACnBM,OAAO,EACPC,SACF,CAAC;QACDiB,iBAAiB,CAACvB,IAAI,CACpBqB,YAAY,CAACM,kBAAkB,CAAC,CAAC,EACjCN,YAAY,CAACO,aAAa,CAAC,CAC7B,CAAC;QAED,KAAK,IAAIQ,CAAC,GAAG,CAAC,EAAEC,CAAC,GAAGgF,cAAc,CAACnG,MAAM,EAAEkB,CAAC,GAAGC,CAAC,EAAED,CAAC,EAAE,EAAE;UACrDiF,cAAc,CAACjF,CAAC,CAAC,CAACb,iBAAiB,CAAC;QACtC;;QAEA;QACA,MAAMkG,aAAa,GAAGD,SAAS,CAACpG,KAAK,CAAC;UACpCC,YAAY;UACZE,iBAAiB;UACjBD;QACF,CAAC,CAAC;QAEF2F,MAAM,CAAC9F,IAAI,CAAC,CAACsG,aAAa,EAAEL,SAAS,CAAC,CAAC;MACzC,CAAC,CAAC;IACJ;IACA,IAAI9F,OAAO,CAACwC,sBAAsB,EAAE;MAClC,OAAOnG,GAAG,CAAC6D,QAAS,GAAEuF,OAAQ,WAAUpJ,GAAG,CAAC0G,IAAI,CAC9C4C,MAAM,CAACtD,GAAG,CACR,CAAC,CAACQ,IAAI,EAAEuD,KAAK,CAAC,KAAK/J,GAAG,CAAC6D,QAAS,GAAE2C,IAAK,OAAMxG,GAAG,CAACsI,UAAU,CAACyB,KAAK,CAAE,EACrE,CAAC,EACD,IACF,CAAE,IAAGV,OAAQ,EAAC;IAChB,CAAC,MAAM;MACL,OAAOrJ,GAAG,CAAC6D,QAAS,GAAEuF,OAAQ,WAAU1F,YAAY,CAACsG,gBAAgB,CACnEV,MACF,CAAE,IAAGD,OAAQ,EAAC;IAChB;EACF,CAAC,MAAM;IACL,MAAM5F,KAAK,GAAGC,YAAY,CAACI,KAAK,CAACH,OAAO,CAAC;IACzC,OAAOF,KAAK;EACd;AACF,CAAC;AAAAwG,OAAA,CAAArJ,OAAA,GAAAuB,QAAA"}

package/node8plus/utils.js

@@ -4,27 +4,27 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.parseTags = void 0;
-
 const parseTags = str => {
   return str.split(/\r?\n/).reduce((prev, curr) => {
     if (prev.text !== "") {
-      return { ...prev,
+      return {
+        ...prev,
         text: `${prev.text}\n${curr}`
       };
     }
-
     const match = curr.match(/^@[a-zA-Z][a-zA-Z0-9_]*($|\s)/);
-
     if (!match) {
-      return { ...prev,
+      return {
+        ...prev,
         text: curr
       };
     }
-
     const key = match[0].slice(1).trim();
     const value = match[0] === curr ? true : curr.replace(match[0], "");
-    return { ...prev,
-      tags: { ...prev.tags,
+    return {
+      ...prev,
+      tags: {
+        ...prev.tags,
         [key]: !Object.prototype.hasOwnProperty.call(prev.tags, key) ? value : Array.isArray(prev.tags[key]) ? [...prev.tags[key], value] : [prev.tags[key], value]
       }
     };
@@ -33,6 +33,5 @@ const parseTags = str => {
     text: ""
   });
 };
-
 exports.parseTags = parseTags;
 //# sourceMappingURL=utils.js.map

package/node8plus/utils.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/utils.js"],"names":["parseTags","str","split","reduce","prev","curr","text","match","key","slice","trim","value","replace","tags","Object","prototype","hasOwnProperty","call","Array","isArray"],"mappings":";;;;;;;AACO,MAAMA,SAAS,GAAIC,GAAD,IAAiB;AACxC,SAAOA,GAAG,CAACC,KAAJ,CAAU,OAAV,EAAmBC,MAAnB,CACL,CAACC,IAAD,EAAOC,IAAP,KAAgB;AACd,QAAID,IAAI,CAACE,IAAL,KAAc,EAAlB,EAAsB;AACpB,aAAO,EAAE,GAAGF,IAAL;AAAWE,QAAAA,IAAI,EAAG,GAAEF,IAAI,CAACE,IAAK,KAAID,IAAK;AAAvC,OAAP;AACD;;AACD,UAAME,KAAK,GAAGF,IAAI,CAACE,KAAL,CAAW,+BAAX,CAAd;;AACA,QAAI,CAACA,KAAL,EAAY;AACV,aAAO,EAAE,GAAGH,IAAL;AAAWE,QAAAA,IAAI,EAAED;AAAjB,OAAP;AACD;;AACD,UAAMG,GAAG,GAAGD,KAAK,CAAC,CAAD,CAAL,CAASE,KAAT,CAAe,CAAf,EAAkBC,IAAlB,EAAZ;AACA,UAAMC,KAAK,GAAGJ,KAAK,CAAC,CAAD,CAAL,KAAaF,IAAb,GAAoB,IAApB,GAA2BA,IAAI,CAACO,OAAL,CAAaL,KAAK,CAAC,CAAD,CAAlB,EAAuB,EAAvB,CAAzC;AACA,WAAO,EACL,GAAGH,IADE;AAELS,MAAAA,IAAI,EAAE,EACJ,GAAGT,IAAI,CAACS,IADJ;AAEJ,SAACL,GAAD,GAAO,CAACM,MAAM,CAACC,SAAP,CAAiBC,cAAjB,CAAgCC,IAAhC,CAAqCb,IAAI,CAACS,IAA1C,EAAgDL,GAAhD,CAAD,GACHG,KADG,GAEHO,KAAK,CAACC,OAAN,CAAcf,IAAI,CAACS,IAAL,CAAUL,GAAV,CAAd,IACA,CAAC,GAAGJ,IAAI,CAACS,IAAL,CAAUL,GAAV,CAAJ,EAAoBG,KAApB,CADA,GAEA,CAACP,IAAI,CAACS,IAAL,CAAUL,GAAV,CAAD,EAAiBG,KAAjB;AANA;AAFD,KAAP;AAWD,GAtBI,EAuBL;AACEE,IAAAA,IAAI,EAAE,EADR;AAEEP,IAAAA,IAAI,EAAE;AAFR,GAvBK,CAAP;AA4BD,CA7BM","sourcesContent":["// @flow\nexport const parseTags = (str: string) => {\n  return str.split(/\\r?\\n/).reduce(\n    (prev, curr) => {\n      if (prev.text !== \"\") {\n        return { ...prev, text: `${prev.text}\\n${curr}` };\n      }\n      const match = curr.match(/^@[a-zA-Z][a-zA-Z0-9_]*($|\\s)/);\n      if (!match) {\n        return { ...prev, text: curr };\n      }\n      const key = match[0].slice(1).trim();\n      const value = match[0] === curr ? true : curr.replace(match[0], \"\");\n      return {\n        ...prev,\n        tags: {\n          ...prev.tags,\n          [key]: !Object.prototype.hasOwnProperty.call(prev.tags, key)\n            ? value\n            : Array.isArray(prev.tags[key])\n            ? [...prev.tags[key], value]\n            : [prev.tags[key], value],\n        },\n      };\n    },\n    {\n      tags: {},\n      text: \"\",\n    }\n  );\n};\n"],"file":"utils.js"}
+{"version":3,"file":"utils.js","names":["parseTags","str","split","reduce","prev","curr","text","match","key","slice","trim","value","replace","tags","Object","prototype","hasOwnProperty","call","Array","isArray","exports"],"sources":["../src/utils.js"],"sourcesContent":["// @flow\nexport const parseTags = (str: string) => {\n  return str.split(/\\r?\\n/).reduce(\n    (prev, curr) => {\n      if (prev.text !== \"\") {\n        return { ...prev, text: `${prev.text}\\n${curr}` };\n      }\n      const match = curr.match(/^@[a-zA-Z][a-zA-Z0-9_]*($|\\s)/);\n      if (!match) {\n        return { ...prev, text: curr };\n      }\n      const key = match[0].slice(1).trim();\n      const value = match[0] === curr ? true : curr.replace(match[0], \"\");\n      return {\n        ...prev,\n        tags: {\n          ...prev.tags,\n          [key]: !Object.prototype.hasOwnProperty.call(prev.tags, key)\n            ? value\n            : Array.isArray(prev.tags[key])\n            ? [...prev.tags[key], value]\n            : [prev.tags[key], value],\n        },\n      };\n    },\n    {\n      tags: {},\n      text: \"\",\n    }\n  );\n};\n"],"mappings":";;;;;;AACO,MAAMA,SAAS,GAAIC,GAAW,IAAK;EACxC,OAAOA,GAAG,CAACC,KAAK,CAAC,OAAO,CAAC,CAACC,MAAM,CAC9B,CAACC,IAAI,EAAEC,IAAI,KAAK;IACd,IAAID,IAAI,CAACE,IAAI,KAAK,EAAE,EAAE;MACpB,OAAO;QAAE,GAAGF,IAAI;QAAEE,IAAI,EAAG,GAAEF,IAAI,CAACE,IAAK,KAAID,IAAK;MAAE,CAAC;IACnD;IACA,MAAME,KAAK,GAAGF,IAAI,CAACE,KAAK,CAAC,+BAA+B,CAAC;IACzD,IAAI,CAACA,KAAK,EAAE;MACV,OAAO;QAAE,GAAGH,IAAI;QAAEE,IAAI,EAAED;MAAK,CAAC;IAChC;IACA,MAAMG,GAAG,GAAGD,KAAK,CAAC,CAAC,CAAC,CAACE,KAAK,CAAC,CAAC,CAAC,CAACC,IAAI,CAAC,CAAC;IACpC,MAAMC,KAAK,GAAGJ,KAAK,CAAC,CAAC,CAAC,KAAKF,IAAI,GAAG,IAAI,GAAGA,IAAI,CAACO,OAAO,CAACL,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IACnE,OAAO;MACL,GAAGH,IAAI;MACPS,IAAI,EAAE;QACJ,GAAGT,IAAI,CAACS,IAAI;QACZ,CAACL,GAAG,GAAG,CAACM,MAAM,CAACC,SAAS,CAACC,cAAc,CAACC,IAAI,CAACb,IAAI,CAACS,IAAI,EAAEL,GAAG,CAAC,GACxDG,KAAK,GACLO,KAAK,CAACC,OAAO,CAACf,IAAI,CAACS,IAAI,CAACL,GAAG,CAAC,CAAC,GAC7B,CAAC,GAAGJ,IAAI,CAACS,IAAI,CAACL,GAAG,CAAC,EAAEG,KAAK,CAAC,GAC1B,CAACP,IAAI,CAACS,IAAI,CAACL,GAAG,CAAC,EAAEG,KAAK;MAC5B;IACF,CAAC;EACH,CAAC,EACD;IACEE,IAAI,EAAE,CAAC,CAAC;IACRP,IAAI,EAAE;EACR,CACF,CAAC;AACH,CAAC;AAACc,OAAA,CAAApB,SAAA,GAAAA,SAAA"}