@sdk-it/spec 0.20.0 → 0.21.0

package/dist/lib/pagination/pagination-result.js

@@ -0,0 +1,237 @@
+import pluralize from "pluralize";
+const PRIMARY_TOP_TIER_KEYWORDS = [
+  "data",
+  "items",
+  "results",
+  "value"
+];
+const PRIMARY_OTHER_KEYWORDS = [
+  "records",
+  "content",
+  "list",
+  "payload",
+  "entities",
+  "collection",
+  "users",
+  "products",
+  "orders",
+  "bookings",
+  "articles",
+  "posts",
+  "documents",
+  "events"
+];
+const SECONDARY_KEYWORDS = ["entries", "rows", "elements"];
+const PLURAL_DEPRIORITIZE_LIST = [
+  "status",
+  "success",
+  "address",
+  "details",
+  "properties",
+  "params",
+  "headers",
+  "cookies",
+  "series",
+  "links",
+  "meta",
+  "metadata",
+  "statistics",
+  "settings",
+  "options",
+  "permissions",
+  "credentials",
+  "diagnostics",
+  "warnings",
+  "errors",
+  "actions",
+  "attributes",
+  "categories",
+  "features",
+  "includes",
+  "tags"
+];
+const HAS_MORE_PRIMARY_POSITIVE_EXACT = [
+  "hasmore",
+  "hasnext",
+  "hasnextpage",
+  "moreitems",
+  "moreitemsavailable",
+  "nextpage",
+  "nextpageexists",
+  "nextpageavailable",
+  "hasadditionalresults",
+  "moreresultsavailable",
+  "canloadmore",
+  "hasadditional",
+  "additionalitems",
+  "fetchmore"
+];
+const HAS_MORE_SECONDARY_POSITIVE_EXACT = ["more", "next"];
+const HAS_MORE_PRIMARY_INVERTED_EXACT = [
+  "islast",
+  "lastpage",
+  "endofresults",
+  "endoflist",
+  "nomoreitems",
+  "nomoredata",
+  "allitemsloaded",
+  "iscomplete",
+  "completed"
+];
+const HAS_MORE_POSITIVE_REGEX_PATTERNS = [
+  "\\bhas_?more\\b",
+  "\\bhas_?next\\b",
+  // e.g., itemsHasNext, items_has_next
+  "\\bmore_?items\\b",
+  "\\bnext_?page\\b",
+  // e.g., userNextPageFlag
+  "\\badditional\\b",
+  // e.g., hasAdditionalData, additional_results_exist
+  "\\bcontinuation\\b",
+  // e.g., continuationAvailable, has_continuation_token
+  "\\bmore_?results\\b",
+  "\\bpage_?available\\b",
+  "\\bnext(?:_?(page))?\\b"
+];
+const COMPILED_HAS_MORE_POSITIVE_REGEXES = HAS_MORE_POSITIVE_REGEX_PATTERNS.map((p) => new RegExp(p, "i"));
+const HAS_MORE_INVERTED_REGEX_PATTERNS = [
+  "\\bis_?last\\b",
+  // e.g., pageIsLast
+  "\\blast_?page\\b",
+  // e.g., resultsAreLastPage
+  "\\bend_?of_?(data|results|list|items|stream)\\b",
+  "\\bno_?more_?(items|data|results)?\\b",
+  "\\ball_?(items_?)?loaded\\b",
+  "\\bis_?complete\\b"
+];
+const COMPILED_HAS_MORE_INVERTED_REGEXES = HAS_MORE_INVERTED_REGEX_PATTERNS.map((p) => new RegExp(p, "i"));
+function getItemsName(properties) {
+  const arrayPropertyNames = [];
+  for (const propName in properties) {
+    if (propName in properties) {
+      const propSchema = properties[propName];
+      if (propSchema && propSchema.type === "array") {
+        arrayPropertyNames.push(propName);
+      }
+    }
+  }
+  if (arrayPropertyNames.length === 0) {
+    return null;
+  }
+  if (arrayPropertyNames.length === 1) {
+    return arrayPropertyNames[0];
+  }
+  let bestCandidate = null;
+  let candidateRank = Infinity;
+  const updateCandidate = (propName, rank) => {
+    if (rank < candidateRank) {
+      bestCandidate = propName;
+      candidateRank = rank;
+    }
+  };
+  for (const propName of arrayPropertyNames) {
+    const lowerPropName = propName.toLowerCase();
+    if (PRIMARY_TOP_TIER_KEYWORDS.includes(lowerPropName)) {
+      updateCandidate(propName, 2);
+      continue;
+    }
+    if (candidateRank > 3 && PRIMARY_OTHER_KEYWORDS.includes(lowerPropName)) {
+      updateCandidate(propName, 3);
+      continue;
+    }
+    if (candidateRank > 4 && SECONDARY_KEYWORDS.includes(lowerPropName)) {
+      updateCandidate(propName, 4);
+      continue;
+    }
+    if (candidateRank > 5 && pluralize.isPlural(propName) && !PLURAL_DEPRIORITIZE_LIST.includes(lowerPropName)) {
+      updateCandidate(propName, 5);
+      continue;
+    }
+    if (candidateRank > 6 && pluralize.isPlural(propName) && PLURAL_DEPRIORITIZE_LIST.includes(lowerPropName)) {
+      updateCandidate(propName, 6);
+      continue;
+    }
+  }
+  if (bestCandidate) {
+    return bestCandidate;
+  }
+  return arrayPropertyNames[0];
+}
+function guess(properties) {
+  const booleanPropertyNames = [];
+  for (const propName in properties) {
+    if (Object.prototype.hasOwnProperty.call(properties, propName)) {
+      const propSchema = properties[propName];
+      if (propSchema && propSchema.type === "boolean" || propSchema.type === "integer") {
+        booleanPropertyNames.push(propName);
+      }
+    }
+  }
+  if (booleanPropertyNames.length === 0) {
+    return null;
+  }
+  if (booleanPropertyNames.length === 1) {
+    return booleanPropertyNames[0];
+  }
+  let bestCandidate = null;
+  let candidateRank = Infinity;
+  const updateCandidate = (propName, rank) => {
+    if (rank < candidateRank) {
+      bestCandidate = propName;
+      candidateRank = rank;
+    }
+  };
+  for (const propName of booleanPropertyNames) {
+    const normalizedForExactMatch = propName.toLowerCase().replace(/[-_]/g, "");
+    let currentPropRank = Infinity;
+    if (HAS_MORE_PRIMARY_POSITIVE_EXACT.includes(normalizedForExactMatch)) {
+      currentPropRank = 1;
+    } else if (HAS_MORE_SECONDARY_POSITIVE_EXACT.includes(normalizedForExactMatch)) {
+      currentPropRank = 2;
+    } else {
+      let foundPositiveRegex = false;
+      for (const regex of COMPILED_HAS_MORE_POSITIVE_REGEXES) {
+        if (regex.test(propName)) {
+          currentPropRank = 3;
+          foundPositiveRegex = true;
+          break;
+        }
+      }
+      if (!foundPositiveRegex) {
+        if (HAS_MORE_PRIMARY_INVERTED_EXACT.includes(normalizedForExactMatch)) {
+          currentPropRank = 4;
+        } else {
+          for (const regex of COMPILED_HAS_MORE_INVERTED_REGEXES) {
+            if (regex.test(propName)) {
+              currentPropRank = 5;
+              break;
+            }
+          }
+        }
+      }
+    }
+    updateCandidate(propName, currentPropRank);
+  }
+  return bestCandidate;
+}
+function getHasMoreName(properties) {
+  const rootGuess = guess(properties);
+  if (rootGuess) {
+    return rootGuess;
+  }
+  for (const propName in properties) {
+    const propSchema = properties[propName];
+    if (propSchema.type === "object" && propSchema.properties) {
+      const nested = getHasMoreName(propSchema.properties);
+      if (nested) {
+        return propName + "." + nested;
+      }
+    }
+  }
+  return null;
+}
+export {
+  getHasMoreName,
+  getItemsName
+};
+//# sourceMappingURL=pagination-result.js.map

package/dist/lib/pagination/pagination-result.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../../../src/lib/pagination/pagination-result.ts"],
+  "sourcesContent": ["import type { SchemaObject, SchemasObject } from 'openapi3-ts/oas31';\nimport pluralize from 'pluralize';\n\nconst PRIMARY_TOP_TIER_KEYWORDS: string[] = [\n  'data',\n  'items',\n  'results',\n  'value',\n];\nconst PRIMARY_OTHER_KEYWORDS: string[] = [\n  'records',\n  'content',\n  'list',\n  'payload',\n  'entities',\n  'collection',\n  'users',\n  'products',\n  'orders',\n  'bookings',\n  'articles',\n  'posts',\n  'documents',\n  'events',\n];\nconst SECONDARY_KEYWORDS: string[] = ['entries', 'rows', 'elements'];\n\nconst PLURAL_DEPRIORITIZE_LIST: string[] = [\n  'status',\n  'success',\n  'address',\n  'details',\n  'properties',\n  'params',\n  'headers',\n  'cookies',\n  'series',\n  'links',\n  'meta',\n  'metadata',\n  'statistics',\n  'settings',\n  'options',\n  'permissions',\n  'credentials',\n  'diagnostics',\n  'warnings',\n  'errors',\n  'actions',\n  'attributes',\n  'categories',\n  'features',\n  'includes',\n  'tags',\n];\n\n// For exact matches (normalized: lowercase, no underscores/hyphens)\nconst HAS_MORE_PRIMARY_POSITIVE_EXACT: string[] = [\n  'hasmore',\n  'hasnext',\n  'hasnextpage',\n  'moreitems',\n  'moreitemsavailable',\n  'nextpage',\n  'nextpageexists',\n  'nextpageavailable',\n  'hasadditionalresults',\n  'moreresultsavailable',\n  'canloadmore',\n  'hasadditional',\n  'additionalitems',\n  'fetchmore',\n];\n\nconst HAS_MORE_SECONDARY_POSITIVE_EXACT: string[] = ['more', 'next'];\n\nconst HAS_MORE_PRIMARY_INVERTED_EXACT: string[] = [\n  'islast',\n  'lastpage',\n  'endofresults',\n  'endoflist',\n  'nomoreitems',\n  'nomoredata',\n  'allitemsloaded',\n  'iscomplete',\n  'completed',\n];\n\n// For regex-based sub-phrase matching (tested against original propName, case-insensitive)\n// These regexes look for meaningful phrases, often using word boundaries (\\b)\n// and allowing for optional underscores.\nconst HAS_MORE_POSITIVE_REGEX_PATTERNS: string[] = [\n  '\\\\bhas_?more\\\\b',\n  '\\\\bhas_?next\\\\b', // e.g., itemsHasNext, items_has_next\n  '\\\\bmore_?items\\\\b',\n  '\\\\bnext_?page\\\\b', // e.g., userNextPageFlag\n  '\\\\badditional\\\\b', // e.g., hasAdditionalData, additional_results_exist\n  '\\\\bcontinuation\\\\b', // e.g., continuationAvailable, has_continuation_token\n  '\\\\bmore_?results\\\\b',\n  '\\\\bpage_?available\\\\b',\n  '\\\\bnext(?:_?(page))?\\\\b',\n];\nconst COMPILED_HAS_MORE_POSITIVE_REGEXES: RegExp[] =\n  HAS_MORE_POSITIVE_REGEX_PATTERNS.map((p) => new RegExp(p, 'i'));\n\nconst HAS_MORE_INVERTED_REGEX_PATTERNS: string[] = [\n  '\\\\bis_?last\\\\b', // e.g., pageIsLast\n  '\\\\blast_?page\\\\b', // e.g., resultsAreLastPage\n  '\\\\bend_?of_?(data|results|list|items|stream)\\\\b',\n  '\\\\bno_?more_?(items|data|results)?\\\\b',\n  '\\\\ball_?(items_?)?loaded\\\\b',\n  '\\\\bis_?complete\\\\b',\n];\nconst COMPILED_HAS_MORE_INVERTED_REGEXES: RegExp[] =\n  HAS_MORE_INVERTED_REGEX_PATTERNS.map((p) => new RegExp(p, 'i'));\n\n/**\n * Tries to guess the name of the property that holds the main list of items\n * within an object schema using a series of heuristics.\n *\n * @param schema The OpenAPI SchemaObject, expected to be of type 'object'.\n * @returns The name of the most likely property containing the items array,\n *          or null if no array properties are found in the schema.\n */\nexport function getItemsName(\n  properties: Record<string, SchemaObject>,\n): string | null {\n  const arrayPropertyNames: string[] = [];\n  for (const propName in properties) {\n    if (propName in properties) {\n      const propSchema = properties[propName] as SchemaObject;\n      if (propSchema && propSchema.type === 'array') {\n        arrayPropertyNames.push(propName);\n      }\n    }\n  }\n\n  // Heuristic 0: No array properties at all.\n  if (arrayPropertyNames.length === 0) {\n    return null;\n  }\n\n  // Heuristic 1: Exactly one array property. This is the strongest signal.\n  if (arrayPropertyNames.length === 1) {\n    return arrayPropertyNames[0];\n  }\n\n  // Multiple array properties exist. Apply ranked heuristics:\n  let bestCandidate: string | null = null;\n  let candidateRank = Infinity; // Lower is better\n\n  const updateCandidate = (propName: string, rank: number) => {\n    if (rank < candidateRank) {\n      bestCandidate = propName;\n      candidateRank = rank;\n    }\n  };\n\n  for (const propName of arrayPropertyNames) {\n    const lowerPropName = propName.toLowerCase();\n\n    // Heuristic 2: Top-tier primary keywords (e.g., \"data\", \"items\")\n    if (PRIMARY_TOP_TIER_KEYWORDS.includes(lowerPropName)) {\n      updateCandidate(propName, 2);\n      continue; // Move to next property, this is a strong match for this prop\n    }\n\n    // Heuristic 3: Other primary keywords\n    if (candidateRank > 3 && PRIMARY_OTHER_KEYWORDS.includes(lowerPropName)) {\n      updateCandidate(propName, 3);\n      continue;\n    }\n\n    // Heuristic 4: Secondary keywords\n    if (candidateRank > 4 && SECONDARY_KEYWORDS.includes(lowerPropName)) {\n      updateCandidate(propName, 4);\n      continue;\n    }\n\n    // Heuristic 5: Pluralized name, not on the deprioritize list\n    if (\n      candidateRank > 5 &&\n      pluralize.isPlural(propName) &&\n      !PLURAL_DEPRIORITIZE_LIST.includes(lowerPropName)\n    ) {\n      updateCandidate(propName, 5);\n      continue;\n    }\n\n    // Heuristic 6: Pluralized name, IS on the deprioritize list (less preferred plural)\n    if (\n      candidateRank > 6 &&\n      pluralize.isPlural(propName) &&\n      PLURAL_DEPRIORITIZE_LIST.includes(lowerPropName)\n    ) {\n      updateCandidate(propName, 6);\n      continue;\n    }\n  }\n\n  // If any of the above heuristics found a candidate, return it.\n  if (bestCandidate) {\n    return bestCandidate;\n  }\n\n  // Heuristic 7: Fallback - If no keywords or clear plurals,\n  // and multiple arrays exist, return the first array property encountered.\n  // This ensures we always return a name if arrays are present.\n  return arrayPropertyNames[0];\n}\n\nfunction guess(properties: Record<string, SchemaObject>) {\n  const booleanPropertyNames: string[] = [];\n  for (const propName in properties) {\n    if (Object.prototype.hasOwnProperty.call(properties, propName)) {\n      const propSchema = properties[propName] as SchemaObject;\n      if (\n        (propSchema && propSchema.type === 'boolean') ||\n        propSchema.type === 'integer'\n      ) {\n        booleanPropertyNames.push(propName);\n      }\n    }\n  }\n\n  if (booleanPropertyNames.length === 0) {\n    return null;\n  }\n\n  if (booleanPropertyNames.length === 1) {\n    return booleanPropertyNames[0];\n  }\n\n  let bestCandidate: string | null = null;\n  let candidateRank = Infinity;\n\n  const updateCandidate = (propName: string, rank: number) => {\n    if (rank < candidateRank) {\n      bestCandidate = propName;\n      candidateRank = rank;\n    }\n  };\n\n  for (const propName of booleanPropertyNames) {\n    const normalizedForExactMatch = propName.toLowerCase().replace(/[-_]/g, '');\n    let currentPropRank = Infinity;\n\n    // Rank 1: Primary Exact Positive Match\n    if (HAS_MORE_PRIMARY_POSITIVE_EXACT.includes(normalizedForExactMatch)) {\n      currentPropRank = 1;\n    }\n    // Rank 2: Secondary Exact Positive Match\n    else if (\n      HAS_MORE_SECONDARY_POSITIVE_EXACT.includes(normalizedForExactMatch)\n    ) {\n      currentPropRank = 2;\n    }\n    // Rank 3: Positive Regex Match (sub-phrase)\n    else {\n      let foundPositiveRegex = false;\n      for (const regex of COMPILED_HAS_MORE_POSITIVE_REGEXES) {\n        if (regex.test(propName)) {\n          // Test against original propName\n          currentPropRank = 3;\n          foundPositiveRegex = true;\n          break;\n        }\n      }\n\n      // Only proceed to inverted matches if no positive match of any kind (Rank 1, 2, or 3) was found\n      if (!foundPositiveRegex) {\n        // Rank 4: Primary Exact Inverted Match\n        if (HAS_MORE_PRIMARY_INVERTED_EXACT.includes(normalizedForExactMatch)) {\n          currentPropRank = 4;\n        }\n        // Rank 5: Inverted Regex Match (sub-phrase)\n        else {\n          for (const regex of COMPILED_HAS_MORE_INVERTED_REGEXES) {\n            if (regex.test(propName)) {\n              // Test against original propName\n              currentPropRank = 5;\n              break;\n            }\n          }\n        }\n      }\n    }\n\n    updateCandidate(propName, currentPropRank);\n  }\n  return bestCandidate;\n}\n\n/**\n * Tries to guess the name of a boolean property that indicates if there are more items\n * to fetch (e.g., for pagination).\n *\n * @param schema The OpenAPI SchemaObject, expected to be of type 'object'.\n * @returns The name of the most likely boolean property indicating \"has more\",\n *          or null if no suitable boolean property is found.\n */\nexport function getHasMoreName(properties: SchemasObject): string | null {\n  const rootGuess = guess(properties);\n  if (rootGuess) {\n    return rootGuess;\n  }\n  for (const propName in properties) {\n    const propSchema = properties[propName];\n    if (propSchema.type === 'object' && propSchema.properties) {\n      const nested = getHasMoreName(propSchema.properties as SchemasObject);\n      if (nested) {\n        return propName + '.' + nested;\n      }\n    }\n  }\n  return null;\n}\n"],
+  "mappings": "AACA,OAAO,eAAe;AAEtB,MAAM,4BAAsC;AAAA,EAC1C;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,yBAAmC;AAAA,EACvC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,qBAA+B,CAAC,WAAW,QAAQ,UAAU;AAEnE,MAAM,2BAAqC;AAAA,EACzC;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAGA,MAAM,kCAA4C;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAEA,MAAM,oCAA8C,CAAC,QAAQ,MAAM;AAEnE,MAAM,kCAA4C;AAAA,EAChD;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AAKA,MAAM,mCAA6C;AAAA,EACjD;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,qCACJ,iCAAiC,IAAI,CAAC,MAAM,IAAI,OAAO,GAAG,GAAG,CAAC;AAEhE,MAAM,mCAA6C;AAAA,EACjD;AAAA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF;AACA,MAAM,qCACJ,iCAAiC,IAAI,CAAC,MAAM,IAAI,OAAO,GAAG,GAAG,CAAC;AAUzD,SAAS,aACd,YACe;AACf,QAAM,qBAA+B,CAAC;AACtC,aAAW,YAAY,YAAY;AACjC,QAAI,YAAY,YAAY;AAC1B,YAAM,aAAa,WAAW,QAAQ;AACtC,UAAI,cAAc,WAAW,SAAS,SAAS;AAC7C,2BAAmB,KAAK,QAAQ;AAAA,MAClC;AAAA,IACF;AAAA,EACF;AAGA,MAAI,mBAAmB,WAAW,GAAG;AACnC,WAAO;AAAA,EACT;AAGA,MAAI,mBAAmB,WAAW,GAAG;AACnC,WAAO,mBAAmB,CAAC;AAAA,EAC7B;AAGA,MAAI,gBAA+B;AACnC,MAAI,gBAAgB;AAEpB,QAAM,kBAAkB,CAAC,UAAkB,SAAiB;AAC1D,QAAI,OAAO,eAAe;AACxB,sBAAgB;AAChB,sBAAgB;AAAA,IAClB;AAAA,EACF;AAEA,aAAW,YAAY,oBAAoB;AACzC,UAAM,gBAAgB,SAAS,YAAY;AAG3C,QAAI,0BAA0B,SAAS,aAAa,GAAG;AACrD,sBAAgB,UAAU,CAAC;AAC3B;AAAA,IACF;AAGA,QAAI,gBAAgB,KAAK,uBAAuB,SAAS,aAAa,GAAG;AACvE,sBAAgB,UAAU,CAAC;AAC3B;AAAA,IACF;AAGA,QAAI,gBAAgB,KAAK,mBAAmB,SAAS,aAAa,GAAG;AACnE,sBAAgB,UAAU,CAAC;AAC3B;AAAA,IACF;AAGA,QACE,gBAAgB,KAChB,UAAU,SAAS,QAAQ,KAC3B,CAAC,yBAAyB,SAAS,aAAa,GAChD;AACA,sBAAgB,UAAU,CAAC;AAC3B;AAAA,IACF;AAGA,QACE,gBAAgB,KAChB,UAAU,SAAS,QAAQ,KAC3B,yBAAyB,SAAS,aAAa,GAC/C;AACA,sBAAgB,UAAU,CAAC;AAC3B;AAAA,IACF;AAAA,EACF;AAGA,MAAI,eAAe;AACjB,WAAO;AAAA,EACT;AAKA,SAAO,mBAAmB,CAAC;AAC7B;AAEA,SAAS,MAAM,YAA0C;AACvD,QAAM,uBAAiC,CAAC;AACxC,aAAW,YAAY,YAAY;AACjC,QAAI,OAAO,UAAU,eAAe,KAAK,YAAY,QAAQ,GAAG;AAC9D,YAAM,aAAa,WAAW,QAAQ;AACtC,UACG,cAAc,WAAW,SAAS,aACnC,WAAW,SAAS,WACpB;AACA,6BAAqB,KAAK,QAAQ;AAAA,MACpC;AAAA,IACF;AAAA,EACF;AAEA,MAAI,qBAAqB,WAAW,GAAG;AACrC,WAAO;AAAA,EACT;AAEA,MAAI,qBAAqB,WAAW,GAAG;AACrC,WAAO,qBAAqB,CAAC;AAAA,EAC/B;AAEA,MAAI,gBAA+B;AACnC,MAAI,gBAAgB;AAEpB,QAAM,kBAAkB,CAAC,UAAkB,SAAiB;AAC1D,QAAI,OAAO,eAAe;AACxB,sBAAgB;AAChB,sBAAgB;AAAA,IAClB;AAAA,EACF;AAEA,aAAW,YAAY,sBAAsB;AAC3C,UAAM,0BAA0B,SAAS,YAAY,EAAE,QAAQ,SAAS,EAAE;AAC1E,QAAI,kBAAkB;AAGtB,QAAI,gCAAgC,SAAS,uBAAuB,GAAG;AACrE,wBAAkB;AAAA,IACpB,WAGE,kCAAkC,SAAS,uBAAuB,GAClE;AACA,wBAAkB;AAAA,IACpB,OAEK;AACH,UAAI,qBAAqB;AACzB,iBAAW,SAAS,oCAAoC;AACtD,YAAI,MAAM,KAAK,QAAQ,GAAG;AAExB,4BAAkB;AAClB,+BAAqB;AACrB;AAAA,QACF;AAAA,MACF;AAGA,UAAI,CAAC,oBAAoB;AAEvB,YAAI,gCAAgC,SAAS,uBAAuB,GAAG;AACrE,4BAAkB;AAAA,QACpB,OAEK;AACH,qBAAW,SAAS,oCAAoC;AACtD,gBAAI,MAAM,KAAK,QAAQ,GAAG;AAExB,gCAAkB;AAClB;AAAA,YACF;AAAA,UACF;AAAA,QACF;AAAA,MACF;AAAA,IACF;AAEA,oBAAgB,UAAU,eAAe;AAAA,EAC3C;AACA,SAAO;AACT;AAUO,SAAS,eAAe,YAA0C;AACvE,QAAM,YAAY,MAAM,UAAU;AAClC,MAAI,WAAW;AACb,WAAO;AAAA,EACT;AACA,aAAW,YAAY,YAAY;AACjC,UAAM,aAAa,WAAW,QAAQ;AACtC,QAAI,WAAW,SAAS,YAAY,WAAW,YAAY;AACzD,YAAM,SAAS,eAAe,WAAW,UAA2B;AACpE,UAAI,QAAQ;AACV,eAAO,WAAW,MAAM;AAAA,MAC1B;AAAA,IACF;AAAA,EACF;AACA,SAAO;AACT;",
+  "names": []
+}

package/dist/lib/pagination/pagination-result.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=pagination-result.test.d.ts.map

package/dist/lib/pagination/pagination-result.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagination-result.test.d.ts","sourceRoot":"","sources":["../../../src/lib/pagination/pagination-result.test.ts"],"names":[],"mappings":""}